Journal articles: 'Dynamic update'

1

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

Full text

Abstract:

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

APA, Harvard, Vancouver, ISO, and other styles

2

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

Full text

Abstract:

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

APA, Harvard, Vancouver, ISO, and other styles

3

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

Full text

Abstract:

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

APA, Harvard, Vancouver, ISO, and other styles

4

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

Full text

Abstract:

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

APA, Harvard, Vancouver, ISO, and other styles

5

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

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

Full text

Abstract:

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

APA, Harvard, Vancouver, ISO, and other styles

7

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

Full text

Abstract:

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

APA, Harvard, Vancouver, ISO, and other styles

8

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

Full text

Abstract:

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

APA, Harvard, Vancouver, ISO, and other styles

9

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

Full text

Abstract:

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

APA, Harvard, Vancouver, ISO, and other styles

10

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

Full text

Abstract:

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

APA, Harvard, Vancouver, ISO, and other styles

11

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

12

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

13

Nahabedian, Leandro, Victor Braberman, Nicolas Dippolito, Shinichi Honiden, Jeff Kramer, Kenji Tei, and Sebastian Uchitel. "Dynamic Update of Discrete Event Controllers." IEEE Transactions on Software Engineering 46, no. 11 (November 1, 2020): 1220–40. http://dx.doi.org/10.1109/tse.2018.2876843.

Full text

APA, Harvard, Vancouver, ISO, and other styles

14

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

15

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

16

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

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

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 iteration of mean-shift algorithm with the particle filter, thus boost the performance of efficiency. Experimental results show the feasibility of the proposed algorithm in this paper.

APA, Harvard, Vancouver, ISO, and other styles

19

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

20

SLOTA, MARTIN, JOÃO LEITE, and TERRANCE SWIFT. "Splitting and updating hybrid knowledge bases." Theory and Practice of Logic Programming 11, no. 4-5 (July 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 to be an extremely difficult task. In Slota and Leite (2010b Towards Closed World Reasoning in Dynamic Open Worlds.Theory and Practice of Logic Programming, 26th Int'l. Conference on Logic Programming (ICLP'10) Special Issue10(4–6) (July), 547–564.), a first step towards addressing this problem was taken, and an update operator for hybrid knowledge bases was proposed. Despite its significance—not only for being the first update operator for hybrid knowledge bases in the literature, but also because it has some applications—this operator was defined for a restricted class of problems where only the ABox was allowed to change, which considerably diminished its applicability. Many applications that use hybrid knowledge bases in dynamic scenarios require both DL axioms and rules to be updated. In this paper, motivated by real world applications, we introduce an update operator for a large class of hybrid knowledge bases where both the DL component as well as the rule component are allowed to dynamically change. We introduce splitting sequences and splitting theorem for hybrid knowledge bases, use them to define a modular update semantics, investigate its basic properties, and illustrate its use on a realistic example about cargo imports.

APA, Harvard, Vancouver, ISO, and other styles

21

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

22

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

23

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 cartographic data of topographic map, include feature content, database structure, Database-driven Mapping technology, workflow and so on.

APA, Harvard, Vancouver, ISO, and other styles

24

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 cartographic data of topographic map, include feature content, database structure, Database-driven Mapping technology, workflow and so on.

APA, Harvard, Vancouver, ISO, and other styles

25

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

26

Pan, Wu Min. "Dynamic Update Mechanism in Wireless Sensor Networks." Applied Mechanics and Materials 526 (February 2014): 267–72. http://dx.doi.org/10.4028/www.scientific.net/amm.526.267.

Full text

Abstract:

Many researches use diff environmental conditions or application requirements in WSN. In the default Deluge mechanism, it will recover a sensor node from an updating error by reloading the stored full image again or waiting for the host machine to retransmit the full image again. This strategy is easy to implement and intuitive, but replacing the current executing image by retransmitting a full image file again is resource-consuming. To avoid retransmitting the full image when performing recovery, at the time when diff-based updating procedures have been finished, sensor nodes using our recovery mechanisms will backup the received patch files (i.e. diff script) in flash memory. Our mechanisms would effectively utilize flash memory space to store several backup patch files. When recovery is needed, our mechanismswould incrementally recover a failed node by patching up the system with each of the backup patch files. In the design of our recovery mechanisms, the failed sensor node will first try its best to recover itself without the assistance of the host machine, in order to avoid affecting the operations of other normal nodes when performing recovery procedures. Thus, compared with the full image replacement strategy, our mechanisms can save many computing resources.

