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

Computer Sciences Commons™

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

University of Texas at Arlington

Discipline
Keyword
Publication Year
Publication
Publication Type
File Type

Articles 631 - 660 of 666

Full-Text Articles in Computer Sciences

Estream: An Integration Of Event And Stream Processing, Vihang Garg Dec 2005

Estream: An Integration Of Event And Stream Processing, Vihang Garg

Computer Science and Engineering Theses - Archive

Event and stream data processing models have been researched extensively and are utilized in diverse application domains. Advanced applications require both event and stream processing, which is currently not supported. Although there are number of similarities and differences between them, a synergistic integration of their strengths will be better than the sum of their parts. In this thesis, we present EStream, an integrated event and stream processing system for monitoring changes on stream computations and for expressing and processing complex events on continuous queries (CQs). We introduce attribute-based constraints for reducing uninteresting events that are generated from CQs. We discuss …

Go to article

Testing Java Monitors By State Space Exploration, Monica Maria Hernandez Dec 2005

Testing Java Monitors By State Space Exploration, Monica Maria Hernandez

Computer Science and Engineering Theses - Archive

Java monitors are classes that are intended to be accessed by multiple threads at the same time. Detecting synchronization faults in Java Monitors is considerably more challenging than testing regular classes, due to the inherent non-determinism of concurrent programs. This thesis proposes a state based exploration approach to testing Java monitors. This approach consists of exploring the state space of a Java monitor in a depth-first manner, dynamically building test sequences, which are comprised by the states explored along each path. Moreover, threads are introduced on the fly during the exploration of each path, based on several rules for simulating …

Go to article

Hdb-Subdue, A Relational Database Approach To Graph Mining And Hierarchical Reduction, Srihari Padmanabhan Dec 2005

Hdb-Subdue, A Relational Database Approach To Graph Mining And Hierarchical Reduction, Srihari Padmanabhan

Computer Science and Engineering Theses - Archive

Data mining aims at discovering interesting and previously unknown patterns from data sets. Transactional mining (association rules, decision trees etc.) can be effectively used to find non-trivial patterns in categorical and unstructured data. For applications that have an inherent structure (e.g., chemical compounds, proteins) graph mining is appropriate, because mapping the structured data into other representations would lead to loss of structure. The need for mining structured data has increased in the past few years. Graph mining uses graph theory principles to perform mining. Database mining of graphs aims at mining structured graph data stored in relational database tables using …

Go to article

Graph-Based Learning Using A Naive Bayesian Classifier, Robert Hawes Dec 2005

Graph-Based Learning Using A Naive Bayesian Classifier, Robert Hawes

Computer Science and Engineering Theses - Archive

Graph-based data representation is becoming increasingly more commonplace, as graphs can represent some kinds of data more efficiently than relational tables. As such, interesting patterns in the form of subgraphs can be discovered by mining these graph-based datasets. Because the learned patterns can be used to predict future occurrences, it is necessary to learn graphical concepts that can optimally classify the data in the presence of uncertainty. This work explores the construction and learning of optimal naïve Bayesian graph classifiers to distinguish between positive and negative graphs given a set of graphs as examples. Whereas most previous work in graph-based …

Go to article

Approaches For Validating Frequent Episodes Based On Periodicity In Time-Series Data, Dhawal Y. Bhatia Dec 2005

Approaches For Validating Frequent Episodes Based On Periodicity In Time-Series Data, Dhawal Y. Bhatia

Computer Science and Engineering Theses - Archive

There is ongoing research on sequence mining of time-series data. We study Hybrid Apriori, an interval-based approach to episode discovery that deals with different periodicities in time-series data. Our study identifies the anomaly in the Hybrid Apriori by confirming the false positives in the frequent episodes discovered. The anomaly is due to the folding phase of the algorithm, which combines periods in order to compress data. We propose a main memory based solution to distinguish the false positives from the true frequent episodes. Our algorithm to validate the frequent episodes has several alternatives such as the naïve approach, the partitioned …

