Computer Sciences Commons^™

Clustering Spatial Data For Join Operations Using Match-Based Partition, Jitian Xiao

Research outputs pre 2011

The spatial join is an operation that combines two sets of spatial data by their spatial relationships. The cost of spatial join could be very high due to the large sizes of spatial objects and the computation-intensive spatial operations. In spatial join processing, a common method to minimize the I/O cost is to partition the spatial objects into clusters and then schedule the processing of the clusters such that the number of times the same objects to be fetched into memory can be minimized. In this paper, we propose a match-based approach to partition a large spatial data set into …

Approximate String Matching With Dynamic Programming And Suffix Trees, Leng Hui Keng

UNF Graduate Theses and Dissertations

The importance and the contribution of string matching algorithms to the modern society cannot be overstated. From basic search algorithms such as spell checking and data querying, to advanced algorithms such as DNA sequencing, trend analysis and signal processing, string matching algorithms form the foundation of many aspects in computing that have been pivotal in technological advancement.

In general, string matching algorithms can be divided into the categories of exact string matching and approximate string matching. We study each area and examine some of the well known algorithms. We probe into one of the most intriguing data structure in string …

Addressing Cheating And Workload Characterization In Online Games, Christopher Chambers

Dissertations and Theses

The Internet has enabled the popular pastime of playing video games to grow rapidly by connecting game players in disparate locations. However, with popularity have come the two challenges of hosting a large number of users and detecting cheating among users. For reasons of control, security, and ease of development, the most popular system for hosting on-line games is the client server architecture. This is also the most expensive and least scalable architecture for the game publisher, which drives hosting costs upwards with the success of the game. In addition to the expense of hosting, as a particular game grows …

Agent-Based Similarity-Aware Web Document Pre-Fetching, Jitian Xiao

Research outputs pre 2011

This paper presents an agent-based similarity-aware Web document pre-fetching scheme that is built on the similarity-aware Web caching architecture. A set of agents are employed to carry out certain duties such as document similarity detection, identification of relevant access patterns, document prediction and network traffic monitoring for document pre-fetching. Preliminary simulations have been conducted to evaluate the proposed scheme, and the results have shown that the new pre-fetching scheme outperforms existing Web-document pre-fetching algorithms

Home Networking, George K. Thiruvathukal

Computer Science: Faculty Publications and Other Works

My coeditors (Paul Dubois and Konstantin Läufer) and I are among a growing number of individuals who install and maintain a home computer network. When Paul and I first discussed the idea of writing an article about the subject several months ago, my first thought was that you--our cherished readers-might consider this whole notion so trivial as to not be worthy of a column that focuses mostly on scientific programming and software development topics. But based on the realization that we three computer scientists devote a significant part of our time to network and system administration, it almost goes without …

Development And Delivery Of Coursework: The Legal/Regulatory/Policy Environment Of Cyberforensics, John W. Bagby, John C. Ruhnka

Journal of Digital Forensics, Security and Law

This paper describes a cyber-forensics course that integrates important public policy and legal issues as well as relevant forensic techniques. Cyber-forensics refers to the amalgam of multi-disciplinary activities involved in the identification, gathering, handling, custody, use and security of electronic files and records, involving expertise from the forensic domain, and which produces evidence useful in the proof of facts for both commercial and legal activities. The legal and regulatory environment in which electronic discovery takes place is of critical importance to cyber-forensics experts because the legal process imposes both constraints and opportunities for the effective use of evidence gathered through …

Table Of Contents

Journal of Digital Forensics, Security and Law

No abstract provided.

Table Of Contents

Journal of Digital Forensics, Security and Law

No abstract provided.

Is Forensic Computing A Profession? Revisiting An Old Debate In A New Field, Bernd C. Stahl

Journal of Digital Forensics, Security and Law

Forensic Computing is a new and quickly developing field. It is in the process of becoming an academic discipline or sub-discipline with all the features from full undergraduate and postgraduate course provision to conferences and journals. An important question in this process of turning into an established discipline is whether it will coincide with the recognition of the graduates as professionals. This paper hopes to stimulate the debate as to whether forensic computing is or should be a discipline. In order to approach this question, the paper will discuss the concept of forensic computing including the most salient topics of …