APA, Harvard, Vancouver, ISO, and other styles

27

Tesone, Pablo, Guillermo Polito, Noury Bouraqadi, Stéphane Ducasse, and Luc Fabresse. "Dynamic Software Update from Development to Production." Journal of Object Technology 17, no. 1 (2018): 1:1. http://dx.doi.org/10.5381/jot.2018.17.1.a2.

Full text

APA, Harvard, Vancouver, ISO, and other styles

28

Tan, Jianhao, Shanshan Tan, Wang Yin, Liming Liu, Siyuan Zhang, and Yaonan Wang. "Dynamic Update Siamese Networks with Deeper Features." IOP Conference Series: Materials Science and Engineering 790 (April 7, 2020): 012037. http://dx.doi.org/10.1088/1757-899x/790/1/012037.

Full text

APA, Harvard, Vancouver, ISO, and other styles

29

Sasaki, Hironori, Yoshinao Taketomi, Jian Ma, Yeshaiahu Fainman, and Sing H. Lee. "Fast update of dynamic photorefractive optical memory." Optics Letters 17, no. 20 (October 15, 1992): 1468. http://dx.doi.org/10.1364/ol.17.001468.

Full text

APA, Harvard, Vancouver, ISO, and other styles

30

Miller, Scott. "2016 Update on High Dynamic Range Television." SMPTE Motion Imaging Journal 125, no. 7 (September 2016): 88–89. http://dx.doi.org/10.5594/jmi.2016.2598689.

Full text

APA, Harvard, Vancouver, ISO, and other styles

31

Miller, Scott. "2017 Update on High Dynamic Range Television." SMPTE Motion Imaging Journal 126, no. 7 (September 2017): 94–96. http://dx.doi.org/10.5594/jmi.2017.2724645.

Full text

APA, Harvard, Vancouver, ISO, and other styles

32

Miller, Scott. "2018 Update on High Dynamic Range Television." SMPTE Motion Imaging Journal 127, no. 8 (September 2018): 91–93. http://dx.doi.org/10.5594/jmi.2018.2849659.

Full text

APA, Harvard, Vancouver, ISO, and other styles

33

Foerster, Klaus-Tycho, Janne H. Korhonen, Ami Paz, Joel Rybicki, and Stefan Schmid. "Input-Dynamic Distributed Algorithms for Communication Networks." Proceedings of the ACM on Measurement and Analysis of Computing Systems 5, no. 1 (February 18, 2021): 1–33. http://dx.doi.org/10.1145/3447384.

Full text

Abstract:

Consider a distributed task where the communication network is fixed but the local inputs given to the nodes of the distributed system may change over time. In this work, we explore the following question: if some of the local inputs change, can an existing solution be updated efficiently, in a dynamic and distributed manner? To address this question, we define the batch dynamic \congest model in which we are given a bandwidth-limited communication network and a dynamic edge labelling defines the problem input. The task is to maintain a solution to a graph problem on the labeled graph under batch changes. We investigate, when a batch of α edge label changes arrive, \beginitemize \item how much time as a function of α we need to update an existing solution, and \item how much information the nodes have to keep in local memory between batches in order to update the solution quickly. \enditemize Our work lays the foundations for the theory of input-dynamic distributed network algorithms. We give a general picture of the complexity landscape in this model, design both universal algorithms and algorithms for concrete problems, and present a general framework for lower bounds. In particular, we derive non-trivial upper bounds for two selected, contrasting problems: maintaining a minimum spanning tree and detecting cliques.

APA, Harvard, Vancouver, ISO, and other styles

34

Luy, Nguyen Tan. "Robust adaptive dynamic programming based online tracking control algorithm for real wheeled mobile robot with omni-directional vision system." Transactions of the Institute of Measurement and Control 39, no. 6 (February 29, 2016): 832–47. http://dx.doi.org/10.1177/0142331215620267.

Full text

Abstract:

This paper proposes a new method to design an online robust adaptive dynamic programming algorithm (RADPA) for a wheeled mobile robot which is equipped with an omni-directional vision system. To integrate kinematic and dynamic controllers into the unique controller, we transform the strict feedback system dynamics into tracking error dynamics. Then, we propose a control scheme which uses only one neural network rather than three proposed in the actor-critic-based control schemes for the two-player zero-sum game problem. A neural network weight update law is designed for approximating the solution of the Hamilton–Jacobi–Isaacs equation without knowing knowledge of internal system dynamics. To implement the scheme, we propose the online RADPA, in which control and disturbance laws are updated simultaneously in an iterative loop. The convergence and stability of the online RADPA are proven by Lyapunov techniques. Simulations and experiments on a wheeled mobile robot testbed are carried out to verify the effectiveness of the proposed algorithm.

