Journal articles: '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

11

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

Full text

Abstract:

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

APA, Harvard, Vancouver, ISO, and other styles

12

Eldin, Neil N., and Ahmed B. Senouci. "Scheduling and control of linear projects." Canadian Journal of Civil Engineering 21, no. 2 (April 1, 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 project total cost. In addition, the presented system produces a graphical presentation of the optimum project schedule and updates the original schedule based on update information input by the user. The updated schedule determines the new completion date, and forecasts the project new total cost based on the current project performance. A small linear project is provided as a numerical illustration of the system. Key words: dynamic programming, linear projects, scheduling systems, optimization of cost and scheduling durations.

APA, Harvard, Vancouver, ISO, and other styles

13

Bravetti, Mario. "Towards Dynamic Updates in Service Composition." Electronic Proceedings in Theoretical Computer Science 201 (December 22, 2015): 1–17. http://dx.doi.org/10.4204/eptcs.201.1.

Full text

APA, Harvard, Vancouver, ISO, and other styles

14

Menon, S., and R. J. LeBlanc. "Object replacement using dynamic proxy updates." Distributed Systems Engineering 1, no. 5 (September 1994): 271–79. http://dx.doi.org/10.1088/0967-1846/1/5/002.

Full text

APA, Harvard, Vancouver, ISO, and other styles

15

Liu, Jian, and X. X. Zhang. "Dynamic labeling scheme for XML updates." Knowledge-Based Systems 106 (August 2016): 135–49. http://dx.doi.org/10.1016/j.knosys.2016.05.039.

Full text

APA, Harvard, Vancouver, ISO, and other styles

16

Ferragina, Paolo. "Dynamic Text Indexing under String Updates." Journal of Algorithms 22, no. 2 (February 1997): 296–328. http://dx.doi.org/10.1006/jagm.1996.0814.

Full text

APA, Harvard, Vancouver, ISO, and other styles

17

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 (September 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 which are acquainted directly or indirectly with the updates initiator. The execution of an update is achieved by translating, through mapping tables, the update into a set of updates that are executed against the acquainted peers. We consider both the soundness and completeness of update translation. When updates are generated and propagated in the network initiated from a peer, a tree is built dynamically called Update Dependency Tree (UDT). The UDT depicts the relationships among the component updates generated from the initial update. We also discuss the issues of the update propagation when a peer is temporarily unavailable or offline. Our propagation mechanism keeps track of a peer when the peer is not available for a certain period of time and once the peer comes back online the system propagates the updates destined to the returning peer to keep it's database synchronized. Moreover, conflict detection and resolution strategies have been proposed for such a dynamic P2P database network. We have implemented and experimentally tested a prototype of our update processing mechanism on a small P2P database network. We show the results of our experiments.

APA, Harvard, Vancouver, ISO, and other styles

18

Qin, Zun Yue, Yong Tang, and Hong Zhi Xu. "A String Approach for Dynamic XML Document." Applied Mechanics and Materials 220-223 (November 2012): 2512–19. http://dx.doi.org/10.4028/www.scientific.net/amm.220-223.2512.

Full text

Abstract:

Labeling the nodes of an XML document allows queries without accessing the original file. For dynamic XML documents, the labeling scheme should support both efficient queries and insertion updates. This paper proposed a new labeling scheme, DCPL (Dynamic Common Prefix Labeling), to process dynamic XML documents efficiently. Compared with the existing schemes, DCPL presents a prominent feature of maintaining its simplicity and efficiency in dynamic and static documents. Meanwhile, it can efficiently support labeling updates, especially frequent updates, without sacrifices of query performance. The conducted experiments have shown that our proposal works better than the previous ones.

APA, Harvard, Vancouver, ISO, and other styles

19

Angriman, Eugenio, Michał Boroń, and Henning Meyerhenke. "A Batch-dynamic Suitor Algorithm for Approximating Maximum Weighted Matching." ACM Journal of Experimental Algorithmics 27 (December 31, 2022): 1–41. http://dx.doi.org/10.1145/3529228.

Full text

Abstract:

Matching is a popular combinatorial optimization problem with numerous applications in both commercial and scientific fields. Computing optimal matchings w.r.t. cardinality or weight can be done in polynomial time; still, this task can become infeasible for very large networks. Thus, several approximation algorithms that trade solution quality for a faster running time have been proposed. For networks that change over time, fully dynamic algorithms that efficiently maintain an approximation of the optimal matching after a graph update have been introduced as well. However, no semi- or fully dynamic algorithm for (approximate) maximum weighted matching has been implemented. In this article, we focus on the problem of maintaining a $ 1/2 $ -approximation of a maximum weighted matching (MWM) in fully dynamic graphs. Limitations of existing algorithms for this problem are (i) high constant factors in their time complexity, (ii) the fact that none of them supports batch updates, and (iii) the lack of a practical implementation, meaning that their actual performance on real-world graphs has not been investigated. We propose and implement a new batch-dynamic $ 1/2 $ -approximation algorithm for MWM based on the Suitor algorithm and its local edge domination strategy [Manne and Halappanavar, IPDPS 2014]. We provide a detailed analysis of our algorithm and prove its approximation guarantee. Despite having a worst-case running time of $ \mathcal {O}(n + m) $ for a single graph update, our extensive experimental evaluation shows that our algorithm is much faster in practice. For example, compared to a static recomputation with sequential Suitor , single-edge updates are handled up to $ 10^5\times $ to $ 10^6\times $ faster, while batches of $ 10^4 $ edge updates are handled up to $ 10^2\times $ to $ 10^3\times $ faster.

APA, Harvard, Vancouver, ISO, and other styles

20

Prakash, A. John, and B. Lydia Elizabeth. "Pindex: Private multi-linked index for encrypted document retrieval." PLOS ONE 16, no. 8 (August 20, 2021): e0256223. http://dx.doi.org/10.1371/journal.pone.0256223.

Full text

Abstract:

Cryptographic cloud storage is used to make optimal use of the cloud storage infrastructure to outsource sensitive and mission-critical data. The continuous growth of encrypted data outsourced to cloud storage requires continuous updating. Attacks like file-injection are reported to compromise confidentiality of the user as a consequence of information leakage during update. It is required that dynamic schemes provide forward privacy guarantees. Updates should not leak information to the untrusted server regarding the previously issued queries. Therefore, the challenge is to design an efficient searchable encryption scheme with dynamic updates and forward privacy guarantees. In this paper, a novel private multi-linked dynamic index for encrypted document retrieval namely Pindex is proposed. The multi-linked dynamic index is constructed using probabilistic homomorphic encryption mechanism and secret orthogonal vectors. Full security proofs for correctness and forward privacy in the random oracle model is provided. Experiments on real world Enron dataset demonstrates that our construction is practical and efficient. The security and performance analysis of Pindex shows that the dynamic multi-linked index guarantees forward privacy without significant loss of efficiency.

APA, Harvard, Vancouver, ISO, and other styles

21

Gulacsik, Gala, Susan L. Joslyn, John Robinson, and Chao Qin. "Communicating Uncertainty Information in a Dynamic Decision Environment." Weather, Climate, and Society 14, no. 4 (October 2022): 1201–16. http://dx.doi.org/10.1175/wcas-d-21-0186.1.

Full text

Abstract:

Abstract The likelihood of threatening events is often simplified for members of the public and presented as risk categories such as the “watches” and “warnings” currently issued by National Weather Service in the United States. However, research (e.g., Joslyn and LeClerc) suggests that explicit numeric uncertainty information—for example, 30%—improves people’s understanding as well as their decisions. Whether this benefit extends to dynamic situations in which users must process multiple forecast updates is as yet unknown. It may be that other likelihood expressions, such as color coding, are required under those circumstances. The experimental study reported here compared the effect of the categorical expressions “watches” and “warnings” with both color-coded and numeric percent chance expressions of the likelihood of a tornado in a situation with multiple updates. Participants decided whether and when to take shelter to protect themselves from a tornado on each of 40 trials, each with seven updated tornado forecasts. Understanding, decision quality, and trust were highest in conditions that provided percent chance information. Color-coded likelihood information inspired the least trust and led to the greatest overestimation of likelihood and confusion with severity information of all expressions.

APA, Harvard, Vancouver, ISO, and other styles

22

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 expands both the need and the empirical basis for some generalizations about the types of dynamic strategy frameworks—and strategy frameworks in general—that managers are likely to find helpful versus those that they are not.

APA, Harvard, Vancouver, ISO, and other styles

23

Oguz, Damla, Baris Yildiz, and Belgin Ergenc. "DMA." International Journal of Data Warehousing and Mining 9, no. 4 (October 2013): 62–75. http://dx.doi.org/10.4018/ijdwm.2013100104.

Full text

Abstract:

Updates on an operational database bring forth the challenge of keeping the frequent itemsets up-to-date without re-running the itemset mining algorithms. Studies on dynamic itemset mining, which is the solution to such an update problem, have to address some challenges as handling i) updates without re-running the base algorithm, ii) changes in the support threshold, iii) new items and iv) additions/deletions in updates. The study in this paper is the extension of the Incremental Matrix Apriori Algorithm which proposes solutions to the first three challenges besides inheriting the advantages of the base algorithm which works without candidate generation. In the authors' current work, the authors have improved a former algorithm as to handle updates that are composed of additions and deletions. The authors have also carried out a detailed performance evaluation study on a real and two benchmark datasets.

