Computer Engineering Commons^™

Time Domain Characterization Of 1-2 Ghz Circular-Ended Bowtie Antenna Using Normalizad Impulse Response, Joko Suryana, Andriyan B. Suksmono, Tati R. Mengko

Makara Journal of Technology

Time Domain Characterization of 1-2 GHz Circular-ended Bowtie Antenna Using Normalizad Impulse Response. Frequency domain analysis is a powerful and compact tool for characterizing the antenna parameters such as gain, radiation pattern and the impedance as a function of frequency. However, if time or space is a major concern, such as in the GPR appication, the time domain analysis would be a very important tool due to their unique capability for determining the echo delay and range profile of target image. In this paper, we will describe the classical theory of system characterization in time domain, and then also propose …

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

A Dynamic Pruning And Feature Selection Strategy For Real-Time Tracking, D. Frank Hsu, Damian M. Lyons

Faculty Publications

Automated video tracking is useful in a number of applications such as surveillance, multisensor networks, robotics and virtual reality. In this paper we investigate an approach to tracking based on fusing the output of a collection of video trackers, each attending to a different feature or cue on the target. We show both theoretically and experimentally that the method used to prune the growth of target hypotheses can have a great impact on the trackers performance, and indirectly, change the benefit of using linear score combination as opposed to a non-linear rank combination for fusion. We also show that the …

Nsf Advance: Institutional Transformation For Faculty Diversity - Faculty Worklife Survey Results, Manuela Romero, Ann Q. Gates

Departmental Technical Reports (CS)

The The University of Texas at El Paso (UTEP) received an NSF ADVANCE grant in October 2003 to create an initiative for institutional change with the goal of serving as a model for other institutions that desire to increase the representation and advancement of women, including underrepresented minorities, in academic science and engineering careers. In the first year of the grant, co-PI's Ann Gates and Patricia Witherspoon worked with the ADVANCE Program Evaluator, Manuela Romero, to create an instrument to survey faculty work life at UTEP. The instrument is based on the "Study of Faculty Work Life" survey instrument that …

Supporting Documentation For The 2003 Sps-Prospec Experiment, Oscar Mondragon, Salamah Salamah

Departmental Technical Reports (CS)

In spring of 2003 an empirical study was conducted to compare the effectiveness of the Prospec tool with the Specification Pattern System (SPS). The objective of the experiment was to determine the effect that Prospec and SPS have over the completeness and correctness of the generated software property specifications. The purpose of this document is to present the material that was used during the experiment, and to document how the classification of the patterns and scopes of each trial was validated.

A Contextual Interpretation Of Undefinedness For Runtime Assertion Checking, Yoonsik Cheon, Gary T. Leavens

Departmental Technical Reports (CS)

Runtime assertion checkers and static checking and verification tools must all cope with the well-known undefinedness problem of logic. This problem is particularly severe for runtime assertion checkers, since, in addition to the possibility of exceptions and errors, runtime assertion checkers must cope with non-executable expressions (such as certain quantified expressions). This paper describes how the runtime assertion checker of the Java Modeling Language (JML) copes with undefinedness. JML is interesting because it attempts to satisfy the needs of a wide range of tools; besides runtime assertion checking, these include static checking tools (like ESC/Java) and static verification tools. These …

Fast Algorithm For Computing The Upper Endpoint Of Sample Variance For Interval Data: Case Of Sufficiently Accurate Measurements, Gang Xiang

Departmental Technical Reports (CS)

When we have n results x1,...,xn of repeated measurement of the same quantity, the traditional statistical approach usually starts with computing their sample average E and their sample variance V. Often, due to the inevitable measurement uncertainty, we do not know the exact values of the quantities, we only know the intervals [xi] of possible values of xi. In such situations, for different possible values xi from [xi], we get different values of the variance. We must therefore find the range [V] of possible values of V. It is known that in general, this problem is NP-hard. For the case …

Simple Public Key Infrastructure Analysis Protocol Analysis And Design, Alexander G. Vidergar

Theses and Dissertations

Secure electronic communication is based on secrecy, authentication and authorization. One means of assuring a communication has these properties is to use Public Key Cryptography (PKC). The framework consisting of standards, protocols and instructions that make PKC usable in communication applications is called a Public Key Infrastructure (PKI). This thesis aims at proving the applicability of the Simple Public Key Infrastructure (SPKI) as a means of PKC. The strand space approach of Guttman and Thayer is used to provide an appropriate model for analysis. A Diffie-Hellman strand space model is combined with mixed strand space proof methods for proving the …

