CS & Cybernetics › Computer Science & Cybernetics ×

Showing 32 of 482 papers in Computer Science & Cybernetics

Probability-Theoretic Study of a Two-Stage Telephone System with Losses Operating in Free Search Mode

G. P. Basharin
1958 SovietRxiv: ru-195801.08772

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…

A MATRIX METHOD FOR THE ANALYSIS AND SYNTHESIS OF ELECTRONIC-PULSE AND RELAY-CONTACT (NONPRIMITIVE) CIRCUITS

Unknown
1957 SovietRxiv: ru-195701.96511

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…

On Matrix Schemes

Yu. I. YANOV
1957 SovietRxiv: ru-195701.95749

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…

ON A GENERALIZATION OF THE THEORY OF ACCUMULATION OF DEVIATIONS AND ITS APPLICATION TO THE DETERMINATION OF SELF-OSCILLATIONS IN GENERATORS

Unknown
1957 SovietRxiv: ru-195701.90486

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…

Coding and Convolution of Codes

L. N. KOROLEV
1957 SovietRxiv: ru-195701.90255

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…

Commonality of Sliding, Vibrational, and Optimal Modes of a Class of Servomechanisms

V. V. PETROV and G. M. ULANOV
1957 SovietRxiv: ru-195701.87664

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…

Equivalent transformations of relay circuits of class $\Pi$

Unknown
1957 SovietRxiv: ru-195701.76714

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, …

HOMING AS A PROBLEM OF TECHNICAL CYBERNETICS

Unknown
1957 SovietRxiv: ru-195701.71905

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…

On the stability of nonlinear controlled systems

Unknown
1957 SovietRxiv: ru-195701.61422

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…

On Equivalence and Transformations of Program Schemes

Yu. I. YANOV
1957 SovietRxiv: ru-195701.32046

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…

ON A FAMILY OF CLASSES OF FUNCTIONS OF THE ALGEBRA OF LOGIC AND THEIR REALIZATION IN THE CLASS OF $\Pi$-CIRCUITS

Unknown
1957 SovietRxiv: ru-195701.23026

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…

On the Inversion Complexity of Systems of Functions

Unknown
1957 SovietRxiv: ru-195701.18383

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 …

A Method for Synthesizing a $(1,k)$-Pole

Unknown
1957 SovietRxiv: ru-195701.10770

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…

ON OPERATORS REALIZABLE IN LOGICAL NETWORKS

Unknown
1957 SovietRxiv: ru-195701.07697

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…

THE THEORY OF INFORMATION TRANSMISSION THROUGH STOCHASTIC COMMUNICATION CHANNELS

We shall denote the channel specified by these elements by
1957 SovietRxiv: ru-195701.07683

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…

On the Theory of Optimal Processes in Linear Systems

R. V. GAMKRELIDZE
1957 SovietRxiv: ru-195701.07176

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 …

SYNTHESIS OF RELAY-CONTACT CIRCUITS

A. Sh. Blok
1957 SovietRxiv: ru-195701.02322

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…