On the Effect of Update Frequency on Geo-Indistinguishability of Mobility Traces

2018 ◽  
Author(s):  
Ricardo Mendes ◽  
João Vilela
Keyword(s):  
Update Frequency

Analysis of Blacklist Update Frequency for Countering Malware Attacks on Websites

2014 ◽  
Vol E97.B (1) ◽  
pp. 76-86
Author(s):  
Takeshi YAGI ◽  
Junichi MURAYAMA ◽  
Takeo HARIU ◽  
Sho TSUGAWA ◽  
Hiroyuki OHSAKI ◽  
...  
Keyword(s):  
Update Frequency

scholarly journals Distributed Attitude Synchronization for Spacecraft Formation Flying via Event-Triggered Control

2021 ◽  
Vol 11 (14) ◽  
pp. 6299
Author(s):  
Xiong Xie ◽  
Tao Sheng ◽  
Liang He
Keyword(s):  
Control System ◽  
Formation Flying ◽  
Spacecraft Formation ◽  
Spacecraft Formation Flying ◽  
Control Scheme ◽  
Event Triggering ◽  
Computational Resources ◽  
Update Frequency ◽  
Attitude Synchronization ◽  
Event Triggered

The distributed attitude synchronization control problem for spacecraft formation flying subject to limited energy and computational resources is addressed based on event-triggered mechanism. Firstly, a distributed event-driven controller is designed to achieve attitude coordination with the limitation of energy and computing resources. Under the proposed control strategy, the controller is only updated at the event triggering instants, which effectively reduces the update frequency. Subsequently, an event-triggered strategy is developed to further decrease energy consumption and the amount of computation. The proposed event-triggered function only requires the latest state information about its neighbors, implying that the trigger threshold does not need to be calculated continuously. It is shown that the triggering interval between two successive events is strictly positive, showing that the control system has no Zeno phenomenon. Moreover, the update frequency of the proposed controller can be reduced by more than 90% compared to the update frequency of the corresponding time-driven controller with an update frequency of 10 Hz by choosing appropriate control parameters and the control system can still achieve high-precision convergence. Finally, the effectiveness of the constructed control scheme is verified by numerical simulations.

Sales and operations planning for new products: a parallel process?

2021 ◽  
Vol ahead-of-print (ahead-of-print) ◽  
Author(s):  
Gustavo Bagni ◽  
Juliana Keiko Sagawa ◽  
Moacir Godinho Filho
Keyword(s):  
Design Science ◽  
Contextual Factors ◽  
New Products ◽  
Science Research ◽  
Operations Planning ◽  
Content Type ◽  
Demand Fulfillment ◽  
Viable Solution ◽  
Additional Costs ◽  
Update Frequency

PurposeThis paper aims to detail how a Sales and Operations Planning (S&OP) process can be designed to support the planning requirements of recently introduced products.Design/methodology/approachDesign science research was conducted to propose and implement an S&OP model for demand fulfillment after the introduction of new products. The results were analyzed using the CIMO (Context, Intervention, Mechanisms and Outcomes) logic, and two sets of design propositions were formulated.FindingsAn S&OP process for new products can reduce additional costs for market fulfillment by concentrating the planning efforts on new products, aligning organizational efforts, and increasing the sales and supply chain information’s update frequency.Research limitations/implicationsThe outcomes of S&OP new products were analyzed in a single organization and are limited to the contextual factors presented.Practical implicationsThis paper describes in detail how to organize an S&OP focused on new products. By considering the contextual factors and design propositions, managers can potentially increase the success of new products introduction (NPI) in their context.Originality/valueA specific S&OP process focused on new products is a viable solution and could co-exist with a traditional S&OP process. Moreover, we identified six contextual factors that influence the outcomes of the S&OP new products.

scholarly journals Comparative verification in complex topography

2021 ◽  
Author(s):  
Jonas Bhend ◽  
Jean-Christophe Orain ◽  
Vera Schönenberger ◽  
Christoph Spirig ◽  
Lionel Moret ◽  
...  
Keyword(s):  
Weather Forecasting ◽  
Absolute Error ◽  
Time Of Day ◽  
Probabilistic Forecasts ◽  
Wide Range ◽  
Direct Model ◽  
Forecasting System ◽  
The Mean ◽  
Update Frequency ◽  
Core Activity

<p>Verification is a core activity in weather forecasting. Insights from verification are used for monitoring, for reporting, to support and motivate development of the forecasting system, and to allow users to maximize forecast value. Due to the broad range of applications for which verification provides valuable input, the range of questions one would like to answer can be very large. Static analyses and summary verification results are often insufficient to cover this broad range. To this end, we developed an interactive verification platform at MeteoSwiss that allows users to inspect verification results from a wide range of angles to find answers to their specific questions.</p><p>We present the technical setup to achieve a flexible yet performant interactive platform and two prototype applications: monitoring of direct model output from operational NWP systems and understanding of the capabilities and limitations of our pre-operational postprocessing. We present two innovations that illustrate the user-oriented approach to comparative verification adopted as part of the platform. To facilitate the comparison of a broad range of forecasts issued with varying update frequency, we rely on the concept of time of verification to collocate the most recent available forecasts at the time of day at which the forecasts are used. In addition, we offer a matrix selection to more flexibly select forecast sources and scores for comparison. Doing so, we can for example compare the mean absolute error (MAE) for deterministic forecasts to the MAE and continuous ranked probability scores of probabilistic forecasts to illustrate the benefit of using probabilistic forecasts.</p>

