arXiv subjects

James McLaughlin

Publications and source records attributed to James McLaughlin.

14 recordsLinked to original sources

arXiv2026

Vanishing Coefficients in Products of Quintuple Products

Explicit arithmetic progressions modulo primes $p \equiv 1 \pmod{4}$ are derived in which the coefficients in the expansions of products of quintuple products vanish. In particular, if $p = m^{2} + n^{2}$, and $b$ is a positive integer, and $$\sum_{n=0}^{\infty} a_{n}q^{n} = \frac{(q^{2bm},q^{p-2bm};q^{2bn},q^{p-2bn};q^p)_{\infty}}{(q^p,-q^{b m},-q^{p-bm},-q^{bn},-q^{p-bn};q^p)_{\infty}^2},$$ we determine $\alpha = \alpha(m,n,p)$ such that $a_{pt+ \alpha}=0$. Our results are proven using involutive transformations on integer lattices.

math.NT↗

arXiv2026

Constraining turbulent solar flare acceleration regions by connecting kinetic modeling and X-ray observations

Spatially-resolved X-ray observations are the key to understanding electron acceleration in solar flares. Currently, the underlying processes that efficiently energize solar flare particles are poorly constrained. Abundant flare observations suggest that turbulence plays a crucial role in transferring energy between the magnetic field and energetic electrons. For the first time, we connect inhomogeneous acceleration from turbulence and hard X-ray spectroscopy and imaging observations with kinetic modeling to constrain the properties of flare acceleration. Observing three large flares with RHESSI, or Solar Orbiter/STIX, we extract X-ray imaging and spectroscopy observables. We compare with modeling results, mapping observables to electron acceleration and turbulent properties. We determine that extended regions of turbulence are required to match multiple X-ray observables, suggesting electrons are accelerated over a large fraction (~25%) of the flare loop; a property that is usually unconstrained from X-ray observations alone. Additionally, we determine acceleration timescales that vary between 7 and 22s by using fixed values for the turbulent scattering timescale and the velocity dependence of the acceleration diffusion coefficient. These fixed values are effectively unconstrained, but yield acceleration timescales that will help to restrict possible viable stochastic models.

astro-ph.SR↗

arXiv2026

The $p$-Dissection of a Product of Quintuple Products

Let $p \equiv 1 \pmod{4}$ be prime, let $m$ and $n$ be integers such that $p=m^2+n^2$, and let $b$ be a positive integer. Let $Q(z,q) = (z,q/z,q;q)_{\infty}(qz^2,q/z^2;q^2)_{\infty}$ denote the product appearing in the quintuple product identity. We derive explicit formulae for the $p$-dissection of $Q(q^{bm},q^p)Q(q^{bn},q^p)$, and determine sign patterns in length-$p$ arithmetic progressions of the Taylor series coefficients of the associated quotient $Q(q^{bm},q^{p})Q(q^{bn},q^p)/(q^p;q^p)_{\infty}^2$. Some combinatorial applications of the $p$-dissection formulae are also given.

math.NT↗

arXiv2025

Identical Vanishing of Coefficients in the Series Expansion of Eta Quotients, modulo 4, 9 and 25

Let $A(q)=\sum_{n=0}^{\infty}a_n q^n$ and $B(q)=\sum_{n=0}^{\infty}b_n q^n$ be two eta quotients. Previously, we considered the problem of when \[ a_n=0 <=> b_n=0. \] Here we consider the ``mod $m$'' version of this problem, i.e. eta quotients $A(q)$ and $B(q)$ and integers $m>1$ such that \[ a_n \equiv 0 \pmod m <=> b_n \equiv 0 \pmod m? \] We found results for $m=p^2$, $p=2, 3$ and $5$. For $m=4,9$, we found results which apply to infinite families of eta quotients. For example: Let $A(q)$ have the form \begin{equation} A(q) = f_1^{3j_1+1}\prod_{3\nmid i}f_i^{3j_i}\prod_{3|i}f_i^{j_i} =: \sum_{n=0}^{\infty}a_nq^n,\,\,B(q) = \frac{f_3}{f_1^3}A(q) =: \sum_{n=0}^{\infty}b_nq^n \end{equation} with $f_{k}=\prod_{n=1}^{\infty}(1-q^{kn})$. Then \begin{align*} a_{3n}-b_{3n}&\equiv 0\pmod 9,\\ 2a_{3n+1}+b_{3n+1}&\equiv0\pmod 9,\\ a_{3n+2}+2b_{3n+2}&\equiv0\pmod 9. \end{align*} Some of these theorems also had some combinatorial implications, such as the following: Let $p_2^{(3)}(n)$ denote the number of bipartitions $(\pi_1, \pi_2)$ of $n$ where $\pi_1$ is 3-regular. Then \begin{equation*} p_2^{(3)}(n)\equiv0\pmod 9 <=> n\text{ is not a generalized pentagonal number}. \end{equation*} In the case of $m=25$, we do not have any general theorems that apply to an infinite family of eta quotients. Instead we give two tables of results that appear to hold experimentally. We do prove some individual results (using theory of modular forms), such as the following: Let the sequences $\{c_n\}$ and $\{d_n\}$ be defined by \begin{equation*} f_1^{10}=:\sum_{n=0}^{\infty}c_nq^n, \hspace{25pt} f_1^{5}f_5=:\sum_{n=0}^{\infty}d_nq^n. \end{equation*} Then \begin{equation*} c_n \equiv 0 \pmod{25} <=> d_n \equiv 0 \pmod{25}. \end{equation*}

