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

Computer Sciences Commons™

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

2006

Discipline
Institution
Keyword
Publication
Publication Type
File Type

Articles 691 - 720 of 1262

Full-Text Articles in Computer Sciences

Type Ii Quantum Computing Algorithm For Computational Fluid Dynamics, James A. Scoville Mar 2006

Type Ii Quantum Computing Algorithm For Computational Fluid Dynamics, James A. Scoville

Theses and Dissertations

An algorithm is presented to simulate fluid dynamics on a three qubit type II quantum computer: a lattice of small quantum computers that communicate classical information. The algorithm presented is called a three qubit factorized quantum lattice gas algorithm. It is modeled after classical lattice gas algorithms which move virtual particles along an imaginary lattice and change the particles’ momentums using collision rules when they meet at a lattice node. Instead of moving particles, the quantum algorithm presented here moves probabilities, which interact via a unitary collision operator. Probabilities are determined using ensemble measurement and are moved with classical communications …


Design And Measurement Of A Real-Time Peer-To-Peer Game, Michael D. Simonsen Mar 2006

Design And Measurement Of A Real-Time Peer-To-Peer Game, Michael D. Simonsen

Theses and Dissertations

Currently, multiplayer online games use the client-server architecture which is very resource intensive, expensive, and time consuming. Peer-to-peer protocols are a less resource intensive alternative to the client-server model. We implement a peer-to-peer protocol called NEO in a multiplayer game and run experiments in a lab setting and over the Internet. These experiments show us that NEO is able to run a smooth playable game, with low unused updates and low location error. This happens as long as the arrival delay is long enough to allow updates to arrive in the given time limit and the round length is short …


Development Of A Learning Management System For Ucar-Comet, Dan Riter Mar 2006

Development Of A Learning Management System For Ucar-Comet, Dan Riter

Regis University Student Publications (comprehensive collection)

UCAR-COMET creates web-based training modules for professional meteorologists. Prior to the implementation of this project, UCAR-COMET did not have a Learning Management System. A Learning Management System is a web-based system that allows meteorologists to keep track of personal information that relates to each learning module. The Learning Management System also allows the meteorologists' supervisors to monitor this information. Although there are many Learning Management Systems on the market, most are expensive, cannot be customized, and require contract agreements. UCAR-COMET would like to own a web-based system where users can create and manage their own accounts. A user account primarily …


Load Shedding In Stream Databases: A Control-Based Approach, Yi-Cheng Tu, Song Liu, Sunil Prabhakar, Bin Yao Mar 2006

Load Shedding In Stream Databases: A Control-Based Approach, Yi-Cheng Tu, Song Liu, Sunil Prabhakar, Bin Yao

Department of Computer Science Technical Reports

No abstract provided.


Idf: An Inconsistency Detection Framework – Performance Modeling And Guide To Its Design, Yijun Lu, Xueming Li, Hong Jiang Mar 2006

Idf: An Inconsistency Detection Framework – Performance Modeling And Guide To Its Design, Yijun Lu, Xueming Li, Hong Jiang

School of Computing: Technical Reports

With the increased popularity of replica-based services in distributed systems such as the Grid, consistency control among replicas becomes more and more important. To this end, IDF (Inconsistency Detection Framework), a two-layered overlay-based architecture, has been proposed as a new way to solve this problem—instead of enforcing a predefined protocol, IDF detects inconsistency in a timely manner when it occurs and resolves it based on applications’ semantics.
This paper presents a comprehensive analytical study of IDF to assess its performance and provide insight into its design. More specifically, it develops an analytical model to characterize IDF. Based on this model, …


Scouting Ecommerce: Electronic Tracking For Girl Scouts, Melissa Roetker Mar 2006

Scouting Ecommerce: Electronic Tracking For Girl Scouts, Melissa Roetker

Regis University Student Publications (comprehensive collection)

Girl Scout Troop #343 relies on parent volunteers to keep the troop functioning. The troop leaders would like to reduce time spent on paperwork, in order to allow volunteers to focus on time spent with the girls. Other than meetings, the most time consuming activity for volunteers is the manual tracking of paperwork. This includes financial paperwork, badge and activity status, personal data, and other such information. Troops are on their own to find a method for maintaining records, without local or national support. Currently, Troop #343 has moved the finances to an electronic format, which has left the badge …


Perspective Models As A Means For Achieving True Representational Accuracy, Kym Jason Pohl Mar 2006

Perspective Models As A Means For Achieving True Representational Accuracy, Kym Jason Pohl

Collaborative Agent Design (CAD) Research Center

Accurate and expressive representation of the subject matter over which a context-oriented, decision-support system operates is fundamental to the effectiveness and longevity of the resulting solution. Often taking the form of an ontology, such extensive representational models, by their very nature, are rich in both relationships and fine-grained objects. It is, however, these two strengths that can significantly increase complexity for its users in addition to adversely affecting system performance. Further, due to the multitude of compartmentalized facets (i.e., populations of distinct, reasoning agents) inherent in such software solutions, it is important to recognize that a single-minded omniscient set of …


Formal Mitigation Strategies For The Insider Threat: A Security Model And Risk Analysis Framework, Jonathan W. Butts Mar 2006

Formal Mitigation Strategies For The Insider Threat: A Security Model And Risk Analysis Framework, Jonathan W. Butts

Theses and Dissertations

The advancement of technology and reliance on information systems have fostered an environment of sharing and trust. The rapid growth and dependence on these systems, however, creates an increased risk associated with the insider threat. The insider threat is one of the most challenging problems facing the security of information systems because the insider already has capabilities within the system. Despite research efforts to prevent and detect insiders, organizations remain susceptible to this threat because of inadequate security policies and a willingness of some individuals to betray their organization. To investigate these issues, a formal security model and risk analysis …


Wsdl-S: Specification, Tools, Use Cases And Applications, Amit P. Sheth, Kunal Verma, Karthik Gomadam Mar 2006

Wsdl-S: Specification, Tools, Use Cases And Applications, Amit P. Sheth, Kunal Verma, Karthik Gomadam

Kno.e.sis Publications

No abstract provided.


Test-Driven Learning: Intrinsic Integration Of Testing Into The Cs/Se Curriculum, David S. Janzen, Hossein Saiedian Mar 2006

Test-Driven Learning: Intrinsic Integration Of Testing Into The Cs/Se Curriculum, David S. Janzen, Hossein Saiedian

Computer Science and Software Engineering

Test-driven learning (TDL) is an approach to teaching computer programming that involves introducing and exploring new concepts through automated unit tests. TDL offers the potential of teaching testing for free, of improving programmer comprehension and ability, and of improving software quality both in terms of design quality and reduced defect density.This paper introduces test-driven learning as a pedagogical tool. It will provide examples of how TDL can be incorporated at multiple levels in computer science and software engineering curriculum for beginning through professional programmers. In addition, the relationships between TDL and test-driven development will be explored.Initial evidence indicates that TDL …


Inital Starting Point Analysis For K-Means Clustering: A Case Study, Amy Apon, Frank Robinson, Denny Brewer, Larry Dowdy, Doug Hoffman, Baochuan Lu Mar 2006

Inital Starting Point Analysis For K-Means Clustering: A Case Study, Amy Apon, Frank Robinson, Denny Brewer, Larry Dowdy, Doug Hoffman, Baochuan Lu

Publications

Workload characterization is an important part of systems performance modeling. Clustering is a method used to find classes of jobs within workloads. K-Means is one of the most popular clustering algorithms. Initial starting point values are needed as input parameters when performing k-means clustering. This paper shows that the results of the running the k-means algorithm on the same workload will vary depending on the values chosen as initial starting points. Fourteen methods of composing initial starting point values are compared in a case study. The results indicate that a synthetic method, scrambled midpoints, is an effective starting point method …


Maturity Assessment Framework For Business Dimension Of Software Product Family, Faheem Ahmed, Luiz Fernando Capretz Mar 2006

Maturity Assessment Framework For Business Dimension Of Software Product Family, Faheem Ahmed, Luiz Fernando Capretz

Electrical and Computer Engineering Publications

The software product family approach aims at curtailing the concept of “reinventing the wheel” in the software development process. The business has been highlighted as one of the critical dimensions in the process of software product family. This work presents an assessment framework for evaluating the business dimension of software product family process. Additionally, a software product family business evaluation tool has been designed and implemented on the basis of the presented framework. The tool preprocesses the data of key business factors, and it evaluates the overall business maturity of an organization. To demonstrate the application of the framework, and …


Tacit Knowledge, Nonaka And Takeuchi Seci Model And Informal Knowledge Processes, Siu Loon Hoe Mar 2006

Tacit Knowledge, Nonaka And Takeuchi Seci Model And Informal Knowledge Processes, Siu Loon Hoe

Research Collection School Of Computing and Information Systems

The organizational behavior and knowledge management literature has devoted a lot attention on how structural knowledge processes enhance learning. There has been little emphasis on the informal knowledge processes and the construct remains undefined. The purpose of this paper is to highlight the importance of informal knowledge processes, propose a definition for these processes and link them to the socialization and internalization processes suggested by Nonaka and Takeuchi in the SECI model. The paper offers a fresh perspective on how informal knowledge processes in organizations help to enhance the organization’s learning capability. It will enable scholars and managers to have …


Bda Enhancement Methodology Using Situational Parameter Adjustments, Michael V. Carras Jr. Mar 2006

Bda Enhancement Methodology Using Situational Parameter Adjustments, Michael V. Carras Jr.

Theses and Dissertations

In the context of close ground combat, the perception of Battle Damage Assessment (BDA) is closely linked with a soldier’s engagement decisions and has significant effects on the battlefield. Perceived BDA is also one of the most complex and uncertain processes facing the soldier in live combat. As a result, the modeling and simulation community has yet to adequately model the perceived BDA process in combat models. This research effort examines the BDA process from a perception standpoint and proposes a methodology to collect the pertinent data and model this perception in the Army’s current force-on-force model, CASTFOREM. A subject …


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

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 …


Mitigating Distributed Denial Of Service Attacks In An Anonymous Routing Environment: Client Puzzles And Tor, Nicholas A. Fraser Mar 2006

Mitigating Distributed Denial Of Service Attacks In An Anonymous Routing Environment: Client Puzzles And Tor, Nicholas A. Fraser

Theses and Dissertations

Online intelligence operations use the Internet to gather information on the activities of U.S. adversaries. The security of these operations is paramount, and one way to avoid being linked to the Department of Defense (DoD) is to use anonymous communication systems. One such system, Tor, makes interactive TCP services anonymous. Tor uses the Transport Layer Security (TLS) protocol and is thus vulnerable to a distributed denial-of-service (DDoS) attack that can significantly delay data traversing the Tor network. This research uses client puzzles to mitigate TLS DDoS attacks. A novel puzzle protocol, the Memoryless Puzzle Protocol (MPP), is conceived, implemented, and …


A Real-Time Wireless Sensor Media Access Control (Mac) Protocol, Barry W. Park Mar 2006

A Real-Time Wireless Sensor Media Access Control (Mac) Protocol, Barry W. Park

Theses and Dissertations

Wireless sensor networks are rapidly becoming a platform for applications such as battlefield monitoring, intelligence gathering, environmental monitoring, and emergency response. Inherent in these applications is a priority and urgency of the information or messages. This means the messages must be delivered in a timely manner for them to be useful. This research assigns a message priority level and provides high-priority messages quicker access to the channel. Using MICA2 sensors and a modified Media Access Control (MAC) layer, real-time message End-to-End (ETE) delay was reduced by 50 percent. Coupled with this decrease in delay, these same real-time messages also had …


Toward The Static Detection Of Deadlock In Java Software, Jose E. Fadul Mar 2006

Toward The Static Detection Of Deadlock In Java Software, Jose E. Fadul

Theses and Dissertations

Concurrency is the source of many real-world software reliability and security problems. Concurrency defects are difficult to detect because they defy conventional software testing techniques due to their non-local and non-deterministic nature. We focus on one important aspect of this problem: static detection of the possibility of deadlock - a situation in which two or more processes are prevented from continuing while each waits for resources to be freed by the continuation of the other. This thesis proposes a flow-insensitive interprocedural static analysis that detects the possibility that a program can deadlock at runtime. Our analysis proceeds in two steps. …


A Comparison Of Main Rotor Smoothing Adjustments Using Linear And Neural Network Algorithms, Nathan A. Miller Mar 2006

A Comparison Of Main Rotor Smoothing Adjustments Using Linear And Neural Network Algorithms, Nathan A. Miller

Theses and Dissertations

Helicopter main rotor smoothing is a maintenance procedure that is routinely performed to minimize airframe vibrations induced by non-uniform mass and/or aerodynamic distributions in the main rotor system. This important task is both time consuming and expensive, so improvements to the process have long been sought. Traditionally, vibrations have been minimized by calculating adjustments based on an assumed linear relationship between adjustments and vibration response. In recent years, artificial neural networks have been trained to recognize non-linear mappings between adjustments and vibration response. This research was conducted in order observe the character of the adjustment mapping of the Vibration Management …


A Simple Computational Method For The Identification Of Disease-Associated Loci In Complex, Incomplete Pedigrees, Gregory Leibon, Dan Rockmore, Martin R. Pollak Mar 2006

A Simple Computational Method For The Identification Of Disease-Associated Loci In Complex, Incomplete Pedigrees, Gregory Leibon, Dan Rockmore, Martin R. Pollak

Computer Science Technical Reports

We present an approach, called the Shadow Method, for the identification of disease loci from dense genetic marker maps in complex, potentially incomplete pedigrees. Shadow is a simple method based on an analysis of the patterns of obligate meiotic recombination events in genotypic data. This method can be applied to any high density marker map and was specifically designed to explore the fact that extremely dense marker maps are becoming more readily available. We also describe how to interpret and associated meaningful P-Values to the results. Shadow has significant advantages over traditional parametric linkage analysis methods in that it can …


A Hybrid Scatter Search/Electromagnetism Meta-Heuristic For Project Scheduling, Dieter Debels, Bert De Reyck, Roel Leus, Mario Vanhoucke Mar 2006

A Hybrid Scatter Search/Electromagnetism Meta-Heuristic For Project Scheduling, Dieter Debels, Bert De Reyck, Roel Leus, Mario Vanhoucke

Research Collection Lee Kong Chian School Of Business

In the last few decades, several effective algorithms for solving the resource-constrained project scheduling problem have been proposed. However, the challenging nature of this problem, summarised in its strongly NP-hard status, restricts the effectiveness of exact optimisation to relatively small instances. In this paper, we present a new meta-heuristic for this problem, able to provide near-optimal heuristic solutions for relatively large instances. The procedure combines elements from scatter search, a generic population-based evolutionary search method, and from a recently introduced heuristic method for the optimisation of unconstrained continuous functions based on an analogy with electromagnetism theory. We present computational …


Fortifying Password Authentication In Integrated Healthcare Delivery Systems, Yanjiang Yang, Robert H. Deng, Feng Bao Mar 2006

Fortifying Password Authentication In Integrated Healthcare Delivery Systems, Yanjiang Yang, Robert H. Deng, Feng Bao

Research Collection School Of Computing and Information Systems

Integrated Delivery Systems (IDSs) now become a primary means of care provision in healthcare domain. However, existing password systems (under either the single-server model or the multi-server model) do not provide adequate security when applied to IDSs. We are thus motivated to present a practical password authentication system built upon a novel two-server model. We generalize the two-server model to an architecture of a single control server supporting multiple service servers, tailored to the organizational structure of IDSs. The underlying user authentication and key exchange protocols we propose are password-only, neat, efficient, and robust against off-line dictionary attacks mounted by …


Metamorphism As A Software Protection For Non-Malicious Code, Thomas E. Dube Mar 2006

Metamorphism As A Software Protection For Non-Malicious Code, Thomas E. Dube

Theses and Dissertations

Most organizations are aware that threats from trusted insiders pose a great risk to their organization and are very difficult to protect against. Auditing is recognized as an effective technique to detect malicious insider activities. However, current auditing methods are typically applied with a one-size-fits-all approach and may not be an appropriate mitigation strategy, especially towards insider threats. This research develops a 4-step methodology for designing a customized auditing template for a Microsoft Windows XP operating system. Two tailoring methods are presented which evaluate both by category and by configuration. Also developed are various metrics and weighting factors as a …


Application Of Fuzzy State Aggregation And Policy Hill Climbing To Multi-Agent Systems In Stochastic Environments, Dean C. Wardell Mar 2006

Application Of Fuzzy State Aggregation And Policy Hill Climbing To Multi-Agent Systems In Stochastic Environments, Dean C. Wardell

Theses and Dissertations

Reinforcement learning is one of the more attractive machine learning technologies, due to its unsupervised learning structure and ability to continually even as the operating environment changes. Applying this learning to multiple cooperative software agents (a multi-agent system) not only allows each individual agent to learn from its own experience, but also opens up the opportunity for the individual agents to learn from the other agents in the system, thus accelerating the rate of learning. This research presents the novel use of fuzzy state aggregation, as the means of function approximation, combined with the policy hill climbing methods of Win …


Flashlight: A Dynamic Detector Of Shared State, Race Conditions, And Locking Models In Concurrent Java Programs, Scott C. Hale Mar 2006

Flashlight: A Dynamic Detector Of Shared State, Race Conditions, And Locking Models In Concurrent Java Programs, Scott C. Hale

Theses and Dissertations

Concurrent Java programs are difficult to understand and implement correctly. This difficultly leads to code faults that are the source of many real-world reliability and security problems. Many factors contribute to concurrency faults in Java code; for example, programmers may not understand Java language semantics or, when using a Java library or framework, may not understand that their resulting program is concurrent. This thesis describes a dynamic analysis tool, named FlashLight, that detects shared state and possible race conditions within a program. FlashLight illuminates the concurrency within a program for programmers who are wholly or partially "in the dark" about …


A Monocular Vision Based Approach To Flocking, Brian Kirchner Mar 2006

A Monocular Vision Based Approach To Flocking, Brian Kirchner

Theses and Dissertations

Flocking is seen in nature as a means for self protection, more efficient foraging, and other search behaviors. Although much research has been done regarding the application of this principle to autonomous vehicles, the majority of the research has relied on GPS information, broadcast communication, an omniscient central controller, or some other form of "global" knowledge. This approach, while effective, has serious drawbacks, especially regarding stealth, reliability, and biological grounding. This research effort uses three Pioneer P2-AT8 robots to achieve flocking behavior without the use of global knowledge. The sensory inputs are limited to two cameras, offset such that the …


Evolving Self-Organized Behavior For Homogeneous And Heterogeneous Uav Or Ucav Swarms, Ian C. Price Mar 2006

Evolving Self-Organized Behavior For Homogeneous And Heterogeneous Uav Or Ucav Swarms, Ian C. Price

Theses and Dissertations

This investigation uses a self-organization (SO) approach to enable cooperative search and destruction of retaliating targets with swarms of homogeneous and heterogeneous unmanned aerial vehicles (UAVs). To facilitate specific system design, a facilitating SO algebraic framework is created that emphasizes scalability, robustness, and flexibility. This framework is then used to implement a UAV behavior architecture relying upon rules governing formation and target interaction. Sets of applicable behaviors are created by weighted summation of the rules where different weights act as distinct behavior archetypes. Appropriate behavior archetypes are based upon sense information distilled from the environment and a simple perceptron mapping. …


Cryptanalysis Of Pseudorandom Number Generators In Wireless Sensor Networks, Kevin M. Finnigin Mar 2006

Cryptanalysis Of Pseudorandom Number Generators In Wireless Sensor Networks, Kevin M. Finnigin

Theses and Dissertations

This work presents a brute-force attack on an elliptic curve cryptosystem implemented on UC Berkley's TinyOS operating system for wireless sensor networks. The attack exploits the short period of the pseudorandom number generator (PRNG) used by the cryptosystem to generate private keys. The attack assumes a laptop is listening promiscuously to network traffic for key messages and requires only the sensor node?s public key and network address to discover the private key. Experimental results show that roughly 50% of the address space leads to a private key compromise in 25 minutes on average. Furthermore, approximately 32% of the address space …


Detecting Potential Insider Threats Through Email Datamining, James S. Okolica Mar 2006

Detecting Potential Insider Threats Through Email Datamining, James S. Okolica

Theses and Dissertations

No abstract provided.


Verification Of A Decision Level Fusion Algorithm Using A Proven Atr System And Measured Sar Data, James Douglas Thompson Mar 2006

Verification Of A Decision Level Fusion Algorithm Using A Proven Atr System And Measured Sar Data, James Douglas Thompson

Theses and Dissertations

Decision level fusion (DLF) algorithms combine outputs of multiple single sensors to make one confident declaration of a target. This research compares performance results of a DLF algorithm using measured data and a proven ATR system with results from simulated data and a modeled ATR system. This comparison indicates that DLF offers significant performance improvements over single sensor looks. However, results based on simulated data and a modeled ATR are slightly optimistic and overestimate results from measured data and a proven ATR system by nearly 10% over all targets tested.