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

Digital Commons Network™

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

Computer Sciences

Institution
Keyword
Publication Year
Publication
Publication Type
File Type

Articles 17971 - 18000 of 20641

Full-Text Articles in Entire DC Network

Interactive Animated Concept Map Generation - Using Dynamic Animations, Suneel Vana Dec 2005

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 …

Go to article

Monitoring Health By Detecting Drifts And Outliers In Patterns Of An Inhabitant In A Smart Home, Gaurav Jain Dec 2005

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 …

Go to article

Infosearch: A System For Searching And Retrieving Documents Using Complex Queries, Nikhil Deshpande Dec 2005

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 …

Go to article

Customization Of A Generic Search Engine By Adding User Categories, Ajay Mohandas Madkaiker Dec 2005

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 …

Go to article

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

Giving Users The Steering Wheel For Guiding Resource-Adaptive Systems, Joao Sousa, Rajesh Krishna Balan, Vahe Poladian, David Garlan, Mahadev Satyanarayanan Dec 2005

Giving Users The Steering Wheel For Guiding Resource-Adaptive Systems, Joao Sousa, Rajesh Krishna Balan, Vahe Poladian, David Garlan, Mahadev Satyanarayanan

Research Collection School Of Computing and Information Systems

Addressing resource variation plays an increasingly important role in engineering today's software systems. Research in resource-adaptive applications takes an important step towards addressing this problem. However, existing solutions stop short of addressing the fact that different user tasks often have specific goals of quality of service, and that such goals often entail multiple aspects of quality of service. This paper presents a framework for engineering software systems capable of adapting to resource variations in ways that are specific to the quality goals of each user task. For that, users are empowered to specify their task-specific preferences with respect to multiple …

Go to article

Matrix: Adaptive Middleware For Distributed Multiplayer Games, Rajesh Krishna Balan, Maria Ebling, Paul Castro, Archan Misra Dec 2005

Matrix: Adaptive Middleware For Distributed Multiplayer Games, Rajesh Krishna Balan, Maria Ebling, Paul Castro, Archan Misra

Research Collection School Of Computing and Information Systems

Building a distributed middleware infrastructure that provides the low latency required for massively multiplayer games while still maintaining consistency is non-trivial. Previous attempts have used static partitioning or client-based peer-to-peer techniques that do not scale well to a large number of players, perform poorly under dynamic workloads or hotspots, and impose significant programming burdens on game developers. We show that it is possible to build a scalable distributed system, called Matrix, that is easily usable by game developers. We show experimentally that Matrix provides good performance, especially when hotspots occur.

Go to article

A Generic Object-Oriented Tabu Search Framework, Hoong Chuin Lau, Xiaomin Jia, Wee Chong Wan Dec 2005

A Generic Object-Oriented Tabu Search Framework, Hoong Chuin Lau, Xiaomin Jia, Wee Chong Wan

Research Collection School Of Computing and Information Systems

Presently, most tabu search designers devise their applications without considering the potential of design and code reuse, which consequently prolong the development of subsequent applications. In this paper, we propose a software solution known as Tabu Search Framework (TSF), which is a generic C++ software framework for tabu search implementation. The framework excels in code recycling through the use of a well- designed set of generic abstract classes that clearly define their collaborative roles in the algorithm. Additionally, the framework incorporates a centralized process and control mechanism that enhances the search with intelligence. This results in a generic framework that …

Go to article

A Block Oriented Fingerprinting Scheme In Relational Database, Siyuan Liu, Shuhong Wang, Robert H. Deng, Weizhong Shao Dec 2005

A Block Oriented Fingerprinting Scheme In Relational Database, Siyuan Liu, Shuhong Wang, Robert H. Deng, Weizhong Shao

Research Collection School Of Computing and Information Systems

