Searcharxiv⌕ Search

arXiv subjects

Richard Bean

Publications and source records attributed to Richard Bean.

32 records · Page 2Linked to original sources

How to predict and optimise with asymmetric error metrics

In this paper, we examine the concept of the predict and optimise problem with specific reference to the third Technical Challenge of the IEEE Computational Intelligence Society. In this competition, entrants were asked to forecast building energy use and solar generation at six buildings and six solar installations, and then use their forecast to optimize energy cost while scheduling classes and batteries over a month. We examine the possible effect of underforecasting and overforecasting and asymmetric errors on the optimisation cost. We explore the different nature of loss functions for the prediction and optimisation phase and propose to adjust the final forecasts for a better optimisation cost. We report that while there is a positive correlation between these two, more appropriate loss functions can be used to optimise the costs associated with final decisions.

cs.LG↗

Methodology for forecasting and optimization in IEEE-CIS 3rd Technical Challenge

This report provides a description of the methodology I used in the IEEE-CIS 3rd Technical Challenge. For the forecast, I used a quantile regression forest approach using the solar variables provided by the Bureau of Meterology of Australia (BOM) and many of the weather variables from the European Centre for Medium-Range Weather Forecasting (ECMWF). Groups of buildings and all of the solar instances were trained together as they were observed to be closely correlated over time. Other variables used included Fourier values based on hour of day and day of year, and binary variables for combinations of days of the week. The start dates for the time series were carefully tuned based on phase 1 and cleaning and thresholding was used to reduce the observed error rate for each time series. For the optimization, a four-step approach was used using the forecast developed. First, a mixed-integer program (MIP) was solved for the recurring and recurring plus once-off activities, then each of these was extended using a mixed-integer quadratic program (MIQP). The general strategy was chosen from one of two ("array" from the "array" and "tuples" approaches) while the specific step improvement strategy was chosen from one of five ("no forced discharge").

eess.SY↗

Unsupervised learning approaches to characterize heterogeneous samples using X-ray single particle imaging

One of the outstanding analytical problems in X-ray single particle imaging (SPI) is the classification of structural heterogeneity, which is especially difficult given the low signal-to-noise ratios of individual patterns and that even identical objects can yield patterns that vary greatly when orientation is taken into consideration. We propose two methods which explicitly account for this orientation-induced variation and can robustly determine the structural landscape of a sample ensemble. The first, termed common-line principal component analysis (PCA) provides a rough classification which is essentially parameter-free and can be run automatically on any SPI dataset. The second method, utilizing variation auto-encoders (VAEs) can generate 3D structures of the objects at any point in the structural landscape. We implement both these methods in combination with the noise-tolerant expand-maximize-compress (EMC) algorithm and demonstrate its utility by applying it to an experimental dataset from gold nanoparticles with only a few thousand photons per pattern and recover both discrete structural classes as well as continuous deformations. These developments diverge from previous approaches of extracting reproducible subsets of patterns from a dataset and open up the possibility to move beyond studying homogeneous sample sets and study open questions on topics such as nanocrystal growth and dynamics as well as phase transitions which have not been externally triggered.

eess.IV↗

3D diffractive imaging of nanoparticle ensembles using an X-ray laser

We report the 3D structure determination of gold nanoparticles (AuNPs) by X-ray single particle imaging (SPI). Around 10 million diffraction patterns from gold nanoparticles were measured in less than 100 hours of beam time, more than 100 times the amount of data in any single prior SPI experiment, using the new capabilities of the European X-ray free electron laser which allow measurements of 1500 frames per second. A classification and structural sorting method was developed to disentangle the heterogeneity of the particles and to obtain a resolution of better than 3 nm. With these new experimental and analytical developments, we have entered a new era for the SPI method and the path towards close-to-atomic resolution imaging of biomolecules is apparent.

physics.app-ph↗

X-ray diffractive imaging of controlled gas-phase molecules: Toward imaging of dynamics in the molecular frame

