Relevant bibliographies by topics / Dynamic updates

Academic literature on the topic 'Dynamic updates'

Author: Grafiati
Published: 4 June 2021
Last updated: 28 January 2023

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

Select a source type:

Contents

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

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

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.

Full text
Abstract:
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.
APA, Harvard, Vancouver, ISO, and other styles
2

Subramanian, Suriya, Michael Hicks, and Kathryn S. McKinley. "Dynamic software updates." ACM SIGPLAN Notices 44, no. 6 (May 28, 2009): 1–12. http://dx.doi.org/10.1145/1543135.1542478.

Full text
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

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
5

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.

Full text
Abstract:
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.
APA, Harvard, Vancouver, ISO, and other styles
6

Wang, Xunhua, and David Rine. "Secure Online DNS Dynamic Updates." International Journal of Information Technology and Web Engineering 2, no. 3 (July 2007): 17–36. http://dx.doi.org/10.4018/jitwe.2007070102.

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

Jin, Xin, Hongqiang Harry Liu, Rohan Gandhi, Srikanth Kandula, Ratul Mahajan, Ming Zhang, Jennifer Rexford, and Roger Wattenhofer. "Dynamic scheduling of network updates." ACM SIGCOMM Computer Communication Review 44, no. 4 (February 25, 2015): 539–50. http://dx.doi.org/10.1145/2740070.2626307.

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

Mishra, Bhupesh Kumar, Keshav Dahal, and Zeeshan Pervez. "Dynamic Relief Items Distribution Model with Sliding Time Window in the Post-Disaster Environment." Applied Sciences 12, no. 16 (August 21, 2022): 8358. http://dx.doi.org/10.3390/app12168358.

Full text
Abstract:
In smart cities, relief items distribution is a complex task due to the factors such as incomplete information, unpredictable exact demand, lack of resources, and causality levels, to name a few. With the development of Internet of Things (IoT) technologies, dynamic data update provides the scope of distribution schedule to adopt changes with updates. Therefore, the dynamic relief items distribution schedule becomes a need to generate humanitarian supply chain schedules as a smart city application. To address the disaster data updates in different time periods, a dynamic optimised model with a sliding time window is proposed that defines the distribution schedule of relief items from multiple supply points to different disaster regions. The proposed model not only considers the details of available resources dynamically but also introduces disaster region priority along with transportation routes information updates for each scheduling time slot. Such an integrated optimised model delivers an effective distribution schedule to start with and updates it for each time slot. A set of numerical case studies is formulated to evaluate the performance of the optimised scheduling. The dynamic updates on the relief item demands’ travel path, causality level and available resources parameters have been included as performance measures for optimising the distributing schedule. The models have been evaluated based on performance measures to reflect disaster scenarios. Evaluation of the proposed models in comparison to the other perspective static and dynamic relief items distribution models shows that adopting dynamic updates in the distribution model cover most of the major aspects of the relief items distribution task in a more realistic way for post-disaster relief management. The analysis has also shown that the proposed model has the adaptability to address the changing demand and resources availability along with disaster conditions. In addition, this model will also help the decision-makers to plan the post-disaster relief operations in more effective ways by covering the updates on disaster data in each time period.
APA, Harvard, Vancouver, ISO, and other styles
9

Martinez, Sébastien, Christophe Gransart, Olivier Stienne, Virginie Deniau, and Philippe Bon. "SoREn, How Dynamic Software Update Tools Can Help Cybersecurity Systems to Improve Monitoring and Actions." JUCS - Journal of Universal Computer Science 28, no. 1 (January 28, 2022): 27–53. http://dx.doi.org/10.3897/jucs.66857.

Full text
Abstract:
Because stopping a service to apply updates raises issues, Dynamic Software Updating studies the application of updates on programs without disrupting the services they provide. This is acheived using specific mechanisms operating updating tasks such as the modification of the program state. To acheive transparency, Dynamic Software Updating systems use pre-selected and pre-configured mechanisms. Developers provide patches that are transparently converted to dynamic updates. The cost of such transparency is often that applied patches cannot modify the general semantic of the updated program. Allowing dynamic modification of the general semantic of a running program is rarely considered. In the context of protection of communications between moving vehicles and uncontrolled infrastructure, SoREn (Security REconfigurable Engine) is designed to be dynamically reconfigurable. Its semantics can transparently be modified at runtime to change the security policy it enforces. Administrators can supply new policies to trigger a reconfiguration, without developing new components. This paper details and discusses the design of SoREn, its meta-model linked to cybersecurity business concepts and its automatic reconfiguration calculator allowing transparent application of reconfigurations.
APA, Harvard, Vancouver, ISO, and other styles
10