Go to article

Csegrid Portal: A Secure Web-Based Solution For Providing Ubiquitious Access To Grid Services (Design, Development And Implementation Of A Prototype), Srikant D. Rao Dec 2005

Csegrid Portal: A Secure Web-Based Solution For Providing Ubiquitious Access To Grid Services (Design, Development And Implementation Of A Prototype), Srikant D. Rao

Computer Science and Engineering Theses - Archive

Grid computing is emerging as a revolutionary concept for performing high performance computations on the grid. The grid infrastructure comprises of a large set of distributed computing resources that are shared across geographical and organizational boundaries. There is a need within the scientific community for friendly interfaces that can be used to obtain ubiquitous access to the grid resources. In this work, we address these needs by designing and implementing a web-based grid portal system (CSEGrid) that provides the user with transparent access to grid services like job submission, job status and resource monitoring, data transfer between grid resources, etc. …

Go to article

Solving The Rubik's Cube With Parallel Processing, Aslesha Pramod Nargolkar Dec 2005

Solving The Rubik's Cube With Parallel Processing, Aslesha Pramod Nargolkar

Computer Science and Engineering Theses - Archive

This thesis investigates parallel processing techniques for solving the 3 x 3 x 3 Rubik's Cube. We explore various state-space search based algorithmic approaches to optimally solve the Cube. The parallel processing approach is based on IDA* using a pattern database as the underlying heuristic because of its well established effectiveness. The parallel algorithm is an extension of the Michael Reid algorithm which is sequential. The parallel algorithm exhibits good speedup and scalability. Nearly 150 random as well as symmetrical cube configurations were tested for the experiments on sequential and parallel implementations. The proposed parallel algorithm using master-slave type of …

Go to article

Evolving Modular Programs By Extracting Reusable Functions Using Significance Testing, Anthony Loeppert Dec 2005

Evolving Modular Programs By Extracting Reusable Functions Using Significance Testing, Anthony Loeppert

Computer Science and Engineering Theses - Archive

Genetic programming is an automatic programming method that uses biologically inspired methods to evolve programs. Genetic programming, and evolutionary methods in general, are useful for problem domains in which a method for \emph{constructing} solutions is either not known or infeasible, but a method for \emph{rating} solutions exists. In order to address more complex problem domains, techniques exist to extract functions (modules) automatically during a GP search. This work describes a method to identify useful automatically extracted functions from a GP search to assist subsequent GP searches within the same problem domain, using significance testing. Functions classified as beneficial augment the …

Go to article

Efficient Xquery Processing Of Streamed Xml Fragments, Seo Young Ahn Nov 2005

Efficient Xquery Processing Of Streamed Xml Fragments, Seo Young Ahn

Computer Science and Engineering Theses - Archive

XStreamCast is a push-based streamed XML query processing system that supports multiple servers and clients. The servers broadcast streamed XML data while the clients register to these servers for a specific service and process streamed XML fragments. This thesis presents methods for efficient XQuery processing of streamed XML fragments for the client. The XQuery parser parses the XQuery given by the user first. The client processes the fragments and stores only the needed data for the query. The query is then applied to stored XML fragments. This system can be valuable for managing the memory of the client because it …

Go to article

A Novel Game Theoretic Framework For Security In Wireless Sensor Networks, Afrand Agah Nov 2005

A Novel Game Theoretic Framework For Security In Wireless Sensor Networks, Afrand Agah

Computer Science and Engineering Dissertations - Archive

Due to severe resource limitations and often lack of centralized infrastructure, providing security in wireless sensor networks is a great challenge. Misbehavior due to malicious or faulty nodes can significantly degrade the performance of such networks. Therefore, countermeasures against denial of service (DoS) attacks and node misbehavior are essential requirements. We argue that the conventional view of security based on cryptography techniques is not sufficient for securing wireless sensor networks. In this dissertation, we investigate a novel framework by proposing three approaches for security enforcement in such networks that range from prevention of DoS attacks to secure routing. Prevention of …

