Computer Engineering Commons^™

A Comparative Analysis Of Air-To-Ground Engagement Outcomes In The Joint Warfare System (Jwars) And The Jwars-Joint Semi-Automated Forces Federation, Melissa Anne St. Peter

Computational Modeling & Simulation Engineering Theses & Dissertations

Multi-resolution modeling is the process by which a single model is created by connecting multiple individual models to describe phenomena at different levels of resolution [1]. "When we change resolutions, replacing a detailed model by a more aggregate one, we must ask whether results are 'consistent'" [2].

There are many methods of determining if the results of two simulations are 'consistent'. However, they are very entailed and require a detailed understanding of the individual models including their functionality, algorithms, and inner workings. A straight forward and rapid way of assessing potential inconsistencies is through a statistical comparison of the model …

The Reliability Of The Computer Communication Networks Including Mobile Nodes, Sahin Yasar

Electrical & Computer Engineering Theses & Dissertations

The wireless computer networks have an uncertainty in their structures aside from their big advantages for the users. The environmental conditions, changing locations of the mobile hosts and the changing components in the system can easily affect their reliability. In order to know a system capability performing its functions, keep the reliability at a certain level and/or detect the deficiency of the system, it is necessary to analyze the reliability of a computer communication network including the wired and wireless parts. But the above reasons also make the analysis and a unique solution difficult so a set of algorithms is …

Tuqr: A Topology Unaware Qos Routing Protocol For Manets, Ibrahim Zagli

Electrical & Computer Engineering Theses & Dissertations

In this thesis, the main purpose is to design a new Quality of Service (QoS) Routing Protocol for Mobile ad-hoc Networks that improves packet delivery ratio in QoS constrained communication in comparison to current well known protocols by using distributed multi-path routing. To accomplish that, a new approach to the QoS routing in Mobile ad hoc Networks (MANET) is developed to reduce the effects of the distrustful environment of MANET by keeping a number of suitable paths as high as possible and distributing the decision mechanism among the nodes on the path.

In most current protocols that mainly evaluate and …

Post Register Allocation Spill Code Optimization, Christopher Lupo, Kent Wilken

Computer Science and Software Engineering

A highly optimized register allocator should provide an efficient placement of save/restore code for procedures that contain calls. This paper presents a new approach to placing callee-saved save and restore instructions that generalizes Chow's shrink-wrapping technique (Chow 1988). An efficient, profile-guided, hierarchical spill code placement algorithm is used to analyze the structure of a procedure to calculate the minimum dynamic execution count locations to place callee-saved save and restore code. The algorithm is implemented in the Gnu Compiler Collection and has been tested on the SPEC CPU2000 Integer Benchmark suite. Results show that the technique reduces the number of dynamic …

An Adaptable Energy-Efficient Medium Access Control Protocol For Wireless Sensor Networks, Justin T. Kautz

Theses and Dissertations

Wireless networks have become ubiquitous recently and therefore their usefulness has also become more extensive. Wireless sensor networks (WSN) detect environmental information with sensors in remote settings. One problem facing WSNs is the inability to resupply power to these energy-constrained devices due to their remoteness. Therefore to extend a WSN's effectiveness, the lifetime of the network must be increased by making them as energy efficient as possible. An energy efficient medium access control (MAC) can boost a WSN's lifetime. This research creates a MAC protocol called Adaptive sensor Medium Access Control (AMAC) which is based on Sensor Medium Access Control …

Threading And Autodocumenting News Videos: A Promising Solution To Rapidly Browse News Topics, Xiao Wu, Chong-Wah Ngo, Qing Li

Research Collection School Of Computing and Information Systems

This paper describes the techniques in threading and autodocumenting news stories according to topic themes. Initially, we perform story clustering by exploiting the duality between stories and textual-visual concepts through a co-clustering algorithm. The dependency among stories of a topic is tracked by exploring the textual-visual novelty and redundancy of stories. A novel topic structure that chains the dependencies of stories is then presented to facilitate the fast navigation of the news topic. By pruning the peripheral and redundant news stories in the topic structure, a main thread is extracted for autodocumentary

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 22, Number 5, February 2006, 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.

Ontological Implications Of The Levels Of Conceptual Interoperability Model, Andreas Tolk, Charles D. Turnitsa, Saikou Y. Diallo

Computational Modeling & Simulation Engineering Faculty Publications