Weerasuriya, Chathika Krishan, Rebecca Claire Harris, Christopher Finn McQuaid, Gabriela B. Gomez, and Richard G. White. "Updating age-specific contact structures to match evolving demography in a dynamic mathematical model of tuberculosis vaccination." PLOS Computational Biology 18, no. 4 (April 22, 2022): e1010002. http://dx.doi.org/10.1371/journal.pcbi.1010002.

Full text
Abstract:
We investigated the effects of updating age-specific social contact matrices to match evolving demography on vaccine impact estimates. We used a dynamic transmission model of tuberculosis in India as a case study. We modelled four incremental methods to update contact matrices over time, where each method incorporated its predecessor: fixed contact matrix (M0), preserved contact reciprocity (M1), preserved contact assortativity (M2), and preserved average contacts per individual (M3). We updated the contact matrices of a deterministic compartmental model of tuberculosis transmission, calibrated to epidemiologic data between 2000 and 2019 derived from India. We additionally calibrated the M0, M2, and M3 models to the 2050 TB incidence rate projected by the calibrated M1 model. We stratified age into three groups, children (<15y), adults (≥15y, <65y), and the elderly (≥65y), using World Population Prospects demographic data, between which we applied POLYMOD-derived social contact matrices. We simulated an M72-AS01E-like tuberculosis vaccine delivered from 2027 and estimated the per cent TB incidence rate reduction (IRR) in 2050 under each update method. We found that vaccine impact estimates in all age groups remained relatively stable between the M0–M3 models, irrespective of vaccine-targeting by age group. The maximum difference in impact, observed following adult-targeted vaccination, was 7% in the elderly, in whom we observed IRRs of 19% (uncertainty range 13–32), 20% (UR 13–31), 22% (UR 14–37), and 26% (UR 18–38) following M0, M1, M2 and M3 updates, respectively. We found that model-based TB vaccine impact estimates were relatively insensitive to demography-matched contact matrix updates in an India-like demographic and epidemiologic scenario. Current model-based TB vaccine impact estimates may be reasonably robust to the lack of contact matrix updates, but further research is needed to confirm and generalise this finding.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Dynamic updates"

1

Stoyle, Gareth Paul. "A theory of dynamic software updates." Thesis, University of Cambridge, 2007. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.612746.

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

Spetz-Nyström, Simon. "Dynamic updates of mobile apps using JavaScript." Thesis, Linköpings universitet, Programvara och system, 2015. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-119351.

Full text
Abstract:
Updates are a natural part of the life cycle of an application. The traditional way of updating an application by stopping it, replacing it with the new version and restarting it is lacking in many ways. There have been previous research in the field of dynamic software updates (DSU) that attempt to salvage this problem by updating the app while running. Most of the previous research have focused on static languages like C and Java, research with dynamic languages have been lacking. This thesis takes advantage of the dynamic features of JavaScript in order to allow for dynamic updates of applications for mobile devices. The solution is implemented and used to answer questions about how correctness can be ensured and what state transfer needs to be manually written by a programmer. The conclusion is that most failures that occur as the result of an update and is in need of a manually written state transfer can be put into one of three categories. To verify correctness of an update tests for these types of failures should be performed.
APA, Harvard, Vancouver, ISO, and other styles
3

Kim, Dong Kwan. "Applying Dynamic Software Updates to Computationally-Intensive Applications." Diss., Virginia Tech, 2009. http://hdl.handle.net/10919/28206.