Go to article

Querying Microarray Databases, Zoe Alexandra Raja Nov 2005

Querying Microarray Databases, Zoe Alexandra Raja

Computer Science and Engineering Theses - Archive

Microarray technology has rapidly taken a key position among bioinformatics research tools. After the completion of the Human Genome Project, microarray databases have become particularly important to the management and analysis of genomic data. These databases are ideal tools for many research areas involving gene expression patterns under different experimental conditions. This work attempts to assess the querying capabilities of current public microarray database implementations by evaluating their data management, query interfaces, and results presentation. We are not aware of any comparative study available to date that evaluates this important class of biological databases. We examine and evaluate how several …

Go to article

Repclass: Cluster And Grid Enabled Automatic Classification Of Transposable Elements Identified De Novo In Genome Sequences, Nirmal Ranganathan Nov 2005

Repclass: Cluster And Grid Enabled Automatic Classification Of Transposable Elements Identified De Novo In Genome Sequences, Nirmal Ranganathan

Computer Science and Engineering Theses - Archive

In the last few years many computer and laboratory improvements in the production and analysis of DNA sequences have made possible the complete sequencing of whole genomes. This provides us with a wealth of raw genomes that needs to be processed and annotated. 5% to 80% of eukaryotic genomes contain repetitive DNA consisting of transposable elements and tandem repeats which needs to be identified, classified and annotated in order to sequence and annotate the entire genome accurately. Existing tools allow us to identify and annotate transposable elements (TE) but no tool exists for their classification. This thesis work introduces REPCLASS …

Go to article

Application Of Graph-Based Data Mining To Biological Networks, Chang Hun You Nov 2005

Application Of Graph-Based Data Mining To Biological Networks, Chang Hun You

Computer Science and Engineering Theses - Archive

A huge amount of biological data has been generated by long-term research. It is time to start to focus on a system-level understanding of bio-systems. Biological networks are networks of biochemical reactions, containing various objects and their relationships. Understanding of biological networks is a starting point of systems biology. Multi-relational data mining finds the relational patterns in both the entity attributes and relations in the data. A widely used representation for relational data is a graph consisting of vertices and edges between these vertices. Graph-based data mining, as one approach of multi-relational data mining, finds relational patterns in a graph …

Go to article

Enhancements To The Sam-Grid Infrastructure, Bimal Balan Nov 2005

Enhancements To The Sam-Grid Infrastructure, Bimal Balan

Computer Science and Engineering Theses - Archive

SAM-Grid is a grid computing infrastructure for high energy physics (HEP) experiments in Fermilab. It is composed of data handling, job management and information management components. There are several challenges when the number of sites participating in the experiment increases. This thesis presents the enhancements made on the SAM-Grid infrastructure. This includes scalability and performance related enhancements. The enhancements mainly affect the batch adapter, monitoring and security layers. As a scalability aspect, Monitoring and Information services required changes to make it easier for monitoring large number of jobs. SAM-Grid is integrated with Sun Grid Engine (SGE) batch system. The batch …

Go to article

Adaptive Agent Communities For Providing Services In Dynamic Networks, Nayantara Mallesh Nov 2005

Adaptive Agent Communities For Providing Services In Dynamic Networks, Nayantara Mallesh

Computer Science and Engineering Theses - Archive

New network applications are being created everyday to accommodate diverse user needs. Delivering services to the user in a timely manner taking into account network conditions, resources allocated and network load is a challenge. Multiprotocol Label Switching attempts to overcome best-effort service by providing a method for routing traffic around network congestion, resource reservation and quality of service (QoS) capabilities. IntServ and DiffServ are two other QoS models in use today. IntServ provides per-flow guarantee of quality while DiffServ is based on aggregate service classes. Adaptive Network Service (ANS) is a community of adaptive, collaborating agents residing in the network …

