Open Access. Powered by Scholars. Published by Universities.®

Computer Sciences Commons™

Open Access. Powered by Scholars. Published by Universities.®

Engineering

Institution
Keyword
Publication Year
Publication
Publication Type
File Type

Articles 13351 - 13380 of 17324

Full-Text Articles in Computer Sciences

Malicious And Malfunctioning Node Detection Via Observed Physical Layer Data, Tyler J. Hardy Mar 2011

Malicious And Malfunctioning Node Detection Via Observed Physical Layer Data, Tyler J. Hardy

Theses and Dissertations

There are many mechanisms that can cause inadequate or unreliable information in sensor networks. A user of the network might be interested in detecting and classifying specific sensors nodes causing these problems. Several network layer based trust methods have been developed in previous research to assess these issues; in contrast this work develops a trust protocol based on observations of physical layer data collected by the sensors. Observations of physical layer data are used for decisions and calculations, and are based on just the measurements collected by the sensors. Although this information is packaged and distributed on the network layer, …


Holistic Network Defense: Fusing Host And Network Features For Attack Classification, Jenny W. Ji Mar 2011

Holistic Network Defense: Fusing Host And Network Features For Attack Classification, Jenny W. Ji

Theses and Dissertations

This work presents a hybrid network-host monitoring strategy, which fuses data from both the network and the host to recognize malware infections. This work focuses on three categories: Normal, Scanning, and Infected. The network-host sensor fusion is accomplished by extracting 248 features from network traffic using the Fullstats Network Feature generator and from the host using text mining, looking at the frequency of the 500 most common strings and analyzing them as word vectors. Improvements to detection performance are made by synergistically fusing network features obtained from IP packet flows and host features, obtained from text mining port, processor, logon …


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

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 …


Evaluating Information Assurance Control Effectiveness On An Air Force Supervisory Control And Data Acquisition (Scada) System, Jason R. Nielsen Mar 2011

Evaluating Information Assurance Control Effectiveness On An Air Force Supervisory Control And Data Acquisition (Scada) System, Jason R. Nielsen

Theses and Dissertations

Supervisory Control and Data Acquisition (SCADA) systems are increasingly being connected to corporate networks which has dramatically expanded their attack surface to remote cyber attack. Adversaries are targeting these systems with increasing frequency and sophistication. This thesis seeks to answer the research question addressing which Information Assurance (IA) controls are most significant for network defenders and SCADA system managers/operators to focus on in order to increase the security of critical infrastructure systems against a Stuxnet-like cyber attack. This research applies the National Institute of Science and Technology (NIST) IA controls to an attack tree modeled on a remote Stuxnet-like cyber …


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

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 …


Spear Phishing Attack Detection, David T. Merritt Mar 2011

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, …


Software And Critical Technology Protection Against Side Channel Analysis Through Dynamic Hardware Obfuscation, John R. Bochert Mar 2011

Software And Critical Technology Protection Against Side Channel Analysis Through Dynamic Hardware Obfuscation, John R. Bochert

Theses and Dissertations

Side Channel Analysis (SCA) is a method by which an adversary can gather information about a processor by examining the activity being done on a microchip though the environment surrounding the chip. Side Channel Analysis attacks use SCA to attack a microcontroller when it is processing cryptographic code, and can allow an attacker to gain secret information, like a crypto-algorithm's key. The purpose of this thesis is to test proposed dynamic hardware methods to increase the hardware security of a microprocessor such that the software code being run on the microprocessor can be made more secure without having to change …


Kernelized Locality-Sensitive Hashing For Fast Image Landmark Association, Mark A. Weems Mar 2011

Kernelized Locality-Sensitive Hashing For Fast Image Landmark Association, Mark A. Weems

Theses and Dissertations

As the concept of war has evolved, navigation in urban environments where GPS may be degraded is increasingly becoming more important. Two existing solutions are vision-aided navigation and vision-based Simultaneous Localization and Mapping (SLAM). The problem, however, is that vision-based navigation techniques can require excessive amounts of memory and increased computational complexity resulting in a decrease in speed. This research focuses on techniques to improve such issues by speeding up and optimizing the data association process in vision-based SLAM. Specifically, this work studies the current methods that algorithms use to associate a current robot pose to that of one previously …


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

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.


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

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, …


Reactive Routing In Hidra Networks, Scott Michael Marshall Mar 2011

Reactive Routing In Hidra Networks, Scott Michael Marshall

