Computer and Systems Architecture Commons^™

Dynamic Polymorphic Reconfiguration To Effectively “Cloak” A Circuit’S Function, Jeffrey L. Falkinburg

Theses and Dissertations

Today's society has become more dependent on the integrity and protection of digital information used in daily transactions resulting in an ever increasing need for information security. Additionally, the need for faster and more secure cryptographic algorithms to provide this information security has become paramount. Hardware implementations of cryptographic algorithms provide the necessary increase in throughput, but at a cost of leaking critical information. Side Channel Analysis (SCA) attacks allow an attacker to exploit the regular and predictable power signatures leaked by cryptographic functions used in algorithms such as RSA. In this research the focus on a means to counteract …

A Multi Agent System For Flow-Based Intrusion Detection Using Reputation And Evolutionary Computation, David Hancock

Theses and Dissertations

The rising sophistication of cyber threats as well as the improvement of physical computer network properties present increasing challenges to contemporary Intrusion Detection (ID) techniques. To respond to these challenges, a multi agent system (MAS) coupled with flow-based ID techniques may effectively complement traditional ID systems. This paper develops: 1) a scalable software architecture for a new, self-organized, multi agent, flow-based ID system; and 2) a network simulation environment suitable for evaluating implementations of this MAS architecture and for other research purposes. Self-organization is achieved via 1) a reputation system that influences agent mobility in the search for effective vantage …

Adaptive Quality Of Service Engine With Dynamic Queue Control, James D. Haught

Theses and Dissertations

While the current routing and congestion control algorithms in use today are often sufficient for networks with relatively static topology, these algorithms may not be sufficient for military networks where a certain level of quality of service (QoS) needs to be achieved to complete a mission. Current networking technology limits a network's ability to adapt to changes and interactions in the network, often resulting in sub-optimal performance. This research investigates the use of queue size predictions to create a network controller to optimize computer networks. These queue size predictions are made possible through the use of Kalman filters to detect …

Covert Channels Within Irc, Wayne C. Henry

Theses and Dissertations

The exploration of advanced information hiding techniques is important to understand and defend against illicit data extractions over networks. Many techniques have been developed to covertly transmit data over networks, each differing in their capabilities, methods, and levels of complexity. This research introduces a new class of information hiding techniques for use over Internet Relay Chat (IRC), called the Variable Advanced Network IRC Stealth Handler (VANISH) system. Three methods for concealing information are developed under this framework to suit the needs of an attacker. These methods are referred to as the Throughput, Stealth, and Baseline scenarios. Each is designed for …

Spear Phishing Attack Detection, David T. Merritt

Theses and Dissertations

This thesis addresses the problem of identifying email spear phishing attacks, which are indicative of cyber espionage. Spear phishing consists of targeted emails sent to entice a victim to open a malicious file attachment or click on a malicious link that leads to a compromise of their computer. Current detection methods fail to detect emails of this kind consistently. The SPEar phishing Attack Detection system (SPEAD) is developed to analyze all incoming emails on a network for the presence of spear phishing attacks. SPEAD analyzes the following file types: Windows Portable Executable and Common Object File Format (PE/COFF), Adobe Reader, …

An Architecture For Improving Timeliness And Relevance Of Cyber Incident Notifications, James L. Miller

Theses and Dissertations

This research proposes a communications architecture to deliver timely and relevant cyber incident notifications to dependent mission stakeholders. This architecture, modeled in Unified Modeling Language (UML), eschews the traditional method of pushing notifications via message as dictated in Air Force Instruction 33-138. It instead shifts to a pull or publish and subscribe method of making notifications. Shifting this paradigm improves the notification process by empowering mission owners to identify those resources on which they depend for mission accomplishment, provides a direct conduit between providing and dependent mission owners for notifications when an incident occurs, and provides a shared representation for …

Defensive Cyber Battle Damage Assessment Through Attack Methodology Modeling, Ryan T. Ostler

Theses and Dissertations

