SCIENTIFIC ABSTRACT STOYEV, K.D. - STOGNIY, B.S.

• Document Type: CREST
• Collection: Scientific Abstracts
• Document Number (FOIA) /ESDN (CREST): CIA-RDP86-00513R001653320009-2
• Release Decision: RIF
• Original Classification: S
• Document Page Count: 100
• Document Creation Date: November 3, 2016
• Document Release Date: August 26, 2000
• Sequence Number: 9
• Publication Date: December 31, 1967
• Content Type: SCIENTIFIC ABSTRACT


BULCLUM/Cultivated Pla,its - Frvit3. Derries.
Abs Jnur : Ref 71iur Disl., 1#3 12, 1958, 538110
: T,:)d--)r3v, Mr., Zankov, Z.D., fle-jelchav, 11., Jtoy@y'L K.D.
1'.@'t - .
Title Experiticats wit,, 81-..-;rt and PruninC; .A Saix, Wine
Gra,?c Varictico.
Cri_r PuL Uozarstvo i vi.-.irstv,@, 1957, 6, If- 3, 4-19
'I v
Abstrac, As the result f exicrit:c..ts c,nlixted In l)-52-1953 III
the vii,.eymrde ;f lab.:)r c- .,-,-,crativcs, the aut:i:@rs @avc
reached the coixInsim t:,.:3t the 1-@ad z)f 8-10 eyes per
pl=t, presciAly "sed -@@n the est3blistments ir. Lul,-nria,
13 L-isufficic;,t. With tho prese.--t a,-ric-oltural techai-
qic it caa be incrciscO :,@.i Vic Mirzt, Vineaka, HO. Mus-
cat ane Mavriv! varieties to 24 eyes, srO. :)a tl;o PaIld
viriety - tc 32 eyes -)c,- plant bAh with ah,jrt :i-cl 1,)n@;
prtmln@;. ParVier iixreisc U Lho fruit bearliv, I.."I i-t
feasible with the )f tic 3LTicult-m-al
CqrO. 1/2

DULGAR L,,Irul t iv,
Fruits. Derrier-
Ref Zhur 14.1 12, 1958, 53034r
b'lcX-,rDwna ns a wh.,le. 7711c If the
the fruit benrint, viiies oilri-.1- t@liv f:;rr-.lltirlU I)f the
l4n.'"'t rr@st be C-Trelate., wi*l. t:-.c blrlo,
I ;ical ;@ccullari-
tics ;f the varLty, vith Vlo c-@:u!iti)n of Lhc pln'It
the level -
)f ai,;r1cultural t,?cl--.-.Ique. .t.9.S
143
1v C. f;
i Lj% t
-n
1-0
I r o t! -j 1, -

ly

$70
a!, K.JD.-. HAWROV. P.T.; EXINCHEY. 1.3.
Chromatographic analysis of sagars and free amino acids of grapevIne
sap Cwith summary in Zrglishl. Fixfol. rant. 6 no.4-.40&414 Jl-Ag
159. OaRA 12:10)
laScientific Research Institute of Viticulture and Vitemaking.
Pleven.
(Grapes) (Amino acids) (Sugars)

7

