Computer Sciences Commons^™

3-D Model Characterization And Identification From Intrinsic Landmarks, John L. Camp

Browse all Theses and Dissertations

A method to automatically characterize and identify 3-D range scans based on intrinsic landmarks is presented. Intrinsic landmarks represent locally unique, intrinsic properties of a scanned surface, regardless of scale or rotation. The number, location, and characteristics of landmarks are used to characterize the scanned models. This method contains a selection process to identify stable, intrinsic landmarks for range scans as well as the identification of those scans. The selection process requires no user interaction or surface assumptions. It uses the principal curvatures at the range points to select the landmarks. First, a large number of landmarks are generated by …

Real Time Semantic Analysis Of Streaming Sensor Data, Harshal Kamlesh Patni

Browse all Theses and Dissertations

The emergence of dynamic information sources - like social, mobile and sensors, has led to ginormous streams of real time data on the web also called, the era of Big Data [1]. Research studies suggest, these dynamic networks have created more data in the last three years than in the entire history of civilization, and this trend will only increase in the coming years [1]. Gigaom article on Big data shows, how the total information generated by these dynamic information sources has completely surpassed the total storage capacity. Thus keeping in mind the problem of ever-increasing data, this thesis focuses …

Optimization Of Scientific Computation For Multicore Systems, Andrew B. Mcclain

Browse all Theses and Dissertations

With the rapid growth of semiconductor technology, chip density has increased significantly. As the power exponent is setting hard limits to frequency increases, multi-core and chip level multi-processors have become prevalent in recent years to take advantage of the increasing chip density. In the new generation of processors, multi-core architecture design is becoming the major trend: IBM/SONY/Toshiba's Cell Broadband Engine processors contain nine cores; NVIDIA graphics processors contain more than 30 cores.

One of the biggest challenges is to efficiently utilize the computational power provided by multi-core systems. The second challenge to achieving high performance in a computer system is …

A Reformulation Strategy For Multi-Dimensional Csps: The Case Study Of The Set Game, Amanda Swearngin, Berthe Y. Choueiry, Eugene C. Freuder

School of Computing: Conference and Workshop Papers

In this paper we describe a reformulation strategy for solving multi-dimensional Constraint Satisfaction Problems (CSPs). This strategy operates by iteratively considering, in isolation, each one of the uni-dimensional constraints in the problem. It exploits the approximate symmetries identified on the domain values in order to enforce the selected constraint on the simplified problem. This paper uses the game of SET, a combinatorial card game, to motivate and illustrate our strategy. We propose a multi-dimensional constraint model for SET, and describe a basic constraint solver for finding all solutions of an instance of the game. Then, we introduce an algorithm that …

Solving Difficult Csps With Relational Neighborhood Inverse Consistency, Robert J. Woodward, Shant Karakashian, Berthe Y. Choueiry, Christian Bessiere

School of Computing: Conference and Workshop Papers

Freuder and Elfe (1996) introduced Neighborhood Inverse Consistency (NIC) as a strong local consistency property for binary CSPs. While enforcing NIC can significantly filter the variables domains, the proposed algorithm is too costly to be used on dense graphs or for lookahead during search. In this paper, we introduce and characterize Relational Neighborhood Inverse Consistency (RNIC) as a local consistency property that operates on the dual graph of a non-binary CSP. We describe and characterize a practical algorithm for enforcing it. We argue that defining RNIC on the dual graph unveils unsuspected opportunities to reduce the computational cost of our …

Reformulating The Dual Graphs Of Csps To Improve The Performance Of Relational Neighborhood Inverse Consistency, Robert J. Woodward, Shant Karakashian, Berthe Y. Choueiry, Christian Bessiere

School of Computing: Conference and Workshop Papers