APA, Harvard, Vancouver, ISO, and other styles

35

Heiser, Laura M., Rebecca A. Berman, Richard C. Saunders, and Carol L. Colby. "Dynamic Circuitry for Updating Spatial Representations. II. Physiological Evidence for Interhemispheric Transfer in Area LIP of the Split-Brain Macaque." Journal of Neurophysiology 94, no. 5 (November 2005): 3249–58. http://dx.doi.org/10.1152/jn.00029.2005.

Full text

Abstract:

With each eye movement, a new image impinges on the retina, yet we do not notice any shift in visual perception. This perceptual stability indicates that the brain must be able to update visual representations to take our eye movements into account. Neurons in the lateral intraparietal area (LIP) update visual representations when the eyes move. The circuitry that supports these updated representations remains unknown, however. In this experiment, we asked whether the forebrain commissures are necessary for updating in area LIP when stimulus representations must be updated from one visual hemifield to the other. We addressed this question by recording from LIP neurons in split-brain monkeys during two conditions: stimulus traces were updated either across or within hemifields. Our expectation was that across-hemifield updating activity in LIP would be reduced or abolished after transection of the forebrain commissures. Our principal finding is that LIP neurons can update stimulus traces from one hemifield to the other even in the absence of the forebrain commissures. This finding provides the first evidence that representations in parietal cortex can be updated without the use of direct cortico-cortical links. The second main finding is that updating activity in LIP is modified in the split-brain monkey: across-hemifield signals are reduced in magnitude and delayed in onset compared with within-hemifield signals, which indicates that the pathways for across-hemifield updating are less effective in the absence of the forebrain commissures. Together these findings reveal a dynamic circuit that contributes to updating spatial representations.

APA, Harvard, Vancouver, ISO, and other styles

36

Giannakopoulou, Kalliopi, Andreas Paraskevopoulos, and Christos Zaroliagis. "Multimodal Dynamic Journey-Planning." Algorithms 12, no. 10 (October 13, 2019): 213. http://dx.doi.org/10.3390/a12100213.

Full text

Abstract:

In this paper, a new model, known as the multimodal dynamic timetable model (DTM), is presented for computing optimal multimodal journeys in schedule-based public transport systems. The new model constitutes an extension of the dynamic timetable model (DTM), which was developed originally for a different setting (unimodal journey-planning). Multimodal DTM demonstrates a very fast query algorithm that meets the requirement for real-time response to best journey queries, and an ultra-fast update algorithm for updating the timetable information in case of delays of scheduled-based vehicles. An experimental study on real-world metropolitan networks demonstrates that the query and update algorithms of Multimodal DTM compare favorably with other state-of-the-art approaches when public transport, including unrestricted—with respect to departing time—traveling (e.g., walking and electric vehicles) is considered.

APA, Harvard, Vancouver, ISO, and other styles

37

Bhattacharya, Sayan, Deeparnab Chakrabarty, and Monika Henzinger. "Deterministic Dynamic Matching in O(1) Update Time." Algorithmica 82, no. 4 (September 28, 2019): 1057–80. http://dx.doi.org/10.1007/s00453-019-00630-4.

Full text

Abstract:

Abstract We consider the problems of maintaining an approximate maximum matching and an approximate minimum vertex cover in a dynamic graph undergoing a sequence of edge insertions/deletions. Starting with the seminal work of Onak and Rubinfeld (in: Proceedings of the ACM symposium on theory of computing (STOC), 2010), this problem has received significant attention in recent years. Very recently, extending the framework of Baswana et al. (in: Proceedings of the IEEE symposium on foundations of computer science (FOCS), 2011) , Solomon (in: Proceedings of the IEEE symposium on foundations of computer science (FOCS), 2016) gave a randomized dynamic algorithm for this problem that has an approximation ratio of 2 and an amortized update time of O(1) with high probability. This algorithm requires the assumption of an oblivious adversary, meaning that the future sequence of edge insertions/deletions in the graph cannot depend in any way on the algorithm’s past output. A natural way to remove the assumption on oblivious adversary is to give a deterministic dynamic algorithm for the same problem in O(1) update time. In this paper, we resolve this question. We present a new deterministic fully dynamic algorithm that maintains a O(1)-approximate minimum vertex cover and maximum fractional matching, with an amortized update time of O(1). Previously, the best deterministic algorithm for this problem was due to Bhattacharya et al. (in: Proceedings of the ACM-SIAM symposium on discrete algorithms (SODA), 2015); it had an approximation ratio of $$(2+\varepsilon )$$(2+ε) and an amortized update time of $$O(\log n/\varepsilon ^2)$$O(logn/ε2). Our result can be generalized to give a fully dynamic $$O(f^3)$$O(f3)-approximate algorithm with $$O(f^2)$$O(f2) amortized update time for the hypergraph vertex cover and fractional hypergraph matching problem, where every hyperedge has at most f vertices.