`7RI OD@- CAL: Dck'an 3 SSR
,
1,RAC-i: A-- i t
i; .1 i f fr n a n
h t f t 7 h

fq-,f
f

nd 1
t:L %!

t

f

Vine
t i
I T
1: fl:y
r v L r,., Fr

r D a r;s;@ xh re ts
vc,, r o n ;ii;t'. li @i Z I A J
f i rot I I m. I...U , -I n t,.@ -1 X 1 4 C
auid to t%ke, place of
Ref 17 Pho i i c- Frol., -ib iy ri I,,, "r, I v.-I re I the r. -
croa.,,- ii, U.o @iminc icltl f@-,rtiliv.l vi%es
(Ref 19 @-e invo.,nt Ica t :-I- --, i
nitro6t@:-, bc t%ke.,. up -In ore-inl z fcrm.
F -. 3 m r, t s 'n c t -i I rl s t ---, th,? 1. r, 4, 1,.; a I
organ@; in t h fGrm zf v,.ric.-,;s aain,@ acij3. 7he zo:jt Irle%jive
c ow., e r s i Qn r, fi n @; r g @. i n 'A ;@ . -. 1 1. r c, C (@ . -, "A -, t 'D a z I -. o a c 'A d a t a k 4@- 5
d,,Irine tinp- first. du.;i all",jr 141;3 -ip;li@@atizln to th,@ zcll.
7hi@re -re 2 figur,---s, t-ibl@@, -f --h!,@n
are sovittt.
3 3 0 1 A T I ON I k
6. Instit'ite @f
:@ -; I I t -@; r un 4, r e o.; nt, e v +- r, r i
.A14., 1 ,

Z. z
3-%i S
PRES ENT ED:
ZU-111"MIED: A OD , I

STOYEV, k.D.; MAMMV, P.T.1 BEMM, I.B.
Sugarp and free amino acids during the maturation and dormancy
of the grapevine. Y1zlol. rast 7 no,2:145-150 160. (MIRA l4s5)
1, Scientific Research Institute of Viticulture and Wine Making
Plevna, Bolgaria. (Grapes) (Sugars) (Amino acids)

STUYV, X.D. 111,11f.
intornrill-mrsl Conf4srenre or viti,,a* j, FAN 6
I ur, spleeL
11, @ .91 161.

SMfEV, K.D.; ZANKOVO Z.D. (Bolgariya)
Effect of the length of day on the characteristics of growth snd
development of grape seedlings. Agrobiologiia no.4054-561 JI-Ag
162, (YUPA 15:9)
1. Nauchno-losledovatellskiy Institut vinogradarstya i vinodellya,
Pleven.
(VITICULTURE) (PPOMPEPIODISM)

DASKAIM, Khr., _Kunlo; B(CDAN011, Vnall, at. n. alltr.;
KHRISTOV, ni. n. outr.; RHADMICIXW, Agen A., st. r-rarhen
sutrudniV; DECMV, Gairgi, ml. n. nutr.; BLIMArOY, Georgi, prof.;
FFNKrV. B,-)Jan, ml. n. sutr.; FOII(@V, Rumn
.@clerce nn the offensive for pr,:@greap. llom@% i takh MUJezh 15
no.7,18:0-10, 56-57 JI-Ae, '0.
1. ZqM. predSedAIPI Dq3@1%10V). 2. Gliv5n nomichen
Nnurhen sp'sr,3tar rm AISN (fcr
-4e@ret,ir nPk ASN (I'o,,
Rot,d.nivjv). 4. lngtitut za somls@ogo Of/)PAnstvo
Q*or Khrlstov). 5.40iraktor ni Institut-i rteorganlchei@--v I -1,,,4ht.'k
L-hinillft pri BAN (for Bliznnkov). 6. Pre-Isednf-al na
I
rnw-i 1 to@hnlches!@l pr(,rr,,.i pri Ts!@ ri 'D@M; (for Polov).

STUN, Kunlu
Conference of t,-e Co=ittee on Cc-ordination of Scientific
Researc*-. in Agriculture and Forestr, in Soc!alist Ccluntries.
Oelskostop nauka 3 no. 1:77-'.,8 '(4.
1. Corresponding Member and Chief Sclentific Secretary
of tlie Academy of Agricultural Sclpnces, awl Xember
of the. BoArd of .-Altors, "SmIskoilcpannka naulka".

SM-iV, U-r-,qt Iss c@i-icer?
V-1 . 11 1-0. P,;, C'et . 11).-f)
F - I @14 -IT 17!@C, 1' ',- Lf 1, 1 L
A -;R I C U1 11; -E
!tulgarli
S'-@: Fist Fur--,win Accesslon, Vol. O@, I'o. 3, ;'xirch 101,7

r:7
t A
e ni v-,,
f I i

-I . I
I
@ f ,, e,@ I . .
t
. I - 41, . I I I . I I . . . I . @ . . . I . . - -.

. - .. .1 . - .. 1.
11, @ . ., - 1, U I .,
ir exprio@nc-s o it,;@Wini-, ir, slinnini?.. "
I . @ @ @ M!-l'.;@!;14.,rlont-) "j'l. !-, I-11, 1@1@7- @Allvaria
L-@ : ::()nt!, 3 ln('ex of Lzst -uroi ean 1,ccc:,:;i rr-:@ ) i 'L@, '.' 11 - 7, na. 5t t@-* 1958

- vt -
latTwom A- to
*c VWS J.Z-.1r:A I.% .0vus-6.0m.
tn.%7 it; *-,%it ^7. &ulr2v&pre
VV UCTZVTZI:,-V, A-N'@ I%'
4f,( tv %acnimill-)
cte 4(c. so .-Tr
.0 jom-.;-%nS *-.e4TF ok" Stow-ou-r.
it r*3
I't lim '43ro"or.,
gvvcwo:,p4r
ukl ;a
ifz.
MOT..
lcw. 'It;c*

Stoyu L4tpSy,,.,�toiuj; BALASH, Ion [B&lao, Ionjj GECUU., Iozef
[Hecko.,-JO-Zd-fj'jr@ON1, Laslo EV&rkoni,, Laszlo)
Friendship never grows old. Radio no.8s6-7 Ag 162. (KUU 15:8)
1. Predsedatell TSentrallnogo komitets, Dobrovolloogo obahchestva
sodeystviya oborone Faxodnoy Respubliki Bolgarii (for Storev).
2. Zamstitell predsedatelya TSentrallnogo soveta Soyuza fizkulltury
i sporta Rumynskoy Narodnoy Reolmbliki (for Balash). 3. Predsedatell
TSentrallnoco komitata Soyuza sodeystviya &rmii Chekhoolovatskoy
Sotsialintichookoy RespublikJ (for Gechko). 4. Zamestitell predve-
datelya Oboronno-sportivnogo soyusa Vengerskoy Narodnoy Respubliki
(for Varkoni).
(Radio operators)

TECHN)LOJI
keriodical LEYA ?ACNIS11LZ*=. UUTIL. Vol. 7, no. 6, 1958.
jTOLV. S. How the work on the drawing machines in the December 23 State Industrial
Enterprise in Uabrovo was improved. p. 23. Yrom the experiences of N.F. Giirova,
the well-known weaver. p. 24.
Monthly List of East 6wropean Accessions (WAI) W, Vol. 8, no. 3, March, 1959. Uncl.

STOMI St. (Narodnaya Respubli)m Bolgariya); KOL.EV, ff. (FArodnaya_ Respubliks
Bolgariya)l TOPMUROVp V. (Ikrodnaya Reepubliks, Bolgarlya)
Datertaining the distribution of components by cUsses in coal allma.
Ugol, 37 no*7:52-53 Jl 162, (KIRA 15M
WIgaria-Coal-Classification)

li;ni.@.`, "I . I I I
p I I @
!U ! -.1 An I !- @ t @' VI %i @,f the ov"rqi z". i r@l f@ .1 0"?
i@, i I k.m @:cfi 'A i-,ini r.. , 11', @ I @ ,i t ,) I k "41 n g n ") II r, is, @ @- - P@@ " , - 'll @,, , @, I
I
. p1bl , '0. 11