Development Of An Ontology Based Forensic Search Mechanism: Proof Of Concept, Jill Slay, Fiona Schulz

Journal of Digital Forensics, Security and Law

This paper examines the problems faced by Law Enforcement in searching large quantities of electronic evidence. It examines the use of ontologies as the basis for new forensic software filters and provides a proof of concept tool based on an ontological design. It demonstrates that efficient searching is produced through the use of such a design and points to further work that might be carried out to extend this concept.

Table Of Contents

Journal of Digital Forensics, Security and Law

No abstract provided.

The 2006 Analysis Of Information Remaining On Disks Offered For Sale On The Second Hand Market, Andy Jones, Craig Valli, Iain Sutherland, Paula Thomas

Journal of Digital Forensics, Security and Law

All organisations, whether in the public or private sector, use computers for the storage and processing of information relating to their business or services, their employees and their customers. A large proportion of families and individuals in their homes now also use personal computers and, both intentionally and inadvertently, often store on those computers personal information. It is clear that most organisations and individuals continue to be unaware of the information that may be stored on the hard disks that the computers contain, and have not considered what may happen to the information after the disposal of the equipment.

In …

Computer Forensics Field Triage Process Model, Marcus K. Rogers, James Goldman, Rick Mislan, Timothy Wedge, Steve Debrota

Journal of Digital Forensics, Security and Law

With the proliferation of digital based evidence, the need for the timely identification, analysis and interpretation of digital evidence is becoming more crucial. In many investigations critical information is required while at the scene or within a short period of time - measured in hours as opposed to days. The traditional cyber forensics approach of seizing a system(s)/media, transporting it to the lab, making a forensic image(s), and then searching the entire system for potential evidence, is no longer appropriate in some circumstances. In cases such as child abductions, pedophiles, missing or exploited persons, time is of the essence. In …

Hybrid Committee Classifier For A Computerized Colonic Polyp Detection System, Jiang Li, Jianhua Yao, Nicholas Petrick, Ronald M. Summers, Amy K. Hara, Joseph M. Reinhardt (Ed.), Josien P.W. Pluim (Ed.)

Electrical & Computer Engineering Faculty Publications

We present a hybrid committee classifier for computer-aided detection (CAD) of colonic polyps in CT colonography (CTC). The classifier involved an ensemble of support vector machines (SVM) and neural networks (NN) for classification, a progressive search algorithm for selecting a set of features used by the SVMs and a floating search algorithm for selecting features used by the NNs. A total of 102 quantitative features were calculated for each polyp candidate found by a prototype CAD system. 3 features were selected for each of 7 SVM classifiers which were then combined to form a committee of SVMs classifier. Similarly, features …

Preface, Djamal Benslimane, Chirine Ghedira, Zakaria Maamar

All Works

No abstract provided.

Using Cognitive Mapping Techniques To Supplement Uml And Up In Information Requirements Determination, Keng Siau, Tan Xin

Research Collection School Of Computing and Information Systems

Information requirements determination is a critical task in system development projects. Many human issues may hinder the efforts to accurately capture and clearly understand users' information requirements. In this paper, we review the cognitive underpinnings of some human issues, which are discussed in existing literature and relevant to information requirements determination. We then propose the use of cognitive mapping techniques in the process of information requirements determination. Three widely used cognitive mapping techniques - causal mapping, semantic mapping, and concept mapping – are briefly introduced in this article. A case is used to illustrate how to use these cognitive mapping …

A Comparison Of Methods To Construct An Optimal Membership Function In A Fuzzy Database System, Joanne Marie Cunningham

Theses and Dissertations

A fuzzy set is one in which membership in a category is not Boolean, rather items have a degree of membership. Fuzzy databases expand on this idea by storing fuzzy data and allowing data to be retrieved based on its degree of membership. Determining the degree of membership that satisfies the largest number of users is difficult. Five different methods of determining the membership function: the Direct Rating Method, the Random Method with step sizes of .02 and .03, the Steplock Method, and the Weighted Average Method, were compared on the basis of convergence and user satisfaction. The results support …

K X N Trust-Based Agent Reputation, Christopher Alonzo Parker

Theses and Dissertations

