Convergence Classes And Spaces Of Partial Functions, Anthony K. Seda, Roland Heinze, Pascal Hitzler

Computer Science and Engineering Faculty Publications

We study the relationship between convergence spaces and convergence classes given by means of both nets and filters, we consider the duality between them and we identify in convergence terms when a convergence space coincides with a convergence class. We examine the basic operators in the Vienna Development Method of formal systems development, namely, extension, glueing, restriction, removal and override, from the perspective of the Logic for Computable Functions. Thus, we examine in detail the Scott continuity, or otherwise, of these operators when viewed as operators on the domain (X → Y) of partial functions mapping X into …

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 18, Number 2, October 2001, 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 18, Number 1, September 2001, College Of Engineering And Computer Science, Wright State University

BITs and PCs Newsletter

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

Online Bayesian Tree-Structured Transformation Of Hmms With Optimal Model Selection For Speaker Adaptation, Shaojun Wang, Yunxin Zhao

Kno.e.sis Publications

This paper presents a new recursive Bayesian learning approach for transformation parameter estimation in speaker adaptation. Our goal is to incrementally transform or adapt a set of hidden Markov model (HMM) parameters for a new speaker and gain large performance improvement from a small amount of adaptation data. By constructing a clustering tree of HMM Gaussian mixture components, the linear regression (LR) or affine transformation parameters for HMM Gaussian mixture components are dynamically searched. An online Bayesian learning technique is proposed for recursive maximum a posteriori (MAP) estimation of LR and affine transformation parameters. This technique has the advantages of …

Semantic Operators And Fixed-Point Theory In Logic Programming, Anthony K. Seda, Pascal Hitzler

Computer Science and Engineering Faculty Publications

We consider rather general operators mapping valuations to (sets of) valuations in the context of the semantics of logic programming languages. This notion generalizes several of the standard operators encountered in this subject and is inspired by earlier work of M.C. Fitting. The fixed points of such operators play a fundamental role in logic programming semantics by providing standard models of logic programs and also in determining the computability properties of these standard models. We discuss some of our recent work employing topological ideas, in conjunction with order theory, to establish methods by which one can find the fixed points …

Summarizing Data Sets For Classification, Christopher W. Kinzig, Krishnaprasad Thirunarayan, Gary B. Lamont, Robert E. Marmelstein

Kno.e.sis Publications

This paper describes our approach and experiences with implementing a data mining system using genetic algorithms in C++. In contrast with earlier classification algorithms that tended to “tile” the data sets using some pre-specified “shapes”, the proposed system is based on Marmelstein’s work on determining natural boundaries for class homogeneous regions. These boundaries are further refined to construct a compact set of simple data mining rules for classification.

Query Processing With An Fpga Coprocessor Board, Jack S. Jean, Guozhu Dong, Hwa Zhang, Xinzhong Guo, Baifeng Zhang

Kno.e.sis Publications

In this paper, a commercial FPGA coprocessor board is used to accelerate the processing of queries on a relational database that contains texts and images. FPGA designs for text searching and image matching are described and their performances summarized. A potential design for a database JOIN operator is then studied. A query optimization preprocessor is then proposed.

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 17, Number 9, June 2001, 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 17, Number 8, May 2001, 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.

Making Use Of The Most Expressive Jumping Emerging Patterns For Classification, Jinyan Li, Guozhu Dong, Kotagiri Ramamohanarao

Kno.e.sis Publications

Classification aims to discover a model from training data that can be used to predict the class of test instances. In this paper, we propose the use of jumping emerging patterns (JEPs) as the basis for a new classifier called the JEP-Classifier. Each JEP can capture some crucial difference between a pair of datasets. Then, aggregating all JEPs of large supports can produce a more potent classification power. Procedurally, the JEP-Classifier learns the pair-wise features (sets of JEPs) contained in the training data, and uses the collective impacts contributed by the most expressive pair-wise features to determine the class labels …

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 17, Number 7, April 2001, 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.

Survivability Architecture For Workflow Management Systems, Jorge Cardoso, Zongwei Luo, John A. Miller, Amit P. Sheth, Krzysztof J. Kochut

Kno.e.sis Publications

The survivability of critical infrastructure systems has been gaining increasing concern from the industry. The survivability research area addresses the issue of infrastructure systems that continues to provide pre-established service levels to users in the face of disorders and react to changes in the surrounding environment. Workflow management systems need to be survivable since they are used to support critical and sensitive business processes. They require a high level of dependability and should not allow process instances to be interrupted or aborted due to failures. Moreover, due to their sensitivity, business process should reflect any change in the environment. In …

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 17, Number 6, March 2001, 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 17, Number 5, February 2001, 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.

A "Converse" Of The Banach Contraction Mapping Theorem, Pascal Hitzler, Anthony K. Seda

Computer Science and Engineering Faculty Publications

We prove a type of converse of the Banach contraction mapping theorem for metric spaces: if X is a T₁ topological space and f: X -> X is a function with the unique fixed point a such that fⁿ(x) converges to a for each x is a member of X, then there exists a distance function d on X such that f is a contraction on the complete ultrametric space (X,d) with contractivity factor 1/2. We explore properties of the resulting space (X,d).

Evolution Of Topology In Axi-Symmetric And 3-D Viscous Flows, Gerik Scheuermann, W. Kollmann, Xavier Tricoche, Thomas Wischgoll

Computer Science and Engineering Faculty Publications

No abstract provided.

Unique Supported-Model Classes Of Logic Programs, Pascal Hitzler, Anthony K. Seda

