Computer Engineering Commons^™

Cs 480/680: Comparative Languages, Krishnaprasad Thirunarayan

Computer Science & Engineering Syllabi

This course will introduce fundamental concepts and paradigms underlying the design of modern programming languages. For concreteness, we study the details of an object-oriented language (e.g. Java), and a functional language (e.g., scheme). The overall goal is to enable comparison and evaluation of existing languages. The programming assignments wi11 be coded in Java 5 and in Scheme.

Building National Digital Infrastructure: A Case Study Of Semiconductor Complex Limited, Deepak Kappor

Business Review

The digital revolution and the rapid technology developments thereafter created a real danger of the modem world getting divided into a new type of 'digital-haves and digital-have not's'. It was feared that developing countries like India may not be able to reap the benefits of the 'information age' because of the ever widening gap in technology and relevant infrastructure. As a strategic step to bridge the growing digital divide between India and the technologically advanced economies, the Government of India (GO I) decided to set up Semiconductor Complex Limited (SCL) in the year 1983 to develop Indian capabilities in the …

Towards Optimal Bag-Of-Features For Object Categorization And Semantic Video Retrieval, Yu-Gang Jiang, Chong-Wah Ngo, Jun Yang

Research Collection School Of Computing and Information Systems

Bag-of-features (BoF) deriving from local keypoints has recently appeared promising for object and scene classification. Whether BoF can naturally survive the challenges such as reliability and scalability of visual classification, nevertheless, remains uncertain due to various implementation choices. In this paper, we evaluate various factors which govern the performance of BoF. The factors include the choices of detector, kernel, vocabulary size and weighting scheme. We offer some practical insights in how to optimize the performance by choosing good keypoint detector and kernel. For the weighting scheme, we propose a novel soft-weighting method to assess the significance of a visual word …

Robust Minimum Variance Linear State Estimators For Multiple Sensors With Different Failure Rates, Franck O. Hounkpevi, Edwin E. Yaz

Electrical and Computer Engineering Faculty Research and Publications

Linear minimum variance unbiased state estimation is considered for systems with uncertain parameters in their state space models and sensor failures. The existing results are generalized to the case where each sensor may fail at any sample time independently of the others. For robust performance, stochastic parameter perturbations are included in the system matrix. Also, stochastic perturbations are allowed in the estimator gain to guarantee resilient operation. An illustrative example is included to demonstrate performance improvement over the Kalman filter which does not include sensor failures in its measurement model.

Dynamic Routing Structure For An Rti Taking An Evolutionary Approach Towards Optimization, Matthew Ryan Davis

Computational Modeling & Simulation Engineering Theses & Dissertations

The Runtime Infrastructure (RTI) is the common communication framework that High Level Architecture (HLA) simulations incorporate to exchange data. By abstracting the network communication layer from simulation, a common protocol for information exchange is achieved, allowing any RTI- based simulation to exchange data with any other. Such commonality can bring a limitation upon the network infrastructure, enforcing all federates to agree on the same communication policy. While this static network structure is not always the case, an optimal choice would be to adhere to the dynamic properties of a network. Static network configurations deny federates the ability to dynamically avoid …

Gate Level Dynamic Energy Estimation In Asynchronous Circuits Using Petri Nets, Ryan Mabry

USF Tampa Graduate Theses and Dissertations

This thesis introduces a new methodology for energy estimation in asynchronous circuits. Unlike existing probabilistic methods, this is the first simulative work for energy estimation in all types of asynchronous circuits.

The new simulative methodology is based on Petri net modeling. A real delay model is incorporated to capture both gate delays and interconnect delays. The switching activity at each gate is captured to measure the average dynamic energy consumed per request/acknowledge handshaking pair. The new type of Petri net is called Hierarchical Colored Asynchronous Hardware Petri net (HCAHPN). The HCAHPN is able to capture the temporal and spatial correlations …

Real-Time Gps-Alternative Navigation Using Commodity Hardware, Jordon L. Fletcher

Theses and Dissertations