In this research, a multi-agent system called KMAS is presented that models an environment of intelligent, autonomous, rational, and adaptive agents that reason about trust, and adapt trust based on experience. Agents reason and adapt using a modification of the k-Nearest Neighbor algorithm called (k X n) Nearest Neighbor where k neighbors recommend reputation values for trust during each of n interactions. Reputation allows a single agent to receive recommendations about the trustworthiness of others. One goal is to present a recommendation model of trust that outperforms MAS architectures relying solely on direct agent interaction. A second goal is to …

Membership Functions For A Fuzzy Relational Database: A Comparison Of The Direct Rating And New Random Proportional Methods, Shweta Sanghi

Theses and Dissertations

Fuzzy relational databases deal with imprecise data or fuzzy information in a relational database. The purpose of this fuzzy database implementation is to retrieve images by using fuzzy queries whose common-language descriptions are defined by the consensus of a particular user community. The fuzzy set, which is presentation of fuzzy attribute values of the images, is determined through membership function. This paper compares two methods of constructing membership functions, the Direct Rating and New Random Proportional, to determine which method gives maximum users satisfaction with minimum feedback from the community. The statistical analysis of results suggests the use of Direct …

Real-Time Memory Management: Life And Times, Andrew Borg, Andy Wellings, Christopher Gill, Ron K. Cytron

All Computer Science and Engineering Research

As high integrity real-time systems become increasingly large and complex, forcing a static model of memory usage becomes untenable. The challenge is to provide a dynamic memory model that guarantees tight and bounded time and space requirements without overburdening the developer with memory concerns. This paper provides an analysis of memory management approaches in order to characterise the tradeoffs across three semantic domains: space, time and a characterisation of memory usage information such as the lifetime of objects. A unified approach to distinguishing the merits of each memory model highlights the relationship across these three domains, thereby identifying the class …

Supporting Collaborative Behavior In Manets Using Workflows, Rohan Sen, Gregory Hackmann, Mart Haitjema, Gruia-Catalin Roman, Gill

All Computer Science and Engineering Research

Groupware activities provide a powerful representation for many collaborative tasks. Today, the technologies that support typical groupware applications often assume a stable wired network infrastructure. The potential for collaboration in scenarios that lack this fixed infrastructure remains largely untapped. Such scenarios include activities on construction sites, wilderness exploration, disaster recovery, and rapid intervention teams. Communication in these scenarios can be supported using wireless ad hoc networks, an emerging technology whose full potential is yet to be understood and realized. In this paper, we consider the fundamental technical issues that need to be addressed in order to introduce groupware concepts into …

Three Dimensional Panoramic Fast Flourescence Imaging Of Cardiac Arryhtymias In The Rabbit Heart, Fujian Qu, Vladimir P. Nikolski, Cindy Grimm, Igor R. Efimov

All Computer Science and Engineering Research

Cardiac high spatio-temporal optical mapping provides a unique opportunity to investigate the dynamics of propagating waves of excitation during ventricular arrhythmia and defibrillation. However, studies using single camera imaging systems are hampered by the inability to monitor electrical activity from the entire surface of the heart. We have developed a three dimensional panoramic imaging system which allows high-resolution and high-dynamic-range optical mapping from the entire surface of the heart. Rabbit hearts (n=4) were Langendorff perfused and imaged by the system during sinus rhythm, epicardial pacing, and arrhythmias. The reconstructed 3D electrical activity provides us with a powerful tool to investigate …

Discovering Weak Community Structures In Large Biological Networks , Jianhua Ruan, Weixiong Zhang

All Computer Science and Engineering Research

Identifying intrinsic structures in large networks is a fundamental problem in many fields, such as biology, engineering and social sciences. Motivated by biology applications, in this paper we are concerned with identifying community structures, which are densely connected sub-graphs, in large biological networks. We address several critical issues for finding community structures. First, biological networks directly constructed from experimental data often contain spurious edges and may also miss genuine connections. As a result, community structures in biological networks are often weak. We introduce simple operations to capture local neighborhood structures for identifying weak communities. Second, we consider the issue of …

Automatic Application-Specific Customization Of Softcore Processor Microarchitecture, Masters Thesis, May 2006, Shobana Padmanabhan

All Computer Science and Engineering Research

