bluuebunny/crossref_metadata_2025 huggingface dataset:
DEVELOPING A COMPUTER ECG RESEARCH STATION
Authors: SCHEINOK P.A. , THUM K.W. , REICH M.B. , KRAZESKY A. , DREIFUS L.S.
Published: February 2008

The hardware, software and systems components of a Clinical Research ECG Station using an IBM‐1800 computer under the Multi‐Programming Executive System (MPX) is described. The twelve classic leads and the three Frank leads of the patient‐acquired ECG are sent in analog form over telephone lines via Marquette Electronics' carts and receiving interface, which modulate and demodulate the signal for computer acquisition, subsequent analog to digital conversion, and analysis. The Smith‐Mayo program (on the Frank leads) initially used, has been augmented by a Hahnemann‐developed, twelve‐lead analysis program to improve the interpretive portion of the program in the areas of LVH, Infarctious, Bundle Blocks, etc. A truly innovative portion of the system is the creation of a computer‐driven microfilm system which produces aperture cards. These contain all the graphical input on microfilm, plus graphs of the two‐dimensional vector curves and the appropriate patient identification information. Archive tapes of the digitized ECG are kept as a data repository for (1) the constant reworking of the analysis program, (2) the development of proper comparison programs, and (3) the research potential of using existing Probabilistic‐Statistical Differential Diagnosis methods to quest the nature of what symptomatic information is necessary to optimize the diagnostic process in the ECG area.
ANALYSIS OF A GENERAL LOGICAL DISCOURSE FOR MAN‐MACHINE INTERACTION — PART I
Authors: KOENIG ELDO C. , SCHULTZ JAMES V.
Published: February 2008

A mathematical analysis is made of a general logical discourse for the purpose of achieving a transfer of knowledge for any logical discourse from computer to man. There results an algorithm for structuring any logical discourse and a basis for the design of plans of interaction. In Part I, an analysis is made of a general logical discourse for establishing the sets and relations for the knowledge statements, for establishing the primitives that define a prerequisite graph, and for establishing the normal sequences for the principal statements. The use of the primitives is demonstrated in the construction of a prerequisite graph for an example logical discourse. In Part II (appearing in a subsequent issue) the analysis is continued for establishing other sequences, the primitives for a sequence graph, various plans for interaction, and the application to a common discourse.
A NEW DECODING ALGORITHM FOR ERROR CORRECTING AND DETECTING CODES
Authors: SPÂNU JULIA
Published: February 2008

A new decoding algorithm is deduced by dividing the set of all received words in non‐disjoint fuzzy sets instead of disjoint ordinary sets. This algorithm leads to quite simple decoders as regards the technical complexity, by choosing a convenient variation law for the received word's membership function. Moreover, this algorithm allows the decoder to adapt to the channel‐noise statistics in a certain sense. The algorithm may be used for both block and convolutional codes, but in this paper it is only applied to block codes, the following notations being used: k—information symbols number, n—word lengths, vi—code word, wj—received word.
NEUROBIONICS: PROBLEMS AND RESULTS
Authors: IVANOV‐MUROMSKY K.A. , MEITUS V.Yu. , ZASLAVSKY S.Ja. , PARAMONOV Yu.V.
Published: February 2008

Basic problems of the new branch of bionics—neurobionics—are discussed in a comprehensive form. Classes of problems are treated which bear a relation to the study of neurons and neuron ensembles, to simulation of some brain functions, to construction of neuroelectronic and neurotechnical systems, as well as to the automatic processing of experimental data, in particular, to deciphering of EEGs. The current situation is briefly analysed in solving the above problems. Attention is paid to developments accomplished in the Institute of Cybernetics, A.S. Ukr. SSR., at Kiev.
ANALYSIS OF A GENERAL LOGICAL DISCOURSE FOR MAN‐MACHINE INTERACTION—PART II
Authors: KOENIG ELDO C. , SCHULTZ JAMES V.
Published: February 2008

