Back in May of 1990, Windows was brought into the arena of viable operating environment due to the significant improvements Windows 3.0 made over its predecessor, Windows 2.11. Windows 3.1, another significant upgrade, was released in May, 1992. As the popularity of Windows has soared, the number of applications developed specifically for Windows has also sky-rocketed. This has translated into a huge demand for Windows programmers.Writing Windows code, however, is never an easy task. In fact, Windows has the reputation of being easy for users but hard for programmers. The difficulties in learning to program in Windows plus the increasing number of beginning Windows programmers lead to an urgent need to provide a solution to the problem: How to ease the learning curve of Windows programming?This is thus the theme of the thesis: building a comprehensive on-line Windows programming tutorial that helps ease the daunting learning curve. Through the use of interesting illustrations, example programs with on-line explanations, this tutorial makes Windows programming easier and more fun to learn. / Department of Computer Science

In this thesis we will describe the development of software functions that render graphical and textual information of G-Net(A software system for graph theory & algorithms) onto various raster output devices.Graphs are mathematical structures that are used to model very diverse systems such as networks, VLSI design, chemical compounds and many other systems where relations between objects play an important role. The study of graph theory problems requires many manipulative techniques. A software system (such as G-Net) that can automate these techniques will be a very good aid to graph theorists and professionals. The project G-Net, headed by Prof. Kunwarjit S. Bagga of the computer science department has the goal of developing a software system having three main functions. These are: learning basics of graph theory, drawing/manipulating graphs and executing graph algorithms.The thesis will begin with an introduction to graph theory followed by a brief description of the evolution of the G-Net system and its current status. To print on various printers, the G-Net system translates all the printable information into PostScript' files. A major part of this thesis concentrates on this translation. To begin with, the necessity of a standard format for the printable information is discussed. The choice of PostScript as a standard is then justified. Next,the design issues of translator and the translation algorithm are discussed in detail. The translation process for each category of printable information is explained. Issues of printing these PostScript files onto different printers are dealt with at the end. / Department of Computer Science

The purpose of this thesis is to develop a software system simulating Turing machines using a Microsoft Windows' Interface.Developed in the 1930's by Alan Turing and Emil Post, Turing machines are defined as "abstract computers" . These machines seem able to solve all problems a modern computer can solve, however complex the problems may be. A Turing machine is a basic computational model for algorithms.The software provides a practical tool to students with a relative notion of Turing machines. The software contains introduction and general information on Turing machines that gives the beginner enough background to use the program. The user can create, modify or run Turing machines saved onto MS-DOS files. Some examples of Turing machines are preloaded. These examples give more help to the beginner.An on-line help facility is provided in order to direct and inform the learning student at each level of the software.The Microsoft Windows' Interface makes the software easy and friendly to use. The software has the modularity which will ease any future enhancement. / Department of Computer Science

My thesis is to design a Controlled Area Network (CAN) simulator For Microsoft Windows. In a modern world we deal with complex mechanical systems that require special electronic control to guarantee ultimate safety and efficiency. These electronic control systems are responsible for monitoring subsystems within the mechanical systems. A good example of this is the motor vehicles that are being driven on the road today. These vehicles have been designed with increased safety and efficiency, such as electronic controlled anti lock breaks, fuel injection, and power control steering. To run all of these components, the car needs a very well designed protocol to be able to control series of messages being passed from one subsystem to another. To determine which message being passed has higher priority than any other messages. To deal with such circumstances, the Controlled Area Network (CAN) was designed. The purpose of the CAN simulator is to gather statistical information concerning the arbitration, message transfer, error detection, error signaling, and retransmision. The CAN simulating model will consist of one to sixty nodes. Each node is considered as a subsystem for the CAN simulator. The subsystems will be characterized as the breaks, engine, transmission, or any part of a car which needs to be connected to the CAN system. Each node will send one to ten messages through the CAN system. The CAN system will take the messages from the nodes and place them into an Arrival queue. Each node will have its own Arrival queue, and no nodes can have two messages on the bus at the same time. The messages will be sorted in the queues in the order of the time needed to be released onto the bus. There will be an internal clock that will monitor the time for when the messages are needed to be placed onto the bus. If there is a situation where two messages need to be sent at the same time, the arbitrator will determine the priority of the messages to be placed onto the bus. Once the message is on the bus, it will go to a transfer queue. Periodically, there will be an error signal sent with the message that will be detected by the error detection, and it will be required that the message to be retransmitted. At critical points on the simulation, statistical information will be gathered for an analyzation. Some examples of information to be analyzed are 1) verification of the simulation performance on a single node with a single message, 2) network load which is a rate of a utilized bus time to the total bus time, 3) network throughput which is a total number of messages that are transmitted per second, and 4) average response time which will be the average time taken by all messages to gain bus access.PLATFORM DESCRIPTIONThe computer to be used in this project will be an Intel Pentum 100 with 16 megs RAM, two 853 megabyte harddrive, and a 17 inch super VGA monitor. The user interface will be windows 3.1 application. The compiling language to be used will be Microsoft Visual C++. / Department of Computer Science

The hypercube is one of the most versatile and efficient networks yet discovered for parallel computation. It is well suited for both special-purpose and general-purpose tasks, and it can efficiently simulate many other networks of the same size. The size of subgraphs can be used to estimate the efficient communications of hypercube computer systems.The thesis investigates induced subgraphs of a hypercube, discusses sizes of subgraphs, and provides a formula to give bounds on the size of any subgraph of the hypercube.The concept of spanning graphs and line graphs is useful for studying properties of graphs. An MS WINDOWS based graphical system is developed which allows the creation and display of graphs and their spanning graphs, line graphs and super line graphs. / Department of Computer Science

Thesis (Ph. D.)--University of Hawaii at Manoa, 1994. / Includes bibliographical references (leaves 350-354). / Microfiche. / xx, 354 leaves, bound ill. 29 cm

Thesis (MAppSc (Research)) -- University of South Australia, 1991

Thesis (M.C.S.) - Carleton University, 2006. / Includes bibliographical references (p. 107-111). Also available in electronic format on the Internet.

Thesis (M.S.)--State University of New York at Binghamton, Department of Systems Science and Industrial Engineering, 2005. / Includes bibliographical references.

M.Sc. (Informatics) / Please refer to full text to view abstract