The Levels of Conceptual Interoperability Model (LCIM) was developed to cope with the different layers of interoperation of modeling & simulation applications. It introduced technical, syntactic, semantic, pragmatic, dynamic, and conceptual layers of interoperation and showed how they are related to the ideas of integratability, interoperability, and composability. This paper will be presented in the invited session "Ontology Driven Interoperability for Agile Applications using Information Systems: Requirements and Applications for Agent Mediated Decision Support" at WMSCI 2006.

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 22, Number 4, January 2006, 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.

A Tabu Search Algorithm To Minimize The Makespan For The Unrelated Parallel Machines Scheduling Problem With Setup Times, Magdy Helal, Ghaith Rabadi, Ameer Al-Salem

Engineering Management & Systems Engineering Faculty Publications

In this paper we propose a tabu search implementation to solve the unrelated parallel machines scheduling problem with sequence- and machine- dependent setup times to minimize the schedules makespan. The problem is NP-hard and finding an optimal solution efficiently is unlikely. Therefore, heuristic techniques are more appropriate to find near-optimal solutions. The proposed tabu search algorithm uses two phases of perturbation schemes: the intra-machine perturbation, which optimizes the sequence of jobs on the machines, and the inter-machine perturbation, which balances the assignment of the jobs to the machines. We compare the proposed algorithm to an existing one that addressed the …

Pocket Deformable Mirror For Adaptive Optics Applications, Leonid A. Beresnev, Mikhail Vorontsov, Peter Wangsness

Electrical and Computer Engineering Faculty Publications

Adaptive/active optical elements are designed to improve optical system performance in the presence of phase aberrations. For atmospheric optics and astronomical applications, an ideal deformable mirror should have sufficient frequency bandwidth for compensation of fast changing wave front aberrations induced by either atmospheric turbulences or by turbulent air flows surrounding a flying object (air optical effects). In many applications, such as atmospheric target tracking, remote sensing from flying aircraft, boundary layer imaging, laser communication and laser beam projection over near horizontal propagation paths the phase aberration frequency bandwidth can exceed several kHz. These fast-changing aberrations are currently compensated using relatively …

Adaptive Beam Director For A Tiled Fiber Array, Mikhail Vorontsov, Jim F. Riker, Ernst Polnau, Svetlana Lachinova, Venkata S. Rao Gudimetla

Electrical and Computer Engineering Faculty Publications

We present the concept development of a novel atmospheric compensation system based on adaptive tiled fiber array architecture operating with target-in-the-loop scenarios for directed beam applications. The adaptive tiled fiber array system is integrated with adaptive beam director (ABD). Wavefront control and sensing functions are performed directly on the beam director telescope primary mirror. The beam control of the adaptive tiled fiber array aims to compensate atmospheric turbulence-induced dynamic phase aberrations and results in a corresponding brightness increase on the illuminated extended object. The system is specifically designed for tiled fiber system architectures operating in strong intensity scintillation and speckle-modulation …

An Experience On Problem Based Learning In An Engineering Faculty, Cüneyt Güzeli̇ş

Turkish Journal of Electrical Engineering and Computer Sciences

In 2001, Engineering Faculty of Dokuz Eylül University has started to change its undergraduate education in a radical way. As being among the first examples in the world, the Departments of Electrical and Electronics, Geological and Geophysics Engineering in 2002 and Mining Engineering Department in 2003 have adopted the so-called "modular-staged problem based active learning system". The system is based on real engineering problems which values teamwork and the integration of information from different disciplines and it places the student at the center of the learning process. The faculty has learned many things and it needs to learn many other …

An International Dialogue On Electrical Engineering Education, Thales Papazoglou

Turkish Journal of Electrical Engineering and Computer Sciences

. PAPAZOGLOU Chairman -- ELCOMPEET'04 Technological Educational Institute of Crete, GREECE e-mail: [email protected]

Online Learning Resource For Smooth Transition From High School To Engineering Education, Riadh W. Y. Habash, Christine Suurtaam, Mustapha C. E. Yagoub, Karima Kara, Ghanim Ibrahim

Turkish Journal of Electrical Engineering and Computer Sciences

Although high school mathematics curriculum documents in Ontario, Canada have, for the past two decades, made calls for classroom practices involving both modeling and applications, students still experience difficulties in moving into a university engineering program. This paper discusses a new initiative in online learning and the teaching of mathematical modeling and applications in engineering education at the University of Ottawa, Canada. In particular, we explore how modeling and Internet technologies can enhance progress in engineering education.

A Comprehensive Analysis Of The Effect Of Microarray Data, Monika Ray, Johannes Freudenberg, Weixiong Zhang

All Computer Science and Engineering Research