scholarly journals A Block Classification Method with Monitor and Restriction in NAND Flash memory

2021 ◽  
Vol 12 (5) ◽  
pp. 209-215
Author(s):  
Myungsub Lee
Keyword(s):  
Performance Evaluation ◽  
Standard Deviation ◽  
Flash Memory ◽  
Garbage Collection ◽  
Memory Systems ◽  
Nand Flash ◽  
Nand Flash Memory ◽  
Wear Leveling ◽  
Block Classification ◽  
Update Frequency

In this paper, we propose a block classification with monitor and restriction (BCMR) method to isolate and reduce the interference of blocks in garbage collection and wear leveling. The proposed method monitors the endurance variation of blocks during garbage collection and detects hot blocks by making a restriction condition based on this information. This method induces block classification by its update frequency for garbage collection and wear leveling, resulting in a prolonged lifespan for NAND flash memory systems. The performance evaluation results show that the BCMR method prolonged the life of NAND flash memory systems by 3.95% and reduced the standard deviation per block by 7.4%, on average.

scholarly journals What Weights Work for You? Adapting Weights for Any Pareto Front Shape in Decomposition-Based Evolutionary Multiobjective Optimisation

2020 ◽  
Vol 28 (2) ◽  
pp. 227-253 ◽  
Author(s):  
Miqing Li ◽  
Xin Yao
Keyword(s):  
Pareto Front ◽  
Evolutionary Process ◽  
Highly Nonlinear ◽  
Distributed Solutions ◽  
Front Shape ◽  
Different Shapes ◽  
Pareto Fronts ◽  
The Given ◽  
Update Frequency

The quality of solution sets generated by decomposition-based evolutionary multi-objective optimisation (EMO) algorithms depends heavily on the consistency between a given problem's Pareto front shape and the specified weights' distribution. A set of weights distributed uniformly in a simplex often leads to a set of well-distributed solutions on a Pareto front with a simplex-like shape, but may fail on other Pareto front shapes. It is an open problem on how to specify a set of appropriate weights without the information of the problem's Pareto front beforehand. In this article, we propose an approach to adapt weights during the evolutionary process (called AdaW). AdaW progressively seeks a suitable distribution of weights for the given problem by elaborating several key parts in weight adaptation—weight generation, weight addition, weight deletion, and weight update frequency. Experimental results have shown the effectiveness of the proposed approach. AdaW works well for Pareto fronts with very different shapes: 1) the simplex-like, 2) the inverted simplex-like, 3) the highly nonlinear, 4) the disconnect, 5) the degenerate, 6) the scaled, and 7) the high-dimensional.

scholarly journals Effects of the update frequency of production plans on the logistical performance of production planning and control

Procedia CIRP ◽  
2019 ◽  
Vol 79 ◽  
pp. 421-426 ◽  
Author(s):  
Guenther Schuh ◽  
Jan-Philipp Prote ◽  
Melanie Luckert ◽  
Philipp Hünnekes ◽  
Matthias Schmidhuber
Keyword(s):  
Production Planning ◽  
Production Planning And Control ◽  
Planning And Control ◽  
And Control ◽  
Production Plans ◽  
Update Frequency

Research on the Incremental Updating Mechanism of Marine Environmental Data Warehouse

2014 ◽  
Vol 668-669 ◽  
pp. 1378-1381 ◽  
Author(s):  
Wei Jun Wen
Keyword(s):  
Data Warehouse ◽  
Marine Environment ◽  
Historical Data ◽  
Environmental Data ◽  
Operating Efficiency ◽  
Massive Data ◽  
Complete Set ◽  
Incremental Update ◽  
Update Frequency ◽  
Marine Environmental

Marine environment data warehouse can store massive data. After the full amount of historical data has been initially loaded, the incremental update mode must be applied to ensure timely updates of data. In this paper, in view of the marine environment data warehouse’s characteristics, such as massive data amount, large number of historical data and low update frequency, a complete set of mechanisms for incremental update of marine environment data warehouse was proposed to greatly improve the operating efficiency of marine environment data warehouse.

scholarly journals An efficient crowd-sourcing-based approach for fingerprint database updating

2019 ◽  
Vol 15 (6) ◽  
pp. 155014771985851
Author(s):  
Xi Liu ◽  
Jian Cen ◽  
Yiju Zhan ◽  
Chengpei Tang
Keyword(s):  
Large Scale ◽  
Indoor Localization ◽  
Primary Concern ◽  
Indoor Environments ◽  
Crowd Sourcing ◽  
Static Data ◽  
Decision Methods ◽  
Fingerprint Database ◽  
Update Frequency

Fingerprint-based indoor localization has become one of the most attractive and promising techniques; however, one primary concern for this technology to be fully practical is to maintain the fingerprint database to combat harsh indoor environmental dynamics, especially in the large-scale and long-term deployment. In this article, focusing on three key problems now existing in fingerprint database updating approaches such as the mechanism for triggering updates, the collection of new fingerprints and determination of fingerprints’ location information, we propose a fuzzy map mechanism and decision methods of neighbours’ fingerprints in response to all kinds of changes in indoor environments. Meanwhile, we design a static data collecting mechanism to filter reliable information from numerous users’ inputs and propose a neighbours’ fingerprint-assisted technique to calculate the location of fingerprints. Experimental results demonstrate that the proposed solution not only improves the performance of updating the fingerprint database in real time and robustness by 40% and 50%, respectively, but also reduces the update frequency and improves mean location accuracy by over 40%.

Sign in / Sign up

Export Citation Format

Share Document