Modern navigation systems can use the Global Positioning System (GPS) to accurately determine position with precision in some cases bordering on millimeters. Unfortunately, GPS technology is susceptible to jamming, interception, and unavailability indoors or underground. There are several navigation techniques that can be used to navigate during times of GPS unavailability, but there are very few that result in GPS-level precision. One method of achieving high precision navigation without GPS is to fuse data obtained from multiple sensors. This thesis explores the fusion of imaging and inertial sensors and implements them in a real-time system that mimics human navigation. In …

Evaluation Of A Parallel Architecture And Algorithm For Mapping And Localization, Damian M. Lyons, Giselle R. Isner

Faculty Publications

The Beowulf cluster approach to parallel computation offers a potentially cheap and robust source of computational power for high complexity algorithms in robotics. The challenge is to integrate this approach with the mobility and time critical response constraints of many robotic algorithms. The key contributions of this paper are: (1) introduction of a computational architecture for integrating a cluster into the control architecture of one or more robots, (2) a cluster implementation of Thrun et al’s Concurrent Localization and Mapping (CML) algorithm, and (3) presentation of results to illustrate the performance of the implemented CML algorithm and validate the architectural …

From (Idealized) Exact Causality-Preserving Transformations To Practically Useful Approximately-Preserving Ones: A General Approach, Vladik Kreinovich, Olga Kosheleva

Departmental Technical Reports (CS)

It is known that every causality-preserving transformation of Minkowski space-time is a composition of Lorentz transformations, shifts, rotations, and dilations. In principle, this result means that by only knowing the causality relation, we can determine the coordinate and metric structure on the space-time. However, strictly speaking, the theorem only says that this reconstruction is possible if we know the exact causality relation. In practice, measurements are never 100% accurate. It is therefore desirable to prove that if a transformation approximately preserves causality, then it is approximately equal to an above-described composition.

Such a result was indeed proven, but only for …

A Quick Tutorial On Jet, Yoonsik Cheon

Departmental Technical Reports (CS)

JET is an automated unit testing tool for Java classes annotated with JML specifications; JML is a formal interface specification language for Java to document the behavior of Java classes and interfaces. JET tests each method of the class under test separately. For each method, it generates a collection of test data, executes them, and decides test results (i.e., pass/fail) by using JML specifications as test oracles, thereby fully automating unit testing of Java classes. This document gives a quick tutorial introduction to JET.

Any (True) Statement Can Be Generalized So That It Becomes Trivial: A Simple Formalization Of D. K. Faddeev's Belief, Vladik Kreinovich

Departmental Technical Reports (CS)

In his unpublished lectures on general algebra, a well-known algebraist D. K. Faddeev expressed a belief that every true mathematical statement can be generalized in such a way that it becomes trivial. To the best of our knowledge, this belief has never been formalized before. In this short paper, we provide a simple formalization (and proof) of this belief.

Abstraction In Assertion-Based Test Oracles, Yoonsik Cheon

Departmental Technical Reports (CS)

Assertions can be used as test oracles. However, writing effective assertions of right abstraction levels is difficult because on the one hand, detailed assertions are preferred for through testing (i.e., to detect as many errors as possible), but on the other hand abstract assertions are preferred for readability, maintainability, and reusability. As assertions become a practical tool for testing and debugging programs, this is an important and practical problem to solve for the effective use of assertions. We advocate the use of model variables---specification-only variables of which abstract values are given as mappings from concrete program states---to write abstract assertions …

Evaluation Of Hf Rfid For Implanted Medical Applications, Eric Freudenthal, David Herrera, Frederick Kautz, Carlos Natividad, Alexandria Ogrey, Justin Sipla, Abimael Sosa, Carlos Betancourt, Leonardo Estevez

Departmental Technical Reports (CS)

Low cost HF RFID scanner subsystems that both deliver power and provide high bandwidth bidirectional communication channels have recently become available. These devices are anticipated to become ubiquitous in next-generation cell phones and enable a wide range of emerging e-commerce applications.

This paper considers the use of HF RFID to power and communicate with implantable medical devices. We successfully communicated with ten transponders that were implanted at three locations within a human cadaver. In this paper, we present measurements collected from four of these transponders that represent a wide range of transponder sizes. We also describe how RFID for medical …

