Thesis (M.S.)--Auburn University, 2008. / Abstract. Vita. Includes program code. Includes bibliographical references (p. 94-96).

Thesis (M.S. in Computer Science)--Naval Postgraduate School, June 2010. / Thesis Advisor(s): Irvine, Cynthia E. ; Clark, Paul C. "June 2010." Description based on title screen as viewed on July 14, 2010. Author(s) subject terms: Trustworthy systems, separation kernels, secondary storage, storage hierarchy Includes bibliographical references (p. 143-144). Also available in print.

Thesis (Ph. D.)--Lehigh University, 2003. / Includes vita. Includes bibliographical references (leaves 167-176).

by Cheng Lai-fan, Candice, Li Po-yi, Mabel. / Thesis (M.B.A.)--Chinese University of Hong Kong, 1993. / Includes bibliographical references (leaf 120). / ACKNOWLEDGMENT --- p.i / ABSTRACT --- p.ii / TABLE OF CONTENTS --- p.iv / LIST OF TABLES --- p.vii / LIST OF FIGURES --- p.viii / Chapter / Chapter I. --- INTRODUCTION --- p.1 / Objectives of the Research --- p.2 / Chapter II. --- LITERATURE REVIEW --- p.4 / Number of Private Cars in Hong Kong --- p.4 / Problem of Vehicle Theft in Hong Kong --- p.5 / Definition of Electronic Autosecurity Systems --- p.8 / Market of Electronic Autosecurity Systems for Private Cars in Hong Kong --- p.9 / Chapter III. --- METHODOLOGY --- p.10 / Target Population --- p.10 / Method of Data Collection --- p.10 / Pretest --- p.11 / Questionnaire --- p.11 / Sampling --- p.12 / Chapter IV. --- SURVEY FINDINGS --- p.14 / Use of Autosecurity Systems --- p.14 / Demographic Data About the Respondents --- p.15 / Age --- p.15 / Sex --- p.15 / Education --- p.16 / Driving Experience --- p.16 / Data About the Car --- p.17 / Data About Mechanical Autosecurity Devices Installed --- p.18 / Degree of Satisfaction --- p.18 / Data About Electronic Autosecurity Systems Installed --- p.19 / Brand Awareness --- p.19 / Country of Origin --- p.19 / Time Spent on Information Search --- p.19 / Cost --- p.20 / Degree of Satisfaction --- p.20 / Satisfactory and Dissatisfactory Aspects --- p.22 / Information Sources --- p.24 / Evaluative Criteria in the Purchase of Electronic Autosecurity Systems --- p.25 / Decision Process --- p.26 / Product Switching Behavior of Users of Mechanical Autosecurity Devices --- p.28 / Chapter V. --- LIMITATIONS --- p.30 / Chapter VI. --- CONCLUSION AND RECOMMENDATIONS --- p.34 / Conclusion --- p.34 / Information Sources --- p.35 / Evaluative Criteria --- p.36 / Decision Process --- p.37 / Product Switching Behavior --- p.39 / Recommendations --- p.41 / Forecast of Market Potential of Electronic Autosecurity Systems for Private Cars in Hong Kong --- p.41 / Market Share --- p.41 / Market Potential --- p.42 / Other Considerations --- p.43 / Marketing Strategies --- p.43 / Product Strategies --- p.43 / Pricing Strategies --- p.45 / Promotional Strategies --- p.46 / Channel Strategies --- p.51 / APPENDIX / Chapter A. --- PRETESTED QUESTIONNAIRE (ENGLISH & CHINESE) --- p.52 / Chapter B. --- SUMMARY OF SURVEY FINDINGS --- p.63 / EXHIBIT / Chapter I. --- NEWSPAPER ARTICLES ON CAR THEFTS IN HONG KONG --- p.104 / Chapter II. --- PRODUCT CATALOGUES OF ELECTRONIC AUTOSECURITY SYSTEMS --- p.111 / BIBLIOGRAPHY --- p.120

Typescript (photocopy). / Digitized by Kansas Correctional Industries

Thesis (Ph.D.)--University of Wollongong, 2007. / Typescript. Includes bibliographical references: p. 172-198.

Thesis (Ph. D.)--University of Texas at Austin, 2008. / Vita. Includes bibliographical references.

Thesis (Ph. D.)--Florida State University, 2006. / Advisor: Xiuwen Liu, Florida State University, College of Arts and Sciences, Dept. of Computer Science. Title and description from dissertation home page (viewed Sept. 20, 2006). Document formatted into pages; contains xi, 109 pages. Includes bibliographical references.

We have investigated, in various multiple senses, the “capacity” of several models of erasure networks. The defining characteristic of a memoryless erasure network is that each channel between any two nodes is an independent erasure channel. The models that we explore differ in the absence or presence of interference at either the transmitters, the receivers, or both; and in the availability of feedback at the transmitters. The crux of this work involves the investigation and analysis of several different performance measures for these networks: traditional information capacity (including multicast capacity and feeback capacity), secrecy capacity, and transport capacity. / text

Traditional solutions to information security in communication systems act in the application layer and are oblivious to the effects in the physical layer. Physical-layer security methods, of which information-theoretic security is a special case, try to extract security from the random effects in the physical layer. In information-theoretic security, there are two asymptotic notions of secrecy---weak and strong secrecy This dissertation investigates the problem of information-theoretic strong secrecy on the binary erasure wiretap channel (BEWC) with a specific focus on designing practical codes. The codes designed in this work are based on analysis and techniques from error-correcting codes. In particular, the dual codes of certain low-density parity-check (LDPC) codes are shown to achieve strong secrecy in a coset coding scheme. First, we analyze the asymptotic block-error rate of short-cycle-free LDPC codes when they are transmitted over a binary erasure channel (BEC) and decoded using the belief propagation (BP) decoder. Under certain conditions, we show that the asymptotic block-error rate falls according to an inverse square law in block length, which is shown to be a sufficient condition for the dual codes to achieve strong secrecy. Next, we construct large-girth LDPC codes using algorithms from graph theory and show that the asymptotic bit-error rate of these codes follow a sub-exponential decay as the block length increases, which is a sufficient condition for strong secrecy. The secrecy rates achieved by the duals of large-girth LDPC codes are shown to be an improvement over that of the duals of short-cycle-free LDPC codes.