Computer Engineering Commons^™

Reduction Of False Positives In Fault Detection System Using A Low Pass Data Filter, Ranjit Salunkhe

Theses

Network traffic is bursty in nature and exhibits the property of self-similarity, the degree of which is measured by the Hurst parameter. Now, in any network there is always the possibility of the occurrence of fault traffic that can be caused due to faults or malfunction of a network component. Fault Detection Systems that check for traffic anomalies can trigger off an alert on the detection of any traffic behavior that deviates from normal. Such deviation is usually caused when a fault occurs. But in network traffic sudden bursts may occur due to the inherent behavior of a network application. …

Sub-Segment Based Transport Layer Protocol For Wireless Medium, Som Sengupta

Theses

This thesis discusses the techniques to improve the TCP over wireless. The loss-intensive wireless communication results in high retransmission rates to recover lost packets and bandwidth consumption. In addition, the retransmitted segments have significant chance of being dropped. To make the retransmission process more granular, large segments at the transport layer (540 bytes, by default) can be subdivided into smaller sub-segments. This document introduces a split TCP based solution and describes how to produce a series of smaller-sized segments that share the same transport layer header. A new header format is introduced to support the transmission of smaller segments …

Design And Evaluation Of Processes For Fuel Fabrication: Quarterly Progress Report #7, Georg F. Mauer

Fuels Campaign (TRP)

The seventh quarter of the project covered the following:

• Mr. Richard Silva continued the development of a simulation model with a Waelischmiller hot cell robot. Rich will continue to develop detailed 3-D process simulation models as his M.Sc. thesis project.

• Mr. Richard Silva presented a paper on hot cell robotics at the ANS student conference in Berkeley, CA.

• Concepts and Methods for Vision-Based Hot Cell Supervision and control, focusing on rule-based object recognition (Ph.D. Student Jae-Kyu Lee)

• Undergraduate student Jamil Renno, developed better control algorithms, and created simulations of pick and place actions for the hot …

Soft Fault Detection Using Mibs In Computer Networks, Sachin Arora

Theses

To improve network reliability and management in today's high-speed communication system, a statistical anomaly network intrusion detection system (NIDS) has been investigated, for network soft faults using the Management Information Base (Mm) traffic parameters provided by Simple Network Management Protocol (SNMP), for both wired and wireless networks. The work done would be a contribution to a system to be designed MIB Anomaly Intrusion Detection, a hierarchical multi-tier and multiobservation-window Anomaly Intrusion Detection system. The data was derived from many experiments that had been carried out in the test bed that monitored 27 MIB traffic parameters simultaneously, focusing on the soft …

Tracking The Path Of A Mobile Radioactive Source Using A Wireless Sensor Network, Nipa Shah

Theses

This report describes several experiments used to characterize and test a network of radiation sensors. The purpose of these tests is to assess the feasibility of using these sensors to detect and track radioactive sources in a large field, as in a battlefield or on a military campus. Simulated radiation measurements are used to compare the result of radiation detection accuracy in tracking the moving target and to find its path as early as possible. This is done via changing the number of sensing nodes deployed (deployment density), as well as the models of the detectors. This thesis describes algorithms …

Compressed Data Structures For Recursive Flow Classification, Edward W. Spitznagel

All Computer Science and Engineering Research

High-speed packet classification is crucial to the implementation of several advanced network services and protocols; many QoS implementations, active networking platforms, and security devices (such as firewalls and intrusion-detection systems) require it. But performing classification on multiple fields, at the speed of modern networks, is known to be a difficult problem. The Recursive Flow Classification (RFC) algorithm described by Gupta and McKeown performs classification very quickly, but can require excessive storage when using thousands of rules. This paper studies a compressed representation for the tables used in RFC, trading some memory accesses for space. The compression’s efficiency can be improved …

Robust Methodology For Characterizing System Response To Damage: A Subjective (Fuzzy) Partial Ordered Modification Of The Traditional Utility-Probability Scheme, Carlos De La Mora, Piotr Wojciechowski, Vladik Kreinovich, Scott A. Starks, Paul J. Tanenbaum, Alexandr V. Kuzminykh

Departmental Technical Reports (CS)

No abstract provided.

The Use Of Fuzzy Measures As A Data Fusion Tool In Geographic Information Systems: Case Study, Cynthia Campos, George R. Keller, Vladik Kreinovich, Luc Longpre, Francois Modave, Scott A. Starks, Roberto Torres

