Journal articles on the topic 'Temporal verification'

To see the other types of publications on this topic, follow the link: Temporal verification.

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

Select a source type:

Consult the top 50 journal articles for your research on the topic 'Temporal verification.'

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

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

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

1

Yamada, Chikatoshi, Yasunori Nagata, and Zensho Nakao. "An Efficient Specification for System Verification." Journal of Advanced Computational Intelligence and Intelligent Informatics 10, no. 6 (November 20, 2006): 931–38. http://dx.doi.org/10.20965/jaciii.2006.p0931.

Full text
Abstract:
In design of complex and large scale systems, system verification has played an important role. In this article, we focus on specification process of model checking in system verifications. Modeled systems are in general specified by temporal formulas of computation tree logic, and users must know well about temporal specification because the specification might be complex. We propose a method by which specifications with temporal formulas are obtained inductively. We will show verification results using the proposed temporal formula specification method, and show that amount of memory, OBDD nodes, and execution time are reduced.
APA, Harvard, Vancouver, ISO, and other styles
2

Fix, L. "Verification of temporal properties." Journal of Logic and Computation 6, no. 3 (June 1, 1996): 343–61. http://dx.doi.org/10.1093/logcom/6.3.343.

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

Brunet, Dominique, David Sills, and Barbara Casati. "A Spatio-Temporal User-Centric Distance for Forecast Verification." Meteorologische Zeitschrift 27, no. 6 (December 11, 2018): 441–53. http://dx.doi.org/10.1127/metz/2018/0883.

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

Kröger, F. "On temporal program verification rules." RAIRO. Informatique théorique 19, no. 3 (1985): 261–80. http://dx.doi.org/10.1051/ita/1985190302611.

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

Sánchez, Alejandro, and César Sánchez. "Parametrized verification diagrams: temporal verification of symmetric parametrized concurrent systems." Annals of Mathematics and Artificial Intelligence 80, no. 3-4 (November 15, 2016): 249–82. http://dx.doi.org/10.1007/s10472-016-9531-9.

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

Zhou, Min, William N. N. Hung, Xiaoyu Song, Ming Gu, and Jiaguang Sun. "Temporal Coverage Analysis for Dynamic Verification." IEEE Transactions on Circuits and Systems II: Express Briefs 65, no. 1 (January 2018): 66–70. http://dx.doi.org/10.1109/tcsii.2017.2746744.

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

Abowd, Gregory D., and Lein Ton. "Automated verification of temporal dialogue properties." ACM SIGCHI Bulletin 28, no. 2 (April 1996): 50–52. http://dx.doi.org/10.1145/226650.226669.

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

Kung, C. H. "On verification of database temporal constraints." ACM SIGMOD Record 14, no. 4 (May 1985): 169–79. http://dx.doi.org/10.1145/971699.318911.

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

Fernández-Gago, M. C., U. Hustadt, C. Dixon, M. Fisher, and B. Konev. "First-Order Temporal Verification in Practice." Journal of Automated Reasoning 34, no. 3 (April 2005): 295–321. http://dx.doi.org/10.1007/s10817-005-7354-1.

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

Dixon, Clare, Alan F. T. Winfield, Michael Fisher, and Chengxiu Zeng. "Towards temporal verification of swarm robotic systems." Robotics and Autonomous Systems 60, no. 11 (November 2012): 1429–41. http://dx.doi.org/10.1016/j.robot.2012.03.003.

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

Baoxin Li, R. Chellappa, Qinfen Zheng, and S. Z. Der. "Model-based temporal object verification using video." IEEE Transactions on Image Processing 10, no. 6 (June 2001): 897–908. http://dx.doi.org/10.1109/83.923286.

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

Yamada, Chikatoshi, Yasunori Nagata, and Zensho Nakao. "Inductive Temporal Formula Specifications for System Verification." Journal of Advanced Computational Intelligence and Intelligent Informatics 9, no. 3 (May 20, 2005): 321–28. http://dx.doi.org/10.20965/jaciii.2005.p0321.

