Automatic Detection of Clear-Sky Periods From Irradiance Data

Recent degradation studies have highlighted the importance of considering cloud cover when calculating degradation rates, finding more reliable values when the data are restricted to clear sky periods. Several automated methods of determining clear sky periods have been previously developed, but parameterizing and testing the models has been difficult. In this paper, we use clear sky classifications determined from satellite data to develop an algorithm that determines clear sky periods using only measured irradiance values and modeled clear sky irradiance as inputs. This method is tested on global horizontal irradiance (GHI) data from ground collectors at six sites across the United States and compared against independent satellite-based classifications. First, 30 separate models were optimized on each individual site at GHI data intervals of 1, 5, 10, 15, and 30 min (sampled on the first minute of the interval). The models had an average F0.5 score of 0.949 ± 0.035 on a holdout test set. Next, optimizations were performed by aggregating data from different locations at the same interval, yielding one model per data interval. This paper yielded an average F0.5 of 0.946 ± 0.037. A final, 'universal' optimization that was trained on data from all sites at all intervals provided an F0.5 score of 0.943 ± 0.040. The optimizations all provide improvements on a prior, unoptimized clear sky detection algorithm that produces F0.5 scores that average to 0.903 ± 0.067. Our paper indicates that a single algorithm can accurately classify clear sky periods across locations and data sampling intervals

Adaptive performance optimization for large-scale traffic control systems

In this paper, we study the problem of optimizing (fine-tuning) the design parameters of large-scale traffic control systems that are composed of distinct and mutually interacting modules. This problem usually requires a considerable amount of human effort and time to devote to the successful deployment and operation of traffic control systems due to the lack of an automated well-established systematic approach. We investigate the adaptive fine-tuning algorithm for determining the set of design parameters of two distinct mutually interacting modules of the traffic-responsive urban control (TUC) strategy, i.e., split and cycle, for the large-scale urban road network of the city of Chania, Greece. Simulation results are presented, demonstrating that the network performance in terms of the daily mean speed, which is attained by the proposed adaptive optimization methodology, is significantly better than the original TUC system in the case in which the aforementioned design parameters are manually fine-tuned to virtual perfection by the system operators

An evolutionary algorithm with double-level archives for multiobjective optimization

Existing multiobjective evolutionary algorithms (MOEAs) tackle a multiobjective problem either as a whole or as several decomposed single-objective sub-problems. Though the problem decomposition approach generally converges faster through optimizing all the sub-problems simultaneously, there are two issues not fully addressed, i.e., distribution of solutions often depends on a priori problem decomposition, and the lack of population diversity among sub-problems. In this paper, a MOEA with double-level archives is developed. The algorithm takes advantages of both the multiobjective-problemlevel and the sub-problem-level approaches by introducing two types of archives, i.e., the global archive and the sub-archive. In each generation, self-reproduction with the global archive and cross-reproduction between the global archive and sub-archives both breed new individuals. The global archive and sub-archives communicate through cross-reproduction, and are updated using the reproduced individuals. Such a framework thus retains fast convergence, and at the same time handles solution distribution along Pareto front (PF) with scalability. To test the performance of the proposed algorithm, experiments are conducted on both the widely used benchmarks and a set of truly disconnected problems. The results verify that, compared with state-of-the-art MOEAs, the proposed algorithm offers competitive advantages in distance to the PF, solution coverage, and search speed

Hierarchically Clustered Adaptive Quantization CMAC and Its Learning Convergence

No abstract availabl

Accuracy versus simplicity in online battery model identification

This paper presents a framework for battery modeling in online, real-time applications where accuracy is important but speed is the key. The framework allows users to select model structures with the smallest number of parameters that is consistent with the accuracy requirements of the target application. The tradeoff between accuracy and speed in a battery model identification process is explored using different model structures and parameter-fitting algorithms. Pareto optimal sets are obtained, allowing a designer to select an appropriate compromise between accuracy and speed. In order to get a clearer understanding of the battery model identification problem, “identification surfaces” are presented. As an outcome of the battery identification surfaces, a new analytical solution is derived for battery model identification using a closed-form formula to obtain a battery’s ohmic resistance and open circuit voltage from measurement data. This analytical solution is used as a benchmark for comparison of other fitting algorithms and it is also used in its own right in a practical scenario for state-of-charge estimation. A simulation study is performed to demonstrate the effectiveness of the proposed framework and the simulation results are verified by conducting experimental tests on a small NiMH battery pack

Improvement and Sensitivity Analysis of Thermal Thin-Ice Thickness Retrievals

Considering the sea ice decline in the Arctic during the last decades, polynyas are of high research interest since these features are core areas of new ice formation. The determination of ice formation requires accurate retrieval of polynya area and thin-ice thickness (TIT) distribution within the polynya. We use an established energy balance model to derive TITs with MODIS ice surface temperatures $(T_{s})$ and NCEP/DOE Reanalysis II in the Laptev Sea for two winter seasons. Improvements of the algorithm mainly concern the implementation of an iterative approach to calculate the atmospheric flux components taking the atmospheric stratification into account. Furthermore, a sensitivity study is performed to analyze the errors of the ice thickness. The results are the following: 1) 2-m air temperatures $(T_{a})$ and $T_{s}$ have the highest impact on the retrieved ice thickness; 2) an overestimation of $T_{a}$ yields smaller ice thickness errors as an underestimation of $T_{a}$; 3) NCEP $T_{a}$ shows often a warm bias; and 4) the mean absolute error for ice thicknesses up to 20 cm is $pm$4.7 cm. Based on these results, we conclude that, despite the shortcomings of the NCEP data (coarse spatial resolution and no polynyas), this data set is appropriate in combination with MODIS $T_{s}$ for the retrieval of TITs up to 20 cm in the Laptev Sea region. The TIT algorithm can be applied to other polynya regions and to past and future time periods. Our TIT product is a valuable data set for verification of other model and remote sensing ice thickness data

Stacking-Based Deep Neural Network: Deep Analytic Network for Pattern Classification

Stacking-based deep neural network (S-DNN) is aggregated with pluralities of basic learning modules, one after another, to synthesize a deep neural network (DNN) alternative for pattern classification. Contrary to the DNNs trained end to end by backpropagation (BP), each S-DNN layer, i.e., a self-learnable module, is to be trained decisively and independently without BP intervention. In this paper, a ridge regression-based S-DNN, dubbed deep analytic network (DAN), along with its kernelization (K-DAN), are devised for multilayer feature re-learning from the pre-extracted baseline features and the structured features. Our theoretical formulation demonstrates that DAN/K-DAN re-learn by perturbing the intra/inter-class variations, apart from diminishing the prediction errors. We scrutinize the DAN/K-DAN performance for pattern classification on datasets of varying domains - faces, handwritten digits, generic objects, to name a few. Unlike the typical BP-optimized DNNs to be trained from gigantic datasets by GPU, we disclose that DAN/K-DAN are trainable using only CPU even for small-scale training sets. Our experimental results disclose that DAN/K-DAN outperform the present S-DNNs and also the BP-trained DNNs, including multiplayer perceptron, deep belief network, etc., without data augmentation applied.Comment: 14 pages, 7 figures, 11 table