APA, Harvard, Vancouver, ISO, and other styles

38

Fernandes, Carlos M., Nuno Fachada, Juan-Julián Merelo, and Agostinho C. Rosa. "Steady state particle swarm." PeerJ Computer Science 5 (August 26, 2019): e202. http://dx.doi.org/10.7717/peerj-cs.202.

Full text

Abstract:

This paper investigates the performance and scalability of a new update strategy for the particle swarm optimization (PSO) algorithm. The strategy is inspired by the Bak–Sneppen model of co-evolution between interacting species, which is basically a network of fitness values (representing species) that change over time according to a simple rule: the least fit species and its neighbors are iteratively replaced with random values. Following these guidelines, a steady state and dynamic update strategy for PSO algorithms is proposed: only the least fit particle and its neighbors are updated and evaluated in each time-step; the remaining particles maintain the same position and fitness, unless they meet the update criterion. The steady state PSO was tested on a set of unimodal, multimodal, noisy and rotated benchmark functions, significantly improving the quality of results and convergence speed of the standard PSOs and more sophisticated PSOs with dynamic parameters and neighborhood. A sensitivity analysis of the parameters confirms the performance enhancement with different parameter settings and scalability tests show that the algorithm behavior is consistent throughout a substantial range of solution vector dimensions.

APA, Harvard, Vancouver, ISO, and other styles

39

Liu, Y., W. Sun, C. Li, X. Liu, and C. Fang. "DESIGN AND IMPLEMENTATION OF DYNAMIC UPDATE SYSTEM FOR GEOGRAPHICAL NAMES AND ADDRESSES." ISPRS - International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences XLII-4 (September 19, 2018): 379–82. http://dx.doi.org/10.5194/isprs-archives-xlii-4-379-2018.

Full text

Abstract:

<p><strong>Abstract.</strong> In order to solve the problem of the long update cycle of geographical names and addresses, this paper puts forward a dynamic update technique of mobile & PC integration. The combination of related services of NewMap software and mobile APP can effectively improve the speed and accuracy of updating geographical names and addresses. Taking the mobile & PC integration model as a starting point and comprehensively using GIS-related technologies, mobile positioning technologies, offline map technologies, etc., the dynamic update of geographical names and addresses has been successfully implemented and has been successfully applied to the dynamic update of geographical names.</p>

APA, Harvard, Vancouver, ISO, and other styles

40

Deng, Song. "Dynamic Non-Cooperative Structured Deep Web Selection." Applied Mechanics and Materials 644-650 (September 2014): 2911–14. http://dx.doi.org/10.4028/www.scientific.net/amm.644-650.2911.

Full text

Abstract:

Most of structured deep web data sources are non-cooperation, therefore establish an accurate data source content summary by sampling is the core technology of data source selection. The content of deep web data source is updated from time to time, however existing efficient methods of non-cooperation structured data source selection does not consider summary update problem. Unrenewed summary of data source can not accurately characterize the content of the data source that produce a greater impact on data source selection. Base on this, we propose a dynamic data source selection method for non-cooperative structured deep web by combining subject headings sampling technology and subject headings extension technology. The experiment results show that our dynamic structured data source selection method has good recall ratio and precision besides being efficient.

APA, Harvard, Vancouver, ISO, and other styles

41

Lee, Eun-Taik, and Hee-Chang Eun. "Update of parameter matrices of the dynamic system using the least-squares approach." Advances in Mechanical Engineering 11, no. 11 (November 2019): 168781401989080. http://dx.doi.org/10.1177/1687814019890806.

Full text

Abstract:

Model-based responses rarely coincide with the actual responses owing to modeling and measurement errors, deterioration of structural performance, and presence of damages in the structure. The parameter matrices should be updated for successful subsequent analysis and design efforts. This study derives the mathematical forms of variations in the parameter matrices between the actual system and the analytical model. A method using the least-squares principle constrained by the measured modal data is presented. The method is directly derived by minimizing the performance indices expressed by the norm of the variation in the parameter matrices between the actual system and the analytical model. The proposed update methods predict the updated parameter matrices depending on the prescribed weighting matrices and detect damages from the predicted parameter matrix variations. Examples compare the methods depending on the established weighting matrices, the number of measurement data sets of the first modal data only and the lowest two modal data. This study also investigates the effect of external noise contained in the measured data.

APA, Harvard, Vancouver, ISO, and other styles

42

Hefzy, Mohamed Samir, and T. Derek V. Cooke. "Review of Knee Models: 1996 Update." Applied Mechanics Reviews 49, no. 10S (October 1, 1996): S187—S193. http://dx.doi.org/10.1115/1.3101971.

Full text

Abstract:

This paper is an update on our previous review of knee models (Hefzy and Grood [30]). We find that progress was made in the area of dynamic modeling. Since 1988, a technique was developed to solve the system of differential algebraic equations describing the three-dimensional dynamic behavior of the knee joint. This technique allows to solve complex problems. However, not a single dynamic comprehensive anatomically based mathematical three-dimensional model of the knee joint that includes both tibio-femoral and patello-femoral joints has yet been developed. In the area of meniscal modeling, we find that only one three-dimensional model of the knee joint that includes the menisci is available in the literature. This quasi-static model includes menisci, tibial, femoral and patellar cartilage layers, and ligamentous structures. This model is limited since it solves only for one position of the knee joint: full extension. From this updated survey, we conclude that the development of a comprehensive three-dimensional anatomically based mathematical model of the knee joint (that solves the three-body contact problem at the tibio-femoral joint between the menisci, tibia and femur, and includes the patello-femoral joint) continues to present major challenge.

APA, Harvard, Vancouver, ISO, and other styles

43

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

44

Yi-Bing Lin, Pei-Chun Lee, and I. Chlamtac. "Dynamic periodic location area update in mobile networks." IEEE Transactions on Vehicular Technology 51, no. 6 (November 2002): 1494–501. http://dx.doi.org/10.1109/tvt.2002.802984.

Full text

APA, Harvard, Vancouver, ISO, and other styles

45

Santos, Juan Miguel, and Claude Touzet. "Dynamic Update of the Reinforcement Function During Learning." Connection Science 11, no. 3-4 (December 1999): 267–89. http://dx.doi.org/10.1080/095400999116250.

Full text

APA, Harvard, Vancouver, ISO, and other styles

46

Owen, D. Peter. "Dynamic Rounding in Digital Video Processing: An Update." SMPTE Journal 98, no. 6 (June 1989): 447–50. http://dx.doi.org/10.5594/j02740.

Full text

APA, Harvard, Vancouver, ISO, and other styles

47

Gallardo Pérez, H. J., M. Vergel Ortega, and J. P. Rojas-Suárez. "Dynamic and sequential update for time series forecasting." Journal of Physics: Conference Series 1587 (July 2020): 012016. http://dx.doi.org/10.1088/1742-6596/1587/1/012016.

Full text

APA, Harvard, Vancouver, ISO, and other styles

48

Hayden, Christopher M., Edward K. Smith, Eric A. Hardisty, Michael Hicks, and Jeffrey S. Foster. "Evaluating Dynamic Software Update Safety Using Systematic Testing." IEEE Transactions on Software Engineering 38, no. 6 (November 2012): 1340–54. http://dx.doi.org/10.1109/tse.2011.101.

Full text

APA, Harvard, Vancouver, ISO, and other styles

49

Zhang, Shi, and Linpeng Huang. "Research on dynamic update transaction for Java classes." Frontiers of Computer Science in China 1, no. 3 (July 2007): 313–21. http://dx.doi.org/10.1007/s11704-007-0030-3.

Full text

APA, Harvard, Vancouver, ISO, and other styles

50

Zhang, Qiang, Bao Li, Quan Yuan, Mingfu Lu, and Xinlei Huang. "Database dynamic update management system for power system." Journal of Physics: Conference Series 1550 (May 2020): 052001. http://dx.doi.org/10.1088/1742-6596/1550/5/052001.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Journal articles on the topic 'Dynamic update'

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