An Automated Method for Tracking Clouds in Planetary Atmospheres

We present an automated method for cloud tracking which can be applied to planetary images. The method is based on a digital correlator which compares two or more consecutive images and identifies patterns by maximizing correlations between image blocks. This approach bypasses the problem of feature detection. Four variations of the algorithm are tested on real cloud images of Jupiter’s white ovals from the Galileo mission, previously analyzed in Vasavada et al. [Vasavada, A.R., Ingersoll, A.P., Banfield, D., Bell, M., Gierasch, P.J., Belton, M.J.S., Orton, G.S., Klaasen, K.P., Dejong, E., Breneman, H.H., Jones, T.J., Kaufman, J.M., Magee, K.P., Senske, D.A. 1998. Galileo imaging of Jupiter’s atmosphere: the great red spot, equatorial region, and white ovals. Icarus, 135, 265, doi:10.1006/icar.1998.5984]. Direct correlation, using the sum of squared differences between image radiances as a distance estimator (baseline case), yields displacement vectors very similar to this previous analysis. Combining this distance estimator with the method of order ranks results in a technique which is more robust in the presence of outliers and noise and of better quality. Finally, we introduce a distance metric which, combined with order ranks, provides results of similar quality to the baseline case and is faster. The new approach can be applied to data from a number of space-based imaging instruments with a non-negligible gain in computing time

GPU-based Online Track Reconstruction for the ALICE TPC in Run 3 with Continuous Read-Out

In LHC Run 3, ALICE will increase the data taking rate significantly to 50 kHz continuous read-out of minimum bias Pb-Pb collisions. The reconstruction strategy of the online-offline computing upgrade foresees a first synchronous online reconstruction stage during data taking enabling detector calibration and data compression, and a posterior calibrated asynchronous reconstruction stage. Many new challenges arise, among them continuous TPC read-out, more overlapping collisions, no a priori knowledge of the primary vertex and of location-dependent calibration in the synchronous phase, identification of low-momentum looping tracks, and sophisticated raw data compression. The tracking algorithm for the Time Projection Chamber (TPC) will be based on a Cellular Automaton and the Kalman filter. The reconstruction shall run online, processing 50 times more collisions per second than today, while yielding results comparable to current offline reconstruction. Our TPC track finding leverages the potential of hardware accelerators via the OpenCL and CUDA APIs in a shared source code for CPUs and GPUs for both reconstruction stages. We give an overview of the status of Run 3 tracking including performance on processors and GPUs and achieved compression ratios.Comment: 8 pages, 7 figures, contribution to CHEP 2018 conferenc

Track Reconstruction in the ALICE TPC using GPUs for LHC Run 3

In LHC Run 3, ALICE will increase the data taking rate significantly to continuous readout of 50 kHz minimum bias Pb-Pb collisions. The reconstruction strategy of the online offline computing upgrade foresees a first synchronous online reconstruction stage during data taking enabling detector calibration, and a posterior calibrated asynchronous reconstruction stage. We present a tracking algorithm for the Time Projection Chamber (TPC), the main tracking detector of ALICE. The reconstruction must yield results comparable to current offline reconstruction and meet the time constraints like in the current High Level Trigger (HLT), processing 50 times as many collisions per second as today. It is derived from the current online tracking in the HLT, which is based on a Cellular automaton and the Kalman filter, and we integrate missing features from offline tracking for improved resolution. The continuous TPC readout and overlapping collisions pose new challenges: conversion to spatial coordinates and the application of time- and location dependent calibration must happen in between of track seeding and track fitting while the TPC occupancy increases five-fold. The huge data volume requires a data reduction factor of 20, which imposes additional requirements: the momentum range must be extended to identify low-pt looping tracks and a special refit in uncalibrated coordinates improves the track model entropy encoding. Our TPC track finding leverages the potential of hardware accelerators via the OpenCL and CUDA APIs in a shared source code for CPUs, GPUs, and both reconstruction stages. Porting more reconstruction steps like the remainder of the TPC reconstruction and tracking for other detectors will shift the computing balance from traditional processors to GPUs.Comment: 13 pages, 10 figures, proceedings to Connecting The Dots Workshop, Seattle, 201

Spectral and Rotational Changes in the Isolated Neutron Star RX J0720.4-3125