We report experimental results on the diffractive imaging of three-dimensionally aligned 2,5-diiodothiophene molecules. The molecules were aligned by chirped near-infrared laser pulses, and their structure was probed at a photon energy of 9.5 keV ($λ\approx130 \text{pm}$) provided by the Linac Coherent Light Source. Diffracted photons were recorded on the CSPAD detector and a two-dimensional diffraction pattern of the equilibrium structure of 2,5-diiodothiophene was recorded. The retrieved distance between the two iodine atoms agrees with the quantum-chemically calculated molecular structure to within 5 %. The experimental approach allows for the imaging of intrinsic molecular dynamics in the molecular frame, albeit this requires more experimental data which should be readily available at upcoming high-repetition-rate facilities.

physics.atm-clus↗

A Coalition Formation Game Framework for Peer-to-Peer Energy Trading

This paper studies social cooperation backed peer-to-peer energy trading technique by which prosumers can decide how they can use their batteries opportunistically for participating in the peer-to-peer trading. The objective is to achieve a solution in which the ultimate beneficiaries are the prosumers, i.e., a prosumer-centric solution. To do so, a coalition formation game is designed, which enables a prosumer to compare its benefit of participating in the peer-to-peer trading with and without using its battery and thus, allows the prosumer to form suitable social coalition groups with other similar prosumers in the network for conducting peer-to-peer trading. The properties of the formed coalitions are studied, and it is shown that 1) the coalition structure that stems from the social cooperation between participating prosumers at each time slot is both stable and optimal, and 2) the outcomes of the proposed peer- to-peer trading scheme is prosumer-centric. Case studies are conducted based on real household energy usage and solar generation data to highlight how the proposed scheme can benefit prosumers through exhibiting prosumer-centric properties.

eess.SP↗

Megahertz single-particle imaging at the European XFEL

The emergence of high repetition-rate X-ray free-electron lasers (XFELs) powered by superconducting accelerator technology enables the measurement of significantly more experimental data per day than was previously possible. The European XFEL will soon provide 27,000 pulses per second, more than two orders of magnitude more than any other XFEL. The increased pulse rate is a key enabling factor for single-particle X-ray diffractive imaging, which relies on averaging the weak diffraction signal from single biological particles. Taking full advantage of this new capability requires that all experimental steps, from sample preparation and delivery to the acquisition of diffraction patterns, are compatible with the increased pulse repetition rate. Here, we show that single-particle imaging can be performed using X-ray pulses at megahertz repetition rates. The obtained results pave the way towards exploiting high repetition-rate X-ray free-electron lasers for single-particle imaging at their full repetition rate.

physics.ins-det↗

Grid Influenced Peer-to-Peer Energy Trading

This paper proposes a peer-to-peer energy trading scheme that can help the centralized power system to reduce the total electricity demand of its customers at the peak hour. To do so, a cooperative Stackelberg game is formulated, in which the centralized power system acts as the leader that needs to decide on a price at the peak demand period to incentivize prosumers to not seeking any energy from it. The prosumers, on the other hand, act as followers and respond to the leader's decision by forming suitable coalitions with neighboring prosumers in order to participate in P2P energy trading to meet their energy demand. The properties of the proposed Stackelberg game are studied. It is shown that the game has a unique and stable Stackelberg equilibrium, as a result of the stability of prosumers' coalitions. At the equilibrium, the leader chooses its strategy using a derived closed-form expression, while the prosumers choose their equilibrium coalition structure. An algorithm is proposed that enables the centralized power system and the prosumers to reach the equilibrium solution. Numerical case studies demonstrate the beneficial properties of the proposed scheme.

eess.SY↗

Using solar and load predictions in battery scheduling at the residential level

Smart solar inverters can be used to store, monitor and manage a home's solar energy. We describe a smart solar inverter system with battery which can either operate in an automatic mode or receive commands over a network to charge and discharge at a given rate. In order to make battery storage financially viable and advantageous to the consumers, effective battery scheduling algorithms can be employed. Particularly, when time-of-use tariffs are in effect in the region of the inverter, it is possible in some cases to schedule the battery to save money for the individual customer, compared to the "automatic" mode. Hence, this paper presents and evaluates the performance of a novel battery scheduling algorithm for residential consumers of solar energy. The proposed battery scheduling algorithm optimizes the cost of electricity over next 24 hours for residential consumers. The cost minimization is realized by controlling the charging/discharging of battery storage system based on the predictions for load and solar power generation values. The scheduling problem is formulated as a linear programming problem. We performed computer simulations over 83 inverters using several months of hourly load and PV data. The simulation results indicate that key factors affecting the viability of optimization are the tariffs and the PV to Load ratio at each inverter. Depending on the tariff, savings of between 1% and 10% can be expected over the automatic approach. The prediction approach used in this paper is also shown to out-perform basic "persistence" forecasting approaches. We have also examined the approaches for improving the prediction accuracy and optimization effectiveness.

