Computer Engineering Commons^™

Ceg 220-01: Introduction To C Programming For Engineers, Robert Helt

Computer Science & Engineering Syllabi

This course provides a general introduction to computers as a problem-solving tool using the C programming language. Emphasis is on algorithms and techniques useful to engineers. Topics include data representation, debugging, and program verification. 4 credit hours. Prerequisite: Mm 229 (Calculus I).

Ceg 460/660-01: Introduction To Software Computer Engineering, John A. Reisner

Computer Science & Engineering Syllabi

This course introduces established practices for engineering large-scale software systems. Emphasis is placed on both the technical and managerial aspects of software engineering, and the software development process. This includes techniques for requirements elicitation, analysis, design, testing, and project management. The course emphasizes object-oriented development with the Unified Modeling Language (UML). Hands-on experience is provided through individual homework problems and a group project.

Cs 701: Database Systems And Design I, Guozhu Dong

Computer Science & Engineering Syllabi

An introduction to database design, database system implementation issues and techniques, and advanced data models.

Mobility-Pattern Based Localization Update Algorithm For Mobile Wireless Sensor Networks, Mohammad Yacoub Al-Laho

Electrical & Computer Engineering Theses & Dissertations

In mobile wireless sensor networks, sensors move in the monitored area at any direction and speed. Unlike many other networking hosts, sensor nodes do not have global addresses. They are often identified by using a location-based addressing scheme. Therefore, it is important to have the knowledge of the sensor location indicating where the data came from. In this thesis, three localization update algorithms were designed, Specifically, a sensor movement is divided into three states: Pause, Linear, and Random. Each state adopts different localization update algorithm. Since complex movement involves different mobility patterns, a state transition model is developed to …

A Feature Specific Modular Approach For Pose And Illumination Invariant Face Recognition, Praveen Sankaran

Electrical & Computer Engineering Theses & Dissertations

A feature specific modular-PCA (Principal Component Analysis) approach on face images in multiple views for pose and illumination invariant face recognition is presented in this thesis. Principal components are extracted from different sub-modules of the image and are concatenated to make a single signature vector to represent a face region in a particular viewing angle. Additional principal components are extracted horn image regions representing key facial feature and are added as an extension of the signature vector. Feature specific modular-PCA approach is capable of recognizing faces in varying illumination conditions and facial expressions as the modular components represent the local …

Opal: In Vivo Based Preservation Framework For Locating Lost Web Pages, Terry L. Harrison

Computer Science Theses & Dissertations

We present Opal, a framework for interactively locating missing web pages (http status code 404). Opal is an example of "in vivo" preservation: harnessing the collective behavior of web archives, commercial search engines, and research projects for the purpose of preservation. Opal servers learn from their experiences and are able to share their knowledge with other Opal servers using the Open Archives Initiative Protocol for Metadata Harvesting (OAI-PMH). Using cached copies that can be found on the web, Opal creates lexical signatures which are then used to search for similar versions of the web page. Using the OAI-PMH to facilitate …

Time-Domain Isolated Phoneme Classification Using Reconstructed Phase Spaces, Michael T. Johnson, Richard J. Povinelli, Andrew C. Lindgren, Jinjin Ye, Xiaolin Liu, Kevin M Indrebo

Electrical and Computer Engineering Faculty Research and Publications

This paper introduces a novel time-domain approach to modeling and classifying speech phoneme waveforms. The approach is based on statistical models of reconstructed phase spaces, which offer significant theoretical benefits as representations that are known to be topologically equivalent to the state dynamics of the underlying production system. The lag and dimension parameters of the reconstruction process for speech are examined in detail, comparing common estimation heuristics for these parameters with corresponding maximum likelihood recognition accuracy over the TIMIT data set. Overall accuracies are compared with a Mel-frequency cepstral baseline system across five different phonetic classes within TIMIT, and a …

A Conceptual Framework For Analysis Of System Safety Interoperability Of United States Navy's Combat Systems, Showkat Shanaz Alborzi

Engineering Management & Systems Engineering Theses & Dissertations