.IrAv, Auev, lots. lnzh.
"Concentration of coals and nonmetallic minerals In hoav7
suspensions" by I.Z. Margolin, Reviewed by St. Stoeva
Min delo 18 no.3:48 163.
1. Ydnno-geolozhki inatitut, Sofia.

, IT, V., Inzli.; ..talcho, !nzh.
@
jl I,!
liatfwril.,king the extent of roll-gr etrengthening J.-I the pollsh!nIr
of the 9lots of cylindrical straight-toothed corwh"ls.
Tekladka lJul9 13 no.80-6 104.
I.. Institute of Mining Geology, Soria.

G EP A 0" 1""C'," , 'c' . ; 3 T( JKII' 9 S' t . ; U?:IA!-'C V Ito 1: . ; BO.1111 N f.,;'W'A 0 E .
-
Use of the fract.lon cr plant, extractive turpentine at over IW- I"
an a flotation reagent ror coal and orea. 10h.1m I industrila 36 no.7:
'@65-267 16 10.

STOEV, St., doti. k.t.2j.
Influence of the preliminary and intermediate stirring on the
velocity and selectivity of flotation of the Balk&-3 Basin coal.
Godishnik Min gool inst 9SI19-135 162-163[publ. 164).
Gamma radiation used in the rapid control of mineral components in
ore-cLrenaing factories. Ibid. slA,7-16." I- --.

co,il fron "lle Mrx ty It In
11 T I
4.41A. .,LA,. !Oilo 1 1), :lot 61 l'-11"
Eit-trifi,
-.. @f
.@vj. --' a.; t;-,", !,I. - ,-. 1 " -.-,% , -, -@ t@1. @, @f -, 19@6,
.I - n Accl.", "4

AA
'lit

"M I y

r, Arl v j 3.
Studying the concentration of stxw useful idulgariAn twnnietallic minerals.
P. 13 (STROrrFU)rVO) Vol. h,, n,.,, 5. 1957,
)ofiial Julgaria
301 Monthly Irviex of East European Accessions (ExAl) jej Vol. ?i No- 31
March lq58

Sth-Vs S.
Electric blockine against disconnected switches with load.
p. 19 (RATSIOIIIALIZATSIIA) Vol. 1. no. 10s Oct. 1957j
Sofils, bulgarls
SOj Monthly Index of East European Accessions (EEAI) LCI Vol. 79 No, 3,,
March 1958

01TOEV, S,
"Possibilities of utilizing the msthods of ratherAtics statistics in the concen-
tration plants."
P923 (Tekhnikap VoL 7p no. 1. 1958p Sofliap Bulgaria)
Monthly Index of East Suropeon Accessions (EZAI) LCp Vol. 79 Moo 8p August 1958

STLEY, Stoicho, d,)0ent,, k. t. n.
Use of gamma rays In the struotural aimlysis of the unbroken pieces
of ores. TPkhnlkA ftlC 1.2 no.2%1'@-22 163.

STCF,VO St,
JUnatics wA m&Jectivity of the BalkanW coal flotation in
the pulpe of various dowity and the difflorent AnWasity of
mixing, GocUshnik Kin goo.L Inot 71527-558 ow/161 tpubl. 162].