Background: Microarray data preprocessing, such as differentially expressed (DE) genes selection, is performed prior to higher level statistical analysis in order to account for technical variability. Preprocessing for the Affymetrix GeneChip includes background correction, normalisation and summarisation. Numerous preprocessing methods have been proposed with little consensus as to which is the most suitable. Furthermore, due to poor concordance among results from cross-platform analyses, protocols are being developed to enable cross-platform reproducibility. However, the effect of data analysis on a single platform is still unknown. The objective of our study is two-fold: first to determine whether there is consistency in the …

The Meta-Theory Of Q_0 In The Calculus Of Inductive Constructions, Master's Thesis, May 2006, Li-Yang Tan

All Computer Science and Engineering Research

The notion of a proof is central to all of mathematics. In the language of formal logic, a proof is a finite sequence of inferences from a set of axioms, and any statement one yields from such a finitistic procedure is called a theorem. For better or for worse, this is far from the form a traditional mathematical proof takes. Mathematicians write proofs that omit routine logical steps, and details deemed tangential to the central result are often elided. These proofs are fuzzy and human-centric, and a great amount of context is assumed on the part of the reader. While …

The Remote-Clique Problem Revisited, Benjamin E. Birnbaum

All Computer Science and Engineering Research

Given a positive integer k and a complete graph with non-negative edge weights that satisfy the triangle inequality, the remote-clique problem is to find a subset of k vertices having a maximum-weight induced subgraph. A greedy algorithm for the problem has been shown to have an approximation ratio of 4, but this analysis was not shown to be tight. In this thesis, we present an algorithm called d-Greedy Augment that generalizes this greedy algorithm (they are equivalent when d = 1). We use the technique of factor-revealing linear programs to prove that d-Greedy Augment, which has a running time of …

Acceleration Of Profile-Hmm Search For Protein Sequences In Reconfigurable Hardware - Master's Thesis, May 2006 , Rahul Pratap Maddimsetty

All Computer Science and Engineering Research

Profile Hidden Markov models are highly expressive representations of functional units, or motifs, conserved across protein sequences. Profile-HMM search is a powerful computational technique that is used to annotate new sequences by identifying occurrences of known motifs in them. With the exponential growth of protein databases, there is an increasing demand for acceleration of such techniques. We describe an accelerator for the Viterbi algorithm using a two-stage pipelined design in which the first stage is implemented in parallel reconfigurable hardware for greater speedup. To this end, we identify algorithmic modifications that expose a high level of parallelism and characterize their …

Preserving Performance Of Byzantine Fault Tolerant Replica Groups In The Presence Of Malicious Clients, Sajeeva L. Pallemulle, Haraldur D. Thorvaldsson, Kenneth J. Goldman

All Computer Science and Engineering Research

The Castro and Liskov Byzantine Fault Tolerance protocol for replicated state machines (CLBFT) provides a practical means of tolerating arbitrary replica failures in replicated passive data servers. For better performance, CLBFT uses Message Authentication Codes (MAC) instead of public Key cryptography to authenticate messages and preserves replica consistency even in the presence of malicious clients. However, CLBFT is susceptible to potential attacks by malicious clients using corrupted MACs to force replica groups into expensive configuration changes repeatedly. While not affecting correctness, this vulnerability can seriously impair the performance of the replica group. We propose modifications to CLBFT that address this …

Mixed-Integer Linear Programming Solution To Multi-Robot Task Allocation Problem, Nuzhet Atay, Burchan Bayazit

All Computer Science and Engineering Research

Multi-robot systems require efficient and accurate planning in order to perform mission-critical tasks. This paper introduces a mixed-integer linear programming solution to coordinate multiple heterogenenous robots for detecting and controlling multiple regions of interest in an unknown environment. The objective function contains four basic requirements of a multi-robot system serving this purpose: control regions of interest, provide communication between robots, control maximum area and detect regions of interest. Our solution defines optimum locations of robots in order to maximize the objective function while efficiently satisfying some constraints such as avoiding obstacles and staying within the speed capabilities of the robots. …

Smooth Surface Reconstruction Using Charts For Medical Data, Cindy Grimm, Tao Ju

All Computer Science and Engineering Research

We present a surface reconstruction technique that constructs a smooth analytic surface from scattered data. The technique is robust to noise and both poorly and non-uniformly sampled data, making it well-suited for use in medical applications. In addition, the surface can be parameterized in multiple ways, making it possible to represent additional data, such as electromagnetic potential, in a different (but related) coordinate system to the geometric one. The parameterization technique also supports consistent parameterizations of multiple data sets.

