Physical Sciences and Mathematics Commons^™

Use Of Tabu Search In A Solver To Map Complex Networks Onto Emulab Testbeds, Jason E. Macdonald

Theses and Dissertations

The University of Utah's solver for the testbed mapping problem uses a simulated annealing metaheuristic algorithm to map a researcher's experimental network topology onto available testbed resources. This research uses tabu search to find near-optimal physical topology solutions to user experiments consisting of scale-free complex networks. While simulated annealing arrives at solutions almost exclusively by chance, tabu search incorporates the use of memory and other techniques to guide the search towards good solutions. Both search algorithms are compared to determine whether tabu search can produce equal or higher quality solutions than simulated annealing in a shorter amount of time. It …

Using Concept Maps To More Efficiently Create Intelligence Information Models, Christopher E. Coryell

Theses and Dissertations

Information models are a critical tool that enables intelligence customers to quickly and accurately comprehend U.S. intelligence agency products. The Knowledge Pre-positioning System (KPS) is the standard repository for information models at the National Air and Space Intelligence Center (NASIC). The current approach used by NASIC to build a KPS information model is laborious and costly. Intelligence analysts design an information model using a manual, butcher-paper-based process. The output of their work is then entered into KPS by either a single NASIC KPS "database modeler" or a contractor (at a cost of roughly $100K to the organization). This thesis proposes …

Implementation And Optimization Of The Advanced Encryption Standard Algorithm On An 8-Bit Field Programmable Gate Array Hardware Platform, Ryan J. Silva

Theses and Dissertations

The contribution of this research is three-fold. The first is a method of converting the area occupied by a circuit implemented on a Field Programmable Gate Array (FPGA) to an equivalent as a measure of total gate count. This allows direct comparison between two FPGA implementations independent of the manufacturer or chip family. The second contribution improves the performance of the Advanced Encryption Standard (AES) on an 8-bit computing platform. This research develops an AES design that occupies less than three quarters of the area reported by the smallest design in current literature as well as significantly increases area efficiency. …

Hardware Virtualization Applied To Rootkit Defense, Douglas P. Medley

Theses and Dissertations

This research effort examines the idea of applying virtualization hardware to enhance operating system security against rootkits. Rootkits are sets of tools used to hide code and/or functionality from the user and operating system. Rootkits can accomplish this feat through using access to one part of an operating system to change another part that resides at the same privilege level. Hardware assisted virtualization (HAV) provides an opportunity to defeat this tactic through the introduction of a new operating mode. Created to aid operating system virtualization, HAV provides hardware support for managing and saving multiple states of the processor. This hardware …

On-Demand Key Distribution For Mobile Ad-Hoc Networks, Daniel F. Graham

Theses and Dissertations

Mobile ad-hoc networks offer dynamic portable communication with little or no infrastructure. While this has many benefits, there are additional shortcomings specific to wireless communication that must be addressed. This research proposes gossip-based on-demand key distribution as a means to provide data encryption for mobile ad-hoc networks. This technique uses message keys to avoid encrypting and decrypting a message at every node. Other optimizations used include secure channel caching and joint rekey messages. The use of gossip makes the scheme robust to node failure. Experimental results show only a 15% increase in end-to-end delay with a node failure rate of …

Performance Evaluation Of Ad Hoc Routing In A Swarm Of Autonomous Aerial Vehicles, Matthew T. Hyland

Theses and Dissertations

This thesis investigates the performance of three mobile ad hoc routing protocols in the context of a swarm of autonomous unmanned aerial vehicles (UAVs). It is proposed that a wireless network of nodes having an average of 5.1774 log n neighbors, where n is the total number of nodes in the network, has a high probability of having no partitions. By decreasing transmission range while ensuring network connectivity, and implementing multi-hop routing between nodes, spatial multiplexing is exploited whereby multiple pairs of nodes simultaneously transmit on the same channel. The proposal is evaluated using the Greedy Perimeter Stateless Routing (GPSR), …

Analysis Of Routing Worm Infection Rates On An Ipv4 Network, James Gorsuch

Theses and Dissertations

Malicious logic, specifically worms, has caused monetary expenditure problems to network users in the past. Worms, like Slammer and Code Red, have infected thousands of systems and brought the Internet to a standstill. This research examines the ability of the original Slammer worm, the Slammer based routing worm proposed by Zou et al, and a new Single Slash Eight (SSE) routing worm proposed by this research to infect vulnerable systems within a given address space. This research investigates the Slammer worm's ability to generate a uniform random IP addresses in a given address space. Finally, a comparison of the speed …

Performance Evaluation For Hybrid Architectures, Praveen Krishnamurthy

All Computer Science and Engineering Research