Freuder and Elfe (1996) introduced Neighborhood Inverse Consistency (NIC) as a new local consistency property for binary Constraint Satisfaction Problems (CSPs). Two advantages of the algorithm for enforcing NIC is that it automatically adapts its filtering power to the local connectivity of the network and has insignificant space overhead. However, studies on binary CSPs have shown that enforcing NIC is not effective on sparse graphs and too costly on dense graphs. In (Woodward et al. 2011), we introduced an algorithm for enforcing Relational Neighborhood Inverse Consistency (RNIC), which is an extension of NIC to non-binary CSPs. In this paper, we …

Reformulating The Dual Graphs Of Csps To Improve The Performance Of Rnic, Robert J. Woodward, Shant Karakashian, Berthe Y. Choueiry, Christian Bessiere

School of Computing: Conference and Workshop Papers

•Introduction

•Relational Neighborhood Inverse Consistency

–Property & algorithm

•Reformulating the Dual Graph by

1.Removing redundant edges, yields property wRNIC

2.Triangulation, yields property triRNIC

•Selection strategy: four alternative dual graphs

•Experimental Results

•Conclusion

Reformulating R(*;M)C With Tree Decomposition, Shant Karakashian, Robert J. Woodward, Berthe Y. Choueiry

School of Computing: Conference and Workshop Papers

Local consistency properties and algorithms for enforcing them are central to the success of Constraint Processing. Recently, we have demonstrated the importance of higher levels of consistency and the effectiveness of their algorithms for solving difficult problems (Karakashian et al. 2010; Woodward et al. 2011). In this paper, we introduce two reformulation techniques for improving the effectiveness of our algorithm for the relational consistency property R(*;m)C (Karakashian et al. 2010). Both techniques exploit a tree decomposition of the constraint network of a Constraint Satisfaction Problem (CSP), which is a tree embedding of the network. Our first reformulation technique …

Reformulating R(*,M)C With Tree Decomposition, Shant Karakashian, Robert J. Woodward, Berthe Y. Choueiry

School of Computing: Conference and Workshop Papers

•Introduction

•R(*,m)C Property & Algorithm

•Exploit Tree Decomposition to

–Avoid useless update & reduce propagation effort

↪ Update queue: PROCESSQ ⟿ PROCESSMQ

↪ The two algorithms yield the same filtering

–Synthesize & add new constraints to improve propagation

↪ Property enforced: R(*,m)C ⟿ T-R(*,m,z)C

↪ The same algorithm yields stronger filtering

•Experimental Results

•Conclusion

Feature Interaction Faults Revisited: An Exploratory Study, Brady J. Garvin, Myra B. Cohen

School of Computing: Conference and Workshop Papers

While a large body of research is dedicated to testing for feature interactions in configurable software, there has been little work that examines what constitutes such a fault at the code level. In consequence, we do not know how prevalent real interaction faults are in practice, what a typical interaction fault looks like in code, how to seed interaction faults, or whether current interaction testing techniques are effective at finding the faults they aim to detect.

We make a first step in this direction, by deriving a white box criterion for an interaction fault. Armed with this criterion, we perform …

A Dynamic Local Method For Bandwidth Adaptation In Bundle Links To Conserve Energy In Core Networks, Lin Liu, Byrav Ramamurthy

School of Computing: Conference and Workshop Papers

Energy savings in bundle links of the core network has been investigated recently. The bundle link technique is widely used in current core networks to provide higher bandwidth and more resilience. Basically a bundle link is composed of several high-speed physical sublinks which could be SONET connections, Ethernet circuits, etc. in order to make them work together as a virtual connection. In current network operations, all of the sublinks are activated if the bundle link is powered on although the sublinks could be shut down or brought up independently. Smartly and dynamically shutting down and bringing up sublinks and their …

Minimizing Resource Blocking Rate In Goobs, Shivashis Saha, Jitender S. Deogun, Lisong Xu

School of Computing: Conference and Workshop Papers

The state of the resources at a destination in Grid computing over OBS architecture (GoOBS) may change between a task’s selection of a destination and its arrival at the destination. These changes in the availability of the resources requested at the destination may lead to blocking of tasks, and thus increase the resource blocking rate.