RX J0720.4-3125 is an isolated neutron star that, uniquely in its class, has shown changes in its thermal X-ray spectrum. We use new spectra taken with Chandra's Low Energy Transmission Grating Spectrometer, as well as archival observations, to try to understand the timescale and nature of these changes. We construct lightcurves, which show both small, slow variations on a timescale of years, and a larger event that occurred more quickly, within half a year. From timing, we find evidence for a `glitch' coincident with this larger event, with a fractional increase in spin frequency of 5x10^{-8}. We compare the `before' and `after' spectra with those from RX J1308.6+2127, an isolated neutron star with similar temperature and magnetic field strength, but with a much stronger absorption feature in its spectrum. We find that the `after' spectrum can be represented remarkably well by the superposition of the `before' spectrum, scaled by two thirds, and the spectrum of RX J1308.6+2127, thus suggesting that the event affected approximately one third of the surface. We speculate the event reflects a change in surface composition caused by, e.g., an accretion episode.Comment: 4 pages, 2 figures, 2 tables, emulateapj format. ApJL, accepte

Reinforcement Learning for Wind Turbine Load Control: How AI can drive tomorrow‘s wind turbines

Load control strategies for wind turbines are used to reduce the structural wear of the turbine without reducing energy yield. Until now, these control strategies are almost exclusively built up-on linear approaches like PID and model-based controllers due to their robustness. However, advances in turbine size and capabilities create a need for more complex control strategies that can effectively address design challenges in modern turbines. This work presents WINDL, a load control policy based on a neural network, which is trained through model-free Reinforcement Learning (RL) on a simulated wind turbine. While RL has achieved great success in the past on games and simple simulation benchmarks, applications to more complex control problems are starting to emerge just recently. We show that through the usage of regularization techniques and signal transformations, such an application to the field of wind turbine load control is possible. Using a smoothness regularizer, we incentivize the highly non-linear neural network policy to output control actions that are safe to apply to a wind turbine. The Coleman transformation, a common tool for the design of traditional PID-based load control strategies, is used to project signals into a stationary coordinate space, increasing robustness and final policy performance. Trained to control a large offshore turbine in a model-free fashion, WINDL finds a control policy that outperforms a state-of-the-art controller based on the IPC strategy with respect to the prima-ry optimization goal blade loads. Using the DEL metric, we measure 54.1% lower blade loads in the steady wind and 13.45% lower blade loads in the turbulent wind scenario. While such levels of blade reduction come with slightly worse performance on secondary optimi-zation goals like pitch wear and power production, we demonstrate the ability to control the trade-off between different optimization goals on the example of pitch versus blade loads. To comple-ment our findings, we perform a qualitative analysis of the policy behavior and learning process. We believe our work to be the first application of RL to wind turbine load control that exceeds baseline performance in the primary optimization metric, opening up the possibility of including specialized load controllers for targeting critical design driving scenarios of modern large wind turbines.:Problem Method Aim Results Conclusio

Generative Diffusion for 3D Turbulent Flows

Turbulent flows are well known to be chaotic and hard to predict; however, their dynamics differ between two and three dimensions. While 2D turbulence tends to form large, coherent structures, in three dimensions vortices cascade to smaller and smaller scales. This cascade creates many fast-changing, small-scale structures and amplifies the unpredictability, making regression-based methods infeasible. We propose the first generative model for forced turbulence in arbitrary 3D geometries and introduce a sample quality metric for turbulent flows based on the Wasserstein distance of the generated velocity-vorticity distribution. In several experiments, we show that our generative diffusion model circumvents the unpredictability of turbulent flows and produces high-quality samples based solely on geometric information. Furthermore, we demonstrate that our model beats an industrial-grade numerical solver in the time to generate a turbulent flow field from scratch by an order of magnitude

Effects of Anxiety on Attentional Allocation and Task Performance: An Information Processing Analysis

An information processing signal detection methodology was employed to examine attentional allocation and its correlates in both normal comparison (NC) and generalized anxiety disorder (GAD) participants. In particular, the impact of neutral distractor and negative feedback cues on performance of an attention vigilance task was investigated. Individuals with GAD (N = 15) evidenced impaired performance on an attention vigilance task relative to NC participants (N = 15) when neutral distractor cues were presented. Contrary to prediction, no group differences in performance were detected under conditions in which participants were presented negative feedback cues they were told were relevant to their performance. Instead, GAD participants exhibited improvement during the experimental task such that their performance was equivalent to NC participants. Across trials, the clinically anxious group endorsed significantly higher levels of worry and negative affectivity; however, they failed to respond with concomitant physical arousal (e.g. increased muscle tension). These data are discussed within the context of Eysenck and Calvo\u27s processing efficiency theory. Additionally, the results of this investigation provide support for Barlow\u27s conceptualization of anxiety as requiring the interaction of cognitive schema and physiological arousal