STIC'Ev, :".. @4 -,. :n-,".
C:.-n@,@rit -jf pyrite and grapi-ite pro&.11.1to, controlled ty
the - and neutron-aA,*,,Ivnticn analysis. Kin delo IS
, P ,
nt. , I ",a. wosow..
*.Va. MtyvAALa 4-4 T4.8. Ptl'aa@. Thar- are JA ewfor-0400.
truML&tta"). J,) gnogits. W's 1 4teft".
P&W Ul.@ VINNIXAM-144
On a Mmta@l it 44t@&%%otad rr@KPA.M,114 Lill
rowLes emi&tt-4 -tm-io 't 4.t@@%L3 prv-
arawm%lAd Pro4rams. eaten attawal to %". tft* pr%avoa or rr.-
axleoftind as "t'"ostLe as that @f "hie *a.% go A.-
oft&& .I brary .4 pmdr@l,* VM41r6oo &.1 *k4att"a
%porsix-awLA. pr%k4rft0"I-*- Thwro a" @ rererefts",
-UM). "Zndtoloo at V4VOj4V1ft4 & 39"1&19401
@"Z@A SYS1.0
TV" �4".mstLQ pftorftft*j"4d &.44,400,
.Wj of V.m, 4L
J#-l'p'4 4% %nm
IS.". 't I tal*46 M
%I-,A 4f 4 Libra" 4 *-4tm11*vS lpr-4raw@mlts jordr&*#,r OIJ 4f
r., .... tt VA- awl-I 4,0 st-A@,*. 4-@LV%@ 0,

jTOG1,IY-, A. A. ; an,4 V.::. rml " ";*", "-r'c 1 -1. 1.
"Concerning Cma Alogorithm in Toaching to Racoplie IDGical Problmss*
Rapo-,t autcittA for t'rle S.,n,.,T>osiun on Principles in the Dasip of
Self-1parulni, System3p Kiev Ukr SSR, 5-9 May 1961

tYOO (115-01 1377,13")
AUTHOR: St4lay, A. 0.
33870
S/6 @)6/6 1,/001/000,/004/007
D231/D304
TITLE: On interpreting the method of T.-efft.-
u UIR C E Akademiya nauk Ukrayinalkoyi. RSR, Obchy!71yuval Inyy
toentr. Zbir.,iyk prats' naten4azyky
i tekhniky. v. 1, 1)61, 68-77
TEXT: The author proposes an interpretation of the method of E.
Trefftz (Ref. 1: Verh. Kongress AfUr tech;niuche Mechanik, Nrich,
1926, pp. 131-137) for the approximate solution of Dirichlet's p.ro-
blem for Laplace'8 equition, in circumstances where Hallorkin's
method is inapplicable. Z-Abutractor's nates Hallorkin's method
not stated. 7 The two-dimensional case of Laplace's problem is con-
sidered for a region bounded by a simple Jordan contour which may
be expressed in arametric form: x, = x(t), y = y(t) (0,4..-. 41),
where x(t) and yft) are piece-wise elementary, and the contour is
piecf!-wise smooth. By means of Keldysh's theorem /-Abstractoro--
note: Theorer, not stated-7, and the Gram-6chnidt Brthogonalizat 4 or.
Card 112

33870
S/6@)6/6 1 /001 /000//,,',OA/007
On Interpreting the method ... D231ID304
procens /-Abstractor's notej Pron*ess not described_7, tile solution
io fourid in the form of it partial sum of a Folirler series. The fol--
1cwing theorei,.1 ia established: If the boundary function f(t) is
continuous, then the nth approximation giver, by the partial sum
convergea uniformly to the t;olution of the problem as n In any
region lying wholly within D, where D iv the r glon bounded ty the
crintour (1). It is recommended U13 t the cal,@ulaticnu arising from
thin problem be performed by a computer anJ programming details
are given. The case of an arbitrary polygonal region Is considered
as an example. The necessary operations to be carried out are lis-
ted ,,ind suitable codes proposed for determining the polynomIale
in the banic program and for ut3e in uub-prko@-rumming. The detallp
of the codes are given in tabular form. There are 5 tables and 10
eferen,ces: Soviet-bloc arid I nori-Soviet-Uo-
Curd 2/2