Full text
Abstract:
Dynamic software updates change the code of a computer program while it runs, thus saving the programmerâ s time and using computing resources more productively. This dissertation establishes the value of and recommends practices for applying dynamic software updates to computationally-intensive applicationsâ a computing domain characterized by long-running computations, expensive computing resources, and a tedious deployment process. This dissertation argues that updating computationally-intensive applications dynamically can reduce their time-to-discovery metricsâ the total time it takes from posing a problem to arriving at a solutionâ and, as such, should become an intrinsic part of their software lifecycle. To support this claim, this dissertation presents the following technical contributions: (1) a distributed consistency algorithm for synchronizing dynamic software updates in a parallel HPC application, (2) an implementation of the Proxy design pattern that is more efficient than the existing implementations, and (3) a dynamic update approach for Java Virtual Machine (JVM)-based applications using the Proxy pattern to offer flexibility and efficiency advantages, making it suitable for computationally-intensive applications. The contributions of this dissertation are validated through performance benchmarks and case studies involving computationally-intensive applications from the bioinformatics and molecular dynamics simulation domains.
Ph. D.
APA, Harvard, Vancouver, ISO, and other styles
4

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
5

Pukall, Mario [Verfasser], and Gunter [Akademischer Betreuer] Saake. "JAVADAPTOR : unrestricted dynamic updates of Java applications / Mario Pukall. Betreuer: Gunter Saake." Magdeburg : Universitätsbibliothek, 2012. http://d-nb.info/1051445507/34.

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

Narra, Hemanth, and Egemen K. Çetinkaya. "Performance Analysis of AeroRP with Ground Station Updates in Highly-Dynamic Airborne Telemetry Networks." International Foundation for Telemetering, 2011. http://hdl.handle.net/10150/595669.

Full text
Abstract:
ITC/USA 2011 Conference Proceedings / The Forty-Seventh Annual International Telemetering Conference and Technical Exhibition / October 24-27, 2011 / Bally's Las Vegas, Las Vegas, Nevada
Highly dynamic airborne telemetry networks pose unique challenges for data transmission. Domain-specific multi-hop routing protocols are necessary to cope with these challenges and AeroRP is one such protocol. In this paper, we discuss the operation of various AeroRP modes and analyse their performance using the ns-3 network simulator. We compare the performance of beacon, beaconless, and ground station (GS) modes of AeroRP. The simulation results show the advantages of having a domain-specific routing protocol and also highlight the importance of ground station updates in discovering routes.
APA, Harvard, Vancouver, ISO, and other styles
7

Keppeler, Jens. "Answering Conjunctive Queries and FO+MOD Queries under Updates." Doctoral thesis, Humboldt-Universität zu Berlin, 2020. http://dx.doi.org/10.18452/21483.

Full text
Abstract:
In dieser Arbeit wird das dynamische Auswertungsproblem über dynamische Datenbanken betrachtet, bei denen Tupel hinzugefügt oder gelöscht werden können. Die Aufgabe besteht darin einen dynamischen Algorithmus zu konstruieren, welcher unmittelbar nachdem die Datenbank aktualisiert wurde, die Datenstruktur, die das Resultat repräsentiert, aktualisiert. Die Datenstruktur soll in konstanter Zeit aktualisiert werden und das Folgende unterstützen: * Teste in konstanter Zeit ob ein Tupel zur Ausgabemenge gehört, * gebe die Anzahl der Tupel in der Ausgabemenge in konstanter Zeit aus, * zähle die Tupel aus der Ausgabemenge mit konstanter Taktung auf und * zähle den Unterschied zwischen der neuen und der alten Ausgabemenge mit konstanter Taktung auf. Im ersten Teil werden konjunktive Anfragen und Vereinigungen konjunktiver Anfragen auf relationalen Datenbanken betrachtet. Die Idee der q-hierarchischen Anfragen (und t-hierarchische Anfragen für das Testen) wird eingeführt und es wird gezeigt, dass das Resultat für jede q-hierarchische Anfrage auf dynamischen Datenbanken effizient in dem oben beschriebenen Szenario ausgewertet werden können. Konjunktive Anfragen mit Aggregaten werden weiterhin betrachtet. Es wird gezeigt, dass das Lernen von polynomiellen Regressionsfunktionen in konstanter Zeit vorbereitet werden kann, falls die Trainingsdaten aus dem Anfrageergebnis kommen. Mit logarithmischer Update-Zeit kann folgende Routine unterstützt werden: Bei Eingabe einer Zahl j, gebe das j-te Tupel aus der Aufzählung aus. Im zweiten Teil werden Anfragen, die Formeln der Logik erster Stufe (FO) und deren Erweiterung mit Modulo-Zähl Quantoren (FO+MOD) sind, betrachtet, und es wird gezeigt, dass diese effizient unter Aktualisierungen ausgewertet können, wobei die dynamische Datenbank die Gradschranke nicht überschreitet, und bei der Auswertung die Zähl-, Test-, Aufzähl- und die Unterschied-Routine unterstützt werden.
This thesis investigates the query evaluation problem for fixed queries over fully dynamic databases, where tuples can be inserted or deleted. The task is to design a dynamic algorithm that immediately reports the new result of a fixed query after every database update. In particular, the goal is to construct a data structure that allows to support the following scenario. After every database update, the data structure can be updated in constant time such that afterwards we are able * to test within constant time for a given tuple whether or not it belongs to the query result, * to output the number of tuples in the query result, * to enumerate all tuples in the new query result with constant delay and * to enumerate the difference between the old and the new query result with constant delay. In the first part, conjunctive queries and unions of conjunctive queries on arbitrary relational databases are considered. The notion of q-hierarchical conjunctive queries (and t-hierarchical conjunctive queries for testing) is introduced and it is shown that the result of each such query on a dynamic database can be maintained efficiently in the sense described above. Moreover, this notion is extended to aggregate queries. It is shown that the preparation of learning a polynomial regression function can be done in constant time if the training data are taken (and maintained under updates) from the query result of a q-hierarchical query. With logarithmic update time the following routine is supported: upon input of a natural number j, output the j-th tuple that will be enumerated. In the second part, queries in first-order logic (FO) and its extension with modulo-counting quantifiers (FO+MOD) are considered, and it is shown that they can be efficiently evaluated under updates, provided that the dynamic database does not exceed a certain degree bound, and the counting, testing, enumeration and difference routines is supported.
APA, Harvard, Vancouver, ISO, and other styles
8