A Line-Of-Slight Sensor Network For Wide Area Video Surveillance: Simulation And Evaluation, Jamie R. Morrison

Theses and Dissertations

Substantial performance improvement of a wide area video surveillance network can be obtained with the addition of a Line-of-Sight sensor. The research described in this thesis shows that while the Line-of-Sight sensor cannot monitor areas with the ubiquity of video cameras alone, the combined network produces substantially fewer false alarms and superior location precision for numerous moving people than video. Recent progress in the fabrication of inexpensive, robust CMOS-based video cameras have triggered a new approach to wide area surveillance of busy areas such as modeling an airport corridor as a distributed sensor network problem. Wireless communication between these cameras …

Geolocation Of A Node On A Local Area Network, John R. Clarson

Theses and Dissertations

Geolocation is the process of identifying a node using only its Internet Protocol (IP) address. Locating a node on a LAN poses particular challenges due to the small scale of the problem and the increased significance of queuing delay. This study builds upon existing research in the area of geolocation and develops a heuristic tailored to the difficulties inherent in LANs called the LAN Time to Location Heuristic (LTTLH). LTTLH uses several polling nodes to measure latencies to end nodes, known locations within the LAN. The Euclidean distance algorithm is used to compare the results with the latency of a …

Weapon Release Scheduling From Multiple-Bay Aircraft Using Multi-Objective Evolutionary Algorithms, Francis R. Lyons Iv

Theses and Dissertations

The United States Air Force has put an increased emphasis on the timely delivery of precision weapons. Part of this effort has been to us multiple bay aircraft such the B-1B Lancer and B-52 Stratofortress to provide Close Air Support and responsive strikes using 1760 weapons. In order to provide greater flexibility, the aircraft carry heterogeneous payloads which can require deconfliction in order to drop multiple different types of weapons. Current methods of deconfliction and weapon selection are highly crew dependent and work intensive. This research effort investigates the optimization of an algorithm for weapon release which allows the aircraft …

Accelerating Missile Threat Engagement Simulations Using Personal Computer Graphics Cards, Sean E. Jeffers

Theses and Dissertations

The 453rd Electronic Warfare Squadron supports on-going military operations by providing battlefield commanders with aircraft ingress and egress routes that minimize the risk of shoulder or ground-fired missile attacks on our aircraft. To determine these routes, the 453rd simulates engagements between ground-to-air missiles and allied aircraft to determine the probability of a successful attack. The simulations are computationally expensive, often requiring two-hours for a single 10-second missile engagement. Hundreds of simulations are needed to perform a complete risk assessment which includes evaluating the effectiveness of countermeasures such as flares, chaff, jammers, and missile warning systems. Thus, the need for faster …

Enabling Intrusion Detection In Ipsec Protected Ipv6 Networks Through Secret-Key Sharing, Patrick J. Sweeney

Theses and Dissertations

As the Internet Protocol version 6 (IPv6) implementation becomes more widespread, the IP Security (IPSec) features embedded into the next-generation protocol will become more accessible than ever. Though the network-layer encryption provided by IPSec is a boon to data security, its use renders standard network intrusion detection systems (NIDS) useless. The problem of performing intrusion detection on encrypted traffic has been addressed by differing means with each technique requiring one or more static secret keys to be shared with the NIDS beforehand. The problem with this approach is static keying is much less secure than dynamic key generation through the …

Effect Of Training Datasets On Support Vector Machine Prediction Of Protein-Protein Interactions, Siaw Ling Lo, Cong Zhong Cai, Maxey Chung, Yu Zong Chen

Research Collection School Of Computing and Information Systems

Knowledge of protein-protein interaction is useful for elucidating protein function via the concept of 'guilt-by-association'. A statistical learning method, Support Vector Machine (SVM), has recently been explored for the prediction of protein-protein interactions using artificial shuffled sequences as hypothetical noninteracting proteins and it has shown promising results (Bock, J. R., Gough, D. A., Bioinformatics 2001, 17, 455-460). It remains unclear however, how the prediction accuracy is affected if real protein sequences are used to represent noninteracting proteins. In this work, this effect is assessed by comparison of the results derived from the use of real protein sequences with that derived …

Multi-Aoi-System For Easy Changing Angles Of Incidence In Ellipsometer, Polarimeter And Reflectometer Systems, Blaine D. Johs, Ping He, Martin M. Liphardt, Christopher A. Goeden, John A. Woollam, James D. Welch

Department of Electrical and Computer Engineering: Faculty Publications

