6 August 2015 in Radio Science
Understanding and modeling the rainfall drop size distribution is important in a number of applications, in particular predicting and mitigating attenuation of satellite signals in the millimeter band. Various standard statistical distributions have been proposed as suitable models, the first widely accepted being the exponential distribution. Subsequently, gamma and lognormal distributions have been shown to provide better rainfall rate computations. Some empirical studies have revealed bimodal distributions under some circumstances. A natural question to ask therefore is how often gamma and lognormal distributions fit the empirical data. In this paper we fit lognormal and gamma distributions to 1 min slices of rainfall drop size distributions taken from 7 year data from the Chilbolton Observatory in southern England. The chi‐square goodness of fit of the models against the data is calculated, and it is found that failure to fit is greater than would normally be expected. This failure to fit is broken down and examined against seasonal variations, different rain rates, atmospheric temperature, and wind speed. Possible reasons for the lack of fit are explored, and alternative fits using models based on Gaussian Mixture Models are developed and found to be an improvement.
18 October 2010 in IEEE Transactions on Information Theory
Spreading codes for code-division multiple-access (CDMA) systems are constructed based on Hadamard matrices and almost-bent functions. These codes can be assigned to a tessellation of hexagonal cells in such a way that codewords assigned to the same cell or to adjacent cells have zero cross-correlation. The nonzero cross-correlations in the code only apply to pairs of codewords assigned to nonadjacent cells. The codes have four times as many codewords as codes constructed from a single Hadamard matrix, which leads to significantly increased codeword re-use distances in comparison with the conventional use of a single Hadamard matrix with the same number of codewords per cell.
5 July 2018 in Mathematical Proceedings of the Cambridge Philosophical Society
A permutation group G on a set Ω is said to be binary if, for every n ∈ ℕ and for every I, J ∈ Ωn, the n-tuples I and J are in the same G-orbit if and only if every pair of entries from I is in the same G-orbit to the corresponding pair from J. This notion arises from the investigation of the relational complexity of finite homogeneous structures.Cherlin has conjectured that the only finite primitive binary permutation groups are the symmetric groups Sym(n) with their natural action, the groups of prime order, and the affine groups V ⋊ O(V) where V is a vector space endowed with an anisotropic quadratic form.We prove Cherlin's conjecture, concerning binary primitive permutation groups, for those groups with socle isomorphic to PSL2(q), 2B2(q), 2G2(q) or PSU3(q). Our method uses the notion of a “strongly non-binary action”.
1 September 2013 in Designs, Codes and Cryptography