tccorpus.txt

# 1
preliminari report intern algebra languag cacm decemb 1958 perli a
j samelson k ca581203 jb march 22 1978 8 28
pm 100 5 1 123 5 1 164 5 1
1 5 1 1 5 1 1 5 1 205
5 1 210 5 1 214 5 1 1982 5
1 398 5 1 642 5 1 669 5 1
1 6 1 1 6 1 1 6 1 1
6 1 1 6 1 1 6 1 1 6
1 1 6 1 1 6 1 1 6 1
165 6 1 196 6 1 196 6 1 1273
6 1 1883 6 1 324 6 1 43 6
1 53 6 1 91 6 1 410 6 1
3184 6 1 
# 2
extract of root by repeat subtract for digit comput cacm
decemb 1958 sugai i ca581202 jb march 22 1978 8
29 pm 2 5 2 2 5 2 2 5
2 
# 3
techniqu depart on matrix program scheme cacm decemb 1958 friedman
m d ca581201 jb march 22 1978 8 30 pm
3 5 3 3 5 3 3 5 3 
# 4
glossari of comput engin and program terminolog cacm novemb 1958
ca581103 jb march 22 1978 8 32 pm 4 5
4 4 5 4 4 5 4 
# 5
two squar root approxim cacm novemb 1958 wadei w g
ca581102 jb march 22 1978 8 33 pm 5 5
5 5 5 5 5 5 5 
# 6
the us of comput in inspect procedur cacm novemb 1958
muller m e ca581101 jb march 22 1978 8 33
pm 6 5 6 6 5 6 6 5 6
477 5 6 6 6 6 
# 7
glossari of comput engin and program terminolog cacm octob 1958
ca581003 jb march 22 1978 8 35 pm 7 5
7 7 5 7 7 5 7 
# 8
on the equival and transform of program scheme cacm octob
1958 friedman m d ca581002 jb march 22 1978 8
36 pm 8 5 8 8 5 8 8 5
8 
# 9
propos for an uncol cacm octob 1958 conwai m e
ca581001 jb march 22 1978 8 37 pm 9 5
9 9 5 9 9 5 9 
# 10
glossari of comput engin and program terminolog cacm septemb 1958
ca580903 jb march 22 1978 8 39 pm 10 5
10 10 5 10 10 5 10 
# 11
the problem of program commun with chang machin a propos
solut part 2 cacm septemb 1958 strong j wegstein j
tritter a olsztyn j mock o steel t ca580902 jb
march 22 1978 8 41 pm 1781 5 11 1988
5 11 11 5 11 11 5 11 11 5
11 123 6 11 196 6 11 919 6 11
990 6 11 1007 6 11 1046 6 11 1131
6 11 1139 6 11 1140 6 11 1149 6
11 1198 6 11 1215 6 11 1223 6 11
1265 6 11 1303 6 11 1323 6 11 1358
6 11 1366 6 11 1421 6 11 1460 6
11 1462 6 11 1463 6 11 1467 6 11
1468 6 11 1477 6 11 1491 6 11 1496
6 11 1496 6 11 1531 6 11 1535 6
11 1565 6 11 1601 6 11 1602 6 11
1613 6 11 1614 6 11 1626 6 11 1641
6 11 1787 6 11 1788 6 11 205 6
11 224 6 11 249 6 11 288 6 11
316 6 11 381 6 11 381 6 11 398
6 11 11 6 11 11 6 11 14 6
11 404 6 11 410 6 11 463 6 11
464 6 11 483 6 11 3184 6 11 3188
6 11 584 6 11 600 6 11 680 6
11 691 6 11 763 6 11 799 6 11
# 12
error estim in rung kutta procedur cacm septemb 1958 call
d h reev r f ca580901 jb march 22 1978
8 56 pm 12 5 12 12 5 12 12
5 12 
# 13
glossari of comput engin and program terminolog cacm august 1958
ca580805 jb march 22 1978 8 57 pm 13 5
13 13 5 13 13 5 13 
# 14
the problem of program commun with chang machin a propos
solut part 1 cacm august 1958 strong j wegstein j
tritter a olsztyn j mock o steel t ca580804 jb
march 22 1978 9 02 pm 1159 5 14 1988
5 14 381 5 14 14 5 14 14 5
14 14 5 14 1496 6 14 381 6 14
11 6 14 14 6 14 14 6 14 14
6 14 
# 15
recurs curv fit techniqu cacm august 1958 giblin j ca580803
jb march 22 1978 9 02 pm 15 5 15
15 5 15 15 5 15 75 5 15 15
6 15 94 6 15 
# 16
secant modif of newton s method cacm august 1958 jeev
t a ca580802 jb march 22 1978 9 03 pm
16 5 16 16 5 16 16 5 16 39
5 16 16 6 16 
# 17
on program of arithmet oper cacm august 1958 ershov a
p ca580801 jb march 22 1978 9 04 pm 1134
5 17 17 5 17 17 5 17 17 5
17 83 5 17 17 6 17 17 6 17
77 6 17 408 6 17 
# 18
simpl automat code system cacm juli 1958 adam e s
schlesing s i ca580701 jb march 22 1978 9 06
pm 18 5 18 18 5 18 18 5 18
# 19
glossari of comput engin and program terminolog cacm june 1958
ca580603 jb march 22 1978 9 07 pm 19 5
19 19 5 19 19 5 19 
# 20
acceler converg of iter process a techniqu is discuss which
when appli to an iter procedur for the solut of
an equat acceler the rate of converg if the iter
converg and induc converg if the iter diverg an illustr
exampl is given cacm june 1958 wegstein j h ca580602
jb march 22 1978 9 09 pm 20 5 20
20 5 20 20 5 20 
# 21
algebra formul of flow diagram cacm june 1958 voorhe e
a ca580601 jb march 22 1978 9 10 pm 21
5 21 21 5 21 21 5 21 679 5
21 21 6 21 407 6 21 3184 6 21
# 22
unusu applic depart automat implement of comput logic cacm mai
1958 morri e f wohr t e ca580506 jb march
22 1978 9 11 pm 22 5 22 22 5
22 22 5 22 
# 23
binari and truth function oper on a decim comput with
an extract command cacm mai 1958 kautz w h ca580505
jb march 22 1978 9 12 pm 23 5 23
23 5 23 23 5 23 
# 24
an improv decim redund check cacm mai 1958 sisson r
l ca580504 jb march 22 1978 9 13 pm 24
5 24 24 5 24 24 5 24 
# 25
gener purpos program system cacm mai 1958 holt a w
ca580503 jb march 22 1978 9 14 pm 25 5
25 25 5 25 25 5 25 
# 26
a subroutin method for calcul logarithm cacm mai 1958 bemer
r w ca580502 jb march 22 1978 9 16 pm
26 5 26 26 5 26 26 5 26 848
5 26 26 6 26 35 6 26 
# 27
note on empir bound for gener bessel function cacm mai
1958 randel j b reev r f ca580501 jb march
22 1978 9 17 pm 27 5 27 27 5
27 27 5 27 
# 28
request for method or program cacm april 1958 corlei h
p t ca580402 jb march 22 1978 9 18 pm
28 5 28 28 5 28 28 5 28 
# 29
need for an algorithm cacm april 1958 selden w ca580401
jb march 22 1978 9 19 pm 29 5 29
29 5 29 29 5 29 
# 30
algorithm for analyz logic statement to produc a truth function
tabl cacm march 1958 wolp h ca580302 jb march 22
1978 9 20 pm 30 5 30 30 5 30
30 5 30 
# 31
ibm 704 code nundrum cacm march 1958 grumett m ca580301
jb march 22 1978 9 21 pm 31 5 31
31 5 31 31 5 31 
# 32
variabl width tabl with binari search facil cacm februari 1958
halpern m ca580201 jb march 22 1978 9 22 pm
32 5 32 32 5 32 32 5 32 
# 33
a program binari counter for the ibm type 650 calcul
cacm januari 1958 kenni b c hunter j a ca580103
jb march 22 1978 9 25 pm 33 5 33
33 5 33 33 5 33 
# 34
tabl for automat comput cacm januari 1958 wilf h s
ca580102 jb march 22 1978 9 26 pm 34 5
34 34 5 34 34 5 34 
# 35
a machin method for squar root comput cacm januari 1958
bemer r w ca580101 jb march 22 1978 9 27
pm 35 5 35 35 5 35 35 5 35
848 5 35 26 6 35 35 6 35 
# 36
a queue network simul for the ibm 650 and burrough
220 cacm decemb 1959 conwai r w johnson b m
maxwel w l ca591206 jb march 22 1978 3 35
pm 36 5 36 36 5 36 36 5 36
# 37
impact of comput develop cacm decemb 1959 humphrei s m
ca591205 jb march 22 1978 3 36 pm 37 5
37 37 5 37 37 5 37 
# 38
a propos interpret in algol cacm decemb 1959 iron e
t acton f s ca591204 jb march 22 1978 3
37 pm 38 5 38 38 5 38 38 5
38 
# 39
the secant method for simultan nonlinear equat a procedur for
the simultan solut of a system of not necessarili linear
equat a gener of the secant method for a singl
function of on variabl is given cacm decemb 1959 wolf
p ca591203 jb march 22 1978 3 39 pm 39
4 39 16 5 39 39 5 39 39 5
39 39 5 39 
# 40
finger or fist the choic of decim or binari represent
the binari number system offer mani advantag over a decim
represent for a high perform gener purpos comput the greater
simplic of a binari arithmet unit and the greater compact
of binari number both contribut directli to arithmet speed less
obviou and perhap more import is the wai binari address
and instruct format can increas the overal perform binari address
ar also essenti to certain power oper which ar not
practic with decim instruct format on the other hand decim
number ar essenti for commun between man and the comput
in applic requir the process of a larg volum of
inher decim input and output data the time for decim
binari convers need by a pure binari comput mai be
signific a slower decim adder mai take less time than
a fast binari adder do an addit and two convers
a care review of the signific of decim and binari
address and both binari and decim data arithmet supplement by
effici convers instruct cacm decemb 1959 buchholz w ca591202 jb
march 22 1978 3 47 pm 40 5 40 40
5 40 40 5 40 
# 41
some note on comput research in eastern europ cacm decemb
1959 nadler m ca591201 jb march 22 1978 3 48
pm 41 4 41 41 5 41 41 5 41
41 5 41 67 5 41 
# 42
a new method of comput of squar root without us
divis cacm novemb 1959 sarafyan d ca591106 jb march 22
1978 3 50 pm 42 5 42 42 5 42
42 5 42 
# 43
a techniqu for handl macro instruct cacm novemb 1959 greenwald
i d ca591105 jb march 22 1978 3 51 pm
205 5 43 43 5 43 43 5 43 43
5 43 1 6 43 43 6 43 
# 44
runcibl algebra translat on a limit comput cacm novemb 1959
knuth d e ca591104 jb march 22 1978 3 52
pm 1134 4 44 1141 4 44 364 4 44
405 4 44 438 4 44 561 4 44 44
4 44 222 5 44 364 5 44 44 5
44 44 5 44 44 5 44 77 5 44
100 6 44 224 6 44 44 6 44 44
6 44 77 6 44 82 6 44 98 6
44 
# 45
flow outlin a substitut for flow chart cacm novemb 1959
gant w t ca591103 jb march 22 1978 3 53
pm 45 5 45 45 5 45 45 5 45
728 5 45 920 6 45 45 6 45 
# 46
multiprogram stretch feasibl consider the tendenc toward increas parallel in
comput is note exploit of thi parallel present a number
of new problem in machin design and in program system
minimum requir for success concurr execut of sever independ problem
program ar discuss these requir ar met in the stretch
system by a carefulli balanc combin of built in and
program logic techniqu ar describ which place the burden of
the program logic on system program supervisori program and compil
rather than on problem program cacm novemb 1959 codd e
f lowri e s mcdonough e scalzi c a ca591102
jb march 22 1978 3 57 pm 168 5 46
491 5 46 46 5 46 46 5 46 46
5 46 168 6 46 185 6 46 196 6
46 46 6 46 46 6 46 
# 47
russian visit to u comput cacm novemb 1959 zaitzeff e
m astrahan m m ca591101 jb march 22 1978 3
59 pm 47 5 47 47 5 47 47 5
47 
# 48
shift regist code for index applic in thi commun the
us of a shift regist code with n 10 is
describ for call 64 wireless telemet station in a fix
cyclic order a high degre of redund is us permit
a singl error correct code minimum distanc three code with
64 10 bit code word to be emploi as the
station identif code embed thi in the shift regist code
with period 1023 permit the code to be emploi without
punctuat each of the telemet station receiv simpli put receiv
on and zero into a shift regist each time the
given code combin aris identifi the particular station bar for
tuitou error combin of veri low probabl it ha been
call the commun describ the properti and applic of the
code in some detail and the find of the particular
exampl to be emploi on ural the soviet built drum
comput donat to the indian statist institut by the unit
nation technic aid administr untaa cacm octob 1959 nadler m
sengupta a ca591011 jb march 22 1978 4 07 pm
48 5 48 48 5 48 48 5 48 
# 49
scientif and busi applic oracl curv plotter cacm octob 1959
fike c t ca591010 jb march 22 1978 4 08
pm 49 5 49 49 5 49 49 5 49
# 50
statist program for the ibm 650 part ii cacm octob
1959 hamblen j w ca591009 jb march 22 1978 4
09 pm 50 5 50 50 5 50 50 5
50 
# 51
on the construct of micro flowchart cacm octob 1959 gorn
s ingerman p z crozier j b ca591008 jb march
22 1978 4 10 pm 249 5 51 51 5
51 51 5 51 51 5 51 196 6 51
303 6 51 51 6 51 
# 52
an effici method for gener uniformli distribut point on the
surfac on an n dimension sphere corrigendum cacm octob 1959
cook j m ca591007 jb march 22 1978 4 12
pm 52 5 52 52 5 52 52 5 52
# 53
recommend of the share algol committe cacm octob 1959 ca591006
jb march 22 1978 4 13 pm 214 5 53
53 5 53 53 5 53 53 5 53 1
6 53 53 6 53 91 6 53 
# 54
sale a simpl algebra languag for engin cacm octob 1959
brittenham w r clark k kuss g thompson h smith
a o ca591005 jb march 22 1978 4 14 pm
405 4 54 54 4 54 54 5 54 54
5 54 54 5 54 93 5 54 
# 55
an algebra translat cacm octob 1959 kaner h ca591004 jb
march 22 1978 4 15 pm 405 5 55 55
5 55 55 5 55 55 5 55 224 6
55 55 6 55 77 6 55 93 6 55
# 56
propos standard flow chart symbol cacm octob 1959 ca591003 jb
march 22 1978 4 16 pm 56 5 56 56
5 56 56 5 56 
# 57
j and it comput center cacm octob 1959 ca591002 jb
march 22 1978 4 17 pm 57 5 57 57
5 57 57 5 57 
# 58
lem 1 small size gener purpos digit comput us magnet
ferrit element the paper examin some of the question of
develop and construct of a gener purpos digit comput us
contactless magnet ferrit and capacit dezu long durat capacit memori
element develop at the laboratori of electr model vinityi an
sssr under the supervis of professor l gutenmach cacm octob
1959 machmudov u a ca591001 jb march 22 1978 4
21 pm 215 5 58 58 5 58 58 5
58 58 5 58 58 6 58 
# 59
survei of progress and trend of develop and us of
automat data process in busi and manag control system of
the feder govern as of decemb 1957 iii cacm septemb
1959 ca590910 jb march 22 1978 4 41 pm 59
5 59 59 5 59 59 5 59 
# 60
the alpha vector transform of a system of linear constraint
cacm septemb 1959 wersan s j ca590909 jb march 22
1978 4 42 pm 60 5 60 60 5 60
60 5 60 
# 61
ibm 709 tape matrix compil cacm septemb 1959 hornick s
d ca590908jb march 22 1978 4 43 pm 61 5
61 61 5 61 61 5 61 
# 62
multi dimension least squar polynomi curv fit cacm septemb 1959
lesh f h ca590907 jb march 22 1978 4 44
pm 62 5 62 62 5 62 62 5 62
# 63
octal diagram of binari concept and their applic to comput
design logic thi paper date back the genesi of binari
concept circa 5000 year ago and octal diagram about 4800
year ago as deriv by the chines ancient it analyz
the applic of binari triniti of the octal diagram to
modern electron digit comput design logic cacm septemb 1959 li
s t ca590906 jb march 22 1978 4 47 pm
63 5 63 63 5 63 63 5 63 
# 64
remark on algol and symbol manipul cacm septemb 1959 green
j ca590905 jb march 22 1978 4 47 pm 206
5 64 207 5 64 64 5 64 64 5
64 64 5 64 64 6 64 64 6 64
# 65
algol sub committe report extens cacm septemb 1959 dijkstra e
w heis w perli j a samelson k ca590904 jb
march 22 1978 4 49 pm 65 5 65 65
5 65 65 5 65 
# 66
a propos for a gener card code for 256 charact
cacm septemb 1959 bemer r w ca590903 jb march 22
1978 4 50 pm 66 5 66 66 5 66
66 5 66 
# 67
central european comput cacm septemb 1959 blachman n m ca590902
jb march 22 1978 4 52 pm 67 4 67
41 5 67 67 5 67 67 5 67 67
5 67 79 5 67 67 6 67 
# 68
the role of the univers in comput data process and
relat field a studi wa made of univers program in
the unit state in the field of comput data process
oper research and other close relat field univers polici organ
administr faculti student research curricula equip and financ were investig
an integr univers program is recommend reflect the convict that
mani present activ relat to comput will develop into disciplin
and as such ar the legitim provinc of the univers
scholar detail on a recommend graduat school of comput scienc
ar given cacm septemb 1959 fein l ca590901 jb march
22 1978 6 05 pm 1205 5 68 68 5
68 68 5 68 68 5 68 1100 6 68
1104 6 68 1107 6 68 68 6 68 
# 69
statist program for the ibm 650 part i a collect
is given of brief descript of statist program now in
us in univers comput center which have ibm 650 s
cacm august 1959 hamblen j w ca590804 jb march 22
1978 6 07 pm 69 5 69 69 5 69
69 5 69 
# 70
construct of a set of test matric thi paper develop
the equat and properti of a set of test matric
which ar us in the determin of the accuraci of
routin for find the invers determin and or eigenvalu of
a matrix cacm august 1959 aegert m j ca590803 jb
march 22 1978 6 09 pm 70 5 70 70
5 70 70 5 70 
# 71
propos for a feasibl program system thi paper propos design
a program facil itself involv a digit comput and a
program which will assist the prepar of larg scale real
time program thi facil is to be capabl of prepar
program for ani of a varieti of machin have characterist
similar to those of the facil s comput on of
the basic assumpt is that there will be enough random
access storag avail to avoid the necess for segment a
construct program in ani fashion other than a trivial on
while thi assumpt is somewhat unrealist it is intend to
provid an opportun to concentr on the other aspect of
program construct the program system should stress the discoveri in
sourc program statement of as mani error as possibl befor
attempt to construct an object program among the comput characterist
which ar advoc ar a program interrupt scheme a larg
set of charact and indirect address cacm august 1959 baglei
p r ca590802 jb march 22 1978 6 16 pm
71 5 71 71 5 71 71 5 71 
# 72
an educ program in comput cacm august 1959 hollingsworth j
ca590801 jb march 22 1978 6 18 pm 72 5
72 72 5 72 72 5 72 
# 73
a real time data assimil cacm juli 1959 gschwind h
w ca590705 jb march 22 1978 6 19 pm 73
5 73 73 5 73 73 5 73 
# 74
a high speed sort procedur cacm juli 1959 shell d
l ca590704 jb march 22 1978 6 20 pm 1919
5 74 74 5 74 74 5 74 74 5
74 852 5 74 864 5 74 865 5 74
864 6 74 1175 6 74 232 6 74 232
6 74 308 6 74 309 6 74 309 6
74 74 6 74 74 6 74 74 6 74
74 6 74 3187 6 74 
# 75
paramet estim for simpl nonlinear model cacm juli 1959 chow
w m ca590703 jb march 22 1978 6 22 pm
75 4 75 75 4 75 15 5 75 75
5 75 75 5 75 75 5 75 94 5
75 
# 76
binari convers with fix decim precis of a decim fraction
cacm juli 1959 taranto d ca590702 jb march 22 1978
6 23 pm 76 5 76 76 5 76 76
5 76 
# 77
on gat and the construct of translat cacm juli 1959
arden b graham r ca590701 jb march 22 1978 6
24 pm 1134 5 77 1141 5 77 364 5
77 405 5 77 438 5 77 44 5 77
77 5 77 77 5 77 77 5 77 561
5 77 100 6 77 224 6 77 224 6
77 224 6 77 224 6 77 249 6 77
303 6 77 393 6 77 17 6 77 44
6 77 55 6 77 77 6 77 77 6
77 77 6 77 77 6 77 77 6 77
77 6 77 77 6 77 93 6 77 98
6 77 408 6 77 
# 78
remark on the practic solut of characterist valu problem thi
paper is concern with the practic solut of characterist valu
problem for an ordinari differenti equat it is at onc
appar that sequenti comput be thei digit or analog solv
initi valu problem rather than boundari valu problem and some
mathemat process must be found to compens for the machin
s inadequaci compens for machin imperfect is of cours the
normal activ of the numer analyst a number of other
paper have appli particular devic to particular problem the purpos
of thi note is to establish a mathemat framework or
model for these practic procedur and thu assist in the
us and extens of the idea in other particular problem
cacm june 1959 wouk a ca590606 jb march 22 1978
6 30 pm 78 5 78 78 5 78 78
5 78 
# 79
program for a machin with an extend address calcul mechan
cacm june 1959 schecher h ca590605 jb march 22 1978
6 31 pm 67 5 79 79 5 79 79
5 79 79 5 79 79 6 79 
# 80
a techniqu for comput critic rotat speed of flexibl shaft
on an automat comput cacm june 1959 schwartz b l
ca590604 jb march 22 1978 6 35 pm 80 5
80 80 5 80 80 5 80 
# 81
norc high speed printer cacm june 1959 gleissner g h
ca590603 jb march 22 1978 6 36 pm 81 5
81 81 5 81 81 5 81 
# 82
handl identifi as intern symbol in languag processor substitut of
comput orient symbol for programm orient symbol in languag processor
is examin and a feasibl method for do so is
present cacm june 1959 william f a ca590602 jb march
22 1978 6 38 pm 222 5 82 82 5
82 82 5 82 82 5 82 799 5 82
945 6 82 399 6 82 44 6 82 82
6 82 82 6 82 404 6 82 
# 83
a visit to comput center in the soviet union cacm
june 1959 carr iii j w ca590601 jb march 22
1978 6 39 pm 1134 4 83 83 4 83
1349 5 83 17 5 83 83 5 83 83
5 83 83 5 83 236 6 83 323 6
83 83 6 83 415 6 83 
# 84
survei of progress and trend of develop and us of
automat data process in busi and manag control system of
the feder govern as of decemb 1957 ii part 2
see ca590406 cacm mai 1959 ca590502 jb march 22 1978
6 42 pm 84 5 84 84 5 84 84
5 84 
# 85
error analysi in float point arithmet cacm mai 1959 carr
iii j w ca590501 jb march 22 1978 6 43
pm 1148 5 85 85 5 85 85 5 85
85 5 85 85 6 85 
# 86
survei of progress and trend of develop and us of
automat data process in busi and manag control system of
the feder govern as of decemb 1957 cacm april 1959
control gener of the unit state to the congress of
the unit state ca590406 jb march 22 1978 6 48
pm 86 5 86 86 5 86 86 5 86
# 87
a note on a method for gener point uniformli on
n dimension sphere cacm april 1959 muller m e ca590405
jb march 22 1978 7 04 pm 2333 4 87
87 4 87 2333 5 87 87 5 87 87
5 87 87 5 87 88 5 87 1793 6
87 87 6 87 88 6 87 
# 88
an effici method for gener uniformli distribut point on the
surfac of an n dimension sphere cacm april 1959 hick
j s wheel r f ca590404 jb march 22 1978
7 10 pm 2333 5 88 87 5 88 88
5 88 88 5 88 88 5 88 1793 6
88 87 6 88 88 6 88 88 6 88
# 89
a routin to find the solut of simultan linear equat
with polynomi coeffici cacm april 1959 larson e h marshal
d p ca590403 jb march 22 1978 7 12 pm
89 5 89 89 5 89 89 5 89 
# 90
binari arithmet for discret variabl word length in a serial
comput cacm april 1959 ercoli p vacca r ca590402 jb
march 22 1978 7 13 pm 107 5 90 90
5 90 90 5 90 90 5 90 90 6
90 
# 91
a mathemat procedur for machin divis cacm april 1959 gilman
r e ca590401 jb march 22 1978 7 14 pm
214 5 91 1593 5 91 91 5 91 91
5 91 91 5 91 1 6 91 1292 6
91 53 6 91 91 6 91 91 6 91
# 92
a checklist of intellig for program system a remark variat
exist in the degre of sophist of variou program system
a particular manifest is the jungl of assort devic for
reproduc limit human decis procedur an attempt is made here
to begin a systemat classif of the variou devic for
educ the comput to take over the decis make function
of on or mani human oper both those that have
been demonstr feasibl to date and those that ar highli
desir for the futur cacm march 1959 bemer r w
ca590304 jb march 22 1978 8 01 pm 92 5
92 92 5 92 92 5 92 
# 93
from formula to comput orient languag a techniqu is shown
for enabl a comput to translat simpl algebra formula into
a three address comput code cacm march 1959 wegstein j
h ca590303 jb march 22 1978 8 03 pm 405
5 93 54 5 93 93 5 93 93 5
93 93 5 93 224 6 93 55 6 93
77 6 93 93 6 93 93 6 93 
# 94
an iter method for fit the logist curv an iter
method is given for find a logist curv of best
least squar fit to a set of two dimension point
cacm march 1959 howel j ca590302 jb march 22 1978
8 04 pm 75 5 94 94 5 94 94
5 94 94 5 94 15 6 94 94 6
94 
# 95
elimin of special function from differenti equat a set of
ordinari differenti equat which contain mathemat function requir the us
of subroutin for numer solut by electron comput tabular data
for numer solut by hand calcul or function gener when
analog method ar appli can sometim be expand to an
equival set of equat which do not contain the function
thi is practic if these function satisfi suffici simpl differenti
equat thu among those function which can be elimin by
thi procedur ar the trigonometr invers trigonometr exponenti and mani
other transcendent function cacm march 1959 power j e ca590301
jb march 22 1978 8 08 pm 95 5 95
95 5 95 95 5 95 
# 96
on comput radiat integr the rel merit and cost of
four wai of evalu typic radiat integr contain spheric bessel
function ar investig these method ar desk machin evalu of
a finit seri integr of the appropri differenti equat by
a reev electron analog comput and by a litton 40
ibm 704 comput result ar gener applic to equat separ
from a helmholtz or wave equat cacm februari 1959 hansen
r c bailin l l rutishaus r w ca590205 jb
march 22 1978 8 16 pm 96 5 96 96
5 96 96 5 96 
# 97
signal corp research and develop on automat program of digit
comput cacm februari 1959 luebbert capt w f collom jr
capt p w ca590204 jb march 22 1978 8 19
pm 97 5 97 97 5 97 97 5 97
# 98
the arithmet translat compil of the ibm fortran automat code
system cacm februari 1959 sheridan p b ca590203 jb march
22 1978 8 21 pm 224 5 98 364 5
98 98 5 98 98 5 98 98 5 98
100 6 98 224 6 98 44 6 98 77
6 98 98 6 98 98 6 98 
# 99
possibl modif to the intern algebra languag cacm februari 1959
green j ca590202 jb march 22 1978 8 22 pm
99 5 99 99 5 99 99 5 99 
# 100
recurs subscript compil and list type memori cacm februari 1959
carr iii j w ca590201 jb march 22 1978 8
23 pm 205 4 100 210 4 100 214 4
100 1982 4 100 398 4 100 642 4 100
669 4 100 100 4 100 123 4 100 164
4 100 100 5 100 100 5 100 100 5
100 1 5 100 364 5 100 100 6 100
224 6 100 44 6 100 77 6 100 98
6 100 
# 101
nuclear reactor code cacm januari 1959 nather v sangren w
ca590101 jb march 22 1978 8 24 pm 101 5
101 101 5 101 101 5 101 
# 102
a comparison of 650 program method cacm decemb 1960 curtz
t b riordan j f spohn m ca601214 jb march
20 1978 6 18 pm 102 5 102 102 5
102 102 5 102 
# 103
cope consol oper profici examin each year electron comput becom
more sophist and the program thei must process becom more
complex becaus of thi depend of those in comput on
the skill and experi of oper is increas at the
same time select and train of qualifi oper grow more
difficult to meet the need for a quick accur uniform
oper test and train aid the author have develop cope
consol oper profici examin outlin below while thi examin is
program specif for the ibm 705 model ii with two
tape record coordin similar program could be develop for other
comput cacm decemb 1960 farbman d ketov r ca601213 jb
march 20 1978 6 23 pm 103 5 103 103
5 103 103 5 103 
# 104
digit simul of discret flow system the discret flow system
discuss ar character by the movement of randomli arriv item
along interact channel program a digit comput to simul such
system util some techniqu not common in other approach to
physic problem the princip portion of the paper is a
discuss of two simul studi that illustr some of the
program problem involv on is of an extens packag handl
plant with the object be optim of paramet such as
storag capac and process rate in the other air traffic
flow and control procedur ar simul to compar the effect
of altern control decis cacm decemb 1960 moor c j
lewi t s ca601212 jb march 20 1978 6 27
pm 104 5 104 104 5 104 104 5 104
# 105
two method for word invers on the ibm 709 cacm
decemb 1960 price r a jardin p d ca601211 jb
march 20 1978 6 28 pm 105 5 105 105
5 105 105 5 105 
# 106
a method for overlap and erasur of list an import
properti of the newel shaw simon scheme for comput storag
of list is that data have multipl occurr need not
be store at more than on place in the comput
that is list mai be overlap unfortun overlap pose a
problem for subsequ erasur given a list that is no
longer need it is desir to eras just those part
that do not overlap other list in lisp mccarthi emploi
an eleg but ineffici solut to the problem the present
paper describ a gener method which enabl effici erasur the
method emploi interspers refer count to describ the extent of
the overlap cacm decemb 1960 collin g e ca601210 jb
march 20 1978 6 33 pm 1024 4 106 1051
4 106 1102 4 106 1132 4 106 1390 4
106 1486 4 106 1549 4 106 1706 4 106
1826 4 106 1878 4 106 378 4 106 2060
4 106 2155 4 106 2168 4 106 2719 4
106 2723 4 106 2838 4 106 2842 4 106
2855 4 106 2879 4 106 3077 4 106 3080
4 106 3106 4 106 627 4 106 106 4
106 106 5 106 106 5 106 106 5 106
1050 5 106 210 5 106 1393 5 106 1549
5 106 2023 5 106 3112 5 106 627 5
106 849 6 106 106 6 106 106 6 106
106 6 106 106 6 106 106 6 106 106
6 106 196 6 106 1051 6 106 1380 6
106 209 6 106 1826 6 106 210 6 106
210 6 106 1878 6 106 296 6 106 1972
6 106 367 6 106 2438 6 106 2723 6
106 2736 6 106 2833 6 106 2838 6 106
406 6 106 627 6 106 627 6 106 731
6 106 731 6 106 731 6 106 753 6
106 
# 107
multipl precis arithmet cacm decemb 1960 pope d a stein
m l ca601209 jb march 20 1978 6 34 pm
107 4 107 107 5 107 107 5 107 107
5 107 1026 5 107 1258 5 107 1292 5
107 1497 5 107 90 5 107 107 6 107
107 6 107 107 6 107 107 6 107 1026
6 107 1026 6 107 1026 6 107 1292 6
107 1593 6 107 
# 108
program error correct in project mercuri cacm decemb 1960 dimsdal
b weinberg g m ca601208 jb march 20 1978 6
35 pm 108 5 108 108 5 108 108 5
108 361 5 108 108 6 108 
# 109
a note on approxim e x cacm decemb 1960 lubkin
s ca601207 jb march 20 1978 6 37 pm 109
5 109 109 5 109 109 5 109 
# 110
fibonaccian search cacm decemb 1960 ferguson d e ca601206 jb
march 20 1978 6 38 pm 110 5 110 110
5 110 110 5 110 
# 111
on program the numer solut of polynomi equat numer techniqu
ar present for comput the root of polynomi equat by
appli the recommend scale and invers rule the basic bairstow
and newton raphson iter techniqu can be appli with great
reliabl both a high degre of accuraci and rapid converg
ar realiz numer exampl ar shown to illustr the pitfal
and to show how these ar circumv by applic of
the recommend procedur cacm decemb 1960 ellenberg k w ca601205
jb march 20 1978 6 41 pm 111 5 111
111 5 111 111 5 111 
# 112
numer solut of the polynomi equat algorithm 30 cacm decemb
1960 ellenberg k w ca601204 jb march 20 1978 6
44 pm 112 5 112 112 5 112 112 5
112 
# 113
survei of code charact represent cacm decemb 1960 bemer r
w ca601203 jb march 20 1978 6 44 pm 113
5 113 113 5 113 113 5 113 
# 114
survei of punch card code cacm decemb 1960 smith h
j william f a ca601202 jb march 20 1978 6
45 pm 114 5 114 114 5 114 114 5
114 
# 115
optim their structur cacm decemb 1960 wheel r f ca601201
jb march 20 1978 6 46 pm 115 5 115
115 5 115 115 5 115 
# 116
the sumador chino on a recent motor trip through mexico
the writer came across on ad devic which wa refer
to as a sumador chino chines adder a survei of
the more avail literatur on the histori of mathemat and
on instrument of calcul ha uncov no refer to such
a devic the purpos of thi commun is to enlist
the help of other member in bring to light whatev
mai be known concern the evolut and present statu of
the sumador chino cacm novemb 1960 roger j l ca601119
jb march 20 1978 6 50 pm 116 5 116
116 5 116 116 5 116 
# 117
an estim of the rel effici of two intern sort
method cacm novemb 1960 nagler h ca601118 jb march 20
1978 6 51 pm 117 5 117 117 5 117
117 5 117 
# 118
charact scan on the ibm 7070 cacm novemb 1960 speckhard
a e ca601117 jb march 20 1978 6 52 pm
118 5 118 118 5 118 118 5 118 
# 119
note on eigenvalu comput cacm novemb 1960 andru j f
ca601116 jb march 20 1978 6 53 pm 119 5
119 119 5 119 119 5 119 
# 120
a simpl techniqu for code differenti equat cacm novemb 1960
sefton p vaillancourt r ca601115 jb march 20 1978 6
57 pm 120 4 120 120 5 120 120 5
120 120 5 120 175 5 120 
# 121
over all comput control and label cacm novemb 1960 holt
a ca601114 jb march 20 1978 6 58 pm 121
4 121 121 5 121 121 5 121 121 5
121 221 5 121 
# 122
least squar fit of a great circl through point on
a sphere cacm novemb 1960 dewitt l ca601113 jb march
20 1978 6 59 pm 122 5 122 122 5
122 122 5 122 297 5 122 122 6 122
# 123
compil for two comput with neliac neliac a compil base
on algol wa develop at the u navi electron laboratori
san diego california as a boot strap compil for the
remington rand univac countess comput thi compil wa us to
gener a version of itself which run as a countess
program gener machin code for the control data corpor cdc
1604 all three version of neliac accept essenti ident input
languag cacm novemb 1960 masterson jr k s ca601112 jb
march 20 1978 7 03 pm 205 4 123 210
4 123 214 4 123 249 4 123 254 4
123 272 4 123 1102 4 123 1109 4 123
1140 4 123 1188 4 123 1306 4 123 1464
4 123 1491 4 123 1767 4 123 1781 4
123 1787 4 123 1949 4 123 1982 4 123
321 4 123 398 4 123 2059 4 123 2126
4 123 435 4 123 437 4 123 463 4
123 483 4 123 491 4 123 2732 4 123
560 4 123 583 4 123 3073 4 123 627
4 123 631 4 123 632 4 123 637 4
123 642 4 123 642 4 123 644 4 123
653 4 123 669 4 123 680 4 123 761
4 123 762 4 123 763 4 123 100 4
123 123 4 123 123 4 123 123 4 123
140 4 123 164 4 123 919 4 123 989
4 123 123 5 123 123 5 123 123 5
123 165 5 123 196 5 123 1 5 123
1781 5 123 637 5 123 123 6 123 123
6 123 165 6 123 196 6 123 919 6
123 990 6 123 1007 6 123 1046 6 123
1131 6 123 1139 6 123 1140 6 123 1149
6 123 1198 6 123 1215 6 123 1223 6
123 1265 6 123 1303 6 123 1323 6 123
1358 6 123 1366 6 123 1421 6 123 1460
6 123 1462 6 123 1463 6 123 1467 6
123 1468 6 123 1477 6 123 1491 6 123
1496 6 123 1531 6 123 1535 6 123 1565
6 123 1601 6 123 1602 6 123 1613 6
123 1614 6 123 1626 6 123 1641 6 123
1787 6 123 1788 6 123 205 6 123 224
6 123 249 6 123 288 6 123 316 6
123 381 6 123 398 6 123 11 6 123
404 6 123 410 6 123 463 6 123 464
6 123 483 6 123 3184 6 123 3188 6
123 584 6 123 600 6 123 680 6 123
691 6 123 763 6 123 799 6 123 
# 124
an algorithm for the assign problem the assign problem is
formul and briefli discuss an effici algorithm for it solut
is present in algol code an empir relat between solut
time and the size of the problem is given base
on extens experi carri out on a digit comput cacm
novemb 1960 silver r ca601111 jb march 20 1978 7
05 pm 124 5 124 124 5 124 124 5
124 2133 5 124 2134 5 124 124 6 124
124 6 124 2134 6 124 
# 125
polynomi transform algorithm 29 cacm novemb 1960 mackinnei j g
ca601110 jb march 20 1978 7 06 pm 125 5
125 125 5 125 125 5 125 1816 5 125
125 6 125 
# 126
least squar fit by orthogon polynomi algorithm 28 cacm novemb
1960 mackinnei j g ca601109 jb march 20 1978 7
08 pm 126 5 126 126 5 126 126 5
126 
# 127
assign algorithm 27 cacm novemb 1960 silver r ca601108 jb
march 20 1978 7 09 pm 127 5 127 127
5 127 127 5 127 
# 128
rootfind iii algorithm 26 cacm novemb 1960 herroit j g
ca601107 jb march 20 1978 7 57 pm 128 5
128 128 5 128 128 5 128 
# 129
rootfind ii algorithm 15 cacm novemb 1960 forsyth g e
herriot j g ca601106 jb march 20 1978 7 59
pm 129 5 129 129 5 129 129 5 129
# 130
real zero of an arbitrari function algorithm 25 cacm novemb
1960 leavenworth b ca601105 jb march 20 1978 8 00
pm 130 5 130 130 5 130 130 5 130
# 131
solut of tri diagon linear equat algorithm 24 cacm novemb
1960 leavenworth b ca601104 jb march 20 1978 8 01
pm 131 5 131 131 5 131 131 5 131
# 132
math sort algorithm 23 cacm novemb 1960 feurzeig w ca601103
jb march 20 1978 8 03 pm 132 5 132
132 5 132 132 5 132 
# 133
riccati bessel function of first and second kind algorithm 22
cacm novemb 1960 oser h ca601102 jb march 20 1978
8 04 pm 133 5 133 133 5 133 133
5 133 
# 134
bessel function for a set of integ order algorithm 21
cacm novemb 1960 borsch supan w ca601101 jb march 20
1978 8 05 pm 134 5 134 134 5 134
134 5 134 1909 5 134 134 6 134 1023
6 134 1284 6 134 1316 6 134 
# 135
digit comput in univers iv cacm octob 1960 reev r
f ca601013 jb march 20 1978 8 07 pm 135
5 135 135 5 135 135 5 135 
# 136
a note on the calcul of interest cacm octob 1960
ingerman p z ca601012 jb march 20 1978 8 09
pm 136 5 136 136 5 136 136 5 136
# 137
evalu number express as string of english word cacm octob
1960 swift c j ca601011 jb march 20 1978 8
11 pm 137 5 137 137 5 137 137 5
137 
# 138
some thought on reconcil variou charact set propos corrigenda cacm
octob 1960 voorhe e a ca601010 jb march 20 1978
8 13 pm 138 5 138 138 5 138 138
5 138 
# 139
binomi coeffici algorithm 19 cacm octob 1960 kenyon r r
ca601009 jb march 20 1978 8 14 pm 139 5
139 139 5 139 139 5 139 
# 140
crout with pivot algorithm 16 cacm octob 1960 forsyth g
e ca601008 jb march 20 1978 8 15 pm 249
4 140 254 4 140 272 4 140 1102 4
140 1109 4 140 1140 4 140 1188 4 140
1306 4 140 1319 4 140 1464 4 140 1491
4 140 1767 4 140 1781 4 140 1787 4
140 1949 4 140 321 4 140 2059 4 140
2126 4 140 435 4 140 437 4 140 454
4 140 463 4 140 483 4 140 491 4
140 2732 4 140 560 4 140 583 4 140
3073 4 140 627 4 140 631 4 140 632
4 140 642 4 140 644 4 140 653 4
140 680 4 140 761 4 140 762 4 140
763 4 140 123 4 140 140 4 140 140
4 140 919 4 140 989 4 140 140 5
140 140 5 140 140 5 140 152 5 140
196 5 140 
# 141
some thought on parallel process cacm octob 1960 yarbrough l
d ca601007 jb march 20 1978 8 16 pm 141
5 141 141 5 141 141 5 141 
# 142
comment on a techniqu for count on cacm octob 1960
sherman p m ca601006 jb march 20 1978 8 18
pm 2952 4 142 2952 4 142 2952 4 142
142 4 142 142 4 142 142 4 142 142
5 142 142 5 142 142 5 142 162 5
142 163 5 142 192 5 142 362 5 142
2952 5 142 142 6 142 142 6 142 162
6 142 163 6 142 192 6 142 2185 6
142 2727 6 142 
# 143
a list of comput system program for the ibm 650
datatron 205 and univac ss 80 cacm octob 1960 romberg
a ca601005 jb march 20 1978 8 21 pm 143
5 143 143 5 143 143 5 143 
# 144
do it by the number digit shorthand present commun system
transmit singl charact in group of code puls between simpl
termin equip sinc english word form onli a spars set
of all possibl alphabet combin present method ar ineffici when
comput system ar substitut for these termin us numer represent
of entir word or common phrase rather than charact by
charact represent requir approxim on third of present transmiss time
thi save is reflect in overal cost other benefit accru
in code and languag translat scheme provis is made for
transmiss of pure numer and or binari stream and for
singl charact transmiss of non dictionari word such as the
name of peopl or place cacm octob 1960 bemer r
w ca601004 jb march 20 1978 8 27 pm 144
5 144 144 5 144 144 5 144 
# 145
automat grader for program class cacm octob 1960 hollingsworth j
ca601003 jb march 20 1978 8 28 pm 145 5
145 145 5 145 145 5 145 1270 5 145
1902 5 145 145 6 145 145 6 145 1270
6 145 3184 6 145 
# 146
the us of comput in engin classroom instruct on april
29 30 the comput committe of the colleg of engin
univers of michigan which act as a steer committe for
the ford foundat project on the us of comput in
engin educ held a special confer to discuss certain time
topic pertin to the ford project thi report contain a
condens transcript of the kei idea offer by the confer
attende on select topic cacm octob 1960 katz d l
ca601002 jb march 20 1978 8 37 pm 146 5
146 146 5 146 146 5 146 
# 147
report on a confer of univers comput center director cacm
octob 1960 ca601001 jb march 20 1978 8 38 pm
147 5 147 147 5 147 147 5 147 
# 148
digit comput in univers iii cacm septemb 1960 reev r
f ca600909 jb march 20 1978 8 41 pm 148
5 148 148 5 148 148 5 148 
# 149
a decis rule for improv effici in solv linear program
problem with the simplex algorithm cacm septemb 1960 dickson j
c frederick f p ca600908 jb march 20 1978 8
43 pm 149 5 149 149 5 149 149 5
149 
# 150
ration interpol by continu fraction algorithm 18 cacm septemb 1960
floyd r w ca600907 jb march 20 1978 8 44
pm 150 5 150 150 5 150 150 5 150
# 151
trdiag algorithm 17 cacm septemb 1960 spragu iii c d
ca600906 jb march 20 1978 8 45 pm 151 5
151 151 5 151 151 5 151 
# 152
crout with pivot algorithm 16 cacm septemb 1960 forsyth g
e ca600905 jb march 20 1978 8 47 pm 140
5 152 152 5 152 152 5 152 152 5
152 1319 5 152 454 5 152 152 6 152
152 6 152 152 6 152 196 6 152 1128
6 152 586 6 152 
# 153
comment from a fortran user cacm septemb 1960 blatt j
m ca600904 jb march 20 1978 8 48 pm 153
5 153 153 5 153 153 5 153 754 5
153 153 6 153 
# 154
rapidli converg express for evalu e x cacm septemb 1960
berin a ca600903 jb march 20 1978 8 49 pm
154 5 154 154 5 154 154 5 154 
# 155
trie memori cacm septemb 1960 fredkin e ca600902 jb march
20 1978 8 50 pm 155 5 155 155 5
155 155 5 155 944 5 155 2846 5 155
849 5 155 155 6 155 155 6 155 155
6 155 615 6 155 
# 156
an introductori problem in symbol manipul for the student cacm
septemb 1960 rosin r f ca600901 jb march 20 1978
8 51 pm 156 5 156 156 5 156 156
5 156 
# 157
digit comput in univers ii cacm august 1960 reev r
f ca600809 jb march 20 1978 8 54 pm 157
5 157 157 5 157 157 5 157 
# 158
rootfind ii algorithm 15 cacm august 1960 thacher jr h
c ca600808 jb march 20 1978 8 55 pm 158
5 158 158 5 158 158 5 158 
# 159
rootfind algorithm 2 cacm august 1960 thacher jr h c
ca600807 jb march 20 1978 8 56 pm 159 5
159 159 5 159 159 5 159 
# 160
rootfind ii algorithm 15 cacm august 1960 thacher jr h
c ca600806 jb march 20 1978 8 57 pm 160
5 160 160 5 160 160 5 160 
# 161
abbrevi word systemat corrigendum cacm august 1960 barrett j a
grem m ca600805 jb march 20 1978 8 58 pm
161 5 161 161 5 161 161 5 161 
# 162
a variant techniqu for count on cacm august 1960 frieden
h ca600804 jb march 20 1978 9 00 pm 142
5 162 162 5 162 162 5 162 162 5
162 2952 5 162 142 6 162 162 6 162
162 6 162 163 6 162 163 6 162 192
6 162 192 6 162 2185 6 162 2727 6
162 
# 163
count on on the ibm 7090 cacm august 1960 kutler
s s ca600803 jb march 20 1978 9 01 pm
142 5 163 163 5 163 163 5 163 163
5 163 2952 5 163 142 6 163 162 6
163 162 6 163 163 6 163 163 6 163
192 6 163 192 6 163 2185 6 163 2727
6 163 
# 164
a short studi of notat effici cacm august 1960 smith
jr h j ca600802 jb march 20 1978 9 02
pm 205 4 164 210 4 164 214 4 164
1982 4 164 398 4 164 642 4 164 669
4 164 100 4 164 123 4 164 164 4
164 164 5 164 164 5 164 164 5 164
1 5 164 
# 165
neliac a dialect of algol cacm august 1960 huskei h
d halstead m h ca600801 jb march 20 1978 9
03 pm 123 5 165 165 5 165 165 5
165 165 5 165 637 5 165 1 6 165
123 6 165 165 6 165 165 6 165 196
6 165 
# 166
program compat in a famili of close relat digit comput
cacm juli 1960 luebbert w f ca600707 jb march 20
1978 9 14 pm 166 5 166 166 5 166
166 5 166 
# 167
combin algol statement analysi with valid check cacm juli 1960
mcisaac p ca600706 jb march 20 1978 9 15 pm
167 5 167 167 5 167 167 5 167 
# 168
multiprogram schedul part 3 and 4 schedul algorithm and extern
constraint cacm juli 1960 codd e f ca600705 jb march
20 1978 9 16 pm 491 4 168 168 4
168 168 5 168 168 5 168 168 5 168
1713 5 168 1901 5 168 491 5 168 46
5 168 168 6 168 168 6 168 168 6
168 185 6 168 185 6 168 185 6 168
196 6 168 1751 6 168 1754 6 168 46
6 168 
# 169
the multilingu terminolog project cacm juli 1960 holmstrom j e
ca600704 jb march 20 1978 9 17 pm 169 5
169 169 5 169 169 5 169 
# 170
some thought on reconcil variou charact set propos cacm juli
1960 voorhe e a ca600703 jb march 20 1978 9
18 pm 170 5 170 170 5 170 170 5
170 
# 171
digit comput in univers part i cacm juli 1960 reev
r f ca600702 jb march 20 1978 9 20 pm
171 5 171 171 5 171 171 5 171 
# 172
complex exponenti integr algorithm 13 cacm juli 1960 beam a
ca600701 jb march 20 1978 9 21 pm 172 5
172 172 5 172 172 5 172 
# 173
atla a new concept in larg comput design cacm june
1960 ca600617 jb march 20 1978 9 22 pm 173
5 173 173 5 173 173 5 173 
# 174
interv estim of the time in on state to total
time ratio in a doubleexponenti process cacm june 1960 neal
w r ca600616 jb march 20 1978 9 24 pm
174 5 174 174 5 174 174 5 174 
# 175
the solut of simultan ordinari differenti equat us a gener
purpos digit comput cacm june 1960 anderson w h ca600615
jb march 20 1978 9 25 pm 120 5 175
175 5 175 175 5 175 175 5 175 175
6 175 
# 176
symbol manipul by thread list corrigendum cacm june 1960 perli
a j thornton c ca600614 jb march 20 1978 9
26 pm 176 5 176 176 5 176 176 5
176 
# 177
solut of polynomi equat by bairstow hitchcock method a a
grau commun acm februari 1960 algorithm cacm june 1960 thacher
jr h c ca600613 jb march 20 1978 9 31
pm 177 5 177 177 5 177 177 5 177
# 178
rootfind algorithm cacm june 1960 thacher jr h c ca600612
jb march 20 1978 9 32 pm 178 5 178
178 5 178 178 5 178 1667 5 178 178
6 178 1242 6 178 327 6 178 
# 179
evalu of the legendr polynomi pn x by recurs algorithm
cacm june 1960 galler g m ca600611 jb march 20
1978 9 35 pm 179 5 179 179 5 179
179 5 179 
# 180
evalu of the laguerr polynomi ln x by recurs algorithm
cacm june 1960 galler g m ca600610 jb march 20
1978 9 36 pm 180 5 180 180 5 180
180 5 180 
# 181
evalu of the hermit polynomi hn x by recurs algorithm
cacm june 1960 galler g m ca600609 jb march 20
1978 9 37 pm 181 5 181 181 5 181
181 5 181 
# 182
evalu of the chebyshev polynomi tn x by recurs algorithm
cacm june 1960 galler g m ca600608 jb march 20
1978 9 38 pm 182 5 182 182 5 182
182 5 182 
# 183
convers between float point represent cacm june 1960 perri c
ca600607 jb march 20 1978 9 40 pm 183 5
183 183 5 183 183 5 183 
# 184
a short method for measur error in a least squar
power seri cacm june 1960 robinson s m strubl g
w ca600606 jb march 20 1978 9 41 pm 184
5 184 184 5 184 184 5 184 
# 185
multiprogram schedul part 1 and 2 introduct and theori in
order to exploit fulli a fast comput which possess simultan
process abil it should to a larg extent schedul it
own workload the schedul routin must be capabl of extrem
rapid execut if it is not to prove self defeat
the construct of a schedul entail determin which program ar
to be run concurr and which sequenti with respect to
each other a concis schedul algorithm is describ which tend
to minim the time for execut the entir pend workload
or ani subset of it subject to extern constraint such
as preced urgenc etc the algorithm is applic to a
wide class of machin cacm june 1960 codd e f
ca600605 jb march 20 1978 9 46 pm 185 5
185 185 5 185 185 5 185 1713 5 185
1901 5 185 491 5 185 168 6 185 168
6 185 168 6 185 185 6 185 185 6
185 185 6 185 196 6 185 1751 6 185
1754 6 185 46 6 185 
# 186
an algorithm defin algol assign statement addendum cacm june 1960
floyd r w ca600604 jb march 20 1978 9 47
pm 186 5 186 186 5 186 186 5 186
# 187
compil connect cacm june 1960 swift c j ca600603 jb
march 20 1978 9 54 pm 187 5 187 187
5 187 187 5 187 
# 188
the depart of comput mathemat at moscow state univers cacm
june 1960 berezin i s ca600602 jb march 20 1978
9 56 pm 188 5 188 188 5 188 188
5 188 
# 189
the futur of automat digit comput cacm june 1960 booth
a d ca600601 jb march 20 1978 9 57pm 189
5 189 189 5 189 189 5 189 
# 190
bendix g 20 system cacm mai 1960 ca600507 jb march
22 1978 1 28 pm 190 5 190 190 5
190 190 5 190 
# 191
abbrevi word systemat cacm mai 1960 barrett j a grem
m ca600506 jb march 22 1978 1 29 pm 191
5 191 191 5 191 191 5 191 
# 192
a techniqu for count on in a binari comput cacm
mai 1960 wegner p ca600505 jb march 22 1978 1
30 pm 142 5 192 192 5 192 192 5
192 192 5 192 2952 5 192 142 6 192
162 6 192 162 6 192 163 6 192 163
6 192 192 6 192 192 6 192 2185 6
192 2727 6 192 
# 193
a start at automat storag assign cacm mai 1960 patrick
r l ca600504 jb march 22 1978 1 31 pm
193 5 193 193 5 193 193 5 193 
# 194
divisionless comput of squar root through continu squar cacm mai
1960 sarafyan d ca600503 jb march 22 1978 1 32
pm 194 5 194 194 5 194 194 5 194
# 195
what is a code cacm mai 1960 patterson g w
ca600502 jb march 22 1978 1 33 pm 195 5
195 195 5 195 195 5 195 
# 196
report on the algorithm languag algol 60 naur p backu
j cacm mai 1960 ca600501 jb march 22 1978 1
34 pm 123 5 196 140 5 196 196 5
196 196 5 196 196 5 196 919 5 196
989 5 196 1102 5 196 1109 5 196 1140
5 196 1188 5 196 1306 5 196 249 5
196 254 5 196 272 5 196 1464 5 196
1491 5 196 1767 5 196 1781 5 196 1787
5 196 1949 5 196 321 5 196 2059 5
196 2126 5 196 2732 5 196 435 5 196
437 5 196 463 5 196 483 5 196 491
5 196 560 5 196 583 5 196 3073 5
196 627 5 196 631 5 196 632 5 196
642 5 196 644 5 196 653 5 196 680
5 196 761 5 196 762 5 196 763 5
196 1 6 196 1 6 196 823 6 196
106 6 196 123 6 196 152 6 196 165
6 196 168 6 196 185 6 196 196 6
196 196 6 196 196 6 196 196 6 196
196 6 196 196 6 196 196 6 196 196
6 196 196 6 196 196 6 196 196 6
196 196 6 196 196 6 196 196 6 196
196 6 196 196 6 196 196 6 196 196
6 196 196 6 196 196 6 196 196 6
196 196 6 196 196 6 196 196 6 196
196 6 196 196 6 196 196 6 196 196
6 196 196 6 196 196 6 196 196 6
196 196 6 196 196 6 196 196 6 196
196 6 196 196 6 196 196 6 196 196
6 196 196 6 196 196 6 196 919 6
196 946 6 196 947 6 196 990 6 196
1007 6 196 1046 6 196 1131 6 196 1139
6 196 1140 6 196 1140 6 196 1141 6
196 1149 6 196 1198 6 196 1215 6 196
1215 6 196 1223 6 196 1265 6 196 1303
6 196 1303 6 196 1323 6 196 1358 6
196 1366 6 196 1421 6 196 1460 6 196
1462 6 196 1463 6 196 1467 6 196 1467
6 196 1468 6 196 1468 6 196 1477 6
196 1491 6 196 1491 6 196 1496 6 196
1496 6 196 1496 6 196 1531 6 196 1535
6 196 1565 6 196 1601 6 196 1602 6
196 1613 6 196 1614 6 196 1614 6 196
1626 6 196 1641 6 196 1693 6 196 1781
6 196 1787 6 196 1788 6 196 205 6
196 206 6 196 207 6 196 209 6 196
210 6 196 210 6 196 1834 6 196 224
6 196 224 6 196 224 6 196 249 6
196 249 6 196 271 6 196 288 6 196
288 6 196 303 6 196 316 6 196 321
6 196 381 6 196 387 6 196 398 6
196 11 6 196 46 6 196 51 6 196
2732 6 196 400 6 196 401 6 196 402
6 196 404 6 196 404 6 196 404 6
196 404 6 196 404 6 196 404 6 196
404 6 196 406 6 196 410 6 196 412
6 196 463 6 196 463 6 196 464 6
196 483 6 196 483 6 196 483 6 196
3184 6 196 3184 6 196 3184 6 196 3184
6 196 3184 6 196 3188 6 196 584 6
196 600 6 196 615 6 196 631 6 196
642 6 196 680 6 196 691 6 196 729
6 196 763 6 196 763 6 196 799 6
196 799 6 196 799 6 196 
# 197
an imaginari number system cacm april 1960 knuth d e
ca600414 jb march 22 1978 1 35 pm 197 5
197 197 5 197 197 5 197 
# 198
a high speed multipl process for digit comput cacm april
1960 gurzi f ca600413 jb march 22 1978 1 36
pm 198 5 198 198 5 198 198 5 198
# 199
euclidian algorithm algorithm 7 cacm april 1960 claussen r ca600412
jb march 22 1978 1 37 pm 199 5 199
199 5 199 199 5 199 
# 200
bessel function i asymptot expans algorithm 6 cacm april 1960
clark d s ca600411 jb march 22 1978 1 39
pm 200 5 200 200 5 200 200 5 200
# 201
bessel funtion i seri expans algorithm 5 cacm april 1960
clark d s ca600410 jb march 22 1978 1 40
pm 201 5 201 201 5 201 201 5 201
# 202
a control system for logic block diagnosi with data load
thi paper describ a section of an integr diagnost monitor
system which facilit the check of section of instruct or
subroutin anywher in the object program a new method of
specifi all diagnost oper in a format similar to a
comput program make the system conveni to us and rel
simpl to understand the paper also describ a number of
other novel diagnost featur which can be includ in the
system cacm april 1960 senko m e ca600409 jb march
22 1978 1 45 pm 931 5 202 202 5
202 202 5 202 202 5 202 202 6 202
396 6 202 634 6 202 
# 203
decod combin of the first n integ taken k at
a time cacm april 1960 brown r m ca600408 jb
march 22 1978 1 46 pm 203 5 203 203
5 203 203 5 203 2690 5 203 203 6
203 579 6 203 
# 204
prove theorem by pattern recognit i cacm april 1960 wang
h ca600407 jb march 22 1978 1 47 pm 204
4 204 204 5 204 204 5 204 204 5
204 3194 5 204 
# 205
macro instruct extens of compil languag macroinstruct compil construct from
a small set of function can be made extrem power
in particular condit assembl nest definit and parenthet notat serv
to make a compil capabl of accept veri gener extens
to it ground languag cacm april 1960 mcilroi m d
ca600406 jb march 22 1978 1 49 pm 205 4
205 205 4 205 210 4 205 214 4 205
1982 4 205 398 4 205 642 4 205 669
4 205 100 4 205 123 4 205 164 4
205 1 5 205 205 5 205 205 5 205
205 5 205 1358 5 205 1565 5 205 1781
5 205 1788 5 205 43 5 205 123 6
205 196 6 205 919 6 205 990 6 205
1006 6 205 1007 6 205 1007 6 205 1046
6 205 1131 6 205 1139 6 205 1140 6
205 1149 6 205 1162 6 205 1198 6 205
1215 6 205 1223 6 205 1265 6 205 1303
6 205 1323 6 205 1358 6 205 1358 6
205 1366 6 205 1421 6 205 1455 6 205
1460 6 205 1460 6 205 1462 6 205 1463
6 205 1467 6 205 1468 6 205 1477 6
205 1491 6 205 1496 6 205 1531 6 205
1535 6 205 1565 6 205 1601 6 205 1602
6 205 1613 6 205 1614 6 205 1626 6
205 1641 6 205 1787 6 205 1788 6 205
205 6 205 205 6 205 205 6 205 205
6 205 224 6 205 249 6 205 288 6
205 316 6 205 381 6 205 398 6 205
11 6 205 404 6 205 410 6 205 463
6 205 464 6 205 483 6 205 3184 6
205 3184 6 205 3188 6 205 3189 6 205
584 6 205 600 6 205 680 6 205 691
6 205 729 6 205 763 6 205 799 6
205 799 6 205 
# 206
symbol manipul in xtran cacm april 1960 green j ca600405
jb march 22 1978 1 50 pm 206 4 206
207 4 206 206 5 206 206 5 206 206
5 206 64 5 206 644 5 206 196 6
206 206 6 206 207 6 206 
# 207
syntact and semant augment to algol cacm april 1960 smith
j w ca600404 jb march 22 1978 1 54 pm
206 4 207 207 4 207 207 5 207 207
5 207 207 5 207 64 5 207 644 5
207 196 6 207 206 6 207 207 6 207
# 208
an introduct to inform process languag v cacm april 1960
newel a tong f m ca600403 jb march 22 1978
1 55 pm 208 5 208 208 5 208 208
5 208 378 5 208 208 6 208 209 6
208 210 6 208 
# 209
symbol manipul by thread list cacm april 1960 perli a
j thornton c ca600402 jb march 22 1978 1 56
pm 1050 5 209 1102 5 209 209 5 209
209 5 209 209 5 209 378 5 209 3008
5 209 731 5 209 798 5 209 849 6
209 106 6 209 196 6 209 208 6 209
209 6 209 209 6 209 209 6 209 209
6 209 209 6 209 209 6 209 210 6
209 210 6 209 367 6 209 406 6 209
483 6 209 627 6 209 627 6 209 
# 210
recurs function of symbol express and their comput by machin
part i cacm april 1960 mccarthi j ca600401 jb march
22 1978 1 57 pm 205 4 210 210 4
210 214 4 210 1982 4 210 398 4 210
642 4 210 669 4 210 100 4 210 123
4 210 164 4 210 106 5 210 1 5
210 1024 5 210 1051 5 210 1102 5 210
1132 5 210 210 5 210 210 5 210 210
5 210 1390 5 210 1486 5 210 1549 5
210 1706 5 210 1826 5 210 1878 5 210
378 5 210 2060 5 210 2155 5 210 2168
5 210 2719 5 210 2723 5 210 2838 5
210 2842 5 210 2855 5 210 2879 5 210
3077 5 210 3080 5 210 3106 5 210 627
5 210 106 6 210 106 6 210 196 6
210 196 6 210 1051 6 210 1180 6 210
1303 6 210 1380 6 210 1389 6 210 1421
6 210 1469 6 210 1477 6 210 1491 6
210 1549 6 210 1549 6 210 1549 6 210
1626 6 210 1626 6 210 1626 6 210 1749
6 210 208 6 210 209 6 210 209 6
210 1826 6 210 1826 6 210 1826 6 210
210 6 210 210 6 210 210 6 210 210
6 210 210 6 210 210 6 210 210 6
210 210 6 210 210 6 210 210 6 210
210 6 210 210 6 210 210 6 210 210
6 210 210 6 210 210 6 210 210 6
210 210 6 210 210 6 210 210 6 210
210 6 210 210 6 210 210 6 210 210
6 210 210 6 210 1834 6 210 1869 6
210 1878 6 210 1972 6 210 1972 6 210
378 6 210 378 6 210 2046 6 210 2060
6 210 2060 6 210 2060 6 210 2110 6
210 2148 6 210 2151 6 210 2167 6 210
2192 6 210 2210 6 210 2457 6 210 2513
6 210 2645 6 210 2651 6 210 2657 6
210 2665 6 210 2723 6 210 2766 6 210
2766 6 210 2833 6 210 2850 6 210 2855
6 210 2954 6 210 2998 6 210 2998 6
210 406 6 210 406 6 210 406 6 210
483 6 210 3184 6 210 3184 6 210 627
6 210 627 6 210 731 6 210 731 6
210 731 6 210 731 6 210 731 6 210
731 6 210 753 6 210 793 6 210 794
6 210 
# 211
share standard flow chart symbol cacm march 1960 grem m
ca600307 jb march 22 1978 1 58 pm 211 5
211 211 5 211 211 5 211 
# 212
bisect routin algorithm 4 cacm march 1960 gorn s ca600306
jb march 22 1978 1 59 pm 212 5 212
212 5 212 212 5 212 
# 213
numer invers of laplac transform cacm march 1960 schmittroth l
a ca600305 jb march 22 1978 2 00 pm 213
5 213 213 5 213 213 5 213 
# 214
an algorithm defin algol assign statement cacm march 1960 floyd
r w ca600304 jb march 22 1978 2 01 pm
205 4 214 210 4 214 214 4 214 214
4 214 214 4 214 1593 4 214 1982 4
214 398 4 214 642 4 214 669 4 214
100 4 214 123 4 214 164 4 214 1
5 214 214 5 214 214 5 214 214 5
214 53 5 214 91 5 214 
# 215
the execut oper a fourth mode of instruct sequenc cacm
march 1960 brook f p ca600303 jb march 22 1978
2 02 pm 215 4 215 215 5 215 215
5 215 215 5 215 58 5 215 
# 216
a note on the us of the abacu in number
convers cacm march 1960 kanner h ca600302 jb march 22
1978 2 03 pm 216 5 216 216 5 216
216 5 216 
# 217
soviet comput technolog 1959 cacm march 1960 ca600301 jb march
22 1978 2 04 pm 217 5 217 217 5
217 217 5 217 323 5 217 689 5 217
217 6 217 217 6 217 323 6 217 3197
6 217 
# 218
comput prepar of a poetri concord cacm februari 1960 painter
j a ca600214 jb march 22 1978 2 05 pm
218 5 218 218 5 218 218 5 218 
# 219
marriag with problem cacm februari 1960 shuchter j p ca600213
jb march 22 1978 2 06 pm 219 5 219
219 5 219 219 5 219 
# 220
a new method of comput of squar root without us
divis cacm februari 1960 traub j f ca600212 jb march
22 1978 2 08 pm 220 5 220 220 5
220 220 5 220 
# 221
the basic side of tape label cacm februari 1960 logan
w a ca600211 jb march 22 1978 2 09 pm
121 5 221 221 5 221 221 5 221 221
5 221 221 6 221 
# 222
code isomorph the code of extern symbol into symbol intern
to a comput can sometim be carri out in such
a wai that relev inform properti ar preserv but in
a form much more easili dealt with a case in
point is present cacm februari 1960 lynch w c ca600210
jb march 22 1978 2 12 pm 222 4 222
222 4 222 364 4 222 799 4 222 222
5 222 222 5 222 222 5 222 44 5
222 82 5 222 
# 223
selfciph program cacm februari 1960 pelta h n ca600209 jb
march 22 1978 2 13 pm 223 5 223 223
5 223 223 5 223 
# 224
sequenti formula translat the syntax of an algorithm languag such
as algol is conveni describ as a sequenc of state
indic by an element call cellar transit ar control by
admiss state symbol pair which mai be repres by a
transit matrix thi descript of syntax furnish at the same
time an extrem simpl rule for translat into machin program
statement in the algorithm languag sequenti treatment howev is not
feasibl in the case of certain optim process such as
recurs address calcul cacm februari 1960 samelson k bauer f
l ca600208 jb march 22 1978 2 17 pm 224
4 224 364 4 224 1139 5 224 1141 5
224 1215 5 224 1223 5 224 224 5 224
224 5 224 224 5 224 267 5 224 1647
5 224 1781 5 224 1787 5 224 1792 5
224 364 5 224 405 5 224 438 5 224
98 5 224 763 5 224 100 6 224 123
6 224 196 6 224 196 6 224 196 6
224 919 6 224 990 6 224 1007 6 224
1025 6 224 1046 6 224 1131 6 224 1139
6 224 1140 6 224 1141 6 224 1149 6
224 1179 6 224 1198 6 224 1215 6 224
1215 6 224 1223 6 224 1265 6 224 1303
6 224 1323 6 224 1358 6 224 1366 6
224 1421 6 224 1460 6 224 1462 6 224
1463 6 224 1467 6 224 1468 6 224 1477
6 224 1491 6 224 1491 6 224 1496 6
224 1496 6 224 1531 6 224 1535 6 224
1565 6 224 1601 6 224 1602 6 224 1605
6 224 1613 6 224 1614 6 224 1626 6
224 1641 6 224 1781 6 224 1787 6 224
1788 6 224 205 6 224 224 6 224 224
6 224 224 6 224 224 6 224 224 6
224 224 6 224 224 6 224 224 6 224
224 6 224 224 6 224 224 6 224 224
6 224 224 6 224 249 6 224 249 6
224 288 6 224 303 6 224 316 6 224
381 6 224 398 6 224 399 6 224 11
6 224 44 6 224 55 6 224 77 6
224 77 6 224 77 6 224 77 6 224
93 6 224 98 6 224 404 6 224 404
6 224 404 6 224 405 6 224 410 6
224 412 6 224 438 6 224 463 6 224
464 6 224 464 6 224 483 6 224 3184
6 224 3188 6 224 584 6 224 600 6
224 631 6 224 631 6 224 680 6 224
691 6 224 763 6 224 763 6 224 763
6 224 799 6 224 799 6 224 
# 225
a techniquefor handl macro instruct corrigendum cacm februari 1960 greenwald
i d ca600207 jb march 22 1978 2 18 pm
225 5 225 225 5 225 225 5 225 
# 226
solut of polynomi equat by bairstow hitchcock method algorithm 3
cacm februari 1960 grau a a ca600206 jb march 22
1978 2 20 pm 226 5 226 226 5 226
226 5 226 
# 227
rootfind algorithm 2 cacm februari 1960 wegstein j ca600205 jb
march 22 1978 2 20 pm 227 5 227 227
5 227 227 5 227 
# 228
quadi algorithm 1 cacm februari 1960 herbold r j ca600204
jb march 22 1978 2 21 pm 228 5 228
228 5 228 228 5 228 
# 229
a terminolog propos cacm februari 1960 gruenberg f ca600203 jb
march 22 1978 2 24 pm 229 5 229 229
5 229 229 5 229 
# 230
a propos for charact code compat cacm februari 1960 bemer
r w ca600202 jb march 22 1978 2 25 pm
230 5 230 230 5 230 230 5 230 333
5 230 230 6 230 
# 231
a propos for a set of public standard for us
by the acm cacm februari 1960 kent e r ca600201
jb march 22 1978 2 26 pm 231 5 231
231 5 231 231 5 231 
# 232
a high speed sort procedur cacm januari 1960 frank r
m lazaru r b ca600104 jb march 22 1978 2
27 pm 232 5 232 232 5 232 232 5
232 852 5 232 864 5 232 232 6 232
232 6 232 309 6 232 74 6 232 74
6 232 
# 233
abstract addit nuclear reactor code cacm januari 1960 nather v
sangren w ca600103 jb march 22 1978 2 29 pm
233 5 233 233 5 233 233 5 233 
# 234
a sap like assembl program for the ibm 650 cacm
januari 1960 speckhard a e ca600102jb march 22 1978 2
30 pm 234 5 234 234 5 234 234 5
234 
# 235
two think piec cacm januari 1960 baglei p r ca600101
jb march 22 1978 2 30 pm 235 5 235
235 5 235 235 5 235 
# 236
soviet cybernet and comput thi articl record observ on soviet
research and technolog in cybernet and comput scienc made by
the author dure a visit to the soviet union as
a deleg to the ifac congress on automat control held
in moscow in the summer of 1960 cacm decemb 1961
feigenbaum e a ca611214 jb march 15 1978 10 06
pm 1349 5 236 236 5 236 236 5 236
236 5 236 236 6 236 323 6 236 83
6 236 415 6 236 
# 237
comput product of peek a boo sheet cacm decemb 1961
robbin d ca611213 jb march 15 1978 10 07 pm
237 5 237 237 5 237 237 5 237 
# 238
simul and analysi of biochem system cacm decemb 1961 garfinkel
d rutledg j d higgin j j ca611212 jb march
15 1978 10 09 pm 238 4 238 238 4
238 633 4 238 643 4 238 238 5 238
238 5 238 238 5 238 633 5 238 643
5 238 238 6 238 238 6 238 633 6
238 643 6 238 
# 239
ineffici of the us of boolean function for inform retriev
system cacm decemb 1961 verhoeff j goffman w belzer j
ca611211 jb march 15 1978 10 10 pm 239 5
239 239 5 239 239 5 239 
# 240
process magnet tape file with variabl block cacm decemb 1961
graham j w sprott d a ca611210 jb march 15
1978 10 11 pm 240 5 240 240 5 240
240 5 240 
# 241
machin calcul of moment of a probabl distribut a method
is present for the calcul on a machin of the
moment of a probabl distribut necessit littl more than n
addit and n refer to memori for each moment instead
of the minimum of n multipl 2n addit and 2n
refer to memori requir by the most straightforward method where
n is the number of entri in the probabl distribut
the method is directli applic when a tabul distribut exist
as when it ha been comput by repeat convolut but
in thi case it conserv both time and accuraci cacm
decemb 1961 lechner j a ca611209 jb march 15 1978
10 15 pm 241 5 241 241 5 241 241
5 241 
# 242
note on geometr weight check digit verif thi note describ
a method for util geometr weight modulu 11 check digit
on a comput which doe not have either multipl or
divis in addit some attempt ha been made to show
some limit of thi system cacm decemb 1961 wilson j
g ca611208 jb march 15 1978 10 17 pm 242
5 242 242 5 242 242 5 242 
# 243
n dimension code for detect and correct multipl error the
paper introduc a new famili of code for detect and
correct multipl error in a binari code messag the messag
itself is arrang conceptu into a multidimension rectangular arrai the
process of encod and error detect ar base upon pariti
evalu along prescrib dimens of the arrai effect of the
code is increas by introduc a system check bit which
is essenti a pariti check on the other pariti bit
onli three dimension code ar discuss in thi paper with
pariti evalu along the horizont the vertic and on main
diagon howev the famili of code is not restrict to
three dimens as evidenc by the discuss by minnick and
ashenhurst on a similar multidimension singl bit select plan us
for anoth purpos 6 a four dimension code correct three
and detect four error ha been develop the extens to
higher dimension code with greater correct power is straightforward cacm
decemb 1961 rubinoff m ca611207 jb march 15 1978 10
23 pm 243 5 243 243 5 243 243 5
243 
# 244
incomplet ellipt integr algorithm 73 cacm decemb 1961 kriebel d
c ca611206 jb march 15 1978 10 24 pm 244
5 244 244 5 244 244 5 244 
# 245
a set of associ legendr polynomi of the second kind
algorithm 62 cacm decemb 1961 herndon j r ca611205 jb
march 15 1978 10 25 pm 1222 5 245 245
5 245 245 5 245 245 5 245 1130 6
245 245 6 245 310 6 245 
# 246
least squar fit by orthogon polynomi algorithm 28 cacm decemb
1961 macmillan d b ca611204 jb march 15 1978 10
27 pm 246 5 246 246 5 246 246 5
246 
# 247
incomplet ellipt integr algorithm 73 cacm decemb 1961 jefferson d
k ca611203 jb march 15 1978 10 27 pm 247
5 247 247 5 247 247 5 247 
# 248
what is proprietari in mathemat program impress of a panel
discuss a panel discuss on what is proprietari in mathemat
program wa sponsor by the special interest committe on mathemat
program of the acm dure a hall of discuss on
septemb 7th at the 16th nation acm meet in lo
angel thi note consist sole of the impress garner by
the moder of the panel and doe not necessarili repres
the posit of ani of the panelist or other particip
in the discuss cacm decemb 1961 smith l w ca611202
jb march 15 1978 10 31 pm 248 5 248
248 5 248 248 5 248 
# 249
specif languag for mechan languag and their processor a baker
s dozen cacm decemb 1961 gorn s ca611201 jb march
15 1978 10 32 pm 249 4 249 249 4
249 249 4 249 254 4 249 272 4 249
1102 4 249 1109 4 249 1140 4 249 1188
4 249 1306 4 249 1464 4 249 1491 4
249 1767 4 249 1781 4 249 1787 4 249
1949 4 249 321 4 249 2059 4 249 2126
4 249 435 4 249 437 4 249 438 4
249 463 4 249 483 4 249 491 4 249
2732 4 249 560 4 249 583 4 249 3073
4 249 3185 4 249 627 4 249 631 4
249 632 4 249 642 4 249 644 4 249
653 4 249 680 4 249 761 4 249 762
4 249 763 4 249 123 4 249 140 4
249 919 4 249 989 4 249 196 5 249
249 5 249 249 5 249 249 5 249 1425
5 249 1781 5 249 303 5 249 438 5
249 51 5 249 762 5 249 123 6 249
196 6 249 196 6 249 919 6 249 990
6 249 1007 6 249 1046 6 249 1131 6
249 1139 6 249 1140 6 249 1149 6 249
1198 6 249 1215 6 249 1223 6 249 1265
6 249 1303 6 249 1323 6 249 1358 6
249 1366 6 249 1421 6 249 1460 6 249
1462 6 249 1463 6 249 1467 6 249 1468
6 249 1477 6 249 1491 6 249 1496 6
249 1531 6 249 1535 6 249 1565 6 249
1601 6 249 1602 6 249 1613 6 249 1614
6 249 1626 6 249 1641 6 249 1787 6
249 1788 6 249 205 6 249 224 6 249
224 6 249 249 6 249 249 6 249 249
6 249 249 6 249 288 6 249 303 6
249 316 6 249 381 6 249 398 6 249
11 6 249 77 6 249 404 6 249 410
6 249 463 6 249 464 6 249 483 6
249 483 6 249 3184 6 249 3188 6 249
584 6 249 600 6 249 680 6 249 691
6 249 763 6 249 799 6 249 
# 250
an engin applic of logic structur tabl cacm novemb 1961
nickerson r c ca611118 jb march 15 1978 10 34
pm 250 4 250 1237 4 250 1237 5 250
250 5 250 250 5 250 250 5 250 320
5 250 2220 5 250 753 5 250 1172 6
250 1237 6 250 1327 6 250 1354 6 250
1489 6 250 1548 6 250 250 6 250 250
6 250 250 6 250 320 6 250 753 6
250 
# 251
ballist cam design thi paper present a digit comput program
for the rapid calcul of manufactur data essenti to the
design of preproduct cam which ar util in ballist comput
of tank fire control system the cam profil gener introduc
the superelev angl requir by tank main armament for a
particular type ammunit cacm novemb 1961 archambault m ca611117 jb
march 15 1978 10 37 pm 251 5 251 251
5 251 251 5 251 
# 252
program a duplex comput system thi paper describ a method
of duplex comput program that ha been us with two
comput in a militari defens system the method combin special
program with a basic data process program packag the duplex
oper give the system greater reliabl after achiev the requir
level of integr both comput do similar process on the
same input and continu cross check the intermedi and final
result cacm novemb 1961 dow j ca611116 jb march 15
1978 10 40 pm 252 5 252 252 5 252
252 5 252 
# 253
on a program for rai chaudhuri s algorithm for a
minimum cover of an abstract complex cacm novemb 1961 foata
d c ca611115 jb march 15 1978 10 41 pm
253 5 253 253 5 253 253 5 253 
# 254
smalgol 61 prior to and dure the 1961 western joint
comput confer sever peopl in the joint user group had
express interest in defin a smalgol languag thi is to
be an algol languag for us with compil on rel
small size comput a preliminari report result at the acm
nation confer four month later after consid sever counter propos
a final version wa agre upon by a subcommitte the
recommend of the subcommitte for a standard subset of algol
60 for us on small comput is present here cacm
novemb 1961 bachelork g a dempster j r h knuth
d e speroni j ca611114 jb march 15 1978 10
44 pm 249 4 254 254 4 254 254 4
254 254 4 254 272 4 254 1102 4 254
1109 4 254 1140 4 254 1188 4 254 1234
4 254 1306 4 254 1464 4 254 1491 4
254 1767 4 254 1781 4 254 1787 4 254
1949 4 254 321 4 254 2059 4 254 2126
4 254 435 4 254 437 4 254 463 4
254 483 4 254 491 4 254 2732 4 254
560 4 254 583 4 254 3073 4 254 627
4 254 631 4 254 632 4 254 642 4
254 644 4 254 653 4 254 680 4 254
761 4 254 762 4 254 763 4 254 123
4 254 140 4 254 919 4 254 989 4
254 196 5 254 254 5 254 254 5 254
254 5 254 321 5 254 387 5 254 794
5 254 254 6 254 
# 255
augment algorithm 68 cacm novemb 1961 breed l m ca611113
jb march 15 1978 10 45 pm 255 5 255
255 5 255 255 5 255 
# 256
a set of test matric algorithm 52 cacm novemb 1961
dubai g h ca611112 jb march 15 1978 10 46
pm 256 5 256 256 5 256 256 5 256
# 257
invert algorithm 42 cacm novemb 1961 knapp a w shaman
p ca611111 jb march 15 1978 10 47 pm 257
5 257 257 5 257 257 5 257 
# 258
composit gener algorithm 72 cacm novemb 1961 hellerman o ogden
s ca611110 jb march 15 1978 10 48 pm 258
5 258 258 5 258 258 5 258 
# 259
permut algorithm 71 cacm novemb 1961 covey r r sullivan
j g ca611109 jb march 15 1978 10 52 pm
259 5 259 259 5 259 259 5 259 
# 260
interpol by aitken algorithm 70 cacm novemb 1961 mifsud c
j ca611108 jb march 15 1978 10 53 pm 260
5 260 260 5 260 260 5 260 
# 261
tape split cacm novemb 1961 moor d p ca611107 jb
march 15 1978 10 54 pm 261 5 261 261
5 261 261 5 261 
# 262
map cacm novemb 1961 moor c l ruw m l
ca611106 jb march 15 1978 10 54 pm 262 5
262 262 5 262 262 5 262 
# 263
librari load with altern routin select cacm novemb 1961 moor
d p ca611105 jb march 15 1978 10 55 pm
263 5 263 263 5 263 263 5 263 
# 264
a gener polyphas merg algorithm cacm novemb 1961 reynold s
w ca611104 jb march 15 1978 10 56 pm 264
5 264 264 5 264 264 5 264 479 5
264 264 6 264 299 6 264 
# 265
low level languag subroutin for us within fortran thi paper
describ some subroutin code in symbol languag and for us
within fortran code program to deal with special arithmet e
g multi precis arithmet symbol manipul bit manipul and expand
charact set input output and visual displai cacm novemb 1961
barnett m p ca611103 jb march 15 1978 10 59
pm 265 5 265 265 5 265 265 5 265
464 5 265 720 5 265 265 6 265 265
6 265 404 6 265 464 6 265 474 6
265 
# 266
fit sphere by the method of least squar cacm novemb
1961 robinson s m ca611102 jb march 15 1978 11
00 pm 266 5 266 266 5 266 266 5
266 
# 267
some propos for improv the effici of algol 60 cacm
novemb 1961 wilk m v ca611101 jb march 15 1978
11 01 pm 267 4 267 1139 4 267 1141
4 267 1215 4 267 1223 4 267 1647 4
267 1781 4 267 1787 4 267 1792 4 267
364 4 267 405 4 267 438 4 267 763
4 267 1323 5 267 224 5 267 267 5
267 267 5 267 267 5 267 267 6 267
3184 6 267 799 6 267 
# 268
stochast evalu of a static storag alloc cacm octob 1961
cohen l j ca611013 jb march 16 1978 12 48
pm 268 5 268 268 5 268 268 5 268
# 269
core alloc base on probabl cacm octob 1961 riskin b
n ca611012 jb march 16 1978 12 49 pm 269
5 269 269 5 269 269 5 269 
# 270
techniqu for storag alloc algorithm cacm octob 1961 kellei jr
j e ca611011 jb march 16 1978 12 50 pm
270 5 270 270 5 270 270 5 270 678
5 270 270 6 270 
# 271
a semi automat storag alloc system at load time cacm
octob 1961 heis w p larner r a ca611010 jb
march 16 1978 12 51 pm 972 5 271 271
5 271 271 5 271 271 5 271 1774 5
271 560 5 271 800 6 271 196 6 271
1173 6 271 271 6 271 271 6 271 271
6 271 273 6 271 276 6 271 
# 272
a storag alloc scheme for algol 60 a storag alloc
scheme for a machin with a 2048 instruct core store
and a magnet drum is describ the us of the
drum for store program block and or data must be
direct by the programm through auxiliari inform in the algol
program the administr routin control the storag at run time
ar describ in full a detail exampl is given cacm
octob 1961 jensen j mondrup p naur p ca611009 jb
march 16 1978 12 54 pm 249 4 272 254
4 272 272 4 272 1102 4 272 1109 4
272 1140 4 272 1188 4 272 1306 4 272
1464 4 272 1491 4 272 1767 4 272 1781
4 272 1787 4 272 1949 4 272 321 4
272 2059 4 272 2126 4 272 435 4 272
437 4 272 463 4 272 483 4 272 491
4 272 2732 4 272 560 4 272 583 4
272 3073 4 272 627 4 272 631 4 272
632 4 272 642 4 272 644 4 272 653
4 272 680 4 272 761 4 272 762 4
272 763 4 272 123 4 272 140 4 272
919 4 272 989 4 272 196 5 272 272
5 272 272 5 272 272 5 272 
# 273
experi in automat storag alloc cacm octob 1961 collin jr
g o ca611008 jb march 16 1978 12 55 pm
972 5 273 273 5 273 273 5 273 273
5 273 2911 5 273 1879 6 273 271 6
273 273 6 273 273 6 273 276 6 273
2435 6 273 2498 6 273 2734 6 273 2773
6 273 2983 6 273 
# 274
dynam storag alloc in the atla comput includ an automat
us of a back store cacm octob 1961 fotheringham j
ca611007 jb march 16 1978 12 57 pm 274 5
274 274 5 274 274 5 274 1754 5 274
2358 5 274 488 5 274 1746 6 274 1751
6 274 1753 6 274 274 6 274 274 6
274 274 6 274 376 6 274 
# 275
dynam storag alloc for an inform retriev system cacm octob
1961 sam b h ca611006 jb march 16 1978 12
58 pm 275 5 275 275 5 275 275 5
275 
# 276
program organ and record keep for dynam storag alloc the
materi present in thi paper is part of the design
plan of the core alloc portion of the ascii matic
program system project ascii matic is concern with the applic
of comput techniqu to the activ of certain headquart militari
intellig oper of the u armi cacm octob 1961 holt
a w ca611005 jb march 16 1978 1 02 pm
972 5 276 276 5 276 276 5 276 276
5 276 1471 5 276 800 6 276 271 6
276 273 6 276 276 6 276 276 6 276
# 277
problem of storag alloc in a multiprocessor multiprogram system cacm
octob 1961 maher r j ca611004 jb march 16 1978
1 12 pm 277 5 277 277 5 277 277
5 277 
# 278
a gener formul of storag alloc formal of a gener
comput storag alloc process is attempt with a given comput
m is associ a fictiti comput m essenti ident to
m except in respect to possess of unbound primari storag
map of the total storag set intern and extern of
m into the direct address set of m ar introduc
a program sequenc p for m is term m admiss
rel to a specif execut time period if there is
a map underwhich p and it effect data refer ar
all locat in the direct address set of m storag
alloc is consid as a process of establish for an
arbitrari m program a sequenc of map a decoupl of
the program into m admiss subprogram and a link set
of interlud an exist proof in term of a complet
interpret m program as indic some special case ar discuss
variou restrict on gener of m program ar consid under
which more practic realiz of alloc process becom tractabl cacm
octob 1961 robert jr a e ca611003 jb march 16
1978 1 22 pm 278 5 278 278 5 278
278 5 278 
# 279
the case for dynam storag alloc cacm octob 1961 sam
b h ca611002 jb march 16 1978 1 23 pm
279 5 279 279 5 279 279 5 279 657
5 279 279 6 279 409 6 279 
# 280
a preplan approach to a storag alloc compil cacm octob
1961 o neil r w ca611001 jb march 16 1978
1 24 pm 280 5 280 280 5 280 280
5 280 
# 281
put a hex on e x recent note on approxim
natur antilog have not consid indirect formul for describ e
x in thi note we produc a particular famili of
veri fast high precis and emin practic exponenti evalu formula
deriv from on such formul cacm octob 1961 feurzeig w
ca610913 jb march 16 1978 1 27 pm 281 5
281 281 5 281 281 5 281 
# 282
optimum tape write procedur consid a magnet tape system with
a read check after write where an error occur in
write a record a program error routin mai either bypass
some or all of the area on tape or try
to rewrit the record on the same area thi paper
evalu these two procedur on the basi of expect loss
of comput time and develop a decis rule for select
the optimum procedur the rule depend critic on the number
of time the tape be written will be us in
the futur in the case where the optimum procedur is
to bypass an area a second decis the size of
the area to be bypass is necessari a formula is
develop to determin the optimum area to be bypass for
each procedur cacm septemb 1961 hutchinson k ca610912 jb march
16 1978 1 32 pm 282 5 282 282 5
282 282 5 282 
# 283
invers of a complex matrix cacm septemb 1961 tornheim l
ca610911 jb march 16 1978 1 44 pm 283 5
283 283 5 283 283 5 283 
# 284
manipul of algebra express an algorithm for algebra manipul express
of the form sum cipi i 1 n ha been
develop in conjunct with the develop of program for system
analysi problem thi algorithm enablesu to deriv over all system
transfer function from algebra describ block diagram of ani linear
continu multi loop feedback system the machin represent of the
deriv express is by virtu of the algorithm in a
form which simplifi the task of compil the algorithm wa
develop for a particular purpos in connect with system analysi
studi howev it applic as a mathemat devic extend far
beyond the confin of the origin problem cacm septemb 1961
rom a r m ca610910 jb march 16 1978 9
36 pm 964 5 284 1396 5 284 284 5
284 284 5 284 284 5 284 964 6 284
1028 6 284 1029 6 284 1083 6 284 1132
6 284 1214 6 284 1278 6 284 1334 6
284 1365 6 284 1386 6 284 1387 6 284
1388 6 284 1392 6 284 1393 6 284 1394
6 284 1395 6 284 1396 6 284 1397 6
284 1496 6 284 284 6 284 284 6 284
407 6 284 3199 6 284 3200 6 284 3201
6 284 3202 6 284 3203 6 284 3204 6
284 561 6 284 561 6 284 730 6 284
759 6 284 
# 285
solut of tridiagon matric cacm septemb 1961 wenrick r c
houghton a v ca610909 jb march 16 1978 9 39
pm 285 5 285 285 5 285 285 5 285
# 286
an iter method for invers of power seri cacm septemb
1961 bramhal j n ca610908 jb march 16 1978 9
41 pm 286 5 286 286 5 286 286 5
286 
# 287
the gener import event techniqu cacm septemb 1961 shapiro n
vreenegoor h ca610907 jb march 16 1978 9 42 pm
287 5 287 287 5 287 287 5 287 
# 288
a syntact chart of algol 60 cacm septemb 1961 taylor
w turner l waychoff r ca610906jb march 16 1978 9
43 pm 989 5 288 288 5 288 288 5
288 288 5 288 1781 5 288 729 5 288
123 6 288 196 6 288 196 6 288 919
6 288 990 6 288 1007 6 288 1046 6
288 1131 6 288 1139 6 288 1140 6 288
1149 6 288 1198 6 288 1215 6 288 1223
6 288 1265 6 288 1303 6 288 1323 6
288 1358 6 288 1366 6 288 1421 6 288
1460 6 288 1462 6 288 1463 6 288 1467
6 288 1468 6 288 1477 6 288 1491 6
288 1496 6 288 1531 6 288 1535 6 288
1565 6 288 1601 6 288 1602 6 288 1613
6 288 1614 6 288 1626 6 288 1641 6
288 1787 6 288 1788 6 288 205 6 288
224 6 288 249 6 288 288 6 288 288
6 288 288 6 288 316 6 288 381 6
288 398 6 288 11 6 288 404 6 288
410 6 288 463 6 288 464 6 288 483
6 288 3184 6 288 3184 6 288 3188 6
288 584 6 288 600 6 288 616 6 288
680 6 288 691 6 288 763 6 288 799
6 288 
# 289
critic path schedul algorithm 40 cacm septemb 1961 alexand n
p ca610905 jb march 16 1978 9 44 pm 289
5 289 289 5 289 289 5 289 
# 290
chain trace algorithm 69 cacm septemb 1961 mayoh b h
ca610904 jb march 16 1978 9 45 pm 290 5
290 290 5 290 290 5 290 
# 291
us of mobol in preparingretriev program cacm septemb 1961 hoffman
j opler a ca610903 jb march 16 1978 9 50
pm 291 5 291 291 5 291 291 5 291
# 292
an inform retriev languag for legal studi cacm septemb 1961
kehl w b horti j f bacon c r t
mitchel d s ca610902 jb march 16 1978 9 51
pm 292 5 292 292 5 292 292 5 292
# 293
the appli mathemat laboratori of the david w taylor model
basin cacm septemb 1961 richston m ca610901 jb march 16
1978 10 01 pm 293 5 293 293 5 293
293 5 293 
# 294
an imaginari number system cacm august 1961 knuth d ca610810
jb march 16 1978 10 02 pm 294 5 294
294 5 294 294 5 294 
# 295
ration approxim for the error function and for similar function
cacm august 1961 clendenin w w ca610809 jb march 16
1978 10 03 pm 295 5 295 295 5 295
295 5 295 
# 296
a note on multipl precis arithmet cacm august 1961 cox
a g luther h a ca610808 jb march 16 1978
10 04 pm 1393 5 296 296 5 296 296
5 296 296 5 296 106 6 296 296 6
296 731 6 296 
# 297
a note on fit great circl by least squar cacm
august 1961 marcu c f ca610807 jb march 16 1978
10 05 pm 297 4 297 122 5 297 297
5 297 297 5 297 297 5 297 
# 298
a 48 bit pseudo random number gener a new 48
bit pseudo random number gener suitabl for sever comput wa
test statist for random to determin it adequaci for us
in mont carlo program frequenc test distribut of certain low
order moment run up and down and run abov and
below the mean were appli to on half million gener
number ly within the interv 0 1 and to three
set of integ obtain from specifi bit within the gener
number these test substanti the random of all number except
for the set of integ come from the least signific
bit cacm august 1961 kuehn h g ca610806 jb march
16 1978 10 09 pm 298 5 298 298 5
298 298 5 298 
# 299
a gener polyphas merg algorithm cacm august 1961 reynold s
w ca610805 jb march 16 1978 10 10 pm 299
5 299 299 5 299 299 5 299 2146 5
299 479 5 299 862 5 299 863 5 299
861 6 299 862 6 299 863 6 299 264
6 299 299 6 299 299 6 299 299 6
299 299 6 299 479 6 299 
# 300
cobol a sampl problem a simplifi merchandis control problem ha
been chosen for present cobol to user and potenti user
of comput system a mythic depart store e languag bro
inc is program in the cobol languag on of the
mani run on it comput cacm august 1961 mackinson t
n ca610804 jb march 16 1978 10 12 pm 300
5 300 300 5 300 300 5 300 638 5
300 300 6 300 
# 301
a set of test matric algorithm 52 cacm august 1961
gilbert h e ca610803 jb march 16 1978 10 13
pm 301 5 301 301 5 301 301 5 301
# 302
augment algorithm 68 cacm august 1961 rice h g ca610802
jb march 16 1978 10 14 pm 302 5 302
302 5 302 302 5 302 
# 303
some basic terminolog connect with mechan languag and their processor
the suggest in thi paper ar part of the terminolog
us in work for the univers of pennsylvania s offic
of comput research and educ the work is jointli support
by the nation scienc foundat and the air forc offic
of scientif research cacm august 1961 gorn s ca610801 jb
march 16 1978 10 16 pm 249 5 303 303
5 303 303 5 303 303 5 303 438 5
303 3185 5 303 196 6 303 224 6 303
249 6 303 303 6 303 303 6 303 303
6 303 51 6 303 77 6 303 438 6
303 
# 304
nth root of a complex number algorithm 53 cacm juli
1961 nestor jr c w ca610713 jb march 16 1978
10 17 pm 304 5 304 304 5 304 304
5 304 
# 305
cram algorithm 67 cacm juli 1961 caffrei j ca610712 jb
march 16 1978 10 18 pm 305 5 305 305
5 305 305 5 305 
# 306
invr algorithm 66 cacm juli 1961 cafferi j ca610711 jb
march 16 1978 10 19 pm 306 5 306 306
5 306 306 5 306 
# 307
find algorithm 65 cacm juli 1961 hoar c a r
ca610710 jb march 16 1978 10 20 pm 307 5
307 307 5 307 307 5 307 2227 5 307
2783 5 307 3054 5 307 1175 6 307 1834
6 307 1880 6 307 1919 6 307 1969 6
307 1980 6 307 1997 6 307 307 6 307
307 6 307 307 6 307 308 6 307 309
6 307 309 6 307 2017 6 307 2679 6
307 776 6 307 
# 308
quicksort algorithm 64 cacm juli 1961 hoar c a r
ca610709 jb march 16 1978 10 21 pm 1175 5
308 1919 5 308 1969 5 308 1997 5 308
308 5 308 308 5 308 308 5 308 2191
5 308 2388 5 308 2679 5 308 3054 5
308 3121 5 308 864 6 308 864 6 308
970 6 308 1175 6 308 1175 6 308 1175
6 308 1175 6 308 1190 6 308 1228 6
308 1312 6 308 1880 6 308 1919 6 308
1969 6 308 1969 6 308 1969 6 308 1980
6 308 1997 6 308 1997 6 308 307 6
308 308 6 308 308 6 308 308 6 308
308 6 308 308 6 308 308 6 308 308
6 308 308 6 308 308 6 308 309 6
308 309 6 308 309 6 308 309 6 308
309 6 308 2017 6 308 2042 6 308 2456
6 308 2679 6 308 2709 6 308 74 6
308 3187 6 308 3187 6 308 507 6 308
716 6 308 776 6 308 783 6 308 
# 309
partit algorithm 63 cacm juli 1961 hoar c a r
ca610708 jb march 16 1978 10 22 pm 1919 5
309 309 5 309 309 5 309 309 5 309
2191 5 309 2388 5 309 2783 5 309 2784
5 309 3054 5 309 3121 5 309 864 5
309 864 6 309 1175 6 309 1175 6 309
1312 6 309 1729 6 309 232 6 309 1880
6 309 1919 6 309 1969 6 309 1980 6
309 1997 6 309 307 6 309 307 6 309
308 6 309 308 6 309 308 6 309 308
6 309 308 6 309 309 6 309 309 6
309 309 6 309 309 6 309 309 6 309
309 6 309 309 6 309 309 6 309 2017
6 309 2456 6 309 2679 6 309 2709 6
309 74 6 309 74 6 309 2783 6 309
3187 6 309 776 6 309 
# 310
a set of associ legendr polynomi of the second kind
algorithm 62 cacm juli 1961 herndon j r ca610707 jb
march 16 1978 10 23 pm 1222 5 310 310
5 310 310 5 310 310 5 310 1130 6
310 245 6 310 310 6 310 
# 311
procedur for rang arithmet algorithm 61 cacm juli 1961 gibb
a ca610706 jb march 16 1978 10 25 pm 1524
5 311 1931 5 311 311 5 311 311 5
311 311 5 311 2214 5 311 2544 5 311
879 6 311 1177 6 311 1197 6 311 1524
6 311 311 6 311 311 6 311 311 6
311 311 6 311 2214 6 311 
# 312
a further note on approxim e x cacm juli 1961
olivi d ca610705 jb march 16 1978 10 26 pm
312 5 312 312 5 312 312 5 312 
# 313
an iter method for invers of power seri cacm juli
1961 bramhal j n ca610704 jb march 16 1978 10
26 pm 313 5 313 313 5 313 313 5
313 
# 314
a divisionless method of integ convers cacm juli 1961 clarkson
w k princ b m ca610703 jb march 16 1978
10 27 pm 314 5 314 314 5 314 314
5 314 
# 315
solut of tridiagon matric cacm juli 1961 wenrick r c
ca610702 jb march 16 1978 10 28 pm 315 5
315 315 5 315 315 5 315 
# 316
an algorithm for equival declar cacm juli 1961 arden b
w galler a graham r m ca610701 jb march 16
1978 10 29 pm 1072 5 316 1781 5 316
316 5 316 316 5 316 316 5 316 123
6 316 196 6 316 919 6 316 990 6
316 1007 6 316 1046 6 316 1131 6 316
1139 6 316 1140 6 316 1149 6 316 1198
6 316 1215 6 316 1223 6 316 1265 6
316 1303 6 316 1323 6 316 1358 6 316
1366 6 316 1421 6 316 1460 6 316 1462
6 316 1463 6 316 1467 6 316 1468 6
316 1477 6 316 1491 6 316 1496 6 316
1531 6 316 1535 6 316 1565 6 316 1601
6 316 1602 6 316 1613 6 316 1614 6
316 1626 6 316 1641 6 316 1787 6 316
1788 6 316 205 6 316 224 6 316 249
6 316 288 6 316 316 6 316 316 6
316 381 6 316 398 6 316 11 6 316
404 6 316 410 6 316 463 6 316 464
6 316 483 6 316 3184 6 316 3188 6
316 584 6 316 600 6 316 680 6 316
691 6 316 763 6 316 799 6 316 
# 317
on the approxim of curv by line segment us dynam
program cacm june 1961 bellman r ca610608 jb march 16
1978 10 31 pm 317 5 317 317 5 317
317 5 317 497 5 317 867 5 317 317
6 317 317 6 317 497 6 317 
# 318
combat vehicl fire stabil activ suspens cacm june 1961 fischer
c m ca610607 jb march 16 1978 10 32 pm
318 5 318 318 5 318 318 5 318 
# 319
on a class of iter formula and some histor note
the class of iter formula obtain by ration approxim of
euler s formula is deriv with the correspond error estim
some histor note on iter procedur ar follow by a
deriv of euler s formula with the associ error estim
in a new notat which simplifi the error estim and
suggest gener the final section consid the pade approxim to
the euler polynomi and show how a number of known
formula mai be deriv from thi unifi approach there is
a short discuss of the best formula cacm june 1961
traub j f ca610606 jb march 16 1978 10 36
pm 319 4 319 319 5 319 319 5 319
319 5 319 380 5 319 
# 320
logic structur tabl logic tabl ar an excel wai of
develop and express the logic requir in procedur oper system
and circuit a set of rule for write and us
logic tabl is explain by mean of some simpl exampl
then the logic structur of a vend machin is given
in which two logic tabl ar us logic tabl ar
two dimension in natur enabl us to fulli express and
consid both the sequenti and parallel aspect of logic thei
can be compil directli into a comput program and so
elimin the need for flow chart and hand code cacm
june 1961 cantrel h n king j king f e
h ca610605 jb march 16 1978 10 40 pm 1237
5 320 250 5 320 320 5 320 320 5
320 320 5 320 250 6 320 320 6 320
320 6 320 753 6 320 
# 321
algol 60 confidenti the algol 60 report when first encount
seem to describ a veri complex languag which will be
difficult to learn the metalinguist formula admir serv the purpos
of precis specifi a languag but thei ar certainli not
veri readabl for a beginn howev experi ha shown that
onc the report is explain it is in fact easi
to learn algol and to write algorithm in it the
languag is so gener and power it can handl an
enorm class of problem it is not hard to learn
those part of algol present in other compil languag how
to write assign and go to and for statement etc
inde a lot of the unnecessari restrict impos by other
compil languag have final been lift but algol also allow
mani unobvi thing to be written as we will see
later and herein li a problem algol seem to have
becom too gener so mani restrict have been lift that
a lot of technic detail crop up which ar hard
to learn and to us correctli in thi paper some
of the more obscur featur of the languag ar consid
and their us is discuss remark ar base on the
author interpret of the algol 60 report cacm june 1961
knuth d e merner j n ca610604 jb march 16
1978 10 48 pm 249 4 321 254 4 321
272 4 321 1102 4 321 1109 4 321 1140
4 321 1188 4 321 1234 4 321 1234 4
321 1306 4 321 1464 4 321 1491 4 321
1767 4 321 1781 4 321 1787 4 321 1949
4 321 321 4 321 321 4 321 321 4
321 321 4 321 2059 4 321 2126 4 321
435 4 321 437 4 321 463 4 321 483
4 321 491 4 321 2732 4 321 560 4
321 583 4 321 3073 4 321 627 4 321
631 4 321 632 4 321 642 4 321 644
4 321 653 4 321 680 4 321 761 4
321 762 4 321 763 4 321 123 4 321
140 4 321 919 4 321 989 4 321 196
5 321 1234 5 321 254 5 321 321 5
321 321 5 321 321 5 321 400 5 321
401 5 321 402 5 321 196 6 321 944
6 321 321 6 321 321 6 321 385 6
321 387 6 321 400 6 321 402 6 321
404 6 321 3184 6 321 729 6 321 
# 322
oper compat of system convent the gener standard committe of
the share organ ha devot consider effort to the problem
of oper a comput effici in view of the grow
number of program system avail each of these program system
ha been code to util a fix set of hardwar
compon without recogn the fact that other mai be occupi
a storag medium requir by the first these incompat ar
current resolv by manual set up the comput for each
system as requir the follow set of convent is be
consid to minim comput set up time thei ar of
suffici broad interest that we feel other comput user should
be awar of them georg f ryckman chairman cacm june
1961 bright h s ca610603 jb march 16 1978 10
55 pm 322 5 322 322 5 322 322 5
322 
# 323
the state of digit comput technolog in europ cacm june
1961 blachman n m ca610602 jb march 16 1978 10
56 pm 323 4 323 689 4 323 1349 5
323 217 5 323 323 5 323 323 5 323
323 5 323 689 5 323 217 6 323 236
6 323 323 6 323 323 6 323 83 6
323 415 6 323 3197 6 323 
# 324
romberg integr algorithm 60 cacm june 1961 bauer f l
ca610601 jb march 16 1978 10 57 pm 1352 5
324 1982 5 324 324 5 324 324 5 324
324 5 324 2040 5 324 1 6 324 834
6 324 872 6 324 1040 6 324 1092 6
324 1241 6 324 1241 6 324 1273 6 324
1273 6 324 1273 6 324 1352 6 324 1356
6 324 1883 6 324 324 6 324 324 6
324 324 6 324 429 6 324 570 6 324
621 6 324 621 6 324 786 6 324 
# 325
numer solut of the polynomi equat algorithm 30 cacm mai
1961 alexand w j ca610509 jb march 16 1978 10
58 pm 325 5 325 325 5 325 325 5
325 
# 326
mathsort algorithm 23 cacm mai 1961 ranshaw r w ca610508
jb march 16 1978 10 59 pm 326 5 326
326 5 326 326 5 326 
# 327
zero of a real polynomi by result procedur algorithm 59
cacm mai 1961 bareiss e h fisherkel m a ca610507
jb march 16 1978 11 01 pm 1667 5 327
327 5 327 327 5 327 327 5 327 178
6 327 1242 6 327 327 6 327 
# 328
matrix invers algorithm 58 cacm mai 1961 cohen d ca610506
jb march 16 1978 11 03 pm 328 5 328
328 5 328 328 5 328 
# 329
automat abstract and index survei and recommend in prepar for
the widespread us of automat scanner which will read document
and transmit their content to other machin for analysi thi
report present a new concept in automat analysi the rel
frequenc approach to measur the signific of word word group
and sentenc the rel frequenc approach is discuss in detail
as is it applic to problem of automat index and
automat abstract includ in the report is a summari of
automat analysi studi publish as of the date of write
conclus ar that point toward more sophist mathemat and linguist
techniqu for the solut of problem of automat analysi cacm
mai 1961 edmundson h p wylli r e ca610505 jb
march 16 1978 11 08 pm 1087 5 329 329
5 329 329 5 329 329 5 329 634 5
329 329 6 329 329 6 329 
# 330
a method for evalu the area of the normal function
cacm mai 1961 baker f b ca610504 jb march 16
1978 11 09 pm 330 5 330 330 5 330
330 5 330 
# 331
success approxim and comput storag problem in ordinari differenti equat
cacm mai 1961 bellman r ca610503 jb march 16 1978
11 10 pm 331 5 331 331 5 331 331
5 331 
# 332
an indirect chain method for address on secondari kei method
for enter random access file on the basi of on
kei ar briefli survei the wide us chain method base
on a pseudo random kei transform is review in more
detail an effici gener of the chain method which permit
recoveri on addit kei is then present cacm mai 1961
johnson l r ca610502 jb march 16 1978 11 13
pm 911 5 332 1271 5 332 1785 5 332
332 5 332 332 5 332 332 5 332 2543
5 332 2552 5 332 911 6 332 911 6
332 1785 6 332 1785 6 332 1786 6 332
1973 6 332 332 6 332 332 6 332 332
6 332 332 6 332 332 6 332 2107 6
332 2109 6 332 2203 6 332 492 6 332
492 6 332 
# 333
design of an improv transmiss data process code cacm mai
1961 bemer r w smith jr h j william jr
f a ca610501 jb march 16 1978 11 14 pm
333 4 333 230 5 333 333 5 333 333
5 333 333 5 333 
# 334
divis and squar root in the quater imaginari number system
cacm april 1961 nadler m ca610334 jb march 16 1978
11 16 pm 334 5 334 334 5 334 334
5 334 
# 335
some numer experi us newton s method for nonlinear parabol
and ellipticboundari valu problem us a gener of newton s
method a nonlinear parabol equat of the form u t
u xx g u and a nonlinear ellipt equat u
xx u yy exp u ar solv numer comparison of
these result with result obtain us the picard iter procedur
show that in mani case the quisi linear method offer
substanti advantag in both time and accuraci cacm april 1961
bellman r juncosa m l kalaba r ca610433 jb march
16 1978 11 20 pm 335 5 335 335 5
335 335 5 335 
# 336
a practic techniqu for the determin of the optimum relax
factor of the success over relax method cacm april 1961
kulsrud h e ca610432 jb march 16 1978 11 27
pm 336 5 336 336 5 336 336 5 336
# 337
further survei of punch card code cacm april 1961 ross
h m ca610431 jb march 16 1978 11 34 pm
337 5 337 337 5 337 337 5 337 
# 338
grout ii algorithm 43 cacm april 1961 thacher jr h
ca610430 jb march 16 1978 11 35 pm 338 5
338 338 5 338 338 5 338 
# 339
real exponenti integr algorithm 20 cacm april 1961 alexand w
j thacher jr h c ca610429 jb march 16 1978
11 36 pm 339 5 339 339 5 339 339
5 339 
# 340
legendr polynomi algorithm 13 cacm april 1961 herndon j ca610428
jb march 16 1978 11 37 pm 1611 5 340
340 5 340 340 5 340 340 5 340 1295
6 340 340 6 340 
# 341
chebyschev polynomi algorithm 10 cacm april 1961 herndon j ca610427
jb march 16 1978 11 38 pm 341 5 341
341 5 341 341 5 341 
# 342
solut of polynomi equat by barstow hitchcock algorithm 3 cacm
april 1961 herndon j ca610426 jb march 16 1978 11
39 pm 342 5 342 342 5 342 342 5
342 
# 343
on frequent occur error in algol 60 program algorithm 25
cacm april 1961 herndon j ca610425 jb march 16 1978
11 40 pm 343 5 343 343 5 343 343
5 343 
# 344
ber or bei function algorithm 57 cacm april 1961 herndon
j r ca610424 jb march 16 1978 11 42 pm
344 5 344 344 5 344 344 5 344 
# 345
complet ellipt integr of the second kind algorithm 56 cacm
april 1961 herndon j r ca610423 jb march 16 197811
43 pm 345 5 345 345 5 345 345 5
345 
# 346
complet ellipt integr of the first kind algorithm 55 cacm
april 1961 herndon j r ca610422 jb march 16 1978
11 44 pm 346 5 346 346 5 346 346
5 346 
# 347
gamma function for rang 1 to 2 algorithm 54 cacm
april 1961 herndon j r ca610421 jb march 16 1978
11 45 pm 347 5 347 347 5 347 347
5 347 
# 348
nth root of a complex number algorithm 53 cacm april
1961 herndon j r ca610420 jb march 16 1978 11
47 pm 348 5 348 348 5 348 348 5
348 
# 349
a set of test matric cacm april 1961 herndon j
r ca610419 jb march 16 1978 11 47 pm 349
5 349 349 5 349 349 5 349 
# 350
adjust invers of a matrix when an element is perturb
algorithm 51 cacm april 1961 herndon j r ca610418 jb
march 16 1978 11 49 pm 350 5 350 350
5 350 350 5 350 
# 351
invers of a finit segment of the hilbert matrix algorithm
50 cacm april 1961 herndon j r ca610417 jb march
16 1978 11 50 pm 351 5 351 351 5
351 351 5 351 
# 352
spheric neumant function algorithm 49 cacm april 1961 herndon j
r ca610416 jb march 16 1978 11 51 pm 352
5 352 352 5 352 352 5 352 
# 353
logarithm of a complex number algorithm 48 cacm april 1961
herndon j r ca610415 jb march 16 1978 11 53
pm 353 5 353 353 5 353 353 5 353
# 354
associ legendr function of the first kind for real or
imaginari argument algorithm 47 cacm april 1961 herndon j r
ca610414 jb march 16 1978 11 57 pm 354 5
354 354 5 354 354 5 354 
# 355
exponenti of a complex number algorithm 46 cacm april 1961
herndon j r ca610413 jb march 16 1978 11 59
pm 355 5 355 355 5 355 355 5 355
# 356
interest algorithm 45 cacm april 1961 ingerman p z ca610412
jb march 17 1978 12 00 am 356 5 356
356 5 356 356 5 356 
# 357
bessel function comput recurs algorithm 44 cacm april 1961 wojcicki
m e ca610411 jb march 17 1978 12 01 am
357 5 357 357 5 357 357 5 357 
# 358
crout with pivot ii algorithm 43 cacm april 1961 thacher
jr h c ca610410 jb march 17 1978 12 02
am 358 5 358 358 5 358 358 5 358
# 359
invert algorithm 42 cacm april 1961 wood t c ca610409
jb march 17 1978 12 03 am 359 5 359
359 5 359 359 5 359 
# 360
evalu of determin algorithm 41 cacm april 1961 solomon j
g ca610408 jb march 17 1978 12 04 am 1946
5 360 360 5 360 360 5 360 360 5
360 878 6 360 902 6 360 1093 6 360
1177 6 360 1387 6 360 1393 6 360 360
6 360 731 6 360 
# 361
program error correct on a decim comput cacm april 1961
weinberg g m ca610407 jb march 17 1978 12 05
am 361 4 361 108 5 361 361 5 361
361 5 361 361 5 361 
# 362
tabl look at techniqu cacm april 1961 sherman p m
ca610406 jb march 17 1978 12 08 am 362 4
362 2952 4 362 142 5 362 362 5 362
362 5 362 362 5 362 
# 363
on approxim transcendent number by continu fraction cacm april 1961
karst e ca610405 jb march 17 1978 12 09 am
363 5 363 363 5 363 363 5 363 
# 364
on the compil of subscript variabl cacm april 1961 nather
r e ca610404 jb march 17 1978 12 10 am
222 4 364 224 4 364 267 4 364 1134
4 364 1139 4 364 1141 4 364 1141 4
364 1215 4 364 1223 4 364 1647 4 364
1781 4 364 1787 4 364 1792 4 364 364
4 364 364 4 364 364 4 364 364 4
364 364 4 364 405 4 364 405 4 364
438 4 364 438 4 364 561 4 364 44
4 364 763 4 364 100 5 364 224 5
364 364 5 364 364 5 364 364 5 364
44 5 364 77 5 364 98 5 364 
# 365
bessel function of integr order and complex argument cacm april
1961 grai m c ca610403 jb march 17 1978 12
13 am 365 5 365 365 5 365 365 5
365 
# 366
eigenvalu of a symmetr 3 x 3 matrix cacm april
1961 smith o k ca610402 jb march 17 1978 12
14 am 366 5 366 366 5 366 366 5
366 
# 367
topolog order of a list of randomli number element of
a network a network of direct line segment free of
circular element is assum the line ar identifi by their
termin node and the node ar assum to be number
by a non topolog system given a list of these
line in numer order a simpl techniqu can be us
to creat at high speed a list in topolog order
cacm april 1961 lasser d j ca610401 jb march 17
1978 12 17 am 1050 5 367 1226 5 367
367 5 367 367 5 367 367 5 367 441
5 367 758 5 367 849 6 367 106 6
367 209 6 367 367 6 367 367 6 367
367 6 367 367 6 367 441 6 367 627
6 367 
# 368
real zero of an arbitrari function algorithm 25 cacm march
1961 colling r m ca610314 jb march 17 1978 12
31 am 368 5 368 368 5 368 368 5
368 
# 369
crout with pivot algorithm 16 cacm march 1961 thacher jr
h c ca610313 jb march 17 1978 12 32 am
369 5 369 369 5 369 369 5 369 
# 370
bisect routin algorithm 4 cacm march 1961 rader p j
ca610312 jb march 17 1978 12 33 am 370 5
370 370 5 370 370 5 370 
# 371
remark on algorithm 2 and 3 algorithm 15 and algorithm
25 and 26 cacm march 1961 wilkinson j h ca610311
jb march 17 1978 12 35 am 371 5 371
371 5 371 371 5 371 
# 372
critic path schedul algorithm 40 cacm march 1961 leavenworth b
ca610310 jb march 17 1978 12 36 am 372 5
372 372 5 372 372 5 372 
# 373
correl coeffici with matrix multipl algorithm 39 cacm march 1961
sassouni p ca610309 jb march 17 1978 12 37 am
373 5 373 373 5 373 373 5 373 
# 374
telescope2 algorithm 38 cacm march 1961 bron k a ca610308
jb march 17 1978 12 38 am 374 5 374
374 5 374 374 5 374 
# 375
telescope1 algorithm 37 cacm march 1961 bron k a ca610307
jb march 17 1978 12 39 am 375 5 375
375 5 375 375 5 375 
# 376
tchebycheff algorithm 36 cacm march 1961 gianni a j ca610306
jb march 17 1978 12 40 am 1754 5 376
376 5 376 376 5 376 376 5 376 274
6 376 376 6 376 
# 377
siev algorithm 35 cacm march 1961 wood t c ca610305
jb march 17 1978 12 41 am 1841 5 377
377 5 377 377 5 377 377 5 377 2120
5 377 1537 6 377 1539 6 377 1539 6
377 1841 6 377 377 6 377 377 6 377
# 378
a gener techniqu for symbol manipul and numer calcul cacm
march 1961 ross d t ca610304 jb march 17 1978
12 42 am 1024 4 378 1050 4 378 1051
4 378 1102 4 378 1102 4 378 1132 4
378 1390 4 378 1486 4 378 1549 4 378
1706 4 378 1826 4 378 1878 4 378 378
4 378 378 4 378 378 4 378 2060 4
378 2155 4 378 2168 4 378 2719 4 378
2723 4 378 2838 4 378 2842 4 378 2855
4 378 2879 4 378 3008 4 378 3077 4
378 3080 4 378 3106 4 378 627 4 378
731 4 378 798 4 378 106 4 378 1051
5 378 208 5 378 209 5 378 210 5
378 1552 5 378 1665 5 378 1860 5 378
378 5 378 378 5 378 378 5 378 2155
5 378 1184 6 378 1366 6 378 1389 6
378 1389 6 378 1421 6 378 1421 6 378
1496 6 378 1626 6 378 1641 6 378 1781
6 378 1785 6 378 1786 6 378 210 6
378 210 6 378 378 6 378 378 6 378
378 6 378 378 6 378 378 6 378 2046
6 378 2060 6 378 406 6 378 3184 6
378 631 6 378 731 6 378 793 6 378
794 6 378 799 6 378 
# 379
bitwis oper cacm march 1961 strachei c ca610303 jb march
17 1978 12 42 am 379 5 379 379 5
379 379 5 379 
# 380
comparison of iter method for the calcul of nth root
three iter method for calcul of nth root includ on
propos by the author ar compar in two wai 1
theoret converg estim ar given 2 a new macrocompil which
estim machin run time is us to compar the run
time of the three method for a varieti of input
data cacm march 1961 traub j f ca610302 jb march
17 1978 12 45 am 319 5 380 380 5
380 380 5 380 380 5 380 380 6 380
# 381
an altern form of the uncol diagram cacm march 1961
bratman h ca610301 jb march 17 1978 12 46 am
1159 4 381 1988 4 381 381 4 381 1781
5 381 1988 5 381 381 5 381 381 5
381 381 5 381 14 5 381 123 6 381
196 6 381 919 6 381 990 6 381 1007
6 381 1046 6 381 1131 6 381 1139 6
381 1140 6 381 1149 6 381 1198 6 381
1215 6 381 1223 6 381 1265 6 381 1303
6 381 1323 6 381 1358 6 381 1366 6
381 1421 6 381 1460 6 381 1462 6 381
1463 6 381 1467 6 381 1468 6 381 1477
6 381 1491 6 381 1496 6 381 1496 6
381 1531 6 381 1535 6 381 1565 6 381
1601 6 381 1602 6 381 1613 6 381 1614
6 381 1626 6 381 1641 6 381 1787 6
381 1788 6 381 205 6 381 224 6 381
249 6 381 288 6 381 316 6 381 381
6 381 381 6 381 398 6 381 11 6
381 11 6 381 14 6 381 404 6 381
410 6 381 463 6 381 464 6 381 483
6 381 3184 6 381 3188 6 381 584 6
381 600 6 381 680 6 381 691 6 381
763 6 381 799 6 381 
# 382
statist program at the univers of north carolina cacm februari
1961 bush n ca610216 jb march 17 1978 12 48
am 382 5 382 382 5 382 382 5 382
# 383
on find minimum rout in a network with turn penalti
cacm februari 1961 caldwel t ca610215 jb march 17 1978
12 49 am 383 5 383 383 5 383 383
5 383 
# 384
gamma function algorithm 34 cacm februari 1961 lipp m f
ca610214 jb march 17 1978 12 49 am 384 5
384 384 5 384 384 5 384 
# 385
factori algorithm 33 cacm februari 1961 lipp m f ca610213
jb march 17 1978 12 50 am 1234 5 385
385 5 385 385 5 385 385 5 385 944
6 385 321 6 385 385 6 385 400 6
385 402 6 385 404 6 385 3184 6 385
729 6 385 
# 386
multint algorithm 32 cacm februari 1961 freeman jr r d
ca610212 jb march 17 1978 12 52 am 1146 5
386 386 5 386 386 5 386 386 5 386
386 6 386 
# 387
gamma function algorithm 31 cacm februari 1961 colling r m
ca610211 jb march 17 1978 12 53 am 254 5
387 387 5 387 387 5 387 387 5 387
196 6 387 321 6 387 387 6 387 
# 388
solut of polynomi equat by bairstow hitchcock method algorithm 3
cacm februari 1961 vandergraft j s ca610210 jb march 17
1978 12 54 am 388 5 388 388 5 388
388 5 388 
# 389
real exponenti integr algorithm 20 cacm februari 1961 peavi s
ca610209 jb march 17 1978 12 55 am 389 5
389 389 5 389 389 5 389 
# 390
complex exponenti integr algorithm 13 cacm februari 1961 rader p
j thacher jr h c ca610208 jb march 17 1978
12 56 am 390 5 390 390 5 390 390
5 390 
# 391
the bk system for the philco 2000 cacm februari 1961
smith r b ca610207 jb march 17 1978 12 57
am 391 5 391 391 5 391 391 5 391
# 392
comment on a paper on parallel process cacm februari 1961
nekora m r ca610206 jb march 17 1978 12 58
am 392 5 392 392 5 392 392 5 392
# 393
two subroutin for symbol manipul with an algebra compil cacm
februari 1961 carr iii j w hanson j w ca610205
jb march 17 1978 12 59 am 393 5 393
393 5 393 393 5 393 561 5 393 393
6 393 77 6 393 
# 394
multipl program data process cacm februari 1961 ryle b l
ca610204 jb march 17 1978 1 00 am 394 5
394 394 5 394 394 5 394 
# 395
multipl precis divis cacm februari 1961 rabinowitz p ca610202 jb
march 17 1978 1 01 am 395 5 395 395
5 395 395 5 395 
# 396
autom of program debug automat debug can substanti reduc lead
time between the code and the effect us of a
complex program it also enforc analysi of debug criteria result
in verifi accur program the programm specifi the program to
be debug memori area set of input data maximum repetit
of loop and checkpoint inform for each set of data
the execut debug program the run the program to be
debug perform check function and creat a trace record of
it own later analysi and locat of error applic ar
quit flexibl and the system can be us alon or
in conjunct with other debug techniqu cacm juli 1961 jacobi
k layton h ca610714 es march 17 1982 10 10
am 931 5 396 396 5 396 396 5 396
396 5 396 202 6 396 396 6 396 634
6 396 
# 397
a card format for refer file in inform process thi
paper propos a card format suitabl for a varieti of
refer file in inform process an 80 column ibm card
is divid into two field refer materi field column 1
67 and identif field column 68 80 the format for
the refer materi is flexibl while the format for the
identif is rigid the refer materi includ basic an index
titl sourc class summari and cross refer for each entri
the identif includ basic code for a matrix of descriptor
an entri number and the kind major interest and sourc
of the refer the identif also provid a choic to
identifi materi for person as well as gener file sinc
thi card format is suffici to identifi the materi normal
associ with refer file for book articl program term hardwar
term equip machin system abbrevi etc it is suitabl as
a standard for card refer file in inform process cacm
februari 1961 grem m ca610201 jb march 17 1978 1
08 am 929 5 397 397 5 397 397 5
397 397 5 397 397 6 397 
# 398
the slang system cacm januari 1961 siblei r a ca610116
jb march 17 1978 1 10 am 205 4 398
210 4 398 214 4 398 1982 4 398 398
4 398 642 4 398 669 4 398 100 4
398 123 4 398 164 4 398 1 5 398
1781 5 398 398 5 398 398 5 398 398
5 398 123 6 398 196 6 398 919 6
398 990 6 398 1007 6 398 1046 6 398
1131 6 398 1139 6 398 1140 6 398 1149
6 398 1198 6 398 1215 6 398 1223 6
398 1265 6 398 1303 6 398 1323 6 398
1358 6 398 1366 6 398 1421 6 398 1460
6 398 1462 6 398 1463 6 398 1467 6
398 1468 6 398 1477 6 398 1491 6 398
1496 6 398 1531 6 398 1535 6 398 1565
6 398 1601 6 398 1602 6 398 1613 6
398 1614 6 398 1626 6 398 1641 6 398
1787 6 398 1788 6 398 205 6 398 224
6 398 249 6 398 288 6 398 316 6
398 381 6 398 398 6 398 11 6 398
404 6 398 410 6 398 463 6 398 464
6 398 483 6 398 3184 6 398 3188 6
398 584 6 398 600 6 398 680 6 398
691 6 398 763 6 398 799 6 398 
# 399
compil techniqu for boolean express and condit statement in algol
60 cacm januari 1961 huskei h d wattenburg w h
ca610115 jb march 17 1978 1 12 am 1139 5
399 1947 5 399 399 5 399 399 5 399
399 5 399 556 5 399 799 5 399 945
6 399 1134 6 399 1223 6 399 1248 6
399 224 6 399 399 6 399 399 6 399
399 6 399 399 6 399 82 6 399 404
6 399 404 6 399 438 6 399 464 6
399 631 6 399 
# 400
comment on the implement of recurs procedur and block in
algol 60 cacm januari 1961 iron e t feurzeig w
ca610114 jb march 17 1978 1 13 am 1234 5
400 321 5 400 400 5 400 400 5 400
400 5 400 196 6 400 944 6 400 321
6 400 385 6 400 400 6 400 400 6
400 401 6 400 402 6 400 402 6 400
404 6 400 3184 6 400 729 6 400 
# 401
alloc of storag for arrai in algol 60 cacm januari
1961 sattlei k ca610113 jb march 17 1978 1 14
am 321 5 401 401 5 401 401 5 401
401 5 401 196 6 401 400 6 401 401
6 401 402 6 401 
# 402
dynam declar cacm januari 1961 ingerman p z ca610112 jb
march 17 1978 1 14 am 1234 5 402 321
5 402 402 5 402 402 5 402 402 5
402 196 6 402 944 6 402 321 6 402
385 6 402 400 6 402 400 6 402 401
6 402 402 6 402 402 6 402 404 6
402 3184 6 402 729 6 402 
# 403
thunk a wai of compil procedur statement with some comment
on procedur declar cacm januari 1961 ingerman p z ca610111
jb march 17 1978 1 16 am 403 5 403
403 5 403 403 5 403 
# 404
a syntax direct compil for algol 60 cacm januari 1961
iron e t ca610110 jb march 17 1978 1 16
am 945 5 404 1046 5 404 1105 5 404
1139 5 404 1140 5 404 1234 5 404 1263
5 404 1265 5 404 1496 5 404 1781 5
404 1824 5 404 2126 5 404 2546 5 404
404 5 404 404 5 404 404 5 404 464
5 404 584 5 404 631 5 404 653 5
404 680 5 404 763 5 404 795 5 404
799 5 404 823 6 404 123 6 404 196
6 404 196 6 404 196 6 404 196 6
404 196 6 404 196 6 404 196 6 404
919 6 404 931 6 404 944 6 404 945
6 404 989 6 404 990 6 404 1007 6
404 1046 6 404 1131 6 404 1137 6 404
1139 6 404 1140 6 404 1141 6 404 1149
6 404 1198 6 404 1215 6 404 1223 6
404 1265 6 404 1303 6 404 1323 6 404
1358 6 404 1358 6 404 1366 6 404 1421
6 404 1460 6 404 1462 6 404 1463 6
404 1467 6 404 1468 6 404 1477 6 404
1477 6 404 1491 6 404 1491 6 404 1496
6 404 1531 6 404 1535 6 404 1565 6
404 1601 6 404 1602 6 404 1613 6 404
1614 6 404 1614 6 404 1614 6 404 1626
6 404 1641 6 404 1693 6 404 1781 6
404 1787 6 404 1788 6 404 205 6 404
224 6 404 224 6 404 224 6 404 249
6 404 265 6 404 288 6 404 316 6
404 321 6 404 381 6 404 385 6 404
398 6 404 399 6 404 399 6 404 11
6 404 2126 6 404 82 6 404 400 6
404 402 6 404 404 6 404 404 6 404
404 6 404 404 6 404 404 6 404 404
6 404 404 6 404 404 6 404 404 6
404 404 6 404 404 6 404 404 6 404
404 6 404 404 6 404 404 6 404 404
6 404 404 6 404 404 6 404 404 6
404 404 6 404 404 6 404 410 6 404
412 6 404 438 6 404 463 6 404 464
6 404 464 6 404 464 6 404 483 6
404 3184 6 404 3184 6 404 3184 6 404
3184 6 404 3184 6 404 3188 6 404 584
6 404 600 6 404 631 6 404 631 6
404 631 6 404 635 6 404 680 6 404
691 6 404 729 6 404 763 6 404 799
6 404 
# 405
an algorithm for code effici arithmet oper most exist formula
translat scheme yield ineffici code a method is describ which
reduc the number of store and fetch oper evalu constant
subexpress dure compil and recogn mani equival subexpress cacm januari
1961 floyd r w ca610109 jb march 17 1978 1
19 am 267 4 405 1134 4 405 1139 4
405 1141 4 405 1141 4 405 1215 4 405
1223 4 405 1647 4 405 1781 4 405 1787
4 405 1792 4 405 364 4 405 364 4
405 405 4 405 405 4 405 405 4 405
405 4 405 438 4 405 438 4 405 561
4 405 44 4 405 54 4 405 763 4
405 1223 5 405 224 5 405 1388 5 405
405 5 405 405 5 405 405 5 405 436
5 405 55 5 405 77 5 405 93 5
405 224 6 405 405 6 405 405 6 405
405 6 405 731 6 405 
# 406
the us of thread list in construct a combin algol
and machin like assembl processor cacm januari 1961 evan jr
a perli a j van zoeren h ca610108 jb march
17 1978 1 20 am 1051 5 406 1102 5
406 1549 5 406 406 5 406 406 5 406
406 5 406 106 6 406 196 6 406 1051
6 406 209 6 406 210 6 406 210 6
406 210 6 406 378 6 406 406 6 406
406 6 406 406 6 406 483 6 406 627
6 406 731 6 406 731 6 406 753 6
406 793 6 406 794 6 406 
# 407
madcap a scientif compil for a displai formula textbook languag
cacm januari 1961 well m b ca610107 jb march 17
1978 1 21 am 1083 5 407 1396 5 407
407 5 407 407 5 407 407 5 407 679
5 407 964 6 407 1028 6 407 1029 6
407 1083 6 407 1132 6 407 1214 6 407
1278 6 407 1334 6 407 1365 6 407 1386
6 407 1387 6 407 1388 6 407 1392 6
407 1393 6 407 1394 6 407 1395 6 407
1396 6 407 1397 6 407 1496 6 407 284
6 407 21 6 407 407 6 407 407 6
407 407 6 407 3184 6 407 3192 6 407
3193 6 407 3199 6 407 3200 6 407 3201
6 407 3202 6 407 3203 6 407 3204 6
407 561 6 407 730 6 407 730 6 407
# 408
the intern organ of the mad translat cacm januari 1961
arden b w galler b a graham r m ca610106
jb march 17 1978 1 22 am 1134 5 408
1179 5 408 1861 5 408 408 5 408 408
5 408 408 5 408 830 6 408 1614 6
408 1781 6 408 17 6 408 77 6 408
408 6 408 408 6 408 408 6 408 
# 409
cl 1 an environ for a compil a flexibl larg
scale program system to facilit the solut of inform process
problem and to provid intercommun between program and or programm
ha been develop and realiz on the ibm 709 7090
comput the system is base on a master file concept
and ha provis for accept store and retriev both descript
and instanc of larg and complex data set as well
as algorithm defin on these data set both data and
algorithm mai be express in a famili of command and
descript languag the concept of distinct data descript and the
content and us of such descript ar discuss in some
detail cacm januari 1961 cheatham jr t e collin jr
g o leonard g f ca610105 jb march 17 1978
1 26 am 409 5 409 409 5 409 409
5 409 657 5 409 279 6 409 409 6
409 
# 410
the clip translat cacm januari 1961 englund d clark e
ca610104 jb march 17 1978 1 27 am 1781 5
410 410 5 410 410 5 410 410 5 410
669 5 410 1 6 410 123 6 410 196
6 410 919 6 410 990 6 410 1007 6
410 1046 6 410 1131 6 410 1139 6 410
1140 6 410 1149 6 410 1198 6 410 1215
6 410 1223 6 410 1265 6 410 1303 6
410 1323 6 410 1358 6 410 1366 6 410
1421 6 410 1460 6 410 1462 6 410 1463
6 410 1467 6 410 1468 6 410 1477 6
410 1491 6 410 1496 6 410 1531 6 410
1535 6 410 1565 6 410 1601 6 410 1602
6 410 1613 6 410 1614 6 410 1626 6
410 1641 6 410 1787 6 410 1788 6 410
205 6 410 224 6 410 249 6 410 288
6 410 316 6 410 381 6 410 398 6
410 11 6 410 404 6 410 410 6 410
410 6 410 463 6 410 464 6 410 483
6 410 3184 6 410 3184 6 410 3188 6
410 584 6 410 600 6 410 680 6 410
691 6 410 763 6 410 799 6 410 
# 411
us of magnet tape for data storag in the oracl
algol translat cacm januari 1961 bottenbruch h ca610103 jb march
17 1978 1 28 am 411 5 411 411 5
411 411 5 411 
# 412
recurs process and algol translat cacm januari 1961 grai a
a ca610102 jb march 17 1978 1 29 am 412
5 412 412 5 412 412 5 412 763 5
412 196 6 412 224 6 412 404 6 412
412 6 412 631 6 412 
# 413
a basic compil for arithmet express cacm januari 1961 huskei
h d wattenburg w h ca610101 jb march 17 1978
1 30 am 413 5 413 413 5 413 413
5 413 
# 414
ibm 1440 data process system featur five new unit the
ibm 1440 data process system announc recent by the intern
busi machin corpor not onli featur the 1311 disk storag
drive with interchang disk pack but four other newli develop
unit cacm decemb 1961 wheel r ca621225 jb march 17
1978 4 30 pm 414 5 414 414 5 414
414 5 414 
# 415
the us of digit comput in western germani cacm decemb
1962 schuff h k ca621224 jb march 17 1978 4
32 pm 1349 5 415 415 5 415 415 5
415 415 5 415 236 6 415 323 6 415
83 6 415 415 6 415 
# 416
multipl shoot method for two point boundari valu problem cacm
decemb 1962 morrison d d rilei j d zancanaro j
f ca621223 jb march 17 1978 4 33 pm 1049
5 416 416 5 416 416 5 416 416 5
416 416 6 416 
# 417
legal implic of comput us thi paper point out a
varieti of wai comput system us in busi and industri
can be involv in legal entangl and suggest that comput
specialist have a respons to call for assist in forestal
or minim those entangl dure the plan stage techniqu ar
suggest for make legal clearanc effect with the least burden
on the new technolog and for achiev a favor legal
climat for it gener comput specialist also ar alert to
potenti opportun to interpret to lawyer the technic aspect of
comput system involv in legal situat cacm decemb 1962 freed
r n ca621222 jb march 17 1978 4 37 pm
417 5 417 417 5 417 417 5 417 
# 418
random algorithm 133 cacm decemb 1962 behrenz p g ca621221
jb march 17 1978 4 38 pm 418 5 418
418 5 418 418 5 418 
# 419
magic squar algorithm 118 cacm decemb 1962 thacher jr h
c ca621220 jb march 17 1978 4 52 pm 419
5 419 419 5 419 419 5 419 
# 420
perm algorithm 115 cacm decemb 1962 phillip e s ca621219
jb march 17 1978 4 53 pm 420 5 420
420 5 420 420 5 420 
# 421
posit of point rel to polygon algorithm 112 cacm decemb
1962 hacker r ca621218 jb march 17 1978 4 54
pm 1804 5 421 2987 5 421 421 5 421
421 5 421 421 5 421 1326 6 421 1630
6 421 2125 6 421 2547 6 421 2633 6
421 421 6 421 421 6 421 524 6 421
524 6 421 
# 422
combin algorithm 94 cacm decemb 1962 grench r e ca621217
jb march 17 1978 4 56 pm 422 5 422
422 5 422 422 5 422 
# 423
matrix invers algorithm 58 cacm decemb 1962 behrenz p g
ca621216 jb march 17 1978 4 57 pm 423 5
423 423 5 423 423 5 423 
# 424
gamma function algorithm 31 cacm decemb 1962 behrenz p g
ca621215 jb march 17 1978 4 58 pm 424 5
424 424 5 424 424 5 424 
# 425
complet ellipt integr algorithm 149 cacm decemb 1962 merner j
n ca621214 jb march 17 1978 4 59 pm 425
5 425 425 5 425 425 5 425 
# 426
term of magic squar algorithm 148 cacm decemb 1962 collison
d m ca621213 jb march 17 1978 5 00 pm
426 5 426 426 5 426 426 5 426 
# 427
psif algorithm 147 cacm decemb 1962 amit d ca621212 jb
march 17 1978 5 03 pm 427 5 427 427
5 427 427 5 427 
# 428
multipl integr algorithm 146 cacm decemb 1962 mckeeman w m
ca621211 jb march 17 1978 5 04 pm 428 5
428 428 5 428 428 5 428 
# 429
adapt nimer integr by simpson s rule algorithm 145 cacm
decemb 1962 mckeeman w m ca621210 jb march 17 1978
5 06 pm 1352 5 429 2048 5 429 2074
5 429 2093 5 429 2550 5 429 429 5
429 429 5 429 429 5 429 834 6 429
834 6 429 834 6 429 834 6 429 872
6 429 872 6 429 872 6 429 1040 6
429 1092 6 429 1092 6 429 1241 6 429
1273 6 429 1298 6 429 1573 6 429 1573
6 429 324 6 429 2074 6 429 429 6
429 429 6 429 429 6 429 429 6 429
429 6 429 570 6 429 621 6 429 786
6 429 786 6 429 786 6 429 
# 430
treesort2 algorithm 144 cacm decemb 1962 kaup jr a f
ca621209 jb march 17 1978 5 07 pm 430 5
430 430 5 430 430 5 430 
# 431
treesort1 algorithm 143 cacm decemb 1962 kaup jr a f
ca621208 jb march 17 1978 5 08 pm 431 5
431 431 5 431 431 5 431 
# 432
triangular regress algorithm 142 cacm decemb 1962 haflei w l
lewi j s ca621207 jb march 17 1978 5 09
pm 432 5 432 432 5 432 432 5 432
# 433
fix world length arrai in variabl word length comput cacm
decemb 1962 sonquist j a ca621206 jb march 17 1978
5 10 pm 433 5 433 433 5 433 433
5 433 
# 434
charact manipul in 1620 fortran ii cacm decemb 1962 poor
jr j h ca621205 jb march 17 1978 5 11
pm 434 5 434 434 5 434 434 5 434
# 435
a decis matrix as the basi for a simpl data
input routin current a great deal of time and effort
is be spent on the develop of bigger and better
compil languag multiprogram execut system etc sinc the implement of
of new method and procedur is not instantan but rather
occur by an evolutionari process we should be concern also
with the problem of maintain improv and incorpor new idea
into exist system it is with thi somewhat neglect area
that the author is interest a method emploi a decis
matrix is present for the handl of a standard system
program problem that of provid a data input routin cacm
decemb 1962 vasilako g j ca621204 jb march 17 1978
5 15 pm 249 4 435 254 4 435 272
4 435 1102 4 435 1109 4 435 1140 4
435 1188 4 435 1306 4 435 1464 4 435
1491 4 435 1767 4 435 1781 4 435 1787
4 435 1949 4 435 321 4 435 2059 4
435 2126 4 435 435 4 435 435 4 435
437 4 435 463 4 435 483 4 435 491
4 435 2732 4 435 560 4 435 583 4
435 3073 4 435 627 4 435 631 4 435
632 4 435 642 4 435 644 4 435 653
4 435 680 4 435 761 4 435 762 4
435 763 4 435 849 4 435 123 4 435
140 4 435 919 4 435 989 4 435 196
5 435 1053 5 435 435 5 435 435 5
435 435 5 435 615 5 435 435 6 435
474 6 435 718 6 435 720 6 435 
# 436
evalu of polynomi by comput cacm decemb 1962 knuth d
e ca621203 jb march 17 1978 5 16 pm 1223
4 436 1388 4 436 436 4 436 1620 5
436 405 5 436 436 5 436 436 5 436
436 5 436 819 5 436 819 6 436 436
6 436 436 6 436 
# 437
compil matrix oper cacm decemb 1962 galler b a perli
a j ca621202 jb march 17 1978 5 17 pm
249 4 437 254 4 437 272 4 437 1102
4 437 1109 4 437 1140 4 437 1188 4
437 1306 4 437 1464 4 437 1491 4 437
1767 4 437 1781 4 437 1787 4 437 1949
4 437 321 4 437 2059 4 437 2126 4
437 435 4 437 437 4 437 463 4 437
483 4 437 491 4 437 2732 4 437 560
4 437 583 4 437 3073 4 437 627 4
437 631 4 437 632 4 437 642 4 437
644 4 437 653 4 437 680 4 437 761
4 437 762 4 437 763 4 437 123 4
437 140 4 437 919 4 437 989 4 437
196 5 437 1614 5 437 2253 5 437 2557
5 437 437 5 437 437 5 437 437 5
437 2081 6 437 437 6 437 437 6 437
437 6 437 3184 6 437 
# 438
mechan pragmat a time motion studi of a miniatur mechan
linguist system cacm decemb 1962 gorn s ca621201 jb march
17 1978 5 19 pm 249 4 438 267 4
438 1134 4 438 1139 4 438 1141 4 438
1141 4 438 1215 4 438 1223 4 438 1425
4 438 1647 4 438 1781 4 438 1781 4
438 1787 4 438 1792 4 438 364 4 438
364 4 438 405 4 438 405 4 438 438
4 438 438 4 438 438 4 438 438 4
438 561 4 438 44 4 438 3185 4 438
762 4 438 763 4 438 1139 5 438 224
5 438 249 5 438 303 5 438 438 5
438 438 5 438 438 5 438 77 5 438
3185 5 438 224 6 438 303 6 438 399
6 438 404 6 438 438 6 438 438 6
438 464 6 438 631 6 438 
# 439
on line digit comput for measur of a neurolog control
system cacm novemb 1962 stark l payn r okab y
ca621122 jb march 17 1978 5 20 pm 439 5
439 439 5 439 439 5 439 
# 440
record linkag special difficulti ar encount in devis reliabl system
for search and updat ani larg file of document that
must be identifi primarili on the basi of name and
other person particular the underli problem is that of make
nearli maximum us of item of identifi inform that ar
individu unreli but that mai collect be of consider discrimin
power rule that can be appli gener to name retriev
system have been develop in a methodolog studi of the
linkag of vital and health record into famili group for
demograph research purpos these rule ar describ and the wai
in which inform util for match mai be optim ar
discuss cacm novemb 1962 newcomb h b kennedi j m
ca621121 jb march 17 1978 5 51 pm 1112 4
440 1592 4 440 2111 4 440 2339 4 440
440 4 440 2339 5 440 440 5 440 440
5 440 440 5 440 619 5 440 1112 6
440 1592 6 440 440 6 440 619 6 440
# 441
topolog sort of larg network topolog sort is a procedur
requir for mani problem involv analysi of network an exampl
of on such problem is pert the present paper present
a veri gener method for obtain topolog order it permit
treatment of larger network than can be handl on present
procedur and achiev thi with greater effici although the procedur
can be adapt to ani machin it is discuss in
term of the 7090 a pert network of 30 000
activ can be order in less than on hour of
machin time the method wa develop as a byproduct of
procedur need by westinghous baltimor it ha not been program
and at present there ar no plan to implement it
in regard to the techniqu describ westinghous s present and
anticip need ar complet serv by the lockhe program which
is in current us cacm novemb 1962 kahn a b
ca621120 jb march 17 1978 5 58 pm 1050 4
441 1226 4 441 441 4 441 758 4 441
1723 5 441 367 5 441 441 5 441 441
5 441 441 5 441 758 5 441 367 6
441 441 6 441 441 6 441 
# 442
crout with equilibr and iter algorithm 135 cacm novemb 1962
mckeeman w m ca621119 jb march 17 1978 5 59
pm 442 5 442 442 5 442 442 5 442
# 443
complex number to a real power algorithm 106 cacm decemb
1962 erwin jr g w ca621118 jb march 17 1978
6 01 pm 443 5 443 443 5 443 443
5 443 
# 444
evalu of jacobi symbol algorithm 99 cacm novemb 1962 mai
r w ca621117 jb march 17 1978 6 02 pm
444 5 444 444 5 444 444 5 444 
# 445
combin algorithm 94 cacm novemb 1962 mai r w ca621116
jb march 17 1978 6 03 pm 445 5 445
445 5 445 445 5 445 
# 446
simpson s integr algorithm 84 cacm novemb 1962 behrenz p
g ca621115 jb march 17 1978 6 04 pm 446
5 446 446 5 446 446 5 446 
# 447
certif of the calcul of easter cacm novemb 1962 william
m r ca621114 jb march 17 1978 6 05 pm
447 5 447 447 5 447 447 5 447 
# 448
path matrix algorithm 141 cacm novemb 1962 ingerman p z
ca621113 jb march 17 1978 6 06 pm 448 5
448 448 5 448 448 5 448 
# 449
matrix invers algorithm 140 cacm novemb 1962 ingerman p z
ca621112 jb march 17 1978 6 12 pm 449 5
449 449 5 449 449 5 449 
# 450
solut of the diophantin equat algorithm 139 cacm novemb 1962
peck j e l ca621111 jb march 17 1978 6
13 pm 2031 5 450 450 5 450 450 5
450 450 5 450 1022 6 450 450 6 450
# 451
nest of for statement ii algorithm 138 cacm novemb 1962
dahm d m well m ca621110 jb march 17 1978
6 14 pm 451 5 451 451 5 451 451
5 451 
# 452
nest of for statement i algorithm 137 cacm novemb 1962
dahm d m well m ca621109 jb march 17 1978
6 15 pm 452 5 452 452 5 452 452
5 452 
# 453
enlarg of a group algorithm 136 cacm novemb 1962 well
m ca621108 jb march 17 1978 6 17 pm 453
5 453 453 5 453 453 5 453 
# 454
crout with equilibr and iter algorithm 135 cacm novemb 1962
mckeeman w m ca621107 jb march 17 1978 6 51
pm 1319 4 454 454 4 454 454 4 454
140 4 454 152 5 454 1177 5 454 454
5 454 454 5 454 454 5 454 586 5
454 806 5 454 932 6 454 454 6 454
454 6 454 
# 455
exponenti of seri algorithm 134 cacm novemb 1962 fetti h
e ca621106 jb march 17 1978 6 52 pm 455
5 455 455 5 455 455 5 455 
# 456
random algorithm 133 cacm novemb 1962 behrenz p g ca621105
jb march 17 1978 6 53 pm 1190 5 456
456 5 456 456 5 456 456 5 456 456
6 456 
# 457
quantum mechan integr over all slater type integr cacm novemb
1962 brown j c ca621104 jb march 17 1978 6
54 pm 457 5 457 457 5 457 457 5
457 
# 458
coeffici determin algorithm 131 cacm novemb 1962 smith v h
allen m l ca621103 jb march 17 1978 6 56
pm 458 5 458 458 5 458 458 5 458
# 459
permut algorithm 130 cacm novemb 1962 eav lt b c
ca621102 jb march 17 1978 6 57 pm 459 5
459 459 5 459 459 5 459 
# 460
minifun algorithm 129 cacm novemb 1962 whitlei v w ca621101
jb march 17 1978 6 58 pm 460 5 460
460 5 460 460 5 460 
# 461
code of medic case histori data for comput analysi cacm
octob 1962 lipkin m woodburi m a ca621019 jb march
17 1978 6 59 pm 461 5 461 461 5
461 461 5 461 
# 462
comput pattern recognit techniqu electrocardiograph diagnosi the us of program
digit comput as gener pattern classif and recognit devic is
on phase of the current live interest in artifici intellig
it is import to choos a class of signal which
is at present undergo a good deal of visual inspect
by train peopl for the purpos of pattern recognit in
thi wai comparison between machin and human perform mai be
obtain a practic result also serv as addit motiv clinic
electrocardiogram make up such a class of signal the approach
to the problem present here center upon the us of
multipl adapt match filter that classifi normal signal the present
report five some of the background for the applic of
thi method cacm octob 1962 stark l okajima m whippl
g h ca621018 jb march 17 1978 7 04 pm
1325 5 462 462 5 462 462 5 462 462
5 462 462 6 462 
# 463
on ambigu in phrase structur languag cacm octob 1962 floyd
r w ca621017 jb march 17 1978 7 05 pm
249 4 463 254 4 463 272 4 463 1102
4 463 1109 4 463 1140 4 463 1188 4
463 1306 4 463 1464 4 463 1491 4 463
1767 4 463 1781 4 463 1787 4 463 1949
4 463 321 4 463 2059 4 463 2126 4
463 435 4 463 437 4 463 463 4 463
483 4 463 491 4 463 2732 4 463 560
4 463 583 4 463 3073 4 463 627 4
463 631 4 463 632 4 463 642 4 463
644 4 463 653 4 463 680 4 463 761
4 463 762 4 463 763 4 463 123 4
463 140 4 463 919 4 463 989 4 463
196 5 463 1306 5 463 1781 5 463 463
5 463 463 5 463 463 5 463 123 6
463 196 6 463 196 6 463 919 6 463
990 6 463 1007 6 463 1046 6 463 1131
6 463 1139 6 463 1140 6 463 1149 6
463 1198 6 463 1215 6 463 1223 6 463
1265 6 463 1303 6 463 1323 6 463 1358
6 463 1366 6 463 1421 6 463 1460 6
463 1462 6 463 1463 6 463 1467 6 463
1468 6 463 1477 6 463 1491 6 463 1496
6 463 1531 6 463 1535 6 463 1565 6
463 1601 6 463 1602 6 463 1613 6 463
1614 6 463 1626 6 463 1641 6 463 1787
6 463 1788 6 463 205 6 463 224 6
463 249 6 463 288 6 463 316 6 463
381 6 463 398 6 463 11 6 463 404
6 463 410 6 463 463 6 463 463 6
463 464 6 463 483 6 463 3184 6 463
3188 6 463 584 6 463 600 6 463 680
6 463 691 6 463 763 6 463 799 6
463 
# 464
syntact analysi by digit comput thi paper provid an account
of the shadow languag that is us to describ syntax
and of a correspond subroutin that enabl a comput to
perform syntact analysi the input to thi subroutin consist of
a string to be analyz and a descript of the
syntax that is to be us the syntax is express
in the shadow languag the output consist of a trace
tabl that express the result of the syntact analysi in
a tabular form sever version of the subroutin and some
associ program have been in us now for over three
year the present account of the languag and the subroutin
contain a summari of materi that ha been describ previous
in unpublish report and also some addit discuss of the
work in relat to the more gener question of problem
orient languag and string transform cacm octob 1962 barnett m
p futrel r p ca621016 jb march 17 1978 7
11 pm 1046 4 464 1105 4 464 1139 4
464 1140 4 464 1234 4 464 1263 4 464
1265 4 464 1496 4 464 1781 4 464 1824
4 464 2126 4 464 2546 4 464 464 4
464 464 4 464 584 4 464 631 4 464
653 4 464 680 4 464 720 4 464 763
4 464 795 4 464 799 4 464 945 4
464 1062 5 464 1121 5 464 1139 5 464
1265 5 464 265 5 464 1781 5 464 404
5 464 464 5 464 464 5 464 464 5
464 720 5 464 759 5 464 123 6 464
196 6 464 919 6 464 990 6 464 1007
6 464 1046 6 464 1131 6 464 1139 6
464 1140 6 464 1149 6 464 1198 6 464
1215 6 464 1223 6 464 1265 6 464 1303
6 464 1323 6 464 1358 6 464 1366 6
464 1421 6 464 1460 6 464 1462 6 464
1463 6 464 1467 6 464 1468 6 464 1477
6 464 1491 6 464 1496 6 464 1531 6
464 1535 6 464 1565 6 464 1601 6 464
1602 6 464 1613 6 464 1614 6 464 1626
6 464 1641 6 464 1787 6 464 1788 6
464 205 6 464 224 6 464 224 6 464
249 6 464 265 6 464 288 6 464 316
6 464 381 6 464 398 6 464 399 6
464 11 6 464 404 6 464 404 6 464
404 6 464 410 6 464 438 6 464 463
6 464 464 6 464 464 6 464 464 6
464 464 6 464 464 6 464 464 6 464
464 6 464 474 6 464 483 6 464 3184
6 464 3184 6 464 3188 6 464 584 6
464 600 6 464 631 6 464 631 6 464
635 6 464 680 6 464 691 6 464 759
6 464 763 6 464 794 6 464 799 6
464 
# 465
perm algorithm 115 cacm octob 1962 schrack g f ca621015
jb march 17 1978 7 12 pm 465 5 465
465 5 465 465 5 465 
# 466
gener order arithmet algorithm 93 cacm octob 1962 georg r
ca621014 jb march 17 1978 7 13 pm 466 5
466 466 5 466 466 5 466 
# 467
permut gener algorithm 87 cacm octob 1962 schrack g f
shimrat m ca621013 jb march 17 1978 7 14 pm
467 5 467 467 5 467 467 5 467 
# 468
incomplet ellipt integr algorithm 73 cacm octob 1962 jefferson d
k ca621012 jb march 17 1978 7 14 pm 468
5 468 468 5 468 468 5 468 
# 469
critic path schedul algorithm 40 cacm octob 1962 hellberg l
ca621011 jb march 17 1978 7 15 pm 469 5
469 469 5 469 469 5 469 
# 470
summat of fourier seri algorithm 128 cacm octob 1962 well
m ca621010 jb march 17 1978 7 16 pm 470
5 470 470 5 470 470 5 470 
# 471
ortho algorithm 127 cacm octob 1962 walsh p j ca621009
jb march 17 1978 7 17 pm 471 5 471
471 5 471 471 5 471 
# 472
gauss method algorithm 126 cacm octob 1962 count j w
ca621008 jb march 17 1978 7 18 pm 2075 5
472 472 5 472 472 5 472 472 5 472
472 6 472 
# 473
weightcoeff algorithm 125 cacm octob 1962 rutishaus h ca621007 jb
march 17 1978 7 19 pm 473 5 473 473
5 473 473 5 473 
# 474
input data organ in fortran cacm octob 1962 yarbrough l
ca621006 jb march 17 1978 7 20 pm 1053 5
474 474 5 474 474 5 474 474 5 474
720 5 474 265 6 474 435 6 474 464
6 474 474 6 474 474 6 474 718 6
474 720 6 474 
# 475
a test matrix for invers procedur cacm octob 1962 pei
m l ca621005 jb march 17 1978 7 21 pm
1963 5 475 475 5 475 475 5 475 475
5 475 909 6 475 475 6 475 750 6
475 
# 476
further remark on sampl a tape file ii cacm octob
1962 nadler m ca621004 jb march 17 1978 7 22
pm 476 5 476 476 5 476 476 5 476
# 477
further remark on sampl a tape file i cacm octob
1962 muller m e ca621003 jb march 17 1978 7
23 pm 477 4 477 6 5 477 477 5
477 477 5 477 477 5 477 
# 478
implement a stack cacm octob 1962 baecker h ca621002 jb
march 17 1978 7 25 pm 478 5 478 478
5 478 478 5 478 
# 479
a dispers pass algorithm for the polyphas merg thi paper
present a new manner of dispers string for a polyphas
merg if the number of string dispers is between two
level accept by polyphas merg a more econom techniqu of
reach the next level for polyphas merg is shown and
prove cacm octob 1962 mendoza a g ca621001 jb march
17 1978 7 27 pm 2146 4 479 479 4
479 479 4 479 862 4 479 863 4 479
264 5 479 299 5 479 479 5 479 479
5 479 479 5 479 860 5 479 862 5
479 861 6 479 299 6 479 479 6 479
479 6 479 
# 480
quick calcul of jacobian ellipt function corrigendum cacm septemb 1962
salzer h e ca620912 jb march 17 1978 7 28
pm 480 5 480 480 5 480 480 5 480
# 481
a on dai look at comput cacm septemb 1962 armerd
g w gruenberg f j mark s l parkin t
r ca620911 jb march 17 1978 7 30 pm 481
5 481 481 5 481 481 5 481 
# 482
tall a list processor for the philco 200 comput cacm
septemb 1962 feldman j ca620910 jb march 17 1978 7
31 pm 482 5 482 482 5 482 482 5
482 
# 483
on the nonexist of a phrase structur grammar for algol
60 algol 60 is defin partli by formal mechan of
phrase structur grammar partli by inform state restrict it is
shown that no formal mechan of the type us ar
suffici to defin algol 60 cacm septemb 1962 floyd r
w ca620909 jb march 17 1978 7 33 pm 249
4 483 254 4 483 272 4 483 1102 4
483 1109 4 483 1140 4 483 1188 4 483
1306 4 483 1464 4 483 1491 4 483 1767
4 483 1781 4 483 1787 4 483 1949 4
483 321 4 483 2059 4 483 2126 4 483
435 4 483 437 4 483 463 4 483 483
4 483 491 4 483 2732 4 483 560 4
483 583 4 483 3073 4 483 627 4 483
631 4 483 632 4 483 642 4 483 644
4 483 653 4 483 680 4 483 761 4
483 762 4 483 763 4 483 123 4 483
140 4 483 919 4 483 989 4 483 196
5 483 949 5 483 1102 5 483 1142 5
483 1781 5 483 1945 5 483 483 5 483
483 5 483 483 5 483 762 5 483 823
6 483 123 6 483 196 6 483 196 6
483 196 6 483 914 6 483 915 6 483
917 6 483 919 6 483 984 6 483 989
6 483 990 6 483 990 6 483 1007 6
483 1012 6 483 1046 6 483 1084 6 483
1098 6 483 1122 6 483 1131 6 483 1138
6 483 1139 6 483 1139 6 483 1140 6
483 1141 6 483 1149 6 483 1198 6 483
1200 6 483 1215 6 483 1223 6 483 1223
6 483 1265 6 483 1265 6 483 1303 6
483 1323 6 483 1336 6 483 1358 6 483
1366 6 483 1396 6 483 1421 6 483 1455
6 483 1460 6 483 1462 6 483 1463 6
483 1467 6 483 1468 6 483 1477 6 483
1477 6 483 1487 6 483 1491 6 483 1491
6 483 1496 6 483 1496 6 483 1531 6
483 1535 6 483 1565 6 483 1601 6 483
1602 6 483 1613 6 483 1614 6 483 1626
6 483 1641 6 483 1787 6 483 1788 6
483 205 6 483 209 6 483 210 6 483
224 6 483 249 6 483 249 6 483 288
6 483 316 6 483 381 6 483 398 6
483 11 6 483 404 6 483 406 6 483
410 6 483 463 6 483 464 6 483 483
6 483 483 6 483 483 6 483 483 6
483 483 6 483 483 6 483 3184 6 483
3184 6 483 3188 6 483 584 6 483 584
6 483 584 6 483 600 6 483 669 6
483 680 6 483 680 6 483 691 6 483
763 6 483 763 6 483 799 6 483 
# 484
hankel function algorithm 124 cacm septemb 1962 schaefer l j
ca620908 jb march 17 1978 7 34 pm 484 5
484 484 5 484 484 5 484 
# 485
real error function erf x algorithm 123 cacm septemb 1962
crawford m techo r ca620907 jb march 17 1978 7
35 pm 1157 5 485 485 5 485 485 5
485 485 5 485 836 6 485 1081 6 485
485 6 485 714 6 485 
# 486
tridiagon matrix algorithm 122 cacm septemb 1962 dietzel g f
ca620906 jb march 17 1978 7 36 pm 486 5
486 486 5 486 486 5 486 
# 487
normdev algorithm 121 cacm septemb 1962 shafer d ca620905 jb
march 17 1978 7 38 pm 487 5 487 487
5 487 487 5 487 
# 488
a heurist for page turn in a multiprogram comput cacm
septemb 1962 weil j w ca620904 jb march 17 1978
7 40 pm 1754 4 488 2358 4 488 488
4 488 274 5 488 488 5 488 488 5
488 488 5 488 
# 489
current statu of ipl v for the philco 2000 comput
june 1962 cacm septemb 1962 shaffer s s ca620903 jb
march 17 1978 7 41 pm 489 5 489 489
5 489 489 5 489 
# 490
program method for printer graphic output cacm septemb 1962 garfinkel
d ca620902 jb march 17 1978 8 56 pm 490
5 490 490 5 490 490 5 490 
# 491
us of multiprogram in the design of a low cost
digit comput cacm septemb 1962 penni j p pearcei t
ca620901 jb march 17 1978 8 57 pm 249 4
491 254 4 491 272 4 491 1102 4 491
1109 4 491 1140 4 491 1188 4 491 1306
4 491 1464 4 491 1491 4 491 1713 4
491 1713 4 491 1767 4 491 1781 4 491
1787 4 491 1901 4 491 1901 4 491 1949
4 491 321 4 491 2059 4 491 2126 4
491 435 4 491 437 4 491 463 4 491
483 4 491 491 4 491 491 4 491 491
4 491 491 4 491 2732 4 491 560 4
491 583 4 491 3073 4 491 627 4 491
631 4 491 632 4 491 642 4 491 644
4 491 653 4 491 680 4 491 761 4
491 762 4 491 763 4 491 123 4 491
140 4 491 168 4 491 919 4 491 989
4 491 168 5 491 185 5 491 196 5
491 491 5 491 491 5 491 491 5 491
46 5 491 3193 5 491 796 5 491 491
6 491 491 6 491 
# 492
analysi of a file address method thi paper present a
new file address method base on the calcul of an
address from the identif of a record for larg recircul
type file it seem to be more advantag than customari
on the probabl distribut of the displac of record from
their calcul address which is on less than the number
of probe requir to address a record is comput on
the basi of a markov chain model for the reader
not interest in the mathemat the introduct and the summari
should be suffici cacm august 1962 schai jr g spruth
w g ca620836 jb march 17 1978 9 02 pm
911 5 492 1785 5 492 2203 5 492 2860
5 492 492 5 492 492 5 492 492 5
492 911 6 492 911 6 492 1328 6 492
1785 6 492 1786 6 492 332 6 492 332
6 492 2107 6 492 2109 6 492 2203 6
492 492 6 492 492 6 492 492 6 492
492 6 492 
# 493
the properti classif method of file design and process cacm
august 1962 mcgee w c ca620835 jb march 17 1978
9 03 pm 1135 4 493 1136 4 493 493
4 493 2710 4 493 2765 4 493 2888 4
493 2906 4 493 729 4 493 1136 5 493
493 5 493 493 5 493 493 5 493 616
5 493 493 6 493 616 6 493 657 6
493 
# 494
a finit sequenti compact process for the adjoint of matric
over arbitrari integr domain cacm august 1962 luther h a
guseman jr l f ca620834 jb march 17 1978 9
04 pm 494 5 494 494 5 494 494 5
494 
# 495
a procedur for invert larg symmetr matric in the least
squar method for simultan adjust of sever paramet the coeffici
of the normal equat ar the element of a symmetr
posit definit matrix in order to solv the normal equat
and evalu the precis measur of the result paramet invers
of thi matrix of coeffici is requir mani avail procedur
for matrix invers do not take advantag of the symmetri
thu when program for a high speed comput all n
2 element must be store and manipul wherea onli n
1 2 of them ar independ in order to allow
a comput of given memori capac to handl a larger
matrix the follow procedur for invert a symmetr matrix ha
been devis cacm august 1962 buse w r levi h
s ca620833 jb march 17 1978 9 09 pm 495
5 495 495 5 495 495 5 495 
# 496
a set of matric for test comput program cacm august
1962 brenner j l ca620832 jb march 17 1978 9
10 pm 1047 5 496 496 5 496 496 5
496 496 5 496 496 6 496 
# 497
further remark on line segment curv fit us dynam program
in a recent paper bellman show how dynam program could
be us to determin the solut to a problem previous
consid by stone the problem compris the determin given n
of the n point of subdivis of a given interv
a b and the correspond line segment that give the
best least squar fit to a function g x in
the interv bellman confin himself primarili to the analyt deriv
suggest briefli howev how the solut of the equat deriv
for each particular point of subdivis u i could be
reduc to a discret search in thi paper the comput
procedur is consid more fulli and the similar to some
of stone s equat ar indic it is further shown
that an equat for u i involv no minim mai
be found in addit it is shown how bellman s
method mai be appli to the curv fit problem when
the addit constraint ar ad that the end of the
line segment must be on the curv cacm august 1962
gluss b ca620831 jb march 17 1978 9 19 pm
497 4 497 867 4 497 317 5 497 497
5 497 497 5 497 497 5 497 867 5
497 317 6 497 497 6 497 
# 498
magic squar algorithm 117 118 cacm august 1962 collison d
m ca620830 jb march 17 1978 9 20 pm 498
5 498 498 5 498 498 5 498 
# 499
permut gener algorithm 87 cacm august 1962 collison d m
ca620829 jb march 17 1978 9 22 pm 499 5
499 499 5 499 499 5 499 
# 500
permut algorithm 86 cacm august 1962 collison d m ca620828
jb march 17 1978 9 23 pm 500 5 500
500 5 500 500 5 500 
# 501
jacobi algorithm 85 cacm august 1962 hillmor j s ca620827
jb march 17 1978 9 24 pm 2349 5 501
501 5 501 501 5 501 501 5 501 1648
6 501 1716 6 501 1794 6 501 1894 6
501 2043 6 501 501 6 501 613 6 501
774 6 501 
# 502
simpson s integr algorithm 84 cacm august 1962 georg r
ca620826 jb march 17 1978 9 25 pm 502 5
502 502 5 502 502 5 502 
# 503
ration root of polynomi with integ coeffici algorithm 78 cacm
august 1962 collison d m ca620825 jb march 17 1978
9 27 pm 503 5 503 503 5 503 503
5 503 
# 504
factor algorithm 75 cacm august 1962 hillmor j s ca620824
jb march 17 1978 9 28 pm 504 5 504
504 5 504 504 5 504 
# 505
composit gener algorithm 72 cacm august 1962 collison d m
ca620823 jb march 17 1978 9 29 pm 505 5
505 505 5 505 505 5 505 
# 506
permut algorithm 71 cacm august 1962 hillmor j s ca620822
jb march 17 1978 9 30 pm 506 5 506
506 5 506 506 5 506 
# 507
partit quicksort find algorithm 63 64 65 cacm august 1962
hillmor j s ca620821 jb march 17 1978 9 32
pm 2679 5 507 507 5 507 507 5 507
507 5 507 970 6 507 1175 6 507 1190
6 507 1228 6 507 1969 6 507 1997 6
507 308 6 507 2042 6 507 3187 6 507
507 6 507 716 6 507 783 6 507 
# 508
matrix invers algorithm 58 cacm august 1962 georg r ca620820
jb march 17 1978 9 32 pm 508 5 508
508 5 508 508 5 508 
# 509
matrix invers algorithm 58 cacm august 1962 strubl g ca620819
jb march 17 1978 9 33 pm 509 5 509
509 5 509 509 5 509 
# 510
ber or bei function algorithm 57 cacm august 1962 thacher
jr h c ca620818 jb march 17 1978 9 34
pm 510 5 510 510 5 510 510 5 510
# 511
a set of test matric algorithm 52 cacm august 1962
hillmor j s ca620817 jb march 17 1978 9 35
pm 1707 5 511 511 5 511 511 5 511
511 5 511 1047 6 511 511 6 511 
# 512
telescop 1 algorithm 37 cacm august 1962 thacher jr h
c ca620816 jb march 17 1978 9 36 pm 512
5 512 512 5 512 512 5 512 
# 513
siev algorithm 35 cacm august 1962 hillmor j s ca620815
jb march 17 1978 9 37 pm 513 5 513
513 5 513 513 5 513 
# 514
binomi coeffici algorithm 19 cacm august 1962 georg r ca620814
jb march 17 1978 9 40 pm 514 5 514
514 5 514 514 5 514 
# 515
ration interpol by continu fraction algorithm 18 cacm august 1962
thacher jr h c ca620813 jb march 17 1978 9
41 pm 515 5 515 515 5 515 515 5
515 
# 516
matrix invers ii algorithm 120 cacm august 1962 georg r
ca620812 jb march 17 1978 9 42 pm 516 5
516 516 5 516 516 5 516 
# 517
evalu of pert network algorithm 119 cacm august 1962 eisenman
b shapiro m ca620811 jb march 17 1978 9 44
pm 517 5 517 517 5 517 517 5 517
# 518
magic squar odd order algorithm 118 cacm august 1962 collison
d m ca620810 jb march 17 1978 9 45 pm
2082 5 518 518 5 518 518 5 518 518
5 518 1491 6 518 518 6 518 
# 519
magic squar even order algorithm 117 cacm august 1962 collison
d m ca620809 jb march 17 1978 9 46 pm
519 5 519 519 5 519 519 5 519 
# 520
complex divis algorithm 116 cacm august 1962 smith r l
ca620808 jb march 17 1978 9 47 pm 520 5
520 520 5 520 520 5 520 
# 521
perm algorithm 115 cacm august 1962 trotter h f ca620807
jb march 17 1978 9 57 pm 2044 5 521
2189 5 521 2417 5 521 2505 5 521 2874
5 521 2908 5 521 521 5 521 521 5
521 521 5 521 996 6 521 1558 6 521
1594 6 521 1682 6 521 2087 6 521 2189
6 521 2227 6 521 2230 6 521 2292 6
521 2317 6 521 2505 6 521 2683 6 521
2871 6 521 2884 6 521 3191 6 521 521
6 521 521 6 521 521 6 521 521 6
521 521 6 521 521 6 521 
# 522
gener of partit with constraint algorithm 114 cacm august 1962
stockmal f ca620806 jb march 17 1978 7 28 pm
522 5 522 522 5 522 522 5 522 
# 523
treesort algorithm 113 cacm august 1962 floyd r w ca620805
jb march 17 1978 7 29 pm 523 5 523
523 5 523 523 5 523 
# 524
posit of point rel to polygon algorithm 112 cacm august
1962 shimrat m ca620804 jb march 17 1978 7 30
pm 1804 5 524 2987 5 524 524 5 524
524 5 524 524 5 524 1326 6 524 1630
6 524 2125 6 524 2547 6 524 2633 6
524 421 6 524 421 6 524 524 6 524
524 6 524 
# 525
a comput techniqu for handl analysi of varianc cacm august
1962 howel j r ca620803 jb march 17 1978 7
32 pm 525 5 525 525 5 525 525 5
525 
# 526
charact manipul in fortran cacm august 1962 pyle i c
ca620802 jb march 17 1978 7 33 pm 526 5
526 526 5 526 526 5 526 
# 527
the descript list of concept a concept is defin as
a class of object whose member can be distinguish by
process it properti properti is defin to mean a partit
of the set of all object into disjoint class the
formal definit of a concept is recurs in natur a
concept is describ by a list structur a on to
on correspond is establish between the recurs definit of a
concept and it descript list structur like the definit the
descript list structur of a concept is also built up
from elementari list structur by a recurs process the list
structur obtain thi wai ar compar with the descript list
structur discuss by the author in a previou public cacm
august 1962 banerji r b ca620801 jb march 17 1978
7 39 pm 527 5 527 527 5 527 527
5 527 
# 528
fortran for busi data process cacm juli 1962 robbin d
k ca620733 jb march 17 1978 7 41 pm 1330
5 528 528 5 528 528 5 528 528 5
528 528 6 528 728 6 528 
# 529
regress and code pattern in data edit cacm juli 1962
robison d e aroian l a ca620732 jb march 17
1978 7 42 pm 529 5 529 529 5 529
529 5 529 
# 530
a comput method for radiat treatment plan cacm juli 1962
siler w laughlin j s ca620731 jb march 17 1978
7 43 pm 530 5 530 530 5 530 530
5 530 
# 531
person match by electron method record linkag in the updat
of file is accomplish in mani establish through the us
of a preassign number such as payrol number custom number
or social secur number in vital and health record howev
a uniqu number is gener not preassign to an individu
for purpos of report servic receiv to the health depart
in order to determin whether differ physician report refer to
the same individu name and other identif must be compar
thi is a labori oper which is subject to variou
error becaus of name misspel chang of name upon marriag
and other problem we ar interest in the mainten of
a psychiatr case regist in maryland where mani of the
report from over a hundr psychiatr agenc refer to the
same patient these record must be link in order to
provid undupl count of individu under care and longitudin record
of psychiatr histori an earlier paper 1 describ our gener
procedur for regist mainten by us of a digit comput
honeywel 800 here we present in more detail our initi
procedur for the person match process in order to elicit
comment and suggest from person who have had experi in
match cacm juli 1962 phillip jr w bahn a k
miyasaki m ca620730 jb march 17 1978 7 51 pm
531 5 531 531 5 531 531 5 531 
# 532
on the comput of ration approxim to continu function cacm
juli 1962 fraser w hart j f ca620729 jb march
17 1978 7 52 pm 951 5 532 1015 5
532 1346 5 532 1440 5 532 1645 5 532
532 5 532 532 5 532 532 5 532 951
6 532 962 6 532 532 6 532 532 6
532 532 6 532 532 6 532 532 6 532
# 533
digit synthesi of correl stationari nois in thi note we
propos a method of gener stationari nois with a prescrib
auto covari function by digit method the need for such
a techniqu often aris in test the perform of data
process and engin system where input corrupt with correl nois
of a known form ar requir the techniqu is quit
simpl and produc strict sens stationari nois which agre approxim
with r t the prescrib auto covari function acf over
an interv t 0 t 0 the method consist of
approxim the spectral densiti by a period process with spectral
line and then synthes the period nois with random phase
and appropri amplitud in order to simplifi discuss of the
statist properti of the nois gener the techniqu is first
present in term of exact harmon analysi in practic discret
harmon analysi as present in the third section is us
cacm juli 1962 peabodi p r adorno d s ca620728
jb march 17 1978 7 59 pm 533 5 533
533 5 533 533 5 533 
# 534
quick calcul of jacobian ellipt function cacm juli 1962 salzer
h e ca620727 jb march 17 1978 8 01 pm
534 5 534 534 5 534 534 5 534 
# 535
triangular walk pattern for the down hill method of solv
a transcendent equat cacm juli 1962 ono m ca620726 jb
march 17 1978 8 02 pm 1806 5 535 535
5 535 535 5 535 535 5 535 535 6
535 
# 536
nonlinear regress and the solut of simultan equat if on
ha a set of observ z1 zm which ar bound
in a relat with certain paramet a1 an by an
equat s z1 a1 0 on frequent ha the problem
of determin a set of valu of the ai which
minim the sum of squar of differ between observ and
calcul valu of a distinguish observ sai zm if the
solut of the abov equat for zm zm n z1
a1 give rise to a function n which is nonlinear
in the ai then on mai reli on a version
of gaussian regress 1 2 for an iter scheme that
converg to a minim set of valu it is shown
here that thi same minim techniqu mai be us for
the solut of simultan not necessarili linear equat cacm juli
1962 baer r m ca620725 jb march 17 1978 8
09 pm 536 5 536 536 5 536 536 5
536 
# 537
a machin program for theorem prove the program of a
proof procedur is discuss in connect with trial run and
possibl improv cacm juli 1962 davi m logemann g loveland
d ca620724 jb march 17 1978 8 11 pm 537
5 537 537 5 537 537 5 537 
# 538
quantum mechan integr of slater type orbit algorithm 110 cacm
juli 1962 kruglyak y a whitman d r ca620723 jb
march 17 1978 8 13 pm 538 5 538 538
5 538 538 5 538 
# 539
definit exponenti integr b algorithm 109 cacm juli 1962 kruglyak
y a whitman d r ca620722 jb march 17 1978
8 15 pm 539 5 539 539 5 539 539
5 539 
# 540
definit exponenti integr a algorithm 108 cacm juli 1962 kruglyak
y a whitman d r ca620721 jb march 17 1978
8 16 pm 540 5 540 540 5 540 540
5 540 
# 541
simpson s integr algorithm 84 cacm juli 1962 relph a
p ca620720 jb march 17 1978 8 17 pm 541
5 541 541 5 541 541 5 541 
# 542
factor algorithm 75 cacm juli 1962 relph a p ca620719
jb march 17 1978 8 18 pm 542 5 542
542 5 542 542 5 542 
# 543
interpol by aitken algorithm 70 cacm juli 1962 relph a
p ca620718 jb march 17 1978 8 19 pm 543
5 543 543 5 543 543 5 543 
# 544
ber or bei function algorithm 57 cacm juli 1962 relph
a p ca620717 jb march 17 1978 8 21 pm
544 5 544 544 5 544 544 5 544 
# 545
adjust invers of a matrix when an element is perturb
algorithm 51 cacm juli 1962 georg r ca620716 jb march
17 1978 8 22 pm 545 5 545 545 5
545 545 5 545 
# 546
logarithm of a complex number algorithm 48 cacm juli 1962
johnson m l sangren w ca620715 jb march 17 1978
8 23 pm 546 5 546 546 5 546 546
5 546 
# 547
gamma function algorithm 34 cacm juli 1962 johnson m l
sangren w ca620714 jb march 17 1978 8 25 pm
547 5 547 547 5 547 547 5 547 
# 548
molecular orbit calcul of molecular interact cacm juli 1962 kruglyak
y a whitman d r ca620713 jb march 17 1978
8 26 pm 548 5 548 548 5 548 548
5 548 
# 549
quantum mechan integr of slater type orbit cacm juli 1962
kruglyak y a whitman d r ca620712 jb march 17
1978 8 27 pm 549 5 549 549 5 549
549 5 549 
# 550
definit exponenti integr b algorithm 109 cacm juli 1962 kruglyak
y a whitman d r ca620711 jb march 17 1978
8 30 pm 550 5 550 550 5 550 550
5 550 
# 551
definit exponenti integr a algorithm 108 cacm juli 1962 kruglyak
y a whitman d r ca620710 jb march 17 1978
8 31 pm 551 5 551 551 5 551 551
5 551 
# 552
gauss s method algorithm 107 cacm juli 1962 count j
w ca620709 jb march 17 1978 8 33 pm 552
5 552 552 5 552 552 5 552 
# 553
complex number to a real power algorithm 106 cacm juli
1962 johnson m l sangren w ca620708 jb march 17
1978 8 34 pm 553 5 553 553 5 553
553 5 553 
# 554
newton maehli algorithm 105 cacm juli 1962 bauer f l
stoer j ca620707 jb march 17 1978 8 44 pm
554 5 554 554 5 554 554 5 554 
# 555
reduct to jacobi algorithm 104 cacm juli 1962 rutishausr h
ca620706 jb march 17 1978 8 45 pm 555 5
555 555 5 555 555 5 555 
# 556
on translat of boolean express cacm juli 1972 bottenbirruch h
h grau a a ca620705 jb march 17 1978 8
52 pm 1139 4 556 1947 4 556 556 4
556 799 4 556 399 5 556 556 5 556
556 5 556 556 5 556 
# 557
simul of comput time devic cacm juli 1962 ca620704 jb
march 17 1978 8 57 pm 1380 4 557 1552
4 557 1693 4 557 1781 4 557 1854 4
557 1860 4 557 2060 4 557 557 4 557
1421 5 557 557 5 557 557 5 557 557
5 557 3184 5 557 1198 6 557 1749 6
557 557 6 557 
# 558
a modifi invers procedur for product form of the invers
linear program code thi paper describ a new algorithm for
the select of the pivot row in matrix invers when
us the product form of the invers thi algorithm ha
been develop for linear program code howev it would be
valuabl for the invers of ani non dens matrix the
procedur describ in thi paper have been thoroughli test and
have been in oper on the esso research and engin
ibm 7090 comput for nine month substanti comput cost save
have been realiz becaus of thi procedur cacm juli 1962
larsen l j ca620703 jb march 17 1978 9 07
pm 558 5 558 558 5 558 558 5 558
# 559
solut of eigenvalu problem with approxim known eigenvector cacm juli
1962 appel k ca620702 jb march 17 1978 9 10
pm 559 5 559 559 5 559 559 5 559
# 560
commun between independ translat block cacm juli 1962 wegner p
ca620701 jb march 17 1978 9 11 pm 249 4
560 254 4 560 272 4 560 1102 4 560
1109 4 560 1140 4 560 1188 4 560 1306
4 560 1464 4 560 1491 4 560 1767 4
560 1774 4 560 1781 4 560 1787 4 560
1949 4 560 321 4 560 2059 4 560 2126
4 560 435 4 560 437 4 560 463 4
560 483 4 560 491 4 560 2732 4 560
560 4 560 560 4 560 583 4 560 3073
4 560 627 4 560 631 4 560 632 4
560 642 4 560 644 4 560 653 4 560
680 4 560 761 4 560 762 4 560 763
4 560 123 4 560 140 4 560 919 4
560 972 4 560 989 4 560 196 5 560
271 5 560 560 5 560 560 5 560 560
5 560 
# 561
analyt differenti by comput cacm june 1962 hanson j w
cavi j s joseph c ca620624 jb march 17 1978
9 12 pm 1134 4 561 1141 4 561 364
4 561 405 4 561 438 4 561 561 4
561 561 4 561 44 4 561 964 5 561
1028 5 561 1216 5 561 1396 5 561 1392
5 561 393 5 561 77 5 561 561 5
561 561 5 561 561 5 561 964 6 561
1028 6 561 1028 6 561 1029 6 561 1029
6 561 1029 6 561 1083 6 561 1132 6
561 1214 6 561 1278 6 561 1334 6 561
1365 6 561 1386 6 561 1387 6 561 1388
6 561 1392 6 561 1393 6 561 1394 6
561 1395 6 561 1396 6 561 1397 6 561
1496 6 561 284 6 561 284 6 561 407
6 561 3199 6 561 3200 6 561 3201 6
561 3202 6 561 3203 6 561 3204 6 561
561 6 561 561 6 561 561 6 561 561
6 561 561 6 561 730 6 561 759 6
561 
# 562
avint algorithm 77 cacm june 1962 whittier v e ca620623
jb march 17 1978 9 14 pm 562 5 562
562 5 562 562 5 562 
# 563
sort procedur algorithm 76 cacm june 1962 randel b ca620622
jb march 17 1978 9 15 pm 563 5 563
563 5 563 563 5 563 
# 564
cram algorithm 67 cacm june 1962 relph a p ca620621
jb march 17 1978 9 17 pm 564 5 564
564 5 564 564 5 564 
# 565
invr algorithm 66 cacm june 1962 caffrei j ca620620 jb
march 17 1978 9 18 pm 565 5 565 565
5 565 565 5 565 
# 566
matrix invers algorithm 58 cacm june 1962 conger r a
ca620619 jb march 17 1978 9 19 pm 566 5
566 566 5 566 566 5 566 
# 567
logarithm of a complex number algorithm 48 cacm june 1962
relph a p ca620618 jb march 17 1978 9 20
pm 567 5 567 567 5 567 567 5 567
# 568
exponenti of a complex number algorithm 46 cacm june 1962
relph a p ca620617 jb march 17 1978 9 21
pm 568 5 568 568 5 568 568 5 568
# 569
binomi coeffici algorithm 19 cacm june 1962 steck b ca620616
jb march 17 1978 9 22 pm 569 5 569
569 5 569 569 5 569 
# 570
simpson s rule integr algorithm 103 cacm june 1962 kuncir
g f ca620615 jb march 17 1978 9 24 pm
1352 5 570 570 5 570 570 5 570 570
5 570 834 6 570 872 6 570 1040 6
570 1092 6 570 1241 6 570 1273 6 570
324 6 570 429 6 570 570 6 570 621
6 570 786 6 570 
# 571
permut in lexicograph order algorithm 102 cacm june 1962 schrack
g f shimrat m ca620614 jb march 17 1978 9
25 pm 571 5 571 571 5 571 571 5
571 
# 572
add item to chain link list algorithm 100 cacm june
1962 kiviat p j ca620612 jb march 17 1978 9
26 pm 572 5 572 572 5 572 572 5
572 
# 573
remov item from chain link list algorithm 101 cacm june
1962 kiviat p j ca620613 jb march 17 1978 9
27 pm 573 5 573 573 5 573 573 5
573 
# 574
evalu of jacobi symbol algorithm 99 cacm june 1962 garland
s j knapp a w ca620611 jb march 17 1978
9 28 pm 574 5 574 574 5 574 574
5 574 
# 575
evalu of definit complex line integr algorithm 98 cacm june
1962 pfaltz j l ca620610 jb march 17 1978 9
29 pm 575 5 575 575 5 575 575 5
575 
# 576
shortest path algorithm 97 cacm june 1962 floyd r w
ca620609 jb march 17 1978 9 30 pm 1846 5
576 2630 5 576 2650 5 576 576 5 576
576 5 576 576 5 576 830 6 576 1380
6 576 1424 6 576 1484 6 576 1572 6
576 2111 6 576 576 6 576 576 6 576
576 6 576 680 6 576 
# 577
ancestor algorithm 96 cacm june 1962 floyd r w ca620608
jb march 17 19789 31 pm 1836 5 577 577
5 577 577 5 577 577 5 577 1191 6
577 1477 6 577 1491 6 577 1781 6 577
577 6 577 
# 578
gener of partit in part count form algorithm 95 cacm
june 1962 stockmal f ca620607 jb march 17 1978 9
32 pm 578 5 578 578 5 578 578 5
578 
# 579
combin algorithm 94 cacm june 1962 kurtzberg j ca620606 jb
march 17 1978 9 33 pm 2690 5 579 2853
5 579 579 5 579 579 5 579 579 5
579 3115 5 579 907 6 579 203 6 579
2045 6 579 2417 6 579 2466 6 579 2690
6 579 2884 6 579 579 6 579 579 6
579 579 6 579 785 6 579 
# 580
gener order arithmet algorithm 93 cacm june 1962 perstein m
h ca620605 jb march 17 1978 9 34 pm 580
5 580 580 5 580 580 5 580 
# 581
a note on sampl a tape file cacm june 1962
jone t g ca620604 jb march 17 1978 9 35
pm 581 5 581 581 5 581 581 5 581
# 582
on lost bit cacm june 1962 oster c a ca620603
jb march 17 1978 9 36 pm 582 5 582
582 5 582 582 5 582 
# 583
a redund check for algol program cacm june 1962 thacher
jr h c ca620602 jb march 17 1978 9 37
pm 249 4 583 254 4 583 272 4 583
1102 4 583 1109 4 583 1140 4 583 1188
4 583 1306 4 583 1464 4 583 1491 4
583 1767 4 583 1781 4 583 1787 4 583
1949 4 583 321 4 583 2059 4 583 2126
4 583 435 4 583 437 4 583 463 4
583 483 4 583 491 4 583 2732 4 583
560 4 583 583 4 583 3073 4 583 627
4 583 631 4 583 632 4 583 642 4
583 644 4 583 653 4 583 680 4 583
761 4 583 762 4 583 763 4 583 123
4 583 140 4 583 919 4 583 989 4
583 196 5 583 583 5 583 583 5 583
583 5 583 
# 584
report on the algorithm languag fortran ii cacm june 1962
rabinowitz i n ca620601 jb march 17 1978 9 38
pm 1046 4 584 1105 4 584 1139 4 584
1140 4 584 1234 4 584 1263 4 584 1265
4 584 1496 4 584 1781 4 584 1824 4
584 2126 4 584 2546 4 584 464 4 584
584 4 584 631 4 584 653 4 584 680
4 584 763 4 584 795 4 584 799 4
584 945 4 584 949 5 584 1781 5 584
1945 5 584 404 5 584 584 5 584 584
5 584 584 5 584 823 6 584 123 6
584 196 6 584 914 6 584 915 6 584
917 6 584 919 6 584 984 6 584 989
6 584 990 6 584 990 6 584 1007 6
584 1012 6 584 1046 6 584 1084 6 584
1098 6 584 1122 6 584 1131 6 584 1138
6 584 1139 6 584 1139 6 584 1140 6
584 1141 6 584 1149 6 584 1198 6 584
1200 6 584 1215 6 584 1223 6 584 1223
6 584 1265 6 584 1265 6 584 1303 6
584 1323 6 584 1336 6 584 1358 6 584
1366 6 584 1396 6 584 1421 6 584 1455
6 584 1460 6 584 1462 6 584 1463 6
584 1467 6 584 1468 6 584 1477 6 584
1477 6 584 1487 6 584 1491 6 584 1491
6 584 1496 6 584 1496 6 584 1531 6
584 1535 6 584 1565 6 584 1601 6 584
1602 6 584 1613 6 584 1614 6 584 1626
6 584 1641 6 584 1787 6 584 1788 6
584 205 6 584 224 6 584 249 6 584
288 6 584 316 6 584 381 6 584 398
6 584 11 6 584 404 6 584 410 6
584 463 6 584 464 6 584 483 6 584
483 6 584 483 6 584 3184 6 584 3184
6 584 3188 6 584 584 6 584 584 6
584 584 6 584 600 6 584 669 6 584
680 6 584 680 6 584 691 6 584 763
6 584 763 6 584 799 6 584 
# 585
initi experi with an oper multiprogram system the lewi research
center ha been us variou form and degre of program
simultan in the oper of it modifi sperri rand univac
scientif model 1103 comput dure the last five year thi
simultan ha evolv from an initi achiev of self search
input and output to the automat time share of independ
code problem sever import machin and program system modif were
necessari to accomplish thi evolut sever addit modif although not
requir were ad to facilit eas of code and oper
all modif had to proce at a rel temper pace
to insur that the basic data reduct work load of
the comput center wa complet on schedul some education valuabl
mistak were made and their suggest cure often point the
wai to us futur improv or emphas some of the
basic principl of a multiprogram system the materi that follow
is a descript of the evolut of the program and
hardwar system which ha develop into the present multiprogram system
at lewi research center cacm mai 1962 landi n mano
a turner l r ca620520 jb march 17 1978 9
45 pm 585 5 585 585 5 585 585 5
585 
# 586
simultan system of equat and matrix invers routin algorithm 92
cacm mai 1962 roek d j ca620519 jb march 20
1978 1 31 pm 454 5 586 586 5 586
586 5 586 586 5 586 152 6 586 586
6 586 
# 587
romberg integr algorithm 60 cacm mai 1962 buchner k h
ca620518 jb march 20 1978 1 33 pm 1040 5
587 587 5 587 587 5 587 587 5 587
885 6 587 587 6 587 621 6 587 
# 588
chebyshev curv fit algorithm 91 cacm mai 1962 newhous a
ca620517 jb march 20 1978 1 34 pm 588 5
588 588 5 588 588 5 588 
# 589
evalu of the fresnel cosin integr algorithm 90 cacm mai
1962 cundiff j l ca620516 jb march 20 1978 1
35 pm 589 5 589 589 5 589 589 5
589 
# 590
evalu of the fresnel sine integr algorithm 89 cacm mai
1962 cundiff j l ca620515 jb march 20 1978 1
36 pm 590 5 590 590 5 590 590 5
590 
# 591
evalu of asymptot express for the fresnel sine and cosin
integr algorithm 88 cacm mai 1962 cundiff j l ca620514
jb march 20 1978 1 37 pm 591 5 591
591 5 591 591 5 591 
# 592
cobol batch problem cacm mai 1962 mullen j w ca620513
jb march 20 1978 1 38 pm 592 5 592
592 5 592 592 5 592 
# 593
an introduct to a machin independ data divis cacm mai
1962 mullin j p ca620512 jb march 20 1978 1
39 pm 593 5 593 593 5 593 593 5
593 
# 594
an advanc input output system for a cobol compil cacm
mai 1962 bouman c a ca620511 jb march 20 1978
1 40 pm 594 5 594 594 5 594 594
5 594 
# 595
guid to teach cobol the teach of cobol can be
divid into three main subject area thei ar the syntax
of cobol the us of such syntax in solv ani
given problem and program concept it is gener accept that
some knowledg of the hardwar and comput logic must be
possess by the programm the teach problem aris in determin
how thoroughli a student must know the hardwar and logic
for that comput for which he will write cobol program
unfortun histor data concern student program profici is almost non
exist and at best difficult to measur how then might
we approach solv thi problem cacm mai 1962 green i
ca620510 jb march 20 1978 1 44 pm 595 5
595 595 5 595 595 5 595 
# 596
float point arithmet in cobol in thi paper the basic
oper of float point arithmet ar examin and cobol procedur
for carri these out ar given along with specif of
work storag the paper conclud with an exampl in which
these procedur ar us cacm mai 1962 kesner o ca620509
jb march 20 1978 1 46 pm 596 5 596
596 5 596 596 5 596 
# 597
modular data process system written in cobol cacm mai 1962
emeri j c ca620508 jb march 20 1978 1 47
pm 597 5 597 597 5 597 597 5 597
# 598
the cobol librarian a kei to object program effici mani
answer to the question how mai a cobol compil be
forc into the gener of an effici object program the
purpos of thi articl is to present on possibl answer
the creation and full util of a well construct cobol
librari cacm mai 1962 hick w ca620507 jb march 20
1978 1 50 pm 598 5 598 598 5 598
598 5 598 
# 599
a report writer for cobol cacm mai 1962 donal w
l ca620506 jb march 20 1978 1 51 pm 599
5 599 599 5 599 599 5 599 
# 600
syntact chart of cobol 61 cacm mai 1962 berman r
sharp j sturg l ca620505 jb march 20 1978 1
52 pm 1781 5 600 600 5 600 600 5
600 600 5 600 123 6 600 196 6 600
919 6 600 990 6 600 1007 6 600 1046
6 600 1131 6 600 1139 6 600 1140 6
600 1149 6 600 1198 6 600 1215 6 600
1223 6 600 1265 6 600 1303 6 600 1323
6 600 1358 6 600 1366 6 600 1421 6
600 1460 6 600 1462 6 600 1463 6 600
1467 6 600 1468 6 600 1477 6 600 1491
6 600 1496 6 600 1531 6 600 1535 6
600 1565 6 600 1601 6 600 1602 6 600
1613 6 600 1614 6 600 1626 6 600 1641
6 600 1787 6 600 1788 6 600 205 6
600 224 6 600 249 6 600 288 6 600
316 6 600 381 6 600 398 6 600 11
6 600 404 6 600 410 6 600 463 6
600 464 6 600 483 6 600 3184 6 600
3188 6 600 584 6 600 600 6 600 680
6 600 691 6 600 763 6 600 799 6
600 
# 601
interim report on bureau of ship cobol evalu program cacm
mai 1962 siegel m smith a e ca620504 jb march
20 1978 1 53 pm 601 5 601 601 5
601 601 5 601 
# 602
cobol and compat cacm mai 1962 lippitt a ca620503 jb
march 20 1978 1 54 pm 602 5 602 602
5 602 602 5 602 
# 603
basic element of cobol 61 cacm mai 1962 sammet j
e ca620502 jb march 20 1978 1 54 pm 1084
5 603 603 5 603 603 5 603 603 5
603 868 6 603 603 6 603 644 6 603
669 6 603 791 6 603 797 6 603 
# 604
why cobol cacm mai 1962 cunningham j f ca620501 jb
march 20 1978 1 55 pm 604 5 604 604
5 604 604 5 604 
# 605
comput simul of citi traffic in simul traffic flow on
citi street the nation bureau of standard ha us data
process techniqu to tabul and make motion pictur of vehicl
movement in the model each vehicl is assign a digit
identif give point of entri and exit type of vehicl
desir speed and actual speed in proport simul field data
chang in the model can be made to observ their
consequ and to determin the abil of a real street
to carri load expect in the futur cacm april 1962
ca620412 jb march 20 1978 2 00 pm 605 5
605 605 5 605 605 5 605 
# 606
a method for elimin ambigu due to signal coincid in
digit design cacm april 1962 kaiser c j ca620411 jb
march 20 1978 2 16 pm 606 5 606 606
5 606 606 5 606 
# 607
the calcul of easter cacm april 1962 knuth d ca620410
jb march 20 1978 2 17 pm 607 5 607
607 5 607 607 5 607 
# 608
permut algorithm 71 cacm april 1962 peck j e l
schrack g f ca620409 jb march 20 1978 2 18
pm 608 5 608 608 5 608 608 5 608
# 609
permut algorithm 71 cacm april 1962 brown p j ca620408
jb march 20 1978 2 19 pm 609 5 609
609 5 609 609 5 609 
# 610
siev algorithm 35 cacm april 1962 brown p j ca620407
jb march 20 1978 2 20 pm 610 5 610
610 5 610 610 5 610 
# 611
permut gener algorithm 87 cacm april 1962 howel j r
ca620406 jb march 20 1978 2 20 pm 611 5
611 611 5 611 611 5 611 
# 612
permut algorithm 86 cacm april 1962 peck j e l
schrack g f ca620405 jb march 20 1978 2 21
pm 3188 5 612 612 5 612 612 5 612
612 5 612 1594 6 612 612 6 612 
# 613
jacobi algorithm 85 cacm april 1962 evan t g ca620404
jb march 20 1978 2 22 pm 2349 5 613
613 5 613 613 5 613 613 5 613 1648
6 613 1716 6 613 1794 6 613 1894 6
613 2043 6 613 501 6 613 613 6 613
774 6 613 
# 614
simpson s integr algorithm 84 cacm april 1962 hennion p
e ca620403 jb march 20 1978 2 25 pm 614
5 614 614 5 614 614 5 614 
# 615
address multidimension arrai a us method of repres a function
of n variabl is to consid the function to assum
it valu at select point in n dimension space although
thi pictur is of valu to the analyst the element
of an n dimension arrai must exist in convent storag
as a linear arrai or vector the mean of perform
the transform of a set of indic locat on arrai
element in n space to the locat address of the
element in it storag vector is the subject of thi
paper it is note that the index address transform is
computation ident to the convers of a number from a
fix to a mix radix number system sever wai of
implement the transform ar describ cacm april 1962 hellerman h
ca620402 jb march 20 1978 2 29 pm 435 5
615 615 5 615 615 5 615 615 5 615
849 5 615 155 6 615 196 6 615 615
6 615 615 6 615 
# 616
an inform algebra phase i report languag structur group of
the codasyl develop committe thi report repres the result of
the first phase of the work of the languag structur
group the goal of thi work is to arriv at
a proper structur for a machin independ problem defin languag
at the system level of data process the report is
base for the most part on a mathemat model call
an inform algebra develop primarili by r bosak it is
hope that thi report will be read a with avid
interest by program languag design and implementor and all those
interest in develop a theoret approach to data process b
with interest and understand by profession programm and system analyst
and c with appreci by the businessman analyst manag the
author have not attempt an exhaust discours in thi report
rather thei have tri to present a philosophi to the
profession peopl who ar vital concern with provid a work
languag for the system analyst s us thei trust that
the idea in thi report will stimul other to think
along similar line question and comment will be welcom and
can be address to ani of the member of the
languag structur group robert bosak system develop corpor richard f
clipping honeywel edp divis carei dobb remington rand univac divis
roi goldfing chairman ibm corpor rene b jasper navi manag
offic william keat nation cash regist georg kendrick gener electr
compani jean e sammet ibm corpor cacm april 1962 ca620401
jb march 20 1978 2 40 pm 1135 5 616
1136 5 616 2710 5 616 2765 5 616 2888
5 616 2906 5 616 493 5 616 616 5
616 616 5 616 616 5 616 729 5 616
1515 6 616 288 6 616 1936 6 616 1976
6 616 2046 6 616 2046 6 616 2046 6
616 2451 6 616 2452 6 616 2715 6 616
493 6 616 616 6 616 616 6 616 616
6 616 616 6 616 616 6 616 616 6
616 616 6 616 616 6 616 657 6 616
# 617
poseidon ani comput that form part of a control system
whether complet automat or partli human must work at the
same speed as the control system it must perform it
calcul or data process fast enough for the result to
be avail at the requir instant in the action of
the control system thi known as work in real time
cacm march 1962 wheel r f ca620315 jb march 20
1978 2 51 pm 617 5 617 617 5 617
617 5 617 
# 618
comput the kei to total system control an industri viewpoint
man man machin process ar character in five main type
and the market for each type ar shown for 1950
and 1960 and estim for 1970 cacm march 1962 carlson
w m ca620314 jb march 20 1978 2 53 pm
618 5 618 618 5 618 618 5 618 
# 619
retriev of misspel name in an airlin passeng record system
thi paper discuss the limit problem of recognit and retriev
of a given misspel name from among a roster of
sever hundr name such as the reserv inventori for a
given flight of a larg jet airlin a program ha
been develop and oper on the telefil a store program
core and drum memori solid state comput which will retriev
passeng record successfulli despit signific misspel either at origin entri
time or at retriev time the procedur involv an automat
score techniqu which match the name in a condens form
onli those few name most close resembl the request name
with their phone number annex ar present for the agent
final manual selecton the program ha successfulli isol and retriev
name which were subject to a number of unusu as
well as usual misspel cacm march 1962 davidson l ca620313
jb march 20 1978 2 59 pm 1112 5 619
1592 5 619 2111 5 619 2339 5 619 440
5 619 619 5 619 619 5 619 619 5
619 830 6 619 982 6 619 1112 6 619
1112 6 619 1112 6 619 1592 6 619 1592
6 619 440 6 619 619 6 619 619 6
619 619 6 619 619 6 619 619 6 619
# 620
ratfact algorithm 78 cacm march 1962 halstead m h ca620312
jb march 20 1978 3 00 pm 620 5 620
620 5 620 620 5 620 
# 621
romberg integr algorithm 60 cacm march 1962 thacher jr h
c ca620311 jb march 20 1978 3 01 pm 1040
5 621 1352 5 621 2040 5 621 621 5
621 621 5 621 621 5 621 834 6 621
872 6 621 885 6 621 1040 6 621 1092
6 621 1241 6 621 1241 6 621 1273 6
621 1273 6 621 1352 6 621 1356 6 621
324 6 621 324 6 621 429 6 621 570
6 621 587 6 621 621 6 621 621 6
621 621 6 621 786 6 621 
# 622
optim classif of object algorithm 83 cacm march 1962 mayoh
b h ca620310 jb march 20 1978 3 02 pm
622 5 622 622 5 622 622 5 622 
# 623
economis a sequenc 2 algorithm 82 cacm march 1962 mayoh
b h ca620309 jb march 20 1978 3 03 pm
623 5 623 623 5 623 623 5 623 
# 624
economis a sequenc 1 algorithm 81 cacm march 1962 mayoh
b h ca620308 jb march 20 1978 3 04 pm
624 5 624 624 5 624 624 5 624 
# 625
reciproc gamma function of real argument algorithm 80 cacm march
1962 holsten w ca620307 jb march 20 1978 3 05
pm 625 5 625 625 5 625 625 5 625
# 626
a method of represent storag and retriev of 13 random
code in a 4 digit number or 16 random code
in a 5 digit number cacm march 1962 foster m
b ca620306 jb march 20 1978 3 07 pm 626
5 626 626 5 626 626 5 626 
# 627
knot list structur cacm march 1962 weizenbaum j ca620305 jb
march 20 1978 3 07 pm 249 4 627 254
4 627 272 4 627 1024 4 627 1050 4
627 1051 4 627 1102 4 627 1102 4 627
1109 4 627 1132 4 627 1140 4 627 1188
4 627 1306 4 627 1390 4 627 1393 4
627 1464 4 627 1486 4 627 1491 4 627
1549 4 627 1549 4 627 1706 4 627 1767
4 627 1781 4 627 1787 4 627 1826 4
627 1878 4 627 1949 4 627 321 4 627
378 4 627 2023 4 627 2059 4 627 2060
4 627 2126 4 627 2155 4 627 2168 4
627 435 4 627 437 4 627 463 4 627
483 4 627 491 4 627 2719 4 627 2723
4 627 2732 4 627 2838 4 627 2842 4
627 2855 4 627 2879 4 627 560 4 627
583 4 627 3073 4 627 3077 4 627 3080
4 627 3106 4 627 3112 4 627 627 4
627 627 4 627 627 4 627 631 4 627
632 4 627 642 4 627 644 4 627 653
4 627 680 4 627 761 4 627 762 4
627 763 4 627 106 4 627 123 4 627
140 4 627 919 4 627 989 4 627 106
5 627 196 5 627 1050 5 627 210 5
627 1549 5 627 2723 5 627 2882 5 627
627 5 627 627 5 627 627 5 627 731
5 627 793 5 627 849 6 627 106 6
627 106 6 627 1051 6 627 1549 6 627
1749 6 627 209 6 627 209 6 627 1826
6 627 210 6 627 210 6 627 367 6
627 2198 6 627 2452 6 627 2651 6 627
406 6 627 627 6 627 627 6 627 627
6 627 627 6 627 627 6 627 627 6
627 731 6 627 731 6 627 753 6 627
# 628
on a float point number represent for us with algorithm
languag cacm march 1962 grau a a ca620304 jb march
20 1978 3 09 pm 628 5 628 628 5
628 628 5 628 
# 629
on a wire in binari to decim convers scheme cacm
march 1962 lynch w c ca620303 jb march 20 1978
3 10 pm 629 5 629 629 5 629 629
5 629 
# 630
an evalu of autocod readabl of the mani requir of
an autocod the pair of requir easi to read and
easi to write ar not often compat thi paper argu
that readabl can be ad automat in the translat process
so that the programm can enjoi the utmost economi of
express while for manag a full and valid cobol version
is print to give all the advantag of readabl and
compat cacm march 1962 elli p v ca620302 jb march
20 1978 3 15 pm 630 5 630 630 5
630 630 5 630 
# 631
automat program languag translat through syntact analysi cacm march 1962
ledlei r wilson j b ca620301 jb march 20 1978
3 17 pm 249 4 631 254 4 631 272
4 631 1046 4 631 1102 4 631 1105 4
631 1109 4 631 1139 4 631 1140 4 631
1140 4 631 1188 4 631 1234 4 631 1263
4 631 1265 4 631 1306 4 631 1464 4
631 1491 4 631 1496 4 631 1767 4 631
1781 4 631 1781 4 631 1787 4 631 1824
4 631 1949 4 631 321 4 631 2059 4
631 2126 4 631 2126 4 631 2546 4 631
435 4 631 437 4 631 463 4 631 464
4 631 483 4 631 491 4 631 2732 4
631 560 4 631 583 4 631 584 4 631
3073 4 631 627 4 631 631 4 631 631
4 631 632 4 631 642 4 631 644 4
631 653 4 631 653 4 631 680 4 631
680 4 631 761 4 631 762 4 631 763
4 631 763 4 631 795 4 631 799 4
631 123 4 631 140 4 631 919 4 631
945 4 631 989 4 631 196 5 631 1139
5 631 1265 5 631 1665 5 631 404 5
631 631 5 631 631 5 631 631 5 631
763 5 631 196 6 631 1781 6 631 224
6 631 224 6 631 378 6 631 399 6
631 404 6 631 404 6 631 404 6 631
412 6 631 438 6 631 464 6 631 464
6 631 3184 6 631 631 6 631 631 6
631 631 6 631 631 6 631 635 6 631
799 6 631 
# 632
vectorcardiograph diagnosi with the aid of algol cacm februari 1962
forsyth g e von der groeben j tool j g
ca620211 jb march 20 1978 3 41 pm 249 4
632 254 4 632 272 4 632 1102 4 632
1109 4 632 1140 4 632 1188 4 632 1306
4 632 1464 4 632 1491 4 632 1767 4
632 1781 4 632 1787 4 632 1949 4 632
321 4 632 2059 4 632 2126 4 632 435
4 632 437 4 632 463 4 632 483 4
632 491 4 632 2732 4 632 560 4 632
583 4 632 3073 4 632 627 4 632 631
4 632 632 4 632 642 4 632 644 4
632 653 4 632 680 4 632 761 4 632
762 4 632 763 4 632 123 4 632 140
4 632 919 4 632 989 4 632 196 5
632 632 5 632 632 5 632 632 5 632
# 633
simul and analysi of biochem system iii analysi and pattern
recognit cacm februari 1962 garfinkel d polk w higgin j
j ochser r t ca620210 jb march 20 1978 3
43 pm 238 4 633 633 4 633 633 4
633 643 4 633 238 5 633 633 5 633
633 5 633 633 5 633 643 5 633 238
6 633 633 6 633 633 6 633 643 6
633 
# 634
manipul of tree in inform retriev cacm februari 1962 salton
g ca620209 jb march 20 1978 3 44 pm 1087
4 634 634 4 634 931 5 634 1324 5
634 329 5 634 634 5 634 634 5 634
634 5 634 202 6 634 396 6 634 634
6 634 634 6 634 652 6 634 653 6
634 
# 635
a note on multipli boolean matric cacm februari 1962 baker
j j ca620208 jb march 20 1978 3 45 pm
1151 5 635 1265 5 635 2769 5 635 635
5 635 635 5 635 635 5 635 404 6
635 464 6 635 3184 6 635 631 6 635
635 6 635 635 6 635 635 6 635 
# 636
tape split in an iter program cacm februari 1962 weisert
c ca620207 jb march 20 1978 3 46 pm 1117
5 636 636 5 636 636 5 636 636 5
636 861 6 636 862 6 636 636 6 636
# 637
a neliac gener 7090 1401 compil neliac system for sever
differ machin have been gener us the origin neliac system
develop at the naval electron laboratori san diego in 1958
a basic bootstrap process wa us to gener all but
the first i e the system were describ in the
neliac languag and gener by an exist neliac compil thi
experi ha shown there is no inher difficulti in build
compil with compil inde it point out mani advantag in
us a pol for construct program system thi report present
the result of a project complet in mai 1961 in
which the neliac system wa us to gener a compil
for the ibm 1401 the 1401 compil which run on
the 7090 and produc 1401 program wa describ in the
neliac languag and gener with 7090 neliac system the reduct
in program time and the improv in document of the
system were veri signific cacm februari 1962 watt j b
wattenburg w h ca620206 jb march 20 1978 3 52
pm 1781 4 637 637 4 637 637 4 637
123 4 637 123 5 637 165 5 637 637
5 637 637 5 637 637 5 637 
# 638
surg a recod of the cobol merchandis control algorithm cacm
februari 1962 longo l f ca620205 jb march 20 1978
3 53 pm 638 4 638 300 5 638 638
5 638 638 5 638 638 5 638 
# 639
differ express coeffici algorithm 79 cacm februari 1962 giammo t
p ca620204 jb march 20 1978 3 54 pm 639
5 639 639 5 639 639 5 639 
# 640
ration root of polynomi with integ coeffici algorithm 78 cacm
februari 1962 perri c ca620203 jb march 20 1978 3
55 pm 640 5 640 640 5 640 640 5
640 
# 641
interpol differenti and integr algorithm 77 cacm februari 1962 hennion
p e ca620202 jb march 20 1978 3 56 pm
641 5 641 641 5 641 641 5 641 
# 642
an introduct to algol cacm februari 1962 schwarz h r
ca620201 jb march 20 1978 3 57 pm 205 4
642 210 4 642 214 4 642 249 4 642
254 4 642 272 4 642 1102 4 642 1109
4 642 1140 4 642 1188 4 642 1306 4
642 1464 4 642 1491 4 642 1767 4 642
1781 4 642 1787 4 642 1949 4 642 1982
4 642 321 4 642 398 4 642 2059 4
642 2126 4 642 435 4 642 437 4 642
463 4 642 483 4 642 491 4 642 2732
4 642 560 4 642 583 4 642 3073 4
642 627 4 642 631 4 642 632 4 642
642 4 642 642 4 642 644 4 642 653
4 642 669 4 642 680 4 642 761 4
642 762 4 642 763 4 642 100 4 642
123 4 642 123 4 642 140 4 642 164
4 642 919 4 642 989 4 642 196 5
642 1 5 642 1173 5 642 1188 5 642
642 5 642 642 5 642 642 5 642 196
6 642 642 6 642 642 6 642 
# 643
simul and analysi of biochemci system ii solut of differenti
equat cacm januari 1962 larson r seller p meyer r
ca620116 jb march 20 1978 3 58 pm 238 4
643 633 4 643 643 4 643 643 4 643
238 5 643 633 5 643 643 5 643 643
5 643 643 5 643 238 6 643 633 6
643 643 6 643 643 6 643 
# 644
a string languag for symbol manipul base on algol 60
an artifici comput program languag is propos for describ the
manipul of string of charact and symbol the concept of
string introduc in the algol 60 report is extend by
ad 1 the declar of string substr and string arrai
with explicit length 2 the abil to concaten and shift
string and 3 the rank of symbol for compar sting
in boolean relat a primer or inform descript of the
languag is follow by exampl a descript of experi with
the languag on an ibm 704 comput and a formal
descript which taken with the algol 60 report defin the
propos string languag cacm januari 1962 wegstein j h youden
w w ca620115 jb march 20 1978 4 02 pm
249 4 644 254 4 644 272 4 644 1102
4 644 1109 4 644 1140 4 644 1188 4
644 1306 4 644 1464 4 644 1491 4 644
1767 4 644 1781 4 644 1787 4 644 1949
4 644 321 4 644 2059 4 644 2126 4
644 435 4 644 437 4 644 463 4 644
483 4 644 491 4 644 2732 4 644 560
4 644 583 4 644 3073 4 644 627 4
644 631 4 644 632 4 644 642 4 644
644 4 644 644 4 644 644 4 644 653
4 644 680 4 644 761 4 644 762 4
644 763 4 644 123 4 644 140 4 644
919 4 644 989 4 644 196 5 644 1084
5 644 206 5 644 207 5 644 644 5
644 644 5 644 644 5 644 868 6 644
603 6 644 644 6 644 669 6 644 791
6 644 797 6 644 
# 645
invr algorithm 66 cacm januari 1962 randel b broyden c
g ca620114 jb march 20 1978 4 04 pm 645
5 645 645 5 645 645 5 645 
# 646
invers of a finit segment of the hilbert matrix algorithm
50 cacm januari 1962 randel b ca620113 jb march 20
1978 4 31 pm 646 5 646 646 5 646
646 5 646 
# 647
numer solut of the polynomi equat algorithm 30 cacm januari
1962 cohen k j ca620112 jb march 20 1978 4
32 pm 647 5 647 647 5 647 647 5
647 
# 648
sort procedur algorithm 76 cacm januari 1962 flore i ca620111
jb march 20 1978 4 33 pm 648 5 648
648 5 648 648 5 648 
# 649
factor algorithm 75 cacm januari 1962 peck j e l
ca620110 jb march 20 1978 4 34 pm 649 5
649 649 5 649 649 5 649 
# 650
curv fit with constraint algorithm 74 cacm januari 1962 peck
j e l ca620109 jb march 20 1978 4 35
pm 650 5 650 650 5 650 650 5 650
# 651
a survei of languag and system for inform retriev cacm
januari 1962 grem m ca620108 jb march 20 1978 4
36 pm 651 5 651 651 5 651 651 5
651 
# 652
us of semant structur in inform system cacm januari 1962
sabl j d ca620107 jb march 20 1978 4 37
pm 1324 5 652 652 5 652 652 5 652
652 5 652 634 6 652 652 6 652 653
6 652 
# 653
translat of retriev request couch in a semiform english like
languag cacm januari 1962 cheatham jr t e warshal s
ca620106 jb march 20 1978 4 39 pm 249 4
653 254 4 653 272 4 653 1046 4 653
1102 4 653 1105 4 653 1109 4 653 1139
4 653 1140 4 653 1140 4 653 1188 4
653 1234 4 653 1263 4 653 1265 4 653
1306 4 653 1464 4 653 1491 4 653 1496
4 653 1767 4 653 1781 4 653 1781 4
653 1787 4 653 1824 4 653 1949 4 653
321 4 653 2059 4 653 2126 4 653 2126
4 653 2546 4 653 435 4 653 437 4
653 463 4 653 464 4 653 483 4 653
491 4 653 2732 4 653 560 4 653 583
4 653 584 4 653 3073 4 653 627 4
653 631 4 653 631 4 653 632 4 653
642 4 653 644 4 653 653 4 653 653
4 653 680 4 653 680 4 653 761 4
653 762 4 653 763 4 653 763 4 653
795 4 653 799 4 653 123 4 653 140
4 653 919 4 653 945 4 653 989 4
653 196 5 653 1324 5 653 404 5 653
653 5 653 653 5 653 653 5 653 892
5 653 634 6 653 652 6 653 653 6
653 653 6 653 656 6 653 
# 654
languag problem pose by heavili structur data cacm januari 1962
barn r f ca620105 jb march 20 1978 4 40
pm 654 5 654 654 5 654 654 5 654
# 655
comit as an ir languag mani of the featur that
make comit a good all around symbol manipul languag also
render it well suit to variou type of inform retriev
program present here is a gener discuss of thi uniqu
and differ program languag and an examin of some of
it applic cacm januari 1962 yngve v h ca620104 jb
march 20 1978 4 46 pm 1145 5 655 655
5 655 655 5 655 655 5 655 655 6
655 
# 656
an inform system with the abil to extract intellig from
data cacm januari 1962 wang t l ca620103 jb march
20 1978 4 47 pm 1309 5 656 656 5
656 656 5 656 656 5 656 892 5 656
653 6 656 656 6 656 656 6 656 
# 657
inform structur for process and retriev cacm januari 1962 colilla
r a sam b h ca620102 jb march 20 1978
4 48 pm 657 4 657 657 4 657 1136
5 657 279 5 657 409 5 657 657 5
657 657 5 657 657 5 657 493 6 657
616 6 657 657 6 657 
# 658
discuss the pro and con of a special ir languag
cacm januari 1962 sammet j e ohlman h bohnest h
g ca620101 jb march 20 1978 4 50 pm 658
5 658 658 5 658 658 5 658 
# 659
revers of seri algorithm 193 cacm decemb 1963 thacher jr
h c ca631215 jb march 23 1978 8 08 pm
1121 4 659 659 4 659 964 4 659 659
5 659 659 5 659 659 5 659 759 5
659 
# 660
more test matric for determin and invers pracniqu cacm decemb
1963 englar t s ca631214 jb march 13 1978 2
46 pm 660 5 660 660 5 660 660 5
660 
# 661
index and the lambda notat some method of index sequenti
store element of spars multi dimension arrai ar describ in
the scheme a notat cacm decemb 1963 barnett m p
ca631213 jb march 13 1978 2 51 pm 661 5
661 661 5 661 661 5 661 
# 662
shuttl sort algorithm 175 cacm decemb 1963 juelich o c
ca631212 jb march 13 1978 2 52 pm 662 5
662 662 5 662 662 5 662 
# 663
determin algorithm 159 cacm decemb 1963 lapidu a ca631211 jb
march 13 1978 2 53 pm 663 5 663 663
5 663 663 5 663 
# 664
assign algorithm 27 cacm decemb 1963 witti r d ca631210
jb march 13 1978 2 54 pm 664 5 664
664 5 664 664 5 664 
# 665
gauss seidel algorithm 220 cacm decemb 1963 shantz p w
ca631209 jb march 13 1978 2 55 pm 665 5
665 665 5 665 665 5 665 
# 666
topolog order for pert network algorithm 219 cacm decemb 1963
kase r h ca631208 jb march 13 1978 2 56
pm 1916 5 666 666 5 666 666 5 666
666 5 666 1533 6 666 666 6 666 
# 667
kutta merson algorithm 218 cacm decemb 1963 lukehart p m
ca631207 jb march 13 1978 2 57 pm 667 5
667 667 5 667 667 5 667 
# 668
minimum excess cost curv algorithm 217 cacm decemb 1963 brigg
w a ca631206 jb march 13 1978 2 58 pm
668 5 668 668 5 668 668 5 668 
# 669
a specif of jovial cacm decemb 1963 shaw c j
ca631205 jb march 13 1978 2 59 pm 205 4
669 210 4 669 214 4 669 1086 4 669
1132 4 669 1234 4 669 1263 4 669 1265
4 669 1270 4 669 1323 4 669 1358 4
669 1379 4 669 1380 4 669 1453 4 669
1464 4 669 1484 4 669 1491 4 669 1498
4 669 1613 4 669 1614 4 669 1781 4
669 1781 4 669 1825 4 669 1860 4 669
1982 4 669 398 4 669 2083 4 669 2178
4 669 2179 4 669 2252 4 669 2325 4
669 2341 4 669 2546 4 669 2645 4 669
2652 4 669 2684 4 669 2842 4 669 2929
4 669 2934 4 669 3069 4 669 642 4
669 669 4 669 669 4 669 669 4 669
679 4 669 691 4 669 761 4 669 100
4 669 123 4 669 164 4 669 949 4
669 989 4 669 1 5 669 1084 5 669
1379 5 669 1625 5 669 1945 5 669 410
5 669 3184 5 669 669 5 669 669 5
669 669 5 669 823 6 669 868 6 669
914 6 669 915 6 669 917 6 669 984
6 669 989 6 669 990 6 669 1012 6
669 1084 6 669 1098 6 669 1122 6 669
1138 6 669 1139 6 669 1141 6 669 1200
6 669 1223 6 669 1248 6 669 1263 6
669 1265 6 669 1336 6 669 1396 6 669
1455 6 669 1477 6 669 1477 6 669 1487
6 669 1491 6 669 1496 6 669 483 6
669 3184 6 669 584 6 669 603 6 669
644 6 669 669 6 669 669 6 669 669
6 669 669 6 669 680 6 669 761 6
669 763 6 669 791 6 669 797 6 669
# 670
some legal implic of the us of comput in the
bank busi the introduct of comput in to the bank
busi ha a wide varieti of legal implic that merit
care attent at thi veri earli stage the industri is
highli regul by govern and henc is subject to mani
statut and regul it also is affect by import common
law rule establish by court the legal ramif involv not
onli the mechan itself but also the veri signific econom
attract phenomenon of off premis process it is essenti to
identifi and provid for mani legal aspect right now befor
system and practic crystal in order to avoid the later
impact of unanticip physic complic and expens the legal aspect
of computer in the bank busi ar especi divers in
some state there might be the basic question whether bank
ar author by law to invest in the new facil
either directli or through cooper more challeng ar question relat
to off premis processor particularli with respect to the oblig
not to disclos inform concern a bank s custom the
adequaci of fidel bond coverag the extent of liabil for
improp refus to pai a check and suscept to regul
by govern agenc also pertin is the proprieti of data
process by bank for nonbank entiti and particularli of the
render of that servic without charg for bank depositor cacm
decemb 1963 freed r n ca631204 jb march 13 1978
3 09 pm 670 5 670 670 5 670 670
5 670 
# 671
telefil a case studi of an on line save bank
applic the develop of an on line comput system for
a save bank institut is trace from the earli conceptu
need of the bank to the consumm of design by
the teleregist corpor both bank and equip criteria ar specifi
which led to the develop of the telefil system of
the teleregist corpor oper of the on line and off
line program ar describ and statist ar cite for reliabl
and perform of the system benefit to the bank ar
discuss from the banker s point of view an indic
of futur trend in the on line save bank field
is also discuss cacm decemb 1963 sander m ca631203 jb
march 13 1978 3 13 pm 671 5 671 671
5 671 671 5 671 
# 672
recent develop affect adp in tax administr cacm decemb 1963
leibowitz g j ca631202 jb march 13 1978 3 14
pm 672 5 672 672 5 672 672 5 672
# 673
account classif at autom bank cacm decemb 1963 eckert j
b ca631201 jb march 13 1978 3 15 pm 673
5 673 673 5 673 673 5 673 
# 674
applic of ibm 1620 edp method to the calcul of
the format constant of complex iron cacm novemb 1963 andrew
a c hassler j decou f ca631118 jb march 13
1978 3 18 pm 674 5 674 674 5 674
674 5 674 
# 675
code clinic laboratori data for automat storag and retriev a
seri of clinic laboratori code have been develop to accept
and store urin analysi blood chemistri and hematolog test result
for automat data process the code although construct as part
of a computer hospit simul have been abl to handl
the result of everi laboratori test that thei have encount
the uniqu featur of these code is that thei can
accept convention record qualit as well as quantit test result
consequ clinic test result need not be arbitrarili stratifi standard
or alter in ani wai to be code thi paper
describ how the code were develop and present a list
of the urin analysi code five criteria us in develop
the code ar outlin and the problem of multipl synonym
terminolog is discuss a solut to the problem is describ
flexibl comput produc composit laboratori report ar also discuss along
with reproduct of such a report the paper conclud that
even though mani problem remain unsolv the next ten year
could wit the emerg of a practic autom inform system
in the laboratori cacm novemb 1963 gross l d ca631117
jb march 13 1978 3 26 pm 675 5 675
675 5 675 675 5 675 
# 676
on the comput of a certain type of incompletebeta function
cacm novemb 1963 tang i c ca631116 jb march 13
1978 3 27 pm 676 5 676 676 5 676
676 5 676 
# 677
length of string for a merg sort detail statist ar
given on the length of maxim sort string which result
form the first intern sort phase of a merg sort
onto tape it is shown that the string produc by
an altern method i e on which produc ascend and
descend string altern tend to be onli three fourth as
long as those in a method which produc onli ascend
string contrari to statement which have appear previous in the
literatur a slight modif of the read backward polyphas merg
algorithm is therefor suggest cacm novemb 1963 knuth d e
ca631115 jb march 13 1978 3 31 pm 1117 4
677 2017 4 677 2146 4 677 677 4 677
860 4 677 1638 5 677 2176 5 677 2272
5 677 677 5 677 677 5 677 677 5
677 861 5 677 1638 6 677 677 6 677
677 6 677 677 6 677 
# 678
optim bit time comput simul a major compon of a
bit time comput simul program is the boolean compil the
compil accept the boolean function repres the simul comput s
digit circuit and gener correspond set of machin instruct which
ar subsequ execut on the host comput techniqu ar discuss
for increas the sophist of the boolean compil so as
to optim bit time comput simul the techniqu ar applic
to ani gener purpos comput cacm novemb 1963 katz j
h ca631114 jb march 13 1978 3 34 pm 678
4 678 1030 5 678 270 5 678 1886 5
678 1939 5 678 678 5 678 678 5 678
678 5 678 1030 6 678 678 6 678 678
6 678 678 6 678 
# 679
recent improv in madcap madcap is a program languag admit
subscript superscript and certain form of displai formula the basic
implement of thi languag wa describ in a previou paper
madcap a scientif compil for a displai formula textbook languag
comm acm 4 jan 61 31 36 thi paper discuss
recent improv in the languag in three area complex displai
logic control and subprogram in the area of complex displai
the most promin improv ar a notat for integr and
for the binomi coeffici in the area of logic control
the chief new featur is a notat for variabl nest
loop the discuss of subprogram is focus on madcap s
notat for and us of procedur cacm novemb 1963 well
m b ca631113 jb march 13 1978 3 39 pm
1083 4 679 1086 4 679 1132 4 679 1234
4 679 1263 4 679 1265 4 679 1270 4
679 1323 4 679 1358 4 679 1379 4 679
1380 4 679 1396 4 679 1453 4 679 1464
4 679 1484 4 679 1491 4 679 1498 4
679 1613 4 679 1614 4 679 1781 4 679
1825 4 679 1860 4 679 2083 4 679 2178
4 679 2179 4 679 2252 4 679 2325 4
679 2341 4 679 2546 4 679 2645 4 679
2652 4 679 2684 4 679 2842 4 679 2929
4 679 2934 4 679 3069 4 679 669 4
679 679 4 679 679 4 679 679 4 679
691 4 679 761 4 679 949 4 679 989
4 679 407 5 679 21 5 679 3184 5
679 679 5 679 679 5 679 679 5 679
# 680
an error correct pars algorithm cacm novemb 1963 iron e
t ca631112 jb march 13 1978 3 40 pm 249
4 680 254 4 680 272 4 680 1046 4
680 1102 4 680 1105 4 680 1109 4 680
1139 4 680 1140 4 680 1140 4 680 1188
4 680 1234 4 680 1263 4 680 1265 4
680 1306 4 680 1464 4 680 1491 4 680
1496 4 680 1767 4 680 1781 4 680 1781
4 680 1787 4 680 1824 4 680 1949 4
680 321 4 680 2059 4 680 2126 4 680
2126 4 680 2546 4 680 435 4 680 437
4 680 463 4 680 464 4 680 483 4
680 491 4 680 2732 4 680 560 4 680
583 4 680 584 4 680 3073 4 680 627
4 680 631 4 680 631 4 680 632 4
680 642 4 680 644 4 680 653 4 680
653 4 680 680 4 680 680 4 680 761
4 680 762 4 680 763 4 680 763 4
680 795 4 680 799 4 680 123 4 680
140 4 680 919 4 680 945 4 680 989
4 680 196 5 680 1225 5 680 1350 5
680 1646 5 680 1781 5 680 1945 5 680
2650 5 680 2698 5 680 2708 5 680 404
5 680 3093 5 680 680 5 680 680 5
680 680 5 680 823 6 680 830 6 680
830 6 680 123 6 680 196 6 680 914
6 680 915 6 680 917 6 680 919 6
680 984 6 680 987 6 680 989 6 680
990 6 680 990 6 680 1007 6 680 1012
6 680 1012 6 680 1012 6 680 1046 6
680 1072 6 680 1084 6 680 1098 6 680
1122 6 680 1131 6 680 1138 6 680 1139
6 680 1139 6 680 1140 6 680 1141 6
680 1149 6 680 1179 6 680 1198 6 680
1200 6 680 1215 6 680 1223 6 680 1223
6 680 1225 6 680 1265 6 680 1265 6
680 1265 6 680 1303 6 680 1323 6 680
1336 6 680 1358 6 680 1366 6 680 1396
6 680 1399 6 680 1421 6 680 1455 6
680 1460 6 680 1462 6 680 1463 6 680
1467 6 680 1468 6 680 1477 6 680 1477
6 680 1477 6 680 1477 6 680 1487 6
680 1491 6 680 1491 6 680 1491 6 680
1491 6 680 1491 6 680 1496 6 680 1496
6 680 1531 6 680 1535 6 680 1565 6
680 1601 6 680 1602 6 680 1613 6 680
1614 6 680 1626 6 680 1641 6 680 1647
6 680 1781 6 680 1787 6 680 1787 6
680 1788 6 680 205 6 680 224 6 680
249 6 680 288 6 680 316 6 680 381
6 680 398 6 680 2110 6 680 2111 6
680 2111 6 680 11 6 680 2179 6 680
2534 6 680 2556 6 680 2556 6 680 2708
6 680 404 6 680 410 6 680 463 6
680 464 6 680 483 6 680 483 6 680
3184 6 680 3188 6 680 576 6 680 584
6 680 584 6 680 600 6 680 669 6
680 680 6 680 680 6 680 680 6 680
680 6 680 680 6 680 680 6 680 680
6 680 680 6 680 680 6 680 691 6
680 763 6 680 763 6 680 799 6 680
799 6 680 
# 681
flexibl abbrevi of word in a comput languag cacm novemb
1963 lomi r g rubin j ca631111 jb march 13
1978 3 42 pm 681 5 681 681 5 681
681 5 681 
# 682
recurs program in fortran ii cacm novemb 1963 ayer j
a ca631110 jb march 13 1978 3 43 pm 682
5 682 682 5 682 682 5 682 
# 683
a serial techniqu to determin minimum path cacm novemb 1963
weimer d l ca631109 jb march 13 1978 3 44
pm 683 5 683 683 5 683 683 5 683
# 684
interpol differenti and integr algorithm 77 cacm novemb 1963 hennion
p e ca631108 jb march 13 1978 3 45 pm
684 5 684 684 5 684 684 5 684 
# 685
euler summat algorithm 8 cacm novemb 1963 thacher jr h
c ca631108 jb march 13 1978 3 46 pm 685
5 685 685 5 685 685 5 685 
# 686
smooth algorithm 216 cacm novemb 1963 georg r ca631106 jb
march 13 1978 3 47 pm 686 5 686 686
5 686 686 5 686 
# 687
shank algorithm 215 cacm novemb 1963 thacher jr h c
ca631105 jb march 13 1978 3 48 pm 687 5
687 687 5 687 687 5 687 
# 688
q bessel function in t algorithm 214 cacm novemb 1963
simo pereira j m s ca631104 jb march 13 1978
3 49 pm 688 5 688 688 5 688 688
5 688 
# 689
report of a visit to discuss common program languag in
czechoslovakia and poland 1963 cacm novemb 1963 gosden j a
merner j n gai r e jone j l christoph
j s ca631103 jb march 13 1978 3 51 pm
1349 4 689 323 4 689 689 4 689 689
4 689 689 4 689 217 5 689 323 5
689 3197 5 689 689 5 689 689 5 689
689 5 689 
# 690
usa particip in an intern standard glossari on inform process
cacm novemb 1963 traub j f ca631102 jb march 13
1978 3 52 pm 690 4 690 690 4 690
690 4 690 929 5 690 3195 5 690 690
5 690 690 5 690 690 5 690 890 5
690 
# 691
a descript of the apt languag the apt automat program
tool languag for numer control program is describ us the
metalinguist notat introduc in the algol 60 report exampl of
apt usag ar includ present also ar an histor summari
of the develop of apt and a statement concern it
present statu cacm novemb 1963 brown s a drayton c
e mittman b ca631101 jb march 13 1978 3 59
pm 1086 4 691 1132 4 691 1234 4 691
1263 4 691 1265 4 691 1270 4 691 1323
4 691 1358 4 691 1379 4 691 1380 4
691 1453 4 691 1464 4 691 1484 4 691
1491 4 691 1498 4 691 1613 4 691 1614
4 691 1781 4 691 1825 4 691 1860 4
691 1945 4 691 2083 4 691 2126 4 691
2178 4 691 2179 4 691 2252 4 691 2325
4 691 2341 4 691 2546 4 691 2645 4
691 2652 4 691 2684 4 691 2842 4 691
2929 4 691 2934 4 691 3069 4 691 669
4 691 679 4 691 691 4 691 691 4
691 761 4 691 949 4 691 989 4 691
1781 5 691 3184 5 691 691 5 691 691
5 691 691 5 691 823 5 691 123 6
691 196 6 691 919 6 691 990 6 691
1007 6 691 1046 6 691 1131 6 691 1139
6 691 1140 6 691 1149 6 691 1198 6
691 1215 6 691 1223 6 691 1265 6 691
1303 6 691 1323 6 691 1358 6 691 1366
6 691 1421 6 691 1460 6 691 1462 6
691 1463 6 691 1467 6 691 1468 6 691
1477 6 691 1491 6 691 1496 6 691 1531
6 691 1535 6 691 1565 6 691 1601 6
691 1602 6 691 1613 6 691 1614 6 691
1626 6 691 1641 6 691 1787 6 691 1788
6 691 205 6 691 224 6 691 249 6
691 288 6 691 316 6 691 381 6 691
398 6 691 11 6 691 404 6 691 410
6 691 463 6 691 464 6 691 483 6
691 3184 6 691 3188 6 691 584 6 691
600 6 691 680 6 691 691 6 691 763
6 691 799 6 691 
# 692
on the invers of a test matrix cacm octob 1963
stockmal f j ca631033 jb march 27 1978 9 00
pm 692 5 692 692 5 692 692 5 692
# 693
an extens of fibonaccian search to sever variabl a techniqu
which us fibonaccian search concept ha been develop to solv
optim problem involv unimod function of sever variabl the techniqu
ha not been proven to be optim in the sens
that the on dimension fibonaccian search is howev it is
valuabl for certain kind of calcul cacm octob 1963 krolak
p cooper l ca631032 jb march 13 1978 4 19
pm 693 5 693 693 5 693 693 5 693
# 694
a comparison of disk and tape the princip characterist of
current magnet disk and tape unit ar summar and compar
some of the characterist of disk file ar illustr in
a sort exampl and compar to a tapesort the conclus
is present that disk file ar competit to tape in
some import applic cacm octob 1963 hess h ca631031 jb
march 13 1978 4 21 pm 694 5 694 694
5 694 694 5 694 
# 695
us of the disk file on stretch the paper begin
by briefli describ the stretch ibm 7030 comput with special
emphasi given to the organ and oper of it input
output equip physic characterist of the two disk system 4
194 304 72 bit word 8 usec per word transmiss
rate etc ar note time limit due to arm motion
and disk rotat ar discuss applic of disk usag ar
discuss separ for problem program and for system program such
as compil and the supervisori program approxim 260 000 word
of disk storag ar reserv for the storag of system
program and the subroutin librari problem program howev ar not
current file on the disk certain program techniqu ar discuss
for transmit word between disk and core storag with minimum
delai and interrupt of the arithmet unit dump on disk
ar consid for both recoveri from comput malfunct and for
mathemat or physic develop dure the calcul some comment ar
made regard the reliabl econom util and weak or limit
of the disk system sever possibl futur applic ar note
which appear to have disk connot cacm octob 1963 carlson
b g voorh e a ca631030 jb march 13 1978
4 28 pm 695 5 695 695 5 695 695
5 695 
# 696
an automat data acquisit and inquiri system us disk file
lockhe missil and space compani ha instal a larg scale
automat data acquisit ada system which ti togeth the compani
s manufactur facil locat in van nui and sunnyval california
the system includ over 200 remot input station which collect
and transmit compani oper data to a central data process
center two rca 301 edp system ar us to record
and control the flow of data transmit to the data
process center a larg capac rca 366 data disc file
is us to store inform requir to provid up to
date inform in respons to inquiri receiv from remot locat
inquiri station in addit to storag of data on the
disk file the system automat record all incom and outgo
data on magnet tape to be us as input to
the compani s convent off line busi data process applic
cacm octob 1963 edward j d ca631029 jb march 13
1978 4 34 pm 696 5 696 696 5 696
696 5 696 
# 697
a numer method for the determin of move field isodos
curv for treatment plan in radiotherapi cacm octob 1963 dalrympl
g v perez tamayo r ca631028 jb march 13 1978
5 19 pm 697 5 697 697 5 697 697
5 697 
# 698
data dial two wai commun with comput from ordinari dial
telephon an oper system is describ which allow user to
call up a remot locat comput from ordinari dial telephon
no special hardwar or connect ar requir at the user
telephon input to the comput is through the telephon dial
output from the comput is in spoken form result of
a test with telephon in the boston area ar report
cacm octob 1963 maril t edward d feurzeig w ca631027
jb march 13 1978 5 23 pm 1181 5 698
698 5 698 698 5 698 698 5 698 698
6 698 
# 699
a contour map program for x rai crystallographi a fortran
program is describ for us with the ibm 7090 system
and an x y plotter to produc a contour map
a matrix of point evenli space in each dimens is
contour scale factor along the ax mai be differ and
the ax need not be perpendicular cacm octob 1963 dayhoff
m o ca631026 jb march 13 1978 5 26 pm
2633 5 699 699 5 699 699 5 699 699
5 699 699 6 699 
# 700
hermit interpol algorithm 210 cacm octob 1963 dwyer t a
ca631025 jb march 13 1978 5 27 pm 700 5
700 700 5 700 700 5 700 
# 701
shuttl sort algorithm 175 cacm octob 1963 schubert g r
ca631024 jb march 13 1978 5 29 pm 701 5
701 701 5 701 701 5 701 
# 702
assign algorithm 173 cacm octob 1963 filsak z vrchovecka l
ca631023 jb march 13 1978 5 31 pm 702 5
702 702 5 702 702 5 702 
# 703
assign algorithm 173 cacm octob 1963 scowen r s ca631022
jb march 13 1978 5 32 pm 703 5 703
703 5 703 703 5 703 
# 704
combinatori of m thing taken on at a time two
at a time up to n at a time algorithm
161 cacm octob 1963 collin d h ca631021 jb march
13 1978 5 34 pm 704 5 704 704 5
704 704 5 704 
# 705
combinatori of m thing taken n at a time algorithm
160 cacm octob 1963 blake r e ca631020 jb march
13 1978 5 36 pm 705 5 705 705 5
705 705 5 705 
# 706
fourier seri approxim algorithm 157 cacm octob 1963 schubert g
r ca631019 jb march 13 1978 5 37 pm 706
5 706 706 5 706 706 5 706 
# 707
erf x algorithm 123 cacm octob 1963 ibbetson d ca631018
jb march 13 1978 5 40 pm 1583 5 707
707 5 707 707 5 707 707 5 707 831
6 707 967 6 707 1126 6 707 707 6
707 
# 708
evalu of the fresnel integr algorithm 88 89 90 cacm
octob 1963 grai m d ca631017jb march 13 1978 5
45 pm 708 5 708 708 5 708 708 5
708 
# 709
assign algorithm 27 cacm octob 1963 newhous a ca631016 jb
march 13 1978 5 46 pm 709 5 709 709
5 709 709 5 709 
# 710
fresnel integr algorithm 213 cacm octob 1963 grai m d
ca631015 jb march 13 1978 5 47 pm 710 5
710 710 5 710 710 5 710 
# 711
frequenc distribut algorithm 212 cacm octob 1963 grai m d
ca631014 jb march 13 1978 5 50 pm 711 5
711 711 5 711 711 5 711 
# 712
hermit interpol algorithm 211 cacm octob 1963 schubert g r
ca631013 jb march 13 1978 5 51 pm 712 5
712 712 5 712 712 5 712 
# 713
lagrangian interpol algorithm 210 cacm octob 1963 schubert g r
ca631012 jb march 13 1978 5 52 pm 713 5
713 713 5 713 713 5 713 
# 714
gauss algorithm 209 cacm octob 1963 ibbetson d ca631011 jb
march 13 1978 5 52 pm 1157 5 714 1779
5 714 1920 5 714 1944 5 714 1987 5
714 2548 5 714 714 5 714 714 5 714
714 5 714 836 6 714 1081 6 714 1561
6 714 1581 6 714 1778 6 714 1779 6
714 1779 6 714 1944 6 714 485 6 714
714 6 714 714 6 714 714 6 714 714
6 714 714 6 714 714 6 714 
# 715
discret convolut algorithm 208 cacm octob 1963 foreman jr w
t ca631010 jb march 13 1978 5 53 pm 715
5 715 715 5 715 715 5 715 
# 716
stringsort algorithm 207 cacm octob 1963 boothroyd j ca631009 jb
march 13 1978 5 54 pm 2679 5 716 716
5 716 716 5 716 716 5 716 970 6
716 1175 6 716 1190 6 716 1228 6 716
1969 6 716 1997 6 716 308 6 716 2042
6 716 3187 6 716 507 6 716 716 6
716 783 6 716 
# 717
partit algorithm for finit set the partit of a set
with n element ar repres by certain n tupl of
posit integ algorithm ar describ which gener without repetit the
n tupl correspond to 1 all partit of the given
set 2 all partit of the given set into m
or fewer set 1 m n and 3 all partit
of the given set into exactli m set 1 m
n cacm octob 1963 hutchinson g ca631008 jb march 13
1978 5 57 pm 717 5 717 717 5 717
717 5 717 
# 718
an experi in automat verif of program how effect is
a compil at replac explicit verif and what is the
cost of thi techniqu cacm octob 1963 weinberg g m
gressett g l ca631007 jb march 13 1978 5 59
pm 1053 5 718 718 5 718 718 5 718
718 5 718 435 6 718 474 6 718 718
6 718 720 6 718 
# 719
variabl width stack charact address variabl field comput permit readi
establish and manipul of variabl width stack singl machin command
mai push variabl field item down into such stack or
pop them up the avail of a varieti of field
delimit allow the machin to push down or pop up
more than on variabl width item with on command sinc
these stack oper can be made the basi of compil
decod algorithm the proper us of machin of thi class
for compil ha advantag over machin with fix length word
cacm octob 1963 rotenberg n opler a ca631006 jb march
13 1978 6 25 pm 719 5 719 719 5
719 719 5 719 
# 720
format free input in fortran cacm octob 1963 bailei m
j barnett m p futrel r p ca631005 jb march
13 1978 6 26 pm 1053 4 720 1062 4
720 1121 4 720 1139 4 720 1265 4 720
1781 4 720 464 4 720 720 4 720 720
4 720 720 4 720 759 4 720 1053 5
720 265 5 720 464 5 720 474 5 720
720 5 720 720 5 720 720 5 720 435
6 720 474 6 720 718 6 720 720 6
720 
# 721
report on propos american standard flowchart symbol for inform process
thi paper present the essenti content of the propos american
standard flowchart symbol for inform process thi is the first
propos standard prepar by subcommitte x3 6 on problem descript
and analysi of the american standard associ asa cacm octob
1963 rossheim r j ca631004 jb march 13 1978 6
33 pm 2961 5 721 721 5 721 721 5
721 721 5 721 721 6 721 
# 722
alcor group represent of algol symbol cacm octob 1963 ca631003
jb march 13 1978 6 36 pm 722 5 722
722 5 722 722 5 722 
# 723
ecma subset of algol 60 cacm octob 1963 ca631002 jb
march 13 1978 6 38 pm 723 5 723 723
5 723 723 5 723 
# 724
a profil of the programm synopsi 549 member of the
acm particip in a studi concern primarili with the attitud
of programm toward their career and job a veri high
percentag of programm have appar enter their career by accid
it ha proven a happi choic for most and thei
expect to remain in the field dure the next five
year their princip job satisfact relat to the natur of
their work and mostfind their job offer high level of
profession interest and good work condit salari and advanc prospect
howev ar not as satisfactori more than half report a
posit attitud toward programm and program on the part of
their organ turnov among themselv is attribut primarili to poor
manag salari is seen as the princip motiv factor in
turnov among other programm natur of the work offer and
salari ar princip determin in accept a new job programm
ar less mobil than expect programm tend to see their
colleagu in a favor light on the whole person seem
to vari with function system programm differ from applic programm
four princip problem for program in the immedi futur ar
list by particip languag personnel variou specif applic and techniqu
and build program as a profess cacm octob 1963 ca631001
jb march 13 1978 6 48 pm 724 5 724
724 5 724 724 5 724 
# 725
group particip comput demonstr cacm octob 1963 mccormick e m
ca630933 jb march 13 1978 6 50 pm 725 5
725 725 5 725 725 5 725 
# 726
a gener program for the analysi of squar and rectangular
lattic design thi paper describ a gener purpos program that
will handl those incomplet block design known as squar and
rectangular lattic flow diagram ar given so that the method
of calcul mai be program for ani digit comput cacm
septemb 1963 smilli k w ca630932 jb march 13 1978
6 53 pm 726 5 726 726 5 726 726
5 726 
# 727
on the approxim solut of delta u f u three
dimension dirichlet problem for delta u f u fu 0
ar treat numer by an exception fast exception accur numer
method program detail numer exampl and mathemat theori ar suppliedxtens
of the method in a natur wai to n dimension
problem is indic by mean of a 4 dimension exampl
cacm septemb 1963 greenspan d yohe m ca630931 jb march
13 1978 6 57 pm 727 5 727 727 5
727 727 5 727 
# 728
comput drawn flowchart to meet the need for improv document
of written comput program a simpl system for effect commun
is present which ha shown great promis the programm describ
hi program in a simpl format and the comput prepar
flow chart and other cross referenc list from thi input
the descript can be kept up to date easili and
the final output clearli explain the origin program the system
ha also prove to be a valuabl debug and code
aid cacm septemb 1963 knuth d e ca630930 jb march
13 1978 7 01 pm 728 4 728 728 4
728 920 5 728 1330 5 728 1348 5 728
2315 5 728 45 5 728 728 5 728 728
5 728 728 5 728 1348 6 728 1834 6
728 1987 6 728 528 6 728 728 6 728
728 6 728 728 6 728 
# 729
a gener of algol cacm septemb 1963 wirth n ca630929
jb march 13 1978 7 02 pm 1135 4 729
1136 4 729 1781 4 729 493 4 729 2710
4 729 2765 4 729 2888 4 729 2906 4
729 729 4 729 729 4 729 989 4 729
1037 5 729 1234 5 729 1358 5 729 288
5 729 1491 5 729 616 5 729 729 5
729 729 5 729 729 5 729 196 6 729
944 6 729 1140 6 729 1303 6 729 1460
6 729 205 6 729 321 6 729 385 6
729 400 6 729 402 6 729 404 6 729
3184 6 729 3184 6 729 3184 6 729 729
6 729 729 6 729 729 6 729 729 6
729 799 6 729 
# 730
mirfag a compil base on standard mathemat notat and plain
english a pilot version of the compil mirfag now in
oper is describ the chief featur of the system which
is intend for the solut of scientif problem ar the
present of mathemat formula entir in standard textbook notat the
us of plain english for organiz instruct automat error diagnosi
indic the actual locat of the error in the uncompil
program and an attempt to minim that fragment of the
origin problem statement which is a normal featur of program
system cacm septemb 1963 gawlik h j ca630928 jb march
13 1978 7 06 pm 1083 5 730 1396 5
730 730 5 730 730 5 730 730 5 730
964 6 730 1028 6 730 1029 6 730 1083
6 730 1132 6 730 1214 6 730 1278 6
730 1334 6 730 1365 6 730 1386 6 730
1387 6 730 1388 6 730 1392 6 730 1393
6 730 1394 6 730 1395 6 730 1396 6
730 1397 6 730 1496 6 730 284 6 730
407 6 730 407 6 730 3192 6 730 3193
6 730 3199 6 730 3200 6 730 3201 6
730 3202 6 730 3203 6 730 3204 6 730
561 6 730 730 6 730 730 6 730 
# 731
symmetr list processor a list process system in which each
list cell contain both a forward and a backward link
as well as a datum is describ thi system is
intend for imbed in higher level languag capabl of call
function and subroutin code in machin languag the present is
in the form of fortran program depend on onli a
limit set of fortran program depend on onli a limit
set of primit machin languag subroutin which ar also defin
final a set of field particularli charact manipul primit ar
given to round out the system cacm septemb 1963 weizenbaum
j ca630927 jb march 13 1978 7 10 pm 1050
4 731 1050 4 731 1102 4 731 1549 4
731 378 4 731 2723 4 731 2882 4 731
3008 4 731 731 4 731 731 4 731 793
4 731 798 4 731 1024 5 731 1051 5
731 1098 5 731 1214 5 731 209 5 731
1380 5 731 1388 5 731 1393 5 731 1485
5 731 1487 5 731 1549 5 731 1570 5
731 1878 5 731 1946 5 731 1957 5 731
2168 5 731 2723 5 731 2857 5 731 3112
5 731 627 5 731 731 5 731 731 5
731 731 5 731 878 6 731 106 6 731
106 6 731 106 6 731 902 6 731 1051
6 731 1093 6 731 1098 6 731 1132 6
731 1177 6 731 1380 6 731 1387 6 731
1389 6 731 1393 6 731 1393 6 731 1421
6 731 1549 6 731 1626 6 731 1749 6
731 1826 6 731 1826 6 731 1826 6 731
210 6 731 210 6 731 210 6 731 210
6 731 210 6 731 210 6 731 1860 6
731 1878 6 731 296 6 731 1972 6 731
360 6 731 378 6 731 2438 6 731 2651
6 731 2723 6 731 2736 6 731 2833 6
731 2838 6 731 405 6 731 406 6 731
406 6 731 3184 6 731 627 6 731 627
6 731 731 6 731 731 6 731 731 6
731 731 6 731 731 6 731 731 6 731
731 6 731 731 6 731 731 6 731 731
6 731 731 6 731 731 6 731 731 6
731 731 6 731 731 6 731 731 6 731
731 6 731 731 6 731 753 6 731 793
6 731 794 6 731 799 6 731 
# 732
mont carlo invers algorithm 166 cacm septemb 1963 rodman r
d ca630926 jb march 13 1978 7 11 pm 732
5 732 732 5 732 732 5 732 
# 733
newton interpol with forward divid differ algorithm 169 cacm septemb
1963 thacher jr h c ca630925 jb march 13 1978
7 13 pm 733 5 733 733 5 733 733
5 733 
# 734
newton interpol with backward divid differ algorithm 168 cacm septemb
1963 thacher jr h c ca630924 jb march 13 1978
7 15 pm 734 5 734 734 5 734 734
5 734 
# 735
calcul of confluent divid differ algorithm 167 cacm septemb 1963
thacher jr h c ca630923 jb march 13 1978 7
17 pm 735 5 735 735 5 735 735 5
735 
# 736
modifi hankel function algorithm 163 cacm septemb 1963 thacher jr
h c ca630922 jb march 13 1978 7 18 pm
736 5 736 736 5 736 736 5 736 
# 737
exponenti of seri algorithm 158 cacm septemb 1963 lawrenc j
d ca630921 jb march 13 1978 7 19 pm 737
5 737 737 5 737 737 5 737 
# 738
fourier seri approxim algorithm 157 cacm septemb 1963 georg r
ca630920 jb march 13 1978 7 20 pm 738 5
738 738 5 738 738 5 738 
# 739
minifun algorithm 129 cacm septemb 1963 wasscher e j ca630919
jb march 13 1978 7 22 pm 739 5 739
739 5 739 739 5 739 
# 740
interest algorithm 45 cacm septemb 1963 wright c b ca630918
jb march 13 1978 7 23 pm 740 5 740
740 5 740 740 5 740 
# 741
evalu of determin algorithm 41 cacm septemb 1963 freed b
h ca630917 jb march 13 1978 7 24 pm 741
5 741 741 5 741 741 5 741 
# 742
evalu of determin algorithm 41 cacm septemb 1963 freed b
h ca630916 jb march 13 1978 7 25 pm 742
5 742 742 5 742 742 5 742 
# 743
arccosin algorithm 206 cacm septemb 1963 konda m ca630915 jb
march 13 1978 7 26 pm 743 5 743 743
5 743 743 5 743 
# 744
ativ algorithm 205 cacm septemb 1963 haubrich j g a
ca630914 jb march 13 1978 7 28 pm 744 5
744 744 5 744 744 5 744 
# 745
steep2 algorithm 204 cacm septemb 1963 wasscher e j ca630913
jb march 13 1978 7 29 pm 745 5 745
745 5 745 745 5 745 
# 746
steep1 algorithm 203 cacm septemb 1963 wasscher e j ca630912
jb march 13 1978 7 30 pm 746 5 746
746 5 746 746 5 746 
# 747
gener of permut in lexicograph order algorithm 202 cacm septemb
1963 shen m k ca630911 jb march 13 1978 7
31 pm 2443 5 747 747 5 747 747 5
747 747 5 747 747 6 747 
# 748
a semi iter process for evalu arctang cacm septemb 1963
chu w h saathoff d r ca630910 jb march 13
1978 7 33 pm 748 5 748 748 5 748
748 5 748 
# 749
note onstochast matric cacm septemb 1963 dumei a i ca630909
jb march 13 1978 7 35 pm 749 5 749
749 5 749 749 5 749 
# 750
pei matrix eigenvector cacm septemb 1963 newberi a c r
ca630908 jb march 13 1978 7 36 pm 1963 5
750 750 5 750 750 5 750 750 5 750
909 6 750 475 6 750 750 6 750 
# 751
a note on a set of test matric for invers
cacm septemb 1963 rodman r d ca630907 jb march 13
1978 7 38 pm 751 5 751 751 5 751
751 5 751 
# 752
close out a print tape cacm septemb 1963 moor d
p ca630906 jb march 13 1978 7 39 pm 752
5 752 752 5 752 752 5 752 
# 753
a procedur for convert logic tabl condit into an effici
sequenc of test instruct cacm septemb 1963 egler j f
ca630905 jb march 13 1978 7 40 pm 1237 4
753 2220 4 753 753 4 753 1237 5 753
250 5 753 1549 5 753 1564 5 753 2453
5 753 753 5 753 753 5 753 753 5
753 106 6 753 1051 6 753 1172 6 753
1354 6 753 210 6 753 250 6 753 320
6 753 2053 6 753 2220 6 753 406 6
753 627 6 753 731 6 753 753 6 753
753 6 753 753 6 753 753 6 753 
# 754
ye indiscreet monitor cacm septemb 1963 blatt j m ca630904
jb march 13 1978 7 41 pm 754 4 754
153 5 754 754 5 754 754 5 754 754
5 754 
# 755
an exponenti method of numer integr of ordinari differenti equat
a formula for numer integr is prepar which involv an
exponenti term thi formula is compar to two standard integr
method and it is shown that for a larg class
of differenti equat the exponenti formula ha superior stabil properti
for larg step size thu thi formula mai be us
with a larg step size to decreas the total comput
time for a solut significantli particularli in those engin problem
where high accuraci is not need cacm august 1963 pope
d a ca630843 jb march 13 1978 7 52 pm
2567 5 755 755 5 755 755 5 755 755
5 755 2268 6 755 755 6 755 
# 756
a comput program for edit the new cacm august 1963
danielson w a brigg b ca630842 jb march 13 1978
7 53 pm 756 5 756 756 5 756 756
5 756 
# 757
simul of a traffic network cacm august 1963 katz j
h ca630841 jb march 13 1978 7 55 pm 1890
5 757 757 5 757 757 5 757 757 5
757 757 6 757 
# 758
skelet structur of pert and cpa comput program an introduct
to the inner mechan of pert and cpa comput program
is provid the major compon of these program as well
as their purpos and interrelationship ar outlin cacm august 1963
kahn a b ca630840 jb march 13 1978 7 58
pm 1050 4 758 1226 4 758 1723 4 758
441 4 758 758 4 758 758 4 758 367
5 758 441 5 758 758 5 758 758 5
758 758 5 758 
# 759
continu oper notat for symbol manipul and arrai process a
brief account is given of a notat devic that is
veri us in the formal represent of syntax string relationship
and string transform procedur and also of comput procedur that
deal with arrai of function of mani variabl the devic
consist of the us of certain continu oper or collect
symbol that ar analog to the summat symbol sigma and
continu multipl symbol pi of convent mathemat cacm august 1963
barnett m p ca630839 jb march 13 1978 8 02
pm 1062 4 759 1121 4 759 1139 4 759
1265 4 759 1781 4 759 720 4 759 759
4 759 964 5 759 1121 5 759 464 5
759 659 5 759 759 5 759 759 5 759
759 5 759 284 6 759 464 6 759 561
6 759 759 6 759 759 6 759 759 6
759 
# 760
dialect of fortran cacm august 1963 pyle i c ca630838
jb march 13 1978 8 03 pm 760 5 760
760 5 760 760 5 760 
# 761
a note on the dangl els in algol 60 some
revis of algol 60 ar propos which not onli elimin
certain ambigu statement but also add some conveni to the
languag a discuss of the background of the problem and
a sketch of a proof that the ambigu have been
remov is includ cacm august 1963 kaup jr a f
ca630837 jb march 13 1978 8 06 pm 249 4
761 254 4 761 272 4 761 1086 4 761
1102 4 761 1109 4 761 1132 4 761 1140
4 761 1188 4 761 1234 4 761 1263 4
761 1265 4 761 1270 4 761 1306 4 761
1323 4 761 1358 4 761 1379 4 761 1380
4 761 1453 4 761 1464 4 761 1464 4
761 1484 4 761 1491 4 761 1491 4 761
1498 4 761 1613 4 761 1614 4 761 1767
4 761 1781 4 761 1781 4 761 1787 4
761 1825 4 761 1860 4 761 1949 4 761
321 4 761 2059 4 761 2083 4 761 2126
4 761 2178 4 761 2179 4 761 2252 4
761 2325 4 761 2341 4 761 2546 4 761
435 4 761 437 4 761 463 4 761 483
4 761 491 4 761 2645 4 761 2652 4
761 2684 4 761 2732 4 761 2842 4 761
2929 4 761 2934 4 761 560 4 761 583
4 761 3069 4 761 3073 4 761 627 4
761 631 4 761 632 4 761 642 4 761
644 4 761 653 4 761 669 4 761 679
4 761 680 4 761 691 4 761 761 4
761 761 4 761 761 4 761 762 4 761
763 4 761 123 4 761 140 4 761 919
4 761 949 4 761 989 4 761 989 4
761 196 5 761 947 5 761 1379 5 761
3184 5 761 761 5 761 761 5 761 761
5 761 1263 6 761 1477 6 761 3184 6
761 669 6 761 761 6 761 
# 762
some remark on the syntax of symbol program languag cacm
august 1963 diforino a c ca630836 jb march 13 1978
8 07 pm 249 4 762 254 4 762 272
4 762 1102 4 762 1102 4 762 1109 4
762 1140 4 762 1142 4 762 1188 4 762
1306 4 762 1425 4 762 1464 4 762 1491
4 762 1767 4 762 1781 4 762 1781 4
762 1781 4 762 1787 4 762 1945 4 762
1949 4 762 321 4 762 2059 4 762 2126
4 762 435 4 762 437 4 762 438 4
762 463 4 762 483 4 762 491 4 762
2732 4 762 560 4 762 583 4 762 3073
4 762 627 4 762 631 4 762 632 4
762 642 4 762 644 4 762 653 4 762
680 4 762 761 4 762 762 4 762 762
4 762 762 4 762 763 4 762 123 4
762 140 4 762 919 4 762 949 4 762
989 4 762 196 5 762 249 5 762 483
5 762 762 5 762 762 5 762 762 5
762 
# 763
a syntax control gener of formal languag processor cacm august
1963 eickel j bauer f l paul m samelson k
ca630835 jb march 13 1978 8 08 pm 249 4
763 254 4 763 267 4 763 272 4 763
1046 4 763 1102 4 763 1105 4 763 1109
4 763 1139 4 763 1139 4 763 1139 4
763 1140 4 763 1140 4 763 1141 4 763
1188 4 763 1215 4 763 1223 4 763 1234
4 763 1263 4 763 1265 4 763 1265 4
763 1306 4 763 1464 4 763 1491 4 763
1496 4 763 1647 4 763 1665 4 763 1767
4 763 1781 4 763 1781 4 763 1781 4
763 1787 4 763 1787 4 763 1792 4 763
1824 4 763 1949 4 763 321 4 763 364
4 763 2059 4 763 2126 4 763 2126 4
763 405 4 763 2546 4 763 435 4 763
437 4 763 438 4 763 463 4 763 464
4 763 483 4 763 491 4 763 2732 4
763 560 4 763 583 4 763 584 4 763
3073 4 763 627 4 763 631 4 763 631
4 763 632 4 763 642 4 763 644 4
763 653 4 763 653 4 763 680 4 763
680 4 763 761 4 763 762 4 763 763
4 763 763 4 763 763 4 763 763 4
763 763 4 763 795 4 763 799 4 763
123 4 763 140 4 763 919 4 763 945
4 763 989 4 763 196 5 763 1215 5
763 224 5 763 1781 5 763 1787 5 763
1945 5 763 2603 5 763 404 5 763 412
5 763 631 5 763 763 5 763 763 5
763 763 5 763 823 6 763 123 6 763
196 6 763 196 6 763 914 6 763 915
6 763 917 6 763 919 6 763 984 6
763 989 6 763 990 6 763 990 6 763
1007 6 763 1012 6 763 1025 6 763 1046
6 763 1084 6 763 1098 6 763 1122 6
763 1131 6 763 1138 6 763 1139 6 763
1139 6 763 1140 6 763 1141 6 763 1141
6 763 1149 6 763 1198 6 763 1200 6
763 1215 6 763 1215 6 763 1223 6 763
1223 6 763 1265 6 763 1265 6 763 1303
6 763 1323 6 763 1336 6 763 1358 6
763 1366 6 763 1396 6 763 1421 6 763
1455 6 763 1460 6 763 1462 6 763 1463
6 763 1467 6 763 1468 6 763 1477 6
763 1477 6 763 1487 6 763 1491 6 763
1491 6 763 1491 6 763 1491 6 763 1496
6 763 1496 6 763 1496 6 763 1531 6
763 1535 6 763 1565 6 763 1601 6 763
1602 6 763 1613 6 763 1614 6 763 1626
6 763 1641 6 763 1781 6 763 1787 6
763 1788 6 763 205 6 763 224 6 763
224 6 763 224 6 763 249 6 763 288
6 763 316 6 763 381 6 763 398 6
763 11 6 763 404 6 763 410 6 763
463 6 763 464 6 763 483 6 763 483
6 763 3184 6 763 3188 6 763 584 6
763 584 6 763 600 6 763 669 6 763
680 6 763 680 6 763 691 6 763 763
6 763 763 6 763 763 6 763 763 6
763 763 6 763 799 6 763 799 6 763
# 764
reduct of a matrix contain polynomi element algorithm 170 cacm
august 1963 hennion p e ca630834 jb march 13 1978
8 09 pm 764 5 764 764 5 764 764
5 764 
# 765
orthogon polynomi least squar surfac fit algorithm 164 cacm august
1963 bitterli c v ca630833 jb march 13 1978 8
10 pm 765 5 765 765 5 765 765 5
765 
# 766
xy move plot algorithm 162 cacm august 1963 fletcher w
e ca630832 jb march 13 1978 8 12 pm 766
5 766 766 5 766 766 5 766 
# 767
certif of algorithm 161 combinatori of m thing taken on
at a time two at a time up to n
at a time m l wolfson and h v wright
comm acm apr 1963 cacm august 1963 thoro d ca630831
jb march 13 1978 8 13 pm 767 5 767
767 5 767 767 5 767 
# 768
certif of algorithm 160 combinatori of m thing taken n
at a time m l wolfson and h v wright
comm acm apr 1963 cacm august 1963 thoro d ca630830
jb march 13 1978 8 14 pm 768 5 768
768 5 768 768 5 768 
# 769
algebra of set algorithm 156 cacm august 1963 bosworth k
m ca630829 jb march 13 1978 8 15 pm 769
5 769 769 5 769 769 5 769 
# 770
combin in ani order algorithm 155 cacm august 1963 bosworth
k m ca630828 jb march 13 1978 8 17 pm
770 5 770 770 5 770 770 5 770 
# 771
combin in lexicograph order algorithm 154 cacm august 1963 bosworth
k m ca630827 jb march 13 1978 8 18 pm
771 5 771 771 5 771 771 5 771 
# 772
gomori algorithm 153 cacm august 1963 lefkowitz b d esopo
d a ca630826 jb march 13 1978 8 19 pm
772 5 772 772 5 772 772 5 772 
# 773
matrix invers algorithm 140 cacm august 1963 georg r ca630825
jb march 13 1978 8 20 pm 2061 5 773
773 5 773 773 5 773 773 5 773 1140
6 773 1141 6 773 1477 6 773 1491 6
773 1825 6 773 773 6 773 
# 774
jacobi algorithm 85 cacm august 1963 naur p ca630824 jb
march 13 1978 8 21 pm 2349 5 774 774
5 774 774 5 774 774 5 774 1648 6
774 1716 6 774 1794 6 774 1894 6 774
2043 6 774 501 6 774 613 6 774 774
6 774 
# 775
interpol differenti and integr algorithm 77 cacm august 1963 hennion
p e ca630823 jb march 13 1978 8 22 pm
775 5 775 775 5 775 775 5 775 
# 776
partit quicksort and find algorithm 62 64 65 cacm august
1963 randel b russel l j ca630822 jb march 13
1978 8 23 pm 3054 5 776 776 5 776
776 5 776 776 5 776 1175 6 776 1880
6 776 1919 6 776 1969 6 776 1980 6
776 1997 6 776 307 6 776 308 6 776
309 6 776 2017 6 776 2679 6 776 776
6 776 
# 777
a set of test matric algorithm 52 cacm august 1963
naur p ca630821 jb march 13 1978 8 24 pm
777 5 777 777 5 777 777 5 777 
# 778
associ legendr function of the first kind for real or
imaginari argument algorithm 47 cacm august 1963 georg r ca630820
jb march 13 1978 8 26 pm 1818 5 778
778 5 778 778 5 778 778 5 778 778
6 778 
# 779
crout ii algorithm 43 cacm august 1963 domingo c rodriguez
gil f ca630819 jb march 13 1978 8 27 pm
779 5 779 779 5 779 779 5 779 
# 780
algorithm 42 invert alg 107 gauss s method alg 120
invers ii and gjr cacm august 1963 naur p ca630818
jb march 13 1978 8 29 pm 780 5 780
780 5 780 780 5 780 
# 781
telescop 2 algorithm 38 cacm august 1963 bridg j f
ca630817 jb march 13 1978 8 30 pm 781 5
781 781 5 781 781 5 781 
# 782
telescop 1 algorithm 37 cacm august 1963 bridg j f
ca630816 jb march 13 1978 8 31 pm 782 5
782 782 5 782 782 5 782 
# 783
shellsort algorithm 201 cacm august 1963 boothroyd j ca630815 jb
march 13 1978 8 32 pm 2679 5 783 783
5 783 783 5 783 783 5 783 970 6
783 1175 6 783 1190 6 783 1228 6 783
1969 6 783 1997 6 783 308 6 783 2042
6 783 3187 6 783 507 6 783 716 6
783 783 6 783 
# 784
normal random algorithm 200 cacm august 1963 georg r ca630814
jb march 13 1978 8 33 pm 784 5 784
784 5 784 784 5 784 
# 785
convers between calendar date and julian dai number algorithm 199
cacm august 1963 tantzen r g ca630813 jb march 13
1978 8 34 pm 2269 5 785 3115 5 785
785 5 785 785 5 785 785 5 785 907
6 785 2045 6 785 2417 6 785 2466 6
785 2884 6 785 579 6 785 785 6 785
785 6 785 
# 786
adapt integr and multipl integr algorithm 198 cacm august 1963
mckeeman w m ca630812 jb march 13 1978 8 35
pm 1352 5 786 2048 5 786 2074 5 786
786 5 786 786 5 786 786 5 786 834
6 786 834 6 786 834 6 786 872 6
786 872 6 786 1040 6 786 1092 6 786
1241 6 786 1273 6 786 324 6 786 429
6 786 429 6 786 429 6 786 570 6
786 621 6 786 786 6 786 786 6 786
786 6 786 
# 787
matrix divis algorithm 197 cacm august 1963 well m ca630811
jb march 13 1978 8 37 pm 787 5 787
787 5 787 787 5 787 
# 788
muller s method for find root of an arbitrari function
algorithm 196 cacm august 1963 roman r d ca630810 jb
march 13 1978 8 38 pm 788 5 788 788
5 788 788 5 788 
# 789
bandsolv algorithm 195 cacm august 1963 thurnau d h ca630809
jb march 13 1978 8 39 pm 789 5 789
789 5 789 789 5 789 
# 790
zersol algorithm 194 cacm august 1963 domingo c ca630808 jb
march 13 1978 8 40 pm 790 5 790 790
5 790 790 5 790 
# 791
charact manipul in 7090 fortran cacm august 1963 smith d
d ca630807 jb march 13 1978 8 41 pm 1084
5 791 791 5 791 791 5 791 791 5
791 868 6 791 603 6 791 644 6 791
669 6 791 791 6 791 797 6 791 
# 792
multipl precis binari to decim integ convers us onli addit
and subtract cacm august 1963 key d f moor d
p ca630806 jb march 13 1978 8 42 pm 792
5 792 792 5 792 792 5 792 
# 793
map list structur cacm august 1963 baecker h d ca630805
jb march 13 1978 8 43 pm 1050 4 793
1549 4 793 2723 4 793 2882 4 793 731
4 793 793 4 793 1051 5 793 627 5
793 793 5 793 793 5 793 793 5 793
210 6 793 378 6 793 406 6 793 731
6 793 793 6 793 794 6 793 
# 794
a list type storag techniqu for alphamer inform a method
which is econom in term of space and time is
propos for the storag and manipul of charact string of
arbitrari length in a fix word length comput the method
is illustr in an applic to algol type identifi in
an algol like block structur cacm august 1963 bowlden h
j ca630804 jb march 13 1978 8 45 pm 794
4 794 1051 5 794 1062 5 794 254 5
794 794 5 794 794 5 794 794 5 794
210 6 794 378 6 794 406 6 794 464
6 794 731 6 794 793 6 794 794 6
794 794 6 794 
# 795
debug system at the sourc languag level cacm august 1963
ferguson h e berner e ca630803 jb march 13 1978
8 46 pm 1046 4 795 1105 4 795 1139
4 795 1140 4 795 1234 4 795 1263 4
795 1265 4 795 1496 4 795 1781 4 795
1824 4 795 2126 4 795 2546 4 795 464
4 795 2616 4 795 584 4 795 631 4
795 653 4 795 680 4 795 763 4 795
795 4 795 795 4 795 799 4 795 945
4 795 931 5 795 404 5 795 795 5
795 795 5 795 795 5 795 
# 796
sabrag a time share low cost comput the serial sabrac
comput design and built in the scientif depart of the
israel defens ministri ha a 5000 locat magnet drum main
store to avoid a need to resort to optimum program
techniqu and to increas it overal effici the comput ha
also been given a 224 word ferrit core store from
which the program is obei transfer between the core and
drum store and to and from the twin paper tape
input and output channel ar all avail autonom concurr time
share multipl and divis order ar also autonom so that
the machin mai be execut up to three order simultan
all function natur ar interlock a number of other advanc
order and facil ar also incorporatedn particular an execut order
permit a temporari jump for up to four order and
a second modifi regist permit doubl modif in gener and
rel address of subroutin in particular thu the overal effect
speed of the machin is muchhigh than it basic specif
would lead on to expect and it design indic on
wai in which the concept of time share mai be
incorpor in low cost comput cacm august 1963 lehman m
netter z esh r ca630802 jb march 13 1978 8
54 pm 3193 4 796 796 4 796 491 5
796 796 5 796 796 5 796 796 5 796
# 797
american standard code for inform interchang cacm august 1963 ca630801
jb march 13 1978 8 55 pm 1084 5 797
797 5 797 797 5 797 797 5 797 868
6 797 603 6 797 644 6 797 669 6
797 791 6 797 797 6 797 
# 798
a catalogu entri retriev system scheff b h cacm juli
1963 ca630726 jb march 14 1978 8 08 am 1050
4 798 1102 4 798 378 4 798 3008 4
798 731 4 798 798 4 798 209 5 798
798 5 798 798 5 798 798 5 798 
# 799
design of a separ transit diagram compil a cobol compil
design is present which is compact enough to permit rapid
on pass compil of a larg subset of cobol on
a moder larg comput version of the same compil for
smaller machin requir onli two work tape plu a compil
tape the method given ar larg applic to the construct
of algol compil cacm juli 1963 conwai m e ca630725
jb march 14 1978 8 11 am 222 4 799
1046 4 799 1105 4 799 1139 4 799 1139
4 799 1140 4 799 1234 4 799 1263 4
799 1265 4 799 1496 4 799 1781 4 799
1824 4 799 1947 4 799 2126 4 799 2546
4 799 464 4 799 556 4 799 584 4
799 631 4 799 653 4 799 680 4 799
763 4 799 795 4 799 799 4 799 799
4 799 799 4 799 799 4 799 945 4
799 945 5 799 1323 5 799 1358 5 799
1380 5 799 1665 5 799 1781 5 799 1787
5 799 1989 5 799 399 5 799 2112 5
799 2534 5 799 2541 5 799 2698 5 799
2733 5 799 2820 5 799 404 5 799 82
5 799 3073 5 799 3155 5 799 799 5
799 799 5 799 799 5 799 830 6 799
123 6 799 196 6 799 196 6 799 196
6 799 919 6 799 990 6 799 1007 6
799 1046 6 799 1131 6 799 1139 6 799
1140 6 799 1141 6 799 1149 6 799 1198
6 799 1215 6 799 1215 6 799 1223 6
799 1265 6 799 1303 6 799 1323 6 799
1358 6 799 1366 6 799 1421 6 799 1421
6 799 1460 6 799 1460 6 799 1462 6
799 1463 6 799 1467 6 799 1468 6 799
1477 6 799 1477 6 799 1491 6 799 1491
6 799 1491 6 799 1496 6 799 1496 6
799 1531 6 799 1535 6 799 1565 6 799
1601 6 799 1602 6 799 1613 6 799 1614
6 799 1626 6 799 1641 6 799 1781 6
799 1781 6 799 1781 6 799 1781 6 799
1787 6 799 1787 6 799 1788 6 799 205
6 799 205 6 799 224 6 799 224 6
799 249 6 799 267 6 799 288 6 799
1959 6 799 1973 6 799 316 6 799 378
6 799 381 6 799 398 6 799 2110 6
799 2110 6 799 2111 6 799 11 6 799
2179 6 799 2182 6 799 2204 6 799 2247
6 799 2423 6 799 2534 6 799 2556 6
799 2732 6 799 2786 6 799 404 6 799
410 6 799 463 6 799 464 6 799 483
6 799 3073 6 799 3184 6 799 3184 6
799 3184 6 799 3184 6 799 3186 6 799
3188 6 799 584 6 799 600 6 799 631
6 799 680 6 799 680 6 799 691 6
799 729 6 799 731 6 799 763 6 799
763 6 799 799 6 799 799 6 799 799
6 799 799 6 799 799 6 799 799 6
799 799 6 799 799 6 799 799 6 799
799 6 799 799 6 799 799 6 799 799
6 799 799 6 799 799 6 799 
# 800
the link segment subprogram languag and link loader cacm juli
1963 mccarthi j corbato f j daggett m m ca630724
jb march 14 1978 8 13 am 1471 5 800
1774 5 800 800 5 800 800 5 800 800
5 800 800 6 800 800 6 800 1173 6
800 271 6 800 276 6 800 
# 801
least squar solut with constraint algorithm 177 cacm juli 1963
syng m j ca630723 jb march 14 1978 8 14
am 801 5 801 801 5 801 801 5 801
# 802
syminv2 algorithm 150 cacm juli 1963 rutishaus h ca630722jb march
14 1978 8 15 am 802 5 802 802 5
802 802 5 802 
# 803
syminv2 algorithm 150 cacm juli 1963 evan jr a ca630721
jb march 14 1978 8 16 am 803 5 803
803 5 803 803 5 803 
# 804
exponenti of seri algorithm 134 cacm juli 1963 thacher jr
h c ca630720 jb march 14 1978 8 19 am
804 5 804 804 5 804 804 5 804 
# 805
newton maehli algorithm 105 cacm juli 1963 kondo j ca630719
jb march 14 1978 8 20 am 805 5 805
805 5 805 805 5 805 
# 806
remark on certif of matrix invers procedur cacm juli 1963
moler c ca630718 jb march 14 1978 8 21 am
1177 4 806 806 4 806 806 4 806 932
5 806 454 5 806 806 5 806 806 5
806 806 5 806 
# 807
revers of seri algorithm 193 cacm juli 1963 fetti h
e ca630717 jb march 14 1978 8 22 am 807
5 807 807 5 807 807 5 807 
# 808
confluent hypergeometr algorithm 192 cacm juli 1963 relph a p
ca630716 jb march 14 1978 8 29 am 808 5
808 808 5 808 808 5 808 
# 809
hypergeometr algorithm 191 cacm juli 1963 relph a p ca630715
jb march 14 1978 8 30 am 809 5 809
809 5 809 809 5 809 
# 810
complex power algorithm 190 cacm juli 1963 relph a p
ca630714 jb march 14 1978 8 32 am 810 5
810 810 5 810 810 5 810 
# 811
smooth 2 algorithm 189 cacm juli 1963 rodriguez gil f
ca630713 jb march 14 1978 8 33 am 811 5
811 811 5 811 811 5 811 
# 812
smooth 1 algorithm 188 cacm juli 1963 rodriguez gil f
ca630712 jb march 14 1978 8 34 am 812 5
812 812 5 812 812 5 812 
# 813
differ and deriv algorithm 187 cacm juli 1963 vand riet
r p ca630711 jb march 14 1978 8 35 am
813 5 813 813 5 813 813 5 813 
# 814
complex arithmet algorithm 186 cacm juli 1963 vand riet r
p ca630710 jb march 14 1978 8 36 am 814
5 814 814 5 814 814 5 814 
# 815
normal probabl for curv fit algorithm 185 cacm juli 1963
colker a ca630709 jb march 14 1978 8 38 am
815 5 815 815 5 815 815 5 815 
# 816
erlang probabl for curv fit algorithm 184 cacm juli 1963
colker a ca630708 jb march 14 1978 8 39 am
816 5 816 816 5 816 816 5 816 
# 817
nexcom algorithm 152 cacm juli 1963 hoplei j ca630707 jb
march 14 1978 8 40 am 817 5 817 817
5 817 817 5 817 
# 818
realiz boolean connect on the ibm 1620 cacm juli 1963
hellerman h senzig d n ca630706 jb march 14 1978
8 44 am 818 5 818 818 5 818 818
5 818 
# 819
polynomi evalu revis cacm juli 1963 eisman s h ca630705
jb march 14 1978 8 46 am 1620 4 819
819 4 819 1620 5 819 436 5 819 819
5 819 819 5 819 819 5 819 819 6
819 436 6 819 
# 820
check for loop in network cacm juli 1963 gordon r
m ca630704 jb march 14 1978 8 47 am 820
5 820 820 5 820 820 5 820 
# 821
further remark on sampl a tape file iii cacm juli
1963 juelich o c ca630703 jb march 14 1978 8
48 am 821 5 821 821 5 821 821 5
821 
# 822
real time program specif problem in the implement of larg
real time applic ar treat and suggest guidelin for both
program and file specif ar develop the problem delin also
occur in system program cacm juli 1963 head r v
ca630702 jb march 14 1978 8 50 am 822 5
822 822 5 822 822 5 822 
# 823
a syntact descript of bc nelliac cacm juli 1963 huskei
h d love r wirth n ca630701 jb march 14
1978 8 51 am 1945 5 823 2126 5 823
691 5 823 823 5 823 823 5 823 823
5 823 823 6 823 823 6 823 823 6
823 196 6 823 914 6 823 915 6 823
917 6 823 984 6 823 989 6 823 990
6 823 1012 6 823 1084 6 823 1098 6
823 1122 6 823 1138 6 823 1139 6 823
1141 6 823 1200 6 823 1223 6 823 1265
6 823 1336 6 823 1396 6 823 1455 6
823 1477 6 823 1487 6 823 1491 6 823
1496 6 823 1614 6 823 1693 6 823 404
6 823 483 6 823 3184 6 823 584 6
823 669 6 823 680 6 823 763 6 823
# 824
descriptran autom descript geometri descript geometri consist of procedur origin
design to solv 3 space geometri problem by graphic construct
and measur instead of by comput howev in addit to
thi it unifi and simplifi the approach to mani such
problem when on can call subroutin that comput new coordin
that correspond to those obtain from the graphic construct there
is the three wai advantag of the approach of descript
geometri the accuraci of comput and the speed of the
digit comput descriptran make it possibl to program mani problem
in 3 space with a few statement it consist of
15 subroutin analog to the procedur of descript geometri cacm
june 1963 kliphardt r a ca630625 jb march 14 1978
9 56 am 824 5 824 824 5 824 824
5 824 
# 825
pip a photo interpret program for the analysi of spark
chamber data an oper comput program that process photograph record
data is describ the input to the program consist of
spark chamber photograph on which track of high energi particl
ar record the program automat scan measur and perform the
preliminari interpret of these photograph in continu oper a process
rate of 5 000 photograph frame per hour is achiev
cacm june 1963 rudlo h deutsch m maril t ca630624
jb march 14 1978 9 59 am 825 5 825
825 5 825 825 5 825 
# 826
remark on fortran subroutin for time seri analysi cacm june
1963 bennett c m ca630623 jb march 14 1978 10
00 am 1118 4 826 826 4 826 948 4
826 942 5 826 1118 5 826 826 5 826
826 5 826 826 5 826 826 6 826 942
6 826 
# 827
disk file sort sort techniqu us an ibm 1401 with
a random access storag devic ar evalu cacm june 1963
schick t ca630622 jb march 14 1978 10 02 am
827 5 827 827 5 827 827 5 827 
# 828
incompress flow network calcul a gener method for the calcul
of flow and pressur in fluid flow network is present
the method is applic to comput us cacm june 1963
cantrel h n ca630621 jb march 14 1978 10 03
am 828 5 828 828 5 828 828 5 828
# 829
the extern languag klipa for the ural 2 digit comput
cacm june 1963 greniewski m turski w ca630620 jb march
14 1978 10 04 am 2905 5 829 829 5
829 829 5 829 829 5 829 829 6 829
# 830
corc the cornel comput languag cacm june 1963 conwai r
w maxwel w l ca630619 jb march 14 1978 10
06 am 1179 5 830 1288 5 830 1544 5
830 1646 5 830 2111 5 830 2534 5 830
2556 5 830 2650 5 830 830 5 830 830
5 830 830 5 830 830 6 830 830 6
830 830 6 830 830 6 830 830 6 830
830 6 830 830 6 830 830 6 830 987
6 830 1072 6 830 1112 6 830 1179 6
830 1592 6 830 1647 6 830 1787 6 830
1935 6 830 1936 6 830 1959 6 830 1973
6 830 2111 6 830 2111 6 830 2111 6
830 2182 6 830 408 6 830 576 6 830
619 6 830 680 6 830 680 6 830 799
6 830 
# 831
real error function erf algorithm 123 cacm june 1963 thacher
jr h c ca630618 jb march 14 1978 10 07
am 1583 5 831 831 5 831 831 5 831
831 5 831 831 6 831 967 6 831 1126
6 831 707 6 831 
# 832
curv fit with constraint algorithm 74 cacm june 1963 isoda
k ca630617 jb march 14 1978 10 08 am 832
5 832 832 5 832 832 5 832 
# 833
reduct of a symmetr bandmatrix to tripl diagon form cacm
june 1963 schwartz h r ca630616jb march 14 1978 10
09 am 833 5 833 833 5 833 833 5
833 
# 834
nonrecurs adapt integr algorithm 182 cacm june 1963 mckeeman w
m tesler l ca630615 jb march 14 1978 10 10
am 1352 5 834 2048 5 834 2074 5 834
2093 5 834 834 5 834 834 5 834 834
5 834 834 6 834 834 6 834 834 6
834 834 6 834 872 6 834 872 6 834
872 6 834 1040 6 834 1092 6 834 1092
6 834 1241 6 834 1273 6 834 1298 6
834 1573 6 834 324 6 834 429 6 834
429 6 834 429 6 834 429 6 834 570
6 834 621 6 834 786 6 834 786 6
834 786 6 834 
# 835
complementari error function larg x algorithm 181 cacm june 1963
thacher jr h c ca630614 jb march 14 1978 10
12 am 835 5 835 835 5 835 835 5
835 
# 836
error function larg x algorithm 180 cacm june 1963 thacher
jr h c ca630613 jb march 14 1978 10 13
am 1157 5 836 836 5 836 836 5 836
836 5 836 836 6 836 1081 6 836 485
6 836 714 6 836 
# 837
incomplet beta ratio algorithm 179 cacm june 1963 ludwig o
g ca630612 jb march 14 1978 10 15 am 837
5 837 837 5 837 837 5 837 
# 838
direct search algorithm 178 cacm june 1963 kaup jr a
f ca630611 jb march 14 1978 10 16 am 838
5 838 838 5 838 838 5 838 
# 839
least squar solut with constraint algorithm 177 cacm june 1963
syng m j ca630610 jb march 14 1978 10 17
am 839 5 839 839 5 839 839 5 839
# 840
least squar surfac fit algorithm 176 cacm june 1963 arthur
t d ca630609 jb march 14 1978 10 18 am
840 5 840 840 5 840 840 5 840 
# 841
shuttl sort algorithm 175 cacm june 1963 shaw c j
trimbl t n ca630608 jb march 14 1978 10 20
am 841 5 841 841 5 841 841 5 841
# 842
a posteriori bound on a zero of a polynomi algorithm
174 cacm june 1963 gibb a ca630607 jb march 14
1978 10 21 am 842 5 842 842 5 842
842 5 842 
# 843
assign algorithm 173 cacm june 1963 hajek o ca630606 jb
march 14 1978 10 22 am 843 5 843 843
5 843 843 5 843 
# 844
1410 fortran edit featur cacm june 1963 fedako j e
ca630605 jb march 14 1978 10 23 am 844 5
844 844 5 844 844 5 844 
# 845
anoth test matrix for determin and invers cacm june 1963
caffrei j ca630604 jb march 14 1978 10 24 am
845 5 845 845 5 845 845 5 845 
# 846
self invers convers tabl cacm june 1963 sanborn t g
ca630603 jb march 14 1978 10 25 am 846 5
846 846 5 846 846 5 846 
# 847
a penni match program the logic of a penni match
program written for the csx 1 is describ cacm june
1963 wall e brown r m ca630602 jb march 14
1978 10 27 am 847 5 847 847 5 847
847 5 847 
# 848
a note on rang transform for squar root and logarithm
there wa the germ of an idea in two previou
paper 1 2 which no on seem to have pick
up in almost five year for certain function it seem
desir to transform the argument to a short rang symmetr
about 10 1 will give exampl of thi usag for
the squar root and logarithm function for both binari and
decim machin cacm june 1963 bemer r w ca630601 jb
march 14 1978 10 41 am 848 4 848 848
4 848 26 5 848 35 5 848 848 5
848 848 5 848 848 5 848 
# 849
us of tree structur for process file in data process
problem file ar frequent us which must both be search
and alter binari search techniqu ar effici for search larg
file but the associ file organ is not readili adapt
to the file alter convers a chain file alloc permit
effici alter but cannot be search effici a file organ
into a tree like structur is discuss and it is
shown that such a file mai both be search and
alter with time proport to slog s n where n
is the number of file item and s is a
paramet of the tree it is also shown that optim
the valu of s lead to a search time which
is onli 25 per cent slower than the binari search
the tree organ emploi two data chain and mai be
consid to be a compromis between the organ for the
binari search and the chain file the relat of the
tree organ to multidimension index and to the trie structur
is also discuss cacm mai 1963 sussenguth jr e h
ca630518 jb march 14 1978 10 49 am 435 4
849 2846 4 849 849 4 849 849 4 849
944 4 849 155 5 849 1050 5 849 1935
5 849 1936 5 849 2017 5 849 2032 5
849 2257 5 849 2360 5 849 2451 5 849
2452 5 849 615 5 849 849 5 849 849
5 849 849 5 849 849 6 849 849 6
849 849 6 849 849 6 849 849 6 849
849 6 849 849 6 849 849 6 849 849
6 849 850 6 849 851 6 849 852 6
849 853 6 849 854 6 849 855 6 849
856 6 849 857 6 849 858 6 849 859
6 849 860 6 849 861 6 849 862 6
849 863 6 849 864 6 849 865 6 849
866 6 849 106 6 849 944 6 849 1115
6 849 1785 6 849 209 6 849 1831 6
849 1831 6 849 1935 6 849 1936 6 849
1936 6 849 1936 6 849 1936 6 849 1976
6 849 367 6 849 2198 6 849 2360 6
849 627 6 849 
# 850
convers reconvers and comparison techniqu in variabl length sort the
logic is describ for convert highli variabl input record into
a format that can be easili and effici process by
a sort program the intern record format ar discuss in
relat to 1 their convers from input format 2 their
reconvers to output format and 3 comparison techniqu between intern
format cacm mai 1963 wak d j ca630517 jb march
14 1978 10 52 am 2017 5 850 850 5
850 850 5 850 850 5 850 849 6 850
850 6 850 851 6 850 852 6 850 853
6 850 854 6 850 855 6 850 856 6
850 857 6 850 858 6 850 859 6 850
860 6 850 861 6 850 862 6 850 863
6 850 864 6 850 865 6 850 866 6
850 
# 851
design and characterist of a variabl length record sort us
new fix length record sort techniqu thi paper describ the
applic of sever new techniqu for sort fix length record
to the problem of variabl length record sort the techniqu
have been implement on a sylvania 9400 comput system with
32 000 fix length word of memori specif the techniqu
sequenc variabl length record of unrestrict size produc long initi
string of data merg string of data at the power
of t 1 where t is the number of work
tape in a system and do not restrict the volum
of input data cacm mai 1963 goetz m a ca630516
jb march 14 1978 10 57 am 2017 4 851
2017 4 851 851 4 851 851 4 851 2017
5 851 851 5 851 851 5 851 851 5
851 858 5 851 865 5 851 849 6 851
850 6 851 851 6 851 852 6 851 853
6 851 854 6 851 855 6 851 856 6
851 857 6 851 858 6 851 859 6 851
860 6 851 861 6 851 862 6 851 863
6 851 864 6 851 865 6 851 866 6
851 
# 852
a method of compar the time requir of sort method
cacm mai 1963 hall m h ca630515 jb march 14
1978 10 58 am 1919 4 852 852 4 852
852 4 852 864 4 852 864 4 852 865
4 852 232 5 852 2017 5 852 74 5
852 852 5 852 852 5 852 852 5 852
849 6 852 850 6 852 851 6 852 852
6 852 853 6 852 854 6 852 855 6
852 856 6 852 857 6 852 858 6 852
859 6 852 860 6 852 861 6 852 862
6 852 863 6 852 864 6 852 865 6
852 866 6 852 
# 853
the cobol sort verb cacm mai 1963 paterson j b
ca630514 jb march 14 1978 10 59 am 2017 5
853 853 5 853 853 5 853 853 5 853
849 6 853 850 6 853 851 6 853 852
6 853 853 6 853 854 6 853 855 6
853 856 6 853 857 6 853 858 6 853
859 6 853 860 6 853 861 6 853 862
6 853 863 6 853 864 6 853 865 6
853 866 6 853 
# 854
some characterist of sort in comput system us random access
storag devic the substanti differ in characterist of random access
storag and tape devic dictat that concept and object of
comput program design be consid from the viewpoint of the
extern file medium us thi is particularli true in the
case of sort in a tape orient system the major
sort problem is that of minim merg time despit the
limit order of merg possibl in contrast sort in a
random access orient system encourag the select of the optimum
order of merg from mani possibl order the latter problem
is discuss in thi paper along with criteria develop for
determin the optimum order of merg accord to the variou
properti of random access storag devic attent is also given
to the problem of kei sort versu record sort and
the possibl seriou disadvantag of kei sort on a random
access system cacm mai 1963 hubbard g u ca630513 jb
march 14 1978 11 05 am 1956 5 854 2017
5 854 854 5 854 854 5 854 854 5
854 849 6 854 850 6 854 851 6 854
852 6 854 853 6 854 854 6 854 854
6 854 855 6 854 856 6 854 857 6
854 858 6 854 859 6 854 860 6 854
861 6 854 862 6 854 863 6 854 864
6 854 865 6 854 866 6 854 
# 855
organ and structur of dataon disk file memori system for
effici sort and other data process program an approach to
the organ and structur of data on bryant disc file
memori system for sort and perform other data process function
is present the follow area ar cover characterist of bryant
disc file system on the bendix g 20 and rca
301 two propos chain structur for data and function of
a disk file execut routin the concept for sort and
perform file mainten process us the propos structur and execut
routin ar discuss addition it is shown that sort can
be accomplish without the us of disk storag work area
cacm mai 1963 goetz m a ca630512 jb march 14
1978 11 10 am 2017 5 855 855 5 855
855 5 855 855 5 855 849 6 855 850
6 855 851 6 855 852 6 855 853 6
855 854 6 855 855 6 855 856 6 855
857 6 855 858 6 855 859 6 855 860
6 855 861 6 855 862 6 855 863 6
855 864 6 855 865 6 855 866 6 855
# 856
sort with larg volum random access drum storag an approach
to sort record is describ us random access drum memori
the sort program describ is design to be a gener
self gener sort applic to a varieti of record statement
thi descript is divid into three part the first part
present the oper environ the second defin the gener solut
the third part describ the intern sort merg techniqu cacm
mai 1963 falkin j savastano jr s ca630511 jb march
14 1978 11 14 am 2017 5 856 856 5
856 856 5 856 856 5 856 849 6 856
850 6 856 851 6 856 852 6 856 853
6 856 854 6 856 855 6 856 856 6
856 857 6 856 858 6 856 859 6 856
860 6 856 861 6 856 862 6 856 863
6 856 864 6 856 865 6 856 866 6
856 
# 857
sort nonredund file techniqu us in the fact compil some
typic file structur includ some call non redund ar examin
and the method us in fact to sort such file
ar discuss cacm mai 1963 glore j b ca630510 jb
march 14 1978 11 16 am 2017 5 857 857
5 857 857 5 857 857 5 857 849 6
857 850 6 857 851 6 857 852 6 857
853 6 857 854 6 857 855 6 857 856
6 857 857 6 857 858 6 857 859 6
857 860 6 857 861 6 857 862 6 857
863 6 857 864 6 857 865 6 857 866
6 857 
# 858
a tape file merg pattern gener a routin is present
which specifi the sequenc of merg cycl to effect the
merg of sort tape file the routin is design to
minim elaps comput time by vari the power of the
merg cycl so as to us all the avail tape
drive with it characterist of assign on drive to a
singl reel file and two drive to each multipl reel
file cacm mai 1963 cook w s ca630509 jb march
14 1978 11 21 am 2017 5 858 851 5
858 858 5 858 858 5 858 858 5 858
849 6 858 850 6 858 851 6 858 852
6 858 853 6 858 854 6 858 855 6
858 856 6 858 857 6 858 858 6 858
858 6 858 859 6 858 860 6 858 861
6 858 862 6 858 863 6 858 864 6
858 865 6 858 865 6 858 866 6 858
# 859
comput plan collat cacm mai 1963 french n ca630508 jb
march 14 1978 11 22 am 2017 5 859 859
5 859 859 5 859 859 5 859 849 6
859 850 6 859 851 6 859 852 6 859
853 6 859 854 6 859 855 6 859 856
6 859 857 6 859 858 6 859 859 6
859 860 6 859 861 6 859 862 6 859
863 6 859 864 6 859 865 6 859 866
6 859 
# 860
a comparison between the polyphas and oscil sort techniqu a
comparison between the oscil and polyphas sort techniqu is develop
for comput system have from four to ten tape drive
the basi for the comparison is the total read and
write requir for variou number of input string and tape
drive for the two techniqu cacm mai 1963 goetz m
a toth g s ca630507 jb march 14 1978 11
25 am 1117 4 860 2017 4 860 2146 4
860 677 4 860 860 4 860 860 4 860
862 4 860 2017 5 860 479 5 860 860
5 860 860 5 860 860 5 860 861 5
860 849 6 860 850 6 860 851 6 860
852 6 860 853 6 860 854 6 860 855
6 860 856 6 860 857 6 860 858 6
860 859 6 860 860 6 860 861 6 860
862 6 860 863 6 860 864 6 860 865
6 860 866 6 860 
# 861
read backward polyphas sort read backward polyphas sort provid more
effici us of the tape avail to a sort than
most other sort techniqu backward polyphas produc a continu merg
process from n 1 tape where n is the total
number of tape be us in the sort process ani
of the avail presort techniqu mai be us in conjunct
with the polyphas merg sort provid that the presort ha
the capabl of produc both ascend and descend string and
distribut the string on the variou tape as requir by
the polyphas merg cacm mai 1963 gilstad r l ca630506
jb march 14 1978 11 28 am 1117 4 861
2017 4 861 2146 4 861 861 4 861 1117
5 861 2017 5 861 2146 5 861 677 5
861 860 5 861 862 5 861 861 5 861
861 5 861 861 5 861 849 6 861 850
6 861 851 6 861 852 6 861 853 6
861 854 6 861 855 6 861 856 6 861
857 6 861 858 6 861 859 6 861 860
6 861 861 6 861 861 6 861 861 6
861 861 6 861 861 6 861 862 6 861
862 6 861 862 6 861 863 6 861 863
6 861 864 6 861 865 6 861 866 6
861 299 6 861 479 6 861 636 6 861
# 862
string distribut for the polyphas sort cacm mai 1963 malcolm
jr w d ca630505 jb march 14 1978 11 29
am 2146 4 862 479 4 862 860 4 862
862 4 862 862 4 862 863 4 862 1117
5 862 299 5 862 2017 5 862 2146 5
862 479 5 862 862 5 862 862 5 862
862 5 862 861 5 862 849 6 862 850
6 862 851 6 862 852 6 862 853 6
862 854 6 862 855 6 862 856 6 862
857 6 862 858 6 862 859 6 862 860
6 862 861 6 862 861 6 862 861 6
862 862 6 862 862 6 862 862 6 862
862 6 862 863 6 862 863 6 862 864
6 862 865 6 862 866 6 862 299 6
862 636 6 862 
# 863
multiphas sort cacm mai 1963 manker h h ca630504 jb
march 14 1978 11 30 am 2146 4 863 479
4 863 862 4 863 863 4 863 299 5
863 2017 5 863 2146 5 863 863 5 863
863 5 863 863 5 863 849 6 863 850
6 863 851 6 863 852 6 863 853 6
863 854 6 863 855 6 863 856 6 863
857 6 863 858 6 863 859 6 863 860
6 863 861 6 863 861 6 863 862 6
863 862 6 863 863 6 863 863 6 863
864 6 863 865 6 863 866 6 863 299
6 863 
# 864
an empir studi of minim storag sort cacm mai 1963
hibbard t n ca630503 jb march 14 1978 11 31
am 1919 4 864 1919 4 864 2191 4 864
2388 4 864 2783 4 864 2784 4 864 3054
4 864 3121 4 864 852 4 864 852 4
864 864 4 864 864 4 864 864 4 864
865 4 864 1175 5 864 232 5 864 1919
5 864 309 5 864 2017 5 864 2041 5
864 2216 5 864 74 5 864 864 5 864
864 5 864 864 5 864 849 6 864 850
6 864 851 6 864 852 6 864 853 6
864 854 6 864 855 6 864 856 6 864
857 6 864 858 6 864 859 6 864 860
6 864 861 6 864 862 6 864 863 6
864 864 6 864 864 6 864 864 6 864
864 6 864 864 6 864 865 6 864 866
6 864 1175 6 864 1919 6 864 1969 6
864 1997 6 864 308 6 864 308 6 864
309 6 864 74 6 864 3187 6 864 
# 865
intern and tape sort us the replac select techniqu a
gener techniqu for sequenc unsort record is present the techniqu
is shown to be applic for the first stage of
a gener sort program the format of initi string as
well as for sort record within a memori storag an
intern sort it is shown that given n record in
memori storag record ar sequenc us 1 log2 n test
per record that initi string length will averag 2n for
random input record and that read write and process can
be accomplish simultan if the comput permit such overlap cacm
mai 1963 goetz m a ca630502 jb march 14 1978
11 36 am 1919 4 865 852 4 865 864
4 865 865 4 865 2017 5 865 74 5
865 851 5 865 865 5 865 865 5 865
865 5 865 849 6 865 850 6 865 851
6 865 852 6 865 853 6 865 854 6
865 855 6 865 856 6 865 857 6 865
858 6 865 858 6 865 859 6 865 860
6 865 861 6 865 862 6 865 863 6
865 864 6 865 865 6 865 865 6 865
866 6 865 
# 866
sort on comput cacm mai 1963 gotlieb c c ca630501
jb march 14 1978 11 37 am 2017 5 866
866 5 866 866 5 866 866 5 866 849
6 866 850 6 866 851 6 866 852 6
866 853 6 866 854 6 866 855 6 866
856 6 866 857 6 866 858 6 866 859
6 866 860 6 866 861 6 866 862 6
866 863 6 866 864 6 866 865 6 866
866 6 866 
# 867
least squar fit of plane to surfac us dynam program
dynam program ha recent been us by stone by bellman
and by gluss to determin the closet fit of broken
line segment to a curv in an interv under the
constraint that the number of segment is fix in the
present paper success model ar develop to extend the method
to the fit of broken plane segment to surfac z
g x y defin over certain type of subarea of
the x y space the first model consid a rectangular
area with the constraint that the plane segment ar defin
over a grid in the x y space it is
then shown how thi model mai be incorpor into an
algorithm that provid success approxim to optim fit for ani
type of close area final applic ar briefli describ cacm
april 1963 gluss b ca630424 jb march 14 1978 11
43 am 497 4 867 867 4 867 867 4
867 317 5 867 497 5 867 867 5 867
867 5 867 867 5 867 
# 868
a suggest method of make fuller us of string in
algol 60 cacm april 1963 shoffner m g brown p
j ca630423 jb march 14 1978 11 45 am 1084
5 868 868 5 868 868 5 868 868 5
868 868 6 868 603 6 868 644 6 868
669 6 868 791 6 868 797 6 868 
# 869
term of magic squar algorithm 148 cacm april 1963 thoro
d ca630422 jb march 14 1978 11 46 am 869
5 869 869 5 869 869 5 869 
# 870
term of magic squar algorithm 148 cacm april 1963 barnecut
j n r ca630421 jb march 14 1978 11 47
am 870 5 870 870 5 870 870 5 870
# 871
psif algorithm 147 cacm april 1963 thacher jr h c
ca630420 jb march 14 1978 11 48 am 1800 5
871 871 5 871 871 5 871 871 5 871
871 6 871 
# 872
adapt numer integr by simpson s rule algorithm 145 cacm
april 1963 mckeeman w m ca630419 jb march 14 1978
11 49 am 1352 5 872 2074 5 872 2093
5 872 872 5 872 872 5 872 872 5
872 834 6 872 834 6 872 834 6 872
872 6 872 872 6 872 872 6 872 1040
6 872 1092 6 872 1092 6 872 1241 6
872 1273 6 872 1298 6 872 1573 6 872
324 6 872 429 6 872 429 6 872 429
6 872 570 6 872 621 6 872 786 6
872 786 6 872 
# 873
random algorithm 133 cacm april 1963 poor jr j h
ca630418 jb march 14 1978 11 50 am 873 5
873 873 5 873 873 5 873 
# 874
chebyshev curvefit algorithm 91 cacm april 1963 hale r p
ca630417 jb march 14 1978 11 56 am 874 5
874 874 5 874 874 5 874 
# 875
incomplet ellipt integr algorithm 73 cacm april 1963 van de
riet r p ca630416 jb march 14 1978 12 06
pm 875 5 875 875 5 875 875 5 875
# 876
complet ellipt integr algorithm 149 cacm april 1963 thacher h
c ca630415 jb march 14 1978 12 14 pm 876
5 876 876 5 876 876 5 876 
# 877
complet ellipt integr of the first kind algorithm 55 cacm
april 1963 thacher jr h c ca630414 jb march 14
1978 12 15 pm 877 5 877 877 5 877
877 5 877 
# 878
reduct of a matrix contain polynomi element algorithm 170 cacm
april 1963 hennion p e ca630413 jb march 14 1978
12 17 pm 1946 5 878 878 5 878 878
5 878 878 5 878 878 6 878 902 6
878 1093 6 878 1177 6 878 1387 6 878
1393 6 878 360 6 878 731 6 878 
# 879
newton interpol with forward divid differ algorithm 169 cacm april
1963 kahan w farka i ca630412 jb march 14 1978
12 18 pm 1524 5 879 879 5 879 879
5 879 879 5 879 879 6 879 1197 6
879 311 6 879 
# 880
newton interpol with backward divid differ cacm april 1963 kahan
w farka i ca630411 jb march 14 1978 12 20
pm 880 5 880 880 5 880 880 5 880
# 881
calcul of confluent divid differ algorithm 167 cacm april 1963
kahan w farka i ca630410 jb march 14 1978 12
21 pm 881 5 881 881 5 881 881 5
881 
# 882
mont carlo algorithm 166 cacm april 1963 rodman r d
ca630409 jb march 14 1978 12 22 pm 882 5
882 882 5 882 882 5 882 
# 883
complet ellipt integr algorithm 165 cacm april 1963 thacher jr
h c ca630408 jb march 14 1978 12 23 pm
883 5 883 883 5 883 883 5 883 
# 884
orthogon polynomi least squar surfac fit algorithm 164 cacm april
1963 clark r e kubik r n phillip l p
ca630407 jb march 14 1978 12 25 pm 884 5
884 884 5 884 884 5 884 
# 885
modifi hankel function algorithm 163 cacm april 1963 fetti h
e ca630406 jb march 14 1978 12 26 pm 1040
5 885 885 5 885 885 5 885 885 5
885 885 6 885 587 6 885 621 6 885
# 886
xy move plot algorithm 162 cacm april 1963 stockton f
g ca630405 jb march 14 1978 12 27 pm 886
5 886 886 5 886 886 5 886 
# 887
combinatori of m thing taken on at a time two
at a time up to n at a time algorithm
161 cacm april 1963 wright h v wolfson m l
ca630404 jb march 14 1978 12 28 pm 887 5
887 887 5 887 887 5 887 
# 888
algorithm 160 combinatori of m thing taken n at a
time cacm april 1963 wolfson m l wright h v
ca630403 jb march 14 1978 12 29 pm 2590 5
888 888 5 888 888 5 888 888 5 888
888 6 888 
# 889
offici action and respons to algol as a program languag
cacm april 1963 ca630402 jb march 14 1978 12 30
pm 889 5 889 889 5 889 889 5 889
# 890
select definit a select of the definit prepar by the
acm standard committe s subcommitte on program terminolog is present
for review by the acm membership cacm april 1963 fritz
w b ca630401 jb march 14 1978 12 32 pm
690 5 890 890 5 890 890 5 890 890
5 890 890 6 890 929 6 890 3195 6
890 
# 891
everyman s inform retriev system the inform retriev problem whose
solut is present here wa pose by a technic librari
with limit bubget and personnel the solut howev is quit
gener and is applic to mani differ type of retriev
problem further the method of solut make it possibl for
mani group who have previous dismiss an inform retriev program
as expens and difficult from a program stand point to
reconsid their posit for the present solut make it possibl
to instal an inform retriev program in less than three
month and with rel littl equip cacm march 1963 whitlei
v w ca630329 jb march 14 1978 12 37 pm
891 5 891 891 5 891 891 5 891 
# 892
recol a retriev command languag an interrog scheme is describ
for the retriev and manipul of data file record the
languag of the interrog scheme allow for select file record
with the ar of logic condit statement defin record class
associ file record edit print output and summar the result
of the abov oper some exampl of a typic file
applic and the more signific featur of a particular machin
implement ar given cacm march 1963 climenson w d ca630328
jb march 14 1978 12 42 pm 1309 4 892
1324 4 892 892 4 892 892 4 892 653
5 892 656 5 892 892 5 892 892 5
892 892 5 892 
# 893
signific arithmet on a digit comput the 7090 at nyu
ha been modifi to includ a signific mode of oper
which is intend to facilit the identif of signific bit
in the result of float point arithmet oper the manner
in which float point arithmet is handl in thi mode
is discuss sever numer experi us thi mode ar describ
and comparison ar made with the ordinari normal mode exampl
includ power seri evalu linear equat solut determin evalu and
matrix invers cacm march 1963 goldstein m ca630327 jb march
14 1978 12 47 pm 3131 5 893 893 5
893 893 5 893 893 5 893 893 6 893
1148 6 893 
# 894
an iter factor techniqu for polynomi an iter techniqu is
displai wherebi factor of arbitrari degre can be found for
polynomi in on variabl converg is shown to occur alwai
if a certain jacobian doe not vanish and if the
initi approxim to a factor is near enough to an
actual factor the process is simpli program and preliminari result
indic it to be well adapt to us with digit
comput for factor of degre two the techniqu is similar
to that of bairstow the present method be somewhat simpler
cacm march 1963 luther h a ca630326 jb march 14
1978 12 51 pm 1111 5 894 894 5 894
894 5 894 894 5 894 894 6 894 
# 895
a comput extens of the variat differ method present here
is a comput extens of the variat differ method as
develop by g tintner 1 cacm march 1963 scheinok p
a ca630325 jb march 14 1978 12 57 pm 895
5 895 895 5 895 895 5 895 
# 896
characterist valu and vector of defect matric cacm march 1963
thompson g t ca630324 jb march 14 1978 12 58
pm 896 5 896 896 5 896 896 5 896
# 897
note on the proof of the non exist of a
phrase structur grammar for algol 60 cacm march 1963 brown
p j ca630323 jb march 14 1978 1 00 pm
897 5 897 897 5 897 897 5 897 
# 898
random algorithm 133 cacm march 1963 laughlin d l ca630322
jb march 14 1978 1 01 pm 898 5 898
898 5 898 898 5 898 
# 899
magic squar algorithm 117 118 cacm march 1963 bosworth k
m ca630321 jb march 14 1978 1 02 pm 899
5 899 899 5 899 899 5 899 
# 900
ancestor algorithm 79 cacm march 1963 thacher jr h c
ca630320 jb march 14 1978 1 23 pm 900 5
900 900 5 900 900 5 900 
# 901
differ express coeffici algorithm 79 cacm march 1963 clark e
s ca630319 jb march 14 1978 1 24 pm 901
5 901 901 5 901 901 5 901 
# 902
determin algorithm 159 cacm march 1963 digbi d w ca630318
jb march 14 1978 1 28 pm 902 5 902
902 5 902 902 5 902 1946 5 902 878
6 902 902 6 902 1093 6 902 1177 6
902 1387 6 902 1393 6 902 360 6 902
731 6 902 
# 903
exponenti of seri algorithm 134 cacm march 1963 fetti h
e ca630317 jb march 14 1978 1 29 pm 903
5 903 903 5 903 903 5 903 
# 904
fourier seri approxim algorithm 157 cacm march 1963 mifsud c
j ca630316 jb march 14 1978 1 31 pm 904
5 904 904 5 904 904 5 904 
# 905
algebra of set algorithm 156 cacm march 1963 mifsud c
j ca630315 jb march 14 1978 1 32 pm 905
5 905 905 5 905 905 5 905 
# 906
combin in ani order algorithm 155 cacm march 1963 mifsud
c j ca630314 jb march 14 1978 1 33 pm
906 5 906 906 5 906 906 5 906 
# 907
combin in lexicograph order algorithm 154 cacm march 1963 mifsud
c j ca630313 jb march 14 1978 1 34 pm
907 5 907 907 5 907 907 5 907 3115
5 907 907 6 907 2045 6 907 2417 6
907 2466 6 907 2884 6 907 579 6 907
785 6 907 
# 908
test matrix for invers cacm march 1963 lasor w s
ca630312a jb march 14 1978 1 38 pm 908 5
908 908 5 908 908 5 908 
# 909
arithmet declar corrigendum cacm march 1963 conwai m e speroni
j ca630312b jb march 14 1978 1 40 pm 909
5 909 909 5 909 909 5 909 1963 5
909 909 6 909 475 6 909 750 6 909
# 910
select instruct trap for the 7090 cacm march 1963 mayer
r j ca630311 jb march 14 1978 1 41 pm
910 5 910 910 5 910 910 5 910 
# 911
a variant method of file search cacm march 1963 mcilroi
m d ca630310 jb march 14 1978 1 42 pm
1271 4 911 1785 4 911 1785 4 911 2203
4 911 2543 4 911 2552 4 911 2860 4
911 911 4 911 911 4 911 911 5 911
911 5 911 911 5 911 1785 5 911 332
5 911 2203 5 911 2552 5 911 492 5
911 911 6 911 911 6 911 911 6 911
1785 6 911 1785 6 911 1786 6 911 332
6 911 332 6 911 2107 6 911 2109 6
911 2203 6 911 492 6 911 492 6 911
# 912
address an arrai yi in k dimens by fortran for
analysi of varianc cacm march 1963 garber m j ca630309
jb march 14 1978 1 44 pm 912 5 912
912 5 912 912 5 912 1014 5 912 912
6 912 
# 913
neliac cacm march 1963 halstead m h ca630308 jb march
14 1978 1 45 pm 913 5 913 913 5
913 913 5 913 
# 914
jovial and it document cacm march 1963 shaw c j
ca630307 jb march 14 1978 1 46 pm 914 5
914 914 5 914 914 5 914 1945 5 914
823 6 914 914 6 914 915 6 914 917
6 914 984 6 914 989 6 914 990 6
914 1012 6 914 1084 6 914 1098 6 914
1122 6 914 1138 6 914 1139 6 914 1141
6 914 1200 6 914 1223 6 914 1265 6
914 1336 6 914 1396 6 914 1455 6 914
1477 6 914 1487 6 914 1491 6 914 1496
6 914 483 6 914 584 6 914 669 6
914 680 6 914 763 6 914 
# 915
document of ipl v cacm march 1963 newel a ca630306
jb march 14 1978 1 46 pm 915 5 915
915 5 915 915 5 915 1945 5 915 823
6 915 914 6 915 915 6 915 917 6
915 984 6 915 989 6 915 990 6 915
1012 6 915 1084 6 915 1098 6 915 1122
6 915 1138 6 915 1139 6 915 1141 6
915 1200 6 915 1223 6 915 1265 6 915
1336 6 915 1396 6 915 1455 6 915 1477
6 915 1487 6 915 1491 6 915 1496 6
915 483 6 915 584 6 915 669 6 915
680 6 915 763 6 915 
# 916
fortran cacm march 1963 heis w p ca630305 jb march
14 1978 1 47 pm 916 5 916 916 5
916 916 5 916 
# 917
comit cacm march 1963 yngve v h ca630304 jb march
14 1978 1 48 pm 917 5 917 917 5
917 917 5 917 1068 5 917 1945 5 917
823 6 917 914 6 917 915 6 917 917
6 917 917 6 917 984 6 917 989 6
917 990 6 917 1012 6 917 1084 6 917
1098 6 917 1122 6 917 1138 6 917 1139
6 917 1141 6 917 1200 6 917 1223 6
917 1265 6 917 1336 6 917 1396 6 917
1455 6 917 1477 6 917 1487 6 917 1491
6 917 1496 6 917 483 6 917 584 6
917 669 6 917 680 6 917 763 6 917
# 918
cobol cacm march 1963 cunningham j f ca630303 jb march
27 1978 9 22 pm 918 5 918 918 5
918 918 5 918 
# 919
document problem algol 60 cacm march 1963 naur p ca630302
jb march 14 1978 1 50 pm 249 4 919
254 4 919 272 4 919 1102 4 919 1109
4 919 1140 4 919 1188 4 919 1306 4
919 1464 4 919 1491 4 919 1767 4 919
1781 4 919 1787 4 919 1949 4 919 321
4 919 2059 4 919 2126 4 919 435 4
919 437 4 919 463 4 919 483 4 919
491 4 919 2732 4 919 560 4 919 583
4 919 3073 4 919 627 4 919 631 4
919 632 4 919 642 4 919 644 4 919
653 4 919 680 4 919 761 4 919 762
4 919 763 4 919 123 4 919 140 4
919 919 4 919 989 4 919 196 5 919
919 5 919 919 5 919 919 5 919 1781
5 919 123 6 919 196 6 919 919 6
919 990 6 919 1007 6 919 1046 6 919
1131 6 919 1139 6 919 1140 6 919 1149
6 919 1198 6 919 1215 6 919 1223 6
919 1265 6 919 1303 6 919 1323 6 919
1358 6 919 1366 6 919 1421 6 919 1460
6 919 1462 6 919 1463 6 919 1467 6
919 1468 6 919 1477 6 919 1491 6 919
1496 6 919 1531 6 919 1535 6 919 1565
6 919 1601 6 919 1602 6 919 1613 6
919 1614 6 919 1626 6 919 1641 6 919
1787 6 919 1788 6 919 205 6 919 224
6 919 249 6 919 288 6 919 316 6
919 381 6 919 398 6 919 11 6 919
404 6 919 410 6 919 463 6 919 464
6 919 483 6 919 3184 6 919 3188 6
919 584 6 919 600 6 919 680 6 919
691 6 919 763 6 919 799 6 919 
# 920
toward better document of program languag cacm march 1963 yngve
v h sammet j e ca630301 jb march 14 1978
1 51 pm 920 5 920 920 5 920 920
5 920 728 5 920 920 6 920 45 6
920 
# 921
incomplet ellipt integr algorithm 73 cacm februari 1963 meyer n
a ca630212 jb march 14 1978 2 03 pm 921
5 921 921 5 921 921 5 921 
# 922
multint algorithm 32 cacm februari 1963 thacher jr h c
ca630211jb march 14 1978 2 10 pm 922 5 922
922 5 922 922 5 922 
# 923
gomori algorithm 153 cacm februari 1963 bauer f l ca630210
jb march 14 1978 2 12 pm 923 5 923
923 5 923 923 5 923 
# 924
nexcom algorithm 152 cacm februari 1963 hoplei j ca630209 jb
march 14 1978 2 12 pm 924 5 924 924
5 924 924 5 924 
# 925
locat of a vector in a lexicograph order listalgorithm 151
cacm februari 1963 walter h f ca630208 jb march 14
1978 2 17 pm 925 5 925 925 5 925
925 5 925 
# 926
syminv2 algorithm 150 cacm februari 1963 rutishaus h ca630207 jb
march 14 1978 2 18 pm 926 5 926 926
5 926 926 5 926 
# 927
linear program appli to ultraviolet absorpt spectroscopi cacm februari 1963
white w c shapiro b pratt a w ca630206 jb
march 14 1978 2 19 pm 927 5 927 927
5 927 927 5 927 
# 928
charact manipul in fortran cacm februari 1963 lewi t s
ca630205 jb march 14 1978 2 20 pm 928 5
928 928 5 928 928 5 928 
# 929
glossari construct cacm februari 1963 grem m ca630204 jb march
14 1978 2 21 pm 929 4 929 929 5
929 929 5 929 929 5 929 397 5 929
690 5 929 890 6 929 929 6 929 3195
6 929 
# 930
decim to binari convers of short field cacm februari 1963
yarbrough l d ca630203 jb march 14 1978 2 22
pm 930 5 930 930 5 930 930 5 930
# 931
systemat mistak analysi of digit comput program cacm februari 1963
miller j c malonei c j ca630202 jb march 14
1978 2 23 pm 1324 4 931 931 4 931
931 4 931 931 4 931 931 5 931 931
5 931 931 5 931 202 5 931 396 5
931 2616 5 931 634 5 931 795 5 931
931 6 931 931 6 931 1548 6 931 1684
6 931 2517 6 931 404 6 931 
# 932
matrix invers by gauss jordan invers ii algorithm 120 cacm
januari 1963 naur p ca630116 jb march 14 1978 2
27 pm 932 5 932 932 5 932 932 5
932 806 5 932 932 6 932 454 6 932
# 933
magic squar algorithm 117 118 cacm januari 1963 naur p
ca630115 jb march 14 1978 2 31 pm 933 5
933 933 5 933 933 5 933 
# 934
gauss s method algorithm 107 cacm januari 1963 naur p
ca630114 jb march 14 1978 2 32 pm 934 5
934 934 5 934 934 5 934 
# 935
calcul prime by mean of gp algorithm cacm januari 1963
naur p ca630113 jb march 14 1978 2 33 pm
935 5 935 935 5 935 935 5 935 
# 936
a set of test matric algorithm 52 cacm januari 1963
naur p ca630112 jb march 14 1978 2 35 pm
936 5 936 936 5 936 936 5 936 
# 937
invers of a finit segment of the hilbert matrix algorithm
50 cacm januari 1963 naur p ca630111 jb march 14
1978 2 36 pm 937 5 937 937 5 937
937 5 937 
# 938
invert algorithm 42 cacm januari 1963 naur p ca630110 jb
march 14 1978 2 36 pm 938 5 938 938
5 938 938 5 938 
# 939
gamma function algorithm 31 cacm januari 1963 behrenz p g
ca630109 jb march 14 1978 2 37 pm 939 5
939 939 5 939 939 5 939 
# 940
gener discret random variabl in a comput thi note is
concern with detail of how to instruct a comput to
choos on from mani thing with assign probabl the method
us a uniform variabl to direct the comput to a
memori locat if thi is done by a sequenc of
appropri chosen condit probabl effici us of memori space and
quit fast program will result cacm januari 1963 marsaglia g
ca630108 jb march 14 1978 2 40 pm 940 5
940 940 5 940 940 5 940 1073 5 940
1153 5 940 940 6 940 940 6 940 1153
6 940 
# 941
a recurs program for the gener n dimension integr a
gener program is outlin for n dimension integr with variabl
limit the program is of a recurs natur and us
simpson s rule combin with repeat bisect to attain the
requir accuraci it wa develop in the ferranti mercuri autocod
scheme cacm januari 1963 cadwel j h ca630107 jb march
14 1978 2 43 pm 941 5 941 941 5
941 941 5 941 
# 942
fortran subroutin for time seri analysi the author have recent
been concern in a time seri studi that constitut a
fairli typic piec of appli statist research involv extens comput
on a moder larg quantiti of data wehav found that
the mani differ numer process that were requir could be
built up almost complet from a small number of basic
oper and a set of fortran subroutin ha been written
to perform these the main purpos of thi note is
to describ these subroutin but sinc the question of gener
statist program is topic 1 we includ some gener remark
cacm januari 1963 heali m j r bogert b p
ca630106 jb march 14 1978 2 55 pm 942 5
942 942 5 942 942 5 942 948 5 942
1118 5 942 826 5 942 826 6 942 942
6 942 942 6 942 942 6 942 
# 943
term frequent combin in problem descript cacm januari 1963 grem
m ca630105 jb march 14 1978 2 56 pm 943
5 943 943 5 943 943 5 943 
# 944
storag and search properti of a tree organ memori system
a memori with list properti 1 mai be us to
construct numer alphabet or alphanumer tree such tree have inform
storag and retriev properti applic to problem involv larg quantiti
of data or to problem where the quantiti word length
and distribut of store inform is not known a priori
or chang rapidli dure the process the purpos of thi
paper is to examin the storag and search properti of
a tree organ storag system assum that a memori possess
certain list properti is avail of prime interest is the
applic where a symbol tabl dictionari or similar file is
to be store and search cacm januari 1963 scidmor a
k weinberg b l ca630104 jb march 14 1978 3
02 pm 2846 4 944 849 4 944 944 4
944 155 5 944 944 5 944 944 5 944
944 5 944 1234 5 944 2451 5 944 849
6 944 944 6 944 944 6 944 1935 6
944 1936 6 944 321 6 944 385 6 944
400 6 944 402 6 944 404 6 944 3184
6 944 729 6 944 
# 945
arithmet declar an applic to cobol cacm januari 1963 conwai
m e speroni j ca630103 jb march 14 1978 3
03 pm 1046 4 945 1105 4 945 1139 4
945 1140 4 945 1234 4 945 1263 4 945
1265 4 945 1496 4 945 1781 4 945 1824
4 945 2126 4 945 2546 4 945 464 4
945 584 4 945 631 4 945 653 4 945
680 4 945 763 4 945 795 4 945 799
4 945 945 4 945 945 5 945 945 5
945 945 5 945 404 5 945 799 5 945
945 6 945 399 6 945 82 6 945 404
6 945 
# 946
suggest on algol 60 rome issu a report by the
american standard associ subcommitte x3 4 2 cacm januari 1963
utman r e ca630102 jb march 14 1978 3 05
pm 946 5 946 946 5 946 946 5 946
1949 5 946 196 6 946 946 6 946 
# 947
supplement to the algol 60 report cacm januari 1963 woodger
m ca630101 jb march 14 1978 3 05 pm 947
5 947 947 5 947 947 5 947 761 5
947 196 6 947 947 6 947 3184 6 947
# 948
note on the us of procedur cacm decemb 1964 heali
m j r ca641223 jb march 9 1978 2 32
pm 1118 4 948 826 4 948 948 4 948
942 5 948 948 5 948 948 5 948 948
5 948 
# 949
integ and sign constant in algol a few remark ar
given on the relat between syntax and semant in the
program languag the aim is to point out that if
it is true that the grammar of a context free
languag should be conceiv not onli as a string gener
devic but also as a method for express a mean
then the grammar of algol is open to some critic
cacm decemb 1964 petron l vandoni c e ca641222 jb
march 9 1978 2 35 pm 1086 4 949 1102
4 949 1132 4 949 1142 4 949 1234 4
949 1263 4 949 1265 4 949 1270 4 949
1323 4 949 1358 4 949 1379 4 949 1380
4 949 1453 4 949 1464 4 949 1484 4
949 1491 4 949 1498 4 949 1613 4 949
1614 4 949 1781 4 949 1781 4 949 1781
4 949 1825 4 949 1860 4 949 1945 4
949 1945 4 949 2083 4 949 2178 4 949
2179 4 949 2252 4 949 2325 4 949 2341
4 949 2546 4 949 2645 4 949 2652 4
949 2684 4 949 2842 4 949 2929 4 949
2934 4 949 3069 4 949 669 4 949 679
4 949 691 4 949 761 4 949 762 4
949 949 4 949 949 4 949 949 4 949
989 4 949 949 5 949 949 5 949 949
5 949 483 5 949 584 5 949 3184 5
949 
# 950
parallel method for integr ordinari differenti equat thi paper is
dedic to the proposit that in order to take full
advantag for real time comput of highli parallel comput as
can be expect to be avail in the near futur
much of numer analysi will have to be recast in
a more parallel form by thi is meant that serial
algorithm ought to be replac by algorithm which consist of
sever subtask which can be comput without knowledg of the
result of the other subtask as an exampl a method
is propos for parallel the numer integr of an ordinari
differenti equat which process by all standard method is entir
serial cacm decemb 1964 nievergelt j ca641221 jb march 9
1978 3 09 pm 950 5 950 950 5 950
950 5 950 
# 951
ration chebyshev approxim to the bessel function integr ki x
the second reme algorithm is us to approxim the integr
ki by ration function the relat coeffici for the approxim
of ki1 ki2 ki3 ar given for differ precis cacm
decemb 1964 gargantini i pomental t ca641220 jb march 9
1978 3 12 pm 1015 4 951 1346 4 951
1440 4 951 1645 4 951 951 4 951 951
5 951 951 5 951 951 5 951 1346 5
951 532 5 951 951 6 951 532 6 951
# 952
anoth us of fortran ii chain cacm decemb 1964 drath
d g ca641219 jb march 9 1978 3 13 pm
952 5 952 952 5 952 952 5 952 
# 953
scan text with a 1401 cacm decemb 1964 baker j
j ca641218 jb march 9 1978 3 13 pm 953
5 953 953 5 953 953 5 953 2870 5
953 953 6 953 2377 6 953 2632 6 953
# 954
a note on the calcul of probabl in an f
distribut cacm decemb 1964 smilli k w anstei t h
ca641217 jb march 9 1978 3 14 pm 954 5
954 954 5 954 954 5 954 
# 955
a class of matric to test invers procedur cacm decemb
1964 cline r e ca641216 jb march 9 1978 3
16 pm 955 5 955 955 5 955 955 5
955 
# 956
a famili of test matric cacm decemb 1964 newberi a
c r ca641215 jb march 9 1978 3 17 pm
956 5 956 956 5 956 956 5 956 
# 957
method for partial rewrit of magnet tape cacm decemb 1964
miller j a ca641214 jb march 9 1978 3 18
pm 957 5 957 957 5 957 957 5 957
# 958
a case of too much precis cacm decemb 1964 syng
m j ca641213 jb march 9 1978 3 23 pm
958 5 958 958 5 958 958 5 958 
# 959
mark sens and port a punch program input cacm decemb
1964 lubbert w f ca641212 jb march 9 1978 3
24 pm 959 5 959 959 5 959 959 5
959 
# 960
curv fit with format fortran cacm decemb 1964 garber m
j ca641211 jb march 9 1978 3 25 pm 960
5 960 960 5 960 960 5 960 
# 961
limit bit manipul us fortran ii techniqu ar develop for
manipul bit us onli fortran ii these techniqu allow individu
bit to be test certain field to be shift and
number code in bcd to be convert to binari cacm
decemb 1964 oster c a ca641210 jb march 9 1978
3 27 pm 961 5 961 961 5 961 961
5 961 
# 962
doubl precis squar root for the cdc 3600 in januari
of 1960 the late han j maehli complet a summari
of approxim to the elementari function for the cdc 1604
comput the approxim and techniqu suggest by maehli ar equal
applic to the second larg comput in the cdc line
the 3600 unlik the 1604 howev the 3600 ha built
in doubl precis float point arithmet the present work larg
inspir by the success of maehli and hi associ concern
the extens of on of maehli s idea to a
doubl precis subroutin for the 3600 cacm decemb 1964 codi
w j ca641209 jb march 9 1978 3 31 pm
962 5 962 962 5 962 962 5 962 1440
5 962 1932 5 962 2159 5 962 962 6
962 962 6 962 962 6 962 1566 6 962
1932 6 962 532 6 962 
# 963
rel effect of central processor and input output speed upon
throughput on the larg comput present in thi paper is
a techniqu for determin the rel effect of the intern
speed of the comput and the speed of the input
output unit upon the overal speed of the system equat
ar deriv which permit the determin of these effect from
hardwar usag measur cacm decemb 1964 white p ca641208 jb
march 9 1978 3 34 pm 963 5 963 963
5 963 963 5 963 1653 5 963 963 6
963 1069 6 963 1417 6 963 
# 964
mechan of tediou algebra the e coeffici of theoret chemistri
a tabl of formula for certain integr involv legendr function
ha been construct mechan by a program which perform algebra
oper the formula ar all ration algebra express in a
singl variabl and were construct by a recurr procedur thei
ar of interest in molecular quantum chemistri trivial code techniqu
were us to write the relev program in fortran the
result were photo compos on a photon s 560 system
that wa control by tape which were punch directli from
the comput output so avoid manual keyboard transcript error and
keyboard correct cacm decemb 1964 wactlar h d barnett m
p ca641207 jb march 9 1978 3 38 pm 1028
4 964 1121 4 964 1216 4 964 1392 4
964 1396 4 964 1396 4 964 659 4 964
964 4 964 964 4 964 964 4 964 964
5 964 964 5 964 964 5 964 1334 5
964 1396 5 964 284 5 964 1444 5 964
561 5 964 759 5 964 964 6 964 964
6 964 964 6 964 1028 6 964 1029 6
964 1083 6 964 1132 6 964 1214 6 964
1278 6 964 1334 6 964 1365 6 964 1386
6 964 1387 6 964 1388 6 964 1392 6
964 1393 6 964 1394 6 964 1395 6 964
1396 6 964 1397 6 964 1496 6 964 284
6 964 407 6 964 3199 6 964 3200 6
964 3201 6 964 3202 6 964 3203 6 964
3204 6 964 561 6 964 730 6 964 
# 965
greatest common divisor algorithm 237 a1 cacm decemb 1964 brai
t a ca641206 jb march 9 1978 3 40 pm
965 5 965 965 5 965 965 5 965 
# 966
evalu of determin algorithm 224 f3 cacm decemb 1964 hasselblad
v rulifson j ca641205 jb march 9 1978 3 41
pm 966 5 966 966 5 966 966 5 966
# 967
complementari error function algorithm 181 s15 cacm decemb 1964 clausen
i hansson l ca641204 jb march 9 1978 3 42
pm 967 5 967 967 5 967 967 5 967
1583 5 967 831 6 967 967 6 967 1126
6 967 707 6 967 
# 968
radic invers quasi random point sequenc algorithm 247 g5 cacm
decemb 1964 halton j h smith g b ca641203 jb
march 9 19783 43 pm 968 5 968 968 5
968 968 5 968 
# 969
graycod algorithm 246 z cacm decemb 1964 boothroyd j ca641202
jb march 9 1978 3 44 pm 969 5 969
969 5 969 969 5 969 2834 5 969 969
6 969 2045 6 969 2417 6 969 2466 6
969 
# 970
treesort 3 algorithm m1 cacm decemb 1964 floyd r w
ca641201 jb march 9 1978 3 45 pm 970 5
970 970 5 970 970 5 970 2042 5 970
2222 5 970 2356 5 970 2679 5 970 2844
5 970 2972 5 970 970 6 970 970 6
970 970 6 970 970 6 970 970 6 970
970 6 970 1059 6 970 1175 6 970 1190
6 970 1228 6 970 1228 6 970 1491 6
970 1800 6 970 1818 6 970 1834 6 970
1969 6 970 1997 6 970 308 6 970 2042
6 970 2042 6 970 2204 6 970 2227 6
970 2597 6 970 2732 6 970 2738 6 970
2742 6 970 2767 6 970 3187 6 970 507
6 970 716 6 970 783 6 970 
# 971
time share in a traffic control program the toronto traffic
signal control system consist of a varieti of logic distinct
comput program all compet for machin time to satisfi these
demand a time share program ha been written whose purpos
is to execut in the order of a predefin prioriti
the variou subprogram within the real time system in thi
paper the more interest aspect of the time share program
ar outlin cacm novemb 1964 green l e s ca641112
jb march 9 1978 3 49 pm 971 5 971
971 5 971 971 5 971 
# 972
an execut system implement as a finit state automaton the
473l command and control system us by the air forc
permit mani oper to access larg data file through the
us of a comput the man machin interfac is satisfi
by sever commun consol from which oper mai enter queri
and view repli a data link permit remot station to
send messag statu report and inventori directli to the comput
the inform receiv over the on line data link is
us to updat the data file which ar store on
disk the 473l program system is divid into an execut
control program and five compon with differ process prioriti these
prioriti permit the system to be most sensit to the
consol input and permit the oper at all the consol
to time share the central processor the execut control program
provid for the orderli transit of control among the program
system compon the major emphasi of the paper is on
the techniqu of us the definit of a finit state
automaton for organ the execut control program cacm novemb 1964
heistand r e ca641111 jb march 9 1978 3 56
pm 1471 4 972 1774 4 972 2911 4 972
560 4 972 972 4 972 972 4 972 972
4 972 972 5 972 972 5 972 972 5
972 271 5 972 273 5 972 276 5 972
# 973
estim of heart paramet us skin potenti measur a fundament
problem of vector cardiographi is the estim of the state
of the heart on the basi of skin potenti measur
a mathemat model relat ventricular dipol to surfac potenti is
sketch then it is shown that the invers problem that
of determin electr heart paramet on the basi of skin
potenti measur mai be view as a nonlinear multipoint boundari
valu problem a feasibl solut emploi quasilinear and high speed
digit comput is given cacm novemb 1964 bellman r collier
c kagiwada h kalaba r selvest r ca641110 jb march
9 1978 4 00 pm 973 5 973 973 5
973 973 5 973 1278 5 973 973 6 973
1028 6 973 1029 6 973 
# 974
a techniqu for read gapless tape make electrocardiograph analysi feasibl
on the ibm 7090 to studi arrhythmia and higher frequenc
compon of the electrocardiogram long seri of patient heart cycl
must be examin befor valid comparison of differ heart beat
can be made a techniqu is present for the automat
analysi of long seri heart cycl via a digit comput
cacm novemb 1964 maher a s ca641109 jb march 9
1978 4 03 pm 974 5 974 974 5 974
974 5 974 
# 975
the new program of work for the intern standard vocabulari
in comput and inform process cacm novemb 1964 traub j
f ca641108 jb march 9 1978 4 05 pm 975
5 975 975 5 975 975 5 975 1251 5
975 975 6 975 
# 976
fresnel integr algorithm 213 s20 cacm novemb 1964 grai m
ca641107 jb march 9 1978 4 06 pm 976 5
976 976 5 976 976 5 976 
# 977
convers between calendar date and julian dai number algorithm 199
z cacm novemb 1964 oppenheim d k ca641106 jb march
9 1978 4 08 pm 977 5 977 977 5
977 977 5 977 
# 978
fresnel integr algorithm 244 s20 cacm novemb 1964 lotsch h
ca641105 jb march 9 1978 4 09 pm 978 5
978 978 5 978 978 5 978 
# 979
logarithm of a complex number algorithm 243 b3 cacm novemb
1964 collen d s ca641104 jb march 9 1978 4
10 pm 979 5 979 979 5 979 979 5
979 
# 980
multipl precis arithmet and the exact calcul of the 3
j 6 j and 9 j symbol describ in thi
paper is a system of gener purpos multipl precis fix
point routin and their us in subroutin which calcul exactli
the quantum mechan 3 j 6 j and 9 j
symbol of larg argument cacm novemb 1964 maer r m
redlich m g ca641103 jb march 9 1978 4 13
pm 980 5 980 980 5 980 980 5 980
# 981
round problem in commerci data process a common requir in
commerci data process is that the sum of a set
of number round in a gener understood manner be equal
to the sum of the number round individu four round
procedur ar describ to accomplish thi the particular procedur that
is appropri depend upon whether the number be accumul can
vari in sign whether their sum can vari in sign
and whether the last number be sum can be recogn
as such prior to it round cacm novemb 1964 kellei
t b ca641102 jb march 9 1978 4 25 pm
981 5 981 981 5 981 981 5 981 
# 982
an induct approach to languag translat the possibl of natur
languag translat by mean of fix oper on exampl translat
is consid the concept of sentenc translat which motiv the
work is inform present and the measur of physic similar
in pair of string is discuss a notion which plai
a central role in the propos type of translat experiment
evid is present in support of the premis upon which
thi concept is base cacm novemb 1964 faulk r d
ca641101 jb march 9 1978 4 28 pm 982 5
982 982 5 982 982 5 982 1592 5 982
982 6 982 1112 6 982 619 6 982 
# 983
take up reel for on inch perfor tape for inform
interchang propos american standard cacm octob 1964 ca641019 jb march
9 1978 4 30 pm 983 5 983 983 5
983 983 5 983 
# 984
report on input output procedur for algol 60 ifip cacm
octob 1964 ca641018 jb march 9 1978 4 32 pm
984 5 984 984 5 984 984 5 984 1705
5 984 1945 5 984 2034 5 984 823 6
984 914 6 984 915 6 984 917 6 984
984 6 984 984 6 984 984 6 984 986
6 984 989 6 984 990 6 984 1012 6
984 1020 6 984 1084 6 984 1098 6 984
1122 6 984 1138 6 984 1139 6 984 1141
6 984 1200 6 984 1223 6 984 1231 6
984 1265 6 984 1321 6 984 1336 6 984
1396 6 984 1455 6 984 1477 6 984 1487
6 984 1491 6 984 1496 6 984 1565 6
984 1852 6 984 1926 6 984 1947 6 984
483 6 984 584 6 984 669 6 984 680
6 984 763 6 984 
# 985
report on subset algol 60 ifip cacm octob 1964 ca641017
jb march 9 1978 4 33 pm 985 5 985
985 5 985 985 5 985 
# 986
propos amend to propos american standard on specif for gener
purpos paper card for inform process cacm octob 1964 ca641016
jb march 9 1978 4 35 pm 986 5 986
986 5 986 986 5 986 1705 5 986 984
6 986 986 6 986 1020 6 986 1321 6
986 
# 987
fortran vs basic fortran a program languag for inform process
on automat data process system cacm octob 1964 ca641015 jb
march 9 1978 4 36 pm 987 5 987 987
5 987 987 5 987 1613 5 987 1646 5
987 1900 5 987 1955 5 987 2025 5 987
2154 5 987 2365 5 987 2506 5 987 3060
5 987 830 6 987 987 6 987 987 6
987 987 6 987 987 6 987 987 6 987
987 6 987 987 6 987 987 6 987 987
6 987 988 6 987 988 6 987 1072 6
987 1086 6 987 1134 6 987 1179 6 987
1453 6 987 1647 6 987 1754 6 987 1900
6 987 1900 6 987 1924 6 987 2154 6
987 2362 6 987 3184 6 987 680 6 987
# 988
histori and summari of fortran standard develop for the asa
cacm octob 1964 heis w p ca641014 jb march 9
1978 4 37 pm 988 5 988 988 5 988
988 5 988 1845 5 988 1900 5 988 2083
5 988 2154 5 988 2270 5 988 2693 5
988 987 6 988 987 6 988 988 6 988
988 6 988 988 6 988 988 6 988 988
6 988 988 6 988 1900 6 988 2270 6
988 2696 6 988 3184 6 988 
# 989
a method of syntax specif cacm octob 1964 iverson k
e ca641013 jb march 9 1978 4 39 pm 249
4 989 254 4 989 272 4 989 1086 4
989 1102 4 989 1109 4 989 1132 4 989
1140 4 989 1188 4 989 1234 4 989 1263
4 989 1265 4 989 1270 4 989 1306 4
989 1323 4 989 1358 4 989 1379 4 989
1380 4 989 1453 4 989 1464 4 989 1464
4 989 1484 4 989 1491 4 989 1491 4
989 1498 4 989 1613 4 989 1614 4 989
1767 4 989 1781 4 989 1781 4 989 1781
4 989 1787 4 989 1825 4 989 1860 4
989 1949 4 989 321 4 989 2059 4 989
2083 4 989 2126 4 989 2178 4 989 2179
4 989 2252 4 989 2325 4 989 2341 4
989 2546 4 989 435 4 989 437 4 989
463 4 989 483 4 989 491 4 989 2645
4 989 2652 4 989 2684 4 989 2732 4
989 2842 4 989 2929 4 989 2934 4 989
560 4 989 583 4 989 3069 4 989 3073
4 989 627 4 989 631 4 989 632 4
989 642 4 989 644 4 989 653 4 989
669 4 989 679 4 989 680 4 989 691
4 989 729 4 989 761 4 989 761 4
989 762 4 989 763 4 989 123 4 989
140 4 989 919 4 989 949 4 989 989
4 989 989 4 989 989 4 989 196 5
989 989 5 989 989 5 989 989 5 989
1263 5 989 288 5 989 1453 5 989 1945
5 989 3184 5 989 823 6 989 914 6
989 915 6 989 917 6 989 984 6 989
989 6 989 989 6 989 989 6 989 990
6 989 1012 6 989 1084 6 989 1098 6
989 1122 6 989 1138 6 989 1139 6 989
1141 6 989 1200 6 989 1223 6 989 1265
6 989 1336 6 989 1396 6 989 1455 6
989 1477 6 989 1487 6 989 1491 6 989
1496 6 989 404 6 989 483 6 989 3184
6 989 3184 6 989 584 6 989 669 6
989 680 6 989 763 6 989 
# 990
constraint type statement in program languag a propos is made
for includ in a program languag statement which impli relat
between variabl but which ar not explicit assign statement the
compil set up a newtonian iter make us for the
purpos of a routin for formal differenti cacm octob 1964
wilk m v ca641012 jb march 9 1978 4 42
pm 990 5 990 990 5 990 990 5 990
1781 5 990 1945 5 990 2341 5 990 823
6 990 123 6 990 196 6 990 914 6
990 915 6 990 917 6 990 919 6 990
984 6 990 989 6 990 990 6 990 990
6 990 990 6 990 1007 6 990 1012 6
990 1046 6 990 1084 6 990 1098 6 990
1122 6 990 1131 6 990 1138 6 990 1139
6 990 1139 6 990 1140 6 990 1141 6
990 1149 6 990 1198 6 990 1200 6 990
1215 6 990 1223 6 990 1223 6 990 1265
6 990 1265 6 990 1303 6 990 1323 6
990 1336 6 990 1358 6 990 1366 6 990
1396 6 990 1421 6 990 1455 6 990 1460
6 990 1462 6 990 1463 6 990 1467 6
990 1468 6 990 1468 6 990 1466 6 990
1477 6 990 1477 6 990 1487 6 990 1491
6 990 1491 6 990 1496 6 990 1496 6
990 1531 6 990 1535 6 990 1565 6 990
1601 6 990 1602 6 990 1613 6 990 1614
6 990 1626 6 990 1641 6 990 1787 6
990 1788 6 990 205 6 990 224 6 990
249 6 990 288 6 990 316 6 990 381
6 990 398 6 990 11 6 990 404 6
990 410 6 990 463 6 990 464 6 990
483 6 990 483 6 990 3184 6 990 3184
6 990 3188 6 990 584 6 990 584 6
990 600 6 990 669 6 990 680 6 990
680 6 990 691 6 990 763 6 990 763
6 990 799 6 990 
# 991
gamma function with control accuraci algorithm 225 s14 cacm octob
1964 brai t a ca641011 jb march 9 1978 4
44 pm 991 5 991 991 5 991 991 5
991 
# 992
gamma function algorithm 221 s14 cacm octob 1964 mccomb v
k ca641010 jb march 9 1978 4 45 pm 992
5 992 992 5 992 992 5 992 
# 993
kutta merson algorithm 218 d2 cacm octob 1964 prieb k
b ca641009 jb march 9 1978 4 46 pm 993
5 993 993 5 993 993 5 993 
# 994
stringsort algorithm 207 m1 cacm octob 1964 blair c r
ca641008 jb march 9 1978 4 47 pm 994 5
994 994 5 994 994 5 994 
# 995
steep1 algorithm 203 e4 cacm octob 1964 wallack p ca641007
jb march 9 1978 4 48 pm 995 5 995
995 5 995 995 5 995 
# 996
permut of a set with repetit algorithm 242 g6 cacm
octob 1964 sag t w ca641006 jb march 9 1978
4 49 pm 996 5 996 996 5 996 996
5 996 2044 5 996 996 6 996 1558 6
996 2230 6 996 521 6 996 
# 997
patent protect of comput program cacm octob 1964 jacob m
c ca641005 jb march 9 1978 4 50 pm 997
5 997 997 5 997 997 5 997 1711 5
997 997 6 997 1001 6 997 
# 998
comput program ar patent cacm octob 1964 hamlin k b
ca641004 jb march 9 1978 4 53 pm 998 5
998 998 5 998 998 5 998 
# 999
joint inventorship of comput cacm octob 1964 hauptman g a
ca641003 jb march 9 19784 54 pm 999 5 999
999 5 999 999 5 999 
# 1000
comput patent disclosur cacm octob 1964 kate j p ca641002
jb march 9 1978 4 55 pm 1000 5 1000
1000 5 1000 1000 5 1000 
# 1001
copyright aspect of comput usag thi paper is concern with
the question of what constitut infring of a copyright on
a book or other nondramat literari work when the work
is fed into a comput and is index analyz partial
reprint or otherwis util by the comput to produc ey
readabl output the question of copyright of program and infring
of copyright on program is also discuss the paper is
direct primarili to a discuss of the present law some
aspect of the propos new copyright law ar also includ
gener recommend ar made with respect to the propos revis
of the copyright law cacm octob 1964 lawlor r c
ca641001 jb march 9 1978 4 59 pm 1001 5
1001 1001 5 1001 1001 5 1001 1711 5 1001
997 6 1001 1001 6 1001 
# 1002
a rapid method for digit filter sinc much of the
comput time spent in time seri analysi is us for
multipl a minimum multipl method wa devis for digit filter
with the expect that it would be us in the
on line real time analysi of biolog data the filter
ar construct from a success of readili analyz compon in
a manner that facilit cascad the repertoir of frequenc respons
curv includ rel good low pass and band pass design
program ar avail for implement both the synthesi of these
filter and their applic on comput whose assembl allow the
definit of recurs macro cacm septemb 1964 whittlesei j r
b ca640909 jb march 9 1978 5 03 pm 1002
5 1002 1002 5 1002 1002 5 1002 
# 1003
a comput analysi method for thermal diffus in biochem system
in the thermal detect of rapid biochem reaction it is
necessari to correct the temperatur data for transient heat conduct
loss in a cylindr calorimet to handl the complex aris
from vari thermal relax time of concentr insul layer a
comput program wa develop which give the temperatur distribut of
the system as a function of radiu and time thi
distribut is correct at each step by a subroutin which
calcul the instantan chemic state of there action as well
as the heat produc by thi reaction the program is
base on a direct statement of fourier s law of
heat conduct and the chemic rate equat to provid a
bookkeep law to follow the reactant and the flow of
heat packet in such a wai that the comput continu
store the heat distribut a comput analysi method is here
regard as on in which the physic law of a
process ar us explicitli in the program usual thi result
in by pass much of the mathemat procedur convention us
the program wa test against some known exact solut of
the heat equat and gave ident result and compar well
with experiment data of a known biochem reaction the construct
of comput program base on the direct statement of the
physic law is a principl of gener applic which ha
been appli to sever other physic phenomena cacm septemb 1964
david n berger r l ca640908 jb march 9 1978
5 13 pm 1003 5 1003 1003 5 1003 1003
5 1003 
# 1004
arctang algorithm b1 cacm septemb 1964 mill k w ca640907
jb march 9 1978 6 08 pm 1004 5 1004
1004 5 1004 1004 5 1004 
# 1005
coordin on an ellipsoid algorithm 240 z cacm septemb 1964
dorrer e ca640906 jb march 9 1978 6 09 pm
1005 5 1005 1005 5 1005 1005 5 1005 
# 1006
a storag alloc and refer structur a method is propos
and discuss which allow a subscript variabl capabl in the
fortran sens to be ad to autocod type assembl system
cacm septemb 1964 fitzwat d r ca640905 jb march 9
1978 6 11 pm 1006 5 1006 1006 5 1006
1006 5 1006 1788 5 1006 1006 6 1006 1007
6 1006 205 6 1006 3189 6 1006 
# 1007
extens of exist compil by sophist us of macro a
descript is present of an applic in which macro and
string concaten were emploi to add a new facil to
belfap cacm septemb 1964 benett r k neumann h d
ca640904 jb march 9 1978 6 13 pm 1007 5
1007 1007 5 1007 1007 5 1007 1781 5 1007
1788 5 1007 123 6 1007 196 6 1007 919
6 1007 990 6 1007 1006 6 1007 1007 6
1007 1007 6 1007 1046 6 1007 1131 6 1007
1139 6 1007 1140 6 1007 1149 6 1007 1198
6 1007 1215 6 1007 1223 6 1007 1265 6
1007 1303 6 1007 1323 6 1007 1358 6 1007
1366 6 1007 1421 6 1007 1460 6 1007 1462
6 1007 1463 6 1007 1467 6 1007 1468 6
1007 1477 6 1007 1491 6 1007 1496 6 1007
1531 6 1007 1535 6 1007 1565 6 1007 1601
6 1007 1602 6 1007 1613 6 1007 1614 6
1007 1626 6 1007 1641 6 1007 1787 6 1007
1788 6 1007 205 6 1007 205 6 1007 224
6 1007 249 6 1007 288 6 1007 316 6
1007 381 6 1007 398 6 1007 11 6 1007
404 6 1007 410 6 1007 463 6 1007 464
6 1007 483 6 1007 3184 6 1007 3188 6
1007 3189 6 1007 584 6 1007 600 6 1007
680 6 1007 691 6 1007 763 6 1007 799
6 1007 
# 1008
schedul meet with a comput comput schedul of paper as
it wa develop for the 1960 meet of the feder
of american societi for experiment biologi faseb is describ the
faseb meet is the largest scientif meet held in the
unit state each year the techniqu develop for faseb can
be appli to schedul ani meet with parallel session cacm
septemb 1964 schultz c k brook a schwartz p ca640903
jb march 9 1978 6 16 pm 1008 5 1008
1008 5 1008 1008 5 1008 2052 5 1008 1008
6 1008 1013 6 1008 1504 6 1008 1540 6
1008 
# 1009
solut of combinatori problem us gener function on a variabl
field comput the util of gener function in solv combinatori
problem is discuss particular implement result ar present and evalu
cacm septemb 1964 weinberg g m ca640902 jb march 9
1978 6 17 pm 1009 5 1009 1009 5 1009
1009 5 1009 
# 1010
a multius comput facil for educ and research present dai
comput facil ar limit in their valu for scientif research
by inabl to interact strongli with user the full power
of a research comput instrument should be avail at mani
termin that give each user the abil to gener correct
and oper ani procedur he wish either simpl or complex
implement is describ for a small scale multius comput system
that permit sever user to work independ with the machin
and to obtain satisfactori respons us typewrit commun cacm septemb
1964 denni j b ca640901 jb march 9 1978 6
22 pm 1010 5 1010 1010 5 1010 1010 5
1010 
# 1011
logarithm of a complex number algorithm 48 b3 cacm august
1964 collen d s ca640819 jb march 23 1978 7
54 pm 1011 5 1011 1011 5 1011 1011 5
1011 
# 1012
formal pars system automat syntact analysi ha recent becom import
for both natur languag data process and syntax direct compil
a formal pars system g v u t r consist
of two finit disjoint vocabulari v and t a mani
mani map u from v onto t and a recurs
set r of string in t call syntact sentenc class
everi program for automat syntact analysi determin a formal pars
system a direct product analyz i t x p is
a nondeterminist pushdown store machin with intern vocabulari i input
vocabulari t and all product of p in the form
z a ay1 ym where z yi ar element of
the set i and a is an element of the
set t everi context free languag can be analyz by
a direct product analyz the kuno oetting multipl path syntact
analyz for english is a concret exampl of a direct
product analyz and of a work pars algorithm the connect
between structur assign by the analyz and those of a
convent phrase structur grammar is examin in thi paper cacm
august 1964 greibach s a ca640818 jb march 9 1978
6 30 pm 1012 5 1012 1012 5 1012 1012
5 1012 1225 5 1012 1350 5 1012 1945 5
1012 823 6 1012 914 6 1012 915 6 1012
917 6 1012 984 6 1012 989 6 1012 990
6 1012 1012 6 1012 1012 6 1012 1012 6
1012 1084 6 1012 1098 6 1012 1122 6 1012
1138 6 1012 1139 6 1012 1141 6 1012 1200
6 1012 1223 6 1012 1225 6 1012 1265 6
1012 1265 6 1012 1336 6 1012 1396 6 1012
1399 6 1012 1455 6 1012 1477 6 1012 1487
6 1012 1491 6 1012 1496 6 1012 483 6
1012 584 6 1012 669 6 1012 680 6 1012
680 6 1012 680 6 1012 763 6 1012 
# 1013
final examin schedul a method for schedul final examin to
yield a minim number of student conflict is describ the
minim is achiev by repetit evalu a nonlinear set of
equat imbed in the process is a random or mont
carlo select of assign as in such heurist techniqu the
solut mai not be optimum and mani solut mai be
found which yield local minim result comput program ar describ
and empir result given cacm august 1964 broder s ca640817
jb march 9 1978 6 33 pm 1013 5 1013
1013 5 1013 1013 5 1013 1609 5 1013 2052
5 1013 1008 6 1013 1013 6 1013 1013 6
1013 1504 6 1013 1540 6 1013 
# 1014
machin control for analysi of varianc a major problem in
us the analysi of varianc as the number of factor
increas is the exponenti rise in the number of interact
even though the experiment mai not be interest in these
interact it is imposs to ignor them in most experiment
design becaus of the problem of get error term it
is natur therefor to look to the comput to handl
the bulk of work involv in comput the interact a
program devic to get the comput to do thi is
describ cacm august 1964 weldon r j ca640816 jb march
9 1978 6 37 pm 1014 4 1014 912 5
1014 1014 5 1014 1014 5 1014 1014 5 1014
# 1015
near minimax polynomi approxim and partit of interv a method
of near minimax polynomi approxim is describ as a by
product thi method provid a formula for an estim of
the maximum error associ with a given degre of approxim
us thi formula a partit algorithm is obtain for divid
a basic interv into subinterv for which approxim of equal
degre give equal maximum error cacm august 1964 fraser w
hart j f ca640815 jb march 9 1978 6 41
pm 1015 4 1015 1346 4 1015 1440 4 1015
1645 4 1015 951 4 1015 1015 5 1015 1015
5 1015 1015 5 1015 532 5 1015 
# 1016
interchangc perfor tape variabl block format for posit and straight
cut rs 273 and contour and contour posit rs 274
numer control machin tool propos american standard cacm august 1964
ca640814 jb march 9 1978 6 43 pm 1016 5
1016 1016 5 1016 1016 5 1016 
# 1017
comment on bit sequenc of the ascii in serial by
bit data transmiss cacm august 1964 bemer r w booth
j ca640813 jb march 9 1978 6 45 pm 1017
5 1017 1017 5 1017 1017 5 1017 
# 1018
gauss algorithm 209 s15 cacm august 1964 pike m c
ca640812 jb march 9 1978 6 54 pm 1018 5
1018 1018 5 1018 1018 5 1018 
# 1019
xy move plot algorithm 162 j6 cacm august 1964 cavin
d k ca640811 jb march 9 1978 6 55 pm
1019 5 1019 1019 5 1019 1019 5 1019 
# 1020
free field read algorithm 239 i5 cacm august 1964 mckeeman
w m ca640810 jb march 9 1978 6 56 pm
1020 5 1020 1020 5 1020 1020 5 1020 1705
5 1020 984 6 1020 986 6 1020 1020 6
1020 1321 6 1020 
# 1021
conjug gradient method algorithm 238 f4 cacm august 1964 reev
c m ca640809 jb march 9 1978 6 59 pm
1021 5 1021 1021 5 1021 1021 5 1021 
# 1022
greatest common divisor algorithm 237 a1 cacm august 1964 peck
j e l ca640808 jb march 9 1978 7 17
pm 1022 5 1022 1022 5 1022 1022 5 1022
2031 5 1022 1022 6 1022 450 6 1022 
# 1023
bessel function of the first kind algorithm 236 s17 cacm
august 1964 gautschi w ca640807 jb march 9 1978 7
19 pm 1023 4 1023 1222 4 1023 1023 5
1023 1023 5 1023 1023 5 1023 1130 5 1023
1909 5 1023 2119 5 1023 134 6 1023 1023
6 1023 1023 6 1023 1284 6 1023 1316 6
1023 2129 6 1023 
# 1024
a note on the format of free list cacm august
1964 wait w m ca640806 jb march 9 1978 7
20 pm 1024 4 1024 1024 4 1024 1051 4
1024 1051 4 1024 1098 4 1024 1102 4 1024
1132 4 1024 1214 4 1024 1380 4 1024 1388
4 1024 1390 4 1024 1393 4 1024 1485 4
1024 1486 4 1024 1487 4 1024 1549 4 1024
1549 4 1024 1570 4 1024 1706 4 1024 1826
4 1024 1878 4 1024 1878 4 1024 1946 4
1024 1957 4 1024 378 4 1024 2060 4 1024
2155 4 1024 2168 4 1024 2168 4 1024 2719
4 1024 2723 4 1024 2723 4 1024 2838 4
1024 2842 4 1024 2855 4 1024 2857 4 1024
2879 4 1024 3077 4 1024 3080 4 1024 3106
4 1024 3112 4 1024 627 4 1024 106 4
1024 1024 5 1024 1024 5 1024 1024 5 1024
210 5 1024 731 5 1024 
# 1025
a method of syntax check algol 60 a syntax checker
wa design base on the syntax of algol as describ
in the algol 60 report commun of the acm mai
1960 sinc the definit of the element of the languag
is recurs it seem most desir to design the syntax
checker as a set of mutual recurs processor ti togeth
by subroutin which perform certain bookkeep function becaus of the
recurs natur of the languag and of the syntax checker
the problem of recoveri after an error requir much attent
a method wa devis which permit most program to be
check complet despit error cacm august 1964 lietzk m p
ca640805 jb march 9 1978 7 24 pm 1025 5
1025 1025 5 1025 1025 5 1025 1215 5 1025
1682 5 1025 1025 6 1025 1025 6 1025 1785
6 1025 224 6 1025 763 6 1025 
# 1026
divid and correct method for multipl precis divis a divis
problem is defin and notat to relat it to the
problem of multipl precis oper in a digit comput is
introduc a basic divid and correct method for multipl precis
divis is formul and it known properti briefli review of
particular interest is the fact that the method produc at
each step a set of precis three estim for the
desir result on of which is exact cacm august 1964
stein m l ca640804 jb march 9 1978 7 27
pm 1026 4 1026 1258 4 1026 1292 4 1026
1497 4 1026 107 5 1026 1026 5 1026 1026
5 1026 1026 5 1026 1258 5 1026 1292 5
1026 1497 5 1026 1975 5 1026 2605 5 1026
107 6 1026 107 6 1026 107 6 1026 1026
6 1026 1026 6 1026 1026 6 1026 1026 6
1026 1026 6 1026 1292 6 1026 1292 6 1026
1497 6 1026 1593 6 1026 2286 6 1026 
# 1027
an altern checksum method cacm august 1964 newhal n s
ca640803 jb march 9 1978 7 28 pm 1027 5
1027 1027 5 1027 1027 5 1027 
# 1028
investig of a new analyt method for numer deriv evalu
a recent propos analyt approach to numer deriv evalu is
discuss the techniqu is shown to be both accur and
easi to appli though certain indic modif ar requir it
us should greatli facilit the write and debug of program
requir deriv of highli complex function cacm august 1964 wilkin
r d ca640802 jb march 9 1978 7 31 pm
1028 4 1028 1028 4 1028 1216 4 1028 1216
4 1028 1278 4 1028 1347 4 1028 1392 4
1028 1396 4 1028 1396 4 1028 1536 4 1028
964 4 1028 1028 5 1028 1028 5 1028 1028
5 1028 1029 5 1028 1216 5 1028 1278 5
1028 1347 5 1028 1396 5 1028 561 5 1028
964 6 1028 973 6 1028 1028 6 1028 1028
6 1028 1028 6 1028 1028 6 1028 1029 6
1028 1029 6 1028 1029 6 1028 1029 6 1028
1083 6 1028 1132 6 1028 1214 6 1028 1278
6 1028 1278 6 1028 1334 6 1028 1365 6
1028 1386 6 1028 1387 6 1028 1388 6 1028
1392 6 1028 1393 6 1028 1394 6 1028 1395
6 1028 1396 6 1028 1397 6 1028 1496 6
1028 284 6 1028 407 6 1028 3199 6 1028
3200 6 1028 3201 6 1028 3202 6 1028 3203
6 1028 3204 6 1028 561 6 1028 561 6
1028 730 6 1028 
# 1029
a simpl automat deriv evalu program a procedur for automat
evalu of total partial deriv of arbitrari algebra function is
present the techniqu permit comput of numer valu of deriv
without develop analyt express for the deriv the kei to
the method is the decomposit of the given function by
introduct of intermedi variabl into a seri of elementari function
step a librari of elementari function subroutin is provid for
the automat evalu and differenti of these new variabl the
final step in thi process produc the desir function s
deriv the main featur of thi approach is it simplic
it can be us as a quick reaction tool where
the deriv of analyt deriv is labori and also as
a debug tool for program which contain deriv cacm august
1964 wengert r e ca640801 jb march 9 1978 7
38 pm 1028 5 1029 1029 5 1029 1029 5
1029 1029 5 1029 1216 5 1029 1278 5 1029
1347 5 1029 1396 5 1029 1536 5 1029 964
6 1029 973 6 1029 1028 6 1029 1028 6
1029 1028 6 1029 1028 6 1029 1029 6 1029
1029 6 1029 1029 6 1029 1029 6 1029 1029
6 1029 1029 6 1029 1083 6 1029 1132 6
1029 1214 6 1029 1278 6 1029 1278 6 1029
1334 6 1029 1365 6 1029 1386 6 1029 1387
6 1029 1388 6 1029 1392 6 1029 1393 6
1029 1394 6 1029 1395 6 1029 1396 6 1029
1397 6 1029 1496 6 1029 284 6 1029 407
6 1029 3199 6 1029 3200 6 1029 3201 6
1029 3202 6 1029 3203 6 1029 3204 6 1029
561 6 1029 561 6 1029 561 6 1029 730
6 1029 
# 1030
techniqu for the simul of comput logic the simul of
a digit comput is an integr part of most comput
design autom system the evalu of the boolean function which
character the comput be simul constitut on major portion of
a simul system four gener procedur class for evalu these
function ar defin toward greatli increas effici of a simul
system method ar present for simultan evalu mani function for
on set of valu of the variabl and for evalu
simultan on function for mani set of valu for the
variabl cacm juli 1964 breuer m a ca640717 jb march
9 1978 7 42 pm 1030 4 1030 1886 4
1030 1939 4 1030 1030 5 1030 1030 5 1030
1030 5 1030 1261 5 1030 1939 5 1030 678
5 1030 1030 6 1030 1030 6 1030 678 6
1030 
# 1031
a note on start the newton raphson method determin of
a suitabl initi estim for a root of an equat
f x 0 by mean of comput the root of
a sequenc of relat equat is describ cacm juli 1964
beyer w a ca640716 jb march 9 1978 7 44
pm 1031 5 1031 1031 5 1031 1031 5 1031
# 1032
theoret consider in inform retriev system inform storag and retriev
system ar compos of three major compon a identif of
inform and tag it for effect retriev b search strategi
how to enter the file to circumv the scan of
nonrelev materi and c file organ to make access to
inform effici for identif of inform the paper suggest that
a metalanguag recent discuss in a paper by goffman verhoeff
and belzer associ with an object languag be us for
search strategi a linear model for an evalu function of
relev is develop which reward the system for retriev relev
document and not retriev the nonrelev and penal the system
for the escap relev document and fals drop the inadequaci
of a linear model ar indic two approach to file
organ ar discuss on is self organ of the file
base on it histori and past perform and the second
is a self gener subset of the file with a
high probabl of be relev cacm juli 1964 belzer j
goffman w ca640715 jb march 9 1978 7 55 pm
1032 5 1032 1032 5 1032 1032 5 1032 
# 1033
experiment person arrai translat system a system design for intim
man machin interact in a gener purpos problem solv environ
is experiment oper the system util an arrai orient symbol
sourc languag contain power statement type these includ numer boolean
relat and select oper on operand which can be entir
arrai the system also permit simpl specif of test and
argument arrai in singl statement the complet symbol oper system
includ displai and entri of program and data sequenc control
is aid by an interrupt switch which allow the user
to interact with the program dure execut in addit to
normal store program sequenc the system provid trace option and
the abil to enter ani statement for immedi execut present
implement of the system is with an interpret translat on
an ibm 1620 comput cacm juli 1964 hellerman h ca640714
jb march 9 1978 8 02 pm 1033 5 1033
1033 5 1033 1033 5 1033 
# 1034
autos an autom data system analysi techniqu is describ the
techniqu is design to allevi some of the princip problem
that beset current analysi larg data workload long span of
time between project incept and system oper date the lack
of explicit direct for conduct data system analysi and us
the result and the lack of a techniqu to control
data system chang throughout it lifetim the analysi is gear
to determin workload relationship and storag characterist of document in
the inform network automat cacm juli 1964 gatto o t
ca640713 jb march 9 19788 07 pm 1034 5 1034
1034 5 1034 1034 5 1034 
# 1035
characterist of the fortran cep languag the fortran cep languag
differ from fortran ii mainli becaus 1 it extend the
varieti of the mode for real quantiti 2 it allow
suitabl mixtur in an input output list or in an
express of quantiti that occur under differ mode 3 it
make it possibl to address a greater number of input
output equip and 4 it remov the restrict on the
complex of the list of quantiti to be transmit between
the magnet core memori and the drum or the magnet
tape unit cacm juli 1964 mancino o g ca640712 jb
march 9 1978 8 11 pm 1035 5 1035 1035
5 1035 1035 5 1035 1305 5 1035 1035 6
1035 
# 1036
remark on further gener of algol cacm juli 1963 garwick
j v ca640710 jb march 9 1978 8 12 pm
1036 5 1036 1036 5 1036 1036 5 1036 
# 1037
reduct of a matrix contain polynomi element algorithm 170 f3
cacm juli 1964 prieb k b ca640710 jb march 9
1978 8 13 pm 1037 4 1037 1234 4 1037
1358 4 1037 1491 4 1037 1037 5 1037 1037
5 1037 1037 5 1037 729 5 1037 
# 1038
crout with equilibr and iter algorithm 135 f4 cacm juli
1964 mckeeman w m ca640709 jb march 9 1978 8
15 pm 1038 5 1038 1038 5 1038 1038 5
1038 
# 1039
summat of fourier seri algorithm 128 c6 cacm juli 1964
thacher jr h c ca640708 jb march 9 1978 8
16 pm 1039 5 1039 1039 5 1039 1039 5
1039 
# 1040
romberg integr algorithm 60 d1 cacm juli 1964 thacher jr
h c ca640707 jb march 9 1978 8 17 pm
1040 4 1040 1040 4 1040 1040 4 1040 1352
4 1040 2040 4 1040 1040 5 1040 1040 5
1040 1040 5 1040 1352 5 1040 2415 5 1040
587 5 1040 621 5 1040 885 5 1040 834
6 1040 872 6 1040 1040 6 1040 1040 6
1040 1092 6 1040 1241 6 1040 1273 6 1040
1982 6 1040 324 6 1040 2074 6 1040 429
6 1040 570 6 1040 621 6 1040 786 6
1040 
# 1041
random permut algorithm 235 g6 cacm juli 1964 durstenfeld r
ca640706 jb march 9 1978 8 18 pm 1041 5
1041 1041 5 1041 1041 5 1041 
# 1042
poisson charlier polynomi algorithm 234 s23 cacm juli 1964 simo
pereira j m s ca640705 jb march 9 1978 8
19 pm 1042 5 1042 1042 5 1042 1042 5
1042 
# 1043
talk a high level sourc languag debug techniqu with real
time data extract talk mean take a look is a
debug techniqu which aid substanti in debug complex real time
program system by interrupt the user program at desir point
to extract previous specifi data the extract data is later
edit list the associ data with it high level sourc
languag identif cacm juli 1964 versteeg r l ca640704 jb
march 9 1978 8 24 pm 1043 5 1043 1043
5 1043 1043 5 1043 
# 1044
an automat loader for subroutin nest a method for automat
load of librari subroutin which can be adapt to oper
in conjunct with ani convent two pass assembl is describ
the method is specif design to cope with a nest
librari structur cacm juli 1964 kanner h ca640703 jb march
9 1978 8 27 pm 1044 5 1044 1044 5
1044 1044 5 1044 1332 5 1044 1044 6 1044
# 1045
program analysi of varianc by sequenc of oper and isomorph
map a special oper calculu develop by hartlei in 1956
togeth with a new map scheme ha been found to
be effici in program analysi of varianc for multifactor experi
the oper calculu and the map scheme ar describ in
detail cacm juli 1964 peng k c ca640702 jb march
9 1978 8 30 pm 1045 5 1045 1045 5
1045 1045 5 1045 1404 5 1045 1045 6 1045
# 1046
a compil build system develop by brooker and morri in
a number of articl publish dure the past two year
r a brooker and d morri join by j rohl
in their most recent paper have present a veri interest
program system that thei have develop for the ferranti atla
comput the present paper describ some of the major featur
of their system it expand on some point that the
origin author cover briefli and treat onli veri lightli some
topic to which thei devot consider space the purpos of
thi paper is pure expositori except in some veri small
detail and in some comment it doe not intention depart
from or add to the materi publish in the list
refer cacm juli 1964 rosen s ca640701 jb march 9
1978 8 47 pm 1046 4 1046 1105 4 1046
1139 4 1046 1140 4 1046 1234 4 1046 1263
4 1046 1265 4 1046 1496 4 1046 1781 4
1046 1824 4 1046 2126 4 1046 2546 4 1046
464 4 1046 584 4 1046 631 4 1046 653
4 1046 680 4 1046 763 4 1046 795 4
1046 799 4 1046 945 4 1046 1046 5 1046
1046 5 1046 1046 5 1046 1781 5 1046 404
5 1046 123 6 1046 196 6 1046 919 6
1046 990 6 1046 1007 6 1046 1046 6 1046
1131 6 1046 1139 6 1046 1140 6 1046 1149
6 1046 1198 6 1046 1215 6 1046 1223 6
1046 1265 6 1046 1303 6 1046 1323 6 1046
1358 6 1046 1366 6 1046 1421 6 1046 1460
6 1046 1462 6 1046 1463 6 1046 1467 6
1046 1468 6 1046 1477 6 1046 1491 6 1046
1496 6 1046 1531 6 1046 1535 6 1046 1565
6 1046 1601 6 1046 1602 6 1046 1613 6
1046 1614 6 1046 1626 6 1046 1641 6 1046
1787 6 1046 1788 6 1046 205 6 1046 224
6 1046 249 6 1046 288 6 1046 316 6
1046 381 6 1046 398 6 1046 11 6 1046
404 6 1046 410 6 1046 463 6 1046 464
6 1046 483 6 1046 3184 6 1046 3188 6
1046 584 6 1046 600 6 1046 680 6 1046
691 6 1046 763 6 1046 799 6 1046 
# 1047
gener of test matric by similar transform a method for
obtain test matric with a prescrib distribut of characterist root
is given the process consist of us particularli simpl similar
transform to gener full matric from canon form the matric
gener also have known characterist vector invers and determin cacm
june 1964 ortega j m ca640620 jb march 9 1978
8 50 pm 1047 4 1047 1047 5 1047 1047
5 1047 1047 5 1047 1707 5 1047 496 5
1047 1047 6 1047 511 6 1047 
# 1048
approxim solut of axial symmetr problem a varieti of physic
problem in such divers field as electrostat field theori heat
and ideal fluid flow and stress concentr theori reduc under
the assumpt of axial symmetri to the studi of an
ellipt partial differenti equat dirichlet type problem associ with thi
equat ar studi on region whose boundari includ a nondegener
portion of the x axi and exceedingli accur numer method
ar given for approxim solut cacm june 1964 greenspan d
ca640619 jb march 9 1978 8 55 pm 1048 5
1048 1048 5 1048 1048 5 1048 
# 1049
numer solut of nonlinear two point boundari problem by finit
differ method solut of nonlinear two point boundari valu problem
is often an extrem difficult task quit apart from question
of realiti and uniqu there is no establish numer techniqu
for thi problem at present shoot techniqu ar the easiest
method of attack these problem when these fail the more
difficult method of finit differ can often be us to
obtain a solut thi paper give exampl and discuss the
finit differ method for non linear two point boundari valu
problem cacm june 1964 holt j f ca640618 jb march
9 1978 9 07 pm 1049 4 1049 1049 5
1049 1049 5 1049 1049 5 1049 416 5 1049
# 1050
a part breakdown techniqu us list structur list structur part
breakdown is propos and discuss implement fact ar present on
oper program us these techniqu cacm june 1964 brian w
j ca640617 jb march 9 1978 9 09 pm 1050
4 1050 1050 4 1050 1050 4 1050 1050 4
1050 1050 4 1050 1102 4 1050 1226 4 1050
1393 4 1050 1549 4 1050 1549 4 1050 1935
4 1050 1936 4 1050 378 4 1050 2017 4
1050 2023 4 1050 2032 4 1050 2257 4 1050
2360 4 1050 2451 4 1050 2452 4 1050 441
4 1050 2723 4 1050 2882 4 1050 3008 4
1050 3112 4 1050 627 4 1050 731 4 1050
731 4 1050 758 4 1050 793 4 1050 798
4 1050 106 5 1050 1050 5 1050 1050 5
1050 1050 5 1050 209 5 1050 367 5 1050
627 5 1050 849 5 1050 
# 1051
multiword list item the list concept as origin propos by
newel simon and shaw specifi singl comput word as element
of a list thi report describ the us of two
or more consecut word as on element such us result
in a consider save in both the space requir to
hold a given amount of data and in the execut
time requir to perform a given process on the data
follow a brief descript of standard list structur with singl
word item the multiword item ar introduc then variabl length
item ar describ along with the correspond space util problem
final sever exampl ar given to illustr the us of
multiword list thi paper attempt to draw togeth variou recent
paper which have appli some of these concept in differ
wai and indic how thei relat to the more gener
problem cacm june 1964 comfort w t ca640616 jb march
9 1978 9 15 pm 1024 4 1051 1024 4
1051 1051 4 1051 1051 4 1051 1051 4 1051
1051 4 1051 1051 4 1051 1051 4 1051 1062
4 1051 1098 4 1051 1102 4 1051 1102 4
1051 1132 4 1051 1214 4 1051 1380 4 1051
1388 4 1051 1390 4 1051 1393 4 1051 1485
4 1051 1486 4 1051 1487 4 1051 1549 4
1051 1549 4 1051 1549 4 1051 1552 4 1051
1570 4 1051 1665 4 1051 1706 4 1051 1826
4 1051 1860 4 1051 1878 4 1051 1878 4
1051 1946 4 1051 1957 4 1051 378 4 1051
2060 4 1051 2155 4 1051 2155 4 1051 2168
4 1051 2168 4 1051 2719 4 1051 2723 4
1051 2723 4 1051 2838 4 1051 2842 4 1051
2855 4 1051 2857 4 1051 2879 4 1051 3077
4 1051 3080 4 1051 3106 4 1051 3112 4
1051 627 4 1051 106 4 1051 1051 5 1051
1051 5 1051 1051 5 1051 1211 5 1051 210
5 1051 1549 5 1051 1906 5 1051 378 5
1051 2902 5 1051 406 5 1051 731 5 1051
793 5 1051 794 5 1051 106 6 1051 1051
6 1051 1051 6 1051 1051 6 1051 1051 6
1051 1062 6 1051 1062 6 1051 1184 6 1051
1211 6 1051 1552 6 1051 210 6 1051 1879
6 1051 2435 6 1051 2596 6 1051 2734 6
1051 2747 6 1051 2768 6 1051 406 6 1051
627 6 1051 731 6 1051 753 6 1051 
# 1052
reduc truncat error by program in accumul a sum such
as in a numer integr with a larg number of
interv the sum itself becom much larger than the individu
addend thi mai produc a less accur sum as the
number of interv is increas separ variabl can be establish
as accumul to hold partial sum within variou distinct interv
thu the extens success truncat ar elimin cacm june 1964
wolf j m ca640615 jb march 9 1978 9 22
pm 1052 5 1052 1052 5 1052 1052 5 1052
1328 5 1052 1333 5 1052 2144 5 1052 1052
6 1052 1052 6 1052 1052 6 1052 
# 1053
design and implement of a gener purpos input routin a
gener purpos input routin is discuss and advoc for fortran
the philosophi of such program is examin and exemplifi cacm
june 1964 hassitt a ca640614 jb march 9 1978 9
27 pm 1053 4 1053 1053 4 1053 1053 4
1053 1053 4 1053 720 4 1053 1053 5 1053
1053 5 1053 1053 5 1053 1649 5 1053 435
5 1053 474 5 1053 718 5 1053 720 5
1053 1053 6 1053 
# 1054
gauss seidel algorithm 220 cacm june 1964 batson a p
ca640613 jb march 9 1978 9 28 pm 1054 5
1054 1054 5 1054 1054 5 1054 
# 1055
q bessel function in t algorithm 214 cacm june 1964
simo pereira j m s ca640612 jb march 9 1978
9 29 pm 1055 5 1055 1055 5 1055 1055
5 1055 
# 1056
shellsort algorithm 201 cacm june 1964 batti m a ca640611
jb march 9 1978 9 30 pm 1056 5 1056
1056 5 1056 1056 5 1056 
# 1057
critic path schedul algorithm 40 cacm june 1964 hoffman i
a ca640610 jb march 9 1978 9 32 pm 1057
5 1057 1057 5 1057 1057 5 1057 
# 1058
simpson s rule for multipl integr algorithm 233 cacm june
1964 olynyk f ca640609 jb march 9 1978 9 33
pm 1058 5 1058 1058 5 1058 1058 5 1058
# 1059
heapsort algorithm 232 cacm june 1964 william j w j
ca640608 jb march 9 1978 9 34 pm 1059 5
1059 1059 5 1059 1059 5 1059 2757 5 1059
2844 5 1059 970 6 1059 1059 6 1059 1059
6 1059 2630 6 1059 2742 6 1059 2767 6
1059 
# 1060
matrix invers algorithm 231 cacm june 1964 boothroyd j ca640607
jb march 9 1978 9 35 pm 1060 5 1060
1060 5 1060 1060 5 1060 
# 1061
matrix permut algorithm 230 cacm june 1964 boothroyd j ca640606
jb march 9 1978 9 36 pm 1061 5 1061
1061 5 1061 1061 5 1061 
# 1062
symbol manipul in fortran sasp i subroutin a set of
subroutin for us in fortran ar describ whose purpos is
to synthes output string from i input string which have
been analyz by the shadow gener syntact analysi subroutin report
earlier and or ii pack bcd string form in ani
wai function type subroutin ar includ for intermedi manipul which
ar perform on the string which ar store in an
abbrevi intern represent the automat wai in which an intern
represent for each newli creat substr is store sequenti in
a block of common storag and the manner in which
a storag block is dynam alloc for that purpos ar
discuss cacm june 1964 bailei m j barnett m p
burleson p b ca640605 jb march 9 1978 9 43
pm 1051 4 1062 1062 4 1062 1062 4 1062
1121 4 1062 1139 4 1062 1265 4 1062 1781
4 1062 720 4 1062 759 4 1062 1062 5
1062 1062 5 1062 1062 5 1062 1211 5 1062
2902 5 1062 464 5 1062 794 5 1062 1051
6 1062 1051 6 1062 1062 6 1062 1062 6
1062 1184 6 1062 1211 6 1062 1552 6 1062
1879 6 1062 2435 6 1062 2596 6 1062 2734
6 1062 2747 6 1062 2768 6 1062 
# 1063
on inch perfor paper tape for inform interchang propos american
standard cacm june 1964 ca640604 jb march 9 1978 9
44 pm 1063 5 1063 1063 5 1063 1063 5
1063 
# 1064
perfor tape code for inform interchang propos american standard cacm
june 1964 ca640603 jb march 9 1978 9 46 pm
1064 5 1064 1064 5 1064 1064 5 1064 
# 1065
bit sequenc of the american standard code for inform interchang
ascii in serial by bit data transmiss propos american standard
cacm june 1964 ca640602 jb march 9 1978 9 47
pm 1065 5 1065 1065 5 1065 1065 5 1065
# 1066
grow applic of linear program us of linear program model
ha grown so extens in recent year that the whole
concept for organ a comput code ha undergon a radic
chang it no longer is adequ mere to reduc a
mathemat algorithm i e the simplex method to a comput
code an advanc code must cope with such a varieti
of situat that the respect comput subprogram must be organ
into an integr system emphasi in thi paper is devot
to the underli principl upon which futur linear program system
must be base these viewpoint ar influenc by the new
demand that applic within the petroleum industri ar place on
such system some of the compon of such a system
ar translat of problem statement in term of basic data
to linear program matrix coeffici data transmiss for direct comput
entri data file at the comput center data process and
edit prior to solv the simplex algorithm an effici and
reliabl code for solv the abov mention algorithm and flexibl
mean for summar the result cacm june 1964 aronofski j
s ca640601 jb march 9 1978 9 55 pm 1066
5 1066 1066 5 1066 1066 5 1066 
# 1067
pictur gener with a standard line printer a method is
describ for produc grai tone pictur on a line printer
by util the differ degre of black of standard print
charact grai scale with 17 32 and 64 level have
been devis scan imag of blood cell ar us to
displai the techniqu cacm mai 1964 perri b mendelsohn m
l ca640522 jb march 9 1978 11 31 pm 1067
5 1067 1067 5 1067 1067 5 1067 
# 1068
a fortran ii load time saver cacm mai 1964 ackermann
a f ca640521 jb march 9 1978 11 33 pm
1068 4 1068 1945 4 1068 917 5 1068 1068
5 1068 1068 5 1068 1068 5 1068 
# 1069
a method for compar the intern oper speed of comput
cacm mai 1964 raichelson e collin g ca640520 jb march
9 1978 11 35 pm 1069 5 1069 1069 5
1069 1069 5 1069 1653 5 1069 2989 5 1069
963 6 1069 1069 6 1069 1069 6 1069 1417
6 1069 2138 6 1069 
# 1070
expand a system for input card replic cacm mai 1964
warrington j a norri j h ca640519 jb march 9
1978 11 37 pm 1070 5 1070 1070 5 1070
1070 5 1070 
# 1071
comput usag account for gener time share system the current
develop of gener time share system requir a revis of
account procedur for comput usag sinc time share system user
oper concurr it is necessari to be more precis as
to the amount of comput time and storag space that
a user actual util the variou cost factor which should
be consid for comput usag account in gener time share
system ar discuss cacm mai 1964 rosenberg a m ca640518
jb march 9 1978 11 40 pm 1071 4 1071
1071 5 1071 1071 5 1071 1071 5 1071 3196
5 1071 
# 1072
an improv equival algorithm an algorithm for assign storag on
the basi of equival dimens and common declar is present
the algorithm is base on a tree structur and ha
reduc comput time by 40 percent over a previous publish
algorithm by identifi all equival class with on scan of
the equival declar the method is applic in ani problem
in which it is necessari to identifi equival class given
the element pair defin the equival relat cacm mai 1964
galler b a fisher m j ca640517 jb march 9
1978 11 48 pm 1072 4 1072 1781 4 1072
1072 5 1072 1072 5 1072 1072 5 1072 1646
5 1072 316 5 1072 830 6 1072 987 6
1072 1072 6 1072 1179 6 1072 1647 6 1072
680 6 1072 
# 1073
a fast procedur for gener exponenti random variabl a veri
fast method for gener exponenti random variabl in a digit
comput is outlin cacm mai 1964 maclaren m d marsaglia
g brai t a ca640516 jb march 9 1978 11
50 pm 1073 4 1073 1073 4 1073 1153 4
1073 2137 4 1073 2276 4 1073 940 5 1073
1073 5 1073 1073 5 1073 1073 5 1073 1153
5 1073 2276 5 1073 1073 6 1073 1153 6
1073 
# 1074
shank algorithm 215 cacm mai 1964 schumak l ca640515 jb
march 9 1978 11 51 pm 1074 5 1074 1074
5 1074 1074 5 1074 
# 1075
shuttlesort algorithm 175 cacm mai 1964 juelich o c ca640514
jb march 9 1978 11 52 pm 1075 5 1075
1075 5 1075 1075 5 1075 
# 1076
multipl integr algorithm 146 cacm mai 1964 wirth n ca640513
jb march 9 1978 11 53 pm 1076 5 1076
1076 5 1076 1076 5 1076 
# 1077
chebyshev curv fit algorithm 91 cacm mai 1964 naur p
ca640512 jb march 9 1978 11 53 pm 1077 5
1077 1077 5 1077 1077 5 1077 
# 1078
elementari function by continu fraction algorithm 229 cacm mai 1964
morelock j c ca640511 jb march 9 1978 11 55
pm 1078 5 1078 1078 5 1078 1078 5 1078
# 1079
q bessel function algorithm 228 cacm mai 1964 simo pereira
j m s ca640510 jb march 9 1978 11 56
pm 1079 5 1079 1079 5 1079 1079 5 1079
# 1080
chebyshev polynomi coeffici algorithm 227 cacm mai 1964 cyvin s
j ca640509 jb march 9 1978 11 57 pm 1080
5 1080 1080 5 1080 1080 5 1080 
# 1081
normal distribut function algorithm 226 cacm mai 1964 cyvin s
j ca640508 jb march 9 1978 11 58 pm 1081
5 1081 1081 5 1081 1081 5 1081 1157 5
1081 836 6 1081 1081 6 1081 485 6 1081
714 6 1081 
# 1082
gamma function with control accuraci algorithm 225 cacm mai 1964
cyvin s j cyvin b n ca640507 jb march 9
1978 11 59 pm 1082 5 1082 1082 5 1082
1082 5 1082 
# 1083
an experi in a user orient comput system a version
of a softwar hardwar system for the purpos of facilit
the program and analysi of well formul problem is describ
a modifi flexowrit is us to gener comput accept input
when equat or comput request ar type in much the
same manner as thei would appear in convent mathemat text
the type and languag rule ar quit flexibl and unrestrict
while the compil part is effici the system as a
whole ha much broader aspect as a tool for the
studi of problem solv and self teach system cacm mai
1964 klerer m mai j ca640506 jb march 10 1978
12 03 am 1083 4 1083 1083 4 1083 1083
4 1083 1083 4 1083 1396 4 1083 1396 4
1083 679 4 1083 1083 5 1083 1083 5 1083
1083 5 1083 1396 5 1083 1624 5 1083 407
5 1083 3192 5 1083 3193 5 1083 730 5
1083 964 6 1083 1028 6 1083 1029 6 1083
1083 6 1083 1083 6 1083 1132 6 1083 1214
6 1083 1278 6 1083 1334 6 1083 1365 6
1083 1386 6 1083 1387 6 1083 1388 6 1083
1392 6 1083 1393 6 1083 1394 6 1083 1395
6 1083 1396 6 1083 1397 6 1083 1496 6
1083 284 6 1083 407 6 1083 3199 6 1083
3200 6 1083 3201 6 1083 3202 6 1083 3203
6 1083 3204 6 1083 561 6 1083 730 6
1083 
# 1084
on declar arbitrarili code alphabet the inabl of exist program
languag to handl charact string from more than on or
two alphabet is mention and a scheme for declar addit
alphabet is propos the scheme provid for mani to on
encod right or left justif collat sequenc differ from numer
sequenc variat in charact size number of bit from alphabet
to alphabet and arbitrari sourc languag charact represent cacm mai
1964 shaw c j ca640505 jb march 10 1978 12
13 am 1084 4 1084 1084 4 1084 1084 4
1084 1084 4 1084 1084 4 1084 1084 4 1084
1379 4 1084 1625 4 1084 1945 4 1084 1084
5 1084 1084 5 1084 1084 5 1084 1945 5
1084 603 5 1084 644 5 1084 669 5 1084
791 5 1084 797 5 1084 868 5 1084 823
6 1084 914 6 1084 915 6 1084 917 6
1084 984 6 1084 989 6 1084 990 6 1084
1012 6 1084 1084 6 1084 1098 6 1084 1122
6 1084 1138 6 1084 1139 6 1084 1141 6
1084 1200 6 1084 1223 6 1084 1265 6 1084
1336 6 1084 1396 6 1084 1455 6 1084 1477
6 1084 1487 6 1084 1491 6 1084 1496 6
1084 483 6 1084 584 6 1084 669 6 1084
680 6 1084 763 6 1084 
# 1085
specif for gener purpos paper card for inform process propos
american standard cacm mai 1964 ca640504 jb march 10 1978
12 14 am 1085 5 1085 1085 5 1085 1085
5 1085 
# 1086
a propos for input output convent in algol 60 a
report of the subcommitte on algol of the acm program
languag committe cacm mai 1964 ca640501 jb march 10 1978
12 18 am 1086 4 1086 1086 4 1086 1132
4 1086 1234 4 1086 1263 4 1086 1265 4
1086 1270 4 1086 1323 4 1086 1358 4 1086
1379 4 1086 1380 4 1086 1453 4 1086 1464
4 1086 1484 4 1086 1491 4 1086 1496 4
1086 1498 4 1086 1613 4 1086 1614 4 1086
1781 4 1086 1825 4 1086 1860 4 1086 2083
4 1086 2178 4 1086 2179 4 1086 2252 4
1086 2325 4 1086 2341 4 1086 2546 4 1086
2645 4 1086 2652 4 1086 2684 4 1086 2842
4 1086 2929 4 1086 2934 4 1086 3069 4
1086 669 4 1086 679 4 1086 691 4 1086
761 4 1086 949 4 1086 989 4 1086 1086
5 1086 1086 5 1086 1086 5 1086 1137 5
1086 1613 5 1086 3184 5 1086 987 6 1086
1086 6 1086 1134 6 1086 1453 6 1086 3184
6 1086 
# 1087
problem in automat abstract a varieti of problem concern the
design and oper of an automat abstract system ar discuss
the purpos is to a gener view of sever major
problem area no attempt is made to discuss detail or
to indic prefer among altern solut cacm april 1964 edmundson
h p ca640422 jb march 10 1978 12 21 am
1087 4 1087 634 4 1087 1087 5 1087 1087
5 1087 1087 5 1087 329 5 1087 
# 1088
menu plan by comput a comput code ha been develop
which plan menu by find minimum cost combin of menu
item such that the daili dietari gastronom and product requir
can be satisfi for a sequenc of dai a fast
special integ program algorithm is describ which approxim the theoret
solut to the problem if necessari ani menu can be
chang on line and then post optim up to 30
percent save on food cost is possibl a fortran program
for the ibm 1410 is avail on request a consider
amount of data process must preced the implement of the
system cacm april 1964 balistfi j l ca640421 jb march
10 1978 12 26 am 1088 5 1088 1088 5
1088 1088 5 1088 1658 5 1088 1088 6 1088
# 1089
design a comput center cacm april 1964 denison a popov
g ca640420 jb march 10 1978 12 29 am 1089
5 1089 1089 5 1089 1089 5 1089 
# 1090
incomplet beta function ratio algorithm 222 cacm april 1964 gautschi
w ca640418 jb march 10 1978 12 32 am 1090
5 1090 1090 5 1090 1090 5 1090 
# 1091
hypergeometr and confluent hypergeometr algorithm 191 192 cacm april 1964
thacher jr h c ca640417 jb march 10 1978 12
33 am 1091 5 1091 1091 5 1091 1091 5
1091 
# 1092
nonrecurs adapt integr algorithm 182 cacm april 1964 butler h
s ca640416 jb march 10 1978 12 34 am 1092
5 1092 1092 5 1092 1092 5 1092 1352 5
1092 2093 5 1092 834 6 1092 834 6 1092
872 6 1092 872 6 1092 1040 6 1092 1092
6 1092 1092 6 1092 1241 6 1092 1273 6
1092 1298 6 1092 1573 6 1092 324 6 1092
429 6 1092 429 6 1092 570 6 1092 621
6 1092 786 6 1092 
# 1093
evalu of determin algorithm 224 cacm april 1964 rotenberg l
j ca640415 jb march 10 1978 1 12 am 1093
5 1093 1093 5 1093 1093 5 1093 1946 5
1093 878 6 1093 902 6 1093 1093 6 1093
1177 6 1093 1387 6 1093 1393 6 1093 360
6 1093 731 6 1093 
# 1094
prime twin algorithm 223 cacm april 1964 shimrat m ca640414
jb march 10 1978 1 13 am 1094 5 1094
1094 5 1094 1094 5 1094 
# 1095
decim tabl of binari code tabl cacm april 1964 griebrok
m ca640413 jb march 10 1978 1 14 am 1095
5 1095 1095 5 1095 1095 5 1095 
# 1096
on avoid matrix revers between 7090 fortran ii and 7090
fortran iv cacm april 1964 steven d benson b ca640412
jb march 10 1978 1 28 am 1096 5 1096
1096 5 1096 1096 5 1096 
# 1097
an algorithm for convert integ from base a to base
b a littl known simpl algorithm for integ convers between
number system is present and prove cacm april 1964 gladwin
h t ca640411 jb march 10 1978 1 30 am
1097 5 1097 1097 5 1097 1097 5 1097 
# 1098
a comparison of list process comput languag includ a detail
comparison of comit ipl v lisp 1 5 and slip
a detail comparison is present of comit ipl v lisp
1 5 and slip four well known comput program languag
which among them exhibit all the princip characterist of exist
list process languag import common featur of list process languag
ar review form of data structur which ar manipul necess
for dynam alloc of storag us of pushdown store and
us of recurs oper princip differ between the four languag
under consider ar detail represent of data both by the
programm and within the machin method for storag alloc program
formal and special process avail includ arithmet facil and usabl
in term of avail document learn aid and debug facil
a rough comparison show that all the languag discuss have
approxim the same speed final the author give some heurist
to aid in the select of on of these languag
for us in particular problem applic conclud that no on
of the languag consid is distinctli superior in all possibl
list process applic cacm april 1964 bobrow d g raphael
b ca640410 jb march 10 1978 1 37 am 1024
4 1098 1051 4 1098 1098 4 1098 1214 4
1098 1380 4 1098 1388 4 1098 1393 4 1098
1485 4 1098 1487 4 1098 1549 4 1098 1570
4 1098 1878 4 1098 1946 4 1098 1957 4
1098 2168 4 1098 2723 4 1098 2857 4 1098
3112 4 1098 1098 5 1098 1098 5 1098 1098
5 1098 1570 5 1098 1945 5 1098 2314 5
1098 731 5 1098 823 6 1098 914 6 1098
915 6 1098 917 6 1098 984 6 1098 989
6 1098 990 6 1098 1012 6 1098 1084 6
1098 1098 6 1098 1098 6 1098 1098 6 1098
1122 6 1098 1138 6 1098 1139 6 1098 1141
6 1098 1200 6 1098 1223 6 1098 1265 6
1098 1336 6 1098 1396 6 1098 1455 6 1098
1477 6 1098 1487 6 1098 1491 6 1098 1496
6 1098 1626 6 1098 2082 6 1098 2148 6
1098 483 6 1098 584 6 1098 669 6 1098
680 6 1098 731 6 1098 763 6 1098 
# 1099
profession comput work for the blind develop in comput technolog
have open new profession opportun for the intellig blind sinc
there ar few if ani occup in which the blind
can particip without seriou disadvantag the opportun offer them to
gain entranc into variou occup through comput us includ that
of programm is import for futur rehabilit plan also of
immedi interest is the fact that the blind mai be
especi suit for program work becaus of intens train in
and constant experi with locat object in the unseen environ
and also becaus of superbl train memori the blind bring
to the work of program skill which the sight ha
had littl need to acquir these qualif should result in
fewer debug problem and make the blind a valuabl addit
to ani system group befor the blind could becom a
seriou profession a number of aid and techniqu had to
be develop that can mediat between machin and programm thi
paper describ the techniqu and aid which were design by
the staff of the medic comput center of the univers
of cincinnati colleg of medicin cacm april 1964 sterl t
d lichstein m scarpino f stueb d ca640409 jb march
10 1978 1 46 am 1099 5 1099 1099 5
1099 1099 5 1099 1264 5 1099 1740 5 1099
1099 6 1099 1099 6 1099 
# 1100
statu of comput scienc curricula in colleg and univers cacm
april 1964 atchison w f hamblen j w ca640408 jb
march 10 1978 1 47 am 1100 5 1100 1100
5 1100 1100 5 1100 1107 5 1100 1205 5
1100 1100 6 1100 1100 6 1100 1104 6 1100
1107 6 1100 68 6 1100 
# 1101
the place of logic design and switch theori in the
comput curriculum cacm april 1964 muller d e ca640407 jb
march 10 1978 1 49 am 1101 5 1101 1101
5 1101 1101 5 1101 
# 1102
mechan languag a cours specif cacm april 1964 gorn s
ca640406 jb march 10 1978 1 49 am 249 4
1102 254 4 1102 272 4 1102 1024 4 1102
1050 4 1102 1051 4 1102 1051 4 1102 1102
4 1102 1102 4 1102 1102 4 1102 1102 4
1102 1102 4 1102 1109 4 1102 1132 4 1102
1140 4 1102 1142 4 1102 1188 4 1102 1306
4 1102 1390 4 1102 1464 4 1102 1486 4
1102 1491 4 1102 1549 4 1102 1549 4 1102
1706 4 1102 1767 4 1102 1781 4 1102 1781
4 1102 1787 4 1102 1826 4 1102 1878 4
1102 1945 4 1102 1949 4 1102 321 4 1102
378 4 1102 378 4 1102 2059 4 1102 2060
4 1102 2126 4 1102 2155 4 1102 2168 4
1102 435 4 1102 437 4 1102 463 4 1102
483 4 1102 491 4 1102 2719 4 1102 2723
4 1102 2732 4 1102 2838 4 1102 2842 4
1102 2855 4 1102 2879 4 1102 560 4 1102
583 4 1102 3008 4 1102 3073 4 1102 3077
4 1102 3080 4 1102 3106 4 1102 627 4
1102 627 4 1102 631 4 1102 632 4 1102
642 4 1102 644 4 1102 653 4 1102 680
4 1102 731 4 1102 761 4 1102 762 4
1102 762 4 1102 763 4 1102 798 4 1102
106 4 1102 123 4 1102 140 4 1102 919
4 1102 949 4 1102 989 4 1102 196 5
1102 1102 5 1102 1102 5 1102 1102 5 1102
209 5 1102 210 5 1102 406 5 1102 483
5 1102 
# 1103
logic for the comput scienc cacm april 1964 korfhag r
r ca640405 jb march 10 1978 1 50 am 1103
5 1103 1103 5 1103 1103 5 1103 
# 1104
an undergradu curriculum in numer analysi cacm april 1964 forsyth
g e ca640404 jb march 10 1978 1 51 am
1104 5 1104 1104 5 1104 1104 5 1104 1205
5 1104 1100 6 1104 1104 6 1104 1107 6
1104 68 6 1104 
# 1105
on introduc digit comput cacm april 1964 arden b w
ca640403 jb march 10 1978 1 53 am 1046 4
1105 1105 4 1105 1139 4 1105 1140 4 1105
1234 4 1105 1263 4 1105 1265 4 1105 1496
4 1105 1781 4 1105 1824 4 1105 2126 4
1105 2546 4 1105 464 4 1105 584 4 1105
631 4 1105 653 4 1105 680 4 1105 763
4 1105 795 4 1105 799 4 1105 945 4
1105 1105 5 1105 1105 5 1105 1105 5 1105
404 5 1105 
# 1106
program of digit comput cacm april 1964 perli a j
ca640402 jb march 10 1978 1 54 am 1106 5
1106 1106 5 1106 1106 5 1106 
# 1107
comput and educ cacm april 1964 keenan t a ca640401
jb march 10 1978 1 54 am 1107 4 1107
1205 4 1107 1100 5 1107 1107 5 1107 1107
5 1107 1107 5 1107 1205 5 1107 1100 6
1107 1104 6 1107 1107 6 1107 68 6 1107
# 1108
digit data processor for track the partial illumin moon a
studi of lunar track techniqu and fabric of a breadboard
to assess the feasibl of the best techniqu select wa
conduct to defin a track system for observ of the
sight line to the center of a partial illumin moon
the data process portion of the system is present in
detail and then describ in gener ar the oper of
the tracker head assembl for data readout the oper of
the entir system and the effect data process consider have
on the design of the tracker system the system basic
consist of an optic sensor digit comput and tracker drive
mechan the three system unit connect in cascad compris the
control loop for thi applic an optic telescop with a
radial mechan scan mechan wa us that read out lunar
sight line measur inform thi inform is sequenti read into
a special purpos digit comput that extract the measur and
comput the error signal that drive the tracker to the
appropri attitud cacm march 1964 wilcox h j ca640324 jb
march 10 1978 2 02 am 1108 5 1108 1108
5 1108 1108 5 1108 
# 1109
convers of a power to a seri of chebyshev polynomi
even slowli converg power seri can be rearrang as seri
in chebyshev polynomi if appropri sequenc transform ar us in
evalu the coeffici the method is illustr by comput the
coeffici for the expans of the logarithm and dilogarithm cacm
march 1964 thacher jr h c ca640323 jb march 10
1978 2 05 am 249 4 1109 254 4 1109
272 4 1109 1102 4 1109 1109 4 1109 1140
4 1109 1188 4 1109 1306 4 1109 1464 4
1109 1491 4 1109 1767 4 1109 1781 4 1109
1787 4 1109 1949 4 1109 321 4 1109 2059
4 1109 2126 4 1109 435 4 1109 437 4
1109 463 4 1109 483 4 1109 491 4 1109
2732 4 1109 560 4 1109 583 4 1109 3073
4 1109 627 4 1109 631 4 1109 632 4
1109 642 4 1109 644 4 1109 653 4 1109
680 4 1109 761 4 1109 762 4 1109 763
4 1109 123 4 1109 140 4 1109 919 4
1109 989 4 1109 196 5 1109 1109 5 1109
1109 5 1109 1109 5 1109 
# 1110
a fourier seri method for the numer solut of a
class of parabol partial differenti equat a fourier seri method
is describ which when appli to a certain class of
parabol partial differenti equat reduc the problem to a system
of ordinari differenti equat an applic is given for which
the method show a consider advantag over convent finit differ
method cacm march 1964 forrington c v d ca640322 jb
march 10 1978 2 08 am 1110 5 1110 1110
5 1110 1110 5 1110 
# 1111
a class of iter techniqu for the factor of polynomi
a method of iter is develop in term of a
function of somewhat arbitrari charact suffici condit ar given for
converg of the process yield factor of arbitrari degre for
polynomi in on variabl both lin s method and newton
s method occur as special case cacm march 1964 luther
h a ca640321 jb march 10 1978 2 10 am
1111 4 1111 1111 5 1111 1111 5 1111 1111
5 1111 894 5 1111 
# 1112
a techniqu for comput detect and correct of spell error
the method describ assum that a word which cannot be
found in a dictionari ha at most on error which
might be a wrong miss or extra letter or a
singl transposit the unidentifi input word is compar to the
dictionari again test each time to see if the word
match assum on of these error occur dure a test
run on garbl text correct identif were made for over
95 percent of these error type cacm march 1964 damerau
f j ca640320 jb march 10 1978 2 21 am
1112 4 1112 1592 4 1112 2111 4 1112 2339
4 1112 440 4 1112 1112 5 1112 1112 5
1112 1112 5 1112 1592 5 1112 2111 5 1112
2339 5 1112 619 5 1112 830 6 1112 982
6 1112 1112 6 1112 1112 6 1112 1112 6
1112 1592 6 1112 1592 6 1112 440 6 1112
619 6 1112 619 6 1112 619 6 1112 
# 1113
comput made perspect movi as a scientif and commun tool
it is easi to program the basic transform requir for
a perspect draw thi fact plu the advent of high
speed microfilm printer such as the gener dynam electron s
c 4020 make possibl perspect movi as the direct output
from a comput the program of such a movi is
briefli describ for studi the angular motion of a satellit
contain an attitud control system in the movi a domino
shape box repres the satellit and a sphere with circl
of latitud and longitud repres the earth the cost wa
approxim three to eight minut of ibm 7090 time per
on minut of movi cacm march 1964 zajac e e
ca640319 jb march 10 1978 2 26 am 1113 5
1113 1113 5 1113 1113 5 1113 
# 1114
gener a canon prefix encod comput program for gener a
minimum redund exhaust prefix encod ar describ on program gener
a huffman frequenc tree anoth determin the structur function of
an encod and a third program assign code cacm march
1964 schwartz e s kallick b ca640318 jb march 10
1978 2 28 am 1114 5 1114 1114 5 1114
1114 5 1114 2346 5 1114 2459 5 1114 1114
6 1114 1114 6 1114 
# 1115
random binari search with tree structur a more effici method
of us tree structur is propos which util both plu
and minu branch in the search path veri signific gain
result when the search kei includ alphabet charact cacm march
1964 clampett jr h a ca640317 jb march 10 1978
2 30 am 1115 5 1115 1115 5 1115 1115
5 1115 1935 5 1115 849 6 1115 1115 6
1115 
# 1116
test on a comput method for construct school timet a
previous propos comput method for construct timet base on an
iter involv boolean matric is describ in limit test the
method ha successfulli produc timet on everi trial refer ar
given which relat the timet problem to theorem on matric
of zero and on and to theorem on bipartit graph
some problem of appli the method to construct timet in
real situat ar note cacm march 1964 csima j gotlieb
c c ca640316 jb march 10 1978 2 34 am
1116 5 1116 1116 5 1116 1116 5 1116 1367
5 1116 2772 5 1116 2787 5 1116 1116 6
1116 1116 6 1116 1116 6 1116 1429 6 1116
1429 6 1116 
# 1117
polyphas sort with overlap rewind a variat of the polyphas
merg techniqu of sort is describ which permit on tape
at a time to be rewound while the merg is
continu on the remain tape the result is the overlap
of a major portion of the rewind time the techniqu
should be consid whenev a sort is written to oper
on five or more tape that cannot be read backward
the save of the overlap method appear to increas as
the number of avail tape is increas cacm march 1964
mcalest r l ca640315 jb march 10 1978 2 38
am 1117 4 1117 1117 4 1117 1117 4 1117
2017 4 1117 2017 4 1117 2146 4 1117 2146
4 1117 677 4 1117 860 4 1117 861 4
1117 1117 5 1117 1117 5 1117 1117 5 1117
636 5 1117 862 5 1117 861 5 1117 
# 1118
fortran subroutin for time seri data reduct cacm march 1964
macgowan r a ca640314 jb march 10 1978 2 39
am 1118 4 1118 1118 4 1118 826 4 1118
948 4 1118 942 5 1118 1118 5 1118 1118
5 1118 1118 5 1118 826 5 1118 
# 1119
an open letter to x3 4 3 fortran standard american
associ cacm march 1964 ca640313 jb march 10 1978 2
40 am 1119 5 1119 1119 5 1119 1119 5
1119 
# 1120
alcor group represent of algol symbol comm acm 6 1963
597 599 corrigenda cacm march 1964 ca640312 jb march 10
1978 2 42 am 1120 5 1120 1120 5 1120
1120 5 1120 
# 1121
comment on a continu oper notat thi note is intend
to clarifi and correct sever point in a recent paper
describ some notat for symbol manipul by m barnett comm
acm 6 august 1963 cacm march 1964 barnett m p
gerard j m sambl a w ca640310 jb march 10
1978 2 45 am 1062 4 1121 1121 4 1121
1121 4 1121 1139 4 1121 1265 4 1121 1781
4 1121 659 4 1121 720 4 1121 759 4
1121 964 4 1121 1121 5 1121 1121 5 1121
1121 5 1121 464 5 1121 759 5 1121 
# 1122
a note on some compil algorithm two compil gener for
arithmet express ar discuss on present in us in an
experiment compil and an improv suggest by k speierman of
burrough cacm march 1964 anderson j p ca640309 jb march
10 1978 3 33 am 1122 5 1122 1122 5
1122 1122 5 1122 1551 5 1122 1945 5 1122
823 6 1122 914 6 1122 915 6 1122 917
6 1122 984 6 1122 989 6 1122 990 6
1122 1012 6 1122 1084 6 1122 1098 6 1122
1122 6 1122 1122 6 1122 1138 6 1122 1139
6 1122 1141 6 1122 1200 6 1122 1223 6
1122 1265 6 1122 1336 6 1122 1396 6 1122
1455 6 1122 1477 6 1122 1487 6 1122 1491
6 1122 1496 6 1122 483 6 1122 584 6
1122 669 6 1122 680 6 1122 763 6 1122
# 1123
gauss algorithm 209 cacm march 1964 gladfelt g w ca640308
jb march 10 1978 3 34 am 1123 5 1123
1123 5 1123 1123 5 1123 
# 1124
matrix divis algorithm 197 cacm march 1964 well m ca640307
jb march 10 1978 3 35 am 1124 5 1124
1124 5 1124 1124 5 1124 
# 1125
syminv2 algorithm 150 cacm march 1964 naur p ca640306 jb
march 10 1978 3 36 am 1125 5 1125 1125
5 1125 1125 5 1125 
# 1126
erf algorithm 123 cacm march 1964 barton s p wagner
j f ca640305 jb march 10 1978 3 37 am
1126 5 1126 1126 5 1126 1126 5 1126 1583
5 1126 831 6 1126 967 6 1126 1126 6
1126 707 6 1126 
# 1127
tridiagon matrix algorithm 122 cacm march 1964 naur p ca640304
jb march 10 1978 3 39 am 1127 5 1127
1127 5 1127 1127 5 1127 
# 1128
evalu of determin algorithm 41 cacm march 1964 rotenberg l
j ca640303 jb march 10 1978 3 40 am 1128
5 1128 1128 5 1128 1128 5 1128 1319 5
1128 152 6 1128 1128 6 1128 
# 1129
incomplet beta function ratio algorithm 222 cacm march 1964 gautschi
w ca640302 jb march 10 1978 3 41 am 1129
5 1129 1129 5 1129 1129 5 1129 
# 1130
gamma function althm 221 cacm march 1964 gautschi w ca640301
jb march 10 1978 3 42 am 1023 5 1130
1130 5 1130 1130 5 1130 1130 5 1130 1222
5 1130 1130 6 1130 1130 6 1130 245 6
1130 310 6 1130 
# 1131
on context and ambigu in pars cacm februari 1964 ross
d t ca640212 jb march 10 1978 3 43 am
1131 5 1131 1131 5 1131 1131 5 1131 1781
5 1131 123 6 1131 196 6 1131 919 6
1131 990 6 1131 1007 6 1131 1046 6 1131
1131 6 1131 1139 6 1131 1140 6 1131 1149
6 1131 1198 6 1131 1215 6 1131 1223 6
1131 1265 6 1131 1303 6 1131 1323 6 1131
1358 6 1131 1366 6 1131 1421 6 1131 1460
6 1131 1462 6 1131 1463 6 1131 1467 6
1131 1468 6 1131 1477 6 1131 1491 6 1131
1496 6 1131 1531 6 1131 1535 6 1131 1565
6 1131 1601 6 1131 1602 6 1131 1613 6
1131 1614 6 1131 1626 6 1131 1641 6 1131
1787 6 1131 1788 6 1131 205 6 1131 224
6 1131 249 6 1131 288 6 1131 316 6
1131 381 6 1131 398 6 1131 11 6 1131
404 6 1131 410 6 1131 463 6 1131 464
6 1131 483 6 1131 3184 6 1131 3188 6
1131 584 6 1131 600 6 1131 680 6 1131
691 6 1131 763 6 1131 799 6 1131 
# 1132
an extens to algol for manipul formula cacm februari 1964
perli a j iturriaga r ca640211 jb march 10 1978
3 45 am 1024 4 1132 1051 4 1132 1086
4 1132 1102 4 1132 1132 4 1132 1132 4
1132 1234 4 1132 1263 4 1132 1265 4 1132
1270 4 1132 1323 4 1132 1358 4 1132 1379
4 1132 1380 4 1132 1390 4 1132 1453 4
1132 1464 4 1132 1484 4 1132 1486 4 1132
1491 4 1132 1498 4 1132 1549 4 1132 1613
4 1132 1614 4 1132 1706 4 1132 1781 4
1132 1825 4 1132 1826 4 1132 1860 4 1132
1878 4 1132 378 4 1132 2060 4 1132 2083
4 1132 2155 4 1132 2168 4 1132 2178 4
1132 2179 4 1132 2252 4 1132 2325 4 1132
2341 4 1132 2546 4 1132 2645 4 1132 2652
4 1132 2684 4 1132 2719 4 1132 2723 4
1132 2838 4 1132 2842 4 1132 2842 4 1132
2855 4 1132 2879 4 1132 2929 4 1132 2934
4 1132 3069 4 1132 3077 4 1132 3080 4
1132 3106 4 1132 627 4 1132 669 4 1132
679 4 1132 691 4 1132 761 4 1132 106
4 1132 949 4 1132 989 4 1132 1132 5
1132 1132 5 1132 1132 5 1132 1214 5 1132
210 5 1132 1396 5 1132 3184 5 1132 964
6 1132 1028 6 1132 1029 6 1132 1083 6
1132 1132 6 1132 1132 6 1132 1214 6 1132
1278 6 1132 1334 6 1132 1365 6 1132 1386
6 1132 1387 6 1132 1388 6 1132 1392 6
1132 1393 6 1132 1394 6 1132 1395 6 1132
1396 6 1132 1397 6 1132 1496 6 1132 284
6 1132 407 6 1132 3199 6 1132 3200 6
1132 3201 6 1132 3202 6 1132 3203 6 1132
3204 6 1132 561 6 1132 730 6 1132 731
6 1132 
# 1133
a program packag for some gener mode of arithmet cacm
februari 1964 brooker r a ca640210 jb march 10 1978
3 46 am 1133 5 1133 1133 5 1133 1133
5 1133 
# 1134
some effect of the 6600 comput on languag structur the
problem of compil effici 6600 code prompt the develop of
an intermedi languag reflect the structur of the machin that
is more easili manipul in improv object program effici the
subject of thi paper is the intermedi languag and method
of manipul it compil of a seri of arithmet statement
ar discuss it is assum that all function and exponenti
have been remov from these statement and replac by simpl
variabl for purpos of simplic the treatment of subscript is
ignor a simplifi 6600 structur is present to illustr the
compil method sever assumpt ar made for purpos of simplif
although there ar case in which the assumpt ar violat
in the actual machin cacm februari 1964 allard r w
wolf k a zemlin r a ca640209 jb march 10
1978 3 54 am 1134 4 1134 1134 4 1134
1134 4 1134 1141 4 1134 1179 4 1134 1861
4 1134 364 4 1134 405 4 1134 438 4
1134 561 4 1134 44 4 1134 83 4 1134
1134 5 1134 1134 5 1134 1134 5 1134 1613
5 1134 1947 5 1134 408 5 1134 17 5
1134 77 5 1134 987 6 1134 1086 6 1134
1134 6 1134 1134 6 1134 1223 6 1134 1248
6 1134 1453 6 1134 399 6 1134 3184 6
1134 
# 1135
a gener busi orient languag base on decis express the
structur of a digit comput program languag which cover a
wide class of busi and file process applic is present
such a structur base on identifi and incorpor into a
compil the aspect common to all process of such class
permit write extrem compact program even for compar complex applic
in term of tabl of control express which express onli
inform characterist of the particular applic furthermor local chang of
a process e g chang affect onli on of the
output file involv can be effect by local modif in
the program e g modif of onli on entri of
the tabl thi structur also allow for inexpens prepar of
load speed compil which translat the sourc program into effici
machin code the approach adopt here depart from convent mechan
languag design philosophi it stress the structur analysi of the
class of process to be repres in the languag as
oppos to emphas formal i e content independ syntact definit
it reli exclus on nonprocedur represent of process as set
tabl of relat between data and result there ar no
control statement such as go to etc instead of us
procedur descript which ar on to on translat of flowchart
here an invari pattern of procedur is identifi as characterist
of the class of all batch file process thi new
philosophi ha the potenti to overcom well known defici of
other busi orient languag and fulli meet the requir set
by codasyl for such languag includ machin independ cacm februari
1964 lombardi l a ca640208 jb march 10 1978 4
08 am 1135 4 1135 1136 4 1135 493 4
1135 2710 4 1135 2765 4 1135 2888 4 1135
2906 4 1135 729 4 1135 1135 5 1135 1135
5 1135 1135 5 1135 1959 5 1135 616 5
1135 1135 6 1135 
# 1136
begin of a theori of inform handl cacm februari 1964
steel jr t b ca640207 jb march 10 1978 4
10 am 1135 4 1136 1136 4 1136 1136 4
1136 1136 4 1136 493 4 1136 2710 4 1136
2765 4 1136 2888 4 1136 2906 4 1136 729
4 1136 1136 5 1136 1136 5 1136 1136 5
1136 493 5 1136 616 5 1136 657 5 1136
# 1137
a format languag cacm februari 1964 perli a j ca640206
jb march 10 1978 4 15 am 1086 5 1137
1137 5 1137 1137 5 1137 1137 5 1137 1496
5 1137 1137 6 1137 1137 6 1137 1141 6
1137 404 6 1137 3184 6 1137 
# 1138
formal in program languag cacm februari 1964 iverson k e
ca640205 jb march 10 1978 4 24 am 1138 5
1138 1138 5 1138 1138 5 1138 1945 5 1138
823 6 1138 914 6 1138 915 6 1138 917
6 1138 984 6 1138 989 6 1138 990 6
1138 1012 6 1138 1084 6 1138 1098 6 1138
1122 6 1138 1138 6 1138 1139 6 1138 1141
6 1138 1200 6 1138 1223 6 1138 1265 6
1138 1336 6 1138 1396 6 1138 1455 6 1138
1477 6 1138 1487 6 1138 1491 6 1138 1496
6 1138 483 6 1138 584 6 1138 669 6
1138 680 6 1138 763 6 1138 
# 1139
fortran iv as a syntax languag cacm februari 1964 leavenworth
b m ca640204 jb march 10 1978 4 53 am
267 4 1139 1046 4 1139 1062 4 1139 1105
4 1139 1121 4 1139 1139 4 1139 1139 4
1139 1139 4 1139 1139 4 1139 1139 4 1139
1139 4 1139 1140 4 1139 1141 4 1139 1215
4 1139 1223 4 1139 1234 4 1139 1263 4
1139 1265 4 1139 1265 4 1139 1265 4 1139
1496 4 1139 1647 4 1139 1665 4 1139 1781
4 1139 1781 4 1139 1781 4 1139 1787 4
1139 1792 4 1139 1824 4 1139 1947 4 1139
364 4 1139 2126 4 1139 405 4 1139 2546
4 1139 438 4 1139 464 4 1139 556 4
1139 584 4 1139 3185 4 1139 631 4 1139
653 4 1139 680 4 1139 720 4 1139 759
4 1139 763 4 1139 763 4 1139 763 4
1139 795 4 1139 799 4 1139 799 4 1139
945 4 1139 1139 5 1139 1139 5 1139 1139
5 1139 224 5 1139 1612 5 1139 1781 5
1139 1945 5 1139 399 5 1139 404 5 1139
438 5 1139 464 5 1139 631 5 1139 823
6 1139 123 6 1139 196 6 1139 914 6
1139 915 6 1139 917 6 1139 919 6 1139
984 6 1139 989 6 1139 990 6 1139 990
6 1139 1007 6 1139 1012 6 1139 1046 6
1139 1084 6 1139 1098 6 1139 1122 6 1139
1131 6 1139 1138 6 1139 1139 6 1139 1139
6 1139 1139 6 1139 1140 6 1139 1141 6
1139 1149 6 1139 1198 6 1139 1200 6 1139
1215 6 1139 1223 6 1139 1223 6 1139 1265
6 1139 1265 6 1139 1303 6 1139 1323 6
1139 1336 6 1139 1358 6 1139 1366 6 1139
1396 6 1139 1421 6 1139 1455 6 1139 1460
6 1139 1462 6 1139 1463 6 1139 1467 6
1139 1468 6 1139 1477 6 1139 1477 6 1139
1487 6 1139 1491 6 1139 1491 6 1139 1496
6 1139 1496 6 1139 1531 6 1139 1535 6
1139 1565 6 1139 1601 6 1139 1602 6 1139
1613 6 1139 1614 6 1139 1626 6 1139 1641
6 1139 1787 6 1139 1788 6 1139 205 6
1139 224 6 1139 249 6 1139 288 6 1139
316 6 1139 381 6 1139 398 6 1139 11
6 1139 404 6 1139 410 6 1139 463 6
1139 464 6 1139 483 6 1139 483 6 1139
3184 6 1139 3188 6 1139 584 6 1139 584
6 1139 600 6 1139 669 6 1139 680 6
1139 680 6 1139 691 6 1139 763 6 1139
763 6 1139 799 6 1139 
# 1140
structur connect in formal languag cacm februari 1964 iron e
t ca640203 jb march 10 1978 4 55 am 249
4 1140 254 4 1140 272 4 1140 1046 4
1140 1102 4 1140 1105 4 1140 1109 4 1140
1139 4 1140 1140 4 1140 1140 4 1140 1188
4 1140 1234 4 1140 1263 4 1140 1265 4
1140 1306 4 1140 1464 4 1140 1491 4 1140
1496 4 1140 1767 4 1140 1781 4 1140 1781
4 1140 1787 4 1140 1824 4 1140 1949 4
1140 321 4 1140 2059 4 1140 2126 4 1140
2126 4 1140 2546 4 1140 435 4 1140 437
4 1140 463 4 1140 464 4 1140 483 4
1140 491 4 1140 2732 4 1140 560 4 1140
583 4 1140 584 4 1140 3073 4 1140 627
4 1140 631 4 1140 631 4 1140 632 4
1140 642 4 1140 644 4 1140 653 4 1140
653 4 1140 680 4 1140 680 4 1140 761
4 1140 762 4 1140 763 4 1140 763 4
1140 795 4 1140 799 4 1140 123 4 1140
140 4 1140 919 4 1140 945 4 1140 989
4 1140 196 5 1140 1140 5 1140 1140 5
1140 1140 5 1140 1491 5 1140 1781 5 1140
2061 5 1140 404 5 1140 123 6 1140 196
6 1140 196 6 1140 919 6 1140 990 6
1140 1007 6 1140 1046 6 1140 1131 6 1140
1139 6 1140 1140 6 1140 1140 6 1140 1140
6 1140 1141 6 1140 1149 6 1140 1198 6
1140 1215 6 1140 1223 6 1140 1265 6 1140
1303 6 1140 1303 6 1140 1323 6 1140 1358
6 1140 1366 6 1140 1421 6 1140 1460 6
1140 1462 6 1140 1463 6 1140 1467 6 1140
1468 6 1140 1477 6 1140 1477 6 1140 1491
6 1140 1491 6 1140 1496 6 1140 1531 6
1140 1535 6 1140 1565 6 1140 1601 6 1140
1602 6 1140 1613 6 1140 1614 6 1140 1626
6 1140 1641 6 1140 1787 6 1140 1788 6
1140 205 6 1140 1825 6 1140 224 6 1140
249 6 1140 288 6 1140 316 6 1140 381
6 1140 398 6 1140 11 6 1140 404 6
1140 410 6 1140 463 6 1140 464 6 1140
483 6 1140 3184 6 1140 3184 6 1140 3188
6 1140 584 6 1140 600 6 1140 680 6
1140 691 6 1140 729 6 1140 763 6 1140
773 6 1140 799 6 1140 
# 1141
bound context syntact analysi cacm februari 1964 floyd r w
ca640202 jb march 10 1978 4 56 am 267 4
1141 1134 4 1141 1139 4 1141 1141 4 1141
1141 4 1141 1215 4 1141 1223 4 1141 1647
4 1141 1781 4 1141 1787 4 1141 1792 4
1141 364 4 1141 364 4 1141 405 4 1141
405 4 1141 438 4 1141 438 4 1141 561
4 1141 44 4 1141 763 4 1141 1141 5
1141 1141 5 1141 1141 5 1141 224 5 1141
1496 5 1141 1683 5 1141 1768 5 1141 1787
5 1141 1945 5 1141 2061 5 1141 77 5
1141 823 6 1141 196 6 1141 914 6 1141
915 6 1141 917 6 1141 984 6 1141 989
6 1141 990 6 1141 1012 6 1141 1084 6
1141 1098 6 1141 1122 6 1141 1137 6 1141
1138 6 1141 1139 6 1141 1140 6 1141 1141
6 1141 1141 6 1141 1141 6 1141 1141 6
1141 1141 6 1141 1141 6 1141 1200 6 1141
1215 6 1141 1223 6 1141 1265 6 1141 1265
6 1141 1336 6 1141 1396 6 1141 1455 6
1141 1477 6 1141 1477 6 1141 1487 6 1141
1491 6 1141 1491 6 1141 1491 6 1141 1491
6 1141 1496 6 1141 1496 6 1141 1781 6
1141 1781 6 1141 1825 6 1141 224 6 1141
404 6 1141 483 6 1141 584 6 1141 669
6 1141 680 6 1141 763 6 1141 763 6
1141 773 6 1141 799 6 1141 
# 1142
an extens of algol like languag cacm februari 1964 rose
g f ca640201 jb march 10 1978 4 57 am
1102 4 1142 1142 4 1142 1781 4 1142 1945
4 1142 762 4 1142 949 4 1142 1142 5
1142 1142 5 1142 1142 5 1142 483 5 1142
# 1143
analysi of decai type data a compar studi ha been
made of a varieti of numer techniqu for fit experiment
data of the decai type by form involv the sum
of exponenti statist error of the fit paramet ar also
calcul these method have been appli to artifici gener set
of data as well as to the result of experi
with radioact tracer on both human and anim subject result
show that the valu of the fit paramet ar veri
sensit to variat in the fit procedur therefor great care
veri sensit to variat in the fit procedur therefor great
care must be exercis in identifi such valu with physic
constant although the valu of function deriv from these fit
paramet which can definit be associ with physic entiti ar
gener more stabl under variat in the fit techniqu error
bound can be so larg that no great confid can
be place even in them it would therefor appear best
to select a uniform techniqu both for run the experi
and for analyz the data and then to consid as
signific onli rel result between on subject and the next
cacm januari 1964 worslei b h ca640112 jb march 10
1978 5 11 am 1143 5 1143 1143 5 1143
1143 5 1143 
# 1144
digit comput determin of alpha sourc activ a techniqu is
describ for determin the activ and homogen of an alpha
sourc it is believ that the techniqu us a digit
comput ha mani us and applic in the field of
nuclear physic the techniqu involv comput manipul of the digit
imag of the nuclear sourc experiment detail ar given cacm
januari 1964 robbin d taylor w e ca640111 jb march
10 1978 5 14 am 1144 5 1144 1144 5
1144 1144 5 1144 
# 1145
git a heurist program for test pair of direct line
graph for isomorph given a pair of direct line graph
the problem of ascertain whether or not thei ar isomorph
is on for which no effici algorithm solut is known
sinc a straightforward enum algorithm might requir 40 year of
run time on a veri high speed comput in order
to compar two 15 node graph a more sophist approach
seem call for the situat is similar to that prevail
in area such as game plai and theorem prove where
practic algorithm ar unknown for the interest case but where
variou practic though onli partial success techniqu ar avail git
graph isomorph tester incorpor a varieti of process that attempt
to narrow down the search for an isomorph or to
demonstr that none exist no on scheme is reli upon
exclus for a solut and the program is design to
avoid excess comput along fruitless line git ha been written
in the comit languag and successfulli test on the ibm
7090 cacm januari 1964 unger s h ca640110 jb march
10 1978 5 24 am 1145 4 1145 1145 5
1145 1145 5 1145 1145 5 1145 1504 5 1145
3040 5 1145 655 5 1145 1145 6 1145 1145
6 1145 
# 1146
an effici composit formula for multidimension quadratur a 2s 1
point second degre quadratur formula for integr over an s
dimension hyper rectangl is present all but on of the
point lie on the surfac with weight of opposit sign
attach to point on opposit face when a larg volum
is subdivid into congruent rectangular subdivis onli on point is
requir in each interior subdivis to achiev second degre accuraci
cacm januari 1964 thacher jr h c ca640109 jb march
10 1978 5 28 am 1146 4 1146 1146 5
1146 1146 5 1146 1146 5 1146 386 5 1146
# 1147
on the numer solut of boundari valu problem for linear
ordinari differenti equat a numer method is present for the
solut of boundari valu problem involv linear ordinari differenti equat
the method describ is nonit and make us of ani
on step numer integr scheme to reduc the problem from
on of boundari valu to on of initi valu comment
ar made concern some numer result of appli the method
to a specif problem in addit an extens of the
algorithm describ to more gener problem is discuss cacm januari
1964 dai j t collin ii g w ca640108 jb
march 10 1978 5 32 am 1147 5 1147 1147
5 1147 1147 5 1147 1274 5 1147 1147 6
1147 
# 1148
an exampl in signific digit arithmet differ method of handl
the sum process for the geometr seri ar shown to
give result indic wide differ signific when carri out in
a machin incorpor signific digit arithmet cacm januari 1964 miller
r h ca640107 jb march 10 1978 5 34 am
1148 4 1148 1148 5 1148 1148 5 1148 1148
5 1148 85 5 1148 3131 5 1148 893 6
1148 1148 6 1148 
# 1149
gargoyl a languag for compil write cacm januari 1964 garwick
j v ca640106 jb march 10 1978 5 35 am
1149 5 1149 1149 5 1149 1149 5 1149 1781
5 1149 123 6 1149 196 6 1149 919 6
1149 990 6 1149 1007 6 1149 1046 6 1149
1131 6 1149 1139 6 1149 1140 6 1149 1149
6 1149 1198 6 1149 1215 6 1149 1223 6
1149 1265 6 1149 1303 6 1149 1323 6 1149
1358 6 1149 1366 6 1149 1421 6 1149 1460
6 1149 1462 6 1149 1463 6 1149 1467 6
1149 1468 6 1149 1477 6 1149 1491 6 1149
1496 6 1149 1531 6 1149 1535 6 1149 1565
6 1149 1601 6 1149 1602 6 1149 1613 6
1149 1614 6 1149 1626 6 1149 1641 6 1149
1787 6 1149 1788 6 1149 205 6 1149 224
6 1149 249 6 1149 288 6 1149 316 6
1149 381 6 1149 398 6 1149 11 6 1149
404 6 1149 410 6 1149 463 6 1149 464
6 1149 483 6 1149 3184 6 1149 3188 6
1149 584 6 1149 600 6 1149 680 6 1149
691 6 1149 763 6 1149 799 6 1149 
# 1150
a fortran post mortem procedur cacm januari 1964 kahan w
leppik j j ca640104 jb march 10 1978 5 37
am 1150 5 1150 1150 5 1150 1150 5 1150
# 1151
a note on multipli boolean matric ii cacm januari 1964
comstock d r ca640103 jb march 10 1978 5 38
am 1151 4 1151 1265 4 1151 2769 4 1151
1151 5 1151 1151 5 1151 1151 5 1151 635
5 1151 
# 1152
float point arithmet with 84 bit number a classic and
straightforward techniqu is present which is not limit to the
size or type of number represent us or multipl precis
arithmet cacm januari 1964 gregori r t ranei j l
ca640102 jb march 10 1978 5 41 am 1152 5
1152 1152 5 1152 1152 5 1152 1294 5 1152
1152 6 1152 
# 1153
a fast procedur for gener normal random variabl a techniqu
for gener normal distribut random number is describ it is
faster than those current in gener us and is readili
applic to both binari and decim comput cacm januari 1964
marsaglia g maclaren m d brai t a ca640101 jb
march 10 1978 5 43 am 1073 4 1153 1153
4 1153 940 5 1153 1073 5 1153 1153 5
1153 1153 5 1153 1153 5 1153 2137 5 1153
2276 5 1153 940 6 1153 1073 6 1153 1153
6 1153 1153 6 1153 1153 6 1153 
# 1154
multi tape and infinit state automata a survei a survei
of machin which ar more power than finit automata and
less power than gener ture machin is present it is
felt that the machin in thi categori ar as close
relat to digit comput as either the finit automata or
the unrestrict ture machin intermedi machin can be creat by
adjoin on infinit state memori to a finit state machin
and then perform ani or all of the follow 1
restrict the manner in which the unbound portion of the
memori can be access 2 bound the number of step
allow for a comput by some increas recurs function of
the length of the input 3 restrict the total amount
of memori avail in the same manner exampl from all
three class and their properti ar discuss cacm decemb 1965
fischer p c ca651215 jb march 6 1978 3 24
pm 1154 5 1154 1154 5 1154 1154 5 1154
# 1155
experi with a deduct question answer program as an investig
in artifici intellig comput experi on deduct question answer were
run with a lisp program call deducom an acronym for
deduct commun when given 68 fact deducom answer 10 question
answer from the fact a fact tell deducom either some
specif inform or a method of answer a gener kind
of question some conclus drawn in the articl ar 1
deducom can answer a wide varieti of question 2 a
human can increas the deduct power of deducom by tell
it more fact 3 deducom can write veri simpl program
it is hope that thi abil is the forerunn of
an abil to self program which is a wai to
learn 4 deducom s search procedur at present ha two
bad defect some question answer from the given fact cannot
be answer and some other answer question can be answer
onli if the relev fact ar given in the right
order 6 at present deducom s method of make logic
deduct in predic calculu ha two bad defect some fact
have to be chang to logic equival on befor be
given to deducom and some redund fact have to be
given to deducom cacm decemb 1965 slagl j r ca651214
jb march 6 1978 3 34 pm 1155 4 1155
1456 4 1155 1468 4 1155 1515 4 1155 1699
4 1155 1856 4 1155 2127 4 1155 1155 5
1155 1155 5 1155 1155 5 1155 1324 5 1155
1515 5 1155 2096 5 1155 2127 5 1155 2210
5 1155 1155 6 1155 1155 6 1155 1155 6
1155 1155 6 1155 1324 6 1155 1324 6 1155
1487 6 1155 1527 6 1155 1781 6 1155 1856
6 1155 
# 1156
hankel function algorithm 124 s17 cacm decemb 1965 reilli g
a ca651213 jb march 6 1978 3 35 pm 1156
5 1156 1156 5 1156 1156 5 1156 
# 1157
procedur for the normal distribut function algorithm 272 s15 cacm
decemb 1965 maclaren m d ca651212 jb march 6 1978
3 37 pm 1157 4 1157 1157 4 1157 1157
4 1157 1157 4 1157 1779 4 1157 1920 4
1157 1944 4 1157 1987 4 1157 2548 4 1157
1081 5 1157 1157 5 1157 1157 5 1157 1157
5 1157 485 5 1157 714 5 1157 836 5
1157 
# 1158
program structur for parallel process construct for organ and explic
parallel program segment ar discuss as extens to algol 60
the construct serv as meta command and ar motiv by
equip have multiprocess capabl cacm decemb 1965 anderson j p
ca651211 jb march 6 1978 3 39 pm 1158 4
1158 1158 5 1158 1158 5 1158 1158 5 1158
1262 5 1158 
# 1159
machin independ it technolog and econom a survei is offer
of techniqu for transfer program and especi compil from on
comput to anoth of the method examin the bootstrap techniqu
is singl out for detail discuss with emphasi on it
econom the consider that determin the applic of bootstrap in
ani specif case ar discuss and an attempt is made
to assign appropri qualit weight to them final reason ar
given for believ that the machin independ problem is be
substanti diminish by current trend in comput design and that
it is thi process of converg in hardwar design rather
than ani forese softwar develop that will lead to it
satisfactori resolut cacm decemb 1965 halpern m i ca651210 jb
march 6 1978 3 44 pm 1159 4 1159 1988
4 1159 381 4 1159 1159 5 1159 1159 5
1159 1159 5 1159 14 5 1159 
# 1160
cat a 7090 3600 comput aid translat a semi automat
translat system ha been implement which convert 7090 fap languag
program into 3600 assembl languag the input to the system
is a fap program deck which ha been special prepar
for translat by the user the output consist of the
translat compass languag program togeth with a comprehens diagnost list
which the user must analyz in order to verifi ani
question area of the translat the translat processor consist of
three distinct phase an assembl of the fap program a
comprehens analysi of the assembl code with particular regard to
the action of instruct upon other instruct and upon data
and final the output pass which gener the compass program
in the form of macro instruct cacm decemb 1965 wilson
d m moss d j ca651209 jb march 6 1978
3 50 pm 1160 4 1160 2034 4 1160 1160
5 1160 1160 5 1160 1160 5 1160 1231 5
1160 
# 1161
1401 compat featur on the ibm system 360 model 30
the second gener of store program comput of which ibm
1400 seri wa a part brought edp into the mass
market for the first time on a larg scale as
thi era unfold rapid chang in technolog led to rapid
obsolesc of data process equip program written for a particular
system requir tediou convers as incompat new machin came into
us the ibm system 360 ha been design with the
convers problem specif in mind on of the convers aid
avail on the model 30 is the 1401 compat featur
thi featur in conjunct with other aid permit a smooth
and inexpens transit to optimum us of the new system
cacm decemb 1965 mccormack m a schansman t t womack
k k ca651208 jb march 6 1978 3 55 pm
1161 5 1161 1161 5 1161 1161 5 1161 
# 1162
an assembl languag for reprogram complet reprogram of compil languag
program is seldom necessari it is assembl languag program which
present the greatest difficulti assembl languag gener provid a on
for on translat from a symbol to a numer version
of a program that is from assembl languag to machin
languag the meta languag present here can be us to
specifi the map of ani languag which conform to a
canon list form into an arbitrari stream of bit thi
bit stream mai be treat as a machin languag program
a charact stream or whatev els the user might desir
thu thi meta languag can be us to map from
on assembl languag into anoth or from the assembl languag
for on machin into the machin languag of anoth cacm
decemb 1965 graham m l ingerman p z ca651207 jb
march 6 1978 4 01 pm 1162 5 1162 1162
5 1162 1162 5 1162 1565 5 1162 1162 6
1162 1358 6 1162 1455 6 1162 205 6 1162
# 1163
philco ibm translat at problem orient symbol and binari level
a translat system ha been develop to elimin most of
the effort formerli requir to reprogram philco 2000 seri code
for ibm 7094 oper experi with thi system is limit
but highli success encourag applic of the techniqu to other
sourc and object languag cacm decemb 1965 olsen t m
ca651206 jb march 6 1978 4 05 pm 1163 5
1163 1163 5 1163 1163 5 1163 
# 1164
emul of larg system the convers problem and a new
techniqu call emul ar discuss the techniqu of emul is
develop and includ section on both the central process unit
cpu and the input output unit i o thi gener
treatment is follow by three section that describ in greater
detail the implement of compat featur us the emul techniqu
for the ibm 7074 7080 and 7090 system on ibm
system 360 cacm decemb 1965 tucker s g ca651205 jb
march 6 1978 4 09 pm 1164 5 1164 1164
5 1164 1164 5 1164 
# 1165
the spectra 70 45 emul for the rca 301 the
rca 301 emul system is suppli with the spectra 70
45 as a reprogram aid it allow an rca 301
object program to be run on the spectra 70 45
without necessit chang in the rca 301 object code execut
rate ar consider better than tradit simul the emul provid
an increas in throughput capac for the 301 user on
the spectra 70 45 the emul make us of both
hardwar micro program routin and softwar routin to accomplish it
function cacm decemb 1965 benjamin r i ca651204 jb march
6 1978 4 15 pm 1165 5 1165 1165 5
1165 1165 5 1165 
# 1166
a us of macro in translat of symbol assembl languag
of on comput to anoth a set of macro oper
ha been prepar to assist in translat ibm 7090 symbol
assembl languag program to ibm 7040 machin languag program thi
set insert at the begin of the 7090 symbol deck
treat incompat instruct mnemon as macro instruct to produc equival
7040 instruct set incompat instruct ar categor into basic oper
class which can be express by a singl basic skeleton
sever level of macro call ar requir to suppli argument
to the basic skeleton for each particular instruct modif at
execut time of the address or tag of an incompat
instruct requir incorpor of an address tag equival i o
is handl by gener call to i o simul subroutin
cacm decemb 1965 dellert jr g t ca651203 jb march
6 1978 4 20 pm 1166 5 1166 1166 5
1166 1166 5 1166 
# 1167
on the translat of machin languag program automat translat of
machin languag program is becom a highli desir goal with
the advent of new larg scale comput the pitfal that
make it difficult to achiev complet automat translat ar analyz
and it is shown that these ar primarili of a
semant natur a semi automat procedur for resolv semant problem
is suggest cacm decemb 1965 gain r s ca651202 jb
march 6 1978 4 23 pm 1167 5 1167 1167
5 1167 1167 5 1167 
# 1168
across machin line in cobol the product of a larg
file mainten and retriev program system written in cobol is
describ the cobol languag wa us specif to enabl the
system to oper on three ibm comput cacm decemb 1965
frederick d s warburtin c r ca651201 jb march 6
1978 4 26 pm 1168 5 1168 1168 5 1168
1168 5 1168 
# 1169
an algorithm for minim backboard wire function a partial exhaust
algorithm is present for solv the follow problem aris from
automat layout of a comput given an order set e1
e2 en of n comput compon for each permut of
the element e1 e2 en there is attach a valu
of an integ function f the algorithm find a local
minimum of f by evalu the set delta f of
the increment correspond to a certain set of exchang of
two elementshen the exchang correspond to the least neg increment
of delta f is perform the process is iter and
stop when the set of the increment is a posit
or empti set which it is prove correspond to a
minimum the procedur is similar to the downhil method for
find the minimum of a real function f p and
can be appli to other placement problem experiment result ar
present with backboard form by mani element and differ initi
placement cacm novemb 1965 pomental t ca651112 jb march 6
1978 4 35 pm 1169 5 1169 1169 5 1169
1169 5 1169 
# 1170
analyz english syntax with a pattern learn parser a depend
analysi system base on pattern recognit and learn logic wa
develop to infer word class and rule of syntact combin
from experi with text which had been analyz the characterist
us to form word class ar the depth in the
depend tree of each word the direct of it governor
and the same featur for each of it immedi neighbor
syntact rule of combin show the relat of a word
to it governor in the depth pattern of the sentenc
the system wa test on 400 elementari basic english sentenc
includ 300 us earlier by knowlton in a differ learn
parser of all 400 sentenc after experi with 300 sentenc
it wa abl to gener with 77 percent accuraci to
the next 100 in accumul learn trial after the first
200 sentenc it averag a probabl of 9 for accur
pars each new sentenc it encount it wa conclud that
the system is adequ for learn to pars the bulk
of basic english but that further develop is requir befor
conclus about it applic to ordinari english can be store
the system is oper and avail on the arpa sdc
time share comput system cacm novemb 1965 mcconlogu k simmon
r f ca651111 jb march 6 1978 4 45 pm
1170 5 1170 1170 5 1170 1170 5 1170 
# 1171
a comparison of the primal simplex and primal dual algorithm
for linear program a statist comparison of the primal dual
and the more commonli us primal simplex algorithm for solv
linear program problem ha been made under the assumpt of
start with a full artifici basi under these condit the
primal dual method show a statist signific superior on randomli
gener problem it ha also been found via a regress
analysi that the relev paramet in determin the differ in
the number of iter between the algorithm is not onli
the number of constraint and the number of variabl but
also the ratio of the latter to the former cacm
novemb 1965 mueller r k cooper l ca651110 jb march
6 1978 4 50 pm 1171 5 1171 1171 5
1171 1171 5 1171 
# 1172
convers of limit entri decis tabl to comput program decis
tabl ar us for describ a set of complex decis
rule base on given set of condit algorithm that can
effici convert the tabl into comput program will extend the
us of decis tabl to comput user two such algorithm
base on work done by m s montalbano ar describ
and extend here to handl dash and els decis rule
the first algorithm minim the comput storag space requir for
the result program the second minim comput run time dure
the convers process both pinpoint ani contradict or redund among
the rule in a tabl cacm novemb 1965 pollack s
l ca651109 jb march 6 1978 4 56 pm 1172
5 1172 1172 5 1172 1172 5 1172 1354 5
1172 2053 5 1172 2220 5 1172 2273 5 1172
2453 5 1172 2598 5 1172 2726 5 1172 2856
5 1172 1172 6 1172 1172 6 1172 1172 6
1172 1172 6 1172 1172 6 1172 1172 6 1172
1172 6 1172 1172 6 1172 1237 6 1172 1237
6 1172 1237 6 1172 1237 6 1172 1327 6
1172 1327 6 1172 1327 6 1172 1327 6 1172
1327 6 1172 1327 6 1172 1354 6 1172 1354
6 1172 1354 6 1172 1354 6 1172 1354 6
1172 1354 6 1172 1488 6 1172 1489 6 1172
1489 6 1172 1548 6 1172 1548 6 1172 1548
6 1172 1684 6 1172 250 6 1172 2053 6
1172 2053 6 1172 2053 6 1172 2220 6 1172
2220 6 1172 2220 6 1172 2220 6 1172 2220
6 1172 2221 6 1172 2263 6 1172 2263 6
1172 2453 6 1172 2453 6 1172 2598 6 1172
2691 6 1172 753 6 1172 
# 1173
the perform of a system for automat segment of program
within an algol compil gier algol the gier algol compil
make us of an automat system for handl the transfer
of program segment from the drum store to the core
store at program execut time the logic of thi system
is describ the perform of the system is discuss primarili
on the basi of execut time relat to two specif
program thi discuss conclud with an assess of the potenti
gain of variou wai of improv the system cacm novemb
1965 naur p ca651108 jb march 6 1978 5 00
pm 1173 4 1173 1188 4 1173 1173 5 1173
1173 5 1173 1173 5 1173 1774 5 1173 2343
5 1173 642 5 1173 800 6 1173 1173 6
1173 1173 6 1173 1774 6 1173 1845 6 1173
271 6 1173 
# 1174
invers permut algorithm 250 g6 cacm novemb 1965 medlock c
w ca651107 jb march 6 1978 5 01 pm 1174
5 1174 1174 5 1174 1174 5 1174 
# 1175
quickersort algorithm 271 m1 cacm novemb 1965 scowen r s
ca651106 jb march 6 1978 5 02 pm 1175 4
1175 1175 4 1175 1919 4 1175 1919 4 1175
1969 4 1175 1997 4 1175 2017 4 1175 2041
4 1175 2191 4 1175 2216 4 1175 2388 4
1175 2679 4 1175 3054 4 1175 3121 4 1175
1175 5 1175 1175 5 1175 1175 5 1175 1919
5 1175 1969 5 1175 308 5 1175 2118 5
1175 2348 5 1175 2679 5 1175 3054 5 1175
864 5 1175 864 6 1175 970 6 1175 1175
6 1175 1175 6 1175 1175 6 1175 1175 6
1175 1175 6 1175 1175 6 1175 1190 6 1175
1228 6 1175 1880 6 1175 1919 6 1175 1969
6 1175 1969 6 1175 1980 6 1175 1997 6
1175 1997 6 1175 307 6 1175 308 6 1175
308 6 1175 308 6 1175 308 6 1175 309
6 1175 309 6 1175 2017 6 1175 2042 6
1175 2679 6 1175 74 6 1175 3187 6 1175
3187 6 1175 507 6 1175 716 6 1175 776
6 1175 783 6 1175 
# 1176
find eigenvector by gaussian elimin algorithm 270 f2 cacm novemb
1965 newhous a ca651105 jb march 6 1978 5 03
pm 1176 5 1176 1176 5 1176 1176 5 1176
# 1177
determin evalu algorithm 269 f3 cacm novemb 1965 pfann j
ca651104 jb march 6 1978 5 05 pm 1177 4
1177 806 4 1177 1177 5 1177 1177 5 1177
1177 5 1177 1931 5 1177 1946 5 1177 454
5 1177 878 6 1177 902 6 1177 1093 6
1177 1177 6 1177 1177 6 1177 1387 6 1177
1393 6 1177 311 6 1177 360 6 1177 731
6 1177 
# 1178
algol 60 refer languag editor algorithm 268 r2 cacm novemb
1965 mckeeman w m ca651103 jb march 6 1978 5
06 pm 1178 5 1178 1178 5 1178 1178 5
1178 
# 1179
pufft the purdu univers fast fortran translat a core resid
compil and go system design for the ibm 7090 7094
comput is describ in littl more than half of the
32k word core memori pufft provid a monitor for job
sequenc a translat for the full fortran iv languag the
fortran subroutin librari an input output system for us at
compil time and at execut time and a rather elabor
diagnost messag write routin batch of small and medium size
fortran iv sourc languag program ar process at veri high
speed languag compat ha been maintain so that program mai
be debug in the pufft system and then recompil and
run in the ibjob ibftc system suppli by the manufactur
cacm novemb 1965 rosen s spurgeon a donnelli j k
ca651102 jb march 6 1978 6 17 pm 1134 4
1179 1179 4 1179 1179 4 1179 1288 4 1179
1544 4 1179 1646 4 1179 1861 4 1179 2111
4 1179 2534 4 1179 2556 4 1179 2650 4
1179 1179 5 1179 1179 5 1179 1179 5 1179
1646 5 1179 1647 5 1179 408 5 1179 830
5 1179 830 6 1179 987 6 1179 1072 6
1179 1179 6 1179 1179 6 1179 1647 6 1179
224 6 1179 680 6 1179 
# 1180
axl an axiomat languag for string transform axl is a
languag design for data manipul data arrang in a linear
form in a workspac is transform accord to a tabl
of axiom call imper a transform consist of a match
procedur which decid where an imper is applic and a
replac procedur that modifi that part of the workspac imper
ar appli in accord with definit of symbol term present
systemat in an assert tabl the process of definit includ
the special case of recurs assert sever complet program of
imper ar given to show a few applic of the
languag cacm novemb 1965 cohen i wegstein j h ca651101
jb march 6 1978 6 22 pm 1180 5 1180
1180 5 1180 1180 5 1180 1395 5 1180 1706
5 1180 1180 6 1180 1180 6 1180 1395 6
1180 210 6 1180 
# 1181
a simpl data transmiss system us the offic telephon a
method ha evolv for transmit data of a type origin
in mani laboratori situat direct to a central comput the
method requir almost no special equip and us ani ordinari
telephon on a callup basi present applic includ cardiac output
calcul radio activ tracer studi and neurophysiolog time sequenc studi
of nerv impuls cacm octob 1965 neilsen i r ca651014
jb march 6 1978 6 25 pm 1181 4 1181
1181 5 1181 1181 5 1181 1181 5 1181 698
5 1181 
# 1182
contextu correl of synonymi experiment corrobor wa obtain for the
hypothesi that the proport of word common to the context
of word a and to the context of word b
is a function of the degre to which a and
b ar similar in mean the shape of the function
howev indic that similar of context is reliabl as criterion
onli for detect pair of word that ar veri similar
in mean cacm octob 1965 rubenstein h goodenough j b
ca651013 jb march 6 1978 6 29 pm 1182 5
1182 1182 5 1182 1182 5 1182 
# 1183
a note on the us of a digit comput for
do tediou algebra and program a special purpos compil wa
written with fortran ii languag and made possibl the write
of veri long program by the comput the procedur is
base on a straight forward us of format statement for
gener machin written program cacm octob 1965 veroni g ca651012
jb march 6 1978 6 31 pm 1183 5 1183
1183 5 1183 1183 5 1183 
# 1184
a fast storag alloc a fast storag bookkeep method is
describ which is particularli appropri for list structur oper and
other situat involv mani size of block that ar fix
in size and locat thi scheme us in the llllll
or l6 bell telephon laboratori low level list languag make
avail block of comput regist in sever differ size the
smaller block ar obtain by success split larger on in
half and the larger block ar reconstitut if and when
their part ar simultan free cacm octob 1965 knowlton k
ca651011 jb march 6 1978 6 35 pm 1184 5
1184 1184 5 1184 1184 5 1184 1389 5 1184
1552 5 1184 2162 5 1184 2435 5 1184 2596
5 1184 2768 5 1184 2845 5 1184 2902 5
1184 2955 5 1184 1051 6 1184 1062 6 1184
1184 6 1184 1184 6 1184 1184 6 1184 1184
6 1184 1184 6 1184 1184 6 1184 1184 6
1184 1184 6 1184 1184 6 1184 1211 6 1184
1389 6 1184 1421 6 1184 1552 6 1184 1879
6 1184 1879 6 1184 378 6 1184 2435 6
1184 2435 6 1184 2435 6 1184 2435 6 1184
2435 6 1184 2596 6 1184 2596 6 1184 2598
6 1184 2734 6 1184 2736 6 1184 2747 6
1184 2747 6 1184 2747 6 1184 2768 6 1184
2768 6 1184 2773 6 1184 
# 1185
a program to solv the pentomino problem by the recurs
us of macro a code techniqu is describ in which
certain macro instruct ar given list as argument and ar
therebi us recurs the discuss cover primarili an exampl in
which the techniqu is us to solv the pentomino problem
the problem of fit 12 pentomino without overlap into a
plane area form of 60 element squar cacm octob 1965
fletcher j g ca651010 jb march 6 1978 6 37
pm 1185 5 1185 1185 5 1185 1185 5 1185
1531 5 1185 2707 5 1185 2753 5 1185 1185
6 1185 1185 6 1185 1185 6 1185 1455 6
1185 
# 1186
recurs solut of a class of combinatori problem an exampl
combinatori problem requir the select of n element from a
set of m element mai be solv by a recurs
process analog to that for comput binomi coeffici sever specif
problem ar analyz the gener techniqu is expos and an
algol program is develop for on of the problem cacm
octob 1965 lynch w c ca651009 jb march 6 1978
6 40 pm 1186 5 1186 1186 5 1186 1186
5 1186 
# 1187
note on an ascii octal code tabl standard cacm octob
1965 crosbi w s ca651008 jb march 6 1978 6
42 pm 1187 5 1187 1187 5 1187 1187 5
1187 
# 1188
an algol like comput design languag the idea of construct
a comput design languag by make us of an algol
like program languag is present a comput design can benefit
from us a design languag at a higher level just
as a comput user can benefit from a higher level
program languag the purpos and requir of the design languag
ar enumer to achiev most of the purpos a translat
is requir to translat a design of comput logic into
a set of boolean equat the design languag is present
in term of vocabulari statement sequenc and microprogram includ ar
exampl of identifi express with both unari and binari oper
declar statement transfer statement termin statement exchang statement if statement
do statement go to statement sever sequenc and a microprogram
cacm octob 1965 chu y ca651007 jb march 6 1978
6 48 pm 249 4 1188 254 4 1188 272
4 1188 1102 4 1188 1109 4 1188 1140 4
1188 1173 4 1188 1188 4 1188 1188 4 1188
1306 4 1188 1464 4 1188 1491 4 1188 1767
4 1188 1781 4 1188 1787 4 1188 1949 4
1188 321 4 1188 2059 4 1188 2126 4 1188
435 4 1188 437 4 1188 463 4 1188 483
4 1188 491 4 1188 2732 4 1188 560 4
1188 583 4 1188 3073 4 1188 627 4 1188
631 4 1188 632 4 1188 642 4 1188 644
4 1188 653 4 1188 680 4 1188 761 4
1188 762 4 1188 763 4 1188 123 4 1188
140 4 1188 919 4 1188 989 4 1188 196
5 1188 1188 5 1188 1188 5 1188 1188 5
1188 642 5 1188 
# 1189
random normal deviat algorithm 267 g5 cacm octob 1965 pike
m c ca651006 jb march 6 1978 6 49 pm
1189 5 1189 1189 5 1189 1189 5 1189 1716
5 1189 1189 6 1189 
# 1190
pseudo random number algorithm 266 g5 cacm octob 1965 pike
m c hill i d ca651005 jb march 6 1978
6 51 pm 1190 4 1190 1190 5 1190 1190
5 1190 1190 5 1190 1663 5 1190 2195 5
1190 2679 5 1190 456 5 1190 970 6 1190
1175 6 1190 1190 6 1190 1190 6 1190 1190
6 1190 1228 6 1190 1648 6 1190 1969 6
1190 1997 6 1190 308 6 1190 2042 6 1190
3187 6 1190 507 6 1190 716 6 1190 783
6 1190 
# 1191
find preced function algorithm 265 l2 cacm octob 1965 wirth
n ca651004 jb march 6 1978 6 52 pm 1191
5 1191 1191 5 1191 1191 5 1191 1836 5
1191 2340 5 1191 1191 6 1191 1191 6 1191
1477 6 1191 1491 6 1191 1491 6 1191 1683
6 1191 1781 6 1191 1836 6 1191 577 6
1191 
# 1192
interpol in a tabl algorithm 264 e1 cacm octob 1965
stafford j ca651003 jb march 6 1978 6 52 pm
1192 5 1192 1192 5 1192 1192 5 1192 
# 1193
gomori 1 algorithm 263 h cacm octob 1965 langmaack h
ca651002 jb march 6 1978 6 54 pm 1193 5
1193 1193 5 1193 1193 5 1193 
# 1194
establish of the acm repositori and principl of the ir
system appli to it oper the histori of the establish
of the acm repositori at the moor school univers of
pennsylvania is review briefli two principl ar present as paramount
in the provis of inform servic 1 easi access to
the inform file by user unfamiliar with file organ and
2 valu of servic exceed user cost these principl serv
as guid in mechan the acm repositori the main featur
of the inform system ar direct user access via on
line teletypewrit consol direct user access to all detail of
the system organ unrestrict and expand search vocabulari user access
through mani facet of document index and stochast search through
link index term and other file relationship the first contribut
to the acm repositori consist of 315 document relat primarili
to earli research on compil these document have been catalog
and index and the catalog is schedul to appear in
comput review the index system is describ in detail the
main catalog is us to describ the document and invert
list ar provid by the repositori system for retriev by
concept coordin cacm octob 1965 rubinoff m white jr j
f ca651001 jb march 6 1978 7 03 pm 1194
5 1194 1194 5 1194 1194 5 1194 1681 5
1194 1699 5 1194 1194 6 1194 1194 6 1194
1324 6 1194 1681 6 1194 
# 1195
uplift univers of pittsburgh linear file tandem system a seri
of comput program ha been develop and is now oper
for process the nation aeronaut and space administr linear file
system on an ibm 1401 7090 combin data process system
the program ar note worthi in that thei creat fix
length logic record and fix length block from variabl length
sourc data and format the output for optim of process
on the ibm 7090 system the program ar complet self
check and test for both valid and accuraci of the
input materi as provid by the nation aeronaut and space
administr cacm septemb 1965 canter j d donaghei c e
ca650911 jb march 6 1978 7 10 pm 1195 5
1195 1195 5 1195 1195 5 1195 
# 1196
applic of differenti equat in gener problem solv a larg
class of problem lead to digit comput process can be
formul in term of the numer solut of system of
ordinari differenti equat power method ar in exist for the
solut of such system a good gener purpos routin for
the solut of such system furnish a power tool for
process mani problem thi is true from the point of
view of eas of program eas of debug and minim
of comput time a number of exampl ar discuss in
detail cacm septemb 1965 klopfenstein r w ca650910 jb march
6 1978 7 16 pm 1196 5 1196 1196 5
1196 1196 5 1196 
# 1197
find zero of a polynomi by the q d algorithm
a method which find simultan all the zero of a
polynomi develop by h rutishaus ha been test on a
number of polynomi with real coeffici thi slowli converg method
the quotient differ q d algorithm provid start valu for
a newton or a bairstow algorithm for more rapid converg
necessari and suffici condit for the exist of the q
d scheme ar not complet known howev failur mai occur
when zero have equal or nearli equal magnitud success wa
achiev in most of the case tri with the failur
usual traceabl to the equal magnitud difficulti in some case
comput roundoff mai result in error which spoil the scheme
even if the q d algorithm doe not give all
the zero it will usual find a major of them
cacm septemb 1965 henrich p watkin b o ca650908 jb
march 6 1978 7 21 pm 1197 5 1197 1197
5 1197 1197 5 1197 1524 5 1197 879 6
1197 1197 6 1197 311 6 1197 
# 1198
solut of a problem in concurr program control a number
of mainli independ sequenti cyclic process with restrict mean of
commun with each other can be made in such a
wai that at ani moment on and onli on of
them is engag in the critic section of it cycl
cacm septemb 1965 dijkstra e w ca650908 jb march 6
1978 7 24 pm 1198 5 1198 1198 5 1198
1198 5 1198 1781 5 1198 2150 5 1198 2228
5 1198 2256 5 1198 2317 5 1198 2342 5
1198 2376 5 1198 2618 5 1198 3184 5 1198
123 6 1198 196 6 1198 919 6 1198 990
6 1198 1007 6 1198 1046 6 1198 1131 6
1198 1139 6 1198 1140 6 1198 1149 6 1198
1198 6 1198 1198 6 1198 1198 6 1198 1198
6 1198 1198 6 1198 1198 6 1198 1198 6
1198 1198 6 1198 1198 6 1198 1215 6 1198
1223 6 1198 1265 6 1198 1303 6 1198 1323
6 1198 1338 6 1198 1338 6 1198 1338 6
1198 1338 6 1198 1338 6 1198 1358 6 1198
1366 6 1198 1421 6 1198 1460 6 1198 1462
6 1198 1463 6 1198 1467 6 1198 1468 6
1198 1477 6 1198 1491 6 1198 1496 6 1198
1531 6 1198 1535 6 1198 1565 6 1198 1572
6 1198 1601 6 1198 1602 6 1198 1613 6
1198 1614 6 1198 1626 6 1198 1641 6 1198
1693 6 1198 1749 6 1198 1749 6 1198 1749
6 1198 1749 6 1198 1749 6 1198 1749 6
1198 1753 6 1198 1781 6 1198 1787 6 1198
1788 6 1198 205 6 1198 224 6 1198 249
6 1198 1877 6 1198 288 6 1198 1960 6
1198 316 6 1198 381 6 1198 398 6 1198
11 6 1198 2126 6 1198 2148 6 1198 2256
6 1198 404 6 1198 410 6 1198 463 6
1198 464 6 1198 483 6 1198 3184 6 1198
3188 6 1198 557 6 1198 584 6 1198 600
6 1198 680 6 1198 691 6 1198 763 6
1198 799 6 1198 
# 1199
a comput center simul project todai s comput center ar
base on rapidli chang technolog of hardwar and softwar system
it is difficult therefor to base decis on experi in
most instanc the benefit of compar experi for a given
problem situat ar not avail in thi paper a mathemat
model of the lockhe central comput center is formul that
describ the oper of a comput center in term of
inform net decis process and control function experi perform with
thi model the result of the experi and the applic
of the result ar discuss cacm septemb 1965 hutchinson g
k ca650907jb march 6 1978 7 29 pm 1199 5
1199 1199 5 1199 1199 5 1199 
# 1200
on revers subroutin and comput that run backward a comput
design is describ which permit subroutin to be execut backward
as well as forward either with their instruct unchang or
replac with conjug instruct it is shown that us thi
concept a number of new subroutin type can be develop
with rather unusu properti sinc these properti ar analog to
certain matrix oper a parallel nomenclatur is suggest for their
classif cacm septemb 1965 reili e d federighi f d
ca650906 jb march 6 19787 33 pm 1200 5 1200
1200 5 1200 1200 5 1200 1945 5 1200 823
6 1200 914 6 1200 915 6 1200 917 6
1200 984 6 1200 989 6 1200 990 6 1200
1012 6 1200 1084 6 1200 1098 6 1200 1122
6 1200 1138 6 1200 1139 6 1200 1141 6
1200 1200 6 1200 1223 6 1200 1265 6 1200
1336 6 1200 1396 6 1200 1455 6 1200 1477
6 1200 1487 6 1200 1491 6 1200 1496 6
1200 483 6 1200 584 6 1200 669 6 1200
680 6 1200 763 6 1200 
# 1201
gener of permut in lexico graphic order algorithm 202 g6
cacm septemb 1965 elliott r w ca650905 jb march 6
1978 7 35 pm 1201 5 1201 1201 5 1201
1201 5 1201 
# 1202
normal random algorithm 200 g5 cacm septemb 1965 pike m
c ca650904 jb march 6 1978 7 36 pm 1202
5 1202 1202 5 1202 1202 5 1202 
# 1203
normdei algorithm 121 g5 cacm septemb 1965 pike m c
ca650903 jb march 6 19787 37 pm 1203 5 1203
1203 5 1203 1203 5 1203 
# 1204
charact structur and charact pariti sens for serial by bit
data commun in the american standard code for inform interchang
propos american standard cacm septemb 1965 ca650902 jb march 6
1978 7 41 pm 1204 5 1204 1204 5 1204
1204 5 1204 
# 1205
an undergradu program in comput scienc preliminari recommend cacm septemb
1965 a report from the acm curriculum committe on comput
scienc ca650901 jb march 6 1978 7 43 pm 1107
4 1205 1205 4 1205 1205 4 1205 1205 4
1205 1205 4 1205 1100 5 1205 1104 5 1205
1107 5 1205 1205 5 1205 1205 5 1205 1205
5 1205 1413 5 1205 1654 5 1205 1771 5
1205 2478 5 1205 68 5 1205 1205 6 1205
1205 6 1205 1205 6 1205 1205 6 1205 1270
6 1205 1654 6 1205 1771 6 1205 2329 6
1205 
# 1206
the self judgment method of curv fit a comput orient
method for process and commun numer data is describ the
instrument reliabl factor irf which exactli defin the limit of
reliabl of each measur item of inform ar us to
comput the maximum permit error mpe associ with each valu
of each ordin the self judgment principl sjp is us
to discard wrong inform and to comput mean valu of
the paramet and their mpe s in term of the
irf data compat test with ani number of differ equat
can be made quickli otherwis intract problem ar easili solv
and the design of mani experi is greatli simplifi the
comput and mathemat techniqu us to reduc bia in the
sjp ar discuss inadequaci in the statist and graphic method
of curv fit ar note cacm august 1965 demain p
a d ca650818 jb march 6 1978 7 50 pm
1206 5 1206 1206 5 1206 1206 5 1206 
# 1207
remark on simul of boolean function cacm august 1965 dodd
g g ca650817 jb march 6 1978 7 52 pm
1207 4 1207 1208 4 1207 3053 4 1207 1207
5 1207 1207 5 1207 1207 5 1207 1329 5
1207 
# 1208
simul of comput logic by fortran arithmet cacm august 1965
weingarten f w ca650816 jb march 6 1978 7 53
pm 1207 4 1208 1208 4 1208 3053 4 1208
1208 5 1208 1208 5 1208 1208 5 1208 1329
5 1208 1409 5 1208 1208 6 1208 
# 1209
neg and zero subscript in fortran ii program for the
ibm 1620 cacm august 1965 garber m s ca650815 jb
march 6 1978 7 56 pm 1209 5 1209 1209
5 1209 1209 5 1209 
# 1210
file handl within fortran thi note describ some fortran subroutin
to facilit handl of tape file thei allow symbol name
of inform file without violat the casual scientif programm s
idea of simplic some comment on two year us of
these subroutin ar given cacm august 1965 harrison m c
ca650814 jb march 6 1978 7 59 pm 1210 5
1210 1210 5 1210 1210 5 1210 
# 1211
a note on storag of string a method for store
string is describ which us block of indefinit size and
is therefor complet dynam it relat to similar scheme is
discuss cacm august 1965 berztiss a t ca650813 jb march
6 1978 8 02 pm 1211 4 1211 1211 4
1211 1549 4 1211 1906 4 1211 2902 4 1211
2902 4 1211 1051 5 1211 1062 5 1211 1211
5 1211 1211 5 1211 1211 5 1211 2902 5
1211 1051 6 1211 1062 6 1211 1184 6 1211
1211 6 1211 1552 6 1211 1879 6 1211 2435
6 1211 2596 6 1211 2734 6 1211 2747 6
1211 2768 6 1211 
# 1212
non linear extrapol and two point boundari valu problem it
is suggest that the converg properti of the usual picard
success approxim scheme mai be improv through us of non
linrar extrapol techniqu a numer exampl is provid cacm august
1965 bellman r kagiada h kalba r ca650812 jb march
6 1978 8 05 pm 1212 5 1212 1212 5
1212 1212 5 1212 
# 1213
dynam format specif the us and implement of two new
fortran format convers ar discuss these format type give the
fortran programm control of input output specif at execut time
cacm august 1965 ranelletti j e ca650811 jb march 6
1978 8 07 pm 1213 5 1213 1213 5 1213
1213 5 1213 
# 1214
some experi in algebra manipul by comput a set of
subroutin to allow algebra manipul on the ibm 7094 comput
ha been written a list processor slip a seri of
four problem of increas difficulti were solv us these routin
cacm august 1965 lapidu a goldstein m ca650810 jb march
6 1978 8 10 pm 1024 4 1214 1051 4
1214 1098 4 1214 1214 4 1214 1214 4 1214
1380 4 1214 1388 4 1214 1393 4 1214 1396
4 1214 1485 4 1214 1487 4 1214 1549 4
1214 1570 4 1214 1878 4 1214 1946 4 1214
1957 4 1214 2168 4 1214 2723 4 1214 2857
4 1214 3112 4 1214 1132 5 1214 1214 5
1214 1214 5 1214 1214 5 1214 1396 5 1214
731 5 1214 964 6 1214 1028 6 1214 1029
6 1214 1083 6 1214 1132 6 1214 1214 6
1214 1278 6 1214 1334 6 1214 1365 6 1214
1386 6 1214 1387 6 1214 1388 6 1214 1392
6 1214 1393 6 1214 1394 6 1214 1395 6
1214 1396 6 1214 1397 6 1214 1496 6 1214
284 6 1214 407 6 1214 3199 6 1214 3200
6 1214 3201 6 1214 3202 6 1214 3203 6
1214 3204 6 1214 561 6 1214 730 6 1214
# 1215
some techniqu us in the alcor illinoi 7090 an algol
compil ha been written by the alcor group for the
ibm 7090 some littl known but signific techniqu in compil
write togeth with organiz detail of thi compil ar describ
time estim and an indic of compil requir ar also
given cacm august 1965 gri d paul m wiehl h
r ca650809 jb march 6 1978 8 13 pm 267
4 1215 1139 4 1215 1141 4 1215 1215 4
1215 1215 4 1215 1215 4 1215 1223 4 1215
1647 4 1215 1682 4 1215 1781 4 1215 1781
4 1215 1787 4 1215 1787 4 1215 1792 4
1215 1945 4 1215 364 4 1215 405 4 1215
438 4 1215 2603 4 1215 763 4 1215 1025
5 1215 1215 5 1215 1215 5 1215 1215 5
1215 224 5 1215 1498 5 1215 1781 5 1215
1787 5 1215 763 5 1215 123 6 1215 196
6 1215 196 6 1215 919 6 1215 990 6
1215 1007 6 1215 1046 6 1215 1131 6 1215
1139 6 1215 1140 6 1215 1141 6 1215 1149
6 1215 1198 6 1215 1215 6 1215 1215 6
1215 1215 6 1215 1223 6 1215 1265 6 1215
1303 6 1215 1323 6 1215 1358 6 1215 1366
6 1215 1421 6 1215 1460 6 1215 1462 6
1215 1463 6 1215 1467 6 1215 1468 6 1215
1477 6 1215 1491 6 1215 1491 6 1215 1496
6 1215 1496 6 1215 1531 6 1215 1535 6
1215 1565 6 1215 1601 6 1215 1602 6 1215
1613 6 1215 1614 6 1215 1626 6 1215 1641
6 1215 1781 6 1215 1787 6 1215 1788 6
1215 205 6 1215 224 6 1215 224 6 1215
249 6 1215 288 6 1215 316 6 1215 381
6 1215 398 6 1215 11 6 1215 404 6
1215 410 6 1215 463 6 1215 464 6 1215
483 6 1215 3184 6 1215 3184 6 1215 3188
6 1215 584 6 1215 600 6 1215 680 6
1215 691 6 1215 763 6 1215 763 6 1215
799 6 1215 799 6 1215 
# 1216
symbol deriv without list process subroutin or recurs a routin
ha been develop which comput and print out the symbol
deriv of an absolut continu elementari function of on or
sever variabl no us is made of list process languag
the chain rule is appli and the result is edit
to produc result as eleg and effici as those obtain
by hand comput a subset mai be imbed in a
formula translat to introduc a differenti oper into an algebra
program languag cacm august 1965 smith p j ca650808 jb
march 6 1978 8 18 pm 1028 4 1216 1028
4 1216 1216 4 1216 1216 4 1216 1216 4
1216 1278 4 1216 1278 4 1216 1347 4 1216
1347 4 1216 1392 4 1216 1396 4 1216 1396
4 1216 1396 4 1216 1536 4 1216 964 4
1216 1028 5 1216 1029 5 1216 1216 5 1216
1216 5 1216 1216 5 1216 561 5 1216 
# 1217
map of partit into integ algorithm 264 a1 cacm august
1965 mckai j k s ca650807 jb march 6 1978
8 19 pm 1217 5 1217 1217 5 1217 1217
5 1217 
# 1218
partit gener algorithm 263 a1 cacm august 1965 mckai j
k s ca650806 jb march 6 1978 8 20 pm
1218 5 1218 1218 5 1218 1218 5 1218 2103
5 1218 1218 6 1218 
# 1219
number of restrict partit of n algorithm 262 a1 cacm
august 1965 mckai j k s ca650805 jb march 6
1978 8 26 pm 1219 5 1219 1219 5 1219
1219 5 1219 2104 5 1219 2489 5 1219 1219
6 1219 1219 6 1219 2104 6 1219 
# 1220
9 j symbol algorithm 261 z cacm august 1965 gunn
j h ca650804 jb march 6 1978 8 27 pm
1220 5 1220 1220 5 1220 1220 5 1220 
# 1221
6 j symbol algorithm 260 z cacm august 1965 gunn
j h ca650803 jb march 6 1978 8 28 pm
1221 5 1221 1221 5 1221 1221 5 1221 
# 1222
legendr function for argument larger than on algorithm 259 s16
cacm august 1965 gautschi w ca650802 jb march 6 1978
8 30 pm 1023 4 1222 1222 4 1222 1222
4 1222 1222 4 1222 1130 5 1222 1222 5
1222 1222 5 1222 1222 5 1222 245 5 1222
310 5 1222 
# 1223
high speed compil of effici object code a three pass
compil with the follow properti is briefli describ the last
two pass scan an intermedi languag produc by the preced
pass in essenti the revers of the order in which
it wa gener so that the first pass is the
onli on which hasto read the bulki problem orient input
the doubl scan on in either direct perform by the
first two pass allow the compil to remov local constant
express and recurs calcul express from loop and to do
the import part of common subexpress recognit optim such as
the effect us of index regist although as import is
not discuss sinc the object code which would be most
effici is highli machin depend the discuss is in term
of a fortran like languag although the techniqu is applic
to most algebra languag cacm august 1965 gear c w
ca650801 jb march 6 1978 8 45 pm 267 4
1223 1139 4 1223 1141 4 1223 1215 4 1223
1223 4 1223 1223 4 1223 1388 4 1223 1647
4 1223 1781 4 1223 1787 4 1223 1792 4
1223 364 4 1223 405 4 1223 436 4 1223
438 4 1223 763 4 1223 1223 5 1223 1223
5 1223 1223 5 1223 224 5 1223 1781 5
1223 1807 5 1223 1945 5 1223 1947 5 1223
405 5 1223 823 6 1223 123 6 1223 196
6 1223 914 6 1223 915 6 1223 917 6
1223 919 6 1223 984 6 1223 989 6 1223
990 6 1223 990 6 1223 1007 6 1223 1012
6 1223 1046 6 1223 1084 6 1223 1098 6
1223 1122 6 1223 1131 6 1223 1134 6 1223
1138 6 1223 1139 6 1223 1139 6 1223 1140
6 1223 1141 6 1223 1149 6 1223 1198 6
1223 1200 6 1223 1215 6 1223 1223 6 1223
1223 6 1223 1223 6 1223 1223 6 1223 1248
6 1223 1248 6 1223 1265 6 1223 1265 6
1223 1303 6 1223 1323 6 1223 1336 6 1223
1358 6 1223 1366 6 1223 1396 6 1223 1421
6 1223 1455 6 1223 1460 6 1223 1462 6
1223 1463 6 1223 1467 6 1223 1468 6 1223
1477 6 1223 1477 6 1223 1487 6 1223 1491
6 1223 1491 6 1223 1496 6 1223 1496 6
1223 1531 6 1223 1535 6 1223 1551 6 1223
1565 6 1223 1601 6 1223 1602 6 1223 1613
6 1223 1614 6 1223 1626 6 1223 1641 6
1223 1787 6 1223 1788 6 1223 205 6 1223
224 6 1223 249 6 1223 288 6 1223 1947
6 1223 316 6 1223 381 6 1223 398 6
1223 399 6 1223 11 6 1223 404 6 1223
410 6 1223 463 6 1223 464 6 1223 483
6 1223 483 6 1223 3184 6 1223 3188 6
1223 584 6 1223 584 6 1223 600 6 1223
669 6 1223 680 6 1223 680 6 1223 691
6 1223 763 6 1223 763 6 1223 799 6
1223 
# 1224
determin a comput center environ an investig is describ in
which sever gener unavail paramet descript of a comput center
environ ar obtain the actual data collect and reduct is
describ and the result of on month of thi collect
ar tabul and summar cacm juli 1965 rosin r f
ca650711 jb march 6 1978 8 48 pm 1224 5
1224 1224 5 1224 1224 5 1224 1533 5 1224
1604 5 1224 1224 6 1224 1224 6 1224 1410
6 1224 1604 6 1224 
# 1225
the predict analyz and a path elimin techniqu some of
the characterist featur of a predict analyz a system of
syntact analysi now oper at harvard on and ibm 7094
ar delin the advantag and disadvantag of the system ar
discuss in comparison to those of an immedi constitu analyz
develop at the rand corpor with robinson s english grammar
in addit a new techniqu is describ for repetit path
elimin for a predict analyz which can now claim effici
both in process time and core storag requir cacm juli
1965 kuno s ca650710 jb march 6 1978 8 52
pm 1225 4 1225 1225 4 1225 1350 4 1225
1350 4 1225 1646 4 1225 1781 4 1225 1945
4 1225 1945 4 1225 2650 4 1225 2698 4
1225 2708 4 1225 3093 4 1225 1012 5 1225
1225 5 1225 1225 5 1225 1225 5 1225 1350
5 1225 1659 5 1225 1856 5 1225 2050 5
1225 680 5 1225 1012 6 1225 1225 6 1225
1225 6 1225 1225 6 1225 1225 6 1225 1265
6 1225 1265 6 1225 1324 6 1225 1350 6
1225 1399 6 1225 1553 6 1225 1671 6 1225
1697 6 1225 680 6 1225 
# 1226
the organ of structur file a data file is an
integr part of a data process system in mani system
the select of an organ for the data within the
file can be critic to the system s oper effici
thi paper provid the system design with an inform sourc
which describ ten techniqu that mai be emploi for organ
structur data the characterist of the organ describ ar applic
independ thu provid the design with a refer which allow
him to limit the number of file organ he must
consid for hi system cacm juli 1965 dzubak b j
warburton c r ca650709 jb march 6 1978 8 57
pm 1050 4 1226 1226 4 1226 441 4 1226
758 4 1226 1226 5 1226 1226 5 1226 1226
5 1226 367 5 1226 
# 1227
transport algorithm 258 h cacm juli 1965 bayer g ca650708
jb march 6 1978 8 58 pm 1227 5 1227
1227 5 1227 1227 5 1227 
# 1228
treesort 3 algorithm 245 m1 cacm juli 1965 abram p
s ca650707 jb march 6 1978 8 59 pm 1228
5 1228 1228 5 1228 1228 5 1228 2042 5
1228 2679 5 1228 970 6 1228 970 6 1228
1175 6 1228 1190 6 1228 1228 6 1228 1228
6 1228 1969 6 1228 1997 6 1228 308 6
1228 2042 6 1228 3187 6 1228 507 6 1228
716 6 1228 783 6 1228 
# 1229
random permut algorithm 235 g6 cacm juli 1965 pike m
c ca650706 jb march 6 1978 9 00 pm 1229
5 1229 1229 5 1229 1229 5 1229 
# 1230
method for hyphen at the end of a print line
a descript of a method of hyphen is present as
a result of applic of sever gener rule the charact
set consid by the routin and the method ar briefli
outlin cacm juli 1965 rich r p stone a g
ca650705 jb march 6 1978 9 03 pm 1230 5
1230 1230 5 1230 1230 5 1230 
# 1231
peephol optim redund instruct mai be discard dure the final
stage of compil by us a simpl optim techniqu call
peephol optim the method is describ and examplesar given cacm
juli 1965 mckeeman w m ca650704 jb march 6 1978
9 05 pm 1160 5 1231 1231 5 1231 1231
5 1231 1231 5 1231 2034 5 1231 984 6
1231 1231 6 1231 1231 6 1231 1565 6 1231
1852 6 1231 1926 6 1231 1947 6 1231 
# 1232
represent of the standard ecma 7 bit code in punch
card ecma standard cacm juli 1965 ca650703 jb march 6
1978 9 06 pm 1232 5 1232 1232 5 1232
1232 5 1232 
# 1233
convent for the us of symbol in the prepar of
flowchart for inform process system a standard work paper thi
paper is intend as an outlin of the variou convent
which ar be consid for the us of flowchart for
inform process system the convent ar appli to the us
of the symbol appear in the propos american standard flowchart
symbol and not with the symbol per se cacm juli
1965 ca650702 jb march 6 1978 9 10 pm 1233
5 1233 1233 5 1233 1233 5 1233 
# 1234
the structur of yet anoth algol compil a high speed
top down method of syntax analysi which complet elimin back
up of the sourc string ha been implement in a
conveni macro languag a techniqu of simul at compil time
of the us of a convent run time stack enabl
the gener of code for express which minim store fetch
and stack pointer motion at run time while properli trate
recurs and side effect of procedur block structur and recurs
ar handl without need for interpret method at run time
the context problem in the transmiss to recurs procedur of
paramet call by name is solv in a manner which
permit the handl of the common case of simpl express
and arrai identifi with particular effici cacm juli 1965 kanner
h kosinski p robinson c l ca650701 jb march 6
1978 9 29 pm 254 4 1234 1037 4 1234
1046 4 1234 1086 4 1234 1105 4 1234 1132
4 1234 1139 4 1234 1140 4 1234 1234 4
1234 1234 4 1234 1234 4 1234 1234 4 1234
1234 4 1234 1234 4 1234 1234 4 1234 1234
4 1234 1263 4 1234 1263 4 1234 1265 4
1234 1265 4 1234 1270 4 1234 1323 4 1234
1358 4 1234 1358 4 1234 1379 4 1234 1380
4 1234 1453 4 1234 1464 4 1234 1484 4
1234 1491 4 1234 1491 4 1234 1496 4 1234
1498 4 1234 1613 4 1234 1614 4 1234 1781
4 1234 1781 4 1234 1824 4 1234 1825 4
1234 1860 4 1234 321 4 1234 321 4 1234
2083 4 1234 2126 4 1234 2178 4 1234 2179
4 1234 2252 4 1234 2325 4 1234 2341 4
1234 2451 4 1234 2546 4 1234 2546 4 1234
464 4 1234 2645 4 1234 2652 4 1234 2684
4 1234 2842 4 1234 2929 4 1234 2934 4
1234 584 4 1234 3069 4 1234 631 4 1234
653 4 1234 669 4 1234 679 4 1234 680
4 1234 691 4 1234 761 4 1234 763 4
1234 795 4 1234 799 4 1234 945 4 1234
949 4 1234 989 4 1234 944 5 1234 1234
5 1234 1234 5 1234 1234 5 1234 321 5
1234 385 5 1234 400 5 1234 402 5 1234
404 5 1234 3184 5 1234 729 5 1234 
# 1235
a stochast approach to the grammat code of english a
comput program is describ which will assign each word in
an english text to it form class or part of
speech the program oper at rel high speed in onli
a limit storag space about half of the word event
in a corpu ar identifi through the us of a
small dictionari of function word and frequent occur lexic word
some suffix test and logic decis rule ar emploi to
code addit word final the remain word ar assign to
on class or anoth on the basi of the most
probabl form class to occur within the alreadi identifi context
the condit probabl us as a basi for thi code
were empir deriv from a separ hand code corpusn preliminari
trial the accuraci of the coder wa 91 to 93
with obviou wai of improv the algorithm be suggest by
an analysi of the result cacm june 1965 stolz w
s tannenbaum h carstensen f v ca650620 jb march 6
1978 9 35 pm 1235 5 1235 1235 5 1235
1235 5 1235 
# 1236
the smart automat document retriev system an illustr a fulli
automat document retriev system oper on the ibm 7094 is
describ the system is character by the fact that sever
hundr differ method ar avail to analyz document and search
request thi featur is us in the retriev process by
leav the exact sequenc of oper initi unspecifi and adapt
the search strategi to the need of individu user the
system is us not onli to simul an actual oper
environ but also to test the effect of the variou
avail process method result obtain so far seem to indic
that some combin of analysi procedur can in gener be
reli upon to retriev the want inform a typic search
request is us as an exampl in the present report
to illustr system oper and evalu procedur cacm june 1965
salton g lesk m e ca650619 jb march 6 1978
9 41 pm 1236 5 1236 1236 5 1236 1236
5 1236 1457 5 1236 1236 6 1236 
# 1237
convers of decis tabl to comput program sever translat procedur
for the convers of decis tabl to program ar present
and then evalu in term of storag requir execut time
and compil time the procedur ar valuabl as hand code
guid or as algorithm for a compil both limit entri
and extend entri tabl ar analyz in addit to tabl
analysi the natur of tabl orient program languag and featur
is discuss it is presum that the reader is familiar
with the natur of decis tabl and convent definit cacm
june 1965 press l i ca650618 jb march 6 1978
9 45 pm 250 4 1237 1237 4 1237 1237
4 1237 1237 4 1237 1549 4 1237 1564 4
1237 2220 4 1237 2453 4 1237 753 4 1237
1237 5 1237 1237 5 1237 1237 5 1237 1354
5 1237 250 5 1237 1488 5 1237 1994 5
1237 320 5 1237 2053 5 1237 2220 5 1237
2273 5 1237 753 5 1237 1172 6 1237 1172
6 1237 1172 6 1237 1172 6 1237 1237 6
1237 1237 6 1237 1237 6 1237 1237 6 1237
1237 6 1237 1237 6 1237 1327 6 1237 1327
6 1237 1327 6 1237 1327 6 1237 1327 6
1237 1354 6 1237 1354 6 1237 1354 6 1237
1489 6 1237 1548 6 1237 1684 6 1237 250
6 1237 2053 6 1237 2220 6 1237 
# 1238
a techniqu for integr report from a multi run system
the requir of a requisit account system for the san
francisco oversea suppli agenc osa includ except report to osa
itself the simultan satisfact of the report requir and the
account requir pose definit problem in system design particularli the
handl of the report function a practic and satisfactori solut
wa develop by expand the basic system with two tailor
servic run for report product these two run permit a
final system that wa easier to debug easi to maintain
effici in product and respons to the chang requir of
osa cacm june 1965 budea n kamena j g kamena
r m ca650617 jb march 6 1978 9 49 pm
1238 5 1238 1238 5 1238 1238 5 1238 
# 1239
graycod algorithm 246 z cacm june 1965 allen w d
ca650616 jb march 6 1978 9 50 pm 1239 5
1239 1239 5 1239 1239 5 1239 
# 1240
transport algorithm 258 h cacm june 1965 bayer g ca650615
jb march 6 1978 9 51 pm 1240 5 1240
1240 5 1240 1240 5 1240 
# 1241
havi integr algorithm 257 d1 cacm june 1965 kubik r
n ca650614 jb march 6 1978 10 09 pm 1241
5 1241 1241 5 1241 1241 5 1241 1352 5
1241 1356 5 1241 1883 5 1241 2040 5 1241
834 6 1241 872 6 1241 1040 6 1241 1092
6 1241 1241 6 1241 1241 6 1241 1241 6
1241 1241 6 1241 1273 6 1241 1273 6 1241
1352 6 1241 1356 6 1241 324 6 1241 324
6 1241 429 6 1241 570 6 1241 621 6
1241 621 6 1241 786 6 1241 
# 1242
modifi graeff method algorithm 256 c2 cacm june 1965 grau
a a ca650613 jb march 6 1978 10 10 pm
1242 5 1242 1242 5 1242 1242 5 1242 1667
5 1242 178 6 1242 1242 6 1242 327 6
1242 
# 1243
test the understand of the differ between call by name
and call by valu in algol 60 cacm june 1965
weil r l ca650612 jb march 6 1978 10 11
pm 1243 5 1243 1243 5 1243 1243 5 1243
# 1244
bit manipul in fortran languag cacm june 1965 tobei g
d ca650611 jb march 6 1978 10 12 pm 1244
5 1244 1244 5 1244 1244 5 1244 
# 1245
a fortran n ari counter cacm june 1965 kent w
ca650610 jb march 6 1978 10 13 pm 1245 5
1245 1245 5 1245 1245 5 1245 
# 1246
deepli nest iter cacm june 1965 korphag r r ca650609
jb march 6 1978 10 15 pm 1246 5 1246
1246 5 1246 1246 5 1246 
# 1247
an oper environ for dynam recurs comput program system present
in thi paper is a brief nontechn introduct to oedipu
a comput program system which can serv as an oper
environ for dynam and or recurs program and program system
the avail servic includ dynam alloc of storag for contigu
block of arbitrari size input and output for a hierarchi
of data type a public pushdown list for automat recurs
program a rudimentari compil for subroutin commun and bookkeep and
debug aid cacm june 1965 brown w s ca650608 jb
march 6 1978 10 18 pm 1247 4 1247 1945
4 1247 1247 5 1247 1247 5 1247 1247 5
1247 1336 5 1247 1397 5 1247 2704 5 1247
1247 6 1247 1247 6 1247 1552 6 1247 1749
6 1247 2356 6 1247 2379 6 1247 2673 6
1247 
# 1248
on the automat simplif of comput program present in thi
paper is the problem of write a program which would
examin ani other program and perform such simplif on it
as can be detect from the argument program s form
alon without have ani knowledg of what it is suppos
to do cacm june 1965 nievergelt j ca650607 jb march
6 1978 10 24 pm 1248 5 1248 1248 5
1248 1248 5 1248 1625 5 1248 1807 5 1248
1947 5 1248 1134 6 1248 1223 6 1248 1223
6 1248 1248 6 1248 1248 6 1248 1248 6
1248 1551 6 1248 1947 6 1248 399 6 1248
669 6 1248 
# 1249
record magnet tape for inform interchang 200 cpi nrzi on
the revis propos american standard cacm june 1965 ca650606 jb
march 6 1978 10 26 pm 1249 5 1249 1249
5 1249 1249 5 1249 
# 1250
graphic symbol for problem definit and analysi a standard work
paper cacm june 1965 ca650605 jb march 7 1978 12
35 pm 1250 5 1250 1250 5 1250 1250 5
1250 
# 1251
american standard and ifip icc vocabulari compar the propos american
standard vocabulari of inform process and the ifip icc vocabulari
of term us in inform process ar analyz and compar
cacm june 1965 traub j f ca650604 jb march 7
1978 12 38 pm 1251 4 1251 975 5 1251
1251 5 1251 1251 5 1251 1251 5 1251 
# 1252
symbol notat for statist tabl and an approach toward automat
system design the prepar of statist tabl is an import
function of the data process system of some organ and
a symbol notat for the descript of tabl ha been
shown to be a us aid to document such a
notat also provid the first step toward make automat a
tediou and time consum part of system design and program
in mani comput applic on notat is describ and suggest
ar made for the implement of the larger goal cacm
june 1965 smith b w ca650603 jb march 7 1978
12 41 pm 1252 5 1252 1252 5 1252 1252
5 1252 
# 1253
quikscript a simscript like languag for the g 20 quikscript
is a simul languag base on simscript and program entir
in an algebra languag 20 gate the quikscript languag it
intern implement and major differ between quikscript and simscript ar
present thi paper is not a program guid to the
languag but rather an attempt to present it flavor a
brief descript of simscript is includ as is a suffici
descript of 20 gate to render thi materi understand to
the reader familiar with algebra languag cacm june 1965 tong
f m keller p newel a ca650602 jb march 7
1978 12 45 pm 1253 5 1253 1253 5 1253
1253 5 1253 
# 1254
the iter element a recent addit to the mad languag
ha made the iter structur of the mad through statement
correspond to the algol for statement and the fortran do
statement avail within express cacm june 1965 galler b a
fischer m j ca650601 jb march 7 1978 12 49
pm 1254 5 1254 1254 5 1254 1254 5 1254
# 1255
a method of data list process with applic to eeg
analysi a set of subroutin is discuss which is design
to aid in the program of comput on index list
of number us machin languag or a symbol assembl system
the most commonli perform list oper ar outlin and logic
arrang into five group as an exampl the comput of
power spectral densiti from the autocovari function is discuss for
a class of eeg signal cacm mai 1965 philpott c
m lago g v ca650516 jb march 7 1978 12
52 pm 1255 5 1255 1255 5 1255 1255 5
1255 
# 1256
dynam variabl format cacm mai 1965 king d r ca650515
jb march 7 1978 12 53 pm 1256 5 1256
1256 5 1256 1256 5 1256 
# 1257
debug an extens to current on line debug techniqu a
method of on linr assembl languag debug which greatli simplifi
sever of the bookkeep task characterist associ with that process
ha been develop and implement in a program for the
univac m 460 comput at air forc cambridg research laboratori
with thi program an onlin user mai insert or delet
in symbol assembl languag ani number of line at ani
point of hi previous assembl program in core with the
remaind of the program be reloc appropri cacm mai 1965
evan t g darlei d l ca650514 jb march 7
1978 12 58 pm 1257 5 1257 1257 5 1257
1257 5 1257 1738 5 1257 1257 6 1257 
# 1258
an extend arithmet packag in mani field for exampl algebra
number theori arithmet must be carri out to a degre
of precis which exce the normal hardwar capac of most
machin in such case an extend arithmet packag provid a
comprehens and easi to us wai of perform such arithmet
such a packag wa code for the ibm 7090 in
discuss the gener problem associ with the design of an
extend arithmet packag specif refer is made to thi program
cacm mai 1965 blum b i ca650513 jb march 7
1978 1 01 pm 1026 4 1258 1258 4 1258
1258 4 1258 1292 4 1258 1292 4 1258 1497
4 1258 1497 4 1258 1975 4 1258 2605 4
1258 107 5 1258 1026 5 1258 1258 5 1258
1258 5 1258 1258 5 1258 
# 1259
applic of binari number in comput routin a binari number
can be thought of as an altern form of express
for either a set of letter or a decim number
there ar then three equival express easili translat to on
anoth each have differ characterist four exampl ar given in
which the form of an express is chang to an
equival express to save space or gain power cacm mai
1965 weldon r j baker r l ca650512 jb march
7 1978 1 05 pm 1259 5 1259 1259 5
1259 1259 5 1259 
# 1260
least squar analysi of reson spectra on small comput the
problem of analyz data from a mossbauer effect experi is
discuss by us the cut step procedur for converg and
by impos physic constraint on the function form of the
calcul it is possibl to make the analysi on a
small comput the analysi ha been carri out on an
ibm 1410 comput with a 40 000 bcd core memori
cacm mai 1965 marshal s w nelson j a wilenzick
r m ca650511 jb march 7 1978 1 10 pm
1260 5 1260 1260 5 1260 1260 5 1260 
# 1261
model and simul of digit network the simul of digit
network on a digit comput provid the engin with an
effect mean of analyz time quantiz logic behavior the digit
network is model as a set of time depend or
time independ boolean transform each transform describ the input output
relationship of a model element compris the network mode the
simplic of util the fortran iv program system as a
digit network simul is discuss an illustr thi simplic is
deriv from a common model techniqu applic to combin and
sequenti digit network and a systemat program approach cacm mai
1965 larsen r p mano m m ca650510 jb march
7 1978 1 15 pm 1261 4 1261 1939 4
1261 1030 5 1261 1261 5 1261 1261 5 1261
1261 5 1261 
# 1262
procedur orient languag statement to facilit parallel process two statement
ar suggest which allow a programm write in a procedur
orient languag to indic section of program which ar to
be execut in parallel the statement ar do togeth and
hold these serv partli as bracket in establish a rang
of parallel oper and partli to defin each parallel path
within thi rang do togeth mai be nest the statement
should be particularli effect for us with comput devic capabl
of attain some degre of comput comput overlap cacm mai
1965 opler a ca650509 jb march 7 1978 2 17
pm 1158 5 1262 1262 5 1262 1262 5 1262
1262 5 1262 1262 6 1262 
# 1263
metalanguag and syntax specif two metalanguag ar describ on suffici
for the tabl specif of the algol syntax the other
with addit metaoper adequ and us for the formal tabl
descript of basic fortran cacm mai 1965 burkhardt w h
ca650508 jb march 7 1978 2 19 pm 1046 4
1263 1086 4 1263 1105 4 1263 1132 4 1263
1139 4 1263 1140 4 1263 1234 4 1263 1234
4 1263 1263 4 1263 1263 4 1263 1263 4
1263 1265 4 1263 1265 4 1263 1270 4 1263
1323 4 1263 1358 4 1263 1379 4 1263 1380
4 1263 1453 4 1263 1453 4 1263 1464 4
1263 1484 4 1263 1491 4 1263 1496 4 1263
1498 4 1263 1613 4 1263 1614 4 1263 1781
4 1263 1781 4 1263 1824 4 1263 1825 4
1263 1860 4 1263 1945 4 1263 2083 4 1263
2126 4 1263 2178 4 1263 2179 4 1263 2252
4 1263 2325 4 1263 2341 4 1263 2546 4
1263 2546 4 1263 464 4 1263 2645 4 1263
2652 4 1263 2684 4 1263 2842 4 1263 2929
4 1263 2934 4 1263 584 4 1263 3069 4
1263 631 4 1263 653 4 1263 669 4 1263
679 4 1263 680 4 1263 691 4 1263 761
4 1263 763 4 1263 795 4 1263 799 4
1263 945 4 1263 949 4 1263 989 4 1263
989 5 1263 1263 5 1263 1263 5 1263 1263
5 1263 1379 5 1263 404 5 1263 3184 5
1263 1263 6 1263 1477 6 1263 3184 6 1263
669 6 1263 761 6 1263 
# 1264
blnsy a 1401 oper system with braill capabl blnsy is
an oper system design for a 4k 1401 with common
option featur and two attach tape drive print output of
thi system or of execut program mai be in either
english or braill even though thi system wa written for
a small machin with minim peripher equip job mai be
batch so that card handl and lost process time is
at a minimum thi system will perform ani or all
of the follow user specifi function assembl sp sourc deck
post list produc condens or uncondens object deck execut user
s program list card input to a program list punch
output provid a storag dump execut a program submit for
execut as an uncondens object deck under debug trace control
card to braill convers braill list of 7040 ibsi batch
output and updat or duplic the system tape itself input
ouput subroutin ar also includ in the system cacm mai
1965 landwehr j b mclaughlin c mueller h lichstein m
pollack s v ca650507 jb march 7 1978 2 30
pm 1264 4 1264 1740 4 1264 1099 5 1264
1264 5 1264 1264 5 1264 1264 5 1264 
# 1265
on the rel effici of context free grammar recogn a
number of divers recognit procedur that have been propos for
pars sentenc with respect to a context free grammar ar
describ in thi paper by mean of a common devic
each procedur is defin by give an algorithm for obtain
a nondeterminist ture machin recogn that is equival to a
given context free grammar the formal of the ture machin
ha been chosen to make possibl particularli simpl descript of
the pars procedur consid an attempt ha been made to
compar recognit effici for the procedur defin for a few
simpl grammar and sentenc a formal comparison ha been made
empir comparison of the recognit of more realist program languag
such as lisp and algol ha been made by mean
of a program which simul the ture machin on the
univac m 460 comput sever algorithm for produc grammar equival
to a given context free grammar have been consid and
the increas in recognit effici thei afford ha been empir
investig cacm mai 1965 griffith t v petrick s r
ca650506 jb march 7 1978 2 38 pm 1046 4
1265 1062 4 1265 1086 4 1265 1105 4 1265
1121 4 1265 1132 4 1265 1139 4 1265 1139
4 1265 1139 4 1265 1140 4 1265 1151 4
1265 1234 4 1265 1234 4 1265 1263 4 1265
1263 4 1265 1265 4 1265 1265 4 1265 1265
4 1265 1265 4 1265 1265 4 1265 1270 4
1265 1323 4 1265 1358 4 1265 1379 4 1265
1380 4 1265 1453 4 1265 1464 4 1265 1484
4 1265 1491 4 1265 1496 4 1265 1498 4
1265 1613 4 1265 1614 4 1265 1665 4 1265
1781 4 1265 1781 4 1265 1781 4 1265 1824
4 1265 1825 4 1265 1860 4 1265 2083 4
1265 2126 4 1265 2178 4 1265 2179 4 1265
2252 4 1265 2325 4 1265 2341 4 1265 2546
4 1265 2546 4 1265 464 4 1265 2645 4
1265 2652 4 1265 2684 4 1265 2769 4 1265
2842 4 1265 2929 4 1265 2934 4 1265 584
4 1265 3069 4 1265 631 4 1265 653 4
1265 669 4 1265 679 4 1265 680 4 1265
691 4 1265 720 4 1265 759 4 1265 761
4 1265 763 4 1265 763 4 1265 795 4
1265 799 4 1265 945 4 1265 949 4 1265
989 4 1265 1265 5 1265 1265 5 1265 1265
5 1265 1350 5 1265 1399 5 1265 1659 5
1265 1768 5 1265 1781 5 1265 1945 5 1265
2110 5 1265 404 5 1265 464 5 1265 3094
5 1265 3184 5 1265 631 5 1265 635 5
1265 823 6 1265 123 6 1265 196 6 1265
914 6 1265 915 6 1265 917 6 1265 919
6 1265 984 6 1265 989 6 1265 990 6
1265 990 6 1265 1007 6 1265 1012 6 1265
1012 6 1265 1046 6 1265 1084 6 1265 1098
6 1265 1122 6 1265 1131 6 1265 1138 6
1265 1139 6 1265 1139 6 1265 1140 6 1265
1141 6 1265 1141 6 1265 1149 6 1265 1198
6 1265 1200 6 1265 1215 6 1265 1223 6
1265 1223 6 1265 1225 6 1265 1225 6 1265
1265 6 1265 1265 6 1265 1265 6 1265 1265
6 1265 1265 6 1265 1265 6 1265 1265 6
1265 1265 6 1265 1303 6 1265 1323 6 1265
1336 6 1265 1350 6 1265 1358 6 1265 1366
6 1265 1396 6 1265 1399 6 1265 1421 6
1265 1455 6 1265 1460 6 1265 1462 6 1265
1463 6 1265 1467 6 1265 1468 6 1265 1477
6 1265 1477 6 1265 1487 6 1265 1491 6
1265 1491 6 1265 1496 6 1265 1496 6 1265
1531 6 1265 1535 6 1265 1565 6 1265 1601
6 1265 1602 6 1265 1613 6 1265 1614 6
1265 1626 6 1265 1641 6 1265 1671 6 1265
1697 6 1265 1781 6 1265 1781 6 1265 1787
6 1265 1788 6 1265 205 6 1265 224 6
1265 249 6 1265 288 6 1265 316 6 1265
381 6 1265 398 6 1265 11 6 1265 2179
6 1265 2645 6 1265 404 6 1265 410 6
1265 463 6 1265 464 6 1265 483 6 1265
483 6 1265 3184 6 1265 3188 6 1265 584
6 1265 584 6 1265 600 6 1265 669 6
1265 680 6 1265 680 6 1265 680 6 1265
691 6 1265 763 6 1265 763 6 1265 799
6 1265 
# 1266
consider relat to purpos of fortran standard appendix to asa
fortran standard cacm mai 1965 ca650505 jb march 7 1978
2 40 pm 1266 5 1266 1266 5 1266 1266
5 1266 
# 1267
perform of system us for data transmiss transfer rate of
inform bit an asa tutori standard inform thruput as a
characterist of system perform is discuss thi discuss includ the
pertin aspect of inform transfer of determin of transfer rate
of inform bit trib of residu error and of standard
measur condit the paper also present an orderli arrang of
characterist and paramet that affect inform thruput and some exampl
on procedur for determin a thruput rate in term of
trib it conclud that a perform characterist involv inform rate
can best be express as the trib in conjunct with
the residu error rate cacm mai 1965 ca650504 jb march
7 1978 3 10 pm 1267 5 1267 1267 5
1267 1267 5 1267 
# 1268
logarithm of a complex number algorithm 243 b3 cacm mai
1965 boothroyd j ca650502 jb march 7 1978 3 11
pm 1268 5 1268 1268 5 1268 1268 5 1268
1858 5 1268 1268 6 1268 1857 6 1268 
# 1269
comput of fourier coeffici algorithm c6 cacm mai 1965 teijelo
l ca650502 jb march 7 1978 3 12 pm 1269
5 1269 1269 5 1269 1269 5 1269 
# 1270
on algol educ automat grade program two algol grader program
ar present for the comput evalu of student algol program
on is for a beginn s program it furnish random
data and check answer the other provid a search test
of the reliabl and effici of an integr procedur there
is a statement of the essenti properti of a comput
system in order that grader program can be effect us
cacm mai 1965 forsyth g e wirth n ca650501 jb
march 7 1978 3 16 pm 1086 4 1270 1132
4 1270 1234 4 1270 1263 4 1270 1265 4
1270 1270 4 1270 1270 4 1270 1323 4 1270
1358 4 1270 1379 4 1270 1380 4 1270 1453
4 1270 1464 4 1270 1484 4 1270 1491 4
1270 1498 4 1270 1613 4 1270 1614 4 1270
1781 4 1270 1825 4 1270 1860 4 1270 1902
4 1270 2083 4 1270 2178 4 1270 2179 4
1270 2252 4 1270 2325 4 1270 2341 4 1270
2546 4 1270 2645 4 1270 2652 4 1270 2684
4 1270 2842 4 1270 2929 4 1270 2934 4
1270 3069 4 1270 669 4 1270 679 4 1270
691 4 1270 761 4 1270 949 4 1270 989
4 1270 145 5 1270 1270 5 1270 1270 5
1270 1270 5 1270 1413 5 1270 1902 5 1270
3184 5 1270 145 6 1270 1205 6 1270 1270
6 1270 1270 6 1270 
# 1271
secondari kei retriev us an ibm 7090 1301 system the
secondari kei retriev method involv the prepar of secondari storag
list from primari data record search request ar satisfi by
logic oper on appropri list produc a complet set of
address of primari record relev to the request experiment result
ar present and a compar analysi is given cacm april
1965 davi d r lin a d ca650420 jb march
7 1978 3 18 pm 1271 4 1271 1785 4
1271 2543 4 1271 2552 4 1271 911 4 1271
1271 5 1271 1271 5 1271 1271 5 1271 1976
5 1271 332 5 1271 1271 6 1271 
# 1272
expand the edit function in languag data process in automat
abstract citat index mechan translat and other such procedur edit
is requir whenev the automat method leav someth to be
desir thi paper discuss the economi of edit as a
function of the amount of condens of text in languag
process oper and then contend that edit can be regard
as an opportun rather than as an unwelcom necess heavi
edit which goe beyond mere correct and improv of comput
output is exemplifi by the us of a concord in
prepar a survei articl or lectur other opportun for heavi
edit ar describ chief among them be interpret and expans
of comput output in such process as factor analysi applic
ar describ such process as factor analysi applic ar describ
such as the quick unbias evalu of a larg volum
of incom mail or telegram yield summari report not possibl
for either human or comput to produc alon cacm april
1965 doul l b ca650419 jb march 7 1978 3
26 pm 1272 5 1272 1272 5 1272 1272 5
1272 
# 1273
remark on romberg quadratur a modifi form of romberg quadratur
is describ which is less sensit to the accumul of
round error than the customari on cacm april 1965 krasun
a m prager w ca650418 jb march 7 1978 3
27 pm 1273 5 1273 1273 5 1273 1273 5
1273 1352 5 1273 1982 5 1273 2040 5 1273
1 6 1273 834 6 1273 872 6 1273 1040
6 1273 1092 6 1273 1241 6 1273 1241 6
1273 1273 6 1273 1273 6 1273 1273 6 1273
1352 6 1273 1356 6 1273 1883 6 1273 324
6 1273 324 6 1273 324 6 1273 429 6
1273 570 6 1273 621 6 1273 621 6 1273
786 6 1273 
# 1274
on the numer solut of an n point boundari valu
problem for linear ordinari differenti equat a method for the
numer solut of then point boundari valu problem for homogen
linear ordinari differenti equat is develop the method requir two
rung kutta integr over the interv under consider and the
solut of a linear system of equat with n 1
unknown cacm april 1965 dai j t ca650417 jb march
7 1978 3 30 pm 1274 4 1274 1147 5
1274 1274 5 1274 1274 5 1274 1274 5 1274
# 1275
code structur for protect and manipul of variabl length item
corrigendum cacm april 1965 ramamoorthi c v ca650416 jb march
7 1978 3 31 pm 1275 5 1275 1275 5
1275 1275 5 1275 
# 1276
still anoth us for fortran ii chain cacm april 1965
ca650415 jb march 7 1978 3 32 pm 1276 5
1276 1276 5 1276 1276 5 1276 
# 1277
the us of cobol subroutin in fortran main program cacm
april 1965 tajiri k ca650414 jb march 7 1978 3
34 pm 1277 5 1277 1277 5 1277 1277 5
1277 
# 1278
wengert s numer method for partial deriv orbit determin and
quasilinear in a recent articl in the commun of the
acm r wengert suggest a techniqu for machin evalu of
the partial deriv of a function given in analyt form
in solv non linear boundari valu problem us quasilinear mani
partial deriv must be form analyt and then evalu numer
wengert s method appear veri attract from the program viewpoint
equat which might not otherwis be undertaken cacm april 1965
bellman r e kagiwada h kalaba r e ca650413 jb
march 7 1978 3 39 pm 1028 4 1278 1216
4 1278 1216 4 1278 1278 4 1278 1278 4
1278 1278 4 1278 1347 4 1278 1347 4 1278
1396 4 1278 1396 4 1278 1536 4 1278 973
5 1278 1028 5 1278 1029 5 1278 1278 5
1278 1278 5 1278 1278 5 1278 1347 5 1278
1396 5 1278 964 6 1278 1028 6 1278 1028
6 1278 1029 6 1278 1029 6 1278 1083 6
1278 1132 6 1278 1214 6 1278 1278 6 1278
1278 6 1278 1334 6 1278 1365 6 1278 1386
6 1278 1387 6 1278 1388 6 1278 1392 6
1278 1393 6 1278 1394 6 1278 1395 6 1278
1396 6 1278 1397 6 1278 1496 6 1278 284
6 1278 407 6 1278 3199 6 1278 3200 6
1278 3201 6 1278 3202 6 1278 3203 6 1278
3204 6 1278 561 6 1278 730 6 1278 
# 1279
us of a condit base number system for encod sequenc
of correl charact a procedur is describ for the rel
effici encod of sequenc of charact which have predecessor successor
select rule the procedur is shown to assign a uniqu
integ to each sequenc and to gener a reason compact
set of valu cacm april 1965 brown r m ca650412
jb march 7 1978 3 42 pm 1279 5 1279
1279 5 1279 1279 5 1279 
# 1280
numer integr of a differenti differ equat with a decreas
time lag system in which variabl time lag ar present
ar of common occurr in biologi variabl flow rate ar
a common caus of these variabl lag at present no
extens bodi of knowledg exist concern the effect which these
variabl lag can caus shown here is a method of
reduc some differenti differ equat to ordinari differenti equat which
can then be studi numer with eas subsequ studi will
deal with situat in which multipl lag and lag depend
on the solut itself ar present cacm april 1965 bellman
r e buell j d kalaba r e ca650411 jb
march 7 1978 3 46 pm 1280 5 1280 1280
5 1280 1280 5 1280 1364 5 1280 1280 6
1280 
# 1281
data input by question and answer a data input scheme
for a time share comput is describ in thi paper
instead of us format statement to determin the input the
comput ask the user for the requir valu on at
a time the comput convers with the user dure the
input process check for error provid standard data and allow
edit of valu input cacm april 1965 pyle i c
ca650410 jb march 7 1978 3 48 pm 1281 5
1281 1281 5 1281 1281 5 1281 
# 1282
the us of fortran in subroutin with cobol main program
by us the proper cobol code techniqu and account for
differ in storag alloc and librari routin between the two
languag it is possibl to write fortran iv subroutin that
mai be call from cobol main program such a techniqu
enabl the programm to take advantag of the most us
properti of each languag while minim their respect disadvantag cacm
april 1965 shavel z a ca650409 jb march 7 1978
3 52 pm 1282 5 1282 1282 5 1282 1282
5 1282 
# 1283
matrix invers algorithm 231 f1 cacm april 1965 fer m
ca650408 jb march 7 1978 3 53 pm 1283 5
1283 1283 5 1283 1283 5 1283 
# 1284
bessel function for a set of integ order cacm april
1965 stafford j ca650407 jb march 7 1978 3 54
pm 1284 5 1284 1284 5 1284 1284 5 1284
1909 5 1284 134 6 1284 1023 6 1284 1284
6 1284 1316 6 1284 
# 1285
eigenvalu and eigenvector of a real symmetr matrix by the
qr method algorithm 254 f2 cacm april 1965 busing p
a ca650406 jb march 7 1978 3 55 pm 1285
5 1285 1285 5 1285 1285 5 1285 
# 1286
eigenvalu of a real symmetr matrix by the qr method
algorithm 253 f2 cacm april 1965 busing p a ca650405
jb march 7 1978 3 56 pm 1286 5 1286
1286 5 1286 1286 5 1286 
# 1287
vector coupl or clebsch gordan coeffici algorithm 252 z cacm
april 1965 gunn j h ca650404 jb march 7 1978
3 58 pm 1287 5 1287 1287 5 1287 1287
5 1287 
# 1288
clp the cornel list processor present in thi paper ar
the highlight of clp a teach languag which ha been
emploi at cornel univers and wa construct to serv as
a mean of introduc simul and other list process concept
the variou advantag of clp ar discuss and exampl ar
given cacm april 1965 conwai r w delfauss j j
maxwel w l walker w e ca650403 jb march 7
1978 4 02 pm 1179 4 1288 1288 4 1288
1544 4 1288 1646 4 1288 2111 4 1288 2534
4 1288 2556 4 1288 2650 4 1288 1288 5
1288 1288 5 1288 1288 5 1288 830 5 1288
# 1289
propos revis american standard code for inform interchang cacm april
1965 ca650402 jb march 7 1978 4 03 pm 1289
5 1289 1289 5 1289 1289 5 1289 
# 1290
transpar mode control procedur for data commun us the american
standard code for inform interchang a tutori thi paper give
the consider of task group x3 3 4 in the
area of transpar mode data commun control philosophi the appear
of thi paper wa forecast underth name of second level
control in the earlier tutori paper control procedur for data
commun task group document x3 3 4 44 date mai
1964 the present paper elabor upon solut to the problem
of transpar to the basic ascii commun control charact as
outlin in the previou paper mention abov moreov it goe
on to cover the addit control problem of handl materi
such as off line encrypt data or non ascii code
by mean of system provid complet charact transpar it doe
not cover concept of transpar in which the normal charact
structur or modul rate of a system mai be abandon
in conjunct with the earlier tutori paper thi paper is
expect to lead to a propos for stand ardizationof data
commun control procedur us the american stand ard code for
inform interchang cacm april 1965 ca650401 jb march 7 1978
4 10 pm 1290 5 1290 1290 5 1290 1290
5 1290 
# 1291
tabular input of data cacm march 1965 georg r ca650316
jb march 7 1978 4 11 pm 1291 5 1291
1291 5 1291 1291 5 1291 
# 1292
on a divid and correct method for variabl precis divis
describ in thi paper is a divid and correct method
for variabl precis divis in digit comput unlik the earlier
method of stein and pope the present method us a
suitabl round form of the normal divisor for get an
estim of the quotient charact thi result in a correct
of at most plu or minu on to the estim
to obtain the exact quotient charact it is believ that
thi method will be wide applic for divis oper in
variabl word length charact orient machin cacm march 1965 krishnamurthi
e v ca650315jb march 7 1978 4 16 pm 1026
4 1292 1258 4 1292 1258 4 1292 1292 4
1292 1292 4 1292 1497 4 1292 1497 4 1292
1975 4 1292 2605 4 1292 107 5 1292 1026
5 1292 1292 5 1292 1292 5 1292 1292 5
1292 1497 5 1292 1593 5 1292 1975 5 1292
107 6 1292 1026 6 1292 1026 6 1292 1292
6 1292 1292 6 1292 1292 6 1292 1497 6
1292 1593 6 1292 91 6 1292 
# 1293
method is random certain nonrandom properti of a commonli us
random number gener ar describ and analyz cacm march 1965
greenberg m ca650314 jb march 7 1978 4 18 pm
1293 5 1293 1293 5 1293 1293 5 1293 1674
5 1293 1691 5 1293 1293 6 1293 1293 6
1293 1420 6 1293 1631 6 1293 
# 1294
note on tripl precis float point arithmet with 132 bit
number in a recent paper gregori and ranei describ a
techniqu for doubl precis float point arithmet a similar techniqu
can be develop for tripl precis float point arithmet and
it is the purpos of thi note to describ thi
techniqu onli the multipl and the divis algorithm ar describ
sinc the addit subtract algorithm can be obtain by a
trivial modif of the algorithm in gregori s and ranei
s paper cacm march 1965 ikeb y ca650313 jb march
7 1978 5 54 pm 1294 4 1294 1152 5
1294 1294 5 1294 1294 5 1294 1294 5 1294
# 1295
pert time calcul without topolog order a simplifi techniqu is
present for pert time calcul without topolog order each event
is assign a uniqu memori locat an activ is repres
by a link a link is defin as a memori
locat contain the address of anoth memori locat the time
inform for an activ is carri with it link for
a typic net the major of activ can be describ
by on 36 bit cell each the remaind us two
36 bit cell each the link ar unidirect forward dure
the t e calcul expect complet time for an activ
backward dure the t l calcul time latest allow for
complet of an activ the calcul progress through the net
topolog even though the net is not repres topolog in
core cacm march 1965 lass s e ca650312 jb march
7 1978 6 00 pm 1295 5 1295 1295 5
1295 1295 5 1295 1611 5 1295 1295 6 1295
340 6 1295 
# 1296
ativ algorithm 205 e4 cacm march 1965 wasscher e j
ca650311 jb march 7 1978 6 01 pm 1296 5
1296 1296 5 1296 1296 5 1296 
# 1297
steep1 algorithm 203 e4 cacm march 1965 varah j m
ca650310 jb march 7 1978 6 02 pm 1297 5
1297 1297 5 1297 1297 5 1297 
# 1298
adapt numer integr by simpson s rule algorithm 145 d1
cacm march 1965 pike m c ca650309 jb march 7
1978 6 03 pm 1298 5 1298 1298 5 1298
1298 5 1298 2093 5 1298 834 6 1298 872
6 1298 1092 6 1298 1298 6 1298 1573 6
1298 429 6 1298 
# 1299
solut of the diophantin equat algorithm 139 a1 cacm march
1965 bowlden h j ca650308 jb march 7 1978 6
04 pm 1299 5 1299 1299 5 1299 1299 5
1299 
# 1300
function minim algorithm 251 e4 cacm march 1965 well m
ca650307 jb march 7 1978 6 05 pm 1300 5
1300 1300 5 1300 1300 5 1300 
# 1301
on algol i o convent cacm march 1965 zaremba w
a ca650306 jb march 7 1978 6 06 pm 1301
5 1301 1301 5 1301 1301 5 1301 
# 1302
parallel signal speed for data transmiss propos american stand ard
cacm march 1965 ca650305 jb march 7 1978 6 08
pm 1302 5 1302 1302 5 1302 1302 5 1302
# 1303
a correspond between algol 60 and church s lambda notat
part ii cacm march 1965 landin p j ca650304 jb
march 7 1978 6 09 pm 1303 5 1303 1303
5 1303 1303 5 1303 1469 5 1303 1486 5
1303 1491 5 1303 1781 5 1303 2178 5 1303
2326 5 1303 2470 5 1303 2684 5 1303 3044
5 1303 123 6 1303 196 6 1303 196 6
1303 919 6 1303 990 6 1303 1007 6 1303
1046 6 1303 1131 6 1303 1139 6 1303 1140
6 1303 1140 6 1303 1149 6 1303 1198 6
1303 1215 6 1303 1223 6 1303 1265 6 1303
1303 6 1303 1303 6 1303 1303 6 1303 1303
6 1303 1303 6 1303 1303 6 1303 1303 6
1303 1303 6 1303 1303 6 1303 1323 6 1303
1323 6 1303 1323 6 1303 1323 6 1303 1358
6 1303 1366 6 1303 1421 6 1303 1460 6
1303 1462 6 1303 1463 6 1303 1467 6 1303
1468 6 1303 1469 6 1303 1477 6 1303 1491
6 1303 1496 6 1303 1531 6 1303 1535 6
1303 1565 6 1303 1601 6 1303 1602 6 1303
1613 6 1303 1614 6 1303 1626 6 1303 1641
6 1303 1787 6 1303 1788 6 1303 205 6
1303 210 6 1303 1834 6 1303 1834 6 1303
224 6 1303 249 6 1303 288 6 1303 316
6 1303 381 6 1303 398 6 1303 2059 6
1303 11 6 1303 2127 6 1303 2192 6 1303
2264 6 1303 404 6 1303 410 6 1303 463
6 1303 464 6 1303 483 6 1303 3184 6
1303 3184 6 1303 3184 6 1303 3184 6 1303
3186 6 1303 3188 6 1303 584 6 1303 600
6 1303 680 6 1303 691 6 1303 729 6
1303 763 6 1303 799 6 1303 
# 1304
a rapid turnaround multi program system in thi paper basic
featur system characterist and the control algorithm for a multi
program system with rapid turnaround time ar describ cacm march
1965 iron e t ca650303 jb march 7 1978 6
19 pm 1304 5 1304 1304 5 1304 1304 5
1304 1550 5 1304 1304 6 1304 1472 6 1304
# 1305
the intern structur of the fortran cep translat the fortran
cep translat convert a sourc program written in the fortran
cep languag into an object program written in the languag
of the cep comput in thi paper after an outlin
of the cep comput the intern structur of the translat
is describ emphasi is on the compil of express of
input output list and of subscript variabl cacm march 1965
mancino o g cecchi m m ca650302 jb march 7
1978 6 23 pm 1305 4 1305 1035 5 1305
1305 5 1305 1305 5 1305 1305 5 1305 
# 1306
a class of unambigu comput languag discuss in thi paper
is the concept of a fulli nest comput languag which
mai be on mean of design comput languag which would
be complet free of ambigu sever suggest ar also given
here for the redefinit of algol as a fulli nest
languag cacm march 1965 johnston j b ca650301 jb march
7 1978 6 26 pm 249 4 1306 254 4
1306 272 4 1306 1102 4 1306 1109 4 1306
1140 4 1306 1188 4 1306 1306 4 1306 1306
4 1306 1464 4 1306 1491 4 1306 1767 4
1306 1781 4 1306 1781 4 1306 1787 4 1306
1949 4 1306 321 4 1306 2059 4 1306 2126
4 1306 435 4 1306 437 4 1306 463 4
1306 483 4 1306 491 4 1306 2732 4 1306
560 4 1306 583 4 1306 3073 4 1306 627
4 1306 631 4 1306 632 4 1306 642 4
1306 644 4 1306 653 4 1306 680 4 1306
761 4 1306 762 4 1306 763 4 1306 123
4 1306 140 4 1306 919 4 1306 989 4
1306 196 5 1306 1306 5 1306 1306 5 1306
1306 5 1306 463 5 1306 
# 1307
a lightpen control program for on line data analysi thi
paper describ a techniqu design to eas the us of
a data process system by a person in particular a
scientist who is intim and primarili concern with interpret the
signific of data handl by the system sinc such a
person is often unabl to spend the time necessari to
master a program languag it is essenti that he be
aid in compos command to the comput in the system
describ the user is not requir to learn or rememb
the vocabulari of the languag becaus the vocabulari is displai
befor him on menu by mean of a comput drive
scope he select the variou vocabulari element requir by point
with the light pen by us of a small unord
set of rewrit rule appli as a result of light
pen select the user gener onli syntact correct command to
the system he doe not have to learn or rememb
the grammar the program restrict the user sever in the
particular languag he can us but the method for commun
with the program make these restrict seem quit natur and
unconstrain the program ha been us successfulli for over ten
month cacm februari 1965 goodenough j b ca650217 jb march
7 1978 10 40 pm 1307 5 1307 1307 5
1307 1307 5 1307 1978 5 1307 1307 6 1307
1589 6 1307 1813 6 1307 
# 1308
a mathemat model for mechan part descript the flexibl of
a mathemat model take advantag of the common inform requir
of comput aid engin draw numer control tape gener and
physic characterist comput by judici control of man machin commun
requir improv result over convent engin design process ar possibl
an english like input languag tailor for us by draftsmen
and design will describ the part and specifi the output
desir on approach to the mathemat model consist of a
group of surfac defin quadric equat which ar creat by
a system of modular subprogram other subprogram will convert the
mathemat model into instruct for drive automat draft machin and
numer control machin tool physic part characterist such as center
of graviti can be comput by subprogram and us in
dynam analysi work the propos overal system is present and
experi and demonstr ar discuss cacm februari 1965 luh j
y s krolak r j ca650216 jb march 7 1978
10 46 pm 1308 5 1308 1308 5 1308 1308
5 1308 
# 1309
a comput user orient system a comput languag system ha
been develop which make possibl fast prepar of manag report
regardless of comput complex or format varieti cost ar suffici
low so that individu tailor report can be prepar for
everi manag the system requir initi prepar of larg data
bank contain data in elementari form us of two special
languag extract and matran permit select extract of ani data
subset effici process through ani comput sequenc and flexibl present
of result in either tabular or graphic form matrix algebra
is us as a fundament vehicl for accomplish both manipul
and comput cacm februari 1965 montillon g d ca650215 jb
march 7 1978 10 51 pm 1309 4 1309 892
4 1309 1309 5 1309 1309 5 1309 1309 5
1309 656 5 1309 
# 1310
a rapid braill transliter techniqu for certain ibm machin cacm
februari 1965 weiler w j klema v c ca650214 jb
march 7 1978 10 55 pm 1310 5 1310 1310
5 1310 1310 5 1310 
# 1311
effici autocorrel cacm februari 1965 schmid l p ca650213 jb
march 7 1978 10 56 pm 1311 5 1311 1311
5 1311 1311 5 1311 
# 1312
recurs and iter cacm februari 1965 rice h g ca650212
jb march 7 1978 10 57 pm 1312 5 1312
1312 5 1312 1312 5 1312 3121 5 1312 1312
6 1312 308 6 1312 309 6 1312 2456 6
1312 2709 6 1312 
# 1313
construct of nonlinear program test problem cacm februari 1965 rosen
j b suzuki s ca650211 jb march 7 1978 10
58 pm 1313 5 1313 1313 5 1313 1313 5
1313 3099 5 1313 3138 5 1313 1313 6 1313
1313 6 1313 2031 6 1313 
# 1314
the organ of symbol tabl an effici symbol tabl organ
is an import featur in the design of ani compil
dure the construct of the virginia algol 60 compil for
the burrough b205 the primari consider in the symbol tabl
design wa that the recognit of identifi and reserv word
should be as rapid as possibl the gener featur of
the techniqu ar describ cacm februari 1965 batson a ca650210
jb march 7 1978 11 01 pm 1314 5 1314
1314 5 1314 1314 5 1314 2033 5 1314 1314
6 1314 1785 6 1314 1786 6 1314 
# 1315
autom of the radioisotop account system the radioisotop servic of
the veteran administr hospit omaha nebraska us a manual system
of radioisotop account for three year the procedur which wa
satisfactori but time consum wa convert from manual to a
fulli autom comput system in januari 1963 the program for
purchas radioisotop is written in format fortran for the ibm
1620 comput a second program for maintain account for reactor
creat radioisotop is written in the forcom program languag a
minimum amount of bookkeep is requir by the reactor oper
staff the unit state atom energi commiss regul specifi that
record be kept thi system provid detail record for each
contain of radioact materi purchas and or creat in the
triga reactor indic the amount receiv us and or transfer
to the health physicist for dispos consolid record contain total
amount receiv us and or dispos of for ani specifi
period of time purchas radioisotop ar report in millicuri reactor
creat radioisotop in microcuri cacm februari 1965 lahner e l
ca650209 jb march 7 1978 11 10 pm 1315 5
1315 1315 5 1315 1315 5 1315 
# 1316
bessel function of the first kind algorithm 236 s17 cacm
februari 1965 gautschi w ca650208 jb march 7 1978 11
11 pm 1316 5 1316 1316 5 1316 1316 5
1316 1909 5 1316 134 6 1316 1023 6 1316
1284 6 1316 1316 6 1316 
# 1317
poisson charlier polynomi algorithm 234 s23 cacm februari 1965 samet
p ca650207 jb march 7 1978 11 12 pm 1317
5 1317 1317 5 1317 1317 5 1317 
# 1318
arccossin algorithm 206 b1 cacm februari 1965 bowlden h j
ca650206 jb march 7 1978 11 14 pm 1318 5
1318 1318 5 1318 1318 5 1318 
# 1319
crout with equilibr and iter algorithm 135 f4 cacm februari
1965 meissner l p ca650205 jb march 7 1978 11
15 pm 1319 4 1319 1319 4 1319 454 4
1319 140 4 1319 152 5 1319 1128 5 1319
1319 5 1319 1319 5 1319 1319 5 1319 
# 1320
invers permut algorithm 250 g6 cacm februari 1965 boonstra b
h ca650204 jb march 7 1978 11 16 pm 1320
5 1320 1320 5 1320 1320 5 1320 
# 1321
outreal n algorithm i5 cacm februari 1965 wirth n e
ca650203 jb march 7 1978 11 17 pm 1321 5
1321 1321 5 1321 1321 5 1321 1705 5 1321
984 6 1321 986 6 1321 1020 6 1321 1321
6 1321 
# 1322
netflow algorithm 248 h cacm februari 1965 brigg w a
ca650202 jb march 7 1978 11 18 pm 1322 5
1322 1322 5 1322 1322 5 1322 1690 5 1322
1322 6 1322 
# 1323
a correspond between algol 60 and church s lambda notat
part i thi paper describ how some of the semant
of algol 60 can be formal by establish a correspond
between express of algol 60 and express in a modifi
form of church s l notat first a model for
comput languag and comput behavior is describ base on the
notion of function applic and function abstract but also have
analogu for imper languag featur then thi model is us
as an abstract object languag into which algol 60 is
map mani of algol 60 s featur emerg as particular
arrang of a small number of structur rule suggest new
classif and gener the correspond is first describ inform mainli
by illustr the second part of the paper give a
formal descript i e an abstract compil into the abstract
objct languag thi is itself present in a pure function
notat that is on us onli applic and abstract cacm
februari 1965 landin p j ca650201 jb march 7 1978
11 26 pm 1086 4 1323 1132 4 1323 1234
4 1323 1263 4 1323 1265 4 1323 1270 4
1323 1323 4 1323 1323 4 1323 1323 4 1323
1358 4 1323 1358 4 1323 1379 4 1323 1380
4 1323 1380 4 1323 1453 4 1323 1464 4
1323 1484 4 1323 1491 4 1323 1498 4 1323
1613 4 1323 1614 4 1323 1665 4 1323 1781
4 1323 1781 4 1323 1787 4 1323 1825 4
1323 1860 4 1323 1989 4 1323 2083 4 1323
2112 4 1323 2178 4 1323 2179 4 1323 2252
4 1323 2325 4 1323 2341 4 1323 2534 4
1323 2541 4 1323 2546 4 1323 2645 4 1323
2652 4 1323 2684 4 1323 2698 4 1323 2733
4 1323 2820 4 1323 2842 4 1323 2929 4
1323 2934 4 1323 3069 4 1323 3073 4 1323
3155 4 1323 669 4 1323 679 4 1323 691
4 1323 761 4 1323 949 4 1323 989 4
1323 1323 5 1323 1323 5 1323 1323 5 1323
267 5 1323 1781 5 1323 2178 5 1323 2326
5 1323 2684 5 1323 3184 5 1323 799 5
1323 123 6 1323 196 6 1323 919 6 1323
990 6 1323 1007 6 1323 1046 6 1323 1131
6 1323 1139 6 1323 1140 6 1323 1149 6
1323 1198 6 1323 1215 6 1323 1223 6 1323
1265 6 1323 1303 6 1323 1303 6 1323 1303
6 1323 1303 6 1323 1323 6 1323 1323 6
1323 1323 6 1323 1323 6 1323 1358 6 1323
1366 6 1323 1421 6 1323 1460 6 1323 1462
6 1323 1463 6 1323 1467 6 1323 1468 6
1323 1477 6 1323 1491 6 1323 1496 6 1323
1531 6 1323 1535 6 1323 1565 6 1323 1601
6 1323 1602 6 1323 1613 6 1323 1614 6
1323 1626 6 1323 1641 6 1323 1787 6 1323
1788 6 1323 205 6 1323 1834 6 1323 224
6 1323 249 6 1323 288 6 1323 316 6
1323 381 6 1323 398 6 1323 2059 6 1323
11 6 1323 2127 6 1323 2192 6 1323 404
6 1323 410 6 1323 463 6 1323 464 6
1323 483 6 1323 3184 6 1323 3184 6 1323
3184 6 1323 3186 6 1323 3188 6 1323 584
6 1323 600 6 1323 680 6 1323 691 6
1323 763 6 1323 799 6 1323 
# 1324
answer english question by comput a survei fifteen experiment english
languag question answer system which ar program and oper ar
describ and review the system rang from a convers machin
to program which make sentenc about pictur and system which
translat from english into logic calculi system ar classifi as
list structur data base graphic data base text base and
inferenti principl and method of oper ar detail and discuss
it is conclud that the data base question answer ha
pass from initi research into the earli development phase the
most difficult and import research question for the advanc of
gener purpos languag processor ar seen to be concern with
measur deal with ambigu translat into formal languag and search
larg tree structur cacm januari 1965 simmon r f ca650113
jb march 8 1978 2 21 pm 1324 4 1324
1324 4 1324 1324 4 1324 892 4 1324 931
4 1324 1155 5 1324 1324 5 1324 1324 5
1324 1324 5 1324 1456 5 1324 1468 5 1324
1515 5 1324 1699 5 1324 1856 5 1324 2127
5 1324 634 5 1324 652 5 1324 653 5
1324 1155 6 1324 1155 6 1324 1194 6 1324
1225 6 1324 1324 6 1324 1324 6 1324 1324
6 1324 1324 6 1324 1324 6 1324 1324 6
1324 1324 6 1324 1487 6 1324 1527 6 1324
1553 6 1324 1681 6 1324 1781 6 1324 1856
6 1324 
# 1325
remot on line real time comput diagnosi of the clinic
electrocardiogram present in thi paper is a brief report on
the hardwar softwar system configur and function of a system
for the remot onlin real time digit comput diagnosi of
clinic electrocardiogram it seem like that effort of thi sort
will lead to a satisfactori solut to the problem of
the automat diagnosi of electrocardiogram current attempt by the author
to extend the diagnost capabl of the present system ar
particularli concern with increas the fidel of the adapt match
filter the develop of three dimension pattern analysi the analysi
of parallel electrocardiograph comput diagnost interact and a studi of
the possibl of introduc major tree like branch decis earli
in the diagnost process cacm januari 1965 whippl g h
dickson j f horib h stark l ca650112 jb march
8 1978 2 27 pm 1325 4 1325 1325 5
1325 1325 5 1325 1325 5 1325 462 5 1325
# 1326
boundari network a feasibl comput procedur is describ for determin
the total or partial inclus of arbitrarili given point and
line with respect to a set of gener polygon domain
which partit a plane bound region a scheme for the
comput represent of the boundari of the domain and an
algorithm base on thi scheme for evalu the inclus relat
ar specifi in detail the method emploi sever level of
select criteria for the purpos of reduc the number of
access to auxiliari storag devic and the amount of boundari
data for which process is requir cacm januari 1965 loomi
r g ca650111 jb march 8 1978 2 31 pm
1326 5 1326 1326 5 1326 1326 5 1326 1630
5 1326 2547 5 1326 2987 5 1326 3165 5
1326 1326 6 1326 1326 6 1326 1326 6 1326
1326 6 1326 1630 6 1326 1925 6 1326 2125
6 1326 2547 6 1326 2633 6 1326 2987 6
1326 421 6 1326 524 6 1326 
# 1327
us of decis tabl in comput program a decis tabl
is a tabular form for displai decis logic decis tabl
have mani inher advantag the techniqu to be illustr put
these advantag to us in that it enabl on to
program directli from a decis tabl the techniqu is base
on the creation of a binari imag of a limit
entri decis tabl in comput memori a binari imag of
a given set of input condit can also be creat
thi data imag is us to scan the decis tabl
imag to arriv at the proper cours of action there
ar sever advantag gain from the program point view 1
amount of comput memori us is drastic reduc 2 program
is simplifi and 3 document is brief and clear cacm
januari 1965 kirk h w ca650110 jb march 8 1978
2 36 pm 1327 5 1327 1327 5 1327 1327
5 1327 1354 5 1327 1488 5 1327 2053 5
1327 2220 5 1327 2273 5 1327 2726 5 1327
2856 5 1327 1172 6 1327 1172 6 1327 1172
6 1327 1172 6 1327 1172 6 1327 1172 6
1327 1237 6 1327 1237 6 1327 1237 6 1327
1237 6 1327 1237 6 1327 1327 6 1327 1327
6 1327 1327 6 1327 1327 6 1327 1327 6
1327 1327 6 1327 1327 6 1327 1354 6 1327
1354 6 1327 1354 6 1327 1354 6 1327 1354
6 1327 1488 6 1327 1489 6 1327 1489 6
1327 1548 6 1327 1548 6 1327 1684 6 1327
250 6 1327 2053 6 1327 2053 6 1327 2220
6 1327 2220 6 1327 2220 6 1327 2221 6
1327 2263 6 1327 2453 6 1327 2598 6 1327
# 1328
further remark on reduc truncat error cacm januari 1965 kahan
w ca650109 jb march 8 1978 2 37 pm 1328
4 1328 1333 4 1328 2144 4 1328 1052 5
1328 1328 5 1328 1328 5 1328 1328 5 1328
2282 5 1328 2860 5 1328 3083 5 1328 1328
6 1328 1328 6 1328 1328 6 1328 1973 6
1328 2049 6 1328 2107 6 1328 2203 6 1328
2543 6 1328 2552 6 1328 492 6 1328 
# 1329
simul of boolean function in a decim comput cacm januari
1965 mano m m ca650108 jb march 8 1978 2
38 pm 1207 5 1329 1208 5 1329 1329 5
1329 1329 5 1329 1329 5 1329 3053 5 1329
1329 6 1329 1329 6 1329 1329 6 1329 1785
6 1329 1973 6 1329 1992 6 1329 2107 6
1329 2109 6 1329 2412 6 1329 2543 6 1329
2673 6 1329 2707 6 1329 2770 6 1329 
# 1330
autom plot flow chart on a small comput cacm januari
1965 anderson h e ca650107 jb march 8 1978 2
39 pm 1330 4 1330 1330 4 1330 1348 4
1330 2315 4 1330 1330 5 1330 1330 5 1330
1330 5 1330 528 5 1330 728 5 1330 
# 1331
code structur for protect and manipul of variabl length item
when item ar made up of a variabl number of
charact each contain the same number of bit certain control
inform partit symbol is insert to mark their separ sinc
error in identif of these control charact can lead to
seriou troubl method of protect these symbol ar indic a
6 bit code assign of alphanumer charact for fix word
length comput is given and it suitabl for error detect
and variabl length item manipul is shown also indic is
it flexibl dure certain arithmet oper cacm januari 1965 ramamoorthi
c v ca650106 jb march 8 1978 2 48 pm
1331 5 1331 1331 5 1331 1331 5 1331 
# 1332
subroutin assembl a descript is given of an assembl system
which requir onli on pass and doe not maintain a
tabl of inform about the subroutin librari cacm januari 1965
samet p a ca650105 jb march 8 1978 2 51
pm 1332 4 1332 1044 5 1332 1332 5 1332
1332 5 1332 1332 5 1332 
# 1333
reduc truncat error us cascad accumul when accumul a larg
number of quantiti as in numer integr the sum itself
mai becom much larger than the individu addend thi result
in truncat error much of thi error can be elimin
us cascad accumul as note in a recent articl by
wolf a simpler and slightli more flexibl algorithm is present
which deal also with the case of neg addend cacm
januari 1965 ross d r ca650104 jb march 8 1978
2 54 pm 1328 4 1333 1333 4 1333 2144
4 1333 1052 5 1333 1333 5 1333 1333 5
1333 1333 5 1333 
# 1334
mechan of tediou algebra the newcomb oper of planetari theori
a comput program ha been written to gener tabl of
formula for the newcomb oper of planetari theori the newcomb
oper ar express as polynomi in two variabl on of
which stand for a simpl differenti oper and the other
for an arbitrari integ the polynomi ar gener by a
recurr scheme the program is code in fortran us simpl
arrai manipul techniqu to perform the algebra oper formula for
over 100 newcomb oper have been produc by the program
and typeset photograph on an s 560 photon system cacm
januari 1965 gerard j m izsak i g barnett m
p ca650103 jb march 8 1978 2 59 pm 1334
4 1334 1396 4 1334 1444 4 1334 964 5
1334 1334 5 1334 1334 5 1334 1334 5 1334
1396 5 1334 964 6 1334 1028 6 1334 1029
6 1334 1083 6 1334 1132 6 1334 1214 6
1334 1278 6 1334 1334 6 1334 1365 6 1334
1386 6 1334 1387 6 1334 1388 6 1334 1392
6 1334 1393 6 1334 1394 6 1334 1395 6
1334 1396 6 1334 1397 6 1334 1496 6 1334
284 6 1334 407 6 1334 3199 6 1334 3200
6 1334 3201 6 1334 3202 6 1334 3203 6
1334 3204 6 1334 561 6 1334 730 6 1334
# 1335
charact set for optic charact recognit propos american stand ard
cacm januari 1965 ca650102 jb march 8 1978 3 00
pm 1335 5 1335 1335 5 1335 1335 5 1335
# 1336
npl highlight of a new program languag cacm januari 1965
radin g rogowai h p ca650101 jb march 8 1978
3 01 pm 1247 5 1336 1336 5 1336 1336
5 1336 1336 5 1336 1945 5 1336 823 6
1336 914 6 1336 915 6 1336 917 6 1336
984 6 1336 989 6 1336 990 6 1336 1012
6 1336 1084 6 1336 1098 6 1336 1122 6
1336 1138 6 1336 1139 6 1336 1141 6 1336
1200 6 1336 1223 6 1336 1265 6 1336 1336
6 1336 1336 6 1336 1396 6 1336 1455 6
1336 1477 6 1336 1487 6 1336 1491 6 1336
1496 6 1336 483 6 1336 584 6 1336 669
6 1336 680 6 1336 763 6 1336 
# 1337
euler a gener of algol and it formal definit cacm
decemb 1966 wirth n weber h ca661212 jb march 30
1978 9 11 am 1337 5 1337 1337 5 1337
1337 5 1337 2423 5 1337 1337 6 1337 2015
6 1337 
# 1338
addit comment on a problem in concurr progam control cacm
decemb 1966 knuth d e ca661211 jb march 30 1978
9 12 am 1338 5 1338 1338 5 1338 1338
5 1338 2150 5 1338 2228 5 1338 2256 5
1338 2342 5 1338 2618 5 1338 1198 6 1338
1198 6 1338 1198 6 1338 1198 6 1338 1198
6 1338 1338 6 1338 1338 6 1338 1338 6
1338 1338 6 1338 1338 6 1338 1749 6 1338
1749 6 1338 1749 6 1338 1877 6 1338 2256
6 1338 
# 1339
a contribut to the develop of algol cacm decemb 1966
wirth n hoar c a r ca661210 jb march 30
1978 9 13 am 1339 5 1339 1339 5 1339
1339 5 1339 
# 1340
multiplex of slow peripher the philosophi of a monitor which
allow slow output devic to be multiplex is present cacm
decemb 1966 abraham c lanc g n pearcei t ca661209
jb march 2 1978 2 25 pm 1340 5 1340
1340 5 1340 1340 5 1340 
# 1341
level of comput system in build current comput system we
tend to break them down into level of control command
and commun in us the system we break our problem
down correspondingli the continu us of such a structur rais
question about it effect on the us of futur system
particularli with regard to such trend as time share parallel
program and eventu system which learn in thi essai some
of these question ar pose and the gener attitud we
must take in pursu the problem further is discuss cacm
decemb 1966 bryant p ca661208 jb march 2 1978 2
29 pm 1341 5 1341 1341 5 1341 1341 5
1341 
# 1342
transport problem algorithm 293 h cacm decemb 1966 bayer g
ca661207a jb march 2 1978 2 30 pm 1342 5
1342 1342 5 1342 1342 5 1342 
# 1343
havi integr algorithm 257 d1 cacm decemb 1966 farka i
ca661207b jb march 23 1978 4 16 pm 1343 5
1343 1343 5 1343 1343 5 1343 
# 1344
statist comput base upon algebra specifi model base upon a
machin readabl statist model and relat symbol specif an effici
method of perform calcul for statist model of a balanc
complet natur is present fix mix and random analysi of
varianc model ar consid a procedur for obtain varianc compon
and calcul f statist for the model term is includ
cacm decemb 1966 schlater j e hemerl w j ca661206
jb march 2 1978 2 33 pm 1344 5 1344
1344 5 1344 1344 5 1344 
# 1345
tensor calcul on the comput a formac program ha been
written which is capabl of calcul variou quantiti of interest
in tensor calculu us thi code christoffel symbol have been
calcul for 12 basic orthogon coordin system cacm decemb 1966
walton j j ca661205 jb march 2 1978 2 35
pm 1345 5 1345 1345 5 1345 1345 5 1345
1543 5 1345 1664 5 1345 1345 6 1345 1345
6 1345 1543 6 1345 1616 6 1345 1616 6
1345 
# 1346
on the applic of the process of equal of maxima
to obtain ration approxim to certain modifi bessel function the
second reme algorithm as origin establish for polynomi mai converg
or not when the approxim function ar ration howev the
few result known in thi domain show how effici the
algorithm can be to obtain approxim with a small error
much more than in the polynomi case in which the
best approxim can be veri nearli approach directli by a
seri develop the aim of thi paper is to investig
the limit of the applic of certain extens of the
algorithm to the case where the approxim ar ration as
well as to present some numer result cacm decemb 1966
gargantini l ca661204 jb march 2 1978 2 39 pm
1015 4 1346 1346 4 1346 1346 4 1346 1440
4 1346 1645 4 1346 951 4 1346 951 5
1346 1346 5 1346 1346 5 1346 1346 5 1346
532 5 1346 
# 1347
gener time vari system error sensit program the evalu by
the propag of varianc techniqu of the sensit of time
vari system to initi condit and paramet error involv the
determin of sever system depend partial deriv matric thi requir
ha led to separ program for each system under investig
a new program through util of the wengert differenti techniqu
automat determin the requir matric from specif system equat suppli
in subroutin form at execut time elimin the need for
individu program and presag the further develop of extrem gener
comput program cacm decemb 1966 wilkin r d ca661203 jb
march 2 1978 2 44 pm 1028 4 1347 1216
4 1347 1216 4 1347 1278 4 1347 1278 4
1347 1347 4 1347 1347 4 1347 1347 4 1347
1396 4 1347 1396 4 1347 1396 4 1347 1536
4 1347 1028 5 1347 1029 5 1347 1278 5
1347 1347 5 1347 1347 5 1347 1347 5 1347
# 1348
flowtrac a comput program for flowchart program the flowtrac system
produc flowchart of program written in almost ani program languag
on most describ the syntax of the control statement in
hi languag for thi purpos a metalanguag is avail the
result object deck is us to flowchart ani program in
the languag describ sever exampl of fap and snobol flowchart
ar given howev it is not necessari to confin on
s scope to exist languag on mai defin hi own
languag in ani well structur manner thi featur is particularli
us when it is desir to chart onli comment within
a program such an approach permit the document of descript
remark and avoid the inclus of code detail cacm decemb
1966 sherman p m ca661202 jb march 2 1978 2
49 pm 1330 4 1348 1348 4 1348 2315 4
1348 1348 5 1348 1348 5 1348 1348 5 1348
2315 5 1348 728 5 1348 1348 6 1348 1834
6 1348 1987 6 1348 728 6 1348 
# 1349
comput capabl at western european univers thi report on the
author s trip to univers in western europ in the
summer of 1966 give brief descript of comput activ at
each institut visit present equip capabl vari from moder to
larg scale howev mani institut plan to acquir complex time
share system in the near futur in the author s
opinion the state of the art lag behind that on
thi contin thi lag is attribut to four princip factor
a the handicap organ of academ procedur b the univers
govern financi relationship c the subordin organ of the comput
facil d the pauciti of profession interchang of knowledg the
effect of these constraint ar explic cacm decemb 1966 finerman
a ca661201 jb march 2 1978 2 55 pm 1349
4 1349 1349 4 1349 1349 4 1349 1349 4
1349 689 4 1349 1349 5 1349 1349 5 1349
1349 5 1349 236 5 1349 1862 5 1349 323
5 1349 415 5 1349 83 5 1349 1349 6
1349 
# 1350
the augment predict analyz for context free languag it rel
effici it ha been proven by greibach that for a
given context free grammar g a standard form grammar gs
can be construct which gener the same languag as is
gener by g and whose rule ar all of the
form z cy 1 y m m o where z
and y i ar intermedi symbol and c a termin
symbol sinc the predict analyz at harvard us a standard
form grammar it can accept the languag of ani context
free grammar g given an equival standard form grammar gs
the structur descript sd gs x assign to a given
sentenc x by the predict analyz howev ar usual differ
from the structur descript sd g x assign to the
same sentenc by the origin context free grammar g from
which gs is deriv in section 1 an algorithm origin
due to abbott is describ standard form grammar each of
whose rule is in standard form supplement by addit inform
describ it deriv from the origin context free grammar a
techniqu for perform the sd gs x to sd g
x transform effect is also describ in section 2 the
augment predict analyz as a pars algorithm for arbitrari context
free languag is compar with two other pars algorithm a
select top to bottom algorithm similar to iron error correct
pars algorithm and an immedi constitu analyz which is an
extens of sakai cock s algorithm for normal grammar the
comparison is base upon sever criteria of effici cover core
storag requir complex of the program and process time cacm
novemb 1966 kuno s ca661108 jb march 2 1978 3
11 pm 1225 4 1350 1225 4 1350 1350 4
1350 1350 4 1350 1350 4 1350 1350 4 1350
1350 4 1350 1399 4 1350 1646 4 1350 1659
4 1350 1659 4 1350 1768 4 1350 1781 4
1350 1781 4 1350 1856 4 1350 1945 4 1350
1945 4 1350 1945 4 1350 2050 4 1350 2110
4 1350 2650 4 1350 2698 4 1350 2708 4
1350 3093 4 1350 3094 4 1350 1012 5 1350
1225 5 1350 1265 5 1350 1350 5 1350 1350
5 1350 1350 5 1350 1399 5 1350 1659 5
1350 680 5 1350 1225 6 1350 1265 6 1350
1350 6 1350 1671 6 1350 1697 6 1350 
# 1351
automat error bound on real zero of ration function a
procedur for implement an interv arithmet version of the newton
raphson method is propos the procedur requir onli a start
interv over which the zero of a given ration function
ar to be locat the method automat provid bound for
roundoff error cacm novemb 1966 dargel r h loscalzo f
r witt t h ca661107 jb march 2 1978 3
31 pm 1351 5 1351 1351 5 1351 1351 5
1351 
# 1352
automat integr of a function with a paramet two effici
method for automat numer integr ar romberg integr and adapt
simpson integr for integrand of the form f x g
x a where a is a paramet it is shown
that romberg s method is more effici a fortran program
show how to achiev thi greater effici cacm novemb 1966
rabinowitz p ca661106 jb march 2 1978 3 35 pm
1040 4 1352 1352 4 1352 1352 4 1352 1352
4 1352 1352 4 1352 1352 4 1352 1352 4
1352 1352 4 1352 1352 4 1352 1352 4 1352
1352 4 1352 1352 4 1352 1356 4 1352 1883
4 1352 1982 4 1352 1982 4 1352 2040 4
1352 2040 4 1352 2040 4 1352 2040 4 1352
2048 4 1352 2048 4 1352 2048 4 1352 2074
4 1352 2074 4 1352 2074 4 1352 2074 4
1352 2093 4 1352 2093 4 1352 2093 4 1352
2093 4 1352 2415 4 1352 2550 4 1352 1040
5 1352 1092 5 1352 1241 5 1352 1273 5
1352 1352 5 1352 1352 5 1352 1352 5 1352
324 5 1352 2040 5 1352 429 5 1352 570
5 1352 621 5 1352 786 5 1352 834 5
1352 872 5 1352 1241 6 1352 1273 6 1352
1352 6 1352 1356 6 1352 324 6 1352 621
6 1352 
# 1353
techniqu for automat toler control in linear program in thi
technic note the numer step for the simplex method of
linear program ar review and the toler need in the
numer procedur ar defin object criteria ar given for accomplish
the numer step of the method and the calcul of
necessari toler cacm novemb 1966 clasen r j ca661105 jb
march 2 1978 3 37 pm 1353 5 1353 1353
5 1353 1353 5 1353 2589 5 1353 1353 6
1353 
# 1354
convers of decis tabl to comput program by rule mark
techniqu the rule mask techniqu is on method of convert
limit entri decis tabl to comput program recent discuss suggest
that in mani circumst it is to be prefer to
the techniqu of construct network or tree a drawback of
the techniqu as hitherto present is it liabil to produc
object program of longer run time than necessari in thi
paper a modif of the techniqu is discuss which take
into account both rule frequenc and the rel time for
evalu condit thi can materi improv object program run time
cacm novemb 1966 king p j h ca661104 jb march
2 1978 3 41 pm 1354 4 1354 1354 4
1354 1354 4 1354 1488 4 1354 1488 4 1354
1994 4 1354 2053 4 1354 2053 4 1354 2053
4 1354 2220 4 1354 2220 4 1354 2220 4
1354 2273 4 1354 2273 4 1354 2273 4 1354
2453 4 1354 2598 4 1354 2726 4 1354 2726
4 1354 2856 4 1354 2856 4 1354 1172 5
1354 1237 5 1354 1327 5 1354 1354 5 1354
1354 5 1354 1354 5 1354 1684 5 1354 2053
5 1354 2220 5 1354 2273 5 1354 2453 5
1354 2726 5 1354 2856 5 1354 3113 5 1354
1172 6 1354 1172 6 1354 1172 6 1354 1172
6 1354 1172 6 1354 1172 6 1354 1237 6
1354 1237 6 1354 1237 6 1354 1327 6 1354
1327 6 1354 1327 6 1354 1327 6 1354 1327
6 1354 1354 6 1354 1354 6 1354 1354 6
1354 1354 6 1354 1354 6 1354 1354 6 1354
1354 6 1354 1354 6 1354 1488 6 1354 1489
6 1354 1489 6 1354 1548 6 1354 1548 6
1354 1564 6 1354 1684 6 1354 250 6 1354
2053 6 1354 2053 6 1354 2053 6 1354 2220
6 1354 2220 6 1354 2220 6 1354 2220 6
1354 2221 6 1354 2263 6 1354 2263 6 1354
2453 6 1354 2598 6 1354 2598 6 1354 2691
6 1354 2856 6 1354 753 6 1354 
# 1355
regular coulomb wave function algorithm 292 cacm novemb 1966 gautschi
w ca661103a jb march 2 1978 3 43 pm 1355
4 1355 2619 4 1355 1355 5 1355 1355 5
1355 1355 5 1355 1419 5 1355 
# 1356
havi integr algorithm 257 d1 cacm novemb 1966 hillstrom k
ca661103b jb march 23 1978 4 19 pm 1352 4
1356 1356 4 1356 1883 4 1356 2040 4 1356
1241 5 1356 1356 5 1356 1356 5 1356 1356
5 1356 2040 5 1356 1241 6 1356 1273 6
1356 1352 6 1356 1356 6 1356 324 6 1356
621 6 1356 
# 1357
examin schedul algorithm 286 h cacm novemb 1966 william r
ca661103c jb march 23 1978 4 20 pm 1357 5
1357 1357 5 1357 1357 5 1357 
# 1358
syntax macro and extend translat a translat approach is describ
which allow on to extend the syntax and semant of
a given high level base languag by the us of
a new formal call a syntax macro syntax macro defin
string transform base on syntact element of the base languag
two type of macro ar discuss and exampl ar given
of their us the condit gener of macro base on
option and altern recogn by the scan ar also describ
cacm novemb 1966 leavenworth b m ca661102 jb march 2
1978 3 46 pm 1037 4 1358 1086 4 1358
1132 4 1358 1234 4 1358 1234 4 1358 1263
4 1358 1265 4 1358 1270 4 1358 1323 4
1358 1323 4 1358 1358 4 1358 1358 4 1358
1358 4 1358 1358 4 1358 1358 4 1358 1379
4 1358 1380 4 1358 1380 4 1358 1453 4
1358 1464 4 1358 1484 4 1358 1491 4 1358
1491 4 1358 1498 4 1358 1565 4 1358 1613
4 1358 1614 4 1358 1665 4 1358 1781 4
1358 1781 4 1358 1781 4 1358 1781 4 1358
1787 4 1358 1788 4 1358 1825 4 1358 1860
4 1358 1989 4 1358 2083 4 1358 2112 4
1358 2178 4 1358 2179 4 1358 2252 4 1358
2325 4 1358 2341 4 1358 2534 4 1358 2541
4 1358 2546 4 1358 2645 4 1358 2652 4
1358 2684 4 1358 2698 4 1358 2733 4 1358
2820 4 1358 2842 4 1358 2929 4 1358 2934
4 1358 3069 4 1358 3073 4 1358 3155 4
1358 669 4 1358 679 4 1358 691 4 1358
761 4 1358 949 4 1358 989 4 1358 205
5 1358 1358 5 1358 1358 5 1358 1358 5
1358 1460 5 1358 1541 5 1358 1565 5 1358
1781 5 1358 1824 5 1358 2252 5 1358 3184
5 1358 729 5 1358 799 5 1358 123 6
1358 196 6 1358 919 6 1358 990 6 1358
1007 6 1358 1046 6 1358 1131 6 1358 1139
6 1358 1140 6 1358 1149 6 1358 1162 6
1358 1198 6 1358 1215 6 1358 1223 6 1358
1265 6 1358 1303 6 1358 1323 6 1358 1358
6 1358 1358 6 1358 1358 6 1358 1358 6
1358 1358 6 1358 1366 6 1358 1380 6 1358
1421 6 1358 1455 6 1358 1460 6 1358 1462
6 1358 1463 6 1358 1467 6 1358 1468 6
1358 1477 6 1358 1491 6 1358 1496 6 1358
1496 6 1358 1531 6 1358 1535 6 1358 1565
6 1358 1601 6 1358 1602 6 1358 1613 6
1358 1614 6 1358 1614 6 1358 1626 6 1358
1641 6 1358 1781 6 1358 1787 6 1358 1788
6 1358 205 6 1358 205 6 1358 224 6
1358 249 6 1358 288 6 1358 316 6 1358
381 6 1358 398 6 1358 11 6 1358 2155
6 1358 404 6 1358 404 6 1358 410 6
1358 463 6 1358 464 6 1358 483 6 1358
3184 6 1358 3184 6 1358 3188 6 1358 584
6 1358 600 6 1358 680 6 1358 691 6
1358 763 6 1358 799 6 1358 
# 1359
data filter appli to inform storag and retriev applic manipul
of data string is the most complex process function in
inform storag and retriev applic data string manipul is discuss
within the context of an interpret process environ control by
the us of procedur direct the sequenc of procedur direct
is deriv from a job assum to be express in
a user orient sourc languag each data string with the
structur data environ data bank is explicitli or implicitli relat
to a format declar resid in a format librari the
process mechan associ with data string manipul is develop in
accord with a gener data filter concept thi result in
the implement of a two part data filter modul that
satisfi intern process function by filter data string through format
declar associ with it input and output port cacm novemb
1966 larsen r p ca661101 jb march 2 1978 3
52 pm 1359 5 1359 1359 5 1359 1359 5
1359 
# 1360
descript of system us for data transmiss an asa tutori
cacm octob 1966 ca661007 jb march 2 1978 3 54
pm 1360 5 1360 1360 5 1360 1360 5 1360
# 1361
rectangular hole in twelv row punch card propos american standard
cacm octob 1966 ca661006 jb march 2 1978 3 55
pm 1361 5 1361 1361 5 1361 1361 5 1361
# 1362
code extens in ascii an asa tutori the american standard
code for inform interchang ascii contain a number of control
charact associ with the principl of code extens that is
with the represent of inform which cannot be directli repres
by mean of the charact in the code the manner
of us of these charact ha not previous been complet
describ thi paper present a set of mutual consist philosophi
regard code extens applic and suggest a corollari set of
doctrin for the applic of the code extens charact distinct
ar drawn between code extens and such other concept as
graphic substitut or syntact represent which ar often us to
meet similar requir also cover ar certain topic which ar
not truli concern with code extens but which ar often
link with it in discuss on code applic the materi
in thi paper is equal applic in principl to the
propos iso intern 7 bit code for inform interchang cacm
octob 1966 ca661005 jb march 2 1978 4 02 pm
1362 5 1362 1362 5 1362 1362 5 1362 
# 1363
a gener method of systemat interv comput for numer integr
of initi valu problem a procedur is given for continu
comput and monitor the step size to be us by
a self start p th order numer integr method to
solv an initi valu problem the procedur us an estim
of the truncat error to calcul the step size cacm
octob 1966 martin w c paulson k c sashkin l
ca661004 jb march 2 1978 4 05 pm 1363 5
1363 1363 5 1363 1363 5 1363 
# 1364
mathemat experiment in time lag modul equat of the form
du dt g u t u h t aris in
a number of scientif context the author point out some
interest properti of the solut u t u t 1
k sin wt sin at these properti were obtain by
mean of numer solut cacm octob 1966 bellman r buell
j kalaba r ca661003 jb march 2 1978 4 08
pm 1364 4 1364 1280 5 1364 1364 5 1364
1364 5 1364 1364 5 1364 
# 1365
elimin monoton mathemat with formac the formac formula manipul compil
program system provid a power tool for perform mathemat analysi
it is an extens of fortran iv which permit the
us of the comput to perform the tediou algebra comput
that aris in mani differ field among the area in
which it ha been successfulli us ar differenti of complic
express expans of truncat power seri solut of simultan equat
with liter coeffici nonlinear maximum likelihood estim tensor analysi and
gener of the coeffici of equat in keplerian motion these
type of analysi which aros in the solut of specif
practic problem in physic engin astronomi statist and astronaut ar
discuss in the paper in addit to it usag for
specif problem solut formac can also be us to autom
the analysi phase in certain product program sever such applic
ar present cacm octob 1966 tobei r g ca661002 jb
march 2 1978 4 14 pm 1396 5 1365 1365
5 1365 1365 5 1365 1365 5 1365 2229 5
1365 964 6 1365 1028 6 1365 1029 6 1365
1083 6 1365 1132 6 1365 1214 6 1365 1278
6 1365 1334 6 1365 1365 6 1365 1365 6
1365 1386 6 1365 1387 6 1365 1388 6 1365
1392 6 1365 1393 6 1365 1394 6 1365 1395
6 1365 1396 6 1365 1397 6 1365 1496 6
1365 284 6 1365 407 6 1365 3199 6 1365
3200 6 1365 3201 6 1365 3202 6 1365 3203
6 1365 3204 6 1365 561 6 1365 730 6
1365 
# 1366
comput simul discuss of the techniqu and comparison of languag
the purpos of thi paper is to present a comparison
of some comput simul languag and of some of the
involv in compar softwar packag for digit comput ar discuss
in part i the issu is obviou user of digit
comput must choos from avail languag or write their own
substanti cost can occur particularli in train implement and comput
time if an inappropri languag is chosenor and more comput
simul languag ar be develop comparison and evalu of exist
languag ar us for design and implement as well as
user the second part is devot to comput simul and
simul languag the comput characterist of simul ar discuss with
special attent be paid to a distinct between continu and
discret chang model part iii present a detail comparison of
six simul languag and packag simscript clp csl gasp cpss
and sol the characterist of each ar summar in a
seri of tabl the implic of thi analysi for design
of languag for user and for implement ar develop the
conclus of the paper is that the packag now avail
for comput simul offer featur which none of the more
gener purpos packag do and that analysi of strength and
weak of each suggest wai in which both current and
futur simul languag and packag can be improv cacm octob
1966 teichroew d lubin j f ca661001 jb march 2
1978 4 23 pm 1366 5 1366 1366 5 1366
1366 5 1366 1503 5 1366 1781 5 1366 1860
5 1366 2091 5 1366 123 6 1366 196 6
1366 919 6 1366 990 6 1366 1007 6 1366
1046 6 1366 1131 6 1366 1139 6 1366 1140
6 1366 1149 6 1366 1198 6 1366 1215 6
1366 1223 6 1366 1265 6 1366 1303 6 1366
1323 6 1366 1358 6 1366 1366 6 1366 1366
6 1366 1366 6 1366 1366 6 1366 1389 6
1366 1421 6 1366 1421 6 1366 1460 6 1366
1462 6 1366 1463 6 1366 1467 6 1366 1468
6 1366 1477 6 1366 1477 6 1366 1491 6
1366 1491 6 1366 1496 6 1366 1496 6 1366
1531 6 1366 1535 6 1366 1565 6 1366 1601
6 1366 1602 6 1366 1613 6 1366 1614 6
1366 1626 6 1366 1626 6 1366 1641 6 1366
1641 6 1366 1785 6 1366 1786 6 1366 1787
6 1366 1788 6 1366 205 6 1366 224 6
1366 249 6 1366 288 6 1366 316 6 1366
378 6 1366 381 6 1366 398 6 1366 11
6 1366 404 6 1366 410 6 1366 463 6
1366 464 6 1366 483 6 1366 3184 6 1366
3184 6 1366 3188 6 1366 584 6 1366 600
6 1366 680 6 1366 691 6 1366 763 6
1366 799 6 1366 
# 1367
charact structur and charact pariti sens for parallel by bit
data commun in ascii propos american standard cacm septemb 1966
ca660912 jb march 2 1978 4 26 pm 1367 4
1367 2772 4 1367 2787 4 1367 1116 5 1367
1367 5 1367 1367 5 1367 1367 5 1367 
# 1368
systemat gener of hamiltonian circuit for a combinatori matrix which
mai specifi both direct and nondirect arc the paper describ
a comput program which gener systemat and exhaust all the
hamiltonian circuit specif applic is made to the travel salesman
problem cacm septemb 1966 robert s m ca660911 jb march
2 1978 4 30 pm 1368 5 1368 1368 5
1368 1368 5 1368 
# 1369
half rotat in n dimension euclidean space an iter procedur
is describ for determin half rotat in n dimension euclidean
space the method is a variant of the cyclic jacobi
procedur and util elementari plane rotat to obtain the half
rotat matrix numer exampl ar given cacm septemb 1966 mccamon
r b ca660910 jb march 2 1978 4 32 pm
1369 5 1369 1369 5 1369 1369 5 1369 1961
5 1369 1369 6 1369 1504 6 1369 1847 6
1369 
# 1370
linear equat exact solut algorithm 290 f4 cacm septemb 1966
boothroyd j ca660909a jb march 2 1978 4 33 pm
1370 5 1370 1370 5 1370 1370 5 1370 1813
5 1370 1370 6 1370 
# 1371
logarithm of gamma function algorithm 291 s14 cacm septemb 1966
pike m c hill i d ca660909bjb march 23 1978
4 24 pm 1371 5 1371 1371 5 1371 1371
5 1371 
# 1372
direct search algorithm 178 e4 cacm septemb 1966 bell m
pike m c ca660909c jb march 23 1978 4 25
pm 1372 5 1372 1372 5 1372 1372 5 1372
2190 5 1372 1372 6 1372 1849 6 1372 
# 1373
gamma function gamma function for rang 1 to 2 reciproc
gamma function to real argument gamma function logarithm of gamma
function algorithm 34 s14 54 s14 80 s14 221 s14
291 s14 cacm septemb 1966 pike m c hill i
d ca660909d jb march 23 1978 4 28 pm 1373
5 1373 1373 5 1373 1373 5 1373 
# 1374
evalu of determin determin evalu algorithm 41 f3 269 f3
cacm septemb 1966 bergson a ca660909 jb march 23 1978
4 29 pm 1374 5 1374 1374 5 1374 1374
5 1374 
# 1375
function minim algorithm 251 e4 cacm septemb 1966 fletcher r
ca660909f jb march 23 1978 4 31 pm 1375 5
1375 1375 5 1375 1375 5 1375 
# 1376
modifi graeffe method algorithm 256 c2 cacm septemb 1966 stern
g ca660909g jb march 23 1978 4 32 pm 1376
5 1376 1376 5 1376 1376 5 1376 
# 1377
pseudo random number algorithm 266 g5 cacm septemb 1966 hansson
l ca660909h jb march 23 1978 6 45 pm 1377
5 1377 1377 5 1377 1377 5 1377 
# 1378
pseudo random number algorithm 266 g5 cacm septemb 1966 hill
i d pike m c ca660909i jb march 23 1978
6 46 pm 1378 5 1378 1378 5 1378 1378
5 1378 
# 1379
a final solut to the dangl els of algol 60
and relat languag the dangl els problem consist of a
class of potenti ambigu in algol like condit statement whose
basic form is if b1 then if b2 then s1
els s2 where b1 and b2 ar boolean express and
s1 and s2 ar basic statement the difficulti li in
whether to attach the els to the first if or
to the second on exist solut to the problem ar
either ambigu or unnecessarili restrict let sand s1 be statement
we defin s to be close if s els s1
is not a statement and to be open if s
els s1 is a statement thu an uncondit statement is
a close statement open and close condit statement ar defin
by syntax equat in such a wai as to preserv
open and closur in each case an els must alwai
be preced by a close statement it is shown that
the syntax equat ar unambigu and that mai chang in
the statement type requir within the syntax equat would lead
to either ambigu or unnecessari restrict cacm septemb 1966 abraham
p w ca660908 jb march 2 1978 6 18 pm
1084 4 1379 1086 4 1379 1132 4 1379 1234
4 1379 1263 4 1379 1265 4 1379 1270 4
1379 1323 4 1379 1358 4 1379 1379 4 1379
1379 4 1379 1379 4 1379 1379 4 1379 1379
4 1379 1380 4 1379 1453 4 1379 1464 4
1379 1484 4 1379 1491 4 1379 1498 4 1379
1613 4 1379 1614 4 1379 1625 4 1379 1693
4 1379 1781 4 1379 1781 4 1379 1825 4
1379 1836 4 1379 1860 4 1379 1945 4 1379
1945 4 1379 2015 4 1379 2060 4 1379 2061
4 1379 2083 4 1379 2091 4 1379 2178 4
1379 2179 4 1379 2179 4 1379 2252 4 1379
2325 4 1379 2341 4 1379 2546 4 1379 2546
4 1379 2645 4 1379 2652 4 1379 2684 4
1379 2698 4 1379 2708 4 1379 2842 4 1379
2929 4 1379 2934 4 1379 3045 4 1379 3069
4 1379 669 4 1379 679 4 1379 691 4
1379 761 4 1379 949 4 1379 989 4 1379
1263 5 1379 1379 5 1379 1379 5 1379 1379
5 1379 1477 5 1379 2167 5 1379 2956 5
1379 3184 5 1379 669 5 1379 761 5 1379
1379 6 1379 1379 6 1379 1392 6 1379 1393
6 1379 2169 6 1379 2651 6 1379 
# 1380
simula an algol base simul languag thi paper is an
introduct to simula a program languag design to provid a
system analyst with unifi concept which facilit the concis descript
of discret event system a system descript also serv as
a sourc languag simul program simula is an extens of
algol 60 in which the most import new concept is
that of quasi parallel process cacm septemb 1966 dahl o
j nygaard k ca660907 jb march 2 1978 6 21
pm 1024 4 1380 1051 4 1380 1086 4 1380
1098 4 1380 1132 4 1380 1214 4 1380 1234
4 1380 1263 4 1380 1265 4 1380 1270 4
1380 1323 4 1380 1323 4 1380 1358 4 1380
1358 4 1380 1379 4 1380 1380 4 1380 1380
4 1380 1380 4 1380 1380 4 1380 1388 4
1380 1393 4 1380 1453 4 1380 1464 4 1380
1484 4 1380 1485 4 1380 1487 4 1380 1491
4 1380 1498 4 1380 1549 4 1380 1552 4
1380 1570 4 1380 1613 4 1380 1614 4 1380
1665 4 1380 1693 4 1380 1781 4 1380 1781
4 1380 1781 4 1380 1787 4 1380 1825 4
1380 1854 4 1380 1860 4 1380 1860 4 1380
1878 4 1380 1946 4 1380 1957 4 1380 1989
4 1380 2060 4 1380 2083 4 1380 2112 4
1380 2168 4 1380 2178 4 1380 2179 4 1380
2252 4 1380 2325 4 1380 2341 4 1380 2534
4 1380 2541 4 1380 2546 4 1380 2645 4
1380 2652 4 1380 2684 4 1380 2698 4 1380
2723 4 1380 2733 4 1380 2820 4 1380 2842
4 1380 2857 4 1380 2929 4 1380 2934 4
1380 557 4 1380 3069 4 1380 3073 4 1380
3112 4 1380 3155 4 1380 669 4 1380 679
4 1380 691 4 1380 761 4 1380 949 4
1380 989 4 1380 1380 5 1380 1380 5 1380
1380 5 1380 1421 5 1380 1541 5 1380 1846
5 1380 2060 5 1380 2218 5 1380 3112 5
1380 3184 5 1380 731 5 1380 799 5 1380
106 6 1380 1358 6 1380 1380 6 1380 1380
6 1380 1380 6 1380 1380 6 1380 1380 6
1380 1421 6 1380 1424 6 1380 1469 6 1380
1477 6 1380 1484 6 1380 1491 6 1380 1572
6 1380 1572 6 1380 1728 6 1380 1751 6
1380 1752 6 1380 1810 6 1380 1826 6 1380
210 6 1380 1869 6 1380 1879 6 1380 1972
6 1380 2095 6 1380 2110 6 1380 2438 6
1380 2723 6 1380 2736 6 1380 2833 6 1380
2838 6 1380 576 6 1380 731 6 1380 
# 1381
impact of comput on the undergradu mathemat curriculum the us
of comput to permit the widespread applic of mathemat idea
requir comput in scienc and technolog is extrem signific for
the understand of our current societi student interest in thi
develop is intens and if properli util should yield a
much better understand of mathemat concept as well as the
idea of program and logic structur which have been introduc
into mani field by the us of comput the present
paper suggest that that portion of the undergradu mathemat curriculum
which is prepar for the us of mathemat by person
who ar not profession mathematician be modifi to includ the
extens and clarif which ar possibl becaus of comput an
earli introduct to program is desir to permit a continu
us of automat comput to illustr and clarifi mathemat concept
follow the calculu equat stage an intens introduct to numer
analysi should be ad to the current curriculum in addit
to provid compet in the mostli us comput techniqu it
would permit a more sophist util of the advanc mathemat
idea associ with complex variabl and transform theori cacm septemb
1966 murrai f j ca660905 jb march 2 1978 6
31 pm 1381 5 1381 1381 5 1381 1381 5
1381 
# 1382
desir comput impact on undergradu mathemat three matter relat to
the theme of the symposium ar discuss here the author
examin some project concern the suppli and demand for mathematician
in the unit state through the mid 1970 comment briefli
on some of the factor which mai influenc the profession
activ of appli mathematician over the next sever year and
discuss in broad term how thi inform mai relat to
the undergradu train of mathematician cacm septemb 1966 macon n
ca660904 jb march 2 1978 6 35 pm 1382 5
1382 1382 5 1382 1382 5 1382 
# 1383
implic of the digit comput for educ in the mathemat
scienc the digit comput ha profoundli alter the definit of
what is interest in mathemat the import of appli logic
in human affair is chang by the exist of the
logic engin the result is that on should no longer
think in term of a singl disciplin of mathemat but
in term of a complex of mathemat scienc cacm septemb
1966 given w ca660903 jb march 2 1978 6 39
pm 1383 5 1383 1383 5 1383 1383 5 1383
2665 5 1383 1383 6 1383 1549 6 1383 
# 1384
mathemat for undergradu comput scientist the mathemat requir for an
undergradu program in comput scienc ar a subject of debat
the associ for comput machineri s curriculum committe howev believ
that these requir ar essenti the same as the mathemat
content of physic scienc undergradu program the committe believ that
these requir should assur the student of a broad mathemat
background and should enabl him to take a wide varieti
of cours in other scientif disciplin the committe s concern
is to develop a solid scientif approach to comput scienc
cacm septemb 1966 atchison w f ca660902 jb march 2
1978 6 46 pm 1384 5 1384 1384 5 1384
1384 5 1384 
# 1385
comput technolog in communist china 1956 1965 base on inform
from translat of communist chines new item and period literatur
for the 1965 period comput technolog in china is review
under the follow head 1 initi plan organ and educ
aspect of comput technolog and autom 2 machin develop progress
two major specif machin in 1958 59 with soviet aid
a vacuum in 1960 64 due to the withdraw of
soviet aid then presum all chines made machin from 1965
to the present 3 comput applic 4 the trend of
autom control of product process rather than data process and
5 the yun ch ou hsueh scienc of oper and
program campaign of 1958 60 dure which an attempt wa
made to bring concept such as linear program to ordinari
chines worker and peasant communist china is adjudg to have
a margin comput capabl with most of it machin probabl
be of a binari natur howev a turn point mai
have been reach in mid 1965 cacm septemb 1966 audett
d g ca660901 jb march 2 1978 6 59 pm
1385 5 1385 1385 5 1385 1385 5 1385 
# 1386
symbol factor of polynomi in sever variabl an algorithm for
find the symbol factor of a multi variat polynomi with
integ coeffici is present the algorithm is an extens of
a techniqu us by kroneck in a proof that the
prime factor of ani polynomi mai be found in a
finit number of step the algorithm consist of factor singl
variabl instanc of the given polynomi by kroneck s method
and introduc the remain variabl by interpol techniqu for implement
the algorithm and sever exampl ar discuss the algorithm promis
suffici power to be us effici in an onlin system
for symbol mathemat cacm august 1966 jordan d e kain
r y clapp l c ca660812 jb march 2 1978
7 06 pm 1396 5 1386 1386 5 1386 1386
5 1386 1386 5 1386 964 6 1386 1028 6
1386 1029 6 1386 1083 6 1386 1132 6 1386
1214 6 1386 1278 6 1386 1334 6 1386 1365
6 1386 1386 6 1386 1387 6 1386 1388 6
1386 1392 6 1386 1393 6 1386 1394 6 1386
1395 6 1386 1396 6 1386 1397 6 1386 1496
6 1386 284 6 1386 407 6 1386 3199 6
1386 3200 6 1386 3201 6 1386 3202 6 1386
3203 6 1386 3204 6 1386 561 6 1386 730
6 1386 
# 1387
solut of system of polynomi equat by elimin the elimin
procedur as describ by william ha been code in lisp
and formac and us in solv system of polynomi equat
it is found that the method is veri effect in
the case of small system where it yield all solut
without the need for initi estim the method by itself
appear in appropri howev in the solut of larg system
of equat due to the explos growth in the intermedi
equat and the hazard which aris when the coeffici ar
truncat a comparison is made with difficulti found in other
problem in non numer mathemat such as symbol integr and
simplif cacm august 1966 mose j ca660811 jb march 2
1978 7 11 pm 1396 5 1387 1387 5 1387
1387 5 1387 1387 5 1387 1946 5 1387 878
6 1387 902 6 1387 964 6 1387 1028 6
1387 1029 6 1387 1083 6 1387 1093 6 1387
1132 6 1387 1177 6 1387 1214 6 1387 1278
6 1387 1334 6 1387 1365 6 1387 1386 6
1387 1387 6 1387 1387 6 1387 1388 6 1387
1392 6 1387 1393 6 1387 1393 6 1387 1394
6 1387 1395 6 1387 1396 6 1387 1397 6
1387 1496 6 1387 284 6 1387 360 6 1387
407 6 1387 3199 6 1387 3200 6 1387 3201
6 1387 3202 6 1387 3203 6 1387 3204 6
1387 561 6 1387 730 6 1387 731 6 1387
# 1388
automast automat mathemat analysi and symbol translat a procedur for
numer solv system of ordinari differenti equat is shown to
also gener symbol solut the procedur is base on a
finit taylor seri expans that includ an estim of the
error in the final result a comput program is describ
that read in a system of such equat and then
gener the expans for all of the depend variabl the
expans ar determin symbol henc ani non numer paramet in
the origin equat ar carri automat into the final expans
thu the exact influenc of ani paramet on the problem
solut can be easili displai cacm august 1966 ball w
e bern r i ca660810 jb march 2 1978 7
16 pm 1024 4 1388 1051 4 1388 1098 4
1388 1214 4 1388 1223 4 1388 1380 4 1388
1388 4 1388 1388 4 1388 1393 4 1388 1485
4 1388 1487 4 1388 1549 4 1388 1570 4
1388 1878 4 1388 1946 4 1388 1957 4 1388
2168 4 1388 436 4 1388 2723 4 1388 2857
4 1388 3112 4 1388 1388 5 1388 1388 5
1388 1388 5 1388 1396 5 1388 405 5 1388
731 5 1388 964 6 1388 1028 6 1388 1029
6 1388 1083 6 1388 1132 6 1388 1214 6
1388 1278 6 1388 1334 6 1388 1365 6 1388
1386 6 1388 1387 6 1388 1388 6 1388 1392
6 1388 1393 6 1388 1394 6 1388 1395 6
1388 1396 6 1388 1397 6 1388 1496 6 1388
284 6 1388 407 6 1388 3199 6 1388 3200
6 1388 3201 6 1388 3202 6 1388 3203 6
1388 3204 6 1388 561 6 1388 730 6 1388
# 1389
a programm s descript of l 6 bell telephon laboratori
low link list languag l 6 pronounc l six is
a new program languag for list structur manipul it contain
mani of the facil which underli such list processor as
ipl lisp comit ad snobol but permit the user to
get much closer to machin code in order to write
faster run program to us storag more effici and to
build a wider varieti of link data structur cacm august
1966 knowlton k c ca660809 jb march 2 1978 7
20 pm 1389 4 1389 1552 4 1389 2162 4
1389 2435 4 1389 2596 4 1389 2768 4 1389
2845 4 1389 2902 4 1389 2955 4 1389 1184
5 1389 1389 5 1389 1389 5 1389 1389 5
1389 1860 5 1389 1957 5 1389 2155 5 1389
2162 5 1389 1184 6 1389 1366 6 1389 1389
6 1389 1389 6 1389 1389 6 1389 1389 6
1389 1421 6 1389 1496 6 1389 1626 6 1389
1641 6 1389 1785 6 1389 1786 6 1389 210
6 1389 1860 6 1389 378 6 1389 378 6
1389 2046 6 1389 2060 6 1389 3184 6 1389
731 6 1389 
# 1390
convert a program languag is describ which is applic to
problem conveni describ by transform rule by thi is meant
that pattern mai be prescrib each be associ with a
skeleton so that a seri of such pair mai be
search until a pattern is found which match an express
to be transform the condit for a match ar govern
by a code which also allow subexpress to be identifi
and eventu substitut into the correspond skeleton the primit pattern
and primit skeleton ar describ as well as the principl
which allow their elabor in to more complic pattern and
skeleton the advantag of the languag ar that it allow
on to appli transform rule to list and arrai as
easili as string that both pattern and skeleton mai be
defin recurs and that as a consequ program mai be
state quit concis cacm august 1966 guzman a mcintosh h
v ca660808 jb march 2 1978 7 32 pm 1024
4 1390 1051 4 1390 1102 4 1390 1132 4
1390 1390 4 1390 1486 4 1390 1549 4 1390
1706 4 1390 1826 4 1390 1878 4 1390 378
4 1390 2060 4 1390 2155 4 1390 2168 4
1390 2719 4 1390 2723 4 1390 2838 4 1390
2842 4 1390 2855 4 1390 2879 4 1390 3077
4 1390 3080 4 1390 3106 4 1390 627 4
1390 106 4 1390 210 5 1390 1390 5 1390
1390 5 1390 1390 5 1390 
# 1391
comput experi in finit algebra a medium scale program system
is written in mad and fap on the ibm 7094
to manipul some of the object of modern algebra finit
group map and set of map subset and set of
subset constant integ and truth valu design to oper in
a time share environ the system can serv as a
teacher s aid to the undergradu student of modern algebra
as well as for the work scientist or engin wish
to familiar himself with the subset cacm august 1966 maurer
w d ca660807 jb march 2 1978 7 36 pm
1391 5 1391 1391 5 1391 1391 5 1391 1948
5 1391 1391 6 1391 1559 6 1391 
# 1392
experi with formac algorithm design variou facet of the design
and implement of mathemat express manipul algorithm ar discuss concret
exampl ar provid by the formac expand and differenti algorithm
a basic formac util routin and an experi in the
extract of the skelet structur of an express on recurr
theme is the need to avoid excess intermedi express swell
in order to minim core storag requir although mani detail
from the formac implement ar present an attempt is made
to stress principl and idea of gener relev in the
design of algorithm for manipul mathemat express cacm august 1966
tobei r g ca660806 jb march 2 1978 7 43
pm 1028 4 1392 1216 4 1392 1392 4 1392
1396 4 1392 964 4 1392 1396 5 1392 1392
5 1392 1392 5 1392 1392 5 1392 2167 5
1392 561 5 1392 964 6 1392 1028 6 1392
1029 6 1392 1083 6 1392 1132 6 1392 1214
6 1392 1278 6 1392 1334 6 1392 1365 6
1392 1379 6 1392 1386 6 1392 1387 6 1392
1388 6 1392 1392 6 1392 1392 6 1392 1393
6 1392 1393 6 1392 1394 6 1392 1395 6
1392 1396 6 1392 1397 6 1392 1496 6 1392
284 6 1392 2169 6 1392 407 6 1392 3199
6 1392 3200 6 1392 3201 6 1392 3202 6
1392 3203 6 1392 3204 6 1392 561 6 1392
730 6 1392 
# 1393
pm a system for polynomi manipul pm is an ibm
7094 program system for formal manipul of polynomi in ani
number of variabl with integr coeffici unrestrict in size some
of the formal oper which can be perform by the
system ar sum differ product quotient deriv substitut and greater
common divisor pm is base on the refco iii list
process system which is describ and compar with the lisp
and slip system the pm subroutin for arithmet of larg
integ ar describ as constitut an independ us subsystem pm
is compar with the alpak system in sever respect includ
the choic of canon form for polynomi a new algorithm
for polynomi greatest common divisor calcul is mention and exapl
ar includ to illustr it superior cacm august 1966 collin
g e ca660805 jb march 2 1978 7 51 pm
1024 4 1393 1050 4 1393 1051 4 1393 1098
4 1393 1214 4 1393 1380 4 1393 1388 4
1393 1393 4 1393 1393 4 1393 1393 4 1393
1485 4 1393 1487 4 1393 1549 4 1393 1549
4 1393 1570 4 1393 1878 4 1393 1946 4
1393 1957 4 1393 2023 4 1393 2168 4 1393
2723 4 1393 2857 4 1393 3112 4 1393 3112
4 1393 627 4 1393 106 5 1393 1393 5
1393 1393 5 1393 1393 5 1393 1396 5 1393
296 5 1393 1946 5 1393 2167 5 1393 2857
5 1393 731 5 1393 878 6 1393 902 6
1393 964 6 1393 1028 6 1393 1029 6 1393
1083 6 1393 1093 6 1393 1132 6 1393 1177
6 1393 1214 6 1393 1278 6 1393 1334 6
1393 1365 6 1393 1379 6 1393 1386 6 1393
1387 6 1393 1387 6 1393 1388 6 1393 1392
6 1393 1392 6 1393 1393 6 1393 1393 6
1393 1393 6 1393 1393 6 1393 1394 6 1393
1395 6 1393 1396 6 1393 1397 6 1393 1496
6 1393 284 6 1393 360 6 1393 2169 6
1393 407 6 1393 3199 6 1393 3200 6 1393
3201 6 1393 3202 6 1393 3203 6 1393 3204
6 1393 561 6 1393 730 6 1393 731 6
1393 731 6 1393 
# 1394
comput of algebra properti of elementari particl reaction us a
digit comput a larg number of calcul in high energi
elementari particl physic involv the manipul of complic algebra express
contain both tensor and noncommut matrix quantiti mani of these
calcul take sever month to complet although the oper involv
follow straightforward rule in thi paper a program is describ
which ha been develop in lisp for solv such problem
the manner in which these problem ar encount is outlin
and their represent in the comput discuss at present about
six month of human work take less than fifteen minut
on an ibm 7090 limit of the present system and
futur plan ar also outlin cacm august 1966 hearn a
c ca660804 jb march 2 1978 7 58 pm 1396
5 1394 1394 5 1394 1394 5 1394 1394 5
1394 964 6 1394 1028 6 1394 1029 6 1394
1083 6 1394 1132 6 1394 1214 6 1394 1278
6 1394 1334 6 1394 1365 6 1394 1386 6
1394 1387 6 1394 1388 6 1394 1392 6 1394
1393 6 1394 1394 6 1394 1395 6 1394 1396
6 1394 1397 6 1394 1496 6 1394 284 6
1394 407 6 1394 3199 6 1394 3200 6 1394
3201 6 1394 3202 6 1394 3203 6 1394 3204
6 1394 561 6 1394 730 6 1394 
# 1395
on the implement of ambit a languag for symbol manipul
a brief descript is given of the implement techniqu for
the replac rule of the ambit program languag the algorithm
for the ambit scan and an exampl of it applic
ar given the algorithm is applic to other member of
the famili of string transform languag of which ambit is
a member and it provid a rational for the design
of the ambit languag cacm august 1966 christensen c ca660803
jb march 2 1978 8 02 pm 1396 4 1395
1395 4 1395 1395 4 1395 1706 4 1395 1180
5 1395 1396 5 1395 1395 5 1395 1395 5
1395 1395 5 1395 1395 5 1395 964 6 1395
1028 6 1395 1029 6 1395 1083 6 1395 1132
6 1395 1180 6 1395 1214 6 1395 1278 6
1395 1334 6 1395 1365 6 1395 1386 6 1395
1387 6 1395 1388 6 1395 1392 6 1395 1393
6 1395 1394 6 1395 1395 6 1395 1395 6
1395 1396 6 1395 1397 6 1395 1496 6 1395
284 6 1395 407 6 1395 3199 6 1395 3200
6 1395 3201 6 1395 3202 6 1395 3203 6
1395 3204 6 1395 561 6 1395 730 6 1395
# 1396
survei of formula manipul the field of formula manipul is
survei with particular attent to the specif capabl of differenti
integr and the support capabl of simplif displai and input
output edit and precis arithmet gener system both batch and
onlin ar describ final some program to solv specif applic
ar discuss cacm august 1966 sammet j e ca660802 jb
march 2 1978 8 07 pm 1028 4 1396 1028
4 1396 1083 4 1396 1083 4 1396 1214 4
1396 1216 4 1396 1216 4 1396 1216 4 1396
1278 4 1396 1278 4 1396 1334 4 1396 1347
4 1396 1347 4 1396 1347 4 1396 1392 4
1396 1396 4 1396 1396 4 1396 1396 4 1396
1396 4 1396 1396 4 1396 1396 4 1396 1396
4 1396 1396 4 1396 1396 4 1396 1396 4
1396 1396 4 1396 1396 4 1396 1396 4 1396
1396 4 1396 1396 4 1396 1396 4 1396 1396
4 1396 1396 4 1396 1396 4 1396 1396 4
1396 1396 4 1396 1396 4 1396 1396 4 1396
1396 4 1396 1396 4 1396 1396 4 1396 1396
4 1396 1396 4 1396 1396 4 1396 1395 4
1396 1444 4 1396 1536 4 1396 1624 4 1396
1767 4 1396 1781 4 1396 1787 4 1396 1860
4 1396 1945 4 1396 1945 4 1396 1946 4
1396 1946 4 1396 1988 4 1396 2167 4 1396
2167 4 1396 2229 4 1396 2252 4 1396 2857
4 1396 679 4 1396 964 4 1396 964 4
1396 964 5 1396 1028 5 1396 1029 5 1396
1083 5 1396 1132 5 1396 1214 5 1396 1278
5 1396 1334 5 1396 1388 5 1396 1393 5
1396 1396 5 1396 1396 5 1396 1396 5 1396
1396 5 1396 1392 5 1396 1395 5 1396 1397
5 1396 1365 5 1396 284 5 1396 1386 5
1396 1387 5 1396 1394 5 1396 1496 5 1396
1945 5 1396 407 5 1396 561 5 1396 3199
5 1396 3200 5 1396 3201 5 1396 3202 5
1396 3203 5 1396 3204 5 1396 730 5 1396
823 6 1396 914 6 1396 915 6 1396 917
6 1396 964 6 1396 984 6 1396 989 6
1396 990 6 1396 1012 6 1396 1028 6 1396
1029 6 1396 1083 6 1396 1084 6 1396 1098
6 1396 1122 6 1396 1132 6 1396 1138 6
1396 1139 6 1396 1141 6 1396 1200 6 1396
1214 6 1396 1223 6 1396 1265 6 1396 1278
6 1396 1334 6 1396 1336 6 1396 1365 6
1396 1386 6 1396 1387 6 1396 1388 6 1396
1392 6 1396 1393 6 1396 1394 6 1396 1395
6 1396 1396 6 1396 1396 6 1396 1397 6
1396 1455 6 1396 1477 6 1396 1487 6 1396
1491 6 1396 1496 6 1396 1496 6 1396 284
6 1396 407 6 1396 483 6 1396 3199 6
1396 3200 6 1396 3201 6 1396 3202 6 1396
3203 6 1396 3204 6 1396 561 6 1396 584
6 1396 669 6 1396 680 6 1396 730 6
1396 763 6 1396 
# 1397
proceed of the acm symposium on symbol and algebra manipul
the acm symposium on symbol and algebra manipul brought togeth
over four hundr peopl interest in program languag design for
manipul of algebra formula and symbol string in their applic
and in algorithm for their implement twenti eight paper were
present follow by a live panel discuss of futur direct
even meet were arrang for sever interest group the confer
wa sponsor by the acm special interest committe on symbol
and algebra manipul the program committe consist of chairman jean
e sammet paul abraham thoma e cheatham max goldstein and
dougla mcllroi confer arrang were made by lewi c clapp
daniel bobrow and jame h griesmer robert w floyd editor
cacm august 1966 ca660801 jb march 2 1978 8 17
pm 1397 4 1397 2704 4 1397 1247 5 1397
1396 5 1397 1397 5 1397 1397 5 1397 1397
5 1397 964 6 1397 1028 6 1397 1029 6
1397 1083 6 1397 1132 6 1397 1214 6 1397
1278 6 1397 1334 6 1397 1365 6 1397 1386
6 1397 1387 6 1397 1388 6 1397 1392 6
1397 1393 6 1397 1394 6 1397 1395 6 1397
1396 6 1397 1397 6 1397 1496 6 1397 284
6 1397 407 6 1397 3199 6 1397 3200 6
1397 3201 6 1397 3202 6 1397 3203 6 1397
3204 6 1397 561 6 1397 730 6 1397 
# 1398
robot data screen a solut to multivari type problem in
the biolog and social scienc a new approach is outlin
toward the solut of the type of multivari problem that
is found usual in the biolog and social scienc as
well as in medicin thi approach us a logic rather
than a statist criterion by which variabl ar group into
a determinist model algorithm ar develop by which some variabl
ar kept on for further analysi while other ar elimin
criteria for the accept of a variabl as well as
the termin of the search process ar deriv from inform
theori cacm juli 1966 sterl t gleser m haberman s
pollack s ca660714jb march 2 1978 8 26 pm 1398
5 1398 1398 5 1398 1398 5 1398 
# 1399
on top to bottom recognit and left recurs a procedur
is given for obtain structur descript in a context free
grammar by perform the recognit accord to a strongli equival
left recurs freegrammar the effect of allow null string in
the rewrit rule is discuss cacm juli 1966 kurki suonio
r ca660713 jb march 2 1978 8 29 pm 1350
4 1399 1399 4 1399 1659 4 1399 1768 4
1399 1781 4 1399 1945 4 1399 2110 4 1399
3094 4 1399 1265 5 1399 1350 5 1399 1399
5 1399 1399 5 1399 1399 5 1399 1012 6
1399 1225 6 1399 1265 6 1399 1399 6 1399
680 6 1399 
# 1400
free text input to util routin through the us of
some rather simpl techniqu it is frequent possibl to produc
a program which will accept free text input the techniqu
ar discuss and relat to a gener tape manipul routin
cacm juli 1966 blum r i ca660712 jb march 2
1978 8 32 pm 1400 4 1400 1553 4 1400
1945 4 1400 2127 4 1400 2396 4 1400 2730
4 1400 1400 5 1400 1400 5 1400 1400 5
1400 1487 5 1400 
# 1401
quasilinear and the calcul of eigenvalu sever eigenvalu problem for
system of ordinari differenti equat ar consid thei ar resolv
computation us the quasiliner techniqu a quadrat converg success approxim
scheme relat to the newton raphson kantorovich method cacm juli
1966 bellman r kagiwada h kalaba r ca660711 jb march
2 1978 8 40 pm 1401 5 1401 1401 5
1401 1401 5 1401 1766 5 1401 1401 6 1401
# 1402
partial step integr a partial step integr equat is deriv
for us with the adam or adam bashforth method of
integr of differenti equat thi method of obtain function valu
at point intermedi to the integr point yield accuraci compar
to the integr and doe not requir store of addit
inform as in interpol method cacm juli 1966 glauz r
d ca660710 jb march 2 1978 9 08 pm 1402
5 1402 1402 5 1402 1402 5 1402 
# 1403
a method for find the m smallest valu of a
monoton function defin on order set of posit integ the
minimum valu of a monoton increas function defin on a
partial order set s is assum on the set of
minim point of s thi observ is us to devis
an effici method for find the m smallest function valu
of monoton function defin on order pair of posit integ
the method is easili extend to includ monoton function defin
on order n tupl includ is a fortran program which
wa written to implement the procedur for a certain import
case cacm juli 1966 sigillito v g ca660709 jb march
2 1978 9 13 pm 1403 5 1403 1403 5
1403 1403 5 1403 
# 1404
comput aspect of multipl covari analysi on a multifactor structur
the comput procedur for the analysi of multipl covari in
statist is discuss with refer to the analysi of varianc
a special oper calculu develop by hartli for program analysi
of varianc for multifactor experi is extend to cover the
analysi of covari thi extens is accomplish by util the
connect between the analysi of covari and the analysi of
varianc and by introduc a new oper the result ar
illustr by a numer exampl for analysi of covari in
which the basic comput ar shown to be carri out
by an analysi of varianc program cacm juli 1966 peng
k c ca660708 jb march 2 1978 9 18 pm
1404 4 1404 1045 5 1404 1404 5 1404 1404
5 1404 1404 5 1404 
# 1405
matrix triangul with integ arithmet algorithm 287 f1 cacm juli
1966 blankinship w a ca660707a jb march 2 1978 9
20 pm 1405 5 1405 1405 5 1405 1405 5
1405 
# 1406
solut of simultan linear diophantin equat algorithm 288 f4 cacm
juli 1966 blankinship w a ca660707b jb march 23 1978
7 06 pm 1406 5 1406 1406 5 1406 1406
5 1406 
# 1407
confid interv for a ratio algorithm 289 g1 cacm juli
1966 hill i d pike m c ca660707c jb march
23 1978 7 07 pm 1407 5 1407 1407 5
1407 1407 5 1407 
# 1408
the eschenbach drum scheme the prime function of a drum
oper in real time is to perform access quickli the
usual mean for increas thi capac is to incorpor engin
or hardwar improv in thi paper the problem is attack
not by chang the drum but rather by modifi the
manner in which it oper at the outset a drum
is given a function definit then a simpl design scheme
eschenbach is introduc which enorm increas the rate of access
for drum so defin thi is shown to enabl a
system to perform a job by emploi fewer or less
expens drum it is suggest that although the design scheme
ha a specif us the method underli it ha more
gener applic the question of the efficaci of the drum
scheme is then rais to deal with thi a standard
of effici is develop in light of realist real time
circumst the drum scheme is then model in a manner
which permit it to be analyz as a problem in
queue theori thu on is enabl to ascertain whether the
drum scheme is effici enough for it applic again wherea
the analysi of the drum scheme ha a specif us
the method underli it have more gener applic cacm juli
1966 weingarten a ca660706 jb march 2 1978 9 29
pm 1408 5 1408 1408 5 1408 1408 5 1408
2319 5 1408 1408 6 1408 1719 6 1408 1749
6 1408 1751 6 1408 2016 6 1408 2017 6
1408 2080 6 1408 2188 6 1408 2203 6 1408
2204 6 1408 
# 1409
nebula a digit comput us a 20 mc glass delai
line memori oregon state univers ha design and construct a
medium speed serial digit comput us glass delai line circul
at 22 mc as memori the design object as origin
conceiv in a special seminar were 1 to be a
research project in comput design 2 to be usabl as
an educ machin and 3 to have easili modifi hardwar
for basic research in comput system design an unusu arrang
of inform within the 22 mc memori allow a simpl
interfac with the 340 kc arithmet unit which result in
an effect zero latenc time and provid possibl for an
associ memori the arithmet unit ha a command structur similar
to larg parallel machin and us flip flop arithmet and
control regist throughout all hardwar develop ha been aim toward
the concept of easi modif elabor consol control for effect
man machin interact and low cost cacm juli 1966 bole
j a rux p t weingarten jr f w ca660705
jb march 2 1978 9 35 pm 1409 4 1409
1208 5 1409 1409 5 1409 1409 5 1409 1409
5 1409 
# 1410
interarriv statist for time share system the optim of time
share system perform requir the descript of the stochast process
govern the user input and the program activ thi paper
provid a statist descript of the user input process in
the sdc arpa gener purpos time share system tss the
input process is assum to be stationari and to be
defin by the interarriv time distribut the data obtain appear
to justifi satisfactorili the common assumpt that the interarriv time
ar serial independ the data do not appear to justifi
except as a veri rough approxim the usual assumpt off
an exponenti distribut for interarriv time a much more satisfactori
approxim to the data can be obtain with a biphas
or triphas hyperexponenti distribut cacm juli 1966 coffman e g
wood r c ca660704 jb march 2 1978 9 45
pm 1410 5 1410 1410 5 1410 1410 5 1410
1604 5 1410 1951 5 1410 2373 5 1410 1224
6 1410 1410 6 1410 1410 6 1410 1410 6
1410 1604 6 1410 1751 6 1410 1810 6 1410
1951 6 1410 2374 6 1410 
# 1411
comparison of sever algorithm for comput of mean standard deviat
and correl coeffici sever algorithm for comput of basic statist
ar compar by their perform on systemat gener test data
the statist calcul were the mean standard deviat and correl
coeffici for each statist the algorithm includ the usual comput
formula correct due to an accumul error term and a
recurs comput of the current valu of the statist the
usual comput formula were also evalu in doubl precis larg
error were note for some calcul us the usual comput
formula the most reliabl techniqu wa correct of the initi
estim by us of an accumul error term to elimin
the need for make two pass on the data it
wa suggest that the initi estim of the mean be
obtain from a subset of the data cacm juli 1966
neeli p m ca660703 jb march 6 1978 2 54
pm 1411 5 1411 1411 5 1411 1411 5 1411
1619 5 1411 3166 5 1411 1411 6 1411 1411
6 1411 2731 6 1411 2799 6 1411 3159 6
1411 3167 6 1411 
# 1412
the bank inform system concept most larg commerci bank have
progress to the point where their major account applic have
been autom and more sophist usag of data process equip
is be sought thi coupl with the avail of equip
well suit to real time direct access process ha led
to develop within some bank of the central file of
data base approach toward a bank inform system the bank
inform system now serv the two fold purpos of provid
real time respons to inquir about individu account stasu and
provid more complex combin of inform for manag us both
kind of process draw upon a common store of data
contain in the direct access central file thi data base
includ index which facilit cross referenc of account inform so
that all relationship between bank and custom mai be discern
in introduc the bank inform system concept a gradual approach
to account cross referenc and file convers is most prudent
gener thi system must interfac with other comput applic alreadi
exist within the bank cacm juli 1966 head r v
ca660702 jb march 2 1978 9 53 pm 1412 5
1412 1412 5 1412 1412 5 1412 
# 1413
a vision of technolog and educ educ technolog is current
quit fashion here as in mani other branch or aspect
of technolog chang possibl in the next gener or two
ar now known as idea discoveri or invent the unknown
is whether the potenti will becom the actual and if
so on what time scale thi ignor stem larg from
ignor about the social respons to potenti technolog chang the
object of thi paper is to present a vision of
potenti educ technolog and to rais question about the mode
of social respons and adapt like to be evok by
such a vision cacm juli 1966 oetting a g ca660701
jb march 3 1978 8 38 am 1413 4 1413
1413 4 1413 1654 4 1413 1771 4 1413 1902
4 1413 2478 4 1413 1205 5 1413 1270 5
1413 1413 5 1413 1413 5 1413 1413 5 1413
# 1414
twelv row punch card code for inform interchang propos american
standard cacm june 1966 ca660607 jb march 3 1978 8
39 am 1414 5 1414 1414 5 1414 1414 5
1414 
# 1415
automat deriv of microsent the decomposit of long complex english
sentenc into shorter kernel like constitu sentenc microsent ha often
been suggest as an avenu toward conduct automat retriev of
natur languag messag to explor the prospect of such a
step the author attempt in 1963 to prepar a gener
program for deriv microsent from longer sentenc that had been
syntact analyz by the harvard multipath analysi program the basic
idea wa to extract the subject verb and object if
ani of each claus and to reassembl these materi into
a grammat microsent a program is describ in thi paper
which wa design to oper on the tree structur output
of the analyz and the microsent that were produc ar
exhibit the author conclud that while microsent of the qualiti
achiev do not open up immedi prospect for improv the
perform of automat messag retriev system thei mai have practic
valu in man machin system us human monitor to select
the prefer syntact interpret of a sentenc cacm june 1966
carmodi b t jone jr p e ca660606 jb march
3 1978 8 47 am 1415 5 1415 1415 5
1415 1415 5 1415 
# 1416
a fortran techniqu for simplifi input to report gener typic
report gener allow the product of standard form when tabul
a magnet tape file the extract of nonstandard set of
inform with suitabl annot involv troublesom form design a method
of inform extract involv the calcul of suitabl fortran format
statement which combat thi problem is describ cacm june 1966
cleari j g ca660605 jb march 3 1978 8 53
am 1416 5 1416 1416 5 1416 1416 5 1416
# 1417
economi of scale and the ibm system 360 cost function
among five system 360 model ar analyz through examin of
instruct time program kernel and a typic instruct mix comparison
ar made between the data develop here and grosch s
law which seem to be applic to much of the
data sizabl economi of scale ar unquestion present in comput
equip cacm june 1966 solomon jr m b ca660604 jb
march 3 1978 8 57 am 1417 5 1417 1417
5 1417 1417 5 1417 1653 5 1417 2387 5
1417 2852 5 1417 963 6 1417 1069 6 1417
1417 6 1417 1417 6 1417 1417 6 1417 1771
6 1417 2345 6 1417 2387 6 1417 2479 6
1417 3190 6 1417 
# 1418
examin schedul algorithm 286 zh cacm june 1966 peck j
e l william m r ca660603a jb march 3 1978
8 58 am 1418 5 1418 1418 5 1418 1418
5 1418 2350 5 1418 2354 5 1418 2355 5
1418 1418 6 1418 1418 6 1418 1418 6 1418
1521 6 1418 1521 6 1418 1597 6 1418 1597
6 1418 1679 6 1418 1883 6 1418 2040 6
1418 2350 6 1418 2350 6 1418 2354 6 1418
2354 6 1418 2355 6 1418 2355 6 1418 
# 1419
chebyshev quadratur algorithm 279 d1 cacm june 1966 hopgood f
r a litherland c ca660603b jb march 23 1978 7
09 pm 1355 5 1419 1419 5 1419 1419 5
1419 1419 5 1419 2619 5 1419 1419 6 1419
1419 6 1419 1429 6 1419 
# 1420
a new uniform pseudorandom number gener a new multipl congruenti
pseudorandom number gener is discuss in which the modulu is
the largest prime within accumul capac and the multipli is
a primit root of that prime thi gener pass the
usual statist test and in addit the least signific bit
appear to be as random as the most signific bit
a properti which gener have modulu 2 k do not
possess cacm june 1966 hutchinson d w ca660602 jb march
3 1978 9 01 am 1420 5 1420 1420 5
1420 1420 5 1420 1691 5 1420 1293 6 1420
1420 6 1420 1631 6 1420 
# 1421
a contribut to the develop of algol a program languag
similar in mani respect to algol 60 but incorpor a
larg number of improv base on six year experi with
that languag is describ in detail part i consist of
an introduct to the new languag and a summari of
the chang made to algol 60 togeth with a discuss
of the motiv behind there vision part ii is a
rigor definit of the propos languag part iii describ a
set of propos standard procedur to be us with the
languag includ facil for input output cacm june 1966 wirth
n hoar c a r ca660601 jb march 3 1978
9 07 am 1380 5 1421 1421 5 1421 1421
5 1421 1421 5 1421 1552 5 1421 1693 5
1421 1781 5 1421 1854 5 1421 1860 5 1421
2060 5 1421 557 5 1421 123 6 1421 196
6 1421 919 6 1421 990 6 1421 1007 6
1421 1046 6 1421 1131 6 1421 1139 6 1421
1140 6 1421 1149 6 1421 1184 6 1421 1198
6 1421 1215 6 1421 1223 6 1421 1265 6
1421 1303 6 1421 1323 6 1421 1358 6 1421
1366 6 1421 1366 6 1421 1380 6 1421 1389
6 1421 1421 6 1421 1421 6 1421 1421 6
1421 1421 6 1421 1421 6 1421 1421 6 1421
1421 6 1421 1421 6 1421 1460 6 1421 1462
6 1421 1463 6 1421 1467 6 1421 1468 6
1421 1469 6 1421 1471 6 1421 1477 6 1421
1477 6 1421 1477 6 1421 1491 6 1421 1491
6 1421 1491 6 1421 1496 6 1421 1496 6
1421 1531 6 1421 1535 6 1421 1565 6 1421
1601 6 1421 1602 6 1421 1613 6 1421 1614
6 1421 1614 6 1421 1626 6 1421 1626 6
1421 1641 6 1421 1641 6 1421 1748 6 1421
1749 6 1421 1785 6 1421 1786 6 1421 1787
6 1421 1788 6 1421 205 6 1421 210 6
1421 224 6 1421 249 6 1421 1869 6 1421
288 6 1421 316 6 1421 378 6 1421 378
6 1421 381 6 1421 398 6 1421 2110 6
1421 11 6 1421 404 6 1421 410 6 1421
463 6 1421 464 6 1421 483 6 1421 3184
6 1421 3184 6 1421 3184 6 1421 3188 6
1421 584 6 1421 600 6 1421 680 6 1421
691 6 1421 731 6 1421 763 6 1421 799
6 1421 799 6 1421 
# 1422
eleven sixteenth inch perfor paper tape propos american standard cacm
mai 1966 ca660515 jb march 3 1978 9 09 am
1422 5 1422 1422 5 1422 1422 5 1422 
# 1423
a simpl algorithm for comput the gener invers of a
matrix the gener invers of a matrix is import in
analysi becaus it provid an extens of the concept of
an invers which appli to all matric it also ha
mani applic in numer analysi but it is not wide
us becaus the exist algorithm ar fairli complic and requir
consider storag space a simpl extens ha been found to
the convent orthogon method for invert non singular matric which
give the gener invers with littl extra effort and with
no addit storag requir the algorithm give the gener invers
for ani m by n matrix a includ the special
case when m n and a is non singular and
the case when m n and rank a n in
the first case the algorithm give the ordinari invers of
a in the second case the algorithm yield the ordinari
least squar transform matrix inv a a a and ha
the advantag of avoid the loss of signific which result
in form the product a a explicitli cacm mai 1966
rust r burru w r schneeberg c ca660514 jb march
3 1978 9 22 am 1423 5 1423 1423 5
1423 1423 5 1423 
# 1424
automat analysi of electron digit circuit us list process a
map from black diagram of digit circuit to list structur
is describ togeth with a list process program written for
the control data 3600 which us thi map to automat
carri out circuit analysi cacm mai 1966 shalla l ca660513
jb march 3 1978 9 24 am 1424 5 1424
1424 5 1424 1424 5 1424 1846 5 1424 1380
6 1424 1424 6 1424 1484 6 1424 1572 6
1424 576 6 1424 
# 1425
flow diagram ture machin and languag with onli two format
rule in the first part of the paper flow diagram
ar introduc to repres inter al map of a set
into itself although not everi diagram is decompos into a
finit number of given base diagram thi becom true at
a semant level due to a suitabl extens of the
given set and of the basic map defin in it
two normal method of flow diagram ar given the first
ha three base diagram the second onli two in the
second part of the paper the second method is appli
to the theori of ture machin with everi ture machin
provid with a two wai half tape there is associ
a similar machin do essenti the same job but work
on a tape obtain from the first on by interspers
altern blank squar the new machin belong to the famili
elsewher introduc gener by composit and iter from the two
machin l and r that famili is a proper subfamili
of the whole famili of ture machin cacm mai 1966
bohm c jacopini g ca660512 jb march 3 1978 9
35 am 1425 4 1425 1781 4 1425 438 4
1425 762 4 1425 249 5 1425 1425 5 1425
1425 5 1425 1425 5 1425 2709 5 1425 2802
5 1425 3004 5 1425 1425 6 1425 1425 6
1425 1425 6 1425 2138 6 1425 2204 6 1425
2247 6 1425 2356 6 1425 2456 6 1425 2456
6 1425 2477 6 1425 3186 6 1425 
# 1426
a simul of hospit admiss polici a studi is describ
which simul differ admiss polici of a larg special hospit
the object is to determin better polici for stabil of
admiss and censu rate while maintain a reason full hospit
there type of polici were examin admiss base on percentag
of discharg rate discharg rate plu or minu a constant
and fix author independ of discharg rate the last type
polici produc more stabl simul result and when put into
practic improv were realiz cacm mai 1966 smith w g
solomon jr m b ca660511 jb march 3 1978 9
42 am 1426 5 1426 1426 5 1426 1426 5
1426 
# 1427
simul of radioisotop scan by comput in radioisotop scan a
field which is assum increas import in medic diagnosi the
scan is a two dimension pattern made up of dot
area of increas sourc activ ar repres on the scan
by area of increas dot densiti to studi the output
of scanner with variou characterist a program which simul radioisotop
scan ha been written for a pdp 1 comput with
auxiliari disk storag and cathod rai tube displai past and
present research us the output of the simul ha shown
the flexibl of the system to be import the structur
of thi program can be us in the simul of
the output of ani quantum limit system cacm mai 1966
pizer s m ca660510 jb march 3 1978 9 47
am 1427 5 1427 1427 5 1427 1427 5 1427
# 1428
shock iii a comput system as an aid in the
manag of critic iii patient shock iii an onlin digit
comput system to assist the physician nurs and paramed personnel
in monitor and report on critic ill patient is describ
cacm mai 1966 rockwel jr m a shubin h weil
m h meagher p f ca660509 jb march 3 1978
9 49 am 1428 5 1428 1428 5 1428 1428
5 1428 
# 1429
matrix reduct us the hungarian method for the gener of
school timet the applic of kuhn s hungarian method to
the problem of matrix reduct as need in gotlieb s
method for timet gener is describ the method is suit
to both hand and comput calcul devic to improv the
effici of the basic algorithm ar discuss cacm mai 1966
lion j ca660508 jb march 3 1978 9 52 am
1429 5 1429 1429 5 1429 1429 5 1429 2619
5 1429 2772 5 1429 2787 5 1429 1116 6
1429 1116 6 1429 1419 6 1429 1429 6 1429
1429 6 1429 1429 6 1429 
# 1430
multipl precis float point convers from decim to binari and
vice versa decim to binari and binari to decim float
point convers is often perform by us a tabl of
the power 10 i ia posit integ for convert from
base 10 to base 2 and by us a tabl
of the coeffici of a polynomi approxim of 10 x
0 x 1 for convert from base 2 to base
10 these tabl occupi a larg storag region in the
case of a nonsingl precis convers thi paper show that
a singl small tabl suffic for a float point convers
from decim to binari and vice versa in ani us
precis cacm mai 1966 mancino o g ca660507 jb march
3 1978 9 56 am 1430 5 1430 1430 5
1430 1430 5 1430 
# 1431
on a storag map function for data structur some basic
fact about certain data structur ar review and an effici
algorithm is present for construct a storag map function for
a structur from the structur s definit cacm mai 1966
deuel p ca660506 jb march 3 1978 9 58 am
1431 5 1431 1431 5 1431 1431 5 1431 
# 1432
incorpor of nonstandard input output devic into fortran system a
fortran system mai readili be modifi to handl input output
with nonstandard media on the same basi on which it
handl the standard media thi is done by provid a
charact handl subroutin suit to the nonstandard medium and arrang
to be call by an otherwis unus output statement type
or unit number thi method wa us to control output
of alphanumer inform on a digit graph plotter cacm mai
1966 cohn c e ca660505 jb march 3 1978 10
01 am 1432 5 1432 1432 5 1432 1432 5
1432 
# 1433
a note on linear program algorithm design a combinatori problem
as linear program model grow bigger and bigger in size
much actual data that must be memor is often put
on magnet tape or disk and consequ there is an
improportion fast rise in the consumpt of comput timeo cut
down thi expens an ever increas effort is made to
design more effici algorithm thi paper is meant to support
the effort it is attempt to find some characterist of
the wai a pivot column is found the number of
repetit of a certain transfer of data from tape to
core memori is consid after some simplif the problem is
restat in a gener wai the gener function of the
probabl distribut and the moment gener function of the number
of repetit is found asymptot formula ar given for the
moment us a result from a paper of s narumi
1 the result mai be appli to write veri effici
routin that search for an extrem valu in a tabl
formula provid a mean of calcul the comput time in
thi case cacm mai 1966 roe p b m ca660504
jb march 3 1978 10 10 am 1433 5 1433
1433 5 1433 1433 5 1433 
# 1434
a mont carlo algorithm for assign student to class a
techniqu of random choic is illustr by applic to the
problem of assign student to a fix schedul of cours
us the techniqu it is possibl to reduc or elimin
difficulti that result when a popular section is fill and
close befor all student request and requir it have been
schedul the effect of automat schedul is retain without loss
of the student privileg of pick favorit instructor cacm mai
1966 macon n walker e e ca660503 jb march 3
1978 10 14 am 1434 5 1434 1434 5 1434
1434 5 1434 1540 5 1434 2209 5 1434 1434
6 1434 1434 6 1434 1540 6 1434 
# 1435
design of comput simul experi for industri system the aim
of thi paper is to provid background inform on the
exist literatur on experiment design techniqu which mai be applic
to the design of comput simul experi for industri system
although major emphasi is place on analysi of varianc techniqu
three other techniqu of data analysi ar consid multipl rank
procedur sequenti sampl and spectral analysi the paper treat four
specif experiment design problem and sever techniqu for solv them
the four experiment design problem ar 1 the problem of
stochast converg 2 the problem of factor select 3 the
problem of motiv and 4 the mani respons problem cacm
mai 1966 burdick d s naylor t h ca660502 jb
march 3 1978 10 20 am 1435 5 1435 1435
5 1435 1435 5 1435 1517 5 1435 1435 6
1435 
# 1436
interchang of two block of data algorithm 284 k2 cacm
mai 1966 fletcher w ca660501a jb march 3 1978 10
21 am 1436 5 1436 1436 5 1436 1436 5
1436 
# 1437
the mutual primal dual method algorithm 285 h cacm mai
1966 aird t j ca660501b jb march 23 1978 7
12 pm 1437 5 1437 1437 5 1437 1437 5
1437 
# 1438
a method for locat zero of complex function a method
for comput the index or wind number is develop and
appli to the problem of find zero of function from
the plane into the plane cacm april 1966 cain jr
g l ca660411 jb march 3 1978 10 23 am
1438 5 1438 1438 5 1438 1438 5 1438 
# 1439
mechan of the curv fit process datan a process for
fit a curv to approxim data and the problem it
creat for the engin programm is defin an approach ha
also been defin and a system ha been written for
the sru 1107 to mechan a major portion of thi
process the techniqu develop to accomplish the mechan ar larg
empir and ar depend for their inform onli on the
actual data point cacm april 1966 simonsen r h anketel
d l ca660410 jb march 3 1978 10 26 am
1439 5 1439 1439 5 1439 1439 5 1439 
# 1440
start approxim for squar root calcul on ibm system 360
sever start approxim for squar root calcul by newton s
method ar present in a form to facilit their us
in ibm system 360 squar root routin these approxim includ
sever for the rang 1 16 1 which is the
interv of primari interest on ibm system 360 cacm april
1966 fike c t ca660409 jb march 3 1978 10
32 am 1015 4 1440 1346 4 1440 1440 4
1440 1440 4 1440 1645 4 1440 1932 4 1440
2159 4 1440 951 4 1440 962 5 1440 1440
5 1440 1440 5 1440 1440 5 1440 1566 5
1440 532 5 1440 1440 6 1440 
# 1441
method of numer integr appli to a system have trivial
function evalu a studi ha been made to determin which
method of numer integr requir the least comput time for
a given amount of truncat error when appli to a
particular system of ordinari differenti equat where function evalu ar
rel trivial recent method due to butcher and gear ar
compar with classic rung kutta kutta nystrom and adam method
some of the newer on step method due to butcher
ar found to be slightli superior but no on method
is found to have ani great advantag over the other
in the applic to thi particular problem cacm april 1966
water j ca660408 jb march 3 1978 10 37 am
1441 5 1441 1441 5 1441 1441 5 1441 
# 1442
record magnet tape for inform interchang 800 cpi nrzi propos
american standard cacm april 1966 ca660407 jb march 3 1978
10 39 am 1442 5 1442 1442 5 1442 1442
5 1442 
# 1443
a method for find the least squar estim of the
intersect point of two helic in space when the helic
trajectori of two charg particl move awai from a common
point in a magnet field ar reconstruct from measur on
the track the reconstruct track ar perturb by measur and
other error and do not in gener intersect a method
is given for adjust the reconstruct track in a least
squar manner so that thei do intersect cacm april 1966
royston r j gregori j ca660406 jb march 3 1978
10 42 am 1443 5 1443 1443 5 1443 1443
5 1443 
# 1444
an algorithm for gener project reduct formula for matrix element
of mani electron wavefunct an algol procedur is given for
automat gener formula for matrix element aris in the variat
solut of the schroding equat for mani electron system cacm
april 1966 reev c m ca660405 jb march 3 1978
10 44 am 1334 4 1444 1396 4 1444 1444
4 1444 964 5 1444 1444 5 1444 1444 5
1444 1444 5 1444 
# 1445
us of the comput to teach introductori statist it ha
alwai been obviou that the aid to calcul offer by
the comput forc a chang in the curricula of mathemat
statist physic engin and other cours not so obviou ar
the mani pedagog aid the comput can offer in teach
the subject matter the possibl of give the student a
better technic as well as conceptu understand of statist were
explor for a number of year at the colleg of
medicin of the univers of cincinnati and ar report here
cacm april 1966 sterl t d pollack s v ca660404
jb march 3 1978 10 48 am 1445 5 1445
1445 5 1445 1445 5 1445 
# 1446
chebyshev quadratur algorithm 279 d1 cacm april 1966 hopgood f
r a litherland c ca660403a jb march 3 1978 10
50 am 1446 5 1446 1446 5 1446 1446 5
1446 
# 1447
abscissa and weight for gregori quadratur d1 cacm april 1966
welsch j h ca660403b jb march 23 1978 7 16
pm 1447 5 1447 1447 5 1447 1447 5 1447
# 1448
abscissa and weight for romberg quadratur algorithm 281 d1 cacm
april 1966 welsch j h ca660403c jb march 23 1978
7 17 pm 1448 5 1448 1448 5 1448 1448
5 1448 
# 1449
deriv algorithm 282 s22 cacm april 1966 gautschi w ca660403d
jb march 23 1978 7 18 pm 1449 5 1449
1449 5 1449 1449 5 1449 2129 5 1449 1449
6 1449 
# 1450
simultan displac of polynomi root if real and simpl algorithm
283 c2 cacm april 1966 kerner i o ca660403 jb
march 23 1978 7 19 pm 1450 5 1450 1450
5 1450 1450 5 1450 
# 1451
rung kutta integr algorithm 9 d2 cacm april 1966 thacher
jr h c ca660403f jb march 23 1978 7 21
pm 1451 5 1451 1451 5 1451 1451 5 1451
# 1452
kutta merson algorithm 218 d2 cacm april 1966 bayer g
ca660403g jb march 30 1978 9 31 am 1452 5
1452 1452 5 1452 1452 5 1452 1633 5 1452
1452 6 1452 
# 1453
a nonrecurs method of syntax specif the us of the
kleen regular express notat for describ algebra languag syntax in
particular of algol is describ in thi paper a fortran
ii comput program for carri out the elimin algorithm of
gorn similar to gaussian elimin for linear system of algebra
equat is describ thi wa appli to numer smaller languag
includ some sublanguag of algol a hand calcul result of
the applic of the algorithm to all of algol is
given thu express the revis algol 1960 syntax in complet
nonrecurs term as far as it context free portion is
concern thi descript in mani wai is far more intuit
understood than the previou recurs descript it is suggest the
paper also includ result of the machin program which doe
not includ a simplif algorithm cacm april 1966 carr iii
j w weiland j ca660402 jb march 3 1978 11
02 am 1086 4 1453 1132 4 1453 1234 4
1453 1263 4 1453 1263 4 1453 1265 4 1453
1270 4 1453 1323 4 1453 1358 4 1453 1379
4 1453 1380 4 1453 1453 4 1453 1453 4
1453 1464 4 1453 1484 4 1453 1491 4 1453
1498 4 1453 1613 4 1453 1614 4 1453 1781
4 1453 1825 4 1453 1860 4 1453 1945 4
1453 2083 4 1453 2178 4 1453 2179 4 1453
2252 4 1453 2325 4 1453 2341 4 1453 2546
4 1453 2645 4 1453 2652 4 1453 2684 4
1453 2842 4 1453 2929 4 1453 2934 4 1453
3069 4 1453 669 4 1453 679 4 1453 691
4 1453 761 4 1453 949 4 1453 989 4
1453 989 5 1453 1453 5 1453 1453 5 1453
1453 5 1453 1613 5 1453 3184 5 1453 987
6 1453 1086 6 1453 1134 6 1453 1453 6
1453 3184 6 1453 
# 1454
a simpl user orient compil sourc languag for program automat
test equip for the nonprogramm difficulti in us a languag
increas rapidli with the number of nonproblem orient convent a
simpl languag even if ineleg which consid the user s
background as part of the problem mai be more effect
than a sourc languag contain subtl and more power capabl
the languag describ in thi paper is us to write
comput program which test electron equip becaus thi test process
contain few complex idea there is littl need for the
eleg and redund of a highli syntax orient languag a
simpl and direct languag will suffic for the problem the
eventu user of thi languag ar militari depot personnel who
cannot he expect to have comput program skill or signific
program train for thi nonprogram orient user it wa essenti
to creat a languag us familiar engin statement program orient
convent would have unnecessarili complic hi task cacm april 1966
scheff b h ca660401 jb march 3 1978 11 09
am 1454 5 1454 1454 5 1454 1454 5 1454
# 1455
trac a procedur describ languag for the reactiv typewrit a
descript of the trac text reckon and compil languag and
process algorithm is given the trac languag wa develop as
the basi of a softwar packag for the reactiv typewrit
in the trac languag on can write procedur for accept
name and store ani charact string from the typewrit for
modifi ani string in ani wai for treat ani string
at ani time as an execut procedur or as a
name or as text and for print out ani string
the trac languag is base upon an extens and gener
to charact string of the program concept of the macro
through the abil of trac to accept and store definit
of procedur the capabl of the languag can be indefinit
extend and can deal with charact string integ and boolean
vector variabl cacm march 1966 mooer c n ca660317 jb
march 3 1978 11 18 am 1455 5 1455 1455
5 1455 1455 5 1455 1530 5 1455 1531 5
1455 1565 5 1455 1703 5 1455 1945 5 1455
2036 5 1455 823 6 1455 914 6 1455 915
6 1455 917 6 1455 984 6 1455 989 6
1455 990 6 1455 1012 6 1455 1084 6 1455
1098 6 1455 1122 6 1455 1138 6 1455 1139
6 1455 1141 6 1455 1162 6 1455 1185 6
1455 1200 6 1455 1223 6 1455 1265 6 1455
1336 6 1455 1358 6 1455 1396 6 1455 1455
6 1455 1455 6 1455 1455 6 1455 1455 6
1455 1455 6 1455 1455 6 1455 1477 6 1455
1487 6 1455 1491 6 1455 1496 6 1455 1565
6 1455 205 6 1455 483 6 1455 584 6
1455 669 6 1455 680 6 1455 763 6 1455
# 1456
storag and retriev of aspect of mean in direct graph
structur an experiment system that us lisp to make a
conceptu dictionari is describ the dictionari associ with each english
word the syntact inform definit materi and refer to the
context in which it ha been us to defin other
word such relat as class inclus possess and activ or
passiv action ar us as definit materi the result structur
serv as a power vehicl for research on the logic
of question answer exampl of method of input inform and
answer simpl english question ar given an import conclus is
that although lisp and other list process languag ar ideal
suit for produc complex associ structur thei ar inadequ vehicl
for languag process on ani larg scale at east until
thei can us auxiliari memori as a continu extens of
core memori cacm march 1966 simmon r f ca660316 jb
march 3 1978 11 25 am 1155 4 1456 1456
4 1456 1468 4 1456 1515 4 1456 1699 4
1456 1856 4 1456 2127 4 1456 1324 5 1456
1456 5 1456 1456 5 1456 1456 5 1456 
# 1457
data manipul and program problem in automat inform retriev automat
inform retriev program requir the manipul of a varieti of
differ data structur includ linear text spars matric and tree
or list structur the main data manipul to be perform
in automat inform system ar first briefli review a varieti
of data represent which have been us to describ structur
inform ar then examin and the characterist of variou process
languag ar outlin in the light of the procedur requir
implement advantag of these program languag for the retriev applic
ar examin and suggest ar made for the design of
program facil to aid in inform retriev cacm march 1966
salton g ca660315 jb march 3 1978 11 35 am
1457 4 1457 1236 5 1457 1457 5 1457 1457
5 1457 1457 5 1457 
# 1458
onlin program when the transit ha been made from off
line to onlin program there ar a number of chang
in the work condit note these chang in the environ
make necessari correspond chang in the process relat to produc
and check out program in the main it it not
the program languag itself which must be chang to provid
a facil for the onlin user it is the system
surround the program languag in thi paper the onlin environ
and it effect on program ar discuss cacm march 1966
schwartz j i ca660314 jb march 3 197811 44 am
1458 4 1458 1523 4 1458 1603 4 1458 1698
4 1458 1747 4 1458 1748 4 1458 1854 4
1458 1877 4 1458 1960 4 1458 2377 4 1458
2378 4 1458 2497 4 1458 2558 4 1458 2625
4 1458 2632 4 1458 2840 4 1458 2941 4
1458 3105 4 1458 3144 4 1458 1458 5 1458
1458 5 1458 1458 5 1458 1471 5 1458 
# 1459
requir for real time languag real time languag have differ
requir from other program languag becaus of the special natur
of their applic the environ in which their object program
ar execut and the environ in which thei mai be
compil it mai not be the languag extens that ultim
advanc develop in the field progress mai be made by
attack the special compil and execut system problem that must
be solv cacm march 1966 opler a ca660313 jb march
3 1978 11 48 am 1459 5 1459 1459 5
1459 1459 5 1459 
# 1460
evolut of the meta assembl program a gener assembl call
a meta assembl is describ the meta assembl is defin
and factor which contribut to it evolut ar present how
a meta assembl is made to function as an assembl
program is describ final the implic of meta assembl on
compil design is discuss cacm march 1966 ferguson d e
ca660312 jb march 3 1978 11 56 am 1358 5
1460 1460 5 1460 1460 5 1460 1460 5 1460
1781 5 1460 123 6 1460 196 6 1460 919
6 1460 990 6 1460 1007 6 1460 1046 6
1460 1131 6 1460 1139 6 1460 1140 6 1460
1149 6 1460 1198 6 1460 1215 6 1460 1223
6 1460 1265 6 1460 1303 6 1460 1323 6
1460 1358 6 1460 1366 6 1460 1421 6 1460
1460 6 1460 1460 6 1460 1462 6 1460 1463
6 1460 1467 6 1460 1468 6 1460 1477 6
1460 1491 6 1460 1496 6 1460 1531 6 1460
1535 6 1460 1565 6 1460 1601 6 1460 1602
6 1460 1613 6 1460 1614 6 1460 1626 6
1460 1641 6 1460 1787 6 1460 1788 6 1460
205 6 1460 205 6 1460 224 6 1460 249
6 1460 288 6 1460 316 6 1460 381 6
1460 398 6 1460 11 6 1460 404 6 1460
410 6 1460 463 6 1460 464 6 1460 483
6 1460 3184 6 1460 3184 6 1460 3188 6
1460 584 6 1460 600 6 1460 680 6 1460
691 6 1460 729 6 1460 763 6 1460 799
6 1460 799 6 1460 
# 1461
discuss summari on oper system cacm march 1966 ca660311 jb
march 3 1978 1 26 pm 1461 5 1461 1461
5 1461 1461 5 1461 
# 1462
multilevel oper system the basic softwar for all newer comput
is built on the well establish need for standard oper
system thi impli that all applic no matter how larg
complex or time consum must oper under or more precis
on top of the standard system larg applic requir supervisori
monitor which handl problem similar to those of the oper
system but at a differ level sometim still a third
or even a fourth such level is requir or desir
thi lead natur to the concept of multilevel system similar
vertic but differ horizont proper divis of respons between level
lead to greater effici and less logic complex while actual
enhanc capabl cacm march 1966 orchard hai w ca660310 jb
march 3 1978 1 31 pm 1462 5 1462 1462
5 1462 1462 5 1462 1781 5 1462 123 6
1462 196 6 1462 919 6 1462 990 6 1462
1007 6 1462 1046 6 1462 1131 6 1462 1139
6 1462 1140 6 1462 1149 6 1462 1198 6
1462 1215 6 1462 1223 6 1462 1265 6 1462
1303 6 1462 1323 6 1462 1358 6 1462 1366
6 1462 1421 6 1462 1460 6 1462 1462 6
1462 1463 6 1462 1467 6 1462 1468 6 1462
1477 6 1462 1491 6 1462 1496 6 1462 1531
6 1462 1535 6 1462 1565 6 1462 1601 6
1462 1602 6 1462 1613 6 1462 1614 6 1462
1626 6 1462 1641 6 1462 1787 6 1462 1788
6 1462 205 6 1462 224 6 1462 249 6
1462 288 6 1462 316 6 1462 381 6 1462
398 6 1462 11 6 1462 404 6 1462 410
6 1462 463 6 1462 464 6 1462 483 6
1462 3184 6 1462 3188 6 1462 584 6 1462
600 6 1462 680 6 1462 691 6 1462 763
6 1462 799 6 1462 
# 1463
more on extens machin on of the most salient characterist
of extens machin em is the facil for provid system
control over program to program and program to data linkag
e g address connect it is the intent of thi
paper to expand and clarifi the remark concern program to
program and program to data linkag that were embodi in
the author previou paper on the em concept and to
final trace the employ of linkag mechan through variou level
of program languag cacm march 1966 leonard g f goodro
j r ca660309 jb march 3 1978 1 34 pm
1463 5 1463 1463 5 1463 1463 5 1463 1781
5 1463 123 6 1463 196 6 1463 919 6
1463 990 6 1463 1007 6 1463 1046 6 1463
1131 6 1463 1139 6 1463 1140 6 1463 1149
6 1463 1198 6 1463 1215 6 1463 1223 6
1463 1265 6 1463 1303 6 1463 1323 6 1463
1358 6 1463 1366 6 1463 1421 6 1463 1460
6 1463 1462 6 1463 1463 6 1463 1467 6
1463 1468 6 1463 1477 6 1463 1491 6 1463
1496 6 1463 1531 6 1463 1535 6 1463 1565
6 1463 1601 6 1463 1602 6 1463 1613 6
1463 1614 6 1463 1626 6 1463 1641 6 1463
1787 6 1463 1788 6 1463 205 6 1463 224
6 1463 249 6 1463 288 6 1463 316 6
1463 381 6 1463 398 6 1463 11 6 1463
404 6 1463 410 6 1463 463 6 1463 464
6 1463 483 6 1463 3184 6 1463 3188 6
1463 584 6 1463 600 6 1463 680 6 1463
691 6 1463 763 6 1463 799 6 1463 
# 1464
an algol compil construct and us in relat to an
elabor oper system an algol translat ha been prepar and
integr into the ibsi oper system assembl and go featur
of ibsi permit immedi execut with option list deck and
debug inform us the chain featur of ibsi link written
in map or fortran as well as algol mai be
call by the algol main program in addit procedur code
in map mai be includ in ani algol program although
assembl plu load time exce compil time the total time
is satisfactori and the user get eas and facil which
ar fulli compens cacm march 1966 boussard j c ca660308
jb march 3 1978 1 41 pm 249 4 1464
254 4 1464 272 4 1464 1086 4 1464 1102
4 1464 1109 4 1464 1132 4 1464 1140 4
1464 1188 4 1464 1234 4 1464 1263 4 1464
1265 4 1464 1270 4 1464 1306 4 1464 1323
4 1464 1358 4 1464 1379 4 1464 1380 4
1464 1453 4 1464 1464 4 1464 1464 4 1464
1484 4 1464 1491 4 1464 1491 4 1464 1498
4 1464 1613 4 1464 1614 4 1464 1767 4
1464 1781 4 1464 1781 4 1464 1787 4 1464
1825 4 1464 1860 4 1464 1949 4 1464 321
4 1464 2059 4 1464 2083 4 1464 2126 4
1464 2178 4 1464 2179 4 1464 2252 4 1464
2325 4 1464 2341 4 1464 2546 4 1464 435
4 1464 437 4 1464 463 4 1464 483 4
1464 491 4 1464 2645 4 1464 2652 4 1464
2684 4 1464 2732 4 1464 2842 4 1464 2929
4 1464 2934 4 1464 560 4 1464 583 4
1464 3069 4 1464 3073 4 1464 627 4 1464
631 4 1464 632 4 1464 642 4 1464 644
4 1464 653 4 1464 669 4 1464 679 4
1464 680 4 1464 691 4 1464 761 4 1464
761 4 1464 762 4 1464 763 4 1464 123
4 1464 140 4 1464 919 4 1464 949 4
1464 989 4 1464 989 4 1464 196 5 1464
1464 5 1464 1464 5 1464 1464 5 1464 3184
5 1464 
# 1465
program translat view as a gener data process problem effici
dictat that the overal effect of a compil be increas
by all mean avail for a compil to have a
substanti us life it need a clear logic structur reliabl
and sound data process techniqu a compil must be base
on fix convent to preserv effici and reliabl empti option
and default convent violat thi dictum us of structur to
associ variou part of a program and economi of featur
promot clariti and reliabl cacm march 1966 naur p ca660307
jb march 3 1978 1 45 pm 1465 5 1465
1465 5 1465 1465 5 1465 
# 1466
discuss summari on graphic languag cacm march 1966 ca660306 jb
march 3 1978 1 46 pm 1466 5 1466 1466
5 1466 1466 5 1466 2341 5 1466 990 6
1466 1468 6 1466 1466 6 1466 3184 6 1466
# 1467
a graphic servicesystem with variabl syntax man machin interact in
mani field of endeavor should be greatli facilit in the
near futur through the us of interact graphic languag to
provid a varieti of displai scope commun procedur a graphic
servic system which function as a gener graphic languag translat
is be develop to aid the definit as well as
the us of new graphic languag cacm march 1966 robert
l g ca660305 jb march 3 1978 1 49 pm
1467 5 1467 1467 5 1467 1467 5 1467 1767
5 1467 1781 5 1467 123 6 1467 196 6
1467 196 6 1467 919 6 1467 990 6 1467
1007 6 1467 1046 6 1467 1131 6 1467 1139
6 1467 1140 6 1467 1149 6 1467 1198 6
1467 1215 6 1467 1223 6 1467 1265 6 1467
1303 6 1467 1323 6 1467 1358 6 1467 1366
6 1467 1421 6 1467 1460 6 1467 1462 6
1467 1463 6 1467 1467 6 1467 1467 6 1467
1468 6 1467 1468 6 1467 1477 6 1467 1491
6 1467 1496 6 1467 1496 6 1467 1531 6
1467 1535 6 1467 1565 6 1467 1601 6 1467
1602 6 1467 1613 6 1467 1614 6 1467 1626
6 1467 1641 6 1467 1787 6 1467 1788 6
1467 205 6 1467 224 6 1467 249 6 1467
288 6 1467 316 6 1467 381 6 1467 398
6 1467 11 6 1467 404 6 1467 410 6
1467 463 6 1467 464 6 1467 483 6 1467
3184 6 1467 3188 6 1467 584 6 1467 600
6 1467 680 6 1467 691 6 1467 763 6
1467 799 6 1467 
# 1468
syntax direct interpret of class of pictur a descript scheme
for class of pictur base on label techniqu us parallel
process algorithm wa propos by the author some year ago
sinc then much work ha been done in appli thi
to bubbl chamber pictur the parallel process simul origin written
for an ibm 7094 system ha now been rewritten for
a cdc 3600 system thi paper descript model by consid
their specif applic to bubbl chamber pictur how the descript
gener in thi phase can be embed in a larger
convers program is explain by mean of a certain specif
exampl that ha been work out a partial gener grammar
for handwritten english letter is given as ar also a
few comput gener output us thi grammar and the parallel
process simul mention earlier cacm march 1966 narasimhan r ca660304
jb march 3 1978 1 56 pm 1155 4 1468
1456 4 1468 1468 4 1468 1515 4 1468 1699
4 1468 1856 4 1468 2127 4 1468 1324 5
1468 1468 5 1468 1468 5 1468 1468 5 1468
1767 5 1468 1781 5 1468 2341 5 1468 123
6 1468 196 6 1468 196 6 1468 919 6
1468 990 6 1468 990 6 1468 1007 6 1468
1046 6 1468 1131 6 1468 1139 6 1468 1140
6 1468 1149 6 1468 1198 6 1468 1215 6
1468 1223 6 1468 1265 6 1468 1303 6 1468
1323 6 1468 1358 6 1468 1366 6 1468 1421
6 1468 1460 6 1468 1462 6 1468 1463 6
1468 1467 6 1468 1467 6 1468 1468 6 1468
1468 6 1468 1468 6 1468 1466 6 1468 1477
6 1468 1491 6 1468 1496 6 1468 1496 6
1468 1531 6 1468 1535 6 1468 1565 6 1468
1601 6 1468 1602 6 1468 1613 6 1468 1614
6 1468 1626 6 1468 1641 6 1468 1787 6
1468 1788 6 1468 205 6 1468 224 6 1468
249 6 1468 288 6 1468 316 6 1468 381
6 1468 398 6 1468 11 6 1468 404 6
1468 410 6 1468 463 6 1468 464 6 1468
483 6 1468 3184 6 1468 3184 6 1468 3188
6 1468 584 6 1468 600 6 1468 680 6
1468 691 6 1468 763 6 1468 799 6 1468
# 1469
the next 700 program languag a famili of unimpl comput
languag is describ that is intend to span differ of
applic area by a unifi framework thi framework dictat the
rule about the us of user coin name and the
convent about character function relationship within thi framework the design
of a specif languag split into two independ part on
is the choic of written appear of program or more
gener their physic represent the other is the choic of
the abstract entiti such as number charact string list of
them function relat among them that can be refer to
in the languag the system is bias toward express rather
than statement it includ a nonprocedur pure function subsystem that
aim to expand the class of user need that can
be met by a singl print instruct without sacrif the
import properti that make convent right hand side express easi
to construct and understand cacm march 1966 landin p j
ca660303 jb march 3 1978 2 05 pm 1469 4
1469 1486 4 1469 1491 4 1469 1781 4 1469
2178 4 1469 2326 4 1469 2470 4 1469 2684
4 1469 3044 4 1469 1303 5 1469 1469 5
1469 1469 5 1469 1469 5 1469 2060 5 1469
2294 5 1469 2470 5 1469 3124 5 1469 1303
6 1469 1380 6 1469 1421 6 1469 1469 6
1469 1469 6 1469 1469 6 1469 1469 6 1469
1477 6 1469 1491 6 1469 210 6 1469 1834
6 1469 1869 6 1469 2060 6 1469 2110 6
1469 2264 6 1469 
# 1470
the structur of program languag the follow ar identifi as
major compon of everi program languag 1 the elementari program
statement 2 mechan for link elementari statement togeth 3 the
mean by which a program can obtain data input sever
altern form of each of these compon ar describ compar
and evalu mani exampl frequent from list process languag illustr
the form describ elementari program statement usual take the form
of command requir or implicit specif a command is an
imper statement that command the action to be taken a
requir describ the effect to be achiev without sai anyth
about the action to be taken an implicit specif is
similar to a requir but the programm must understand what
action will be taken to achiev the desir effect subroutin
mai be enter explicitli by execut call or by function
composit explicitli call subroutin gener requir special linkag convent an
execut subroutin call is syntact indistinguish from a basic instruct
of the program languag function composit is a conveni altern
to the explicit call the three princip wai of get
input for routin ar 1 by refer to the data
itself 2 by refer to the data by a name
and 3 by refer to it implicitli by mean of
variabl or function name ar us entri point into perman
data structur but can be error caus distract in other
context the author discuss advantag disadvantag and factor influenc the
choic of a form of compon for a languag he
conclud by suggest the evolut of program languag toward on
which will permit all the most conveni wai of structur
program organ system and referenc data cacm march 1966 raphael
b ca660302 jb march 3 1978 2 20 pm 1470
5 1470 1470 5 1470 1470 5 1470 
# 1471
program semant for multiprogram comput the semant ar defin for
a number of meta instruct which perform oper essenti to
the write of program in multiprogram comput system these meta
instruct relat to parallel process protect of separ comput program
debug and the share among user of memori segment and
other comput object the name of which ar hierarch structur
the languag sophist contempl is midwai between an assembl languag
and an advanc algebra languag cacm march 1966 denni j
b vanhorn e c ca660301 jb march 3 1978 2
25 pm 1471 4 1471 1471 4 1471 1774 4
1471 972 4 1471 276 5 1471 1458 5 1471
1471 5 1471 1471 5 1471 1471 5 1471 1523
5 1471 1603 5 1471 1698 5 1471 1747 5
1471 1748 5 1471 1854 5 1471 1877 5 1471
1960 5 1471 2377 5 1471 2378 5 1471 2497
5 1471 2558 5 1471 2625 5 1471 2632 5
1471 2840 5 1471 2941 5 1471 3105 5 1471
3144 5 1471 800 5 1471 1421 6 1471 1471
6 1471 1471 6 1471 1471 6 1471 1471 6
1471 1471 6 1471 1471 6 1471 1471 6 1471
1471 6 1471 1471 6 1471 1471 6 1471 1471
6 1471 1471 6 1471 1471 6 1471 1471 6
1471 1471 6 1471 1471 6 1471 1471 6 1471
1471 6 1471 1471 6 1471 1746 6 1471 1746
6 1471 1748 6 1471 1749 6 1471 1749 6
1471 1749 6 1471 1749 6 1471 1749 6 1471
1753 6 1471 1854 6 1471 2060 6 1471 2080
6 1471 2080 6 1471 2182 6 1471 2298 6
1471 2356 6 1471 2358 6 1471 2358 6 1471
2436 6 1471 2438 6 1471 2491 6 1471 2558
6 1471 2597 6 1471 2624 6 1471 2625 6
1471 2625 6 1471 2626 6 1471 2629 6 1471
2632 6 1471 2632 6 1471 2651 6 1471 2868
6 1471 2939 6 1471 3068 6 1471 
# 1472
descript of a high capac fast turnaround univers comput center
the oper system for the univac 1107 at case institut
is review the system is of interest becaus of the
low turnaround time achiev the high throughput achiev and the
lack of an oper staff turnaround time below 5 minut
and job volum abov 75 000 per quarter year on
report cacm februari 1966 lynch w ca660212 jb march 3
1978 2 28 pm 1472 5 1472 1472 5 1472
1472 5 1472 1550 5 1472 1304 6 1472 1472
6 1472 
# 1473
the stabil of the fourth order rung kutta method for
the solut of system of differenti equat the problem of
the region of stabil of the fourth order rung kutta
method for the solut of system of differenti equat is
studi thi region can be character by mean of linear
transform but can not be given in a close form
in the paper thi region is determin by the electron
digit comput z22 cacm februari 1966 karim a i a
ca660211 jb march 3 1978 2 31 pm 1473 5
1473 1473 5 1473 1473 5 1473 
# 1474
test of probabilist model for propag of roundoff error in
ani prolong comput it is gener assum that the accumul
effect of roundoff error is in some sens statist the
purpos of thi paper is to give precis descript of
certain probabilist model for roundoff error and then to describ
a seri of experi for test the valid of these
model it is conclud that the model ar in gener
veri good discrep ar both rare and mild the test
techniqu can also be us to experi with variou type
of special arithmet cacm februari 1966 hull t e swenson
j r ca660210 jb march 3 1978 2 37 pm
1474 5 1474 1474 5 1474 1474 5 1474 2525
5 1474 1474 6 1474 
# 1475
dribbl post a master file mani busi applic emploi sequenti
magnet tape rather than random access storag techniqu to process
a veri small number of transact against a volumin master
file in such situat it mai prove econom to avoid
creat a new master file dure each updat run by
produc instead a dribbl ledger contain onli those master file
account which have experienc activ cacm februari 1966 head r
v ca660209 jb march 3 1978 2 41 pm 1475
5 1475 1475 5 1475 1475 5 1475 
# 1476
control procedur for data commun an asa progress report section
committe x 3 of the american standard associ ha charg
on of it task group x3 3 4 with the
respons to defin and specifi function control requir and characterist
govern the oper of digit data gener and receiv system
interconnect by commun system thi effort is primarili direct toward
system emploi the american standard code for inform interchang ascii
thi paper repres a progress report on the work of
thi group toward a propos for nation and intern standard
in the field of control procedur it describ both the
old and new work of the task group the new
work is present in detail while the work that ha
been present in earlier paper control procedur for data commun
task group document x3 3 4 44 mai 1964 transpar
mode control procedur for data commun task group document x3
3 4 58 decemb 1964 comm acm 8 apr 1965
203 206 control procedur for data commun task group document
x3 3 4 60 march 1965 is retain here in
summari form mani of the concept and principl describ herein
have been submit to the intern organ for standard via
earlier paper and ar now embodi in work paper of
that organ cacm februari 1966 ca660208jb march 3 1978 3
04 pm 1476 5 1476 1476 5 1476 1476 5
1476 
# 1477
euler a gener of algol and it formal definit part
ii cacm februari 1966 wirth n weber h ca660207 jb
march 3 1978 3 10 pm 1379 5 1477 1477
5 1477 1477 5 1477 1477 5 1477 1693 5
1477 1781 5 1477 1836 5 1477 1945 5 1477
2015 5 1477 2060 5 1477 2061 5 1477 2091
5 1477 2179 5 1477 2546 5 1477 2698 5
1477 2708 5 1477 3045 5 1477 823 6 1477
123 6 1477 196 6 1477 914 6 1477 915
6 1477 917 6 1477 919 6 1477 984 6
1477 989 6 1477 990 6 1477 990 6 1477
1007 6 1477 1012 6 1477 1046 6 1477 1084
6 1477 1098 6 1477 1122 6 1477 1131 6
1477 1138 6 1477 1139 6 1477 1139 6 1477
1140 6 1477 1140 6 1477 1141 6 1477 1141
6 1477 1149 6 1477 1191 6 1477 1198 6
1477 1200 6 1477 1215 6 1477 1223 6 1477
1223 6 1477 1263 6 1477 1265 6 1477 1265
6 1477 1303 6 1477 1323 6 1477 1336 6
1477 1358 6 1477 1366 6 1477 1366 6 1477
1380 6 1477 1396 6 1477 1421 6 1477 1421
6 1477 1421 6 1477 1455 6 1477 1460 6
1477 1462 6 1477 1463 6 1477 1467 6 1477
1468 6 1477 1469 6 1477 1477 6 1477 1477
6 1477 1477 6 1477 1477 6 1477 1477 6
1477 1477 6 1477 1477 6 1477 1477 6 1477
1477 6 1477 1477 6 1477 1477 6 1477 1477
6 1477 1477 6 1477 1477 6 1477 1487 6
1477 1491 6 1477 1491 6 1477 1491 6 1477
1491 6 1477 1491 6 1477 1491 6 1477 1491
6 1477 1491 6 1477 1491 6 1477 1491 6
1477 1491 6 1477 1491 6 1477 1496 6 1477
1496 6 1477 1531 6 1477 1535 6 1477 1565
6 1477 1601 6 1477 1602 6 1477 1613 6
1477 1614 6 1477 1614 6 1477 1626 6 1477
1641 6 1477 1781 6 1477 1781 6 1477 1781
6 1477 1787 6 1477 1787 6 1477 1788 6
1477 205 6 1477 1825 6 1477 1825 6 1477
210 6 1477 224 6 1477 249 6 1477 1869
6 1477 288 6 1477 316 6 1477 381 6
1477 398 6 1477 2015 6 1477 2110 6 1477
2110 6 1477 2110 6 1477 2111 6 1477 11
6 1477 2126 6 1477 2534 6 1477 2534 6
1477 2556 6 1477 2556 6 1477 404 6 1477
404 6 1477 410 6 1477 463 6 1477 464
6 1477 483 6 1477 483 6 1477 3184 6
1477 3184 6 1477 3184 6 1477 3184 6 1477
3188 6 1477 577 6 1477 584 6 1477 584
6 1477 600 6 1477 669 6 1477 669 6
1477 680 6 1477 680 6 1477 680 6 1477
680 6 1477 691 6 1477 761 6 1477 763
6 1477 763 6 1477 773 6 1477 799 6
1477 799 6 1477 
# 1478
exponenti curv fit algorithm 275 e2 cacm februari 1966 deili
g r ca660206a jb march 3 1978 3 11 pm
1478 5 1478 1478 5 1478 1478 5 1478 2694
5 1478 1478 6 1478 
# 1479
constrain exponenti curv fit algorithm 276 e2 cacm februari 1966
deili g r ca660206b jb march 23 1978 7 27
pm 1479 5 1479 1479 5 1479 1479 5 1479
# 1480
comput of chebyshev seri coeffici algorithm 277 c6 cacm februari
1966 smith l b ca660206c jb march 23 1978 7
28 pm 1480 5 1480 1480 5 1480 1480 5
1480 1639 5 1480 1480 6 1480 
# 1481
graph plotter algorithm 278 j6 cacm februari 1966 lloyd p
ca660206d jb march 23 1978 7 30 pm 1481 5
1481 1481 5 1481 1481 5 1481 
# 1482
bugsi a program system for pictur process not for debug
bugsi is a pictur process and measur system that depend
upon a pictori input to the comput s memori bugsi
can be us for mani type of applic in particular
the author have us the system for the analysi of
linear graph the main concept of the system is the
us of a collect of programm pointer which ar visual
as a famili of bug cacm februari 1966 ledlei r
s jacobsen j belson m ca660205 jb march 3 1978
3 16 pm 1482 5 1482 1482 5 1482 1482
5 1482 
# 1483
a comparison of the fortran languag implement for sever comput
a featur by featur comparison is made of five differ
implement of fortran iv repres three differ manufactur a tabl
is construct show where possibl the us of each featur
in each implement onli those item which ar differ from
or have been ad to fortran ii ar shown cacm
februari 1966 wright d l ca660204 jb march 3 1978
3 19 pm 1483 5 1483 1483 5 1483 1483
5 1483 
# 1484
a languag for describ the function of synchron system befor
the design of a system is start the exact function
desir of it should be specifi it is suggest that
a comput orient languag be us for thi purpos the
inadequaci of the standard program languag for the descript of
system ar discuss and a dialect of algol which is
suitabl for describ synchron system is introduc these descript can
be us for simul and automat design of the system
describ in addit to commun system specif cacm februari 1966
parna d l ca660203 jb march 3 1978 3 23
pm 1086 4 1484 1132 4 1484 1234 4 1484
1263 4 1484 1265 4 1484 1270 4 1484 1323
4 1484 1358 4 1484 1379 4 1484 1380 4
1484 1453 4 1484 1464 4 1484 1484 4 1484
1491 4 1484 1498 4 1484 1613 4 1484 1614
4 1484 1781 4 1484 1825 4 1484 1860 4
1484 2083 4 1484 2178 4 1484 2179 4 1484
2252 4 1484 2325 4 1484 2341 4 1484 2546
4 1484 2645 4 1484 2652 4 1484 2684 4
1484 2842 4 1484 2929 4 1484 2934 4 1484
3069 4 1484 669 4 1484 679 4 1484 691
4 1484 761 4 1484 949 4 1484 989 4
1484 1484 5 1484 1484 5 1484 1484 5 1484
1846 5 1484 3184 5 1484 1380 6 1484 1424
6 1484 1484 6 1484 1572 6 1484 576 6
1484 
# 1485
the structur of program languag in thi paper the major
compon of everi program languag ar identifi as 1 the
elementari program statement 2 mechan for link elementari statement togeth
3 the mean by which a program can obtain data
input sever altern form of each of these compon ar
also describ compar and evalu mani exampl frequent from list
process languag illustr the form describ the advantag disadvantag and
factor influenc the choic of a form of compon for
a languag ar discuss and the paper conclud with the
suggest that program languag evolv toward on which will permit
all the most conveni wai of structur program organ system
and referenc data cacm februari 1966 raphael b ca660202 jb
march 3 1978 3 46 pm 1024 4 1485 1051
4 1485 1098 4 1485 1214 4 1485 1380 4
1485 1388 4 1485 1393 4 1485 1485 4 1485
1487 4 1485 1549 4 1485 1570 4 1485 1878
4 1485 1946 4 1485 1957 4 1485 2168 4
1485 2723 4 1485 2857 4 1485 3112 4 1485
1485 5 1485 1485 5 1485 1485 5 1485 731
5 1485 
# 1486
a reprogram machin in thi paper a descript is given
of a model program system which is direct by a
program languag and ha a librari for store the user
s item rule ar given for transform program written in
the languag and for rearrang the item in the librari
so that thei share their common part some specul ar
made about how the mechan detect of common part or
pattern of librari item could help a user to solv
hi problem and about the relationship between the behavior of
the reprogram machin and human intellig behavior cacm februari 1966
burg w h ca660201 jb march 3 1978 3 50
pm 1024 4 1486 1051 4 1486 1102 4 1486
1132 4 1486 1390 4 1486 1469 4 1486 1486
4 1486 1486 4 1486 1491 4 1486 1549 4
1486 1706 4 1486 1781 4 1486 1826 4 1486
1878 4 1486 378 4 1486 2060 4 1486 2155
4 1486 2168 4 1486 2178 4 1486 2326 4
1486 2470 4 1486 2684 4 1486 2719 4 1486
2723 4 1486 2838 4 1486 2842 4 1486 2855
4 1486 2879 4 1486 3044 4 1486 3077 4
1486 3080 4 1486 3106 4 1486 627 4 1486
106 4 1486 1303 5 1486 210 5 1486 1486
5 1486 1486 5 1486 1486 5 1486 
# 1487
eliza a comput program for the studi ofnatur languag commun
between man and machin eliza is a program oper within
the mac time share system at mit which make certain
kind of natur languag convers between man and comput possibl
input sentenc ar analyz on the basi of decomposit rule
which ar trigger by kei word appear in the input
text respons ar gener by reassembl rule associ with select
decomposit rule the fundament technic problem with which eliza is
concern ar 1 the identif of kei word 2 the
discoveri of minim context 3 the choic of appropri transform
4 gener of respons in the absenc of kei word
and 5 the provis of an edit capabl for eliza
script a discuss of some psycholog issu relev to the
eliza approach as well as of futur develop conclud the
paper cacm januari 1966 weizenbaum j ca660108 jb march 3
1978 4 00 pm 1024 4 1487 1051 4 1487
1098 4 1487 1214 4 1487 1380 4 1487 1388
4 1487 1393 4 1487 1485 4 1487 1487 4
1487 1549 4 1487 1570 4 1487 1878 4 1487
1946 4 1487 1957 4 1487 2168 4 1487 2723
4 1487 2857 4 1487 3112 4 1487 1400 5
1487 1487 5 1487 1487 5 1487 1487 5 1487
1553 5 1487 1945 5 1487 2127 5 1487 2396
5 1487 2730 5 1487 731 5 1487 823 6
1487 914 6 1487 915 6 1487 917 6 1487
984 6 1487 989 6 1487 990 6 1487 1012
6 1487 1084 6 1487 1098 6 1487 1122 6
1487 1138 6 1487 1139 6 1487 1141 6 1487
1155 6 1487 1200 6 1487 1223 6 1487 1265
6 1487 1324 6 1487 1336 6 1487 1396 6
1487 1455 6 1487 1477 6 1487 1487 6 1487
1487 6 1487 1487 6 1487 1487 6 1487 1487
6 1487 1487 6 1487 1491 6 1487 1496 6
1487 1527 6 1487 1781 6 1487 1856 6 1487
1856 6 1487 2092 6 1487 2127 6 1487 483
6 1487 584 6 1487 669 6 1487 680 6
1487 763 6 1487 
# 1488
program decis tabl in fortran cobol or algol a simpl
broad base approach for program decis tabl in fortran or
cobol is develop and present with input in standard form
as defin in the paper the program of ani decis
tabl can be done with on or two fortran statement
or with two cobol statement if the comput verb is
avail in the cobol processor it is shown that the
method is applic even when there ar more than two
mutual exclus state of on two or more tabl condit
it is further shown that multi state condit in decis
tabl can often simplifi the program the method outlin ha
the further advantag that all possibl combin of condit ar
consid it is shown that the suggest procedur is easili
implement in algol cacm januari 1966 veinott c g ca660107
jb march 3 1978 4 08 pm 1354 4 1488
1354 4 1488 1488 4 1488 1488 4 1488 1994
4 1488 2053 4 1488 2053 4 1488 2220 4
1488 2220 4 1488 2273 4 1488 2273 4 1488
2726 4 1488 2856 4 1488 1237 5 1488 1327
5 1488 1488 5 1488 1488 5 1488 1488 5
1488 1548 5 1488 2726 5 1488 1172 6 1488
1327 6 1488 1354 6 1488 1488 6 1488 1488
6 1488 1489 6 1488 1489 6 1488 1548 6
1488 2220 6 1488 2221 6 1488 2263 6 1488
# 1489
data document and decis tabl in busi data process system
it is necessari to be abl to defin and document
data file program and decis rule in a wai that
adequ repres both 1 their chang inform content and 2
their continu interact tabular descript make thi possibl be notabl
object through and econom in cost and time when system
must be analyz and program prepar or modifi to show
how quickli tabular techniqu make an unfamiliar system manag a
detail exampl and a self test ar provid cacm januari
1966 fisher d l ca660106 jb march 3 1978 4
13 pm 1489 5 1489 1489 5 1489 1489 5
1489 1548 5 1489 2220 5 1489 2726 5 1489
1172 6 1489 1172 6 1489 1237 6 1489 1327
6 1489 1327 6 1489 1354 6 1489 1354 6
1489 1488 6 1489 1488 6 1489 1489 6 1489
1489 6 1489 1489 6 1489 1548 6 1489 1548
6 1489 250 6 1489 2220 6 1489 2221 6
1489 2263 6 1489 
# 1490
on inch perfor paper tape for inform interchang propos american
standard cacm januari 1966 ca660105 jb march 3 1978 4
14 pm 1490 5 1490 1490 5 1490 1490 5
1490 
# 1491
euler a gener algol and it formal definit part i
a method for defin program languag is develop which introduc
a rigor relationship between structur and mean the structur of
a languag is defin by a phrase structur syntax the
mean in term of the effect which the execut of
a sequenc of interpret rule exert upon a fix set
of variabl call the environ there exist a on to
on correspond between syntact rule and interpret rule is determin
by the sequenc of correspond syntact reduct which constitut a
pars the individu interpret rule ar explain in term of
an elementari an d obviou algorithm notat a construct method
for evalu a text is provid and for certain decid
class of languag their unambigu is prove as an exampl
a gener of algol is describ in full detail to
demonstr that concept like block structur procedur paramet etc can
be defin adequ and precis by thi method cacm januari
1966 wirth n weber h ca660104 jb march 3 1978
4 22 pm 249 4 1491 254 4 1491 272
4 1491 1037 4 1491 1086 4 1491 1102 4
1491 1109 4 1491 1132 4 1491 1140 4 1491
1188 4 1491 1234 4 1491 1234 4 1491 1263
4 1491 1265 4 1491 1270 4 1491 1306 4
1491 1323 4 1491 1358 4 1491 1358 4 1491
1379 4 1491 1380 4 1491 1453 4 1491 1464
4 1491 1464 4 1491 1469 4 1491 1484 4
1491 1486 4 1491 1491 4 1491 1491 4 1491
1491 4 1491 1491 4 1491 1491 4 1491 1498
4 1491 1613 4 1491 1614 4 1491 1767 4
1491 1781 4 1491 1781 4 1491 1781 4 1491
1781 4 1491 1787 4 1491 1825 4 1491 1860
4 1491 1949 4 1491 321 4 1491 2059 4
1491 2061 4 1491 2083 4 1491 2126 4 1491
2178 4 1491 2178 4 1491 2179 4 1491 2252
4 1491 2325 4 1491 2326 4 1491 2341 4
1491 2470 4 1491 2546 4 1491 435 4 1491
437 4 1491 463 4 1491 483 4 1491 491
4 1491 2645 4 1491 2652 4 1491 2684 4
1491 2684 4 1491 2732 4 1491 2842 4 1491
2929 4 1491 2934 4 1491 560 4 1491 583
4 1491 3044 4 1491 3069 4 1491 3073 4
1491 627 4 1491 631 4 1491 632 4 1491
642 4 1491 644 4 1491 653 4 1491 669
4 1491 679 4 1491 680 4 1491 691 4
1491 761 4 1491 761 4 1491 762 4 1491
763 4 1491 123 4 1491 140 4 1491 919
4 1491 949 4 1491 989 4 1491 989 4
1491 196 5 1491 1140 5 1491 1303 5 1491
1491 5 1491 1491 5 1491 1491 5 1491 1542
5 1491 1683 5 1491 1693 5 1491 1781 5
1491 1787 5 1491 1836 5 1491 1945 5 1491
2060 5 1491 2061 5 1491 2082 5 1491 2091
5 1491 2152 5 1491 2179 5 1491 2340 5
1491 2356 5 1491 2546 5 1491 2603 5 1491
2698 5 1491 2708 5 1491 2824 5 1491 2982
5 1491 2986 5 1491 3045 5 1491 3093 5
1491 3184 5 1491 729 5 1491 823 6 1491
123 6 1491 196 6 1491 196 6 1491 914
6 1491 915 6 1491 917 6 1491 919 6
1491 970 6 1491 984 6 1491 989 6 1491
990 6 1491 990 6 1491 1007 6 1491 1012
6 1491 1046 6 1491 1084 6 1491 1098 6
1491 1122 6 1491 1131 6 1491 1138 6 1491
1139 6 1491 1139 6 1491 1140 6 1491 1140
6 1491 1141 6 1491 1141 6 1491 1141 6
1491 1141 6 1491 1149 6 1491 1191 6 1491
1191 6 1491 1198 6 1491 1200 6 1491 1215
6 1491 1215 6 1491 1223 6 1491 1223 6
1491 1265 6 1491 1265 6 1491 1303 6 1491
1323 6 1491 1336 6 1491 1358 6 1491 1366
6 1491 1366 6 1491 1380 6 1491 1396 6
1491 1421 6 1491 1421 6 1491 1421 6 1491
1455 6 1491 1460 6 1491 1462 6 1491 1463
6 1491 1467 6 1491 1468 6 1491 1469 6
1491 1477 6 1491 1477 6 1491 1477 6 1491
1477 6 1491 1477 6 1491 1477 6 1491 1477
6 1491 1477 6 1491 1477 6 1491 1477 6
1491 1477 6 1491 1477 6 1491 1487 6 1491
1491 6 1491 1491 6 1491 1491 6 1491 1491
6 1491 1491 6 1491 1491 6 1491 1491 6
1491 1491 6 1491 1491 6 1491 1491 6 1491
1491 6 1491 1491 6 1491 1491 6 1491 1491
6 1491 1491 6 1491 1491 6 1491 1491 6
1491 1491 6 1491 1491 6 1491 1491 6 1491
1491 6 1491 1491 6 1491 1491 6 1491 1491
6 1491 1496 6 1491 1496 6 1491 1496 6
1491 1531 6 1491 1535 6 1491 1565 6 1491
1601 6 1491 1602 6 1491 1613 6 1491 1614
6 1491 1614 6 1491 1626 6 1491 1641 6
1491 1683 6 1491 1683 6 1491 1683 6 1491
1767 6 1491 1781 6 1491 1781 6 1491 1781
6 1491 1787 6 1491 1787 6 1491 1788 6
1491 205 6 1491 1825 6 1491 1825 6 1491
210 6 1491 1836 6 1491 1836 6 1491 1836
6 1491 224 6 1491 224 6 1491 249 6
1491 1869 6 1491 288 6 1491 316 6 1491
381 6 1491 398 6 1491 2015 6 1491 2110
6 1491 2110 6 1491 2110 6 1491 2111 6
1491 11 6 1491 2126 6 1491 2179 6 1491
2179 6 1491 2227 6 1491 2340 6 1491 2340
6 1491 2340 6 1491 2534 6 1491 2534 6
1491 2556 6 1491 2556 6 1491 2708 6 1491
404 6 1491 404 6 1491 410 6 1491 463
6 1491 464 6 1491 483 6 1491 483 6
1491 3184 6 1491 3184 6 1491 3184 6 1491
3188 6 1491 3198 6 1491 518 6 1491 577
6 1491 584 6 1491 584 6 1491 600 6
1491 669 6 1491 680 6 1491 680 6 1491
680 6 1491 680 6 1491 680 6 1491 691
6 1491 763 6 1491 763 6 1491 763 6
1491 763 6 1491 773 6 1491 799 6 1491
799 6 1491 799 6 1491 
# 1492
serrev algorithm 273 c1 cacm januari 1966 thacher jr h
c ca660103a jb march 3 1978 4 23 pm 1492
5 1492 1492 5 1492 1492 5 1492 
# 1493
gener of hilbert deriv test matrix algorithm 274 f1 cacm
januari 1966 boothroyd j ca660103b jb march 23 1978 7
32 pm 1493 5 1493 1493 5 1493 1493 5
1493 
# 1494
complet ellipt integr of the second kind algorithm 56 s21
cacm januari 1966 larssen g m ca660103c jb march 23
1978 7 33 pm 1494 4 1494 1494 5 1494
1494 5 1494 1494 5 1494 1495 5 1494 1494
6 1494 
# 1495
solut of transcendent equat by seri revers an algorithm is
develop for express the solut y of the equat f
y g x as a power seri in x x0
when f and g ar given as power seri and
the root y0 is known at y x0 the algorithm
is illustr for the equat y y x i e
1 y ln 1 y ln 1 x cacm januari
1966 thacher jr h c ca660102 jb march 3 1978
4 27 pm 1495 4 1495 1494 5 1495 1495
5 1495 1495 5 1495 1495 5 1495 1495 6
1495 
# 1496
a formal semant for comput languag and it applic in
a compil compil a semant meta languag ha been develop
for repres the mean of statement in a larg class
of comput languag thi meta languag ha been the basi
for construct of an effici function compil compil an inform
discuss of the meta languag base on the exampl of
a complet translat for a small languag is present cacm
januari 1966 feldman j a ca660101 jb march 3 1978
4 31 pm 1046 4 1496 1086 4 1496 1105
4 1496 1139 4 1496 1140 4 1496 1234 4
1496 1263 4 1496 1265 4 1496 1496 4 1496
1496 4 1496 1496 4 1496 1683 4 1496 1768
4 1496 1781 4 1496 1787 4 1496 1824 4
1496 1945 4 1496 2061 4 1496 2126 4 1496
2546 4 1496 464 4 1496 584 4 1496 631
4 1496 653 4 1496 680 4 1496 763 4
1496 795 4 1496 799 4 1496 945 4 1496
1137 5 1496 1141 5 1496 1396 5 1496 1496
5 1496 1496 5 1496 1496 5 1496 1767 5
1496 1781 5 1496 1787 5 1496 1860 5 1496
1945 5 1496 1988 5 1496 2252 5 1496 404
5 1496 823 6 1496 123 6 1496 196 6
1496 196 6 1496 196 6 1496 914 6 1496
915 6 1496 917 6 1496 919 6 1496 964
6 1496 984 6 1496 989 6 1496 990 6
1496 990 6 1496 1007 6 1496 1012 6 1496
1028 6 1496 1029 6 1496 1046 6 1496 1083
6 1496 1084 6 1496 1098 6 1496 1122 6
1496 1131 6 1496 1132 6 1496 1138 6 1496
1139 6 1496 1139 6 1496 1140 6 1496 1141
6 1496 1141 6 1496 1149 6 1496 1198 6
1496 1200 6 1496 1214 6 1496 1215 6 1496
1215 6 1496 1223 6 1496 1223 6 1496 1265
6 1496 1265 6 1496 1278 6 1496 1303 6
1496 1323 6 1496 1334 6 1496 1336 6 1496
1358 6 1496 1358 6 1496 1365 6 1496 1366
6 1496 1366 6 1496 1386 6 1496 1387 6
1496 1388 6 1496 1389 6 1496 1392 6 1496
1393 6 1496 1394 6 1496 1395 6 1496 1396
6 1496 1396 6 1496 1397 6 1496 1421 6
1496 1421 6 1496 1455 6 1496 1460 6 1496
1462 6 1496 1463 6 1496 1467 6 1496 1467
6 1496 1468 6 1496 1468 6 1496 1477 6
1496 1477 6 1496 1487 6 1496 1491 6 1496
1491 6 1496 1491 6 1496 1496 6 1496 1496
6 1496 1496 6 1496 1496 6 1496 1496 6
1496 1496 6 1496 1496 6 1496 1496 6 1496
1531 6 1496 1535 6 1496 1565 6 1496 1601
6 1496 1602 6 1496 1613 6 1496 1614 6
1496 1626 6 1496 1626 6 1496 1641 6 1496
1641 6 1496 1781 6 1496 1785 6 1496 1786
6 1496 1787 6 1496 1788 6 1496 205 6
1496 224 6 1496 224 6 1496 249 6 1496
284 6 1496 288 6 1496 316 6 1496 378
6 1496 381 6 1496 381 6 1496 398 6
1496 11 6 1496 11 6 1496 14 6 1496
2155 6 1496 404 6 1496 407 6 1496 410
6 1496 463 6 1496 464 6 1496 483 6
1496 483 6 1496 3184 6 1496 3184 6 1496
3184 6 1496 3188 6 1496 3199 6 1496 3200
6 1496 3201 6 1496 3202 6 1496 3203 6
1496 3204 6 1496 561 6 1496 584 6 1496
584 6 1496 600 6 1496 669 6 1496 680
6 1496 680 6 1496 691 6 1496 730 6
1496 763 6 1496 763 6 1496 763 6 1496
799 6 1496 799 6 1496 
# 1497
on the normal requir of divisor in divid and correct
method thi paper present an analysi on the normal requir
of the divisor in a divid and correct method thi
analysi is made subject to the condit that not more
than on correct is requir to obtain the true quotient
charact from the trial estim got from the divis of
a two precis segment of everi partial remaind by a
suitabl round singl precis divisor thi segment divis is denot
here as a 2 1 precis basic divis it is
found that the normal requir could be narrow down to
a smaller rang of divisor provid the magnitud of the
charact next to the lead charact of the divisor is
known if howev the normal is to be elimin on
ha to choos proper higher precis segment of operand for
the basic divis also consid is the possibl of elimin
the normal by an increas on the number of correct
on the quotient estim got from a 2 1 precis
basic divis it is shown that such a scheme is
econom onli for small radic cacm decemb 1967 krishnamurthi e
v nandi s k ca671210 jb februari 26 1978 2
15 pm 1026 4 1497 1258 4 1497 1258 4
1497 1292 4 1497 1292 4 1497 1497 4 1497
1497 4 1497 1497 4 1497 1497 4 1497 1593
4 1497 1975 4 1497 1975 4 1497 2605 4
1497 107 5 1497 1026 5 1497 1292 5 1497
1497 5 1497 1497 5 1497 1497 5 1497 1593
5 1497 1975 5 1497 1026 6 1497 1292 6
1497 1497 6 1497 
# 1498
the alcor illinoi 7090 7094 post mortem dump a dump
techniqu for program written in algol 60 is describ thi
techniqu provid an intellig analysi of an unsuccess comput process
in term of the origin sourc program cacm decemb 1967
bayer r gri d paul m wiehl h r ca671209
jb februari 26 1978 2 18 pm 1086 4 1498
1132 4 1498 1234 4 1498 1263 4 1498 1265
4 1498 1270 4 1498 1323 4 1498 1358 4
1498 1379 4 1498 1380 4 1498 1453 4 1498
1464 4 1498 1484 4 1498 1491 4 1498 1498
4 1498 1498 4 1498 1613 4 1498 1614 4
1498 1781 4 1498 1781 4 1498 1787 4 1498
1825 4 1498 1860 4 1498 2083 4 1498 2178
4 1498 2179 4 1498 2252 4 1498 2325 4
1498 2341 4 1498 2546 4 1498 2645 4 1498
2652 4 1498 2684 4 1498 2842 4 1498 2929
4 1498 2934 4 1498 3069 4 1498 669 4
1498 679 4 1498 691 4 1498 761 4 1498
949 4 1498 989 4 1498 1215 5 1498 1498
5 1498 1498 5 1498 1498 5 1498 3184 5
1498 
# 1499
chebyschev curv fit revis algorithm 318 e2 cacm decemb 1967
boothroyd j ca671208a jb februari 26 1978 2 20 pm
1499 5 1499 1499 5 1499 1499 5 1499 
# 1500
chebyschev curv fit algorithm 91 e2 cacm decemb 1967 boothroyd
j ca671208b jb march 23 1978 2 11 pm 1500
5 1500 1500 5 1500 1500 5 1500 
# 1501
eigenvector of a 2n x 2n matrix it ha been
known that the eigenvalu of a certain 2n x 2n
matrix can be obtain by us of two smaller matric
of order n which can be easili construct an algorithm
is given to obtain the eigenvector of the 2n x
2n matrix by us of the eigenvector of the smaller
matric cacm decemb 1967 charmonman s ca671207 jb februari 26
1978 2 22 pm 1501 5 1501 1501 5 1501
1501 5 1501 
# 1502
an onlin editor an onlin interact system for test edit
is describ in detail with remark on the theoret and
experiment justif for it form emphasi throughout the system is
on provid maximum conveni and power for the user notabl
featur ar it abil to handl ani piec of text
the content search facil and the charact by charact edit
oper the editor can be program to a limit extent
cacm decemb 1967 deutsch l p lampson b w ca671206
jb februari 26 1978 2 25 pm 1502 5 1502
1502 5 1502 1502 5 1502 2299 5 1502 2501
5 1502 2629 5 1502 2915 5 1502 3114 5
1502 1502 6 1502 1502 6 1502 1502 6 1502
1502 6 1502 1502 6 1502 1641 6 1502 1751
6 1502 1900 6 1502 2380 6 1502 2499 6
1502 2745 6 1502 
# 1503
a simscript fortran case studi two program for a vehicl
dispatch model on written in 7040 simscript and the other
in 7040 fortran iv ar compar the comparison is made
in term of basic program design decis storag requir comput
time us and the eas of make chang in the
simscript program the primari design consider center around the choic
of model variabl model chang event and model test in
the fortran program basic design problem relat to the represent
of the passag of time the alloc of storag and
the organ of input data the comparison of these differ
design program show that the simscript program us more comput
storag and more comput time but requir fewer program chang
to introduc model revis cacm decemb 1967 weinert a e
ca671205 jb februari 26 1978 2 30 pm 1503 4
1503 1781 4 1503 1860 4 1503 2091 4 1503
1366 5 1503 1503 5 1503 1503 5 1503 1503
5 1503 
# 1504
algorithm for find a fundament set of cycl for an
undirect linear graph given the adjac matrix of the graph
the algorithm present in thi paper find a span tree
and then construct the set of fundament cycl our algorithm
is slower than an algorithm present by welch by a
ratio of n 3 n is the number of node
but requir less storag for graph with a larg number
of node and edg when storag is limit our algorithm
is superior to welch s howev when the graph ar
small or machin storag is veri larg welch s algorithm
is superior time estim and storag requir for both method
ar present cacm decemb 1967 gotlieb c c corneil d
g ca671204 jb februari 26 19782 35 pm 1504 4
1504 3040 4 1504 1145 5 1504 1504 5 1504
1504 5 1504 1504 5 1504 1847 5 1504 1961
5 1504 2052 5 1504 1008 6 1504 1013 6
1504 1369 6 1504 1504 6 1504 1504 6 1504
1504 6 1504 1540 6 1504 1847 6 1504 
# 1505
a system organ for resourc alloc thi paper introduc a
system for resourc manag us the concept of process facil
and event except for the processor no attempt ha been
made to give seriou suggest for the polici to be
follow for resourc alloc howev a basic framework is provid
in which a system analyst can express solut to resourc
manag problem the paper is divid into a tutori present
a descript of the system primit and a small collect
of exampl of the us of the primit cacm decemb
1967 dahm d m gerbstadt f h pacelli m m
ca671203 jb februari 26 1978 2 40 pm 1505 5
1505 1505 5 1505 1505 5 1505 
# 1506
the laconiq monitor time share for onlin dialogu the laconiq
laboratori comput onlin inquiri monitor wa develop primarili to support
non numer applic such as retriev from veri larg file
by mean of a dialogu between a system user and
a retriev applic the monitor wa design so that it
could work with a small comput an ibm system 360
30 therefor techniqu for resourc alloc were import for thi
reason the us of core storag comput facil and input
output were all schedul an unusu featur of the system
is that it is event driven rather than clock driven
the program segment call into execut by the remot crt
consol ar invari run to complet rather than roll out
to be brought back at a later time cacm decemb
1967 drew d l ca671202 jb februari 26 1978 2
45 pm 1506 5 1506 1506 5 1506 1506 5
1506 
# 1507
a multiprogram environ for onlin data acqui ition and analysi
an experiment system for acqui ition and analysi of larg
bodi of data deriv from scientif experi is describ it
architectur and implement is larg base on certain object and
characterist of a gener data analysi scheme earli applic have
been orient toward the investig of data obtain in biolog
research some of the problem encount by the chosen approach
ar discuss cacm decemb 1967 lockemann p c knutsen w
d ca671201 jb februari 26 1978 2 48 pm 1507
5 1507 1507 5 1507 1507 5 1507 1712 5
1507 1507 6 1507 
# 1508
magnet tape label for inform interchang propos usa standard cacm
novemb 1967 ca671109 jb februari 26 1978 2 49 pm
1508 5 1508 1508 5 1508 1508 5 1508 
# 1509
record magnet tape for inform interchang 200 cpi nrzi propos
usa standard cacm novemb 1967 ca671108 jb februari 26 1978
2 52 pm 1509 5 1509 1509 5 1509 1509
5 1509 
# 1510
find a solut of n function equat in n unknown
algorithm 314 c5 cacm novemb 1967 dullei d pittewai l
v ca671107a jb februari 26 1978 2 54 pm 1510
5 1510 1510 5 1510 1510 5 1510 
# 1511
the damp taylor s seri method for minim a sum
of squar and for solv system of nonlinear equat cacm
novemb 1967 spath h ca671107b jb march 23 1978 2
17 pm 1511 5 1511 1511 5 1511 1511 5
1511 1820 5 1511 1511 6 1511 
# 1512
solut of simultan non linear equat algorithm 316 c5 cacm
novemb 1967 brown k m ca671107c jb march 23 1978
2 19 pm 1512 5 1512 1512 5 1512 1512
5 1512 
# 1513
permut algorithm 317 g6 cacm novemb 1967 robinson c l
ca671107d jb march 23 1978 2 21 pm 1513 5
1513 1513 5 1513 1513 5 1513 
# 1514
on the expect gain from adjust ing match term retriev
system a file adjust procedur base on maxim the bay
expect gain propos for match term retriev system the expect
gain and it probabl distribut ar deriv as a function
of 1 the prior proport of omit term and 2
the coeffici of separ between two distribut correspond to valu
of an adjust statist an exampl evalu the gain paramet
for a typic inform retriev system cacm novemb 1967 shumwai
r h ca671106 jb februari 26 1978 2 59 pm
1514 5 1514 1514 5 1514 1514 5 1514 
# 1515
a comput system for infer execut and data retriev thi
paper present a rand project concern with the us of
comput as assist in the logic analysi of larg collect
of factual data a system call relat data file wa
develop for thi purpos the relat data file is briefli
detail and problem aris from it implement ar discuss cacm
novemb 1967 levien r e ca671105 jb februari 26 1978
3 02 pm 1155 4 1515 1456 4 1515 1468
4 1515 1515 4 1515 1515 4 1515 1699 4
1515 1856 4 1515 2096 4 1515 2127 4 1515
2127 4 1515 2210 4 1515 1155 5 1515 1324
5 1515 1515 5 1515 1515 5 1515 1515 5
1515 2046 5 1515 2710 5 1515 1515 6 1515
1515 6 1515 2046 6 1515 2715 6 1515 616
6 1515 
# 1516
automat data compress the inform explos note in recent year
make it essenti that storag requir for all inform be
kept to a minimum a fulli automat and rapid three
part compressor which can be us with ani bodi of
inform to greatli reduc slow extern storag requir and to
increas the rate of inform transmiss through a comput is
describ in thi paper the system will also automat decod
the compress inform on an item by item basi when
it is requir the three compon compressor which can be
us separ to accomplish their specif task ar discuss nupak
for the automat compress of numer data anpak for the
automat compress of ani inform and iopak for further compress
of inform to be store on tape or card cacm
novemb 1967 marron b a demain p a d ca671104
jb februari 26 1978 3 08 pm 1516 5 1516
1516 5 1516 1516 5 1516 
# 1517
method for analyz data from comput simul experi thi paper
address itself to the problem of analyz data gener by
comput simul of econom system we first turn to a
hypothet firm whose oper is repres by singl channel multist
queue model the firm seek to maxim total expect profit
for the come period by select on of five oper
plan where each plan incorpor a certain market strategi an
alloc of product input and a total cost the result
of the simul activ under each plan ar subject to
an f test two multipl comparison method and a multipl
rank method we illustr compar and evalu these techniqu the
paper adopt the posit that the particular techniqu of analysi
possibl not ani on of the abov chosen by the
experiment should be an express of hi experiment object the
f test test the homogen of the plan multipl comparison
method quantifi their differ and multipl rank method directli identifi
the on best plan or best plan cacm novemb 1967
naylor t h wertz k wonnacott t h ca671103 jb
februari 26 1978 3 15 pm 1517 4 1517 1435
5 1517 1517 5 1517 1517 5 1517 1517 5
1517 
# 1518
an experiment model of system 360 the problem of predict
the perform of modern comput system is formid on gener
techniqu which can eas thi problem is macroscop simul thi
paper report on the applic of that techniqu to system
360 the paper describ an experiment model of system 360
it hardwar softwar and it environ the measur of system
perform produc by the model consist of statist relat to
turnaround time throughput hardwar util softwar util and queue process
the model is mechan in simscript and consist of some
1750 statement an auxiliari program the job gener creat automat
the properti of system 360 job that get simul cacm
novemb 1967 katz j h ca671102 jb februari 26 1978
3 20 pm 1518 5 1518 1518 5 1518 1518
5 1518 1805 5 1518 1912 5 1518 1518 6
1518 1518 6 1518 1572 6 1518 1748 6 1518
# 1519
georg 3 a gener purpos time share and oper system
an oper system is describ which will run on a
wide varieti of configur of the i 1900 and can
handl a larg number of onlin consol user while at
the same time run sever off line background job the
system is not orient toward either mode and can be
either a batch process system such as the atla supervisor
ibsi or geco or a multiaccess system resembl to the
user ctss or multic or both simultan depend on the
instal which can adjust the schedul both onlin user and
off line job us a common command languag the system
includ a multilevel devic independ file store cacm novemb 1967
oestreich m d bailei m j strauss j i ca671101
jb februari 27 1978 1 47 pm 1519 5 1519
1519 5 1519 1519 5 1519 
# 1520
absolut valu and squar root of a complex number algorithm
312 a2 cacm octob 1967 friedland p ca671012a jb februari
27 1978 1 49 pm 1520 5 1520 1520 5
1520 1520 5 1520 
# 1521
multi dimension partit gener algorithm 313 a1 cacm octob 1967
bratlei p mckai j k s ca671012b jb march 23
1978 2 26 pm 1521 5 1521 1521 5 1521
1521 5 1521 2354 5 1521 2355 5 1521 1418
6 1521 1418 6 1521 1521 6 1521 1521 6
1521 1597 6 1521 1597 6 1521 1679 6 1521
1883 6 1521 2040 6 1521 2350 6 1521 2350
6 1521 2354 6 1521 2355 6 1521 
# 1522
chebyschev quadratur algorithm 279 d1 cacm octob 1967 hillstrom k
ca671012c jb march 23 1978 2 31 pm 1522 5
1522 1522 5 1522 1522 5 1522 
# 1523
sharer a time share system for the cdc 6600 a
time share system embed within the standard batch process system
for the cdc 6600 is describ the system is gener
purpos and file base provid facil for file input manipul
edit compil and convers execut it us a simpl scheme
for system extens for a machin with onli on reloc
and memori bound regist no attempt wa made to us
reentrant code or to simul segment or page implement time
wa approxim six man year with the major of the
code be written in fortran cacm octob 1967 harrison m
c schwartz j t ca671011 jb februari 27 1978 1
53 pm 1458 4 1523 1523 4 1523 1603 4
1523 1698 4 1523 1747 4 1523 1748 4 1523
1854 4 1523 1877 4 1523 1960 4 1523 2377
4 1523 2378 4 1523 2497 4 1523 2558 4
1523 2625 4 1523 2632 4 1523 2840 4 1523
2941 4 1523 3105 4 1523 3144 4 1523 1471
5 1523 1523 5 1523 1523 5 1523 1523 5
1523 1657 5 1523 2080 5 1523 2357 5 1523
2536 5 1523 1523 6 1523 1523 6 1523 1523
6 1523 1523 6 1523 1829 6 1523 2035 6
1523 
# 1524
a stop criterion for polynomi root find when search for
the root of a polynomi it is gener difficult to
know just when to accept a number as an adequ
approxim to the root in thi paper an algorithm is
present which allow on to termin the iter process on
the basi of calcul bound for the roundoff error which
occur in evalu the polynomi thi stop criterion ha been
test on numer exampl and ha been found to serv
as a satisfactori mean for accept a complex number as
a zero of a real polynomi cacm octob 1967 adam
d a ca671009 jb februari 27 1978 1 56 pm
1524 4 1524 1524 4 1524 1524 4 1524 1931
4 1524 2214 4 1524 2544 4 1524 1197 5
1524 1524 5 1524 1524 5 1524 1524 5 1524
311 5 1524 2544 5 1524 879 5 1524 1524
6 1524 311 6 1524 2214 6 1524 
# 1525
on comput the fast fourier transform coolei and tukei have
propos a fast algorithm for comput complex fourier transform and
have shown major time save in us it to comput
larg transform on a digit comput with n a power
of two comput time for thi algorithm is proport to
n log2 n a major improv over other method with
comput time proport to n 2 in thi paper the
fast fourier transform algorithm is briefli review and fast differ
equat method for accur comput the need trigonometr function valu
ar given the problem of comput a larg fourier transform
on a system with virtual memori is consid and a
solut is propos thi method ha been us to comput
complex fourier transform of size n 2 16 on a
comput with 2 15 word of core storag thi exce
by a factor of eight the maximum radix two transform
size with fix alloc of thi amount of core storag
the method ha also been us to comput larg mix
radix transform a scale plan for comput the fast fourier
transform with fix point arithmet is also given cacm octob
1967 singleton r c ca671008 jb februari 27 1978 2
03 pm 1525 5 1525 1525 5 1525 1525 5
1525 1668 5 1525 1669 5 1525 1679 5 1525
1728 5 1525 2859 5 1525 1525 6 1525 1525
6 1525 1525 6 1525 1525 6 1525 1525 6
1525 1647 6 1525 1669 6 1525 1676 6 1525
1785 6 1525 
# 1526
multiprogram under a page on demand strategi a model of
multiprogram for a particular comput system us a page on
demand strategi is develop analysi of thi model is us
to predict perform measur by the averag usag of the
cpu when user program ar typic of those aris from
an interact time share environ the effect of sever hardwar
modif is also analyz a paramet readili calcul from the
hardwar characterist and the program statist is propos for gaug
the effect of multiprogram cacm octob 1967 smith j l
ca671007 jb februari 27 1978 2 07 pm 1526 5
1526 1526 5 1526 1526 5 1526 1892 5 1526
2068 5 1526 2741 5 1526 1526 6 1526 1526
6 1526 1526 6 1526 1572 6 1526 1728 6
1526 1749 6 1526 1751 6 1526 1752 6 1526
2454 6 1526 
# 1527
a grammar base question answer procedur the subject of thi
paper is a procedur for the automat retriev of certain
segment of store inform either explicitli or implicitli repres through
question pose in natur languag sentenc thi procedur make us
of a sentenc recognit devic for the class of grammar
which will correctli decid between the grammat and ungrammat sentenc
of a natur languag it is possibl to make us
of a recognit devic of thi sort for the follow
reason much data is fulli express as a set of
sentenc in a natur languag a set which can be
exhaust and exclus gener by a grammar base upon the
rule of thi grammar a sentenc recogn will evalu sentenc
question in the normal situat sinc the recognit function succe
just in case the pose question is drawn from the
set of sentenc express the data or more correctli is
grammat in term of the grammar for thi set of
sentenc sentenc recognit itself is a procedur for retriev inform
when the recognit function succe it valu repres the request
inform cacm octob 1967 rosenbaum p ca671006 jb februari 27
1978 2 14 pm 1527 5 1527 1527 5 1527
1527 5 1527 2092 5 1527 2127 5 1527 1155
6 1527 1324 6 1527 1487 6 1527 1527 6
1527 1527 6 1527 1781 6 1527 1856 6 1527
# 1528
three font of comput drawn letter detail descript ar given
for three font of letter letter shape ar entir describ
by number the basic vector ar in a gener form
so the font mai be easili drawn on a varieti
of comput and cathod rai tube the font includ both
upper and lower case roman letter mathemat sign and upper
and lower case greek letter design of the font is
describ howev the princip contribut of thi paper concern the
font themselv cacm octob 1967 mathew m v lochbaum c
moss j a ca671005 jb februari 27 1978 2 24
pm 1528 5 1528 1528 5 1528 1528 5 1528
1697 5 1528 1528 6 1528 
# 1529
decomposit program an analysi of matrix substructur a petroleum blend
problem wa analyz in order to compar the primal and
primal dual decomposit algorithm in the cours of the analysi
a substructur wa discov which ha relev to the rel
perform of the two algorithm and to their absolut perform
as compar with a standard primal simplex solut without decomposit
cacm octob 1967 bell e j ca671004 jb februari 27
1978 2 33 pm 1529 5 1529 1529 5 1529
1529 5 1529 
# 1530
the ml i macro processor a gener purpos macro processor
call ml i is describ ml i ha been implement
on the pdp 7 and i atla 2 comput and
is intend as a tool to allow user to extend
ani exist program languag by incorpor new statement and other
syntact form of their own choos and in their own
notat thi allow a complet user orient languag to be
built up with rel eas cacm octob 1967 brown p
j ca671003 jb februari 27 1978 2 38 pm 1530
4 1530 1530 4 1530 1531 4 1530 1565 4
1530 1703 4 1530 1781 4 1530 1852 4 1530
1945 4 1530 2034 4 1530 2036 4 1530 1455
5 1530 1530 5 1530 1530 5 1530 1530 5
1530 1565 5 1530 
# 1531
the remain troubl spot in algol 60 thi paper list
the ambigu remain in the languag algol 60 which have
been notic sinc the public of the revis algol 60
report in 1963 cacm octob 1967 knuth d e ca671002
jb februari 27 1978 2 40 pm 1530 4 1531
1531 4 1531 1531 4 1531 1565 4 1531 1703
4 1531 1945 4 1531 2036 4 1531 2707 4
1531 2753 4 1531 1185 5 1531 1455 5 1531
1531 5 1531 1531 5 1531 1531 5 1531 1781
5 1531 123 6 1531 196 6 1531 919 6
1531 990 6 1531 1007 6 1531 1046 6 1531
1131 6 1531 1139 6 1531 1140 6 1531 1149
6 1531 1198 6 1531 1215 6 1531 1223 6
1531 1265 6 1531 1303 6 1531 1323 6 1531
1358 6 1531 1366 6 1531 1421 6 1531 1460
6 1531 1462 6 1531 1463 6 1531 1467 6
1531 1468 6 1531 1477 6 1531 1491 6 1531
1496 6 1531 1531 6 1531 1535 6 1531 1565
6 1531 1601 6 1531 1602 6 1531 1613 6
1531 1614 6 1531 1626 6 1531 1641 6 1531
1787 6 1531 1788 6 1531 205 6 1531 224
6 1531 249 6 1531 288 6 1531 316 6
1531 381 6 1531 398 6 1531 11 6 1531
404 6 1531 410 6 1531 463 6 1531 464
6 1531 483 6 1531 3184 6 1531 3188 6
1531 584 6 1531 600 6 1531 680 6 1531
691 6 1531 763 6 1531 799 6 1531 
# 1532
the hardwar softwar complementar cacm octob 1967 oetting a g
ca671001 jb februari 27 1978 2 42 pm 1532 5
1532 1532 5 1532 1532 5 1532 
# 1533
a marovian model of the univers of michigan execut system
a mathemat model of a comput s execut system is
postul and it paramet estim with the aid of extens
data on the system s oper although simplifi assumpt ar
made the result predict by the model agre reason well
with actual result the model is us to studi the
effect of chang in the execut system and in on
of it compil further applic of the model ar discuss
cacm septemb 1967 folei j d ca670911 jb februari 27
1978 2 50 pm 1533 4 1533 1533 4 1533
1604 4 1533 1951 4 1533 2667 4 1533 2668
4 1533 1224 5 1533 1533 5 1533 1533 5
1533 1533 5 1533 1604 5 1533 1916 5 1533
1533 6 1533 666 6 1533 
# 1534
dad the c oper system the design and implement of
the c oper system dad is describ in detail thi
system is design for the control data 3600 us a
larg drum back store and is intend to allow the
integr of a remot consol displai subsystem into a convent
job stack environ the us of the drum the buffer
of input and output on slow peripher and the execut
of normal job stack work ar describ the displai subsystem
is describ onli as it integr into the rest of
the system the techniqu found us in the develop of
dad ar given and an assess is made of the
valid of variou design decis perform figur base on sever
month of oper ar tabul cacm septemb 1967 austin b
j holden t s hudson r h ca670910 jb februari
27 1978 2 58 pm 1534 5 1534 1534 5
1534 1534 5 1534 
# 1535
a comment on index regist alloc a techniqu is present
to reduc the enumer requir by a known procedur for
optim index regist alloc in straight line program thi techniqu
is base on the construct of a link diagram which
show at ani step the futur occurr of index which
must be load into index regist thi diagram determin in
advanc the requir regist configur at certain step of the
program so that the program is subdivid into separ portion
to which the alloc procedur mai be appli independ cacm
septemb 1967 luccio f ca670909 jb februari 27 1978 3
06 pm 1535 5 1535 1535 5 1535 1535 5
1535 1781 5 1535 2579 5 1535 123 6 1535
196 6 1535 919 6 1535 990 6 1535 1007
6 1535 1046 6 1535 1131 6 1535 1139 6
1535 1140 6 1535 1149 6 1535 1198 6 1535
1215 6 1535 1223 6 1535 1265 6 1535 1303
6 1535 1323 6 1535 1358 6 1535 1366 6
1535 1421 6 1535 1460 6 1535 1462 6 1535
1463 6 1535 1467 6 1535 1468 6 1535 1477
6 1535 1491 6 1535 1496 6 1535 1531 6
1535 1535 6 1535 1535 6 1535 1565 6 1535
1601 6 1535 1602 6 1535 1613 6 1535 1614
6 1535 1626 6 1535 1641 6 1535 1787 6
1535 1788 6 1535 1807 6 1535 205 6 1535
224 6 1535 249 6 1535 288 6 1535 1947
6 1535 316 6 1535 381 6 1535 398 6
1535 11 6 1535 404 6 1535 410 6 1535
463 6 1535 464 6 1535 483 6 1535 3184
6 1535 3188 6 1535 584 6 1535 600 6
1535 680 6 1535 691 6 1535 763 6 1535
799 6 1535 
# 1536
dynam comput of deriv it is shown how wengert s
procedur for comput of deriv can be implement conveni by
us of compil gener complex addit subtract and linkag to
complex arithmet subroutin evalu of a function and deriv proce
in parallel as in wengert s procedur but with the
imaginari part of variabl declar complex bear the valu of
the deriv of the real part thi techniqu provid a
simpl wai to comput the deriv of a function without
the need for deriv and program the evalu of explicit
formula for the deriv cacm septemb 1967 lesk a m
ca670908 jb februari 27 1978 3 11 pm 1028 4
1536 1216 4 1536 1278 4 1536 1347 4 1536
1396 4 1536 1536 4 1536 1029 5 1536 1536
5 1536 1536 5 1536 1536 5 1536 
# 1537
prime number gener 1 algorithm 310 a1 cacm septemb 1967
chartr b a ca670907a jb februari 27 1978 3 12
pm 1537 5 1537 1537 5 1537 1537 5 1537
2120 5 1537 2927 5 1537 1537 6 1537 1537
6 1537 1539 6 1537 1539 6 1537 1538 6
1537 1840 6 1537 1841 6 1537 377 6 1537
# 1538
prime number gener 2 algorithm 311 a1 cacm septemb 1967
chartr b a ca670907b jb march 23 1978 2 34
pm 1538 5 1538 1538 5 1538 1538 5 1538
2927 5 1538 1537 6 1538 1539 6 1538 1538
6 1538 1840 6 1538 1841 6 1538 
# 1539
prime number gener 1 prime number gener 2 algorithm 35
a1 algorithm 310 a1 algorithm 311 a1 cacm septemb 1967
chartr b a ca670907c jb march 23 1978 2 37
pm 1539 5 1539 1539 5 1539 1539 5 1539
1841 5 1539 1967 5 1539 2120 5 1539 2927
5 1539 1537 6 1539 1537 6 1539 1539 6
1539 1539 6 1539 1539 6 1539 1539 6 1539
1538 6 1539 1840 6 1539 1841 6 1539 1841
6 1539 377 6 1539 377 6 1539 2120 6
1539 
# 1540
an algorithm for class schedul with section prefer an algorithm
for assign of student to class in a fix time
schedul that allow student to give a prefer for section
within cours is given if consist with the object of
balanc section these prefer will be honor the algorithm is
more stochast than mont carlo in natur result ar given
that compar it to a nonprefer assign algorithm cacm septemb
1967 busam v a ca670906 jb februari 27 1978 3
15 pm 1540 4 1540 2209 4 1540 1434 5
1540 1540 5 1540 1540 5 1540 1540 5 1540
2052 5 1540 2209 5 1540 1008 6 1540 1013
6 1540 1434 6 1540 1504 6 1540 1540 6
1540 1540 6 1540 
# 1541
a languag for model and simul dynam system the gener
object of thi languag is to facilit both the model
and experiment aspect of simul studi the abil to repres
system contain highli interact process is an essenti featur the
natur of the languag and the role of the process
concept is present by mean of an extend exampl cacm
septemb 1967 parent r j krasnow h s ca670905 jb
februari 27 1978 3 18 pm 1541 4 1541 1541
4 1541 1565 4 1541 1781 4 1541 1824 4
1541 1846 4 1541 2060 4 1541 2218 4 1541
2252 4 1541 3112 4 1541 1358 5 1541 1380
5 1541 1541 5 1541 1541 5 1541 1541 5
1541 
# 1542
a microprogram implement of euler on ibm system 360 model
30 an experiment process system for the algorithm languag euler
ha been implement in microprogram on an ibm system 360
model 30 us a second read onli storag unit the
system consist of a microprogram compil and a microprogram string
languag interpret and of an i o control program written
in 360 machin languag the system is describ and result
ar given in term of microprogram and main storag space
requir and compil and interpret perform obtain the role of
microprogram is stress which open a new dimens in the
process of interpret code the structur and content of a
higher level languag can be match by an appropri interpret
languag which can be execut effici by microprogram on exist
comput hardwar cacm septemb 1967 weber h ca670904 jb februari
27 1978 3 44 pm 1542 4 1542 1542 4
1542 1683 4 1542 1693 4 1542 1781 4 1542
1787 4 1542 1836 4 1542 1945 4 1542 2060
4 1542 2061 4 1542 2082 4 1542 2091 4
1542 2152 4 1542 2179 4 1542 2340 4 1542
2356 4 1542 2546 4 1542 2603 4 1542 2698
4 1542 2708 4 1542 2824 4 1542 2982 4
1542 2986 4 1542 3045 4 1542 3093 4 1542
1491 5 1542 1542 5 1542 1542 5 1542 1542
5 1542 2202 5 1542 2527 5 1542 3198 5
1542 1542 6 1542 1542 6 1542 
# 1543
comput formul of the equat of motion us tensor notat
a mean is describ for extend the area of applic
of digit comput beyond the numer data process stage and
reduc the need for human particip in the formul of
certain type of comput problem by the us of tensor
calculu and a comput languag design to facilit symbol mathemat
comput a method ha been devis wherebi a digit comput
can be us to do non numer work that is
symbol algebra manipul and differenti to illustr the techniqu involv
a digit comput ha been us to deriv the equat
of motion of a point mass in a gener orthogon
curvilinear coordin system sinc thi oper involv a formul in
term of first and second order differenti coeffici it provid
a good demonstr of a comput s capabl to do
non numer work and to assist in the formul process
which normal preced the numer data process stage moreov thi
particular problem serv to illustr the advantag of the mathemat
techniqu emploi with the program prepar for thi purpos the
comput will deriv the equat of motion in ani coordin
system request by the user result ar present for the
follow coordin system cylindr polar spheric polar and prolat spheroid
cacm septemb 1967 howard j c ca670903 jb februari 27
1978 3 58 pm 1543 4 1543 1543 4 1543
1664 4 1543 1664 4 1543 1345 5 1543 1543
5 1543 1543 5 1543 1543 5 1543 1616 5
1543 1664 5 1543 1345 6 1543 1543 6 1543
1616 6 1543 
# 1544
tele cupl a telephon time share system a gener purpos
remot access comput system is describ that emploi twelv kei
keyboard telephon as termin audio output is provid directli to
the telephon termin but the system will normal be us
in conjunct with remot locat high speed print devic the
system is a compat extens of an exist batch process
system a signific element of the system is a scheme
for transmit alphanumer inform by singl stroke on a numer
keyboard the program scanner us context to elimin the ambigu
in transmiss cacm septemb 1967 conwai r w morgan h
l ca670902 jb februari 27 1978 4 04 pm 1179
4 1544 1288 4 1544 1544 4 1544 1646 4
1544 2111 4 1544 2534 4 1544 2556 4 1544
2650 4 1544 1544 5 1544 1544 5 1544 1544
5 1544 2054 5 1544 830 5 1544 1544 6
1544 
# 1545
legal safeguard to insur privaci in a comput societi cacm
septemb 1967 westin a f ca670901 jb februari 27 1978
4 06 pm 1545 5 1545 1545 5 1545 1545
5 1545 
# 1546
toward standard for handwritten zero and oh cacm august 1967
bemer r w ca670809 jb februari 27 1978 4 08
pm 1546 5 1546 1546 5 1546 1546 5 1546
# 1547
gamma function with arbitrari precis algorithm 309 s14 cacm august
1967 filho a m schwachheim g ca670808 jb februari 27
1978 4 10 pm 1547 5 1547 1547 5 1547
1547 5 1547 2224 5 1547 1547 6 1547 
# 1548
pars of decis tabl reduct in the size of decis
tabl can be accomplish by sever techniqu the techniqu consid
in thi paper ar on the pars of decis tabl
with regard to horizont and vertic data structur job ident
hardwar and job prioriti and context relationship such pars rest
upon some convent for the linkag of decis tabl cacm
august 1967 chapin n ca670807 jb februari 27 1978 4
14 pm 1548 4 1548 1548 4 1548 2220 4
1548 2726 4 1548 2726 4 1548 1488 5 1548
1489 5 1548 1548 5 1548 1548 5 1548 1548
5 1548 2220 5 1548 2492 5 1548 2518 5
1548 2598 5 1548 2616 5 1548 2726 5 1548
931 6 1548 1172 6 1548 1172 6 1548 1172
6 1548 1237 6 1548 1327 6 1548 1327 6
1548 1354 6 1548 1354 6 1548 1488 6 1548
1489 6 1548 1489 6 1548 1548 6 1548 1548
6 1548 1548 6 1548 1548 6 1548 1548 6
1548 1548 6 1548 1684 6 1548 1684 6 1548
250 6 1548 2220 6 1548 2220 6 1548 2221
6 1548 2263 6 1548 2263 6 1548 2453 6
1548 2517 6 1548 2691 6 1548 
# 1549
an effici machin independ procedur for garbag collect in variou
list structur a method for return regist to the free
list is an essenti part of ani list process system
in thi paper past solut of the recoveri problem ar
review and compar a new algorithm is present which offer
signific advantag of speed and storag util the routin for
implement thi algorithm can be written in the list languag
with which it is to be us thu insur a
degre of machin independ final the applic of the algorithm
to a number of differ list structur appear in the
literatur is indic cacm august 1967 schorr h wait w
m ca670806 jb februari 27 1978 4 28 pm 1024
4 1549 1024 4 1549 1050 4 1549 1050 4
1549 1051 4 1549 1051 4 1549 1051 4 1549
1098 4 1549 1102 4 1549 1102 4 1549 1132
4 1549 1211 4 1549 1214 4 1549 1237 4
1549 1380 4 1549 1388 4 1549 1390 4 1549
1393 4 1549 1393 4 1549 1485 4 1549 1486
4 1549 1487 4 1549 1549 4 1549 1549 4
1549 1549 4 1549 1549 4 1549 1549 4 1549
1549 4 1549 1549 4 1549 1564 4 1549 1570
4 1549 1706 4 1549 1826 4 1549 1878 4
1549 1878 4 1549 1906 4 1549 1946 4 1549
1957 4 1549 378 4 1549 2023 4 1549 2060
4 1549 2155 4 1549 2168 4 1549 2168 4
1549 2453 4 1549 2719 4 1549 2723 4 1549
2723 4 1549 2723 4 1549 2838 4 1549 2842
4 1549 2855 4 1549 2857 4 1549 2879 4
1549 2882 4 1549 2902 4 1549 3077 4 1549
3080 4 1549 3106 4 1549 3112 4 1549 3112
4 1549 627 4 1549 627 4 1549 731 4
1549 793 4 1549 106 4 1549 106 5 1549
1051 5 1549 210 5 1549 1549 5 1549 1549
5 1549 1549 5 1549 1869 5 1549 2513 5
1549 2665 5 1549 2723 5 1549 2855 5 1549
406 5 1549 3106 5 1549 627 5 1549 731
5 1549 753 5 1549 1383 6 1549 1549 6
1549 1549 6 1549 1549 6 1549 1549 6 1549
1549 6 1549 1549 6 1549 1570 6 1549 1749
6 1549 1826 6 1549 1826 6 1549 210 6
1549 210 6 1549 210 6 1549 1972 6 1549
1972 6 1549 1972 6 1549 2513 6 1549 2651
6 1549 2665 6 1549 2766 6 1549 2766 6
1549 2833 6 1549 2855 6 1549 2954 6 1549
2998 6 1549 2998 6 1549 627 6 1549 731
6 1549 
# 1550
a comparison of batch process and instant turnaround a studi
of the program effort of student in an introductori program
cours is present and the effect of have instant turnaround
a few minut as oppos to convent batch process with
turnaround time of a few hour ar examin among the
item compar ar the number of comput run per trip
to the comput center program prepar time keypunch time debug
time number of run and elaps time from the first
run to the last run on each problem even though
the result ar influenc by the fact that bonu point
were given for complet of a program problem in less
than a specifi number of run there is evid to
support instant over batch cacm august 1967 smith l b
ca670805 jb februari 27 1978 4 32 pm 1550 4
1550 1550 4 1550 1304 5 1550 1472 5 1550
1550 5 1550 1550 5 1550 1550 5 1550 1908
5 1550 1550 6 1550 1605 6 1550 
# 1551
on compil algorithm for arithmet express thi paper deal with
algorithm concern arithmet express us in a fortran iv compil
for a hitac 5020 comput have n accumul the algorithm
gener an object code which minim the frequenc of store
and recov the partial result of the arithmet express in
case where there ar sever accumul cacm august 1967 nakata
i ca670804 jb februari 27 1978 4 35 pm 1551
4 1551 1945 4 1551 1122 5 1551 1551 5
1551 1551 5 1551 1551 5 1551 1807 5 1551
1934 5 1551 2175 5 1551 1223 6 1551 1248
6 1551 1551 6 1551 1551 6 1551 1551 6
1551 1613 6 1551 1886 6 1551 1947 6 1551
# 1552
the a free storag packag the most fundament underli problem
in sophist softwar system involv elabor chang data structur is
dynam storag alloc for flexibl problem model the free storag
packag of the a 1 compil system allow block of
avail storag to be obtain and return for reus the
total avail space is partit into a hierarchi of free
storag zone each of which ha it own characterist block
mai be of ani size and special provis allow effici
handl of select size control of shatter and garbag collect
and share of physic space between zone the routin of
the packag perform high level function automat but also allow
access and control of fine intern detail as well cacm
august 1967 ross d t ca670803 jb februari 27 1978
4 40 pm 1051 4 1552 1380 4 1552 1389
4 1552 1552 4 1552 1552 4 1552 1552 4
1552 1665 4 1552 1693 4 1552 1781 4 1552
1854 4 1552 1860 4 1552 1860 4 1552 2060
4 1552 2155 4 1552 2162 4 1552 2435 4
1552 2596 4 1552 2768 4 1552 2845 4 1552
2902 4 1552 2955 4 1552 557 4 1552 1184
5 1552 1421 5 1552 1552 5 1552 1552 5
1552 1552 5 1552 378 5 1552 2704 5 1552
2902 5 1552 1051 6 1552 1062 6 1552 1184
6 1552 1211 6 1552 1247 6 1552 1552 6
1552 1552 6 1552 1749 6 1552 1879 6 1552
2356 6 1552 2379 6 1552 2435 6 1552 2596
6 1552 2673 6 1552 2734 6 1552 2747 6
1552 2768 6 1552 
# 1553
contextu understand by comput a further develop of a comput
program eliza capabl of convers in natur languag is discuss
the import of context to both human and machin understand
is stress it is argu that the adequaci of the
level of understand achiev in a particular convers depend on
the purpos of that convers and that absolut understand on
the part of either human or machin is imposs cacm
august 1967 weizenbaum j ca670802 jb februari 27 19784 44
pm 1400 4 1553 1553 4 1553 1945 4 1553
2127 4 1553 2396 4 1553 2730 4 1553 1487
5 1553 1553 5 1553 1553 5 1553 1553 5
1553 1856 5 1553 1225 6 1553 1324 6 1553
1553 6 1553 
# 1554
a comput techniqu for displai n dimension hyperobject a digit
comput and automat plotter have been us to gener three
dimension stereoscop movi of the three dimension parallel and perspect
project of four dimension hyperobject rotat in four dimension space
the observ project and their motion were a direct extens
of three dimension experi but no profound feel or insight
into the fourth spatial dimens wa obtain the techniqu can
be gener to n dimens and appli to ani n
dimension hyperobject or hypersurfac cacm august 1967 noll a m
ca670801 jb februari 27 1978 4 48 pm 1554 5
1554 1554 5 1554 1554 5 1554 2211 5 1554
1554 6 1554 1741 6 1554 
# 1555
symmetr polynomi algorithm 305 c1 cacm juli 1967 bratlei p
mckai j k s ca670711a jb februari 28 1978 8
26 am 1555 5 1555 1555 5 1555 1555 5
1555 
# 1556
permut with repetit algorithm 306 g6 cacm juli 1967 bratlei
p ca670711b jb march 23 1978 3 14 pm 1556
5 1556 1556 5 1556 1556 5 1556 
# 1557
symmetr group charact algorithm 307 a1 cacm juli 1967 mckai
j k s ca670711c jb march 23 1978 3 15
pm 1557 5 1557 1557 5 1557 1557 5 1557
# 1558
gener of permut in pseudo lexicograph order algorithm g6 cacm
juli 1967 ord smith r j ca670711d jb march 23
1978 3 16 pm 1558 5 1558 1558 5 1558
1558 5 1558 2044 5 1558 996 6 1558 1558
6 1558 2230 6 1558 521 6 1558 
# 1559
permut gener permut in lexicograph order permut gener of permut
in lexicograph order algorithm 87 g6 algorithm 102 g6 algorithm
130 g6 algorithm 202 g6 cacm juli 1967 ord smith
r j ca670711 jb march 23 1978 3 19 pm
1559 5 1559 1559 5 1559 1559 5 1559 1567
5 1559 1948 5 1559 1391 6 1559 1559 6
1559 1559 6 1559 
# 1560
transport transport problem algorithm 258 h algorithm 293 h cacm
juli 1967 sim l s ca670711f jb march 23 1978
3 20 pm 1560 5 1560 1560 5 1560 1560
5 1560 
# 1561
the mutual primal dual method algorithm 285 h cacm juli
1967 spath h ca670711g jb march 23 1978 3 21
pm 1561 5 1561 1561 5 1561 1561 5 1561
1987 5 1561 1561 6 1561 1581 6 1561 1779
6 1561 1944 6 1561 714 6 1561 
# 1562
airi function algorithm 301 s20 cacm juli 1967 pittewai m
l v ca670711h jb march 23 1978 3 22 pm
1562 5 1562 1562 5 1562 1562 5 1562 
# 1563
a method for find hamilton path and knight s tour
the us of warnsdorff s rule for find a knight
s tour is gener and appli to the problem of
find a hamilton path in a graph a graph theoret
justif for the method is given cacm juli 1967 pohl
i ca670710 jb februari 28 1978 8 28 am 1563
5 1563 1563 5 1563 1563 5 1563 
# 1564
descript of basic algorithm in detab 65 preprocessor the basic
algorithm for the convers of decis tabl into cobol code
is contain in the gener portion of the detab 65
preprocessor the gener analyz a decis tabl and produc simpl
cobol condit statement core storag is save by us queue
techniqu and extens index and also by output the code
as it is gener a line at a time the
onli optim attempt is the elimin of obvious unnecessari test
on certain condit in the decis tabl sinc the preprocessor
and thi languag associ with it were develop for cobol
user the preprocessor wa written in a modular form in
requir cobol 61 cacm juli 1967 callahan m d chapman
a e ca670709 jb februari 28 1978 8 33 am
1237 4 1564 1549 4 1564 1564 4 1564 2453
4 1564 1564 5 1564 1564 5 1564 1564 5
1564 1684 5 1564 753 5 1564 1354 6 1564
1564 6 1564 
# 1565
a languag independ macro processor a macro processor is describ
which can be us with almost ani sourc languag it
provid all featur normal associ with a macro facil plu
the abil to make arbitrari transform of the argument string
the program is us at the basser comput depart univers
of sydnei sydnei australia to process text for eight differ
compil cacm juli 1967 wait w m ca670708 jb februari
28 1978 8 35 am 1358 4 1565 1530 4
1565 1531 4 1565 1541 4 1565 1565 4 1565
1565 4 1565 1565 4 1565 1565 4 1565 1703
4 1565 1781 4 1565 1781 4 1565 1788 4
1565 1824 4 1565 1945 4 1565 2036 4 1565
2252 4 1565 1162 5 1565 205 5 1565 1358
5 1565 1455 5 1565 1530 5 1565 1565 5
1565 1565 5 1565 1565 5 1565 1781 5 1565
1852 5 1565 2034 5 1565 123 6 1565 196
6 1565 919 6 1565 984 6 1565 990 6
1565 1007 6 1565 1046 6 1565 1131 6 1565
1139 6 1565 1140 6 1565 1149 6 1565 1198
6 1565 1215 6 1565 1223 6 1565 1231 6
1565 1265 6 1565 1303 6 1565 1323 6 1565
1358 6 1565 1366 6 1565 1421 6 1565 1455
6 1565 1460 6 1565 1462 6 1565 1463 6
1565 1467 6 1565 1468 6 1565 1477 6 1565
1491 6 1565 1496 6 1565 1531 6 1565 1535
6 1565 1565 6 1565 1565 6 1565 1565 6
1565 1565 6 1565 1601 6 1565 1602 6 1565
1613 6 1565 1614 6 1565 1626 6 1565 1641
6 1565 1787 6 1565 1788 6 1565 205 6
1565 224 6 1565 1852 6 1565 249 6 1565
288 6 1565 1926 6 1565 1947 6 1565 316
6 1565 381 6 1565 398 6 1565 11 6
1565 404 6 1565 410 6 1565 463 6 1565
464 6 1565 483 6 1565 3184 6 1565 3188
6 1565 584 6 1565 600 6 1565 680 6
1565 691 6 1565 763 6 1565 799 6 1565
# 1566
optim start valu for newton raphson calcul of sqrt x
the problem of obtain start valu for the newton raphson
calcul of sqrt x on a digit comput is consid
it is shown that the convention us best uniform approxim
to sqrt x do not provid optim start valu the
problem of obtain optim start valu the problem of obtain
optim start valu is state and sever basic result ar
prove a tabl of optim polynomi start valu is given
cacm juli 1967 moursund d g ca670707 jb februari 28
1978 8 53 am 1566 4 1566 1440 5 1566
1566 5 1566 1566 5 1566 1566 5 1566 1932
5 1566 2094 5 1566 962 6 1566 1566 6
1566 1566 6 1566 
# 1567
on the represent of symmetr polynomi relat ar given between
certain symmetr polynomi in the light of the theori of
the symmetr group such an approach unifi earlier work and
lend insight to previous publish work by aaron booker a
gener of graeff s root squar techniqu for the determin
of the root of a polynomi is suggest cacm juli
1967 mckai j k s ca670706 jb februari 28 1978
8 56 am 1567 4 1567 1948 4 1567 1559
5 1567 1567 5 1567 1567 5 1567 1567 5
1567 
# 1568
plot a function of three independ variabl a method is
develop for construct an approxim plot of a function of
three independ variabl the plot is similar to a convent
contour map except that there ar three scale to repres
the independ variabl scale valu of the three independ variabl
ar ad vectori and the valu of the function is
then read from the valu associ with nearbi contour cacm
juli 1967 stineman r w ca670705 jb februari 28 1978
8 59 am 1568 5 1568 1568 5 1568 1568
5 1568 
# 1569
implement phrase structur product in pl i a method is
describ for implement the product of a context free phrase
structur grammar in a pl i procedur whose structur and
statement parallel the structur and notat of the grammar cacm
juli 1967 irwin l ca670704 jb februari 28 1978 9
01 am 1569 5 1569 1569 5 1569 1569 5
1569 
# 1570
string process techniqu the intern organ of string process system
is discuss six techniqu for data structur ar present and
evalu on the basi of 1 creation of string 2
examin of string and 3 alter of string speed of
oper storag requir effect on page and programm conveni ar
also consid on of the techniqu singl word link block
is us in an exampl demonstr an implement of a
snobol string process languag on an ibm system 360 cacm
juli 1967 madnick s e ca670703 jb februari 28 1978
9 04 am 1024 4 1570 1051 4 1570 1098
4 1570 1214 4 1570 1380 4 1570 1388 4
1570 1393 4 1570 1485 4 1570 1487 4 1570
1549 4 1570 1570 4 1570 1570 4 1570 1878
4 1570 1945 4 1570 1946 4 1570 1957 4
1570 2168 4 1570 2314 4 1570 2723 4 1570
2857 4 1570 3112 4 1570 1098 5 1570 1570
5 1570 1570 5 1570 1570 5 1570 1869 5
1570 731 5 1570 1549 6 1570 1570 6 1570
# 1571
a user orient time share onlin system an exist system
and plan addit within the data process laboratori of the
brain research institut at ucla is describ the system repres
an attempt to provid research worker of the institut with
the abil to interact directli with a highli sophist digit
comput complex in the most direct and simpl fashion possibl
it is anticip that with the accumul of experi us
the present system signific advanc will be possibl in the
system design through determin of interfac paramet between the biolog
scientist and the digit comput cacm juli 1967 betyar l
ca670702 jb februari 28 1978 9 08 am 1571 5
1571 1571 5 1571 1571 5 1571 
# 1572
the simul of time share system the develop of new
larg scale time share system ha rais a number of
problem for comput center manag not onli is it necessari
to develop an appropri hardwar configur for these system but
appropri softwar adjust must be made unfortun these system often
do not respond to chang in the manner that intuit
would suggest and there ar few guid to assist in
the analysi of perform characterist the develop of a comprehens
simul model to assist in the investig of these question
is describ in thi paper the result model ha a
gener purpos design and can be us to studi a
varieti of time share system it can also be us
to assist in the design and develop of new time
share algorithm or techniqu for the sake of effici and
greater applic the model wa implement in a limit fortran
subset that is compat with most fortran iv compil the
us of the simul is demonstr by a studi of
the ibm 360 67 time share system cacm juli 1967
nielsen n r ca670701 jb februari 28 1978 9 15
am 1572 5 1572 1572 5 1572 1572 5 1572
1805 5 1572 1846 5 1572 1892 5 1572 2188
5 1572 2218 5 1572 2317 5 1572 1198 6
1572 1380 6 1572 1380 6 1572 1424 6 1572
1484 6 1572 1518 6 1572 1526 6 1572 1572
6 1572 1572 6 1572 1572 6 1572 1572 6
1572 1572 6 1572 1572 6 1572 1693 6 1572
1728 6 1572 1728 6 1572 1748 6 1572 1749
6 1572 1751 6 1572 1751 6 1572 1753 6
1572 1752 6 1572 1752 6 1572 1781 6 1572
1810 6 1572 1879 6 1572 2095 6 1572 2126
6 1572 2148 6 1572 576 6 1572 
# 1573
an adapt quadratur procedur with random panel size algorithm d1
cacm june 1967 gallah l j ca670607a jb februari 28
1978 9 17 am 1573 5 1573 1573 5 1573
1573 5 1573 2093 5 1573 2550 5 1573 834
6 1573 872 6 1573 1092 6 1573 1298 6
1573 1573 6 1573 1573 6 1573 2074 6 1573
429 6 1573 429 6 1573 
# 1574
normal curv integr algorithm 304 s15 cacm june 1967 hill
i d joyc s a ca670607b jb march 23 1978
3 27 pm 1574 5 1574 1574 5 1574 1574
5 1574 
# 1575
incomplet beta ratio algorithm 179 s14 cacm june 1967 pike
m c hill i d ca670607c jb march 23 1978
3 29 pm 1575 5 1575 1575 5 1575 1575
5 1575 
# 1576
eigenvalu of a real symmetr matrix by the qr method
algorithm 253 f2 cacm june 1967 welsch j h ca670607d
jb march 23 1978 3 30 pm 1576 5 1576
1576 5 1576 1576 5 1576 
# 1577
eigenvalu and eigenvector of a real symmetr matrix by the
qr method algorithm 254 f2 cacm june 1967 welsch j
h ca670607 jb march 23 1978 3 31 pm 1577
5 1577 1577 5 1577 1577 5 1577 
# 1578
gener least squar fit by orthogon polynomi algorithm 296 e2
cacm june 1967 makinson g j ca670607f jb march 23
1978 3 33 pm 1578 5 1578 1578 5 1578
1578 5 1578 
# 1579
real error function erf x algorithm 123 s15 cacm june
1967 hill i d joyc s a ca670607g jb march
23 1978 3 34 pm 1579 5 1579 1579 5
1579 1579 5 1579 
# 1580
error function larg x algorithm 180 s15 cacm june 1967
hill i d joyc s a ca670607h jb march 23
1978 3 35 pm 1580 5 1580 1580 5 1580
1580 5 1580 2334 5 1580 1580 6 1580 
# 1581
complementari error function larg x algorithm 181 s15 cacm june
1967 hill i d joyc s a ca670607i jb march
23 1978 3 37 pm 1581 5 1581 1581 5
1581 1581 5 1581 1987 5 1581 2427 5 1581
1561 6 1581 1581 6 1581 1581 6 1581 1636
6 1581 1779 6 1581 1944 6 1581 714 6
1581 
# 1582
gauss algorithm 209 s15 cacm june 1967 hill i d
joyc s a ca670607j jb march 23 1978 3 38
pm 1582 5 1582 1582 5 1582 1582 5 1582
# 1583
normal distribut function algorithm 226 s15 cacm june 1967 hill
i d joyc s a ca670607k jb march 23 1978
3 39 pm 1583 4 1583 1583 4 1583 1583
4 1583 1583 4 1583 967 5 1583 1126 5
1583 1583 5 1583 1583 5 1583 1583 5 1583
707 5 1583 831 5 1583 
# 1584
procedur for the normal distribut function algorithm 272 s15 cacm
june 1967 hill i d joyc s a ca670607l jb
march 23 1978 3 40 pm 1584 5 1584 1584
5 1584 1584 5 1584 
# 1585
normal curv integr algorithm 304 s15 cacm june 1967 hill
i d joyc s a ca670607m jb march 23 1978
3 41 pm 1585 5 1585 1585 5 1585 1585
5 1585 1714 5 1585 1585 6 1585 
# 1586
a gener bairstow algorithm the bairstow algorithm is gener to
the case of a polynomi which is itself a linear
combin of polynomi satisfi a three term recurs converg properti
of the method ar deriv cacm june 1967 golub g
h robertson t n ca670606 jb februari 28 1978 9
21 am 1586 5 1586 1586 5 1586 1586 5
1586 
# 1587
storag alloc in a certain iter process a method of
core storag alloc in a certain iter process is describ
and estim of the machin time requir ar given the
method is applic to iter process in which input data
item onc chosen ar never again need in thi method
the input data is continu reloc and the space made
avail apport to the output tabl when an overflow occur
some import special case ar consid in which consider simplif
occur cacm june 1967 abramowich j ca670605 jb februari 28
1978 9 25 am 1587 5 1587 1587 5 1587
1587 5 1587 
# 1588
pl i list process the concept of list process have
been introduc into the pl i languag with these new
facil it is possibl to write pl i procedur that
oper on simpl and complex data list organ most list
process languag have suffer from their inabl to deal directli
with complex data structur and or from their inabl to
perform the complet rang of program languag oper upon the
data list structur these two problem have been elimin in
the list process facil of pl i the basic concept
of list process and the philosophi of the pl i
languag extens ar discuss in addit sever detail list process
exampl ar provid cacm june 1967 lawson jr h w
ca670604 jb februari 28 1978 9 30 am 1588 5
1588 1588 5 1588 1588 5 1588 
# 1589
dialog a convers program system with a graphic orient dialog
is an algebra languag for onlin us with a graphic
input output consol devic it is a comput aid for
the casual user which provid basic facil for graphic and
numer input and displai onlin and off line program prepar
and storag and hard copi present of result us of
the system requir a minimum of experi or instruct sinc
the growth of an overlai system control languag ha been
prevent and there ar no processor orient statement like variabl
type or dimens declar moreov in the onlin situat the
processor interact with the graphic keyboard on a charact by
charact basi so as to restrict the programm s choic
of input symbol to those which ar syntact correct dialog
ha been in daili oper at the iit research institut
sinc februari 1966 cacm june 1967 cameron s h ew
d liveright m ca670603 jb februari 28 1978 9 36
am 1589 5 1589 1589 5 1589 1589 5 1589
1978 5 1589 1307 6 1589 1589 6 1589 1813
6 1589 
# 1590
pitch period determin of speech sound a comput procedur which
determin pitch period by the recognit of the peak structur
of the speech waveform is describ speech sound were sampl
by a microphon and an analog to digit convert attach
to an interconnect ibm 7090 pdp 1 system these utter
were record at the normal nois level of the comput
room but were not band compress or phase distort in
ani manner a sequenc of oper defin on the speech
wave select a list of point along the waveform as
candid for pitch marker these marker ar valid by an
error detect and correct procedurebout 95 percent of the pitch
period were recogn correctli within 1 to 2 time real
time on the ibm 7090 cacm june 1967 reddi d
r ca670602 jb februari 28 1978 9 42 am 1590
5 1590 1590 5 1590 1590 5 1590 
# 1591
a model for a multifunct teach system a teach system
model that wa incorpor into an oper system of a
larg comput is describ the model transfer control to the
oper system to execut function other than teach and then
recov control in order to resum teach the teach system
abac ii wa written to run under the oper system
ibsi for the ibm 7044 graphic system becaus the teach
system automat termin and reschedul itself a student studi a
cours present at a cathod rai displai termin could switch
readili between student mode and programm mode dure the latter
the full resourc of the oper system languag processor compil
librari and user s program were at hi dispos he
could for exampl write assembl debug and execut at the
termin a program written in ani languag process by the
oper system a cours could therefor includ text materi interleav
with program problem which the student could solv without leav
the termin exercis in simul and game could also be
provid the implic of a teach system with thi degre
of flexibl for industri and execut train as well as
academ educ ar discuss in addit the advantag of thi
type of system for comput program and oper ar also
consid cacm june 1967 engvold k j hugh j l
ca670601 jb februari 28 1978 10 24 am 1591 5
1591 1591 5 1591 1591 5 1591 1680 5 1591
1591 6 1591 
# 1592
string similar and misspel the problem of program a comput
to determin whether or not a string of charact is
a misspel of a given word wa consid a numberof
algorithm were evalu some propos by other writer some by
the author these techniqu were test on a collect of
misspel made by student at variou grade level while mani
of the method were clearli unsatisfactori some gave as few
as 2 1 percent incorrect determin cacm june 1967 alberga
c n ca670510 jb februari 28 1978 10 28 am
1112 4 1592 1592 4 1592 1592 4 1592 1592
4 1592 2111 4 1592 2111 4 1592 2339 4
1592 2339 4 1592 440 4 1592 982 5 1592
1112 5 1592 1592 5 1592 1592 5 1592 1592
5 1592 2111 5 1592 2339 5 1592 619 5
1592 830 6 1592 1112 6 1592 1112 6 1592
1592 6 1592 1592 6 1592 440 6 1592 619
6 1592 619 6 1592 
# 1593
a simpl techniqu for digit divis a simpl and econom
method for digit divis is describ the method is suitabl
for divisor whose lead charact is either radix less on
or is uniti with the next charact equal to zero
also the method is direct and need onli half the
number of arithmet oper need by a variant of the
harvard iter method describ by gilman which is suitabl for
similar divisor cacm june 1967 nandi s k krishnamurthi e
v ca670509 jb februari 28 1978 10 30 am 214
4 1593 1497 4 1593 1593 4 1593 1593 4
1593 1975 4 1593 1292 5 1593 1497 5 1593
1593 5 1593 1593 5 1593 1593 5 1593 91
5 1593 107 6 1593 1026 6 1593 1292 6
1593 1593 6 1593 
# 1594
an algorithm for gener permut an algorithm is describ which
under repeat applic gener all permut of k element onli
the previous gener permut the constant k and a temporari
index ar need start with a particular order of k
element abcd repeat applic of the algorithm will gener k
1 addit permut by k 1 success rotat from the
initi circular order of k object anoth circular order can
be obtain by rotat the k 1 lowest element for
each new k 1 circular order anoth k 2 can
be obtain by rotat the k 2 lowest element by
continu in thi manner applic of the algorithm will gener
all k 1 circular order or sinc each circular order
yield k permut the algorithm gener all k permut cacm
mai 1967 langdon jr g g ca670508 jb februari 28
197810 35 am 1594 5 1594 1594 5 1594 1594
5 1594 2087 5 1594 2189 5 1594 3188 5
1594 1594 6 1594 1594 6 1594 1594 6 1594
2087 6 1594 3191 6 1594 521 6 1594 612
6 1594 
# 1595
on the comput enumer of finit topolog the problem of
enumer the number of topolog which can be form from
a finit point set is consid both theoret and computation
certain fundament result ar establish lead to an algorithm for
enumer finit topolog and comput result ar given for n
7 an interest side result of the comput work wa
the unearth of a theoret error which had been induc
into the literatur the us of the comput in combinator
repres chronolog an earli applic and thi side result underscor
it continu us in thi area cacm mai 1967 evan
j w harari f lynn m s ca670507 jb februari
28 1978 10 37 am 1595 5 1595 1595 5
1595 1595 5 1595 
# 1596
airi function algorithm 301 s20 cacm mai 1967 bond g
pittewai m l v ca670506a jb februari 28 1978 10
38 am 1596 5 1596 1596 5 1596 1596 5
1596 
# 1597
transpos vector store arrai algorithm 302 k2 cacm mai 1967
boothroyd j ca670506b jb march 23 1978 4 00 pm
1597 5 1597 1597 5 1597 1597 5 1597 2354
5 1597 2355 5 1597 1418 6 1597 1418 6
1597 1521 6 1597 1521 6 1597 1597 6 1597
1597 6 1597 1679 6 1597 1883 6 1597 2040
6 1597 2350 6 1597 2350 6 1597 2354 6
1597 2355 6 1597 
# 1598
least squar fit by orthogon polynomi algorithm 28 e2 cacm
mai 1967 makinson g j ca670506c jb march 23 1978
4 02 pm 1598 5 1598 1598 5 1598 1598
5 1598 
# 1599
numer solut of the polynomi equat algorithm 300 c2 cacm
mai 1967 kohfeld j j ca670506d jb march 23 1978
4 03 pm 1599 5 1599 1599 5 1599 1599
5 1599 
# 1600
chebyshev quadratur algorithm 279 d1 cacm mai 1967 hillstrom k
ca670506 jb march 23 1978 4 04 pm 1600 5
1600 1600 5 1600 1600 5 1600 2057 5 1600
2058 5 1600 2392 5 1600 2416 5 1600 1600
6 1600 1600 6 1600 1600 6 1600 1600 6
1600 1894 6 1600 2055 6 1600 2055 6 1600
2058 6 1600 
# 1601
parallel numer method for the solut of equat classic iter
procedur for the numer solut of equat provid at each
stage a singl new approxim to the root in question
a techniqu is given for the develop of numer procedur
which provid at each stage sever approxim to a solut
of an equat the s8ever approxim obtain in ani iter
ar computation independ make the method of interest in a
parallel process environ converg is insur by extract the best
inform at each iter sever famili of numer procedur which
us the techniqu of the procedur in a parallel process
environ ar develop and measur of these statist ar report
these measur ar interpret in a parallel process environ in
such an environ the procedur obtain ar superior to standard
algorithm cacm mai 1967 shedler g s ca670505 jb februari
28 1978 10 44 am 1601 5 1601 1601 5
1601 1601 5 1601 1781 5 1601 123 6 1601
196 6 1601 919 6 1601 990 6 1601 1007
6 1601 1046 6 1601 1131 6 1601 1139 6
1601 1140 6 1601 1149 6 1601 1198 6 1601
1215 6 1601 1223 6 1601 1265 6 1601 1303
6 1601 1323 6 1601 1358 6 1601 1366 6
1601 1421 6 1601 1460 6 1601 1462 6 1601
1463 6 1601 1467 6 1601 1468 6 1601 1477
6 1601 1491 6 1601 1496 6 1601 1531 6
1601 1535 6 1601 1565 6 1601 1601 6 1601
1602 6 1601 1613 6 1601 1614 6 1601 1626
6 1601 1641 6 1601 1787 6 1601 1788 6
1601 205 6 1601 224 6 1601 249 6 1601
288 6 1601 316 6 1601 381 6 1601 398
6 1601 11 6 1601 404 6 1601 410 6
1601 463 6 1601 464 6 1601 483 6 1601
3184 6 1601 3188 6 1601 584 6 1601 600
6 1601 680 6 1601 691 6 1601 763 6
1601 799 6 1601 
# 1602
pose a languag for pose problem to a comput a
languag pose is describ which is a drastic departur from
the fortran algol type though it doe util fortran formula
and logic represent and actual contain fortran vi as a
subset with the new languag the user need onli describ
hi problem in equat like form the method of solut
is automat provid in conjunct with the translat from equat
form to comput instruct in thi wai the pose languag
user can solv difficult comput problem like the solut of
differenti equat without requir a knowledg of numer method or
the intricaci of comput subroutin logic essenti all cleric oper
now requir for fortran program have been autom so that
the pose programm need not be concern with these detail
cacm mai 1967 schlesing s sashkin l ca670504 jb februari
28 1978 10 53 am 1602 5 1602 1602 5
1602 1602 5 1602 1781 5 1602 123 6 1602
196 6 1602 919 6 1602 990 6 1602 1007
6 1602 1046 6 1602 1131 6 1602 1139 6
1602 1140 6 1602 1149 6 1602 1198 6 1602
1215 6 1602 1223 6 1602 1265 6 1602 1303
6 1602 1323 6 1602 1358 6 1602 1366 6
1602 1421 6 1602 1460 6 1602 1462 6 1602
1463 6 1602 1467 6 1602 1468 6 1602 1477
6 1602 1491 6 1602 1496 6 1602 1531 6
1602 1535 6 1602 1565 6 1602 1601 6 1602
1602 6 1602 1613 6 1602 1614 6 1602 1626
6 1602 1641 6 1602 1787 6 1602 1788 6
1602 205 6 1602 224 6 1602 249 6 1602
288 6 1602 316 6 1602 381 6 1602 398
6 1602 11 6 1602 404 6 1602 410 6
1602 463 6 1602 464 6 1602 483 6 1602
3184 6 1602 3188 6 1602 584 6 1602 600
6 1602 680 6 1602 691 6 1602 763 6
1602 799 6 1602 
# 1603
a multiprogram monitor for small machin int a combin hardwar
softwar monitor design to control a wide varieti of real
time input output devic is describ the simpl hardwar addit
provid a uniform devic to machin interfac for such element
as keyboard graphic input devic and interv timer the softwar
reliev the user program from the detail of input output
time buffer and task schedul and provid parallel process capabl
user program commun with the monitor through a small set
of meta instruct which consist mostli of machin languag subroutin
call cacm mai 1967 hornbuckl g d ca670503 jb februari
28 1978 10 57 am 1458 4 1603 1523 4
1603 1603 4 1603 1698 4 1603 1747 4 1603
1748 4 1603 1854 4 1603 1877 4 1603 1960
4 1603 2377 4 1603 2378 4 1603 2497 4
1603 2558 4 1603 2625 4 1603 2632 4 1603
2840 4 1603 2941 4 1603 3105 4 1603 3144
4 1603 1471 5 1603 1603 5 1603 1603 5
1603 1603 5 1603 
# 1604
further analysi of a comput center environ empir distribut of
program length execut time process time and load time of
over 10 000 job servic in a univers comput center
environ ar present the data ar subdivid accord to certain
characterist of user and job to obtain select empir condit
distribut of those time properti as well as statist measur
of other interest properti the result ar interpret in term
of the properti of the system studi cacm mai 1967
walter e s wallac v l ca670502 jb februari 28
1978 11 02 am 1533 4 1604 1604 4 1604
1604 4 1604 1951 4 1604 2373 4 1604 1224
5 1604 1410 5 1604 1533 5 1604 1604 5
1604 1604 5 1604 1604 5 1604 1951 5 1604
2667 5 1604 2668 5 1604 1224 6 1604 1410
6 1604 1604 6 1604 1604 6 1604 1604 6
1604 1604 6 1604 1728 6 1604 1728 6 1604
1761 6 1604 1827 6 1604 1827 6 1604 2677
6 1604 
# 1605
an experiment comparison of time share and batch process the
effect for program develop of the mit compat time share
system ctss wa compar with that of the ibm ibsi
batch process system by mean of a statist design experi
an ident set of four program problem wa assign to
each of a group of four program subject influenc extern
to the system such as the sequenc of problem solut
and programm and problem characterist were specifi as design factor
in the experi data wa obtain for six variabl e
g programm time comput time elaps time etc which were
consid to be definit of system effect and analysi of
varianc techniqu were emploi to estim system differ in these
variabl after differ due to the design factor had been
elimin statist analysi of the experiment result provid strong evid
of import system differ as well as a critiqu of
the experiment design itself with implic for further experiment cacm
mai 1967 schatzoff m tsao r wiig r ca670501 jb
februari 28 1978 11 09 am 1605 5 1605 1605
5 1605 1605 5 1605 1792 5 1605 1908 5
1605 1550 6 1605 1605 6 1605 1605 6 1605
224 6 1605 
# 1606
chi squar integr algorithm 299 s15 cacm april 1967 hill
i d pike m c ca670408a jb februari 28 1978
11 10 am 1606 5 1606 1606 5 1606 1606
5 1606 2467 5 1606 2793 5 1606 1606 6
1606 1606 6 1606 
# 1607
coulomb wave function algorithm 300 s22 cacm april 1967 gunn
j h ca670408b jb march 23 1978 4 06 pm
1607 5 1607 1607 5 1607 1607 5 1607 
# 1608
numer integr of function that ha a pole it is
common to need to integr numer function that diverg somewher
outsid the rang of integr even if the diverg occur
quit far awai integr formula like simpson s that depend
on fit a polynomi usual will be inaccur near a
pole thei will be veri bad a method is describ
that give formula that will integr function of thi kind
accur if the order and posit of the pole ar
known explicit formula ar given that ar easi to us
on an automat comput it is shown that thei can
be us for some other singular as well as pole
if the integr converg integr can be carri to the
singular the accuraci of the integr with a pole of
second order is discuss and as an exampl the new
formula is compar with simpson s the new formula ar
us even far from the pole while near the pole
their advantag is overwhelm cacm april 1967 eisner e ca670407
jb februari 28 1978 11 20 am 1608 5 1608
1608 5 1608 1608 5 1608 
# 1609
schedul univers cours examin by comput a new approach to
the problem of schedul cours examin is present in principl
an examin schedul which requir a minimum number of examin
period and satisfi the constraint that no student be requir
to take two examin simultan can be found in two
step first cours which mai have their examin schedul at
the same period ar group togeth in all possibl wai
then a minimum number of these group such that each
cours is includ at least onc ar select by remov
multipl occurr of cours and then schedul each group at
a differ period a minim schedul can be obtain known
algorithm for carri out these procedur ar prohibit expens approxim
to the ideal procedur outlin abov ar given which yield
nonminim but feasibl schedul with a veri small expenditur of
time result of experi us these techniqu ar given these
ar encourag and indic that further experiment would be worthwhil
cacm april 1967 hall jr a d acton f s
ca670406 jb februari 28 1978 11 22 am 1609 4
1609 2052 4 1609 1013 5 1609 1609 5 1609
1609 5 1609 1609 5 1609 
# 1610
a method for the solut of transport problem with tall
matric a method is present for the solut of the
transport problem have a cost matrix with few column the
comput implement of thi method show it to be veri
fast and effici applic ar indict for the personnel classif
problem as well as the classic transport problem an exampl
is work out in detail cacm april 1967 dwyer p
s galler b a ca670405 jb februari 28 1978 11
25 am 1610 5 1610 1610 5 1610 1610 5
1610 
# 1611
schedul project network some of the basic concept and terminolog
of project network ar develop the critic path algorithm incorpor
in the c e i r proprietari schedul system ramp
resourc alloc and multi project schedul is describ the error
detect and network analysi featur of the algorithm ar also
describ cacm april 1967 klein m m ca670404 jb februari
28 1978 11 31 am 1611 4 1611 1611 4
1611 1295 5 1611 1611 5 1611 1611 5 1611
1611 5 1611 340 5 1611 
# 1612
top to bottom pars rehabilit thi note is concern with
the effici of the top to bottom pars algorithm as
us in connect with program languag grammar it is shown
for instanc that retrac of unprofit path can often be
elimin by a suitabl rearrang of the product defin the
grammar the essenti weak of the method is in deal
with complic syntact structur which ar in practic onli spars
occupi e g arithmet express cacm april 1967 brooker r
a ca670403 jb februari 28 1978 11 32 am 1612
4 1612 1781 4 1612 1945 4 1612 1139 5
1612 1612 5 1612 1612 5 1612 1612 5 1612
# 1613
on pass compil of arithmet express for a parallel processor
under the assumpt that a processor mai have a multipl
of arithmet unit a compil for such a processor should
produc object code to take advantag of possibl parallel of
oper most of the present known compil techniqu ar inadequ
for such a processor becaus thei produc express structur that
must be evalu serial a techniqu is present here for
compil arithmet express into structur that can be evalu with
a high degre of parallel the algorithm is a variant
of the so call top down analysi techniqu and requir
onli on pass of the input text cacm april 1967
stone h s ca670402 jb februari 28 1978 11 36
am 1086 4 1613 1132 4 1613 1234 4 1613
1263 4 1613 1265 4 1613 1270 4 1613 1323
4 1613 1358 4 1613 1379 4 1613 1380 4
1613 1453 4 1613 1464 4 1613 1484 4 1613
1491 4 1613 1498 4 1613 1613 4 1613 1613
4 1613 1613 4 1613 1613 4 1613 1613 4
1613 1614 4 1613 1646 4 1613 1781 4 1613
1825 4 1613 1860 4 1613 1900 4 1613 1947
4 1613 1955 4 1613 2025 4 1613 2083 4
1613 2154 4 1613 2178 4 1613 2179 4 1613
2252 4 1613 2325 4 1613 2341 4 1613 2365
4 1613 2506 4 1613 2546 4 1613 2645 4
1613 2652 4 1613 2684 4 1613 2842 4 1613
2929 4 1613 2934 4 1613 3060 4 1613 3069
4 1613 669 4 1613 679 4 1613 691 4
1613 761 4 1613 949 4 1613 989 4 1613
987 5 1613 1086 5 1613 1134 5 1613 1453
5 1613 1613 5 1613 1613 5 1613 1613 5
1613 1781 5 1613 2175 5 1613 3184 5 1613
123 6 1613 196 6 1613 919 6 1613 990
6 1613 1007 6 1613 1046 6 1613 1131 6
1613 1139 6 1613 1140 6 1613 1149 6 1613
1198 6 1613 1215 6 1613 1223 6 1613 1265
6 1613 1303 6 1613 1323 6 1613 1358 6
1613 1366 6 1613 1421 6 1613 1460 6 1613
1462 6 1613 1463 6 1613 1467 6 1613 1468
6 1613 1477 6 1613 1491 6 1613 1496 6
1613 1531 6 1613 1535 6 1613 1551 6 1613
1565 6 1613 1601 6 1613 1602 6 1613 1613
6 1613 1613 6 1613 1614 6 1613 1626 6
1613 1641 6 1613 1787 6 1613 1788 6 1613
205 6 1613 224 6 1613 249 6 1613 1886
6 1613 288 6 1613 316 6 1613 381 6
1613 398 6 1613 11 6 1613 404 6 1613
410 6 1613 463 6 1613 464 6 1613 483
6 1613 3184 6 1613 3188 6 1613 584 6
1613 600 6 1613 680 6 1613 691 6 1613
763 6 1613 799 6 1613 
# 1614
a propos for definit in algol an extens to algol
is propos for ad new data type and oper to
the languag definit mai occur in ani block head and
termin with the block thei ar an integr part of
the program and ar not fix in the languag even
the behavior of exist oper mai be redefin the process
of text contain defin context featur a replac rule that
elimin unnecessari iter and temporari storag exampl of definit set
ar given for real and complex matric complex number file
process and list manipul cacm april 1967 galler b a
perli a j ca670401 jb februari 28 1978 11 43
am 1086 4 1614 1132 4 1614 1234 4 1614
1263 4 1614 1265 4 1614 1270 4 1614 1323
4 1614 1358 4 1614 1379 4 1614 1380 4
1614 1453 4 1614 1464 4 1614 1484 4 1614
1491 4 1614 1498 4 1614 1613 4 1614 1614
4 1614 1614 4 1614 1781 4 1614 1825 4
1614 1860 4 1614 2083 4 1614 2178 4 1614
2179 4 1614 2252 4 1614 2253 4 1614 2325
4 1614 2341 4 1614 2546 4 1614 2557 4
1614 2645 4 1614 2652 4 1614 2684 4 1614
2842 4 1614 2929 4 1614 2934 4 1614 3069
4 1614 669 4 1614 679 4 1614 691 4
1614 761 4 1614 949 4 1614 989 4 1614
1614 5 1614 1614 5 1614 1614 5 1614 1693
5 1614 1781 5 1614 1824 5 1614 1861 5
1614 2126 5 1614 437 5 1614 3184 5 1614
823 6 1614 123 6 1614 196 6 1614 196
6 1614 919 6 1614 990 6 1614 1007 6
1614 1046 6 1614 1131 6 1614 1139 6 1614
1140 6 1614 1149 6 1614 1198 6 1614 1215
6 1614 1223 6 1614 1265 6 1614 1303 6
1614 1323 6 1614 1358 6 1614 1358 6 1614
1366 6 1614 1421 6 1614 1421 6 1614 1460
6 1614 1462 6 1614 1463 6 1614 1467 6
1614 1468 6 1614 1477 6 1614 1477 6 1614
1491 6 1614 1491 6 1614 1496 6 1614 1531
6 1614 1535 6 1614 1565 6 1614 1601 6
1614 1602 6 1614 1613 6 1614 1614 6 1614
1614 6 1614 1614 6 1614 1614 6 1614 1614
6 1614 1626 6 1614 1641 6 1614 1693 6
1614 1781 6 1614 1781 6 1614 1787 6 1614
1788 6 1614 205 6 1614 224 6 1614 249
6 1614 288 6 1614 316 6 1614 381 6
1614 398 6 1614 11 6 1614 404 6 1614
404 6 1614 404 6 1614 408 6 1614 410
6 1614 463 6 1614 464 6 1614 483 6
1614 3184 6 1614 3188 6 1614 584 6 1614
600 6 1614 680 6 1614 691 6 1614 763
6 1614 799 6 1614 
# 1615
an algorithm for gener root locu diagram a techniqu for
us a digit comput to draw both ordinari and time
lag root locu diagram is describ ordinari diagram ar drawn
much faster and more accur than ever befor time lag
diagram which had been imposs to obtain ar drawn with
the same speed and accuraci as ordinari diagram cacm march
1967 krall a m fornaro r ca670313 jb februari 28
1978 12 57 pm 1615 5 1615 1615 5 1615
1615 5 1615 
# 1616
tensor calcul on comput appendix in the main text of
the paper comm acm 9 12 dec 196 864 a
formac program wa discuss which is capabl of calcul variou
quantiti of interest in tensor calculu thi appendix is intend
as an exampl of the program output chrisoffel symbol calcul
for 12 basic orthogon coordin system ar list cacm march
1967 walton j j ca670312 jb februari 28 1978 12
58 pm 1543 5 1616 1616 5 1616 1616 5
1616 1616 5 1616 1664 5 1616 1345 6 1616
1345 6 1616 1543 6 1616 1616 6 1616 1616
6 1616 
# 1617
eigenvalu and eigenvector of the symmetr system algorithm 297 f2
cacm march 1967 boothroyd j ca670311a jb februari 28 1978
12 59 pm 1617 5 1617 1617 5 1617 1617
5 1617 
# 1618
determin of the squar root of a posit definit matrix
algorithm 298 f1 cacm march 1967 spath h ca670311b jb
march 23 1978 4 09 pm 1618 5 1618 1618
5 1618 1618 5 1618 
# 1619
error free method for statist comput neeli ha discuss comput
error gener by some algorithm us to comput variou statist
in the present paper method ar describ which ar error
free simpl in concept and usual less costli in machin
time than those mention by neeli cacm march 1967 rodden
b e ca670310 jb februari 28 1978 1 02 pm
1619 4 1619 3166 4 1619 1411 5 1619 1619
5 1619 1619 5 1619 1619 5 1619 
# 1620
method of evalu polynomi approxim in function evalu routin the
method of nest multipl is commonli us in function evalu
routin to evalu approxim polynomi new polynomi evalu method have
been develop in recent year which requir fewer multipl than
nest multipl and mai therefor be prefer for us in
function evalu routin although some of these method do not
appear to be practic us becaus of round error difficulti
sever method of evalu low degre polynomi have been found
to be satisfactori three such method ar describ and illustr
cacm march 1967 file c t ca670309 jb februari 28
1978 1 08 pm 1620 4 1620 1620 4 1620
819 4 1620 1620 5 1620 1620 5 1620 1620
5 1620 436 5 1620 819 5 1620 
# 1621
comput typeset of algol an applic of comput aid typeset
is introduc a work method is describ for publish algol
by computer translat from hardwar into refer represent computer plan
of typograph lai out and computer control of a typeset
machin the point is made that expert in scienc technolog
and program ar guarante a correct algol document without spend
valuabl time and power on typograph consider and proofread cacm
march 1967 sydow l v ca670308 jb februari 28 1978
1 12 pmb 1621 5 1621 1621 5 1621 1621
5 1621 
# 1622
an effici procedur for the gener of close subset an
effici algorithm is describ for gener subset of a set
s which satisfi constraint of the form if s i
is a member of the subset then s j must
also be a member of the subset the algorithm ha
been program in the wisp languag and successfulli run on
the ibm 7094 in connect with a routin to detect
feedback in multidimension iter network cacm march 1967 wait w
m ca670307 jb februari 28 1978 1 18 pm 1622
5 1622 1622 5 1622 1622 5 1622 
# 1623
an applic of formac a nonlinear circuit analysi problem is
state and the wai in which it wa solv us
formac is indic the solut of the problem us formac
wa notabl sinc sever other method that were tri fail
the problem is straightforward although unten by hand but nevertheless
involv an elabor us of the formac languag the program
wa fairli larg and util practic everi command in particular
it made extens us of the part command sever trick
were necessari in order to circumv some of the shortcom
of the formac system thi paper is more concern with
the us of program techniqu in formac than with the
actual engin problem although reader mai be interest in the
problem becaus it is state in a gener mathemat sens
and could be of interest in area other than circuit
analysi cacm march 1967 neidleman l d ca670306 jb februari
28 1978 1 27 pm 1623 5 1623 1623 5
1623 1623 5 1623 
# 1624
automat dimens exampl of algorithm that will accomplish automat storag
reserv without the need for explicit arrai declar ar describ
cacm march 1967 klerer m mai j ca670305 jb februari
28 1978 1 28 pm 1396 4 1624 1624 4
1624 1083 5 1624 1624 5 1624 1624 5 1624
1624 5 1624 
# 1625
on the automat simplif of sourc languag program method of
simplif that can be appli automat to program written in
an algol like languag ar discuss the simplif ar base
on the form of the program and the knowledg obtain
by a processor without ani understand of what the program
is suppos to do these method have been implement in
a processor call sure that accept a program written in
jovial and output an equival jovial program that mai be
shorter and mai be execut faster than the origin sure
is describ some of the problem encount in automat improv
at the sourc languag level ar discuss and further type
of automat program improv ar suggest cacm march 1967 clark
e r ca670304 jb februari 28 1978 1 33 pm
1084 4 1625 1379 4 1625 1625 4 1625 1625
4 1625 1807 4 1625 1945 4 1625 1947 4
1625 1248 5 1625 1625 5 1625 1625 5 1625
1625 5 1625 669 5 1625 
# 1626
structur of a lisp system us two level storag in
an ideal list process system there would be enough core
memori to contain all the data and program describ in
thi paper ar a number of techniqu that have been
us to build a lisp system util a drum for
it princip storag medium with a surprisingli low time penalti
for us of thi slow storag devic the techniqu includ
care segment of system program alloc of virtual memori to
allow address arithmet for type determin and a special algorithm
for build reason linear list a scheme for bind variabl
is describ which is good in thi environ and allow
for complet compat between compil and interpret program with no
special declar cacm march 1967 bobrow d g murphi d
l ca670303 jb februari 28 1978 1 39 pm 1626
4 1626 1708 4 1626 1781 4 1626 1860 4
1626 2299 4 1626 1626 5 1626 1626 5 1626
1626 5 1626 1641 5 1626 1708 5 1626 1781
5 1626 1826 5 1626 1860 5 1626 2156 5
1626 2168 5 1626 2249 5 1626 2314 5 1626
2719 5 1626 2736 5 1626 2833 5 1626 123
6 1626 196 6 1626 919 6 1626 990 6
1626 1007 6 1626 1046 6 1626 1098 6 1626
1131 6 1626 1139 6 1626 1140 6 1626 1149
6 1626 1198 6 1626 1215 6 1626 1223 6
1626 1265 6 1626 1303 6 1626 1323 6 1626
1358 6 1626 1366 6 1626 1366 6 1626 1389
6 1626 1421 6 1626 1421 6 1626 1460 6
1626 1462 6 1626 1463 6 1626 1467 6 1626
1468 6 1626 1477 6 1626 1491 6 1626 1496
6 1626 1496 6 1626 1531 6 1626 1535 6
1626 1565 6 1626 1601 6 1626 1602 6 1626
1613 6 1626 1614 6 1626 1626 6 1626 1626
6 1626 1626 6 1626 1626 6 1626 1626 6
1626 1626 6 1626 1626 6 1626 1626 6 1626
1626 6 1626 1626 6 1626 1626 6 1626 1641
6 1626 1641 6 1626 1641 6 1626 1708 6
1626 1785 6 1626 1786 6 1626 1787 6 1626
1788 6 1626 205 6 1626 1826 6 1626 1826
6 1626 1826 6 1626 1826 6 1626 210 6
1626 210 6 1626 210 6 1626 224 6 1626
1853 6 1626 1853 6 1626 249 6 1626 1878
6 1626 288 6 1626 1972 6 1626 1972 6
1626 316 6 1626 378 6 1626 381 6 1626
398 6 1626 2082 6 1626 11 6 1626 2148
6 1626 2151 6 1626 2167 6 1626 2210 6
1626 2645 6 1626 2657 6 1626 2736 6 1626
404 6 1626 410 6 1626 463 6 1626 464
6 1626 483 6 1626 3184 6 1626 3184 6
1626 3188 6 1626 584 6 1626 600 6 1626
680 6 1626 691 6 1626 731 6 1626 763
6 1626 799 6 1626 
# 1627
applic of level chang to a multilevel storag organ a
techniqu for organ the devic of a comput storag system
is describ thi techniqu call the multilevel store provid a
mean for econom satisfi the requir for veri larg storag
capac of certain data manag and inform retriev system the
concept of level chang is introduc and it applic to
the multilevel store is discuss a possibl mean for physic
organ the inform for effici us of the multilevel store
is present cacm march 1967 morenoff e mclean j b
ca670302 jb februari 28 1978 1 43 pm 1627 5
1627 1627 5 1627 1627 5 1627 
# 1628
the emerg of a profess comput program deal with an
enorm varieti of activ and is carri on by peopl
with a great varieti of background it seem clear that
part but not all of thi activ is evolv toward
a distinct profession field but that the scope of thi
emerg profess and some of it econom social and educ
characterist ar as yet by no mean well defin in
thi paper these issu ar examin and some opinion about
them ar express cacm march 1967 orden a ca670301 jb
februari 28 1978 1 47 pm 1628 5 1628 1628
5 1628 1628 5 1628 1770 5 1628 1628 6
1628 
# 1629
stat pack a biostatist program packag a packag of fortran
statist program for us on almost ani small to medium
size 40k charact or 8k word for which a fortran
ii compil exist is describ and it avail is announc
the major design criteria of eas of us eas of
modif flexibl of input and detail of output ar describ
cacm februari 1967 shannon s henschk c ca670213 jb februari
28 1978 1 57 pm 1629 5 1629 1629 5
1629 1629 5 1629 
# 1630
comput represent of planar region by their skeleton ani region
can be regard as a union of maxim neighborhood of
it point and can be specifi by the center and
radii of these neighborhood thi set is a sort of
skeleton of the region the storag requir to repres a
region in thi wai is compar to that requir when
it is repres by encod it boundari moreov the skeleton
represent seem to have advantag when it is necessari to
determin repeatedli whether point ar insid or outsid the region
or to perform set theoret oper on region cacm februari
1967 pfaltz j l rosenfeld a ca670212 jb februari 28
1978 2 07 pm 1630 4 1630 2547 4 1630
2987 4 1630 3165 4 1630 1326 5 1630 1630
5 1630 1630 5 1630 1630 5 1630 2987 5
1630 1326 6 1630 1630 6 1630 2125 6 1630
2547 6 1630 2633 6 1630 421 6 1630 524
6 1630 
# 1631
test a random number gener the first 1 000 000
number produc by the random number gener us in the
gener purpos system simul gpss were subject to statist test
the test ar describ and the result of the test
ar present these particular test indic that the number ar
satisfactori it is recommend that suitabl test be appli to
all random number us in comput simul cacm februari 1967
gorenstein s ca670211 jb februari 28 1978 2 10 pm
1631 5 1631 1631 5 1631 1631 5 1631 1691
5 1631 1293 6 1631 1420 6 1631 1631 6
1631 
# 1632
program the tabular method of analysi of varianc for factori
experi the eas of program the tabular method of analysi
of varianc for complet factori experi in a fortran languag
is demonstr in thi method the total sum of squar
is partit into orthogon singl degre of freedom sum of
squar main effect and interact sum of squar ar then
obtain by appropri pool of the singl degre of freedom
sum of squar program segment to accomplish the procedur ar
present modif to handl hierarch design and replic experi ar
mention a fortran ii program for an ibm 7094 is
describ briefli cacm februari 1967 carmer s g ca670210 jb
februari 28 1978 2 33 pm 1632 5 1632 1632
5 1632 1632 5 1632 
# 1633
a modifi newton method for polynomi a modifi newton method
for polynomi is discuss it is assum on ha approxim
for all the root of the polynomi three variat ar
describ if the root ar simpl it is shown that
under appropri condit two of the variat ar cubic converg
cacm februari 1967 ehrlich l w ca670209 jb februari 28
1978 2 33 pm 1633 4 1633 1452 5 1633
1633 5 1633 1633 5 1633 1633 5 1633 
# 1634
27 bit ar not enough for 8 digit accuraci from
the inequ 10 8 2 27 we ar like to
conclud that we can repres 8 digit decim float point
number accur by 27 bit float point number howev we
need 28 signific bit to repres some 8 digit number
accur in gener we can show that if 10 p
2 q 1 then q signific bit ar alwai enough
for p digit decim accuraci final we can defin a
compact 27 bit float point represent that will give 28
signific bit for number of practic import cacm februari 1967
goldberg i b ca670208 jb februari 28 1978 2 38
pm 1634 5 1634 1634 5 1634 1634 5 1634
1783 5 1634 1843 5 1634 1634 6 1634 1634
6 1634 1783 6 1634 
# 1635
paramet for pseudo rung kutta method the object of thi
note is to present a choic of the free paramet
in the third and fourth order pseudo rung kutta method
involv two point thi choic of paramet caus a bound
on the princip part of the truncat error term to
be near the minimum for the fourth order method and
at the minimum for the third order method cacm februari
1967 byrn g d ca670207 jb februari 28 1978 3
20 pm 1635 5 1635 1635 5 1635 1635 5
1635 
# 1636
invari imbed and the numer integr of boundari valu problem
for unstabl linear system of ordinari differenti equat in such
divers area as radi transfer in planetari atmospher and optim
guidanc and control two point boundari valu problem for unstabl
system aris greatli complic the numer solut an invari imbed
techniqu is present which is us in overcom these frequent
encount instabl and the result of some numer experi ar
given cacm februari 1967 belman r e kagiwada h h
kalaba r e ca670206 jb februari 28 1978 3 28
pm 1636 5 1636 1636 5 1636 1636 5 1636
2427 5 1636 1581 6 1636 1636 6 1636 
# 1637
problem in the statist analysi of simul experi the comparison
of mean and the length of sampl record research is
continu into statist analysi of simul experi contain autocorrel time
seri it is shown how to estim the length of
sampl record need to us certain larg sampl result in
measur stabil analog between autocorrel data and independ observ ar
describ a wai to test the differ of the mean
of two experi is suggest it is shown how the
varianc of the sampl mean relat to the spectrum of
the gener process and estim of the quantiti of interest
is describ the result expand the possibl of statist spectral
analysi as appli to simul experi cacm februari 1967 fishman
g s ca670205 jb februari 28 1978 3 34 pm
1637 5 1637 1637 5 1637 1637 5 1637 
# 1638
sort by replac select in sort by replac select the
expect length of a sequenc begin with the i th
element i 1 is prove to be 2f in accord
with a conjectur of e h friend where f is
the number of memori cell us the expect length of
the j th sequenc is determin to be f time
a j th degre polynomi in e such that the
valu of thi polynomi approach 2 as j approach infin
recurs formula ar obtain for both the mean and the
standard deviat of the length of the j th sequenc
the mathemat proof of these result ar base upon the
assumpt that n the number of item to be sort
is infinit but it is shown that the error due
to the finit of n approach zero rapidli as n
increas cacm februari 1967 gasner b j ca670204 jb februari
28 1978 3 56 pm 1638 4 1638 2176 4
1638 2272 4 1638 1638 5 1638 1638 5 1638
1638 5 1638 1867 5 1638 2272 5 1638 677
5 1638 1638 6 1638 1638 6 1638 677 6
1638 
# 1639
exponenti curv fit algorithm 295 e2 cacm februari 1967 spath
h ca670203a jb februari 28 1978 3 57 pm 1639
4 1639 1480 5 1639 1639 5 1639 1639 5
1639 1639 5 1639 2101 5 1639 2102 5 1639
1639 6 1639 1639 6 1639 
# 1640
gener least squar fit by orthogon polynomi algorithm 296 e2
cacm februari 1967 makinson g j ca670203b jb march 23
1978 4 13 pm 1640 5 1640 1640 5 1640
1640 5 1640 
# 1641
a us of fast and slow memori in list process
languag a scheme is describ which permit a substanti increas
in memori space util to store list structur data it
consist in reduc to on level a nonhomogen store compos
of fast core and slow disk or drum memori the
space avail in slow memori is divid into page each
contain a given number of machin word the reduct to
a on level memori is perform by a program which
leav the most often call page in the fast memori
when a new page from slow store is request the
page in core have the longest period of inact is
transfer back to the slow store the complet scheme ha
been implement in connect with a lisp embed into algol
us an ibm 7044 with 32k of core memori and
disk gain in memori space were about 100 fold as
often happen in program applic the price of the addit
space is comput time although the disk have an access
time 10 4 time slower than core test indic that
the actual slow down vari from 3 to 10 depend
on the number of page avail in the fast store
cacm februari 1967 cohen j ca670202 jb februari 28 1978
4 06 pm 1626 5 1641 1641 5 1641 1641
5 1641 1641 5 1641 1708 5 1641 1781 5
1641 1860 5 1641 2299 5 1641 123 6 1641
196 6 1641 919 6 1641 990 6 1641 1007
6 1641 1046 6 1641 1131 6 1641 1139 6
1641 1140 6 1641 1149 6 1641 1198 6 1641
1215 6 1641 1223 6 1641 1265 6 1641 1303
6 1641 1323 6 1641 1358 6 1641 1366 6
1641 1366 6 1641 1389 6 1641 1421 6 1641
1421 6 1641 1460 6 1641 1462 6 1641 1463
6 1641 1467 6 1641 1468 6 1641 1477 6
1641 1491 6 1641 1496 6 1641 1496 6 1641
1502 6 1641 1531 6 1641 1535 6 1641 1565
6 1641 1601 6 1641 1602 6 1641 1613 6
1641 1614 6 1641 1626 6 1641 1626 6 1641
1626 6 1641 1641 6 1641 1641 6 1641 1641
6 1641 1641 6 1641 1641 6 1641 1785 6
1641 1786 6 1641 1787 6 1641 1788 6 1641
205 6 1641 224 6 1641 249 6 1641 288
6 1641 316 6 1641 378 6 1641 381 6
1641 398 6 1641 11 6 1641 404 6 1641
410 6 1641 463 6 1641 464 6 1641 483
6 1641 3184 6 1641 3184 6 1641 3188 6
1641 584 6 1641 600 6 1641 680 6 1641
691 6 1641 763 6 1641 799 6 1641 
# 1642
time share on a comput with a small memori techniqu
to make time share attract on a comput with a
small central memori ar present small is taken to mean
that onli on user program plu a monitor will fit
into the memori at ani time the techniqu depend on
have two level of secondari storag level 1 sever time
larger than the main memori and quit fast and level
2 mani time larger and slower than level 1 cacm
februari 1967 fisher r o shepard c d ca670201 jb
februari 28 1978 4 10 pm 1642 5 1642 1642
5 1642 1642 5 1642 
# 1643
an improv to iter method of polynomi factor method of
polynomi factor which find the zero on at a time
requir the divis of the polynomi by the accept factor
it is shown how the accuraci of thi divis mai
be increas by divid in order of both ascend and
descend power of the variabl and choos a crossov point
which minim a veri simpli calcul error criterion cacm januari
1967 bingham j a c ca670112 jb februari 28 1978
4 20 pm 1643 5 1643 1643 5 1643 1643
5 1643 
# 1644
on the comput of least squar polynomi round error accumul
dure digit comput of a least squar polynomi make the
comput polynomi onli an approxim to the true least squar
polynomi a simpl method for adjust ing the constant term
of the comput polynomi to get a better approxim to
the true least squar polynomi is describ cacm januari 1967
goldberg m ca670111 jb februari 28 1978 4 24 pm
1644 5 1644 1644 5 1644 1644 5 1644 
# 1645
a note on comput approxim to the exponenti function two
method ar discuss which result in near minimax ration approxim
to the exponenti function and at the same time retain
the desir properti that the approxim for neg valu of
the argument is the reciproc of the approxim for correspond
posit valu these method lead to approxim which ar much
superior to the commonli us converg of the gaussian continu
fraction for the exponenti coeffici and error ar given for
the interv 5 ln 2 5 ln 2 and ln
2 ln 2 cacm januari 1967 codi w j ralston
a ca670110jb februari 28 1978 4 25 pm 1015 4
1645 1346 4 1645 1440 4 1645 1645 4 1645
951 4 1645 1645 5 1645 1645 5 1645 1645
5 1645 532 5 1645 
# 1646
ditran a compil emphas diagnost ditran diagnost fortran is an
implement of asa basic fortran with rather extens error check
capabl both at compil time and dure execut of a
program the need for improv diagnost capabl and some object
to be met by ani compil ar discuss attent is
given to the design and implement of ditran and the
particular techniqu emploi to provid the diagnost featur the handl
of error messag by a gener macro approach is describ
special featur which provid teach aid for us by instructor
ar note cacm januari 1967 moulton p g muller m
e ca670109 jb februari 28 1978 4 30 pm 1179
4 1646 1225 4 1646 1288 4 1646 1350 4
1646 1544 4 1646 1613 4 1646 1646 4 1646
1646 4 1646 1646 4 1646 1646 4 1646 1646
4 1646 1646 4 1646 1647 4 1646 1728 4
1646 1781 4 1646 1900 4 1646 1945 4 1646
1955 4 1646 2025 4 1646 2111 4 1646 2154
4 1646 2365 4 1646 2506 4 1646 2534 4
1646 2556 4 1646 2650 4 1646 2650 4 1646
2698 4 1646 2708 4 1646 3060 4 1646 3093
4 1646 987 5 1646 1072 5 1646 1179 5
1646 1646 5 1646 1646 5 1646 1646 5 1646
1647 5 1646 2887 5 1646 680 5 1646 830
5 1646 1646 6 1646 2111 6 1646 
# 1647
watfor the univers of waterloo fortran iv compil watfor is
an in core load and go compil which ha been
implement within the ibm 7040 44 oper system fortran iv
wa select as the sourc languag in order to achiev
maximum languag compat with other avail compil system in particular
the ibm 7040 44 fortran iv system the princip advantag
of the watfor compil is that it translat fortran iv
program at speed of up to 100 statement per second
sinc the compil resid core there is virtual no system
overhead and henc larg batch of student program mai be
process veri effici the compil also provid extens error diagnost
dure both the compil and the execut phase of a
program run thi featur make the system attract to both
learner and learn user alik cacm januari 1967 shantz p
w german r a mitchel j g ca670108 jb februari
28 1978 4 36 pm 267 4 1647 1139 4
1647 1141 4 1647 1215 4 1647 1223 4 1647
1646 4 1647 1647 4 1647 1647 4 1647 1781
4 1647 1787 4 1647 1792 4 1647 364 4
1647 405 4 1647 438 4 1647 763 4 1647
1179 5 1647 224 5 1647 1646 5 1647 1647
5 1647 1647 5 1647 1647 5 1647 1728 5
1647 830 6 1647 987 6 1647 1072 6 1647
1179 6 1647 1525 6 1647 1647 6 1647 1647
6 1647 1785 6 1647 680 6 1647 
# 1648
uniform random algorithm 294 g5 cacm januari 1967 strome w
m ca670107 jb februari 28 1978 4 37 pm 1648
5 1648 1648 5 1648 1648 5 1648 1663 5
1648 2349 5 1648 1190 6 1648 1648 6 1648
1648 6 1648 1716 6 1648 1794 6 1648 1894
6 1648 2043 6 1648 501 6 1648 613 6
1648 774 6 1648 
# 1649
data direct input output in fortran a statement which is
similar to the namelist statement of fortran iv ha been
incorpor in the fortran 63 compil the fortran 63 implement
allow a greater flexibl and simplic than the fortran iv
featur the hollerith name the locat the mode and the
dimens of a variabl can be discov by mean of
standard fortran statement method of us thi inform ar illustr
in relat to gener purpos data direct input and output
routin some other us such as matrix manipul ar discuss
cacm januari 1967 hassitt a ca670106 jb februari 28 1978
4 41 pm 1649 4 1649 1053 5 1649 1649
5 1649 1649 5 1649 1649 5 1649 
# 1650
a unifi comput method for the analysi of complet factori
experi a comput method which mai be us for the
calcul of sum of squar in the analysi of varianc
of complet factori experi and in the comput of main
effect or interact mean is describ the method is elucid
as unifi sinc on method can be us for a
varieti of purpos each previous requir differ method the program
advantag of such a method ar obviou the follow variant
ar discuss 1 the standard analysi of varianc 2 analys
omit certain level of on or more factor 3 separ
analys for some level of a factor or for combin
of level of more than on factor these ar perform
simultan 4 the calcul of main effect or interact mean
the mean expect the data in standard order and it
leav the data in that order so that mani analys
of the same data can be perform without rearrang the
total sum of squar exclud a replic sum of squar
is partit into all polynomi partit and their interact each
with on degre of freedom thi is so even if
factor have unequ space factor level cacm januari 1967 cooper
b e ca670105 jb februari 28 1978 4 49 pm
1650 5 1650 1650 5 1650 1650 5 1650 
# 1651
an interpret input routin for linear program in thi descript
articl an input code is present which greatli simplifi data
input to ani linear program solut routin for subsequ us
either as a pedagog devic or for solv rather small
lp problem thi latter limit us deriv not at all
from inher limit in the code itself but from an
effici evalu larg lp problem would doubtless benefit from an
input system more suit for bulk data handl than the
input code describ from a user s standpoint input appear
almost exactli as a textbook present of the lp problem
limit onli by a keypunch s inabl to write subscript
etc the input interpret scan column wise thu no fix
format data prepar is requir the user mai also under
veri gener requir onli liber us editori comment throughout the
input deck as an aid in identif e g of
row constraint the articl includ exampl of input output from
a solut routin present in us and a skeleton flowchart
of the input interpret cacm januari 1967 aigner d j
ca670104 jb march 1 1978 8 58 am 1651 5
1651 1651 5 1651 1651 5 1651 
# 1652
a code for non numer inform process applic in onlin
system a code ha been specif design to simplifi the
intern inform process oper within an onlin comput system with
respect to non numer applic and to maxim the transfer
rate of the inform channel link the system and the
system user the code ha direct applic to problem in
area such as inform retriev document classif comput aid teach
and text edit thi code call ipc inform process code
is an 8 bit code set construct so that 7
6 5 and 4 bit subset can be easili deriv
from the basic set the code set is organ so
that simpl binari oper can distinguish between the numer alphabet
special symbol and control charact code the number of usabl
charact within the basic set size mai be expand either
by us of escap code includ in the set or
by suitabl interpret of otherwis unassign code on the basi
of the requir of local environ cacm januari 1967 morenoff
e mclean j b ca670103 jb march 1 1978 9
05 am 1652 5 1652 1652 5 1652 1652 5
1652 
# 1653
system perform evalu survei and apprais the state of the
art of system perform evalu is review and evalu goal
and problem ar examin throughput turnaround and avail ar defin
as fundament measur of perform overhead and cpu speed ar
place in perspect the appropri of instruct mix kernel simul
and other tool is discuss as well as pitfal which
mai be encount when us them analysi simul and synthesi
ar present as three level of approach to evalu requir
success greater amount of inform the central role of measur
in perform evalu and in the develop of evalu method
is explor cacm januari 1967 calingaert p ca670102 jb march
1 1978 9 10 am 1653 4 1653 1653 4
1653 1653 4 1653 2387 4 1653 2852 4 1653
2989 4 1653 963 5 1653 1069 5 1653 1417
5 1653 1653 5 1653 1653 5 1653 1653 5
1653 2151 5 1653 2318 5 1653 1653 6 1653
1653 6 1653 1747 6 1653 1860 6 1653 
# 1654
a univers s educ program in comput scienc after a
review of the power of contemporari comput comput scienc is
defin in sever wai the object of comput scienc educ
ar state and it is assert that in a north
american univers these will be achiev onli through a comput
scienc depart the program at stanford univers is review as
an exampl the appendic includ syllab of ph qualifi examin
for stanford s comput scienc depart cacm januari 1967 forsyth
g e ca670101 jb march 1 1978 9 13 am
1413 4 1654 1654 4 1654 1771 4 1654 2478
4 1654 1205 5 1654 1654 5 1654 1654 5
1654 1654 5 1654 1720 5 1654 1771 5 1654
1205 6 1654 1654 6 1654 1654 6 1654 1771
6 1654 
# 1655
code extens procedur for inform interchang propos usa standard cacm
decemb 1968 standard code code inform interchang charact shift out
shift in escap data link escap control function standard procedur
code extens code tabl bit pattern 1 0 2 0
2 43 3 20 3 24 3 50 3 51
3 52 3 53 3 54 3 55 3 56
3 57 3 70 3 71 3 72 3 73
3 74 3 75 3 80 3 81 3 82
3 83 5 0 5 1 6 2 6 21
6 22 ca681211 jb februari 21 1978 12 16 pm
1655 5 1655 1655 5 1655 1655 5 1655 
# 1656
procedur for the standard process propos usa standard cacm decemb
1968 standard procedur criteria 2 3 4 2 ca681210 jb
februari 21 1978 12 21 pm 1656 5 1656 1656
5 1656 1656 5 1656 
# 1657
implement of the sharer2 time share system a simpl mechan
is describ for the execut of part of a program
with it own memori protect thi allow such a program
to act as a suboper system an improv version of
the sharer time share system us thi featur is describ
cacm decemb 1968 harrison m c oper system memori protect
time share multiprogram monitor submonitor suboper system 4 32 4
31 4 32 ca681209 jb februari 21 1978 1 27
pm 1657 4 1657 2080 4 1657 2357 4 1657
2536 4 1657 1523 5 1657 1657 5 1657 1657
5 1657 1657 5 1657 
# 1658
analysi of algorithm for the zero on program problem thi
paper is concern with a review and examin of sever
exist algorithm for the zero on program problem comput experi
is summar the machin time and storag requir of sever
of the algorithm ar compar over sever test problem of
small and intermedi size comput experi still provid littl hope
of solv problem with over 100 variabl with a reason
amount of machin time cacm decemb 1968 gue r l
liggett j c cain k c oper research optim theori
integ program zero on variabl algorithm 5 39 5 41
ca681208 jb februari 21 1978 1 31 pm 1658 4
1658 1088 5 1658 1658 5 1658 1658 5 1658
1658 5 1658 2226 5 1658 1658 6 1658 1666
6 1658 
# 1659
comput linguist in a ph comput scienc program thi report
contain recommend for a cours curriculum on comput linguist in
a ph comput scienc program a classif of the subject
area contain in comput linguist is present and ten cours
in these area ar describ a basic bibliographi in comput
linguist is append cacm decemb 1968 kuno s oetting a
g comput linguist mathemat linguist languag and comput languag data
process comput linguist cours curriculum comput linguist graduat program comput
linguist bibliographi comput scienc curriculum 1 52 3 42 3
43 ca681207 jb februari 21 1978 1 37 pm 1350
4 1659 1350 4 1659 1399 4 1659 1659 4
1659 1659 4 1659 1659 4 1659 1659 4 1659
1659 4 1659 1768 4 1659 1781 4 1659 1856
4 1659 1945 4 1659 2050 4 1659 2110 4
1659 3094 4 1659 1225 5 1659 1265 5 1659
1350 5 1659 1659 5 1659 1659 5 1659 1659
5 1659 1671 5 1659 1697 5 1659 1927 5
1659 3003 5 1659 1659 6 1659 1659 6 1659
1678 6 1659 1771 6 1659 1927 6 1659 1945
6 1659 2097 6 1659 2147 6 1659 2163 6
1659 2187 6 1659 2329 6 1659 2345 6 1659
2367 6 1659 2407 6 1659 2478 6 1659 2479
6 1659 2480 6 1659 2538 6 1659 
# 1660
index by subject to algorithm 1960 1968 cacm decemb 1968
ca681206 jb februari 21 1978 1 39 pm 1660 5
1660 1660 5 1660 1660 5 1660 
# 1661
multint algorithm 32 d1 cacm decemb 1968 kolbig k s
numer integr multidimension integr gaussian integr 5 16 ca681205 jb
februari 21 1978 1 41 pm 1661 5 1661 1661
5 1661 1661 5 1661 
# 1662
eigenvalu and eigenvector of a real gener matrix f2 cacm
decemb 1968 grad j brebner m a eigenvalu eigenvector latent
root latent vector household s method qr algorithm invers iter
5 14 ca681204 jb februari 21 1978 1 42 pm
1662 5 1662 1662 5 1662 1662 5 1662 1968
5 1662 2099 5 1662 2335 5 1662 1662 6
1662 1662 6 1662 1662 6 1662 1707 6 1662
2099 6 1662 
# 1663
gener of random number satisfi the poisson distribut g5 cacm
decemb 1968 snow r h poisson distribut random number gener
mont carlo 5 12 5 5 ca681203 jb februari 21
1978 1 45 pm 1663 4 1663 1663 4 1663
2195 4 1663 2349 4 1663 2679 4 1663 1190
5 1663 1648 5 1663 1663 5 1663 1663 5
1663 1663 5 1663 2123 5 1663 1663 6 1663
# 1664
an algorithm for deriv the equat of mathemat physic by
symbol manipul a method is describ wherebi a digit comput
can be us to deriv the equat of mathemat physic
in ani curvilinear coordin system request by the user the
effect of the techniqu is demonstr by us it to
deriv the navier stoke equat of fluid motion and the
continu equat to deriv these equat by thi method the
user need know onli the coordin transform equat relat the
curvilinear coordin of interest to an orthogon cartesian triad when
thi program is us and the coordin transform equat ar
suppli as input the comput will deriv the navier stoke
equat and the continu equat the equat obtain will be
rel to the curvilinear coordin system specifi by the transform
equat us as input in thi paper the emphasi is
on theoret consider and methodolog rather than on program detail
result ar present for cylindr polar and spheric polar coordin
system cacm decemb 1968 howard j c tashjian h formac
navier stroke equat continu equat tensor tensor equat curvilinear coordin
system fortran symbol manipul 3 21 3 25 3 29
4 12 4 29 ca681202 jb februari 21 1978 2
02 pm 1543 4 1664 1543 4 1664 1664 4
1664 1664 4 1664 1664 4 1664 1345 5 1664
1543 5 1664 1616 5 1664 1664 5 1664 1664
5 1664 1664 5 1664 
# 1665
automat gener of effici lexic processor us finit state techniqu
the practic applic of the theori of finit state automata
to automat gener lexic processor is dealt with in thi
tutori articl by the us of the a rword system
develop at m as part of the a 1 system
thi system accept as input descript of the multicharact item
or of word allow in a languag given in term
of a subset of regular express the output of the
system is a lexic processor which read a string of
charact and combin them into the item as defin by
the regular express each output item is identifi by a
code number togeth with a pointer to a block of
storag contain the charact and charact count in the item
the processor produc by the system ar base on finit
state machin each state of a machin correspond to a
uniqu condit in the lexic process of a charact string
at each state a charact is read and the machin
chang to a new state at each transit appropri action
ar taken base on the particular charact read the system
ha been in oper sinc 1966 and processor gener have
compar favor in speed to carefulli hand code program to
accomplish the same task lexic processor for a o and
mad ar among the mani which have been produc the
techniqu emploi ar independ of the natur of the item
be evalu if the word event is substitut for charact
string these processor mai be describ as gener decis make
mechan base upon an order sequenc of event thi allow
the system to be us in a rang of applic
outsid the area of lexic process howev conveni these advantag
mai be speed is the most import consider in design
a system for automat gener of a lexic processor the
goal wa a processor which complet elimin backup or reread
which wa nearli as fast as hand code processor which
would analyz the languag and detect error and which would
be conveni and easi to us cacm decemb 1968 johnson
w l porter j h acklei s i ross d
t charact string compil finit state automata finit state machin
lexic processor nondeterminist machin pars plex structur regular express sequenti
machin syntact analysi 3 63 3 75 4 12 5
22 5 24 5 31 ca681201 jb februari 21 1978
2 19 pm 1051 4 1665 1139 4 1665 1265
4 1665 1323 4 1665 1358 4 1665 1380 4
1665 1552 4 1665 1665 4 1665 1665 4 1665
1665 4 1665 1665 4 1665 1768 4 1665 1781
4 1665 1787 4 1665 1787 4 1665 1824 4
1665 1825 4 1665 1836 4 1665 1860 4 1665
1861 4 1665 1989 4 1665 2015 4 1665 2110
4 1665 2112 4 1665 2127 4 1665 2155 4
1665 2187 4 1665 2317 4 1665 2534 4 1665
2541 4 1665 2545 4 1665 2698 4 1665 2698
4 1665 2733 4 1665 2733 4 1665 2820 4
1665 3073 4 1665 3155 4 1665 763 4 1665
1665 5 1665 1665 5 1665 1665 5 1665 1781
5 1665 378 5 1665 2746 5 1665 631 5
1665 799 5 1665 1665 6 1665 1739 6 1665
2139 6 1665 2545 6 1665 2786 6 1665 
# 1666
solut of linear program in 0 1 variabl by implicit
enumer algorithm 341 h cacm novemb 1968 byrn j l
proll l g linear program zero on variabl partial enumer
5 41 ca681113 jb februari 21 1978 2 21 pm
1666 5 1666 1666 5 1666 1666 5 1666 2226
5 1666 1658 6 1666 1666 6 1666 
# 1667
root of polynomi by a root squar and result routin
algorithm 340 c2 cacm novemb 1968 noltemei a root finder
root of polynomi equat polynomi zero root squar oper graeff
method result procedur subresult procedur test of root accept criteria
5 15 ca681112 jb februari 21 1978 2 24 pm
1667 4 1667 1667 4 1667 1667 4 1667 178
5 1667 1242 5 1667 1667 5 1667 1667 5
1667 1667 5 1667 327 5 1667 
# 1668
an algol procedur for the fast fourier transform with arbitrari
factor algorithm 339 c6 cacm novemb 1968 singleton r c
fast fourier transform multivari fourier transform fourier seri harmon analysi
spectral analysi orthogon polynomi orthogon transform virtual core memori permut
3 15 3 83 5 12 5 14 ca681111 jb
februari 21 1978 2 26 pm 1668 4 1668 1668
4 1668 1669 4 1668 1679 4 1668 1728 4
1668 2859 4 1668 1525 5 1668 1668 5 1668
1668 5 1668 1668 5 1668 1669 5 1668 
# 1669
algol procedur for the fast fourier transform algorithm 338 c6
cacm novemb 1968 singleton r c fast fourier transform complex
fourier transform multivari fourier transform fourier seri harmon analysi spectral
analysi orthogon polynomi orthogon transform virtual core memori permut 3
15 3 83 5 12 5 14 ca681110 jb februari
21 1978 2 29 pm 1668 4 1669 1669 4
1669 1679 4 1669 1728 4 1669 2859 4 1669
1525 5 1669 1668 5 1669 1669 5 1669 1669
5 1669 1669 5 1669 1525 6 1669 1669 6
1669 
# 1670
correspond of 8 bit and hollerith code for comput environ
a usasi tutori standard cacm novemb 1968 usa standard card
code punch card punch card code hole pattern hole pattern
assign punch card system 1 1 1 4 2 0
2 12 2 43 2 44 3 10 3 20
3 30 3 31 3 42 3 50 3 56
3 70 3 72 3 73 3 74 3 80
3 81 4 0 4 1 4 2 4 20
4 40 5 0 ca681109 jb februari 21 1978 2
33 pm 1670 5 1670 1670 5 1670 1670 5
1670 
# 1671
a phonolog rule tester the design and implement of a
system to allevi the problem of rule evalu for the
linguist in the area of phonolog ar present it permit
the user to defin on line set of rule statabl
within the framework present in the sound pattern of english
by chomski and hall 1968 to defin phonem as bundl
of specifi distinct featur to defin data as string of
phonem with associ grammat structur to test the effect of
appli rule to the data and to store both the
definit and result the rule applic facil describ in detail
wa implement by translat linguist rule to rule in flip
a format direct list processor embed in lisp thi made
the system construct easi while provid sophist capabl for the
linguist the system is written in bbn lisp on the
scientif data system 940 comput and is design to be
us on line in interact fashion with control return to
the user after each command is execut cacm novemb 1968
borrow d g fraser j b phonolog rule tester linguist
transform grammar lisp format direct list process on line system
3 42 4 13 4 22 ca681108 jb februari 21
1978 2 41 pm 1659 5 1671 1671 5 1671
1671 5 1671 1671 5 1671 1225 6 1671 1265
6 1671 1350 6 1671 1671 6 1671 1697 6
1671 
# 1672
practic error coeffici in the integr of period analyt function
by the trapezoid rule theoret and practic valu of error
coeffici us in bound the error in integr period analyt
function with the trapezoid rule ar tabul for variou rang
of the paramet cacm novemb 1968 rabinowitz p theoret error
coeffici practic error coeffici numer integr period analyt function trapezoid
rule roundoff error truncat error integr algorithm 5 11 5
16 ca681107 jb februari 21 1978 2 45 pm 1672
4 1672 1672 5 1672 1672 5 1672 1672 5
1672 1784 5 1672 
# 1673
approxim solut of initi boundari wave equat problem by boundari
valu techniqu a new boundari valu techniqu is propos for
the treatment of initi boundari valu problem for linear and
mildli nonlinear wave equat sever illustr exampl ar offer to
demonstr the eas with which the method can be appli
cacm novemb 1968 greenspan d initi boundari valu problem wave
equat boundari valu techniqu 5 15 5 17 ca681106 jb
februari 21 1978 2 48 pm 1673 5 1673 1673
5 1673 1673 5 1673 
# 1674
on line random number gener and their us in combin
some on line random number gener i e gener requir
a singl fortran instruct ar discuss and some short fortran
program which mix sever such gener ar describ the aim
is to provid method for incorpor random number gener directli
in fortran program by mean of a few in line
instruct the advantag ar speed avoid linkag to and from
a subroutin conveni and versatil anyon wish to experi with
gener either us congruenti gener by themselv or mix sever
gener to provid a composit with potenti better statist properti
than the librari gener current avail mai wish to consid
some of the simpl fortran program discuss here cacm novemb
1968 marsaglia g brai t a random number gener mont
carlo simul 5 5 ca681105 jb februari 21 1978 2
54 pm 1674 4 1674 1691 4 1674 1293 5
1674 1674 5 1674 1674 5 1674 1674 5 1674
1794 5 1674 1870 5 1674 2122 5 1674 1674
6 1674 1674 6 1674 1674 6 1674 1691 6
1674 
# 1675
a note on a relev estim and it improv in
thi paper the effect of iter the improv procedur is
examin it is shown that applic of the improv factor
beyond the first time ar ineffectu and that the factor
is but a scale factor cacm novemb 1968 korfhag r
r inform retriev relev index classif 3 70 3 71
3 74 ca681104 jb februari 21 1978 2 57 pm
1675 5 1675 1675 5 1675 1675 5 1675 
# 1676
the lrltran compil extens softwar problem confront an organ which
possess a number of differ comput and which frequent acquir
new on to maintain cohes a system must be develop
written in a high level languag which minim machin depend
and isol those which ar necessari a languag and a
compil for the languag ar discuss here the languag call
lrltran is a heavili augment fortran the tree pass compil
make us intern of a postfix polish notat pass i
to pass ii and a tree represent refer to as
a composit block tabl pass i to pass iii machin
independ optim occur in pass ii and do loop and
machin depend optim in pass iii cacm novemb 1968 mendicino
s f martin j t ranelletti j e zwakenberg r
g compil compil compil machin independ scatter storag techniqu polish
processor common subseg tree represent optim 4 12 4 20
ca681103 jb februari 21 1978 3 03 pm 1676 4
1676 1682 4 1676 1728 4 1676 1860 4 1676
1973 4 1676 2018 4 1676 2032 4 1676 2033
4 1676 2107 4 1676 2109 4 1676 2203 4
1676 2251 4 1676 2359 4 1676 2524 4 1676
2543 4 1676 2552 4 1676 2559 4 1676 2991
4 1676 3053 4 1676 1676 5 1676 1676 5
1676 1676 5 1676 1785 5 1676 2859 5 1676
1525 6 1676 1676 6 1676 
# 1677
storag organ in program system the system of program and
data represent that ha been in us on the rice
univers comput for five year is describ each logic entiti
in storag occupi a block of consecut memori locat each
block is label by a codeword and mai contain a
program a data vector or codeword which in turn label
block to form arrai thi storag arrang is discuss with
it realiz advantag or program system simplic of program address
flexibl of data structur effici of memori util variabl of
system composit dure execut mean of linkag between program and
from program to data and basi for storag protect the
applic of label block mai be extend to area of
time share and multimedia storag control on the basi of
experi at rice some idea on such extens ar present
cacm novemb 1968 jodeit j g storag alloc storag organ
storag control codeword data represent program represent data structur storag
protect address mechan page segment file handl 4 30 4
40 6 20 ca681102 jb februari 21 1978 3 11
pm 1677 5 1677 1677 5 1677 1677 5 1677
2064 5 1677 1677 6 1677 
# 1678
automata formal languag abstract switch and comput in a ph
comput scienc program a number of cours ar list in
the area describ as automata formal languag abstract switch and
comput that might be avail to a ph student in
comput scienc a brief catalog descript of each cours is
appli and the role of each of the cours in
the graduat program is discuss cacm novemb 1968 mcnaughton r
ph comput scienc curriculum ph comput scienc program automata formal
languag switch theori theori of comput 1 5 5 2
6 1 ca681101 jb februari 21 1978 3 16 pm
1678 5 1678 1678 5 1678 1678 5 1678 3003
5 1678 1659 6 1678 1678 6 1678 1927 6
1678 1945 6 1678 2097 6 1678 2147 6 1678
2163 6 1678 2187 6 1678 2329 6 1678 2345
6 1678 2367 6 1678 2407 6 1678 2478 6
1678 2479 6 1678 2480 6 1678 2538 6 1678
# 1679
a fast fourier transform algorithm for real valu seri a
new procedur is present for calcul the complex discret fourier
transform of real valu time seri thi procedur is describ
for an exampl where the number of point in the
seri is an integr power of two thi algorithm preserv
the order and symmetri of the coolei turkei fast fourier
transform algorithm while effect the two to on reduct in
comput and storag which can be achiev when the seri
is real also discuss ar hardwar and softwar implement of
the algorithm which perform onli n 4 log2 n 2
complex multipli and add oper and which requir onli n
real storag locat in analyz each n point record cacm
octob 1968 bergland g d fast fourier transform time seri
analysi digit filter spectral analysi real time spectrum analyz fourier
analysi discret fourier transform digit spectrum analysi fourier analysi algorithm
fourier synthesi algorithm 3 80 3 81 4 9 5
49 6 22 ca681008 jb februari 21 1978 3 23
pm 1668 4 1679 1669 4 1679 1679 4 1679
1728 4 1679 2859 4 1679 1525 5 1679 1679
5 1679 1679 5 1679 1679 5 1679 2354 5
1679 1418 6 1679 1521 6 1679 1597 6 1679
1679 6 1679 2350 6 1679 2355 6 1679 
# 1680
a gener purpos displai process and tutori system adept a
displai expedit process and tutori system is describ thi system
wa design to improv man comput commun by emploi a
displai unit to interleav tutor with other comput oper such
as simul program and inform retriev it is written in
fortran iv g for the ibm system 360 model 40
and the ibm 2250 displai unit under oper system 360
adept is a catalog program that control the standard oper
system by termin and reschedul itself automat relinquish comput resourc
alloc to it and surrend control to the oper system
to perform other job it expand the power and flexibl
of comput assist instruct by make immedi avail to student
teacher and other user the full resourc system catalog program
of the oper system languag processor and compil simul model
mathemat solut techniqu store data and all other librari and
user program can be incorpor into instruct materi without reprogram
illustr of the variou applic ar present and their implic
ar discuss cacm octob 1968 engvold k j hugh j
l comput assist instruct tutori system program simul model inform
retriev oper system graphic displai man machin interfac on line
comput graphic program 1 5 3 3 3 5 3
8 4 0 4 3 ca681007 jb februari 21 1978
3 36 pm 1680 4 1680 1591 5 1680 1680
5 1680 1680 5 1680 1680 5 1680 
# 1681
easi english a languag for inform retriev through a remot
typewrit consol easi english is a natur command languag design
to simplifi commun between man and machin through remot typewrit
consol it ha been develop for retriev of document from
a computer data base the moor school inform system laboratori
file request ar formul in a standard syntact form exampl
of which ar present and thi form is then transform
into an equival queri express in the retriev system s
origin symbol command languag which is briefli describ oper of
easi english is detail by illustr of the transform perform
upon a sampl request up to the point at which
the request string is sent to the system a macro
flowchart of easi english is includ and an appendix provid
the printout of a retriev demonstr cacm octob 1968 rubinoff
m bergman s cautin h rapp f natur languag commun
on line search remot consol commun inform retriev man machin
commun remot termin commun translat document retriev convers mode inform
retriev languag symbol command languag 3 74 3 81 4
19 ca681006 jb februari 21 1978 3 59 pm 1681
4 1681 1699 4 1681 1194 5 1681 1681 5
1681 1681 5 1681 1681 5 1681 1699 5 1681
1194 6 1681 1324 6 1681 1681 6 1681 
# 1682
the implement of a basic system in a multiprogram environ
the implement of a remot termin basic system within the
context of an exist multiprogram comput system the burrough b5500
is describ thi implement combin a uniqu mixtur of machin
languag and interpret techniqu with an increment compil cacm octob
1968 braden h v wulf w a multiprogram increment compil
compil interpret 4 1 4 12 4 2 4 22
4 3 4 32 ca681005 jb februari 21 1978 4
04 pm 1215 4 1682 1676 4 1682 1682 4
1682 1682 4 1682 1728 4 1682 1860 4 1682
1973 4 1682 2018 4 1682 2032 4 1682 2033
4 1682 2107 4 1682 2109 4 1682 2203 4
1682 2251 4 1682 2359 4 1682 2524 4 1682
2543 4 1682 2552 4 1682 2559 4 1682 2991
4 1682 3053 4 1682 1025 5 1682 1682 5
1682 1682 5 1682 1682 5 1682 1785 5 1682
2874 5 1682 1682 6 1682 2227 6 1682 2317
6 1682 2683 6 1682 2871 6 1682 521 6
1682 
# 1683
boolean matrix method for the detect of simpl preced grammar
a mechan procedur is deriv for determin whether a given
context free phrase structur grammar is a simpl preced grammar
thi procedur consist of elementari oper on suitabl defin boolean
matric applic of the procedur to oper grammar is also
given cacm octob 1968 martin d f syntax analysi preced
analysi simpl preced grammar simpl preced languag oper grammar oper
preced compil bound context syntact analysi boolean matric relat 4
12 5 23 ca681004 jb februari 21 1978 4 09
pm 1496 4 1683 1542 4 1683 1683 4 1683
1683 4 1683 1693 4 1683 1768 4 1683 1781
4 1683 1787 4 1683 1787 4 1683 1836 4
1683 1945 4 1683 1945 4 1683 2060 4 1683
2061 4 1683 2061 4 1683 2082 4 1683 2091
4 1683 2152 4 1683 2179 4 1683 2340 4
1683 2356 4 1683 2546 4 1683 2603 4 1683
2698 4 1683 2708 4 1683 2824 4 1683 2982
4 1683 2986 4 1683 3045 4 1683 3093 4
1683 1141 5 1683 1491 5 1683 1683 5 1683
1683 5 1683 1683 5 1683 2221 5 1683 2340
5 1683 2824 5 1683 2986 5 1683 1191 6
1683 1491 6 1683 1491 6 1683 1491 6 1683
1683 6 1683 1683 6 1683 1683 6 1683 1683
6 1683 1836 6 1683 1836 6 1683 2053 6
1683 2179 6 1683 2340 6 1683 2340 6 1683
# 1684
ambigu in limit entri decis tabl the us of decis
tabl as a tool in system analysi and for program
specif is now becom accept rule on redund contradict and
complet for limit entri tabl were publish in 1963 these
ar usual us for check preced if necessari by a
convers from extend to limit entri form processor which automat
translat tabl to more convent program usual base their diagnost
facil on these rule in thi paper it is suggest
that these rule ar unsatisfactori and that the import aspect
of check is to elimin ambigu from tabl ambigu is
defin and discuss and a procedur for produc check out
decis tabl is propos the theoret basi of the algorithm
us is establish the import of well design diagnost facil
in decis tabl processor is emphas cacm octob 1968 king
p j h decis tabl detab 65 system analysi 3
50 4 19 4 49 ca681003 jb februari 21 1978
4 17 pm 1684 4 1684 1684 4 1684 2053
4 1684 2220 4 1684 2273 4 1684 2453 4
1684 2726 4 1684 2856 4 1684 3113 4 1684
1354 5 1684 1564 5 1684 1684 5 1684 1684
5 1684 1684 5 1684 2053 5 1684 2517 5
1684 2518 5 1684 2616 5 1684 3034 5 1684
931 6 1684 1172 6 1684 1237 6 1684 1327
6 1684 1354 6 1684 1548 6 1684 1548 6
1684 1684 6 1684 1684 6 1684 1684 6 1684
1684 6 1684 1684 6 1684 2053 6 1684 2053
6 1684 2221 6 1684 2517 6 1684 2517 6
1684 
# 1685
gan a system for gener and analyz activ network gan
a system for gener activ network is design to save
time in the prepar of activ network and to deal
conveni with network program a defin descript of a program
languag design for gener activ network from a set of
standard network is present also a gener idea of a
languag for perform calcul on activ network schedul activ network
is given cacm octob 1968 schurmann a activ network manag
project standard network network gener network assembl activ network analysi
network calcul network program 3 50 3 53 4 11
4 12 4 29 ca681002 jb februari 21 1978 4
22 pm 1685 4 1685 1685 5 1685 1685 5
1685 1685 5 1685 3059 5 1685 
# 1686
comput synthesi of hologram for 3 d displai optic and
digit holographi ar review the mathemat model and comput techniqu
of the author digit holograph process ar discuss and applic
of comput holographi ar suggest comput hologram have been made
of three dimension object which give faith reconstruct even in
white light a new approach base on point apertur for
the imag is discuss photograph of the imag reconstruct from
digit hologram ar present cacm octob 1968 lesem l b
hirsch p m holographi optic fourier transform comput applic displai
devic photographi physic mathemat imag process 3 17 3 19
5 19 ca681001 jb februari 21 1978 4 27 pm
1686 5 1686 1686 5 1686 1686 5 1686 2004
5 1686 1686 6 1686 1915 6 1686 
# 1687
netflow algorithm 248 h cacm septemb 1968 brai t a
witzgal c capacit network linear program minimum cost flow network
flow out of kilter 5 32 5 41 ca680914 jb
februari 21 1978 4 29 pm 1687 5 1687 1687
5 1687 1687 5 1687 
# 1688
netflow algorithm 248 h cacm septemb 1968 henderson j h
capacit network linear program minimum cost flow network flow out
of kilter 5 32 5 41 ca680913 jb februari 21
19784 31 pm 1688 5 1688 1688 5 1688 1688
5 1688 
# 1689
calcul of a polynomi and it deriv valu by horner
scheme algorithm 337 c1 cacm septemb 1968 pankiewicz w function
evalu polynomi evalu algol procedur horner s scheme 5 12
4 22 ca680912 jb februari 21 1978 4 33 pm
1689 5 1689 1689 5 1689 1689 5 1689 
# 1690
netflow algorithm 336 h cacm septemb 1968 brai t a
witzgal c capacit network linear program minimum cost flow network
flow out of kilter 5 32 5 41 ca680911 jb
februari 21 1978 4 35 pm 1690 4 1690 1322
5 1690 1690 5 1690 1690 5 1690 1690 5
1690 
# 1691
a comparison of the correl behavior of random number gener
for the ibm 360 hutchinson state that the new prime
modulo multipl congruenti pseudorandom gener attribut to d h lehmer
ha pass the usual statist test for random number gener
it is here empir shown that gener of thi type
can produc sequenc whose autocorrel function up to lag 50
exhibit evid of nonrandom for mani multipl constant an altern
gener propos by tausworth which us irreduc polynomi over the
field of characterist two is shown to be free from
thi defect the applic of these two gener to the
ibm 360 is then discuss sinc comput word size can
affect a gener s statist behavior the older mix and
simpl congruenti gener although extens test on comput have 36
or more bit per word mai not be optimum gener
for the ibm 360 cacm septemb 1968 whittlesei j r
random number pseudorandom number gener autocorrel function serial correl digit
shift regist gener linear recurr modulo two irreduc polynomi primit
trinomi modulo two congruenti gener prime number statist test for
random ibm 360 32 bit versu 36 bit word size
5 5 ca680910 jb februari 21 1978 4 44 pm
1674 4 1691 1691 4 1691 1691 4 1691 1691
4 1691 1293 5 1691 1420 5 1691 1631 5
1691 1691 5 1691 1691 5 1691 1691 5 1691
2115 5 1691 2122 5 1691 1674 6 1691 1691
6 1691 1691 6 1691 1930 6 1691 
# 1692
numer solut of a thin plate heat transfer problem the
numer solut of a system of linear equat result from
a discret approxim to a thin plate heat transfer problem
is consid the slow converg of point iter method is
analyz and shown to be caus by on of the
boundari condit the difficulti mai be remov by a standard
line iter techniqu cacm septemb 1968 stewart iii g lick
d w heat transfer problem poisson equat boundari valu problem
thin domain success overrelax sor block sor 3 20 5
17 ca680909 jb februari 21 1978 4 48 pm 1692
5 1692 1692 5 1692 1692 5 1692 
# 1693
gpl a truli gener purpos languag a truli gener purpos
program languag gpl is describ which contain facil for construct
within the languag new data type as well as facil
for oper perform upon them the basic languag is minim
in the sens that no basic element can be deriv
from the other with high effici in the object program
construct like the algol 60 for statement and if statement
ar not basic thei ar special type of procedur new
symbol underlin word in algol 60 ar implicitli defin by
usag in other declar as part word ar defin pack
word ar handl as easili as full word address variabl
pointer ar includ in full gener cacm septemb 1968 garwick
j v program languag gener purpos self extend macro algol
4 20 ca680908 jb februari 22 1978 8 40 am
1379 4 1693 1380 4 1693 1542 4 1693 1552
4 1693 1683 4 1693 1693 4 1693 1693 4
1693 1693 4 1693 1693 4 1693 1781 4 1693
1781 4 1693 1781 4 1693 1781 4 1693 1787
4 1693 1824 4 1693 1836 4 1693 1836 4
1693 1854 4 1693 1860 4 1693 1861 4 1693
1945 4 1693 1945 4 1693 2015 4 1693 2060
4 1693 2060 4 1693 2060 4 1693 2061 4
1693 2061 4 1693 2082 4 1693 2091 4 1693
2091 4 1693 2126 4 1693 2152 4 1693 2179
4 1693 2179 4 1693 2340 4 1693 2356 4
1693 2546 4 1693 2546 4 1693 2603 4 1693
2698 4 1693 2698 4 1693 2708 4 1693 2708
4 1693 2824 4 1693 2982 4 1693 2986 4
1693 557 4 1693 3045 4 1693 3045 4 1693
3093 4 1693 1421 5 1693 1477 5 1693 1491
5 1693 1614 5 1693 1693 5 1693 1693 5
1693 1693 5 1693 2126 5 1693 2317 5 1693
823 6 1693 196 6 1693 1198 6 1693 1572
6 1693 1614 6 1693 1693 6 1693 1693 6
1693 1749 6 1693 1753 6 1693 1781 6 1693
2126 6 1693 2148 6 1693 404 6 1693 
# 1694
an algorithm for the probabl of the union of a
larg number of event an algorithm is present which effici
evalu the probabl for the union of n independ and
not mutual exclus event the problem is that of evalu
the sum of the product of all possibl combin of
n variabl in minimum time and storag space cacm septemb
1968 miller g d algorithm probabl optimum storag vs time
compromis set union mutual exclus event 5 12 5 5
5 6 ca680907 jb februari 22 1978 8 45 am
1694 5 1694 1694 5 1694 1694 5 1694 
# 1695
plexu an on line system for model neural network a
descript is present of plexu a system which enabl a
user to construct and specifi a neural network to analyz
the output data produc by the network and to store
and retriev network and data from a librari the system
oper entir from a digit displai unit interact directli with
the user and permit easi and rapid transit between the
variou phase of the model process plexu is design to
complement neurophysiolog research so that the systemat develop of neural
model can be coordin with experiment work plexu network ar
built up from compon repres individu neuron extern stimuli and
interconnect fiber each compon be of a rel detail natur
provis is also made for the us of experiment data
as input to a network conveni mean for specif and
modif of a network and extens error check capabl ar
provid data result from the simul of a network mai
be analyz by a varieti of techniqu rang from examin
of the gross characterist of the data to the determin
of detail statist properti cacm septemb 1968 dill j c
randal d l richer i biolog model data analysi discret
system simul librari system model network simul neural network neurophysiolog
model on line simul simul 3 12 3 19 3
29 3 65 ca680906 jb februari 22 1978 8 56
am 1695 5 1695 1695 5 1695 1695 5 1695
# 1696
an algorithm for identifi the ergod subchain and transient state
of a stochast matrix an algorithm for identifi the ergod
subchain and transient state of a stochast matrix is present
applic in markov renew program and in the construct of
variabl length code ar review and an updat procedur for
deal with certain sequenc of stochast matric is discuss comput
time ar investig experiment and compar with those of anoth
recent propos method cacm septemb 1968 fox b l landi
d m stochast matrix ergod chain identif 5 39 5
5 ca680905 jb februari 22 1978 9 04 am 1696
5 1696 1696 5 1696 1696 5 1696 
# 1697
graphic input output of nonstandard charact a system develop at
harvard for graphic input and output nonstandard charact on a
comput is print in principl the system can deal with
ani orthographi although at present it is limit to 4000
chines charact and some mathemat symbol new charact can be
ad to the repertoir of the system by graphic input
on a displai scope text input is accomplish via a
displai scope or a rand tablet the organ and oper
of the current system ar describ and a discuss of
the rel merit of such a system is given illustr
of the comput input and output of chines charact ar
includ cacm septemb 1968 hayashl h duncan s kuno s
chines charact input output orthographi rand tablet pdp 1 automat
typeset man machin commun comput graphic graphic input on line
edit 3 40 4 41 ca680904 jb februari 22 1978
9 13 am 1697 4 1697 1528 5 1697 1659
5 1697 1697 5 1697 1697 5 1697 1697 5
1697 1225 6 1697 1265 6 1697 1350 6 1697
1671 6 1697 1697 6 1697 
# 1698
a statist model for consol behavior in multius comput the
abil of a comput system to commun with the outsid
world effici is as import as it abil to perform
comput effici it is quit difficult to character a particular
user but rather easi to character the entir user commun
base on the properti of thi commun we have postul
a hypothet virtual consol no claim is made that a
virtual consol behav like ani actual consol but the entir
collect of virtual consol model the collect of actual consol
us the model we answer question like how mani process
ar suspend wait for consol input what is the maximum
rate at which a process can execut what bound can
be set on overal buffer requir answer to these and
similar question ar need in certain aspect of oper system
design cacm septemb 1968 den p j statist model for
input output oper system design input output design 4 30
4 41 5 5 ca680903 jb februari 22 1978 9
21 am 1458 4 1698 1523 4 1698 1603 4
1698 1698 4 1698 1747 4 1698 1748 4 1698
1854 4 1698 1877 4 1698 1960 4 1698 2377
4 1698 2378 4 1698 2497 4 1698 2558 4
1698 2625 4 1698 2632 4 1698 2840 4 1698
2941 4 1698 3105 4 1698 3144 4 1698 1471
5 1698 1698 5 1698 1698 5 1698 1698 5
1698 
# 1699
experiment evalu of inform retriev through a teletypewrit experi design
to evalu the capabl of mechan inform retriev system with
emphasi on interact man machin languag and on some of
the mechan and psycholog limit in their design were conduct
at the moor school inform system laboratori the basic assumpt
of the research is that an inform retriev system that
provid for man machin dialogu at a remot inquiri termin
should provid a searcher with mani of the tool which
would be avail to him were he actual perform hi
search at a librari or repositori of document factor involv
in evalu of such a system includ eas of us
learn time and effect of actual retriev three experi and
the conclus result from them ar detail cacm septemb 1968
rubinoff m bergman s frank w rubinoff e inform retriev
test inform system evalu experiment document retriev document retriev document
perus man machin commun remot consol commun teletypewrit commun remot
termin commun retriev command languag symbol command languag interact system
user learn factor on line search 3 72 3 74
3 79 3 81 ca680902 jb februari 22 1978 9
30 am 1155 4 1699 1456 4 1699 1468 4
1699 1515 4 1699 1681 4 1699 1699 4 1699
1699 4 1699 1699 4 1699 1856 4 1699 2127
4 1699 1194 5 1699 1324 5 1699 1681 5
1699 1699 5 1699 1699 5 1699 1699 5 1699
# 1700
peekabit comput offspr of punch card peekaboo for natur languag
search the peekaboo idea from punch card inform retriev method
ha been mate with the idea of superimpos punch to
produc a program techniqu which cut comput run time in
half on a test search of 33 000 subject index
entri a search program us the devic ha been oper
sinc late 1963 as an item is enter in the
store an 18 byte mask is creat from the item
s meaning word us the inclus or oper if at
search time the logic product us the and oper of
thi mask and a similarli construct question mask is not
equal to the question mask then on or more question
word ar not present in the store item an equal
is in conclus the word of the store item must
be unpack and compar with question word the present store
is made up of over 600 000 subject index entri
estim to averag 60 charact each longer text such as
abstract could be handl by multipl mask cacm septemb 1968
hutton f c peekaboo superimpos code natur languag search text
search inform compact comput search techniqu 3 74 ca680901 jb
februari 22 1978 9 38 am 1700 5 1700 1700
5 1700 1700 5 1700 
# 1701
synchron signal rate for data transmiss propos usa standard cacm
august 1968 ca680813 jb februari 22 1978 9 41 am
1701 5 1701 1701 5 1701 1701 5 1701 
# 1702
commentari on mr mooer paper cacm august 1968 steel jr
t b ca680812 jb februari 22 1978 9 42 am
1702 5 1702 1702 5 1702 1702 5 1702 
# 1703
accommod standard and identif of program languag the user public
want standard and reliabl identif of program languag and relat
servic on wai of achiev these goal illustr by the
method adopt for trac t 64 interact languag and it
relat famili of languag oppress rigid usual associ with standard
is avoid by a new accommod techniqu access to the
user to allow local variat with the languag explicit standard
of the languag is undertaken at the organiz sourc of
the languag us of the organiz trademark trac on the
publish standard and servic reli upon them provid a reliabl
public identif these method can be usefulli appli to other
program languag and comput servic cacm august 1968 mooer c
n standard program languag trac t 64 languag tranemark public
identif of program languag standard which accommod 2 12 4
2 2 9 ca680811 jb februari 22 1978 9 50
am 1530 4 1703 1531 4 1703 1565 4 1703
1703 4 1703 1945 4 1703 2036 4 1703 1455
5 1703 1703 5 1703 1703 5 1703 1703 5
1703 
# 1704
minimum excess cost curv algorithm 217 h cacm august 1968
muth j f critic path schedul pert cost time tradeoff
network flow 3 59 5 41 ca680810 jb februari 22
1978 9 52 am 1704 5 1704 1704 5 1704
1704 5 1704 
# 1705
a set of basic input output procedur algorithm 335 15
by mean of the primit in symbol outsymbol and length
as request by thi journal s algorithm polici comm acm
10 nov 67 729 a basic set of input output
procedur is defin aim at qualiti and flexibl outreal for
instanc is written as a deriv procedur it output us
the fix point or the float point represent and round
properli variant can easili be written becaus of the explicit
call of the procedur decompos integ and decompos real the
highli recommend practic of echo input is made easi with
on subset of deriv procedur ioi ior iob ioa the
document of output in the form of equival algol statement
is also provid when us is made of the subset
oti otr otb ota the berkelei style of provid inform
on the form of output us prior call of procedur
such as real format is defin a us of the
paramet outchannel to provid inform for simultan output to sever
channel is suggest interrelationship between the declar procedur is furnish
in tabular form cacm august 1968 de vogelaer r input
output transput input output procedur input echo qualiti output decompos
integ decompos real style berkelei style procedur relationship output document
equival algol statement algol algol 60 integ format real format
out integ read real input output boolean input output arrai
fix point represent float point represent output channel interpret 4
0 4 41 ca680809 jb februari 22 1978 10 32
am 1705 4 1705 1705 4 1705 1705 4 1705
1705 4 1705 1945 4 1705 2034 4 1705 984
5 1705 986 5 1705 1020 5 1705 1321 5
1705 1705 5 1705 1705 5 1705 1705 5 1705
# 1706
champ charact manipul procedur a new program languag facil for
symbol manipul is describ string procedur mai be declar and
call in a standard algol context algol procedur can in
turn be call by string procedur so that numer and
symbol process mai conveni be program togeth concaten and a
variant of snobol s pattern match make up a set
of primit command these ar assembl togeth into condit express
which ar to be us to provid altern comput pattern
arrai of string ar process us quantifi the class of
thing which mai be assign to an identifi can be
restrict by a procedur express in the notat the languag
facil have been implement in the algol compil for the
burrough b5500 cacm august 1968 storm e f symbol manipul
string handl charact manipul condit express procedur structur match recurs
program quantifi 4 22 4 13 ca680808 jb februari 22
1978 10 39 am 1024 4 1706 1051 4 1706
1102 4 1706 1132 4 1706 1390 4 1706 1395
4 1706 1486 4 1706 1549 4 1706 1706 4
1706 1706 4 1706 1826 4 1706 1878 4 1706
378 4 1706 2060 4 1706 2155 4 1706 2168
4 1706 2719 4 1706 2723 4 1706 2838 4
1706 2842 4 1706 2855 4 1706 2879 4 1706
3077 4 1706 3080 4 1706 3106 4 1706 627
4 1706 106 4 1706 1180 5 1706 210 5
1706 1706 5 1706 1706 5 1706 1706 5 1706
# 1707
gener of posit test matric with known posit spectra suffici
condit ar given for a real matrix to be similar
to a posit matrix thi result is us to construct
a similar transform which when appli to a particular upper
triangular matrix yield a posit matrix with a preassign posit
spectrum cacm august 1968 hall c a porsch t a
test matric posit matric similar transform posit eigenvalu 5 1
5 14 ca680807 jb februari 22 1978 10 42 am
1707 4 1707 1707 4 1707 1047 5 1707 1707
5 1707 1707 5 1707 1707 5 1707 1876 5
1707 2099 5 1707 511 5 1707 1662 6 1707
1707 6 1707 1707 6 1707 
# 1708
a note on the effici of a lisp comput in
a page machin the problem of the us of two
level of storag for program is explor in the context
of a lisp system which us core memori as a
buffer for a larg virtual memori store on a drum
detail of time ar given for on particular problem cacm
august 1968 borrow d g murphi d l storag manag
list processor implement lisp page secondari storag util effici of
page comput 3 7 4 1 4 2 ca680806 jb
februari 22 1978 10 45 am 1626 4 1708 1708
4 1708 1708 4 1708 1781 4 1708 1781 4
1708 1826 4 1708 1860 4 1708 1860 4 1708
2156 4 1708 2168 4 1708 2249 4 1708 2299
4 1708 2314 4 1708 2719 4 1708 2736 4
1708 2833 4 1708 1626 5 1708 1641 5 1708
1708 5 1708 1708 5 1708 1708 5 1708 2249
5 1708 1626 6 1708 1708 6 1708 1853 6
1708 
# 1709
a modif of efroymson s techniqu for stepwis regress analysi
the comput techniqu convention us for stepwis multipl linear regress
requir the storag of an n x n matrix of
data when the number of variabl n is larg thi
requir tax the storag capac of present us machineri the
near symmetri of the matric involv permit a modif requir
onli half the storag and comput of the convent algorithm
and thi addit storag allow the analysi of problem contain
more variabl altern it permit the analysi of problem contain
the same number of variabl but with all comput perform
in doubl precis cacm august 1968 breaux h j multipl
linear regress statist recurr formula correl linear statist model statist
comput program curv fit 4 0 4 40 5 0
5 5 5 10 5 13 ca680805 jb februari 22
1978 10 52 am 1709 5 1709 1709 5 1709
1709 5 1709 
# 1710
asp a ring implement associ structur packag asp is a
gener purpos associ data structur packag in which an arbitrari
number of data item and an arbitrari number of the
relationship between these data item mai be repres a special
pictur languag is describ which ha prove veri us for
draw asp structur on paper asp structur ar built and
manipul by mean of a seri of macro call which
ar outlin in the appendix emphasi is on the philosophi
of the system rather than a particular implement though suffici
inform is includ to enabl the reader to produc hi
own implement of asp cacm august 1968 lang c a
grai j c associ data structur ring structur list list
structur set languag model graphic 4 20 4 22 ca680804
jb februari 22 1978 11 02 am 1710 5 1710
1710 5 1710 1710 5 1710 1853 5 1710 2003
5 1710 1710 6 1710 1710 6 1710 1767 6
1710 2105 6 1710 
# 1711
when your comput need a lawyer possibl liabil for neglig
for other tort such as slander of credit and for
liabil under theori of express or impli warranti guarante ar
discuss and legal complic ar explain so that user oper
owner and leasor of comput mai be alert to potenti
legal problem focu is also on troubl spot in contract
for data process servic in autom record keep oper in
decid whether or not to autom certain oper and in
compli with statut and regul relat to record keep inform
is given on patent copyright and trade secret protect for
program and the problem of us copyright materi in inform
storag and retriev system includ the pend copyright and patent
revis bill cacm august 1968 banzhaf iii j f law
legal lawyer liabil tort neglig contract warrante guarante account regul
simul incom tax copyright patent trade secret standard of care
slander of credit crime crimin record keep record evid copi
1 3 2 11 2 12 2 2 3 33
ca680803 jb februari 22 1978 11 12 am 1711 4
1711 1711 4 1711 997 5 1711 1001 5 1711
1711 5 1711 1711 5 1711 1711 5 1711 
# 1712
recoveri of disk content after system failur a method is
discuss by which after a system malfunct the content of
disk file can be restor to their statu at the
time of the failur cacm august 1968 lockemann p c
knutsen w d data acquisitit disk file organ error recoveri
file organ 3 73 ca680802 jb februari 22 1978 11
14 am 1712 4 1712 1507 5 1712 1712 5
1712 1712 5 1712 1712 5 1712 3164 5 1712
1712 6 1712 
# 1713
on overcom high prioriti paralysi in multiprogram system a case
hi tori high prioriti paralysi is the degrad that can
occur in multiprogram system when schedul is base primarili on
preassign prioriti it can be allevi by modifi the schedul
algorithm to maxim the number of program activ at on
time the case hi tori given in thi paper indic
two gener method by which simultan can be increas possibl
refin in the schedul algorithm for futur improv ar consid
briefli cacm august 1968 steven d f multiprogram schedul dynam
prioriti assign schedul 4 30 4 32 4 39 ca680801
jb februari 22 1978 11 19 am 1713 4 1713
1713 4 1713 1901 4 1713 1901 4 1713 491
4 1713 491 4 1713 168 5 1713 185 5
1713 1713 5 1713 1713 5 1713 1713 5 1713
3072 5 1713 1713 6 1713 2219 6 1713 2245
6 1713 2375 6 1713 
# 1714
procedur for the normal distribut algorithm 272 s15 cacm juli
1968 maclaren m d normal distribut function error function normal
function normal curv integr 5 5 5 12 ca680715 jb
februari 22 1978 11 21 am 1714 4 1714 1585
5 1714 1714 5 1714 1714 5 1714 1714 5
1714 
# 1715
direct search algorithm 178 e4 cacm juli 1968 de vogelaer
r function minim search direct search 5 19 ca680714 jb
februari 22 1978 11 24 am 1715 5 1715 1715
5 1715 1715 5 1715 1815 5 1715 1715 6
1715 
# 1716
normal random deviat algorithm 334 g5 cacm juli 1968 bell
j r normal deviat normal distribut random number random number
gener simul probabl distribut frequenc distribut random 5 5 5
13 ca680713 jb februari 22 1978 11 26 am 1716
4 1716 1189 5 1716 1716 5 1716 1716 5
1716 1716 5 1716 2349 5 1716 2565 5 1716
1648 6 1716 1716 6 1716 1716 6 1716 1794
6 1716 1894 6 1716 2043 6 1716 2276 6
1716 501 6 1716 613 6 1716 774 6 1716
# 1717
gener prime implic via ternari encod and decim arithmet decim
arithmet ternari encod of cube and topolog consider ar us
in an algorithm to obtain the extrem and prime implic
of boolean function the algorithm which ha been program in
the fortran languag gener requir less memori than other minim
procedur and treat don t care term in an effici
manner cacm juli 1968 dietmey d l dulei j r
prime implic extrem switch function minim cubic complex ternari encod
3 24 6 1 ca680712 jb februari 22 1978 11
30 am 1717 5 1717 1717 5 1717 1717 5
1717 
# 1718
logic arithmet on comput with two s complement binari arithmet
algorithm ar present for multipl and divis of unsign integ
operand in which the digit normal reserv for sign particip
as signific arithmet digit with posit weight cacm juli 1968
ehrman j r binari arithmet unsign operand arithmet maximum signific
arithmet full precis arithmet 3 15 5 11 ca680711 jb
februari 22 1978 11 34 am 1718 5 1718 1718
5 1718 1718 5 1718 1965 5 1718 2200 5
1718 1718 6 1718 1718 6 1718 
# 1719
a methodolog for calcul and optim real time system perform
the continu increas size complex number of type and cost
of data process system ar caus seriou re examin within
govern and industri of the criteria for and method of
calcul and optim data process system cost and perform real
time data process system as typifi by the autom airlin
reserv system ar discuss in thi paper criteria for evalu
perform ar describ a methodolog for calcul and optim is
outlin and the method is illustr by carri out a
portion of the perform calcul and the optim of a
drum orient messag switch system cacm juli 1968 stimler s
bron k a real time system analysi real time system
design real time system perform criteria real time system cost
perform ratio 3 27 3 80 3 81 3 89
6 9 ca680710 jb februari 22 1978 11 40 am
1719 5 1719 1719 5 1719 1719 5 1719 2319
5 1719 1408 6 1719 1719 6 1719 1749 6
1719 1751 6 1719 2016 6 1719 2017 6 1719
2080 6 1719 2188 6 1719 2203 6 1719 2204
6 1719 
# 1720
master s level comput scienc curricula the result of a
survei of the cours work done by master s degre
candid at 25 us univers ar present and some gener
comment concern the emphasi of these program ar given cacm
juli 1968 elliott r w survei educ comput scienc curricula
1 52 ca680709 jb februari 22 1978 11 44 am
1720 4 1720 1720 4 1720 1771 4 1720 1927
4 1720 2147 4 1720 2163 4 1720 2345 4
1720 2478 4 1720 2594 4 1720 2852 4 1720
2899 4 1720 3130 4 1720 1654 5 1720 1720
5 1720 1720 5 1720 1720 5 1720 1771 5
1720 2163 5 1720 1720 6 1720 1771 6 1720
1927 6 1720 2181 6 1720 
# 1721
determin of the intersect point of two plane curv by
mean of differenti equat a new method is propos to
calcul the intersect point of two plane curv the theori
of singular point off a system of two differenti equat
is us in develop the method the intersect point to
be determin is identifi with such a singular point and
appropri modif ar appli to the system to ensur that
the singular point be stabl i e all integr which
start in the neighborhood of the singular point will alwai
approach thi point if the integr paramet tend to infin
in addit a method is describ for systemat search for
all intersect point in a prescrib rectangular area cacm juli
1968 kuiken h k plane curv intersect point intersect plane
curv integr differenti equat matrix iter singular point nonlinear differenti
equat eigenvalu complex root root stationari point rung kutta stabl
singular unstabl singular 2 0 3 10 3 20 3
50 5 10 ca680708 jb februari 22 1978 11 51
am 1721 5 1721 1721 5 1721 1721 5 1721
# 1722
method of converg improv for some improp integr in the
numer integr of an improp integr of the first kind
it is customari to truncat the integr when the chang
yield by the last iter is less than some predetermin
constant the effici of such integr scheme can often be
improv by us of recent advanc in the theori of
nonlinear transform howev for sever import integr e g integr
whose integrand ar ration polynomi these transform fail to yield
much improv in thi paper sever method of converg improv
ar develop which greatli improv converg of some improp integr
includ the integr of ration polynomi cacm juli 1968 mcwilliam
g v thompson r w approxim nonlinear improp integr converg
improv numer integr ration polynomi truncat 3 15 5 13
5 16 5 19 ca680707 jb februari 22 1978 11
58 am 1722 5 1722 1722 5 1722 1722 5
1722 
# 1723
comput construct of project network project network ar us in
pert and cpm an algorithm is given for construct project
network directli from the project preced relat the algorithm creat
dummi activ and topolog order the arc and node the
number of node creat is minim for the given preced
relat it ha been experiment program in fortran ii for
the ibm 7094 cacm juli 1968 fisher a c liebman
j s nemhaus g l project network pert cpm topolog
order network construct by comput 5 32 ca680706 jb februari
22 1978 12 07 pm 1723 4 1723 758 4
1723 1723 5 1723 1723 5 1723 1723 5 1723
2515 5 1723 441 5 1723 1723 6 1723 
# 1724
a gener partial pass block sort the design of a
partial pass block sort with arbitrari rang of kei and
number of work file is describ the design is a
gener of the partial pass column sort by ashenhurst and
the amphisbaen sort by nagler the power of the sort
is tabul for variou size of input file and number
of work file consider is given to the problem of
combin a block sort with intern sort and to the
best us of direct access storag devic cacm juli 1968
bay a block sort partial pass sort direct access devic
column sort chain revers chain sort amphisbaen 5 31 ca680705
jb februari 22 1978 12 12 pm 1724 5 1724
1724 5 1724 1724 5 1724 
# 1725
a simpl proof of lewin s order retriev theorem for
associ memori an effici method of order retriev of binari
word from an associ memori as describ by lewin is
base on the us of special readout circuit which indic
the digit valu present in the individu digit column of
the memori thu the circuit indic whether the individu digit
column contain digit of both valu or of onli on
valu or contain no digit at all i e that
the memori is empti the us of these circuit which
in thi paper ar term column valu indic reduc consider
the number of memori access necessari to retriev in order
a number of distinct word from the memori lewin prove
that for the readout by the describ method of m
distinct binari word 2m 1 memori access ar necessari thu
he prove that the number of necessari memori access of
hi method unlik those of other method is independ of
the word length in thi paper a veri simpl proof
of thi theorem deriv from some elementari aspect of the
structur of set of binari number is present cacm juli
1968 wolinski a associ memori content address memori order list
order inform retriev order retriev theorem column digit valu digit
valu varieti column sens arrang digit valu readout digit varieti
readout memori access memori access frequenc order retriev effici access
frequenc proof retriev theorem proof 3 74 3 79 5
29 5 31 6 31 6 36 ca680704 jb februari
22 1978 12 24 pm 1725 5 1725 1725 5
1725 1725 5 1725 
# 1726
preliminari investig of techniqu for autom read of unformat text
method for convert unstructur print materi into comput code ar
experiment investig an oper control mode depend on human demarc
of the variou region of the page for guid the
scanner is implement by mean of a joystick and a
crt displai thi mode for which some perform figur ar
obtain is thought to be suitabl for process veri complic
materi such as technic journal for simpler materi for instanc
the claim section of patent and in applic where the
utmost accuraci is not necessari an unsupervis mode is advoc
here the textual portion of the page ar locat dure
a rapid prescan by a rudimentari form of frequenc analysi
these area ar then rescan at a higher resolut suitabl
for charact recognit error rate of the order of 0
1 percent ar obtain in a simpl problem involv photograph
of telephon compani meter board other matter relat to the
design of a gener purpos page reader such as the
segment of print text the possibl of time share the
scanner interact man machin oper and the facsimil reproduct of
illustr ar discuss cacm juli 1968 nagi g pattern recognit
charact recognit text read inform retriev unformat text oper control
reader onlin reader text imag discrimin read machin 3 63
3 79 3 89 6 29 6 35 ca680703 jb
februari 22 1978 2 52 pm 1726 5 1726 1726
5 1726 1726 5 1726 2370 5 1726 1726 6
1726 
# 1727
on wai of estim frequenc of jump in a program
for the segment of a program it is us to
have a reason estim of the valu of s ij
where s ij is the mean valu of the number
of jump from the i th instruct on to the
j th instruct in the run time in the case
where the s ij ar estim directli the structur of
the whole program must be gener taken into account therefor
it is veri difficult for the programm and or the
translat to obtain a good estim of the s ij
it is easier to estim not s ij but the
quantiti p ij s ij c i sum s ij
j 1 n where c i is an arbitrari posit
constant for each i although the p ij ar for
each i proport to s ij the estim of p
ij is easier becaus we must estim onli the probabl
of event where instruct i is execut after instruct i
i thi estim can often be done without consid the
structur of the whole program in the first part of
the paper us the theori of the markov chain an
algorithm for the comput of the s ij from the
p ij is found and some wai of obtain estim
of the p ij ar given in the second part
a variant of thi algorithm is deriv avoid the necess
of comput involv larg matric cacm juli 1968 kral j
object program reduct supervisor call decreas jump frequenc estim control
transfer estim optim program segment markov chain program correspond program
graph on entri subgraph local estim jump frequenc supervisor overhead
decreas program segment algorithm jump frequenc program segment problem 4
11 4 19 4 39 4 49 ca680702 jb februari
22 1978 3 05 pm 1727 5 1727 1727 5
1727 1727 5 1727 
# 1728
further experiment data on the behavior of program in a
page environ result ar summar from an empir studi direct
at the measur of program oper behavior in those multiprogram
system in which program ar organ into fix length page
the data collect from the interpret execut of a number
of page program ar us to describ the frequenc of
page fault i e the frequenc of those instant at
which an execut program requir a page of data or
instruct not in main core memori these data ar us
also for the evalu of page replac algorithm and for
assess the effect on perform of chang in the amount
of storag alloc to execut program cacm juli 1968 coffman
e g varian l c page system page dynam program
behavior program behavior virtual memori system singl level storag on
level storag oper system simul oper system supervisor simul machin
languag program interpret 4 13 4 32 4 39 4
9 ca680701 jb februari 22 1978 3 13 pm 1646
4 1728 1668 4 1728 1669 4 1728 1676 4
1728 1679 4 1728 1682 4 1728 1728 4 1728
1728 4 1728 1728 4 1728 1860 4 1728 1973
4 1728 2018 4 1728 2032 4 1728 2033 4
1728 2107 4 1728 2109 4 1728 2203 4 1728
2251 4 1728 2359 4 1728 2524 4 1728 2543
4 1728 2552 4 1728 2559 4 1728 2859 4
1728 2991 4 1728 3053 4 1728 1525 5 1728
1647 5 1728 1728 5 1728 1728 5 1728 1728
5 1728 1785 5 1728 1892 5 1728 1924 5
1728 2095 5 1728 2218 5 1728 2297 5 1728
2374 5 1728 2526 5 1728 2667 5 1728 2668
5 1728 2862 5 1728 2863 5 1728 1380 6
1728 1526 6 1728 1572 6 1728 1572 6 1728
1604 6 1728 1604 6 1728 1728 6 1728 1728
6 1728 1728 6 1728 1728 6 1728 1728 6
1728 1728 6 1728 1728 6 1728 1728 6 1728
1728 6 1728 1728 6 1728 1728 6 1728 1751
6 1728 1751 6 1728 1751 6 1728 1751 6
1728 1754 6 1728 1754 6 1728 1752 6 1728
1752 6 1728 1761 6 1728 1810 6 1728 1827
6 1728 1827 6 1728 1879 6 1728 1879 6
1728 1901 6 1728 1901 6 1728 2095 6 1728
2373 6 1728 2677 6 1728 2863 6 1728 
# 1729
minit algorithm for linear program algorithm 333 h cacm june
1968 salazar r c sen s linear program dual simplex
method primal problem dual problem 5 41 ca680616 jb februari
22 19783 15 pm 1729 5 1729 1729 5 1729
1729 5 1729 2784 5 1729 1729 6 1729 309
6 1729 2783 6 1729 
# 1730
jacobi polynomi algorithm 332 s22 cacm june 1968 witt b
f w jacobi polynomi orthogon polynomi three term recurr special
function 5 12 ca680615 jb februari 22 1978 3 17
pm 1730 5 1730 1730 5 1730 1730 5 1730
# 1731
gaussian quadratur formula algorithm 331 d1 cacm june 1968 gautschi
w quadratur gaussian quadratur numer integr weight function orthogon polynomi
5 16 ca680614 jb februari 22 1978 3 20 pm
1731 5 1731 1731 5 1731 1731 5 1731 
# 1732
factori analysi of varianc algorithm 330 g1 cacm june 1968
oliv i factori varianc analysi varianc statist analysi 5 5
ca680613 jb februari 22 1978 3 21 pm 1732 5
1732 1732 5 1732 1732 5 1732 
# 1733
distribut of indistinguish object into distinguish slot algorithm g6 cacm
june 1968 fenichel r r object distribut combin distribut number
5 39 ca680612 jb februari 22 1978 3 58 pm
1733 5 1733 1733 5 1733 1733 5 1733 
# 1734
chebyshev solut to an overdetermin linear system algorithm 328 f4
cacm june 1968 bartel r h goulub h g chebyshev
solut overdetermin linear system linear equat exchang algorithm 5 13
5 14 5 41 ca680611 jb februari 22 1978 4
01 pm 1734 5 1734 1734 5 1734 1734 5
1734 2143 5 1734 1734 6 1734 
# 1735
a futur market in comput time an auction method is
describ for alloc comput time that allow the price of
comput time to fluctuat with the demand and the rel
prioriti of user to be control so that more import
project get better access thi auction is free of the
period fluctuat in comput us often associ with monthli time
alloc scheme cacm june 1968 sutherland i e comput schedul
auction time alloc oper effici 2 40 ca680610 jb februari
22 1978 4 04 pm 1735 5 1735 1735 5
1735 1735 5 1735 2020 5 1735 1735 6 1735
# 1736
head format for data transmiss a usaai tutori standard cacm
june 1968 data transmiss head format head format messag format
data transmiss messag head 3 57 3 81 6 39
ca680609 jb februari 22 1978 4 07 pm 1736 5
1736 1736 5 1736 1736 5 1736 
# 1737
a global parser for context free phrase structur grammar cacm
june 1968 unger s h ca680608 jb februari 22 1978
4 08 pm 1737 5 1737 1737 5 1737 1737
5 1737 
# 1738
write an outlin debug program for the experienc user present
avail onlin debug routin ar often unsatisfactori for the experienc
user becaus thei requir unnecessarili rigid and complic type format
make it difficult for the user to correct type error
and consum excess memori with intric featur in a debug
program it is of prime import that the program be
simpl flexibl and highli effici to us commun between the
user and the debug program can be improv by us
certain techniqu applic to most onlin debug program these techniqu
ar present and ar illustr by their us in opak
octal packag a debug program code for the pdp 5
8 and the sd 930 the compromis between economi of
util program core storag and incorpor of eleg debug featur
is discuss cacm june 1968 bradi p t debug util
program program languag 4 42 ca680607 jb februari 22 1978
4 14 pm 1738 4 1738 1257 5 1738 1738
5 1738 1738 5 1738 1738 5 1738 
# 1739
regular express search algorithm a method for locat specif charact
string embed in charact text is describ and an implement
of thi method in the form of a compil is
discuss the compil accept a regular express as sourc languag
and produc an ibm 7094 program as object languag the
object program then accept the text to be search as
input and produc a signal everi time an embed string
in the text match the given regular express exampl problem
and solut ar also present cacm june 1968 thompson k
search match regular express 3 74 4 49 5 32
ca680606 jb februari 22 1978 4 18 pm 1739 5
1739 1739 5 1739 1739 5 1739 2545 5 1739
2746 5 1739 1665 6 1739 1739 6 1739 1739
6 1739 1781 6 1739 2139 6 1739 2341 6
1739 2545 6 1739 2786 6 1739 
# 1740
an inexpens braill termin devic the activ us of time
share facil for blind programm requir a braill termin system
detail ar given for the construct of a brailler from
a model 33 teletyp by modifi the print head and
increas the resili of the platen a descript of the
program need to drive the brailler is present cacm june
1968 anderson g b roger d w blind commun blind
program aid braill braill comput commun braill output braill teletyp
braill termin braill type head emboss tactil comput commun tactil
teletyp tactil termin 4 41 6 35 ca680605 jb februari
22 1978 4 23 pm 1264 4 1740 1740 4
1740 1099 5 1740 1740 5 1740 1740 5 1740
1740 5 1740 2279 5 1740 1740 6 1740 
# 1741
brad the brookhaven raster displai a multiconsol comput displai system
ha been design that provid veri rich displai at low
unit cost each brad brookhaven raster displai consol can plot
ten of thousand of point or up to 4000 charact
at 30 frame per second after an initi displai system
invest of 50 000 each displai with teletyp cost less
than 3 000 the techniqu emploi is that of programmat
gener a binari imag of the desir displai in a
comput the imag is written on a rotat drum memori
independ read head continu displai the pictur which is gener
by swept horizont line a standard tv monitor serv as
the displai devic the techniqu ha two drawback a comput
must comput ani imag to be displai also the point
interact is more difficult thi is becaus the point function
give onli the coordin of the point on the screen
the invers of the map gener process is requir to
calcul the coordin of the point on the screen the
invers of the map gener process is requir to calcul
the coordin at the select point in the input space
cacm june 1968 ophir d rankowitz s shepherd b j
spinrad r j comput displai comput graphic comput raster displai
tv displai consol digit tv displai swept raster comput displai
swept raster tv comput displai tv graphic termin multiconsol comput
graphic inexpens graphic termin 2 0 4 49 6 35
ca680604 jb februari 22 1978 4 35 pm 1741 5
1741 1741 5 1741 1741 5 1741 1891 5 1741
2211 5 1741 2421 5 1741 2674 5 1741 2687
5 1741 1554 6 1741 1741 6 1741 1741 6
1741 1741 6 1741 1741 6 1741 1741 6 1741
1915 6 1741 2004 6 1741 2004 6 1741 2211
6 1741 2421 6 1741 2687 6 1741 
# 1742
on the design of displai processor the flexibl and power
need in the data channel for a comput displai ar
consid to work effici such a channel must have a
suffici number of instruct that it is best understood as
a small processor rather than a power channel as it
wa found that success improv to the displai processor design
lie on a circular path by make improv on can
return to the origin simpl design plu on new gener
purpos comput for each trip around the degre of physic
separ between displai and parent comput is a kei factor
in displai processor design cacm june 1968 myer t h
displai processor design displai system comput graphic graphic termin displai
graphic displai gener displai channel displai program graphic interact remot
displai 2 44 6 22 6 29 6 35 ca680603
jb februari 22 1978 4 41 pm 1742 5 1742
1742 5 1742 1742 5 1742 
# 1743
reliabl full duplex file transmiss over half duplex telephon line
a field proven scheme for achiev reliabl duplex transmiss over
a half duplex commun line is present and to demonstr
the difficulti of the problem anoth similar scheme which is
onli slightli unreli is also present a flowchart for the
reliabl scheme and some interest exampl ar given cacm june
1968 lynch w c telephon commun half duplex transmiss error
correct full duplex telephon error 3 81 4 41 6
35 ca680602 jb februari 22 1978 4 45 pm 1743
5 1743 1743 5 1743 1743 5 1743 1907 5
1743 1743 6 1743 
# 1744
stabl numer method for obtain the chebyshev solut to an
overdetermin system of equat an implement of stiefel s exchang
algorithm for determin a chebyshev solut to an overdetermin system
of linear equat is present that us gaussian lu decomposit
with row interchang the implement is computation more stabl than
those usual given in the literatur a gener of stiefel
s algorithm is develop which permit the occasion exchang of
two equat simultan cacm june 1968 bartel r h golub
g h chebyshev solut overdetermin linear system linear equat exchang
algorithm 5 13 5 14 5 41 ca680601 jb februari
22 1978 4 50 pm 1744 5 1744 1744 5
1744 1744 5 1744 1905 5 1744 1744 6 1744
# 1745
a posit paper on comput and commun the effect oper
of free enterpris in creat the envis inform servic industri
is depend upon three accomplish 1 the restructur of our
inform process industri so that a clear divis of cost
is made among comput commun and the develop of inform
servic 2 the wide us of multiaccess system concept so
that inform servic mai share in the us of comput
instal and so that the cost of their construct is
reason and 3 the develop of public messag switch commun
servic so that adequ provis ar made for inform secur
cacm mai 1968 denni j b inform network inform system
comput and free enterpris comput econom comput instal manag govern
regul commun servic distribut data base program leas 2 3
2 40 3 80 4 30 ca680511 jb februari 23
1978 8 49 am 1745 5 1745 1745 5 1745
1745 5 1745 
# 1746
protect in an inform process util on of the critic
problem in the design of an inform process util that
permit flexibl share of user inform is privaci on solut
for thi problem is discuss cacm mai 1968 graham r
protect privaci inform process util time share multi user multiprogram
multiprocess secur share inform control access reliabl oper segment 4
32 4 39 ca680510 jb februari 23 1978 8 52
am 1746 5 1746 1746 5 1746 1746 5 1746
1753 5 1746 2358 5 1746 2377 5 1746 2372
5 1746 2626 5 1746 2840 5 1746 1471 6
1746 1471 6 1746 1746 6 1746 1746 6 1746
1746 6 1746 1746 6 1746 1746 6 1746 1746
6 1746 1749 6 1746 1751 6 1746 1753 6
1746 274 6 1746 2358 6 1746 2358 6 1746
2377 6 1746 2436 6 1746 2625 6 1746 2626
6 1746 2629 6 1746 2629 6 1746 
# 1747
three criteria for design comput system to facilit debug the
design of a comput system should adopt explicit criteria for
accept or reject propos system featur three possibl criteria of
thi kind ar input record input specifi and asynchron reproduc
of output these criteria impli that a user can if
he desir either know or control all the influenc affect
the content and extent of hi comput s output to
defin the scope of the criteria the notion of an
abstract machin of a program languag and the notion of
a virtual comput ar explain exampl of applic of the
criteria concern the read of a time of dai clock
the synchron of parallel process protect in multiprogram system and
the assign of capabl index cacm mai 1968 van horn
e c comput design comput design criteria comput system comput
system design input equip input equip design oper system oper
system design multiprogram multiprogram system multiprogram system design virtual comput
program languag program languag design program semant program languag semant
determin reproduc repeat determinist comput protect memori protect inform secur
inform privaci comput reliabl debug program debug program test parallel
process parallel program multiprocess 2 11 4 12 4 13
4 20 4 30 4 42 4 43 5 24
6 20 6 35 ca680509 jb februari 23 1978 9
06 am 1458 4 1747 1523 4 1747 1603 4
1747 1698 4 1747 1747 4 1747 1748 4 1747
1854 4 1747 1877 4 1747 1960 4 1747 2377
4 1747 2378 4 1747 2497 4 1747 2558 4
1747 2625 4 1747 2632 4 1747 2840 4 1747
2941 4 1747 3105 4 1747 3144 4 1747 1471
5 1747 1747 5 1747 1747 5 1747 1747 5
1747 2151 5 1747 1653 6 1747 1747 6 1747
1860 6 1747 
# 1748
a schedul philosophi for multiprocess system a collect of basic
idea is present which have been evolv by variou worker
over the past four year to provid a suitabl framework
for the design and analysi of multiprocess system the notion
of process and state vector ar discuss and the natur
of basic oper on process is consid some of the
connect between process and protect ar analyz a veri gener
approach to prioriti orient schedul is describ and it relationship
to convent interrupt system is explain some aspect of time
orient schedul ar consid the implement of the schedul mechan
is analyz in detail and the feasibl of embodi it
in hardwar establish final sever method for interlock the execut
of independ process ar present and compar cacm mai 1968
lampson b w time share multiprocess process schedul interlock protect
prioriti interrupt system 4 31 4 32 6 21 ca680508
jb februari 23 1978 9 13 am 1458 4 1748
1523 4 1748 1603 4 1748 1698 4 1748 1747
4 1748 1748 4 1748 1854 4 1748 1877 4
1748 1960 4 1748 2377 4 1748 2378 4 1748
2497 4 1748 2558 4 1748 2625 4 1748 2632
4 1748 2840 4 1748 2941 4 1748 3105 4
1748 3144 4 1748 1471 5 1748 1748 5 1748
1748 5 1748 1748 5 1748 1805 5 1748 1828
5 1748 1854 5 1748 2187 5 1748 1421 6
1748 1471 6 1748 1518 6 1748 1572 6 1748
1748 6 1748 1748 6 1748 1748 6 1748 1748
6 1748 1749 6 1748 1749 6 1748 1781 6
1748 
# 1749
the structur of the the multiprogram system a multiprogram system
is describ in which all activ ar divid over a
number of sequenti process these sequenti process ar place at
variou hierarch level in each of which on or more
independ abstract have been implement the hierarch structur prove to
be vital for the verif of the logic sound of
the design and the correct of it implement cacm mai
1968 dijkstra e w oper system multiprogram system system hierarchi
system structur real time debug program verif synchron primit cooper
sequenti process system level input output buffer multiprogram processor share
multiprocess 4 30 4 32 ca680507 jb februari 23 1978
9 20 am 1749 5 1749 1749 5 1749 1749
5 1749 1828 5 1749 1854 5 1749 1877 5
1749 1960 5 1749 2150 5 1749 2317 5 1749
2319 5 1749 2342 5 1749 2376 5 1749 2377
5 1749 2379 5 1749 2424 5 1749 2482 5
1749 2618 5 1749 2632 5 1749 2704 5 1749
2723 5 1749 2738 5 1749 2740 5 1749 2741
5 1749 2867 5 1749 3184 5 1749 1198 6
1749 1198 6 1749 1198 6 1749 1198 6 1749
1198 6 1749 1198 6 1749 1247 6 1749 1338
6 1749 1338 6 1749 1338 6 1749 1408 6
1749 1421 6 1749 1471 6 1749 1471 6 1749
1471 6 1749 1471 6 1749 1471 6 1749 1526
6 1749 1549 6 1749 1552 6 1749 1572 6
1749 1693 6 1749 1719 6 1749 1746 6 1749
1748 6 1749 1748 6 1749 1749 6 1749 1749
6 1749 1749 6 1749 1749 6 1749 1749 6
1749 1749 6 1749 1749 6 1749 1749 6 1749
1749 6 1749 1749 6 1749 1749 6 1749 1749
6 1749 1749 6 1749 1749 6 1749 1749 6
1749 1749 6 1749 1749 6 1749 1749 6 1749
1749 6 1749 1749 6 1749 1749 6 1749 1749
6 1749 1751 6 1749 1753 6 1749 1781 6
1749 1826 6 1749 210 6 1749 1854 6 1749
1877 6 1749 1877 6 1749 1877 6 1749 1960
6 1749 2016 6 1749 2017 6 1749 2080 6
1749 2080 6 1749 2080 6 1749 2080 6 1749
2126 6 1749 2148 6 1749 2188 6 1749 2203
6 1749 2204 6 1749 2228 6 1749 2228 6
1749 2247 6 1749 2247 6 1749 2256 6 1749
2356 6 1749 2356 6 1749 2358 6 1749 2379
6 1749 2379 6 1749 2454 6 1749 2651 6
1749 2673 6 1749 2777 6 1749 557 6 1749
627 6 1749 731 6 1749 
# 1750
consider in the design of a multipl comput system with
extend core storag the us of larg quantiti of address
but not execut fast random access memori to heighten the
multiprogram perform of a multicomput system is discuss the gener
design of the hardwar arrang and the softwar compon and
function of such a system ar base on a plan
configur of dual cdc 6600 s that share on million
word of extend core storag in the gener of such
a design special emphasi is place on estim expect gain
when compar with the tradit configur of separ and independ
comput without extend core storag an observ is made on
the us of convent slower speed random access storag devic
in place of the faster memori cacm mai 1968 fuchel
k heller s multipl comput system extend core storag multiprogram
oper system multiprocessor oper system control data corpor 6600 oper
system with ec 4 30 4 32 ca680506 jb februari
23 1978 9 27 am 1750 5 1750 1750 5
1750 1750 5 1750 2988 5 1750 1750 6 1750
# 1751
the work set model for program behavior probabl the most
basic reason behind the absenc of a gener treatment of
resourc alloc in modern comput system is an adequ model
for program behavior in thi paper a new model the
work set model is develop the work set of page
associ with a process defin to be the collect of
it most recent us page provid knowledg vital to the
dynam manag of page memori process and work set ar
shown to be manifest of the same ongo comput activ
then processor demand and memori demand ar defin and resourc
alloc is formul as the problem of balanc demand against
avail equip cacm mai 1968 den p j gener oper
system concept multiprocess multiprogram oper system program behavior program model
resourc alloc schedul storag alloc 4 30 4 32 ca680505
jb februari 23 1978 9 33 am 1751 4 1751
1892 4 1751 2128 4 1751 2218 4 1751 1751
5 1751 1751 5 1751 1751 5 1751 1752 5
1751 1892 5 1751 1901 5 1751 2085 5 1751
2095 5 1751 2218 5 1751 2277 5 1751 2319
5 1751 2329 5 1751 2358 5 1751 2373 5
1751 2380 5 1751 2434 5 1751 2499 5 1751
2501 5 1751 2582 5 1751 2669 5 1751 2828
5 1751 2863 5 1751 2881 5 1751 2928 5
1751 2996 5 1751 3006 5 1751 3067 5 1751
168 6 1751 185 6 1751 1380 6 1751 1408
6 1751 1410 6 1751 1502 6 1751 1526 6
1751 1572 6 1751 1572 6 1751 1719 6 1751
1728 6 1751 1728 6 1751 1728 6 1751 1728
6 1751 1746 6 1751 1749 6 1751 1751 6
1751 1751 6 1751 1751 6 1751 1751 6 1751
1751 6 1751 1751 6 1751 1751 6 1751 1751
6 1751 1751 6 1751 1751 6 1751 1751 6
1751 1751 6 1751 1751 6 1751 1751 6 1751
1751 6 1751 1751 6 1751 1751 6 1751 1751
6 1751 1751 6 1751 1751 6 1751 1751 6
1751 1751 6 1751 1751 6 1751 1753 6 1751
1754 6 1751 1754 6 1751 1754 6 1751 1752
6 1751 1752 6 1751 1810 6 1751 1810 6
1751 1879 6 1751 1879 6 1751 1884 6 1751
1884 6 1751 274 6 1751 1901 6 1751 1901
6 1751 1924 6 1751 1951 6 1751 2004 6
1751 2016 6 1751 2017 6 1751 2017 6 1751
2017 6 1751 2080 6 1751 2095 6 1751 2130
6 1751 2188 6 1751 2203 6 1751 2204 6
1751 2277 6 1751 2358 6 1751 2374 6 1751
2374 6 1751 2374 6 1751 2373 6 1751 2373
6 1751 2373 6 1751 2373 6 1751 2380 6
1751 2522 6 1751 2569 6 1751 2595 6 1751
2595 6 1751 2595 6 1751 2682 6 1751 2751
6 1751 2841 6 1751 2863 6 1751 2863 6
1751 2864 6 1751 3006 6 1751 
# 1752
resourc manag for a medium scale time share oper system
task schedul and resourc balanc for a medium size virtual
memori page machin ar discuss in relat to a combin
batch process and time share environ a synopsi is given
of the task schedul and page algorithm that were implement
and the result of compar simul ar given by trace
the develop of the algorithm through six predecessor version throughout
the discuss particular emphasi is place on balanc the system
perform rel to the characterist of all the system resourc
simul result rel to altern hardwar characterist and the effect
of program mix and load variat ar also present cacm
mai 1968 oppenheim g weizer n time share oper system
resourc manag task schedul page system simul memori manag virtual
memori 4 30 4 31 4 32 ca680504 jb februari
23 1978 9 39 am 1751 5 1752 1752 5
1752 1752 5 1752 1752 5 1752 1892 5 1752
2128 5 1752 2218 5 1752 1380 6 1752 1526
6 1752 1572 6 1752 1572 6 1752 1728 6
1752 1728 6 1752 1751 6 1752 1751 6 1752
1752 6 1752 1752 6 1752 1752 6 1752 1752
6 1752 1810 6 1752 1879 6 1752 2095 6
1752 
# 1753
virtual memori process and share in multic some basic concept
involv in the design of the multic oper system ar
introduc multic concept of process address space and virtual memori
ar defin and the us of page and segment is
explain the mean by which user mai share procedur and
data is discuss and the mechan by which symbol refer
ar dynam transform into virtual machin address is describ in
detail cacm mai 1968 dalei r c denni j b
virtual memori inform share share procedur data share dynam link
segment page multiprogram storag manag storag hierarchi file mainten 3
73 4 32 ca680503 jb februari 23 1978 9 44
am 1753 4 1753 2358 4 1753 2377 4 1753
2372 4 1753 2626 4 1753 2840 4 1753 1746
5 1753 1753 5 1753 1753 5 1753 1753 5
1753 2317 5 1753 2358 5 1753 2625 5 1753
1198 6 1753 1471 6 1753 1572 6 1753 1693
6 1753 1746 6 1753 1749 6 1753 1751 6
1753 1753 6 1753 1753 6 1753 1753 6 1753
1781 6 1753 274 6 1753 2126 6 1753 2148
6 1753 2358 6 1753 2438 6 1753 
# 1754
dynam storag alloc system in mani recent comput system design
hardwar facil have been provid for eas the problem of
storag alloc a method of character dynam storag alloc system
accord to the function capabl provid and the underli techniqu
us is present the basic purpos of the paper is
to provid a us perspect from which the util of
variou hardwar facil mai be assess a brief survei of
storag alloc facil in sever repres comput system is includ
as an appendix cacm mai 1968 randel b kuehner c
j segment page multiprogram storag alloc storag manag virtual memori
storag fragment storag hierarchi address mechan 4 30 6 20
ca680502 jb februari 23 1978 9 49 am 1754 4
1754 1754 4 1754 2358 4 1754 488 4 1754
274 5 1754 1754 5 1754 1754 5 1754 1754
5 1754 1879 5 1754 1884 5 1754 1901 5
1754 376 5 1754 2095 5 1754 2277 5 1754
2297 5 1754 2365 5 1754 168 6 1754 185
6 1754 987 6 1754 1728 6 1754 1728 6
1754 1751 6 1754 1751 6 1754 1751 6 1754
1754 6 1754 1754 6 1754 1754 6 1754 1754
6 1754 1754 6 1754 1754 6 1754 1754 6
1754 1879 6 1754 1924 6 1754 2362 6 1754
# 1755
proceed of the acm symposium on oper system principl cacm
mai 1968 acm special interest committe ca680501 jb februari 23
1978 9 56 am 1755 5 1755 1755 5 1755
1755 5 1755 
# 1756
hollerith punch card code propos usa standard cacm april 1968
usa standard card code punch card punch card code hole
pattern hole pattern assign punch card system 1 4 2
0 2 2 2 43 2 9 3 15 3
24 3 50 3 57 3 7 3 80 3
81 3 82 4 11 4 12 ca680414 jb februari
23 1978 10 14 am 1756 5 1756 1756 5
1756 1756 5 1756 
# 1757
data code for calendar date for machin to machin data
interchang propos usa standard cacm april 1968 usa standard data
code calendar date machin to machin data interchang record calendar
date data group identifi 2 0 2 11 2 19
2 3 2 40 2 43 2 49 3 50
3 52 3 53 3 55 3 56 3 59
3 70 3 71 3 73 3 74 3 79
3 81 4 1 4 9 ca680413 jb februari 23
1978 10 18 am 1757 5 1757 1757 5 1757
1757 5 1757 
# 1758
symmetr polynomi algorithm 305 c1 cacm april 1968 mckai s
symmetr polynomi symmetr sum unitari symmetr function schur function 5
39 ca680412 jb februari 23 1978 10 19 am 1758
5 1758 1758 5 1758 1758 5 1758 
# 1759
transport problem algorithm 293 h cacm april 1968 bayer g
transport problem linear program 5 41 ca680411 jb februari 23
1978 10 20 am 1759 5 1759 1759 5 1759
1759 5 1759 
# 1760
normal curv integr algorithm 304 s15 cacm april 1968 bergson
a normal curv integr probabl special function 5 5 5
12 ca680410 jb februari 23 1978 10 22 am 1760
5 1760 1760 5 1760 1760 5 1760 1838 5
1760 1760 6 1760 
# 1761
chi squar integr algorithm 299 s15 cacm april 1968 o
brien w m wood j chi squar integr probabl special
function 5 5 5 12 ca680409 jb februari 23 1978
10 24 am 1761 5 1761 1761 5 1761 1761
5 1761 2668 5 1761 1604 6 1761 1728 6
1761 1761 6 1761 1827 6 1761 2677 6 1761
# 1762
dilogarithm algorithm 327 s22 cacm april 1968 kolbig k s
dilogarithm function special function 5 12 ca680408 jb februari 23
1978 10 25 am 1762 5 1762 1762 5 1762
1762 5 1762 
# 1763
root of low order polynomi equat algorithm 326 c2 cacm
april 1968 nonweil t f root finder polynomi equat root
quadrat equat root cubic equat root biquadrat equat root polynomi
zero 5 15 ca680407 jb februari 23 1978 10 27
am 1763 5 1763 1763 5 1763 1763 5 1763
# 1764
panel discuss on comput appreci session 19 of the acm
20 th anniversari confer on august 31 1967 wa entitl
educ design experi and comput appreci it second half consist
of a panel discuss on comput appreci organ and chair
by elliot i organick the four panelist were charl h
davidson bernard a galler richard w ham and alan j
perli after make prepar statement the panelist were join in
discuss by andri van dam and arthur bohn who had
present paper in the first half thi is a transcript
of the panel discuss condens by dr organick and edit
by him and the panelist some remark refer to paper
by van dam and kahn or to the discuss dure
the first half of the session pertin paper ar includ
in the refer cacm april 1968 organick e i comput
appreci student liber art cours survei cours begin program cours
content comput cours dropout rate colleg versu precolleg teach and
social respons 1 1 1 51 1 52 ca680406 jb
februari 23 1978 10 34 am 1764 5 1764 1764
5 1764 1764 5 1764 
# 1765
expenditur sourc of fund and util of digit comput for
research and instruct in higher educ 1964 65 with project
for 1968 69 the southern region educ board publish a
complet report on a survei it conduct to determin the
fund and character the util of comput us for research
and instruct in institut of higher educ in the unit
state the sampl survei is describ and the estim for
thi total popul ar present cacm april 1968 hamblen j
w comput center research instruct util expenditur support sourc of
fund higher educ post secondari educ colleg univers 1 52
2 45 ca680405 jb februari 23 1978 11 07 am
1765 5 1765 1765 5 1765 1765 5 1765 
# 1766
quasilinear and the estim of differenti oper from eigenvalu given
a linear ordinari differenti oper contain sever unknown constant and
a number of it eigenvalu the valu of the unknown
constant ar estim a precis formul is provid and an
effect numer procedur for solut is indic the result of
some comput experi ar given cacm april 1968 bellman r
e kagiwada h h kalaba r e vasudenvan r quasilinear
eigenvalu differenti oper nonlinear boundari valu problem invers problem differenti
equat system identif 3 15 3 17 5 17 ca680404
jb februari 23 1978 11 12 am 1766 4 1766
1401 5 1766 1766 5 1766 1766 5 1766 1766
5 1766 
# 1767
a gener purpos graphic languag interact us of comput with
graphic termin will permit mani new problem to be solv
us machin in order to handl a varieti of applic
it is expedi to develop a gener purpos graphic languag
that is us on a number of graphic devic a
system ha been design to produc such a languag quickli
and cheapli a model graphic languag which ha been develop
with the system is present cacm april 1968 kulsrud h
e graphic languag interact increment compil languag design metacompil syntax
specifi languag 4 12 4 22 ca680403 jb februari 23
1978 11 17 am 249 4 1767 254 4 1767
272 4 1767 1102 4 1767 1109 4 1767 1140
4 1767 1188 4 1767 1306 4 1767 1396 4
1767 1464 4 1767 1491 4 1767 1767 4 1767
1767 4 1767 1767 4 1767 1767 4 1767 1781
4 1767 1781 4 1767 1781 4 1767 1781 4
1767 1787 4 1767 1787 4 1767 1860 4 1767
1945 4 1767 1949 4 1767 1988 4 1767 321
4 1767 2059 4 1767 2126 4 1767 2252 4
1767 2341 4 1767 435 4 1767 437 4 1767
463 4 1767 483 4 1767 491 4 1767 2732
4 1767 560 4 1767 583 4 1767 3073 4
1767 627 4 1767 631 4 1767 632 4 1767
642 4 1767 644 4 1767 653 4 1767 680
4 1767 761 4 1767 762 4 1767 763 4
1767 123 4 1767 140 4 1767 919 4 1767
989 4 1767 196 5 1767 1468 5 1767 1467
5 1767 1496 5 1767 1767 5 1767 1767 5
1767 1767 5 1767 2002 5 1767 2003 5 1767
2152 5 1767 1491 6 1767 1710 6 1767 1767
6 1767 1767 6 1767 1767 6 1767 1937 6
1767 2105 6 1767 
# 1768
a global parser for context free phrase structur grammar an
algorithm for analyz ani context free phrase structur grammar and
for gener a program which can then pars ani sentenc
in the languag or indic that the given sentenc is
invalid is describ the parser is of the top to
bottom type and is recurs a number of heurist procedur
whose purpos is to shorten the basic algorithm by quickli
ascertain that certain substr of the input sentenc cannot correspond
to the target nontermin symbol ar includ both the gener
algorithm and the parser have been implement in rca snobol
and have been test successfulli on a number of artifici
grammar and on a subset of algol a number of
the routin for extract data about a grammar such as
minimum length of n deriv string and possibl prefix ar
given and mai be of interest apart from their applic
in thi particular context cacm april 1968 unger s h
parser syntax direct compil context free grammar syntact analysi translat
3 42 4 12 5 24 ca680402 jb februari 23
1978 11 27 am 1350 4 1768 1399 4 1768
1496 4 1768 1659 4 1768 1665 4 1768 1683
4 1768 1768 4 1768 1768 4 1768 1768 4
1768 1781 4 1768 1787 4 1768 1787 4 1768
1824 4 1768 1825 4 1768 1836 4 1768 1861
4 1768 1945 4 1768 1945 4 1768 2015 4
1768 2061 4 1768 2110 4 1768 2110 4 1768
2127 4 1768 2187 4 1768 2317 4 1768 2545
4 1768 2698 4 1768 2733 4 1768 3094 4
1768 1141 5 1768 1265 5 1768 1768 5 1768
1768 5 1768 1768 5 1768 1781 5 1768 
# 1769
the expand world of comput the onward sweep of automat
process of inform is imped by nine princip barrier geographi
cost problem complex man machin commun inadequ sensor lack of
understand distanc time and size the main incent for breach
these barrier is the univers need for process inform ever
more urgent as the greater part of human work activ
chang from product to servic comput develop in hardwar program
time share educ data commun and displai ar judg by
how effect thei remov these barrier and their barrier smash
potenti indic continu rapid expans problem orient languag ar particularli
effect over the entir front onlin comput and time share
also rate high by thi measur educ and increas understand
ar basic to all progress with the comput thi complex
but power tool is the most import on avail to
govern and scientist to us in studi the problem be
creat by the popul explos and in analyz possibl solut
cacm april 1968 harder e l barrier philosophi develop comput
aid design problem orient languag data commun educ comput scienc
forecast survei introduct 1 0 1 3 2 1 3
24 4 0 6 20 6 30 ca680401 jb februari
23 1978 11 36 am 1769 5 1769 1769 5
1769 1769 5 1769 
# 1770
rule of ethic in inform process the background and motiv
for the adopt by the acm council on novemb 11
1966 of a set of guidelin for profession conduct in
inform process ar describ a brief hi tori is given
of ethic code in other profess some reason for and
against adopt of ethic rule ar consid and sever section
of the acm guidelin ar analyz the purpos is to
inform about thi import aspect of our profess as well
as to stimul thought and interest cacm march 1968 parker
d b ethic profession conduct code of ethic acm guidelin
profession profession societi uneth conduct 1 3 2 2 ca680302
jb februari 23 1978 11 41 am 1770 4 1770
1628 5 1770 1770 5 1770 1770 5 1770 1770
5 1770 
# 1771
curriculum 68 recommend for academ program in comput scienc a
report of the acm curriculum committe on comput scienc thi
report contain recommend on academ program in comput scienc which
were develop by the acm curriculum committe on comput scienc
a classif of the subject area contain in comput scienc
is present and twenti two cours in these area ar
describ prerequisit catalog descript detail outlin and annot bibliographi for
these cours ar includ specif recommend which have evolv from
the committe s 1965 preliminari recommend ar given for undergradu
program graduat program in comput scienc ar discuss and some
recommend ar present for the develop of master s degre
program wai of develop guidelin for doctor program ar discuss
but no specif recommend ar made the import of servic
cours minor and continu educ in comput scienc is emphas
attent is given to the organ staff requir comput resourc
and other facil need to implement comput scienc educ program
cacm march 1968 comput scienc cours comput scienc curriculum comput
scienc educ comput scienc academ program comput scienc graduat program
comput scienc undergradu program comput scienc cours bibliographi 1 52
ca680301 jb februari 23 1978 11 52 am 1413 4
1771 1654 4 1771 1720 4 1771 1771 4 1771
1771 4 1771 2478 4 1771 1205 5 1771 1654
5 1771 1720 5 1771 1771 5 1771 1771 5
1771 1771 5 1771 1927 5 1771 2147 5 1771
2163 5 1771 2345 5 1771 2478 5 1771 2594
5 1771 2852 5 1771 2899 5 1771 3130 5
1771 1205 6 1771 1417 6 1771 1654 6 1771
1659 6 1771 1720 6 1771 1771 6 1771 1771
6 1771 1771 6 1771 1771 6 1771 1771 6
1771 1771 6 1771 1771 6 1771 1771 6 1771
1771 6 1771 1771 6 1771 1927 6 1771 2155
6 1771 2181 6 1771 2181 6 1771 2204 6
1771 2329 6 1771 2345 6 1771 2387 6 1771
2479 6 1771 2538 6 1771 3003 6 1771 3186
6 1771 
# 1772
usascsocr dual case keyboard arrang propos usa standard cacm februari
1968 ca680210 jb februari 23 1978 11 54 am 1772
5 1772 1772 5 1772 1772 5 1772 
# 1773
gener purpos alphanumer keyboard arrang for inform interchang propos usa
standard cacm februari 1968 ca680209 jb februari 23 1978 11
56 am 1773 5 1773 1773 5 1773 1773 5
1773 
# 1774
program overlai techniqu the gener featur of program overlai system
ar describ three main type automat semiautomat and nonautomat ar
classifi and the program techniqu ar explain as a function
of machin hardwar and other system featur the implement of
semiautomat overlai facil in a multiprogram system on the cdc
6600 is describ in detail with special refer to real
time applic cacm februari 1968 pankhurst r j loader multiprogram
overlai techniqu storag alloc and segment 4 39 ca680208 jb
februari 23 1978 11 59 am 1471 4 1774 1774
4 1774 1774 4 1774 1774 4 1774 2343 4
1774 560 4 1774 972 4 1774 1173 5 1774
271 5 1774 1774 5 1774 1774 5 1774 1774
5 1774 2343 5 1774 800 5 1774 1173 6
1774 1774 6 1774 1845 6 1774 
# 1775
adjust of the invers of a symmetr matrix when two
symmetr element ar chang algorithm 325 f1 cacm februari 1968
zielk g symmetr matrix matrix invers matrix perturb matrix modif
5 14 ca680207 jb februari 23 1978 12 01 pm
1775 5 1775 1775 5 1775 1775 5 1775 
# 1776
maxflow algorithm 324 h cacm februari 1968 bayer g network
liner program maximum flow 5 41 ca680206 jb februari 23
1978 12 02 pm 1776 5 1776 1776 5 1776
1776 5 1776 
# 1777
gener of permut in lexicograph order algorithm 323 g6 cacm
februari 1968 ord smith r j permut lexicograph order lexicograph
gener permut gener 5 39 ca680205 jb februari 23 1978
12 04 pm 1777 5 1777 1777 5 1777 1777
5 1777 1814 5 1777 1777 6 1777 
# 1778
f distribut algorithm 322 s14 cacm februari 1968 dorrer e
fisher s f distribut student s t distribut 5 5
ca680204 jb februari 23 1978 12 06 pm 1778 5
1778 1778 5 1778 1778 5 1778 1920 5 1778
1778 6 1778 714 6 1778 
# 1779
t test probabl algorithm s14 cacm februari 1968 morri j
t test student s t statist distribut function 5 5
ca680203 jb februari 23 1978 1 33 pm 1157 4
1779 1779 4 1779 1920 4 1779 1944 4 1779
1987 4 1779 2548 4 1779 1779 5 1779 1779
5 1779 1779 5 1779 1944 5 1779 1987 5
1779 714 5 1779 1561 6 1779 1581 6 1779
1779 6 1779 1779 6 1779 1944 6 1779 714
6 1779 714 6 1779 
# 1780
harmon analysi for symmetr distribut data algorithm 320 c6 cacm
februari 1968 hunter d b harmon analysi cosin seri sine
seri function approxim curv fit trigonometr seri 5 13 ca680202
jb februari 23 1978 1 34 pm 1780 5 1780
1780 5 1780 1780 5 1780 
# 1781
translat write system a critic review of recent effort to
autom the write of translat of program languag is present
the formal studi of syntax and it applic to translat
write ar discuss in section ii variou approach to autom
the post syntact semant aspect of translat write ar discuss
in section iii and sever relat topic in section iv
cacm februari 1968 feldman j gri d compil compil compil
translat translat write system metacompil syntax semant syntax direct meta
assembl macroprocessor parser syntact analysi gener 4 1 4 10
4 12 4 22 5 23 ca680201 jb februari 23
1978 2 02 pm 249 4 1781 254 4 1781
267 4 1781 272 4 1781 1046 4 1781 1062
4 1781 1072 4 1781 1086 4 1781 1102 4
1781 1102 4 1781 1105 4 1781 1109 4 1781
1121 4 1781 1132 4 1781 1139 4 1781 1139
4 1781 1139 4 1781 1140 4 1781 1140 4
1781 1141 4 1781 1142 4 1781 1188 4 1781
1215 4 1781 1215 4 1781 1223 4 1781 1225
4 1781 1234 4 1781 1234 4 1781 1263 4
1781 1263 4 1781 1265 4 1781 1265 4 1781
1265 4 1781 1270 4 1781 1306 4 1781 1306
4 1781 1323 4 1781 1323 4 1781 1350 4
1781 1350 4 1781 1358 4 1781 1358 4 1781
1358 4 1781 1358 4 1781 1379 4 1781 1379
4 1781 1380 4 1781 1380 4 1781 1380 4
1781 1396 4 1781 1399 4 1781 1425 4 1781
1453 4 1781 1464 4 1781 1464 4 1781 1469
4 1781 1484 4 1781 1486 4 1781 1491 4
1781 1491 4 1781 1491 4 1781 1491 4 1781
1496 4 1781 1498 4 1781 1498 4 1781 1503
4 1781 1530 4 1781 1541 4 1781 1542 4
1781 1552 4 1781 1565 4 1781 1565 4 1781
1612 4 1781 1613 4 1781 1614 4 1781 1626
4 1781 1646 4 1781 1647 4 1781 1659 4
1781 1665 4 1781 1683 4 1781 1693 4 1781
1693 4 1781 1693 4 1781 1693 4 1781 1708
4 1781 1708 4 1781 1767 4 1781 1767 4
1781 1767 4 1781 1767 4 1781 1768 4 1781
1781 4 1781 1781 4 1781 1781 4 1781 1781
4 1781 1781 4 1781 1781 4 1781 1781 4
1781 1781 4 1781 1781 4 1781 1781 4 1781
1781 4 1781 1781 4 1781 1781 4 1781 1781
4 1781 1781 4 1781 1781 4 1781 1781 4
1781 1781 4 1781 1781 4 1781 1781 4 1781
1781 4 1781 1781 4 1781 1781 4 1781 1781
4 1781 1781 4 1781 1781 4 1781 1781 4
1781 1781 4 1781 1781 4 1781 1781 4 1781
1781 4 1781 1781 4 1781 1781 4 1781 1781
4 1781 1781 4 1781 1781 4 1781 1781 4
1781 1781 4 1781 1781 4 1781 1781 4 1781
1781 4 1781 1781 4 1781 1781 4 1781 1781
4 1781 1781 4 1781 1781 4 1781 1781 4
1781 1781 4 1781 1781 4 1781 1781 4 1781
1781 4 1781 1781 4 1781 1781 4 1781 1781
4 1781 1781 4 1781 1781 4 1781 1781 4
1781 1781 4 1781 1781 4 1781 1787 4 1781
1787 4 1781 1787 4 1781 1787 4 1781 1787
4 1781 1787 4 1781 1787 4 1781 1788 4
1781 1788 4 1781 1792 4 1781 1807 4 1781
1824 4 1781 1824 4 1781 1824 4 1781 1825
4 1781 1826 4 1781 1836 4 1781 1836 4
1781 1852 4 1781 1854 4 1781 1860 4 1781
1860 4 1781 1860 4 1781 1860 4 1781 1860
4 1781 1860 4 1781 1861 4 1781 1945 4
1781 1945 4 1781 1945 4 1781 1945 4 1781
1945 4 1781 1945 4 1781 1945 4 1781 1945
4 1781 1945 4 1781 1945 4 1781 1945 4
1781 1947 4 1781 1949 4 1781 1988 4 1781
1988 4 1781 1988 4 1781 1989 4 1781 321
4 1781 364 4 1781 2015 4 1781 2034 4
1781 2059 4 1781 2060 4 1781 2060 4 1781
2060 4 1781 2061 4 1781 2061 4 1781 2061
4 1781 2083 4 1781 2082 4 1781 2091 4
1781 2091 4 1781 2091 4 1781 2110 4 1781
2112 4 1781 2126 4 1781 2126 4 1781 2126
4 1781 2150 4 1781 2152 4 1781 2156 4
1781 2168 4 1781 2175 4 1781 2178 4 1781
2178 4 1781 2178 4 1781 2179 4 1781 2179
4 1781 2179 4 1781 2228 4 1781 2249 4
1781 2252 4 1781 2252 4 1781 2252 4 1781
2256 4 1781 2299 4 1781 2314 4 1781 2317
4 1781 2325 4 1781 2326 4 1781 2326 4
1781 2341 4 1781 2341 4 1781 2341 4 1781
2340 4 1781 2356 4 1781 2342 4 1781 2376
4 1781 2470 4 1781 2534 4 1781 2534 4
1781 405 4 1781 2541 4 1781 2546 4 1781
2546 4 1781 2546 4 1781 2546 4 1781 435
4 1781 437 4 1781 438 4 1781 438 4
1781 2579 4 1781 463 4 1781 464 4 1781
483 4 1781 491 4 1781 2603 4 1781 2603
4 1781 2618 4 1781 2645 4 1781 2650 4
1781 2652 4 1781 2684 4 1781 2684 4 1781
2684 4 1781 2698 4 1781 2698 4 1781 2698
4 1781 2698 4 1781 2708 4 1781 2708 4
1781 2708 4 1781 2708 4 1781 2719 4 1781
2732 4 1781 2733 4 1781 2736 4 1781 2820
4 1781 2824 4 1781 2833 4 1781 2842 4
1781 2929 4 1781 2934 4 1781 2982 4 1781
2986 4 1781 557 4 1781 560 4 1781 583
4 1781 584 4 1781 3044 4 1781 3045 4
1781 3045 4 1781 3069 4 1781 3073 4 1781
3073 4 1781 3093 4 1781 3093 4 1781 3094
4 1781 3155 4 1781 3184 4 1781 627 4
1781 631 4 1781 631 4 1781 632 4 1781
637 4 1781 642 4 1781 644 4 1781 653
4 1781 653 4 1781 669 4 1781 669 4
1781 679 4 1781 680 4 1781 680 4 1781
691 4 1781 720 4 1781 729 4 1781 759
4 1781 761 4 1781 761 4 1781 762 4
1781 762 4 1781 762 4 1781 763 4 1781
763 4 1781 763 4 1781 795 4 1781 799
4 1781 123 4 1781 140 4 1781 919 4
1781 945 4 1781 949 4 1781 949 4 1781
949 4 1781 989 4 1781 989 4 1781 989
4 1781 123 5 1781 196 5 1781 919 5
1781 990 5 1781 1007 5 1781 1046 5 1781
1131 5 1781 1139 5 1781 1140 5 1781 1149
5 1781 1198 5 1781 1215 5 1781 1223 5
1781 1265 5 1781 1303 5 1781 1323 5 1781
205 5 1781 1358 5 1781 224 5 1781 249
5 1781 1366 5 1781 288 5 1781 1421 5
1781 1460 5 1781 1462 5 1781 1463 5 1781
1468 5 1781 1467 5 1781 1477 5 1781 1491
5 1781 1496 5 1781 1531 5 1781 1535 5
1781 1565 5 1781 1601 5 1781 1602 5 1781
1613 5 1781 1614 5 1781 1626 5 1781 1641
5 1781 1665 5 1781 1768 5 1781 1781 5
1781 1781 5 1781 1781 5 1781 1787 5 1781
1788 5 1781 1824 5 1781 1825 5 1781 1836
5 1781 1861 5 1781 316 5 1781 381 5
1781 398 5 1781 2015 5 1781 2110 5 1781
2127 5 1781 2187 5 1781 2317 5 1781 2545
5 1781 2698 5 1781 2733 5 1781 404 5
1781 410 5 1781 463 5 1781 464 5 1781
483 5 1781 11 5 1781 584 5 1781 3184
5 1781 3188 5 1781 600 5 1781 680 5
1781 691 5 1781 763 5 1781 799 5 1781
196 6 1781 1141 6 1781 1141 6 1781 1155
6 1781 1191 6 1781 1198 6 1781 1215 6
1781 1265 6 1781 1265 6 1781 1324 6 1781
1358 6 1781 1477 6 1781 1477 6 1781 1477
6 1781 1487 6 1781 1491 6 1781 1491 6
1781 1491 6 1781 1496 6 1781 1527 6 1781
1572 6 1781 1614 6 1781 1614 6 1781 1693
6 1781 1739 6 1781 1748 6 1781 1749 6
1781 1753 6 1781 1781 6 1781 1781 6 1781
1781 6 1781 1781 6 1781 1781 6 1781 1781
6 1781 1781 6 1781 1781 6 1781 1781 6
1781 1781 6 1781 1781 6 1781 1781 6 1781
1781 6 1781 1781 6 1781 1781 6 1781 224
6 1781 1856 6 1781 378 6 1781 2110 6
1781 2126 6 1781 2148 6 1781 2179 6 1781
2341 6 1781 2423 6 1781 2556 6 1781 2786
6 1781 404 6 1781 408 6 1781 3184 6
1781 577 6 1781 631 6 1781 680 6 1781
763 6 1781 799 6 1781 799 6 1781 799
6 1781 799 6 1781 
# 1782
a numer integr formula us in fourier analysi a numer
integr formula is present which us unequ sampl interv the
interv ar equal space on a log scale such a
formul is us in fourier analysi to improv accuraci and
eas of usag a complet set of formula for numer
fourier analysi is given cacm januari 1968 meisel w s
numer integr fourier analysi integr 5 16 ca680112 jb februari
23 1978 2 05 pm 1782 5 1782 1782 5
1782 1782 5 1782 
# 1783
in and out convers byan in and out convers we
mean that a float point number in on base is
convert into a float point number in anoth base and
then convert back to a float point number in the
origin base for all combin of round and truncat convers
the question is consid of how mani signific digit ar
need in the intermedi base to allow such in and
out convers to return the origin number when possibl or
at least signific digit cacm januari 1968 matula d w
float point number signific base convers round truncat 3 15
5 11 ca680111 jb februari 23 1978 2 14 pm
1783 4 1783 1843 4 1783 1634 5 1783 1783
5 1783 1783 5 1783 1783 5 1783 1843 5
1783 1634 6 1783 1783 6 1783 
# 1784
practic error coeffici for estim quadratur error for analyt function
all publish error coeffici for estim quadratur error for analyt
function were comput on the assumpt that the quadratur rule
wa exact for polynomi up to a given degre sinc
these rule us round valu for the abscissa and weight
and sinc the true valu of the integr of some
of the polynomi in question have an infinit binari express
the quadratur rule is not exact henc these error must
be taken into consider in comput practic error coeffici cacm
januari 1968 rabinowitz p numer integr quadratur truncat error theoret
error coeffici practic error coeffici integr analyt function roundoff error
5 11 5 16 ca680110 jb februari 23 1978 2
22 pm 1672 5 1784 1784 5 1784 1784 5
1784 1784 5 1784 1784 6 1784 
# 1785
scatter storag techniqu scatter storag techniqu as a method for
implement the symbol tabl of assembl and compil ar review
and a number of wai of us them more effect
ar present mani of the most us variant of the
techniqu ar document cacm januari 1968 morri r scatter storag
hash address search file search file address storag layout 3
73 3 74 ca680109 jb februari 23 1978 2 26
pm 1271 4 1785 1785 4 1785 1785 4 1785
1785 4 1785 2203 4 1785 2203 4 1785 2543
4 1785 2552 4 1785 2552 4 1785 2860 4
1785 911 4 1785 911 4 1785 911 5 1785
1676 5 1785 1682 5 1785 1728 5 1785 1785
5 1785 1785 5 1785 1785 5 1785 1860 5
1785 1973 5 1785 332 5 1785 2018 5 1785
2032 5 1785 2033 5 1785 2107 5 1785 2109
5 1785 2203 5 1785 2251 5 1785 2359 5
1785 2524 5 1785 2543 5 1785 2552 5 1785
2559 5 1785 2991 5 1785 492 5 1785 3053
5 1785 849 6 1785 911 6 1785 911 6
1785 1025 6 1785 1314 6 1785 1329 6 1785
1366 6 1785 1389 6 1785 1421 6 1785 1496
6 1785 1525 6 1785 1626 6 1785 1641 6
1785 1647 6 1785 1785 6 1785 1785 6 1785
1785 6 1785 1785 6 1785 1785 6 1785 1785
6 1785 1785 6 1785 1785 6 1785 1785 6
1785 1785 6 1785 1785 6 1785 1785 6 1785
1785 6 1785 1785 6 1785 1785 6 1785 1785
6 1785 1785 6 1785 1785 6 1785 1785 6
1785 1786 6 1785 1786 6 1785 1786 6 1785
1786 6 1785 1786 6 1785 1786 6 1785 1786
6 1785 1786 6 1785 1786 6 1785 1973 6
1785 1973 6 1785 1973 6 1785 1973 6 1785
1992 6 1785 332 6 1785 332 6 1785 378
6 1785 2018 6 1785 2107 6 1785 2107 6
1785 2107 6 1785 2107 6 1785 2107 6 1785
2107 6 1785 2107 6 1785 2109 6 1785 2109
6 1785 2109 6 1785 2109 6 1785 2109 6
1785 2109 6 1785 2203 6 1785 2203 6 1785
2203 6 1785 2412 6 1785 2543 6 1785 2673
6 1785 2707 6 1785 2770 6 1785 492 6
1785 3184 6 1785 
# 1786
an improv hash code for scatter storag introduc is a
hash code method base on fix point divis rather than
multipl or logic oper thi new method allow the hash
tabl to have almost ani length also a new method
of handl collis is discuss known as quadrat search thi
method is faster than random search and free from the
cluster that build up with a linear search cacm januari
1968 maurer w d hash code hash tabl scatter storag
search 3 74 4 11 4 12 4 9 ca680108
jb februari 23 1978 2 31 pm 1786 5 1786
1786 5 1786 1786 5 1786 1860 5 1786 1973
5 1786 1992 5 1786 2018 5 1786 2033 5
1786 2107 5 1786 2109 5 1786 2203 5 1786
2251 5 1786 2543 5 1786 2573 5 1786 2770
5 1786 911 6 1786 1314 6 1786 1366 6
1786 1389 6 1786 1421 6 1786 1496 6 1786
1626 6 1786 1641 6 1786 1785 6 1786 1785
6 1786 1785 6 1786 1785 6 1786 1785 6
1786 1785 6 1786 1785 6 1786 1785 6 1786
1785 6 1786 1786 6 1786 1786 6 1786 1786
6 1786 1786 6 1786 1786 6 1786 1786 6
1786 1786 6 1786 1786 6 1786 1786 6 1786
1786 6 1786 1786 6 1786 1786 6 1786 1869
6 1786 1973 6 1786 1973 6 1786 1973 6
1786 1992 6 1786 332 6 1786 378 6 1786
2018 6 1786 2018 6 1786 2018 6 1786 2107
6 1786 2107 6 1786 2107 6 1786 2107 6
1786 2107 6 1786 2107 6 1786 2109 6 1786
2109 6 1786 2109 6 1786 2109 6 1786 2109
6 1786 2109 6 1786 2673 6 1786 492 6
1786 3184 6 1786 
# 1787
us of transit matric in compil an algorithm is describ
which construct from a suitabl bnf grammar an effici left
right recogn for sentenc of the correspond languag the type
of recogn us in a number of compil oper with
a pushdown stack and with a transit matrix two exampl
illustr how such recogn mai be us effect for other
purpos besid the usual syntax check cacm januari 1968 gri
d transit matric compil translat grammar context free languag formal
languag pars 4 12 5 23 ca680107 jb februari 23
1978 2 35 pm 249 4 1787 254 4 1787
267 4 1787 272 4 1787 1102 4 1787 1109
4 1787 1139 4 1787 1140 4 1787 1141 4
1787 1188 4 1787 1215 4 1787 1215 4 1787
1223 4 1787 1306 4 1787 1323 4 1787 1358
4 1787 1380 4 1787 1396 4 1787 1464 4
1787 1491 4 1787 1496 4 1787 1498 4 1787
1542 4 1787 1647 4 1787 1665 4 1787 1665
4 1787 1683 4 1787 1683 4 1787 1693 4
1787 1767 4 1787 1767 4 1787 1768 4 1787
1768 4 1787 1781 4 1787 1781 4 1787 1781
4 1787 1781 4 1787 1781 4 1787 1781 4
1787 1781 4 1787 1787 4 1787 1787 4 1787
1787 4 1787 1787 4 1787 1787 4 1787 1787
4 1787 1787 4 1787 1787 4 1787 1787 4
1787 1792 4 1787 1824 4 1787 1825 4 1787
1836 4 1787 1836 4 1787 1860 4 1787 1861
4 1787 1945 4 1787 1945 4 1787 1945 4
1787 1945 4 1787 1949 4 1787 1988 4 1787
1989 4 1787 321 4 1787 364 4 1787 2015
4 1787 2059 4 1787 2060 4 1787 2061 4
1787 2061 4 1787 2082 4 1787 2091 4 1787
2110 4 1787 2112 4 1787 2126 4 1787 2127
4 1787 2152 4 1787 2179 4 1787 2187 4
1787 2252 4 1787 2317 4 1787 2340 4 1787
2356 4 1787 2534 4 1787 405 4 1787 2541
4 1787 2545 4 1787 2546 4 1787 435 4
1787 437 4 1787 438 4 1787 463 4 1787
483 4 1787 491 4 1787 2603 4 1787 2603
4 1787 2698 4 1787 2698 4 1787 2698 4
1787 2708 4 1787 2732 4 1787 2733 4 1787
2733 4 1787 2820 4 1787 2824 4 1787 2982
4 1787 2986 4 1787 560 4 1787 583 4
1787 3045 4 1787 3073 4 1787 3073 4 1787
3093 4 1787 3155 4 1787 627 4 1787 631
4 1787 632 4 1787 642 4 1787 644 4
1787 653 4 1787 680 4 1787 761 4 1787
762 4 1787 763 4 1787 763 4 1787 123
4 1787 140 4 1787 919 4 1787 989 4
1787 196 5 1787 1141 5 1787 1215 5 1787
224 5 1787 1491 5 1787 1496 5 1787 1781
5 1787 1787 5 1787 1787 5 1787 1787 5
1787 2534 5 1787 2708 5 1787 763 5 1787
799 5 1787 830 6 1787 123 6 1787 196
6 1787 919 6 1787 990 6 1787 1007 6
1787 1046 6 1787 1131 6 1787 1139 6 1787
1140 6 1787 1149 6 1787 1198 6 1787 1215
6 1787 1223 6 1787 1265 6 1787 1303 6
1787 1323 6 1787 1358 6 1787 1366 6 1787
1421 6 1787 1460 6 1787 1462 6 1787 1463
6 1787 1467 6 1787 1468 6 1787 1477 6
1787 1477 6 1787 1491 6 1787 1491 6 1787
1496 6 1787 1531 6 1787 1535 6 1787 1565
6 1787 1601 6 1787 1602 6 1787 1613 6
1787 1614 6 1787 1626 6 1787 1641 6 1787
1787 6 1787 1787 6 1787 1787 6 1787 1788
6 1787 205 6 1787 224 6 1787 249 6
1787 288 6 1787 1959 6 1787 1973 6 1787
316 6 1787 381 6 1787 398 6 1787 2111
6 1787 2111 6 1787 11 6 1787 2182 6
1787 2534 6 1787 2556 6 1787 404 6 1787
410 6 1787 463 6 1787 464 6 1787 483
6 1787 3184 6 1787 3188 6 1787 584 6
1787 600 6 1787 680 6 1787 680 6 1787
691 6 1787 763 6 1787 799 6 1787 799
6 1787 
# 1788
toward a gener processor for program languag mani effort have
been made to develop a better wai of implement a
higher level program languag than by the construct of a
whole new compil but so far none ha prove gener
satisfactori in thi paper it is contend that a program
languag is best describ function as a bodi of macro
instruct and that the macro call constitut a canon form
in term of which a program notat mai be describ
a support discuss of the logic and hi toric role
of the macro instruct is present also discuss ar the
conflict between machin independ and object program effici and the
question of where the greatest difficulti lie in compil construct
cacm januari 1968 halpern m j program languag translat program
languag processor gener translat gener processor macro instruct processor meta
processor meta languag translat meta languag processor compil compil write
system translat write system 4 10 4 11 4 12
4 20 ca680106 jb februari 23 1978 2 42 pm
1358 4 1788 1565 4 1788 1781 4 1788 1781
4 1788 1788 4 1788 1788 4 1788 1788 4
1788 1788 4 1788 1006 5 1788 1007 5 1788
205 5 1788 1781 5 1788 1788 5 1788 1788
5 1788 1788 5 1788 3189 5 1788 123 6
1788 196 6 1788 919 6 1788 990 6 1788
1007 6 1788 1046 6 1788 1131 6 1788 1139
6 1788 1140 6 1788 1149 6 1788 1198 6
1788 1215 6 1788 1223 6 1788 1265 6 1788
1303 6 1788 1323 6 1788 1358 6 1788 1366
6 1788 1421 6 1788 1460 6 1788 1462 6
1788 1463 6 1788 1467 6 1788 1468 6 1788
1477 6 1788 1491 6 1788 1496 6 1788 1531
6 1788 1535 6 1788 1565 6 1788 1601 6
1788 1602 6 1788 1613 6 1788 1614 6 1788
1626 6 1788 1641 6 1788 1787 6 1788 1788
6 1788 205 6 1788 224 6 1788 249 6
1788 288 6 1788 316 6 1788 381 6 1788
398 6 1788 11 6 1788 404 6 1788 410
6 1788 463 6 1788 464 6 1788 483 6
1788 3184 6 1788 3188 6 1788 584 6 1788
600 6 1788 680 6 1788 691 6 1788 763
6 1788 799 6 1788 
# 1789
logarithm of gamma function algorithm 291 s14 cacm januari 1968
hoar m r ca680104 jb februari 23 1978 2 45
pm 1789 5 1789 1789 5 1789 1789 5 1789
# 1790
muller s method for find root of an arbitrari function
algorithm 196 c5 cacm januari 1968 whitlei v w equat
root function zero 5 15 ca680103 jb februari 23 1978
2 47 pm 1790 5 1790 1790 5 1790 1790
5 1790 
# 1791
triangular factor of modifi matric algorithm 319 f1 cacm januari
1968 green d r matrix decomposit matrix factor matrix modifi
matrix perturb 5 14 ca680102 jb februari 23 1978 2
50 pm 1791 5 1791 1791 5 1791 1791 5
1791 
# 1792
exploratori experiment studi compar onlin and off line program perform
two exploratori experi were conduct at system develop corpor to
compar debug perform of programm work under condit of on
line and off line access to a comput these ar
the first known studi that measur programm perform under control
condit for standard task statist signific result of both experi
indic faster debug under onlin condit but perhap the most
import practic find involv the strike individu differ in programm
perform methodolog problem encount in design and conduct these experi
ar describ limit of the find ar point out hypothes
ar present to account for result and suggest ar made
for further research cacm januari 1968 sackman h erikson w
j grant e e onlin vs off line perform programm
comput commun program experiment empir studi program cost effect program
perform debug effect time share vs batch process factor analysi
applic programm traine perform basic program knowledg test experienc programm
studi analysi of varianc programm individu differ 2 40 ca680101
jb februari 23 1978 2 58 pm 267 4 1792
1139 4 1792 1141 4 1792 1215 4 1792 1223
4 1792 1647 4 1792 1781 4 1792 1787 4
1792 1792 4 1792 1792 4 1792 1908 4 1792
364 4 1792 405 4 1792 438 4 1792 763
4 1792 224 5 1792 1605 5 1792 1792 5
1792 1792 5 1792 1792 5 1792 3091 5 1792
1792 6 1792 
# 1793
present of alphamer charact for inform process propos american nation
standard cacm decemb 1969 alphamer handwritten input encod transcript numer
upper case hand print 2 43 4 41 ca691219 jb
februari 15 1978 1 55 pm 1793 5 1793 1793
5 1793 1793 5 1793 2333 5 1793 1793 6
1793 87 6 1793 88 6 1793 
# 1794
a fast random number gener for ibm 360 cacm decemb
1969 seraphin d s pseudorandom number modulu period float normal
characterist chi squar test 4 49 5 19 5 5
ca691218 jb februari 15 1978 1 58 pm 1794 4
1794 1870 4 1794 2122 4 1794 1674 5 1794
1794 5 1794 1794 5 1794 1794 5 1794 2349
5 1794 1648 6 1794 1716 6 1794 1794 6
1794 1894 6 1794 2043 6 1794 501 6 1794
613 6 1794 774 6 1794 
# 1795
optim code for serial and parallel comput cacm decemb 1969
fateman r j code optim sequenc of oper detect of
common subexpress 4 12 ca691217 jb februari 15 1978 1
59 pm 1795 5 1795 1795 5 1795 1795 5
1795 
# 1796
index by subject to algorithm 1969 cacm decemb 1969 thi
1969 index is the first supplement to the index by
subject to algorithm 1960 1968 comm acm 11 12 dec
1968 827 830 ca691216 jb februari 15 1978 2 03
pm 1796 5 1796 1796 5 1796 1796 5 1796
# 1797
solut of linear program in 0 1 algorithm 341 h
cacm decemb 1969 proll l g linear program zero on
variabl partial enumer 5 41 ca691215 jb februari 15 1978
2 06 pm 1797 5 1797 1797 5 1797 1797
5 1797 
# 1798
coulomb wave function algorithm 300 s22 cacm decemb 1969 kolbig
k s coulomb wave function wave function special function function
evalu 5 12 ca691214 jb februari 15 1978 2 08
pm 1798 5 1798 1798 5 1798 1798 5 1798
# 1799
elementari function by continu fraction algorithm 229 b1 cacm decemb
1969 brai t a continu faction pade tabl 5 19
ca691213 jb februari 15 1978 2 09 pm 1799 5
1799 1799 5 1799 1799 5 1799 
# 1800
psif algorithm 147 s14 cacm decemb 1969 parson r g
gamma function logarithm deriv factori function psi function 5 12
ca691212 jb februari 15 1978 2 11 pm 1800 4
1800 1800 5 1800 1800 5 1800 1800 5 1800
2222 5 1800 871 5 1800 970 6 1800 1800
6 1800 1818 6 1800 1834 6 1800 2042 6
1800 
# 1801
analysi of varianc for balanc experi algorithm 367 g2 cacm
decemb 1969 claringbold p j analysi of varianc analysi of
covari regress analysi experiment design balanc experi miss data interblock
estim intra block estim 5 14 5 5 ca691211 jb
februari 15 1978 2 14 pm 1801 4 1801 1801
5 1801 1801 5 1801 1801 5 1801 1802 5
1801 
# 1802
regress us certain direct product matric algorithm 366 g2 cacm
decemb 1969 claringbold p j analysi of varianc analysi of
covari regress analysi experiment design matrix direct product protect oper
orthogon matrix 5 14 5 5 ca691210 jb februari 15
1978 2 23 pm 1801 5 1802 1802 5 1802
1802 5 1802 1802 5 1802 1802 6 1802 
# 1803
complex root find algorithm 365 c5 cacm decemb 1969 bach
h downhil method complex relax method complex iter complex equat
transcendent complex equat algebra complex equat 5 15 ca691209 jb
februari 15 1978 2 25 pm 1803 4 1803 1806
5 1803 1803 5 1803 1803 5 1803 1803 5
1803 
# 1804
color polygon region algorithm 364 z cacm decemb 1969 herriot
r g color polygon region color planar surfac draw pictur
shade enclos region 4 9 ca691208 jb februari 15 1978
2 27 pm 1804 4 1804 1804 4 1804 2987
4 1804 2987 4 1804 1804 5 1804 1804 5
1804 1804 5 1804 421 5 1804 524 5 1804
# 1805
product of multiprogram comput progress in develop an analyt predict
method multiprogram as it is discuss here is a mode
of comput oper in which two or more program ar
concurr in processor memori and proceed each us the same
central processor unit cpu and input output i o channel
these program ar actual proceed intermitt and singli accord to
elig readi to proce and prioriti it is us to
be abl to repres them as proceed continu and simultan
each at an effect rate which mai be a fraction
of that which it would enjoi in the absenc of
the other program the effect progress rate of each program
is sensit to mani detail characterist of itself and it
co resid and simul ha been the best avail method
of predict it thi paper present the result of progress
in develop an altern to simul a simul test iter
comput of these rate under certain situat the algorithm is
sensit to most of the factor that control the phenomenon
includ nonquantit or topolog featur of the program structur cacm
decemb 1969 lasser d j product predict multiprogram simul equip
evalu hardwar evalu monitor oper system system softwar supervisor perform
time share time slice 2 43 2 44 4 32
ca691207 jb februari 15 1978 2 47 pm 1805 4
1805 1805 4 1805 1805 4 1805 1828 4 1805
1846 4 1805 1854 4 1805 1892 4 1805 1912
4 1805 2187 4 1805 2188 4 1805 2218 4
1805 2317 4 1805 1518 5 1805 1572 5 1805
1748 5 1805 1805 5 1805 1805 5 1805 1805
5 1805 3070 5 1805 1805 6 1805 2454 6
1805 2741 6 1805 2988 6 1805 
# 1806
on the downhil method the downhil method is a numer
method for solv complex equat f z 0 on which
the onli restrict is that the function w f z
must be analyt an introduct to thi method is given
and a critic review of relat literatur is present although
in theori the method alwai converg it is shown that
a fundament dilemma exist which mai caus a breakdown in
practic applic to avoid thi difficulti and to improv the
rate of converg toward a root some modif of the
origin method ar propos and a program fortran base on
the modifi method is given in algorithm 365 some numer
exampl ar includ cacm decemb 1969 bach h downhil method
complex relax method complex iter complex equat transcendent complex equat
algebra complex equat 5 15 ca691206 jb februari 15 1978
2 54 pm 1806 4 1806 1806 5 1806 1806
5 1806 1806 5 1806 1803 5 1806 535 5
1806 1806 6 1806 
# 1807
optim of express in fortran a method of optim the
comput of arithmet and index express of a fortran program
is present the method is base on a linear analysi
of the definit point of the variabl and the branch
and do loop structur of the program the object of
the process ar 1 to elimin redund calcul when refer
ar made to common subexpress valu 2 to remov invari
calcul from do loop 3 to effici comput subscript contain
do iter variabl and 4 to provid effici index regist
usag the method present requir at least a three pass
compil the second of which is scan backward it ha
been us in the develop of sever fortran compil that
have prove to produc excel object code without significantli reduc
the compil speed cacm decemb 1969 busam v a england
d e fortran optim express compil compil subscript regist alloc
do loop common subexpress invari calcul 4 12 ca691205 jb
februari 15 1978 4 16 pm 1625 4 1807 1781
4 1807 1807 4 1807 1807 4 1807 1807 4
1807 1807 4 1807 1934 4 1807 1945 4 1807
1947 4 1807 1947 4 1807 2034 4 1807 2175
4 1807 2290 4 1807 2579 4 1807 2923 4
1807 2945 4 1807 1223 5 1807 1248 5 1807
1551 5 1807 1807 5 1807 1807 5 1807 1807
5 1807 1947 5 1807 2579 5 1807 2923 5
1807 1535 6 1807 1807 6 1807 1807 6 1807
1947 6 1807 1947 6 1807 
# 1808
advanc cryptograph techniqu for comput cryptograph techniqu which can be
us to maintain the confidenti of inform process by comput
ar dealt with special emphasi is paid to the uniqu
characterist of comput file that make mani cryptograph method of
littl us rel secur cost and prefer method ar includ
in thi paper cacm decemb 1969 van tassel d cryptograph
cryptanalysi cipher secreci system secur system confidenti inform process 1
3 2 12 2 19 3 73 3 81 4
41 ca691204 jb februari 15 1978 4 20 pm 1808
5 1808 1808 5 1808 1808 5 1808 
# 1809
numer analysi in a ph comput scienc program numer analysi
is the studi of method and procedur us to obtain
approxim solut to mathemat problem much of the emphasi is
on scientif calcul the difficulti of educ in such a
broad area center around the question of background and emphasi
the numer analysi program in the comput scienc depart should
emphas an awar of the problem of comput implement and
experiment procedur nevertheless there is a need for a solid
background in appli mathemat cacm decemb 1969 parter s v
ph program numer analysi cours separ educ 1 52 ca691203
jb februari 15 1978 4 25 pm 1809 5 1809
1809 5 1809 1809 5 1809 
# 1810
is automat fold of program effici enough to displac manual
the oper of fold a program into the avail memori
is discuss measur by brown et al and by nelson
on an automat fold mechan of simpl design a demand
page unit built at the ibm research center by beladi
nelson o neil and other permit it qualiti to be
compar with that of manual fold ar discuss and it
is shown that given some care in us the unit
perform satisfactorili under the condit test even though it is
oper across a memori to storag interfac with a veri
larg speed differ the disadvantag of prefold which is requir
when the fold is manual ar examin and a number
of the import troubl which beset comput todai ar shown
to aris from or be aggrav by thi sourc it
is conclud that a fold mechan will probabl becom a
normal part of most comput system cacm decemb 1969 sayr
d page automat page demand page fold automat fold storag
hierarchi memori hierarchi replac algorithm perform measur 4 0 4
19 4 39 6 20 6 34 ca691202 jb februari
15 1978 4 33 pm 1810 5 1810 1810 5
1810 1810 5 1810 2218 5 1810 2373 5 1810
1380 6 1810 1410 6 1810 1572 6 1810 1728
6 1810 1751 6 1810 1751 6 1810 1752 6
1810 1810 6 1810 1810 6 1810 1879 6 1810
1951 6 1810 2095 6 1810 2374 6 1810 
# 1811
a case studi in program for parallel processor an affirm
partial answer is provid to the question of whether it
is possibl to program parallel processor comput system to effici
decreas execut time for us problem parallel processor system ar
multiprocessor system in which sever of the processor can simultan
execut separ task of a singl job thu cooper to
decreas the solut time of a comput problem the processor
have independ instruct counter mean that each processor execut it
own task program rel independ of the other processor commun
between cooper processor is by mean of data in storag
share by all processor a program for the determin of
the distribut of current in an electr network wa written
for a parallel processor comput system and execut of thi
program wa simul the data gather from simul run demonstr
the effici solut of thi problem typic of a larg
class of import problem it is shown that with proper
program solut time when n processor ar appli approach 1
n time the solut time for a singl processor while
improp program can actual lead to an increas of solut
time with the number of processor stabil of the method
of solut wa also investig cacm decemb 1969 rosenfeld j
l parallel processor parallel parallel program multiprocessor multiprogram task storag
interfer electr network simul relax jacobi gauss seidel converg 3
24 4 9 5 14 5 17 6 21 ca691201
jb februari 15 1978 4 45 pm 1811 5 1811
1811 5 1811 1811 5 1811 
# 1812
more on fortran random number gener cacm novemb 1969 grosenbaugh
l r random number gener mont carlo simul 5 5
ca691118 jb februari 15 1978 11 57 am 1812 5
1812 1812 5 1812 1812 5 1812 
# 1813
gener of permut in pseudo lexicograph order algorithm 308 g6
cacm novemb 1969 ord smith r j permut lexicograph order
lexicograph gener permut gener 5 39 ca691117 jb februari 15
1978 11 59 am 1813 4 1813 1370 5 1813
1813 5 1813 1813 5 1813 1813 5 1813 1978
5 1813 1307 6 1813 1589 6 1813 1813 6
1813 
# 1814
direct search algorithm 178 e4 cacm novemb 1969 smith l
b function minim search direct search 5 19 ca691117 jb
februari 15 1978 12 00 pm 1814 4 1814 1777
5 1814 1814 5 1814 1814 5 1814 1814 5
1814 
# 1815
direct search algorithm 178 e4 cacm novemb 1969 tomlin f
k smith l b function minim search direct search 5
19 ca691115 jb februari 15 1978 12 02 pm 1815
4 1815 1715 5 1815 1815 5 1815 1815 5
1815 1815 5 1815 
# 1816
gener least squar fit by orthogon polynomi algorithm 296 e2
cacm novemb 1969 watson w t least squar curv fit
orthogon polynomi three term recurr polynomi regress approxim forsyth s
method 5 13 5 5 ca691114 jb februari 15 1978
12 06 pm 1816 4 1816 125 5 1816 1816
5 1816 1816 5 1816 1816 5 1816 
# 1817
comput of fourier coeffici algorithm 255 c6 cacm novemb 1969
hall g rai v a numer integr fourier coeffici filon
s method 5 16 ca691113 jb februari 15 1978 12
08 pm 1817 5 1817 1817 5 1817 1817 5
1817 
# 1818
associ legendr function of the first kind for real or
imaginari argument algorithm 47 s16 cacm novemb 1969 cobb s
m legendr function associ legendr function real or imaginari argument
5 12 ca691112 jb februari 15 1978 12 11 pm
1818 4 1818 1818 5 1818 1818 5 1818 1818
5 1818 2222 5 1818 778 5 1818 970 6
1818 1800 6 1818 1818 6 1818 1834 6 1818
2042 6 1818 
# 1819
complex error function algorithm 363 s15 cacm novemb 1969 gautschi
w error function for complex argument voigt function laplac continu
fraction gauss hermit quadratur recurs comput 5 12 ca691111 jb
februari 15 1978 12 13 pm 1819 5 1819 1819
5 1819 1819 5 1819 
# 1820
gener of random permut algorithm 362 g6 cacm novemb 1969
robson j m permut random permut transposit 5 5 ca691110
jb februari 15 1978 12 15 pm 1820 4 1820
1511 5 1820 1820 5 1820 1820 5 1820 1820
5 1820 
# 1821
perman function of a squar matrix i and ii algorithm
361 g6 cacm novemb 1969 shriver b eberlein p j
dixon r d matrix perman determin 5 30 ca691109 jb
februari 15 197812 18 pm 1821 5 1821 1821 5
1821 1821 5 1821 
# 1822
shortest path forest with topolog order algorithm h cacm novemb
1969 dial r b shortest path tree network direct graph
5 32 5 42 ca691108 jb februari 15 1978 12
21 pm 1822 5 1822 1822 5 1822 1822 5
1822 
# 1823
factori analysi of varianc algorithm g1 cacm novemb 1969 howel
j r factori varianc analysi varianc statist analysi 5 5
ca691107 jb februari 15 1978 12 22 pm 1823 5
1823 1823 5 1823 1823 5 1823 
# 1824
aparel a pars request languag aparel is describ thi languag
is an extens to an algorithm languag pl i that
provid the pattern match capabl normal found onli in special
purpos languag such as snobol4 and tmg thi capabl is
provid through pars request state in a bnf like format
these pars request form their own program languag with special
sequenc rule upon successfulli complet a pars request an associ
piec of pl i code is execut thi code ha
avail for us as normal pl i string the variou
piec at all level of the pars it also ha
avail as normal pl i variabl the inform concern which
of the variou altern were success conveni facil for multipl
input output stream the initi of sequenc of pars request
as a subroutin and pars time semant check ar also
includ aparel ha proven conveni in build a power syntax
and function macro system an algebra languag preprocessor debug system
an on line command parser a translat for dataless program
and as a gener string manipul cacm novemb 1969 balzer
r m farber d j text process string process symbol
manipul pl i bnf syntax parser translat pattern match 4
12 4 13 4 20 4 22 4 29 ca691106
jb februari 15 1978 12 44 pm 1046 4 1824
1105 4 1824 1139 4 1824 1140 4 1824 1234
4 1824 1263 4 1824 1265 4 1824 1496 4
1824 1541 4 1824 1565 4 1824 1665 4 1824
1693 4 1824 1768 4 1824 1781 4 1824 1781
4 1824 1781 4 1824 1787 4 1824 1824 4
1824 1824 4 1824 1824 4 1824 1824 4 1824
1825 4 1824 1836 4 1824 1861 4 1824 1861
4 1824 2015 4 1824 2110 4 1824 2126 4
1824 2126 4 1824 2127 4 1824 2187 4 1824
2252 4 1824 2317 4 1824 2545 4 1824 2546
4 1824 464 4 1824 2698 4 1824 2733 4
1824 584 4 1824 631 4 1824 653 4 1824
680 4 1824 763 4 1824 795 4 1824 799
4 1824 945 4 1824 1358 5 1824 1614 5
1824 1781 5 1824 1824 5 1824 1824 5 1824
1824 5 1824 404 5 1824 
# 1825
a practic method for construct lr k processor a practic
method for construct lr k processor is develop these processor
ar capabl of recogn and pars an input dure a
singl no backup scan in a number of step equal
to the length of the input plu the number of
step in it deriv the techniqu present here is base
on the origin method describ by knuth but decreas both
the effort requir to construct the processor and the size
of the processor produc thi procedur involv partit the given
grammar into a number of smaller part if an lr
k processor can be construct for each part us knuth
s algorithm and if certain condit relat these individu processor
ar satisfi then an lr k processor for the entir
grammar can be construct for them us thi procedur an
lr 1 parser for algol ha been obtain cacm novemb
1969 korenjak a j lr k grammar syntact analysi parser
determinist languag syntax direct compil languag processor context free languag
algol 4 12 5 2 5 23 ca691105 jb februari
15 1978 12 52 pm 1086 4 1825 1132 4
1825 1234 4 1825 1263 4 1825 1265 4 1825
1270 4 1825 1323 4 1825 1358 4 1825 1379
4 1825 1380 4 1825 1453 4 1825 1464 4
1825 1484 4 1825 1491 4 1825 1498 4 1825
1613 4 1825 1614 4 1825 1665 4 1825 1768
4 1825 1781 4 1825 1787 4 1825 1824 4
1825 1825 4 1825 1825 4 1825 1836 4 1825
1860 4 1825 1861 4 1825 2015 4 1825 2083
4 1825 2110 4 1825 2127 4 1825 2178 4
1825 2179 4 1825 2187 4 1825 2252 4 1825
2317 4 1825 2325 4 1825 2341 4 1825 2545
4 1825 2546 4 1825 2645 4 1825 2652 4
1825 2684 4 1825 2698 4 1825 2733 4 1825
2842 4 1825 2929 4 1825 2934 4 1825 3069
4 1825 669 4 1825 679 4 1825 691 4
1825 761 4 1825 949 4 1825 989 4 1825
1781 5 1825 1825 5 1825 1825 5 1825 1825
5 1825 2061 5 1825 2179 5 1825 3184 5
1825 1140 6 1825 1141 6 1825 1477 6 1825
1477 6 1825 1491 6 1825 1491 6 1825 1825
6 1825 1825 6 1825 2015 6 1825 2110 6
1825 3184 6 1825 773 6 1825 
# 1826
a lisp garbag collector for virtual memori comput system in
thi paper a garbag collect algorithm for list process system
which oper within veri larg virtual memori is describ the
object of the algorithm is more the compact of activ
storag than the discoveri of free storag becaus free storag
is never realli exhaust the decis to garbag collect is
not easili made therefor variou criteria of thi decis ar
discuss cacm novemb 1969 fenichel r r yochelson j c
garbag collector virtual memori list process storag alloc 4 19
4 49 ca691104 jb februari 15 1978 12 57 pm
1024 4 1826 1051 4 1826 1102 4 1826 1132
4 1826 1390 4 1826 1486 4 1826 1549 4
1826 1706 4 1826 1708 4 1826 1781 4 1826
1826 4 1826 1826 4 1826 1860 4 1826 1878
4 1826 378 4 1826 2060 4 1826 2155 4
1826 2156 4 1826 2168 4 1826 2168 4 1826
2249 4 1826 2314 4 1826 2719 4 1826 2719
4 1826 2723 4 1826 2736 4 1826 2833 4
1826 2838 4 1826 2842 4 1826 2855 4 1826
2879 4 1826 3077 4 1826 3080 4 1826 3106
4 1826 627 4 1826 106 4 1826 210 5
1826 1626 5 1826 1826 5 1826 1826 5 1826
1826 5 1826 1972 5 1826 2156 5 1826 2168
5 1826 2438 5 1826 2723 5 1826 2736 5
1826 2833 5 1826 2855 5 1826 3074 5 1826
3112 5 1826 106 6 1826 1380 6 1826 1549
6 1826 1549 6 1826 1626 6 1826 1626 6
1826 1626 6 1826 1626 6 1826 1749 6 1826
1826 6 1826 1826 6 1826 1826 6 1826 1826
6 1826 1826 6 1826 1826 6 1826 1826 6
1826 1826 6 1826 1826 6 1826 1826 6 1826
210 6 1826 210 6 1826 210 6 1826 1853
6 1826 1853 6 1826 1853 6 1826 1878 6
1826 1972 6 1826 1972 6 1826 1972 6 1826
1972 6 1826 1972 6 1826 2314 6 1826 2438
6 1826 2513 6 1826 2651 6 1826 2723 6
1826 2723 6 1826 2736 6 1826 2736 6 1826
2766 6 1826 2833 6 1826 2833 6 1826 2838
6 1826 2998 6 1826 627 6 1826 731 6
1826 731 6 1826 731 6 1826 
# 1827
perform monitor in a time share system a softwar measur
facil which is part of a gener purpos time share
system is describ the date collect facil dcf ha been
implement in the michigan termin system mt for the system
360 model 67 it exist for the purpos of monitor
oper system and user program behavior and perform the overal
structur of mt is outlin in order to explain the
implement of the dcf event in the system ar identifi
and record from within the supervisor and dump to magnet
tape by an auxiliari program for off line process event
in user program which ar unrel to system action ar
record with a supervisor call the time of occurr of
each event is accur record and data item ar further
identifi by job and type the overhead associ with data
collect and it interfer with normal job is carefulli analyz
and both ar shown to be minim sever exampl ar
given of inform obtain with the facil and of applic
in which it ha been us some gener guidelin ar
offer for the construct of futur monitor program cacm novemb
1969 pinkerton t b perform monitor perform measur program behavior
perform data multiprogram perform softwar measur time share perform system
evalu softwar monitor softwar instrument 4 31 4 32 4
39 4 42 4 43 ca691103 jb februari 15 1978
1 07 pm 1827 5 1827 1827 5 1827 1827
5 1827 2667 5 1827 2668 5 1827 1604 6
1827 1604 6 1827 1728 6 1827 1728 6 1827
1761 6 1827 1827 6 1827 1827 6 1827 2677
6 1827 
# 1828
synchron in a parallel access data base the follow problem
is consid given a data base which can be manipul
simultan by more than on process what ar the rule
for synchron which will maxim the amount of parallel activ
allow it is assum that the data base can be
repres as a graph an exampl of such a data
base is a hierarchi of directori for an on line
file system method for synchron of process ar examin their
valid is discuss and their perform compar cacm novemb 1969
shoshani a bernstein a j parallel access parallel search file
search data base synchron lock deadlock 3 73 3 74
4 32 ca691102 jb februari 15 1978 1 13 pm
1805 4 1828 1828 4 1828 1828 4 1828 1854
4 1828 1854 4 1828 1877 4 1828 1960 4
1828 2150 4 1828 2187 4 1828 2317 4 1828
2319 4 1828 2377 4 1828 2342 4 1828 2376
4 1828 2379 4 1828 2424 4 1828 2482 4
1828 2618 4 1828 2632 4 1828 2704 4 1828
2723 4 1828 2738 4 1828 2740 4 1828 2741
4 1828 2867 4 1828 3184 4 1828 1748 5
1828 1749 5 1828 1828 5 1828 1828 5 1828
1828 5 1828 
# 1829
an interact graphic displai monitor in a batch process environ
with remot entri a graphic monitor program is describ it
wa develop at carnegi mellon univers for the cdc g21
comput which is a gener purpos batch process system with
remot entri the exist g21 system and the graphic hardwar
ar describ the graphic monitor is a resid auxiliari monitor
which provid comprehens manageri capabl over the graphic system in
respons to command from the human user it also will
respond to command from a user program through a similar
interfac where routin call take the place of manual action
thu the human and program can interact on a symmetr
and equal basi through the medium of the graphic monitor
the choic made in design the graphic monitor given the
constraint of the exist hardwar and comput system ar discuss
the structur of the monitor program and the human and
program interfac ar describ there is also a transient swap
version with a small resid part and provis for swap
us submonitor cacm novemb 1969 bond a h rightnour j
graphic monitor man machin interact graphic interfac graphic in batch
environ design of graphic system 4 30 4 31 4
39 4 41 ca691101 jb februari 15 1978 1 22
pm 1829 5 1829 1829 5 1829 1829 5 1829
2357 5 1829 1523 6 1829 1829 6 1829 2035
6 1829 
# 1830
retriev time for a pack direct access invert file cacm
octob 1969 bay a j inform retriev direct access memori
data base invert list 3 70 4 41 ca691016 jb
februari 15 1978 1 27 pm 1830 5 1830 1830
5 1830 1830 5 1830 
# 1831
a comment on optim tree structur cacm octob 1969 stanfel
l e inform retriev file search tree structur doubl chain
3 70 3 73 3 74 ca691015 jb februari 15
1978 1 31 pm 1831 5 1831 1831 5 1831
1831 5 1831 2257 5 1831 2360 5 1831 849
6 1831 849 6 1831 1831 6 1831 1831 6
1831 1936 6 1831 1936 6 1831 2360 6 1831
# 1832
minimax logarithm error cacm octob 1969 dunham c b logarithm
error transform ration approxim squar root 5 10 ca691014 jb
februari 15 1978 1 38 pm 1832 4 1832 1999
4 1832 2159 4 1832 1832 5 1832 1832 5
1832 1832 5 1832 1932 5 1832 
# 1833
an ambigu in the descript of algol 60 cacm octob
1969 herriot j g is problem zero on sequenc 5
39 ca691013 jb februari 15 1978 1 40 pm 1833
5 1833 1833 5 1833 1833 5 1833 2066 5
1833 1833 6 1833 1842 6 1833 
# 1834
an axiomat basi for comput program in thi paper an
attempt is made to explor the logic foundat of comput
program by us of techniqu which were first appli in
the studi of geometri and have later been extend to
other branch of mathemat thi involv the elucid of set
of axiom and rule of infer which can be us
in proof of the properti of comput program exampl ar
given of such axiom and rule and a formal proof
of a simpl theorem is displai final it is argu
that import advantag both theoret and practic mai follow from
a pursuanc of these topic cacm octob 1969 hoar c
a r axiomat method theori of program proof of program
formal languag definit program languag design machin independ program program
document 4 0 4 21 4 22 5 20 5
21 5 23 5 24 ca691012 jb februari 15 1978
1 48 pm 1834 5 1834 1834 5 1834 1834
5 1834 2021 5 1834 2222 5 1834 2227 5
1834 2315 5 1834 2326 5 1834 2470 5 1834
2732 5 1834 2865 5 1834 2896 5 1834 2943
5 1834 3014 5 1834 3068 5 1834 3077 5
1834 3143 5 1834 196 6 1834 970 6 1834
1303 6 1834 1303 6 1834 1323 6 1834 1348
6 1834 1469 6 1834 1800 6 1834 1818 6
1834 210 6 1834 1834 6 1834 1834 6 1834
1834 6 1834 1834 6 1834 1834 6 1834 1834
6 1834 1834 6 1834 1834 6 1834 1834 6
1834 1834 6 1834 1834 6 1834 1834 6 1834
1834 6 1834 1834 6 1834 1987 6 1834 307
6 1834 2042 6 1834 2060 6 1834 2192 6
1834 2227 6 1834 2264 6 1834 2457 6 1834
2597 6 1834 2723 6 1834 2732 6 1834 2869
6 1834 2981 6 1834 3186 6 1834 728 6
1834 
# 1835
the iitran program languag the iitran languag develop to be
us by student and it import import featur ar describ
iitran is a procedur orient languag with a on level
block structur and a varieti of data type sever novel
and power featur ar includ a discuss of design principl
to be follow in a student languag is given cacm
octob 1969 dewar r b k hochsprung r r languag
program languag student program system languag design high school program
colleg cours 1 51 1 52 4 12 4 22
ca691011 jb februari 15 1978 1 54 pm 1835 5
1835 1835 5 1835 1835 5 1835 2971 5 1835
1835 6 1835 1974 6 1835 2534 6 1835 
# 1836
a new method for determin linear preced function for preced
grammar the preced relat of a preced grammar can be
precis describ by a two dimension preced matrix often the
inform in the matrix can be repres more concis by
a pair of vector call linear preced function a new
algorithm is present for obtain the linear preced function when
given the preced matrix thi algorithm is shown to possess
sever comput advantag cacm octob 1969 bell j r boolean
matric syntax preced grammar context free pars transit matrix preced
function 4 12 ca691010 jb februari 15 1978 3 13
pm 1379 4 1836 1542 4 1836 1665 4 1836
1683 4 1836 1693 4 1836 1693 4 1836 1768
4 1836 1781 4 1836 1781 4 1836 1787 4
1836 1787 4 1836 1824 4 1836 1825 4 1836
1836 4 1836 1836 4 1836 1836 4 1836 1836
4 1836 1836 4 1836 1861 4 1836 1945 4
1836 1945 4 1836 2015 4 1836 2015 4 1836
2060 4 1836 2060 4 1836 2061 4 1836 2061
4 1836 2082 4 1836 2091 4 1836 2091 4
1836 2110 4 1836 2127 4 1836 2152 4 1836
2179 4 1836 2179 4 1836 2187 4 1836 2317
4 1836 2340 4 1836 2340 4 1836 2356 4
1836 2545 4 1836 2546 4 1836 2546 4 1836
2603 4 1836 2698 4 1836 2698 4 1836 2698
4 1836 2708 4 1836 2708 4 1836 2733 4
1836 2824 4 1836 2982 4 1836 2986 4 1836
3045 4 1836 3045 4 1836 3093 4 1836 1191
5 1836 1477 5 1836 1491 5 1836 1781 5
1836 1836 5 1836 1836 5 1836 1836 5 1836
2340 5 1836 2982 5 1836 2986 5 1836 577
5 1836 1191 6 1836 1491 6 1836 1491 6
1836 1491 6 1836 1683 6 1836 1683 6 1836
1836 6 1836 1836 6 1836 1836 6 1836 2179
6 1836 2340 6 1836 2340 6 1836 
# 1837
an algol convolut procedur base on the fast fourier transform
algorithm 345 c6 cacm octob 1969 singleton r c fast
fourier transform complex fourier transform multivari fourier transform fourier seri
harmon analysi spectral analysi orthogon polynomi orthogon transform convolut auto
covari autocorrel cross correl digit filter permut 3 15 3
83 5 12 5 14 ca691009 jb februari 15 1978
3 17 pm 1837 5 1837 1837 5 1837 1837
5 1837 
# 1838
normal curv integr algorithm 304 s15 cacm octob 1969 adam
a g normal curv integr probabl special function 5 5
5 12 ca691008 jb februari 15 1978 3 19 pm
1838 4 1838 1760 5 1838 1838 5 1838 1838
5 1838 1838 5 1838 
# 1839
singular valu decomposit of a complex matrix algorithm 358 f1
4 5 cacm octob 1969 busing p a goulub g
h singular valu matrix decomposit least squar solut pseudoinvers 5
14 ca691007 jb februari 15 1978 3 22 pm 1839
5 1839 1839 5 1839 1839 5 1839 
# 1840
an effici prime number gener algorithm 357 a1 cacm octob
1969 singleton r c prime number factor number theori 3
15 5 30 ca691006 jb februari 15 1978 3 23
pm 1840 5 1840 1840 5 1840 1840 5 1840
2927 5 1840 1537 6 1840 1539 6 1840 1538
6 1840 1840 6 1840 1841 6 1840 
# 1841
a prime number gener us the treesort principl algorithm 356
a1 cacm octob 1969 singleton r c prime number number
theori sort 3 15 5 30 5 31 ca691005 jb
februari 15 1978 3 25 pm 1841 4 1841 1841
4 1841 1841 4 1841 1967 4 1841 2120 4
1841 2120 4 1841 2927 4 1841 2927 4 1841
1539 5 1841 1841 5 1841 1841 5 1841 1841
5 1841 1841 5 1841 377 5 1841 2927 5
1841 1537 6 1841 1539 6 1841 1539 6 1841
1538 6 1841 1840 6 1841 1841 6 1841 1841
6 1841 377 6 1841 
# 1842
an algorithm for gener is configur algorithm 355 z cacm
octob 1969 simo j m s is problem zero on
sequenc 5 39 ca691004 jb februari 15 1978 3 27
pm 1842 5 1842 1842 5 1842 1842 5 1842
2066 5 1842 1833 6 1842 1842 6 1842 
# 1843
the choic of base a digit comput is consid whose
memori word ar compos on n r state devic plu
two sign bit two state devic the choic of base
b for the intern represent of float point number on
such a comput is discuss it is shown that in
a certain sens b r is best cacm octob 1969
brown w s richman p l float point accuraci base
choic number represent 5 11 6 32 ca691003 jb februari
15 1978 3 33 pm 1783 4 1843 1843 4
1843 1843 4 1843 1634 5 1843 1783 5 1843
1843 5 1843 1843 5 1843 1843 5 1843 
# 1844
a modular comput share system an altern approach to the
design and organ of a gener purpos interact multitermin comput
system is present the system organ describ is a conceptu
simpl arrang of a bank of interchang comput each of
which is a memori processor pair that ar assign to
process termin job as thei arriv on of the comput
serv as the master or control comput and supervis the
collect and distribut of messag from and to the remot
termin in the simplest form there is a disk drive
for each connect termin a crosspoint switch network allow ani
such disk drive to be connect to ani comput thu
while each activ termin user occupi a dedic disk drive
he mai share the comput with mani other termin user
in a simpl manner the ratio of user to comput
is depend on both the size and power of the
machin us and the comput requir of the particular mix
of user thi system organ is inher a simpler and
therefor more reliabl approach to time share comput and ha
the potenti of a highli avail system at rel low
cost econom configur ar possibl for a rang of system
size that span at least on order of magnitud final
problem program develop by remot termin user can be run
on a dedic batch system if compat comput ar us
cacm octob 1969 baskin h b horowitz e b tennison
r d rittenhous l e multipl termin system termin orient
system multipl processor system high avail convers system gener purpos
time share system real time respons system modular construct system
modular comput share system graphic file switch intercomput commun control
comput problem comput roll in roll out 6 21 ca691002
jb februari 15 1978 3 52 pm 1844 5 1844
1844 5 1844 1844 5 1844 
# 1845
loader standard for overlai program the overlai capabl is describ
for four of the third gener comput system cdc 6000
ge 635 ibm 360 and univac 1108 a critiqu of
the first three system is base on actual experi with
a larg overlaid trajectori simul program a short histori and
descript of thi program is present a standard of minimum
capabl for loader is recommend so that program which must
oper under more than on comput system mai be easili
convert and maintain a propos that overlai softwar incorpor a
memori occup specif concept instead of the condit tree structur
is delin thi concept provid more effici and cost effect
util of the memori as well as increas flexibl in
program structur cacm octob 1969 lanzano b c loader overlai
partit region segment linkag linkag editor standard memori util memori
occup tree structur cdc 6000 ge 635 ibm 360 univac
1108 4 10 4 12 4 19 4 40 ca691001
jb februari 15 1978 4 09 pm 1845 4 1845
1900 4 1845 2083 4 1845 2154 4 1845 2270
4 1845 2693 4 1845 988 5 1845 1845 5
1845 1845 5 1845 1845 5 1845 2343 5 1845
1173 6 1845 1774 6 1845 1845 6 1845 
# 1846
on simul network of parallel process in which simultan event
mai occur some of the problem of simul discret event
system particularli comput system on a convent digit comput ar
dealt with the system ar assum to be describ as
a network of interconnect sequenti process briefli review ar the
common techniqu us to handl such simul when simultan event
do not occur can be ignor or can be handl
by simpl prioriti rule follow thi the problem of deal
with simultan event in separ process is introduc an abstract
of thi problem is develop which admit solut for a
major of commonli encount problem the techniqu will either find
a method of simul the parallel event or report that
none can be found in some of the latter case
it is shown to be possibl to find a solut
by extend the inform avail to the solut techniqu but
in mani case the techniqu becom computation unfeas when the
addit inform is provid cacm septemb 1969 parna d l
simul parallel process simultan event pictur process comput system simul
3 19 3 24 4 24 5 9 6 9
ca690910 jb februari 15 1978 4 21 pm 1541 4
1846 1805 4 1846 1846 4 1846 1846 4 1846
1846 4 1846 1846 4 1846 1846 4 1846 1892
4 1846 2060 4 1846 2188 4 1846 2218 4
1846 2218 4 1846 2317 4 1846 2630 4 1846
2650 4 1846 3112 4 1846 1380 5 1846 1424
5 1846 1484 5 1846 1572 5 1846 1846 5
1846 1846 5 1846 1846 5 1846 576 5 1846
3064 5 1846 1846 6 1846 1939 6 1846 2742
6 1846 2767 6 1846 2936 6 1846 
# 1847
an algorithm for find a fundament set of cycl of
a graph a fast method is present for find a
fundament set of cycl for an undirect finit graph a
span tree is grown and the vertic examin in turn
unexamin vertic be store in a pushdown list to await
examin on stage in the process is to take the
top element v of the pushdown list and examin it
i e inspect all those edg v z of the
graph for which z ha not yet been examin if
z is alreadi in the tree a fundament cycl is
ad if not the edg v z is place in
the tree there is exactli on such stage for each
of the n vertic of the graph for larg n
the store requir in creas as n 2 and the
time as n g where g depend on the type
of graph involv g is bound below by 2 and
abov by 3 and it is shown that both bound
ar attain in term of storag our algorithm is similar
to that of gotlieb and corneil and superior to that
of welch in term of speed it is similar to
that of welch and superior to that of gotlieb and
corneil testsshow our algorithm to be remark effici g 2
on random graph cacm septemb 1969 paton k fundament cycl
set graph algorithm cycl span tree 5 32 ca690909 jb
februari 15 1978 4 29 pm 1847 4 1847 1961
4 1847 2052 4 1847 1504 5 1847 1847 5
1847 1847 5 1847 1847 5 1847 1961 5 1847
2177 5 1847 2763 5 1847 1369 6 1847 1504
6 1847 1847 6 1847 1847 6 1847 1847 6
1847 
# 1848
the damp taylor s seri method for minim a sum
of squar and for solv system of nonlinear equat algorithm
315 e4 c5 cacm septemb 1969 silverman g solut of
equat least squar approxim newton s method 5 13 5
14 5 15 ca690907 jb februari 15 1978 4 32
pm 1848 5 1848 1848 5 1848 1848 5 1848
# 1849
function minim algorithm 251 e4 cacm septemb 1969 hamilton p
a boothroyd j function minim 5 19 ca690906 jb februari
15 1978 4 38 pm 1849 5 1849 1849 5
1849 1849 5 1849 2190 5 1849 1372 6 1849
1849 6 1849 
# 1850
gener of permut in lexicograph order algorithm 323 g6 cacm
septemb 1969 leitch i m permut direct lexicograph order revers
lexicograph order lexicograph gener 5 39 ca690905 jb februari 15
1978 4 48 pm 1850 5 1850 1850 5 1850
1850 5 1850 
# 1851
gener of span tree algorithm 354 h cacm septemb 1969
mcilroi m d span tree tree graph 5 32 ca690904
jb februari 15 1978 4 50 pm 1851 5 1851
1851 5 1851 1851 5 1851 
# 1852
a base for a mobil program system an algorithm for
a macro processor which ha been us as the base
of an implement by bootstrap of processor for program languag
is describ thi algorithm can be easili implement on contemporari
comput machin experi with program languag whose implement is base
on thi algorithm indic that such a languag can be
transfer to a new machin in less than on man
week without us the old machin cacm septemb 1969 orgass
r j wait w m bootstrap macro process machin independ
program languag implement techniqu 4 12 4 22 ca690903 jb
februari 15 1978 4 54 pm 1530 4 1852 1781
4 1852 1852 4 1852 2034 4 1852 1565 5
1852 1852 5 1852 1852 5 1852 1852 5 1852
2034 5 1852 984 6 1852 1231 6 1852 1565
6 1852 1852 6 1852 1926 6 1852 1947 6
1852 
# 1853
compact list represent definit garbag collect and system implement compact
list ar store sequenti in memori rather than chain with
pointer sinc thi is not alwai conveni the swym system
permit a list to be chain compact or ani combin
of the two a descript is given of that list
represent and the oper implement most ar similar to those
of lisp 1 5 the system garbag collector attempt to
make all list compact it reloc and rearrang all of
list storag us temporari storag thi uniqu list compact garbag
collect algorithm is present in detail sever class of the
macro us to implement the system ar describ final consider
is given to those design factor essenti to the success
of a plex process system implement cacm septemb 1969 hansen
w j data structur data represent list structur list represent
list compact list garbag collect reloc storag reclam macro primit
list oper plex process plex pointer list process system lisp
free storag 3 49 4 20 4 22 4 49
4 9 ca690902 jb februari 15 1978 5 01 pm
1853 4 1853 2003 4 1853 1710 5 1853 1853
5 1853 1853 5 1853 1853 5 1853 1972 5
1853 2249 5 1853 2736 5 1853 3074 5 1853
1626 6 1853 1626 6 1853 1708 6 1853 1826
6 1853 1826 6 1853 1826 6 1853 1853 6
1853 1853 6 1853 1853 6 1853 1853 6 1853
1972 6 1853 1972 6 1853 2723 6 1853 
# 1854
on multiprogram machin code and comput organ the author feel
that the interrupt featur which is avail in most modern
comput is a potent sourc of program pitfal and error
and that it therefor mai heavili contribut to the unreli
of program make us of it a program scheme is
present which avoid the concept of the interrupt and permit
the specif of concurr or pseudoconcurr activ in a supposedli
more perspicu manner it is intend to serv as a
basi for the construct of oper system which ar prime
exampl of program with concurr activ the scheme includ a
set of basic instruct for the gener termin and synchron
of parallel process a set of routin repres these instruct
and therebi simul a hypothet machin organ ha been implement
and test on the ibm system 360 two program us
these instruct written in pl360 ar present cacm septemb 1969
wirth n multiprogram parallel interrupt input output comput organ file
handl pl360 4 21 4 22 4 32 4 41
6 21 ca690901 jb februari 15 1978 5 14 pm
1380 4 1854 1458 4 1854 1523 4 1854 1552
4 1854 1603 4 1854 1693 4 1854 1698 4
1854 1747 4 1854 1748 4 1854 1781 4 1854
1805 4 1854 1828 4 1854 1828 4 1854 1854
4 1854 1854 4 1854 1854 4 1854 1854 4
1854 1860 4 1854 1877 4 1854 1877 4 1854
1960 4 1854 1960 4 1854 2060 4 1854 2150
4 1854 2187 4 1854 2317 4 1854 2319 4
1854 2377 4 1854 2377 4 1854 2378 4 1854
2342 4 1854 2376 4 1854 2379 4 1854 2424
4 1854 2482 4 1854 2497 4 1854 2558 4
1854 2618 4 1854 2625 4 1854 2632 4 1854
2632 4 1854 2704 4 1854 2723 4 1854 2738
4 1854 2740 4 1854 2741 4 1854 2840 4
1854 2867 4 1854 2941 4 1854 557 4 1854
3105 4 1854 3144 4 1854 3184 4 1854 1421
5 1854 1471 5 1854 1748 5 1854 1749 5
1854 1854 5 1854 1854 5 1854 1854 5 1854
1960 5 1854 1471 6 1854 1749 6 1854 1854
6 1854 
# 1855
a program for the syntact analysi of english sentenc a
program is describ which produc syntact analys of english sentenc
with respect to a transform grammar the main featur of
the analyz ar that it us onli a limit dictionari
of english word and that it pursu all analysi path
simultan while process the sentenc from left to right the
form of represent us for the dictionari and the grammar
is indic and an outlin account is given of the
analysi procedur techniqu for keep the size of the analysi
record within reason limit and for avoid the need for
dynam applic of certain transform rule ar describ a number
of exampl of output produc by the program ar given
the output includ time inform cacm august 1969 dewar h
bratlei p syntact analysi languag process languag analysi pars analysi
procedur recognit procedur english sentenc linguist psycholinguist transform grammar limit
dictionari predict analysi 3 42 3 36 ca690808 jb februari
15 1978 5 24 pm 1855 5 1855 1855 5
1855 1855 5 1855 
# 1856
the teachabl languag comprehend a simul program and theori of
languag the teachabl languag comprehend tlc is a program design
to be capabl of be taught to comprehend english text
when text which the program ha not seen befor is
input to it it comprehend that text by correctli relat
each explicit or implicit assert of the new text to
a larg memori thi memori is a semant network repres
factual assert about the world the program also creat copi
of the part of it memori which have been found
to relat to the new text adapt and combin these
copi to repres the mean of the new text by
thi mean the mean of all text the program successfulli
comprehend is encod into the same format as that of
the memori in thi form it can be ad into
the memori both factual assert for the memori and the
capabl for correctli relat text to the memori s prior
content ar to be taught to the program as thei
ar need tlc present contain a rel small number of
exampl of such assert and capabl but within the system
notat for express either of these ar provid thu the
program now correspond to a gener process for comprehend languag
and it provid a methodolog for ad the addit inform
thi process requir to actual comprehend text of ani particular
kind the memori structur and comprehens process of tlc allow
new factual assert and capabl for relat text to such
store assert to gener automat that is onc such an
assert or capabl is put into the system it becom
avail to help comprehend a great mani other sentenc in
the futur thu the addit of a singl factual assert
or linguist capabl will often provid a larg increment in
tlc s effect knowledg of the world and in it
overal abil to comprehend text the program s strategi is
present as a gener theori of languag comprehens cacm august
1969 quillian m r natur languag process natur languag comprehens
teachabl comput program psycholog simul human memori simul comput linguist
linguist perform theori 3 36 3 42 3 62 3
65 3 74 ca690807 jb februari 15 1978 5 46
pm 1155 4 1856 1350 4 1856 1456 4 1856
1468 4 1856 1515 4 1856 1659 4 1856 1699
4 1856 1856 4 1856 1856 4 1856 1856 4
1856 2050 4 1856 2127 4 1856 1225 5 1856
1324 5 1856 1553 5 1856 1856 5 1856 1856
5 1856 1856 5 1856 2127 5 1856 2309 5
1856 2310 5 1856 2396 5 1856 1155 6 1856
1324 6 1856 1487 6 1856 1487 6 1856 1527
6 1856 1781 6 1856 1856 6 1856 1856 6
1856 1856 6 1856 1856 6 1856 2092 6 1856
2127 6 1856 2398 6 1856 
# 1857
filon quadratur algorithm d1 cacm august 1969 chase s m
fosdick l d quadratur filon quadratur integr filon integr fourier
coeffici fourier seri 5 16 ca690806 jb februari 15 1978
5 52 pm 1857 4 1857 2393 4 1857 1858
5 1857 1857 5 1857 1857 5 1857 1857 5
1857 1268 6 1857 1857 6 1857 
# 1858
an algorithm for filon quadratur an algorithm for filon quadratur
is describ consider attent ha been devot to an analysi
of the round off and truncat error the algorithm includ
an automat error control featur cacm august 1969 chase s
m fosdick l d quadratur filon quadratur integr filon integr
fourier coeffici fourier seri 5 16 ca690805 jb februari 15
1978 5 55 pm 1858 4 1858 1858 4 1858
1268 5 1858 1858 5 1858 1858 5 1858 1858
5 1858 1857 5 1858 2393 5 1858 1858 6
1858 1858 6 1858 2071 6 1858 
# 1859
error bound for period quintic spline explicit error bound for
period quintic spline interpol ar develop the first third deriv
of the period spline is shown to be a sixth
fourth order approxim at the mesh point to the first
third deriv of the function be interpol cacm august 1969
hall c a spline interpol error bound 5 1 5
13 ca690804 jb februari 15 1978 5 58 pm 1859
5 1859 1859 5 1859 1859 5 1859 
# 1860
an algol base associ languag a high level program languag
for larg complex associ structur ha been design and implement
the underli data structur ha been implement us a hash
code techniqu the discuss includ a comparison with other work
and exampl of applic of the languag cacm august 1969
feldman j a algol associ program languag data structur 4
22 ca690803 jb februari 15 1978 6 02 pm 1051
4 1860 1086 4 1860 1132 4 1860 1234 4
1860 1263 4 1860 1265 4 1860 1270 4 1860
1323 4 1860 1358 4 1860 1379 4 1860 1380
4 1860 1380 4 1860 1396 4 1860 1453 4
1860 1464 4 1860 1484 4 1860 1491 4 1860
1498 4 1860 1503 4 1860 1552 4 1860 1552
4 1860 1613 4 1860 1614 4 1860 1626 4
1860 1665 4 1860 1676 4 1860 1682 4 1860
1693 4 1860 1708 4 1860 1708 4 1860 1728
4 1860 1767 4 1860 1781 4 1860 1781 4
1860 1781 4 1860 1781 4 1860 1781 4 1860
1781 4 1860 1787 4 1860 1825 4 1860 1826
4 1860 1854 4 1860 1860 4 1860 1860 4
1860 1860 4 1860 1860 4 1860 1860 4 1860
1860 4 1860 1860 4 1860 1860 4 1860 1860
4 1860 1860 4 1860 1945 4 1860 1957 4
1860 1973 4 1860 1973 4 1860 1988 4 1860
1992 4 1860 2018 4 1860 2018 4 1860 2032
4 1860 2033 4 1860 2033 4 1860 2060 4
1860 2083 4 1860 2091 4 1860 2107 4 1860
2107 4 1860 2109 4 1860 2109 4 1860 2155
4 1860 2155 4 1860 2156 4 1860 2162 4
1860 2168 4 1860 2178 4 1860 2179 4 1860
2203 4 1860 2203 4 1860 2249 4 1860 2251
4 1860 2251 4 1860 2252 4 1860 2252 4
1860 2299 4 1860 2314 4 1860 2325 4 1860
2341 4 1860 2359 4 1860 2524 4 1860 2543
4 1860 2543 4 1860 2546 4 1860 2552 4
1860 2559 4 1860 2573 4 1860 2645 4 1860
2652 4 1860 2684 4 1860 2719 4 1860 2736
4 1860 2770 4 1860 2833 4 1860 2842 4
1860 2929 4 1860 2934 4 1860 2991 4 1860
557 4 1860 3053 4 1860 3069 4 1860 669
4 1860 679 4 1860 691 4 1860 761 4
1860 949 4 1860 989 4 1860 1389 5 1860
1366 5 1860 1421 5 1860 1496 5 1860 1626
5 1860 1641 5 1860 1785 5 1860 1786 5
1860 1860 5 1860 1860 5 1860 1860 5 1860
1957 5 1860 378 5 1860 2151 5 1860 3103
5 1860 3148 5 1860 3184 5 1860 1389 6
1860 1653 6 1860 1747 6 1860 1860 6 1860
1860 6 1860 1860 6 1860 1860 6 1860 2817
6 1860 2865 6 1860 2877 6 1860 2939 6
1860 3073 6 1860 731 6 1860 
# 1861
the mad definit facil on of the first definit facil
for higher level languag is describ user of the languag
can defin new oper and or data type into the
mad languag so that their us appear as if thei
were predefin inform is given on how on write definit
as well as on much of the motiv behind the
form in which definit ar written some conclus ar drawn
about futur definit facil cacm august 1969 arden b w
galler b a graham r m mad definit oper macro
higher level languag 4 12 4 22 ca690802 jb februari
15 1978 6 07 pm 1134 4 1861 1179 4
1861 1665 4 1861 1693 4 1861 1768 4 1861
1781 4 1861 1787 4 1861 1824 4 1861 1824
4 1861 1825 4 1861 1836 4 1861 1861 4
1861 1861 4 1861 1861 4 1861 2015 4 1861
2110 4 1861 2126 4 1861 2127 4 1861 2187
4 1861 2317 4 1861 2545 4 1861 2698 4
1861 2733 4 1861 1614 5 1861 1781 5 1861
1861 5 1861 1861 5 1861 1861 5 1861 408
5 1861 
# 1862
comput capabl at argentin and chilean univers the author report
on a trip to univers in argentina and chile dure
novemb 1968 describ univers condit and comput activ as elsewher
these univers ar experienc student discont with the statu quo
and the solut thei ar attempt contrast argentina is exclud
student from particip in univers govern chile is allow such
particip univers comput servic and academ activ ar limit the
number of comput is small and so is the capac
none larger than an ibm 360 40 with some except
comput scienc academ program ar rare thi situat is by
no mean attribut to those respons for comput develop who
strive for excel rather the system is hard to over
come univers especi those with strong european tradit adapt slowli
to new academ resourc and disciplin superimpos ar the sever
technolog and econom constraint of the develop nation consequ in
the absenc of consciou govern emphasi on strengthen comput capabl
futur progress mai be retard cacm august 1969 finerman a
univers educ comput scienc academ program univers comput center survei
of comput center univers comput capabl univers student relationship argentin
univers chilean univers south american univers develop nation 1 52
2 0 2 45 ca690801 jb februari 15 1978 6
21 pm 1862 4 1862 1349 5 1862 1862 5
1862 1862 5 1862 1862 5 1862 
# 1863
minit algorithm for linear program algorithm 333 h cacm juli
1969 messham d k linear program dual simplex method primal
problem dual problem 5 41 ca690717 jb februari 15 1978
6 23 pm 1863 5 1863 1863 5 1863 1863
5 1863 
# 1864
gener of hilbert deriv test matrix algorithm 274 f1 cacm
juli 1969 boothroyd j test matrix hilbert matrix 5 14
ca690716 jb februari 15 1978 6 25 pm 1864 5
1864 1864 5 1864 1864 5 1864 
# 1865
algol 60 refer languag editor algorithm 268 r2 cacm juli
1969 sauer g symbol manipul 4 49 ca690715 jb februari
15 1978 6 26 pm 1865 5 1865 1865 5
1865 1865 5 1865 
# 1866
characterist valu and associ solut of mathieu s differenti equat
algorithm 352 s22 cacm juli 1969 clemm d s mathieu
s differenti equat mathieu function characterist valu period solut radial
solut 5 12 ca690714 jb februari 15 1978 6 30
pm 1866 5 1866 1866 5 1866 1866 5 1866
# 1867
on the expect length of sequenc gener in sort by
replac select in the replac select techniqu of sort on
is interest in the ratio l j of the expect
length of the j th sequenc gener by the techniqu
to the number of memori cell us us complex variabl
theori it is shown that l j 2 and that
asymptot the averag interv between sign chang of l j
2 is 2 6662 cacm juli 1969 hooker w w
replac select sort sequenc length asymptot expect length recurs relat
gener function meromorph function 3 74 5 31 ca690713 jb
februari 15 1978 6 37 pm 1867 4 1867 2272
4 1867 1638 5 1867 1867 5 1867 1867 5
1867 1867 5 1867 
# 1868
on obtain correct input a new approach most inform put
into machin readabl form whether from scientif or busi origin
is still keypunch thi paper is address toward the difficulti
of obtain correctli keypunch and kei verifi data and an
altern method is suggest in which the comput itself is
us to rule out the possibl of error in input
thi techniqu is explain and illustr by refer to a
work program which involv essenti two phase in the first
phase error ar detect by the machin and subsequ in
the second phase thei ar correct by it cacm juli
1969 kennedi m correct data correct input data correct keypunch
kei verifi verifi 2 40 2 42 2 43 3
10 3 20 3 50 4 41 ca690712 jb februari
15 1978 6 43 pm 1868 5 1868 1868 5
1868 1868 5 1868 
# 1869
block structur indirect address and garbag collect program languag have
includ explicit or implicit block structur to provid a name
conveni for the programm howev when indirect address is us
as in snobol name constraint mai be introduc two modif
to snobol ar describ result in two desir consequ 1
name constraint disappear even when there is indirect address within
function definit and 2 there is a signific save in
the number of call to the garbag collector becaus some
garbag is collect at littl expens each time a function
return to it call program these modif have been implement
as an extens to a snobol dialect cacm juli 1969
kain r y block structur indirect address garbag collect local
name snobol 4 22 ca690711 jb februari 15 1978 6
49 pm 1869 4 1869 1869 4 1869 2513 4
1869 2665 4 1869 2723 4 1869 2855 4 1869
3106 4 1869 1549 5 1869 1570 5 1869 1869
5 1869 1869 5 1869 1869 5 1869 2060 5
1869 2770 5 1869 1380 6 1869 1421 6 1869
1469 6 1869 1477 6 1869 1491 6 1869 1786
6 1869 210 6 1869 1869 6 1869 1869 6
1869 1973 6 1869 1992 6 1869 2018 6 1869
2109 6 1869 2110 6 1869 2673 6 1869 
# 1870
some techniqu for us pseudorandom number in comput simul an
algorithm is describ by which uniform pseudorandom integ mai be
us to construct binari number in which the probabl that
each bit in the word is a 1 bit and
can assum ani desir paramet valu techniqu for make us
of such number in simul program ar describ cacm juli
1969 donnelli t random number simul boolean algebra bit manipul
5 19 5 39 ca690710 jb februari 17 1978 8
54 am 1794 4 1870 1870 4 1870 2122 4
1870 1674 5 1870 1870 5 1870 1870 5 1870
1870 5 1870 
# 1871
automat contour map some method for contour map by mean
of a digit plotter ar discuss and a new method
is present that is simpl enough to be implement by
program with a rather small number of instruct about 120
fortran iv instruct ar requir comparison with some method propos
by other author ar also perform a fortran iv program
implement the propos method is avail at the istituto di
elettrotecnica ed elettronica politencnico di milano cacm juli 1969 cottafava
g lemoli g contour map level line digit plot function
scan 3 10 3 13 3 14 3 16 3
20 3 24 ca690709 jb februari 17 1978 8 59
am 1871 5 1871 1871 5 1871 1871 5 1871
3062 5 1871 1871 6 1871 1925 6 1871 
# 1872
chebyshev interpol and quadratur formula of veri high degre errata
cacm juli 1969 salzer h e ca690708 jb februari 17
1978 9 01 am 1872 5 1872 1872 5 1872
1872 5 1872 2394 5 1872 1872 6 1872 1903
6 1872 
# 1873
acceler lp algorithm it is shown how a novel method
for comput relat inner product can acceler the price phase
of lp algorithm other lp applic ar indic cacm juli
1969 fox b l linear program revis simplex method multipl
price inner product 5 19 5 41 ca690707 jb februari
17 19789 08 am 1873 5 1873 1873 5 1873
1873 5 1873 
# 1874
gener pseudorandom number on a two s complement machin such
as the ibm 360 the familiar multipl congruenti gener is
examin in the context of the type of two s
complement arithmet us in the ibm 360 seri differ sequenc
of residu ar consid and relationship establish among them it
is shown that a sequenc of posit and neg residu
mai be produc more simpli and econom than with the
convent approach and yet have twice the period of the
latter without loss of desir statist properti anoth easili gener
sequenc involv absolut valu is also shown to have twice
the period but with less attract statist properti the statist
properti of these sequenc ar given and relat to previous
establish criteria cacm juli 1969 hemmerl w j random number
uniform distribut pseudo random number random number gener multipl congruenti
gener power residu two s complement arithmet ibm 360 arithmet
3 15 5 5 6 32 ca690706 jb februari 17
1978 9 17 am 1874 5 1874 1874 5 1874
1874 5 1874 
# 1875
polynomi and spline approxim by quadrat program the problem of
approxim to a given function or of fit a given
set of data where the approxim function is requir to
have certain of it deriv of specifi sign over the
whole rang of approxim is studi two approach ar present
in each of which quadrat program is us to provid
both the constraint on the deriv and the select of
the function which yield the best fit the first is
a modifi bernstein polynomi scheme and the second is a
spline fit cacm juli 1969 amo d e slater m
l constant sign deriv bernstein polynomi linear concav constraint quadrat
program spline 5 13 5 41 ca690705 jb februari 17
1978 9 22 am 1875 5 1875 1875 5 1875
1875 5 1875 
# 1876
gener of test matric have certain sign pattern and prescrib
posit spectra a class of orthogon transform is present whose
member transform a given posit diagon matrix into a matrix
have on of four special sign pattern cacm juli 1969
schneider a j test matric posit matric sign pattern orthogon
transform posit eigenvalu 5 1 5 14 ca690704 jb februari
17 1978 9 26 am 1876 4 1876 2099 4
1876 1707 5 1876 1876 5 1876 1876 5 1876
1876 5 1876 
# 1877
prevent of system deadlock a well known problem in the
design of oper system is the select of a resourc
alloc polici that will prevent deadlock deadlock is the situat
in which resourc have been alloc to variou task in
such a wai that none of the task can continu
the variou publish solut have been somewhat restrict either thei
do not handl the problem in suffici gener or thei
suggest polici which will on occas refus a request which
could have been safe grant algorithm ar present which examin
a request in the light of the current alloc of
resourc and determin whether or not the grant of the
request will introduc the possibl of a deadlock proof given
in the appendix show that the condit impos by the
algorithm ar both necessari and suffici to prevent deadlock the
algorithm have been successfulli us in the the system cacm
juli 1969 habermann a n multiprogram time share schedul resourc
alloc 3 72 4 32 6 20 ca690703 jb februari
17 1978 9 33 am 1458 4 1877 1523 4
1877 1603 4 1877 1698 4 1877 1747 4 1877
1748 4 1877 1828 4 1877 1854 4 1877 1854
4 1877 1877 4 1877 1877 4 1877 1960 4
1877 1960 4 1877 2150 4 1877 2317 4 1877
2319 4 1877 2377 4 1877 2377 4 1877 2378
4 1877 2342 4 1877 2376 4 1877 2379 4
1877 2424 4 1877 2482 4 1877 2497 4 1877
2558 4 1877 2618 4 1877 2625 4 1877 2632
4 1877 2632 4 1877 2704 4 1877 2723 4
1877 2738 4 1877 2740 4 1877 2741 4 1877
2840 4 1877 2867 4 1877 2941 4 1877 3105
4 1877 3144 4 1877 3184 4 1877 1471 5
1877 1749 5 1877 1877 5 1877 1877 5 1877
1877 5 1877 2228 5 1877 2280 5 1877 2379
5 1877 2482 5 1877 2740 5 1877 2851 5
1877 2920 5 1877 1198 6 1877 1338 6 1877
1749 6 1877 1749 6 1877 1749 6 1877 1877
6 1877 1877 6 1877 1877 6 1877 1877 6
1877 1877 6 1877 1877 6 1877 1877 6 1877
2080 6 1877 2150 6 1877 2228 6 1877 2228
6 1877 2228 6 1877 
# 1878
recoveri of reentrant list structur in slip on consequ of
the refer count base space recoveri system emploi by slip
is that reentrant list structur ar not recov even when
explicitli eras lisp like garbag collect scheme ar free of
thi impedi thei howev depend on be abl to find
and mark node that ar reachabl from program variabl by
trace all descend from program variabl mai then be identifi
and collect the list creat function list of slip mai
be amend to mark those list for which the programm
wish to assum respons given thi modif a lisp like
garbag collector that recov abandon reentrant list structur mai then
be append to the slip system cacm juli 1969 weizenbaum
j list process slip garbag collect 4 22 4 40
ca690702 jb februari 17 1978 9 39 am 1024 4
1878 1024 4 1878 1051 4 1878 1051 4 1878
1098 4 1878 1102 4 1878 1132 4 1878 1214
4 1878 1380 4 1878 1388 4 1878 1390 4
1878 1393 4 1878 1485 4 1878 1486 4 1878
1487 4 1878 1549 4 1878 1549 4 1878 1570
4 1878 1706 4 1878 1826 4 1878 1878 4
1878 1878 4 1878 1946 4 1878 1957 4 1878
378 4 1878 2060 4 1878 2155 4 1878 2168
4 1878 2168 4 1878 2719 4 1878 2723 4
1878 2723 4 1878 2838 4 1878 2842 4 1878
2855 4 1878 2857 4 1878 2879 4 1878 3077
4 1878 3080 4 1878 3106 4 1878 3112 4
1878 627 4 1878 106 4 1878 210 5 1878
1878 5 1878 1878 5 1878 1878 5 1878 2023
5 1878 2168 5 1878 731 5 1878 106 6
1878 1626 6 1878 1826 6 1878 210 6 1878
1878 6 1878 1878 6 1878 731 6 1878 
# 1879
a note on storag fragment and program segment the main
purpos of thi paper is the present of some of
the result of a seri of simul experi investig the
phenomenon of storag fragment two differ type of storag fragment
ar distinguish 1 extern fragment name the loss in storag
util caus by the inabl to make us of all
avail storag after it ha been fragment into a larg
number of separ block and 2 intern fragment the loss
of util caus by round up a request for storag
rather than alloc onli the exact number of word requir
the most strike result is the appar gener rule that
round up request for storag to reduc the number of
differ size of block coexist in storag caus more loss
of storag by increas intern fragment than is save by
decreas extern fragment describ also ar a method of segment
alloc and an accompani techniqu for segment address which take
advantag of the abov result evid is present of possibl
advantag of the method over convent page techniqu cacm juli
1969 randel b storag alloc storag fragment page segment address
6 2 6 20 ca690701 jb februari 17 1978 9
46 am 1879 4 1879 1884 4 1879 1901 4
1879 2095 4 1879 2277 4 1879 2297 4 1879
2365 4 1879 1754 5 1879 1879 5 1879 1879
5 1879 1879 5 1879 2095 5 1879 2218 5
1879 2498 5 1879 2596 5 1879 2734 5 1879
2902 5 1879 2911 5 1879 3000 5 1879 1051
6 1879 1062 6 1879 1184 6 1879 1184 6
1879 1211 6 1879 1380 6 1879 1552 6 1879
1572 6 1879 1728 6 1879 1728 6 1879 1751
6 1879 1751 6 1879 1754 6 1879 1752 6
1879 1810 6 1879 1879 6 1879 1879 6 1879
1879 6 1879 1879 6 1879 1879 6 1879 1879
6 1879 1879 6 1879 1879 6 1879 273 6
1879 2095 6 1879 2095 6 1879 2095 6 1879
2435 6 1879 2435 6 1879 2435 6 1879 2498
6 1879 2596 6 1879 2734 6 1879 2734 6
1879 2747 6 1879 2768 6 1879 2773 6 1879
2864 6 1879 2983 6 1879 
# 1880
chebyshev solut to an overdetermin linear system algorithm 328 f4
cacm june 1969 golub g h chebyshev solut over determin
linear system linear equat exchang algorithm 5 13 5 14
5 41 ca690613 jb februari 17 1978 9 49 am
1880 5 1880 1880 5 1880 1880 5 1880 3054
5 1880 1175 6 1880 1880 6 1880 1919 6
1880 1969 6 1880 1980 6 1880 1997 6 1880
307 6 1880 308 6 1880 309 6 1880 2017
6 1880 2679 6 1880 776 6 1880 
# 1881
transpos vector store arrai algorithm 302 k2 cacm june 1969
macleod i d g matrix transposit arrai transposit vector store
arrai 5 39 ca690612 jb februari 17 1978 9 51
am 1881 5 1881 1881 5 1881 1881 5 1881
# 1882
determin of the squar root of a posit definit matrix
algorithm 298 f1 cacm june 1969 duke b j matrix
symmetr matrix posit definit matrix matrix squar root 5 14
ca690611 jb februari 17 1978 9 53 am 1882 5
1882 1882 5 1882 1882 5 1882 
# 1883
modifi romberg quadratur algorithm d1 cacm june 1969 fair weather
g numer integr romberg quadratur trapezoid valu rectangl valu error
bound 5 16 ca690610 jb februari 17 1978 9 55
am 1352 4 1883 1356 4 1883 1883 4 1883
2040 4 1883 1241 5 1883 1883 5 1883 1883
5 1883 1883 5 1883 1982 5 1883 2355 5
1883 1 6 1883 1273 6 1883 1418 6 1883
1521 6 1883 1597 6 1883 1883 6 1883 1883
6 1883 324 6 1883 2040 6 1883 2350 6
1883 2354 6 1883 
# 1884
an anomali in space time characterist of certain program run
in a page machin the run time of program in
a page machin gener increas as the store in which
program ar constrain to run decreas experi howev have reveal
case in which the revers is true a decreas in
the size of the store is accompani by a decreas
in run time an inform discuss of the anomal behavior
is given and for the case of the fifo replac
algorithm a formal treatment is present cacm june 1969 beladi
l a nelson r a shedler g s page machin
demand page replac algorithm 4 30 ca690609 jb februari 17
1978 9 59 am 1879 4 1884 1884 4 1884
1901 4 1884 2095 4 1884 2277 4 1884 2297
4 1884 2365 4 1884 1754 5 1884 1884 5
1884 1884 5 1884 1884 5 1884 2022 5 1884
2085 5 1884 3006 5 1884 1751 6 1884 1751
6 1884 1884 6 1884 1884 6 1884 1884 6
1884 2374 6 1884 2373 6 1884 2595 6 1884
# 1885
a comput system for transform grammar a comprehens system for
transform grammar ha been design and implement on the ibm
360 67 comput the system deal with the transform model
of syntax along the line of chomski s aspect of
the theori of syntax the major innov includ a full
formal descript of the syntax of a transform grammar a
direct random phrase structur gener a lexic insert algorithm an
extend definit of analysi and a simpl problem orient program
languag in which the algorithm for applic of transform can
be express in thi paper we present the system as
a whole first discuss the gener attitud underli the develop
of the system then outlin the system and discuss it
more import special featur refer ar given to paper which
consid some particular aspect of the system in detail cacm
june 1969 friedman j transform grammar natur languag syntax languag
process languag analysi sentenc gener lexic insert comput linguist syntax
3 42 ca690608 jb februari 17 1978 10 36 am
1885 4 1885 2795 4 1885 1885 5 1885 1885
5 1885 1885 5 1885 1928 5 1885 
# 1886
gener of optim code for express via factor given a
set of express which ar to be compil method ar
present for increas the effici of the object code produc
by first factor the express i e find a set
of subexpress each of which occur in two or more
other express or subexpress onc all the factor have been
ascertain a sequenc procedur is appli which order the factor
and express such that all inform is comput in the
correct sequenc and factor need be retain in memori a
minim amount of time an assign algorithm is then execut
in order to minim the total number of temporari storag
cell requir to hold the result of evalu the factor
in order to make these techniqu computation feasibl heurist procedur
ar appli and henc global optim result ar not necessarili
gener the factor algorithm ar also applic to the problem
of factor boolean switch express and of factor polynomi encount
in symbol manipul system cacm june 1969 breuer m a
factor algorithm code optim sequenc of oper detect of common
subexpress factor of boolean express 4 12 6 1 ca690607jb
februari 17 1978 10 57 am 1030 4 1886 1886
4 1886 1939 4 1886 1886 5 1886 1886 5
1886 1886 5 1886 2175 5 1886 678 5 1886
1551 6 1886 1613 6 1886 1886 6 1886 
# 1887
a recurs relat for the determin of a pentadiagon matrix
a recurs relat relat lead princip minor is develop for
the determin of a pentadiagon matrix a numer exampl is
includ to indic it us in calcul eigenvalu cacm june
1969 sweet r a pentadiagon matrix quindiagon matrix quindiagon matrix
band matrix determin characterist polynomi eigenvalu 5 14 ca690606 jb
februari 17 1978 11 00 am 1887 5 1887 1887
5 1887 1887 5 1887 
# 1888
spline function method for nonlinear boundari valu problem the solut
of the nonlinear differenti equat y f x y y
with two point boundari condit is approxim by a quintic
or cubic spline function y x the method is well
suit to nonuniform mesh size and dynam mesh size alloc
for uniform mesh size h the error in the quintic
spline y x is o h 4 with typic error
on third that from numerov s method requir the differenti
equat to be satisfi at the mesh point result in
a set of differ equat which ar block tridiagon and
so ar easili solv by relax or other standard method
cacm june 1969 blue j l boundari valu problem differenti
equat finit differ function approxim iter method nonlinear equat spline
function 5 13 5 15 5 17 ca690605 jb februari
17 1978 11 07 am 1888 5 1888 1888 5
1888 1888 5 1888 
# 1889
introduc comput to smaller colleg and univers a progress report
by technic mean that ar now routin comput servic for
smaller colleg and univers can be provid by remot termin
of a central facil access howev is not enough effect
organiz and educ methodolog for introduc comput at such institut
must also be develop the experi of two year with
a statewid network involv 41 institut is discuss lesson includ
the import of a separ organ repres the small colleg
the necess for on campu train for the institut the
need for some special program and document to support such
user and the develop of curriculum by evolutionari mean cacm
june 1969 parker jr l t galli t m brook
jr f p ferrel j k region network introduc comput
under graduat educ instruct usag academ applic curriculum develop orient
project region center consortium remot comput 1 50 1 52
1 59 2 49 ca690604 jb februari 17 1978 11
21 am 1889 5 1889 1889 5 1889 1889 5
1889 
# 1890
simul of traffic flow in a network a comput simul
program which deal with traffic flow in the network of
a larg area is describ each road is segment into
block of sever ten meter length and is repres by
a bidirect list in comput memori the movement of car
i e the transfer of car from on block to
the next is express by a proper formula thi formula
is base on the supposit that the speed of car
in a block is determin onli by the densiti of
car in the block and thi speed versu densiti curv
is empir given the numer valu thi simul scheme ha
it excel point in that it make it possibl to
trace the dynam behavior of traffic flow in a varieti
of situat some exampl of which ar given for an
actual area of the citi of kyoto japan june 1969
sakai t nagao m traffic simul traffic flow traffic network
traffic control traffic densiti intersect signal set vehicl road network
list structur comput simul 3 57 3 23 ca690603 jb
februari 17 1978 1 26 pm 1890 4 1890 1890
5 1890 1890 5 1890 1890 5 1890 757 5
1890 
# 1891
three dimension comput displai a stereograph displai termin ha been
produc us the raster displai brad recent develop at brookhaven
the system us a rotat refresh memori to feed standard
televis monitor to produc a stereograph displai the comput calcul
the project video imag of an object view from two
separ point the result video map ar store on separ
refresh band of the rotat memori the two output signal
ar connect to separ color gun of a color televis
monitor thu creat a superimpos imag on the screen optic
separ is achiev by view the imag through color filter
the displai is interact and can be view by a
larg group of peopl at the same time cacm june
1969 ophir d shepherd b j spinrad r j comput
graphic three dimension displai swept raster displai interact stereograph termin
video map color separ 2 0 4 49 6 35
ca690602 jb februari 17 1978 1 34 pm 1891 4
1891 2211 4 1891 2421 4 1891 2674 4 1891
2687 4 1891 1741 5 1891 1891 5 1891 1891
5 1891 1891 5 1891 
# 1892
degre of multiprogram in page on demand system a simpl
stochast model is describ which offer a base for understand
the relationship between the number of program permit to share
memori the degre of multiprogram drum traffic rate and central
process unit util in page on demand multiprogram time share
comput system the model preserv as a kei featur the
properti of page demand statist which impli a burst of
page demand at the begin of ani job or quantum
execut the model a markov chain is analyz numer and
the result ar present graphic for a wide rang of
kei environ descript paramet implic of the result to time
share system design and program ar discuss and a calcul
of the optim degre of multiprogram for a wide rang
of paramet is present graphic cacm june 1969 wallac v
l mason d l page on demand demand page time
share multiprogram markovian comput model schedul strategi oper system memori
manag 2 44 4 32 4 39 6 20 6
21 ca690601 jb februari 17 1978 1 43 pm 1751
4 1892 1805 4 1892 1846 4 1892 1892 4
1892 1892 4 1892 1892 4 1892 1892 4 1892
1892 4 1892 1901 4 1892 1924 4 1892 2068
4 1892 2085 4 1892 2095 4 1892 2095 4
1892 2128 4 1892 2188 4 1892 2218 4 1892
2218 4 1892 2218 4 1892 2218 4 1892 2277
4 1892 2297 4 1892 2317 4 1892 2319 4
1892 2329 4 1892 2358 4 1892 2373 4 1892
2374 4 1892 2380 4 1892 2434 4 1892 2499
4 1892 2501 4 1892 2526 4 1892 2582 4
1892 2667 4 1892 2668 4 1892 2669 4 1892
2741 4 1892 2828 4 1892 2862 4 1892 2863
4 1892 2863 4 1892 2881 4 1892 2928 4
1892 2996 4 1892 3006 4 1892 3067 4 1892
1526 5 1892 1572 5 1892 1728 5 1892 1751
5 1892 1752 5 1892 1892 5 1892 1892 5
1892 1892 5 1892 
# 1893
root of polynomi by a root squar and result routin
algorithm 340 c2 cacm mai 1969 noltemei a root finder
root of polynomi equat polynomi zero root squar oper graeff
method result procedur subresult procedur test of root accept criteria
5 15 ca690517 jb februari 17 1978 2 29 pm
1893 5 1893 1893 5 1893 1893 5 1893 
# 1894
normal random deviat algorithm 334 g5 cacm mai 1969 knop
r normal deviat normal distribut random number random number gener
simul probabl distribut frequenc distribut random 5 13 5 5
ca690516 jb februari 17 1978 2 31 pm 1894 5
1894 1894 5 1894 1894 5 1894 2057 5 1894
2349 5 1894 1600 6 1894 1648 6 1894 1716
6 1894 1794 6 1894 1894 6 1894 1894 6
1894 2043 6 1894 2055 6 1894 501 6 1894
613 6 1894 774 6 1894 
# 1895
gaussian quadratur formula algorithm 331 d1 cacm mai 1969 hill
i d quadratur gaussian quadratur numer integr weight function orthogon
polynomi 5 16 ca690514 jb februari 17 1978 3 13
pm 1895 5 1895 1895 5 1895 1895 5 1895
# 1896
regular coulomb wave function algorithm 292 s22 cacm mai 1969
gautschi w coulomb wave function wave function regular coulomb wave
function 5 12 ca690513 jb februari 17 1978 3 15
pm 1896 5 1896 1896 5 1896 1896 5 1896
# 1897
coulomb wave function algorithm 300 s22 cacm mai 1969 kolbig
k s coulomb wave function wave function 5 12 ca690512
jb februari 17 1978 3 17 pm 1897 5 1897
1897 5 1897 1897 5 1897 
# 1898
regular coulomb wave function algorithm 292 s22 cacm mai 1969
kolbig k s coulomb wave function wave function regular coulomb
wave function 5 12 ca690511 jb februari 17 1978 3
19 pm 1898 5 1898 1898 5 1898 1898 5
1898 
# 1899
simplex method procedur emploi lu decomposit algorithm 350 h cacm
mai 1969 bartel r h golub g h simplex method
linear program lu decomposit round off error comput stabil 5
41 ca690510 jb februari 17 1978 3 21 pm 1899
5 1899 1899 5 1899 1899 5 1899 
# 1900
clarif of fortran standard initi progress in 1966 after four
year of effort fortran becam the first program languag standard
in the unit state sinc that initi achiev studi and
applic of the standard specif have reveal the need for
mainten of the standard as the result of work initi
in 1967 an initi set of clarifi interpret ha been
prepar the natur of the mainten correct to the standard
specif and complet interpret ar report cacm mai 1969 usa
standard fortran basic fortran program languag standard languag standard specif
languag standard mainten languag standard clarif languag standard interpret standard
committe 1 2 2 0 2 19 2 2 2
3 4 0 4 12 4 19 4 20 4
22 4 29 4 43 5 23 5 9 6
9 ca690509 jb februari 17 1978 3 26 pm 1613
4 1900 1646 4 1900 1845 4 1900 1900 4
1900 1900 4 1900 1955 4 1900 2025 4 1900
2083 4 1900 2154 4 1900 2154 4 1900 2270
4 1900 2365 4 1900 2506 4 1900 2693 4
1900 3060 4 1900 987 5 1900 988 5 1900
1900 5 1900 1900 5 1900 1900 5 1900 2154
5 1900 2915 5 1900 3060 5 1900 987 6
1900 987 6 1900 988 6 1900 1502 6 1900
1900 6 1900 1900 6 1900 1900 6 1900 2154
6 1900 
# 1901
dynam space share in comput system a formal of relationship
between space shade program behavior and processor effici in comput
system is present concept of valu and cost of space
alloc per task ar defin and then valu and cost
ar combin to develop a singl paramet term valu per
unit cost the intent is to illustr a possibl analyt
approach to the investig of the problem of space share
and to demonstr the method on sampl problem cacm mai
1969 beladi l a kuehner c j space share storag
alloc memori alloc storag manag memori manag program behavior multiprogram
comput system design alloc strategi replac strategi demand page time
share 4 32 6 2 6 20 ca690508 jb februari
17 1978 3 31 pm 1713 4 1901 1713 4
1901 1879 4 1901 1884 4 1901 1892 4 1901
1901 4 1901 1901 4 1901 1901 4 1901 1901
4 1901 2085 4 1901 2095 4 1901 2095 4
1901 2218 4 1901 2277 4 1901 2277 4 1901
2297 4 1901 2319 4 1901 2329 4 1901 2358
4 1901 2365 4 1901 2373 4 1901 2380 4
1901 2434 4 1901 2499 4 1901 2501 4 1901
2582 4 1901 491 4 1901 491 4 1901 2669
4 1901 2828 4 1901 2863 4 1901 2881 4
1901 2928 4 1901 2996 4 1901 3006 4 1901
3067 4 1901 168 5 1901 185 5 1901 1751
5 1901 1754 5 1901 1901 5 1901 1901 5
1901 1901 5 1901 2374 5 1901 2481 5 1901
2669 5 1901 2863 5 1901 3016 5 1901 3052
5 1901 1728 6 1901 1728 6 1901 1751 6
1901 1751 6 1901 1901 6 1901 1901 6 1901
1901 6 1901 1901 6 1901 1901 6 1901 1901
6 1901 2017 6 1901 2358 6 1901 2373 6
1901 2741 6 1901 2863 6 1901 
# 1902
an automat grade scheme for simpl program exercis a discuss
is given of alter that were made to a typic
univers oper system to record the result of program exercis
in three differ languag includ assembl languag in thi comput
control grade scheme provis is made for test with programm
suppli data and for final run with system suppli data
exercis run under the scheme mai be mix with other
program and no special recognit of exercis by the oper
is necessari cacm mai 1969 hext j b wine j
w automat grade program program exercis 1 5 2 43
4 39 ca690507 jb februari 17 1978 3 35 pm
1270 4 1902 1413 4 1902 1902 4 1902 1902
4 1902 145 5 1902 1270 5 1902 1902 5
1902 1902 5 1902 1902 5 1902 
# 1903
chebyshev interpol and quadratur formula of veri high degre cacm
mai 1969 salzer h e chebyshev polynomi chebyshev interpol chebyshev
quadratur chebyshev point chebyshev zero interpol quadratur definit integr 5
13 5 16 ca690506 jb februari 17 1978 3 42
pm 1903 5 1903 1903 5 1903 1903 5 1903
2394 5 1903 1872 6 1903 1903 6 1903 
# 1904
rough and readi error estim in gaussian integr of analyt
function cacm mai 1969 rabinowitz p numer integr analyt function
error estim gaussian integr tabul error coeffici comput error coeffici
cauchi integr formula chebyshev polynomi 5 11 5 16 ca690505
jb februari 17 1978 3 44 pm 1904 5 1904
1904 5 1904 1904 5 1904 
# 1905
the simplex method of linear program us lu decomposit standard
comput implement of dantzig s simplex method for linear program
ar base upon form the invers of the basic matrix
and updat the invers after everi step of the method
these implement have bad round off error properti thi paper
give the theoret background for an implement which is base
upon the lu decomposit comput with row interchang of the
basic matrix the implement is slow but ha good round
off error behavior the implement appear as cacm algorithm 350
cacm mai 1969 bartel r h goulub g h simplex
method linear program lu decomposit round off error comput stabil
5 41 ca690504 jb februari 17 1978 3 49 pm
1905 4 1905 1744 5 1905 1905 5 1905 1905
5 1905 1905 5 1905 
# 1906
autom print circuit rout with a step apertur a comput
program for rout interconnect on a two side print circuit
board with a regular pattern of line pin termin and
via feed through hole is describ in thi program each
interconnect is given a plan rout typic down from the
upper pin through a via and horizont to the lower
pin from the top a virtual apertur i e a
long horizont slit is step down the board the plan
rout is the basi for rerout interconnect within the apertur
to resolv conflict for line and via below the apertur
and to maxim the effect line usag if a conflict
ha not been resolv befor the apertur arriv at the
lower pin interconnect ar delet to resolv the conflict extens
of thi techniqu to the control of crosstalk between rout
interconnect and to the problem of obtain 100 percent interconnect
ar also discuss cacm mai 1969 lass s rout print
circuit interconnect apertur step apertur comput program circuit board line
via pin 3 24 6 30 ca690503 jb februari 17
1978 3 57 pm 1211 4 1906 1549 4 1906
1906 4 1906 2902 4 1906 1051 5 1906 1906
5 1906 1906 5 1906 1906 5 1906 
# 1907
a note on reliabl full duplex transmiss over half duplex
link a simpl procedur for achiev reliabl full duplex transmiss
over half duplex link is propos the scheme is compar
with anoth of the same type which ha recent been
describ in the literatur final some comment ar made on
anoth group of relat transmiss procedur which have been shown
to be unreli under some circumst cacm mai 1969 bartlett
k a scantleburi r a data transmiss error correct full
duplex half duplex transmiss control commun 3 81 ca690502 jb
februari 17 1978 4 01 pm 1907 4 1907 1743
5 1907 1907 5 1907 1907 5 1907 1907 5
1907 
# 1908
time share and batch process an experiment comparison of their
valu in a problem solv situat an experiment comparison of
problem solv us time share and batch process comput system
conduct at mit is describ in thi paper thi studi
is the first known attempt to evalu two such system
for what mai well be the predomin user popul within
the next decad the profession who as nonprogramm ar us
the comput as an aid in decis make and problem
solv rather than as a program end in itself statist
and logic signific result indic equal cost for usag of
the two comput system howev a much higher level of
perform is attain by time share user there ar indic
that significantli lower cost would have result if the time
share user had stop work when thei reach a perform
level equal to that of the batch user the user
speed of problem solv and their attitud made time share
the more favor system cacm mai 1969 gold m m
time share vs batch process user perform man machin commun
cost effect on line vs off line perform decis make
perform user programm behavior program experiment empir studi problem solv
research in man machin commun man machin symbiosi 2 11
2 40 3 36 3 51 3 80 ca690501 jb
februari 17 1978 4 10 pm 1792 4 1908 1908
4 1908 1908 4 1908 1550 5 1908 1605 5
1908 1908 5 1908 1908 5 1908 1908 5 1908
2705 5 1908 2984 5 1908 1908 6 1908 1908
6 1908 3185 6 1908 
# 1909
comput of jn x by numer integr it is shown
to be practic to comput jn x by numer integr
of it integr represent us the trapezoid rule the error
in thi approxim wa studi empir cacm april 1969 stroud
a h kohli j p bessel function numer integr trapezoid
rule 5 11 5 12 5 16 ca690408 jb februari
17 1978 4 13 pm 1909 4 1909 1909 4
1909 1909 4 1909 1909 4 1909 2119 4 1909
134 5 1909 1023 5 1909 1284 5 1909 1316
5 1909 1909 5 1909 1909 5 1909 1909 5
1909 
# 1910
an algorithm for solv a special class of tridiagon system
of linear equat an algorithm is present for solv a
system of linear equat bu k where b is tridiagon
and of a special form it is shown that thi
algorithm is almost twice as fast as the gaussian elimin
method usual suggest for solv such system in addit explicit
formula for the invers and determin of the matrix b
ar given cacm april 1969 rose d j tridiagon gaussian
elimin central differ 5 14 5 17 ca690407 jb februari
17 1978 4 18 pm 1910 5 1910 1910 5
1910 1910 5 1910 
# 1911
on coordin reduct and sentenc analysi a class of coordin
phenomena in natur languag is consid within the frame work
of transform theori to account for these phenomena it is
propos that certain machineri be ad to the syntact compon
of a transform grammar thi machineri includ certain rule schemata
the condit under which thei ar to be appli and
condit determin the sequenc of subtre on which thei ar
to be perform a solut to the syntact analysi problem
for thi class of grammar is outlin precis specif of
both the gener procedur of thi paper and it invers
is given in the form of lisp function definit cacm
april 1969 petrick s r postal p m rosenbaum p
s natur languag gener grammar transform theori syntax coordin sentenc
coordin sentenc coordin coordin reduct syntact analysi grammar test program
rule test 3 42 ca690406 jb februari 17 1978 4
25 pm 1911 5 1911 1911 5 1911 1911 5
1911 
# 1912
simul of outpati appoint system an experiment comput program is
describ which simul appoint system emploi by outpati depart of
hospit both major kind of appoint system individu and block
can be simul the purpos of the simul is to
enabl the user to evalu the effect of altern appoint
system in a given clinic environ cacm april 1969 katz
j h simul schedul appoint system outpati depart medicin health
manag scienc oper research 3 34 3 59 ca690405 jb
februari 17 1978 4 32 pm 1805 4 1912 1912
4 1912 1518 5 1912 1912 5 1912 1912 5
1912 1912 5 1912 
# 1913
polygamma function with arbitrari precis algorithm 349 s14 cacm april
1969 schwachheim g polygamma function psi function digamma function trigamma
function tetragamma function pentagamma function special function 5 12 ca690404
jb februari 17 1978 4 36 pm 1913 5 1913
1913 5 1913 1913 5 1913 
# 1914
matrix scale by integ program algorithm 348 f1 cacm april
1969 klimpel r r integ program linear algebra mathemat program
matrix condit matrix scale 5 14 5 41 ca690403 jb
februari 17 1978 4 38 pm 1914 5 1914 1914
5 1914 1914 5 1914 
# 1915
an algorithm for hidden line elimin the algorithm present caus
the elimin of hidden line in the represent of a
perspect view of concav and convex plane face object on
the pictur plane all the edg of the object ar
consid sequenti and all plane which hide everi point of
an edg ar found the comput time increas roughli as
the squar of the number of edg the algorithm take
advantag of a reduc number of concav point and automat
recogn if onli on object with no concav point is
consid in thi last case the result is obtain in
a much simpler wai cacm april 1969 galimberti r montanari
u hidden line elimin back line recognit three dimension represent
plane face object perspect view machin render of solid automat
draw displai techniqu comput graphic man machin interact man machin
commun comput aid design 4 40 4 41 4 49
ca690402 jb februari 17 1978 4 44 pm 1915 5
1915 1915 5 1915 1915 5 1915 2004 5 1915
2687 5 1915 2692 5 1915 1686 6 1915 1741
6 1915 1915 6 1915 1915 6 1915 1915 6
1915 2004 6 1915 
# 1916
analysi of boolean program model for time share page environ
direct graph or their associ matric ar frequent us to
repres the logic structur of sequenc of comput instruct such
techniqu ar us and in addit data refer ar repres
in a nondirect model the complet structur specif of a
program is repres by a combin model a transform of
the combin model yield a new model in which addit
time inform is also contain analysi of these model prior
to execut yield inform valuabl in determin segment of instruct
and data for a time share environ as well as
for initi page load dure execut the analysi mai be
us for look ahead control of page turn cacm april
1969 low t c time share page segment execut compil
monitor program model 4 39 6 21 ca690401 jb februari
17 1978 4 50 pm 1916 4 1916 1916 4
1916 1533 5 1916 1916 5 1916 1916 5 1916
1916 5 1916 2130 5 1916 666 5 1916 1916
6 1916 
# 1917
an algol procedur for the fast fourier transform with arbitrari
factor algorithm 339 c6 cacm march 1969 singleton r c
fast fourier transform complex fourier transform multivari fourier transform fourier
seri harmon analysi spectral analysi orthogon polynomi orthogon transform virtual
core memori permut 3 15 3 83 5 12 5
14 ca690310 jb februari 20 1978 8 43 am 1917
5 1917 1917 5 1917 1917 5 1917 
# 1918
distribut of indistinguish object into distinguish slot algorithm 329 g6
cacm march 1969 grai m ca690309 jb februari 20 1978
8 46 am 1918 5 1918 1918 5 1918 1918
5 1918 
# 1919
an effici algorithm for sort with minim storag algorithm 347
m1 cacm march 1969 singleton r c sort minim storag
sort digit comput sort 5 31 ca690308 jb februari 20
1978 8 48 am 1175 4 1919 1175 4 1919
1919 4 1919 1919 4 1919 1919 4 1919 1919
4 1919 1919 4 1919 1919 4 1919 1969 4
1919 1969 4 1919 1997 4 1919 2017 4 1919
2041 4 1919 2118 4 1919 2191 4 1919 2191
4 1919 2216 4 1919 2388 4 1919 2388 4
1919 2348 4 1919 2679 4 1919 2679 4 1919
2679 4 1919 2783 4 1919 2784 4 1919 3054
4 1919 3054 4 1919 3054 4 1919 3121 4
1919 3121 4 1919 852 4 1919 864 4 1919
864 4 1919 865 4 1919 1175 5 1919 1919
5 1919 1919 5 1919 1919 5 1919 308 5
1919 309 5 1919 2216 5 1919 74 5 1919
3054 5 1919 3187 5 1919 864 5 1919 864
6 1919 1175 6 1919 1880 6 1919 1919 6
1919 1919 6 1919 1969 6 1919 1969 6 1919
1980 6 1919 1997 6 1919 1997 6 1919 307
6 1919 308 6 1919 309 6 1919 2017 6
1919 2679 6 1919 776 6 1919 
# 1920
f test probabl algorithm 346 s14 cacm march 1969 morri
j f test snedecor f statist fisher test distribut function
5 5 ca690307 jb februari 20 1978 8 50 am
1157 4 1920 1779 4 1920 1920 4 1920 1920
4 1920 1944 4 1920 1987 4 1920 2548 4
1920 1778 5 1920 1920 5 1920 1920 5 1920
1920 5 1920 714 5 1920 
# 1921
an algol convolut procedur base on the fast fourier transform
algorithm 345 c6 cacm march 1969 singleton r c fast
fourier transform complex fourier transform multivari fourier transform fourier seri
harmon analysi spectral analysi orthogon polynomi orthogon transform convolut auto
covari autocorrel cross correl digit filter permut 3 5 3
83 5 12 5 14 ca690306 jb februari 20 1978
8 54 am 1921 5 1921 1921 5 1921 1921
5 1921 
# 1922
propos usa standard data commun control procedur for the usa
standarad code for inform interchang cacm march 1969 data commun
data commun control procedur data commun establish termin procedur data
commun messag transfer procedur data commun error control procedur data
commun poll select procedur commun commun control procedur commun establish
termin procedur commun messag transfer procedur commun error control procedur
commun poll select procedur link link control procedur link establish
termin procedur link messag transfer procedur link error control procedur
link poll select procedur data link data link control procedur
data link establish termin procedur data link messag transfer procedur
data link error control procedur data link poll select procedur
3 81 4 49 6 39 ca690305 jb februari 20
1978 9 09 am 1922 5 1922 1922 5 1922
1922 5 1922 
# 1923
pseudofil an approach to system interfac for high level languag
us basic input output support facil is describ it is
shown that thi techniqu can provid potenti inexpens method for
program to commun with deepli embed facil such as command
languag processor cacm march 1969 rosin r f oper system
interfac input output high level languag command languag 4 22
4 30 4 31 4 41 ca690304 jb februari 20
1978 9 12 am 1923 5 1923 1923 5 1923
1923 5 1923 
# 1924
organ matric and matrix oper for page memori system matrix
represent and oper ar examin for the purpos of minim
the page fault occur in a page memori system it
is shown that carefulli design matrix algorithm can lead to
enorm save in the number of page fault occur when
onli a small part of the total matrix can be
in main memori at on time examin of addit multipl
and invers algorithm show that a partit matrix represent i
e on submatrix or partit per page in most case
induc fewer page fault than a row by row represent
the number of page pull requir by these matrix manipul
algorithm is also studi as a function of the number
of page of main memori avail to the algorithm cacm
march 1969 mckellar a c coffman jr e g matrix
algorithm arrai process page algorithm page memori system virtual memori
system arrai storag alloc storag alloc 4 12 4 39
5 14 ca690303 jb februari 20 1978 9 35 am
1892 4 1924 1924 4 1924 2095 4 1924 2218
4 1924 2297 4 1924 2374 4 1924 2526 4
1924 2667 4 1924 2668 4 1924 2862 4 1924
2863 4 1924 1728 5 1924 1924 5 1924 1924
5 1924 1924 5 1924 2365 5 1924 2582 5
1924 3152 5 1924 987 6 1924 1751 6 1924
1754 6 1924 1924 6 1924 1924 6 1924 1924
6 1924 2017 6 1924 2130 6 1924 2362 6
1924 2365 6 1924 
# 1925
concept of us in contour map process gener techniqu whose
us can simplifi the solut of problem relat to contour
map on of these techniqu make us of the topolog
properti of contour map the topolog is repres by a
graphic structur in which adjac contour line appear as connect
node anoth gener techniqu consist of util geometr properti to
determin the characterist of straight line drawn on the contour
map both of these techniqu have been appli to the
problem of locat the ground track of an aircraft from
elev read obtain dure a flight cacm march 1969 mors
s p map contour map contour line topolog properti geometr
properti graph of contour map navig 3 1 ca690302 jb
februari 20 1978 9 41 am 1925 5 1925 1925
5 1925 1925 5 1925 2287 5 1925 2547 5
1925 3062 5 1925 1326 6 1925 1871 6 1925
1925 6 1925 1925 6 1925 1925 6 1925 
# 1926
descript of format a text process program format is a
product program which facilit the edit and print of finish
document directli on the printer of a rel small 64k
comput system it featur good perform total free form input
veri flexibl format capabl includ up to eight column per
page automat capit aid for index construct and a minimum
of nontext item it is written entir in fortran iv
cacm march 1969 bern g m text process index print
document text edit format frequenc dictionari right justif vocabulari 3
74 3 75 3 9 ca690301 jb februari 20 1978
9 45 am 1926 5 1926 1926 5 1926 1926
5 1926 2034 5 1926 984 6 1926 1231 6
1926 1565 6 1926 1852 6 1926 1926 6 1926
1947 6 1926 
# 1927
inform scienc in a ph comput scienc program thi report
contain recommend on a sampl cours curriculum in the gener
area of inform organ and inform system design in a
ph comput scienc program the subject area is first briefli
describ follow by a list of some desir graduat level
cours suitabl bibliographi ar append cacm februari 1969 salton g
cours curriculum graduat cours univers cours comput scienc curriculum inform
scienc inform organ inform retriev data retriev languag analysi inform
process 1 52 3 42 3 70 ca690211 jb februari
20 1978 9 50 am 1720 4 1927 1927 4
1927 1927 4 1927 2147 4 1927 2163 4 1927
2345 4 1927 2478 4 1927 2594 4 1927 2852
4 1927 2899 4 1927 3003 4 1927 3130 4
1927 1659 5 1927 1771 5 1927 1927 5 1927
1927 5 1927 1927 5 1927 2163 5 1927 3003
5 1927 1659 6 1927 1678 6 1927 1720 6
1927 1771 6 1927 1927 6 1927 1927 6 1927
1945 6 1927 2097 6 1927 2147 6 1927 2163
6 1927 2181 6 1927 2187 6 1927 2329 6
1927 2345 6 1927 2367 6 1927 2407 6 1927
2478 6 1927 2479 6 1927 2480 6 1927 2538
6 1927 
# 1928
exclus simul of activ in digit network a techniqu for
simul the detail logic network of larg and activ digit
system is describ essenti object sought ar improv eas and
economi in model gener economi in execut time and space
and a facil for handl simultan activ the main result
obtain ar a clear and us separ of structur and
behavior model descript a reduct of manual task in convert
boolean logic into a structur model the elimin of manual
process in achiev exclus simul of activ an event schedul
techniqu which doe not deterior in economi as the event
queue grow in length and a simul procedur which deal
effect with ani mixtur of serial and simultan activ the
passag of time is simul in a precis quantit fashion
and system to be simul mai be combin of synchron
and asynchron logic certain aspect of the techniqu describ mai
be us for the simul of network structur other than
digit network cacm februari 1969 ulrich e g simul logic
simul digit simul larg system simul network structur schedul queu
simultan activ parallel event 4 22 4 29 6 9
ca690210 jb februari 20 1978 9 58 am 1885 5
1928 1928 5 1928 1928 5 1928 1928 5 1928
2795 5 1928 1928 6 1928 1928 6 1928 1989
6 1928 2274 6 1928 
# 1929
imag from comput and microfilm plotter digit comput ar wide
us for the process of inform and data of all
kind includ the pictori inform contain in photograph and other
graphic represent effici convers facil for put graphic inform into
the comput and retriev it in graphic form ar therefor
much need on of the most commonli emploi devic for
obtain perman graphic output from digit comput is the microfilm
plotter regrett present model have no provis for produc imag
with a continu grai scale or half tone in thi
note sever program techniqu ar describ for obtain half tone
pictur from a microfilm plotter under the control of a
digit comput illustr exampl of sever method ar given cacm
februari 1969 schroeder m r comput imag half tone pictur
microfilm plotter process 3 10 3 15 3 24 4
49 ca690209 jb februari 20 1978 10 06 am 1929
5 1929 1929 5 1929 1929 5 1929 2142 5
1929 1929 6 1929 2231 6 1929 
# 1930
extrem portabl random number gener extrem portabl subroutin ar sometim
need for which moder qualiti and effici suffic typic thi
occur for librari function like random number gener and in
core sort which ar not entir univers or ar not
us in a standard wai the literatur on random number
gener doe not seem to contain an algorithm that meet
requir of thi sort an extrem portabl 8 line fortran
program is provid which base on an import paper by
covey and macpherson 1967 sing their method fourier analysi is
appli to the probabl function for the consecut n tupl
provid by our gener with n less than or equal
to 4 while the small modulu which must be us
to maintain portabl prevent the qualiti of the gener from
be high the gener compar well with the bound establish
in the abov mention paper cacm februari 1969 kruskal j
b random number gener random number random number analysi random
gener linear sequenti gener random number program pseudo random number
4 49 5 19 5 5 ca690208 jb februari 20
1978 10 43 am 1930 5 1930 1930 5 1930
1930 5 1930 2115 5 1930 1691 6 1930 1930
6 1930 
# 1931
interv arithmet determin evalu and it us in test for
a chebyshev system two recent paper on by hansen and
on by hansen and r r smith have shown how
interv arithmet i can be us effect to bound error
in matrix comput in the present paper a method propos
by hasen and r r smith is compar with straightforward
us of i in determin evalu comput result show the
accuraci and run time that can be expect when us
i for determin evalu an applic us i determin in
a program to test a set of function to see
if thei form a chebyshev system is then present cacm
februari 1969 smith l b interv arithmet rang arithmet error
bound determin evalu chebyshev system mathemat proof by comput 5
11 5 13 5 14 ca690207 jb februari 20 1978
10 49 am 1524 4 1931 1931 4 1931 1931
4 1931 1946 4 1931 2214 4 1931 2544 4
1931 1177 5 1931 1931 5 1931 1931 5 1931
1931 5 1931 311 5 1931 
# 1932
the logarithm error and newton s method for the squar
root the problem of obtain optim start valu for the
calcul of the squar root us newton s method is
consid it ha been point out elsewher that if rel
error is us as the measur of good of fit
optim result ar not obtain when the initi approxim is
a best fit it is shown here that if instead
the so call logarithm error is us then a best
initi fit is optim for both type of error moreov
us of the logarithm error appear to simplifi the problem
of determin the optim initi approxim cacm februari 1969 king
r f phillip d l squar root newton s method
rel error logarithm error best fit optim approxim maxim error
recurr relat integ root error curv 5 12 5 13
ca690206 jb februari 20 1978 10 55 am 1440 4
1932 1932 4 1932 1932 4 1932 2094 4 1932
2159 4 1932 962 5 1932 1566 5 1932 1832
5 1932 1932 5 1932 1932 5 1932 1932 5
1932 1999 5 1932 2159 5 1932 962 6 1932
1932 6 1932 1932 6 1932 1932 6 1932 
# 1933
code the lehmer pseudo random number gener an algorithm and
code techniqu is present for quick evalu of the lehmer
pseudo random number gener modulo 2 31 1 a prime
mersenn number with produc 2 31 2 number on a
p bit greater than 31 comput the comput method is
extend to limit problem in modular arithmet prime factor for
2 61 2 and a primit root for 2 61
1 the next largest prime mersenn number ar given for
possibl construct of a pseudo random number gener of increas
cycl length cacm februari 1969 payn w h rabung j
r bogyo t p pseudo random number random number modular
arithmet uniform probabl densiti uniform frequenc function simul prime factor
primit root ca690205 jb februari 20 1978 11 07 am
1933 5 1933 1933 5 1933 1933 5 1933 
# 1934
on arithmet express and tree a descript is given of
how a tree repres the evalu of an arithmet express
can be drawn in such a wai that the number
of accumul need for the comput can be repres in
a straightforward manner thi represent reduc the choic of the
best order of comput to a specif problem under the
theori of graph an algorithm to solv thi problem is
present cacm februari 1969 redziejowski r r arithmet express compil
design graph theori program storag minim topolog order tree 4
12 5 32 ca690204 jb februari 20 1978 11 11
am 1807 4 1934 1934 4 1934 2175 4 1934
1551 5 1934 1934 5 1934 1934 5 1934 1934
5 1934 
# 1935
random binari search techniqu a mathemat model is develop for
the mean and varianc of the number of trial to
recov a given document in a randomli receiv list of
file the search method describ is binari in natur and
offer new potenti for inform retriev system cacm februari 1969
arora s r dent w t binari pattern file examin
graph theori inform retriev mathemat model partit probabilist method random
sequenc search techniqu tree structur 3 74 5 32 ca690203
jb februari 20 1978 11 15 am 1050 4 1935
1935 4 1935 1935 4 1935 1936 4 1935 2017
4 1935 2032 4 1935 2257 4 1935 2360 4
1935 2451 4 1935 2452 4 1935 1115 5 1935
1935 5 1935 1935 5 1935 1935 5 1935 2451
5 1935 2556 5 1935 2978 5 1935 849 5
1935 830 6 1935 849 6 1935 944 6 1935
1935 6 1935 1935 6 1935 1935 6 1935 1936
6 1935 1936 6 1935 2111 6 1935 
# 1936
variabl length tree structur have minimum averag search time sussenguth
suggest in a paper 1963 that a file should be
organ as a doubli chain tree structur if it is
necessari both to search and to updat frequent such a
structur provid a compromis between the fast search slow updat
characterist of binari search and the slow search fast updat
characterist of serial search hi method howev contain the limit
restrict that all termin node lie on the same level
of the tree thi paper consid the effect of relax
thi restrict first tree which have the properti that a
priori the filial set of each node is well defin
ar studi it is prove that code the node within
each filial set with respect to the number of termin
node reachabl from each is necessari and suffici to guarante
minimum averag search time then the more gener case that
is where the entir structur of the tree is changeabl
is treat a procedur is develop for construct a tree
with a minimum averag search time a simpl close express
for thi minimum averag search time is obtain as a
function of the number of termin node the storag capac
requir to implement the doubli chain tree structur on a
digit comput is also determin final the total cost of
the structur us sussenguth s cost criterion is comput it
is shown that signific improv in both the averag search
time and the total cost can be obtain by relax
sussenguth s restrict that all termin node lie on the
same level of the tree cacm februari 1969 patt y
n inform retriev file search tree structur doubl chain 3
70 3 73 3 74 ca690202 jb februari 20 1978
11 25 am 1050 4 1936 1935 4 1936 1936
4 1936 2017 4 1936 2032 4 1936 2257 4
1936 2360 4 1936 2451 4 1936 2452 4 1936
1936 5 1936 1936 5 1936 1936 5 1936 2257
5 1936 2360 5 1936 2451 5 1936 2452 5
1936 2556 5 1936 2765 5 1936 849 5 1936
830 6 1936 849 6 1936 849 6 1936 849
6 1936 849 6 1936 944 6 1936 1831 6
1936 1831 6 1936 1935 6 1936 1935 6 1936
1936 6 1936 1936 6 1936 1936 6 1936 1936
6 1936 1936 6 1936 1936 6 1936 1976 6
1936 1976 6 1936 2046 6 1936 2111 6 1936
2198 6 1936 2360 6 1936 2451 6 1936 2452
6 1936 616 6 1936 
# 1937
coda a data displai system coda a custom orient data
system is a user orient data retriev and displai system
the command languag of the system provid the user with
an easi mean for specifi data retriev and displai request
data is displai as tabl and graph produc in a
format readi for public in thi paper the statement of
the request languag and the gener system design ar describ
cacm februari 1969 dai r h mansfield m k elli
m e data displai inform retriev graphic displai command languag
report program gener manag data process 3 50 3 51
3 59 3 70 3 75 3 79 4 20
4 29 ca690201 jb februari 20 1978 11 32 am
1937 5 1937 1937 5 1937 1937 5 1937 2002
5 1937 1767 6 1937 1937 6 1937 
# 1938
some criteria for time share system perform time share system
as defin in thi articl ar those multiaccess system which
permit a termin user to util essenti the full resourc
of the system while share it time with other termin
user it is each termin user s abil to util
the full resourc of the system that make quantit evalu
of time share system particularli difficult six criteria ar describ
which have been successfulli us to perform first level quantit
time share system perform evalu cacm januari 1969 stimler s
time share perform criteria time share system oper time share
perform analysi 2 40 4 30 4 32 6 20
ca690111 jb februari 20 1978 11 37 am 1938 5
1938 1938 5 1938 1938 5 1938 2219 5 1938
2344 5 1938 1938 6 1938 1938 6 1938 
# 1939
direct random gener of sentenc the problem of produc sentenc
of a transform grammar by us a random gener to
creat phrase structur tree for input to the lexic insert
and transform phase is discuss a pure random gener will
produc base tree which will be block by the transform
and which ar frequent too long to be of practic
interest a solut is offer in the form of a
comput program which allow the user to constrain and direct
the gener by the simpl but power devic of restrict
subtre the program is a direct random gener which accept
as input a subtre with restrict and produc around it
a tree which satisfi the restrict and is readi for
the next phase of the grammar the underli linguist model
is that at noam chomski as present in aspect of
the theori of syntax the program is written in fortran
iv for the ibm 360 67 and is part of
a unifi comput system for transform grammar it is current
be us with sever partial grammar of english cacm januari
1969 friedman j transform grammar natur languag syntax languag process
sentenc gener comput linguist syntax 3 42 ca690110 jb februari
20 1978 11 44 am 1030 4 1939 1261 4
1939 1886 4 1939 1939 4 1939 1939 4 1939
1030 5 1939 1939 5 1939 1939 5 1939 1939
5 1939 2767 5 1939 3064 5 1939 678 5
1939 1846 6 1939 1939 6 1939 1939 6 1939
2742 6 1939 2767 6 1939 2936 6 1939 
# 1940
calcul of a polynomi and it deriv valu by horner
scheme algorithm 337 c1 cacm januari 1969 smith o k
function evalu polynomi evalu algol procedur horner s scheme 4
22 5 12 ca690109 jb februari 20 1978 11 46
am 1940 5 1940 1940 5 1940 1940 5 1940
# 1941
f distribut algorithm 322 s14 cacm januari 1969 field j
b f fisher s f distribut student s t distribut
5 5 ca690108 jb februari 20 1978 11 48 am
1941 5 1941 1941 5 1941 1941 5 1941 
# 1942
find a solut of n function equat in n unknown
algorithm 314 c5 cacm januari 1969 vandergraft j mesztenyi c
function equat interpol nonlinear equat secant method 5 13 5
15 ca690107 jb februari 20 1978 11 50 am 1942
5 1942 1942 5 1942 1942 5 1942 
# 1943
complet ellipt integr algorithm 165 s21 cacm januari 1969 farka
i special function complet ellipt integr of the first kind
complet ellipt integr of the second kind 5 12 ca690106
jb februari 20 1978 11 54 am 1943 5 1943
1943 5 1943 1943 5 1943 
# 1944
student s t distribut algorithm 344 s14 cacm januari 1969
levin d a student s t distribut t test small
sampl statist distribut function 5 12 5 5 ca690105 jb
februari 20 1978 11 56 am 1157 4 1944 1779
4 1944 1920 4 1944 1944 4 1944 1944 4
1944 1987 4 1944 1987 4 1944 2548 4 1944
1779 5 1944 1944 5 1944 1944 5 1944 1944
5 1944 1987 5 1944 714 5 1944 1561 6
1944 1581 6 1944 1779 6 1944 1944 6 1944
714 6 1944 
# 1945
the role of program in a ph comput scienc program
in thi gener paper the role of program in advanc
graduat train is discuss subject matter relat to program as
well as program per se is consid the import and
applic of formal ar consid and also the need for
good empir experiment a brief outlin for a sequenc of
cours is includ and subject head that have been obtain
from an extens bibliographi ar given a bibliographi of program
refer is includ cacm januari 1969 arden b w graduat
level program graduat program cours content cours sequenc graduat curriculum
program research topic program bibliographi 1 3 1 52 4
0 ca690104 jb februari 20 1978 12 00 pm 1068
4 1945 1084 4 1945 1102 4 1945 1142 4
1945 1215 4 1945 1225 4 1945 1225 4 1945
1247 4 1945 1263 4 1945 1350 4 1945 1350
4 1945 1350 4 1945 1379 4 1945 1379 4
1945 1396 4 1945 1396 4 1945 1399 4 1945
1400 4 1945 1453 4 1945 1496 4 1945 1530
4 1945 1531 4 1945 1542 4 1945 1551 4
1945 1553 4 1945 1565 4 1945 1570 4 1945
1612 4 1945 1625 4 1945 1646 4 1945 1659
4 1945 1683 4 1945 1683 4 1945 1693 4
1945 1693 4 1945 1703 4 1945 1705 4 1945
1767 4 1945 1768 4 1945 1768 4 1945 1781
4 1945 1781 4 1945 1781 4 1945 1781 4
1945 1781 4 1945 1781 4 1945 1781 4 1945
1781 4 1945 1781 4 1945 1781 4 1945 1781
4 1945 1787 4 1945 1787 4 1945 1787 4
1945 1787 4 1945 1807 4 1945 1836 4 1945
1836 4 1945 1860 4 1945 1945 4 1945 1945
4 1945 1945 4 1945 1945 4 1945 1945 4
1945 1945 4 1945 1945 4 1945 1945 4 1945
1945 4 1945 1945 4 1945 1945 4 1945 1945
4 1945 1945 4 1945 1945 4 1945 1945 4
1945 1945 4 1945 1945 4 1945 1945 4 1945
1945 4 1945 1945 4 1945 1945 4 1945 1945
4 1945 1945 4 1945 1945 4 1945 1945 4
1945 1945 4 1945 1945 4 1945 1945 4 1945
1945 4 1945 1947 4 1945 1988 4 1945 2015
4 1945 2034 4 1945 2036 4 1945 2060 4
1945 2060 4 1945 2061 4 1945 2061 4 1945
2061 4 1945 2082 4 1945 2091 4 1945 2091
4 1945 2110 4 1945 2126 4 1945 2127 4
1945 2152 4 1945 2179 4 1945 2179 4 1945
2252 4 1945 2314 4 1945 2341 4 1945 2340
4 1945 2356 4 1945 2396 4 1945 2546 4
1945 2546 4 1945 2603 4 1945 2603 4 1945
2650 4 1945 2698 4 1945 2698 4 1945 2698
4 1945 2708 4 1945 2708 4 1945 2708 4
1945 2730 4 1945 2824 4 1945 2982 4 1945
2986 4 1945 3045 4 1945 3045 4 1945 3093
4 1945 3093 4 1945 3094 4 1945 691 4
1945 762 4 1945 949 4 1945 949 4 1945
914 5 1945 915 5 1945 917 5 1945 984
5 1945 989 5 1945 990 5 1945 1012 5
1945 1084 5 1945 1098 5 1945 1122 5 1945
1138 5 1945 1139 5 1945 1141 5 1945 1200
5 1945 1223 5 1945 1265 5 1945 1336 5
1945 1396 5 1945 1455 5 1945 1477 5 1945
1487 5 1945 1491 5 1945 1496 5 1945 1945
5 1945 1945 5 1945 1945 5 1945 483 5
1945 584 5 1945 3003 5 1945 669 5 1945
680 5 1945 763 5 1945 823 5 1945 1659
6 1945 1678 6 1945 1927 6 1945 1945 6
1945 2097 6 1945 2147 6 1945 2163 6 1945
2187 6 1945 2329 6 1945 2345 6 1945 2367
6 1945 2407 6 1945 2478 6 1945 2479 6
1945 2480 6 1945 2538 6 1945 
# 1946
comput polynomi result bezout s determin vs collin reduc p
algorithm algorithm for comput the result of two polynomi in
sever variabl a kei repetit step of comput in solv
system of polynomi equat by elimin ar studi determin the
best algorithm for comput implement depend upon the extent to
which extran factor ar introduc the extent of propag of
error caus by truncat of real coeffici memori requir and
comput speed preliminari consider narrow the choic of the best
algorithm to bezout s determin and collin reduc polynomi remaind
sequenc p r s algorithm detail test perform on sampl
problem conclus show that bezout s determin is superior in
all respect except for univari polynomi in which case collin
reduc p r s algorithm is somewhat faster in particular
bezout s determin prove to be strikingli superior in numer
accuraci displai excel stabil with regard to round off error
result of test ar report in detail cacm januari 1969
ku s y adler r j result algorithm g c
d algorithm polynomi result elimin bezout s determin sylvest s
determin reduc p r s algorithm euclidean algorithm multivari polynomi
equat 4 40 5 10 5 15 5 41 ca690103
jb februari 20 1978 12 10 pm 1024 4 1946
1051 4 1946 1098 4 1946 1214 4 1946 1380
4 1946 1388 4 1946 1393 4 1946 1396 4
1946 1396 4 1946 1485 4 1946 1487 4 1946
1549 4 1946 1570 4 1946 1878 4 1946 1931
4 1946 1946 4 1946 1946 4 1946 1946 4
1946 1946 4 1946 1946 4 1946 1946 4 1946
1946 4 1946 1946 4 1946 1957 4 1946 2167
4 1946 2168 4 1946 2723 4 1946 2857 4
1946 2857 4 1946 3112 4 1946 902 5 1946
1093 5 1946 1177 5 1946 1393 5 1946 1387
5 1946 1946 5 1946 1946 5 1946 1946 5
1946 360 5 1946 731 5 1946 878 5 1946
# 1947
object code optim method of analyz the control flow and
data flow of program dure compil ar appli to transform
the program to improv object time effici domin relationship indic
which statement ar necessarili execut befor other ar us to
do global common express elimin and loop identif implement of
these and other optim in os 360 fortran h ar
describ cacm januari 1969 lowri e s medlock c w
compil data flow analysi domin effici fortran graph theori loop
structur machin instruct object code optim redund elimin regist assign
system 360 4 12 5 24 5 32 ca690102 jb
februari 20 1978 12 15 pm 1139 4 1947 1613
4 1947 1625 4 1947 1781 4 1947 1807 4
1947 1807 4 1947 1945 4 1947 1947 4 1947
1947 4 1947 1947 4 1947 1947 4 1947 556
4 1947 799 4 1947 1134 5 1947 1223 5
1947 1248 5 1947 1807 5 1947 1947 5 1947
1947 5 1947 1947 5 1947 399 5 1947 2034
5 1947 2290 5 1947 2579 5 1947 2923 5
1947 2945 5 1947 984 6 1947 1223 6 1947
1231 6 1947 1248 6 1947 1535 6 1947 1551
6 1947 1565 6 1947 1807 6 1947 1807 6
1947 1852 6 1947 1926 6 1947 1947 6 1947
1947 6 1947 1947 6 1947 1947 6 1947 1947
6 1947 1947 6 1947 2704 6 1947 2870 6
1947 
# 1948
comput in group theori a survei comput ar be appli
to an increasingli divers rang of problem in group theori
the most import area of applic at present ar coset
enumer subgroup lattic automorph group of finit group charact tabl
and commut calculu group theori program rang from simpl combinatori
or numer program to larg symbol manipul system in thi
survei the more import algorithm in us ar describ and
contrast and result which have been obtain us exist program
ar indic an extens bibliographi is includ cacm januari 1969
cannon j j group theori coset enumer subgroup lattic automorph
group charact tabl commut calculu topolog crystallographi permut group abelian
group discret mathemat non numer program symbol manipul survei 1
3 3 15 5 39 ca690101 jb februari 20 1978
1 27 pm 1567 4 1948 1948 4 1948 1948
4 1948 1391 5 1948 1559 5 1948 1948 5
1948 1948 5 1948 1948 5 1948 
# 1949
finit assumpt and intellectu isol of comput scientist cacm decemb
1970 wagner r a algol vs fortran finit assumpt intellectu
isol integ variabl rang memori finit finit word size 2
2 4 22 5 23 ca701215 jb februari 9 1978
2 38 pm 249 4 1949 254 4 1949 272
4 1949 1102 4 1949 1109 4 1949 1140 4
1949 1188 4 1949 1306 4 1949 1464 4 1949
1491 4 1949 1767 4 1949 1781 4 1949 1787
4 1949 1949 4 1949 1949 4 1949 321 4
1949 2059 4 1949 2126 4 1949 435 4 1949
437 4 1949 463 4 1949 483 4 1949 491
4 1949 2732 4 1949 560 4 1949 583 4
1949 3073 4 1949 627 4 1949 631 4 1949
632 4 1949 642 4 1949 644 4 1949 653
4 1949 680 4 1949 761 4 1949 762 4
1949 763 4 1949 123 4 1949 140 4 1949
919 4 1949 989 4 1949 196 5 1949 946
5 1949 1949 5 1949 1949 5 1949 1949 5
1949 
# 1950
effici handl of binari data cacm decemb 1970 raduchel w
j binari variabl dummi variabl bit string cross tabul 4
9 ca701214 jb februari 9 1978 2 40 pm 1950
5 1950 1950 5 1950 1950 5 1950 
# 1951
estim of distribut of random variabl for certain comput commun
traffic model a studi of multiaccess comput commun ha character
the distribut underli an elementari model of the user comput
interact process the model us is elementari in the sens
that mani of the random variabl that gener ar of
interest in comput commun studi can be decompos into the
element of thi model data were examin from four oper
multiaccess system and the model is shown to be robust
that is each of the variabl of the model ha
the same distribut independ of which of the four system
is be examin it is shown that the gamma distribut
can be us to describ the discret variabl approxim to
the gamma distribut by the exponenti distribut ar discuss for
the system studi cacm decemb 1970 fuch e jackson p
e comput commun time share oper system optim model 3
80 3 81 6 20 ca701212 jb februari 9 1978
2 46 pm 1533 4 1951 1604 4 1951 1951
4 1951 1951 4 1951 2373 4 1951 2667 4
1951 2668 4 1951 1410 5 1951 1604 5 1951
1951 5 1951 1951 5 1951 1951 5 1951 2373
5 1951 2894 5 1951 1410 6 1951 1751 6
1951 1810 6 1951 1951 6 1951 1951 6 1951
2016 6 1951 2374 6 1951 
# 1952
index by subject to algorithm 1970 cacm decemb 1970 ca701211
jb februari 9 1978 2 50 pm 1952 5 1952
1952 5 1952 1952 5 1952 
# 1953
exponenti integr ei x algorithm 385 s13 cacm decemb 1970
redish k a ansi fortran standard 4 0 4 22
ca701210 jb februari 9 1978 3 04 pm 1953 5
1953 1953 5 1953 1953 5 1953 
# 1954
eigenvalu and eigenvector of a real symmetr matrix algorithm 384
f2 cacm decemb 1970 stewart g w real symmetr matrix
eigenvalu eigenvector qr algorithm 5 14 ca701209 jb februari 9
1978 3 08 pm 1954 5 1954 1954 5 1954
1954 5 1954 
# 1955
characterist valu and associ solut of mathieu s differenti equat
algorithm 352 s22 cacm decemb 1970 sale a h j
mathieu s differenti equat mathieu function characterist valu period solut
radial solut 5 12 ca701208 jb februari 9 19783 10
pm 1613 4 1955 1646 4 1955 1900 4 1955
1955 4 1955 2025 4 1955 2154 4 1955 2365
4 1955 2506 4 1955 3060 4 1955 987 5
1955 1955 5 1955 1955 5 1955 1955 5 1955
2653 5 1955 2654 5 1955 1955 6 1955 1955
6 1955 
# 1956
optimum merg from mass storag an algorithm is displai which
yield the merg order such that the total read time
defin to be the sum of seek time plu data
transfer time is minim for a sort us mass storag
the analysi is parameter in term of the ratio of
seek time to the time it take to fill avail
core with record and the file size in unit of
core length and thu it can be appli to ani
convent cpu mass storag combin an explicit formula for total
read time is deriv in term of the paramet which
correl veri well with the total read time calcul us
the optimum merg order yield by the algorithm the formula
involv the root of a simpl transcendent equat a short
tabl of these root is includ numer result ar graphic
displai for a wide rang of the paramet it is
found that the normal read time for optimum merg on
a given hardwar configur is proport to the file length
time the logarithm of the file length cacm decemb 1970
black n a sort merg optimum merg mass storag sort
time drum merg access time 3 37 4 49 5
31 ca701207 jb februari 9 1978 3 18 pm 1956
4 1956 2017 4 1956 1956 5 1956 1956 5
1956 1956 5 1956 854 5 1956 
# 1957
the list set gener a construct for evalu set express
the list set gener is defin and algorithm for it
us ar given the list set gener is a construct
which mai be ad to a list process system or
ani system that handl set it effici gener the set
which result from ani express involv set and set oper
the effici deriv from evalu the express as a whole
and in parallel rather than evalu subexpress and then us
those set to arriv at the final result cacm decemb
1970 shapiro s c set manipul list process set gener
set list file process 3 73 3 74 4 22
ca701206 jb februari 9 1978 3 23 pm 1024 4
1957 1051 4 1957 1098 4 1957 1214 4 1957
1380 4 1957 1388 4 1957 1393 4 1957 1485
4 1957 1487 4 1957 1549 4 1957 1570 4
1957 1860 4 1957 1878 4 1957 1946 4 1957
1957 4 1957 1957 4 1957 1957 4 1957 2155
4 1957 2151 4 1957 2162 4 1957 2168 4
1957 2723 4 1957 2857 4 1957 3103 4 1957
3112 4 1957 3148 4 1957 1389 5 1957 1860
5 1957 1957 5 1957 1957 5 1957 1957 5
1957 731 5 1957 
# 1958
improv round off in rung kutta comput with gill s
method a rung kutta gill scheme in common us is
base on an incomplet adapt for float point oper of
gill s method an improv version reduc round off error
significantli in thi note the heart of the scheme is
present in fortran languag it is then shown how an
improv version of the method can be obtain with the
addit of two fortran statement the two version is a
signific improv a numer exampl compar the two is includ
cacm decemb 1970 thompson r j rung kutta method ordinari
differenti equat round off error error analysi 5 11 5
17 ca701205 jb februari 9 1978 3 40 pm 1958
5 1958 1958 5 1958 1958 5 1958 
# 1959
an interrupt base organ for manag inform system a program
structur languag construct and a supervisori system organ ar propos
for the design and code of larg share data base
system the base for thi organ ar a gener interrupt
structur and the newli introduc concept of file tag which
is the process of associ program structur and interrupt gener
condit with item in the data base an algorithm for
resolv conflict which aris in schedul the interrupt process routin
is present dpl a program languag and supervisori system in
which these concept ar implement is us to illustr the
new organ which is propos for manag inform system cacm
decemb 1970 morgan h l manag inform system integr data
process supervisor interrupt monitor system supervisori system interrupt schedul parallel
process 3 51 4 22 4 32 ca701204 jb februari
9 1978 3 46 pm 1959 4 1959 1135 5
1959 1959 5 1959 1959 5 1959 1959 5 1959
2182 5 1959 2534 5 1959 830 6 1959 1787
6 1959 1959 6 1959 1959 6 1959 1973 6
1959 2111 6 1959 2182 6 1959 799 6 1959
# 1960
process manag and resourc share in the multiaccess system esop
the main design principl of the multiaccess system esop ar
describ emphasi is place on basic idea underli the design
rather than on implement detail the main featur of the
system includ the abil given to ani user to schedul
hi own parallel process us system primit oper the file
memori relationship and the alloc schedul polici which dynam take
into account recent inform about user behavior cacm decemb 1970
betourn c bouleng j ferri j kaiser c krakowiak s
mossier j time share multiprogram process schedul resourc alloc 4
32 ca701203 jb februari 9 1978 4 02 pm 1458
4 1960 1523 4 1960 1603 4 1960 1698 4
1960 1747 4 1960 1748 4 1960 1828 4 1960
1854 4 1960 1854 4 1960 1877 4 1960 1877
4 1960 1960 4 1960 1960 4 1960 1960 4
1960 2150 4 1960 2317 4 1960 2319 4 1960
2377 4 1960 2377 4 1960 2378 4 1960 2342
4 1960 2376 4 1960 2379 4 1960 2424 4
1960 2482 4 1960 2497 4 1960 2558 4 1960
2618 4 1960 2625 4 1960 2632 4 1960 2632
4 1960 2704 4 1960 2723 4 1960 2738 4
1960 2740 4 1960 2741 4 1960 2840 4 1960
2867 4 1960 2941 4 1960 3105 4 1960 3144
4 1960 3184 4 1960 1471 5 1960 1749 5
1960 1854 5 1960 1960 5 1960 1960 5 1960
1960 5 1960 2376 5 1960 1198 6 1960 1749
6 1960 1960 6 1960 
# 1961
an effici search algorithm to find the elementari circuit of
a graph a theoret most effici search algorithm is present
which us an exhaust search to find all of the
elementari circuit of a graph the algorithm can be easili
modifi to find all of the elementari circuit with a
particular attribut such as length a rigor proof of the
algorithm is given as well as an exampl of it
applic empir bound ar present relat the speed of the
algorithm to the number of vertic and the number of
arc the speed is also relat to the number of
circuit in the graph to give a relat between speed
and complex extens to undirect and s graph ar discuss
cacm decemb 1970 tiernan j c algorithm graph theori circuit
search algorithm path search algorithm search 3 74 5 32
ca701202 jb februari 9 1978 4 12 pm 1847 4
1961 1961 4 1961 1961 4 1961 1961 4 1961
2052 4 1961 2177 4 1961 2763 4 1961 1369
5 1961 1504 5 1961 1847 5 1961 1961 5
1961 1961 5 1961 1961 5 1961 2430 5 1961
1961 6 1961 
# 1962
groov a program to compos store and edit function of
time a program which make possibl creat store reproduc and
edit function of time is describ the function ar typic
of those gener by human be multipl function up to
14 ar produc for long period of time up to
sever hour at suffici high sampl rate to describ fast
human reaction up to 200 sampl per second the function
can be us for a varieti of purpos such as
the control of machin tool or sound synthes or anyth
a person normal control the program oper on a small
comput ddp 224 function ar store on a disk file
function mai be creat by real time human input to
the comput which can interact with alreadi store function and
comput function real time feedback from the process be control
is an import link in the system the environ for
effect man machin interact ha been carefulli nurtur cacm decemb
1970 mathew m v moor f r comput music music
real time control digit control time function interact softwar hybrid
system conductor program 3 44 3 8 7 3 ca701201
jb februari 9 1978 4 19 pm 1962 5 1962
1962 5 1962 1962 5 1962 
# 1963
condit number of pei matric cacm novemb 1970 rokn j
matric condit number pei matric eigenvector eigenvalu 5 14 ca701116
jb februari 9 1978 4 21 pm 1963 4 1963
1963 4 1963 1963 4 1963 909 5 1963 1963
5 1963 1963 5 1963 1963 5 1963 475 5
1963 750 5 1963 
# 1964
comment on the work set model for program behavior cacm
novemb 1970 bernstein a demand page work set page rate
multiprogram 4 30 4 32 ca701115 jb februari 9 1978
4 23 pm 1964 5 1964 1964 5 1964 1964
5 1964 
# 1965
correct to logic arithmet on comput with two s complement
binari arithmet cacm novemb 1970 ehrman j r binari arithmet
unsign operand arithmet maximum signific arithmet full precis arithmet 3
15 5 11 ca701114 jb februari 9 1978 4 25
pm 1965 4 1965 2200 4 1965 1718 5 1965
1965 5 1965 1965 5 1965 1965 5 1965 
# 1966
a gener method for gener argument function valu cacm novemb
1970 wilson w j map function decis hierarchi tabl look
up 4 9 5 39 ca701113 jb februari 9 1978
4 26 pm 1966 5 1966 1966 5 1966 1966
5 1966 
# 1967
an improv algorithm to produc complex prime algorithm 401 a1
cacm novemb 1970 bratlei p number theori prime number complex
number 5 39 ca701112 jb februari 9 1978 4 28
pm 1841 4 1967 1967 4 1967 1967 4 1967
2120 4 1967 2927 4 1967 1539 5 1967 1967
5 1967 1967 5 1967 1967 5 1967 2120 5
1967 
# 1968
eigenvalu and eigenvector of a real gener matrix algorithm 343
f1 cacm novemb 1970 knight w mersereau w eigenvalu eigenvector
latent root household s method qr algorithm invers iter 5
14 ca701111 jb februari 9 1978 4 30 pm 1968
4 1968 1968 4 1968 2099 4 1968 2335 4
1968 1662 5 1968 1968 5 1968 1968 5 1968
1968 5 1968 2099 5 1968 
# 1969
increas the effici of quicksort algorithm 402 m1 cacm novemb
1970 van emden m h sort quicksort 5 31 3
73 5 6 4 49 ca701110 jb februari 9 1978
4 32 pm 1175 4 1969 1919 4 1969 1919
4 1969 1969 4 1969 1969 4 1969 1997 4
1969 2118 4 1969 2191 4 1969 2388 4 1969
2348 4 1969 2679 4 1969 2679 4 1969 3054
4 1969 3054 4 1969 3121 4 1969 1175 5
1969 1969 5 1969 1969 5 1969 1969 5 1969
1997 5 1969 308 5 1969 2216 5 1969 2679
5 1969 3054 5 1969 864 6 1969 970 6
1969 1175 6 1969 1175 6 1969 1190 6 1969
1228 6 1969 1880 6 1969 1919 6 1969 1919
6 1969 1969 6 1969 1969 6 1969 1969 6
1969 1969 6 1969 1980 6 1969 1997 6 1969
1997 6 1969 1997 6 1969 307 6 1969 308
6 1969 308 6 1969 308 6 1969 309 6
1969 2017 6 1969 2042 6 1969 2679 6 1969
3187 6 1969 507 6 1969 716 6 1969 776
6 1969 783 6 1969 
# 1970
unrecord magnet tape for inform interchang 9 track 200 and
800 cpi nrzi and 1600 cpi pe propos american nation
standard cacm novemb 1970 input output magnet tape inform interchang
measur instrument phase encod record 2 49 6 35 ca701108
jb februari 9 1978 4 42 pm 1970 5 1970
1970 5 1970 1970 5 1970 
# 1971
record magnet tape for inform interchang 1600 cpi phase encod
propos american nation standard cacm novemb 1970 input output magnet
tape inform interchang measur instrument phase encod record 2 49
6 35 ca701107 jb februari 9 1978 4 49 pm
1971 5 1971 1971 5 1971 1971 5 1971 
# 1972
a nonrecurs list compact algorithm a simpl nonrecurs list structur
compact scheme or garbag collector suitabl for both compact and
lisp like list structur is present the algorithm avoid the
need for recurs by us the partial structur as it
is built up to keep track of those list that
have been copi cacm novemb 1970 chenei c j list
compact garbag collect compact list lisp 4 19 4 49
ca701106 jb februari 9 1978 4 54 pm 1972 4
1972 1972 4 1972 2156 4 1972 2168 4 1972
2249 4 1972 2438 4 1972 2723 4 1972 2736
4 1972 2736 4 1972 2833 4 1972 2855 4
1972 3074 4 1972 3074 4 1972 3112 4 1972
1826 5 1972 1853 5 1972 1972 5 1972 1972
5 1972 1972 5 1972 2156 5 1972 2361 5
1972 2513 5 1972 2736 5 1972 2855 5 1972
3074 5 1972 3106 5 1972 3112 5 1972 106
6 1972 1380 6 1972 1549 6 1972 1549 6
1972 1549 6 1972 1626 6 1972 1626 6 1972
1826 6 1972 1826 6 1972 1826 6 1972 1826
6 1972 1826 6 1972 210 6 1972 210 6
1972 1853 6 1972 1853 6 1972 1972 6 1972
1972 6 1972 1972 6 1972 1972 6 1972 1972
6 1972 1972 6 1972 1972 6 1972 1972 6
1972 2438 6 1972 2513 6 1972 2665 6 1972
2723 6 1972 2723 6 1972 2736 6 1972 2766
6 1972 2766 6 1972 2833 6 1972 2833 6
1972 2838 6 1972 2855 6 1972 2954 6 1972
2998 6 1972 2998 6 1972 731 6 1972 
# 1973
the linear quotient hash code a new method of hash
code is present and is shown to possess desir attribut
specif the algorithm is simpl effici and exhaust while need
littl time per probe and us few probe per lookup
perform data and implement hint ar also given cacm novemb
1970 bell j r kaman c h hash hash code
scatter storag calcul address search tabl lookup symbol tabl kei
3 74 4 9 ca701105 jb februari 10 1978 8
33 am 1676 4 1973 1682 4 1973 1728 4
1973 1860 4 1973 1860 4 1973 1973 4 1973
1973 4 1973 1973 4 1973 1973 4 1973 1992
4 1973 1992 4 1973 2018 4 1973 2018 4
1973 2018 4 1973 2032 4 1973 2033 4 1973
2033 4 1973 2107 4 1973 2107 4 1973 2109
4 1973 2109 4 1973 2138 4 1973 2203 4
1973 2203 4 1973 2203 4 1973 2203 4 1973
2251 4 1973 2251 4 1973 2251 4 1973 2251
4 1973 2359 4 1973 2524 4 1973 2530 4
1973 2537 4 1973 2543 4 1973 2543 4 1973
2543 4 1973 2543 4 1973 2552 4 1973 2559
4 1973 2559 4 1973 2573 4 1973 2573 4
1973 2770 4 1973 2770 4 1973 2974 4 1973
2991 4 1973 2991 4 1973 3053 4 1973 3053
4 1973 3053 4 1973 3083 4 1973 1785 5
1973 1786 5 1973 1973 5 1973 1973 5 1973
1973 5 1973 2107 5 1973 2109 5 1973 2251
5 1973 2534 5 1973 2543 5 1973 2559 5
1973 2770 5 1973 3053 5 1973 3083 5 1973
830 6 1973 1328 6 1973 1329 6 1973 1785
6 1973 1785 6 1973 1785 6 1973 1785 6
1973 1786 6 1973 1786 6 1973 1786 6 1973
1787 6 1973 1869 6 1973 1959 6 1973 1973
6 1973 1973 6 1973 1973 6 1973 1973 6
1973 1973 6 1973 1973 6 1973 1973 6 1973
1992 6 1973 1992 6 1973 332 6 1973 2018
6 1973 2018 6 1973 2107 6 1973 2107 6
1973 2107 6 1973 2107 6 1973 2107 6 1973
2109 6 1973 2109 6 1973 2109 6 1973 2109
6 1973 2111 6 1973 2182 6 1973 2412 6
1973 2543 6 1973 2543 6 1973 2552 6 1973
2673 6 1973 2673 6 1973 2707 6 1973 2770
6 1973 799 6 1973 
# 1974
neater2 a pl i sourc statement reformatt neater2 accept a
pl i sourc program and oper on it to produc
a reformat version when in the logic mode neater2 indic
the logic structur of the sourc program in the indent
pattern of it output logic error discov through neater2 logic
analysi ar discov much more econom than is possibl through
compil and trial run a number of option ar avail
to give the user full control over the output format
and to maxim the util of neater2 as an aid
dure the earli stage of develop of a pl i
sourc deck on option usag caus neater2 to insert into
each logic unit of code a statement which will case
the number of time each on is execut to be
record dure execut thi featur is expect to provid a
major aid in optim of pl i program cacm novemb
1970 conrow k smith r g logic analysi of pl
i sourc reformat of pl i sourc document aid execut
time usag data 1 52 4 12 4 19 4
42 ca701104 jb februari 10 1978 8 40 am 1974
5 1974 1974 5 1974 1974 5 1974 2971 5
1974 1835 6 1974 1974 6 1974 2534 6 1974
# 1975
a multipl precis divis algorithm a gener divis algorithm for
us with posit integr operand is present depend upon the
algebra relationship of the first two cipher of the divisor
on or at most two adjust to the origin divisor
and dividend must be perform befor the divis oper can
be initi the uniqu of thi method will caus each
trial cipher in the quotient to be either equal to
or on greater than it final replac cacm novemb 1970
mifsud c j multipl precis divis adjust gener 3 15
4 0 5 1 ca701103 jb februari 10 1978 8
45 am 1258 4 1975 1292 4 1975 1497 4
1975 1497 4 1975 1593 4 1975 1975 4 1975
1975 4 1975 1975 4 1975 2605 4 1975 1026
5 1975 1292 5 1975 1497 5 1975 1975 5
1975 1975 5 1975 1975 5 1975 2432 5 1975
1975 6 1975 
# 1976
multi attribut retriev with combin index in thi paper a
file organ scheme design to replac the us of the
popular secondari index file scheme or invert file on secondari
kei field is describ through the us of redund and
store kei or access number of the record that satisfi
differ combin of secondari index valu in bucket it is
possibl to retriev all kei satisfi ani input queri deriv
from a subset of field by a singl access to
an index file although each bucket mai be us for
mani combin of valu and a combin of bucket mai
be requir for a given queri the method which in
it degener case becom the convent secondari index file scheme
work similarli but ha the follow advantag 1 the elimin
of multipl access in mani case 2 the elimin of
fals drop 3 the elimin of comput time to perform
intersect of kei set each qualifi for on secondari index
field onli and 4 the avoid of long string of
kei when an index field appear in a queri ha
veri few possibl valu redund in some case is the
same as the secondari index method in the gener case
trade off between the number of access for queri and
redund exist cacm novemb 1970 lum v y file organ
secondari index file invert file inform retriev data manag access
method secondari kei storag with bucket rapid retriev balanc file
scheme elimin of fals drop combin index queri multi attribut
retriev 3 73 3 74 3 79 ca701102 jb februari
10 1978 9 00 am 1976 4 1976 1271 5
1976 1976 5 1976 1976 5 1976 1976 5 1976
2140 5 1976 2452 5 1976 2765 5 1976 2901
5 1976 3134 5 1976 849 6 1976 1936 6
1976 1936 6 1976 1976 6 1976 1976 6 1976
1976 6 1976 1976 6 1976 1976 6 1976 2046
6 1976 2046 6 1976 2160 6 1976 2198 6
1976 2451 6 1976 2452 6 1976 2524 6 1976
2715 6 1976 2990 6 1976 616 6 1976 
# 1977
an interact displai for approxim by linear program an interact
program with a graphic displai ha been develop for the
approxim of data by mean of a linear combin of
function includ spline select by the user the coeffici of
the approxim ar determin by linear program so as to
minim the error in either the l1 or l infin
norm auxiliari condit such as monoton or convex of the
approxim can also be impos thi interact system is describ
and sever exampl of it us ar given cacm novemb
1970 lafata p rosen j b approxim data fit function
approxim linear program interact graphic displai spline function 5 13
5 41 ca701101 jb februari 10 1978 9 06 am
1977 5 1977 1977 5 1977 1977 5 1977 2604
5 1977 1977 6 1977 
# 1978
the us of interact graphic to solv numer problem with
the advent of on line time share comput system and
graphic termin we have avail a new dimens in numer
problem solv capabl rather than simpli us the new power
to achiev fast turnaround we can develop interact routin which
ar easi to us and also take advantag of the
insight and visual capabl of the human problem solver sever
on line system for gener purpos mathemat problem solv have
alreadi been implement as well as some special purpos system
for solv problem in a particular area such as ordinari
differenti equat the advantag of restrict the problem area is
that the interfac with a user can be greatli simplifi
in thi paper we discuss some of the advantag accru
by such system and design consider for interact routin furthermor
an implement of an on line least squar data fit
program peg is present with result obtain from empir data
in conclus area for futur work in thi field ar
discuss cacm octob 1970 smith l b interact graphic comput
graphic graphic least squar data fit interact comput on line
mathemat 1 3 3 1 5 13 5 5 ca701012
jb februari 10 1978 9 14 am 1978 4 1978
1978 4 1978 1978 4 1978 1307 5 1978 1589
5 1978 1813 5 1978 1978 5 1978 1978 5
1978 1978 5 1978 
# 1979
numer invers of laplac transform algorithm 368 d5 cacm octob
1970 stehfest h laplac transform invers integr transform integr equat
5 15 5 18 ca701011 jb februari 10 1978 9
16 am 1979 5 1979 1979 5 1979 1979 5
1979 
# 1980
an effici algorithm for sort with minim storag algorithm 347
m1 cacm octob 1970 peto r sort rank minim storag
sort digit comput sort 5 31 ca701010 jb februari 10
1978 9 19 am 1980 5 1980 1980 5 1980
1980 5 1980 3054 5 1980 1175 6 1980 1880
6 1980 1919 6 1980 1969 6 1980 1980 6
1980 1997 6 1980 307 6 1980 308 6 1980
309 6 1980 2017 6 1980 2679 6 1980 776
6 1980 
# 1981
normal curv integr algorithm 304 s15 cacm octob 1970 holmgren
b normal curv integr probabl special function 5 12 5
5 ca701009 jb februari 10 1978 9 20 am 1981
5 1981 1981 5 1981 1981 5 1981 
# 1982
modifi havi integr algorithm 400 d1 cacm octob 1970 wallick
g c numer integr havi integr romberg quadratur modifi romberg
quadratur trapezoid valu rectangl valu 5 16 ca701008 jb februari
10 1978 9 22 am 205 4 1982 210 4
1982 214 4 1982 1352 4 1982 1352 4 1982
1982 4 1982 1982 4 1982 1982 4 1982 1982
4 1982 398 4 1982 2040 4 1982 2040 4
1982 2355 4 1982 642 4 1982 669 4 1982
100 4 1982 123 4 1982 164 4 1982 1
5 1982 1273 5 1982 1883 5 1982 1982 5
1982 1982 5 1982 1982 5 1982 324 5 1982
2415 5 1982 1040 6 1982 1982 6 1982 2074
6 1982 
# 1983
span tree h algorithm 399 cacm octob 1970 seppanen j
j graph tree span tree 5 32 ca701007 jb februari
10 1978 9 24 am 1983 5 1983 1983 5
1983 1983 5 1983 
# 1984
tableless date convers z algorithm 398 cacm octob 1970 stone
r a date calendar 5 9 ca701006 jb februari 10
1978 9 25 am 1984 5 1984 1984 5 1984
1984 5 1984 
# 1985
an integ program problem h algorithm 397 cacm octob 1970
chang s k gill a integ program chang make problem
5 41 ca701005 jb februari 10 1978 9 28 am
1985 5 1985 1985 5 1985 1985 5 1985 
# 1986
student s t quantil s14 algorithm 396 cacm octob 1970
hill g w student s t statist quantil asymptot approxim
5 12 5 5 ca701004 jb februari 10 1978 9
29 am 1986 4 1986 2315 4 1986 1986 5
1986 1986 5 1986 1986 5 1986 1987 5 1986
# 1987
student s t distribut s14 algorithm 395 cacm octob 1970
hill g w student s t statist distribut function approxim
asymptot expans 5 12 5 5 ca701003 jb februari 10
1978 9 31 am 1157 4 1987 1779 4 1987
1920 4 1987 1944 4 1987 1944 4 1987 1987
4 1987 1987 4 1987 1987 4 1987 1987 4
1987 1987 4 1987 2427 4 1987 2548 4 1987
1561 5 1987 1581 5 1987 1779 5 1987 1944
5 1987 1986 5 1987 1987 5 1987 1987 5
1987 1987 5 1987 2315 5 1987 714 5 1987
1348 6 1987 1834 6 1987 1987 6 1987 1987
6 1987 728 6 1987 
# 1988
a formal for translat interact a formal is present for
describ the action of processor for program languag compil interpret
assembl and their interact in complex system such as compil
compil or extend languag the formal here might be us
to defin and answer such a question as can on
do bootstrap us a meta compil whose metaphas is interpret
in addit an algorithm is present for decid whether or
not a given system can be produc from a given
set of compon processor cacm octob 1970 earlei j translat
compil interpret bootstrap languag processor compil compil 4 1 5
29 ca701002 jb februari 10 1978 9 36 am 1159
4 1988 1396 4 1988 1767 4 1988 1781 4
1988 1781 4 1988 1781 4 1988 1787 4 1988
1860 4 1988 1945 4 1988 1988 4 1988 1988
4 1988 1988 4 1988 1988 4 1988 381 4
1988 2252 4 1988 1496 5 1988 1988 5 1988
1988 5 1988 1988 5 1988 381 5 1988 11
5 1988 14 5 1988 
# 1989
transit network grammar for natur languag analysi the us of
augment transit network grammar for the analysi of natur languag
sentenc is describ structur build action associ with the arc
of the grammar network allow for the reorder restructur and
copi of constitu necessari to produc deep structur represent of
the type normal obtain from a transform analysi and condit
on the arc allow for a power select which can
rule out meaningless analys and take advantag of semant inform
to guid the pars the advantag of thi model for
natur languag analysi ar discuss in detail and illustr by
exampl an implement of an experiment pars system for transit
network grammar is briefli describ cacm octob 1970 wood w
a comput linguist grammar grammar model linguist natur languag analysi
pars semant interpret transit network grammar transform grammar 3 42
4 12 ca701001 jb februari 10 1978 9 43 am
1323 4 1989 1358 4 1989 1380 4 1989 1665
4 1989 1781 4 1989 1787 4 1989 1989 4
1989 1989 4 1989 2060 4 1989 2112 4 1989
2179 4 1989 2534 4 1989 2541 4 1989 2698
4 1989 2698 4 1989 2733 4 1989 2820 4
1989 2921 4 1989 3073 4 1989 3155 4 1989
3154 4 1989 1989 5 1989 1989 5 1989 1989
5 1989 2110 5 1989 2581 5 1989 2739 5
1989 2795 5 1989 2921 5 1989 3087 5 1989
799 5 1989 1928 6 1989 1989 6 1989 1989
6 1989 1989 6 1989 1989 6 1989 1989 6
1989 2046 6 1989 2110 6 1989 2274 6 1989
# 1990
numer constant algorithm cacm septemb 1970 dunham c b numer
algorithm numer constant 5 10 ca700915 jb februari 10 1978
9 48 am 1990 5 1990 1990 5 1990 1990
5 1990 
# 1991
on the number of automorph of a singli gener automaton
cacm septemb 1970 bavel z automata finit automata singli gener
automata automorph gener length of state minim length gener orbit
5 22 ca700914 jb februari 10 1978 9 54 am
1991 5 1991 1991 5 1991 1991 5 1991 
# 1992
comment on bell s quadrat quotient method for hash code
search cacm septemb 1970 lamport l hash hash code scatter
storag calcul address cluster search symbol tabl kei tabl look
up 3 74 4 9 ca700913 jb februari 10 1978
9 56 am 1860 4 1992 1973 4 1992 1973
4 1992 1992 4 1992 1992 4 1992 2018 4
1992 2033 4 1992 2107 4 1992 2109 4 1992
2138 4 1992 2203 4 1992 2203 4 1992 2251
4 1992 2251 4 1992 2530 4 1992 2537 4
1992 2543 4 1992 2543 4 1992 2559 4 1992
2573 4 1992 2573 4 1992 2770 4 1992 2991
4 1992 3053 4 1992 3083 4 1992 1786 5
1992 1992 5 1992 1992 5 1992 1992 5 1992
2107 5 1992 2770 5 1992 3053 5 1992 1329
6 1992 1785 6 1992 1786 6 1992 1869 6
1992 1973 6 1992 1973 6 1992 1992 6 1992
1992 6 1992 2018 6 1992 2107 6 1992 2109
6 1992 2109 6 1992 2412 6 1992 2543 6
1992 2673 6 1992 2673 6 1992 2707 6 1992
2770 6 1992 
# 1993
regular coulomb wave function algorithm 292 s22 cacm septemb 1970
codi w j paciorek k a coulomb wave function wave
function regular coulomb wave function 5 12 ca700912 jb februari
10 1978 10 03 am 1993 5 1993 1993 5
1993 1993 5 1993 
# 1994
decis tabl translat h algorithm 394 cacm septemb 1970 dial
r b decis tabl decis tabl translat 4 19 ca700911
jb februari 10 1978 10 05 am 1354 4 1994
1488 4 1994 1994 4 1994 2053 4 1994 2220
4 1994 2273 4 1994 1237 5 1994 1994 5
1994 1994 5 1994 1994 5 1994 
# 1995
special seri summat with arbitrari precis c6 algorithm 393 cacm
septemb 1970 abdali s k function evalu seri summat approxim
5 12 5 13 ca700910 jb februari 10 1978 10
06 am 1995 5 1995 1995 5 1995 1995 5
1995 
# 1996
system of hyperbol pde d3 algorithm 392 cacm septemb 1970
smith r r mccall d hyperbol p d e characterist
extrapol second order p d e quasilinear p d e
5 17 ca700909 jb februari 10 1978 10 08 am
1996 5 1996 1996 5 1996 1996 5 1996 
# 1997
increas the effici of quicksort a method is present for
the analysi of variou gener of quicksort the averag asymptot
number of comparison need is shown to be an log
2 n a formula is deriv express a in term
of the probabl distribut of the bound of a partit
thi formula assum a particularli simpl form for a gener
alreadi consid by hoar name choic of the bound as
median of a random sampl the main contribut of thi
paper is anoth gener of quicksort which us a bound
interv instead of a singl element as bound thi gener
turn out to be easi to implement in a comput
program a numer approxim show that a 1 140 for
thi version of quicksort compar with 1 386 for the
origin thi impli a decreas in number of comparison of
18 percent actual test show about 15 percent save in
comput time cacm septemb 1970 van emden m h sort
quicksort inform content entropi distribut of median 3 73 4
49 5 31 5 6 ca700908 jb februari 10 1978
10 15 am 1175 4 1997 1919 4 1997 1969
4 1997 1997 4 1997 1997 4 1997 2191 4
1997 2216 4 1997 2388 4 1997 2679 4 1997
2679 4 1997 3054 4 1997 3054 4 1997 3121
4 1997 1969 5 1997 1997 5 1997 1997 5
1997 1997 5 1997 308 5 1997 2216 5 1997
2679 5 1997 3054 5 1997 864 6 1997 970
6 1997 1175 6 1997 1175 6 1997 1190 6
1997 1228 6 1997 1880 6 1997 1919 6 1997
1919 6 1997 1969 6 1997 1969 6 1997 1969
6 1997 1980 6 1997 1997 6 1997 1997 6
1997 1997 6 1997 307 6 1997 308 6 1997
308 6 1997 309 6 1997 2017 6 1997 2042
6 1997 2679 6 1997 3187 6 1997 507 6
1997 716 6 1997 776 6 1997 783 6 1997
# 1998
complex matrix invers versu real a comparison of complex matrix
with real matrix invers is made it is shown that
the complex invers can be up to twice as fast
as the real invers further the round error bound for
complex invers is about on eighth that of real for
gaussian elimin us extend inner product accumul the bound is
half of the real system cacm septemb 1970 ehrlich l
w complex matrix invers matrix invers invers round error round
error bound error bound complex round error bound 5 14
5 11 5 10 ca700907 jb februari 10 1978 10
19 am 1998 5 1998 1998 5 1998 1998 5
1998 
# 1999
optim start approxim for gener squar root for slow or
no divid on machin with slow or no divis it
is prefer to us an iter scheme for the squar
root differ from the classic heron scheme the problem of
optim initi approxim is consid and some optim polynomi initi
approxim ar tabul cacm septemb 1970 wilson m w squar
root newton raphson iter optim approxim 5 13 ca700906 jb
februari 10 1978 1 33 pm 1832 4 1999 1999
4 1999 2159 4 1999 1932 5 1999 1999 5
1999 1999 5 1999 1999 5 1999 
# 2000
a variat of the goodman lanc method for the solut
of two point boundari valu problem a recent publish method
for the interpol solut of nonlinear equat is improv and
appli to give a signific variat of the goodman lanc
method for the solut of two point boundari valu problem
the result method appli in particular to the numer solut
of optim control problem in the euler lagrang formul quantit
estim ar present which indic that the variat is nearli
twice as fast on some problem in the latter context
cacm septemb 1970 kimbl g w goodman lanc boundari valu
problem newton s method nonlinear equat optim control optim ordinari
differenti equat secant method interpol solut orthogon matric 3 21
5 15 5 17 ca700905 jb februari 10 1978 1
39 pm 2000 5 2000 2000 5 2000 2000 5
2000 
# 2001
integr squar root differenti equat of the y 2 f
y ar difficult to integr numer becaus of the singular
at point where f y vanish a simpl trick remov
the singular cacm septemb 1970 moler c b solomon l
p quadratur differenti equat 5 16 5 17 ca700904 jb
februari 10 1978 1 42 pm 2001 5 2001 2001
5 2001 2001 5 2001 
# 2002
amesplot a higher level data plot softwar system amesplot is
an extens softwar system design to make the displai of
data as simpl painless and neat as possibl the system
describ is hardwar independ and ha been implement on a
varieti of instal of differ manufactur have divers configur the
element common to all type of data plot ar outlin
and the wai in which these element mai be combin
into a system base on simpl modul is demonstr these
modul ar specifi independ and ar independ of the axi
system or other attribut of the plot thi enabl plot
of ani complex to be construct by ad or replac
modul the basic syntax of amesplot is outlin and a
brief descript is given of it current util softwar consist
of macro to produc self scale plot formal tablet of
text interspers with subplot map coastlin and 3 d plot
the system wa formul d in a wai such that
the user could suppli the minimum of inform and it
should be fulli integr with user s program written in
most convent higher languag the function of posit locat and
scale in the layout of multipl subplot of ax label
and all other element of the plot ar handl automat
by the softwar system unless the user specifi otherwis the
structur of plot from multipl independ self contain subplot is
describ transform project scale rotat or shift of entir plot
or subplot by the action of on or more simpl
modul is possibl the user mai interact freeli with amesplot
at three level enabl him to construct hi own data
marker alphabet charact and transform and to produc a varieti
of artist and other effect cacm septemb 1970 hirschsoln i
comput graphic data pot data displai syntax hardwar independ softwar
displai devic independ softwar plot element self scale plot user
interact tablet organ map displai project 4 13 4 29
4 49 4 9 ca700903 jb februari 10 1978 2
08 pm 2003 4 2002 2002 4 2002 2002 4
2002 2152 4 2002 1767 5 2002 1937 5 2002
2002 5 2002 2002 5 2002 2002 5 2002 
# 2003
an interact softwar system for comput aid design an applic
to circuit project the characterist of an interact softwar system
intend to constitut an interfac between design and comput dure
variou step of the design process ar present the main
emphasi is given to the descript of the featur of
the two high level user orient languag oper at differ
level on which the interact is base the first on
is imol an interact monitor languag which is design to
perform the overal and control function of the softwar system
it design criteria provid the user with command which ar
both simpl and effici in order to perform all the
function need in comput aid circuit design the second on
is coif a circuit orient graphic languag which is design
to describ gener and manipul graphic problem specif it is
an extens of fortran with graphic type variabl so that
the design who is familiar with fortran need not learn
a new languag the applic to comput aid circuit design
is in particular examin on the other hand the adopt
design criteria provid suffici gener to extend the us of
the two languag to differ comput assist applic cacm septemb
1970 bracchi g somalvico m interact graphic comput graphic comput
aid design circuit design softwar system softwar organ languag monitor
languag graphic languag extend fortran 3 24 3 25 4
13 4 22 4 3 ca700902 jb februari 10 1978
2 20 pm 1853 4 2003 2003 4 2003 2003
4 2003 2003 4 2003 2002 4 2003 2152 4
2003 1710 5 2003 1767 5 2003 2003 5 2003
2003 5 2003 2003 5 2003 2105 5 2003 2230
5 2003 2003 6 2003 
# 2004
a procedur for gener of three dimension half tone comput
graphic present a descript is given of an algorithm for
produc comput gener half tone present of three dimension polygon
surfac structur thi algorithm achiev a signific increas in speed
of comput over the warnock algorithm develop at the univers
of utah and implement also on the coordin scienc laboratori
cdc 1604 comput system at the univers of illinoi the
histori lead to the algorithm develop and then the algorithm
itself ar describ result ar present and ar compar with
comput run achiev by the warnock approach an extens of
the procedur to variabl posit illumin sourc is also given
cacm septemb 1970 bouknight w j half tone comput graphic
line scan imag process hidden surfac polygon surfac structur present
4 9 ca700901 jb februari 10 1978 2 27 pm
2004 4 2004 2004 4 2004 2687 4 2004 2692
4 2004 1686 5 2004 1915 5 2004 2004 5
2004 2004 5 2004 2004 5 2004 2674 5 2004
2687 5 2004 2828 5 2004 1741 6 2004 1741
6 2004 1751 6 2004 1915 6 2004 2004 6
2004 2004 6 2004 2004 6 2004 2421 6 2004
2687 6 2004 2751 6 2004 2841 6 2004 
# 2005
propos revis of american nation standard x3 21 1967 rectangular
hole in twelv row punch card cacm august 1970 tabul
card hollerith card keypunch inform process 6 35 ca700816 jb
februari 10 1978 2 48 pm 2005 5 2005 2005
5 2005 2005 5 2005 
# 2006
propos american nation standard cacm august 1970 kerpelman c state
identifi state abbrevi state of the unit state data element
data code numer code geopolit subdivis geograph code 3 35
3 57 ca700815 jb februari 10 1978 3 10 pm
2006 5 2006 2006 5 2006 2006 5 2006 
# 2007
algorithm polici revis august 1970 cacm august 1970 ca700814 jb
februari 10 1978 3 12 pm 2007 5 2007 2007
5 2007 2007 5 2007 
# 2008
gaussian quadratur formula algorithm 331 d1 cacm august 1970 wise
jr w r quadratur gaussian quadratur numer integr weight function
orthogon polynomi newton s method success deflat 5 16 ca700813
jb februari 10 1978 3 15 pm 2008 5 2008
2008 5 2008 2008 5 2008 
# 2009
simpson s rule for multipl integr algorithm 233 d1 cacm
august 1970 proll l g numer integr multipl integr simpson
s rule 5 16 ca700812 jb februari 10 1978 3
17 pm 2009 5 2009 2009 5 2009 2009 5
2009 
# 2010
unitari symmetr polynomi z algorithm 391 cacm august 1970 mckai
j symmetr polynomi unitari symmetr polynomi 5 11 5 30
5 5 ca700811 jb februari 10 1978 3 19 pm
2010 5 2010 2010 5 2010 2010 5 2010 
# 2011
sequenc order walsh function s22 algorithm 390 cacm august 1970
hubner h walsh function sequenc order walsh function 5 12
5 13 ca700810 jb februari 10 1978 3 20 pm
2011 4 2011 2011 5 2011 2011 5 2011 2011
5 2011 2012 5 2011 
# 2012
binari order walsh function s22 algorithm 389 cacm august 1970
hubner h walsh function binari order walsh function 5 12
5 13 ca700809 jb februari 10 1978 3 22 pm
2012 4 2012 2011 5 2012 2012 5 2012 2012
5 2012 2012 5 2012 2013 5 2012 2012 6
2012 
# 2013
rademach function s22 algorithm 388 cacm august 1970 hubner h
rademach function 5 12 5 13 ca700808 jb februari 10
1978 3 23 pm 2012 5 2013 2013 5 2013
2013 5 2013 2013 5 2013 2013 6 2013 
# 2014
function minim and linear search e4 algorithm 387 cacm august
1970 field k function minim rel minimum quasi newton method
5 15 ca700807 jb februari 10 1978 3 30 pm
2014 5 2014 2014 5 2014 2014 5 2014 
# 2015
a techniqu for gener almost optim floyd evan product for
preced grammar a techniqu is develop for gener almost optim
floyd evan product given a preced grammar a graph formul
is us for the problem of merg product the product
gener correspond to the minimum cost invers arboresc of that
graph the valid of the techniqu is demonstr for weak
preced grammar defin here but the product mechan gener for
ani preced grammar can often be modifi in such a
wai that correct almost optim parser ar obtain cacm august
1970 ichbiah j d mors s p translat write system
syntact analysi floyd evan product preced grammar translat optim merger
algorithm minimum cost invers arboresc graph theori 4 12 5
23 5 32 ca700806 jb februari 10 19783 38 pm
1379 4 2015 1665 4 2015 1693 4 2015 1768
4 2015 1781 4 2015 1787 4 2015 1824 4
2015 1825 4 2015 1836 4 2015 1836 4 2015
1861 4 2015 1945 4 2015 2015 4 2015 2015
4 2015 2060 4 2015 2061 4 2015 2091 4
2015 2110 4 2015 2127 4 2015 2179 4 2015
2187 4 2015 2317 4 2015 2545 4 2015 2546
4 2015 2698 4 2015 2698 4 2015 2708 4
2015 2733 4 2015 3045 4 2015 1477 5 2015
1781 5 2015 2015 5 2015 2015 5 2015 2015
5 2015 2179 5 2015 2423 5 2015 1337 6
2015 1477 6 2015 1491 6 2015 1825 6 2015
2015 6 2015 2015 6 2015 2110 6 2015 3184
6 2015 
# 2016
the instrument of multic an arrai of measur tool devis
to aid in the implement of a prototyp comput util
is discuss these tool includ special hardwar clock and data
channel gener purpos program probe and record tool and special
measur facil some particular measur of interest in a system
which combin demand page with multiprogram ar describ in detail
where appropri insight into effect or lack there of of
individu tool is provid cacm august 1970 gintel j w
saltzer j h instrument perform measur multiprogram system measur tool
system analysi multic meter event trace demand page script driven
measur 2 44 4 32 4 39 4 42 ca700805
jb februari 10 1978 3 43 pm 2016 5 2016
2016 5 2016 2016 5 2016 2193 5 2016 2319
5 2016 2894 5 2016 1408 6 2016 1719 6
2016 1749 6 2016 1751 6 2016 1951 6 2016
2016 6 2016 2016 6 2016 2016 6 2016 2017
6 2016 2080 6 2016 2188 6 2016 2203 6
2016 2204 6 2016 3186 6 2016 
# 2017
sort in a page environ thi sort studi wa part
of an extens measur project undertaken on the m44 44x
an experiment page system which wa conceiv and implement at
ibm research in order to explor the virtual machin concept
the studi wa concern with the implement of sort procedur
in the context of the dynam page environ characterist of
virtual memori machin descript of the experiment sort program and
analysi of the perform measur result obtain for them ar
present the insight gain from the experiment effort is us
to arriv at a set of broad guidelin for write
sort program for a page environ cacm august 1970 brawn
b s gustavson g mankin e s sort merg virtual
machin page system dynam storag alloc measur of system program
behavior perform evalu memori manag 4 32 4 49 4
9 5 31 ca700804 jb februari 10 1978 3 51
pm 1050 4 2017 1117 4 2017 1117 4 2017
1175 4 2017 1919 4 2017 1935 4 2017 1936
4 2017 1956 4 2017 2017 4 2017 2017 4
2017 2017 4 2017 2017 4 2017 2017 4 2017
2017 4 2017 2017 4 2017 2017 4 2017 2017
4 2017 2017 4 2017 2017 4 2017 2017 4
2017 2017 4 2017 2017 4 2017 2017 4 2017
2017 4 2017 2017 4 2017 2017 4 2017 2032
4 2017 2041 4 2017 2146 4 2017 2146 4
2017 2146 4 2017 2216 4 2017 2257 4 2017
2360 4 2017 2451 4 2017 2452 4 2017 677
4 2017 851 4 2017 851 4 2017 860 4
2017 861 4 2017 2017 5 2017 2017 5 2017
2017 5 2017 2319 5 2017 2582 5 2017 2669
5 2017 3054 5 2017 849 5 2017 850 5
2017 851 5 2017 852 5 2017 853 5 2017
854 5 2017 855 5 2017 856 5 2017 858
5 2017 857 5 2017 859 5 2017 860 5
2017 862 5 2017 863 5 2017 864 5 2017
865 5 2017 861 5 2017 866 5 2017 1175
6 2017 1408 6 2017 1719 6 2017 1749 6
2017 1751 6 2017 1751 6 2017 1751 6 2017
1880 6 2017 1901 6 2017 1919 6 2017 1924
6 2017 1969 6 2017 1980 6 2017 1997 6
2017 307 6 2017 308 6 2017 309 6 2017
2016 6 2017 2017 6 2017 2017 6 2017 2017
6 2017 2017 6 2017 2080 6 2017 2130 6
2017 2188 6 2017 2203 6 2017 2204 6 2017
2358 6 2017 2679 6 2017 776 6 2017 
# 2018
full tabl quadrat search for scatter storag the quadrat residu
search method for hash tabl avoid much of the cluster
experienc with a linear search method the simpl quadrat search
onli access half the tabl it ha been shown that
when the length of the tabl is a prime of
the form 4n 3 where n is an integ the
whole tabl mai be access by two quadrat search plu
a separ access for the origin entri point a search
method is present which is computation simpl ha all the
advantag of the quadrat search and yet access all the
tabl in on sweep cacm august 1970 dai a c
quadrat residu search method hash tabl scatter storag dictionari look
up quadrat search search hash hash code cluster collis 3
7 3 73 3 74 ca700803 jb februari 10 1978
3 57 pm 1676 4 2018 1682 4 2018 1728
4 2018 1860 4 2018 1860 4 2018 1973 4
2018 1973 4 2018 1973 4 2018 1992 4 2018
2018 4 2018 2018 4 2018 2018 4 2018 2032
4 2018 2033 4 2018 2033 4 2018 2107 4
2018 2107 4 2018 2109 4 2018 2109 4 2018
2203 4 2018 2203 4 2018 2203 4 2018 2251
4 2018 2251 4 2018 2251 4 2018 2359 4
2018 2524 4 2018 2543 4 2018 2543 4 2018
2543 4 2018 2552 4 2018 2559 4 2018 2573
4 2018 2770 4 2018 2770 4 2018 2974 4
2018 2991 4 2018 3053 4 2018 3053 4 2018
1785 5 2018 1786 5 2018 2018 5 2018 2018
5 2018 2018 5 2018 2109 5 2018 2251 5
2018 2573 5 2018 2770 5 2018 1785 6 2018
1786 6 2018 1786 6 2018 1786 6 2018 1869
6 2018 1973 6 2018 1973 6 2018 1992 6
2018 2018 6 2018 2018 6 2018 2018 6 2018
2107 6 2018 2107 6 2018 2109 6 2018 2109
6 2018 2673 6 2018 
# 2019
normal techniqu for hand print numer famili of pattern standard
techniqu base on geometr project is appli to a file
of digit hand print numer obtain from sale clerk the
principl involv transform a quadrilater specifi in term of the
convex hull of each pattern into a squar the amount
of overlap within each class of charact versu the amount
between class is us to evalu the degre of normal
achiev with respect to other publish method includ size and
shear normal through moment cacm august 1970 nagi g tuong
n pattern recognit charact recognit normal project transform central project
hand print charact handwrit linear transform size normal map pattern
preprocessor 3 63 5 14 ca700802 jb februari 10 1978
4 03 pm 2019 5 2019 2019 5 2019 2019
5 2019 
# 2020
the alloc of comput resourc is price the answer the
widespread us of complex third gener comput system ha led
to a much broader concern about the mean by which
the resourc of these system ar alloc among the user
commun on mean that is suggest more and more frequent
is a price procedur in thi paper the manner in
which on would like to alloc comput resourc is consid
and then the extent to which a price mechan fit
thi mold is discuss inasmuch as price must serv as
a ration mechan at time consider is given to the
mean by which price can be adjust flexibl in order
to make a dynam alloc of resourc consider is also
given to the mean by which user can be insul
from the harm effect of frequent price fluctuat although the
subject of price ha been given a lot of attent
recent a number of misconcept persist about it purpos and
it oper an attempt is made to clarifi some of
these misunderstand and to highlight the advantag and disadvantag and
to highlight the advantag and disadvantag of price two illustr
price system ar also discuss in order to demonstr the
applic of price in quit differ environ cacm august 1970
nielsen n r alloc mechan charg comput price cost flexibl
price price prioriti charg resourc alloc user motiv 1 3
2 4 ca700801 jb februari 10 1978 4 13 pm
2020 4 2020 1735 5 2020 2020 5 2020 2020
5 2020 2020 5 2020 2479 5 2020 2020 6
2020 
# 2021
a comment on axiomat approach to program cacm juli 1970
hunt b axiomat method proof of program homomorph structur in
program 4 0 4 21 4 22 5 20 5
21 5 23 5 24 ca700716 jb februari 10 1978
4 15 pm 2021 4 2021 2222 4 2021 2227
4 2021 2315 4 2021 2326 4 2021 2470 4
2021 2732 4 2021 2865 4 2021 2896 4 2021
2943 4 2021 3014 4 2021 3068 4 2021 3077
4 2021 3143 4 2021 1834 5 2021 2021 5
2021 2021 5 2021 2021 5 2021 
# 2022
note on an anomali in page cacm juli 1970 pomeranz
j e page machin demand page replac algorithm 4 30
ca700715 jb februari 10 1978 4 17 pm 2022 4
2022 2085 4 2022 3006 4 2022 1884 5 2022
2022 5 2022 2022 5 2022 2022 5 2022 
# 2023
a note on data base deadlock cacm juli 1970 baecker
h d data base synchron lock deadlock refer count 3
73 ca700714 jb februari 10 1978 4 18 pm 1050
4 2023 1393 4 2023 1549 4 2023 2023 4
2023 2023 4 2023 2168 4 2023 3112 4 2023
627 4 2023 106 5 2023 1878 5 2023 2023
5 2023 2023 5 2023 2023 5 2023 
# 2024
comment on a paper by low cacm juli 1970 sattlei
k millstein r automat segment program connect 5 24 5
32 ca700713 jb februari 10 1978 4 20 pm 2024
5 2024 2024 5 2024 2024 5 2024 
# 2025
student s t distribut jacobi polynomi modifi romberg quadratur factori
analysi of varianc algorithm 332 344 351 359 cacm juli
1970 sale a h j fortran standard 4 0 4
22 ca700712 jb februari 10 1978 4 26 pm 1613
4 2025 1646 4 2025 1900 4 2025 1955 4
2025 2025 4 2025 2154 4 2025 2365 4 2025
2506 4 2025 3060 4 2025 987 5 2025 2025
5 2025 2025 5 2025 2025 5 2025 
# 2026
exponenti integr algorithm 385 s13 cacm juli 1970 ng e
w ca700711 jb februari 10 1978 4 27 pm 2026
5 2026 2026 5 2026 2026 5 2026 
# 2027
ricatti bessel function of first and second kind algorithm 22
s17 cacm juli 1970 brai t ricatti bessel function bessel
function of fraction order spheric bessel function 5 12 ca700710
jb februari 10 1978 4 29 pm 2027 5 2027
2027 5 2027 2027 5 2027 
# 2028
greatest common divisor of n integ and multipli a1 algorithm
386 cacm juli 1970 bradlei g h greatest common divisor
euclidean algorithm number theori diophantin equat 3 15 5 10
ca700709 jb februari 10 1978 4 31 pm 2028 4
2028 2521 4 2028 3099 4 2028 2028 5 2028
2028 5 2028 2028 5 2028 2031 5 2028 2521
5 2028 2028 6 2028 2031 6 2028 3135 6
2028 
# 2029
exponenti integr s13 algorithm 385 cacm juli 1970 paciorek k
a exponenti integr special function ration chebyshev approxim 5 12
ca700708 jb februari 10 1978 4 34 pm 2029 5
2029 2029 5 2029 2029 5 2029 
# 2030
context sensit pars thi paper present a canon form for
context sensit deriv and a pars algorithm which find each
context sensit analysi onc and onli onc the amount of
memori requir by the algorithm is essenti no more than
the requir to store a singl complet deriv in addit
a modifi version of the basic algorithm is present which
block infinit analys for grammar which contain loop the algorithm
is also compar with sever previou parser for context sensit
grammar and gener rewrit system and the differ between the
two type of analys is discuss the algorithm appear to
be complementari to an algorithm by s kuno in sever
respect includ the space time trade off and the degre
of context depend involv cacm juli 1970 wood w a
context sensit grammar context sensit pars formal grammar formal languag
theori pars pars algorithm recognit algorithm 3 42 5 22
5 23 ca700707 jb februari 10 1978 4 43 pm
2030 5 2030 2030 5 2030 2030 5 2030 
# 2031
algorithm and bound for the greatest common divisor of n
integ a new version of the euclidean algorithm for find
the greatest common divisor of n integ a i and
multipli x i such that gcd x 1 a 1
x n a n is present the number of arithmet
oper and the number of storag locat ar linear in
n a theorem of lame that give a bound for
the number of iter of the euclidean algorithm for two
integ is extend to the case of n integ an
algorithm to construct a minim set of multipli is present
a fortran program for the algorithm appear as comm acm
algorithm 386 cacm juli 1970 bradlei g h greatest common
divisor euclidean algorithm number theori diophantin equat 3 15 5
10 ca700706 jb februari 13 1978 8 45 am 2031
4 2031 2031 4 2031 1022 5 2031 2028 5
2031 2031 5 2031 2031 5 2031 2031 5 2031
2521 5 2031 450 5 2031 3099 5 2031 1313
6 2031 2028 6 2031 2031 6 2031 2031 6
2031 2031 6 2031 3135 6 2031 
# 2032
file structur us hash function a gener method of file
structur is propos which us a hash function to defin
tree structur two type of such tree ar examin and
their relat to tree studi in the past is explainedesult
for the probabl distribut of path length ar deriv and
illustr cacm juli 1970 coffman jr e g ev j
data structur tree structur file structur scatter tabl hash function
inform retriev 3 70 3 74 ca700705 jb februari 13
1978 8 49 am 1050 4 2032 1676 4 2032
1682 4 2032 1728 4 2032 1860 4 2032 1935
4 2032 1936 4 2032 1973 4 2032 2017 4
2032 2018 4 2032 2032 4 2032 2032 4 2032
2033 4 2032 2107 4 2032 2109 4 2032 2203
4 2032 2251 4 2032 2257 4 2032 2360 4
2032 2359 4 2032 2451 4 2032 2452 4 2032
2524 4 2032 2543 4 2032 2552 4 2032 2559
4 2032 2991 4 2032 3053 4 2032 1785 5
2032 2032 5 2032 2032 5 2032 2032 5 2032
849 5 2032 
# 2033
space time trade off in hash code with allow error
in thi paper trade off among certain comput factor a
given set of messag two new hash code method ar
examin and compar with a particular convent hash code method
the comput factor consid ar the size of the hash
area space the time requir to identifi a messag as
a nonmemb of the given set reject time and an
allow error frequenc the new method ar intend to reduc
the amount of space requir to contain the hash code
inform from that associ with convent method the reduct in
space is accomplish by exploit the possibl that a small
fraction of error of commiss mai be toler in some
applic in particular applic in which a larg amount of
data is involv and a core resid hash area is
consequ not feasibl us convent method in such applic it
is envisag that overal perform could be improv by us
a smaller core resid hash area in conjunct with the
new method and when necessari by us some secondari and
perhap time consum test to catch the small fraction of
error associ with new method an exampl is discuss which
illustr possibl area of applic for the new method analysi
of the paradigm problem demonstr that allow a small number
of test messag to be fals identifi as member of
the given set will permit a much smaller hash area
to be us without increas reject time cacm juli 1970
bloom b h hash code hash address scatter storag search
storag layout retriev trade off retriev effici storag effici 3
73 3 74 3 79 ca700704 jb februari 13 1978
9 18 am 1676 4 2033 1682 4 2033 1728
4 2033 1860 4 2033 1860 4 2033 1973 4
2033 1973 4 2033 1992 4 2033 2018 4 2033
2018 4 2033 2032 4 2033 2033 4 2033 2033
4 2033 2033 4 2033 2107 4 2033 2107 4
2033 2109 4 2033 2109 4 2033 2203 4 2033
2203 4 2033 2251 4 2033 2251 4 2033 2359
4 2033 2524 4 2033 2543 4 2033 2543 4
2033 2552 4 2033 2559 4 2033 2573 4 2033
2770 4 2033 2991 4 2033 3053 4 2033 1314
5 2033 1785 5 2033 1786 5 2033 2033 5
2033 2033 5 2033 2033 5 2033 3001 5 2033
2033 6 2033 2139 6 2033 
# 2034
the mobil program system stage2 stage2 is the second level
of a bootstrap sequenc which is easili implement on ani
comput it is a flexibl provid by stage2 ar summar
and the implement techniqu which have made it possibl to
have stage2 run on a new machin with less than
on man week of effort ar discuss the approach ha
been success on over 15 machin of wide vari characterist
cacm juli 1970 wait w m bootstrap macro process machin
independ program languag implement techniqu 4 12 4 22 ca700703
jb februari 13 1978 9 24 am 1160 4 2034
1530 4 2034 1705 4 2034 1781 4 2034 1807
4 2034 1852 4 2034 1945 4 2034 2034 4
2034 2034 4 2034 2034 4 2034 2034 4 2034
2034 4 2034 2034 4 2034 2290 4 2034 2579
4 2034 2923 4 2034 2945 4 2034 984 5
2034 1231 5 2034 1565 5 2034 1852 5 2034
1926 5 2034 1947 5 2034 2034 5 2034 2034
5 2034 2034 5 2034 
# 2035
convers access to a 2048 word machin lap6 is an
on line system run on a 2048 word linc which
provid full facil for text edit automat file and file
mainten and program prepar and assembl it focus on the
prepar and edit of continu displai 23 040 charact text
string manuscript which can be posit anywher by the user
and edit by simpli ad and delet line as though
work directli on an elast scroll other featur ar avail
through a uniform command set which itself can be augment
by the user the machin although small aid program design
by provid displai scope and premark randomli address linc tape
as standard item in an environ similar to that of
a sophist termin the tape ar logic similar to a
disk prioriti wa given to the design of effici tape
algorithm to minim the limit of the small memori techniqu
develop for handl scroll edit file and the layer system
structur ar outlin lap6 is us by about 2000 peopl
in 11 countri it design wa strongli influenc by perform
criteria establish in interview held with linc user themselv dure
the specif period cacm juli 1970 wilk m a convers
comput access displai edit displai orient system file algorithm lap6
layer linc man machin commun on line edit on line
effici on line environ scroll edit small machin system tape
file tape orient system text edit 3 73 4 10
4 11 4 19 4 22 4 30 4 40
4 41 ca700702 jb februari 13 1978 9 35 am
2035 5 2035 2035 5 2035 2035 5 2035 2357
5 2035 1523 6 2035 1829 6 2035 2035 6
2035 
# 2036
an interact command gener facil a facil to permit conversation
control task to be execut in a noninteract environ is
propos a mean by which program can gener interact time
share command and receiv the correspond output respons is present
the command will be invok as if thei had been
type at a consol keyboard it is argu that thi
facil will help overcom some of the current limit in
man comput commun a set of function to accomplish the
abov which could be embed into ani string process languag
is suggest and necessari inform pertin to implement of the
facil on exist time share system is given cacm juli
1970 grant c a time share command languag pseudo teletyp
interact condit job control oper system 3 80 3 81
4 29 4 39 ca700701 jb februari 13 1978 9
43 am 1530 4 2036 1531 4 2036 1565 4
2036 1703 4 2036 1945 4 2036 2036 4 2036
1455 5 2036 2036 5 2036 2036 5 2036 2036
5 2036 
# 2037
permut of a set with repetit algorithm 383 g6 cacm
june 1970 chase p j permut and combin permut 5
39 ca700618 jb februari 13 1978 9 45 am 2037
5 2037 2037 5 2037 2037 5 2037 
# 2038
combin of m out of n object algorithm 382 g6
cacm june 1970 chase p j permut and combin permut
5 39 ca700617 jb februari 13 1978 9 59 am
2038 5 2038 2038 5 2038 2038 5 2038 
# 2039
perman function of a squar matrix i and ii algorithm
361 g6 cacm june 1970 shriver b eberlein p j
dixon r d matrix perman determin 5 30 ca700616 jb
februari 13 1978 10 01 am 2039 5 2039 2039
5 2039 2039 5 2039 
# 2040
modifi romberg quadratur algorithm 351 d1 cacm june 1970 wallick
g c numer integr romberg quadratur modifi romberg quadratur trapezoid
valu rectangl valu 5 16 ca700615 jb februari 13 1978
10 27 am 1040 4 2040 1352 4 2040 1352
4 2040 1352 4 2040 1352 4 2040 1356 4
2040 1883 4 2040 1982 4 2040 1982 4 2040
2040 4 2040 2040 4 2040 2040 4 2040 2040
4 2040 2040 4 2040 2040 4 2040 1241 5
2040 1273 5 2040 1352 5 2040 1356 5 2040
324 5 2040 2040 5 2040 2040 5 2040 2040
5 2040 2355 5 2040 621 5 2040 1418 6
2040 1521 6 2040 1597 6 2040 1883 6 2040
2040 6 2040 2350 6 2040 2354 6 2040 
# 2041
shellsort algorithm 201 m1 cacm june 1970 chandler j p
harrison w c sort minim storag sort digit comput sort
5 31 ca700614 jb februari 13 1978 10 29 am
1175 4 2041 1919 4 2041 2017 4 2041 2041
4 2041 2216 4 2041 2041 5 2041 2041 5
2041 2041 5 2041 864 5 2041 
# 2042
treesort 3 algorithm 245 m1 the certif of an algorithm
can take the form of a proof that the algorithm
is correct as an illustr but practic exampl algorithm 245
treesort 3 for sort an arrai is prove correct cacm
june 1970 london r l proof of algorithm debug certif
metatheori sort in place sort 4 42 4 49 5
24 5 31 ca700613 jb februari 13 1978 10 32
am 2042 4 2042 2042 4 2042 2222 4 2042
2356 4 2042 2679 4 2042 2679 4 2042 2844
4 2042 2972 4 2042 970 5 2042 1228 5
2042 2042 5 2042 2042 5 2042 2042 5 2042
2222 5 2042 2679 5 2042 970 6 2042 970
6 2042 1175 6 2042 1190 6 2042 1228 6
2042 1800 6 2042 1818 6 2042 1834 6 2042
1969 6 2042 1997 6 2042 308 6 2042 2042
6 2042 2042 6 2042 3187 6 2042 507 6
2042 716 6 2042 783 6 2042 
# 2043
eigenvalu and eigenvector of a real symmetr matrix f2 algorithm
384 cacm june 1970 stewart g w real symmetr matrix
eigenvalu eigenvector qr algorithm 5 14 ca700612 jb februari 13
1978 10 34 am 2043 5 2043 2043 5 2043
2043 5 2043 2349 5 2043 1648 6 2043 1716
6 2043 1794 6 2043 1894 6 2043 2043 6
2043 501 6 2043 613 6 2043 774 6 2043
# 2044
permut of a set with repetit algorithm 383 g6 cacm
june 1970 chase p j permut and combin permut 5
39 ca700611 jb februari 13 1978 10 36 am 2044
4 2044 2044 4 2044 2044 4 2044 2044 4
2044 2189 4 2044 2417 4 2044 2505 4 2044
2874 4 2044 2908 4 2044 996 5 2044 1558
5 2044 2044 5 2044 2044 5 2044 2044 5
2044 2230 5 2044 521 5 2044 
# 2045
combin of m out of n object algorithm 382 g6
cacm june 1970 chase p j permut and combin permut
5 39 ca700610 jb februari 13 1978 10 38 am
2045 5 2045 2045 5 2045 2045 5 2045 2466
5 2045 2834 5 2045 3115 5 2045 907 6
2045 969 6 2045 2045 6 2045 2045 6 2045
2045 6 2045 2417 6 2045 2417 6 2045 2466
6 2045 2466 6 2045 2884 6 2045 579 6
2045 785 6 2045 
# 2046
a relat model of data for larg share data bank
futur user of larg data bank must be protect from
have to know how the data is organ in the
machin the intern represent a prompt servic which suppli such
inform is not a satisfactori solut activ of user at
termin and most applic program should remain unaffect when the
intern represent of data is chang and even when some
aspect of the extern represent ar chang chang in data
represent will often be need as a result of chang
in queri updat and report traffic and natur growth in
the type of store inform exist noninferenti format data system
provid user with tree structur file or slightli more gener
network model of the data in section 1 inadequaci of
these model ar discuss a model base on n ari
relat a normal form for data base relat and the
concept of a univers form for data base relat and
the concept of a univers data sublanguag ar introduc in
section 2 certain oper on relat other than logic infer
ar discuss and appli to the problem of redund and
consist in the user s model cacm june 1970 codd
e f data bank data base data structur data organ
hierarchi of data network of data relat deriv redund consist
composit join retriev languag predic calculu secur data integr 3
70 3 73 3 75 4 20 4 22 4
29 ca700609 jb februari 13 1978 10 57 am 2046
4 2046 2710 4 2046 1515 5 2046 2046 5
2046 2046 5 2046 2046 5 2046 2155 5 2046
2406 5 2046 2710 5 2046 2715 5 2046 2716
5 2046 2717 5 2046 2718 5 2046 2765 5
2046 2817 5 2046 2888 5 2046 2901 5 2046
2957 5 2046 2959 5 2046 2965 5 2046 3087
5 2046 3154 5 2046 1389 6 2046 1515 6
2046 210 6 2046 1936 6 2046 1976 6 2046
1976 6 2046 1989 6 2046 378 6 2046 2046
6 2046 2046 6 2046 2046 6 2046 2046 6
2046 2046 6 2046 2046 6 2046 2046 6 2046
2046 6 2046 2046 6 2046 2046 6 2046 2046
6 2046 2046 6 2046 2046 6 2046 2046 6
2046 2046 6 2046 2046 6 2046 2060 6 2046
2110 6 2046 2406 6 2046 2451 6 2046 2451
6 2046 2452 6 2046 2715 6 2046 2715 6
2046 2715 6 2046 3133 6 2046 616 6 2046
616 6 2046 616 6 2046 
# 2047
incorpor origin shift into the qr algorithm for symmetr tridiagon
matric the qr iter for the eigenvalu of a symmetr
tridiagon matrix can be acceler by incorpor a sequenc of
origin shift the origin shift mai be either subtract directli
from the diagon element of the matrix or incorpor by
mean of an implicit algorithm both method have drawback the
direct method can unnecessarili degrad small eigenvalu while the implicit
method can effect loos the shift and therebi retard the
converg thi paper present a new method which ha neither
drawback cacm june 1970 stewart g w eigenvalu eigenvector qr
method origin shift symmetr tridiagon matrix 5 14 ca700608 jb
februari 13 1978 11 02 am 2047 5 2047 2047
5 2047 2047 5 2047 
# 2048
comparison of sever adapt newton cote quadratur routin in evalu
definit integr with peak integrand thi report compar the perform
of five differ adapt quadratur scheme base on newton cote
2n 1 point rule n 1 2 3 4 5
in approxim the set of definit integr integr 1 x
2 p 2 dx with rel accuraci e cacm june
1970 hillstrom k e adapt newton cote quadratur quadratur scheme
comparison definit integr evalu adapt numer in tegrat newton cote
integr peak integrand integr quadratur effici plot new cote rule
applic newton cote rule modif 5 10 5 16 ca700607
jb februari 13 1978 11 08 am 1352 4 2048
1352 4 2048 1352 4 2048 2048 4 2048 2048
4 2048 2048 4 2048 2074 4 2048 2074 4
2048 2074 4 2048 2093 4 2048 2093 4 2048
2550 4 2048 2048 5 2048 2048 5 2048 2048
5 2048 429 5 2048 786 5 2048 834 5
2048 
# 2049
accur float point summat thi paper describ an altern method
for sum a set of float point number comparison of
the error bound for thi method with that of the
standard summat method show that it is consider less sensit
to propag of round off error cacm june 1970 linz
p summat float point addit round off error round off
propag 5 11 ca700606 jb februari 13 1978 11 36
am 2049 5 2049 2049 5 2049 2049 5 2049
2183 5 2049 2282 5 2049 1328 6 2049 2049
6 2049 2049 6 2049 
# 2050
automat pars for content analysi although automat syntact and semant
analysi is not yet possibl for all of an unrestrict
natur languag text some applic of which content analysi is
on do not have such a stringent coverag requir preliminari
studi show that the harvard syntact analyz can produc correct
and unambigu identif of the subject and object of certain
verb for approxim half of the relev occurr thi provid
a degre of coverag for content analysi variabl which compar
favor to manual method in variabl which compar favor to
manual method in which onli a sampl of the total
avail text is normal process cacm june 1970 damerau f
j content analysi pars syntact analysi natur languag process inform
retriev languag analysi text process 3 42 3 71 ca700605
jb februari 13 1978 11 43 am 1350 4 2050
1659 4 2050 1856 4 2050 2050 4 2050 1225
5 2050 2050 5 2050 2050 5 2050 2050 5
2050 
# 2051
a pl i program to assist the compar linguist a
practic pl i program is describ which can assist compar
linguist to determin the regular sound correspond between genet relat
languag the investig must arrang data for input by align
pair of suspect cognat the program tabul the correspond and
us list process techniqu to sort and count them each
pair of word is then assign a rel valu that
is a function of the total frequenc in the data
of each correspond found in that pair of word the
output is a list of all correspond type with their
frequenc of occurr in the data and a separ list
of each correspond with all word pair show that correspond
unless their rel valu is below an arbitrarili chosen cutoff
point the articl explain the us as well as the
limit of the program and illustr it us with a
small portion of hypothet data cacm june 1970 frantz d
g compar linguist natur languag process compar method histor linguist
diachron linguist genet relationship sound chang sound correspond regular correspond
list process 3 42 ca700604 jb februari 13 1978 11
51 am 2051 5 2051 2051 5 2051 2051 5
2051 
# 2052
schedul to reduc conflict in meet conflict in schedul can
be treat as defin an undirect linear graph independ of
the relat of the activ in conflict to addit constraint
of time and space each connect compon of such a
graph which can be found by an algorithm describ by
gotlieb and corneil correspond to a set of event that
must be schedul at differ time cacm june 1970 grime
j e alloc conflict matrix connect compon schedul span tree
undirect linear graph 1 90 3 51 3 59 5
32 ca700603 jb februari 13 1978 11 55 am 1609
4 2052 1847 4 2052 1961 4 2052 2052 4
2052 2052 4 2052 2052 4 2052 2052 4 2052
2209 4 2052 1008 5 2052 1013 5 2052 1504
5 2052 1540 5 2052 2052 5 2052 2052 5
2052 2052 5 2052 
# 2053
on the convers of decis tabl to comput program the
us of execut time diagnost in pinpoint ambigu in decis
tabl is discuss it is point out that ani attempt
at resolv ambigu at compil time will in gener be
imposs it is shown that as a consequ tree method
of convert decis tabl to program ar inadequ in regard
to ambigu detect two algorithm for program decis tabl whose
merit ar simplic of implement and detect of ambigu at
execut time ar present the first algorithm is for limit
entri decis tabl and clarifi the import of proper code
of the inform in the decis tabl the second algorithm
program a mix entri decis tabl directli without go through
the intermedi step of convers to a limit entri form
therebi result in storag economi a comparison of the algorithm
and other propos in the literatur is made some featur
of a decis tabl to fortran iv translat for the
ibm 7044 develop by the author ar given cacm june
1970 muthukrishnan c r rajaraman v decis tabl diagnost aid
system analysi busi applic 3 50 3 59 4 19
4 29 4 49 ca700602 jb februari 13 1978 12
03 pm 1354 4 2053 1354 4 2053 1354 4
2053 1488 4 2053 1488 4 2053 1684 4 2053
1994 4 2053 2053 4 2053 2053 4 2053 2053
4 2053 2053 4 2053 2053 4 2053 2220 4
2053 2220 4 2053 2220 4 2053 2220 4 2053
2273 4 2053 2273 4 2053 2273 4 2053 2273
4 2053 2453 4 2053 2453 4 2053 2517 4
2053 2518 4 2053 2598 4 2053 2616 4 2053
2726 4 2053 2726 4 2053 2726 4 2053 2856
4 2053 2856 4 2053 2856 4 2053 3034 4
2053 3113 4 2053 1172 5 2053 1237 5 2053
1327 5 2053 1354 5 2053 1684 5 2053 2053
5 2053 2053 5 2053 2053 5 2053 2221 5
2053 2273 5 2053 2453 5 2053 2517 5 2053
2856 5 2053 3034 5 2053 1172 6 2053 1172
6 2053 1172 6 2053 1237 6 2053 1327 6
2053 1327 6 2053 1354 6 2053 1354 6 2053
1354 6 2053 1684 6 2053 1684 6 2053 1683
6 2053 2053 6 2053 2053 6 2053 2053 6
2053 2053 6 2053 2053 6 2053 2053 6 2053
2220 6 2053 2220 6 2053 2220 6 2053 2221
6 2053 2453 6 2053 2517 6 2053 2598 6
2053 753 6 2053 
# 2054
on the feasibl of voic input to an on line
comput process system an on line digit comput process system
is consid in which an ordinari telephon is the complet
termin devic input to the comput be provid as a
sequenc of spoken word and output to the user be
audio respons from the machin the feasibl of implement such
a system with a fortran like algebra compil as the
object processor is consid detail of a specif word recognit
program ar given thi techniqu depend on three simplifi restrict
name a small vocabulari set known speaker and a moment
of silenc between each input word experiment result ar present
give error rate for differ experiment condit as well as
the machin resourc requir to accommod sever user at a
time the result show that at thi time it is
both econom and logic feasibl to handl at least 40
user at a time with an ibm 360 65 comput
cacm june 1970 elder h a speech recognit word recognit
pattern match pattern recognit time share remot access voic input
speech input telephon input output acoust signal spoken word input
talk to comput man machin interact 3 63 3 81
4 32 4 41 6 35 ca700601 jb februari 13
1978 12 12 pm 2054 4 2054 1544 5 2054
2054 5 2054 2054 5 2054 2054 5 2054 
# 2055
subroutin to perform in situ transposit of a rectangular matrix
algorithm 380 cacm mai 1970 lachenmai r rectangular matrix transpos
5 14 ca700511 jb februari 13 1978 1 14 pm
2055 5 2055 2055 5 2055 2055 5 2055 2057
5 2055 2392 5 2055 1600 6 2055 1600 6
2055 1894 6 2055 2055 6 2055 2055 6 2055
# 2056
gomori algorithm 263a h cacm mai 1970 proll l g
linear program integ variabl dual method 5 41 ca700510 jb
februari 13 1978 1 17 pm 2056 5 2056 2056
5 2056 2056 5 2056 
# 2057
random vector uniform in solid angl algorithm 381 g5 cacm
mai 1970 knop r e random number random vector random
number gener probabl distribut frequenc distribut simul mont carlo 5
5 ca700509 jb februari 13 1978 1 19 pm 2057
4 2057 2057 4 2057 2057 4 2057 2058 4
2057 2349 4 2057 2392 4 2057 2392 4 2057
2416 4 2057 1600 5 2057 1894 5 2057 2055
5 2057 2057 5 2057 2057 5 2057 2057 5
2057 
# 2058
in situ transposit of a rectangular matrix algorithm 380 f1
cacm mai 1970 laflin s brebner m a rectangular matrix
transpos 5 14 ca700508 jb februari 13 1978 1 21
pm 2057 4 2058 2058 4 2058 2392 4 2058
2416 4 2058 1600 5 2058 2058 5 2058 2058
5 2058 2058 5 2058 2416 5 2058 1600 6
2058 2058 6 2058 
# 2059
a languag for treat graph a languag for the represent
of graph is describ and the formul of graph oper
such as node and or link delet or insert union
intersect comparison and travers of graph is given graph ar
repres by link list the languag is syntact defin as
an extens to algol 60 and it is translat into
algol by mean of a syntax driven compil applic area
for thi languag ar oper research network problem control theori
traffic problem etc cacm mai 1970 crespi reghizzi s morpurgo
r graph orient nonori multipl color graph languag extend algol
oper preced syntax driven compil oper research network traffic 3
2 3 5 4 2 5 3 ca700507 jb februari
13 1978 1 31 pm 249 4 2059 254 4
2059 272 4 2059 1102 4 2059 1109 4 2059
1140 4 2059 1188 4 2059 1306 4 2059 1464
4 2059 1491 4 2059 1767 4 2059 1781 4
2059 1787 4 2059 1949 4 2059 321 4 2059
2059 4 2059 2126 4 2059 435 4 2059 437
4 2059 463 4 2059 483 4 2059 491 4
2059 2732 4 2059 560 4 2059 583 4 2059
3073 4 2059 627 4 2059 631 4 2059 632
4 2059 642 4 2059 644 4 2059 653 4
2059 680 4 2059 761 4 2059 762 4 2059
763 4 2059 123 4 2059 140 4 2059 919
4 2059 989 4 2059 196 5 2059 2059 5
2059 2059 5 2059 2059 5 2059 2178 5 2059
1303 6 2059 1323 6 2059 2059 6 2059 2127
6 2059 3184 6 2059 
# 2060
gedanken a simpl typeless languag base on the principl of
complet and the refer concept gedanken is an experiment program
languag with the follow characterist 1 ani valu which is
permit in some context of the languag is permiss in
ani other meaning context in particular function and label ar
permiss result of function and valu of variabl 2 assign
and indirect address ar formal by introduc valu call refer
which in turn possess other valu the assign oper alwai
affect the relat between some refer and it valu 3
all compound data structur ar treat as function 4 type
declar ar not permit the function approach to data structur
and the us of refer insur that ani process which
accept some data structur will accept ani logic equival structur
regardless of it intern represent more gener ani data structur
mai be implicit i e it mai be specifi by
give an arbitrari algorithm for comput or access it compon
the exist of label variabl permit the construct of coroutin
quasi parallel process and other unorthodox control mechan a varieti
of program exampl illustr the gener of the languag limit
and possibl extens ar discuss briefli cacm mai 1970 reynold
j c program languag data structur refer assign coroutin quasi
parallel process typeless languag applic languag lambda calculu list process
nondeterminist algorithm 4 20 4 22 5 23 5 24
ca700506 jb februari 13 1978 1 43 pm 1024 4
2060 1051 4 2060 1102 4 2060 1132 4 2060
1379 4 2060 1380 4 2060 1390 4 2060 1486
4 2060 1541 4 2060 1542 4 2060 1549 4
2060 1552 4 2060 1683 4 2060 1693 4 2060
1693 4 2060 1693 4 2060 1706 4 2060 1781
4 2060 1781 4 2060 1781 4 2060 1787 4
2060 1826 4 2060 1836 4 2060 1836 4 2060
1846 4 2060 1854 4 2060 1860 4 2060 1878
4 2060 1945 4 2060 1945 4 2060 1989 4
2060 378 4 2060 2015 4 2060 2060 4 2060
2060 4 2060 2060 4 2060 2060 4 2060 2060
4 2060 2060 4 2060 2060 4 2060 2060 4
2060 2061 4 2060 2061 4 2060 2082 4 2060
2091 4 2060 2091 4 2060 2155 4 2060 2152
4 2060 2168 4 2060 2179 4 2060 2179 4
2060 2179 4 2060 2218 4 2060 2294 4 2060
2340 4 2060 2356 4 2060 2470 4 2060 2546
4 2060 2546 4 2060 2603 4 2060 2698 4
2060 2698 4 2060 2698 4 2060 2708 4 2060
2708 4 2060 2719 4 2060 2723 4 2060 2770
4 2060 2824 4 2060 2838 4 2060 2842 4
2060 2855 4 2060 2879 4 2060 2921 4 2060
2982 4 2060 2986 4 2060 557 4 2060 3045
4 2060 3045 4 2060 3077 4 2060 3080 4
2060 3093 4 2060 3106 4 2060 3112 4 2060
3124 4 2060 3154 4 2060 627 4 2060 106
4 2060 210 5 2060 1380 5 2060 1421 5
2060 1469 5 2060 1477 5 2060 1491 5 2060
1869 5 2060 2060 5 2060 2060 5 2060 2060
5 2060 2110 5 2060 2155 5 2060 2294 5
2060 2558 5 2060 2842 5 2060 3077 5 2060
3150 5 2060 1389 6 2060 1469 6 2060 1471
6 2060 210 6 2060 210 6 2060 210 6
2060 1834 6 2060 378 6 2060 2046 6 2060
2060 6 2060 2060 6 2060 2060 6 2060 2060
6 2060 2060 6 2060 2060 6 2060 2148 6
2060 2192 6 2060 2457 6 2060 2704 6 2060
2842 6 2060 2939 6 2060 2940 6 2060 2941
6 2060 2943 6 2060 3073 6 2060 3148 6
2060 3184 6 2060 
# 2061
an algorithm for the construct of bound context parser an
algorithm is describ which accept an arbitrari context free grammar
and construct a bound context parser for it whenev such
a parser exist in the first part of the paper
the definit of a context free grammar and the work
of a bound context parser ar recal the notion of
reduct class for a context free grammar is then introduc
and it connect with the structur of a bound context
parser is indic next pushdown automata which gener the differ
reduct class of a context free grammar ar defin final
the algorithm is describ it essenti carri out an exhaust
studi of all possibl run of the pushdown automata gener
the reduct class in the second part the util of
the algorithm is discuss ed in the light of the
experi gain from it us in compil design the algorithm
is claim to be particularli us in the simultan design
of a languag and a compil for it cacm mai
1970 loeckx j bound context pars bound context syntact analysi
parser construct syntact analyz construct gener compil compil compil write
system translat write system metacompil context free grammar formal languag
pushdown automata 4 12 5 22 5 23 ca700505 jb
februari 13 1978 1 58 pm 1379 4 2061 1491
4 2061 1496 4 2061 1542 4 2061 1683 4
2061 1683 4 2061 1693 4 2061 1693 4 2061
1768 4 2061 1781 4 2061 1781 4 2061 1781
4 2061 1787 4 2061 1787 4 2061 1836 4
2061 1836 4 2061 1945 4 2061 1945 4 2061
1945 4 2061 2015 4 2061 2060 4 2061 2060
4 2061 2061 4 2061 2061 4 2061 2061 4
2061 2061 4 2061 2061 4 2061 2061 4 2061
2082 4 2061 2091 4 2061 2091 4 2061 2152
4 2061 2179 4 2061 2179 4 2061 2179 4
2061 2340 4 2061 2356 4 2061 2546 4 2061
2546 4 2061 2603 4 2061 2698 4 2061 2698
4 2061 2708 4 2061 2708 4 2061 2824 4
2061 2982 4 2061 2986 4 2061 3045 4 2061
3045 4 2061 3093 4 2061 1140 5 2061 1141
5 2061 1477 5 2061 1491 5 2061 1825 5
2061 2061 5 2061 2061 5 2061 2061 5 2061
773 5 2061 
# 2062
the applic of sequenti sampl to simul an exampl inventori
model four differ sequenti sampl procedur ar appli to the
analysi of data gener by a comput simul experi with
a multi item inventori model for each procedur the cost
of comput time requir to achiev given level of statist
precis is calcul also the cost of comput time us
compar fix sampl size method is calcul the comput cost
of fix sampl size procedur versu sequenti sampl procedur ar
compar cacm mai 1970 sasser w e burdick d s
graham d a naylor t h simul inventori model sequenti
sampl model experiment design 3 31 3 50 3 54
5 5 ca700504 jb februari 13 1978 2 11 pm
2062 5 2062 2062 5 2062 2062 5 2062 
# 2063
translat equat errata cacm mai 1970 vere s ca700503 jb
februari 13 1978 2 12 pm 2063 5 2063 2063
5 2063 2063 5 2063 
# 2064
oper on gener arrai with the geni compil oper on
vector matric and higher dimension storag arrai ar standard featur
of most compil todai the element of such structur ar
usual restrict to be scalar for mani sophist applic thi
restrict can impos cumbersom data represent an effici system ha
been devis and implement which allow the element of multidimension
arrai to themselv be multidimension arrai thi system wa develop
from a storag structur in which the locat length and
content of each arrai is describ by a codeword which
can be interpret by the system code word mai describ
arrai contain more codeword thu provid all need descript inform
for hyperstructur of ani form cacm mai 1970 sitton g
a multidimension arrai matrix oper storag control subscript compil 4
12 4 29 ca700502 jb februari 13 1978 2 18
pm 2064 4 2064 1677 5 2064 2064 5 2064
2064 5 2064 2064 5 2064 
# 2065
a program system for the on line analysi of biomed
imag a preliminari descript of the softwar for a comput
displai system is given with special emphasi on the man
machin interact thi system is intend for a wide varieti
of biomed applic as an exampl the method ar appli
to the karyotyp of chromosom the system is separ into
four program task pictur transform file mainten pictur structur and
displai manag pictur structur is consid as the vehicl for
man machin commun a prototyp data format for pictur call
a pictur form is develop structur oper ar defin which
manipul pictur form to produc new pictur form mani of
the idea ar taken from the symbol mathemat laboratori at
mit conceiv by marvin minski cacm mai 1970 hode l
imag process biomed imag process on line imag process semiautomat
imag process data structur structur oper pictur process biomed pictur
process on line pictur process semiautomat pictur process semiautomat karyotyp
karyotyp list process pictur process 3 12 3 34 3
63 4 39 6 29 ca700501 jb februari 13 1978
2 27 pm 2065 5 2065 2065 5 2065 2065
5 2065 
# 2066
an algol construct for procedur as paramet of procedur cacm
april 1970 knight k r algol procedur paramet side effect
4 22 ca700418 jb februari 13 1978 2 30 pm
2066 4 2066 2066 4 2066 1833 5 2066 1842
5 2066 2066 5 2066 2066 5 2066 2066 5
2066 
# 2067
comment on lawler s multilevel boolean minim cacm april 1970
devri r c multilevel logic design gener prime implic minim
form minim incomplet specifi function 6 1 ca700417 jb februari
13 1978 2 32 pm 2067 5 2067 2067 5
2067 2067 5 2067 
# 2068
comment on multiprogram under a page on demand strategi cacm
april 1970 smith j l multiprogram page model 4 32
ca700416 jb februari 13 1978 2 34 pm 1892 4
2068 2068 4 2068 2741 4 2068 1526 5 2068
2068 5 2068 2068 5 2068 2068 5 2068 
# 2069
comment on a paper by wallac and mason cacm april
1970 heess jr w f page on demand demand page
time share multiprogram markovian comput model schedul strategi oper system
memori manag 2 44 4 32 4 39 6 20
6 21 ca700415 jb februari 13 1978 2 36 pm
2069 5 2069 2069 5 2069 2069 5 2069 
# 2070
a formal system for inform retriev from file cacm april
1970 hsiao d harari f ca700414 jb februari 13 1978
2 37 pm 2070 5 2070 2070 5 2070 2070
5 2070 
# 2071
filon quadratur algorithm 353 d1 cacm april 1970 fosdick l
d einarsson bo quadratur filon quadratur integr filon integr fourier
coeffici fourier seri 5 16 ca700413 jb februari 13 1978
2 40 pm 2071 5 2071 2071 5 2071 2071
5 2071 2393 5 2071 1858 6 2071 2071 6
2071 
# 2072
modifi romberg quadratur algorithm 351 d1 cacm april 1970 cook
n d numer integr romberg quadratur trapezoid valu rectangl valu
error bound 5 16 ca700412 jb februari 13 1978 2
42 pm 2072 5 2072 2072 5 2072 2072 5
2072 
# 2073
solut of linear program in 0 1 variabl by implicit
enumer algorithm 341 h cacm april 1970 guignard m m
linear program zero on variabl partial enumer 5 41 ca700411
jb februari 13 1978 2 43 pm 2073 5 2073
2073 5 2073 2073 5 2073 
# 2074
sqank algorithm 379 d1 cacm april 1970 lyness j n
numer integr integr rule adapt integr automat integr simpson s
rule numer quadratur quadratur quadratur rule adapt quadratur automat quadratur
round off error control 5 16 ca700410 jb februari 13
1978 2 46 pm 1352 4 2074 1352 4 2074
1352 4 2074 1352 4 2074 2048 4 2074 2048
4 2074 2048 4 2074 2074 4 2074 2074 4
2074 2074 4 2074 2074 4 2074 2093 4 2074
2093 4 2074 2093 4 2074 2550 4 2074 2074
5 2074 2074 5 2074 2074 5 2074 2415 5
2074 2550 5 2074 429 5 2074 786 5 2074
834 5 2074 872 5 2074 1040 6 2074 1573
6 2074 1982 6 2074 2074 6 2074 2074 6
2074 429 6 2074 
# 2075
discret newton like method for solv a system of simultan
nonlinear equat algorithm 378 c5 cacm april 1970 pankiewicz w
newton s method nonlinear equat interpol polynomi 5 15 5
13 ca700409 jb februari 13 1978 2 48 pm 2075
4 2075 2075 5 2075 2075 5 2075 2075 5
2075 472 5 2075 3011 5 2075 2075 6 2075
2302 6 2075 2345 6 2075 2485 6 2075 
# 2076
cubic spline on uniform mesh a veri simpl procedur is
present for construct cubic spline period or nonperiod on uniform
mesh arc of two cubic suffic to construct a basi
of cardin spline an algorithm is given which requir onli
minim storag and comput and permit easi trade off of
on against the other cacm april 1970 nilson e n
simpl spline represent cardin spline uniform mesh spline 5 13
ca700408 jb februari 13 1978 2 51 pm 2076 5
2076 2076 5 2076 2076 5 2076 
# 2077
the cyclic major problem the problem of the cyclic major
is present and some new simul result for 3 4
5 40 issu ad 3 5 7 37 judg ar
report cacm april 1970 pomeranz j e weil jr r
l arrow s paradox cyclic major simul voter s paradox
vote paradox 3 31 3 35 ca700407 jb februari 13
1978 2 58 pm 2077 5 2077 2077 5 2077
2077 5 2077 
# 2078
represent for space plan problem involv the arrang of object
in two or three space where the object function primarili
consist of deriv of the distanc between object or their
arrang ar call space plan problem the represent requir for
thi problem area ar defin and compar with current comput
graphic languag four altern data structur that allow autom space
plan ar describ and compar cacm april 1970 eastman c
m autom design data structur comput graphic comput aid design
engin design architectur design robot 3 20 3 2 2
3 26 3 41 3 63 ca700406 jb februari 13
1978 3 03 pm 2078 5 2078 2078 5 2078
2078 5 2078 2389 5 2078 2078 6 2078 
# 2079
on multiprogram machin code and comput organ cacm april 1970
wirth n ca700405 jb februari 13 1978 3 05 pm
2079 5 2079 2079 5 2079 2079 5 2079 
# 2080
the nucleu of a multiprogram system thi paper describ the
philosophi and structur of a multiprogram system that can be
extend with a hierarchi of oper system to suit divers
requir of program schedul and resourc alloc the system nucleu
simul an environ in which program execut and input output
ar handl uniformli as parallel cooper process es a fundament
set of primit allow the dynam creation and control of
a hierarchi of process as well as the commun among
them cacm april 1970 hansen p b multiprogram oper system
parallel process process concept process commun messag buffer process hierarchi
process creation process remov 4 30 4 31 4 32
4 41 ca700404 jb februari 13 1978 3 10 pm
1657 4 2080 2080 4 2080 2357 4 2080 2536
4 2080 1523 5 2080 2080 5 2080 2080 5
2080 2080 5 2080 2319 5 2080 2320 5 2080
2378 5 2080 2632 5 2080 2738 5 2080 2740
5 2080 2868 5 2080 3127 5 2080 1408 6
2080 1471 6 2080 1471 6 2080 1719 6 2080
1749 6 2080 1749 6 2080 1749 6 2080 1749
6 2080 1751 6 2080 1877 6 2080 2016 6
2080 2017 6 2080 2080 6 2080 2080 6 2080
2080 6 2080 2080 6 2080 2080 6 2080 2080
6 2080 2080 6 2080 2080 6 2080 2150 6
2080 2188 6 2080 2203 6 2080 2204 6 2080
2247 6 2080 2277 6 2080 2356 6 2080 2377
6 2080 2380 6 2080 2558 6 2080 2625 6
2080 2632 6 2080 2777 6 2080 
# 2081
some complet calculi for matric a matrix calculu is introduc
with the intent of develop data structur suitabl for a
high level algorithm languag for mathemat program the paper investig
how the special structur of matric can be describ and
util for effici comput by save memori space and superflu
oper sequenc of matric and sequenc of sequenc of matric
ar consid and matrix oper areext end to sequenc oper
and cumul oper algorithm ar given which us symbol manipul
of matrix express so as to find the form best
suit for comput these form ar call normal form sever
complet result ar obtain in the sens that for each
express an equival express in normal form can be found
within a specifi calculu cacm april 1970 bayer r witzgal
c complet calculu data structur linear program matrix matrix concaten
matrix sequenc program languag sequenc oper symbol manipul 4 12
4 22 5 14 5 41 ca700403 jb februari 13
1978 3 18 pm 2081 5 2081 2081 5 2081
2081 5 2081 2253 5 2081 2254 5 2081 2081
6 2081 2081 6 2081 437 6 2081 
# 2082
syntax direct document for pl 360 the languag pl 360
togeth with it phrase structur grammar is us as a
concret basi for illustr an idea call syntax direct document
thi idea is 1 to us the phrase structur of
a program to defin the structur of a formal document
for that program 2 to us the syntact type and
identifi in the result structur to trigger the automat format
of question to the programm whose answer will becom part
of that document and 3 to provid automat storag and
retriev facil so that other programm who want to understand
or modifi the program can access the result document which
is cross index in variou wai by syntact type and
object a small pl 360 program alreadi found in the
literatur is work out as an exampl cacm april 1970
mill h d document syntax analysi pl 360 enforc document
index document automat interrog phase structur grammar syntax direct document
syntax process 3 59 3 79 4 19 4 43
ca700402 jb februari 13 1978 3 28 pm 1542 4
2082 1683 4 2082 1693 4 2082 1781 4 2082
1787 4 2082 1836 4 2082 1945 4 2082 2060
4 2082 2061 4 2082 2082 4 2082 2082 4
2082 2091 4 2082 2152 4 2082 2179 4 2082
2340 4 2082 2356 4 2082 2546 4 2082 2603
4 2082 2698 4 2082 2708 4 2082 2824 4
2082 2982 4 2082 2986 4 2082 3045 4 2082
3093 4 2082 1491 5 2082 2082 5 2082 2082
5 2082 2082 5 2082 2314 5 2082 518 5
2082 1098 6 2082 1626 6 2082 2082 6 2082
2148 6 2082 
# 2083
creation and control of intern data base under a fortran
program environ a method is describ for the definit of
a user s common structur and the automat gener of
the necessari common dimens equival and type declar for each
of the user s routin the definit for the common
is contain in an easi to modifi form thu allow
the control of gener commun of data between routin the
describ system ha been implement on the ibm 7094 cdc
6000 seri and the ibm 360 the method ha prove
to be invalu for the definit and control of common
in mani larg scale program cacm april 1970 desalvio a
j purdi j g rau j data base fortran common
common equivalenc subroutin commun data commun 3 73 4 12
4 43 ca700401 jb februari 13 1978 3 34 pm
1086 4 2083 1132 4 2083 1234 4 2083 1263
4 2083 1265 4 2083 1270 4 2083 1323 4
2083 1358 4 2083 1379 4 2083 1380 4 2083
1453 4 2083 1464 4 2083 1484 4 2083 1491
4 2083 1498 4 2083 1613 4 2083 1614 4
2083 1781 4 2083 1825 4 2083 1845 4 2083
1860 4 2083 1900 4 2083 2083 4 2083 2083
4 2083 2154 4 2083 2178 4 2083 2179 4
2083 2252 4 2083 2270 4 2083 2325 4 2083
2341 4 2083 2546 4 2083 2645 4 2083 2652
4 2083 2684 4 2083 2693 4 2083 2842 4
2083 2929 4 2083 2934 4 2083 3069 4 2083
669 4 2083 679 4 2083 691 4 2083 761
4 2083 949 4 2083 989 4 2083 988 5
2083 2083 5 2083 2083 5 2083 2083 5 2083
3184 5 2083 
# 2084
a note on the complement of inher ambigu context free
languag cacm march 1970 maurer h a ambigu inher ambigu
complement context free languag chomski languag phrase structur languag product
system type 2 languag bound languag 5 22 5 24
ca700314 jb februari 13 1978 3 37 pm 2084 5
2084 2084 5 2084 2084 5 2084 
# 2085
comment on a page anomali cacm march 1970 dempster j
r h page machin demand page replac algorithm 4 30
ca700313 jb februari 13 1978 3 39 pm 1892 4
2085 1901 4 2085 2022 4 2085 2085 4 2085
2085 4 2085 2095 4 2085 2218 4 2085 2277
4 2085 2319 4 2085 2329 4 2085 2358 4
2085 2373 4 2085 2380 4 2085 2434 4 2085
2499 4 2085 2501 4 2085 2582 4 2085 2669
4 2085 2828 4 2085 2863 4 2085 2881 4
2085 2928 4 2085 2996 4 2085 3006 4 2085
3006 4 2085 3067 4 2085 1751 5 2085 1884
5 2085 2085 5 2085 2085 5 2085 2085 5
2085 
# 2086
anoth method of convert from hexadecim to decim cacm march
1970 kaila m v binari decim convers comput arithmet categori
ca700312 jb februari 13 1978 3 41 pm 2086 5
2086 2086 5 2086 2086 5 2086 
# 2087
a number system for the permut cacm march 1970 pager
d permut order number number system p number combinatori 4
49 5 39 ca700311 jb februari 13 1978 3 42
pm 2087 4 2087 2189 4 2087 3188 4 2087
1594 5 2087 2087 5 2087 2087 5 2087 2087
5 2087 2189 5 2087 1594 6 2087 2087 6
2087 3191 6 2087 521 6 2087 
# 2088
netflow algorithm 336 h cacm march 1970 brai t a
witzgal c capacit network linear program minimum cost flow network
flow out of kilter 5 32 5 41 ca700310 jb
februari 13 1978 3 44 pm 2088 5 2088 2088
5 2088 2088 5 2088 
# 2089
prime number algorithm 310 a1 cacm march 1970 rapp d
g scott l d prime number gener 5 0 ca700309
jb februari 13 1978 3 45 pm 2089 5 2089
2089 5 2089 2089 5 2089 
# 2090
symbol expans of algebra express algorithm 377 r2 cacm march
1970 levin m j algebra symbol algebra symbol multipl algebra
distribut algebra multipl distribut algorithm multipl algorithm product algorithm polynomi
distribut polynomi expans 3 10 3 17 3 20 4
13 4 90 ca700308 jb februari 13 1978 3 49
pm 2090 5 2090 2090 5 2090 2090 5 2090
# 2091
pdel a languag for partial differenti equat convent comput method
avail to solv continu system problem character by partial differenti
equat ar veri time consum and cumbersom a conveni easi
to learn and to us high level problem orient languag
to solv and studi partial differenti equat problem ha been
design a practic translat for the languag ha also been
design and a work version of it ha been construct
for a signific portion of the languag thi partial differenti
equat languag pdel is outlin and the highlight of the
translat ar briefli summar cacm march 1970 cardena a f
karplu w j problem orient or digit simul languag partial
differenti equat translat pl 1 preprocessor pl 1 finit differ
algorithm 3 1 3 2 4 22 5 17 ca700307
jb februari 13 1978 4 18 pm 1379 4 2091
1503 4 2091 1542 4 2091 1683 4 2091 1693
4 2091 1693 4 2091 1781 4 2091 1781 4
2091 1781 4 2091 1787 4 2091 1836 4 2091
1836 4 2091 1860 4 2091 1945 4 2091 1945
4 2091 2015 4 2091 2060 4 2091 2060 4
2091 2061 4 2091 2061 4 2091 2082 4 2091
2091 4 2091 2091 4 2091 2091 4 2091 2152
4 2091 2179 4 2091 2179 4 2091 2340 4
2091 2356 4 2091 2546 4 2091 2546 4 2091
2603 4 2091 2698 4 2091 2698 4 2091 2708
4 2091 2708 4 2091 2824 4 2091 2982 4
2091 2986 4 2091 3045 4 2091 3045 4 2091
3093 4 2091 1366 5 2091 1477 5 2091 1491
5 2091 2091 5 2091 2091 5 2091 2091 5
2091 
# 2092
a deduct question answer for natur languag infer the question
answer aspect of the protosynthex iii pro totyp languag process
system ar describ and exemplifi in detail the system is
written in lisp 1 5 and oper on the q
32 time share system the system s data structur and
their semant organ the deduct question answer formal of relat
properti and complex relat form oper and the question answer
procedur which emploi these featur in their oper ar all
describ and illustr exampl of the system s perform and
of the limit of it question answer capabl ar present
and discuss it is shown that the us of semant
inform in deduct question answer greatli facilit the process and
that a top down procedur which work from question to
answer enabl effect us to be made of thi inform
it is conclud that the develop of protosynthex iii into
a practic us system to work with larg data base
is possibl but will requir chang in both the data
structur and the algorithm us for question answer cacm march
1970 schwarcz r m burger j f simmon r f
question answer natur languag protosynthex iii lisp semant artifici intellig
comput linguist languag process fact retriev 3 42 3 61
ca700306 jb februari 13 1978 4 30 pm 2092 4
2092 2127 4 2092 1527 5 2092 2092 5 2092
2092 5 2092 2092 5 2092 2396 5 2092 1487
6 2092 1856 6 2092 2092 6 2092 2127 6
2092 
# 2093
a comparison of error improv estim for adapt trapezoid integr
variou simpl choic of error improv estim for the trapezoid
rule ar studi to demonstr a comparison procedur which is
rel independ of the profus of adapt search and stop
strategi comparison ar base on x r the inclus of
the noninteg power make thi more realist than the usual
polynomi base comparison behavior near the singular wa found to
be the domin factor and a new estim base on
a constant curvatur assumpt and parametr differ wa consid slightli
better than the other choic consid cacm march 1970 schweikert
d g adapt integr error improv estim trapezoid rule nonpolynomi
error criteria 5 16 ca700305 jb februari 13 1978 4
47 pm 1352 4 2093 1352 4 2093 1352 4
2093 1352 4 2093 2048 4 2093 2048 4 2093
2074 4 2093 2074 4 2093 2074 4 2093 2093
4 2093 2093 4 2093 2093 4 2093 2093 4
2093 2093 4 2093 2093 4 2093 2550 4 2093
2550 4 2093 1092 5 2093 1298 5 2093 1573
5 2093 2093 5 2093 2093 5 2093 2093 5
2093 429 5 2093 834 5 2093 872 5 2093
# 2094
on an algorithm for nonlinear minimax approxim certain nonlinear minimax
approxim problem ar character d by properti which permit the
applic of special algorithm mainli base on the exchang algorithm
of reme 1934 1935 for their solut in thi paper
the applic to problem of thi type of a gener
nonlinear algorithm due to osborn and watson 1969 is consid
exampl ar given to illustr that thi algorithm can give
satisfactori result and in particular can successfulli solv problem which
lead to difficulti with the more convent specialist method cacm
march 1970 watson g a minimax approxim nonlinear approxim linear
program 5 13 5 41 ca700304 jb februari 13 1978
4 52 pm 1932 4 2094 2094 4 2094 1566
5 2094 2094 5 2094 2094 5 2094 2094 5
2094 2352 5 2094 2353 5 2094 2094 6 2094
2094 6 2094 
# 2095
measur of segment size distribut of segment size measur under
routin oper con dition on a comput system which util
variabl size segment the burrough b5500 ar discuss the most
strike featur of the measur is the larg number of
small segment about 60 percent of the segment in us
contain less than 40 word although the result ar certainli
not instal independ and although thei ar particularli influenc by
featur of the b5500 algol system thei should be relev
to the design of new comput system especi with respect
to the organ of page scheme cacm march 1970 batson
a ju s wood d c storag alloc segment segment
size page size page resourc alloc memori alloc core util
4 32 6 2 6 34 6 9 ca700303 jb
februari 13 1978 4 58 pm 1879 4 2095 1884
4 2095 1892 4 2095 1892 4 2095 1901 4
2095 1901 4 2095 1924 4 2095 2085 4 2095
2095 4 2095 2095 4 2095 2095 4 2095 2095
4 2095 2218 4 2095 2218 4 2095 2218 4
2095 2277 4 2095 2277 4 2095 2297 4 2095
2297 4 2095 2319 4 2095 2329 4 2095 2358
4 2095 2365 4 2095 2373 4 2095 2374 4
2095 2380 4 2095 2434 4 2095 2499 4 2095
2498 4 2095 2501 4 2095 2526 4 2095 2582
4 2095 2596 4 2095 2667 4 2095 2668 4
2095 2669 4 2095 2734 4 2095 2828 4 2095
2862 4 2095 2863 4 2095 2863 4 2095 2881
4 2095 2902 4 2095 2911 4 2095 2928 4
2095 2996 4 2095 3000 4 2095 3006 4 2095
3067 4 2095 1728 5 2095 1751 5 2095 1754
5 2095 1879 5 2095 2095 5 2095 2095 5
2095 2095 5 2095 2218 5 2095 2734 5 2095
3000 5 2095 1380 6 2095 1572 6 2095 1728
6 2095 1751 6 2095 1752 6 2095 1810 6
2095 1879 6 2095 1879 6 2095 1879 6 2095
2095 6 2095 2095 6 2095 2095 6 2095 2864
6 2095 
# 2096
experi with the m n tree search program the m
n procedur is an improv to the mini max back
up procedur wide us in comput program for game plai
and other purpos it is base on the principl that
it is desir to have mani option when make decis
in the face of uncertainti the mini max procedur assign
to a max min node the valu of the highest
lowest valu successor to that node the m n procedur
assign to a max min node some function of the
m n highest lowest valu successor an m n procedur
wa written in lisp to plai the game of kalah
and it wa demonstr that the m n procedur is
significantli superior to the mini max procedur the statist signific
of import conclus is given sinc inform on statist signific
ha often been lack in paper on comput experi in
the artifici intellig field these experi can perhap serv as
a model for futur work cacm march 1970 slagl j
r dixon j k artifici intellig heurist program tree search
lisp kalah game plai decis theori mini max back up
procedur back up procedur 3 60 3 64 3 66
ca700302 jb februari 14 1978 8 34 am 1515 4
2096 2096 4 2096 2127 4 2096 2210 4 2096
1155 5 2096 2096 5 2096 2096 5 2096 2096
5 2096 2215 5 2096 2096 6 2096 
# 2097
a program to teach program the teach system wa develop
at mit to eas the cost and improv the result
of elementari instruct in program to the student teach offer
loos guid experi with a convers languag which wa design
with teach in mind faculti involv is minim a term
of experi with teach is discuss pedagog the system appear
to be success straightforward reimplement will make it econom success
as well similar program of profound tutori skill will appear
onli as the result of extend research the outlin of
hi research ar begin to becom clear cacm march 1970
fenichel r r weizenbaum j yochelson j c elementari program
comput assist learn uncl teach 1 52 ca700301 jb februari
14 1978 8 42 am 2097 5 2097 2097 5
2097 2097 5 2097 2153 5 2097 3003 5 2097
1659 6 2097 1678 6 2097 1927 6 2097 1945
6 2097 2097 6 2097 2097 6 2097 2147 6
2097 2163 6 2097 2187 6 2097 2329 6 2097
2345 6 2097 2367 6 2097 2407 6 2097 2478
6 2097 2479 6 2097 2480 6 2097 2538 6
2097 
# 2098
t test probabl algorithm 321 student s t distribut algorithm
344 cacm februari 1970 hill g w loughhead m t
test student s t statist distribut function approxim 5 12
5 5 ca700217 jb februari 14 1978 8 45 am
2098 5 2098 2098 5 2098 2098 5 2098 
# 2099
eigenvalu and eigen vector of a real gener matrix algorithm
343 f cacm februari 1970 knobl h d norm characterist
equat degener eigen system diagonaliz matrix defect matrix 5 14
ca700216 jb februari 14 1978 9 43 am 1876 4
2099 1968 4 2099 2099 4 2099 2099 4 2099
2335 4 2099 1662 5 2099 1707 5 2099 1968
5 2099 2099 5 2099 2099 5 2099 2099 5
2099 1662 6 2099 2099 6 2099 
# 2100
ortho algorithm 127 f5 cacm februari 1970 barrodal i orthogon
approxim 5 13 5 17 5 5 ca700215 jb februari
14 1978 9 45 am 2100 5 2100 2100 5
2100 2100 5 2100 
# 2101
least squar fit by f x aco bx c algorithm
376 e2 cacm februari 1970 spath h nonlinear least squar
fit 5 15 ca700214 jb februari 14 1978 9 47
am 2101 4 2101 2102 4 2101 1639 5 2101
2101 5 2101 2101 5 2101 2101 5 2101 
# 2102
fit data to on exponenti algorithm 375 e2 cacm februari
1970 spath h nonlinear least squar fit 5 15 ca700213
jb februari 14 1978 9 49 pm 2101 4 2102
2102 4 2102 1639 5 2102 2102 5 2102 2102
5 2102 2102 5 2102 
# 2103
restrict partit gener algorithm 374 a1 cacm februari 1970 white
j s partit restrict partit sum of integ restrict sum
5 39 ca700212 jb februari 14 1978 9 49 am
2103 4 2103 1218 5 2103 2103 5 2103 2103
5 2103 2103 5 2103 
# 2104
number of doubli restrict partit algorithm 373 a1 cacm februari
1970 white j s partit restrict partit sum of integ
restrict sum 5 39 ca700211 jb februari 14 1978 9
52 am 2104 4 2104 2489 4 2104 1219 5
2104 2104 5 2104 2104 5 2104 2104 5 2104
2489 5 2104 1219 6 2104 2104 6 2104 
# 2105
an interact comput system us graphic flowchart input an interact
comput system oper on a graphic comput termin is describ
thi system wa design to demonstr a method of program
by comput interpret of a flowchart the user draw a
descript of a sampl data system and specifi descript is
transmit to a larg scale comput the design is simul
and a graphic represent of the process signal is return
to the scope a success design mai requir numer modif
of the origin design a graphic interact system provid an
environ to perform thi iter process effici and effect cacm
februari 1970 robin m f beyer j d simul program
graphic input output sampl data system 3 20 3 24
ca700210 jb februari 14 1978 9 57 am 2003 5
2105 2105 5 2105 2105 5 2105 2105 5 2105
1710 6 2105 1767 6 2105 2105 6 2105 
# 2106
comput educ in a graduat school of manag sever year
of experi have led to the belief that the creativ
design and evalu of manag inform system requir a thorough
understand of the relat comput technolog concept such as page
and prioriti interrupt system can best be explain at the
machin languag level ani machin us for exposit should fulfil
sever criteria it should 1 rais as few spuriou issu
as possibl 2 allow without undu effort the solut of
interest problem 3 be capabl of expos all outstand issu
of signific capabl of expos all outstand issu of signific
within the chosen machin 4 be seful for pursu issu
in great depth when appropri 5 not be commit to
the equip provid by ani manufactur 6 be abl to
provid the student with diagnost aid to a great depth
7 allow the student readi access to the machin 8
be capabl of extens to expos new issu as thei
come along we have construct a simul machin and it
associ softwar which meet these criteria thi system call the
prism system is document by a primer and a refer
manual cacm februari 1970 ness d n green r s
martin w a moulton g a educ simul machin languag
manag inform system interpret 1 52 3 51 4 13
4 21 ca700209 jb februari 14 1978 10 15 am
2106 5 2106 2106 5 2106 2106 5 2106 
# 2107
the quadrat quotient method a hash code elimin secondari cluster
secondari cluster as a caus of hash code ineffici is
discuss and a new hash method base on it elimin
is present comparison with previou method ar made both analyt
and empir cacm februari 1970 bell j r hash hash
code scatter storag calcul address cluster search symbol tabl collis
kei tabl look up 3 74 4 9 ca700208 jb
februari 14 1978 10 18 am 1676 4 2107 1682
4 2107 1728 4 2107 1860 4 2107 1860 4
2107 1973 4 2107 1973 4 2107 1992 4 2107
2018 4 2107 2018 4 2107 2032 4 2107 2033
4 2107 2033 4 2107 2107 4 2107 2107 4
2107 2109 4 2107 2109 4 2107 2203 4 2107
2203 4 2107 2251 4 2107 2251 4 2107 2359
4 2107 2524 4 2107 2543 4 2107 2543 4
2107 2552 4 2107 2559 4 2107 2573 4 2107
2770 4 2107 2991 4 2107 3053 4 2107 1785
5 2107 1786 5 2107 1973 5 2107 1992 5
2107 2107 5 2107 2107 5 2107 2107 5 2107
2138 5 2107 2203 5 2107 2251 5 2107 2530
5 2107 2537 5 2107 2543 5 2107 2559 5
2107 2573 5 2107 2991 5 2107 3053 5 2107
3083 5 2107 911 6 2107 1328 6 2107 1329
6 2107 1785 6 2107 1785 6 2107 1785 6
2107 1785 6 2107 1785 6 2107 1785 6 2107
1785 6 2107 1786 6 2107 1786 6 2107 1786
6 2107 1786 6 2107 1786 6 2107 1786 6
2107 1973 6 2107 1973 6 2107 1973 6 2107
1973 6 2107 1973 6 2107 1992 6 2107 332
6 2107 2018 6 2107 2018 6 2107 2107 6
2107 2107 6 2107 2107 6 2107 2107 6 2107
2107 6 2107 2107 6 2107 2107 6 2107 2107
6 2107 2107 6 2107 2107 6 2107 2107 6
2107 2107 6 2107 2107 6 2107 2109 6 2107
2109 6 2107 2109 6 2107 2109 6 2107 2109
6 2107 2203 6 2107 2412 6 2107 2530 6
2107 2537 6 2107 2543 6 2107 2543 6 2107
2552 6 2107 2673 6 2107 2707 6 2107 2770
6 2107 492 6 2107 
# 2108
a variat on sort by address calcul the principl of
address calcul and merg ar combin to yield an effici
sort techniqu detail flowchart of the most import program step
ar includ the characterist of the propos sort ar discuss
cacm februari 1970 jone b sort address calcul merg order
sequenc creation 4 49 5 31 ca700207 jb februari 14
1978 10 24 am 2108 5 2108 2108 5 2108
2108 5 2108 
# 2109
the us of quadrat residu research a quadrat residu search
method ha previous been suggest to avoid the cluster usual
encount when hash address collis occur and linear search method
ar us the search size becaus of the properti of
quadrat residu is limit to on half of the storag
tabl it is shown that for some class of prime
number the complement of the set of quadrat residu can
easili be determin and henc the entir tabl of size
p where p is that prime number can be search
cacm februari 1970 radk c e quadrat residu search method
hash address address cluster scatter storag file search file address
hash code quadrat search random search storag layout search 3
7 3 73 3 74 ca700206 jb februari 14 1978
10 30 am 1676 4 2109 1682 4 2109 1728
4 2109 1860 4 2109 1860 4 2109 1973 4
2109 1973 4 2109 1992 4 2109 2018 4 2109
2018 4 2109 2032 4 2109 2033 4 2109 2033
4 2109 2107 4 2109 2107 4 2109 2109 4
2109 2109 4 2109 2203 4 2109 2203 4 2109
2251 4 2109 2251 4 2109 2359 4 2109 2524
4 2109 2543 4 2109 2543 4 2109 2552 4
2109 2559 4 2109 2573 4 2109 2770 4 2109
2991 4 2109 3053 4 2109 1785 5 2109 1786
5 2109 1973 5 2109 2018 5 2109 2109 5
2109 2109 5 2109 2109 5 2109 2203 5 2109
2251 5 2109 2543 5 2109 2770 5 2109 2974
5 2109 3053 5 2109 911 6 2109 1329 6
2109 1785 6 2109 1785 6 2109 1785 6 2109
1785 6 2109 1785 6 2109 1785 6 2109 1786
6 2109 1786 6 2109 1786 6 2109 1786 6
2109 1786 6 2109 1786 6 2109 1869 6 2109
1973 6 2109 1973 6 2109 1973 6 2109 1973
6 2109 1992 6 2109 1992 6 2109 332 6
2109 2018 6 2109 2018 6 2109 2107 6 2109
2107 6 2109 2107 6 2109 2107 6 2109 2107
6 2109 2109 6 2109 2109 6 2109 2109 6
2109 2109 6 2109 2109 6 2109 2109 6 2109
2109 6 2109 2109 6 2109 2251 6 2109 2412
6 2109 2543 6 2109 2673 6 2109 2673 6
2109 2707 6 2109 2770 6 2109 492 6 2109
# 2110
an effici context free pars algorithm a pars algorithm which
seem to be the most effici gener context free algorithm
known is describ it is similar to both knuth s
lr k algorithm and the familiar top down algorithm it
ha a time bound proport to n 3 where n
is the length of the string be pars in gener
it ha a n 2 bound for unambigu grammar and
it run in linear time on a larg class of
grammar which seem to includ most practic context free program
languag grammar in an empir comparison it appear to be
superior to the top down and bottom up algorithm studi
by griffith and petrick cacm februari 1970 earlei j syntax
analysi pars context free grammar compil comput complex 4 12
5 22 5 23 ca700205 jb februari 14 1978 10
35 am 1350 4 2110 1399 4 2110 1659 4
2110 1665 4 2110 1768 4 2110 1768 4 2110
1781 4 2110 1787 4 2110 1824 4 2110 1825
4 2110 1836 4 2110 1861 4 2110 1945 4
2110 2015 4 2110 2110 4 2110 2110 4 2110
2127 4 2110 2187 4 2110 2317 4 2110 2545
4 2110 2698 4 2110 2733 4 2110 3094 4
2110 1265 5 2110 1781 5 2110 1989 5 2110
2060 5 2110 2110 5 2110 2110 5 2110 2110
5 2110 2179 5 2110 2698 5 2110 2921 5
2110 3154 5 2110 1380 6 2110 1421 6 2110
1469 6 2110 1477 6 2110 1477 6 2110 1477
6 2110 1491 6 2110 1491 6 2110 1491 6
2110 1781 6 2110 1825 6 2110 210 6 2110
1869 6 2110 1989 6 2110 2015 6 2110 2046
6 2110 2110 6 2110 2110 6 2110 2110 6
2110 2110 6 2110 2110 6 2110 2110 6 2110
2556 6 2110 3133 6 2110 3184 6 2110 680
6 2110 799 6 2110 799 6 2110 
# 2111
spell correct in system program sever special techniqu ar shown
for effici incorpor spell correct algorithm in to compil and
oper system these includ the us of syntax and semant
inform the organ of restrict keyword and symbol tabl and
the consider of a limit class of spell error sampl
360 code for perform spell correct is present by us
system which perform spell correct the number of debug run
per program ha been decreas save both programm and machin
time cacm februari 1970 morgan h l spell correct error
correct debug compil oper system diagnost error detect misspel lexic
analysi system program 4 42 4 12 3 0 3
79 ca700204 jb februari 14 1978 10 40 am 1112
4 2111 1179 4 2111 1288 4 2111 1544 4
2111 1592 4 2111 1592 4 2111 1646 4 2111
2111 4 2111 2111 4 2111 2111 4 2111 2111
4 2111 2339 4 2111 2339 4 2111 2339 4
2111 2534 4 2111 2556 4 2111 440 4 2111
2650 4 2111 1112 5 2111 1592 5 2111 2111
5 2111 2111 5 2111 2111 5 2111 2534 5
2111 2556 5 2111 2650 5 2111 2708 5 2111
2887 5 2111 619 5 2111 830 5 2111 830
6 2111 830 6 2111 830 6 2111 1477 6
2111 1491 6 2111 1646 6 2111 1787 6 2111
1787 6 2111 1935 6 2111 1936 6 2111 1959
6 2111 1973 6 2111 2111 6 2111 2111 6
2111 2111 6 2111 2111 6 2111 2111 6 2111
2182 6 2111 2534 6 2111 2556 6 2111 576
6 2111 680 6 2111 680 6 2111 799 6
2111 
# 2112
translat equat input limit transduct express or translat equat ar
us to describ the syntax and left context sensit semant
for context free languag a formal procedur is given for
deriv from a set of translat equat the specif for
a pushdown translat the translat consist of meali form finit
state automata interact by mean of a pushdown stack within
the framework describ string recognit and pars mai be treat
as special case of the translat problem cacm februari 1970
vere s automata ture machin regular express transduct express context
free languag translat recogn pars meta compil pushdown transduc syntax
direct compil finit state automata 4 10 4 12 4
20 5 22 ca700203 jb februari 14 1978 10 49
am 1323 4 2112 1358 4 2112 1380 4 2112
1665 4 2112 1781 4 2112 1787 4 2112 1989
4 2112 2112 4 2112 2534 4 2112 2541 4
2112 2698 4 2112 2733 4 2112 2820 4 2112
3073 4 2112 3155 4 2112 2112 5 2112 2112
5 2112 2112 5 2112 799 5 2112 
# 2113
the multistor parser for hierarch syntact structur a syntact parser
is describ for hierarch concaten pattern that ar present to
the analyz in the form of linear string particular emphasi
is given to the system of signific address by mean
of which process time for larg scale match procedur can
be substanti reduc the descript make frequent us of exampl
taken from the fulli oper implement of the parser in
an experiment english sentenc analyz by structur an area of
the comput s central core storag in such a wai
that the individu locat of byte and bit come to
repres the data involv in the match procedur the shift
of inform is reduc to a minimum and the search
of list is elimin altogeth the match ar trace by
mean of binari mask and the state of singl bit
determin the oper flow of the procedur the method could
be implement with ani interpret grammar provid it can be
express by the function classif of the item compos the
input hierarch structur cacm februari 1970 von glasersfeld e pars
syntact analysi natur languag analysi linguist data process comput linguist
correl grammar structur recognit pattern recognit match procedur tree structur
interpret machin translat automat abstract 3 42 3 49 3
63 3 70 3 71 ca700202 jb februari 14 1978
12 57 pm 2113 5 2113 2113 5 2113 2113
5 2113 
# 2114
a formal system for inform retriev from file a gener
file structur is provid by which the concept of keyword
index record file directori file structur directori decod and record
retriev ar defin and from which some of the frequent
us file structur such as invert file index sequenti file
and multilist file ar deriv two algorithm which retriev record
from the gener file structur ar present cacm februari 1970
hsiao d attribut valu pair index keyword record record address
k pointer k list file directori gener file structur invert
file index sequenti file multilist file descript file search directori
search serial process of list prime keyword parallel process of
list 3 70 3 73 3 74 ca700201 jb februari
14 1978 1 04 pm 2114 5 2114 2114 5
2114 2114 5 2114 2160 5 2114 2688 5 2114
2114 6 2114 2114 6 2114 
# 2115
fortran tausworth pseudorandom number gener cacm januari 1970 payn w
h random number pseudorandom number shift regist sequenc 5 5
ca700116 jb februari 14 1978 1 06 pm 2115 4
2115 2115 4 2115 2122 4 2115 1691 5 2115
1930 5 2115 2115 5 2115 2115 5 2115 2115
5 2115 
# 2116
interchang roll of perfor tape for inform interchang propos american
nation standard cacm januari 1970 interchang roll perfor tape tape
inform interchang direct marker leader trailer roll up tape 9
track paper tape dimens 3 70 6 33 6 34
6 35 6 36 ca700115 jb februari 14 1978 1
14 pm 2116 5 2116 2116 5 2116 2116 5
2116 
# 2117
represent for calen dar date for machin to machin data
interchang propos american nation standard cacm januari 1970 calendar date
machin to machin interchang month year dai represent code 3
70 3 73 3 74 3 9 ca700114 jb februari
14 1978 1 42 pm 2117 5 2117 2117 5
2117 2117 5 2117 
# 2118
an effici algorithm for sort with minim storag algorithm 347
m1 cacm januari 1970 griffin r redish k a sort
minim storag sort digit comput sort 5 31 ca700113 jb
februari 14 1978 1 43 pm 1919 4 2118 1969
4 2118 2118 4 2118 2348 4 2118 2679 4
2118 3054 4 2118 1175 5 2118 2118 5 2118
2118 5 2118 2118 5 2118 
# 2119
deriv algorithm 282 s22 cacm januari 1970 gautschi w klein
b j recurs comput success deriv error control 5 11
5 12 ca700112 jb februari 14 1978 1 45 pm
1909 4 2119 2119 4 2119 2119 4 2119 2149
4 2119 1023 5 2119 2119 5 2119 2119 5
2119 2119 5 2119 2129 5 2119 2404 5 2119
2119 6 2119 
# 2120
an algorithm to produc complex prime csiev algorithm 372 a1
cacm januari 1970 dunham k b prime complex number 5
39 ca700111 jb februari 14 1978 1 47 pm 1841
4 2120 1841 4 2120 1967 4 2120 2120 4
2120 2120 4 2120 2120 4 2120 2927 4 2120
2927 4 2120 1537 5 2120 1539 5 2120 1967
5 2120 377 5 2120 2120 5 2120 2120 5
2120 2120 5 2120 1539 6 2120 2120 6 2120
# 2121
partit in natur order algorithm 371 a1 cacm januari 1970
mckai j k s partit number theori 5 39 ca700110
jb februari 14 1978 1 48 pm 2121 5 2121
2121 5 2121 2121 5 2121 
# 2122
gener random number gener algorithm 370 g5 cacm januari 1970
butler e l random number gener probabl densiti function transform
cumul densiti function 5 13 5 5 ca700109 jb februari
14 1978 1 50 pm 1794 4 2122 1870 4
2122 2115 4 2122 2122 4 2122 2122 4 2122
1674 5 2122 1691 5 2122 2122 5 2122 2122
5 2122 2122 5 2122 
# 2123
gener of random number satisfi the poisson distribut algorithm 369
g5 cacm januari 1970 schaffer h e poisson distribut random
number gener 5 5 ca700108 jb februari 14 1978 1
53 pm 2123 4 2123 1663 5 2123 2123 5
2123 2123 5 2123 2123 5 2123 
# 2124
numer invers of laplac transform algorithm 368 d5 cacm januari
1970 stehfest h laplac transform invers integr transform integr equat
5 15 5 18 ca700107 jb februari 14 1978 1
55 pm 2124 5 2124 2124 5 2124 2124 5
2124 2591 5 2124 2124 6 2124 
# 2125
a note on minim length polygon approxim to a digit
contour a method for extract a smooth polygon contour from
a digit imag is illustr the order sequenc of contour
point and the connect graph of the imag ar first
obtain by a modifi ledlei algorithm in on imag scan
a minim perimet polygon subject to specifi constraint is then
chosen as the approxim contour the determin of the minim
polygon can be reduc to a nonlinear program problem solv
by an algorithm which take into account the weak bond
between variabl some exampl ar present and the correspond comput
time ar list cacm januari 1970 montanari u digit imag
connect tree minim polygon optim approxim nonlinear program 3 63
5 13 5 17 ca700106 jb februari 14 1978 2
00 pm 2125 5 2125 2125 5 2125 2125 5
2125 2987 5 2125 1326 6 2125 1630 6 2125
2125 6 2125 2547 6 2125 2633 6 2125 421
6 2125 524 6 2125 
# 2126
experi with an extens languag an oper extens languag system
is describ the system and it base languag ar apprais
with respect to effici flexibl and util for differ categori
of user cacm januari 1970 iron e t program languag
extens compil bootstrap ambigu 4 12 4 22 ca700105 jb
februari 14 1978 2 02 pm 249 4 2126 254
4 2126 272 4 2126 1046 4 2126 1102 4
2126 1105 4 2126 1109 4 2126 1139 4 2126
1140 4 2126 1140 4 2126 1188 4 2126 1234
4 2126 1263 4 2126 1265 4 2126 1306 4
2126 1464 4 2126 1491 4 2126 1496 4 2126
1693 4 2126 1767 4 2126 1781 4 2126 1781
4 2126 1781 4 2126 1787 4 2126 1824 4
2126 1824 4 2126 1861 4 2126 1945 4 2126
1949 4 2126 321 4 2126 2059 4 2126 2126
4 2126 2126 4 2126 2126 4 2126 2126 4
2126 2126 4 2126 2317 4 2126 2546 4 2126
435 4 2126 437 4 2126 463 4 2126 464
4 2126 483 4 2126 491 4 2126 2732 4
2126 560 4 2126 583 4 2126 584 4 2126
3073 4 2126 627 4 2126 631 4 2126 631
4 2126 632 4 2126 642 4 2126 644 4
2126 653 4 2126 653 4 2126 680 4 2126
680 4 2126 691 4 2126 761 4 2126 762
4 2126 763 4 2126 763 4 2126 795 4
2126 799 4 2126 123 4 2126 140 4 2126
919 4 2126 945 4 2126 989 4 2126 196
5 2126 1614 5 2126 1693 5 2126 2126 5
2126 2126 5 2126 2126 5 2126 2317 5 2126
2546 5 2126 404 5 2126 823 5 2126 1198
6 2126 1477 6 2126 1491 6 2126 1572 6
2126 1693 6 2126 1749 6 2126 1753 6 2126
1781 6 2126 2126 6 2126 2126 6 2126 2148
6 2126 404 6 2126 3184 6 2126 
# 2127
natur languag question answer system 1969 recent experi in program
natur languag question answer system ar review to summar the
method that have been develop for syntact semant and logic
analysi of english string it is conclud that at least
minim effect techniqu have been devis for answer question from
natur languag subset in small scale experiment system and that
a us paradigm ha evolv to guid research effort in
the field current approach to semant analysi and logic infer
ar seen to be effect begin but of question gener
with respect either to subtl aspect of mean or to
applic over larg subset of english gener from current small
scale experi to languag process system base on dictionari with
thousand of entri with correspondingli larg grammar and semant system
mai entail a new order of complex and requir the
invent and develop of entir differ approach to semant analysi
and question answer cacm januari 1970 simmon r f question
answer natur languag artifici intellig languag process fact retriev semant
3 6 3 64 3 7 3 74 ca700104 jb
februari 14 1978 2 10 pm 1155 4 2127 1400
4 2127 1456 4 2127 1468 4 2127 1515 4
2127 1515 4 2127 1553 4 2127 1665 4 2127
1699 4 2127 1768 4 2127 1787 4 2127 1824
4 2127 1825 4 2127 1836 4 2127 1856 4
2127 1861 4 2127 1945 4 2127 2015 4 2127
2096 4 2127 2092 4 2127 2110 4 2127 2127
4 2127 2127 4 2127 2127 4 2127 2127 4
2127 2127 4 2127 2127 4 2127 2187 4 2127
2210 4 2127 2309 4 2127 2310 4 2127 2317
4 2127 2396 4 2127 2396 4 2127 2545 4
2127 2698 4 2127 2730 4 2127 2733 4 2127
1155 5 2127 1324 5 2127 1487 5 2127 1527
5 2127 1781 5 2127 1856 5 2127 2127 5
2127 2127 5 2127 2127 5 2127 2178 5 2127
2396 5 2127 2561 5 2127 1303 6 2127 1323
6 2127 1487 6 2127 1856 6 2127 2059 6
2127 2092 6 2127 2127 6 2127 2127 6 2127
2127 6 2127 3184 6 2127 
# 2128
a processor alloc method for time share a schedul algorithm
is propos which is intend to minim chang of task
on processor and therebi reduc over head the algorithm also
ha applic to more gener resourc alloc problem it is
implement by mean of a method for effici handl dynam
chang segment list cacm januari 1970 mulleri a p driscol
g c time share resourc alloc schedul algorithm monitor dynam
alloc processor alloc multiprogram multiprocess time slice schedul convers system
interact system 3 80 4 30 4 31 4 32
6 33 ca700103 jb februari 14 1978 2 15 pm
1751 4 2128 1892 4 2128 2128 4 2128 2218
4 2128 1752 5 2128 2128 5 2128 2128 5
2128 2128 5 2128 
# 2129
recurs comput of certain deriv a studi of error propag
a brief studi is made of the propag of error
in linear first order differ equat the recurs comput of
success deriv of e x x and co x x
is consid as an illustr cacm januari 1970 gautschi w
recurs comput success deriv error propag 5 11 5 12
ca700102 jb februari 14 1978 2 18 pm 2129 4
2129 1449 5 2129 2119 5 2129 2129 5 2129
2129 5 2129 2129 5 2129 2149 5 2129 1023
6 2129 2129 6 2129 2129 6 2129 
# 2130
automat segment of cyclic program structur base on connect and
processor time time share multiprogram and overlai batch system frequent
requir segment of comput program into discret portion these program
portion ar transfer between execut and peripher storag whenev necessari
segment of program s in a manner that reduc the
frequenc of such transfer is the subject of thi paper
segment techniqu propos by c v ramamoorthi ar subject to
limit that aris when the prefer segment size is not
compat with the physic restrict impos by the avail comput
equip a gener of ramamoorthi s suggest is made in
order to allow their applic when circumst ar other than
ideal cacm januari 1970 low t c automat segment cyclic
program structur loop page multiprogram loader assembl compil time share
program connect 4 19 5 24 5 32 ca700101 jb
februari 14 1978 2 20 pm 2130 4 2130 1916
5 2130 2130 5 2130 2130 5 2130 2130 5
2130 2582 5 2130 1751 6 2130 1924 6 2130
2017 6 2130 2130 6 2130 
# 2131
rapid comput of weight of interpolatori quadratur rule d1 algorithm
417 cacm decemb 1971 gustafson s divid differ 5 16
ca711212 jb februari 2 1978 9 33 am 2131 4
2131 2132 4 2131 2131 5 2131 2131 5 2131
2131 5 2131 2135 5 2131 2131 6 2131 2132
6 2131 
# 2132
rapid comput of coeffici of interpol formula e1 algorithm 416
cacm decemb 1971 gustafson s divid differ newton s interpol
formula 5 13 ca711211 jb februari 2 1978 9 36
am 2131 4 2132 2132 4 2132 2135 5 2132
2132 5 2132 2132 5 2132 2132 5 2132 2131
6 2132 2132 6 2132 
# 2133
algorithm for the assign problem rectangular matric h algorithm 415
cacm decemb 1971 bourgeoi f lassal j c oper research
optim theori assign problem rectangular matric 5 39 5 40
ca711210 jb februari 2 1978 9 38 am 2133 4
2133 2133 4 2133 2134 4 2133 124 5 2133
2133 5 2133 2133 5 2133 2133 5 2133 2134
5 2133 
# 2134
an extens of the munkr algorithm for the assign problem
to rectangular matric the assign problem togeth with munkr propos
algorithm for it solut in squar matric is present first
then the author develop an extens of thi algorithm which
permit a solut for rectangular matric time result obtain by
us an adapt version of silver s algol procedur ar
discuss and a relat between solut time and problem size
is given cacm decemb 1971 bourgeoi f lassal j oper
research optim theori assign problem rectangular matric algorithm 5 39
5 40 ca711209 jb februari 2 1978 9 46 am
2133 4 2134 2134 4 2134 124 5 2134 2133
5 2134 2134 5 2134 2134 5 2134 2134 5
2134 124 6 2134 2134 6 2134 
# 2135
rapid comput of gener interpol formula and mechan quadratur rule
let f have n continu on a close interv a
b and let l be a linear function the attempt
is made to approxim l f with l q where
q is a polynomi approxim f algorithm ar develop for
rapid comput of l q for a wide class of
select of q which includ the lagrangian and hermitian rule
as special case cacm decemb 1971 gustafson s linear function
divid differ newton s interpol formula 5 13 5 16
ca711208 jb februari 2 1978 9 49 am 2135 4
2135 2135 4 2135 2131 5 2135 2135 5 2135
2135 5 2135 2135 5 2135 2132 5 2135 2135
6 2135 2135 6 2135 
# 2136
a note on a modif of nordsieck s method us
an off step point cacm decemb 1971 blumberg j w
foulk c r ordinari differenti equat multi step method predictor
corrector round off error nordsieck s method gragg stetter modif
5 11 5 16 5 17 ca711207 jb februari 2
1978 9 52 am 2136 5 2136 2136 5 2136
2136 5 2136 
# 2137
new lisp techniqu for a page environ the system describ
herein emploi the block concept and that of global and
local variabl in addit to the method appli in most
lisp system also a new mean of list represent is
us local sequenti for list creat dure compil and block
level sequenti for those creat dynam a new garbag collect
algorithm ha been introduc to make list as compact as
possibl partial garbag collect is perform after each block exit
instead of total garbag collect when storag is exhaust the
algorithm doe not us the customari flag procedur thi combin
of featur ha elimin the need for a free list
and effect minim the number of page us at ani
moment cacm decemb 1971 rochfeld a lisp list process page
virtual memori garbag collect core fragment compact list structur block
segment 4 12 4 22 4 32 ca711206 jb februari
2 1978 10 01 am 1073 4 2137 2137 4
2137 2276 4 2137 1153 5 2137 2137 5 2137
2137 5 2137 2137 5 2137 
# 2138
bliss a languag for system program a languag bliss is
describ thi languag is design so as to be especi
suitabl for us in write product softwar system for a
specif machin the pdp 10 compil oper system etc prime
design goal of the design ar the abil to produc
highli effici object code to allow access to all relev
hardwar featur of the host machin and to provid a
ration mean by which to cope with the evolutionari natur
of system program a major featur which contribut to the
realiz of these goal is a mechan permit the definit
of the represent of all data structur in term of
the access algorithm for element of the structur cacm decemb
1971 wulf w a russel d b program languag implement
languag system program data structur 4 12 4 21 4
22 ca711205 jb februari 2 1978 10 09 am 1973
4 2138 1992 4 2138 2138 4 2138 2203 4
2138 2251 4 2138 2530 4 2138 2537 4 2138
2543 4 2138 2559 4 2138 2573 4 2138 2991
4 2138 3053 4 2138 3083 4 2138 2107 5
2138 2138 5 2138 2138 5 2138 2138 5 2138
2411 5 2138 2709 5 2138 2889 5 2138 2937
5 2138 2989 5 2138 3005 5 2138 3025 5
2138 3101 5 2138 1069 6 2138 1425 6 2138
2138 6 2138 2138 6 2138 2138 6 2138 2138
6 2138 2138 6 2138 2138 6 2138 2138 6
2138 2138 6 2138 2193 6 2138 2204 6 2138
2326 6 2138 2388 6 2138 2438 6 2138 2456
6 2138 2455 6 2138 2477 6 2138 2989 6
2138 3185 6 2138 
# 2139
implement of the substr test by hash a techniqu is
describ for implement the test which determin if on string
is a substr of anoth when there is low probabl
that the test will be satisfi it is shown how
the oper can be speed up consider if it is
preced by a test on appropri chosen hash code of
the string cacm decemb 1971 harrison m c substr hash
subset signatur inform compress inform retriev search 3 74 5
30 5 6 ca711204 jb februari 2 1978 10 14
am 2139 5 2139 2139 5 2139 2139 5 2139
2532 5 2139 2631 5 2139 2746 5 2139 3001
5 2139 1665 6 2139 1739 6 2139 2033 6
2139 2139 6 2139 2139 6 2139 2139 6 2139
2139 6 2139 2532 6 2139 2545 6 2139 2786
6 2139 
# 2140
retriev updat speed tradeoff us combin indic in a paper
in the novemb 1970 commun of the acm v y
lum introduc a techniqu of file index name combin indic
thi techniqu permit decreas retriev time at the cost of
increas storag space thi paper examin combin indic under condit
of file usag with differ fraction of retriev and updat
tradeoff curv ar develop to show minim cost of file
usag by group variou partial combin indic cacm decemb 1971
mullin j k file organ combin index file invert file
inform retriev queri multi attribut retriev file updat 3 73
3 74 3 79 ca711203 jb februari 2 1978 10
18 am 2140 4 2140 2452 4 2140 2765 4
2140 2901 4 2140 3134 4 2140 1976 5 2140
2140 5 2140 2140 5 2140 2140 5 2140 
# 2141
algorithm select of the best method for compress map data
string the best of a dozen differ method for compress
map data is illustr the choic ar gener by encod
data string sequenc of like code by three method and
in four direct relationship ar develop between compress altern to
avoid compar all of them the techniqu ha been us
to compress data from forest resourc map but is wide
applic to map and photograph data reduct cacm decemb 1971
amidon e l akin g s data compress map storag
inform retriev input output run code data reduct 3 71
3 74 ca711202 jb februari 2 1978 10 23 am
2141 5 2141 2141 5 2141 2141 5 2141 
# 2142
reconstruct of pictur from their project there ar situat in
the natur scienc and medicin e g in electron microscopi
and x rai photographi in which it is desir to
estim the grai level of a digit pictur at the
individu point from the sum of the grai level along
straight line project at a few angl usual in such
situat the pictur is far from determin and the problem
is to find the most repres pictur three algorithm ar
describ all us mont carlo method which were design to
solv thi problem the algorithm ar applic in a larg
and vari number of field the most import us mai
be the reconstruct of possibl asymmetr particl from electron micrograph
and three dimension x rai analysi cacm decemb 1971 gordon
r herman g t approxim biomed imag process effici encod
imag process linear program mathemat program mont carlo techniqu optim
pictur compress pictur descript pictur process stereolog x rai analysi
3 12 3 13 3 15 3 17 3 63
5 41 5 6 ca711201 jb februari 2 1978 10
32 am 2142 4 2142 2142 4 2142 2529 4
2142 1929 5 2142 2142 5 2142 2142 5 2142
2142 5 2142 2231 5 2142 
# 2143
chebyshev approxim of continu function by a chebyshev system of
function e2 algorithm 414 cacm novemb 1971 bolub g h
smith l b approxim chebyshev approxim remex algorithm 5 13
ca711106 jb februari 2 1978 10 35 am 2143 4
2143 1734 5 2143 2143 5 2143 2143 5 2143
2143 5 2143 
# 2144
on accur float point summat the accumul of float point
sum is consid on a comput which perform t digit
base b float point addit with expon in the rang
m to m an algorithm is given for accur sum
n t digit float point number each of these n
number is split into q part form qn t digit
float point number each of these is then ad to
the appropri on of n auxiliari t digit accumul final
the accumul ar ad togeth to yield the comput sum
in all qn n 1 t digit float point addit
ar perform under usual condit the rel error in the
comput sum is at most t 1 v b 1
t for some v further with an addit q n
1 t digit addit the comput sum can be correct
to full t digit accuraci for exampl for the ibm
360 b 16 t 14 m 63 m 64 typic
valu for q and n ar q 2 and n
32 in thi case becom n 32 768 and we
have t 1 v b 1 t 4x16 13 cacm
novemb 1971 malcolm m a float point summat error analysi
5 11 5 19 ca711105 jb februari 2 1978 10
48 am 1328 4 2144 1333 4 2144 2144 4
2144 1052 5 2144 2144 5 2144 2144 5 2144
2144 5 2144 
# 2145
autom of etch pattern layout help heurist etch pattern layout
program is an applic program develop to computer the tediou
and error prone although vital import wire design of print
circuit board help help autom a design stage on step
closer to product than logic design it can be us
to design wire pattern of two layer circuit board on
which ic in dual in line packag as well as
discret compon such as transistor and resistor have been place
help emploi two method of wire on is the heurist
method which simul human approach to wire design and the
other is the theoret interest but time consum method of
maze run base on the lee s algorithm help perform
more than 90 percent of requir wire by the heurist
path with respect to a perform function for each point
to point and point to line connect it can bring
the number of success wire connect veri close to 100
percent cacm novemb 1971 aramaki i kawabata t kazuhiko a
heurist etch pattern layout wire design of print circuit board
maze run lee s algorithm 3 24 3 66 4
9 6 9 ca711104 jb februari 2 1978 10 58
am 2145 5 2145 2145 5 2145 2145 5 2145
# 2146
optim the polyphas sort variou dispers algorithm for the polyphas
sort procedur ar examinedh optimum algorithm base on minim the
total number of unit string read is displai the logic
of thi algorithm is rather complic henc sever other new
dispers algorithm with more straightforward logic ar present of the
simpl dispers algorithm discuss the horizont is best it doe
approxim on fourth to on and on half percent less
read and write than most algorithm in us todai an
addit two and on fourth to three percent improv can
be achiev by util the modifi optimum algorithm thi algorithm
is rel straightforward but it requir a fairli close estim
of the total number of unit string befor the dispers
begin cacm novemb 1971 shell d l sort polyphas sort
dispers algorithm optimum dispers algorithm repetit oper 5 31 ca711103
jb februari 2 1978 11 39 am 1117 4 2146
1117 4 2146 2017 4 2146 2017 4 2146 2017
4 2146 2146 4 2146 2146 4 2146 2146 4
2146 2146 4 2146 479 4 2146 677 4 2146
860 4 2146 861 4 2146 862 4 2146 863
4 2146 299 5 2146 2146 5 2146 2146 5
2146 2146 5 2146 862 5 2146 863 5 2146
861 5 2146 
# 2147
us comput in higher educ past recommend statu and need
data from a survei conduct with nation scienc foundat support
which wa publish in decemb 1970 is review and it
is point out that with regard to comput in higher
educ nation goal state in the rosser and pierc report
have not been attain qualiti wa lack in hardwar or
cours in nearli half of the associ and bachelor s
degre program in data process comput scienc etc offer in
1966 67 a plea is made for continu studi on
statu and goal for comput in higher educ improv of
degre program and a nation test laboratori for educ technolog
cacm novemb 1971 hamblen j w higher educ comput degre
program nation goal test laboratori educ technolog 1 50 1
52 1 53 2 45 3 51 ca711102 jb februari
2 1978 11 44 am 1720 4 2147 1927 4
2147 2147 4 2147 2163 4 2147 2345 4 2147
2478 4 2147 2594 4 2147 2852 4 2147 2899
4 2147 3130 4 2147 1771 5 2147 2147 5
2147 2147 5 2147 2147 5 2147 3003 5 2147
1659 6 2147 1678 6 2147 1927 6 2147 1945
6 2147 2097 6 2147 2147 6 2147 2163 6
2147 2187 6 2147 2329 6 2147 2345 6 2147
2367 6 2147 2407 6 2147 2478 6 2147 2479
6 2147 2480 6 2147 2538 6 2147 
# 2148
the composit of semant in algol 68 the main featur
of algol 68 ar explain from a semant point of
view it is shown how the languag permit the composit
of valu and action i e ultim program from a
minimum set of primit with a few fundament recurs rule
of composit the associ syntax is briefli review an attempt
ha been made to obtain a structur and simpl introduct
to both algol 68 and it orthogon design cacm novemb
1971 branquart p lewi j sintzoff m wodon p l
program primit program languag algol semant recurs composit design of
program languag data structur 1 3 4 2 4 22
5 23 5 24 ca711101 jb februari 2 1978 11
49 am 2148 5 2148 2148 5 2148 2148 5
2148 2314 5 2148 2317 5 2148 2842 5 2148
1098 6 2148 1198 6 2148 1572 6 2148 1626
6 2148 1693 6 2148 1749 6 2148 1753 6
2148 1781 6 2148 210 6 2148 2060 6 2148
2082 6 2148 2126 6 2148 2148 6 2148 2148
6 2148 2148 6 2148 2192 6 2148 3184 6
2148 
# 2149
entcaf and entcr evalu of normal taylor coeffici of an
analyt function c5 algorithm 413 cacm octob 1971 lyness j
n taylor coeffici taylor seri cauchi integr numer integr numer
differenti interpol complex variabl complex arithmet fast fourier transform 5
12 5 13 5 16 ca711007 jb februari 2 1978
11 53 am 2119 4 2149 2149 4 2149 2129
5 2149 2149 5 2149 2149 5 2149 2149 5
2149 
# 2150
concurr control with reader and writer the problem of the
mutual exclus of sever independ process from simultan access to
a critic section is discuss for the case where there
ar two distinct class of process known as reader and
writer the reader mai share the section with each other
but the writer must have exclus access two solut ar
present on of the case where we wish minimum delai
for the reader the other for the case where we
wish write to take place as earli as possibl cacm
octob 1971 couroi p j heyman f parna d l
mutual exclus critic section share access to resourc 4 30
4 32 ca711006 jb februari 2 1978 11 58 am
1781 4 2150 1828 4 2150 1854 4 2150 1877
4 2150 1960 4 2150 2150 4 2150 2150 4
2150 2150 4 2150 2228 4 2150 2228 4 2150
2256 4 2150 2256 4 2150 2317 4 2150 2317
4 2150 2319 4 2150 2377 4 2150 2342 4
2150 2342 4 2150 2342 4 2150 2376 4 2150
2376 4 2150 2379 4 2150 2424 4 2150 2482
4 2150 2618 4 2150 2618 4 2150 2618 4
2150 2632 4 2150 2704 4 2150 2723 4 2150
2738 4 2150 2740 4 2150 2741 4 2150 2867
4 2150 3184 4 2150 3184 4 2150 1198 5
2150 1338 5 2150 1749 5 2150 2150 5 2150
2150 5 2150 2150 5 2150 2320 5 2150 2597
5 2150 2777 5 2150 2851 5 2150 2895 5
2150 2912 5 2150 2946 5 2150 3128 5 2150
1877 6 2150 2080 6 2150 2150 6 2150 2150
6 2150 2150 6 2150 2150 6 2150 2150 6
2150 2150 6 2150 2150 6 2150 2150 6 2150
2320 6 2150 2376 6 2150 2436 6 2150 2597
6 2150 2618 6 2150 2865 6 2150 2866 6
2150 2866 6 2150 2870 6 2150 2912 6 2150
3082 6 2150 
# 2151
user program measur in a time share environ a gener
discuss of the measur of softwar system is follow by
a descript of a hardwar and softwar scheme for measur
user program in a time share environ the tx 2
comput at mit lincoln laboratori wa us for the implement
of such a system and the characterist of thi implement
ar report a scenario show the system in us is
present final it is shown how other time share system
mai provid similar measur facil cacm octob 1971 nemeth a
g rovner p d oper system multiprogram system time share
system softwar measur user program measur measur technolog tx 2
comput virtual comput perform improv 4 30 4 32 4
42 4 43 ca711005 jb februari 2 1978 1 05
pm 1957 4 2151 2151 4 2151 2151 4 2151
2151 4 2151 2318 4 2151 3103 4 2151 3148
4 2151 1653 5 2151 1747 5 2151 1860 5
2151 2151 5 2151 2151 5 2151 2151 5 2151
2719 5 2151 2967 5 2151 1626 6 2151 210
6 2151 2151 6 2151 2151 6 2151 2167 6
2151 2210 6 2151 2645 6 2151 2657 6 2151
# 2152
displai procedur although the us of structur displai file is
widespread in interact comput graphic these structur present a number
of problem which tend to restrict their gener and us
thi paper discuss some of these problem and suggest an
altern approach to displai system design which avoid the us
of structur displai file thi techniqu emploi displai procedur to
gener inform for displai by includ transform within call to
these procedur it is possibl both to simplifi the specif
of pictur and to speed up their gener displai procedur
permit pictur element to be defin condition and also facilit
the process of input from point devic the paper is
illustr by exampl from avers of the euler languag in
which displai procedur were implement cacm octob 1971 newman w
m comput graphic program languag displai file 4 20 4
41 ca711004 jb februari 2 1978 1 11 pm 1542
4 2152 1683 4 2152 1693 4 2152 1781 4
2152 1787 4 2152 1836 4 2152 1945 4 2152
2003 4 2152 2002 4 2152 2060 4 2152 2061
4 2152 2082 4 2152 2091 4 2152 2152 4
2152 2152 4 2152 2179 4 2152 2340 4 2152
2356 4 2152 2546 4 2152 2603 4 2152 2698
4 2152 2708 4 2152 2824 4 2152 2982 4
2152 2986 4 2152 3045 4 2152 3093 4 2152
1491 5 2152 1767 5 2152 2152 5 2152 2152
5 2152 2152 5 2152 
# 2153
experi with an autom instruct system for numer method a
comput system wa develop at purdu univers to teach portion
of an undergradu cours in numer method each instruct unit
or lesson is divid into three mode of instruct which
allow the student to press from a comput control present
to a student control investig the system is design as
a classroom independ cours of studi and ha been us
for two semest by student in lieu of convent classroom
instruct initi measur of effect student accept and oper cost
ar the result of test the system independ of instructor
intervent the system is oper on a cdc 6500 with
teletyp termin cacm octob 1971 oldehoeft a e cont s
d comput assist instruct numer method cai instruct system 1
52 3 62 5 10 ca711003 jb februari 2 1978
1 22 pm 2153 4 2153 3003 4 2153 2097
5 2153 2153 5 2153 2153 5 2153 2153 5
2153 
# 2154
clarif of fortran standard second report in 1966 after four
year of effort fortran becam the first program languag standard
in the unit state sinc that initi achiev studi and
applic of the standard specif have reveal the need for
mainten of the standard as the result of work initi
in 1967 an initi set of clarifi interpret wa prepar
and thi clarif wa publish in commun of the acm
in mai 1969 that work ha continu and ha result
in the prepar of thi second set of clarifi interpret
the natur of the mainten and the new set of
correct to and interpret of the standard specif ar report
cacm octob 1971 ansi subcommitte x3j3 american nation standard fortran
basic fortran program languag standard languag standard specif languag standard
mainten languag standard clarif languag standard interpret standard committe 1
2 2 0 2 19 2 2 2 3 4
0 4 12 4 19 4 20 4 22 4
29 4 43 5 23 5 9 6 9 ca711002
jb februari 2 1978 1 30 pm 1613 4 2154
1646 4 2154 1845 4 2154 1900 4 2154 1900
4 2154 1955 4 2154 2025 4 2154 2083 4
2154 2154 4 2154 2154 4 2154 2154 4 2154
2270 4 2154 2365 4 2154 2506 4 2154 2693
4 2154 2915 4 2154 3060 4 2154 3060 4
2154 987 5 2154 988 5 2154 1900 5 2154
2154 5 2154 2154 5 2154 2154 5 2154 3060
5 2154 987 6 2154 1900 6 2154 2154 6
2154 
# 2155
toward an understand of data structur thi paper present a
notat and formal for describ the semant of data structur
thi is base on direct graph with name edg and
transform on these graph in addit an implement facil is
describ which could be part of a program languag which
allow a programm who ha express the semant of an
algorithm in term of the graph to then specifi the
implement of some of hi data structur in order to
gain effici cacm octob 1971 earlei j data structur graph
implement semant formal program languag 4 22 4 9 5
24 ca711001 jb februari 2 1978 1 35 pm 1024
4 2155 1051 4 2155 1051 4 2155 1102 4
2155 1132 4 2155 1390 4 2155 1486 4 2155
1549 4 2155 1552 4 2155 1665 4 2155 1706
4 2155 1826 4 2155 1860 4 2155 1860 4
2155 1878 4 2155 1957 4 2155 378 4 2155
2060 4 2155 2155 4 2155 2155 4 2155 2155
4 2155 2155 4 2155 2155 4 2155 2162 4
2155 2168 4 2155 2294 4 2155 2406 4 2155
2558 4 2155 2710 4 2155 2715 4 2155 2716
4 2155 2717 4 2155 2718 4 2155 2719 4
2155 2723 4 2155 2765 4 2155 2817 4 2155
2838 4 2155 2842 4 2155 2842 4 2155 2855
4 2155 2879 4 2155 2888 4 2155 2901 4
2155 2957 4 2155 2959 4 2155 2965 4 2155
3077 4 2155 3077 4 2155 3080 4 2155 3087
4 2155 3106 4 2155 3150 4 2155 3154 4
2155 627 4 2155 106 4 2155 210 5 2155
1389 5 2155 378 5 2155 2046 5 2155 2060
5 2155 2155 5 2155 2155 5 2155 2155 5
2155 2252 5 2155 2594 5 2155 1358 6 2155
1496 6 2155 1771 6 2155 2155 6 2155 2155
6 2155 2204 6 2155 3184 6 2155 3186 6
2155 
# 2156
comment on chenei s list compact algorithm cacm septemb 1971
fenichel r r lisp garbag collector virtual memori list process
storag alloc 4 19 4 49 ca710908 jb februari 2
1978 1 36 pm 1708 4 2156 1781 4 2156
1826 4 2156 1860 4 2156 1972 4 2156 2156
4 2156 2156 4 2156 2156 4 2156 2168 4
2156 2168 4 2156 2249 4 2156 2314 4 2156
2361 4 2156 2438 4 2156 2513 4 2156 2719
4 2156 2723 4 2156 2736 4 2156 2736 4
2156 2736 4 2156 2833 4 2156 2833 4 2156
2855 4 2156 2855 4 2156 3074 4 2156 3074
4 2156 3106 4 2156 3112 4 2156 3112 4
2156 1626 5 2156 1826 5 2156 1972 5 2156
2156 5 2156 2156 5 2156 2156 5 2156 
# 2157
averag binari search length for dens order list cacm septemb
1971 flore i madpi g search binari search record retriev
3 74 ca710907 jb februari 2 1978 1 42 pm
2157 5 2157 2157 5 2157 2157 5 2157 2293
5 2157 2157 6 2157 
# 2158
a stop criterion for the newton raphson method in implicit
multistep integr algorithm for nonlinear system of ordinari differenti equat
cacm septemb 1971 linig w ordinari differenti equat linear multistep
formula newton raphson method stop criterion 5 11 5 15
5 17 ca710906 jb februari 2 1978 2 13 pm
2158 5 2158 2158 5 2158 2158 5 2158 
# 2159
a note on best on side approxim cacm septemb 1971
phillip d l best approxim on side approxim logarithm error
rel error 5 11 5 13 ca710905 jb februari 2
1978 2 15 pm 1440 4 2159 1832 4 2159
1932 4 2159 1999 4 2159 2159 4 2159 2159
4 2159 962 5 2159 1932 5 2159 2159 5
2159 2159 5 2159 2159 5 2159 
# 2160
canon structur in attribut base file organ a new file
structur for attribut base retriev is propos in thi paper
it allow queri involv arbitrari boolean function of the attribut
valu pair to be process without take intersect of list
the structur is highli depend on the wai in which
the file is to be us and is uniqu determin
by the specif of the allow queri thu for exampl
the structur for retriev on the basi of rang of
valu of a given attribut would be veri differ from
on where onli retriev on the basi of a singl
valu is permit the file organ be propos is base
on the atom of a boolean algebra gener by the
queri the desir properti claim for thi structur ar prove
and file mainten question ar discuss cacm septemb 1971 wong
e chiang t c address calcul atom of boolean algebra
attribut boolean function boolean queri file organ inform retriev invert
file kei word multilist queri search 3 70 3 73
3 74 ca710904 jb februari 2 1978 2 22 pm
2160 4 2160 2688 4 2160 2114 5 2160 2160
5 2160 2160 5 2160 2160 5 2160 3134 5
2160 1976 6 2160 2160 6 2160 2524 6 2160
2990 6 2160 
# 2161
an algorithm for the block and cutnod of a graph
corrigendum cacm septemb 1971 paton k ca710903 jb februari 2
1978 2 24 pm 2161 5 2161 2161 5 2161
2161 5 2161 
# 2162
an effici bit tabl techniqu for dynam storag alloc of
2 n word block an effici bit tabl techniqu for
dynam storag alloc of 2 n word block which requir
a minim amount of memori for bookkeep purpos is describ
the techniqu ha been test in an implement of the
list process languag l 6 a number of idea incorpor
in the processor ar also describ cacm septemb 1971 isoda
s goto e bit tabl dynam storag alloc buddi system
l 6 list process free storag 3 89 4 12
4 9 ca710902 jb februari 2 1978 2 33 pm
1389 4 2162 1552 4 2162 1860 4 2162 1957
4 2162 2155 4 2162 2162 4 2162 2162 4
2162 2435 4 2162 2596 4 2162 2768 4 2162
2845 4 2162 2902 4 2162 2955 4 2162 1184
5 2162 1389 5 2162 2162 5 2162 2162 5
2162 2162 5 2162 
# 2163
educ relat to the us of comput in organ the
acm curriculum committe on comput educ for manag ha been
carri out a studi on curriculum develop in manag inform
system educ in colleg and univers under a grant from
the nation scienc foundat thi posit paper provid a framework
for the studi preliminari conclus ar present on the need
for educ in administr inform system and appropri colleg curricula
and cours ar suggest also the role of profession societi
and organ us comput is discuss and the plan of
the committe ar outlin the initi approach of the committe
ha been to describ the educ necessari for the effect
us of comput in organ to classifi the posit for
which educ is requir and to survei educ program now
avail cacm septemb 1971 teichroew d educ inform analysi system
design busi data process 1 52 3 51 ca710901 jb
februari 2 1978 2 40 pm 1720 4 2163 1927
4 2163 2147 4 2163 2163 4 2163 2163 4
2163 2163 4 2163 2163 4 2163 2345 4 2163
2345 4 2163 2407 4 2163 2478 4 2163 2594
4 2163 2852 4 2163 2899 4 2163 3003 4
2163 3130 4 2163 1720 5 2163 1771 5 2163
1927 5 2163 2163 5 2163 2163 5 2163 2163
5 2163 2181 5 2163 2407 5 2163 3003 5
2163 1659 6 2163 1678 6 2163 1927 6 2163
1945 6 2163 2097 6 2163 2147 6 2163 2163
6 2163 2163 6 2163 2181 6 2163 2187 6
2163 2329 6 2163 2345 6 2163 2345 6 2163
2367 6 2163 2407 6 2163 2478 6 2163 2479
6 2163 2480 6 2163 2538 6 2163 
# 2164
symbol integr the stormi decad three approach to symbol integr
in the 1960 s ar describ the first from artifici
intellig led to slagl s saint and to a larg
degre to mose sin the second from algebra manipul led
to manov s implement and to horowitz and tobei s
reexamin of the hermit algorithm for integr ration function the
third from mathemat led to richardson s proof of the
unsolv of the problem for a class of function and
for risch s decis procedur for the elementari functionsener of
risch s algorithm to a class of special function and
program for solv differenti equat and for find the definit
integr ar also describ cacm august 1971 mose j integr
symbol integr definit integr ration function 3 1 3 2
3 6 4 9 5 2 5 9 ca710808 jb
februari 2 1978 2 48 pm 2164 4 2164 2170
4 2164 2323 4 2164 2719 4 2164 2167 5
2164 2164 5 2164 2164 5 2164 2164 5 2164
2323 5 2164 2164 6 2164 2167 6 2164 2170
6 2164 
# 2165
gener rel and the applic of algebra manipul system the
paper describ some applic of symbol algebra system to problem
of gener rel includ the deriv of the field equat
the petrov classif of a metric and the solut of
the field equat in the presenc of matter in a
simpl case attent is drawn to the strictli algebra difficulti
encount in thi work cacm august 1971 barton d fitch
j p symbol mathemat nonnumer mathemat gener rel algebra manipul
equat manipul 1 3 3 11 5 10 ca710807 jb
februari 2 1978 2 53 pm 2165 5 2165 2165
5 2165 2165 5 2165 2170 5 2165 3071 5
2165 2165 6 2165 2165 6 2165 2167 6 2165
2166 6 2165 
# 2166
autom algebra manipul in celesti mechan in thi paper we
consid some of the applic of autom algebra manipul which
have been made in celesti mechan particular attent is paid
to the us of poisson seri and a typic problem
in perturb theori is describ the requir of processor for
us in celesti mechan ar consid and compar with those
for gener manipul packag some futur direct for research us
these system ar briefli outlin to illustr the rel simplic
of the algorithm requir in celesti mechan a typic integr
problem is consid in an appendix cacm august 1971 jefferi
w h seri manipul autom algebra celesti mechan 5 10
5 13 5 17 ca710806 jb februari 2 1978 3
31 pm 2166 5 2166 2166 5 2166 2166 5
2166 2170 5 2166 2165 6 2166 2167 6 2166
2166 6 2166 
# 2167
algebra simplif a guid for the perplex algebra simplif is
examin first from the point of view of a user
who need to comprehend a larg express and second from
the point of view of a design who want to
construct a us and effici system first we describ variou
techniqu akin to substitut these techniqu can be us to
decreas thesiz of an express and make it more intellig
to a user then we delin the spectrum of approach
to the design of automat simplif capabl in an algebra
manipul system system ar divid into five type each type
provid differ facil for the manipul and simplif of express
final we discuss some of the theoret result relat to
algebra simplif we describ sever posit result about the exist
of power simplif algorithm and the number theoret conjectur on
which thei reli result about the nonexist of algorithm for
certain class of express ar includ cacm august 1971 mose
j algebra manipul algebra simplif canon simplif 3 1 3
2 3 6 4 9 5 2 5 9 ca710805
jb februari 2 1978 3 42 pm 1396 4 2167
1396 4 2167 1946 4 2167 2167 4 2167 2167
4 2167 2167 4 2167 2167 4 2167 2857 4
2167 2956 4 2167 1379 5 2167 1393 5 2167
1392 5 2167 2167 5 2167 2167 5 2167 2167
5 2167 2164 5 2167 2169 5 2167 2170 5
2167 2323 5 2167 2719 5 2167 1626 6 2167
210 6 2167 2151 6 2167 2164 6 2167 2165
6 2167 2167 6 2167 2167 6 2167 2167 6
2167 2167 6 2167 2166 6 2167 2170 6 2167
2210 6 2167 2645 6 2167 2657 6 2167 
# 2168
list trace in system allow multipl cell type list process
system have each allow the us of onli a singl
size and configur of list cell in thi paper a
system is describ which allow the us of arbitrarili mani
differ size and configur of list cell possibl not specifi
until run time cacm august 1971 fenichel r r list
process storag alloc lisp slip base storag pointer 4 49
ca710804 jb februari 2 1978 3 45 pm 1024 4
2168 1024 4 2168 1051 4 2168 1051 4 2168
1098 4 2168 1102 4 2168 1132 4 2168 1214
4 2168 1380 4 2168 1388 4 2168 1390 4
2168 1393 4 2168 1485 4 2168 1486 4 2168
1487 4 2168 1549 4 2168 1549 4 2168 1570
4 2168 1706 4 2168 1708 4 2168 1781 4
2168 1826 4 2168 1826 4 2168 1860 4 2168
1878 4 2168 1878 4 2168 1946 4 2168 1957
4 2168 1972 4 2168 378 4 2168 2023 4
2168 2060 4 2168 2155 4 2168 2156 4 2168
2156 4 2168 2168 4 2168 2168 4 2168 2168
4 2168 2168 4 2168 2168 4 2168 2249 4
2168 2314 4 2168 2438 4 2168 2719 4 2168
2719 4 2168 2723 4 2168 2723 4 2168 2723
4 2168 2736 4 2168 2736 4 2168 2833 4
2168 2833 4 2168 2838 4 2168 2842 4 2168
2855 4 2168 2855 4 2168 2857 4 2168 2879
4 2168 3074 4 2168 3077 4 2168 3080 4
2168 3106 4 2168 3112 4 2168 3112 4 2168
627 4 2168 106 4 2168 210 5 2168 1626
5 2168 1826 5 2168 1878 5 2168 2168 5
2168 2168 5 2168 2168 5 2168 731 5 2168
# 2169
the altran system for ration function manipul a survei altran
is a complet system for symbol comput with ration function
in sever variabl with integ coeffici it ha been design
and implement to handl larg problem with eas and effici
consider effort ha been spent to ensur a minimum amount
of machin depend in the implement thu permit the system
to be instal quickli and easili on a varieti of
comput machin in thi paper a brief descript of the
languag run time data structur and implement is given cacm
august 1971 hall jr a d symbol algebra ration function
manipul polynomi manipul interpret translat 4 13 4 29 ca710803
jb februari 2 1978 4 17 pm 2167 5 2169
2169 5 2169 2169 5 2169 2169 5 2169 1379
6 2169 1392 6 2169 1393 6 2169 2169 6
2169 
# 2170
applic of symbol manipul in theoret physic thi paper survei
the applic of symbol comput techniqu to problem in theoret
physic particular emphasi is place on applic in quantum electrodynam
where the most activ ha occur cacm august 1971 hearn
a c symbol manipul algebra simplif comput physic quantum electrodynam
3 17 4 22 ca710802 jb februari 2 1978 4
21 pm 2164 4 2170 2170 4 2170 2170 4
2170 2170 4 2170 2323 4 2170 2719 4 2170
3071 4 2170 2167 5 2170 2165 5 2170 2166
5 2170 2170 5 2170 2170 5 2170 2170 5
2170 2323 5 2170 2164 6 2170 2167 6 2170
2170 6 2170 
# 2171
solut of simultan nonlinear equat cacm juli 1971 raduchel w
j nonlinear equat 5 15 ca710711 jb februari 2 1978
4 31 pm 2171 5 2171 2171 5 2171 2171
5 2171 
# 2172
graph plotter j6 algorithm 412 cacm juli 1971 cermak j
plot graph line printer plot 4 41 ca710710 jb februari
2 1978 4 32 pm 2172 5 2172 2172 5
2172 2172 5 2172 
# 2173
three procedur for the stabl marriag problem h algorithm 411
cacm juli 1971 mcviti d g wilson l b assign
problem assign procedur combinator discret mathemat oper research stabl marriag
problem univers entranc 5 30 ca710709 jb februari 2 1978
4 35 pm 2173 5 2173 2173 5 2173 2173
5 2173 2174 5 2173 2173 6 2173 
# 2174
the stabl marriag problem the origin work of gale and
shaplei on an assign method us the stabl marriag criterion
ha been extend to find all the stabl marriag assign
the algorithm deriv for find all the stabl marriag assign
is prove to satisfi all the condit of the problem
algorithm 411 appli to thi paper cacm juli 1971 mcviti
d g wilson l b assign problem assign procedur combinator
discret mathemat oper research stabl marriag problem univers entranc 5
30 ca710708 jb februari 2 1978 4 40 pm 2174
4 2174 2173 5 2174 2174 5 2174 2174 5
2174 2174 5 2174 
# 2175
subexpress order in the execut of arithmet express an arithmet
express can often be broken down into it compon subexpress
depend on the hardwar environ in which the express is
to be execut these subexpress can be evalu in serial
in parallel or in a combin of these mode thi
paper show that express execut time can be minim onli
if consider is given to the order of the subexpress
in particular subexpress should be execut in order of decreas
memori and processor time requir thi observ is valid for
configur rang from a uniprocessor with an unbuff main memori
to multiprocessor with a cach buffer memori if the number
of subexpress which can be execut in parallel exce the
number of avail processor then execut of some of these
subexpress must be postpon a procedur is given which combin
thi requir with the earlier order consider to provid an
optim execut sequenc cacm juli 1971 ramamoorthi c v gonzalez
m j parallel process cach arithmet express subexpress order comput
tree compil 4 12 4 32 ca710707 jb februari 2
1978 4 49 pm 1781 4 2175 1807 4 2175
1934 4 2175 2175 4 2175 2175 4 2175 2175
4 2175 1551 5 2175 1613 5 2175 1886 5
2175 2175 5 2175 2175 5 2175 2175 5 2175
2413 5 2175 2175 6 2175 
# 2176
buffer alloc in merg sort a fix buffer alloc for
merg sort is present here which minim the number of
input output oper for a given order of merg when
sort on movabl arm disk the number of seek is
equal to the number of input output oper and the
seek time usual control the sort time first some standard
terminolog is introduc then the input buffer alloc method is
describ follow by an analysi of the improv to be
expect over more convent alloc thi analysi make us of
a particular distribut function an analysi of a complet differ
distribut is given which yield similar result thi suggest that
the result do not depend on a particular distribut function
an optimum output buffer size is also determin it is
conclud that thi buffer alloc can significantli reduc the time
of merg sort on movabl arm disk when the input
data ar not random and that thi output buffer alloc
should be us whether the data is random or not
cacm juli 1971 ferguson d e file item string merg
sort seek time gamma distribut function 4 41 5 31
ca710706 jb februari 3 1978 8 41 am 1638 4
2176 2176 4 2176 2272 4 2176 2176 5 2176
2176 5 2176 2176 5 2176 677 5 2176 
# 2177
an algorithm for the block and cutnod of a graph
an effici method is present for find block and cutnod
of an arbitrari undirect graph the graph mai be repres
either i as an order list of edg or ii
as a pack adjac matrix if w denot the word
length of the machin emploi the storag in machin word
requir for a graph with n node and m edg
increas essenti as 2 m n in case i or
n 2 win case ii a span tree with label
edg is grown two edg final bear differ label if
and onli if thei belong to differ block for both
represent the time requir to analyz a graph on n
node increas as n g where g depend on the
type of graph 1 g 2 and both bound ar
attain valu of g ar deriv for each of sever
suitabl famili of test graph gener by an extens of
the web grammar approach the algorithm is compar in detail
with that propos by read for which 1 g 3
cacm juli 1971 paton k algorithm block block cutpoint tree
cutnod fundament cycl set graph lobe lobe decomposit graph separ
span tree web grammar 5 32 ca710705 jb februari 3
1978 8 58 am 1961 4 2177 2177 4 2177
2763 4 2177 1847 5 2177 2177 5 2177 2177
5 2177 2177 5 2177 2490 5 2177 2177 6
2177 
# 2178
a languag extens for graph process and it formal semant
a simpl program languag extens grasp for process direct graph
is defin grasp consist of a type of direct graph
data structur and a set of primit oper for manipul
these structur grasp mai be most easili implement by embed
it in a host languag emphasi is place both on
grasp itself and on it method of definit commonli the
definit of a languag involv definit of the syntact element
and explan of the mean to be assign them the
semant the definit of grasp here is sole in term
of it semant that is the data structur and oper
ar defin precis but without assign of a particular syntact
represent onli when the languag is implement is assign of
an explicit syntax necessari an exampl of an implement of
grasp embed in lisp is given as an illustr the
advantag and disadvantag of the definit of a languag in
term of it semant ar discuss cacm juli 1971 pratt
t w friedman d p graph process program languag formal
semant direct graph lisp network data structur flowchart syntax languag
definit 4 20 4 22 5 23 5 24 5
32 ca710704 jb februari 3 1978 9 24 am 1086
4 2178 1132 4 2178 1234 4 2178 1263 4
2178 1265 4 2178 1270 4 2178 1323 4 2178
1358 4 2178 1379 4 2178 1380 4 2178 1453
4 2178 1464 4 2178 1469 4 2178 1484 4
2178 1486 4 2178 1491 4 2178 1491 4 2178
1498 4 2178 1613 4 2178 1614 4 2178 1781
4 2178 1781 4 2178 1781 4 2178 1825 4
2178 1860 4 2178 2083 4 2178 2178 4 2178
2178 4 2178 2178 4 2178 2178 4 2178 2178
4 2178 2179 4 2178 2252 4 2178 2325 4
2178 2326 4 2178 2326 4 2178 2341 4 2178
2396 4 2178 2470 4 2178 2546 4 2178 2561
4 2178 2645 4 2178 2652 4 2178 2684 4
2178 2684 4 2178 2684 4 2178 2842 4 2178
2929 4 2178 2934 4 2178 3044 4 2178 3069
4 2178 669 4 2178 679 4 2178 691 4
2178 761 4 2178 949 4 2178 989 4 2178
1303 5 2178 1323 5 2178 2059 5 2178 2127
5 2178 2178 5 2178 2178 5 2178 2178 5
2178 3184 5 2178 
# 2179
simpl lr k grammar a class of context free grammar
call the simpl lr k or slr k grammar is
defin thi class ha been shown to includ weak preced
and simpl preced grammar as proper subset how to construct
parser for the slr k grammar is also shown these
parser construct techniqu ar extend to cover all of the
lr k grammar of knuth thei have been implement and
by direct comparison prove to be superior to preced techniqu
not onli in the rang of grammar cover but also
in the speed of parser construct and in the size
and speed of the result parser cacm juli 1971 derem
f l context free grammar lr k grammar preced grammar
syntact analysi pars algorithm parser finit state machin determinist pushdown
automaton 4 12 5 22 5 23 ca710703 jb februari
3 1978 9 31 am 1086 4 2179 1132 4
2179 1234 4 2179 1263 4 2179 1265 4 2179
1270 4 2179 1323 4 2179 1358 4 2179 1379
4 2179 1379 4 2179 1380 4 2179 1453 4
2179 1464 4 2179 1484 4 2179 1491 4 2179
1498 4 2179 1542 4 2179 1613 4 2179 1614
4 2179 1683 4 2179 1693 4 2179 1693 4
2179 1781 4 2179 1781 4 2179 1781 4 2179
1787 4 2179 1825 4 2179 1836 4 2179 1836
4 2179 1860 4 2179 1945 4 2179 1945 4
2179 1989 4 2179 2015 4 2179 2060 4 2179
2060 4 2179 2060 4 2179 2061 4 2179 2061
4 2179 2061 4 2179 2083 4 2179 2082 4
2179 2091 4 2179 2091 4 2179 2152 4 2179
2178 4 2179 2179 4 2179 2179 4 2179 2179
4 2179 2179 4 2179 2179 4 2179 2179 4
2179 2252 4 2179 2325 4 2179 2341 4 2179
2340 4 2179 2356 4 2179 2423 4 2179 2546
4 2179 2546 4 2179 2546 4 2179 2603 4
2179 2645 4 2179 2652 4 2179 2684 4 2179
2698 4 2179 2698 4 2179 2698 4 2179 2708
4 2179 2708 4 2179 2824 4 2179 2842 4
2179 2921 4 2179 2929 4 2179 2934 4 2179
2982 4 2179 2986 4 2179 3045 4 2179 3045
4 2179 3069 4 2179 3093 4 2179 3154 4
2179 669 4 2179 679 4 2179 691 4 2179
761 4 2179 949 4 2179 989 4 2179 1477
5 2179 1491 5 2179 1825 5 2179 2015 5
2179 2110 5 2179 2179 5 2179 2179 5 2179
2179 5 2179 2733 5 2179 2986 5 2179 3093
5 2179 3094 5 2179 3184 5 2179 1265 6
2179 1491 6 2179 1491 6 2179 1683 6 2179
1781 6 2179 1836 6 2179 2179 6 2179 2179
6 2179 2179 6 2179 2179 6 2179 2340 6
2179 2423 6 2179 2645 6 2179 2708 6 2179
2786 6 2179 680 6 2179 799 6 2179 
# 2180
a programm train project a project is describ whose purpos
is to train select black resid of the albani schenectadi
area in comput program and arrang for job for them
in the comput field both the organ and curriculum of
the cours ar discuss cacm juli 1971 bernstein a j
programm train job opportun fortran 1 59 ca710702 jb februari
3 1978 9 36 am 2180 5 2180 2180 5
2180 2180 5 2180 
# 2181
the state of comput orient curricula in busi school 1970
the acm committe on comput educ for manag support by
a nation scienc foundat grant is establish to apprais the
state of the art and to develop a seri of
recommend for improv comput educ for manag to provid the
committe with materi for it studi of curricular need five
region meet in the unit state were held in 1970
at each of which a broad cross section of invit
academician and practition consid the state of curricula in busi
school three topic were cover curricula for the gener manag
comput relat materi in requir and function cours and curricula
for student concentr on comput base inform system an analysi
of the minut of the meet reveal a common set
of experi which rais similar pedagog and econom issu thi
present give a summari of the discuss a condens of
the pedagog and substant concern rais and consider of the
resourc alloc issu involv preliminari to the committe s recommend
for improv comput educ for manag thi report ha been
prepar to provid the particip and the administr of their
institut with background inform for the ongo task of cours
develop chairman of the ten man committe is daniel teichroew
the univers of michigan cacm juli 1971 mckennei j l
tong f m univers program manag educ curriculum design busi
administr curricula graduat busi school resourc plan 1 52 3
5 ca710701 jb februari 3 1978 9 47 am 2163
5 2181 2181 5 2181 2181 5 2181 2181 5
2181 2345 5 2181 2407 5 2181 1720 6 2181
1771 6 2181 1771 6 2181 1927 6 2181 2163
6 2181 2181 6 2181 2181 6 2181 2181 6
2181 2345 6 2181 
# 2182
interrupt driven program cacm juli 1971 zelkowitz m interrupt supervisor
monitor debug parallel process associ memori microprogram 3 51 4
32 4 42 ca710608 jb februari 3 1978 9 49
am 2182 4 2182 2534 4 2182 1959 5 2182
2182 5 2182 2182 5 2182 2182 5 2182 2497
5 2182 2534 5 2182 830 6 2182 1471 6
2182 1787 6 2182 1959 6 2182 1973 6 2182
2111 6 2182 2182 6 2182 2182 6 2182 799
6 2182 
# 2183
binari summat cacm juli 1971 walker r j summat binari
summat float point addit round off error 5 11 ca710607
jb februari 3 1978 9 50 am 2183 4 2183
2282 4 2183 2049 5 2183 2183 5 2183 2183
5 2183 2183 5 2183 
# 2184
on the mean of name in program system it is
assum that there is a similar of function between the
data name of a program languag and the file name
of an oper system the two function ar discuss in
term of the same basic concept in order to identifi
the extent to which thei overlap it is suggest that
there is some similar between the idea of a file
directori and a storabl object of type context manipul with
context ar then discuss at length it is note that
there is a simpl extens of church s lambda notat
that deal nice with these idea of context manipul wherea
a function can be regard as the abstract base upon
the first two term of the express lambda name list
express valu list it is found that a context can
be view as an abstract base upon the first two
term in the equival express mu name list valu list
express cacm juli 1971 fraser a g file oper system
program languag function name context file directori file dictionari lambda
calculu theori of program 3 73 4 22 4 39
5 23 5 24 ca710606 jb februari 3 1978 9
58 am 2184 5 2184 2184 5 2184 2184 5
2184 
# 2185
a note on compil fix point binari multipl an algorithm
is develop for compil as a sequenc of shift addit
and subtract mani fix point binari multipl involv a constant
the most signific characterist of the algorithm ar the simplic
of the test which determin if the algorithm should be
appli and the degre to which it suggest effici object
code cacm june 1971 glaswin h t compil multipl fix
point arithmet 4 12 ca710605 jb februari 3 1978 10
04 am 2185 5 2185 2185 5 2185 2185 5
2185 2296 5 2185 2952 5 2185 142 6 2185
162 6 2185 163 6 2185 192 6 2185 2185
6 2185 2185 6 2185 2727 6 2185 
# 2186
numer properti of the ritz trefftz algorithm for optim control
in thi paper the ritz trefftz algorithm is appli to
the comput solut of the state regul problem the algorithm
repres a modif of the ritz direct method and is
design to improv the speed of solut and the storag
requir to the point where real time implement becom feasibl
the modif is shown to be more stabl computation than
the tradit ritz approach the first concern of the paper
is to describ the algorithm and establish it properti as
a valid and us numer techniqu in particular such us
properti as definit and reason of condit ar establish for
the method the second part of the paper is devot
to a comparison of the new techniqu with the standard
procedur of numer integr a matrix riccati equat to determin
a feedback matrix the new techniqu is shown to be
significantli faster for compar accuraci cacm june 1971 bosarg jr
w e johnson o g spline regul problem control theori
numer analysi 5 1 ca710604 jb februari 3 1978 10
12 am 2186 5 2186 2186 5 2186 2186 5
2186 
# 2187
comput scienc a conceptu framework for curriculum plan two view
of comput scienc ar consid a global view which attempt
to captur broad characterist of the field and it relationship
to other field and a local view which focus on
the inner structur of the field thi structur is present
in term of the kind of knowledg problem and activ
that exist within the disciplin as well as the relat
between them an approach to curriculum plan in comput scienc
is present which is guid by the structur of the
field by the fact that chang is an import featur
of the situat and by the expect that comput scienc
will continu to increas it work contact with other disciplin
cacm june 1971 amarel s comput scienc curriculum plan educ
1 0 1 52 ca710603 jb februari 3 1978 10
17 am 1665 4 2187 1768 4 2187 1787 4
2187 1805 4 2187 1824 4 2187 1825 4 2187
1828 4 2187 1836 4 2187 1854 4 2187 1861
4 2187 2015 4 2187 2110 4 2187 2127 4
2187 2187 4 2187 2187 4 2187 2317 4 2187
2545 4 2187 2698 4 2187 2733 4 2187 1748
5 2187 1781 5 2187 2187 5 2187 2187 5
2187 2187 5 2187 3003 5 2187 1659 6 2187
1678 6 2187 1927 6 2187 1945 6 2187 2097
6 2187 2147 6 2187 2163 6 2187 2187 6
2187 2329 6 2187 2345 6 2187 2367 6 2187
2407 6 2187 2478 6 2187 2479 6 2187 2480
6 2187 2538 6 2187 
# 2188
an approach to the optimum design of comput graphic system
displai system design ar face with the difficult task of
select major subsystem in an intellig wai each subsystem is
chosen from larg number of altern the select is base
on consider such as system respons time system cost and
the distribut of data storag and process between the graphic
processor and it support data process system the work report
here develop an object quantit design procedur and help give
a better understand of now to configur displai system thi
is accomplish by mean of a mathemat model of a
comput driven graphic system the paramet of the model ar
function of the capabl of the graphic hardwar and of
the comput requir of the graphic applic the model can
be analyz us numer queue analysi or simul to obtain
an averag respons time predict by combin the model with
an optim the best graphic system configur subject to a
cost constraint is found for sever applic the optimum configur
ar in turn us to find gener displai system design
guidelin cacm june 1971 folei j d design guidelin graphic
displai system mathemat model optimum system design queue model 3
8 6 22 6 35 ca710602 jb februari 3 1978
10 26 am 1805 4 2188 1846 4 2188 1892
4 2188 2188 4 2188 2218 4 2188 2317 4
2188 1572 5 2188 2188 5 2188 2188 5 2188
2188 5 2188 2319 5 2188 1408 6 2188 1719
6 2188 1749 6 2188 1751 6 2188 2016 6
2188 2017 6 2188 2080 6 2188 2188 6 2188
2203 6 2188 2204 6 2188 
# 2189
gener of rosari permut express in hamiltonian circuit systemat gener
of a specif class of permut fundament to schedul problem
is describ in a nonori complet graph with n vertic
hamitonian circuit equival to 5 n 1 specif permut of
n element term rosari permut can be defin each of
them correspond to two circular permut which mirror imag each
other and is gener success by a number system cover
3 4 n 1 set of edg everi set of
edg e k 1 e k k 3 k n
1 is determin recurs by construct a hamiltonian circuit with
k vertic from a hamiltonian circuit with k 1 vertic
start with the hamiltonian circuit of 3 vertic the basic
oper consist of transposit of a pair of adjac vertic
where the posit of the pair in the permut is
determin by e k two algorithm treat the same exampl
for five vertic ar present it is veri easi to
deriv all possibl n permut from the 5 n 1
rosari permut be cycl the permut and by take them
in the revers order procedur which can be perform fairli
effici by comput cacm june 1971 harada k permut graph
theori schedul combinatori algebra 5 32 5 39 ca710601 jb
februari 3 1978 1 55 pm 2044 4 2189 2087
4 2189 2189 4 2189 2189 4 2189 2189 4
2189 2189 4 2189 2417 4 2189 2505 4 2189
2874 4 2189 2908 4 2189 3188 4 2189 1594
5 2189 2087 5 2189 2189 5 2189 2189 5
2189 2189 5 2189 2292 5 2189 2505 5 2189
521 5 2189 3191 5 2189 2189 6 2189 2189
6 2189 2292 6 2189 521 6 2189 
# 2190
function minim cacm mai 1971 hous f r ca710510 jb
februari 3 1978 1 57 pm 2190 4 2190 2190
4 2190 1372 5 2190 1849 5 2190 2190 5
2190 2190 5 2190 2190 5 2190 
# 2191
algorithm 410 partial sort m1 cacm mai 1971 chamber j
m sort partial sort order statist 5 11 5 13
ca710508 jb februari 3 1978 2 23 pm 1175 4
2191 1919 4 2191 1919 4 2191 1969 4 2191
1997 4 2191 2191 4 2191 2191 4 2191 2388
4 2191 2388 4 2191 2679 4 2191 2783 4
2191 2784 4 2191 3054 4 2191 3054 4 2191
3121 4 2191 3121 4 2191 864 4 2191 308
5 2191 309 5 2191 2191 5 2191 2191 5
2191 2191 5 2191 
# 2192
anoth recurs induct principl an induct method for prove thing
about recurs defin function is describ it is shown to
be us for prove partial function equival and thu applic
in proof about interpret for program languag cacm mai 1971
morri jr j h recurs induct correct proof compil correct
4 13 4 2 5 24 ca710507 jb februari 3
1978 2 27 pm 2192 5 2192 2192 5 2192
2192 5 2192 2326 5 2192 2457 5 2192 2842
5 2192 2903 5 2192 1303 6 2192 1323 6
2192 210 6 2192 1834 6 2192 2060 6 2192
2148 6 2192 2192 6 2192 2192 6 2192 2192
6 2192 2192 6 2192 2326 6 2192 3184 6
2192 3186 6 2192 
# 2193
on implement of label variabl variabl of label mode ar
convention implement with a techniqu which fail to trap certain
program error fine grain calendar clock have recent becom avail
these allow implement of label variabl via a new techniqu
which trap all program error of thi varieti cacm mai
1971 fenichel r r label compil interpret go to transfer
4 22 ca710506 jb februari 3 1978 2 31 pm
2193 4 2193 2193 4 2193 2319 4 2193 2326
4 2193 2477 4 2193 2541 4 2193 2594 4
2193 2894 4 2193 3004 4 2193 2016 5 2193
2193 5 2193 2193 5 2193 2193 5 2193 3101
5 2193 3186 5 2193 2138 6 2193 2193 6
2193 2438 6 2193 3185 6 2193 
# 2194
how to keep the address short an algorithm is present
for minim the sum of the length of the block
of code produc by an assembl or compil when 1
the length of each comput instruct is assum to be
either long or short long if the memori locat address
is more than a predetermin distanc from the current locat
short otherwis and 2 there ar block of instruct whose
begin origin ar separ by prespecifi amount for exampl some
comput permit either 8 bit address interpret rel to the
locat counter or full 16 bit address of all of
memori when assembl or compil two or more block of
instruct which have mani mutual refer in such a comput
there is no simpl iter procedur for keep as mani
of the address short as possibl thi paper demonstr that
a wide class of problem of thi type can be
formul as cover problem solvabl by mean of elementari arithmet
oper on the column vector of a ternari matrix cacm
mai 1971 richard d l address assembl cover problem integ
program variabl length address 4 11 4 12 4 21
5 41 ca710505 jb februari 3 1978 2 40 pm
2194 5 2194 2194 5 2194 2194 5 2194 2858
5 2194 3110 5 2194 2194 6 2194 2194 6
2194 2629 6 2194 2858 6 2194 
# 2195
on the optim detect of curv in noisi pictur a
techniqu for recogn system of line is present in thi
techniqu the heurist of the problem is not embed in
the recognit algorithm but is express in a figur of
merit a multistag decis process is then abl to recogn
in the input pictur the optim system of line accord
to the given figur of merit due to the global
approach greater flexibl and adequaci in the particular problem is
achiev the relat between the structur of the figur of
merit and the complex of the optim process is then
discuss the method describ is suitabl for parallel process becaus
the oper rel to each state can be comput in
parallel and the number of stage is equal to the
length n of the curv or to log2 n if
the approxim method is us cacm mai 1971 montanari u
pictur process pictur recognit pictur descript curv detect line detect
edg detect optim detect heurist method global recognit parallel process
dynam program interact graph secondari optim problem 3 63 3
66 5 42 ca710504 jb februari 3 1978 2 49
pm 1663 4 2195 2195 4 2195 2679 4 2195
1190 5 2195 2195 5 2195 2195 5 2195 2195
5 2195 2883 5 2195 2195 6 2195 
# 2196
a man machin approach toward solv the travel salesman problem
the travel salesman problem belong to an import class of
schedul and rout problem it is also a subproblem in
solv other such as the warehous distribut problem it ha
been attack by mani mathemat method with but meager success
onli for special form of the problem or for problem
with a moder number of point can it be solv
exactli even if veri larg amount of comput time ar
us heurist procedur have been propos and test with onli
slightli better result thi paper describ a comput aid heurist
techniqu which us onli a modest amount of comput time
in real time to solv larg 100 200 point problem
thi techniqu take advantag of both the comput s and
the human s problem solv abil the comput is not
ask to solv the problem in a brute forc wai
as in mani of todai s heurist but it is
ask to organ the data for the human so that
the human can solv the problem easili the techniqu us
in thi paper seem to point to new direct in
the field of man machin interact and in the field
of artifici intellig cacm mai 1971 krolak p felt w
marbl g heurist procedur comput aid heurist techniqu man machin
interact artifici intellig assign problem mask of the assign rubber
band tour gener interact process travel salesman problem 3 57
3 66 5 30 ca710503 jb februari 3 1978 3
00 pm 2196 5 2196 2196 5 2196 2196 5
2196 
# 2197
the merit of region comput network on of the suggest
mean for stimul the spread of comput capabl in institut
of higher learn is through the construct of region comput
network on such network ha been construct in the san
francisco bai area by stanford univers thi paper report upon
the lesson learn from the oper of the network over
the past two year a major impact of the network
wa not so much the comput power deliv to the
school as the awaken of comput awar and the foster
of capabl develop at these school the expertis and assist
from the central facil as well as the share of
idea among the particip were other import benefit both the
qualiti and varieti of servic provid by the central facil
were found to plai a kei role in the effect
of the network a region network bring mani benefit and
should not be judg as a purveyor of raw comput
power alon cacm mai 1971 nielsen n r comput share
comput util cooper network curriculum develop educ comput network comput
region comput network remot comput share comput 1 52 2
11 ca710502 jb februari 3 1978 3 17 pm 2197
5 2197 2197 5 2197 2197 5 2197 
# 2198
introduct to featur analysi of gener data base manag system
thi paper is a separ publish introduct to a main
report which analyz the featur of gener data base manag
system thi introduct give a review of the current state
of the art in these system and discuss the differ
and similar between capabl found in host languag system and
those found in self contain system after some discuss of
the problem of data independ and bind the four user
level ar identifi and describ technic problem face futur design
ar describ the first of these is that of handl
exist store data and the next is that of provid
more complex data structur than those alreadi avail in convent
program languag the problem of high level interrog and updat
function act on network structur is mention follow by a
discuss of the problem of cater to a high volum
of transact initi from termin by parametr user the lowest
level of user the us of cobol as a basi
for further develop work is consid at some length with
respect to data structur host languag capabl and self contain
capabl thi section also assess the effect of the data
base task group propos the final section outlin the ten
major topic in the main bodi of the full report
cacm mai 1971 codasyl system committe data base manag system
program languag data structur storag structur inform retriev transact process
3 5 3 70 3 72 3 73 3 74
4 29 ca710501 jb februari 3 1978 3 18 pm
2198 5 2198 2198 5 2198 2198 5 2198 2452
5 2198 2882 5 2198 849 6 2198 1936 6
2198 1976 6 2198 2198 6 2198 2198 6 2198
2452 6 2198 627 6 2198 
# 2199
a spars matrix packag part i f4 algorithm 408 cacm
april 1971 mcname j m matrix spars matrix matrix manipul
5 14 ca710406 jb februari 3 1978 3 20 pm
2199 5 2199 2199 5 2199 2199 5 2199 
# 2200
on complement divis the divis algorithm theorem is express in
a form that permit it to serv as the basi
for devis divis oper that produc both quotient and remaind
in complement form algorithm for divis yield complement result ar
deriv for number repres in ani base greater than on
both radix and radix less on complement scheme ar consid
the binari form of the algorithm thu includ both two
s and on s complement implement the problem of quotient
overflow for complement result is dealt with as is that
of select an appropri form of the remaind condit for
complement divis cacm april 1971 stein m l munro w
d divis algorithm complement arithmet complement divis on s complement
arithmet two s complement arithmet 3 15 4 0 4
9 5 11 6 32 ca710405 jb februari 3 1978
3 28 pm 1965 4 2200 2200 4 2200 1718
5 2200 2200 5 2200 2200 5 2200 2200 5
2200 
# 2201
anim an on line two dimension film anim system anim
is a comput anim system which wa design to overcom
some of the inher disadvantag associ with convent comput anim
techniquesh dec 338 serv as an input termin for movi
make allow the trial and error design of pictur sequenc
in a convers mode dure all stage on the system
input element light pen pushbutton and teletyp is maintain at
the user s request thi record is sent to the
ibm 360 75 where the s d 4020 instruct necessari
to produc the same sequenc of pictur can be gener
it is anticip that on of the primari contribut of
anim will be the provis of a facil which will
allow ani professor to produc hi own expositori film strip
cacm april 1971 talbot p a carr iii j w
coulter jr r r hwang r c comput graphic comput
anim on line system two dimension languag crt microfilm record
3 41 3 80 4 22 ca710404 jb februari 3
1978 3 37 pm 2201 5 2201 2201 5 2201
2201 5 2201 
# 2202
dynam microprogram processor organ and program a dynam microprogram processor
is character by a small 4 k 64 bit word
read write micro storag the access time of thi storag
is similar to the cycl time of the machin 50
100 nsec thi microstorag is us to contain both data
and subroutin the micro instruct in such a processor differ
from the convent in that thei perform onli pure combinatori
oper sequenc is under the control of the microinstruct the
presenc of the read write microstorag permit a more flexibl
assign of resourc than the read onli storag in particular
the processor develop in thi paper stress the simultan oper
within the microinstruct of the adder shifter masker and test
facil of the processor a microassembl languag is develop and
the overhead involv in subroutin linkag is analyz the effici
of a flexibl softwar linkag scheme is examin as to
it overhead for variou subroutin characterist final three exampl of
problem orient program ar consid and the result code is
compar against a system 360 assembl languag version with the
technolog normal cacm april 1971 tucker a b flynn m
j microprogram read write microstorag subroutin linkag execut speed 6
2 ca710403 jb februari 3 1978 3 58 pm 2202
4 2202 2527 4 2202 1542 5 2202 2202 5
2202 2202 5 2202 2202 5 2202 
# 2203
kei to address transform techniqu a fundament perform studi on
larg exist format file the result of a studi of
eight differ kei to address transform method appli to a
set of exist file ar present as each method is
appli to a particular file load factor and bucket size
ar vari over a wide rang in addit appropri variabl
pertin onli to a specif method take on differ valu
the perform of each method is summar in term of
the number of access requir to get to a record
and the number of overflow record creat by a transform
peculiar of each method ar discuss practic guidelin obtain from
the result ar state final a propos for further quantit
fundament studi is outlin cacm april 1971 lum v y
yuen p s t dodd m hash hash techniqu hash
method hash code kei kei transform kei to address transform
direct address direct access method random random access file address
file organ file structur scatter storag search collis cluster inform
retriev 3 7 3 72 3 73 3 74 3
79 4 9 ca710402 jb februari 3 1978 4 10
pm 1676 4 2203 1682 4 2203 1728 4 2203
1785 4 2203 1785 4 2203 1860 4 2203 1860
4 2203 1973 4 2203 1973 4 2203 1973 4
2203 1973 4 2203 1992 4 2203 1992 4 2203
2018 4 2203 2018 4 2203 2018 4 2203 2032
4 2203 2033 4 2203 2033 4 2203 2107 4
2203 2107 4 2203 2109 4 2203 2109 4 2203
2138 4 2203 2203 4 2203 2203 4 2203 2203
4 2203 2203 4 2203 2203 4 2203 2203 4
2203 2251 4 2203 2251 4 2203 2251 4 2203
2251 4 2203 2359 4 2203 2524 4 2203 2530
4 2203 2537 4 2203 2543 4 2203 2543 4
2203 2543 4 2203 2543 4 2203 2552 4 2203
2552 4 2203 2559 4 2203 2559 4 2203 2573
4 2203 2573 4 2203 2770 4 2203 2770 4
2203 2860 4 2203 2974 4 2203 2991 4 2203
2991 4 2203 3053 4 2203 3053 4 2203 3053
4 2203 3083 4 2203 911 4 2203 911 5
2203 1785 5 2203 1786 5 2203 2107 5 2203
2109 5 2203 2203 5 2203 2203 5 2203 2203
5 2203 2258 5 2203 2313 5 2203 2319 5
2203 2359 5 2203 2437 5 2203 2552 5 2203
2781 5 2203 2860 5 2203 2991 5 2203 492
5 2203 911 6 2203 1328 6 2203 1408 6
2203 1719 6 2203 1749 6 2203 1751 6 2203
1785 6 2203 1785 6 2203 1785 6 2203 332
6 2203 2016 6 2203 2017 6 2203 2080 6
2203 2107 6 2203 2188 6 2203 2203 6 2203
2203 6 2203 2203 6 2203 2203 6 2203 2203
6 2203 2203 6 2203 2203 6 2203 2203 6
2203 2203 6 2203 2204 6 2203 492 6 2203
# 2204
program develop by stepwis refin the creativ activ of program
to be distinguish from code is usual taught by exampl
serv to exhibit certain techniqu it is here consid as
a sequenc of design decis concern the decomposit of task
into subtask and of data into data structur the process
of success refin of specif is illustr by a short
but nontrivi exampl from which a number of conclus ar
drawn regard the art and the instruct of program cacm
april 1971 wirth n educ in program program techniqu stepwis
program construct 1 50 4 0 ca710401 jb februari 3
1978 4 14 pm 2204 5 2204 2204 5 2204
2204 5 2204 2319 5 2204 2480 5 2204 2594
5 2204 2709 5 2204 2939 5 2204 2972 5
2204 3155 5 2204 970 6 2204 1408 6 2204
1425 6 2204 1719 6 2204 1749 6 2204 1751
6 2204 1771 6 2204 2016 6 2204 2017 6
2204 2080 6 2204 2138 6 2204 2155 6 2204
2188 6 2204 2203 6 2204 2204 6 2204 2204
6 2204 2204 6 2204 2204 6 2204 2204 6
2204 2204 6 2204 2204 6 2204 2247 6 2204
2247 6 2204 2456 6 2204 2477 6 2204 2558
6 2204 2597 6 2204 2732 6 2204 2738 6
2204 3073 6 2204 3186 6 2204 799 6 2204
# 2205
difsub for solut of ordinari differenti equat d2 algorithm 407
cacm march 1971 gear c w differenti equat stiff differenti
equat 5 17 ca710307 jb februari 3 1978 4 16
pm 2205 4 2205 2474 4 2205 2205 5 2205
2205 5 2205 2205 5 2205 2207 5 2205 2474
5 2205 2205 6 2205 2207 6 2205 
# 2206
exact solut of linear equat us residu arithmet f4 algorithm
406 cacm march 1971 howel j residu arithmet symmetr residu
modulu mix radix represent symmetr mix radix represent mix radix
convers prime number linear equat gaussian elimin matrix invers determin
adjoint matrix ill condit 3 15 5 14 ca710306 jb
februari 3 1978 4 23 pm 2206 5 2206 2206
5 2206 2206 5 2206 
# 2207
the automat integr of ordinari differenti equat an integr techniqu
for the automat solut of an initi valu problem for
a set of ordinari differenti equat is describ a criterion
for the select of the order of approxim is propos
the object of the criterion is to increas the step
size so as to reduc solut time an option permit
the solut of stiff differenti equat a program embodi the
techniqu discuss appear in algorithm 407 cacm march 1971 gear
c w differenti equat stiff equat integr step control order
control 5 17 ca710305 jb februari 3 1978 4 28
pm 2205 5 2207 2207 5 2207 2207 5 2207
2207 5 2207 2474 5 2207 2205 6 2207 2207
6 2207 2207 6 2207 
# 2208
storag util in a memori hierarchi when storag assign is
perform by a hash algorithm the util of storag is
studi in a two level memori hierarchi the first storag
level which is the fast store is divid into a
number of storag area when an entri is to be
file in the hierarchi a hash algorithm will attempt to
place the entri into on of these area if thi
particular area is full then the entri will be place
into the slower second level store even though other area
in the first level store mai have space avail given
the n entri have been file in the entir hierarchi
an express is deriv for the expect number of entri
file in the first level storehi express give a measur
of how effect the first level store is be us
by mean of exampl storag util is then studi as
a function of the hash algorithm the number of storag
area into which the first level store is divid and
the total size of the first level store cacm march
1971 william j g hash algorithm memori alloc memori hierarchi
memori util storag alloc storag hierarchi storag util 3 74
4 3 ca710304 jb februari 3 1978 4 37 pm
2208 5 2208 2208 5 2208 2208 5 2208 
# 2209
a schedul algorithm for a comput assist registr system thi
paper present the schedul algorithm us in the comput assist
registr system at the univers of tennesse notat is defin
and the logic of the algorithm necessari to implement educ
polici is describ result from the first term s implement
ar present cacm march 1971 winter w k comput assist
registr schedul algorithm timet 3 32 5 39 ca710303 jb
februari 3 1978 4 40 pm 1540 4 2209 2052
4 2209 2209 4 2209 2209 4 2209 1434 5
2209 1540 5 2209 2209 5 2209 2209 5 2209
2209 5 2209 
# 2210
toward automat program synthesi an elementari outlin of the theorem
prove approach to automat program synthesi is given without dwell
on technic detail the method is illustr by the automat
construct of both recurs and iter program oper on natur
number list and tree in order to construct a program
satisfi certain specif a theorem induc by those specif is
prove and the desir program is extract from the proof
the same techniqu is appli to transform recurs defin function
into iter program frequent with a major gain ineffici it
is emphas that in order to construct a program with
loop or with recurs the principl of mathemat induct must
be appli the relat between the version of the induct
rule us and the form of the program construct is
explor in some detail cacm march 1971 manna z walding
r j artifici intellig answer extract automat program synthesi mathemat
induct principl problem solv theorem prove 3 64 5 23
5 24 ca710302 jb februari 3 1978 4 48 pm
1515 4 2210 2096 4 2210 2127 4 2210 2210
4 2210 1155 5 2210 2210 5 2210 2210 5
2210 2210 5 2210 2657 5 2210 2719 5 2210
1626 6 2210 210 6 2210 2151 6 2210 2167
6 2210 2210 6 2210 2210 6 2210 2645 6
2210 2657 6 2210 
# 2211
scan displai comput graphic a televis like scan displai system
ha been successfulli implement on a honeywel ddp 224 comput
instal the scan imag is store in the core memori
of the comput and softwar scan convers is us to
convert the rectangular coordin of a point to the appropri
word and bit in an output displai arrai in core
storag result thu far indic that flicker free displai of
larg amount of data ar possibl with reason fast graphic
interact a scan imag of size 240 x 254 point
is displai at a 30 frame per second rate cacm
march 1971 noll a m comput graphic scan displai scan
convers raster displai 4 41 6 35 ca710301 jb februari
3 1978 4 53 pm 1891 4 2211 2211 4
2211 2211 4 2211 2421 4 2211 2674 4 2211
2687 4 2211 1554 5 2211 1741 5 2211 2211
5 2211 2211 5 2211 2211 5 2211 2421 5
2211 1741 6 2211 2211 6 2211 
# 2212
f distribut cacm februari 1971 tolman h fisher s f
distribut student s t distribut 5 5 ca710209 jb februari
8 1978 8 35 am 2212 5 2212 2212 5
2212 2212 5 2212 
# 2213
root of matrix pencil the gener eigenvalu problem f2 algorithm
405 cacm februari 1971 dell a m weil r l
thompson g l eigenvalu matrix root pencil root 5 1
5 3 ca710208 jb februari 8 1978 8 37 am
2213 5 2213 2213 5 2213 2213 5 2213 
# 2214
complex interv arithmet complex interv arithmet is defin us real
interv arithmet complex interv divis is defin so as to
assur smallest possibl result interv cacm februari 1971 rokn j
lancast p real interv real interv arithmet complex interv complex
interv arithmet 5 11 ca710207 jb februari 8 1978 8
39 am 1524 4 2214 1931 4 2214 2214 4
2214 2544 4 2214 311 5 2214 2214 5 2214
2214 5 2214 2214 5 2214 2544 5 2214 1524
6 2214 311 6 2214 2214 6 2214 
# 2215
applic of game tree search techniqu to sequenti pattern recognit
a sequenti pattern recognit spr procedur doe not test all
the featur of a pattern at onc instead it select
a featur to be test after receiv the result of
that test the procedur either classifi the unknown pattern or
select anoth featur to be test etc medic diagnosi is
an exampl of spr in thi paper the author suggest
that spr be view as a on person game plai
against natur chanc virtual all the power techniqu develop for
search two person strictli competit game tree can easili be
incorpor either directli or by analog into spr procedur in
particular on can incorpor the mini averag back up procedur
and the gamma procedur which ar the analogu of the
minimax back up procedur and the alpha beta procedur respect
some comput simul experi in charact recognit ar present the
result indic that the approach is promis cacm februari 1971
slagl j r lee r c t sequenti pattern recognit
game tree search game against natur gamma procedur mini averag
back up procedur dynam program branch and bound approach optim
solut 3 60 3 63 5 42 ca710206 jb februari
8 1978 8 56 am 2215 4 2215 2096 5
2215 2215 5 2215 2215 5 2215 2215 5 2215
3132 5 2215 2215 6 2215 
# 2216
on the probabl distribut of the valu of binari tree
an integr equat is deriv for the gener function for
binari tree valu the valu reflect sort effort the analysi
doe not assum uniformli distribut branch ratio and therefor is
applic to a famili of sort algorithm discuss by hoar
singleton and van emden the solut to the integr equat
indic that us more advanc algorithm in the famili make
onli minor reduct in the expect sort effort but substanti
reduc the varianc in sort effort statist test of the
valu of sever thousand tree contain up to 10 000
point have given first second and third moment of the
valu distribut function in satisfactori agreement with the moment comput
from the gener function the empir test as well as
the analyt result ar in agreement with previous publish result
for the first moment in the case of uniform and
nonuniform distribut of branch ratio and for the second moment
in the case of uniform distribut of branch ratio cacm
februari 1971 hurwitz jr h binari tree sort statist analysi
4 40 5 18 5 5 ca710205 jb februari 8
1978 9 09 am 1175 4 2216 1919 4 2216
1997 4 2216 2017 4 2216 2041 4 2216 2216
4 2216 2216 4 2216 2216 4 2216 2216 4
2216 2679 4 2216 2679 4 2216 3054 4 2216
3054 4 2216 3054 4 2216 1919 5 2216 1969
5 2216 1997 5 2216 2216 5 2216 2216 5
2216 2216 5 2216 864 5 2216 
# 2217
experi in automat learn for a multipurpos heurist program an
automat learn capabl ha been develop and implement for us
with the multipl multipurpos program that learn heurist tree search
program which is present be appli to resolut theorem prove
in predic calculu multipl s prove program pp us two
evalu function to guid it search for a proof of
whether or not a particular goal is achiev thirteen gener
featur of predic calculu claus were creat for us in
the automat learn of better evalu function for pp a
multipl regress program wa us to produc optim coeffici for
linear polynomi function in term of the featur also automat
data handl routin were written for pass data between the
learn program and the prove program and for analyz and
summar result data wa gener collect for learn regress analysi
from the experi of pp a number of experi were
perform to test the effect and gener of the learn
program result show that the learn produc dramat improv in
the solut to problem which were in the same domain
as those us for collect learn data learn wa also
shown to gener successfulli to domain other than those us
for data collect anoth experi demonstr that the learn program
could simultan improv perform on problem in a specif domain
and on problem in a varieti of domain some variat
of the learn program were also test cacm februari 1971
slagl j r farrel c d learn theorem provid heurist
automat learn self modifi tree search artifici intellig problem solv
adapt lisp multipl regress resolut 3 62 3 64 ca710204
jb februari 8 1978 9 33 am 2217 5 2217
2217 5 2217 2217 5 2217 
# 2218
an analysi of some time share techniqu the effect of
certain time share techniqu such as program reloc disk rotat
delai minim and swap volum minim is investig summari data
is present and the find ar discuss the vehicl for
thi investig wa a simula base simul model reflect an
earli framework for a plan burrough b6500 time share system
inasmuch as the b6500 system is base upon the us
of variabl size segment and a dynam overlai procedur data
is also present which provid some indic of the effect
of thi type of organ in a time share environ
the design characterist and oper capabl of the simul model
ar also describ cacm februari 1971 nielsen n r b6500
bulk core usag oper system model reloc rotat delai minim
simul swap volum minim system simul time share 3 9
4 32 ca710203 jb februari 8 1978 9 40 am
1541 4 2218 1751 4 2218 1805 4 2218 1846
4 2218 1846 4 2218 1892 4 2218 1892 4
2218 1892 4 2218 1892 4 2218 1901 4 2218
1924 4 2218 2060 4 2218 2085 4 2218 2095
4 2218 2095 4 2218 2095 4 2218 2128 4
2218 2188 4 2218 2218 4 2218 2218 4 2218
2218 4 2218 2218 4 2218 2218 4 2218 2218
4 2218 2218 4 2218 2218 4 2218 2277 4
2218 2297 4 2218 2317 4 2218 2319 4 2218
2329 4 2218 2358 4 2218 2373 4 2218 2373
4 2218 2374 4 2218 2380 4 2218 2434 4
2218 2499 4 2218 2498 4 2218 2501 4 2218
2526 4 2218 2582 4 2218 2596 4 2218 2667
4 2218 2668 4 2218 2669 4 2218 2734 4
2218 2734 4 2218 2828 4 2218 2862 4 2218
2863 4 2218 2863 4 2218 2881 4 2218 2902
4 2218 2911 4 2218 2928 4 2218 2996 4
2218 3000 4 2218 3000 4 2218 3006 4 2218
3067 4 2218 3112 4 2218 1380 5 2218 1572
5 2218 1728 5 2218 1751 5 2218 1752 5
2218 1810 5 2218 1879 5 2218 2095 5 2218
2218 5 2218 2218 5 2218 2218 5 2218 2681
5 2218 2218 6 2218 
# 2219
a polici driven schedul for a time share system the
servic receiv by a process from a time share oper
system can be character by a resourc count sum w
i r ij where r ij is the number of
unit of servic receiv by process i from resourc i
and w i is the cost per unit of the
servic each class of user can be character by a
polici function which specifi the amount of servic a user
who belong to thi class should receiv as a function
of time prioriti chang dynam as a function of the
differ between the servic promis to the user by the
polici function and the servic he actual receiv a schedul
and swap algorithm which keep the resourc count of each
process abov it polici function will provid the specifi level
of servic overhead can be reduc by avoid swap of
process which have receiv at least hi level of servic
the algorithm ha been implement in a gener purpos oper
system and it ha provid significantli better servic to interact
and to batch job than the previou schedul cacm februari
1971 bernstein a j sharp j c schedul time share
oper system resourc alloc and swap 4 32 ca710202 jb
februari 8 1978 9 54 am 2219 4 2219 2344
4 2219 1938 5 2219 2219 5 2219 2219 5
2219 2219 5 2219 2950 5 2219 3072 5 2219
1713 6 2219 2219 6 2219 2219 6 2219 2245
6 2219 2375 6 2219 
# 2220
convers of limit entri decis tabl to comput program a
propos modif to pollack s algorithm pollack ha propos an
algorithm for convert decis tabl into flowchart which minim subsequ
execut time when compil into a comput program two modif
of thi algorithm ar propos the first reli on shannon
s noiseless code theorem and the commun concept of entropi
but doe not complet test the els rule the second
modif complet test the els rule but result in more
execut than the first modif both modif result in modif
guarante a global optim solut cacm februari 1971 shwayder k
code decis tabl entropi inform theori noiseless channel sort 3
50 5 31 ca710201 jb februari 8 1978 10 06
am 1237 4 2220 1354 4 2220 1354 4 2220
1354 4 2220 1488 4 2220 1488 4 2220 1548
4 2220 1684 4 2220 1994 4 2220 2053 4
2220 2053 4 2220 2053 4 2220 2053 4 2220
2220 4 2220 2220 4 2220 2220 4 2220 2220
4 2220 2220 4 2220 2220 4 2220 2220 4
2220 2273 4 2220 2273 4 2220 2273 4 2220
2273 4 2220 2453 4 2220 2453 4 2220 2492
4 2220 2518 4 2220 2598 4 2220 2598 4
2220 2616 4 2220 2726 4 2220 2726 4 2220
2726 4 2220 2726 4 2220 2726 4 2220 2856
4 2220 2856 4 2220 2856 4 2220 3113 4
2220 753 4 2220 1172 5 2220 1237 5 2220
1327 5 2220 1354 5 2220 250 5 2220 1489
5 2220 1548 5 2220 2220 5 2220 2220 5
2220 2220 5 2220 2273 5 2220 2453 5 2220
2598 5 2220 2726 5 2220 2856 5 2220 1172
6 2220 1172 6 2220 1172 6 2220 1172 6
2220 1172 6 2220 1237 6 2220 1327 6 2220
1327 6 2220 1327 6 2220 1354 6 2220 1354
6 2220 1354 6 2220 1354 6 2220 1488 6
2220 1489 6 2220 1548 6 2220 1548 6 2220
2053 6 2220 2053 6 2220 2053 6 2220 2220
6 2220 2220 6 2220 2220 6 2220 2220 6
2220 2220 6 2220 2221 6 2220 2263 6 2220
2263 6 2220 2453 6 2220 2453 6 2220 2598
6 2220 2691 6 2220 753 6 2220 
# 2221
comment on the convers of decis tabl to comput program
cacm januari 1971 pollack s l decis tabl diagnost aid
system analysi busi applic 3 50 3 59 4 19
4 29 4 49 ca710113 jb februari 8 1978 10
09 am 2221 4 2221 2221 4 2221 2273 4
2221 2340 4 2221 2453 4 2221 2517 4 2221
2824 4 2221 2856 4 2221 2986 4 2221 3034
4 2221 1683 5 2221 2053 5 2221 2221 5
2221 2221 5 2221 2221 5 2221 2517 5 2221
2726 5 2221 1172 6 2221 1327 6 2221 1354
6 2221 1488 6 2221 1489 6 2221 1548 6
2221 1684 6 2221 2053 6 2221 2220 6 2221
2221 6 2221 2221 6 2221 2263 6 2221 
# 2222
comment on london s certif of algorithm 245 cacm januari
1971 redish k a proof of algorithm debug certif metatheori
sort in place sort 4 42 4 49 5 24
5 31 ca710112 jb februari 8 1978 10 19 am
2021 4 2222 2042 4 2222 2222 4 2222 2222
4 2222 2222 4 2222 2222 4 2222 2222 4
2222 2227 4 2222 2315 4 2222 2326 4 2222
2356 4 2222 2470 4 2222 2679 4 2222 2679
4 2222 2732 4 2222 2844 4 2222 2865 4
2222 2896 4 2222 2943 4 2222 2972 4 2222
3014 4 2222 3068 4 2222 3077 4 2222 3143
4 2222 970 5 2222 1800 5 2222 1818 5
2222 1834 5 2222 2042 5 2222 2222 5 2222
2222 5 2222 2222 5 2222 
# 2223
minit algorithm for linear program algorithm 222 h cacm januari
1971 kolm a dahlstrand t linear program dual simplex method
primal problem dual problem 5 41 ca710111 jb februari 8
1978 10 22 am 2223 5 2223 2223 5 2223
2223 5 2223 
# 2224
complex gamma function s14 algorithm 404 cacm januari 1971 luca
jr c w terril c w gamma function pole of
gamma function stirl s asymptot seri recurs formula reflect formula
5 12 ca710110 jb februari 8 1978 10 25 am
2224 4 2224 1547 5 2224 2224 5 2224 2224
5 2224 2224 5 2224 
# 2225
circular integ partit a1 algorithm 403 cacm januari 1971 coleman
m w taylor m s partit combinator statist design of
experi 5 39 5 5 ca710109 jb februari 8 1978
10 27 am 2225 5 2225 2225 5 2225 2225
5 2225 
# 2226
further evid for the analysi of algorithm for the zero
on program problem the purpos of thi note is to
report comput experi addit to that recent summar by gue
et al with two algorithm for the zero on linear
program problem an error in gue s paper is correct
the util of on of the algorithm as a suboptim
is indic cacm januari 1971 proll l g oper research
integ program zero on variabl algorithm 5 39 5 41
ca710108 jb februari 8 1978 10 32 am 2226 4
2226 2226 4 2226 1658 5 2226 1666 5 2226
2226 5 2226 2226 5 2226 2226 5 2226 
# 2227
proof of a program find a proof is given of
the correct of the algorithm find first a inform descript
is given of the purpos of the program and the
method us a systemat techniqu is describ for construct the
program proof dure the process of code it in such
a wai as to prevent the intrus of logic error
the proof of termin is treat as a separ exercis
final some conclus relat to gener program methodolog ar drawn
cacm januari 1971 hoar c a r proof of program
program methodolog program document program correct theori of program 4
0 4 22 5 21 5 23 5 24 ca710107
jb februari 8 1978 10 40 am 2021 4 2227
2222 4 2227 2227 4 2227 2227 4 2227 2315
4 2227 2326 4 2227 2470 4 2227 2732 4
2227 2783 4 2227 2865 4 2227 2896 4 2227
2943 4 2227 3014 4 2227 3054 4 2227 3068
4 2227 3077 4 2227 3143 4 2227 1834 5
2227 307 5 2227 2227 5 2227 2227 5 2227
2227 5 2227 2356 5 2227 2420 5 2227 2874
5 2227 3143 5 2227 970 6 2227 1491 6
2227 1682 6 2227 1834 6 2227 2227 6 2227
2227 6 2227 2227 6 2227 2227 6 2227 2317
6 2227 2683 6 2227 2871 6 2227 521 6
2227 
# 2228
comment on prevent of system deadlock habermann s method of
deadlock prevent is discuss where deadlock is defin as a
system state from which resourc alloc to certain process ar
not possibl it is shown that the schedul mai introduc
artifici deadlock which habermann s method doe not prevent perman
block is the situat where certain process never receiv their
resourc request it is shown that deadlock prevent doe not
necessarili elimin perman block a method of prevent perman block
is given cacm januari 1971 holt r c multiprogram time
share schedul resourc alloc deadlock lockout deadli embrac knot 3
72 4 32 6 20 ca710106 jb februari 8 1978
10 45 am 1781 4 2228 2150 4 2228 2150
4 2228 2228 4 2228 2228 4 2228 2228 4
2228 2256 4 2228 2256 4 2228 2280 4 2228
2317 4 2228 2342 4 2228 2342 4 2228 2376
4 2228 2379 4 2228 2482 4 2228 2618 4
2228 2618 4 2228 2740 4 2228 2851 4 2228
2920 4 2228 3184 4 2228 1198 5 2228 1338
5 2228 1877 5 2228 2228 5 2228 2228 5
2228 2228 5 2228 2280 5 2228 2379 5 2228
2482 5 2228 2500 5 2228 1749 6 2228 1749
6 2228 1877 6 2228 1877 6 2228 1877 6
2228 2228 6 2228 2228 6 2228 2228 6 2228
2228 6 2228 
# 2229
construct of ration and neg power of a formal seri
some method ar describ for the gener of fraction and
neg power of ani formal seri such as poisson seri
or chebyshev seri it is shown that with the us
of the three elementari oper of addit subtract and multipl
all ration posit and neg power of a seri can
be construct there ar basic two approach the binomi theorem
and the iter method both method ar describ here and
the relationship between them is point out some well known
classic formula ar obtain as particular case and it is
shown how the converg properti of these formula can be
improv with veri littl addit comput final at the end
of the articl some numer experi ar describ with chebyshev
seri and with fourier seri cacm januari 1971 bruck r
a seri expans seri invers root extract binomi theorem newton
iter chebyshev seri poisson seri fourier seri 3 11 3
15 3 21 5 0 ca710105 jb februari 8 1978
10 57 am 1396 4 2229 2229 4 2229 1365
5 2229 2229 5 2229 2229 5 2229 2229 5
2229 
# 2230
a languag for treat geometr pattern in a two dimension
space in thi paper cadep a problem orient languag for
posit geometr pattern in a two dimension space is present
although the languag ha been specif design for the automat
gener of integr circuit mask it turn out to be
well suit also for such other placement problem as architectur
design urban plan logic and block diagram represent the design
criteria the structur and the specif featur of cadep ar
illustr cacm januari 1971 bracchi g ferrari d graphic languag
problem orient languag two dimension pattern graphic displai fortran extens
layout problem integr circuit architectur design urban plan 3 23
3 24 3 25 4 22 ca710104 jb februari 8
1978 11 17 am 2230 4 2230 2003 5 2230
2044 5 2230 2230 5 2230 2230 5 2230 2230
5 2230 996 6 2230 1558 6 2230 2230 6
2230 521 6 2230 
# 2231
the reconstruct of binari pattern from their project given the
horizont and vertic project of a finit binari pattern f
can we construct the origin pattern f in thi paper
we give a character of pattern that ar reconstruct from
their project three algorithm ar develop to reconstruct both unambigu
and ambigu pattern it is shown that an unambigu pattern
can be perfectli reconstruct in time m x n and
that a pattern similar to an ambigu pattern can also
be construct in time m x n where m n
ar the dimens of the pattern frame cacm januari 1971
chang s pattern reconstruct imag reconstruct data compress pattern recognit
integr geometri 3 63 5 30 ca710103 jb februari 8
1978 12 33 pm 2142 5 2231 2231 5 2231
2231 5 2231 2231 5 2231 2529 5 2231 1929
6 2231 2231 6 2231 2231 6 2231 
# 2232
pattern width at a given angl that the pattern featur
width as a function of angl possess sever possibl interpret
is demonstr in thi paper which is a review of
the width concept in pattern recognit and the geometr concept
itself the object of the work is to clarifi how
the word descript can be made precis so that comput
algorithm for featur extract mai be obtain the focu is
on the theoret subject matter the result consist of a
set theoret definit of width at angl a theorem relat
it to the pattern boundari radiu vector and descript of
altern width all width ar calcul for an illustr exampl
graphic and tabular comparison ar given substanti variat in width
at angl magnitud is found the princip conclus is that
the set theoret width at angl is a us pattern
featur when it can be easili comput further investig of
the inform contain in onli part of a width function
is recommend for case where comput of width at angl
is difficult cacm januari 1971 klinger a featur extract pattern
recognit figur properti pictur process integr geometri width at angl
extent integr project linear pattern measur width function 3 60
3 62 3 63 5 12 ca710102 jb februari 8
1978 12 49 pm 2232 5 2232 2232 5 2232
2232 5 2232 
# 2233
signatur simul and certain cryptograph code three cypher allegedli author
by thoma jefferson beal in 1822 have been the subject
of intens studi for over 100 year gener of cryptanalyst
have expend untold man year thu far without success attempt
tode code them vast armi of fortun hunter and treasur
seeker have devot herculean labor to dig up the roll
hill of virginia try to locat the promis bonanza the
histori of pertin activ would fill volum yet seriou student
of cryptographi have alwai had nag doubt about the cypher
authent it ha been alleg that the known solut to
cypher number two 115 73 24 818 37 52 49
i have deposit in the counti of bedford about four
mile from buford s in an excav or vault with
the aid of an unsanit version of the declar of
independ wa mere a superb imagin and grandios hoax perpetr
ag ago for whatev reason modern comput technolog could obvious
perform signatur analys the process of encod itself so as
to yield new clue and deeper insight into their construct
for the benefit of the uniniti the encod method us
in the second cypher emploi a specifi document whose word
ar simpli number consecut and first letter of these word
ar sought out at random to match the letter of
these word ar sought out at random to match the
letter of the clear text or messag the sequenc of
number correspond to these match is then written down as
the final code while primit the process ha the advantag
of rel secur until the sourc document becom known at
that moment the cypher can be decod even by second
grader the work now complet with the help of our
univac 1108 includ numer analyt studi of the beal cypher
and variou type of simul for exampl we have turn
the entir process of simul encod by variou scheme over
to the machin and analyz the signatur of these synthet
code we have also encod variou messag by hand us
differ text and a varieti of method to obtain their
signatur these simul provid convinc evid that the signatur ar
both process and data depend thei indic also veri strongli
that mr beal s cypher ar for real and that
it is mere a matter of time befor someon find
the correct sourc document and locat the right vault in
the common wealth of virginia cacm januari 1971 hammer c
thoma jefferson beal code cryptanalysi cypher decod declar of independ
encod magna carta pseudotext signatur simul 3 42 3 63
3 65 3 71 ca710101 jb februari 8 1978 1
15 pm 2233 5 2233 2233 5 2233 2233 5
2233 
# 2234
root of matrix pencil algorithm r405 cacm decemb 1972 heiberg
r m eigenvalu matrix root pencil root 5 1 5
3 ca721221 jb januari 27 1978 8 51 am 2234
5 2234 2234 5 2234 2234 5 2234 
# 2235
decis tabl translat algorithm r394 cacm decemb 1972 marshal d
r t decis tabl decis tabl translat 4 19 ca721220
jb januari 27 1978 8 53 am 2235 5 2235
2235 5 2235 2235 5 2235 
# 2236
remark on characterist valu and associ solut of mathieu differenti
equat exponenti integr and system of hyperbol p algorithm r352
r385 r392 cacm decemb 1972 frisch m j ansi fortran
standard 4 0 4 22 ca721219 jb januari 27 1978
8 56 am 2236 5 2236 2236 5 2236 2236
5 2236 
# 2237
bandsolv algorithm r195 cacm decemb 1972 schuegraf e ca721218 dmm
februari 2 1978 1 39 pm 2237 5 2237 2237
5 2237 2237 5 2237 
# 2238
least squar surfac fit algorithm r176 cacm decemb 1972 schuegraf
e ca721217 jb januari 27 1978 8 59 am 2238
5 2238 2238 5 2238 2238 5 2238 
# 2239
squank algorithm c379 cacm decemb 1972 hallet p mund e
numer integr integr rule adapt integr automat integr simpson s
rule numer quadratur quadratur rule adapt quadratur automat quadratur round
off error control 5 16 ca721216 jb januari 27 1978
9 01 am 2239 5 2239 2239 5 2239 2239
5 2239 
# 2240
pseudo random number g5 algorithm c266 cacm decemb 1972 sullin
w l pseudo random number test random number gener 5
5 ca721215 jb januari 27 1978 9 04 am 2240
5 2240 2240 5 2240 2240 5 2240 
# 2241
product type three point gauss legendr simpson s integr d1
algorithm a439 cacm decemb 1972 boland w r numer integr
product type quadratur gaussian quadratur simpson s rule 5 16
ca721214 jb januari 27 1978 9 06 am 2241 5
2241 2241 5 2241 2241 5 2241 
# 2242
product type two point gauss legendr simpson s integr d1
algorithm a438 cacm decemb 1972 boland w r numer integr
product type quadratur gaussian quadratur simpson s rule 5 16
ca721213 jb januari 27 1978 9 08 am 2242 5
2242 2242 5 2242 2242 5 2242 
# 2243
product type simpson s integr d1 algorithm a437 cacm decemb
1972 boland w r numer integr product type quadratur simpson
s rule 5 16 ca721212 jb januari 27 1978 9
10 am 2243 5 2243 2243 5 2243 2243 5
2243 
# 2244
product type trapezoid integr algorithm a436 cacm decemb 1972 boland
w r numer integr product type quadratur trapezoid integr 5
16 ca721211 jb januari 27 1978 9 11 am 2244
5 2244 2244 5 2244 2244 5 2244 
# 2245
trace driven model and analysi of cpu schedul in multiprogram
system microscop level job stream data obtain in a product
environ by an event driven softwar probe is us to
drive a model of a multiprogram comput system the cpu
schedul algorithm of the model is systemat vari thi techniqu
call trace driven model provid an accur replica of a
product environ for the test of variat in the system
at the same time alter in schedul method can be
easili carri out in a control wai with caus and
effect relationship be isol the schedul method test includ the
best possibl and worst possibl method the tradit method of
multiprogram theori round robin first come first serv etc and
dynam predictor the rel and absolut perform of these schedul
method ar given it is conclud that a success cpu
schedul method must be preemptiv and must prevent a given
job from hold the cpu for too long a period
cacm decemb 1972 sherman s baskett iii f brown j
c schedul cpu schedul multiprogram perform measur trace driven model
4 10 4 20 4 31 4 32 ca721210 jb
januari 27 1978 10 57 am 2245 5 2245 2245
5 2245 2245 5 2245 2571 5 2245 3072 5
2245 3119 5 2245 1713 6 2245 2219 6 2245
2245 6 2245 2245 6 2245 2245 6 2245 2375
6 2245 2798 6 2245 2849 6 2245 2859 6
2245 
# 2246
level of languag for portabl softwar an increas amount of
softwar is be implement in a portabl form a popular
wai of accomplish thi is to encod the softwar in
a special design machin independ languag and then to map
thi languag often us a macro processor into the assembl
languag of each desir object machin the design of the
machin independ languag is the kei factor in thi oper
thi paper discuss the rel merit of pitch thi languag
at a high level or a low level and present
some compar result cacm decemb 1972 brown p j portabl
softwar level of languag machin independ macro processor effici 4
12 4 21 4 22 ca721209 jb januari 27 1978
11 02 am 2246 5 2246 2246 5 2246 2246
5 2246 
# 2247
on the criteria to be us in decompos system into
modul thi paper discuss modular as a mechan for improv
the flexibl ad comprehens of a system while allow the
shorten of it develop time the effect of a modular
is depend upon the criteria us in divid the system
into modul a system design problem is present and both
a convent and unconvent decomposit ar describ it is shown
that the unconvent decomposit have distinct advantag for the goal
outlin the criteria us in arriv at the decomposit ar
discuss the unconvent decomposit if implement with the convent assumpt
that a modul consist of on or more subroutin will
be less effici in most case an altern approach to
implement which doe not have thi effect is sketch cacm
decemb 1972 parna d l softwar modul modular softwar engin
kwic index softwar design 4 0 ca721208 jb januari 27
1978 11 09 am 2247 5 2247 2247 5 2247
2247 5 2247 2480 5 2247 2738 5 2247 2867
5 2247 3004 5 2247 3030 5 2247 3155 5
2247 1425 6 2247 1749 6 2247 1749 6 2247
2080 6 2247 2204 6 2247 2204 6 2247 2247
6 2247 2247 6 2247 2247 6 2247 2247 6
2247 2247 6 2247 2247 6 2247 2356 6 2247
2356 6 2247 2356 6 2247 2379 6 2247 2456
6 2247 2457 6 2247 2651 6 2247 2777 6
2247 2958 6 2247 2972 6 2247 3073 6 2247
3186 6 2247 799 6 2247 
# 2248
a new method for the solut of the cauchi problem
for parabol equat an integr equat represent is given for
parabol partial differenti equat when the equat ar defin in
unbound domain as in the initi valu cauchi problem the
solut of the integr equat by the method of success
approxim ha inher advantag over other method error bound for
the method ar of order h 3 2 and h
7 2 hi the increment size depend on the finit
differ approxim involv cacm decemb 1972 moor j robinson p
parabol equat the cauchi problem method of success approxim 5
17 ca721207 jb januari 27 1978 11 13 am 2248
5 2248 2248 5 2248 2248 5 2248 
# 2249
a comparison of multivari normal gener three method for gener
outcom on multivari normal random vector with a specifi varianc
covari matrix ar present a comparison is made to determin
which method requir the least comput execut time and memori
space when util the ibm 360 67 all method us
as a basi a standard gaussian random number gener result
of the comparison indic that the method base on triangular
factor of the covari matrix gener requir less memori space
and comput time than the other two method cacm decemb
1972 barr d r sezak n l random number gener
normal distribut multivari normal distribut multivari normal gener 3 65
5 5 ca721206 jb januari 27 1978 11 19 am
1708 4 2249 1781 4 2249 1826 4 2249 1860
4 2249 1972 4 2249 2156 4 2249 2168 4
2249 2249 4 2249 2249 4 2249 2249 4 2249
2314 4 2249 2719 4 2249 2736 4 2249 2736
4 2249 2833 4 2249 3074 4 2249 1626 5
2249 1708 5 2249 1853 5 2249 2249 5 2249
2249 5 2249 2249 5 2249 
# 2250
comput method for sampl from the exponenti and normal distribut
corrigendum cacm decemb 1972 ahren j h dieter u ca721205
jb januari 27 1978 11 20 am 2250 5 2250
2250 5 2250 2250 5 2250 
# 2251
weight increment linear search for scatter tabl a new linear
search for hash tabl whose increment step is a function
of the kei be address is present comparison with known
method ar given in term of effici and comput complex
in particular the new method appli to tabl of size
n 2 r it allow full tabl search and practic
elimin primari cluster at a veri low cost cacm decemb
1972 luccio f linear search weight increment search scatter storag
hash tabl kei hash address cluster search length 3 73
3 74 4 9 ca721204 jb januari 27 1978 11
25 am 1676 4 2251 1682 4 2251 1728 4
2251 1860 4 2251 1860 4 2251 1973 4 2251
1973 4 2251 1973 4 2251 1973 4 2251 1992
4 2251 1992 4 2251 2018 4 2251 2018 4
2251 2018 4 2251 2032 4 2251 2033 4 2251
2033 4 2251 2107 4 2251 2107 4 2251 2109
4 2251 2109 4 2251 2138 4 2251 2203 4
2251 2203 4 2251 2203 4 2251 2203 4 2251
2251 4 2251 2251 4 2251 2251 4 2251 2251
4 2251 2251 4 2251 2251 4 2251 2359 4
2251 2524 4 2251 2530 4 2251 2534 4 2251
2537 4 2251 2543 4 2251 2543 4 2251 2543
4 2251 2543 4 2251 2543 4 2251 2552 4
2251 2559 4 2251 2559 4 2251 2559 4 2251
2573 4 2251 2573 4 2251 2573 4 2251 2770
4 2251 2770 4 2251 2770 4 2251 2770 4
2251 2974 4 2251 2991 4 2251 2991 4 2251
3053 4 2251 3053 4 2251 3053 4 2251 3053
4 2251 3083 4 2251 3083 4 2251 1785 5
2251 1786 5 2251 1973 5 2251 2018 5 2251
2107 5 2251 2109 5 2251 2251 5 2251 2251
5 2251 2251 5 2251 2974 5 2251 2109 6
2251 2251 6 2251 
# 2252
a method for increment compil languag with nest statement structur
a method of increment compil is present which appli especi
to program languag in which statement can be nest such
as algol and pl i the method permit edit of
the sourc languag us a gener purpos text editor and
increment process of chang without frequent recompil of entir routin
the essenti point of the method ar 1 the syntax
of the languag is restrict insof ar as which construct
mai occur on line 2 an intern data structur call
the skeleton is maintain to repres the statement structur 3
the recompil is partial batch in the sens that recompil
of modifi line doe not occur until the last of
a set of edit command ha been receiv and 4
the pars and compil ar factor into two part that
done on individu line and that done global to handl
the relationship between the line cacm decemb 1972 earlei j
caizergu p increment compil interact program languag 4 12 4
22 ca721203 jb januari 27 1978 1 04 pm 1086
4 2252 1132 4 2252 1234 4 2252 1263 4
2252 1265 4 2252 1270 4 2252 1323 4 2252
1358 4 2252 1379 4 2252 1380 4 2252 1396
4 2252 1453 4 2252 1464 4 2252 1484 4
2252 1491 4 2252 1498 4 2252 1541 4 2252
1565 4 2252 1613 4 2252 1614 4 2252 1767
4 2252 1781 4 2252 1781 4 2252 1781 4
2252 1787 4 2252 1824 4 2252 1825 4 2252
1860 4 2252 1860 4 2252 1945 4 2252 1988
4 2252 2083 4 2252 2178 4 2252 2179 4
2252 2252 4 2252 2252 4 2252 2252 4 2252
2252 4 2252 2325 4 2252 2341 4 2252 2546
4 2252 2594 4 2252 2645 4 2252 2652 4
2252 2684 4 2252 2842 4 2252 2929 4 2252
2934 4 2252 3069 4 2252 669 4 2252 679
4 2252 691 4 2252 761 4 2252 949 4
2252 989 4 2252 1358 5 2252 1496 5 2252
2155 5 2252 2252 5 2252 2252 5 2252 2252
5 2252 3184 5 2252 
# 2253
index rang for matrix calculi the paper describ a scheme
for symbol manipul of index express which aris as a
by product of the symbol manipul of express in the
matrix calculi describ by the author in a previou paper
thi scheme attempt program optim by transform the origin algorithm
rather than the machin code the goal is to automat
gener code for handl the tediou address calcul necessit by
complic data structur the paper is therefor preoccupi with index
by posit the relationship of index by name and index
by posit is discuss cacm decemb 1972 bayer r witzgal
c address calcul algorithm transform compil data structur index by
name index by posit index domain index map index rang
matrix express normal form program languag program optim rang oper
symbol manipul syntact analysi well form express 4 12 4
22 5 14 ca721202 jb januari 27 1978 1 12
pm 1614 4 2253 2253 4 2253 2253 4 2253
2254 4 2253 2557 4 2253 2081 5 2253 2253
5 2253 2253 5 2253 2253 5 2253 437 5
2253 
# 2254
dynam partit for arrai languag the classic process of partit
an arrai into subarrai is extend to a more us
arrai languag oper variou mode of partit ar defin for
differ type of arrai so that subarrai mai vari over
the origin arrai in a nearli arbitrari manner these definit
ar motiv with sever realist exampl to illustr the valu
of partit for arrai languag of gener interest is the
data structur for partit thi consist of dynam tree structur
which ar us to deriv and maintain the arrai control
inform these ar describ in suffici detail to be of
valu in the design of other arrai languag the descript
present in thi paper is implement in a new arrai
languag ol 2 current under develop at the univers of
illinoi cacm decemb 1972 phillip j r adam h c
dynam partit arrai partit arrai languag data structur tree structur
program languag design arrai control block partit control block 4
12 4 2 4 22 ca721201 jb januari 27 1978
1 20 pm 2253 4 2254 2254 4 2254 2081
5 2254 2254 5 2254 2254 5 2254 2254 5
2254 
# 2255
comment on moorer s music and comput composit cacm novemb
1972 smoliar s w artifici intellig heurist program model of
cognit process comput music comput composit music theori 3 44
3 65 ca721114 jb januari 27 1978 1 22 pm
2255 5 2255 2255 5 2255 2255 5 2255 
# 2256
further comment on dijkstra s concurr program control problem cacm
novemb 1972 eisenberg m a mcguir m r critic section
concurr program control multiprocess 4 32 ca721113 jb januari 27
1978 1 24 pm 1781 4 2256 2150 4 2256
2150 4 2256 2228 4 2256 2228 4 2256 2256
4 2256 2256 4 2256 2317 4 2256 2342 4
2256 2342 4 2256 2376 4 2256 2618 4 2256
2618 4 2256 3184 4 2256 1198 5 2256 1338
5 2256 2256 5 2256 2256 5 2256 2256 5
2256 2618 5 2256 1198 6 2256 1338 6 2256
1749 6 2256 2256 6 2256 
# 2257
a note on optim doubli chain tree cacm novemb 1972
kennedi s file search doubli chain tree binari search tree
3 73 3 74 5 32 5 6 ca721112 jb
januari 27 1978 1 26 pm 1050 4 2257 1935
4 2257 1936 4 2257 2017 4 2257 2032 4
2257 2257 4 2257 2257 4 2257 2257 4 2257
2257 4 2257 2360 4 2257 2360 4 2257 2360
4 2257 2451 4 2257 2451 4 2257 2452 4
2257 2452 4 2257 2556 4 2257 2765 4 2257
1831 5 2257 1936 5 2257 2257 5 2257 2257
5 2257 2257 5 2257 2360 5 2257 849 5
2257 
# 2258
addit result on kei to address transform techniqu a fundament
perform studi on larg exist format file cacm novemb 1972
lum v y yuen p s t hash hash techniqu
hash method hash code kei kei transform kei to address
transform direct address direct access method random random access file
organ file search scatter storag inform retriev 3 7 3
72 3 73 3 74 3 79 4 9 ca721111
jb januari 27 1978 1 31 pm 2258 4 2258
2319 4 2258 2313 4 2258 2359 4 2258 2437
4 2258 2552 4 2258 2781 4 2258 2860 4
2258 2991 4 2258 2203 5 2258 2258 5 2258
2258 5 2258 2258 5 2258 
# 2259
modifi incomplet gamma function s14 algorithm a435 cacm novemb 1972
fullerton w modifi incomplet gamma function incomplet gamma function chi
squar distribut function poisson distribut function 5 13 ca721110 jb
januari 27 1978 1 40 pm 2259 5 2259 2259
5 2259 2259 5 2259 
# 2260
exact probabl for r x c conting tabl g2 algorithm
a434 cacm novemb 1972 march d l probabl conting tabl
test of signific 3 5 5 5 ca721109 jb januari
27 1978 1 42 pm 2260 5 2260 2260 5
2260 2260 5 2260 
# 2261
an approxim method for gener symmetr random variabl a method
for gener valu of continu symmetr random variabl that is
rel fast requir essenti no comput memori and is easi
to us is develop the method which us a uniform
zero on random number sourc is base on the invers
function of the lambda distribut of turkei sinc it approxim
mani of the continu theoret distribut and empir distribut frequent
us in simul the method should be us to simul
practition cacm novemb 1972 ramberg j s schmeiser b w
simul mont carlo probabl statist approxim random variabl random number
moment distribut 5 5 8 1 ca721108 jb januari 27
1978 1 47 pm 2261 5 2261 2261 5 2261
2261 5 2261 2686 5 2261 2261 6 2261 
# 2262
garbag collect for virtual memori comput system in list process
there is typic a grow demand for space dure program
execut thi paper examin the practic implic of thi growth
within a virtual memori comput system propos two new garbag
collect techniqu for virtual memori system and compar them with
tradit method by discuss and by simul cacm novemb 1972
baecker h d garbag collect virtual memori list process page
segment page tabl 4 32 ca721107 jb januari 27 1978
1 50 pm 2262 5 2262 2262 5 2262 2262
5 2262 
# 2263
the convers of limit entri decis tabl to optim and
near optim flowchart two new algorithm two new algorithm for
deriv optim and near optim flowchart from limit entri decis
tabl ar present both take into account rule frequenc and
the time need to test condit on of the algorithm
call the optimum find algorithm lead to a flowchart which
truli minim execut time for a decis tabl in which
simpl rule ar alreadi contract to complex rule the other
on call the optimum approach algorithm requir mani fewer calcul
but doe not necessarili produc the optimum flowchart the algorithm
ar first deriv for treat decis tabl not contain an
els rule but the optimum approach algorithm is shown to
be equal valid for tabl includ such a rule both
algorithm ar compar with exist on and ar appli to
a somewhat larg decis tabl deriv from a real case
from thi comparison two conclus ar drawn 1 the optimum
approach algorithm will usual lead to better result than compar
exist on and will not requir more but usual less
comput time 2 in gener the greater comput effort need
for appli the optimum find algorithm will not be justifi
by the small reduct in execut time obtain cacm novemb
1972 verhelst m decis tabl flowchart preprocessor optim program search
3 50 3 59 4 19 4 29 4 49
5 31 ca721106 jb januari 27 1978 2 10 pm
2263 5 2263 2263 5 2263 2263 5 2263 2598
5 2263 2691 5 2263 2726 5 2263 3113 5
2263 1172 6 2263 1172 6 2263 1327 6 2263
1354 6 2263 1354 6 2263 1488 6 2263 1489
6 2263 1548 6 2263 1548 6 2263 2220 6
2263 2220 6 2263 2221 6 2263 2263 6 2263
2263 6 2263 2263 6 2263 2263 6 2263 2453
6 2263 2598 6 2263 2691 6 2263 2691 6
2263 2856 6 2263 
# 2264
deriv semant for some program languag construct the construct of
a simpl program languag ar introduc and describ inform in
term of valu and side effect a translat is defin
which translat the languag into flowchart for a simpl machin
the action of the machin in execut a flowchart is
defin a proof is construct that the effect of translat
and execut ani program can be express sole in term
of the valu and side effect of the program dure
the cours of construct the proof formal definit of the
concept of valu and side effect ar deriv in order
to make the proof rigor correct of the implement involv
check that the definit deriv in the step abov ar
an accept formal of the inform descript given in the
first step cacm novemb 1972 henderson p lambda calculu formal
descript program correct program languag semant 4 22 5 23
5 24 ca721105 jb januari 27 1978 2 19 pm
2264 5 2264 2264 5 2264 2264 5 2264 2470
5 2264 1303 6 2264 1469 6 2264 1834 6
2264 2264 6 2264 
# 2265
a model for type check most current program languag treat
comput over differ class of object e g number string
label and function for correct compil and execut the follow
question then aris is a program properli construct so that
it oper and operand ar compat the activ of answer
thi question is usual call type check thi paper attempt
to isol the notion of type check and present a
partial solut to the type check problem base on the
notion of abstract and applic of function in particular a
program is map into an express within a decid subset
of the lambda calculu which character the type relat within
the program and elimin all other inform the determin of
the type wise correct or incorrect of the program is
resolv by reduc it correspond lambda calculu express to on
of two normal form the constant correct for a type
wise correct program or the constant error an applic to
type check in algol 60 is made and the attend
problem face for ani notion of type check ar discuss
cacm novemb 1972 ledgard h f type check type lambda
calculu model for program languag syntax semant compil write languag
implement formal definit 4 12 4 22 5 2 5
21 5 23 ca721104 jb januari 27 1978 2 30
pm 2265 5 2265 2265 5 2265 2265 5 2265
# 2266
a highli parallel algorithm for approxim all zero of a
polynomi with onli real zero an algorithm is describ base
on newton s method which simultan approxim all zero of
a polynomi with onli real zero the algorithm which is
conceptu suitabl for parallel comput determin it own start valu
so that converg to the zero is guarante multipl zero
and their multipl ar readili determin at no point in
the method is polynomi deflat us cacm novemb 1972 patrick
m l parallel numer algorithm real polynomi real zero newton
s method start valu guarante converg 5 15 ca721103 jb
januari 27 1978 2 35 pm 2266 5 2266 2266
5 2266 2266 5 2266 2660 5 2266 2266 6
2266 
# 2267
algorithm to reveal properti of float point arithmet two algorithm
ar present in the form of fortran subroutin each subroutin
comput the radix and number of digit of the float
point number and whether round or chop is done by
the machin on which it is run the method ar
shown to work on ani reason float point comput cacm
novemb 1972 malcolm m a float point arithmet high level
languag philosophi of languag design 4 9 5 19 ca721102
jb januari 27 1978 2 39 pm 2267 5 2267
2267 5 2267 2267 5 2267 2647 5 2267 2792
5 2267 2267 6 2267 2267 6 2267 2647 6
2267 
# 2268
a compar studi of comput program for integr differenti equat
a studi compar the perform of sever comput program for
integr system of ordinari differenti equat is report the integr
method repres includ multistep method predictor corrector singl step method
rung kutta and extrapol method both polynomi and ration the
test procedur is describ togeth with the evalu criteria appli
a set of test problem on which the program were
test is includ in an appendix for the particular problem
and criteria us in the investig it wa found that
a program base on ration extrapol show the best perform
cacm novemb 1972 fox p ordinari differenti equat integr program
comparison certif valid 5 10 5 17 ca721101 jb januari
27 1978 2 45 pm 2268 5 2268 2268 5
2268 2268 5 2268 2567 5 2268 2268 6 2268
755 6 2268 
# 2269
tableless date convers algorithm r398 cacm octob 1972 robertson j
d date calendar fortran statement function arithmet statement function 3
15 4 9 5 9 ca721009 jb januari 27 1978
2 47 pm 2269 4 2269 3115 4 2269 2269
5 2269 2269 5 2269 2269 5 2269 785 5
2269 
# 2270
interpol and smooth curv fit base on local procedur e2
algorithm a433 cacm octob 1972 akima h interpol polynomi slope
of curv smooth curv fit 5 13 ca721008 jb januari
27 19782 49 pm 1845 4 2270 1900 4 2270
2083 4 2270 2154 4 2270 2270 4 2270 2693
4 2270 988 5 2270 2270 5 2270 2270 5
2270 2270 5 2270 2693 5 2270 2696 5 2270
988 6 2270 2270 6 2270 2270 6 2270 2696
6 2270 2693 6 2270 
# 2271
aesthet and the human factor in program corrigendum cacm octob
1972 ershov a p ca721007 jb januari 27 1978 2
51 pm 2271 5 2271 2271 5 2271 2271 5
2271 
# 2272
sort by natur select a famili of sort algorithm is
propos the member of which make fuller us of the
memori space and thu yield longer sort string extens simul
result ar present and variou implic and further applic ar
discuss cacm octob 1972 frazer w d wong c k
algorithm sort by replac select expect string length 5 31
ca721006 jb januari 27 1978 2 54 pm 1638 4
2272 1867 4 2272 2176 4 2272 2272 4 2272
2272 4 2272 1638 5 2272 2272 5 2272 2272
5 2272 2272 5 2272 677 5 2272 
# 2273
convers of decis tabl by rule mask method without rule
mask two algorithm for gener comput program from decis tabl
ar describ the algorithm allow handl limit entri extend entri
and mix entri tabl the algorithm ar base on the
rule mask method but need not have the mask at
execut time thei perform the logic oper immedi rather than
at the end of the interpret process execut time can
be consider reduc by instantli mark rule which ar not
applic algorithm 1 and 2 or condit which ar alreadi
test algorithm 2 the new algorithm combin to a certain
degre the advantag of mask method with those of tree
method cacm octob 1972 dath g decis tabl rule mask
rule mask method rule mask techniqu program gener 3 50
4 12 4 19 4 29 ca721005 jb januari 27
1978 3 02 pm 1354 4 2273 1354 4 2273
1354 4 2273 1488 4 2273 1488 4 2273 1684
4 2273 1994 4 2273 2053 4 2273 2053 4
2273 2053 4 2273 2053 4 2273 2220 4 2273
2220 4 2273 2220 4 2273 2220 4 2273 2221
4 2273 2273 4 2273 2273 4 2273 2273 4
2273 2273 4 2273 2273 4 2273 2273 4 2273
2453 4 2273 2453 4 2273 2453 4 2273 2453
4 2273 2517 4 2273 2598 4 2273 2598 4
2273 2726 4 2273 2726 4 2273 2726 4 2273
2726 4 2273 2856 4 2273 2856 4 2273 2856
4 2273 2856 4 2273 2856 4 2273 3034 4
2273 3113 4 2273 1172 5 2273 1237 5 2273
1327 5 2273 1354 5 2273 2053 5 2273 2220
5 2273 2273 5 2273 2273 5 2273 2273 5
2273 
# 2274
gener english discours from semant network a system is describ
for gener english sentenc from a form of semant net
in which the node ar word sens mean and the
path ar primarili deep case relat the grammar us by
the system is in the form of a network that
impos an order on a set of syntact transform that
ar express as lisp function the gener algorithm us the
inform in the semant network to select appropri gener path
through the grammar the system is design for us as
a comput tool that allow a linguist to develop and
studi method for gener surfac string from an underli semant
structur initi find with regard to form determin such as
voic form tens and mood some rule for embed sentenc
and some attent to pronomin substitut ar report the system
is program in lisp 1 5 and is avail from
the author cacm octob 1972 simmon r slocum j semant
net grammar deep case relat semant gener discours gener 3
42 3 65 ca721004 jb januari 27 1978 3 10
pm 2274 5 2274 2274 5 2274 2274 5 2274
2795 5 2274 1928 6 2274 1989 6 2274 2274
6 2274 
# 2275
integr equat of immunolog the invers of a particular integr
equat of the first fredholm kind is the basic problem
consid the strategi which yield success consist of three essenti
point 1 fit the known experiment data by a curv
with properti which deriv from properti of the as yet
unknown function 2 stabil the comput for the unknown function
by us singular valu decomposit 3 constrain the unknown function
approxim sinc it repres a probabl distribut to be nonneg
a number of test case ar present on set of
actual experiment data is analyz with the procedur present cacm
octob 1972 hanson r j integr equat of the first
kind nonneg constraint singular valu analysi 3 10 5 14
5 18 5 41 ca721003 jb januari 27 1978 3
37 pm 2275 5 2275 2275 5 2275 2275 5
2275 
# 2276
comput method for sampl from the exponenti and normal distribut
variou method ar known for transform uniformli distribut random number
into exponenti and normal distribut quantiti the most effici on
ar compar in term of memori requir and speed with
some new algorithm a number of procedur convert taylor seri
expans directli into sampl step an approach which mai be
us for sampl from ani continu distribut for the exponenti
distribut a definit recommend can be made wherea in the
case of the normal distribut there remain a choic between
slower and shorter algorithm and faster but space consum method
cacm octob 1972 ahren j h dieter u random number
pseudorandom normal distribut exponenti distribut exponenti distribut simul numer analysi
3 29 3 57 5 11 5 5 ca721002 jb
januari 27 1978 3 55 pm 1073 4 2276 2137
4 2276 2276 4 2276 2276 4 2276 1073 5
2276 1153 5 2276 2276 5 2276 2276 5 2276
2276 5 2276 2565 5 2276 1716 6 2276 2276
6 2276 
# 2277
demand page through util of work set on the maniac
ii a hardwar implement on the maniac ii comput of
the work set model for demand page as introduc by
den is discuss characterist of the maniac ii ar given
along with a descript of the basic demand page scheme
and the associ memori which ha been ad to the
maniac ii hardwar final a descript of the hardwar design
for implement of the work set model is discuss and
a specif of the action taken under variou condit which
mai aris dure the oper of the full work set
model demand page system is given cacm octob 1972 morri
j b demand page dynam storag alloc maniac ii memori
alloc on level store page page associ memori storag alloc
thrash virtual memori work set model 4 30 6 21
ca721001 jb januari 27 1978 4 06 pm 1879 4
2277 1884 4 2277 1892 4 2277 1901 4 2277
1901 4 2277 2085 4 2277 2095 4 2277 2095
4 2277 2218 4 2277 2277 4 2277 2277 4
2277 2297 4 2277 2319 4 2277 2329 4 2277
2358 4 2277 2365 4 2277 2373 4 2277 2380
4 2277 2434 4 2277 2499 4 2277 2501 4
2277 2582 4 2277 2669 4 2277 2828 4 2277
2863 4 2277 2881 4 2277 2928 4 2277 2996
4 2277 3006 4 2277 3067 4 2277 1751 5
2277 1754 5 2277 2277 5 2277 2277 5 2277
2277 5 2277 2928 5 2277 3127 5 2277 1751
6 2277 2080 6 2277 2277 6 2277 2277 6
2277 2380 6 2277 2522 6 2277 2569 6 2277
# 2278
on foster s inform storag and retriev us avl tree
cacm septemb 1972 tan k c binari tree search tree
inform storag inform retriev 3 70 3 73 3 74
ca720912 jb januari 27 1978 4 10 pm 2278 5
2278 2278 5 2278 2278 5 2278 2455 5 2278
2278 6 2278 2388 6 2278 
# 2279
a control for a braill termin cacm septemb 1972 rubinstein
r feldman j blind program aid braill braill charact set
braill charact translat braill comput commun braill comput termin braill
termin tactil comput commun tactil termin 1 59 4 41
6 35 ca720911 jb januari 27 1978 4 14 pm
2279 4 2279 1740 5 2279 2279 5 2279 2279
5 2279 2279 5 2279 
# 2280
comment on deadlock prevent method cacm septemb 1972 parna d
l habermann a n multiprogram time share schedul resourc alloc
deadlock interlock lockout deadli embrac knot 3 72 4 32
6 20 ca720910 jb januari 27 1978 4 16 pm
2228 4 2280 2280 4 2280 2280 4 2280 2379
4 2280 2379 4 2280 2482 4 2280 2482 4
2280 2500 4 2280 2740 4 2280 2851 4 2280
2920 4 2280 1877 5 2280 2228 5 2280 2280
5 2280 2280 5 2280 2280 5 2280 
# 2281
the eigen problem of block tridiagon matric cacm septemb 1972
khalil h m linear algebra eigenvalu and eigenvector partial differenti
equat 5 14 5 17 ca720909 jb januari 27 1978
4 18 pm 2281 5 2281 2281 5 2281 2281
5 2281 
# 2282
a comparison of float point summat method cacm septemb 1972
gregori j summat float point addit truncat error error propag
5 11 ca720908 jb januari 27 1978 4 20 pm
2183 4 2282 2282 4 2282 2282 4 2282 2860
4 2282 3083 4 2282 1328 5 2282 2049 5
2282 2282 5 2282 2282 5 2282 2282 5 2282
# 2283
thin algorithm on rectangular hexagon and triangular arrai in thi
report three thin algorithm ar develop on each for us
with rectangular hexagon and triangular arrai the approach to the
develop of each algorithm is the same pictori result produc
by each of the algorithm ar present and the rel
perform of the algorithm ar compar it is found that
the algorithm oper with the triangular arrai is the most
sensit to imag irregular and nois yet it will yield
a thin imag with an overal reduc number of point
it is conclud that the algorithm oper in conjunct with
the hexagon arrai ha featur which strike a balanc between
those of the other two arrai cacm septemb 1972 deutsch
e s thin algorithm rectangular hexagon triangular arrai imag process
skeleton 3 64 ca720907 jb januari 27 1978 4 25
pm 2283 5 2283 2283 5 2283 2283 5 2283
# 2284
solut of the matrix equat ax xb c f4 algorithm
a432 cacm septemb 1972 bartel r h stewart g w
linear algebra matric linear equat 5 14 ca720906 jb januari
27 1978 4 31 pm 2284 5 2284 2284 5
2284 2284 5 2284 
# 2285
comput routin for quadrat and linear program problem h algorithm
a431 a comput program base on lemk s complementari pivot
algorithm is present thi can be us to solv linear
and quadrat program problem the program ha been extens test
on a wide rang of problem and the result have
been extrem satisfactori cacm septemb 1972 ravindran a linear program
quadrat program complementari problem lemk s algorithm simplex method 5
41 ca720905 jb januari 27 1978 4 34 pm 2285
5 2285 2285 5 2285 2285 5 2285 
# 2286
automat error analysi for determin precis the problem consid is
that of evalu a ration express to within ani desir
toler on a comput which perform variabl precis float point
arithmet oper an automat error analysi techniqu is given for
determin directli from the result of a trial low precis
interv arithmet calcul just how much precis and data accuraci
ar requir to achiev a desir final accuraci the techniqu
given gener easili to the evalu of mani nonrat express
cacm septemb 1972 richman p l error analysi interv arithmet
precis control 5 11 ca720904 jb januari 27 1978 4
39 pm 2286 5 2286 2286 5 2286 2286 5
2286 2555 5 2286 2605 5 2286 1026 6 2286
2286 6 2286 2286 6 2286 
# 2287
a new approach to automat scan of contour map the
problem of automat digit of contour map is discuss the
structur of a gener contour map is analyz and it
topolog properti ar util in develop a new scan algorithm
the problem of detect and recognit of contour line is
solv by a two color label method it is shown
that for map contain normal contour line onli it suffic
to distinguish between so call even and odd line the
tangenc problem involv in practic scan is discuss and a
solut base on minim comput memori space and simplifi control
program is suggest cacm septemb 1972 mor m lamdan t
automat scan contour map digit contour line topolog detect and
recognit 3 14 3 19 6 35 6 36 ca720903
jb januari 27 1978 4 46 pm 2287 4 2287
2547 4 2287 3062 4 2287 1925 5 2287 2287
5 2287 2287 5 2287 2287 5 2287 
# 2288
file organ the consecut retriev properti the consecut retriev properti
is an import relat between a queri set and record
set it exist enabl the design of an inform retriev
system with a minim search time and no redund storag
some import theorem on the consecut retriev properti ar prove
in thi paper condit under which the consecut retriev properti
exist and remain invari have been establish an outlin for
design an inform retriev system base on the consecut retriev
properti is also discuss cacm septemb 1972 ghosh s p
file organ consecut storag consecut retriev inform retriev record organ
queri structur record structur storag on tape storag space minimum
access time 3 70 3 73 3 74 ca720902 jb
januari 27 1978 4 52 pm 2288 5 2288 2288
5 2288 2288 5 2288 2729 5 2288 2288 6
2288 2801 6 2288 
# 2289
cellular arrai for the solut of graph problem a cellular
arrai is a two dimension checkerboard type interconnect of ident
modul or cell where each cell contain a few bit
of memori and a small amount of combin logic and
commun mainli with it immedi neighbor in the arrai the
chief comput advantag offer by cellular arrai is the improv
in speed achiev by virtu of the possibl for parallel
process in thi paper it is shown that cellular arrai
ar inher well suit for the solut of mani graph
problem for exampl the adjac matrix of a graph is
easili map onto an arrai each matrix element is store
in on cell of the arrai and typic row and
column oper ar readili implement by simpl cell logic a
major challeng in the effect us of cellular arrai for
the solut of graph problem is the determin of algorithm
that exploit the possibl for parallel especi for problem whose
solut appear to be inher serial in particular sever parallel
algorithm ar present for the solut of certain span tree
distanc and path problem with direct applic to wire rout
pert chart analysi and the analysi of mani type of
network these algorithm exhibit a comput time that in mani
case grow at a rate not exceed log2 n where
n is the number of node in the graph straightforward
cellular implement of the well known serial algorithm for these
problem requir about n step and noncellular implement requir from
n 2 to n 3 step cacm septemb 1972 levitt
k n kautz w h graph theori cellular logic in
memori arrai parallel process special purpos comput algorithm for distanc
and span tree problem 5 32 6 22 6 5
ca720901 jb januari 30 1978 9 16 am 2289 5
2289 2289 5 2289 2289 5 2289 3075 5 2289
3156 5 2289 2289 6 2289 2289 6 2289 2557
6 2289 2664 6 2289 2714 6 2289 2973 6
2289 3075 6 2289 
# 2290
immedi predomin in a direct graph h algorithm a430 cacm
august 1972 purdom jr p w moor e f predomin
immedi predomin graph theori direct graph shortest path articul connect
program optim optim compil 4 12 5 32 ca720812 jb
januari 30 1978 9 19 am 1807 4 2290 2034
4 2290 2290 4 2290 2579 4 2290 2923 4
2290 2945 4 2290 1947 5 2290 2290 5 2290
2290 5 2290 2290 5 2290 
# 2291
local of the root of a polynomi c2 algorithm a429
cacm august 1972 squir w polynomi root of polynomi theori
of equat routh hurwitz criterion 5 15 ca720811 jb januari
30 1978 9 21 am 2291 5 2291 2291 5
2291 2291 5 2291 
# 2292
a note on the gener of rosari permut cacm august
1972 read r c permut permut gener 5 39 ca720810
jb januari 30 1978 9 24 am 2292 4 2292
2505 4 2292 2189 5 2292 2292 5 2292 2292
5 2292 2292 5 2292 2505 5 2292 2189 6
2292 2292 6 2292 521 6 2292 
# 2293
comment on averag binari search length cacm august 1972 jone
p r search binari search record retriev 3 74 ca720809
jb januari 30 1978 9 26 am 2293 4 2293
2157 5 2293 2293 5 2293 2293 5 2293 2293
5 2293 
# 2294
a bonu from van wijngaarden s devic cacm august 1972
morri jr j h non local transfer procedur return 4
12 4 13 4 22 ca720808 jb januari 30 1978
9 27 am 2060 4 2294 2155 4 2294 2294
4 2294 2294 4 2294 2470 4 2294 2558 4
2294 2842 4 2294 3077 4 2294 3124 4 2294
3150 4 2294 1469 5 2294 2060 5 2294 2294
5 2294 2294 5 2294 2294 5 2294 
# 2295
comment on the composit of semant in algol 68 cacm
august 1972 van der poel w l program primit program
languag algol semant recurs composit design of program languag data
structur 1 3 4 2 4 22 5 23 5
24 ca720807 jb januari 30 1978 9 29 am 2295
5 2295 2295 5 2295 2295 5 2295 
# 2296
compil fix point multipl cacm august 1972 bernstein h j
compil multipl fix point arithmet 4 12 ca720806 jb januari
30 1978 9 42 am 2296 4 2296 2952 4
2296 2185 5 2296 2296 5 2296 2296 5 2296
2296 5 2296 
# 2297
a model of memori content in a page machin thi
paper is concern with certain aspect of content for main
memori resourc in a multiprogram comput system oper under demand
page in the model present the number of page frame
of main memori alloc to a problem program vari in
time these chang in memori configur ar repres explicitli in
the model cpu requir and page except characterist of program
materi be describ statist express for the distribut of the
number of page frame alloc to an execut program the
long run expect fraction of a program s execut time
in a given number of page frame and the averag
execut interv of the multiprogram load ar obtain it is
point out heurist and demonstr numer that an increas is
obtain abl in the averag execut interv of the multiprogram
load over that result from equal fix partit of main
memori cacm august 1972 oden p h shedler g s
page machin demand page oper system studi queu analysi memori
content memori manag 4 32 ca720805 jb januari 30 1978
9 50 am 1879 4 2297 1884 4 2297 1892
4 2297 1901 4 2297 1924 4 2297 2095 4
2297 2095 4 2297 2218 4 2297 2277 4 2297
2297 4 2297 2297 4 2297 2365 4 2297 2374
4 2297 2526 4 2297 2667 4 2297 2668 4
2297 2862 4 2297 2863 4 2297 1728 5 2297
1754 5 2297 2297 5 2297 2297 5 2297 2297
5 2297 
# 2298
an environ for research in microprogram and emul the develop
of the research project in microprogram and emul at state
univers of new york at buffalo consist of three phase
the evalu of variou possibl machin to support thi research
the decis to purchas on such machin which appear to
be superior to the other consid and the organ and
definit of goal for each group in the project each
of these phase is report with emphasi place on the
earli result achiev in thi research cacm august 1972 rosin
r f frieder g eckhous jr r h microprogram emul
comput system languag processor input output system nano program project
manag hardwar evalu 4 1 4 2 4 3 6
2 ca720804 jb januari 30 1978 9 55 am 2298
5 2298 2298 5 2298 2298 5 2298 3144 5
2298 1471 6 2298 2298 6 2298 2491 6 2298
2597 6 2298 2624 6 2298 2625 6 2298 2632
6 2298 
# 2299
an extens editor for a small machin with disk storag
a design philosophi for develop a sophist util program is
illustr by the actual design and implement of a text
editor a versatil data structur is emploi so that onli
a small number of program subroutin ar necessari for all
type of data manipul such a data structur is describ
and it merit ar illustr by the eas with which
power extens can be implement in term of a few
basic edit function cacm august 1972 benjamin a j command
process context search execut program garbag collect interpret list process
macro languag page paramet substitut recurs state tabl storag alloc
string manipul text edit virtual memori 3 73 3 74
3 75 4 13 4 22 4 43 4 49
ca720803 jb januari 30 1978 10 00 am 1626 4
2299 1708 4 2299 1781 4 2299 1860 4 2299
2299 4 2299 2299 4 2299 2501 4 2299 2629
4 2299 2915 4 2299 3114 4 2299 1502 5
2299 1641 5 2299 2299 5 2299 2299 5 2299
2299 5 2299 
# 2300
polit redistrict by comput the problem of polit redistrict ar
consid and a comput method for redistrict is present criteria
for accept redistrict ar discuss includ popul equal compact contigu
and preserv of natur and or polit boundari onli nonpartisan
criteria ar consid us 1970 bureau of censu popul data
specif result ar given for the ten congression district in
the state of missouri and for the seven st loui
counti council seat result from the us of the algorithm
indic the feasibl of polit redistrict with the aid of
a comput cacm august 1972 helbig r e orr p
k roedig r r polit redistrict reapportion compact equal popul
contigu transport algorithm legisl district popul unit 2 12 3
35 5 41 ca720802 jb januari 30 1978 10 14
am 2300 5 2300 2300 5 2300 2300 5 2300
# 2301
gener parser for affix grammar affix grammar ar two level
grammar which ar similar to van wijngaarden s two level
grammar us in the definit of algol 68 affix grammar
ar shown by koster to be equal in power to
van wijngaarden grammar thei ar much more suit to pars
than ar the latter howev koster the inventor of affix
base on recurs procedur thi paper present a bottom up
scheme for pars them base on an extens of floyd
product languag fpl includ is an algorithm similar to that
of derem s for convert a larg class of affix
grammar into fpl the paper conclud by discuss briefli the
applic of the convers algorithm and affix grammar in gener
and some possibl extens to koster s definit of affix
grammar cacm august 1972 crow d algorithm languag process bottom
up pars floyd product languag pars syntax direct compil translat
write system two level grammar 3 42 4 12 4
13 4 20 5 23 ca720801 jb januari 30 1978
10 21 am 2301 5 2301 2301 5 2301 2301
5 2301 2886 5 2301 2301 6 2301 
# 2302
comput and employ the relationship of comput and autom to
employ is part of the more gener relat of technolog
chang to employ the most obviou effect is that increas
in product due to technolog can elimin job technolog affect
the individu worker in the natur and amount of hi
work and in hi attitud toward that work technolog chang
affect the occup structur of the entir labor forc becaus
of the central import of these effect the impact of
technolog ha been the subject of extens studi by economist
sociologist polit scientist and psychologist even within a singl disciplin
studi ar often contradictori and conclus ar color by polit
overton we wish to delin some of the issu and
present argument given to support differ viewpoint cacm juli 1972
borodin a gotlieb c c employ unemploy social implic attitud
skill obsolesc technolog union displac 2 1 ca720726 jb januari
30 1978 10 30 am 2302 5 2302 2302 5
2302 2302 5 2302 3011 5 2302 2075 6 2302
2302 6 2302 2345 6 2302 2485 6 2302 
# 2303
archaeolog of comput reminisc 1945 1947 the period preced the
found of acm wa domin by the first larg comput
eniac it characterist describ here foreshadow later develop cacm juli
1972 alt f l histori of comput 1 2 ca720725
jb januari 30 1978 10 36 am 2303 5 2303
2303 5 2303 2303 5 2303 
# 2304
a western view of comput histori mani u histori of
the digit comput field have tend to be imperson with
heavi emphasi on eastern univers and commerci develop thi articl
record the event of the earli year in a person
wai the peopl organ technolog and comput of the 1945
55 period in the western part of the unit statesar
describ as thei happen cacm juli 1972 spragu r e
histori comput histori 1 2 6 0 ca720724 jb januari
30 1978 10 40 am 2304 5 2304 2304 5
2304 2304 5 2304 
# 2305
the plankalkul of konrad zuse a forerunn of todai s
program languag plankalkul wa an attempt by korrad zuse in
the 1940 s to devis a notat and conceptu system
for write what todai is term a program although thi
earli approach to a program languag did not lead to
practic us the plan is describ here becaus it contain
featur that ar standard in todai s program languag the
investig is of histor interest also it mai provid insight
that would lead to advanc in the state of the
art us modern program terminolog the plankalkul is present to
the extent it ha possibl to reconstruct it from the
publish literatur cacm juli 1972 bauer f l wossner h
higher program languag program theori of program histori of program
1 2 4 22 5 29 ca720723 jb januari 30
1978 10 46 am 2305 5 2305 2305 5 2305
2305 5 2305 
# 2306
ancient babylonian algorithm the earli origin of mathemat ar discuss
emphas those aspect which seem to be of greatest interest
from the standpoint of comput scienc a number of old
babylonian tablet mani of which have never befor been translat
into english ar quot cacm juli 1972 knuth d e
histori of comput babylonian tablet sexagesim number system sort 1
2 ca720722 jb januari 30 1978 10 50 am 2306
5 2306 2306 5 2306 2306 5 2306 
# 2307
dynam document process the current role of comput in automat
document process is briefli outlin and some reason ar given
why the earli promis of librari autom and of the
mechan of document process ha not been fulfil a new
dynam document environ is then outlin in which cluster file
ar search and inform is retriev follow an interact user
control search process method ar describ for an automat queri
modif base on user need and for a continu reorgan
of the store inform as a function of earlier file
process and of normal collect growth the propos procedur provid
power tool for inform retriev and for the control of
dynam librari collect in which new item ar continu ad
and old on ar retir cacm juli 1972 salton g
automat index automat search and retriev iter search mechan librari
process collect growth collect retir feedback search 3 62 3
71 3 73 3 74 ca720721 jb januari 30 1978
10 59 am 2307 5 2307 2307 5 2307 2307
5 2307 
# 2308
comput and urban societi thi brief survei of the us
of comput in urban societi cover the broad rang of
activ found in ani citi the futur scope of applic
is limit onli by the imagin and invent of futur
system design programm analyst and decis maker the comput can
be if properli us with respect for human digniti and
civil liberti a signific factor in improv the effici of
the urban process it is expect that the benefit of
such comput usag will outweigh the cost and that we
mai look forward to an expans of such usag cacm
juli 1972 sturman g m urban system urban applic data
acquisit data manag engin analysi inform system 3 23 3
39 3 53 3 72 3 82 3 89 ca720720
jb januari 30 1978 11 05 am 2308 5 2308
2308 5 2308 2308 5 2308 
# 2309
comput in the instruct process direct for research and develop
a survei is given of comput applic to the instruct
process which suggest how the comput profession can contribut to
effect educ system cacm juli 1972 zinn k l educ
1 5 3 32 ca720719 jb januari 30 1978 11
13 am 2127 4 2309 2309 4 2309 2309 4
2309 2310 4 2309 2396 4 2309 1856 5 2309
2309 5 2309 2309 5 2309 2309 5 2309 2398
5 2309 
# 2310
languag analysi in the human the us of the comput
in the languag orient human for exhaust list of detail
as in indic and concord is widespread and accept as
desir the implic of the comput for a scienc of
the human a scienc entail gather data for the construct
and test of model ar neither wide recogn nor accept
thi paper argu that the comput s major role as
to languag analysi in the human will be the establish
of such a sciencehu for those area of the human
for which rigor and precis ar necessari e g analyz
literatur or teach a student to write a composit the
comput can be a critic import facilit cacm juli 1972
sedelow s y languag analysi human scienc of the human
pattern recognit pattern gener interdisciplinari cooper 1 3 2 19
3 42 3 43 ca720718 jb januari 30 1978 11
19 am 2127 4 2310 2309 4 2310 2310 4
2310 2396 4 2310 1856 5 2310 2310 5 2310
2310 5 2310 2310 5 2310 
# 2311
a gener perspect of inform system develop system develop is
categor from a gener point of view that parallel the
commonli describ comput system gener for each gener the scope
of develop project and the technolog world view of the
system develop ar examin cacm juli 1972 benjamin r i
comput milieu manag data process hardwar system softwar system system
develop process function system manag system 2 0 3 50
4 0 6 20 ca720717 jb januari 30 1978 11
22 am 2311 5 2311 2311 5 2311 2311 5
2311 
# 2312
on the present and futur of scientif comput a pessimist
forecast is given of what can be expect to happen
in the applic of comput to the physic scienc cacm
juli 1972 rice j r scientif comput 3 1 5
0 ca720716 jb januari 30 1978 11 24 am 2312
5 2312 2312 5 2312 2312 5 2312 
# 2313
the evolut of storag structur data base manag system have
grown rapidli in their power and complex over the 15
year histori of data process on commerci avail comput the
origin concept have split and new term have been adopt
to name and refer to these concept the data structur
diagram graphic techniqu is us to illustr the split of
the concept and the structur relat which exist between these
concept at each point in the evolut cacm juli 1972
bachman c w block cylind devic field extent file page
record physic record logic record track volum entiti set entiti
class set class data structur diagram storag structur physic storag
structur logic storag structur storag alloc structur integr data store
index sequenti hash random item 1 4 4 41 4
9 ca720715 jb januari 30 1978 1 16 pm 2258
4 2313 2319 4 2313 2313 4 2313 2359 4
2313 2437 4 2313 2552 4 2313 2781 4 2313
2860 4 2313 2991 4 2313 2203 5 2313 2313
5 2313 2313 5 2313 2313 5 2313 2425 5
2313 2313 6 2313 
# 2314
requir for advanc program system for list process list process
system should be design to facilit product of larg program
to manipul larg complex symbol data store thi paper present
an overview of a number of system featur which the
author feel ar import to improv the product of programm
work in such domain a system view it taken rather
than focus just on languag featur sinc algorithm must be
not onli code in a languag form but debug modifi
made effici and run on data becaus of thi gener
framework the requir specifi ar applic to the design of
advanc program system for a wide rang of applic three
aspect of program system ar highlight good interact facil programm
control structur and sophist data commun mechan interact featur ar
describ to facilit program composit entri test debug edit optim
and packag implement of a gener environ structur model specifi
would allow program of variou control regim includ multiprocess coroutin
and backtrack altern method of procedur invoc requir includ invoc
by pattern and by monitor condit the need for extend
data form storag manag and extens ar stress as is
the dualiti of data retriev and function evalu syntax direct
input and output of data would facilit us of complex
data store cacm juli 1972 bobrow d g list process
program languag design of program languag interact system control structur
data structur program primit semant advanc program system 1 3
4 2 4 22 4 3 4 32 5 23
5 24 ca720714 jb januari 30 1978 1 30 pm
1570 4 2314 1708 4 2314 1781 4 2314 1826
4 2314 1860 4 2314 1945 4 2314 2156 4
2314 2168 4 2314 2249 4 2314 2314 4 2314
2314 4 2314 2314 4 2314 2314 4 2314 2317
4 2314 2719 4 2314 2736 4 2314 2833 4
2314 2842 4 2314 1098 5 2314 1626 5 2314
2082 5 2314 2148 5 2314 2314 5 2314 2314
5 2314 2314 5 2314 2438 5 2314 1826 6
2314 2314 6 2314 
# 2315
the product of better mathemat softwar some observ ar made
on step to be taken toward the creation of better
mathemat softwar these step suggest the need for a coordin
effort and the creation of a center to focu activ
in thi area cacm juli 1972 fosdick l d mathemat
softwar program 4 0 ca720713 jb januari 30 1978 1
32 pm 1330 4 2315 1348 4 2315 1986 4
2315 2021 4 2315 2222 4 2315 2227 4 2315
2315 4 2315 2315 4 2315 2315 4 2315 2315
4 2315 2326 4 2315 2470 4 2315 2732 4
2315 2865 4 2315 2896 4 2315 2943 4 2315
3014 4 2315 3068 4 2315 3077 4 2315 3143
4 2315 1348 5 2315 1834 5 2315 1987 5
2315 2315 5 2315 2315 5 2315 2315 5 2315
728 5 2315 
# 2316
program languag histori and futur thi paper discuss both the
histori and futur of program languag higher level languag some
of the difficulti in write such a histori ar indic
a kei part of the paper is a tree show
the chronolog develop of languag and their interrelationship reason for
the prolifer of languag ar given the major languag ar
list with the reason for their import a section on
chronolog indic the happen of the signific previou time period
and the major topic of 1972 kei concept other than
specif languag ar discuss cacm juli 1972 sammet j e
program languag higher level languag languag histori futur direct languag
interrelationship program languag tree program languag histori program languag futur
1 2 4 2 ca720712 jb januari 30 1978 1
38 pm 2316 5 2316 2316 5 2316 2316 5
2316 
# 2317
program system and languag 1965 1975 in spite of impress
gain by pl i fortran and cobol remain the languag
in which most of the world s product program ar
written and will remain so into the forese futur there
is a great deal of theoret interest in algol 68
and in extens languag but so far at least thei
have had littl practic impact problem orient languag mai veri
well becom the most import languag develop area in the
next five to ten year in the oper system area
all major comput manufactur set out to produc veri ambiti
multiprogram system and thei all ran into similar problem a
number of univers project though not directli compar to those
of the manufactur have contribut greatli to a better understand
of oper system principl import trend includ the increas interest
in the develop of system measur and evalu techniqu and
increas us of microprogram for some program system function cacm
juli 1972 rosen s languag oper system program system multiprogram
histori 1 2 4 22 4 32 ca720711 jb januari
30 1978 1 47 pm 1665 4 2317 1768 4
2317 1781 4 2317 1787 4 2317 1805 4 2317
1824 4 2317 1825 4 2317 1828 4 2317 1836
4 2317 1846 4 2317 1854 4 2317 1861 4
2317 1877 4 2317 1892 4 2317 1960 4 2317
2015 4 2317 2110 4 2317 2126 4 2317 2127
4 2317 2150 4 2317 2150 4 2317 2187 4
2317 2188 4 2317 2218 4 2317 2228 4 2317
2256 4 2317 2314 4 2317 2317 4 2317 2317
4 2317 2317 4 2317 2317 4 2317 2317 4
2317 2317 4 2317 2317 4 2317 2317 4 2317
2319 4 2317 2358 4 2317 2377 4 2317 2342
4 2317 2342 4 2317 2376 4 2317 2376 4
2317 2379 4 2317 2424 4 2317 2482 4 2317
2545 4 2317 2546 4 2317 2618 4 2317 2618
4 2317 2625 4 2317 2632 4 2317 2698 4
2317 2704 4 2317 2723 4 2317 2733 4 2317
2738 4 2317 2740 4 2317 2741 4 2317 2842
4 2317 2867 4 2317 3184 4 2317 3184 4
2317 1198 5 2317 1572 5 2317 1693 5 2317
1749 5 2317 1753 5 2317 1781 5 2317 2126
5 2317 2148 5 2317 2317 5 2317 2317 5
2317 2317 5 2317 2874 5 2317 1682 6 2317
2227 6 2317 2317 6 2317 2683 6 2317 2871
6 2317 521 6 2317 
# 2318
the role of comput system model in perform evalu model
constitut a us mean of investig comput system perform thi
paper examin the interrelationship between model and other method for
evalu the perform of comput system and establish circumst under
which the us of a model is appropri cacm juli
1972 kimbleton s r model evalu perform analyt model simul
model system model 2 43 2 44 6 2 8
3 ca720710 jb januari 30 1978 2 03 pm 2151
4 2318 2318 4 2318 1653 5 2318 2318 5
2318 2318 5 2318 2318 5 2318 
# 2319
oper system perform an overview of the current and futur
posit with respect to oper system perform is given while
a great deal of inform and a larg number of
model for subsystem have been develop gap still exist in
out knowledg becaus of the sever interact between the variou
subsystem of an oper system an overal model of the
total system must be develop to be abl to analyz
and design the perform aspect of an oper system although
such total system design ar except todai it is project
that thei will becom increasingli more common and necessari in
the near futur such a design philosophi will clearli have
a sever impact on the wai we go about modular
oper and comput system cacm juli 1972 lynch w c
comput system oper system perform evalu perform measur measur techniqu
modular layer structur program page virtual memori input output disk
storag facil drum storag facil sector queue 4 30 6
20 ca720709 jb januari 30 1978 2 33 pm 1828
4 2319 1854 4 2319 1877 4 2319 1892 4
2319 1901 4 2319 1960 4 2319 2085 4 2319
2095 4 2319 2150 4 2319 2193 4 2319 2218
4 2319 2258 4 2319 2277 4 2319 2317 4
2319 2319 4 2319 2319 4 2319 2319 4 2319
2319 4 2319 2319 4 2319 2319 4 2319 2319
4 2319 2319 4 2319 2319 4 2319 2319 4
2319 2313 4 2319 2329 4 2319 2358 4 2319
2377 4 2319 2378 4 2319 2373 4 2319 2359
4 2319 2342 4 2319 2376 4 2319 2379 4
2319 2380 4 2319 2320 4 2319 2424 4 2319
2434 4 2319 2437 4 2319 2482 4 2319 2499
4 2319 2480 4 2319 2501 4 2319 2552 4
2319 2582 4 2319 2582 4 2319 2594 4 2319
2618 4 2319 2632 4 2319 2632 4 2319 2669
4 2319 2669 4 2319 2704 4 2319 2709 4
2319 2723 4 2319 2738 4 2319 2738 4 2319
2740 4 2319 2740 4 2319 2741 4 2319 2781
4 2319 2828 4 2319 2860 4 2319 2863 4
2319 2867 4 2319 2868 4 2319 2881 4 2319
2894 4 2319 2928 4 2319 2939 4 2319 2972
4 2319 2991 4 2319 2996 4 2319 3006 4
2319 3054 4 2319 3067 4 2319 3127 4 2319
3155 4 2319 3184 4 2319 1408 5 2319 1719
5 2319 1749 5 2319 1751 5 2319 2016 5
2319 2017 5 2319 2080 5 2319 2188 5 2319
2203 5 2319 2204 5 2319 2319 5 2319 2319
5 2319 2319 5 2319 
# 2320
structur multiprogram thi paper present a propos for structur represent
of multiprogram in a high level languag the notat us
explicitli associ a data structur share by concurr process with
oper defin on it thi clarifi the mean of program
and permit a larg class of time depend error to
be caught at compil time a combin of critic region
and event variabl enabl the programm to control schedul of
resourc among compet process to ani degre desir these concept
ar suffici safe to us not onli within oper system
but also within user program cacm juli 1972 hansen p
b structur multiprogram program languag oper system concurr process share
data mutual exclus critic region process commun synchron event 4
2 4 3 ca720708 jb januari 30 1978 2 39
pm 2319 4 2320 2378 4 2320 2320 4 2320
2320 4 2320 2597 4 2320 2632 4 2320 2738
4 2320 2740 4 2320 2777 4 2320 2851 4
2320 2868 4 2320 2895 4 2320 2912 4 2320
2946 4 2320 3127 4 2320 3128 4 2320 2080
5 2320 2150 5 2320 2320 5 2320 2320 5
2320 2320 5 2320 2597 5 2320 2150 6 2320
2320 6 2320 
# 2321
on the interfac between comput and data commun system futur
system that combin comput digit termin and commun equip present
design optim problem that requir reconsider of the tradit function
respons of the respect subsystem sever standard interfac by mean
of which comput and digit termin connect to the commun
system will be requir when specifi these interfac consider must
be given to problem of coordin synchron error control signal
stream multiplex and switch control in addit to minim the
technolog interdepend of specif subsystem design a focu on some
of the problem is obtain in a discuss of a
detail specif for a particular comput commun system interfac cacm
juli 1972 fraser a g commun standard interfac commun protocol
virtual channel multiplex input output coordin of input output 3
81 6 0 6 35 ca720707 jb januari 30 1978
2 46 pm 2321 5 2321 2321 5 2321 2321
5 2321 
# 2322
a view of comput architectur an attempt is made to
predict the develop of the next 25 year in the
field of comput architectur standard inexpens microcomput on a singl
chip ar predict these will be us extens to provid
logic function for noncomput devic and incident for the design
of superscal comput cacm juli 1972 foster c c comput
architectur project microcomput comput design comput organ 1 2 2
1 6 0 6 2 ca720706 jb januari 30 1978
3 00 pm 2322 5 2322 2322 5 2322 2322
5 2322 
# 2323
toward a gener theori of special function a list of
a number of natur develop for the field of algebra
manipul is given then the prospect for a gener theori
of function defin by ordinari differenti equat ar discuss the
claim is made that recent develop in mathemat indic that
it should be possibl to algorithm gener mani properti of
solut to differenti equat such a theori is prefer to
a less gener effort to make algebra manipul system knowledg
about the usual special function e g exponenti hypergeometr cacm
juli 1972 mose j algebra manipul special function algebra simplif
symbol integr algebra geometri differenti algebra 1 50 3 15
5 19 5 9 ca720705 jb januari 30 1978 3
07 pm 2164 4 2323 2170 4 2323 2323 4
2323 2323 4 2323 2323 4 2323 2719 4 2323
2167 5 2323 2164 5 2323 2170 5 2323 2323
5 2323 2323 5 2323 2323 5 2323 
# 2324
manag scienc a view from nonlinear program a brief histori
of integ and continu nonlinear program is present as well
as the current obstacl to practic us of these mathemat
program techniqu it is forecast that the us contribut to
nonlinear program actual made in the next few year ar
more like to be consolid than theoret breakthrough these contribut
ar like to be the document of standard test problem
construct of user orient softwar and comparison of current known
algorithm to demonstr which techniqu ar best for specif problem
cacm juli 1972 shanno d f weil r l integ
program linear program mathemat program nonlinear program quadrat program manag
scienc oper research algorithm 5 41 8 3 ca720704 jb
januari 30 1978 3 14 pm 2324 5 2324 2324
5 2324 2324 5 2324 
# 2325
numer mathemat and comput scienc numer mathemat is view as
the analysi of continu algorithm four of the compon of
numer mathemat ar discuss these ar foundat finit precis number
system comput complex synthesi and analysi of algorithm analysi of
error program and program librari cacm juli 1972 traub j
f numer mathemat comput scienc mathemat of comput algorithm continu
algorithm 1 3 5 0 5 1 5 25 ca720703
jb januari 30 1978 3 17 pm 1086 4 2325
1132 4 2325 1234 4 2325 1263 4 2325 1265
4 2325 1270 4 2325 1323 4 2325 1358 4
2325 1379 4 2325 1380 4 2325 1453 4 2325
1464 4 2325 1484 4 2325 1491 4 2325 1498
4 2325 1613 4 2325 1614 4 2325 1781 4
2325 1825 4 2325 1860 4 2325 2083 4 2325
2178 4 2325 2179 4 2325 2252 4 2325 2325
4 2325 2341 4 2325 2546 4 2325 2645 4
2325 2652 4 2325 2684 4 2325 2842 4 2325
2929 4 2325 2934 4 2325 3069 4 2325 669
4 2325 679 4 2325 691 4 2325 761 4
2325 949 4 2325 989 4 2325 2325 5 2325
2325 5 2325 2325 5 2325 3184 5 2325 
# 2326
fix point approach to the theori of comput follow the
fix point theori of scott the semant of comput program
ar defin in term of the least fix point of
recurs program thi allow not onli the justif of all
exist verif techniqu but also their extens to the handl
in a uniform manner of variou properti of comput program
includ correct termin and equival cacm juli 1972 manna z
vuillemin j verif techniqu semant of program languag least fix
point recurs program comput induct 5 23 5 24 ca720702
jb januari 30 1978 3 42 pm 1469 4 2326
1486 4 2326 1491 4 2326 1781 4 2326 1781
4 2326 2021 4 2326 2178 4 2326 2178 4
2326 2193 4 2326 2222 4 2326 2227 4 2326
2315 4 2326 2326 4 2326 2326 4 2326 2326
4 2326 2326 4 2326 2326 4 2326 2470 4
2326 2470 4 2326 2477 4 2326 2457 4 2326
2541 4 2326 2594 4 2326 2684 4 2326 2684
4 2326 2732 4 2326 2842 4 2326 2865 4
2326 2896 4 2326 2903 4 2326 2943 4 2326
3004 4 2326 3014 4 2326 3044 4 2326 3068
4 2326 3077 4 2326 3143 4 2326 1303 5
2326 1323 5 2326 1834 5 2326 2192 5 2326
2326 5 2326 2326 5 2326 2326 5 2326 2411
5 2326 2457 5 2326 3186 5 2326 2138 6
2326 2192 6 2326 2326 6 2326 2326 6 2326
# 2327
toward an automata theori of brain a sourc of idea
for automata theori the studi of the brain ha been
push asid in mathemat develop of the theori thi paper
suggest the wai in which automata theori might evolv over
the next 25 year if it is to contribut to
an understand of how the brain process inform cacm juli
1972 arbib m a automata theori brain theori network complex
resolut of redund of potenti command frog visual system reticular
format mode select 3 36 3 65 5 22 ca720701
jb januari 30 1978 3 46 pm 2327 5 2327
2327 5 2327 2327 5 2327 
# 2328
individu instruct in a gener cai tutor cacm june 1972
koffman e b comput assist instruct gener cal adapt instruct
3 32 3 51 3 62 ca720617 jb januari 30
1978 3 47 pm 2328 5 2328 2328 5 2328
2328 5 2328 
# 2329
comput scienc a viciou circl cacm june 1972 kandel a
educ comput engin comput scienc curriculum system design 1 52
6 0 ca720616 jb januari 30 1978 3 49 pm
1892 4 2329 1901 4 2329 2085 4 2329 2095
4 2329 2218 4 2329 2277 4 2329 2319 4
2329 2329 4 2329 2358 4 2329 2373 4 2329
2380 4 2329 2434 4 2329 2499 4 2329 2501
4 2329 2582 4 2329 2669 4 2329 2828 4
2329 2863 4 2329 2881 4 2329 2928 4 2329
2996 4 2329 3006 4 2329 3067 4 2329 1751
5 2329 2329 5 2329 2329 5 2329 2329 5
2329 2478 5 2329 3003 5 2329 1205 6 2329
1659 6 2329 1678 6 2329 1771 6 2329 1927
6 2329 1945 6 2329 2097 6 2329 2147 6
2329 2163 6 2329 2187 6 2329 2329 6 2329
2329 6 2329 2345 6 2329 2367 6 2329 2407
6 2329 2478 6 2329 2479 6 2329 2480 6
2329 2538 6 2329 
# 2330
calcul of fourier integr algorithm r418 cacm june 1972 einarsson
b quadratur filon quadratur integr filon integr fourier coeffici fourier
integr fourier seri spline spline approxim spline quadratur extrapol richardson
extrapol 5 16 ca720615 jb januari 30 1978 3 53
pm 2330 5 2330 2330 5 2330 2330 5 2330
# 2331
an integ program problem algorithm r397 cacm june 1972 johnson
s c kernighan b w integ program chang make problem
5 41 ca720614 jb januari 30 1978 3 55 pm
2331 5 2331 2331 5 2331 2331 5 2331 
# 2332
special seri summat with arbitrari precis algorithm r393 cacm june
1972 sale a h j function evalu seri summat approxim
5 12 5 13 ca720613 jb januari 30 1978 4
00 pm 2332 5 2332 2332 5 2332 2332 5
2332 
# 2333
random vector uniform is solid angl algorithm r381 cacm june
1972 schrack g f random vector gener point uniform on
sphere spheric symmetr probabl distribut 5 5 ca720612 jb januari
30 1978 4 02 pm 2333 4 2333 2333 4
2333 2333 4 2333 87 4 2333 1793 5 2333
2333 5 2333 2333 5 2333 2333 5 2333 87
5 2333 88 5 2333 
# 2334
gener random number gener algorithm r370 cacm june 1972 proll
l g random number gener probabl densiti function transform cumul
distribut function 5 13 5 5 ca720611 jb januari 30
1978 4 09 pm 2334 4 2334 1580 5 2334
2334 5 2334 2334 5 2334 2334 5 2334 
# 2335
eigenvalu and eigenvector of a real gener matrix algorithm r343
cacm june 1972 niessner h eigenvalu eigenvector qr algorithm nonsymmetr
matric gener matric 5 14 ca720610 jb januari 30 1978
4 11 pm 1968 4 2335 2099 4 2335 2335
4 2335 1662 5 2335 2335 5 2335 2335 5
2335 2335 5 2335 
# 2336
complex error function algorithm c363 cacm june 1972 kolbig k
s error function for complex argument voigt function special function
function evalu 5 12 ca720609 jb januari 30 1978 4
12 pm 2336 5 2336 2336 5 2336 2336 5
2336 
# 2337
a sort problem and it complex a techniqu for prove
min max norm of sort algorithm is given on new
algorithm for find the minimum and maximum element of a
set with fewest comparison is prove optim with thi techniqu
cacm june 1972 pohl i sort comput complex comput combinator
5 29 5 31 ca720608 jb januari 30 1978 4
15 pm 2337 5 2337 2337 5 2337 2337 5
2337 
# 2338
a start method for solv nonlinear volterra integr equat of
the second kind a fourth order start method is given
for volterra integr equat of the second kind and numer
exampl ar present cacm june 1972 iguchi k algorithm volterra
integr equat start method 5 18 ca720607 jb januari 30
1978 4 17 pm 2338 5 2338 2338 5 2338
2338 5 2338 
# 2339
comput assign code from verbal respons it is often desir
to convert verbal respons to multidigit code thi convers is
gener accomplish by clerk coder a studi wa conduct to
test the feasibl of translat verbal descript to numer code
in a comput program primari emphasi wa place on computer
construct of a refer file of verbal descript for us
by the program the result of the studi clearli show
that such procedur ar feasibl cacm june 1972 o reagan
r t verbal respons comput code refer list histor respons
pattern word string concept translat word code 3 30 3
42 3 63 3 66 3 71 3 74 3
75 5 6 ca720606 jb januari 30 1978 4 23
pm 1112 4 2339 1592 4 2339 1592 4 2339
2111 4 2339 2111 4 2339 2111 4 2339 2339
4 2339 2339 4 2339 2339 4 2339 2339 4
2339 440 4 2339 1112 5 2339 1592 5 2339
2339 5 2339 2339 5 2339 2339 5 2339 440
5 2339 619 5 2339 
# 2340
a boolean matrix method for the comput of linear preced
function a modifi version of bell s boolean matrix method
for the comput of linear preced function associ with a
conflict free matrix of preced relat is given thi algorithm
not onli detect when the preced function do not exist
but also provid an indic of why thei do not
exist so that correct action can be taken if possibl
necessari and suffici condit for the exist of preced function
ar given the us of boolean matric to prove the
exist of preced function associ with class of conflict free
grammar is illustr through an exampl cacm june 1972 martin
d f preced grammar context free pars 4 12 ca720605
jb januari 30 1978 4 28 pm 1542 4 2340
1683 4 2340 1693 4 2340 1781 4 2340 1787
4 2340 1836 4 2340 1836 4 2340 1945 4
2340 2060 4 2340 2061 4 2340 2082 4 2340
2091 4 2340 2152 4 2340 2179 4 2340 2221
4 2340 2340 4 2340 2340 4 2340 2340 4
2340 2340 4 2340 2356 4 2340 2546 4 2340
2603 4 2340 2698 4 2340 2708 4 2340 2824
4 2340 2824 4 2340 2982 4 2340 2982 4
2340 2986 4 2340 2986 4 2340 2986 4 2340
3045 4 2340 3093 4 2340 1191 5 2340 1491
5 2340 1683 5 2340 1836 5 2340 2340 5
2340 2340 5 2340 2340 5 2340 2824 5 2340
2982 5 2340 2986 5 2340 1491 6 2340 1491
6 2340 1491 6 2340 1683 6 2340 1683 6
2340 1836 6 2340 1836 6 2340 2179 6 2340
2340 6 2340 2340 6 2340 2340 6 2340 
# 2341
block a new data type for snobol4 a new data
type call a block ha been implement for snobol4 a
block is a three dimension aggreg of charact in the
form of a right parallelepip best thought of as a
three dimension extens to a string the third dimens is
us for overstrik block mai be print concaten in ani
of three dimens and merg on the basi of program
defin connect point some block adapt in size and shape
to their environ block and their oper ar mainli us
for compos printabl output a varieti of graphic problem includ
flowchart bargraph logic diagram mathemat equat format and text justif
and prepar have been program on a printer in what
appear to be an easi and natur wai in addit
to these somewhat special applic block appear to be a
good gener purpos devic independ output format mechan especi suitabl
for nonnumer work the concept of a block is larg
languag independenthat is block requir littl in the wai of
special syntax and could readili be absorb into the extern
structur of most program languag cacm june 1972 gimpel j
f charact manipul output format string process graphic nonnumer program
snobol4 data type two dimension mathemat test process flowchart 4
22 4 41 ca720604 jb januari 30 1978 4 38
pm 1086 4 2341 1132 4 2341 1234 4 2341
1263 4 2341 1265 4 2341 1270 4 2341 1323
4 2341 1358 4 2341 1379 4 2341 1380 4
2341 1453 4 2341 1464 4 2341 1484 4 2341
1491 4 2341 1498 4 2341 1613 4 2341 1614
4 2341 1767 4 2341 1781 4 2341 1781 4
2341 1781 4 2341 1825 4 2341 1860 4 2341
1945 4 2341 2083 4 2341 2178 4 2341 2179
4 2341 2252 4 2341 2325 4 2341 2341 4
2341 2341 4 2341 2341 4 2341 2341 4 2341
2546 4 2341 2645 4 2341 2652 4 2341 2684
4 2341 2842 4 2341 2929 4 2341 2934 4
2341 3069 4 2341 669 4 2341 679 4 2341
691 4 2341 761 4 2341 949 4 2341 989
4 2341 990 5 2341 1466 5 2341 1468 5
2341 2341 5 2341 2341 5 2341 2341 5 2341
2545 5 2341 3184 5 2341 1739 6 2341 1781
6 2341 2341 6 2341 
# 2342
interfer between commun parallel process variou kind of interfer between
commun parallel process have been examin by dijkstra knuth and
other solut have been given for the mutual exclus problem
and associ subproblem in the form of parallel program and
inform proof of correct have been given for these solut
in thi paper a system of parallel process is regard
as a machin which proce from on state s i
e a collect of pertin data valu and process configur
to a next state s in accord with a transit
rule s s a set of such rule yield sequenc
of state which dictat the system s behavior the mutual
exclus problem and the associ subproblem ar formul as question
of inclus between set of state or of the exist
of certain sequenc a mechan proof procedur is shown which
will either verifi prove the correct of or discredit prove
the incorrect of an attempt solut with respect to ani
of the interfer properti it is shown how to calcul
transit rule from the partial rule by which the individu
process oper the format of partial rule and the calcul
of transit rule ar both applic to hardwar process as
well as to softwar process and symmetri between process is
not requir cacm june 1972 gilbert p chandler w j
concurr program control cooper process formal program interfer mutual exclus
oper system parallel process 4 0 4 10 4 30
4 32 4 42 5 24 6 20 ca720603 jb
januari 31 1978 8 44 am 1781 4 2342 1828
4 2342 1854 4 2342 1877 4 2342 1960 4
2342 2150 4 2342 2150 4 2342 2150 4 2342
2228 4 2342 2228 4 2342 2256 4 2342 2256
4 2342 2317 4 2342 2317 4 2342 2319 4
2342 2377 4 2342 2342 4 2342 2342 4 2342
2342 4 2342 2376 4 2342 2376 4 2342 2379
4 2342 2424 4 2342 2482 4 2342 2618 4
2342 2618 4 2342 2618 4 2342 2632 4 2342
2704 4 2342 2723 4 2342 2738 4 2342 2740
4 2342 2741 4 2342 2867 4 2342 3184 4
2342 3184 4 2342 1198 5 2342 1338 5 2342
1749 5 2342 2342 5 2342 2342 5 2342 2342
5 2342 
# 2343
a propos to establish a pseudo virtual memori via writabl
overlai mani comput system solv execut storag size problem for
larg program by us overlai howev it appear that no
on overlai scheme contain a well balanc combin of the
most us capabl which ar found in variou exist techniqu
a propos is present which util sever of the best
capabl from exist scheme and is complement by sever addit
featur e g writabl overlai the writabl overlai capabl provid
a virtual memori effect although the programm mai still be
requir to design the overlai configur sinc overlai structur is
a complex task sever tool includ a graphic displai ar
includ in the propos in order to aid the programm
in the design the content of overlai is briefli discuss
and it is note that mani of the detail of
the final overlai configur mai be decid after the fact
cacm june 1972 spacek t r overlai overlai structur segment
segment fold page linkag editor collector loader virtual memori 4
10 4 12 4 39 4 49 ca720602 jb januari
31 1978 8 53 am 1774 4 2343 2343 4
2343 2343 4 2343 2343 4 2343 1173 5 2343
1774 5 2343 1845 5 2343 2343 5 2343 2343
5 2343 2343 5 2343 
# 2344
on the optim of perform of time share system by
simul a simul model of a time share system with
a finit noncontigu store and an infinit auxiliari store is
us to studi the variat of system paramet such as
store size number of job allow to execut simultan job
schedul algorithm etc the effect of these variat on a
measur of system perform is us to ascertain which of
the paramet control by the job schedul algorithm includ the
schedul itself requir optim and which of the paramet not
normal control by the schedul algorithm have a mark effect
on system perform system perform is base upon the mean
cost of delai to all job process it is shown
that signific improv in the measur of system perform can
be obtain by us variabl time slice techniqu and by
select the optimum round robin cycl time it appear that
these featur would benefit from optim wherea other paramet control
by the schedul algorithm affect system perform in a predict
manner and would not benefit from optim featur not normal
under the control of the schedul algorithm can also have
a mark effect on the measur of perform in particular
supervisor overhead the size of the store and the speed
of the cpu a comparison is made between the result
of the simul model and two analyt equat for quantum
orient nonpreempt time share system the comparison is found to
be veri favor cacm june 1972 blatni j clark s
r rourk t a time share simul studi optim measur
of perform schedul algorithm 3 80 4 30 4 32
ca720601 jb januari 31 1978 9 19 am 2219 4
2344 2344 4 2344 1938 5 2344 2344 5 2344
2344 5 2344 2344 5 2344 
# 2345
curriculum recommend for graduat profession program in inform system the
need for educ relat to inform system in organ is
discuss and a curriculum is propos for graduat profession program
in univers at the master s level materi necessari for
such program is identifi and cours incorpor it ar specifi
detail cours descript ar present program organ discuss and implement
question consid cacm mai 1972 ashenhurst r l educ manag
system system analysi manag inform system inform system develop inform
analysi system design 1 52 3 51 ca720515 jb januari
31 1978 9 28 am 1720 4 2345 1927 4
2345 2147 4 2345 2163 4 2345 2163 4 2345
2345 4 2345 2345 4 2345 2407 4 2345 2478
4 2345 2594 4 2345 2852 4 2345 2899 4
2345 3130 4 2345 1771 5 2345 2181 5 2345
2345 5 2345 2345 5 2345 2345 5 2345 2407
5 2345 2852 5 2345 3003 5 2345 3011 5
2345 3050 5 2345 1417 6 2345 1659 6 2345
1678 6 2345 1771 6 2345 1927 6 2345 1945
6 2345 2075 6 2345 2097 6 2345 2147 6
2345 2163 6 2345 2163 6 2345 2181 6 2345
2187 6 2345 2302 6 2345 2329 6 2345 2345
6 2345 2345 6 2345 2345 6 2345 2345 6
2345 2345 6 2345 2367 6 2345 2387 6 2345
2387 6 2345 2407 6 2345 2478 6 2345 2479
6 2345 2479 6 2345 2480 6 2345 2485 6
2345 2538 6 2345 
# 2346
hu tucker minimum redund alphabet code method z algorithm a428
cacm mai 1972 yohe j m inform theori code theori
hu tucker method minimum redund code 5 6 ca720514 jb
januari 31 1978 9 30 am 2346 4 2346 2459
4 2346 1114 5 2346 2346 5 2346 2346 5
2346 2346 5 2346 
# 2347
fourier cosin integr d1 algorithm a427 cacm mai 1972 linz
p numer integr quadratur adapt quadratur filon quadratur fourier coeffici
fourier integr 5 16 ca720513 jb januari 31 1978 9
32 am 2347 5 2347 2347 5 2347 2347 5
2347 
# 2348
merg sort algorithm m1 algorithm a426 cacm mai 1972 bron
c sort merg 5 31 ca720512 jb januari 31 1978
9 33 am 1919 4 2348 1969 4 2348 2118
4 2348 2348 4 2348 2679 4 2348 3054 4
2348 1175 5 2348 2348 5 2348 2348 5 2348
2348 5 2348 2563 5 2348 2348 6 2348 
# 2349
gener of random correl normal variabl g5 algorithm a425 cacm
mai 1972 hurst r l knop r e random number
normal densiti normal distribut gaussian densiti gaussian distribut simul mont
carlo 5 5 ca720511 jb januari 31 1978 9 35
am 1663 4 2349 2057 4 2349 2349 4 2349
2349 4 2349 2349 4 2349 2349 4 2349 2349
4 2349 2349 4 2349 2349 4 2349 2349 4
2349 2565 4 2349 1648 5 2349 1716 5 2349
1794 5 2349 1894 5 2349 2043 5 2349 2349
5 2349 2349 5 2349 2349 5 2349 501 5
2349 613 5 2349 774 5 2349 
# 2350
clenshaw curti quadratur d1 algorithm a424 cacm mai 1972 gentleman
w quadratur chebyshev seri cosin transform fast fourier transform 5
1 ca720510 jb januari 31 1978 9 37 am 2355
4 2350 2355 4 2350 2350 4 2350 2350 4
2350 2350 4 2350 2354 4 2350 2354 4 2350
2640 4 2350 1418 5 2350 2350 5 2350 2350
5 2350 2350 5 2350 2354 5 2350 2355 5
2350 1418 6 2350 1418 6 2350 1521 6 2350
1521 6 2350 1597 6 2350 1597 6 2350 1679
6 2350 1883 6 2350 2040 6 2350 2350 6
2350 2350 6 2350 2354 6 2350 2355 6 2350
# 2351
the optim of winograd s formula cacm mai 1972 harter
r inner product winograd s formula 5 14 ca720509 jb
januari 31 1978 9 38 am 2351 5 2351 2351
5 2351 2351 5 2351 
# 2352
minimax nonlinear approxim by approxim on subset cacm mai 1972
dunham c b minimax approxim nonlinear approxim subset 5 13
ca720508 jb januari 31 1978 9 40 am 2352 4
2352 2353 4 2352 2094 5 2352 2352 5 2352
2352 5 2352 2352 5 2352 
# 2353
fast finit differ solut of biharmon problem set the reynold
number equal to zero in a method for solv the
navier stroke equat numer result in a fast numer method
for biharmon problem the equat is treat as a system
of two second order equat and a simpl smooth process
is essenti for converg an applic is made to a
crack type problem cacm mai 1972 greenspan d schultz d
numer analysi partial differenti equat biharmon equat boundari valu problem
5 17 ca720507 jb januari 31 1978 9 43 am
2352 4 2353 2353 4 2353 2094 5 2353 2353
5 2353 2353 5 2353 2353 5 2353 
# 2354
implement clenshaw curti quadratur ii comput the cosin transform in
a companion paper to thi i methodolog and experi the
automat clenshaw curti quadratur scheme wa describ and how each
quadratur formula us in the scheme requir a cosin transform
of the integrand valu wa shown the high cost of
these cosin transform ha been a seriou drawback in us
clenshaw curti quadratur two other problem relat to the cosin
transform have also been troubl some first the convent comput
of the cosin transform by recurr relat is numer unstabl
particularli at the low frequenc which have the largest effect
upon the integr second in case the automat scheme should
requir refin of the sampl storag is requir to save
the integrand valu after the cosin transform is comput thi
second part of the paper show how the cosin transform
can be comput by a modif of the fast fourier
transform and all three problem overcom the modif is also
applic in other circumst requir cosin or sine transform such
as polynomi interpol through the chebyshev point cacm mai 1972
gentleman w m fast fourier transform cosin transform clenshaw curti
quadratur chebyshev seri 5 13 5 14 5 16 ca720506
jb januari 31 1978 9 56 am 2355 4 2354
2355 4 2354 2355 4 2354 2355 4 2354 2350
4 2354 2350 4 2354 2354 4 2354 2354 4
2354 2354 4 2354 2354 4 2354 2354 4 2354
2354 4 2354 2640 4 2354 1418 5 2354 1521
5 2354 1597 5 2354 1679 5 2354 2350 5
2354 2354 5 2354 2354 5 2354 2354 5 2354
2355 5 2354 1418 6 2354 1418 6 2354 1521
6 2354 1597 6 2354 1883 6 2354 2040 6
2354 2350 6 2354 2354 6 2354 2354 6 2354
2355 6 2354 
# 2355
implement clenshaw curti quadratur i methodolog and experi clenshaw curti
quadratur is a particularli import automat quadratur scheme for a
varieti of reason especi the high accuraci obtain from rel
few integrand valu howev it ha receiv littl us becaus
it requir the comput of a cosin transform and the
arithmet cost of thi ha been prohibit thi paper is
in two part a companion paper ii comput the cosin
transform show that thi object can be overcom by comput
the cosin transform by a modif of the fast fourier
transform algorithm thi first part discuss the strategi and variou
error estim and summar experi with a particular implement of
the scheme cacm mai 1972 gentleman w m clenshaw curti
numer integr automat quadratur error estim chebyshev seri 5 16
ca720505 jb januari 31 1978 10 05 am 1982 4
2355 2355 4 2355 2355 4 2355 2355 4 2355
2355 4 2355 2355 4 2355 2355 4 2355 2355
4 2355 2350 4 2355 2350 4 2355 2354 4
2355 2354 4 2355 2354 4 2355 2354 4 2355
1418 5 2355 1521 5 2355 1597 5 2355 1883
5 2355 2040 5 2355 2350 5 2355 2354 5
2355 2355 5 2355 2355 5 2355 2355 5 2355
2640 5 2355 1418 6 2355 1418 6 2355 1521
6 2355 1597 6 2355 1679 6 2355 2350 6
2355 2354 6 2355 2355 6 2355 2355 6 2355
2355 6 2355 
# 2356
a techniqu for softwar modul specif with exampl thi paper
present an approach to write specif for part of softwar
system the main goal is to provid specif suffici precis
and complet that other piec of softwar can be written
to interact with the piec specifi without addit inform the
secondari goal is to includ in the specif no more
inform than necessari to meet the first goal the techniqu
is illustr by mean of a varieti of exampl from
a tutori system cacm mai 1972 parna d l softwar
specif modul softwar engin softwar design 4 0 4 29
4 9 ca720504 jb januari 31 1978 10 47 am
1542 4 2356 1683 4 2356 1693 4 2356 1781
4 2356 1787 4 2356 1836 4 2356 1945 4
2356 2042 4 2356 2060 4 2356 2061 4 2356
2082 4 2356 2091 4 2356 2152 4 2356 2179
4 2356 2222 4 2356 2340 4 2356 2356 4
2356 2356 4 2356 2356 4 2356 2420 4 2356
2546 4 2356 2603 4 2356 2679 4 2356 2698
4 2356 2708 4 2356 2824 4 2356 2844 4
2356 2874 4 2356 2972 4 2356 2982 4 2356
2986 4 2356 3045 4 2356 3093 4 2356 3143
4 2356 970 5 2356 1491 5 2356 2227 5
2356 2356 5 2356 2356 5 2356 2356 5 2356
2704 5 2356 2738 5 2356 2866 5 2356 2869
5 2356 2941 5 2356 2958 5 2356 3004 5
2356 3030 5 2356 1247 6 2356 1425 6 2356
1471 6 2356 1552 6 2356 1749 6 2356 1749
6 2356 2080 6 2356 2247 6 2356 2247 6
2356 2247 6 2356 2356 6 2356 2356 6 2356
2356 6 2356 2356 6 2356 2356 6 2356 2356
6 2356 2356 6 2356 2356 6 2356 2379 6
2356 2436 6 2356 2456 6 2356 2457 6 2356
2558 6 2356 2597 6 2356 2651 6 2356 2651
6 2356 2673 6 2356 2777 6 2356 2796 6
2356 2958 6 2356 2972 6 2356 3186 6 2356
# 2357
mux a simpl approach to on line comput an on
line system oper as part of a normal batch system
for the cdc 6600 comput is describ the system which
requir on man year for initi softwar implement although basic
simpl provid the necessari element to input and modifi file
submit them for batch execut and provid result at the
user s termin a multiplex design and develop as part
of the project cost on man year for design and
checkout and 16 000 for part and fabric all aspect
of the system ar describ includ design criteria implement cost
overhead and user reaction cacm mai 1972 christman r d
time share remot comput on line access on line comput
remot file manag real time multiplex implement effort oper overhead
user reaction remot termin oper system 3 79 3 89
4 39 4 41 ca720503 jb januari 31 1978 11
04 am 1657 4 2357 2080 4 2357 2357 4
2357 2357 4 2357 2357 4 2357 2536 4 2357
1523 5 2357 1829 5 2357 2035 5 2357 2357
5 2357 2357 5 2357 2357 5 2357 
# 2358
the multic virtual memori concept and design as experi with
us of on line oper system ha grown the need
to share inform among system user ha becom increasingli appar
mani contemporari system permit some degre of share usual share
is accomplish by allow sever user to share data via
input and output of inform store in file kept in
secondari storag through the us of segment howev multic provid
direct hardwar address by user and system program of all
inform independ of it physic storag locat inform is store
in segment each of which is potenti sharabl and carri
it own independ attribut of size and access privileg here
the design and implement consider of segment and share in
multic ar first discuss under the assumpt that all inform
resid in larg segment main memori sinc the size of
main memori on contemporari system is rather limit it is
then shown how the multic softwar achiev the effect of
a larg segment main memori through the us of the
honeywel 645 segment and page hardwar cacm mai 1972 bensoussan
a clingen c t dalei r c oper system multic
virtual memori segment inform share page memori manag memori hierarchi
4 30 4 31 4 32 ca720502 jb januari 31
1978 11 24 am 1753 4 2358 1754 4 2358
1892 4 2358 1901 4 2358 2085 4 2358 2095
4 2358 2218 4 2358 2277 4 2358 2317 4
2358 2319 4 2358 2329 4 2358 2358 4 2358
2358 4 2358 2358 4 2358 2358 4 2358 2377
4 2358 2373 4 2358 2372 4 2358 2380 4
2358 2434 4 2358 2499 4 2358 2501 4 2358
2582 4 2358 488 4 2358 2625 4 2358 2626
4 2358 2669 4 2358 2828 4 2358 2840 4
2358 2863 4 2358 2881 4 2358 2928 4 2358
2996 4 2358 3006 4 2358 3067 4 2358 274
5 2358 1746 5 2358 1751 5 2358 1753 5
2358 2358 5 2358 2358 5 2358 2358 5 2358
2377 5 2358 2625 5 2358 2626 5 2358 2669
5 2358 1471 6 2358 1471 6 2358 1746 6
2358 1746 6 2358 1749 6 2358 1751 6 2358
1753 6 2358 1901 6 2358 2017 6 2358 2358
6 2358 2358 6 2358 2358 6 2358 2358 6
2358 2377 6 2358 2438 6 2358 2625 6 2358
2629 6 2358 
# 2359
an improv index sequenti access method us hash overflow the
index sequenti access method isam is on of the most
import file manag system us with moveabl head disk devic
thi studi investig the us of an unconvent method of
treat overflow record the method is to us hash techniqu
to alloc space for such record if certain condit ar
satisfi thi is superior to the convent isam method of
chain the overflow record via link list techniqu these condit
ar long overflow chain with signific overflow lack of tight
disk space constraint record kei which ar small compar to
the total record size and signific us of the file
in the index as oppos to the sequenti mode us
hash overflow the time to locat a record is depend
not on the total volum of overflow record as in
convent isam but on the percentag us of space dedic
to overflow record cacm mai 1972 mullin j k isam
index sequenti hash scatter storag disk cylind overflow 3 72
3 73 3 74 ca720501 jb januari 31 1978 12
29 pm 1676 4 2359 1682 4 2359 1728 4
2359 1860 4 2359 1973 4 2359 2018 4 2359
2032 4 2359 2033 4 2359 2107 4 2359 2109
4 2359 2203 4 2359 2251 4 2359 2258 4
2359 2319 4 2359 2313 4 2359 2359 4 2359
2359 4 2359 2437 4 2359 2524 4 2359 2543
4 2359 2552 4 2359 2552 4 2359 2559 4
2359 2781 4 2359 2860 4 2359 2991 4 2359
2991 4 2359 3053 4 2359 1785 5 2359 2203
5 2359 2359 5 2359 2359 5 2359 2359 5
2359 
# 2360
a comment on the doubl chain tree cacm april 1972
hu t c file search doubl chain tree binari search
tree 3 73 3 74 5 32 5 6 ca720413
jb januari 31 1978 12 31 pm 1050 4 2360
1935 4 2360 1936 4 2360 2017 4 2360 2032
4 2360 2257 4 2360 2257 4 2360 2257 4
2360 2360 4 2360 2360 4 2360 2360 4 2360
2451 4 2360 2451 4 2360 2452 4 2360 2452
4 2360 2556 4 2360 2765 4 2360 1831 5
2360 1936 5 2360 2257 5 2360 2360 5 2360
2360 5 2360 2360 5 2360 849 5 2360 849
6 2360 1831 6 2360 1936 6 2360 2360 6
2360 
# 2361
a note on chenei s nonrecurs list compact algorithm cacm
april 1972 walden d c list compact garbag collect 4
19 4 49 ca720412 jb januari 31 1978 12 32
pm 2156 4 2361 2361 4 2361 2513 4 2361
2736 4 2361 2855 4 2361 3074 4 2361 3106
4 2361 3112 4 2361 1972 5 2361 2361 5
2361 2361 5 2361 2361 5 2361 
# 2362
linear equat solver f4 algorithm a423 cacm april 1972 moler
c b matrix algorithm linear equat fortran page memori virtual
memori arrai process 4 22 4 32 5 14 ca720411
jb januari 31 1978 12 34 pm 2362 4 2362
3152 4 2362 2362 5 2362 2362 5 2362 2362
5 2362 2365 5 2362 987 6 2362 1754 6
2362 1924 6 2362 2362 6 2362 
# 2363
minim span tree h algorithm a422 cacm april 1972 whitnei
v k m span tree minim span tree maxim span
tree 5 32 ca720410 jb januari 31 1978 12 36
pm 2363 5 2363 2363 5 2363 2363 5 2363
2641 5 2363 2363 6 2363 
# 2364
complex gamma function with error control s14 algorithm a421 cacm
april 1972 kuki h complex gamma function gamma function complex
log gamma function loggamma function round off error control inher
error control run time error estim error estim special function
4 9 5 11 5 12 ca720409 jb januari 31
1978 12 50 pm 2364 4 2364 2364 5 2364
2364 5 2364 2364 5 2364 2366 5 2364 2364
6 2364 
# 2365
matrix comput with fortran and page the effici of convent
fortran program for matrix comput can often be improv by
revers the order of nest loop such modif produc modest
save in mani common situat and veri signific save for
larg problem run under an oper system which us page
cacm april 1972 moler c b matrix algorithm linear equat
fortran page memori virtual memori arrai process 4 22 4
32 5 14 ca720408 jb januari 31 1978 12 54
pm 1613 4 2365 1646 4 2365 1879 4 2365
1884 4 2365 1900 4 2365 1901 4 2365 1955
4 2365 2025 4 2365 2095 4 2365 2154 4
2365 2277 4 2365 2297 4 2365 2365 4 2365
2365 4 2365 2365 4 2365 2365 4 2365 2506
4 2365 2582 4 2365 3060 4 2365 3152 4
2365 987 5 2365 1754 5 2365 1924 5 2365
2362 5 2365 2365 5 2365 2365 5 2365 2365
5 2365 3152 5 2365 1924 6 2365 2365 6
2365 2365 6 2365 
# 2366
complex gamma function with error control an algorithm to comput
the gamma function and log gamma function of a complex
variabl is present the standard algorithm is modifi in sever
respect to insur the continu of the function valu and
to reduc accumul of round off error in addit to
comput of function valu thi algorithm includ an object time
estim of round off error experiment data with regard to
the effect of thi error control ar present a fortran
program for the algorithm appear in the algorithm section of
thi issu cacm april 1972 kuki h complex gamma function
gamma function complex log gamma function loggamma function round off
error control inher error control run time error estim error
estim 5 11 5 12 ca720407 jb januari 31 1978
12 59 pm 2366 4 2366 2364 5 2366 2366
5 2366 2366 5 2366 2366 5 2366 2366 6
2366 
# 2367
comput and societi a propos cours for comput scientist the
purpos of thi paper is to describ a cours concern
with both the effect of comput on societi and the
respons of comput scientist to societi the impact of comput
is divid into five compon polit econom cultur social and
moral the main part of the paper defin each compon
and present exampl of the relev issu in the remain
portion the possibl format for such a cours ar discuss
a topic by topic outlin is given and a select
set of refer is list it is hope that the
propos will make it easier to initi cours on thi
subject cacm april 1972 horowitz e morgan h l shaw
a c comput and societi social implic cours propos 1
0 1 52 2 1 ca720406 jb januari 31 1978
1 06 pm 2367 5 2367 2367 5 2367 2367
5 2367 3003 5 2367 1659 6 2367 1678 6
2367 1927 6 2367 1945 6 2367 2097 6 2367
2147 6 2367 2163 6 2367 2187 6 2367 2329
6 2367 2345 6 2367 2367 6 2367 2407 6
2367 2478 6 2367 2479 6 2367 2480 6 2367
2538 6 2367 
# 2368
an implement graph algorithm for win shannon switch game in
thi tutori paper a comput program which win shannon switch
game is describ sinc these game ar plai on graph
the program is a good exampl of the implement of
graph algorithm the two player in a shannon switch game
connect and cut have nonsimilar goal either connect cut or
the player move first is guarante the exist of a
win strategi the simpl strategi explain in thi paper is
valid in all three case in fact the major routin
never need to know whether the comput is connect or
cut cacm april 1972 chase s m graph algorithm graph
process shannon switch game game plai graph theori posit game
demonstr program game theori spin tree 3 69 5 32
ca720405 jb januari 31 1978 1 34 pm 2368 5
2368 2368 5 2368 2368 5 2368 
# 2369
hidden line elimin for a rotat object a method is
present of determin which part of three dimension object ar
visibl and which ar invis when the object ar rotat
about some axi thi paper describ a polygon comparison scheme
in which the relationship of two polygon can be classifi
into tree type and also discuss how the relationship is
chang for each pair of polygon under rotat about some
axi a rotat tabl is defin for each pair of
polygon which remain fix as long as rotat is about
on axi and provid a mean of rapidli determin the
visibl and hidden line relationship between two polygon addit work
must be done to extend thi approach to simultan rotat
about sever ax cacm april 1972 matsushita y hidden line
problem displai program comput graphic displai graphic comput drawn pictur
4 40 4 41 4 49 ca720404 jb januari 31
1978 1 40 pm 2369 5 2369 2369 5 2369
2369 5 2369 
# 2370
an experiment laboratori for pattern recognit and signal process an
interact comput control scan and displai system ha been in
oper at the ibm thoma j watson research center for
three year the system includ two fly spot scanner and
a tv camera special interfac to a process control digit
comput dot mode and vector displai analog input and output
facil and a varieti of other experiment equip the system
design and program support ar describ and typic applic in
scanner control optic charact recognit and imag process ar present
cacm april 1972 herbst n m will p m scanner
pseudorandom displai interact termin imag process pattern recognit 4 41
6 35 ca720403 jb januari 31 1978 1 47 pm
2370 4 2370 1726 5 2370 2370 5 2370 2370
5 2370 2370 5 2370 
# 2371
a system for interprocess commun in a resourc share comput
network a system of commun between process in a time
share system is describ and the commun system is extend
so that it mai be us between process distribut throughout
a comput network the hypothet applic of the system to
an exist network is discuss cacm april 1972 walden d
c interprocess commun time share comput network resourc share 3
81 4 39 4 82 4 9 ca720402 jb januari
31 1978 1 51 pm 2371 5 2371 2371 5
2371 2371 5 2371 2849 5 2371 2371 6 2371
# 2372
on the implement of secur measur in inform system the
secur of an inform system mai be repres by a
model matrix whose element ar decis rule and whose row
and column indic ar user and data item respect a
set of four function is us to access thi matrix
at translat and execut time distinguish between data depend and
data independ decis rule enabl on to perform much of
the check of secur onli onc at translat time rather
than repeatedli at execut time the model is us to
explain secur featur of sever exist system and serv as
a framework for a propos for gener secur system implement
within todai s languag and oper system cacm april 1972
conwai r w maxwel w l morgan h l secur
privaci access control confidenti oper system access manag data bank
manag inform system 3 50 3 73 4 12 4
22 4 39 ca720401 jb januari 31 1978 1 59
pm 1753 4 2372 2358 4 2372 2377 4 2372
2372 4 2372 2626 4 2372 2840 4 2372 1746
5 2372 2372 5 2372 2372 5 2372 2372 5
2372 
# 2373
properti of the work set model a program s work
set w t t at time t is the set
of distinct page among the t most recent referenc page
relat between the averag work set size the miss page
rate and the interrefer interv distribut mai be deriv both
from time averag definit and from ensembl averag statist definit
an effici algorithm for estim these quantiti is given the
relat to lru least recent us page is character the
independ refer model in which page refer ar statist independ
is us to assess the effect to interpag depend on
work set size observ under gener assumpt work set size
is shown to be normal distribut cacm march 1972 den
p j schwartz s c work set model page page
algorithm program behavior program model 4 3 ca720308 jb januari
31 1978 2 07 pm 1604 4 2373 1892 4
2373 1901 4 2373 1951 4 2373 2085 4 2373
2095 4 2373 2218 4 2373 2218 4 2373 2277
4 2373 2319 4 2373 2329 4 2373 2358 4
2373 2373 4 2373 2373 4 2373 2373 4 2373
2373 4 2373 2373 4 2373 2380 4 2373 2434
4 2373 2499 4 2373 2450 4 2373 2501 4
2373 2582 4 2373 2669 4 2373 2828 4 2373
2863 4 2373 2881 4 2373 2894 4 2373 2928
4 2373 2996 4 2373 3006 4 2373 3006 4
2373 3067 4 2373 3067 4 2373 1410 5 2373
1751 5 2373 1810 5 2373 1951 5 2373 2373
5 2373 2373 5 2373 2373 5 2373 2374 5
2373 2380 5 2373 2450 5 2373 2595 5 2373
2996 5 2373 3006 5 2373 3067 5 2373 1728
6 2373 1751 6 2373 1751 6 2373 1751 6
2373 1751 6 2373 1884 6 2373 1901 6 2373
2374 6 2373 2374 6 2373 2374 6 2373 2373
6 2373 2373 6 2373 2373 6 2373 2373 6
2373 2373 6 2373 2373 6 2373 2373 6 2373
2595 6 2373 2595 6 2373 2595 6 2373 2682
6 2373 2863 6 2373 2864 6 2373 3006 6
2373 
# 2374
a studi of storag partit us a mathemat model of
local both fix and dynam storag partit procedur ar examin
for us in multiprogram system the storag requir of program
is model as a stationari gaussian process experi justifi thi
model ar describ by mean of thi model dynam storag
partit is shown to provid substanti increas in storag util
and oper effici over fix partit cacm march 1972 coffman
jr e g ryan jr t a storag partit memori
manag dynam storag alloc space share multiprogram storag work set
program behavior model mathemat model 4 32 4 39 ca720307
jb januari 31 1978 2 29 pm 1892 4 2374
1924 4 2374 2095 4 2374 2218 4 2374 2297
4 2374 2374 4 2374 2374 4 2374 2374 4
2374 2380 4 2374 2450 4 2374 2481 4 2374
2526 4 2374 2595 4 2374 2667 4 2374 2668
4 2374 2669 4 2374 2862 4 2374 2863 4
2374 2863 4 2374 2996 4 2374 3006 4 2374
3016 4 2374 3052 4 2374 3067 4 2374 1728
5 2374 1901 5 2374 2373 5 2374 2374 5
2374 2374 5 2374 2374 5 2374 2450 5 2374
3006 5 2374 3067 5 2374 1410 6 2374 1751
6 2374 1751 6 2374 1751 6 2374 1810 6
2374 1884 6 2374 1951 6 2374 2374 6 2374
2374 6 2374 2374 6 2374 2374 6 2374 2373
6 2374 2373 6 2374 2373 6 2374 2595 6
2374 2595 6 2374 2682 6 2374 2863 6 2374
2864 6 2374 3006 6 2374 
# 2375
a compar analysi of disk schedul polici five well known
schedul polici for movabl head disk ar compar us the
perform criteria of expect seek time system orient and expect
wait time individu i o request orient both analyt and
simul result ar obtain the varianc of wait time is
introduc as anoth meaning measur of perform show possibl discrimin
against individu request then the choic of a util function
to measur total perform includ system orient and individu request
orient measur is describ such a function allow on to
differenti among the schedul polici over a wide rang of
input load condit the select and implement of a maximum
perform two polici algorithm ar discuss cacm march 1972 teorei
t j pinkerton t b access time analyt model auxiliari
storag direct access storag disk analysi disk schedul perform criteria
peripher memori devic real time system respons time rotat delai
schedul polici seek time simul storag unit time share system
wait time 3 72 4 32 6 34 ca720306jb januari
31 1978 2 38 pm 2375 5 2375 2375 5
2375 2375 5 2375 2628 5 2375 2891 5 2375
3072 5 2375 1713 6 2375 2219 6 2375 2245
6 2375 2375 6 2375 2375 6 2375 2375 6
2375 2496 6 2375 2628 6 2375 
# 2376
synchron of commun process formal of a well defin synchron
mechan can be us to prove that concurr run process
of a system commun correctli thi is demonstr for a
system consist of mani send process which deposit messag in
a buffer and mani receiv process which remov messag from
that buffer the formal descript of the synchron mechan make
it veri easi to prove that the buffer will neither
overflow nor underflow that sender and receiv will never oper
on the same messag frame in the buffer nor will
thei run into a deadlock cacm march 1972 habermann a
n parallel program multiprogram program correct process commun process schedul
4 30 4 32 4 39 4 9 ca720305 jb
januari 31 1978 2 44 pm 1781 4 2376 1828
4 2376 1854 4 2376 1877 4 2376 1960 4
2376 2150 4 2376 2150 4 2376 2228 4 2376
2256 4 2376 2317 4 2376 2317 4 2376 2319
4 2376 2377 4 2376 2342 4 2376 2342 4
2376 2376 4 2376 2376 4 2376 2376 4 2376
2379 4 2376 2424 4 2376 2482 4 2376 2618
4 2376 2618 4 2376 2632 4 2376 2704 4
2376 2723 4 2376 2738 4 2376 2740 4 2376
2741 4 2376 2867 4 2376 3184 4 2376 3184
4 2376 1198 5 2376 1749 5 2376 1960 5
2376 2376 5 2376 2376 5 2376 2376 5 2376
2700 5 2376 3128 5 2376 2150 6 2376 2376
6 2376 2376 6 2376 2436 6 2376 2597 6
2376 2865 6 2376 2866 6 2376 2870 6 2376
2912 6 2376 3082 6 2376 
# 2377
a hardwar architectur for implement protect ring protect of comput
and inform is an import aspect of a comput util
in a system which us segment as a memori address
scheme protect can be achiev in part by associ concentr
ring of decreas access privileg with a comput thi paper
describ hardwar processor mechan for implement these ring of protect
the mechan for implement these ring of protect the mechan
allow cross ring call and subsequ return to occur without
trap to the supervisor automat hardwar valid of refer across
ring boundari is also perform thu a call by a
user procedur to a protect subsystem includ the supervisor is
ident to a call to a companion user procedur the
mechan of pass and referenc argument ar the same in
both case as well cacm march 1972 schroeder m d
saltzer j h protect protect ring protect hardwar access control
hardwar access control comput util time share share inform segment
virtual memori multic 4 32 6 21 ca720304 jb januari
31 1978 2 58 pm 1458 4 2377 1523 4
2377 1603 4 2377 1698 4 2377 1747 4 2377
1748 4 2377 1753 4 2377 1828 4 2377 1854
4 2377 1854 4 2377 1877 4 2377 1877 4
2377 1960 4 2377 1960 4 2377 2150 4 2377
2317 4 2377 2319 4 2377 2358 4 2377 2377
4 2377 2377 4 2377 2377 4 2377 2377 4
2377 2378 4 2377 2372 4 2377 2342 4 2377
2376 4 2377 2379 4 2377 2424 4 2377 2482
4 2377 2497 4 2377 2558 4 2377 2618 4
2377 2625 4 2377 2625 4 2377 2626 4 2377
2626 4 2377 2632 4 2377 2632 4 2377 2669
4 2377 2704 4 2377 2723 4 2377 2738 4
2377 2740 4 2377 2741 4 2377 2840 4 2377
2840 4 2377 2867 4 2377 2941 4 2377 3105
4 2377 3144 4 2377 3184 4 2377 1471 5
2377 1746 5 2377 1749 5 2377 2358 5 2377
2377 5 2377 2377 5 2377 2377 5 2377 2436
5 2377 2626 5 2377 2868 5 2377 2870 5
2377 953 6 2377 1746 6 2377 2080 6 2377
2358 6 2377 2377 6 2377 2377 6 2377 2377
6 2377 2377 6 2377 2380 6 2377 2558 6
2377 2625 6 2377 2625 6 2377 2629 6 2377
2632 6 2377 2632 6 2377 
# 2378
an oper system base on the concept of a supervisori
comput an oper system which is organ as a small
supervisor and a set of independ process ar describ the
supervisor handl i o with extern devic the file and
directori system schedul activ process and manag memori handl error
and provid a small set of primit function which it
will execut for a process a process is abl to
specifi a request for a complic action on the part
of the supervisor usual a wait on the occurr of
a compound event in the system by combin these primit
into a supervisori comput program the part of the supervisor
which execut these program mai be view as a softwar
implement supervisori comput the paper develop these concept in detail
outlin the remaind of the supervisor and discuss some of
the advantag of thi approach cacm march 1972 gain r
s oper system supervisor multiprogram time share cooper process 4
30 4 31 4 32 ca720303 jb januari 31 1978
3 08 pm 1458 4 2378 1523 4 2378 1603
4 2378 1698 4 2378 1747 4 2378 1748 4
2378 1854 4 2378 1877 4 2378 1960 4 2378
2319 4 2378 2377 4 2378 2378 4 2378 2378
4 2378 2320 4 2378 2497 4 2378 2558 4
2378 2625 4 2378 2632 4 2378 2632 4 2378
2738 4 2378 2740 4 2378 2840 4 2378 2868
4 2378 2941 4 2378 3105 4 2378 3127 4
2378 3144 4 2378 1471 5 2378 2080 5 2378
2378 5 2378 2378 5 2378 2378 5 2378 
# 2379
the design of the venu oper system the venu oper
system is an experiment multiprogram system which support five or
six concurr user on a small comput the system wa
produc to test the effect of machin architectur on complex
of softwar the system is defin by a combin of
microprogram and softwar the microprogram defin a machin with some
unusu architectur featur the softwar exploit these featur to defin
the oper system as simpli as possibl in thi paper
the develop of the system is describ with particular emphasi
on the principl which guid the design cacm march 1972
liskov b h oper system system design level of abstract
machin architectur microprogram segment semaphor multiprogram virtual machin process process
commun virtual devic data share resourc manag deadlock 4 30
4 32 4 41 6 21 ca720302 jb januari 31
1978 3 16 pm 1828 4 2379 1854 4 2379
1877 4 2379 1960 4 2379 2150 4 2379 2228
4 2379 2280 4 2379 2280 4 2379 2317 4
2379 2319 4 2379 2377 4 2379 2342 4 2379
2376 4 2379 2379 4 2379 2379 4 2379 2379
4 2379 2424 4 2379 2482 4 2379 2482 4
2379 2482 4 2379 2500 4 2379 2618 4 2379
2632 4 2379 2704 4 2379 2723 4 2379 2738
4 2379 2740 4 2379 2740 4 2379 2741 4
2379 2851 4 2379 2867 4 2379 2920 4 2379
3184 4 2379 1749 5 2379 1877 5 2379 2228
5 2379 2379 5 2379 2379 5 2379 2379 5
2379 2704 5 2379 2867 5 2379 1247 6 2379
1552 6 2379 1749 6 2379 1749 6 2379 2247
6 2379 2356 6 2379 2379 6 2379 2379 6
2379 2673 6 2379 
# 2380
tenex a page time share system for the pdp 10
tenex is a new time share system implement on dec
pdp 10 augment by special page hardwar develop at bbn
thi report specifi a set of goal which ar import
for ani time share system it describ how the tenex
design and implement achiev these goal these includ specif for
a power multiprocess larg memori virtual machin intim termin interact
comprehens uniform file and i o capabl and clean flexibl
system structur although the implement describ here requir some compromis
to achiev a system oper within six month of hardwar
checkout tenex ha met it major goal and provid reliabl
servic at sever site and through the arpa network cacm
march 1972 bobrow d g burchfiel j d murphi d
l tomlinson r s beranek b tenex page virtual machin
time share system schedul algorithm process structur pdp 10 2
44 4 32 4 39 4 42 ca720301 jb januari
31 1978 3 37 pm 1892 4 2380 1901 4
2380 2085 4 2380 2095 4 2380 2218 4 2380
2277 4 2380 2319 4 2380 2329 4 2380 2358
4 2380 2373 4 2380 2374 4 2380 2380 4
2380 2380 4 2380 2434 4 2380 2499 4 2380
2450 4 2380 2501 4 2380 2582 4 2380 2595
4 2380 2669 4 2380 2828 4 2380 2863 4
2380 2881 4 2380 2928 4 2380 2996 4 2380
2996 4 2380 3006 4 2380 3006 4 2380 3067
4 2380 3067 4 2380 1751 5 2380 2373 5
2380 2380 5 2380 2380 5 2380 2380 5 2380
2629 5 2380 2868 5 2380 2928 5 2380 2951
5 2380 1502 6 2380 1751 6 2380 2080 6
2380 2277 6 2380 2377 6 2380 2380 6 2380
2380 6 2380 2380 6 2380 2380 6 2380 2522
6 2380 2558 6 2380 2569 6 2380 2625 6
2380 2632 6 2380 
# 2381
averag binari search length for dens order list corrigendum cacm
februari 1972 flore i madpi g ca720210 jb januari 31
1978 3 40 pm 2381 5 2381 2381 5 2381
2381 5 2381 
# 2382
reconstruct of pictur from their project corrigendum cacm februari 1972
gordon r herman g t ca720209 jb januari 31 1978
3 42 pm 2382 5 2382 2382 5 2382 2382
5 2382 
# 2383
music and comput composit the problem discuss is that of
simul human composit of western popular music by comput and
some relev theori of music and harmoni ar given problem
with thi kind of program and sever scheme that ar
known not to work ar discuss sever previou comput composit
ar discuss includ the illiac suit a program to gener
short melodi fragment wa written to simul some of the
aspect of human composit five sampl of it output ar
present and discuss it wa discov that although the fragment
show mani of the characterist of popular melodi thei have
a strang alien sound it is theoriz that thi is
becaus the relev probabl which would discrimin against unfamiliar sequenc
were not us cacm februari 1972 moorer j a artifici
intellig heurist program model of cognit process comput music comput
composit music theori 3 44 3 65 ca720208 jb januari
31 1978 3 54 pm 2383 5 2383 2383 5
2383 2383 5 2383 
# 2384
hidden line plot program j6 algorithm a420 cacm februari 1972
williamson h hidden line plot surfac plot 4 9 ca720207
jb januari 31 1978 4 12 pm 2384 5 2384
2384 5 2384 2384 5 2384 
# 2385
zero of a complex polynomi c2 algorithm a419 cacm februari
1972 jenkin m a traub j f root root of
a polynomi zero of a polynomi 5 15 ca720206 jb
januari 31 1978 4 14 pm 2385 5 2385 2385
5 2385 2385 5 2385 
# 2386
dynam microprogram processor organ and program corrigendum cacm februari 1972
tucker a b ca720205 jb januari 31 1978 4 21
pm 2386 5 2386 2386 5 2386 2386 5 2386
# 2387
maximum comput power and cost factor in the central problem
a simpl analysi of some comput econom factor involv in
compar multimachin instal versu larg singl machin instal is given
and a mathemat model is deriv to assist polici decis
cacm februari 1972 oldehoeft a e halstead m h central
decentr econom of comput comput manag economi of scale 2
41 ca720204 jb januari 31 1978 4 25 pm 1653
4 2387 2387 4 2387 2387 4 2387 2852 4
2387 1417 5 2387 2387 5 2387 2387 5 2387
2387 5 2387 2852 5 2387 3050 5 2387 3190
5 2387 1417 6 2387 1771 6 2387 2345 6
2387 2345 6 2387 2387 6 2387 2387 6 2387
2479 6 2387 
# 2388
optim binari tree grown with a sort algorithm item can
be retriev from binari tree grown with a form of
the algorithm quicksort in an averag time proport to log
n where n is the number of item in the
tree the binari tree grown by thi algorithm sometim have
some branch longer than other therefor it is possibl to
reduc the averag retriev time by restructur the tree to
make the branch as uniform in length as possibl an
algorithm to do thi is present the us of thi
algorithm is discuss and it is compar with anoth which
restructur the tree after each new item is ad cacm
februari 1972 martin w a ness d n retriev inform
from binari tree global and local optim sort recurs 3
74 5 31 ca720203 jb januari 31 1978 4 30
pm 1175 4 2388 1919 4 2388 1919 4 2388
1969 4 2388 1997 4 2388 2191 4 2388 2191
4 2388 2388 4 2388 2388 4 2388 2679 4
2388 2783 4 2388 2784 4 2388 3054 4 2388
3054 4 2388 3121 4 2388 3121 4 2388 864
4 2388 308 5 2388 309 5 2388 2388 5
2388 2388 5 2388 2388 5 2388 2455 5 2388
2493 5 2388 2889 5 2388 2968 5 2388 2138
6 2388 2278 6 2388 2388 6 2388 2388 6
2388 2388 6 2388 2388 6 2388 2455 6 2388
2455 6 2388 
# 2389
preliminari report on a system for gener space plan a
comput languag and a set of program within that languag
ar describ which allow the formul and solv of a
class of space plan problem the languag is an extens
of algol and includ mean to repres space and object
to manipul them and to test the result arrang accord
to a varieti of constraint the algorithm us to solv
problem express in thi languag reli on heurist program both
the languag and the search algorithm ar detail cacm februari
1972 eastman c m autom design architectur heurist program space
plan 3 20 3 40 3 64 3 66 ca720202
jb januari 31 1978 4 35 pm 2389 4 2389
2078 5 2389 2389 5 2389 2389 5 2389 2389
5 2389 
# 2390
a propos for a comput base interact scientif commun becaus
of the problem creat by the explos of paper in
the mathemat scienc and the drawback that thi place on
research it is suggest that a tree of all mathemat
result and terminolog be maintain in a multitermin comput system
user of the system can store in the comput an
updat file of their current knowledg and on select a
paper to read thei can obtain from the comput the
minimum subtre of theorem requir to bring them from what
thei alreadi know to the background knowledg which the paper
assum under certain condit mean ar also provid for the
contribut of us comment by the reader of a work
and for interact between comment and with the author thi
paper describ how the system can be organ and the
role requir of reader writer and comment cacm februari 1972
pager d interact system organ of scientif commun reader writer
comment comput util inform retriev tree data structur 1 0
1 1 1 59 2 10 3 15 3 32
3 50 3 51 3 70 3 71 3 74
3 9 ca720201 jb februari 1 1978 8 51 am
2390 5 2390 2390 5 2390 2390 5 2390 2519
5 2390 2390 6 2390 
# 2391
unitari symmetr polynomi z algorithm r391 cacm januari 1972 schrack
g f symmetr polynomi elementari symmetr polynomi unitari symmetr polynomi
polynomi synthesi revers horner scheme revers synthet divis binomi coeffici
5 11 5 30 5 5 ca720112 jb februari 1
1978 8 55 am 2391 5 2391 2391 5 2391
2391 5 2391 
# 2392
in situ transposit of a rectangular matrix f1 algorithm c380
cacm januari 1972 macleod i d g rectangular matrix transpos
5 14 ca720111 jb februari 1 1978 8 57 am
2057 4 2392 2057 4 2392 2058 4 2392 2392
4 2392 2392 4 2392 2416 4 2392 1600 5
2392 2055 5 2392 2392 5 2392 2392 5 2392
2392 5 2392 
# 2393
calcul of fourier integr d1 algorithm a418 cacm januari 1972
einarsson b quadratur filon quadratur integr filon integr fourier coeffici
fourier integr fourier seri spline spline approxim spline quadratur extrapol
richardson extrapol 5 16 ca720110 jb februari 1 1978 9
00 am 1857 4 2393 2393 4 2393 2393 4
2393 1858 5 2393 2071 5 2393 2393 5 2393
2393 5 2393 2393 5 2393 
# 2394
order f f f f x when f x is
posit monoton cacm januari 1972 salzer h e order storag
retriev posit function monoton function increas function decreas function binari
system chebyshev zero squar rot continu fraction 5 40 ca720109
jb februari 1 1978 9 05 am 2394 4 2394
2394 4 2394 1872 5 2394 1903 5 2394 2394
5 2394 2394 5 2394 2394 5 2394 2533 5
2394 2394 6 2394 
# 2395
quadrat program for nonlinear regress a quadrat program algorithm is
describ for us with the magnifi diagon method of nonlinear
regress with linear constraint the regress method is publish in
jacm juli 1970 cacm januari 1972 shrager r i nonlinear
equat nonlinear regress nonlinear program quadrat program least squar inequ
constraint iter 5 15 5 41 ca720108 jb februari 1
1978 9 09 am 2395 5 2395 2395 5 2395
2395 5 2395 
# 2396
muse a model to understand simpl english muse is a
comput model for natur languag process base on a semant
memori network like that of quillian s tlc muse from
a model to understand simpl english process english sentenc of
unrestrict content but somewhat restrict format the model first appli
syntact analysi to elimin some interpret and then emploi a
simplifi semant intersect procedur to find a valid interpret of
the input while the semant process is similar to tlc
s the syntact compon includ the earli us of pars
tree and special purpos rule the relat tripl notat us
dure interpret of input is compat with muse s memori
structur allow direct verif of familiar concept and the addit
of new on muse also ha a repertoir of action
which rang from edit and report the content of it
own memori to an indirect form of question answer exampl
ar present to demonstr how the model interpret text resolv
ambigu add inform to memori gener from exampl and perform
variou action cacm januari 1972 mccalla g i sampson j
r natur languag process semant memori text comprehens question answer
artifici intellig human memori simul 3 36 3 42 3
62 3 65 3 74 ca720107 jb februari 1 1978
9 20 am 1400 4 2396 1553 4 2396 1945
4 2396 2127 4 2396 2127 4 2396 2178 4
2396 2309 4 2396 2310 4 2396 2396 4 2396
2396 4 2396 2396 4 2396 2396 4 2396 2561
4 2396 2730 4 2396 1487 5 2396 1856 5
2396 2092 5 2396 2127 5 2396 2396 5 2396
2396 5 2396 2396 5 2396 
# 2397
optim the polyphas sort corrigendum cacm januari 1972 shell d
l ca720106 jb februari 1 1978 9 21 am 2397
5 2397 2397 5 2397 2397 5 2397 
# 2398
teacher student author cai us the newbas system the pedagog
advantag of a gener purpos interact system call newbas catalyst
ar discuss newbas catalystincorpor an advanc implement of basic system
level interact featur and a gener capabl for extens through
user orient function attach applic of thi last featur to
provid a flexibl cai scan capabl is illustr an exampl
of interact at the system level show how student can
mix the advantag of independ or solo mode comput with
those of guid or dual mode interact preliminari experi with
the system in an urban secondari school set is discuss
cacm januari 1972 dwyer t a cai basic catalyst newbas
educ comput in educ extend languag interact system 1 50
1 51 3 32 4 22 ca720105 jb februari 1
1978 9 28 am 2309 5 2398 2398 5 2398
2398 5 2398 2398 5 2398 1856 6 2398 2398
6 2398 
# 2399
a crt edit system a test edit and manipul program
is describ the program oper from low cost cathod rai
tube entri and displai station with keyboard and 13 function
button applic potenti economi of oper and some aspect of
implement ar discuss cacm januari 1972 iron e t djorup
f m edit text cathod rai tube entri displai time
share 3 7 4 3 ca720104 jb februari 1 1978
9 31 am 2399 5 2399 2399 5 2399 2399
5 2399 
# 2400
us of the hough transform todetect line and curv in
pictur hough ha propos an interest and computation effici procedur
for detect line in pictur thi paper point out that
the us of angl radiu rather than slope intercept paramet
simplifi the comput further it also show how the method
can be us for more gener curv fit and give
altern interpret that explain the sourc of it effici cacm
januari 1972 duda r o hart p e pictur process
pattern recognit line detect curv detect colinear point point line
transform hough transform 3 63 ca720103 jb februari 1 1978
9 36 am 2400 5 2400 2400 5 2400 2400
5 2400 2788 5 2400 2910 5 2400 2400 6
2400 2400 6 2400 2788 6 2400 
# 2401
on shrink binari pictur pattern a parallel process algorithm for
shrink binari pattern to obtain singl isol element on for
each pattern is present thi procedur mai be us for
count pattern on a matrix and a hardwar implement of
the algorithm us larg scale integr technolog is envis the
princip featur of thi method ar the veri small window
emploi two by two element the parallel natur of the
process and the possibl of shrink ani pattern regardless of
the complex of it configur problem regard merg and disconnect
of pattern dure the process as well as the determin
of the maximum number of step necessari to obtain a
singl isol element from a pattern ar review and discuss
an analog with a neural network descript in term of
mcculloch pitt neuron is present cacm januari 1972 levialdi s
count binari pattern shrink parallel process multipl connect pictur 3
63 ca720102 jb februari 1 1978 9 43 am 2401
5 2401 2401 5 2401 2401 5 2401 
# 2402
pictori pattern recognit and the phase problem of x rai
crystallographi the avail of interact three dimension comput graphic system
coupl to power digit comput encourag the develop of algorithm
adapt to thi environ pictori pattern recognit techniqu make possibl
a number of approach to x rai structur determin base
on molecular model build i e the us of chemic
inform to frame structur hypothes which can computation be test
and refin by refer to the experiment data applic of
standard pattern recognit algorithm is hinder by the fact that
the cross correl between a model and the correct structur
cannot be comput becaus of a fundament incomplet in the
measur data howev it is possibl to comput an upper
bound to such a cross correl a simpl exampl demonstr
that thi inform can be the basi of a techniqu
for structur determin that can make effect us of an
interact graphic system model build by cross correl ha intrins
advantag over usual crystallograph techniqu base on the autocorrel or
patterson function especi for larg structur thi is signific for
crystallographi of biolog macromolecul hasbeen and will continu to be
a field of intens interest cacm januari 1972 lesk a
m pictori pattern recognit phase problem x rai crystallographi interact
graphic 3 13 3 17 3 63 ca720101 jb februari
1 1978 9 53 am 2402 5 2402 2402 5
2402 2402 5 2402 
# 2403
procedur for natur spline interpol e1 algorithm a472 cacm decemb
1973 herriot j g approxim interpol spline natur spline spline
approxim cubic natur spline 5 13 ca731205 jb januari 19
1978 2 47 pm 2403 5 2403 2403 5 2403
2403 5 2403 
# 2404
exponenti integr s13 algorithm a471 cacm decemb 1973 gautschi w
exponenti integr recurr relat recurs comput continu fraction 5 12
ca731204 jb januari 19 1978 2 48 pm 2404 4
2404 2119 5 2404 2404 5 2404 2404 5 2404
2404 5 2404 
# 2405
linear system with almost tridiagon matrix f4 algorithm a470 cacm
decemb 1973 kubicek m system of linear equat almost tridiagon
matrix spars matrix 5 14 ca731203 jb januari 19 1978
2 50 pm 2405 5 2405 2405 5 2405 2405
5 2405 
# 2406
a data definit and map languag a data definit languag
i sa declar comput languag for specifi data structur most
data definit languag concentr on the declar of logic data
structur with littl concern for how these structur ar physic
realiz on a comput system howev the need for data
definit languag which describ both the logic and physic aspect
of data is increasingli appar such languag will be a
kei system as well as in advanc data manag system
and distribut data base thi paper review past work in
the data definit languag for describ both logic and physic
aspect of data applic of these gener data definit languag
ar also discuss cacm decemb 1973 siblei e h taylor
r w data definit languag data and storag structur data
translat data base manag system file translat 3 51 3
70 3 73 4 29 4 82 ca731202 jb januari
19 1978 2 58 pm 2155 4 2406 2406 4
2406 2710 4 2406 2715 4 2406 2716 4 2406
2717 4 2406 2718 4 2406 2765 4 2406 2817
4 2406 2888 4 2406 2901 4 2406 2957 4
2406 2959 4 2406 2965 4 2406 3087 4 2406
3154 4 2406 2046 5 2406 2406 5 2406 2406
5 2406 2406 5 2406 2717 5 2406 2046 6
2406 2406 6 2406 
# 2407
curriculum recommend for undergradu program in inform system the need
for educ relat to inform system in organ is discuss
and a curriculum is propos for an undergradu program materi
necessari for such program is identifi and cours incorpor it
ar specifiedetail cours descript ar present program organ and a
problem of implement ar discuss cacm decemb 1973 couger j
d educ undergradu curricula manag system inform system inform analysi
system design system analysi 1 52 3 51 ca731201 jb
januari 19 1978 3 24 pm 2163 4 2407 2345
4 2407 2407 4 2407 2407 4 2407 2407 4
2407 2852 4 2407 3003 4 2407 3003 4 2407
3011 4 2407 3050 4 2407 2163 5 2407 2181
5 2407 2345 5 2407 2407 5 2407 2407 5
2407 2407 5 2407 3003 5 2407 1659 6 2407
1678 6 2407 1927 6 2407 1945 6 2407 2097
6 2407 2147 6 2407 2163 6 2407 2187 6
2407 2329 6 2407 2345 6 2407 2367 6 2407
2407 6 2407 2478 6 2407 2479 6 2407 2480
6 2407 2538 6 2407 
# 2408
solv the biharmon equat in a squar a direct versu
a semidirect method two method for solv the biharmon equat
ar compar on method is direct us eigenvalu eigenvector decomposit
the other method is iter solv a poisson equat directli
at each iter cacm novemb 1973 ehrlich l w biharmon
direct method block iter eigenvector eigenvalu decomposit 5 14 5
17 ca731118 jb januari 19 1978 3 28 pm 2408
5 2408 2408 5 2408 2408 5 2408 
# 2409
an algorithm for the approxim solut of wiener hopf integr
equat an explicit approxim solut is given for an equat
where it is assum that the classic wiener hopf techniqu
mai be appli it is furthermor assum that fourier transform
ar known explicitli the approxim solut depend on two posit
paramet cacm novemb 1973 stenger f integr equat wiener hopf
convolut approxim solut 5 18 ca731117 jb januari 19 1978
3 36 pm 2409 5 2409 2409 5 2409 2409
5 2409 
# 2410
a recurr scheme for convert from on orthogon expans into
anoth a gener of a scheme of ham for convert
a polynomi pn x into a chebyshev seri is combin
with a recurr scheme of clenshaw for sum ani finit
seri whose term satisfi a three term recurr formula cacm
novemb 1973 salzer h e orthogon expans seri interconvers recurr
scheme ham recurr clenshaw recurr three term recurr five term
recurr chebyshev seri 5 12 ca731116 jb januari 19 1978
4 16 pm 2410 5 2410 2410 5 2410 2410
5 2410 
# 2411
tree structur program cacm novemb 1973 wegner e control structur
flowchart goto statement induct assert least fix point optim in
compil program document program flow graph program languag design proof
of program semant of program languag structur program 4 12
4 22 5 24 ca731115 jb januari 19 1978 4
19 pm 2411 4 2411 2411 4 2411 2457 4
2411 2709 4 2411 2889 4 2411 2937 4 2411
2989 4 2411 3005 4 2411 3025 4 2411 3101
4 2411 2138 5 2411 2326 5 2411 2411 5
2411 2411 5 2411 2411 5 2411 
# 2412
comment on brent s scatter storag algorithm cacm novemb 1973
feldman j a low j r hash inform storag and
retriev scatter storag search symbol tabl 3 7 3 73
3 74 4 1 4 9 ca731114 jb januari 19
1978 4 40 pm 2412 4 2412 3053 4 2412
3083 4 2412 2412 5 2412 2412 5 2412 2412
5 2412 2543 5 2412 3053 5 2412 1329 6
2412 1785 6 2412 1973 6 2412 1992 6 2412
2107 6 2412 2109 6 2412 2412 6 2412 2543
6 2412 2673 6 2412 2707 6 2412 2770 6
2412 
# 2413
a note on subexpress order in the execut of arithmet
express a counterexampl to the suppos optim of an algorithm
for gener schedul for tree of task with unequ execut
time is present a comparison with the critic path heurist
is discuss cacm novemb 1973 den p j graham g
s schedul tree schedul task schedul multiprocessor schedul 4 32
8 3 8 1 ca731113 jb januari 25 1978 4
24 pm 2413 4 2413 2175 5 2413 2413 5
2413 2413 5 2413 2413 5 2413 
# 2414
arithmet overa finit field a1 algorithm a469 cacm novemb 1973
lam c mckai j algebra 5 19 ca731112 jb januari
20 1978 9 25 am 2414 5 2414 2414 5
2414 2414 5 2414 
# 2415
algorithm for automat numer integr over a finit interv d1
algorithm a468 cacm novemb 1973 patterson t n l automat
integr numer integr automat quadratur numer quadratur 5 16 ca731111
jb januari 20 1978 9 51 am 1352 4 2415
2415 4 2415 2415 4 2415 2415 4 2415 2550
4 2415 1040 5 2415 1982 5 2415 2074 5
2415 2415 5 2415 2415 5 2415 2415 5 2415
# 2416
matrix transposit in place f1 algorithm a467 cacm novemb 1973
brenner n transposit matrix oper permut primit root number theori
3 15 5 14 5 39 ca731110jb januari 20 1978
9 58 am 2057 4 2416 2058 4 2416 2392
4 2416 2416 4 2416 2416 4 2416 1600 5
2416 2058 5 2416 2416 5 2416 2416 5 2416
2416 5 2416 
# 2417
four combinatori algorithm g6 algorithm a466 cacm novemb 1973 ehrlich
g permut and combin 5 39 ca731109 jb januari 20
1978 9 59 am 2044 4 2417 2189 4 2417
2417 4 2417 2505 4 2417 2874 4 2417 2908
4 2417 2417 5 2417 2417 5 2417 2417 5
2417 2834 5 2417 2884 5 2417 521 5 2417
3115 5 2417 907 6 2417 969 6 2417 2045
6 2417 2045 6 2417 2417 6 2417 2417 6
2417 2417 6 2417 2466 6 2417 2466 6 2417
2884 6 2417 579 6 2417 785 6 2417 
# 2418
student s t frequenc s14 algorithm a465 cacm novemb 1973
hill g w student s t statist densiti function seri
approxim 5 12 5 5 ca731108 jb januari 20 1978
10 01 am 2418 5 2418 2418 5 2418 2418
5 2418 
# 2419
eigenvalu of a real symmetr tridiagon matrix f2 algorithm a464
cacm novemb 1973 reinsch c h eigenvalu qr algorithm 5
14 ca731107 jb januari 20 1978 10 03 am 2419
5 2419 2419 5 2419 2419 5 2419 2825 5
2419 2419 6 2419 
# 2420
experi with an automat theorem prover havingparti order infer rule
automat theorem prover need to be made much more effici
with thi in mind slagl ha shown how the axiom
for partial order can be replac by built in infer
rule when us a particular theorem prove algorithm base upon
hyper resolut and paramodul the new rule embodi the transit
of partial order and the close relationship between predic a
program ha been develop us a modifi version of these
rule thi new theorem prover ha been found to be
veri power for solv problem involv partial order thi paper
present a detail descript of the program and a comprehens
account of the experi that have been perform with it
cacm novemb 1973 slagl j r norton l m theorem
prove partial order resolut hyper resolut p1 resolut paramodul infer
rule heurist 3 64 3 66 ca731106 jb januari 20
1978 10 10 am 2356 4 2420 2420 4 2420
2874 4 2420 3143 4 2420 2227 5 2420 2420
5 2420 2420 5 2420 2420 5 2420 
# 2421
a scan convers algorithm with reduc storag requir most graphic
system us a raster scan output devic crt or hardcopi
maintain a displai file in the xy or random scan
format scan convert hardwar or softwar must be provid to
translat the pictur descript from the xy format to the
raster format publish scan convers algorithm which ar fast will
reserv a buffer area larg enough to accommod the entir
screen on the other hand those which us a small
buffer area ar slow becaus thei requir multipl pass through
the xy displai file the scan convers algorithm describ here
us a link list data structur to process the line
of the draw in strip correspond to group of scan
line a rel small primari memori buffer area is us
to accumul the binari imag for a group of scan
line when thi portion of the draw ha been plot
the buffer is reus for the next portion becaus of
the list process procedur us onli a singl pass through
the xy displai file is requir when gener the binari
imag and onli a slight increas in execut time over
the fulli buffer core result result slow that storag requir
can be reduc by more than 80 percent while caus
less than a 10 percent increas in execut time cacm
novemb 1973 jordan b w jr barrett r c graphic
scan convers raster plotter line draw discret imag dot gener
4 41 6 35 8 2 ca731105 jb januari 20
1978 10 28 am 1891 4 2421 2211 4 2421
2421 4 2421 2421 4 2421 2674 4 2421 2687
4 2421 1741 5 2421 2211 5 2421 2421 5
2421 2421 5 2421 2421 5 2421 2674 5 2421
1741 6 2421 2004 6 2421 2421 6 2421 2687
6 2421 
# 2422
adapt correct of program statement corrigendum cacm novemb 1973 jame
e b partridg d p ca731104 jb januari 20 1978
10 29 am 2422 5 2422 2422 5 2422 2422
5 2422 
# 2423
a parser gener system for construct compress compil thi paper
describ a parser gener system pg current in us on
the cdc 6500 comput at purdu univers the pg is
a fortran code compil in the input translat grammar each
bnf syntact rule correspond to a possibl empti code gener
realiz as an assembl languag fortran or algol subroutin that
is call whenev that syntact rule is appli in the
pars of a program typic on pass compil construct by
the pg translat sourc program at speed approach 14 000
card per minut for an xpl compil the parser program
and it tabl current occupi 288 word of 60 bit
core memori of which 140 word ar pars tabl entri
and 82 word ar link to code gener cacm novemb
1973 mickuna m d schneider v b parser gener translat
write system syntact analysi normal form grammar pushdown automata translat
grammar translat optim compress algorithm 4 12 5 22 5
23 ca731103 jb januari 20 197810 41 am 2179 4
2423 2423 4 2423 2423 4 2423 1337 5 2423
2015 5 2423 2423 5 2423 2423 5 2423 2423
5 2423 2733 5 2423 1781 6 2423 2179 6
2423 2423 6 2423 2786 6 2423 799 6 2423
# 2424
dynam verif of oper system decis dynam verif of a
decis impli that everi time the decis is made there
is a consist check perform on the decis us independ
hardwar and softwar the dynam verif of oper system decis
is us on the prime system be design and construct
at the univers of california berkelei prime is an experiment
time share which is to have the properti of continu
avail data privaci and cost effect the techniqu of dynam
verif allow the construct of an oper system which doe
not make certain decis improperli even in the presenc of
a singl hardwar or softwar fault furthermor multipl fault lead
to unreli oper onli if the fault happen to reinforc
each other on prime dynam verif is us to ensur
that on user s inform cannot becom avail to anoth
user gratuit even in the presenc of a singl hardwar
or softwar fault the amount of addit hardwar and softwar
requir for dynam verif can be modest cacm novemb 1973
fabri r s oper system data secur fault toler softwar
reliabl data privaci program verif modular comput system 4 32
ca731102 jb januari 20 1978 10 56 am 1828 4
2424 1854 4 2424 1877 4 2424 1960 4 2424
2150 4 2424 2317 4 2424 2319 4 2424 2377
4 2424 2342 4 2424 2376 4 2424 2379 4
2424 2424 4 2424 2482 4 2424 2618 4 2424
2632 4 2424 2704 4 2424 2723 4 2424 2738
4 2424 2740 4 2424 2741 4 2424 2867 4
2424 3184 4 2424 1749 5 2424 2424 5 2424
2424 5 2424 2424 5 2424 
# 2425
the programm as navig cacm novemb 1973 bachman c w
ca731101 jb januari 20 1978 10 59 am 2425 4
2425 2313 5 2425 2425 5 2425 2425 5 2425
2425 5 2425 
# 2426
algorithm scale1 scale2 and scale3 for determin of scale on
comput gener plot j6 algorithm a463 cacm octob 1973 lewart
c r plot scale for plot 4 41 ca731014 jb
januari 20 1978 11 01 am 2426 5 2426 2426
5 2426 2426 5 2426 
# 2427
bivari normal distribut s15 algorithm a462 cacm octob 1973 donnelli
t g bivari normal gaussian frequenc distribut 5 5 ca731013
jb januari 20 1978 11 03 am 1987 4 2427
2427 4 2427 2427 4 2427 1581 5 2427 1636
5 2427 2427 5 2427 2427 5 2427 2427 5
2427 
# 2428
cubic spline solut to a class of function differenti equat
d2 algorithm a461 cacm octob 1973 burkowski f j hoskin
w d differenti equat spline approxim 5 17 ca731012 jb
januari 20 1978 11 06 am 2428 5 2428 2428
5 2428 2428 5 2428 
# 2429
calcul of optimum paramet for altern direct implicit procedur d3
algorithm a460 cacm octob 1973 saylor p e sebastian j
d ellipt differ equat peaceman rachford dougla rachford w b
jordan optimum paramet altern direct implicit adi 5 14 5
17 ca731011 jb januari 20 1978 11 09 am 2429
5 2429 2429 5 2429 2429 5 2429 
# 2430
the elementari circuit of a graph h algorithm a459 cacm
octob 1973 syslo m m algorithm graph theori circuit search
algorithm path search algorithm search 3 74 4 22 5
32 ca731010 jb januari 20 1978 11 11 am 2430
4 2430 1961 5 2430 2430 5 2430 2430 5
2430 2430 5 2430 
# 2431
discret linear l1 approxim by interv linear program e2 algorithm
a458 cacm octob 1973 rober p d rober s s
discret approxim l1 approxim 5 13 5 41 ca731009 jb
januari 20 1978 11 13 am 2431 5 2431 2431
5 2431 2431 5 2431 
# 2432
addendum to a multipl precis divis algorithm cacm octob 1973
mifsud c j bohlen m j multipl precis divis overflow
3 15 4 0 5 1 ca731008 jb januari 20
1978 11 15 am 2432 4 2432 1975 5 2432
2432 5 2432 2432 5 2432 2432 5 2432 
# 2433
control structur in illiac iv fortran as part of an
effort to design and implement a fortran compil on the
illiac iv an extend fortran call ivtran ha been develop
thi languag provid a mean of express data and control
structur suitabl for exploit illiac iv parallel thi paper review
the hardwar characterist of the illiac and singl out unconvent
featur which could be expect to influenc languag and compil
design the implic of these featur for data layout and
algorithm structur ar discuss and the conclus is drawn that
data alloc rather than code structur is the crucial illiac
optim problem a satisfactori method of data alloc is then
present languag structur to util thi storag method and express
parallel algorithm ar describ cacm octob 1973 millstein r e
arrai process parallel detect explicit parallel arrai alloc parallel control
structur illiac iv fortran 4 12 4 21 4 22
ca731007 jb januari 20 1978 11 30 am 2433 5
2433 2433 5 2433 2433 5 2433 2785 5 2433
2433 6 2433 2685 6 2433 
# 2434
us page resid to select the work set paramet den
s method for select the work set paramet which us
interrefer interv is examin sever omiss in hi model ar
note and new assumpt ar introduc to overcom these omiss
us thi modifi model dene s result on page resid
ar rederiv and reconsid for select the work set paramet
cacm octob 1973 priev b g work set model page
program behavior program model 4 3 ca731006 jb januari 20
1978 11 34 am 1892 4 2434 1901 4 2434
2085 4 2434 2095 4 2434 2218 4 2434 2277
4 2434 2319 4 2434 2329 4 2434 2358 4
2434 2373 4 2434 2380 4 2434 2434 4 2434
2499 4 2434 2501 4 2434 2582 4 2434 2669
4 2434 2828 4 2434 2863 4 2434 2881 4
2434 2928 4 2434 2996 4 2434 3006 4 2434
3067 4 2434 1751 5 2434 2434 5 2434 2434
5 2434 2434 5 2434 
# 2435
a class of dynam memori alloc algorithm anew dynam memori
alloc algorithm the fibonacci system is introduc thi algorithm is
similar to but seem to have certain advantag over the
buddi system a gener is mention which includ both of
these system as special case cacm octob 1973 hirschberg d
s dynam storag alloc buddi system simul fibonacci fragment 3
89 4 32 4 39 ca731005 jb januari 20 1978
11 38 am 1389 4 2435 1552 4 2435 2162
4 2435 2435 4 2435 2596 4 2435 2768 4
2435 2845 4 2435 2902 4 2435 2955 4 2435
1184 5 2435 2435 5 2435 2435 5 2435 2435
5 2435 2596 5 2435 2747 5 2435 2768 5
2435 2845 5 2435 2902 5 2435 2911 5 2435
2955 5 2435 1051 6 2435 1062 6 2435 1184
6 2435 1184 6 2435 1184 6 2435 1184 6
2435 1184 6 2435 1211 6 2435 1552 6 2435
1879 6 2435 1879 6 2435 1879 6 2435 273
6 2435 2435 6 2435 2435 6 2435 2435 6
2435 2435 6 2435 2435 6 2435 2435 6 2435
2435 6 2435 2498 6 2435 2596 6 2435 2596
6 2435 2598 6 2435 2734 6 2435 2734 6
2435 2736 6 2435 2747 6 2435 2747 6 2435
2747 6 2435 2768 6 2435 2768 6 2435 2773
6 2435 2773 6 2435 2983 6 2435 
# 2436
a note on the confin problem thi note explor the
problem of confin a program dure it execut so that
it cannot transmit inform to ani other program except it
caller a set of exampl attempt to stake out the
boundari of the problem necessari condit for a solut ar
state and inform justifi cacm octob 1973 lampson b w
protect confin proprietari program privaci secur leakag of data 2
11 4 30 ca731004 jb januari 20 1978 11 41
am 2436 4 2436 2626 4 2436 2868 4 2436
2870 4 2436 2377 5 2436 2436 5 2436 2436
5 2436 2436 5 2436 2840 5 2436 2869 5
2436 3128 5 2436 3158 5 2436 1471 6 2436
1746 6 2436 2150 6 2436 2356 6 2436 2376
6 2436 2436 6 2436 2436 6 2436 2436 6
2436 2436 6 2436 2597 6 2436 2626 6 2436
2629 6 2436 2865 6 2436 2866 6 2436 2870
6 2436 2912 6 2436 3038 6 2436 3082 6
2436 3111 6 2436 
# 2437
gener perform analysi of kei to address transform method us
an abstract file concept thi paper present a new approach
to the analysi of perform of the variou kei to
address transform method in thi approach the kei in a
file ar assum to have been select from the kei
space accord to a certain probabilist select algorithm all file
with the same number of kei select from thi kei
space will be suitabl weight in accord with the algorithm
and the averag perform of the transform method on these
file will be us as the potenti of these method
us thi analysi method with the same overal perform can
be classifi and kei distribut partial to certain transform can
be identifi all thi can be done analyt the approach
is appli to a group of transform method us file
whose kei ar select randomli cacm octob 1973 lum v
y hash hash techniqu hash method hash code kei transform
kei to address transform direct address random random access scatter
storag inform retriev hash analysi random perform analysi 3 7
3 72 3 73 3 74 3 79 4 9
5 9 ca731003 jb januari 20 1978 11 51 am
2258 4 2437 2319 4 2437 2313 4 2437 2359
4 2437 2437 4 2437 2552 4 2437 2781 4
2437 2860 4 2437 2991 4 2437 2203 5 2437
2437 5 2437 2437 5 2437 2437 5 2437 
# 2438
a model and stack implement of multipl environ mani control
and access environ structur requir that storag for a procedur
activ exist at time when control is not nest within
the procedur activ thi is straightforward to implement by dynam
storag alloc with link block for each activ but rather
expens in both time and space thi paper present an
implement techniqu us a singl stack to hold procedur activ
storag which allow retent of that storag for durat not
necessarili ti to control flow the techniqu ha the properti
that in the simpl case it run ident to the
usual automat stack alloc and dealloc procedur applic of thi
techniqu to multitask coroutin backtrack label valu variabl and function
argument ar discuss in the initi model a singl real
processor is assum and the implement assum multipl process coordin
by pass control explicitli to on anoth a multiprocessor implement
requir onli a few chang to the basic techniqu as
describ cacm octob 1973 bobrow d g wegbreit b control
structur environ stack alloc dendrarchi retent dynam storag alloc access
environ funarg problem multitask coroutin backtrack label valu variabl function
argument multiprocessor system extens control structur 4 1 4 2
4 22 4 3 4 32 5 24 ca731002 jb
januari 23 1978 8 27 am 1972 4 2438 2156
4 2438 2168 4 2438 2438 4 2438 2438 4
2438 2723 4 2438 2736 4 2438 2833 4 2438
2855 4 2438 3074 4 2438 3112 4 2438 1826
5 2438 2314 5 2438 2438 5 2438 2438 5
2438 2438 5 2438 2625 5 2438 2922 5 2438
3081 5 2438 3101 5 2438 3112 5 2438 106
6 2438 1380 6 2438 1471 6 2438 1753 6
2438 1826 6 2438 1972 6 2438 2138 6 2438
2193 6 2438 2358 6 2438 2438 6 2438 2438
6 2438 2438 6 2438 2438 6 2438 2438 6
2438 2723 6 2438 2736 6 2438 2833 6 2438
2838 6 2438 3185 6 2438 731 6 2438 
# 2439
multipl termin under user program control in a time share
environ user written program on the dartmouth time share system
can commun with mani remot termin simultan and can control
the interact between these termin such program can be written
us standard input and output instruct in ani languag avail
on the system thi paper describ how thi multipl termin
facil wa implement without requir ani chang in the system
execut or in ani of the system s compil or
interpret cacm octob 1973 mcgeachi j s dtss multipl termin
remot termin remot consol time share on line interact on
line game 3 81 4 32 ca731001 jb januari 23
1978 8 33 am 2439 5 2439 2439 5 2439
2439 5 2439 
# 2440
local of the root of a polynomi algorithm r429 cacm
septemb 1973 driessen h b hunt e w lem ca730915
jb januari 23 1978 8 34 am 2440 5 2440
2440 5 2440 2440 5 2440 
# 2441
hidden line plot program algorithm r420 cacm septemb 1973 williamson
h ca730914 jb januari 23 1978 8 36 am 2441
5 2441 2441 5 2441 2441 5 2441 
# 2442
a spars matrix packag algorithm r408 cacm septemb 1973 lawrenc
e e ca730913 jb januari 23 1978 8 37 am
2442 5 2442 2442 5 2442 2442 5 2442 
# 2443
gener of permut in lexicograph order algorithm r323 cacm septemb
1973 roi m k ca730912 jb januari 23 1978 8
39 am 2443 4 2443 2443 5 2443 2443 5
2443 2443 5 2443 747 5 2443 
# 2444
find all cliqu of an undirect graph algorithm a457 cacm
septemb 1973 bron c kerbosch j cliqu maxim complet subgraph
cluster backtrack algorithm branch and bound techniqu recurs 3 71
5 32 ca730911 jb januari 23 1978 8 44 am
2444 5 2444 2444 5 2444 2444 5 2444 
# 2445
rout problem algorithm a456 cacm septemb 1973 fencl z rout
problem shortest path travel salesman problem hamiltonian circuit 5 40
ca730910 jb januari 23 1978 8 47 am 2445 5
2445 2445 5 2445 2445 5 2445 
# 2446
analysi of skew represent of the symmetr group algorithm a455
cacm septemb 1973 hunter d b william j m symmetr
group skew represent partit young diagram lattic permut binari model
outer product 5 30 ca730909 jb januari 23 1978 8
49 am 2446 5 2446 2446 5 2446 2446 5
2446 
# 2447
sard kernel for certain bivari cubatur an error analysi for
some bivari cubatur is given the remaind ar obtain by
the us of sard kernel numer result and comput graph
ar given for some of the kernel function cacm septemb
1973 barnhil r e pilcher d t cubatur sard kernel
numer integr remaind formula 5 13 5 16 ca730908 jb
januari 23 1978 8 52 am 2447 5 2447 2447
5 2447 2447 5 2447 
# 2448
revers execut cacm septemb 1973 zelkowitz m v debug pl
i revers execut backtrack 4 22 4 42 ca730907 jb
januari 23 1978 8 54 am 2448 5 2448 2448
5 2448 2448 5 2448 
# 2449
a simpl techniqu for structur variabl lookup a simpl techniqu
for the symbol tabl lookup of structur variabl base on
simpl automata theori is present the techniqu offer a determinist
solut to a problem which is current handl in a
nondeterminist manner in pl i and cobol compil cacm septemb
1973 gate g w poplawski d a symbol tabl organ
pl i and cobol structur variabl 4 12 ca730906 jb
januari 23 1978 9 17 am 2449 5 2449 2449
5 2449 2449 5 2449 2659 5 2449 2449 6
2449 
# 2450
empir work set behavior the work set model for program
behavior ha been propos in recent year as a basi
for the design of schedul and page algorithm although the
word work set ar now commonli encount in the literatur
deal with resourc alloc there is a dearth of publish
data on program measur in the hope that worker in
the field might find experiment evid upon which to substanti
and base theoret work cacm septemb 1973 rodriguez rosel j
virtual memori page work set softwar measur program behavior 4
3 ca730905 jb januari 23 1978 9 22 am 2373
4 2450 2374 4 2450 2380 4 2450 2450 4
2450 2450 4 2450 2595 4 2450 2996 4 2450
3006 4 2450 3006 4 2450 3067 4 2450 3067
4 2450 2373 5 2450 2374 5 2450 2450 5
2450 2450 5 2450 2450 5 2450 
# 2451
design of tree structur for effici queri a standard inform
retriev oper is to determin which record in a data
collect satisfi a given queri express in term of data
valu the process of locat the desir respons can be
repres by a tree search model thi paper pose an
optim problem in the design of such tree to serv
a well specifi applic the problem is academ in the
sens that ordinarili the optim tree cannot be implement by
mean of practic techniqu on the other hand it is
potenti us for the comparison it afford between observ perform
and that of an intuit attract ideal search procedur as
a practic applic of such a model thi paper consid
the design of a novel tree search scheme base on
a bit vector represent of data and show that essenti
the same algorithm can be us to design either an
ideal search tree or a bit vector tree an experiment
studi of a small format file illustr the concept cacm
septemb 1973 casei r g tree file inform storag and
retriev cluster search data structur data manag queri answer 3
62 3 74 ca730904 jb januari 23 1978 9 38
am 1050 4 2451 1234 4 2451 1935 4 2451
1936 4 2451 2017 4 2451 2032 4 2451 2257
4 2451 2257 4 2451 2360 4 2451 2360 4
2451 2451 4 2451 2451 4 2451 2451 4 2451
2451 4 2451 2452 4 2451 2452 4 2451 2556
4 2451 2556 4 2451 2765 4 2451 2978 4
2451 944 5 2451 1935 5 2451 1936 5 2451
2451 5 2451 2451 5 2451 2451 5 2451 2765
5 2451 2965 5 2451 849 5 2451 1936 6
2451 1976 6 2451 2046 6 2451 2046 6 2451
2451 6 2451 2451 6 2451 2452 6 2451 616
6 2451 
# 2452
evalu and select of file organ a model and system
thi work first discuss the factor that affect file data
base organ perform an elus subject and then present a
methodolog a model and a program system to estim primarili
total storag cost and averag access time of sever file
organ given a specif data base queri character and devic
relat specif base on these estim an appropri file structur
mai be select for the specif situat the system is
a conveni tool to studi file structur and to facilit
as much as possibl the process of data base structur
design and evalu cacm septemb 1973 cardena a f file
organ file structur file manag file organ perform file organ
model file structur design secondari index organ simul data base
access time storag requir data base analysi data manag 3
70 3 71 3 72 3 74 3 79 4
0 ca730903 jb januari 23 1978 9 46 am 1050
4 2452 1935 4 2452 1936 4 2452 2017 4
2452 2032 4 2452 2140 4 2452 2257 4 2452
2257 4 2452 2360 4 2452 2360 4 2452 2451
4 2452 2451 4 2452 2452 4 2452 2452 4
2452 2452 4 2452 2452 4 2452 2556 4 2452
2765 4 2452 2765 4 2452 2882 4 2452 2901
4 2452 3134 4 2452 1936 5 2452 1976 5
2452 2198 5 2452 2452 5 2452 2452 5 2452
2452 5 2452 2765 5 2452 2882 5 2452 849
5 2452 1936 6 2452 1976 6 2452 2046 6
2452 2198 6 2452 2451 6 2452 2452 6 2452
2452 6 2452 616 6 2452 627 6 2452 
# 2453
inform theori appli to the convers of decis tabl to
comput program us idea from inform theori thi paper develop
a heurist algorithm that convert a limit entri decis tabl
to a tree structur comput program with near minimum averag
process time the method is applic to ani limit entri
decis tabl and doe not requir that action have singl
rule or that the cost of test condit be equal
it is thu more gener than the previous publish heurist
algorithm compar to the optim algorithm of reinwald and soland
thi algorithm is easi to code and take a much
smaller translat time it is thu felt that it is
more us in practic the algorithm is well suit for
manual convers of decis tabl to flowchart cacm septemb 1973
ganapathi s rajaraman v decis tabl optimum comput program inform
measur 3 50 4 12 5 6 ca730902 jb januari
23 1978 10 01 am 1237 4 2453 1354 4
2453 1549 4 2453 1564 4 2453 1684 4 2453
2053 4 2453 2053 4 2453 2220 4 2453 2220
4 2453 2221 4 2453 2273 4 2453 2273 4
2453 2273 4 2453 2273 4 2453 2453 4 2453
2453 4 2453 2453 4 2453 2453 4 2453 2453
4 2453 2517 4 2453 2598 4 2453 2598 4
2453 2726 4 2453 2726 4 2453 2726 4 2453
2856 4 2453 2856 4 2453 2856 4 2453 2856
4 2453 3034 4 2453 3113 4 2453 1172 5
2453 1354 5 2453 2053 5 2453 2220 5 2453
2453 5 2453 2453 5 2453 2453 5 2453 2598
5 2453 2856 5 2453 753 5 2453 1172 6
2453 1172 6 2453 1327 6 2453 1354 6 2453
1548 6 2453 2053 6 2453 2220 6 2453 2220
6 2453 2263 6 2453 2453 6 2453 2453 6
2453 2598 6 2453 2691 6 2453 
# 2454
comput algorithm for close queue network with exponenti server method
ar present for comput the equilibrium distribut of custom in
close queue network with exponenti server express for variou margin
distribut ar also deriv the comput algorithm ar base on
two dimension iter techniqu which ar highli effici and quit
simpl to implement implement consider such as storag alloc strategi
and order of evalu ar examin in some detail cacm
septemb 1973 buzen j p queue theori queue network equilibrium
distribut steadi state distribut 5 12 5 5 8 1
8 3 ca730901 jb januari 23 1978 10 07 am
2454 5 2454 2454 5 2454 2454 5 2454 2712
5 2454 2741 5 2454 3070 5 2454 1526 6
2454 1749 6 2454 1805 6 2454 2454 6 2454
2454 6 2454 2454 6 2454 2741 6 2454 2988
6 2454 
# 2455
a gener of avl tree a gener of avl tree
is propos in which imbal up to triangl shape is
a small integ an experi is perform to compar these
tree with standard avl tree and with balanc tree on
the basi of mean retriev time of amount of restructur
expect and on the worst case of retriev time it
is shown that by permit imbal of up to five
unit the retriev time is increas a small amount while
the amount of restructur requir is decreas by a factor
of ten a few theoret result ar deriv includ the
correct of an earlier paper and ar duli compar with
the experiment data reason good correspond is found cacm august
1973 foster c c avl tree balanc tree inform storag
and retriev 3 7 3 72 4 49 5 31
ca730819 jb januari 23 1978 10 13 am 2455 4
2455 2455 4 2455 2493 4 2455 2889 4 2455
2968 4 2455 2278 5 2455 2388 5 2455 2455
5 2455 2455 5 2455 2455 5 2455 2889 5
2455 2968 5 2455 3042 5 2455 2138 6 2455
2388 6 2455 2388 6 2455 2455 6 2455 2455
6 2455 2455 6 2455 2839 6 2455 2889 6
2455 2968 6 2455 
# 2456
on the capabl of while repeat and exit statement a
well form program is defin as a program in which
loop and if statement ar properli nest and can be
enter onli at their begin a correspond definit is given
for a well form flowchart it is shown that a
program is well form if and onli if it can
be written with if repeat and multi level exit statement
for sequenc control it is also shown that if while
and repeat statement with singl level exit do not suffic
it is also shown that ani flowchart can be convert
to a well form flowchart by node split practic implic
ar discuss cacm august 1973 peterson w w kasami t
tokura n well form program while statement repeat statement exit
statement go to statement flowchart node split softwar reliabl 4
39 4 49 5 29 ca730818 jb januari 23 1978
10 20 am 2456 5 2456 2456 5 2456 2456
5 2456 2709 5 2456 3004 5 2456 3121 5
2456 1312 6 2456 1425 6 2456 1425 6 2456
308 6 2456 309 6 2456 2138 6 2456 2204
6 2456 2247 6 2456 2356 6 2456 2456 6
2456 2456 6 2456 2456 6 2456 2477 6 2456
2709 6 2456 3186 6 2456 
# 2457
induct methodsfor prove properti of program there ar two main
purpos in thi paper first clarif and extens of known
result about comput of recurs program with emphasi on the
differ between the theoret and practic approach second present and
examin of variou known method for prove properti of recurs
program discuss in detail ar two power induct method comput
induct and structur induct includ exampl of their applic cacm
august 1973 manna z ne s vuillemin j recurs program
least fix point comput induct structur induct 4 2 5
23 5 24 ca730817 jb januari 23 1978 10 24
am 2326 4 2457 2411 4 2457 2457 4 2457
2457 4 2457 2842 4 2457 2903 4 2457 2192
5 2457 2326 5 2457 2457 5 2457 2457 5
2457 2457 5 2457 2981 5 2457 3030 5 2457
3077 5 2457 3104 5 2457 210 6 2457 1834
6 2457 2060 6 2457 2247 6 2457 2356 6
2457 2457 6 2457 2457 6 2457 2457 6 2457
2457 6 2457 2651 6 2457 2683 6 2457 2958
6 2457 2972 6 2457 
# 2458
local of the root of a polynomi algorithm r429 cacm
august 1973 william e j ca730816 jb januari 23 1978
10 26 am 2458 5 2458 2458 5 2458 2458
5 2458 
# 2459
hu tucker minimum redund alphabet code method algorithm r428 cacm
august 1973 byrn j g ca730815 jb januari 23 1978
10 27 am 2346 4 2459 2459 4 2459 1114
5 2459 2459 5 2459 2459 5 2459 2459 5
2459 
# 2460
clenshaw curti quadratur algorithm r424 cacm august 1973 good a
j ca730814 jb januari 23 1978 10 29 am 2460
5 2460 2460 5 2460 2460 5 2460 
# 2461
graph plotter algorithm r412 cacm august 1973 watkin r p
ca730813 jb januari 23 1978 10 30 am 2461 5
2461 2461 5 2461 2461 5 2461 
# 2462
an effici prime number gener algorithm r357 cacm august 1973
demorgan r m ca730812 jb januari 23 1978 10 31
am 2462 5 2462 2462 5 2462 2462 5 2462
# 2463
complex gamma function algorithm r404 c404 cacm august 1973 andrejkova
g vinar j ca730811 jb januari 23 1978 10 33
am 2463 5 2463 2463 5 2463 2463 5 2463
# 2464
the complex method for constrain optim e4 algorithm a454 cacm
august 1973 richardson j a kuester j l optim constrain
optim box s algorithm 5 41 ca730810 jb januari 23
1978 10 34 am 2464 5 2464 2464 5 2464
2464 5 2464 
# 2465
gaussian quadratur formula for bromwich s integr d1 algorithm a453
cacm august 1973 piessen r gaussian quadratur bromwich s integr
complex integr numer invers of the laplac transform 5 16
5 13 ca730809 jb januari 23 1978 10 37 am
2465 5 2465 2465 5 2465 2465 5 2465 
# 2466
enumer combin of m out of n object g6 algorithm
a452 cacm august 1973 liu c n tang d t
permut combin 5 30 ca730808 jb januari 23 1978 10
39 am 2466 4 2466 2834 4 2466 3115 4
2466 2045 5 2466 2466 5 2466 2466 5 2466
2466 5 2466 2834 5 2466 3115 5 2466 907
6 2466 969 6 2466 2045 6 2466 2045 6
2466 2417 6 2466 2417 6 2466 2466 6 2466
2466 6 2466 2884 6 2466 579 6 2466 785
6 2466 
# 2467
chi squar quantil g1 algorithm a451 cacm august 1973 goldstein
r b chi squar asymptot approxim normal deviat chi squar
deviat degre of freedom 5 12 5 5 ca730807 jb
januari 23 1978 10 41 am 2467 4 2467 2793
4 2467 1606 5 2467 2467 5 2467 2467 5
2467 2467 5 2467 
# 2468
rosenbrock function minim e4 algorithm a450 cacm august 1973 machura
m mulawa a function minim rosenbrock s method 5 19
ca730806 jb januari 23 1978 10 43 am 2468 5
2468 2468 5 2468 2468 5 2468 
# 2469
petri net and speed independ design petri net ar investig
as on method of model speed independ asynchron circuit a
studi of circuit realiz of petri net lead to a
demonstr of their us in model speed independ oper thi
us is emphas by the design of a speed independ
processor from modul develop in the investig of petri net
implement cacm august 1973 misuna d speed independ asynchron petri
net 6 1 6 33 ca730805 jb januari 23 1978
10 46 am 2469 5 2469 2469 5 2469 2469
5 2469 
# 2470
fen an axiomat basi for program semant a formal system
is present which abstract the notion of data item function
and relat it is argu that the system is more
suitabl than set theori or it deriv for the concis
and accur descript of program semant it is shown how
the system can be us to build composit data type
out of simper on with the oper of row structur
and unit it is also demonstr that complet new primit
type can be introduc into languag through the mechan of
singleton data type both determinist and nondeterminist function ar shown
to be defin in the system it is describ how
the local environ can be model as a data item
and how imper statement can be consid function on the
environ the natur of recurs function is briefli discuss and
a techniqu is present by which thei can be introduc
into the system the techniqu is contrast with the us
of the paradox combin y the question of local and
global environ and of variou mode of function call and
paramet pass ar touch upon the theori is appli to
the proof of sever elementari theorem concern the semant of
the assign condit and iter statement an appendix is includ
which present in detail the formal system govern web and
fen the abstract us inform in the bodi of the
paper cacm august 1973 maclennan b j semant formal system
lambda calculu extens languag data type mode axiom correct formal
languag definit formal descript data structur descript languag model of
comput 4 22 5 21 5 24 5 26 ca730804
jb januari 23 1978 11 01 am 1469 4 2470
1486 4 2470 1491 4 2470 1781 4 2470 2021
4 2470 2060 4 2470 2178 4 2470 2222 4
2470 2227 4 2470 2294 4 2470 2315 4 2470
2326 4 2470 2326 4 2470 2470 4 2470 2470
4 2470 2470 4 2470 2470 4 2470 2684 4
2470 2732 4 2470 2865 4 2470 2896 4 2470
2943 4 2470 3014 4 2470 3044 4 2470 3068
4 2470 3077 4 2470 3124 4 2470 3143 4
2470 1303 5 2470 1469 5 2470 1834 5 2470
2264 5 2470 2470 5 2470 2470 5 2470 2470
5 2470 
# 2471
a learn program which plai partnership domino a learn program
ha been written is basic to plai four player partnership
domino becaus domino is a game of incomplet inform the
program us somewhat differ principl of artifici intellig from those
us in program for game of complet inform such as
checker chess and go the program wa construct to us
a strategi signatur tabl which classifi board situat through the
interact of game paramet each entri in the tabl contain
adapt determin weight indic the advi sabil of variou strategi
onc chosen a strategi then emploi probabl analysi and linear
polynomi evalu to choos a move our program win approxim
two third of it game in tournament situat and ha
defeat championship player cacm august 1973 smith m h artifici
intellig intellig learn heurist procedur heurist program game plai problem
solv domino incomplet inform machin learn signatur tabl learn program
strategi learn 3 62 3 64 3 66 3 69
ca730803 jb januari 23 1978 11 09 am 2471 5
2471 2471 5 2471 2471 5 2471 
# 2472
minim span tree algorithm r422 cacm juli 1973 kernighan b
w span tree minim span tree prim algorithm 5 32
ca730714 jb januari 23 1978 11 12 am 2472 5
2472 2472 5 2472 2472 5 2472 
# 2473
hidden line plot program algorithm r420 cacm juli 1973 macleod
i d g collin a m hidden line plot surfac
plot 4 9 ca730713 jb januari 23 1978 11 14
am 2473 5 2473 2473 5 2473 2473 5 2473
# 2474
difsub for solut of ordinari differenti equat algorithm c407 cacm
juli 1973 nikolai p j differenti equat stiff differenti equat
boundari valu problem 5 17 ca730712 jb januari 23 1978
11 16 am 2205 4 2474 2474 4 2474 2474
4 2474 2205 5 2474 2207 5 2474 2474 5
2474 2474 5 2474 2474 5 2474 
# 2475
solut of linear program problem in 0 1 variabl h1
algorithm a449 cacm juli 1973 fiala f linear program zero
on variabl 5 41 ca730711 jb januari 23 1978 11
19 am 2475 5 2475 2475 5 2475 2475 5
2475 
# 2476
equival between and or graph and context free grammar cacm
juli 1973 hall p a v artifici intellig and or
graph languag theori context free grammar 3 60 3 64
5 23 ca730710 jb januari 23 1978 11 21 am
2476 5 2476 2476 5 2476 2476 5 2476 
# 2477
multipl exit from a loop without the goto cacm juli
1973 bochmann g v control structur goto free program multipl
exit from loop exit statement 4 20 4 22 ca730709
jb januari 23 1978 11 23 am 2193 4 2477
2326 4 2477 2477 4 2477 2541 4 2477 2594
4 2477 3004 4 2477 2477 5 2477 2477 5
2477 2477 5 2477 2574 5 2477 2709 5 2477
3186 5 2477 1425 6 2477 2138 6 2477 2204
6 2477 2456 6 2477 2477 6 2477 2477 6
2477 
# 2478
comput scienc seminar for undergradu cacm juli 1973 kandel a
educ comput scienc curriculum imprecis synthesi fuzzi educ structur 1
52 6 0 ca730708 jb januari 23 1978 11 24
am 1413 4 2478 1654 4 2478 1720 4 2478
1771 4 2478 1927 4 2478 2147 4 2478 2163
4 2478 2345 4 2478 2478 4 2478 2478 4
2478 2478 4 2478 2594 4 2478 2852 4 2478
2899 4 2478 3003 4 2478 3130 4 2478 1205
5 2478 1771 5 2478 2329 5 2478 2478 5
2478 2478 5 2478 2478 5 2478 3003 5 2478
1659 6 2478 1678 6 2478 1927 6 2478 1945
6 2478 2097 6 2478 2147 6 2478 2163 6
2478 2187 6 2478 2329 6 2478 2345 6 2478
2367 6 2478 2407 6 2478 2478 6 2478 2479
6 2478 2480 6 2478 2538 6 2478 
# 2479
curriculum recommend for graduat profession program in inform system recommend
addendum on inform system administr an addendum to the report
of the acm curriculum committe on comput educ for manag
is propos the propos addendum is to includ in the
curriculum a cours on inform system administr it is import
for two reason 1 the system design must understand the
administr framework in which he must oper to work effect
and 2 an import object of the curriculum recommend is
to prepar the futur manag of the comput activ it
is felt that the import of these two reason justifi
the addit of the recommend cours the cours is outlin
in the format of the origin report cacm juli 1973
mcfarlan f w nolan r l educ manag inform system
inform system administr inform system manag comput manag 1 52
3 51 ca730707 jb januari 23 1978 12 30 pm
2479 4 2479 2020 5 2479 2479 5 2479 2479
5 2479 2479 5 2479 2852 5 2479 3003 5
2479 1417 6 2479 1659 6 2479 1678 6 2479
1771 6 2479 1927 6 2479 1945 6 2479 2097
6 2479 2147 6 2479 2163 6 2479 2187 6
2479 2329 6 2479 2345 6 2479 2345 6 2479
2367 6 2479 2387 6 2479 2407 6 2479 2478
6 2479 2479 6 2479 2479 6 2479 2480 6
2479 2538 6 2479 
# 2480
teach about program thi paper present the goal and organ
of a cours about program design to provid enter student
in a graduat program with a cultur enrich in their
profession live the student ar expect to have taken at
least two program cours prior to thi on and therefor
to be familiar with at least two program languag both
as student and user teach someon how to program is
similar to teach him to plai a music instrument neither
skill can be taught thei must be learn howev the
teacher still serv sever vital purpos to present a set
of rule for produc well form utter to offer numer
demonstr of hi own skill and to function as an
involv critic final the teacher is the sourc of inform
about the process in which the student is involv cacm
juli 1973 rosin r f educ program concept profession 1
52 2 2 4 22 ca730706 jb januari 23 1978
12 36 pm 2319 4 2480 2480 4 2480 2480
4 2480 2594 4 2480 2709 4 2480 2738 4
2480 2867 4 2480 2939 4 2480 2972 4 2480
3004 4 2480 3030 4 2480 3155 4 2480 3155
4 2480 2204 5 2480 2247 5 2480 2480 5
2480 2480 5 2480 2480 5 2480 3003 5 2480
1659 6 2480 1678 6 2480 1927 6 2480 1945
6 2480 2097 6 2480 2147 6 2480 2163 6
2480 2187 6 2480 2329 6 2480 2345 6 2480
2367 6 2480 2407 6 2480 2478 6 2480 2479
6 2480 2480 6 2480 2538 6 2480 
# 2481
the distribut of a program in primari and fast buffer
storag a virtual memori comput system with a fast buffer
cach memori between primari memori and the central process unit
is consid the optim distribut of a program between the
buffer and primari memori is studi us the program s
lifetim function express for the distribut of a program which
maxim the us fraction of the cost time integr of
primari and fast buffer storag ar obtain for swap and
nonswap buffer manag polici cacm juli 1973 gelenb e cach
virtual memori lifetim function cost time integr fast buffer 4
3 6 2 6 3 ca730705 jb januari 23 1978
12 41 pm 2374 4 2481 2481 4 2481 2669
4 2481 2863 4 2481 3016 4 2481 3052 4
2481 1901 5 2481 2481 5 2481 2481 5 2481
2481 5 2481 
# 2482
mix solut for the deadlock problem mixtur of detect avoid
and prevent provid more effect and practic solut to the
deadlock problem than ani on of these alon the individu
techniqu can be tailor for subproblem of resourc alloc and
still oper togeth to prevent deadlock thi paper present a
method base on the concept of the hierarch oper system
for construct appropri mixtur and suggest appropri subsystem for the
most frequent occur resourc alloc problem cacm juli 1973 howard
j h jr deadlock resourc alloc oper system multiprogram hierarch
system 4 30 4 32 ca730704 jb januari 23 1978
12 46 pm 1828 4 2482 1854 4 2482 1877
4 2482 1960 4 2482 2150 4 2482 2228 4
2482 2280 4 2482 2280 4 2482 2317 4 2482
2319 4 2482 2377 4 2482 2342 4 2482 2376
4 2482 2379 4 2482 2379 4 2482 2379 4
2482 2424 4 2482 2482 4 2482 2482 4 2482
2482 4 2482 2500 4 2482 2618 4 2482 2632
4 2482 2704 4 2482 2723 4 2482 2738 4
2482 2740 4 2482 2740 4 2482 2741 4 2482
2851 4 2482 2867 4 2482 2920 4 2482 3184
4 2482 1749 5 2482 1877 5 2482 2228 5
2482 2482 5 2482 2482 5 2482 2482 5 2482
# 2483
coko iii the cooper koz chess program coko iii is
a chess player written entir in fortran on the ibm
360 65 coko iii plai a minim chess game at
the rate of 2 sec cpu time per move with
a level close to lower chess club plai a select
tree search procedur control by tactic chess logist allow a
deploy of multipl minim game calcul to achiev some optim
move select the tree search algorithm ar the heart of
coko s effect yet thei ar conceptu simpl in addit
an interest phenomenon call a tree search catastroph ha plagu
coko s entir develop just as it troubl a human
player standard exponenti growth is curb to a larg extent
by the definit and trim of the fischer set a
clear distinct between tree prune and select tree search is
also made represent of the chess environ is describ along
with a strateg preanalysi procedur that map the lasker region
specif chess algorithm ar describ which could be us as
a command structur by anyon desir to do some chess
program experiment a comparison is made of some mysteri action
of human player and coko iii cacm juli 1973 kozdrowicki
e w cooper d w artifici intellig select search tree
search tree search catastroph heurist program chess algorithm lasker region
fischer set minim chess game strateg tactic tactic control mode
game plai alpha beta machin learn concept format command structur
minimax comput chess tournament auxiliari minim game 3 60 3
66 3 74 4 22 ca730703 jb januari 23 1978
1 07 pm 2483 5 2483 2483 5 2483 2483
5 2483 
# 2484
a note on inform organ and storag sinc the logic
structur of a data base can be repres by a
tree or graph it is quit natur for us to
view the process of design a data base as that
of construct a tree or a graph a gener method
for construct such a tree or a graph is provid
there ar three import element in thi gener construct method
name a set of binari relat an algorithm for construct
subset of a set and an algorithm for select an
element from the given set of object the us of
differ relat and algorithm result in differ inform structur as
list tree ring etc thu the problem of inform organ
and storag is reduc to that of defin relat and
formul algorithm under a given set of constraint the result
present mai be valuabl to design as us design concept
and mai serv as a basi for develop a formal
theori on the subject cacm juli 1973 huang j c
data base data base manag inform retriev inform structur file
organ storag alloc tree graph 3 70 3 73 3
74 5 32 ca730702 jb januari 23 1978 1 14
pm 2484 5 2484 2484 5 2484 2484 5 2484
# 2485
manag the comput resourc a stage hypothesi base on the
studi of expenditur for data process a descript stage hypothesi
is present it is suggest that the plan organ and
control activ associ with manag the comput resourc will chang
in charact over a period of time and will evolv
in pattern roughli correl to four stage of the comput
budget stage i comput acquisit stage ii intens system develop
stage iii prolifer of control and stage iv user servic
orient each stage is describ and relat to individu task
for manag the comput resourc cacm juli 1973 nolan r
l comput manag comput budget comput expenditur stage hypothesi plan
organ control comput resourc 2 41 2 43 3 50
ca730701 jb januari 23 1978 1 23 pm 2485 5
2485 2485 5 2485 2485 5 2485 2977 5 2485
2985 5 2485 3011 5 2485 3035 5 2485 2075
6 2485 2302 6 2485 2345 6 2485 2485 6
2485 2485 6 2485 2485 6 2485 2485 6 2485
# 2486
comput photocomposit of technic text in comput assist typeset by
mean of photocomposit special problem aris in highli technic materi
such as mathemat formula new solut to sever of these
problem have been devis in the inform system of the
american institut of physic thei includ the represent of special
charact foreign alphabet mathemat symbol etc not avail on input
keyboard or on the photocompos the gener of such symbol
e g by overprint the precis posit of accent mark
float diacrit line break i e word or formula place
partli at the end of on line and partli at
the begin of the next and certain aspect of error
correct cacm june 1973 alt f l yuni kirk j
photocomposit typeset print graphic text process 3 79 3 82
ca730614 jb januari 23 1978 1 30 pm 2486 5
2486 2486 5 2486 2486 5 2486 
# 2487
cubic spline solut to fourth order boundari valu problem the
cubic spline approxim to the fourth order differenti equat y
p x y q x y r x y t
x is shown to reduc to the solut of a
five term recurr relationship for some special case the approxim
is shown to be simpli relat to a finit differ
represent with a local truncat error of order y 720
delta 8 cacm june 1973 hoskin w d cubic spline
differenti equat boundari valu problem 5 13 5 17 ca730613
jb januari 23 1978 1 44 pm 2487 5 2487
2487 5 2487 2487 5 2487 
# 2488
least squar piecewis cubic curv fit the matric involv in
a linear least squar formul ar determin for the problem
of fit piecewis cubic function those possess a continu deriv
to arrai of planar data cacm june 1973 ferguson j
stalei p a curv fit data reduct function approxim approxim
spline 5 13 ca730612 jb januari 23 1978 1 47
pm 2488 5 2488 2488 5 2488 2488 5 2488
# 2489
number of multipli restrict partit a1 algorithm a448 cacm june
1973 beyer t swinehart d f partit enumer chang make
energi level degeneraci molecular vibrat energi level 3 13 5
30 ca730611 jb januari 23 1978 1 49 pm 2104
4 2489 2489 4 2489 2489 4 2489 1219 5
2489 2104 5 2489 2489 5 2489 2489 5 2489
2489 5 2489 
# 2490
effici algorithm for graph manipul h algorithm a447 effici algorithm
ar present for partit a graph into connect compon biconnect
compon and simpl path the algorithm for partit of a
graph into simpl path is iter and each iter produc
a new path between two vertic alreadi on path the
start vertex can be specifi dynam if v is the
number of vertic and e is the number of edg
each algorithm requir time and space proport to max v
e when execut on a random access comput cacm june
1973 hopcroft j tarjan r graph analysi of algorithm graph
manipul 5 32 ca730610 jb januari 23 1978 1 55
pm 2490 4 2490 2177 5 2490 2490 5 2490
2490 5 2490 2490 5 2490 
# 2491
thread code the concept of thread code is present as
an altern to machin languag code hardwar and softwar realiz
of it ar given in softwar it is realiz as
interpret code not need an interpret extens and optim ar
mention cacm june 1973 bell j r interpret machin code
time tradeoff space tradeoff compil code subroutin call thread code
4 12 4 13 6 33 ca730609 jb januari 23
1978 2 05 pm 2491 5 2491 2491 5 2491
2491 5 2491 2748 5 2491 3144 5 2491 1471
6 2491 2298 6 2491 2491 6 2491 2491 6
2491 2597 6 2491 2624 6 2491 2625 6 2491
2632 6 2491 
# 2492
the develop of decis tabl via pars of complex decis
situat a new pars techniqu is propos which allow pars
base onli on syntact characterist of the decis problem it
requir a descript of the problem in decis grid chart
format and allow the develop of decis tabl within defin
limit by avoid or at least minim repetit of condit
and action in the result tabl cacm june 1973 strunz
h decis tabl pars decis grid chart problem analysi 4
0 4 1 4 2 ca730608 jb januari 23 1978
2 10 pm 2220 4 2492 2492 4 2492 2518
4 2492 2598 4 2492 2616 4 2492 2726 4
2492 1548 5 2492 2492 5 2492 2492 5 2492
2492 5 2492 
# 2493
optimum data base reorgan point in certain data base organ
scheme the cost per access mai increas due to structur
ineffici caus by updat by reorgan the data base the
cost per access mai be reduc howev the high cost
of a reorgan prohibit frequent reorgan thi paper examin strategi
for select the optimum reorgan point cacm june 1973 shneiderman
b data base reorgan file inform retriev 3 73 ca730607
jb januari 23 1978 2 14 pm 2455 4 2493
2493 4 2493 2889 4 2493 2968 4 2493 2388
5 2493 2493 5 2493 2493 5 2493 2493 5
2493 2816 5 2493 3129 5 2493 2493 6 2493
2493 6 2493 2751 6 2493 2816 6 2493 2829
6 2493 
# 2494
a comput gener aid for cluster analysi a comput gener
graphic method which can be us in conjunct with ani
hierarch scheme of cluster analysi is describ and illustr the
graphic principl us is the represent of the element of
a data matrix of similar or dissimilar by comput print
symbol of charact overstrik of variou shade of dark where
a dark symbol correspond to a small dissimilar the plot
appli to a data matrix befor cluster and to the
rearrang matrix after cluster show at a glanc whether cluster
brought forth ani distinct cluster a well known set of
data consist of the correl of 24 psycholog test is
us to illustr the comparison of group by four method
of factor analysi and two method of cluster analysi cacm
june 1973 ling r f comput graphic cluster analysi numer
taxonomi hierarch cluster factor analysi 3 10 3 30 3
36 4 49 ca730606 jb januari 23 1978 2 20
pm 2494 5 2494 2494 5 2494 2494 5 2494
# 2495
adapt optim code gener for arithmet express to the instruct
set avail on present dai comput cacm june 1973 stockhausen
p f arithmet express code gener compil object code optim
regist assign tree 4 12 5 24 5 32 ca730605
jb januari 23 1978 2 24 pm 2495 5 2495
2495 5 2495 2495 5 2495 
# 2496
on the near optim of the shortest latenc time first
drum schedul disciplin for comput system in which it is
practic to determin the instantan drum posit a popular disciplin
for determin the sequenc in which the record ar to
be access is the so call shortest latenc time first
sltf disciplin when a collect of vari length record is
to be access from specifi drum posit it is known
that the sltf disciplin doe not necessarili minim the drum
latenc time howev we show that the total time to
access the entir collect for ani sltf schedul is never
as much as a drum revolut longer than a minimum
latenc schedul cacm june 1973 stone h s fuller s
h drum schedul shortest access time first minim latenc schedul
shortest latenc time first 4 31 4 41 6 35
ca730604 jb januari 23 1978 3 12 pm 2496 5
2496 2496 5 2496 2496 5 2496 2628 5 2496
3097 5 2496 2375 6 2496 2496 6 2496 2496
6 2496 
# 2497
synchron processor with memori content gener interrupt implement of the
lock unlock method of synchron processor in a multiprocessor system
usual requir uninterrupt memori paus type instruct an interlock scheme
call read interlock which doe not requir memori paus instruct
ha been develop for a dual dec pdp 10 system
with real time requir the read interlock method doe requir
a special read interlock instruct in the repertoir of the
processor and a special read interlock cycl in the repertoir
of the memori modul when a processor examin a lock
a memori locat with a read interlock instruct it will
be interrupt if the lock wa alreadi set examin a
lock immedi set it if it wa not alreadi set
thi event sequenc is a read interlock cycl write into
a lock clear it have the processor interrupt upon encount
a set lock instead of branch is advantag if the
branch would have result in an effect interrupt cacm june
1973 hill j c interrupt supervisor monitor debug parallel process
associ memori microprogram 4 32 6 29 ca730603 jb januari
23 1978 3 29 pm 1458 4 2497 1523 4
2497 1603 4 2497 1698 4 2497 1747 4 2497
1748 4 2497 1854 4 2497 1877 4 2497 1960
4 2497 2377 4 2497 2378 4 2497 2497 4
2497 2497 4 2497 2534 4 2497 2558 4 2497
2625 4 2497 2632 4 2497 2840 4 2497 2941
4 2497 3105 4 2497 3144 4 2497 1471 5
2497 2182 5 2497 2497 5 2497 2497 5 2497
2497 5 2497 
# 2498
minim wast space in partit segment a page virtual memori
system us a finit number of page size is consid
two algorithm for assign page to segment ar discuss both
of these algorithm ar simpl to implement the problem of
choos the page size to minim the expect valu of
total wast space in intern fragment and in a page
tabl per segment is then solv for a probabl densiti
function of segment size which mai be express as a
convex combin of erlang densiti cacm june 1973 gelenb e
dynam storag alloc virtual memori page multipl page size fragment
segment 4 0 4 3 4 32 6 34 8
3 ca730602 jb januari 23 1978 3 38 pm 2095
4 2498 2218 4 2498 2498 4 2498 2596 4
2498 2734 4 2498 2902 4 2498 2911 4 2498
3000 4 2498 1879 5 2498 2498 5 2498 2498
5 2498 2498 5 2498 2911 5 2498 1879 6
2498 273 6 2498 2435 6 2498 2498 6 2498
2734 6 2498 2773 6 2498 2983 6 2498 
# 2499
effici multiprogram resourc alloc and account although sometim thought of
as onli a compon of time share oper multiprogram can
involv broader question of resourc alloc sinc fair is not
requir to meet a respons criterion in a multiprogram system
it mai serv maxim resourc us to be unfair for
exampl by hold an input output channel idl for a
program while it complet a small amount of processor usag
enabl further us of the channel sever applic of thi
principl ar given and it is suggest that a multiprogram
execut might dynam adjust it alloc algorithm to gain effici
alloc of resourc is close connect to account for those
resourc rais the problem of repeat minim uncharg overhead and
rel weight of charg for depend resourc sinc weight mai
depend on alloc algorithm these ar not arbitrari account paramet
often the onli repeat account is on which omit an
extens overhead will be paid and should multiprogram prove effici
overcharg will result multiprogram turn on alloc of the memori
resourc essenti to control of other resourc the gener suggest
for alloc and account ar appli to thi question and
some detail provid for the case of a monitor which
control a virtual memori machin cacm june 1973 hamlet r
g monitor execut multiprogram effici resourc alloc resourc account 4
32 ca730601 jb januari 23 1978 3 51 pm 1892
4 2499 1901 4 2499 2085 4 2499 2095 4
2499 2218 4 2499 2277 4 2499 2319 4 2499
2329 4 2499 2358 4 2499 2373 4 2499 2380
4 2499 2434 4 2499 2499 4 2499 2501 4
2499 2582 4 2499 2669 4 2499 2828 4 2499
2863 4 2499 2881 4 2499 2928 4 2499 2996
4 2499 3006 4 2499 3067 4 2499 1751 5
2499 2499 5 2499 2499 5 2499 2499 5 2499
3114 5 2499 1502 6 2499 2499 6 2499 2745
6 2499 
# 2500
a practic approach to manag resourc and avoid deadlock resourc
schedul and alloc can be expens with regard to time
and space in multiprogram or time share environ involv larg
number of task and resourc with conflict requir detect and
or prevent of deadlock can requir massiv amount of addit
overhead if effici usag of resourc is to be maintain
a resourc manag program is describ which us link list
along with other techniqu to overcom a larg portion of
thi overhead the program which is current run as part
of a larg scale gener purpos oper system keep resourc
rel activ but doe not detect or prevent all deadlock
in it implement state certain chang which would permit more
comprehens level of deadlock prevent detect at addit cost have
not been incorpor in the run system due to the
infrequ of deadlock situat cacm mai 1973 frailei d j
deadlock resourc alloc schedul resourc manag multiprogram time share multiprocess
deadli embrac 4 30 4 32 ca730520 jb januari 23
1978 4 03 pm 2280 4 2500 2379 4 2500
2482 4 2500 2500 4 2500 2228 5 2500 2500
5 2500 2500 5 2500 2500 5 2500 
# 2501
wylbur an interact text edit and remot job entri system
wylbur is a comprehens system for manipul all kind of
text such as comput program letter and manuscript us typewrit
termin connect to a comput it ha facil for remot
job entri and retriev as well as facil for text
align and justif a power method for address text by
content is provid thi paper describ the extern appear of
wylbur as well as it intern structur a short descript
of the major featur of orvyl a gener purpos time
share system which oper in conjunct with wylbur is also
includ cacm mai 1973 fajman r borgelt j text edit
time share on line text edit interact text edit termin
remot termin termin system interact termin remot job entri remot
job retriev program prepar document prepar data entri content address
3 70 3 79 4 10 4 19 4 41
4 43 4 49 ca730519 jb januari 23 1978 4
11 pm 1892 4 2501 1901 4 2501 2085 4
2501 2095 4 2501 2218 4 2501 2277 4 2501
2299 4 2501 2319 4 2501 2329 4 2501 2358
4 2501 2373 4 2501 2380 4 2501 2434 4
2501 2499 4 2501 2501 4 2501 2501 4 2501
2582 4 2501 2629 4 2501 2669 4 2501 2828
4 2501 2863 4 2501 2881 4 2501 2915 4
2501 2928 4 2501 2996 4 2501 3006 4 2501
3067 4 2501 3114 4 2501 1502 5 2501 1751
5 2501 2501 5 2501 2501 5 2501 2501 5
2501 2623 5 2501 2501 6 2501 2537 6 2501
# 2502
a comment on the practic aspect of comput scienc educ
cacm mai 1973 estel r g educ comput engin comput
scienc curriculum system design 1 52 6 0 ca730518 jb
januari 23 1978 4 23 pm 2502 5 2502 2502
5 2502 2502 5 2502 
# 2503
anoth comment on comput music cacm mai 1973 wexelblat r
l ca730517 jb januari 23 1978 4 25 pm 2503
5 2503 2503 5 2503 2503 5 2503 
# 2504
concern music and comput composit in comput linguist cacm mai
1973 mcmorrow c h artifici intellig heurist program model of
cognit process comput music comput composit music theori 3 44
3 65 ca730516 jb januari 23 1978 4 27 pm
2504 5 2504 2504 5 2504 2504 5 2504 
# 2505
reflect free permut rosari permut and adjac transposit algorithm cacm
mai 1973 roi m k permut permut gener schedul combinatori
analysi 5 39 ca730515 jb januari 23 1978 4 29
pm 2044 4 2505 2189 4 2505 2292 4 2505
2417 4 2505 2505 4 2505 2505 4 2505 2505
4 2505 2874 4 2505 2908 4 2505 2189 5
2505 2292 5 2505 2505 5 2505 2505 5 2505
2505 5 2505 2908 5 2505 521 5 2505 2505
6 2505 2884 6 2505 521 6 2505 
# 2506
a spars matrix packag algorithm r408 cacm mai 1973 sale
r h j matrix spars matrix matrix manipul fortran standard
5 14 ca730514 jb januari 23 1978 4 30 pm
1613 4 2506 1646 4 2506 1900 4 2506 1955
4 2506 2025 4 2506 2154 4 2506 2365 4
2506 2506 4 2506 3060 4 2506 987 5 2506
2506 5 2506 2506 5 2506 2506 5 2506 
# 2507
exact solut of linear equat us residu arithmet algorithm r406
cacm mai 1973 howel j residu arithmet symmetr residu modulu
mix radix represent symmetr mix radix represent mix radix convers
prime number linear equat gaussian elimin matrix invers determin adjoint
matrix ill condit 3 5 5 14 ca730513 jb januari
23 1978 4 34 pm 2507 5 2507 2507 5
2507 2507 5 2507 
# 2508
increas the effici of quicksort algorithm r402 cacm mai 1973
wheeler r e sort quicksort 3 73 4 49 5
31 5 6 ca730512 jb januari 23 1978 4 35
pm 2508 5 2508 2508 5 2508 2508 5 2508
# 2509
minit algorithm for linear program algorithm r333 cacm mai 1973
obradov d ca730511 jb januari 23 1978 4 37 pm
2509 5 2509 2509 5 2509 2509 5 2509 
# 2510
minit algorithm for linear program algorithm r333 cacm mai 1973
holmgren b obradov d kolm a ca730510 jb januari 23
1978 4 38 pm 2510 5 2510 2510 5 2510
2510 5 2510 
# 2511
maxflow algorithm r324 cacm mai 1973 bayer g ca730509 jb
januari 23 1978 4 39 pm 2511 5 2511 2511
5 2511 2511 5 2511 
# 2512
coulomb wave function algorithm r300 cacm mai 1973 vo h
coulomb wave function wave function special function function evalu 5
12 ca730508 jb januari 23 1978 4 41 pm 2512
5 2512 2512 5 2512 2512 5 2512 
# 2513
a nonrecurs list move algorithm an effici nonrecurs algorithm is
given for move ani lisp type list in particular the
algorithm requir no storag other than the new node into
which the list is to be move and no addit
bit per node for mark the algorithm run in time
proport to the number of node in the list the
origin list structur is destroi as it is move cacm
mai 1973 reingold e m list move list copi list
travers garbag collect lisp 4 19 4 49 ca730507 jb
januari 23 1978 4 45 pm 1869 4 2513 2156
4 2513 2361 4 2513 2513 4 2513 2513 4
2513 2665 4 2513 2723 4 2513 2736 4 2513
2855 4 2513 2855 4 2513 3074 4 2513 3106
4 2513 3106 4 2513 3112 4 2513 1549 5
2513 1972 5 2513 2513 5 2513 2513 5 2513
2513 5 2513 2855 5 2513 1549 6 2513 1826
6 2513 210 6 2513 1972 6 2513 2513 6
2513 2766 6 2513 2833 6 2513 2998 6 2513
# 2514
an arrai grammar program system a packag of fortran program
ha been develop that permit a user to interact design
and test arrai grammar the user can control the rule
select procedur in a deriv or pars us weight program
matric he also ha a choic of instanc select scheme
raster random parallel exampl ar given involv arrai languag consist
of simpl geometr pattern as well as a languag of
neuron pictur cacm mai 1973 mercer a rosenfeld a pictur
grammar arrai grammar 3 63 5 23 8 2 ca730506
jb januari 23 1978 4 49 pm 2514 5 2514
2514 5 2514 2514 5 2514 
# 2515
minim event node network of project preced relat a procedur
for construct a minim event node network to repres a
set of preced relat without parallel activ is present a
minim event node network is an event node network in
which both the number of node and the number of
arc ar the minima to preserv the given preced relat
counterexampl ar given to show that the algorithm present by
a c fisher j s liebman and g l nemhaus
1968 produc event node network which ar not minim sinc
our procedur includ the set cover problem the time requir
mai grow exponenti with the number of given activ cacm
mai 1973 corneil d g gotlieb c c lee y
m network project event node network activ node network minim
event node network dummi activ project preced relat 3 57
5 32 8 3 ca730505 jb januari 24 1978 8
42 am 2515 4 2515 1723 5 2515 2515 5
2515 2515 5 2515 2515 5 2515 
# 2516
hierarch storag in inform retriev a probabilist analysi is emploi
to determin the effect of hierarch storag organ on inform
retriev oper the data storag hardwar is assum to consist
on n level of linearli connect memori hardwar with increas
data access time and increas data storag capabl a system
might for exampl consist of fast semiconductor memori comput core
memori extend core storag disk memori and data cell equat
ar deriv to predict the effect of such a system
on data access time us sequenti file random access file
and structur file emploi multipl hierarch link list cacm mai
1973 salasin j inform retriev hierarch storag 3 70 3
72 3 73 3 74 3 79 3 90 6
20 6 34 ca730504 jb januari 24 1978 8 48
am 2516 5 2516 2516 5 2516 2516 5 2516
# 2517
some comment on the us of ambigu decis tabl and
their convers to comput program thi paper comment upon recent
publish work on decis tabl translat us method similar to
the rule mask techniqu the applic of these method under
variou possibl convent on overal tabl mean is discuss and
it is argu that there is a place both for
the multi rule and the singl rule or action set
convent in decis tale usag cacm mai 1973 king p
j h johnson r g decis tabl system analysi program
3 50 3 59 4 19 4 29 4 49
ca730503 jb januari 24 1978 8 56 am 2053 4
2517 2221 4 2517 2273 4 2517 2453 4 2517
2517 4 2517 2517 4 2517 2517 4 2517 2518
4 2517 2616 4 2517 2726 4 2517 2856 4
2517 3034 4 2517 3034 4 2517 1684 5 2517
2053 5 2517 2221 5 2517 2517 5 2517 2517
5 2517 2517 5 2517 2616 5 2517 3034 5
2517 931 6 2517 1548 6 2517 1684 6 2517
1684 6 2517 2053 6 2517 2517 6 2517 2517
6 2517 
# 2518
program by questionnair an effect wai to us decis tabl
program by questionnair combin aspect of decis tabl program and
gener purpos program by us decis tabl to construct an
applic program through the select of certain sourc statement from
a predefin file it is propos that program by questionnairi
a us compromis between gener and special purpos program for
a signific class of larg scale problem the element of
the approach ar discuss an exist applic is describ cacm
mai 1973 low d w custom model applic develop programm
product simul gener automat program gener no reprogram 4 20
4 22 4 29 ca730502 jb januari 24 1978 9
03 am 2053 4 2518 2220 4 2518 2492 4
2518 2517 4 2518 2518 4 2518 2518 4 2518
2598 4 2518 2616 4 2518 2616 4 2518 2726
4 2518 3034 4 2518 1548 5 2518 1684 5
2518 2518 5 2518 2518 5 2518 2518 5 2518
# 2519
on the problem of commun complex inform the natur of
the difficulti involv in commun mathemat result between scientist us
a comput base inform retriev system is examin the problem
is analyz in term of psycholog and inform process process
and what turn out to be a viciou circl of
effect is describ these includ wai of augment written natur
languag by variou notat and linguist devic the exhibit of
the structur inher in the inform we ar commun and
a sophist interact system control by comput cacm mai 1973
pager d complex inform inform commun mathemat proof interact system
languag 1 0 1 1 1 50 1 52 1
59 2 42 3 32 3 51 3 62 3
70 3 81 ca730501 jb januari 24 1978 9 25
am 2519 4 2519 2390 5 2519 2519 5 2519
2519 5 2519 2519 5 2519 
# 2520
greatest common divisor of n integ and multipli algorithm c386
cacm april 1973 ragland l c good d i proof
of algorithm greatest common divisor euclidean algorithm induct assert method
3 15 4 42 5 10 5 24 ca730408 jb
januari 24 1978 9 27 am 2520 5 2520 2520
5 2520 2520 5 2520 
# 2521
ten subroutin for the manipul of chebyshev seri c1 algorithm
a446 cacm april 1973 brouck r chebyshev seri differenti integr
curv fit approxim neg power 5 12 5 13 5
16 ca730407 jb januari 24 1978 9 29 am 2028
4 2521 2521 4 2521 2521 4 2521 2521 4
2521 3099 4 2521 2028 5 2521 2031 5 2521
2521 5 2521 2521 5 2521 2521 5 2521 2762
5 2521 3135 5 2521 2521 6 2521 
# 2522
the design implement and evalu of a work set dispatch
the behavior of a comput system is larg depend upon
the algorithm emploi to alloc the system resourc to the
process compet for them recent research in time share page
system ha develop the work set model for program behavior
and ar sourc alloc strategi base on thi model ha
been propos two implement along these principl have been report
but it seem that in neither case have further result
been announc thi report discuss the design and implement of
a dispatch base on the work set principl present data
to permit analysi of it behavior and indic futur direct
of research on method of control a comput system cacm
april 1973 rodriguez rosel j dupui j p work set
dispatch schedul time share system resourc alloc softwar evalu oper
system supervisori system 4 31 4 32 ca730406 jb januari
24 1978 9 36 am 2522 5 2522 2522 5
2522 2522 5 2522 2928 5 2522 1751 6 2522
2277 6 2522 2380 6 2522 2522 6 2522 2569
6 2522 
# 2523
a region color techniqu for scene analysi a method of
convert a pictur into a cartoon or map whose region
correspond to differ textur region is describ textur edg in
the pictur ar detect and solid region surround by these
usual broken edg ar color in us a propag process
the result map is clean by compar the region color
with the textur of the correspond region in the pictur
and also by merg some region with other accord to
criteria base on topolog and size the method ha been
appli to the construct of cloud cover map from cloud
cover pictur obtain by satellit cacm april 1973 strong iii
j p rosenfeld a pictur process scene analysi edg detect
3 63 8 2 ca730405 jb januari 24 1978 9
48 am 2523 5 2523 2523 5 2523 2523 5
2523 2980 5 2523 2523 6 2523 
# 2524
some approach to best match file search the problem of
search the set of kei in a file to find
a kei which is closest to a given queri kei
is discuss after closest in term of a metric on
the the kei space is suitabl defin three file structur
ar present togeth with their correspond search algorithm which ar
intend to reduc the number of comparison requir to achiev
the desir result these method ar deriv us certain inequ
satisfi by metric and by graph theoret concept some empir
result ar present which compar the effici of the method
cacm april 1973 burkhard w a keller r m match
file structur file search heurist best match 3 73 3
79 4 9 ca730404 jb januari 24 1978 9 54
am 1676 4 2524 1682 4 2524 1728 4 2524
1860 4 2524 1973 4 2524 2018 4 2524 2032
4 2524 2033 4 2524 2107 4 2524 2109 4
2524 2203 4 2524 2251 4 2524 2359 4 2524
2524 4 2524 2543 4 2524 2552 4 2524 2559
4 2524 2991 4 2524 3053 4 2524 1785 5
2524 2524 5 2524 2524 5 2524 2524 5 2524
2575 5 2524 2966 5 2524 3134 5 2524 1976
6 2524 2160 6 2524 2524 6 2524 2524 6
2524 2524 6 2524 2990 6 2524 
# 2525
a statist studi of the accuraci of float point number
system thi paper present the statist result of test of
the accuraci of certain arithmet system in evalu sum product
and inner product and analyt error estim for some of
the comput the arithmet system studi ar 6 digit hexadecim
and 22 digit binari float point number represent combin with
the usual chop and round mode of arithmet with variou
number of guard digit and with a modifi round mode
with guard digit in a certain sens arithmet system differ
onli in their us of binari or hexadecim number represent
ar shown to be approxim statist equival inaccuraci further the
usual round mode with guard digit is shown to be
statist superior in accuraci to the usual chop mode in
all case save on the modifi round mode is found
to be superior to the chop mode in all case
cacm april 1973 kuki h codi w j error analysi
float point arithmet round guard digit number represent 5 11
5 5 6 32 ca730403 jb januari 24 1978 10
04 am 2525 4 2525 1474 5 2525 2525 5
2525 2525 5 2525 2525 5 2525 
# 2526
asymmetr memori hierarchi a studi is present of some of
the system implic of memori hierarchi in which the back
or secondari store ha a veri small read time rel
of both the time requir for write and to the
read time of convent back storag devic sever analyt model
ar introduc and it is shown that such hierarchi mai
oper in wai which differ from those of more convent
hierarchi in particular it is shown that it mai not
be necessari to multiprogram in such a situat in the
past back storag devic have been roughli symmetr with respect
to their read and write time thi situat mai not
continu as sever devic ar current under develop which mai
have a veri small read time write time ratio thi
studi place particular emphasi on on such system the rca
read write holograph optic memori cacm april 1973 william j
asymmetr memori hierarchi demand page holograph optic memori memori devic
memori hierarchi page storag devic storag hierarchi virtual memori 4
3 4 32 5 2 6 2 6 34 ca730402
jb januari 24 1978 10 15 am 1892 4 2526
1924 4 2526 2095 4 2526 2218 4 2526 2297
4 2526 2374 4 2526 2526 4 2526 2667 4
2526 2668 4 2526 2862 4 2526 2863 4 2526
1728 5 2526 2526 5 2526 2526 5 2526 2526
5 2526 
# 2527
implement of high level languag machin comput machin which directli
execut the statement of a high level languag have been
propos in the past thi report describ the actual implement
of such a machin it is a comput whose machin
languag is apl the machin is fulli oper and correctli
execut almost all of the apl oper on scalar vector
and arrai the machin automat alloc memori execut statement call
function convert number from on type to anoth check subscript
and automat detect mani type of programm error cacm april
1973 hassitt a lageschult j w lyon l e comput
architectur high level languag machin emul microprogram interpret execut speed
apl 4 1 6 2 ca730401 jb januari 24 1978
10 21 am 2202 4 2527 2527 4 2527 1542
5 2527 2527 5 2527 2527 5 2527 2527 5
2527 
# 2528
binari pattern reconstruct from project z algorithm r445 cacm march
1973 lau j pattern reconstruct imag reconstruct data compress pictur
process 3 63 5 30 ca730311 jb januari 24 1978
10 22 am 2528 5 2528 2528 5 2528 2528
5 2528 
# 2529
binari pattern reconstruct from project z algorithm a445 cacm march
1973 chang s pattern reconstruct imag reconstruct data compress pictur
process 3 63 5 30 ca730310 jb januari 24 1978
10 25 am 2142 4 2529 2529 4 2529 2231
5 2529 2529 5 2529 2529 5 2529 2529 5
2529 
# 2530
an algorithm for extract phrase in a space optim fashion
z algorithm a444 cacm march 1973 wagner r a inform
retriev code text compress 3 70 5 6 ca730309 jb
januari 24 1978 10 26 am 1973 4 2530 1992
4 2530 2138 4 2530 2203 4 2530 2251 4
2530 2530 4 2530 2530 4 2530 2537 4 2530
2543 4 2530 2559 4 2530 2573 4 2530 2623
4 2530 2819 4 2530 2991 4 2530 3053 4
2530 3083 4 2530 2107 5 2530 2530 5 2530
2530 5 2530 2530 5 2530 2537 5 2530 2107
6 2530 2530 6 2530 
# 2531
graduat educ the ph glut cacm march 1973 payn w
h graduat educ ph product accredit 1 5 2 2
2 3 ca730308 jb januari 24 1978 10 28 am
2531 5 2531 2531 5 2531 2531 5 2531 2662
5 2531 2531 6 2531 
# 2532
on harrison s substr test techniqu cacm march 1973 bookstein
a string substr hash inform storag and retriev 3 74
5 30 5 5 ca730307 jb januari 24 1978 10
30 am 2532 4 2532 2631 4 2532 2746 4
2532 3001 4 2532 2139 5 2532 2532 5 2532
2532 5 2532 2532 5 2532 2631 5 2532 2139
6 2532 2532 6 2532 
# 2533
grai code and the sign sequenc when f f f
f x is order cacm march 1973 salzer h e
grai code sign sequenc order posit monoton function binari system
galoi sum 5 10 ca730306 jb januari 24 1978 10
35 am 2533 4 2533 2394 5 2533 2533 5
2533 2533 5 2533 2533 5 2533 
# 2534
design and implement of a diagnost compil for pl i
pl c is a compil for a dialect for pl
i the design object wa to provid a maximum degre
of diagnost assist in a batch process environ for the
most part thi assist is implicit and is provid automat
by the compil the most remark characterist of pl c
is it persever it complet translat of everi program submit
and continu execut until a user establish error limit is
reach thi requir that the compil repair error encount dure
both translat and execut and the design of pl c
is domin by thi consider pl c also introduc sever
explicit user control facil for program test to accommod these
extens to pl i without abandon compat with ibm compil
pl c permit pseudo comment construct whose content can option
be consid either sourc test or comment in spite of
the diagnost effort pl c is a fast and effici
processor it effect demonstr that compil can provid better diagnost
assist than is customarili offer even when a sophist sourc
languag is emploi and that thi assist need not be
prohibit costli cacm march 1973 conwai r w wilcox t
r compil debug pl i program languag 1 5 4
12 4 42 ca730305 jb januari 24 1978 10 45
am 1179 4 2534 1288 4 2534 1323 4 2534
1358 4 2534 1380 4 2534 1544 4 2534 1646
4 2534 1665 4 2534 1781 4 2534 1781 4
2534 1787 4 2534 1989 4 2534 2111 4 2534
2112 4 2534 2182 4 2534 2251 4 2534 2497
4 2534 2534 4 2534 2534 4 2534 2534 4
2534 2534 4 2534 2534 4 2534 2534 4 2534
2534 4 2534 2541 4 2534 2543 4 2534 2556
4 2534 2556 4 2534 2559 4 2534 2650 4
2534 2650 4 2534 2698 4 2534 2708 4 2534
2708 4 2534 2733 4 2534 2770 4 2534 2820
4 2534 2887 4 2534 3053 4 2534 3073 4
2534 3083 4 2534 3155 4 2534 1787 5 2534
1959 5 2534 1973 5 2534 2111 5 2534 2182
5 2534 2534 5 2534 2534 5 2534 2534 5
2534 2708 5 2534 2820 5 2534 2971 5 2534
3045 5 2534 799 5 2534 830 5 2534 1477
6 2534 1477 6 2534 1491 6 2534 1491 6
2534 1787 6 2534 1835 6 2534 1974 6 2534
2111 6 2534 2534 6 2534 2534 6 2534 2534
6 2534 2534 6 2534 2556 6 2534 680 6
2534 799 6 2534 
# 2535
the effect of multiplex on a comput commun system a
studi is made of the wai in which asynchron time
divis multiplex chang the stochast natur of the arriv process
from a user to the comput and consequ affect the
perform of a time share comput commun system it is
conclud that while for certain valu of system paramet there
is notic improv in the perform of the comput model
in the sens that time share schedul delai ar reduc
these improv ar offset by the transmiss delai impos by
multiplex so that there mai be littl or no chang
in the comput commun system perform analyt and simul result
ar base on the model of the comput commun system
be an m d 1 queue the multiplexor in tandem
with a singl exponenti server the comput analyt result includ
a gener descript of the output process of an m
d 1 queue and the condit under which thi output
process is approxim poisson cacm march 1973 pack c d
comput commun time share multiplex schedul algorithm oper system 3
80 3 81 6 20 ca730304 jb januari 24 1978
11 13 am 2535 5 2535 2535 5 2535 2535
5 2535 
# 2536
telecommun us a front end minicomput the us of a
front end minicomput to provid vari remot termin access to
a larg scale comput is consid the problem of embed
telecommun i o within an oper system ar discuss and
it is shown how the decentr of intellig acquir by
front end process vastli simplifi the problem a specif implement
is discuss with emphasi on the main processor minicomput link
the hardwar softwar implement the effect of the main processor
oper system and an assess of the advantag over a
hard wire line control cacm march 1973 feinroth y franceschini
e goldstein m telecommun minicomput front end processor remot job
entri remot termin 3 81 4 32 4 41 ca730303
jb januari 24 1978 11 23 am 1657 4 2536
2080 4 2536 2357 4 2536 2536 4 2536 1523
5 2536 2536 5 2536 2536 5 2536 2536 5
2536 2919 5 2536 2536 6 2536 2593 6 2536
2629 6 2536 
# 2537
common phrase and minimum space text storag a method for
save storag space for text string such as compil diagnost
messag is describ the method reli on hand select of
a set of text string which ar common to on
or more messag these phrase ar then store onli onc
the storag techniqu give rise to a mathemat optim problem
determin how each messag should us the avail phrase to
minim it storag requir thi problem is nontrivi when phrase
which overlap exist howev a dynam program algorithm is present
which solv the problem in time which grow linearli with
the number of charact in the text algorithm 444 appli
to thi paper cacm march 1973 wagner r a diagnost
messag error messag common phrase minimum space text storag optim
dynam program 3 73 4 10 5 41 ca730302 jb
januari 24 1978 1 12 pm 1973 4 2537 1992
4 2537 2138 4 2537 2203 4 2537 2251 4
2537 2530 4 2537 2537 4 2537 2537 4 2537
2543 4 2537 2559 4 2537 2573 4 2537 2991
4 2537 3053 4 2537 3083 4 2537 2107 5
2537 2530 5 2537 2537 5 2537 2537 5 2537
2537 5 2537 2623 5 2537 2819 5 2537 2107
6 2537 2501 6 2537 2537 6 2537 2537 6
2537 2537 6 2537 
# 2538
a comput scienc cours program for small colleg the acm
subcommitte on small colleg program of the committe on curriculum
in comput scienc ccc wa appoint in 1969 to consid
the uniqu problem of small colleg and univers and to
make recommend regard comput scienc program at such school thi
report author by both the subcommitte and ccc suppli a
set of recommend for cours and necessari resourc implement problem
ar discuss specif within the constraint of limit faculti and
for the purpos of satisfi a wide varieti of object
detail descript of four cours ar given suggest ar made
for more advanc work and an extens librari list is
includ cacm march 1973 aust r h engel g l
comput scienc educ cours propos small colleg program cours social
implic cours comput organ cours file organ cours bibliographi 1
52 ca730301 jb januari 24 1978 1 22 pm 2538
5 2538 2538 5 2538 2538 5 2538 2899 5
2538 3003 5 2538 1659 6 2538 1678 6 2538
1771 6 2538 1927 6 2538 1945 6 2538 2097
6 2538 2147 6 2538 2163 6 2538 2187 6
2538 2329 6 2538 2345 6 2538 2367 6 2538
2407 6 2538 2478 6 2538 2479 6 2538 2480
6 2538 2538 6 2538 2538 6 2538 
# 2539
solut of the transcendent equat w exp w x c5
algorithm a443 cacm februari 1973 fritsch f n shafer r
e crowlei w p transcendent function evalu solut of transcendent
equat 5 12 5 15 ca730209 jb januari 24 1978
1 26 pm 2539 5 2539 2539 5 2539 2539
5 2539 
# 2540
properti of the work set model corrigendum cacm februari 1973
den p j schwartz s c ca730208 jb januari 24
1978 1 28 pm 2540 5 2540 2540 5 2540
2540 5 2540 
# 2541
an overview of the ispl comput system design thi paper
explor the advantag of the concurr design of the languag
oper system and machin via microcod to creat an interact
program laboratori it describ the synergist effect that the freedom
to move and alter featur from on of these domain
to anoth ha had on the design of thi system
which ha not been implement thi freedom simplifi both increment
compil and the system s address structur and central the
commun mechan enabl the construct of hierarch subsystem it also
suggest an import new concept for oper system separ of
the schedul from the mainten function in resourc alloc thi
separ enabl incorpor of new schedul algorithm decis of what
to do without endang the system integr correctli perform the
schedul decis cacm februari 1973 balzer r m concurr design
oper system schedul interprogram commun increment compil virtual address debug
hierarch subsystem 4 0 4 13 4 22 4 30
4 32 4 41 4 42 6 20 ca730207 jb
januari 24 1978 1 59 pm 1323 4 2541 1358
4 2541 1380 4 2541 1665 4 2541 1781 4
2541 1787 4 2541 1989 4 2541 2112 4 2541
2193 4 2541 2326 4 2541 2477 4 2541 2534
4 2541 2541 4 2541 2541 4 2541 2594 4
2541 2698 4 2541 2733 4 2541 2820 4 2541
3004 4 2541 3073 4 2541 3155 4 2541 2541
5 2541 2541 5 2541 2541 5 2541 3186 5
2541 799 5 2541 
# 2542
a softwar design and evalu system a critic failur of
current softwar system design and implement methodolog is that the
perform of a propos design is not evalu befor it
is actual implement in thi paper the reason for thi
failur ar explor and a new methodolog which overcom mani
of the difficulti is propos a system which integr perform
evalu with design and implement is describ thi system is
base on a simpl high level languag which is us
to describ the evolv system at all stage of it
develop the sourc languag descript is us as direct input
to perform analysi and simul routin us the perform inform
obtain from these routin as feedback the problem which advers
affect perform ar detect earli enough so that thei can
be correct without costli major reimplement of the propos system
cacm februari 1973 graham r m clanci g j jr
devanei d b oper system develop languag process softwar evalu
compil system program supervisori system debug program mainten model system
integr simul 4 0 4 12 4 22 4 30
4 42 4 43 8 1 ca730206 jb januari 24
1978 2 07 pm 2542 5 2542 2542 5 2542
2542 5 2542 
# 2543
reduc the retriev time of scatter storag techniqu a new
method for enter and retriev inform in a hash tabl
is describ the method is intend to be effici if
most entri ar look up sever time the expect number
of probe to look up an entri predict theoret and
verifi by mont carlo experi is consider less than for
other compar method if the tabl is nearli full an
exampl of a possibl fortran implement is given cacm februari
1973 brent r p address calcul content address file search
hash address hash code linear probe linear quotient method scatter
storag search symbol tabl 3 7 3 73 3 74
4 1 4 9 ca730205 jb januari 24 1978 2
12 pm 1271 4 2543 1676 4 2543 1682 4
2543 1728 4 2543 1785 4 2543 1860 4 2543
1860 4 2543 1973 4 2543 1973 4 2543 1973
4 2543 1973 4 2543 1992 4 2543 1992 4
2543 2018 4 2543 2018 4 2543 2018 4 2543
2032 4 2543 2033 4 2543 2033 4 2543 2107
4 2543 2107 4 2543 2109 4 2543 2109 4
2543 2138 4 2543 2203 4 2543 2203 4 2543
2203 4 2543 2203 4 2543 2251 4 2543 2251
4 2543 2251 4 2543 2251 4 2543 2251 4
2543 2359 4 2543 2524 4 2543 2530 4 2543
2534 4 2543 2537 4 2543 2543 4 2543 2543
4 2543 2543 4 2543 2543 4 2543 2543 4
2543 2543 4 2543 2552 4 2543 2552 4 2543
2559 4 2543 2559 4 2543 2559 4 2543 2573
4 2543 2573 4 2543 2770 4 2543 2770 4
2543 2770 4 2543 2974 4 2543 2991 4 2543
2991 4 2543 3053 4 2543 3053 4 2543 3053
4 2543 3053 4 2543 3083 4 2543 3083 4
2543 911 4 2543 1785 5 2543 1786 5 2543
1973 5 2543 332 5 2543 2107 5 2543 2109
5 2543 2412 5 2543 2543 5 2543 2543 5
2543 2543 5 2543 3053 5 2543 3083 5 2543
1328 6 2543 1329 6 2543 1785 6 2543 1973
6 2543 1973 6 2543 1992 6 2543 2107 6
2543 2107 6 2543 2109 6 2543 2412 6 2543
2543 6 2543 2543 6 2543 2543 6 2543 2552
6 2543 2673 6 2543 2707 6 2543 2770 6
2543 
# 2544
automat error bound for simpl zero of analyt function the
cauchi ostrowski theorem on converg of newton iter for an
analyt function in on variabl is extend to includ comput
error us complex interv arithmet sever numer exampl ar given
for polynomi with real and complex root and on exampl
for the bessel function of the first kind cacm februari
1973 rokn j real interv complex interv real interv arithmet
complex interv arithmet newton s method cauchi ostrowski theorem zero
of polynomi zero of bessel function 5 11 5 12
5 15 ca730204 jb januari 24 1978 2 51 pm
1524 4 2544 1931 4 2544 2214 4 2544 2544
4 2544 2544 4 2544 2544 4 2544 1524 5
2544 311 5 2544 2214 5 2544 2544 5 2544
2544 5 2544 2544 5 2544 
# 2545
a theori of discret pattern and their implement in snobol4
the notion of a discret pattern is formal and certain
properti deduc a pattern is shown to be a gener
of a formal languag algorithm for implement the kind of
pattern in snobol4 ar given the gener approach is to
creat in so far as possibl a bottom up pars
from a top down specif cacm februari 1973 gimpel j
f pattern snobol4 pattern theori pars pattern match string process
pattern implement 4 29 5 39 ca730203 jb januari 24
1978 3 13 pm 1665 4 2545 1768 4 2545
1787 4 2545 1824 4 2545 1825 4 2545 1836
4 2545 1861 4 2545 2015 4 2545 2110 4
2545 2127 4 2545 2187 4 2545 2317 4 2545
2545 4 2545 2545 4 2545 2545 4 2545 2698
4 2545 2733 4 2545 2746 4 2545 1739 5
2545 1781 5 2545 2341 5 2545 2545 5 2545
2545 5 2545 2545 5 2545 2746 5 2545 1665
6 2545 1739 6 2545 2139 6 2545 2545 6
2545 2786 6 2545 
# 2546
the us of grammat infer for design program languag both
in design a new program languag and in extend an
exist languag the design is face with the problem of
deriv a natur grammar for the languag we ar propos
an interact approach to the grammar design problem wherein the
design present a sampl of sentenc and structur as input
to a grammat infer algorithm the algorithm then construct a
grammar which is a reason gener of the exampl submit
by the design the implement is present restrict to a
subclass of oper preced grammar but a second algorithm is
outlin which appli to a larger class of context free
grammar cacm februari 1973 crespi reghizzi s melkanoff m a
lichten l grammar design languag definit infer identif in the
limit extens languag 3 61 4 2 5 23 ca730202
jb januari 24 1978 3 20 pm 1046 4 2546
1086 4 2546 1105 4 2546 1132 4 2546 1139
4 2546 1140 4 2546 1234 4 2546 1234 4
2546 1263 4 2546 1263 4 2546 1265 4 2546
1265 4 2546 1270 4 2546 1323 4 2546 1358
4 2546 1379 4 2546 1379 4 2546 1380 4
2546 1453 4 2546 1464 4 2546 1484 4 2546
1491 4 2546 1496 4 2546 1498 4 2546 1542
4 2546 1613 4 2546 1614 4 2546 1683 4
2546 1693 4 2546 1693 4 2546 1781 4 2546
1781 4 2546 1781 4 2546 1781 4 2546 1787
4 2546 1824 4 2546 1825 4 2546 1836 4
2546 1836 4 2546 1860 4 2546 1945 4 2546
1945 4 2546 2015 4 2546 2060 4 2546 2060
4 2546 2061 4 2546 2061 4 2546 2083 4
2546 2082 4 2546 2091 4 2546 2091 4 2546
2126 4 2546 2152 4 2546 2178 4 2546 2179
4 2546 2179 4 2546 2179 4 2546 2252 4
2546 2317 4 2546 2325 4 2546 2341 4 2546
2340 4 2546 2356 4 2546 2546 4 2546 2546
4 2546 2546 4 2546 2546 4 2546 2546 4
2546 464 4 2546 2603 4 2546 2645 4 2546
2652 4 2546 2684 4 2546 2698 4 2546 2698
4 2546 2708 4 2546 2708 4 2546 2824 4
2546 2842 4 2546 2929 4 2546 2934 4 2546
2982 4 2546 2986 4 2546 584 4 2546 3045
4 2546 3045 4 2546 3069 4 2546 3093 4
2546 631 4 2546 653 4 2546 669 4 2546
679 4 2546 680 4 2546 691 4 2546 761
4 2546 763 4 2546 795 4 2546 799 4
2546 945 4 2546 949 4 2546 989 4 2546
1477 5 2546 1491 5 2546 2126 5 2546 2546
5 2546 2546 5 2546 2546 5 2546 404 5
2546 3184 5 2546 
# 2547
represent of contour ad region for effici comput search a
novel comput searchabl represent for the three basic pictori featur
contour map region coverag and line structur is describ the
represent which ha practic storag requir provid a rapid mean
of search larg file for data associ with geometr posit
as well as with attribut valu an applic of thi
represent to handl terrain inform illustr it util the algebra
properti of the data structur make it computation easi to
determin whether a point li within a close boundari comput
the area contain by a close boundari gener the close
boundari repres the union or intersect of two close boundari
and determin the neighbor boundari to a point and the
minimum distanc between them and the point cacm februari 1973
merril r d contour map represent region boundari represent comput
search abl structur graphic data retriev graphic languag two dimension
pattern comput graphic graphic displai 3 21 3 23 3
79 6 35 ca730201 jb januari 24 1978 3 30
pm 1630 4 2547 2287 4 2547 2547 4 2547
2547 4 2547 2987 4 2547 3062 4 2547 3165
4 2547 1326 5 2547 1925 5 2547 2547 5
2547 2547 5 2547 2547 5 2547 2987 5 2547
1326 6 2547 1630 6 2547 2125 6 2547 2547
6 2547 2633 6 2547 421 6 2547 524 6
2547 
# 2548
normal deviat s14 algorithm a442 cacm januari 1973 hill g
w davi a w normal distribut invers probit transform taylor
seri approxim 5 12 5 5 ca730113 jb januari 24
1978 3 39 pm 1157 4 2548 1779 4 2548
1920 4 2548 1944 4 2548 1987 4 2548 2548
4 2548 2548 5 2548 2548 5 2548 2548 5
2548 714 5 2548 
# 2549
random deviat from the dipol distribut g5 algorithm a441 cacm
januari 1973 knop r e random number probabl densiti probabl
distribut dipol distribut cauchi distribut simul mont carlo 3 17
5 5 ca730112 jb januari 24 1978 3 42 pm
2549 5 2549 2549 5 2549 2549 5 2549 
# 2550
a multidimension mont carlo quadratur with adapt stratifi sampl d1
algorithm a440 cacm januari 1973 gallah l j mont carloquadratur
stratifi sampl adapt quadratur sequenti stratif 5 16 5 5
ca730111 jb januari 24 1978 3 44 pm 1352 4
2550 2048 4 2550 2074 4 2550 2093 4 2550
2093 4 2550 2415 4 2550 2550 4 2550 2550
4 2550 2550 4 2550 1573 5 2550 2074 5
2550 2550 5 2550 2550 5 2550 2550 5 2550
429 5 2550 
# 2551
mutual recurs in algol 60 us restrict compil cacm januari
1973 atkin m s algol 60 mutual recurs compil restrict
4 12 4 22 ca730110 jb januari 24 1978 3
46 pm 2551 5 2551 2551 5 2551 2551 5
2551 2658 5 2551 2551 6 2551 
# 2552
a note on when to chain overflow item within a
direct access tabl cacm januari 1973 bai c hash code
open hash chain inform retriev collis 3 7 4 9
ca730109 jb januari 24 1978 4 07 pm 1271 4
2552 1676 4 2552 1682 4 2552 1728 4 2552
1785 4 2552 1785 4 2552 1860 4 2552 1973
4 2552 2018 4 2552 2032 4 2552 2033 4
2552 2107 4 2552 2109 4 2552 2203 4 2552
2203 4 2552 2251 4 2552 2258 4 2552 2319
4 2552 2313 4 2552 2359 4 2552 2359 4
2552 2437 4 2552 2524 4 2552 2543 4 2552
2543 4 2552 2552 4 2552 2552 4 2552 2552
4 2552 2552 4 2552 2559 4 2552 2781 4
2552 2860 4 2552 2991 4 2552 2991 4 2552
3053 4 2552 911 4 2552 911 5 2552 1785
5 2552 332 5 2552 2203 5 2552 2552 5
2552 2552 5 2552 2552 5 2552 3083 5 2552
1328 6 2552 1973 6 2552 2107 6 2552 2543
6 2552 2552 6 2552 
# 2553
the practic aspect of comput scienc educ discuss cacm januari
1973 blount s e educ comput engin comput scienc curriculum
system design 1 52 6 0 ca730108 jb januari 24
1978 4 09 pm 2553 5 2553 2553 5 2553
2553 5 2553 
# 2554
reduct of a band symmetr gener eigenvalu problem an algorithm
is describ for reduc the gener eigenvalu problem ax lambda
bx to an ordinari problem in case a and b
ar symmetr band matric with b posit definit if n
is the order of the matrix and m the bandwidth
the matric a and b ar partit into m by
m block and the algorithm is describ in term of
these block the algorithm reduc the gener problem to an
ordinari eigenvalu problem for a symmetr band matrix c whose
bandwidth is the same as a and b the algorithm
is similar to those of rutishaus and schwartz for the
reduct of symmetr matric to band form the calcul c
requir order mn 2 oper the round off error in
the calcul of c is of the same order as
the sum of the error at each of the n
m step of the algorithm the latter error be larg
determin by the condit of b with respect to invers
cacm januari 1973 crawford c r gener eigenvalu symmetr band
matric 5 14 ca730107 jb januari 24 1978 4 26
pm 2554 5 2554 2554 5 2554 2554 5 2554
# 2555
variabl precis exponenti a previou paper present an effici algorithm
call the recomput algorithm for evalu a ration express to
within ani desir toler on a comput which perform variabl
precis arithmet oper the recomput algorithm can be appli to
express involv ani variabl precis oper have o 10 p
sum ei error bound where p denot the oper s
precis and ei denot the error in the oper s
ith argument thi paper present an effici variabl precis exponenti
oper with an error bound of the abov order other
oper such as log sin and co which have simpl
seri expans can be handl similarli cacm januari 1973 richman
p l variabl precis exponenti function error analysi interv arithmet
5 11 ca730106 jb januari 24 1978 4 32 pm
2555 4 2555 2605 4 2555 2286 5 2555 2555
5 2555 2555 5 2555 2555 5 2555 
# 2556
adapt correct of program statement a method of analyz statement
in a program languag which can toler a consider inaccuraci
in their specif is propos thi method involv principl at
present mainli confin to studi in the area of artifici
intellig such as featur extract approxim tree match and strategi
improv by feedback from the match process a pilot program
incorpor the principl is describ and preliminari oper result ar
present a final section survei further principl which ar current
be investig cacm januari 1973 jame e b partridg d
p adapt linguist pattern match automat pars approxim match compil
program statement analysi syntax analysi 3 62 3 63 3
65 ca730105 jb januari 24 1978 4 38 pm 1179
4 2556 1288 4 2556 1544 4 2556 1646 4
2556 2111 4 2556 2257 4 2556 2360 4 2556
2451 4 2556 2451 4 2556 2452 4 2556 2534
4 2556 2534 4 2556 2556 4 2556 2556 4
2556 2556 4 2556 2556 4 2556 2650 4 2556
2650 4 2556 2708 4 2556 2765 4 2556 2887
4 2556 2978 4 2556 1935 5 2556 1936 5
2556 2111 5 2556 2556 5 2556 2556 5 2556
2556 5 2556 2698 5 2556 2708 5 2556 830
5 2556 1477 6 2556 1477 6 2556 1491 6
2556 1491 6 2556 1781 6 2556 1787 6 2556
2110 6 2556 2111 6 2556 2534 6 2556 2556
6 2556 2556 6 2556 680 6 2556 680 6
2556 799 6 2556 
# 2557
on the time requir for a sequenc of matrix product
thi paper discuss the multipl of conform sequenc of row
vector column vector and squar matric the minimum time requir
to evalu such product on ordinari serial comput as well
as parallel comput is discuss algorithm ar present which properli
pars such matrix sequenc subject to the constraint of the
machin organ cacm januari 1973 muraoka y kuck d j
matrix express matrix multipl oper minim parallel machin time minim
4 22 5 14 ca730104 jb januari 24 1978 4
41 pm 1614 4 2557 2253 4 2557 2557 4
2557 2557 5 2557 2557 5 2557 2557 5 2557
437 5 2557 3075 5 2557 3085 5 2557 2289
6 2557 2557 6 2557 2557 6 2557 2664 6
2557 2714 6 2557 
# 2558
protect in program languag linguist mechan which can be us
to protect on subprogram from anoth s malfunct ar describ
function produc function and variou type tag scheme ar consid
an attempt is made to distinguish between access limit and
authent cacm januari 1973 morri j h jr protect type
environ trademark seal access kei access control authent secreci 4
2 4 3 ca730103jb januari 24 1978 4 45 pm
1458 4 2558 1523 4 2558 1603 4 2558 1698
4 2558 1747 4 2558 1748 4 2558 1854 4
2558 1877 4 2558 1960 4 2558 2155 4 2558
2294 4 2558 2377 4 2558 2378 4 2558 2497
4 2558 2558 4 2558 2558 4 2558 2625 4
2558 2632 4 2558 2840 4 2558 2842 4 2558
2941 4 2558 3077 4 2558 3105 4 2558 3144
4 2558 3150 4 2558 1471 5 2558 2060 5
2558 2558 5 2558 2558 5 2558 2558 5 2558
2868 5 2558 2939 5 2558 2941 5 2558 1471
6 2558 2080 6 2558 2204 6 2558 2356 6
2558 2377 6 2558 2380 6 2558 2558 6 2558
2558 6 2558 2558 6 2558 2625 6 2558 2632
6 2558 2651 6 2558 
# 2559
the realloc of hash code tabl when the space alloc
for a hash code tabl is alter the tabl entri
must be rescatt over the new space a techniqu for
accomplish thi rescatt is present the techniqu is independ of
both the length of the tabl and the hash function
us and can be util in conjunct with a linear
realloc of the tabl be rescatt moreov it can be
us to elimin previous flag delet from ani hash code
tabl or to chang from on hash method to anoth
the effici of the techniqu is discuss and theoret statist
ar given cacm januari 1973 bai c realloc dynam storag
hash code scatter storag delet 3 7 3 73 3
74 4 9 ca730102 jb januari 24 1978 4 50
pm 1676 4 2559 1682 4 2559 1728 4 2559
1860 4 2559 1973 4 2559 1973 4 2559 1992
4 2559 2018 4 2559 2032 4 2559 2033 4
2559 2107 4 2559 2109 4 2559 2138 4 2559
2203 4 2559 2203 4 2559 2251 4 2559 2251
4 2559 2251 4 2559 2359 4 2559 2524 4
2559 2530 4 2559 2534 4 2559 2537 4 2559
2543 4 2559 2543 4 2559 2543 4 2559 2552
4 2559 2559 4 2559 2559 4 2559 2559 4
2559 2573 4 2559 2770 4 2559 2991 4 2559
2991 4 2559 3053 4 2559 3053 4 2559 3053
4 2559 3083 4 2559 3083 4 2559 1785 5
2559 1973 5 2559 2107 5 2559 2559 5 2559
2559 5 2559 2559 5 2559 
# 2560
a queu model of a multiprogram comput with a two
level storag system the result ar present of an analysi
of a probabilist model of a multiprogram comput system with
a two level storag system in which there is sequenti
depend of access between the devic express ar obtain for
the long run probabl that both the cpu and each
of the storag devic ar busi some numer result ar
given which quantifi the gain in cpu util obtain by
multiprogram in the presenc of thi type of storag system
cacm januari 1973 shedler g s multiprogram comput system storag
system hierarch index set 4 32 ca730101 jb januari 24
1978 4 55 pm 2560 5 2560 2560 5 2560
2560 5 2560 
# 2561
a heurist approach to induct infer in fact retriev system
heurist procedur ar present which have been develop to perform
infer by gener from avail inform the procedur make us
of a similar structur which is impos on the data
base us nonnumer cluster algorithm thei ar implement in a
model fact retriev system which us a formal queri languag
and a properti list data structur a program of experi
is describ wherein the procedur ar us with test data
base which ar alter by delet part of the data
and by purpos introduc fals data it is found that
the system can infer the correct respons under a varieti
of condit involv incomplet and inconsist data cacm decemb 1974
skinner c w infer induct infer cluster fact retriev heurist
3 61 3 71 3 79 ca741213 jb januari 13
1978 3 40 pm 2178 4 2561 2396 4 2561
2561 4 2561 2127 5 2561 2561 5 2561 2561
5 2561 2561 5 2561 
# 2562
rout problem algorithm r456 cacm decemb 1974 tesch g ca741212
jb januari 13 1978 3 42 pm 2562 5 2562
2562 5 2562 2562 5 2562 
# 2563
merg sort algorithm r426 cacm decemb 1974 bron c ca741211
jb januari 13 1978 3 43 pm 2563 4 2563
2348 5 2563 2563 5 2563 2563 5 2563 2563
5 2563 
# 2564
hidden line plot program algorithm r420 cacm decemb 1974 elli
t m r ca741210 jb januari 13 1978 3 45
pm 2564 5 2564 2564 5 2564 2564 5 2564
# 2565
a gaussian pseudo random number gener algorithm 488 cacm decemb
1974 brent r p random number pseudo random number gaussian
distribut normal distribut 5 39 5 5 ca741209 jb januari
13 1978 3 57 pm 2349 4 2565 2565 4
2565 2565 4 2565 1716 5 2565 2276 5 2565
2565 5 2565 2565 5 2565 2565 5 2565 
# 2566
exact cumul distribut of the kolmogorov smirnov statist for small
sampl algorithm a487 cacm decemb 1974 pomeranz j kolmogorov smirnov
test k s statist good of fit test 8 1
5 5 ca741208 jb januari 13 1978 4 08 pm
2566 5 2566 2566 5 2566 2566 5 2566 
# 2567
an exponenti method for the solut of system of ordinari
differenti equat an explicit coupl singl step method for the
numer solut of initi valu problem for system of ordinari
differenti equat is present the method wa design to be
gener purpos in natur but to be especi effici when
deal with stiff system of differenti equat it is in
gener second order except for the case of a linear
system with constant coeffici and linear forc term in that
case the method is third order it ha been implement
and put to routin usag in biolog applic where stiff
frequent appear with favor result when compar to a standard
fourth order rung kutta implement comput time requir by thi
method ha rang from compar for certain nonstiff problem to
better than two order of magnitud faster for some highli
stiff system cacm decemb 1974 chu s c berman m
numer solut ordinari differenti equat initi valu problem stiff system
5 17 ca741207 jb januari 13 1978 4 20 pm
2567 4 2567 2567 4 2567 2268 5 2567 2567
5 2567 2567 5 2567 2567 5 2567 755 5
2567 
# 2568
a graph formul of a school schedul algorithm the problem
classic titl the examin schedul problem take variou form in
the literatur most of these formul can be present in
the terminolog of classic network theori on such formul is
given a nondirect network partit it node into a minim
number of subset such that no two member of the
same subset ar connect by anarc an obviou lower limit
to thi number is the size of the largest strongli
connect subgraph kirchgassn prove that an upper limit is thi
size plu on on logic extens of the previou work
is the introduct of variabl length examin where w i
is the number of period for exam i the object
of thi paper is to gener the definit of largest
strongli connect subgraph to includ the weight of node to
present an approxim algorithm which usual find the largest strongli
connect subgraph and to discuss the applic of thi algorithm
to the solut of school schedul and exam schedul problem
cacm decemb 1974 salazar a oakford r v schedul school
schedul examin schedul nondirect network graph subgraph strongli connect subgraph
3 51 3 52 ca741206 jb januari 13 1978 4
37 pm 2568 5 2568 2568 5 2568 2568 5
2568 
# 2569
comput gener of gamma random variat with non integr shape
paramet when the shape paramet a is integr gener gamma
random variabl with a digit comput is straightforward there is
no simpl method for gener gamma random variat with non
integr shape paramet a common procedur is to approxim gener
such random variabl by us of the so call probabl
switch method anoth procedur which is exact is due to
johnk thi paper present a reject method for exactli gener
gamma random variabl when a is greater than 1 the
effici of the reject method is shown to be better
than the effici of johnk s method the paper conclud
that when a is non integr the follow mix of
procedur yield the best combin of accuraci and effici 1
when a is less than 1 us johnk s method
2 when 1 is less than a and a is
less than 5 us the reject method 3 when a
is greater than 5 us the probabl switch method cacm
decemb 1974 wallac n d simul gamma random variabl probabl
distribut random number 5 5 8 1 ca741205 jb januari
16 1978 9 35 am 2569 5 2569 2569 5
2569 2569 5 2569 2847 5 2569 2928 5 2569
3046 5 2569 3098 5 2569 3107 5 2569 1751
6 2569 2277 6 2569 2380 6 2569 2522 6
2569 2569 6 2569 2569 6 2569 2569 6 2569
2569 6 2569 2569 6 2569 2847 6 2569 2847
6 2569 3098 6 2569 
# 2570
a comparison of list schedul for parallel process system the
problem of schedul two or more processor to minim the
execut time of a program which consist of a set
of partial order task is studi case where task execut
time ar determinist and other in which execut time ar
random variabl ar analyz it is shown that differ algorithm
suggest in the literatur vari significantli in execut time and
that the b schedul of coffman and graham is near
optim a dynam program solut for the case in which
execut time ar random variabl is present cacm decemb 1974
adam t l chandi k m dickson j r parallel
process preced graph schedul list schedul optim dynam program 4
3 4 32 4 34 4 35 5 3 5
32 5 4 5 42 8 1 ca741204 jb januari
16 1978 9 42 am 2570 5 2570 2570 5
2570 2570 5 2570 
# 2571
an analyt model of the hasp execut task monitor the
hasp execut task monitor period rearrang the os 360 dispatch
chain to give task preemptiv execut prioriti in invers order
to that of their cpu util histori the effect is
to keep the i o bound task activ and to
prevent cpu bound task from lock out other task thi
paper develop a simpl model of the execut task monitor
and emploi it to studi the effect of the monitor
in improv system perform a modifi strategi monitor control is
investig for the case of task execut in a memori
hierarchi of vari speed cacm decemb 1974 strauss j c
hasp os 360 dispatch schedul model perform evalu 4 32
8 1 ca741203 jb januari 16 1978 9 51 am
2571 4 2571 3072 4 2571 3119 4 2571 2245
5 2571 2571 5 2571 2571 5 2571 2571 5
2571 
# 2572
argument for a moratorium on the construct of a commun
inform util in thi articl the author urg a prudent
and decentr approach to the question of the design and
desir of computer commun inform util befor accept the inevit
and desir of thi or ani technolog we should 1
be sure of the feasibl intern and extern of what
is propos 2 project and perhap wait for chang in
complementari techniqu 3 evalu current and project supplementari techniqu 4
establish the exist of demand for what is propos 5
take step to involv a repres group of ultim user
in system design and 6 carefulli think through possibl side
effect on man and hi world view current propos for
commun inform util ar examin in thi framework and the
conclus is drawn that societi is not yet in a
posit to justifi either the construct of an inform util
in a prototyp commun or the accept of a polici
in favor of it widespread implement cacm decemb 1974 press
l i commun inform util social implic public polici 2
1 2 3 ca741202 jb januari 16 1978 10 02
am 2572 5 2572 2572 5 2572 2572 5 2572
3179 5 2572 2572 6 2572 2607 6 2572 3076
6 2572 
# 2573
comput program as an art cacm decemb 1974 knuth d
e ca741201 jb januari 16 1978 10 04 am 1860
4 2573 1973 4 2573 1973 4 2573 1992 4
2573 1992 4 2573 2018 4 2573 2033 4 2573
2107 4 2573 2109 4 2573 2138 4 2573 2203
4 2573 2203 4 2573 2251 4 2573 2251 4
2573 2251 4 2573 2530 4 2573 2537 4 2573
2543 4 2573 2543 4 2573 2559 4 2573 2573
4 2573 2573 4 2573 2573 4 2573 2770 4
2573 2770 4 2573 2991 4 2573 3053 4 2573
3083 4 2573 1786 5 2573 2018 5 2573 2107
5 2573 2573 5 2573 2573 5 2573 2573 5
2573 
# 2574
multipl exist from a loop us neither go to nor
label cacm novemb 1974 evan r v goto free program
control structur multipl exist from loop exit statement 4 20
4 22 ca741110 jb januari 16 1978 10 07 am
2574 4 2574 2709 4 2574 2477 5 2574 2574
5 2574 2574 5 2574 2574 5 2574 
# 2575
the best match problem in document retriev cacm novemb 1974
van rijsbergen c j document retriev best match cluster file
search match dissimilar hierarchi classif 3 73 3 74 3
79 5 30 ca741109 jb januari 16 1978 10 09
am 2575 4 2575 2966 4 2575 3134 4 2575
2524 5 2575 2575 5 2575 2575 5 2575 2575
5 2575 
# 2576
a simpl techniqu for repres string in fortran iv cacm
novemb 1974 hanson d r string process fortran iv string
represent structur program data structur 3 70 4 0 4
19 4 9 ca741108 jb januari 16 1978 10 12
am 2576 5 2576 2576 5 2576 2576 5 2576
# 2577
an on site data manag system applic in field archaeolog
cacm novemb 1974 brown j a werner b apl plu
archaeolog koster prehistor site data manag retriev system 3 36
3 70 3 73 3 89 ca741107 jb januari 16
1978 10 15 am 2577 5 2577 2577 5 2577
2577 5 2577 
# 2578
self stabil system in spite of distribut control cacm novemb
1974 dijkstra e w multiprocess network self stabil synchron mutual
exclus robust share error recoveri distribut control harmoni cooper self
repair 4 32 ca741106 jb januari 16 1978 10 18
am 2578 5 2578 2578 5 2578 2578 5 2578
# 2579
regist alloc via usag count thi paper introduc the notion
of usag count show how usag count can be develop
by algorithm that elimin redund comput and describ how usag
count can provid the basi for regist alloc the paper
compar regist alloc base on usag count to other commonli
us regist alloc techniqu and present evid which show that
the usag count techniqu is significantli better than these other
techniqu cacm novemb 1974 freiburghous r a optim redund comput
common subexpress regist alloc compil program languag virtual memori demand
page 4 12 4 2 4 39 ca741105 jb januari
16 1978 10 24 am 1781 4 2579 1807 4
2579 2034 4 2579 2290 4 2579 2579 4 2579
2579 4 2579 2579 4 2579 2923 4 2579 2923
4 2579 2945 4 2579 1535 5 2579 1807 5
2579 1947 5 2579 2579 5 2579 2579 5 2579
2579 5 2579 
# 2580
a method for compos simpl tradit music by comput a
method is describ for compos music round by comput thi
method us some music theori plu addit heurist fundament to
the method is a set of product togeth with set
of applic rule and weight rule which oper on the
product decid when and to what extent thei ar avail
for us sever round gener by the comput implement of
the method ar present gener the result music sound mediocr
to the profession although usual pleas to the layman it
appear that full blown music theori is not need for
round all the hardwar requir for structur level is not
necessari for these piec the author ha tri to address
both musician and comput scientist cacm novemb 1974 rader g
m artifici intellig heurist program model of cognit process comput
music comput composit music theori formal languag probabilist grammar 3
44 3 65 5 23 ca741104 jb januari 16 1978
10 35 am 2580 5 2580 2580 5 2580 2580
5 2580 
# 2581
a local organ parser for spoken input thi paper describ
lpar a local organ pars system design for us in
a continu speech recogn lpar process a string of phonem
which contain ambigu and error the system is local organ
in the sens that it build local pars structur from
reliabl word candid recogn anywher in an input utter these
local structur ar us as island of reliabl to guid
the search for more highli garbl word which might complet
the utter cacm novemb 1974 miller p l pars speech
recognit speech understand augment transit network local pars 3 42
3 65 3 69 ca741103 jb januari 16 1978 10
41 am 2581 4 2581 2739 4 2581 2795 4
2581 2921 4 2581 3087 4 2581 1989 5 2581
2581 5 2581 2581 5 2581 2581 5 2581 
# 2582
improv local by critic work set a new approach to
program local improv via restructur is describ the method is
particularli suit to those system where primari memori is manag
accord to a work set strategi it is base on
the concept of critic work set a work set which
doe not contain the next memori refer the data the
method oper upon ar extract from a trace of the
program to be restructur it is shown that except in
some special case the method is not optimum howev the
experiment result obtain by us the method to restructur an
interact text editor and the file system modul of an
oper system have shown it substanti superior over the other
method propos in the literatur cacm novemb 1974 ferrari d
program restructur program segment local improv memori hierarchi virtual memori
multiprogram restructur techniqu static restructur dynam restructur work set strategi
critic work set 4 32 4 39 4 43 4
49 4 9 ca741102 jb januari 16 1978 10 50
am 1892 4 2582 1901 4 2582 2085 4 2582
2095 4 2582 2218 4 2582 2277 4 2582 2319
4 2582 2319 4 2582 2329 4 2582 2358 4
2582 2365 4 2582 2373 4 2582 2380 4 2582
2434 4 2582 2499 4 2582 2501 4 2582 2582
4 2582 2582 4 2582 2582 4 2582 2582 4
2582 2669 4 2582 2669 4 2582 2828 4 2582
2863 4 2582 2881 4 2582 2928 4 2582 2996
4 2582 3006 4 2582 3054 4 2582 3067 4
2582 3152 4 2582 1751 5 2582 1924 5 2582
2017 5 2582 2130 5 2582 2582 5 2582 2582
5 2582 2582 5 2582 
# 2583
guidelin for human computer inform system a report from stanlei
hous cacm novemb 1974 sterl t d human social implic
manag inform system regul social and behavior scienc philosophi 1
5 2 3 3 3 4 3 5 ca741101 jb
januari 16 1978 10 53 am 2583 5 2583 2583
5 2583 2583 5 2583 3142 5 2583 2583 6
2583 3076 6 2583 
# 2584
enumer full time programm data from the 1970 censu and
the depart of labor s area wage survei ar us
to deriv estim of the number of full time programm
emploi dure the year 1969 through 1973 the 1973 figur
of 180 000 is consider less than suggest in earlier
report it is recommend that educ administr consid whether the
mani cours aim at train programm ar justifi on a
vocat basi cacm octob 1974 gilchrist b weber r e
programm employ 1970 censu area wage survei 1 50 2
2 2 42 ca741014 jb januari 16 1978 11 00
am 2584 5 2584 2584 5 2584 2584 5 2584
# 2585
effici implement of a variabl project algorithm for nonlinear least
squar problem errata cacm octob 1974 krogh f t ca741013
jb januari 16 1978 11 02 am 2585 5 2585
2585 5 2585 2585 5 2585 
# 2586
adapt optim code gener for arithmet express to the instruct
set avail on present dai comput errata cacm octob 1974
stockhausen p f ca741012 jb januari 16 1978 11 05
am 2586 5 2586 2586 5 2586 2586 5 2586
# 2587
on the construct of a repres synthet workload errata cacm
octob 1974 sreenivarsan k kleinman a j ca741011 jb januari
16 1978 11 07 am 2587 4 2587 2588 4
2587 2587 5 2587 2587 5 2587 2587 5 2587
2612 5 2587 
# 2588
rosenbrock function minim algorithm r450 cacm octob 1974 kleme j
klemsa j ca741010 jb januari 16 1978 11 09 am
2587 4 2588 2588 4 2588 2588 5 2588 2588
5 2588 2588 5 2588 2612 5 2588 
# 2589
a comput routin for quadrat and linear program problem algorithm
r431 cacm octob 1974 proll l g ca741009 jb januari
16 1978 11 10 am 2589 4 2589 1353 5
2589 2589 5 2589 2589 5 2589 2589 5 2589
# 2590
hypergeometr algorithm c191 cacm octob 1974 kopelaar h ca741008 jb
januari 16 1978 11 14 am 2590 4 2590 2590
5 2590 2590 5 2590 2590 5 2590 888 5
2590 
# 2591
numer invers of laplac transform algorithm a486 cacm octob 1974
veillon f laplac transform invers 5 16 ca741007 jb januari
16 1978 11 17 am 2591 4 2591 2124 5
2591 2591 5 2591 2591 5 2591 2591 5 2591
# 2592
on gener of test problem for linear program code user
of linear program comput code have realiz the necess of
evalu the capac effect and accuraci of the solut provid
by such code larg scale linear program code at most
instal ar assum to be gener correct solut without ever
have been bench mark by test problem with known solut
the reason for thi failur to adequ test the code
is that rare ar there larg problem with known solut
readili avail thi paper present a theoret justif and an
illustr implement of a method for gener linear program test
problem with known solut the method permit the gener of
test problem that ar of arbitrari size and have a
wide rang of numer characterist cacm octob 1974 charn a
raik w m stutz j d walter a s linear
program test problem gener lp program evalu lp program valid
5 41 ca741006 jb januari 16 1978 12 28 pm
2592 5 2592 2592 5 2592 2592 5 2592 
# 2593
a back end comput for data base manag it is
propos that the data base manag function be place on
a dedic back end comput which accept command in a
rel high level languag such as the codasyl data base
task group april 1971 report from a host comput access
the data base on secondari storag and return result the
advantag of such a configur ar discuss an experiment implement
call the experiment data manag system xdm is describ and
certain conclus about the back end approach ar drawn from
thi implement cacm octob 1974 canadai r h harrison r
d ivi e l ryder j l wehr l a
data base manag inform retriev comput configur comput network data
base task group languag data base protect data base portabl
back end comput 3 79 4 22 4 33 4
35 ca741005 jb januari 16 1978 12 35 pm 2593
5 2593 2593 5 2593 2593 5 2593 2919 5
2593 2536 6 2593 2593 6 2593 2629 6 2593
# 2594
structur data structur program system which permit arbitrari link list
structur enabl the user to creat complic structur without suffici
protect delet can result in unreach data element and there
is no guarante that addit will be perform properli to
remedi thi situat thi paper propos a gaug which provid
for the creation of a restrict class of data structur
but ensur the correct of the program thi is accomplish
by an explicit structur declar facil a restrict on the
permiss oper and execut time check cacm octob 1974 shneiderman
b scheuermann p structur program data structur data base manag
system 3 50 3 51 3 72 3 73 3
79 4 20 4 22 ca741004 jb januari 16 1978
12 46 pm 1720 4 2594 1927 4 2594 2147
4 2594 2163 4 2594 2193 4 2594 2252 4
2594 2319 4 2594 2326 4 2594 2345 4 2594
2478 4 2594 2477 4 2594 2480 4 2594 2541
4 2594 2594 4 2594 2594 4 2594 2594 4
2594 2594 4 2594 2709 4 2594 2852 4 2594
2899 4 2594 2939 4 2594 2972 4 2594 3004
4 2594 3130 4 2594 3155 4 2594 1771 5
2594 2155 5 2594 2204 5 2594 2594 5 2594
2594 5 2594 2594 5 2594 2975 5 2594 3186
5 2594 2594 6 2594 
# 2595
a note on the calcul work set size finit length
refer string of arbitrari structur ar consid and an exact
express for averag work set size in term of correct
interrefer interv statist is deriv an exampl is discuss upper
and lower bound ar obtain and the averag work set
size function is shown to be effici obtain for a
set of page size in a singl pass of the
refer string thi work follow the develop of a paper
by den and schwartz who consid infinit length refer string
which satisfi certain statist properti and who deriv an express
relat the asymptot averag work set size to the asymptot
miss page rate function under work set replac cacm octob
1974 slutz d r traiger i l work set model
page program behavior 4 3 ca741003 jb januari 16 1978
12 56 pm 2374 4 2595 2380 4 2595 2450
4 2595 2595 4 2595 2996 4 2595 3006 4
2595 3067 4 2595 2373 5 2595 2595 5 2595
2595 5 2595 2595 5 2595 2996 5 2595 3006
5 2595 3067 5 2595 1751 6 2595 1751 6
2595 1751 6 2595 1884 6 2595 2374 6 2595
2374 6 2595 2373 6 2595 2373 6 2595 2373
6 2595 2595 6 2595 2595 6 2595 2595 6
2595 2682 6 2595 2863 6 2595 2864 6 2595
3006 6 2595 
# 2596
a weight buddi method for dynam storag alloc an extens
of the buddi method call the weight buddi method for
dynam storag alloc is present the weight buddi method allow
block size of 2 k and 3 2 k wherea
the origin buddi method allow onli block size of 2
k thi extens is achiev at an addit cost of
onli two bit per block simul result ar present which
compar thi method with the buddi method these result indic
that for a uniform request distribut the buddi system ha
less total memori fragment than the weight buddi algorithm howev
the total fragment is smaller for the weight buddi method
when the request ar for exponenti distribut block size cacm
octob 1974 shen k k peterson j l weight buddi
algorithm buddi system memori alloc dynam storag alloc 3 89
4 32 4 39 ca741002 jb januari 16 1978 1
07 pm 1389 4 2596 1552 4 2596 2095 4
2596 2162 4 2596 2218 4 2596 2435 4 2596
2498 4 2596 2596 4 2596 2596 4 2596 2596
4 2596 2734 4 2596 2747 4 2596 2768 4
2596 2768 4 2596 2845 4 2596 2845 4 2596
2902 4 2596 2902 4 2596 2902 4 2596 2911
4 2596 2911 4 2596 2955 4 2596 2955 4
2596 3000 4 2596 1184 5 2596 1879 5 2596
2435 5 2596 2596 5 2596 2596 5 2596 2596
5 2596 2902 5 2596 2955 5 2596 1051 6
2596 1062 6 2596 1184 6 2596 1184 6 2596
1211 6 2596 1552 6 2596 1879 6 2596 2435
6 2596 2435 6 2596 2596 6 2596 2596 6
2596 2734 6 2596 2747 6 2596 2747 6 2596
2768 6 2596 2773 6 2596 
# 2597
monitor an oper system structur concept thi paper develop brinch
hansen s concept of a monitor as a method of
structur an oper system it introduc a form of synchron
describ a possibl method of implement in term of semaphor
and give a suitabl proof rule illustr exampl includ a
singl resourc schedul a bound buffer an alarm clock a
buffer pool a disk head optim and a version of
the problem of reader and writer cacm octob 1974 hoar
c a r monitor oper system schedul mutual exclus synchron
system implement languag structur multiprogram 4 31 4 22 ca741001
jb januari 16 1978 1 23 pm 2320 4 2597
2597 4 2597 2597 4 2597 2777 4 2597 2851
4 2597 2895 4 2597 2912 4 2597 2946 4
2597 3128 4 2597 2150 5 2597 2320 5 2597
2597 5 2597 2597 5 2597 2597 5 2597 2865
5 2597 2866 5 2597 2898 5 2597 2972 5
2597 3043 5 2597 3128 5 2597 3144 5 2597
970 6 2597 1471 6 2597 1834 6 2597 2150
6 2597 2204 6 2597 2298 6 2597 2356 6
2597 2376 6 2597 2436 6 2597 2491 6 2597
2597 6 2597 2597 6 2597 2597 6 2597 2597
6 2597 2597 6 2597 2597 6 2597 2597 6
2597 2624 6 2597 2625 6 2597 2632 6 2597
2732 6 2597 2732 6 2597 2738 6 2597 2796
6 2597 2865 6 2597 2866 6 2597 2870 6
2597 2912 6 2597 2946 6 2597 3082 6 2597
# 2598
extend the inform theori approach to convert limit entri decis
tabl to comput program thi paper modifi an earlier algorithm
for convert decis tabl into flowchart which minim subsequ execut
time when compil into a comput program the algorithm consid
in thi paper perform limit search and accordingli do not
necessarili result in global optim solut howev the greater search
effort need to obtain a global optim solut for complex
decis tabl is usual not justifi by suffici save in
execut time there is an analog between the problem of
convert decis tabl into effici flowchart and the well understood
problem in inform theori of noiseless code the result of
the noiseless code literatur ar us to explor the limit
of algorithm us to solv the decis tabl problem the
analog between the two problem is also us to develop
improv to the inform algorithm in extend the depth of
search under certain condit and in propos addit condit to
be ad to the decis tabl final the inform algorithm
is compar with an algorithm propos in a recent paper
by verhelst cacm septemb 1974 shwayder k code decis tabl
flowchart inform theori noiseless channel sort 3 50 5 31
ca740910 jb januari 17 1978 8 40 am 1354 4
2598 2053 4 2598 2220 4 2598 2220 4 2598
2273 4 2598 2273 4 2598 2453 4 2598 2453
4 2598 2492 4 2598 2518 4 2598 2598 4
2598 2598 4 2598 2598 4 2598 2598 4 2598
2598 4 2598 2598 4 2598 2616 4 2598 2691
4 2598 2726 4 2598 2726 4 2598 2726 4
2598 2726 4 2598 2856 4 2598 2856 4 2598
2856 4 2598 3113 4 2598 3113 4 2598 1172
5 2598 1548 5 2598 2220 5 2598 2263 5
2598 2453 5 2598 2598 5 2598 2598 5 2598
2598 5 2598 2691 5 2598 2845 5 2598 2856
5 2598 3113 5 2598 1172 6 2598 1184 6
2598 1327 6 2598 1354 6 2598 1354 6 2598
2053 6 2598 2220 6 2598 2263 6 2598 2435
6 2598 2453 6 2598 2598 6 2598 2598 6
2598 2598 6 2598 2691 6 2598 2736 6 2598
2747 6 2598 2768 6 2598 2856 6 2598 
# 2599
first order approxim to the optimum checkpoint interv cacm septemb
1974 young j w checkpoint job failur oper program checkpoint
random failur oper program 2 43 4 0 ca740909 jb
januari 17 1978 8 42 am 2599 5 2599 2599
5 2599 2599 5 2599 3089 5 2599 2599 6
2599 
# 2600
comput of g spline via a factor method e2 algorithm
a485 cacm septemb 1974 eidson h d schumak l l
approxim spline approxim 5 13 ca740908 jb januari 17 1978
8 44 am 2600 5 2600 2600 5 2600 2600
5 2600 
# 2601
evalu of the modifi bessel function k0 z and k1
z for complex argument s17 algorithm a484 cacm septemb 1974
burrel k h bessel function hankel function modifi bessel function
gauss hermit quadratur 5 12 ca740907 jb januari 17 1978
8 47 am 2601 5 2601 2601 5 2601 2601
5 2601 
# 2602
mask three dimension plot program with rotat j6 algorithm a483
cacm septemb 1974 watkin s l plot three dimension plot
4 41 ca740906 jb januari 17 1978 8 49 am
2602 5 2602 2602 5 2602 2602 5 2602 
# 2603
the equival of reduc transit languag and determinist languag the
class of reduc transit languag introduc by eickel paul bauer
and samelson wa shown by morri to be a proper
superclass of the simpl preced languag in thi paper thi
result is extend show that in fact the first class
is equival to the class of determinist context free languag
cacm septemb 1974 schkolnick m reduc transit languag syntax control
gener determinist context free grammar 4 12 5 23 ca740905
jb januari 17 1978 8 52 am 1215 4 2603
1542 4 2603 1683 4 2603 1693 4 2603 1781
4 2603 1781 4 2603 1787 4 2603 1787 4
2603 1836 4 2603 1945 4 2603 1945 4 2603
2060 4 2603 2061 4 2603 2082 4 2603 2091
4 2603 2152 4 2603 2179 4 2603 2340 4
2603 2356 4 2603 2546 4 2603 2603 4 2603
2603 4 2603 2698 4 2603 2708 4 2603 2824
4 2603 2982 4 2603 2986 4 2603 3045 4
2603 3093 4 2603 1491 5 2603 2603 5 2603
2603 5 2603 2603 5 2603 763 5 2603 
# 2604
an interact graphic displai for region partit by linear program
us linear program an interact graphic displai system ha been
implement to solv the region design problem of partit a
region into n nonoverlap subregion in such a wai that
their area ar in specifi proport and that the total
cost of servic them is a minimum in a convers
manner a user can easili obtain differ partit by specifi
and modifi the boundari the servic center locat the area
proport and the cost function exampl ar includ cacm septemb
1974 cheung t interact graphic displai region partit area specif
linear program 5 41 8 2 8 3 ca740904 jb
januari 17 1978 8 56 am 2604 4 2604 1977
5 2604 2604 5 2604 2604 5 2604 2604 5
2604 
# 2605
a precis numer analysi program a descript is given of
a program for comput the solut to a small number
of standard numer analysi problem to ani specifi accuraci up
to a limit of 2000 correct decim place each comput
number is bound in an interv with a multipl precis
midpoint arithmet oper involv these number ar execut accord to
interv arithmet concept with non signific digit automat discard detail
ar suppli of problem specif and problem comput cacm septemb
1974 aberth o interv arithmet multipl precis list structur error
control 4 49 5 10 5 11 5 12 5
14 5 19 ca740903 jb januari 17 1978 9 01
am 1258 4 2605 1292 4 2605 1497 4 2605
1975 4 2605 2555 4 2605 2605 4 2605 2605
4 2605 1026 5 2605 2286 5 2605 2605 5
2605 2605 5 2605 2605 5 2605 
# 2606
a new integr algorithm for ordinari differenti equat base on
continu fraction approxim a new integr algorithm is found and
an implement is compar with other program algorithm the new
algorithm is a step by step procedur for solv the
initi valu problem in ordinari differenti equat it is design
to approxim pole of small integ order in the solut
of the differenti equat by continu fraction obtain by manipul
the sum of truncat taylor seri expans the new method
is compar with gragg bulirsh stoer and the taylor seri
method the taylor seri method and the new method ar
shown to be superior in speed and accuraci while the
new method is shown to be most superior when the
solut is requir near a singular the new method can
final be seen to pass automat through singular where all
the other method which ar discuss will have fail cacm
septemb 1974 willer i m ordinari differenti equat initi valu
problem integr taylor seri singular continu fraction program comparison 5
17 ca740902 jb januari 17 1978 9 06 am 2606
5 2606 2606 5 2606 2606 5 2606 
# 2607
a problem list of issu concern comput and public polici
cacm septemb 1974 acm committe econom and sociolog effect the
public and comput 2 11 2 12 ca740901 jb januari
17 1978 9 08 am 2607 5 2607 2607 5
2607 2607 5 2607 2756 5 2607 3076 5 2607
3179 5 2607 2572 6 2607 2607 6 2607 2607
6 2607 2607 6 2607 2840 6 2607 3076 6
2607 
# 2608
recurr relat for the fresnel integr and similar integr cacm
august 1974 acton f s recurr relat fresnel integr exponenti
integr 5 12 ca740816 jb januari 17 1978 9 14
am 2608 5 2608 2608 5 2608 2608 5 2608
# 2609
interpol with round ramp function a new interpol function is
introduc it ha infinit mani continu deriv and is a
composit of ramp function with smooth bend call round ramp
function how the interpol function can be extend to more
than on variabl is shown an effici fortran program is
given by which the interpol function can be obtain for
a given point set cacm august 1974 lagerlof r o
e interpol approxim smooth interpol multi variabl interpol interpol function
approxim function spline like function 5 13 ca740815 jb januari
17 1978 9 18 am 2609 5 2609 2609 5
2609 2609 5 2609 
# 2610
gauss harmon interpol formula let r be an open bound
simpli connect region in the x y plane and let
x y be a point in r assum r is
starlik with respect to x y we discuss a method
for comput gauss harmon interpol formula for r and the
point x y such formula approxim a harmon function at
x y in term of a linear combin of it
valu at certain select point on the boundari of r
such formula ar us for approxim the solut of the
dirichlet problem for r cacm august 1974 stroud a h
interpol quadratur harmon interpol harmon quadratur dirichlet problem 5 13
5 16 5 17 ca740814 jb januari 17 1978 9
23 am 2610 5 2610 2610 5 2610 2610 5
2610 
# 2611
the complex method for constrain optim algorithm r454 cacm august
1974 shere k d ca740813 jb januari 17 1978 9
28 am 2611 5 2611 2611 5 2611 2611 5
2611 
# 2612
rosenbrock function minim algorithm r450 cacm august 1974 bultheel a
ca740812 jb januari 17 1978 9 33 am 2587 5
2612 2588 5 2612 2612 5 2612 2612 5 2612
2612 5 2612 2612 6 2612 2612 6 2612 
# 2613
transit set g7 algorithm a482 cacm august 1974 mckai j
regen e transit set 5 39 ca740811 jb januari 17
1978 9 35 am 2613 5 2613 2613 5 2613
2613 5 2613 
# 2614
arrow to preced network transform h algorithm a481 cacm august
1974 crandal k c critic path network preced network 3
23 5 40 ca740810 jb januari 17 1978 9 37
am 2614 5 2614 2614 5 2614 2614 5 2614
# 2615
procedur for comput smooth and interpol natur spline e1 algorithm
a480 cacm august 1974 lych t schumak l l approxim
interpol spline natur spline spline smooth 5 13 ca740809 jb
januari 17 1978 9 40 am 2615 5 2615 2615
5 2615 2615 5 2615 
# 2616
on the convers of program to decis tabl method and
object the problem of convert program to decis tabl ar
investig object of these convers ar mainli program debug and
optim in practic extens to the theori of comput and
comput ar suggest cacm august 1974 cavoura j c decis
tabl program optim debug semant theori of program system analysi
4 19 4 42 4 43 5 21 5 29
ca740808 jb januari 17 1978 9 43 am 2053 4
2616 2220 4 2616 2492 4 2616 2517 4 2616
2518 4 2616 2518 4 2616 2598 4 2616 2616
4 2616 2616 4 2616 2616 4 2616 2616 4
2616 2726 4 2616 3034 4 2616 3034 4 2616
795 4 2616 931 5 2616 1548 5 2616 1684
5 2616 2517 5 2616 2616 5 2616 2616 5
2616 2616 5 2616 
# 2617
a note on subexpress order in the evalu of arithmet
express cacm august 1974 den p j graham g s
ca740807 jb januari 17 1978 9 44 am 2617 5
2617 2617 5 2617 2617 5 2617 
# 2618
a new solut of dijkstra s concurr program problem a
simpl solut to the mutual exclus problem is present which
allow the system to continu to oper despit the failur
of ani individu compon cacm august 1974 lamport l critic
section concurr program multiprocess semaphor 4 32 ca740806 jb januari
17 1978 9 48 am 1781 4 2618 1828 4
2618 1854 4 2618 1877 4 2618 1960 4 2618
2150 4 2618 2150 4 2618 2150 4 2618 2228
4 2618 2228 4 2618 2256 4 2618 2256 4
2618 2317 4 2618 2317 4 2618 2319 4 2618
2377 4 2618 2342 4 2618 2342 4 2618 2342
4 2618 2376 4 2618 2376 4 2618 2379 4
2618 2424 4 2618 2482 4 2618 2618 4 2618
2618 4 2618 2618 4 2618 2618 4 2618 2632
4 2618 2704 4 2618 2723 4 2618 2738 4
2618 2740 4 2618 2741 4 2618 2867 4 2618
3184 4 2618 3184 4 2618 1198 5 2618 1338
5 2618 1749 5 2618 2256 5 2618 2618 5
2618 2618 5 2618 2618 5 2618 2895 5 2618
2150 6 2618 2618 6 2618 
# 2619
graph color condit for the exist of solut to the
timet problem a necessari and suffici condit is present for
the exist of a solut to the gotlieb class teacher
timet problem sever relationship ar establish between the class teacher
timet problem and graph with precondit these precondit place addit
restrict on the color of a graph the precondit correspond
to the unavail constraint and preassign meet in the class
teacher timet problem us some recent result that convert graph
with precondit to graph without them it is shown that
the exist of a color of a graph is the
requir necessari and suffici condit cacm august 1974 neufeld g
a tartar j graph color preassign prevent of assign class
teacher timet 3 9 5 30 5 32 5 59
ca740805 jb januari 17 1978 9 55 am 1355 4
2619 2619 4 2619 2619 4 2619 2772 4 2619
2787 4 2619 1419 5 2619 1429 5 2619 2619
5 2619 2619 5 2619 2619 5 2619 
# 2620
execut time requir for encipher program although encipher ha often
been discuss as a mean to protect comput data it
cost ar not well establish five experi were conduct to
measur the cpu time on a cdc 6400 requir by
addit cipher program both in assembl languag and in fortran
a null transform to measur the time to move data
without encipher encipher with on word kei encipher with a
125 word kei doubl kei encipher and encipher us a
pseudo random kei the result were analyz for consist over
100 run and the effect of constant and intermitt error
were consid time rate for assembl languag encipher rang from
498 800 charact per second for a pseudo random kei
cipher to 2 092 000 charact per second for a
constant on word kei cipher the latter is almost equival
to the rate requir simpli to move data without encipher
fortran test requir over four time as much cpu time
thi paper introduc the idea on enciph time coeffici the
ratio of enciph time to the time taken to fetch
and store data without encipher cacm august 1974 friedman t
d offman l j encipher cipher secur privaci transform protect
cryptographi cryptolog 2 12 2 43 3 70 3 81
4 32 4 39 ca740804 jb januari 17 1978 10
05 am 2620 5 2620 2620 5 2620 2620 5
2620 
# 2621
a high secur log in procedur the protect of time
share system from unauthor user is often achiev by the
us of password by us on wai cipher to code
the password the risk involv with store the password in
the comput can be avoid we discuss the select of
a suitabl on wai cipher and suggest that for thi
purpos polynomi over a prime modulu ar superior to on
wai cipher deriv from sannon code cacm august 1974 purdi
g b oper system time share system secur cryptographi 4
35 ca740803 jb januari 17 1978 10 10 am 2621
5 2621 2621 5 2621 2621 5 2621 
# 2622
a user authent scheme not requir secreci in the comput
in mani comput oper system a user authent himself by
enter a secret password known sole to himself and the
system the system compar thi password with on record in
a password tabl which is avail to onli the authent
program the integr of the system depend on keep the
tabl secret in thi paper a password scheme is present
which doe not requir secreci in the comput all aspect
of the system includ all relev code and data base
mai be known by anyon attempt to intrud the scheme
is base on us a function h which the would
be intrud is unabl to invert thi function is appli
to the user s password and the result compar to
a tabl entri a match be interpret as authent of
the user the intrud mai know all about h and
have access to the tabl but he can penetr the
system onli if he can invert h to determin an
input that produc a given output thi paper discuss issu
surround select of a suitabl h two differ plausibl argument
ar given that penetr would be exceedingli difficult and it
is then argu that more rigor result ar unlik final
some human engin problem relat to the scheme ar discuss
cacm august 1974 evan a jr kantrowitz w weiss e
oper system secur secur authent password on wai encrypt cryptolog
4 39 5 39 ca740802 jb januari 17 1978 10
19 am 2622 5 2622 2622 5 2622 2622 5
2622 
# 2623
a new techniqu for compress and storag of data the
widespread tendenc toward storag of larg program and block off
text ha produc a need for effici method of compress
and store data thi paper describ techniqu that can in
most case decreas storag size by a factor of from
two to four the techniqu involv special handl of lead
and trail blank and the encod of other symbol in
group of fix size as uniqu fix point number the
effici of the system is consid and pertin statist ar
given and compar with statist for other inform code techniqu
cacm august 1974 hahn b file mainten inform retriev util
program text compress code techniqu data storag data manag 3
70 3 73 4 49 ca740801 jb januari 17 1978
10 25 am 2530 4 2623 2623 4 2623 2623
4 2623 2819 4 2623 2501 5 2623 2537 5
2623 2623 5 2623 2623 5 2623 2623 5 2623
# 2624
formal requir for virtualiz third gener architectur virtual machin system
have been implement on a limit number of third gener
comput system e g cp 67 on the ibm 360
67 from previou empir studi it is known that certain
third gener comput system e g the dec pdp 10
cannot support a virtual machin system in thi paper model
of a third gener like comput system is develop formal
techniqu ar us to deriv precis suffici condit to test
whether such an architectur can support virtual machin cacm juli
1974 popek g j goldberg r p oper system third
gener architectur sensit instruct formal requir abstract model proof virtual
machin virtual memori hypervisor virtual machin monitor 4 32 4
35 5 21 5 22 ca740707 jb januari 17 1978
11 19 am 2624 5 2624 2624 5 2624 2624
5 2624 3144 5 2624 1471 6 2624 2298 6
2624 2491 6 2624 2597 6 2624 2624 6 2624
2625 6 2624 2632 6 2624 
# 2625
capabl base address variou address scheme make us of segment
tabl ar examin the inadequaci of these scheme when deal
with share address ar explain these inadequaci ar trace to
the lack of an effici absolut address for object in
these system the direct us of a capabl as an
address is shown to overcom these difficulti becaus it provid
the need absolut address implement of capabl base address is
discuss it is predict that the us of tag to
identifi capabl will domin a hardwar address translat scheme which
never requir the modif of the represent of capabl is
suggest the scheme us a main memori hash tabl for
obtain a segment s locat in main memori given it
uniqu code the hash tabl is avoid for recent access
segment by mean of a set of associ regist a
comput us capabl base address mai be substanti superior to
present system on the basi of protect simplic of program
convent and effici implement cacm juli 1974 fabri r s
address capabl address hardwar protect protect hardwar share address inform
share oper system comput util segment tag architectur 4 30
4 32 4 34 6 21 ca740706 jb januari 17
1978 12 39 pm 1458 4 2625 1523 4 2625
1603 4 2625 1698 4 2625 1747 4 2625 1748
4 2625 1854 4 2625 1877 4 2625 1960 4
2625 2317 4 2625 2358 4 2625 2377 4 2625
2377 4 2625 2378 4 2625 2497 4 2625 2558
4 2625 2625 4 2625 2625 4 2625 2625 4
2625 2625 4 2625 2626 4 2625 2632 4 2625
2669 4 2625 2840 4 2625 2922 4 2625 2941
4 2625 3081 4 2625 3101 4 2625 3105 4
2625 3112 4 2625 3144 4 2625 1471 5 2625
1753 5 2625 2358 5 2625 2438 5 2625 2625
5 2625 2625 5 2625 2625 5 2625 2626 5
2625 2868 5 2625 3105 5 2625 3144 5 2625
1471 6 2625 1471 6 2625 1746 6 2625 2080
6 2625 2298 6 2625 2358 6 2625 2377 6
2625 2377 6 2625 2380 6 2625 2491 6 2625
2558 6 2625 2597 6 2625 2624 6 2625 2625
6 2625 2625 6 2625 2625 6 2625 2625 6
2625 2629 6 2625 2632 6 2625 2632 6 2625
2632 6 2625 2868 6 2625 2939 6 2625 3068
6 2625 
# 2626
protect and the control of inform share in multic the
design of mechan to control the share of inform in
the multic system is describ five design principl help provid
insight into the tradeoff among differ possibl design the kei
mechan describ includ access control list hierarch control of access
specif identif and authent of user and primari memori protect
the paper end with a discuss of sever known weak
in the current protect mechan design cacm juli 1974 saltzer
j h multic protect secur privaci access control authent comput
util time share system proprietari program protect subsystem virtual memori
descriptor 3 70 4 30 6 2 ca740705 jb januari
17 1978 12 49 pm 1753 4 2626 2358 4
2626 2377 4 2626 2377 4 2626 2372 4 2626
2436 4 2626 2625 4 2626 2626 4 2626 2626
4 2626 2626 4 2626 2626 4 2626 2626 4
2626 2669 4 2626 2786 4 2626 2840 4 2626
2840 4 2626 2868 4 2626 2868 4 2626 2870
4 2626 2919 4 2626 3017 4 2626 3105 4
2626 3110 4 2626 3144 4 2626 3174 4 2626
1746 5 2626 2358 5 2626 2377 5 2626 2625
5 2626 2626 5 2626 2626 5 2626 2626 5
2626 2629 5 2626 2840 5 2626 1471 6 2626
1746 6 2626 2436 6 2626 2626 6 2626 2629
6 2626 
# 2627
schedul independ task to reduc mean finish time sequenc to
minim mean finish time or mean time in system is
not onli desir to the user but it also tend
to minim at each point in time the storag requir
to hold incomplet task in thi paper a determinist model
of independ task is introduc and new result ar deriv
which extend and gener the algorithm known for minim mean
finish time in addit to present and analyz new algorithm
it is shown that the most gener mean finish time
problem for independ task is polynomi complet and henc unlik
to admit of a non enum solut cacm juli 1974
bruno j coffman e g jr sethi r minim mean
finish time minim mean flow time sequenc algorithm optim schedul
algorithm determinist schedul model 4 32 5 39 ca740704 jb
januari 17 1978 12 56 pm 2627 5 2627 2627
5 2627 2627 5 2627 
# 2628
minim total process time drum and disk schedul disciplin thi
articl investig the applic of minim total process time mtpt
schedul disciplin to rotat storag unit when random arriv of
request is allow fix head drum and move head drum
and move head disk storag unit ar consid and emphasi
is place on the rel merit of the mtpt schedul
disciplin with respect to the shortest latenc time first sltf
schedul disciplin the result of the simul studi present show
that neither schedul disciplin is uncondition superior to the other
for most fix head drum applic the sltf disciplin is
prefer to mtpt but for intra cylind disk schedul the
mtpt disciplin offer a distinct advantag over the sltf disciplin
the comput requir of an algorithm that implement the mtpt
schedul disciplin ar shown to be compar to sltf algorithm
in both case the sort procedur is the most time
consum phase of the algorithm cacm juli 1974 fuller s
h drum schedul disk schedul shortest latenc time first sltf
minim total process time mtpt rotat storag unit 4 31
4 41 6 34 6 35 ca740703 jb januari 17
1978 1 07 pm 2628 4 2628 2628 4 2628
2891 4 2628 3072 4 2628 3097 4 2628 2375
5 2628 2496 5 2628 2628 5 2628 2628 5
2628 2628 5 2628 2891 5 2628 2375 6 2628
2628 6 2628 
# 2629
the unix time share system unix is a gener purpos
multi user interact oper system for the digit equip corpor
pdp 11 40 and 11 45 comput it offer a
number of featur seldom found even in larger oper system
includ 1 a hierarch file system incorpor demount volum 2
compat file devic and inter process i o 3 the
abil to initi asynchron process 4 system command languag select
on a per user basi and 5 over 100 subsystem
includ a dozen languageshi paper discuss the natur and implement
of the file system and of the user command interfac
cacm juli 1974 ritchi d m thompson k time share
oper system file system command languag pdp 11 4 30
4 32 ca740702 jb januari 17 1978 1 40 pm
2299 4 2629 2501 4 2629 2629 4 2629 2629
4 2629 2868 4 2629 2915 4 2629 2928 4
2629 2951 4 2629 3114 4 2629 1502 5 2629
2380 5 2629 2626 5 2629 2629 5 2629 2629
5 2629 2629 5 2629 2786 5 2629 2840 5
2629 2919 5 2629 3017 5 2629 3110 5 2629
3174 5 2629 1471 6 2629 1746 6 2629 1746
6 2629 2194 6 2629 2358 6 2629 2377 6
2629 2436 6 2629 2536 6 2629 2593 6 2629
2625 6 2629 2626 6 2629 2629 6 2629 2629
6 2629 2629 6 2629 2629 6 2629 2629 6
2629 2629 6 2629 2629 6 2629 2858 6 2629
# 2630
on comput set of shortest path in a graph two
algorithm ar present that construct the k shortest path between
everi pair of vertic in a direct graph these algorithm
gener the floyd algorithm and the dantzig algorithm for find
the shortest path between everi pair of vertic in a
direct graph cacm june 1974 minieka e graph network shortest
path algorithm 5 32 ca740616 jb januari 17 1978 1
55 pm 1846 4 2630 2630 4 2630 2650 4
2630 2630 5 2630 2630 5 2630 2630 5 2630
2757 5 2630 2933 5 2630 576 5 2630 1059
6 2630 2630 6 2630 2630 6 2630 2757 6
2630 
# 2631
an inform theoret approach to text search in direct access
system us direct access comput file of bibliograph inform an
attempt is made to overcom on of the problem often
associ with inform retriev name the mainten and us of
larg dictionari the greater part of which is us onli
infrequ a novel method is present which map the hyperbol
frequenc distribut thi is more suit to implement on storag
devic thi method treat text as a string of charact
rather than word bound by space and choos subset of
string such that their frequenc of occurr ar more even
than those of word type the member of thi subset
ar then us as index kei for retriev the rectangular
distribut of kei frequenc result in a much simplifi file
organ and promis consider cost advantag cacm june 1974 barton
i j creasei s e lynch m f snell m
j text search inform theori file organ direct access inform
retriev charact string bit vector 3 42 3 70 3
73 3 74 5 6 ca740615 jb januari 17 1978
2 07 pm 2532 4 2631 2631 4 2631 2631
4 2631 2746 4 2631 3001 4 2631 2139 5
2631 2532 5 2631 2631 5 2631 2631 5 2631
2631 5 2631 
# 2632
hydra the kernel of a multiprocessor oper system thi paper
describ the design philosophi of hydra the kernel of an
oper system for c mmp the carnegi mellon multi mini
processor thi philosophi is realiz through the introduct of a
gener notion of resourc both physic and virtual call an
object mechan ar present for deal with object includ the
creation of new type specif of new oper applic to
a given type share and protect of ani refer to
a given object against improp applic of ani of the
oper defin with respect to that type of object the
mechan provid a coher basi for extens of the system
in two direct the introduct of new facil and the
creation of highli secur system cacm june 1974 wulf w
cohen e corwin w jone a levin r pierson c
pollack f oper system kernel nucleu protect secur 4 3
6 2 ca740614 jb januari 17 1978 2 40 pm
1458 4 2632 1523 4 2632 1603 4 2632 1698
4 2632 1747 4 2632 1748 4 2632 1828 4
2632 1854 4 2632 1854 4 2632 1877 4 2632
1877 4 2632 1960 4 2632 1960 4 2632 2150
4 2632 2317 4 2632 2319 4 2632 2319 4
2632 2377 4 2632 2377 4 2632 2378 4 2632
2378 4 2632 2342 4 2632 2376 4 2632 2379
4 2632 2320 4 2632 2424 4 2632 2482 4
2632 2497 4 2632 2558 4 2632 2618 4 2632
2625 4 2632 2632 4 2632 2632 4 2632 2632
4 2632 2704 4 2632 2723 4 2632 2738 4
2632 2738 4 2632 2740 4 2632 2740 4 2632
2741 4 2632 2840 4 2632 2867 4 2632 2868
4 2632 2941 4 2632 3105 4 2632 3127 4
2632 3144 4 2632 3184 4 2632 1471 5 2632
1749 5 2632 2080 5 2632 2632 5 2632 2632
5 2632 2632 5 2632 2868 5 2632 2870 5
2632 2876 5 2632 3105 5 2632 3144 5 2632
953 6 2632 1471 6 2632 1471 6 2632 2080
6 2632 2298 6 2632 2377 6 2632 2377 6
2632 2380 6 2632 2491 6 2632 2558 6 2632
2597 6 2632 2624 6 2632 2625 6 2632 2625
6 2632 2625 6 2632 2632 6 2632 2632 6
2632 2632 6 2632 2632 6 2632 2632 6 2632
2685 6 2632 2868 6 2632 2939 6 2632 3068
6 2632 
# 2633
compact represent of contour plot for phone line transmiss method
for the compact represent of contour plot ar describ and
test these ar intend to reduc the cost of transmit
contour plot over phone line we feel some of these
method could be us to transmit contour plot over voic
grade phone line cacm june 1974 adam j gari j
contour plot data transmiss remot termin data compact 4 41
5 13 ca740613 jb januari 17 1978 2 48 pm
2633 4 2633 2633 5 2633 2633 5 2633 2633
5 2633 2987 5 2633 699 5 2633 1326 6
2633 1630 6 2633 2125 6 2633 2547 6 2633
2633 6 2633 421 6 2633 524 6 2633 
# 2634
an evalu of statist softwar in the social scienc sever
hundr colleg and univers comput instal now offer variou type
of statist packag for gener us among those most wide
avail ar osiri spss bmd data text and tsar in
order to provid user with a basi for select and
us test were made for each of these system and
the result ar summar as to cost and perform cacm
june 1974 slysz w d statist comput statist softwar descript
statist bivari tabl pearson correl regress factor analysi on wai
analysi of varianc 1 3 3 30 4 19 4
22 4 49 5 5 ca740612 jb januari 17 1978
2 54 pm 2634 5 2634 2634 5 2634 2634
5 2634 
# 2635
exact probabl for r x c conting tabl algorithm r434
cacm june 1974 boulton d m ca740611 jb januari 17
1978 2 56 pm 2635 5 2635 2635 5 2635
2635 5 2635 
# 2636
gener of random correl normal variabl algorithm r425 cacm june
1974 page r l ca740610 jb januari 17 1978 2
57 pm 2636 5 2636 2636 5 2636 2636 5
2636 
# 2637
hidden line plot program algorithm r420 cacm june 1974 elli
t m r ca740609 jb januari 17 1978 2 59
pm 2637 5 2637 2637 5 2637 2637 5 2637
# 2638
hidden line plot program algorithm r420 cacm june 1974 gaither
b ca740608 jb januari 17 1978 3 00 pm 2638
5 2638 2638 5 2638 2638 5 2638 
# 2639
calcul of fourier integr algorithm r418 cacm june 1974 piessen
r ca740607 jb januari 17 1978 3 01 pm 2639
5 2639 2639 5 2639 2639 5 2639 
# 2640
modifi havi integr algorithm r400 cacm june 1974 piessen r
ca740606 jb januari 17 1978 3 04 pm 2350 4
2640 2354 4 2640 2640 4 2640 2355 5 2640
2640 5 2640 2640 5 2640 2640 5 2640 
# 2641
a minim span tree cluster method z algorithm a479 cacm
june 1974 page r l cluster pattern recognit featur select
minim span tree 3 63 5 39 5 5 ca740605
jb januari 17 1978 3 06 pm 2641 4 2641
2363 5 2641 2641 5 2641 2641 5 2641 2641
5 2641 
# 2642
solut of an overdetermin system of equat in the l1
norm f4 algorithm a478 cacm june 1974 barrodal i robert
f d k l1 approxim l1 norm overdetermin system of
equat linear program simplex method 5 13 5 41 ca740604
jb januari 17 1978 3 25 pm 2642 5 2642
2642 5 2642 2642 5 2642 2759 5 2642 2642
6 2642 
# 2643
the minim of spatial multiplex charact set the paper describ
a techniqu for compact charact set in a digit comput
while retain fast access to individu bit it consid the
problem of minim the storag need to contain such tabl
reduct techniqu ar develop and the problem is shown to
reduc to a cover problem cacm june 1974 gimpel j
f pars lexic analysi scan string process spatial multiplex 4
9 ca740603 jb januari 17 1978 3 31 pm 2643
5 2643 2643 5 2643 2643 5 2643 2706 5
2643 2643 6 2643 
# 2644
a theorem prove languag for experiment becaus of the larg
number of strategi and infer rule present under consider in
autom theorem prove there is a need for develop a
languag especi orient toward autom theorem prove thi paper discuss
some of the featur and instruct of thi languag the
us of thi languag permit easi extens of autom theorem
prove program to includ new strategi and or new infer
rule such extend abil will permit gener experiment with the
variou altern system cacm june 1974 henschen l overbeek r
wo l theorem prove resolut factor paramodul program languag 3
60 4 22 5 21 ca740602 jb januari 17 1978
3 37 pm 2644 5 2644 2644 5 2644 2644
5 2644 
# 2645
two languag for estim program effici two languag enabl their
user to estim the effici of comput program ar present
the program whose effici on wish to estim is written
in the first languag a go to less program languag
which includ most of the featur of algol 60 the
second languag consist of interact command enabl it user to
provid addit inform about the program written in the first
languag and to output result estim it effici processor for
the two languag ar also describ the first processor is
a syntax direct translat which compil a program into a
symbol formula repres the execut time for that program the
sound processor is a set of procedur for that program
the second processor is a set of procedur for algebra
manipul which can be call by the user to oper
on the formula produc by the first processor exampl of
the usag of the two languag ar includ the limit
of the present system it relat to knuth s work
on the analysi of algorithm and some of the direct
for further research ar also discuss cacm june 1974 ccohen
j zuckerman c program languag syntax direct translat symbol manipul
program effici analysi of algorithm 4 12 4 20 5
24 5 25 ca740601 jb januari 17 1978 3 48
pm 1086 4 2645 1132 4 2645 1234 4 2645
1263 4 2645 1265 4 2645 1270 4 2645 1323
4 2645 1358 4 2645 1379 4 2645 1380 4
2645 1453 4 2645 1464 4 2645 1484 4 2645
1491 4 2645 1498 4 2645 1613 4 2645 1614
4 2645 1781 4 2645 1825 4 2645 1860 4
2645 2083 4 2645 2178 4 2645 2179 4 2645
2252 4 2645 2325 4 2645 2341 4 2645 2546
4 2645 2645 4 2645 2652 4 2645 2684 4
2645 2842 4 2645 2929 4 2645 2934 4 2645
3069 4 2645 669 4 2645 679 4 2645 691
4 2645 761 4 2645 949 4 2645 989 4
2645 2645 5 2645 2645 5 2645 2645 5 2645
2719 5 2645 3094 5 2645 3184 5 2645 1265
6 2645 1626 6 2645 210 6 2645 2151 6
2645 2167 6 2645 2179 6 2645 2210 6 2645
2645 6 2645 2645 6 2645 2657 6 2645 
# 2646
a model for mask rotat latenc by dynam disk alloc
thi paper present the background and algorithm for mask the
rotat latenc of a disk or drum it discuss the
anticipatori input and output of block of data to buffer
and primari memori for a mono program comput system a
basic permut algorithm and sever variat ar given becaus of
the anticipatori natur of the i o schedul these algorithm
ar restrict to class of program with predict behavior while
the method ar not restrict to numer comput matrix and
partial differenti equat method ar typic exampl of their us
it is shown that latenc mai be mask us a
small amount of buffer memori the method discuss ar independ
of the overal size of the data base be consid
cacm mai 1974 gold d e kuck d j buffer
memori memori hierarchi permut algorithm rotat latenc stage storag alloc
4 41 6 20 ca740507 jb januari 17 1978 3
59 pm 2646 5 2646 2646 5 2646 2646 5
2646 
# 2647
more on algorithm that reveal properti of float point arithmet
unit cacm mai 1974 gentleman w m marovich s b
float point arithmet high level languag philosophi of languag design
4 9 5 19 ca740506 jb januari 17 1978 4
04 pm 2647 4 2647 2792 4 2647 2267 5
2647 2647 5 2647 2647 5 2647 2647 5 2647
2792 5 2647 2267 6 2647 2647 6 2647 
# 2648
a design for a number theori packag with an optim
trial divis routin a number theori packag is describ which
us doubli link list structur for store multiprecis integ the
packag ha been code in ibm s basic assembl languag
and make heavi us of the macro languag and condit
assembl an optim code trial divis routin is also describ
which can be us to determin the uniqu factor of
larg integ cacm mai 1974 wunderlich m c selfridg j
l number theori packag trial divis multiprecis arithmet factor doubli
link list pseudoprim 3 15 ca740505 jb januari 17 1978
4 09 pm 2648 5 2648 2648 5 2648 2648
5 2648 
# 2649
on the distribut of signific digit and roundoff error gener
logarithm law is deriv for the distribut of the first
t signific digit of a random digit integ thi result
is then us to determin the distribut of the roundoff
error in float point oper which is a mixtur of
uniform and reciproc distribut cacm mai 1974 tsao n signific
digit float point oper roundoff error uniform distribut reciproc distribut
varianc mean valv 5 10 5 11 ca740504 jb januari
17 1978 4 12 pm 2649 5 2649 2649 5
2649 2649 5 2649 
# 2650
order n correct for regular languag a method is present
for calcul a string b belong to a given regular
languag l which is nearest in number of edit oper
to a given input string a b is view as
a reason correct for the possibl erron string a where
a wa origin intend to be a string of l
the calcul of b by the method present requir time
proport to a the number of charact in a the
method should find applic in inform retriev artifici intellig and
spell correct system cacm mai 1974 wagner r a error
correct regular languag regular event finit state automata compil error
recoveri spell correct string best match problem correct corrector error
nondeterminist finit state automata 4 12 4 20 5 22
5 23 5 42 ca740503 jb januari 17 1978 4
26 pm 1179 4 2650 1225 4 2650 1288 4
2650 1350 4 2650 1544 4 2650 1646 4 2650
1646 4 2650 1781 4 2650 1846 4 2650 1945
4 2650 2111 4 2650 2534 4 2650 2534 4
2650 2556 4 2650 2556 4 2650 2630 4 2650
2650 4 2650 2650 4 2650 2650 4 2650 2650
4 2650 2698 4 2650 2708 4 2650 2708 4
2650 2887 4 2650 3093 4 2650 2111 5 2650
2650 5 2650 2650 5 2650 2650 5 2650 576
5 2650 680 5 2650 830 5 2650 
# 2651
the treatment of data type in el1 in construct a
gener purpos program languag a kei issu is provid a
suffici set of data type and associ oper in a
manner that permit both natur problem orient notat and effici
implement the el1 languag contain a number of featur specif
design to simultan satisfi both requir the result treatment of
data type includ provis for programm defin data type data
type and gener routin programm control over type convers and
veri flexibl data type behavior in a context that allow
effici compil code and compact data represent cacm mai 1974
wegbreit b data type mode mode union type convers coercion
gener function extens languag data type definit data descript languag
compil 4 12 4 13 4 22 ca740502 jb januari
17 1978 4 32 pm 2651 5 2651 2651 5
2651 2651 5 2651 2723 5 2651 2941 5 2651
2956 5 2651 3030 5 2651 1379 6 2651 1471
6 2651 1549 6 2651 1749 6 2651 1826 6
2651 210 6 2651 2247 6 2651 2356 6 2651
2356 6 2651 2457 6 2651 2558 6 2651 2651
6 2651 2651 6 2651 2651 6 2651 2651 6
2651 2958 6 2651 2972 6 2651 627 6 2651
731 6 2651 
# 2652
reduct of compil cost through languag contract program languag tailor
to particular group of user can often be construct by
remov unwant featur from a gener purpos languag thi paper
describ the us of simul techniqu to predict the save
in compil cost achiev by such an approach the result
suggest a function which describ the effect of chang in
the power of a languag on the compil cost of
an algorithm express in that languag when featur not actual
us by the algorithm ar remov from the languag the
cost of compil the algorithm decreas moder but when featur
that ar need ar remov the compil cost increas sharpli
cacm mai 1974 shaw m design of program languag languag
contract compil design compil cost algol 4 12 4 20
ca740501 jb januari 17 1978 4 39 pm 1086 4
2652 1132 4 2652 1234 4 2652 1263 4 2652
1265 4 2652 1270 4 2652 1323 4 2652 1358
4 2652 1379 4 2652 1380 4 2652 1453 4
2652 1464 4 2652 1484 4 2652 1491 4 2652
1498 4 2652 1613 4 2652 1614 4 2652 1781
4 2652 1825 4 2652 1860 4 2652 2083 4
2652 2178 4 2652 2179 4 2652 2252 4 2652
2325 4 2652 2341 4 2652 2546 4 2652 2645
4 2652 2652 4 2652 2684 4 2652 2842 4
2652 2929 4 2652 2934 4 2652 3069 4 2652
669 4 2652 679 4 2652 691 4 2652 761
4 2652 949 4 2652 989 4 2652 2652 5
2652 2652 5 2652 2652 5 2652 3184 5 2652
# 2653
solut of the transcendent equat w exp x x algorithm
r443 cacm april 1974 einarsson b ca740417 jb januari 17
1978 4 44 pm 2653 4 2653 2654 4 2653
1955 5 2653 2653 5 2653 2653 5 2653 2653
5 2653 
# 2654
gener of set partit to exactli r subset g7 algorithm
a477 cacm april 1974 ehrich g partit subset gener permut
5 39 ca740416 jb januari 17 1978 4 46 pm
2653 4 2654 2654 4 2654 1955 5 2654 2654
5 2654 2654 5 2654 2654 5 2654 
# 2655
six subprogram for curv fit us spline under tension e2
algorithm a476 cacm april 1974 cline a k interpol spline
contour curv fit 5 13 8 2 ca740415 jb januari
17 1978 4 48 pm 2655 4 2655 2655 5
2655 2655 5 2655 2655 5 2655 2656 5 2655
2655 6 2655 
# 2656
scalar and planar valu curv fit us spline under tension
the spline under tension wa introduc by schweikert in an
attempt to imit cubic spline but avoid the spuriou critic
point thei induc the defin equat ar present here togeth
with an effici method for determin the necessari paramet and
comput the result spline the standard scalar valu curv fit
problem is discuss as well as the fit of open
and close curv in the plane the us of these
curv and the import of the tension in the fit
of contour line ar mention as applic cacm april 1974
cline a k interpol spline contour curv fit 5 13
8 2 ca740414 jb januari 18 1978 9 23 am
2656 4 2656 2655 5 2656 2656 5 2656 2656
5 2656 2656 5 2656 2656 6 2656 
# 2657
an improv program synthes algorithm and it correct an improv
program synthes algorithm base on the algorithm propos by walding
and lee in 1969 is given in the old algorithm
the program synthes problem is translat into a theorem prove
problem and a program is obtain by analyz a proof
for the improv algorithm the analysi is not necessari and
a program is obtain as soon as the proof is
complet thi is achiev by us a modifi variabl trace
mechan invent by green in 1969 the correct of the
improv algorithm is also prove i e the program thu
obtain alwai satisfi the specif cacm april 1974 lee r
c t chang c l walding r j program synthes
algorithm theorem prove consequ find primit resolut 3 60 3
64 4 20 4 42 5 21 5 22 5
24 ca740413 jb januari 18 1978 9 32 am 2657
4 2657 2719 4 2657 2210 5 2657 2657 5
2657 2657 5 2657 2657 5 2657 2719 5 2657
1626 6 2657 210 6 2657 2151 6 2657 2167
6 2657 2210 6 2657 2645 6 2657 2657 6
2657 
# 2658
an altern approach to mutual recurs in algol 60 us
restrict compil cacm april 1974 balfour a algol 60 mutual
recurs compil restrict 4 12 4 22 ca740412 jb februari
1 1978 10 32 am 2658 4 2658 2551 5
2658 2658 5 2658 2658 5 2658 2658 5 2658
# 2659
some remark on lookup of structur variabl cacm april 1974
abraham p w pl 1 symbol tabl structur variabl qualifi
refer compil 4 12 4 22 ca740411 jb februari 1
1978 10 34 am 2659 4 2659 2449 5 2659
2659 5 2659 2659 5 2659 2659 5 2659 
# 2660
addendum to m l patrick paper cacm april 1974 simmon
g c parallel polynomi root find real zero 5 15
ca740410 jb februari 1 1978 10 36 am 2660 4
2660 2266 5 2660 2660 5 2660 2660 5 2660
2660 5 2660 
# 2661
ideal teach machin a solut to the pedagog languag problem
cacm april 1974 sterl t d pollack s v educ
program languag simul 1 52 4 2 ca740409 jb februari
1 1978 10 38 am 2661 5 2661 2661 5
2661 2661 5 2661 
# 2662
graduat educ the ph glut respons and rebutt cacm april
1974 freeman p malcolm m a payn w h graduat
educ ph product accredit 1 5 2 2 2 3
ca740408 jb februari 1 1978 10 40 am 2662 4
2662 2531 5 2662 2662 5 2662 2662 5 2662
2662 5 2662 
# 2663
a studi of comput us in a graduat school of
busi cacm april 1974 luca h c jr montgomeri d
b larrech j c educ manag busi school 1 50
1 52 ca740407 jb januari 18 1978 9 35 am
2663 5 2663 2663 5 2663 2663 5 2663 
# 2664
parallel in tape sort two method for emploi parallel in
tape sort ar present method a is the natur wai
to us parallel method b is new both approxim achiev
the goal of reduc the process time by a divisor
which is the number of processor cacm april 1974 even
s tape sort parallel extern sort queue stack 5 31
6 22 ca740406 jb januari 18 1978 9 44 am
2664 5 2664 2664 5 2664 2664 5 2664 2714
5 2664 3075 5 2664 2289 6 2664 2557 6
2664 2664 6 2664 2664 6 2664 2714 6 2664
# 2665
copi list structur us bound workspac two new algorithm ar
present for list structur copi us bound workspac the first
of primarili theoret interest show that without cell tag bit
the task can be perform in time n 2 the
second algorithm assum on tag bit in each cell deliv
attract practic speed ani noncycl structur is copi in linear
speed while cyclic structur ar copi in averag time less
than nlogn no foreknowledg of cycl absenc is necessari to
achiev linear speed a variat of the second algorithm solv
an open problem concern list structur mark that result demonstr
that mark can be done in averag time nlogn without
the aid of supplement tag bit or stack cacm april
1974 lindstrom g list process copi mark space complex 4
34 5 25 ca740405 jb januari 18 1978 9 55
am 1869 4 2665 2513 4 2665 2665 4 2665
2665 4 2665 2723 4 2665 2855 4 2665 3106
4 2665 1383 5 2665 1549 5 2665 2665 5
2665 2665 5 2665 2665 5 2665 2766 5 2665
2954 5 2665 3106 5 2665 1549 6 2665 210
6 2665 1972 6 2665 2665 6 2665 2665 6
2665 2665 6 2665 2766 6 2665 2766 6 2665
2855 6 2665 2954 6 2665 2998 6 2665 
# 2666
on lion counter exampl for gotlieb s method for the
construct of school timet the timet problem is an essenti
discret problem although the discret problem mai have no feasibl
solut there mai exist a solut to the equival continu
problem an exampl is given for which the nondiscret solut
can be interpret as a set of timet differ from
week to week which togeth satisfi the long term requir
of the timet problem cacm april 1974 smith g sefton
i m combinatori multi index problem necessari condit schedul school
timet timet 3 51 5 39 ca740404 jb januari 18
1978 10 02 am 2666 5 2666 2666 5 2666
2666 5 2666 
# 2667
execut characterist of program in a page on demand system
data ar present which show the execut characterist of two
type of commonli us program in a larg scale time
share comput system a softwar monitor facil built into the
supervisor wa us for data collect dure normal system oper
these data were analyz and result of thi analysi ar
present for a fortran compil and an interact line file
editor probabl distribut function and other data ar given for
such thing as cpu interv i o interv and the
number of such interv dure execut empir distribut ar compar
with simpl theoret distribut exponenti hyperexponenti and geometr other data
show page characterist of task as a function of the
number of page those task have in core cacm april
1974 boys j w program behavior virtual memori page demand
page softwar monitor program execut characterist compil execut behavior editor
execut behavior 4 12 4 19 4 32 4 39
4 9 8 1 ca740403 jb januari 18 1978 10
12 am 1533 4 2667 1892 4 2667 1924 4
2667 1951 4 2667 2095 4 2667 2218 4 2667
2297 4 2667 2374 4 2667 2526 4 2667 2667
4 2667 2667 4 2667 2667 4 2667 2668 4
2667 2668 4 2667 2668 4 2667 2862 4 2667
2863 4 2667 1604 5 2667 1728 5 2667 1827
5 2667 2667 5 2667 2667 5 2667 2667 5
2667 
# 2668
comput of page fault probabl from program transit diagram an
algorithm is given for calcul page fault probabl in a
virtual memori system oper under demand page with variou memori
size and replac rule a first order markov model of
program behavior is assum and a represent of the system
base on memori state control state and memori substat is
present the algorithm is gener in the sens that the
page fault probabl can be calcul for nonpredict replac rule
appli to ani program repres by a on step markov
chain a detail exampl is given to illustr the algorithm
for random and least recent us lru replac rule cacm
april 1974 franklin m a gupta r k virtual memori
demand page replac rule program model program behavior markov model
page fault page fault probabl 4 30 6 20 ca740402
jb januari 18 1978 10 31 am 1533 4 2668
1892 4 2668 1924 4 2668 1951 4 2668 2095
4 2668 2218 4 2668 2297 4 2668 2374 4
2668 2526 4 2668 2667 4 2668 2667 4 2668
2667 4 2668 2668 4 2668 2668 4 2668 2668
4 2668 2668 4 2668 2668 4 2668 2862 4
2668 2863 4 2668 1604 5 2668 1728 5 2668
1761 5 2668 1827 5 2668 2668 5 2668 2668
5 2668 2668 5 2668 2677 5 2668 
# 2669
a simpl linear model of demand page perform predict the
perform of a propos automat manag multilevel memori system requir
a model of the pattern by which program refer to
the inform store in the memori some recent experiment measur
on the multic virtual memori suggest that for rough approxim
a remark simpl program refer model will suffic the simpl
model combin the effect of the inform refer pattern with
the effect of the automat manag algorithm to produc a
singl composit statement the mean number of memori refer between
page except increas linearli with the size of the page
memori the result model is easi to manipul and is
applic to such divers problem as choos an optimum size
for a page memori arrang for reproduc memori usag charg
and estim the amount of core memori share cacm april
1974 saltzer j h page demand page memori model program
model perform measur multilevel memori system virtual memori associ memori
memori usag account multic 3 79 4 30 4 32
ca740401 jb januari 18 1978 10 41 am 1892 4
2669 1901 4 2669 2085 4 2669 2095 4 2669
2218 4 2669 2277 4 2669 2319 4 2669 2319
4 2669 2329 4 2669 2358 4 2669 2377 4
2669 2373 4 2669 2374 4 2669 2380 4 2669
2434 4 2669 2499 4 2669 2481 4 2669 2501
4 2669 2582 4 2669 2582 4 2669 2625 4
2669 2626 4 2669 2669 4 2669 2669 4 2669
2669 4 2669 2669 4 2669 2828 4 2669 2863
4 2669 2863 4 2669 2881 4 2669 2928 4
2669 2996 4 2669 3006 4 2669 3016 4 2669
3052 4 2669 3054 4 2669 3067 4 2669 1751
5 2669 1901 5 2669 2017 5 2669 2358 5
2669 2669 5 2669 2669 5 2669 2669 5 2669
# 2670
effici implement of a variabl project algorithm for nonlinear least
squar problem nonlinear least squar frequent aris for which the
variabl to be solv for can be separ into a
linear and a nonlinear part a variabl project algorithm ha
been develop recent which is design to take advantag of
the structur of a problem whose variabl separ in thi
wai thi paper give a slightli more effici and slightli
more gener version of thi algorithm than ha appear earlier
cacm march 1974 krogh f t nonlinear least squar paramet
estim variabl project 5 14 5 15 ca740313 jb januari
18 1978 10 49 am 2670 5 2670 2670 5
2670 2670 5 2670 
# 2671
a note on a combinatori problem of burnett and coffman
cacm march 1974 stone h s memori interleav derang rencontr
combinatori analysi 5 39 6 34 ca740312 jb januari 18
1978 10 54 am 2671 5 2671 2671 5 2671
2671 5 2671 
# 2672
emot content consid danger cacm march 1974 smoliar s w
artifici intellig heurist program model of cognit process comput music
comput composit music theori 3 44 3 65 ca740311 jb
januari 18 1978 10 56 am 2672 5 2672 2672
5 2672 2672 5 2672 
# 2673
quadrat search for hash tabl of size p n cacm
march 1974 ackerman a f hash quadrat search 4 10
ca740310 jb januari 18 1978 10 58 am 2673 5
2673 2673 5 2673 2673 5 2673 2704 5 2673
2770 5 2673 3053 5 2673 1247 6 2673 1329
6 2673 1552 6 2673 1749 6 2673 1785 6
2673 1786 6 2673 1869 6 2673 1973 6 2673
1973 6 2673 1992 6 2673 1992 6 2673 2018
6 2673 2107 6 2673 2109 6 2673 2109 6
2673 2356 6 2673 2379 6 2673 2412 6 2673
2543 6 2673 2673 6 2673 2673 6 2673 2673
6 2673 2707 6 2673 2770 6 2673 
# 2674
scan convers algorithm for a cell organ raster displai raster
scan comput graphic with real time charact gener have previous
been limit to alphanumer charact a displai ha been describ
which extend the capabl of thi organ to includ gener
graphic two fundament differ scan convers algorithm which have been
develop to support thi displai ar present on is most
suitabl to non interact applic and the other to interact
applic the algorithm were implement in fortran on the cdc
6400 comput result obtain from the implement show that the
noninteract algorithm can significantli reduc displai file storag requir at
littl cost in execut time over that of a convent
raster displai the interact algorithm can improv respons time and
reduc storag requir cacm march 1974 barrett r c fordan
b w jr graphic scan convers raster displai line draw
discret imag dot gener matrix displai 4 41 6 35
8 2 ca740309 jb januari 18 1978 11 08 am
1891 4 2674 2211 4 2674 2421 4 2674 2674
4 2674 2674 4 2674 2674 4 2674 2674 4
2674 2687 4 2674 2687 4 2674 2828 4 2674
1741 5 2674 2004 5 2674 2421 5 2674 2674
5 2674 2674 5 2674 2674 5 2674 2687 5
2674 
# 2675
a comput routin for quadrat and linear program problem algorithm
r431 cacm march 1974 ravindran a ca740308 jb januari 18
1978 11 10 am 2675 5 2675 2675 5 2675
2675 5 2675 
# 2676
zero of a complex polynomi algorithm r419 cacm march 1973
wither d h ca740307 jb januari 18 1978 11 11
am 2676 5 2676 2676 5 2676 2676 5 2676
# 2677
incomplet beta ratio algorithm r179 cacm march 1974 bosten n
e battist e l ca740306 jb januari 18 1978 11
13 am 2668 5 2677 2677 5 2677 2677 5
2677 2677 5 2677 1604 6 2677 1728 6 2677
1761 6 2677 1827 6 2677 2677 6 2677 
# 2678
visibl surfac plot program j6 algorithm a475 cacm march 1974
wright t hidden line problem comput graphic contour surfac 3
65 4 41 8 2 ca740305 jb januari 18 1978
11 18 am 2678 5 2678 2678 5 2678 2678
5 2678 
# 2679
some perform test of quicksort and descend detail perform evalu
ar present for six acm algorithm quicksort no 64 shellsort
no 201 stringsort no 207 treesort3 no 245 quickersort no
271 and qsort no 402 algorithm 271 and 402 ar
refin of algorithm 64 and all three ar discuss in
some detail the evid given here demonstr that qsort no
402 requir mani more comparison than it author claim of
all these algorithm quickersort requir the fewest comparison to sort
random arrai cacm march 1974 loeser r sort in place
sort sort effici sort perform test quicksort quickersort qsort shellsort
stringsort treesort3 util sort algorithm gener purpos sort algorithm sort
algorithm document 4 49 5 31 ca740304 jb januari 18
1978 11 26 am 1175 4 2679 1663 4 2679
1919 4 2679 1919 4 2679 1919 4 2679 1969
4 2679 1969 4 2679 1997 4 2679 1997 4
2679 2042 4 2679 2042 4 2679 2118 4 2679
2191 4 2679 2195 4 2679 2216 4 2679 2216
4 2679 2222 4 2679 2222 4 2679 2356 4
2679 2388 4 2679 2348 4 2679 2679 4 2679
2679 4 2679 2679 4 2679 2679 4 2679 2679
4 2679 2679 4 2679 2679 4 2679 2679 4
2679 2679 4 2679 2679 4 2679 2679 4 2679
2679 4 2679 2844 4 2679 2972 4 2679 3054
4 2679 3054 4 2679 3054 4 2679 3054 4
2679 3121 4 2679 970 5 2679 1175 5 2679
1190 5 2679 1228 5 2679 1969 5 2679 1997
5 2679 308 5 2679 2042 5 2679 2679 5
2679 2679 5 2679 2679 5 2679 507 5 2679
3054 5 2679 3187 5 2679 716 5 2679 783
5 2679 1175 6 2679 1880 6 2679 1919 6
2679 1969 6 2679 1980 6 2679 1997 6 2679
307 6 2679 308 6 2679 309 6 2679 2017
6 2679 2679 6 2679 776 6 2679 
# 2680
optim space alloc on disk storag devic when the amount
of space requir for file storag exce the amount which
can be kept on line decis must be made as
to which file ar to be perman resid and which
mountabl these decis will affect the number of mount request
issu to the oper thi is often a bottleneck in
a comput facil and reduc the number of mount thu
decreas turnaround time an optim model for the assign of
file to disk pack and pack to either resid or
nonresid statu is present heurist ar suggest for those case
in which it is ineffici to comput the actual optimum
cacm march 1974 morgan h l disk analysi disk optim
disk file file system file schedul space alloc memori hierarchi
3 72 3 73 4 39 ca740303 jb januari 18
1978 12 32 pm 2680 5 2680 2680 5 2680
2680 5 2680 
# 2681
dynam memori repack a probabilist model of a multiprogram system
is exercis in order to determin the condit under which
the dynam repack of main memori is benefici an express
is deriv for the maximum interfer that a repack process
mai introduc befor the origin perform of the system is
degrad altern approach to repack ar discuss and the oper
condit that lead to improv system throughput through repack ar
delin cacm march 1974 balkovich e chiu w presser l
wood r dynam memori repack memori compact storag fragment multiprogram
system model probabilist model central processor product resourc util system
throughput 4 32 5 5 6 20 ca740302 jb januari
18 1978 12 37 pm 2681 4 2681 2218 5
2681 2681 5 2681 2681 5 2681 2681 5 2681
# 2682
on the construct of a repres synthet workload a gener
method of construct a drive workload repres of a real
workload is describ the real workload is character by it
demand on the variou system resourc these characterist of the
real workload ar obtain from the system account data the
characterist of the drive workload ar determin by match the
joint probabl densiti of the real workload with that of
the drive workload the drive workload is realiz by us
a synthet program in which the characterist can be vari
by vari the appropri paramet calibr experi ar conduct to
determin express relat the synthet program paramet with the workload
characterist the gener method is appli to the case of
two variabl cpu second and number of i o activ
and synthet workload with 88 job is construct to repres
a month s workload consist of about 6000 job cacm
march 1974 sreenivasan k kleinman a j benchmark calibr drive
workload input to simul probabl distribut repres workload synthet workload
workload characterist 5 5 5 9 8 1 ca740301 jb
januari 18 1978 12 46 pm 2682 5 2682 2682
5 2682 2682 5 2682 3067 5 2682 1751 6
2682 2374 6 2682 2373 6 2682 2595 6 2682
2682 6 2682 2863 6 2682 2864 6 2682 3006
6 2682 
# 2683
the synthesi of loop predic current method for mechan program
verif requir a complet predic specif on each loop becaus
thi is tediou and error prone produc a program with
complet correct predic is reason difficult and would be facilit
by machin assist thi paper discuss techniqu for mechan synthes
loop predic two class of techniqu ar consid 1 heurist
method which deriv loop predic from boundari condit and or
partial specifi induct assert 2 extract method which us input
predic and appropri weak interpret to obtain certain class of
loop predic by an evalu on the weak interpret cacm
march 1974 wegbreit b program verif loop predic induct assert
synthesi of loop predic weak interpret well found set properti
extract theorem prove 3 64 4 19 4 22 5
24 ca740206 jb januari 18 1978 12 55 pm 2683
5 2683 2683 5 2683 2683 5 2683 2874 5
2683 3104 5 2683 1682 6 2683 2227 6 2683
2317 6 2683 2457 6 2683 2683 6 2683 2683
6 2683 2871 6 2683 521 6 2683 
# 2684
product system or can we do better than bnf sinc
the develop of bnf the definit of the syntax of
program languag ha been almost univers associ with context free
requir yet numer interest and difficult issu in syntax stem
from the context sensit requir notabl the compat between the
declar of an identifi and it us the correspond between
actual and formal paramet and issu aris from block structur
thi paper explor the us of a formal notat call
product system in provid a readabl and complet formal definit
of syntax as a practic illustr a small but signific
subset of pl i is consid a more detail present
as well as the applic to defin abstract syntax and
translat between languag is given in a previou paper by
the author cacm februari 1974 ledgard h f syntax translat
context sensit grammar compil formal definit pl i standard 4
2 5 21 5 23 ca740205 jb januari 18 1978
1 07 pm 1086 4 2684 1132 4 2684 1234
4 2684 1263 4 2684 1265 4 2684 1270 4
2684 1323 4 2684 1358 4 2684 1379 4 2684
1380 4 2684 1453 4 2684 1464 4 2684 1469
4 2684 1484 4 2684 1486 4 2684 1491 4
2684 1491 4 2684 1498 4 2684 1613 4 2684
1614 4 2684 1781 4 2684 1781 4 2684 1781
4 2684 1825 4 2684 1860 4 2684 2083 4
2684 2178 4 2684 2178 4 2684 2178 4 2684
2179 4 2684 2252 4 2684 2325 4 2684 2326
4 2684 2326 4 2684 2341 4 2684 2470 4
2684 2546 4 2684 2645 4 2684 2652 4 2684
2684 4 2684 2684 4 2684 2684 4 2684 2842
4 2684 2929 4 2684 2934 4 2684 3044 4
2684 3069 4 2684 669 4 2684 679 4 2684
691 4 2684 761 4 2684 949 4 2684 989
4 2684 1303 5 2684 1323 5 2684 2684 5
2684 2684 5 2684 2684 5 2684 3184 5 2684
# 2685
the parallel execut of do loop method ar develop for
the parallel execut of differ iter of a do loop
both asynchron multiprocessor comput and arrai comput ar consid practic
applic to the design of compil for such comput is
discuss cacm februari 1974 lamport l parallel comput multiprocessor comput
arrai comput vector comput loop 4 12 5 24 ca740204
jb januari 18 1978 1 14 pm 2685 5 2685
2685 5 2685 2685 5 2685 2785 5 2685 2876
5 2685 2433 6 2685 2632 6 2685 2685 6
2685 2685 6 2685 
# 2686
an approxim method for gener asymmetr random variabl tukei s
lambda distribut is gener to provid an algorithm for gener
valu of unimod asymmetr random variabl thi algorithm ha the
same advantag as the symmetr random variabl gener previous given
by the author except that the addit of anoth paramet
complic the problem of find the paramet valu to fit
a distribut cacm februari 1974 ramberg j s schmeiser b
w simul mont carlo probabl statist approxim random variabl random
number moment distribut 5 5 8 1 ca740203 jb januari
18 1978 1 19 pm 2686 4 2686 2261 5
2686 2686 5 2686 2686 5 2686 2686 5 2686
# 2687
a cell organ raster displai for line draw raster scan
comput graphic displai with real time charact gener have previous
been limit to alphanumer charact a displai is describ which
extend the capabl of thi organ to includ gener graphic
the feasibl of such a displai is shown by deriv
the minimum number of pattern requir in the read onli
memori of the charact gener to synthes an arbitrari line
the synthesi process doe not compromis pictur qualiti sinc the
result dot pattern ar ident with those of a convent
raster displai furthermor the time constraint of a raster displai
ar shown to be satisfi for a typic design for
veri complex line draw cacm februari 1974 jordan b w
jr barrett r c graphic raster displai line draw discret
imag dot gener matrix displai 4 41 6 35 8
2 ca740202 jb januari 18 1978 1 28 pm 1891
4 2687 2004 4 2687 2211 4 2687 2421 4
2687 2674 4 2687 2674 4 2687 2687 4 2687
2687 4 2687 2687 4 2687 2692 4 2687 2828
4 2687 1741 5 2687 1915 5 2687 2004 5
2687 2674 5 2687 2687 5 2687 2687 5 2687
2687 5 2687 1741 6 2687 2004 6 2687 2421
6 2687 2687 6 2687 
# 2688
attribut base file organ in a page memori environ the
high cost of page access impli a need for more
care data organ in a page memori than is typic
of most invert file and similar approach to multi kei
retriev thi articl analys that cost and propos a method
call multipl kei hash which attempt to minim it sinc
thi approach is not alwai prefer to invers a combin
method is describ the exact specif of thi combin for
a file with given data and traffic characterist is formul
as a mathemat program the propos heurist solut to thi
program can often improv on a simpl invers techniqu by
a factor of 2 or 3 cacm februari 1974 rothni
j b jr lozano t file organ page retriev algorithm
invert file multipl kei hash 3 70 3 73 3
74 3 79 ca740201 jb januari 18 1978 1 37
pm 2160 4 2688 2688 4 2688 2114 5 2688
2688 5 2688 2688 5 2688 2688 5 2688 2976
5 2688 2688 6 2688 2765 6 2688 2882 6
2688 
# 2689
a crt report gener system cacm januari 1974 luca h
c jr report gener autom system design data process manag
3 50 4 12 4 22 ca740110 jb januari 18
1978 1 40 pm 2689 5 2689 2689 5 2689
2689 5 2689 
# 2690
a number system for combin cacm januari 1974 knott g
d combinator code system storag map function 4 9 5
30 ca740109 jb januari 18 1978 1 42 pm 2690
4 2690 2690 4 2690 2853 4 2690 3115 4
2690 203 5 2690 2690 5 2690 2690 5 2690
2690 5 2690 2853 5 2690 579 5 2690 2690
6 2690 579 6 2690 
# 2691
comment on the algorithm of verhelst for the convers of
limit entri decis tabl to flowchart cacm januari 1974 king
p j h johnson r g decis tabl flowchart preprocessor
optim program search 3 50 3 59 4 19 4
29 4 49 5 31 ca740108 jb januari 18 1978
1 45 pm 2598 4 2691 2691 4 2691 2726
4 2691 3113 4 2691 2263 5 2691 2598 5
2691 2691 5 2691 2691 5 2691 2691 5 2691
3113 5 2691 1172 6 2691 1354 6 2691 1548
6 2691 2220 6 2691 2263 6 2691 2263 6
2691 2453 6 2691 2598 6 2691 2691 6 2691
2691 6 2691 2856 6 2691 
# 2692
reentrant polygon clip a new famili of clip algorithm is
describ these algorithm ar abl to clip polygon against irregular
convex plane face volum in three dimens remov the part
of the polygon which lie outsid the volum in two
dimens the algorithm permit clip against irregular convex window polygon
to be clip ar repres as an order sequenc of
vertic without repetit of first and last in mark contrast
to represent as a collect of edg as wa heretofor
the common procedur output polygon have an ident format with
new vertic introduc in sequenc to describ ani newli cut
edg or edg the algorithm easili handl the particularli difficult
problem of detect that a new vertex mai be requir
at a corner of the clip window the algorithm describ
achiev consider simplic by clip separ against each clip plane
or window boundari code capabl of clip the polygon against
a singl boundari is reenter to clip against subsequ boundari
each such reentrant stage of clip need store onli two
vertex valu and mai begin it process as soon as
the first output vertex from the proceed stage is readi
becaus the same code is reenter for clip against subsequ
boundari clip against veri complex window shape is practic for
perspect applic in three diment a six plane truncat pyramid
is chosen as the clip volum the two addit plane
parallel to the project screen serv to limit the rang
of depth preserv through the project a perspect project method
which provid for arbitrari view angl and depth of field
in spite of simpl fix clip plane is describ thi
method is ideal for subsequ hidden surfac comput cacm januari
1974 sutherland i e hodgman g w comput graphic hidden
surfac clip 5 31 6 32 6 35 ca740107 jb
januari 18 1978 2 04 pm 2004 4 2692 2687
4 2692 2692 4 2692 1915 5 2692 2692 5
2692 2692 5 2692 2692 5 2692 
# 2693
bivari interpol and smooth surfac fit base on local procedur
e2 algorithm a474 cacm januari 1974 akima h bivari interpol
interpol partial deriv polynomi smooth surfac fit 5 13 ca740106
jb januari 18 1978 2 07 pm 1845 4 2693
1900 4 2693 2083 4 2693 2154 4 2693 2270
4 2693 2693 4 2693 2693 4 2693 2693 4
2693 2696 4 2693 988 5 2693 2270 5 2693
2693 5 2693 2693 5 2693 2693 5 2693 2696
5 2693 2270 6 2693 2693 6 2693 
# 2694
comput of legendr seri coeffici c6 algorithm a473 cacm januari
1974 piessen r legendr seri chebyshev seri 5 13 ca740105
jb januari 18 1978 2 21 pm 2694 4 2694
1478 5 2694 2694 5 2694 2694 5 2694 2694
5 2694 
# 2695
tridiagon by permut tridiagon a matrix by similar transform is
an import comput tool in numer linear algebra consid the
class of spars matric which can be tridiagon us onli
row and correspond column permut the advantag of us such
a transform includ the absenc of round off error and
improv comput time when compar with standard transform a graph
theoret algorithm which examin an arbitrari n x n matrix
and determin whether or not it can be permut into
tridiagon form is given the algorithm requir no arithmet while
the number of comparison the number of assign and the
number of increment ar linear in n thi compar veri
favor with standard transform method if the matrix is permut
into tridiagon form the algorithm give the explicit tridiagon form
otherwis earli reject will occur cacm januari 1974 gibb n
e pool w g jr tridiagon matrix permut algorithm eigenvalu
graph bandwidth spars matrix 5 14 5 32 ca740104 jb
januari 18 1978 2 31 pm 2695 5 2695 2695
5 2695 2695 5 2695 
# 2696
a method of bivari interpol and smooth surfac fit base
on local procedur a method is design for interpol valu
given at point of a rectangular grid in a plane
by a smooth bivari function z z x y the
interpol function is a bicub polynomi in each cell of
the rectangular grid emphasi is an avoid excess undul between
given grid point the propos method is an extens of
the method of univari interpol develop earlier by the author
and is likewis base on local procedur cacm januari 1974
akima h bivari interpol interpol partial deriv polynomi smooth surfac
fit 5 13 ca740103 jb januari 18 1978 2 38
pm 2693 4 2696 2696 4 2696 2696 4 2696
2270 5 2696 2693 5 2696 2696 5 2696 2696
5 2696 2696 5 2696 988 6 2696 2270 6
2696 2696 6 2696 
# 2697
a fast method for solv a class of tridiagon linear
system the solut of linear system have real symmetr diagon
domin tridiagon coeffici matric with constant diagon is consid it
is prove that the diagon of the lu decomposit converg
when float point precis it is also prove that the
comput lu decomposit converg when float point arithmet is us
and that the limit of the lu diagon us float
point ar roughli within machin precis of the limit us
real arithmet thi fact is exploit to reduc the number
of float point oper requir to solv a linear system
from 8n 7 to 5n 2k 3 where k is
much less than n the order of the matrix if
the element of the subdiagon and superdiagon ar 1 then
onli 4n 2k 3 oper ar need the entir lu
decomposit take k word of storag and consider save in
arrai subscript ar achiev upper and lower bound on k
ar obtain in term of the ratio of the coeffici
matrix diagon constant and paramet of the float point number
system variou gener of these result ar discuss cacm januari
1974 malcolm m a palmer j numer linear algebra linear
system toeplitz matric tridiagon matric 5 5 1 5 11
5 14 5 17 ca740102 jb januari 18 1978 2
50 pm 2697 5 2697 2697 5 2697 2697 5
2697 
# 2698
syntax direct least error analysi for context free languag a
practic approach a least error recogn is develop inform us
the well known recogn of earlei along with element of
bellman s dynam program the analyz take a gener class
of context free grammar as driver and ani finit string
as input recognit consist of a least error count for
a correct version of the input rel to the driver
grammar the algorithm design emphas practic aspect which help in
program it cacm januari 1974 lyon g arbitrari input string
context free grammar pars dynam program store subanalys separ state
merg least error correct 4 12 5 23 5 42
ca740101 jb januari 18 1978 2 57 pm 1225 4
2698 1323 4 2698 1350 4 2698 1358 4 2698
1379 4 2698 1380 4 2698 1542 4 2698 1646
4 2698 1665 4 2698 1665 4 2698 1683 4
2698 1693 4 2698 1693 4 2698 1768 4 2698
1781 4 2698 1781 4 2698 1781 4 2698 1781
4 2698 1787 4 2698 1787 4 2698 1787 4
2698 1824 4 2698 1825 4 2698 1836 4 2698
1836 4 2698 1836 4 2698 1861 4 2698 1945
4 2698 1945 4 2698 1945 4 2698 1989 4
2698 1989 4 2698 2015 4 2698 2015 4 2698
2060 4 2698 2060 4 2698 2060 4 2698 2061
4 2698 2061 4 2698 2082 4 2698 2091 4
2698 2091 4 2698 2110 4 2698 2112 4 2698
2127 4 2698 2152 4 2698 2179 4 2698 2179
4 2698 2179 4 2698 2187 4 2698 2317 4
2698 2340 4 2698 2356 4 2698 2534 4 2698
2541 4 2698 2545 4 2698 2546 4 2698 2546
4 2698 2603 4 2698 2650 4 2698 2698 4
2698 2698 4 2698 2698 4 2698 2698 4 2698
2698 4 2698 2698 4 2698 2698 4 2698 2708
4 2698 2708 4 2698 2708 4 2698 2708 4
2698 2733 4 2698 2733 4 2698 2820 4 2698
2824 4 2698 2921 4 2698 2982 4 2698 2986
4 2698 3045 4 2698 3045 4 2698 3073 4
2698 3093 4 2698 3093 4 2698 3155 4 2698
3154 4 2698 1477 5 2698 1491 5 2698 1781
5 2698 2110 5 2698 2556 5 2698 2698 5
2698 2698 5 2698 2698 5 2698 680 5 2698
799 5 2698 
# 2699
automat data structur choic in a languag of veri high
level setl is a set theoret orient languag of veri
high level whose repertoir of semant object includ finit set
order n tupl and set of order n tupl usabl
as map thi paper describ the structur of an optim
for thi languag among other method of interest the optim
us techniqu which allow relat of inclus and membership to
be establish the domain and rang of tabul map to
be estim from abov and below and the singl valued
of tabul map to be prove onc fact of thi
kind have been establish automat choic of data structur becom
possibl the method emploi ar base upon and extend known
techniqu of data flow analysi cacm decemb 1975 schwartz j
t program optim automat program high level languag set theoret
languag data structur choic 4 12 4 20 4 22
ca751208 jb januari 5 1978 3 53 pm 2699 5
2699 2699 5 2699 2699 5 2699 
# 2700
reduct a method of prove properti of parallel program when
prove that a parallel program ha a given properti it
is often conveni to assum that a statement is indivis
i e that the statement cannot be interleav with the
rest of the program here suffici condit ar obtain to
show that the assumpt that a statement is indivis can
be relax and still preserv properti such as halt thu
correct proof of a parallel system can often be greatli
simplifi cacm decemb 1975 lipton r j deadlock free reduct
interrupt indivis parallel program semaphor verif method process comput sequenc
4 32 4 35 5 24 ca751207 jb januari 5
1978 3 59 pm 2700 4 2700 3128 4 2700
2376 5 2700 2700 5 2700 2700 5 2700 2700
5 2700 
# 2701
a fast and usual linear algorithm for global flow analysi
abstract onli complet paper jacm 23 1 januari 1976 a
new algorithm for global flow analysi on reduc graph is
present the algorithm is shown to treat a veri gener
class of function space for a graph of e edg
the algorithm ha a worst case time bound of o
e log e function oper it is also shown that
in program term the number of oper is proport to
e plu the number of exit from program loop consequ
a restrict to on entri on exit control structur linear
the algorithm can be extend to yet larger class of
function space and graph by relax the time bound exampl
ar given of code improv problem which can be solv
us the algorithm cacm decemb 1975 graham s l wegman
m global flow analysi data flow code optim common subexpress
elimin live dead analysi inform propag flow graph reduc go
to less program depth first search path compress 4 12
5 24 5 25 5 32 ca751206 jb januari 5
1978 4 08 pm 2701 5 2701 2701 5 2701
2701 5 2701 
# 2702
on the complex of lr k test the problem of
determin whether an arbitrari context free grammar is a member
of some easili pars subclass of grammar such as the
lr k grammar is consid the time complex of thi
problem is analyz both when k is consid to be
a fix integ and when k is consid to be
a paramet of the test in the first case it
is shown that for everi k there exist an o
n k 2 algorithm for test the lr k properti
where n is the size of the grammar in question
on the other hand if both k and the subject
grammar ar problem paramet then the complex of the problem
depend veri strongli on the represent chosen for k more
specif it is shown that thi problem is np complet
when k is express in unari when k is express
in binari the problem is complet for nondeterminist exponenti time
these result carri over to mani other parameter class of
grammar such as the ll k strong ll k slr
k lc k and strong lc k grammar cacm decemb
1975 hunt h b iii szymanski t g ullman j
d comput complex context free grammar pars lr k grammar
np complet problem 4 12 5 23 5 25 ca751205
jb januari 5 1978 4 28 pm 2702 5 2702
2702 5 2702 2702 5 2702 
# 2703
the intrins exponenti complex of the circular problem for attribut
grammar attribut grammar ar an extens of context free grammar
devis by knuth as a mechan for includ the semant
of a context free languag with the syntax of the
languag the circular problem for a grammar is to determin
whether the semant for all possibl sentenc program in fact
will be well defin it is prove that thi problem
is in gener computation intract specif it is shown that
ani determinist algorithm which solv the problem must for infinit
mani case us an exponenti amount of timen improv version
of knuth s circular test algorithm is also given which
actual solv the problem within exponenti time cacm decemb 1975
jazayeri m ogden w f round w c attribut grammar
circular problem context free grammar comput complex exponenti time semant
4 12 5 25 ca751204 jb januari 5 1978 4
38 pm 2703 4 2703 2703 5 2703 2703 5
2703 2703 5 2703 2886 5 2703 
# 2704
except handl issu and a propos notat thi paper defin
except condit discuss the requir except handl languag featur must
satisfi and propos some new languag featur for deal with
except in an orderli and reliabl wai the propos languag
featur serv to highlight except handl issu by show how
defici in current approach can be remedi cacm decemb 1975
goodenough j b multilevel exit goto statement error condit structur
program on condit program languag 4 22 ca751203 jb januari
5 1978 4 47 pm 1397 4 2704 1828 4
2704 1854 4 2704 1877 4 2704 1960 4 2704
2150 4 2704 2317 4 2704 2319 4 2704 2377
4 2704 2342 4 2704 2376 4 2704 2379 4
2704 2424 4 2704 2482 4 2704 2618 4 2704
2632 4 2704 2704 4 2704 2704 4 2704 2704
4 2704 2704 4 2704 2704 4 2704 2704 4
2704 2723 4 2704 2738 4 2704 2738 4 2704
2740 4 2704 2741 4 2704 2770 4 2704 2866
4 2704 2867 4 2704 2867 4 2704 2869 4
2704 2902 4 2704 2941 4 2704 2958 4 2704
3004 4 2704 3030 4 2704 3053 4 2704 3184
4 2704 1247 5 2704 1552 5 2704 1749 5
2704 2356 5 2704 2379 5 2704 2673 5 2704
2704 5 2704 2704 5 2704 2704 5 2704 2945
5 2704 3150 5 2704 1947 6 2704 2060 6
2704 2704 6 2704 2704 6 2704 2842 6 2704
2870 6 2704 2939 6 2704 2940 6 2704 2941
6 2704 2943 6 2704 3073 6 2704 3148 6
2704 
# 2705
program languag natur languag and mathemat some social aspect of
program ar illumin through analog with similar aspect of mathemat
and natur languag the split between pure and appli mathemat
is found similarli in program the develop of natur languag
toward flexion less word order base languag type speak for
program languag design base on gener abstract construct by analog
with incid of the histori of artifici auxiliari languag it
is suggest that fortran and cobol will remain domin for
a long time to come the most promis avenu for
further work of wide influenc ar seen to be high
qualiti program literatur i e program of gener util and
studi of question relat to program style cacm decemb 1975
naur p analog relat to social aspect pure and appli
mathemat languag qualiti languag develop artifici auxiliari languag literatur style
descript and prescript attitud 4 20 ca751202 jb januari 6
1978 8 30 am 2705 4 2705 2705 4 2705
2984 4 2705 3101 4 2705 1908 5 2705 2705
5 2705 2705 5 2705 2705 5 2705 3185 5
2705 
# 2706
a note on the set basi problem relat to the
compact of charact set thi note discuss the reduct of
the set basi problem to the cliqu cover problem cacm
novemb 1975 kou l t wong c k compact of
charact set set basi set cover comput complex polynomi complet
cliqu cover 4 9 5 25 5 39 ca751106 jb
januari 6 1978 8 55 am 2706 4 2706 2643
5 2706 2706 5 2706 2706 5 2706 2706 5
2706 
# 2707
backtrack program techniqu the purpos of thi paper is twofold
first a brief exposit of the gener backtrack techniqu and
it histori is given second it is shown how the
us of macro can consider shorten the comput time in
mani case in particular thi techniqu ha allow the solut
of two previous open combinatori problem the comput of new
term in a well known seri and the substanti reduct
in comput time for the solut to anoth combinatori problem
cacm novemb 1975 bitner j r reingold e m backtrack
depth first search exhaust search macro combinatori comput non attack
queen s problem differ preserv code pentomino tile problem squar
the squar 5 30 ca751105 jb januari 6 1978 9
03 am 1531 4 2707 2707 4 2707 2753 4
2707 1185 5 2707 2707 5 2707 2707 5 2707
2707 5 2707 3053 5 2707 1329 6 2707 1785
6 2707 1973 6 2707 1992 6 2707 2107 6
2707 2109 6 2707 2412 6 2707 2543 6 2707
2673 6 2707 2707 6 2707 2770 6 2707 
# 2708
practic syntact error recoveri thi paper describ a recoveri scheme
for syntax error which provid automat gener high qualiti recoveri
with good diagnost inform at rel low cost previou recoveri
techniqu ar summar and empir comparison ar made suggest for
further research on thi topic conclud the paper cacm novemb
1975 graham s l rhode s p syntax error error
recoveri error correct pars simpl preced compil debug 4 12
4 42 5 23 ca751104 jb januari 6 1978 9
42 am 1225 4 2708 1350 4 2708 1379 4
2708 1542 4 2708 1646 4 2708 1683 4 2708
1693 4 2708 1693 4 2708 1781 4 2708 1781
4 2708 1781 4 2708 1781 4 2708 1787 4
2708 1836 4 2708 1836 4 2708 1945 4 2708
1945 4 2708 1945 4 2708 2015 4 2708 2060
4 2708 2060 4 2708 2061 4 2708 2061 4
2708 2082 4 2708 2091 4 2708 2091 4 2708
2152 4 2708 2179 4 2708 2179 4 2708 2340
4 2708 2356 4 2708 2534 4 2708 2534 4
2708 2546 4 2708 2546 4 2708 2556 4 2708
2603 4 2708 2650 4 2708 2650 4 2708 2698
4 2708 2698 4 2708 2698 4 2708 2698 4
2708 2708 4 2708 2708 4 2708 2708 4 2708
2708 4 2708 2708 4 2708 2708 4 2708 2708
4 2708 2820 4 2708 2824 4 2708 2887 4
2708 2971 4 2708 2982 4 2708 2986 4 2708
3045 4 2708 3045 4 2708 3045 4 2708 3093
4 2708 3093 4 2708 1477 5 2708 1491 5
2708 1787 5 2708 2111 5 2708 2534 5 2708
2556 5 2708 2708 5 2708 2708 5 2708 2708
5 2708 3093 5 2708 680 5 2708 1491 6
2708 2179 6 2708 2708 6 2708 680 6 2708
# 2709
a genealog of control structur the issu of program control
structur ha had a histori of heat controversi to put
thi issu on a solid foot thi paper review numer
theoret result on control structur and explor their practic implic
the classic result of bohm and jacopini on the theoret
complet of if then els and while do is discuss
sever recent idea on control structur ar then explor these
includ a review of variou other control structur result on
time space limit and theorem relat the rel power of
control structur under notion of equival in conclus the impact
of theoret result on the practic programm and the import
of on in on out control structur as oper abstract
ar discuss it is argu further that there is insuffici
evid to warrant more than if then els while do
and their variant cacm novemb 1975 ledgard h f marcotti
m structur program control structur goto statement languag design pascal
4 2 5 24 ca751103 jb januari 6 1978 9
53 am 2319 4 2709 2411 4 2709 2480 4
2709 2574 4 2709 2594 4 2709 2709 4 2709
2709 4 2709 2709 4 2709 2709 4 2709 2709
4 2709 2802 4 2709 2889 4 2709 2937 4
2709 2939 4 2709 2972 4 2709 2989 4 2709
3004 4 2709 3004 4 2709 3005 4 2709 3025
4 2709 3101 4 2709 3121 4 2709 3155 4
2709 1425 5 2709 2138 5 2709 2204 5 2709
2456 5 2709 2477 5 2709 2709 5 2709 2709
5 2709 2709 5 2709 2821 5 2709 3121 5
2709 1312 6 2709 308 6 2709 309 6 2709
2456 6 2709 2709 6 2709 2709 6 2709 
# 2710
specifi queri as relat express the squar data sublanguag thi
paper present a data sublanguag call squar intend for us
in ad hoc interact problem solv by non comput specialist
squar is base on the relat model of data and
is shown to be relation complet howev it avoid the
quantifi and bound variabl requir by languag base on the
relat calculu facil for queri insert delet and updat on
tabular data base ar describ a syntax is given and
suggest ar made for altern syntax includ a syntax base
on english kei word for user with limit mathemat background
cacm novemb 1975 boyc r f chamberlin d d king
w f iii databas data sublanguag relat queri languag casual
user relat data model tabular data interact problem solv nonprocedur
languag relat complet 3 50 3 70 4 20 ca751102
jb januari 6 1978 10 04 am 1135 4 2710
1136 4 2710 2046 4 2710 2155 4 2710 2406
4 2710 493 4 2710 2710 4 2710 2710 4
2710 2710 4 2710 2710 4 2710 2715 4 2710
2716 4 2710 2716 4 2710 2717 4 2710 2718
4 2710 2765 4 2710 2765 4 2710 2817 4
2710 2888 4 2710 2888 4 2710 2901 4 2710
2901 4 2710 2906 4 2710 2957 4 2710 2959
4 2710 2965 4 2710 3087 4 2710 3154 4
2710 729 4 2710 1515 5 2710 2046 5 2710
2710 5 2710 2710 5 2710 2710 5 2710 2715
5 2710 616 5 2710 
# 2711
a vector space model for automat index in a document
retriev or other pattern match environ where store entiti document
ar compar with each other or with incom pattern search
request it appear that the best index properti space is
on where each entiti li as far awai from the
other as possibl in these circumst the valu of an
index system mai be express as a function of the
densiti of the object space in particular retriev perform mai
correl invers with space densiti an approach base on space
densiti comput is us to choos an optimum index vocabulari
for a collect of document typic evalu result ar shown
demonstr the us of the model cacm novemb 1975 salton
g wong a yang c s automat inform retriev automat
index content analysi document space 3 71 3 73 3
74 3 75 ca751101 jb januari 6 1978 10 14
am 2711 5 2711 2711 5 2711 2711 5 2711
# 2712
horner s rule for the evalu of gener close queue
network the solut of separ close queue network requir the
evalu of homogen multinomi express the number of term in
those express grow combinatori with the size of the network
such that a direct summat mai becom impract an algorithm
is given which doe not show a combinatori oper count
the algorithm is base on a gener of horner s
rule for polynomi it is also shown how mean queue
size and throughput an be obtain at neglig extra cost
onc the normal constant is evalu cacm octob 1975 reiser
m kobayashi h queue network queue theori horner s rule
evalu of multinomi sum load depend servic rate 5 12
5 5 8 1 8 3 ca751007 jb januari 6
1978 10 35 am 2712 4 2712 2741 4 2712
3070 4 2712 2454 5 2712 2712 5 2712 2712
5 2712 2712 5 2712 
# 2713
remark on stabli updat mean and standard deviat of data
corrigendum cacm octob 1975 cotton i ca751006 jb januari 6
1978 10 38 am 2713 5 2713 2713 5 2713
2713 5 2713 
# 2714
merg with parallel processor consid two linearli order set a
b a m b n m n and p p
m parallel processor work synchron the paper present an algorithm
for merg a and b with the p parallel processor
which requir at most 2 log2 2m 1 3m p
m p log2 n m step if n 2 b
m b an integ the algorithm requir at most 2
log2 m 1 m p 2 b step in the
case where m and n ar of the same order
of magnitud i e n km with k be a
constant the algorithm requir 2 log2 m 1 m p
3 k step these perform compar veri favor with the
previou best parallel merg algorithm batcher s algorithm which requir
n p m n 2p log2 m step in the
gener case and km p k 1 2 m p
log2 m in the special case where n km cacm
octob 1975 gavril f parallel process parallel merg parallel binari
insert 5 31 ca751005 jb januari 6 1978 10 50
am 2714 4 2714 3075 4 2714 2664 5 2714
2714 5 2714 2714 5 2714 2714 5 2714 3075
5 2714 2289 6 2714 2557 6 2714 2664 6
2714 2714 6 2714 
# 2715
implement of a structur english queri languag the relat model
of data the xrm relat memori system and the sequel
languag have been cover in previou paper and ar review
sequel is a relat data sublanguag intend for the ad
hoc interact problem solv by non comput specialist a version
of sequel that ha been implement in a prototyp interpret
is describ the interpret is design to minim the data
access oper requir to respond to an arbitrari queri the
optim algorithm design for thi purpos ar describ cacm octob
1975 astrahan m m chamberlin d d relat model queri
languag nonprocedur languag databas data structur data organ 3 74
3 75 4 22 4 33 4 34 ca751004 jb
januari 6 1978 11 02 am 2155 4 2715 2406
4 2715 2710 4 2715 2715 4 2715 2716 4
2715 2717 4 2715 2718 4 2715 2765 4 2715
2817 4 2715 2888 4 2715 2901 4 2715 2957
4 2715 2959 4 2715 2965 4 2715 3087 4
2715 3154 4 2715 2046 5 2715 2710 5 2715
2715 5 2715 2715 5 2715 2715 5 2715 2716
5 2715 2901 5 2715 1515 6 2715 1976 6
2715 2046 6 2715 2046 6 2715 2046 6 2715
2715 6 2715 2715 6 2715 2715 6 2715 616
6 2715 
# 2716
optim the perform of a relat algebra databas interfac an
approach for implement a smart interfac to support a relat
view of data is propos the basic idea is to
emploi automat program techniqu so that the interfac analyz and
effici refin the high level queri specif suppli by the
user a relat algebra interfac call squiral which wa design
us thi approach is describ in detail squiral seek to
minim queri respons time and space util by 1 perform
global queri optim 2 exploit disjoint and pipelin concurr 3
coordin sort order in temporari relat 4 emploi directori analysi
and 5 maintain local in page refer algorithm for implement
the oper of e f codd s relat algebra ar
present and a methodolog for compos them to optim the
perform of a particular user queri is describ cacm octob
1975 smith j m yen tang chang p relat databas
databas optim invert file automat program queri languag data manipul
languag veri high level languag 3 70 4 13 4
33 ca751003 jb januari 6 1978 11 19 am 2155
4 2716 2406 4 2716 2710 4 2716 2710 4
2716 2715 4 2716 2716 4 2716 2716 4 2716
2717 4 2716 2718 4 2716 2765 4 2716 2817
4 2716 2888 4 2716 2901 4 2716 2901 4
2716 2957 4 2716 2959 4 2716 2965 4 2716
3087 4 2716 3154 4 2716 2046 5 2716 2715
5 2716 2716 5 2716 2716 5 2716 2716 5
2716 
# 2717
convert a high level translat definit languag for data convers
thi paper describ a high level and nonprocedur translat definit
languag convert which provid veri power and highli flexibl data
restructur capabl it design is base on the simpl underli
concept of a form which enabl the user to visual
the translat process and thu make data translat a much
simpler task convert ha been chosen for convei the purpos
of the languag and should not be confus with ani
other languag or program bear the same name cacm octob
1975 shu n c housel b c lum v y
data convers data restructur data translat databas reorgan translat definit
util program program languag nonprocedur languag 3 50 3 75
4 29 4 4 4 9 ca751002 jb januari 6
1978 1 45 pm 2155 4 2717 2406 4 2717
2710 4 2717 2715 4 2717 2716 4 2717 2717
4 2717 2717 4 2717 2718 4 2717 2765 4
2717 2817 4 2717 2888 4 2717 2901 4 2717
2957 4 2717 2959 4 2717 2965 4 2717 3087
4 2717 3154 4 2717 2046 5 2717 2406 5
2717 2717 5 2717 2717 5 2717 2717 5 2717
# 2718
a preliminari system for the design of dbtg data structur
the function approach to databas design is introduc in thi
approach the goal of design is to deriv a data
structur which is capabl of support a set of anticip
queri rather than a structur which model the busi in
some other wai an oper comput program is describ which
util the function approach to design data structur conform to
the data base task group specif the automat program technolog
util by thi program although typic us to gener procedur
is here us to gener declar cacm octob 1975 gerritsen
r network model of databas data base task group databas
design data structur automat program translat nonprocedur languag 3 5
3 64 3 7 4 2 5 23 ca751001 jb
januari 6 1978 2 02 pm 2155 4 2718 2406
4 2718 2710 4 2718 2715 4 2718 2716 4
2718 2717 4 2718 2718 4 2718 2765 4 2718
2817 4 2718 2888 4 2718 2901 4 2718 2957
4 2718 2959 4 2718 2965 4 2718 3087 4
2718 3154 4 2718 2046 5 2718 2718 5 2718
2718 5 2718 2718 5 2718 3147 5 2718 2718
6 2718 
# 2719
mechan program analysi on mean of analyz program perform is
by deriv close form express for their execut behavior thi
paper discuss the mechan of such analysi and describ a
system metric which is abl to analyz simpl lisp program
and produc for exampl close form express for their run
time express in term of size of input thi paper
present the reason for mechan program analysi describ the oper
of metric explain it implement and discuss it limit cacm
septemb 1975 wegbreit b analysi of program perform analysi execut
time execut behavior differ equat gener function list process lisp
algebra manipul program languag analysi of algorithm 3 69 4
22 5 24 5 25 ca750905 jb januari 6 1978
2 11 pm 1024 4 2719 1051 4 2719 1102
4 2719 1132 4 2719 1390 4 2719 1486 4
2719 1549 4 2719 1706 4 2719 1708 4 2719
1781 4 2719 1826 4 2719 1826 4 2719 1860
4 2719 1878 4 2719 378 4 2719 2060 4
2719 2155 4 2719 2156 4 2719 2168 4 2719
2168 4 2719 2164 4 2719 2170 4 2719 2249
4 2719 2314 4 2719 2323 4 2719 2657 4
2719 2719 4 2719 2719 4 2719 2719 4 2719
2719 4 2719 2719 4 2719 2719 4 2719 2719
4 2719 2723 4 2719 2736 4 2719 2833 4
2719 2838 4 2719 2842 4 2719 2855 4 2719
2879 4 2719 2967 4 2719 3077 4 2719 3080
4 2719 3094 4 2719 3106 4 2719 627 4
2719 106 4 2719 210 5 2719 1626 5 2719
2151 5 2719 2167 5 2719 2210 5 2719 2645
5 2719 2657 5 2719 2719 5 2719 2719 5
2719 2719 5 2719 
# 2720
optim balanc of i o request to disk determin a
polici for effici alloc and util of a set of
disk drive with differ oper characterist is examin us analyt
techniqu us standard queue theori each disk drive is character
by a queue model with servic time of a disk
drive repres by the probabl densiti function of the sum
of two uniform distribut total respons time of the set
of disk model is then minim under vari load condit
the result indic that faster devic should have higher util
factor and that the number of differ devic type util
tend to decreas with decreas load specif exampl us 2314
and 3330 combin ar examin cacm septemb 1975 piepmeier w
f disk drive hierarchi system evalu input output model queue
theori balanc schedul devic assign 2 44 4 35 5
15 5 5 6 35 8 1 8 3 ca750904
jb januari 6 1978 2 42 pm 2720 5 2720
2720 5 2720 2720 5 2720 
# 2721
the digit simul of river plankton popul dynam thi paper
deal with the develop of a mathemat model for and
the digit simul in fortran iv of phytoplankton and zooplankton
popul densiti in a river us previous develop rate express
in order to studi the relationship between the ecolog mechan
involv the simul paramet were vari illustr the respons of
the ecosystem to differ condit includ those correspond to certain
type of chemic and thermal pollut as an investig of
the accuraci of the simul method a simul of the
actual popul dynam of asterionella in the columbia river wa
made base on approxim of condit in that river although
not total accur the simul wa found to predict the
gener annual pattern of plankton growth fairli well and specif
reveal the import of the annual veloc cycl in determin
such pattern in addit the studi demonstr the us of
digit simul in the examin of certain aquat ecosystem as
well as in environment plan involv such examin cacm septemb
1975 claudson r m digit simul mathemat model plankton popul
dynam phytoplankton zooplankton river ecosystem ecolog mechan environment simul model
ecosystem pollut environment impact environment plan 3 12 3 19
ca750903 jb januari 6 1978 2 55 pm 2721 5
2721 2721 5 2721 2721 5 2721 
# 2722
multidimension binari search tree us for associ search thi paper
develop the multidimension binari search tree or k d tree
where k is the dimension of the search space as
a data structur for storag of inform to be retriev
by associ search the k d tree is defin and
exampl ar given it is shown to be quit in
it storag requir a signific advantag of thi structur is
that a singl data structur can handl mani type of
queri veri effici variou util algorithm ar develop their proven
averag run time in an n record file ar insert
o log n delet of the root o n k
1 k delet of a random node o log n
and optim guarante logarithm perform of search o n log
n search algorithm ar given for partial match queri with
t kei specifi proven maximum run time of o n
k t k and for nearest neighbor queri empir observ
averag run time of o log n these perform far
surpass the best current known algorithm for these task an
algorithm is present to handl ani gener intersect queri the
main focu of thi paper theoret it is felt howev
that k d tree could be quit us in mani
applic and exampl of potenti us ar given cacm septemb
1975 bentli j l associ retriev binari search tree kei
attribut inform retriev system nearest neighbor queri partial match queri
intersect queri binari tree insert 3 63 3 70 3
74 4 49 ca750902 jb januari 6 1978 3 22
pm 2722 5 2722 2722 5 2722 2722 5 2722
# 2723
multiprocess compactifi garbag collect algorithm for a multiprocess compactifi garbag
collector ar present and discuss the simpl case of two
processor on perform lisp like list oper and the other
perform garbag collect continu is thoroughli examin the necessari capabl
of each processor ar defin as well as interprocessor commun
and interlock complet procedur for garbag collect and for standard
list process primit ar present and thoroughli explain particular attent
is given to the problem of mark and reloc list
cell while anoth processor mai be oper on them the
primari aim throughout is to allow the list processor to
run unimped while the other processor reclaim list storag the
more complex case involv sever list processor and on or
more garbag collect processor ar also briefli discuss cacm septemb
1975 steel g l jr garbag collect storag reclam reclaim
storag alloc multiprocess synchron semaphor parallel process compactif reloc lisp
list process free storag pointer data structur gc processor 4
19 4 32 4 40 4 49 4 9 ca750901
jb januari 6 1978 3 39 pm 1024 4 2723
1024 4 2723 1050 4 2723 1051 4 2723 1051
4 2723 1098 4 2723 1102 4 2723 1132 4
2723 1214 4 2723 1380 4 2723 1388 4 2723
1390 4 2723 1393 4 2723 1485 4 2723 1486
4 2723 1487 4 2723 1549 4 2723 1549 4
2723 1549 4 2723 1570 4 2723 1706 4 2723
1826 4 2723 1828 4 2723 1854 4 2723 1869
4 2723 1877 4 2723 1878 4 2723 1878 4
2723 1946 4 2723 1957 4 2723 1960 4 2723
1972 4 2723 378 4 2723 2060 4 2723 2150
4 2723 2155 4 2723 2156 4 2723 2168 4
2723 2168 4 2723 2168 4 2723 2317 4 2723
2319 4 2723 2377 4 2723 2342 4 2723 2376
4 2723 2379 4 2723 2424 4 2723 2438 4
2723 2482 4 2723 2513 4 2723 2618 4 2723
2632 4 2723 2665 4 2723 2704 4 2723 2719
4 2723 2723 4 2723 2723 4 2723 2723 4
2723 2723 4 2723 2723 4 2723 2723 4 2723
2723 4 2723 2736 4 2723 2738 4 2723 2740
4 2723 2741 4 2723 2833 4 2723 2838 4
2723 2842 4 2723 2855 4 2723 2855 4 2723
2855 4 2723 2857 4 2723 2867 4 2723 2879
4 2723 2882 4 2723 2941 4 2723 2956 4
2723 3030 4 2723 3074 4 2723 3077 4 2723
3080 4 2723 3106 4 2723 3106 4 2723 3112
4 2723 3112 4 2723 3184 4 2723 627 4
2723 731 4 2723 793 4 2723 106 4 2723
210 5 2723 1549 5 2723 1749 5 2723 1826
5 2723 2651 5 2723 2723 5 2723 2723 5
2723 2723 5 2723 2838 5 2723 2896 5 2723
3039 5 2723 3074 5 2723 3112 5 2723 627
5 2723 731 5 2723 106 6 2723 1380 6
2723 1826 6 2723 1826 6 2723 210 6 2723
1834 6 2723 1853 6 2723 1972 6 2723 1972
6 2723 2438 6 2723 2723 6 2723 2723 6
2723 2723 6 2723 2723 6 2723 2723 6 2723
2732 6 2723 2732 6 2723 2736 6 2723 2833
6 2723 2838 6 2723 2896 6 2723 731 6
2723 
# 2724
the lemnisc constant corrigendum cacm august 1975 todd j ca750811
jb januari 6 1978 3 44 pm 2724 5 2724
2724 5 2724 2724 5 2724 
# 2725
a comparison of simul event list algorithm corrigendum cacm august
1975 vaucher j c duval p ca750810 jb januari 6
1978 3 43 pm 2725 5 2725 2725 5 2725
2725 5 2725 
# 2726
combin decis rule in a decis tabl the techniqu for
minim logic circuit ar appli to the simplif of decis
tabl by the combin of decis rule thi method is
logic equival to the quien mccluskei method for find prime
implic if some of the decis rule impli in the
els rule occur with low frequenc then the els rule
can be us to further simplifi the decis tabl sever
object merit consider in optim a decis tabl 1 reduc
machin execut time 2 reduc preprocess time 3 reduc requir
machin memori 4 reduc the number of decis rule thi
often improv the clariti of the decis tabl to a
human reader it will be shown that object 3 and
4 can be further with the abov method object 1
is also attain if overspecifi decis rule ar not combin
object 2 must be compar against the potenti benefit of
object 1 3 and 4 in decid whether to us
the abov method cacm august 1975 shwayder k the quin
mccluskei method prime implic minim maxim logic circuit boolean method
code decis tabl flowchart sort 3 5 3 74 4
12 5 31 5 6 ca750809 jb januari 6 1978
3 53 pm 1354 4 2726 1354 4 2726 1488
4 2726 1548 4 2726 1548 4 2726 1684 4
2726 2053 4 2726 2053 4 2726 2053 4 2726
2220 4 2726 2220 4 2726 2220 4 2726 2220
4 2726 2220 4 2726 2273 4 2726 2273 4
2726 2273 4 2726 2273 4 2726 2453 4 2726
2453 4 2726 2453 4 2726 2492 4 2726 2517
4 2726 2518 4 2726 2598 4 2726 2598 4
2726 2598 4 2726 2598 4 2726 2616 4 2726
2691 4 2726 2726 4 2726 2726 4 2726 2726
4 2726 2726 4 2726 2726 4 2726 2726 4
2726 2726 4 2726 2726 4 2726 2726 4 2726
2856 4 2726 2856 4 2726 2856 4 2726 2856
4 2726 3113 4 2726 3113 4 2726 1172 5
2726 1327 5 2726 1354 5 2726 1488 5 2726
1489 5 2726 1548 5 2726 2220 5 2726 2221
5 2726 2263 5 2726 2726 5 2726 2726 5
2726 2726 5 2726 
# 2727
multipl byte process with full word instruct a method is
describ which allow parallel process of pack data item us
onli ordinari full word comput instruct even though the process
requir oper whose execut is conting upon the valu of
a datum it provid a us techniqu for process small
data item such as alphanumer charact cacm august 1975 lamport
l byte process charact process pack data 4 9 ca750808
jb januari 6 1978 4 21 pm 2727 5 2727
2727 5 2727 2727 5 2727 2952 5 2727 142
6 2727 162 6 2727 163 6 2727 192 6
2727 2185 6 2727 2727 6 2727 
# 2728
consecut storag of relev record with redund thi paper studi
the properti of a new class of file organ crwr
where record relev to everi queri ar store in consecut
storag locat but the organ contain redund some theorem which
provid tool for reduc redund in crwr organ have been
also develop redund obtain by the applic of these theorem
ar compar with that of queri invert file organ some
crwr organ with minimum redund have also been develop for
queri which specifi set of kei cacm august 1975 ghosh
s p consecut retriev storag file record queri redund kei
3 70 3 73 3 74 ca750807 jb januari 6
1978 4 34 pm 2728 5 2728 2728 5 2728
2728 5 2728 
# 2729
comment on a paper by t c chen and i
t ho cacm august 1975 smith a j binari code
decim digit decim data storag data compress huffman code variabl
length code 6 32 6 34 ca750806 jb januari 6
1978 4 37 pm 2729 4 2729 2729 4 2729
2288 5 2729 2729 5 2729 2729 5 2729 2729
5 2729 2801 5 2729 
# 2730
interact consult via natur languag interact program system often contain
help command to give the programm on line instruct regard
the us of the variou system command it is argu
that it would be rel easi to make these help
command significantli more help by have them accept request in
natur languag as a demonstr weizenbaum s eliza program ha
been provid with a script that turn it into a
natur languag system consult cacm august 1975 sharo s c
kwasni s c interact program time share system natur languag
process comput assist instruct 3 32 3 42 3 79
4 49 ca750805 dmm januari 30 1978 4 13 pm
1400 4 2730 1553 4 2730 1945 4 2730 2127
4 2730 2396 4 2730 2730 4 2730 1487 5
2730 2730 5 2730 2730 5 2730 2730 5 2730
# 2731
remark on stabli updat mean and standard deviat of data
cacm august 1975 cotton i w mean standard deviat 5
5 5 19 ca750804 jb januari 6 1978 4 40
pm 2731 4 2731 3159 4 2731 3166 4 2731
3167 4 2731 2731 5 2731 2731 5 2731 2731
5 2731 2799 5 2731 3159 5 2731 3166 5
2731 3167 5 2731 1411 6 2731 2731 6 2731
2731 6 2731 2731 6 2731 2799 6 2731 2799
6 2731 2799 6 2731 3159 6 2731 3167 6
2731 3166 6 2731 
# 2732
guard command nondeterminaci and formal deriv of program so call
guard command ar introduc as a build block for altern
and repetit construct that allow nondeterminist program compon for which
at least the activ evok but possibl even the final
state is not necessarili uniqu determin by the initi state
for the formal deriv of program express in term of
these construct a calculu will be shown cacm august 1975
dijkstra e w program languag sequenc primit program semant program
languag semant nondeterminaci case construct repetit termin correct proof deriv
of program program methodolog 4 20 4 22 ca750803 jb
januari 6 1978 4 46 pm 249 4 2732 254
4 2732 272 4 2732 1102 4 2732 1109 4
2732 1140 4 2732 1188 4 2732 1306 4 2732
1464 4 2732 1491 4 2732 1767 4 2732 1781
4 2732 1787 4 2732 1949 4 2732 321 4
2732 2021 4 2732 2059 4 2732 2126 4 2732
2222 4 2732 2227 4 2732 2315 4 2732 2326
4 2732 2470 4 2732 435 4 2732 437 4
2732 463 4 2732 483 4 2732 491 4 2732
2732 4 2732 2732 4 2732 2865 4 2732 2896
4 2732 2943 4 2732 560 4 2732 583 4
2732 3014 4 2732 3068 4 2732 3073 4 2732
3077 4 2732 3143 4 2732 627 4 2732 631
4 2732 632 4 2732 642 4 2732 644 4
2732 653 4 2732 680 4 2732 761 4 2732
762 4 2732 763 4 2732 123 4 2732 140
4 2732 919 4 2732 989 4 2732 196 5
2732 1834 5 2732 2732 5 2732 2732 5 2732
2732 5 2732 2896 5 2732 2972 5 2732 3037
5 2732 3039 5 2732 3043 5 2732 3073 5
2732 196 6 2732 970 6 2732 1834 6 2732
2204 6 2732 2597 6 2732 2597 6 2732 2723
6 2732 2723 6 2732 2732 6 2732 2732 6
2732 2732 6 2732 2732 6 2732 2732 6 2732
2732 6 2732 2738 6 2732 2896 6 2732 2927
6 2732 799 6 2732 
# 2733
determinist pars of ambigu grammar method of describ the syntax
of program languag in wai that ar more flexibl and
natur than convent bnf descript ar consid these method involv
the us of ambigu context free grammar togeth with rule
to resolv syntact ambigu it is shown how effici lr
and ll parser can be construct directli from certain class
of these specif cacm august 1975 aho a v johnson
s c ullman j d program languag specif parser gener
translat write system syntax analysi lr pars ll pars ambigu
grammar 4 12 4 22 5 23 ca750802 jb januari
9 1978 9 28 am 1323 4 2733 1358 4
2733 1380 4 2733 1665 4 2733 1665 4 2733
1768 4 2733 1781 4 2733 1787 4 2733 1787
4 2733 1824 4 2733 1825 4 2733 1836 4
2733 1861 4 2733 1989 4 2733 2015 4 2733
2110 4 2733 2112 4 2733 2127 4 2733 2187
4 2733 2317 4 2733 2534 4 2733 2541 4
2733 2545 4 2733 2698 4 2733 2698 4 2733
2733 4 2733 2733 4 2733 2733 4 2733 2733
4 2733 2733 4 2733 2746 4 2733 2820 4
2733 2986 4 2733 3073 4 2733 3093 4 2733
3094 4 2733 3155 4 2733 1781 5 2733 2179
5 2733 2423 5 2733 2733 5 2733 2733 5
2733 2733 5 2733 2786 5 2733 799 5 2733
# 2734
on the extern storag fragment produc by first fit and
best fit alloc strategi publish comparison of the extern fragment
produc by first fit and best fit memori alloc have
not been consist through simul a seri of experi were
perform in order to obtain better data on the rel
perform of first fit and best fit and a better
understand of the reason underli observ differ the time memori
product effici of first fit and best fit were gener
within 1 to 3 percent of each other except for
small popul the size of the request popul had littl
effect on alloc effici for exponenti and hyperexponenti distribut of
request first fit outperform best fit but for normal and
uniform distribut and for exponenti distribut distort in variou wai
best fit outperform first fit it is hypothes that when
first fit outperform best fit it doe so becaus first
fit by preferenti alloc toward on end of memori encourag
larg block to grow at the other end suffici contigu
space is therebi more like to be avail for rel
larg request result of simul experi support thi hypothesi and
show that the rel perform of first fit and best
fit depend on the frequenc of request when the coeffici
of variat of the request distribut is greater than or
approxim equal to uniti first fit outperform best fit cacm
august 1975 shore j e storag fragment dynam memori alloc
first fit best fit 3 73 4 32 4 35
ca750801 jb januari 9 1978 9 41 am 2095 4
2734 2218 4 2734 2218 4 2734 2498 4 2734
2596 4 2734 2734 4 2734 2734 4 2734 2902
4 2734 2911 4 2734 3000 4 2734 3000 4
2734 1879 5 2734 2095 5 2734 2734 5 2734
2734 5 2734 2734 5 2734 2902 5 2734 2911
5 2734 2983 5 2734 1051 6 2734 1062 6
2734 1184 6 2734 1211 6 2734 1552 6 2734
1879 6 2734 1879 6 2734 273 6 2734 2435
6 2734 2435 6 2734 2498 6 2734 2596 6
2734 2734 6 2734 2734 6 2734 2734 6 2734
2747 6 2734 2768 6 2734 2773 6 2734 2983
6 2734 
# 2735
discrimin in the employ of women in the comput industri
cacm juli 1975 weber r e gilchrist b discrimin against
women salari employ programm system analysi keypunch oper machin oper
2 40 2 41 2 42 ca750707 jb januari 9
1978 9 55 am 2735 5 2735 2735 5 2735
2735 5 2735 2823 5 2735 2735 6 2735 
# 2736
a note on hash link cacm juli 1975 bobrow d
g hash search address space extens implicit pointer monitor condit
3 7 3 73 4 1 ca750706 jb januari 9
1978 9 59 am 1708 4 2736 1781 4 2736
1826 4 2736 1860 4 2736 1972 4 2736 1972
4 2736 2156 4 2736 2156 4 2736 2156 4
2736 2168 4 2736 2168 4 2736 2249 4 2736
2249 4 2736 2314 4 2736 2361 4 2736 2438
4 2736 2513 4 2736 2719 4 2736 2723 4
2736 2736 4 2736 2736 4 2736 2736 4 2736
2736 4 2736 2833 4 2736 2833 4 2736 2855
4 2736 2855 4 2736 3074 4 2736 3074 4
2736 3074 4 2736 3106 4 2736 3112 4 2736
3112 4 2736 1626 5 2736 1826 5 2736 1853
5 2736 1972 5 2736 2736 5 2736 2736 5
2736 2736 5 2736 2833 5 2736 2845 5 2736
3112 5 2736 106 6 2736 1184 6 2736 1380
6 2736 1626 6 2736 1826 6 2736 1826 6
2736 1972 6 2736 2435 6 2736 2438 6 2736
2598 6 2736 2723 6 2736 2736 6 2736 2736
6 2736 2736 6 2736 2747 6 2736 2768 6
2736 2833 6 2736 2838 6 2736 731 6 2736
# 2737
determin the minimum area encas rectangl for an arbitrari close
curv thi paper describ a method for find the rectangl
of minimum area in which a given arbitrari plane curv
can be contain the method is of interest in certain
pack and optimum layout problem it consist of first determin
the minim perimet convex polygon that enclos the given curv
and then select the rectangl of minimum area capabl of
contain thi polygon three theorem ar introduc to show that
on side of the minimum area rectangl must be colinear
with an edg of the enclos polygon and that the
minimum area encas rectangl for the convex polygon is also
the minimum area rectangl for the curv cacm juli 1975
freeman h shapira r enclos curv optimum layout optimum pack
minimum area encas rectangl 5 19 5 49 ca750705 jb
januari 9 1978 10 08 am 2737 5 2737 2737
5 2737 2737 5 2737 2997 5 2737 2737 6
2737 
# 2738
us of the concept of transpar in the design of
hierarch structur system thi paper deal with the design of
hierarch structur program system it develop a method for evalu
the cost of requir programm to work with an abstract
of a real machin a number of exampl from hardwar
and softwar ar given as illustr of the method cacm
juli 1975 parna d l siewiorek d p hierarch system
bottom up design level of abstract synchron primit 4 20
4 30 6 1 6 20 ca750704 dmm januari 31
1978 3 46 pm 1828 4 2738 1854 4 2738
1877 4 2738 1960 4 2738 2150 4 2738 2317
4 2738 2319 4 2738 2319 4 2738 2377 4
2738 2378 4 2738 2342 4 2738 2376 4 2738
2379 4 2738 2320 4 2738 2424 4 2738 2482
4 2738 2480 4 2738 2618 4 2738 2632 4
2738 2632 4 2738 2704 4 2738 2704 4 2738
2723 4 2738 2738 4 2738 2738 4 2738 2738
4 2738 2738 4 2738 2738 4 2738 2740 4
2738 2740 4 2738 2741 4 2738 2866 4 2738
2867 4 2738 2867 4 2738 2868 4 2738 2869
4 2738 2941 4 2738 2958 4 2738 3004 4
2738 3004 4 2738 3030 4 2738 3030 4 2738
3127 4 2738 3155 4 2738 3184 4 2738 1749
5 2738 2080 5 2738 2247 5 2738 2356 5
2738 2738 5 2738 2738 5 2738 2738 5 2738
2777 5 2738 2972 5 2738 970 6 2738 2204
6 2738 2597 6 2738 2732 6 2738 2738 6
2738 
# 2739
the restrict languag for comput grammar of natur languag over
the past few year a number of system for the
comput analysi of natur languag sentenc have been base on
augment context free grammar a context free grammar which defin
a set of pars tree for a sentenc plu a
group of restrict to which a tree must conform in
order to be a valid sentenc analysi as the coverag
of the grammar is increas an effici represent becom essenti
for further develop thi paper present a program languag design
specif for the compact and perspicu statement of restrict of
a natur languag grammar it is base on ten year
experi pars text sentenc with the comprehens english grammar of
the n linguist string project and embodi in it syntax
and routin the relat which were found to be us
and adequ for computer natur languag analysi the languag is
us in the current implement of the linguist string parser
cacm juli 1975 sager n grishman r natur languag pars
grammar program languag 3 42 3 79 4 22 ca750703
jb januari 9 1978 10 17 am 2581 4 2739
2739 4 2739 2795 4 2739 2921 4 2739 3087
4 2739 1989 5 2739 2739 5 2739 2739 5
2739 2739 5 2739 
# 2740
a larg semaphor base oper system the paper describ the
intern structur of a larg oper system as a set
of cooper sequenti process the process synchron by mean of
semaphor and extend semaphor queue semaphor the number of parallel
process is carefulli justifi and the variou semaphor construct ar
explain the system is prove to be free of deadli
embrac deadlock the design principl is an altern to dijkstra
s hierarch structur of oper system the project manag and
the perform ar discuss too the oper system is the
first larg on us the rc 4000 multiprogram system cacm
juli 1975 lauesen s cooper process oper system semaphor semaphor
applic queue semaphor deadlock deadli embrac hierarch structur multiprogram oper
system structur asynchron structur buffer parallel process synchron primit reentrant
code rc 4000 project manag time schedul debug project plan
project schedul reliabl program prove coroutin correct program mainten softwar
page 4 30 4 31 4 32 4 42 4
43 5 24 ca750702 jb januari 9 1978 10 32
am 1828 4 2740 1854 4 2740 1877 4 2740
1960 4 2740 2150 4 2740 2228 4 2740 2280
4 2740 2317 4 2740 2319 4 2740 2319 4
2740 2377 4 2740 2378 4 2740 2342 4 2740
2376 4 2740 2379 4 2740 2379 4 2740 2320
4 2740 2424 4 2740 2482 4 2740 2482 4
2740 2618 4 2740 2632 4 2740 2632 4 2740
2704 4 2740 2723 4 2740 2738 4 2740 2738
4 2740 2740 4 2740 2740 4 2740 2740 4
2740 2741 4 2740 2851 4 2740 2867 4 2740
2868 4 2740 2920 4 2740 3127 4 2740 3184
4 2740 1749 5 2740 1877 5 2740 2080 5
2740 2740 5 2740 2740 5 2740 2740 5 2740
# 2741
decompos instabl and satur in multiprogram system a step by
step approach to model the dynam behavior and evalu the
perform of comput system is propos it is base on
a techniqu of variabl aggreg and the concept of nearli
decompos system both borrow from econometr thi approach is taken
in order to identifi in multiprogram page system i unstabl
regim of oper and ii critic comput load which bring
the system into state of satur thi analysi lead to
a more complet definit of the circumst in which thrash
can set in cacm juli 1975 courtoi p j multiprogram
page perform evalu satur instabl thrash aggreg system level hierarchi
network of queue 4 31 4 32 8 1 8
2 ca750701 jb januari 9 1978 10 39 am 1828
4 2741 1854 4 2741 1877 4 2741 1892 4
2741 1960 4 2741 2068 4 2741 2150 4 2741
2317 4 2741 2319 4 2741 2377 4 2741 2342
4 2741 2376 4 2741 2379 4 2741 2424 4
2741 2482 4 2741 2618 4 2741 2632 4 2741
2704 4 2741 2712 4 2741 2723 4 2741 2738
4 2741 2740 4 2741 2741 4 2741 2741 4
2741 2741 4 2741 2867 4 2741 3070 4 2741
3184 4 2741 1526 5 2741 1749 5 2741 2454
5 2741 2741 5 2741 2741 5 2741 2741 5
2741 3016 5 2741 3070 5 2741 3153 5 2741
1805 6 2741 1901 6 2741 2454 6 2741 2741
6 2741 2741 6 2741 2741 6 2741 2891 6
2741 2988 6 2741 
# 2742
improv event scan mechan for discret event simul simul model
of larg complex real world applic have occasion earn the
reput of eat up hour of comput time thi problem
mai be attribut in part to difficulti such as slow
stochast converg howev an addit problem li in the fact
that a signific amount of bookkeep time is requir to
keep futur event in their proper sequenc thi paper present
a method for significantli reduc the time spent scan futur
event list in discret event simul there model ar present
all of which improv in effect as the event list
scan problem becom more burdensom cacm june 1975 wyman f
p discret event simul simul event scan mechan 4 34
5 5 8 1 ca750611 jb januari 9 1978 12
43 pm 2742 5 2742 2742 5 2742 2742 5
2742 2844 5 2742 2936 5 2742 3064 5 2742
970 6 2742 1059 6 2742 1846 6 2742 1939
6 2742 2742 6 2742 2742 6 2742 2742 6
2742 2767 6 2742 2767 6 2742 2767 6 2742
2936 6 2742 
# 2743
sort x y cacm june 1975 harper l h payn
t h savag j e strau e merg sort comput
complex data model comput model binari comparison 5 25 5
31 ca750610 jb januari 9 1978 12 45 pm 2743
5 2743 2743 5 2743 2743 5 2743 
# 2744
addit in an arbitrari base without radix convers thi paper
present a gener of an old program techniqu us it
on mai add and subtract number repres in ani radix
includ a mix radix and store on digit per byte
in byte of suffici size radix convers is unnecessari no
loop is requir and number mai even be store in
a displai i o format applic to cobol mix and
hexadecim sum ar discuss cacm june 1975 soul s addit
subtract decim arithmet arbitrari radix arithmet radix convers mix arithmet
cobol displai arithmet mix radix arithmet 4 49 4 9
5 9 ca750609 jb januari 9 1978 12 52 pm
2744 5 2744 2744 5 2744 2744 5 2744 
# 2745
a linear space algorithm for comput maxim common subsequ the
problem of find a longest common subsequ of two string
ha been solv in quadrat time and space an algorithm
is present which will solv thi problem in quadrat time
and in linear space cacm june 1975 hirschberg d s
subsequ longest common subsequ string correct edit 3 63 3
73 3 79 4 22 5 25 ca750608 jb januari
9 1978 12 56 pm 2745 5 2745 2745 5
2745 2745 5 2745 2963 5 2745 3114 5 2745
1502 6 2745 2499 6 2745 2745 6 2745 2745
6 2745 
# 2746
effici string match an aid to bibliograph search thi paper
describ a simpl effici algorithm to locat all occurr of
ani of a finit number of keyword in a string
of text the algorithm consist of construct a finit state
pattern match machin from the keyword and then us the
pattern match machin to process the text string in a
singl pass construct of the pattern match machin take time
proport to the sum of the length of the keyword
the number of state transit made by the pattern match
machin in process the text string is independ of the
number of keyword the algorithm ha been us to improv
the speed of a librari bibliograph search program by a
factor of 5 to 10 cacm june 1975 aho a
v corasick m j keyword and phrase string pattern match
bibliograph search inform retriev text edit finit state machin comput
complex 3 74 3 71 5 22 5 25 ca750607
jb januari 9 1978 1 03 pm 2532 4 2746
2545 4 2746 2631 4 2746 2733 4 2746 2746
4 2746 2746 4 2746 2746 4 2746 2746 4
2746 2746 4 2746 3001 4 2746 1665 5 2746
1739 5 2746 2139 5 2746 2545 5 2746 2746
5 2746 2746 5 2746 2746 5 2746 2786 5
2746 2916 5 2746 2746 6 2746 
# 2747
a simplifi recombin scheme for the fibonacci buddi system a
simplifi recombin scheme for the fibonacci buddi system which requir
neither tabl nor repetit calcul and us onli two addit
bit per buffer is present cacm june 1975 cranston b
thoma r fibonacci buddi system dynam storag alloc buddi system
3 89 4 32 4 39 ca750606 jb januari 9
1978 1 07 pm 2596 4 2747 2747 4 2747
2768 4 2747 2845 4 2747 2902 4 2747 2911
4 2747 2955 4 2747 2435 5 2747 2747 5
2747 2747 5 2747 2747 5 2747 2773 5 2747
2845 5 2747 2902 5 2747 2955 5 2747 1051
6 2747 1062 6 2747 1184 6 2747 1184 6
2747 1184 6 2747 1211 6 2747 1552 6 2747
1879 6 2747 2435 6 2747 2435 6 2747 2435
6 2747 2596 6 2747 2596 6 2747 2598 6
2747 2734 6 2747 2736 6 2747 2747 6 2747
2747 6 2747 2747 6 2747 2747 6 2747 2768
6 2747 2768 6 2747 2773 6 2747 
# 2748
indirect thread code an effici arrang for interpret code is
describ it is relat to bell s notion of thread
code but requir less space and is more amen to
machin independ implement cacm june 1975 dewar r b k
thread code snobol4 interpretor code gener 4 12 4 13
ca750605 jb januari 9 1978 1 11 pm 2748 4
2748 3144 4 2748 2491 5 2748 2748 5 2748
2748 5 2748 2748 5 2748 
# 2749
signific event simul thi paper compar a new method of
simul organ call the signific event method with an old
on call the clock puls method us as exampl two
automobil traffic model the signific event method is found to
be more effici than the clock puls method at low
level of system interact and less effici at high level
a simpl mathemat model for the trade off in the
rel run time of the two method is develop the
model aid in choos between the two simul method for
a particular experi it is conclud that the signific event
method can be of valu in the simul of some
system when comput effici is of suffici import cacm june
1975 babich a f grason j parna d l simul
organ event simul clock puls simul signific event simul 8
1 ca750604 jb januari 9 1978 1 20 pm 2749
5 2749 2749 5 2749 2749 5 2749 
# 2750
a cost orient algorithm for data set alloc in storag
hierarchi data set alloc in todai s multilevel storag system
is usual base on qualit ad hoc decis while it
would be desir to obtain an optim solut to thi
alloc problem it is clear that the number of paramet
involv make it intract to straight forward solut in such
a situat we must find a set of assumpt which
simplifi the problem greatli but which still provid a basi
for consid all signific cost element thi paper present such
a first quantit alloc step it consid mani of the
signific detail cost of system util data storag data stage
and data migrat although mani avenu of further improv ar
avail the present algorithm seem to be usefulli accur as
such it can aid in quantifi the problem of data
set alloc storag system configur and new devic design cacm
june 1975 lum v y senko m e wang c
p ling h data set alloc hierarch storag storag system
configur data stage data migrat storag alloc analysi 3 5
3 9 6 2 ca750603 jb januari 9 1978 1
31 pm 2750 5 2750 2750 5 2750 2750 5
2750 
# 2751
illumin for comput gener pictur the qualiti of comput gener
imag of three dimension scene depend on the shade techniqu
us to paint the object on the cathod rai tube
screen the shade algorithm itself depend in part on the
method for model the object which also determin the hidden
surfac algorithm the variou method of object model shade and
hidden surfac remov ar thu strongli interconnect sever shade techniqu
correspond to differ method of object model and the relat
hidden surfac algorithm ar present here human visual percept and
the fundament law of optic ar consid in the develop
of a shade rule that provid better qualiti and increas
realism in gener imag cacm june 1975 phong b t
comput graphic graphic displai hidden surfac remov 3 26 3
41 8 2 ca750602 jb januari 9 1978 1 46
pm 2751 5 2751 2751 5 2751 2751 5 2751
2816 5 2751 2827 5 2751 2828 5 2751 2913
5 2751 3047 5 2751 1751 6 2751 2004 6
2751 2493 6 2751 2751 6 2751 2751 6 2751
2751 6 2751 2751 6 2751 2751 6 2751 2771
6 2751 2829 6 2751 2829 6 2751 2841 6
2751 
# 2752
gener of all the cycl of a graph from a
set of basic cycl h algorithm 492 cacm june 1975
gibb n e basic cycl cycl graph 5 32 3
24 ca750601 jb januari 9 1978 1 55 pm 2752
5 2752 2752 5 2752 2752 5 2752 
# 2753
a heurist problem solv design system for equip or furnitur
layout the design problem solver dp demonstr that the comput
can perform simpl design task in particular it design furnitur
and equip layout thi task wa chosen becaus it is
simpl well defin and characterist of mani design task in
architectur engin urban plan and natur resourc manag these space
plan task usual involv manipul two dimension represent of object
to creat feasibl or optim solut for problem involv topolog
and metric spatial constraint the paper describ extens test perform
on the program dp is a heurist problem solver with
a plan phase prefix to it it us the plan
process to give it a sens of direct diagnost procedur
to locat difficulti and remedi action to recov from difficulti
it us a convex polygon represent to accur describ the
object and the layout thi represent allow topolog and metric
constraint to be test and the design to be easili
updat dp ha been appli to 50 problem while it
is slow and limit in scope the idea behind it
ar gener it demonstr the need for select in control
search and the method us to achiev it task specif
inform plan diagnost procedur remedi action and select altern gener
cacm mai 1975 pfefferkorn c e artifici intellig comput aid
design design synthesi diagnost search heurist plan problem solv represent
search strategi space plan spatial represent 3 20 3 25
3 64 3 66 ca750514 jb januari 9 1978 2
10 pm 1531 4 2753 2707 4 2753 2753 4
2753 1185 5 2753 2753 5 2753 2753 5 2753
2753 5 2753 
# 2754
a syntact algorithm for peak detect in waveform with applic
to cardiographi peak in a digit waveform ar detect by
an algorithm incorpor piecewis linear approxim and tabular pars techniqu
sever paramet serv to identifi the waveform context enabl accur
measur of peak amplitud durat and shape the algorithm is
of suffici speed to allow on line real time process
an exampl of it applic is demonstr on an electrocardiogram
cacm mai 1975 horowitz s l peak detect digit waveform
piecewis linear approxim context free grammar bottom up pars electrocardiogram
3 12 3 24 3 34 3 63 4 19
5 13 5 23 ca750513 jb januari 9 1978 2
18 pm 2754 5 2754 2754 5 2754 2754 5
2754 
# 2755
the new math of comput program corrigendum cacm mai 1975
mill h d ca750512 jb januari 9 1978 2 20
pm 2755 5 2755 2755 5 2755 2755 5 2755
# 2756
a problem list of public polici issu concern comput and
health care cacm mai 1975 wasserman a i econom and
social implic the public and comput medicin and health care
2 11 2 12 3 34 ca750511 jb januari 9
1978 2 22 pm 2756 4 2756 3076 4 2756
3179 4 2756 2607 5 2756 2756 5 2756 2756
5 2756 2756 5 2756 
# 2757
more on kth shortest path cacm mai 1975 fox b
network kth shortest path 5 32 ca750510 jb januari 9
1978 2 24 pm 2757 4 2757 2757 4 2757
2844 4 2757 2933 4 2757 1059 5 2757 2630
5 2757 2757 5 2757 2757 5 2757 2757 5
2757 2933 5 2757 2630 6 2757 2757 6 2757
# 2758
a note on the lu factor of a symmetr matrix
cacm mai 1975 evan d j hatzopoulo m symmetr matric
factor test matric matrix invers separ system 5 14 ca750509
jb januari 9 1978 2 26 pm 2758 5 2758
2758 5 2758 2758 5 2758 
# 2759
solut of an overdetermin system of equat in the l1
norm algorithm r478 cacm mai 1975 fritsch f n hindmarsh
a c ca750508 jb januari 9 1978 2 32 pm
2759 4 2759 2642 5 2759 2759 5 2759 2759
5 2759 2759 5 2759 
# 2760
visibl surfac plot program algorithm r475 cacm mai 1975 doran
c j ca750507 jb januari 9 1978 2 2 33
pm 2760 5 2760 2760 5 2760 2760 5 2760
# 2761
visibl surfac plot program algorithm r475 cacm mai 1975 mashburn
r g ca750506 jb januari 9 1978 2 35 pm
2761 5 2761 2761 5 2761 2761 5 2761 
# 2762
ten subroutin for the manipul of chebyshev seri algorithm r446
c446 cacm mai 1975 piessen r merten i ca750505 jb
januari 9 1978 2 37 pm 2762 4 2762 2521
5 2762 2762 5 2762 2762 5 2762 2762 5
2762 
# 2763
basic cycl gener h algorithm 491 cacm mai 1975 gibb
n e graph basic cycl fundament cycl span tree vertex
adjac matrix 5 32 3 24 ca750504 jb januari 9
1978 2 39 pm 1961 4 2763 2177 4 2763
2763 4 2763 1847 5 2763 2763 5 2763 2763
5 2763 2763 5 2763 
# 2764
an intellig analyz and understand of english the paper describ
a work analysi and gener program for natur languag which
handl paragraph length input it core is a system of
preferenti choic between deep semant pattern base on what we
call semant densiti the system is contrast 1 with syntax
orient linguist approach and 2 with theorem prove approach to
the understand problem cacm mai 1975 wilk y artifici intellig
comput linguist templat parapl stereotyp machin translat understand natur languag
process semant prefer semant densiti 3 36 3 42 3
63 ca750503 jb januari 9 1978 3 00 pm 2764
5 2764 2764 5 2764 2764 5 2764 
# 2765
analysi and perform of invert data base structur the need
to envis and architectur data base system in a hierarch
level by level framework is stress the invert data base
file organ is then analyz consid implement orient aspect the
invert directori is view realist as anoth larg data base
which itself is subject to invers formul ar deriv to
estim averag access time read onli and storag requir formal
the interact of data base content characterist logic complex of
queri and machin time and block specif identifi as have
a first order effect on perform the formul present ar
necessari to be us in conjunct with ani index select
criteria to determin the optimum set of index kei cacm
mai 1975 cardena a f data base architectur invert file
organ data base perform and measur secondari index organ inform
storag and retriev queri answer 3 70 3 71 3
72 3 74 3 79 4 0 ca750502 jb januari
9 1978 3 15 pm 1135 4 2765 1136 4
2765 2140 4 2765 2155 4 2765 2257 4 2765
2360 4 2765 2406 4 2765 2451 4 2765 2452
4 2765 2452 4 2765 2556 4 2765 493 4
2765 2710 4 2765 2710 4 2765 2715 4 2765
2716 4 2765 2717 4 2765 2718 4 2765 2765
4 2765 2765 4 2765 2765 4 2765 2765 4
2765 2765 4 2765 2765 4 2765 2817 4 2765
2882 4 2765 2888 4 2765 2888 4 2765 2901
4 2765 2901 4 2765 2906 4 2765 2957 4
2765 2959 4 2765 2965 4 2765 2965 4 2765
3087 4 2765 3134 4 2765 3154 4 2765 729
4 2765 1936 5 2765 1976 5 2765 2046 5
2765 2451 5 2765 2452 5 2765 2765 5 2765
2765 5 2765 2765 5 2765 2976 5 2765 616
5 2765 2688 6 2765 2765 6 2765 2882 6
2765 
# 2766
copi cyclic list structur in linear time us bound workspac
a bound workspac copi algorithm for arbitrari list structur is
given thi algorithm oper in linear time and doe not
requir tag bit the best previou bound workspac copi algorithm
achiev n 2 time without tag bit and n log
n time with on tag the onli restrict on the
algorithm given here is that the copi must be place
into a contigu section of memori the method is applic
to fix or variabl size node cacm mai 1975 fisher
d a list process copi linear time space complex 4
49 5 25 ca750501 jb januari 9 1978 3 22
pm 2766 4 2766 2954 4 2766 3106 4 2766
2665 5 2766 2766 5 2766 2766 5 2766 2766
5 2766 2855 5 2766 2954 5 2766 3106 5
2766 1549 6 2766 1549 6 2766 1826 6 2766
210 6 2766 210 6 2766 1972 6 2766 1972
6 2766 2513 6 2766 2665 6 2766 2665 6
2766 2766 6 2766 2766 6 2766 2766 6 2766
2833 6 2766 2855 6 2766 2954 6 2766 2998
6 2766 2998 6 2766 
# 2767
a comparison of simul event list algorithm four algorithm ar
consid which can be us to schedul event in a
gener purpos discret simul system two of the algorithm ar
new on is base on an end order tree structur
for event notic and anoth us an index linear list
the algorithm ar test with a set of typic stochast
schedul distribut especi chosen to show the advantag and limit
of the algorithm the end order tree algorithm is shown
to be an advantag immedi replac for the algorithm in
us with current simul languag the most promis algorithm us
the index list concept it will requir an adapt routin
befor it can be emploi in gener purpos simul but
it perform is such that further studi would be fruit
cacm april 1975 vaucher j g duval p simul time
flow mechan event list algorithm simul time flow mechan event
list algorithm simul execut event schedul routin discret system simul
sort 3 74 4 22 8 1 ca750410 jb januari
9 1978 3 43 pm 2767 4 2767 3064 4
2767 1939 5 2767 2767 5 2767 2767 5 2767
2767 5 2767 2844 5 2767 2936 5 2767 3051
5 2767 3064 5 2767 3109 5 2767 970 6
2767 1059 6 2767 1846 6 2767 1939 6 2767
2742 6 2767 2742 6 2767 2742 6 2767 2767
6 2767 2767 6 2767 2767 6 2767 2767 6
2767 2767 6 2767 2844 6 2767 2844 6 2767
2936 6 2767 
# 2768
an algorithm for locat adjac storag block in the buddi
system a simpl scheme for the determin of the locat
of a block of storag rel to other block is
describ thi scheme is applic to the buddi type storag
alloc system cacm april 1975 hind j a dynam storag
alloc buddi system gener fibonacci sequenc 3 89 4 32
4 39 ca750409 jb januari 9 1978 3 46 pm
1389 4 2768 1552 4 2768 2162 4 2768 2435
4 2768 2596 4 2768 2596 4 2768 2747 4
2768 2768 4 2768 2768 4 2768 2845 4 2768
2845 4 2768 2902 4 2768 2902 4 2768 2911
4 2768 2955 4 2768 2955 4 2768 1184 5
2768 2435 5 2768 2768 5 2768 2768 5 2768
2768 5 2768 2845 5 2768 2902 5 2768 1051
6 2768 1062 6 2768 1184 6 2768 1184 6
2768 1211 6 2768 1552 6 2768 1879 6 2768
2435 6 2768 2435 6 2768 2596 6 2768 2598
6 2768 2734 6 2768 2736 6 2768 2747 6
2768 2747 6 2768 2768 6 2768 2768 6 2768
# 2769
a modif of warshal s algorithm for the transit closur
of binari relat an algorithm is given for comput the
transit closur of a binari relat that is repres by
a boolean matrix the algorithm is similar to warshal s
although it execut faster for spars matric on most comput
particularli in a page environ cacm april 1975 warren h
s jr warshal s algorithm transit closur reachabl matrix direct
graph digraph boolean matrix binari relat 5 30 5 32
ca750408 jb januari 9 1978 3 49 pm 1151 4
2769 1265 4 2769 2769 4 2769 2769 5 2769
2769 5 2769 2769 5 2769 635 5 2769 
# 2770
the quadrat hash method when the tabl size is not
a prime number previou work on quadrat hash method is
limit mainli to the case where the tabl size is
a prime number here certain result ar deriv for composit
number it is shown that all composit number contain at
least the squar of on of the compon prime have
full period integ coeffici quadrat hash function cacm april 1975
batagelj v quadrat search hash code scatter storag tabl size
3 74 4 10 ca750407 jb januari 9 1978 3
54 pm 1860 4 2770 1973 4 2770 1973 4
2770 1992 4 2770 2018 4 2770 2018 4 2770
2033 4 2770 2060 4 2770 2107 4 2770 2109
4 2770 2203 4 2770 2203 4 2770 2251 4
2770 2251 4 2770 2251 4 2770 2251 4 2770
2534 4 2770 2543 4 2770 2543 4 2770 2543
4 2770 2559 4 2770 2573 4 2770 2573 4
2770 2704 4 2770 2770 4 2770 2770 4 2770
2770 4 2770 2770 4 2770 2770 4 2770 2770
4 2770 2770 4 2770 2974 4 2770 3053 4
2770 3053 4 2770 3053 4 2770 3053 4 2770
3083 4 2770 1786 5 2770 1869 5 2770 1973
5 2770 1992 5 2770 2018 5 2770 2109 5
2770 2673 5 2770 2770 5 2770 2770 5 2770
2770 5 2770 3053 5 2770 1329 6 2770 1785
6 2770 1973 6 2770 1992 6 2770 2107 6
2770 2109 6 2770 2412 6 2770 2543 6 2770
2673 6 2770 2707 6 2770 2770 6 2770 
# 2771
the synthesi of solid bound by mani face a techniqu
is present which allow a class of solid object to
be synthes and store us a comput synthesi begin with
primit solid like a cube wedg or cylind ani solid
can be move scale or rotat solid mai also be
ad togeth or subtract two algorithm to perform addit ar
describ for practic design the techniqu ha the advantag that
oper ar concis readili compos and ar given in term
of easili imagin solidsuit short sequenc of oper suffic to
build up complex solid bound by mani face cacm april
1975 braid i c comput geometri comput aid design graphic
machin compon polyhedra shape synthesi three dimension model 3 2
8 2 ca750406 jb januari 9 1978 3 59 pm
2771 5 2771 2771 5 2771 2771 5 2771 2827
5 2771 3116 5 2771 2751 6 2771 2771 6
2771 2771 6 2771 
# 2772
on mainten of the opportun list for class teacher timet
problem on of the princip compon of procedur for the
solut of class teacher timet problem is that for mainten
of the opportun list opportun list mainten method ar base
on necessari condit for the exist of a solut a
gener framework for necessari condit togeth with four specif set
of necessari condit is given cacm april 1975 smith g
combinatori necessari condit opportun list schedul school timet timet 3
51 5 39 ca750405 jb januari 9 1978 4 03
pm 1367 4 2772 2619 4 2772 2772 4 2772
2772 4 2772 2787 4 2772 2787 4 2772 1116
5 2772 1429 5 2772 2772 5 2772 2772 5
2772 2772 5 2772 
# 2773
a weight buddi method for dynam storag alloc corrigendum cacm
april 1975 shen k k peterson j l ca750404 jb
januari 9 1978 4 06 pm 2773 4 2773 2845
4 2773 2902 4 2773 2955 4 2773 2747 5
2773 2773 5 2773 2773 5 2773 2773 5 2773
2911 5 2773 2955 5 2773 1184 6 2773 1879
6 2773 273 6 2773 2435 6 2773 2435 6
2773 2498 6 2773 2596 6 2773 2734 6 2773
2747 6 2773 2773 6 2773 2773 6 2773 2983
6 2773 
# 2774
remark on algorithm 475 cacm april 1975 frederick l w
ca750403 jb januari 9 1978 4 07 pm 2774 5
2774 2774 5 2774 2774 5 2774 
# 2775
the dilogarithm function of a real argument s22 algorithm 490
cacm april 1975 ginsberg e s zaborowski d dilogarithm 5
12 ca750402 jb januari 9 1978 4 09 pm 2775
5 2775 2775 5 2775 2775 5 2775 
# 2776
comput network in higher educ socio econom polit factor thi
studi present the result of a nationwid survei of comput
network in higher educ conduct dure 1971 73 five major
and 18 minor network were identifi the five major network
includ the arpa net the california state colleg network the
univers of iowa iowa state univers network the michigan educ
research inform triad inc and the triangl univers comput center
network in north carolina in depth studi were conduct of
the latter two net base on the experi of these
oper network a number of factor ar identifi for consider
in develop network final recommend ar advanc regard the develop
of network in higher educ in the futur cacm april
1975 chamber j a poor r v network higher educ
1 3 2 45 ca750401 jb januari 9 1978 4
17 pm 2776 5 2776 2776 5 2776 2776 5
2776 
# 2777
on a solut to the cigarett smoker s problem without
condit statement thi report discuss a problem first introduc by
patil who ha claim that the cigarett smoker s problem
cannot be solv us the p and v oper introduc
by dijkstra unless condit statement ar us an examin of
patil s proof show that he ha establish thi claim
onli under strong restrict on the us of p and
v these restrict elimin program techniqu us by dijkstra and
other sinc the first introduct of the semaphor concept thi
paper contain a solut to the problem it also discuss
the need for the gener oper suggest by patil cacm
march 1975 parna d l oper system co oper process
process synchron primit 4 3 ca750311 jb januari 9 1978
4 24 pm 2320 4 2777 2597 4 2777 2777
4 2777 2851 4 2777 2895 4 2777 2912 4
2777 2946 4 2777 3128 4 2777 2150 5 2777
2738 5 2777 2777 5 2777 2777 5 2777 2777
5 2777 1749 6 2777 2080 6 2777 2247 6
2777 2356 6 2777 2777 6 2777 
# 2778
perturb of eigenvalu of non normal matric corrigendum cacm march
1975 slui a ca750310 jb januari 9 1978 4 26
pm 2778 5 2778 2778 5 2778 2778 5 2778
# 2779
discret least squar polynomi fit the recurr relat between orthogon
polynomi is wide us for discret least squar data fit
a variant of the classic algorithm which ha better numer
properti is present and the reason for it improv perform
is explain cacm march 1975 shampin l f orthogon polynomi
data fit least squar recurr relat between orthogon polynomi residu
5 11 5 13 ca750309 jb januari 9 1978 4
29 pm 2779 5 2779 2779 5 2779 2779 5
2779 
# 2780
on comput certain element of the invers of a spars
matrix a recurs algorithm for comput the invers of a
matrix from the lu factor base on relationship in takahashi
et al is examin the formula for the algorithm ar
given the depend relationship ar deriv the comput cost ar
develop and some gener comment on applic and stabil ar
made cacm march 1975 erisman e m tinnei w f
spars matric triangular factor element of invers tridiagon matrix sensit
3 24 5 14 ca750308 jb januari 9 1978 4
34 pm 2780 5 2780 2780 5 2780 2780 5
2780 
# 2781
the algorithm sequenti access method an altern to index sequenti
cacm march 1975 whitt j d sullenberg a g kei
direct access method sequenti access method random inform retriev 3
7 ca750307 jb januari 9 1978 4 37 pm 2258
4 2781 2319 4 2781 2313 4 2781 2359 4
2781 2437 4 2781 2552 4 2781 2781 4 2781
2860 4 2781 2991 4 2781 2203 5 2781 2781
5 2781 2781 5 2781 2781 5 2781 
# 2782
a repli to gentleman and marovich cacm march 1975 karp
r a high level languag philosophi of languag design 4
22 5 19 ca750306 jb januari 9 1978 4 38
pm 2782 5 2782 2782 5 2782 2782 5 2782
# 2783
the algorithm select for find the ith smallest of n
element m1 algorithm 489 cacm march 1975 floyd r w
rivest r l select median quantil 5 30 5 39
ca750305 jb januari 9 1978 4 43 pm 1919 4
2783 2191 4 2783 2227 4 2783 2388 4 2783
2783 4 2783 2783 4 2783 2784 4 2783 3054
4 2783 3054 4 2783 3121 4 2783 864 4
2783 307 5 2783 309 5 2783 2783 5 2783
2783 5 2783 2783 5 2783 2784 5 2783 1729
6 2783 309 6 2783 2783 6 2783 
# 2784
expect time bound for select a new select algorithm is
present which is shown to be veri effici on the
averag both theoret and practic the number of comparison us
to select the ith smallest of n number is n
min i n i o n a lower bound within
9 percent of the abov formula is also deriv cacm
march 1975 floyd r w rivest r l select comput
complex median tournament quantil 5 30 5 39 ca750304 jb
januari 9 1978 4 52 pm 1919 4 2784 2191
4 2784 2388 4 2784 2783 4 2784 2784 4
2784 2784 4 2784 2784 4 2784 3054 4 2784
3121 4 2784 864 4 2784 1729 5 2784 309
5 2784 2783 5 2784 2784 5 2784 2784 5
2784 2784 5 2784 2837 5 2784 2784 6 2784
2842 6 2784 
# 2785
glypnir a program languag for illiac iv glypnir is on
of the earliest exist languag design for program the illiac
iv comput the syntax of the languag is base on
algol 60 but ha been extend to allow the programm
explicitli to specifi the parallel of hi algorithm in term
of 64 word vector thi paper describ the characterist goal
and philosophi of the languag and discuss some of the
problem associ with parallel comput architectur cacm march 1975 lawri
d h layman t baer d randal j m glypnir
illiac iv program languag parallel comput parallel architectur 4 2
4 21 4 22 ca750303jb januari 9 1978 4 57
pm 2785 4 2785 2785 4 2785 2876 4 2785
2433 5 2785 2685 5 2785 2785 5 2785 2785
5 2785 2785 5 2785 
# 2786
a system for typeset mathemat thi paper describ the design
and implement of a system for typeset mathemat the languag
ha been design to be easi to learn and to
us by peopl for exampl secretari and mathemat typist who
know neither mathemat nor typeset experi indic that the languag
can be learn in an hour or so for it
ha few rule and fewer except for typic express the
size and font chang posit line draw and the like
necessari to print accord to mathemat convent ar all done
automat for exampl the input sum from i o to
infin x sub i pi over 2 produc formula the
syntax of the languag is specifi by a small context
free grammar a compil compil is us to make a
compil that translat thi languag into typeset command output mayb
produc on either a phototypesett or on a termin with
forward and revers half line motion the system interfac directli
with text format program so mixtur of text and mathemat
mai be handl simpli thi paper wa typeset by the
author us the system describ cacm march 1975 kernighan b
w cherri l l typeset photocomposit compil compil graphic print
text process 4 12 4 22 8 2 ca750302 jb
januari 10 1978 8 56 am 2626 4 2786 2786
4 2786 2840 4 2786 2919 4 2786 3017 4
2786 3110 4 2786 3174 4 2786 2629 5 2786
2733 5 2786 2746 5 2786 2786 5 2786 2786
5 2786 2786 5 2786 1665 6 2786 1739 6
2786 1781 6 2786 2139 6 2786 2179 6 2786
2423 6 2786 2545 6 2786 2786 6 2786 2786
6 2786 799 6 2786 
# 2787
matrix reduct an effici method the paper describ an effici
method for reduct of the binari matric which aris in
some school time tabl problem it is a develop of
that describ by john lion it ha been gener and
adapt to fit into the complet timet process to us
a more compact data represent and more effici process techniqu
to take fuller advantag of possibl avail previou knowledg about
the matrix and it is design as a structur program
which can readili be code by the reader in the
high level or low level program languag of hi choic
practic test of the method have shown it to be
a good basi for a realist timet algorithm cacm march
1975 johnston h c hoar c a r binari matric
matrix reduct tight set school timet construct structur program 3
51 4 9 5 39 ca750301 jb januari 10 1978
9 03 am 1367 4 2787 2619 4 2787 2772
4 2787 2772 4 2787 2787 4 2787 2787 4
2787 1116 5 2787 1429 5 2787 2787 5 2787
2787 5 2787 2787 5 2787 
# 2788
find circl by an arrai of accumul cacm februari 1975
kimm c balard d sklanski j pictur process pattern recognit
curv detect line fit 3 63 ca750211 jb januari 10
1978 9 15 am 2788 4 2788 2910 4 2788
2400 5 2788 2788 5 2788 2788 5 2788 2788
5 2788 2910 5 2788 2400 6 2788 2788 6
2788 
# 2789
a minim span tree cluster method algorithm r479 cacm februari
1975 magnuski h s ca750210 jb januari 12 1978 2
52 pm 2789 5 2789 2789 5 2789 2789 5
2789 
# 2790
the elementari circuit of a graph algorithm r459 cacm februari
1975 syslo m m ca750209 jb januari 12 1978 2
54 pm 2790 5 2790 2790 5 2790 2790 5
2790 
# 2791
exact probabl for r x c conting tabl algorithm r434
cacm februari 1975 hancock t w ca750208 jb januari 12
1978 2 55 pm 2791 5 2791 2791 5 2791
2791 5 2791 
# 2792
jacobi polynomi algorithm r332 cacm februari 1975 skovgaard o ca750207
jb januari 10 1978 9 32 am 2647 4 2792
2792 4 2792 2792 4 2792 2267 5 2792 2647
5 2792 2792 5 2792 2792 5 2792 2792 5
2792 
# 2793
chi squar quantil algorithm c451 cacm februari 1975 knight w
ca750206 jb januari 10 1978 9 40 am 2467 4
2793 2793 4 2793 1606 5 2793 2793 5 2793
2793 5 2793 2793 5 2793 
# 2794
state space problem reduct and theorem prove some relationship thi
paper suggest a bidirect relationship between state space and problem
reduct represent it present a formal base on multipl input
and multipl output oper which provid a basi for view
the two type of represent in thi manner a represent
of the languag recognit problem which is base on the
cock pars algorithm is us as an illustr a method
for repres problem in first order logic in such a
wai that the infer system emploi by a resolut base
theorem prover determin whether the set of claus is interpret
in the state spacer mode or in the problem reduct
mode is present the analog concept in problem reduct and
theorem prove and the terminolog us to refer to them
ar note the relationship between problem reduct input resolut and
linear resolut is discuss cacm februari 1975 vanderbrug g j
minker j artifici intellig state space represent problem reduct represent
theorem prove languag recognit 3 64 ca750205 jb januari 12
1978 8 27 am 2794 5 2794 2794 5 2794
2794 5 2794 
# 2795
sentenc paraphras from a conceptu base a model of natur
languag base on an underli languag free represent of mean
is describ a program base on thi model is abl
to produc sentenc paraphras which demonstr understand with respect to
a given context thi gener oper in conjunct with a
natur languag analyz and a combin memori and infer model
in gener sentenc from mean structur the program emploi both
the inform retriev and deduct capabl of the memori model
the model encompass sever divers class of linguist knowledg which
includ 1 execut test of conceptu properti store in discrimin
net 2 inform relat conceptu to syntact role store in
a word sens dictionari and 3 surfac grammat knowledg store
in a formal grammar cacm februari 1975 goldman n m
artifici intellig natur languag process languag gener model of cognit
process semant represent 3 42 3 60 3 65 ca750204
jb januari 12 1978 8 43 am 1885 4 2795
2581 4 2795 2739 4 2795 2795 4 2795 2795
4 2795 2795 4 2795 2921 4 2795 3087 4
2795 1928 5 2795 1989 5 2795 2274 5 2795
2795 5 2795 2795 5 2795 2795 5 2795 
# 2796
monitor an oper system structur concept corrigendum cacm februari 1975
hoar c a r ca750203 jb januari 12 1978 8
45 am 2796 5 2796 2796 5 2796 2796 5
2796 2866 5 2796 2356 6 2796 2597 6 2796
2796 6 2796 
# 2797
a first order approxim to the optim checkpoint interv corrigendum
cacm februari 1975 young j w ca750202 jb januari 12
1978 8 47 am 2797 5 2797 2797 5 2797
2797 5 2797 
# 2798
analysi of interleav memori system us blockag buffer a model
of interleav memori system is present and the analysi of
the model by mont carlo simul is discuss the simul
investig the perform of variou system structur i e scheme
for send instruct and data request to the memori system
perform is measur by determin the distribut of the number
of memori modul in oper dure a memori cycl an
import observ from these investig is that separ group instruct
and data request for memori can substanti increas the averag
number of memori modul in oper dure a memori cycl
result of the simul and an analyt studi ar displai
for variou system structur cacm februari 1975 burnett g j
coffman e g jr interleav memori system modular memori system
memori perform analysi blockag buffer conflict buffer simul mont carolo
simul 5 5 6 34 ca750201 jb januari 12 1978
8 54 am 2798 5 2798 2798 5 2798 2798
5 2798 3119 5 2798 2245 6 2798 2798 6
2798 2849 6 2798 2859 6 2798 
# 2799
stabli updat mean and standard deviat of data by consid
the sampl mean of a set of data as a
fit to thi data by a constant function a comput
method is given base on a matrix formul and given
transform the sampl mean and standard deviat can be updat
as data accumul the procedur is numer stabl and doe
not requir storag of the data method for deal with
weight data and data remov ar present when updat the
mean and squar of the standard deviat the process requir
no squar root cacm januari 1975 hanson r j mean
standard deviat least squar given transform updat estim remov data
5 5 5 19 ca750112 jb januari 12 1978 9
05 am 2731 5 2799 2799 5 2799 2799 5
2799 2799 5 2799 3159 5 2799 3166 5 2799
3167 5 2799 1411 6 2799 2731 6 2799 2731
6 2799 2731 6 2799 2799 6 2799 2799 6
2799 2799 6 2799 2799 6 2799 3159 6 2799
3167 6 2799 3166 6 2799 
# 2800
connect between accuraci and stabil properti of linear multistep formula
thi paper is concern with stabil and accuraci of famili
of linear k step formula depend on paramet with particular
emphasi on the numer solut of stiff ordinari differenti equat
an upper bound p k is deriv for the order
of accuraci of a inf stabl formula three criteria ar
given for a 0 stabil it is shown that 1
for p k k arbitrari a inf stabil impli certain
necessari condit for a 0 stabil and for strict stabil
mean that the extran root of p psi satisfi psi
1 2 for p k 2 3 4 and 5
a inf stabil for k 5 togeth with anoth constraint
impli strict stabil and 3 for certain on paramet class
of formula with p k 3 4 and or 5
a inf stabil impli a 0 stabil cacm januari 1975
linig w stiff equat parametr linear multistep formula order of
accuraci a 0 stabil a inf stabil strict stabil 5
17 ca750111 jb januari 12 1978 9 26 am 2800
5 2800 2800 5 2800 2800 5 2800 
# 2801
storag effici represent of decim data usual n decim digit
ar repres by 4n bit in comput actual two bcd
digit can be compress optim and revers into 7 bit
and three digit into 10 bit by a veri simpl
algorithm base on the fix length combin of two variabl
field length encod in over half of the case the
compress code result from the convent bcd code by simpl
remov of redund 0 bit a long decim messag can
be subdivid into three digit block and separ compress the
result differ from the asymptot minimum length by onli 0
34 percent the hardwar requir is small and the map
can be done manual cacm januari 1975 chi chen t
ho i t binari code decim digit decim data storag
6 32 6 34 ca750110 jb januari 12 1978 9
42 am 2729 5 2801 2801 5 2801 2801 5
2801 2801 5 2801 2288 6 2801 2801 6 2801
# 2802
the new math of comput program structur program ha prove
to be an import methodolog for systemat program design and
develop structur program ar identifi as compound function express in
the algebra of function the algebra properti of these function
express permit the reformul expans as well as reduct of
a nest subexpress independ of it environ thu model what
is known as stepwis program refin as well as program
execut final structur program is character in term of the
select and solut of certain elementari equat defin in the
algebra of function these solut can be given in gener
formula each involv a singl paramet which displai the entir
freedom avail in creat correct structur program cacm januari 1975
mill h d structur program algebra of function stepwis refin
program correct 4 6 5 21 5 24 ca750109 jb
januari 12 1978 9 50 am 2709 4 2802 2802
4 2802 3004 4 2802 1425 5 2802 2802 5
2802 2802 5 2802 2802 5 2802 
# 2803
pseudoinvers and conjug gradient thi paper is devot to the
studi of connect between pseudoinvers of matric and conjug gradient
and conjug direct routin cacm januari 1975 hesten m r
pseudoinvers conjug gradient hermitian matrix minim 5 14 ca750108 jb
januari 12 1978 10 08 am 2803 5 2803 2803
5 2803 2803 5 2803 
# 2804
elementari divisor of tensor product the elementari divisor of a
tensor product of linear transform have been known for 40
year thi paper provid a short easili access proof of
these result and point out an interest combinatori consequ of
the proof cacm januari 1975 marcu m robinson h elementari
divisor tensor product linear transform 5 14 ca750107 jb januari
12 1978 10 13 am 2804 5 2804 2804 5
2804 2804 5 2804 
# 2805
perturb of eigenvalu of non normal matric the problem consid
is to give bound for finit perturb of simpl and
multipl eigenvalu of nonnorm matric where these bound ar in
term of the eigenvalu the departur from normal and the
frobeniu norm of the perturb matrix but not in term
of the eigen system the bound which ar deriv ar
shown to be almost attain for ani set of matric
cacm januari 1975 van der slui a perturb of eigenvalu
non normal matric departur from normal gershgorin circl 5 14
ca750106 jb januari 12 1978 10 31 am 2805 5
2805 2805 5 2805 2805 5 2805 
# 2806
two hadamard number for matric a discuss is given of
two function of the entri of a squar matrix both
relat to hadamard s determin theorem which have some merit
as altern to norm bound condit number on for linear
system is known the other for eigen system seem to
be new cacm januari 1975 birkhoff g matric eigenvalu norm
condit number error analysi gram schmidt orthogon 5 11 5
14 ca750105 jb januari 12 1978 10 37 am 2806
5 2806 2806 5 2806 2806 5 2806 
# 2807
on the stabil of gauss jordan elimin with pivot the
stabil of the gauss jordan algorithm with partial pivot for
the solut of gener system of linear equat is commonli
regard as suspect it is shown that in mani respect
suspicion ar unfound and in gener the absolut error in
the solut is strictli compar with that correspond to gaussian
elimin with partial pivot plu back substitut howev when a
is ill condit the residu correspond to the gauss jordan
solut will often be much greater than that correspond to
the gaussian elimin solut cacm januari 1975 peter g wilkinson
j h gauss jordan algorithm gaussian elimin back substitut backward
error analysi bound for error in solut bound for residu
5 11 5 14 ca750104 jb januari 12 1978 10
44 am 2807 5 2807 2807 5 2807 2807 5
2807 
# 2808
the lemnisc constant the lemnisc constant and inde some of
the method us for actual comput them have plai an
enorm part in the develop of mathemat an account is
given here of some of the method us most of
the deriv can be made by elementari method thi materi
can be us for teach purpos and there is much
relev and interest histor materi the acceler method develop for
the purpos of evalu these constant ar us in other
problem cacm januari 1975 todd j lemnisc acceler ellipt function
euler transform 1 2 5 0 ca750103 jb januari 12
1978 10 51 am 2808 5 2808 2808 5 2808
2808 5 2808 
# 2809
posit and norm follow some line of joint work with
a s household the charact and us of algebra method
in the theori of norm is demonstr new result concern
norm with valu in an archimedian vector lattic not necessarili
be total order ar given in particular for the gener
of order unit norm l norm and m norm an
exampl of applic to oper norm is given concern contract
properti of posit oper cacm januari 1975 bauer f l
matric norm posit numer rang posit cone vector lattic absolut
monoton 5 11 5 14 ca750102 jb januari 12 1978
10 56 am 2809 5 2809 2809 5 2809 2809
5 2809 
# 2810
profession in the comput field the term profession mean differ
thing to differ peopl nevertheless there ar certain gener technic
and social standard normal associ with a profession further the
term is more gener appli to the practition rather than
to the research but within the rather broad definit specifi
the comput practition is as yet not regard as a
profession each of the four type of institut academ industri
govern and the profession societi that educ emploi regul and
mold the practition contribut to the nonprofession statu of the
comput practition the role of these institut ar examin variou
shortcom ar note and recommend chang ar suggest in the
last analysi profession statu is not bestow it is earn
howev univers and industri specif can make certain improv to
help the comput practition achiev profession statu cacm januari 1975
finerman a profession aspect educ program industri attitud profession societi
licens and certif 1 50 2 10 2 2 ca750101
jb januari 12 1978 11 05 am 2810 5 2810
2810 5 2810 2810 5 2810 
# 2811
structur pattern recognit of carotid puls wave us a gener
waveform pars system a gener waveform pars system with applic
to structur pattern recognit of carotid puls wave is describ
the carotid arteri puls wave is of medic import becaus
of variat in it structur induc by arteri ag and
cardiovascular diseas the syntax driven waveform analysi system ha been
appli with good result to these puls wave to detect
and measur structur variat the waveform pars system is model
on a compil compil system and allow the user to
enter applic specif inform as data it is thu gener
enough to be applic to other waveform cacm decemb 1976
stockman g kanal l kyle m c structur pattern recognit
pars waveform analysi puls wave 3 12 3 34 3
63 4 12 ca761204 jb januari 3 1978 1 43
pm 2811 5 2811 2811 5 2811 2811 5 2811
# 2812
comput aid analysi and design of inform system thi paper
describ the us of comput aid analysi for the design
and develop of an integr financi manag system by the
navi materi command support activ nmcsa comput aid analysi consist
of a set of procedur and comput program specif design
to aid in the process of applic softwar design comput
select and perform evalu there ar four major compon problem
statement languag problem statement analyz gener of altern design and
perform evalu the statement of requir wa written in ad
accur defin system and analyz by a problem statement analyz
for ad the ad problem definit wa supplement with addit
inform in order to creat a complet problem definit the
analyz problem statement wa translat to the form necessari for
us by the soda system optim and design algorithm program
for the gener of altern specif of program modul and
logic databas structur cacm decemb 1976 nunamak j f jr
konsynski b r jr ho t singer c comput aid
analysi inform system logic system design problem statement languag problem
statement analyz physic system design accur defin system system optim
and design algorithm 2 44 3 50 4 33 4
9 8 1 ca761203 jb januari 3 1978 2 31
pm 2812 5 2812 2812 5 2812 2812 5 2812
# 2813
the comput scienc and engin research studi coser the comput
scienc and engin research studi coser is briefli describ the
motiv organ and schedul for thi nsf support studi ar
given for possibl further refer the subject area panel chairmen
and the member of the steer committe ar identifi cacm
decemb 1976 arden b comput scienc research comput engin research
nation research studi 1 0 1 52 ca761202 jb januari
3 1978 2 35 pm 2813 5 2813 2813 5
2813 2813 5 2813 
# 2814
roster of program languag for 1974 75 cacm decemb 1976
sammet j e ca761201 jb januari 3 1978 2 38
pm 2814 5 2814 2814 5 2814 2814 5 2814
# 2815
high level bind with low level linker an easi to
implement scheme is describ by which a compil can enforc
agreement between complex data type in separ compil modul the
scheme is design to work with ani exist link editor
or link loader no matter how defici obscur run time
error caus by inconsist usag ar forestal by static error
detect at link time cacm novemb 1976 hamlet r g
separ compil bind link strong type 4 10 4 22
ca761108 jb januari 3 1978 2 44 pm 2815 5
2815 2815 5 2815 2815 5 2815 
# 2816
optim reorgan of distribut space disk file in most databas
organ the cost of access the databas will increas due
to structur chang caus by updat and insert by reorgan
the databas the access cost can be reduc a basic
problem is to establish the proper tradeoff between perform storag
cost and reorgan cost thi paper consid the optimum point
at which to reorgan a databas a disk file organ
which allow for distribut free space is describ a cost
function describ the excess cost due to physic disorgan is
defin and thi function is minim to obtain the optimum
reorgan point numer exampl base on the characterist of exist
disk storag devic ar given cacm novemb 1976 maruyama k
smith s e disk file free space retriev insert deterior
reorgan 3 70 3 73 ca761107 jb januari 3 1978
2 59 pm 2816 4 2816 2816 4 2816 2816
4 2816 2828 4 2816 2827 4 2816 2913 4
2816 3047 4 2816 3047 4 2816 3129 4 2816
2493 5 2816 2751 5 2816 2816 5 2816 2816
5 2816 2816 5 2816 2829 5 2816 3129 5
2816 2493 6 2816 2816 6 2816 
# 2817
the notion of consist and predic lock in a databas
system in databas system user access share data under the
assumpt that the data satisfi certain consist constraint thi paper
defin the concept of transact consist and schedul and show
that consist requir that a transact cannot request new lock
after releas a lock then it is argu that a
transact need to lock a logic rather than a physic
subset of the databas these subset mai be specifi by
predic an implement of predic lock which satisfi the consist
condit is suggest cacm novemb 1976 eswarran k grai j
lori r traiger i l consist lock databas concurr transact
4 32 4 33 ca761106 jb januari 3 1978 3
14 pm 2155 4 2817 2406 4 2817 2710 4
2817 2715 4 2817 2716 4 2817 2717 4 2817
2718 4 2817 2765 4 2817 2817 4 2817 2888
4 2817 2901 4 2817 2957 4 2817 2959 4
2817 2965 4 2817 3087 4 2817 3154 4 2817
2046 5 2817 2817 5 2817 2817 5 2817 2817
5 2817 3148 5 2817 1860 6 2817 2817 6
2817 2865 6 2817 2939 6 2817 3073 6 2817
# 2818
interfer in multiprocessor comput system with interleav memori corrigendum cacm
novemb 1976 baskett f smith a j ca761105 jb januari
3 1978 3 18 pm 2818 5 2818 2818 5
2818 2818 5 2818 
# 2819
experi in text file compress a system for the compress
of data file view as string of charact is present
the method is gener and appli equal well to english
to pl i or to digit data the system consist
of an encod an analysi program and a decod two
algorithm for encod a string differ slightli from earlier propos
the analysi program attempt to find an optim set of
code for repres substr of the file four new algorithm
for thi oper ar describ and compar variou paramet in
the algorithm ar optim to obtain a high degre of
compress for sampl text cacm novemb 1976 rubin f text
compress data file compact huffman code n gram encod comparison
of algorithm 3 7 3 73 4 33 ca761104 jb
januari 3 1978 3 26 pm 2530 4 2819 2623
4 2819 2819 4 2819 2537 5 2819 2819 5
2819 2819 5 2819 2819 5 2819 
# 2820
the design and implement of a tabl driven interact diagnost
program system cap is a highli interact diagnost compil interpret
that allow begin programm to prepar debug and execut fairli
simpl program at a graphic displai termin complet syntax check
and most semant analysi is perform as the program is
enter and as it is subsequ edit analysi is perform
charact by charact the most remark featur of cap is
it abil to automat diagnos error both at compil time
and at run time error ar not automat correct instead
cap interact with the student to help him find the
caus of hi error most compon of cap ar tabl
driven both to reduc the space need for implement and
to increas the flexibl of the multilingu system over 500
student have us cap to learn fortran pl i or
cobolin conjunct with a comput assist cours on introductori comput
scienc cacm novemb 1976 wilcox t r davi a m
tindal m h interact program tabl driven compil error correct
interpret debug comput assist instruct comput scienc educ 1 5
4 12 4 13 4 42 8 2 ca761103 jb
januari 3 1978 3 37 pm 1323 4 2820 1358
4 2820 1380 4 2820 1665 4 2820 1781 4
2820 1787 4 2820 1989 4 2820 2112 4 2820
2534 4 2820 2541 4 2820 2698 4 2820 2708
4 2820 2733 4 2820 2820 4 2820 2820 4
2820 2971 4 2820 3045 4 2820 3073 4 2820
3155 4 2820 2534 5 2820 2820 5 2820 2820
5 2820 2820 5 2820 799 5 2820 
# 2821
cobol under control a sampl set of cobol program standard
is offer these standard constrain code to be develop in
a structur form for both data and control structur thei
do not requir syntax beyond the exist cobol languag and
in fact util a typic limit subset of the 1974
an cobol standard these standard have prove extrem valuabl in
practic and have reduc the cost and time to produc
and maintain larg softwar system that have been deploi in
live multipl custom environ cacm novemb 1976 ledgard h f
cave w c cobol structur program softwar develop program standard
3 5 4 22 4 43 ca761102 jb januari 3
1978 3 43 pm 2821 4 2821 3121 4 2821
2709 5 2821 2821 5 2821 2821 5 2821 2821
5 2821 
# 2822
homili for humbl standard copyright 1976 associ for comput machineri
inc gener permiss to republish but not for profit all
or part of thi materi is grant provid that acm
s copyright notic is given and that refer is made
to the public to it data of issu and to
the fact that reprint privileg were grant by permiss of
the associ for comput machineri cacm novemb 1976 ross d
t standard case standard criteria for standard standard 1 3
2 1 2 3 ca761101 jb januari 3 1978 3
47 pm 2822 5 2822 2822 5 2822 2822 5
2822 
# 2823
the statu of women and minor in academ comput scienc
the result of a survei concern women and minor student
and faculti in comput scienc dure the year 1971 to
1975 ar present analysi of the data indic that effect
affirm action program for recruit into graduat degre program ar
need to enlarg the number of women and minor qualifi
for later employ in comput scienc also possibl discrimin in
employ of women and minor graduat student wa reveal cacm
octob 1976 montanelli r g jr mamrak s a discrimin
against women discrimin against minor graduat student undergradu student academ
employ faculti comput scienc degre program affirm action titl vii
titl ix 1 52 1 53 2 2 2 3
ca761008 jb januari 3 1978 4 10 pm 2823 4
2823 2735 5 2823 2823 5 2823 2823 5 2823
2823 5 2823 3022 5 2823 3123 5 2823 2823
6 2823 2823 6 2823 2861 6 2823 2962 6
2823 3022 6 2823 
# 2824
an improv to martin s algorithm for comput of linear
preced function cacm octob 1976 duong kien c hoffmann h
j muth d syntax analysi preced function boolean matric 4
12 ca761007 jb januari 3 1978 4 13 pm 1542
4 2824 1683 4 2824 1693 4 2824 1781 4
2824 1787 4 2824 1836 4 2824 1945 4 2824
2060 4 2824 2061 4 2824 2082 4 2824 2091
4 2824 2152 4 2824 2179 4 2824 2221 4
2824 2340 4 2824 2340 4 2824 2356 4 2824
2546 4 2824 2603 4 2824 2698 4 2824 2708
4 2824 2824 4 2824 2824 4 2824 2824 4
2824 2982 4 2824 2982 4 2824 2986 4 2824
2986 4 2824 2986 4 2824 3045 4 2824 3093
4 2824 1491 5 2824 1683 5 2824 2340 5
2824 2824 5 2824 2824 5 2824 2824 5 2824
# 2825
the bmd and bmdp seri of statist comput program cacm
octob 1976 frane j w analysi of varianc cluster analysi
conting tabl data analysi discrimin analysi factor analysi graphic outlier
regress time seri transform 1 3 3 3 4 0
5 5 ca761006 jb januari 3 1978 4 18 pm
2825 4 2825 2419 5 2825 2825 5 2825 2825
5 2825 2825 5 2825 
# 2826
interact skeleton techniqu for enhanc motion dynam in kei frame
anim a signific increas in the capabl for control motion
dynam in kei frame anim is achiev through skeleton control
thi techniqu allow an anim to develop a complex motion
sequenc by anim a stick figur represent of an imag
thi control sequenc is then us to drive an imag
sequenc through the same movement the simplic of the stick
figur imag encourag a high level of interact dure the
design stage it compat with the basic kei frame anim
techniqu permit skeleton control to be appli select to onli
those compon of a composit imag sequenc that requir enhanc
cacm octob 1976 burtnyk n wein m interact graphic comput
gener anim kei frame anim interact skeleton control stick figur
anim 3 41 3 49 4 9 8 2 ca761005
jb januari 3 1978 4 24 pm 2826 5 2826
2826 5 2826 2826 5 2826 
# 2827
a parametr algorithm for draw pictur of solid object compos
of quadric surfac an algorithm for draw pictur of three
dimension object with surfac made up of patch of quadric
surfac is describ the emphasi of thi algorithm is on
calcul the intersect of quadric surfac a parameter scheme is
us each quadric surfac intersect curv qsic is repres as
a set of coeffici and paramet limit each valu of
the paramet repres at most two point and these mai
easili be distinguish thi scheme can find the coordin of
point of even quartic fourth order intersect curv us equat
of no more than second order method of parameter for
each type of osic ar discuss as well as surfac
bound and hidden surfac remov cacm octob 1976 levin j
comput graphic hidden surfac remov quadric surfac intersect curv 3
41 5 12 5 13 5 19 8 2 ca761004
jb januari 3 1978 4 32 pm 2816 4 2827
2828 4 2827 2827 4 2827 2827 4 2827 2913
4 2827 3047 4 2827 3116 4 2827 2751 5
2827 2771 5 2827 2827 5 2827 2827 5 2827
2827 5 2827 
# 2828
hierarch geometr model for visibl surfac algorithm the geometr structur
inher in the definit of the shape of three dimension
object and environ is us not just to defin their
rel motion and placement but also to assist in solv
mani other problem of system for produc pictur by comput
by us an extens of tradit structur inform or a
geometr hierarchi five signific improv to current techniqu ar possibl
first the rang of complex of an environ is greatli
increas while the visibl complex of ani given scene is
kept within a fix upper limit second a meaning wai
is provid to vari the amount of detail present in
a scene third clip becom a veri fast logarithm search
for the resolv part of the environ within the field
of view fourth frame to frame coher and clip defin
a graphic work set or fraction of the total structur
that should be present in primari store for immedi access
by the visibl surfac algorithm final the geometr structur suggest
a recurs descent visibl surfac algorithm in which the comput
time potenti grow linearli with the visibl complex of the
scene cacm octob 1976 clark j h visibl surfac algorithm
hidden surfac algorithm hierarch data structur geometr model 5 31
8 2 ca761003 jb januari 3 1978 4 42 pm
1892 4 2828 1901 4 2828 2085 4 2828 2095
4 2828 2218 4 2828 2277 4 2828 2319 4
2828 2329 4 2828 2358 4 2828 2373 4 2828
2380 4 2828 2434 4 2828 2499 4 2828 2501
4 2828 2582 4 2828 2669 4 2828 2674 4
2828 2687 4 2828 2816 4 2828 2828 4 2828
2828 4 2828 2828 4 2828 2828 4 2828 2827
4 2828 2863 4 2828 2881 4 2828 2913 4
2828 2928 4 2828 2996 4 2828 3006 4 2828
3047 4 2828 3067 4 2828 1751 5 2828 2004
5 2828 2751 5 2828 2828 5 2828 2828 5
2828 2828 5 2828 2841 5 2828 
# 2829
textur and reflect in comput gener imag in 1974 catmul
develop a new algorithm for render imag of bivari surfac
patch thi paper describ extens of thi algorithm in the
area of textur simul and light model the parameter of
a patch defin a coordin system which is us as
a kei for map pattern onto the surfac the intens
of the pattern at each pictur element is comput as
a weight averag of region of the pattern definit function
the shape and size of thi weight function ar chosen
us digit signal process theori the patch render algorithm allow
accur comput of the surfac normal to the patch at
each pictur element permit the simul of the mirror reflect
the amount of light come from a given direct is
model in a similar manner to the textur map and
then ad to the intens obtain from the textur map
sever exampl of imag synthes us these new techniqu ar
includ cacm octob 1976 blinn j f newel m e
comput graphic graphic displai shade hidden surfac remov 3 41
5 12 5 15 8 2 ca761002 jb januari 4
1978 8 36 am 2816 5 2829 2829 5 2829
2829 5 2829 2829 5 2829 3047 5 2829 2493
6 2829 2751 6 2829 2751 6 2829 2829 6
2829 2829 6 2829 
# 2830
a practition s guid to address algorithm corrigendum cacm septemb
1976 sever d g duhn r a ca760909 jb januari
4 1978 8 43 am 2830 5 2830 2830 5
2830 2830 5 2830 
# 2831
analysi of the pff replac algorithm via a semi markov
model corrigendum cacm septemb 1976 chu w w opderbeck h
ca760908 dmm februari 1 1978 9 54 am 2831 5
2831 2831 5 2831 2831 5 2831 
# 2832
faster retriev from context tree corrigendum context tree provid a
conveni wai of store data which is to be view
as a hierarchi of context thi note present an algorithm
which improv on previou context tree retriev algorithm it is
base on the observ that in typic us context chang
ar infrequ rel to retriev so that data can be
cach to speed up retriev a retriev is start from
the posit of the previou retriev and auxiliari structur ar
built up to make the search rapid algorithm for addit
and delet of data and for garbag collect ar outlin
cacm septemb 1976 wegbreit b context tree frame problem variabl
bind data structur 3 69 3 74 4 10 ca760907
jb januari 4 1978 8 49 am 2832 5 2832
2832 5 2832 2832 5 2832 
# 2833
an effici increment automat garbag collector thi paper describ a
new wai of solv the storag reclam problem for a
system such as lisp that alloc storag automat from a
heap and doe not requir the programm to give ani
indic that particular item ar no longer us or access
a refer count scheme for reclaim non self referenti structur
and a linear compact copi scheme to reorgan all storag
at the user discret ar propos the algorithm ar design
to work well in system which us multipl level of
storag and larg virtual address space thei depend on the
fact that most cell ar referenc exactli onc and that
refer count need onli be accur when storag is about
to be reclaim a transact file store chang to refer
count and a multipl refer tabl store the count for
item which ar referenc more than onc cacm septemb 1976
deutsch l p bobrow d g storag manag garbag collect
lisp 4 19 ca760906 jb januari 4 1978 8 58
am 1708 4 2833 1781 4 2833 1826 4 2833
1860 4 2833 1972 4 2833 2156 4 2833 2156
4 2833 2168 4 2833 2168 4 2833 2249 4
2833 2314 4 2833 2438 4 2833 2719 4 2833
2723 4 2833 2736 4 2833 2736 4 2833 2833
4 2833 2833 4 2833 2833 4 2833 2845 4
2833 2855 4 2833 3074 4 2833 3112 4 2833
3112 4 2833 1626 5 2833 1826 5 2833 2736
5 2833 2833 5 2833 2833 5 2833 2833 5
2833 2855 5 2833 2944 5 2833 3112 5 2833
106 6 2833 1380 6 2833 1549 6 2833 1826
6 2833 1826 6 2833 210 6 2833 1972 6
2833 1972 6 2833 2438 6 2833 2513 6 2833
2723 6 2833 2736 6 2833 2766 6 2833 2833
6 2833 2833 6 2833 2833 6 2833 2838 6
2833 2998 6 2833 2998 6 2833 731 6 2833
# 2834
effici gener of the binari reflect grai code and it
applic algorithm ar present to gener the n bit binari
reflect grai code and codeword of fix weight in that
code both algorithm ar effici in that the time requir
to gener the next element from the current on is
constant applic to the gener of the combin of n
thing taken k at a time the composit of integ
and the permut of a multiset ar discuss cacm septemb
1976 bitner j r ehrlich g reingold e m grai
code combin subset composit combinatori comput 5 39 ca760905 jb
januari 4 1978 9 14 am 2466 4 2834 2834
4 2834 2834 4 2834 2834 4 2834 2834 4
2834 2884 4 2834 3115 4 2834 3115 4 2834
3115 4 2834 969 5 2834 2045 5 2834 2417
5 2834 2466 5 2834 2834 5 2834 2834 5
2834 2834 5 2834 
# 2835
recurs analysi for compil optim a rel simpl method for
the detect of recurs us of procedur is present for
us in compil optim implement consider ar discuss and a
modif of the algorithm is given to further improv optim
thi analysi can also be us to determin what possibl
subset of valu could be assum by variabl which can
onli take on a rel small discret set of valu
the most common ar paramet of variabl assum valu of
label procedur or pascal s enumer type cacm septemb 1976
walter k g recurs compil optim 4 12 ca760904 jb
januari 4 1978 9 36 am 2835 5 2835 2835
5 2835 2835 5 2835 
# 2836
weight deriv tree the node of a weight deriv tree
ar associ with weight function over the vocabulari of a
context free grammar an algorithm is present for construct the
optim deriv tree have the same structur as a given
weight deriv tree in addit the correct of the algorithm
is establish the method mai be appli to problem involv
probabilist pars or combinatori optim cacm septemb 1976 loui m
c deriv tree pars tree probabilist grammar structur ambigu combinatori
optim 5 23 5 49 ca760903 jb januari 4 1978
9 41 am 2836 5 2836 2836 5 2836 2836
5 2836 
# 2837
new upper bound for select the worst case minimum number
of comparison complex vi n of the i th select
problem is consid a new upper bound for vi n
improv the bound given by the standard hadian sobel algorithm
by a gener of the kirkpatrick hadian sobel algorithm and
extend kirkpatrick s method to a much wider rang of
applic thi gener compar favor with a recent algorithm by
hyafil cacm septemb 1976 yap c k select problem algorithm
comparison problem concret comput complex upper bound worst case analysi
5 25 5 31 ca760902 jb januari 4 1978 9
48 am 2837 4 2837 2837 4 2837 3150 4
2837 2784 5 2837 2837 5 2837 2837 5 2837
2837 5 2837 2842 5 2837 
# 2838
analysi of an algorithm for real time garbag collect a
real time garbag collect system avoid suspend the oper of
a list processor for the long time that garbag collect
normal requir by perform garbag collect on a second processor
in parallel with list process oper or on a singl
processor time share with them algorithm for recov discard list
structur in thi manner ar present and analyz to determin
suffici condit under which the list processor never need to
wait on the collector these techniqu ar shown to requir
at most twice as much process power as regular garbag
collector if thei ar us effici the averag behavior of
the program is shown to be veri nearli equal to
the worst case perform so that the suffici condit ar
also suitabl for measur the typic behavior of the algorithm
cacm septemb 1976 wadler p l garbag collect storag reclam
list process lisp time share multiprocess parallel process real time
data structur analysi of algorithm 3 69 3 89 4
19 4 29 4 32 4 34 4 9 5
25 ca760901 jb januari 4 1978 9 57 am 1024
4 2838 1051 4 2838 1102 4 2838 1132 4
2838 1390 4 2838 1486 4 2838 1549 4 2838
1706 4 2838 1826 4 2838 1878 4 2838 378
4 2838 2060 4 2838 2155 4 2838 2168 4
2838 2719 4 2838 2723 4 2838 2838 4 2838
2838 4 2838 2842 4 2838 2855 4 2838 2879
4 2838 2896 4 2838 3039 4 2838 3074 4
2838 3077 4 2838 3080 4 2838 3106 4 2838
3112 4 2838 627 4 2838 106 4 2838 210
5 2838 2723 5 2838 2838 5 2838 2838 5
2838 2838 5 2838 3112 5 2838 106 6 2838
1380 6 2838 1826 6 2838 1972 6 2838 2438
6 2838 2723 6 2838 2736 6 2838 2833 6
2838 2838 6 2838 731 6 2838 
# 2839
an insert techniqu for on side height balanc tree a
restrict on height balanc binari tree is present it is
seen that thi restrict reduc the extra memori requir by
half from two extra bit per node to on and
maintain fast search capabl at a cost of increas time
requir for insert new node cacm august 1976 hirschberg d
s balanc binari search tree 3 73 3 74 4
34 5 25 5 31 ca760805 jb januari 4 1978
10 04 am 2839 4 2839 3042 4 2839 3096
4 2839 3163 4 2839 2839 5 2839 2839 5
2839 2839 5 2839 2889 5 2839 3009 5 2839
3042 5 2839 3065 5 2839 3096 5 2839 3163
5 2839 2455 6 2839 2839 6 2839 2839 6
2839 2839 6 2839 2839 6 2839 2839 6 2839
2889 6 2839 2889 6 2839 2889 6 2839 2968
6 2839 3009 6 2839 3009 6 2839 3065 6
2839 3096 6 2839 3096 6 2839 
# 2840
protect in oper system a model of protect mechan in
comput system is present and it appropri is argu the
safeti problem for protect system under thi model is to
determin in a given situat whether a subject can acquir
a particular right to an object in restrict case it
can be shown that thi problem is decid i e
there is an algorithm to determin whether a system in
a particular configur is safe in gener and under surprisingli
weak assumpt it cannot be decid if a situat is
safe variou implic of thi fact ar discuss cacm august
1976 harrison m a ruzzo w l ullman j d
protect protect system oper system decid ture machin 4 30
4 31 5 24 ca760804 jb januari 4 1978 10
12 am 1458 4 2840 1523 4 2840 1603 4
2840 1698 4 2840 1747 4 2840 1748 4 2840
1753 4 2840 1854 4 2840 1877 4 2840 1960
4 2840 2358 4 2840 2377 4 2840 2377 4
2840 2378 4 2840 2372 4 2840 2497 4 2840
2558 4 2840 2625 4 2840 2626 4 2840 2626
4 2840 2632 4 2840 2786 4 2840 2840 4
2840 2840 4 2840 2840 4 2840 2840 4 2840
2840 4 2840 2869 4 2840 2919 4 2840 2941
4 2840 3017 4 2840 3105 4 2840 3110 4
2840 3128 4 2840 3144 4 2840 3158 4 2840
3174 4 2840 1471 5 2840 1746 5 2840 2436
5 2840 2626 5 2840 2629 5 2840 2840 5
2840 2840 5 2840 2840 5 2840 3076 5 2840
2607 6 2840 2840 6 2840 
# 2841
design surfac in 3 d an experiment system for comput
aid design of free form surfac in three dimens is
describ the surfac ar repres in the system as parametr
basi spline the princip featur of the system ar 1
the surfac ar render as isoparametr line draw on a
head mount displai and thei ar design with the aid
of a three dimension wand which allow 3 d movement
of the point control the shape of the surfac 2
all of the interact with the surfac ar in real
time and 3 the mathemat formul us assum no knowledg
of them by the user of the system also examin
ar some of the featur that should be part of
a practic 3 d system for design space form cacm
august 1976 clark j h real time graphic comput aid
design pictur process b spline 3 d displai 3 80
6 22 8 2 ca760803 jb januari 4 1978 10
25 am 2828 5 2841 2841 5 2841 2841 5
2841 2841 5 2841 1751 6 2841 2004 6 2841
2751 6 2841 2841 6 2841 
# 2842
the denot semant of program languag thi paper is a
tutori introduct to the theori of program languag semant develop
by d scott and c strachei the applic of the
theori to formal languag specif is demonstr and other applic
ar survei the first languag consid loop is veri elementari
and it definit mere introduc the notat and methodolog of
the approach then the semant concept of environ store and
continu ar introduc to model class of program languag featur
and the underli mathemat theori of comput due to scott
is motiv and outlin final the paper present a formal
definit of the languag gedanken cacm august 1976 tennent r
d semant program languag applic imper environ store continu theori
of comput higher order function recurs definit loop gedanken 4
22 5 24 ca760802 jb januari 4 1978 10 33
am 1024 4 2842 1051 4 2842 1086 4 2842
1102 4 2842 1132 4 2842 1132 4 2842 1234
4 2842 1263 4 2842 1265 4 2842 1270 4
2842 1323 4 2842 1358 4 2842 1379 4 2842
1380 4 2842 1390 4 2842 1453 4 2842 1464
4 2842 1484 4 2842 1486 4 2842 1491 4
2842 1498 4 2842 1549 4 2842 1613 4 2842
1614 4 2842 1706 4 2842 1781 4 2842 1825
4 2842 1826 4 2842 1860 4 2842 1878 4
2842 378 4 2842 2060 4 2842 2083 4 2842
2155 4 2842 2155 4 2842 2168 4 2842 2178
4 2842 2179 4 2842 2252 4 2842 2294 4
2842 2314 4 2842 2317 4 2842 2325 4 2842
2326 4 2842 2341 4 2842 2457 4 2842 2546
4 2842 2558 4 2842 2645 4 2842 2652 4
2842 2684 4 2842 2719 4 2842 2723 4 2842
2838 4 2842 2842 4 2842 2842 4 2842 2842
4 2842 2842 4 2842 2842 4 2842 2855 4
2842 2879 4 2842 2903 4 2842 2929 4 2842
2934 4 2842 3069 4 2842 3077 4 2842 3077
4 2842 3080 4 2842 3106 4 2842 3150 4
2842 627 4 2842 669 4 2842 679 4 2842
691 4 2842 761 4 2842 106 4 2842 949
4 2842 989 4 2842 210 5 2842 2060 5
2842 2148 5 2842 2192 5 2842 2837 5 2842
2842 5 2842 2842 5 2842 2842 5 2842 3150
5 2842 3184 5 2842 2060 6 2842 2704 6
2842 2784 6 2842 2842 6 2842 2842 6 2842
2939 6 2842 2940 6 2842 2941 6 2842 2943
6 2842 3073 6 2842 3148 6 2842 
# 2843
tool and philosophi for softwar educ thi paper describ a
set of tool and a philosophi for teach softwar that
have been found veri us in cours at mit over
the past seven year the tool includ program such as
simul grader compil and monitor these allow the instructor to
augment the basic concept with relev excit and econom student
project activ cacm august 1976 donovan j j softwar educ
simul grade program student assign 1 5 4 0 ca760801
jb januari 4 1978 10 39 am 2843 5 2843
2843 5 2843 2843 5 2843 
# 2844
heap appli to event driven mechan cacm juli 1976 gonnet
g h discret event simul event scan mechan prioriti queue
heap 4 34 8 1 ca760709 jb januari 4 1978
11 05 am 2042 4 2844 2222 4 2844 2356
4 2844 2679 4 2844 2757 4 2844 2844 4
2844 2844 4 2844 2844 4 2844 2844 4 2844
2936 4 2844 2936 4 2844 2972 4 2844 3051
4 2844 3064 4 2844 3064 4 2844 3109 4
2844 970 5 2844 1059 5 2844 2742 5 2844
2767 5 2844 2844 5 2844 2844 5 2844 2844
5 2844 3051 5 2844 3109 5 2844 2767 6
2844 2767 6 2844 2844 6 2844 2844 6 2844
# 2845
a buddi system variat for disk storag alloc a gener
of the buddi system for storag alloc is describ the
set of permit block size size i i 0 n
must satisfi the condit size i size i 1 size
i k i where k mai be ani meaning integr
valu function thi make it possibl to forc logic storag
block to coincid with physic storag block such as track
and cylind cacm juli 1976 burton w buddi system dynam
storag alloc 3 89 4 32 4 39 ca760708 jb
januari 4 1978 11 24 am 1389 4 2845 1552
4 2845 2162 4 2845 2435 4 2845 2596 4
2845 2596 4 2845 2747 4 2845 2768 4 2845
2768 4 2845 2773 4 2845 2833 4 2845 2845
4 2845 2845 4 2845 2845 4 2845 2845 4
2845 2845 4 2845 2845 4 2845 2856 4 2845
2902 4 2845 2902 4 2845 2902 4 2845 2902
4 2845 2911 4 2845 2955 4 2845 2955 4
2845 2955 4 2845 3112 4 2845 3113 4 2845
1184 5 2845 2435 5 2845 2598 5 2845 2736
5 2845 2747 5 2845 2768 5 2845 2845 5
2845 2845 5 2845 2845 5 2845 
# 2846
compress tri thi paper present a new data structur call
a compress trie or c trie to be us in
inform retriev system it ha the same underli m ari
tree structur as a trie where m is a paramet
of the trie but wherea the field of the node
in a trie have to be larg enough to hold
a kei or at least a pointer the field in
a c trie ar onli on bit long in the
analysi part of the paper it will be shown that
for a collect of n kei the retriev time measur
in term of bit inspect of on kei is of
the order logm n and the storag requir of the
order n m log2 n bit thi improv in storag
requir and retriev time is achiev at the cost of
decreas the flexibl of the structur and therefor updat cost
ar increas first the c trie is analyz as a
data structur and then sever method of it us for
rel static databas ar discuss cacm juli 1976 mali k
data structur databas m ari tree trie retriev time storag
requir kei 3 70 3 74 3 75 ca760707 jb
januari 4 1978 12 26 pm 2846 4 2846 849
4 2846 944 4 2846 155 5 2846 2846 5
2846 2846 5 2846 2846 5 2846 3041 5 2846
2846 6 2846 2905 6 2846 
# 2847
sampl from the gamma distribut on a comput thi paper
describ a method of gener gamma variat that appear to
be less costli than wallac s recent suggest method for
larg shape paramet a the cost of comput is proport
to a wherea wallac s method is proport to a
experiment by robinson and lewi indic that for small a
the method suggest here also domin method recent suggest by
dieter and ahren albeit those method domin for larg a
the method suggest here us the reject techniqu cacm juli
1976 fishman g s gamma variat reflect method sampl 5
5 8 1 8 3 ca760706 jb januari 4 1978
12 34 pm 2847 4 2847 2928 4 2847 3046
4 2847 3098 4 2847 3107 4 2847 2569 5
2847 2847 5 2847 2847 5 2847 2847 5 2847
3046 5 2847 3098 5 2847 2569 6 2847 2569
6 2847 2847 6 2847 2847 6 2847 3098 6
2847 
# 2848
synthesi of decis rule decis tabl can be us as
an effect tool dure an interview to record the logic
of process to be autom the result of such an
interview is not a structur of complet decis tabl but
rather set of decis rule the purpos of thi paper
is to provid a procedur for synthes the decis rule
and thu provid an aid in develop a structur of
complet decis tabl cacm juli 1976 cheng c rabin j
decis rule decis tabl logic tabl logic design system design
specif languag 3 50 4 33 ca760705 jb januari 4
1978 12 39 pm 2848 5 2848 2848 5 2848
2848 5 2848 
# 2849
ethernet distribut packet switch for local comput network ethernet is
a branch broadcast commun system for carri digit data packet
among local distribut comput station the packet transport mechan provid
by ethernet ha been us to build system which can
be view as either local comput network or loos coupl
multiprocessor an ethernet s share commun facil it ether is
a passiv broadcast medium with no central control coordin of
access to the ether for packet broadcast is distribut among
the contend transmit station us control statist arbitr switch of
packet to their destin on the ether is distribut among
the receiv station us packet address recognit design principl and
implement ar describ base on experi with an oper ethernet
of 100 node along a kilomet of coaxial cabl a
model for estim perform under heavi load and a packet
protocol for error control commun ar includ for complet cacm
juli 1976 metcalf r m bogg d r comput network
packet switch multiprocess distribut control distribut comput broadcast commun statist
arbitr 3 81 4 32 6 35 ca760704 jb januari
4 1978 12 49 pm 2849 4 2849 2371 5
2849 2849 5 2849 2849 5 2849 2849 5 2849
3032 5 2849 3119 5 2849 2245 6 2849 2798
6 2849 2849 6 2849 2849 6 2849 2859 6
2849 
# 2850
symbol execut and program test thi paper describ the symbol
execut of program instead of suppli the normal input to
a program e g number on suppli symbol repres arbitrari
valu the execut proce as in a normal execut except
that valu mai be symbol formula over the input symbol
the difficult yet interest issu aris dure the symbol execut
of condit branch type statement a particular system call effigi
which provid symbol execut for program test and debug is
also describ it interpret execut program written in a simpl
pl i style program languag it includ mani standard debug
featur the abil to manag and to prove thing about
symbol express a simpl program test manag and a program
verifi a brief discuss of the relationship between symbol execut
and program prove is also includ cacm juli 1976 king
j c symbol execut program test program debug program prove
program verif symbol interpret 4 13 5 21 5 24
ca760703 jb januari 4 1978 12 59 pm 2850 5
2850 2850 5 2850 2850 5 2850 3080 5 2850
210 6 2850 2850 6 2850 
# 2851
formal verif of parallel program two formal model for parallel
comput ar present an abstract conceptu model and a parallel
program model the former model doe not distinguish between control
and data state the latter model includ the capabl for
the represent of an infinit set of control state by
allow there to be arbitrarili mani instruct pointer or process
execut the program an induct principl is present which treat
the control and data state set on the same ground
through the us of place variabl it is observ that
certain correct condit can be express without enumer of the
set of all possibl control state exampl ar present in
which the induct principl is us to demonstr proof of
mutual exclus it is shown that assert orient proof method
ar special case of the induct principl a special case
of the assert method which is call parallel place assert
is shown to be incomplet a formal of deadlock is
then present the concept of a norm is introduc which
yield an extens to the deadlock problem of floyd s
techniqu for prove termin also discuss is an extens of
the program model which allow each process to have it
own local variabl and permit share global variabl correct of
certain form of implement is also discuss an appendix is
includ which relat thi work to previou work on the
satisfi of certain logic formula cacm juli 1976 keller r
m parallel program correct verif assert deadlock mutual exclus petrinet
4 6 5 2 6 9 8 1 ca760702 jb
januari 4 1978 1 20 pm 2228 4 2851 2280
4 2851 2379 4 2851 2320 4 2851 2482 4
2851 2597 4 2851 2740 4 2851 2777 4 2851
2851 4 2851 2851 4 2851 2895 4 2851 2912
4 2851 2920 4 2851 2946 4 2851 3128 4
2851 1877 5 2851 2150 5 2851 2851 5 2851
2851 5 2851 2851 5 2851 
# 2852
the technolog of comput center manag a propos cours for
graduat profession program in comput scienc or in inform system
mcfarlan and nolan have made a strong case for ad
a cours on inform system administr to the 13 cours
propos by the acm curriculum committe on comput educ for
manag for graduat profession program in inform system thi paper
is a report on a cours entitl the technolog of
comput center manag which ha been offer at purdu for
the past four year the cours is suitabl either for
graduat profession program in inform system or for graduat profession
program in comput scienc cacm juli 1976 cont s d
halstead m h educ inform system administr comput center manag
comput system perform 1 52 2 4 3 51 4
6 ca760701 jb januari 4 1978 1 31 pm 1653
4 2852 1720 4 2852 1927 4 2852 2147 4
2852 2163 4 2852 2345 4 2852 2387 4 2852
2407 4 2852 2478 4 2852 2594 4 2852 2852
4 2852 2852 4 2852 2852 4 2852 2852 4
2852 2852 4 2852 2899 4 2852 3003 4 2852
3003 4 2852 3011 4 2852 3050 4 2852 3050
4 2852 3130 4 2852 1417 5 2852 1771 5
2852 2345 5 2852 2387 5 2852 2479 5 2852
2852 5 2852 2852 5 2852 2852 5 2852 
# 2853
a number system for permut of combin cacm june 1976
knott g d combinator code system storag map function 4
9 5 30 ca760609 jb januari 4 1978 1 33
pm 2690 4 2853 2853 4 2853 2853 4 2853
3115 4 2853 2690 5 2853 2853 5 2853 2853
5 2853 2853 5 2853 579 5 2853 
# 2854
multiprocess compactifi garbag collect corrigendum cacm june 1976 steel g
l jr ca760608 jb januari 4 1978 1 36 pm
2854 5 2854 2854 5 2854 2854 5 2854 
# 2855
an effici list move algorithm us constant workspac an effici
algorithm is present for move arbitrari list structur us no
storag apart from program variabl other than that requir to
hold the origin list and the copi the origin list
is destroi as it is move no mark bit ar
necessari but pointer to the copi must be distinguish from
pointer to the origin the algorithm is superior in execut
speed to previou algorithm for the same problem some variat
and extens of the algorithm ar discuss cacm june 1976
clark d w list move list copi lisp space complex
constant workspac 4 34 4 49 5 25 ca760607 jb
januari 4 1978 1 43 pm 1024 4 2855 1051
4 2855 1102 4 2855 1132 4 2855 1390 4
2855 1486 4 2855 1549 4 2855 1706 4 2855
1826 4 2855 1869 4 2855 1878 4 2855 1972
4 2855 378 4 2855 2060 4 2855 2155 4
2855 2156 4 2855 2156 4 2855 2168 4 2855
2168 4 2855 2361 4 2855 2438 4 2855 2513
4 2855 2513 4 2855 2665 4 2855 2719 4
2855 2723 4 2855 2723 4 2855 2723 4 2855
2736 4 2855 2736 4 2855 2833 4 2855 2838
4 2855 2842 4 2855 2855 4 2855 2855 4
2855 2855 4 2855 2855 4 2855 2855 4 2855
2855 4 2855 2855 4 2855 2855 4 2855 2879
4 2855 2944 4 2855 2944 4 2855 2954 4
2855 3074 4 2855 3074 4 2855 3077 4 2855
3080 4 2855 3106 4 2855 3106 4 2855 3106
4 2855 3106 4 2855 3106 4 2855 3112 4
2855 3112 4 2855 3112 4 2855 627 4 2855
106 4 2855 210 5 2855 1549 5 2855 1826
5 2855 1972 5 2855 2513 5 2855 2766 5
2855 2833 5 2855 2855 5 2855 2855 5 2855
2855 5 2855 2998 5 2855 3106 5 2855 1549
6 2855 210 6 2855 1972 6 2855 2665 6
2855 2766 6 2855 2855 6 2855 2954 6 2855
2998 6 2855 
# 2856
the synthet approach to decis tabl convers previou approach to
the problem of automat convert decis tabl to comput program
have been base on decomposit at ani stage on condit
is select for test and two smaller problem decis tabl
with on less condit ar creat an optim program with
respect to averag execut time or storag space for exampl
is locat onli through implicit enumer of all possibl decis
tree us a techniqu such as branch and bound the
new approach describ in thi paper us dynam program to
synthes an optim decis tree from which a program can
be creat us thi approach the effici of creat an
optim program is increas substanti permit gener of optim program
for decis tabl with as mani as ten to twelv
condit cacm june 1976 schumach h sevcik k c decis
tabl decis tree dynam program optim program 3 50 4
12 5 30 8 3 ca760606 jb januari 4 1978
1 50 pm 1354 4 2856 1354 4 2856 1488
4 2856 1684 4 2856 2053 4 2856 2053 4
2856 2053 4 2856 2220 4 2856 2220 4 2856
2220 4 2856 2221 4 2856 2273 4 2856 2273
4 2856 2273 4 2856 2273 4 2856 2273 4
2856 2453 4 2856 2453 4 2856 2453 4 2856
2453 4 2856 2517 4 2856 2598 4 2856 2598
4 2856 2598 4 2856 2726 4 2856 2726 4
2856 2726 4 2856 2726 4 2856 2845 4 2856
2856 4 2856 2856 4 2856 2856 4 2856 2856
4 2856 2856 4 2856 2856 4 2856 2856 4
2856 3034 4 2856 3113 4 2856 3113 4 2856
1172 5 2856 1327 5 2856 1354 5 2856 2053
5 2856 2220 5 2856 2453 5 2856 2598 5
2856 2856 5 2856 2856 5 2856 2856 5 2856
3033 5 2856 3113 5 2856 1354 6 2856 2263
6 2856 2598 6 2856 2691 6 2856 2856 6
2856 2856 6 2856 
# 2857
referenc list by an edg an edg refer into a
list structur is a pair of pointer to adjac node
such a refer often requir littl addit space but it
us can yield effici algorithm for instanc a circular link
between the end of a list is redundant if the
list is alwai referenc by that edg and list travers
is easier when that link is null edg refer also
allow thread of nonrecurs list can replac some header cell
and enhanc the famou exclus or trick to doubl link
list cacm june 1976 wise d s list process circular
doubli link overlap sublist header cell pointer cursor 3 73
4 10 4 22 ca760605 jb januari 4 1978 2
00 pm 1024 4 2857 1051 4 2857 1098 4
2857 1214 4 2857 1380 4 2857 1388 4 2857
1393 4 2857 1396 4 2857 1485 4 2857 1487
4 2857 1549 4 2857 1570 4 2857 1878 4
2857 1946 4 2857 1946 4 2857 1957 4 2857
2167 4 2857 2168 4 2857 2723 4 2857 2857
4 2857 2857 4 2857 3112 4 2857 1393 5
2857 2857 5 2857 2857 5 2857 2857 5 2857
731 5 2857 
# 2858
a process for the determin of address in variabl length
address an algorithm is present for the assign of instruct
address and format under the follow condit 1 the length
of the instruct vari as a function of the distanc
of the instruct from it target 2 there exist an
optim criterion which impli some preferenti choic subject to the
address constraint thi mai be for exampl achiev the smallest
number of long instruct in which case the total code
length is minim or minim the assign address of a
specifi point in the program the algorithm is suitabl for
arbitrari program structur and a choic of optim criteria cacm
june 1976 frieder g saal h j variabl length address
assembl page 4 11 4 12 ca760604 jb januari 4
1978 2 09 pm 2858 4 2858 3110 4 2858
2194 5 2858 2858 5 2858 2858 5 2858 2858
5 2858 3110 5 2858 2194 6 2858 2629 6
2858 2858 6 2858 
# 2859
interfer in multiprocessor comput system with interleav memori thi paper
analyz the memori interfer caus by sever processor simultan us
sever memori modul exect result ar comput for a simpl
model of such a system the limit valu is deriv
for the rel degre of memori interfer as the system
size increas the model of the limit behavior of the
system yield approxim result for the simpl model and also
suggest that the result ar valid for a much larger
class of model includ those more nearli like real system
that the simpl model ar test against some measur of
program behavior and simul of system us memori refer from
real program the model result provid a good indic of
the perform that should be expect from real system of
thi type cacm june 1976 baskett f smith a j
memori memori interfer multiprocess interleav memori trace driven simul 4
32 6 21 6 34 8 1 ca760603 jb januari
4 1978 2 19 pm 1668 4 2859 1669 4
2859 1679 4 2859 1728 4 2859 2859 4 2859
2859 4 2859 1525 5 2859 1676 5 2859 2859
5 2859 2859 5 2859 2859 5 2859 2918 5
2859 3119 5 2859 2245 6 2859 2798 6 2859
2849 6 2859 2859 6 2859 2859 6 2859 
# 2860
a practition s guid to address algorithm thi paper consolid
a number of popular rule of thumb which have been
suggest for the design of record address algorithm and discuss
the applic of these rule to larg commerci databas guidelin
for select identifi transform overflow techniqu load factor bucket size
and load order and consid particular attent is focus on
the reason of common heurist for determin primari or secondari
bucket size a mathemat model which explicitli consid storag devic
characterist and time space cost tradeoff is us to analyz
the effect of design paramet on overal system cost a
specif design exampl is present and solv cacm june 1976
sever d duhn r data manag file retriev search address
techniqu hash function synonym resolut load factor bucket size heurist
design rule of thumb 3 50 3 72 3 74
4 33 4 34 4 41 8 1 ca760602 jb
januari 4 1978 2 47 pm 1785 4 2860 2203
4 2860 2258 4 2860 2282 4 2860 2319 4
2860 2313 4 2860 2359 4 2860 2437 4 2860
2552 4 2860 2781 4 2860 2860 4 2860 2860
4 2860 2860 4 2860 2991 4 2860 3083 4
2860 911 4 2860 1328 5 2860 2203 5 2860
2860 5 2860 2860 5 2860 2860 5 2860 492
5 2860 
# 2861
product and employ of ph s in comput scienc cacm
june 1976 taulbe o e cont s d ca760601 jb
januari 4 1978 2 51 pm 2861 5 2861 2861
5 2861 2861 5 2861 2962 5 2861 3123 5
2861 3122 5 2861 2823 6 2861 2861 6 2861
2861 6 2861 2861 6 2861 2962 6 2861 2962
6 2861 3022 6 2861 
# 2862
analysi of the pff replac algorithm via a semi markov
model an analyt model is present to estim the perform
of the page fault frequenc pff replac algorithm in thi
model program behavior is repres by the lru stack distanc
model and the pff replac algorithm is repres by a
semi markov model us these model such paramet as the
inter page fault interv distribut the probabl of the number
of distinct page be referenc dure an inter page fault
interv etc ar abl to be analyt determin us these
model to evalu these paramet valu permit studi of the
perform of the replac algorithm by simul the page fault
event rather than everi page refer event thi significantli reduc
the requir comput time in estim the perform of the
pff algorithm cacm mai 1976 chu w w opderbeck h
pff replac algorithm semi markov model simul of replac algorithm
4 31 4 32 ca760509 jb januari 4 1978 2
59 pm 1892 4 2862 1924 4 2862 2095 4
2862 2218 4 2862 2297 4 2862 2374 4 2862
2526 4 2862 2667 4 2862 2668 4 2862 2862
4 2862 2863 4 2862 1728 5 2862 2862 5
2862 2862 5 2862 2862 5 2862 
# 2863
vmin an optim variabl space page replac algorithm a criterion
for compar variabl space page replac algorithm is present an
optimum page replac algorithm call vmin is describ and shown
to be optimum with respect to thi criterion the result
of simul vmin den s work set and the page
partit replac algorithm on five virtual memori program ar present
to demonstr the improv possibl over the known realiz variabl
space algorithm cacm mai 1976 priev b g fabri r
s demand page perform measur multilevel memori system virtual memori
work set page replac algorithm optim page replac 4 30
4 32 ca760508 jb januari 4 1978 3 06 pm
1892 4 2863 1892 4 2863 1901 4 2863 1924
4 2863 2085 4 2863 2095 4 2863 2095 4
2863 2218 4 2863 2218 4 2863 2277 4 2863
2297 4 2863 2319 4 2863 2329 4 2863 2358
4 2863 2373 4 2863 2374 4 2863 2374 4
2863 2380 4 2863 2434 4 2863 2499 4 2863
2481 4 2863 2501 4 2863 2526 4 2863 2582
4 2863 2667 4 2863 2668 4 2863 2669 4
2863 2669 4 2863 2828 4 2863 2862 4 2863
2863 4 2863 2863 4 2863 2863 4 2863 2863
4 2863 2881 4 2863 2928 4 2863 2996 4
2863 3006 4 2863 3016 4 2863 3052 4 2863
3067 4 2863 3067 4 2863 1728 5 2863 1751
5 2863 1901 5 2863 2863 5 2863 2863 5
2863 2863 5 2863 2863 5 2863 3067 5 2863
1728 6 2863 1751 6 2863 1751 6 2863 1901
6 2863 2374 6 2863 2373 6 2863 2595 6
2863 2682 6 2863 2863 6 2863 2863 6 2863
2864 6 2863 3006 6 2863 
# 2864
characterist of program local the term local ha been us
to denot that subset of a program s segment which
ar referenc dure a particular phase of it execut a
program s behavior can be character in term of it
resid in local of variou size and lifetim and the
transit between these local in thi paper the concept of
a local is made more explicit through a formal definit
of what constitut a phase of local refer behavior and
by a correspond mechan for the detect of local in
actual refer string thi definit provid for the exist of
a hierarchi of local at ani given time and the
reason of the definit is support by exampl taken from
actual program empir data from a sampl of product algol
60 program is us to displai distribut of local size
and lifetim and these result ar discuss in term of
their implic for the model of program behavior and memori
manag in virtual memori system cacm mai 1976 madison a
w batson a p program behavior memori manag local 4
22 4 35 4 6 4 9 6 21 ca760507
jb januari 4 1978 3 15 pm 2864 5 2864
2864 5 2864 2864 5 2864 3000 5 2864 3067
5 2864 1751 6 2864 1879 6 2864 2095 6
2864 2374 6 2864 2373 6 2864 2595 6 2864
2682 6 2864 2863 6 2864 2864 6 2864 2864
6 2864 3006 6 2864 
# 2865
verifi properti of parallel program an axiomat approach an axiomat
method for prove a number of properti of parallel program
is present hoar ha given a set of axiom for
partial correct but thei ar not strong enough in most
case thi paper defin a more power deduct system which
is in some sens complet for partial correct a crucial
axiom provid for the us of auxiliari variabl which ar
ad to a parallel program as an aid to prove
it correct the inform in a partial correct proof can
be us to prove such properti as mutual exclus freedom
from deadlock and program termin techniqu for verifi these properti
ar present and illustr by applic to the dine philosoph
problem cacm mai 1976 owicki s gri d structur multiprogram
correct proof program verif concurr process synchron mutual exclus deadlock
4 32 4 35 5 21 5 24 ca760506 jb
januari 4 1978 3 23 pm 2021 4 2865 2222
4 2865 2227 4 2865 2315 4 2865 2326 4
2865 2470 4 2865 2732 4 2865 2865 4 2865
2865 4 2865 2866 4 2865 2896 4 2865 2898
4 2865 2943 4 2865 2972 4 2865 3014 4
2865 3043 4 2865 3068 4 2865 3077 4 2865
3128 4 2865 3143 4 2865 3144 4 2865 1834
5 2865 2597 5 2865 2865 5 2865 2865 5
2865 2865 5 2865 3128 5 2865 3148 5 2865
1860 6 2865 2150 6 2865 2376 6 2865 2436
6 2865 2597 6 2865 2817 6 2865 2865 6
2865 2865 6 2865 2866 6 2865 2870 6 2865
2912 6 2865 2939 6 2865 3073 6 2865 3082
6 2865 
# 2866
prove monitor interest schedul and sequenti properti of monitor can
be prove by us state variabl which record the monitor
s histori and by defin extend proof rule for their
wait and signal oper these two techniqu ar defin discuss
and appli to exampl to prove properti such as freedom
from indefinit repeat overtak or unnecessari wait upper bound on
queue length and histor behavior cacm mai 1976 howard j
monitor correct proof rule histor variabl concurr schedul bound buffer
semaphor alarm clock disk head 4 32 4 35 5
24 ca760505 jb januari 4 1978 3 28 pm 2704
4 2866 2738 4 2866 2865 4 2866 2866 4
2866 2866 4 2866 2866 4 2866 2869 4 2866
2898 4 2866 2941 4 2866 2958 4 2866 2972
4 2866 3004 4 2866 3030 4 2866 3043 4
2866 3128 4 2866 3144 4 2866 2356 5 2866
2597 5 2866 2796 5 2866 2866 5 2866 2866
5 2866 2866 5 2866 2938 5 2866 2946 5
2866 3128 5 2866 2150 6 2866 2150 6 2866
2376 6 2866 2436 6 2866 2597 6 2866 2865
6 2866 2866 6 2866 2866 6 2866 2866 6
2866 2870 6 2866 2912 6 2866 3082 6 2866
# 2867
modular and hierarchi in a famili of oper system thi
paper describ the design philosophi us in the construct of
a famili of oper system it is shown that the
concept of modul and level do not coincid in a
hierarchi of function famili member can share much softwar as
a result of the implement of run time modul at
the lowest system level cacm mai 1976 habermann a n
flon l cooprid l increment machin design modul data type
address space virtual memori 4 0 4 30 4 35
ca760504 jb januari 4 1978 3 33 pm 1828 4
2867 1854 4 2867 1877 4 2867 1960 4 2867
2150 4 2867 2317 4 2867 2319 4 2867 2377
4 2867 2342 4 2867 2376 4 2867 2379 4
2867 2424 4 2867 2482 4 2867 2480 4 2867
2618 4 2867 2632 4 2867 2704 4 2867 2704
4 2867 2723 4 2867 2738 4 2867 2738 4
2867 2740 4 2867 2741 4 2867 2867 4 2867
2867 4 2867 2867 4 2867 3004 4 2867 3030
4 2867 3155 4 2867 3184 4 2867 1749 5
2867 2247 5 2867 2379 5 2867 2867 5 2867
2867 5 2867 2867 5 2867 
# 2868
reflect on an oper system design the main featur of
a gener purpos multiaccess oper system develop for the cdc
6400 at berkelei ar present and it good and bad
point ar discuss as thei appear in retrospect distinct featur
of the design were the us of capabl for protect
and the organ of the system into a sequenc of
layer each build on the facil provid by earlier on
and protect itself from the malfunct of later on there
were seriou problem in maintain the protect between layer when
level were ad to the memori hierarchi these problem ar
discuss and a new solut is describ cacm mai 1976
lampson b w sturgi h e oper system protect capabl
layer domain memori hierarchi fault 4 35 ca760503 jb januari
4 1978 3 57 pm 2319 4 2868 2378 4
2868 2320 4 2868 2436 4 2868 2626 4 2868
2626 4 2868 2629 4 2868 2632 4 2868 2738
4 2868 2740 4 2868 2868 4 2868 2868 4
2868 2868 4 2868 2868 4 2868 2868 4 2868
2868 4 2868 2870 4 2868 2870 4 2868 2876
4 2868 2928 4 2868 2939 4 2868 2941 4
2868 2951 4 2868 3105 4 2868 3105 4 2868
3127 4 2868 3144 4 2868 3144 4 2868 2080
5 2868 2377 5 2868 2380 5 2868 2558 5
2868 2625 5 2868 2632 5 2868 2868 5 2868
2868 5 2868 2868 5 2868 3105 5 2868 1471
6 2868 2625 6 2868 2632 6 2868 2868 6
2868 2939 6 2868 3068 6 2868 
# 2869
secur kernel valid in practic a secur kernel is a
softwar and hardwar mechan that enforc access control within a
comput system the correct of a secur kernel on a
pdp 11 45 is be prove thi paper describ the
techniqu us to carri out the first step of the
proof valid a formal specif of the program with respect
to a axiom for a secur system cacm mai 1976
millen j k valid verif correct secur kernel formal specif
protect 4 35 4 6 5 24 ca760502 jb januari
4 1978 4 01 pm 2704 4 2869 2738 4
2869 2840 4 2869 2866 4 2869 2869 4 2869
2869 4 2869 2941 4 2869 2958 4 2869 3004
4 2869 3030 4 2869 3128 4 2869 3158 4
2869 2356 5 2869 2436 5 2869 2869 5 2869
2869 5 2869 2869 5 2869 3068 5 2869 1834
6 2869 2869 6 2869 
# 2870
a lattic model of secur inform flow thi paper investig
mechan that guarante secur inform flow in a comput system
these mechan ar examin within a mathemat framework suitabl for
formul the requir of secur inform flow among secur class
the central compon of the model is a lattic structur
deriv from the secur class and justifi by the semant
of inform flow the lattic properti permit concis formul of
the secur requir of differ exist system and facilit the
construct of mechan that enforc secur the model provid a
unifi view of all system that restrict inform flow enabl
a classif of them accord to secur object and suggest
some new approach it also lead to the construct of
automat program certif mechan for verifi the secur flow of
inform through a program cacm mai 1976 den d e
protect secur inform flow secur class lattic program certif 4
35 ca760501 jb januari 4 1978 4 10 pm 2436
4 2870 2626 4 2870 2868 4 2870 2868 4
2870 2870 4 2870 2870 4 2870 2870 4 2870
2876 4 2870 3105 4 2870 3144 4 2870 953
5 2870 2377 5 2870 2632 5 2870 2870 5
2870 2870 5 2870 2870 5 2870 2945 5 2870
3128 5 2870 1947 6 2870 2150 6 2870 2376
6 2870 2436 6 2870 2597 6 2870 2704 6
2870 2865 6 2870 2866 6 2870 2870 6 2870
2870 6 2870 2912 6 2870 3082 6 2870 
# 2871
logic analysi of program most present system for verif of
comput program ar incomplet in that intermedi induct assert must
be provid manual by the user termin is not proven
and incorrect program ar not treat as a unifi solut
to these problem thi paper suggest conduct a logic analysi
of program by us invari which express what is actual
occur in the program the first part of the paper
is devot to techniqu for the automat gener of invari
the second part provid criteria for us the invari to
check simultan for correct includ termin or incorrect a third
part examin the implic of the approach for the automat
diagnosi and correct of logic error cacm april 1976 katz
s manna z logic analysi invari program verif correct incorrect
termin automat debug 3 66 4 42 5 24 ca760405
jb januari 4 1978 4 15 pm 2871 5 2871
2871 5 2871 2871 5 2871 2874 5 2871 1682
6 2871 2227 6 2871 2317 6 2871 2683 6
2871 2871 6 2871 521 6 2871 
# 2872
a counterintuit exampl of comput page corrigendum cacm april 1976
fagin r ca760404 jb januari 4 1978 4 19 pm
2872 5 2872 2872 5 2872 2872 5 2872 
# 2873
lg a languag for analyt geometri a convers program languag
for analyt geometri is describ togeth with some aspect of
it implement the languag allow the flexibl definit of geometr
object and element comput their paramet and displai the result
it also provid the capabl of specifi a geometr figur
via a collect of paramet and displai variou loci correspond
to these paramet a third characterist consist of the possibl
of us thi languag to design other user orient languag
lg ha been specif design for us by nonprogramm it
is easi to learn and veri close to the natur
languag us in geometri cacm april 1976 raymond j interact
program problem orient languag comput graphic interpret analyt geometri 3
20 4 13 4 22 4 9 ca760403 jb januari
4 1978 4 26 pm 2873 5 2873 2873 5
2873 2873 5 2873 
# 2874
a compar evalu of version of basic from it incept
the basic languag ha grown in term of it usag
scope of usag and it featur thi articl compar ten
of the current version of basic with each other with
two earlier version and with the propos standard for minim
basic the comparison is arrang by the featur of the
version and by comput comparison of comput and time and
process cost cacm april 1976 lientz b p basic interpret
languag summari 4 20 4 6 ca760402 jb januari 4
1978 4 34 pm 2044 4 2874 2189 4 2874
2356 4 2874 2417 4 2874 2420 4 2874 2505
4 2874 2874 4 2874 2874 4 2874 2874 4
2874 2874 4 2874 2874 4 2874 2874 4 2874
2908 4 2874 3104 4 2874 3143 4 2874 1682
5 2874 2227 5 2874 2317 5 2874 2683 5
2874 2871 5 2874 2874 5 2874 2874 5 2874
2874 5 2874 521 5 2874 
# 2875
develop of an intern system for legal protect of comput
program cacm april 1976 smoot o r copyright of softwar
patent of softwar legal protect of softwar 2 3 4
5 ca760401 jb januari 4 1978 4 42 pm 2875
5 2875 2875 5 2875 2875 5 2875 
# 2876
intent resolut of privaci protect in databas system tradition privaci
protect in databas system is understood to be the control
over what inform a given user can get from a
databas thi paper is concern with anoth independ dimens of
privaci protect the control over what a user is allow
to do with a piec of inform suppli to him
by the databas the abil to condit the suppli of
inform on it intend us is call here intent resolut
of privaci protect the practic import of intent resolut is
demonstr by sever exampl and it realiz is discuss it
is shown that intent resolut can be achiev but that
it involv a radic chang from the tradit approach to
the process of user databas interact in particular it appear
to be necessari for the databas to impos a certain
amount of control over the intern behavior of user program
which interact with it a model for user databas interact
which admit such a control is develop cacm march 1976
minski n protect in databas protect in program languag privaci
secur intent resolut of privaci interact with databas 3 50
3 70 4 20 4 30 ca760304 jb januari 4
1978 4 44 pm 2785 4 2876 2868 4 2876
2870 4 2876 2876 4 2876 2876 4 2876 3105
4 2876 3144 4 2876 2632 5 2876 2685 5
2876 2876 5 2876 2876 5 2876 2876 5 2876
# 2877
a program data flow analysi procedur the global data relationship
in a program can be expos and codifi by the
static analysi method describ in thi paper a procedur is
given which determin all the definit which can possibl reach
each node of the control flow graph of the program
and all the definit that ar live on each edg
of the graph the procedur us an interv order edg
list data structur and handl reduc and irreduc graph indistinguish
cacm march 1976 allen j e cock j program optim
data flow analysi flow graph algorithm compil 4 12 5
24 ca760303 jb januari 5 1978 8 33 am 2877
5 2877 2877 5 2877 2877 5 2877 3103 5
2877 1860 6 2877 2877 6 2877 
# 2878
join polici in a multiprior multiclass batch comput system consid
a multiprior batch comput system which user from sever differ
class mai join it toll servic and wait charg such
a system is formul here as a semi markov decis
process in which the aim of arriv user is to
minim their expect loss the optim join polici is on
of arriv user who mai join the system at some
of it queue is a control limit polici with a
singl control number for ani possibl queue and the user
s class a newli arriv user will join a queue
that is not fill up to the control number correspond
to thi queue and the user s class in thi
paper control number as well as lower and upper bound
for the control number and the capac of the system
s queue ar deriv cacm march 1976 babad j m
modiano m m prioriti queue semi markov process price schedul
oper system 4 39 8 3 ca760302 dmm januari 9
1978 2 14 pm 2878 5 2878 2878 5 2878
2878 5 2878 
# 2879
comput scienc as empir inquiri symbol and search cacm march
1976 newel a simon h a symbol search scienc comput
scienc empir ture artifici intellig intellig list process cognit heurist
problem solv 1 0 2 1 3 3 3 6
5 7 ca760301 jb januari 5 1978 8 39 am
1024 4 2879 1051 4 2879 1102 4 2879 1132
4 2879 1390 4 2879 1486 4 2879 1549 4
2879 1706 4 2879 1826 4 2879 1878 4 2879
378 4 2879 2060 4 2879 2155 4 2879 2168
4 2879 2719 4 2879 2723 4 2879 2838 4
2879 2842 4 2879 2855 4 2879 2879 4 2879
3077 4 2879 3080 4 2879 3106 4 2879 627
4 2879 106 4 2879 210 5 2879 2879 5
2879 2879 5 2879 2879 5 2879 
# 2880
a fast divis techniqu for constant divisor a fast algorithm
for divis by constant divisor is present the method ha
prove veri us implement as microcod ona binari machin and
can be adapt directli into hardwar the mathemat foundat of
the algorithm ar present as well as some perform measur
cacm februari 1976 artzi e hind j a saal h
j constant divisor divis algorithm bit address memori microprogram 4
13 4 49 6 32 ca760207 jb januari 5 1978
8 48 am 2880 5 2880 2880 5 2880 2880
5 2880 
# 2881
a counterintuit exampl of comput page a counterexampl is exhibit
to a natur conjectur concern the optim wai to group
record into page in the independ refer model of comput
page an organ is said to be optim if the
least recent us miss ratio is minim cacm februari 1976
fagin r least recent us most like togeth independ refer
model storag organ record alloc 3 70 3 73 4
0 5 30 ca760206 jb januari 5 1978 8 53
am 1892 4 2881 1901 4 2881 2085 4 2881
2095 4 2881 2218 4 2881 2277 4 2881 2319
4 2881 2329 4 2881 2358 4 2881 2373 4
2881 2380 4 2881 2434 4 2881 2499 4 2881
2501 4 2881 2582 4 2881 2669 4 2881 2828
4 2881 2863 4 2881 2881 4 2881 2928 4
2881 2996 4 2881 3006 4 2881 3067 4 2881
1751 5 2881 2881 5 2881 2881 5 2881 2881
5 2881 
# 2882
a stochast evalu model for databas organ in data retriev
system experiment work in the valuat of larg scale data
retriev system ha been scarc due to it difficulti and
prohibit cost thi paper discuss a simul model of a
data retriev system which ha the effect of significantli reduc
the cost of experiment and enabl research never attempt befor
the model is design to estim the retriev workload of
altern data retriev system these data retriev system can be
organ under sever databas organ includ invert list thread list
and cellular list organ and hybrid combin of these system
effect of the methodolog is demonstr by us the model
to studi the effect of databas organ in data retriev
system in particular the impact of queri complex is analyz
cacm februari 1976 siler k f databas architectur databas perform
and evalu invent list thread list cellular list inform retriev
databas organ queri complex stochast model mont carlo simul 3
70 3 71 3 72 3 73 3 74 3
79 ca760205 jb januari 5 1978 9 20 am 1050
4 2882 1549 4 2882 2452 4 2882 2723 4
2882 2765 4 2882 2882 4 2882 2882 4 2882
2882 4 2882 731 4 2882 793 4 2882 2198
5 2882 2452 5 2882 2882 5 2882 2882 5
2882 2882 5 2882 2976 5 2882 627 5 2882
2688 6 2882 2765 6 2882 2882 6 2882 
# 2883
an applic of heurist search method to edg and contour
detect thi paper present a method for detect edg and
contour in noisi pictur the properti of an edg ar
embed in a figur of merit and the edg detect
problem becom the problem of minim the given figur of
merit thi problem can be repres as a shortest path
problem on a graph and can be solv us well
known graph search algorithm the relat between thi represent of
the minim problem and a dynam program approach ar discuss
show that the graph search method can lead to substanti
improv in comput time moreov if heurist search method ar
us the comput time will depend on the amount of
nois in the pictur some experiment result ar given these
show how variou inform about the shape of the contour
of an object can be embed in the figur of
merit thu allow the extract of contour from noisi pictur
and the separ of touch object cacm februari 1976 martelli
a pictur process pattern recognit edg detect contour detect contour
follow optim problem dynam program shortest path heurist search method
problem solv method 3 63 3 64 3 66 5
42 ca760204 jb januari 5 1978 9 30 am 2883
4 2883 2195 5 2883 2883 5 2883 2883 5
2883 2883 5 2883 
# 2884
permut enumer four new permut algorithm classic permut enumer algorithm
encount special case requir addit comput everi nth permut when
gener the n permut on n mark four new algorithm
have the attribut that special case occur everi n n
1 permut two of the algorithm produc the next permut
with a singl exchang of two mark the other two
algorithm infrequ exchang more than two mark but the rule
for gener the next permut ar veri simpl perform test
which have count execut of assign statement comparison arithmet oper
and subscript arrai refer have shown superior of the new
algorithm compar to boothroyd s implement of m b well
s algorithm and ehrlich s implement of the johnson trotter
algorithm cacm februari 1976 iv f m permut loop free
algorithm 5 30 ca760203 jb januari 5 1978 9 33
am 2834 4 2884 2884 4 2884 3115 4 2884
2417 5 2884 2884 5 2884 2884 5 2884 2884
5 2884 2908 5 2884 3115 5 2884 907 6
2884 2045 6 2884 2417 6 2884 2466 6 2884
2505 6 2884 2884 6 2884 2884 6 2884 521
6 2884 579 6 2884 785 6 2884 
# 2885
on self organ sequenti search heurist thi paper examin a
class of heurist for maintain a sequenti list in approxim
optim order with respect to the averag time requir to
search for a specifi element assum that each element is
search for with a fix probabl independ of previou search
perform the move to front and transposit heurist ar shown
to be optim to within a constant factor and the
transposit rule is shown to be the more effici of
the two empir evid suggest that transposit is in fact
optim for ani distribut of search probabl cacm februari 1976
rivest r search self organ list process heurist 3 74
5 25 ca760202 jb januari 5 1978 9 44 am
2885 5 2885 2885 5 2885 2885 5 2885 3061
5 2885 2885 6 2885 
# 2886
semant evalu from left to right thi paper describ attribut
grammar and their us for the definit of program languag
and compil a formal definit of attribut grammar and a
discuss of some of it import aspect ar includ the
paper concentr on the evalu of semant attribut in a
few pass from left to right over the deriv tree
of a program a condit for an attribut grammar is
given which assur that the semant of ani program can
be evalu in a singl pass over the deriv tree
and an algorithm is discuss which decid how mani pass
from left to right ar in gener necessari given the
attribut grammar these notion ar explain in term of an
exampl grammar which describ the scope rule of algol 60
practic question such as the rel effici of differ evalu
scheme and the eas of adapt the attribut grammar of
a given program languag to the left to right evalu
scheme ar discuss cacm februari 1976 bochmann g v attribut
grammar semant of program languag semant attribut left to right
pars multipass compil semant evalu semant condit 4 10 4
20 5 23 5 24 ca760201 jb januari 5 1978
9 54 am 2886 4 2886 2301 5 2886 2703
5 2886 2886 5 2886 2886 5 2886 2886 5
2886 2886 6 2886 
# 2887
a studi of error error prone and error diagnosi in
cobol thi paper provid data on cobol error frequenc for
correct of error in student orient compil improv of teach
and chang in program languag cobol wa studi becaus of
econom import widespread usag possibl error includ design and lack
of research the type of error were identifi in a
pilot studi then us the 132 error type found 1
777 error were classifi in 1 4000 run of 73
cobol student error densiti wa high 20 percent of the
type contain 80 percent of the total frequenc which impli
high potenti effect for softwar base correct of cobol surprisingli
onli four high frequenc error were error prone which impli
minim error induc design 80 percent of cobol misspel were
classifi in the four error categori of previou research which
impli that cobol misspel ar correct by exist algorithm reserv
word usag wa not error prone which impli minim interfer
with usag of reserv word over 80 percent of error
diagnosi wa found to be inaccur such feedback is not
optim for user particularli for the learn user of cobol
cacm januari 1976 litecki c r davi g b error
in program error correct cobol program languag error error analysi
diagnost error prone error frequenc spell error syntact error learn
of program teach of program 4 22 4 2 4
6 ca760106 jb januari 5 1978 10 06 am 2534
4 2887 2556 4 2887 2650 4 2887 2708 4
2887 2887 4 2887 2887 4 2887 1646 5 2887
2111 5 2887 2887 5 2887 2887 5 2887 2887
5 2887 3145 5 2887 2887 6 2887 
# 2888
inform refer code item in busi system have to be
identifi by refer code which can later be us as
data code and file kei in an associ data process
system in busi system associ with larg collect of integr
file databas it is vital to assign code in a
method wai so as to control futur extens and chang
while maintain correct program action the principl of method code
ar discuss and the wai in which logic connect between
data item must be reflect in the refer code framework
is shown through a set theoret inform model cacm januari
1976 florentin j j data file refer code system analysi
inform model databas 3 50 ca760105 jb januari 5 1978
10 11 am 1135 4 2888 1136 4 2888 2155
4 2888 2406 4 2888 493 4 2888 2710 4
2888 2710 4 2888 2715 4 2888 2716 4 2888
2717 4 2888 2718 4 2888 2765 4 2888 2765
4 2888 2817 4 2888 2888 4 2888 2888 4
2888 2901 4 2888 2906 4 2888 2957 4 2888
2959 4 2888 2965 4 2888 3087 4 2888 3154
4 2888 729 4 2888 2046 5 2888 2888 5
2888 2888 5 2888 2888 5 2888 616 5 2888
# 2889
perform of height balanc tree thi paper present the result
of simul that investig the perform of height balanc hb
k tree it is shown that the onli statist of
hb 1 tree avl tree that is a function of
the size of the tree is the time to search
for an item in the tree for suffici larg tree
the execut time of all procedur for maintain hb 1
tree ar independ of the size of the tree in
particular an averag of 465 restructur ar requir per insert
with an averag of 2 78 node revisit to restor
the hb 1 properti an averag of 214 restructur ar
requir per delet with an averag of 1 91 node
revisit to restor the hb 1 properti moreov the execut
time of procedur for maintain hb k tree for k
1 ar also independ of the size of the tree
except for the averag number of node revisit on a
delet oper in order to restor the hb k properti
on trace back the cost of maintain hb k tree
drop sharpli as the allow imbal k increas both analyt
and experiment result that show the cost of maintain hb
k tree as a function of k ar discuss cacm
januari 1976 karlton p l fuller s h scrogg r
e kaehler e b hb k tree balanc tree avl
tree inform storag and retriev search 3 7 3 72
3 74 4 49 5 39 ca760104 jb januari 5
1978 10 27 am 2411 4 2889 2455 4 2889
2493 4 2889 2709 4 2889 2889 4 2889 2889
4 2889 2889 4 2889 2937 4 2889 2968 4
2889 2968 4 2889 2989 4 2889 3005 4 2889
3025 4 2889 3042 4 2889 3101 4 2889 2138
5 2889 2388 5 2889 2455 5 2889 2839 5
2889 2889 5 2889 2889 5 2889 2889 5 2889
3042 5 2889 3096 5 2889 3163 5 2889 2455
6 2889 2839 6 2889 2839 6 2889 2839 6
2889 2889 6 2889 2889 6 2889 2889 6 2889
2889 6 2889 2968 6 2889 3009 6 2889 3009
6 2889 3065 6 2889 3096 6 2889 
# 2890
on quadrat adapt rout algorithm two analyt model of a
store and forward commun network ar construct on to find
the optim messag rout and the other to illustr the
equilibrium stationari state maintain by an adapt rout algorithm these
model show that adapt rout doe not satisfi the necessari
condit for an optim rout adapt rout tend to overus
the direct path and underus altern rout becaus it doe
not consid the impact of it current rout decis on
the futur state of the network the form of the
optim condit suggest that a modif of the adapt algorithm
will result in optim the modif requir the substitut of
a quadrat bia term instead of a linear on in
the rout tabl maintain at each network node simul result
ar present which confirm the theoret analysi for a simpl
network cacm januari 1976 agnew c e rout algorithm adapt
rout quadrat rout altern rout store and forward network distribut
network comput network messag switch 3 81 8 0 8
1 8 3 ca760103 jb januari 5 1978 10 37
am 2890 5 2890 2890 5 2890 2890 5 2890
# 2891
an anomali in disk schedul a comparison of fcf and
sstf seek schedul us an empir model for disk access
a model for disk access base on publish measur is
develop the model is us to show that under highli
probabl condit fcf seek schedul is superior to sstf schedul
in the sens of have a lower mean queue length
a simpl exampl of an arriv sequenc illustr thi anomali
is present cacm januari 1976 wilhelm n c disk disk
schedul seek schedul 3 72 4 35 4 41 4
6 6 35 ca760102 jb januari 5 1978 10 42
am 2628 4 2891 2891 4 2891 2891 4 2891
3072 4 2891 2375 5 2891 2628 5 2891 2891
5 2891 2891 5 2891 2891 5 2891 3153 5
2891 2741 6 2891 2891 6 2891 
# 2892
a studi of line overhead in the arpanet the form
extent and effect of the commun line overhead in the
arpanet ar consid the sourc of thi over head is
separ into variou level of protocol hierarchi and the characterist
of each level ar summar then the line effici for
variou model of system us is studi some measur of
line effici for the arpanet ar present and by extrapol
these measur ar us to anticip overhead in a heavili
load network similar result ar deriv for a recent propos
network protocol and compar with those for the current system
cacm januari 1976 kleinrock l naylor w e opderbeck h
arpanet comput commun network interprocess commun measur packet switch perform
evalu and effici resourc share 3 81 4 39 4
6 4 9 ca760101 jb januari 5 1978 10 49
am 2892 5 2892 2892 5 2892 2892 5 2892
# 2893
comput as an innov in american local govern comput and
electron data process ar a major technolog innov in the
oper of american local govern thi paper establish that there
is substanti variat among the larger local govern in the
rate at which thei adopt comput technolog in the level
of financi support thei provid for edp and in the
extens and sophist of their autom applic the central question
address is what might explain the differ between govern in
the extent to which thei adopt and us comput hypothes
ar test for sever stream of explanatori factor us data
from more than 500 citi and counti govern the find
identifi certain local govern milieu which ar particularli conduc to
higher level of comput innov somewhat unexpect find reveal the
signific impact of the distribut of control over edp decis
and the domin polit valu within the govern other import
factor includ the measur need for comput applic and the
presenc of extern fund support for comput final the paper
suggest a framework for identifi the kei determin of other
technolog innov cacm decemb 1977 danzig j n dutton w
h innov technolog innov comput util comput adopt american local
govern citi govern comput counti govern comput 2 0 2
45 2 49 2 9 ca771207 jb decemb 22 1977
12 17 pm 2893 5 2893 2893 5 2893 2893
5 2893 
# 2894
a methodolog for interact comput servic measur a measur methodolog
applic to in teract comput servic is describ it primari
purpos is to enabl extern user orient assess of comput
perform instead of the more frequent us in ternal system
measur techniqu the nb network measur system is emploi as
the extern measur tool exampl data have been collect and
analyz a demonstr of the methodolog lead to a pragmat
figur of merit evalu of result is includ cacm decemb
1977 adram m d in teract system comput servic measur
perform extern measur methodolog measur model network measur system measur
figur of merit 2 4 4 6 6 2 ca771206
jb decemb 22 1977 12 32 pm 2193 4 2894
2319 4 2894 2373 4 2894 2894 4 2894 2894
4 2894 1951 5 2894 2016 5 2894 2894 5
2894 2894 5 2894 2894 5 2894 
# 2895
a languag for formal problem specif a languag for specifi
the in tend behavior of commun parallel process is describ
the specif ar constrain ts on the order in which
event of a comput can occur the languag is us
to write specif of the reader writer problem and the
writer prioriti of the second reader writer problem cacm decemb
1977 greif i formal specif program correct parallel process synchron
reader writer problem 4 22 4 32 5 24 ca771205
dmm decemb 22 1977 12 44 pm 2320 4 2895
2597 4 2895 2777 4 2895 2851 4 2895 2895
4 2895 2895 4 2895 2912 4 2895 2946 4
2895 3128 4 2895 2150 5 2895 2618 5 2895
2895 5 2895 2895 5 2895 2895 5 2895 
# 2896
an exercis in prove parallel program correct a parallel program
dijkstra s on the fly garbag collector is prove correct
us a proof method develop by owicki the fine degre
of in terleav in thi program make it especi difficult
to understand and complic the proof greatli difficulti with prove
such parallel program correct ar discuss cacm decemb 1977 gri
d garbag collect multiprocess program correct for multiprocess task 4
32 4 34 4 35 4 39 5 24 ca771204
jb februari 1 1980 3 37 am 2021 4 2896
2222 4 2896 2227 4 2896 2315 4 2896 2326
4 2896 2470 4 2896 2732 4 2896 2838 4
2896 2865 4 2896 2896 4 2896 2896 4 2896
2896 4 2896 2943 4 2896 2972 4 2896 3014
4 2896 3037 4 2896 3039 4 2896 3039 4
2896 3043 4 2896 3068 4 2896 3073 4 2896
3074 4 2896 3077 4 2896 3112 4 2896 3143
4 2896 1834 5 2896 2723 5 2896 2732 5
2896 2896 5 2896 2896 5 2896 2896 5 2896
3039 5 2896 2723 6 2896 2732 6 2896 2896
6 2896 
# 2897
a case studi of a new code gener techniqu for
compil recent develop in optim techniqu have allow a new
design for compil to emerg such a compil translat the
pars sourc code into lower level code by a sequenc
of step each step expand higher level statement into block
of lower level code and then perform optim on the
result each statement ha onli on possibl expans the task
of tailor thi code to take advantag of ani special
case is done by the optim thi paper provid evid
that thi strategi can inde result in good object code
the tradition difficult pl i concaten statement wa investig as
a detail exampl a set of fairli simpl optim wa
identifi which allow the compil to produc good code more
elabor optim can further improv the object code for most
context of the concaten statement the code produc by a
compil us the expans optim strategi describ abov compar favor
with the code produc by a convent pl i optim
compil cacm decemb 1977 carter j l compil structur optim
compil code gener pl i compil concaten program optim optim
techniqu data flow analysi 4 12 4 13 4 22
ca771203 jb februari 1 1980 3 54 am 2897 5
2897 2897 5 2897 2897 5 2897 
# 2898
a conceptu framework for a nonprocedur program languag a sequenti
program languag forc the programm to prescrib explicitli the order
in which the oper in hi program have to be
execut even if the order is not relev to the
solut of hi problem the requir to indic irrelev sequenc
can be remov if the languag provid facil for specifi
a task in a nonprocedur manner in gener a program
specifi in thi wai will allow concurr evalu thi paper
describ a conceptu framework for a high level program languag
provid both nonprocedur and sequenti facil within a program nonprocedur
and sequenti program modul mai be nest freeli cacm decemb
1977 kessel j l w parallel program descript program nonprocedur
program definit languag data flow program applic program 4 20
ca771202 jb februari 1 1980 4 05 am 2865 4
2898 2866 4 2898 2898 4 2898 2898 4 2898
2972 4 2898 3043 4 2898 3128 4 2898 3144
4 2898 2597 5 2898 2898 5 2898 2898 5
2898 2898 5 2898 2946 5 2898 
# 2899
a survei of comput scienc offer in small liber art
colleg recent curricular develop in comput scienc togeth with student
in terest in pursu topic in comput scienc beyond the
usual program cours have encourag small liber art colleg to
expand their offer thi paper summar the result of a
survei taken to determin the type of comput scienc program
be offer in these colleg the result indic that over
half of these colleg either have no comput scienc program
or offer onli program cours cacm decemb 1977 lopez a
a raymond r tardiff r comput scienc educ curricula small
colleg 1 5 ca771201 jb decemb 22 1977 5 53
pm 1720 4 2899 1927 4 2899 2147 4 2899
2163 4 2899 2345 4 2899 2478 4 2899 2594
4 2899 2852 4 2899 2899 4 2899 2899 4
2899 3003 4 2899 3130 4 2899 1771 5 2899
2538 5 2899 2899 5 2899 2899 5 2899 2899
5 2899 
# 2900
some theorem to aid in solv the file alloc problem
the file alloc problem i e the problem of find
the optim set of network site at which to locat
copi of a file is known to be in gener
polynomi complet heurist and other aid to find optim or
near optim solut ar therefor much need in thi paper
we present three theorem which can be appli a priori
to indic that certain site should or should not be
includ in an optim alloc cacm novemb 1977 grapa e
belford g g file alloc comput network distribut data manag
4 33 ca771116 jb decemb 27 1977 8 45 am
2900 5 2900 2900 5 2900 2900 5 2900 
# 2901
an encod method for multifield sort and index sequenc of
charact string with an order relat impos between sequenc ar
consid an encod scheme is describ which produc a singl
order preserv string from a sequenc of string the origin
sequenc can be recov from the encod string and on
sequenc of string preced anoth if and onli if the
encod of the first preced the encod of the second
the string mai be variabl length without a maximum length
restrict and no symbol need be reserv for control purpos
henc ani symbol mai occur in ani string the scheme
is us for multifield sort multifield index and other applic
where order on more than on field is import cacm
novemb 1977 blasgen m w casei r g eswaran k
p sort multifield index lexicograph order search encod 3 74
4 19 4 33 4 40 5 31 ca771115 jb
decemb 27 1977 5 55 am 2140 4 2901 2155
4 2901 2406 4 2901 2452 4 2901 2710 4
2901 2710 4 2901 2715 4 2901 2716 4 2901
2716 4 2901 2717 4 2901 2718 4 2901 2765
4 2901 2765 4 2901 2817 4 2901 2888 4
2901 2901 4 2901 2901 4 2901 2901 4 2901
2957 4 2901 2959 4 2901 2965 4 2901 3087
4 2901 3134 4 2901 3154 4 2901 1976 5
2901 2046 5 2901 2715 5 2901 2901 5 2901
2901 5 2901 2901 5 2901 
# 2902
dynam memori alloc in comput simul thi paper investig the
perform of 35 dynam memori alloc algorithm when us to
servic simul program as repres by 18 test case algorithm
perform wa measur in term of process time memori usag
and extern memori fragment algorithm main tain separ free space
list for each size of memori block us tend to
perform quit well compar with other algorithm simpl algorithm oper
on memori order list without ani free list perform surprisingli
well algorithm emploi power of two block size had favor
process requir but gener unfavor memori usag algorithm emploi lifo
fifo or memori order free list gener perform poorli compar
with other cacm novemb 1977 nielsen n r algorithm perform
dynam memori alloc dynam memori manag dynam storag alloc garbag
collect list process memori alloc memori manag program techniqu simul
simul memori manag simul techniqu space alloc storag alloc 3
74 4 49 5 25 8 1 ca771114 jb decemb
27 1977 6 09 am 1211 4 2902 1211 4
2902 1389 4 2902 1549 4 2902 1552 4 2902
1906 4 2902 2095 4 2902 2162 4 2902 2218
4 2902 2435 4 2902 2498 4 2902 2596 4
2902 2596 4 2902 2596 4 2902 2704 4 2902
2734 4 2902 2747 4 2902 2768 4 2902 2768
4 2902 2773 4 2902 2845 4 2902 2845 4
2902 2845 4 2902 2845 4 2902 2902 4 2902
2902 4 2902 2902 4 2902 2902 4 2902 2902
4 2902 2902 4 2902 2902 4 2902 2902 4
2902 2902 4 2902 2902 4 2902 2902 4 2902
2911 4 2902 2911 4 2902 2911 4 2902 2955
4 2902 2955 4 2902 2955 4 2902 2955 4
2902 2983 4 2902 3000 4 2902 1051 5 2902
1062 5 2902 1184 5 2902 1211 5 2902 1552
5 2902 1879 5 2902 2435 5 2902 2596 5
2902 2734 5 2902 2747 5 2902 2768 5 2902
2902 5 2902 2902 5 2902 2902 5 2902 
# 2903
improv program by the introduct of recurs a new techniqu
of program transform call recurs in troduct is describ and
appli to two algorithm which solv pattern match problem by
us recurs in troduct algorithm which manipul a stack ar
first translat into recurs algorithm in which no stack oper
occur these algorithm ar then subject to a second transform
a method of recurs elimin call tabul to produc program
with a veri effici run time in particular it is
shown how the fast linear pattern match algorithm of knuth
morri and pratt can be deriv in a few step
from a simpl nonlinear stack algorithm cacm novemb 1977 bird
r s program transform optim of program recurs elimin pattern
match algorithm stack comput induct 4 0 4 2 5
20 5 24 5 25 ca771113 jb decemb 27 1977
6 29 am 2326 4 2903 2457 4 2903 2842
4 2903 2903 4 2903 2192 5 2903 2903 5
2903 2903 5 2903 2903 5 2903 
# 2904
an algorithm for reduct of oper strength a simpl algorithm
which us an index temporari tabl to perform reduct of
oper strength in strongli connect region is present sever extens
includ linear function test replac ar discuss these algorithm should
fit well into an integr packag of local optim algorithm
cacm novemb 1977 cock j compil optim of compil code
program analysi oper strength reduct test replac strongli connect region
4 12 5 24 5 32 ca771112 jb decemb 27
1977 6 34 am 2904 5 2904 2904 5 2904
2904 5 2904 
# 2905
perfect hash function a singl probe retriev method for static
set a refin of hash which allow retriev of an
item in a static tabl with a singl probe is
consid given a set i of identifi two method ar
present for build in a mechan wai perfect hash function
i e function transform the element of i into uniqu
address the first method the quotient reduct method is shown
to be complet in the sens that for everi set
i the smallest tabl in which the element of i
can be store and from which thei can be retriev
by us a perfect hash function construct by thi method
can be found howev for nonuniformli distribut set thi method
can give rather spars tabl the second method the remaind
reduct method is not complet in the abov sens but
it seem to give minim or almost minim tabl for
everi kind of set the two techniqu ar applic directli
to small set some method to extend these result to
larger set ar also present a rough comparison with ordinari
hash is given which show that thi method can be
us conveni in sever practic applic cacm novemb 1977 sprugnoli
r hash hash method hash code direct address identifi to
address transform perfect hash function perfect hash code reduct scatter
storag 3 7 3 74 4 34 ca771111 jb decemb
27 1977 6 45 am 2905 4 2905 2905 5
2905 2905 5 2905 2905 5 2905 3041 5 2905
3126 5 2905 3176 5 2905 829 5 2905 2846
6 2905 2905 6 2905 2905 6 2905 2905 6
2905 
# 2906
a veri high level program languag for data process applic
applic develop todai is too labor in tensiv in recent
year veri high level languag have been increasingli explor as
a solut to thi problem the busi definit languag bdl
is such a languag on aim at busi data process
problem the concept in bdl mimic those which have evolv
through the year in busi us manual method thi result
in three differ sublanguag or compon on for defin the
busi form on for describ the busi organ and on
for write calcul cacm novemb 1977 hammer m ow w
g kruskal v j wladawski i veri high level languag
nonprocedur languag data flow languag busi applic busi data process
structur program modular program format specif and design methodolog 3
50 4 22 4 32 ca771110 jb decemb 27 1977
7 06 am 1135 4 2906 1136 4 2906 493
4 2906 2710 4 2906 2765 4 2906 2888 4
2906 2906 4 2906 729 4 2906 2906 5 2906
2906 5 2906 2906 5 2906 616 5 2906 
# 2907
the optim approach to recurs program the classic fix poin
t approach toward recurs program suggest choos the least defin
fix poin t as the most appropri solut to a
recurs program a new approach is describ which in troduct
an optim fix point which in contrast to the least
defin fix poin t embodi the maxim amount of valuabl
inform embed in the program the practic implic of thi
approach ar discuss and techniqu for prove properti of optim
fix poin t ar given the present is inform with
emphasi on exampl cacm novemb 1977 manna z shamir a
recurs program fix poin ts least fixedpoint optim fix poin
ts proof techniqu 5 24 ca771109 jb decemb 27 1977
7 13 am 2907 5 2907 2907 5 2907 2907
5 2907 
# 2908
a note on reflect free permut enumer cacm novemb 1977
roi m k permut reflect free gener 5 30 ca771108
jb decemb 27 1977 7 17 am 2044 4 2908
2189 4 2908 2417 4 2908 2505 4 2908 2874
4 2908 2908 4 2908 2908 4 2908 2908 4
2908 3115 4 2908 2505 5 2908 2884 5 2908
2908 5 2908 2908 5 2908 2908 5 2908 521
5 2908 
# 2909
what can we do about the unnecessari divers of notat
for syntact definit cacm novemb 1977 wirth n syntact descript
languag extend bnf 4 20 ca771107 jb decemb 27 1977
7 20 am 2909 5 2909 2909 5 2909 2909
5 2909 
# 2910
equival of hough curv detect to templat match cacm novemb
1977 stockman g c pictur process pattern recognit curv detect
hough transform templat match 3 63 6 9 ca771106 jb
decemb 27 1977 7 23 am 2788 4 2910 2910
4 2910 2910 4 2910 2400 5 2910 2788 5
2910 2910 5 2910 2910 5 2910 2910 5 2910
# 2911
anomal behavior of the fifti percent rule in dynam memori
alloc thi paper report simul data show that in dynam
memori alloc the averag free to alloc block ratio can
differ consider and in both direct from the predict of
the 50 percent rule a new deriv is given and
it is shown that previou deriv make an assumpt that
mai be violat frequent on the basi of the simul
data and the deriv it is hypothes that the anomal
behavior result from the combin effect of systemat placement and
the statist of the releas process addit simul support thi
hypothesi systemat placement which refer to the natur convent of
alwai alloc storag request against the same end of the
free block select by the alloc strategi tend to order
block within contigu group accord to their alloc time the
degre of anomal behavior depend on the extent to which
alloc block ar releas in the order of their alloc
for non markovian releas process the extent of the correl
between alloc order and releas order vari approxim invers with
the coeffici of variat of the memori resid time distribut
the simul show that alloc effici depend strongli on the
resid time distribut effici decreas as the distribut s coeffici
of variat increas some practic implic ar briefli discuss cacm
novemb 1977 shore j e dynam memori alloc storag fragment
fifti percent rule first fit simul 3 73 4 32
4 34 4 35 ca771105 jb decemb 27 1977 7
37 am 2095 4 2911 2218 4 2911 2498 4
2911 2596 4 2911 2596 4 2911 2734 4 2911
2747 4 2911 2768 4 2911 2845 4 2911 2902
4 2911 2902 4 2911 2902 4 2911 2911 4
2911 2911 4 2911 2911 4 2911 2911 4 2911
2911 4 2911 2911 4 2911 2911 4 2911 2955
4 2911 2955 4 2911 2983 4 2911 3000 4
2911 972 4 2911 273 5 2911 1879 5 2911
2435 5 2911 2498 5 2911 2734 5 2911 2773
5 2911 2911 5 2911 2911 5 2911 2911 5
2911 2983 5 2911 
# 2912
concurr read and write the problem of share data among
asynchron process is consid it is assum that onli on
process at a time can modifi the data but concurr
read and write is permit two gener theorem ar prove
and some algorithm ar present to illustr their us these
includ a solut to the gener problem in which a
read is repeat if it might have obtain an incorrect
result and two techniqu for transmit messag between process these
solut do not assum ani synchron mechan other than data
which can be written by on process and read by
other process cacm novemb 1977 lamport l asynchron multiprocess multiprocess
synchron reader writer problem share data 4 32 5 24
ca771104 jb decemb 27 1977 7 47 am 2320 4
2912 2597 4 2912 2777 4 2912 2851 4 2912
2895 4 2912 2912 4 2912 2946 4 2912 3128
4 2912 2150 5 2912 2912 5 2912 2912 5
2912 2912 5 2912 3128 5 2912 2150 6 2912
2376 6 2912 2436 6 2912 2597 6 2912 2865
6 2912 2866 6 2912 2870 6 2912 2912 6
2912 3082 6 2912 
# 2913
the alias problem in comput gener shade imag certain defect
such as jag edg and disappear detail have long been
an annoy in digit gener shade imag although increas the
resolut or defocus the displai can attenu them an understand
of these defect lead to more effect method thi paper
explain the observ defect in term of the alias phenomenon
inher in sampl signal and discuss prefilt as a recogn
cure a method for evalu filter is present the applic
of prefilt to hidden surfac algorithm is discuss and an
implement of a filter tiler is shown accompani by exampl
of it effect cacm novemb 1977 crow f c alias
comput graphic convolut filter hidden surfac remov sampl 8 2
ca771103 jb decemb 27 1977 7 56 am 2816 4
2913 2828 4 2913 2827 4 2913 2913 4 2913
3047 4 2913 2751 5 2913 2913 5 2913 2913
5 2913 2913 5 2913 
# 2914
us of the lru stack depth distribut for simul of
page behavior two famili of probabl distribut were need for
us by a virtual memori simul model headwai between page
fault distribut and work set size distribut all member of
both famili can be deriv from the lru stack depth
distribut simpl express for the comput of both kind of
distribut ar given final exampl ar given of both famili
of distribut as comput from a publish stack depth distribut
cacm novemb 1977 turner r strecker b virtual memori page
lru stack work set headwai between page fault comput system
simul 4 35 4 6 8 1 ca771102 jb decemb
27 1977 8 04 am 2914 5 2914 2914 5
2914 2914 5 2914 
# 2915
consider for futur program languag standard activ thi paper review
the current state of program languag standard activ with respect
to the anomali which exist between the variou publish and
propos standard for fortran cobol pl i and basic propos
ar made for the inclus of formal within futur standard
and the extens of the standard to includ addit item
such as error condit and document cacm novemb 1977 lee
j a n program languag standard formal formal descript fortran
cobol pl i basic vienna definit languag vdl 2 4
4 2 4 29 4 6 5 23 ca771101 jb
decemb 27 1977 8 10 am 2154 4 2915 2299
4 2915 2501 4 2915 2629 4 2915 2915 4
2915 2915 4 2915 3060 4 2915 3114 4 2915
1502 5 2915 1900 5 2915 2915 5 2915 2915
5 2915 2915 5 2915 
# 2916
a fast string search algorithm an algorithm is present that
search for the locat i of the first occurr of
a charact string pat in anoth string string dure the
search oper the charact of pat ar match start with
the last charact of pat the inform gain by start
the match at the end of the pattern often allow
the algorithm to proce in larg jump through the text
be search thu the algorithm ha the unusu properti that
in most case not all of the first i charact
of string ar inspect the number of charact actual inspect
on the averag decreas as a function of the length
of pat for a random english pattern of length 5
the algorithm will typic inspect i 4 charact of string
befor find a match at i furthermor the algorithm ha
been implement so that on the averag fewer than i
patlen machin instruct ar execut these conclus ar support with
empir evid and a theoret analysi of the averag behavior
of the algorithm the worst case behavior of the algorithm
is linear in i patlen assum the avail of arrai
space for tabl linear in patlen plu the size of
the alphabet cacm octob 1977 boyer r s bibliograph search
comput complex inform retriev linear time bound pattern match text
edit 3 74 4 40 5 25 ca771010 jb decemb
27 1977 9 43 am 2916 4 2916 2746 5
2916 2916 5 2916 2916 5 2916 2916 5 2916
3162 5 2916 2916 6 2916 
# 2917
sitar an interact text process system for small comput corrigendum
cacm octob 1977 schneider b r jr watt r m
ca771009 jb decemb 28 1977 5 58 am 2917 5
2917 2917 5 2917 2917 5 2917 
# 2918
multiprocessor memori organ and memori interfer the structur of share
memori in a multiprocessor comput system is examin with particular
attent to nonin terleav memori altern memori organ ar compar
and it is shown that a home memori organ in
which each processor is associ with on or more memori
in which it address space is concentr is quit effect
in reduc memori in terfer home memori organ is shown
to be particularli suit to certain special comput problem as
well as to possess advantag in term of in terfer
and reliabl for gener purpos comput result for in terleav
memori ar drawn from previou work and ar us for
comparison trace driven simul ar us to verifi the conclus
of the analysi cacm octob 1977 smith a j memori
in terfer interleav multiprocess trace driven simul queue theori share
memori 4 30 4 32 6 34 ca771008 jb decemb
27 1977 10 28 am 2918 4 2918 3119 4
2918 2859 5 2918 2918 5 2918 2918 5 2918
2918 5 2918 
# 2919
the programm s workbench a machin for softwar develop on
almost all softwar develop project the assumpt is made that
the program develop function will be done on the same
machin on which the eventu system will run it is
onli when thi product machin is unavail or when it
program environ is total inadequ that altern ar consid in
thi paper it is suggest that there ar mani other
situat where it would be advantag to separ the program
develop and main tenanc function onto a special comput which
is dedic to that purpos such a comput is here
call a programm s workbench the four basic section of
the paper in troduc the subject outlin the gener concept
discuss area where such an approach mai prove benefici and
describ an oper system util thi concept cacm octob 1977
ivi e l comput configur comput network softwar develop softwar
engin softwar main tenanc unix 3 2 3 5 3
7 3 8 4 0 ca771007 jb decemb 27 1977
10 37 am 2626 4 2919 2786 4 2919 2840
4 2919 2919 4 2919 2919 4 2919 2919 4
2919 3017 4 2919 3110 4 2919 3174 4 2919
2536 5 2919 2593 5 2919 2629 5 2919 2919
5 2919 2919 5 2919 2919 5 2919 
# 2920
game interpret of the deadlock avoid problem the deadlock avoid
problem mai be defin inform as the determin from some
a priori inform about the process resourc oper system etc
of the safe situat which mai be realiz without endang
the smooth run of the system when each process specifi
it futur need by a flowchart of need defin step
a global approach to the phenomenon and it in terpret
as a game between the oper system and the process
allow formal of risk and safeti concept the bipartit graph
represent of thi game mai then be us to construct
explicitli the set of safe state and to studi their
properti cacm octob 1977 devil r oper system multiprogram time
share resourc alloc deadlock in terlock deadli embrac deadlock avoid
flowchart 4 30 4 32 ca771006 jb decemb 27 1977
10 50 am 2228 4 2920 2280 4 2920 2379
4 2920 2482 4 2920 2740 4 2920 2851 4
2920 2920 4 2920 1877 5 2920 2920 5 2920
2920 5 2920 2920 5 2920 
# 2921
regular right part grammar and their parser thi paper in
troduc an altern to context free grammar call regular right
part rrp grammar which resembl pascal syntax diagram formal rrp
grammar have product right part which ar nondeterminist finit state
machin fsm and as a special case regular express sinc
these can be convert to fsm rrp grammar describ the
syntax of program languag more concis and more understand than
is possibl with cf grammar also in troduc is a
class of parser rrp lr m k parser which includ
the cf lr k parser and provid the same advantag
inform an rrp lr m k parser can determin the
right end of each handl by consid at most k
symbol to the right of the handl and the left
end after the right end ha been found by consid
at most m symbol to the left of the handl
a mechan for determin the left end is requir becaus
there is no bound on the length of the handl
cacm octob 1977 lalond w r finit state machin automata
regular express syntax diagram lr k grammar parser construct pars
program languag languag gener formal definit compil translat scanner 4
2 5 21 5 23 ca771005 jb decemb 27 1977
11 01 am 1989 4 2921 2060 4 2921 2179
4 2921 2581 4 2921 2698 4 2921 2739 4
2921 2795 4 2921 2921 4 2921 2921 4 2921
3087 4 2921 3154 4 2921 1989 5 2921 2110
5 2921 2921 5 2921 2921 5 2921 2921 5
2921 
# 2922
two level control structur for nondeterminist program the basic idea
of nondeterminist program ar critic reconsid to singl out a
proper attitud and program style for languag allow direct control
of nondeterminist featur the propos attitud aim at retain the
puriti of the nondeterminist formul of search process on on
level the attempt level defer the coordin of problem solv
effort to anoth the choic level the feasibl of recogn
these two level is discuss stress that the structur to
be manag at the choic level is a free of
context the leav ar comput environ each hold an altern
under inspect while the other node ar associ with choic
poin ts accord to the propos program style a gener
function is associ with each choic poin t which express
the desir choic strategi the main advantag on thi approach
is the local of the search strategi each nontermin node
of the tree keep track of the state of the
comput as it wa when the choic poin t wa
last interrog hold at the same time the strategi to
coordin the avail altern exampl ar given in term of
nd lisp an extens of lisp design and implement accord
to these guidelin cacm octob 1977 montangero c pacini g
turini f nondeterminist program artifici in tellig control structur backtrack
search strategi plan context tree 3 64 4 22 ca771004
jb decemb 27 1977 11 30 am 2625 4 2922
2922 4 2922 3081 4 2922 3101 4 2922 3112
4 2922 2438 5 2922 2922 5 2922 2922 5
2922 2922 5 2922 
# 2923
high level data flow analysi in contrast to the predomin
us of low level in termedi text high level data
flow analysi deal with program essenti at sourc level and
exploit the control flow inform implicit in the pars tree
the need for high level flow analysi aris from sever
aspect of recent work on advanc method of program certif
and optim thi paper propos a simpl gener method of
high level data flow analysi that allow free us of
escap and jump statement avoid larg graph when compil larg
program facilit updat of data flow inform to reflect program
chang and deriv new global inform help in solv mani
familiar global flow analysi problem an illustr applic to live
variabl analysi is present mani of the graph involv ar
construct and analyz befor ani program ar compil thu avoid
certain cost that low level method incur repeatedli at compil
time cacm octob 1977 rosen b k data flow analysi
high level languag control flow graph structur program escap exit
jump goto statement 5 24 4 12 4 22 ca771003
jb decemb 27 1977 11 41 am 1807 4 2923
2034 4 2923 2290 4 2923 2579 4 2923 2579
4 2923 2923 4 2923 2923 4 2923 2945 4
2923 1807 5 2923 1947 5 2923 2923 5 2923
2923 5 2923 2923 5 2923 
# 2924
an interact comput graphic approach to surfac represent an in
teract comput graphic method ha been develop for the rapid
gener of arbitrari shape three dimension surfac the method is
a synthesi of spline theori and algorithm an in teract
mean for man machin commun and softwar for static or
dynam graphic displai the basic techniqu emploi is a modifi
loft method on which section curv ar repres by uniform
b spline and the surfac is in terpol between section
by cardin spline among the featur of thi method ar
algorithm which enabl in teract modif of the b spline
represent of the section curv at all stage of the
process the spatial inform is graphic displai to the user
complex surfac can be creat by the combin of a
number of shape that have been separ gener and automat
join the system ha been successfulli in terfac to a
varieti of analyt routin for structur medic and graphic applic
cacm octob 1977 wu sheng chuan abel j f greenberg
d p comput graphic three dimension surfac represent spline loft
finit element input method 3 20 3 23 3 34
8 1 8 2 ca771002 jb decemb 27 1977 11
53 am 2924 5 2924 2924 5 2924 2924 5
2924 
# 2925
optim surfac reconstruct from planar contour in mani scientif and
technic endeavor a three dimension solid must be reconstruct from
serial section either to aid in the comprehens of the
object s structur or to facilit it automat manipul and
analysi thi paper present a gener solut to the problem
of construct a surfac over a set of cross section
contour thi surfac to be compos of triangular tile is
construct by separ determin an optim surfac between each pair
of consecut contour determin such a surfac is reduc to
the problem of find certain minimum cost cycl in a
direct toroid graph a new fast algorithm for find such
cycl is util also develop is a close form express
in term of the number of contour poin ts for
an upper bound on the number of oper requir to
execut the algorithm an illustr exampl which involv the construct
of a minimum area surfac describ a human head is
includ cacm octob 1977 fuch h kedem z m uselton
s p surfac reconstruct contour data serial section three dimension
comput graphic minimum cost path continu tone displai 5 25
5 32 8 2 ca771001 jb decemb 27 1977 12
40 pm 2925 5 2925 2925 5 2925 2925 5
2925 
# 2926
pagin of b tree with variabl length record a strategi
is present for pagin of b tree with variabl length
record if record of each length ar uniformli distribut within
the file and if a wide distribut of record length
exist within the file then thi strategi result in shallow
tree with fast access time the perform of thi strategi
in an applic is present compar with that of anoth
strategi and analyz cacm septemb 1977 mccreight e m b
tree index databas tree storag structur search 3 73 4
33 4 34 ca770908 jb decemb 27 1977 12 46
pm 2926 5 2926 2926 5 2926 2926 5 2926
# 2927
some new upper bound on the gener of prime number
given an integ n what is the comput complex of
find all the prime less than n a modifi siev
of eratosthen us doubli link list yield an algorithm of
o n arithmet complex thi upper bound is shown to
be equival to the theoret lower bound for siev method
without preprocess us of preprocess techniqu involv space time and
addit multipl tradeoff reduc thi upper bound to o n
log logn and the bit complex to o n logn
log log logn a storag requir is describ us o
n logn log logn bit as well cacm septemb 1977
mairson h g comput complex siev prime number gener number
theori link list preprocess balanc 5 25 5 39 ca770907
jb decemb 27 1977 12 55 pm 1841 4 2927
1841 4 2927 1967 4 2927 2120 4 2927 2120
4 2927 2927 4 2927 2927 4 2927 2927 4
2927 2927 4 2927 2927 4 2927 1537 5 2927
1538 5 2927 1539 5 2927 1841 5 2927 1840
5 2927 2927 5 2927 2927 5 2927 2927 5
2927 3037 5 2927 2732 6 2927 2927 6 2927
# 2928
hardwar estim of a process primari memori requir a minor
hardwar extens to the honeywel 6180 processor is demonstr to
allow the primari memori requir of a process in multic
to be approxim the addit hardwar requir for thi estim
to be comput consist of a program access regist contain
the miss rate of the associ memori us for page
tabl word thi primari memori requir estim wa emploi in
an experiment version of multic to control the level of
multiprogram in the system and to bill for memori usag
the result system s tune paramet displai configur insensit and
it is conjectur that the system would also track shift
in the referenc characterist of it workload and keep the
system in tune cacm septemb 1977 giffor d k primari
memori requir virtual memori level of multiprogram associ memori work
set resourc alloc lru stack model referenc characterist 4 32
4 35 4 6 6 36 ca770906 jb decemb 27
1977 1 05 pm 1892 4 2928 1901 4 2928
2085 4 2928 2095 4 2928 2218 4 2928 2277
4 2928 2319 4 2928 2329 4 2928 2358 4
2928 2373 4 2928 2380 4 2928 2434 4 2928
2499 4 2928 2501 4 2928 2582 4 2928 2629
4 2928 2669 4 2928 2828 4 2928 2847 4
2928 2863 4 2928 2868 4 2928 2881 4 2928
2928 4 2928 2928 4 2928 2928 4 2928 2928
4 2928 2928 4 2928 2951 4 2928 2996 4
2928 3006 4 2928 3046 4 2928 3067 4 2928
3098 4 2928 3107 4 2928 3127 4 2928 1751
5 2928 2277 5 2928 2380 5 2928 2522 5
2928 2569 5 2928 2928 5 2928 2928 5 2928
2928 5 2928 
# 2929
an analysi of inlin substitut for a structur program languag
an optim techniqu known as inlin substitut is analyz the
optim consist of replac a procedur invoc by a modifi
copi of the procedur bodi the gener problem of us
inlin substitut to minim execut time subject to size constrain
ts is formul and an approxim algorithm solut is propos
the algorithm depend on run time statist about the program
to be optim preliminari result for the clu structur program
languag indic that in program with a low degre of
recurs over 90 percent of all procedur call can be
elimin with littl increas in the size of compil code
and a small save in execut time other conclus base
on these result ar also present cacm septemb 1977 scheifler
r w inlin substitut open code open compil program optim
compil structur program languag run time statist 4 12 ca770905
jb decemb 27 1977 1 23 pm 1086 4 2929
1132 4 2929 1234 4 2929 1263 4 2929 1265
4 2929 1270 4 2929 1323 4 2929 1358 4
2929 1379 4 2929 1380 4 2929 1453 4 2929
1464 4 2929 1484 4 2929 1491 4 2929 1498
4 2929 1613 4 2929 1614 4 2929 1781 4
2929 1825 4 2929 1860 4 2929 2083 4 2929
2178 4 2929 2179 4 2929 2252 4 2929 2325
4 2929 2341 4 2929 2546 4 2929 2645 4
2929 2652 4 2929 2684 4 2929 2842 4 2929
2929 4 2929 2934 4 2929 3069 4 2929 669
4 2929 679 4 2929 691 4 2929 761 4
2929 949 4 2929 989 4 2929 2929 5 2929
2929 5 2929 2929 5 2929 3184 5 2929 
# 2930
the gre advanc test in comput scienc thi report describ
the advanc test in comput scienc which wa recent in
troduc in the graduat record examin program the gre program
is describ in gener and the event lead to the
establish of the advanc comput scienc test ar discuss content
specif and their rational ar given a set of sampl
question is includ cacm septemb 1977 aust r h educ
comput scienc graduat school admiss test develop examin 1 5
ca770903 jb decemb 27 1977 1 32 pm 2930 5
2930 2930 5 2930 2930 5 2930 
# 2931
logic and program languag logic ha been long in terest
in whether answer to certain question ar comput in principl
sinc the outcom put bound on the possibl of formal
more recent precis comparison in the effici of decis method
have becom avail through the develop in complex theori these
howev ar applic to logic and a big question is
whether method of logic have signific in the other direct
for the more appli part of comput theori program languag
offer an obviou opportun as their syntact formal is well
advanc howev the semant theori can hardli be said to
be complet though we have mani exampl we have still
to give wide rang mathemat answer to these queri what
is a machin what is a comput process how or
how well doe a machin simul a process program natur
enter in give descript of process the definit of the
precis mean of a program then requir us to explain
what ar the object of comput in a wai the
static of the problem and how thei ar to be
transform the dynam so far the theori of automata and
of net though most in terest for dynam have formal
onli a portion of the field and there ha been
perhap too much concentr on the finit state and algebra
aspect it would seem that the understand of higher level
program featur involv us with infinit object and forc us
to pass through sever level of explan to go from
the conceptu idea to the final simul on a real
machin these level can be made mathemat exact if we
can find the right abstract to repres the necessari structur
the experi of mani independ worker with the method of
data type as lattic or partial order under an inform
content order and with their continu map ha demonstr the
flexibl of thi approach in provid definit and proof which
ar clean and without undu depend on implement nevertheless much
remain to be done in show how abstract conceptu can
or cannot be actual befor we can sai we have
a unifi theori cacm septemb 1977 scott d s logic
program languag automata denot semant a calculu model comput partial
function approxim function space 1 2 4 20 5 21
5 24 5 27 ca770902 jb decemb 28 1977 6
49 am 2931 5 2931 2931 5 2931 2931 5
2931 
# 2932
complex of comput the framework for research in the theori
of complex of comput is describ emphas the in terrel
between seemingli divers problem and method illustr exampl of practic
and theoret signific ar given direct for new research ar
discuss cacm septemb 1977 rabin m o complex of comput
algebra complex in tractabl problem probabilist algorithm 5 25 ca770901
jb decemb 28 1977 6 54 am 2932 5 2932
2932 5 2932 2932 5 2932 
# 2933
anoth advantag of keyword notat for paramet commun with subprogram
cacm august 1977 francez n keyword notat posit notat paramet
transmiss subprogram readabl call by valu call by refer call
by name compil time error 4 2 4 20 4
22 ca770810 jb decemb 28 1977 6 57 am 2757
4 2933 2933 4 2933 2933 4 2933 2630 5
2933 2757 5 2933 2933 5 2933 2933 5 2933
2933 5 2933 
# 2934
comment on comput the k shortest path in a graph
cacm august 1977 lawler e l graph network shortest path
algorithm rank 5 32 ca770809 jb decemb 28 1977 7
00 am 1086 4 2934 1132 4 2934 1234 4
2934 1263 4 2934 1265 4 2934 1270 4 2934
1323 4 2934 1358 4 2934 1379 4 2934 1380
4 2934 1453 4 2934 1464 4 2934 1484 4
2934 1491 4 2934 1498 4 2934 1613 4 2934
1614 4 2934 1781 4 2934 1825 4 2934 1860
4 2934 2083 4 2934 2178 4 2934 2179 4
2934 2252 4 2934 2325 4 2934 2341 4 2934
2546 4 2934 2645 4 2934 2652 4 2934 2684
4 2934 2842 4 2934 2929 4 2934 2934 4
2934 3069 4 2934 669 4 2934 679 4 2934
691 4 2934 761 4 2934 949 4 2934 989
4 2934 2934 5 2934 2934 5 2934 2934 5
2934 3184 5 2934 
# 2935
product and employ of ph s in comput scienc 1976
corrigendum cacm august 1977 taulbe o e cont s d
ca770808 jb decemb 28 1977 7 04 am 2935 5
2935 2935 5 2935 2935 5 2935 
# 2936
an effici data structur for the simul event set recent
algorithm have been present for the realiz of event schedul
routin suitabl for gener purpos discret event simul system sever
exhibit a perform superior to that of commonli us simpl
link list algorithm in thi paper a new event schedul
algorithm is present which improv on two aspect of the
best of the previous publish algorithm first the new algorithm
s perform is quit insensit to skew distribut and second
it worst case complex is o n where n is
the number of event in the set furthermor test conduct
to estim the averag complex show it to be nearli
independ of n cacm august 1977 franta w r mali
k simul time flow mechan event scan mechan multilink list
3 34 4 22 5 5 8 1 ca770807 jb
decemb 28 1977 7 15 am 2844 4 2936 2844
4 2936 2936 4 2936 2936 4 2936 3051 4
2936 3064 4 2936 3064 4 2936 3109 4 2936
2742 5 2936 2767 5 2936 2936 5 2936 2936
5 2936 2936 5 2936 3064 5 2936 1846 6
2936 1939 6 2936 2742 6 2936 2767 6 2936
2936 6 2936 
# 2937
an experiment evalu of data type convent the languag in
which program ar written can have a substanti effect on
the reliabl of the result program thi paper discuss an
experi that compar the program reliabl of subject us a
static type languag and a typeless languag analysi of the
number of error and the number of run contain error
show that at least in on environ the us of
a static type languag can increas program reliabl detail analysi
of the error made by the subject in program solut
to reason small problem show that the subject had difficulti
manipul the represent of data cacm august 1977 gannon j
d data type experiment languag design redund reliabl softwar 4
22 ca770806jb decemb 28 1977 7 32 am 2411 4
2937 2709 4 2937 2889 4 2937 2937 4 2937
2989 4 2937 3005 4 2937 3025 4 2937 3101
4 2937 2138 5 2937 2937 5 2937 2937 5
2937 2937 5 2937 
# 2938
toward a disciplin of real time program program is divid
into three major categori with increas complex of reason in
program valid sequenti program multiprogram and real time program by
adher to a strict program disciplin and by us a
suitabl high level languag mold after thi disciplin the complex
of reason about concurr and execut time constrain ts mai
be drastic reduc thi mai be the onli practic wai
to make real time system analyt verifi and ultim reliabl
a possibl disciplin is outlin and express in term of
the languag modula cacm august 1977 wirth n multiprogram real
time program process synchron processor share program valid modula 3
80 4 22 ca770805 jb decemb 28 19777 39 am
2938 4 2938 2946 4 2938 3128 4 2938 2866
5 2938 2938 5 2938 2938 5 2938 2938 5
2938 
# 2939
abstract mechan in clu clu is a new program languag
design to support the us of abstract in program construct
work in program methodolog ha led to the realiz that
three kind of abstract procedur control and especi data abstract
ar us in the program process of these onli the
procedur abstract is support well by convent languag through the
procedur or subroutin clu provid in addit to procedur novel
linguist mechan that support the us of data and control
abstract thi paper provid an in troduct to the abstract
mechan in clu by mean of program exampl the util
of the three kind of abstract in program construct is
illustr and it is shown how clu program mai be
written to us and implement abstract the clu librari which
permit increment program develop with complet type check perform at
compil time is also discuss cacm august 1977 liskov b
snyder a atkinson r schaffert c program languag data type
data abstract control abstract program methodolog separ compil 4 0
4 12 4 20 4 22 ca770804 jb decemb 28
1977 7 49 am 2319 4 2939 2480 4 2939
2594 4 2939 2709 4 2939 2868 4 2939 2939
4 2939 2939 4 2939 2941 4 2939 2972 4
2939 3155 4 2939 2204 5 2939 2558 5 2939
2939 5 2939 2939 5 2939 2939 5 2939 3031
5 2939 3105 5 2939 3148 5 2939 3150 5
2939 1471 6 2939 1860 6 2939 2060 6 2939
2625 6 2939 2632 6 2939 2704 6 2939 2817
6 2939 2842 6 2939 2865 6 2939 2868 6
2939 2939 6 2939 2939 6 2939 2939 6 2939
2939 6 2939 2940 6 2939 2941 6 2939 2943
6 2939 2958 6 2939 3068 6 2939 3073 6
2939 3073 6 2939 3148 6 2939 
# 2940
abstract and verif in alphard defin and specifi iter and
gener the alphard form provid the programm with a great
deal of control over the implement of abstract data type
in thi paper the abstract techniqu ar extend from simpl
data represent and function definit to the iter statement the
most import poin t of interact between data and the
control structur of the languag itself a mean of special
alphard s loop to oper on abstract entiti without explicit
depend on the represent of those entiti is in troduc
specif and verif techniqu that allow the properti of the
gener for such iter to be express in the form
of proof rule ar develop result ar obtain that for
common special case of these loop ar essenti ident to
the correspond construct in other languag a mean of show
that a gener will termin is also provid cacm august
1977 shaw m wulf w a abstract and represent abstract
data type assert control special correct gener invari iter statement
modular decomposit program specif program languag program methodolog proof of
correct type verif 4 20 5 24 ca770803 jb decemb
28 1977 7 59 am 2940 5 2940 2940 5
2940 2940 5 2940 3150 5 2940 2060 6 2940
2704 6 2940 2842 6 2940 2939 6 2940 2940
6 2940 2941 6 2940 2943 6 2940 3073 6
2940 3148 6 2940 
# 2941
earli experi with mesa the experi of mesa s first
user primarili it implement ar discuss and some implic for
mesa and similar program languag ar suggest the specif topic
address ar modul structur and it us in defin abstract
data structur facil in mesa an equival algorithm for type
and type coercion the benefit of the type system and
why it is breach occasion and the difficulti of make
the treatment of variant record safe cacm august 1977 geschk
c m morri j h jr satterthwait e h program
languag type modul data structur system program 4 22 ca770802
jb decemb 28 1977 8 07 am 1458 4 2941
1523 4 2941 1603 4 2941 1698 4 2941 1747
4 2941 1748 4 2941 1854 4 2941 1877 4
2941 1960 4 2941 2377 4 2941 2378 4 2941
2497 4 2941 2558 4 2941 2625 4 2941 2632
4 2941 2704 4 2941 2723 4 2941 2738 4
2941 2840 4 2941 2866 4 2941 2868 4 2941
2869 4 2941 2939 4 2941 2941 4 2941 2941
4 2941 2941 4 2941 2941 4 2941 2956 4
2941 2958 4 2941 3004 4 2941 3030 4 2941
3030 4 2941 3105 4 2941 3144 4 2941 1471
5 2941 2356 5 2941 2558 5 2941 2651 5
2941 2941 5 2941 2941 5 2941 2941 5 2941
3150 5 2941 2060 6 2941 2704 6 2941 2842
6 2941 2939 6 2941 2940 6 2941 2941 6
2941 2943 6 2941 3073 6 2941 3148 6 2941
# 2942
an algol base implement of snobol 4 pattern cacm juli
1977 brownle j n pattern snobol 4 pattern match string
process pattern implement algorithm in pascal 4 29 ca770710 jb
decemb 28 1977 8 15 am 2942 5 2942 2942
5 2942 2942 5 2942 
# 2943
lucid a nonprocedur languag with iter lucid is a formal
system in which program can be written and proof of
program carri out the proof ar particularli easi to follow
and straightforward to produc becaus the statement in a lucid
program ar simpli axiom from which the proof proce by
almost convent logic reason with the help of a few
axiom and rule of infer for the special lucid function
as a program languag lucid is unconvent becaus among other
thing the order of statement is irrelev and assign statement
ar equat nevertheless lucid program need not look much differ
than iter program in a convent structur program languag us
assign and condit statement and loop cacm juli 1977 ashcrof
e a wadg w w program prove formal system semant
iter structur program 5 21 5 24 ca770709 jb decemb
28 1977 8 30 am 2021 4 2943 2222 4
2943 2227 4 2943 2315 4 2943 2326 4 2943
2470 4 2943 2732 4 2943 2865 4 2943 2896
4 2943 2943 4 2943 3014 4 2943 3068 4
2943 3077 4 2943 3143 4 2943 1834 5 2943
2943 5 2943 2943 5 2943 2943 5 2943 3150
5 2943 2060 6 2943 2704 6 2943 2842 6
2943 2939 6 2943 2940 6 2943 2941 6 2943
2943 6 2943 3073 6 2943 3148 6 2943 
# 2944
shift garbag collect overhead to compil time thi paper discuss
techniqu which enabl automat storag reclam overhead to be partial
shift to compil time the paper assum a transact orient
collect scheme as propos by deutsch and bobrow the necessari
featur of which ar summar implement the describ optim requir
global flow analysi to be perform on the sourc program
it is shown that at compil time certain program action
that affect the refer count of cell can be deduc
thi inform is us to find action that cancel when
the code is execut and those that can be group
to achiev improv effici cacm juli 1977 barth j m
garbag collect global flow analysi list process optim refer count
storag manag 3 80 4 12 4 20 4 34
ca770708 jb decemb 28 1977 8 38 am 2855 4
2944 2855 4 2944 2944 4 2944 2944 4 2944
3106 4 2944 3112 4 2944 2833 5 2944 2944
5 2944 2944 5 2944 2944 5 2944 2998 5
2944 
# 2945
certif of program for secur inform flow thi paper present
a certif mechan for verifi the secur flow of inform
through a program becaus it exploit the properti of a
lattic structur among secur class the procedur is suffici simpl
that it can easili be includ in the analysi phase
of most exist compil appropri semant ar present and prove
correct an import applic is the confin problem the mechan
can prove that a program cannot caus supposedli nonconfidenti result
to depend on confidenti input data cacm juli 1977 den
d e den p j protect secur inform flow program
certif lattic confin secur class 4 3 4 35 5
24 ca770707 jb decemb 28 1977 8 48 am 1807
4 2945 2034 4 2945 2290 4 2945 2579 4
2945 2923 4 2945 2945 4 2945 2945 4 2945
2945 4 2945 3128 4 2945 3150 4 2945 1947
5 2945 2704 5 2945 2870 5 2945 2945 5
2945 2945 5 2945 2945 5 2945 
# 2946
an altern to event queue for synchron in monitor in
the monitor concept as propos by brinch hansen and hoar
event ar us for synchron thi paper describ anoth synchron
primit which is nearli as express as the condit wait
but can be implement more effici an implement of thi
primit in term of p and v oper is given
togeth with a correct proof two exampl ar present the
reader and writer problem and the problem of inform stream
share a finit buffer pool cacm juli 1977 kessel j
l w monitor oper system mutual exclus synchron condit critic
region structur concept 4 31 ca770706 jb decemb 28 1977
10 10 am 2320 4 2946 2597 4 2946 2777
4 2946 2851 4 2946 2895 4 2946 2912 4
2946 2938 4 2946 2946 4 2946 2946 4 2946
3128 4 2946 3128 4 2946 2150 5 2946 2866
5 2946 2898 5 2946 2946 5 2946 2946 5
2946 2946 5 2946 2597 6 2946 2946 6 2946
# 2947
sitar an interact text process system for small comput sitar
a low cost in teract text handl and text analysi
system for nontechn user is in mani wai compar to
in teract bibliograph search and retriev system but ha sever
addit featur it is implement on a pdp 11 time
share comput invok by a crt with microprogram edit function
it us a simpl command languag design a function a
file and a search templat consist of the textual string
desir and string delimit the context in which the hit
is to be deliv extens experi with sitar show that
the combin power of simpl command string orient circular file
structur a crt with local memori and convers comput produc
a system much more power than the sum of it
part cacm juli 1977 schneider b r jr watt r
m inform retriev text edit minicomput crt time share bibliograph
search and retriev literari analysi linguist analysi command languag 3
4 3 7 ca770705 jb decemb 28 1977 10 20
am 2947 5 2947 2947 5 2947 2947 5 2947
# 2948
a termin orient commun system thi paper describ a system
for full duplex commun between a time share comput and
it termin the system consist of a commun comput directli
connect to the time share system a number of small
remot comput to which the termin ar attach and connect
medium speed telephon line it can servic a larg number
of termin of variou type the overal system design is
present along with the algorithm us to solv three specif
problem local echo error detect and correct on the telephon
line and multiplex of charact output cacm juli 1977 heckel
p g lampson b w termin system error correct multiplex
local echo commun system network 3 81 4 31 ca770704
jb decemb 28 1977 11 49 am 2948 5 2948
2948 5 2948 2948 5 2948 
# 2949
a correct proof of a topolog inform main tenanc protocol
for a distribut comput network in order for the node
of a distribut comput network to commun each node must
have inform about the network s topolog sinc node and
link sometim crash a scheme is need to updat thi
inform on of the major constrain ts on such a
topolog inform scheme is that it mai not involv a
central control the topolog inform protocol that wa implement on
the merit comput network is present and explain thi protocol
is quit gener and could be implement on ani comput
network it is base on baran s hot potato heurist
rout doctrin a correct proof of thi topolog inform protocol
is also present cacm juli 1977 tajibnapi w d distribut
comput network correct proof comput network distribut control network topolog
rout problem in network distribut oper system store and forward
packet switch store and forward messag switch traffic control 3
81 4 32 ca770703 jb decemb 28 1977 11 59
am 2949 5 2949 2949 5 2949 2949 5 2949
# 2950
a unifi approach to schedul thi paper present a scheme
for classifi schedul algorithm base on an abstract model of
a schedul system which formal the notion of prioriti variou
class of schedul algorithm ar defin and relat to exist
algorithm a criterion for the implement effici of an algorithm
is develop and result in the definit of time invari
algorithm which includ most of the commonli implement on for
time invari algorithm the depend of process rate on prioriti
is deriv the abstract model provid a framework for implement
flexibl schedul in real oper system the polici driven schedul
of bernstein and sharp is discuss as an exampl of
such an implement cacm juli 1977 ruschitzka m fabri r
s schedul algorithm schedul model prioriti oper system processor share
implement effici 4 31 4 32 4 34 4 35
8 1 ca770702 jb decemb 28 1977 12 32 pm
2950 4 2950 3072 4 2950 2219 5 2950 2950
5 2950 2950 5 2950 2950 5 2950 
# 2951
dynam respons time predict for comput network if the ultim
aim of a comput network is resourc share then the
human compon as well as the technic compon of network
must be fulli investig to achiev thi goal thi research
is a first step toward assist the user in particip
in the vast store of resourc avail on a network
analyt simul and statist perform evalu tool ar emploi to
investig the feasibl of a dynam respons time monitor that
is capabl of provid compar respons time inform for user
wish to process variou comput applic at some network comput
node the research clearli reveal that suffici system data ar
current obtain at least for the five divers arpa network
system studi in detail to describ and predict the respons
time for network time share system as it depend on
some measur of system activ or load level cacm juli
1977 mamrak s a respons time monitor comput network time
share system compar respons time arpa network anlyt model simul
benchmark job system measur 4 6 6 20 8 1
ca770701 jb decemb 28 1977 12 42 pm 2629 4
2951 2868 4 2951 2928 4 2951 2951 4 2951
2380 5 2951 2951 5 2951 2951 5 2951 2951
5 2951 
# 2952
function realiz with word parallel logic and two s complement
addit instruct cacm june 1977 warren h s jr boolean
function two s complement sign propag 4 0 6 32
ca770611 jb decemb 28 1977 12 45 pm 362 4
2952 2296 4 2952 2952 4 2952 2952 4 2952
2952 4 2952 2952 4 2952 2952 4 2952 2952
4 2952 142 4 2952 142 4 2952 142 4
2952 142 5 2952 162 5 2952 163 5 2952
192 5 2952 2185 5 2952 2727 5 2952 2952
5 2952 2952 5 2952 2952 5 2952 
# 2953
note on recurs elimin variou method of recurs elimin ar
appli to the schemat recurs procedur proc s x px
then n x s fx s gx m x fi
procedur with thi gener form aris in connect with tree
travers and sort algorithm each method of recurs remov involv
the us of on or more stack and the solut
ar compar on the basi of their run time cacm
june 1977 bird r s recurs elimin optim of program
stack tree sort algorithm comput induct 4 0 4 2
5 20 5 24 5 25 5 31 ca770610 jb
decemb 28 1977 12 50 pm 2953 5 2953 2953
5 2953 2953 5 2953 3020 5 2953 2953 6
2953 
# 2954
a bound storag algorithm for copi cyclic structur a new
algorithm is present which copi cyclic list structur us bound
workspac and linear time unlik a previou similar algorithm thi
on make no assumpt about the storag alloc system in
us and us onli oper like to be avail in
a high level languag the distinct featur of thi algorithm
is a techniqu for travers the structur twice us the
same span tree in each case first from left to
right and then from right to left cacm june 1977
robson j m copi share subtre cyclic structur 4 49
5 25 ca770609 jb decemb 28 1977 12 56 pm
2766 4 2954 2855 4 2954 2954 4 2954 2954
4 2954 3106 4 2954 3106 4 2954 2665 5
2954 2766 5 2954 2954 5 2954 2954 5 2954
2954 5 2954 3106 5 2954 1549 6 2954 210
6 2954 1972 6 2954 2665 6 2954 2766 6
2954 2855 6 2954 2954 6 2954 2998 6 2954
# 2955
buddi system two algorithm ar present for implement ani of
a class of buddi system for dynam storag alloc each
buddi system correspond to a set of recurr relat which
relat the block size provid to each other analys of
the in ternal fragment of the binari buddi system the
fibonacci buddi system and the weight buddi system ar given
compar simul result ar also present for in ternal extern
and total fragment cacm june 1977 peterson j l norman
t a dynam storag alloc buddi system fragment fibonacci buddi
system weight buddi system 3 89 4 32 4 39
ca770608 jb decemb 28 1977 1 20 pm 1389 4
2955 1552 4 2955 2162 4 2955 2435 4 2955
2596 4 2955 2596 4 2955 2747 4 2955 2768
4 2955 2768 4 2955 2773 4 2955 2845 4
2955 2845 4 2955 2845 4 2955 2902 4 2955
2902 4 2955 2902 4 2955 2902 4 2955 2911
4 2955 2911 4 2955 2955 4 2955 2955 4
2955 2955 4 2955 2955 4 2955 2955 4 2955
1184 5 2955 2435 5 2955 2596 5 2955 2747
5 2955 2773 5 2955 2955 5 2955 2955 5
2955 2955 5 2955 
# 2956
some idea on data type in high level languag a
number of issu ar explor concern the notion that a
data type is a set of valu togeth with a
set of primit oper on those valu among these ar
the need for a notat for iter over the element
of ani finit set instead of the more narrow for
i 1 to n notat the us of the domain
of an arrai as a data type the need for
a simpl notat for allow type of paramet to be
themselv paramet but in a restrict fashion and result problem
with convers of valu from on type to anoth cacm
june 1977 gri d gehani n data type gener procedur
program languag 4 12 4 20 4 22 ca770607 jb
decemb 28 1977 1 27 pm 2167 4 2956 2723
4 2956 2941 4 2956 2956 4 2956 2956 4
2956 3030 4 2956 1379 5 2956 2651 5 2956
2956 5 2956 2956 5 2956 2956 5 2956 3049
5 2956 2956 6 2956 2958 6 2956 2957 6
2956 2960 6 2956 
# 2957
databas abstract aggreg aggreg is in troduc as an abstract
which is import in conceptu the real world aggreg transform
a relationship between object into a higher level object a
new data type call aggreg is develop which under certain
criteria of well defined specifi aggreg abstract relat databas defin
as collect of aggreg ar structur as a hierarchi on
n ari relat to main tain well defined updat oper
on such databas must preserv two invari well defin relat
ar distinct from relat in third normal form it is
shown that these notion ar complementari and both ar import
in databas design a top down methodolog for databas design
is describ which separ decis concern aggreg structur from decis
concern kei identif it is suggest that aggreg type and
other type which support real world abstract without in troduc
implement detail should be incorpor into program languag cacm june
1977 smith j m smith d c p data abstract
relat databas data type aggreg databas design data structur knowledg
represent data definit languag 3 65 3 69 3 79
4 29 4 33 4 34 ca770606 jb decemb 29
1977 12 33 am 2155 4 2957 2406 4 2957
2710 4 2957 2715 4 2957 2716 4 2957 2717
4 2957 2718 4 2957 2765 4 2957 2817 4
2957 2888 4 2957 2901 4 2957 2957 4 2957
2959 4 2957 2965 4 2957 3087 4 2957 3154
4 2957 2046 5 2957 2957 5 2957 2957 5
2957 2957 5 2957 3049 5 2957 2956 6 2957
2958 6 2957 2957 6 2957 2960 6 2957 
# 2958
abstract data type and the develop of data structur abstract
data type can plai a signific role in the develop
of softwar that is reliabl effici and flexibl thi paper
present and discuss the applic of an algebra techniqu for
the specif of abstract data type among the exampl present
is a top down develop of a symbol tabl for
a block structur languag a discuss of the proof of
it correct is given the paper also contain a brief
discuss of the problem involv in construct algebra specif that
ar both consist and complet cacm june 1977 guttag j
abstract data type correct proof data type data structur specif
softwar specif 4 34 5 24 ca770605 jb decemb 29
1977 1 17 am 2704 4 2958 2738 4 2958
2866 4 2958 2869 4 2958 2941 4 2958 2958
4 2958 3004 4 2958 3030 4 2958 2356 5
2958 2958 5 2958 2958 5 2958 2958 5 2958
3030 5 2958 3031 5 2958 3049 5 2958 2247
6 2958 2356 6 2958 2457 6 2958 2651 6
2958 2939 6 2958 2956 6 2958 2958 6 2958
2958 6 2958 2958 6 2958 2957 6 2958 2960
6 2958 2972 6 2958 
# 2959
the system for busi autom sba program languag the system
for busi autom sba is a system within which applic
expert nonprogramm can describ and execut their applic on a
comput the user of sba view hi applic as manipul
of inform in two dimension pictur of tabl busi form
and report on a displai termin he can gradual autom
thi applic by give exampl to the system of how
he manual manipul the inform the queri by exampl databas
languag is a subset of the sba program languag cacm
june 1977 zloof m m de jong s p program
languag graphic user in terfac data flow form flow data
abstract databas queri data process busi system specif applic program
3 73 3 74 4 22 4 33 4 34
ca770604 jb decemb 29 1977 1 25 am 2155 4
2959 2406 4 2959 2710 4 2959 2715 4 2959
2716 4 2959 2717 4 2959 2718 4 2959 2765
4 2959 2817 4 2959 2888 4 2959 2901 4
2959 2957 4 2959 2959 4 2959 2965 4 2959
3087 4 2959 3154 4 2959 2046 5 2959 2959
5 2959 2959 5 2959 2959 5 2959 
# 2960
two view of data abstract cacm june 1977 ledgard h
f taylor r w ca770603 jb decemb 29 1977 1
28 am 2960 5 2960 2960 5 2960 2960 5
2960 3049 5 2960 2956 6 2960 2958 6 2960
2957 6 2960 2960 6 2960 
# 2961
experiment investig of the util of detail flowchart in program
thi paper describ previou research on flowchart and a seri
of control experi to test the util of detail flowchart
as an aid to program composit comprehens debug and modif
no statist signific differ between flowchart and nonflowchart group ha
been shown therebi call into question the util of detail
flowchart a program of further research is suggest cacm june
1977 shneiderman b mayer r mckai d heller p flowchart
program composit program comprehens debug modif experiment test human factor
1 5 4 0 ca770602 jb decemb 29 1977 1
33 am 2961 4 2961 2961 5 2961 2961 5
2961 2961 5 2961 721 5 2961 
# 2962
product and employ of ph s in comput scienc 1976
statist ar present on the product and employ of ph
s in comput scienc for the calendar year 1975 76
data includ profil of graduat student and of faculti at
60 ph produc depart as well as a breakdown of
degre grant by specialti area signific trend ar note and
comparison with compar data gather for the 1974 75 calendar
year ar made cacm june 1977 taulbe o e cont
s d comput scienc product of ph s employ student
1 3 1 52 1 53 1 59 ca770601 jb
decemb 29 1977 1 39 am 2962 4 2962 3122
4 2962 3123 4 2962 2861 5 2962 2962 5
2962 2962 5 2962 2962 5 2962 3123 5 2962
3122 5 2962 2823 6 2962 2861 6 2962 2861
6 2962 2962 6 2962 2962 6 2962 3022 6
2962 
# 2963
a fast algorithm for comput longest common subsequ previous publish
algorithm for find the longest common subsequ of two sequenc
of length n have had a best case run time
of o n 2 an algorithm for thi problem is
present which ha a run time of o r n
log n where r is the total number of order
pair of posit at which the two sequenc match thu
in the worst case the algorithm ha a run time
of o n 2 log n howev for those applic
where most posit of on sequenc match rel few posit
in the other sequenc a run time of o n
log n can be expect cacm mai 1977 hunt j
w szymanski t g longest common subsequ effici algorithm 3
73 3 63 5 25 ca770509 jb decemb 29 1977
1 46 am 2963 4 2963 3114 4 2963 2745
5 2963 2963 5 2963 2963 5 2963 2963 5
2963 
# 2964
an approach to optim design of storag paramet in databas
cacm mai 1977 milman y databas organ storag paramet optim
resid overflow storag 3 73 3 74 ca770508 jb decemb
29 1977 1 48 am 2964 5 2964 2964 5
2964 2964 5 2964 
# 2965
an optim evalu of boolean express in an onlin queri
system cacm mai 1977 hanani m z queri boolean express
inform retriev file organ 3 5 3 70 3 74
ca770507 jb decemb 29 1977 1 51 am 2155 4
2965 2406 4 2965 2710 4 2965 2715 4 2965
2716 4 2965 2717 4 2965 2718 4 2965 2765
4 2965 2765 4 2965 2817 4 2965 2888 4
2965 2901 4 2965 2957 4 2965 2959 4 2965
2965 4 2965 2965 4 2965 3087 4 2965 3154
4 2965 2046 5 2965 2451 5 2965 2965 5
2965 2965 5 2965 2965 5 2965 3168 5 2965
3169 5 2965 2965 6 2965 2965 6 2965 3002
6 2965 
# 2966
the choic of refer poin ts in best match file
search improv to the exhaust search method of best match
file search have previous been achiev by do a preprocess
step involv the calcul of distanc from a refer poin
t thi paper discuss the proper choic of refer poin
ts and extend the previou algorithm to us more than
on refer poin t it is shown that refer poin
ts should be locat outsid of data cluster the result
of comput simul ar present which show that larg improv
can be achiev by the proper choic and locat of
multipl refer poin ts cacm mai 1977 shapiro m match
file search best match nearest neighbor classif 3 73 3
74 ca770506 jb decemb 29 1977 1 57 am 2575
4 2966 2966 4 2966 3134 4 2966 2524 5
2966 2966 5 2966 2966 5 2966 2966 5 2966
# 2967
a comparison of hardwar and softwar associ memori in the
context of comput graphic the associ process of line draw
apld system util a hardwar associ memori and creat modifi
delet store and retriev two dimension line draw consist of
poin ts line rectangl and triangl the apld function were
duplic on the tx 2 comput at m s lincoln
laboratori under the leap languag and data structur a comparison
of the hardwar approach with the softwar simul illustr the
advantag of the hardwar associ memori in three area 1
process speed 2 storag requir and 3 flexibl the major
problem area of hardwar associ memori technolog name input output
and cost effect ar also address cacm mai 1977 stillman
n j berra p b associ memori associ processor content
address memori graphic inform retriev data structur softwar evalu hardwar
evalu parallel process databas manag 3 71 3 72 3
73 3 74 4 34 4 6 6 22 8
2 ca770505 jb decemb 29 1977 2 07 am 2719
4 2967 2967 4 2967 2151 5 2967 2967 5
2967 2967 5 2967 2967 5 2967 
# 2968
a comparison of tree balanc algorithm sever algorithm height balanc
i e avl and extens weight balanc i e bb
and wb and total restructur for build balanc binari search
tree ar compar the criteria for comparison encompass theoret aspect
e g path length and implement independ and machin algorithm
depend measur e g run time a detail analysi of
code is also present at a level believ to be
languag and compil independ the qualiti of the result tree
and the overhead spent on build them ar analyz and
some guidelin ar given for an effici us of the
method if insert and subsequ queri ar the onli oper
of in terest then pure avl tree present the overal
best qualiti cacm mai 1977 baer j l schwab b
binari search tree avl tree weight balanc tree path length
analysi of algorithm inform storag and retriev 3 7 3
72 3 74 5 31 ca770504 jb decemb 29 1977
2 16 am 2455 4 2968 2493 4 2968 2889
4 2968 2889 4 2968 2968 4 2968 2968 4
2968 3042 4 2968 2388 5 2968 2455 5 2968
2968 5 2968 2968 5 2968 2968 5 2968 3042
5 2968 2455 6 2968 2839 6 2968 2889 6
2968 2968 6 2968 
# 2969
optim program and data locat in comput network an optim
procedur for the alloc of program and data file in
a comput network is present thi algorithm take into account
the depend between file and program such as occur in
real heterogen comput network insight into whether or not to
convert program from on comput to anoth can also be
gain from the model a search procedur for the file
locat problem is describ along with an exampl and a
possibl applic of the model cacm mai 1977 morgan h
l levin k d comput network databas distribut databas optim
file locat 3 81 3 51 4 33 ca770503 jb
decemb 29 1977 2 22 am 2969 5 2969 2969
5 2969 2969 5 2969 
# 2970
achiev specif accuraci in simul output analysi thi paper extend
the us of the regen properti of queue system in
the analysi of simul output in particular it describ a
sequenti estim method which when us with the regen properti
allow result to be obtain with specifi statist accuraci thi
method includ a test to check the normal assumpt on
which the sequenti procedur reli the paper illustr the method
us the empti and idl state as the regen state
a second exampl then describ how us the most frequent
enter state as the regen state reduc the chanc of
make a costli error in a preliminari simul run the
paper also describ how a varianc reduct method due to
page 9 can be us to obtain a specifi accuraci
with consider fewer job complet than ar requir when no
varianc reduct techniqu is appli cacm mai 1977 fishman g
s confid in terval ratio estim regen properti sequenti estim
simul stop rule varianc reduct 5 5 8 1 ca770502
jb decemb 29 1977 2 43 am 2970 5 2970
2970 5 2970 2970 5 2970 
# 2971
sp k a system for teach comput program sp k
is a compat subset of the pl i languag that
ha been design for teach program the featur of the
sp k languag were chosen to encourag structur problem solv
by comput to make the languag easi to learn and
us to elimin confus and redund construct and to make
the languag easi to compil the result languag is suitabl
for in troduc program concept us in variou applic includ
busi data process scientif calcul and non numer comput sp
k is actual a sequenc of languag subset call sp
1 sp 2 p 8 each subset in troduc new
program languag construct while retain all the construct of preced
subset each subset is precis defin and can be learn
or implement without the follow subset cacm mai 1977 holt
r c wortman d b barnard d t cordi j
r programm educ univers commun colleg high school pl i
sp k minicomput program languag design teach program in troductori
comput 1 5 4 2 4 12 4 13 ca770501
jb decemb 29 1977 4 40 am 2708 4 2971
2820 4 2971 2971 4 2971 2971 4 2971 2971
4 2971 3045 4 2971 1835 5 2971 1974 5
2971 2534 5 2971 2971 5 2971 2971 5 2971
2971 5 2971 
# 2972
proof techniqu for hierarch structur program a method for describ
and structur program that simplifi proof of their correct is
present the method formal repres a program in term of
level of abstract each level of which can be describ
by a self contain nonprocedur specif the proof like the
program ar structur by level although onli manual proof ar
describ in the paper the method is also applic to
semi automat and automat proof preliminari result ar encourag indic
that the method can be appli to larg program such
as oper system cacm april 1977 robinson l levitt k
n hierarch structur program verif structur program formal specif abstract
and program methodolog 4 0 4 29 4 9 5
24 ca770410 jb decemb 29 1977 4 53 am 2042
4 2972 2222 4 2972 2319 4 2972 2356 4
2972 2480 4 2972 2594 4 2972 2679 4 2972
2709 4 2972 2844 4 2972 2865 4 2972 2866
4 2972 2896 4 2972 2898 4 2972 2939 4
2972 2972 4 2972 2972 4 2972 2972 4 2972
2972 4 2972 2972 4 2972 3037 4 2972 3039
4 2972 3043 4 2972 3043 4 2972 3073 4
2972 3128 4 2972 3144 4 2972 3155 4 2972
970 5 2972 2204 5 2972 2597 5 2972 2732
5 2972 2738 5 2972 2972 5 2972 2972 5
2972 2972 5 2972 3030 5 2972 2247 6 2972
2356 6 2972 2457 6 2972 2651 6 2972 2958
6 2972 2972 6 2972 
# 2973
sort on a mesh connect parallel comput two algorithm ar
present for sort n 2 element on an n x
n mesh connect processor arrai that requir o n rout
and comparison step the best previou algorithm take time o
n log n the algorithm of thi paper ar shown
to be optim in time within small constant factor extens
to higher dimension arrai ar also given cacm april 1977
thompson c d kung h t parallel comput parallel sort
parallel merg rout and comparison step perfect shuffl processor in
terconnect pattern 4 32 5 25 5 31 ca770409 jb
decemb 29 1977 4 58 am 2973 5 2973 2973
5 2973 2973 5 2973 3156 5 2973 2289 6
2973 2973 6 2973 3075 6 2973 
# 2974
comment on weight increment linear search for scatter tabl cacm
april 1977 bandyopadhyai s k hash address primari cluster index
sequenc complementari relat search 3 73 3 74 4 9
4 11 4 12 ca770408 jb decemb 29 1977 5
02 am 1973 4 2974 2018 4 2974 2203 4
2974 2251 4 2974 2543 4 2974 2770 4 2974
2974 4 2974 2974 4 2974 3053 4 2974 2109
5 2974 2251 5 2974 2974 5 2974 2974 5
2974 2974 5 2974 
# 2975
remark on uniform insert in structur data structur cacm april
1977 holland c data structur direct graph uniform insert 4
34 ca770407 jb decemb 29 1977 5 04 am 2975
4 2975 2594 5 2975 2975 5 2975 2975 5
2975 2975 5 2975 
# 2976
approxim block access in databas organ cacm april 1977 yao
s b databas invert file organ databas perform and measur
inform retriev queri answer 3 70 3 72 4 33
ca770406 jb decemb 29 1977 5 06 am 2976 4
2976 2976 4 2976 2976 4 2976 2688 5 2976
2765 5 2976 2882 5 2976 2976 5 2976 2976
5 2976 2976 5 2976 
# 2977
the stage hypothesi and the s curv some contradictori evid
thi paper present the result of a studi test the
s shape budget curv of nolan s stage model of
comput develop in an organ research on the data process
budget of california counti fail to support the s shape
curv or the us of budget as a basi for
a stage model howev the result do not invalid the
concept of a stage model the analysi suggest an altern
model of budget growth and a separ between model of
budget growth and growth stage in the develop of the
comput resourc cacm april 1977 lucac h c jr sutton
j a budget stage theori stage hypothesi 3 50 3
59 ca770405 jb decemb 29 1977 5 12 am 2977
4 2977 2985 4 2977 3011 4 2977 3035 4
2977 2485 5 2977 2977 5 2977 2977 5 2977
2977 5 2977 
# 2978
analysi of design altern for virtual memori index a class
of index structur for us in a virtual memori environ
is describ design altern within thi class of index structur
ar analyz these altern includ a choic of search strategi
whether or not page in the index ar structur and
whether or not kei ar compress the averag cost of
retriev entri from these index is express as a wieght
sum of the cost of a basic kei comparison and
the cost of cross a page boundari in the index
structur formula for the retriev cost for possibl combin of
design altern ar given these ar us in numer case
studi which compar the retriev cost of the altern qualit
comparison of the main tenanc cost insert delet reorgan of
the design altern ar also includ cacm april 1977 maruyama
k smith s e index index structur page virtual memori
file retriev main tenanc search strategi kei compress 3 50
3 51 3 02 3 73 3 74 ca770404 jb
decemb 29 1977 5 22 am 2451 4 2978 2556
4 2978 2978 4 2978 1935 5 2978 2978 5
2978 2978 5 2978 2978 5 2978 3058 5 2978
3063 5 2978 2978 6 2978 2978 6 2978 
# 2979
studi in machin cognit us the game of poker a
progress report is present of on go research effort concern
human decis make under uncertainli and risk and human problem
solv and learn process on the on hand and machin
learn larg scale program system and novel program techniqu on
the other there ha also been in terest in how
human make deduct and induct infer and form and optim
heurist rule and how machin can reach similar result although
the vehicl of these investig ha been the game of
poker a conceptu framework ha been provid that should have
a fairli wide rang of applic the model of human
judgment choic and decis make ar incorpor in a larg
scale complex program thei repres both descript and norm theori
of behavior an in teract game environ ha been recent
establish which besid it us for experi in game plai
enabl human to construct machin strategi on line in a
question answer advic take mode cacm april 1977 findler n
v machin learn game plai program decis make under uncertain
ty and risk automat form and optim of heurist rule
automat induct and deduct infer make model of game learn
poker gambl and bluf 3 36 3 62 3 61
3 64 3 65 3 66 ca770403 jb decemb 29
1977 5 34 am 2979 5 2979 2979 5 2979
2979 5 2979 
# 2980
the edit of pictur segment us local analysi of graph
a major problem in pictur process is the elimin of
the larg number of spuriou region that result from an
initi segment by region grow techniqu such region have been
elimin either on the basi of semant inform or on
the basi of size and contrast a scheme is present
which perform elimin on the basi of local properti of
the region adjac graph the scheme is base on definit
of graph properti which ar satisfi when a spuriou region
is present then edit is equival to fast graph oper
a number of exampl ar shown cacm april 1977 tanimoto
s l pavlidi t pictur process pattern recognit segment region
edit 3 63 ca770402 jb decemb 29 1977 6 22
am 2980 4 2980 2523 5 2980 2980 5 2980
2980 5 2980 2980 5 2980 
# 2981
subgoal induct a proof method subgoal induct is present as
an altern or supplement to the commonli us induct assert
method it major virtu is that it can often be
us to prove a loop s correct directli from it
input output specif without the us of an invari the
relat between subgoal induct and other commonli us induct rule
is explor and in particular it is shown that subgoal
induct can be view as a special form of comput
induct a set of suffici condit ar present which guarante
that an input output specif is strong enough for the
induct step of a proof by subgoal induct to be
valid cacm april 1977 morri j h jr wegbreit b
program verif prove program correct induct rule comput induct induct
assert structur induct proof rule recurs program iter program 4
19 4 22 5 21 5 24 ca770401 jb decemb
29 1977 6 31 am 2981 4 2981 3030 4
2981 3077 4 2981 3104 4 2981 2457 5 2981
2981 5 2981 2981 5 2981 2981 5 2981 3014
5 2981 1834 6 2981 2981 6 2981 
# 2982
the storag requir in preced pars cacm march 1977 bertsch
e preced pars storag requir valu tabl 4 12 5
22 ca770310jb decemb 29 1977 6 34 am 1542 4
2982 1683 4 2982 1693 4 2982 1781 4 2982
1787 4 2982 1836 4 2982 1945 4 2982 2060
4 2982 2061 4 2982 2082 4 2982 2091 4
2982 2152 4 2982 2179 4 2982 2340 4 2982
2340 4 2982 2356 4 2982 2546 4 2982 2603
4 2982 2698 4 2982 2708 4 2982 2824 4
2982 2824 4 2982 2982 4 2982 2982 4 2982
2982 4 2982 2986 4 2982 2986 4 2982 2986
4 2982 3045 4 2982 3093 4 2982 1491 5
2982 1836 5 2982 2340 5 2982 2982 5 2982
2982 5 2982 2982 5 2982 
# 2983
a comparison of next fit first fit and best fit
cacm march 1977 bai c memori alloc first fit best
fit next fit 4 32 4 35 ca770309 jb decemb
29 1977 6 36 am 2902 4 2983 2911 4
2983 2983 4 2983 2734 5 2983 2911 5 2983
2983 5 2983 2983 5 2983 2983 5 2983 1879
6 2983 273 6 2983 2435 6 2983 2498 6
2983 2734 6 2983 2773 6 2983 2983 6 2983
# 2984
cost util a measur of system perform a method is
present for evalu comput system perform in term of a
cost util factor and a measur of imbal these coeffici
indic the extent to which the total system cost is
effect util the method includ a techniqu for the visual
represent of system perform cacm march 1977 borovit i ein
dor p comput system perform evalu cost util system balanc
2 44 ca770308 jb decemb 29 1977 6 41 am
2705 4 2984 2984 4 2984 1908 5 2984 2984
5 2984 2984 5 2984 2984 5 2984 
# 2985
effect of chargeout on user manag attitud the relationship of
in ternal price system for comput servic chargeout system and
user manag attitud about their comput base inform system is
investig evid is provid that the relationship conform to a
gener pattern that would be expect from the hypothesi of
the four stage of edp growth 15 the result also
indic that the chargeout system characterist of advanc edp stage
environ ar associ with rel high level of posit user
attitud and mark increas in edp train for user both
factor ar import to the user manag involv necessari for
effect control of comput base system develop and main tenanc
of comput base system is assert to be a categori
of organiz chang a felt need for the chang on
the part of the user manag is prerequisit to ani
chang take place the research method of behavior scienc ar
appli to investig the user manag environ and the effect
of chargeout cacm march 1977 nolan r l comput manag
comput budget chargeout stage hypothesi control 2 41 2 43
3 50 ca770307 jb decemb 29 1977 6 43 am
2977 4 2985 2985 4 2985 3011 4 2985 3035
4 2985 2485 5 2985 2985 5 2985 2985 5
2985 2985 5 2985 
# 2986
oper on spars relat variou comput on relat boolean matric
or direct graph such as the comput of preced relat
for a context free grammar can be done by a
practic algorithm that is asymptot faster than those in common
us for exampl how to comput oper preced or wirth
weber preced relat in o n 2 step is shown
as well as how to comput linear preced function in
o n 2 step is shown as well as how
to comput linear preced function in o n step where
n is the size of a grammer the heart of
the algorithm is a gener theorem give suffici condit under
which an express whose operand ar spars relat and whose
oper ar composit transit closur union and invers can be
comput effici cacm march 1977 hunt h b iii szymanski
t g ullman j d comput complex spars relat boolean
matrix direct graph wirth weber preced relat linear preced function
slr grammar t canon preced relat 4 12 5 23
5 25 ca770306 jb decemb 29 1977 8 05 am
1542 4 2986 1683 4 2986 1693 4 2986 1781
4 2986 1787 4 2986 1836 4 2986 1945 4
2986 2060 4 2986 2061 4 2986 2082 4 2986
2091 4 2986 2152 4 2986 2179 4 2986 2221
4 2986 2340 4 2986 2340 4 2986 2340 4
2986 2356 4 2986 2546 4 2986 2603 4 2986
2698 4 2986 2708 4 2986 2733 4 2986 2824
4 2986 2824 4 2986 2824 4 2986 2982 4
2986 2982 4 2986 2982 4 2986 2986 4 2986
2986 4 2986 2986 4 2986 2986 4 2986 2986
4 2986 3045 4 2986 3093 4 2986 3093 4
2986 3094 4 2986 1491 5 2986 1683 5 2986
1836 5 2986 2179 5 2986 2340 5 2986 2986
5 2986 2986 5 2986 2986 5 2986 
# 2987
represent of mani side polygon and polygon line for rapid
process a represent for polygon and polygon line is describ
which allow set of consecut side to be collect examin
the set of side ar arrang in a binari tree
hierarchi by inclus a fast algorithm for test the inclus
of a poin t in a mani side polygon is
given the speed of the algorithm is discuss for both
ideal and practic exampl it is shown that the poin
ts of intersect of two polygon line can be locat
by what is essenti a binari tree search the algorithm
and a practic exampl ar discuss the represent overcom mani
of the disadvantag associ with the variou fix grid method
for repres curv and region cacm march 1977 burton w
boundari line represent cartographi comput graphic comput searchabl structur contour
represent geograph inform process graphic data retriev in tersect of
curv line draw process poin ts in polygon region boundari
represent spatial inform 3 14 3 23 3 30 3
79 8 2 ca770305 jb decemb 30 1977 12 44
am 1630 4 2987 1804 4 2987 1804 4 2987
2547 4 2987 2987 4 2987 2987 4 2987 2987
4 2987 2987 4 2987 2987 4 2987 2987 4
2987 2987 4 2987 3165 4 2987 1326 5 2987
1630 5 2987 2125 5 2987 2547 5 2987 2633
5 2987 2987 5 2987 2987 5 2987 2987 5
2987 421 5 2987 524 5 2987 3165 5 2987
1326 6 2987 2987 6 2987 
# 2988
memori manag and respons time thi paper present a computation
tractabl methodolog for includ accur the effect of finit memori
size and workload memori requir in queue network model of
comput system empir analys and analyt studi base on appli
thi methodolog to an actual multiaccess in teract system ar
report relat between workload variabl such as memori requir distribut
and job swap time and perform measur such as respons
time and memori util ar graphic displai a multiphas analyt
solubl model is propos as be broadli applic to the
analysi of in teract comput system which us nonpag memori
cacm march 1977 brown r m brown j c chandi
k m memori manag system perform queue network model in
teract comput system 4 32 ca770304 jb decemb 30 1977
12 51 am 2988 4 2988 1750 5 2988 2988
5 2988 2988 5 2988 2988 5 2988 3059 5
2988 3070 5 2988 1805 6 2988 2454 6 2988
2741 6 2988 2988 6 2988 2988 6 2988 
# 2989
empir evalu of some featur of instruct set processor architectur
thi paper present method for empir evalu of featur of
instruct set processor isp isp featur ar evalu in term
of the time us or save by have or not
have the featur the method ar base on analysi of
trace of program execut the concept of a regist life
is in troduc and us to answer question like how
mani regist ar us simultan how mani would be suffici
all of the time most of the time what would
the overhead be if the number of regist were reduc
what ar regist us for dure their live the paper
also discuss the problem of detect desir but non exist
instruct other problem ar briefli discuss experiment result ar present
obtain by analyz 41 program run on the dec system
10 isp cacm march 1977 lund a comput architectur program
behavior instruct set op code util regist structur regist util
simultan regist live instruct trace execut time 6 20 6
21 6 33 ca770303 jb decemb 30 1977 1 00
am 1653 4 2989 2411 4 2989 2709 4 2989
2889 4 2989 2937 4 2989 2989 4 2989 2989
4 2989 3005 4 2989 3025 4 2989 3101 4
2989 1069 5 2989 2138 5 2989 2989 5 2989
2989 5 2989 2989 5 2989 3025 5 2989 2138
6 2989 2989 6 2989 
# 2990
effect inform retriev us term accuraci the perform of inform
retriev system can be evalu in a number of differ
wai much of the publish evalu work is base on
measur the retriev perform of an averag user queri unfortun
formal proof ar difficult to construct for the averag case
in the present studi retriev evalu is base on optim
the perform of a specif user queri the concept of
queri term accuraci is in troduc as the probabl of
occurr of a queri term in the document relev to
that queri by relat term accuraci to the frequenc of
occurr of the term in the document of a collect
it is possibl to give formal proof of the effect
with respect to a given user queri of a number
of automat index system that have been us successfulli in
experiment situat among these ar invers document frequenc weight thesauru
construct and phrase gener cacm march 1977 yu c t
salton g inform retriev automat index content analysi term accuraci
frequenc weight thesauru and phrase transform 3 71 3 72
3 75 ca770302 jb decemb 30 1977 1 52 am
2990 5 2990 2990 5 2990 2990 5 2990 3134
5 2990 1976 6 2990 2160 6 2990 2524 6
2990 2990 6 2990 
# 2991
improv the access time for random access file cluster in
the kei set is decreas by smooth the kei to
address transform and by ad shadow bucket to an open
chain file the kei ar pre hash befor the address
divis to remov the effect of sequenti properti in the
kei set shadow bucket in the kei search sequenc reduc
the effect of nonuniform in file load and decreas the
number of maximum probe need to locat a record the
combin effect of these techniqu lead to improv file perform
for secondari storag devic as shown by empir studi cacm
march 1977 clapson p hash hash techniqu hash method hash
code kei kei transform kei to address transform direct address
direct access direct access method random random access file address
file organ file structur scatter storag search method collis synonym
cluster inform retriev open address open chain bucket bucket size
shadow bucket combinator 3 7 3 72 3 73 3
74 4 9 5 39 ca770301 jb decemb 30 1977
2 00 am 1676 4 2991 1682 4 2991 1728
4 2991 1860 4 2991 1973 4 2991 1973 4
2991 1992 4 2991 2018 4 2991 2032 4 2991
2033 4 2991 2107 4 2991 2109 4 2991 2138
4 2991 2203 4 2991 2203 4 2991 2251 4
2991 2251 4 2991 2258 4 2991 2319 4 2991
2313 4 2991 2359 4 2991 2359 4 2991 2437
4 2991 2524 4 2991 2530 4 2991 2537 4
2991 2543 4 2991 2543 4 2991 2552 4 2991
2552 4 2991 2559 4 2991 2559 4 2991 2573
4 2991 2781 4 2991 2860 4 2991 2991 4
2991 2991 4 2991 2991 4 2991 3053 4 2991
3053 4 2991 3083 4 2991 1785 5 2991 2107
5 2991 2203 5 2991 2991 5 2991 2991 5
2991 2991 5 2991 
# 2992
a number system for binari tree cacm februari 1977 knott
g d binari tree permut binari search tree rank function
3 79 5 39 ca770209 jb decemb 30 1977 2
04 am 2992 5 2992 2992 5 2992 2992 5
2992 
# 2993
occurr of cycl and other phenomena aris in a class
of linear program model an investig into the averag queue
size for a certain class of queue ha result in
the formul of linear program problem which ar ill condit
in some case in attempt to solv these linear program
model us ibm s mp packag instanc of cycl were
encount small perturb in the input data result in problem
which did not cycl thi fact plu sever other observ
phenomena suggest that the primari reason that cycl is not
known to occur more frequent is the round off error
in the comput perturb the problem suffici to prevent cycl
or at least to prevent indefinit cycl in on case
maxim and minim an object function subject to the same
constrain t set wa attempt but mp solv onli on
of these while give an indic of infeas for the
other cacm februari 1977 kotiah t c t steinberg d
i linear program cycl queue model 5 41 5 9
ca770208 jb decemb 30 1977 2 11 am 2993 5
2993 2993 5 2993 2993 5 2993 
# 2994
a linear algorithm for increment digit displai of circular arc
circular arc can be drawn on an increment displai devic
such as a cathod rai tube digit plotter or matrix
prin ter us onli sign test and elementari addit and
subtract thi paper describ methodolog for produc dot or step
pattern closet to the true circl cacm februari 1977 bresenham
j graphic circl draw step gener dot gener increment digit
plot raster displai integ arithmet circl algorithm 4 41 8
2 ca770207 jb decemb 30 1977 2 16 am 2994
5 2994 2994 5 2994 2994 5 2994 
# 2995
decompos instabl and satur in multiprogram system corrigendum cacm februari
1977 courtoi p j ca770205 jb decemb 30 1977 2
20 am 2995 5 2995 2995 5 2995 2995 5
2995 
# 2996
transient free work set statist transient free averag work set
size and transient free miss page rate for a finit
sampl of a refer string ar defin us of these
statist is appropri if the content of the work set
at the start of the record string ar unknown if
a certain stationar condit hold these statist provid unbias estim
of expect work set size miss page probabl and in
terrefer distanc probabl two other pair of estim ar shown
to be bias express for the transient free statist ar
obtain in term of in terval statist sever method of
comput ar discuss the us of each depend on length
of the sampl number of distinct refer and the amount
of main storag avail to the comput perform the calcul
in particular method ar describ for handl long string contain
mani distinct page name cacm februari 1977 easton m c
bennett b t work set estim program behavior 4 3
4 6 5 5 ca770204 jb decemb 30 1977 2
40 am 1892 4 2996 1901 4 2996 2085 4
2996 2095 4 2996 2218 4 2996 2277 4 2996
2319 4 2996 2329 4 2996 2358 4 2996 2373
4 2996 2374 4 2996 2380 4 2996 2380 4
2996 2434 4 2996 2499 4 2996 2450 4 2996
2501 4 2996 2582 4 2996 2595 4 2996 2669
4 2996 2828 4 2996 2863 4 2996 2881 4
2996 2928 4 2996 2996 4 2996 2996 4 2996
2996 4 2996 3006 4 2996 3006 4 2996 3006
4 2996 3067 4 2996 3067 4 2996 3067 4
2996 1751 5 2996 2373 5 2996 2595 5 2996
2996 5 2996 2996 5 2996 2996 5 2996 
# 2997
convex hull of finit set of poin ts in two
and three dimens the convex hull of set of n
poin ts in two and three dimens can be determin
with o n log n oper the present algorithm us
the divid and conquer techniqu and recurs appli a merg
procedur for two nonin tersect convex hull sinc ani convex
hull algorithm requir at least o n log n oper
the time complex of the propos algorithm is optim within
a multipl constant cacm februari 1977 preparata f p hong
s j comput complex convex hull optim algorithm planar set
of poin ts spatial set of poin ts 4 49
5 25 5 32 ca770203 jb decemb 30 1977 2
47 am 2997 4 2997 2737 5 2997 2997 5
2997 2997 5 2997 2997 5 2997 3151 5 2997
2997 6 2997 
# 2998
an empir studi of list structur in lisp static measur
of the list structur of five larg lisp program ar
report and analyz in thi paper these measur reveal substanti
regular or predict among poin ter to atom and especi
among poin ter to list pointer to atom ar found
to obei roughli zipf s law which govern word frequenc
in natur languag poin ter to list usual poin t
to a locat physic nearbi in memori the us of
such regular in the space effici represent of list structur
is discuss linear of list wherebi success cdr or car
ar place in consecut memori locat whenev possibl greatli strengthen
the observ regular of list structur it is shown that
under some reason assumpt the entropi or inform content of
a car cdr pair in the program measur is about
10 to 15 bit befor linear and about 7 to
12 bit after cacm februari 1977 clark d w green
c c list structur measur lisp list structur regular poin
ter compress zipf s law list linear poin ter entropi
3 69 4 29 4 34 4 6 5 6
ca770202 jb decemb 30 1977 2 55 am 2855 5
2998 2944 5 2998 2998 5 2998 2998 5 2998
2998 5 2998 3106 5 2998 1549 6 2998 1549
6 2998 1826 6 2998 210 6 2998 210 6
2998 1972 6 2998 1972 6 2998 2513 6 2998
2665 6 2998 2766 6 2998 2766 6 2998 2833
6 2998 2833 6 2998 2855 6 2998 2954 6
2998 2998 6 2998 2998 6 2998 2998 6 2998
# 2999
an approach to multidimension data arrai process by comput some
recent work on the develop of gener purpos comput base
statist and data process capabl for handl multidimension arrai of
data is present attent is first given to some of
the gener problem of multidimension tabl and arrai process thi
is follow by a summari of some recent develop in
arrai process capabl at the world bank in particular the
system identifi as wrap world bank retriev and arrai process
system cacm februari 1977 muller m e arrai process tabl
process statist analysi data retriev data process syntax for data
structur comput techniqu time seri cross tabul 3 10 3
20 3 30 3 70 4 0 ca770201 jb decemb
30 1977 3 12 am 2999 5 2999 2999 5
2999 2999 5 2999 
# 3000
segment size and lifetim in algol 60 program the characterist
of the virtual memori requir of a sampl of algol
60 program have been measur distribut ar present for thesiz
of memori request and for their hold time lifetim the
result ar present in term of johnston s contour model
and a simpl abstract machin thei provid new empir evid
of certain aspect of the construct and behavior of real
program and some of their implic for the design of
virtual memori system ar present and discuss cacm januari 1977
batson a p brundag r e virtual memori program behavior
segment storag alloc algol 60 contour model 4 22 4
34 4 45 6 21 ca770105 jb januari 3 1978
12 05 am 2095 4 3000 2218 4 3000 2218
4 3000 2498 4 3000 2596 4 3000 2734 4
3000 2734 4 3000 2902 4 3000 2911 4 3000
3000 4 3000 3000 4 3000 3000 4 3000 3067
4 3000 1879 5 3000 2095 5 3000 2864 5
3000 3000 5 3000 3000 5 3000 3000 5 3000
# 3001
detect of combin occurr in thi paper it is suppos
that the variabl x1 xn each have finit rang with
the variabl xi take on pi possibl valu and that
the valu of the variabl ar chang with time it
is suppos further that it is desir to detect occurr
in which some subset of the variabl achiev particular valu
final it is suppos that the problem involv the detect
of a larg number of combin occurr for a larg
number of chang of valu of variabl two effici solut
for thi problem ar describ both method have the unusu
properti of be faster for system where the sum p1
pn is larger the first solut is error free and
suitabl for most case the second solut is slightli more
eleg and allow negat as well as conjunct but is
subject to the possibl of error an error analysi is
given for the second method and an empir studi is
report cacm januari 1977 zobrist a l carlson f r
jr code hash code retriev secondari kei pattern recognit artifici
in tellig demon n tupl sort chess 3 63 5
31 ca770104jb januari 3 1978 12 15 am 2532 4
3001 2631 4 3001 2746 4 3001 3001 4 3001
3001 4 3001 2033 5 3001 2139 5 3001 3001
5 3001 3001 5 3001 3001 5 3001 
# 3002
a record and file partit model on of the main
object in the design of a file system is the
reduct of storag and data transfer cost thi paper present
a model in which sever request access the file system
and each request requir inform from on or more variabl
length data item the probabl of access and the distribut
of each data item s length ar assum to be
known and to be mutual independ the file system us
on or more storag devic and each record mai be
partit into subrecord that ar store on differ devic on
of the subrecord is design as the primari record when
a request for a record is made the primari record
is first access and other subrecord ar access onli if
the pertin inform is not store in the primari record
the model that is present in thi paper both as
a nonlinear program model and a mix integ program model
is a veri gener on sever type of file system
mai be deriv from it by an appropri select of
it paramet thi model ha alreadi been us in the
optim of librari routin storag at a larg scale oper
system cacm januari 1977 babad j m file system file
design file partit record partit 3 73 ca770103 jb januari
3 1978 12 28 am 3002 5 3002 3002 5
3002 3002 5 3002 3168 5 3002 2965 6 3002
3002 6 3002 
# 3003
a survei of the literatur in comput scienc educ sinc
curriculum 68 a bibliographi of approxim two hundr refer in
comput scienc educ appear in the literatur sinc the public
of curriculum 68 is present the bibliographi itself is preced
by brief descript materi organ the refer into the categori
of survei report activ of profession organ philosophi of program
descript of program descript of cours and other materi cacm
januari 1977 aust r h barn b h educ comput
scienc curricula 1 5 ca770102 jb januari 3 1978 12
34 am 1927 4 3003 2153 4 3003 2163 4
3003 2407 4 3003 2407 4 3003 2478 4 3003
2852 4 3003 2852 4 3003 2899 4 3003 3003
4 3003 3003 4 3003 3003 4 3003 3003 4
3003 3003 4 3003 3003 4 3003 3003 4 3003
3003 4 3003 3003 4 3003 3003 4 3003 3003
4 3003 3003 4 3003 3003 4 3003 3003 4
3003 3003 4 3003 3003 4 3003 3011 4 3003
3050 4 3003 1659 5 3003 1678 5 3003 1927
5 3003 1945 5 3003 2097 5 3003 2147 5
3003 2163 5 3003 2187 5 3003 2329 5 3003
2345 5 3003 2367 5 3003 2407 5 3003 2478
5 3003 2479 5 3003 2480 5 3003 2538 5
3003 3003 5 3003 3003 5 3003 3003 5 3003
3130 5 3003 1771 6 3003 3003 6 3003 
# 3004
structur program in cobol an approach for applic programm techniqu
for design and write cobol program ar present previou work
in structur program is drawn upon and adapt the present
is inform the terminolog is nonmathemat as far as possibl
no theorem ar prove and exampl ar us frequent top
down program design is implement through the us of structur
flowchart disciplin specif and step by step verif a well
form cobol program is defin the proper us of the
go to and other cobol code practic ar discuss cacm
januari 1977 van gelder a structur program top down well
form program go to statement repeat statement flowchart applic program
cobol softwar reliabl program verif 4 0 4 22 5
24 ca770101 jb januari 3 1978 12 44 am 2193
4 3004 2326 4 3004 2477 4 3004 2480 4
3004 2541 4 3004 2594 4 3004 2704 4 3004
2709 4 3004 2709 4 3004 2738 4 3004 2738
4 3004 2802 4 3004 2866 4 3004 2867 4
3004 2869 4 3004 2941 4 3004 2958 4 3004
3004 4 3004 3004 4 3004 3004 4 3004 3004
4 3004 3004 4 3004 3030 4 3004 3030 4
3004 3121 4 3004 3155 4 3004 1425 5 3004
2247 5 3004 2356 5 3004 2456 5 3004 3004
5 3004 3004 5 3004 3004 5 3004 3186 5
3004 
# 3005
implic of structur program for machin architectur base on an
empir studi of more than 10 000 line of program
text written in a goto less languag a machin architectur
specif design for structur program is propos sinc assign call
return and if statement togeth account for 93 percent of
all execut statement special care is given to ensur that
these statement can be implement effici a highli compact instruct
encod scheme is present which can reduc program size by
a factor of 3 unlik a huffman code which util
variabl length field thi method us onli fix length 1
byte op code and address field the most frequent instruct
consist of a singl 1 byte field as a consequ
instruct decod time is minim and the machin is effici
with respect to both space and time cacm march 1978
tanenbaum a machin architectur comput architectur comput organ instruct set
design program characterist 4 12 4 22 4 9 6
21 ca780308 jb march 28 1978 12 55 pm 2411
4 3005 2709 4 3005 2889 4 3005 2937 4
3005 2989 4 3005 3005 4 3005 3025 4 3005
3101 4 3005 2138 5 3005 3005 5 3005 3005
5 3005 3005 5 3005 
# 3006
anomali with variabl partit page algorithm five type of anomal
behavior which mai occur in page virtual memori oper system
a redefin on type of anomali for exampl concern the
fact that with certain refer string and page algorithm an
increas in mean memori alloc mai result in an increas
in fault rate two page algorithm ar examin in term
of their anomali potenti and refer string exampl of variou
anomali ar present two page algorithm properti the inclus properti
and the gener inclus properti ar discuss and the anomali
implic of these properti present cacm march 1978 franklin m
graham g gupta r anomali memori manag program behavior stack
algorithm virtual memori work set page fault frequenc page algorithm
4 32 4 35 4 6 8 1 ca780307 jb
march 28 1978 1 01 pm 1892 4 3006 1901
4 3006 2022 4 3006 2085 4 3006 2085 4
3006 2095 4 3006 2218 4 3006 2277 4 3006
2319 4 3006 2329 4 3006 2358 4 3006 2373
4 3006 2373 4 3006 2374 4 3006 2380 4
3006 2380 4 3006 2434 4 3006 2499 4 3006
2450 4 3006 2450 4 3006 2501 4 3006 2582
4 3006 2595 4 3006 2669 4 3006 2828 4
3006 2863 4 3006 2881 4 3006 2928 4 3006
2996 4 3006 2996 4 3006 2996 4 3006 3006
4 3006 3006 4 3006 3006 4 3006 3006 4
3006 3006 4 3006 3067 4 3006 3067 4 3006
3067 4 3006 3067 4 3006 1751 5 3006 1884
5 3006 2373 5 3006 2374 5 3006 2595 5
3006 3006 5 3006 3006 5 3006 3006 5 3006
3067 5 3006 1751 6 3006 2374 6 3006 2373
6 3006 2595 6 3006 2682 6 3006 2863 6
3006 2864 6 3006 3006 6 3006 
# 3007
complex of comput corrigendum cacm march 1978 rabin m ca780306
jb march 28 1978 1 02 pm 3007 5 3007
3007 5 3007 3007 5 3007 
# 3008
preserv averag proxim in arrai programm and data structur design
ar often forc to choos between altern structur in store
these structur preserv logic adjac or proxim is usual an
import consider the combinatori problem of store arrai as variou
kind of list structur is examin embed of graph ar
us to model the loss of proxim involv in such
storag scheme and an elementari proof that arrai cannot be
store as linear list with bound loss of proxim is
present averag loss of proxim is then consid and it
is shown that arrai cannot be store as linear list
with onli bound loss of averag proxim but can be
so store in binari tree the former result impli for
instanc that row major order is an asymptot optim storag
strategi for arrai cacm march 1978 demillo r eisenstat s
lipton r arrai graph embed linear list proxim averag proxim
tree 4 34 5 24 5 25 5 32 ca780305
jb march 28 1978 1 07 pm 1050 4 3008
1102 4 3008 378 4 3008 3008 4 3008 731
4 3008 798 4 3008 209 5 3008 3008 5
3008 3008 5 3008 3008 5 3008 
# 3009
insert and delet in on side height balanc tree recent
hirschberg ha establish that insert into on side height balanc
tree can be done in 0 log 2n step it
is prove here that delet can also be perform in
0 log 2n step which answer the open problem pose
by hirschberg cacm march 1978 kosaraju s avl tree balanc
tree binari search dynam balanc 3 73 3 74 4
34 5 25 5 31 ca780304 jb march 28 1978
1 12 pm 3009 4 3009 3042 4 3009 3065
4 3009 3096 4 3009 3163 4 3009 2839 5
3009 3009 5 3009 3009 5 3009 3009 5 3009
3096 5 3009 3163 5 3009 2839 6 3009 2839
6 3009 2889 6 3009 2889 6 3009 3009 6
3009 3009 6 3009 3065 6 3009 3096 6 3009
# 3010
valu orient of comput scienc student technolog and nontechnolog valu
orient ar investig with special attent to the complex of
valu structur comput scienc student who ar close associ with
technolog contrast with social scienc student who ar often technolog
aloof thi is confirm by the valu rate of 313
student at the univers of minnesota in 1972 comput scienc
major were found to have a more complex valu structur
than social scienc major cacm march 1978 anderson r valu
attitud student public social effect 2 11 2 12 ca780303
jb march 28 1978 1 21 pm 3010 5 3010
3010 5 3010 3010 5 3010 
# 3011
manag util of comput in american local govern tradit concept
of manag inform system mi bear littl relat to the
inform system current in us by top manag in most
us local govern what exist is manag orient comput involv
the us of rel unsophist applic despit the unsophist natur
of these system manag us of comput is surprisingli common
but also vari in it extent among local govern manag
comput is most preval in those govern with profession manag
practic where top manag is support of comput and tend
to control comput decis and where depart user have less
control over design and implement activ final manag comput clearli
ha impact for top manag mostli involv improv in decis
inform cacm march 1978 dutton w kraemer k comput util
manag inform system american local govern citi govern comput counti
govern comput comput impact manag comput 2 0 2 1
2 11 2 19 2 4 2 45 2 9
3 5 3 53 ca780302 jb march 28 1978 1
46 pm 2407 4 3011 2852 4 3011 2977 4
3011 2985 4 3011 3003 4 3011 3011 4 3011
3011 4 3011 3011 4 3011 3011 4 3011 3035
4 3011 3050 4 3011 2075 5 3011 2302 5
3011 2345 5 3011 2485 5 3011 3011 5 3011
3011 5 3011 3011 5 3011 
# 3012
the us of an interact inform storag and retriev system
in medic research thi paper present the result of a
studi of the us of an interact computer storag and
retriev system a monitor built into the comput system provid
usag data for the studi addit data on user reaction
were gath red from a questionnair the result show the
import role plai by frequent chosen laboratori refer leader in
influenc the us of thi system the implic of the
studi for the design of similar system ar discuss cacm
march 1978 luca hr implement system us inform storag and
retriev system 2 10 3 50 3 72 ca780301 jb
march 28 1978 1 51 pm 3012 5 3012 3012
5 3012 3012 5 3012 
# 3013
some new method of detect step edg in digit pictur
thi note describ two oper that respond to step edg
but not to ramp the first is similar to the
digit laplacian but us the max rather than the sum
of the x and y second differ the second us
the differ between the mean and median grai level in
a neighborhood the output obtain from these oper appli to
a set of test pictur ar compar with each other
and with the standard digit laplacian and gradient a third
oper which us the distanc between the center and centroid
of a neighborhood as an edg valu is also briefli
consid it turn out to be equival to on of
the standard digit approxim to the gradient cacm februari 1978
schachter b rosenfeld a imag process pattern recognit edg detect
3 63 ca780210 jb march 28 1978 1 56 pm
3013 5 3013 3013 5 3013 3013 5 3013 
# 3014
is sometim sometim better than alwai intermitt assert in prove
program correct thi paper explor a techniqu for prove the
correct and termin of program simultan thi approach the intermitt
assert method involv document the program with assert that must
be true at some time when control pass through the
correspond point but that need not be true everi time
the method introduc by burstal promis to provid a valuabl
complement to the more convent method the intermitt assert method
is present with a number of exampl of correct and
termin proof some of these proof ar markedli simpler than
their convent counterpart on the other hand it is shown
that a proof of correct or termin by ani of
the convent techniqu can be rephras directli as a proof
us intermitt assert final it is shown how the intermitt
assert method can be appli to prove the valid of
program transform and the correct of continu oper program cacm
februari 1978 manna z walding r intermitt assert correct of
program termin of program program verif program transform continu oper
program 5 24 ca780209 jb march 28 1978 2 04
pm 2021 4 3014 2222 4 3014 2227 4 3014
2315 4 3014 2326 4 3014 2470 4 3014 2732
4 3014 2865 4 3014 2896 4 3014 2943 4
3014 3014 4 3014 3014 4 3014 3068 4 3014
3077 4 3014 3143 4 3014 1834 5 3014 2981
5 3014 3014 5 3014 3014 5 3014 3014 5
3014 3157 5 3014 3014 6 3014 
# 3015
relax method for imag reconstruct the problem of recov an
imag a function of two variabl from experiment avail integr
of it gray over thin strip is of great import
in a larg number of scientif area an import version
of the problem in medicin is that of obtain the
exact densiti distribut within the human bodi from x rai
projectionsn approach that ha been taken to solv thi problem
consist of translat the avail inform into a system of
linear inequ the size and the sparsiti of the result
system typic 25 000 inequ with fewer than 1 percent
of the coeffici nonzero make method us success relax computation
attract as compar to other wai of solv system of
inequ in thi paper it is shown that for a
consist system of linear inequ ani sequenc of relaxarion paramet
ly strictli between 0 and 2 gener a sequenc of
vector which converg to a solut under the same assumpt
for a system of linear equat the relax method converg
to the minimum norm solut previous propos techniqu ar shown
to be special case of our procedur with differ choic
of relax paramet the practic consequ for imag reconstruct of
the choic of the relax paramet ar discuss cacm februari
1978 herman g lent a lutz p biomed imag process
imag reconstruct x rai tomographi mathemat program linear inequ relax
techniqu 3 12 3 17 3 34 3 63 5
14 5 18 5 41 ca780208 jb march 28 1978
2 13 pm 3015 5 3015 3015 5 3015 3015
5 3015 
# 3016
a comparison of numer techniqu in markov model thi paper
present sever numer method which mai be us to obtain
the stationari probabl vector of markovian model an exampl of
a nearli decompos system is consid and the result obtain
by the differ method examin a post mortem reveal why
standard techniqu often fail to yield the correct result final
a mean of estim the error inher in the decomposit
of certain model is present cacm februari 1978 stewart w
markov model numer techniqu simultan iter near decompos 4 6
5 14 8 1 ca780207 jb march 28 1978 3
43 pm 2374 4 3016 2481 4 3016 2669 4
3016 2863 4 3016 3016 4 3016 3016 4 3016
3052 4 3016 3070 4 3016 3153 4 3016 1901
5 3016 2741 5 3016 3016 5 3016 3016 5
3016 3016 5 3016 
# 3017
b tree re examin the b tree and it variant
have with increas frequenc been propos as a basic storag
structur for multius databas applic here three potenti problem which
must be dealt with in such a structur that do
not aris in more tradit static directori structur ar indic
on problem is a possibl perform penalti cacm februari 1978
held g stonebrak m b tree directori static directori dynam
directori index sequenti access method 3 70 3 73 3
74 4 33 4 34 ca780206 jb march 28 1978
3 46 pm 2626 4 3017 2786 4 3017 2840
4 3017 2919 4 3017 3017 4 3017 3110 4
3017 3174 4 3017 2629 5 3017 3017 5 3017
3017 5 3017 3017 5 3017 
# 3018
cover edg by cliqu with regard to keyword conflict and
intersect graph kellerman ha present a method for determin keyword
conflict and describ a heurist algorithm which solv a certain
combinatori optim problem in connect with thi method thi optim
problem is here shown to be equival to the problem
of cover the edg of a graph by complet subgraph
with the object of minim the number of complet subgraph
a relationship between thi edg cliqu cover problem and the
graph color problem is establish which allow algorithm for either
on of these problem to be construct from algorithm for
the other as consequ of thi relationship the keyword conflict
problem and the edg cliqu cover problem ar shown to
be np complet and if p np then thei do
not admit polynomi time approxim algorithm which alwai produc solut
within a factor less than 2 from the optimum cacm
februari 1978 kou l stockmey l wong c watson t
keyword conflict intersect graph node cliqu cover edg cliqu cover
comput complex np complet problem polynomi time heurist 4 12
5 25 5 32 ca780205 jb march 28 1978 4
18 pm 3018 5 3018 3018 5 3018 3018 5
3018 
# 3019
the gre advanc test in comput scienc cacm februari 1978
aust r ca780204 jb march 28 1978 4 19 pm
3019 5 3019 3019 5 3019 3019 5 3019 
# 3020
systemat recurs remov the recurs remov algorithm present by strong
and walker is amplifi and appli to a rel complex
pl i program the aim is to demonstr systemat recurs
remov techniqu on someth more complex than knuth s sturdi
toddler and to obtain measur of the cost of procedur
linkag in pl i and the save achiev via procedur
integr in the presenc of recurs first the paper describ
the recurs remov process and the exampl on which it
will be illustr recurs remov is then appli to the
two major part of thi exampl and the final result
of the process is displai our perform comparison result ar
present and our conclus ar briefli discuss cacm februari 1978
ausland m strong h recurs remov recurs elimin optim procedur
linkag procedur integr 4 19 4 49 4 9 5
24 ca780203 jb march 28 1978 4 26 pm 3020
4 3020 2953 5 3020 3020 5 3020 3020 5
3020 3020 5 3020 
# 3021
a method for obtain digit signatur and public kei cryptosystem
an encrypt method is present with the novel properti that
publicli reveal an encrypt kei doe not therebi reveal the
correspond decrypt kei thi ha two import consequ 1 courier
or other secur mean ar not need to transmit kei
sinc a messag can be enciph us an encrypt kei
publicli reveal by the intend recipi onli he can deciph
the messag sinc onli he know the correspond decrypt kei
2 a messag can be sign us a privat held
decrypt kei anyon can verifi thi signatur us the correspond
publicli reveal encrypt kei signatur cannot be forg and a
signer cannot later deni the valid of hi signatur thi
ha obviou applic in electron mail and electron fund transfer
system a messag is encrypt by repres it as a
number m rais m to a publicli specifi power e
and then take the remaind when the result is divid
by the publicli specifi product n of two larg secret
prime number p and q decrypt is similar onli a
differ secret power d is us where e d 1
mod p 1 q 1 the secur of the system
rest in part on the difficulti of factor the publish
divisor n cacm februari 1978 rivest r shamir a adleman
l digit signatur public kei cryptosystem privaci authent secur factor
prime number electron mail messag pass electron fund transfer cryptographi
2 12 3 15 3 50 3 81 5 25
ca780202 jb march 28 1978 4 40 pm 3021 4
3021 3158 4 3021 3021 5 3021 3021 5 3021
3021 5 3021 3038 5 3021 3111 5 3021 3177
5 3021 3021 6 3021 3021 6 3021 3021 6
3021 
# 3022
comput scienc faculti the current statu of minor and women
the result of a survei conduct in the fall of
1975 to determin the statu of women and minor faculti
member in academ comput scienc ar present faculti member were
compar with respect to profession background salari teach load public
record and research grant analysi of the data indic that
the over all verdict is on of gener equal among
women minor and men cacm februari 1978 mamrak s montanelli
rr discrimin against women discrimin against minor faculti comput scienc
degre program affirm action teach load salari public 1 52
1 53 2 2 2 3 ca780201 jb march 28
1978 5 11 pm 3022 4 3022 3123 4 3022
2823 5 3022 3022 5 3022 3022 5 3022 3022
5 3022 3123 5 3022 2823 6 3022 2861 6
3022 2962 6 3022 3022 6 3022 
# 3023
architectur of the ibm system 370 thi paper discuss the
design consider for the architectur extens that distinguish system 370
from system 360 it comment on some experi with the
origin object for system 360 and on the effort to
achiev them and it describ the reason and object for
extend the architectur it cover virtual storag program control data
manipul instruct time facil multiprocess debug and monitor error handl
and input output oper a final section tabul some of
the import paramet of the variou ibm machin which implement
the architectur cacm januari 1978 case r padg a comput
system architectur instruct set virtual storag error handl 6 0
6 21 ca780107 jb march 28 1978 5 16 pm
3023 5 3023 3023 5 3023 3023 5 3023 
# 3024
the crai 1 comput system thi paper describ the crai
1 discuss the evolut of it architectur and give an
account of some of the problem that were overcom dure
it manufactur the crai 1 is the onli comput to
have been built to date that satisfi erda s class
vi requir a comput capabl of process from 20 to
60 million float point oper per second 1 the crai
1 s fortran compil cft is design to give the
scientif user immedi access to the benefit of the crai
1 s vector process architectur an optim compil cft vector
innermost do loop compat with the ansi 1966 fortran standard
and with mani commonli support fortran extens cft doe not
requir ani sourc program modif or the us of addit
nonstandard fortran statement to achiev vector thu the user s
invest of hundr of man month of effort to develop
fortran program for other contemporari comput is protect cacm januari
1978 russel r architectur comput system 1 2 6 2
6 3 ca780106 jb march 28 1978 5 24 pm
3024 5 3024 3024 5 3024 3024 5 3024 
# 3025
the evolut of the dec system 10 the dec system
10 also known as the pdp 10 evolv from the
pdp 6 circa 1963 over five gener of implement to
present includ system cover a price rang of five to
on the origin and evolut of the hardwar oper system
and languag ar describ in term of technolog chang user
requir and user develop the pdp 10 s contribut to
comput technolog includ acceler the transit from batch orient to
time share comput system transfer hardwar technolog within dec and
elsewher to minicomput design and manufactur support minicomput hardwar and
softwar develop and serv as a model for singl user
and timeshar interact minicomput microcomput system cacm januari 1978 bell
c kotok a hast t hill r comput structur architectur
oper system timeshar 4 32 6 21 6 3 ca780105
jb march 28 1978 5 31 pm 2411 4 3025
2709 4 3025 2889 4 3025 2937 4 3025 2989
4 3025 3005 4 3025 3025 4 3025 3025 4
3025 3101 4 3025 2138 5 3025 2989 5 3025
3025 5 3025 3025 5 3025 3025 5 3025 
# 3026
the evolut of the sperri univac 1100 seri a hi
tori analysi and project the 1100 seri system ar sperri
univac s larg scale main frame comput system begin with
the 1107 in 1962 the 1100 seri ha progress through
a success of eight compat comput model to the latest
system the 1100 80 introduc in 1977 the 1100 seri
hardwar architectur is base on a 36 bit word on
complement structur which obtain on operand from storag and on
from a high speed regist or two operand from high
speed regist the 1100 oper system is design to support
a symmetr multiprocessor configur simultan provid multiprogram batch timeshar and
transact environ cacm januari 1978 borgherson b hanson m hartlei
p 1100 comput seri comput architectur multiprocess languag data manag
system end user facil execut control softwar 1 3 4
0 4 20 4 30 4 32 4 33 4
35 6 0 6 21 6 30 ca780104 jb march
28 1978 5 38 pm 3026 5 3026 3026 5
3026 3026 5 3026 
# 3027
the develop of the mu5 comput system follow a brief
outlin of the background of the mu5 project the aim
and idea for mu5 ar discuss a descript is then
given of the instruct set which includ a number of
featur conduc to the product of effici compil code from
high level languag sourc program the design of the processor
is then trace from the initi idea for an associ
address name store to the final multistag pipelin structur involv
a predict mechan for instruct prefetch and a function queue
for arrai element access an overal view of the complet
mu5 complex is present togeth with a brief indic of
it perform cacm januari 1978 ibbett r capon p architectur
name virtual storag instruct set descriptor pipelin instruct buffer associ
storag function queue comput complex 4 10 4 12 6
21 6 33 ca780103 jb march 28 1978 5 44
pm 3027 4 3027 3027 5 3027 3027 5 3027
3027 5 3027 3028 5 3027 3027 6 3027 
# 3028
the manchest mark i and atla a hi toric perspect
in 30 year of comput design at manchest univers two
system stand out the mark i develop over the period
1946 49 and the atla 1955 62 thi paper place
each comput in it hi toric context and then describ
the architectur and system softwar in present dai terminolog sever
design concept such as address gener and store manag have
evolv in the progress from mark i to atla the
wider impact of manchest innov in these and other area
is discuss and the contemporari perform of the mark i
and atla is evalu cacm januari 1978 lavington s architectur
index regist page virtual storag extra code compil oper system
ferranti manchest mark i atla icl 1 2 4 22
4 32 6 21 6 30 ca780102 jb march 28
1978 5 50 pm 3028 4 3028 3027 5 3028
3028 5 3028 3028 5 3028 3028 5 3028 3028
6 3028 
# 3029
foreword to the special issu on comput architectur cacm januari
1978 fuller s ca780101 jb march 28 1978 5 52
pm 3029 5 3029 3029 5 3029 3029 5 3029
# 3030
an exampl of hierarch design and proof hierarch program is
be increasingli recogn as help in the construct of larg
program user of hierarch techniqu claim or predict substanti increas
in product and in the reliabl of the program produc
in thi paper we describ a formal method for hierarch
program specif implement and proof we appli thi method to
a signific list process problem and also discuss a number
of extens to current program languag that eas hierarch program
design and proof cacm decemb 1978 spitzen j levitt k
robinson l program verif specif data abstract softwar modul hierarch
structur 4 0 4 6 5 21 5 24 ca781209
dh januari 16 19794 43 pm 2480 4 3030 2704
4 3030 2723 4 3030 2738 4 3030 2738 4
3030 2866 4 3030 2867 4 3030 2869 4 3030
2941 4 3030 2941 4 3030 2956 4 3030 2958
4 3030 2981 4 3030 3004 4 3030 3004 4
3030 3030 4 3030 3030 4 3030 3030 4 3030
3030 4 3030 3030 4 3030 3030 4 3030 3031
4 3030 3049 4 3030 3077 4 3030 3104 4
3030 3155 4 3030 2247 5 3030 2356 5 3030
2457 5 3030 2651 5 3030 2958 5 3030 2972
5 3030 3030 5 3030 3030 5 3030 3030 5
3030 
# 3031
abstract data type and softwar valid a data abstract can
be natur specifi us algebra axiom the virtu of these
axiom is that thei permit a represent independ formal specif
of a data type an exampl is given which show
how to emploi algebra axiom at success level of implement
the major thrust of the paper is twofold first it
is shown how the us of algebra axiomat can simplifi
the process of prove the correct of an implement of
an abstract data type second semi automat tool ar describ
which can be us both to autom such proof of
correct and to deriv an immedi implement from the axiom
thi implement allow for limit test of program at design
time befor a convent implement is accomplish cacm decemb 1978
guttag j horowitz e musser d abstract data type correct
proof data type data structur specif 4 34 5 24
ca781208 dh januari 18 1979 2 51 pm 3030 4
3031 3031 4 3031 3031 4 3031 3049 4 3031
3105 4 3031 3148 4 3031 3150 4 3031 2939
5 3031 2958 5 3031 3031 5 3031 3031 5
3031 3031 5 3031 
# 3032
revers path forward of broadcast packet a broadcast packet is
for deliveri to all node of a network algorithm for
accomplish thi deliveri through a store and forward packet switch
comput network includ 1 transmiss of separ address packet 2
multidestin address 3 hot potato forward 4 span tree forward
and 5 sourc base forward to thi list of algorithm
we add 6 revers path forward a broadcast rout method
which exploit rout procedur and data structur alreadi avail for
packet switch revers path forward is a practic algorithm for
broadcast rout in store and forward packet switch comput network
the algorithm is describ as be practic becaus it is
not optim accord to metric develop for it analysi in
thi paper and also becaus it can be implement in
exist network with less complex than that requir for the
known altern cacm decemb 1978 dalal y metcalf r revers
path forward broadcast packet rout comput network store and forward
packet switch broadcast protocol 3 81 4 32 5 32
ca781207 dh januari 18 1979 3 10 pm 3032 4
3032 3119 4 3032 2849 5 3032 3032 5 3032
3032 5 3032 3032 5 3032 
# 3033
optim decis tree through heurist guid search optim decis tabl
convers ha been tackl in the literatur us two approach
dynam program and branch and bound the former techniqu is
quit effect but it time and space requir ar independ
of how easi the given tabl is furthermor it cannot
be us to produc good quasi optim solut the branch
and bound techniqu us a good heurist to direct the
search but is clutter up by an enorm search space
sinc the number of solut increas with the number of
test variabl accord to a doubl exponenti in thi paper
we suggest a heurist guid top down search algorithm which
like dynam program recogn ident subproblem but which can be
us to find both optim and quasi optim solut the
heurist search method introduc in thi paper combin the posit
aspect of the abov two techniqu compress tabl with a
larg number of variabl can be handl without deriv expand
tabl first cacm decemb 1978 martelli a montanari u decis
tabl optim decis tabl convers decis tree heurist search and
or graph dynam program branch and bound 3 59 3
66 5 42 8 3 ca781206 dh januari 18 1979
3 56 pm 3033 4 3033 3113 4 3033 2856
5 3033 3033 5 3033 3033 5 3033 3033 5
3033 
# 3034
detect of logic error in decis tabl program in thi
paper an algorithm to detect logic error in a limit
entri decis tabl and in loop free program with embed
decis tabl is develop all the condit in the decis
tabl ar assum to be inequ or equal relat linear
express it is also assum that action in a decis
tabl ar linear in variabl which occur in the condit
stub of the decis tabl or tabl to which control
is transfer from the tabl the algorithm is base on
determin whether a set of linear inequ ha or doe
not have a solut the algorithm describ in the paper
is implement in fortran iv cacm decemb 1978 ibramsha m
rajaraman v error diagnost decis tabl 3 5 4 1
4 42 5 24 ca781205 dh januari 18 1979 4
06 pm 2053 4 3034 2221 4 3034 2273 4
3034 2453 4 3034 2517 4 3034 2517 4 3034
2518 4 3034 2616 4 3034 2616 4 3034 2856
4 3034 3034 4 3034 3034 4 3034 3034 4
3034 1684 5 3034 2053 5 3034 2517 5 3034
3034 5 3034 3034 5 3034 3034 5 3034 
# 3035
a strateg plan methodolog for the comput effort in higher
educ an empir evalu the find of a studi design
to address the press problem associ with the strateg plan
of the comput effort in higher educ ar present here
a plan methodolog wa develop and test through implement at
a univers two year after the methodolog wa implement the
effect of the plan methodolog wa assess in term of
the improv of the deliveri of comput servic to the
major institut role of instruct research and administr two control
institut were emploi to contrast the improv at the test
institut the result of the research indic the plan methodolog
significantli enhanc the deliveri of comput servic cacm decemb 1978
wetherb j dock v comput manag comput budget univers comput
comput plan 2 41 3 51 ca781204 dh januari 18
1979 4 26 pm 2977 4 3035 2985 4 3035
3011 4 3035 3035 4 3035 2485 5 3035 3035
5 3035 3035 5 3035 3035 5 3035 
# 3036
the select of optim tab set a new gener of
comput termin allow tab set to be select and set
by the comput thi featur can be us to reduc
the number of charact that ar need to repres a
document for transmiss and print in thi note an algorithm
is given for select the optim set of tab stop
for minim the number of charact transmit an implement of
the algorithm ha reduc the number of charact transmit by
from 7 to 30 percent but requir a prepass through
the document to comput a matrix us in determin the
optim set tab stop the us of fix tab stop
as a heurist altern can achiev about 80 percent of
optim with no prepass cacm decemb 1978 peterson j bitner
j howard j tab word process dynam program 3 9
4 4 ca781203 dh januari 18 1979 4 34 pm
3036 5 3036 3036 5 3036 3036 5 3036 
# 3037
a linear siev algorithm for find prime number a new
algorithm is present for find all prime between 2 and
n the algorithm execut in time proport to n assum
that multipl of integ not larger than n can be
perform in unit time the method ha the same arithmet
complex as the algorithm present by mairson 6 howev our
version is perhap simpler and more eleg it is also
easili extend to find the prime factor of all integ
between 2 and n in time proport to n cacm
decemb 1978 gri d misra j prime algorithm data structur
5 25 5 24 5 29 ca781202 dh januari 22
1979 11 12 am 2896 4 3037 2972 4 3037
3037 4 3037 3037 4 3037 3039 4 3037 3043
4 3037 3073 4 3037 2732 5 3037 2927 5
3037 3037 5 3037 3037 5 3037 3037 5 3037
# 3038
us encrypt for authent in larg network of comput us
of encrypt to achiev authent commun in comput network is
discuss exampl protocol ar present for the establish of authent
connect for the manag of authent mail and for signatur
verif and document integr guarante both convent and public kei
encrypt algorithm ar consid as the basi for protocol cacm
decemb 1978 needham r schroeder m encrypt secur authent network
protocol public kei cryptosystem data encrypt standard 3 81 4
31 4 35 ca781201 dh januari 22 1979 11 18
am 3038 4 3038 3111 4 3038 3177 4 3038
3021 5 3038 3038 5 3038 3038 5 3038 3038
5 3038 3158 5 3038 2436 6 3038 3038 6
3038 3111 6 3038 
# 3039
on the fly garbag collect an exercis in cooper as
an exampl of cooper between sequenti process with veri littl
mutual interfer despit frequent manipul of a larg share data
space a techniqu is develop which allow nearli all of
the activ need for garbag detect and collect to be
perform by an addit processor oper con current with the
processor devot to the comput proper exclus and synchron constraint
have been kept as weak as could be achiev the
sever complex engend by do so ar illustr cacm novemb
1978 dijkstra e lamport l martin a scholten c steffen
e multiprocess fine grain interleav cooper between sequenti process with
minim mutual exclus program correct for multiprogram task garbag collect
4 32 4 34 4 35 4 39 5 24
ca781112 dh januari 22 1979 3 24 pm 2838 4
3039 2896 4 3039 2896 4 3039 2972 4 3039
3037 4 3039 3039 4 3039 3039 4 3039 3039
4 3039 3043 4 3039 3073 4 3039 3074 4
3039 3112 4 3039 2723 5 3039 2732 5 3039
2896 5 3039 3039 5 3039 3039 5 3039 3039
5 3039 
# 3040
synthes constraint express a constraint network represent is present for
a combinatori search problem find valu for a set of
variabl subject to a set of constraint a theori of
consist level in such network is formul which is relat
to problem of backtrack tree search effici an algorithm is
develop that can achiev ani level of consist desir in
order to preprocess the problem for subsequ backtrack search or
to function as an altern to backtrack search by explicitli
determin all solut cacm novemb 1978 freuder e backtrack combinatori
algorithm constraint network constraint satisfact graph color network consist relax
scene label search 3 63 3 64 5 25 5
30 5 32 ca781111 dh januari 22 1979 3 43
pm 1504 4 3040 3040 4 3040 1145 5 3040
3040 5 3040 3040 5 3040 3040 5 3040 
# 3041
median split tree a fast lookup techniqu for frequent occur
kei split tree ar a new techniqu for search set
of kei with highli skew frequenc distribut a split tree
is a binari search tree each node of which contain
two kei valu a node valu which is a maxim
frequent kei in that subtre and a split valu which
partit the remain kei with respect to their lexic order
between the left and right subtre a median split tree
mst us the lexic median of a node s descend
as it split valu to forc the search tree to
be perfectli balanc achiev both a space effici represent of
the tree and high search speed unlik frequenc order binari
search tree the cost of a success search of an
mst is log n bound and veri stabl around minim
valu further an mst can be built for a given
kei order and set of frequenc in time n log
n as oppos to n2 for an optimum binari search
tree a discuss of the applic of mst s to
dictionari lookup for english is present and the perform obtain
is contrast with that of other techniqu cacm novemb 1978
sheil b tree search dictionari lookup binari search heap balanc
tree zipf s law inform retriev 3 74 5 25
5 39 ca781110 dh januari 25 1979 9 49 am
3041 4 3041 3041 4 3041 3126 4 3041 3176
4 3041 2846 5 3041 2905 5 3041 3041 5
3041 3041 5 3041 3041 5 3041 
# 3042
power tree the new class of pk tree is present
where height balanc is maintain for the node ii on
particular path the number of node of a pk tree
asymptot grow as a power of the height in the
worst case a procedur for node insert is given and
the class of tree consid is restrict to ipk tree
which ar buildabl by such a procedur the averag behavior
of such tree studi by an extens set of simul
run is close to that of avl tree in particular
the famili of ipo tree whose main advantag is the
reduc number of restructur requir after node insert is analyz
cacm novemb 1978 luccio f pagli l binari search tree
pk tree ipk tree search length node insert subtre rotat
3 73 3 74 4 34 5 25 5 31
ca781109 dh januari 25 1979 4 29 pm 2839 4
3042 2889 4 3042 2968 4 3042 3009 4 3042
3042 4 3042 3042 4 3042 3042 4 3042 3042
4 3042 3065 4 3042 3096 4 3042 3096 4
3042 3163 4 3042 3163 4 3042 2455 5 3042
2839 5 3042 2889 5 3042 2968 5 3042 3042
5 3042 3042 5 3042 3042 5 3042 
# 3043
distribut process a concurr program concept a languag concept for
concurr process without common variabl is introduc these process commun
and synchron by mean of procedur call and guard region
thi concept is propos for real time applic control by
microcomput network with distribut storag the paper give sever exampl
of distribut process and show that thei includ procedur coroutin
class monitor process semaphor buffer path express and input output
as special case cacm novemb 1978 hansen p concurr program
distribut process microprocessor network nondetermin guard region program languag process
commun and schedul sort arrai coroutin class monitor process semaphor
buffer path express input output 3 8 4 2 4
22 4 32 5 24 ca781108 dh januari 26 1979
10 40 am 2865 4 3043 2866 4 3043 2896
4 3043 2898 4 3043 2972 4 3043 2972 4
3043 3037 4 3043 3039 4 3043 3043 4 3043
3043 4 3043 3073 4 3043 3128 4 3043 3144
4 3043 2597 5 3043 2732 5 3043 3043 5
3043 3043 5 3043 3043 5 3043 
# 3044
a note on condit express evalu of a condit express
mai succe even when the decid predic diverg and the
altern ar record or node whose field have differ content
cacm novemb 1978 friedman d wise d parallel evalu suspend
con lisp condit form if then els ambigu function infinit
structur 4 2 4 13 4 32 5 24 ca781107
dh januari 26 1979 10 44 am 1469 4 3044
1486 4 3044 1491 4 3044 1781 4 3044 2178
4 3044 2326 4 3044 2470 4 3044 2684 4
3044 3044 4 3044 1303 5 3044 3044 5 3044
3044 5 3044 3044 5 3044 
# 3045
a simpl recoveri onli procedur for simpl preced parser a
simpl method is describ enabl simpl preced parser to recov
from syntax error no attempt to repair error is made
yet pars and most semant process can continu the result
is a good first approxim to syntax error handl with
neglig increas in pars time space and complex of both
the parser and it tabl gener cacm novemb 1978 riplei
d syntax error error recoveri pars simpl preced compil debug
4 12 4 42 5 23 ca781106 dh januari 26
1979 10 52 am 1379 4 3045 1542 4 3045
1683 4 3045 1693 4 3045 1693 4 3045 1781
4 3045 1781 4 3045 1787 4 3045 1836 4
3045 1836 4 3045 1945 4 3045 1945 4 3045
2015 4 3045 2060 4 3045 2060 4 3045 2061
4 3045 2061 4 3045 2082 4 3045 2091 4
3045 2091 4 3045 2152 4 3045 2179 4 3045
2179 4 3045 2340 4 3045 2356 4 3045 2546
4 3045 2546 4 3045 2603 4 3045 2698 4
3045 2698 4 3045 2708 4 3045 2708 4 3045
2708 4 3045 2820 4 3045 2824 4 3045 2971
4 3045 2982 4 3045 2986 4 3045 3045 4
3045 3045 4 3045 3045 4 3045 3093 4 3045
1477 5 3045 1491 5 3045 2534 5 3045 3045
5 3045 3045 5 3045 3045 5 3045 
# 3046
comput gener of gamma random variabl ii a reject method
is propos for gener gamma variat with nonintegr shape paramet
a a 1 thi method is similar to other method
given by fishman wallac and tadikamalla and is faster than
these method for a 2 the core storag requir and
the program effort for the propos method ar similar to
those of wallac s or tadikamalla s method the comput
time for the propos method remain fairli constant for medium
and larg valu of a and ar superior to time
obtain by ahren and dieter s method for all valu
of a the propos method is simpler than ahren and
dieter s method cacm novemb 1978 tadikamalla p gamma variabl
reject method comput method 5 5 8 1 ca781105 dh
januari 26 1979 11 02 am 2847 4 3046 2928
4 3046 3046 4 3046 3046 4 3046 3046 4
3046 3098 4 3046 3098 4 3046 3107 4 3046
2569 5 3046 2847 5 3046 3046 5 3046 3046
5 3046 3046 5 3046 3098 5 3046 
# 3047
us synthet imag to regist real imag with surfac model
a number of imag analysi task can benefit from registr
of the imag with a model of the surfac be
imag automat navig us visibl light or radar imag requir
exact align of such imag with digit terrain model in
addit automat classif of terrain us satellit imageri requir such
align to deal correctli with the effect of vari sun
angl and surfac slope even inspect techniqu for certain industri
part mai be improv by thi mean we achiev the
requir align by match the real imag with a synthet
imag obtain from a surfac model and known posit of
the light sourc the synthet imag intens is calcul us
the reflect map a conveni wai of describ surfac reflect
as a function of surfac gradient we illustr the techniqu
us landsat imag and digit terrain model cacm novemb 1978
horn b bachman b imag registr synthet imag surfac model
automat hill shade digit terrain model imag transform imag match
shade imag 3 63 3 11 3 14 8 2
3 83 ca781104 dh januari 26 1979 11 16 am
2816 4 3047 2816 4 3047 2828 4 3047 2827
4 3047 2913 4 3047 3047 4 3047 3047 4
3047 2751 5 3047 2829 5 3047 3047 5 3047
3047 5 3047 3047 5 3047 
# 3048
perform evalu of highli concurr comput by determinist simul simul
is present as a practic techniqu for perform evalu of
altern configur of highli concurr comput a techniqu is describ
for construct a detail determinist simul model of a system
in the model a control stream replac the instruct and
data stream of the real system simul of the system
model yield the time and resourc usag statist need for
perform evalu without the necess of emul the system as
a case studi the implement of a simul of a
model of the cpu memori subsystem of the ibm 360
91 is describ the result of evalu some altern system
design ar discuss the experi reveal that for the case
studi the major bottleneck in the system ar the memori
unit and the fix point unit further it appear that
mani of the sophist pipelin and buffer techniqu simplement in
the architectur of the ibm 360 91 ar of littl
valu when high speed cach memori is us as in
the ibm 360 195 cacm novemb 1978 kumar b davidson
e perform evalu determinist simul control stream concurr comput 6
20 8 1 ca781103 dh januari 26 1979 11 26
am 3048 5 3048 3048 5 3048 3048 5 3048
# 3049
a simpli extend and modifi batch environ graphic system sembeg
sembeg is a complet batch environ graphic system contain compon
for handl graphic data file for displai the content of
these file on a varieti of graphic hardwar and for
perform graphic batch input oper sembeg is easi to extend
and modifi to meet the grow need of a larg
batch environ and is even extend to a fulli interact
system the paper present the conceptu view of graphic lead
to the design of sembeg and outlin the major compon
of the system the design of sembeg is found upon
the basic assumpt that the true aim of comput graphic
is to describ graphic entiti rather than as commonli held
to provid graphic input and output function capabl sembeg is
built around a basic graphic data manag system bagdam which
provid a common mean of commun the descript of graphic
entiti between the variou compon of sembeg bagdam provid facil
for store retriev and manipul the descript of graphic entiti
provid by and receiv by applic program graphic packag and
graphic devic cacm novemb 1978 wendorf j comput graphic data
structur graphic displai graphic input graphic databas devic independ graphic
4 33 4 34 8 2 ca781102 dh januari 26
1979 1 30 pm 3030 4 3049 3031 4 3049
3049 4 3049 3049 4 3049 3049 4 3049 3049
4 3049 2956 5 3049 2957 5 3049 2958 5
3049 2960 5 3049 3049 5 3049 3049 5 3049
3049 5 3049 
# 3050
system design educ a game approach on of the problem
face manag of comput instal is the problem of configur
the comput system to meet the demand made by the
mix of job that the comput center must servic thi
paper present a manag game that allow the player to
configur a comput system to meet a hypothet job mix
is under the control of a game administr and can
be vari to simul a varieti of real world situat
i o bound job comput bound job etc the player
of the game receiv a set of detail report on
the cost of hi choic and a simul run of
the center oper under hi choic cacm novemb 1978 lyon
n system design configur manag game 2 43 2 44
ca781101 dh januari 29 1979 11 43 am 2407 4
3050 2852 4 3050 2852 4 3050 3003 4 3050
3011 4 3050 3050 4 3050 3050 4 3050 2345
5 3050 2387 5 3050 3050 5 3050 3050 5
3050 3050 5 3050 
# 3051
a comparison of heap and the tl structur for the
simul event set none cacm octob 1978 franta w mali
k simul event set heap tl structur 3 34 4
22 5 5 8 1 ca781010 dh januari 29 1979
11 51 am 2844 4 3051 2936 4 3051 3051
4 3051 3051 4 3051 3064 4 3051 3109 4
3051 3109 4 3051 2767 5 3051 2844 5 3051
3051 5 3051 3051 5 3051 3051 5 3051 
# 3052
cold start vs warm start miss ratio in a two
level comput storag hierarchi miss ratio measur ar often made
from a cold start that is made with the first
level store initi empti for larg capac the effect on
the measur miss ratio of the miss incur while fill
the first level store can be signific even for long
refer string us of warm start rather than cold start
miss ratio cast doubt on the widespread belief that the
observ s shape of lifetim reciproc of miss ratio versu
capac curv indic a properti of behavior of program that
maintain a constant number of page in main storag on
the other hand if cold start miss ratio ar measur
as a function of capac and measur length then thei
ar us in studi system in which oper of a
program is period interrupt by task switch it is shown
how to obtain under simpl assumpt the cach miss ratio
for multiprogram from cold start miss ratio valu and how
to obtain approxim cold start miss ratio from warm start
miss ratio cacm octob 1978 easton m fagin r miss
ratio cold start warm start storag hierarchi lifetim function multiprogram
s shape 3 70 4 32 9 35 ca781009 dh
januari 29 1979 5 16 pm 2374 4 3052 2481
4 3052 2669 4 3052 2863 4 3052 3016 4
3052 3052 4 3052 1901 5 3052 3052 5 3052
3052 5 3052 3052 5 3052 
# 3053
pack scatter tabl scatter tabl for open address benefit from
recurs entri displac cutoff for unsuccess search and auxiliari cost
function compar with convent method the new techniqu provid substanti
improv tabl that resembl exact solut optim pack the displac
ar depth limit approxim to an enum exhaust optim although
pack cost remain linear o n with tabl size n
the techniqu ar primarili suit for import fix but possibl
quit larg tabl for which refer frequenc mai be known
op code tabl spell dictionari access arrai introduct of frequenc
weight further improv retriev but the enhanc mai degrad cutoff
cacm octob 1978 lyon g assign problem backtrack program hash
open address recurs scatter tabl rearrang 3 74 4 0
ca781008 dh januari 29 1979 5 30 pm 1207 4
3053 1208 4 3053 1676 4 3053 1682 4 3053
1728 4 3053 1860 4 3053 1973 4 3053 1973
4 3053 1973 4 3053 1992 4 3053 2018 4
3053 2018 4 3053 2032 4 3053 2033 4 3053
2107 4 3053 2109 4 3053 2138 4 3053 2203
4 3053 2203 4 3053 2203 4 3053 2251 4
3053 2251 4 3053 2251 4 3053 2251 4 3053
2359 4 3053 2412 4 3053 2524 4 3053 2530
4 3053 2534 4 3053 2537 4 3053 2543 4
3053 2543 4 3053 2543 4 3053 2543 4 3053
2552 4 3053 2559 4 3053 2559 4 3053 2559
4 3053 2573 4 3053 2704 4 3053 2770 4
3053 2770 4 3053 2770 4 3053 2770 4 3053
2974 4 3053 2991 4 3053 2991 4 3053 3053
4 3053 3053 4 3053 3053 4 3053 3053 4
3053 3053 4 3053 3053 4 3053 3053 4 3053
3053 4 3053 3053 4 3053 3053 4 3053 3053
4 3053 3083 4 3053 3083 4 3053 3083 4
3053 1329 5 3053 1785 5 3053 1973 5 3053
1992 5 3053 2107 5 3053 2109 5 3053 2412
5 3053 2543 5 3053 2673 5 3053 2707 5
3053 2770 5 3053 3053 5 3053 3053 5 3053
3053 5 3053 
# 3054
implement quicksort program thi paper is a practic studi of
how to implement the quicksort sort algorithm and it best
variant on real comput includ how to appli variou code
optim techniqu a detail implement combin the most effect improv
to quicksort is given along with a discuss of how
to implement it in assembl languag analyt result describ the
perform of the program ar summar a varieti of special
situat ar consid from a practic standpoint to illustr quicksort
s wide applic as an intern sort method which requir
neglig extra storag cacm octob 1978 sedgewick r quicksort analysi
of algorithm code optim sort 4 0 4 6 5
25 5 31 5 5 ca781007 dh januari 29 1979
5 40 pm 1175 4 3054 1919 4 3054 1919
4 3054 1919 4 3054 1969 4 3054 1969 4
3054 1997 4 3054 1997 4 3054 2118 4 3054
2191 4 3054 2191 4 3054 2216 4 3054 2216
4 3054 2216 4 3054 2227 4 3054 2319 4
3054 2388 4 3054 2388 4 3054 2348 4 3054
2582 4 3054 2669 4 3054 2679 4 3054 2679
4 3054 2679 4 3054 2679 4 3054 2783 4
3054 2783 4 3054 2784 4 3054 3054 4 3054
3054 4 3054 3054 4 3054 3054 4 3054 3054
4 3054 3054 4 3054 3054 4 3054 3054 4
3054 3054 4 3054 3054 4 3054 3054 4 3054
3054 4 3054 3121 4 3054 3121 4 3054 864
4 3054 1175 5 3054 1880 5 3054 1919 5
3054 1969 5 3054 1980 5 3054 1997 5 3054
307 5 3054 308 5 3054 309 5 3054 2017
5 3054 2679 5 3054 3054 5 3054 3054 5
3054 3054 5 3054 776 5 3054 
# 3055
an analysi of algorithm for the dutch nation flag problem
solut to the dutch nation flag problem have been given
by dijkstra 1 and meyer 3 dijkstra start with a
simpl program and arriv at an improv program by refin
both of the algorithm given by dijkstra ar shown to
have an expect number of swap which is 2 3n
0 1 and that these valu differ at most by
1 3 of a swap and asymptot by 1 4
of a swap the algorithm of meyer is shown to
have expect swap complex 5 9n cacm octob 1978 mcmaster
c algorithm analysi dutch nation flag problem refin structur program
4 0 5 24 5 25 5 3 ca781006 dh
januari 29 1979 5 47 pm 3055 5 3055 3055
5 3055 3055 5 3055 3170 5 3055 3055 6
3055 3104 6 3055 
# 3056
count larg number of event in small regist it is
possibl to us a small counter to keep approxim count
of larg number the result expect error can be rather
precis control an exampl is given in which 8 bit
counter byte ar us to keep track of as mani
as 130 000 event with a rel error which is
substanti independ of the number n of event thi rel
error can be expect to be 24 percent or less
95 percent of the time i e o n 8
the techniqu could be us to advantag in multichannel count
hardwar or softwar us for the monitor of experi or
process cacm octob 1978 morri r count 5 11 ca781005
dh januari 29 1979 5 52 pm 3056 5 3056
3056 5 3056 3056 5 3056 
# 3057
optim hi togram match by monoton grai level transform thi
paper investig the problem of optim hi togram match us
monoton grai level transform which alwai assign all pictur point
of a given grai level i to anoth grai level
t i such that if i j then t i
t j the object is to find a transform digit
pictur of a given pictur such that the sum of
absolut error between the grai level hi togram of the
transform pictur and that of a refer pictur is minim
thi is equival to place k1 linearli order object of
differ size on by on into k2 linearli order box
of assort size such that the accumul error of space
under pack or overpack in the box is minim the
placement function is monoton which ensur a polynomi time solut
to thi problem a tree search algorithm for optim hi
togram match is present which ha time complex o k1
x k2 if the monoton properti is drop then the
problem becom np complet even if it is restrict to
k2 2 cacm octob 1978 chang s wong y optim
hi togram match grai level transform pack problem tree search
algorithm pictur process 3 24 5 25 5 42 ca781004
dh januari 29 1979 6 08 pm 3057 5 3057
3057 5 3057 3057 5 3057 
# 3058
jump search a fast sequenti search techniqu when sequenti file
structur must be us and binari search is not feasibl
jump search becom an appeal altern thi paper explor variant
of the classic jump search scheme where the optimum jump
size is the squar root of the number of record
multipl level and variabl size jump strategi ar explor appropri
applic ar discuss and perform is evalu cacm octob 1978
shneiderman b jump search sequenti file file manag search strategi
databas structur index search 3 74 4 34 ca781003 dh
januari 29 1979 6 15 pm 3058 4 3058 3063
4 3058 2978 5 3058 3058 5 3058 3058 5
3058 3058 5 3058 
# 3059
model for parallel process within program applic to cpu i
o and i o i o overlap approxim queue model
for intern parallel process by individu program in a multiprogram
system ar develop in thi paper the solut techniqu is
develop by network decomposit the model ar formul in term
of cpu i o and i o i o overlap
and appli to the analysi of these problem the percentag
perform improv from cpu i o overlap is found to
be greatest for system which ar in approxim cpu i
o util balanc and for low degre of multiprogram the
percentag improv from i o i o overlap is found
to be greatest for systemtem in which the i o
system is more util than the cpu cacm octob 1978
towslei d chandi k brown j multiprogram parallel process queue
network model multiprocess of comput and i o 4 32
8 1 ca781002 dh januari 29 1979 6 23 pm
3059 4 3059 3070 4 3059 1685 5 3059 2988
5 3059 3059 5 3059 3059 5 3059 3059 5
3059 3059 6 3059 
# 3060
fortran 77 there is a new standard fortran the offici
titl is american nation standard program languag fortran x3 9
1978 but it is more commonli refer to as fortran
77 sinc it develop wa complet in 1977 it replac
the fortran standard design x3 9 1966 thi paper describ
mani of the featur of fortran 77 and also provid
some inform about how and why the standard wa develop
cacm octob 1978 brainerd w none none ca781001 dh januari
29 1979 6 28 pm 1613 4 3060 1646 4
3060 1900 4 3060 1955 4 3060 2025 4 3060
2154 4 3060 2154 4 3060 2365 4 3060 2506
4 3060 2915 4 3060 3060 4 3060 3060 4
3060 3060 4 3060 987 5 3060 1900 5 3060
2154 5 3060 3060 5 3060 3060 5 3060 3060
5 3060 
# 3061
simul of dynam sequenti search algorithm none cacm septemb 1978
tenenbaum a search list process sequenti search dynam reorder simul
3 74 8 1 ca780911 dh januari 29 1979 6
30 pm 3061 4 3061 2885 5 3061 3061 5
3061 3061 5 3061 3061 5 3061 
# 3062
real time plot of approxim contour map none cacm septemb
1978 ward s contour map digit plot graphic charact 3
10 3 20 4 41 8 2 ca780910 dh januari
29 1979 6 33 pm 2287 4 3062 2547 4
3062 3062 4 3062 3062 4 3062 1871 5 3062
1925 5 3062 3062 5 3062 3062 5 3062 3062
5 3062 
# 3063
a note on virtual memori index none cacm septemb 1978
mali k index b tree page file organ link represent
mainten cost 3 02 3 50 3 51 3 73
3 74 ca780909 dh januari 29 1979 6 36 pm
3058 4 3063 3063 4 3063 2978 5 3063 3063
5 3063 3063 5 3063 3063 5 3063 
# 3064
event manipul for discret simul requir larg number of event
the event manipul system present here consist of two major
part the first part address the familiar problem of event
schedul effici when the number of schedul event grow larg
the second part deal with the less appar problem of
provid effici and flexibl as schedul event ar access to
be execut addit featur and problem dealt with includ the
proper handl of simultan event that certain event must be
creat schedul and execut at the same point in simul
time that infinit loop caus by the concaten of such
zero time event ar possibl and must be diagnos that
maintain variou event count is practic and econom and that
a capabl for handl time displac event is desir and
possibl cacm septemb 1978 ulrich e simul discret system simul
discret event simul time flow mechan 3 65 3 74
4 22 8 1 ca780908 dh januari 29 1979 6
46 pm 2767 4 3064 2844 4 3064 2844 4
3064 2936 4 3064 2936 4 3064 3051 4 3064
3064 4 3064 3064 4 3064 3064 4 3064 3064
4 3064 3064 4 3064 3109 4 3064 1846 5
3064 1939 5 3064 2742 5 3064 2767 5 3064
2936 5 3064 3064 5 3064 3064 5 3064 3064
5 3064 
# 3065
right brother tree insert and delet ar provid for the
class of right or on side brother tree which have
o log n perform the import of these result stem
from the close relationship of right brother tree which have
an insert algorithm oper in o log2 n further although
both insert and delet can be carri out in o
log n time for right brother tree it appear that
the insert algorithm is inher much more difficult than the
delet algorithm the revers of what on usual obtain cacm
septemb 1978 ottmann t six h wood d dictionari problem
search tree avl tree brother tree right balanc tree on
side height balanc tree insert and delet algorithm 3 73
3 74 5 31 ca780807 dh januari 29 1979 7
08 pm 3009 4 3065 3042 4 3065 3065 4
3065 3065 4 3065 3096 4 3065 3163 4 3065
3163 4 3065 2839 5 3065 3065 5 3065 3065
5 3065 3065 5 3065 3096 5 3065 3163 5
3065 2839 6 3065 2889 6 3065 3009 6 3065
3065 6 3065 3096 6 3065 
# 3066
a control experi in program test and code walkthrough inspect
thi paper describ an experi in program test emploi 59
highli experienc data process profession us seven method to test
a small pl i program the result show that the
popular code walk through inspect method wa as effect as
other comput base method in find error and that the
most effect method in term of error found and cost
emploi pair of subject who test the program independ and
then pool their find the studi also show that there
is a tremend amount of variabl among subject and that
the abil to detect certain type of error vari from
method to method cacm septemb 1978 myer g softwar reliabl
program verif debug test code walkthrough code inspect personnel select
4 6 ca780906 dh februari 5 1979 10 47 am
3066 5 3066 3066 5 3066 3066 5 3066 
# 3067
gener work set for segment refer string the work set
concept is extend for program that refer segment of differ
size the gener work set polici gw keep as it
resid set those segment whose retent cost do not exce
their retriev cost the gw is a model for the
entir class of demand fetch memori polici that satisfi a
resid set inclus properti a gener optim polici gopt is
also defin at it oper point it minim aggreg retent
and swap cost special case of the cost structur allow
gw and gopt to simul ani known stack algorithm the
work set and vmin effici procedur for comput demand curv
show swap load as a function of memori usag ar
develop for gw and gopt polici empir data from an
actual system ar includ cacm septemb 1978 den p slutz
d databas referenc memori manag optim memori polici page program
behavior program measur segment work set 4 30 8 10
ca780905 dh februari 5 1979 11 20 am 1892 4
3067 1901 4 3067 2085 4 3067 2095 4 3067
2218 4 3067 2277 4 3067 2319 4 3067 2329
4 3067 2358 4 3067 2373 4 3067 2373 4
3067 2374 4 3067 2380 4 3067 2380 4 3067
2434 4 3067 2499 4 3067 2450 4 3067 2450
4 3067 2501 4 3067 2582 4 3067 2595 4
3067 2669 4 3067 2828 4 3067 2863 4 3067
2863 4 3067 2881 4 3067 2928 4 3067 2996
4 3067 2996 4 3067 2996 4 3067 3000 4
3067 3006 4 3067 3006 4 3067 3006 4 3067
3006 4 3067 3067 4 3067 3067 4 3067 3067
4 3067 3067 4 3067 3067 4 3067 3067 4
3067 3067 4 3067 3067 4 3067 1751 5 3067
2373 5 3067 2374 5 3067 2595 5 3067 2682
5 3067 2863 5 3067 2864 5 3067 3006 5
3067 3067 5 3067 3067 5 3067 3067 5 3067
# 3068
a model for verif of data secur in oper system
program verif appli to kernel architectur form a promis method
for provid uncircumvent secur share comput system a precis definit
of data secur is develop here in term of a
gener model for oper system thi model is suitabl as
a basi for verifi mani of those properti of an
oper system which ar necessari to assur reliabl enforc of
secur the applic of thi approach to the ucla secur
oper system is also discuss cacm septemb 1978 popek g
farber d oper system secur protect program verif 4 35
5 24 ca780904 dh februari 5 1979 2 40 pm
2021 4 3068 2222 4 3068 2227 4 3068 2315
4 3068 2326 4 3068 2470 4 3068 2732 4
3068 2865 4 3068 2896 4 3068 2943 4 3068
3014 4 3068 3068 4 3068 3068 4 3068 3077
4 3068 3143 4 3068 1834 5 3068 2869 5
3068 3068 5 3068 3068 5 3068 3068 5 3068
3105 5 3068 1471 6 3068 2625 6 3068 2632
6 3068 2868 6 3068 2939 6 3068 3068 6
3068 
# 3069
a practic interprocedur data flow analysi algorithm a new interprocedur
data flow analysi algorithm is present and analyz the algorithm
associ with each procedur in a program inform about which
variabl mai be modifi which mai be us and which
ar possibl preserv by a call on the procedur and
all of it subcal the algorithm is suffici power to
be us on recurs program and to deal with the
share of variabl which aris through refer paramet the algorithm
is uniqu in that it can comput all of thi
inform in a singl pass not requir a prepass to
comput call relationship or share pattern the algorithm is asymptot
optim in time complex it ha been implement and is
practic even on program which ar quit larg cacm septemb
1978 barth j data flow analysi global flow analysi optim
side effect relat refer paramet incarn 4 12 4 20
ca780903 dh februari 5 1979 3 07 pm 1086 4
3069 1132 4 3069 1234 4 3069 1263 4 3069
1265 4 3069 1270 4 3069 1323 4 3069 1358
4 3069 1379 4 3069 1380 4 3069 1453 4
3069 1464 4 3069 1484 4 3069 1491 4 3069
1498 4 3069 1613 4 3069 1614 4 3069 1781
4 3069 1825 4 3069 1860 4 3069 2083 4
3069 2178 4 3069 2179 4 3069 2252 4 3069
2325 4 3069 2341 4 3069 2546 4 3069 2645
4 3069 2652 4 3069 2684 4 3069 2842 4
3069 2929 4 3069 2934 4 3069 3069 4 3069
669 4 3069 679 4 3069 691 4 3069 761
4 3069 949 4 3069 989 4 3069 3069 5
3069 3069 5 3069 3069 5 3069 3184 5 3069
# 3070
hybrid simul model of comput system thi paper describ the
structur and oper of a hybrid simul model in which
both discret event simul and analyt techniqu ar combin to
produc effici yet accur system model in an exampl base
on a simpl hypothet comput system discret event simul is
us to model the arriv and activ of job and
a central server queue network model the us of system
processor the accuraci and effici of the hybrid techniqu ar
demonstr by compar the result and comput cost of the
hybrid model of the exampl with those of an equival
simul onli model cacm septemb 1978 schwetman h perform evalu
simul queue network model central server model 4 32 4
35 8 1 ca780902 dh februari 5 1979 3 32
pm 2712 4 3070 2741 4 3070 3016 4 3070
3059 4 3070 3070 4 3070 3070 4 3070 3070
4 3070 3070 4 3070 3153 4 3070 1805 5
3070 2454 5 3070 2741 5 3070 2988 5 3070
3070 5 3070 3070 5 3070 3070 5 3070 
# 3071
an algorithm us symbol techniqu for the bel petrov classif
of gravit field in thi note an algorithm is present
for the symbol calcul of certain algebra invari of the
weyl tensor which permit the determin of the bel petrov
type of a gravit field thi algorithm although more special
than that of d inverno and russel clark requir neither
the us of a special coordin system nor the spin
coeffici formal the algorithm ha been implement in formac and
is design to complet the classif scheme propos by petrov
in hi book an appendix contain exampl illustr the us
of the algorithm cacm septemb 1978 harri r zund j
gener rel bel petrov type formac symbol manipul tensor 3
11 3 15 3 17 ca780901 dh februari 5 1979
3 43 pm 2170 4 3071 3071 4 3071 2165
5 3071 3071 5 3071 3071 5 3071 3071 5
3071 
# 3072
feedback coupl resourc alloc polici in the multiprogram multiprocessor comput
system model studi of some integr feedback driven schedul system
for multiprogram multiprocessor comput system ar present the basic control
variabl us ar the data flow rate for the process
execut on the cpu the model system featur simul continu
flow and preempt resum schedul of input output activ attent
is given to the amount of memori resourc requir for
effect process of the i o activ buffer space assign
the model studi us both distribut driven and trace driven
techniqu even rel simpl dynam schedul ar shown to improv
system perform as measur by user cpu time over that
given by optim or near optim static schedul imbed in
ident system structur and workload environ the improv is greatest
under a heavi i o demand workload cacm august 1978
brice r brown j integr schedul feedback schedul multiprogram system
i o system schedul 4 32 4 35 ca780806 dh
februari 5 1979 4 01 pm 2571 4 3072 2628
4 3072 2891 4 3072 2950 4 3072 3072 4
3072 3072 4 3072 3072 4 3072 3072 4 3072
3119 4 3072 1713 5 3072 2219 5 3072 2245
5 3072 2375 5 3072 3072 5 3072 3072 5
3072 3072 5 3072 
# 3073
commun sequenti process thi paper suggest that input and output
ar basic primit of program and that parallel composit of
commun sequenti process is a fundament program structur method when
combin with a develop of dijkstra s guard command these
concept ar surprisingli versatil their us is illustr by sampl
solut of a varieti of familiar program exercis cacm august
1978 hoar c program program languag program primit program structur
parallel program concurr input output guard command nondeterminaci coroutin procedur
multipl entri multipl exit class data represent recurs condit critic
region monitor iter arrai 4 20 4 22 4 32
ca780805 dh februari 7 1979 10 07 am 249 4
3073 254 4 3073 272 4 3073 1102 4 3073
1109 4 3073 1140 4 3073 1188 4 3073 1306
4 3073 1323 4 3073 1358 4 3073 1380 4
3073 1464 4 3073 1491 4 3073 1665 4 3073
1767 4 3073 1781 4 3073 1781 4 3073 1787
4 3073 1787 4 3073 1949 4 3073 1989 4
3073 321 4 3073 2059 4 3073 2112 4 3073
2126 4 3073 2534 4 3073 2541 4 3073 435
4 3073 437 4 3073 463 4 3073 483 4
3073 491 4 3073 2698 4 3073 2732 4 3073
2733 4 3073 2820 4 3073 2896 4 3073 2972
4 3073 560 4 3073 583 4 3073 3037 4
3073 3039 4 3073 3043 4 3073 3073 4 3073
3073 4 3073 3073 4 3073 3155 4 3073 627
4 3073 631 4 3073 632 4 3073 642 4
3073 644 4 3073 653 4 3073 680 4 3073
761 4 3073 762 4 3073 763 4 3073 123
4 3073 140 4 3073 919 4 3073 989 4
3073 196 5 3073 2732 5 3073 3073 5 3073
3073 5 3073 3073 5 3073 3148 5 3073 3150
5 3073 3155 5 3073 799 5 3073 1860 6
3073 2060 6 3073 2204 6 3073 2247 6 3073
2704 6 3073 2817 6 3073 2842 6 3073 2865
6 3073 2939 6 3073 2939 6 3073 2940 6
3073 2941 6 3073 2943 6 3073 3073 6 3073
3073 6 3073 3073 6 3073 3148 6 3073 799
6 3073 
# 3074
a time and space effici garbag compact algorithm given an
area of storag contain scatter mark node of differ size
on mai wish to rearrang them into a compact mass
at on end of the area while revis all pointer
to mark node to show their new locat an algorithm
is describ here which accomplish thi task in linear time
rel to the size of the storag area and in
a space of the order of on bit for each
pointer the algorithm oper by revers encod the situat that
a collect of locat point to a singl locat by
a linear list eman from the point to locat pass
through the point locat and termin with the point to
locat s transplant content cacm august 1978 morri f garbag
collect compact compact ific storag reclam storag alloc record structur
reloc list process free storag pointer data structur 4 34
4 49 5 32 ca780804 dh februari 7 1979 10
16 am 1972 4 3074 1972 4 3074 2156 4
3074 2156 4 3074 2168 4 3074 2249 4 3074
2361 4 3074 2438 4 3074 2513 4 3074 2723
4 3074 2736 4 3074 2736 4 3074 2736 4
3074 2833 4 3074 2838 4 3074 2855 4 3074
2855 4 3074 2896 4 3074 3039 4 3074 3074
4 3074 3074 4 3074 3074 4 3074 3074 4
3074 3106 4 3074 3112 4 3074 3112 4 3074
3112 4 3074 1826 5 3074 1853 5 3074 1972
5 3074 2723 5 3074 3074 5 3074 3074 5
3074 3074 5 3074 
# 3075
fast parallel sort algorithm a parallel bucket sort algorithm is
present that requir time o log n and the us
of n processor the algorithm make us of a techniqu
that requir more space than the product of processor and
time a realist model is us model is us in
which no memori content is permit a procedur is also
present to sort n number in time o k log
n us n 1 1 k processor for k an
arbitrari integ the model of comput for thi procedur permit
simultan fetch from the same memori locat cacm august 1978
hirschberg d parallel process sort algorithm bucket sort 3 74
4 34 5 25 5 31 ca780803 dh februari 7
1979 10 25 am 2714 4 3075 3075 4 3075
3075 4 3075 3075 4 3075 3075 4 3075 3085
4 3075 3156 4 3075 2289 5 3075 2557 5
3075 2664 5 3075 2714 5 3075 3075 5 3075
3075 5 3075 3075 5 3075 3156 5 3075 2289
6 3075 2973 6 3075 3075 6 3075 
# 3076
valu conflict and social choic in electron fund transfer system
develop dure the last few year comput base system which
autom the transfer and record of debit and credit have
begun to be implement on a larg scale these system
promis both financi benefit for the institut that us them
and potenti conveni to their custom howev thei also rais
signific social legal and technic question that must be resolv
if full scale system for electron fund transfer eft ar
not to caus more problem for the larger public than
thei solv thi paper examin the incent for eft develop
and the social problem thei rais in the context of
conflict between five differ valu posit that ar often implicit
in analys of propos eft arrang these conflict reflect the
rel import of certain problem for specif group the valu
posit implicit in eft propos help to organ analys of
market arrang system reliabl and privaci of transact these topic
ar analyz in thi articl and relat to the valu
posit held by concern parti last the wai in which
the public can learn about the social qualiti of differ
eft arrang and the pace of eft develop ar both
discuss in the context of social choic cacm august 1978
kling r electron fund transfer system social impact of comput
privaci social choic comput network network reliabl secur social valu
2 11 2 12 2 3 3 52 3 53
3 55 ca780802 dh februari 7 1979 2 25 pm
2756 4 3076 3076 4 3076 3076 4 3076 3179
4 3076 2607 5 3076 2840 5 3076 3076 5
3076 3076 5 3076 3076 5 3076 3142 5 3076
3179 5 3076 3178 5 3076 3182 5 3076 3183
5 3076 2572 6 3076 2583 6 3076 2607 6
3076 3076 6 3076 3076 6 3076 3076 6 3076
3076 6 3076 3076 6 3076 3140 6 3076 3142
6 3076 3179 6 3076 3180 6 3076 3181 6
3076 3182 6 3076 
# 3077
can program be liber from the von neumann style a
function style and it algebra of program convent program languag
ar grow ever more enorm but not stronger inher defect
at the most basic level caus them to be both
fat and weak their primit word at a time style
of program inherit from their common ancestor the von neumann
comput their close coupl off semant to state transit their
divis of program into a world of express and a
world of statement their inabl to effect us power combin
form for build new program from exist on and their
lack of us mathemat properti for reason about program an
altern function style of program is found on the us
of combin form for creat program function program deal with
structur data ar often nonrepetit and nonrecurs ar hierarch construct
do not name their argument and do not requir the
complex machineri of procedur declar to becom gener applic combin
form can us high level program to build still higher
level on in a style not possibl in convent languag
associ with the function style of program is an algebra
of program whose variabl rang over program and whose oper
ar combin form thi algebra can be us to transform
program and to solv equat whose unknown ar program in
much the same wai on transform equat in high school
algebra these transform ar given by algebra law and ar
carri out in the same languag in which program ar
written combin form ar chosen not onli for their program
power but also for the power of their associ algebra
law gener theorem of of the algebra give the detail
behavior and termin condit for larg class of program a
new class of comput system us the function program style
both in it program languag and in it state transit
rule unlik von neumann languag these system have semant loos
coupl to state onli on state transit occur per major
comput cacm august 1978 backu j function program algebra of
program combin form function form program languag von neumann comput
von neumann languag model of comput system applic comput system
applic state transit system program transform program correct program termin
metacomposit 4 20 4 29 5 20 5 24 5
26 ca780801 dh februari 7 1979 3 13 pm 1024
4 3077 1051 4 3077 1102 4 3077 1132 4
3077 1390 4 3077 1486 4 3077 1549 4 3077
1706 4 3077 1826 4 3077 1878 4 3077 378
4 3077 2021 4 3077 2060 4 3077 2155 4
3077 2155 4 3077 2168 4 3077 2222 4 3077
2227 4 3077 2294 4 3077 2315 4 3077 2326
4 3077 2470 4 3077 2558 4 3077 2719 4
3077 2723 4 3077 2732 4 3077 2838 4 3077
2842 4 3077 2842 4 3077 2855 4 3077 2865
4 3077 2879 4 3077 2896 4 3077 2943 4
3077 2981 4 3077 3014 4 3077 3030 4 3077
3068 4 3077 3077 4 3077 3077 4 3077 3077
4 3077 3077 4 3077 3080 4 3077 3104 4
3077 3106 4 3077 3143 4 3077 3150 4 3077
627 4 3077 106 4 3077 210 5 3077 1834
5 3077 2060 5 3077 2457 5 3077 3077 5
3077 3077 5 3077 3077 5 3077 
# 3078
analysi of the avail of comput system us comput aid
algebra analyt result relat to the avail of a comput
system construct of unreli processor ar present in thi paper
these result ar obtain by us variou comput aid algebra
manipul techniqu a major purpos of thi paper is to
demonstr that the difficulti of obtain analyt solut to markov
process can be consider reduc by the applic of symbol
manipul program sinc mani physic system can be model by
markov and semi markov process the potenti rang of applic
of these techniqu is much wider than the problem of
avail analyz here cacm juli 1978 chattergi r pooch u
comput aid algebra symbol manipul markov process reliabl redund structur
on line comput system 3 82 5 5 5 7
8 1 8 3 ca780710 dh februari 7 1979 3
37 pm 3078 5 3078 3078 5 3078 3078 5
3078 
# 3079
an algorithm for reason about equal a simpl techniqu for
reason about equal that is fast and complet for ground
formula with function symbol and equal is present a proof
of correct is given as well cacm juli 1978 shostak
r theorem prove deduct program verif equal 3 64 3
66 5 21 ca780709 dh februari 7 1979 3 41
pm 3079 5 3079 3079 5 3079 3079 5 3079
# 3080
prove the correct of heurist optim code a system for
prove that program written in a high level languag ar
correctli translat to a low level languag is describ a
primari us of the system is as a post optim
step in code gener the low level languag program need
not be gener by a compil and in fact could
be hand code exampl of the us of such a
system ar given some interest result ar the abil to
handl program that implement recurs by bypass the start of
the program and the detect and pinpoint of a wide
class of error in the low level languag program the
exampl demonstr that optim of the genr of thi paper
can result in substanti faster oper and the save of
memori in term of program and stack size cacm juli
1978 samet h compil correct code optim debug program verif
lisp 4 12 4 21 4 22 5 24 ca780708
dh februari 7 1979 3 53 pm 1024 4 3080
1051 4 3080 1102 4 3080 1132 4 3080 1390
4 3080 1486 4 3080 1549 4 3080 1706 4
3080 1826 4 3080 1878 4 3080 378 4 3080
2060 4 3080 2155 4 3080 2168 4 3080 2719
4 3080 2723 4 3080 2838 4 3080 2842 4
3080 2855 4 3080 2879 4 3080 3077 4 3080
3080 4 3080 3080 4 3080 3106 4 3080 627
4 3080 106 4 3080 210 5 3080 2850 5
3080 3080 5 3080 3080 5 3080 3080 5 3080
# 3081
shallow bind in lisp 1 5 shallow bind is a
scheme which allow the valu of a variabl to be
access in a bound amount of comput an eleg model
for shallow bind in lisp 1 5 is present in
which context switch is an environ tree transform call reroot
reroot is complet gener and revers and is option in
the sens that a lisp 1 5 interpret will oper
correctli whether or not reroot is invok on veri context
chang sinc reroot leav assoc v a invari for all
variabl v and all environ a the programm can have
access to a reroot primit shallow which give him dynam
control over whether access ar shallow or deep and which
affect onli the speed of execut of a program not
it semant in addit multipl process can be activ in
the same environ structur so long as reroot is an
indivis oper final the concept of reroot is shown to
combin the concept of shallow bind in lisp with dijkstra
s displai for algol and henc is a gener model
for shallow bind cacm juli 1978 baker h jr lisp
1 5 environ tree funarg s shallow bind deep bind
multiprogram algol displai 4 13 4 22 4 32 ca780707
dh februari 7 1979 4 14 pm 2625 4 3081
2922 4 3081 3081 4 3081 3101 4 3081 3112
4 3081 2438 5 3081 3081 5 3081 3081 5
3081 3081 5 3081 
# 3082
time clock and the order of event in a distribut
system the concept of on event happen befor anoth in
a distribut system is examin and is shown to defin
a partial order of the event a distribut algorithm is
given for synchron a system of logic clock which can
be us to total order the event the us of
the total order is illustr with a method for solv
synchron problem the algorithm is then special for synchron physic
clock and a bound is deriv on how far out
of synchroni the clock can becom cacm juli 1978 lamport
l distribut system comput network clock synchron multiprocess system 4
32 5 29 ca780706 dh februari 7 1979 4 30
pm 3082 5 3082 3082 5 3082 3082 5 3082
3128 5 3082 2150 6 3082 2376 6 3082 2436
6 3082 2597 6 3082 2865 6 3082 2866 6
3082 2870 6 3082 2912 6 3082 3082 6 3082
# 3083
pseudochain in hash tabl thi paper present pseudochain as a
new collis resolut method pseudochain is half wai between open
address and chain it ow it name to the fact
that link field ar present in each cell of the
hash tabl which permit chain of the first overflow item
in the tabl the effici of the method is deriv
and a tradeoff analysi is given cacm juli 1978 halatsi
c philokypr g hash code scatter storag open address chain
pseudochain collis resolut search uniform probe 3 7 3 73
3 74 4 9 ca780705 dh februari 7 1979 4
37 pm 1973 4 3083 1992 4 3083 2138 4
3083 2203 4 3083 2251 4 3083 2251 4 3083
2282 4 3083 2412 4 3083 2530 4 3083 2534
4 3083 2537 4 3083 2543 4 3083 2543 4
3083 2559 4 3083 2559 4 3083 2573 4 3083
2770 4 3083 2860 4 3083 2991 4 3083 3053
4 3083 3053 4 3083 3053 4 3083 3083 4
3083 3083 4 3083 3083 4 3083 3083 4 3083
3083 4 3083 1328 5 3083 1973 5 3083 2107
5 3083 2543 5 3083 2552 5 3083 3083 5
3083 3083 5 3083 3083 5 3083 
# 3084
interpol search a log logn search interpol search is a
method of retriev a desir record by kei in an
order file by us the valu of the kei and
the statist distribut of the kei it is shown that
on the averag log logn file access ar requir to
retriev a kei assum that the n kei ar uniformli
distribut the number of extra access is also estim and
shown to be veri low the same hold if the
cumul distribut function of the kei is known comput experi
confirm these result cacm juli 1978 perl y itai a
avni h averag number of access binari search databas interpol
search retriev search uniform distribut 4 4 4 6 5
25 ca780704 dh februari 7 1979 4 50 pm 3084
5 3084 3084 5 3084 3084 5 3084 
# 3085
an o n algorithm for determin a near optim comput
order of matrix chain product thi paper discuss the comput
of matrix chain product of the form m1 x m2
x x mn where mi s ar matric the order
in which the matric ar comput affect the number of
oper a suffici condit about the associ of the matric
in the optim order is present an o n algorithm
to find an order of comput which take less than
25 percent longer than the optim time topt is also
present in most case the algorithm yield the optim order
or an order which take onli a few percent longer
than topt less than 1 percent on the averag cacm
juli 1978 chin f approxim algorithm heurist algorithm matrix multipl
matrix chain product 5 14 ca780703 dh februari 8 1979
2 46 pm 3075 4 3085 3085 4 3085 2557
5 3085 3085 5 3085 3085 5 3085 3085 5
3085 
# 3086
on the complex of comput the measur of u ai
bi the decis tree complex of comput the measur of
the union of n possibl overlap interv is shown to
be n log n even if comparison between linear function
of the interv endpoint ar allow the exist of an
n log n lower bound to determin whether ani two
of n real number ar within of each other is
also demonstr these problem provid an excel opportun for discuss
the effect of the comput model on the eas of
analysi and on the result produc cacm juli 1978 fredman
m weid b analysi of algorithm combinatori problem comput complex
comput model decis tree program lower bound 5 25 5
26 5 30 5 39 ca780702 dh februari 8 1979
3 46 pm 3086 5 3086 3086 5 3086 3086
5 3086 
# 3087
an english languag question answer system for a larg relat
databas by type request in english casual user will be
abl to obtain explicit answer from a larg relat databas
of aircraft flight and mainten data us a system call
plane the design and implement of thi system is describ
and illustr with detail exampl of the oper of system
compon and exampl of overal system oper the languag process
portion of the system us a number of augment transit
network each of which match phrase with a specif mean
along with context regist hi tori keeper and concept case
frame these ar us for judg meaning of question gener
dialogu for clarifi partial understood question and resolv ellipsi and
pronoun refer problem other system compon construct a formal queri
for the relat databas and optim the order of search
relat method ar discuss for handl vagu or complex question
and for provid brows abil also includ ar discuss of
import issu in program natur languag system for limit domain
and the relationship of thi system to other cacm juli
1978 waltz d question answer relat databas natur languag databas
front end artifici intellig dialogu queri gener inform retriev natur
languag program 3 42 3 60 3 69 3 74
3 79 ca780701 dh februari 8 1979 4 26 pm
2155 4 3087 2406 4 3087 2581 4 3087 2710
4 3087 2715 4 3087 2716 4 3087 2717 4
3087 2718 4 3087 2739 4 3087 2765 4 3087
2795 4 3087 2817 4 3087 2888 4 3087 2901
4 3087 2921 4 3087 2957 4 3087 2959 4
3087 2965 4 3087 3087 4 3087 3087 4 3087
3154 4 3087 1989 5 3087 2046 5 3087 3087
5 3087 3087 5 3087 3087 5 3087 
# 3088
gener equat for ideal cpu i o overlap configur gener
equat ar deriv for estim the maximum possibl util of
main storag partit cpu and i o devic under differ
condit in an ideal cpu i o overlap model of
multiprogram comput system the equat ar directli applic to ani
configur consist of set of ident cpu s i o
processor main storag partit and user task exampl ar provid
to illustr the us of the equat to comput effect
process time per record and expect timeshar respons time under
both balanc and unbalanc resourc util condit cacm june 1978
teori t block buffer input output overlap perform resourc alloc
throughput timeshar 3 72 4 30 4 41 8 1
ca780609 dh februari 8 1979 4 35 pm 3088 5
3088 3088 5 3088 3088 5 3088 
# 3089
perform of rollback recoveri system under intermitt failur a mathemat
model of a transact orient system under intermitt failur is
propos the system is assum to oper with a checkpoint
and rollback recoveri method to ensur reliabl inform process the
model is us to deriv the princip perform measur includ
avail respons time and the system satur point cacm june
1978 gelenb e derochett d databas reliabl file system checkpoint
recoveri procedur check techniqu reliabl and system perform evalu 3
72 3 73 4 33 4 35 4 6 5
5 8 1 ca780608 dh februari 9 1979 10 26
am 3089 4 3089 2599 5 3089 3089 5 3089
3089 5 3089 3089 5 3089 
# 3090
autom welfar client track and servic integr the polit economi
of comput the impact of an autom client track system
on the client casework administr and oper of the welfar
agenc that us it ar report the major impact of
thi system wa to enhanc the administr attract of the
us agenc in the ey of funder rather than to
increas their intern administr effici thi impact is a joint
product of both the technic featur of the comput base
system and of the organiz demand place upon differ agenc
administr and casework it illustr the wai success autom inform
system fit the polit economi of the group that us
them cacm june 1978 kling r social impact of comput
organiz impact of comput manag inform system sociolog of comput
inform system and servic integr urban inform system 2 11
3 53 ca780607 dh februari 12 1979 11 01 am
3090 5 3090 3090 5 3090 3090 5 3090 3117
5 3090 3090 6 3090 
# 3091
some basic determin of comput program product the propos of
thi research wa to examin the relationship between process characterist
of program and experi characterist of programm and program develop
time the ultim object wa to develop a techniqu for
predict the amount of time necessari to creat a comput
program the fifteen program characterist hypothes as be associ with
an increas in program time requir ar object measur from
preprogram specif the five programm characterist ar experi relat and
ar also measur befor a program task is begun nine
program characterist emerg as major influenc on program develop time
each associ with increas program develop time all five programm
characterist were found to be relat to reduc program develop
time a multipl regress equat which contain on programm characterist
and four program characterist gave evid of good predict power
for forecast program develop time cacm june 1978 chrysler e
programm perform standard predict program develop time program estim techniqu
program develop equat valu of program experi programm evalu programm
schedul programm product program manag cobol program 2 40 4
20 ca780606 dh februari 26 1979 11 42 am 3091
4 3091 1792 5 3091 3091 5 3091 3091 5
3091 3091 5 3091 
# 3092
characterist of applic softwar mainten mainten and enhanc of applic
softwar consum a major portion of the total life cycl
cost of a system rough estim of the total system
and program resourc consum rang as high as 75 80
percent in each categori howev the area ha been given
littl attent in the literatur to analyz the problem in
thi area a questionnair wa develop and pretest it wa
then submit to 120 organ respond total 69 respons were
analyz with the spss statist packag the result of the
analysi indic that 1 mainten and enhanc do consum much
of the total resourc of system and program group 2
mainten and enhanc tend to be view by manag as
at least somewhat more import than new applic softwar develop
3 in mainten and enhanc problem of a manag orient
tend to be more signific than those of a technic
orient and 4 user demand for enhanc and extens constitut
the most import manag problem area cacm june 1978 lientz
b swanson e tompkin g softwar mainten us of product
aid manag and technic issu 3 50 4 6 ca780605
dh februari 26 1979 11 59 am 3092 5 3092
3092 5 3092 3092 5 3092 
# 3093
automat error recoveri for lr parser in thi paper we
present a scheme for detect and recov from syntax error
in program the scheme which is base on lr pars
is driven by inform which is directli and automat obtain
from the inform that is alreadi present in an lr
parser the approach which is pattern after that of levi
and graham and rhode appear to provid error recoveri which
is both simpl and power cacm june 1978 mickuna m
modri j program languag error correct automat correct pars lr
syntax error compil 4 12 4 42 5 23 ca780604
dh februari 26 1979 12 22 pm 1225 4 3093
1350 4 3093 1542 4 3093 1646 4 3093 1683
4 3093 1693 4 3093 1781 4 3093 1781 4
3093 1787 4 3093 1836 4 3093 1945 4 3093
1945 4 3093 2060 4 3093 2061 4 3093 2082
4 3093 2091 4 3093 2152 4 3093 2179 4
3093 2340 4 3093 2356 4 3093 2546 4 3093
2603 4 3093 2650 4 3093 2698 4 3093 2698
4 3093 2708 4 3093 2708 4 3093 2733 4
3093 2824 4 3093 2982 4 3093 2986 4 3093
2986 4 3093 3045 4 3093 3093 4 3093 3093
4 3093 3093 4 3093 3093 4 3093 3094 4
3093 1491 5 3093 2179 5 3093 2708 5 3093
3093 5 3093 3093 5 3093 3093 5 3093 680
5 3093 
# 3094
analys of determinist pars algorithm thi paper describ an approach
for determin the minimum maximum and averag time to pars
sentenc accept by a determinist parser these quantiti ar present
in the form of symbol formula call time formula the
variabl in these formula repres not onli the length of
the input string but also the time to perform elementari
oper such as push pop subscript iter etc by bind
to the variabl actual numer valu correspond to a given
compil machin configur on can determin the execut time for
that configur time formula ar deriv by examin the grammar
rule and the program repres the algorithm on wish to
analyz the approach is describ by us a specif grammar
that defin simpl arithmet express two determinist parser ar analyz
a top down recurs descent ll 1 parser and a
bottom up slr 1 parser the paper provid estim for
the rel effici of the two parser the estim applic
to a specif machin the pdp 10 ar present and
substanti bui benchmark final the paper illustr the propos approach
by appli it to the analys of parser for a
simpl program languag cacm june 1978 cohen j roth m
syntact analysi analysi of algorithm top down and bottom up
pars rel effici 4 12 5 23 5 24 5
25 5 7 ca780603 dh februari 26 1979 12 32
pm 1350 4 3094 1399 4 3094 1659 4 3094
1768 4 3094 1781 4 3094 1945 4 3094 2110
4 3094 2719 4 3094 2733 4 3094 2986 4
3094 3093 4 3094 3094 4 3094 3094 4 3094
3094 4 3094 1265 5 3094 2179 5 3094 2645
5 3094 3094 5 3094 3094 5 3094 3094 5
3094 
# 3095
a select travers algorithm for binari search tree the problem
of select data item from a binari search tree accord
to a list of rang condit is consid the process
of visit a minim number of node to retriev data
satisfi the rang condit is call select travers present in
thi paper is an algorithm for select travers which us
a tag field for each node in the tree the
algorithm is particularli us and effici when examin of data
is more time consum than examin of a tag field
cacm june 1978 driscol j lien y data retriev rang
condit binari search tree tree travers select travers 3 74
5 24 5 25 ca780602 dh februari 26 1979 12
40 pm 3095 5 3095 3095 5 3095 3095 5
3095 
# 3096
an optim method for delet in on side height balanc
tree a on side height balanc tree is a binari
tree in which everi node s right subtre ha a
height which is equal to or exactli on greater than
the height of it left subtre it ha an advantag
over the more gener avl tree in that onli on
bit of balanc inform is requir two bit ar requir
for the acl tree it is shown that delet of
an arbitrari node of such a tree can be accomplish
in o logn oper where n is the number of
node in the tree moreov the method is optim in
the sens that it complex cannot be reduc in order
of magnitud thi result coupl with earlier result by hirschberg
indic that of the three basic problem of insert delet
and retriev onli insert is advers affect by thi modif
of an avl tree cacm june 1978 zweben s mcdonald
m balanc binari search tree 3 73 3 74 4
34 5 25 5 31 ca780601 dh februari 26 1979
12 48 pm 2839 4 3096 3009 4 3096 3042
4 3096 3042 4 3096 3065 4 3096 3096 4
3096 3096 4 3096 3096 4 3096 3163 4 3096
3163 4 3096 3163 4 3096 2839 5 3096 2889
5 3096 3009 5 3096 3065 5 3096 3096 5
3096 3096 5 3096 3096 5 3096 3163 5 3096
2839 6 3096 2839 6 3096 2889 6 3096 3009
6 3096 3065 6 3096 3096 6 3096 3096 6
3096 
# 3097
optim shift strategi for a block transfer ccd memori for
the purpos of thi paper a block transfer ccd memori
is compos of serial shift regist whose shift rate can
vari but which have a definit minimum shift rate the
refresh rate and a definit maximum shift rate the bit
iin the shift regist ar number 0 to n 1
and block of n bit ar alwai transfer alwai start
at bit 0 what is the best shift strategi so
that a block transfer request occur at a random time
will have to wait the minim amount of time befor
bit 0 can be reach the minimum shift rate requir
doe not allow on to simpli park at bit 0
and wait for a transfer request the optim strategi involv
shift as slowli as possibl until bit 0 is pass
then shift as quickli as possibl until a critic boundari
is reach shortli befor bit 0 come around again thi
is call the hurri up and wait strategi and is
well known outsid the comput field the block transfer ccd
memori can also be view as a page drum with
a variabl bound rotat speed cacm mai 1978 site r
page drum charg coupl devic shift regist memori memori hierarchi
electron drum latenc 3 72 5 39 6 34 6
35 ca780510 dh februari 26 1979 1 05 pm 2628
4 3097 3097 4 3097 2496 5 3097 3097 5
3097 3097 5 3097 3097 5 3097 
# 3098
comput gener of gamma random variabl a new method for
gener random variabl from the gamma distribut with nonintegr shape
paramet a is propos thi method is similar to two
other method recent given by wallac and fishman it is
compar with fishman s and ahren and dieter s method
the core storag requir and program effort for thi method
ar similar to those of fishman s method the propos
method is the same as fishman s method for 1
a 2 and is faster than fishman s method for
3 a 19 also the propos method is much simpler
than ahren and dieter s method and is faster for
a 8 cacm mai 1978 tadikamalla p gamma variabl reject
method comput method 5 5 8 1 ca780509 dh februari
26 1979 1 10 pm 2847 4 3098 2928 4
3098 3046 4 3098 3046 4 3098 3098 4 3098
3098 4 3098 3107 4 3098 2569 5 3098 2847
5 3098 3046 5 3098 3098 5 3098 3098 5
3098 3098 5 3098 2569 6 3098 2847 6 3098
3098 6 3098 
# 3099
new suffici optim condit for integ program and their applic
the purpos of thi report is to present a new
class of suffici optim condit for pure and mix integ
program problem some of the set of suffici condit present
can be thought of as gener of optim condit base
on primal dual complementar in linear program these suffici condit
ar particularli us for the construct of difficult integ program
problem with known optim solut these problem mai then be
us to test and or benchmark integ program code cacm
mai 1978 fleisher j meyer r integ program optim condit
test problem construct kuhn tucker condit greatest common divisor 3
15 5 39 5 49 ca780508 dh februari 26 1979
1 19 pm 2028 4 3099 2521 4 3099 3099
4 3099 3099 4 3099 3138 4 3099 1313 5
3099 2031 5 3099 3099 5 3099 3099 5 3099
3099 5 3099 
# 3100
an interfer match techniqu for induc abstract a method for
induc knowledg by abstract from a sequenc of train exampl
is describ the propos method interfer match induc abstract by
find relat properti common to two or more exemplar three
task solv by a program that us an interfer match
algorithm ar present sever problem concern the descript of the
train exampl and the adequaci of interfer match ar discuss
and direct for futur research ar consid cacm mai 1978
hay roth f mcdermott j rule induct knowledg acquisit partial
match interfer graph match learn induct knowledg represent inform retriev
abstract gener languag learn complex predic discoveri 3 36 3
61 3 62 3 66 3 70 5 32 ca780507
dh februari 26 1979 1 26 pm 3100 5 3100
3100 5 3100 3100 5 3100 
# 3101
the sl5 procedur mechan thi paper describ an integr procedur
mechan that permit procedur to be us as recurs function
or as coroutin thi integr is accomplish by treat procedur
and their activ record call environ as data object and
by decompos procedur invoc into three separ compon at the
sourc languag level in addit argument bind is under the
control of the programm permit the definit of variou method
of argument transmiss in the sourc languag itself the result
procedur mechan which is part of the sl5 program languag
is well suit to goal orient problem and to other
problem that ar more readili program by us coroutin sever
exampl ar given cacm mai 1978 hanson d griswold r
procedur coroutin program languag interpret snobol 4 backtrack 4 2
4 20 4 22 4 13 ca780506 dh februari 26
1979 1 36 pm 2411 4 3101 2625 4 3101
2705 4 3101 2709 4 3101 2889 4 3101 2922
4 3101 2937 4 3101 2989 4 3101 3005 4
3101 3025 4 3101 3081 4 3101 3101 4 3101
3101 4 3101 3101 4 3101 3101 4 3101 3112
4 3101 2138 5 3101 2193 5 3101 2438 5
3101 3101 5 3101 3101 5 3101 3101 5 3101
3185 5 3101 
# 3102
incorpor of unit into program languag the issu of how
a program languag might aid in keep track of physic
unit feet sec etc ar discuss a method is given
for the introduct of relationship among unit a watt is
volt amp a yard is three feet and subsequ automat
convers base upon these relationship variou propos for syntax ar
consid cacm mai 1978 karr m loveman iii d unit
languag design compil construct languag syntax 4 12 4 22
ca780505 dh februari 26 1979 1 43 pm 3102 5
3102 3102 5 3102 3102 5 3102 
# 3103
automat data structur select an exampl and overview the us
of sever level of abstract ha prove to be veri
help in construct and maintain program when program ar design
with abstract data type such as set and list programm
time can be save by autom the process of fill
in low level implement detail in the past program system
have provid onli a singl gener purpos implement for an
abstract type thu the program produc us abstract type were
then ineffici in space or time in thi paper a
system for automat choos effici implement for abstract type from
a librari of implement is discuss thi process is discuss
in detail for an exampl program gener issu in data
structur select ar also review cacm mai 1978 low j
abstract data type automat program data structur optim compil set
list 4 12 4 22 4 6 ca780504 dh februari
26 1979 1 51 pm 1957 4 3103 2151 4
3103 3103 4 3103 3103 4 3103 3148 4 3103
1860 5 3103 2877 5 3103 3103 5 3103 3103
5 3103 3103 5 3103 
# 3104
test data as an aid in prove program correct proof
of program correct tend to be long and tediou wherea
test though us in detect error usual doe not guarante
correct thi paper introduc a techniqu wherebi test data can
be us in prove program correct in addit to simplifi
the process of prove correct thi method simplifi the process
of provid accur specif for a program the applic of
thi techniqu to procedur and recurs program is demonstr cacm
mai 1978 geller m program verif program test recurs program
4 22 4 6 5 24 ca780503 dh februari 26
1979 2 10 pm 2874 4 3104 2981 4 3104
3030 4 3104 3077 4 3104 3104 4 3104 3104
4 3104 2457 5 3104 2683 5 3104 3104 5
3104 3104 5 3104 3104 5 3104 3170 5 3104
3055 6 3104 3104 6 3104 
# 3105
a languag extens for express constraint on data access control
share of inform is need and desir for mani applic
and is support in oper system by access control mechan
thi paper show how to extend program languag to provid
control share the extens permit express of access constraint on
share data access constraint can appli both to simpl object
and to object that ar compon of larger object such
as bank account record in a bank s data base
the constraint ar state declar and can be enforc by
static check similar to type check the approach can be
us to extend ani strongli type languag but is particularli
suitabl for extend languag that support the notion of abstract
data type cacm mai 1978 jone a liskov b program
languag access control data type abstract data type type check
capabl 4 20 4 35 ca780502 dh februari 26 1979
3 19 pm 1458 4 3105 1523 4 3105 1603
4 3105 1698 4 3105 1747 4 3105 1748 4
3105 1854 4 3105 1877 4 3105 1960 4 3105
2377 4 3105 2378 4 3105 2497 4 3105 2558
4 3105 2625 4 3105 2626 4 3105 2632 4
3105 2840 4 3105 2868 4 3105 2868 4 3105
2870 4 3105 2876 4 3105 2941 4 3105 3031
4 3105 3105 4 3105 3105 4 3105 3105 4
3105 3105 4 3105 3105 4 3105 3105 4 3105
3144 4 3105 3144 4 3105 3144 4 3105 3148
4 3105 3150 4 3105 1471 5 3105 2625 5
3105 2632 5 3105 2868 5 3105 2939 5 3105
3068 5 3105 3105 5 3105 3105 5 3105 3105
5 3105 
# 3106
a fast algorithm for copi list structur an algorithm is
present for copi an arbitrarili link list structur into a
block of contigu storag locat without destroi the origin list
apart from a fix number of program variabl no auxiliari
storag such as a stack is us the algorithm need
no mark bit and oper in linear time it is
shown to be significantli faster than fisher s algorithm the
fastest previou linear time algorithm for the same problem it
speed come mainli from it effici list travers techniqu which
fold the process stack into the structur be built and
from it classif of list cell into nine type which
enabl process oper to be optim for each type cacm
mai 1978 clark d list copi lisp space complex constant
workspac 4 34 4 49 5 25 ca780501 dh februari
26 1979 3 25 pm 1024 4 3106 1051 4
3106 1102 4 3106 1132 4 3106 1390 4 3106
1486 4 3106 1549 4 3106 1706 4 3106 1826
4 3106 1869 4 3106 1878 4 3106 378 4
3106 2060 4 3106 2155 4 3106 2156 4 3106
2168 4 3106 2361 4 3106 2513 4 3106 2513
4 3106 2665 4 3106 2719 4 3106 2723 4
3106 2723 4 3106 2736 4 3106 2766 4 3106
2838 4 3106 2842 4 3106 2855 4 3106 2855
4 3106 2855 4 3106 2855 4 3106 2855 4
3106 2879 4 3106 2944 4 3106 2954 4 3106
2954 4 3106 3074 4 3106 3077 4 3106 3080
4 3106 3106 4 3106 3106 4 3106 3106 4
3106 3106 4 3106 3106 4 3106 3106 4 3106
3106 4 3106 3106 4 3106 3112 4 3106 627
4 3106 106 4 3106 210 5 3106 1549 5
3106 1972 5 3106 2665 5 3106 2766 5 3106
2855 5 3106 2954 5 3106 2998 5 3106 3106
5 3106 3106 5 3106 3106 5 3106 
# 3107
gener beta variat with nonintegrel shape paramet a new reject
method is describ for gener beta variat the method is
compar with previous publish method both theoret and through comput
time it is suggest that the method ha advantag in
both speed and program simplic over previou method especi for
difficult combin of paramet valu cacm april 1978 cheng r
beta variat random number simul 5 5 8 1 ca780409
dh februari 26 1979 3 32 pm 2847 4 3107
2928 4 3107 3046 4 3107 3098 4 3107 3107
4 3107 2569 5 3107 3107 5 3107 3107 5
3107 3107 5 3107 
# 3108
econom encod of comma between string a method for insert
of delimit between string without us new symbol is present
as the length of the string increas the extra cost
in term of prolong becom vanishingli small compar to the
length of the string cacm april 1978 even s rodeh
m string transmiss delimit comma encod of the integ 3
57 3 81 5 6 ca780408 dh februari 26 1979
3 36 pm 3108 5 3108 3108 5 3108 3108
5 3108 
# 3109
a data structur for manipul prioriti queue a data structur
is describ which can be us for repres a collect
of prioriti queue the primit oper ar insert delet union
updat and search for an item of earliest prioriti cacm
april 1978 vuillemin j data structur implement of set oper
prioriti queue mergeabl heap binari tree 4 34 5 24
5 25 5 32 8 1 ca780407 dh februari 26
1979 3 39 pm 2844 4 3109 2936 4 3109
3051 4 3109 3051 4 3109 3064 4 3109 3109
4 3109 3109 4 3109 2767 5 3109 2844 5
3109 3109 5 3109 3109 5 3109 3109 5 3109
# 3110
assembl code for machin with span depend instruct mani modern
comput contain instruct whose length depend on the distanc from
a given instanc of such an instruct to the operand
of that instruct thi paper consid the problem of minim
the length of program for such machin an effici solut
is present for the case in which the operand of
everi such span depend instruct is either a label or
an assembl time express of a certain restrict formf thi
restrict is relax by allow these operand to be more
gener assembl time express then the problem is shown to
be np complet cacm april 1978 szymanski t span depend
instruct variabl length address code gener assembl compil np complet
comput complex 4 11 4 12 5 25 ca780406 dh
februari 26 1979 3 49 pm 2626 4 3110 2786
4 3110 2840 4 3110 2858 4 3110 2919 4
3110 3017 4 3110 3110 4 3110 3110 4 3110
3110 4 3110 3174 4 3110 2194 5 3110 2629
5 3110 2858 5 3110 3110 5 3110 3110 5
3110 3110 5 3110 
# 3111
secur commun over insecur channel accord to tradit concept of
cryptograph secur it is necessari to transmit a kei by
secret mean befor encrypt messag can be sent secur thi
paper show that it is possibl to select a kei
over open commun channel in such a fashion that commun
secur can be maintain a method is describ which forc
ani enemi to expend an amount of work which increas
as the squar of the work requir of the two
communic to select the kei the method provid a logic
new kind of protect against the passiv eav dropper it
suggest that further research on thi topic will be highli
reward both in a theoret and a practic sens cacm
april 1978 merkl r secur cryptographi cryptolog commun secur wiretap
comput network secur passiv eavesdrop kei distribut public kei cryptosystem
3 56 3 81 ca780405 dh februari 26 1979 4
18 pm 3038 4 3111 3111 4 3111 3177 4
3111 3021 5 3111 3111 5 3111 3111 5 3111
3111 5 3111 3158 5 3111 2436 6 3111 3038
6 3111 3111 6 3111 3111 6 3111 
# 3112
list process in real time on a serial comput a
real time list process system is on in which the
time requir by the elementari list oper e g con
car cdr rplaca replacd eq and atom in lisp is
bound by a small constant classic implement of list process
system lack thi properti becaus alloc a list cell from
the heap mai caus a garbag collect which process requir
time proport to the heap size to finish a real
time list process system is present which continu reclaim garbag
includ direct cycl while linear and compact the access cell
into contigu locat to avoid fragment the free storag pool
the program is small and requir no time share interrupt
make it suitabl for microcod final the system requir the
same averag time and not more than twice the space
of a classic implement and those space requir can be
reduc to approxim classic proport by compact list represent arrai
of differ size a program stack and hash link ar
simpl extens to our system and refer count is found
to be inferior for mani applic cacm april 1978 baker
h real time compact garbag collect list process virtual memori
file or databas manag storag manag storag alloc lisp cdr
code refer count 3 50 3 60 3 73 3
80 4 13 4 22 4 32 4 33 4
35 4 49 ca780404 dh februari 26 1979 4 32
pm 1024 4 3112 1050 4 3112 1051 4 3112
1098 4 3112 1214 4 3112 1380 4 3112 1388
4 3112 1393 4 3112 1393 4 3112 1485 4
3112 1487 4 3112 1541 4 3112 1549 4 3112
1549 4 3112 1570 4 3112 1846 4 3112 1878
4 3112 1946 4 3112 1957 4 3112 1972 4
3112 2023 4 3112 2060 4 3112 2156 4 3112
2156 4 3112 2168 4 3112 2168 4 3112 2218
4 3112 2361 4 3112 2438 4 3112 2513 4
3112 2625 4 3112 2723 4 3112 2723 4 3112
2736 4 3112 2736 4 3112 2833 4 3112 2833
4 3112 2838 4 3112 2845 4 3112 2855 4
3112 2855 4 3112 2855 4 3112 2857 4 3112
2896 4 3112 2922 4 3112 2944 4 3112 3039
4 3112 3074 4 3112 3074 4 3112 3074 4
3112 3081 4 3112 3101 4 3112 3106 4 3112
3112 4 3112 3112 4 3112 3112 4 3112 3112
4 3112 3112 4 3112 3112 4 3112 3112 4
3112 3112 4 3112 3112 4 3112 3112 4 3112
627 4 3112 106 5 3112 1380 5 3112 1826
5 3112 1972 5 3112 2438 5 3112 2723 5
3112 2736 5 3112 2833 5 3112 2838 5 3112
3112 5 3112 3112 5 3112 3112 5 3112 731
5 3112 
# 3113
optim convers of extend entri decis tabl with gener cost
criteria a gener dynam program algorithm for convert limit extend
or mix entri decis tabl to optim decis tree is
present which can take into account rule frequenc or probabl
minimum time and or space cost criteria common action set
compress rule and els rule sequenc constraint on condit test
exclud combin of condit certain ambigu and interrupt rule mask
cacm april 1978 lew a decis tabl optim program dynam
program 3 59 4 19 4 29 4 49 5
39 5 42 8 3 ca780403 dh februari 26 1979
4 37 pm 1684 4 3113 2053 4 3113 2220
4 3113 2273 4 3113 2453 4 3113 2598 4
3113 2598 4 3113 2691 4 3113 2726 4 3113
2726 4 3113 2845 4 3113 2856 4 3113 2856
4 3113 3033 4 3113 3113 4 3113 3113 4
3113 3113 4 3113 3113 4 3113 3113 4 3113
1354 5 3113 2263 5 3113 2598 5 3113 2691
5 3113 2856 5 3113 3113 5 3113 3113 5
3113 3113 5 3113 
# 3114
a techniqu for isol differ between file a simpl algorithm
is describ for isol the differ between two file on
applic is the compar of two version of a sourc
program or other file in order to displai all differ
the algorithm isol differ in a wai that correspond close
to our intuit notion of differ is easi to implement
and is computation effici with time linear in the file
length for most applic the algorithm isol differ similar to
those isol by the longest common subsequ anoth applic of
thi algorithm merg file contain independ gener chang into a
singl file the algorithm can also be us to gener
effici encod of a file in the form of the
differ between itself and a given datum file permit reconstruct
of the origin file from the differ and datum file
cacm april 1978 heckel p differ isol word process text
edit program mainten hash code file compress bandwidth compress longest
common subsequ file comparison molecular evolut 3 63 3 73
3 81 4 43 ca780402 dh februari 27 1979 10
52 am 2299 4 3114 2501 4 3114 2629 4
3114 2915 4 3114 2963 4 3114 3114 4 3114
3114 4 3114 3114 4 3114 1502 5 3114 2499
5 3114 2745 5 3114 3114 5 3114 3114 5
3114 3114 5 3114 
# 3115
orderli enumer of nonsingular binari matric appli to text encrypt
nonsingular binari matric of order n i e nonsingular over
the field 0 1 and an initi segment of the
natur number ar place in on to on correspond each
natur number correspond to two intermedi vector these vector ar
map into a nonsingular binari matrix exampl of complet enumer
of all 2 x 2 and 3 x 3 nonsingular
binari matric were produc by map the intermedi vector to
the matric the map ha applic to the vernam encipher
method us pseudorandom number sequenc a bit string form form
byte of text of a data encrypt kei can be
us as a represent of a natur number thi natur
number is transform to a nonsingular binari matrix kei leverag
is obtain by us the matrix as a seed in
a shift regist sequenc pseudorandom number gener cacm april 1978
payn w mcmillen k binari matric combinator combin nonsingular matric
encrypt vernam pseudorandom number feedback shiftregist sequenc random number 3
7 5 3 ca780401 dh februari 27 1979 11 05
am 2269 4 3115 2466 4 3115 2690 4 3115
2834 4 3115 2834 4 3115 2834 4 3115 2853
4 3115 2884 4 3115 2908 4 3115 3115 4
3115 3115 4 3115 3115 4 3115 3115 4 3115
3115 4 3115 3115 4 3115 3115 4 3115 907
5 3115 2045 5 3115 2417 5 3115 2466 5
3115 2884 5 3115 579 5 3115 3115 5 3115
3115 5 3115 3115 5 3115 785 5 3115 
# 3116
interfer detect among solid and surfac in mani industri environ
it is necessari to determin whether r there is interfer
among compon there ar mani potenti interfer problem in product
made up of assembl of compon and in product manufactur
and test typic draw ar us in an attempt to
detect such unwant interfer but the two dimension static draft
medium doe not alwai show interfer among three dimension move
part thi paper present a comput represent for solid and
surfac and algorithm which carri out interfer check among object
so repres object ar repres as polyhedra or as piecewis
planar surfac two type of interfer check ar discuss detect
of intersect among object in fix posit and detect of
collis among object move along specifi trajectori cacm januari 1979
boys j interfer check intersect detect collis detect solid represent
polyhedr represent graphic polygon surfac 3 2 8 2 ca790101
dh april 10 1979 10 50 am 2827 4 3116
3116 4 3116 2771 5 3116 3116 5 3116 3116
5 3116 3116 5 3116 3172 5 3116 3116 6
3116 
# 3117
the impact and us of comput technolog by the polic
over the past decad there ha been a signific growth
in the us of comput technolog by u polic depart
thi growth howev ha been at a slower rate than
predict in the earli 1970 s further when comput applic
extend beyond routin us to nonroutin effort such as resourc
alloc or comput aid dispatch system where the machin begin
to becom a tool for decis make strateg plan and
person machin interact the result of the technolog to date
have been mix thi paper report on case studi and
survei which provinsight on the implement and impact of polic
comput technolog and the relationship of thi technolog to law
enforc and societi cacm januari 1979 colton k comput technolog
innov polic resourc alloc polic command and control comput aid
dispatch law enforc technolog transfer 2 1 2 11 2
12 2 45 3 33 3 39 ca790102 dh april
10 1979 11 32 am 3117 4 3117 3090 5
3117 3117 5 3117 3117 5 3117 3117 5 3117
# 3118
permut of data block in a bubbl memori a common
intern organ of bubbl memori consist of a set of
minor loop connect through anoth major loop the problem of
obtain ani give n permut of the minor loop content
in minimum time is studi in thi paper a lower
bound to the number of step requir bui a permut
algorithm is deriv and the class of optimum algorithm is
identifi cacm januari 1979 bongiovanni g luccio f bubbl memori
memori loop permut algorithm data block shift 4 34 5
30 6 34 ca790103 dh april 10 1979 12 04
pm 3118 5 3118 3118 5 3118 3118 5 3118
# 3119
the impact of distribut and disciplin on multipl processor system
simpl queue model ar us to studi the perform tradeoff
of multipl processor system issu consid includ the impact of
cpu servic disciplin and distribut level of multiprogram multitask and
job prioriti cacm januari 1979 sauer c chandi k multiprogram
multiprocess schedul disciplin perform evalu queue model 4 32 4
6 6 2 8 1 ca790104 dh april 10 1979
12 10 pm 2571 4 3119 2918 4 3119 3032
4 3119 3072 4 3119 3119 4 3119 3119 4
3119 3119 4 3119 3119 4 3119 2245 5 3119
2798 5 3119 2849 5 3119 2859 5 3119 3119
5 3119 3119 5 3119 3119 5 3119 
# 3120
an event driven compil techniqu due to the linear structur
of sourc text difficulti mai aris in a on pass
compil process these difficulti occur when an entiti cannot be
process becaus of a forward refer to inform onli obtain
from subsequ entiti classic solut ask for data structur appropri
for each case a techniqu is present here which us
instead control structur name event and process the work of
the compil writer becom easier both conceptu and in practic
becaus he can forget these problem at the outset and
he avoid special process for each problem thi techniqu ha
been appli to the construct of an algol 68 compil
three exampl from that implement ar describ and discuss here
cacm januari 1979 banatr j routeau j trill l compil
techniqu on pass compil semant analysi event process parallel categori
4 12 ca790105 dh april 10 1979 12 26 pm
3120 5 3120 3120 5 3120 3120 5 3120 
# 3121
syntact sourc to sourc transform and program manipul syntact transform
ar the sourc to sourc program transform which preserv the
histori of comput and thu do not modifi the execut
time combin with a small number of primit semant transform
thei provid a power tool for program manipul a catalogu
of syntact transform and it us for solut of a
system of program equat is given exampl of deriv of
more complex sourc to sourc transform ar also present two
case studi illustr the wai in which syntact and semant
sourc to sourc transform mai be us for develop of
clear simpl and reason effici program cacm januari 1979 arsac
j structur program program transform control structur 4 2 5
24 5 25 ca790106 dh april 10 1979 1 57
pm 1175 4 3121 1919 4 3121 1919 4 3121
1969 4 3121 1997 4 3121 2191 4 3121 2191
4 3121 2388 4 3121 2388 4 3121 2679 4
3121 2709 4 3121 2783 4 3121 2784 4 3121
2821 4 3121 3004 4 3121 3054 4 3121 3054
4 3121 3121 4 3121 3121 4 3121 3121 4
3121 3121 4 3121 3121 4 3121 864 4 3121
1312 5 3121 308 5 3121 309 5 3121 2456
5 3121 2709 5 3121 3121 5 3121 3121 5
3121 3121 5 3121 
# 3122
product and employ of ph s in comput scienc 1977
and 1978 cacm februari 1979 taulbe o cont s comput
scienc product of ph s employ student 1 3 1
52 1 53 1 59 ca790201 dh april 10 1979
2 09 pm 2962 4 3122 3122 4 3122 3122
4 3122 3123 4 3122 3123 4 3122 2861 5
3122 2962 5 3122 3122 5 3122 3122 5 3122
3122 5 3122 
# 3123
employ characterist of doctor level comput scientist cacm februari 1979
fairlei r employ characterist manpow util occup trend 1 5
2 1 2 2 ca790202 dh april 10 1979 2
13 pm 2962 4 3123 3022 4 3123 3122 4
3123 3122 4 3123 3123 4 3123 3123 4 3123
3123 4 3123 3123 4 3123 2823 5 3123 2861
5 3123 2962 5 3123 3022 5 3123 3123 5
3123 3123 5 3123 3123 5 3123 
# 3124
recurs data structur in apl a mathemat studi of three
approach for defin nest arrai in apl is present theorem
exhibit the relationship between the definit system ar given and
illustr through graph represent on of the approach is us
to defin an apl arrai to be a recurs data
structur equival to a tree structur in which all data
is store at the leav as homogen arrai of number
and charact an extens of apl is propos that includ
new primit function to manipul the nest level of arrai
and new oper to assist in the construct of data
driven algorithm cacm februari 1979 gull w jenkin m nest
arrai apl arrai recurs data structur tree data driven algorithm
theori of arrai 4 22 5 29 ca790203 dh april
10 1979 3 41 pm 2060 4 3124 2294 4
3124 2470 4 3124 3124 4 3124 1469 5 3124
3124 5 3124 3124 5 3124 3124 5 3124 
# 3125
global optim by suppress of partial redund the elimin of
redund comput and the move of invari comput out of
loop ar often done separ with invari move outward loop
by loop we propos to do both at onc and
to move each express directli to the entranc of the
outermost loop in which it is invari thi is done
by solv a more gener problem i e the elimin
of comput perform twice on a given execut path such
comput ar term partial redund moreov the algorithm doe not
requir ani graphic inform or restrict on the shape of
the program graph test thi algorithm ha shown that it
execut cost is nearli linear with the size of the
program and that it lead to a smaller optim that
requir less execut time cacm februari 1979 morel e renvois
c optim optim compil compil redund elimin invari comput elimin
partial redund data flow analysi boolean system 4 12 5
21 5 24 ca790204 dh april 10 1979 4 19
pm 3125 5 3125 3125 5 3125 3125 5 3125
# 3126
comment on perfect hash function a singl probe retriev method
for static set cacm februari 1979 anderson m hash hash
method hash code direct address identifi to address transform perfect
hash function perfect hash code reduct retriev scatter storag search
3 7 3 74 4 34 ca790205 dh april 10
1979 4 25 pm 3041 4 3126 3126 4 3126
3176 4 3126 2905 5 3126 3126 5 3126 3126
5 3126 3126 5 3126 
# 3127
thoth a portabl real time oper system thoth isa real
time oper system which is design to be portabl over
a larg set of machin it is current run on
two minicomput with quit differ architectur both the system and
applic program which us it ar written in a high
level languag becaus the system is implement by the same
softwar on differ hardwar it ha the same interfac to
user program henc applic program which us thoth ar highli
portabl thoth encourag structur program as network of commun process
by provid effici interprocess commun primit cacm februari 1979 cheriton
d malcolm m melen l sager g portabl real time
oper system minicomput 3 80 4 30 4 35 ca790206
dh april 12 1979 9 10 am 2319 4 3127
2378 4 3127 2320 4 3127 2632 4 3127 2738
4 3127 2740 4 3127 2868 4 3127 2928 4
3127 3127 4 3127 3127 4 3127 2080 5 3127
2277 5 3127 3127 5 3127 3127 5 3127 3127
5 3127 
# 3128
synchron with eventcount and sequenc synchron of concurr process requir
control the rel order of event in the process a
new synchron mechan is propos us abstract object call eventcount
and sequenc that allow process to control the order of
event directli rather than us mutual exclus to protect manipul
of share variabl that control order of event direct control
of order seem to simplifi correct argument and also simplifi
implement in distribut system the mechan is defin formal and
then sever exampl of it us ar given the relationship
of the mechan to protect mechan in the system is
explain in particular eventcount ar shown to be applic to
situat where confin of inform matter an implement of eventcount
s and sequenc in a system with share memori is
describ cacm februari 1979 reed d kanodia r process synchron
interprocess commun distribut system secur model mutual exclus semaphor 4
30 4 32 ca790207 dh april 12 1979 10 03
am 2320 4 3128 2597 4 3128 2700 4 3128
2777 4 3128 2840 4 3128 2851 4 3128 2865
4 3128 2866 4 3128 2869 4 3128 2895 4
3128 2898 4 3128 2912 4 3128 2938 4 3128
2945 4 3128 2946 4 3128 2946 4 3128 2972
4 3128 3043 4 3128 3128 4 3128 3128 4
3128 3128 4 3128 3128 4 3128 3128 4 3128
3128 4 3128 3128 4 3128 3128 4 3128 3128
4 3128 3144 4 3128 3148 4 3128 3158 4
3128 2150 5 3128 2376 5 3128 2436 5 3128
2597 5 3128 2865 5 3128 2866 5 3128 2870
5 3128 2912 5 3128 3082 5 3128 3128 5
3128 3128 5 3128 3128 5 3128 
# 3129
optim storag alloc for serial file a comput system us
sever serial file the file resid on a direct access
storag devic in which storag space is limit record ar
ad to the file either by job in batch process
mode or by on line transact each transact or job
gener a demand vector which design the space requir in
each file for record addit whenev on file run out
of space the system must be reorgan thi paper consid
sever criteria for best alloc storag space to the file
cacm februari 1979 mendelson h pliskin j yechiali u serial
file storag alloc reorgan partit dataset 3 5 3 7
4 33 4 6 ca790208 dh april 12 1979 10
34 am 2816 4 3129 3129 4 3129 3129 4
3129 2493 5 3129 2816 5 3129 3129 5 3129
3129 5 3129 3129 5 3129 
# 3130
curriculum 78 recommend for the undergradu program in comput scienc
contain in thi report ar the recommend for the undergradu
degre program in comput scienc of the curriculum committe on
comput scienc c3 of the associ for comput machineri acm
the core curriculum common to all comput scienc undergradu program
is present in term of elementari level topic and cours
and intermedi level cours elect cours us to round out
an undergradu program ar then discuss and the entir program
includ the comput scienc compon and other materi is present
issu relat to undergradu comput scienc educ such as servic
cours support area continu educ facil staff and articul ar
present cacm march 1979 aust r barn b bonnett d
engel g stoke g comput scienc cours comput scienc curriculum
comput scienc educ comput scienc undergradu degre program servic cours
continu educ 1 52 ca790301 dh april 12 1979 11
02 am 1720 4 3130 1927 4 3130 2147 4
3130 2163 4 3130 2345 4 3130 2478 4 3130
2594 4 3130 2852 4 3130 2899 4 3130 3130
4 3130 3130 4 3130 1771 5 3130 3003 5
3130 3130 5 3130 3130 5 3130 3130 5 3130
# 3131
focu microcomput number system focu is a number system and
support comput algorithm especi us for microcomput control and other
signal process applic focu ha the wide rang charact of
float point number with a uniform of state distribut that
give focu better than a twofold accuraci advantag over an
equal word length float point system focu comput ar typic
five time faster than singl precis fix point or integ
arithmet for a mixtur of oper compar in speed with
hardwar arithmet for mani applic algorithm for 8 bit and
16 bit implement of focu ar includ cacm march 1979
edgar a lee s number represent logarithm arithmet comput speed
comput accuraci microcomput applic 3 24 3 80 4 0
4 22 5 11 ca790302 dh april 12 1979 11
12 am 3131 4 3131 3131 4 3131 1148 5
3131 3131 5 3131 3131 5 3131 3131 5 3131
893 5 3131 
# 3132
experi with some algorithm that find central solut for pattern
classif in two class pattern recognit it is a standard
techniqu to have an algorithm find hyperplan which separ the
two class in a linearli separ train set the tradit
method find a hyperplan which separ all point in the
other but such a hyperplan is not necessarili center in
the empti space between the two class sinc a central
hyperplan doe not favor on class or the other it
should have a lower error rate in classifi new point
and is therefor better than a noncentr hyperplan six algorithm
for find central hyperplan ar test on three data set
although frequent us practic the modifi relax algorithm is veri
poor three algorithm which ar defin in the paper ar
found to be quit good cacm march 1979 slagl j
pattern recognit pattern classif linear discrimin central hyperplan center central
criteria dead zone hyperplan linearli separ relax algorithm acceler relax
3 62 3 63 ca790303 dh april 12 1979 3
20 pm 3132 4 3132 2215 5 3132 3132 5
3132 3132 5 3132 3132 5 3132 
# 3133
logic and semant network an extend form of semant network
is defin which can be regard as a syntact variant
of the clausal form of logic by virtu of it
relationship with logic the extend semant network is provid with
a precis semant infer rule and a procedur interpret on
the other hand by regard semant network as an abstract
data structur for the represent of claus we provid a
theorem prover with a potenti us index scheme and path
follow strategi for guid the search for a proof cacm
march 1979 deliyanni a kowalski r logic semant network theorem
prove index resolut deduct logic program 3 42 3 64
5 21 ca790304 dh april 12 1979 3 53 pm
3133 4 3133 3133 5 3133 3133 5 3133 3133
5 3133 3154 5 3133 2046 6 3133 2110 6
3133 3133 6 3133 
# 3134
the us of normal multipl tabl for inform storag and
retriev thi paper describ a method for the organ and
retriev of attribut base inform system us the normal multipl
tabl as a directori for the inform system algorithm for
the organ an d retriev of inform ar describ thi
method is particularli suitabl for queri request a group of
inform item all of which possess a particular set of
attribut and possibl some other attribut as well sever exampl
ar given the result with respect to the number of
disk access and disk space ar compar to other common
approach algorithm evalu the appropri of the abov approach to
a given inform system ar describ for a certain class
of inform system the normal multipl tabl method yield far
more rapid retriev with a more econom space requir than
convent system moreov thi method incorpor an improv modif of
the invert file techniqu cacm march 1979 motzkin d inform
retriev invert file multiattribut retriev multilist file normal multipl tabl
queri rapid retriev space economi 3 70 3 73 3
79 ca790305 dh mai 21 1979 9 46 am 2140
4 3134 2452 4 3134 2575 4 3134 2765 4
3134 2901 4 3134 2966 4 3134 3134 4 3134
3134 4 3134 3134 4 3134 3134 4 3134 1976
5 3134 2160 5 3134 2524 5 3134 2990 5
3134 3134 5 3134 3134 5 3134 3134 5 3134
# 3135
detect of three dimension pattern of atom in chemic structur
an algorithm for detect occurr of a three dimension pattern
of object within a larger structur is present the search
techniqu present us the geometr structur of the pattern to
defin characterist demand of candid for match thi is us
in case where the properti of each atom consid individu
do not adequ limit the number of set of possibl
match sever applic of thi techniqu in the field of
chemistri ar 1 in pharmacolog search for a common constel
of atom in molecul possess similar biolog activ 2 in
x rai crystallographi fit a structur or a structur fragment
to a set of peak in the electron densiti distribut
of a fourier map 3 in chemic document retriev from
a file the structur contain specifi substructur cacm april 1979
lesk a three dimension pattern recognit chemic structur search inform
retriev crystal structur analysi drug analysi and design 3 13
3 63 3 74 ca790401 dh mai 21 1979 10
50 am 2521 5 3135 3135 5 3135 3135 5
3135 3135 5 3135 2028 6 3135 2031 6 3135
3135 6 3135 
# 3136
price perform pattern of u comput system econometr model of
the u comput market have been develop to studi the
relationship between system price and hardwar perform singl measur of
price perform such as grosch s law ar shown to
be so over simplifi as to be meaningless multipl regress
model predict system cost as a function of sever hardwar
characterist do howev reveal a market dichotomi on on hand
there exist a stabl price predict market for larger gener
purpos comput system the other market is the develop on
for small busi comput system a market which is rel
unstabl with low price predict cacm april 1979 cale e
gremillion l mckennei j price perform grosch s law u
comput market 2 0 2 11 6 21 ca790402 dh
mai 21 1979 1 09 pm 3136 5 3136 3136
5 3136 3136 5 3136 
# 3137
a methodolog for the design of distribut inform system a
macro model of a distribut inform system in present the
model describ the major cost of us an inform system
from the perspect of the end user the make evid
the effect of variou design and oper paramet on overal
cost per transact the techniqu is illustr by applic to
the design of an interact transact process system cacm april
1979 bucci g streeter d distribut process system design cost
minim distribut databas interact comput econom model transact process 4
32 4 33 6 2 8 1 ca790403 dh mai
21 1979 1 25 pm 3137 5 3137 3137 5
3137 3137 5 3137 
# 3138
a mathemat program updat method us modifi given transform and
appli to lp problem an effici and numer stabl method
is present for the problem of updat an orthogon decomposit
of a matrix of column or row vector the fundament
idea is to add a column or row analog to
ad an addit row of data in a linear least
squar problem a column or row is drop by a
formal scale with the imaginari unit 1 follow by least
squar addit of the column or row the elimin process
for the procedur is success ssive applic of the given
transform in modifi more effici form these idea ar illustr
with an implement of the revis simplex method the algorithm
is a gener purpos on that doe not account for
ani particular structur or sparsiti in the equat some suggest
comput test for determin sign of variou control paramet in
the revis simplex algorithm ar mention a simpl mean of
construct test case and some sampl comput time ar present
cacm april 1979 hanson r wisniewski j linear program numer
linear algebra modifi given transform linear program test case 5
5 4 5 41 5 1 5 14 ca790404 dh
mai 21 1979 2 06 pm 3099 4 3138 3138
4 3138 1313 5 3138 3138 5 3138 3138 5
3138 3138 5 3138 
# 3139
new method to color the vertic of a graph thi
paper describ effici new heurist method to color the vertic
of a graph which reli upon the comparison of the
degre and structur of a graph a method is develop
which is exact for bipartit graph and is an import
part of heurist procedur to find maxim cliqu in gener
graph final an exact method is given which perform better
than the randal brown algorithm and is abl to color
larger graph and the new heurist method the classic method
and the exact method ar compar cacm april 1979 brelaz
d np complet graph structur balanc graph color schedul comparison
of the method 5 25 5 32 ca790405 dh june
5 1979 2 05 pm 3139 5 3139 3139 5
3139 3139 5 3139 
# 3140
social process and proof of theorem and program it is
argu that formal verif of program no matter how obtain
will not plai the same kei role in the develop
of comput scienc and softwar engin as proof do in
mathemat furthermor the absenc of continu the inevit of chang
and the complex of specif of significantli mani real program
make the form al verif process difficult to justifi and
manag it is felt that eas of formal verif should
not domin program languag design cacm mai 1979 de millo
r lipton r perli a formal mathemat mathemat proof program
verif program specif 2 10 4 6 5 24 ca790501
dh june 5 1979 2 23 pm 3140 5 3140
3140 5 3140 3140 5 3140 3178 5 3140 3076
6 3140 3140 6 3140 3142 6 3140 3179 6
3140 3180 6 3140 3181 6 3140 3182 6 3140
# 3141
an improv algorithm for decentr extrema find in circular configur
of process thi note present an improv to lelann s
algorithm for find the largest or smallest of a set
of uniqu number process arrang in a circl in which
no central control exist and the number of process is
not known a priori thi decentr algorithm us a techniqu
of select messag extinct in order to achiev an averag
number of messag pass of order n log n rather
than o n2 cacm mai 1979 chang e robert r
decentr algorithm distribut system oper system 4 32 4 35
5 25 5 32 ca790502 dh june 5 1979 2
35 pm 3141 5 3141 3141 5 3141 3141 5
3141 
# 3142
consum difficulti with computer transact an empir investig the preval
with which error mai be encount by the end target
of a computer process is assess how mani and what
type of error occur how easili ar thei correct what
is the reaction of consum to error to a failur
to correct them what can be learn by design of
larg manag packag from such data result show that with
the present state of the art approxim 40 percent of
individu or household have averag contact with differ type of
account experi on or more error per year eighti percent
relat to bill attempt to correct error often turn out
to be difficult and not alwai success there appear to
be some conflict between comput us organ and their public
also the role of poor man agement packag includ poor
softwar is indic while most manag system mai be adequ
result of the survei rais concern about the timeli and
the number of design of veri larg link program packag
as eft for instanc cacm mai 1979 sterl t error
system error bill error manag system consum 2 0 2
1 2 12 2 2 3 50 3 52 3
55 4 19 4 6 ca790503 dh june 5 1979
3 21 pm 3142 4 3142 3142 4 3142 3179
4 3142 3178 4 3142 3182 4 3142 3183 4
3142 2583 5 3142 3076 5 3142 3142 5 3142
3142 5 3142 3142 5 3142 3178 5 3142 3076
6 3142 3140 6 3142 3142 6 3142 3179 6
3142 3180 6 3142 3181 6 3142 3182 6 3142
# 3143
reason about arrai a varieti of concept law and notat
ar present which facilit reason about arrai the basic concept
includ interv and their partit function restrict imag pointwis extens
of relat order singl point variat of function variou equival
relat for arrai valu and concaten the effect of these
idea is illustr by inform descript of algorithm for binari
search and merg and by a short formal proof cacm
mai 1979 reynold j arrai assert program prove interv partit
pointwis extens order concaten binari search merg 4 0 4
22 5 21 5 24 ca790504 dh june 5 1979
3 33 pm 2021 4 3143 2222 4 3143 2227
4 3143 2315 4 3143 2326 4 3143 2356 4
3143 2420 4 3143 2470 4 3143 2732 4 3143
2865 4 3143 2874 4 3143 2896 4 3143 2943
4 3143 3014 4 3143 3068 4 3143 3077 4
3143 3143 4 3143 3143 4 3143 1834 5 3143
2227 5 3143 3143 5 3143 3143 5 3143 3143
5 3143 
# 3144
a model for and discuss of multi interpret system a
multi interpret system is a system in which program execut
by virtu of be interpret by other program which themselv
mai either be interpret i e nest interpret or run
directli on the host machin the model reveal the anatomi
of interpret and how these differ from procedur and exhibit
link to protect domain and multiprocessor architectur cacm mai 1979
manthei m interpret transfer of control hierarchi 4 13 3
65 ca790505 dh august 21 19791 14 pm 1458 4
3144 1523 4 3144 1603 4 3144 1698 4 3144
1747 4 3144 1748 4 3144 1854 4 3144 1877
4 3144 1960 4 3144 2377 4 3144 2378 4
3144 2497 4 3144 2558 4 3144 2625 4 3144
2626 4 3144 2632 4 3144 2748 4 3144 2840
4 3144 2865 4 3144 2866 4 3144 2868 4
3144 2868 4 3144 2870 4 3144 2876 4 3144
2898 4 3144 2941 4 3144 2972 4 3144 3043
4 3144 3105 4 3144 3105 4 3144 3105 4
3144 3128 4 3144 3144 4 3144 3144 4 3144
3144 4 3144 3144 4 3144 3144 4 3144 3144
4 3144 3144 4 3144 1471 5 3144 2298 5
3144 2491 5 3144 2597 5 3144 2624 5 3144
2625 5 3144 2632 5 3144 3144 5 3144 3144
5 3144 3144 5 3144 
# 3145
an implement of structur walk through in teach cobol program
the effect of structur walk through in teach introductori cobol
program wa empir assess with a sampl of 215 under
graduat busi administr major cobol profici wa measur by a
final examin test a knowledg of languag rule b abil
to read and debug a program and c the abil
to write a program analysi of multipl covari wa us
to statist adjust test score for ag and condit reason
score the find provid empir support for incorpor structur walk
through into the program learn process more effect develop student
profici in write cobol program cacm june 1979 lemo r
structur walk through cobol program teach of program test program
profici 3 51 1 52 2 42 4 22 ca790601
dh august 21 1979 3 19 pm 3145 4 3145
2887 5 3145 3145 5 3145 3145 5 3145 3145
5 3145 
# 3146
an academ program provid realist train in softwar engin an
academ program at harvei mudd colleg call the clinic program
bring project from industri on campu to be studi and
solv by student team the object of the clinic is
to provid student work as small team under care faculti
supervis an opportun to work on real world problem of
suffici magnitud and complex under thi program student can acquir
essenti skill of softwar engin such as team work softwar
project manag softwar design methodolog and commun skill in a
realist environ sampl softwar project undertaken by the clinic ar
describ experi so far ha shown that the program is
a viabl transit from an academ to industri world cacm
june 1979 busenberg s tam w softwar engin softwar engin
educ softwar project student team softwar engin skill 1 52
4 0 ca790602 dh august 21 1979 4 04 pm
3146 5 3146 3146 5 3146 3146 5 3146 
# 3147
a model for autom file and program design in busi
applic system thi paper discuss a model for find an
effici implement of a busi applic system whose logic specif
have been determin in advanc the model view file and
program design as a problem of systemat coordin the configur
of dataset and comput it us a straight forward search
techniqu to determin aggreg of comput aggreg of dataset devic
organ and kei order for each data set kei order
for each comput and access method for each dataset comput
pair although comput result ar present for a sampl problem
involv 54 comput and 49 dataset the main point of
the paper is that the underli model work computation an
d is simpl enough to be adapt to mani file
design situat cacm june 1979 alter s system design automat
program search method system configur design choic 4 12 4
22 4 6 ca790603 dh august 21 1979 4 25
pm 3147 4 3147 2718 5 3147 3147 5 3147
3147 5 3147 3147 5 3147 
# 3148
high level program for distribut comput program for distribut and
other loos coupl system is a problem of grow interest
thi paper describ an approach to distribut comput at the
level of gener purpos program languag base on primit notion
of modul messag and transact kei the methodolog is shown
to be independ of particular languag and machin it appear
to be us for program a wide rang of task
thi is part of an ambiti program of develop in
advanc program languag and relat with other aspect of the
project ar also discuss cacm june 1979 feldman j distribut
comput modul messag assert 4 22 4 32 ca790604 dh
august 21 1979 4 31 pm 1957 4 3148 2151
4 3148 3031 4 3148 3103 4 3148 3105 4
3148 3128 4 3148 3148 4 3148 3148 4 3148
3148 4 3148 3148 4 3148 3148 4 3148 3150
4 3148 3150 4 3148 3155 4 3148 1860 5
3148 2817 5 3148 2865 5 3148 2939 5 3148
3073 5 3148 3148 5 3148 3148 5 3148 3148
5 3148 3150 5 3148 2060 6 3148 2704 6
3148 2842 6 3148 2939 6 3148 2940 6 3148
2941 6 3148 2943 6 3148 3073 6 3148 3148
6 3148 
# 3149
the cyclic order properti of vertic as an aid in
scene analysi a cyclic order properti is defin for bodi
bound by smooth curv face the properti is shown to
be us for analyz pictur of such bodi particularli when
the line data extract from the pictur ar imperfect thi
properti augment previous known grammat rule that determin the exist
of three dimension bodi correspond to given two dimension line
structur data cacm june 1979 shapira r freeman h scene
analysi cyclic order artifici intellig three dimension reconstruct pictur process
comput graphic pattern recognit 3 2 3 6 8 2
ca790605 dh august 22 1979 1 36 pm 3149 5
3149 3149 5 3149 3149 5 3149 
# 3150
beyond program languag as comput technolog matur our grow abil
to creat larg system is lead to basic chang in
the natur of program current program languag concept will not
be adequ for build and maintain system of the complex
call for by the task we attempt just as high
level languag enabl the programm to escap from the intricaci
of a machin s order code higher level program system
can provid the mean to understand and manipul complex system
and compon in order to develop such system we need
to shift our attent awai from the detail specif of
algorithm toward the descript of the properti of the packag
and object with which we build thi paper analyz some
of the shortcom of program languag as thei now exist
and lai out some possibl direct for futur research cacm
juli 1979 winograd t program program languag program system system
develop 4 0 4 20 4 22 4 40 ca790701
dh august 22 1979 2 00 pm 2155 4 3150
2294 4 3150 2558 4 3150 2837 4 3150 2842
4 3150 2945 4 3150 3031 4 3150 3077 4
3150 3105 4 3150 3148 4 3150 3148 4 3150
3150 4 3150 3150 4 3150 3150 4 3150 3150
4 3150 3150 4 3150 3150 4 3150 3150 4
3150 3150 4 3150 3150 4 3150 3155 4 3150
2060 5 3150 2704 5 3150 2842 5 3150 2939
5 3150 2941 5 3150 2943 5 3150 2940 5
3150 3073 5 3150 3148 5 3150 3150 5 3150
3150 5 3150 3150 5 3150 
# 3151
an optim real time algorithm for planar convex hull an
algorithm is describ for the construct in real time of
the convex hull of a set of n point in
the plane us an appropri data structur the algorithm construct
the convex hull by success updat each take time o
log n therebi achiev a total process time o n
log n cacm juli 1979 preparata f comput geometri convex
hull planar set of point real time algorithm on line
algorithm 4 49 5 25 5 32 ca790702 dh august
22 1979 2 07 pm 3151 4 3151 2997 5
3151 3151 5 3151 3151 5 3151 3151 5 3151
# 3152
storag reorgan techniqu for matrix comput in a page environ
in order to multipli matric while minim the number of
page fetch requir it is often more effici to reorgan
the data into submatrix form and to us block multipl
rather than to us the best known algorithm which leav
the matric store in row or column orient form an
effici method for accomplish thi reorgan is given thi also
make possibl the deriv of an asymptot better bound for
multipl of matric given in row orient form by adapt
the techniqu of strassen to the reorgan data the reorgan
block multipl scheme is shown to be advantag for matric
and page of realist size the strassen adapt is not
the former scheme is also shown to be advantag even
if the transpos of on of the matric is avail
at no addit cost cacm juli 1979 fischer p probert
r matrix multipl page virtual memori data reorgan pagin transpos
4 34 5 14 5 25 ca790703 dh august 22
1979 2 29 pm 2365 4 3152 2362 4 3152
2582 4 3152 3152 4 3152 3152 4 3152 1924
5 3152 2365 5 3152 3152 5 3152 3152 5
3152 3152 5 3152 
# 3153
the control of respons time in multi class system by
memori alloc the possibl of give differ qualiti of servic
to job of differ class by regul their memori alloc
is examin in the context of a page comput system
two parameter algorithm which partit the main memori between two
class of job ar consid initi a close system consist
of a process or and page and file devic with
fix number of job is studi to determin optim degre
of multiprogram and the proport of processor time devot to
each class appli a decomposit approach and treat the close
system as a singl server the respons time in an
open system with extern arriv ar studi the object is
to investig the effect of the memori aloc paramet on
the expect respons time under the two algorithm numer solut
and econom lower bound for the expect respons time as
function of the control paramet ar obtain a wai of
appli the result to system with more than two job
class is indic cacm juli 1979 hine j mitrani i
tsur s queue network page virtual memori perform control 4
32 8 1 ca790704 dh august 22 1979 3 32
pm 3016 4 3153 3070 4 3153 3153 4 3153
3153 4 3153 2741 5 3153 2891 5 3153 3153
5 3153 3153 5 3153 3153 5 3153 
# 3154
algorithm logic control an algorithm can be regard as consist
of a logic compon which specifi the knowledg to be
us in solv problem and a control compon which determin
the problem solv strategi by mean of which that knowledg
is us the logic compon determin the mean of the
algorithm wherea the control compon onli affect it effici the
effici of an algorithm can often by improv the control
compon without chang the logic of the algorithm we argu
that comput program would be more often correct and more
easili improv and modifi if their logic and control aspect
were identifi and separ in the program text cacm juli
1979 kowalski r control languag logic program nonprocedur languag program
methodolog program specif relat data structur 3 64 4 20
4 30 5 21 5 24 ca790705 dh septemb 24
1979 5 08 pm 1989 4 3154 2060 4 3154
2155 4 3154 2179 4 3154 2406 4 3154 2698
4 3154 2710 4 3154 2715 4 3154 2716 4
3154 2717 4 3154 2718 4 3154 2765 4 3154
2817 4 3154 2888 4 3154 2901 4 3154 2921
4 3154 2957 4 3154 2959 4 3154 2965 4
3154 3087 4 3154 3154 4 3154 3154 4 3154
3154 4 3154 2046 5 3154 2110 5 3154 3133
5 3154 3154 5 3154 3154 5 3154 3154 5
3154 3154 6 3154 
# 3155
the paradigm of program cacm august 1979 floyd r ca790801
db januari 4 1980 11 44 am 1323 4 3155
1358 4 3155 1380 4 3155 1665 4 3155 1781
4 3155 1787 4 3155 1989 4 3155 2112 4
3155 2319 4 3155 2480 4 3155 2480 4 3155
2534 4 3155 2541 4 3155 2594 4 3155 2698
4 3155 2709 4 3155 2733 4 3155 2738 4
3155 2820 4 3155 2867 4 3155 2939 4 3155
2972 4 3155 3004 4 3155 3030 4 3155 3073
4 3155 3148 4 3155 3150 4 3155 3155 4
3155 3155 4 3155 3155 4 3155 3155 4 3155
2204 5 3155 2247 5 3155 3073 5 3155 3155
5 3155 3155 5 3155 3155 5 3155 799 5
3155 
# 3156
comput connect compon on parallel comput we present a parallel
algorithm which us n2 processor to find the connect compon
of an undirect graph with n vertic in time o
log2n an o log2n time bound also can be achiev
us onli n n log2n processor the algorithm can be
us to find the transit closur of a symmetr boolean
matrix we assum that the processor have access to a
common memori simultan access to the same locat is permit
for fetch instruct but not for store instruct cacm august
1979 hirschberg d chandra a sarwat d graph theori parallel
process algorithm transit closur connect compon 5 25 5 32
6 22 ca790802 db januari 4 1980 12 18 pm
3075 4 3156 3156 4 3156 3156 4 3156 3156
4 3156 2289 5 3156 2973 5 3156 3075 5
3156 3156 5 3156 3156 5 3156 3156 5 3156
# 3157
prove termin with multiset order a common tool for prove
the termin of program is the well found set a
set order in such a wai as to admit no
infinit descend sequenc the basic approach is to find a
termin function that map the valu of the program variabl
into some well found set such that the valu of
the termin function is repeatedli reduc throughout the comput all
too often the termin function requir ar difficult to find
and ar of a complex out of proport to the
program under consider multiset bag over a given well found
set s ar set that admit multipl occurr of element
taken from s the given order on s induc an
order on the finit multiset over s thi multiset order
is shown to be well found the multiset order enabl
the us of rel simpl and intuit termin function in
otherwis difficult termin proof in particular the multiset order is
us to prove the termin of product system program defin
in term of set of rewrit rule cacm august 1979
dershowitz n manna z program correct program termin program verif
well found order well found set multiset bag product system
term rewrit system tree replac system reduct rule 5 24
5 7 ca790803 db januari 4 1980 3 44 pm
3157 4 3157 3014 5 3157 3157 5 3157 3157
5 3157 3157 5 3157 
# 3158
secur person comput in an insecur network a method for
implement secur person comput in a network with on or
more central facil is propos the method emploi a public
kei encrypt devic and hardwar kei each user is respons
for hi own secur and need not reli on the
secur of the central facil or the commun link a
user can safe store confidenti file in the central facil
or transmit confidenti data to other user on the network
cacm august 1979 den d person comput secur privaci network
public kei encrypt 2 12 6 20 ca790804 db januari
14 1980 9 26 am 2840 4 3158 2869 4
3158 3021 4 3158 3128 4 3158 3158 4 3158
3158 4 3158 3158 4 3158 2436 5 3158 3038
5 3158 3111 5 3158 3158 5 3158 3158 5
3158 3158 5 3158 
# 3159
further remark on stabli updat mean and standard deviat estim
cacm august 1979 nelson l mean standard deviat 5 5
5 19 ca790805 db januari 14 1980 9 38 am
2731 4 3159 3159 4 3159 3159 4 3159 3166
4 3159 3166 4 3159 3167 4 3159 3167 4
3159 2731 5 3159 2799 5 3159 3159 5 3159
3159 5 3159 3159 5 3159 3166 5 3159 1411
6 3159 2731 6 3159 2799 6 3159 3159 6
3159 3167 6 3159 
# 3160
rejuven experiment comput scienc thi report is base on the
result of an nsf sponsor workshop held in wasington d
on novemb 2 1978 the co author of the report
ar gordon bell digit equip corpor bernard a galler univers
of michigan patricia goldberg ibm corpor john hamblen univers of
missouri at rolla elliot pinson bell telephon laboratori and ivan
sutherland california institut of technolog also particip in the workshop
were repres of nsf and other govern agenc in addit
to the author a number of other peopl have contribut
to the content of thi report in prepar for the
origin workshop all doctor grant comput scienc depart in the
nation were ask for comment and suggest on the problem
of experiment comput scienc a version of the current report
date januari 15 wa circul to these depart and to
a number of industri and govern group for critic the
editor and author of thi final version gratefulli acknowledg the
contribut of a larg number of other peopl at all
stage in the prepar of the report note follow thi
present of the report there is a posit paper on
the crisi in experiment comput scienc written by the acm
execut committe cacm septemb 1979 feldman j sutherland w ca790901
db januari 14 1980 10 05 am 3160 5 3160
3160 5 3160 3160 5 3160 
# 3161
an acm execut committe posit on the crisi in experiment
comput scienc cacm septemb 1979 mccracken d ccp den p
brandin d ca790902 db januari 14 1980 10 19 am
3161 5 3161 3161 5 3161 3161 5 3161 
# 3162
on improv the worst case run time of the boyer
moor string match algorithm it is shown how to modifi
the boyer moor string match algorithm so that it worst
case run time is linear even when multipl occurr of
the pattern ar present in the text cacm septemb 1979
galil z comput complex linear time worst case string match
period 3 74 4 40 5 25 ca790903 db januari
14 1980 10 27 am 3162 4 3162 2916 5
3162 3162 5 3162 3162 5 3162 3162 5 3162
# 3163
an optim insert algorithm for on side height balanc binari
search tree an algorithm for insert an element into a
on side height balanc oshb binari search tree is present
the algorithm oper in time o log n where n
is the number of node in the tree thi repres
an improv over the best previou ly known insert algorithm
of hirschberg and kosaraju which requir time o log 2n
moreov the o log n complex is optim earlier result
have shown that delet in such a structur can also
be perform in o log n time thu the result
of thi paper give a neg answer to the question
of whether such tree should be the first exampl of
their kind where delet ha a smaller time complex than
insert furthermor it can now be conclud that insert delet
and retriev in oshb tree can be perform in the
same time as the correspond oper for the more gener
avl tree to within a constant factor howev the insert
and delet algorithm for oshb tree appear much more complic
than the correspond algorithm for avl tree cacm septemb 1979
raiha k zweben s insert on side height balanc tree
height balanc tree binari tree search tree 3 73 3
74 4 34 5 25 5 31 ca790904 db januari
14 1980 11 47 am 2839 4 3163 3009 4
3163 3042 4 3163 3042 4 3163 3065 4 3163
3065 4 3163 3096 4 3163 3096 4 3163 3096
4 3163 3163 4 3163 3163 4 3163 3163 4
3163 3163 4 3163 3163 4 3163 2839 5 3163
2889 5 3163 3009 5 3163 3065 5 3163 3096
5 3163 3163 5 3163 3163 5 3163 3163 5
3163 
# 3164
progress acycl digraph a tool for databas integr a progress
acycl digraph pad algorithm accept ar request and maintain a
graph in an acycl state when a request creat a
cycl node ar detach until the new ar can be
enter acycl thi process is import in certain area of
databas implement in which there ar constraint on the permiss
sequenc of action two pad algorithm ar present on us
a simpl path matrix represent and the other us a
list with an artifici gradient experi suggest that for larg
n the second is consider faster though both ar asymptot
o nr where n is the number of node and
r is the expect number of node reachabl along path
from ani given node cacm septemb 1979 hansen w list
process data structur topolog sort acycl digraph databas integr network
deadlock 4 34 5 32 4 33 ca790905 db januari
14 1980 11 56 am 3164 4 3164 1712 5
3164 3164 5 3164 3164 5 3164 3164 5 3164
# 3165
approxim of polygon map by cellular map the approxim of
polygon themat map by cellular map an import oper in
geograph data process is analyz the data organ us for
repres the polygon map is a wide us segment base
data structur where class label identifi the region border each
segment on either side the approxim algorithm present oper on
such an organ elimin the need for the recognit of
region boundari each segment is examin onli onc the versatil
of the new organ is further illustr by the outlin
of algorithm for area comput and point inclus the algorithm
is appli to a set of soil map convert to
comput readabl form by mean of a coordin digit cacm
septemb 1979 nagi g wagl s polygon map cellular grid
geograph data structur comput geometri comput cartographi autom cartographi 3
14 4 34 8 2 ca790906 db januari 14 1980
12 04 pm 1630 4 3165 2547 4 3165 2987
4 3165 3165 4 3165 3165 4 3165 1326 5
3165 2987 5 3165 3165 5 3165 3165 5 3165
3165 5 3165 
# 3166
comput standard deviat accuraci four algorithm for the numer comput
of the standard deviat of unweight sampl data ar analyz
two of the algorithm ar well known in the statist
and comput literatur the other two ar new algorithm specif
intend for automat comput our discuss is expositori with emphasi
on reach a suitabl definit of accuraci each of the
four algorithm is analyz for the condit under which it
will be accur we conclud that all four algorithm will
provid accur answer for mani problem but two of the
algorithm on new on old ar substanti more accur on
difficult problem than ar the other two cacm septemb 1979
chan t lewi j mean standard deviat least squar updat
estim round error analysi condit number 5 5 5 11
5 19 ca790907 db januari 16 1980 4 23 pm
1619 4 3166 2731 4 3166 3159 4 3166 3159
4 3166 3166 4 3166 3166 4 3166 3166 4
3166 3166 4 3166 3166 4 3166 3167 4 3166
3167 4 3166 1411 5 3166 2731 5 3166 2799
5 3166 3159 5 3166 3166 5 3166 3166 5
3166 3166 5 3166 3167 5 3166 2731 6 3166
2799 6 3166 3166 6 3166 
# 3167
updat mean and varianc estim an improv method a method
of improv effici is given for updat the mean and
varianc of weight sampl data when an addit data valu
is includ in the set evid is present that the
method is stabl and at least as accur as the
best exist updat method cacm septemb 1979 west d mean
standard deviat varianc updat estim remov data 5 5 5
19 ca790908 db januari 16 1980 4 47 pm 2731
4 3167 3159 4 3167 3159 4 3167 3166 4
3167 3166 4 3167 3167 4 3167 3167 4 3167
3167 4 3167 2731 5 3167 2799 5 3167 3166
5 3167 3167 5 3167 3167 5 3167 3167 5
3167 1411 6 3167 2731 6 3167 2799 6 3167
3159 6 3167 3167 6 3167 
# 3168
comment on an optim evalu of boolean express in an
onlin queri system cacm octob 1979 laird p queri boolean
express inform retriev file organ 3 53 70 3 73
3 74 ca791001 db januari 16 1980 4 50 pm
3168 4 3168 3168 4 3168 3169 4 3168 2965
5 3168 3002 5 3168 3168 5 3168 3168 5
3168 3168 5 3168 
# 3169
note on an optim evalu of boolean express in an
onlin queri system cacm octob 1979 gude e hoffman a
queri boolean express optim evalu inform retriev 3 50 3
70 3 74 ca791002 db januari 16 1980 4 52
pm 3168 4 3169 3169 4 3169 2965 5 3169
3169 5 3169 3169 5 3169 3169 5 3169 
# 3170
on the proof of correct of a calendar program a
formal specif is given for a simpl calendar program and
the deriv and proof of correct of the program ar
sketch the specif is easi to understand and it correct
is manifest to human cacm octob 1979 lamport l program
specif program verif induct assert 5 24 ca791003 db januari
16 1980 5 02 pm 3170 4 3170 3170 4
3170 3055 5 3170 3104 5 3170 3170 5 3170
3170 5 3170 3170 5 3170 
# 3171
line number made cheap a techniqu is describ for run
time line number administr to be us for implement of
high level languag under suitabl circumst thi method requir absolut
no overhead in either time or space dure execut of
the program cacm octob 1979 klint p line number administr
diagnost messag abstract machin code 4 12 4 13 4
20 4 42 ca791004 db januari 17 1980 9 57
am 3171 5 3171 3171 5 3171 3171 5 3171
# 3172
an algorithm for plan collis free path among polyhedr obstacl
thi paper describ a collis avoid algorithm for plan a
safe path for a polyhedr object move among known polyhedr
object the algorithm transform the obstacl so that thei repres
the locu of forbidden posit for an arbitrari refer point
on the move object a trajectori of thi refer point
which avoid all forbidden region is free of collis trajectori
ar found by search a network which indic for each
vertex in the transform obstacl which other vertic can be
reach safe cacm octob 1979 lozano perez t weslei m
path find collis free path polyhedr object polyhedr obstacl graph
search grow object 3 15 3 64 3 66 8
1 ca791005 db januari 17 1980 10 13 am 3172
4 3172 3116 5 3172 3172 5 3172 3172 5
3172 3172 5 3172 
# 3173
a psycholog of learn basic thi paper address the question
what doe a person know follow learn of basic program
sever underli conceptu structur ar identifi 1 a transact is
an event that occur in the comput and involv some
oper on some object at some locat 2 a prestat
is a set of transact correspond to a line of
code 3 chunk ar frequent occur configur of prestat correspond
to sever line of code cacm novemb 1979 mayer r
basic learn instruct 1 50 3 36 4 22 ca791101
db januari 17 1980 10 38 am 3173 5 3173
3173 5 3173 3173 5 3173 
# 3174
password secur a case histori thi paper describ the histori
of the design of the password secur scheme on a
remot access time share system the present design wa the
result of counter observ attempt to penetr the system the
result is a compromis between extrem secur and eas of
us cacm novemb 1979 morri r thompson k oper system
password comput secur 2 41 4 35 ca791102 db januari
18 1980 10 03 am 2626 4 3174 2786 4
3174 2840 4 3174 2919 4 3174 3017 4 3174
3110 4 3174 3174 4 3174 2629 5 3174 3174
5 3174 3174 5 3174 3174 5 3174 
# 3175
break substitut cipher us a relax algorithm substitut cipher ar
code in which each letter of the alphabet ha on
fix substitut and the word divis do not chang in
thi paper the problem of break substitut cipher is repres
as a probabilist label problem everi code letter is assign
probabl of repres plain text letter these probabl ar updat
in parallel for all code letter us joint letter probabl
iter the updat scheme result in improv estim that final
lead to break the cipher the method is appli successfulli
to two exampl cacm novemb 1979 peleg s rosenfeld a
cryptographi substitut cipher probabilist classif relax 3 42 3 63
ca791103 db januari 23 1980 11 15 am 3175 5
3175 3175 5 3175 3175 5 3175 
# 3176
store a spars tabl the problem of store and search
larg spars tabl is ubiquit in comput scienc the standard
techniqu for store such tabl is hash but hash ha
poor worst case perform we propos a good worst case
method for store a static tabl of n entri each
an integ between 0 and n 1 the method requir
0 n w word of storag and allow o logn
n access time although our method is a littl complic
to us in practic our analysi show why a simpler
algorithm us for compress lr pars tabl work so well
cacm novemb 1979 tarjan r yao a gaussian elimin pars
search spars matrix tabl compress tabl lookup 3 74 4
12 4 34 5 25 ca791104 db januari 23 1980
11 24 am 3041 4 3176 3126 4 3176 3176
4 3176 2905 5 3176 3176 5 3176 3176 5
3176 3176 5 3176 
# 3177
how to share a secret in thi paper we show
how to divid data d into n piec in such
a wai that d is easili reconstruct from ani k
piec but even complet knowledg of k 1 piec reveal
olut no inform about d thi techniqu enabl the construct
of robust kei manag scheme for cryptograph system that can
function secur and reliabl even when misfortun destroi half the
piec and secur breach expos all but on of the
remain piec cacm novemb 1979 shamir a cryptographi kei manag
interpol 5 39 5 6 ca791105 db januari 23 1980
11 48 am 3038 4 3177 3111 4 3177 3177
4 3177 3021 5 3177 3177 5 3177 3177 5
3177 3177 5 3177 
# 3178
introduct to the eft symposium cacm decemb 1979 kling r
ca791201 db februari 21 1980 5 02 pm 3142 4
3178 3179 4 3178 3178 4 3178 3178 4 3178
3178 4 3178 3178 4 3178 3178 4 3178 3178
4 3178 3178 4 3178 3182 4 3178 3183 4
3178 3076 5 3178 3140 5 3178 3142 5 3178
3179 5 3178 3178 5 3178 3178 5 3178 3178
5 3178 3182 5 3178 3180 5 3178 3181 5
3178 
# 3179
overview of the eft symposium it is increasingli recogn that
larg scale technolog such as eft have the potenti for
aid in the solut of current societ problem yet these
technolog also gener problem thi symposium present select paper from
a confer that sought to discov what is current known
about eft impact in societi and what research is need
in the futur cacm decemb 1979 kraemer k colton k
eft s research agenda confer result public polici 2 11
3 52 3 53 3 80 ca791202 db februari 25
1980 11 03 am 2756 4 3179 3076 4 3179
3142 4 3179 3179 4 3179 3179 4 3179 3179
4 3179 3178 4 3179 3182 4 3179 3183 4
3179 2572 5 3179 2607 5 3179 3076 5 3179
3179 5 3179 3179 5 3179 3179 5 3179 3178
5 3179 3076 6 3179 3140 6 3179 3142 6
3179 3179 6 3179 3180 6 3179 3181 6 3179
3182 6 3179 
# 3180
cost of the current u payment system neither the bank
industri nor public polici maker have good inform on the
compar cost of altern payment system such as cash check
credit card and eft transact as a result eft system
and servic ar like to be implement without a valid
assess of whether thei ar cost justifi lst alon justifi
in term of other criteria cacm decemb 1979 lipi a
eft s payment system cost payment system volum 3 52
ca791203 db februari 25 1980 11 09 am 3178 5
3180 3180 5 3180 3180 5 3180 3180 5 3180
3076 6 3180 3140 6 3180 3142 6 3180 3179
6 3180 3180 6 3180 3181 6 3180 3182 6
3180 
# 3181
public protect and educ with eft research ha reveal the
exist of widespread misinform and lack of knowledg about eft
among busi and govern as well as consum as a
result ani effort to stimul meaning public particip in decis
on the introduct of eft system will requir a coordin
educ effort of consider scale in addit research ha reveal
shortcom in the present system for defin respons liabil and
avenu of recours thi articl present sever possibl altern for
improv the current system but ongo research is also need
to assur that action taken will be respons to the
chang environ and consum need cacm decemb 1979 long r
electron fund transfer system consum educ secur and fraud privaci
system reliabl eft ombudsman 2 12 ca791204 db februari 25
1980 11 33 am 3178 5 3181 3181 5 3181
3181 5 3181 3181 5 3181 3076 6 3181 3140
6 3181 3142 6 3181 3179 6 3181 3180 6
3181 3181 6 3181 3182 6 3181 
# 3182
vulner of eft to intention caus loss the hypothesi that
consum ar provid greater accuraci and freedom from error and
fraud with electron fund transfer system eft is discuss in
light of the technic capabl and potenti of the comput
to protect against both accident and intention caus loss although
the nomenclatur for busi crime remain the same as for
manual depositori and other financi servic system for exampl fraud
theft embezzl the characterist of the crime ar new the
chang result from the acceler us of eft and it
continu technolog advanc broaden the scope of secur issu to
be examin factor such as backup requir regulatori and legisl
action and econom give rise to the urgenc for immedi
research into solut for emerg eft relat vulner cacm decemb
1979 parker d eft comput abus crime secur error loss
posit of trust legisl 2 11 2 3 3 52
3 80 ca791205 db februari 25 1980 1 56 pm
3142 4 3182 3179 4 3182 3178 4 3182 3182
4 3182 3183 4 3182 3076 5 3182 3178 5
3182 3182 5 3182 3182 5 3182 3182 5 3182
3076 6 3182 3140 6 3182 3142 6 3182 3179
6 3182 3180 6 3182 3181 6 3182 3182 6
3182 
# 3183
polici valu and eft research anatomi of a research agenda
there is an emerg recognit that eft system have the
potenti to vastli alter the payment and fund transfer system
in american societi a number of forc and actor ar
involv in thi evolut and the valu vari significantli depend
on individu and institut perspect these valu conflict ar highlight
in a six part research agenda technolog issu in eft
eft impact on peopl econom impact of eft regul and
control of eft and evalu and monitor eft system cacm
decemb 1979 kraemer k colton k eft research agenda valu
conflict impact on peopl econom impact regul and control monitor
eft 2 11 2 3 3 52 3 53 3
80 ca791206 db februari 25 1980 2 10 pm 3142
4 3183 3179 4 3183 3178 4 3183 3182 4
3183 3183 4 3183 3076 5 3183 3183 5 3183
3183 5 3183 3183 5 3183 
# 3184
revis report on the algorithm languag algol 60 the report
give a complet defin descript of the intern algorithm languag
algol 60 thi is a languag suitabl for express a
larg class of numer process in a form suffici concis
for direct automat translat into the languag of program automat
comput cacm januari 1963 nuar p ca630117 es march 17
1982 10 10 am 1781 4 3184 1828 4 3184
1854 4 3184 1877 4 3184 1960 4 3184 2150
4 3184 2150 4 3184 2228 4 3184 2256 4
3184 2317 4 3184 2317 4 3184 2319 4 3184
2377 4 3184 2342 4 3184 2342 4 3184 2376
4 3184 2376 4 3184 2379 4 3184 2424 4
3184 2482 4 3184 2618 4 3184 2618 4 3184
2632 4 3184 2704 4 3184 2723 4 3184 2738
4 3184 2740 4 3184 2741 4 3184 2867 4
3184 3184 4 3184 3184 4 3184 3184 4 3184
949 5 3184 989 5 3184 1086 5 3184 1132
5 3184 1198 5 3184 1234 5 3184 1263 5
3184 1265 5 3184 1270 5 3184 1323 5 3184
1358 5 3184 1379 5 3184 1380 5 3184 1453
5 3184 1464 5 3184 1484 5 3184 1491 5
3184 1498 5 3184 1613 5 3184 1614 5 3184
1749 5 3184 1781 5 3184 1825 5 3184 1860
5 3184 2083 5 3184 2178 5 3184 2179 5
3184 2252 5 3184 2325 5 3184 2341 5 3184
2546 5 3184 2645 5 3184 2652 5 3184 2684
5 3184 2842 5 3184 2929 5 3184 2934 5
3184 557 5 3184 3069 5 3184 3184 5 3184
3184 5 3184 3184 5 3184 669 5 3184 679
5 3184 691 5 3184 761 5 3184 1 6
3184 823 6 3184 123 6 3184 145 6 3184
196 6 3184 196 6 3184 196 6 3184 196
6 3184 196 6 3184 919 6 3184 944 6
3184 947 6 3184 987 6 3184 988 6 3184
989 6 3184 989 6 3184 990 6 3184 990
6 3184 1007 6 3184 1046 6 3184 1086 6
3184 1131 6 3184 1134 6 3184 1137 6 3184
1139 6 3184 1140 6 3184 1140 6 3184 1149
6 3184 1198 6 3184 1215 6 3184 1215 6
3184 1223 6 3184 1263 6 3184 1265 6 3184
1303 6 3184 1303 6 3184 1303 6 3184 1303
6 3184 1323 6 3184 1323 6 3184 1323 6
3184 1358 6 3184 1358 6 3184 1366 6 3184
1366 6 3184 1389 6 3184 1421 6 3184 1421
6 3184 1421 6 3184 1453 6 3184 1460 6
3184 1460 6 3184 1462 6 3184 1463 6 3184
1467 6 3184 1468 6 3184 1468 6 3184 1466
6 3184 1477 6 3184 1477 6 3184 1477 6
3184 1477 6 3184 1491 6 3184 1491 6 3184
1491 6 3184 1496 6 3184 1496 6 3184 1496
6 3184 1531 6 3184 1535 6 3184 1565 6
3184 1601 6 3184 1602 6 3184 1613 6 3184
1614 6 3184 1626 6 3184 1626 6 3184 1641
6 3184 1641 6 3184 1781 6 3184 1785 6
3184 1786 6 3184 1787 6 3184 1788 6 3184
205 6 3184 205 6 3184 1825 6 3184 210
6 3184 210 6 3184 224 6 3184 249 6
3184 267 6 3184 288 6 3184 288 6 3184
316 6 3184 321 6 3184 378 6 3184 381
6 3184 385 6 3184 398 6 3184 2015 6
3184 2059 6 3184 2060 6 3184 2110 6 3184
11 6 3184 2126 6 3184 2127 6 3184 2148
6 3184 2155 6 3184 2192 6 3184 21 6
3184 400 6 3184 402 6 3184 404 6 3184
404 6 3184 404 6 3184 404 6 3184 404
6 3184 407 6 3184 410 6 3184 410 6
3184 437 6 3184 463 6 3184 464 6 3184
464 6 3184 483 6 3184 483 6 3184 3184
6 3184 3184 6 3184 3184 6 3184 3184 6
3184 3184 6 3184 3184 6 3184 3184 6 3184
3184 6 3184 3184 6 3184 3184 6 3184 3184
6 3184 3184 6 3184 3184 6 3184 3184 6
3184 3184 6 3184 3184 6 3184 3184 6 3184
3184 6 3184 3184 6 3184 3184 6 3184 3184
6 3184 3184 6 3184 3184 6 3184 3184 6
3184 3184 6 3184 3184 6 3184 3184 6 3184
3184 6 3184 3184 6 3184 3184 6 3184 3184
6 3184 3184 6 3184 3184 6 3184 3184 6
3184 3184 6 3184 3184 6 3184 3184 6 3184
3184 6 3184 3184 6 3184 3184 6 3184 3188
6 3184 584 6 3184 584 6 3184 600 6
3184 631 6 3184 635 6 3184 669 6 3184
680 6 3184 691 6 3184 729 6 3184 729
6 3184 729 6 3184 731 6 3184 761 6
3184 763 6 3184 799 6 3184 799 6 3184
799 6 3184 799 6 3184 
# 3185
the humbl programm we shall do a much better program
job provid that we approach the task with a full
appreci if it tremend difficulti provid that we stick to
modest and eleg program languag provid that we respect the
intrins limit of the human mind and approach the task
as veri humbl programm cacm octob 1972 dijkstra e w
ca721010 es march 18 1982 10 00 am 249 4
3185 1139 4 3185 438 4 3185 3185 4 3185
3185 4 3185 303 5 3185 2705 5 3185 438
5 3185 3101 5 3185 3185 5 3185 3185 5
3185 3185 5 3185 1908 6 3185 2138 6 3185
2193 6 3185 2438 6 3185 3185 6 3185 3185
6 3185 
# 3186
go to statement considerd harm cacm march 1968 dijkstra e
w go to statement jump instruct branch instruct condit claus
repetit claus program intellig program sequenc 4 22 5 23
5 24 ca680303 es march 17 1982 10 10 am
2193 5 3186 2326 5 3186 2477 5 3186 2541
5 3186 2594 5 3186 3004 5 3186 3186 5
3186 3186 5 3186 3186 5 3186 1303 6 3186
1323 6 3186 1425 6 3186 1771 6 3186 1834
6 3186 2016 6 3186 2155 6 3186 2192 6
3186 2204 6 3186 2247 6 3186 2356 6 3186
2456 6 3186 3186 6 3186 3186 6 3186 3186
6 3186 3186 6 3186 3186 6 3186 3186 6
3186 799 6 3186 
# 3187
certif of algorithm 271 quickersort quickersort compil and run without
correct through the aldep translat for the cdc 1604a comparison
of averag sort item with other recent publish algorithm demonstr
quickersort s superior perform cacm mai 1966 blair c ca660516
es march 17 1982 10 10 am 1919 5 3187
2679 5 3187 3187 5 3187 3187 5 3187 3187
5 3187 864 6 3187 970 6 3187 1175 6
3187 1175 6 3187 1190 6 3187 1228 6 3187
1969 6 3187 1997 6 3187 308 6 3187 308
6 3187 309 6 3187 2042 6 3187 74 6
3187 3187 6 3187 3187 6 3187 507 6 3187
716 6 3187 783 6 3187 
# 3188
semiot and program languag i have base my paper on
semiot and it three dimens i should insert at thi
point that languag ha mani aspect and that pragmat semant
and syntact do not necessari cover all of them on
can howev project most aspect into the three semiot dimens
and there seem to be a strong tendenc to do
so todai cacm march 1966 zemanek h ca660319 es march
17 1982 10 10 am 2087 4 3188 2189 4
3188 3188 4 3188 3188 4 3188 1594 5 3188
1781 5 3188 3188 5 3188 3188 5 3188 3188
5 3188 612 5 3188 123 6 3188 196 6
3188 919 6 3188 990 6 3188 1007 6 3188
1046 6 3188 1131 6 3188 1139 6 3188 1140
6 3188 1149 6 3188 1198 6 3188 1215 6
3188 1223 6 3188 1265 6 3188 1303 6 3188
1323 6 3188 1358 6 3188 1366 6 3188 1421
6 3188 1460 6 3188 1462 6 3188 1463 6
3188 1467 6 3188 1468 6 3188 1477 6 3188
1491 6 3188 1496 6 3188 1531 6 3188 1535
6 3188 1565 6 3188 1601 6 3188 1602 6
3188 1613 6 3188 1614 6 3188 1626 6 3188
1641 6 3188 1787 6 3188 1788 6 3188 205
6 3188 224 6 3188 249 6 3188 288 6
3188 316 6 3188 381 6 3188 398 6 3188
11 6 3188 404 6 3188 410 6 3188 463
6 3188 464 6 3188 483 6 3188 3184 6
3188 3188 6 3188 584 6 3188 600 6 3188
680 6 3188 691 6 3188 763 6 3188 799
6 3188 
# 3189
an algebra compil for the fortran assembl program an algebra
compil ha been written which mai be ad to the
fortran assembl program thi compil will expand all algebra statement
with the follow oper addit subtract multipl and divis it
will compil multi level express in float point arithmet thi
is easili be revis to fix point cacm novemb 1962
stiegler a d ca621124 es march 17 1982 10 10
am 1788 5 3189 3189 5 3189 3189 5 3189
3189 5 3189 1006 6 3189 1007 6 3189 205
6 3189 3189 6 3189 
# 3190
correct to economi of scale and the ibm system 360
on page 439 a typic instruct mix id discuss and
the time comput as outlin in that page through an
undetect program error the time and the result regress equat
ar slightli in error cacm februari 1967 solomon m ca670214
es march 17 1982 10 10 am 2387 5 3190
3190 5 3190 3190 5 3190 3190 5 3190 1417
6 3190 3190 6 3190 
# 3191
gener permut by nest cycl the purpos of thi letter
is two fold first to give due credit to the
tompkin paig algorithm and second to clarifi a comment by
hill cr review 13891 on program for permut cacm june
1968 langdon glen g permut 5 39 ca680617 es march
18 1982 10 00 am 2189 5 3191 3191 5
3191 3191 5 3191 3191 5 3191 1594 6 3191
2087 6 3191 3191 6 3191 521 6 3191 
# 3192
the lincoln keyboard a typewrit keyboard design for comput input
flexibl a new typewrit keyboard for direct and punch paper
tape comput input will replac the usual commerci keyboard with
88 charact chosen for the conveni of programm the lincoln
keyboard is expect to facilit the program of algorithm process
and should allow consider flexibl in assembl and util routin
cacm juli 1958 vanderburgh a ca580702 es march 17 1982
10 10 am 1083 5 3192 3192 5 3192 3192
5 3192 3192 5 3192 407 6 3192 3192 6
3192 3193 6 3192 730 6 3192 
# 3193
work is in progress on a formula code techniqu allow
direct entri into the comput of formula type on an
84 charact flexo writer thi flexo writer will be modifi
for automat half line advanc and retract without carriag return
to permit complet gener sub and superscript cacm juli 1958
ca580703 es march 17 1982 10 10 am 3193 4
3193 796 4 3193 1083 5 3193 491 5 3193
3193 5 3193 3193 5 3193 3193 5 3193 407
6 3193 3192 6 3193 3193 6 3193 730 6
3193 
# 3194
a non heurist program for prove elementari logic theorem the
paper discuss problem involv in design a devic capabl of
distinguish among speech event that ar normal recogn as differ
by nativ speaker of a particular languag parallel between these
problem and those of chemic analysi ar point out cacm
januari 1959 dunham b fridshal r sward g l ca590102
es march 17 1982 10 10 am 204 5 3194
3194 5 3194 3194 5 3194 3194 5 3194 3194
6 3194 
# 3195
reiter of acm polici toward standard the period chang in
offic chairman and editor which usual follow as elect occasion
result in a chang in polici in the case of
thi depart there is no radic chang but thi is
nevertheless the proper time to reiter an underlin acm s
polici with respect to standard in the comput area cacm
novemb 1962 gorn s ca621123 es march 17 1982 10
10 am 3195 5 3195 3195 5 3195 3195 5
3195 690 5 3195 890 6 3195 929 6 3195
3195 6 3195 
# 3196
the reactiv typewrit program 84 charact keyboard includ alphabet upper
and lower case for good readabl if the machin is
restrict to onli a singl case the lower case is
prefer the reactiv typewrit should be portabl the reactiv typewrit
should oper over ani commerci us dial type telephon voic
or telegraph telex line or over leas nondial telegraph line
interchang cacm januari 1963 mooer c n ca630118 es march
17 1982 10 10 am 1071 5 3196 3196 5
3196 3196 5 3196 3196 5 3196 3196 6 3196
# 3197
structur of standard process organ in the comput area in
line with the acm s polici statement comm acm 5
nov 1962 547 549 the follow organiz descript have been
provid in order to describ standard activ pertin to comput
and inform process cacm june 1966 gorn s bemer r
w green j ca630626 es march 17 1982 10 10
am 3197 5 3197 3197 5 3197 3197 5 3197
689 5 3197 217 6 3197 323 6 3197 3197
6 3197 
# 3198
microprogram emul and program languag the problem we have been
concern with is that of convert languag to action or
intellectu energi to mechan energi the medium that we us
for thi purpos is languag and therefor we ar preoccupi
with the subject of languag in the area of languag
investig we have concentr first on formal syntax and then
on semant cacm march 1966 greem j ca660318 es march
17 1982 10 10 am 1542 5 3198 3198 5
3198 3198 5 3198 3198 5 3198 1491 6 3198
3198 6 3198 
# 3199
algem an algebra manipul algem is a packag of subprogram
written in slip fortran iv and map 7094 ii to
manipul algebra express algem s basic algebra oper ar addit
subtract multipl divis and exponenti it is capabl of handl
ani number of singl letter variabl variabl expon and of
find the highest common factor of two polynomi also includ
ar such function as substitut differenti determin coeffici of specifi
variabl solv a linear equat basic i o routin plu
other special purpos and arithmet routin the major innov of
algem over other manipul is the assign of type to
all express and the us of a standard order procedur
cacm august 1966 gotlieb c c novak r j ca660813
es march 17 1982 10 10 am 1396 5 3199
3199 5 3199 3199 5 3199 3199 5 3199 964
6 3199 1028 6 3199 1029 6 3199 1083 6
3199 1132 6 3199 1214 6 3199 1278 6 3199
1334 6 3199 1365 6 3199 1386 6 3199 1387
6 3199 1388 6 3199 1392 6 3199 1393 6
3199 1394 6 3199 1395 6 3199 1396 6 3199
1397 6 3199 1496 6 3199 284 6 3199 407
6 3199 3199 6 3199 3200 6 3199 3201 6
3199 3202 6 3199 3203 6 3199 3204 6 3199
561 6 3199 730 6 3199 
# 3200
a formac program for the solut of linear boundari and
initi valu problem a comput program is describ which ha
been develop for obtain approxim solut to linear initi and
boundari valu problem involv differenti equat for each problem input
to the program includ 1 the equat in symbol form
to be satisfi the differenti equat equat describ auxiliari condit
such as boundari condit etc 2 a numer descript of
the region in which each of the equat ar to
be satisfi 3 set of function in symbol form to
be us in linear combin to approxim the solut function
give the abov input the program gener an approxim to
the solut of the specifi problemm in term of the
specifi function which is optimum in the least squar sens
cacm august 1966 cuthil e ca660814 es march 17 1982
10 10 am 1396 5 3200 3200 5 3200 3200
5 3200 3200 5 3200 964 6 3200 1028 6
3200 1029 6 3200 1083 6 3200 1132 6 3200
1214 6 3200 1278 6 3200 1334 6 3200 1365
6 3200 1386 6 3200 1387 6 3200 1388 6
3200 1392 6 3200 1393 6 3200 1394 6 3200
1395 6 3200 1396 6 3200 1397 6 3200 1496
6 3200 284 6 3200 407 6 3200 3199 6
3200 3200 6 3200 3201 6 3200 3202 6 3200
3203 6 3200 3204 6 3200 561 6 3200 730
6 3200 
# 3201
symbol manipul of poisson seri poisson seri of three variabl
ar manag symbol through as a set of formal subroutin
written partial in the ibm 7094 machin languag but to
be call in the fortran languag for us in fortran
program an effort ha been made to suppli those oper
which ar most requir by celesti mechan the routin ar
entir self contain subroutin and requir onli standard fortran input
output unit 5 and 6 thei ar design to avoid
wast and overflow of core storag space cacm august 1966
danbi j deprit a rom a ca660815 es march 17
1982 10 10 am 1396 5 3201 3201 5 3201
3201 5 3201 3201 5 3201 964 6 3201 1028
6 3201 1029 6 3201 1083 6 3201 1132 6
3201 1214 6 3201 1278 6 3201 1334 6 3201
1365 6 3201 1386 6 3201 1387 6 3201 1388
6 3201 1392 6 3201 1393 6 3201 1394 6
3201 1395 6 3201 1396 6 3201 1397 6 3201
1496 6 3201 284 6 3201 407 6 3201 3199
6 3201 3200 6 3201 3201 6 3201 3202 6
3201 3203 6 3201 3204 6 3201 561 6 3201
730 6 3201 
# 3202
manip a comput system for algebra and analyt differenti a
mathemat express to be oper upon is written in fortran
like notat and store in the comput as a string
of bcd charact with all blank remov it mai be
as complic as desir parenthes nest without restrict etc so
long as the entir express or ani subsequ form doe
not exce 5000 charact the problemm of perform algebra oper
and obtain analyt deriv wa translat into that of identifi
and manipul charact sequenc program which result were written in
fortran iv for a cdc 3600 and ar discuss in
detail cacm august 1966 bender b ca660816 es march 17
1982 10 10 am 1396 5 3202 3202 5 3202
3202 5 3202 3202 5 3202 964 6 3202 1028
6 3202 1029 6 3202 1083 6 3202 1132 6
3202 1214 6 3202 1278 6 3202 1334 6 3202
1365 6 3202 1386 6 3202 1387 6 3202 1388
6 3202 1392 6 3202 1393 6 3202 1394 6
3202 1395 6 3202 1396 6 3202 1397 6 3202
1496 6 3202 284 6 3202 407 6 3202 3199
6 3202 3200 6 3202 3201 6 3202 3202 6
3202 3203 6 3202 3204 6 3202 561 6 3202
730 6 3202 
# 3203
grad assist a program for symbol algebra manipul and differenti
the gener recurs algebra and differenti assist grad assist now
under develop is a set of lisp function which symbol
manipul abd differenti algebra express it is design for us
with problemm in which a larg amount of routin manipul
is to be done by a program without human intervent
thu grad must recogn necessari simplif without extern guidanc while
some complic express notabl on involv nest radic and trigonometr
function do not yield complet to the present version it
ha prove quit us inde cacm august 1966 fletcher j
g ca660817 es march 17 1982 10 10 am 1396
5 3203 3203 5 3203 3203 5 3203 3203 5
3203 964 6 3203 1028 6 3203 1029 6 3203
1083 6 3203 1132 6 3203 1214 6 3203 1278
6 3203 1334 6 3203 1365 6 3203 1386 6
3203 1387 6 3203 1388 6 3203 1392 6 3203
1393 6 3203 1394 6 3203 1395 6 3203 1396
6 3203 1397 6 3203 1496 6 3203 284 6
3203 407 6 3203 3199 6 3203 3200 6 3203
3201 6 3203 3202 6 3203 3203 6 3203 3204
6 3203 561 6 3203 730 6 3203 
# 3204
an on line program for non numer algebra the goal
of thi program is to make a step toward te
design of an autom mathemat assist some requir for such
a program ar it must be easi to access and
that the result must be obtain in a reason short
time accordingli the program is written for a time share
comput the q 32 comput as system develop corpor santa
monica california wa chosen becaus it also had a lisp
1 5 compil program and debug wa done from a
remot teletyp consol at stanford univers cacm august 1966 korsvold
k ca660818 es march 17 1982 10 10 am 1396
5 3204 3204 5 3204 3204 5 3204 3204 5
3204 964 6 3204 1028 6 3204 1029 6 3204
1083 6 3204 1132 6 3204 1214 6 3204 1278
6 3204 1334 6 3204 1365 6 3204 1386 6
3204 1387 6 3204 1388 6 3204 1392 6 3204
1393 6 3204 1394 6 3204 1395 6 3204 1396
6 3204 1397 6 3204 1496 6 3204 284 6
3204 407 6 3204 3199 6 3204 3200 6 3204
3201 6 3204 3202 6 3204 3203 6 3204 3204
6 3204 561 6 3204 730 6 3204