3/044j62/000/00!/060/061
C I P/C 122 2
AUTHORt Stogniy,,_A, .A.
-I'ITLEs
The s@-nthesis of an ubstr.@ct aqtomal a,-@;z-Jirp. @u tte
tvec.ts it producas or; ar. elsictrcni,,. dtgi@il
MA M )LET SM]
PERIODIG,, Referativr,.yy zhurnal, Matematika, no 1. 11)Q@ t-I t",
abstract IV367, ("Zh. vjchisl matez. i z,,lem, fi:P
1961, 1. no. 3, 545-548)
rFM An algorithm is described to constru@:t thp tabls@ r@,
transitionj an automut which represents an even* after the ref,-;Ia@
:eKistrvion rif this even!. The described synthesis-slgrra-thm
---ely frunsforms the regular expression into one consistti, If -:W!umnLi
Of the fabli-, ul' automat transitions written one after the ofheT (4far'I-F,@
-xith the first). Given is an algorithm to minimize the tablle of !-an-:-
* ion5; Re6ardinc; the descrited algorithm for the
iutomat fr(@m the regular registrations of its repreaented eventq, 'A
pr-gram fur the computer "Kiyev" has beer, set-up ;unlainlit-i& s1:17.e 100
,e.,mmands. The experiments conducted with this cczputer kuvs sinwn lhl@,
:t is po3sible to use a middle-sized computer to zin@zi.;@
Card 11A

S/044/62/00/00-/060/061
The oyritheol;; of' an abstract auto=at - CJII/C222
ub,@@Irqc' with a transition table of n - r-, 7CO -*- t7w
,)1emenTI* (depending on the volume of the nem@-ry),
F,Abztra:terIs note; Complete translation.] 40)(0,0
CqrI 11-/?

STOGITRY A.A.
Principlen of constructing oelf-instruction, syntomse Zhur,vycb.mat,
i mat.fiz. 1 no.4:749-750 Jl-Ag 161, OIMIA 14 .- 8)
(Programming (Electronic computers))

RALUUNIN', L.A.; SMG.NIYF A..A.
Kiev section of cybernetics. Frobl. kib. no-630C-302 '61.
(MIRA 15:1)
(Xiev--Cybernetica)

STOGIUY. A. A.
"Algorithmical eystem for automation of digital automata oyntheals"
report submitted for the Intl. Symposium on ?clay Syste= and Finite Automata Theory
(IFAC), Moscow, 24 Sep-2 Oct 1962.

ACCESSION NR: AT4016402 8/3049/62/000/000/0019/00M
AUTHORt Glushkov, V. M.; GrishchmAo, N.M.; 56WAy.- A. A.
TITLE3 Algorithm for the recognition of intelligent sentesess
SOURCE: Printst"O postroyeWya sunodbuchayushakdMays mistem (Priestples of
construction of self-instrucUng systems). Sbornik materialov simpostuma, 1041. Kievg
Goatekhizdat UkrSSR, 1962, 19-26
TOPIC TAGS: artificial intelligence, syntax, data recognition, loarnW, self-izapmwbg
machine, learning algorithm, cybernetics
ABSTRACT: The problem of recognizing intelligent senteno" of ons particalar JM Is
formulated in the article. The authors consider a fWte met of (Russian lav~)
(substantives, verbs and propositions), from which sentences an be oonstswW &oooM-
ing to the scheme:
where ol to the subJe9t substantive; is the predicate veit" n Is do PrOilOW14014 ft go
the object substantive. Let there exist either a Hot of &H the Lddlipd sedomm WA
C.d

ACCENION NR: AT4016402 -
0
can be composed of the words of the proscribed met according to acbme (1) or a Cer9da
"obJect" capable of determining whether the sentence composed accordh* to the sabseso
does or does not make sense. The authors' task was to construct an algorithm which.
after processing a certain body of randomly selected sentences and establishing the pair-
wise correlations between the words of the initial set. could, in the first place, estsbRob
with a certain probability the intelligibility of formerly uneneountered sentences;
secondly, the algorithm was to reduce the possibility of incorrect answers as the number
of processed sentences'Increases by making use of an estimation of the outcome of Its
work on each sentence and an estimation of the 1@sslblilty of employing the list of all the
intelligent sentences, and, thirdly, as the numbir of processed sentences Incre"es,
reduce the mean time in processing one sentence in comparison with the mean time
necessary to review the list of all intelligible sentences. In order to realize the last two
points, the principle of instruction with a "teacher" and the principle of self-instruction
were used when formulating the algorithm. Ile authors describe in detall the develop-
ment of the algorithm. Two stages are distinguished: 1) from the set of sentences which
can be formed according to sEheme (1) by using all the words of the Initial group, (the
number of which equals nm(e + n + 1), where n, m and k are the number of hatial sub-
stantives, verbs qpd prepositions, respectively). the smallest subset is selected which
contains all the permissible mpteums; 2) from the subset of &11 permissible SOMISDO"
2/3
CWd

ACCESSION KRt AT401"02
sentences the intelligent exPre"ims are selected. Orig. arL b"I 3 brumd".
ASSOCIATIONs None
DATE AM 09&04 ZNCU 00
ED$ 00
BUD
SUB CODE: CP NO REF 9OV: 000 OTUM 0"
Cwd 3/3

