SovietRxiv · Open Access in English
Rediscovering the Soviet scientific archive, in English
25357 full-text translations 14926 English PDFs 22539 abstracts
Showing 50 of 482 papers in Computer Science & Cybernetics
This paper examines extremal control of inertial objects under low-frequency and strong external disturbances, focusing on cases where ordinary extremal regulators require reduced search speeds and therefore lose disturbance immunity. For a first-order object, the authors analyze transient processes…
This note studies the complexity of Boolean formulas over the basis of disjunction, conjunction, and negation, where complexity is measured by the number of variable occurrences, equivalently the number of contacts in a series parallel contact circuit. Focusing on linear Boolean functions of the for…
This paper outlines principles for constructing an independent grammatical analysis algorithm for Russian in the context of machine translation. It argues that analysis should correlate text units with the grammatical relations of the source language, rather than directly with the target text or wit…
The paper studies the synthesis of contact circuits that preserve their realized Boolean function under specified contact faults, with emphasis on short-circuit failures. After defining self-correction relative to a fault mapping, it compares a straightforward redundant construction, which increases…
This paper formulates optimal control problems for systems with distributed parameters, extending beyond the lumped-parameter systems usually treated by existing optimal control methods. It considers objects described by partial differential equations with controls depending on time, space, or both,…
This paper addresses the construction and size estimation of nonbinary error-correcting codes for signals over residue classes, where correction of d symbol errors requires pairwise Hamming distance at least 2d + 1. It develops a linear coding construction for prime code bases by choosing systematic…
This paper studies optimal linear filtering of discretely measured random sequences when observations are corrupted by independent measurement errors, with attention to computational recursions suitable for control machines. For a Brownian motion model with zero mean independent increments, it deriv…
The paper studies when an alphabetic coding, defined by replacing each letter of one alphabet with a nonempty word over the same or another alphabet, is uniquely decodable and therefore reversible. Markov reduces the general uniqueness problem to checking a finite dictionary of bounded word length, …
The paper studies completeness problems for systems of finite automata, emphasizing that the answer depends on how the function realized by an automaton and the admissible circuits are defined. It introduces several notions of completeness for elementary automata with Boolean functions and delays, p…
The paper proposes a principle for a parallel associative memory device that retrieves records by matching arbitrary parts of their stored content rather than by address. It represents each information unit together with its inverse code and formulates search conditions using set intersections, allo…
This note studies informational stability for Gaussian random variables and random processes, a property connected with the validity of Shannon type information theorems. It defines information density for pairs of random variables and proves that a sequence of Gaussian pairs is informationally stab…
This paper addresses extremal control for plants in which inertia follows a nonlinear extremal element, a configuration that slows search, causes hunting, and can make ordinary extremal controllers unsuitable for oscillatory or unstable objects. It proposes controlling the search by using functions …
This paper proposes a formal system for programming concepts arising in the analysis of logical schemes used to construct programs. It defines memory states, operators, logical conditions, selecting functions, operator sequences, admissible states, terminal pairs, and the product of operators and lo…
This paper describes an early algorithmic approach to modeling aspects of musical composition on an electronic digital computer. Treating composition as a partly formalizable control process, it specifies rules for generating a monophonic instrumental piece in three-part ABA form, including constrai…
The paper formalizes algorithms for simplifying reduced disjunctive normal forms by treating simplification as the assignment of informational marks to conjunctions, including marks indicating membership or nonmembership in classes of minimal forms. It introduces neighborhoods of conjunctions, a mar…
This paper proposes the principle of movable interlocks for constructing circuits in electronic digital computers from semiconductor inverter-shapers and diode logic elements. The method allows feedback connections to be established or broken dynamically among different combinations of inverters, so…
This paper addresses the difficulty of selecting optimal algorithms for automatic street traffic regulation, especially where mathematical comparison of alternatives is impractical. It formulates the elements of the problem, including traffic flows, intersection geometry, signal modes, control algor…
This note studies acyclic diode circuits for a one-digit binary adder constructed from logical and, or, and not elements, with at most one negation, and asks for the minimum number of diodes needed to produce the carry and sum modulo 2 from three input bits. By analyzing monotone subcircuits and str…
This paper studies relative entropy, entropy production rates, and entropic stability for Gaussian random variables and stationary Gaussian processes. It defines entropy density for probability measures, gives criteria and decompositions for finite entropy between Gaussian variables, and derives spe…
The paper studies the enumeration of symmetry types of oriented contact (1,k)-poles realizing basic sequences of Boolean functions in n variables, where equivalence is defined by transformations of the n-dimensional hypercube. Using a group representation induced by these transformations and a chara…
This paper gives a precise formulation and proof of A. L. Lurie’s differential rents method for solving the balanced transportation problem with nonnegative shipping costs, supplier capacities, and consumer demands. It defines strikable systems of marked matrix elements, an ordered distribution proc…
This paper develops a frequency-domain method for approximate determination of periodic regimes in pulse systems containing nonlinear pulse elements. Assuming a linear part with low-pass filter properties, the periodic signal at the pulse-element input is approximated by its first harmonic, and harm…
This paper studies the asymptotic probability of decoding error for stationary discrete memoryless channels with symmetric transition probability matrices. It defines optimal and random-code error probabilities, establishes a Hamming-type lower bound, and uses large-deviation estimates to obtain pre…
The paper studies completeness for a class of feedback-free automata represented functionally as pairs consisting of a Boolean function and a nonnegative time parameter, with superposition operations modeling composition. It first formulates general results on relative completeness and precomplete c…
This note studies a class of binary systematic error detecting and correcting codes obtained by applying Siforov’s greedy construction to words ordered by their natural binary value. It proves that the codes produced by this natural algorithm form groups under componentwise addition modulo 2, derive…
The paper addresses extremal control of stable inertial objects of order n, where reversing the actuator according to the measured dynamic output can cause oscillatory and inaccurate search for the static extremum. It proposes estimating, over a finite time interval after each step change of the inp…
The paper studies simplification algorithms for disjunctive normal forms in Boolean algebra, focusing on whether a procedure can decide for each conjunction in a reduced form whether it belongs to a minimal disjunctive normal form. It formalizes a class of admissible algorithms whose decisions depen…
This paper analyzes extremal control systems operating under low-frequency external disturbances when the input signal is dynamically transformed and stored before entering a sign-relay controller. Using a parabolic approximation of the plant characteristic near the maximum, the study derives equati…
This paper develops an approach to optimal processes in pulse automatic systems using a convolution form of the system equations rather than first-order difference equations. By expressing the sampled-data dynamics through time characteristics, the method applies to systems with lumped or distribute…
The paper studies global stability of a class of nonlinear differential equations arising in indirect automatic control, under sector bounds on the nonlinearity and a spectral condition corresponding to stability with a sufficiently fast servomotor. Using explicitly constructed Lyapunov functions, i…
This note formulates a problem of selecting a given binary word from a finite table without repeated rows, using chains of operators that progressively restrict the candidate submatrix or identify the word directly. It defines algorithm weight as the worst case cost of such chains and instruction vo…
This paper introduces operator algorithms as a formal scheme for describing computation in terms of variables, operations, expressions, formulas, and operators acting on a changing domain of assigned values. It defines execution by transitions between variables, evaluation of operator formulas, and …
This paper proposes an algebraic procedure for synthesizing general multiterminal contact circuits from prescribed Boolean conductivities between terminal pairs. The method is based on successive extraction of external contacts, classified as longitudinal, transverse, or longitudinal-transverse, wit…
This note compares the complexity of realizing monotone Boolean functions by contact circuits using only closing contacts with realization by circuits allowing arbitrary, including opening, contacts. It introduces contact-count complexity measures for the two circuit classes and proves lower bounds …
This paper examines the implementation of discrete correctors for signal systems that detect and correct distortions, emphasizing single-cycle circuits that reduce correction time and relay-element requirements compared with multicycle receiving devices. It formulates the construction of correctors …
This note develops a mathematical framework for current monitoring of abstract transformers treated as black boxes, where correct operation at selected input signals changes the estimated probability of correct operation on an interval. It introduces a control operator, definitions of reliability an…
This paper studies the synthesis of circuits realizing Boolean functions by applying nonsingular linear transformations of variables over the field with two elements. It defines equivalence classes of Boolean functions under these transformations, uses Pólya’s method to enumerate classes for small n…
This paper treats proportional navigation as a cybernetic guidance problem rather than only a kinematic problem of two moving points. For a target moving at constant speed and direction and an object with constant speed, the authors derive closed form expressions for the ideal trajectory, line of si…
This paper studies algorithms for automatic programming of arithmetic operators on a three-address computing machine, focusing on eliminating repeated computation and allocating working storage. It proposes a command-saving procedure that uses a function of the operation code and operands to place a…
This paper addresses the inversion of spatial or “nonplanar” relay-contact circuits, arguing that apparent nonplanarity does not affect circuit operation because such circuits can be transformed into equivalent planar H-shaped circuits with only a fictitious increase in single-valued elements. It pr…
The paper studies the enumeration and structural recognition of indecomposable two-terminal networks, which form a topological basis for constructing arbitrary networks by superposition. It proves criteria for decomposability of simple networks in terms of an internal vertex controlling another vert…
This note proves Pontryagin’s maximum principle as a necessary condition for time-optimal control of a dynamical system whose control parameter ranges over an arbitrary topological space. Using needle variations of a piecewise continuous control, the paper constructs a convex cone of attainability a…
This paper studies the synthesis of logical networks with memory when the desired operator is specified not by finite tables but by formulas of an extended calculus of unary predicates. It defines a class of time-controlled formulas over input predicates and proves that these formulas characterize e…
The paper studies the synthesis complexity of contact circuits realizing Boolean functions of n variables, focusing on the asymptotic number of contacts sufficient and necessary in the worst case. It develops a synthesis method based on decomposing Boolean function tables, partitioning binary tuples…
This note presents a procedure for reducing accumulated rounding errors in solving systems of linear algebraic equations by column orthogonalization, a form related to conjugate directions and Gaussian elimination. The method repeatedly reorthogonalizes computed vectors and uses scalar products meas…
This paper addresses the problem of comparing nonnegative integers represented in the Czech number system, a residue number system with pairwise prime moduli, under the assumption that 2 is included among the bases. It introduces the notion of a tabular difference and proves criteria reducing compar…
This paper studies conditions under which inhomogeneous Markov chains satisfy a uniform ergodic principle, with attention to weakening commonly imposed restrictions on transition probability functions. It compares Dobrushin-type contraction conditions with a broader alternative condition, introduces…
This paper formulates an information-theoretic approach to the interpretation of geophysical investigations, treating a geophysical method as an informational observation system in which the measured field contains both useful source information and noise. Using Bayes’ theorem, the author derives po…
This paper studies the stationary distribution of busy connecting lines in the second-stage switches of a two-stage loss telephone system operating under free search. Assuming independent Poisson input streams to first-stage switches, exponential holding times, and sufficient second-stage outlets to…
The paper develops a formal treatment of how nonprimitive switching circuits can be composed from smaller circuits and decomposed into subcircuits, using simple state, input, and output vectors together with state and reaction matrices. It derives general formulas for the state and reaction matrices…