Computing At Least One Of Two Roots Of A Polynomial Is, In General, Not Algorithmic, Vladik Kreinovich

Departmental Technical Reports (CS)

In our previous work, we provided a theoretical explanation for an empirical fact that it is easier to find a unique root than the multiple roots. In this short note, we strengthen that explanation by showing that finding one of many roots is also difficult.

Integrating Globalization Processes Into The Rational Unified Process, Omar Bahy Badreddin

Archived Theses and Dissertations

No abstract provided.

Analysis Of Beam Propagation In 90-Degree Holographic Recording And Readout Using Transfer Functions And Numerical 2-D-Laplace Inversion, Monish Ranjan Chatterjee, Partha P. Banerjee, George Nehmetallah

Electrical and Computer Engineering Faculty Publications

Recently, 2-D-Laplace analysis of recording and readout of edge-holograms was reported. Numerical Laplace inversion was examined for simple test cases. Inversion algorithms are applied to examine beam shaping and distortion in photovoltaic and photorefractive materials.

Real-Time On-Line Space Research Laboratory Environment Monitoring With Off-Line Trend And Prediction Analysis, Kenol Jules, Paul P. Lin

Mechanical Engineering Faculty Publications

With the International Space Station currently operational, a significant amount of acceleration data is being down-linked, processed and analyzed daily on the ground on a continuous basis for the space station reduced gravity environment characterization, the vehicle design requirements verification and science data collection. To help understand the impact of the unique spacecraft environment on the science data, an artificial intelligence monitoring system was developed, which detects in near real time any change in the reduced gravity environment susceptible to affect the on-going experiments. Using a dynamic graphical display, the monitoring system allows science teams, at any time and any …

System Level Modeling And Design Using Sysml And Systemc, Waseem Mohamed Raslan

Archived Theses and Dissertations

No abstract provided.

Distributed Web Services Firewall, Hesham Samy Sabry

Archived Theses and Dissertations

No abstract provided.

Automated Selection Of Legacy Systems Soa Modernization Strategies Using Decision Theory, Rafik Amir Salama

Archived Theses and Dissertations

No abstract provided.

Parallel Fast Multipole Method For Molecular Dynamics, Reid G. Ormseth

Theses and Dissertations

We report on a parallel version of the Fast Multipole Method (FMM) implemented in the classical molecular dynamics code, NAMD (Not Another Molecular Dynamics program). This novel implementation of FMM aims to minimize interprocessor communication through the modification of the FMM grid to match the hybrid force and spatial decomposition scheme already present in NAMD. This new implementation has the benefit of replacing all-to-all communications broadcasts with direct communications between nearest neighbors. This results in a significant reduction in the amount of communication compared to earlier attempts to integrate FMM into common molecular dynamics programs. The early performance of FMM …

Voice And Video Capacity Of A Secure Wireless System, Jason R. Seyba

Theses and Dissertations

Improving the security and availability of secure wireless multimedia systems is the purpose of this thesis. Specifically, this thesis answered research questions about the capacity of wireless multimedia systems and how three variables relate to this capacity. The effects of securing the voice signal, real-time traffic originating foreign to a wireless local area network and use of an audio-only signal compared with a combined signal were all studied. The research questions were answered through a comprehensive literature review in addition to an experiment which had thirty-six subjects using a secure wireless multimedia system which was developed as part of this …

Maximizing Broadcast And Multicast Traffic Load Through Link-Rate Diversity In Wireless Mesh Networks, Chun Tung Chou, Bao Hua Liu, Archan Misra

Research Collection School Of Computing and Information Systems

This paper studies some of the fundamental challenges and opportunities associated with the network-layer broadcast and multicast in a multihop multirate wireless mesh network (WMN). In particular, we focus on exploiting the ability of nodes to perform link-layer broadcasts at different rates (with correspondingly different coverage areas). We first show how, in the broadcast wireless medium, the available capacity at a mesh node for a multicast transmission is not just a function of the aggregate pre-existing traffic load of other interfering nodes, but intricately coupled to the actual (sender, receiver) set and the link-layer rate of each individual transmission. We …