In this paper, we investigate the resource scheduling problem in GoOBS. Our objective is to minimize the resource blocking rate by containing the impact of the changes in the availability of the resources at a destination. We propose a non-selfish destination selection paradigm to minimize …

Refactoring Pipe-Like Mashups For End-User Programmers, Kathryn T. Stolee, Sebastian Elbaum

School of Computing: Conference and Workshop Papers

Mashups are becoming increasingly popular as end users are able to easily access, manipulate, and compose data from many web sources. We have observed, however, that mashups tend to suffer from deficiencies that propagate as mashups are reused. To address these deficiencies, we would like to bring some of the benefits of software engineering techniques to the end users creating these programs. In this work, we focus on identifying code smells indicative of the deficiencies we observed in web mashups programmed in the popular Yahoo! Pipes environment. Through an empirical study, we explore the impact of those smells on end-user …

Directed Test Suite Augmentation, Zhihong Xu

School of Computing: Conference and Workshop Papers

Test suite augmentation techniques are used in regression testing to identify code elements affected by changes and to generate test cases to cover those elements. Whereas methods and techniques to find affected elements have been extensively researched in regression testing, how to generate new test cases to cover these elements cost-effectively has rarely been studied. It is known that generating test cases is very expensive, so we want to focus on this second step. We believe that reusing existing test cases will help us achieve this task. This research intends to provide a framework for test suite augmentation techniques that …

Tcp Congestion Avoidance Algorithm Identification, Peng Yang, Wen Luo, Lisong Xu, Jitender S. Deogun, Ying Lu

School of Computing: Conference and Workshop Papers

The Internet has recently been evolving from homogeneous congestion control to heterogeneous congestion control. Several years ago, Internet traffic was mainly controlled by the traditional AIMD algorithm, whereas Internet traffic is now controlled by many different TCP algorithms, such as AIMD, BIC, CUBIC, and CTCP. However, there is very little work on the performance and stability study of the Internet with heterogeneous congestion control. One fundamental reason is the lack of the deployment information of different TCP algorithms. In this paper, we first propose a tool called TCP Congestion Avoidance Algorithm Identification (CAAI) for actively identifying the TCP algorithm of …

Using Property-Based Oracles When Testing Embedded System Applications, Tingting Yu, Ahyoung Sung, Witawas Srisaan, Gregg Rothermel

School of Computing: Conference and Workshop Papers

Embedded systems are becoming increasingly ubiquitous, controlling a wide variety of popular and safety critical devices. Effective testing techniques could improve the dependability of these systems. In prior work we presented an approach for testing embedded systems, focusing on embedded system applications and the tasks that comprise them. In this work we focus on a second but equally important aspect of testing embedded systems; namely, the need to provide observability of system behavior sufficient to allow engineers to detect failures. We present several property-based oracles that can be instantiated in embedded systems through program analysis and instrumentation, and can detect …

Automatic Generation Of Load Tests, Pingyu Zhang, Sebastian Elbaum, Matthew Dwyer

School of Computing: Conference and Workshop Papers

Load tests aim to validate whether system performance is acceptable under peak conditions. Existing test generation techniques induce load by increasing the size or rate of the input. Ignoring the particular input values, however, may lead to test suites that grossly mischaracterize a system’s performance. To address this limitation we introduce a mixed symbolic execution based approach that is unique in how it 1) favors program paths associated with a performance measure of interest, 2) operates in an iterative-deepening beam-search fashion to discard paths that are unlikely to lead to high-load tests, and 3) generates a test suite of a …

Response Time Analysis Of Hierarchical Scheduling: The Synchronized Deferrable Servers Approach, Haitao Zhu, Steve Goddard, M. Dwyer

School of Computing: Conference and Workshop Papers

Hierarchical scheduling allows reservation of processor bandwidth and the use of different schedulers for different applications on a single platform. We propose a hierarchical scheduling interface called synchronized deferrable servers that can reserve different processor bandwidth on each core, and can combine global and partitioned scheduling on a multicore platform. Significant challenges will arise in the response time analysis of a task set if the tasks are globally scheduled on a multiprocessor platform and the processor bandwidth reserved for the tasks on each processor is different; as a result, existing works on response time analysis for dedicated scheduling on identical …

