No description available.

No description available.

No description available.

No description available.

No description available.

Electronic solid state circuitry controlled by an SDK-85 microcomputer forms the basis of a digitally controlled Fourier synthesizer module. The hardware involved in this module is the major thrust of this particular research work. Ultimately, once properly machine programmed, the microcomputer will control the base frequency, the number of harmonics present in the output waveshape, and the relative amplitudes and phases of these harmonics.The first phase of the hardware interface entails the conversion of square waves (from 8253 timers via the microcomputer) to triangle waveforms (via LM741 integrators). The triangle waves are then sine shaped by special clipping circuitry. It is the resultant sine waves that are then digitally controlled by machine software. The first stage of the above process eliminates the problem of frequency dependence and gain dropoff of the LM741 operational amplifiers. The relative amplitude of the triangle wave output of the LM741 is compensated for such that the sine shaping circuitry receives a constant amplitude waveform. The second phase of the hardware interface uses digital control of the final sine waveform by means of a Voltage Controlled Amplifier (VCA) and a Digital to Analog Converter (DAC). The VCA acts as the actual interface between the computer and the module.Finally, the output of the VCA'a are mixed and sent through an audio amplifier or to an oscilloscope for user inspection.

Nucleic Acid Sequence Based Amplification (NASBA) is a powerful in vitro technique for amplification. NASBA is routinely used in many fields of microbiology, including food microbiology, and most recently in the identification of forensic body secretions (saliva, tears, sweat, semen, vaginal secretions). NASBA has many advantages over the traditional Reverse Transcriptase Polymerase Chain Reaction (RT-PCR) including speed, high sample throughput and increased sensitivity. Proper selection of the sequence of importance and the designe of NASBA primers precisely for that sequence are the two most critical steps for any NASBA assay. Proper designe of NASBA primers includes important considerations such as product (amplicon) length, the addition of a T7 RNA polymerase promoter sequence at the 5’end of one primer, and a 3’AT rich region. Primer designing is, therefore, laborious and error-prone. Currently, no such software is available that facilitates primer designing for NASBA. In this study Java-based software for designing NASBA primers was developed which will enable rapid and specific NASBA primer designing for gene expression studies. The designed program focused on scripting minimum Java coding lines to reduce the time and storage space. Two codes were scripted for this software, a pseudo-code (for Java Program Developers) and Byte-code (for Windows operating system). Our results showed that Java is an efficient tool in searching sequences of interest within a gene (or mRNA), allowing for NASBA primers to be designed more quickly and effortlessly. The program has maximum memory storage capacity and allows the users to retrieve old data with reference to date or time. To test the practicality of the newly developed program, gene sequences of salivary mucin and amylase were examined to facilitate extraction of novel RNA tandem repeat element NASBA markers for human saliva forensic identification. Tandem repeats of non-coding portion with in the of human genome are highly polymorphic and considered best for forensic use. Currently, only 13 Short Tandem Repeat (STR) markers are available for forensic case work, which are not enough to establish a definitive link between the victim and suspects. Identification and validation of a new human body fluid tandem repeat markers is cruicial for achieving high through put results and to exonerate the innocent. / Access to thesis permanently restricted to Ball State community only / Department of Biology

The basic building blockss of all graphical output are primitives such as polyline, polymarker, text, cell array and fill area. These primitives have additional data associated with them to render visual effect on the display surface of a workstation. I have explored and analyzed these primitives and implemented them by routines written in C language for IBM and IBM Compatible Personal Computers. Some of the algoriths for these routines were integrated and implemented in the Extensible Graphics Software(EGS). EGS is a prototype graphics system developed by the faculty and students of Ball State University to study and research graphics systems.I have created a font for English alphabets and digit characters. The font and any algorithms created in this thesis would be included and implemented for further development of EGS.An effective attempt is made in this thesis to show how a graphics system could be developed with a minimal dependency on hardware of computers. / Department of Computer Science

We say a program is data-independent with respect to a data type X if the operations it can perform on values of type X are restricted to just equality testing, although the system may also input, store and move around (via assignment) values of type X within its variables. This property can be exploited to give procedures for the automatic verification, called model checking, of such programs independently of the instance for the type X. This thesis considers data-independent programs with arrays, which are useful for modelling memory systems such as cache protocols. The main question of interest is the following parameterised model-checking problem: whether a program satisfies its specification for all non-empty finite instances of its types. In order to obtain these results, we present a UNITY-like programming language with arrays that is suited to the study of decidability of various modelchecking problems, whilst being useful for prototyping memory systems such as caches. Its semantics are given in terms of transition systems, and we use the modal μ-calculus, a branching-time temporal logic with recursion, as our specification language. We describe a model-checking procedure for programs that use arrays indexed by one data-independent type X and storing values from another Y. This allows us to prove properties about parameterised systems: for example, that memory systems can be verified independently of memory size and data values. This decidability result is shown to extend to data-independent programs with many types and multidimensional arrays which are acyclic, meaning it is not possible to form loops of types in the 'indexed by' relation. Conversely, it is shown that even reachability model-checking problems are undecidable for classes of programs that allow cyclic-array programs. We give practical motivation for these decidability results by demonstrating how one could verify a fault-tolerant interface on a set of unreliable memories, and the cache protocol in the Pentium Pro processor. Significantly, the verifications are performed independently of many of these systems' parameters. These case studies suggest two extensions to the language: an array reset instruction, which sets every element of an array to a particular value, and an array assignment or copy instruction. Both are shown to restrict decidability of model checking problems; however we can obtain some interesting decidability results for arrays with reset by restricting the number of arrays to just one, or by allowing the arrays only to store fixed finite types, such as the booleans.

No description available.