Full text
Abstract:
Design verification has played an important role in the design of large scale and complex systems. In this article, we focus on model checking methods. Behaviors of modeled systems are in general specified by temporal formulas of computation tree logic, and users must know well about temporal specification because the specification might be complex. We propose a method temporal formulas are obtained inductively, and amounts of memory and time are reduced. We will show verification results using the proposed method.
APA, Harvard, Vancouver, ISO, and other styles
13

Murase, Akihiro, Tachio Terauchi, Naoki Kobayashi, Ryosuke Sato, and Hiroshi Unno. "Temporal verification of higher-order functional programs." ACM SIGPLAN Notices 51, no. 1 (April 8, 2016): 57–68. http://dx.doi.org/10.1145/2914770.2837667.

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

Muniz Silva, Paulo Sérgio. "Early Verification of Computer Systems Temporal Properties." Electronic Notes in Theoretical Computer Science 130 (May 2005): 211–33. http://dx.doi.org/10.1016/j.entcs.2005.03.012.

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

Giero, Mariusz. "Propositional Linear Temporal Logic with Initial Validity Semantics." Formalized Mathematics 23, no. 4 (December 1, 2015): 379–86. http://dx.doi.org/10.1515/forma-2015-0030.

Full text
Abstract:
Summary In the article [10] a formal system for Propositional Linear Temporal Logic (in short LTLB) with normal semantics is introduced. The language of this logic consists of “until” operator in a very strict version. The very strict “until” operator enables to express all other temporal operators. In this article we construct a formal system for LTLB with the initial semantics [12]. Initial semantics means that we define the validity of the formula in a model as satisfaction in the initial state of model while normal semantics means that we define the validity as satisfaction in all states of model. We prove the Deduction Theorem, and the soundness and completeness of the introduced formal system. We also prove some theorems to compare both formal systems, i.e., the one introduced in the article [10] and the one introduced in this article. Formal systems for temporal logics are applied in the verification of computer programs. In order to carry out the verification one has to derive an appropriate formula within a selected formal system. The formal systems introduced in [10] and in this article can be used to carry out such verifications in Mizar [4].
APA, Harvard, Vancouver, ISO, and other styles
16

Kröger, Fred, and Stephan Merz. "Temporal Logic and Recursion." Fundamenta Informaticae 14, no. 2 (February 1, 1991): 261–81. http://dx.doi.org/10.3233/fi-1991-14207.

Full text
Abstract:
We propose a temporal logic based on structures divided into several layers of linear “time scales” and give a sound and complete derivation system. The logic is applied to the formulation and verification of assertions about sequential recursive programs.
APA, Harvard, Vancouver, ISO, and other styles
17

Pfannerstill, M., B. Guse, D. Reusser, and N. Fohrer. "Temporal parameter sensitivity guided verification of process dynamics." Hydrology and Earth System Sciences Discussions 12, no. 2 (February 5, 2015): 1729–64. http://dx.doi.org/10.5194/hessd-12-1729-2015.

Full text
Abstract:
Abstract. To ensure reliable results of a hydrological model, it is essential that the model reproduces the hydrological processes adequately. Information about process dynamics is provided by looking at the temporal sensitivities of the corresponding model parameters. For this, the temporal dynamics of parameter sensitivity are used to describe the dominance of parameters for each time step. The parameter dominance is then related to the corresponding hydrological process, since the temporal parameter sensitivity represents the modelled hydrological process. For a reliable model application it has to be verified that the modelled hydrological processes match the expectations of real-world hydrological processes. We present a framework, which distinguishes between a verification of single model components and of the overall model behaviour. We analyse the temporal dynamics of parameter sensitivity of a modified groundwater component of a hydrological model. The results of the single analysis for the modified component show that the behaviour of the parameters of the modified groundwater component is consistent with the idea of the structural modifications. Additionally, the appropriate simulation of all relevant hydrological processes is verified as the temporal dynamics of parameter sensitivity represent these processes according to the expectations. Thus, we conclude that temporal dynamics of parameter sensitivity are helpful for verifying modifications of hydrological models.
APA, Harvard, Vancouver, ISO, and other styles
18

