Digital Automata Research Articles

A peculiarity of solving problems of minimization of Boolean functions

Minimization of Boolean functions is mandatory for the construction of logic circuits of digital automata. The result of minimization, in general, can be not one, but several equivalent images of the Boolean function with the smallest number of variables and logical operations with them. However, a possible set of images of the minimal form of a Boolean function is not always are taken i nto account when solving minimization problems. Quite often, the result of minimization results in only one image, while considering that the problem is finally solved. Of course, such a solution is far from complete, it does not provide an opportunity to choose the optimal logic scheme of the digital automaton to be created. The purpose of the work is to justify the need to find all possible representations of the minimal form of the Boolean function. The task was solved by analyzing the minimization of an arbitrary Boolean function. The minimization was carried out analytically according to the Quine algorithm and coordinate using the Veitch diagram. In both cases, matching sets of images of the minimal form of the Boolean function are obtained, regardless of the chosen method of minimization. This testifies to the correctness of the solution to the minimization problem, the purpose of which is to find a set of images of the Boolean function to ensure the possibility of choosing the optimal solution when constructing a logic circuit of a digital automaton. It has been confirmed that the correct solution to the minimization problem is a mandatory image of not one possible function, but a set of images of all possible minimal forms of the Boolean function.

Метод комплексного контроля передачи трафика в программно-конфигурируемых сетях

Modern requirements for traffic processing should possess the properties of mobility, speed, and simplification of network equipment administration. However, the existing classical Ethernet networks with Quality of Service failed to meet these requirements, which led to the emergence of software defined networks (SDN). In SDN, the main protocol is OpenFlow, which enables processing and managing heterogeneous traffic. This article aims to propose a methodology for eliminating the disadvantages inherent in the OpenFlow protocol. A method for complex control of traffic transmission in SDN was developed based on the algorithm of early diagnosis of real-time traffic losses during the transmission of heterogeneous traffic in the OpenFlow switch and the algorithm of real-time traffic transmission using a scheduler and a delivery control function in SDN. Moore digital automata of the proposed transmission algorithms were developed. A description of systems of canonical equations and output functions for digital automata was presented. Tables of transitions of digital automata were constructed, states of digital automata were encoded, and digital automata were synthesized based on D-triggers. The formalization of the developed method and algorithms of traffic transmission in SDN based on digital automata made it possible to design control automata and algorithms on FPGA of the Spartan 6 family and later familie.

“These People in This House”: Intermedial Approaches to Decentring the Domestic in Harold Pinter’s A Slight Ache and The Homecoming

This article explores the effects of moving two of Pinter’s earlier plays outside their original domestic settings by focusing on two productions staged in 2019: A Slight Ache (1958), directed by Jamie Lloyd for the “Pinter at the Pinter” season in London’s West End, and De Thuiskomst/ The Homecoming (1964), directed by Nanouk Leopold for Internationaal Theater Amsterdam (ITA). In relocating each play from its prescribed domestic interior, both productions explicitly drew on and incorporated the conventions of different media, specifically radio and film, in markedly different ways. Rather than transposing the country home of Pinter’s original radio play onto the stage in an analogous setting, Lloyd’s Slight Ache featured two performers appearing in a radio studio to voice their characters, thereby complicating the identities and motivations of the play’s characters by evoking a place of work, not a place of domestic retreat. In Leopold’s starkly minimalist Homecoming, video projections and visualizations of the human body as a kind of digital automaton replaced the trappings of domesticity, inviting audiences to focus instead on the live and mediatized bodies of the characters. Through their different means of representation, these productions demonstrate two different approaches to decentring domestic space in Pinter’s early plays via distinct intermedial strategies. In doing so, they offer a renewed focus on the embodied presence of the actors, thereby inviting new insights into how Pinter’s early characters can transcend the confines of their interior spaces on stage and underscoring the writer’s own inherently intermedial praxis.

CONDUCTING A SYNTHESIS OF A DIGITAL AUTOMATON FOR AN AUTOMATED FIREFIGHTING SYSTEM

Every year the industry in the world is gaining momentum: the number of industrial enterprises is growing, and with it the number of accidents at them. Oil today is the most common product for the synthesis and production of products. Increasing the level of fire protection systems at oil refine¬ries remains one of the most important components of protecting people from technogenic hazards. The speed of innovation allows the application of artificial intelligence in the creation of automated fire protection systems. Research objective. This study is aimed at building a model of an automated integrated fire protection system (AISPPO).Through the synthesis of digital automata and minimizing the control functions of the digital model is created a system of automated integrated fire protection system. Materials and methods. To solve the problems of research used methods of constructing graphical algorithms of automated integrated fire protection system. This system is a new approach to solving the issue of safety of industrial facilities in the oil refining industry. Results. The proposed new model of the software implementation of a digital automaton in an automated integrated system of fire detection and monitoring of an oil refinery has made it possible to create a bank of calculated and analytical data on all potential types of failures in the structure of the enterprise in order to train personnel and make changes to existing methodological documents and instructions for personnel actions in a particular situation. Conclusion. The developed technology allows you to process the incoming signal contained in cyclograms into an intermediate form for the synthesis of digital automata using innovative tools.

