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

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

Thesis. 1977. B.S.--Massachusetts Institute of Technology. Dept. of Interdisciplinary Science. / MICROFICHE COPY AVAILABLE IN ARCHIVES AND SCIENCE. / Includes bibliographical references. / by Mark P. Abbate. / B.S.

This thesis describes a design for a multi-computer communication system using a shared memory. The design is implemented using the Motorola EXORset 30/DS35 development systems. The primary use for the shared memory is to act as a message center similar to a mailbox, where each computer can leave messages for other computers and also pick up messages from other computers. Status word residing in shared memory, called semaphore, are used to indicate the condition of the mailbox. Each computer polls unique semaphores associated with unique message transfers when requesting to send a message or to receive a message.

Chen, Junyu. / Thesis M.Phil. Chinese University of Hong Kong 2014. / Includes bibliographical references (leaves 56-61). / Abstracts also in Chinese. / Title from PDF title page (viewed on 25, October, 2016).

Thesis (M.S.)--Rochester Institute of Technology, 2008. / Typescript. Includes bibliographical references (leaves 73-75).

South African Higher Education has gone through various changes and challenges, one of these being the merger process. Various Universities and Technikons were forced to merge in an effort to aid the transformation and restructuring of the Higher Education landscape in the post-apartheid era. From an ICT point of view, the merged Institutions ended up with massive and distributed computing facilities. These facilities must be managed and secured and it can be appreciated that the complexity and magnitude of this task is compounded by the large and varied user population (i.e. students) using the facilities. With the exploding use of mobile consumer devices (such as cell phones, personal digital assistants, MP3 players, portable storage devices such as flash drives, etc), Higher Education Institutions are faced with the even more complex task of managing and securing the computing infrastructure, while large numbers of students can enter computer labs and use these devices at random. In some circles, portable devices are touted to be the next panacea in higher education. This, together with the popularity these devices enjoy under the student body, makes it a fait accompli that mobile consumer devices are “here to stay”. Therefore, banning these devices from campus computer labs, is not viable. Universities have to find ways to address security issues through the implementation of appropriate protective measures. This research focuses on finding a solution to mitigating the risks imposed on Higher Education Institutions in South Africa caused by the use of portable storage devices. The research proposes a framework which serves as an outline for the countermeasures that Universities must implement to mitigate the risks inherent to the use of portable storage devices. The scope of the research is limited to flash drives, smart phones and MP3 players.

Call number: LD2668 .T4 1956 K31 / Master of Science

Multi-track run-length-limited (d,k) modulation codes were recently introduced as a method to increase storage densities in magnetic and optical recording systems. These codes are a generalization of the usual run-length-limited (d,k) codes and provide for increased storage density by relaxing the k-constraint and encoding multiple tracks in parallel. This dissertation focuses on methods of constructing such codes. Two methods are presented. The first uses state-splitting to construct multi-track (d,k) trellis codes. An example is presented in which a (1,3) trellis code is constructed having a code rate of R = 2/3. The second method results in the construction of multi-track (d,k) block codes which are implemented via an enumeration scheme based on the trellis description of the (d,k) constraints. This implementation results in memory requirements which increase only linearly with block length as opposed to the exponential increases arising from look-up table implementations. Additionally, a new class of multi-track codes referred to as redundant multi-track (d,k) codes, is introduced. These redundant codes, unlike the original multi-track (d,k) codes which are completely intolerant of faulty tracks, allow for r faulty tracks while maintaining synchronization.

Typescript (photocopy). / Digitized by Kansas Correctional Industries