Disclosed is a system for enabling easy sequential setting of different Angles-of-Incidence of a beam of electromagnetic radiation to a surface of a sample system, and to regression based methodology for evaluating and compensating the effects of the presence of electromagnetic beam intercepting angle-of-incidence changing systems, including where desired, parameterization of calibration parameters.

Generalized Phase Space Projection For Nonlinear Noise Reduction, Michael T. Johnson, Richard J. Povinelli

Electrical and Computer Engineering Faculty Research and Publications

Improved phase space projection methods, adapted from related work in the linear signal processing field based on subspace decomposition, are presented for application to the problem of additive noise reduction in the context of phase space analysis. These methods improve upon existing methods such as Broomhead–King singular spectrum analysis projection by minimizing overall signal distortion subject to constraints on the residual error, rather than using a direct least-squares fit. This results in a range of weighted projections which estimate and compensate for the portion of the principal component's singular values corresponding to noise rather than signal energy, and which include …

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

BITs and PCs Newsletter

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

Specifying And Checking Method Call Sequences In Jml, Yoonsik Cheon, Ashaveena Perumandla

Departmental Technical Reports (CS)

In a pre- and post-conditions style specification, it is difficult to specify allowed sequences of method calls, often called protocols. However, the protocols are essential properties of reusable object-oriented classes and application frameworks, and the approaches based on the pre- and post-conditions, such as design by contracts (DBC) and formal behavioral interface specification languages (BISL), are being accepted as a practical and effective way of describing precise interfaces of (reusable) program modules. We propose a simple extension to JML, a BISL for Java, to specify protocol properties in an intuitive and concise manner. We also define a formal semantics of …

A Complete Automation Of Unit Testing For Java Programs, Yoonsik Cheon, Myoung Yee Kim, Ashaveena Perumandla

Departmental Technical Reports (CS)

Program testing is expensive and labor-intensive, often consuming more than half of the total development costs, and yet it is frequently not done well and the results are not always satisfactory. However, testing is the primary method to ensure that programs comply with requirements. We describe our on-going project that attempts to completely automate unit testing of object-oriented programs. Our project investigates the use of an evolutionary approach, called genetic algorithms, for the test data generation and the use of program specifications, written in JML, for the test result determination. A proof-of-concept tool has been implemented and shows that a …

On Inverse Halftoning: Computational Complexity And Interval Computations, Sergio D. Cabrera, K. Iyer, Gang Xiang, Vladik Kreinovich

Departmental Technical Reports (CS)

We analyze the problem of inverse half-toning. This problem is a particular case of a class of difficult-to-solve problems: inverse problems for reconstructing piece-wise smooth images. We show that this general problem is NP-hard. We also propose a new idea for solving problems of this type, including the inverse halftoning problem.

Exact Bounds For Interval And Fuzzy Functions Under Monotonicity Constraints, With Potential Applications To Biostratigraphy, Emil Platon, Kavitha Tupelly, Vladik Kreinovich, Scott A. Starks, Karen Villaverde

Departmental Technical Reports (CS)

The age of fossil species in samples recovered from a well that penetrates an undisturbed sequence of sedimentary rocks increases with depth. The results of biostratigraphic analysis of such a sequence consist of several age-depth values -- both known with interval (or fuzzy) uncertainty -- and we would like to find, for each possible depth, the interval of the possible values of the corresponding age. A similar problem of bounding an intervally (fuzzily) defined function under monotonicity constraint occurs in many other application areas. In this paper, we provide an efficient algorithm for solving this problem.

To Properly Reflect Physicists' Reasoning About Randomness, We Also Need A Maxitive (Possibility) Measure, Andrei M. Finkelstein, Olga Kosheleva, Vladik Kreinovich, Scott A. Starks, Hung T. Nguyen

Departmental Technical Reports (CS)

According to the traditional probability theory, events with a positive but very small probability can occur (although very rarely). For example, from the purely mathematical viewpoint, it is possible that the thermal motion of all the molecules in a coffee cup goes in the same direction, so this cup will start lifting up.

In contrast, physicists believe that events with extremely small probability cannot occur. In this paper, we show that to get a consistent formalization of this belief, we need, in addition to the original probability measure, to also consider a maxitive (possibility) measure.

Towards A Minimal Metrics Suite For Agent Based Systems, Maha Ahmed Nabil Abdel Kader

Archived Theses and Dissertations

No abstract provided.

The Value Of Mobile Applications: A Utility Company Study, Fiona Fui-Hoon Nah, Keng Siau, Hong Sheng

Research Collection School Of Computing and Information Systems

