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

OS and Networks Commons™

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

2005

Discipline
Institution
Keyword
Publication
Publication Type

Articles 31 - 60 of 76

Full-Text Articles in OS and Networks

Peer-To-Peer Discovery Of Semantic Associations, Matthew Perry, Maciej Janik, Cartic Ramakrishnan, Conrad Ibanez, I. Budak Arpinar, Amit P. Sheth Jul 2005

Peer-To-Peer Discovery Of Semantic Associations, Matthew Perry, Maciej Janik, Cartic Ramakrishnan, Conrad Ibanez, I. Budak Arpinar, Amit P. Sheth

Kno.e.sis Publications

The Semantic Web vision promises an extension of the current Web in which all data is annotated with machine understandable metadata. The relationship-centric nature of this data has led to the definition of Semantic Associations, which are complex relationships between resources. Semantic Associations attempt to answer queries of the form “how are resource A and resource B related?” Knowing how two entities are related is a crucial question in knowledge discovery applications. Much the same way humans collaborate and interact to form new knowledge, discovery of Semantic Associations across repositories on a peer-to-peer network can allow peers to share their …

Go to article

A Modular Approach To Document Indexing And Semantic Search, Dhanya Ravishankar, Krishnaprasad Thirunarayan, Trivikram Immaneni Jul 2005

A Modular Approach To Document Indexing And Semantic Search, Dhanya Ravishankar, Krishnaprasad Thirunarayan, Trivikram Immaneni

Kno.e.sis Publications

This paper develops a modular approach to improving effectiveness of searching documents for information by reusing and integrating mature software components such as Lucene APIs, WORDNET, LSA techniques, and domain-specific controlled vocabulary. To evaluate the practical benefits, the prototype was used to query MEDLINE database, and to locate domain-specific controlled vocabulary terms in Materials and Process Specifications. Its extensibility has been demonstrated by incorporating a spell-checker for the input query, and by structuring the retrieved output into hierarchical collections for quicker assimilation. It is also being used to experimentally explore the relationship between LSA and document clustering using 20-mini-newsgroups and …

Go to article

Faster Owl Using Split Programs, Denny Vrandecic, Pascal Hitzler Jul 2005

Faster Owl Using Split Programs, Denny Vrandecic, Pascal Hitzler

Computer Science and Engineering Faculty Publications

Knowledge representation and reasoning on the Semantic Web is done by means of ontologies. While the quest for suitable ontology languages is still ongoing, OWL [5] has been established as a core standard. It comes in three flavours, as OWL Full, OWL DL and OWL Lite, where OWL Full contains OWL DL, which in turn contains OWL Lite. The latter two coincide semantically with certain description logics and can thus be considered fragments of first-order predicate logic.

Go to article

On Embedding Machine-Processable Semantics Into Documents, Krishnaprasad Thirunarayan Jul 2005

On Embedding Machine-Processable Semantics Into Documents, Krishnaprasad Thirunarayan

Kno.e.sis Publications

Most Web and legacy paper-based documents are available in human comprehensible text form, not readily accessible to or understood by computer programs. Here, we investigate an approach to amalgamate XML technology with programming languages for representational purposes that can enhance traceability, thereby facilitating semiautomatic extraction and update. Specifically, we propose a modular technique to embed machine-processable semantics into a text document with tabular data via annotations, resulting sometimes in ill-formed XML fragments, and evaluate this technique vis a vis document querying, manipulation, and integration. The ultimate aim is to be able to author and extract human-readable and machine-comprehensible parts of …

Go to article

Morphisms In Context, Markus Krotzsch, Guo-Qiang Zhang, Pascal Hitzler Jul 2005

Morphisms In Context, Markus Krotzsch, Guo-Qiang Zhang, Pascal Hitzler

Computer Science and Engineering Faculty Publications

Morphisms constitute a general tool for modelling complex relationships between mathematical objects in a disciplined fashion. In Formal Concept Analysis (FCA), morphisms can be used for the study of structural properties of knowledge represented in formal contexts, with applications to data transformation and merging. In this paper we present a comprehensive treatment of some of the most important morphisms in FCA and their relationships, including dual bonds, scale measures, infomorphisms, and their respective relations to Galois connections. We summarize our results in a concept lattice that cumulates the relationships among the considered morphisms. The purpose of this work is to …