The Design, Modeling, And Implementation Of Group Scheduling For Isolation Of Computations From Adversarial Interference, Terry Tidwell, Noah Watkins, Venkita Subramonian, Douglas Niehaus, Armando Gill, Migliaccio

All Computer Science and Engineering Research

To isolate computations from denial of service (DoS) attacks and other forms of adversarial interference, it is necessary to constrain the effects of interactions among computations. This paper makes four contributions to research on isolation of computations from adversarial interference: (1) it describes the design and implementation of a kernel level scheduling policy to control the effects of adversarial attacks on computations’ execution; (2) it presents formal models of the system components that are involved in a representative DoS attack scenario; (3) it shows how model checking can be used to analyze that example scenario, under default Linux scheduling semantics …

Smooth Key-Framing Using The Image Plane, Leon Barrett, Cindy Grimm

All Computer Science and Engineering Research

This paper demonstrates the use of image-space constraints for key frame interpolation. Interpolating in image-space results in sequences with predictable and controlable image trajectories and projected size for selected objects, particularly in cases where the desired center of rotation is not fixed or when the key frames contain perspective distortion changes. Additionally, we provide the user with direct image-space control over {\em how} the key frames are interpolated by allowing them to directly edit the object's projected size and trajectory. Image-space key frame interpolation requires solving the inverse camera problem over a sequence of point constraints. This is a variation …

Use Of Gene Expression Profiling And Machine Learning To Understand And Predict Primary Graft Dysfunction, Monika Ray, Sekhar Dharmarajan, Johannes Freudenberg, Weixiong Zhang, Alexander G. Patterson

All Computer Science and Engineering Research

No abstract provided.

Design Of Routers For Diversified Networks, Jonathan Turner

All Computer Science and Engineering Research

No abstract provided.

Extending Byzantine Fault Tolerance To Replicated Clients, Ian Wehrman, Sajeeva L. Pallemulle, Kenneth J. Goldman

All Computer Science and Engineering Research

Byzantine agreement protocols for replicated deterministic state machines guarantee that externally requested operations continue to execute correctly even if a bounded number of replicas fail in arbitrary ways. The state machines are passive, with clients responsible for any active ongoing application behavior. However, the clients are unreplicated and outside the fault-tolerance boundary. Consequently, agreement protocols for replicated state machines do not guarantee continued correct execution of long-running client applications. Building on the Castro and Liskov Byzantine Fault Tolerance protocol for unreplicated clients (CLBFT), we present a practical algorithm for Byzantine fault-tolerant execution of long-running distributed applications in which replicated deterministic …

Design And Analysis Of An Accelerated Seed Generation Stage For Blastp On The Mercury System - Master's Thesis, August 2006, Arpith Jacob

All Computer Science and Engineering Research

NCBI BLASTP is a popular sequence analysis tool used to study the evolutionary relationship between two protein sequences. Protein databases continue to grow exponentially as entire genomes of organisms are sequenced, making sequence analysis a computationally demanding task. For example, a search of the E. coli. k12 proteome against the GenBank Non-Redundant database takes 36 hours on a standard workstation. In this thesis, we look to address the problem by accelerating protein searching using Field Programmable Gate Arrays. We focus our attention on the BLASTP heuristic, building on work done earlier to accelerate DNA searching on the Mercury platform. We …

Design Of A Diversified Network Substrate, Jonathan Turner

All Computer Science and Engineering Research

A diversified network substrate enables multiple end-to-end metanetworks to co-exist within a shared physical infrastructure. Metanetworks are implemented by metarouters, hosted by substrate routers, and metarouters are connected by metalinks. The substrate allocates resources (both link bandwidth and processing resources) to metarouters based on advance reservations received from metanetwork planning systems. It also enables dynamic creation of access metalinks, connecting end systems to metarouters, and supports mobility of end systems under the control of their metanetworks. This report defines a model for a diversified internet and presents a detailed design of the substrate that enables metanetworks to co-exist. The design …

Discovering Functional Modules By Clustering Gene Co-Expression Networks, Jianhua Ruan, Weixiong Zhang

All Computer Science and Engineering Research

Identification of groups of functionally related genes from high throughput gene expression data is an important step towards elucidating gene functions at a global scale. Most existing approaches treat gene expression data as points in a metric space, and apply conventional clustering algorithms to identify sets of genes that are close to each other in the metric space. However, they usually ignore the topology of the underlying biological networks. In this paper, we propose a network-based clustering method that is biologically more realistic. Given a gene expression data set, we apply a rank-based transformation to obtain a sparse co-expression network, …