Go to article

Multi-Dimensional Indexing For Xml Data, Do Youn Kim Nov 2005

Multi-Dimensional Indexing For Xml Data, Do Youn Kim

Computer Science and Engineering Theses - Archive

The Extensible Markup Language (XML) is becoming a dominant standard for exchanging and retrieving data over the internet. As XML in data exchanging grows, various XML indexing techniques have been proposed for fast and efficient query processing. A survey of theses techniques [9] categorized them into sequence-based indexes, structural indexes, dimension-based indexes and keyword-based indexes based on their properties. In this thesis, we focus on the multi-dimensional XML indexing; more precisely, it can be categorized as a 2-dimension based indexing, which is used in this paper. We studied the properties of multi-dimensional XML indexing and created an implementation to evaluate …

Go to article

Adaptive, Multimodal, Application Independent User Interfaces For People With Disabilites Using Computers, Padmapriya Sambath Nov 2005

Adaptive, Multimodal, Application Independent User Interfaces For People With Disabilites Using Computers, Padmapriya Sambath

Computer Science and Engineering Theses - Archive

The goal of this thesis is to create more adaptive and flexible user interfaces for people with disabilities and presenting information to everyone and on every device at any time. Delivering information at any time leads to situations such as a person walking with a mobile device having a small screen wanting to make a flight reservation. The intention of presenting information to everybody immediately raises the question of how much of the available information reach people with disabilities. We have suggested a content based user interface language that may be used by external services to interact with the user. …

Go to article

Service Discovery By Automated Structural And Semantic Matching, Alan Walker Nov 2005

Service Discovery By Automated Structural And Semantic Matching, Alan Walker

Computer Science and Engineering Theses - Archive

Pervasive computing systems need to locate and use services dynamically. Current models of service location and interaction rely on a fixed contract, or service description, located by name and/or a combination of keywords. This implies a priori agreement on the service description, leading to fragility and the inability for systems to interoperate unless they were built to match an existing standard. This thesis implements a technique for relaxing the fixed contract assumption, so that the nearest match amongst a set of services can be located. The system takes into account structural, data type and naming differences. The naming differences are …

Go to article

Integration Of The Sam-Grid Infrastructure To The D0 Data Reprocessing Effort, Anoop Rajendra Aug 2005

Integration Of The Sam-Grid Infrastructure To The D0 Data Reprocessing Effort, Anoop Rajendra

Computer Science and Engineering Theses - Archive

The D0 experiment is one of the two high energy physics experiments currently being conducted at Fermi National Accelerator Laboratory, in Batavia, IL, on what is currently the world's highest energy particle accelerator, the Tevatron. The experiment produces vast amounts of raw data of the order of several hundred terabytes. This data needs to be converted from the raw format that comes from the detector, ie. digitized data, to a format that is close to the physics, ie. data that can be subjected to analysis. This process, called reconstruction, is done according to constantly evolving and improving reconstruction algorithms. This …

Go to article

Structure Based Xml Indexing, Niroj Manandhar Aug 2005

Structure Based Xml Indexing, Niroj Manandhar

Computer Science and Engineering Theses - Archive

The increase in the usage and popularity of semi-structured data has received considerable attention, and a lot of research is going on for the efficient retrieval and storage of semi-structured data. A popular model and language for semi-structured data is XML. In this thesis we focus on the structure based indexing of XML. As a part of an ongoing XML indexing project, we study and implement A(k)-index, which is a structure based indexing technique; and propose the use of offset, length pair to retrieve nodes of interest. We record offset and length of every node using the SAX parser, and …

Go to article

A Framework For Supporting Quality Of Service Requirements In A Data Stream Management System, Qingchun Jiang Aug 2005

A Framework For Supporting Quality Of Service Requirements In A Data Stream Management System, Qingchun Jiang