math.NT↗

arXiv2025

Sign-patterns of Certain Infinite Products

The signs of Fourier coefficients of certain eta quotients are determined by dissecting expansions for theta functions and by applying a general dissection formula for certain classes of quintuple products. A characterization is given for the coefficient sign patterns for \[ \frac{(q^i;q^i)_{\infty}}{(q^p;q^p)_{\infty}} \] for integers $ i > 1 $ and primes $ p > 3 $. The sign analysis for this quotient addresses and extends a conjecture of Bringmann et al. for the coefficients of $ (q^2;q^2)_{\infty}(q^5;q^5)_{\infty}^{-1} $. The sign distribution for additional classes of eta quotients is considered. This addresses multiple conjectures posed by Bringmann et al.

math.NT↗

arXiv2025

OxO2 -- A SSSOM mapping browser for logically sound crosswalks

EMBL-EBI created OxO to enable users to map between datasets that are annotated with different ontologies. Mappings identified by the first version of OxO were not necessarily logically sound, lacked important provenance information such as author and reviewer, and could timeout or crash for certain requests. In this paper we introduce OxO2 to address these concerns. Provenance is addressed by implementing SSSOM, a mapping standard that defines provenance for mappings. SSSOM defines the conditions under which logical sound mappings can be derived and is implemented in OxO2 using Nemo, a Datalog rule engine. To ensure reasoning is performant and memory efficient, Nemo implements a number of strategies that ensures OxO2 will be stable for all requests. Due to these changes, OxO2 users will be able to integrate between disparate datasets with greater confidence.

cs.DB↗

arXiv2025

OLS4: A new Ontology Lookup Service for a growing interdisciplinary knowledge ecosystem

The Ontology Lookup Service (OLS) is an open source search engine for ontologies which is used extensively in the bioinformatics and chemistry communities to annotate biological and biomedical data with ontology terms. Recently there has been a significant increase in the size and complexity of ontologies due to new scales of biological knowledge, such as spatial transcriptomics, new ontology development methodologies, and curation on an increased scale. Existing Web-based tools for ontology browsing such as BioPortal and OntoBee do not support the full range of definitions used by today's ontologies. In order to support the community going forward, we have developed OLS4, implementing the complete OWL2 specification, internationalization support for multiple languages, and a new user interface with UX enhancements such as links out to external databases. OLS4 has replaced OLS3 in production at EMBL-EBI and has a backwards compatible API supporting users of OLS3 to transition.

cs.IR↗

arXiv2023

Quasi-periodic pulsations in solar flares: a key diagnostic of energy release on the Sun

Solar flares are among the most powerful and disruptive events in our solar system, however the physical mechanisms driving and transporting this energetic release are not fully understood. An important signature associated with flare energy release is highly variable emission on timescales of sub-seconds to minutes which often exhibit oscillatory behaviour, features collectively known as quasi-periodic pulsations (QPPs). To fully identify the driving mechanism of QPPs, exploit their potential as a diagnostic tool, and incorporate them into our understanding of solar and stellar flares, new observational capabilities and initiatives are required. There is a clear community need for flare-focused, rapid cadence, high resolution, multi-wavelength imaging of the Sun, with high enough sensitivity and dynamic range to observe small fluctuations in intensity in the presence of a large overall intensity. Furthermore, multidisciplinary funding and initiatives are required to narrow the gap between numerical models and observations. QPPs are direct signatures of the physics occurring in flare magnetic reconnection and energy release sites and hence are critical to include in a unified flare model. Despite significant modelling and theoretical work, no single mechanism or model can fully explain the presence of QPPs in flares. Moreover, it is also likely that QPPs fall into different categories that are produced by different mechanisms. At present we have insufficient information to observationally distinguish between mechanisms. The motivation to understand QPPs is strengthened by the geo-effectiveness of flares on the Earth's ionosphere, and by the fact that stellar flares exhibit similar QPP signatures. QPPs present a golden opportunity to better understand flare physics and exploit the solar-stellary analogy, benefiting both astrophysics, heliophysics, and the solar-terrestrial connection.

astro-ph.IM↗

arXiv2022

Epileptic Seizure Classification Using Combined Labels and a Genetic Algorithm

