Publications (15)
Program for calculating bounds on the minimum rank of a graph using Sage
Laura DeLoss, Jason Grout, Tracy McKay +2
The minimum rank of a simple graph is defined to be the smallest possible rank over all symmetric real matrices whose th entry (for ) is nonzero whenever …
Quantum Process
Jason Smith
The exact scattering solutions of the Klein-Gordon equation in cylindrically symmetric field are constructed as eigenfunctions of a complete set of commuting operators. The matrix…
Real-time adaptive estimation of decoherence timescales for a single qubit
Muhammad Junaid Arshad, Christiaan Bekker, Ben Haylock +12
Characterising the time over which quantum coherence survives is critical for any implementation of quantum bits, memories and sensors. The usual method for determining a quantum s…
Learning from History: Recreating and Repurposing Sister Harriet Padberg's Computer Composed Canon and Free Fugue
Richard Savery, Benjamin Genchel, Jason Smith +3
Harriet Padberg wrote Computer-Composed Canon and Free Fugue as part of her 1964 dissertation in Mathematics and Music at Saint Louis University. This program is one of the earlies…
Google's Neural Machine Translation System: Bridging the Gap between Human and Machine Translation
Yonghui Wu, Mike Schuster, Zhifeng Chen +28
Neural Machine Translation (NMT) is an end-to-end learning approach for automated translation, with the potential to overcome many of the weaknesses of conventional phrase-based tr…
A Hodge-FAST Framework for High-Resolution Dynamic Functional Connectivity Analysis of Higher Order Interactions in EEG Signals
Om Roy, Yashar Moshfeghi, Jason Smith +3
We introduce a novel framework that integrates Hodge decomposition with Filtered Average Short-Term (FAST) functional connectivity to analyze dynamic functional connectivity (DFC)…
Scintillation detectors constructed with an optimized 2x2 silicon photomultiplier array
Felix Liang, Hartmut Brands, Les Hoy +2
Silicon photomultipliers (SiPMs) are a good alternative to photomultiplier tubes (PMTs) because their gain and quantum efficiency are comparable to PMTs. However, the largest singl…
GridMonitor: Integration of Large Scale Facility Fabric Monitoring with Meta Data Service in Grid Environment
Rich Baker, Dantong Yu, Jason Smith +3
Grid computing consists of the coordinated use of large sets of diverse, geographically distributed resources for high performance computation. Effective monitoring of these comput…
Lithium-loaded scintillators coupled to a custom-designed silicon photomultiplier array for neutron and gamma-ray detection
Felix Liang, Hartmut Brands, Les Hoy +2
Scintillators capable of detecting both neutrons and gamma-rays have generated considerable interest. In particular, the use of such scintillators with silicon photomultipliers (Si…
Shape Measurement of Single Gold Nanorods in Water Using Open-access Optical Microcavities
Yumeng Yin, Aurelien Trichet, Jiangrui Qian +1
Shape measurement of rod-shaped particles in fluids is an outstanding challenge with applications in characterising synthetic functional nanoparticles and in early warning detectio…
Dynamic Training of Liquid State Machines
Pavithra Koralalage, Ireoluwa Fakeye, Pedro Machado +5
Spiking Neural Networks (SNNs) emerged as a promising solution in the field of Artificial Neural Networks (ANNs), attracting the attention of researchers due to their ability to mi…
Scalable registration of single quantum emitters within solid immersion lenses through femtosecond laser writing
Alexander R. Jones, Xingrui Cheng, Shravan Kumar Parthasarathy +7
The precise registration of solid-state quantum emitters to photonic structures is a major technological challenge for fundamental research (e.g. in cavity quantum electrodynamics)…
Information equilibrium as an economic principle
Jason Smith
A general information equilibrium model in the case of ideal information transfer is defined and then used to derive the relationship between supply (information destination) and d…
Table of minimum ranks of graphs of order at most 7 and selected optimal matrices
Laura DeLoss, Jason Grout, Leslie Hogben +3
The minimum rank of a simple graph is defined to be the smallest possible rank over all symmetric real matrices whose th entry (for ) is nonzero whenever …
Computing persistent homology of directed flag complexes
Daniel Luetgehetmann, Dejan Govc, Jason Smith +1
We present a new computing package Flagser, designed to construct the directed flag complex of a finite directed graph, and compute persistent homology for flexibly defined filtrat…