Departmental Technical Reports (CS)

Geospatial databases generally consist of measurements related to points (or pixels in the case of raster data), lines, and polygons. In recent years, the size and complexity of these databases have increased significantly and they often contain duplicate records, i.e., two or more close records representing the same measurement result. In this paper, we use fuzzy measures to address the problem of detecting duplicates in a database consisting of point measurements. As a test case, we use a database of measurements of anomalies in the Earth's gravity field that we have compiled. We show that a natural duplicate deletion algorithm …

Complexity And Approximation Studies Of Finding Polynomially Bounded Length Plans For Temporal Goals, Chitta Baral, Vladik Kreinovich, Sudeshna Sarkar, Nam Tran, Raul Trejo, Xin Zhang

Departmental Technical Reports (CS)

In this paper, we consider the problem of planning with temporal goals, focussing on polynomially bounded length plans. Past results about complexity of planning are mostly about finding plans that take the world to one of several desired states, often described using a goal formula. We first consider goals expressed using linear temporal logic and analyze the complexity of planning with respect to such goals for both when the states in the trajectory are complete states, and when they are incomplete states. For the later case we also develop a notion of approximate planning and show its complexity to be …

Fast Quantum Algorithms For Handling Probabilistic, Interval, And Fuzzy Uncertainty, Mark Martinez, Luc Longpre, Vladik Kreinovich, Scott A. Starks, Hung T. Nguyen

Departmental Technical Reports (CS)

We show how quantum computing can speed up computations related to processing probabilistic, interval, and fuzzy uncertainty.

Robust Methodology For Characterizing System Response To Damage: Approach Based On Partial Order, Paul J. Tanenbaum, Carlos De La Mora, Piotr Wojciechowski, Olga Kosheleva, Vladik Kreinovich, Scott A. Starks, Alexandr V. Kuzminykh

Departmental Technical Reports (CS)

To describe the response of engineering complex systems to various damage mechanics, engineers have traditionally use number-valued utilities to describe the results of different possible outcomes, and (number-valued) probabilities (often, subjective probabilities) to describe the relative frequency of different outcomes. This description is based on the assumption that experts can always make a definite preference between two possible outcomes, i.e., that the set of all outcomes is linearly (totally) ordered. In practice, experts often cannot make a choice, their preference is only a partial order.

Outlier Detection Under Interval And Fuzzy Uncertainty: Algorithmic Solvability And Computational Complexity, Vladik Kreinovich, Praveen Patangay, Luc Longpre, Scott A. Starks, Cynthia Campos, Scott Ferson, Lev Ginzburg

Departmental Technical Reports (CS)

No abstract provided.

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 19, Number 7, May 2003, 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.

Isomorphic Strategy For Processor Allocation In K-Ary N-Cube Systems, Moonsoo Kang, Chansu Yu, Hee Yong Youn, Ben Lee, Myungchul Kim

Electrical and Computer Engineering Faculty Publications

Due to its topological generality and flexibility, the k-ary n-cube architecture has been actively researched for various applications. However, the processor allocation problem has not been adequately addressed for the k-ary n-cube architecture, even though it has been studied extensively for hypercubes and meshes. The earlier k-ary n-cube allocation schemes based on conventional slice partitioning suffer from internal fragmentation of processors. In contrast, algorithms based on job-based partitioning alleviate the fragmentation problem but require higher time complexity. This paper proposes a new allocation scheme based on isomorphic partitioning, where the processor space is partitioned into higher dimensional isomorphic subcubes. The …

Guest Editorial: Text And Web Mining, Ah-Hwee Tan, Philip S. Yu

Research Collection School Of Computing and Information Systems

Text mining and web mining are two interrelated fields that have received a lot of attention in recent years. Text mining [1, 2] is concerned with the analysis of very large document collections and the extraction of hidden knowledge from text-based data. Web mining [3] refers to the analysis and mining of all web-related data, including web content, hyperlink structure, and web access statistics.

Final Design Report Of Computer Controller Of Robotic Arm, Kurt Niederhauser

Undergraduate Honors Capstone Projects

