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

Computer Sciences Commons™

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

2010

Discipline
Institution
Keyword
Publication
Publication Type
File Type

Articles 901 - 930 of 1584

Full-Text Articles in Computer Sciences

Multi-Objective Constraint Satisfaction For Mobile Robot Area Defense, Kenneth W. Mayo Mar 2010

Multi-Objective Constraint Satisfaction For Mobile Robot Area Defense, Kenneth W. Mayo

Theses and Dissertations

In developing multi-robot cooperative systems, there are often competing objectives that need to be met. For example in automating area defense systems, multiple robots must work together to explore the entire area, and maintain consistent communications to alert the other agents and ensure trust in the system. This research presents an algorithm that tasks robots to meet the two specific goals of exploration and communication maintenance in an uncoordinated environment reducing the need for a user to pre-balance the objectives. This multi-objective problem is defined as a constraint satisfaction problem solved using the Non-dominated Sorting Genetic Algorithm II (NSGA-II). Both …


Time Dependent Channel Packet Calculation Of Two Nucleon Scattering Matrix Elements, Brian S. Davis Mar 2010

Time Dependent Channel Packet Calculation Of Two Nucleon Scattering Matrix Elements, Brian S. Davis

Theses and Dissertations

A new approach to calculating nucleon-nucleon scattering matrix elements using a proven atomic time-dependent wave packet technique is investigated. Wave packets containing centripetal barrier information are prepared in close proximity to nuclear well. This is accomplished by first using an analytic equation to determine the wave packets in a suitable intermediate asymptotic state where the centripetal barrier is negligible. Then, the split operator technique is used to propagate the wave packets back to their original positions under the full Hamiltonian. Here, one wave packet is held stationary while the other is allowed to evolve and explore the nuclear well. Scattering …


Development Of A Methodology For Customizing Insider Threat Auditing On A Linux Operating System, William T. Bai Mar 2010

Development Of A Methodology For Customizing Insider Threat Auditing On A Linux Operating System, William T. Bai

Theses and Dissertations

Insider threats can pose a great risk to organizations and by their very nature are difficult to protect against. Auditing and system logging are capabilities present in most operating systems and can be used for detecting insider activity. However, current auditing methods are typically applied in a haphazard way, if at all, and are not conducive to contributing to an effective insider threat security policy. This research develops a methodology for designing a customized auditing and logging template for a Linux operating system. An intent-based insider threat risk assessment methodology is presented to create use case scenarios tailored to address …


Performance Characteristics Of A Kernel-Space Packet Capture Module, Samuel W. Birch Mar 2010

Performance Characteristics Of A Kernel-Space Packet Capture Module, Samuel W. Birch

Theses and Dissertations

Defending networks, network-connected assets, and the information they both carry and store is an operational challenge and a significant drain on resources. A plethora of historical and ongoing research efforts are focused on increasing the effectiveness of the defenses or reducing the costs of existing defenses. One valuable facet in defense is the ability to perform post mortem analysis of incidents that have occurred, and this tactic requires accurate storage and rapid retrieval of vast quantities of historical network data. This research improves the efficiency of capturing network packets to disk using commodity, general-purpose hardware and operating systems. It examines …


A Distributed Network Logging Topology, Nicholas E. Fritts Mar 2010

A Distributed Network Logging Topology, Nicholas E. Fritts

Theses and Dissertations

Network logging is used to monitor computer systems for potential problems and threats by network administrators. Research has found that the more logging enabled, the more potential threats can be detected in the logs (Levoy, 2006). However, generally it is considered too costly to dedicate the manpower required to analyze the amount of logging data that it is possible to generate. Current research is working on different correlation and parsing techniques to help filter the data, but these methods function by having all of the data dumped in to a central repository. Central repositories are limited in the amount of …


Visually Managing Ipsec, Peter J. Dell'accio Mar 2010

Visually Managing Ipsec, Peter J. Dell'accio

Theses and Dissertations

The United States Air Force relies heavily on computer networks to transmit vast amounts of information throughout its organizations and with agencies throughout the Department of Defense. The data take many forms, utilize different protocols, and originate from various platforms and applications. It is not practical to apply security measures specific to individual applications, platforms, and protocols. Internet Protocol Security (IPsec) is a set of protocols designed to secure data traveling over IP networks, including the Internet. By applying security at the network layer of communications, data packets can be secured regardless of what application generated the data or which …


Developing Cyberspace Data Understanding: Using Crisp-Dm For Host-Based Ids Feature Mining, Joseph R. Erskine Mar 2010

Developing Cyberspace Data Understanding: Using Crisp-Dm For Host-Based Ids Feature Mining, Joseph R. Erskine

Theses and Dissertations

Current intrusion detection systems generate a large number of specific alerts, but do not provide actionable information. Many times, these alerts must be analyzed by a network defender, a time consuming and tedious task which can occur hours or days after an attack occurs. Improved understanding of the cyberspace domain can lead to great advancements in Cyberspace situational awareness research and development. This thesis applies the Cross Industry Standard Process for Data Mining (CRISP-DM) to develop an understanding about a host system under attack. Data is generated by launching scans and exploits at a machine outfitted with a set of …


Evolutionary Artificial Neural Network Weight Tuning To Optimize Decision Making For An Abstract Game, Corey M. Miller Mar 2010

Evolutionary Artificial Neural Network Weight Tuning To Optimize Decision Making For An Abstract Game, Corey M. Miller

Theses and Dissertations

Abstract strategy games present a deterministic perfect information environment with which to test the strategic capabilities of artificial intelligence systems. With no unknowns or random elements, only the competitors’ performances impact the results. This thesis takes one such game, Lines of Action, and attempts to develop a competitive heuristic. Due to the complexity of Lines of Action, artificial neural networks are utilized to model the relative values of board states. An application, pLoGANN (Parallel Lines of Action with Genetic Algorithm and Neural Networks), is developed to train the weights of this neural network by implementing a genetic algorithm over a …


Utilizing The Digital Fingerprint Method For Secure Key Generation, Jennifer C. Anilao Mar 2010

Utilizing The Digital Fingerprint Method For Secure Key Generation, Jennifer C. Anilao

Theses and Dissertations

This research examines a new way to generate an uncloneable secure key by taking advantage of the delay characteristics of individual transistors. The user profiles the circuit to deduce the glitch count of each output line for each number of selectable buffers added to the circuit. The user can then use this information to generate a specific glitch count on each output line, which is passed to an encryption algorithm as its key. The results detail tests of two configurations for adding a selectable amount of buffers into each glitch circuit in order to induce additional delay. One configuration adds …


Performance Of Scattering Matrix Decomposition And Color Spaces For Synthetic Aperture Radar Imagery, Manuel E. Arriagada Mar 2010

Performance Of Scattering Matrix Decomposition And Color Spaces For Synthetic Aperture Radar Imagery, Manuel E. Arriagada

Theses and Dissertations

Polarimetrc Synthetic Aperture Radar (SAR) has been shown to be a powerful tool in remote sensing because uses up to four simultaneous measurements giving additional degrees of freedom for processing. Typically, polarization decomposition techniques are applied to the polarization-dependent data to form colorful imagery that is easy for operators systems to interpret. Yet, the presumption is that the SAR system operates with maximum bandwidth which requires extensive processing for near- or real-time application. In this research, color space selection is investigated when processing sparse polarimetric SAR data as in the case of the publicly available \Gotcha Volumetric SAR Data Set, …


Frequency Diverse Array Radar: Signal Characterization And Measurement Accuracy, Steven H. Brady Mar 2010

Frequency Diverse Array Radar: Signal Characterization And Measurement Accuracy, Steven H. Brady

Theses and Dissertations

Radar systems provide an important remote sensing capability, and are crucial to the layered sensing vision; a concept of operation that aims to apply the right number of the right types of sensors, in the right places, at the right times for superior battle space situational awareness. The layered sensing vision poses a range of technical challenges, including radar, that are yet to be addressed. To address the radar-specific design challenges, the research community responded with waveform diversity; a relatively new field of study which aims reduce the cost of remote sensing while improving performance. Early work suggests that the …


Service-Differentiated And Reliable Communication In Event-Based Wireless Sensor Networks, Yuyan Xue Mar 2010

Service-Differentiated And Reliable Communication In Event-Based Wireless Sensor Networks, Yuyan Xue

School of Computing: Dissertations, Theses, and Student Research

Wireless Sensor Networks (WSNs) consist of low-power embedded devices with integrated sensing, computing and wireless communication capabilities. These devices, called sensor nodes or motes, are often battery-powered and deployed in a distributed manner to provide observations on the physical world. Reliably and promptly collecting the sensing data to convey the features of a surveillance area, especially the events of interest, to the sink is one of the most critical requirements of WSN design. However, dynamic wireless channel conditions and the constrained energy resources make it a challenging task to provide the end-to-end performance guarantees in multi-hop WSNs. The objective of …


Interactive Television News, Derek L. Bunn Mar 2010

Interactive Television News, Derek L. Bunn

Theses and Dissertations

We design and evaluate a way to modify television news to make it interactive for viewers. We allow them to get more of what they want and less of what they don't want. This allows news to break constraints imposed by television broadcast schedules. Our solution is to augment the existing news broadcast structure in the following ways: add a video headlines menu, provide on-demand access to additional story content, provide interactive navigation controls between stories, and a control overlay. For news producers we create a video annotation program and process to help create the interactive news. We use the …


Cca-Secure Unidirectional Proxy Re-Encryption In The Adaptive Corruption Model Without Random Oracles, Jian Weng, Minrong Chen, Yanjiang Yang, Robert H. Deng, Kefei Chen Mar 2010

Cca-Secure Unidirectional Proxy Re-Encryption In The Adaptive Corruption Model Without Random Oracles, Jian Weng, Minrong Chen, Yanjiang Yang, Robert H. Deng, Kefei Chen

Research Collection School Of Computing and Information Systems

Proxy re-encryption (PRE), introduced by Blaze, Bleumer and Strauss in Eurocrypt’98, allows a semitrusted proxy to convert a ciphertext originally intended for Alice into an encryption of the same message intended for Bob. PRE has recently drawn great interest, and many interesting PRE schemes have been proposed. However, up to now, it is still an important question to come up with a chosen-ciphertext secure unidirectional PRE in the adaptive corruption model. To address this problem, we propose a new unidirectional PRE scheme, and prove its chosen-ciphertext security in the adaptive corruption model without random oracles. Compared with the best known …


Energy-Efficient K-Coverage For Wireless Sensor Networks With Variable Sensing Radii, Jiong Wang, Sirisha Medidi, Muralidhar Medidi Mar 2010

Energy-Efficient K-Coverage For Wireless Sensor Networks With Variable Sensing Radii, Jiong Wang, Sirisha Medidi, Muralidhar Medidi

Computer Science Faculty Publications and Presentations

Wireless Sensor Networks (WSNs) consist of spatially-distributed autonomous sensors that can cooperatively monitor physical and environmental conditions. Because of sensors’ resource-constraints in terms of size, power, and bandwidth, one of the fundamental objectives in WSNs is improving energy-efficiency. In this paper, utilizing sensors with variable sensing radii, we propose a group-based technique to obtain energy-efficient k-coverage based on our previous work with the Delaunay-Triangulation-based 1-coverage algorithm. Our sensing-radii optimization technique ensures full coverage and attains nearly-optimal energy consumption in sensing. Furthermore, our ns-2 simulations confirm that the group-based k-coverage reduces sensing energy consumption and maintains a …


Automated Measurement Of Midline Shift In Brain Ct Images And Its Application In Computer-Aided Medical Decision Making, Chen Wenan Mar 2010

Automated Measurement Of Midline Shift In Brain Ct Images And Its Application In Computer-Aided Medical Decision Making, Chen Wenan

Theses and Dissertations

The severity of traumatic brain injury (TBI) is known to be characterized by the shift of the middle line in brain as the ventricular system often changes in size and position, depending on the location of the original injury. In this thesis, the focus is given to processing of the CT (Computer Tomography) brain images to automatically calculate midline shift in pathological cases and use it to predict Intracranial Pressure (ICP). The midline shift measurement can be divided into three steps. First the ideal midline of the brain, i.e., the midline before injury, is found via a hierarchical search based …


Admission Control Mechanisms For Continuous Queries In The Cloud, Christine Chung, Lory Al Moakar, Panos Chrysanthis, Shenoda Guirguis, Alexandros Labrinidis, Panayiotis (Panickos) Neophytou, Kirk Pruhs Mar 2010

Admission Control Mechanisms For Continuous Queries In The Cloud, Christine Chung, Lory Al Moakar, Panos Chrysanthis, Shenoda Guirguis, Alexandros Labrinidis, Panayiotis (Panickos) Neophytou, Kirk Pruhs

Computer Science Faculty Publications

No abstract provided.


New Integrated Data Analyses Software Components, Ronald Conze, Frank Krysiak, Josh Reed, Yu-Chung Chen, Hans-Joachim Wallrabe-Adams, Colin Graham, New Jersey Shallow Shelf Science Team, Volker Wennrich, Lake El’Gygytgyn Science Team Mar 2010

New Integrated Data Analyses Software Components, Ronald Conze, Frank Krysiak, Josh Reed, Yu-Chung Chen, Hans-Joachim Wallrabe-Adams, Colin Graham, New Jersey Shallow Shelf Science Team, Volker Wennrich, Lake El’Gygytgyn Science Team

ANDRILL Research and Publications

Data management in scientific drilling programs such as the Integrated Ocean Drilling Program (IODP), the International Continental Scientific Drilling Program (ICDP), and the Antarctic Drilling Program (ANDRILL) performs two functions: firstly, the capture of drilling and scientific data during an expedition, and secondly, the long-term storage and dissemination of these data. Here we describe the progress in linking data management with stand-alone data capture and visualization applications. This provides a two-way flow of data between the database and the applications, and a more integrated data environment for scientists. The new system has been tested, so far, with cores from the …


Symphony: A Platform For Search-Driven Applications, John C. Shafer, Rakesh Agrawal, Hady W. Lauw Mar 2010

Symphony: A Platform For Search-Driven Applications, John C. Shafer, Rakesh Agrawal, Hady W. Lauw

Research Collection School Of Computing and Information Systems

We present the design of Symphony, a platform that enables non-developers to build and deploy a new class of search-driven applications that combine their data and domain expertise with content from search engines and other web services. The Symphony prototype has been built on top of Microsoft's Bing infrastructure. While Symphony naturally makes use of the customization capabilities exposed by Bing, its distinguishing feature is the capability it provides to the application creator to combine their proprietary data and domain expertise with content obtained from Bing. They can also integrate specialized data obtained from web services to enhance the richness …


A Model-Based Fault-Detection And Prediction Scheme For Nonlinear Multivariable Discrete-Time Systems With Asymptotic Stability Guarantees, Balaje T. Thumati, Sarangapani Jagannathan Mar 2010

A Model-Based Fault-Detection And Prediction Scheme For Nonlinear Multivariable Discrete-Time Systems With Asymptotic Stability Guarantees, Balaje T. Thumati, Sarangapani Jagannathan

Electrical and Computer Engineering Faculty Research & Creative Works

In this paper, a novel, unified model-Based fault-detection and prediction (FDP) scheme is developed for nonlinear multiple-input multiple-output (MIMO) discrete-time systems. the proposed scheme addresses both state and output faults by considering separate time profiles. the faults, which could be incipient or abrupt, are modeled using input and output signals of the system. the fault-detection (FD) scheme comprises online approximator in discrete time (OLAD) with a robust adaptive term. an output residual is generated by comparing the FD estimator output with that of the measured system output. a fault is detected when this output residual exceeds a predefined threshold. Upon …


Bay Audio Repair Website & Data Management Application, Michael Shelley Mar 2010

Bay Audio Repair Website & Data Management Application, Michael Shelley

Computer Science and Software Engineering

The goal of this senior project was to build a website and software application to receive and manage audio equipment repair requests for a small startup company called Bay Audio Repair (BAR). Furthermore, it allowed me to gain experience in web development and software engineering practices, specifically requirements gathering, design and implementation. The website provides an online interface for BAR’s customers to request repairs and the application allows BAR employees to update the progress of a repair. Several technologies were used in the system’s construction: HTML, XML, PHP, and C#.


On The Reliability Of Wireless Fingerprinting Using Clock Skews, Chrisil Arackaparambil, Sergey Bratus, Anna Shubina, David Kotz Mar 2010

On The Reliability Of Wireless Fingerprinting Using Clock Skews, Chrisil Arackaparambil, Sergey Bratus, Anna Shubina, David Kotz

Dartmouth Scholarship

No abstract provided.


Top-K Aggregation Queries Over Large Networks, Xifeng Yan, Bin He, Feida Zhu, Jiawei Han Mar 2010

Top-K Aggregation Queries Over Large Networks, Xifeng Yan, Bin He, Feida Zhu, Jiawei Han

Research Collection School Of Computing and Information Systems

Searching and mining large graphs today is critical to a variety of application domains, ranging from personalized recommendation in social networks, to searches for functional associations in biological pathways. In these domains, there is a need to perform aggregation operations on large-scale networks. Unfortunately the existing implementation of aggregation operations on relational databases does not guarantee superior performance in network space, especially when it involves edge traversals and joins of gigantic tables. In this paper, we investigate the neighborhood aggregation queries: Find nodes that have top-k highest aggregate values over their h-hop neighbors. While these basic queries are common in …


Effect Of Web Design On The Overall Success Of Web Sites, Jorge Vega Mar 2010

Effect Of Web Design On The Overall Success Of Web Sites, Jorge Vega

Graphic Communication

No abstract provided.


Local Coordination Under Bounded Rationality: Coase Meets Simon, Finds Hayek, C. Jason Woodard Mar 2010

Local Coordination Under Bounded Rationality: Coase Meets Simon, Finds Hayek, C. Jason Woodard

Research Collection School Of Computing and Information Systems

This paper explores strategic behavior in a network of firms using an agent-based model. The model exhibits a tension between economic efficiency and the stability of the network in the face of incentives to change its configuration. This tension is to be expected because the conditions of the Coase theorem are violated: the boundedly rational firms in the model lack the ability to discover efficient network configurations or achieve them through collective action. In computational experiments, as predicted by theory, firms frequently became locked into inefficient outcomes or endless cycles of mutual frustration. However, simple institutional innovations such as property …


Fuzzy Matching Of Web Queries To Structured Data, Tao Cheng, Hady W. Lauw, Stelios Paparizos Mar 2010

Fuzzy Matching Of Web Queries To Structured Data, Tao Cheng, Hady W. Lauw, Stelios Paparizos

Research Collection School Of Computing and Information Systems

Recognizing the alternative ways people use to reference an entity, is important for many Web applications that query structured data. In such applications, there is often a mismatch between how content creators describe entities and how different users try to retrieve them. In this paper, we consider the problem of determining whether a candidate query approximately matches with an entity. We propose an off-line, data-driven, bottom-up approach that mines query logs for instances where Web content creators and Web users apply a variety of strings to refer to the same Web pages. This way, given a set of strings that …


Differentiating Knowledge Processes In Organisational Learning: A Case Of “Two Solitudes”, Siu Loon Hoe, Steven Mcshane Mar 2010

Differentiating Knowledge Processes In Organisational Learning: A Case Of “Two Solitudes”, Siu Loon Hoe, Steven Mcshane

Research Collection School Of Computing and Information Systems

The fields of organizational behavior (OB)/strategy and marketing have taken different paths over the past two decades to understanding organizational learning. OB/strategy has been pre-occupied with theory development and case study illustrations, whereas marketing has taken a highly quantitative path. Although relying on essentially the same foundation theory, the two disciplines have had minimal crossfertilization. Furthermore, both fields tend to blur or usually ignore the distinction between structural and informal knowledge processes. The purpose of the paper is to highlight the distinction between informal and structural knowledge acquisition and dissemination processes and propose new definitions to differentiate them. Future research …


Creating An Immersive Game World With Evolutionary Fuzzy Cognitive Maps, Yundong Cai, Ah-Hwee Tan, Zhiqi Shen, Boyang Li Mar 2010

Creating An Immersive Game World With Evolutionary Fuzzy Cognitive Maps, Yundong Cai, Ah-Hwee Tan, Zhiqi Shen, Boyang Li

Research Collection School Of Computing and Information Systems

An increasing number of serious games have been developed to enhance the user experiences in education and training. In order to bridge the gap of game experiences in the virtual environment and in the real life, it is crucial to generate believable characters and contexts in real-time. However, the variables to be simulated for a large-scale serious game are numerous. These variables are involved in complex causal relationships and their values change over time. In view that world modeling has not been well addressed with conventional models, this paper uses a computational model Evolutionary Fuzzy Cognitive Map (EFCM) to model …


Information-Quality Aware Routing In Event-Driven Sensor Networks, Hwee Xian Tan, Mun-Choon Chan, Wendong Xiao, Peng-Yong Kong, Chen-Khong Tham Mar 2010

Information-Quality Aware Routing In Event-Driven Sensor Networks, Hwee Xian Tan, Mun-Choon Chan, Wendong Xiao, Peng-Yong Kong, Chen-Khong Tham

Research Collection School Of Computing and Information Systems

Upon the occurrence of a phenomenon of interest in a wireless sensor network, multiple sensors may be activated, leading to data implosion and redundancy. Data aggregation and/or fusion techniques exploit spatio-temporal correlation among sensory data to reduce traffic load and mitigate congestion. However, this is often at the expense of loss in Information Quality (IQ) of data that is collected at the fusion center. In this work, we address the problem of finding the least-cost routing tree that satisfies a given IQ constraint. We note that the optimal least-cost routing solution is a variation of the classical NP-hard Steiner tree …


Homophily In The Digital World: A Livejournal Case Study, Hady W. Lauw, John C. Shafer, Rakesh Agrawal, Alexandros Ntoulas Mar 2010

Homophily In The Digital World: A Livejournal Case Study, Hady W. Lauw, John C. Shafer, Rakesh Agrawal, Alexandros Ntoulas

Research Collection School Of Computing and Information Systems

Are two users more likely to be friends if they share common interests? Are two users more likely to share common interests if they're friends? The authors study the phenomenon of homophily in the digital world by answering these central questions. Unlike the physical world, the digital world doesn't impose any geographic or organizational constraints on friendships. So, although online friends might share common interests, a priori there's no reason to believe that two users with common interests are more likely to be friends. Using data from LiveJournal, the authors show that the answer to both questions is yes.