In this dissertation we discuss methologies for estimating the performance of applications on hybrid architectures, systems that include various types of computing resources (e.g. traditional general-purpose processors, chip multiprocessors, reconfigurable hardware). A common use of hybrid architectures will be to deploy coarse pipeline stages of application on "suitable" compute units with communication path for transferring data. The first problem we focus on relates to the sizing the data queues between the different processing elements of an hybrid system. Much of the discussion centers on our analytical models that can be used to derive performance metrics of interest such as, throughput …

Mining Generalized Associations Of Semantic Relations From Textual Web Content, Tao Jiang, Ah-Hwee Tan, We Wang

Research Collection School Of Computing and Information Systems

Traditional text mining techniques transform free text into flat bags of words representation, which does not preserve sufficient semantics for the purpose of knowledge discovery. In this paper, we present a two-step procedure to mine generalized associations of semantic relations conveyed by the textual content of Web documents. First, RDF (resource description framework) metadata representing semantic relations are extracted from raw text using a myriad of natural language processing techniques. The relation extraction process also creates a term taxonomy in the form of a sense hierarchy inferred from WordNet. Then, a novel generalized association pattern mining algorithm (GP-Close) is applied …

Soldier/Hardware-In-The-Loop Simulation-Based Combat Vehicle Duty Cycle Measurement: Duty Cycle Experiment 2, Mark Brudnak, Mike Pozolo, Victor Paul, Syed Mohammad, Marc Compere, Et Al.

Publications