Computer Engineering

In recent years, the Internet has grown so large that the future scalability of the Internet has become a major concern. The two primary scalability concerns are the size of the forwarding table and the ability for BGP to converge while distributing hundreds of thousands of routes.

HIDRA is a new Internet routing architecture that is backwards-compatible with existing routing technologies and protocols that focuses on feasibility-of-implementation. HIDRA remedies the first Internet scalability concern by proposing a means to reduce the number of entries in the default-free zone (DFZ) forwarding table.

This project extends HIDRA by designing a complete reactive …


Identifying Horizontal Gene Transfer Using Anomalies In Protein Structures And Sequences, Venkat Ram B. Santosh Feb 2011

Identifying Horizontal Gene Transfer Using Anomalies In Protein Structures And Sequences, Venkat Ram B. Santosh

School of Computing: Dissertations, Theses, and Student Research

Genetics has traditionally focused on vertical gene transfer, which is the passing of the genetic material of an organism to its offspring. However, recent studies in genetics increased the awareness that horizontal gene transfer, which is the passing of the genetic material of an organism to another organism that is not its offspring, is also a significant phenomenon. Horizontal gene transfer is thought to play a major role in the natural evolution of bacteria, such as, when several different types of bacteria all suddenly develop the same drug resistance genes. Artificial horizontal gene transfer occurs in genetic engineering.

This thesis …


Due-Date Assignment And Optional Maintenance Activity Scheduling Problem With Linear Deterioreting Jobs, Chou-Jung Hsu, Suh-Jenq Yang, Dar-Li Yang Feb 2011

Due-Date Assignment And Optional Maintenance Activity Scheduling Problem With Linear Deterioreting Jobs, Chou-Jung Hsu, Suh-Jenq Yang, Dar-Li Yang

Journal of Marine Science and Technology–Taiwan

The focus of this work is to analyze linear deteriorating jobs in a single-machine scheduling problem with due-date assignment and maintenance activity. The linear deteriorating jobs means its processing time is an increasing function of their starting time. The objective is to minimize the total of earliness, tardiness and due-date cost. To solve the scheduling problem addressed in this work, we have to determine the job sequence, the common due-date, and the location of a maintenance activity. We show that the problem can be solved optimally in O(n2 log n) time.


Numerical Solutions Of Differential-Algebraic Equations And Its Applications In Solving Tppc Problems, He-Sheng Wang, Wei-Lun Jhu, Chee-Fai Yung, Ping-Feng Wang Feb 2011

Numerical Solutions Of Differential-Algebraic Equations And Its Applications In Solving Tppc Problems, He-Sheng Wang, Wei-Lun Jhu, Chee-Fai Yung, Ping-Feng Wang

Journal of Marine Science and Technology–Taiwan

In this paper, we present a numerical method for solving nonlinear differential algebraic equations (DAE’s) based on the backward differential formulas (BDF) and the Pade series. Usefulness of the method is then illustrated by a numerical example, which is concerned with the derivation of the optimal guidance law for spacecraft. This kind of problems is called trajectory-prescribed path control (TPPC) in the literature. We reformulate the problem as a Hamiltonian DAE system (usually with a higher index). After establishing the system of spacecraft dynamics, we can derive the optimal guidance law of the system by the proposed numerical method.


Pgtp: Power Aware Game Transport Protocol For Multi-Player Mobile Games, Bhojan Anand, Jeena Sebastian, Soh Yu Ming, Akhihebbal L. Ananda, Mun Choon Chan, Rajesh Krishna Balan Feb 2011

Pgtp: Power Aware Game Transport Protocol For Multi-Player Mobile Games, Bhojan Anand, Jeena Sebastian, Soh Yu Ming, Akhihebbal L. Ananda, Mun Choon Chan, Rajesh Krishna Balan

Research Collection School Of Computing and Information Systems

Applications on the smartphones are able to capitalize on the increasingly advanced hardware to provide a user experience reasonably impressive. However, the advancement of these applications are hindered battery lifetime of the smartphones. The battery technologies have a relatively low growth rate. Applications like mobile multiplayer games are especially power hungry as they maximize the use of the network, display and CPU resources. The PGTP, presented in this paper is aware of both the transport requirement of these multiplayer mobile games and the limitation posed by battery resource. PGTP dynamically controls the transport based on the criticality of game state …


Detecting Software Attacks By Monitoring Electric Power Consumption Patterns, Grant A. Jacoby, Nathaniel J. Davis Iv, Randolph C. Marchany Jan 2011

