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 20 of 127 for “"Circulant"”.

  1. 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 …

    anu Repository record for Circulant weighing matrices (opens in a new tab)

  2. The Circulant Quadric

    [No abstract provided.]

    mississippi Repository record for The Circulant Quadric (opens in a new tab)

  3. Properties of circulant matrices

    … properties of a special class of matrices called circulants. Four types of circulants will be investigated : regular, symmetric regular, symmetric, and skew circulants.</p> <p>Chapter 1 introduces and discusses regular circulants.</p> <p>Chapter 2 deals primarily with the properties of symmetric …

    ut-knoxville Repository record for Properties of circulant matrices (opens in a new tab)

  4. Maximum Clique Search in Circulant k-Hypergraphs

    … we are interested in the generalization of circulant graphs to circulant k-hypergraphs, and provide a definition of this type of hypergraph. We design and implement a new algorithm to perform max-clique searches on circulant k-hypergraphs. This algorithm combines ideas from a Russian doll …

    ottawa-retro Repository record for Maximum Clique Search in Circulant k-Hypergraphs (opens in a new tab)

  5. Combinatorics of periodic orbits on quantum circulant graphs.

    … primitive periodic orbits for 2-regular directed circulant graphs. A 2-regular circulant digraph is the Cayley graph of Zn with two generators. To count the primitive periodic orbits on these graphs, we analyze the lattice structure of possible lengths and generator counts for orbits, and evaluate …

    baylor Repository record for Combinatorics of periodic orbits on quantum circulant graphs. (opens in a new tab)

  6. Double circulant self-dual codes from Legendre sequences

    … of length p, p an odd prime, is used to create a circulant matrix S. An alternative Legendre sequence s̃ is employed to form another circulant matrix S. By concatenating these two matrices, we obtain the matrix D′ which is used to form a bordered double circulant code with length 2p + 2 and …

    uvic Repository record for Double circulant self-dual codes from Legendre sequences (opens in a new tab)

  7. Analysis And Construction Of Extremal Circulant And Other Abelian Cayley Graphs

    … the analysis and construction of extremal circulant and other Abelian Cayley graphs. For the purpose of this thesis, extremal graphs are understood as graphs with largest possible order for given degree and diameter, and the search for them is called the degree-diameter problem. The …

    the-open-u Download PDF for Analysis And Construction Of Extremal Circulant And Other Abelian Cayley Graphs (opens in a new tab)

  8. Automatisation de la découverte de relations sémantiques entre contenus circulant sur les dispositifs sociotechniques

    Les dispositifs sociotechniques tels que les réseaux sociaux (LinkedIn, Facebook, Google +), les sites de microblogues (Twitter, Identi.ca), les plateformes de partage de contenus (Digg, StumbleUpon, Buzznet) ou d'hébergement de contenus générés par les utilisateurs (Academia.edu, Youtube, …

    teluq Repository record for Automatisation de la découverte de relations sémantiques entre contenus circulant sur les dispositifs sociotechniques (opens in a new tab) Download PDF for Automatisation de la découverte de relations sémantiques entre contenus circulant sur les dispositifs sociotechniques (opens in a new tab)

  9. Adapting conditional simulation using circulant embedding for irregularly spaced data and exploring its limits

    … for use in ShakeMap. This approach, termed circulant embedding (CE), builds on a fast method for simulating Gaussian processes. However, standard CE is restricted to simulating stationary Gaussian processes (possibly anisotropic) on regularly spaced grids. It is also known that if the range …

    colo-mines Repository record for Adapting conditional simulation using circulant embedding for irregularly spaced data and exploring its limits (opens in a new tab)

  10. On Dihedral Codes and the Double Circulant Conjecture for Binary Extended Quadratic Residue Codes

    … 2 k. We prove that these codes have a double circulant presentation in the following three cases: (1) q = 1. (2) q is a prime and 2 is a primitive root modulo q . (3) Let X be the class of x in S, and sigma the algebra automorphisms on S that sends Xi to X -i. Factor 1 + xq over F2 into …

    uiuc Repository record for On Dihedral Codes and the Double Circulant Conjecture for Binary Extended Quadratic Residue Codes (opens in a new tab)

  11. Construction of the orthogonal groups of n x n circulant matrices over finite fields

    … p$ prime. Let ${\cal M}$ be the algebra of n x n circulant matrices over F. The set $O\sb{(n,q)}$ of orthogonal n x n circulant matrices is a subgroup of ${\cal M}\sp\times.$ The major purposes of the thesis are: (1) to explain K. A. Byrd and T. P. Vaughan's results stated in (8), about formulas …

    concordia Download PDF for Construction of the orthogonal groups of n x n circulant matrices over finite fields (opens in a new tab)

  12. Hamiltonian cycles and chains in graphs with striped and circulant distance matrices : theory and applications

    <p>This work was motivated by the work of Garfinkel who formulated the problem of wallpapering a room so as to minimize the paper wasted as a traveling salesman problem over a very special class of distance matrices. In this work a much more realistic version of the wallpapering problem, obtained …

    utk-theses Repository record for Hamiltonian cycles and chains in graphs with striped and circulant distance matrices : theory and applications (opens in a new tab)

  13. Learning to Precondition: Reinforcement Learning Enhanced Three-Level Circulant Preconditioning for the Discrete Dipole Approximation

    … systems, limiting its practical scope. Prior circulant preconditioning work, building on frameworks by Chan and Olkin and applied to DDA by Groth et al., demonstrated speedups primarily for quasi-2D geometries while attempts to create stable three-level preconditioners for general 3D …

    unt Repository record for Learning to Precondition: Reinforcement Learning Enhanced Three-Level Circulant Preconditioning for the Discrete Dipole Approximation (opens in a new tab)

  14. Diminution de la concentration des ecdysones circulant après la mue de puberté chez Chionoecetes opilio

    … Par conséquent, la concentration des ecdysones circulant dans l'hémolymphe diminue de façon marquée. Cette condition caractérise la mue terminale. La maturité sexuelle de chaque crabe a été déterminée par la relation allométrique du poids sec de la pince en fonction de la largeur de la carapace …

    moncton Repository record for Diminution de la concentration des ecdysones circulant après la mue de puberté chez Chionoecetes opilio (opens in a new tab)

  15. Algebraic and Arithmetic Properties of Graph Spectra

    … we determine precisely the algebraic degree of circulant graphs and find new criteria for isospectrality of circulant graphs. Moreover, we solve the inverse Galois problem for circulant graphs showing that every finite abelian extension of the rationals is the splitting field of some circulant …

    wurz-thes Repository record for Algebraic and Arithmetic Properties of Graph Spectra (opens in a new tab)

Page 1 of 7