Showing 32 of 482 papers
in Computer Science & Cybernetics
G. P. Basharin
This paper studies a two-stage automatic telephone switching system with losses operating in a free-search mode, with independent Poisson call streams and exponentially distributed holding times. The system is modeled as a finite continuous-time homogeneous Markov process whose states record the num…
Unknown
The paper develops a matrix method for analyzing and synthesizing nonprimitive switching circuits, namely relay-contact and electronic-pulse circuits with delayed feedback. It represents circuit states, inputs, and outputs by simple binary vectors, introduces state and reaction matrices, and shows h…
Yu. I. YANOV
This paper develops a formal theory of matrix schemes, which represent the order of execution of operators controlled by logical variables and by specified sets of variables whose values may change after each operator. It defines admissible sequences, determinacy of a matrix scheme, equivalence of s…
Unknown
This note generalizes the theory of accumulation of deviations in stable linear automatic-control systems to include velocities, accelerations, integrals, and other linear functions of the controlled variable under disturbances bounded either in magnitude or in derivative. Using Laplace transforms a…
L. N. KOROLEV
This paper develops a formal treatment of coding finite dictionaries over finite alphabets, defining words, dictionary volume and length, and one-to-one encodings in terms of positional representations. It establishes a lower bound, depending only on the coding alphabet base and dictionary size, for…
V. V. PETROV and G. M. ULANOV
This note examines the relationship among sliding, vibrational, and time optimal modes in a class of relay servomechanisms and indirect control systems. By comparing differential equations and phase plane descriptions for systems with feedbacks and vibro-contours, the authors show that these modes s…
| | Printed | Should read |
Unknown
This paper addresses the automation of programming for machine translation tasks, where programs must manage large numbers of discrete logical variables stored compactly in memory cells and accessed by both cell address and position. It proposes a formal representation of translation schemes as sequ…
Unknown
This paper develops principles for equivalent transformations of class Pi relay circuits, extending beyond contact networks to circuits containing relay windings and finite-conductance elements. It introduces the concept of conductance order to characterize how such elements affect relay operation, …
Unknown
The paper treats homing of guided projectiles as a technical cybernetics problem, arguing that kinematic criteria such as line of sight angular velocity, normal acceleration, or overload are insufficient when projectile rigid body dynamics and rudder limits are considered. It derives equations for i…
Unknown
The paper addresses the design of combined automatic control systems that include additional connections for disturbing actions in order to reduce their effect on the controlled output. It proposes a frequency-domain assessment method based on plotting Mikhailov curves for the system and disturbance…
| | Printed | Should read |
Unknown
This note derives sufficient conditions for stability in the large of certain nonlinear automatic control systems governed by fifth and sixth order differential equations. Using Lur’e’s theorem, the stability problem is reduced to the existence of real solutions of associated quadratic resolving sys…
L. V. KANTOROVICH
This paper proposes a universal mathematical symbolism intended to make diverse tasks suitable for electronic digital machines, including numerical computation, analytic transformation, logical analysis, circuit analysis, and program processing. It introduces “schemes,” in which mathematical objects…
| | Printed | Should read |
| | Printed | Should read |
Yu. I. YANOV
This paper formalizes program schemes for automatic computing machines as strings of operators, logical conditions, and paired markers, with execution determined by sequences of truth assignments to logical variables. It defines admissible sequences under a distribution of possible variable shifts c…
Unknown
This paper studies finite difference methods for the numerical solution of a model parabolic boundary value problem and seeks explicit schemes with less restrictive stability conditions than the classical explicit method. It introduces a family of difference operators that includes the Crank, Nicols…
Yu. I. ZHURAVLEV
This paper studies partially defined Boolean functions on vertices of the n-dimensional unit cube and asks how to complete them so that the resulting function has a disjunctive or conjunctive normal form with the fewest variable letters. It formulates the problem as logical separability of two disjo…
Unknown
This paper studies the realization of Boolean functions by parallel series contact circuits, focusing on the classes of functions of n variables that take the value 1 on exactly k input sets. It presents a synthesis method based on grouping identical columns in the matrix of the satisfying assignmen…
Unknown
The paper studies the epsilon entropy and epsilon capacity of several classes of analytic and entire functions, measured by the uniform metric on a real interval. It establishes asymptotic estimates for functions bounded in a strip, for entire functions with prescribed exponential growth, and for en…
Unknown
This paper studies the minimum number of distinct negated subformulas needed to realize Boolean functions and systems of Boolean functions by formulas over conjunction, disjunction, and negation. It defines inversion complexity for formulas and function systems, introduces alternating chains in the …
YUAN CHZHAO-DIN
This note addresses the stability restrictions that make explicit grid methods inefficient for parabolic boundary value problems and the algebraic burden of fully implicit schemes. It proposes iterative difference schemes that use spectral properties of the discrete operator to suppress high frequen…
Unknown
This paper develops an algebraic method for synthesizing a contact network treated as a one input, multiple output terminal network with prescribed total conductances from the input to each output. Using characteristic functions of multi-terminal networks and a system of inequalities on the variable…
M. A. Proskurnin
Unknown
This paper studies operators without anticipation on finite input and output alphabets, with special attention to those realizable by logical networks with feedback and delay. It formalizes the weight of such an operator as the minimal size of its auxiliary alphabet, interprets its logarithm as memo…
We shall denote the channel specified by these elements by
This paper develops a measure theoretic formulation of information transmission through stochastic communication channels fed by stochastic sources. It defines channels with and without anticipation, finite memory, channel entropy relative to an input source, regular sources and channels, and regula…
R. V. GAMKRELIDZE
This note studies minimum-time control for a finite-dimensional linear differential system with one scalar control bounded in absolute value by one. Under a nondegeneracy condition excluding reduction to a lower-dimensional invariant subspace, it derives necessary equations for optimal controls and …
Unknown
This note proposes an approximate method for estimating the traffic-carrying capacity, or probability of refusal, of a group of connecting devices attached to the outputs of a two-link telephone switching system. The system is modeled with two switching stages and variable availability, where the nu…
Ya. I. MEKLER
This paper examines the number of unit constituents needed to describe and ensure the operating state of relay-contact circuits whose elements act on a given actuating element once per cycle. It argues that the conventional maximum of \(2^n - 1\) constituents includes superfluous terms produced by u…
A. Sh. Blok
This paper defines several classes of relay-contact circuits and gives constructive methods for their synthesis using auxiliary relays and contact networks. It first treats contact circuits with finite memory, representing previous conductivity states by binary auxiliary variables and realizing both…
Unknown
This paper examines approximate invariance in linear combined automatic control systems, where the controlled coordinate is made independent of disturbances only up to a prescribed accuracy. It derives relations between the response under ordinary deviation control and under combined deviation and d…