Bergmark, Max. "Designing a performant real-time modular dynamic pricing system : Studying the performance of a dynamic pricing system which updates in real-time, and its application within the golfing industry." Thesis, KTH, Skolan för elektroteknik och datavetenskap (EECS), 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-276241.

Full text
Abstract:
In many industries, the prices of products are dynamically calculated to maximize revenue while keeping customer satisfaction. In this paper, an approach of online calculation of prices is investigated, where customers always receive an updated price. The most common method used today is to update prices with some interval, and present that price to the customer. This standard method provides fast responses, and accurate responses for the most part. However, if the dynamic pricing model could benefit from very fast price updates, an online calculation approach might provide better price accuracy. The main advantages of this approach is the combination of short term accuracy and long term stability. Short term behaviour is handled by the online price calculation with real-time updates, while long term behaviour is handled by statistical analysis of booking behaviour, which is condensed into a demand curve. In this paper, the long term statistical analysis for calculating demand curves is described, along with the benefit of short term price adjustments which can be beneficial both for producers and consumers.
I många industrier räknas priset för produkterna ut dynamiskt för att maximera intäkterna samtidigt som kundnöjdheten bibehålls. I denna rapport så undersökt en metod för realtidsberäkningar av priser i en dynamisk kontext, där kunder alltid får uppdaterade priser. Den vanligaste metoden för dynamisk prissättning idag är att uppdatera priserna i systemet med jämna intervall, och sedan presentera det senast uträknade priset till kunden. Att använda periodiska prisuppdateringar leder till snabba responstider, och vanligtvis tillräckligt hög exakthet vad gäller pris. Men om det dynamiska prissättningssystemet kan dra nytta av väldigt snabba prisuppdateringar, så kan en onlineberäkning vara en bättre metod för att öka exaktheten för priserna. Den huvudsakliga fördelen av detta tillvägagångssätt är att det kombinerar kortsiktig exakthet med långsiktig stabilitet. På kort sikt så hanteras prisändringar av en onlineberäkning med realtidsuppdateringar, medan större trender hanteras av statistisk analys av tidigare bokningsbeteenden, som kondenseras till en efterfrågekurva. I denna rapport så beskrivs den långsiktiga statistiska analysen i kombination med den kortsiktiga onlineberäkningen, och hur denna kombination kan vara positiv både för säljare och köpare.
APA, Harvard, Vancouver, ISO, and other styles
9

Helbig, Marde. "Solving dynamic multi-objective optimisation problems using vector evaluated particle swarm optimisation." Thesis, University of Pretoria, 2012. http://hdl.handle.net/2263/28161.