My Part of the project was to design the hardware. I assembled the TT8 microprocessor and designed the optocial isolation board for the input and output signals to the TT8 microprocessor. We had two boards. One board had the TT8 Processor and other chips used for regulating the affairs of the TT8 (This board I assembled), and then there was another board that had all the control signals for the TT8 (this board I had to design), which sent the signals letting the TT8 know when the robot arm had been extended or retracted as far is it could go. …

A Performance-Driven Framework For Customizing Csp Middleware Support, Guoliang Xing

All Computer Science and Engineering Research

A Distributed Constraint Satisfaction Problem (DCSP) aims to find consistent assignments of values to a set of variables distributed on multiple nodes. Despite its simple definition, DCSPs can model a broad variety of traditional artificial intelligence problems. Furthermore, many problems found in emerging sensor-actuator networks can be formalized to DCSPs. However, due to the platform limitations of networked embedded systems such as sensor-actuators networks, building real-world applications for solving DCSPs not only requires the improved DCSP algorithms but also novel system approaches. This thesis first develops a performance-driven middleware framework for solving DCSP problems. Then the prototype system built with …

Specialized Hardware Support For Dynamic Storage Allocation, Steven M. Donahue

All Computer Science and Engineering Research

With the advent of operating systems and programming languages that can evaluate and guarantee real-time specifications, applications with real-time requirements can be authored in higher-level languages. For example, a version of Java suitable for real-time (RTSJ) has recently reached the status of a reference implementation, and it is likely that other implementations will follow. Analysis to show the feasibility of a given set of tasks must take into account their worst-case execution time, including any storage allocation or deallocation associated with those tasks. In this thesis, we present a hardware-based solution to the problem of storage allocation and (explicit) deallocation …

Using Contaminated Garbage Collection And Reference Counting Garbage Collection To Provide Automatic Storage Reclamation For Real-Time Systems, Matthew P. Hampton

All Computer Science and Engineering Research

Language support of dynamic storage management simplifies the application programming task immensely. As a result, dynamic storage allocation and garbage collection have become common in general purpose computing. Garbage collection research has led to the development of algorithms for locating program memory that is no longer in use and returning the unused memory to the run-time system for late use by the program. While many programming languages have adopted automatic memory reclamation features, this has not been the trend in Real-Time systems. Many garbage collection methods involve some form of marking the objects in memory. This marking requires time proportional …

Hashtables For Real-Time And Embedded Systems, Anand Krishnan

All Computer Science and Engineering Research

Real-time are beginning to appear in advanced, high-level programming languages such as Java. When complemented by a real-time operating system, the Real-Time Specification for Java (RTSJ) offers strong execution constraints for applications developed in Java. While the RTSJ make the basic services of Java such as storage and thread management ready for many real-time applications, the collection objects, and the rest of the application run-time library, cannot be used by RTSJ applications until their run-time properties are examined and modified as necessary to make them suitable for use by real-time applications. In this work, we examine the Hashtable collection facility …

Dynamic Assignment Of Scoped Memory Regions In The Translation Of Java To Real-Time Java, Morgan G. Deters

All Computer Science and Engineering Research

Advances in middleware, operating systems, and popular, general-purpose languages have brought the ideal of reasonably-bound execution time closer to developers who need such assurances for real-time and embedded systems applications. Extensions to the Java libraries and virtual machine have been proposed in a real-time Java standard, which provides for specification of release times, execution costs, and deadlines for a restricted class of threads. To use such features, the programmer is required to use unwieldy code constructs to create region-like areas of storage, associate them with execution scopes, and allocate objects from them. Further, the developer must ensure that they do …

Integrated Coverage And Connectivity Configuration In Wireless Sensor Networks, Xiaorui Wang, Guoliang Xing, Yuanfang Zhang, Chenyang Lu, Robert Pless, Christopher Gill

All Computer Science and Engineering Research

An effective approach for energy conservation in wireless sensor networks is scheduling sleep intervals for extraneous nodes, while the remaining nodes stay active to provide continuous service. For the sensor network to operate successfully, the active nodes must maintain both sensing coverage and network connectivity. Furthermore, the network must be able to configure itself to any feasible degrees of coverage and connectivity in order to support different applications and environments with diverse requirements. This paper presents the design and analysis of novel protocols that can dynamically configure a network to achieve guaranteed degrees of coverage and connectivity. This work differs …

Multiflow Tcp, Udp, Ip, And Atm Traffic Generation Module, Eliot I. Sinclair, John W. Lockwood

All Computer Science and Engineering Research