Epilepsy affects 50 million people worldwide and is one of the most common serious neurological disorders. Seizure detection and classification is a valuable tool for diagnosing and maintaining the condition. An automated classification algorithm will allow for accurate diagnosis. Utilising the Temple University Hospital (TUH) Seizure Corpus, six seizure types are compared; absence, complex partial, myoclonic, simple partial, tonic and tonic- clonic models. This study proposes a method that utilises unique features with a novel parallel classifier - Parallel Genetic Naive Bayes (NB) Seizure Classifier (PGNBSC). The PGNBSC algorithm searches through the features and by reclassifying the data each time, the algorithm will create a matrix for optimum search criteria. Ictal states from the EEGs are segmented into 1.8 s windows, where the epochs are then further decomposed into 13 different features from the first intrinsic mode function (IMF). The features are compared using an original NB classifier in the first model. This is improved upon in a second model by using a genetic algorithm (Binary Grey Wolf Optimisation, Option 1) with a NB classifier. The third model uses a combination of the simple partial and complex partial seizures to provide the highest classification accuracy for each of the six seizures amongst the three models (20%, 53%, and 85% for first, second, and third model, respectively).

eess.SP↗

arXiv2021

Seizure Classification of EEG based on Wavelet Signal Denoising Using a Novel Channel Selection Algorithm

Epilepsy is a disorder of the nervous system that can affect people of any age group. With roughly 50 million people worldwide diagnosed with the disorder, it is one of the most common neurological disorders. The EEG is an indispensable tool for diagnosis of epileptic seizures in an ideal case, as brain waves from an epileptic person will present distinct abnormalities. However, in real world situations there will often be biological and electrical noise interference, as well as the issue of a multichannel signal, which introduce a great challenge for seizure detection. For this study, the Temple University Hospital (TUH) EEG Seizure Corpus dataset was used. This paper proposes a novel channel selection method which isolates different frequency ranges within five channels. This is based upon the frequencies at which normal brain waveforms exhibit. A one second window was selected, with a 0.5 second overlap. Wavelet signal denoising was performed using Daubechies 4 wavelet decomposition, thresholding was applied using minimax soft thresholding criteria. Filter banking was used to localise frequency ranges from five specific channels. Statistical features were then derived from the outputs. After performing bagged tree classification using 500 learners, a test accuracy of 0.82 was achieved.

q-bio.PE↗

arXiv2020

Drug repurposing prediction for COVID-19 using probabilistic networks and crowdsourced curation

Severe acute respiratory syndrome coronavirus two (SARS-CoV-2), the virus responsible for the coronavirus disease 2019 (COVID-19) pandemic, represents an unprecedented global health challenge. Consequently, a large amount of research into the disease pathogenesis and potential treatments has been carried out in a short time frame. However, developing novel drugs is a costly and lengthy process, and is unlikely to deliver a timely treatment for the pandemic. Drug repurposing, by contrast, provides an attractive alternative, as existing drugs have already undergone many of the regulatory requirements. In this work we used a combination of network algorithms and human curation to search integrated knowledge graphs, identifying drug repurposing opportunities for COVID-19. We demonstrate the value of this approach, reporting on eight potential repurposing opportunities identified, and discuss how this approach could be incorporated into future studies.

q-bio.MN↗

arXiv2019

Augmenting expert detection of early coronary artery occlusion from 12 lead electrocardiograms using deep learning

Early diagnosis of acute coronary artery occlusion based on electrocardiogram (ECG) findings is essential for prompt delivery of primary percutaneous coronary intervention. Current ST elevation (STE) criteria are specific but insensitive. Consequently, it is likely that many patients are missing out on potentially life-saving treatment. Experts combining non-specific ECG changes with STE detect ischaemia with higher sensitivity, but at the cost of specificity. We show that a deep learning model can detect ischaemia caused by acute coronary artery occlusion with a better balance of sensitivity and specificity than STE criteria, existing computerised analysers or expert cardiologists.

stat.AP↗

arXiv2013

Non-symmetric magnetohydrostatic equilibria: a multigrid approach

Aims. Linear magnetohydrostatic (MHS) models of solar magnetic fields balance plasma pressure gradients, gravity and Lorentz forces where the current density is composed of a linear force-free component and a cross-field component that depends on gravitational stratification. In this paper, we investigate an efficient numerical procedure for calculating such equilibria. Methods. The MHS equations are reduced to two scalar elliptic equations - one on the lower boundary and the other within the interior of the computational domain. The normal component of the magnetic field is prescribed on the lower boundary and a multigrid method is applied on both this boundary and within the domain to find the poloidal scalar potential. Once solved to a desired accuracy, the magnetic field, plasma pressure and density are found using a finite difference method. Results. We investigate the effects of the cross-field currents on the linear MHS equilibria. Force-free and non-force-free examples are given to demonstrate the numerical scheme and an analysis of speed-up due to parallelization on a graphics processing unit (GPU) is presented. It is shown that speed-ups of x30 are readily achievable.

astro-ph.SR↗

arXiv2013

Using evolutionary computation to create vectorial Boolean functions with low differential uniformity and high nonlinearity

The two most important criteria for vectorial Boolean functions used as S-boxes in block ciphers are differential uniformity and nonlinearity. Previous work in this field has focused only on nonlinearity and a different criterion, autocorrelation. In this paper, we describe the results of experiments in using simulated annealing, memetic algorithms, and ant colony optimisation to create vectorial Boolean functions with low differential uniformity. Keywords: Metaheuristics, simulated annealing, memetic algorithms, ant colony optimization, cryptography, Boolean functions, vectorial Boolean functions.

cs.CR↗