The need for protecting rights over relational data is of ever increasing concern. There have recently been some pioneering works in this area. In this paper, we propose an effective fingerprinting scheme based on the idea of block method in the area of multimedia fingerprinting. The scheme ensures that certain bit positions of the data contain specific values. The bit positions are determined by the keys known only to the owner of the data and different buyers of the database have different bit positions and different specific values for those bit positions. The detection of the fingerprint can be completed …

Go to article

Cryptanalysis Of A Forward Secure Blind Signature Scheme With Provable Security, Shuhong Wang, Feng Bao, Robert H. Deng Dec 2005

Cryptanalysis Of A Forward Secure Blind Signature Scheme With Provable Security, Shuhong Wang, Feng Bao, Robert H. Deng

Research Collection School Of Computing and Information Systems

A forward secure blind signature scheme was proposed by Duc, Cheon and Kim, in ICICS 2003. The security of the scheme was proved to be equivalent to the strong RSA assumption in the random oracle model. In this paper we present an attack to the scheme by forging valid signatures with public keys only. The attack is so efficient that forging a valid signature needs less computation than legally generating a signature, even considering only the user side. Our result implies that the security proof of the scheme must be invalid. Furthermore we point out the fault of the proof …

Go to article

Authenticating Query Results In Data Publishing, Di Ma, Robert H. Deng, Hwee Hwa Pang, Jianying Zhou Dec 2005

Authenticating Query Results In Data Publishing, Di Ma, Robert H. Deng, Hwee Hwa Pang, Jianying Zhou

Research Collection School Of Computing and Information Systems

We propose a communication-efficient authentication scheme to authenticate query results disseminated by untrusted data publishing servers. In our scheme, signatures of multiple tuples in the result set are aggregated into one and thus the communication overhead incurred by the signature keeps constant. Next attr-MHTs (tuple based Merkle Hash Tree) are built to further reduce the communication overhead incurred by auxiliary authentication information (AAI). Besides the property of communication-efficiency, our scheme also supports dynamic SET operations (UNION, INTERSECTION) and dynamic JOIN with immunity to reordering attack.

Go to article

An Efficient And Robust Computational Framework For Studying Lifetime And Information Capacity In Sensor Networks, Enrique J. Duarte-Melo, Mingyan Liu, Archan Misra Dec 2005

An Efficient And Robust Computational Framework For Studying Lifetime And Information Capacity In Sensor Networks, Enrique J. Duarte-Melo, Mingyan Liu, Archan Misra

Research Collection School Of Computing and Information Systems

In this paper we investigate the expected lifetime and information capacity, defined as the maximum amount of data (bits) transferred before the first sensor node death due to energy depletion, of a data-gathering wireless sensor network. We develop a fluid-flow based computational framework that extends the existing approach, which requires precise knowledge of the layout/deployment of the network, i.e., exact sensor positions. Our method, on the other hand, views a specific network deployment as a particular instance (sample path) from an underlying distribution of sensor node layouts and sensor data rates. To compute the expected information capacity under this distribution-based …

Go to article

New Efficient Mds Array Codes For Raid Part Ii: Rabin-Like Codes For Tolerating Multiple (>=4) Disk Failures, Gui-Liang Feng, Robert H. Deng, Feng Bao Dec 2005

New Efficient Mds Array Codes For Raid Part Ii: Rabin-Like Codes For Tolerating Multiple (>=4) Disk Failures, Gui-Liang Feng, Robert H. Deng, Feng Bao

Research Collection School Of Computing and Information Systems

A new class of Binary Maximum Distance Separable (MDS) array codes which are based on circular permutation matrices are introduced in this paper. These array codes are used for tolerating multiple (greater than or equal to 4) disk failures in Redundant Arrays of Inexpensive Disks (RAID) architecture. The size of the information part is m \times n, where n is the number of information disks and (m+1) is a prime integer; the size of the parity-check part is m \times r, the minimum distance is r+1, and the number of parity-check disks is r. In practical applications, m can be …

Go to article

