Showing papers in "Kybernetes in 1974"
TL;DR: In this paper, a number of problems in engineering and in the sciences may be formulated as involving a search for the extremal point of some multivariable utility function f and the Bayes method may be used for achieving this aim.
Abstract: A number of problems in engineering and in the sciences may be formulated as involving a search for the extremal point of some multivariable utility function f. The Bayes method may be used for achieving this aim. This method has recently been applied to some problems for planning “extremal” experiments in chemistry and in agrophysics, and for the study of random processes and other fields.
18 citations
TL;DR: The fuzzy system approach is presented as a basis for the design of systems far superior in artificial intelligence to those the authors can conceive today.
Abstract: Many concepts of problem solving theory are better understood in an abstract algebraic framework which also applies in automata theory Because many systems of practical interest fall outside the scope of linear theory, it is desirable to enlarge as much as possible the class of systems for which a complete structure theory is available The fuzzy system approach is presented as a basis for the design of systems far superior in artificial intelligence to those we can conceive today The concepts of controllability, observability and minimality are developed, and conditions for the realization of an input‐output map by such a system are given Several problems, all directly or indirectly related to fuzzification, arise in considering this broader class of systems
11 citations
TL;DR: The general principles of GCST construction on the basis of an artificial intelligence program system are formulated and the deductive conclusion of this approach is formulated.
Abstract: A general theory of conceptual systems (GCST) is developed, in which the concept of systems is introduced not a priori or theoretically, but by means of a rigorous procedure, supported by experimental knowledge of these or other system realization forms (so‐called “realization” and “trajectories”) This is the stage of an inductive construction of computable concepts, ie “concepts” “Concept” is presented in the form of a function of discrete variables, one part of which is known (essential variables), while the other part is independent (non‐essential variables) The presence of “concept” allows one to construct new, not yet realized “trajectories” This is the stage of the deductive conclusion The general principles of GCST construction on the basis of an artificial intelligence program system are formulated This approach excludes widespread methods of a priori construction of system theories (eg in the “theory of usefulness”, the “study of operations”)
8 citations
TL;DR: The placement of each class of self regulating systems on the dimensional scale is a factor which determines the type of forces being responsible for the integration of the structural elements of the system.
Abstract: The placement of each class of self regulating systems on the dimensional scale is a factor which determines the following : type of forces being responsible for the integration of the structural elements of the system; types of channels inside the negative feedback that supports the equilibrium of the internal system; degrees of motion freedom of structural elements inside biosystems can be higher than those of non‐condensed systems; existence of energy transformers (mitochondria) in biosystems and their absence in natural abiotic systems; very high number of specific submodels of the B‐system (living systems).
4 citations
TL;DR: In this article, it was shown that the winner's set has to be a first category set in the sense of Baire or an ideal, but in any case a kind of small set.
Abstract: The theory of pursuit games is obviously fragmentary at present. We know that general determinability of such games is incompatible with analysis, based on the principle of time continuity; but we also witness some reasonably successful probing on a smaller scale. The problem is one of existence of winning strategies for quite general sets and spaces. It will be shown here that in one case, where multivalued strategies are used, such strategies must necessarily be subclasses of Polish spaces and in the other, the monovalued case, the loser's set either has to be a first category set in the sense of Baire or an ideal, but in any case a kind of small set. This paper is meant to provide a common topological basis for the appreciation of more recent results.
3 citations
TL;DR: The paper delineates the operational procedure by which simulation models can be well‐written, yet, despite their complexity, subjected to the scrutiny of the entire scientific community in order that they be deemed credible mimics of the complex systems that they describe.
Abstract: The systemic sciences, be they politico‐socio‐econometric, medico‐systemic, psycho‐neurological, or ecologico‐environmental, must be founded on a computer science that permits not only the expeditious and conscientious modelling of collections of natural phenomena, but also a methodology which ensures that computerized simulation models are stringently verified and assiduously validated by both their authors and their critics. The paper delineates the operational procedure by which simulation models can be well‐written, yet, despite their complexity, subjected to the scrutiny of the entire scientific community in order that they be deemed credible mimics of the complex systems that they describe. The important aspects and evolutionary development of computational linguistics are placed in the context of providing ad hoc simulation languages especially amenable to the systemic scientist. In this context, the role, and value of the use of, the telecommunications technology to the verification and validation of the computerized models of the systemic scientists are delineated.
3 citations
TL;DR: An algorithm is presented for obtaining a suboptimum covering with considerable efficiency in computation and overall data manipulation for improved storage procedures for route generation for demand actuated systems.
Abstract: The use of improved storage procedures for route generation for demand actuated systems is necessary for practical implementation of many routing systems. Neighborhood Storage is a method of storing the system information which requires a covering to be generated for a number of sets of points which are generated by the method. The set covering problem is important to the overall practical implementation of the method. The method requires M coverings to be generated for each application. Thus, computational efficiency is of considerable importance in obtaining the required coverings. The problem is defined and formulated as a set covering problem. Solutions are carried out for a number of examples and the results for the optimum covering are reported. An algorithm is then presented for obtaining a suboptimum covering with considerable efficiency in computation and overall data manipulation. The example results are also included. The algorithm presented is applicable to any (V;A,B) modeled in R2.
3 citations
TL;DR: An identification method is described which allows the approximation of experimental observations by means of a phenomenalistic model and is theoretically based on system theory and adapted to the needs of behavioural science.
Abstract: An identification method is described which allows the approximation of experimental observations by means of a phenomenalistic model. The method is theoretically based on system theory and is adapted to the needs of behavioural science. Special emphasis will be laid on a system representation, which is transferable to a large group of dynamic systems as well as on an exact formulation of the assumptions connected with the proposed method. A short summary of results determined by a behaviour analysis in the field of social psychology will give a practical view of the possibilities and limits of the described identification method.
2 citations
TL;DR: General systems theory, a metadiscipline created specifically for the purpose of integrating scientific research and theories, is a highly qualified instrument for promoting the required science‐based conceptual synthesis.
Abstract: The conceptual synthesis of the accepted bodies of knowledge in a culture provides a sense of meaning in existence, a viable image of the future, and individual and collective motivations. In our age, the dominant bodies of knowledge are fragmented and, although they are more accurate than ever before in limited domains, they fail to guide the imagination and inspire purposive action. To rectify this situation we need to develop a coherent and explicit conceptual synthesis that is based on science but extends beyond the current range of validated scientific theories, overcoming the noxious separation of the factual and the moral, the empirical and the mystical, the sensate and the affective. General systems theory, a metadiscipline created specifically for the purpose of integrating scientific research and theories, is a highly qualified instrument for promoting the required science‐based conceptual synthesis. Efforts in this direction are aided by the intrinsic tendency within science to correct for overspecialization and fragmentation through a search for integrative general theories, and by the rising perception of societal need for integrated bodies of knowledge, capable of coping with the increasing complexity of contemporary problems.
2 citations
TL;DR: The ideas of three authors who have best expressed this new view of man, Arthur Koestler, Ervin Laszlo and William Powers, are summarized and compared and the conclusion is reached that, despite differences in detail, they articulate remarkably consistent theories of the nature of man.
Abstract: In recent years, a new view of man has begun to emerge. This view, inspired by the concepts of cybernetics, holds that man's behavior and experience can be accounted for by feedback‐control processes and that these processes are hierarchically organized. In this paper, the ideas of three authors who have best expressed this new view, Arthur Koestler, Ervin Laszlo and William Powers, are summarized and compared. The conclusion is reached that, despite differences in detail, the three authors articulate remarkably consistent theories of the nature of man.
2 citations
TL;DR: The emphasis on transportation for urban, suburban and interstate systems has brought about a need for reconsidering the types of models which are used for such systems, and a model to be used for the storage of the connection and/or cost information of the system is developed.
Abstract: The emphasis on transportation for urban, suburban and interstate systems has brought about a need for reconsidering the types of models which are used for such systems. Two primary problems appear to be common in most large‐scale applications involving the amount of data and the time required to use the model as part of a real‐time system. The systems considered are traffic systems which can be classically modeled using vertices and edges to form a static network over which a vehicle or vehicles are to be routed. The problem that is solved is one of developing a model to be used for the storage of the connection and/or cost information of the system.
TL;DR: An axiomatic‐like theoretical skeleton for neurocybernetic and psychocybernetics in the form of eight theses is proposed, which can be considered as the essential aspects of the formal framework needed for the actual intepretation and the future development of knowledge in the field of brain research.
Abstract: Neurological sciences, cybernetics and general system theory achieved in the last decade enough progress to permit the establishment of a satisfactory theory of the functioning of the nervous system. We propose an axiomatic‐like theoretical skeleton for neurocybernetics and psychocybernetics in the form of eight theses. These theses can be considered as the essential aspects of the formal framework needed for the actual intepretation and the future development of our knowledge in the field of brain research.
TL;DR: As in the author's earlier papers, the model consists of a diffuse neuronal net, where simultaneous stimuli cause correlations between the columns in the matrix of synaptic weights resulting in a sort of statistical mapping of the outer environment.
Abstract: As in the author's earlier papers, the model consists of a diffuse neuronal net, where simultaneous stimuli cause correlations between the columns in the matrix of synaptic weights resulting in a sort of statistical mapping of the outer environment. However, the present version is endowed with two new features. Firstly, instead of the deterministic relation between the input signals and the output signal of neurons, only a probabilistic dependence is assumed which leads to the occurrence of spontaneous activity, even in the absence of any input signals. Secondly, a simple feedback is provided which adds up the signals from the associative layer—properly delayed—to the actual input. In the new model, the momentary state of memory changes continually, the resulting sequence of signals being chaotic in an “inexperienced” system. In a system with a fair amount of associations derived from the observation of the environment and interaction with it the spontaneous sequences are built up predominantly from mater...
TL;DR: Plastic change is introduced and discussed as the property of the brain cell that is responsible for the self‐organizing capabilities of neural nets.
Abstract: Plastic change is introduced and discussed as the property of the brain cell that is responsible for the self‐organizing capabilities of neural nets. Three models of this phenomenon are described. The models are of increasing complexity, and the reasons for the three different models are given. The emergence of association as a property of a plastic neuron is illustrated.
TL;DR: It is argued that structures, which are integrated in a well‐defined system, have their own quantitatively variable but by no means random characteristics.
Abstract: The fable of the monkey, which by sheer chance recreates a masterpiece of literature, is discussed in general terms. It is demonstrated that the general properties of structural characteristics can be derived directly from the study of interacting structures. Characteristics are indivisible entities defined in relation to test objects; the borderlines are not accurately definable. It is argued that structures, which are integrated in a well‐defined system, have their own quantitatively variable but by no means random characteristics. It is concluded that investigations of properties of an object, which neglect structural interactions and relationships, may lead to difficulties in defining its characteristics.
TL;DR: This paper is concerned with data sequences and the trend of the data function in terms of its significant slopes is analyzed, and the outcome is a meander‐like step function.
Abstract: This paper is concerned with data sequences. The information parameter to be generally utilized for information retrieval in this category of data arrays is the trend of the data function in terms of its significant slopes, and the outcome of this type of trend analysis is a meander‐like step function. Fluctuations of the data sequence around its derived trend function have to be analyzed with regard to the given error corridor and the selected bandwidth of frequencies, or the sampling time of the data. This feature eliminates noise from the relevant data. Examples are given.
TL;DR: Two effective algorithms are given for optimizing power systems schedules based on the simplex method, which shows rapid convergence of the iterative processes and a relatively brief calculation time at each iterative step lead to a high efficiency of the procedure.
Abstract: In this paper two effective algorithms are given for optimizing power systems schedules. These algorithms are based on the simplex method. Rapid convergence of the iterative processes, on which these algorithms are based, and a relatively brief calculation time at each iterative step lead to a high efficiency of the procedure for optimizing the schedules.
TL;DR: In this article, a partial differential equation u″ = r1 · Cm · u + r1gm · u for subthreshold changes of the deviation of the membrane potential from the resting value is presented.
Abstract: Line theory and the description of phenomena in subthreshold stimulated nerve fibres have many common features. This paper offers accurate formulations of these relations. It starts with the partial differential equation u″ = r1 · Cm · u + r1gm · u for subthreshold changes of the deviation of the membrane potential from the resting value. For sinusoidal stimulation the characteristic quantities describing the subthreshold behaviour of a nerve fibre are derived from this equation. For step stimulation a (the attenuation constant) becomes independent of frequency and is a measure of the spatial decay of the membrane voltage changes, while transients are characterized by the time constant of the nerve fibre. The investigation of biological processes in neuron systems with the help of electro‐technical concepts may be included in the realm of cybernetic methods.
TL;DR: The bibliographical survey given in this paper aims at showing the analogies adopted by authoritative workers in order to obtain a better understanding of “how and what the authors see”.
Abstract: Models describe complex systems or events in simple terms. A better understanding is achieved by replacing intricate and complex systems with simpler and more familiar analogies. This paper deals with the complex visual system. The bibliographical survey given in this paper aims at showing the analogies adopted by authoritative workers in order to obtain a better understanding of “how and what we see”.
TL;DR: Using optical contrast as a general characteristic it is shown how objects are identified as such before their structure is analysed by a general approach to the problem.
Abstract: A general approach to the problem is suggested. Using optical contrast as a general characteristic it is shown how objects are identified as such before their structure is analysed. Perception is regarded as a preprocessing phase for pattern recognition, in which essential information is abstracted from an optical image. A focusing device enables the suggested system to analyse the shape of objects in detail.
TL;DR: In this paper, a generalization of the theory of Garden of Eden configurations in tessellation automata is presented, and necessary and sufficient conditions for the existence of higher-degree configurations of higher degree and of degree 1 are established.
Abstract: This paper contains a generalization of the existing theory of Garden of Eden configurations in tessellation automata. We consider spaces of at most two dimensions but with transition functions having arbitrarily large neighborhoods. A configuration c is said to be Garden of Eden of degree n just in case there is no configuration from which c can arise in n time steps; c is Garden of Eden of minimal degree n just in case there is no smaller m such that c is Garden of Eden of degree m. Necessary and sufficient conditions for the existence of Garden of Eden configurations of higher degree (and of degree 1) are established. Results are obtained relating decision procedures for Garden of Eden configurations of degree one to decision procedures for Garden of Eden configurations of higher degree.
TL;DR: A survey and classification of a number of factors that relate directly to cost in the computer engineering design of arithmetic units and some recent logic calculations by the author on gate versus input counts and reduction of complexity in the case of ternary logic are included.
Abstract: This paper is a survey and classification of a number of factors that relate directly to cost in the computer engineering design of arithmetic units The general factors considered are inputs, gates, thresholds, algebras, inputs versus gates, values, reliability, implementability, and complexity The paper contains some recent logic calculations by the author on gate versus input counts and reduction of complexity in the case of ternary logic
TL;DR: In this paper, a new correlation coefficient ρX1 for pairs of discrete-valued lung function parameters X1, X2 based on the expected maximal probability of predicting an Xj value given any Xi value was proposed.
Abstract: In this paper we exploit a new correlation coefficient ρX1 for pairs of discrete‐valued lung function parameters X1, X2 based on the expected maximal probability of predicting an Xj value given any Xi value. Then, for X1, X2 representing two different lung function parameters one can use ρX1, ρX2 in order to measure the strength of predicting Xi from Xj. E(max.g(y/X)) is a reasonable replacement for the information entropy function when dealing with discrete‐valued random variables X, Y. (In the Appendix and Program MX = X1 and KY = X2.)
TL;DR: Two optimization criteria are presented, which based on a schema of referential probabilities enable the construction of a vocabulary of patterns, or basic morphological units, which leads to various numerical estimates.
Abstract: This paper deals with research of patterns and structures in a sequence of data with a finite number of states. After preliminary estimates, two optimization criteria are presented, which based on a schema of referential probabilities enable the construction of a vocabulary of patterns, or basic morphological units. The determination of structures, which may link these patterns is subsequently discussed, first from a morphological viewpoint, then from a generative viewpoint. Morphological structures may be constructed from classical schema of Markov chains or from graph theory; the identification of generative structures is based on the definition of a set of normed transformations on the vocabulary, which leads to various numerical estimates.
TL;DR: A possibility of applying an adaptive learning procedure for checking and diagnosing electronic circuits is discussed, the peculiarities in the configuration of their generalized characteristics being used as information parameters.
Abstract: A possibility of applying an adaptive learning procedure for checking and diagnosing electronic circuits is discussed, the peculiarities in the configuration of their generalized characteristics (amplitude, frequency, time) being used as information parameters. The method considered is well‐established and the basic principles of the algorithm for its machine realization are given.
TL;DR: The classical idea of model, as a system that can anticipate, in a finite time interval, the full behavior of a real system, is shown to lead to serious contradictions, and an alternate formalism is proposed, in which only general features of the real system can be projected.
Abstract: The classical idea of model, as a system that can anticipate, in a finite time interval, the full behavior of a real system, is shown to lead to serious contradictions. An alternate formalism is proposed, in which only general features of the real system can be projected. From this new formalism, optimal experiments on the real system are derived. A discussion of the problem of uniqueness in modelling theory is included. As an area in which the classical idea of model is applicable without contradictions, anticipatory systems are analyzed. Some general features of these systems are considered. Finally, the projective system of an anticipatory system is fully described in terms of the state system.
TL;DR: Problems of perceiving forms of visual images in the peripheral part of the analyser are considered and formal definitions of receptive fields are introduced.
Abstract: Problems of perceiving forms of visual images in the peripheral part of the analyser are considered in this paper. Formal definitions of receptive fields are introduced. The work on receptive fields in their different forms is analysed. Receptive fields are considered as basic neuron structural units. The analogy between receptive fields and frequency‐stripe filters is described. Forms and functions of receptive fields are also considered.
TL;DR: In this paper a method is proposed for the determination of the correctable and detectable errors number, which ensures an optimum compromise between the incorrect decoding probability and the transmission rate.
Abstract: In this paper a method is proposed for the determination of the correctable and detectable errors number, which ensures an optimum compromise between the incorrect decoding probability and the transmission rate. The method is based on the fact that by decreasing the correctable errors number and increasing the detectable errors number, both the incorrect decoding probability and transmission rate are reduced. Among the types of problems which can be solved by this method the most interesting is that of adapting the decoder to the transmission channel. In this paper the binary symmetrical channel is considered, but for other types of channels similar results can also be obtained.