Abate, Alessandro, Julian Gutierrez, Lewis Hammond, Paul Harrenstein, Marta Kwiatkowska, Muhammad Najib, Giuseppe Perelli, Thomas Steeples, and Michael Wooldridge. "Rational verification: game-theoretic verification of multi-agent systems." Applied Intelligence 51, no. 9 (August 3, 2021): 6569–84. http://dx.doi.org/10.1007/s10489-021-02658-y.

Full text
Abstract:
AbstractWe provide a survey of the state of the art of rational verification: the problem of checking whether a given temporal logic formula ϕ is satisfied in some or all game-theoretic equilibria of a multi-agent system – that is, whether the system will exhibit the behavior ϕ represents under the assumption that agents within the system act rationally in pursuit of their preferences. After motivating and introducing the overall framework of rational verification, we discuss key results obtained in the past few years as well as relevant related work in logic, AI, and computer science.
APA, Harvard, Vancouver, ISO, and other styles
19

YU, Yang, Yong TANG, Mao-Lin PAN, Ting-Ting ZHENG, and Jian-Bin MAI. "Temporal Workflow Process Model and Its Soundness Verification." Journal of Software 21, no. 6 (June 29, 2010): 1233–53. http://dx.doi.org/10.3724/sp.j.1001.2010.03608.

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

Browne, Clarke, Dill, and Mishra. "Automatic Verification of Sequential Circuits Using Temporal Logic." IEEE Transactions on Computers C-35, no. 12 (December 1986): 1035–44. http://dx.doi.org/10.1109/tc.1986.1676711.

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

Liu, Xiao, Dingxian Wang, Dong Yuan, Futian Wang, and Yun Yang. "Workflow temporal verification for monitoring parallel business processes." Journal of Software: Evolution and Process 28, no. 4 (January 8, 2016): 286–302. http://dx.doi.org/10.1002/smr.1761.

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

Koshida, Ichiro, Tadao Saito, and Hiroshi Inose. "Description and verification of protocol by temporal logic." Systems and Computers in Japan 18, no. 3 (1987): 30–39. http://dx.doi.org/10.1002/scj.4690180304.

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

Dill, D. L., and E. M. Clarke. "Automatic verification of asynchronous circuits using temporal logic." IEE Proceedings E Computers and Digital Techniques 133, no. 5 (1986): 276. http://dx.doi.org/10.1049/ip-e.1986.0034.

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

PENCZEK, WOJCIECH. "TEMPORAL LOGICS FOR TRACE SYSTEMS: ON AUTOMATED VERIFICATION." International Journal of Foundations of Computer Science 04, no. 01 (March 1993): 31–67. http://dx.doi.org/10.1142/s0129054193000043.

Full text
Abstract:
We investigate an extension of CTL (Computation Tree Logic) by past modalities, called CTL P, interpreted over Mazurkiewicz’s trace systems. The logic is powerful enough to express most of the partial order properties of distributed systems like serializability of database transactions, snapshots, parallel execution of program segments, or inevitability under concurrency fairness assumption. We show that the model checking problem for the logic is NP-hard, even if past modalities cannot be nested. Then, we give a one exponential time model checking algorithm for the logic without nested past modalities. We show that all the interesting partial order properties can be model checked using our algorithm. Next, we show that is is possible to extend the model checking algorithm to cover the whole language and its extension to [Formula: see text]. Finally, we prove that the logic is undecidable and we discuss consequences of our results on using propositional versions of partial order temporal logics to synthesis of concurrent systems from their specifications.
APA, Harvard, Vancouver, ISO, and other styles
25

Combi, Carlo, and Pietro Sala. "Interval-based temporal functional dependencies: specification and verification." Annals of Mathematics and Artificial Intelligence 71, no. 1-3 (November 14, 2013): 85–130. http://dx.doi.org/10.1007/s10472-013-9387-1.

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

Mishra, B., and E. Clarke. "Hierarchical verification of asynchronous circuits using temporal logic." Theoretical Computer Science 38 (1985): 269–91. http://dx.doi.org/10.1016/0304-3975(85)90223-3.

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