Full text
Abstract:
Most optimisation problems in everyday life are not static in nature, have multiple objectives and at least two of the objectives are in conflict with one another. However, most research focusses on either static multi-objective optimisation (MOO) or dynamic singleobjective optimisation (DSOO). Furthermore, most research on dynamic multi-objective optimisation (DMOO) focusses on evolutionary algorithms (EAs) and only a few particle swarm optimisation (PSO) algorithms exist. This thesis proposes a multi-swarm PSO algorithm, dynamic Vector Evaluated Particle Swarm Optimisation (DVEPSO), to solve dynamic multi-objective optimisation problems (DMOOPs). In order to determine whether an algorithm solves DMOO efficiently, functions are required that resembles real world DMOOPs, called benchmark functions, as well as functions that quantify the performance of the algorithm, called performance measures. However, one major problem in the field of DMOO is a lack of standard benchmark functions and performance measures. To address this problem, an overview is provided from the current literature and shortcomings of current DMOO benchmark functions and performance measures are discussed. In addition, new DMOOPs are introduced to address the identified shortcomings of current benchmark functions. Guides guide the optimisation process of DVEPSO. Therefore, various guide update approaches are investigated. Furthermore, a sensitivity analysis of DVEPSO is conducted to determine the influence of various parameters on the performance of DVEPSO. The investigated parameters include approaches to manage boundary constraint violations, approaches to share knowledge between the sub-swarms and responses to changes in the environment that are applied to either the particles of the sub-swarms or the non-dominated solutions stored in the archive. From these experiments the best DVEPSO configuration is determined and compared against four state-of-the-art DMOO algorithms.
Thesis (PhD)--University of Pretoria, 2012.
Computer Science
unrestricted
APA, Harvard, Vancouver, ISO, and other styles
10

Liang, Weifa, and wliang@cs anu edu au. "Designing Efficient Parallel Algorithms for Graph Problems." The Australian National University. Department of Computer Science, 1997. http://thesis.anu.edu.au./public/adt-ANU20010829.114536.

Full text
Abstract:
Graph algorithms are concerned with the algorithmic aspects of solving graph problems. The problems are motivated from and have application to diverse areas of computer science, engineering and other disciplines. Problems arising from these areas of application are good candidates for parallelization since they often have both intense computational needs and stringent response time requirements. Motivated by these concerns, this thesis investigates parallel algorithms for these kinds of graph problems that have at least one of the following properties: the problems involve some type of dynamic updates; the sparsification technique is applicable; or the problems are closely related to communications network issues. The models of parallel computation used in our studies are the Parallel Random Access Machine (PRAM) model and the practical interconnection network models such as meshes and hypercubes. ¶ Consider a communications network which can be represented by a graph G = (V;E), where V is a set of sites (processors), and E is a set of links which are used to connect the sites (processors). In some cases, we also assign weights and/or directions to the edges in E. Associated with this network, there are many problems such as (i) whether the network is k-edge (k-vertex) connected withfixed k; (ii) whether there are k-edge (k-vertex) disjoint paths between u and v for a pair of given vertices u and v after the network is dynamically updated by adding and/or deleting an edge etc; (iii) whether the sites in the network can communicate with each other when some sites and links fail; (iv) identifying the first k edges in the network whose deletion will result in the maximum increase in the routing cost in the resulting network for fixed k; (v) how to augment the network at optimal cost with a given feasible set of weighted edges such that the augmented network is k-edge (k-vertex) connected; (vi) how to route messages through the network efficiently. In this thesis we answer the problems mentioned above by presenting efficient parallel algorithms to solve them. As far as we know, most of the proposed algorithms are the first ones in the parallel setting. ¶ Even though most of the problems concerned in this thesis are related to communications networks, we also study the classic edge-coloring problem. The outstanding difficulty to solve this problem in parallel is that we do not yet know whether or not it is in NC. In this thesis we present an improved parallel algorithm for the problem which needs [bigcircle]([bigtriangleup][superscript 4.5]log [superscript 3] [bigtriangleup] log n + [bigtriangleup][superscript 4] log [superscript 4] n) time using [bigcircle](n[superscript 2][bigtriangleup] + n[bigtriangleup][superscript 3]) processors, where n is the number of vertices and [bigtriangleup] is the maximum vertex degree. Compared with a previously known result on the same model, we improved by an [bigcircle]([bigtriangleup][superscript 1.5]) factor in time. The non-trivial part is to reduce this problem to the edge-coloring update problem. We also generalize this problem to the approximate edge-coloring problem by giving a faster parallel algorithm for the latter case. ¶ Throughout the design and analysis of parallel graph algorithms, we also find a technique called the sparsification technique is very powerful in the design of efficient sequential and parallel algorithms on dense undirected graphs. We believe that this technique may be useful in its own right for guiding the design of efficient sequential and parallel algorithms for problems in other areas as well as in graph theory.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Dynamic updates"

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

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
4

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