Today's political and military reality requires the optimal use of our legacy systems. The objective is to maximize the effectiveness of our operations by efficient allocation, placement and the use of our forces and war-fighting systems. The synergism drawn from the capabilities of the legacy complex systems enables today's war-fighting needs to be met without substantial increase in cost or resources. This synergism can be realized by the effective integration and interoperation of legacy systems into a larger, more complex system of systems.

However, the independently developed legacy systems in this new tactical environment often have different data types, languages, …

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 21, Number 9, June 2005, College Of Engineering And Computer Science, Wright State University

BITs and PCs Newsletter

A ten page newsletter created by the Wright State University College of Engineering and Computer Science that addresses the current affairs of the college.

Towards Combining Probabilistic And Interval Uncertainty In Engineering Calculations: Algorithms For Computing Statistics Under Interval Uncertainty, And Their Computational Complexity, Vladik Kreinovich, Gang Xiang, Scott A. Starks, Luc Longpre, Martine Ceberio, Roberto Araiza, J. Beck, R. Kandathi, A. Nayak, R. Torres, J. Hajagos

Departmental Technical Reports (CS)

In many engineering applications, we have to combine probabilistic and interval uncertainty. For example, in environmental analysis, we observe a pollution level x(t) in a lake at different moments of time t, and we would like to estimate standard statistical characteristics such as mean, variance, autocorrelation, correlation with other measurements. In environmental measurements, we often only measure the values with interval uncertainty. We must therefore modify the existing statistical algorithms to process such interval data.

In this paper, we provide a survey of algorithms for computing various statistics under interval uncertainty and their computational complexity. The survey includes both known …

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 20, Number 8, June 2004, College Of Engineering And Computer Science, Wright State University

BITs and PCs Newsletter

A ten page newsletter created by the Wright State University College of Engineering and Computer Science that addresses the current affairs of the college.

Which Fuzzy Logic Is The Best: Pragmatic Approach (And Its Theoretical Analysis), Vladik Kreinovich, Hung T. Nguyen

Departmental Technical Reports (CS)

In this position paper, we argue that when we are looking for the best fuzzy logic, we should specify in what sense the best, and that we get different fuzzy logics as ``the best'' depending on what optimality criterion we use.

Kolmogorov Complexity Leads To A Representation Theorem For Idempotent Probabilities (Sigma-Maxitive Measures), Vladik Kreinovich, Luc Longpre

Departmental Technical Reports (CS)

In many application areas, it is important to consider maxitive measures (idempotent probabilities), i.e., mappings m for which m(A U B)=max(m(A),m(B)). In his papers, J. H. Lutz has used Kolmogorov complexity to show that for constructively defined sets A, one maxitive measure - fractal dimension - can be represented as m(A)= sup{f(x): x in A}. We show that a similar representation is possible for an arbitrary maxitive measure.

If An Exact Interval Computation Problem Is Np-Hard, Then The Approximate Problem Is Also Np-Hard: A Meta-Result, Aline B. Loreto, Laira V. Toscani, Leila Robeiro, Dalcidio M. Claudio, Liara S. Leal, Luc Longpre, Vladik Kreinovich

Departmental Technical Reports (CS)

In interval computations, usually, once we prove that a problem of computing the exact range is NP-hard, then it later turns out that the problem of computing this range with a given accuracy is also NP-hard. In this paper, we provide a general explanation for this phenomenon.

Consortium Of Cise-Mii Funded Institutions: Initial Recommendations On Broadening Participation Of Hispanics, Ann Q. Gates

Departmental Technical Reports (CS)

No abstract provided.

Kaluza-Klein 5d Ideas Made Fully Geometric, Scott A. Starks, Olga Kosheleva, Vladik Kreinovich

Departmental Technical Reports (CS)

After the 1916 success of General relativity that explained gravity by adding time as a fourth dimension, physicists have been trying to explain other physical fields by adding extra dimensions. In 1921, Kaluza and Klein has shown that under certain conditions like cylindricity (dg_{ij}/dx^5=0), the addition of the 5th dimension can explain the electromagnetic field. The problem with this approach is that while the model itself is geometric, conditions like cylindricity are not geometric. This problem was partly solved by Einstein and Bergman who proposed, in their 1938 paper, that the 5th dimension is compactified into a small circle S^1 …

Some Usability Issues And Research Priorities In Spoken Dialog Applications, Nigel Ward, Anais G. Rivera, Karen Ward, David G. Novick

