Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Artificial Intelligence and Robotics (7)
- Engineering (3)
- Computer Engineering (2)
- Data Science (2)
- Other Computer Sciences (2)
-
- Social and Behavioral Sciences (2)
- Software Engineering (2)
- Systems Architecture (2)
- Art and Design (1)
- Arts and Humanities (1)
- Cognitive Science (1)
- Communication (1)
- Cybersecurity (1)
- Databases and Information Systems (1)
- Digital Communications and Networking (1)
- Electrical and Computer Engineering (1)
- Graphics and Human Computer Interfaces (1)
- Hardware Systems (1)
- Information Security (1)
- Painting (1)
- Signal Processing (1)
- Social Media (1)
- Social Work (1)
- Statistical Models (1)
- Statistics and Probability (1)
- Keyword
-
- Machine learning (19)
- Deep learning (12)
- Classification (5)
- Convolutional neural networks (5)
- Neural networks (5)
-
- Security (5)
- Big data (4)
- Computer vision (4)
- Data mining (4)
- Malware (4)
- MapReduce (4)
- Twitter (4)
- Analysis (3)
- Android (3)
- Cloud computing (3)
- Crowdsourcing (3)
- Fact-checking (3)
- Graph mining (3)
- MRQL (3)
- Multilayer networks (3)
- Privacy (3)
- Recurrent neural networks (3)
- Social media (3)
- AWS (2)
- Activity recognition (2)
- Apriori (2)
- Baum-Welch algorithm (2)
- Deep Learning (2)
- Deep neural networks (2)
- Degree centrality (2)
- Publication Year
- File Type
Articles 331 - 360 of 365
Full-Text Articles in Computer Sciences
Bridging Two Grids: The Sam-Grid/Lcg Integration Project, Tummalapalli Sudhamsh Reddy
Bridging Two Grids: The Sam-Grid/Lcg Integration Project, Tummalapalli Sudhamsh Reddy
Computer Science and Engineering Theses - Archive
SAM-Grid is an integrated data, job, and information management system. SAM-Grid addresses the distributed computing needs of the Dzero experiment at Fermi National Accelerator Laboratory, Batavia, IL. The system typically relies on SAM-Grid specific services deployed at the remote sites in order to manage the computing and storage resources. Such deployment requires special agreements with each resource provider, and it is a labor intensive process. Some members of the Dzero VO also have access to computing resources through the Large Hydron Collider Computing Grid (LCG) infrastructure. Therefore, Dzero users can enter into resource sharing agreements and deployment of standard middleware …
Interactive Animated Concept Map Generation - Using Dynamic Animations, Suneel Vana
Interactive Animated Concept Map Generation - Using Dynamic Animations, Suneel Vana
Computer Science and Engineering Theses - Archive
We present a visualization tool, which is useful for the illustration of educational concepts using interactive animated concept maps. This system serves as a presentation tool which provides a collection of multimedia elements (images, animations, audios clips and video clips), a collection of animated presentation templates and an interface by using which users can retrieve the multimedia elements from the multimedia database and generate the dynamic animations by placing the selected elements into the placeholders of the templates. The system generates the animated presentation by replacing embedded multimedia objects and their properties as desired by its users. A multimedia information …
Monitoring Health By Detecting Drifts And Outliers In Patterns Of An Inhabitant In A Smart Home, Gaurav Jain
Monitoring Health By Detecting Drifts And Outliers In Patterns Of An Inhabitant In A Smart Home, Gaurav Jain
Computer Science and Engineering Theses - Archive
The elderly, along with people with disabilities or chronic illness, are most often dependent on some kind of formal or informal care. They are forced to move to a place where they can be cared for. Automatic health monitoring allows them to maintain their independence and continue living at home longer by continuously providing key health and activity information to caregivers. In this thesis, we present a novel technique, called the Health Monitoring System (HMS), which is a data-driven automated monitoring system for detecting changes in the patterns of activities/inactivity, health data and the living environment. HMS classifies these changes …
Infosearch: A System For Searching And Retrieving Documents Using Complex Queries, Nikhil Deshpande
Infosearch: A System For Searching And Retrieving Documents Using Complex Queries, Nikhil Deshpande
Computer Science and Engineering Theses - Archive
The colossal amount of information available online has resulted in overloading users who need to navigate this information for their routine requirements. Although search engines have been effective in reducing this information overload, they support only queries involving keywords and Boolean operators. There are certain application domains where more expressive ways of searching are necessary. Consider searching a full-text patent database for documents containing more than n occurrences of a pattern, or for documents that have a particular pattern followed by another pattern within a specified interval. Such complex patterns involving pattern frequency and sequence, as well as patterns involving …
Customization Of A Generic Search Engine By Adding User Categories, Ajay Mohandas Madkaiker
Customization Of A Generic Search Engine By Adding User Categories, Ajay Mohandas Madkaiker
Computer Science and Engineering Theses - Archive
The current search engines available on the Net are generic in nature. They do not consider user preferences and treat all users information needs in the same way. As a result they frequently return a large number of links, that do not meet the user's information need. This requires more searching to find what the user is looking for. For example if a user is interested in a particular game, e.g. cricket, and enters the query world cup, a generic search engine would return links of all the sports that hold a world cup. The user has to browse through …
Estream: An Integration Of Event And Stream Processing, Vihang Garg
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 …
Testing Java Monitors By State Space Exploration, Monica Maria Hernandez
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 …
Hdb-Subdue, A Relational Database Approach To Graph Mining And Hierarchical Reduction, Srihari Padmanabhan
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 …
Graph-Based Learning Using A Naive Bayesian Classifier, Robert Hawes
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 …
Approaches For Validating Frequent Episodes Based On Periodicity In Time-Series Data, Dhawal Y. Bhatia
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 …
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. …
Solving The Rubik's Cube With Parallel Processing, Aslesha Pramod Nargolkar
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 …
Evolving Modular Programs By Extracting Reusable Functions Using Significance Testing, Anthony Loeppert
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 …
Efficient Xquery Processing Of Streamed Xml Fragments, Seo Young Ahn
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 …
Querying Microarray Databases, Zoe Alexandra Raja
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 …
Repclass: Cluster And Grid Enabled Automatic Classification Of Transposable Elements Identified De Novo In Genome Sequences, Nirmal Ranganathan
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 …
Application Of Graph-Based Data Mining To Biological Networks, Chang Hun You
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 …
Enhancements To The Sam-Grid Infrastructure, Bimal Balan
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 …
Adaptive Agent Communities For Providing Services In Dynamic Networks, Nayantara Mallesh
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 …
Multi-Dimensional Indexing For Xml Data, Do Youn Kim
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 …
Adaptive, Multimodal, Application Independent User Interfaces For People With Disabilites Using Computers, Padmapriya Sambath
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. …
Service Discovery By Automated Structural And Semantic Matching, Alan Walker
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 …
Integration Of The Sam-Grid Infrastructure To The D0 Data Reprocessing Effort, Anoop Rajendra
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 …
Structure Based Xml Indexing, Niroj Manandhar
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 …
Finding Blood In Capsule Endoscopy Video, Jay Frederick Cox
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. …
An Emperical Evaluation Of Adequacy Criteria For Testing Concurrent Programs, Gaurav Saini
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 …
Comparison Of Search-Based And Kernel-Based Methods For Graph-Based Relational Learning, Chris Manuel Gonsalves
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 …
A Framework For A Dynamic Invocation Interface And High-Level Interoperability For Mobile Agent Platforms, Vamsi K. Putrevu
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 …
Monitoring And Analyzing Distributed Cluster Performance And Statistics Of Atlas Job Flow, Sreeranjani Ramprakash
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 …
Sql-Based Approach To Significant Interval Discovery In Time-Series Data, Sunit Shrestha
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 …