Experiences With Dynamic Circuit Creation In A Regional Network Testbed, Pragatheeswaran Angu, Byrav Ramamurthy

School of Computing: Conference and Workshop Papers

In this paper we share our experiences of enabling dynamic circuit creation in the GpENI network. GpENI is a network research testbed in the mid-west USA involving several educational institutions. University of Nebraska-Lincoln is involved in provisioning dynamic circuits across the GpENI network among its participating universities. We discuss several options investigated for deploying dynamic circuits over the GpENI network as well as our demonstration experiments at the GENI engineering conferences. UNL has also collaborated with ProtoGENI project of University of Utah and Mid-Atlantic Crossroads (MAX) facility of Washington DC to create interdomain dynamic circuits.

Analysis Of Event Detection Delay In Wireless Sensor Networks, Yunbo Wang, Mehmet C. Vuran, Steve Goddard

School of Computing: Conference and Workshop Papers

Emerging applications of wireless sensor networks (WSNs) require real-time event detection to be provided by the network. In a typical event monitoring WSN, multiple reports are generated by several nodes when a physical event occurs, and are then forwarded through multi-hop communication to a sink that detects the event. To improve the event detection reliability, usually timely delivery of a certain number of packets is required. Traditional timing analysis of WSNs are, however, either focused on individual packets or traffic flows from individual nodes. In this paper, a spatio-temporal fluid model is developed to capture the delay characteristics of event …

Information Leakage Through Second Hand Usb Flash Drives Within The United Kingdom, Widya Chaerani, Nathan Clarke, Christopher Bolan

Australian Digital Forensics Conference

The pervasiveness of flash based USB storage alongside increasing capacity and lowering price points has lead to a documented potential for information leakage. Such a potential is significantly raised when employees are able to use personal devices within a business environment with little regard to safe disposal practices. This study purchased a range of USB storage devices from UK based auction sites to determine what if any data was recoverable. The study found a total of 36136 recoverable files including a range of data detailing private information of previous owners, confidential corporate data, with twenty percent of the purchased USB …

The Potential Role Of Business Intelligence In Church Organizations, Charmaine Felder

Walden Dissertations and Doctoral Studies

Business intelligence (BI) involves transforming data into actionable information to make better business decisions that may help improve operations. Although businesses have experienced success with BI, how leaders of church organizations might be able to exploit the advantages of BI in church organizations remains largely unexplored. The purpose of the phenomenological study was to explore the perceptions of pastoral leaders concerning the potential usefulness of BI in church organizations. Conceptual support for the study was based on the premise that churches may also benefit from BI that helps improve decision making and organizational performance. Three research questions were used to …

Learning Without Onboarding: How Assessing And Evaluating Learning Benefits New Information Technology Hires, Dory L. Morris

Walden Dissertations and Doctoral Studies

Onboarding ensures learning success through sharing and acquiring knowledge to remain competitive. However, little is known about new Information Technology (IT) hires' learning needs in the absence of onboarding; therefore, the purpose of this case study was to examine, increase, and retain their technical knowledge at the Unified Communications Company (UCC). Following the theoretical model of knowledge management, which holds that knowledge is the key to confirm learning and knowledge sharing, the research questions were used to examine how the company assessed and increased their technical knowledge and how they taught their culture in the absence of onboarding. A qualitative …

Asset Reuse Of Images From A Repository, Deirdre Herman

Walden Dissertations and Doctoral Studies

According to Markus's theory of reuse, when digital repositories are deployed to collect and distribute organizational assets, they supposedly help ensure accountability, extend information exchange, and improve productivity. Such repositories require a large investment due to the continuing costs of hardware, software, user licenses, training, and technical support. The problem addressed in this study was the lack of evidence in the literature on whether users in fact reused enough digital assets in repositories to justify the investment. The objective of the study was to investigate the organizational value of repositories to better inform architectural, construction, software and other industries whether …