Part I, presented in the preceding issue of Kybernetes, concluded with the analysis for establishing the normal sequences for the principal statements of a general logical discourse. Part II continues with an analyses for establishing the different types of sequences, the normal sequences for the secondary statements, the review sequences, and the repeat sequences. An analysis is presented for establishing the primitives that define a sequence graph for a general logical discourse, and the use of the primitives is demonstrated in the construction of a sequence graph for an example logical discourse. Finally, there are presented various plans for interaction between man and machine for the transfer of knowledge of a logical discourse and the application of the algorithm to the structuring of knowledge for a common discourse.
A RESONANCE MODEL OF LOGIC
Authors: ROY WALLACE MELVYN
Published: February 2008

In this paper we construct a representation of 2‐valued logic, not in terms of sets as in Boolean algebra, but in terms of ordinary numerical algebra. When applied as a physical model of how the brain might actually effect logical computations, it provides a picture of a system which is dynamic and continuous, rather than the usual digital picture arising from the on/off behaviour of the neurons in the brain. A discreteness does appear within the formalism, but of the kind which represents a physical system possessing natural modes of oscillation. P. H. Greene has already suggested resonant neural activity as a model for certain kinds of behaviour, and the results of this paper would tend to support his hypothesis.
CYBERNETICS TODAY AND TOMORROW:
Authors: MUSÈS C.
Published: February 2008

This article deals with the need of more sophisticated techniques to handle the cybernetics involved in psychosocial processes. The basic influence of destructive positive human feedback, as distinguished from salutary natural negative feedback in environmental interactions, is noted. Several relevant hypernumber arithmetics are sketched, and the importance of the power orbit concept of a hypernumber unit is introduced.
MEASURING THE STRENGTH OF INTERVARIABLE RELATIONS
Authors: CONANT ROGER C.
Published: February 2008

The measures of information theory, suitably modified, can be used as measures of the strength of intervariable relations. This paper defines the normalized transmission between two variables; it is a measure of the degree to which knowledge of one variable is helpful in guessing the value of the other, and it can be applied to static or dynamic relations. The usefulness of the measure is illustrated by an example consisting of seven weather variables, where it is shown that the normalized transmission leads to a natural partition of the system into subsystems, within which the intervariable relations are strong and between which they are weak. Normalized transmission is also compared with other measures of relatedness.
SOME INFORMATION THEORY APPLICATION TO THE PHYSIOLOGY OF NERVOUS CELLS
Authors: KOGAN A.B. , CHORAJAN O.G.
Published: February 2008

By considering the nervous system as a type of communication system with reliable transmission of signals an attempt is made to use in neurophysiology the basic information theory theses developed by Shannon for technical communication systems. Some results of different information indices calculations (those of capacity, redundancy, degree of reliability and so on) of the pulses incorporated in their functional community (neuron ensembles) are presented. A comparison is made between peripheral and central neurons information indices. The leading role of spike trains redundancy is stressed in the mechanisms of securing a reliable signals transmission in the nervous system. The relation between redundancy and randomization process of neuron spike trains structures is shown.
ENTROPY IN INDUSTRIAL CYBERNETIC SYSTEMS
Authors: BÎRLEA S.
Published: February 2008

This paper considers the part played by entropy in systems pertaining to discontinuous flow industries. The main principle is that parts or the whole of the economy can be considered to be cybernetic systems. Various assumptions are then made concerning the relationships between industrial cybernetic systems and entropy. It is thus found that in discontinuous flow industries the main objective is a reduction in entropy engendered by the relations between the component systems. The author notes the close connection between entropy and management decisions, and draws some conclusions about optimizing industrial systems.
AUTOMATED ANALOGUE PATCHING USING LIST PROCESSING AND A HYBRID INTERFACE
Authors: RUSSELL D.W.
Published: February 2008

This paper describes introductory studies in self patching analogue computer systems. The problem equations are processed digitally and a connection word generated. This is then interrogated for analogue significance by a hybrid interface. The object of the project is to investigate analogue multiprocessing and parallelism at low cost.
ON THE QUANTITATIVE FORMULATION OF THE HUMAN REWARD FUNCTION
Authors: THEODORIDIS GEORGE C.
Published: February 2008

