A Novel Metric for Evaluation of Solar Forecasting Models

Author(s):  
Ricardo Marquez ◽  
Carlos F. M. Coimbra

This work presents an alternative, time-window invariant metric for evaluating the quality of solar forecasting models. Conventional approaches use statistical quantities such as the root-mean-square-error and/or the correlation coefficients to evaluate model quality. The straightforward use of statistical quantities to assign forecasting quality can be misleading because these metrics do not convey a measure of the variability of the time-series included in the solar irradiance data. In contrast, the quality metric proposed here, which is defined as the ratio of solar uncertainty to solar variability, compares forecasting error with solar variability directly. By making the forecasting error to variability comparisons for different time windows, we show that this ratio is essentially a statistical invariant for each forecasting model employed, i. e., the ratio is preserved for widely different time horizons.

2012 ◽  
Vol 135 (1) ◽  
Author(s):  
Ricardo Marquez ◽  
Carlos F. M. Coimbra

This work presents an alternative metric for evaluating the quality of solar forecasting models. Some conventional approaches use quantities such as the root-mean-square-error (RMSE) and/or correlation coefficients to evaluate model quality. The direct use of statistical quantities to assign forecasting quality can be misleading because these metrics do not convey a measure of the variability of the time-series for the solar irradiance data. In contrast, the quality metric proposed here, which is defined as the ratio of solar uncertainty to solar variability, compares the forecasting error with the solar variability directly. By making the forecasting error to variability comparisons for different time windows, we show that this ratio is essentially a statistical invariant for each forecast model employed, i.e., the ratio is preserved for widely different time horizons when the same time averaging periods are used, and therefore provides a robust way to compare solar forecasting skills. We employ the proposed metric to evaluate two new forecasting models proposed here, and compare their performances with a persistence model.


2013 ◽  
Vol 816-817 ◽  
pp. 506-511
Author(s):  
Yang Song ◽  
Mei Yu ◽  
Kai Hui Zheng ◽  
Sheng Ding

Objective quality metric evaluates image quality automatically. In this paper, a new objective stereo image quality metric is proposed with left-right image quality (LRIQ) model and stereo perception quality (SPQ) model. In LRIQ model, wavelet transform is used to simulate multi-channel effect. Meanwhile, phase congruency (PC) map of sub-image is extracted as main feature to measure quality of each sub-image. Then all the sub-images qualities are weighted according to contrast sensitivity function curve. The SPQ model, quality score is obtained by comparing the PC maps of original and distorted absolute disparity images. Finally, these two models are combined to evaluate stereo image quality. Experimental results demonstrate that the correlation coefficients between proposed evaluation method and DMOS are above 0.93, and the root mean square errors are all less than 5.6, under JPEG, JPEG2000 compression, Gaussian blurring, Gaussian white noise and H.264 coding distortion. It indicates that the subjective results perform highly accordance with objective qualities.


2021 ◽  
Author(s):  
Nicola Piana Agostinetti ◽  
Giulia Sgattoni

Abstract. Double differences (DD) seismic data are widely used to define elasticity distribution in the Earth's interior, and its variation in time. DD data are often pre-processed from earthquakes recordings through expert-opinion, where couples of earthquakes are selected based on some user-defined criteria, and DD data are computed from the selected couples. We develop a novel methodology for preparing DD seismic data based on a trans-dimensional algorithm, without imposing pre-defined criteria on the selection of couples of events. We apply it to a seismic database recorded on the flank of Katla volcano (Iceland), where elasticity variations in time has been indicated. Our approach quantitatively defines the presence of changepoints that separate the seismic events in time-windows. Within each time-window, the DD data are consistent with the hypothesis of time-invariant elasticity in the subsurface, and DD data can be safely used in subsequent analysis. Due to the parsimonious behavior of the trans-dimensional algorithm, only changepoints supported by the data are retrieved. Our results indicate that: (a) retrieved changepoints are consistent with first-order variations in the data (i.e. most striking changes in the DD data are correctly reproduced in the changepoint distribution in time); (b) changepoint locations in time do correlate neither with changes in seismicity rate, nor with changes in waveforms similarity (measured through the cross-correlation coefficients); and (c) noteworthy, the changepoint distribution in time seems to be insensitive to variations in the seismic network geometry during the experiment. Our results proofs that trans-dimensional algorithms can be positively applied to pre-processing of geophysical data before the application of standard routines (i.e. before using them to solve standard geophysical inverse problems) in the so called exploration of the data space.