Due to the growing sophisticated capabilities of advanced persistent cyber threats, it is necessary to understand and accurately assess cyber attack damage to digital assets. This thesis proposes a Defensive Cyber Battle Damage Assessment (DCBDA) process which utilizes the comprehensive understanding of all possible cyber attack methodologies captured in a Cyber Attack Methodology Exhaustive List (CAMEL). This research proposes CAMEL to provide detailed knowledge of cyber attack actions, methods, capabilities, forensic evidence and evidence collection methods. This product is modeled as an attack tree called the Cyber Attack Methodology Attack Tree (CAMAT). The proposed DCBDA process uses CAMAT to analyze …

Rough Consensus And Running Code: Integrating Engineering Principles Into Internet Policy Debates, Christopher S. Yoo

Federal Communications Law Journal

Symposium: Rough Consensus and Running Code: Integrating Engineering Principles into Internet Policy Debates, held at the University of Pennsylvania's Center for Technology Innovation and Competition on May 6-7, 2010.

The End-To-End Argument And Application Design: The Role Of Trust, David D. Clark, Marjory S. Blumenthal

Federal Communications Law Journal

Symposium: Rough Consensus and Running Code: Integrating Engineering Principles into Internet Policy Debates, held at the University of Pennsylvania's Center for Technology Innovation and Competition on May 6-7, 2010.

Policy debates about the evolution of the Internet show varying degrees of understanding about the underlying technology. A fundamental principle of the design of the Internet, from the early 1980s, is the so-called "end-to-end argument" articulated in a seminal technical paper. Intended to provide guidance for what kind of capability is built into a network as opposed to the devices that use the network, the end-to-end argument has been invoked in …

Generalized Construction Of Scalable Concurrent Data Structures Via Relativistic Programming, Josh Triplett, Paul E. Mckenney, Philip W. Howard, Jonathan Walpole

Computer Science Faculty Publications and Presentations

We present relativistic programming, a concurrent programming model based on shared addressing, which supports efficient, scalable operation on either uniform shared-memory or distributed shared- memory systems. Relativistic programming provides a strong causal ordering property, allowing a series of read operations to appear as an atomic transaction that occurs entirely between two ordered write operations. This preserves the simple immutable-memory programming model available via mutual exclusion or transactional memory. Furthermore, relativistic programming provides joint-access parallelism, allowing readers to run concurrently with a writer on the same data. We demonstrate a generalized construction technique for concurrent data structures based on relativistic programming, …

Scalable Correct Memory Ordering Via Relativistic Programming, Josh Triplett, Philip William Howard, Paul E. Mckenney, Jonathan Walpole

Computer Science Faculty Publications and Presentations

We propose and document a new concurrent programming model, relativistic programming. This model allows readers to run concurrently with writers, without blocking or using expensive synchronization. Relativistic programming builds on existing synchronization primitives that allow writers to wait for current readers to finish with minimal reader overhead. Our methodology models data structures as graphs, and reader algorithms as traversals of these graphs; from this foundation we show how writers can implement arbitrarily strong ordering guarantees for the visibility of their writes, up to and including total ordering.

Universal Engineering Programmer – An In-House Development Tool For Developing And Testing Implantable Medical Devices In St. Jude Medical, Khoa Tat Do

Master's Theses

During development and testing of the functionality of the pacemaker and defibrillator device, engineers in the St. Jude Medical Cardiac Rhythm Management Division use an in-house development tool called Universal Engineering Programmer (UEP) to ensure the device functions as expected, before it can be used to test on an animal or a human during the implantation process.  In addition, some applications of UEP are incorporated into the official releases of the device product.  UEP has been developed and used by engineers across departments in the St. Jude Medical Cardiac Rhythm Management Division (CRMD).  This thesis covers the flexible and reusable …

Interoperable Credentials Management For Wholesale Banking, Glenn Benson, Shiu-Kai Chin, Sean Croston, Karthick Jayaraman, Susan Older

Electrical Engineering and Computer Science - All Scholarship