An information‐like formulation of the human reward function is shown to be in qualitative agreement with some prominent features of human behavior. Individual events are regarded as “symbols” in a communication theory sense, and their reward for a person depends on their frequency of occurrence in his environment.
A PROPOSED MULTI‐VALUED EXTENSION TO ALGOL 68
Authors: RINE D.C.
Published: February 2008

Current digital hardware technology has been generally based upon the binary, base 2, number system; but, recent advances in the designing of base 3 circuitry indicate that there may be a future wide choice for the hardware user in multi‐valued circuitry. We have now reached the point in computer hardware, given the cost of wiring, where it certainly may be more economical to construct a base 3 computer as an alternative to a base 2 computer; moreover, many k‐valued arithmetic operations can be executed quicker and more efficiently. Reference in this connection is made to ALGOL‐68.
ON THE ANALYSIS OF SYSTEMS CONTAINING NON‐QUANTIFIABLE ELEMENTS
Authors: KATZNER D.W.
Published: February 2008

There are many important issues arising in the non‐physical sciences which require the investigation of phenomena not, at present, capable of measurement. This paper develops analytical techniques for handling them. Static, dynamic and choice models are considered.
ON THE NOTION OF RELEVANCE IN INFORMATION RETRIEVAL
Authors: NEGOITA C.V.
Published: February 2008

The paper presents a new point of view about the “relevance” concept. The logic of information retrieval is analysed (two‐valued, many‐valued and infinite‐valued logic) and the truth‐value is interpreted as the relevance value. The logical system which seems to be most appropriate to describe the process of information retrieval is the continuous logic suggested by McNoughton. In this case the answer of the information retrieval system is interpreted as a fuzzy set.
ON THE QUANTITATIVE FORMULATION OF THE HUMAN REWARD FUNCTION
Authors: THEODORIDIS GEORGE C.
Published: February 2008

The mathematical expression of the reward function introduced in Paper I is used in evaluating the dependence of reward on the variety of available experiences, as well as in analyzing the rationale of certain actions aimed at indirect reward maximization. A person can affect the reward content of events by influencing his own estimate of their frequency of occurrence. Hostile acts without any expected direct benefit, or interest in other people's misfortunes can be understood as aiming at such indirect reward enhancement.
RESTORATION OF DATA UNDER CONDITIONS OF INCOMPLETE SAMPLES
Authors: VASILYEV V.I. , GALITSKY V.K. , TODUA N.N.
Published: February 2008

In studying adaptive or self‐organizing cybernetic systems problems arise of choosing an adequate model of the object and truth estimation of some initial data. In mathematical formulation many of these problems are reduced to the estimation of multidimensional system parameters under conditions of incomplete data. A problem is considered of estimation of multidimensional system parameters under conditions of a short sample with omissions. In the case when the data sample can be described by multidimensional normal law of a special type the method of the stated problem solution is suggested and grounded.
HEURISTIC PERSONALITY MODELS
Authors: AMOSOV N.M. , BELOV V.M. , GALENKO D.N. , OLSHANIKOV V.S.
Published: February 2008

There exist a number of urgent problems in psychotherapy, social psychology and sociology which can be solved by means of special methods that would enable one to predict the probable behaviour of man in certain situations. This paper discusses one of these methods and gives a concise description of two heuristic personality models in the form of computer programs.
KNOWLEDGE ENGINEERING
Authors: MICHIE DONALD
Published: February 2008

Three themes in complex information processing are revealing themselves to be mutually interconnected: problem‐solving mechanisms, automatic program writing, and the organization of large bodies of knowledge in machine memory. Interconnections are discussed in the contexts of chess and of automatic assembly. Reference is also made to automated chemistry systems.
SOME ASPECTS OF VISUAL PATTERN RECOGNITION
Authors: SCHUH J.F.
Published: February 2008

