Engineering Commons^™

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 …

Recommendations For A Standardized Program Management Office (Pmo) Time Compliance Network Order (Tcno) Patching Process, Michael Czumak Iii

Theses and Dissertations

Network security is a paramount concern for organizations utilizing computer technology, and the Air Force is no exception. Network software vulnerability patching is a critical determinant of network security. The Air Force deploys these patches as Time Compliance Network Orders (TCNOs), which together with associated processes and enforced timelines ensure network compliance. While the majority of the network assets affected by this process are Air Force owned and operated, a large number are maintained by external entities known as Program Management Offices (PMOs). Although these externally controlled systems provide a service to the Air Force and reside on its network, …

Towards The Development Of A Defensive Cyber Damage And Mission Impact Methodology, Larry W. Fortson Jr.

Theses and Dissertations

The purpose of this research is to establish a conceptual methodological framework that will facilitate effective cyber damage and mission impact assessment and reporting following a cyber-based information incidents. Joint and service guidance requires mission impact reporting, but current efforts to implement such reporting have proven ineffective. This research seeks to understand the impediments existing in the current implementation and to propose an improved methodology. The research employed a hybrid historical analysis and case study methodology for data collection through extensive literature review, examination of existing case study research and interviews with Air Force members and civilian personnel employed as …

Stochastic Estimation And Control Of Queues Within A Computer Network, Nathan C. Stuckey

Theses and Dissertations

An extended Kalman filter is used to estimate size and packet arrival rate of network queues. These estimates are used by a LQG steady state linear perturbation PI controller to regulate queue size within a computer network. This paper presents the derivation of the transient queue behavior for a system with Poisson traffic and exponential service times. This result is then validated for ideal traffic using a network simulated in OPNET. A more complex OPNET model is then used to test the adequacy of the transient queue size model when non-Poisson traffic is combined. The extended Kalman filter theory is …

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 …

Quality Of Service Routing Strategy Using Supervised Genetic Algorithm, Zhaoxia Wang, Yugeng Sun, Zhiyong Wang, Huayu Shen

Research Collection School Of Computing and Information Systems

A supervised genetic algorithm (SGA) is proposed to solve the quality of service (QoS) routing problems in computer networks. The supervised rules of intelligent concept are introduced into genetic algorithms (GAs) to solve the constraint optimization problem. One of the main characteristics of SGA is its searching space can be limited in feasible regions rather than infeasible regions. The superiority of SGA to other GAs lies in that some supervised search rules in which the information comes from the problems are incorporated into SGA. The simulation results show that SGA improves the ability of searching an optimum solution and accelerates …

Towards Efficient Planning For Real World Partially Observable Domains, Pradeep R. Varakantham

Research Collection School Of Computing and Information Systems

My research goal is to build large-scale intelligent systems (both single- and multi-agent) that reason with uncertainty in complex, real-world environments. I foresee an integration of such systems in many critical facets of human life ranging from intelligent assistants in hospitals to offices, from rescue agents in large scale disaster response to sensor agents tracking weather phenomena in earth observing sensor webs, and others. In my thesis, I have taken steps towards achieving this goal in the context of systems that operate in partially observable domains that also have transitional (non-deterministic outcomes to actions) uncertainty. Given this uncertainty, Partially Observable …

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 …

Filling The Ontology Space For Coalition Battle Management Language, Charles Turnitsa, Curtis Blais, Andreas Tolk

Computational Modeling & Simulation Engineering Faculty Publications

The Coalition Battle Management Language is a language for representing and exchanging plans, orders, and reports across live, constructive and robotic forces in multi-service, multi-national and multi-organizational operations. Standardization efforts in the Simulation Interoperability Standards Organization seek to define this language through three parallel activities: (1) specify a sufficient data model to unambiguously define a set of orders using the Joint Command, Control, and Consultation Information Exchange Data Model (JC3IEDM) as a starting point; (2) develop a formal grammar (lexicon and production rules) to formalize the definition of orders, requests, and reports; (3) develop a formal battle management ontology to …

Applying The Levels Of Conceptual Interoperability Model In Support Of Integratability, Interoperability, And Composability For System-Of-Systems Engineering, Andreas Tolk, Saikou Y. Diallo, Charles D. Turnitsa

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. The model was successfully applied in various domains of systems, cybernetics, and informatics.

Some Peer-To-Peer, Democratically And Voluntarily Produced Thoughts About 'The Wealth Of Networks: How Social Production Transforms Markets And Freedom,' By Yochai Benkler, Ann Bartow

Law Faculty Scholarship

In this review essay, Bartow concludes that The Wealth of Networks: How Social Production Transforms Markets and Freedom by Yochai Benkler is a book well worth reading, but that Benkler still has a bit more work to do before his Grand Unifying Theory of Life, The Internet, and Everything is satisfactorily complete. It isn't enough to concede that the Internet won't benefit everyone. He needs to more thoroughly consider the ways in which the lives of poor people actually worsen when previously accessible information, goods and services are rendered less convenient or completely unattainable by their migration online. Additionally, the …