The value proposition of mobile applications i.e. the net value of the benefits and costs associated with the adoption and adaptation of mobile applications is discussed. A means-ends network that depicts the fundamental relationships among the objectives such as efficiency, effectiveness, customer satisfaction, security, cost, and employee acceptance, was developed. The network is useful to researchers as it highlights the issues, concerns, and values of mobile applications. The network help the managers and practitioners to achieve their companies' objectives of implementing mobile and wireless applications.

Automatic Classification And Speaker Identification Of African Elephant (Loxodonta Africana) Vocalizations, Patrick J. Clemins, Michael T. Johnson, Kirsten Leong, Anne Savage

Electrical and Computer Engineering Faculty Research and Publications

A hidden Markov model (HMM) system is presented for automatically classifying African elephant vocalizations. The development of the system is motivated by successful models from human speech analysis and recognition. Classification features include frequency-shifted Mel-frequency cepstral coefficients (MFCCs) and log energy, spectrally motivated features which are commonly used in human speech processing. Experiments, including vocalization type classification and speaker identification, are performed on vocalizations collected from captive elephants in a naturalistic environment. The system classified vocalizations with accuracies of 94.3% and 82.5% for type classification and speaker identification classification experiments, respectively. Classification accuracy, statistical significance tests on the model parameters, …

Qos Constrained Cellular Ad Hoc Augmented Networks, Chi-Tung Chen

Dissertations

In this dissertation, based on different design criteria, three novel quality of service (QoS) constrained cellular ad hoc augmented network (CAHAN) architectures are proposed for next generation wireless networks. The CAHAN architectures have a hybrid architecture, in which each MT of CDMA cellular networks has ad hoc communication capability. The CAHAN architectures are an evolutionary approach to conventional cellular networks. The proposed architectures have good system scalability and high system reliability.

The first proposed architecture is the QoS constrained minimum-power cellular ad hoc augmented network architecture (QCMP CAHAN). The QCMP CAHAN can find the optimal minimum-power routes under the QoS …

An Autonomous Router-Based Solution To Detect And Defend Low Rate Ddos Attacks, Karunakar Anantharam

Theses

Internet security was not a concern when the Internet was invented, but we cannot deny this fact anymore. Since all forms of businesses and communications are aligned to the Internet in one form or the other, the security of these assets (both infrastructure and content) is of prime importance. Some of the well known consequences of an attack include gaining access to a network, intellectual property thefts, and denial of service.

This thesis focuses on countering flood-type attacks that result in denial of service to end users. A new classification of this denial of service attacks, known as the low …

A Co-Processor Design To Support Mpi Primitives In Configurable Multiprocessor Designs, Rohan Bafna

Theses

The Message-Passing Interface (MIPI) is a widely used standard for inter-processor communication in parallel computers. This standard is normally implemented in software, thus resulting in large communication latencies. A hardware implementation can reduce communication latencies significantly, thereby increasing the bandwidth. However, this approach cannot be applied in practice to the very large set of functions in MPI.

Reconfigurable computing has reached levels where entire parallel systems can be built inside one or more FPGAs (Field-Programmable Gate Arrays). In this scheme, specialized components must be built for inter-processor communication and the resulting code is difficult to port to other reconfigurable platforms. …

Scalable Wide Area Ad-Hoc Networking, Nithin Bose

Theses

The scalability problem of routing algorithms in Mobile Ad-hoc networks (MANET) has conventionally been addressed by introducing hierarchical architectures, clusters, and neighborhood zones. In all of these approaches, some nodes are assigned different routing related roles than others. Examples include cluster heads, virtual backbones and border nodes. The selection of these nodes on a fixed or dynamic basis adds complexity to the routing algorithm, in addition to placing significant demands on mobility and power consumption of these nodes. Furthermore, the scalability achieved with hierarchical architectures or partitions is limited.

This thesis demonstrates that location awareness can greatly aid in MANET …

Smartacking: Improving Tcp Performance From The Receiving End, Daniel K. Blandford, Sally A. Goldman, Sergey Gorinsky, Yan Zhou, Daniel R. Dooly

All Computer Science and Engineering Research

We present smartacking, a technique that improves performance of Transmission Control Protocol (TCP) via adaptive generation of acknowledgments (ACKs) at the receiver. When the bottleneck link is underutilized, the receiver transmits an ACK for each delivered data segment and thereby allows the connection to acquire the available capacity promptly. When the bottleneck link is at its capacity, the smartacking receiver sends ACKs with a lower frequency reducing the control traffic overhead and slowing down the congestion window growth to utilize the network capacity more effectively. To promote quick deployment of the technique, our primary implementation of smartacking modifies only the …