Computer Sciences Commons^™

Logic Programs, Iterated Function Systems, And Recurrent Radial Basis Function Networks, Sebastian Bader, Pascal Hitzler

Computer Science and Engineering Faculty Publications

Graphs of the single-step operator for first-order logic programs—displayed in the real plane—exhibit self-similar structures known from topological dynamics, i.e., they appear to be fractals, or more precisely, attractors of iterated function systems. We show that this observation can be made mathematically precise. In particular, we give conditions which ensure that those graphs coincide with attractors of suitably chosen iterated function systems, and conditions which allow the approximation of such graphs by iterated function systems or by fractal interpolation. Since iterated function systems can easily be encoded using recurrent radial basis function networks, we eventually obtain connectionist systems which …

Logic Programs And Connectionist Networks, Pascal Hitzler, Steffen Holldobler, Anthony K. Seda

Computer Science and Engineering Faculty Publications

Graphs of the single-step operator for first-order logic programs—displayed in the real plane—exhibit self-similar structures known from topological dynamics, i.e., they appear to be fractals, or more precisely, attractors of iterated function systems. We show that this observation can be made mathematically precise. In particular, we give conditions which ensure that those graphs coincide with attractors of suitably chosen iterated function systems, and conditions which allow the approximation of such graphs by iterated function systems or by fractal interpolation. Since iterated function systems can easily be encoded using recurrent radial basis function networks, we eventually obtain connectionist systems which …

Default Reasoning Over Domains And Concept Hierarchies, Pascal Hitzler

Computer Science and Engineering Faculty Publications

W.C. Rounds and G.-Q. Zhang have proposed to study a form of disjunctive logic programming generalized to algebraic domains [1]. This system allows reasoning with information which is hierarchically structured and forms a (suitable) domain. We extend this framework to include reasoning with default negation, giving rise to a new nonmonotonic reasoning framework on hierarchical knowledge which encompasses answer set programming with extended disjunctive logic programs. We also show that the hierarchically structured knowledge on which programming in this paradigm can be done, arises very naturally from formal concept analysis. Together, we obtain a default reasoning paradigm for conceptual …

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 21, Number 1, September 2004, College Of Engineering And Computer Science, Wright State University

BITs and PCs Newsletter

A ten page newsletter created by the Wright State University College of Engineering and Computer Science that addresses the current affairs of the college.

Enhancing Web Services Description And Discovery To Facilitate Composition, Preeda Rajasekaran, John A. Miller, Kunal Verma, Amit P. Sheth

Kno.e.sis Publications

Web services are in the midst of making the transition from being a promising technology to being widely used in the industry. However, most efforts to use Web services have been manual, thus slowing down the ever changing and dynamic businesses of today. In this paper, we contend that more expressive descriptions of Web services will lead to greater automation and thus provide more agility to businesses. We present the METEOR-S front-end tools for source code annotation and semantic Web service description generation. We also present WSDL-S, a language created for incorporating semantic descriptions in the industry wide accepted WSDL, …

Workflow Management Systems And Erp Systems: Differences, Commonalities, And Applications, Jorge Cardoso, Robert P. Bostrom, Amit P. Sheth

Kno.e.sis Publications

Two important classes of information systems, Workflow Management Systems(WfMSs) and Enterprise Resource Planning (ERP) systems, have been used to support e-business process redesign, integration, and management. While both technologies can help with business process automation, data transfer, and information sharing, the technological approach and features of solutions provided by WfMS and ERP are different. Currently, there is a lack of understanding of these two classes of information systems in the industry and academia, thus hindering their effective applications. In this paper, we present a comprehensive comparison between these two classes of systems. We discuss how the two types of systems …

Learning Mixture Models With The Regularized Latent Maximum Entropy Principle, Shaojun Wang, Dale Schuurmans, Fuchun Peng, Yunxin Zhao

Kno.e.sis Publications

This paper presents a new approach to estimating mixture models based on a recent inference principle we have proposed: the latent maximum entropy principle (LME). LME is different from Jaynes' maximum entropy principle, standard maximum likelihood, and maximum a posteriori probability estimation. We demonstrate the LME principle by deriving new algorithms for mixture model estimation, and show how robust new variants of the expectation maximization (EM) algorithm can be developed. We show that a regularized version of LME (RLME), is effective at estimating mixture models. It generally yields better results than plain LME, which in turn is often better than …

Discovery Of Web Services In A Federated Registry Environment, Kaarthik Sivashanmugam, Kunal Verma, Amit P. Sheth

Kno.e.sis Publications