Applications for constrained embedded systems are subject to strict runtime and resource utilization bounds. With soft core processors, application developers can customize the processor for their application, constrained by available hardware resources but aimed at high application performance. The more reconfigurable the processor is, the more options the application developers will have for customization and hence increased potential for improving application performance. However, such customization entails developing in-depth familiarity with all the parameters, in order to configure them effectively. This is typically infeasible, given the tight time-to-market pressure on the developers. Alternatively, developers could explore all possible configurations, but being …

Manifold Learning For Natural Image Sets, Doctoral Dissertation August 2006, Richard Souvenir

All Computer Science and Engineering Research

The field of manifold learning provides powerful tools for parameterizing high-dimensional data points with a small number of parameters when this data lies on or near some manifold. Images can be thought of as points in some high-dimensional image space where each coordinate represents the intensity value of a single pixel. These manifold learning techniques have been successfully applied to simple image sets, such as handwriting data and a statue in a tightly controlled environment. However, they fail in the case of natural image sets, even those that only vary due to a single degree of freedom, such as a …

Design Issues Of Reserved Delivery Subnetworks, Doctoral Dissertation, May 2006, Ruibiao Qiu

All Computer Science and Engineering Research

The lack of per-flow bandwidth reservation in today's Internet limits the quality of service that an information service provider can provide. This dissertation introduces the reserved delivery subnetwork (RDS), a mechanism that provides consistent quality of service by implementing aggregate bandwidth reservation. A number of design and deployment issues of RDSs are studied. First, the configuration problem of a single-server RDS is formulated as a minimum concave cost network flow problem, which properly reflects the economy of bandwidth aggregation, but is also an NP-hard problem. To make the RDS configuration problem tractable, an efficient approximation heuristic, largest demands first (LDF), …

A Theory Of Load Adjustments And Its Implications For Congestion Control, Sergey Gorinsky, Manfred Georg, Maxim Podlesny, Christoph Jechlitschek

All Computer Science and Engineering Research

Multiplicative Increase (MI), Additive Increase (AI), and Multiplicative Decrease (MD) are linear adjustments used extensively in networking. However, their properties are not fully understood. We analyze responsiveness (time for the total load to reach the target load), smoothness (maximal size of the total load oscillations after reaching the target load), fairing speed (speed of convergence to equal individual loads) and scalabilities of MAIMD algorithms, which generalize AIMD algorithms via optional inclusion of MI. We prove that an MAIMD can provide faster asymptotic fairing than a less smooth AIMD. Furthermore, we discover that loads under a specific MAIMD converge from any …

Perceptually Meaningful Image Editing: Depth, Reynold J. Bailey, Cindy Grimm

All Computer Science and Engineering Research

We introduce the concept of perceptually meaningful image editing and present two techniques for manipulating the apparent depth of objects in an image. The user loads an image, selects an object and specifies whether the object should appear closer or further away. The system automatically determines target values for the object and/or background that achieve the desired depth change. These depth editing operations, based on techniques used by traditional artists, manipulate either the luminance or color temperature of different regions of the image. By performing blending in the gradient domain and reconstruction with a Poisson solver, the appearance of false …

Towards A Unified Radio Power Management Architecture For Wireless Sensor Networks, Kevin Klues, Guoliang Xing, Chenyang Lu

All Computer Science and Engineering Research

In many wireless sensor networks, energy is an extremely limited resource. While many different power management strategies have been proposed to help reduce the amount of energy wasted, application developers still face two fundamental challenges when developing systems with stringent power constraints. First, existing power management strategies are usually tightly coupled with network protocols and other system functionality. This monolithic approach has led to standalone solutions that cannot easily be reused or extended to other applications or platforms. Second, different power management strategies make different and sometimes even conflicting assumptions about the rest of the system with which they need …

Design And Evaluation Of A Blast Ungapped Extension Accelerator, Master's Thesis, Joseph M. Lancaster

All Computer Science and Engineering Research

The amount of biosequence data being produced each year is growing exponentially. Extracting useful information from this massive amount of data is becoming an increasingly difficult task. This thesis focuses on accelerating the most widely-used software tool for analyzing genomic data, BLAST. This thesis presents Mercury BLAST, a novel method for accelerating searches through massive DNA databases. Mercury BLAST takes a streaming approach to the BLAST computation by offloading the performance-critical sections onto reconfigurable hardware. This hardware is then used in combination with the processor of the host system to deliver BLAST results in a fraction of the time of …