Computer Science and Engineering Dissertations - Archive

Currently, a large class of data-intensive applications, in which data are presented in the form of continuous data streams rather than static relations, has been widely recognized in the database community. Not only is the size of the data for these applications unbounded and the data arrives in a highly bursty mode, but these applications have to conform to Quality of Service (QoS) requirements for processing continuous queries (CQs) over data streams. These characteristics make it infeasible to simply load the arriving data streams into a traditional database management system and use currently available techniques for their processing. Therefore, a …

Go to article

Finding Blood In Capsule Endoscopy Video, Jay Frederick Cox Aug 2005

Finding Blood In Capsule Endoscopy Video, Jay Frederick Cox

Computer Science and Engineering Theses - Archive

Capsule Endoscopy (CE) is a new procedure where endoscopists can visualize and discriminate anomalies of the human gastrointestinal track by allowing the patient to swallow a camera pill. The digital video obtained from the pill is used to safely pinpoint the location of these abnormalities in areas previously unavailable for view. One of the main functions of CE is determining the location of bleeding. Given Imaging, currently the only maker of a FDA approved CE device, has a proprietary and unspecified blood test, called Suspected Blood Index, which can be used to automatically detect where blood occurs in the video. …

Go to article

An Emperical Evaluation Of Adequacy Criteria For Testing Concurrent Programs, Gaurav Saini Aug 2005

An Emperical Evaluation Of Adequacy Criteria For Testing Concurrent Programs, Gaurav Saini

Computer Science and Engineering Theses - Archive

A concurrent program contains two or more threads that execute concurrently and work together to perform some task. Concurrency increases the efficiency of a program. Testing of concurrent programs has been a challenging task because of the inherent non-determinism. Most approaches proposed for concurrent program testing employ, explicitly or implicitly, a coverage criterion to measure test adequacy. In order to apply those approaches, we must first choose a criterion that suits best for our programs. There is a need for quantitative results of evaluation regarding the effectiveness of the various coverage criteria used for the testing of concurrent programs. Such …

Go to article

Comparison Of Search-Based And Kernel-Based Methods For Graph-Based Relational Learning, Chris Manuel Gonsalves Aug 2005

Comparison Of Search-Based And Kernel-Based Methods For Graph-Based Relational Learning, Chris Manuel Gonsalves

Computer Science and Engineering Theses - Archive

Graph-based relational learning has been the focus of relational learning for quite some time. As most of the real-world data is structured, and hence cannot be represented in a single table, various logic-based and graph-based techniques have been proposed for dealing with structured data. Our goal is to perform an in-depth analysis of two such graph-based learning systems. We have selected Subdue to represent the search-based approach and support vector machine (SVM) with graph kernels to represent the kernel-based approach. We perform a comparison between search-based and kernel-based approaches and evaluate their performance in various domains. A search-based approach to …

Go to article

A Framework For A Dynamic Invocation Interface And High-Level Interoperability For Mobile Agent Platforms, Vamsi K. Putrevu Aug 2005

A Framework For A Dynamic Invocation Interface And High-Level Interoperability For Mobile Agent Platforms, Vamsi K. Putrevu

Computer Science and Engineering Theses - Archive

The mobile agent paradigm for distributed systems is inherently suitable for many applications ranging from network management to e-commerce. One inherent problem to its wide spread use is communication between disparate agent platforms and reducing overheads while doing the same. Not all platforms for mobile agents are the same. The Mobile Agent Facility (MAF) proposal is an attempt to standardize this execution environment, this thesis proposes a framework extending the current MAF specification, by which inter-agent communication can be achieved in a more scalable fashion by interpreter based mobile agent systems. The future of the Internet depends on its ability …

Go to article

Monitoring And Analyzing Distributed Cluster Performance And Statistics Of Atlas Job Flow, Sreeranjani Ramprakash Aug 2005

Monitoring And Analyzing Distributed Cluster Performance And Statistics Of Atlas Job Flow, Sreeranjani Ramprakash

