Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 8 of 8
Full-Text Articles in Physical Sciences and Mathematics
On The Structure And Existence Of Some Amicable Orthogonal Designs, Peter J. Robinson, Jennifer Seberry
On The Structure And Existence Of Some Amicable Orthogonal Designs, Peter J. Robinson, Jennifer Seberry
Faculty of Informatics - Papers (Archive)
The structure is determined for the existence of some amicable weighing matrices. This is then used to prove the existence and non-existence of some amicable orthogonal designs in powers of two.
A Remark On The Excess Of Hadamard Matrices And Orthogonal Designs, J Hammer, R Levingston, Jennifer Seberry
A Remark On The Excess Of Hadamard Matrices And Orthogonal Designs, J Hammer, R Levingston, Jennifer Seberry
Faculty of Informatics - Papers (Archive)
Some improved upper and lower bounds are given for the excess of Hadamard matrices. The excess of orthogonal designs is defined and discussed.
A Computer Listing Of Hadamard Matrices, Jennifer Seberry
A Computer Listing Of Hadamard Matrices, Jennifer Seberry
Faculty of Informatics - Papers (Archive)
A computer has been used to list all known Hadamard matrices of order less than 40,000. If an Hadamard matrix is not known of order 4q (q odd) then the smallest t so that there is an Hadamard matrix of order 2tq is given. Hadamard matrices are not yet known for orders 268, 412, 428.
A Class Of Codes Generated By Circulant Weighing Matrices, K Wehrhahn, Jennifer Seberry
A Class Of Codes Generated By Circulant Weighing Matrices, K Wehrhahn, Jennifer Seberry
Faculty of Informatics - Papers (Archive)
Some properties of a new class of codes constructed using circulant matrices over GF(3) will be discussed. In particular we determine the weight distributions of the (14, 7) and two inequivalent (26, 13)-codes arising from the incidence matrices of projective planes of orders 2 and 3.
Optimal Design Of A Quasi-Redundant Protective System For Nuclear Reactors, J. M. Kontoleon
Optimal Design Of A Quasi-Redundant Protective System For Nuclear Reactors, J. M. Kontoleon
Faculty of Informatics - Papers (Archive)
In many instances protective systems used in nuclear reactors are quasi-redundant systems; each of a number of safety channels feeds a number of independent protective units. A reactor shutdown is initiated if more than a specified number of units are in favour of shut down. The objective is to achieve a very high reliability at a reasonable cost. An analysis is presented to obtain the reliability, failsafe and fail-danger probabilities of a quasi-redundant system. Three algorithms are given for: (a) the design of a quasi-redundant system having the maximum reliability subject to a cost constraint, (b) the optimal design satisfying …
A Class Of Group Divisible Designs, Jennifer Seberry
A Class Of Group Divisible Designs, Jennifer Seberry
Faculty of Informatics - Papers (Archive)
No abstract provided.
On Skew Hadamard Matrices, Jennifer Seberry
On Skew Hadamard Matrices, Jennifer Seberry
Faculty of Informatics - Papers (Archive)
Recently I have proved that for every odd integer q there exists integers t and s (dependent on q) so that there is an Hadamard matrix of order 2tq and a symmetric Hadamard matrix with constant diagonal order 2s q2. We conjecture that "for every odd integer q there exists an integer t (dependent on q) so that there is a skew-Hadamard matrix of order 2tq”. This paper makes progress toward proving this conjecture. In particular we prove the result when q = 5 (mod 8) = s2 + 4r2 is a prime power and all orthogonal designs of type …
Generation Of A Frequency Square Orthogonal To A 10 X 10 Latin Square, H C. Kirton, Jennifer Seberry
Generation Of A Frequency Square Orthogonal To A 10 X 10 Latin Square, H C. Kirton, Jennifer Seberry
Faculty of Informatics - Papers (Archive)
In general it is a difficult if not impossible task to find a latin square orthogonal to a given latin square. Because of a practical problem it was required to find a frequency square orthogonal to a given latin square. We describe a computer approach which was successful in finding a (4,23) frequency square orthogonal to a given 10 x 10 latin square.