• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 64
  • 12
  • 7
  • 4
  • 3
  • 3
  • 2
  • 1
  • 1
  • 1
  • 1
  • Tagged with
  • 114
  • 40
  • 22
  • 20
  • 18
  • 12
  • 10
  • 9
  • 8
  • 8
  • 8
  • 7
  • 7
  • 7
  • 7
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
1

Computation of the Ruelle-Sullivan map for substitution tilings

Starling, Charles Benjimen. 10 April 2008 (has links)
No description available.
2

Self-affine tilings, digit sets classification, and related problems.

January 2004 (has links)
Cheung Wai-Man. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2004. / Includes bibliographical references (leaves 62-64). / Abstracts in English and Chinese. / Abstract --- p.ii / Acknowledgement --- p.iv / Chapter 1 --- Introduction --- p.1 / Chapter 2 --- Fundamental Results of Self-Affine Tiles --- p.11 / Chapter 2.1 --- Construction of self-affine tiles --- p.11 / Chapter 2.2 --- The requirements of self-affine tiles --- p.14 / Chapter 2.3 --- Tiling sets of self-affine tiles --- p.22 / Chapter 3 --- Digit sets of Self-Affine Tiles --- p.42 / Chapter 3.1 --- Integral self-affine tiles --- p.42 / Chapter 3.2 --- Classification of digit sets --- p.49 / Chapter 3.3 --- Weak product-form digit set --- p.52 / Chapter 3.4 --- Remarks --- p.55 / Chapter 4 --- Discussion --- p.57 / Chapter 4.1 --- Concluding remarks --- p.57 / Chapter 4.2 --- Conjectures --- p.58 / Bibliography --- p.64
3

Periodic tilings and tilings by regular polygons

Chavey, Darrah Perry. January 1900 (has links)
Thesis (Ph. D.)--University of Wisconsin--Madison, 1984. / Typescript. Vita. eContent provider-neutral record in process. Description based on print version record. Includes bibliographical references (leaves 188-191).
4

Computing entropy for Z²-actions

Pierce, Larry A. 11 September 2008 (has links)
For a certain class of Z²-actions, we provide a proof of a conjecture that the ratio of the Perron eigenvalues of the transfer matrices of the free boundary restrictions converge to the entropy of that action. Also, a novel method for computing the entropy of Z²-actions is conjectured. / Graduation date: 2009 / Presentation date: 2008-07-23
5

The radix expansions and the disklikeness of self-affine tiles. / CUHK electronic theses & dissertations collection

January 2004 (has links)
by Leung King-Shun. / "August 2004." / Thesis (Ph.D.)--Chinese University of Hong Kong, 2004. / Includes bibliographical references (p. 67-70). / Electronic reproduction. Hong Kong : Chinese University of Hong Kong, [2012] System requirements: Adobe Acrobat Reader. Available via World Wide Web. / Mode of access: World Wide Web. / Abstracts in English and Chinese.
6

Tiling of the integers.

January 2008 (has links)
Leung, Fung Bun. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2008. / Includes bibliographical references (leaves 36). / Abstracts in English and Chinese. / Abstract --- p.i / Acknowledgement --- p.iii / Chapter 1 --- Introduction --- p.1 / Chapter 2 --- Tiling of Integers --- p.3 / Chapter 2.1 --- General Assumptions --- p.3 / Chapter 2.2 --- Periodicity of Tiling --- p.4 / Chapter 2.3 --- Cyclotomic Polynomials --- p.5 / Chapter 2.4 --- Equivalence --- p.10 / Chapter 3 --- Theorems of Integer Tiles --- p.12 / Chapter 3.1 --- Main Theorems --- p.12 / Chapter 3.2 --- Jusifications on Assumptions --- p.12 / Chapter 3.3 --- Proofs of Main Theorems --- p.14 / Chapter 3.3.1 --- Proof of Theorem 3.1.1 --- p.14 / Chapter 3.3.2 --- Proof of Theorem 3.1.2 --- p.15 / Chapter 3.3.3 --- Proof of Theorem 3.1.3 --- p.15 / Chapter 4 --- Structure of Integer Tiles --- p.20 / Chapter 4.1 --- Classification --- p.20 / Chapter 4.2 --- Structure of Tiles with Cardinality pα --- p.22 / Chapter 4.3 --- Structure of Tiles with Cardinality pαqβ --- p.23 / Chapter 4.4 --- More Examples --- p.25 / Chapter 5 --- Complementing Pairs Mod pqr --- p.26 / Chapter 5.1 --- Introduction --- p.26 / Chapter 5.2 --- A Conjecture and Proofs --- p.27 / Chapter 5.3 --- A Summary of Our Results --- p.29 / Chapter A --- Number Systems --- p.30 / Chapter A.l --- Definitions --- p.30 / Chapter A.2 --- Structure of tiles of Z+ and Nn --- p.31 / Chapter B --- Notations --- p.35
7

Sturmian dynamical systems /

Hillman, Chris, January 1998 (has links)
Thesis (Ph. D.)--University of Washington, 1998. / Vita. Includes bibliographical references (p. [333]-346).
8

Methods for creating corner colored Wang tiles

Persons, Michael Joseph. January 2010 (has links) (PDF)
Thesis (M.S. in computer science)--Washington State University, May 2010. / Title from PDF title page (viewed on May 18, 2010). "School of Engineering and Computer Science." Includes bibliographical references (p. 104-106).
9

Tiling the Integers

Li, Shasha 01 January 2014 (has links)
A set tiles the integers if and only if the integers can be written as a disjoint union of translates of that set. Counterexamples based on finite Abelian groups show that Fuglede conjecture is false in high dimensions. A solution for the Fuglede conjecture in Z or all the groups ZN would provide a solution for the Fuglede conjecture in R. Focusing on tiles in dimension one, we will concentrate on the analysis of tiles in the finite groups ZN. Based on the Coven- Meyerowitz conjecture, it has been proved that if any spectral set in Z satisfies the the Coven-Meyerowitz properties, then every spectral set in R is a tile. We will present some of the main results related to integer tiles and give a self-contained description of the theory with detailed proofs.
10

Automated Generation of Telemetry Formats

Jones, Charles H., Gardner, Lee S. 10 1900 (has links)
International Telemetering Conference Proceedings / October 28-31, 1996 / Town and Country Hotel and Convention Center, San Diego, California / The process of generating a telemetry format is currently more of an ad-hoc art than a science. Telemetry stream formats conform to traditions that seem to be obsolete given today's computing power. Most format designers would have difficulty explaining why they use the development heuristics they use and even more difficulty explaining why the heuristics work. The formats produced by these heuristics tend to be inefficient in the sense that bandwidth is wasted. This paper makes an important step in establishing a theory on which to base telemetry format construction. In particular it describes an O(nlog n) algorithm for automatically generating telemetry formats. The algorithm also has the potential of efficiently filling a telemetry stream without wasting bits.

Page generated in 0.0567 seconds