This paper is concerned with the detection of “features” of visual patterns, in particular with a view to the construction of a reading automaton. The features can be divided into micro‐features and macro‐features. It is much more difficult to detect a macro‐feature than a micro‐feature of a pattern. For the detection of at least a large class of macro‐features interative processes seem to be the most appropriate, since by these processes the detection of a macro‐feature is reduced to the repeated detection of a micro‐feature, while further a given micro‐feature can be displaced, by such a process, over virtually the whole screen on which the image is projected. Two examples of such processes are discussed.
CYBERNETIC REFORM OF HIGHER EDUCATION
Authors: HELVEY T.C.
Published: February 2008

Education in general, and higher education in particular, are in a state of instability, because their previous homeostasis is perturbed by several parameters. These indicate that the subsystem “education” does not fit into the operational framework of the larger system “community dynamics”. It is therefore suggested that a cybernetic approach to pedagogy can reform the present structure of higher education.
GENERAL SYSTEMS THEORY AND THE COMING CONCEPTUAL SYNTHESIS
Authors: LASZLO ERVIN
Published: February 2008

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.
AN ADAPTIVE LEARNING PROCEDURE FOR THE DIAGNOSTIC CLASSIFICATION OF ELECTRONIC CIRCUITS BASED ON THEIR GENERALIZED CHARACTERISTICS
Authors: MARINOV J.P.
Published: February 2008

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.
THE VISUAL SYSTEM SEEN THROUGH ITS MODELS
Authors: RONCHI L.R.
Published: February 2008

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”.
“THE LITERARY MONKEYS” A VIEWPOINT (PATTERNS AND SYSTEMS)
Authors: ZELLER C.
Published: February 2008

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.
RECEPTIVE FIELDS AND SHAPE PERCEPTION
Authors: AGABABYAN K.G. , AMOSOV N.M.
Published: February 2008

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.
APPLICATION OF THE LINE THEORY TO TRANSMEMBRANE POTENTIAL CHANGES IN NERVE FIBRES
Authors: ALTMANN A.J.‐P.
Published: February 2008

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.
AN EFFICIENT DATA MODEL FOR LARGE SCALE TRANSPORTATION SYSTEMS
Authors: HOELZEMAN RONALD G. , MICKLE MARLIN H.
Published: February 2008

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.
GENERALIZED MODEL OF THE LIVING ORGANISM AND ITS CYBERNETIC FOUNDATIONS
Authors: BOGDANSKI C.A.
Published: February 2008

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).
SYSTEM IDENTIFICATION IN BEHAVIOURAL SCIENCE
Authors: HIRSIG RENÉ
Published: February 2008

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.
THE BAYES METHODS FOR SEEKING THE EXTREMAL POINT
Authors: MOCKUS J.
Published: February 2008

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.
A SYSTEM OF PATTERN PERCEPTION—A SUGGESTION
Authors: ZELLER C.
Published: February 2008

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.
FREE ASSOCIATIONS IN A STOCHASTIC MODEL OF MEMORY
Authors: DROZEN V.
Published: February 2008

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 materials supplied by the experience, and may be called “free associations”. These associations depend on the characteristics of the biological noise. Confronted with the question of problem solving procedures, the flow of associations can be visualized as a sort of random experimentation on the level of imaginative activity.
MEDICAL STATISTICS REGARDING COAL WORKERS' PNEUMOCONIOSIS
Authors: RINE D.
Published: February 2008

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.)
ALGORITHMS FOR OPTIMIZATION OF POWER SYSTEMS SCHEDULES BASED ON THE SIMPLEX METHOD
Authors: CHALY G.V. , ZLOTNIK S.G. , LAZEBNIK A.I. , SPIRIDONOVA G.V.
Published: February 2008

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.
HIERARCHICAL MAN: A COMPARISON OF THREE CYBERNETIC THEORIES
Authors: STALLINGS W.
Published: February 2008

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.
THE FUNDAMENTAL THESES OF NEURO‐ AND PSYCHOCYBERNETICS (NEUROCYBERNETICS)
Authors: BĂLĂCEANU C. , DONA G.
Published: February 2008

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.
A SET COVERING APPLICATION IN MINIMUM ROUTE GENERATION
Authors: WANG J.C. , MICKLE M.H. , HOELZEMAN R.G.
Published: February 2008

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.
CERTAIN TOPOLOGICAL POSTULATES IN THE THEORY OF PURSUIT AND EVASION
Authors: KAAZ M.A.
Published: February 2008

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.
DATA VERSUS INFORMATION: INFORMATION RETRIEVAL FROM DATA SEQUENCES
Authors: REISIG G.H.R.
Published: February 2008

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.
GENERAL COST FACTORS FOR MULTIPLE‐VALUED LOGIC DESIGN OF ARITHMETIC UNITS
Authors: RINE D.C.
Published: February 2008

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.
SOME PROBLEMS OF AUTOMATA CONSTRUCTION (A VIEWPOINT)
Authors: SCHUH‐MORENO J.F.
Published: February 2008

