Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 13 of 13 for “"Weighing matrices"”.
-
Group weighing matrices
A weighing matrix is a square matrix M with 0, 1, -1 entries such that MM'=wI where w is an integer, M' is the transpose of M and I is the identity matrix. In addition, if the matrix is a group matrix associated with a group G, it is called a group weighing matrix or a W(G,w).We study three …
-
Circulant weighing matrices
Circulant weighing matrices are matrices with entries in {-1,0,1} where the rows are pairwise orthogonal and each successive row is obtained from the previous row by a fixed cyclic permutation. They are useful in solving problems where it is necessary to determine as accurately as possible, the …
-
Weighing matrices: generalizations and related configurations
… to explore the relationships that exist between weighing matrices, including their generalizations, and various other combinatorial configurations. Principally, it will be shown that any balanced generalized weighing matrix with entries from a finite abelian group is equivalent to the existence …
-
Biangular vectors
This thesis introduces unit weighing matrices, a generalization of Hadamard matrices. When dealing with unit weighing matrices, a lot of the structure that is held by Hadamard matrices is lost, but this loss of rigidity allows these matrices to be used in the construction of certain combinatorial …
-
A recursive construction for some combinatorial designs
… of a result of Rajkundlia, generalized Hadamard matrices are applied to recursively construct a class of embeddable quasi-residual balanced incomplete block designs (BIBDs). The construction leads to incidence matrices related to the designs with classical parameters. Further, by a similar method …
-
Decomposition of complete designs
… of sets of designs with disjoint incidence matrices whose sum is the complete design. The existence of infinite classes of symmetric association schemes follows from the decomposition. Applying a similar technique on the Spence designs provides sets of designs all sharing the same complete …
-
Asymptotic existence of orthogonal designs
… new classes of orthogonal designs related to weighing matrices are obtained in Chapter 3. In Chapter 4, we deal with product designs and amicable orthogonal designs, and a construction method is presented. Signed group orthogonal designs, a natural extension of orthogonal designs, are …
-
Συνδυαστική θεωρία σχεδιασμών, κωδίκων και κρυπτογραφίας
… algorithms (mGA, FmGA, OmeGA) for finding new weighing matrices, whereas the sequences are used as intermediate steps in the construction of the designs. Furthermore, new inequivalent Hadamard matrices are constructed from complementary sequences using a software developed specifically for this …
-
Amicable matrices and orthogonal designs
… we construct an infinite class of amicable T-matrices of order n=p^r+1 in association with negacirculant weighing matrices W(n,n-1). In particular, for p^r≡1 (mod 4) we construct amicable T-matrices of order n≡2 (mod 4) and application of these matrices allows us to generate infinite class of …
-
New approaches in parallel algorithm portfolios for metaheuristic optimization
… problems, namely the detection of circulant weighing matrices in combinatorics, the lot-sizing planning in production environments with returns and remanufacturing, and the transportation of commodities in humanitarian logistics. The second proposed model is a forecasting-based parallel …
-
Dynamic power system modelling and linear optimal stabilization design using a canonical form
… design, i.e. the choice of the performance index matrices Q and R. In this thesis a fairly accurate synchronous machine model in terms of easily measurable state variables is developed. By neglecting the short lived armature transients, the best dynamic model of a synchronous machine with torque …