A gap exists between wholesale-banking business practices and security best practices: wholesale banks operate within the boundaries of contract law, while security best practices often relies upon a benevolent trusted party outside the scope of straightforward contracts. While some business domains may be able to bridge this gap, the ultra-high-value transactions used in business-to-business banking substantially increase the size of the gap. The gap becomes most apparent when regarded from the perspective of interoperability. If a single user applies the same credential to sign high-value transactions at multiple banks, then the trusted-party model becomes overly cumbersome and conflicts with an …

Enhancing Simulation Composability And Interoperability Using Conceptual/Semantic/Ontological Models, Andreas Tolk, John A. Miller

Computational Modeling & Simulation Engineering Faculty Publications

(First paragraph) Two emerging trends in Modeling and Simulation (M&S) are beginning to dovetail in a potentially highly productive manner, namely conceptual modeling and semantic modeling. Conceptual modeling has existed for several decades, but its importance has risen to the forefront in the last decade (Taylor and Robinson, 2006; Robinson, 2007). Also, during the last decade, progress on the Semantic Web has begun to influence M&S, with the development of general modeling ontologies (Miller et al, 2004), as well as ontologies for modeling particular domains (Durak, 2006). An ontology, which is a formal specification of a conceptualization (Gruber et al, …

Software Reuse For Modeling And Simulation, Emily Andrew, Charles D. Turnitsa, Andreas Tolk

Computational Modeling & Simulation Engineering Faculty Publications

In Modeling and Simulation, as a distinct area of software engineering, there is much interest in being able to reuse software components. However, the practice of simulation development and maintenance is different from software engineering because of several factors. In this paper, a brief overview of the foundations of interoperability, and how they apply to the reuse of model based software is explored, as well as examination of current practices to include M&S software repositories. Some recommendations, based on research at the Virginia Modeling Analysis and Simulation Center (VMASC) and practice at the Raytheon Company Network Centric Services, are made.

Executable Architecture Research At Old Dominion University, Andreas Tolk, Johnny J. Garcia, Edwin A. Shuman

Computational Modeling & Simulation Engineering Faculty Publications

Executable Architectures allow the evaluation of system architectures not only regarding their static, but also their dynamic behavior. However, the systems engineering community do not agree on a common formal specification of executable architectures. To close this gap and identify necessary elements of an executable architecture, a modeling language, and a modeling formalism is topic of ongoing PhD research. In addition, systems are generally defined and applied in an operational context to provide capabilities and enable missions. To maximize the benefits of executable architectures, a second PhD effort introduces the idea of creating an executable context in addition to the …

Ua3/9/2 I.T. Division Annual Report + Tactical Plan, Wku Information Technology

WKU Administration Documents

Annual report of WKU Information Technology Division submitted to WKU President Gary Ransdell. Report is housed in UA3/9/2 Subject Files.

Technology Management Trends In Law Schools, Carol A. Watson, Larry Reeves

Articles, Chapters and Online Publications

Discusses the role of librarians in law school technology management and analyzes technology staffing survey results for 2002, 2006, and 2010. While survey results indicate a trend toward establishing separate information technology departments within law schools, librarians are and will continue to be actively involved in law school technology.

Parallelizing Scale Invariant Feature Transform On A Distributed Memory Cluster, Stanislav Bobovych

Inquiry: The University of Arkansas Undergraduate Research Journal

Scale Invariant Feature Transform (SIFT) is a computer vision algorithm that is widely-used to extract features from images. We explored accelerating an existing implementation of this algorithm with message passing in order to analyze large data sets. We successfully tested two approaches to data decomposition in order to parallelize SIFT on a distributed memory cluster.

Relativistic Red-Black Trees, Philip William Howard, Jonathan Walpole

Computer Science Faculty Publications and Presentations

Operating system performance and scalability on sharedmemory many-core systems depends critically on efficient access to shared data structures. Scalability has proven difficult to achieve for many data structures. In this paper we present a novel and highly scalable concurrent red-black tree. Red-black trees are widely used in operating systems, but typically exhibit poor scalability. Our red-black tree has linear read scalability, uncontended read performance that is at least 25% faster than other known approaches, and deterministic lookup times for a given tree size, making it suitable for realtime applications.