The functioning of computers is based on mathematical logic. Hence any substantial progress in computer construction must come from a brilliant idea in logic. This probably entails a large increase of the number of basic units and of their interconnections. This is, however, feasible in practice provided miniaturization could be much more developed than in existing machines, but this is not possible unless a new type of physics could be established, viz. the physics of highly inhomogeneous or asymmetric systems. A more advanced miniaturization probably entails a decrease of the reliability of the basic units. The use of large numbers of basic units of a relatively low reliability requires new systems of error and failure correction, which must circumvent the use of prohibitively large numbers of basic units, particularly since finding a faulty unit in a million or so in them is like looking for a needle in a haystack. The solution of these problems does not seem to be in sight.
A CHOREOGRAPHIC ROBOT VISION MODEL
Authors: DRISCOLL LEO C.
Published: February 2008

A prerequisite for automatic assembly by “factory‐intelligent” robots in the 1980s is the development of machine hand‐eye coordination systems. This paper presents a formal approach to choreographic robot vision systems to describe, command, and control a robot's complex manipulations via a set of basic sensory‐motor interactions. Hypothetical inference processes of choreographic vision are modeled by formalizing a plausible inference scheme of Polya and by introducing concepts of a context‐dependent relation theory. The resulting entailment/relational diagrams (eye‐hand data → choreographic properties → choreographic models) form a basis for choreographic robot vision.
AUTOMATA FOR AGRICULTURE—A DRIVERLESS TRACTOR SYSTEM
Authors: BROOKE D.W.I.
Published: February 2008

Agriculture is compared with other industries and the role of automata is discussed. The present requirements are for instrumentation and other operator aids to improve the performance of existing equipment, but improved energy management techniques including waste recycling will call for a greater use of automata. A case can also be made for operator elimination in some field operations and a completely automated driverless tractor system is described by way of an example.
ON TRACKING BEHAVIORS OF THE HUMAN OPERATOR IN PREVIEW CONTROL SYSTEMS
Authors: ITO K. , ITO M.
Published: February 2008

This paper considers the experimental results for tracking behaviors of human operators in preview control systems and, on the basis of the experimental results, proposes a model which can be viewed as the cascade connection of the convolution integral that processes the future input and the closed‐loop system modelled by the crossover model. The measured closed‐loop frequency characteristics and the analytical model demonstrate the following facts. 1) The human operator mainly improves the closed‐loop phase characteristics by using preview input information, while the closed‐loop amplitude characteristics are hardly improved. 2) The preview weighting function in processing the future input has a peak near 0.25 sec ahead and comes to very small values in the range beyond 0.5 sec ahead. 3) The future value beyond 0.5 sec ahead is of little value for improving the tracking characteristics when the controlled elements are K and Kc/s. But when the controlled element is Kc/s2, the required preview time is 0.75 sec.
TENSE IN FORMAL LANGUAGE SYNTAX AND CO‐OPERATING SEQUENTIAL PROCESSES
Authors: RINE D.
Published: February 2008