Web-Based Library For Student Projects/Theses And Faculty Research Papers, Rudy Senjaya

Theses Digitization Project

The purpose of this project is to make available a Web-based Library, a web application developed for the Department of Computer Science at CSUSB to manage student projects/theses and faculty papers. The project is designed in accordance with Model-View-Controller (MVC) design pattern using the Jakarta Struts framework and iBATIS Data Mapper framework from Apache Software Foundation, JavaServer Pages (JSP), and MySQL database.

Improvement To The Data Logging Capability Of A Cough Monitoring System, Matthew Barlow

Inquiry: The University of Arkansas Undergraduate Research Journal

Data logging capability of a previously developed self contained cough recorder using an accelerometer as the sensing element is improved by using a secure digital memory card for later retrieval on a computer. Firmware is developed to enhance the functionality of the cough recorder. Existing libraries are modified for increased write rates. Increased writing speed allows 8-bit sampling at rates exceeding 8kHz, allowing for detailed time and frequency domain analysis. Additional features have also been developed to enable easy management of recordings, such as a file system compatibility with Microsoft Windows., and unique file names for each recording.

Learning Geometry-Free Face Re-Lighting, Thomas Brendan Moore

Electronic Theses and Dissertations

The accurate modeling of the variability of illumination in a class of images is a fundamental problem that occurs in many areas of computer vision and graphics. For instance, in computer vision there is the problem of facial recognition. Simply, one would hope to be able to identify a known face under any illumination. On the other hand, in graphics one could imagine a system that, given an image, the illumination model could be identified and then used to create new images. In this thesis we describe a method for learning the illumination model for a class of images. Once …

An Analog Evolvable Hardware Device For Active Control, Saranyan A. Vigraham

Browse all Theses and Dissertations

The field of Evolvable Hardware (EH) has recently gained a lot of interest due to the novel methodology it offers for designing electrical circuits and machines. EH techniques involve configuring a reconfigurable hardware platform with the aid of learning engines such as evolutionary algorithms. The EH devices normally act as closed loop controllers with the capability of learning necessary control laws adaptively. Current EH practices have several shortcomings, which have restricted their use as reliable controllers. This dissertation will present an improved EH device based on behavioral reconfigurability that addresses the current open challenges in the field of analog Evolvable …

Report On Realizing Practical Approximate And Distributed Reasoning For Ontologies, Pascal Hitzler, Peter Dolog, Perry Groot, Michel Klein, Malgorzata Mochol, Lyndon Nixon, Linda Peelen, Sebastian Rudolph, Stefan Schlobach, Heiner Stuckenschmidt, Denny Vrandecic, Holger Wache

Computer Science and Engineering Faculty Publications

We report on the progress we have made in KnowledgeWeb on the topic of scalable ontology reasoning. This deliverable contains contributions which advance the state of the art on a broad front, covering query approximation, ABox reasoning and TBox reasoning. It also covers approximation for uncertainty handling and for multi-perspective reasoning.

Directflow: A Domain-Specific Language For Information-Flow Systems, Andrew P. Black, Chuan-Kai Lin

Computer Science Faculty Publications and Presentations

Programs that process streams of information are commonly built by assembling reusable information-flow components. In some systems the components must be chosen from a pre-defined set of primitives; in others the programmer can create new custom components using a general-purpose programming language. Neither approach is ideal: restricting programmers to a set of primitive components limits the expressivity of the system, while allowing programmers to define new components in a general-purpose language makes it difficult or impossible to reason about the composite system. We advocate defining information-flow components in a domain-specific language (DSL) that enables us to infer the properties of …

Personal Information Management. A Framework For Development Of Personalisable Web Based Services, Christopher Fuchs

Theses

The thesis research proposed herein will model, analyse and implement strategies for the development of personalised services. The goal of the research work is to design and implement a framework which supports developers by minimising the effort required in implementing personalised services. This includes the ability to react to localisation changes and to present proper information. An overall design goal is the independency of most components from each other which will be attained through the use of standard technologies and protocols and the consistent use of a component model. The result will include the proposed framework and the analyses of …

Towards A Self-Calibrating Video Camera Network For Content Analysis And Forensics, Imran Junejo

Electronic Theses and Dissertations

Due to growing security concerns, video surveillance and monitoring has received an immense attention from both federal agencies and private firms. The main concern is that a single camera, even if allowed to rotate or translate, is not sufficient to cover a large area for video surveillance. A more general solution with wide range of applications is to allow the deployed cameras to have a non-overlapping field of view (FoV) and to, if possible, allow these cameras to move freely in 3D space. This thesis addresses the issue of how cameras in such a network can be calibrated and how …

Learning, Detection, Representation, Indexing And Retrieval Of Multi-Agent Events In Videos, Asaad Hakeem