1

Halpin, Harry, and James Cheney. "Dynamic Provenance for SPARQL Updates." In The Semantic Web – ISWC 2014, 425–40. Cham: Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-11964-9_27.

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

Bolander, Thomas, and Arnaud Lequen. "Parameterized Complexity of Dynamic Belief Updates." In Lecture Notes in Computer Science, 87–102. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-65840-3_6.

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

Kim, Dong Kwan, Myoungkyu Song, Eli Tilevich, Calvin J. Ribbens, and Shawn A. Bohner. "Dynamic Software Updates for Accelerating Scientific Discovery." In Lecture Notes in Computer Science, 237–47. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-01970-8_24.

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

Wang, Peishun, Huaxiong Wang, and Josef Pieprzyk. "A New Dynamic Accumulator for Batch Updates." In Information and Communications Security, 98–112. Berlin, Heidelberg: Springer Berlin Heidelberg, 2007. http://dx.doi.org/10.1007/978-3-540-77048-0_8.

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

Kulkarni, Sandeep S., and Bezawada Bruhadeshwar. "Distributing Key Updates in Secure Dynamic Groups." In Distributed Computing and Internet Technology, 410–19. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-30555-2_48.

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

Nicholus, Ray. "AJAX Requests: Dynamic Data and Page Updates." In Beyond jQuery, 109–31. Berkeley, CA: Apress, 2016. http://dx.doi.org/10.1007/978-1-4842-2235-5_9.

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

Wernli, Erwann, Mircea Lungu, and Oscar Nierstrasz. "Incremental Dynamic Updates with First-Class Contexts." In Objects, Models, Components, Patterns, 304–19. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-30561-0_21.

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

Caltais, Georgiana, Hossein Hojjat, Mohammad Reza Mousavi, and Hünkar Can Tunç. "DyNetKAT: An Algebra of Dynamic Networks." In Lecture Notes in Computer Science, 184–204. Cham: Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-030-99253-8_10.

Full text
Abstract:
AbstractWe introduce a formal language for specifying dynamic updates for Software Defined Networks. Our language builds upon Network Kleene Algebra with Tests (NetKAT) and adds constructs for synchronisations and multi-packet behaviour to capture the interaction between the control- and data-plane in dynamic updates. We provide a sound and ground-complete axiomatisation of our language. We exploit the equational theory and provide an efficient method for reasoning about safety properties. We implement our equational theory in DyNetiKAT – a tool prototype, based on the Maude Rewriting Logic and the NetKAT tool, and apply it to a case study. We show that we can analyse the case study for networks with hundreds of switches using our tool prototype.
APA, Harvard, Vancouver, ISO, and other styles
9

Al-Stouhi, Samir, and Chandan K. Reddy. "Adaptive Boosting for Transfer Learning Using Dynamic Updates." In Machine Learning and Knowledge Discovery in Databases, 60–75. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-23780-5_14.

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

Löffler, Maarten, Joseph A. Simons, and Darren Strash. "Dynamic Planar Point Location with Sub-logarithmic Local Updates." In Lecture Notes in Computer Science, 499–511. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-40104-6_43.

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

Conference papers on the topic "Dynamic updates"

1

Previtali, Susanne Cech. "Dynamic updates." In the 1st workshop. New York, New York, USA: ACM Press, 2007. http://dx.doi.org/10.1145/1238828.1238841.

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

Subramanian, Suriya, Michael Hicks, and Kathryn S. McKinley. "Dynamic software updates." In the 2009 ACM SIGPLAN conference. New York, New York, USA: ACM Press, 2009. http://dx.doi.org/10.1145/1542476.1542478.

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

Bazzi, Rida A., Kristis Makris, Peyman Nayeri, and Jun Shen. "Dynamic software updates." In the Second International Workshop. New York, New York, USA: ACM Press, 2009. http://dx.doi.org/10.1145/1656437.1656447.

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