A Scalable Correlation Aware Aggregation Strategy For Wireless Sensor Networks, Yujie Zhu, Ramanuja Vedantham, Seung Jong Park, Raghupathy Sivakumar Dec 2005

A Scalable Correlation Aware Aggregation Strategy For Wireless Sensor Networks, Yujie Zhu, Ramanuja Vedantham, Seung Jong Park, Raghupathy Sivakumar

Computer Science Faculty Research & Creative Works

Sensors-to-sink data in wireless sensor networks (WSNs) are typically correlated with each other. Exploiting such correlation when performing data aggregation can result in considerable improvements in the bandwidth and energy performance of WSNs. In order to exploit such correlation, we present a scalable and distributed correlation-aware aggregation structure that addresses the practical challenges in the context of aggregation in WSNs. Through simulations and analysis, we evaluate the performance of the proposed approach with centralized and distributed correlation aware and unaware structures.

Go to article

Improving The Quality Of Conceptual Modeling Using Cognitive Mapping Techniques, Keng Siau, X. Tan Dec 2005

Improving The Quality Of Conceptual Modeling Using Cognitive Mapping Techniques, Keng Siau, X. Tan

Research Collection School Of Computing and Information Systems

Conceptual modeling involves the understanding and communication between system analysts and end-users. Many factors may affect the quality of conceptual modeling processes as well as the models per se. Human cognition plays a pivotal role in understanding these factors and cognitive mapping techniques are effective tools to elicit and represent human cognition. In this paper, we look at the use of cognitive mapping techniques to improve the quality of conceptual modeling. We review frameworks on quality in conceptual modeling and examine the role of human cognition in conceptual modeling. The paper also discusses how human cognition is related to quality …

Go to article

Webarc: Website Archival Using A Structured Approach, Ee Peng Lim, Maria Marissa Dec 2005

Webarc: Website Archival Using A Structured Approach, Ee Peng Lim, Maria Marissa

Research Collection School Of Computing and Information Systems

Website archival refers to the task of monitoring and storing snapshots of website(s) for future retrieval and analysis. This task is particularly important for websites that have content changing over time with older information constantly overwritten by newer one. In this paper, we propose WEBARC as a set of software tools to allow users to construct a logical structure for a website to be archived. Classifiers are trained to. determine relevant web pages and their categories, and subsequently used in website downloading. The archival schedule can be specified and executed by a scheduler. A website viewer is also developed to …

Go to article

Tailored Watermarking Schemes For Authentication Of Electronic Clinical Atlases, Feng Bao, Robert H. Deng, Beng-Chin Ooi, Yanjiang Yang Dec 2005

Tailored Watermarking Schemes For Authentication Of Electronic Clinical Atlases, Feng Bao, Robert H. Deng, Beng-Chin Ooi, Yanjiang Yang

Research Collection School Of Computing and Information Systems

It is accepted that digital watermarking is quite relevant in medical imaging. However, due to the special nature of clinical practice, it is often required that watermarking not introduce irreversible distortions to medical images. The electronic clinical atlas has such a need of "lossless" watermarking. We present two tailored reversible watermarking schemes for the clinical atlas by exploiting its inherent characteristics. We have implemented the schemes and our experimental results look very promising.

Go to article

A Framework To Learn Bayesian Network From Changing, Multiple-Source Biomedical Data, Li G., Tze-Yun Leong Dec 2005

A Framework To Learn Bayesian Network From Changing, Multiple-Source Biomedical Data, Li G., Tze-Yun Leong

Research Collection School Of Computing and Information Systems

Structure learning in Bayesian network is a big issue. Many efforts have tried to solve this problem and quite a few algorithms have been proposed. However, when we attempt to apply the existing methods to microarray data, there are three main challenges: 1) there are many variables in the data set, 2) the sample size is small, and 3) microarray data are changing from experiment to experiment and new data are available quickly. To address these three problems, we assume that the major functions of a kind of cells do not change too much in different experiments, and propose a …

