Computational Engineering Commons^™

Observation Of Inclusive B Decays To The Charmed Baryons C++ And C0, Procario, M.; Te Al., M. Thulasidas

Research Collection School Of Computing and Information Systems

No abstract provided.

Cyclo-Static Scheduling Of Large Grain Dataflow Algorithms On A Local Area Atamm Multicomputing Testbed, Sudeepto Roy

Electrical & Computer Engineering Theses & Dissertations

A strategy for cyclo-statically scheduling deterministic large grain dataflow (LGDF) algorithms for distributed execution on loosely coupled multicomputer architectures is presented in this research. The computational paradigm used is the ODU/NASA developed Algorithm To Architecture Mapping Model (ATAMM), which consists of marked graphs and Gantt chart representations that model the iterative execution of deterministic LGDF algorithms for different values of throughput and computation time. It is postulated that the behavior of these algorithms could be represented by the aggregate execution of an ensemble of cyclically shifted threads of a specific node sequence. Assuming the existence of one or more such …

Encoding Phonetic Knowledge For Use In Hidden Markov Models Of Speech Recognition, Danming Qian

Electrical & Computer Engineering Theses & Dissertations

Hidden Markov models (HMM's) have achieved considerable success for isolated-word speaker-independent automatic speech recognition. However, the performance of an HMM algorithm is limited by its inability to discriminate between similar sounding words. The problem arises because all differences between speech patterns are treated as equally important. Thus the algorithm is particularly susceptible to confusions caused by phonetically-irrelevant differences. This thesis presents two types of preprocessing schemes as candidates for improving HMM performance. The aim is to maximize the differences between phonologically-distinct speech sounds while minimizing the effect of variations in phonologically-equivalent speech sounds. The preprocessors presented are a discrete cosine …

Speech Spectral Modeling And Speech Synthesis Using Finite Impulse Response Digital Filters, Paul Edward Gordy

Computational Modeling & Simulation Engineering Theses & Dissertations

Synthetic speech can be produced using a discrete-time model of human speech production. This model depends on the use of digital filters to model the spectral characteristics of the vocal tract. Speech spectra can be efficiently encoded using a set of principal components basis vectors; however, these vectors are not in a convenient mathematical form for directly determining a digital filter for the speech production model. If discrete cosine basis vectors are used to approximate the principal components basis vectors, then the cosine basis vector coefficients can be used to determine a Finite Impulse Response(FIR) digital filter for speech spectral …

Comparison Of Steady-State Pipe Network Computer Programs, Michael Bernice Holloway

Civil & Environmental Engineering Theses & Dissertations

Four widely used computer programs for the analysis of steady state flows in pipe networks are compared. These programs are NEWTH, written by Jeppson; KENTUCKY, written by Wood; FLOW, written by Epp and Fowler; and LIQSS, written by Stoner. Differences, similarities, advantages and disadvantages of these programs, and various options available are discussed for the benefit of possible future users. In addition, the efficiency of NEWTH, KENTUCKY, and FLOW was tested by simulating a typical network by each program. The listing of LIQSS was not available, and thus was not included in this comparison. In simulation, KENTUCKY used over twice …

A Dimensionality Reduction Algorithm For The Karhunen Loeve Transform, Salomi T. Charalambous

Computational Modeling & Simulation Engineering Theses & Dissertations

The Karhunen Loeve Transform has conclusively been shown to be the optimum data compression algorithm for signals belonging to the same second order stationary process. Consequently, researchers have been searching for a fast implementation for the transform. Fast imple­mentation methods similar to those developed for other orthogonal transforms are generally not applicable to the Karhunen Loeve Transform (KLT). Also, since the basis vectors composing the transformation matrix of the KLT are the eigenvectors of the covariance matrix of the input process, they must be computed first. The research re­ ported here is an attempt to reduce the dimensionality of the …

An Efficient Dft Algorithm Using The Walsh Transform, Albert P. Gerheim

Electrical & Computer Engineering Theses & Dissertations

The matrix transformation relating the sequency and frequency domains is derived. It is shown that these­ frequency-to-frequency conversion can be performed via a computationally efficient sparse matrix algorithm. The sequency-to-frequency algorithm can be used with a fast Hadamard transform to implement a discrete Fourier trans­ form. The efficiencies of this combined algorithm and a radix-two fast Fourier transform are compared.

The algorithm is applied to the sequency domain de­ sign of a Wiener digital filter. Improved computational efficiencies are achieved relative to the procedure de­veloped by Kahveci and Hall (9).