Performance Analysis And Comparison Of Multiple Routing Protocols In A Large-Area, High Speed Mobile Node Ad Hoc Network, Daniel K. Roberts

Theses and Dissertations

The U.S. Air Force is interested in developing a standard ad hoc framework using "heavy" aircraft to route data across large regions. The Zone Routing Protocol (ZRP) has the potential to provide seamless large-scale routing for DOD under the Joint Tactical Radio System program. The goal of this study is to determine if there is a difference between routing protocol performance when operating in a large-area MANET with high-speed mobile nodes. This study analyzes MANET performance when using reactive, proactive, and hybrid routing protocols, specifically AODV, DYMO, Fisheye, and ZRP. This analysis compares the performance of the four routing protocols …

Development And Evaluation Of A Simultaneous Multithreading Processor Simulator, Carla Verena S. Nunez

Theses

Modem processors are designed to achieve greater amounts of instruction level parallelism (ILP) and thread level parallelism (TLP). Simultaneous multithreading (SMT) is an architecture that exploits both LLP and TLP. It improves the utilization of the processor resources by allowing multiple independent threads to reside in the pipeline and dynamically scheduling the available resources among the threads.

The first part of this thesis presents the development of a simultaneous multithreading processor simulator. The SMT simulator is derived from SimpleScalar, a superscalar processor simulator widely used in the computer architecture research field. The basic pipeline is expanded to allow multiple threads …

System For And Method Of Investigating The Exact Same Point On A Sample Substrate With Multiple Wavelengths, Galen L. Pfeiffer, Martin M. Liphardt, Blaine D. Johs, Craig M. Herzinger, Christopher A. Goeden, Ping He, John A. Woollam, James D. Welch

Department of Electrical and Computer Engineering: Faculty Publications

Disclosed are system for and method of analyzing a sample at substantially the exact same small spot point on a sample with a plurality of wavelengths.

System For And Method Of Investigating The Exact Same Point On A Sample Substrate With Multiple Wavelengths, Galen L. Pfeiffer, Martin M. Liphardt, Blaine D. Johs, Craig M. Herzinger, Christopher A. Goeden, Ping He, John A. Woollam, James D. Welch

Department of Electrical and Computer Engineering: Faculty Publications

Disclosed are system for and method of analyzing a sample at Substantially the exact same Small spot point on a sample with a plurality of wavelengths.

Combinatorial Fusion Criteria For Robot Mapping, Damian M. Lyons, D. Frank Hsu, Qiang Ma, Liang Wang

Faculty Publications

We address the problem of sensor fusion for stereo and ultrasound depth measurements for map building for a robot operating in a cluttered environment. In such a situation it’s difficult to make useful and realistic assumpt ions about the sensor or environment statistics. Combinatorial Fusion Analysis is used to develop an approach to fusion with unknown sensor and environment statistics. A metric is proposed that shows when fusion from a set of fusion alternatives will produ ce a more accurate estimation of depth than either sonar or stereo alone and when not. The metric consists of two crit eria: (a) …

Detecting Duplicates In Geoinformatics: From Intervals And Fuzzy Numbers To General Multi-D Uncertainty, Scott A. Starks, Luc Longpre, Roberto Araiza, Vladik Kreinovich, Hung T. Nguyen

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 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.

In our previous papers, we have proposed a new fast (O(n log(n))) …

Towards Optimal Scheduling For Global Computing Under Probabilistic, Interval, And Fuzzy Uncertainty, With Potential Applications To Bioinformatics, Roberto Araiza, Michela Taufer, Ming-Ying Leung

Departmental Technical Reports (CS)

In many practical situations, in particular in many bioinformatics problems, the amount of required computations is so huge that the only way to perform these computations in reasonable time is to distribute them between multiple processors. The more processors we engage, the faster the resulting computations; thus, in addition to processor exclusively dedicated to this job, systems often use idle time on other processors. The use of these otherwise engaged processors adds additional uncertainty to computations.

How should we schedule the computational tasks so as to achieve the best utilization of the computational resources? Because of the presence of uncertainty, …