Detecting Software Attacks By Monitoring Electric Power Consumption Patterns, Grant A. Jacoby, Nathaniel J. Davis Iv, Randolph C. Marchany

AFIT Patents

Software attacks such as worms and viruses are detected in an electronic device by monitoring power consumption patterns. In a first embodiment, software attacks are detected by an increase in power consumption. The increased power consumption can be caused by increased network traffic, or by increased activity in the microprocessor. Monitoring power consumption is particularly effective for detecting DOS/flooding attacks when the electronic device is in an idle state. In a second embodiment, a power consumption signal is converted to the frequency domain (e.g., by fast Fourier transform). The highest amplitude frequencies are identified. Specific software attacks produce characteristic frequencies …


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

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 …


Data Mining Based Learning Algorithms For Semi-Supervised Object Identification And Tracking, Michael P. Dessauer Jan 2011

Data Mining Based Learning Algorithms For Semi-Supervised Object Identification And Tracking, Michael P. Dessauer

Doctoral Dissertations

Sensor exploitation (SE) is the crucial step in surveillance applications such as airport security and search and rescue operations. It allows localization and identification of movement in urban settings and can significantly boost knowledge gathering, interpretation and action. Data mining techniques offer the promise of precise and accurate knowledge acquisition techniques in high-dimensional data domains (and diminishing the “curse of dimensionality” prevalent in such datasets), coupled by algorithmic design in feature extraction, discriminative ranking, feature fusion and supervised learning (classification). Consequently, data mining techniques and algorithms can be used to refine and process captured data and to detect, recognize, classify, …


Simulation, Application, And Resilience Of An Organic Neuromorphic Architecture, Made With Organic Bistable Devices And Organic Field Effect Transistors, Robert A. Nawrocki Jan 2011

Simulation, Application, And Resilience Of An Organic Neuromorphic Architecture, Made With Organic Bistable Devices And Organic Field Effect Transistors, Robert A. Nawrocki

Electronic Theses and Dissertations

This thesis presents work done simulating a type of organic neuromorphic architecture, modeled after Artificial Neural Network, and termed Synthetic Neural Network, or SNN. The first major contribution of this thesis is development of a single-transistor-single-organic-bistable-device-per-input circuit that approximates behavior of an artificial neuron. The efficacy of this design is validated by comparing the behavior of a single synthetic neuron to that of an artificial neuron as well as two examples involving a network of synthetic neurons. The analysis utilizes electrical characteristics of polymer electronic elements, namely Organic Bistable Device and Organic Field Effect Transistor, created in the laboratory at …


Reference Set Metrics For Multi-Objective Algorithms, Chilukuri K. Mohan, Kishan Mehrotra Jan 2011

Reference Set Metrics For Multi-Objective Algorithms, Chilukuri K. Mohan, Kishan Mehrotra

Electrical Engineering and Computer Science - All Scholarship

Several metrics and indicators have been suggested in the past to evaluate multi-objective evolutionary and non-evolutionary algo- rithms. However, these metrics are known to have many problems that make their application sometimes unsound, and sometimes infeasible. This paper proposes a new approach, in which metrics are parameter- ized with respect to a reference set, on which depend the properties of any metric.


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

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.


Harmony Oriented Architecture, Kyle A. Martin Jan 2011

Harmony Oriented Architecture, Kyle A. Martin

Electronic Theses and Dissertations

This thesis presents Harmony Oriented Architecture: a novel architectural paradigm that applies the principles of Harmony Oriented Programming to the architecture of scalable and evolvable distributed systems. It is motivated by research on Ultra Large Scale systems that has revealed inherent limitations in human ability to design large-scale software systems that can only be overcome through radical alternatives to traditional object-oriented software engineering practice that simplifies the construction of highly scalable and evolvable system. HOP eschews encapsulation and information hiding, the core principles of objectoriented design, in favor of exposure and information sharing through a spatial abstraction. This helps to …


An Empirical Study Of Open Source Software Usability: The Industrial Perspective, Arif Raza, Luiz Fernando Capretz, Faheem Ahmed Jan 2011

An Empirical Study Of Open Source Software Usability: The Industrial Perspective, Arif Raza, Luiz Fernando Capretz, Faheem Ahmed

Electrical and Computer Engineering Publications

