Spelling suggestions: "subject:"coverings"" "subject:"overings""
1 |
From fair-faced brickwork to painted surfaces wall finishes in Hong Kong's ancestral halls, study halls and residential building /Chung, Chan-keung. January 2003 (has links)
Thesis (M.Sc.)--University of Hong Kong, 2003. / Includes bibliographical references (p. 116-117)
|
2 |
Effectiveness of home cleaning methods on selected tufted carpetsWenger, Allene Lydia January 2011 (has links)
Digitized by Kansas State University Libraries
|
3 |
Relative merits of wood and tile gymnasium floorsKleinfeldt, Robert Harland. January 1964 (has links)
Thesis (M.S.)--University of Wisconsin--Madison, 1964. / eContent provider-neutral record in process. Description based on print version record. Bibliography: l. [53]-54.
|
4 |
From fair-faced brickwork to painted surfaces: wall finishes in Hong Kong's ancestral halls, study hallsand residential buildingChung, Chan-keung, 鍾振強 January 2003 (has links)
published_or_final_version / Conservation / Master / Master of Science in Conservation
|
5 |
Finite groups and coverings of surfacesKazaz, Mustafa January 1997 (has links)
No description available.
|
6 |
Development and validation of a laminate flooring system sound quality test methodWilson, James Harris. January 2009 (has links)
Thesis (M. S.)--Mechanical Engineering, Georgia Institute of Technology, 2009. / Committee Chair: Cunefare, Kenneth A.; Committee Member: Qu, Jianmin; Committee Member: Ryherd, Erica. Part of the SMARTech Electronic Thesis and Dissertation Collection.
|
7 |
Universal and Near-Universal Cycles of Set PartitionsHiggins, Zach, Kelley, Elizabeth, Sieben, Bertilla, Godbole, Anant 23 December 2015 (has links)
We study universal cycles of the set P(n,k) of k-partitions of the set [n]:={1,2,…,n} and prove that the transition digraph associated with P(n,k) is Eulerian. But this does not imply that universal cycles (or ucycles) exist, since vertices represent equivalence classes of partitions. We use this result to prove, however, that ucycles of P(n,k) exist for all n≥3 when k=2. We reprove that they exist for odd n when k=n−1 and that they do not exist for even n when k=n−1. An infinite family of (n,k) for which ucycles do not exist is shown to be those pairs for which (Formula presented) is odd (3≤k
|
8 |
4-Cycle Coverings of the Complete Graph With a HoleGardner, Robert, LaVoie, Scott, Nguyen, Chau 10 December 2010 (has links)
Let K(v,w) denote the complete graph on v vertices with a hole of size w (i.e., K(v, w) = Kv\Kw). We give necessary and sufficient conditions for the existence of a minimum 4-cycle covering of K (v,w).
|
9 |
Double Affine Bruhat OrderWelch, Amanda Renee 03 May 2019 (has links)
Given a finite Weyl group W_fin with root system Phi_fin, one can create the affine Weyl group W_aff by taking the semidirect product of the translation group associated to the coroot lattice for Phi_fin, with W_fin. The double affine Weyl semigroup W can be created by using a similar semidirect product where one replaces W_fin with W_aff and the coroot lattice with the Tits cone of W_aff. We classify cocovers and covers of a given element of W with respect to the Bruhat order, specifically when W is associated to a finite root system that is irreducible and simply laced. We show two approaches: one extending the work of Lam and Shimozono, and its strengthening by Milicevic, where cocovers are characterized in the affine case using the quantum Bruhat graph of W_fin, and another, which takes a more geometrical approach by using the length difference set defined by Muthiah and Orr. / Doctor of Philosophy / The Bruhat order is a way of organizing elements of the double affine Weyl semigroup so that we have a better understanding of how the elements interact. In this dissertation, we study the Bruhat order, specifically looking for when two elements are separated by exactly one step in the order. We classify these elements and show that there are only finitely many of them.
|
10 |
Muovimattopinnoitteisen lattiarakenteen VOC-emissiot sisäilmaongelmatapauksissa /Järnström, Helena. January 2005 (has links) (PDF)
Lisensiaatintyö -- Kuopion yliopisto. Ympäristötieteiden laitos. / Includes bibliographical references (p. 69-76). Also available on the World Wide Web.
|
Page generated in 0.163 seconds