Search

Thesis (B.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1984., MICROFICHE COPY AVAILABLE IN ARCHIVES AND ENGINEERING., Bibliography: leaves 60-61., by Patrick R. Antaki., B.S.

Thesis (B.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1984., MICROFICHE COPY AVAILABLE IN ARCHIVES AND ENGINEERING., Bibliography: leaves 60-61., by Patrick R. Antaki., B.S.

Thesis (Ph. D.)--Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2013., Cataloged from PDF version of thesis., Includes bibliographical references (pages 153-158)., On the desktop, users are accustomed to having visible handles to objects that they can organize, share, and manipulate. Web applications today feature many loosely defined classes of such objects, like flight itineraries, products for sale, people, recipes, and restaurants, but there are no interoperable handles for these high-level semantic objects. On the web, users need visible handles that can represent an evolving set of semantically rich objects. Such handles would enable a simple, direct, and consistent interface for data representation and transfer. This thesis proposes Clui, a platform for exploring a new data type, called a Webit, that provides uniform handles to objects. Users drag and drop Webits between sites to transfer data, auto-fill search forms, map associated locations, or share Webits with others. While Clui offers a developer API to add Webit support to web sites, Clui plugins allow users to use Webits immediately. Plugins create Webits by extracting semantic data from existing web pages, and they augment sites with drag and drop targets that accept and interpret Webits, all without requiring the cooperation of site developers. Contributions of this thesis include design principles, derived from experimentation, that guide the functionality and behavior of handles for web objects; a system design that provides an adoption path for such handles; and a scalable approach for realizing handles that enforce access controls. To evaluate the usability of Webits, we conducted two in-laboratory studies and collected qualitative observations and feedback. The results suggest that the system is usable and effective in improving user efficiency. While using the system, participants expressed enthusiasm and delight, and believed that Webits would be useful for their daily web activities., by Hubert Pham., Ph.D.

Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2011., Cataloged from PDF version of thesis., Includes bibliographical references (p. 67)., This thesis describes a method of merging the contents of two VMware disk images by merging the file systems therein. Thus, two initially disparate file systems are joined to appear and behave as a single file system. The problem of file system namespace unification is not a new one, with predecessors dating as far back as 1988 to present-day descendants such as UnionFS and union mounts. All deal with the same major issues - merging directory contents of source branches and handling any naming conflicts (namespace de-duplication), and allowing top-level edits of file system unions in presence of read-only source branches (copy-on-write). The previous solutions deal with exclusively with file systems themselves, and most perform the bulk of the unification logic at runtime. This project is unique in that both the sources and union are disk images that can be directly run as virtual machines. This lets us exploit various features of the VMware disk image format, eventually prompting us to move the unification logic to an entirely offline process. This decision, however, carry a variety of unique implications and side effects, which we shall also discuss in the paper., by Sarah X. Cheng., M.Eng.

Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2010., Cataloged from PDF version of thesis., Includes bibliographical references (p. 57-58)., We have designed and implemented a Goal-oriented Web application to search videos, images, and news by querying YouTube, Truveo, Google and Yahoo search services. The Planner module decomposes functionality in Goals and Techniques. Goals declare searches for specific types of content and Techniques query the various Web services. We choose which Web service has the best rating at runtime and return the winning results. Users weight their preferred Web services and declare a repository of their own Techniques to upload and execute., by Victor Lamont Williamson., M.Eng.

Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2010., Cataloged from PDF version of thesis., Includes bibliographical references (p. 57-58)., We have designed and implemented a Goal-oriented Web application to search videos, images, and news by querying YouTube, Truveo, Google and Yahoo search services. The Planner module decomposes functionality in Goals and Techniques. Goals declare searches for specific types of content and Techniques query the various Web services. We choose which Web service has the best rating at runtime and return the winning results. Users weight their preferred Web services and declare a repository of their own Techniques to upload and execute., by Victor Lamont Williamson., M.Eng.

Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2011., Cataloged from PDF version of thesis., Includes bibliographical references (p. 67)., This thesis describes a method of merging the contents of two VMware disk images by merging the file systems therein. Thus, two initially disparate file systems are joined to appear and behave as a single file system. The problem of file system namespace unification is not a new one, with predecessors dating as far back as 1988 to present-day descendants such as UnionFS and union mounts. All deal with the same major issues - merging directory contents of source branches and handling any naming conflicts (namespace de-duplication), and allowing top-level edits of file system unions in presence of read-only source branches (copy-on-write). The previous solutions deal with exclusively with file systems themselves, and most perform the bulk of the unification logic at runtime. This project is unique in that both the sources and union are disk images that can be directly run as virtual machines. This lets us exploit various features of the VMware disk image format, eventually prompting us to move the unification logic to an entirely offline process. This decision, however, carry a variety of unique implications and side effects, which we shall also discuss in the paper., by Sarah X. Cheng., M.Eng.

Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2011., Cataloged from PDF version of thesis., Includes bibliographical references (p. 67)., This thesis describes a method of merging the contents of two VMware disk images by merging the file systems therein. Thus, two initially disparate file systems are joined to appear and behave as a single file system. The problem of file system namespace unification is not a new one, with predecessors dating as far back as 1988 to present-day descendants such as UnionFS and union mounts. All deal with the same major issues - merging directory contents of source branches and handling any naming conflicts (namespace de-duplication), and allowing top-level edits of file system unions in presence of read-only source branches (copy-on-write). The previous solutions deal with exclusively with file systems themselves, and most perform the bulk of the unification logic at runtime. This project is unique in that both the sources and union are disk images that can be directly run as virtual machines. This lets us exploit various features of the VMware disk image format, eventually prompting us to move the unification logic to an entirely offline process. This decision, however, carry a variety of unique implications and side effects, which we shall also discuss in the paper., by Sarah X. Cheng., M.Eng.

Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2010., Cataloged from PDF version of thesis., Includes bibliographical references (p. 57-58)., We have designed and implemented a Goal-oriented Web application to search videos, images, and news by querying YouTube, Truveo, Google and Yahoo search services. The Planner module decomposes functionality in Goals and Techniques. Goals declare searches for specific types of content and Techniques query the various Web services. We choose which Web service has the best rating at runtime and return the winning results. Users weight their preferred Web services and declare a repository of their own Techniques to upload and execute., by Victor Lamont Williamson., M.Eng.

Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2009., Includes bibliographical references (p. 57-58)., LatticeFS is a namespace unification system designed to merge multiple source file systems into a single working file system. atticeFS can be used to merge multiple software package directories, work with multiple file systems as if they are one, and share a single storage medium among multiple machines. On a high level, LatticeFS takes as input an arbitrary number of file system paths, and mounts a new virtual drive that will appear to the user as a union of the input file systems. Of course, attempting to combine multiple file systems will inevitably be met with conflicts. Situations in which multiple input file systems contain files/directories with the same name will be common in large systems; which file/directory should the user be exposed to in this case? Previous work such as UnionFS solved the problem by giving each input file system a strict priority value, and when a conflict occurred, the file/directory with the highest priority was the one shown to the user. In LatticeFS, we have introduced a plug-in system in which different strategies for resolving conflicts can be easily swapped in and out; additionally, handlers for special file types can also be "plugged" into the system. This paper describes and evaluates all aspects of LatticeFS in detail., by Yang Su., M.Eng.

Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2009., Includes bibliographical references (p. 57-58)., LatticeFS is a namespace unification system designed to merge multiple source file systems into a single working file system. atticeFS can be used to merge multiple software package directories, work with multiple file systems as if they are one, and share a single storage medium among multiple machines. On a high level, LatticeFS takes as input an arbitrary number of file system paths, and mounts a new virtual drive that will appear to the user as a union of the input file systems. Of course, attempting to combine multiple file systems will inevitably be met with conflicts. Situations in which multiple input file systems contain files/directories with the same name will be common in large systems; which file/directory should the user be exposed to in this case? Previous work such as UnionFS solved the problem by giving each input file system a strict priority value, and when a conflict occurred, the file/directory with the highest priority was the one shown to the user. In LatticeFS, we have introduced a plug-in system in which different strategies for resolving conflicts can be easily swapped in and out; additionally, handlers for special file types can also be "plugged" into the system. This paper describes and evaluates all aspects of LatticeFS in detail., by Yang Su., M.Eng.

Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2009., Includes bibliographical references (p. 57-58)., LatticeFS is a namespace unification system designed to merge multiple source file systems into a single working file system. atticeFS can be used to merge multiple software package directories, work with multiple file systems as if they are one, and share a single storage medium among multiple machines. On a high level, LatticeFS takes as input an arbitrary number of file system paths, and mounts a new virtual drive that will appear to the user as a union of the input file systems. Of course, attempting to combine multiple file systems will inevitably be met with conflicts. Situations in which multiple input file systems contain files/directories with the same name will be common in large systems; which file/directory should the user be exposed to in this case? Previous work such as UnionFS solved the problem by giving each input file system a strict priority value, and when a conflict occurred, the file/directory with the highest priority was the one shown to the user. In LatticeFS, we have introduced a plug-in system in which different strategies for resolving conflicts can be easily swapped in and out; additionally, handlers for special file types can also be "plugged" into the system. This paper describes and evaluates all aspects of LatticeFS in detail., by Yang Su., M.Eng.

Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2009., Includes bibliographical references (p. 57-58)., LatticeFS is a namespace unification system designed to merge multiple source file systems into a single working file system. atticeFS can be used to merge multiple software package directories, work with multiple file systems as if they are one, and share a single storage medium among multiple machines. On a high level, LatticeFS takes as input an arbitrary number of file system paths, and mounts a new virtual drive that will appear to the user as a union of the input file systems. Of course, attempting to combine multiple file systems will inevitably be met with conflicts. Situations in which multiple input file systems contain files/directories with the same name will be common in large systems; which file/directory should the user be exposed to in this case? Previous work such as UnionFS solved the problem by giving each input file system a strict priority value, and when a conflict occurred, the file/directory with the highest priority was the one shown to the user. In LatticeFS, we have introduced a plug-in system in which different strategies for resolving conflicts can be easily swapped in and out; additionally, handlers for special file types can also be "plugged" into the system. This paper describes and evaluates all aspects of LatticeFS in detail., by Yang Su., M.Eng.

Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1988., Characters with an underscore appear as italic on the t.p., Bibliography: leaves 94-95., by Andrew Edward Ayers., M.S.

Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2008., Includes bibliographical references (p. 87)., In this thesis, I developed an API to control a MythTV backend. This API is called PyMythTV. It allows one to develop software that can take advantage of a PVR device, MythTV. The API was written in Python, which allows for an easy integration of the device into the JustPlay network. With this service in place, people can easily search and schedule recordings while on the network. I also developed a program to demonstrate the functionality of the API and how it could be used. I also wrote documentation describing the API. A developer could easily use this simple and flexible API to control a MythTV back-end to fulfill his needs., by Christian Deonier., M.Eng.

Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2008., Includes bibliographical references (p. 87)., In this thesis, I developed an API to control a MythTV backend. This API is called PyMythTV. It allows one to develop software that can take advantage of a PVR device, MythTV. The API was written in Python, which allows for an easy integration of the device into the JustPlay network. With this service in place, people can easily search and schedule recordings while on the network. I also developed a program to demonstrate the functionality of the API and how it could be used. I also wrote documentation describing the API. A developer could easily use this simple and flexible API to control a MythTV back-end to fulfill his needs., by Christian Deonier., M.Eng.

Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2008., Includes bibliographical references (p. 87)., In this thesis, I developed an API to control a MythTV backend. This API is called PyMythTV. It allows one to develop software that can take advantage of a PVR device, MythTV. The API was written in Python, which allows for an easy integration of the device into the JustPlay network. With this service in place, people can easily search and schedule recordings while on the network. I also developed a program to demonstrate the functionality of the API and how it could be used. I also wrote documentation describing the API. A developer could easily use this simple and flexible API to control a MythTV back-end to fulfill his needs., by Christian Deonier., M.Eng.

Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1988., Characters with an underscore appear as italic on the t.p., Bibliography: leaves 94-95., by Andrew Edward Ayers., M.S.

Thesis. 1978. M.S.--Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science., MICROFICHE COPY AVAILABLE IN ARCHIVES AND ENGINEERING., Bibliography: p. 110-111., by Rowland Frank Archer, Jr., M.S.

Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1994., Includes bibliographical references (leaves 66-68)., by Milan Singh Minsky., M.S.

Thesis. 1978. M.S.--Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science., MICROFICHE COPY AVAILABLE IN ARCHIVES AND ENGINEERING., Bibliography: p. 110-111., by Rowland Frank Archer, Jr., M.S.

Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1994., Includes bibliographical references (leaves 66-68)., by Milan Singh Minsky., M.S.

Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1983., MICROFICHE COPY AVAILABLE IN ARCHIVES AND ENGINEERING, Includes bibliographical references., by Hubert Rae McLellan, Jr., M.S.

Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1994., Includes bibliographical references (leaves 66-68)., by Milan Singh Minsky., M.S.

Thesis. 1978. M.S.--Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science., MICROFICHE COPY AVAILABLE IN ARCHIVES AND ENGINEERING., Bibliography: p. 110-111., by Rowland Frank Archer, Jr., M.S.

Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1994., Includes bibliographical references (leaves 66-68)., by Milan Singh Minsky., M.S.

Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1983., MICROFICHE COPY AVAILABLE IN ARCHIVES AND ENGINEERING, Includes bibliographical references., by Hubert Rae McLellan, Jr., M.S.

Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1983., MICROFICHE COPY AVAILABLE IN ARCHIVES AND ENGINEERING, Includes bibliographical references., by Hubert Rae McLellan, Jr., M.S.

Thesis. 1978. M.S.--Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science., MICROFICHE COPY AVAILABLE IN ARCHIVES AND ENGINEERING., Bibliography: p. 110-111., by Rowland Frank Archer, Jr., M.S.

Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1994., Includes bibliographical references (p. 121-123)., This architecture study provides the ground work for implementing a new generation of Byzantine resilient processors using authentication. The use of authentication allows a significant reduction in the theoretical requirements necessary for providing Byzantine resilience, or the ability to continue correct operation in the presence of arbitrary or even malicious faults. This decrease in requirements led to a goal of providing a system which combines the stringent standards embodied by Byzantine resilience with the lower costs necessary to make the system viable for more markets than previous Byzantine resilient processors. A layering scheme is proposed which can be placed between the user and hardware. These layers consist of protocols which provide the basic building blocks of the architecture. The proposed authentication protocol which provides the digital signatures used to verify the origin and contents of messages is a public-key protocol using 32-bit Cyclic Redundancy Codes (CRC's) to encode the message with 32-bit modular inverse key pairs to sign and authenticate the CRC. An interactive consistency protocol responsible for correctly distributing single-source data between processors is built using the SM(m) algorithm from [LSP82] with improvements suggested in [Dol83]. A voting protocol responsible for generating a group consensus value guaranteed to be the same on all nonfaulty processors suggests exchanging unsigned messages and then using a full-set majority vote choice() function to calculate the group consensus value. Finally, the proposed synchronization protocol needed to provide synchronized virtual clocks on all nonfaulty processors is placed on top of a full message exchange (FME) known as a From_all exchange to read the clocks on other processors. A time adjustment is then calculated using a technique suggested in [LM84]., by Anne L. Clark., M.S.

Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1994., Includes bibliographical references (leaves 71-72)., by Jason Steven Cornez., M.Eng.

Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1994., Includes bibliographical references (leaves 71-72)., by Jason Steven Cornez., M.Eng.

Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2005., Includes bibliographical references (p. 79-81)., This thesis presents a new architectural abstraction for developing dynamic and adaptive software. Separating application logic from implementation mechanism provides developers with a simple API for constructing new application functionality by connecting together a set of generic, distributed software modules. Developers codify adaptive application structure and logic in a simple, synchronous environment, and use the API to control and monitor the resulting implementation of highly parallel and asynchronous module networks. The design and implementation for this architectural abstraction is embodied in the Resources framework, a language- and platform independent software component platform geared for pervasive computing application development., by Hubert Pham., M.Eng.

Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1994., Includes bibliographical references (p. 121-123)., This architecture study provides the ground work for implementing a new generation of Byzantine resilient processors using authentication. The use of authentication allows a significant reduction in the theoretical requirements necessary for providing Byzantine resilience, or the ability to continue correct operation in the presence of arbitrary or even malicious faults. This decrease in requirements led to a goal of providing a system which combines the stringent standards embodied by Byzantine resilience with the lower costs necessary to make the system viable for more markets than previous Byzantine resilient processors. A layering scheme is proposed which can be placed between the user and hardware. These layers consist of protocols which provide the basic building blocks of the architecture. The proposed authentication protocol which provides the digital signatures used to verify the origin and contents of messages is a public-key protocol using 32-bit Cyclic Redundancy Codes (CRC's) to encode the message with 32-bit modular inverse key pairs to sign and authenticate the CRC. An interactive consistency protocol responsible for correctly distributing single-source data between processors is built using the SM(m) algorithm from [LSP82] with improvements suggested in [Dol83]. A voting protocol responsible for generating a group consensus value guaranteed to be the same on all nonfaulty processors suggests exchanging unsigned messages and then using a full-set majority vote choice() function to calculate the group consensus value. Finally, the proposed synchronization protocol needed to provide synchronized virtual clocks on all nonfaulty processors is placed on top of a full message exchange (FME) known as a From_all exchange to read the clocks on other processors. A time adjustment is then calculated using a technique suggested in [LM84]., by Anne L. Clark., M.S.

Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1994., Includes bibliographical references (leaves 71-72)., by Jason Steven Cornez., M.Eng.

Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1987., Includes bibliographical references., Supported by the Defense Advanced Research Projects Agency of the Department of Defense, monitored by the Office of Naval Research. N00014-83-K-0125, by Robert W. Baldwin., Ph.D.

Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1984., MICROFICHE COPY AVAILABLE IN ARCHIVES AND ENGINEERING., Bibliography: leaf 88., by Michael Stephen Pasieka., M.S.

Thesis (B.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1986., MICROFICHE COPY AVAILABLE IN ARCHIVES AND ENGINEERING, Bibliography: leaves 36-39., by Brian Y.G. Byun., B.S.

Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1984., MICROFICHE COPY AVAILABLE IN ARCHIVES AND ENGINEERING., Bibliography: leaf 88., by Michael Stephen Pasieka., M.S.

Thesis. 1977. M.S.--Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science., MICROFICHE COPY AVAILABLE IN ARCHIVES AND ENGINEERING., Bibliography : leaf 83., M.S.

Thesis (B.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1982., MICROFICHE COPY AVAILABLE IN ARCHIVES AND ENGINEERING, by Joseph Jay Kesselman Jr., B.S.

Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1987., Includes bibliographical references., Supported by the Defense Advanced Research Projects Agency of the Department of Defense, monitored by the Office of Naval Research. N00014-83-K-0125, by Robert W. Baldwin., Ph.D.

Thesis (Ph.D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1979., MICROFICHE COPY AVAILABLE IN ARCHIVES AND ENGINEERING., Bibliography: p. 212-214., by Robert Hunter Halstead, Jr., Ph.D.

Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1983., MICROFICHE COPY AVAILABLE IN ARCHIVES AND ENGINEERING, Bibliography: leaves 155-158., by Christopher Jay Terman., Ph.D.

Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1989., Includes bibliographical references (leaves 101-102)., by Joseph Derek Morrison., M.S.

Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1984., MICROFICHE COPY AVAILABLE IN ARCHIVES AND ENGINEERING., Bibliography: leaf 88., by Michael Stephen Pasieka., M.S.

Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1992., Includes bibliographical references (leaves 58-60)., by Rajeev Dujari., M.S.

Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1986., MICROFICHE COPY AVAILABLE IN ARCHIVES AND ENGINEERING, Bibliography: leaf 97., by David C. Douglas., M.S.

Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1987., Includes bibliographical references., Supported by the Defense Advanced Research Projects Agency of the Department of Defense, monitored by the Office of Naval Research. N00014-83-K-0125, by Robert W. Baldwin., Ph.D.

Thesis (Ph.D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1979., MICROFICHE COPY AVAILABLE IN ARCHIVES AND ENGINEERING., Bibliography: p. 212-214., by Robert Hunter Halstead, Jr., Ph.D.