eess.SY↗

Peer-to-Peer Energy Trading with Sustainable User Participation: A Game Theoretic Approach

This paper explores the feasibility of social cooperation between prosumers within an energy network in establishing their sustainable participation in peer-to-peer (P2P) energy trading. In particular, a canonical coalition game (CCG) is utilized to propose a P2P energy trading scheme, in which a set of participating prosumers form a coalition group to trade their energy, if there is any, with one another. By exploring the concept of the core of the designed CCG framework, the mid-market rate is utilized as a pricing mechanism of the proposed P2P trading to confirm the stability of the coalition as well as to guarantee the benefit to the prosumers for forming the social coalition. The paper further introduces the motivational psychology models that are relevant to the proposed P2P scheme and it is shown that the outcomes of proposed P2P energy trading scheme satisfy the discussed models. Consequently, it is proven that the proposed scheme is consumer-centric that has the potential to corroborate sustainable prosumers participation in P2P energy trading. Finally, some numerical examples are provided to demonstrate the beneficial properties of the proposed scheme.

cs.GT↗

Strongly aligned gas-phase molecules at Free-Electron Lasers

We demonstrate a novel experimental implementation to strongly align molecules at full repetition rates of free-electron lasers. We utilized the available in-house laser system at the coherent x-ray imaging beamline at the Linac Coherent Light Source. Chirped laser pulses, i. e., the direct output from the regenerative amplifier of the Ti:Sa chirped pulse amplification laser system, were used to strongly align 2,5-diiodothiophene molecules in a molecular beam. The alignment laser pulses had pulse energies of a few mJ and a pulse duration of 94 ps. A degree of alignment of $\left<\cos^2\!θ_{2D}\right>$ = 0.85 was measured, limited by the intrinsic temperature of the molecular beam rather than by the available laser system. With the general availability of synchronized chirped-pulse-amplified near-infrared laser systems at short-wavelength laser facilities, our approach allows for the universal preparation of molecules tightly fixed in space for experiments with x-ray pulses.

physics.atm-clus↗

The size of the smallest uniquely completable set in order 8 Latin squares

In 1990, Kolesova, Lam and Thiel determined the 283,657 main classes of Latin squares of order 8. Using techniques to determine relevant Latin trades and integer programming, we examine representatives of each of these main classes and determine that none can contain a uniquely completable set of size less than 16. In three of these main classes, the use of trades which contain less than or equal to three rows, columns, or elements does not suffice to determine this fact. We closely examine properties of representatives of these three main classes. Writing the main result in Nelder's notation for critical sets, we prove that scs(8)=16.

math.CO↗

Critical sets in the elementary abelian 2- and 3- groups

In 1998, Khodkar showed that the minimal critical set in the Latin square corresponding to the elementary abelian 2-group of order 16 is of size at most 124. Since the paper was published, improved methods for solving integer programming problems have been developed. Here we give an example of a critical set of size 121 in this Latin square, found through such methods. We also give a new upper bound on the size of critical sets of minimal size for the elementary abelian 2-group of order $2^n$: $4^{n}-3^{n}+4-2^{n}-2^{n-2}$. We speculate about possible lower bounds for this value, given some other results for the elementary abelian 2-groups of orders 32 and 64. An example of a critical set of size 29 in the Latin square corresponding to the elementary abelian 3-group of order 9 is given, and it is shown that any such critical set must be of size at least 24, improving the bound of 21 given by Donovan, Cooper, Nott and Seberry.

math.CO↗

A new bound on the size of the largest critical set in a Latin square

A critical set in an n x n array is a set C of given entries, such that there exists a unique extension of C to an n x n Latin square and no proper subset of C has this property. The cardinality of the largest critical set in any Latin square of order n is denoted by lcs(n). In 1978 Curran and van Rees proved that lcs(n) <= n^2 - n. Here we show that lcs(n) <= n^2-3n+3.

math.CO↗