There are few places in the literature on formal language syntax where tense is efficiently treated as part of the syntactical structure. In both natural languages and programming languages, cybernetically speaking, one encounters the fundamental concept of “verb phrase”. For information processing the COBOL programmer can construct the extended general form of verb commands containing tense as follows:
DEVELOPMENT OF A COMPOSITE IDENTIFICATION AND CONTROL FUNCTIONAL FOR A MULTIVARIABLE ADAPTIVE SYSTEM
Authors: McCORKELL C. , SWANICK B.H.
Published: February 2008

A structurally constrained discrete state space model is employed as the basis in the development of an identification and control procedure. System excitation is conditioned in accordance with a restricted minimization of a composite cost functional embodying a compromise legitimizing simultaneous identification and control. Alternative scalar measures of the system identified parametric transition matrices are combined with a state quadratic control measure in the composite cost, and an investigation of the effect of a scalar weighting in the functional (offsetting identification with control) considered. Tabular and graphical results are presented covering the likely range of the proposed systems applicability.
PRELIMINARY NOTE ON THE CLASSIFICATION OF VECTORS WITH SOME UNKNOWN DESCRIPTORS
Authors: BATCHELOR B.G. , HAND D.J.
Published: February 2008

The problem of pattern classification based upon incomplete vectors was introduced in an earlier paper, where we discussed four possible methods of solution. Of these, only two appeared to be promising as a solution to the general problem. In one of them (a), we envisaged that a multi‐dimensional Monte‐Carlo integration would be needed, while the other procedure (b) required the use of a large store. In this paper, we show how the long integration may be avoided in procedure (a). This is feasible if we use one of a certain class of p.d.f. estimators. We also show that these p.d.f. estimators have certain desirable properties in Method (b).
A GENERAL SYSTEMS APPROACH TO PROCESS ANALYSIS AND SYSTEM DESIGN
Authors: MANTZ M.R.
Published: February 2008

The methodology is based on a combination of well known and well proven tools for development of multi‐aspect systems, such as
AUTOMATED ALGORITHM FINDING
Authors: JONES BUSH
Published: February 2008

The use of a computer to automatically generate original algorithms is discussed in this paper. The problems in the construction of a computer algorithm finder are discussed. An actual computer algorithm finder is described and demonstrated.
COINCIDENCE MAPPINGS: A GAME‐THEORETIC VIEW
Authors: KAAZ M.A.
Published: February 2008

Game‐theoretic studies1,2 have been extended and complemented by a coincidence theorem based on and closely related to the Lefschetz fixed‐point theory. It is shown (Theorem 4) that admissible Hausdorff‐spaces (e.g. Banach spaces) exhibit coincidences of pairs of maps associated with multi‐valued maps which have been introduced and discussed in previous papers in this Journal.1,2
THE PROPERTIES OF AN INTELLIGENT MACHINE
Authors: STUBBS D.F.
Published: February 2008

The hardware technology for an intelligent machine is available. We see no contraindication to the construction of the software of such a machine. This paper reviews and lists the functional properties of intelligent machines as seen by many authors, and attempts to formulate then in terms of basic computational methods and a program structure. It is suggested that an interchange between brain scientists and artificial intelligence workers could be more fruitful than before. The question of the validity of comparing brains and computers remains unsettled.
HELPING EACH OTHER TO HELP THE HELPLESS:
Authors: REVANS R.W.
Published: February 2008

This essay, published in two parts, describes coordination in the British domiciliary services for the mentally handicapped, as seen by families helped and by field workers helping. Criteria of need and judgments of effectiveness are those of patients and field workers. Bias is minimised by the experimental design since five independent professions and parents interact between seven different areas over a sample of 212 cases. Part I suggests why and how this autonomous or self‐study was made; Part II presents some findings and tells what was done about them.
ON THE STATE EQUATION OF FUZZY SYSTEMS
Authors: NEGOITA C.V. , STEFANESCU A.C.
Published: February 2008

