Computer Sciences Commons^™

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 14, Number 9, December 1998, 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 14, Number 8, October 1998, 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 14, Number 7, September 1998, 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 14, Number 6, June 1998, 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 14, Number 5, May 1998, 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 14, Number 4, April 1998, 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.

Logical Information Modeling Of Web-Accessible Heterogeneous Digital Assets, Kshitij Shah, Amit P. Sheth

Kno.e.sis Publications

This paper introduces the MREF framework for representing and correlating information at a higher semantic level than is possible with Web-based information systems today. The role that metadata plays in this framework is described, together with a metadata based infrastructure to support our media independent information correlation paradigm. To keep it consistent with evolving standards, broader acceptance and ease of implementation, MREF abstraction is structured on top of RDF and XML. Its central role in the context of the InfoQuilt system, for exploiting heterogeneous digital media using a federated and scalable architecture, is briefly described.

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 14, Number 3, March 1998, 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 14, Number 2, February 1998, 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.

Zebra Image Access System, Srilekha Mudumbai, Kshitij Shah, Amit P. Sheth, Krishnan Parasuraman, Clemens Bertram

Kno.e.sis Publications

The ZEBRA system, which is part of the VisualHarness platform for managing heterogeneous data, supports three types of access to distributed image repositories: keyword based, attribute based, and image content based. A user can assign different weights (relative importance) to each of the three types, and within the last type of access, to each of the image properties. The image based access component (IBAC) supports access based on computable image properties such as those based on spatial domain, frequency domain or statistical and structural analysis. However, it uses a novel black box approach of utilizing a Visual Information Retrieval (VIR) …

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 14, Number 1, January 1998, College Of Engineering And Computer Science, Wright State University

BITs and PCs Newsletter

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

Strictly Level-Decreasing Logic Programs, Pascal Hitzler, Anthony K. Seda

Computer Science and Engineering Faculty Publications

We study strictly level-decreasing logic programs (sld-programs) as defined earlier by the present authors. It will be seen that sld-programs, unlike most other classes of logic programs, have both a highly intuitive declarative semantics, given as a unique supported model, and are computationally adequate in the sense that every partial recursive function can be represented by some sld-program P. Allowing for a safe use of cuts, an interpreter based on SLDNF-resolution, as implemented for example in standard Prolog systems, is shown to be sound and complete with respect to this class of programs. Furthermore, we study connections between topological …

Interestingness Of Discovered Association Rules In Terms Of Neighborhood-Based Unexpectedness, Guozhu Dong, Jinyan Li

Kno.e.sis Publications

One of the central problems in knowledge discovery is the development of good measures of interestingness of discovered patterns. With such measures, a user needs to manually examine only the more interesting rules, instead of each of a large number of mined rules. Previous proposals of such measures include rule templates, minimal rule cover, actionability, and unexpectedness in the statistical sense or against user beliefs.

In this paper we will introduce neighborhood-based interestingness by considering unexpectedness in terms of neighborhood-based parameters. We first present some novel notions of distance between rules and of neighborhood of rules. The neighborhood-based interestingness of …

Generalized Ultrametrics, Domains And An Application To Computational Logic, Anthony K. Seda, Pascal Hitzler

Computer Science and Engineering Faculty Publications

Fixed points of functions and operators are of fundamental importance in programming language semantics in giving meaning to recursive definitions and to constructs which involve self-reference. It follows therefore that fixed-point theorems are also of fundamental importance in theoretical computer science. Often, order-theoretic arguments are available in which case the well-known Knaster-Tarski theorem can be used to obtain fixed-points. Sometimes, however, analytical arguments are needed involving the Banach contraction mapping theorem as is the case for example in studying concurrency and communicating systems. Situations arise also in computational logic in the presence of negation which force non-monotonicity of the operators …