Recent years have seen a sharp increase in the use of open source projects by common novice users; Open Source Software (OSS) is thus no longer a reserved arena for software developers and computer gurus. Although user-centered designs are gaining popularity in OSS, usability is still not considered as one of the prime objectives in many design scenarios. In this paper, we analyze industry users’ perception of usability factors, including understandability, learnability, operability and attractiveness, on OSS usability. The research model of this empirical study establishes the relationship between the key usability factors and OSS usability from industrial perspective. In …


The Rock 2011, School Of Engineering And Computer Science Jan 2011

The Rock 2011, School Of Engineering And Computer Science

The Rock

No abstract provided.


A Secure Behavior Modification Sensor System For Physical Activity Improvement, Alan Price Jan 2011

A Secure Behavior Modification Sensor System For Physical Activity Improvement, Alan Price

CGU Theses & Dissertations

Today, advances in wireless sensor networks are making it possible to capture large amounts of information about a person and their interaction within their home environment. However, what is missing is how to ensure the security of the collected data and its use to alter human behavior for positive benefit.

In this research, exploration was conducted involving the "infrastructure" and "intelligence" aspects of a wireless sensor network through a Behavior Modification Sensor System. First was to understand how a secure wireless sensor network could be established through the symmetric distribution of keys (the securing of the infrastructure), and it involves …


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

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.


The Ordering Requirements Of Relativistic And Reader-Writer Locking Approaches To Shared Data Access, Philip William Howard, Josh Triplett, Jonathan Walpole, Paul E. Mckenney Jan 2011

The Ordering Requirements Of Relativistic And Reader-Writer Locking Approaches To Shared Data Access, Philip William Howard, Josh Triplett, Jonathan Walpole, Paul E. Mckenney

Computer Science Faculty Publications and Presentations

The semantics of reader-writer locks allow read-side concurrency. Unfortunately, the locking primitives serialize access to the lock variable to an extent that little or no concurrency is realized in practice for small critical sections. Relativistic programming is a methodology that also allows read- side concurrency. Relativistic programming uses dfferent ordering constraints than reader-writer locking. The different ordering constraints allow relativistic readers to proceed without synchronization so relativistic readers scale even for very short critical sections. In this paper we explore the diferences between the ordering constraints for reader-writer locking and relativistic programs. We show how and why the dfferent ordering …


Research In High Performance And Low Power Computer Systems For Data-Intensive Environment, Pengju Shang Jan 2011

Research In High Performance And Low Power Computer Systems For Data-Intensive Environment, Pengju Shang

Electronic Theses and Dissertations

According to the data affinity, DAFA re-organizes data to maximize the parallelism of the affinitive data, and also subjective to the overall load balance. This enables DAFA to realize the maximum number of map tasks with data-locality. Besides the system performance, power consumption is another important concern of current computer systems. In the U.S. alone, the energy used by servers which could be saved comes to 3.17 million tons of carbon dioxide, or 580,678 cars {Kar09}. However, the goals of high performance and low energy consumption are at odds with each other. An ideal power management strategy should be able …


Virtual Router Approach For Wireless Ad Hoc Networks, Ai Hua Ho Jan 2011

Virtual Router Approach For Wireless Ad Hoc Networks, Ai Hua Ho

Electronic Theses and Dissertations

Wireless networks have become increasingly popular in recent years. There are two variations of mobile wireless networks: infrastructure mobile networks and infrastructureless mobile networks. The latter are also known as mobile ad hoc network (MANET). MANETs have no fixed routers. Instead, mobile nodes function as relay nodes or routers, which discover and maintain communication connections between source nodes and destination nodes for various data transmission sessions. In other words, an MANET is a self-organizing multi-hop wireless network in which all nodes within a given geographical area participate in the routing and data forwarding process. Such networks are scalable and self-healing. …


The Power Of Quantum Walk Insights, Implementation, And Applications, Chen Fu Chiang Jan 2011

The Power Of Quantum Walk Insights, Implementation, And Applications, Chen Fu Chiang

Electronic Theses and Dissertations

In this thesis, I investigate quantum walks in quantum computing from three aspects: the insights, the implementation, and the applications. Quantum walks are the quantum analogue of classical random walks. For the insights of quantum walks, I list and explain the required components for quantizing a classical random walk into a quantum walk. The components are, for instance, Markov chains, quantum phase estimation, and quantum spectrum theorem. I then demonstrate how the product of two reflections in the walk operator provides a quadratic speed-up, in comparison to the classical counterpart. For the implementation of quantum walks, I show the construction …