Völker, Marcus, Maximilian Kloock, Leon Rabanus, Bassam Alrifaee, and Stefan Kowalewski. "Verification of Cooperative Vehicle Behavior using Temporal Logic." IFAC-PapersOnLine 52, no. 8 (2019): 99–104. http://dx.doi.org/10.1016/j.ifacol.2019.08.055.

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

Cook, Byron, Eric Koskinen, and Moshe Vardi. "Temporal property verification as a program analysis task." Formal Methods in System Design 41, no. 1 (April 27, 2012): 66–82. http://dx.doi.org/10.1007/s10703-012-0153-5.

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

Larcher, Anthony, Jean-Francois Bonastre, and John S. D. Mason. "Constrained temporal structure for text-dependent speaker verification." Digital Signal Processing 23, no. 6 (December 2013): 1910–17. http://dx.doi.org/10.1016/j.dsp.2013.07.007.

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

Salamati, Ali, Sadegh Soudjani, and Majid Zamani. "Data-Driven Verification under Signal Temporal Logic Constraints." IFAC-PapersOnLine 53, no. 2 (2020): 69–74. http://dx.doi.org/10.1016/j.ifacol.2020.12.051.

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

GIORDANO, LAURA, ALBERTO MARTELLI, MATTEO SPIOTTA, and DANIELE THESEIDER DUPRÉ. "Business process verification with constraint temporal answer set programming." Theory and Practice of Logic Programming 13, no. 4-5 (July 2013): 641–55. http://dx.doi.org/10.1017/s1471068413000409.

Full text
Abstract:
AbstractThe paper provides a framework for the verification of business processes, based on an extension of answer set programming (ASP) with temporal logic and constraints. The framework allows to capture expressive fluent annotations as well as data awareness in a uniform way. It allows for a declarative specification of a business process but also for encoding processes specified in conventional workflow languages. Verification of temporal properties of a business process, including verification of compliance to business rules, is performed by bounded model checking techniques in Answer Set Programming, extended with constraint solving for dealing with conditions on numeric data.
APA, Harvard, Vancouver, ISO, and other styles
32

Ferlin, Antoine, Virginie Wiels, and Philippe Bon. "Statistical Automaton for Verifying Temporal Properties and Computing Information on Traces." International Journal of Computers Communications & Control 11, no. 5 (August 31, 2016): 645. http://dx.doi.org/10.15837/ijccc.2016.5.2148.

Full text
Abstract:
Verification is decisive for embedded software. The goal of this work is to verify temporal properties on industrial applications, with the help of formal dynamic analysis. The approach presented in this paper is composed of three steps: formalization of temporal properties using an adequate language, generation of execution traces from a given property and verification of this property on execution traces. This paper focuses on the verification step. Use of a new kind of Büchi automaton has been proposed to provide an efficient verification taking into account the industrial needs and constraints. A prototype has been developed and used to carry out experiments on different anonymous real industrial applications.
APA, Harvard, Vancouver, ISO, and other styles
33

Liu, Chuchang, and Mehmet A. Orgun. "Verification of reactive systems using temporal logic with clocks." Theoretical Computer Science 220, no. 2 (June 1999): 377–408. http://dx.doi.org/10.1016/s0304-3975(99)00008-0.

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

Alromema, Nashwan Ahmed, Mohd Shafry Mohd Rahim, and Ibrahim Albidewi. "Temporal Database Models Validation and Verification using Mapping Methodology." VFAST Transactions on Software Engineering 11, no. 2 (December 21, 2016): 15. http://dx.doi.org/10.21015/vtse.v11i2.445.

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

Duftschmid, Georg, Silvia Miksch, and Walter Gall. "Verification of temporal scheduling constraints in clinical practice guidelines." Artificial Intelligence in Medicine 25, no. 2 (June 2002): 93–121. http://dx.doi.org/10.1016/s0933-3657(02)00011-8.

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

Duc, Le, Kazuo Saito, and Hiromu Seko. "Spatial-temporal fractions verification for high-resolution ensemble forecasts." Tellus A: Dynamic Meteorology and Oceanography 65, no. 1 (April 30, 2013): 18171. http://dx.doi.org/10.3402/tellusa.v65i0.18171.

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