Computer Science and Engineering Theses - Archive

Grid3 is a Grid facility used by many High Energy Physics experiments to enable physicists to process data intensive and CPU intensive jobs more effectively as well as more efficiently. Amongst other things, the highlights of Grid3 are participation by more than 25 sites across the U.S. and Korea which collectively provide more than 2000 CPU's, resources used by seven different scientific applications, including three high energy physics simulations and four data analyses in high energy physics, bio-chemistry, astrophysics and astronomy, more than 100 individuals are currently registered with access to the Grid, a peak throughput of 500-900 jobs running …

Go to article

Sql-Based Approach To Significant Interval Discovery In Time-Series Data, Sunit Shrestha Aug 2005

Sql-Based Approach To Significant Interval Discovery In Time-Series Data, Sunit Shrestha

Computer Science and Engineering Theses - Archive

With time-series data, events (like turning off a light, opening garage door, turning on TV) occur with a high degree of certainty not at specific time points but within time intervals (sequence of time points). So, it is useful for applications to consider data as contiguous time points. The smallest interval that satisfies the criteria of interval-confidence (i.e., ratio of total support of participating time points and the number of days) is termed as Significant Interval (SI). Significant Interval Discovery (SID) algorithm finds SIs from time-series data. The main focus of this thesis is on the improvement of existing SID …

Go to article

Quantitative Comparison Of Two Approaches To Agent Cooperation, Jose Ramon Espino Aug 2005

Quantitative Comparison Of Two Approaches To Agent Cooperation, Jose Ramon Espino

Computer Science and Engineering Theses - Archive

Multi-agent systems (MASs) are characterized by collections of autonomous agents that interact with each other in simple ways, but the collection of agents as a whole is characterized by emergent behavior (EB) which will have properties that individual agents do not. Engineers want to design artificial MASs for a variety of reasons including military operations. The idea is for the EB to be carrying out the mission itself. In this scenario, the agents are relatively inexpensive and expendable. A large body of work exists in MAS research for military applications and a variety of different designs have been proposed. Because …

Go to article

Utility Based Resource Aware Framework For Information Caching And Sharing In Mobile And Distributed Systems, Huaping Shen Aug 2005

Utility Based Resource Aware Framework For Information Caching And Sharing In Mobile And Distributed Systems, Huaping Shen

Computer Science and Engineering Dissertations - Archive

Along with the technology advancements in mobile and wireless networks, ubiquitous information service is becoming a reality in which users can access the information anytime anywhere. However, the user mobility, network heterogeneity and resource constraints impose significant challenges to provide ubiquitous information services. In this dissertation, a utility based resource aware framework is proposed to enhance ubiquitous information availability to mobile users through data caching and peer-to-peer sharing. The framework considers the constrained resources of mobile and distributed environments and provides flexible, efficient and scalable data access services to the mobile users. The major contributions of this framework are as …

Go to article

Efficient And Adaptive Schemes For Consistent Information Sharing In Wireless Mobile And Peer-To-Peer Networks, Zhijun Wang Aug 2005

Efficient And Adaptive Schemes For Consistent Information Sharing In Wireless Mobile And Peer-To-Peer Networks, Zhijun Wang

Computer Science and Engineering Dissertations - Archive

With the tremendous growth of applications in wireless mobile and Peer-to-Peer (P2P) networks, significant research efforts have been made to improve the quality of sevice. Caching and replicating frequently used data objects or files in user's local buffers are popular mechanisms to effectively reduce the communication bandwidth requirement and thus improve the overall system performance. However, the frequent disconnections of users make data consistency a difficult task in wireless mobile and P2P networks. In this dissertation, we design and analyze a Scalable Asynchronous Cache Consistency Scheme (SACCS) for single cell wireless cellular networks. SACCS is a highly scalable, efficient, and …

Go to article

First Prev Next Last