Departmental Technical Reports (CS)

As a priority-setting exercise, we examined interactions between users and a simple spoken dialog system in comparison to interactions with a human operator. Based on analysis of the observed usability differences and their root causes we propose seven priority issues for spoken dialog systems research.

Computing Best-Possible Bounds For The Distribution Of A Sum Of Several Variables Is Np-Hard, Vladik Kreinovich, Scott Ferson

Departmental Technical Reports (CS)

In many real-life situations, we know the probability distribution of two random variables x1 and x2, but we have no information about the correlation between x1 and x2; what are the possible probability distributions for the sum x1+x2? This question was originally raised by A. N. Kolmogorov. Algorithms exist that provide best-possible bounds for the distribution of x1+x2; these algorithms have been implemented as a part of the efficient software for handling probabilistic uncertainty. A natural question is: what if we have several (n>2) variables with known distribution, we have no information about their correlation, and we are interested …

Why Product Of Probabilities (Masses) For Independent Events? A Remark, Vladik Kreinovich, Scott Ferson

Departmental Technical Reports (CS)

For independent events A and B, the probability P(A&B) is equal to the product of the corresponding probabilities: P(A&B)=P(A)*P(B). It is well known that the product f(a,b)=a*b has the following property: once P(A1)+...+P(An)=1 and P(B1)+...+P(Bm)=1, the probabilities P(Ai&Bj)=f(P(Ai),P(Bj)) also add to 1: f(P(A1),P(B1))+...+f(P(An),P(Bm))=1. We prove that the product is the only function that satisfies this property, i.e., that if, vice versa, this property holds for some function f(a,b), then this function f is the product. This result provided an additional explanation of why for independent events, we multiply probabilities (or, in the Dempster-Shafer case, masses).

In this paper, we strengthen …

A Jbi Information Object Engineering Environment Utilizing Metadata Fragments For Refining Searches On Semantically-Related Object Types, Felicia N. Harlow

Theses and Dissertations

The Joint Battlespace Infosphere (JBI) architecture defines the Information Object (IO) as its basic unit of data. This research proposes an IO engineering methodology that will introduce componentized IO type development. This enhancement will improve the ability of JBI users to create and store IO type schemas, and query and subscribe to information objects, which may be semantically related by their inclusion of common metadata elements. Several parallel efforts are being explored to enable efficient storage and retrieval of IOs. Utilizing relational database access methods, applying a component-based IO type development concept, and exploiting XML inclusion mechanisms, this research improves …

Auto-Pipe: A Pipeline Design And Evaluation System, Mark A. Franklin, John Maschmeyer, Eric Tyson, James Buckley, Patrick Crowley

All Computer Science and Engineering Research

Auto-Pipe is a tool that aids in the design, evaluation, and implementation of pipelined applications that are distributed across a set of heterogeneous devices including multiple processors and FPGAs. It has been developed to meet the needs arising in the domains of communications, computation on large datasets, and real time streaming data applications. In this paper, the Auto-Pipe design flow is introduced and two sample applications, developed for compatibility with the Auto-Pipe system, are presented. The sample applications are the Triple-DES encryption standard and a subset of the signal-processing pipeline for VERITAS, a high-energy gamma-ray astrophysics experiment. These applications are …

Motion Detection Using Randomized Methods, Howaida Mohamed Naguib

Archived Theses and Dissertations

The detection and recogni6on of a moving object in a sequence of time varying images proves to be a very important task in machine intelligence in general and computer vision in particular. Recently, parametric domain techniques have been successfully used with a number of variants. In such melhods, the image is transfonned into some parameter space and the motion detection process is applied in that space. A recent parametric domain is the Randomized Hough Transform (RHT) that uses random sampling mechanism in the image space, score accumulation in the parameter space, and bridge between them using a converging mapping. The …

Security Information Management With Frame-Based Attack Presentation And First-Order Reasoning, Wei Yan

Dissertations

Internet has grown by several orders of magnitude in recent years, and this growth has escalated the importance of computer security. Intrusion Detection System (IDS) is used to protect computer networks. However, the overwhelming flow of log data generated by IDS hamper security administrators from uncovering new insights and hidden attack scenarios. Security Information Management (SIM) is a new growing area of interest for intrusion detection. The research work in this dissertation explores the semantics of attack behaviors and designs Frame-based Attack Representation and First-order logic Automatic Reasoning (FAR-FAR) using linguistics and First-order Logic (FOL) based approaches. Techniques based on …