Cavalieri, Federico, Giovanna Guerrini, and Marco Mesiti. "Dynamic reasoning on XML updates." In the 14th International Conference. New York, New York, USA: ACM Press, 2011. http://dx.doi.org/10.1145/1951365.1951387.

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

Jin, Xin, Hongqiang Harry Liu, Rohan Gandhi, Srikanth Kandula, Ratul Mahajan, Ming Zhang, Jennifer Rexford, and Roger Wattenhofer. "Dynamic scheduling of network updates." In SIGCOMM'14: ACM SIGCOMM 2014 Conference. New York, NY, USA: ACM, 2014. http://dx.doi.org/10.1145/2619239.2626307.

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

Šelajev, Oleg, Rein Raudjärv, and Jevgeni Kabanov. "Static analysis for dynamic updates." In the 9th Central & Eastern European Software Engineering Conference in Russia. New York, New York, USA: ACM Press, 2013. http://dx.doi.org/10.1145/2556610.2556620.

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

Dini, Oana, Pascal Lorenz, Abdelhafid Abouaissa, and Hervé Guyennet. "Dynamic Feedback for Service Reputation Updates." In 2010 Sixth International Conference on Autonomic and Autonomous Systems (ICAS). IEEE, 2010. http://dx.doi.org/10.1109/icas.2010.34.

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

Xu, Xiaohui, Linpeng Huang, and Dejun Wang. "Supporting Dynamic Updates of Componentized Service." In IEEE International Conference on Services Computing (SCC 2007). IEEE, 2007. http://dx.doi.org/10.1109/scc.2007.113.

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

Steinruecken, Christian, Zoubin Ghahramani, and David MacKay. "Improving PPM with Dynamic Parameter Updates." In 2015 Data Compression Conference (DCC). IEEE, 2015. http://dx.doi.org/10.1109/dcc.2015.77.

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

Alfano, Gianvincenzo, Sergio Greco, and Francesco Parisi. "Efficient Computation of Extensions for Dynamic Abstract Argumentation Frameworks: An Incremental Approach." In Twenty-Sixth International Joint Conference on Artificial Intelligence. California: International Joint Conferences on Artificial Intelligence Organization, 2017. http://dx.doi.org/10.24963/ijcai.2017/8.

Full text
Abstract:
Abstract argumentation frameworks (AFs) are a well-known formalism for modelling and deciding many argumentation problems. Computational issues and evaluation algorithms have been deeply investigated for static AFs, whose structure does not change over the time. However, AFs are often dynamic as a consequence of the fact that argumentation is inherently dynamic. In this paper, we tackle the problem of incrementally computing extensions for dynamic AFs: given an initial extension and an update (or a set of updates), we devise a technique for computing an extension of the updated AF under four well-known semantics (i.e., complete, preferred, stable, and grounded). The idea is to identify a reduced (updated) AF sufficient to compute an extension of the whole AF and use state-of-the-art algorithms to recompute an extension of the reduced AF only. The experiments reveal that, for all semantics considered and using different solvers, the incremental technique is on average two orders of magnitude faster than computing the semantics from scratch.
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Dynamic updates"

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

Hayden, Christopher M., Stephen Magill, Michael Hicks, Nata Foster, and Jeffrey S. Foster. Specifying and Verifying the Correctness of Dynamic Software Updates. Fort Belvoir, VA: Defense Technical Information Center, November 2011. http://dx.doi.org/10.21236/ada560012.

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

Sterbenz, James P., Hemanth Narra, and Egemen K. Cetinkaya. Performance Analysis of AeroRP with Ground Station Updates in Highly-Dynamic Airborne Telemetry Networks. Fort Belvoir, VA: Defense Technical Information Center, June 2011. http://dx.doi.org/10.21236/ada544632.

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

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
5

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
6

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
7

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
8

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
9

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
10

Hale, Richard Edward, Sacit M. Cetiner, David L. Fugate, A. L. Qualls, Robert C. Borum, Ethan S. Chaleff, Doug W. Rogerson, John J. Batteh, and Michael M. Tiller. Update on Small Modular Reactors Dynamics System Modeling Tool -- Molten Salt Cooled Architecture. Office of Scientific and Technical Information (OSTI), August 2014. http://dx.doi.org/10.2172/1187912.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Dynamic updates' 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