The potential of a large scale growth of private and semi-private registries is creating the need for an infrastructure which can support discovery and publication over a group of autonomous registries. Recent versions of UDDI have made changes to accommodate interactions between distributed registries. In this paper, we discuss METEOR-S Web service Discovery Infrastructure, which provides an ontology-based infrastructure to access a group of registries that are divided based on business domains and grouped into federations. We also discuss how Web service discovery is carried out within a federation.

Cs 340: Programming Language Workshop In Java, Ronald F. Taylor

Computer Science & Engineering Syllabi

This course is designed as a self-study in Java. You are expected to work independently to learn the Java language and solve a set of programming problems assigned to you using latest Java SDK available at http://java.sun.com or other software as approved by the instructor. There are no exams. We officially meet only once in a quarter. However, I will be available in the posted office hours for clarifications and general discussion of the programming assignments. Do not expect support in debugging badly documented code.

Cs 214: Object Oriented Programming, Roddy Keish

Computer Science & Engineering Syllabi

No abstract provided.

Sweto: Large-Scale Semantic Web Test-Bed, Boanerges Aleman-Meza, Chris Halaschek, Amit P. Sheth, I. Budak Arpinar, Gowtham Sannapareddy

Kno.e.sis Publications

The emergent Semantic Web community needs a common infrastructure for testing the scalability and quality of new techniques and software which use machine processable data. Since ontologies are a centerpiece of most approaches, we believe that for an accurate evaluation of tools for quality, scalability and performance, the research community needs a freely available ontology with a large description base. If the use of tools is to be for advanced semantic applications, such as those in business intelligence and national security, then instances in the knowledge base should be highly interconnected. Thus, we propose and describe a Semantic WEb Technology …

Semantic Web Technology Evaluation Ontology (Sweto): A Test Bed For Evaluating Tools And Benchmarking Applications, Boanerges Aleman-Meza, Amit P. Sheth, I. Budak Arpinar, Chris Halaschek

Kno.e.sis Publications

No abstract provided.

Meteor-S Web Service Annotation Framework, Abhijit A. Patil, Swapna A. Oundhakar, Amit P. Sheth, Kunal Verma

Kno.e.sis Publications

The World Wide Web is emerging not only as an infrastructure for data, but also for a broader variety of resources that are increasingly being made available as Web services. Relevant current standards like UDDI, WSDL, and SOAP are in their fledgling years and form the basis of making Web services a workable and broadly adopted technology. However, realizing the fuller scope of the promise of Web services and associated service oriented architecture will requite further technological advances in the areas of service interoperation, service discovery, service composition, and process orchestration. Semantics, especially as supported by the use of ontologies, …

Sempl: A Semantic Portal, Matthew Perry, Eric Stiles

Kno.e.sis Publications

Semantic Web technology is intended for the retrieval, collection, and analysis of meaningful data with significant automation afforded by machine understandability of data [1]. As one illustration of semantic web technology in action, we present SEMPL, a semantic web portal for the Large Scale Distributed Information Systems lab (LSDIS) at the University of Georgia. SEMPL, which is powered by a state of the art commercial system, Semagix Freedom [7], uses an ontology-driven approach to provide semantic browsing, linking, and contextual querying of content within the portal. By using the ontology based information integration technique, SEMPL can specify the context of …

Indexing Genomic Databases, Gina Cooper, Michael L. Raymer, Travis E. Doom, Dan E. Krane, Natsuhiko Futamura

Kno.e.sis Publications

Current biological sequence comparison tools utilize full database searches to find approximate matches between a database and a query. A new approach to sequence comparisons can be performed by indexing the database using a novel indexing scheme. An indexed scheme can immediately eliminate highly mismatched sequences thereby improving performance and accuracy. iBlast is proposed as an indexed version of BLAST. In its initial implementation, iBlast uses a sequence-based index to catalog genomic databases in an NCR Teradata RDBMS. Several types of indexes and querying methods are explored to determine the most efficient solution utilizing the parallel nature of the Teradata …

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 20, Number 7, May 2004, College Of Engineering And Computer Science, Wright State University

BITs and PCs Newsletter

An eight page newsletter created by the Wright State University College of Engineering and Computer Science that addresses the current affairs of the college.

Detection Of Closed Hyperstreamlines, Thomas Wischgoll

Computer Science and Engineering Faculty Publications

No abstract provided.

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 20, Number 6, April 2004, College Of Engineering And Computer Science, Wright State University

BITs and PCs Newsletter

A six page newsletter created by the Wright State University College of Engineering and Computer Science that addresses the current affairs of the college.