Boureanu, Ioana, Mika Cohen, and Alessio Lomuscio. "Automatic verification of temporal-epistemic properties of cryptographic protocols." Journal of Applied Non-Classical Logics 19, no. 4 (January 2009): 463–87. http://dx.doi.org/10.3166/jancl.19.463-487.

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

Courcoubetis, C., M. Vardi, P. Wolper, and M. Yannakakis. "Memory-efficient algorithms for the verification of temporal properties." Formal Methods in System Design 1, no. 2-3 (October 1992): 275–88. http://dx.doi.org/10.1007/bf00121128.

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

Moon, Il, Gary J. Powers, Jerry R. Burch, and Edmund M. Clarke. "Automatic verification of sequential control systems using temporal logic." AIChE Journal 38, no. 1 (January 1992): 67–75. http://dx.doi.org/10.1002/aic.690380107.

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

Treur, Jan. "Verification of temporal-causal network models by mathematical analysis." Vietnam Journal of Computer Science 3, no. 4 (April 16, 2016): 207–21. http://dx.doi.org/10.1007/s40595-016-0067-z.

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

Rife, Daran L., and Christopher A. Davis. "Verification of Temporal Variations in Mesoscale Numerical Wind Forecasts." Monthly Weather Review 133, no. 11 (November 1, 2005): 3368–81. http://dx.doi.org/10.1175/mwr3052.1.

Full text
Abstract:
Abstract The authors address a particular example of the general question of whether high-resolution forecasts provide additional deterministic skill beyond what can be achieved with a coarser-resolution model. To this end, real-time forecasts using the fifth-generation Pennsylvania State University–NCAR Mesoscale Model (MM5) with grid increments of 30 and 3.3 km are compared over a domain centered on the complex terrain region of southern New Mexico during the 1 June 2002 to 1 June 2003 period. The authors use time series of surface data to evaluate the relative ability of the two forecasts to capture significant temporal variations of wind. The authors hypothesize that the additional detail and structure provided by high resolution becomes a “liability” when the forecasts are scored by traditional verification metrics, because such metrics sharply penalize forecasts with small temporal or spatial errors of predicted features. Thus, a set of verification metrics is designed that is increasingly tolerant of timing errors for temporal changes of wind. The authors find that the barrier-normal (i.e., zonal) wind component over complex terrain reveals the greatest improvement in skill due to increased horizontal resolution for the cases considered here. In addition, the fine-grid forecasts better replicate the cessation of drainage flow or onset of upslope flow near and within complex terrain. The most surprising result is the marginal benefit of the higher resolution over valley locations not in immediate proximity to the mountain slopes, even though the valley is only about 60 km across (east–west). Overall, the gains in forecast accuracy from finer grid spacing are generally incremental, but increase with greater tolerance for timing errors, culminating in the greatest improvement for forecasts of temporal variance.
APA, Harvard, Vancouver, ISO, and other styles
42

Prajna, Stephen, and Anders Rantzer. "Convex Programs for Temporal Verification of Nonlinear Dynamical Systems." SIAM Journal on Control and Optimization 46, no. 3 (January 2007): 999–1021. http://dx.doi.org/10.1137/050645178.

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

Soleimanifard, Siavash, Dilian Gurov, and Marieke Huisman. "Procedure-modular specification and verification of temporal safety properties." Software & Systems Modeling 14, no. 1 (March 7, 2013): 83–100. http://dx.doi.org/10.1007/s10270-013-0321-0.

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

Ngu, A. H. H. "Specification and verification of temporal relationships in transaction modelling." Information Systems 15, no. 2 (January 1990): 257–67. http://dx.doi.org/10.1016/0306-4379(90)90039-r.

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

Chiarugi, Davide, Moreno Falaschi, Diana Hermith, and Carlos Olarte. "Verification of Spatial and Temporal Modalities in Biochemical Systems." Electronic Notes in Theoretical Computer Science 316 (September 2015): 29–44. http://dx.doi.org/10.1016/j.entcs.2015.06.009.

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

Gori, Roberta, and Francesca Levi. "Abstract interpretation based verification of temporal properties for BioAmbients." Information and Computation 208, no. 8 (August 2010): 869–921. http://dx.doi.org/10.1016/j.ic.2010.03.004.

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

