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

Computer Sciences Commons™

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

2005

Discipline
Institution
Keyword
Publication
Publication Type
File Type

Articles 331 - 360 of 1206

Full-Text Articles in Computer Sciences

Ontology Learning As A Use-Case For Neural-Symbolic Integration, Pascal Hitzler, Sebastian Bader, Artur Garcez Aug 2005

Ontology Learning As A Use-Case For Neural-Symbolic Integration, Pascal Hitzler, Sebastian Bader, Artur Garcez

Computer Science and Engineering Faculty Publications

We argue that the field of neural-symbolic integration is in need of identifying application scenarios for guiding further research. We furthermore argue that ontology learning - as occurring in the context of semantic technologies - provides such an application scenario with potential for success and high impact on neural-symbolic integration.

Go to article

Shared Risk Link Group (Srlg)-Diverse Path Provisioning Under Hybrid Service Level Agreements In Wavelength-Routed Optical Mesh Networks, Lu Shen, Xi Yang, Byrav Ramamurthy Aug 2005

Shared Risk Link Group (Srlg)-Diverse Path Provisioning Under Hybrid Service Level Agreements In Wavelength-Routed Optical Mesh Networks, Lu Shen, Xi Yang, Byrav Ramamurthy

School of Computing: Faculty Publications

The static provisioning problem in wavelength-routed optical networks has been studied for many years. However, service providers are still facing the challenges arising from the special requirements for provisioning services at the optical layer. In this paper, we incorporate some realistic constraints into the static provisioning problem, and formulate it under different network resource availability conditions.We consider three classes of shared risk link group (SRLG)-diverse path protection schemes: dedicated, shared, and unprotected. We associate with each connection request a lightpath length constraint and a revenue value. When the network resources are not sufficient to accommodate all the connection requests, the …

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

Entropy-Based 2d Image Dissimilarity Measure, Meng-Hung Wu Aug 2005

Entropy-Based 2d Image Dissimilarity Measure, Meng-Hung Wu

Theses and Dissertations - UTB/UTPA

Traditional histogram or statistics based 2D image similarity/dissimilarity metrics fail to handle conjugate pair of black and white images, due to the lack of spatial information in the measurement. Recently proposed Compression-based Dissimilarity Measure (CDM) [1] based on the concept of Kolmogorov complexity has provided a different paradise for similarity measurement. However, without a clear definition how to “concatenate” two 2D images, CDM has difficulties to directly apply with 2D images. In this thesis, an entropy -based 2D image dissimilarity measure is proposed within the same Kolmogorov complexity paradise. The spatial relationship between images is embedded in our metric, and …

Go to article

Integrating First-Order Logic Programs And Connectionist Systems - A Constructive Approach, Sebastian Bader, Andreas Witzel, Pascal Hitzler Aug 2005

Integrating First-Order Logic Programs And Connectionist Systems - A Constructive Approach, Sebastian Bader, Andreas Witzel, Pascal Hitzler

Computer Science and Engineering Faculty Publications

Significant advances have recently been made concerning the integration of symbolic knowledge representation with artificial neural networks (also called connectionist systems). However, while the integration with propositional paradigms has resulted in applicable systems, the case of first-order knowledge representation has so far hardly proceeded beyond theoretical studies which prove the existence of connectionist systems for approximating first-order logic programs up to any chosen precision. Advances were hindered severely by the lack of concrete algorithms for obtaining the approximating networks which were known to exist: the corresponding proofs are not constructive in that they do not yield concrete methods for building …

Go to article

Efficiently Implementing A Large Number Of Ll/Sc Objects, Prasad Jayanti, Srdjan Petrovic Aug 2005

Efficiently Implementing A Large Number Of Ll/Sc Objects, Prasad Jayanti, Srdjan Petrovic

Computer Science Technical Reports

Over the past decade, a pair of instructions called load-linked (LL) and store-conditional (SC) have emerged as the most suitable synchronization instructions for the design of lock-free algorithms. However, current architectures do not support these instructions; instead, they support either CAS (e.g., UltraSPARC, Itanium) or restricted versions of LL/SC (e.g., POWER4, MIPS, Alpha). Thus, there is a gap between what algorithm designers want (namely, LL/SC) and what multiprocessors actually support (namely, CAS or RLL/RSC). To bridge this gap, a flurry of algorithms that implement LL/SC from CAS have appeared in the literature. The two most recent algorithms are due to …

Go to article

Extracting Reduced Logic Programs From Artificial Neural Networks, Jens Lehmann, Sebastian Bader, Pascal Hitzler Aug 2005

Extracting Reduced Logic Programs From Artificial Neural Networks, Jens Lehmann, Sebastian Bader, Pascal Hitzler

Computer Science and Engineering Faculty Publications

Artificial neural networks can be trained to perform excellently in many application areas. While they can learn from raw data to solve sophisticated recognition and analysis problems, the acquired knowledge remains hidden within the network architecture and is not readily accessible for analysis or further use: Trained networks are black boxes. Recent research efforts therefore investigate the possibility to extract symbolic knowledge from trained networks, in order to analyze, validate, and reuse the structural insights gained implicitly during the training process. In this paper, we will study how knowledge in form of propositional logic programs can be obtained in such …

Go to article

How Does Information Technology Effect Development? Integrating Theory And Practice Into A Process Model, Sajda Qureshi Aug 2005

How Does Information Technology Effect Development? Integrating Theory And Practice Into A Process Model, Sajda Qureshi

Information Systems and Quantitative Analysis Faculty Proceedings & Presentations

The concept of development suggests that countries and regions grow to become self-sustaining partners in what is being called the global economy. In more recent years this concept has been synonymous with the emergence of an “information society” whose wheels are oiled by information sharing and the application of knowledge. Some international agencies even propose that information and communications technologies enable development to be achieved more effectively and efficiently. While success stories abound, there is a recognition that not all investments in information technology bring about growth or economic development. So the question remains: how does information technology effect development? …

Go to article

Boosted Decision Trees For Word Recognition In Handwritten Document Retrieval, Nicholas Howe, Toni M. Rath, R. Manmatha Aug 2005

Boosted Decision Trees For Word Recognition In Handwritten Document Retrieval, Nicholas Howe, Toni M. Rath, R. Manmatha

Computer Science: Faculty Publications

Recognition and retrieval of historical handwritten material is an unsolved problem. We propose a novel approach to recognizing and retrieving handwritten manuscripts, based upon word image classification as a key step. Decision trees with normalized pixels as features form the basis of a highly accurate AdaBoost classifier, trained on a corpus of word images that have been resized and sampled at a pyramid of resolutions. To stem problems from the highly skewed distribution of class frequencies, word classes with very few training samples are augmented with stochastically altered versions of the originals. This increases recognition performance substantially. On a standard …

Go to article

Sample-Based Cameras For Fast Accurate Reflections, Voicu Popescu, Elisha Sacks, Chunhui Mei Aug 2005

Sample-Based Cameras For Fast Accurate Reflections, Voicu Popescu, Elisha Sacks, Chunhui Mei

Department of Computer Science Technical Reports

No abstract provided.

Go to article

Naboh System: Gathering Intelligence From Traffic Patterns, Angelica M. Delgado Aug 2005

Naboh System: Gathering Intelligence From Traffic Patterns, Angelica M. Delgado

Theses and Dissertations - UTB/UTPA

Network traffic anomalies are important indicators of problematic traffic over a network. Network activity has patterns associated with it depending on the applications running on the local hosts connected to the network. There are traffic parameters into which network traffic of a local host can be divided: bandwidth usage, number of remote hosts that a local host is connecting to and vice versa, and number of ports used by the local host. This thesis develops a system for detecting and profiling network anomalies by analyzing traffic parameters using intelligent computational techniques. The developed system gathers intelligence by examining only the …

Go to article

A Semiotics View Of Modeling Method Complexity – The Case Of Uml, Keng Siau, Y. Tian Aug 2005

A Semiotics View Of Modeling Method Complexity – The Case Of Uml, Keng Siau, Y. Tian

Research Collection School Of Computing and Information Systems

Unified Modeling Language (UML) is the standard modeling language for object oriented system development. Despite its status as a standard, UML’s formal specification is fuzzy and its theoretical foundation is weak. Semiotics, the study of signs, provides us good theoretical foundation for UML research as UML graphical notations are some kinds of signs. In this research, we use semiotics to study the graphical notations in UML. We hypothesized that using iconic signs as UML graphical notations leads to more accurate representation and arouses fewer connotations than using symbolic signs. Since symbolic signs involve more learning efforts, we assume that expert …

Go to article

Introduction: Human-Computer Interaction Studies In Management Information Systems, Fiona Fui-Hoon Nah, P. Zhang, S. Mccoy Aug 2005

Introduction: Human-Computer Interaction Studies In Management Information Systems, Fiona Fui-Hoon Nah, P. Zhang, S. Mccoy

Research Collection School Of Computing and Information Systems

Human-computer interaction (HCI) is a critical area of research and practice that spans several disciplines, including industrial engineering, management information systems (MIS), computer science, information science, psychology, sociology, and anthropology. HCI research within the MIS discipline has distinct features shaped by the evolution and current state of MIS. Originating as applied computer science in the 1970s, MIS gradually transformed into a more social science–oriented discipline (Baskerville & Myers, 2002). MIS is broadly defined as “the effective design, delivery, and use of information systems in organizations” (Keen, 1980, p. 14). The two distinguishing features of MIS compared to other "homes" of …

Go to article

Information Search Patterns In E-Commerce Product Comparison Services, Fiona Fui-Hoon Nah, Hong-Hee Lee, Liqiang Chen Aug 2005

Information Search Patterns In E-Commerce Product Comparison Services, Fiona Fui-Hoon Nah, Hong-Hee Lee, Liqiang Chen

Research Collection School Of Computing and Information Systems

The presentation of product information is very important in e-commerce websites. In this research, we study how disposition styles can influence users‟ search patterns in product comparison services of e-commerce websites. Our results show that people are inclined to use feature information paths in vertical disposition style and product information paths in horizontal disposition style. The results also indicate that there are more feature paths than product paths in the earlier stage of product comparison, and more product paths than feature paths in the latter stage of product comparison. Based on Gensch‟s two-stage choice model and the results of our …

Go to article

Constrained Shortest Path Computation, Manolis Terrovitis, Spiridon Bakiras, Dimitris Papadias, Kyriakos Mouratidis Aug 2005

Constrained Shortest Path Computation, Manolis Terrovitis, Spiridon Bakiras, Dimitris Papadias, Kyriakos Mouratidis

Research Collection School Of Computing and Information Systems

This paper proposes and solves a-autonomy and k-stops shortest path problems in large spatial databases. Given a source s and a destination d, an aautonomy query retrieves a sequence of data points connecting s and d, such that the distance between any two consecutive points in the path is not greater than a. A k-stops query retrieves a sequence that contains exactly k intermediate data points. In both cases our aim is to compute the shortest path subject to these constraints. Assuming that the dataset is indexed by a data-partitioning method, the proposed techniques initially compute a sub-optimal path by …

Go to article

Personalization Of Web Services: A Study On The Fit Between Web Tasks And Personalization Mechanisms, Fiona Fui-Hoon Nah, Keng Siau, Min Ling Aug 2005

Personalization Of Web Services: A Study On The Fit Between Web Tasks And Personalization Mechanisms, Fiona Fui-Hoon Nah, Keng Siau, Min Ling

Research Collection School Of Computing and Information Systems

Personalization is increasingly being considered an important ingredient of Web applications. In most cases, personalization techniques and mechanisms are used for tailoring information services to user needs. It is motivated by the recognition that a user has needs, and meeting them successfully is likely to lead to a satisfying relationship and re-use of the Web services offered. However, if the personalization mechanisms do not match the needs depicted by the tasks, it will decrease user satisfaction and performance. In this research, we use the cognitive fit theory to examine the fit between personalization mechanisms and Web tasks.

Go to article

Privacy Issues In The Era Of Ubiquitous Commerce, Holtjona Galanxhi, Fiona Fui-Hoon Nah Aug 2005

Privacy Issues In The Era Of Ubiquitous Commerce, Holtjona Galanxhi, Fiona Fui-Hoon Nah

Research Collection School Of Computing and Information Systems

The vision of ubiquitous commerce (u‐commerce) is realized through the convergence of electronic, mobile, television, voice and silent commerce applications. The ubiquity, universality, uniqueness and unison of u‐commerce will provide two principal benefits for individual users and businesses: increased convenience as well as more personalized and customized services. However, u‐commerce will also bring emerging issues such as a greater degree of privacy concerns that will impact individual users, companies and society at large. This paper proposes and elaborates on a conceptual framework for privacy in the u‐commerce era. This framework is developed based on Lessig's macro‐level perspective and Adams' micro‐level …

Go to article

A Link Bundled Auxiliary Graph Model For Constrained Dynamic Traffic Grooming In Wdm Mesh Networks, Wang Yao, Byrav Ramamurthy Aug 2005

A Link Bundled Auxiliary Graph Model For Constrained Dynamic Traffic Grooming In Wdm Mesh Networks, Wang Yao, Byrav Ramamurthy

School of Computing: Faculty Publications

This paper addresses the two-layer dynamic traffic grooming problem in wavelength-division-multiplexed (WDM) mesh optical networks subject to resource constraints and the generalized wavelength continuity (GWC) constraint. The GWC constraint is a relaxed wavelength continuity constraint which incorporates various kinds of wavelength conversion capabilities that exist in optical networks. As an improvement over the existing layered auxiliary graph (layered-AG) approach which represents each wavelength separately in the auxiliary graph, we introduce a largely simplified link bundled auxiliary graph (LBAG) model and propose the SAG-LB method to find paths and assign wavelengths for new lightpaths subject to the GWC constraint.We propose the …

Go to article

On The Design Of An Immersive Environment For Security-Related Studies, Yougu Yuan Aug 2005

On The Design Of An Immersive Environment For Security-Related Studies, Yougu Yuan

Dartmouth College Master’s Theses

The Internet has become an essential part of normal operations of both public and private sectors. Many security issues are not addressed in the original Internet design, and security now has become a large concern for networking research and study. There is an imperative need to have an simulation environment that can be used to help study security-related research problems. In the thesis we present our effort to build such an environment: Real-time Immersive Network Simulation Environment (RINSE). RINSE features flexible configuration of models using various networking protocols and real-time user interaction. We also present the Estimate Next Infection (ENI) …

Go to article

First Prev Next Last