ACCESBION NM AT4010404 8/3049/62/000/000/0052/0062
AUTHORs Stognly, A, As
I I.
TITLE: Some mathematical problems In the construction of a digital klical machine
SOURCE: Printsipy* postroyonlya. samobbuchayushchMsys Motem (Principles of 004-
struction of self-Instructing systems). Bbornik materialoy simporJulas, 1981. Kiev,
-62
Gostekhizdat UkrSSR, 1962, 52
TOPIC TAGS: programming, logical design. machine organization, machine language
ABSTRACT: Ile article discusses certain considerations concerning the ox0ansion of
the design and operational capabilities of existing general purpose digital computers In
terms of their adaptation to the solution of logical problems. It is pointed out that the
pecullar properties of digital computers make it necessary to simulate the information
and operations of logical problems In the language of arithmetic operational bits and
elementary operations. Ito problems center around the problem of filling the memory
of the computer, since the operative elements of information, which for their coding
require k-place binary numbers, must be placed in 40-place colls. The difficulties can-
sidered lead, In the opinion of the author, to a two-fold result. In the first place,
programming of logical problem on digital computers, in itself a difficult task, is
1/2
Card

ACCESSION NR: AT4016404
artificially complicated by purely technical considerations. Secondly, during the solutica
of logical problems on digital computers there is an incomplete utilization of the VAwth
of operational possibilities made available by the machines. These difficulties have to
do less with the actual programming of nonarithmetical problems than with their subso-
quent realization. Machine difneuitiesaresaid to be temporary In nature. The author
has analyzed algorithms for the solution of certain standard logical problems and has
formulated, on this basis, requirements for memory design and prescraw the set of
operations useful in the machind solution of this class of nonarithmetical problems.
Orig. art. has: no graphics.
ASSOCIATION: Nww
StMMITTED: 00
SUB CODEt CP
2/2
Cwd
DATE ACQs OWanG4
NO SOV REFt 007
ENC14 00
OTHERt 00