Networking devices must be capable of processing traffic flows from multiple sources. In order to verify that such devices operates properly, a network testbench can be used to inject traffic into the device. The specification of the traffic flows can be difficult. At the low level, there are header fields, data checksums, and packet length fields that all must be formatted correctly. Further, there can be multiple flows of traffic that will arrive simultaneously. It is desirable to specify traffic at a high level of abstraction. A software program can then be written to parse the specification and generate the …

System-On-Chip Packet Processor For An Experimental Network Services Platform, David Taylor, Alex Chandra, Yuhua Chen, Sarang Dharmapurikar, John Lockwood, Wenjing Tang, Jonathan Turner

All Computer Science and Engineering Research

As the focus of networking research shifts from raw performance to the delivery of advanced network services, there is a growing need for open-platform systems for extensible networking research. The Applied Research Laboratory at Washington University in Saint Louis has developed a flexible Network Services Platform (NSP) to meet this need. The NSP provides an extensible platform for prototyping next-generation network services and applications. This paper describes the design of a system-on-chip Packet Processor for the NSP which performs all core packet processing functions including segmentation and reassembly, packet classification, route lookup, and queue management. Targeted to a commercial configurable …

A Thesis On A 3d Input Device For Sketching Characters, Mark A. Schroering

All Computer Science and Engineering Research

The goal of this project is to develop a 3D input device using a stiff piece of paper and a camera. The camera tracks the piece of paper in 3D space. The user orients the paper in 3D space and then draws on the paper using a pen-like device. The camera tracks the movement of the pen on the piece of paper. The location of the pen in 3D space can then be calculated from the orientation of the paper. A drawing application that uses this 3D input device was also developed. The application allows a user to make characters …

Detecting Cracks In Thin Plates By Using Lamb Wave Scanning: Geometric Approach, Roberto A. Osegueda, Vladik Kreinovich, Enrique Roldan, Rodrigo Mares

Departmental Technical Reports (CS)

A crack in a thin plate reflects ultrasonic waves; therefore, it is reasonable to determine the location of the crack by measuring the reflected waves. The problem of locating the crack can be reformulated in purely geometric terms. Previously, time-consuming iterative numerical methods were used to solve the resulting geometric problem. In this paper, we show that explicit (and fast to compute) formulas can be used instead.

Probabilities, Intervals, What Next? Optimization Problems Related To Extension Interval Computations To Situations With Partial Information About Probabilities, Vladik Kreinovich

Departmental Technical Reports (CS)

When we have only interval ranges [xi-,xi+] of sample values x1,...,xn, what is the interval [V-,V+] of possible values for the variance V of these values? We prove that the problem of computing the upper bound V+ is NP-hard. We provide a feasible (quadratic time) algorithm for computing the exact lower bound V- on the variance of interval data. We also provide feasible algorithms that computes V+ under reasonable easily verifiable conditions, in particular, in case interval uncertainty is introduced to maintain privacy in a statistical database.

We also extend the main formulas of interval arithmetic for different arithmetic operations …

Parallel Implementation Of A Face Recognition [Sic] System Based On Modular Pca Approach, Rajkiran Gottumukkal

Electrical & Computer Engineering Theses & Dissertations

This thesis describes research in automated methods for the recognition of human faces. The research is driven by the need to design a method, which would ensure high accuracy under the conditions of facial expression, illumination and pose variations. The resulting method is able to cope with uncontrolled nature of facial expression, illumination and head rotations. The main novelty of this work is the idea that some of the local facial features do not vary even when the facial expression, illumination and pose vary. This idea is applied to the existing principle component analysis lPCA) method to arrive at a …

A Pipelined Architecture For Real Time Correction Of Barrel Distortion In Wide-Angle Camera Images, Hau Trung Ngo

Electrical & Computer Engineering Theses & Dissertations

Images captured by wide-angle cameras show barrel type spatial distortion due to wide-angle configuration of the camera lens where image regions farther from the center are compressed in a nonlinear fashion. The barrel distortion correction technique based on least squares estimation attempts to correct a distorted image by expanding it nonlinearly so that straight lines in the object space remain straight in the image space. The intensity value of a pixel in the expanded image is calculated by back mapping its position to the corresponding position in the distorted image and performing linear interpolation on the neighboring pixels. Distorted images …

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 19, Number 6, April 2003, 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.