Knowledge Visualizer (KV) uses a General Logic Diagram (GLD) to display examples and/or various forms of knowledge learned from them in a planar model of a multi-dimensional discrete space. Knowledge can be in different forms, for example, decision rules, decision trees, logical expressions, clusters, classifiers, and neural nets with discrete input variables. KV is implemented as a module of t...

This document describes the program RECLA (REgression through CLAssification system). The program is able to learn a continuous dataset by transforming it into a classification problem and them applying a discrete class learner to the resulting dataset. It works as a kind of general interface program between existing discrete learners and the discretization module we have developed. Although RE...

Biological research supports the concept that advanced motion emerges from modular building blocks, which generate both rhythmical and discrete patterns. Inspired by these ideas, roboticists try to implement such building blocks using different techniques. In this paper, we show how to build such module by using a recurrent neural network (RNN) to encapsulate both discrete and rhythmical motion...

This thesis provides a logical and mathematical foundation for object-oriented specification languages with a further modularisation unit between the system and object classes. The unit is denoted object-oriented module, or module for short, and initially described in an informal way. Modules offer a better approach to reusability and provide better structuring of large, complex and distributed...

in this paper we introduce the concept of dirac structures on (hermitian) modules and vectorbundles and deduce some of their properties. among other things we prove that there is a one to onecorrespondence between the set of all dirac structures on a (hermitian) module and the group of allautomorphisms of the module. this correspondence enables us to represent dirac structures on (hermitian)mod...

This paper explore issues related to the control and verification of similar module systems in the discrete-event systems framework. Similar module systems are distributed systems comprised of subsystem modules that exhibit isomorphic local behavior coordinated on global event occurrences. When given a global model of these systems, it is shown how to decompose the global model into the compone...

Let  be a commutative ring and  be a unitary  module. We define a semi prime sub module of a module and consider various properties of it. Also we define semi-radical of a sub module of a module and give a number of its properties. We define modules which satisfy the semi-radical formula and present the existence of such a module.

If R is a valuation domain of maximal ideal P with a maximal immediate extension of finite rank it is proven that there exists a finite sequence of prime ideals P = L0 ⊃ L1 ⊃ · · · ⊃ Lm ⊇ 0 such that RLj /Lj+1 is almost maximal for each j, 0 ≤ j ≤ m − 1 and RLm is maximal if Lm 6= 0. Then we suppose that there is an integer n ≥ 1 such that each torsion-free R-module of finite rank is a direct s...

Most learning systems applied to problem solving have the goal of learning knowledge for solving problems more eeciently. However, very few systems have focused on the acquisition of planning operator descriptions. In this paper, we present a system that learns operator deenitions from the interaction with a completely unknown environment. In order to achieve better learning convergence, severa...

We study the notions of nuclearity and exactness for module maps on C∗-algebras which are C∗-module over another C∗-algebra with compatible actions examine finite approximation properties such C∗-modules. prove versions results Kirchberg Choi–Effros. As a concrete example, we extend dimensional reduced von Neumann algebras countable discrete groups to these operator inverse semigroups structure...