Go to article

A Semantic Template Based Designer For Semantic Web Processes, Ranjit Mulye, John A. Miller, Kunal Verma, Karthik Gomadam, Amit P. Sheth Jul 2005

A Semantic Template Based Designer For Semantic Web Processes, Ranjit Mulye, John A. Miller, Kunal Verma, Karthik Gomadam, Amit P. Sheth

Kno.e.sis Publications

The growing popularity of service oriented computing based on Web services standards is creating a need for paradigms to represent and design business processes. Significant work has been done in the representation aspects with regards to WSBPEL. However, design and modeling of business processes is still an open issue. In this paper, we present a novel designer for business processes, which allows for intuitive modeling of Web processes, as well as using a template based approach for semi-automatically integrating partners either at design time or at deployment time. This work has been done as part of the METEOR-S project, which …

Go to article

Lifecycle Of Semantic Web Processes, Jorge Cardoso, Chistoph Bussler, Amit P. Sheth Jun 2005

Lifecycle Of Semantic Web Processes, Jorge Cardoso, Chistoph Bussler, Amit P. Sheth

Kno.e.sis Publications

This tutorial presents what can be achieved by symbiotic synthesis of two of the most important research and technology application areas: Web Services and the Semantic Web. It presents the more recent evolution of the Web Service platform towards rich Web Service and process model annotation, and explores some of the promises and challenges in applying semantics to each of the steps in the Semantic Web Process lifecycle.

Go to article

Web Service Semantics - Wsdl-S, Rama Akkiraju, Joel Farrell, John A. Miller, Meenakshi Nagarajan, Amit P. Sheth, Kunal Verma Jun 2005

Web Service Semantics - Wsdl-S, Rama Akkiraju, Joel Farrell, John A. Miller, Meenakshi Nagarajan, Amit P. Sheth, Kunal Verma

Kno.e.sis Publications

Web services have primarily been designed for providing inter-operability between business applications. Current technologies assume a large amount of human interaction, for integrating two applications. This is primarily due to the fact that business process integration requires understanding of data and functions of the involved entities. Semantic Web technologies, powered by description logic based languages like OWL[1], aim to add greater meaning to Web content, by annotating the data with ontologies. Ontologies provide a mechanism of providing shared conceptualizations of domains. This allows agents to get an understanding of users’ Web content and greatly reduces human interaction for meaningful Web …

Go to article

Ga-Facilitated Classifier Optimization With Varying Similarity Measures, Michael R. Peterson, Travis E. Doom, Michael L. Raymer Jun 2005

Ga-Facilitated Classifier Optimization With Varying Similarity Measures, Michael R. Peterson, Travis E. Doom, Michael L. Raymer

Kno.e.sis Publications

Genetic algorithms are powerful tools for k-nearest neighbors classification. Traditional knn classifiers employ Euclidian distance to assess neighbor similarity, though other measures may also be used. GAs can search for optimal linear weights of features to improve knn performance using both Euclidian distance and cosine similarity. GAs also optimize additive feature offsets in search of an optimal point of reference for assessing angular similarity using the cosine measure. This poster explores weight and offset optimization for knn with varying similarity measures, including Euclidian distance (weights only), cosine similarity, and Pearson correlation. The use of offset optimization …

Go to article

Description Logic Programs: A Practical Choice For The Modelling Of Ontologies, Rudi Studer, York Sure, Pascal Hitzler Jun 2005

Description Logic Programs: A Practical Choice For The Modelling Of Ontologies, Rudi Studer, York Sure, Pascal Hitzler

Computer Science and Engineering Faculty Publications

Knowledge representation using ontologies constitutes the heart of semantic technologies. Despite successful standardization efforts by the W3C, however, there are still numerous different ontology representation languages being used, and interoperability between them is in general not given. The problem is aggrevated by the fact that current standards lay foundations only and are well-known to be insufficient for the modelling of finer details. Thus, a plethora of extensions of the basic languages is being proposed, rendering the picture of ontology representation languages to be chaotic, to say the least. While semantic technologies start to become applicable and are being applied in …

Go to article

Automatically Discovering The Number Of Clusters In Web Page Datasets, Zhongmei Yao Jun 2005

Automatically Discovering The Number Of Clusters In Web Page Datasets, Zhongmei Yao

Computer Science Faculty Publications

Clustering is well-suited for Web mining by automatically organizing Web pages into categories, each of which contains Web pages having similar contents. However, one problem in clustering is the lack of general methods to automatically determine the number of categories or clusters. For the Web domain in particular, currently there is no such method suitable for Web page clustering. In an attempt to address this problem, we discover a constant factor that characterizes the Web domain, based on which we propose a new method for automatically determining the number of clusters in Web page data sets. We discover that the …

Go to article

Integrating Semantic Web Services For Mobile Access, Anupriya Ankolekar, Pascal Hitzler, Holger Lewen, Daniel Oberle, Rudi Studer Jun 2005

Integrating Semantic Web Services For Mobile Access, Anupriya Ankolekar, Pascal Hitzler, Holger Lewen, Daniel Oberle, Rudi Studer

Computer Science and Engineering Faculty Publications

We present our work in integrating Semantic Web services for access via mobile devices. We have developed a system, the WebServiceAccessComponent, that transforms a user request for a service on a mobile device, to a Web service request and then selects a matching service from the existing Web services of the Deutsche Telekom, which provide navigational and weather information. In this poster, we present the requirements and design of the WebServiceAccessComponent.

Go to article

Semantic Management Of Web Services Using The Core Ontology Of Services, Daniel Oberle, Steffen Lamparter, Andreas Eberhart, Stephan Grimm, Sudhir Agarwal, Rudi Studer, Pascal Hitzler Jun 2005

Semantic Management Of Web Services Using The Core Ontology Of Services, Daniel Oberle, Steffen Lamparter, Andreas Eberhart, Stephan Grimm, Sudhir Agarwal, Rudi Studer, Pascal Hitzler

Kno.e.sis Publications

Different Web Service standards like WSDL, WS-Security, WS-Policy etc., henceforth referred to as WS*, factorize Web Service management tasks into different aspects, such as input/output, workflow, or security. The advantages of WS* are multiple and have already achieved industrial impact. WS* descriptions are exchangeable and developers may use different implementations for the same Web Service description. The disadvantages of WS*, however, are also apparent: even though the different standards are complementary, they must overlap and one may produce models composed of different WS* descriptions, which are inconsistent with each other, but the reasons for the inconsistencies are not easily determined. …

Go to article

An Ontological Approach To The Document Access Problem Of Insider Threat, Boanerges Aleman-Meza, Phillip Burns, Matthew Eavenson, Devanand Palanswami, Amit P. Sheth May 2005

An Ontological Approach To The Document Access Problem Of Insider Threat, Boanerges Aleman-Meza, Phillip Burns, Matthew Eavenson, Devanand Palanswami, Amit P. Sheth

Kno.e.sis Publications

Verification of legitimate access of documents, which is one aspect of the umbrella of problems in the Insider Threat category, is a challenging problem. This paper describes the research and prototyping of a system that takes an ontological approach, and is primarily targeted for use by theintelligence community. Our approach utilizes the notion of semantic associations and their discovery among a collection of heterogeneous documents. We highlight our contributions in (graphically) capturing the scope of the investigation assignment of an intelligence analyst by referring to classes and relationships of an ontology; in computing a measure of the relevance …

Go to article

Semantic Web Services For N-Glycosylation Process, Satya S. Sahoo, Amit P. Sheth, William S. York, John A. Miller May 2005

Semantic Web Services For N-Glycosylation Process, Satya S. Sahoo, Amit P. Sheth, William S. York, John A. Miller

Kno.e.sis Publications

Glycomics is one of the many research efforts currently underway in the biosciences domain, which is characterized by high throughput data generated at multiple experimental stages. For example, analysis of N-glycosylation encompasses stages from cell-culture to peptide identification and quantification. Research groups across the world use diverse cell cultures, separation and spectroscopic techniques, and data identification, correlation and integration methodologies. Thus, data generated at different phases of the process by multiple groups are both structurally and functionally heterogeneous.

Go to article

Web Services To Semantic Web Processes: Investigating Synergy Between Practice And Research, Amit P. Sheth Apr 2005

Web Services To Semantic Web Processes: Investigating Synergy Between Practice And Research, Amit P. Sheth

Kno.e.sis Publications

No abstract provided.

Go to article

Bridging The Paradigm Gap With Rules For Owl, Jurgen Angele, Boris Motik, Rudi Studer, Pascal Hitzler Apr 2005

Bridging The Paradigm Gap With Rules For Owl, Jurgen Angele, Boris Motik, Rudi Studer, Pascal Hitzler

Computer Science and Engineering Faculty Publications

Accelerated by the vision of the semantic web, semantic technologies have recently made significant advances. The underlying methods and paradigms are already being transferred to adjacent areas of research in artificial intelligence, knowledge management, and elsewhere. Textbooks explaining the foundations have appeared. Large national and international projects on the topic are under way.

Go to article

Web Service Semantics - Wsdl-S, Rama Akkiraju, Joel Farrell, John A. Miller, Meenakshi Nagarajan, Amit P. Sheth, Kunal Verma Apr 2005

Web Service Semantics - Wsdl-S, Rama Akkiraju, Joel Farrell, John A. Miller, Meenakshi Nagarajan, Amit P. Sheth, Kunal Verma

Kno.e.sis Publications

The current WSDL standard operates at the syntactic level and lacks the semantic expressivity needed to represent the requirements and capabilities of Web Services. Semantics can improve software reuse and discovery, significantly facilitate composition of Web services and enable integrating legacy applications as part of business process integration. The Web Service Semantic s technical note defines a mechanism to associate semantic annotations with Web services that are described using Web Service Description Language (WSDL). It is conceptually based on, but a significant refinement in details of, the original WSDL-S proposal [WSDL-S] from the LSDIS laboratory at the University of Georgia. …

Go to article

Predictive Neural Networks For Gene Expression Data Analysis, Ah-Hwee Tan, Hong Pan Apr 2005

Predictive Neural Networks For Gene Expression Data Analysis, Ah-Hwee Tan, Hong Pan

Research Collection School Of Computing and Information Systems

Gene expression data generated by DNA microarray experiments have provided a vast resource for medical diagnosis and disease understanding. Most prior work in analyzing gene expression data, however, focuses on predictive performance but not so much on deriving human understandable knowledge. This paper presents a systematic approach for learning and extracting rule-based knowledge from gene expression data. A class of predictive self-organizing networks known as Adaptive Resonance Associative Map (ARAM) is used for modelling gene expression data, whose learned knowledge can be transformed into a set of symbolic IF-THEN rules for interpretation. For dimensionality reduction, we illustrate how the system …

Go to article

An Information Extraction Approach To Reorganizing And Summarizing Specifications, Krishnaprasad Thirunarayan, Aaron Berkovich, Dan Z. Sokol Mar 2005

An Information Extraction Approach To Reorganizing And Summarizing Specifications, Krishnaprasad Thirunarayan, Aaron Berkovich, Dan Z. Sokol

Kno.e.sis Publications

Materials and Process Specifications are complex semi-structured documents containing numeric data, text, and images. This article describes a coarse-grain extraction technique to automatically reorganize and summarize spec content. Specifically, a strategy for semantic-markup, to capture content within a semantic ontology, relevant to semi-automatic extraction, has been developed and experimented with. The working prototypes were built in the context of Cohesia's existing software infrastructure, and use techniques from Information Extraction, XML technology, etc.

Go to article

Divide-And-Approximate: A Novel Constraint Push Strategy For Iceberg Cube Mining, Ke Wang, Yuelong Jiang, Jeffrey Xu Yu, Guozhu Dong, Jiawei Han Mar 2005

Divide-And-Approximate: A Novel Constraint Push Strategy For Iceberg Cube Mining, Ke Wang, Yuelong Jiang, Jeffrey Xu Yu, Guozhu Dong, Jiawei Han

Kno.e.sis Publications

The iceberg cube mining computes all cells v, corresponding to GROUP BY partitions, that satisfy a given constraint on aggregated behaviors of the tuples in a GROUP BY partition. The number of cells often is so large that the result cannot be realistically searched without pushing the constraint into the search. Previous works have pushed antimonotone and monotone constraints. However, many useful constraints are neither antimonotone nor monotone. We consider a general class of aggregate constraints of the form f(v)θσ, where f is an arithmetic function of SQL-like aggregates and θ is one of <, ≤, ≥, > . We propose a …

Go to article

The Value Of Mobile Applications: A Utility Company Study, Fiona Fui-Hoon Nah, Keng Siau, Hong Sheng Feb 2005

The Value Of Mobile Applications: A Utility Company Study, Fiona Fui-Hoon Nah, Keng Siau, Hong Sheng

Research Collection School Of Computing and Information Systems

The value proposition of mobile applications i.e. the net value of the benefits and costs associated with the adoption and adaptation of mobile applications is discussed. A means-ends network that depicts the fundamental relationships among the objectives such as efficiency, effectiveness, customer satisfaction, security, cost, and employee acceptance, was developed. The network is useful to researchers as it highlights the issues, concerns, and values of mobile applications. The network help the managers and practitioners to achieve their companies' objectives of implementing mobile and wireless applications.

Go to article

A Random Rotation Perturbation Approach To Privacy Preserving Data Classification, Keke Chen, Ling Liu Jan 2005

A Random Rotation Perturbation Approach To Privacy Preserving Data Classification, Keke Chen, Ling Liu

Kno.e.sis Publications

This paper presents a random rotation perturbation approach for privacy preserving data classification. Concretely, we identify the importance of classification-specific information with respect to the loss of information factor, and present a random rotation perturbation framework for privacy preserving data classification. Our approach has two unique characteristics. First, we identify that many classification models utilize the geometric properties of datasets, which can be preserved by geometric rotation. We prove that the three types of classifiers will deliver the same performance over the rotation perturbed dataset as over the original dataset. Second, we propose a multi-column privacy model to address the …

Go to article

Meteor-S Wsdi: A Scalable P2p Infrastructure Of Registries For Semantic Publication And Discovery Of Web Services, Kunal Verma, Kaarthik Sivashanmugam, Amit P. Sheth, Abhijit Patil, Swapna Oundhakar, John Miller Jan 2005

Meteor-S Wsdi: A Scalable P2p Infrastructure Of Registries For Semantic Publication And Discovery Of Web Services, Kunal Verma, Kaarthik Sivashanmugam, Amit P. Sheth, Abhijit Patil, Swapna Oundhakar, John Miller

Kno.e.sis Publications

Web services are the new paradigm for distributed computing. They have much to offer towards interoperability of applications and integration of large scale distributed systems. To make Web services accessible to users, service providers use Web service registries to publish them. Current infrastructure of registries requires replication of all Web service publications in all Universal Business Registries. Large growth in number of Web services as well as the growth in the number of registries would make this replication impractical. In addition, the current Web service discovery mechanism is inefficient, as it does not support discovery based on the capabilities of …

Go to article

Wsdl-S: Adding Semantics To Wsdl, John Miller, Kunal Verma, Preeda Rajasekaran, Amit P. Sheth, Rohit Aggarwal, Kaarthik Sivashanmugam Jan 2005

Wsdl-S: Adding Semantics To Wsdl, John Miller, Kunal Verma, Preeda Rajasekaran, Amit P. Sheth, Rohit Aggarwal, Kaarthik Sivashanmugam

Kno.e.sis Publications

Web services have primarily been designed for providing inter-operability between business applications. Current technologies assume a large amount of human interaction, for integrating two applications. This is primarily due to the fact that business process integration requires understanding of data and functions of the involved entities. Semantic Web technologies, powered by description logic based languages like OWL[1], aim to add greater meaning to Web content, by annotating the data with ontologies. Ontologies provide a mechanism of providing shared conceptualizations of domains. This allows agents to get an understanding of users’ Web content and greatly reduces human interaction for meaningful Web …

Go to article

Level Mapping Characterizations Of Selector-Generated Models For Logic Programs, Sibylle Schwarz, Pascal Hitzler Jan 2005

Level Mapping Characterizations Of Selector-Generated Models For Logic Programs, Sibylle Schwarz, Pascal Hitzler

Computer Science and Engineering Faculty Publications

Assigning semantics to logic programs via selector generated models (Schwarz 2002/2003) extends several semantics, like the stable, the inflationary, and the stable generated semantics, to programs with arbitrary formulae in rule heads and bodies. We study this approach by means of a unifying framework for characterizing different logic programming semantics using level mappings (Hitzler and Wendt 200x, Hitzler 2003), thereby supporting the claim that this framework is very flexible and applicable to very diversely defined semantics.

Go to article

The Semantic Web In One Day, York Sure, Pascal Hitzler, Andreas Eberhart, Rudi Studer Jan 2005

The Semantic Web In One Day, York Sure, Pascal Hitzler, Andreas Eberhart, Rudi Studer

Computer Science and Engineering Faculty Publications

To gain momentum, technologies for building private semantic Webs or parts of the World Wide semantic Web must become a commodity and easy to integrate. To determine just how far semantic Web technologies have come, we wanted to create a snapshot of what you could do by applying and assembling existing semantic Web technologies - in one day.

Go to article

Taxaminer: An Experimentation Framework For Automated Taxonomy Bootstrapping, Vipul Kashyap, Cartic Ramakrishnan, Christopher Thomas, Amit P. Sheth Jan 2005

Taxaminer: An Experimentation Framework For Automated Taxonomy Bootstrapping, Vipul Kashyap, Cartic Ramakrishnan, Christopher Thomas, Amit P. Sheth

Kno.e.sis Publications

Construction of domain ontologies on the semantic web is a human and resource intensive process, efforts to reduce which are crucial for the Semantic Web to scale. We present a framework for automated taxonomy construction, that involves: (a) generation of a cluster hierarchy from a document corpus using statistical clustering and NLP techniques; (b) extraction of a topic hierarchy from this cluster hierarchy; and (c) assignment of labels to nodes in the topic hierarchy. Metrics for estimating topic hierarchy quality and parameters of an experimentation framework are identified. MEDLINE was the document corpus and MeSH thesaurus was the gold standard.

Go to article

Ranking Complex Relationships On The Semantic Web, Boanerges Aleman-Meza, Christian Halaschek-Wiener, I. Budak Arpinar, Cartic Ramakrishnan, Amit P. Sheth Jan 2005

Ranking Complex Relationships On The Semantic Web, Boanerges Aleman-Meza, Christian Halaschek-Wiener, I. Budak Arpinar, Cartic Ramakrishnan, Amit P. Sheth

Kno.e.sis Publications

Industry and academia are both focusing their attention on information retrieval over semantic metadata extracted from the Web, and it is increasingly possible to analyze such metadata to discover interesting relationships. However, just as document ranking is a critical component in today's search engines, the ranking of complex relationships would be an important component in tomorrow's semantic Web engines. This article presents a flexible ranking approach to identify interesting and relevant relationships in the semantic Web. The authors demonstrate the scheme's effectiveness through an empirical evaluation over a real-world data set.

Go to article

Variational Bayesian Image Modelling, Li Chen, Feng Jiao, Dale Schuurmans, Shaojun Wang Jan 2005

Variational Bayesian Image Modelling, Li Chen, Feng Jiao, Dale Schuurmans, Shaojun Wang

Kno.e.sis Publications

We present a variational Bayesian framework for performing inference, density estimation and model selection in a special class of graphical models—Hidden Markov Random Fields (HMRFs). HMRFs are particularly well suited to image modelling and in this paper, we apply them to the problem of image segmentation. Unfortunately, HMRFs are notoriously hard to train and use because the exact inference problems they create are intractable. Our main contribution is to introduce an efficient variational approach for performing approximate inference of the Bayesian formulation of HMRFs, which we can then apply to the density estimation and model selection problems that arise when …

Go to article

First Prev Next Last