This paper describes a human-in-the-loop motion-based simulator interfaced to hybrid-electric power system hardware both of which were used to measure the duty cycle of a combat vehicle in a virtual simulation environment. The project discussed is a greatly expanded follow-on to the experiment published in [1]. This paper is written in the context of [1] and therefore highlights the enhancements. The most prominent of these enhancements is the integration (in real-time) of the Power & Electric System Integration Lab (P&E SIL) with a motion base simulator by means of a “long haul” connection over the Internet (a geographical distance of …

Atmospheric Turbulence Compensation Of Point Source Images Using Asynchronous Stochastic Parallel Gradient Descent Technique On Amos 3.6 M Telescope, Mikhail Vorontsov, Jim F. Riker, Gary W. Carhart, Venkata S. Rao Gudimetla, Leonid A. Beresnev, Thomas Weyrauch

Electrical and Computer Engineering Faculty Publications

The Stochastic Parallel Gradient Descent Technique-based Adaptive Optics (SPGD-AO) system described in this presentation does not use a conventional wavefront sensor. It uses a metric signal collected by a single pixel detector placed behind a pinhole in the image plane to drive three deformable mirrors (DMs). The system is designed to compensate the image for turbulence effects. The theory behind this method is described in detail in [1]. However this technique, while widely simulated and tested in the laboratory, was not yet verified in astronomical field site experiments. During the month of May 2007, a series of experiments with SPGD-AO …

Adaptive Optics Performance Over Long Horizontal Paths: Aperture Effects In Multi-Conjugate Adaptive Optical Systems, Miao Yu, Mikhail Vorontsov, Svetlana Lachinova, Jim F. Riker, Venkata S. Rao Gudimetla

Electrical and Computer Engineering Faculty Publications

We analyze various scenarios of the aperture effects in adaptive optical receiver-type systems when inhomogeneities of the wave propagation medium are distributed over long horizontal propagation path, or localized in a few thin layers remotely located from the receiver telescope pupil. Phase aberration compensation is performed using closed-loop control architectures based on phase conjugation and decoupled stochastic parallel gradient descent (DSPGD) control algorithms. Both receiver system aperture diffraction effects and the impact of wave-front corrector position on phase aberration compensation efficiency are analyzed for adaptive systems with single or multiple wave-front correctors.

Cs 141-01: Computer Programming - I, Michael Ondrasek

Computer Science & Engineering Syllabi

This course provides a general introduction to the fundamentals of computer programming. Examples from and applications to a broad range of problems are given. No prior knowledge of programming is assumed. The concepts covered will be applied to the Java programming language. Students must register for both lecture and one laboratory section. 4 credit hours. Prerequisite: MTH 127 (College Algebra) or equivalent.

Cs 142-01: Computer Programming Ii, Haiyun Bian

Computer Science & Engineering Syllabi

Concepts introduced in CS 141 are developed in greater detail and depth with the Java programming language. Topics include object oriented programming, graphics, development of user interfaces and exception handling. Student must register for both lecture and one lab section.

Cs 240-01: Introduction To Computer Science I, Dale E. Nelson

Computer Science & Engineering Syllabi

No abstract provided.

Cs 241-01: Computer Science Ii, Eric Maston

Computer Science & Engineering Syllabi

This course is the second in the Introduction to Computer Science (24X) series. It focuses on object oriented concepts and an introduction to data structures.

Cs 209-01: Computer Programming For Business Ii, Dennis Kellermeier

Computer Science & Engineering Syllabi

CS 209 is the second of a two quarter sequence in programming for business students. It is required for Management Information Science majors. The courses are designed to help students achieve a high degree of facility in intermediate level programming.

Cs 241-02, 03: Introduction To Computer Science Ii, Haiyun Bian

Computer Science & Engineering Syllabi

This course is the second in the three course sequence "Introduction to Computer Science" offered by the Computer Science department, WSU. Concepts introduced in CS 240 are developed in greater detail and depth with the Java programming language. Topics include object oriented programming, graphics, development of user interfaces and exception handling. Student must register for one lecture section and one lab section.

Cs 340-01: Programming Language Workshop In Java, Ronald F. Taylor

Computer Science & Engineering Syllabi

This course is designed as a self-study in Java. You are expected to work independently to learn the Java language and solve a set of programming problems assigned to you using latest Java SDK available at http:/java.sun.com or other software as approved by the instructor. There are no exams. We officially meet only once in a quarter. However, I will be available in the posted office hours for clarifications and general discussion of the programming assignments. Do not expect support in debugging badly documented cod~.

Cs 242-01: Computer Science Iii, Eric Maston

Computer Science & Engineering Syllabi

This is the third and final course in the Introduction to Computer Science series. This course focuses on data structures with abstract data types, such as trees, stacks, queues and tables.

Cs 405/605-01: Introduction To Database Management Systems, Guozhu Dong

Computer Science & Engineering Syllabi

Survey of logical and physical aspects of database management systems. Data models including entity-relationship (ER) and relational are presented. Physical implementation (data organization and indexing) methods are discussed. Query languages including SQL, relational algebra, relational calculus, and QBE are introduced. Students will also gain experience in creating and manipulating a database.

The course is mostly concerned with the design and querying of databases. A follow up course, CS701, is concerned with the design of system functions for managing databases.

Cs 409/609-01: Principles Of Artificial Intelligence, Shaojun Wang

Computer Science & Engineering Syllabi

No abstract provided.

Cs 466/666-01: Introduction To Formal Languages, Thomas Sudkamp

Computer Science & Engineering Syllabi

CS 466/666 is an introduction to formal language and automata theory. In this course we will examine methods for defining syntax of languages and recognizing patterns: the languages can be defined using a rule-based systems called grammars and patterns can be recognized by the computations of finite state machines. Along with presenting the fundamentals of these two topics, the course will develop and investigate the relationships between language definition and pattern recognition. The text will be the third edition of Languages and Machines: An Introduction to the Theory of Computer Science.

Cs 781-01: Compiler Design And Construction Ii, Krishnaprasad Thirunarayan

Computer Science & Engineering Syllabi

This course is a continuation ofCS780 covering the theory and practice of compiler design. Topics emphasized are semantic analysis, code generation, and optimization.

Cs 765-01: Foundations Of Neurocomputation, Mateen M. Rizki

Computer Science & Engineering Syllabi

This course is designed to help you develop a solid understanding of neural network algorithms and architectures. At the end of this course you should be able to read and critically evaluate most neural network papers published in major journals, (e.g. IEEE Transaction on Neural Networks, Neural Networks, and Neural Computation). In addition, you should be able to implement a broad range of network architectures and learning algorithms for a variety of applications.

Cs 701-01: Database Systems And Design, Soon M. Chung

Computer Science & Engineering Syllabi

Introduction of DB design concepts and operating principles of database systems.

Cs 740-01: Algorithms, Complexity And The Theory Of Computability, Thomas Sudkamp

Computer Science & Engineering Syllabi

The objective of this course is to use the formal algorithmic system provided by Turing machines as a tool to analyze the complexity of decision and optimization problems and the algorithms that solve them. The topics to be covered include

•the definition of the time and space complexity of a deterministic algorithm

•the classes of deterministic polynomial and non-polynomial time languages

•the complexity of nondeterministic algorithms

•the P=NP question (relationship between solvability by deterministic and
nondeterministic polynomial time algorithms)

•the implications oaf solution to the P=NP question

•NP completeness and examples of NP complete problems

•classes of NP complete problems …

Cs 790-01: Introduction To Parallel Algorithms, Natsuhiko Futamura

Computer Science & Engineering Syllabi

Low-cost parallel computers such as PC clusters are becoming available, and many previously unsolvable problems can be solved using such computers. However, designing algorithms that perform well on parallel computers is often challenging. The focus of this course is on learning how to design algorithms for parallel computers and how to evaluate them.

Cs 317-01: Numerical Methods Ii, Ronald F. Taylor

Computer Science & Engineering Syllabi

Continuation of CS/MTH/316/516. Introduction to numerical methods used in the sciences. Methods for solving matrix eigenvalue problems, initial value and boundary value problem for ordinary differential equations (ODEs). Study of standard types of partial differential equations (PDEs) with applications. Solution techniques for systems of nonlinear equations. Discussion of sources of error in numerical methods. Special topics and applications presented as schedule permits. Four credit hours.

Ceg 434/634-01: Concurrent Software Design, Natsuhiko Futamura

Computer Science & Engineering Syllabi

No abstract provided.