A Versatile Programming Model For Dynamic Task Scheduling On Cluster Computers, Dejiang Jin

Dissertations

This dissertation studies the development of application programs for parallel and distributed computer systems, especially PC clusters. A methodology is proposed to increase the efficiency of code development, the productivity of programmers and enhance performance of executing the developed programs on PC clusters while facilitating improvement of scalability and code portability of these programs. A new programming model, named the Super-Programming Model (SPM), is created. Programs are developed assuming an instruction set architecture comprised of SuperInstructions (SIs). SPM models the target system as a large Virtual Machine (VM); VM contains functional units which are underlain with sub-computer systems and SIs …

Tcp Performance Enhancement In Wireless Networks Via Adaptive Congestion Control And Active Queue Management, Kai Xu

Dissertations

The transmission control protocol (TCP) exhibits poor performance when used in error-prone wireless networks. Remedy to this problem has been an active research area. However, a widely accepted and adopted solution is yet to emerge. Difficulties of an acceptable solution lie in the areas of compatibility, scalability, computational complexity and the involvement of intermediate routers and switches.

This dissertation rexriews the current start-of-the-art solutions to TCP performance enhancement, and pursues an end-to-end solution framework to the problem. The most noticeable cause of the performance degradation of TCP in wireless networks is the higher packet loss rate as compared to that …

Planar Visual Fusion Scintigraphy, Jacob Puthiamadathil

Theses

Planar scintigraphy, while providing useful information about the distribution of the radiopharmaceutical being used, often does not provide adequate information about the surrounding anatomical structures. A proposed method to solve this problem is by registering and fusing a scintigraphic image with a digital visual image. Fusing planar scintigraphic images with visual photographic images to supply an anatomic correlate to regions of radiopharmaceutical accumulation has been explored in this study. The digital visual image will provide a context for the relevant structures in the scintigraphic image. The validity of using one set of affine transformation parameters for registering all patient data …

Cluster-Based Wireless Mobile Ad-Hoc Network Security, Mandur Bajra Bajracharya

Theses

A wireless ad-hoc network is a cooperative communication network deployed with a specific purpose. It is characterized by dynamically changing topology with no fixed infrastructure which exhibits a perfectly vulnerable state for a number of different kinds of attacks.

This thesis proposes a novel technique of achieving security in wireless mobile ad hoc networks by integrating a simple clustering and a voting mechanism together. The purpose of forming a cluster is to facilitate security in the network and the voting is performed to support the decision making process in the cluster. A procedure of forming small homogenous clusters throughout the …

Enabling Cost Aware Routing With Auctions In Wireless Ad-Hoc Networks, Ali Yuksel

Theses

Battery power is a precious resource in wireless ad-hoc networks, and most routing protocols that have been proposed so far do not generate cost efficient routes. In this thesis, a novel auction-based cost-aware routing scheme, called CARA, is presented. CARA is designed as an extension of the MAC layer, and is shown to improve the cost efficiency of existing ad-hoc routing protocols through dynamic power control, while introducing only minimal additional overhead. The MAC layer at each node is given the capability to run local sealed-bid second-price auctions for the user data packets that need to be transmitted, and to …

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 21, Number 8, May 2005, College Of Engineering And Computer Science, Wright State University

BITs and PCs Newsletter

An eight page newsletter created by the Wright State University College of Engineering and Computer Science that addresses the current affairs of the college.

New Algorithms For Statistical Analysis Of Interval Data, Gang Xiang, Scott A. Starks, Vladik Kreinovich, Luc Longpre

Departmental Technical Reports (CS)

It is known that in general, statistical analysis of interval data is an NP-hard problem: even computing the variance of interval data is, in general, NP-hard. Until now, only one case was known for which a feasible algorithm can compute the variance of interval data: the case when all the measurements are accurate enough -- so that even after the measurement, we can distinguish between different measured values Xi. In this paper, we describe several new cases in which feasible algorithms are possible -- e.g., the case when all the measurements are done by using the same (not necessarily very …