Understanding The Management Of Information Security Controls In Practice, Daniel Bachlechner, Ronald Maier, Frank Innerhofer-Oberperfler, Lukas Demetz

Australian Information Security Management Conference

The ever greater reliance on complex information technology environments together with dynamically changing threat scenarios and increasing compliance requirements make an efficient and effective management of information security controls a key concern for most organizations. Good practice collections such as COBIT and ITIL as well as related standards such as the ones belonging to the ISO/IEC 27000 family provide useful starting points for control management. However, neither good practice collections and standards nor scholarly literature explain how the management of controls actually is performed in organizations or how the current state-of-practice can be improved. A series of interviews with information …

A Risk Index Model For Security Incident Prioritisation, Nor Badrul Anuar, Steven Furnell, Maria Papadaki, Nathan Clarke

Australian Information Security Management Conference

With thousands of incidents identified by security appliances every day, the process of distinguishing which incidents are important and which are trivial is complicated. This paper proposes an incident prioritisation model, the Risk Index Model (RIM), which is based on risk assessment and the Analytic Hierarchy Process (AHP). The model uses indicators, such as criticality, maintainability, replaceability, and dependability as decision factors to calculate incidents’ risk index. The RIM was validated using the MIT DARPA LLDOS 1.0 dataset, and the results were compared against the combined priorities of the Common Vulnerability Scoring System (CVSS) v2 and Snort Priority. The experimental …

Seniors Language Paradigms: 21st Century Jargon And The Impact On Computer Security And Financial Transactions For Senior Citizens, David M. Cook, Patryk Szewczyk, Krishnun Sansurooah

Australian Information Security Management Conference

Senior Citizens represent a unique cohort of computer users insomuch as they have come to the field of computer usage later in life, as novices compared to other users. As a group they exhibit a resentment, mistrust and ignorance towards cyber related technology that is born out of their educational and social experiences prior to widespread information technology. The shift from analogue to digital proficiency has been understated for a generation of citizens who were educated before computer usage and internet ubiquity. This paper examines the language difficulties encountered by senior citizens in attempting to engage in banking and communications …

Human-Related Information Security Problems Faced By British Companies In Economically Rising Countries, Suchinthi Fernando, Tatsuo Asai

Australian Information Security Management Conference

In some cases, global businesses expansion leads to human-related problems due to cultural differences between investor countries and investee countries. This study focuses on such problems in the area of information security. Potential problems which British companies may face in rising economies are discussed here. Russia, India and China, where UK is one of the key investors, are examined. Potential problems were developed by using Hofstede’s framework of culture and the recently proposed theory of Level of Potential (LoP) was adopted to predict their magnitudes. Three online surveys were conducted in Russia, India and China to evaluate the severity of …

Out-Of-Band Wormhole Attack Detection In Manets, Sana Ul Haq, Faisal B. Hussain

Australian Information Security Management Conference

Mobile Ad hoc Networks (MANETs) are prone to a variety of attacks due to their unique characteristics such as dynamic topology, open wireless medium, absence of infrastructure, multi hop nature and resource constraints. Any node in mobile ad hoc networks operates not only as end terminal but both as an intermediate router and client. In this way, multi-hop communication occurs in MANETs and thus it is a difficult task to establish a secure path between source and destination. The purpose of this work is overcome a special attack called wormhole attack launched by at least two colluding nodes within the …

A Preliminary Investigation Of Distributed And Cooperative User Authentication, C G. Hocking, S M. Furnell, N L. Clarke, P L. Reynolds

Australian Information Security Management Conference

Smartphones and other highly mobile yet sophisticated technologies are rapidly spreading through society and increasingly finding their way into pockets and handbags. As reliance upon these intensifies and familiarity grows, human nature dictates that more and more personal details and information is now to be found upon such devices. The need to secure and protect this valuable and desirable information is becoming ever more prevalent. Building upon previous work which proposed a novel approach to user authentication, an Authentication Aura, this paper investigates the latent security potential contained in surrounding devices in everyday life. An experiment has been undertaken to …