Computer Sciences Commons^™

Connectionist Model Generation: A First-Order Approach, Sebastian Bader, Pascal Hitzler, Steffen Holldobler

Computer Science and Engineering Faculty Publications

Knowledge-based artificial neural networks have been applied quite successfully to propositional knowledge representation and reasoning tasks. However, as soon as these tasks are extended to structured objects and structure-sensitive processes as expressed e.g., by means of first-order predicate logic, it is not obvious at all what neural-symbolic systems would look like such that they are truly connectionist, are able to learn, and allow for a declarative reading and logical reasoning at the same time. The core method aims at such an integration. It is a method for connectionist model generation using recurrent networks with feed-forward core. We show in this …

Mediatability: Estimating The Degree Of Human Involvement In Xml Schema Mediation, Karthik Gomadam, Ajith Harshana Ranabahu, Lakshmish Ramaswamy, Amit P. Sheth, Kunal Verma

Kno.e.sis Publications

Mediation and integration of data are significant challenges because the number of services on the Web, and heterogeneities in their data representation, continue to increase rapidly. To address these challenges we introduce a new measure, mediatability, which is a quantifiable and computable metric for the degree of human involvement in XML schema mediation. We present an efficient algorithm to compute mediatability and an experimental study to analyze how semantic annotations affect the ease of mediating between two schemas. We validate our approach by comparing mediatability scores generated by our system with user-perceived difficulty. We also evaluate the scalability of our …

An Xml-Based Approach To Handling Tables In Documents, Krishnaprasad Thirunarayan, Trivikram Immaneni

Kno.e.sis Publications

We explore application of XML technology for handling tables in legacy semi-structured documents. Specifically, we analyze annotating heterogeneous documents containing tables to obtain a formalized XML Master document that improves traceability (hence easing verification and update) and enables manipulation using XSLT stylesheets. This approach is useful when table instances far outnumber distinct table types because the effort required to annotate a table instance is relatively less compared to formalizing table processing that respects table’s semantics. This work is also relevant for authoring new documents with tables that should be accessible to both humans and machines.

Applications Of Voting Theory To Information Mashups, Alfredo Alba, Varun Bhagwan, Julia Grace, Daniel Gruhl, Kevin Haas, Meenakshi Nagarajan, Jan Pieper, Christine Robson, Nachiketa Sahoo

Kno.e.sis Publications

Blogs, discussion forums and social networking sites are an excellent source for people's opinions on a wide range of topics. We examine the application of voting theory to "information mashups" - the combining and summarizing of data from the multitude of often-conflicting sources. This paper presents an information mashup in the music domain: a Top 10 artist chart based on user comments and listening behavior from several Web communities. We consider different voting systems as algorithms to combine opinions from multiple sources and evaluate their effectiveness using social welfare functions. Different voting schemes are found to work better in some …

Unraveling Protein Networks With Power Graph Analysis, Loïc Royer, Matthias Reimann, Bill Andreopoulos, Michael Schroeder

Faculty Publications, Computer Science

Networks play a crucial role in computational biology, yet their analysis and representation is still an open problem. Power Graph Analysis is a lossless transformation of biological networks into a compact, less redundant representation, exploiting the abundance of cliques and bicliques as elementary topological motifs. We demonstrate with five examples the advantages of Power Graph Analysis. Investigating protein-protein interaction networks, we show how the catalytic subunits of the casein kinase II complex are distinguishable from the regulatory subunits, how interaction profiles and sequence phylogeny of SH3 domains correlate, and how false positive interactions among high-throughput interactions are spotted. Additionally, we …

Dependence Of Binary Associations On Co-Occurrence Granularity In News Documents, Krishnaprasad Thirunarayan, Trivikram Immaneni, Mastan Vali Shaik

Kno.e.sis Publications

We describe and formalize an approach to correlate binary associations (such as between entities and events, between persons and events, etc.) implied by News documents on the co-occurrence granularity (such as document-level, paragraph-level, sentence-level, etc.) of the corresponding text phrases in the documents. Specifically, we present both qualitative and quantitative characterization of searching News documents: former in terms of the nature of the content and the queries, and latter in terms of a metric obtained by adapting the notions of precision and recall. Specifically, the approach tries to reduce the manual effort required to analyze the News documents to compare …

Semantic Web: Promising Technologies, Current Applications & Future Directions, Amit P. Sheth

Kno.e.sis Publications

No abstract provided.

Description Logic Rules, Markus Krotzsch, Sebastian Rudolph, Pascal Hitzler

Computer Science and Engineering Faculty Publications

We introduce description logic (DL) rules as a new rule-based formalism for knowledge representation in DLs. As a fragment of the Semantic Web Rule Language SWRL, DL rules allow for a tight integration with DL knowledge bases. In contrast to SWRL, however, the combination of DL rules with expressive description logics remains decidable, and we show that the DL SROIQ – the basis for the ongoing standardisation of OWL 2 – can completely internalise DL rules. On the other hand, DL rules capture many expressive features of SROIQ that are not available in simpler DLs yet. While reasoning in SROIQ …

Boosting With Incomplete Information, Gholamreza Haffari, Yang Wang, Shaojun Wang, Greg Mori, Feng Jiao

Kno.e.sis Publications

In real-world machine learning problems, it is very common that part of the input feature vector is incomplete: either not available, missing, or corrupted. In this paper, we present a boosting approach that integrates features with incomplete information and those with complete information to form a strong classifier. By introducing hidden variables to model missing information, we form loss functions that combine fully labeled data with partially labeled data to effectively learn normalized and unnormalized models. The primal problems of the proposed optimization problems with these loss functions are provided to show their close relationship and the motivations behind them. …

A Framework For Trust And Distrust Networks, Krishnaprasad Thirunarayan

Kno.e.sis Publications

In this age of internet and electronic commerce it is becoming increasingly important to have and to manipulate information about the trustworthiness of the content or service providers in order to make informed decisions. This paper explores realistic models of trust and distrust based on partially ordered discrete values and proposes a framework, which is sensitive to local, relative ordering of values rather than their magnitudes. The framework distinguishes between direct and inferred trust, preferring direct information over possibly conflicting inferred information. It also represents ambiguity or inconsistency explicitly. The framework is capable of handling general trust and belief networks …

A Forgetting-Based Approach For Reasoning With Inconsistent Distributed Ontologies, Guilin Qi, Yimin Wang, Peter Haase, Pascal Hitzler

Computer Science and Engineering Faculty Publications

In the context of multiple distributed ontologies, we are often confronted with the problem of dealing with inconsistency. In this paper, we propose an approach for reasoning with inconsistent distributed ontologies based on concept forgetting. We firstly define concept forgetting in description logics. We then adapt the notions of recoveries and preferred recoveries in propositional logic to description logics. Two consequence relations are then defined based on the preferred recoveries.

Graph Summaries For Subgraph Frequency Estimation, Angela Maduko, Kemafor Anyanwu, Amit P. Sheth, Paul Schliekelman

Kno.e.sis Publications

A fundamental problem related to graph structured databases is searching for substructures. One issue with respect to optimizing such searches is the ability to estimate the frequency of substructures within a query graph. In this work, we present and evaluate two techniques for estimating the frequency of subgraphs from a summary of the data graph. In the first technique, we assume that edge occurrences on edge sequences are position independent and summarize only the most informative dependencies. In the second technique, we prune small subgraphs using a valuation scheme that blends information about their importance and estimation power. In both …

Defeasible Inference With Circumscriptive Owl Ontologies, Stephan Grimm, Pascal Hitzler

Computer Science and Engineering Faculty Publications

The Web Ontology Language (OWL) adheres to the openworld assumption and can thus not be used for forms of nonmonotonic reasoning or defeasible inference, an acknowledged desirable feature in open Semantic Web environments. We investigate the use of the formalism of circumscriptive description logics (DLs) to realise defeasible inference within the OWL framework. By example, we demonstrate how reasoning with (restricted) circumscribed OWL ontologies facilitates various forms of defeasible inference, also in comparison to alternative approaches. Moreover, we sketch an extension to DL tableaux for handling the circumscriptive case and report on a preliminary implementation.

Empowering Translational Research Using Semantic Web Technologies, Amit P. Sheth

Kno.e.sis Publications

No abstract provided.

Improving The Computer Science In Bioinformatics Through Open Source Pedagogy, John David N. Dionisio, Kam D. Dahlquist

Biology Faculty Works

Bioinformatics relies more than ever on information technologies. This pressures scientists to keep up with software development best practices. However, traditional computer science curricula do not necessarily expose students to collaborative and long-lived software development. Using open source principles, practices, and tools forms an effective pedagogy for software development best practices. This paper reports on a bioinformatics teaching framework implemented through courses introducing computer science students to the field. The courses led to an initial product release consisting of software and an Escherichia coli K12 GenMAPP Gene Database, within a total "incubation time" of six months.

Sa-Rest: Using Semantics To Empower Restful Services And Smashups With Better Interoperability And Mediation, Karthik Gomadam, Amit P. Sheth

Kno.e.sis Publications

No abstract provided.

Dynamic And Agile Soa Using Sawsdl, Karthik Gomadam, Kunal Verma, Amit P. Sheth

Kno.e.sis Publications

No abstract provided.

A Framework To Support Spatial, Temporal And Thematic Analytics Over Semantic Web Data, Matthew Perry, Amit P. Sheth

Kno.e.sis Publications

Spatial and temporal data are critical components in many applications. This is especially true in analytical applications ranging from scientific discovery to national security and criminal investigation. The analytical process often requires uncovering and analyzing complex thematic relationships between disparate people, places and events. Fundamentally new query operators based on the graph structure of Semantic Web data models, such as semantic associations, are proving useful for this purpose. However, these analysis mechanisms are primarily intended for thematic relationships. In this paper, we describe a framework built around the RDF data model for analysis of thematic, spatial and temporal relationships between …

Foundations And Interpretations Of Quantum Mechanics, Cory Johnson

Honors Theses

The first famous thought experiment of Einstein gives rise to his theories of relativity, the bedrock of modern astrophysics and cosmology. His second famous thought experiment begins the investigation into the foundations of quantum mechanics. It leads to a paradox, inspiring various 'no-go' theorems proven by Bell, Kochen, and Specker. Physicists and philosophers worldwide become increasingly dissatisfied with the probabilistic complementarity interpretation (Born-Bohr) and eventually offer their own accounts of the theory. By the end of the 20th century two alternative approaches stand out as the best candidates: Both the hidden variables interpretation (de Broglie-Bohm) and the many worlds interpretation …

Effects Of Context Of Natural And Artifactual Objects On Categorization, Linsey Walker

Honors Theses

Categorization of animals and vehicles in different contexts was investigated in three experiments using event related potentials (ERPs). The presence of a background and congruency of the background in relation to the object were both manipulated in order to determine the effects of context on visual processing. In Experiment 1, adults were presented with images of animals and vehicles in two conditions: situated in a congruent context (e.g. an animal in a field) and in the absence of a context (an animal in a white homogeneous background). In experiment 2, adults were presented with images of animals and vehicles in …

Ws3: International Workshop On Context-Enabled Source And Service Selection, Integration And Adaptation, Quan Z. Sheng, Ullas Nambiar, Amit P. Sheth, Biplav Srivastava, Zakaria Maamr, Said Elnaffar

Kno.e.sis Publications

This write-up provides a summary of the International Workshop on Context enabled Source and Service Selection, Integration and Adaptation (CSSSIA 2008), organized in conjunction with WWW2008, at Beijing, China on April 22nd 2008. We outline the motivation for organizing the work-shop, briefly describe the organizational details and program of the workshop, and summarize each of the papers accepted by the workshop. More information about the workshop can be found at http://www.cs.adelaide.edu.au/∼csssia08/.

Dioxidobis(2-Oxo-1,2-Dihydropyridin-3-Olato)­Molybdenum(Vi), Manoj Trivedi, Daya Pandey, Nigam Rath

Chemistry & Biochemistry Faculty Works

In the title compound, [Mo(C5H4NO2)2O2], the MoVI atom exhibits a distorted octa­hedral coordination geometry formed by two terminal oxo ligands and two monoanionic O,O-bidentate pyridinone ligands. The two terminal oxo ligands lie in a cis arrangement, the ketonic O atoms of the pyridinone ligands are coordinated trans to the oxo ligands and the deprotonated hydroxyl O atoms are located trans to each other. The crystal structure contains inter­molecular N-H...O hydrogen bonds, C-H...O contacts and face-to-face [pi]-[pi] stacking inter­actions with an inter­planar separation of 3.25 (1) Å.

Diethyl 2-[(4-Nitro­Phen­Yl)(4-Phenyl-1,2,3-Selenadiazol-5-Yl)Meth­Yl]Malonate, A. Marx, S. Saravanan, S. Muthusubramanian, V. Manivannan, Nigam Rath

Chemistry & Biochemistry Faculty Works

In the title compound, C22H21N3O6Se, the heterocyclic ring makes dihedral angles of 50.03 (11) and 67.75 (11)°, respectively, with the benzene and phenyl rings. The terminal C atoms of the ester groups are disordered over two positions: the site occupancies for the C atoms are 0.62 (3)/0.38 (3) and 0.48 (3)/0.52 (3). In the crystal structure, weak intra- and inter­molecular C-H...O inter­actions are observed.

Rdb2rdf: Incorporating Domain Semantics In Structured Data, Satya S. Sahoo

Kno.e.sis Publications

No abstract provided.

Artist Ranking Through Analysis Of On-Line Community Comments, Julia Grace, Daniel Gruhl, Kevin Haas, Meenakshi Nagarajan, Christine Robson, Nachiketa Sahoo

Kno.e.sis Publications

We describe an approach to measure the popularity of music tracks, albums and artists by analyzing the comments of music listeners in social networking online communities such as MySpace. This measure of popularity appears to be more accurate than the traditional measure based on album sales figures, as demonstrated by our focus group study. We faced many challenges in our attempt to generate a popularity ranking from the user comments on social networking sites, e.g., broken English sentences, comment spam, etc. We discuss the steps we took to overcome these challenges and describe an end to end system for generating …

Volume 01, Jessica Fields, Stephanie Neeley, Derek W. Hambright, Mary E. Lehman, Andrew R. Grzankowski, Zachary Johnson, Boone M. Prentice, Ashley M. Swandby, Victoria Morgan, Katie Williamson, Kristine G. Bender, Katelyn N. Romaine, D. Nicole Swann, Jessica Fox, Mike Mcateer, Alex Grabiec, Laura Nodtvedt, Nick Costa, Rachel Wolfe, Zack Dalton

Incite: The Journal of Undergraduate Scholarship

Introduction from Dean Dr. Charles Ross

Three Decades of Digging: Undergraduate Archeology at Longwood by Jessica Fields and Stephanie Neeley

Interactions of Allelopathy and Heat Stress in Plants by Derek W. Hambright and Mary E. Lehman

Inertial Electrostatic Confinement D-D Fusion Device: Construction and Simulation by Andrew R. Grzankowski

Shackled Nim by Zachary Johnson

Development of GC-MS and Chemometric Methods for the Analysis of Accelerants in Arson Cases by Boone M. Prentice

A Comparison of Image Analysis Methods in cDNA Microarrays by Ashley M. Swandby

Perceived Sexual Activity of Short and Long-Term Relationships by Victoria Morgan and Katie Williamson

Elderly …

Traveling The Semantic Web Through Space, Time, And Theme, Amit P. Sheth, Matthew Perry

Kno.e.sis Publications

In this installment of Semantics and Services, we further develop the idea of spatial, temporal, and thematic (STT) processing of semantic Web data and describe the Web infrastructure needed to support it. Starting from Ramesh Jain's vision of the EventWeb as a view of what's possible with a Web that better accommodates all three dimensions of event-related information (thematic, spatial, and temporal), we outline the architecture needed to support it and current research that aims to realize it.

4-(4-Chlorophenyl)-5-[1-(4-Chlorophenyl)-2-Methyl-2-Nitropropyl]-1,2,3-Selenadiazole, A. Marx, S. Saravanan, S. Muthusubramanian, V. Manivannan, Nigam Rath

Chemistry & Biochemistry Faculty Works

In the title compound, C18H15Cl2N3O2Se, the selenadiazole ring makes dihedral angles of 49.87 (3) and 55.70 (3)° with the two benzene rings. The dihedral angle between the two benzene rings is 11.90 (5)°. In the crystal structure, intra­molecular C-H...O and C-H...Se inter­actions and inter­molecular C-H...O, C-H...Cl and C-H...N inter­actions are observed.

Semantic Sensor Web, Amit P. Sheth, Cory Andrew Henson

Kno.e.sis Publications

No abstract provided.

Approximate Owl Instance Retrieval With Screech, Pascal Hitzler, Markus Krotzsch, Sebastian Rudolph, Tuvshintur Tserendorj

Computer Science and Engineering Faculty Publications

With the increasing interest in expressive ontologies for the Semantic Web, it is critical to develop scalable and efficient ontology reasoning techniques that can properly cope with very high data volumes. For certain application domains, approximate reasoning solutions, which trade soundness or completeness for increased reasoning speed, will help to deal with the high computational complexities which state of the art ontology reasoning tools have to face. In this paper, we present a comprehensive overview of the SCREECH approach to approximate instance retrieval with OWL ontologies, which is based on the KAON2 algorithms, facilitating a compilation of OWL DL TBoxes …