APA, Harvard, Vancouver, ISO, and other styles

24

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.

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

APA, Harvard, Vancouver, ISO, and other styles

25

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 (December 31, 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 profile of system dynamics. Thereafter, these feature points contain dynamic information is transmitted from Remote Terminal Units to the control center. The system dynamics can thus be reconstructed with cubic spline interpolation. Numerical simulation on a 36 nodes system suggests that the system dynamics could be transmitted with high fidelity in existing SCADA using the proposed approach. Moreover, the proposed approach can be implemented in SCADA with limited software update.

APA, Harvard, Vancouver, ISO, and other styles

26

Wernli, Erwann, Mircea Lungu, and Oscar Nierstrasz. "Incremental Dynamic Updates with First-class Contexts." Journal of Object Technology 12, no. 3 (2013): 1:1. http://dx.doi.org/10.5381/jot.2013.12.3.a1.

Full text

APA, Harvard, Vancouver, ISO, and other styles

27

Alferes, J. J., J. A. Leite, L. M. Pereira, H. Przymusinska, and T. C. Przymusinski. "Dynamic updates of non-monotonic knowledge bases." Journal of Logic Programming 45, no. 1-3 (September 2000): 43–70. http://dx.doi.org/10.1016/s0743-1066(99)00065-5.

Full text

APA, Harvard, Vancouver, ISO, and other styles

28

Ying, Bicheng, Kun Yuan, and Ali H. Sayed. "Dynamic Average Diffusion With Randomized Coordinate Updates." IEEE Transactions on Signal and Information Processing over Networks 5, no. 4 (December 2019): 753–67. http://dx.doi.org/10.1109/tsipn.2019.2942191.

Full text

APA, Harvard, Vancouver, ISO, and other styles

29

Cheng Haw, Su, Samini Subramaniam, Wei Siang Lim, and Fang Fang Chua. "Hybridation of Labeling Schemes for Efficient Dynamic Updates." Indonesian Journal of Electrical Engineering and Computer Science 4, no. 1 (October 1, 2016): 184. http://dx.doi.org/10.11591/ijeecs.v4.i1.pp184-194.

Full text

Abstract:

<p>With XML as the leading standard for data representation over the Web, it is crucial to store and query XML data. However, relational databases are the dominant database technology in most organizations. Thus, replacing relational database with a pure XML database is not a wise choice. One most prominent solution is to map XML into relational database. This paper introduces a robust labeling scheme which is a hybrid labeling scheme combining the beauty features of extended range and ORDPATH schemes to supports dynamic updates. In addition, we also proposed a mapping scheme based on the hybrid labeling scheme. Our proposed approach is evaluated in terms of (i) loading time, (ii) storage size, (iii) query retrieval time, and (iv) dynamic updates time, as compared to ORDPATH and ME schemes. The experimental evaluation results shows that our proposed approach is scalable to support huge datasets and dynamic updates.</p>

APA, Harvard, Vancouver, ISO, and other styles

30

Alanko, Jarno, Bahar Alipanahi, Jonathen Settle, Christina Boucher, and Travis Gagie. "Buffering updates enables efficient dynamic de Bruijn graphs." Computational and Structural Biotechnology Journal 19 (2021): 4067–78. http://dx.doi.org/10.1016/j.csbj.2021.06.047.

Full text

APA, Harvard, Vancouver, ISO, and other styles

31

Başkent, Can, and Guy McCusker. "A History Based Logic for Dynamic Preference Updates." Journal of Logic, Language and Information 29, no. 3 (November 12, 2019): 275–305. http://dx.doi.org/10.1007/s10849-019-09307-1.

Full text

APA, Harvard, Vancouver, ISO, and other styles

32

Kim, Dong Kwan, Eli Tilevich, and Calvin J. Ribbens. "Dynamic software updates for parallel high-performance applications." Concurrency and Computation: Practice and Experience 23, no. 4 (September 27, 2010): 415–34. http://dx.doi.org/10.1002/cpe.1663.

Full text

APA, Harvard, Vancouver, ISO, and other styles

33

Capili-Kummer, Marifel Grace, and Maria Leodevina C. Batugal. "Dynamic Alumni Monitoring with Decision Support System." International Journal of Recent Technology and Engineering 9, no. 5 (January 30, 2021): 279–84. http://dx.doi.org/10.35940/ijrte.f5308.019521.

Full text

Abstract:

The present study focuses on gathering a real-time data on the employability of graduates. The web-based Dynamic Alumni Monitoring with Decision Support System is developed and linked to the institution’s website to gather alumni information. To realize the objective of this study, the agile method research design process is utilized. The agile methodology is a project management technique in software development process. The system has the capacity to monitor the graduates. It provides alumni verifications and confirmation after the pre-registration. The system has a platform in maintaining alumni data and notifications to periodically update the graduates’ profiles anytime and anywhere. The system has the capacity to make updates concerning alumni activities of the University. These are sent through their registered email addresses. Likewise, the system generates important reports needed by the school and its administrators.

APA, Harvard, Vancouver, ISO, and other styles

34

Li, Xingcheng, and Shuangbiao Zhang. "A Real-Time Structure of Attitude Algorithm for High Dynamic Bodies." Journal of Control Science and Engineering 2017 (2017): 1–8. http://dx.doi.org/10.1155/2017/9542423.

Full text

Abstract:

To solve the real-time problem of attitude algorithm for high dynamic bodies, a real-time structure of attitude algorithm is developed by analyzing the conventional structure that has two stages, and a flow diagram of a real-time structure for a Matlab program is provided in detail. During the update of the attitude matrix, the real-time structure saves every element of attitude matrix in minor loop in real time and updates the next attitude matrix based on the previous matrix every subsample time. Thus, the real-time structure avoids lowering updating frequency, though the multisubsample algorithms are used. Simulation and analysis show that the real-time structure of attitude algorithm is better than the conventional structure due to short update time of attitude matrix and small drifting error, and it is more appropriate for high dynamic bodies.

APA, Harvard, Vancouver, ISO, and other styles

35

Chini, Louise, George Hurtt, Ritvik Sahajpal, Steve Frolking, Kees Klein Goldewijk, Stephen Sitch, Raphael Ganzenmüller, et al. "Land-use harmonization datasets for annual global carbon budgets." Earth System Science Data 13, no. 8 (August 26, 2021): 4175–89. http://dx.doi.org/10.5194/essd-13-4175-2021.

Full text

Abstract:

Abstract. Land-use change has been the dominant source of anthropogenic carbon emissions for most of the historical period and is currently one of the largest and most uncertain components of the global carbon cycle. Advancing the scientific understanding on this topic requires that the best data be used as input to state-of-the-art models in well-organized scientific assessments. The Land-Use Harmonization 2 dataset (LUH2), previously developed and used as input for simulations of the 6th Coupled Model Intercomparison Project (CMIP6), has been updated annually to provide required input to land models in the annual Global Carbon Budget (GCB) assessments. Here we discuss the methodology for producing these annual LUH2-GCB updates and extensions which incorporate annual wood harvest data updates from the Food and Agriculture Organization (FAO) of the United Nations for dataset years after 2015 and the History Database of the Global Environment (HYDE) gridded cropland and grazing area data updates (based on annual FAO cropland and grazing area data updates) for dataset years after 2012, along with extrapolations to the current year due to a lag of 1 or more years in the FAO data releases. The resulting updated LUH2-GCB datasets have provided global, annual gridded land-use and land-use-change data relating to agricultural expansion, deforestation, wood harvesting, shifting cultivation, regrowth and afforestation, crop rotations, and pasture management and are used by both bookkeeping models and dynamic global vegetation models (DGVMs) for the GCB. For GCB 2019, a more significant update to LUH2 was produced, LUH2-GCB2019 (https://doi.org/10.3334/ORNLDAAC/1851, Chini et al., 2020b), to take advantage of new data inputs that corrected cropland and grazing areas in the globally important region of Brazil as far back as 1950. From 1951 to 2012 the LUH2-GCB2019 dataset begins to diverge from the version of LUH2 used for the World Climate Research Programme's CMIP6, with peak differences in Brazil in the year 2000 for grazing land (difference of 100 000 km2) and in the year 2009 for cropland (difference of 77 000 km2), along with significant sub-national reorganization of agricultural land-use patterns within Brazil. The LUH2-GCB2019 dataset provides the base for future LUH2-GCB updates, including the recent LUH2-GCB2020 dataset, and presents a starting point for operationalizing the creation of these datasets to reduce time lags due to the multiple input dataset and model latencies.

APA, Harvard, Vancouver, ISO, and other styles

36

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 (April 15, 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 memory pool update rule in agreement with current vaccine-response experiments. Our results suggest that pathogenic environments are sparse and that memory repertoires significantly decrease infection costs, even with moderate sampling. The predicted optimal update scheme maps onto commonly considered competitive dynamics for antigen receptors.

APA, Harvard, Vancouver, ISO, and other styles

37

Zhao, Fuheng, Sujaya Maiyya, Ryan Wiener, Divyakant Agrawal, and Amr El Abbadi. "KLL±approximate quantile sketches over dynamic datasets." Proceedings of the VLDB Endowment 14, no. 7 (March 2021): 1215–27. http://dx.doi.org/10.14778/3450980.3450990.

Full text

Abstract:

Recently the long standing problem of optimal construction of quantile sketches was resolved byKarnin,Lang, andLiberty using the KLL sketch (FOCS 2016). The algorithm for KLL is restricted to online insert operations and no delete operations. For many real-world applications, it is necessary to support delete operations. When the data set is updated dynamically, i.e., when data elements are inserted and deleted, the quantile sketch should reflect the changes. In this paper, we proposeKLL±, the first quantile approximation algorithm to operate in thebounded deletionmodel to account for both inserts and deletes in a given data stream. KLL±extends the functionality of KLL sketches to support arbitrary updates with small space overhead. The space bound for KLL±is [EQUATION], where ∈ and δ are constants that determine precision and failure probability, and α bounds the number of deletions with respect to insert operations. The experimental evaluation of KLL±highlights that with minimal space overhead, KLL±achieves comparable accuracy in quantile approximation to KLL.

APA, Harvard, Vancouver, ISO, and other styles

38

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.

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

APA, Harvard, Vancouver, ISO, and other styles

39

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.

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

APA, Harvard, Vancouver, ISO, and other styles

40

JANSSON, JESPER, and ZESHAN PENG. "ONLINE AND DYNAMIC RECOGNITION OF SQUAREFREE STRINGS." International Journal of Foundations of Computer Science 18, no. 02 (April 2007): 401–14. http://dx.doi.org/10.1142/s0129054107004747.

Full text

Abstract:

The online squarefree recognition problem is to detect the first occurrence of a square in a string whose characters are provided as input one at a time. We present an efficient algorithm to solve this problem for strings over arbitrarily ordered alphabets in O(n log n) time, where n is the ending position of the first square. We also note that the same technique yields an O(n·(|Σn|+ log n))-time algorithm for general alphabets, where |Σn| is the number of different symbols in the first n positions of the input string. (This is faster than the previously fastest method for general alphabets when |Σn| = o( log 2 n).) Finally, we present a simple algorithm for a dynamic version of the problem over general alphabets in which we are initially given a squarefree string, followed by a series of updates, and the objective is to determine after each update if the resulting string is still squarefree.

APA, Harvard, Vancouver, ISO, and other styles

41

Haw, Su-Cheng, Aisyah Amin, Chee-Onn Wong, and Samini Subramaniam. "Improving the support for XML dynamic updates using a hybridization labeling scheme (ORD-GAP)." F1000Research 10 (September 9, 2021): 907. http://dx.doi.org/10.12688/f1000research.69108.1.

Full text

Abstract:

Background: As the standard for the exchange of data over the World Wide Web, it is important to ensure that the eXtensible Markup Language (XML) database is capable of supporting not only efficient query processing but also capable of enduring frequent data update operations over the dynamic changes of Web content. Most of the existing XML annotation is based on a labeling scheme to identify each hierarchical position of the XML nodes. This computation is costly as any updates will cause the whole XML tree to be re-labelled. This impact can be observed on large datasets. Therefore, a robust labeling scheme that avoids re-labeling is crucial. Method: Here, we present ORD-GAP (named after Order Gap), a robust and persistent XML labeling scheme that supports dynamic updates. ORD-GAP assigns unique identifiers with gaps in-between XML nodes, which could easily identify the level, Parent-Child (P-C), Ancestor-Descendant (A-D) and sibling relationship. ORD-GAP adopts the OrdPath labeling scheme for any future insertion. Results: We demonstrate that ORD-GAP is robust enough for dynamic updates, and have implemented it in three use cases: (i) left-most, (ii) in-between and (iii) right-most insertion. Experimental evaluations on DBLP dataset demonstrated that ORD-GAP outperformed existing approaches such as ORDPath and ME Labeling concerning database storage size, data loading time and query retrieval. On average, ORD-GAP has the best storing and query retrieval time. Conclusion: The main contributions of this paper are: (i) A robust labeling scheme named ORD-GAP that assigns certain gap between each node to support future insertion, and (ii) An efficient mapping scheme, which built upon ORD-GAP labeling scheme to transform XML into RDB effectively.

APA, Harvard, Vancouver, ISO, and other styles

42

Brünnler, Kai, Dandolo Flumini, and Thomas Studer. "A logic of blockchain updates." Journal of Logic and Computation 30, no. 8 (September 25, 2020): 1469–85. http://dx.doi.org/10.1093/logcom/exaa045.

Full text

Abstract:

Abstract Blockchains are distributed data structures that are used to achieve consensus in systems for cryptocurrencies (like Bitcoin) or smart contracts (like Ethereum). Although blockchains gained a lot of popularity recently, there are only few logic-based models for blockchains available. We introduce $\mathsf{BCL}$, a dynamic logic to reason about blockchain updates, and show that $\mathsf{BCL}$ is sound and complete with respect to a simple blockchain model.

APA, Harvard, Vancouver, ISO, and other styles

43

Gu, Dong Juan, and Li Yong Wan. "A XML Document Coding Schema Based on Binary." Applied Mechanics and Materials 496-500 (January 2014): 1877–80. http://dx.doi.org/10.4028/www.scientific.net/amm.496-500.1877.

Full text

Abstract:

In order to resolve the inefficiency for XML data query and support dynamic updates, etc, this paper has proposed an improved method to encode XML document nodes. On the basic of region encoding and the prefix encoding, it introduces a XML document coding schema base on binary (CSBB). The CSBB code use binary encoding strategy and make the bit string inserted in order. The bit string inserted algorithm can generate ordered bit string to reserve space for the inserted new nodes, and not influence on the others. Experiments shows the CSBB code can effectively avoid re-encoding of nodes, and supports the nodes Dynamic Update.

APA, Harvard, Vancouver, ISO, and other styles

44

Zhu, Chun Jiang, Tan Zhu, Kam-Yiu Lam, Song Han, and Jinbo Bi. "Communication-Optimal Distributed Dynamic Graph Clustering." Proceedings of the AAAI Conference on Artificial Intelligence 33 (July 17, 2019): 5957–64. http://dx.doi.org/10.1609/aaai.v33i01.33015957.

Full text

Abstract:

We consider the problem of clustering graph nodes over large-scale dynamic graphs, such as citation networks, images and web networks, when graph updates such as node/edge insertions/deletions are observed distributively. We propose communication-efficient algorithms for two well-established communication models namely the message passing and the blackboard models. Given a graph with n nodes that is observed at s remote sites over time [1,t], the two proposed algorithms have communication costs Õ(ns) and Õ(n + s) (Õ hides a polylogarithmic factor), almost matching their lower bounds, Ω(ns) and Ω(n + s), respectively, in the message passing and the blackboard models. More importantly, we prove that at each time point in [1,t] our algorithms generate clustering quality nearly as good as that of centralizing all updates up to that time and then applying a standard centralized clustering algorithm. We conducted extensive experiments on both synthetic and real-life datasets which confirmed the communication efficiency of our approach over baseline algorithms while achieving comparable clustering results.

APA, Harvard, Vancouver, ISO, and other styles

45

Subramaniam, Samini, Su-Cheng Haw, and Poo Kuan Hoong. "XML Labeling Schemes for Dynamic Updates: Strengths and Limitations." International Journal on Advanced Science, Engineering and Information Technology 1, no. 3 (2011): 236. http://dx.doi.org/10.18517/ijaseit.1.3.49.

Full text

APA, Harvard, Vancouver, ISO, and other styles

46

Borodin, Allan, Aadhar Jain, Hyun Chul Lee, and Yuli Ye. "Max-Sum Diversification, Monotone Submodular Functions, and Dynamic Updates." ACM Transactions on Algorithms 13, no. 3 (August 9, 2017): 1–25. http://dx.doi.org/10.1145/3086464.

Full text

APA, Harvard, Vancouver, ISO, and other styles

47

Baresi, Luciano, Carlo Ghezzi, Xiaoxing Ma, and Valerio Panzica La Manna. "Efficient Dynamic Updates of Distributed Components Through Version Consistency." IEEE Transactions on Software Engineering 43, no. 4 (April 1, 2017): 340–58. http://dx.doi.org/10.1109/tse.2016.2592913.

Full text

APA, Harvard, Vancouver, ISO, and other styles

48

Kadam, Jitendra V., and Wolfgang Marquardt. "Sensitivity-Based Solution Updates in Closed-Loop Dynamic Optimization." IFAC Proceedings Volumes 37, no. 9 (July 2004): 947–52. http://dx.doi.org/10.1016/s1474-6670(17)31930-4.

Full text

APA, Harvard, Vancouver, ISO, and other styles

49

Jawed, Azhar H., and A. J. Morris. "Higher-order updates for dynamic responses in structural optimization." Computer Methods in Applied Mechanics and Engineering 49, no. 2 (June 1985): 175–201. http://dx.doi.org/10.1016/0045-7825(85)90059-3.

Full text

APA, Harvard, Vancouver, ISO, and other styles

50

Wang, Jiafan, and Sherman S. M. Chow. "Forward and Backward-Secure Range-Searchable Symmetric Encryption." Proceedings on Privacy Enhancing Technologies 2022, no. 1 (November 20, 2021): 28–48. http://dx.doi.org/10.2478/popets-2022-0003.

Full text

Abstract:

Abstract Dynamic searchable symmetric encryption (DSSE) allows a client to query or update an outsourced encrypted database. Range queries are commonly needed. Previous range-searchable schemes either do not support updates natively (SIGMOD’16) or use file indexes of many long bit-vectors for distinct keywords, which only support toggling updates via homomorphically flipping the presence bit. (ESORICS’18). We propose a generic upgrade of any (inverted-index) DSSE to support range queries (a.k.a. range DSSE), without homomorphic encryption, and a specific instantiation with a new trade-off reducing client-side storage. Our schemes achieve forward security, an important property that mitigates file injection attacks. Moreover, we identify a variant of injection attacks against the first somewhat dynamic scheme (ESORICS’18). We also extend the definition of backward security to range DSSE and show that our schemes are compatible with a generic upgrade of backward security (CCS’17). We comprehensively analyze the computation and communication overheads, including implementation details of client-side index-related operations omitted by prior schemes. We show high empirical efficiency for million-scale databases over a million-scale keyword space.

APA, Harvard, Vancouver, ISO, and other styles

Journal articles on the topic 'Dynamic updates'

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