CASE WESTERN RESERVE UNIV CLEVELAND OHSYSTEMS RESEARCH CENTER
Overview
Works:  6 works in 6 publications in 1 language and 10 library holdings 

Publication Timeline
.
Most widely held works by
CASE WESTERN RESERVE UNIV CLEVELAND OHSYSTEMS RESEARCH CENTER
Some results in a theory of problem solving(
Book
)
1 edition published in 1967 in English and held by 3 WorldCat member libraries worldwide
The document contains the first three chapters of a book expected to be published in 1968. The book will consider certain methods for finding solutions to problems and games and their relationship to pattern recognition. The framework of elementary set theory is used to enable the relationship to be discussed in a common mathematical framework. The models of problems and two person games are specializations of a model that can be viewed as well as a general model of control systems. Unlike von Meumann's model of extended games, the present model is not a tree but an automaton or labeled directed graph. The treatment in this document suggests that the practical application of any solution strategy needs succinct descriptions of certain subsets of the state space of the control problem. The idea of description has been formalized, and the importance of description languages is discussed. Techniques for constructing solution strategies are presented, and the sets associated with their application are precisely defined
1 edition published in 1967 in English and held by 3 WorldCat member libraries worldwide
The document contains the first three chapters of a book expected to be published in 1968. The book will consider certain methods for finding solutions to problems and games and their relationship to pattern recognition. The framework of elementary set theory is used to enable the relationship to be discussed in a common mathematical framework. The models of problems and two person games are specializations of a model that can be viewed as well as a general model of control systems. Unlike von Meumann's model of extended games, the present model is not a tree but an automaton or labeled directed graph. The treatment in this document suggests that the practical application of any solution strategy needs succinct descriptions of certain subsets of the state space of the control problem. The idea of description has been formalized, and the importance of description languages is discussed. Techniques for constructing solution strategies are presented, and the sets associated with their application are precisely defined
A MODEL OF CONCEPT LEARNING(
Book
)
1 edition published in 1968 in English and held by 3 WorldCat member libraries worldwide
A learning program designated CE, ConceptEPAM, is described that modifies EPAM through the introduction of a set membership relation. The effects of this extension are considered with respect to methods of storing concept descriptions in memory and methods of specifying learning and retrieval. The learning strategies consist of interactions between image elaboration and tree modification. Implementations of CE are considered for a concept learning task and a pair associate task. Applicability of CE to a geometry analogy task requiring relational concepts is discussed. The relationship between the learning of concepts of concepts and feature extraction is illustrated
1 edition published in 1968 in English and held by 3 WorldCat member libraries worldwide
A learning program designated CE, ConceptEPAM, is described that modifies EPAM through the introduction of a set membership relation. The effects of this extension are considered with respect to methods of storing concept descriptions in memory and methods of specifying learning and retrieval. The learning strategies consist of interactions between image elaboration and tree modification. Implementations of CE are considered for a concept learning task and a pair associate task. Applicability of CE to a geometry analogy task requiring relational concepts is discussed. The relationship between the learning of concepts of concepts and feature extraction is illustrated
Some results in a theory of problem solving (part 2)(
Book
)
1 edition published in 1967 in English and held by 1 WorldCat member library worldwide
The report considers the effect that specific language descriptions have on the efficiency of pattern recognition and problem solving methods. The efficiency of a language for the description of a given set is viewed in terms of the size, in some sense, of the shortest expression that denotes the set. Central to the discussion are questions of how the description of a concept should be stored to use the smallest amount of memory, and how the description should be stored and processed so that, given an object and a concept, an efficient determination can be made on containment of the object in the concept. The languages are essentially nonnumeric, enabling preprocessing to be described in the same format as that used for pattern description. Algorithms for learning and generalization are presented that use two of the languages. The property of succinctness is considered for the algorithms, and the effect of lack of succinctness on the statistical degree of confidence in the learned description is indicated. Analogies are made to descriptions in terms of discriminant functions and maximum likelihood ratios
1 edition published in 1967 in English and held by 1 WorldCat member library worldwide
The report considers the effect that specific language descriptions have on the efficiency of pattern recognition and problem solving methods. The efficiency of a language for the description of a given set is viewed in terms of the size, in some sense, of the shortest expression that denotes the set. Central to the discussion are questions of how the description of a concept should be stored to use the smallest amount of memory, and how the description should be stored and processed so that, given an object and a concept, an efficient determination can be made on containment of the object in the concept. The languages are essentially nonnumeric, enabling preprocessing to be described in the same format as that used for pattern description. Algorithms for learning and generalization are presented that use two of the languages. The property of succinctness is considered for the algorithms, and the effect of lack of succinctness on the statistical degree of confidence in the learned description is indicated. Analogies are made to descriptions in terms of discriminant functions and maximum likelihood ratios
STRUCTURAL PROBLEMS IN ORGANIZATION THEORY(
)
1 edition published in 1967 in English and held by 0 WorldCat member libraries worldwide
The paper suggests that Mathematical Systems Theory is appropriate as a tool for the development of analytical models of organizational situations. A simple decision making system, the executive committee of Bonini's simulation model of the firm, is described using the Mathematical Systems Theory approach and its implications for further research suggested
1 edition published in 1967 in English and held by 0 WorldCat member libraries worldwide
The paper suggests that Mathematical Systems Theory is appropriate as a tool for the development of analytical models of organizational situations. A simple decision making system, the executive committee of Bonini's simulation model of the firm, is described using the Mathematical Systems Theory approach and its implications for further research suggested
General Systems Theory and its mathematical foundation by
Mihajlo D Mesarovič(
)
1 edition published in 1967 in English and held by 0 WorldCat member libraries worldwide
Objective of this paper is to present the foundations for a mathematical theory of general systems, to discuss the limitations introduced by the use of the mathematical methods in the theory and finally to indicate the areas of application in engineering. Two points are emphasized: A need for the simplicity and precision in the definition of the basic concepts so that the description of the complex systems does not become unmanageable. An explicit recognition of the goalseeking approach as constituting an important aspect of the systems theory. In order to make the second point more specific a formalization of the notion of a goalseeking system is developed in the last section. The present article can be viewed as an updated version on an earlier paper since the basic problems considered and the viewpoints adopted here are the same as in (1)
1 edition published in 1967 in English and held by 0 WorldCat member libraries worldwide
Objective of this paper is to present the foundations for a mathematical theory of general systems, to discuss the limitations introduced by the use of the mathematical methods in the theory and finally to indicate the areas of application in engineering. Two points are emphasized: A need for the simplicity and precision in the definition of the basic concepts so that the description of the complex systems does not become unmanageable. An explicit recognition of the goalseeking approach as constituting an important aspect of the systems theory. In order to make the second point more specific a formalization of the notion of a goalseeking system is developed in the last section. The present article can be viewed as an updated version on an earlier paper since the basic problems considered and the viewpoints adopted here are the same as in (1)
AN AXIOMATIC THEORY OF GENERAL SYSTEMS(
)
1 edition published in 1967 in English and held by 0 WorldCat member libraries worldwide
The paper presents a formalization of the principal concepts of the block diagram approach in systems theory using set theory. The development is axiomatic. Starting from Mesarovic's notion of a general system as an nary relation, (i) the concept of time is introduced (ii) multivariable inputoutput systems are formalized and (iii) the evolution of such systems in time is studied both with and without the property of nonanticipation. It is demonstrated in the latter case that the concept of state naturally arises
1 edition published in 1967 in English and held by 0 WorldCat member libraries worldwide
The paper presents a formalization of the principal concepts of the block diagram approach in systems theory using set theory. The development is axiomatic. Starting from Mesarovic's notion of a general system as an nary relation, (i) the concept of time is introduced (ii) multivariable inputoutput systems are formalized and (iii) the evolution of such systems in time is studied both with and without the property of nonanticipation. It is demonstrated in the latter case that the concept of state naturally arises
Audience Level
0 

1  
Kids  General  Special 
Related Identities
Languages