Go to article

Integration Of Probabilistic Graphic Models For Decision Support, Jiang C., Poh K., Tze-Yun Leong Dec 2005

Integration Of Probabilistic Graphic Models For Decision Support, Jiang C., Poh K., Tze-Yun Leong

Research Collection School Of Computing and Information Systems

It is a frequently encountered problem that new knowledge arrived when making decisions in a dynamic world. Usually, domain experts cannot afford enough time and knowledge to effectively assess and combine both qualitative and quantitative information in these models. Existing approaches can solve only one of two tasks instead of both. We propose a four-step algorithm to integrate multiple probabilistic graphic models, which can effectively update existing models with newly acquired models. In this algorithm, the qualitative part of model integration is performed first, followed by the quantitative combination. We illustrate our method with an example of combining three models. …

Go to article

Generating Data-Extraction Ontologies By Example, Yuanqiu Zhou Nov 2005

Generating Data-Extraction Ontologies By Example, Yuanqiu Zhou

Theses and Dissertations

Ontology-based data-extraction is a resilient web data-extraction approach. A major limitation of this approach is that ontology experts must manually develop and maintain data-extraction ontologies. The limitation prevents ordinary users who have little knowledge of conceptual models from making use of this resilient approach. In this thesis we have designed and implemented a general framework, OntoByE, to generate data-extraction ontologies semi-automatically through a small set of examples collected by users. With the assistance of a limited amount of prior knowledge, experimental evidence shows that OntoByE is capable of interacting with users to generate data-extraction ontologies for domains of interest to …

Go to article

Marketing Military Service Benefits Segmentation Based On Generalized And Restricted Exchange, Caroline Fisher, Kimball P. Marshall Nov 2005

Marketing Military Service Benefits Segmentation Based On Generalized And Restricted Exchange, Caroline Fisher, Kimball P. Marshall

Business and Information Technology Faculty Research & Creative Works

Willingness to engage in exchange is based on desired benefits. In typical commercial transactions, restricted exchange benefits dominate. However, public policy, social marketing situations might require consideration of both restricted and generalized exchange benefits. Applying factor analysis, cluster analysis and cross-tabulation, this paper reports research that has successfully segmented a young adult target market regarding interest in military service based on considerations of generalized and restricted exchange motivations. This research contributes to a growing body of literature on generalized exchange as a key conceptual element for social marketing. Results demonstrate the utility of the generalized exchange concept in identifying amarket …

Go to article

A Software Development Environment For Building Context-Aware Systems For Family Technology, Jeremiah Kenton Jones Nov 2005

A Software Development Environment For Building Context-Aware Systems For Family Technology, Jeremiah Kenton Jones

Theses and Dissertations

The purpose of this thesis was to utilize existing technologies to create a development environment suitable for creating context-aware applications and systems specific to home and family living conditions. After outlining the history of context-aware applications and the challenges that face family-centric systems in this field, a development environment was implemented that solves the unique challenges that face application development for family-centric, context-aware applications. In particular, research cited in this document indicates that a browser-based user interface is the most appropriate interface for a family environment. The flexibility of the interface, as well as the familiarity of the application structure …

Go to article

Generating Medical Logic Modules For Clinical Trial Eligibility, Craig G. Parker Nov 2005

Generating Medical Logic Modules For Clinical Trial Eligibility, Craig G. Parker

Theses and Dissertations

Clinical trials are important to the advancement of medical science. They provide the experimental and statistical basis needed to determine the benefit of diagnostic and therapeutic agents and procedures. The more patients enrolled in a clinical trial, the more confidence we can have in the trial's results. However, current practices for identifying eligible patients can be expensive and time-consuming. To assist in making identification of eligible patients more cost effective, we have developed a system for translating the eligibility criteria for clinical trials to an executable form. This system takes as input the eligibility criteria for a trial formatted as …

Go to article

First Prev Next Last