Thesis (Ph. D.)--Universität der Bundeswehr, Hamburg (Germany), 1999. / Includes bibliographical references (p. 179-192).

Thesis (M.U.D.)--University of Hong Kong, 1997. / Includes bibliographical references (leaves 160-163).

The growing demand for high performance systems in modern computing technology drives the development of advanced and high speed designs in I/O structures. Due to their data rate and architecture, however, testing of the high speed serial interfaces becomes more expensive when using conventional test methods. In order to alleviate the test cost issue, a loopback test scheme has been widely adopted. To assess the margin of the signal eye in the loopback configuration, the eye margin is purposely reduced by additional devices on the loopback path or using design for testability (DFT) features such as timing and voltage margining. Although the loopback test scheme successfully reduces the test cost by decoupling the dependency of external test equipment, it has robustness issues such as a fault masking issue and a non-ideality problem of margining circuits. The focus of this dissertation is to propose new methods to resolve the known issues in the loopback test mode. The fault masking issue in a loopback pair of analog to digital and digital to analog converters (ADC and DAC) which can be found in pulse amplitude modulation (PAM) signaling schemes is resolved using a proposed algorithm which separates the characteristics of the ADC and the DAC from a combined loopback response. The non-ideality problem of margining circuit is resolved using a proposed method which utilizes a random jitter injection technique. Using the injected random jitter, the jitter distribution is sampled by undersampling and margining, which provides the nonlinearity information using the proposed algorithm. Since the proposed method requires a random jitter source on the load board, an alternative solution is proposed which uses an intrinsic jitter profile and a sliding window search algorithm to characterize the nonlinearities. The sliding search algorithm was implemented in a low cost high volume manufacturing (HVM) tester to assess feasibility and validity of the proposed technique. The proposed methods are compatible with the existing loopback test scheme and require a minimal area and design overhead, hence they provide cost effective ways to enhance the robustness of the loopback test scheme. / text

Mixed-use development is one of the canonical elements of modern urban planning theory and practice. The principles of this approach to development are applied throughout the world and have seen a resurgence in the last several decades as part of the rise of populist movements such as smart growth and new urbanism. At the same time, cities across the industrialized world have been reshaped within the broader context of fundamental restructuring in the labour market over the past several decades. The urban core of the post-industrial city has increasingly become the site of residential development amongst various complementary land uses, marketed to an upwardly mobile professional class. Who benefits from this kind of mixed-use development in the housing market? Despite its popularity, mixed-use development is not often examined with regard to the affordability of housing. This study explores the affordability of housing in areas zoned as mixed-use in the old City of Toronto in relation to shifts in the occupational structure of the city’s workforce between 1991 and 2006. Using census data and spatial analysis methods, the cartographic and analytical outputs of this study demonstrate two major findings: first, that housing in mixed-use areas was more expensive than the rest of the city over the study period; and second, that socioeconomic polarization between classes of occupations is not only evident in mixed-use areas, but in some ways more pronounced than in the rest of the city. Based on these findings, the study concludes with a realistic assessment of why and how academics, practitioners and policymakers active in urban planning should step up efforts to couple the revitalization of Toronto’s urban core with gains to the affordability of housing.

Single-row mixed-integer programming (MIP) problems have been studied thoroughly under many different perspectives over the years. While not many practical applications can be modeled as a single-row MIP, their importance lies in the fact that they are simple, natural and very useful relaxations of generic MIPs. This thesis will focus on such MIPs and present theoretical and computational advances in their study. Chapter 1 presents an introduction to single-row MIPs, a historical overview of results and a motivation of why we will be studying them. It will also contain a brief review of the topics studied in this thesis as well as our contribution to them. In Chapter 2, we introduce a generalization of a very important structured single-row MIP: Gomory's master cyclic group polyhedron (MCGP). We will show a structural result for the generalization, characterizing all facet-defining inequalities for it. This structural result allows us to develop relationships with MCGP, extend it to the mixed-integer case and show how it can be used to generate new valid inequalities for MIPs. Chapter 3 presents research on an algorithmic view on how to maximally lift continuous and integer variables. Connections to tilting and fractional programming will also be presented. Even though lifting is not particular to single-row MIPs, we envision that the general use of the techniques presented should be on easily solvable MIP relaxations such as single-row MIPs. In fact, Chapter 4 uses the lifting algorithm presented. Chapter 4 presents an extension to the work of Goycoolea (2006) which attempts to evaluate the effectiveness of Mixed Integer Rounding (MIR) and Gomory mixed-integer (GMI) inequalities. By extending his work, natural benchmarks arise, against which any class of cuts derived from single-row MIPs can be compared. Finally, Chapter 5 is dedicated to dealing with an important computational problem when developing any computer code for solving MIPs, namely the problem of numerical accuracy. This problem arises due to the intrinsic arithmetic errors in computer floating-point arithmetic. We propose a simple approach to deal with this issue in the context of generating MIR/GMI inequalities.

Thesis (M.S.)--Oregon State University, 2009. / Printout. Includes bibliographical references (leaves 118-122). Also available on the World Wide Web.

Thesis (Ph. D.)--University of Missouri-Columbia, 2008. / The entire dissertation/thesis text is included in the research.pdf file; the official abstract appears in the short.pdf file (which also appears in the research.pdf); a non-technical general description, or public abstract, appears in the public.pdf file. Title from title screen of research.pdf file (viewed on August 3, 2009) Vita. Includes bibliographical references.

Thesis (M.A.)--York University, 1997. Graduate Programme in Sociology. / Typescript. Includes bibliographical references (leaves 151-156). Also available on the Internet. MODE OF ACCESS via web browser by entering the following URL: http://wwwlib.umi.com/cr/yorku/fullcit?pMQ27350.

Thesis (Ph. D.)--University of Washington, 2002. / Vita. Includes bibliographical references (leaves 366-378).

Thesis (M.U.D.)--University of Hong Kong, 1997. / Includes bibliographical references (leaves 160-163) Also available in print.