Wang, Yunhong, Zhaoxiang Zhang, Kaiyue Wang, Haoran Deng, and Bin Ma. "On-line signature verification based on spatio-temporal correlation." Multimedia Tools and Applications 72, no. 1 (March 7, 2013): 879–904. http://dx.doi.org/10.1007/s11042-013-1408-x.

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

Shinkawa, Yoshiyuki, and Ryoya Shiraki. "Temporal Verification of Business Processes Using BPMN and CPN." Information Engineering Express 3, no. 4 (2017): 105–13. http://dx.doi.org/10.52731/iee.v3.i4.287.

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

Lai and Tsai. "Improving GIS-based Landslide Susceptibility Assessments with Multi-temporal Remote Sensing and Machine Learning." Sensors 19, no. 17 (August 27, 2019): 3717. http://dx.doi.org/10.3390/s19173717.

Full text
Abstract:
This study developed a systematic approach with machine learning (ML) to apply the satellite remote sensing images, geographic information system (GIS) datasets, and spatial analysis for multi-temporal and event-based landslide susceptibility assessments at a regional scale. Random forests (RF) algorithm, one of the ML-based methods, was selected to construct the landslide susceptibility models. Different ratios of landslide and non-landslide samples were considered in the experiments. This study also employed a cost-sensitive analysis to adjust the decision boundary of the developed RF models with unbalanced sample ratios to improve the prediction results. Two strategies were investigated for model verification, namely space- and time-robustness. The space-robustness verification was designed for separating samples into training and examining data based on a single event or the same dataset. The time-robustness verification was designed for predicting subsequent landslide events by constructing a landslide susceptibility model based on a specific event or period. A total of 14 GIS-based landslide-related factors were used and derived from the spatial analyses. The developed landslide susceptibility models were tested in a watershed region in northern Taiwan with a landslide inventory of changes detected through multi-temporal satellite images and verified through field investigation. To further examine the developed models, the landslide susceptibility distributions of true occurrence samples and the generated landslide susceptibility maps were compared. The experiments demonstrated that the proposed method can provide more reasonable results, and the accuracies were found to be higher than 93% and 75% in most cases for space- and time-robustness verifications, respectively. In addition, the mapping results revealed that the multi-temporal models did not seem to be affected by the sample ratios included in the analyses.
APA, Harvard, Vancouver, ISO, and other styles
50

Marzban, Caren, and Scott Sandgathe. "Optical Flow for Verification." Weather and Forecasting 25, no. 5 (October 1, 2010): 1479–94. http://dx.doi.org/10.1175/2010waf2222351.1.

Full text
Abstract:
Abstract Modern numerical weather prediction (NWP) models produce forecasts that are gridded spatial fields. Digital images can also be viewed as gridded spatial fields, and as such, techniques from image analysis can be employed to address the problem of verification of NWP forecasts. One technique for estimating how images change temporally is called optical flow, where it is assumed that temporal changes in images (e.g., in a video) can be represented as a fluid flowing in some manner. Multiple realizations of the general idea have already been employed in verification problems as well as in data assimilation. Here, a specific formulation of optical flow, called Lucas–Kanade, is reviewed and generalized as a tool for estimating three components of forecast error: intensity and two components of displacement, direction and distance. The method is illustrated first on simulated data, and then on a 418-day series of 24-h forecasts of sea level pressure from one member [the Global Forecast System (GFS)–fifth-generation Pennsylvania State University–National Center for Atmospheric Research Mesoscale Model (MM5)] of the University of Washington’s Mesoscale Ensemble system. The simulation study confirms (and quantifies) the expectation that the method correctly assesses forecast errors. The method is also applied to a real dataset consisting of 418 twenty-four-hour forecasts spanning 2 April 2008–2 November 2009, demonstrating its value for analyzing NWP model performance. Results reveal a significant intensity bias in the subtropics, especially in the southern California region. They also expose a systematic east-northeast or downstream bias of approximately 50 km over land, possibly due to the treatment of terrain in the coarse-resolution model.
APA, Harvard, Vancouver, ISO, and other styles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography