Search Results (1 - 10 of 10 Results)

Sort By  
Sort Dir
 
Results per page  

Hochstettler, William HenryA model for supporting multiple software engineering methods in a software environment /
Doctor of Philosophy, The Ohio State University, 1986, Graduate School

Committee:

Not Provided (Other)

Subjects:

Computer Science

Keywords:

Computer programming;Computer software

Bihari, Thomas EdwardAdapting real-time software for reliable performance /
Doctor of Philosophy, The Ohio State University, 1987, Graduate School

Committee:

Not Provided (Other)

Subjects:

Computer Science

Keywords:

Computer software;Real-time data processing

Herrmann, William J.Creating a Fun Program that is Simple and Easy to Use
Bachelor of Arts, Wittenberg University, 2012, Computer Science
I have created a program to assist in making characters for the Savage Worlds tabletop role-playing game published by Pinnacle Entertainment Group. This pro- gram was written in Java and uses a SQLite database to store character options. Principles of user-centered design were followed to make the program intuitive and easy to use and feedback from potential users was gathered. Programming design patterns were used to make it easier for me to implement and maintain the program. Ultimately, this program has been a culmination of my learning here at Wittenberg University and has been an opportunity for me to independently expand my knowledge of Computer Science.

Committee:

Steven Bogaerts, Dr. (Advisor); Kyle Burke, Dr. (Committee Member); Stephanie Little, Dr. (Committee Member)

Subjects:

Computer Science

Keywords:

computer software; software design

McKnight, Walter LeeA meta system for generating software engineering environments /
Doctor of Philosophy, The Ohio State University, 1985, Graduate School

Committee:

Not Provided (Other)

Subjects:

Computer Science

Keywords:

Electronic digital computers;Computer software;Integrated circuits

Afifi, Faten HelmyDetecting errors in nonlinear functions for computer software
Doctor of Philosophy, Case Western Reserve University, 1992, Computer Engineering
In this research a new approach is proposed to select test data for testing nonlinear functions in computer programs, with only a small additional cost and effort beyond that required for linear functions. This approach is applied to a function used for control flow, such as a predicate inequality or equality constraint, as well as to a function given as an input-output relationship. In this approach, we will obtain test data to detect linear errors in the given nonlinear function. An error-space criterion previously given by Zeil will be utilized. A necessary and sufficient condition for the test data will be specified to guarantee the satisfaction of this criterion. This leads to a simple, practical and efficient method to select test data which satisfies that condition. The advantage of this approach is that the number of test points is about the same as required for comparable linear functions and these test points are very effective in detecting nonlinear errors as well. Our approach shows that, no more than (n + 2) test points are required for the criterion to be satisfied, where n is the number of input variables. A simple extension will be proposed, for the equality case, to detect any error in the nonlinear function; the number of test points required is (n + m + 1), where m is the number of nonlinear terms. The condition that these test points must satisfy will be given. An analysis will also be given to show that the test points chosen according to this simple approach is a very effective subset of a set of test points that can be used to detect any error that could occur in nonlinear functions

Committee:

Lee White (Advisor)

Subjects:

Computer Science

Keywords:

Computer software; Nonlinear functions errors

Kiper, James DennisThe ergonomic, efficient, and economic integration of existing tools into a software environment /
Doctor of Philosophy, The Ohio State University, 1985, Graduate School

Committee:

Not Provided (Other)

Subjects:

Computer Science

Keywords:

Electronic digital computers;Computer software

Qian, WenchaoEnergy-efficient Spatio-temporal Computing Framework
Doctor of Philosophy, Case Western Reserve University, 2016, EECS - Computer Engineering
Digital system design incorporates components ranging from general purpose processors (GPPs) to application specific integrated circuits (ASICs). GPPs provide flexible implementation of diverse applications at the cost of high execution time, energy and area. On the other hand, ASICs provide high performance, low energy and area, but they are usually custom designed for one or two specific applications. Reconfigurable computing frameworks are the solutions in between. They can take advantages from both GPPs and ASICs. Field programmable gate arrays (FPGAs) have emerged as attractive reconfigurable computing frameworks. They have the flexibility to map a variety of applications with fast speed, low energy and area. FPGAs integrate spatially distributed memory arrays and programmable routing resources. Functions are realized inside the memory blocks as lookup tables (LUTs) and the interconnects take care of the communication between different memory blocks. However, the energy and area are dominated by the programmable interconnects. With newer technology generations, these interconnects are not scaling as well as logic gates. Therefore, a reconfigurable framework that minimizes the requirements of programmable interconnects is expected to improve performance, energy and area while technology continues advancing. This work proposes a novel reconfigurable computing framework for hardware acceleration, referred to as MAlleable Hardware Accelerator (MAHA). It uses a spatio-temporal computing model which aims at improving energy-efficiency of various algorithmic tasks. In each processing element (PE), the main computing is done by a memory block, which stores both data and LUTs. PEs are spatially distributed and communicate with each other through interconnects. The operation execution inside each PE is performed cycle by cycle in a temporal fashion. It significantly reduces the requirement of programmable interconnects compared to a fully spatial reconfigurable computing architecture, and hence it improves energy-efficiency. The scalability of such a framework is expected to be better than the fully spatial architectures because it drastically reduces the need for the programmable interconnect. Data can be read and executed locally inside each PE. Such a memory-centric computing platform provides a great opportunity to mitigate the off-chip bandwidth requirement between memory and computing engines in a conventional computing architecture.

Committee:

Swarup Bhunia (Advisor); Francis Merat (Committee Member); Huang Ming-Chun (Committee Member); Feng Philip (Committee Member)

Subjects:

Computer Engineering

Keywords:

Reconfigurable Computing; FPGA; Computer Architecture; Computer Hardware; Computer Software

Shubra, Charles JohnThe identification of semantics for the file/database problem domain and their use in a template-based software environment /
Doctor of Philosophy, The Ohio State University, 1984, Graduate School

Committee:

Not Provided (Other)

Subjects:

Computer Science

Keywords:

Computer software--Development;Software maintenance;File organization ;Database management

Fung, Casey Kin-CheeA methodology for the collection and evaluation of software error data /
Doctor of Philosophy, The Ohio State University, 1985, Graduate School

Committee:

Not Provided (Other)

Subjects:

Computer Science

Keywords:

Computer software

Li, Chin-HsiangExtensions to the attribute grammar form model to model meta software engineering environments /
Doctor of Philosophy, The Ohio State University, 1985, Graduate School

Committee:

Not Provided (Other)

Subjects:

Computer Science

Keywords:

Electronic digital computers;Computer software