O autômato digital e os circuitos de afetos nas redes sociais

O presente artigo investiga a relação entre o conceito de autômato espiritual, tal como desenvolvido por G. Deleuze em seu texto sobre o cinema, Imagem-Tempo, e os autômatos digitais que emergem nas redes sociais de nossa atualidade. Conceitos como autômato psicológico, automovimento do pensamento, escolha e sugestão, padrão de comportamento e perfil de usuário são explorados para compreender a atual relação que mantemos com as interfaces digitais, de modo a explicitar os novos processos de pensamento e afetos em jogo nas redes sociais.

Using probabilistic fuzzy models for the prediction of functional failures of microwave LSI with radiation exposure

The article presents an analysis of microwave LSI behavior under radiation exposure at the functional-logical level of description. The analysis is based on fuzzy digital automaton and topological probabilistic models of workability assessment. It is shown that in certain cases both deterministic and non-deterministic failures are typical. Each operation threshold in logic elements under radiation influence has a zone of uncertainty and can be expressed quantitatively by a fuzzy number. This case, the real nature of microwave LSI radiation behavior is determined by the specific ratio of radiation-sensitive parameters of its elements and by taking into account the influence of their statistical scatter. Methods are proposed for simulating failures of microwave LSI under radiation exposure that are based on the model of a fuzzy digital Brauer automaton and a probabilistic reliability automaton.

Prediction of solutions on the basis of the mathematical model of cognitive digital automata

Prediction of solutions on the basis of the mathematical model of cognitive digital automata

ANALYSIS OF THE RESULTS OF THE PASSAGE OF PEDAGOGICAL PRACTICE IN THE TECHNICAL UNIVERSITY

