Log in

Relevant bibliographies by topics / Dynamic update / Journal articles

To see the other types of publications on this topic, follow the link: Dynamic update.

Journal articles on the topic 'Dynamic update'

Author: Grafiati

Published: 4 June 2021

Last updated: 25 July 2025

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

Select a source type:

Consult the top 50 journal articles for your research on the topic 'Dynamic update.'

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

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

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

Banerjee, Debangshu, and R. Inkulu. "Vertex Guarding for Dynamic Orthogonal Art Galleries." International Journal of Computational Geometry & Applications 31, no. 02n03 (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 [For

APA, Harvard, Vancouver, ISO, and other styles

2

KOOI, BARTELD, and BRYAN RENNE. "ARROW UPDATE LOGIC." Review of Symbolic Logic 4, no. 4 (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 addit

APA, Harvard, Vancouver, ISO, and other styles

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 (2021): 2150042. http://dx.doi.org/10.1142/s0218127421500425.

Full text

Abstract:

Ising model at zero temperature leads to a ferromagnetic state asymptotically. There are two such possible states linked by symmetry, and Glauber–Ising dynamics are employed to reach them. In some stochastic or deterministic dynamical systems, the same absorbing state with [Formula: see text] symmetry is reached. This transition often belongs to the directed Ising (DI) class where dynamic exponents and persistence exponent are different. In asymmetrically coupled sequentially updated logistic maps, the transition belongs to the DI class. We study changes in the nature of transition with an upd

APA, Harvard, Vancouver, ISO, and other styles

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 (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 u

APA, Harvard, Vancouver, ISO, and other styles

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 (2021): 1–51. http://dx.doi.org/10.1145/3469833.

Full text

Abstract:

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 proba

APA, Harvard, Vancouver, ISO, and other styles

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 (2021): 1–51. http://dx.doi.org/10.1145/3469833.

Full text

Abstract:

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 proba

APA, Harvard, Vancouver, ISO, and other styles

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.

Full text

Abstract:

It is a key problem for a 7*24 running system to update and maintain online. According to the feature of OSGi (Open Service Gateway Initiative) framework, current service dynamic update policies for OSGi framework are analyzed. In order to solve the problem of service mutual consistency and service state consistency during service update, the service dynamic update policy based on publish & subscribe model is presented. This policy is based on quiescent state theory to ensure mutual consistency when services are updated online. The process of the dynamic service update policy is described

APA, Harvard, Vancouver, ISO, and other styles

8

Kahle, Reinhard. "Default Negation as Explicit Negation plus Update." Logical Investigations 27, no. 1 (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

9

Jiang, Mengxu, Zhi Yang, Fangyuan Zhang, et al. "DIGRA: A Dynamic Graph Indexing for Approximate Nearest Neighbor Search with Range Filter." Proceedings of the ACM on Management of Data 3, no. 3 (2025): 1–26. https://doi.org/10.1145/3725399.

Full text

Abstract:

Recent advancements in AI have enabled models to map real-world entities, such as product images, into high-dimensional vectors, making approximate nearest neighbor search (ANNS) crucial for various applications. Often, these vectors are associated with additional attributes like price, prompting the need for range-filtered ANNS where users seek similar items within specific attribute ranges. Naive solutions like pre-filtering and post-filtering are straightforward but inefficient. Specialized indexes, such as SeRF, SuperPostFiltering, and iRangeGraph, have been developed to address these quer

APA, Harvard, Vancouver, ISO, and other styles

10

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 (2024): 2323. https://doi.org/10.3390/jmse12122323.

Full text

Abstract:

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

APA, Harvard, Vancouver, ISO, and other styles

11

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

Full text

Abstract:

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-S

APA, Harvard, Vancouver, ISO, and other styles

12

Rumbaugh, Douglas B., and Dong Xie. "Practical Dynamic Extension for Sampling Indexes." Proceedings of the ACM on Management of Data 1, no. 4 (2023): 1–26. http://dx.doi.org/10.1145/3626744.

Full text

Abstract:

The execution of analytical queries on massive datasets presents challenges due to long response times and high computational costs. As a result, the analysis of representative samples of data has emerged as an attractive alternative; this avoids the cost of processing queries against the entire dataset, while still producing statistically valid results. Unfortunately, the sampling techniques in common use sacrifice either sample quality or performance, and so are poorly suited for this task. However, it is possible to build high quality sample sets efficiently with the assistance of indexes.

APA, Harvard, Vancouver, ISO, and other styles

13

Li, Haoyang, and Lei Chen. "EARLY: Efficient and Reliable Graph Neural Network for Dynamic Graphs." Proceedings of the ACM on Management of Data 1, no. 2 (2023): 1–28. http://dx.doi.org/10.1145/3589308.

Full text

Abstract:

Graph neural networks have been widely used to learn node representations for many real-world static graphs. In general, they learn node representations by recursively aggregating information from neighbors. However, graphs in many applications are dynamic, evolving with continuous graph events, such as node feature and graph structure updates. These events require the node representations to be updated accordingly. Currently, due to the real-time requirement, how to efficiently and reliably update node representations under continuous graph events is still an open problem. Recent studies prop

APA, Harvard, Vancouver, ISO, and other styles

14

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) (2022): 27–53. https://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. A

APA, Harvard, Vancouver, ISO, and other styles

15

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

16

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

Full text

Abstract:

Using the static and dynamic test data simultaneously to update the finite element model can increase the available information for updating. It can overcome the disadvantages of updating based on static or dynamic test data only. In this paper, the response surface method is adopted to update the finite element model of the structure based on the static and dynamic test. Using the reasonable experiment design and regression techniques, a response surface model is formulated to approximate the relationships between the parameters and response values instead of the initial finite element model

APA, Harvard, Vancouver, ISO, and other styles

17

Zhang, Fangyuan, Mengxu Jiang, and Sibo Wang. "Efficient Dynamic Weighted Set Sampling and Its Extension." Proceedings of the VLDB Endowment 17, no. 1 (2023): 15–27. http://dx.doi.org/10.14778/3617838.3617840.

Full text

Abstract:

Given a weighted set S of n elements, weighted set sampling (WSS) samples an element in S so that each element a i ; is sampled with a probability proportional to its weight w ( a i ). The classic alias method pre-processes an index in O ( n ) time with O ( n ) space and handles WSS with O (1) time. Yet, the alias method does not support dynamic updates. By minor modifications of existing dynamic WSS schemes, it is possible to achieve an expected O (1) update time and draw t independent samples in expected O ( t ) time with linear space, which is theoretically optimal. But such a method is imp

APA, Harvard, Vancouver, ISO, and other styles

18

Moti, Moin Hussain, Panagiotis Simatis, and Dimitris Papadias. "Waffle." Proceedings of the VLDB Endowment 16, no. 4 (2022): 670–83. http://dx.doi.org/10.14778/3574245.3574253.

Full text

Abstract:

Although several spatial indexes achieve fast query processing, they are ineffective for highly dynamic data sets because of costly updates. On the other hand, simple structures that enable efficient updates are slow for spatial queries. In this paper, we propose Waffle , a workload-aware, query-sensitive spatial index, that effectively accommodates both update- and query-intensive workloads. Waffle combines concepts of the space and data partitioning frameworks, and constitutes a complete indexing solution. In addition to query processing algorithms, it includes: (i) a novel bulk loading meth

APA, Harvard, Vancouver, ISO, and other styles

19

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

Full text

Abstract:

Epileptic seizure prediction is a difficult problem in clinical applications, and it has the potential to significantly improve the patients’ daily lives whose seizures cannot be controlled by either drugs or surgery. However, most current studies of epileptic seizure prediction focus on high sensitivity and low false-positive rate only and lack the flexibility for a variety of epileptic seizures and patients’ physical conditions. Therefore, a novel dynamic update framework for epileptic seizure prediction is proposed in this paper. In this framework, two basic sample pools are constructed and

APA, Harvard, Vancouver, ISO, and other styles

20

Li, Zhaopeng, Deyun Zhong, Zhaohao Wu, Liguan Wang, and Qiwang Tang. "Local Dynamic Updating Method of Orebody Model Based on Mesh Reconstruction and Mesh Deformation." Minerals 11, no. 11 (2021): 1232. http://dx.doi.org/10.3390/min11111232.

Full text

Abstract:

In this paper, to update the orebody model based on the given interpreted geological information, we present a local dynamic updating method of the orebody model that allows the interactive construction of the constraint deformation conditions and the dynamic updating of the mesh model. The rules for constructing deformation constraints based on the control polylines are discussed. Because only part of the model is updated, the updated mesh is effective and the overall quality is satisfactory. Our main contribution is that we propose a local dynamic updating method for the orebody model based

APA, Harvard, Vancouver, ISO, and other styles

21

Abo Khamis, Mahmoud, Ahmet Kara, Dan Olteanu, and Dan Suciu. "Insert-Only versus Insert-Delete in Dynamic Query Evaluation." Proceedings of the ACM on Management of Data 2, no. 5 (2024): 1–26. http://dx.doi.org/10.1145/3695837.

Full text

Abstract:

We study the dynamic query evaluation problem: Given a full conjunctive query Q and a sequence of updates to the input database, we construct a data structure that supports constant-delay enumeration of the tuples in the query output after each update. We show that a sequence of N insert-only updates to an initially empty database can be executed in total time O(N w(Q) ), where w(Q) is the fractional hypertree width of Q. This matches the complexity of the static query evaluation problem for Q and a database of size N. One corollary is that the amortized time per single-tuple insert is constan

APA, Harvard, Vancouver, ISO, and other styles

22

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

Full text

Abstract:

Abstract This paper explores the relationship between dynamic and truth conditional semantics for epistemic modals. It provides a generalization of a standard dynamic update semantics for modals. This new semantics derives a Kripke semantics for modals and a standard dynamic semantics for modals as special cases. The semantics allows for new characterizations of a variety of principles in modal logic, including the inconsistency of ‘p and might not p’. Finally, the semantics provides a construction procedure for transforming any truth conditional semantics for modals into a dynamic semantics f

APA, Harvard, Vancouver, ISO, and other styles

23

Chen, Xin, You Peng, Sibo Wang, and Jeffrey Xu Yu. "DLCR." Proceedings of the VLDB Endowment 15, no. 8 (2022): 1645–57. http://dx.doi.org/10.14778/3529337.3529348.

Full text

Abstract:

Many real-world graphs, e.g., social networks, biological networks, knowledge graphs, naturally come with edge-labels, with different labels representing different relationships between nodes. On such edge-labeled graphs, an important query is the label-constrained reachability (LCR) query, where we are given a source s , a target t , a label set ψ, and the goal is to check if there exists any path P from s to t such that labels of edges on P all belong to ψ. Existing indexing schemes for LCR queries still focus on static graphs, despite the fact that many edge-labeled graphs are dynamic in na

APA, Harvard, Vancouver, ISO, and other styles

24

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

Full text

Abstract:

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

APA, Harvard, Vancouver, ISO, and other styles

25

Eldin, Neil N., and Ahmed B. Senouci. "Scheduling and control of linear projects." Canadian Journal of Civil Engineering 21, no. 2 (1994): 219–30. http://dx.doi.org/10.1139/l94-025.

Full text

Abstract:

A two-state-variable, N-stage dynamic programming approach to scheduling and control of linear projects is presented. This approach accounts for practical considerations related to work continuity, interruptions, and lags between successive activities. In the dynamic programming formulation, stages represent project activities and state variables represent possible activity resources and interruptions at each location. The objective of the dynamic programming solution is to provide for the selection of resources, interruptions, and lags for production activities that lead to the minimum projec

APA, Harvard, Vancouver, ISO, and other styles

26

Anadiotis, Angelos Christos, Muhammad Ghufran Khan, and Ioana Manolescu. "Dynamic Graph Databases with Out-of-Order Updates." Proceedings of the VLDB Endowment 17, no. 13 (2024): 4799–812. https://doi.org/10.14778/3704965.3704984.

Full text

Abstract:

Several real-time applications rely on dynamic graphs to model and store data arriving from multiple streams. Providing both high ingestion rate and efficient analytics with transactional guarantees is challenging, even more so when updates may be received out-of-order at the database. In this work, we propose HAL, a novel in-memory dynamic graph database design, addressing these challenges. HAL outperforms comparable systems by a factor of up to 73× in terms of update processing throughput and up to 357× for analytics, while being the first to support out-of-order updates.

APA, Harvard, Vancouver, ISO, and other styles

27

Zhang, Fangyuan, Mengxu Jiang, Guanhao Hou, et al. "Efficient Dynamic Indexing for Range Filtered Approximate Nearest Neighbor Search." Proceedings of the ACM on Management of Data 3, no. 3 (2025): 1–26. https://doi.org/10.1145/3725401.

Full text

Abstract:

Given a set O of objects consisting of n high-dimensional vectors, the problem of approximate nearest neighbor (ANN) search for a query vector q is crucial in many applications where objects are represented as feature vectors in high-dimensional spaces. Each object in O often has attributes like popularity or price, which influence the search. Practically, searching for the nearest neighbor to q might include a range filter specifying the desired attribute values, e.g., within a specific price range. Existing solutions for range filtered ANN search often face trade-offs among excessive storage

APA, Harvard, Vancouver, ISO, and other styles

28

Yadav, Pratyaksh, Pramoda Kumara K M, Burhan Pasha, and Dr Mohana S D. "Remote ESP32 Holographic Display System." INTERANTIONAL JOURNAL OF SCIENTIFIC RESEARCH IN ENGINEERING AND MANAGEMENT 09, no. 03 (2025): 1–9. https://doi.org/10.55041/ijsrem43269.

Full text

Abstract:

This paper presents the design and implementation of a remote-update holographic display system utilizing the ESP32 microcontroller. The system facilitates dynamic image projection through a combination of hardware and software components. A web server acts as an intermediary for image storage and distribution, while a mobile application offers a user-friendly interface for image selection and system control. The ESP32, upon network connection and IP address acquisition, communicates with the web server to retrieve updated image data, enabling real-time content modification. This configuration

APA, Harvard, Vancouver, ISO, and other styles

29

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

Full text

Abstract:

Philips, Rutherford, and Whitten (2016, Stata Journal 16: 662–677) introduced dynsimpie, a command to examine dynamic compositional dependent variables. In this article, we present an update to dynsimpie and three new adofiles: cfbplot, effectsplot, and dynsimpiecoef. These updates greatly enhance the range of models that can be estimated and the ways in which model results can now be presented. The command dynsimpie has been updated so that users can obtain both prediction plots and change-from-baseline plots using postestimation commands. With the new command dynsimpiecoef, various types of

APA, Harvard, Vancouver, ISO, and other styles

30

SLOTA, MARTIN, JOÃO LEITE, and TERRANCE SWIFT. "Splitting and updating hybrid knowledge bases." Theory and Practice of Logic Programming 11, no. 4-5 (2011): 801–19. http://dx.doi.org/10.1017/s1471068411000317.

Full text

Abstract:

AbstractOver the years, nonmonotonic rules have proven to be a very expressive and useful knowledge representation paradigm. They have recently been used to complement the expressive power of Description Logics (DLs), leading to the study of integrative formal frameworks, generally referred to ashybrid knowledge bases, where both DL axioms and rules can be used to represent knowledge. The need to use these hybrid knowledge bases in dynamic domains has called for the development of update operators, which, given the substantially different way DLs and rules are usually updated, has turned out t

APA, Harvard, Vancouver, ISO, and other styles

31

Narayanareddy, Mugireddy Satya, Lekireddy Rajasekharreddy, Isani Swetha, and P. V. Jagadeeswara Prasad. "SYMMETRIC-KEY BASED VERIFICATION OF KEYWORD SEARCH OVER DYNAMIC ENCRYPTED CLOUD DATA." Turkish Journal of Computer and Mathematics Education (TURCOMAT) 11, no. 3 (2020): 2736–41. http://dx.doi.org/10.61841/turcomat.v11i3.14517.

Full text

Abstract:

Searchable and Verifiable As a crucial method of cloud security, symmetric encryption enables users to search for encrypted data in the cloud using keywords and validate the accuracy of the results. One of the most prevalent and important requirements for data owners in such schemes is dynamic update for cloud data. To our knowledge, all of the verifiable SSE systems that permit data dynamic update currently in use are based on asymmetric-key cryptography verification, which necessitates time-consuming processes. The sheer volume of cloud data could make the overhead of verification a major bu

APA, Harvard, Vancouver, ISO, and other styles

32

Shenigaram, Vidhya, Ladhwe Shri Megha, Rajasekharaiah Matada Kattigehally, and Swarnaja Mettu. "SYMMETRIC-KEY BASED VERIFICATION OF KEYWORD SEARCH OVER DYNAMIC ENCRYPTED CLOUD DATA." Turkish Journal of Computer and Mathematics Education (TURCOMAT) 11, no. 3 (2020): 2696–702. http://dx.doi.org/10.61841/turcomat.v11i3.14483.

Full text

Abstract:

Searchable and Verifiable As a crucial method of cloud security, symmetric encryption enables users to search for encrypted data in the cloud using keywords and validate the accuracy of the results. One of the most prevalent and important requirements for data owners in such schemes is dynamic update for cloud data. To our knowledge, all of the verifiable SSE systems that permit data dynamic update currently in use are based on asymmetric-key cryptography verification, which necessitates time-consuming processes. The sheer volume of cloud data could make the overhead of verification a major bu

APA, Harvard, Vancouver, ISO, and other styles

33

MASUD, MD MEHEDI, ILUJU KIRINGA, and HASAN URAL. "UPDATE PROCESSING IN INSTANCE-MAPPED P2P DATA SHARING SYSTEMS." International Journal of Cooperative Information Systems 18, no. 03n04 (2009): 339–79. http://dx.doi.org/10.1142/s021884300900204x.

Full text

Abstract:

We consider the problem of update processing in a peer-to-peer (P2P) database network where each peer consists of an independently created relational database. We assume that peers store related data, but data has heterogeneity wrt instances and schemas. The differences in schema and data vocabulary are bridged by value correspondences called mapping tables. Peers build an overlay network called acquaintance network, in which each peer may get acquainted with any other peer that stores related data. In this setting, the updates are free to initiate in any peer and are executed over other peers

APA, Harvard, Vancouver, ISO, and other styles

34

Ghemawat, Pankaj. "Evolving Ideas about Business Strategy." Business History Review 90, no. 4 (2016): 727–49. http://dx.doi.org/10.1017/s0007680516000702.

Full text

Abstract:

This paper updates an earlier article published in Business History Review that concluded that by the second half of the 1990s, there had been a profusion of new, purportedly practical ideas about strategy, many of which embodied some explicit dynamics. This update provides several indications of a drop-off since then in the rate of development of new ideas about strategy but also a continued focus, in the new ideas that are being developed, on dynamics. And since our stock of dynamic frameworks has, based on one enumeration, more than doubled in the last fifteen to twenty years, updating expa

APA, Harvard, Vancouver, ISO, and other styles

35

Müller, Peter Marvin, Georgios Bletsos, and Thomas Rung. "Shape Transformation Approaches for Fluid Dynamic Optimization." Aerospace 10, no. 6 (2023): 519. http://dx.doi.org/10.3390/aerospace10060519.

Full text

Abstract:

The contribution is devoted to combined shape- and mesh-update strategies for parameter-free (CAD-free) shape optimization methods. Three different strategies to translate the shape sensitivities computed by adjoint shape optimization procedures into simultaneous updates of both the shape and the discretized domain are employed in combination with a mesh-morphing strategy. Considered methods involve a linear Steklov–Poincaré (Hilbert space) approach, a recently suggested highly non-linear p-Laplace (Banach space) method, and a hybrid variant which updates the shape in Hilbert space. The method

APA, Harvard, Vancouver, ISO, and other styles

36

Krishna, Shankaranarayanan, Aniket Lal, Andreas Pavlogiannis, and Omkar Tuppe. "On-the-Fly Static Analysis via Dynamic Bidirected Dyck Reachability." Proceedings of the ACM on Programming Languages 8, POPL (2024): 1239–68. http://dx.doi.org/10.1145/3632884.

Full text

Abstract:

Dyck reachability is a principled, graph-based formulation of a plethora of static analyses. Bidirected graphs are used for capturing dataflow through mutable heap data, and are usual formalisms of demand-driven points-to and alias analyses. The best (offline) algorithm runs in O ( m + n · α( n )) time, where n is the number of nodes and m is the number of edges in the flow graph, which becomes O ( n 2 ) in the worst case. In the everyday practice of program analysis, the analyzed code is subject to continuous change, with source code being added and removed. On-the-fly static analysis under s

APA, Harvard, Vancouver, ISO, and other styles

37

Bhore, Sujoy, Guangping Li, and Martin Nöllenburg. "An Algorithmic Study of Fully Dynamic Independent Sets for Map Labeling." ACM Journal of Experimental Algorithmics 27 (December 31, 2022): 1–36. http://dx.doi.org/10.1145/3514240.

Full text

Abstract:

Map labeling is a classical problem in cartography and geographic information systems that asks to place labels for area, line, and point features, with the goal to select and place the maximum number of independent (i.e., overlap-free) labels. A practically interesting case is point labeling with axis-parallel rectangular labels of common size. In a fully dynamic setting, at each timestep, either a new label appears or an existing label disappears. Then, the challenge is to maintain a maximum cardinality subset of pairwise independent labels with sublinear update time. Motivated by this, we s

APA, Harvard, Vancouver, ISO, and other styles

38

Kobayashi, Mikito, and Satoshi Tojo. "Agent Communication for Dynamic Belief Update." Transactions of the Japanese Society for Artificial Intelligence 24 (2009): 314–21. http://dx.doi.org/10.1527/tjsai.24.314.

Full text

APA, Harvard, Vancouver, ISO, and other styles

39

Caramella, C., P. Colombo, U. Conte, and A. La Manna. "Tablet Disintegration Update: The Dynamic Approach." Drug Development and Industrial Pharmacy 13, no. 12 (1987): 2111–45. http://dx.doi.org/10.3109/03639048709020576.

Full text

APA, Harvard, Vancouver, ISO, and other styles

40

Nahabedian, Leandro, Victor Braberman, Nicolas Dippolito, et al. "Dynamic Update of Discrete Event Controllers." IEEE Transactions on Software Engineering 46, no. 11 (2020): 1220–40. http://dx.doi.org/10.1109/tse.2018.2876843.

Full text

APA, Harvard, Vancouver, ISO, and other styles

41

Aucher, Guillaume. "Dynamic epistemic logic in update logic." Journal of Logic and Computation 26, no. 6 (2016): 1913–60. http://dx.doi.org/10.1093/logcom/exw002.

Full text

APA, Harvard, Vancouver, ISO, and other styles

42

D'Angelo, Gianlorenzo, Mattia D'Emidio, and Daniele Frigioni. "Fully dynamic update of arc-flags." Networks 63, no. 3 (2014): 243–59. http://dx.doi.org/10.1002/net.21542.

Full text

APA, Harvard, Vancouver, ISO, and other styles

43

Li, Yuan Zheng. "Mean-Shift Guided Particle Filter Tracking Method Based on Layered Dynamic Template Update." Advanced Materials Research 846-847 (November 2013): 1217–20. http://dx.doi.org/10.4028/www.scientific.net/amr.846-847.1217.

Full text

Abstract:

Traditional tracking algorithm is not compatible between robustness and efficiency, under complex scenes, the stable template update strategy is not robust to target appearance changes. Therefore, the paper presents a dynamic template-update method that combined with a mean-shift guided particle filter tracking method. By incorporating the original information into the updated template, or according to the variety of each component in template to adjust the updating weights adaptively, the presented algorithm has the natural ability of anti-drift. Besides, the proposed method cope the one-step

APA, Harvard, Vancouver, ISO, and other styles

44

Qiangqiang, Sun, Qiu Huijun, and Cai Meng. "Transmitting Systems Dynamics in SCADA using Uneven Sampling/ Cubic Spline Interpolation based Data Compression." Open Electrical & Electronic Engineering Journal 8, no. 1 (2014): 544–51. http://dx.doi.org/10.2174/1874129001408010544.

Full text

Abstract:

Grasping power system dynamic information is helpful for dispatcher in the control center to take correct control action in time under emergency condition. Traditionally, Supervisory Control and Data Acquisition (SCADA) cannot transmit power system dynamics information since it updates system information once every several seconds. Based on the development of substation automation system, a data compression based approach is proposed in this paper to transmit power system dynamics information in existing SCADA. An uneven sampling is utilized to extract the feature points that determine the pro

APA, Harvard, Vancouver, ISO, and other styles

45

Wang, Guizhi. "THE DESIGN AND PRODUCT OF NATIONAL 1:1000000 CARTOGRAPHIC DATA OF TOPOGRAPHIC MAP." ISPRS - International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences XLI-B2 (June 7, 2016): 245–49. http://dx.doi.org/10.5194/isprs-archives-xli-b2-245-2016.

Full text

Abstract:

National administration of surveying, mapping and geoinformation started to launch the project of national fundamental geographic information database dynamic update in 2012. Among them, the 1:50000 database was updated once a year, furthermore the 1:250000 database was downsized and linkage-updated on the basis. In 2014, using the latest achievements of 1:250000 database, comprehensively update the 1:1000000 digital line graph database. At the same time, generate cartographic data of topographic map and digital elevation model data. This article mainly introduce national 1:1000000 cartographi

APA, Harvard, Vancouver, ISO, and other styles

46

Wang, Guizhi. "THE DESIGN AND PRODUCT OF NATIONAL 1:1000000 CARTOGRAPHIC DATA OF TOPOGRAPHIC MAP." ISPRS - International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences XLI-B2 (June 7, 2016): 245–49. http://dx.doi.org/10.5194/isprsarchives-xli-b2-245-2016.

Full text

Abstract:

National administration of surveying, mapping and geoinformation started to launch the project of national fundamental geographic information database dynamic update in 2012. Among them, the 1:50000 database was updated once a year, furthermore the 1:250000 database was downsized and linkage-updated on the basis. In 2014, using the latest achievements of 1:250000 database, comprehensively update the 1:1000000 digital line graph database. At the same time, generate cartographic data of topographic map and digital elevation model data. This article mainly introduce national 1:1000000 cartographi

APA, Harvard, Vancouver, ISO, and other styles

47

Mayer, Andreas, Vijay Balasubramanian, Aleksandra M. Walczak, and Thierry Mora. "How a well-adapting immune system remembers." Proceedings of the National Academy of Sciences 116, no. 18 (2019): 8815–23. http://dx.doi.org/10.1073/pnas.1812810116.

Full text

Abstract:

An adaptive agent predicting the future state of an environment must weigh trust in new observations against prior experiences. In this light, we propose a view of the adaptive immune system as a dynamic Bayesian machinery that updates its memory repertoire by balancing evidence from new pathogen encounters against past experience of infection to predict and prepare for future threats. This framework links the observed initial rapid increase of the memory pool early in life followed by a midlife plateau to the ease of learning salient features of sparse environments. We also derive a modulated

APA, Harvard, Vancouver, ISO, and other styles

48

Sanchez-Gomez, Jesús Manuel, Miguel Ángel Vega-Rodríguez, and Sánchez Carlos Javier Pérez. "Automatic update summarization by a multi-objective number-one-selection genetic approach." IEEE Transactions on Cybernetics 53, no. 12 (2023): 7443–54. https://doi.org/10.1109/TCYB.2022.3223163.

Full text

Abstract:

Currently, the explosive growth of the information available on the internet makes automatic text summarization systems increasingly important. A particularly relevant challenge is the update summarization task. Update summarization differs from traditional summarization in its dynamic nature. While traditional summarization is static, i.e., the document collections about a specific topic remain unchanged, update summarization addresses dynamic document collections based on a specific topic. Therefore, update summarization consists of summarizing the new document collection under the assumptio

APA, Harvard, Vancouver, ISO, and other styles

49

Raskhodnikova, Sofya, and Teresa Anna Steiner. "Fully Dynamic Algorithms for Graph Databases with Edge Differential Privacy." Proceedings of the ACM on Management of Data 3, no. 2 (2025): 1–28. https://doi.org/10.1145/3725236.

Full text

Abstract:

We study differentially private algorithms for analyzing graph databases in the challenging setting of continual release with fully dynamic updates, where edges are inserted and deleted over time, and the algorithm is required to update the solution at every time step. Previous work has presented differentially private algorithms for many graph problems that can handle insertions only or deletions only (called partially dynamic algorithms) and obtained some hardness results for the fully dynamic setting. The only algorithms in the latter setting were for the edge count, given by Fichtenberger,

APA, Harvard, Vancouver, ISO, and other styles

50

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 (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, calibrate

APA, Harvard, Vancouver, ISO, and other styles

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