Solid Earth ◽  
2021 ◽  
Vol 12 (12) ◽  
pp. 2717-2733
Author(s):  
Nicola Piana Agostinetti ◽  
Giulia Sgattoni

Abstract. Double-difference (DD) seismic data are widely used to define elasticity distribution in the Earth's interior and its variation in time. DD data are often pre-processed from earthquake recordings through expert opinion, whereby pairs of earthquakes are selected based on some user-defined criteria and DD data are computed from the selected pairs. We develop a novel methodology for preparing DD seismic data based on a trans-dimensional algorithm, without imposing pre-defined criteria on the selection of event pairs. We apply it to a seismic database recorded on the flank of Katla volcano (Iceland), where elasticity variations in time have been indicated. Our approach quantitatively defines the presence of changepoints that separate the seismic events in time windows. Within each time window, the DD data are consistent with the hypothesis of time-invariant elasticity in the subsurface, and DD data can be safely used in subsequent analysis. Due to the parsimonious behaviour of the trans-dimensional algorithm, only changepoints supported by the data are retrieved. Our results indicate the following: (a) retrieved changepoints are consistent with first-order variations in the data (i.e. most striking changes in the amplitude of DD data are correctly reproduced in the changepoint distribution in time); (b) changepoint locations in time correlate neither with changes in seismicity rate nor with changes in waveform similarity (measured through the cross-correlation coefficients); and (c) the changepoint distribution in time seems to be insensitive to variations in the seismic network geometry during the experiment. Our results demonstrate that trans-dimensional algorithms can be effectively applied to pre-processing of geophysical data before the application of standard routines (e.g. before using them to solve standard geophysical inverse problems).


Author(s):  
Hongguang Wu ◽  
Yuelin Gao ◽  
Wanting Wang ◽  
Ziyu Zhang

AbstractIn this paper, we propose a vehicle routing problem with time windows (TWVRP). In this problem, we consider a hard time constraint that the fleet can only serve customers within a specific time window. To solve this problem, a hybrid ant colony (HACO) algorithm is proposed based on ant colony algorithm and mutation operation. The HACO algorithm proposed has three innovations: the first is to update pheromones with a new method; the second is the introduction of adaptive parameters; and the third is to add the mutation operation. A famous Solomon instance is used to evaluate the performance of the proposed algorithm. Experimental results show that HACO algorithm is effective against solving the problem of vehicle routing with time windows. Besides, the proposed algorithm also has practical implications for vehicle routing problem and the results show that it is applicable and effective in practical problems.


OR Spectrum ◽  
2021 ◽  
Author(s):  
Christian Tilk ◽  
Katharina Olkis ◽  
Stefan Irnich

AbstractThe ongoing rise in e-commerce comes along with an increasing number of first-time delivery failures due to the absence of the customer at the delivery location. Failed deliveries result in rework which in turn has a large impact on the carriers’ delivery cost. In the classical vehicle routing problem (VRP) with time windows, each customer request has only one location and one time window describing where and when shipments need to be delivered. In contrast, we introduce and analyze the vehicle routing problem with delivery options (VRPDO), in which some requests can be shipped to alternative locations with possibly different time windows. Furthermore, customers may prefer some delivery options. The carrier must then select, for each request, one delivery option such that the carriers’ overall cost is minimized and a given service level regarding customer preferences is achieved. Moreover, when delivery options share a common location, e.g., a locker, capacities must be respected when assigning shipments. To solve the VRPDO exactly, we present a new branch-price-and-cut algorithm. The associated pricing subproblem is a shortest-path problem with resource constraints that we solve with a bidirectional labeling algorithm on an auxiliary network. We focus on the comparison of two alternative modeling approaches for the auxiliary network and present optimal solutions for instances with up to 100 delivery options. Moreover, we provide 17 new optimal solutions for the benchmark set for the VRP with roaming delivery locations.