Computer Science and Engineering Faculty Publications

We study classes of programs, herein called unique supported-model classes, with the property that each program in the class has a unique supported model. Elsewhere, the authors examined these classes from the point of view of operators defined relative to certain three-valued logics. In this paper, we complement our earlier results by considering how unique supported-model classes fit into the framework given by various classes of programs in several well-known approaches to semantics.

Kontraktionssatze Auf Verallgemeinerten Metrischen Raumen, Pascal Hitzler

Computer Science and Engineering Faculty Publications

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 17, Number 4, January 2001, 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.

Parallel Detection Of Closed Streamlines In Planar Flows, Thomas Wischgoll, Gerik Scheuermann, Hans Hagen

Computer Science and Engineering Faculty Publications

No abstract provided.

Latent Maximum Entropy Principle For Statistical Language Modeling, Shaojun Wang, Ronald Rosenfeld, Yunxin Zhao

Kno.e.sis Publications

We describe a unified probabilistic framework for statistical language modeling, the latent maximum entropy principle. The salient feature of this approach is that the hidden causal hierarchical dependency structure can be encoded into the statistical model in a principled way by mixtures of exponential families with a rich expressive power. We first show the problem formulation, solution, and certain convergence properties. We then describe how to use this machine learning technique to model various aspects of natural language, such as syntactic structure of sentences, semantic information in a document. Finally, we draw a conclusion and point out future research directions.

Generalized Metrics And Topology In Logic Programming Semantics, Pascal Hitzler

Computer Science and Engineering Faculty Publications

Many fixed-point theorems are essentially topological in nature. Among them are the Banach contraction mapping theorem on metric spaces and the fixed-point theorem for Scott-continuous mappings on complete partial orders. The latter theorem is fundamental in denotational semantics since semantic operators in most programming language paradigms satisfy its requirements. The use of negation in logic programming and non-monotonic reasoning, however, renders some semantic operators to be non-monotonic, hence discontinuous with respect to the Scott topology, and therefore invalidates the standard approach, so that alternative methods have to be sought. In this thesis, we investigate topological methods, including generalized metric fixed-point …

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 17, Number 3, November 2000, 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 17, Number 2, October 2000, 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.

Classes Of Logic Programs Which Possess Unique Supported Models, Anthony K. Seda, Pascal Hitzler

Computer Science and Engineering Faculty Publications

Logic programming is concerned with the use of logic as a programming language. The main manifestation of this computing paradigm is in the various versions of Prolog which are now available, in which computation is viewed as deduction from sets of Horn clauses, although there is also growing interest in the related form known as answer set programming, see [10]. The reference [1] contains a good survey of the growth of logic programming over the last twenty-five years both as a stand-alone programming language and as a software component of large information systems. One advantage a logic program P has …

Semantic Web And Information Brokering: Opportunities, Commercialization, And Challenges, Amit P. Sheth

Kno.e.sis Publications

From the chairs' report published in SIGMOD record: The keynote address entitled 'Semantic Web and Information Brokering: Opportunities, Early Commercializations, and Challenges' was delivered by Amit Sheth (University of Georgia and Taalee Corp). Sheth characterized semantics as the next step in the evolution of the WWW and stressed the importance of semantically organized information for supporting ubiquitous, powerful, accurate and efficient access to this information. Sheth also reviewed proposals for semantic interoperability frameworks such as the DAML(DARPA Agent Mark-Up Language), the Oingo family of tools for defining concepts and extracting knowledge from large databases, as well as several scenarios on …

Exception Handling In Workflow Systems, Zongwei Luo, Amit P. Sheth, Krzysztof J. Kochut, John A. Miller

Kno.e.sis Publications

In this paper, defeasible workflow is proposed as a framework to support exception handling for workflow management. By using the “justified” ECA rules to capture more contexts in workflow modeling, defeasible workflow uses context dependent reasoning to enhance the exception handling capability of workflow management systems. In particular, this limits possible alternative exception handler candidates in dealing with exceptional situations. Furthermore, a case-based reasoning (CBR) mechanism with integrated human involvement is used to improve the exception handling capabilities. This involves collecting cases to capture experiences in handling exceptions, retrieving similar prior exception handling cases, and reusing the exception handling experiences …

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 17, Number 1, September 2000, 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.

Dimensionality Reduction Using Genetic Algorithms, Michael L. Raymer, William F. Punch, Erik D. Goodman, Leslie A. Kuhn, Anil K. Jain

Kno.e.sis Publications

Pattern recognition generally requires that objects be described in terms of a set of measurable features. The selection and quality of the features representing each pattern affect the success of subsequent classification. Feature extraction is the process of deriving new features from original features to reduce the cost of feature measurement, increase classifier efficiency, and allow higher accuracy. Many feature extraction techniques involve linear transformations of the original pattern vectors to new vectors of lower dimensionality. While this is useful for data visualization and classification efficiency, it does not necessarily reduce the number of features to be measured since each …

A New Fixed-Point Theorem For Logic Programming Semantics, Anthony K. Seda, Pascal Hitzler

Computer Science and Engineering Faculty Publications

We present a new fixed-point theorem akin to the Banach contraction mapping theorem, but in the context of a novel notion of generalized metric space, and show how it can be applied to analyse the denotational semantics of certain logic programs. The theorem is obtained by generalizing a theorem of Priess-Crampe and Ribenboim, which grew out of applications within valuation theory, but is also inspired by a theorem of S.G. Matthews which grew out of applications to conventional programming language semantics. The class of programs to which we apply our theorem was defined previously by us in terms of operators …