L. Allison

L. Allison
Are you L. Allison?

Claim your profile, edit publications, add additional information:

Contact Details

L. Allison

Pubs By Year

Pub Categories

Nuclear Experiment (2)
Quantitative Biology - Biomolecules (1)
Computer Science - Data Structures and Algorithms (1)
Quantitative Biology - Quantitative Methods (1)
Statistics - Machine Learning (1)
Physics - Instrumentation and Detectors (1)
Computer Science - Learning (1)

Publications Authored By L. Allison

This workshop aimed at producing an optimized photon source concept with potential increase of scientific output at Jefferson Lab, and at refining the science for hadron physics experiments benefitting from such a high-intensity photon source. The workshop brought together the communities directly using such sources for photo-production experiments, or for conversion into $K_L$ beams. The combination of high precision calorimetry and high intensity photon sources greatly enhances scientific benefit to (deep) exclusive processes like wide-angle and time-like Compton scattering. Read More

We investigated the use of Hamamatsu fine-mesh photomultiplier tube assemblies H6152-70 and H6614-70 with regards to their gain and timing resolution in magnetic fields up to 1.9 T. Our results show that the H6614-70 assembly can operate reliably in magnetic fields exceeding 1. Read More

Mixture modelling involves explaining some observed evidence using a combination of probability distributions. The crux of the problem is the inference of an optimal number of mixture components and their corresponding parameters. This paper discusses unsupervised learning of mixture models using the Bayesian Minimum Message Length (MML) criterion. Read More

Proteins are biomolecules of life. They fold into a great variety of three-dimensional (3D) shapes. Underlying these folding patterns are many recurrent structural fragments or building blocks (analogous to `LEGO bricks'). Read More

Described are two algorithms to find long approximate palindromes in a string, for example a DNA sequence. A simple algorithm requires O(n)-space and almost always runs in $O(k.n)$-time where n is the length of the string and k is the number of ``errors'' allowed in the palindrome. Read More