This paper attempts to present the state equation for linear systems in a fuzzy form. A “categorical” approach is given, illustrating in a simple way how to generalize classical results.
REPRESENTATION BY SYMBOL SYSTEMS AS AN EXTENSION OF THE CONCEPT OF MEASUREMENT
Authors: FINKELSTEIN L.
Published: February 2008

The study of information is central to the science of Cybernetics. The communication and processing of information takes place, in general, by means of signals, which represent or describe (in other words symbolize) the entities to which the information relates. The present paper examines one of the foundation problems of Cybernetics: the principles of representing entities and the relations between them by systems of symbols. It treats these principles as extensions and generalizations of the fundamental concepts of measurement.
A CYBERNETIC MODEL OF STATES OF CONSCIOUSNESS
Authors: STALLINGS W.
Published: February 2008

In recent years, evidence has accumulated that there are four distinct states of consciousness under normal conditions; in addition to the three commonly experienced states of wakefulness, sleep, and dreaming, there is a fourth state achieved by various Eastern meditation techniques. A model of man is discussed that could account for these states. This model, 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. This paper first attempts to demonstrate that the existence of four distinct states of consciousness is consistent with a general cybernetic view of man. Then, a specific information‐flow model of the mind, developed by Powers, is introduced and it is shown that with some revision this model well accounts for the four states.
ON GAMES IN WHICH BOTH PLAYERS EITHER HAVE OR FAIL TO HAVE WINNING STRATEGIES
Authors: KAAZ M.A.
Published: February 2008

The result of a true strategy applied by a (perfectly informed) player in positional games represents a sequence of consecutive choices from a given set. It is, therefore, subject to the axiom of choice or some equivalent selection principle. Our attention in this study is focused on the existence of finite sequences associated with winning strategies. It will be shown in the sequel that the use of the axiom of choice may lead to sets devoid of winning strategies, while the negation of this axiom produces winning strategies for both players. A modified axiom, the axiom of determination, is discussed which no longer admits such “paradoxes” in virtue of certain inherent restrictions.
ON THE GRAPHICAL ANALYSIS OF PDF ESTIMATORS FOR PATTERN RECOGNITION
Authors: BATCHELOR B.G. , HAND D.J.
Published: February 2008

The paper demonstrates that graphical methods offer some valuable features in the study of probability density function estimators. The design of experiments to augment our existing knowledge of such estimators is outlined. These experiments use artificial data, which is generated with known characteristics. The use of graphical methods in monitoring PDF performance, during work on real problems, is discussed. There is a brief discussion on the use of graphical displays in an interactive system and the paper concludes with a description of a readily comprehended display of classification results.
COMPETITION IN NATURE AND THE LOGNORMAL MODEL
Authors: PAPAGEORGIOU JOHN C.
Published: February 2008

The different applications of the lognormal model in describing the distribution of various populations from both the biophysical and socioeconomic spheres are reviewed. A discussion then follows of the underlying causal relationships which seem to govern the behavior of these populations. They seem to be, firstly, the existence of a large number of members in the population; and secondly, competition among the members for a common resource. Finally, the usefulness of the model as a general model describing such populations is discussed.
ARCHIVES FOR THE SYSTEMIC SCIENTIST
Authors: MIHRAM DANIELLE , ARTHUR MIHRAM G.
Published: February 2008

Accepting the proposition that computerized models are capable of addressing the complex, systemic problems which confound us, one is led to enquire whether an “International Library for Systemic Scientists” is needed, where could be housed retrievable recordings of any systemic scientist's computerized models. With such an archive, the credibility of each recorded model could be challenged and/or established via techniques which have classically been applied in the linguistic scrutiny and in the natural confirmation of printed scientific communications (models). This “International Archives” could then be accessed via telecommunications; computerized models could then be retrieved, scrutinized, and rectified expediently. This paper delineates techniques by which the proper control of the systemic scientist's communications (his computerized models) can be exercised. Perhaps then the inter‐disciplinary “boundaries,” which seem somehow to constrain the pursuit of our characteristically systemic difficulties, would tend to recede, since all systemic scientists would have access to all other systemic scientists' computerized models, much as we, as scientists, historically have had access to one another's models in the printed medium.
ABSTRACT PROGRAMMING
Authors: BRENNIG JAMES DEWI
Published: February 2008