h1871i
S,(38Z62,DDOj,007jOD7,M
1011/1211
AUTHOR: Sto,sruy, A..,_A._,(_Kiycv)
TITLE*: Solving a problem asuxiated *if h the differentiation of functions on an clectroffic digital
computer
SOURU: Problemy kibernetiki. no 7,1962,189-1"
TEXT: Academician A.A. Dorodnitsyn has raised the problem or programming the construction and suc-
cessive computation or a scrics for the solution or an ordinary differential equation in the vicinity of a singular
point [Ref. I.- Konferentsiya "Puti raMtiya sovetskogo maternaticheskogo mashinosttoyeniya i priborostro-
yeniya", Plenarnyye tAsedaniya,VINITI. 1956(Conferenceon -Ways o(development of the Soviet mathematical
engineering and instrumert-making industries". Plenary sasions. VINITI. 1956)1.
It is known that a program for the differentiation of functions in one or morevariables wascompiled abroad.
but the principles of its construction were not publi4had,
The main ideas that underlie the construction of a program for diffetentiating
Z-J(x,y@ wherey-)jx)
and its use for solving an ordinary differential equation in the vicinity of a singular point are given in this pa;w.
Card 1/3

Solving a problem associated with... S/592/62,VW/W7jW7jM
1011/1211
Formulas are writtcn doAn in Lukashe%*h's br2ckefless form thus enabling one to minimize the number
of cells occupied by them in the memory without making the ptogiamming more complec
The differentiation is carried out by t%o algorisms. The, first cattics the diff6entiation symbol 1) into the
formula according to the laws of differentiation. while the latter diff6critimes the clemertary functions accor-
ding to a table of derivatives. The first of these algorisms is explained in detail verbally and by the use of a
a graphic scheme.
A program for the differentiation of functions in one variable of NIIISM S. A- Lebod". Dashevskiy L. N..
Shkabara Ye. A., [Ref. 7. Malaya ciektromnaya schetuaya nushiria. Lrd-vo AN SSSR. 1952 (The Small Elect-
tonic Computing Machine**. AS USSR Publishing Muse. 1932)1 comprises about 250 orders. Bezause of the
small memory of Nil--*S,,%l the function in sin x *as chosen for differentiation on it. A full
list of the steps in this differentiation is given
I he existaxt or (he differentiating program enables one to construct scric-. with cocilkients that depend on
the values of the derivatives or a function at a given point A program (of the construction and computation
of a partial sum of Taylor's series for a function given by an ordinary differential equation of the n-th order
is discussed in principle. This solves the problem raised by l3orodnitsyn.
Card 2/3

Solving a problem aisociated with
S/582162/(MMM/007MM
101111211
The author's thanks his scientific instructor V. M. Glushkov as well as L, A. Kaluzhuin and A. P. Yershov
There are 2 figurc%. The English-language reference reads as follows: Iloppet and Mauchly. Influence of
Programming Tochniques on the Dcsign of Computers, proceedings of IRE. 41, 10, 1953, 1250-1254.
SUBMITTED June 10. 1958 (initially)
November 1. 1960 (after revision)
t
Card 3/3

STOGNITt A. A.
Coordination of research vork on cybernetics in the Ukraine.
Zhur. vych. mat. i mat. fiz. 2 no.5:953-955 S-0 162.
(KIRA 16tl)
(Ukraine--Cybernatics-Research)

STOGNTY, A.A.
Nov monograph on cybernetics. XTI no.2:38-39 163.
(MIRA 161ll)
1. UcheTqy sekretarl Sovete po kibernatike AN Ukz6SR,
9. Kiyev.

ACCESSION NR: AT4016489 S/2582/63/OLV/010/0151/0163
AUTHOR: Stoqnly, A. A. (Kiev)
TITLE: One structur@
4ariant of a digital machine for the conversion of alphabe-
tic Information
SOURCE: Probltmy-@@ Mbernetlkl, no. 10, 1963. 151-163
TOPIC TAGS: comptiter design, digital computer, analytic differentiation, minimiza-
tion, Blake method, abstract automation, Image recognition. fixed address program,
alphabetic Information, alphanumeric conversion, logical problem, digital logic ma-
chimn. operational memory
ABSTRACT: The author discusses the specific design and operational characteristics
of digital computers which reflect the specific nature of the computational prob-
Ivns the avichine Is built to handle. It Is pointed out that these particular fea-
tures of the machine give rise to considerable difficulties when computers are em-
ployed to solve problems of a non-arlthmetic character (logical problems). These
difficulties are discussed., A second shortcoming encountered when using digital
computers for the solution of IcKjlcal problems Is the Incomplete exploitation of
the rich operational capabilities of electronic machines. The presence of a large,
nnd!aver-expanding, class of logical problems which are awaiting solution as well
1/3

I
I;ACCESSION NR: AT4016489
as the aforementioned difficulties encountered when attacking these problems on con-
ventional digital equipment naturally led to the thought or the creation or what
the author has called "digital logic machines" (OLM). In the present article, an
attempt is made to formulate the structural requirements of the operational memory
device (OMO) and the system of operations of a digital machine designed for the con*
version of alphabetic Information. in the development of these requirements the
author has based his work on an analysis of a number of programs for the solution
of non-arittimetic problems on the MESH. "Ural" and "Kiev" electronic digital corn-
Vuters. These problems Include the analytic dif(erentiation of elementary func-
tiom., t1v minIml7atlon of Boolean functions by the Blake method, the synthesis of
an abstract automaton according to the event represented by It and the simplifica-
tion of the (low tables of an abstract automaton, the teaching of Image recognition,
an algorithm for the recognition of sensible sentences and some algorithms for
equivalent transform-it Ions of formulas of the algebra of statements and the alge-
bra of predicates. In separate sections of the article, the author considers: 1)
the- structure of the operational memory; 2) the system or operations; 3) the
structure of the commands of the syitem. The memory of the machine In question Is
described as a sequence of numbered single-bit binary cells. The author also dis-
cusses the possibi I Ity of forming compound Information words on the "content level";
that Is, on the level at which the properties of the Information elements them-
ili-lVes 27re taken Into consideration. Because of the structure adopted In the

11 LFJ,
ACCESSION NR; AT4016489
operational memory device of the machine described In the paper, the Ilmitatiom of
a fixed address for the commands Is eliminated. Each program connamd, responsible
for the execution of one of theciperations, Is written In several cells; In the
first command ceii are found the code of the operation and the special attributes,
while the subsequent cells hold the values or codes of the argument and the dIqI-
tal parameters of the given operation (address). OrIgs arts has: numerous equa-
tions.
ASSOCIATION: none
SUBMITTED! 29Jan62 DATE ACQ: 20Feb64 ENCL: 00
SUB CODE: DP NO @EF SOV: 017' OTHER: 005
r- 4 3/3
----------------

T. 1113?-61 EWT(d)/FCC(w)/EW AFFTC TJr(C
MR: AT3002150 '@2/000/000/0111/01-13 r3
ACCISSION S/M3/
AUZHOR: Stogniy, A. A. 5@z
TnW.o Obe method for solving the Neumann problem for the Laplace equatiod,on an
electronic computer
SOURM: "hislltellneiya matemUka I tekhnik&; trAy* ASPIrantOY ZbetItUfA
kibernatiki AN USSR. Izd-vo AN USSR, 111-W
TCPIC TAW: Neumann problem, laplue's equation, co@Vuter aolving Niumenn problem
ABSTMOT: A harmonic function in a closed region D can be approximated (M. V.
Koldy*sb, Deterizdalng the function of a coWlex variable by polynomial series In
closed regions, Hat. sb., v. 16/58p 1945) bZ-harmonic polynomials to any specified
accuracy. ?he Neuman problem (Enclamrs 1) Is considered, and the following
digital-computer subprogramis an coMiled: setting up the rundamenUl barmonic
polynomials, analytical differentiating of polynomials, raising a bloomial to a
power, adding and maltiplying polynomials, evaluating a polynceLial at s. Point,
analytical Integrating of polynomlals, calculating determinants, and mAltIplying
matrices. "The problem was formill ted by V. X. Olushkov.0 Orig. art. has 8
formu'As.
Card ASSOCIATIONs Institute of Cybernetics
.. ............ .. ......

- : , ; k ; , ; " .4, , @'. . t
@ @ rig, "4, . r - .@-,rk 1 n *J-@ , 1, . n,: t @ t:., I n %@,r r 't I lip .
.f I
i"-fit'll . @il!. '.A-Ill I n, " x@ ;-A j, ":If) I
_ . . 1. 4 , I -

STOG?aT A.A, (Kiyev)
Structural variant of a digital c=;;uter for transforming letter
information* Problo kib. no,10sl5l-163 163,
(MIRA 1814)

GUSI K(1!14 I I tv. v(-,(! A. I., ctv-
A.A.t red.;
ii @ I
A.!,*... red.; :,YArtl;w, A.A., red.; YL@SKAUFI'q
I.S,,, red.; FUME67, G.Yo.,, red.; T.I., red.:
SAP. 11"VALOV, K.G., red I IPDFF:YFV,
-,;sr
rcd.; lllc1mtBkP* 0!@i. @rcd.*; IU61 r"O; '
ly , A.A.,
red.; KAPITONICNA, Yu.V., red.; red.
[P.-c-lblern of' Uvrlorotic:,l 7-proo-Y tooretiche-
skot
OMIRA IF.9
1. Akridemlyr, nauk U'A@:R,

L 5456t-t6 Lar(d)/6,-.'r(mjAm-'(w)A,1i (v
J.Jj ( c)n 1 (3G
I X6
ACCrSSION NII: AP5012125 U11/07 8/65/000/001/007 4/0082
A. A.
AUTHOR, Glushkov, V. hi, ; Letichavskly, A. A.
Ti'rLE: Input languages for an engineering design computer
SOURM Kibernotika, no. 1, 19650 74-82
TOPIC TAGS- computer language, engineering design computer, modified AW-01-,60,
computer proEamming V"
ABSTRACT: An Input language for a computer earmarked for engineering computations Is
described. The machine should- 1) handle limited problems since It Is able to Mtore A
small amount of Initial data; 2) use a simple input language and readily accept Initial data.
3) handle the problem completely automattenily; 4) incorporate a convenient (partially
seiniatitornatic) setup, for accepting and presenting Information; and 5) be reliable and moder-
ate In cost. The Input languagre haa much In common with the ALGO1,60 language C-Neept
that it lins n gimpler program structure and a somewhnt different description F;yntu. The
article presents: 1) the basic symbols, Identifiero, and nitmbers, 2) arithmetic expres-
!Card 1/2

L 54581-65
ACCESSION Nit: AP5012125
sions, 3) the oporittors, 4) a descriptive parto and 4) it program outline with examples.
Orig. art. has: 8 formulas.
ASSOCIATION: None
SMUTTED: 16Nov64 ENCL: 00 BUD CODE: DP
NO REF SOV: 000
Card 2/2
OTHER: 000