Electronic Theses and Dissertations

The world that we live in is a complex network of agents and their interactions which are termed as events. An instance of an event is composed of directly measurable low-level actions (which I term sub-events) having a temporal order. Also, the agents can act independently (e.g. voting) as well as collectively (e.g. scoring a touch-down in a football game) to perform an event. With the dawn of the new millennium, the low-level vision tasks such as segmentation, object classification, and tracking have become fairly robust. But a representational gap still exists between low-level measurements and high-level understanding of video …

Optimizing The High Dynamic Range Imaging Pipeline, Ahmet Oguz Akyuz

Electronic Theses and Dissertations

High dynamic range (HDR) imaging is a rapidly growing field in computer graphics and image processing. It allows capture, storage, processing, and display of photographic information within a scene-referred framework. The HDR imaging pipeline consists of the major steps an HDR image is expected to go through from capture to display. It involves various techniques to create HDR images, pixel encodings and file formats for storage, tone mapping for display on conventional display devices and direct display on HDR capable screens. Each of these stages have important open problems, which need to be addressed for a smoother transition to an …

Studies Of A Quantum Scheduling Algorithm And On Quantum Error Correction, Feng Lu

Electronic Theses and Dissertations

Quantum computation has been a rich field of study for decades because it promises possible spectacular advances, some of which may run counter to our classically rooted intuitions. At the same time, quantum computation is still in its infancy in both theoretical and practical areas. Efficient quantum algorithms are very limited in number and scope; no real breakthrough has yet been achieved in physical implementations. Grover's search algorithm can be applied to a wide range of problems; even problems not generally regarded as searching problems can be reformulated to take advantage of quantum parallelism and entanglement leading to algorithms which …

Image-Space Approach To Real-Time Realistic Rendering, Musawir Shah

Electronic Theses and Dissertations

One of the main goals of computer graphics is the fast synthesis of photorealistic image of virtual 3D scenes. The work presented in this thesis addresses this goal of speed and realism. In real-time realistic rendering, we encounter certain problems that are difficult to solve in the traditional 3-dimensional geometric space. We show that using an image-space approach can provide effective solutions to these problems. Unlike geometric space algorithms that operate on 3D primitives such as points, edges, and polygons, image-space algorithms operate on 2D snapshot images of the 3D geometric data. Operating in image-space effectively decouples the geometric complexity …

Behavior Of Variable-Length Genetic Algorithms Under Random Selection, Harold Stringer

Electronic Theses and Dissertations

In this work, we show how a variable-length genetic algorithm naturally evolves populations whose mean chromosome length grows shorter over time. A reduction in chromosome length occurs when selection is absent from the GA. Specifically, we divide the mating space into five distinct areas and provide a probabilistic and empirical analysis of the ability of matings in each area to produce children whose size is shorter than the parent generation's average size. Diversity of size within a GA's population is shown to be a necessary condition for a reduction in mean chromosome length to take place. We show how a …

Securitycom: A Multi-Player Game For Researching And Teaching Information Security Teams, Douglas P. Twitchell

Journal of Digital Forensics, Security and Law

A major portion of government and business organizations’ attempts to counteract information security threats is teams of security personnel. These teams often consist of personnel of diverse backgrounds in specific specialties such as network administration, application development, and business administration, resulting in possible conflicts between security, functionality, and availability. This paper discusses the use of games to teach and research information security teams and outlines research to design and build a simple, team-oriented, configurable, information security game. It will be used to study how information security teams work together to defend against attacks using a multi-player game, and to study …

Table Of Contents

Journal of Digital Forensics, Security and Law

No abstract provided.

Anaerobic Digestion: Decision Support Software, Marco Poliafico

Theses

Ireland has significant quantities of livestock; meat exportation is a vibrant sector of the economy. Environmental management of animal wastes has therefore become an important concern. On the other hand in the last decade, national and EU policy debate has highlighted the need to investigate alternative energy: in particular energy for transport.

This study investigates the quantities of animal wastes produced in Ireland and their potential treatment using Anaerobic Digestion technologies. In 2005 Ireland had over 8 millions animals (cattle and pigs) and the annual slaughter accounted for over 4.2 million of these creatures. These animals have been responsible for …

An Ad Hoc Adaptive Hashing Technique For Non-Uniformly Distributed Ip Address Lookup In Computer Networks, Christopher Martinez, Wei-Ming Lin

Electrical & Computer Engineering and Computer Science Faculty Publications

Hashing algorithms have been widely adopted for fast address look-up, which involves a search through a database to find a record associated with a given key. Hashing algorithms transforms a key into a hash value hoping that the hashing renders the database a uniform distribution with respect to the hash value. The closer to uniform hash values, the less search time required for a query. When the database is key-wise uniformly distributed, any regular hashing algorithm (bit-extraction, bit-group XOR, etc.) leads to a statistically perfect uniform hash distribution. When the database has keys with a non-uniform distribution, performance of regular …