Quality Of Service For Workflows And Web Service Processes, Jorge Cardoso, Amit P. Sheth, John A. Miller, Jonathan Arnold, Krzysztof J. Kochut

Kno.e.sis Publications

Workflow management systems (WfMSs) have been used to support various types of business processes for more than a decade now. In workflows or Web processes for e-commerce and Web service applications, suppliers and customers define a binding agreement or contract between the two parties, specifying quality of service (QoS) items such as products or services to be delivered, deadlines, quality of products, and cost of services. The management of QoS metrics directly impacts the success of organizations participating in e-commerce. Therefore, when services or products are created or managed using workflows or Web processes, the underlying workflow engine must accept …

Corollaries On The Fixpoint Completion: Studying The Stable Semantics By Means Of The Clark Completion, Pascal Hitzler

Computer Science and Engineering Faculty Publications

The fixpoint completion fix (P) of a normal logic program P is a program transformation such that the stable models of P are exactly the models of the Clark completion of fix (P). This is well-known and was studied by Dung and Kanchanasut [15]. The correspondence, however, goes much further: The Gelfond-Lifschitz operator of P coincides with the immediate consequence operator of fix (P), as shown by Wendt [51], and even carries over to standard operators used for characterizing the well-founded and the Kripke-Kleene semantics. We will apply this knowledge to the study of …

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 20, Number 5, March 2004, College Of Engineering And Computer Science, Wright State University

BITs and PCs Newsletter

A ten page newsletter created by the Wright State University College of Engineering and Computer Science that addresses the current affairs of the college.

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 20, Number 4, February 2004, College Of Engineering And Computer Science, Wright State University

BITs and PCs Newsletter

An eight page newsletter created by the Wright State University College of Engineering and Computer Science that addresses the current affairs of the college.

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 20, Number 3, January 2004, College Of Engineering And Computer Science, Wright State University

BITs and PCs Newsletter

A ten page newsletter created by the Wright State University College of Engineering and Computer Science that addresses the current affairs of the college.

Early Work In Database Research On Schema Mapping/Merging/Transformation, Semantic Heterogeneity, And Use Of Ontology And Description Logics For Schematic And Semantic Integration, Amit P. Sheth

Kno.e.sis Publications

No abstract provided.

Exploiting Syntactic, Semantic And Lexical Regularities In Language Modeling Via Directed Markov Random Fields, Shaojun Wang, Shaomin Wang, Russell Greiner, Dale Schuurmans, Li Cheng

Kno.e.sis Publications

No abstract provided.

Operator-Based Semantics For Logic Programs, Pascal Hitzler

Computer Science and Engineering Faculty Publications

The question how knowledge can be represented by means of logic programs with negation has been a driving force for the field of non-monotonic reasoning. Implemented systems, known as answer set programming systems, have emerged recently and are currently being used in various application domains like the semantic web.

Intuitively, logic programs are being used for encoding commonsense reasoning, in particular the phenomenon that human reasoning tends to ”jump to conclusions” under incomplete knowledge. Formally, this kind of reasoning is described by interpreting the first-order syntax of logic programs in a more sophisticated way. This, in turn, is most easily …

On The Decidability Of The Termination Problem Of Active Database Systems, James Bailey, Guozhu Dong, K. Rammamohanarao

Kno.e.sis Publications

Active database systems enhance the functionality of traditional databases through the use of active rules or ‘triggers’. One of the principal analysis questions for such systems is that of termination—is it possible for the rules to recursively activate one another indefinitely, given an initial triggering event. In this paper, we study the decidability of the termination problem, our aim being to delimit the boundary between the decidable and the undecidable. We present results for two broad types of variations, variations in rule syntax and variations in meta level features. Within each of these, we identify members close to the …

Virtual Exploration Of A Cardiovascular System, Elke Moritz, Thomas Wischgoll, Joerg Meyer

Computer Science and Engineering Faculty Publications

No abstract provided.

Approximating First-Order Logic Programs By Feedforward Networks, Pascal Hitzler

Computer Science and Engineering Faculty Publications

We want to apply Funahashi's theorem in order to approximate the T_P operator for first-order (normal) logic programs P via 3-layer feedforward networks. I.e. we need to understand T_P as a continuous function on the reals.

We will need to study some preliminaries from set-theoretic topology first result from [HS00, HHS0_x], which extends results from [HKS99]. We close with some further considerations about the methods and results.

Semantic Integration Of Glycomics Data And Information, William S. York, Amit P. Sheth, Krzysztof J. Kochut, John A. Miller, Christopher Thomas, Karthik Gomadam, X. Yi, Meenakshi Nagarajan

Kno.e.sis Publications

No abstract provided.