L 04428-67 E'dT(d)/EWP(1) IJP(e) BB/00/31)
ACC NR: AT6014Z93 SOURCE CODE: UR/0000/65/000/000/0342/0345
AUTTIOR: Glushkov, V. M. (SSSR). Lctichevskiy, A. A. (SSSR), Slognly, A. A.
(SS510
ORG: none
TITLE: Algorithmic system for automating the synthesis of digital autornata
SOURCE: International SyMizosium on the TheorX gf.1telaX SXs1e
nULAM
Automata. Moscow, 196Z. Sintez releynykh struktur (Synthesis of relay
structures); trudy simpoziuma. Moscow, Izd-vo Nauka. 1965, 34Z-345
0@%o t.- Vh
TOPIC TAGS: discrete automaton %45-,,r iVk coft
ABSTRACT: ProgramAre being developed (at the Institute of @3gh-rn-01r-Qfor
abstract, structural, and combinational synthesis of digitalautornataonalgenera,11
purpose digital computer. As Input Information, these forms are used; (1) A set
of regular formulas (for abstract synthesis); (2) A now and output table (for
structural synthesis); (3) A system of dnf Boolean functions t to es 0 the automaton
Catd I /Z

L 04428-67
ACC NR: AT6014293
feedback-loop functions (for combinational synthesis). A limited operating
experience of the authors permits concluding that a "Kiev"-type computer (10000
operations per sec. 1024 40-digit elements in the internal storage) is suitable for
automata synthesizing. In a discussion. A. Zakrevskiy stated that the above types,
of programs are liable to rapid obsolescence. A better solution would be to
develop a special language based on simple and universal operators that constitute
the synthesizing algorithms; such a special language could be coordinated with a
general (e.g. , ALGOL) language. Orig. art. has: I formula,
SUB CODE: 09 SUBM DATE: Z7Aug6S ORIG REF: 003
awn
Cord 212
L

7 rV
as
vs
41 -IL"A P-129
Fiv t@ v

STOGNITO B,So, inshe
Differential proteation system of generators using saturable
tranereactorms Energo I slektrotakbo prom* nos2123-26 Ap4e 165a
(MIRA ISO)