2021 ◽  
Vol 14 (4) ◽  
pp. 885-907
Author(s):  
Bing Dong ◽  
Reisa Widjaja ◽  
Wenbo Wu ◽  
Zhi Zhou

2021 ◽  
Vol 18 (1) ◽  
Author(s):  
Ilaria Izzo ◽  
Canio Carriero ◽  
Giulia Gardini ◽  
Benedetta Fumarola ◽  
Erika Chiari ◽  
...  

Abstract Background Brescia Province, northern Italy, was one of the worst epicenters of the COVID-19 pandemic. The division of infectious diseases of ASST (Azienda Socio Sanitaria Territoriale) Spedali Civili Hospital of Brescia had to face a great number of inpatients with severe COVID-19 infection and to ensure the continuum of care for almost 4000 outpatients with HIV infection actively followed by us. In a recent manuscript we described the impact of the pandemic on continuum of care in our HIV cohort expressed as number of missed visits, number of new HIV diagnosis, drop in ART (antiretroviral therapy) dispensation and number of hospitalized HIV patients due to SARS-CoV-2 infection. In this short communication, we completed the previous article with data of HIV plasmatic viremia of the same cohort before and during pandemic. Methods We considered all HIV-patients in stable ART for at least 6 months and with at least 1 available HIV viremia in the time window March 01–November 30, 2019, and another group of HIV patients with the same two requisites but in different time windows of the COVID-19 period (March 01–May 31, 2020, and June 01–November 30, 2020). For patients with positive viremia (PV) during COVID-19 period, we reported also the values of viral load (VL) just before and after PV. Results: the percentage of patients with PV during COVID-19 period was lower than the previous year (2.8% vs 7%). Only 1% of our outpatients surely suffered from pandemic in term of loss of previous viral suppression. Conclusions Our efforts to limit the impact of pandemic on our HIV outpatients were effective to ensure HIV continuum of care.


2014 ◽  
Vol 687-691 ◽  
pp. 5161-5164
Author(s):  
Lian Zhou Gao

As the development of world economy, how to realize the reasonable vehicle logistics routing path problem with time window constrain is the key issue in promoting the prosperity and development of modern logistics industry. Through the research of vehicle logistics routing path 's demand, particle swarm optimization with a novel particle presentation is designed to solve the problem which is improved, effective and adept to the normal vehicle logistics routing. The simulation results of example indicate that the algorithm has more search speed and stronger optimization ability.


2001 ◽  
Vol 22 (2) ◽  
pp. 191-215 ◽  
Author(s):  
ARTURO E. HERNANDEZ ◽  
CHRISTINE FENNEMA-NOTESTINE ◽  
CARE UDELL ◽  
ELIZABETH BATES

This article presents a new method that can compare lexical priming (word–word) and sentential priming (sentence–word) directly within a single paradigm. We show that it can be used to address modular theories of word comprehension, which propose that the effects of sentence context occur after lexical access has taken place. Although lexical priming and sentential priming each occur very quickly in time, there should be a brief time window in which the former is present but the latter is absent. Lexical and sentential priming of unambiguous words were evaluated together, in competing and converging combinations, using time windows designed to detect an early stage where lexical priming is observed but sentential priming is not. Related and unrelated word pairs were presented visually, in rapid succession, within auditory sentence contexts that were either compatible or incompatible with the target (the second word in each pair). In lexical decision, the additive effects of lexical priming and sentential priming were present under all temporal conditions, although the latter was always substantially larger. In cross-modal naming, sentential priming was present in all temporal conditions; lexical priming was more fragile, interacting with timing and sentential congruence. No evidence was found for a stage in which lexical priming is present but sentential priming is absent – a finding that is difficult to reconcile with two-stage models of lexical versus sentential priming. We conclude that sentential context operates very early in the process of word recognition, and that it can interact with lexical priming at the earliest time window.


Sign in / Sign up

Export Citation Format

Share Document