Abstract programming attempts to extract the principles underlying problem solving and therefore approximate more nearly to a unified behaviour theory. A distinction is made between white matter theory and grey matter theory, both of which are outlined. The level of organization at the level of the neuron as found to be very high; the significance of this is discussed particularly in view of the consideration that the neurone must exist in the equivalent of a Skinner box since it is difficult to see how learning can be accomplished unless correct behaviour is rewarded at cellular level. The concepts of recursion and that of the structure of knowledge are an essential basis to the understanding of abstract programming; these are outlined in two appendices.
COMPUTATION GRAPHS
Authors: BAUER MICHAEL A.
Published: February 2008

The notion of a computation graph is introduced. A computation graph is a rooted, directed graph whose nodes are labelled by statements (instructions) to be executed. The motivation for developing computation graphs comes from a desire to represent programs by well‐defined, manipulable structures and to permit search (especially backtracking) to be a natural part of the execution of such programs. This initial work considers very simple computation graphs where the only statements that can be executed are assignment statements and tests. Procedure calls, parameter passing, etc. are not considered. The execution rule for computation graphs is based upon search procedures. The computation rule presented permits a computation graph to be executed depth first, breadth first or using a combination of both. This is done by defining functions, which are arguments to the computation rule, to control the traversal of the graph. The use of the rule is illustrated by describing functions to permit the rule to execute the same graph depth first and breadth first.
ACQUISITION OF KNOWLEDGE WITHOUT TRANSCENDENTAL ASSISTANCE: AN EXTENDED PIAGETIAN APPROACH
Authors: TRAILL ROBERT R.
Published: February 2008

Piaget's basic objective is seen as an attempt to explain how the individual and his evolutionary forbears can collectively gain practical mental‐models of the “real world”—starting ultimately from nothing, and without independent assistance. This paper firstly sets out to clarify Piaget's rather abstract views on this matter by postulating a more detailed mechanistic basis for them, and then interpreting various observations in terms of the hypothetical mechanisms. (This analytical approach is thus primarily intended as a heuristic aid; though it is also shown to be prima facie compatible with some other, non‐Piagetian paradigms.) It is concluded that a useful way of summarizing the process is in terms of the combined operations of preference for “internal closure” within the brain (Internal Coherence or consistency), and preference for “external closure” during interaction with the environment (Pragmatism or experimentation). In the light of this, Part II briefly discusses the views of Tarski, Popper and the Operationalists/Behaviourists concerning the nature of truth and the legitimacy of reductionism into unobservable domains.
STOCHASTIC CONTROL SYSTEMS AND TARGET FUNCTION
Authors: TSOKOS CHRIS P. , RAO A.N.V.
Published: February 2008

1 INTRODUCTION Consider the stochastic control system of the form
ARRAYS FOR PROGRAMMING CHESS
Authors: ZIELIŃSKI G.
Published: February 2008

A computer program depends strongly on data structures processed by it. For time optimization it is often sufficient to change only the data structures. There are 5 parts to a typical chess program: Game manager, legal moves generator, evaluation function, openings library and algorithm for endings. Arrays play an important role in game managing, generating proper moves and evaluating the position. A properly chosen array form improves computer chess.
SEMANTICS OF LISP AND THE ONTOLOGY OF FUNCTIONS
Authors: GHOSE AMITABHA
Published: February 2008

The formalization of recursive definition of functions in the programming language LISP is studied with respect to its ontological assumptions. It is shown that whereas the theory of recursive function is based on the ontology of actual infinity, the semantics of variables and functions in a programming language can be adequately explained with the concept only of potential infinity.