The purpose of the article is analysis and research of various forms, methods and methods of teaching. In modern pedagogy at the moment, three forms of interaction between the teacher and students have become widespread, namely: the passive method, active and interactive. Passive method of teaching is that the teacher takes a central role in the learning process, and students act as passive listeners, subject to the directives of the teacher. Active learning implies the organization of an educational and cognitive process, which is aimed at comprehensive activity with the use of various pedagogical tools. Under the interactive method of teaching, understand the form of learning, which stimulates the development of the student's personal qualities and understanding between the teacher and the student while solving interactive tasks and exercises through dialogue between them.During the pedagogical practice in theDneprovskyStateTechnicalUniversityin the group of ES-14-1 inthe discipline «Digital automata» an experiment was conducted using all three teaching methods. A methodologically substantiated and situationally motivated combinational method was developed and introduced into the practice of teaching students. The combination method combines a combination of passive, active and interactive methods, since the specificity of instruction requires a change in activity during classes. The results of the pedagogical experiment on the use of each method are presented. The results of the pedagogical experiment on the use of each method are presented. When holding a passive method, the students' memory level remains weak: during the independent work, out of 17 people, only 13 people correctly coped with the II level of complexity, while the active method of 17 solved correctly both the I and II levels of complexity of 15 people . By an interactive method, 16 people could correctly find the solution of I, II and partially III levels of complexity. Based on the results of a written survey, it can be argued that, using the combination method, the level of knowledge sustainability increases by 17.27%, while with the active method – by 11.47%.It is established that a modern specialist should be able not only to reproduce already existing knowledge, but also creative activity, to non-standard thinking, the ability to self-education and self-realization, and therefore it is suggested to use a combination method that (ensuring high quality of the trainees' professional competencies) and should be so in the conditions of the changed education paradigm.The conclusions formulated in the work are sufficiently substantiated and can be used in the practical activities of educational institutions.

Deterministic and nondeterministic failure models of LSI circuits exposed to radiation

Methods are proposed to estimate the relationship between probabilistic and order models for simulating functional failures of the large-scale integrated circuits (LSICs) based on Brauer’s fuzzy digital automaton and on a probabilistic automaton for reliability evaluation. In the first case, the behavior of the LSIC is determined by varying static and dynamic parameters; in the second case, by the statistical straggling of threshold failure levels.

Application of probabilistic and fuzzy models to the simulation of radiation failures of LSI circuits

An approach to estimating the relationship between probabilistic and fuzzy models is proposed for simulating failures of large-scale integrated circuits (LSICs). These models are based on Brouwer’s fuzzy digital automaton and topological probabilistic models for estimating the functionality of digital devices. In the first case, the behavior of an LSIC is determined by the variation of deterministic static and dynamic parameters, and, in the second case, by the statistical dispersion of threshold failure levels.

Modeling of functional failures in digital systems under the radiation effect

In this paper we study modeling techniques for functional failures in digital systems under the radiation effect; these techniques are based on Brouwer's model of a fuzzy digital automaton. In comparison with common approaches, a fundamental difference of such method lies in the feasibility of explicit consideration (in functional-logical models) of the relationship between radiation resistance of integrated circuits (IC) and their mode of operation, functional state, engineering and schematic parameters. In addition, certain methods for constructing criterion membership functions are proposed for basic elements in different IC. Finally, the algorithms for forecasting transient and residual radiation effects in IC are developed.

HYPERINCURSIVE METHODS FOR GENERATING FRACTALS IN AUTOMATA RELATED TO DIFFUSION AND WAVE EQUATIONS

This paper provides modelling tools for automata design in the field of information and formal systems. The concept and methods of incursion and hyperincursion are firstly applied to the Fractal Machine, a hyperiacursive cellular automaton with sequential computations with exclusive OR, where time plays a central role. Simulations will show the generation of fractal patterns. The computation is incursive, for inclusive recursion, in the sense that an automaton is computed at the future time l+1 as a function of its neighbour automata at the present and/or past time steps but also at the future time l+1. The hyperincursion is an incursion when several values can be generated at each time step. External incursive inputs cannot be transformed to recursion. (This is really an example of the Final Cause of Aristotle.) But internal incursive inputs defined at the future time can be transformed to recursive inputs by self-reference. A particular case of self-reference with the Fractal Machine shows a non deterministic hyper-incursive field. Interference of particles in the Fractal Machine gives rise to fractal patterns which follow Huygens Principle of Secondary Sources. The superimposition of states is similar to Deutsch's quantum computing principle. This is also related to digital cellular automata obtained from diffusion and wave finite difference equations. Zuse proposed to represent physical systems by a computing space based on such a digitalisation of differential equations. I show that the digital wave equation exhibits waves by digital particles with interference effects and uncertainty.

WHAT IS THE LOGIC OF PARALLEL PROCESSING?

We can associate with each consistent formula F of first-order logic a computing device as its representation. This computing device is one which will calculate the Skolem functions of F (for a denumerable domain). When two such devices are operating in parallel, the resulting architecture does not necessarily represent any ordinary first-order formula, but it will represent a formula in independence-friendly (IF) logic, which hence can be considered as a true logic of parallel processing. In order to preserve representability by a digital automaton (Turing machine), a nonstandard (constructivistic) interpretation of the logic in question has to be adopted. It is obtained by restricting the Skolem functions available to verify a formula F to recursive ones, as in the Gödel’s Dialectica interpretation.

The dynamics of digital circuits with memory for ternary signals

The paper examines a digital automaton with memory operating in the ternary alphabet (0, 1, θ). The problem of analytical determination of ternary processes on automaton outputs and inside the automaton from given ternary processes on the automaton inputs is considered. An algorithm is proposed reducing this problem to standard determination of the processes in an automaton with the alphabet (0, 1).

Synthesis of monitoring devices for digital automata

Synthesis of monitoring devices for digital automata

Some Doubts About “Turing Machine Arguments”

In his article “On Mechanical Recognition” ([6]) R. J. Nelson brings to bear a branch of mathematical logic called automata theory on problems of artificial intelligence. Specifically he attacks the anti-mechanist claim that “[i]nasmuch as human recognition to a very great extent relies on context and on the ability to grasp wholes with some independence of the quality of the parts, even to fill in the missing parts on the basis of expectations, it follows that computers cannot in principle be programmed to recognize or learn to recognize all patterns” ([6]), p. 24). Nelson proposes, contrary to this claim, that “gestalt recognition is not beyond digital automata” ([6], p. 24). in particular, he claims, he will establish by what he calls “Turing machine arguments” ([6], p. 25) that the following four theses are true: (1)automata can recognize different pattern types in one and the same set of instances;(2)automata can recognize the “same” pattern in different (even completely disjoint) sets of instances;(3)automata can recognize incomplete, degraded patterns having missing or indeterminate parts;(4)automata can recognize family resemblances. ([6], pp. 24–25)

Use of the MIR-2 computer for program analysis

This article proposes a procedure for using the MIR-2 computer for analyzing programs written in ANAL[TIK language I l l , Our work was done in conjunction with the development o f a programming technologoy oriented toward the creation o f program systems that is currently in progress in the Division of the Theory of Digital Automata, Insti tute of Cybernetics, Academy of Sciences o f the Ukrainian SSR. Our techniques are those presented in [2-4], as adapted to our own situation; the procedure is illustrated by examples.

Reliability in digital automata design

Reliability in digital automata design

Reliability synthesis of digital automata

Reliability synthesis of digital automata

A method of taking the delay of a digital automaton of a quasianalog hybrid computing system into account in solving ordinary differential equations

A method of taking the delay of a digital automaton of a quasianalog hybrid computing system into account in solving ordinary differential equations