1 %%% ==================================================================== 2 %%% BibTeX-file{ 3 %%% author = "Nelson H. F. Beebe", 4 %%% version = "2.09", 5 %%% date = "26 March 1997", 6 %%% time = "08:21:19 MST", 7 %%% filename = "cacm1970.bib", 8 %%% address = "Center for Scientific Computing 9 %%% Department of Mathematics 10 %%% University of Utah 11 %%% Salt Lake City, UT 84112 12 %%% USA", 13 %%% telephone = "+1 801 581 5254", 14 %%% FAX = "+1 801 581 4148", 15 %%% checksum = "50673 40670 196033 1787829", 16 %%% email = "beebe at math.utah.edu (Internet)", 17 %%% codetable = "ISO/ASCII", 18 %%% keywords = "bibliography, CACM, Communications of the 19 %%% ACM", 20 %%% supported = "yes", 21 %%% docstring = "This is a bibliography of the journal 22 %%% Communications of the ACM, covering 23 %%% (incompletely) 1970 -- 1979. 24 %%% 25 %%% At version 2.09, the year coverage looked 26 %%% like this: 27 %%% 28 %%% 1961 ( 1) 1972 (168) 1983 ( 0) 29 %%% 1962 ( 1) 1973 (158) 1984 ( 0) 30 %%% 1963 ( 2) 1974 (127) 1985 ( 2) 31 %%% 1964 ( 2) 1975 (107) 1986 ( 0) 32 %%% 1965 ( 1) 1976 ( 97) 1987 ( 0) 33 %%% 1966 ( 2) 1977 (117) 1988 ( 0) 34 %%% 1967 ( 1) 1978 (118) 1989 ( 0) 35 %%% 1968 ( 1) 1979 ( 78) 1990 ( 2) 36 %%% 1969 ( 3) 1980 ( 1) 1991 ( 4) 37 %%% 1970 (157) 1981 ( 2) 1992 ( 1) 38 %%% 1971 (104) 1982 ( 1) 39 %%% 40 %%% Article: 1252 41 %%% Book: 2 42 %%% InProceedings: 1 43 %%% Manual: 1 44 %%% MastersThesis: 1 45 %%% PhdThesis: 1 46 %%% 47 %%% Total entries: 1258 48 %%% 49 %%% The size of the original cacm.bib file 50 %%% covering 1958--1996 became too large (about 51 %%% 4000 entries) for BibTeX and TeX to handle, 52 %%% so at version 1.44, it was split into 53 %%% cacm1950.bib, cacm1960.bib, cacm1970.bib, 54 %%% cacm1980.bib, and cacm1990.bib, each covering 55 %%% the decade starting with the year embedded in 56 %%% the filename. Version numbers for these 57 %%% files begin at 2.00. 58 %%% 59 %%% Volumes from the 1990s average more than 200 60 %%% articles yearly, so a complete bibliography 61 %%% for this journal could contain more than 6000 62 %%% entries from 1958 to 2000. 63 %%% 64 %%% These bibliographies also include ACM 65 %%% Algorithms 1--492. For Algorithms 493--686, 66 %%% including Algorithm 568, published in ACM 67 %%% Transactions on Programming Languages and 68 %%% Systems (TOPLAS), see the companion 69 %%% bibliographies, toms.bib and toplas.bib. 70 %%% 71 %%% All published Remarks and Corrigenda are 72 %%% cross-referenced in both directions, so 73 %%% that citing a paper will automatically 74 %%% generate citations for those Remarks and 75 %%% Corrigenda. Cross-referenced entries are 76 %%% duplicated in cacm19*.bib and toms.bib, so 77 %%% that each is completely self-contained. 78 %%% 79 %%% Source code for ACM Algorithms from 380 80 %%% onwards, with some omissions, is available 81 %%% via the Netlib service at 82 %%% http://netlib.ornl.gov/, and 83 %%% ftp://netlib.bell-labs.com/netlib/toms. 84 %%% 85 %%% There is a World Wide Web search facility 86 %%% for articles published in this journal from 87 %%% 1959 to 1979 at 88 %%% http://ciir.cs.umass.edu/cgi-bin/web_query_form/public/cacm2.1. 89 %%% 90 %%% The initial draft of entries for 1981 -- 91 %%% 1990 was extracted from the ACM Computing 92 %%% Archive CD ROM for the 1980s, with manual 93 %%% corrections and additions. Additions were 94 %%% then made from all of the bibliographies in 95 %%% the TeX User Group collection, from 96 %%% bibliographies in the author's personal 97 %%% files, from the Compendex database 98 %%% (1970--1979), from the IEEE INSPEC database 99 %%% (1970--1979), from tables of contents 100 %%% information at http://www.acm.org/pubs/cacm/, 101 %%% from Zentralblatt fur Mathematik Mathematics 102 %%% Abstracts at 103 %%% http://www.emis.de/cgi-bin/MATH/, from 104 %%% bibliographies at Internet host 105 %%% netlib.bell-labs.com, and from the computer 106 %%% science bibliography collection on 107 %%% ftp.ira.uka.de in /pub/bibliography to which 108 %%% many people of have contributed. The 109 %%% snapshot of this collection was taken on 110 %%% 5-May-1994, and it consists of 441 BibTeX 111 %%% files, 2,672,675 lines, 205,289 entries, and 112 %%% 6,375 <at>String{} abbreviations, occupying 113 %%% 94.8MB of disk space. 114 %%% 115 %%% Numerous errors in the sources noted above 116 %%% have been corrected. Spelling has been 117 %%% verified with the UNIX spell and GNU ispell 118 %%% programs using the exception dictionary 119 %%% stored in the companion file with extension 120 %%% .sok. 121 %%% 122 %%% BibTeX citation tags are uniformly chosen 123 %%% as name:year:abbrev, where name is the 124 %%% family name of the first author or editor, 125 %%% year is a 4-digit number, and abbrev is a 126 %%% 3-letter condensation of important title 127 %%% words. Citation tags were automatically 128 %%% generated by software developed for the 129 %%% BibNet Project. 130 %%% 131 %%% In this bibliography, entries are sorted in 132 %%% publication order within each journal, 133 %%% using bibsort -byvolume. 134 %%% 135 %%% The checksum field above contains a CRC-16 136 %%% checksum as the first value, followed by the 137 %%% equivalent of the standard UNIX wc (word 138 %%% count) utility output of lines, words, and 139 %%% characters. This is produced by Robert 140 %%% Solovay's checksum utility.", 141 %%% } 142 %%% ==================================================================== 143 144 @Preamble{"\input bibnames.sty " # "\input path.sty " # "\def \TM {${}^{\sc TM}$} " # "\hyphenation{ al-pha-mer-ic Balz-er Blom-quist Bo-ta-fo-go Bran-din Brans-comb Bu-tera Chris-tina Christ-o-fi-des Col-lins Cor-dell data-base econ-omies Fletch-er flow-chart flow-charts Fry-styk ge-dank-en Gar-fink-el Ge-ha-ni Glush-ko Goud-reau Gua-dan-go Hari-di Haw-thorn Hem-men-ding-er Hor-o-witz Hour-vitz Hirsch-berg Ike-da Ka-chi-tvi-chyan-u-kul Kat-ze-nel-son Kitz-miller Ko-ba-yashi Le-Me-tay-er Ken-ne-dy Law-rence Mac-kay Mai-net-ti Mar-sa-glia Max-well Mer-ner Mo-ran-di Na-ray-an New-ell Nich-ols para-digm pat-ent-ed Phi-lo-kyp-rou Prep-a-ra-ta pseu-do-chain-ing QUIK-SCRIPT Rad-e-mach-er re-eval-u-a-tion re-wind Ros-witha Scheu-er-mann Schwach-heim Schob-bens Schon-berg Sho-sha-ni Si-tha-ra-ma Skwa-rec-ki Streck-er Strin-gi-ni Tes-ler Te-zu-ka Teu-ho-la Till-quist Town-send Tsi-chri-tzis Tur-ski Vuille-min Wald-ing-er Za-bo-row-ski Za-mora }"} 145 146 %======================================================================= 147 % Acknowledgement abbreviations: 148 149 @String{ack-nhfb = "Nelson H. F. Beebe, Center for Scientific Computing, Department of Mathematics, University of Utah, Salt Lake City, UT 84112, USA, Tel: +1 801 581 5254, FAX: +1 801 581 4148, e-mail: \path|beebe (a] math.utah.edu|"} 150 151 @String{ack-nj = "Norbert Juffa, 2445 Mission College Blvd. Santa Clara, CA 95054 USA email: \path=norbert (a] iit.com="} 152 153 %======================================================================= 154 % Journal abbreviations: 155 156 @String{j-CACM = "Communications of the ACM"} 157 158 @String{j-COMP-SURV = "Computing Surveys"} 159 160 @String{j-J-ACM = "Journal of the ACM"} 161 162 @String{j-MANAGEMENT-SCIENCE = "Management Science"} 163 164 @String{j-SIAM-J-COMPUT = "SIAM Journal of Computing"} 165 166 @String{j-SPE = "Software --- Practice and Experience"} 167 168 @String{j-TOMS = "ACM Transactions on Mathematical Software"} 169 170 %======================================================================= 171 % Publisher abbreviations: 172 173 @String{pub-ANSI = "American National Standards Institute"} 174 175 @String{pub-ANSI:adr = "1430 Broadway, New York, NY 10018, USA"} 176 177 @String{pub-AW = "Ad{\-d}i{\-s}on-Wes{\-l}ey"} 178 179 @String{pub-AW:adr = "Reading, MA, USA"} 180 181 @String{pub-SUCSLI = "Stanford University Center for the Study of Language and Information"} 182 183 @String{pub-SUCSLI:adr = "Stanford, CA, USA"} 184 185 @String{pub-SV = "Spring{\-}er-Ver{\-}lag"} 186 187 @String{pub-SV:adr = "Berlin, Germany~/ Heidelberg, Germany~/ London, UK~/ etc."} 188 189 %======================================================================= 190 % Bibliography entries (cross-references in notes necessitate 191 % inclusion of a few additional entries published elsewhere): 192 193 @Article{Herndon:1961:AAS, 194 author = "J. R. Herndon", 195 title = "{ACM} Algorithm 49: Spherical {Neumann} Function", 196 journal = j-CACM, 197 volume = "4", 198 number = "4", 199 pages = "179", 200 month = apr, 201 year = "1961", 202 CODEN = "CACMA2", 203 ISSN = "0001-0782", 204 bibdate = "Thu Sep 08 09:47:50 1994", 205 note = "See also \cite{Coleman:1978:RAS}.", 206 } 207 208 @Article{Merner:1962:AAC, 209 author = "J. N. Merner", 210 title = "{ACM} Algorithm 149: Complete Elliptic Integral", 211 journal = j-CACM, 212 volume = "5", 213 number = "12", 214 pages = "605", 215 month = dec, 216 year = "1962", 217 CODEN = "CACMA2", 218 ISSN = "0001-0782", 219 bibdate = "Thu Sep 08 09:47:50 1994", 220 note = "See also \cite{Skovgaard:1978:RCE}.", 221 } 222 223 @Article{Ludwig:1963:AAI, 224 author = "O. G. Ludwig", 225 title = "{ACM} Algorithm 179: Incomplete Beta Ratio", 226 journal = j-CACM, 227 volume = "6", 228 number = "6", 229 pages = "314", 230 month = jun, 231 year = "1963", 232 CODEN = "CACMA2", 233 ISSN = "0001-0782", 234 bibdate = "Thu Sep 08 09:47:50 1994", 235 note = "See also \cite{Pike:1976:RIB}.", 236 } 237 238 @Article{Kase:1963:AAT, 239 author = "R. H. Kase", 240 title = "{ACM} Algorithm 219: Topological Ordering for {Pert} Networks", 241 journal = j-CACM, 242 volume = "6", 243 number = "12", 244 pages = "738--739", 245 month = dec, 246 year = "1963", 247 CODEN = "CACMA2", 248 ISSN = "0001-0782", 249 bibdate = "Thu Sep 08 09:47:51 1994", 250 note = "See also \cite{Tenney:1977:RAT}.", 251 } 252 253 @Article{Gautschi:1964:AAB, 254 author = "W. Gautschi", 255 title = "{ACM} Algorithm 236: {Bessel} Functions of the First Kind", 256 journal = j-CACM, 257 volume = "7", 258 number = "8", 259 pages = "479--480", 260 month = aug, 261 year = "1964", 262 CODEN = "CACMA2", 263 ISSN = "0001-0782", 264 bibdate = "Thu Sep 08 09:47:54 1994", 265 note = "See also \cite{Skovgaard:1975:RBF}.", 266 } 267 268 @Article{Boothroyd:1964:AAG, 269 author = "J. Boothroyd", 270 title = "{ACM} Algorithm 246: Graycode", 271 journal = j-CACM, 272 volume = "7", 273 number = "12", 274 pages = "701", 275 month = dec, 276 year = "1964", 277 CODEN = "CACMA2", 278 ISSN = "0001-0782", 279 bibdate = "Thu Sep 08 09:47:54 1994", 280 note = "See also \cite{Misra:1975:RG,Er:1985:RG}.", 281 } 282 283 @Article{Gautschi:1965:AAL, 284 author = "W. Gautschi", 285 title = "{ACM} Algorithm 259: {Legendre} Functions for Arguments Larger than One", 286 journal = j-CACM, 287 volume = "8", 288 number = "8", 289 pages = "488--492", 290 month = aug, 291 year = "1965", 292 CODEN = "CACMA2", 293 ISSN = "0001-0782", 294 bibdate = "Thu Sep 08 09:47:54 1994", 295 note = "See also \cite{Jansen:1977:RLF}.", 296 } 297 298 @Article{Fletcher:1966:AAI, 299 author = "W. Fletcher", 300 title = "{ACM} Algorithm 284: Interchange of Two Blocks of Data", 301 journal = j-CACM, 302 volume = "9", 303 number = "5", 304 pages = "326", 305 month = may, 306 year = "1966", 307 CODEN = "CACMA2", 308 ISSN = "0001-0782", 309 bibdate = "Thu Sep 08 09:47:54 1994", 310 note = "See also \cite{Ito:1976:RIT}.", 311 } 312 313 @Article{Hill:1967:AAC, 314 author = "I. D. Hill and M. C. Pike", 315 title = "{ACM} Algorithm 299: Chi-Squared Integral", 316 journal = j-CACM, 317 volume = "10", 318 number = "4", 319 pages = "243--244", 320 month = apr, 321 year = "1967", 322 CODEN = "CACMA2", 323 ISSN = "0001-0782", 324 bibdate = "Thu Sep 08 09:47:54 1994", 325 note = "See also \cite{Lozy:1976:RCS,Hill:1985:RCS}.", 326 } 327 328 @Article{Dijkstra:1968:GSC, 329 author = "Edsger Wybe Dijkstra", 330 title = "Go to statement considered harmful", 331 journal = j-CACM, 332 volume = "11", 333 number = "3", 334 pages = "147--148", 335 month = mar, 336 year = "1968", 337 CODEN = "CACMA2", 338 ISSN = "0001-0782", 339 note = "This paper inspired scores of others, published mainly in SIGPLAN Notices up to the mid-1980s. The best-known is \cite{Knuth:1974:SPG}.", 340 } 341 342 @Article{ANSI:1969:CFS, 343 author = "{ANSI Subcommittee X3J3}", 344 title = "Clarification of {Fortran} Standards --- Initial Progress", 345 journal = j-CACM, 346 volume = "12", 347 number = "5", 348 pages = "289--294", 349 month = may, 350 year = "1969", 351 CODEN = "CACMA2", 352 ISSN = "0001-0782", 353 bibdate = "Mon Aug 29 18:26:25 1994", 354 note = "See also \cite{ANSI:1966:AF}.", 355 acknowledgement = ack-nhfb, 356 } 357 358 @Article{Wirth:1969:MMC, 359 author = "N. Wirth", 360 title = "On Multiprogramming, Machine Coding, and Computer Organization", 361 journal = j-CACM, 362 volume = "12", 363 number = "9", 364 pages = "489--498", 365 month = sep, 366 year = "1969", 367 CODEN = "CACMA2", 368 ISSN = "0001-0782", 369 bibdate = "Fri Jan 17 18:23:22 1997", 370 note = "See corrigendum \cite{Wirth:1970:CMM}.", 371 } 372 373 @Article{Lum:1970:MAR, 374 author = "V. Y. Lum", 375 title = "Multi-Attribute Retrieval with Combined Indexes", 376 journal = j-CACM, 377 volume = "1", 378 number = "11", 379 pages = "660--665", 380 month = nov, 381 year = "1970", 382 CODEN = "CACMA2", 383 ISSN = "0001-0782", 384 bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib", 385 annote = "Construction of combined indexes with formulas for number needed.", 386 } 387 388 @Article{Lowe:1970:ASC, 389 author = "T. C. Lowe", 390 title = "Automatic segmentation of cyclic program structures based on connectivity and processor timing", 391 journal = j-CACM, 392 volume = "13", 393 number = "1", 394 pages = "3--6", 395 month = jan, 396 year = "1970", 397 CODEN = "CACMA2", 398 ISSN = "0001-0782", 399 bibdate = "Tue Mar 25 13:26:09 MST 1997", 400 acknowledgement = ack-nhfb, 401 classcodes = "C6150C (Compilers, interpreters and other processors)", 402 corpsource = "Informatics Inc., Bethesda, MD, USA", 403 keywords = "input-output programs; multiprogramming; program processors; time-sharing programs", 404 } 405 406 @Article{Gautschi:1970:RCC, 407 author = "Walter Gautschi and Bruce J. Klein", 408 title = "Recursive computation of certain derivatives --- {A} study of error propagation", 409 journal = j-CACM, 410 volume = "13", 411 number = "1", 412 pages = "7--9", 413 month = jan, 414 year = "1970", 415 CODEN = "CACMA2", 416 ISSN = "0001-0782", 417 MRclass = "65Q05", 418 MRnumber = "46 1115", 419 mrreviewer = "D. F. Mayers", 420 bibdate = "Tue Mar 25 13:26:09 MST 1997", 421 abstract = "A brief study is made of the propagation of errors in linear first-order difference equations. The recursive computation of successive derivatives of $(e^x)/x$ and $(\cos x)/x$ is considered as an illustration.", 422 acknowledgement = ack-nhfb, 423 classcodes = "C4110 (Error analysis in numerical methods)", 424 corpsource = "Purdue Univ., Lafayette, IN, USA", 425 keywords = "difference equations; error analysis; error propagation; recursive computation; successive derivatives", 426 } 427 428 @Article{Mullery:1970:PAM, 429 author = "A. P. Mullery and G. C. Driscoll", 430 title = "A processor allocation method for time-sharing", 431 journal = j-CACM, 432 volume = "13", 433 number = "1", 434 pages = "10--14", 435 month = jan, 436 year = "1970", 437 CODEN = "CACMA2", 438 ISSN = "0001-0782", 439 bibdate = "Tue Mar 25 13:26:09 MST 1997", 440 acknowledgement = ack-nhfb, 441 classcodes = "C6150J (Operating systems)", 442 corpsource = "IBM, Thomas J. Watson Res. Center Yorktown Heights, NY, USA", 443 keywords = "storage allocation; time-sharing programs", 444 } 445 446 @Article{Simmons:1970:NLQ, 447 author = "R. F. Simmons", 448 title = "Natural Language Question-Answering Systems: 1969", 449 journal = j-CACM, 450 volume = "13", 451 number = "1", 452 pages = "15--30", 453 month = jan, 454 year = "1970", 455 CODEN = "CACMA2", 456 ISSN = "0001-0782", 457 bibdate = "Tue Mar 25 13:26:09 MST 1997", 458 bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib", 459 acknowledgement = ack-nhfb, 460 classcodes = "C7820 (Humanities computing)", 461 corpsource = "Univ. Texas, Austin, TX, USA", 462 keywords = "artificial intelligence; computational linguistics; language; translation and linguistics", 463 } 464 465 @Article{Irons:1970:EEL, 466 author = "E. T. Irons", 467 title = "Experience with an extensible language", 468 journal = j-CACM, 469 volume = "13", 470 number = "1", 471 pages = "31--40", 472 month = jan, 473 year = "1970", 474 CODEN = "CACMA2", 475 ISSN = "0001-0782", 476 bibdate = "Tue Mar 25 13:26:09 MST 1997", 477 acknowledgement = ack-nhfb, 478 classcodes = "C6140D (High level languages)", 479 corpsource = "Inst. Defense Analyses Princeton, NJ, USA", 480 keywords = "procedure oriented languages", 481 } 482 483 @Article{Montanari:1970:NML, 484 author = "U. Montanari", 485 title = "A note on minimal length polygonal approximation to a digitized contour", 486 journal = j-CACM, 487 volume = "13", 488 number = "1", 489 pages = "41--47", 490 month = jan, 491 year = "1970", 492 CODEN = "CACMA2", 493 ISSN = "0001-0782", 494 MRclass = "65.20", 495 MRnumber = "44\#2311", 496 bibdate = "Tue Mar 25 13:26:09 MST 1997", 497 abstract = "A method for extracting a smooth polygonal contour from a digitized image is illustrated. The ordered sequence of contour points and the connection graph of the image are first obtained by a modified Ledley algorithm in one image scan. A minimal perimeter polygon subjected to specified constraints is then chosen as the approximating contour. The determination of the minimal polygon can be reduced to a nonlinear programming problem, solved by an algorithm which takes into account the weak bonds between variables. Some examples are presented, and the corresponding computing times are listed.", 498 acknowledgement = ack-nhfb, 499 classcodes = "B6140C (Optical information, image and video signal processing); C1250 (Pattern recognition)", 500 corpsource = "Consiglio Nazionale delle Richerche, Pisa, Italy", 501 keywords = "connection tree; digitized image; minimal polygon; nonlinear programming; optimal approximation; pattern recognition", 502 } 503 504 @Article{Stehfest:1970:AAN, 505 author = "Harald Stehfest", 506 title = "{ACM} Algorithm 368: Numerical Inversion of {Laplace} Transforms", 507 journal = j-CACM, 508 volume = "13", 509 number = "1", 510 pages = "47--49", 511 month = jan, 512 year = "1970", 513 CODEN = "CACMA2", 514 ISSN = "0001-0782", 515 bibdate = "Tue Mar 25 13:26:09 MST 1997", 516 acknowledgement = ack-nhfb, 517 classcodes = "C7300 (Natural sciences computing)", 518 corpsource = "J. W. Goethe Univ. Frankfurt am Main, West Germany", 519 keywords = "Laplace transforms; subroutines", 520 } 521 522 @Article{Schaffer:1970:AAG, 523 author = "H. E. Schaffer", 524 title = "{ACM} Algorithm 369: Generator of Random Numbers Satisfying the {Poisson} Distribution", 525 journal = j-CACM, 526 volume = "13", 527 number = "1", 528 pages = "49--49", 529 month = jan, 530 year = "1970", 531 CODEN = "CACMA2", 532 ISSN = "0001-0782", 533 bibdate = "Tue Mar 25 13:26:09 MST 1997", 534 acknowledgement = ack-nhfb, 535 classcodes = "C7890 (Other special applications of computing)", 536 corpsource = "North Carolina State Univ., Raleigh, NC, USA", 537 keywords = "random number generation; subroutines", 538 } 539 540 @Article{Butler:1970:AAG, 541 author = "E. L. Butler", 542 title = "{ACM} Algorithm 370: General Random Number Generator", 543 journal = j-CACM, 544 volume = "13", 545 number = "1", 546 pages = "49--52", 547 month = jan, 548 year = "1970", 549 CODEN = "CACMA2", 550 ISSN = "0001-0782", 551 bibdate = "Tue Mar 25 13:26:09 MST 1997", 552 acknowledgement = ack-nhfb, 553 classcodes = "C7890 (Other special applications of computing)", 554 corpsource = "Texas A and M Univ., College Station, TX, USA", 555 keywords = "random number generation; subroutines", 556 } 557 558 @Article{McKay:1970:AAP, 559 author = "J. K. S. McKay", 560 title = "{ACM} Algorithm 371: Partitions in Natural Order", 561 journal = j-CACM, 562 volume = "13", 563 number = "1", 564 pages = "52--52", 565 month = jan, 566 year = "1970", 567 CODEN = "CACMA2", 568 ISSN = "0001-0782", 569 bibdate = "Tue Mar 25 13:26:09 MST 1997", 570 acknowledgement = ack-nhfb, 571 classcodes = "C7300 (Natural sciences computing)", 572 corpsource = "California Inst. Technol. Pasadena, CA, USA", 573 keywords = "number theory; subroutines", 574 } 575 576 @Article{Dunham:1970:AAA, 577 author = "K. B. Dunham", 578 title = "{ACM} Algorithm 372: An Algorithm to Produce Complex Primes {CSIEVE}", 579 journal = j-CACM, 580 volume = "13", 581 number = "1", 582 pages = "52--54", 583 month = jan, 584 year = "1970", 585 CODEN = "CACMA2", 586 ISSN = "0001-0782", 587 bibdate = "Tue Mar 25 13:26:09 MST 1997", 588 acknowledgement = ack-nhfb, 589 classcodes = "C7300 (Natural sciences computing)", 590 corpsource = "Georgia Inst. Technol., Atlanta, GA, USA", 591 keywords = "number theory; subroutines", 592 } 593 594 @Article{Griffin:1970:RME, 595 author = "R. Griffin and K. A. Redich", 596 title = "Remark on {``Algorithm 347 [{M1}]: An Efficient Algorithm for Sorting with Minimal Storage'', by R. C. Singleton}", 597 journal = j-CACM, 598 volume = "13", 599 number = "1", 600 pages = "54--54", 601 month = jan, 602 year = "1970", 603 CODEN = "CACMA2", 604 ISSN = "0001-0782", 605 bibdate = "Fri Jan 17 18:26:41 1997", 606 keywords = "digital computer sorting; minimal storage sorting; sorting", 607 } 608 609 @Article{Anonymous:1970:RCD, 610 author = "Anonymous", 611 title = "Representation for calendar date for machine-to-machine data interchange", 612 journal = j-CACM, 613 volume = "13", 614 number = "1", 615 pages = "55--55", 616 month = jan, 617 year = "1970", 618 CODEN = "CACMA2", 619 ISSN = "0001-0782", 620 bibdate = "Tue Mar 25 13:26:09 MST 1997", 621 acknowledgement = ack-nhfb, 622 classcodes = "C6130 (Data handling techniques)", 623 keywords = "codes; standards", 624 } 625 626 @Article{Anonymous:1970:IRP, 627 author = "Anonymous", 628 title = "Interchange rolls of perforated tape for information interchange", 629 journal = j-CACM, 630 volume = "13", 631 number = "1", 632 pages = "56--56", 633 month = jan, 634 year = "1970", 635 CODEN = "CACMA2", 636 ISSN = "0001-0782", 637 bibdate = "Tue Mar 25 13:26:09 MST 1997", 638 acknowledgement = ack-nhfb, 639 classcodes = "C5320Z (Other digital storage); C5560 (Data preparation equipment); C7250 (Information storage and retrieval)", 640 keywords = "digital storage; equipment; information retrieval; punched tape; standards", 641 } 642 643 @Article{Payne:1970:FTP, 644 author = "W. H. Payne", 645 title = "{Fortran Tausworthe} pseudorandom number generator", 646 journal = j-CACM, 647 volume = "13", 648 number = "1", 649 pages = "57--57", 650 month = jan, 651 year = "1970", 652 CODEN = "CACMA2", 653 ISSN = "0001-0782", 654 bibdate = "Tue Mar 25 13:26:09 MST 1997", 655 acknowledgement = ack-nhfb, 656 classcodes = "C7890 (Other special applications of computing)", 657 corpsource = "Washington State Univ. Pullman, WA, USA", 658 keywords = "random number generation", 659 } 660 661 @Article{Hsiao:1970:FSI, 662 author = "David K. Hsiao and Frank D. Harary", 663 title = "A Formal System for Information Retrieval from Files", 664 journal = j-CACM, 665 volume = "13", 666 number = "2", 667 pages = "67--73", 668 month = feb, 669 year = "1970", 670 CODEN = "CACMA2", 671 ISSN = "0001-0782", 672 bibdate = "Tue Mar 25 13:26:09 MST 1997", 673 bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib", 674 note = "See corrigenda \cite{Hsiao:1970:CFS}.", 675 acknowledgement = ack-nhfb, 676 classcodes = "C6120 (File organisation); C7250 (Information storage and retrieval)", 677 corpsource = "Univ. Pennsylvania, Philadelphia, PA, USA", 678 keywords = "file organisation; information retrieval", 679 } 680 681 @Article{vonGlaserfeld:1970:MPH, 682 author = "E. {von Glaserfeld} and P. P. Pisani", 683 title = "The multistore parser for hierarchical syntactic structures", 684 journal = j-CACM, 685 volume = "13", 686 number = "2", 687 pages = "74--82", 688 month = feb, 689 year = "1970", 690 CODEN = "CACMA2", 691 ISSN = "0001-0782", 692 bibdate = "Tue Mar 25 13:26:09 MST 1997", 693 acknowledgement = ack-nhfb, 694 classcodes = "C4210 (Formal logic)", 695 corpsource = "Univ. Georgia, Athens, GA, USA", 696 keywords = "computational linguistics", 697 } 698 699 @Article{Vere:1970:TE, 700 author = "Steven Vere", 701 title = "Translation equations", 702 journal = j-CACM, 703 volume = "13", 704 number = "2", 705 pages = "83--89", 706 month = feb, 707 year = "1970", 708 CODEN = "CACMA2", 709 ISSN = "0001-0782", 710 MRclass = "68A30", 711 MRnumber = "45 4925", 712 mrreviewer = "H. Maurer", 713 bibdate = "Tue Mar 25 13:26:09 MST 1997", 714 note = "See errata \cite{Vere:1970:TEE},", 715 abstract = "Input limited transduction expressions, or translation equations, are used to describe the syntax and left-context sensitive semantics for context-free languages. A formal procedure is given for deriving from a set of translation equations the specifications for a pushdown translator. The translator consists of Mealy form finite-state automata interacting by means of a pushdown stack. Within the framework described string recognition and parsing may be treated as special cases of the translation problem.", 716 acknowledgement = ack-nhfb, 717 classcodes = "C4210 (Formal logic)", 718 corpsource = "Univ. California, Los Angeles, CA, USA", 719 keywords = "automata; computational linguistics; context-free languages; finite state automata; formal languages; meta-compilers; parsing; pushdown transducer; recognizers; regular expression; syntax directed compilers; transduction expression; translation; Turing machines", 720 } 721 722 @Article{Morgan:1970:SCSa, 723 author = "H. L. Morgan", 724 title = "Spelling correction in systems programs", 725 journal = j-CACM, 726 volume = "13", 727 number = "2", 728 pages = "90--94", 729 month = feb, 730 year = "1970", 731 CODEN = "CACMA2", 732 ISSN = "0001-0782", 733 bibdate = "Tue Mar 25 13:26:09 MST 1997", 734 acknowledgement = ack-nhfb, 735 classcodes = "C6150G (Diagnostic, testing, debugging and evaluating systems)", 736 corpsource = "Cornell Univ., Ithaca, NY, USA", 737 keywords = "program debugging; subroutines", 738 xxnote = "Check issue number: 2 or 3??", 739 } 740 741 @Article{Earley:1970:ECF, 742 author = "J. Earley", 743 title = "An Efficient Context-Free Parsing Algorithm", 744 journal = j-CACM, 745 volume = "13", 746 number = "2", 747 pages = "94--102", 748 month = feb, 749 year = "1970", 750 CODEN = "CACMA2", 751 ISSN = "0001-0782", 752 bibdate = "Tue Mar 25 13:26:09 MST 1997", 753 bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Parallel/Multi.bib", 754 abstract = "A parsing algorithm which seems to be the most efficient general context-free algorithm known is described. It is similar to both Knuth's LR(k) algorithm and the familiar top-down algorithm. It has a time bound proportional to $n^3$ (where $n$ is the length of the string being parsed) in general; it has a $n^2$ bound for unambiguous grammars; and it runs in linear time on a large class of grammars, which seems to include most practical context-free programming language grammars. In an empirical comparison it appears to be superior to the top-down and bottom-up algorithms studied by Griffiths and Petrick.", 755 acknowledgement = ack-nhfb, 756 classcodes = "C4210 (Formal logic); C6150C (Compilers, interpreters and other processors)", 757 corpsource = "Univ. California, Berkeley, CA, USA", 758 keywords = "compilers; computational complexity; context-free grammar; parsing; syntax analysis", 759 keywords = "computational linguistics; program compilers", 760 } 761 762 @Article{Radke:1970:UQR, 763 author = "C. E. Radke", 764 title = "The Use of Quadratic Residue Research", 765 journal = j-CACM, 766 volume = "13", 767 number = "2", 768 pages = "103--105", 769 month = feb, 770 year = "1970", 771 CODEN = "CACMA2", 772 ISSN = "0001-0782", 773 bibdate = "Tue Mar 25 13:26:09 MST 1997", 774 acknowledgement = ack-nhfb, 775 classcodes = "C6130 (Data handling techniques)", 776 corpsource = "IBM, Endicott, NY, USA", 777 keywords = "data handling; programming", 778 } 779 780 @Article{Jones:1970:VSA, 781 author = "B. Jones", 782 title = "A Variation on Sorting by Address Calculation", 783 journal = j-CACM, 784 volume = "13", 785 number = "2", 786 pages = "105--107", 787 month = feb, 788 year = "1970", 789 CODEN = "CACMA2", 790 ISSN = "0001-0782", 791 bibdate = "Tue Mar 25 13:26:09 MST 1997", 792 acknowledgement = ack-nhfb, 793 classcodes = "C6130 (Data handling techniques)", 794 corpsource = "Martin Marietta Corp., Orlando, FL, USA", 795 keywords = "sorting", 796 } 797 798 @Article{Bell:1970:QQM, 799 author = "James R. Bell", 800 title = "The Quadratic Quotient Method: {A} Hash Code Eliminating Secondary Clustering", 801 journal = j-CACM, 802 volume = "13", 803 number = "2", 804 pages = "107--109", 805 month = feb, 806 year = "1970", 807 CODEN = "CACMA2", 808 ISSN = "0001-0782", 809 bibdate = "Tue Mar 25 13:26:09 MST 1997", 810 acknowledgement = ack-nhfb, 811 classcodes = "C6130 (Data handling techniques)", 812 corpsource = "Digital Equipment Corp., Maynard, MA, USA", 813 keywords = "table lookup", 814 } 815 816 @Article{Ness:1970:CEG, 817 author = "D. N. Ness and R. S. Green and W. A. Martin and G. A. Moulton", 818 title = "Computer education in a graduate school of management", 819 journal = j-CACM, 820 volume = "13", 821 number = "2", 822 pages = "110--114, 19", 823 month = feb, 824 year = "1970", 825 CODEN = "CACMA2", 826 ISSN = "0001-0782", 827 bibdate = "Tue Mar 25 13:26:09 MST 1997", 828 acknowledgement = ack-nhfb, 829 classcodes = "C0220 (Computing education and training)", 830 corpsource = "M.I.T., Cambridge, MA, USA", 831 keywords = "education; management; simulation", 832 } 833 834 @Article{Robbins:1970:ICS, 835 author = "M. F. Robbins and J. D. Beyer", 836 title = "An interactive computer system using graphical flowchart input", 837 journal = j-CACM, 838 volume = "13", 839 number = "2", 840 pages = "115--119", 841 month = feb, 842 year = "1970", 843 CODEN = "CACMA2", 844 ISSN = "0001-0782", 845 bibdate = "Tue Mar 25 13:26:09 MST 1997", 846 acknowledgement = ack-nhfb, 847 classcodes = "C7400 (Engineering computing); C5540 (Terminals and graphic displays)", 848 corpsource = "Bell Telephone Labs. Inc., Holmdel, NJ, USA", 849 keywords = "applications of computers; computers; control system synthesis; electrical engineering; engineering applications of; online operation; sampled data systems; simulation", 850 } 851 852 @Article{White:1970:AAN, 853 author = "J. S. White", 854 title = "{ACM} Algorithm 373: Number of Doubly Restricted Partitions", 855 journal = j-CACM, 856 volume = "13", 857 number = "2", 858 pages = "120--120", 859 month = feb, 860 year = "1970", 861 CODEN = "CACMA2", 862 ISSN = "0001-0782", 863 bibdate = "Tue Mar 25 13:26:09 MST 1997", 864 acknowledgement = ack-nhfb, 865 classcodes = "C7300 (Natural sciences computing)", 866 corpsource = "Univ. Minnesota, Minneapolis, MN, USA", 867 keywords = "combinatorial mathematics; subroutines", 868 } 869 870 @Article{White:1970:AAR, 871 author = "J. S. White", 872 title = "{ACM} Algorithm 374: Restricted Partition Generator", 873 journal = j-CACM, 874 volume = "13", 875 number = "2", 876 pages = "120--120", 877 month = feb, 878 year = "1970", 879 CODEN = "CACMA2", 880 ISSN = "0001-0782", 881 bibdate = "Tue Mar 25 13:26:09 MST 1997", 882 acknowledgement = ack-nhfb, 883 classcodes = "C7300 (Natural sciences computing)", 884 corpsource = "Univ. Minnesota, Minneapolis, MN, USA", 885 keywords = "combinatorial mathematics; subroutines", 886 } 887 888 @Article{Spath:1970:AAF, 889 author = "H. Sp{\"{a}}th", 890 title = "{ACM} Algorithm 375: Fitting Data to One Exponential", 891 journal = j-CACM, 892 volume = "13", 893 number = "2", 894 pages = "120--121", 895 month = feb, 896 year = "1970", 897 CODEN = "CACMA2", 898 ISSN = "0001-0782", 899 bibdate = "Thu Sep 08 09:33:48 1994", 900 } 901 902 @Article{Spath:1970:FDO, 903 author = "H. Spath", 904 title = "Fitting data to one exponential", 905 journal = j-CACM, 906 volume = "13", 907 number = "2", 908 pages = "120--121", 909 month = feb, 910 year = "1970", 911 CODEN = "CACMA2", 912 ISSN = "0001-0782", 913 bibdate = "Tue Mar 25 13:26:09 MST 1997", 914 acknowledgement = ack-nhfb, 915 classcodes = "C4150 (Nonlinear and functional equations); C7300 (Natural sciences computing)", 916 corpsource = "Inst. Neutronenphysik Reaktortechnik, Karlsruhe, West Germany", 917 keywords = "least squares approximations; nonlinear equations; subroutines", 918 } 919 920 @Article{Spath:1970:AAL, 921 author = "H. Sp{\"{a}}th", 922 title = "{ACM} Algorithm 376: Least Squares Fit by {$f(x)=A\cos(Bx+C)$}", 923 journal = j-CACM, 924 volume = "13", 925 number = "2", 926 pages = "121--122", 927 month = feb, 928 year = "1970", 929 CODEN = "CACMA2", 930 ISSN = "0001-0782", 931 bibdate = "Tue Mar 25 13:26:09 MST 1997", 932 acknowledgement = ack-nhfb, 933 classcodes = "C4150 (Nonlinear and functional equations); C7300 (Natural sciences computing)", 934 corpsource = "Inst. Neutronenphysik, Reaktortechnik, Karlsruhe, West Germany", 935 keywords = "least squares approximations; nonlinear equations; subroutines", 936 } 937 938 @Article{Morgan:1970:SCSb, 939 author = "H. L. Morgan", 940 title = "Spelling correction in systems programs", 941 journal = j-CACM, 942 volume = "13", 943 number = "3", 944 pages = "90--94", 945 month = mar, 946 year = "1970", 947 CODEN = "CACMA2", 948 ISSN = "0001-0782", 949 bibdate = "Tue May 28 09:49:07 1996", 950 abstract = "Several specialized techniques are shown for efficiently incorporating spelling correction algorithms in to compilers and operating systems. These include the use of syntax and semantics information, the organization of restricted keyword and symbol tables, and the consideration of a limited class of spelling errors. Sample 360 coding for performing spelling correction is presented. By using systems which perform spelling correction, the number of debugging runs per program has been decreased, saving both programmer and machine time.", 951 keywords = "compilers; computer science and automata; debugging; diagnostics; error correction; error detection; lexical analysis systems programming; misspelling; operating systems; spelling correction", 952 xxnote = "Check issue number: 2 or 3??", 953 } 954 955 @Article{Fenichel:1970:PTP, 956 author = "R. R. Fenichel and J. Weizenbaum and J. C. Yochelson", 957 title = "A Program to Teach Programming", 958 journal = j-CACM, 959 volume = "13", 960 number = "3", 961 pages = "141--146", 962 month = mar, 963 year = "1970", 964 CODEN = "CACMA2", 965 ISSN = "0001-0782", 966 bibdate = "Tue Mar 25 13:26:09 MST 1997", 967 bibsource = "Compendex database", 968 abstract = "The TEACH system was developed at MIT to ease the cost and improve the results of elementary instruction in programming. To the student, TEACH offers loosely guided experience with a conversational language which was designed with teaching in mind. Faculty involvement is limited. At the heart of the TEACH system is an interactive language which somewhat resembles Joss, but is somewhat more amenable to rational explanation. Surrounding the language processor is a teaching system which presents lessons to the student, supervises his progress, and permits him to exercise his skills. A term of experience with TEACH is discussed. Pedagogically, the system appears to be successful; straightforward reimplementation will make it economically successful as well.", 969 acknowledgement = ack-nhfb, 970 classcodes = "C0310 (EDP management); C6150Z (Other systems operation programs)", 971 corpsource = "Massachusetts Inst. Technol., Cambridge, MA, USA", 972 journalabr = "Commun ACM", 973 keywords = "computer applications; computer-assisted learning; computers, programming; education; elementary programming; engineering education; programming; TEACH; UNCL; utility programs", 974 } 975 976 @Article{Slagle:1970:EMT, 977 author = "J. R. Slagle and J. K. Dixon", 978 title = "Experiments with the {M \& N} Tree-Searching Program", 979 journal = j-CACM, 980 volume = "13", 981 number = "3", 982 pages = "147--154, 159", 983 month = mar, 984 year = "1970", 985 CODEN = "CACMA2", 986 ISSN = "0001-0782", 987 bibdate = "Tue Mar 25 13:26:09 MST 1997", 988 bibsource = "Compendex database", 989 abstract = "The M \& N procedure is an improvement to the mini-max backing-up procedure widely used in computer programs for game-playing and other purposes. It is based on the principle that it is desirable to have many options when making decisions in the face of uncertainty. The mini-max procedure assigns to a MAX (MIN) node the value of the highest (lowest) valued successor to that node. The M \& N procedure assigns to a MAX (MIN) node some function of the M (N) highest (lowest) valued successors. An M \& N procedure was written in LISP to play the game of kalah, and it was demonstrated that the M \& Nprocedure is significantly superior to the mini-max procedure. The statistical significance of important conclusions is given. Since information on statistical significance has often been lacking in papers on computer experiments in the artificial intelligence field, these experiments can perhaps serve as a model for future work.", 990 acknowledgement = ack-nhfb, 991 classcodes = "C1230 (Artificial intelligence)", 992 corpsource = "Education Welfare, Bethesda, MD, USA", 993 journalabr = "Commun ACM", 994 keywords = "arg; artificial intelligence; automata theory; computers; game theory; heuristic programming; optimisation; programming; trees (mathematics)", 995 } 996 997 @Article{Batson:1970:MSS, 998 author = "A. Batson and Shy-Ming M. Ju and D. C. Wood", 999 title = "Measurements of Segment Size", 1000 journal = j-CACM, 1001 volume = "13", 1002 number = "3", 1003 pages = "155--159", 1004 month = mar, 1005 year = "1970", 1006 CODEN = "CACMA2", 1007 ISSN = "0001-0782", 1008 bibdate = "Tue Mar 25 13:26:09 MST 1997", 1009 bibsource = "Compendex database", 1010 abstract = "Distributions of segment sizes measured under routine operating conditions on a computer system which utilizes variable sized segments (the Burroughs B5500) are discussed. The most striking feature of the measurements is the large number of small segments-about 60\% of the segments in use contain less than 40 words. Although the results are certainly not installation independent, and although they are particularly influenced by features of the B5500 ALGOL system, they should be relevant to the design of new computer systems, especially with respect to the organization of paging schemes.", 1011 acknowledgement = ack-nhfb, 1012 classcodes = "C6150J (Operating systems)", 1013 corpsource = "Univ. Virginia, Charlottesville, VA, USA", 1014 journalabr = "Commun ACM", 1015 keywords = "computers; dynamic memory management; operating systems; storage allocation", 1016 } 1017 1018 @Article{Watson:1970:ANM, 1019 author = "G. A. Watson", 1020 title = "On an Algorithm for Nonlinear Minimax Approximation", 1021 journal = j-CACM, 1022 volume = "13", 1023 number = "3", 1024 pages = "160--162", 1025 month = mar, 1026 year = "1970", 1027 CODEN = "CACMA2", 1028 ISSN = "0001-0782", 1029 MRclass = "90.50 (65.00)", 1030 MRnumber = "44\#3694", 1031 mrreviewer = "R. W. Cottle", 1032 bibdate = "Tue Mar 25 13:26:09 MST 1997", 1033 bibsource = "Compendex database", 1034 abstract = "Certain nonlinear minimax approximation problems are characterized by properties which permit the application of special algorithms, mainly, based on the exchange algorithms of E. Y. Remes (1934, 1935), for their solution. The application to problems of this type of a general nonlinear algorithm due to M. R. Osborne and G. A. Watson (1969) is considered. Examples are given to illustrate that this algorithm can give satisfactory results and, in particular, can successfully solve problems which lead to difficulties with the more conventional specialist methods.", 1035 acknowledgement = ack-nhfb, 1036 classcodes = "B0260 (Optimisation techniques); C1180 (Optimisation techniques)", 1037 corpsource = "Australian Nat. Univ., Canberra, Australia", 1038 journalabr = "Commun ACM", 1039 keywords = "linear programming; mathematics; minimax approximation; nonlinear approximation; numerical methods; optimisation; THO", 1040 } 1041 1042 @Article{Schweikert:1970:CEI, 1043 author = "D. G. Schweikert", 1044 title = "A Comparison of Error Improvement Estimates for Adaptive Trapezoid Integration", 1045 journal = j-CACM, 1046 volume = "13", 1047 number = "3", 1048 pages = "163--166", 1049 month = mar, 1050 year = "1970", 1051 CODEN = "CACMA2", 1052 ISSN = "0001-0782", 1053 MRclass = "65.55", 1054 MRnumber = "44\#7751", 1055 mrreviewer = "R. E. Barnhill", 1056 bibdate = "Tue Mar 25 13:26:09 MST 1997", 1057 bibsource = "Compendex database", 1058 abstract = "Various simple choices of error improvement estimates for the trapezoid rule are studied to demonstrate a comparison procedure which is relatively independent of the profusion of adaptive search and stopping strategies. Comparisons are based on $x^r1$; the inclusion of the noninteger powers makes this more realistic than the usual polynomial based comparison. Behavior near the singularity was found to be the dominant factor, and a new estimate, based on a constant curvature assumption and parametric differences, was considered slightly better than the other choices considered.", 1059 acknowledgement = ack-nhfb, 1060 classcodes = "C4110 (Error analysis in numerical methods); C4160 (Numerical integration and differentiation)", 1061 corpsource = "Bell Telephone Labs. Inc., Murray Hill, NJ, USA", 1062 journalabr = "Commun ACM", 1063 keywords = "adaptive integration; error analysis; error improvement estimate; integration; mathematics; nonpolynomial error criteria; numerical methods; re; trapezoid rule", 1064 } 1065 1066 @Article{Schwarcz:1970:DQA, 1067 author = "Robert M. Schwarcz and John F. Burger and Robert F. Simmons", 1068 title = "A Deductive Question Answerer for Natural Language Inference", 1069 journal = j-CACM, 1070 volume = "13", 1071 number = "3", 1072 pages = "167--183", 1073 month = mar, 1074 year = "1970", 1075 CODEN = "CACMA2", 1076 ISSN = "0001-0782", 1077 bibdate = "Tue Mar 25 13:26:09 MST 1997", 1078 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib", 1079 abstract = "The question-answering aspects of the Protosynthex III prototype language processing system are described and exemplified in detail. The system is written in LISP 1. 5 and operates on the Q-32 time-sharing system. The system's data structures and their semantic organization, the deductive question-answering formalism of relational properties and complex-relation-forming operators, and the question-answering procedures which employ these features in their operation are all described and illustrated. Examples of the system's performance and of the limitations of its question-answering capability are presented and discussed. It is shown that the use of semantic information in deductive question answering greatly facilitates the process, and that a top-down procedure which works from question to answer enables effective use to be made of this information.", 1080 acknowledgement = ack-nhfb, 1081 annote = "Deductive inference driven by English: PROTOSYNTHEX III", 1082 classcodes = "C7820 (Humanities computing)", 1083 corpsource = "System Dev. Corp., Santa Monica, CA, USA", 1084 journalabr = "Commun ACM", 1085 keywords = "artificial intelligence; automata theory; computational linguistics", 1086 keywords = "artificial intelligence; computational linguistics; information retrieval; language translation and linguistics", 1087 } 1088 1089 @Article{Cardenas:1970:PLP, 1090 author = "A. F. Cardenas and W. J. Karplus", 1091 title = "{PDEL}, a Language for Partial Differential Equations", 1092 journal = j-CACM, 1093 volume = "13", 1094 number = "3", 1095 pages = "184--191 (or 184--190??)", 1096 month = mar, 1097 year = "1970", 1098 CODEN = "CACMA2", 1099 ISSN = "0001-0782", 1100 bibdate = "Tue Mar 25 13:26:09 MST 1997", 1101 bibsource = "Compendex database", 1102 abstract = "Conventional computer methods available to solve continuous system problems characterized by partial differential equations are very time-consuming and cumbersome. A convenient, easy to learn and to use, high level problem oriented language to solve and study partial differential equation problems has been designed; a practical translator for the language has also been designed, and a working version of it has been constructed for a significant portion of the language. This Partial Differential Equation Language, PDEL, is outlined, and the highlights of the translator are briefly summarized. PDEL can handle a large variety of fields. Time-dependent and time-independent fields can be defined. Any size of grid can be used to approximate regular and irregular geometries. Linear, nonlinear, uniform and nonuniform fields can be treated.", 1103 acknowledgement = ack-nhfb, 1104 classcodes = "C6140D (High level languages)", 1105 corpsource = "Univ. California, Los Angeles, CA, USA", 1106 journalabr = "Commun ACM", 1107 keywords = "computers; differential equations; mathematics; problem oriented languages", 1108 } 1109 1110 @Article{Levine:1970:AAS, 1111 author = "M. J. Levine and S. M. Swanson", 1112 title = "{ACM} Algorithm 377: Symbolic Expansion of Algebraic Expressions", 1113 journal = j-CACM, 1114 volume = "13", 1115 number = "3", 1116 pages = "191--192", 1117 month = mar, 1118 year = "1970", 1119 CODEN = "CACMA2", 1120 ISSN = "0001-0782", 1121 bibdate = "Tue Mar 25 13:26:09 MST 1997", 1122 bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/acm.bib", 1123 acknowledgement = ack-nhfb, 1124 classcodes = "C7300 (Natural sciences computing)", 1125 corpsource = "Carnegie-Mellon Univ., Pittsburgh, PA, USA", 1126 keywords = "algebra; subroutines", 1127 xxauthor = "J. L. Levine", 1128 } 1129 1130 @Article{Kailas:1970:AMC, 1131 author = "M. V. Kailas", 1132 title = "Another method of converting from hexadecimal to decimal", 1133 journal = j-CACM, 1134 volume = "13", 1135 number = "3", 1136 pages = "193--193", 1137 month = mar, 1138 year = "1970", 1139 CODEN = "CACMA2", 1140 ISSN = "0001-0782", 1141 bibdate = "Tue Mar 25 13:26:09 MST 1997", 1142 acknowledgement = ack-nhfb, 1143 classcodes = "C5230 (Digital arithmetic methods)", 1144 keywords = "digital arithmetic", 1145 } 1146 1147 @Article{Pager:1970:NSP, 1148 author = "D. Pager", 1149 title = "A number system for the permutations", 1150 journal = j-CACM, 1151 volume = "13", 1152 number = "3", 1153 pages = "193--193", 1154 month = mar, 1155 year = "1970", 1156 CODEN = "CACMA2", 1157 ISSN = "0001-0782", 1158 bibdate = "Tue Mar 25 13:26:09 MST 1997", 1159 acknowledgement = ack-nhfb, 1160 classcodes = "C5230 (Digital arithmetic methods)", 1161 corpsource = "Univ. Hawaii, Honolulu, HI, USA", 1162 keywords = "number theory", 1163 } 1164 1165 @Article{Dempster:1970:CPA, 1166 author = "J. R. H. Dempster", 1167 title = "Comment on a Paging Anomaly", 1168 journal = j-CACM, 1169 volume = "13", 1170 number = "3", 1171 pages = "193--194", 1172 month = mar, 1173 year = "1970", 1174 CODEN = "CACMA2", 1175 ISSN = "0001-0782", 1176 bibdate = "Tue Mar 25 13:26:09 MST 1997", 1177 acknowledgement = ack-nhfb, 1178 classcodes = "C4290 (Other computer theory)", 1179 corpsource = "Univ. British Columbia, Vancouver, BC, Canada", 1180 keywords = "computation theory; demand paging; paging machines; replacement algorithm; storage allocation", 1181 } 1182 1183 @Article{Maurer:1970:NCI, 1184 author = "H. A. Maurer", 1185 title = "A Note on the Complement of Inherently Ambiguous Context-Free Languages", 1186 journal = j-CACM, 1187 volume = "13", 1188 number = "3", 1189 pages = "194--194", 1190 month = mar, 1191 year = "1970", 1192 CODEN = "CACMA2", 1193 ISSN = "0001-0782", 1194 bibdate = "Tue Mar 25 13:26:09 MST 1997", 1195 acknowledgement = ack-nhfb, 1196 classcodes = "C4210 (Formal logic)", 1197 corpsource = "Univ. Calgary, Alta., Canada", 1198 keywords = "ambiguity; bounded language; Chomsky-language; complement; context-free language; formal languages; inherent ambiguity; phrase structure language; production system; type 2 language", 1199 } 1200 1201 @Article{Hsiao:1970:CFS, 1202 author = "D. K. Hsiao and F. D. Harary", 1203 title = "Corrigenda: {``A Formal System for Information Retrieval from Files''}", 1204 journal = j-CACM, 1205 volume = "13", 1206 number = "3", 1207 pages = "266--266", 1208 month = mar, 1209 year = "1970", 1210 CODEN = "CACMA2", 1211 ISSN = "0001-0782", 1212 bibdate = "Tue Dec 26 18:33:42 1995", 1213 note = "See \cite{Hsiao:1970:FSI}.", 1214 } 1215 1216 @Article{DeSalvio:1970:CCI, 1217 author = "A. J. DeSalvio and J. G. Purdy and J. Rau", 1218 title = "Creation and Control of Internal Data Bases Under a {Fortran} Programming Environment", 1219 journal = j-CACM, 1220 volume = "13", 1221 number = "4", 1222 pages = "211--215", 1223 month = apr, 1224 year = "1970", 1225 CODEN = "CACMA2", 1226 ISSN = "0001-0782", 1227 bibdate = "Tue Mar 25 13:26:09 MST 1997", 1228 bibsource = "Compendex database", 1229 abstract = "A method is described for the definition of a user's COMMON structure and the automatic generation of the necessary COMMON, DIMENSION, EQUIVALENCE, and type declarations for each of the user's routines. The definition for the COMMON is contained in an easy to modify form, thus allowing the control of general communications of data between routines. The described system has been implemented on the IBM 7094, CDC 6000 series, and the IBM 360. The method has proved to be invaluable for the definition and control of COMMON in many large-scale programs.", 1230 acknowledgement = ack-nhfb, 1231 classcodes = "C6130 (Data handling techniques); C6140D (High level languages)", 1232 corpsource = "TRW Systems, Redondo Beach and Sunnyvale, CA, USA", 1233 journalabr = "Commun ACM", 1234 keywords = "computers; data handling; data structures; FORTRAN", 1235 } 1236 1237 @Article{Mills:1970:SDP, 1238 author = "H. D. Mills", 1239 title = "Syntax-Directed Documentation for {PL360}", 1240 journal = j-CACM, 1241 volume = "13", 1242 number = "4", 1243 pages = "216--222", 1244 month = apr, 1245 year = "1970", 1246 CODEN = "CACMA2", 1247 ISSN = "0001-0782", 1248 bibdate = "Tue Mar 25 13:26:09 MST 1997", 1249 bibsource = "Compendex database", 1250 abstract = "The language PL360, together with its phrase structure grammar, is used as a concrete basis for illustrating an idea called syntax-directed documentation. This idea is-to use the phrase structure of a program to define the structure of a formal documentation for that program; to use the syntactic types and identifiers in the resulting structure to trigger the automatic formation of questions to the programmer, whose answers will become part of that documentation; and to provide automatic storage and retrieval facilities so that other programmers who want to understand or modify the index in various ways by syntactic types and objects. A small PL360 program, already found in the literature, is worked out as an example.", 1251 acknowledgement = ack-nhfb, 1252 classcodes = "C6140D (High level languages); C6150G (Diagnostic, testing, debugging and evaluating systems)", 1253 corpsource = "IBM, Gaithersburg, MD, USA", 1254 journalabr = "Commun ACM", 1255 keywords = "computers; computers, programming; documentation; procedure oriented languages; Program and system", 1256 } 1257 1258 @Article{Bayer:1970:SCC, 1259 author = "Rudolf Bayer and Christoph Witzgall", 1260 title = "Some Complete Calculi for Matrices", 1261 journal = j-CACM, 1262 volume = "13", 1263 number = "4", 1264 pages = "223--237", 1265 month = apr, 1266 year = "1970", 1267 CODEN = "CACMA2", 1268 ISSN = "0001-0782", 1269 bibdate = "Tue Mar 25 13:26:09 MST 1997", 1270 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Compiler/reynolds.bib", 1271 abstract = "A matrix calculus is introduced with the intention of developing data structures suitable for a high level algorithmic language for mathematical programming. It is shown how the special structure of matrices can be described and utilized for efficient computing by saving memory space and superfluous operations. Sequences of matrices (and sequences of sequences of matrices) are considered, and matrix operators are extended to sequence operators and cumulative operators. Algorithms are given which use symbol manipulation of matrix expressions so as to find the forms best suited for computation. These forms are called normalforms. Several completeness results are obtained in the sense that for each expression an equivalent expression in normal form can be found within a specified calculus.", 1272 acknowledgement = ack-nhfb, 1273 checked = "29 June 1993", 1274 classcodes = "B0260 (Optimisation techniques); C1180 (Optimisation techniques)", 1275 corpsource = "Boeing Sci. Res. Labs., Seattle, WA, USA", 1276 journalabr = "Commun ACM", 1277 keywords = "algorithmic languages; computers; computers, programming; data structures; mathematical; mathematics; matrix algebra; programming", 1278 } 1279 1280 @Article{BrinchHansen:1970:NMS, 1281 author = "P. {Brinch Hansen}", 1282 title = "The Nucleus of a Multiprogramming System", 1283 journal = j-CACM, 1284 volume = "13", 1285 number = "4", 1286 pages = "238--241, 250", 1287 month = apr, 1288 year = "1970", 1289 CODEN = "CACMA2", 1290 ISSN = "0001-0782", 1291 bibdate = "Tue Mar 25 13:26:09 MST 1997", 1292 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Misc/os.bib", 1293 abstract = "The philosophy and structure is described of a multiprogramming system that can be extended with a hierarchy of operating systems to suit diverse requirements of program scheduling and resource allocation. The system nucleus simulates an environment in which program execution and input\slash output are handled uniformly as parallel, cooperating processes. A fundamental set of primitives allows the dynamic creation and control of a hierarchy of processes as well as the communication among them.", 1294 acknowledgement = ack-nhfb, 1295 classcodes = "C6150J (Operating systems)", 1296 corpsource = "A/S Regnecentralen, Copenhagen, Denmark", 1297 journalabr = "Commun ACM", 1298 keywords = "computers; computers, time sharing; operating systems", 1299 keywords = "multiprogramming", 1300 } 1301 1302 @Article{Eastman:1970:RSP, 1303 author = "C. M. Eastman", 1304 title = "Representations for Space Planning", 1305 journal = j-CACM, 1306 volume = "13", 1307 number = "4", 1308 pages = "242--250", 1309 month = apr, 1310 year = "1970", 1311 CODEN = "CACMA2", 1312 ISSN = "0001-0782", 1313 bibdate = "Tue Mar 25 13:26:09 MST 1997", 1314 bibsource = "Compendex database", 1315 abstract = "Problems involving the arrangement of objects in two-or three-space where the objective function primarily consists of derivatives of the distance between objects or their arrangement are called space planning problems. The representational requirements for this problem area are defined and compared with current computer graphic languages. Four alternative data structures that allow automated space planning are described and compared.", 1316 acknowledgement = ack-nhfb, 1317 classcodes = "C6120 (File organisation)", 1318 corpsource = "Carnegie-Mellon Univ., Pittsburgh, PA, USA", 1319 journalabr = "Commun ACM", 1320 keywords = "computer-aided design; computers; computers, language; data structures; design automation; graphic methods; graphics", 1321 } 1322 1323 @Article{Pomeranz:1970:CMP, 1324 author = "J. E. Pomeranz and R. L. {Weil, Jr.}", 1325 title = "The cyclical majority problem", 1326 journal = j-CACM, 1327 volume = "13", 1328 number = "4", 1329 pages = "251--254", 1330 month = apr, 1331 year = "1970", 1332 CODEN = "CACMA2", 1333 ISSN = "0001-0782", 1334 bibdate = "Tue Mar 25 13:26:09 MST 1997", 1335 bibsource = "Compendex database", 1336 abstract = "The unsolved combinational problem of the cyclical majority is presented and some mew, simulated results for 3, 4, 5,\ldots{}, 40 issues and 3, 5, 7,\ldots{}, 37 judges are reported. The method devised for simulating the voting process to estimate the probabilities does not solve the problem, but appears much more efficient than one previous simulation and more accurate than another.", 1337 acknowledgement = ack-nhfb, 1338 classcodes = "C1160 (Combinatorial mathematics)", 1339 corpsource = "Univ. Chicago, IL, USA", 1340 journalabr = "Commun ACM", 1341 keywords = "combinatorial mathematics; computers, simulation; simulation; statistical methods", 1342 } 1343 1344 @Article{Nilson:1970:CSU, 1345 author = "E. N. Nilson", 1346 title = "Cubic Splines on Uniform Meshes", 1347 journal = j-CACM, 1348 volume = "13", 1349 number = "4", 1350 pages = "255--258", 1351 month = apr, 1352 year = "1970", 1353 CODEN = "CACMA2", 1354 ISSN = "0001-0782", 1355 MRclass = "65.20", 1356 MRnumber = "44\#1189", 1357 mrreviewer = "C. A. Hall", 1358 bibdate = "Tue Mar 25 13:26:09 MST 1997", 1359 bibsource = "Compendex database", 1360 abstract = "A very simple procedure is presented for constructing cubic splines, periodic or nonperiodic, on uniform meshes. Arcs of two cubics suffice to construct a basis of cardinal splines. An algorithm is given which requires only minimal storage and computation and permits easy trade-off of one against the other. The application of these devices is of fundamental importance in the area of computer graphics where substantial savings in computing time and storage requirements have special significance.", 1361 acknowledgement = ack-nhfb, 1362 classcodes = "C4130 (Interpolation and function approximation)", 1363 corpsource = "Pratt and Whitney Aircraft, East Hartford, CT, USA", 1364 journalabr = "Commun ACM", 1365 keywords = "cardinal splines; computers; mathematics; numerical methods; polynomials; simple spline representation; uniform mesh splines", 1366 } 1367 1368 @Article{Pankiewicz:1970:AAD, 1369 author = "W. Pankiewicz", 1370 title = "{ACM} Algorithm 378: Discretized {Newton}-like Method for Solving a System of Simultaneous Nonlinear Equations", 1371 journal = j-CACM, 1372 volume = "13", 1373 number = "4", 1374 pages = "259--260", 1375 month = apr, 1376 year = "1970", 1377 CODEN = "CACMA2", 1378 ISSN = "0001-0782", 1379 bibdate = "Tue Mar 25 13:26:09 MST 1997", 1380 acknowledgement = ack-nhfb, 1381 classcodes = "C4150 (Nonlinear and functional equations); C7300 (Natural sciences computing)", 1382 keywords = "nonlinear equations; numerical methods; subroutines", 1383 } 1384 1385 @Article{Lyness:1970:AAS, 1386 author = "J. N. Lyness", 1387 title = "{ACM} Algorithm 379: {SQUANK (Simpson Quadrature Used Adaptively-Noise Killed)}", 1388 journal = j-CACM, 1389 volume = "13", 1390 number = "4", 1391 pages = "260--263 (or 260--262??)", 1392 month = apr, 1393 year = "1970", 1394 CODEN = "CACMA2", 1395 ISSN = "0001-0782", 1396 bibdate = "Tue Mar 25 13:26:09 MST 1997", 1397 acknowledgement = ack-nhfb, 1398 classcodes = "C4160 (Numerical integration and differentiation); C7300 (Natural sciences computing)", 1399 corpsource = "Argonne Nat. Lab., IL, USA", 1400 keywords = "integration; subroutines", 1401 } 1402 1403 @Article{Heess:1970:CPW, 1404 author = "W. F. {Heess, Jr.}", 1405 title = "Comments on a paper by {Wallace} and {Mason}", 1406 journal = j-CACM, 1407 volume = "13", 1408 number = "4", 1409 pages = "264--265", 1410 month = apr, 1411 year = "1970", 1412 CODEN = "CACMA2", 1413 ISSN = "0001-0782", 1414 bibdate = "Tue Mar 25 13:26:09 MST 1997", 1415 acknowledgement = ack-nhfb, 1416 classcodes = "C6150J (Operating systems)", 1417 keywords = "multiprogramming; storage allocation", 1418 } 1419 1420 @Article{Smith:1970:CMU, 1421 author = "J. L. Smith", 1422 title = "Comment on multiprogramming under a page on demand strategy", 1423 journal = j-CACM, 1424 volume = "13", 1425 number = "4", 1426 pages = "265--265", 1427 month = apr, 1428 year = "1970", 1429 CODEN = "CACMA2", 1430 ISSN = "0001-0782", 1431 bibdate = "Tue Mar 25 13:26:09 MST 1997", 1432 acknowledgement = ack-nhfb, 1433 classcodes = "C6150J (Operating systems)", 1434 corpsource = "CSIRO, Canberra City, ACT, Australia", 1435 keywords = "multiprogramming", 1436 } 1437 1438 @Article{deVries:1970:CLM, 1439 author = "Ronald C. {de Vries}", 1440 title = "Comment on {Lawler}'s Multilevel {Boolean} minimization", 1441 journal = j-CACM, 1442 volume = "13", 1443 number = "4", 1444 pages = "265--266", 1445 month = apr, 1446 year = "1970", 1447 CODEN = "CACMA2", 1448 ISSN = "0001-0782", 1449 MRclass = "68.00 (94.00)", 1450 MRnumber = "44\#7801", 1451 mrreviewer = "E. Maliszewski", 1452 bibdate = "Tue Mar 25 13:26:09 MST 1997", 1453 acknowledgement = ack-nhfb, 1454 classcodes = "C4230 (Switching theory)", 1455 corpsource = "Univ. New Mexico, Albuquerque, NM, USA", 1456 keywords = "generalized prime implicants; incompletely specified functions; minimal forms; minimization; multilevel logic design", 1457 keywords = "minimisation of switching nets", 1458 } 1459 1460 @Article{Knight:1970:ACP, 1461 author = "K. R. Knight", 1462 title = "An {Algol} construction for procedures as parameters of procedures", 1463 journal = j-CACM, 1464 volume = "13", 1465 number = "4", 1466 pages = "266--266", 1467 month = apr, 1468 year = "1970", 1469 CODEN = "CACMA2", 1470 ISSN = "0001-0782", 1471 bibdate = "Tue Mar 25 13:26:09 MST 1997", 1472 acknowledgement = ack-nhfb, 1473 classcodes = "C6140D (High level languages)", 1474 corpsource = "Univ. Surrey, Guildford, UK", 1475 keywords = "ALGOL; programming", 1476 } 1477 1478 @Article{Wirth:1970:CMM, 1479 author = "N. Wirth", 1480 title = "Corrigenda: {``On Multiprogramming, Machine Coding, and Computer Organization}''", 1481 journal = j-CACM, 1482 volume = "13", 1483 number = "4", 1484 pages = "266--266", 1485 month = apr, 1486 year = "1970", 1487 CODEN = "CACMA2", 1488 ISSN = "0001-0782", 1489 bibdate = "Fri Jan 17 18:23:53 1997", 1490 note = "See \cite{Wirth:1969:MMC}.", 1491 } 1492 1493 @Article{Hodes:1970:PSO, 1494 author = "L. Hodes", 1495 title = "Programming System for the On-Line Analysis of Biomedical Images", 1496 journal = j-CACM, 1497 volume = "13", 1498 number = "5", 1499 pages = "279--283, 286", 1500 month = may, 1501 year = "1970", 1502 CODEN = "CACMA2", 1503 ISSN = "0001-0782", 1504 bibdate = "Tue Mar 25 13:26:09 MST 1997", 1505 bibsource = "Compendex database", 1506 abstract = "A preliminary description of the software for a computer-display system is given with special emphasis on the man-machine interaction. This system is intended for a wide variety of biomedical applications. As an example, the methods are applied to the karyotyping of chromosomes. The system is separated into four programming tasks-picture transformations, file maintenance, picture structuring, and display management. Picture structuring is considered as the vehicle for man-machine communication. A prototype data format for pictures, called a picture-form, is developed. Structure operators are defined which manipulate picture-forms to produce new picture-forms. Many of the ideas are taken from the symbolic mathematical laboratory at MIT conceived by M. Minsky.", 1507 acknowledgement = ack-nhfb, 1508 classcodes = "C7300 (Natural sciences computing)", 1509 corpsource = "Dept. Health, Education Welfare, Bethasda, MD, USA", 1510 journalabr = "Commun ACM", 1511 keywords = "bioengineering, computer applications; biology; computers; computers, programming; data handling; data reduction and analysis; graphics; image processing; machine systems; man-; medicine; pattern recognition", 1512 } 1513 1514 @Article{Sitton:1970:OGA, 1515 author = "G. A. Sitton", 1516 title = "Operations on Generalized Arrays with the {Genie} Compiler", 1517 journal = j-CACM, 1518 volume = "13", 1519 number = "5", 1520 pages = "284--286", 1521 month = may, 1522 year = "1970", 1523 CODEN = "CACMA2", 1524 ISSN = "0001-0782", 1525 bibdate = "Tue Mar 25 13:26:09 MST 1997", 1526 bibsource = "Compendex database", 1527 abstract = "Operations on vectors, matrices, and higher dimensional storage arrays are standard features of most compilers today. The elements of such structures are usually restricted to be scalars For many sophisticated applications this restriction can impose cumbersome data representations. An efficient system has been devised and implemented which allows the elements of multidimensional arrays to themselves be multidimensional arrays. This system was developed from a storage structure in which the location, length, and content of each array is described by a codeword which can be interpreted by the system. Codewords may describe arrays containing more codewords, thus providing all needed descriptive information for hyperstructures of any form.", 1528 acknowledgement = ack-nhfb, 1529 classcodes = "C6130 (Data handling techniques); C6150C (Compilers, interpreters and other processors)", 1530 corpsource = "Rice Univ., Houston, TX, USA", 1531 journalabr = "Commun ACM", 1532 keywords = "computers; computers, operating systems; data handling; data structures; E P; matrix operations; multidimensional arrays; program compilers; programming", 1533 } 1534 1535 @Article{Vere:1970:TEE, 1536 author = "S. Vere", 1537 title = "Translation Equations (Errata)", 1538 journal = j-CACM, 1539 volume = "13", 1540 number = "5", 1541 pages = "286--286", 1542 month = may, 1543 year = "1970", 1544 CODEN = "CACMA2", 1545 ISSN = "0001-0782", 1546 bibdate = "Fri Jan 17 18:28:27 1997", 1547 note = "See \cite{Vere:1970:TE}.", 1548 acknowledgement = ack-nhfb, 1549 } 1550 1551 @Article{Sasser:1970:ASS, 1552 author = "W. E. Sasser and D. S. Burdick and D. A. Graham and T. H. Naylor", 1553 title = "Application of Sequential Sampling to Simulation. an Example Inventory Model", 1554 journal = j-CACM, 1555 volume = "13", 1556 number = "5", 1557 pages = "287--296", 1558 month = may, 1559 year = "1970", 1560 CODEN = "CACMA2", 1561 ISSN = "0001-0782", 1562 bibdate = "Tue Mar 25 13:26:09 MST 1997", 1563 bibsource = "Compendex database", 1564 abstract = "Four different sequential sampling procedures are applied to the analysis of data generated by a computer simulation experiment with a multi-item inventory model. For each procedure the cost of computer time required to achieve given levels of statistical precision is calculated. Also the cost of computer time using comparable fixed sample size methods is calculated. The computer costs of fixed sample size procedures vs sequential sampling procedures are compared. Details are given for the inventory model and sampling procedures.", 1565 acknowledgement = ack-nhfb, 1566 classcodes = "C1220 (Simulation, modelling and identification)", 1567 corpsource = "Duke Univ., Durham, NC, USA", 1568 journalabr = "Commun ACM", 1569 keywords = "computers; control; data reduction and analysis; industrial management, data processing; inventory control; modelling; sequential sampling; simulation; statistical methods; stock", 1570 } 1571 1572 @Article{Loeckx:1970:ACB, 1573 author = "J. Loeckx", 1574 title = "Algorithm for the Construction of Bounded-Context Parsers", 1575 journal = j-CACM, 1576 volume = "13", 1577 number = "5", 1578 pages = "297--307", 1579 month = may, 1580 year = "1970", 1581 CODEN = "CACMA2", 1582 ISSN = "0001-0782", 1583 bibdate = "Tue Mar 25 13:26:09 MST 1997", 1584 bibsource = "Compendex database", 1585 abstract = "An algorithm is described which accepts an arbitrary context-free grammar and constructs a bounded-context parser for it whenever such a parser exists. The definition of a context-free grammar and the working of a bounded-context parser are recalled. The notion of reduction class for a context-free grammar is then introduced and its connection with the structure of a bounded-context parser is indicated. Next, pushdown automata which generate the different reduction classes of a context-free grammar are defined. Finally, the algorithm is described; it essentially carries out an exhaustive study of all possible runs of the pushdown automata generating the reduction classes. The utility of the algorithm is discussed in the light of the experience gained from its use in compiler design.", 1586 acknowledgement = ack-nhfb, 1587 classcodes = "C4210 (Formal logic)", 1588 corpsource = "MBLE Res. Lab., Brussels, Belgium", 1589 journalabr = "Commun ACM", 1590 keywords = "automata theory; compilers; computational linguistics; computers, language; context-free grammars; formal languages; grammars; low", 1591 } 1592 1593 @Article{Reynolds:1970:GST, 1594 author = "John C. Reynolds", 1595 title = "{GEDANKEN} --- {A} Simple Typeless Language Based on the Principle of Completeness and the Reference Concept", 1596 journal = j-CACM, 1597 volume = "13", 1598 number = "5", 1599 pages = "308--319", 1600 month = may, 1601 year = "1970", 1602 CODEN = "CACMA2", 1603 ISSN = "0001-0782", 1604 bibdate = "Tue Mar 25 13:26:09 MST 1997", 1605 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Compiler/reynolds.bib", 1606 abstract = "In this experimental programming language, any value which is permitted in some context of the language is permissible in any other meaningful context. In particular, functions and labels are permissible results of functions and values of variables. Assignment and indirect addressing are formalized by introducing values, called references, which in turn possess other values. The assignment operation always affects the relation between some reference and its values. All composed data structures are treated as functions. Type declarations are not permitted. Any data structure may be implicit; i.e., it may be specified by giving an arbitrary algorithm for computing or accessing its components. The existence of label variables permits the construction of coroutines, quasi-parallel processes, and other unorthodox control mechanisms. A variety of programming examples illustrates the generality of the language. Limitations and possible extensions are discussed briefly.", 1607 acknowledgement = ack-nhfb, 1608 checked = "4 September 1990", 1609 classcodes = "C6140D (High level languages)", 1610 corpsource = "Argonne Nat. Lab., IL, USA", 1611 journalabr = "Commun ACM", 1612 keywords = "computers; data structures; gedanken; procedure oriented languages; programming languages", 1613 } 1614 1615 @Article{Crespi-Reghizzi:1970:LTG, 1616 author = "S. Crespi-Reghizzi and R. Morpurgo", 1617 title = "A language for treating graphs", 1618 journal = j-CACM, 1619 volume = "13", 1620 number = "5", 1621 pages = "319--323", 1622 month = may, 1623 year = "1970", 1624 CODEN = "CACMA2", 1625 ISSN = "0001-0782", 1626 bibdate = "Tue Mar 25 13:26:09 MST 1997", 1627 bibsource = "Compendex database", 1628 abstract = "A language for the representation of graphs is described, and the formulation of graph operations such as node and\slash or link deletion or insertion, union, intersection, comparison, and traversal of graphs is given. Graphs are represented by linked lists. The language is syntactically defined as an extension to ALGOL 60, and it is translated into ALGOL by means of a syntax-driven compiler. Application areas for this language are operation research, network problems, control theory, traffic problems, etc.", 1629 acknowledgement = ack-nhfb, 1630 classcodes = "C6130 (Data handling techniques); C6140D (High level languages)", 1631 corpsource = "Politecnico di Milano, Italy", 1632 journalabr = "Commun ACM", 1633 keywords = "automatic control, analysis; computers; data handling; data structures; electric circuits, analysis; graph theory; operations research; procedure oriented languages", 1634 } 1635 1636 @Article{Laflin:1970:AAS, 1637 author = "S. Laflin and M. A. Brebner", 1638 title = "{ACM} Algorithm 380: In-situ Transposition of a Rectangular Matrix", 1639 journal = j-CACM, 1640 volume = "13", 1641 number = "5", 1642 pages = "324--326 (or 324--325??)", 1643 month = may, 1644 year = "1970", 1645 CODEN = "CACMA2", 1646 ISSN = "0001-0782", 1647 bibdate = "Tue Mar 25 13:26:09 MST 1997", 1648 acknowledgement = ack-nhfb, 1649 classcodes = "C7300 (Natural sciences computing)", 1650 corpsource = "Univ. Birmingham, UK", 1651 keywords = "matrix algebra; subroutines", 1652 } 1653 1654 @Article{Knop:1970:AAR, 1655 author = "R. E. Knop", 1656 title = "{ACM} Algorithm 381: Random Vectors Uniform In Solid Angle", 1657 journal = j-CACM, 1658 volume = "13", 1659 number = "5", 1660 pages = "326--326", 1661 month = may, 1662 year = "1970", 1663 CODEN = "CACMA2", 1664 ISSN = "0001-0782", 1665 bibdate = "Tue Mar 25 13:26:09 MST 1997", 1666 acknowledgement = ack-nhfb, 1667 classcodes = "C7890 (Other special applications of computing)", 1668 corpsource = "Rutgers Univ., New Brunswick, NJ, USA", 1669 keywords = "random number generation; subroutines", 1670 } 1671 1672 @Article{Elder:1970:FVI, 1673 author = "H. A. Elder", 1674 title = "On the Feasibility of Voice Input to an On-Line Computer Processing System", 1675 journal = j-CACM, 1676 volume = "13", 1677 number = "6", 1678 pages = "339--346", 1679 month = jun, 1680 year = "1970", 1681 CODEN = "CACMA2", 1682 ISSN = "0001-0782", 1683 bibdate = "Tue Mar 25 13:26:09 MST 1997", 1684 bibsource = "Compendex database", 1685 abstract = "An on-line digital computer processing system is considered in which an ordinary telephone is the complete terminal device, input to the computer being provided as a sequence of spoken words, and output to the user being audio responses from the machine. The feasibility of implementing such a system with a FORTRAN-like algebraic compiler as the object processor is considered. Details of a specific word recognition program are given. This technique \ldots{} between each input word. Experimental results are presented giving error rates for different experimental conditions as well as the machine resources required to accommodate several users at a time. The results show that at this time it is both economically and logically feasible to handle at least 40 users at a time with an IBM 360\slash 65 computer.", 1686 acknowledgement = ack-nhfb, 1687 classcodes = "C5590 (Other computer peripheral equipment)", 1688 corpsource = "Cornell Univ., Ithaca, NY, USA", 1689 journalabr = "Commun ACM", 1690 keywords = "computer peripheral equipment; computers; computers, input-output device; computers, pattern recognition; data processing; man-machine interfaces; online operation; recognition; speech; speech, recognition; telephony; voice input", 1691 } 1692 1693 @Article{Muthukrishnan:1970:CDT, 1694 author = "C. R. Muthukrishnan and V. Rajaraman", 1695 title = "On the Conversion of Decision Tables to Computer Programs", 1696 journal = j-CACM, 1697 volume = "13", 1698 number = "6", 1699 pages = "347--351", 1700 month = jun, 1701 year = "1970", 1702 CODEN = "CACMA2", 1703 ISSN = "0001-0782", 1704 bibdate = "Tue Mar 25 13:26:09 MST 1997", 1705 bibsource = "Compendex database", 1706 abstract = "The use of execution time diagnostics in pinpointing ambiguities in decision tables is discussed. It is pointed out that any attempt at resolving ambiguities at compile time will, in general, be impossible. It is shown that, as a consequence, three methods of converting decision tables to programs are inadequate in regard to ambiguity detection. Two algorithms for programming decision tables whose merits are simplicity of implementation and detection of ambiguities at execution time are presented. The first algorithm is for limited entry decision tables and clarifies the importance of proper coding of the information in the decision table. The second algorithm programs a mixed entry decision table directly without going through the intermediate step of conversion to a limited entry form, thereby resulting in storage economy. A comparison of the algorithms and others proposed in the literature is made. Some features of a decision table to FORTRAN IV translator developed for the IBM 7044 are given.", 1707 acknowledgement = ack-nhfb, 1708 classcodes = "C6100 (Software techniques and systems)", 1709 corpsource = "Indian Inst. Technol., Kanpur, India", 1710 journalabr = "Commun ACM", 1711 keywords = "computers; decision tables; operations research; programming", 1712 } 1713 1714 @Article{Grimes:1970:SRC, 1715 author = "J. E. Grimes", 1716 title = "Scheduling to Reduce Conflict in Meetings", 1717 journal = j-CACM, 1718 volume = "13", 1719 number = "6", 1720 pages = "351--352", 1721 month = jun, 1722 year = "1970", 1723 CODEN = "CACMA2", 1724 ISSN = "0001-0782", 1725 bibdate = "Tue Mar 25 13:26:09 MST 1997", 1726 bibsource = "Compendex database", 1727 abstract = "Conflicts in scheduling can be treated as defining an undirected linear graph independently of the relation of the activities in conflict to additional constraints of time and space. Each connected component of such a graph, which can be found by an algorithm described by S. C. Gotlieb and D. C. Corneil, corresponds to a set of events that must be scheduled at different times. Applications are discussed in scheduling the presentation of papers at meetings and scheduling examinations.", 1728 acknowledgement = ack-nhfb, 1729 classcodes = "C1160 (Combinatorial mathematics)", 1730 corpsource = "Cornell Univ., Ithaca, NY, USA", 1731 journalabr = "Commun ACM", 1732 keywords = "co; computers; graph theory; programming; undirected linear graphs", 1733 } 1734 1735 @Article{Frantz:1970:PPA, 1736 author = "D. G. Frantz", 1737 title = "A {PL\slash} 1 program to assist the comparative linguist", 1738 journal = j-CACM, 1739 volume = "13", 1740 number = "6", 1741 pages = "353--356", 1742 month = jun, 1743 year = "1970", 1744 CODEN = "CACMA2", 1745 ISSN = "0001-0782", 1746 bibdate = "Tue Mar 25 13:26:09 MST 1997", 1747 acknowledgement = ack-nhfb, 1748 classcodes = "C7820 (Humanities computing)", 1749 corpsource = "Univ. Alberta, Arrowwood, Alta., Canada", 1750 keywords = "language translation and linguistics", 1751 } 1752 1753 @Article{Damerau:1970:APC, 1754 author = "F. J. Damerau", 1755 title = "Automatic Parsing for Content Analysis", 1756 journal = j-CACM, 1757 volume = "13", 1758 number = "6", 1759 pages = "356--360", 1760 month = jun, 1761 year = "1970", 1762 CODEN = "CACMA2", 1763 ISSN = "0001-0782", 1764 bibdate = "Tue Mar 25 13:26:09 MST 1997", 1765 bibsource = "Compendex database", 1766 abstract = "Although automatic syntactic and semantic analysis is not yet possible for all of an unrestricted natural language text, some applications, of which content analysis is one, do not have such a stringent coverage requirement. Preliminary studies show that the Harvard Syntactic Analyzer can produce correct and unambiguous identification of the subject and object of certain verbs for approximately half of the relevant occurrences. This provides a degree of coverage for content analysis variables which compares favorably to manual methods, in which only a sample of the total available text is normally processed.", 1767 acknowledgement = ack-nhfb, 1768 classcodes = "C7820 (Humanities computing)", 1769 corpsource = "IBM, Yorktown Heights, NY, USA", 1770 journalabr = "Commun ACM", 1771 keywords = "computers, data processing; content analysis; E L; information storage and retrie; language translation and linguistics; linguistics; natural language processing; syntactic analysis", 1772 } 1773 1774 @Article{Linz:1970:AFP, 1775 author = "Peter Linz", 1776 title = "Accurate Floating-Point Summation", 1777 journal = j-CACM, 1778 volume = "13", 1779 number = "6", 1780 pages = "361--362", 1781 month = jun, 1782 year = "1970", 1783 CODEN = "CACMA2", 1784 ISSN = "0001-0782", 1785 MRclass = "65.25", 1786 MRnumber = "44\#3468", 1787 mrreviewer = "R. P. Brent", 1788 bibdate = "Tue Mar 25 13:26:09 MST 1997", 1789 bibsource = "Compendex database; garbo.uwasa.fi:/pc/doc-soft/fpbiblio.txt and ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1970.bib", 1790 abstract = "This paper describes an alternate method for summing a set of floating-point numbers. Comparison of the error bound for this method with that of the standard summation method shows that it is considerably less sensitive to propagation of round-off error.", 1791 acknowledgement = ack-nhfb, 1792 classcodes = "C5230 (Digital arithmetic methods)", 1793 corpsource = "New York Univ., NY, USA", 1794 descriptors = "Simulation; statistics; numeric calculation;", 1795 journalabr = "Commun ACM", 1796 keywords = "computers, data processing; floating point arithmetic; floating-point addition; mathematics; numerical methods; round-off error; round-off errors; round-off propagation; summation", 1797 keywords = "digital arithmetic", 1798 } 1799 1800 @Article{Hillstrom:1970:CSA, 1801 author = "K. E. Hillstrom", 1802 title = "Comparison of Several Adaptive Newton-Cotes Quadrature Routines in Evaluating Definite Integrals with Peaked Integrands", 1803 journal = j-CACM, 1804 volume = "13", 1805 number = "6", 1806 pages = "362--365", 1807 month = jun, 1808 year = "1970", 1809 CODEN = "CACMA2", 1810 ISSN = "0001-0782", 1811 bibdate = "Tue Mar 25 13:26:09 MST 1997", 1812 bibsource = "Compendex database", 1813 abstract = "It is shown, by numerical experiment only, that there are certain quadratures for which the rate of convergences increases with the use of higher degree Newton-Cotes rules, used adaptively. The advantage of adaptive methods over a nonadaptive rule in approximating integrals having peaked integrands is demonstrated. The performance of five different adaptive quadrature schemes, based on Newton-Cotes (2N plus 1) point rules (N equals 1, 2, 3, 4, 5), in approximating a set of definite integrals is compared.", 1814 acknowledgement = ack-nhfb, 1815 classcodes = "C4160 (Numerical integration and differentiation)", 1816 corpsource = "Argonne Nat. Lab., IL, USA", 1817 journalabr = "Commun ACM", 1818 keywords = "computers, data processing; convergence of numerical methods; integral evaluation; integration; mathematics; methods; numerical; numerical integration; numerical methods; quadrature schemes", 1819 } 1820 1821 @Article{Stewart:1970:IOS, 1822 author = "G. W. Stewart", 1823 title = "Incorporating Origin Shifts into the {QR} Algorithm for Symmetric Tridiagonal Matrices", 1824 journal = j-CACM, 1825 volume = "13", 1826 number = "6", 1827 pages = "365--367", 1828 month = jun, 1829 year = "1970", 1830 CODEN = "CACMA2", 1831 ISSN = "0001-0782", 1832 bibdate = "Tue Mar 25 13:26:09 MST 1997", 1833 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Theory/gvl.bib and ftp://ftp.ira.uka.de/pub/bibliography/Theory/Matrix.bib", 1834 abstract = "The QR iteration for the eigenvalues of a symmetric tridiagonal matrix can be accelerated by incorporating a sequence of origin shifts. The origin shift may be either subtracted directly from the diagonal elements of the matrix or incorporated by means of an implicit algorithm. Both methods have drawbacks-the direct method can unnecessarily degrade small eigenvalues, while the implicit method can effectively loose the shift and thereby retard the convergence. A new method which has neither drawback is presented. Both the algorithm proposed here and the implicit algorithm are safer than the explicit algorithm. The implicit algorithm requires somewhat less computation, but the new algorithm will give faster convergence in some cases, an important consideration when eigenvectors are being calculated.", 1835 acknowledgement = ack-nhfb, 1836 classcodes = "C4140 (Linear algebra)", 1837 corpsource = "Univ. Tex., Austin, TX, USA", 1838 journalabr = "Commun ACM", 1839 keywords = "computers, data processing; convergence of numerical methods; eigenfunctions; eigenvalues; eigenvalues and; eigenvectors; iterative methods; mathematics; matrix algebra; origin shifts; QR method; symmetric tridiagonal matrix; tridiagonal matrices", 1840 kwds = "nla, eig, QR algorithm, symmetric matrix, tridiagonal matrix", 1841 } 1842 1843 @Article{Chase:1970:AAC, 1844 author = "P. J. Chase", 1845 title = "{ACM} Algorithm 382: Combinations of ${M}$ Out of ${N}$ Objects", 1846 journal = j-CACM, 1847 volume = "13", 1848 number = "6", 1849 pages = "368--368", 1850 month = jun, 1851 year = "1970", 1852 CODEN = "CACMA2", 1853 ISSN = "0001-0782", 1854 bibdate = "Tue Mar 25 13:26:09 MST 1997", 1855 acknowledgement = ack-nhfb, 1856 classcodes = "C7300 (Natural sciences computing)", 1857 corpsource = "Dept. Defense, Fort Meade, MD, USA", 1858 keywords = "algebra; subroutines", 1859 } 1860 1861 @Article{Chase:1970:AAP, 1862 author = "P. J. Chase", 1863 title = "{ACM} Algorithm 383: Permutations of a Set with Repetitions", 1864 journal = j-CACM, 1865 volume = "13", 1866 number = "6", 1867 pages = "368--369", 1868 month = jun, 1869 year = "1970", 1870 CODEN = "CACMA2", 1871 ISSN = "0001-0782", 1872 bibdate = "Tue Mar 25 13:26:09 MST 1997", 1873 acknowledgement = ack-nhfb, 1874 classcodes = "C7300 (Natural sciences computing)", 1875 corpsource = "Dept. Defense, Fort Meade, MD, USA", 1876 keywords = "algebra; subroutines", 1877 } 1878 1879 @Article{Stewart:1970:AAE, 1880 author = "G. W. Stewart", 1881 title = "{ACM} Algorithm 384: Eigenvalues and Eigenvectors of a Real Symmetric Matrix [{F2}]", 1882 journal = j-CACM, 1883 volume = "13", 1884 number = "6", 1885 pages = "369--371", 1886 month = jun, 1887 year = "1970", 1888 CODEN = "CACMA2", 1889 ISSN = "0001-0782", 1890 bibdate = "Tue Mar 25 13:26:09 MST 1997", 1891 note = "See errata \cite{Stewart:1970:EAA}.", 1892 acknowledgement = ack-nhfb, 1893 classcodes = "C4140 (Linear algebra); C7300 (Natural sciences computing)", 1894 corpsource = "Univ. Texas, Austin, TX, USA", 1895 keywords = "eigenvalues; eigenvalues and eigenfunctions; eigenvectors; matrix algebra; QR algorithm; real symmetric matrix; subroutines", 1896 kwds = "nla, eig, QR algorithm, symmetric matrix", 1897 } 1898 1899 @Article{London:1970:CAM, 1900 author = "R. L. London", 1901 title = "Certification of Algorithm 245 ({M1}) Treesort 3: Proof of Algorithms --- {A} New Kind of Certification", 1902 journal = j-CACM, 1903 volume = "13", 1904 number = "6", 1905 pages = "371--374", 1906 month = jun, 1907 year = "1970", 1908 CODEN = "CACMA2", 1909 ISSN = "0001-0782", 1910 bibdate = "Fri Jan 17 18:26:39 1997", 1911 } 1912 1913 @Article{Chandler:1970:RS, 1914 author = "J. P. Chandler and W. C. Harrison", 1915 title = "{R201}--{SHELLSORT}", 1916 journal = j-CACM, 1917 volume = "13", 1918 number = "6", 1919 pages = "373--374", 1920 month = jun, 1921 year = "1970", 1922 CODEN = "CACMA2", 1923 ISSN = "0001-0782", 1924 bibdate = "Fri Jan 17 18:28:53 1997", 1925 keywords = "digital computer sorting; minimal storage sorting; sorting", 1926 } 1927 1928 @Article{Codd:1970:RMD, 1929 author = "E. F. Codd", 1930 title = "A Relational Model of Data for Large Shared Data Banks", 1931 journal = j-CACM, 1932 volume = "13", 1933 number = "6", 1934 pages = "377--387", 1935 month = jun, 1936 year = "1970", 1937 CODEN = "CACMA2", 1938 ISSN = "0001-0782", 1939 bibdate = "Tue Mar 25 13:26:09 MST 1997", 1940 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib and ftp://ftp.ira.uka.de/pub/bibliography/Database/database.bib", 1941 note = "Also published in/as: `Readings in Database Systems', M. Stonebraker, Morgan-Kaufmann, 1988, pp. 5--15", 1942 abstract = "Future users of large data banks must be protected from having to know how the data is organized in the machine (the internal representation). A prompting service which supplies such information is not a satisfactory solution. Activities of users at terminals and most application programs would remain unaffected when the internal representation of data is changed and even when some aspects of the external representation are changed. Changes in data representation will often be needed as a result of changes in query, update, and report traffic and natural growth in the types of stored information. Existing noninferential, formatted data systems provide users with tree-structured files or slightly more general network models of the data. In Section 1, inadequacies of these models are discussed. A model based on $n$-ary relations, a normal form for data base relations, and the concept of a universal data sublanguage are introduced. In Section 2, certain operations on relations (other than logical inference) are discussed and applied to the problems of redundancy and consistency in the user's model.", 1943 acknowledgement = ack-nhfb, 1944 annote = "Shows problems of hierarchical data organization, presents a non-hierarchical `normal' structure, and discusses languages for describing relations of such normal structures.", 1945 classcodes = "C6120 (File organisation); C7250 (Information storage and retrieval)", 1946 corpsource = "IBM, San Jose, CA, USA", 1947 journalabr = "Commun ACM", 1948 keywords = "composition; computers, data storage; consistency; data bank; data banks; data base; data integrity; data organization; data structure; data structures; derivability; file organisation; hierarchies of data; information retrieval; information storage and retrie; join; networks of data; NOI; predicate calculus; redundancy; relations; retrieval language; security; systems", 1949 review = "ACM CR 8905-0329", 1950 } 1951 1952 @Article{Grant:1970:ICG, 1953 author = "C. A. Grant", 1954 title = "An interactive command generating facility", 1955 journal = j-CACM, 1956 volume = "13", 1957 number = "7", 1958 pages = "403--406", 1959 month = jul, 1960 year = "1970", 1961 CODEN = "CACMA2", 1962 ISSN = "0001-0782", 1963 bibdate = "Tue Mar 25 13:26:09 MST 1997", 1964 bibsource = "Compendex database", 1965 abstract = "A facility to permit conversationally controlled tasks to be executed in a noninteractive environment is proposed. A means by which programs can generate interactive time-sharing commands and receive the corresponding output response is presented. The commands will be invoked as if they had been typed at a console keyboard. It is argued that this facility will help overcome some of the current limitations in man-computer communication. A set of functions to accomplish the above which could be embedded into any string processing language is suggested, and necessary information pertinent to implementation of the facility on existing time-sharing systems is given.", 1966 acknowledgement = ack-nhfb, 1967 classcodes = "C6140B (Machine-oriented languages); C6150J (Operating systems)", 1968 corpsource = "Univ. California, Berkeley, CA, USA", 1969 journalabr = "Commun ACM", 1970 keywords = "computers; computers, time sharing; interactive computing; machine oriented languages; operating systems; time-sharing systems", 1971 } 1972 1973 @Article{Wilkes:1970:CAM, 1974 author = "M. A. Wilkes", 1975 title = "Conversational Access to a 2048-Word Machine", 1976 journal = j-CACM, 1977 volume = "13", 1978 number = "7", 1979 pages = "407--414", 1980 month = jul, 1981 year = "1970", 1982 CODEN = "CACMA2", 1983 ISSN = "0001-0782", 1984 bibdate = "Tue Mar 25 13:26:09 MST 1997", 1985 bibsource = "Compendex database", 1986 abstract = "LAP6 is an on-line system running on 2048- word LINC which provides full facilities for text editing, automatic filing and file maintenance, and program preparation and assembly. It focuses on the preparation and editing of continuously displayed 23,040- character text strings (manuscripts) which can be positioned anywhere by the user and edited by simply adding and deleting lines as though working directly on an elastic scroll. Other features are available through a uniform command set which itself can be augmented by the user. The machine, although small, aids program design by providing display scope and premarked randomly addressable LINC tapes as standard items, in an environment similar to that of a sophisticated terminal. The tapes are logically similar to a disk. Priority was given to the design of efficient tape algorithms to minimize the limitations of the small memory. Techniques developed for handling scroll editing, filing, and the layered system structure are outlined.", 1987 acknowledgement = ack-nhfb, 1988 classcodes = "C6150J (Operating systems)", 1989 corpsource = "Washington Univ., St. Louis, MS, USA", 1990 journalabr = "Commun ACM", 1991 keywords = "computers; interactive computing; OD; online operation; operating systems; operating systems (computers); text editing", 1992 } 1993 1994 @Article{Waite:1970:MPS, 1995 author = "W. M. Waite", 1996 title = "The mobile programming system: {STAGE} 2", 1997 journal = j-CACM, 1998 volume = "13", 1999 number = "7", 2000 pages = "415--421", 2001 month = jul, 2002 year = "1970", 2003 CODEN = "CACMA2", 2004 ISSN = "0001-0782", 2005 bibdate = "Tue Mar 25 13:26:09 MST 1997", 2006 bibsource = "Compendex database", 2007 abstract = "STAGE 2 is the second level of a bootstrap sequence which is easily implemented on any computer. It is a flexible, powerful macro processor designed specifically as a tool for constructing machine-independent software. The features provided by STAGE 2 are summarized, and the implementation techniques which have made it possible to have STAGE 2 running on a new machine with less than one man-week of effort are discussed. The approach has been successful on over 15 machines of widely varying characteristics.", 2008 acknowledgement = ack-nhfb, 2009 classcodes = "C6140E (Other programming languages)", 2010 corpsource = "Univ. Colorado, Boulder, CO, USA", 2011 journalabr = "Commun ACM", 2012 keywords = "bootstrapping; computers; macro processors; programming languages; system", 2013 } 2014 2015 @Article{Bloom:1970:STT, 2016 author = "Burton H. Bloom", 2017 title = "Space\slash Time Trade-offs in Hash Coding with Allowable Errors", 2018 journal = j-CACM, 2019 volume = "13", 2020 number = "7", 2021 pages = "422--426", 2022 month = jul, 2023 year = "1970", 2024 CODEN = "CACMA2", 2025 ISSN = "0001-0782", 2026 bibdate = "Tue Mar 25 13:26:09 MST 1997", 2027 bibsource = "Compendex database", 2028 abstract = "Trade-offs among certain computational factors in hash coding are analyzed. The paradigm problem considered is that of testing a series of messages one-by-one for membership in a given set of messages. Two new hash-coding methods are examined and compared with a particular conventional hash-coding method. The computational factors considered are the size of the hash area (space), the time required to identify a message as a nonmember of the given set (reject time), and an allowable error frequency. The new methods are intended to reduce the amount of space required to contain the hash-coded information from that associated with conventional methods. The reduction in space is accomplished by exploiting the possibility that a small fraction of errors of commission may be tolerable in some applications, in particular, applications in which a large amount of data is involved and a core resident hash area is consequently not feasible using conventional methods. An example is discussed which illustrates possible areas of application for the new method.", 2029 acknowledgement = ack-nhfb, 2030 annote = "Phantom use of a direct access list.", 2031 classcodes = "C6130 (Data handling techniques)", 2032 corpsource = "Computer Usage Co. Newton Upper Falls, MA, USA", 2033 journalabr = "Commun ACM", 2034 keywords = "bit vector filter CACM; codes; computers; computers, errors; hash coding; inf", 2035 } 2036 2037 @Article{Coffman:1970:FSU, 2038 author = "E. G. {Coffman, Jr.} and J. Eve", 2039 title = "File Structures Using Hashing Functions", 2040 journal = j-CACM, 2041 volume = "13", 2042 number = "7", 2043 pages = "427--432, 436", 2044 month = jul, 2045 year = "1970", 2046 CODEN = "CACMA2", 2047 ISSN = "0001-0782", 2048 bibdate = "Tue Mar 25 13:26:09 MST 1997", 2049 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib", 2050 abstract = "A general method of file structuring is proposed which uses a hashing function to define tree structure. Two types of such trees are examined, and their relation to trees studied in the past is explained. Results for the probability distributions of path lengths are derived and illustrated.", 2051 acknowledgement = ack-nhfb, 2052 annote = "Tree structure with branching based on bit values of key code.", 2053 classcodes = "C6120 (File organisation)", 2054 corpsource = "Univ. Newcastle upon Tyne, UK", 2055 journalabr = "Commun ACM", 2056 keywords = "computers; data processing; data structures; file organization; hash coding; information storage and retrie; tree structures; trees (mathematics)", 2057 } 2058 2059 @Article{Bradley:1970:ABG, 2060 author = "Gordon H. Bradley", 2061 title = "Algorithm and Bound for the Greatest Common Divisor of $n$ Integers", 2062 journal = j-CACM, 2063 volume = "13", 2064 number = "7", 2065 pages = "433--436", 2066 month = jul, 2067 year = "1970", 2068 CODEN = "CACMA2", 2069 ISSN = "0001-0782", 2070 MRclass = "10A30", 2071 MRnumber = "45 3313", 2072 mrreviewer = "A. M. Cohen", 2073 bibdate = "Tue Mar 25 13:26:09 MST 1997", 2074 bibsource = "Compendex database", 2075 abstract = "A new version of the Euclidean algorithm for finding the greatest common divisor of $n$ integers $a(i)$ and multipliers $x(i)$ such that $\mbox{gcd} = x(1)a(1) + \ldots + x(n)a(n)$ is presented. The number of arithmetic operations and the number of storage locations are linear in $n$. A theorem of Lame that gives a bound for the number of iterations of the Euclidean algorithm for two integers is extended to the case of $n$ integers. An algorithm to construct a minimal set of multipliers is presented. A Fortran program for the algorithm appears as Comm. ACM Algorithm 386.", 2076 acknowledgement = ack-nhfb, 2077 classcodes = "C4190 (Other numerical methods)", 2078 corpsource = "Yale Univ., New Haven, CT, USA", 2079 journalabr = "Commun ACM", 2080 keywords = "computers, data processing; diophantine equations; Euclidean algorithm; greatest common divisor; iterative methods; mathematics; number theory; numerical methods", 2081 } 2082 2083 @Article{Woods:1970:CSP, 2084 author = "W. A. Woods", 2085 title = "Context-Sensitive Parsing", 2086 journal = j-CACM, 2087 volume = "13", 2088 number = "7", 2089 pages = "437--445", 2090 month = jul, 2091 year = "1970", 2092 CODEN = "CACMA2", 2093 ISSN = "0001-0782", 2094 bibdate = "Tue Mar 25 13:26:09 MST 1997", 2095 bibsource = "Compendex database", 2096 abstract = "This paper presents a canonical form for context-sensitive derivations and a parsing algorithm which finds each context-sensitive analysis once and only once. The amount of memory required by the algorithm is essentially no more than the required to store a single complete derivation. In addition, a modified version of the basic algorithm is presented which blocks infinite analyses for grammars which contain loops. The algorithm is also compared with several previous parsers for context-sensitive grammars and general rewriting systems, and the difference between the two types of analyses is discussed. The algorithm appears to be complementary to an algorithm by S. Kuno in several respects, including the space-time trade-off and the degree of context dependence involved.", 2097 acknowledgement = ack-nhfb, 2098 classcodes = "C4210 (Formal logic)", 2099 corpsource = "Harvard Univ., Cambridge, MA, USA", 2100 journalabr = "Commun ACM", 2101 keywords = "computational linguistics", 2102 keywords = "automata theory; computational linguistics; context-sensitive grammars; context-sensitive parsing; formal grammars; formal language theory; parsing; parsing algorithms; recognition algorithms", 2103 } 2104 2105 @Article{Paciorek:1970:AAE, 2106 author = "K. A. Paciorek", 2107 title = "{ACM} Algorithm 385: Exponential Integral ${E}_i(x)$", 2108 journal = j-CACM, 2109 volume = "13", 2110 number = "7", 2111 pages = "446--447", 2112 month = jul, 2113 year = "1970", 2114 CODEN = "CACMA2", 2115 ISSN = "0001-0782", 2116 bibdate = "Tue Mar 25 13:26:09 MST 1997", 2117 acknowledgement = ack-nhfb, 2118 classcodes = "C4160 (Numerical integration and differentiation); C7300 (Natural sciences computing)", 2119 corpsource = "Argonne Nat. Lab., IL, USA", 2120 keywords = "integration; subroutines", 2121 } 2122 2123 @Article{Bradley:1970:AAG, 2124 author = "G. H. Bradley", 2125 title = "{ACM} Algorithm 386: Greatest Common Divisor of $n$ Integers and Multipliers", 2126 journal = j-CACM, 2127 volume = "13", 2128 number = "7", 2129 pages = "447--448", 2130 month = jul, 2131 year = "1970", 2132 CODEN = "CACMA2", 2133 ISSN = "0001-0782", 2134 bibdate = "Tue Mar 25 13:26:09 MST 1997", 2135 acknowledgement = ack-nhfb, 2136 classcodes = "C4190 (Other numerical methods); C7300 (Natural sciences computing)", 2137 corpsource = "Yale Univ. New Haven, CT, USA", 2138 keywords = "number theory; subroutines", 2139 } 2140 2141 @Article{Sattley:1970:CPL, 2142 author = "K. Sattley and R. Millstein", 2143 title = "Comments on a paper by {Lowe}", 2144 journal = j-CACM, 2145 volume = "13", 2146 number = "7", 2147 pages = "450--451", 2148 month = jul, 2149 year = "1970", 2150 CODEN = "CACMA2", 2151 ISSN = "0001-0782", 2152 bibdate = "Tue Mar 25 13:26:09 MST 1997", 2153 acknowledgement = ack-nhfb, 2154 classcodes = "C4290 (Other computer theory)", 2155 corpsource = "Applied Data Res. Inc., NY, USA", 2156 keywords = "computation theory; graph theory", 2157 } 2158 2159 @Article{Baecker:1970:NDB, 2160 author = "H. D. Baecker", 2161 title = "A note on data base deadlocks", 2162 journal = j-CACM, 2163 volume = "13", 2164 number = "7", 2165 pages = "451--451", 2166 month = jul, 2167 year = "1970", 2168 CODEN = "CACMA2", 2169 ISSN = "0001-0782", 2170 bibdate = "Tue Mar 25 13:26:09 MST 1997", 2171 acknowledgement = ack-nhfb, 2172 classcodes = "C7250 (Information storage and retrieval)", 2173 corpsource = "Univ. Calgary, Alta., Canada", 2174 keywords = "information retrieval", 2175 } 2176 2177 @Article{Pomeranz:1970:NAP, 2178 author = "J. E. Pomeranz", 2179 title = "Note on an Anomaly in Paging", 2180 journal = j-CACM, 2181 volume = "13", 2182 number = "7", 2183 pages = "451--451", 2184 month = jul, 2185 year = "1970", 2186 CODEN = "CACMA2", 2187 ISSN = "0001-0782", 2188 bibdate = "Tue Mar 25 13:26:09 MST 1997", 2189 acknowledgement = ack-nhfb, 2190 classcodes = "C6120 (File organisation)", 2191 corpsource = "Univ. Chicago, IL, USA", 2192 keywords = "demand paging; paging machines; replacement algorithm; storage allocation", 2193 } 2194 2195 @Article{Hunt:1970:CAA, 2196 author = "B. R. Hunt", 2197 title = "A Comment on Axiomatic Approaches to Programming", 2198 journal = j-CACM, 2199 volume = "13", 2200 number = "7", 2201 pages = "452--452", 2202 month = jul, 2203 year = "1970", 2204 CODEN = "CACMA2", 2205 ISSN = "0001-0782", 2206 bibdate = "Tue Mar 25 13:26:09 MST 1997", 2207 acknowledgement = ack-nhfb, 2208 classcodes = "C4290 (Other computer theory)", 2209 corpsource = "Univ. California, Los Alamos, NM, USA", 2210 keywords = "axiomatic method; computability and decidability; homomorphic structure in programming; programming; proofs of programs", 2211 } 2212 2213 @Article{Nielsen:1970:ACR, 2214 author = "N. R. Nielsen", 2215 title = "Allocation of Computer Resources. is Pricing the Answer", 2216 journal = j-CACM, 2217 volume = "13", 2218 number = "8", 2219 pages = "467--474", 2220 month = aug, 2221 year = "1970", 2222 CODEN = "CACMA2", 2223 ISSN = "0001-0782", 2224 bibdate = "Tue Mar 25 13:26:09 MST 1997", 2225 bibsource = "Compendex database", 2226 abstract = "The extent to which a pricing mechanism fits the mold is discussed. Inasmuch as pricing must serve as a rationing mechanism at times, consideration is given to the means by which prices can be adjusted flexibly in order to make a dynamic allocation of resources. Consideration is given to the means by which users can be insulated from the harmful effects of frequent price fluctuations. Two illustrative pricing systems are discussed in order to demonstrate the applicability of pricing in quite different environments.", 2227 acknowledgement = ack-nhfb, 2228 classcodes = "C0200 (General computer topics)", 2229 corpsource = "Stanford Univ., CA, USA", 2230 journalabr = "Commun ACM", 2231 keywords = "CACMA; computers; cost accounting; digital computers; economics; industrial management; installation management; resource allocation; resources", 2232 } 2233 2234 @Article{Nagy:1970:NTH, 2235 author = "G. Nagy and N. Tuong", 2236 title = "Normalization Techniques for Handprinted Numerals", 2237 journal = j-CACM, 2238 volume = "13", 2239 number = "8", 2240 pages = "475--481", 2241 month = aug, 2242 year = "1970", 2243 CODEN = "CACMA2", 2244 ISSN = "0001-0782", 2245 bibdate = "Tue Mar 25 13:26:09 MST 1997", 2246 bibsource = "Compendex database", 2247 abstract = "A family of pattern standardization techniques based on geometrical projection is applied to a file of digitized handprinted numerals obtained from sales clerks. The principle involves transforming a quadrilateral specified in terms of the convex hull of each pattern into a square. The amount of overlap within each class of characters vs the amount between classes is used to evaluate the degree of normalization achieved with respect to other published methods including size and shear normalization through moments.", 2248 acknowledgement = ack-nhfb, 2249 classcodes = "B6140C (Optical information, image and video signal processing); C1250 (Pattern recognition)", 2250 corpsource = "IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA", 2251 journalabr = "Commun ACM", 2252 keywords = "CACMA; computers digital, character R; computers, digital; pattern recognition; pattern recognition systems", 2253 } 2254 2255 @Article{Day:1970:FTQ, 2256 author = "A. C. Day", 2257 title = "Full Table Quadratic Searching for Scatter Storage", 2258 journal = j-CACM, 2259 volume = "13", 2260 number = "8", 2261 pages = "481--482", 2262 month = aug, 2263 year = "1970", 2264 CODEN = "CACMA2", 2265 ISSN = "0001-0782", 2266 bibdate = "Tue Mar 25 13:26:09 MST 1997", 2267 bibsource = "Compendex database", 2268 abstract = "The quadratic residue search method for hash tables avoids much of the clustering experienced with a linear search method. The simple quadratic search only accesses half the table. It has been shown that when the length of the table is a prime of the form 4n plus 3, where n is an integer, the whole table may be accessed by two quadratic searches plus a separate access for the original entry point. A search method is presented which is computationally simple, has all the advantages of the quadratic search, and yet accesses all the table in one sweep.", 2269 acknowledgement = ack-nhfb, 2270 classcodes = "C6130 (Data handling techniques)", 2271 corpsource = "Univ. Coll. London, UK", 2272 journalabr = "Commun ACM", 2273 keywords = "CACMA; computers; computers, data storage; hash coding; programming; table look-up; table lookup", 2274 } 2275 2276 @Article{Brawn:1970:SPE, 2277 author = "B. S. Brawn and F. G. Gustavson and E. S. Mankin", 2278 title = "Sorting in a Paging Environment", 2279 journal = j-CACM, 2280 volume = "13", 2281 number = "8", 2282 pages = "483--494", 2283 month = aug, 2284 year = "1970", 2285 CODEN = "CACMA2", 2286 ISSN = "0001-0782", 2287 bibdate = "Tue Mar 25 13:26:09 MST 1997", 2288 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Database/Graefe.bib", 2289 abstract = "This sorting study was part of an extensive measurement project undertaken on the M44\slash 44X, an experimental paging system which was conceived and implemented at IBM Research in order to explore the virtual machine concept. The study was concerned with the implementation of sorting procedures in the context of the dynamic paging environment characteristic of virtual memory machines. Descriptions of the experimental sort programs and analysis of the performance measurement results obtained for them are presented. The insight gained from the experimental effort is used to arrive at a set of broad guidelines for writing sort programs for a paging environment.", 2290 acknowledgement = ack-nhfb, 2291 classcodes = "C6130 (Data handling techniques)", 2292 corpsource = "IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA", 2293 journalabr = "Commun ACM", 2294 keywords = "CACMA; computer, memories; computers; computers, programming; dynamic memory management; External sort virtual memory CACM; operating systems; sorting; virtual machines", 2295 } 2296 2297 @Article{Saltzer:1970:IM, 2298 author = "J. H. Saltzer and J. W. Gintell", 2299 title = "The instrumentation of {Multics}", 2300 journal = j-CACM, 2301 volume = "13", 2302 number = "8", 2303 pages = "495--500", 2304 month = aug, 2305 year = "1970", 2306 CODEN = "CACMA2", 2307 ISSN = "0001-0782", 2308 bibdate = "Tue Mar 25 13:26:09 MST 1997", 2309 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Misc/monitor.bib and ftp://ftp.ira.uka.de/pub/bibliography/Database/Graefe.bib", 2310 abstract = "An array of measuring tools devised to aid in the implementation of a prototype computer utility is discussed. These tools include special hardware clocks and data channels, general purpose programmed probing and recording tools, and specialized measurement facilities. Some particular measurements of interest in a system which combines demand paging with multiprogramming are described in detail. Measuring techniques described here have been directed primarily toward understanding what goes on inside the operating system, rather than on measuring `throughput' system capacity, or the characteristics of system load.", 2311 acknowledgement = ack-nhfb, 2312 annote = "An array of measuring tools devised to aid in the implementation of a prototype computer utility is discussed. These tools include (1) a hardware calendar clock (52 bit, 1 microsecond resolution) and an associated match register; (2) a memory reference counter; (3) an input/output channel which can be used by an attached processor to read memory; (4) a general metering package which records time spent executing selectable supervisor modules while the system is running; (5) a segment utilization metering facility which periodically probes for the current segment number; (6) a facility which records on a per-segment basis the number of missing pages and segments encountered during execution in that segment; (7) a tool which counts the number of times procedures are called; (8) a software package implemented on a PDP-8 which utilizes the special I/O channel (3); (9) the CLI, which prints out the time of day, the CPU time, and the number of times the process had to wait for a page to be brought in after every `ready message'; (10) a ring buffer containing the segment, page number, and time of day of the last 256 missing pages of the process under measurement; (11) a package to monitor the effect of the system's multiprogramming effort of an individual program; (12) a script driver implemented on a PDP-8; and (13) an internal script driver.", 2313 classcodes = "C6150J (Operating systems)", 2314 corpsource = "MIT, Cambridge, MA, USA", 2315 journalabr = "Commun ACM", 2316 keywords = "CACMA; computers; multiprogramming systems; operating distributed performance paging CACM; operating systems; operating systems (computers); performance measurement; system analysis", 2317 } 2318 2319 @Article{Ichbiah:1970:TGA, 2320 author = "J. D. Ichbiah and S. P. Morse", 2321 title = "A technique for generating almost optimal {Floyd-Evans} productions for precedence grammars", 2322 journal = j-CACM, 2323 volume = "13", 2324 number = "8", 2325 pages = "501--508", 2326 month = aug, 2327 year = "1970", 2328 CODEN = "CACMA2", 2329 ISSN = "0001-0782", 2330 bibdate = "Tue Mar 25 13:26:09 MST 1997", 2331 acknowledgement = ack-nhfb, 2332 classcodes = "C4210 (Formal logic)", 2333 corpsource = "Co. Internat. l'Informatique, Les Clayes-sous-Bois, France", 2334 keywords = "computational linguistics; grammars; optimisation", 2335 } 2336 2337 @Article{Fielding:1970:AAF, 2338 author = "K. Fielding", 2339 title = "{ACM} Algorithm 387: Function Minimization and Linear Search", 2340 journal = j-CACM, 2341 volume = "13", 2342 number = "8", 2343 pages = "509--510", 2344 month = aug, 2345 year = "1970", 2346 CODEN = "CACMA2", 2347 ISSN = "0001-0782", 2348 bibdate = "Tue Mar 25 13:26:09 MST 1997", 2349 acknowledgement = ack-nhfb, 2350 classcodes = "C7300 (Natural sciences computing)", 2351 corpsource = "Univ. Essex, Wivenhoe Park, Colchester, UK", 2352 keywords = "optimisation; subroutines", 2353 } 2354 2355 @Article{Hubner:1970:AAR, 2356 author = "H. H{\"{u}}bner and H. Kremer and K. O. Linn and W. Schwering", 2357 title = "{ACM} Algorithm 388: {Rademacher} Function", 2358 journal = j-CACM, 2359 volume = "13", 2360 number = "8", 2361 pages = "510--511", 2362 month = aug, 2363 year = "1970", 2364 CODEN = "CACMA2", 2365 ISSN = "0001-0782", 2366 bibdate = "Tue Mar 25 13:26:09 MST 1997", 2367 acknowledgement = ack-nhfb, 2368 classcodes = "C7300 (Natural sciences computing)", 2369 keywords = "mathematics; subroutines", 2370 } 2371 2372 @Article{Hubner:1970:AAB, 2373 author = "H. H{\"{u}}bner and H. Kremer and K. O. Linn and W. Schwering", 2374 title = "{ACM} Algorithm 389: Binary Ordered {Walsh} Functions", 2375 journal = j-CACM, 2376 volume = "13", 2377 number = "8", 2378 pages = "511--511", 2379 month = aug, 2380 year = "1970", 2381 CODEN = "CACMA2", 2382 ISSN = "0001-0782", 2383 bibdate = "Tue Mar 25 13:26:09 MST 1997", 2384 acknowledgement = ack-nhfb, 2385 classcodes = "C7300 (Natural sciences computing)", 2386 keywords = "mathematics; subroutines", 2387 } 2388 2389 @Article{Hubner:1970:AAS, 2390 author = "H. H{\"{u}}bner and H. Kremer and K. O. Linn and W. Schwering", 2391 title = "{ACM} Algorithm 390: Sequency Ordered {Walsh} Functions", 2392 journal = j-CACM, 2393 volume = "13", 2394 number = "8", 2395 pages = "511--512 (or 511--511??)", 2396 month = aug, 2397 year = "1970", 2398 CODEN = "CACMA2", 2399 ISSN = "0001-0782", 2400 bibdate = "Tue Mar 25 13:26:09 MST 1997", 2401 acknowledgement = ack-nhfb, 2402 classcodes = "C7300 (Natural sciences computing)", 2403 keywords = "mathematics; subroutines", 2404 } 2405 2406 @Article{McKay:1970:AAU, 2407 author = "J. McKay", 2408 title = "{ACM} Algorithm 391: Unitary Symmetric Polynomials", 2409 journal = j-CACM, 2410 volume = "13", 2411 number = "8", 2412 pages = "512--512", 2413 month = aug, 2414 year = "1970", 2415 CODEN = "CACMA2", 2416 ISSN = "0001-0782", 2417 bibdate = "Tue Mar 25 13:26:09 MST 1997", 2418 acknowledgement = ack-nhfb, 2419 classcodes = "C7300 (Natural sciences computing)", 2420 corpsource = "California Inst. Technol., Pasadena, CA, USA", 2421 keywords = "polynomials; subroutines", 2422 } 2423 2424 @Article{Anonymous:1970:ISU, 2425 author = "Anonymous", 2426 title = "Identification of {States of the United States} (including the {District of Columbia}) for information interchange", 2427 journal = j-CACM, 2428 volume = "13", 2429 number = "8", 2430 pages = "514--515", 2431 month = aug, 2432 year = "1970", 2433 CODEN = "CACMA2", 2434 ISSN = "0001-0782", 2435 bibdate = "Tue Mar 25 13:26:09 MST 1997", 2436 acknowledgement = ack-nhfb, 2437 classcodes = "C6130 (Data handling techniques)", 2438 keywords = "code standards", 2439 } 2440 2441 @Article{Bouknight:1970:PGT, 2442 author = "W. Jack Bouknight", 2443 title = "A Procedure for Generation of Three-Dimensional Half-Toned Computer Graphics Presentations", 2444 journal = j-CACM, 2445 volume = "13", 2446 number = "9", 2447 pages = "527--536", 2448 month = sep, 2449 year = "1970", 2450 CODEN = "CACMA2", 2451 ISSN = "0001-0782", 2452 bibdate = "Tue Mar 25 13:26:09 MST 1997", 2453 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Graphics/siggraph/pre75.bib", 2454 abstract = "A description is given of an algorithm for producing computer generated halftone presentations of three-dimensional polygonal surface structures. The history leading to the algorithm development and then the algorithm itself are described. Results are presented and are compared with computer runs achieved by the Warnock approach. An extension of the procedure to variable position illumination sources is also given.", 2455 acknowledgement = ack-nhfb, 2456 classcodes = "C4190 (Other numerical methods)", 2457 corpsource = "Univ. Illinois, Urbana, IL, USA", 2458 journalabr = "Commun ACM", 2459 keywords = "CACMA; computer graphics; computers; half-tone images; hidden surface; image processing", 2460 } 2461 2462 @Article{Bracchi:1970:ISS, 2463 author = "G. Bracchi and M. Somalvico", 2464 title = "Interactive Software System for Computer-Aided Design. an Application to Circuit Project", 2465 journal = j-CACM, 2466 volume = "13", 2467 number = "9", 2468 pages = "537--545", 2469 month = sep, 2470 year = "1970", 2471 CODEN = "CACMA2", 2472 ISSN = "0001-0782", 2473 bibdate = "Tue Mar 25 13:26:09 MST 1997", 2474 bibsource = "Compendex database", 2475 abstract = "Characteristics of an interactive software system, intended to constitute an interface between designer and computer during various steps of the design process, are presented. Main emphasis is given to the description of the features of the two high level user oriented languages, operating at different levels, on which the interaction is based. The first one is IMOL, an interactive monitor language, which is designed to perform the overall and control functions of the software system. The second one is COIF, a circuit oriented graphic language, which is designed to describe, generate, and manipulate graphic problem specifications. The application to computer-aided circuit design is in particular examined.", 2476 acknowledgement = ack-nhfb, 2477 classcodes = "B1130B (Computer-aided circuit analysis and design); C7410D (Electronic engineering computing)", 2478 corpsource = "Politecnico, Milano, Italy", 2479 journalabr = "Commun ACM", 2480 keywords = "CACMA; computer aided circuit design; computer-aided circuit design; computers; computers, graphics; computers, programming; electric circuits, analysis; language; online operation", 2481 } 2482 2483 @Article{Hirschsohn:1970:AHL, 2484 author = "I. Hirschsohn", 2485 title = "{AMESPLOT}, a Higher Level Data Plotting Software System", 2486 journal = j-CACM, 2487 volume = "13", 2488 number = "9", 2489 pages = "546--555", 2490 month = sep, 2491 year = "1970", 2492 CODEN = "CACMA2", 2493 ISSN = "0001-0782", 2494 bibdate = "Tue Mar 25 13:26:09 MST 1997", 2495 bibsource = "Compendex database", 2496 abstract = "System described is hardware independent. Elements common to all types of data plots are outlined and the way in which these elements may be combined into a system based on simple modules is demonstrated. Basic syntax of AMESPLOT is outlined, and a brief description is given of its current utility software, consisting of `macros' to produce self-scaled plots, formal tablets of text, interspersed with subplots, map coastlines and 3-D plots. Structuring of plots from multiple, independent, self-contained subplots is described.", 2497 acknowledgement = ack-nhfb, 2498 classcodes = "C6140D (High level languages)", 2499 corpsource = "Univ. California, San Diego, La Jolla, CA, USA", 2500 journalabr = "Commun ACM", 2501 keywords = "CACMA; computer graphics; computers; computers, language; data plotting; graphics; interactive computing; problem oriented languages", 2502 } 2503 2504 @Article{Moler:1970:ISR, 2505 author = "Cleve B. Moler and Louis P. Solomon", 2506 title = "Integrating Square Roots", 2507 journal = j-CACM, 2508 volume = "13", 2509 number = "9", 2510 pages = "556--557", 2511 month = sep, 2512 year = "1970", 2513 CODEN = "CACMA2", 2514 ISSN = "0001-0782", 2515 MRclass = "65.60", 2516 MRnumber = "44\#1223", 2517 mrreviewer = "J. C. Butcher", 2518 bibdate = "Tue Mar 25 13:26:09 MST 1997", 2519 bibsource = "Compendex database", 2520 abstract = "Differential equation of the $(y')^2 = f(y)$ are difficult to integrate numerically because of the singularity at points where $f(y)$ vanishes. A technique is described for removing the singularity and evaluating the expressions through the use of standard numerical methods for second order ordinary differential equations.", 2521 acknowledgement = ack-nhfb, 2522 classcodes = "C4170 (Differential equations)", 2523 corpsource = "Univ. Michigan, Ann Arbor, MI, USA", 2524 journalabr = "Commun ACM", 2525 keywords = "CACMA; differential equations; mathematics; numerical methods; quadrature; Y F", 2526 } 2527 2528 @Article{Kimble:1970:VGL, 2529 author = "G. W. Kimble", 2530 title = "A Variation of the {Goodman-Lance} Method for the Solution of Two-Point Boundary Value Problems", 2531 journal = j-CACM, 2532 volume = "13", 2533 number = "9", 2534 pages = "557--558", 2535 month = sep, 2536 year = "1970", 2537 CODEN = "CACMA2", 2538 ISSN = "0001-0782", 2539 MRclass = "65.62", 2540 MRnumber = "44\#3500", 2541 mrreviewer = "F. Odeh", 2542 bibdate = "Tue Mar 25 13:26:09 MST 1997", 2543 bibsource = "Compendex database", 2544 abstract = "A recently published method for the interpolative solution of nonlinear equations is improved, and applied to give a significant variation of the Goodman-Lance method for the solution of two-point boundary value problems. The resulting method applies in particular to the numerical solution of optimal control problems in the Euler-Lagrange formulation. Quantitative estimates are presented which indicate that the variation is nearly twice as fast on some problems in the latter context.", 2545 acknowledgement = ack-nhfb, 2546 classcodes = "C4170 (Differential equations)", 2547 corpsource = "Univ. Nevada, Reno, NV, USA", 2548 journalabr = "Commun ACM", 2549 keywords = "automatic control; boundary value problems; boundary-value problems; CACMA; differential equations; Goodman-Lance; interpolative solution; Newton's method; nonlinear equations; numerical methods; optimal control; optimization; ordinary differential equations; orthogonal matrices; secant method", 2550 keywords = "boundary-value problems; differential equations", 2551 } 2552 2553 @Article{Wilson:1970:OSA, 2554 author = "M. Wayne Wilson", 2555 title = "Optimal Starting Approximations for Generating Square Root for Slow or No Divide", 2556 journal = j-CACM, 2557 volume = "13", 2558 number = "9", 2559 pages = "559--561 (or 559--560??)", 2560 month = sep, 2561 year = "1970", 2562 CODEN = "CACMA2", 2563 ISSN = "0001-0782", 2564 MRclass = "65.50", 2565 MRnumber = "44\#2338", 2566 mrreviewer = "J. E. {Dennis, Jr.}", 2567 bibdate = "Tue Mar 25 13:26:09 MST 1997", 2568 bibsource = "Compendex database; garbo.uwasa.fi:/pc/doc-soft/fpbiblio.txt", 2569 abstract = "On computing machines with slow or no division, it is preferable to use an iterative scheme for the square root different from the classical Heron scheme. The problem of optimal initial approximants is considered, and some optimal polynomial initial approximations are tabulated.", 2570 acknowledgement = ack-nhfb, 2571 classcodes = "C5230 (Digital arithmetic methods)", 2572 corpsource = "IBM, Houston, TX, USA", 2573 journalabr = "Commun ACM", 2574 keywords = "CACMA; digital arithmetic; ele; iterative methods; mathematics; numerical methods; optimisation", 2575 } 2576 2577 @Article{Ehrlich:1970:CMI, 2578 author = "L. W. Ehrlich", 2579 title = "Complex Matrix Inversion Versus Real", 2580 journal = j-CACM, 2581 volume = "13", 2582 number = "9", 2583 pages = "561--562", 2584 month = sep, 2585 year = "1970", 2586 CODEN = "CACMA2", 2587 ISSN = "0001-0782", 2588 MRclass = "65.35", 2589 MRnumber = "44\#1196", 2590 mrreviewer = "C. G. Cullen", 2591 bibdate = "Tue Mar 25 13:26:09 MST 1997", 2592 bibsource = "Compendex database", 2593 abstract = "A comparison of complex matrix with real matrix inversion is made. It is shown that the complex inversion can be up to twice as fast as the real inversion. Further, the rounding error bound for complex inversion is about one-eighth that of real, for Gaussian elimination. Using extended inner product accumulation the bound is half of the real system.", 2594 acknowledgement = ack-nhfb, 2595 classcodes = "C4140 (Linear algebra)", 2596 corpsource = "Johns Hopkins Univ., Silver Spring, MD, USA", 2597 journalabr = "Commun ACM", 2598 keywords = "CACMA; complex matrix inversion; complex rounding error bounds; error bounds; GUL; inversion; mathematics; matrix algebra; matrix inversion; numerical methods; rounding error bound; rounding errors", 2599 } 2600 2601 @Article{vanEmden:1970:IEQ, 2602 author = "M. H. {van Emden}", 2603 title = "Increasing the Efficiency of Quicksort", 2604 journal = j-CACM, 2605 volume = "13", 2606 number = "9", 2607 pages = "563--567 (or 563--566??)", 2608 month = sep, 2609 year = "1970", 2610 CODEN = "CACMA2", 2611 ISSN = "0001-0782", 2612 bibdate = "Tue Mar 25 13:26:09 MST 1997", 2613 bibsource = "Compendex database", 2614 abstract = "The average asymptotic number of comparisons needed is shown to be $! n log_2 (n)$. A formula is derived expressing $!$ in terms of the probability distribution of the `bound' of a partition. Another generalization of quicksort is presented which uses a bounding interval instead of a single element as bound. This generalization turns out to be easy to implement in a computer program. A numerical approximation shows that $!$ equals 1.140 for this version of quicksort compared with 1.386 for the original. This implies a decrease in number of comparisons of 18\%; actual tests showed about 15\% saving in computing time.", 2615 acknowledgement = ack-nhfb, 2616 classcodes = "C6130 (Data handling techniques)", 2617 corpsource = "Math. Centre, Amsterdam, Netherlands", 2618 journalabr = "Commun ACM", 2619 keywords = "CACMA; computers; programming; SAL; sorting", 2620 } 2621 2622 @Article{Smith:1970:AAS, 2623 author = "Robert R. Smith and Dennis McCall", 2624 title = "{ACM} Algorithm 392: Systems of Hyperbolic {P.D.E.}", 2625 journal = j-CACM, 2626 volume = "13", 2627 number = "9", 2628 pages = "567--570", 2629 month = sep, 2630 year = "1970", 2631 CODEN = "CACMA2", 2632 ISSN = "0001-0782", 2633 bibdate = "Tue Mar 25 13:26:09 MST 1997", 2634 acknowledgement = ack-nhfb, 2635 classcodes = "C4170 (Differential equations); C7310 (Mathematics computing)", 2636 corpsource = "US Naval Electronics Lab. Center, San Diego, CA, USA", 2637 keywords = "boundary-value problems; partial differential equations", 2638 } 2639 2640 @Article{Abdali:1970:AAS, 2641 author = "S. K. Abdali", 2642 title = "{ACM} Algorithm 393: Special Series Summation with Arbitrary Precision", 2643 journal = j-CACM, 2644 volume = "13", 2645 number = "9", 2646 pages = "570--570", 2647 month = sep, 2648 year = "1970", 2649 CODEN = "CACMA2", 2650 ISSN = "0001-0782", 2651 bibdate = "Tue Mar 25 13:26:09 MST 1997", 2652 acknowledgement = ack-nhfb, 2653 classcodes = "C4120 (Functional analysis); C7310 (Mathematics computing)", 2654 corpsource = "Univ. Wisconsin, Madison, WI, USA", 2655 keywords = "function approximation; function evaluation; subroutines", 2656 } 2657 2658 @Article{Dial:1970:AAD, 2659 author = "R. B. Dial", 2660 title = "{ACM} Algorithm 394: Decision Table Translation", 2661 journal = j-CACM, 2662 volume = "13", 2663 number = "9", 2664 pages = "571--573 (or 571--572??)", 2665 month = sep, 2666 year = "1970", 2667 CODEN = "CACMA2", 2668 ISSN = "0001-0782", 2669 bibdate = "Tue Mar 25 13:26:09 MST 1997", 2670 acknowledgement = ack-nhfb, 2671 classcodes = "C6150C (Compilers, interpreters and other processors)", 2672 corpsource = "Univ. Washington, Seattle, WA, USA", 2673 keywords = "decision tables; program interpreters; subroutines", 2674 } 2675 2676 @Article{Lamport:1970:CBQ, 2677 author = "Leslie Lamport and J. R. Bell", 2678 title = "Comment on {Bell}'s Quadratic Quotient Method for Hash Code Searching", 2679 journal = j-CACM, 2680 volume = "13", 2681 number = "9", 2682 pages = "573--574", 2683 month = sep, 2684 year = "1970", 2685 CODEN = "CACMA2", 2686 ISSN = "0001-0782", 2687 bibdate = "Tue Mar 25 13:26:09 MST 1997", 2688 acknowledgement = ack-nhfb, 2689 classcodes = "C6130 (Data handling techniques)", 2690 keywords = "codes; data handling", 2691 } 2692 2693 @Article{Bavel:1970:NAS, 2694 author = "Z. Bavel", 2695 title = "On the Number of Automorphisms of a Singly Generated Automaton", 2696 journal = j-CACM, 2697 volume = "13", 2698 number = "9", 2699 pages = "574--575", 2700 month = sep, 2701 year = "1970", 2702 CODEN = "CACMA2", 2703 ISSN = "0001-0782", 2704 bibdate = "Tue Mar 25 13:26:09 MST 1997", 2705 acknowledgement = ack-nhfb, 2706 classcodes = "C4220 (Automata theory)", 2707 corpsource = "Univ. Kansas, Lawrence, KS, USA", 2708 keywords = "automata; automorphisms; finite automata; generators; length of state; minimal-length generators; orbit; singly generated automata", 2709 } 2710 2711 @Article{Woods:1970:TNG, 2712 author = "W. A. Woods", 2713 title = "Transition Network Grammars for Natural Language Analysis", 2714 journal = j-CACM, 2715 volume = "13", 2716 number = "10", 2717 pages = "591--606", 2718 month = oct, 2719 year = "1970", 2720 CODEN = "CACMA2", 2721 ISSN = "0001-0782", 2722 bibdate = "Tue Mar 25 13:26:09 MST 1997", 2723 bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Database/Graefe.bib", 2724 acknowledgement = ack-nhfb, 2725 classcodes = "C4210 (Formal logic); C7820 (Humanities computing)", 2726 corpsource = "Harvard Univ., Cambridge, MA, USA", 2727 keywords = "grammars; language translation and linguistics", 2728 } 2729 2730 @Article{Earley:1970:FTI, 2731 author = "J. Earley and H. Sturgis", 2732 title = "A formalism for translator interactions", 2733 journal = j-CACM, 2734 volume = "13", 2735 number = "10", 2736 pages = "607--617", 2737 month = oct, 2738 year = "1970", 2739 CODEN = "CACMA2", 2740 ISSN = "0001-0782", 2741 bibdate = "Tue Mar 25 13:26:09 MST 1997", 2742 bibsource = "Compendex database", 2743 abstract = "A formalism is presented for describing the actions of processors for programming languages-compilers, interpreters, assemblers-and their interactions in complex systems such as compiler-compilers or extendible languages. An algorithm is presented for deciding whether or not a given system can be produced from a given set of component processors.", 2744 acknowledgement = ack-nhfb, 2745 classcodes = "C4210 (Formal logic); C6150C (Compilers, interpreters and other processors)", 2746 corpsource = "Univ. California, Berkeley, CA, USA", 2747 journalabr = "Commun ACM", 2748 keywords = "CACMA; compilers; computational linguistics; computer, digital; computers, digital, languages; computers, digital, operating; pre; program; program assemblers; program interpreters; program processors; programming languages", 2749 } 2750 2751 @Article{Hill:1970:AASa, 2752 author = "G. W. Hill", 2753 title = "{ACM} Algorithm 395: {Student}'s $t$-Distribution", 2754 journal = j-CACM, 2755 volume = "13", 2756 number = "10", 2757 pages = "617--619", 2758 month = oct, 2759 year = "1970", 2760 CODEN = "CACMA2", 2761 ISSN = "0001-0782", 2762 bibdate = "Tue Mar 25 13:26:09 MST 1997", 2763 note = "See also \cite{Lozy:1979:RSD,Hill:1981:RSD}.", 2764 acknowledgement = ack-nhfb, 2765 classcodes = "C7310 (Mathematics computing)", 2766 corpsource = "CSIRO, Glen Osmond, Australia", 2767 keywords = "statistics; subroutines", 2768 } 2769 2770 @Article{Hill:1970:AASb, 2771 author = "G. W. Hill", 2772 title = "{ACM} Algorithm 396: {Student}'s $t$-Quantiles", 2773 journal = j-CACM, 2774 volume = "13", 2775 number = "10", 2776 pages = "619--620", 2777 month = oct, 2778 year = "1970", 2779 CODEN = "CACMA2", 2780 ISSN = "0001-0782", 2781 bibdate = "Tue Mar 25 13:26:09 MST 1997", 2782 note = "See also \cite{Hill:1981:RSQ}.", 2783 acknowledgement = ack-nhfb, 2784 classcodes = "C4120 (Functional analysis); C7310 (Mathematics computing)", 2785 corpsource = "CSIRO, Glen Osmond, Australia", 2786 keywords = "function evaluation; statistics; subroutines", 2787 } 2788 2789 @Article{Chang:1970:AAI, 2790 author = "S. K. Chang and A. Gill", 2791 title = "{ACM} Algorithm 397: An Integer Programming Problem", 2792 journal = j-CACM, 2793 volume = "13", 2794 number = "10", 2795 pages = "620--621", 2796 month = oct, 2797 year = "1970", 2798 CODEN = "CACMA2", 2799 ISSN = "0001-0782", 2800 bibdate = "Tue Mar 25 13:26:09 MST 1997", 2801 acknowledgement = ack-nhfb, 2802 classcodes = "C7310 (Mathematics computing)", 2803 corpsource = "Univ. California, Berkeley, CA, USA", 2804 keywords = "integer programming; subroutines", 2805 } 2806 2807 @Article{Stone:1970:AAT, 2808 author = "R. A. Stone", 2809 title = "{ACM} Algorithm 398: Tableless Date Conversion", 2810 journal = j-CACM, 2811 volume = "13", 2812 number = "10", 2813 pages = "621--621", 2814 month = oct, 2815 year = "1970", 2816 CODEN = "CACMA2", 2817 ISSN = "0001-0782", 2818 bibdate = "Tue Mar 25 13:26:09 MST 1997", 2819 acknowledgement = ack-nhfb, 2820 classcodes = "C6130 (Data handling techniques)", 2821 corpsource = "Western Electric Co., Princeton, NJ, USA", 2822 keywords = "code convertors; subroutines", 2823 } 2824 2825 @Article{Seppanen:1970:AAS, 2826 author = "J. J. Sepp{\"{a}}nen", 2827 title = "{ACM} Algorithm 399: Spanning Tree", 2828 journal = j-CACM, 2829 volume = "13", 2830 number = "10", 2831 pages = "621--622", 2832 month = oct, 2833 year = "1970", 2834 CODEN = "CACMA2", 2835 ISSN = "0001-0782", 2836 bibdate = "Tue Mar 25 13:26:09 MST 1997", 2837 acknowledgement = ack-nhfb, 2838 classcodes = "C7310 (Mathematics computing)", 2839 corpsource = "Helsinki Univ. Technol., Otaniemi, Finland", 2840 keywords = "graph theory; subroutines; trees (mathematics)", 2841 } 2842 2843 @Article{Wallick:1970:AAM, 2844 author = "G. C. Wallick", 2845 title = "{ACM} Algorithm 400: Modified {Havie} Integration", 2846 journal = j-CACM, 2847 volume = "13", 2848 number = "10", 2849 pages = "622--624", 2850 month = oct, 2851 year = "1970", 2852 CODEN = "CACMA2", 2853 ISSN = "0001-0782", 2854 bibdate = "Tue Mar 25 13:26:09 MST 1997", 2855 acknowledgement = ack-nhfb, 2856 classcodes = "C4160 (Numerical integration and differentiation); C7310 (Mathematics computing)", 2857 corpsource = "Mobil Res. Dev. Corp., Dallas, TX, USA", 2858 keywords = "integration; subroutines", 2859 } 2860 2861 @Article{Peto:1970:RAM, 2862 author = "R. Peto", 2863 title = "Remark on {``Algorithm 347 [M1]: An Efficient Algorithm for Sorting with Minimal Storage''}", 2864 journal = j-CACM, 2865 volume = "13", 2866 number = "10", 2867 pages = "624", 2868 month = oct, 2869 year = "1970", 2870 CODEN = "CACMA2", 2871 ISSN = "0001-0782", 2872 bibdate = "Tue May 28 09:23:57 1996", 2873 keywords = "digital computer sorting; minimal storage sorting; ranking; sorting", 2874 } 2875 2876 @Article{Smith:1970:UIG, 2877 author = "L. B. Smith", 2878 title = "The use of interactive graphics to solve numerical problems", 2879 journal = j-CACM, 2880 volume = "13", 2881 number = "10", 2882 pages = "625--634", 2883 month = oct, 2884 year = "1970", 2885 CODEN = "CACMA2", 2886 ISSN = "0001-0782", 2887 bibdate = "Tue Mar 25 13:26:09 MST 1997", 2888 acknowledgement = ack-nhfb, 2889 classcodes = "C4130 (Interpolation and function approximation); C7310 (Mathematics computing)", 2890 corpsource = "CERN, Geneva, Switzerland", 2891 keywords = "analysis; computer graphics; least squares approximations; numerical; online operation", 2892 } 2893 2894 @Article{LaFata:1970:IDA, 2895 author = "P. LaFata and J. B. Rosen", 2896 title = "An interactive display for approximation by linear programming", 2897 journal = j-CACM, 2898 volume = "13", 2899 number = "11", 2900 pages = "651--659", 2901 month = nov, 2902 year = "1970", 2903 CODEN = "CACMA2", 2904 ISSN = "0001-0782", 2905 MRclass = "68.00 (90.00)", 2906 MRnumber = "42\#2712", 2907 bibdate = "Tue Mar 25 13:26:09 MST 1997", 2908 abstract = "An interactive program with a graphical display has been developed for the approximation of data by means of a linear combination of functions (including splines) selected by the user. The coefficients of the approximation are determined by linear programming so as to minimize the error in either the L1 or L-infinity norm. Auxiliary conditions such as monotonicity or convexity of the approximation can also be imposed. This interactive system is described and several examples of its use are given.", 2909 acknowledgement = ack-nhfb, 2910 classcodes = "C4130 (Interpolation and function approximation); C7310 (Mathematics computing)", 2911 corpsource = "Univ. Wisconsin, Madison, WI, USA", 2912 keywords = "approximation; data fitting; function approximation; functional approximation; interactive graphical display; linear programming; online operation; spline functions", 2913 } 2914 2915 @Article{Lum:1970:MRC, 2916 author = "V. Y. Lum", 2917 title = "Multi-attribute retrieval with combined indexes", 2918 journal = j-CACM, 2919 volume = "13", 2920 number = "11", 2921 pages = "660--665", 2922 month = nov, 2923 year = "1970", 2924 CODEN = "CACMA2", 2925 ISSN = "0001-0782", 2926 bibdate = "Tue Mar 25 13:26:09 MST 1997", 2927 acknowledgement = ack-nhfb, 2928 classcodes = "C6120 (File organisation); C7250 (Information storage and retrieval)", 2929 corpsource = "IBM, San Jose, CA, USA", 2930 keywords = "file organisation; information retrieval", 2931 } 2932 2933 @Article{Mifsud:1970:MDA, 2934 author = "C. J. Mifsud", 2935 title = "A multiple-precision division algorithm", 2936 journal = j-CACM, 2937 volume = "13", 2938 number = "11", 2939 pages = "666--668", 2940 month = nov, 2941 year = "1970", 2942 CODEN = "CACMA2", 2943 ISSN = "0001-0782", 2944 bibdate = "Tue Mar 25 13:26:09 MST 1997", 2945 acknowledgement = ack-nhfb, 2946 classcodes = "C5230 (Digital arithmetic methods)", 2947 corpsource = "Mitre Corp., McLean, VA, USA", 2948 keywords = "digital arithmetic", 2949 } 2950 2951 @Article{Conrow:1970:NPS, 2952 author = "K. Conrow and R. G. Smith", 2953 title = "{NEATER2}: {A PL/I} Source Statement Reformatter", 2954 journal = j-CACM, 2955 volume = "13", 2956 number = "11", 2957 pages = "669--675", 2958 month = nov, 2959 year = "1970", 2960 CODEN = "CACMA2", 2961 ISSN = "0001-0782", 2962 bibdate = "Tue Mar 25 13:26:09 MST 1997", 2963 abstract = "NEATER2 accepts a PL/I source program and operates on it to produce a reformatted version. When in the LOGICAL mode, NEATER2 indicates the logical structure of the source program in the indentation pattern of its output. Logic errors discovered through NEATER2 logical analysis are discovered much more economically than is possible through compilation and trial runs. A number of options are available to give the user full control over the output format and to maximize the utility of NEATER2 as an aid during the early stages of development of a PL/I source deck. One option, USAGE, causes NEATER2 to insert into each logical unit of coding a statement which will case the number of times each one is executed to be recorded during execution. This feature is expected to provide a major aid in optimization of PL/I programs.", 2964 acknowledgement = ack-nhfb, 2965 classcodes = "C6150C (Compilers, interpreters and other processors)", 2966 corpsource = "Kansas State Univ., Manhattan, KS, USA", 2967 keywords = "documentation aid; execution time usage data; logical analysis of PL/I source; optimisation; PL/1; prettyprinter; program processors; reformatting of PL/I source", 2968 } 2969 2970 @Article{Bell:1970:LQH, 2971 author = "James R. Bell and Charles H. Kaman", 2972 title = "The Linear Quotient Hash Code", 2973 journal = j-CACM, 2974 volume = "13", 2975 number = "11", 2976 pages = "675--677", 2977 month = nov, 2978 year = "1970", 2979 CODEN = "CACMA2", 2980 ISSN = "0001-0782", 2981 bibdate = "Tue Mar 25 13:26:09 MST 1997", 2982 note = "Independent discovery of technique of secondary hash functions first proposed by \cite{deBalbine:1969:CAR}.", 2983 acknowledgement = ack-nhfb, 2984 classcodes = "C6130 (Data handling techniques)", 2985 corpsource = "Digital Equipment Corp., Maynard, MA, USA", 2986 keywords = "codes", 2987 } 2988 2989 @Article{Cheney:1970:NLC, 2990 author = "C. J. Cheney", 2991 title = "A Nonrecursive List Compacting Algorithm", 2992 journal = j-CACM, 2993 volume = "13", 2994 number = "11", 2995 pages = "677--678", 2996 month = nov, 2997 year = "1970", 2998 CODEN = "CACMA2", 2999 ISSN = "0001-0782", 3000 bibdate = "Tue Mar 25 13:26:09 MST 1997", 3001 bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Compiler/garbage.collection.bib", 3002 acknowledgement = ack-nhfb, 3003 classcodes = "C6120 (File organisation)", 3004 corpsource = "Univ. Cambridge, UK", 3005 keywords = "data structures; list processing; storage management", 3006 } 3007 3008 @Article{Anonymous:1970:PANa, 3009 author = "Anonymous", 3010 title = "Proposed {American National Standard}. Recorded magnetic tape for information interchange (1600 {CPI}, phase encoded)", 3011 journal = j-CACM, 3012 volume = "13", 3013 number = "11", 3014 pages = "679--685", 3015 month = nov, 3016 year = "1970", 3017 CODEN = "CACMA2", 3018 ISSN = "0001-0782", 3019 bibdate = "Tue Mar 25 13:26:09 MST 1997", 3020 acknowledgement = ack-nhfb, 3021 classcodes = "C5320C (Storage on moving magnetic media)", 3022 keywords = "magnetic recording; standards", 3023 } 3024 3025 @Article{Anonymous:1970:PANb, 3026 author = "Anonymous", 3027 title = "Proposed {American National Standard}. Unrecorded magnetic tape for information interchange (9 track-200 and 800 {CPI}, {NRZI} and 1600 {CPI}, {P.E.})", 3028 journal = j-CACM, 3029 volume = "13", 3030 number = "11", 3031 pages = "686--692", 3032 month = nov, 3033 year = "1970", 3034 CODEN = "CACMA2", 3035 ISSN = "0001-0782", 3036 bibdate = "Tue Mar 25 13:26:09 MST 1997", 3037 acknowledgement = ack-nhfb, 3038 classcodes = "C5320C (Storage on moving magnetic media)", 3039 keywords = "magnetic recording; standards", 3040 } 3041 3042 @Article{Bratley:1970:AAI, 3043 author = "P. Bratley", 3044 title = "{ACM} Algorithm 401: An Improved Algorithm to Produce Complex Primes", 3045 journal = j-CACM, 3046 volume = "13", 3047 number = "11", 3048 pages = "693--693", 3049 month = nov, 3050 year = "1970", 3051 CODEN = "CACMA2", 3052 ISSN = "0001-0782", 3053 bibdate = "Tue Mar 25 13:26:09 MST 1997", 3054 acknowledgement = ack-nhfb, 3055 classcodes = "C7310 (Mathematics computing)", 3056 corpsource = "Univ. Montreal, Que., Canada", 3057 keywords = "number theory; subroutines", 3058 } 3059 3060 @Article{vanEmden:1970:AAI, 3061 author = "M. H. {van Emden}", 3062 title = "{ACM} Algorithm 402: Increasing the Efficiency of Quicksort", 3063 journal = j-CACM, 3064 volume = "13", 3065 number = "11", 3066 pages = "693--694", 3067 month = nov, 3068 year = "1970", 3069 CODEN = "CACMA2", 3070 ISSN = "0001-0782", 3071 bibdate = "Tue Mar 25 13:26:09 MST 1997", 3072 acknowledgement = ack-nhfb, 3073 classcodes = "C6130 (Data handling techniques)", 3074 corpsource = "Math. Centre, Amsterdam, Netherlands", 3075 keywords = "sorting; subroutines", 3076 } 3077 3078 @Article{Wilson:1970:GMG, 3079 author = "W. J. Wilson", 3080 title = "A generalized method for generating argument\slash function values", 3081 journal = j-CACM, 3082 volume = "13", 3083 number = "11", 3084 pages = "696--697", 3085 month = nov, 3086 year = "1970", 3087 CODEN = "CACMA2", 3088 ISSN = "0001-0782", 3089 bibdate = "Tue Mar 25 13:26:09 MST 1997", 3090 acknowledgement = ack-nhfb, 3091 classcodes = "C6110 (Systems analysis and programming)", 3092 corpsource = "Univac Div. Sperry Rand, Huntsville, AL, USA", 3093 keywords = "decision tables; table lookup", 3094 } 3095 3096 @Article{Ehrman:1970:CAC, 3097 author = "J. R. Ehrman", 3098 title = "Correction to 'logical' arithmetic on computers with two's complement binary arithmetic", 3099 journal = j-CACM, 3100 volume = "13", 3101 number = "11", 3102 pages = "697--698", 3103 month = nov, 3104 year = "1970", 3105 CODEN = "CACMA2", 3106 ISSN = "0001-0782", 3107 bibdate = "Tue Mar 25 13:26:09 MST 1997", 3108 acknowledgement = ack-nhfb, 3109 classcodes = "C5230 (Digital arithmetic methods)", 3110 corpsource = "Stanford Linear Accelerator Center, CA, USA", 3111 keywords = "digital arithmetic", 3112 } 3113 3114 @Article{Bernstein:1970:CWS, 3115 author = "A. Bernstein", 3116 title = "Comment on the working set model for program behavior", 3117 journal = j-CACM, 3118 volume = "13", 3119 number = "11", 3120 pages = "698--699", 3121 month = nov, 3122 year = "1970", 3123 CODEN = "CACMA2", 3124 ISSN = "0001-0782", 3125 bibdate = "Tue Mar 25 13:26:09 MST 1997", 3126 acknowledgement = ack-nhfb, 3127 classcodes = "C6120 (File organisation)", 3128 corpsource = "State Univ. New York, Stony Brook, NY, USA", 3129 keywords = "storage management", 3130 } 3131 3132 @Article{Rokne:1970:CNP, 3133 author = "J. Rokne", 3134 title = "Condition numbers of {Pei} matrices", 3135 journal = j-CACM, 3136 volume = "13", 3137 number = "11", 3138 pages = "699--699", 3139 month = nov, 3140 year = "1970", 3141 CODEN = "CACMA2", 3142 ISSN = "0001-0782", 3143 bibdate = "Tue Mar 25 13:26:09 MST 1997", 3144 acknowledgement = ack-nhfb, 3145 classcodes = "C4140 (Linear algebra)", 3146 corpsource = "Univ. Calgary, Alta., Canada", 3147 keywords = "matrix algebra", 3148 } 3149 3150 @Article{Mathews:1970:GPC, 3151 author = "M. V. Mathews and F. R. Moore", 3152 title = "{GROOVE-A} program to compose, store, and edit functions of time", 3153 journal = j-CACM, 3154 volume = "13", 3155 number = "12", 3156 pages = "715--721", 3157 month = dec, 3158 year = "1970", 3159 CODEN = "CACMA2", 3160 ISSN = "0001-0782", 3161 bibdate = "Tue Mar 25 13:26:09 MST 1997", 3162 acknowledgement = ack-nhfb, 3163 classcodes = "C7420 (Control engineering computing); C7820 (Humanities computing)", 3164 corpsource = "Bell Telephone Labs., Murray Hill, NJ, USA", 3165 keywords = "compose store, edit, time functions; computer music; computers; conductor program; control engineering applications of computers; digital control; GROOVE; hybrid; hybrid systems; interactive software; luminescence; man computer system; man-machine systems; periodic functions; real-time; real-time control; sampled data systems; systems", 3166 treatment = "P Practical", 3167 } 3168 3169 @Article{Tiernan:1970:ESA, 3170 author = "James C. Tiernan", 3171 title = "An Efficient Search Algorithm to Find the Elementary Circuits of a Graph", 3172 journal = j-CACM, 3173 volume = "13", 3174 number = "12", 3175 pages = "722--726", 3176 month = dec, 3177 year = "1970", 3178 CODEN = "CACMA2", 3179 ISSN = "0001-0782", 3180 MRclass = "94.30 (05.00)", 3181 MRnumber = "42\#7427", 3182 mrreviewer = "J. Mor{\'a}vek", 3183 bibdate = "Tue Mar 25 13:26:09 MST 1997", 3184 abstract = "A theoretically most efficient search algorithm is presented which uses an exhaustive search to find all of the elementary circuits of a graph. The algorithm can be easily modified to find all of the elementary circuits with a particular attribute such as length. A rigorous proof of the algorithm is given as well as an example of its application. Empirical bounds are presented relating the speed of the algorithm to the number of vertices and the number of arcs. The speed is also related to the number of circuits in the graph to give a relation between speed and complexity. Extensions to undirected and s-graphs are discussed.", 3185 acknowledgement = ack-nhfb, 3186 classcodes = "B0250 (Combinatorial mathematics); C1160 (Combinatorial mathematics)", 3187 corpsource = "Univ. California, San Diego, La Jolla, CA, USA", 3188 keywords = "algorithm; circuit search algorithm; elementary circuits; graph theory; path search; path search algorithm; searching", 3189 treatment = "T Theoretical or Mathematical", 3190 } 3191 3192 @Article{Betourne:1970:PMR, 3193 author = "C. Betourne and J. Boulenger and J. Ferrie and C. Kaiser and S. Krakowiak and J. Mossiere", 3194 title = "Process management and resource sharing in the multiaccess system {ESOPE}", 3195 journal = j-CACM, 3196 volume = "13", 3197 number = "12", 3198 pages = "727--733", 3199 month = dec, 3200 year = "1970", 3201 CODEN = "CACMA2", 3202 ISSN = "0001-0782", 3203 bibdate = "Tue Mar 25 13:26:09 MST 1997", 3204 acknowledgement = ack-nhfb, 3205 classcodes = "C6150J (Operating systems)", 3206 keywords = "ESOPE; multi-access systems; multiprogramming; parallel processes; parallel processing; primitive operations; process scheduling; programs; resource allocation; system; time sharing system; time-sharing", 3207 treatment = "P Practical", 3208 } 3209 3210 @Article{Morgan:1970:IBO, 3211 author = "H. L. Morgan", 3212 title = "An interrupt based organization for management information systems", 3213 journal = j-CACM, 3214 volume = "13", 3215 number = "12", 3216 pages = "734--739", 3217 month = dec, 3218 year = "1970", 3219 CODEN = "CACMA2", 3220 ISSN = "0001-0782", 3221 bibdate = "Tue Mar 25 13:26:09 MST 1997", 3222 acknowledgement = ack-nhfb, 3223 classcodes = "C6130 (Data handling techniques); C6150J (Operating systems)", 3224 corpsource = "Cornell Univ., Ithaca, NY, USA", 3225 keywords = "data handling; integrated data processing; interrupt scheduling; management information systems; monitoring; parallel; parallel processing; processing; supervisory programs; supervisory systems; systems", 3226 } 3227 3228 @Article{Thompson:1970:IRR, 3229 author = "R. J. Thompson", 3230 title = "Improving round-off in {Runge-Kutta} computations with {Gill}'s method", 3231 journal = j-CACM, 3232 volume = "13", 3233 number = "12", 3234 pages = "739--740", 3235 month = dec, 3236 year = "1970", 3237 CODEN = "CACMA2", 3238 ISSN = "0001-0782", 3239 bibdate = "Tue Mar 25 13:26:09 MST 1997", 3240 acknowledgement = ack-nhfb, 3241 classcodes = "C4170 (Differential equations)", 3242 corpsource = "Sandia Labs., Albuquerque, NM, USA", 3243 keywords = "differential equations; error analysis; methods; numerical mathematics; ordinary differential equations; predictor-corrector; round-off error; Runge-Kutta-Gill methods", 3244 treatment = "T Theoretical or Mathematical", 3245 } 3246 3247 @Article{Shapiro:1970:LSG, 3248 author = "S. C. Shapiro", 3249 title = "The list set generator: a construct for evaluating set expressions", 3250 journal = j-CACM, 3251 volume = "13", 3252 number = "12", 3253 pages = "741--744", 3254 month = dec, 3255 year = "1970", 3256 CODEN = "CACMA2", 3257 ISSN = "0001-0782", 3258 bibdate = "Tue Mar 25 13:26:09 MST 1997", 3259 acknowledgement = ack-nhfb, 3260 classcodes = "C6130 (Data handling techniques)", 3261 corpsource = "Univ. Wisconsin, Madison, WI, USA", 3262 keywords = "construct; file; list processing; processing; programming; programming techniques; set generation; set manipulating", 3263 treatment = "T Theoretical or Mathematical", 3264 } 3265 3266 @Article{Black:1970:OMM, 3267 author = "N. A. Black", 3268 title = "Optimum Merging from Mass Storage", 3269 journal = j-CACM, 3270 volume = "13", 3271 number = "12", 3272 pages = "745--749", 3273 month = dec, 3274 year = "1970", 3275 CODEN = "CACMA2", 3276 ISSN = "0001-0782", 3277 bibdate = "Tue Mar 25 13:26:09 MST 1997", 3278 acknowledgement = ack-nhfb, 3279 classcodes = "C6130 (Data handling techniques)", 3280 corpsource = "Computer Sci. Corp., Huntsville, AL, USA", 3281 keywords = "access time; drum merging; magnetic storage systems; mass storage; merging; optimisation; optimum merging; sort timing; sorting", 3282 treatment = "T Theoretical or Mathematical", 3283 } 3284 3285 @Article{Stewart:1970:EAA, 3286 author = "G. W. Stewart", 3287 title = "Errata: {ACM} Algorithm 384: Eigenvalues and Eigenvectors of a Real Symmetric Matrix [{F2}]", 3288 journal = j-CACM, 3289 volume = "13", 3290 number = "12", 3291 pages = "750--750", 3292 month = dec, 3293 year = "1970", 3294 CODEN = "CACMA2", 3295 ISSN = "0001-0782", 3296 bibdate = "Tue May 28 18:42:33 1996", 3297 note = "See \cite{Stewart:1970:AAE}.", 3298 keywords = "eigenvalues; eigenvectors; QR algorithm; real symmetric matrix", 3299 kwds = "nla, eig, QR algorithm, symmetric matrix", 3300 xxnote = "Check title??", 3301 } 3302 3303 @Article{Fuchs:1970:EDR, 3304 author = "E. A. Fuchs and P. E. Jackson", 3305 title = "Estimates of Distributions of Random Variables for Certain Computer Communications Traffic Models", 3306 journal = j-CACM, 3307 volume = "13", 3308 number = "12", 3309 pages = "752--757", 3310 month = dec, 3311 year = "1970", 3312 CODEN = "CACMA2", 3313 ISSN = "0001-0782", 3314 bibdate = "Tue Mar 25 13:26:09 MST 1997", 3315 bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Distributed/network.bib and ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1970.bib", 3316 note = "Reproduced in Advances in Computer Commun., Chu, W. W., (Ed (1974), 2-7; in Computer Commun., Green, P. E., and Lucky, R. W. (Eds.), (1975), 577-582).", 3317 abstract = "A study of multiaccess computer communications has characterized the distributions underlying an elementary model of the user-computer interactive process. The model used is elementary in the sense that many of the random variables that generally are of interest in computer communications studies can be decomposed into the elements of this model. Data were examined from four operational multiaccess systems, and the model is shown to be robust; that is each of the variables of the model has the same distribution independent of which of the four systems is being examined. It is shown that the gamma distribution can be used to describe the discrete variables. Approximations to the gamma distribution by the exponential distribution are discussed for the systems studied.", 3318 acknowledgement = ack-nhfb, 3319 classcodes = "C4290 (Other computer theory)", 3320 corpsource = "Bell Telephone Labs. Inc., Holmdel, NJ, USA", 3321 descriptors = "Random Process; Computer Communication; Traffic Model; Distribution; Estimation;", 3322 keywords = "computation theory; computer communications; distribution of random variables; modelling; multi-access systems; multiaccess systems; operating systems; operating systems (computers); optimisation models; optimization models; time-sharing; time-sharing systems; user computer interactive processes", 3323 treatment = "T Theoretical or Mathematical", 3324 } 3325 3326 @Article{Pinter:1970:DBF, 3327 author = "C. C. Pinter", 3328 title = "On decomposing a {Boolean} function and simplifying the components separately", 3329 journal = j-CACM, 3330 volume = "13", 3331 number = "12", 3332 pages = "758--758", 3333 month = dec, 3334 year = "1970", 3335 CODEN = "CACMA2", 3336 ISSN = "0001-0782", 3337 bibdate = "Tue Mar 25 13:26:09 MST 1997", 3338 acknowledgement = ack-nhfb, 3339 classcodes = "C4230 (Switching theory)", 3340 corpsource = "Bucknell Univ., Lewisburg, PA, USA", 3341 keywords = "basic cells; Boolean functions; minimisation; minimisation of switching nets; of Boolean functions; prime implicants; simplification; vertices", 3342 treatment = "T Theoretical or Mathematical", 3343 } 3344 3345 @Article{Raduchel:1970:EHB, 3346 author = "W. J. Raduchel", 3347 title = "Efficient handling of binary data", 3348 journal = j-CACM, 3349 volume = "13", 3350 number = "12", 3351 pages = "758--759", 3352 month = dec, 3353 year = "1970", 3354 CODEN = "CACMA2", 3355 ISSN = "0001-0782", 3356 bibdate = "Tue Mar 25 13:26:09 MST 1997", 3357 acknowledgement = ack-nhfb, 3358 classcodes = "C6130 (Data handling techniques)", 3359 corpsource = "Harvard Univ., Cambridge, MA, USA", 3360 keywords = "binary variables; bit strings; cross-; data handling; dummy variables; efficiency; programming; programming techniques; tabulations", 3361 treatment = "T Theoretical or Mathematical", 3362 } 3363 3364 @Article{Wagner:1970:FAI, 3365 author = "Robert A. Wagner", 3366 title = "Finiteness Assumptions and Intellectual Isolation of Computer Scientists", 3367 journal = j-CACM, 3368 volume = "13", 3369 number = "12", 3370 pages = "759--760", 3371 month = dec, 3372 year = "1970", 3373 CODEN = "CACMA2", 3374 ISSN = "0001-0782", 3375 bibdate = "Tue Mar 25 13:26:09 MST 1997", 3376 acknowledgement = ack-nhfb, 3377 classcodes = "C0200 (General computer topics)", 3378 corpsource = "Cornell Univ., Ithaca, NY, USA", 3379 keywords = "ALGOL versus FORTRAN; Algol vs. Fortran; finite; finite word size; finiteness assumptions; integer variable range; intellectual; intellectual isolation; isolation; memory finiteness; personnel; philosophical aspects; word size", 3380 } 3381 3382 @Article{Lowry:1971:OCO, 3383 author = "E. Lowry and C. W. Medlock", 3384 title = "Object Code Optimization", 3385 journal = j-CACM, 3386 volume = "12", 3387 number = "1", 3388 pages = "13--22", 3389 month = jan, 3390 year = "1971", 3391 CODEN = "CACMA2", 3392 ISSN = "0001-0782", 3393 bibdate = "Tue Dec 26 16:35:14 1995", 3394 bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Compiler/opt.compiler.bib", 3395 } 3396 3397 @Article{Hammer:1971:SSC, 3398 author = "Carl Hammer", 3399 title = "Signature Simulation and Certain Cryptographic Codes", 3400 journal = j-CACM, 3401 volume = "14", 3402 number = "1", 3403 pages = "3--14", 3404 month = jan, 3405 year = "1971", 3406 CODEN = "CACMA2", 3407 ISSN = "0001-0782", 3408 bibdate = "Tue Mar 25 13:26:09 MST 1997", 3409 abstract = "Three cyphers allegedly authored by Thomas Jefferson Beale in 1822 have been the subject of intensive study for over 100 years. Generations of cryptanalysts have expended untold man-years, thus far without success, attempting tode code them; vast armies of fortune hunters and treasure seekers have devoted Herculean labors to digging up the rolling hills of Virginia trying to locate the promised bonanza. \par The history of pertinent activities would fill volumes, yet serious students of cryptography have always had nagging doubts about the cyphers' authenticity. It has been alleged that the ``known solution'' to Cypher Number Two: 115, 73, 24, 818, 37, 52, 49, \ldots{} (``I have deposited in the County of Bedford about four miles from Buford's in an excavation or vault \ldots{}'') with the aid of an unsanitized version of the Declaration of Independence was merely a superb, imaginative, and grandiose hoax perpetrated ages ago for whatever reasons. Modern computer technology could obviously perform signature analyses the process of encoding itself so as to yield new clues and deeper insights into their construction. For the benefit of the uninitiated, the encoding method used in the second cypher employs a specified document whose words are simply numbered consecutively, and first letters of these words are sought out at random to match the letters of these words are sought out at random to match the letters of the clear text or message. \par The sequence of numbers corresponding to these matches is then written down as the final code. While primitive, the process has the advantage of relative security until the source document becomes known; at that moment the cypher can be decoded even by second graders. The work now completed with the help of our UNIVAC 1108 includes numerous analytical studies of the Beale cyphers and various types of simulations. \par For example, we have turned the entire process of simulated encoding by various schemes over to the machine and analyzed the signatures of these synthetic codes; we have also encoded various messages by hand, using different texts and a variety of methods to obtain their signatures. These simulations provide convincing evidence that the signatures are both process and data dependent; they indicate also very strongly that Mr. Beale's cyphers are for real and that it is merely a matter of time before someone finds the correct source document and locates the right vault in the common-wealth of Virginia.", 3410 acknowledgement = ack-nhfb, 3411 classcodes = "B6120B (Codes); C6130 (Data handling techniques)", 3412 keywords = "Beale Cyphers codes; codes; computer applications; computer signature simulation; cryptanalysis; cyphers; Declaration of Independence; decoding; encoding; Magna Carta; numerical cryptographic codes; pseudotext; results analysis; signature; simulation; Thomas Jefferson Beale; treasure site identification", 3413 treatment = "A Application", 3414 } 3415 3416 @Article{Klinger:1971:PWA, 3417 author = "A. Klinger", 3418 title = "Pattern width at a given angle", 3419 journal = j-CACM, 3420 volume = "14", 3421 number = "1", 3422 pages = "15--20", 3423 month = jan, 3424 year = "1971", 3425 CODEN = "CACMA2", 3426 ISSN = "0001-0782", 3427 bibdate = "Tue Mar 25 13:26:09 MST 1997", 3428 acknowledgement = ack-nhfb, 3429 classcodes = "B6140C (Optical information, image and video signal processing); C1250 (Pattern recognition)", 3430 corpsource = "Univ. California, Los Angeles, CA, USA", 3431 keywords = "extent integral projections; feature extraction; figure properties; functions; geometrical concept; integral geometry; linear pattern measures; pattern recognition; picture processing; width; width at angle; word description", 3432 treatment = "T Theoretical or Mathematical", 3433 } 3434 3435 @Article{Chang:1971:RBP, 3436 author = "Shi-Kuo Chang", 3437 title = "The Reconstruction of Binary Patterns from Their Projections", 3438 journal = j-CACM, 3439 volume = "14", 3440 number = "1", 3441 pages = "21--25", 3442 month = jan, 3443 year = "1971", 3444 CODEN = "CACMA2", 3445 ISSN = "0001-0782", 3446 MRclass = "68.00", 3447 MRnumber = "44\#2379", 3448 mrreviewer = "G. D. Chakerian", 3449 bibdate = "Tue Mar 25 13:26:09 MST 1997", 3450 bibsource = "Compendex database", 3451 abstract = "Given the horizontal and vertical projections of a finite binary pattern $f$, can we construct the original pattern $f$? In this paper we give a characterization of patterns that are reconstructible from their projection. Three algorithms are developed to reconstruct both unambiguous and ambiguous patterns. It is shown that an unambiguous pattern can be perfectly reconstructed in time $m \times n$ and that a pattern similar to an ambiguous pattern can also be constructed in time $m \times n$, where $m$, $n$ are the dimensions of the pattern frame.", 3452 acknowledgement = ack-nhfb, 3453 classcodes = "B6140C (Optical information, image and video signal processing); C1250 (Pattern recognition)", 3454 corpsource = "IBM, Yorktown Heights, NY, USA", 3455 journalabr = "Commun ACM", 3456 keywords = "ATI; CACMA; computers, digital; data compression; finite binary pattern; image reconstruction; integral geometry; original pattern reconstruction; pattern frame dimensions; pattern recognition; pattern recognition systems; pattern reconstruction", 3457 treatment = "T Theoretical or Mathematical", 3458 } 3459 3460 @Article{Bracchi:1971:LTG, 3461 author = "G. Bracchi and D. Ferrari", 3462 title = "Language for Treating Geometric Patterns in a Two-Dimensional Space", 3463 journal = j-CACM, 3464 volume = "14", 3465 number = "1", 3466 pages = "26--32", 3467 month = jan, 3468 year = "1971", 3469 CODEN = "CACMA2", 3470 ISSN = "0001-0782", 3471 bibdate = "Tue Mar 25 13:26:09 MST 1997", 3472 bibsource = "Compendex database", 3473 abstract = "In this paper CADEP, a problem-oriented language for positioning geometric patterns in a two-dimensional space, is presented. Although the language has been specifically designed for the automatic generation of integrated circuit masks, it turns out to be well suited also for such other placement problems as architecture design, urban planning, logical and block diagram representation.", 3474 acknowledgement = ack-nhfb, 3475 classcodes = "C6140D (High level languages)", 3476 corpsource = "Politecnico Milano, Italy", 3477 journalabr = "Commun ACM", 3478 keywords = "2-dimensional space; architecture design; automation; block diagrams; CACMA; CADEP; computers, digital; computers, digital, pattern re; Fortran; Fortran extension; generation; geometric patterns; graphic; graphic displays; integrated circuit masks; integrated circuits; language; languages; layout problems; logic diagrams representation; pattern recognition; pattern recognition systems; planning; positioning; problem oriented language; problem oriented languages; urban; urban planning", 3479 treatment = "T Theoretical or Mathematical", 3480 } 3481 3482 @Article{Broucke:1971:CRN, 3483 author = "R. A. Broucke", 3484 title = "Construction of rational and negative powers of a formal series", 3485 journal = j-CACM, 3486 volume = "14", 3487 number = "1", 3488 pages = "32--35", 3489 month = jan, 3490 year = "1971", 3491 CODEN = "CACMA2", 3492 ISSN = "0001-0782", 3493 bibdate = "Tue Mar 25 13:26:09 MST 1997", 3494 acknowledgement = ack-nhfb, 3495 classcodes = "C4130 (Interpolation and function approximation)", 3496 corpsource = "Univ. California, Los Angeles, CA, USA", 3497 keywords = "binomial; Chebyshev approximation; Chebyshev series; construction; convergence; convergence of numerical methods; Fourier series; inversion; iterative methods; Newton iterations; Poisson's; rational negative power; root extraction; series; series expansion; theorem", 3498 treatment = "T Theoretical or Mathematical", 3499 } 3500 3501 @Article{Holt:1971:CPS, 3502 author = "R. C. Holt", 3503 title = "Comments on Prevention of System Deadlocks", 3504 journal = j-CACM, 3505 volume = "14", 3506 number = "1", 3507 pages = "36--38", 3508 month = jan, 3509 year = "1971", 3510 CODEN = "CACMA2", 3511 ISSN = "0001-0782", 3512 bibdate = "Tue Mar 25 13:26:09 MST 1997", 3513 bibsource = "Compendex database", 3514 abstract = "A. N. Habermann's method of deadlock prevention is discussed, where deadlock is defined as a system state from which resource allocations to certain processes are not possible. It is shown that the scheduler may introduce `artificial' deadlocks which Habermann's method does not prevent. Permanent blocking is the situation where certain processes never receive their resource requests. It is shown that deadlock prevention does not necessarily eliminate permanent blocking. A method of preventing permanent blocking is given.", 3515 acknowledgement = ack-nhfb, 3516 classcodes = "C6150J (Operating systems)", 3517 corpsource = "Cornell Univ. Ithaca, NY, USA", 3518 journalabr = "Commun ACM", 3519 keywords = "CACMA; computers, digital; computers, digital, operation; deadly embrace; Habermann's method; interlock; knotting; layout; multiprogramming; operating systems (computers); permanent blocking preventions; resource allocation; scheduling; storage allocation; system deadlock prevention; system recovery; time sharing", 3520 treatment = "T Theoretical or Mathematical", 3521 } 3522 3523 @Article{Hoare:1971:PPF, 3524 author = "C. A. R. Hoare", 3525 title = "Proof of a Program: {FIND}", 3526 journal = j-CACM, 3527 volume = "14", 3528 number = "1", 3529 pages = "39--45", 3530 month = jan, 3531 year = "1971", 3532 CODEN = "CACMA2", 3533 ISSN = "0001-0782", 3534 bibdate = "Tue Mar 25 13:26:09 MST 1997", 3535 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Compiler/ml.bib", 3536 abstract = "An informal description is given of the purpose of the program and the method used. A systematic technique is described for constructing and the program proof during the process of coding it, in such a way as to prevent the intrusion of logical errors. The proof of termination is treated as a separate exercise. Some, conclusions relating to general programming methodology are drawn.", 3537 acknowledgement = ack-nhfb, 3538 classcodes = "C4290 (Other computer theory)", 3539 corpsource = "Queen's Univ. Belfast, UK", 3540 journalabr = "Commun ACM", 3541 keywords = "algorithm correctness; algorithm theory; CACMA; coding; computers, digital; computers, digital, programming; documentation; FIND; ITI; languages; logical errors intrusion; programming methodology; programming theory; programs proofs", 3542 treatment = "T Theoretical or Mathematical", 3543 } 3544 3545 @Article{Proll:1971:FEA, 3546 author = "L. G. Proll", 3547 title = "Further evidence for the analysis of algorithms for the zero-one programming problem", 3548 journal = j-CACM, 3549 volume = "14", 3550 number = "1", 3551 pages = "46--47", 3552 month = jan, 3553 year = "1971", 3554 CODEN = "CACMA2", 3555 ISSN = "0001-0782", 3556 bibdate = "Tue Mar 25 13:26:09 MST 1997", 3557 bibsource = "Compendex database", 3558 abstract = "The purpose of this note is to report computational experience additional to that recently summarized R. L. Gue et al, with two algorithms for the zero-one linear programming problem. An error in Gue's paper is corrected. The utility of one of the algorithms as a suboptimizer is indicated.", 3559 acknowledgement = ack-nhfb, 3560 classcodes = "B0260 (Optimisation techniques); C1180 (Optimisation techniques)", 3561 corpsource = "Univ. Southampton, UK", 3562 journalabr = "Commun ACM", 3563 keywords = "algorithm analysis; algorithm theory; CACMA; computational; ES,; experience; integer programming; linear programming; mathematics; operations research; suboptimisation; zero one variables", 3564 treatment = "T Theoretical or Mathematical", 3565 xxtitle = "Further Evidence of the Analysis of Algorithms for the Zeroone Programming Problem", 3566 } 3567 3568 @Article{Coleman:1971:AAC, 3569 author = "M. W. Coleman and M. S. Taylor", 3570 title = "{ACM} Algorithm 403: Circular Integer Partitioning", 3571 journal = j-CACM, 3572 volume = "14", 3573 number = "1", 3574 pages = "48--48", 3575 month = jan, 3576 year = "1971", 3577 CODEN = "CACMA2", 3578 ISSN = "0001-0782", 3579 bibdate = "Tue Mar 25 13:26:09 MST 1997", 3580 bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/acm.bib", 3581 acknowledgement = ack-nhfb, 3582 classcodes = "C7310 (Mathematics computing)", 3583 corpsource = "Aberdeen Proving Ground, MD, USA", 3584 keywords = "circular integer partitioning; combinations; design; experiments design; number theory; statistical; subroutines", 3585 treatment = "T Theoretical or Mathematical", 3586 } 3587 3588 @Article{Lucas:1971:AAC, 3589 author = "C. W. {Lucas, Jr.} and C. W. Terrill", 3590 title = "{ACM} Algorithm 404: Complex Gamma Function", 3591 journal = j-CACM, 3592 volume = "14", 3593 number = "1", 3594 pages = "48--49 (or 48--48??)", 3595 month = jan, 3596 year = "1971", 3597 CODEN = "CACMA2", 3598 ISSN = "0001-0782", 3599 bibdate = "Tue Mar 25 13:26:09 MST 1997", 3600 acknowledgement = ack-nhfb, 3601 classcodes = "C4120 (Functional analysis); C7310 (Mathematics computing)", 3602 corpsource = "Coll. William and Mary, Williamsburg, VA, USA", 3603 keywords = "algorithm; CGAMMA; complex gamma function evaluation; formula; function evaluation; poles of gamma function; recursion formula; reflection; Stirling's asymptotic series; subroutine in ALGOL; subroutines", 3604 treatment = "T Theoretical or Mathematical", 3605 } 3606 3607 @Article{Redish:1971:CLC, 3608 author = "K. A. Redish", 3609 title = "Comment on {London}'s Certification of Algorithm 245", 3610 journal = j-CACM, 3611 volume = "14", 3612 number = "1", 3613 pages = "50--51", 3614 month = jan, 3615 year = "1971", 3616 CODEN = "CACMA2", 3617 ISSN = "0001-0782", 3618 bibdate = "Fri Jan 17 18:29:55 1997", 3619 acknowledgement = ack-nhfb, 3620 keywords = "certification; debugging; in-place sorting; metatheory; proof of algorithms; sorting", 3621 } 3622 3623 @Article{Pollack:1971:CCD, 3624 author = "S. L. Pollack", 3625 title = "Comment on the conversion of decision tables to computer programs", 3626 journal = j-CACM, 3627 volume = "14", 3628 number = "1", 3629 pages = "52--52", 3630 month = jan, 3631 year = "1971", 3632 CODEN = "CACMA2", 3633 ISSN = "0001-0782", 3634 bibdate = "Tue Mar 25 13:26:09 MST 1997", 3635 acknowledgement = ack-nhfb, 3636 classcodes = "C6110 (Systems analysis and programming)", 3637 corpsource = "S. D. Leidesdorf and Co., NY, USA", 3638 keywords = "aids; application; business; comments; communication; computer program; conversion; decision tables; diagnostic; systems analysis", 3639 treatment = "T Theoretical or Mathematical", 3640 } 3641 3642 @Article{Schwayder:1971:CLE, 3643 author = "K. Schwayder", 3644 title = "Conversion of Limited-Entry Decision Tables to Computer Programs. a Proposed Modification to {Pollack}'s Algorithm", 3645 journal = j-CACM, 3646 volume = "14", 3647 number = "2", 3648 pages = "69--73", 3649 month = feb, 3650 year = "1971", 3651 CODEN = "CACMA2", 3652 ISSN = "0001-0782", 3653 bibdate = "Thu Jan 16 19:52:47 MST 1997", 3654 bibsource = "Compendex database", 3655 abstract = "S. Pollack has proposed an algorithm for converting decision tables into flowcharts which minimize subsequent execution time when compiled into a computer program. Two modifications to this algorithm are proposed. The first relies on Shannon's noiseless coding theorem and the communications concept of entropy but does not completely test the ELSE Rule. The second modification completely tests the ELSE Rule but results in more executions than the first modification. Both modifications result in lower execution time than Pollack's algorithm. However, neither modification guarantees a globally optimal solution.", 3656 acknowledgement = ack-nhfb, 3657 journalabr = "Commun ACM", 3658 keywords = "CACMA; communication channels; computers, digital; information theory; programming; programs", 3659 } 3660 3661 @Article{Shwayder:1971:CLE, 3662 author = "K. Shwayder", 3663 title = "Conversion of limited-entry decision tables to computer programs-a proposed modification to {Pollack}'s algorithm", 3664 journal = j-CACM, 3665 volume = "14", 3666 number = "2", 3667 pages = "69--73", 3668 month = feb, 3669 year = "1971", 3670 CODEN = "CACMA2", 3671 ISSN = "0001-0782", 3672 bibdate = "Tue Mar 25 13:26:09 MST 1997", 3673 acknowledgement = ack-nhfb, 3674 classcodes = "C6110 (Systems analysis and programming)", 3675 corpsource = "Univ. Chicago, IL, USA", 3676 keywords = "computer; conversion; decision tables; flow charting; flowcharting; modifications; Pollack's algorithm; programming; programs", 3677 treatment = "T Theoretical or Mathematical", 3678 } 3679 3680 @Article{Bernstein:1971:PST, 3681 author = "A. J. Bernstein and J. C. Sharp", 3682 title = "A policy-driven scheduler for a time-sharing system", 3683 journal = j-CACM, 3684 volume = "14", 3685 number = "2", 3686 pages = "74--78", 3687 month = feb, 3688 year = "1971", 3689 CODEN = "CACMA2", 3690 ISSN = "0001-0782", 3691 bibdate = "Tue Mar 25 13:26:09 MST 1997", 3692 bibsource = "Compendex database", 3693 abstract = "A scheduling and swapping algorithm which keeps the resource count of each process above its policy function will provide the specified level of service. Overhead can be reduced by avoiding swaps of processes which have received at least this level of service. The algorithm has been implemented in a general purpose operating system, and it has provided significantly better service to interactive and to batch jobs than the previous scheduler.", 3694 acknowledgement = ack-nhfb, 3695 classcodes = "C6150J (Operating systems)", 3696 corpsource = "General Electric, Schenectady, NY, USA", 3697 journalabr = "Commun ACM", 3698 keywords = "CACMA; computation theory; computers, digital; computers, digital, operating; operating; operating systems (computers); policy driven; scheduler; scheduling algorithm; supervisory and executive programs; supervisory programs; systems; time sharing; time sharing systems; time-sharing systems", 3699 treatment = "T Theoretical or Mathematical", 3700 } 3701 3702 @Article{Nielsen:1971:AST, 3703 author = "N. R. Nielsen", 3704 title = "An analysis of some time-sharing techniques", 3705 journal = j-CACM, 3706 volume = "14", 3707 number = "2", 3708 pages = "79--90", 3709 month = feb, 3710 year = "1971", 3711 CODEN = "CACMA2", 3712 ISSN = "0001-0782", 3713 bibdate = "Tue Mar 25 13:26:09 MST 1997", 3714 bibsource = "Compendex database", 3715 abstract = "The effectiveness of certain time-sharing techniques such as program relocation, disk rotational delay minimization, and swap volume minimization is investigated. Summary data is presented, and the findings are discussed. The vehicle for this investigation was a SI-MULA based simulation model reflecting an early framework for a planned Burroughs B6500 time-sharing system. Inasmuch as the B6500 system is based upon the use of variable sized segments and a dynamic overlay procedure, data is also presented which provides some indication of the effectiveness of this type of organization in a time-sharing environment. The design characteristics and operational capabilities of the simulation model are also described.", 3716 acknowledgement = ack-nhfb, 3717 classcodes = "C6150J (Operating systems)", 3718 corpsource = "Stanford Univ., CA, USA", 3719 journalabr = "Commun ACM", 3720 keywords = "CACMA; capabilities; computers, digital; computers, digital, operating; design characteristics; disk rotational delay; minimization; operating systems; operating systems (computers); operational; program relocation; simulation; simulation model; swap volume minimization; systems analysis; techniques; time sharing; time sharing systems; time-sharing systems", 3721 treatment = "P Practical", 3722 } 3723 3724 @Article{Slagle:1971:EAL, 3725 author = "J. R. Slagle and C. D. Farrell", 3726 title = "Experiments in Automatic Learning for a Multipurpose Heuristic Program", 3727 journal = j-CACM, 3728 volume = "14", 3729 number = "2", 3730 pages = "91--99 (or 91--98??)", 3731 month = feb, 3732 year = "1971", 3733 CODEN = "CACMA2", 3734 ISSN = "0001-0782", 3735 bibdate = "Tue Mar 25 13:26:09 MST 1997", 3736 abstract = "An automatic learning capability has been developed and implemented for use with the MULTIPLE (MULTIpurpose Program that LEarns) heuristic tree-searching program, which is presently being applied to resolution theorem-proving in predicate calculus. MULTIPLE's proving program (PP) uses two evaluation functions to guide its search for a proof of whether or not a particular goal is achievable. Thirteen general features of predicate calculus clauses were created for use in the automatic learning of better evaluation functions for PP. A multiple regression program was used to produce optimal coefficients for linear polynomial functions in terms of the features.\par Also, automatic data-handling routines were written for passing data between the learning program and the proving program, and for analyzing and summarizing results. Data was generally collected for learning (regression analysis) from the experience of PP. A number of experiments were performed to test the effectiveness and generality of the learning program. Results showed that the learning produced dramatic improvements in the solutions to problems which were in the same domain as those used for collection learning data. Learning was also shown to generalize successfully to domains other than those used for data collection. Another experiment demonstrated that the learning program could simultaneously improve performance on problems in a specific domain and on problems in a variety of domains. Some variations of the learning program were also tested.", 3737 acknowledgement = ack-nhfb, 3738 classcodes = "C1230 (Artificial intelligence)", 3739 corpsource = "Nat. Inst. Health, Bethesda, MD, USA", 3740 keywords = "adaptive; artificial intelligence; automatic learning; computer aided instruction; computer aided learning; education; experimental development; heuristic; heuristic programming; heuristic tree searching program; learning; learning systems; LISP; multiple regression; multipurpose heuristic program; problem-solving; resolution; self-modifying; system; theorem-providing; tree-searching; trees; trees (mathematics)", 3741 treatment = "P Practical", 3742 } 3743 3744 @Article{Hurwitz:1971:PDV, 3745 author = "H. {Hurwitz, Jr.}", 3746 title = "On the Probability Distribution of the Values of Binary Trees", 3747 journal = j-CACM, 3748 volume = "14", 3749 number = "2", 3750 pages = "99--102", 3751 month = feb, 3752 year = "1971", 3753 CODEN = "CACMA2", 3754 ISSN = "0001-0782", 3755 bibdate = "Tue Mar 25 13:26:09 MST 1997", 3756 bibsource = "Compendex database", 3757 abstract = "\ldots{}unction for binary tree values, the values reflecting sorting effort. The analysis does not assume uniformly distributed branching ratios, and therefore is applicable to a family of sorting algorithms discussed by Hoare, Singleton, and van Emden. \par The solution to the integral equation indicates that using more advanced algorithms in the family makes only minor reductions in the expected sorting effort, but substantially reduces the variance in sorting effort. Statistical tests of the values of several thousand trees containing up to 10,000 points have given first, second, and third moments of the value distribution function in satisfactory agreement with the moments computed from the generating function. The empirical tests, as well as the analytical results, are in agreement with previously published results for the first moment in the cases of uniform and nonuniform distribution of branching ratio, and for the second moment in the case of uniform distribution of branching ratio.", 3758 acknowledgement = ack-nhfb, 3759 classcodes = "C6130 (Data handling techniques)", 3760 corpsource = "General Electric, Schenectady, NY, USA", 3761 journalabr = "Commun ACM", 3762 keywords = "binary tree; binary trees; CACMA; generation; integral equation: function; integral equations; N T; probability distribution; sorting; statistical analysis; statistical tests; statistics; trees; trees (mathematics); values", 3763 treatment = "T Theoretical or Mathematical", 3764 } 3765 3766 @Article{Slagle:1971:AGT, 3767 author = "J. R. Slagle and R. C. T. Lee", 3768 title = "Application of Game Tree Searching Techniques to Sequential Pattern Recognition", 3769 journal = j-CACM, 3770 volume = "14", 3771 number = "2", 3772 pages = "103--110", 3773 month = feb, 3774 year = "1971", 3775 CODEN = "CACMA2", 3776 ISSN = "0001-0782", 3777 bibdate = "Tue Mar 25 13:26:09 MST 1997", 3778 bibsource = "Compendex database", 3779 abstract = "A sequential pattern recognition (SPR) procedure does not test all the features of a pattern at once. Instead, it selects a feature to be tested. After receiving the result of that test, the procedure either classifies the unknown pattern or selects another feature to be tested, etc. Medical diagnosis is an example of SPR. In this paper the authors suggest that SPR be viewed as a one-person game played against nature (chance). Virtually all the powerful techniques developed for searching two-person, strictly competitive game trees can easily be incorporated either directly or by analogy into SPR procedures. \par In particular, one can incorporate the ``mini average backing-up procedure'' and the ``gamma procedure,'' which are the analogues of the ``minimax backing-up procedure'' and the ``alpha-beta procedure,'' respectively. \par Some computer simulated experiments in character recognition are presented. The results indicate that the approach is promising.", 3780 acknowledgement = ack-nhfb, 3781 classcodes = "B6140C (Optical information, image and video signal processing); C1250 (Pattern recognition)", 3782 corpsource = "Nat. Inst. Health, Bethesda, MD, USA", 3783 journalabr = "Commun ACM", 3784 keywords = "bioengineering, computer applications; branch-and-bound approach; CACMA; CAL; computers, digital, character; dynamic programming; game against nature; game theory; game theory application; game tree searching; gamma procedure; mini average backing-up procedure; optimal solution; pattern; pattern recognition; pattern recognition systems; recognition; sequential pattern recognition; techniques; trees; trees (mathematics)", 3785 treatment = "P Practical", 3786 } 3787 3788 @Article{Rokne:1971:CIA, 3789 author = "J. Rokne and P. Lancaster", 3790 title = "Complex Interval Arithmetic", 3791 journal = j-CACM, 3792 volume = "14", 3793 number = "2", 3794 pages = "111--112", 3795 month = feb, 3796 year = "1971", 3797 CODEN = "CACMA2", 3798 ISSN = "0001-0782", 3799 bibdate = "Tue Mar 25 13:26:09 MST 1997", 3800 bibsource = "Compendex database", 3801 abstract = "Complex interval arithmetic is defined using real interval arithmetic. Complex interval division is defined so as to assure smallest possible resulting intervals.", 3802 acknowledgement = ack-nhfb, 3803 classcodes = "C5230 (Digital arithmetic methods)", 3804 corpsource = "Univ. Calgary, Alta., Canada", 3805 journalabr = "Commun ACM", 3806 keywords = "complex interval arithmetic; complex intervals; digital arithmetic; mathematics; numerical mathematics; numerical methods; on; real interval arithmetic; real intervals", 3807 treatment = "T Theoretical or Mathematical", 3808 } 3809 3810 @Article{Dell:1971:AAR, 3811 author = "A. M. Dell and R. L. Weil and G. L. Thompson", 3812 title = "{ACM} Algorithm 405: Roots of Matrix Pencils: The Generalized Eigenvalue Problem", 3813 journal = j-CACM, 3814 volume = "14", 3815 number = "2", 3816 pages = "113--117", 3817 month = feb, 3818 year = "1971", 3819 CODEN = "CACMA2", 3820 ISSN = "0001-0782", 3821 bibdate = "Tue Mar 25 13:26:09 MST 1997", 3822 acknowledgement = ack-nhfb, 3823 classcodes = "C4140 (Linear algebra); C7310 (Mathematics computing)", 3824 corpsource = "Univ. Chicago, IL, USA", 3825 keywords = "algebra; eigenvalues and eigenfunctions; generalised eigenvalue; linear; matrix algebra; problem; roots of matrix pencils; subroutines", 3826 treatment = "T Theoretical or Mathematical", 3827 } 3828 3829 @Article{Noll:1971:SCG, 3830 author = "A. M. Noll", 3831 title = "Scanned-Display Computer Graphics", 3832 journal = j-CACM, 3833 volume = "14", 3834 number = "3", 3835 pages = "143--150", 3836 month = mar, 3837 year = "1971", 3838 CODEN = "CACMA2", 3839 ISSN = "0001-0782", 3840 bibdate = "Tue Mar 25 13:26:09 MST 1997", 3841 bibsource = "Compendex database", 3842 abstract = "A television-like scanned-display system has been successfully implemented on a Honeywell DDP-224 computer installation. The scanned image is stored in the core memory of the computer, and software scan conversion is used to convert the rectangular coordinates of a point to the appropriate work and bit in an output display array in core storage. Results thus far indicate that flicker-free displays of large amounts of data are possible with reasonably fast graphical interaction. A scanned image of size 240x254 points is displayed at a 30 frame-per-second rate.", 3843 acknowledgement = ack-nhfb, 3844 classcodes = "B7260 (Display technology and systems); C5540 (Terminals and graphic displays)", 3845 corpsource = "Bell Telephone Labs. Inc., Murray Hill, NJ, USA", 3846 journalabr = "Commun ACM", 3847 keywords = "CACMA; computer; computer graphics; computers, digital; core memory; display systems; ed.; graphical interaction; installation; raster displays; scan conversion; scanned image; software; stored; television like scanned display", 3848 treatment = "A Application; P Practical", 3849 } 3850 3851 @Article{Manna:1971:TAP, 3852 author = "Z. Manna and R. J. Waldinger", 3853 title = "Toward Automatic Program Synthesis", 3854 journal = j-CACM, 3855 volume = "14", 3856 number = "3", 3857 pages = "151--165", 3858 month = mar, 3859 year = "1971", 3860 CODEN = "CACMA2", 3861 ISSN = "0001-0782", 3862 bibdate = "Tue Mar 25 13:26:09 MST 1997", 3863 bibsource = "Compendex database", 3864 abstract = "An elementary outline of the theorem-proving approach to automatic program synthesis is given, without dwelling on technical details. The method is illustrated by the automatic construction of both recursive and iterative programs operating on natural numbers,lists, and trees, In order to construct a program satisfying certain specifications a theorem induced by those specifications is proved, and the desired program is extracted from the proof. The same technique is applied to transform recursively defined functions into iterative programs, frequently with a major gain inefficiency. It is emphasized that in order to construct a program with loops or with recursion, the principle of mathematical induction must be applied. The relation between the version of the induction rule used and the form of the program constructed is explored in some detail.", 3865 acknowledgement = ack-nhfb, 3866 classcodes = "C1230 (Artificial intelligence)", 3867 corpsource = "Stanford Univ., CA, USA", 3868 journalabr = "Commun ACM", 3869 keywords = "answer extraction; artificial; artificial intelligence; automata theory; automatic program synthesis; CACMA; computer metatheory; computers, languages; computers, programming; intelligence; lists; mathematical induction; mathematical induction principle; natural numbers; principle; problem solving; programs; recursive and iterative; theorem proving; trees", 3870 treatment = "P Practical", 3871 } 3872 3873 @Article{Winters:1971:SAC, 3874 author = "W. K. Winters", 3875 title = "Scheduling Algorithm for a Computer Assisted Registration System", 3876 journal = j-CACM, 3877 volume = "14", 3878 number = "3", 3879 pages = "166--171", 3880 month = mar, 3881 year = "1971", 3882 CODEN = "CACMA2", 3883 ISSN = "0001-0782", 3884 bibdate = "Tue Mar 25 13:26:09 MST 1997", 3885 bibsource = "Compendex database", 3886 abstract = "This paper presents the scheduling algorithm used in the Computer Assisted Registration System at the University of Tennessee. Notation is defined and the logic of the algorithm necessary to implement educational policy is described. Results from the first term's implementation are presented.", 3887 acknowledgement = ack-nhfb, 3888 classcodes = "C7110 (Educational administration)", 3889 corpsource = "Univ. Tennessee, Knoxville, TN, USA", 3890 journalabr = "Commun ACM", 3891 keywords = "administrative data processing; CACMA; computer assisted registration system; data processing; educational administrative data processing; educational policy; implementation; logic; scheduling algorithm; timetable", 3892 treatment = "A Application; P Practical", 3893 } 3894 3895 @Article{Williams:1971:SUM, 3896 author = "J. G. Williams", 3897 title = "Storage Utilization in a Memory Hierarchy When Storage Assignment is Performed by a Hashing Algorithm", 3898 journal = j-CACM, 3899 volume = "14", 3900 number = "3", 3901 pages = "172--175", 3902 month = mar, 3903 year = "1971", 3904 CODEN = "CACMA2", 3905 ISSN = "0001-0782", 3906 bibdate = "Tue Mar 25 13:26:09 MST 1997", 3907 bibsource = "Compendex database", 3908 abstract = "The utilization of storage is studied in a two-level memory hierarchy. The first storage level, which is the fast store, is divided into a number of storage areas. When an entry is to be filed in the hierarchy, a hashing algorithm will attempt to place the entry into one of these areas. If this particular area is full, then the entry will be placed into the slower second-level store, even though other areas in the first-level store may have space available. Given that N entries have been filed in the entire hierarchy, an expression is derived for the expected number of entries filed in the first-level store. This expression gives a measure of how effectively the first-level store is being used. By means of examples, storage utilization is then studied as a function of the hashing algorithm, the number of storage areas into which the first-level store is divided and the total size of the first-level store.", 3909 acknowledgement = ack-nhfb, 3910 classcodes = "C6120 (File organisation)", 3911 corpsource = "RCA Labs., Princeton, NJ, USA", 3912 journalabr = "Commun ACM", 3913 keywords = "CACMA; computers, digital; hashing algorithm; hierarchical systems; memory allocation; memory hierarchy; storage allocation; storage assignment; storage units; storage utilization", 3914 treatment = "A Application; P Practical", 3915 } 3916 3917 @Article{Gear:1971:AIO, 3918 author = "C. W. Gear", 3919 title = "The Automatic Integration of Ordinary Differential Equations", 3920 journal = j-CACM, 3921 volume = "14", 3922 number = "3", 3923 pages = "176--179", 3924 month = mar, 3925 year = "1971", 3926 CODEN = "CACMA2", 3927 ISSN = "0001-0782", 3928 MRclass = "65L05", 3929 MRnumber = "52 9612", 3930 bibdate = "Tue Mar 25 13:26:09 MST 1997", 3931 bibsource = "Compendex database", 3932 abstract = "A criterion for the selection of the order of approximation is proposed. The objective of the criterion is to increase the step size so as to reduce solution time. An option permits the solution of `stiff' differential equations. A program embodying the techniques discussed appears as an algorithm which is specified.", 3933 acknowledgement = ack-nhfb, 3934 classcodes = "C4170 (Differential equations)", 3935 corpsource = "Stanford Univ., CA, USA", 3936 journalabr = "Commun ACM", 3937 keywords = "automatic; boundary value problems; boundary-value problems; CACMA; differential equations; initial value; integration; mathematics; numerical methods; order control; order of approximation; ordinary differential equations; problem; selection; step control; stiff equations", 3938 treatment = "T Theoretical or Mathematical", 3939 } 3940 3941 @Article{Howell:1971:AAE, 3942 author = "J. A. Howell", 3943 title = "{ACM} Algorithm 406: Exact Solution of Linear Equations Using Residue Arithmetic", 3944 journal = j-CACM, 3945 volume = "14", 3946 number = "3", 3947 pages = "180--184", 3948 month = mar, 3949 year = "1971", 3950 CODEN = "CACMA2", 3951 ISSN = "0001-0782", 3952 bibdate = "Tue Mar 25 13:26:09 MST 1997", 3953 acknowledgement = ack-nhfb, 3954 classcodes = "C7310 (Mathematics computing)", 3955 corpsource = "Univ. Texas, Austin, TX, USA", 3956 keywords = "adjoint matrix; determinant; Gaussian elimination; ill condition; inversion; linear equations; matrix; matrix algebra; modulus; prime number; residue arithmetic; subroutine; subroutines; symmetric mixed radix representation; symmetric residue", 3957 treatment = "T Theoretical or Mathematical", 3958 } 3959 3960 @Article{Gear:1971:AAD, 3961 author = "C. W. Gear", 3962 title = "{ACM} Algorithm 407: {DIFSUB} for Solution of Ordinary Differential Equations", 3963 journal = j-CACM, 3964 volume = "14", 3965 number = "3", 3966 pages = "185--190", 3967 month = mar, 3968 year = "1971", 3969 CODEN = "CACMA2", 3970 ISSN = "0001-0782", 3971 bibdate = "Tue Mar 25 13:26:09 MST 1997", 3972 acknowledgement = ack-nhfb, 3973 classcodes = "C7310 (Mathematics computing)", 3974 corpsource = "Univ. Illinois, Urbana, IL, USA", 3975 keywords = "control; differential equations; DIFSUB; estimated error; method; multistep predictor corrector; ordinary differential equations; stiff differential equations; subroutine; subroutines", 3976 treatment = "T Theoretical or Mathematical", 3977 } 3978 3979 @Article{Wirth:1971:PDS, 3980 author = "N. Wirth", 3981 title = "Program Development by Stepwise Refinement", 3982 journal = j-CACM, 3983 volume = "14", 3984 number = "4", 3985 pages = "221--227", 3986 month = apr, 3987 year = "1971", 3988 CODEN = "CACMA2", 3989 ISSN = "0001-0782", 3990 bibdate = "Tue Mar 25 13:26:09 MST 1997", 3991 bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Parallel/conc.scientific.computing.bib", 3992 acknowledgement = ack-nhfb, 3993 classcodes = "C6110 (Systems analysis and programming)", 3994 corpsource = "Eidgenossische Tech. Hochschule, Zurich, Switzerland", 3995 keywords = "development; education; programming; programming techniques; refinement; stepwise", 3996 treatment = "P Practical", 3997 } 3998 3999 @Article{Lum:1971:KAT, 4000 author = "V. Y. Lum and P. S. T. Yuen and M. Dodd", 4001 title = "Key-to-Address Transform Techniques: {A} Fundamental Performance Study on Large Existing Formatted Files", 4002 journal = j-CACM, 4003 volume = "14", 4004 number = "4", 4005 pages = "228--239", 4006 month = apr, 4007 year = "1971", 4008 CODEN = "CACMA2", 4009 ISSN = "0001-0782", 4010 bibdate = "Tue Mar 25 13:26:09 MST 1997", 4011 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/hash.bib", 4012 note = "Survey of several hash functions, with performance results.", 4013 abstract = "The results of a study of eight different keyto-address transformation methods applied to a set of existing files are presented. As each method is applied to a particular file, load factor and bucket size are varied over a wide range. Appropriate variables pertinent only to a specific method take on different values. The performance of each method is summarized in terms of the number of accesses required to get to a record and the number of overflow records created by a transformation. Peculiarities of each method are discussed. Practical guidelines obtained from the results are stated. A proposal for further quantitative fundamental study is outlined.", 4014 acknowledgement = ack-nhfb, 4015 annote = "Measurement of direct access methods", 4016 classcodes = "C6120 (File organisation)", 4017 corpsource = "IBM, San Jose, CA, USA", 4018 journalabr = "Commun ACM", 4019 keywords = "CACMA; computers, digital; computers, digital codes; file organization; has codes; information storage and retrie; random access storage", 4020 keywords = "file management; file organisation; file organization; formatted files; information retrieval; key to address transform; techniques", 4021 treatment = "P Practical", 4022 } 4023 4024 @Article{Tucker:1971:DMP, 4025 author = "A. B. Tucker and M. J. Flynn", 4026 title = "Dynamic Microprogramming. Processor Organization and Programming", 4027 journal = j-CACM, 4028 volume = "14", 4029 number = "4", 4030 pages = "240--250", 4031 month = apr, 4032 year = "1971", 4033 CODEN = "CACMA2", 4034 ISSN = "0001-0782", 4035 bibdate = "Tue Mar 25 13:26:09 MST 1997", 4036 bibsource = "Compendex database", 4037 abstract = "A microassembly language is developed and the overhead involved in subroutine linkages is analyzed. The efficiency of a flexible software linkage scheme is examined as to its overhead for various subroutine characteristics. Three examples of problem-oriented programming are considered and the resulting coding is compared against a System/360 assembly language version, with the technology normalized.", 4038 acknowledgement = ack-nhfb, 4039 classcodes = "C6150C (Compilers, interpreters and other processors)", 4040 corpsource = "Northwestern Univ., Evanston, IL, USA", 4041 journalabr = "Commun ACM", 4042 keywords = "CACMA; computers, digital; dynamically microprogrammed processor; microassembly language; microprogramming; microstorage; problem oriented programming; problem-oriented languages; program processors; read write; subroutine linkage", 4043 treatment = "P Practical", 4044 } 4045 4046 @Article{Talbot:1971:AOT, 4047 author = "P. A. Talbot and J. W. Carr and R. R. {Coulter, Jr.} and R. C. Hwang", 4048 title = "Animator: an on-line two-dimensional film animation system", 4049 journal = j-CACM, 4050 volume = "14", 4051 number = "4", 4052 pages = "251--259", 4053 month = apr, 4054 year = "1971", 4055 CODEN = "CACMA2", 4056 ISSN = "0001-0782", 4057 bibdate = "Tue Mar 25 13:26:09 MST 1997", 4058 acknowledgement = ack-nhfb, 4059 classcodes = "C5540 (Terminals and graphic displays)", 4060 corpsource = "Univ. Pennsylvania, Philadelphia, PA, USA", 4061 keywords = "computer animation; computer graphics; dimensional languages; microfilm recorder; on line system; online operation; programming languages; two", 4062 treatment = "P Practical", 4063 } 4064 4065 @Article{Stein:1971:CD, 4066 author = "M. L. Stein and W. D. Munro", 4067 title = "On Complement Division", 4068 journal = j-CACM, 4069 volume = "14", 4070 number = "4", 4071 pages = "260--264", 4072 month = apr, 4073 year = "1971", 4074 CODEN = "CACMA2", 4075 ISSN = "0001-0782", 4076 bibdate = "Tue Mar 25 13:26:09 MST 1997", 4077 bibsource = "Compendex database", 4078 abstract = "The division algorithm theorem is expressed in a form that permits it to serve as the basis for devising division operations that produce both quotient and remainder in complement form. Algorithms for division yielding complement results are derived for numbers represented in any base greater than one. Both radix and radix-less-one complementation schemes are considered. The binary form of the algorithms thus includes both two's and one's complement implementation. The problem of quotient overflow for complement results is dealt with as is that of selecting an appropriate form of the remainder condition for complement division.", 4079 acknowledgement = ack-nhfb, 4080 classcodes = "C4210 (Formal logic)", 4081 corpsource = "Univ. Minnesota, Minneapolis, MN, USA", 4082 journalabr = "Commun ACM", 4083 keywords = "algorithmic languages; CACMA; complement; digital arithmetic; division; division algorithm; mathematics; radix complementation schemes", 4084 treatment = "P Practical", 4085 } 4086 4087 @Article{McNamee:1971:AAS, 4088 author = "J. M. McNamee", 4089 title = "{ACM} Algorithm 408: {A} Sparse Matrix Package (Part {I})", 4090 journal = j-CACM, 4091 volume = "14", 4092 number = "4", 4093 pages = "265--273", 4094 month = apr, 4095 year = "1971", 4096 CODEN = "CACMA2", 4097 ISSN = "0001-0782", 4098 bibdate = "Tue Mar 25 13:26:09 MST 1997", 4099 note = "See also \cite{Sipala:1977:RAS,Gustavson:1978:RAS,Harms:1980:RSM}.", 4100 acknowledgement = ack-nhfb, 4101 classcodes = "C7410B (Power engineering computing)", 4102 corpsource = "York Univ., Downsview, Ont., Canada", 4103 keywords = "algebra; electrical engineering applications of computers; electrical network problems; Fortran subroutines; matrix; sparse matrix manipulation; subroutines; tests", 4104 treatment = "P Practical", 4105 } 4106 4107 @Article{Olle:1971:IFA, 4108 author = "T. William {Olle (Chairman)} and {Codasyl Systems Committee}", 4109 title = "Introduction to {`Feature analysis of generalized data base management systems'}", 4110 journal = j-CACM, 4111 volume = "14", 4112 number = "5", 4113 pages = "308--318", 4114 month = may, 4115 year = "1971", 4116 CODEN = "CACMA2", 4117 ISSN = "0001-0782", 4118 bibdate = "Tue Mar 25 13:26:09 MST 1997", 4119 bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib", 4120 abstract = "This introduction gives a review of the current state of the art in the systems and discusses the differences and similarities between capabilities found in host language systems and those found in self-contained systems. Technical problems facing future designers are described. The use of Cobol as a basis for further development work is considered at some length with respect to data structures, host language capabilities, and self-contained capabilities.", 4121 acknowledgement = ack-nhfb, 4122 classcodes = "C6120 (File organisation); C6130 (Data handling techniques)", 4123 keywords = "data structures; feature analysis; generalised data base management systems; information; programming languages; retrieval; standards; storage management; transaction processing", 4124 } 4125 4126 @Article{Nielsen:1971:MRC, 4127 author = "N. R. Nielsen", 4128 title = "The merit of regional computing networks", 4129 journal = j-CACM, 4130 volume = "14", 4131 number = "5", 4132 pages = "319--326", 4133 month = may, 4134 year = "1971", 4135 CODEN = "CACMA2", 4136 ISSN = "0001-0782", 4137 bibdate = "Tue Mar 25 13:26:09 MST 1997", 4138 bibsource = "Compendex database", 4139 abstract = "One of the suggested means for stimulating the spread of computing capabilities in institutions of higher learning is through the construction of regional computing networks. One such network has been constructed in the San Francisco Bay Area of Stanford University. This paper reports upon the lessons learned from the operation of that network over the past 2 yr.", 4140 acknowledgement = ack-nhfb, 4141 classcodes = "C0220 (Computing education and training); C5600 (Data communication equipment and techniques); C7810C (Computer-aided instruction)", 4142 corpsource = "Stanford Univ., CA, USA", 4143 journalabr = "Commun ACM", 4144 keywords = "CACMA; computer aided instruction; computer applications; computer sharing; computer utility; computers, digital, data proce; computing; cooperative networks; curriculum development; digital communication systems; education; educational computing; engineering education; R C; remote", 4145 } 4146 4147 @Article{Krolak:1971:MAT, 4148 author = "P. Krolak and W. Felts and G. Marble", 4149 title = "A Man-Machine Approach Toward Solving the Traveling Salesman Problem", 4150 journal = j-CACM, 4151 volume = "14", 4152 number = "5", 4153 pages = "327--334", 4154 month = may, 4155 year = "1971", 4156 CODEN = "CACMA2", 4157 ISSN = "0001-0782", 4158 bibdate = "Tue Mar 25 13:26:09 MST 1997", 4159 bibsource = "Compendex database", 4160 abstract = "This paper describes a computer aided heuristic technique which uses only a modest amount of computer time in real-time to solve large (100 to 200) point problems. This technique takes advantage of both the computer's and the human's problem-solving abilities. The computer is not asked to solve the problem in a brute force way as in many of today's heuristics, but it is asked to organize the data for the human so that the human can solve the problem easily. The technique used in this paper seems to point to new directions in the field of man-machine interaction and in the field of artificial intelligence.", 4161 acknowledgement = ack-nhfb, 4162 classcodes = "C1230 (Artificial intelligence); C1270 (Man-machine systems)", 4163 corpsource = "Vanderbilt Univ., Nashville, TN, USA", 4164 journalabr = "Commun ACM", 4165 keywords = "artificial intelligence; assignment; CACMA; computer aided heuristic techniques; computer applications; cybernetics; heuristic procedure; heuristic programming; interaction process; man machine interaction; man-machine systems; operations research; optimisation; problem; production planning and control; rubber band tour generator; travelling salesman problem", 4166 treatment = "T Theoretical or Mathematical", 4167 } 4168 4169 @Article{Montanari:1971:ODC, 4170 author = "Ugo Montanari", 4171 title = "On the optimal detection of curves in noisy pictures", 4172 journal = j-CACM, 4173 volume = "14", 4174 number = "5", 4175 pages = "335--345", 4176 month = may, 4177 year = "1971", 4178 CODEN = "CACMA2", 4179 ISSN = "0001-0782", 4180 bibdate = "Tue Mar 25 13:26:09 MST 1997", 4181 bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/Reverse.eng.bib", 4182 acknowledgement = ack-nhfb, 4183 classcodes = "B6140C (Optical information, image and video signal processing); C1250 (Pattern recognition)", 4184 corpsource = "Istituto Elaborazione Informazione, Pisa, Italy", 4185 keywords = "curve; description; dynamic programming; edge; global recognition; heuristic; heuristic programming; interaction graph; line; methods; noise; optimal detection; optimisation; optimisation problem; parallel processing; pattern recognition; picture; picture processing; picture recognition; secondary", 4186 treatment = "T Theoretical or Mathematical", 4187 } 4188 4189 @Article{Richards:1971:HKA, 4190 author = "D. L. Richards", 4191 title = "How to Keep the Addresses Short", 4192 journal = j-CACM, 4193 volume = "14", 4194 number = "5", 4195 pages = "346--349", 4196 month = may, 4197 year = "1971", 4198 CODEN = "CACMA2", 4199 ISSN = "0001-0782", 4200 bibdate = "Tue Mar 25 13:26:09 MST 1997", 4201 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Compiler/Compiler.Lins.bib", 4202 abstract = "This paper demonstrates that a wide class of problems can be formulated as covering problems solvable by means of elementary arithmetic operations on the column vectors of a ternary matrix.", 4203 acknowledgement = ack-nhfb, 4204 classcodes = "C6130 (Data handling techniques); C6150C (Compilers, interpreters and other processors)", 4205 corpsource = "Leasco Systems Corp., Tustin, CA, USA", 4206 journalabr = "Commun ACM", 4207 keywords = "addressing; assembler; CACMA; compilers; computers, digital; covering problem; data handling; integer; integer programming; minimisation; program; program assemblers; programming; variable length addressing", 4208 treatment = "T Theoretical or Mathematical", 4209 } 4210 4211 @Article{Fenichel:1971:ILV, 4212 author = "R. R. Fenichel", 4213 title = "On Implementation of Label Variables", 4214 journal = j-CACM, 4215 volume = "14", 4216 number = "5", 4217 pages = "349--350", 4218 month = may, 4219 year = "1971", 4220 CODEN = "CACMA2", 4221 ISSN = "0001-0782", 4222 bibdate = "Tue Mar 25 13:26:09 MST 1997", 4223 bibsource = "Compendex database", 4224 abstract = "Variables of label mode are conventionally implemented with a technique which fails to trap certain programming errors. Fine-grained calender clocks have recently become available; these allow implementation of label variables via a new technique which traps all programming errors of this variety.", 4225 acknowledgement = ack-nhfb, 4226 classcodes = "C6150C (Compilers, interpreters and other processors)", 4227 corpsource = "MIT, Cambridge, MA, USA", 4228 journalabr = "Commun ACM", 4229 keywords = "CACMA; compiler; computers, digital; DS; fine grained calendar clocks; go; interpreter; label variables implementation; program compilers; program debugging; to; transfer", 4230 treatment = "P Practical", 4231 } 4232 4233 @Article{Morris:1971:ARI, 4234 author = "James H. {Morris, Jr.}", 4235 title = "Another Recursion Induction Principle", 4236 journal = j-CACM, 4237 volume = "14", 4238 number = "5", 4239 pages = "351--354", 4240 month = may, 4241 year = "1971", 4242 CODEN = "CACMA2", 4243 ISSN = "0001-0782", 4244 MRclass = "02F25 (94A25)", 4245 MRnumber = "45 57", 4246 mrreviewer = "H. R. Strong", 4247 bibdate = "Tue Mar 25 13:26:09 MST 1997", 4248 bibsource = "Compendex database", 4249 abstract = "An inductive method for proving things about recursively defined functions is described. It is shown to be useful for proving partial functions equivalent and thus applicable in proofs about interpreters for programming languages.", 4250 acknowledgement = ack-nhfb, 4251 classcodes = "C1230 (Artificial intelligence); C4210 (Formal logic)", 4252 corpsource = "Univ. California, Berkeley, CA, USA", 4253 journalabr = "Commun ACM", 4254 keywords = "automata theory; CACMA; compiler correctness; compiler correctness proofs; computational linguistics; computers, digital, languages; computers, digital, programming; correctness; induction; interpreters; proofs; proving; recursion; recursion induction principle; recursive functions; theorem", 4255 treatment = "T Theoretical or Mathematical", 4256 } 4257 4258 @Article{Schmitt:1971:AAD, 4259 author = "H. Schmitt", 4260 title = "{ACM} Algorithm 409: Discrete {Chebychev} Curve Fit", 4261 journal = j-CACM, 4262 volume = "14", 4263 number = "5", 4264 pages = "355--356", 4265 month = may, 4266 year = "1971", 4267 CODEN = "CACMA2", 4268 ISSN = "0001-0782", 4269 bibdate = "Tue Mar 25 13:26:09 MST 1997", 4270 acknowledgement = ack-nhfb, 4271 classcodes = "C4130 (Interpolation and function approximation); C7310 (Mathematics computing)", 4272 corpsource = "Tech. Hochschule, Darmstadt, West Germany", 4273 keywords = "ALGOL procedure; algorithm; Chebyshev approximation; discrete Chebychev curve fit; exchange; Remez algorithm; subroutines", 4274 treatment = "T Theoretical or Mathematical", 4275 } 4276 4277 @Article{Chambers:1971:AAP, 4278 author = "J. M. Chambers", 4279 title = "{ACM} Algorithm 410: Partial Sorting [{M1}]", 4280 journal = j-CACM, 4281 volume = "14", 4282 number = "5", 4283 pages = "357--358", 4284 month = may, 4285 year = "1971", 4286 CODEN = "CACMA2", 4287 ISSN = "0001-0782", 4288 bibdate = "Tue Mar 25 13:26:09 MST 1997", 4289 bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/acm.bib", 4290 acknowledgement = ack-nhfb, 4291 classcodes = "C6130 (Data handling techniques)", 4292 corpsource = "Bell Telephone Labs., Murray Hill, NJ, USA", 4293 keywords = "FORTRAN routine; order statistics; partial sorting; sorting; subroutines", 4294 keywords = "partial sorting order statistics; sorting", 4295 treatment = "T Theoretical or Mathematical", 4296 } 4297 4298 @Article{Harada:1971:GRP, 4299 author = "Kazuaki Harada", 4300 title = "Generation of rosary permutations expressed in {Hamiltonian} circuits", 4301 journal = j-CACM, 4302 volume = "14", 4303 number = "6", 4304 pages = "373--379", 4305 month = jun, 4306 year = "1971", 4307 CODEN = "CACMA2", 4308 ISSN = "0001-0782", 4309 MRclass = "90.30 (05.00)", 4310 MRnumber = "44\#3675", 4311 bibdate = "Tue Mar 25 13:26:09 MST 1997", 4312 abstract = "Systematic generation of a specific class of permutations fundamental to scheduling problems is described. In a nonoriented complete graph with n vertices, Hamiltonian circuits equivalent to $.5(n - 1)!$ specific permutations of $n$ elements, termed rosary permutations, can be defined. Each of them corresponds to two circular permutations which mirror-image each other, and is generated successively by a number system covering $3*4*\ldots*(n-1)$ sets of edges. Every set of edges $\{E[k]\}, 1 <= E[k] <= k, 3 <= k <= (n-1)$ is determined recursively by constructing a Hamiltonian circuit with $k$ vertices from a Hamiltonian circuit with $k-1$ vertices, starting with the Hamiltonian circuit of 3 vertices. The basic operation consists of transposition of a pair of adjacent vertices where the position of the pair in the permutation is determined by $\{E[k]\}$. Two algorithms treating the same example for five vertices are presented. It is very easy to derive all possible n! permutations from the $.5(n - 1 )!$ rosary permutations be cycling the permutations and by taking them in the reverse order-procedures which can be performed fairly efficiently by computer.", 4313 acknowledgement = ack-nhfb, 4314 classcodes = "B0250 (Combinatorial mathematics)", 4315 corpsource = "Washington Univ., St. Louis, MO, USA", 4316 keywords = "circuits; combinatorial algebra; graph theory; Hamiltonian; nonoriented complete graph; permutation; rosary permutations generation; scheduling", 4317 treatment = "T Theoretical or Mathematical", 4318 } 4319 4320 @Article{Foley:1971:AOD, 4321 author = "J. D. Foley", 4322 title = "An approach to the optimum design of computer graphics systems", 4323 journal = j-CACM, 4324 volume = "14", 4325 number = "6", 4326 pages = "380--390", 4327 month = jun, 4328 year = "1971", 4329 CODEN = "CACMA2", 4330 ISSN = "0001-0782", 4331 bibdate = "Tue Mar 25 13:26:09 MST 1997", 4332 acknowledgement = ack-nhfb, 4333 classcodes = "C4290 (Other computer theory)", 4334 corpsource = "Univ. North Carolina, Chapel Hill, NC, USA", 4335 keywords = "average response time prediction; computer graphics; computer graphics systems; computer metatheory; mathematical; model; optimisation; optimum design", 4336 treatment = "T Theoretical or Mathematical", 4337 } 4338 4339 @Article{Amarel:1971:CSC, 4340 author = "S. Amarel", 4341 title = "Computer Science: {A} Conceptual Framework for Curriculum Planning", 4342 journal = j-CACM, 4343 volume = "14", 4344 number = "6", 4345 pages = "391--401", 4346 month = jun, 4347 year = "1971", 4348 CODEN = "CACMA2", 4349 ISSN = "0001-0782", 4350 bibdate = "Tue Mar 25 13:26:09 MST 1997", 4351 abstract = "Two views of computer science are considered: a global view which attempts to capture broad characteristics of the field and its relationships to other fields, and a local view which focuses on the inner structure of the field. This structure is presented in terms of the kinds of knowledge, problems, and activities that exist within the discipline, as well as the relations between them. An approach to curriculum planning in computer science is presented which is guided by the structure of the field, by the fact that change is an important feature of the situation, and by the expectation that computer science will continue to increase its working contacts with other disciplines.", 4352 acknowledgement = ack-nhfb, 4353 classcodes = "C0220 (Computing education and training)", 4354 corpsource = "Rutgers Univ., New Brunswick, NJ, USA", 4355 keywords = "computer science; curriculum planning; education", 4356 treatment = "G General Review", 4357 } 4358 4359 @Article{Bosarge:1971:NPR, 4360 author = "W. E. {Bosarge, Jr.} and O. G. Johnson", 4361 title = "Numerical properties of the {Ritz-Trefftz} algorithm for optimal control", 4362 journal = j-CACM, 4363 volume = "14", 4364 number = "6", 4365 pages = "402--406", 4366 month = jun, 4367 year = "1971", 4368 CODEN = "CACMA2", 4369 ISSN = "0001-0782", 4370 MRclass = "65.30", 4371 MRnumber = "44\#7714", 4372 mrreviewer = "A. Pasquali", 4373 bibdate = "Tue Mar 25 13:26:09 MST 1997", 4374 abstract = "In this paper the Ritz-Trefftz algorithm is applied to the computer solution of the state regulator problem. The algorithm represents a modification of the Ritz direct method and is designed to improve the speed of solution and the storage requirements to the point where real-time implementation becomes feasible. The modification is shown to be more stable computationally than the traditional Ritz approach. \par The first concern of the paper is to describe the algorithm and establish its properties as a valid and useful numerical technique. In particular such useful properties as definiteness and reasonableness of condition are established for the method. The second part of the paper is devoted to a comparison of the new techniques with the standard procedure of numerically integrating a matrix Riccati equation to determine a feedback matrix. The new technique is shown to be significantly faster for comparable accuracy.", 4375 acknowledgement = ack-nhfb, 4376 classcodes = "C1330 (Optimal control); C4190 (Other numerical methods)", 4377 corpsource = "IBM Sci. Center, Houston, TX, USA", 4378 keywords = "control theory; equation; feedback matrix; matrix Riccati; numerical; numerical analysis; numerical integration; numerical methods; optimal control; properties; regulator problem; Ritz Trefftz algorithm; splines; state regulator problem", 4379 treatment = "T Theoretical or Mathematical", 4380 } 4381 4382 @Article{Gladwin:1971:NCF, 4383 author = "H. Tim Gladwin", 4384 title = "A Note on Compiling Fixed Point Binary Multiplications", 4385 journal = j-CACM, 4386 volume = "14", 4387 number = "6", 4388 pages = "407--408", 4389 month = jun, 4390 year = "1971", 4391 CODEN = "CACMA2", 4392 ISSN = "0001-0782", 4393 bibdate = "Tue Mar 25 13:26:09 MST 1997", 4394 abstract = "An algorithm is developed for compiling, as a sequence of shifts, additions,and subtractions, many fixed point binary multiplications involving a constant. The most significant characteristics of the algorithm are the simplicity of the test which determines if the algorithm should be applied and the degree to which it ``suggests'' efficient object code.", 4395 acknowledgement = ack-nhfb, 4396 classcodes = "C5230 (Digital arithmetic methods)", 4397 corpsource = "Univ. Washington, Seattle, WA, USA", 4398 keywords = "additions; compiling fixed point binary multiplications; compiling multiplications; digital arithmetic; fixed point arithmetic; program compilers; shifts; subtractions", 4399 treatment = "T Theoretical or Mathematical", 4400 } 4401 4402 @Article{Fraser:1971:MNP, 4403 author = "A. G. Fraser", 4404 title = "On the Meaning of Names in Programming Systems", 4405 journal = j-CACM, 4406 volume = "14", 4407 number = "6", 4408 pages = "409--416", 4409 month = jun, 4410 year = "1971", 4411 CODEN = "CACMA2", 4412 ISSN = "0001-0782", 4413 bibdate = "Tue Mar 25 13:26:09 MST 1997", 4414 bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/Functional.bib", 4415 acknowledgement = ack-nhfb, 4416 classcodes = "C4210 (Formal logic)", 4417 corpsource = "Bell Telephone Labs. Inc., Murray Hill, NJ, USA", 4418 keywords = "computational linguistics; context manipulation; data names; file; functional; lambda calculus; names; operating system; operating systems (computers); programming; programming systems; programming theory; theory", 4419 treatment = "G General Review", 4420 } 4421 4422 @Article{Walker:1971:BS, 4423 author = "R. J. Walker", 4424 title = "Binary summation", 4425 journal = j-CACM, 4426 volume = "14", 4427 number = "6", 4428 pages = "417--417", 4429 month = jun, 4430 year = "1971", 4431 CODEN = "CACMA2", 4432 ISSN = "0001-0782", 4433 bibdate = "Tue Mar 25 13:26:09 MST 1997", 4434 acknowledgement = ack-nhfb, 4435 classcodes = "C5230 (Digital arithmetic methods)", 4436 corpsource = "Cornell Univ., Ithaca, NY, USA", 4437 keywords = "binary summation; digital arithmetic; floating point; roundoff errors; space; storage", 4438 treatment = "T Theoretical or Mathematical", 4439 } 4440 4441 @Article{Zelkowitz:1971:IDP, 4442 author = "M. Zelkowitz", 4443 title = "Interrupt driven programming", 4444 journal = j-CACM, 4445 volume = "14", 4446 number = "6", 4447 pages = "417--418", 4448 month = jun, 4449 year = "1971", 4450 CODEN = "CACMA2", 4451 ISSN = "0001-0782", 4452 bibdate = "Tue Mar 25 13:26:09 MST 1997", 4453 acknowledgement = ack-nhfb, 4454 classcodes = "C5220 (Computer architecture)", 4455 corpsource = "Cornell Univ., Ithaca, NY, USA", 4456 keywords = "associative; control; debugging; interrupt drive programming; memories; microprogramming; parallel processing; program execution", 4457 treatment = "P Practical", 4458 } 4459 4460 @Article{McKenney:1971:SCO, 4461 author = "J. L. McKenney and F. M. Tonge", 4462 title = "The State of Computer-Oriented Curricula in Business Schools 1970", 4463 journal = j-CACM, 4464 volume = "14", 4465 number = "7", 4466 pages = "443--448", 4467 month = jul, 4468 year = "1971", 4469 CODEN = "CACMA2", 4470 ISSN = "0001-0782", 4471 bibdate = "Tue Mar 25 13:26:09 MST 1997", 4472 bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib", 4473 acknowledgement = ack-nhfb, 4474 classcodes = "C0220 (Computing education and training)", 4475 corpsource = "Harvard Univ., Cambridge, MA, USA", 4476 keywords = "business schools; computer curricula; education; reviews", 4477 treatment = "G General Review", 4478 } 4479 4480 @Article{Bernstein:1971:PTP, 4481 author = "A. J. Bernstein", 4482 title = "A programmer training project", 4483 journal = j-CACM, 4484 volume = "14", 4485 number = "7", 4486 pages = "449--452", 4487 month = jul, 4488 year = "1971", 4489 CODEN = "CACMA2", 4490 ISSN = "0001-0782", 4491 bibdate = "Tue Mar 25 13:26:09 MST 1997", 4492 acknowledgement = ack-nhfb, 4493 classcodes = "C0220 (Computing education and training)", 4494 corpsource = "General Electric Res. and Dev. Center, Schenectady, NY, USA", 4495 keywords = "black; course organisation; curriculum; jobs; programmer training project; programming; residents; training", 4496 treatment = "G General Review", 4497 } 4498 4499 @Article{DeRemer:1971:SLK, 4500 author = "Franklin L. DeRemer", 4501 title = "Simple {LR(k)} grammars", 4502 journal = j-CACM, 4503 volume = "14", 4504 number = "7", 4505 pages = "453--460", 4506 month = jul, 4507 year = "1971", 4508 CODEN = "CACMA2", 4509 ISSN = "0001-0782", 4510 MRclass = "68A30", 4511 MRnumber = "47 9893", 4512 mrreviewer = "J. E. L. Peck", 4513 bibdate = "Tue Mar 25 13:26:09 MST 1997", 4514 abstract = "A class of context-free grammars, called the ``Simple LR(k)'' or SLR(k) grammars is defined.\par This class has been shown to include weak precedence and simple precedence grammars as proper subsets. \par How to construct parsers for the SLR(k) grammars is also shown. These parser-construction techniques are extendible to cover all of the LR(k) grammars of Knuth; they have been implemented and by direct comparison proved to be superior to precedence techniques, not only in the range of grammars covered, but also in the speed of parser construction and in the size and speed of the resulting parsers.", 4515 acknowledgement = ack-nhfb, 4516 classcodes = "C4210 (Formal logic)", 4517 corpsource = "Univ. of California, Santa Cruz, CA, USA", 4518 keywords = "context-free grammar; deterministic pushdown automaton; finite-state machine; LR(k) grammar; parser; parsing algorithm; precedence grammar; syntactic analysis", 4519 keywords = "context free grammars; context-free grammars; grammars; parser construction; precedence; simple LR(K) grammars", 4520 treatment = "T Theoretical or Mathematical", 4521 } 4522 4523 @Article{Pratt:1971:LEG, 4524 author = "Terrence W. Pratt and Daniel P. Friedman", 4525 title = "A Language Extension for Graph Processing, and Its Formal Semantics", 4526 journal = j-CACM, 4527 volume = "14", 4528 number = "7", 4529 pages = "460--467 (or 461--467??)", 4530 month = jul, 4531 year = "1971", 4532 CODEN = "CACMA2", 4533 ISSN = "0001-0782", 4534 MRclass = "68A30", 4535 MRnumber = "46 6657", 4536 mrreviewer = "A. D. Booth", 4537 bibdate = "Tue Mar 25 13:26:09 MST 1997", 4538 bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Ai/lisp.bib", 4539 acknowledgement = ack-nhfb, 4540 classcodes = "C6140D (High level languages)", 4541 corpsource = "Univ. Texas, Austin, TX, USA", 4542 keywords = "data structure; directed graph; flowchart; formal semantics; graph processing; Graspe; language extension; Lisp; problem oriented languages; syntax", 4543 treatment = "T Theoretical or Mathematical", 4544 } 4545 4546 @Article{Paton:1971:ABC, 4547 author = "Keith Paton", 4548 title = "An algorithm for the blocks and cut nodes of a graph", 4549 journal = j-CACM, 4550 volume = "14", 4551 number = "7", 4552 pages = "468--475", 4553 month = jul, 4554 year = "1971", 4555 CODEN = "CACMA2", 4556 ISSN = "0001-0782", 4557 MRclass = "05-04", 4558 MRnumber = "46 5135", 4559 mrreviewer = "E. M. Reingold", 4560 bibdate = "Tue Mar 25 13:26:09 MST 1997", 4561 note = "See corrigendum \cite{Paton:1971:CAB}.", 4562 abstract = "An efficient method is presented for finding blocks and cutnodes of an arbitrary undirected graph. The graph may be represented either (i) as an ordered list of edges or (ii) as a packed adjacency matrix. If $w$ denotes the word length of the machine employed, the storage (in machine words) required for a graph with $n$ nodes and $m$ edges increases essentially as $2(m+n)$ in case (i), or $(n^2)/w$ in case (ii). A spanning tree with labeled edges is grown, two edges finally bearing different labels if and only if they belong to different blocks. For both representations the time required to analyze a graph on $n$ nodes increases as $n^G$ where $G$ depends on the type of graph, $1 <= G <= 2$, and both bounds are attained. \par Values of G are derived for each of several suitable families of test graphs, generated by an extension of the web grammar approach. The algorithm is compared in detail with that proposed by Read for which 1 <= G <= 3.", 4563 acknowledgement = ack-nhfb, 4564 classcodes = "C1160 (Combinatorial mathematics)", 4565 corpsource = "Medical Res. Council, London, UK", 4566 keywords = "algorithm; block; block-cutpoint-tree; blocks; cut nodes; cutnode; fundamental cycle set; graph; graph theory; labelled edges; lobe; lobe decomposition; lobe decomposition graph; ordered list of edges; packed adjacency matrix; separable; spanning tree; undirected; web grammar", 4567 treatment = "T Theoretical or Mathematical", 4568 } 4569 4570 @Article{Ferguson:1971:BAM, 4571 author = "D. E. Ferguson", 4572 title = "Buffer Allocation in Merge-Sorting", 4573 journal = j-CACM, 4574 volume = "14", 4575 number = "7", 4576 pages = "476--478", 4577 month = jul, 4578 year = "1971", 4579 CODEN = "CACMA2", 4580 ISSN = "0001-0782", 4581 bibdate = "Tue Mar 25 13:26:09 MST 1997", 4582 abstract = "A fixed buffer allocation for merge-sorting is presented here which minimizes the number of input-output operations for a given order of merge. \par When sorting on movable arm disks, the number of seeks is equal to the number of input-output operations, and the seek time usually controls the sort time. First some standard terminology is introduced. Then the input buffer allocation method is described, followed by an analysis of the improvement to be expected over more conventional allocation. This analysis makes use of a particular distribution function. An analysis of a completely different distribution is given which yields similar results. This suggests that the results do not depend on a particular distribution function. An optimum output buffer size is also determined. It is concluded that this buffering allocation can significantly reduce the time of merge sorting on movable arm disks when the input data are not random, and that this output buffer allocation should be used whether the data is random or not.", 4583 acknowledgement = ack-nhfb, 4584 classcodes = "C6130 (Data handling techniques)", 4585 corpsource = "Programmatics Inc., Los Angeles, CA, USA", 4586 keywords = "file; fixed buffer allocation; gamma distribution function; input output operations; item; merge sort; movable arm disks; optimum; output buffer size; seek time; sorting; storage allocation; string", 4587 treatment = "T Theoretical or Mathematical", 4588 } 4589 4590 @Article{Ramamoorthy:1971:SOE, 4591 author = "C. V. Ramamoorthy and M. J. Gonzalez", 4592 title = "Subexpression ordering in the execution of arithmetic expressions", 4593 journal = j-CACM, 4594 volume = "14", 4595 number = "7", 4596 pages = "479--485", 4597 month = jul, 4598 year = "1971", 4599 CODEN = "CACMA2", 4600 ISSN = "0001-0782", 4601 MRclass = "68A20", 4602 MRnumber = "46 6650", 4603 mrreviewer = "A. D. Booth", 4604 bibdate = "Tue Mar 25 13:26:09 MST 1997", 4605 abstract = "An arithmetic expression can often be broken down into its component subexpressions. Depending on the hardware environment in which the expression is to be executed, these subexpressions can be evaluated in serials, in parallel, or in a combination of these modes. This paper shows that expression execution time can be minimized only if consideration is given to the ordering of the subexpressions. In particular, subexpressions should be executed in order of decreasing memory and processor time requirements. This observation is valid for configurations ranging from a uniprocessor with an unbuffered main memory to multiprocessor with a ``cache'' buffer memory. If the number of subexpressions which can be executed in parallel exceeds the number of available processors, then execution of some of these subexpressions must be postponed. A procedure is given which combines this requirement with the earlier ordering considerations to provide an optimal execution sequence.", 4606 acknowledgement = ack-nhfb, 4607 classcodes = "C5230 (Digital arithmetic methods); C6130 (Data handling techniques)", 4608 corpsource = "Univ. Texas, Austin, TX, USA", 4609 keywords = "arithmetic expression; arithmetic expressions; cache; compilers; computational trees; data handling; digital arithmetic; execution time; parallel processing; subexpression ordering", 4610 treatment = "T Theoretical or Mathematical", 4611 } 4612 4613 @Article{McVitie:1971:SMP, 4614 author = "D. G. McVitie and L. B. Wilson", 4615 title = "The Stable Marriage Problem", 4616 journal = j-CACM, 4617 volume = "14", 4618 number = "7", 4619 pages = "486--490", 4620 month = jul, 4621 year = "1971", 4622 CODEN = "CACMA2", 4623 ISSN = "0001-0782", 4624 MRclass = "90B99 (68A10)", 4625 MRnumber = "46 6808", 4626 mrreviewer = "R. B. Potts", 4627 bibdate = "Tue Mar 25 13:26:09 MST 1997", 4628 abstract = "The original work of Gale and Shapley on an assignment method using the stable marriage criterion has been extended to find all the stable marriage assignments.\par The algorithm derived for finding all the stable marriage assignments is proved to satisfy all the conditions of the problem. Algorithm 411 applies to this paper.", 4629 acknowledgement = ack-nhfb, 4630 classcodes = "C1160 (Combinatorial mathematics); C7310 (Mathematics computing)", 4631 corpsource = "Univ. Newcastle upon Tyne, UK", 4632 keywords = "assignment; assignment problems; assignment procedures; combinatorial mathematics; combinatorics; discrete mathematics; operational research; operations research; stable marriage problem; university entrance", 4633 treatment = "T Theoretical or Mathematical", 4634 } 4635 4636 @Article{McVitie:1971:AAT, 4637 author = "D. G. McVitie and L. B. Wilson", 4638 title = "{ACM} Algorithm 411: Three Procedures for the Stable Marriage Problem", 4639 journal = j-CACM, 4640 volume = "14", 4641 number = "7", 4642 pages = "491--492", 4643 month = jul, 4644 year = "1971", 4645 CODEN = "CACMA2", 4646 ISSN = "0001-0782", 4647 bibdate = "Tue Mar 25 13:26:09 MST 1997", 4648 acknowledgement = ack-nhfb, 4649 classcodes = "C7310 (Mathematics computing)", 4650 corpsource = "Univ. Newcastle upon Tyne, UK", 4651 keywords = "ALGOL procedures; assignment; combinatorial mathematics; operations research; stable marriage problem; subroutines", 4652 treatment = "T Theoretical or Mathematical", 4653 } 4654 4655 @Article{Cermak:1971:AAG, 4656 author = "J. {\v{C}}erm{\'{a}}k", 4657 title = "{ACM} Algorithm 412: Graph Plotter", 4658 journal = j-CACM, 4659 volume = "14", 4660 number = "7", 4661 pages = "492--493", 4662 month = jul, 4663 year = "1971", 4664 CODEN = "CACMA2", 4665 ISSN = "0001-0782", 4666 bibdate = "Tue Mar 25 13:26:09 MST 1997", 4667 bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/acm.bib", 4668 acknowledgement = ack-nhfb, 4669 classcodes = "C6150E (General utility programs)", 4670 corpsource = "Univ. Chem. Technol., Pardubice, Czechoslovakia", 4671 keywords = "ALGOL procedure; computer graphics; graph; line; multivalued function; plot; printer; subroutines; utility programs", 4672 treatment = "T Theoretical or Mathematical", 4673 } 4674 4675 @Article{Anonymous:1971:PSS, 4676 author = "Anonymous", 4677 title = "Papers from the 2nd symposium on symbolic and algebraic manipulation", 4678 journal = j-CACM, 4679 volume = "14", 4680 number = "8", 4681 pages = "??--??", 4682 month = aug, 4683 year = "1971", 4684 CODEN = "CACMA2", 4685 ISSN = "0001-0782", 4686 bibdate = "Tue Mar 25 13:26:09 MST 1997", 4687 acknowledgement = ack-nhfb, 4688 classcodes = "B0210 (Algebra); C1110 (Algebra)", 4689 conflocation = "Los Angeles, CA, USA; 23-25 March 1971", 4690 conftitle = "Papers from the 2nd symposium on symbolic and algebraic manipulation", 4691 keywords = "algebra; algebraic expressions; equivalence; greatest common divisors; polynomial; polynomials; resultants; roots; subresultants; symbolic and algebraic manipulation; zero", 4692 sponsororg = "Assoc. Computing Machinery", 4693 treatment = "T Theoretical or Mathematical", 4694 } 4695 4696 @Article{Hearn:1971:ASM, 4697 author = "Anthony C. Hearn", 4698 title = "Applications of Symbolic Manipulation in Theoretical Physics", 4699 journal = j-CACM, 4700 volume = "14", 4701 number = "8", 4702 pages = "511--516", 4703 month = aug, 4704 year = "1971", 4705 CODEN = "CACMA2", 4706 ISSN = "0001-0782", 4707 bibdate = "Tue Mar 25 13:26:09 MST 1997", 4708 bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Theory/reduce.bib", 4709 abstract = "This paper surveys the applications of symbolic computation techniques to problems in theoretical physics. Particular emphasis is placed on applications in quantum electrodynamics where the most activity has occurred.", 4710 acknowledgement = ack-nhfb, 4711 classcodes = "C6130 (Data handling techniques)", 4712 conflocation = "Los Angeles, CA, USA; 23-25 March 1971", 4713 conftitle = "Papers from the 2nd symposium on symbolic and algebraic manipulation", 4714 corpsource = "Univ. Utah, Salt Lake City, UT, USA", 4715 keywords = "algebraic; algebraic simplification; computational physics; data handling; physics; quantum electrodynamics; simplification; symbol manipulation; symbolic computation; symbolic manipulation; theoretical physics", 4716 sponsororg = "Assoc. Computing Machinery", 4717 treatment = "T Theoretical or Mathematical", 4718 xxtitle = "Applications of symbol manipulation in theoretical physics", 4719 } 4720 4721 @Article{Hall:1971:ASR, 4722 author = "A. D. {Hall, Jr.}", 4723 title = "The {Altran} system for rational function manipulation --- a survey", 4724 journal = j-CACM, 4725 volume = "14", 4726 number = "8", 4727 pages = "517--521", 4728 month = aug, 4729 year = "1971", 4730 CODEN = "CACMA2", 4731 ISSN = "0001-0782", 4732 bibdate = "Tue Mar 25 13:26:09 MST 1997", 4733 acknowledgement = ack-nhfb, 4734 classcodes = "C6120 (File organisation); C6140D (High level languages); C7310 (Mathematics computing)", 4735 conflocation = "Los Angeles, CA, USA; 23-25 March 1971", 4736 conftitle = "Papers from the 2nd symposium on symbolic and algebraic manipulation", 4737 corpsource = "Bell Telephone Labs. Inc., Murray Hill, NJ, USA", 4738 keywords = "algebra; Altran; coefficients; computation; data structures; integer; language; languages; polynomial manipulation; polynomials; problem oriented; rational function manipulation; run time data structures; symbolic", 4739 sponsororg = "Assoc. Computing Machinery", 4740 treatment = "P Practical; T Theoretical or Mathematical", 4741 } 4742 4743 @Article{Fenichel:1971:LTS, 4744 author = "Robert R. Fenichel", 4745 title = "List Tracing in Systems Allowing Multiple Cell Types", 4746 journal = j-CACM, 4747 volume = "14", 4748 number = "8", 4749 pages = "522--526", 4750 month = aug, 4751 year = "1971", 4752 CODEN = "CACMA2", 4753 ISSN = "0001-0782", 4754 bibdate = "Tue Mar 25 13:26:09 MST 1997", 4755 bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Compiler/garbage.collection.bib", 4756 acknowledgement = ack-nhfb, 4757 classcodes = "C6130 (Data handling techniques)", 4758 conflocation = "Los Angeles, CA, USA; 23-25 March 1971", 4759 conftitle = "Papers from the 2nd symposium on symbolic and algebraic manipulation", 4760 corpsource = "MIT, Cambridge, MA, USA", 4761 keywords = "configuration; list processing; list tracing; multiple cell types; size; storage allocation", 4762 sponsororg = "Assoc. Computing Machinery", 4763 treatment = "P Practical", 4764 } 4765 4766 @Article{Moses:1971:ASG, 4767 author = "J. Moses", 4768 title = "Algebraic Simplification: {A} Guide for the Perplexed", 4769 journal = j-CACM, 4770 volume = "14", 4771 number = "8", 4772 pages = "527--537", 4773 month = aug, 4774 year = "1971", 4775 CODEN = "CACMA2", 4776 ISSN = "0001-0782", 4777 MRclass = "68A15", 4778 MRnumber = "46 8465", 4779 bibdate = "Tue Mar 25 13:26:09 MST 1997", 4780 bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Theory/Comp.Alg.1.bib", 4781 acknowledgement = ack-nhfb, 4782 classcodes = "B0210 (Algebra); C1110 (Algebra)", 4783 conflocation = "Los Angeles, CA, USA; 23-25 March 1971", 4784 conftitle = "Papers from the 2nd symposium on symbolic and algebraic manipulation", 4785 corpsource = "MIT, Cambridge, MA, USA", 4786 keywords = "algebra; algebraic simplification; automatic; simplification capabilities; substitution", 4787 sponsororg = "Assoc. Computing Machinery", 4788 treatment = "T Theoretical or Mathematical", 4789 } 4790 4791 @Article{Jefferys:1971:AAM, 4792 author = "W. H. Jefferys", 4793 title = "Automatic algebraic manipulation in celestial mechanics", 4794 journal = j-CACM, 4795 volume = "14", 4796 number = "8", 4797 pages = "538--541", 4798 month = aug, 4799 year = "1971", 4800 CODEN = "CACMA2", 4801 ISSN = "0001-0782", 4802 bibdate = "Tue Mar 25 13:26:09 MST 1997", 4803 acknowledgement = ack-nhfb, 4804 classcodes = "C7320 (Physics and chemistry computing)", 4805 conflocation = "Los Angeles, CA, USA; 23-25 March 1971", 4806 conftitle = "Papers from the 2nd symposium on symbolic and algebraic manipulation", 4807 corpsource = "Univ. Texas, Austin, TX, USA", 4808 keywords = "algebra; automated algebraic manipulation; celestial mechanics; integration; perturbation theory; physics; Poisson series; processors", 4809 sponsororg = "Assoc. Computing Machinery", 4810 treatment = "P Practical", 4811 } 4812 4813 @Article{Barton:1971:GRA, 4814 author = "D. Barton and J. P. Fitch", 4815 title = "General relativity and the application of algebraic manipulative systems", 4816 journal = j-CACM, 4817 volume = "14", 4818 number = "8", 4819 pages = "542--547", 4820 month = aug, 4821 year = "1971", 4822 CODEN = "CACMA2", 4823 ISSN = "0001-0782", 4824 MRclass = "83.53", 4825 MRnumber = "48 1640", 4826 mrreviewer = "I. K. Marek", 4827 bibdate = "Tue Mar 25 13:26:09 MST 1997", 4828 abstract = "The paper describes some applications of symbolic algebra systems to problems of general relativity including the derivation of the field equations, the Petrov classification of a metric, and the solution of the field equations in the presence of matter in a simple case. Attention is drawn to the strictly algebraic difficulties encountered in this work.", 4829 acknowledgement = ack-nhfb, 4830 classcodes = "B0210 (Algebra); C1110 (Algebra)", 4831 conflocation = "Los Angeles, CA, USA; 23-25 March 1971", 4832 conftitle = "Papers from the 2nd symposium on symbolic and algebraic manipulation", 4833 corpsource = "Computer Lab., Cambridge, UK", 4834 keywords = "algebra; algebraic manipulation; algebraic manipulative systems; equation manipulation; field equations; general relativity; nonnumerical mathematics; Petrov classification; symbolic; symbolic mathematics", 4835 sponsororg = "Assoc. Computing Machinery", 4836 treatment = "A Application; T Theoretical or Mathematical", 4837 } 4838 4839 @Article{Moses:1971:SIS, 4840 author = "Joel Moses", 4841 title = "Symbolic Integration: The Stormy Decade", 4842 journal = j-CACM, 4843 volume = "14", 4844 number = "8", 4845 pages = "548--560", 4846 month = aug, 4847 year = "1971", 4848 CODEN = "CACMA2", 4849 ISSN = "0001-0782", 4850 MRclass = "68A15", 4851 MRnumber = "46 8466", 4852 mrreviewer = "D. B. Hunter", 4853 bibdate = "Tue Mar 25 13:26:09 MST 1997", 4854 abstract = "Three approaches to symbolic integration in the 1960's are described. The first, from artificial intelligence, led to Slagle's SAINT and to a large degree to Moses' SIN. The second, from algebraic manipulation, led to Manove's implementation and to Horowitz' and Tobey's reexamination of the Hermite algorithm for integrating rational functions. The third, from mathematics, led to Richardson's proof of the unsolvability of the problem for a class of functions and for Risch's decision procedure for the elementary functions.Generalizations of Risch's algorithm to a class of special functions and programs for solving differential equations and for finding the definite integral are also described.", 4855 acknowledgement = ack-nhfb, 4856 classcodes = "C1230 (Artificial intelligence); C4160 (Numerical integration and differentiation)", 4857 conflocation = "Los Angeles, CA, USA; 23-25 March 1971", 4858 conftitle = "Papers from the 2nd symposium on symbolic and algebraic manipulation", 4859 corpsource = "MIT, Cambridge, MA, USA", 4860 keywords = "algorithm; artificial intelligence; definite; definite integrals; differential equations; Hermite; integral; integrating rational functions; integration; Manove's implementation; Moses' SIN; proof; rational functions; Richardson's; Risch's decision procedure; SAINT; Slagle's; symbolic integration; unsolvability", 4861 sponsororg = "Assoc. Computing Machinery", 4862 treatment = "G General Review; T Theoretical or Mathematical", 4863 } 4864 4865 @Article{Teichroew:1971:ERU, 4866 author = "Daniel Teichroew", 4867 title = "Education Related to the Use of Computers in Organizations", 4868 journal = j-CACM, 4869 volume = "14", 4870 number = "9", 4871 pages = "573--588", 4872 month = sep, 4873 year = "1971", 4874 CODEN = "CACMA2", 4875 ISSN = "0001-0782", 4876 bibdate = "Tue Mar 25 13:26:09 MST 1997", 4877 bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib", 4878 acknowledgement = ack-nhfb, 4879 annote = "Learn about data bases and management. Extensive bibliography.", 4880 classcodes = "C0220 (Computing education and training)", 4881 keywords = "colleges; computer education; curriculum development; education; information systems; management; management information systems; professional; societies; universities", 4882 treatment = "G General Review", 4883 } 4884 4885 @Article{Isoda:1971:EBT, 4886 author = "Sadahiro Isoda and Eiichi Goto and Izumi Kimura", 4887 title = "An Efficient Bit Table Technique for Dynamic Storage Allocation of $2^n$-word Blocks", 4888 journal = j-CACM, 4889 volume = "14", 4890 number = "9", 4891 pages = "589--592", 4892 month = sep, 4893 year = "1971", 4894 CODEN = "CACMA2", 4895 ISSN = "0001-0782", 4896 bibdate = "Tue Mar 25 13:26:09 MST 1997", 4897 abstract = "An efficient bit table technique for dynamic storage allocation of $2^n$-word blocks, which requires a minimized amount of memory for bookkeeping purposes, is described. The technique has been tested in an implementation of the list processing language $L^6$. A number of ideas incorporated in the processor are also described.", 4898 acknowledgement = ack-nhfb, 4899 classcodes = "C6120 (File organisation)", 4900 corpsource = "Tokyo Univ., Japan", 4901 keywords = "$L^6$; 2/sup n/ word blocks; bit table; bit table technique; bookkeeping; buddy system; dynamic storage allocation; free storage; L/sup 6/; list processing; list processing language; minimum memory; storage allocation", 4902 treatment = "P Practical", 4903 } 4904 4905 @Article{Paton:1971:CAB, 4906 author = "Keith Paton", 4907 title = "Corrigendum: ``{An algorithm for the blocks and cutnodes of a graph}''", 4908 journal = j-CACM, 4909 volume = "14", 4910 number = "9", 4911 pages = "592--592", 4912 month = sep, 4913 year = "1971", 4914 CODEN = "CACMA2", 4915 ISSN = "0001-0782", 4916 bibdate = "Fri Jan 17 18:33:19 1997", 4917 note = "See \cite{Paton:1971:ABC}.", 4918 acknowledgement = ack-nhfb, 4919 } 4920 4921 @Article{Wong:1971:CSA, 4922 author = "Eugene Wong and T. C. Chiang", 4923 title = "Canonical Structure in Attribute Based File Organization", 4924 journal = j-CACM, 4925 volume = "14", 4926 number = "9", 4927 pages = "593--597", 4928 month = sep, 4929 year = "1971", 4930 CODEN = "CACMA2", 4931 ISSN = "0001-0782", 4932 bibdate = "Tue Mar 25 13:26:09 MST 1997", 4933 bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib", 4934 note = "Also published in/as: PhD Th., UCB, EECS, 1973.", 4935 acknowledgement = ack-nhfb, 4936 annote = "Combinatorial retrieval of multi-attribute subsets, applicable when there are few keyword choices. Thisis of T. C. Chiang.", 4937 classcodes = "C6120 (File organisation)", 4938 corpsource = "Univ. California, Berkeley, CA, USA", 4939 keywords = "arbitrary Boolean functions; atoms; attribute based; boolean algebra; canonical structure; file organisation; file organization; intersections; lists; queries", 4940 treatment = "T Theoretical or Mathematical", 4941 } 4942 4943 @Article{Phillips:1971:NBO, 4944 author = "David L. Phillips", 4945 title = "A note on best one-sided approximations", 4946 journal = j-CACM, 4947 volume = "14", 4948 number = "9", 4949 pages = "598--600", 4950 month = sep, 4951 year = "1971", 4952 CODEN = "CACMA2", 4953 ISSN = "0001-0782", 4954 MRclass = "65D15", 4955 MRnumber = "45 6158", 4956 mrreviewer = "H. L. Loeb", 4957 bibdate = "Tue Mar 25 13:26:09 MST 1997", 4958 acknowledgement = ack-nhfb, 4959 classcodes = "C4130 (Interpolation and function approximation)", 4960 corpsource = "Argonne Nat. Lab., IL, USA", 4961 keywords = "best; best approximation; best approximations; error; function approximation; goodness of fit; logarithmic; multiplicative constant; one sided approximations; one-sided approximation; relationship; relative error; uniform norm", 4962 treatment = "T Theoretical or Mathematical", 4963 } 4964 4965 @Article{Liniger:1971:SCN, 4966 author = "W. Liniger", 4967 title = "A stopping criterion for the {Newton-Raphson} method in implicit multistep integration algorithms for nonlinear systems of ordinary differential equations", 4968 journal = j-CACM, 4969 volume = "14", 4970 number = "9", 4971 pages = "600--601", 4972 month = sep, 4973 year = "1971", 4974 CODEN = "CACMA2", 4975 ISSN = "0001-0782", 4976 MRclass = "65.60", 4977 MRnumber = "44\#7754", 4978 bibdate = "Tue Mar 25 13:26:09 MST 1997", 4979 acknowledgement = ack-nhfb, 4980 classcodes = "C4170 (Differential equations)", 4981 corpsource = "IBM, Yorktown Heights, NY, USA", 4982 keywords = "implicit multistep integration; integration; linear multistep formulas; Newton-Raphson method; nonlinear differential equations; nonlinear systems; ordinary differential equations; stopping criterion", 4983 treatment = "T Theoretical or Mathematical", 4984 } 4985 4986 @Article{Flores:1971:ABS, 4987 author = "Ivan Flores and George Madpis", 4988 title = "Average Binary Search Length for Dense Ordered Lists", 4989 journal = j-CACM, 4990 volume = "14", 4991 number = "9", 4992 pages = "602--603", 4993 month = sep, 4994 year = "1971", 4995 CODEN = "CACMA2", 4996 ISSN = "0001-0782", 4997 bibdate = "Tue Mar 25 13:26:09 MST 1997", 4998 note = "See corrigendum \cite{Flores:1972:CAB}.", 4999 acknowledgement = ack-nhfb, 5000 classcodes = "C6130 (Data handling techniques)", 5001 corpsource = "City Univ. New York, NY, USA", 5002 keywords = "average length; binary search; dense ordered lists; information retrieval; list processing", 5003 treatment = "T Theoretical or Mathematical", 5004 } 5005 5006 @Article{Fenichel:1971:CCL, 5007 author = "R. R. Fenichel", 5008 title = "Comment on Cheney's List-Compaction Algorithm", 5009 journal = j-CACM, 5010 volume = "14", 5011 number = "9", 5012 pages = "603--604", 5013 month = sep, 5014 year = "1971", 5015 CODEN = "CACMA2", 5016 ISSN = "0001-0782", 5017 bibdate = "Fri Jan 17 18:31:54 1997", 5018 keywords = "garbage collector; LISP; list processing; storage allocation; virtual memory", 5019 } 5020 5021 @Article{Earley:1971:TUD, 5022 author = "Jay Earley", 5023 title = "Toward an Understanding of Data Structures", 5024 journal = j-CACM, 5025 volume = "14", 5026 number = "10", 5027 pages = "617--627", 5028 month = oct, 5029 year = "1971", 5030 CODEN = "CACMA2", 5031 ISSN = "0001-0782", 5032 bibdate = "Tue Mar 25 13:26:09 MST 1997", 5033 bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib", 5034 acknowledgement = ack-nhfb, 5035 classcodes = "C6120 (File organisation)", 5036 corpsource = "Univ. California, Berkeley, CA, USA", 5037 keywords = "data structures; formalism; graph; implementation; programming language; semantic", 5038 treatment = "P Practical", 5039 } 5040 5041 @Article{ANSI:1971:CFS, 5042 author = "{ANSI Subcommittee X3J3}", 5043 title = "Clarification of {Fortran} Standards --- Second Report", 5044 journal = j-CACM, 5045 volume = "14", 5046 number = "10", 5047 pages = "628--642", 5048 month = oct, 5049 year = "1971", 5050 CODEN = "CACMA2", 5051 ISSN = "0001-0782", 5052 bibdate = "Tue Mar 25 13:26:09 MST 1997", 5053 note = "See also \cite{ANSI:1966:AF}.", 5054 acknowledgement = ack-nhfb, 5055 classcodes = "C0200 (General computer topics); C6140D (High level languages)", 5056 keywords = "American National Standard; Basic Fortran; Fortran; FORTRAN; language; language standard; language standard interpretation; language standard maintenance; programming language; specification; standard clarification; standardization; standardization committee; standards", 5057 treatment = "G General Review", 5058 } 5059 5060 @Article{Oldehoeft:1971:EAI, 5061 author = "A. E. Oldehoeft and S. D. Conte", 5062 title = "Experiments with an automated instructional system for numerical methods", 5063 journal = j-CACM, 5064 volume = "14", 5065 number = "10", 5066 pages = "643--650", 5067 month = oct, 5068 year = "1971", 5069 CODEN = "CACMA2", 5070 ISSN = "0001-0782", 5071 bibdate = "Tue Mar 25 13:26:09 MST 1997", 5072 acknowledgement = ack-nhfb, 5073 classcodes = "C7810C (Computer-aided instruction)", 5074 corpsource = "Iowa State Univ., Ames, IA, USA", 5075 keywords = "computer aided; computer aided instruction; instruction; instructional systems; numerical methods", 5076 treatment = "X Experimental", 5077 } 5078 5079 @Article{Newman:1971:DP, 5080 author = "W. M. Newman", 5081 title = "Display procedures", 5082 journal = j-CACM, 5083 volume = "14", 5084 number = "10", 5085 pages = "651--660", 5086 month = oct, 5087 year = "1971", 5088 CODEN = "CACMA2", 5089 ISSN = "0001-0782", 5090 bibdate = "Tue Mar 25 13:26:09 MST 1997", 5091 acknowledgement = ack-nhfb, 5092 classcodes = "C5540 (Terminals and graphic displays)", 5093 corpsource = "Univ. Utah, Salt Lake City, UT, USA", 5094 keywords = "computer graphics; display files; display systems; programming languages", 5095 treatment = "G General Review", 5096 } 5097 5098 @Article{Nemeth:1971:UPM, 5099 author = "A. G. Nemeth and P. D. Rovner", 5100 title = "User program measurement in a time-shared environment", 5101 journal = j-CACM, 5102 volume = "14", 5103 number = "10", 5104 pages = "661--666", 5105 month = oct, 5106 year = "1971", 5107 CODEN = "CACMA2", 5108 ISSN = "0001-0782", 5109 bibdate = "Tue Mar 25 13:26:09 MST 1997", 5110 bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/monitor.bib and ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1971.bib", 5111 abstract = "A general discussion of the measurement of software systems is followed by a description of a hardware and software scheme for measuring user programs in a time-shared environment. The TX-2 computer at MIT Lincoln Laboratory was used for the implementation of such a system and the characteristics of this implementation are reported. Finally, it is shown how other time-sharing systems may provide similar measuring facilities.", 5112 acknowledgement = ack-nhfb, 5113 annote = "A general discussion of the measurement of software systems is followed by a description of a hardware and software scheme for measuring user programs in a time-shared environment.", 5114 classcodes = "C6150J (Operating systems)", 5115 corpsource = "MIT, Lexington, MA, USA", 5116 country = "USA", 5117 descriptors = "Performance evaluation; software monitor; time sharing; operating system; multiprogramming; measurement; technology; virtual computer; performance improvement;", 5118 enum = "2252", 5119 keywords = "computer software; measurement; multiprogramming systems; operating systems; performance improvement; sharing systems; software; technology; time; time-sharing systems; TX2 computer; user program measurement; virtual computers", 5120 language = "English", 5121 references = "11", 5122 treatment = "G General Review", 5123 } 5124 5125 @Article{Courtois:1971:CC, 5126 author = "P. J. Courtois and F. Heymans and D. L. Parnas", 5127 title = "Concurrent Control with `Readers' and `Writers'", 5128 journal = j-CACM, 5129 volume = "14", 5130 number = "10", 5131 pages = "667--668", 5132 month = oct, 5133 year = "1971", 5134 CODEN = "CACMA2", 5135 ISSN = "0001-0782", 5136 bibdate = "Tue Mar 25 13:26:09 MST 1997", 5137 bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib and ftp://ftp.ira.uka.de/pub/bibliography/Misc/softeng.bib", 5138 acknowledgement = ack-nhfb, 5139 annote = "Algorithms for scheduler design for multi accessed database", 5140 classcodes = "C6150J (Operating systems)", 5141 corpsource = "MBLE Res. Lab., Brussels, Belgium", 5142 keywords = "critical section; mutual exclusion; operating systems (computers); programs; resources; shared access to; supervisory and executive", 5143 treatment = "P Practical", 5144 } 5145 5146 @Article{Lyness:1971:AAE, 5147 author = "J. N. Lyness and G. Sande", 5148 title = "{ACM} Algorithm 413: {ENTCAF} and {ENTCRE}: Evaluation of Normalized {Taylor} Coefficients of an Analytic Function ({C5})", 5149 journal = j-CACM, 5150 volume = "14", 5151 number = "10", 5152 pages = "669--675", 5153 month = oct, 5154 year = "1971", 5155 CODEN = "CACMA2", 5156 ISSN = "0001-0782", 5157 bibdate = "Tue Mar 25 13:26:09 MST 1997", 5158 acknowledgement = ack-nhfb, 5159 classcodes = "C7310 (Mathematics computing)", 5160 corpsource = "Argonne Nat. Lab., IL, USA", 5161 keywords = "Cauchy integral; complex arithmetic; complex variables; fast; Fourier transform; interpolation; mathematics; numerical differentiation; numerical integration; subroutines; Taylor coefficients; Taylor series", 5162 treatment = "T Theoretical or Mathematical", 5163 } 5164 5165 @Article{Branquart:1971:CSA, 5166 author = "P. Branquart and J. Lewi and M. Sintzoff and P. L. Wodon", 5167 title = "The composition of semantics in {Algol 68}", 5168 journal = j-CACM, 5169 volume = "14", 5170 number = "11", 5171 pages = "697--708", 5172 month = nov, 5173 year = "1971", 5174 CODEN = "CACMA2", 5175 ISSN = "0001-0782", 5176 bibdate = "Tue Mar 25 13:26:09 MST 1997", 5177 acknowledgement = ack-nhfb, 5178 classcodes = "C6140D (High level languages)", 5179 corpsource = "MBLE, Brussels, Belgium", 5180 keywords = "ALGOL; Algol 68; data; design of programming languages; programming languages; programming primitives; recursive composition; semantics; structures", 5181 treatment = "T Theoretical or Mathematical", 5182 } 5183 5184 @Article{Hamblen:1971:UCH, 5185 author = "J. W. Hamblen", 5186 title = "Using computers in higher education: past recommendations, status, and needs", 5187 journal = j-CACM, 5188 volume = "14", 5189 number = "11", 5190 pages = "709--712", 5191 month = nov, 5192 year = "1971", 5193 CODEN = "CACMA2", 5194 ISSN = "0001-0782", 5195 bibdate = "Tue Mar 25 13:26:09 MST 1997", 5196 acknowledgement = ack-nhfb, 5197 classcodes = "C0220 (Computing education and training)", 5198 corpsource = "Southern Regional Education Board, Atlanta, GA, USA", 5199 keywords = "computer science; computers; data processing; degree programs; education; educational technology; higher education; laboratory; national goals; testing", 5200 treatment = "G General Review", 5201 } 5202 5203 @Article{Shell:1971:OPS, 5204 author = "D. L. Shell", 5205 title = "Optimizing the Polyphase Sort", 5206 journal = j-CACM, 5207 volume = "14", 5208 number = "11", 5209 pages = "713--719", 5210 month = nov, 5211 year = "1971", 5212 CODEN = "CACMA2", 5213 ISSN = "0001-0782", 5214 bibdate = "Tue Mar 25 13:26:09 MST 1997", 5215 note = "See corrigendum \cite{Shell:1972:COP}.", 5216 abstract = "Various dispersion algorithms for the polyphase sorting procedure are examined.The optimum algorithm based on minimizing the total number of unit strings read is displayed. The logic of this algorithm is rather complicated; hence, several other new dispersion algorithms with more straightforward logic are presented. Of the simple dispersion algorithms discussed, the Horizontal is best. It does approximately one-fourth to one and one-half percent less reading and writing than most algorithms in use today. An additional two and one-fourth to three percent improvement can be achieved by utilizing the Modified Optimum Algorithm. This algorithm is relatively straightforward, but it requires a fairly close estimate of the total number of unit strings before the dispersion begins.", 5217 acknowledgement = ack-nhfb, 5218 classcodes = "C6130 (Data handling techniques)", 5219 corpsource = "General Electric Co., Schenectady, NY, USA", 5220 keywords = "dispersion algorithm; dispersion algorithms; minimizing; optimisation; optimum; optimum dispersion algorithm; polyphase sorting; repetition operator; sorting; unit strings", 5221 treatment = "T Theoretical or Mathematical", 5222 } 5223 5224 @Article{Aramaki:1971:AEL, 5225 author = "I. Aramaki and T. Kawabata and K. Arimoto", 5226 title = "Automation of etching-pattern layout", 5227 journal = j-CACM, 5228 volume = "14", 5229 number = "11", 5230 pages = "720--730", 5231 month = nov, 5232 year = "1971", 5233 CODEN = "CACMA2", 5234 ISSN = "0001-0782", 5235 bibdate = "Tue Mar 25 13:26:09 MST 1997", 5236 acknowledgement = ack-nhfb, 5237 classcodes = "B1130B (Computer-aided circuit analysis and design); B2210 (Printed circuits); C7410D (Electronic engineering computing)", 5238 corpsource = "Sumitomo Electric Industries Ltd., Osaka, Japan", 5239 keywords = "computer-aided circuit design; etching; heuristic etching pattern layout; ICs; Lee's algorithm; maze running; printed circuit board; printed circuits; wiring design", 5240 treatment = "P Practical", 5241 } 5242 5243 @Article{Malcolm:1971:AFP, 5244 author = "Michael A. Malcolm", 5245 title = "On Accurate Floating-Point Summation", 5246 journal = j-CACM, 5247 volume = "14", 5248 number = "11", 5249 pages = "731--736", 5250 month = nov, 5251 year = "1971", 5252 CODEN = "CACMA2", 5253 ISSN = "0001-0782", 5254 MRclass = "65G05 (68-XX)", 5255 MRnumber = "47 4434", 5256 mrreviewer = "P. Brock", 5257 bibdate = "Tue Mar 25 13:26:09 MST 1997", 5258 bibsource = "garbo.uwasa.fi:/pc/doc-soft/fpbiblio.txt", 5259 acknowledgement = ack-nj, 5260 acknowledgement = ack-nhfb, 5261 classcodes = "C5230 (Digital arithmetic methods)", 5262 corpsource = "Stanford Univ., CA, USA", 5263 keywords = "digital arithmetic; error analysis; floating point summation", 5264 treatment = "P Practical", 5265 } 5266 5267 @Article{Golub:1971:AAC, 5268 author = "G. H. Golub and L. B. Smith", 5269 title = "{ACM} Algorithm 414: {Chebyshev} Approximation of Continuous Functions by a {Chebyshev} System of Functions", 5270 journal = j-CACM, 5271 volume = "14", 5272 number = "11", 5273 pages = "737--746", 5274 month = nov, 5275 year = "1971", 5276 CODEN = "CACMA2", 5277 ISSN = "0001-0782", 5278 bibdate = "Tue Mar 25 13:26:09 MST 1997", 5279 bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/acm.bib", 5280 acknowledgement = ack-nhfb, 5281 classcodes = "C4130 (Interpolation and function approximation); C7310 (Mathematics computing)", 5282 corpsource = "Stanford Univ., CA, USA", 5283 keywords = "ALGOL 60; approximation; Chebyshev approximation; critical points; minimax; numerical properties; orthogonal polynomials; Remez algorithm; subroutines", 5284 treatment = "P Practical; T Theoretical or Mathematical", 5285 } 5286 5287 @Article{Gordon:1971:RPT, 5288 author = "R. Gordon and G. T. Herman", 5289 title = "Reconstruction of Pictures from Their Projections", 5290 journal = j-CACM, 5291 volume = "14", 5292 number = "12", 5293 pages = "759--768", 5294 month = dec, 5295 year = "1971", 5296 CODEN = "CACMA2", 5297 ISSN = "0001-0782", 5298 bibdate = "Tue Mar 25 13:26:09 MST 1997", 5299 note = "See corrigendum \cite{Gordon:1972:CRP}.", 5300 abstract = "There are situations in the natural sciences and medicine (e.g. in electron microscopy and X-ray photography) in which it is desirable to estimate the gray levels of a digital picture at the individual points from the sums of the gray levels along straight lines (projections) at a few angles. Usually, in such situations, the picture is far from determined and the problem is to find the ``most representative'' picture. Three algorithms are described (all using Monte Carlo methods) which were designed to solve this problem. The algorithms are applicable in a large and varied number of fields. The most important uses may be the reconstruction of possibly asymmetric particles from electron micrographs and three-dimensional X-ray analysis.", 5301 acknowledgement = ack-nhfb, 5302 classcodes = "C7300 (Natural sciences computing)", 5303 corpsource = "State Univ., New York, Buffalo, NY, USA", 5304 keywords = "approximation; biomedical image processing; efficient encoding; electron microscopy; image; image processing; linear programming; mathematical programming; medicine; Monte Carlo; Monte Carlo methods; Monte Carlo techniques; natural sciences; optical information; optimization; physics; picture compression; picture description; picture processing; processing; projections; reconstruction of pictures; stereology; techniques; X-ray analysis; X-ray photography", 5305 treatment = "P Practical", 5306 } 5307 5308 @Article{Amidon:1971:ASB, 5309 author = "E. L. Amidon and G. S. Akin", 5310 title = "Algorithmic Selection of the Best Method for Compressing Map Data Strings", 5311 journal = j-CACM, 5312 volume = "14", 5313 number = "12", 5314 pages = "769--774", 5315 month = dec, 5316 year = "1971", 5317 CODEN = "CACMA2", 5318 ISSN = "0001-0782", 5319 bibdate = "Tue Mar 25 13:26:09 MST 1997", 5320 abstract = "The best of a dozen different methods for compressing map data is illustrated. The choices are generated by encoding data strings-sequence of like codes-by three methods and in four directions. Relationships are developed between compression alternatives to avoid comparing all of them. The technique has been used to compress data from forest resource maps, but is widely applicable to map and photographic data reduction.", 5321 acknowledgement = ack-nhfb, 5322 classcodes = "C6130 (Data handling techniques); C7890 (Other special applications of computing)", 5323 corpsource = "Pacific Southwest Forest and Range Experiment Station, Berkeley, CA, USA", 5324 keywords = "data compression; data reduction; data reduction and analysis; data strings; forest resource maps; information retrieval; input/output; map; map storage; run coding; storage", 5325 treatment = "P Practical", 5326 } 5327 5328 @Article{Mullin:1971:RUS, 5329 author = "James K. Mullin", 5330 title = "Retrieval-Update Speed Trade-offs Using Combined Indexes", 5331 journal = j-CACM, 5332 volume = "14", 5333 number = "12", 5334 pages = "775--776", 5335 month = dec, 5336 year = "1971", 5337 CODEN = "CACMA2", 5338 ISSN = "0001-0782", 5339 bibdate = "Tue Mar 25 13:26:09 MST 1997", 5340 bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib", 5341 acknowledgement = ack-nhfb, 5342 classcodes = "C7250 (Information storage and retrieval)", 5343 corpsource = "Univ. Western Ontario, London, Ont., Canada", 5344 keywords = "combined index files; file; file organisation; file update; indexing; information retrieval; information retrieval systems; inverted files; minimal cost; organisation; query; retrieval time; speed tradeoffs", 5345 treatment = "P Practical", 5346 xxtitle = "Retrieval-update speed tradeoffs using combined indices", 5347 } 5348 5349 @Article{Harrison:1971:IST, 5350 author = "M. C. Harrison", 5351 title = "Implementation of the Substring Test by Hashing", 5352 journal = j-CACM, 5353 volume = "14", 5354 number = "12", 5355 pages = "777--779", 5356 month = dec, 5357 year = "1971", 5358 CODEN = "CACMA2", 5359 ISSN = "0001-0782", 5360 bibdate = "Tue Mar 25 13:26:09 MST 1997", 5361 note = "See also \cite{Tharp:1982:PTS}.", 5362 acknowledgement = ack-nhfb, 5363 classcodes = "C6130 (Data handling techniques)", 5364 corpsource = "New York Univ., NY, USA", 5365 keywords = "compression; data handling; hashing; information; information retrieval; programming; searching; signature; subset; substring test", 5366 treatment = "P Practical", 5367 } 5368 5369 @Article{Wulf:1971:BLS, 5370 author = "W. A. Wulf and D. B. Russell and A. N. Habermann", 5371 title = "{BLISS}: {A} language for systems programming", 5372 journal = j-CACM, 5373 volume = "14", 5374 number = "12", 5375 pages = "780--790", 5376 month = dec, 5377 year = "1971", 5378 CODEN = "CACMA2", 5379 ISSN = "0001-0782", 5380 MRclass = "68A05", 5381 MRnumber = "46 8463", 5382 mrreviewer = "P. Deussen", 5383 bibdate = "Tue Mar 25 13:26:09 MST 1997", 5384 bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Ai/Ai.misc.bib", 5385 abstract = "A language, BLISS, is described. This language is designed so as to be especially suitable for use in writing production software systems for a specific machine (the PDP-10): compilers, operating systems, etc. Prime design goals of the design are the ability to produce highly efficient object code, to allow access to all relevant hardware features of the host machine, and to provide a rational means by which to cope with the evolutionary nature of systems programs. A major feature which contributes to the realization of these goals is a mechanism permitting the definition of the representation of all data structures in terms of the access algorithm for elements of the structure.", 5386 acknowledgement = ack-nhfb, 5387 classcodes = "C5420 (Mainframes and minicomputers); C6120 (File organisation); C6150C (Compilers, interpreters and other processors); C6150J (Operating systems)", 5388 corpsource = "Carnegie-Mellon Univ., Pittsburgh, PA, USA", 5389 keywords = "data structures; implementation language; programming languages; systems programming", 5390 keywords = "BLISS; compilers; data structures; language; minicomputers; operating systems; program processors; programming languages; software systems; supervisory and executive programs; systems programming", 5391 treatment = "P Practical", 5392 } 5393 5394 @Article{Rochfeld:1971:NLT, 5395 author = "A. Rochfeld", 5396 title = "New {LISP} Techniques for a Paging Environment", 5397 journal = j-CACM, 5398 volume = "14", 5399 number = "12", 5400 pages = "791--795", 5401 month = dec, 5402 year = "1971", 5403 CODEN = "CACMA2", 5404 ISSN = "0001-0782", 5405 bibdate = "Tue Mar 25 13:26:09 MST 1997", 5406 bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Compiler/garbage.collection.bib", 5407 acknowledgement = ack-nhfb, 5408 classcodes = "C6120 (File organisation); C6140D (High level languages)", 5409 corpsource = "Univ. Edinburgh, UK", 5410 keywords = "block segment; collection; compact; core fragmentation; garbage; LISP; list processing; list structures; management; paging environment; procedure oriented languages; storage; virtual memory", 5411 treatment = "P Practical", 5412 } 5413 5414 @Article{Blumberg:1971:NMN, 5415 author = "J. W. Blumberg and C. R. Foulk", 5416 title = "A note on `a modification of {Nordsieck}'s method using an ``off-step'' point'", 5417 journal = j-CACM, 5418 volume = "14", 5419 number = "12", 5420 pages = "796--796", 5421 month = dec, 5422 year = "1971", 5423 CODEN = "CACMA2", 5424 ISSN = "0001-0782", 5425 bibdate = "Tue Mar 25 13:26:09 MST 1997", 5426 acknowledgement = ack-nhfb, 5427 classcodes = "C4170 (Differential equations)", 5428 corpsource = "Ohio State Univ., Columbus, OH, USA", 5429 keywords = "corrector; corrector methods; differential equations; modification; multistep methods; Nordsieck's method; numerical methods; off error; ordinary differential equations; predictor; predictor-; round", 5430 treatment = "T Theoretical or Mathematical", 5431 } 5432 5433 @Article{Gustafson:1971:RCG, 5434 author = "Sven-{\AA}ke A. Gustafson", 5435 title = "Rapid Computation of General Interpolation Formulas and Mechanical Quadrature Rules", 5436 journal = j-CACM, 5437 volume = "14", 5438 number = "12", 5439 pages = "797--801", 5440 month = dec, 5441 year = "1971", 5442 CODEN = "CACMA2", 5443 ISSN = "0001-0782", 5444 MRclass = "65D05", 5445 MRnumber = "46 10167a", 5446 mrreviewer = "V. Pereyra", 5447 bibdate = "Tue Mar 25 13:26:09 MST 1997", 5448 acknowledgement = ack-nhfb, 5449 classcodes = "C4130 (Interpolation and function approximation)", 5450 corpsource = "Royal Inst. Technol., Stockholm, Sweden", 5451 keywords = "divided differences; formula; functionals; general interpolation formulas; Hermitian; interpolation; Lagrangian; linear; mechanical quadrature rules; Newton's interpolation; rapid computation", 5452 treatment = "T Theoretical or Mathematical", 5453 } 5454 5455 @Article{Bourgeois:1971:EMA, 5456 author = "Fran{\c{c}}ois Bourgeois and Jean-Claude Lassalle", 5457 title = "An extension of the {Munkres} algorithm for the assignment problem to rectangular matrices", 5458 journal = j-CACM, 5459 volume = "14", 5460 number = "12", 5461 pages = "802--804", 5462 month = dec, 5463 year = "1971", 5464 CODEN = "CACMA2", 5465 ISSN = "0001-0782", 5466 MRclass = "90C05", 5467 MRnumber = "47 4628", 5468 bibdate = "Tue Mar 25 13:26:09 MST 1997", 5469 abstract = "The assignment problem, together with Munkres proposed algorithm for its solution in square matrices, is presented first. Then the authors develop an extension of this algorithm which permits a solution for rectangular matrices. Timing results obtained by using an adapted version of Silver's Algol procedure are discussed, and a relation between solution time and problem size is given.", 5470 acknowledgement = ack-nhfb, 5471 classcodes = "C4140 (Linear algebra)", 5472 corpsource = "CERN, Geneva, Switzerland", 5473 keywords = "algorithm; assignment problem; matrix algebra; Munkres algorithm; operations research; optimisation; optimization theory; rectangular matrices", 5474 treatment = "T Theoretical or Mathematical", 5475 } 5476 5477 @Article{Bourgeois:1971:AAA, 5478 author = "F. Bourgeois and J. C. Lassalle", 5479 title = "{ACM} Algorithm 415: Algorithm for the Assignment Problem (Rectangular Matrices)", 5480 journal = j-CACM, 5481 volume = "14", 5482 number = "12", 5483 pages = "805--806", 5484 month = dec, 5485 year = "1971", 5486 CODEN = "CACMA2", 5487 ISSN = "0001-0782", 5488 bibdate = "Tue Mar 25 13:26:09 MST 1997", 5489 acknowledgement = ack-nhfb, 5490 classcodes = "C4140 (Linear algebra)", 5491 corpsource = "CERN, Geneva, Switzerland", 5492 keywords = "algorithm; assignment problem; matrix algebra; operations research; optimization; rectangular matrices; subroutines", 5493 treatment = "T Theoretical or Mathematical", 5494 } 5495 5496 @Article{Gustafson:1971:AARa, 5497 author = "Sven-{\AA}ke Gustafson", 5498 title = "{ACM} Algorithm 416: Rapid Computation of Coefficients of Interpolation Formulas [{E1}]", 5499 journal = j-CACM, 5500 volume = "14", 5501 number = "12", 5502 pages = "806--807", 5503 month = dec, 5504 year = "1971", 5505 CODEN = "CACMA2", 5506 ISSN = "0001-0782", 5507 MRclass = "65D05", 5508 MRnumber = "46 10167b", 5509 mrreviewer = "V. Pereyra", 5510 bibdate = "Tue Mar 25 13:26:09 MST 1997", 5511 acknowledgement = ack-nhfb, 5512 classcodes = "C4130 (Interpolation and function approximation)", 5513 corpsource = "Stanford Univ., CA, USA", 5514 keywords = "algorithm; coefficients; divided differences; interpolation; interpolation formula; rapid computation; subroutines", 5515 treatment = "T Theoretical or Mathematical", 5516 } 5517 5518 @Article{Gustafson:1971:AARb, 5519 author = "Sven-{\AA}ke Gustafson", 5520 title = "{ACM} Algorithm 417: Rapid Computation of Weights of Interpolatory Quadrature Rules [{D1}]", 5521 journal = j-CACM, 5522 volume = "14", 5523 number = "12", 5524 pages = "807--807", 5525 month = dec, 5526 year = "1971", 5527 CODEN = "CACMA2", 5528 ISSN = "0001-0782", 5529 MRclass = "65D05", 5530 MRnumber = "46 10167c", 5531 mrreviewer = "V. Pereyra", 5532 bibdate = "Tue Mar 25 13:26:09 MST 1997", 5533 acknowledgement = ack-nhfb, 5534 classcodes = "C4130 (Interpolation and function approximation)", 5535 corpsource = "Stanford Univ., CA, USA", 5536 keywords = "algorithm; divided differences; interpolation; interpolation formulae; mechanical quadrature rules; rapid computation; subroutines; weights", 5537 } 5538 5539 @Article{Aho:1971:POP, 5540 author = "A. V. Aho and P. J. Denning and J. D. Ullman", 5541 title = "Principles of optimal page replacement", 5542 journal = j-CACM, 5543 volume = "18", 5544 number = "1", 5545 pages = "80--93", 5546 month = jan, 5547 year = "1971", 5548 CODEN = "CACMA2", 5549 ISSN = "0001-0782", 5550 bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/cache.bib", 5551 } 5552 5553 @Article{Johnson:1972:RCA, 5554 author = "S. C. Johnson and B. W. Kernighan", 5555 title = "Remark on {``CACM Algorithm 397''}", 5556 journal = j-CACM, 5557 volume = "5", 5558 number = "6", 5559 pages = "469", 5560 month = jun, 5561 year = "1972", 5562 CODEN = "CACMA2", 5563 ISSN = "0001-0782", 5564 bibdate = "Tue Dec 26 16:35:37 1995", 5565 note = "Check volume/number/year??", 5566 keywords = "acm cacm", 5567 } 5568 5569 @Article{Bartels:1972:ASM, 5570 author = "R. H. Bartels and G. W. Stewart", 5571 title = "Algorithm 432: The Solution of the Matrix Equation {$AX -+BX = C$}", 5572 journal = j-CACM, 5573 volume = "8", 5574 number = "9", 5575 pages = "820--826", 5576 month = sep, 5577 year = "1972", 5578 CODEN = "CACMA2", 5579 ISSN = "0001-0782", 5580 bibdate = "Tue May 28 11:19:15 1996", 5581 bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Theory/Matrix.bib", 5582 note = "Check volume/number/year??", 5583 acknowledgement = ack-nhfb, 5584 keywords = "linear algebra; linear equations; matrices", 5585 kwds = "nla, Schur form, Sylvester equation, Lyapunov equation, matrix equation", 5586 } 5587 5588 @Article{Lesk:1972:PPR, 5589 author = "A. M. Lesk", 5590 title = "Pictorial pattern recognition and the phase problem of {X}-ray crystallography", 5591 journal = j-CACM, 5592 volume = "15", 5593 number = "1", 5594 pages = "3--6", 5595 month = jan, 5596 year = "1972", 5597 CODEN = "CACMA2", 5598 ISSN = "0001-0782", 5599 bibdate = "Tue Mar 25 13:26:09 MST 1997", 5600 acknowledgement = ack-nhfb, 5601 classcodes = "A6100 (Structure of liquids and solids; crystallography); A6150 (Crystalline state); B6140C (Optical information, image and video signal processing); C1250 (Pattern recognition)", 5602 corpsource = "Princeton Univ., NJ, USA", 5603 keywords = "calculation methods; cross correlation; crystallography; hypotheses; molecular model building; pattern recognition; phase problem; physics; pictorial pattern recognition; structural; X-ray; X-ray crystallography", 5604 treatment = "T Theoretical or Mathematical", 5605 } 5606 5607 @Article{Levialdi:1972:SBP, 5608 author = "S. Levialdi", 5609 title = "On Shrinking Binary Picture Patterns", 5610 journal = j-CACM, 5611 volume = "15", 5612 number = "1", 5613 pages = "7--10", 5614 month = jan, 5615 year = "1972", 5616 CODEN = "CACMA2", 5617 ISSN = "0001-0782", 5618 bibdate = "Tue Mar 25 13:26:09 MST 1997", 5619 abstract = "A parallel processing algorithm for shrinking binary patterns to obtain single isolated elements, one for each pattern, is presented. This procedure may be used for counting patterns on a matrix, and a hardware implementation of the algorithm using large scale integrated technology is envisioned. The principal features of this method are the very small window employed (two-by-two elements), the parallel nature of the process, and the possibility of shrinking any pattern, regardless of the complexity of its configuration. Problems regarding merging and disconnection of patterns during the process as well as the determination of the maximum number of steps necessary to obtain a single isolated element from a pattern, are reviewed and discussed. An analogy with a neural network description, in terms of McCulloch-Pitts ``neurons'' is presented.", 5620 acknowledgement = ack-nhfb, 5621 classcodes = "B6140C (Optical information, image and video signal processing); C1250 (Pattern recognition)", 5622 corpsource = "CNR, Napoli, Italy", 5623 keywords = "counting binary patterns; counting patterns; disconnection; isolated element; large scale integrated; matrix; merging; multiple connected; multiple connected pictures; neural network; parallel processing; pattern recognition; pictures; shrinking; shrinking binary picture patterns; single; small window; technology", 5624 treatment = "T Theoretical or Mathematical", 5625 } 5626 5627 @Article{Duda:1972:UHT, 5628 author = "R. O. Duda and P. E. Hart", 5629 title = "Use of the Hough transformation to detect lines and curves in pictures", 5630 journal = j-CACM, 5631 volume = "15", 5632 number = "1", 5633 pages = "11--15", 5634 month = jan, 5635 year = "1972", 5636 CODEN = "CACMA2", 5637 ISSN = "0001-0782", 5638 bibdate = "Tue Mar 25 13:26:09 MST 1997", 5639 bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/Reverse.eng.bib", 5640 abstract = "Hough has proposed an interesting and computationally efficient procedure for detecting lines in pictures. This paper points out that the use of angle-radius rather than slope-intercept parameters simplifies the computation further. It also shows how the method can be used for more general curve fitting, and gives alternative interpretations that explain the source of its efficiency.", 5641 acknowledgement = ack-nhfb, 5642 classcodes = "B6140C (Optical information, image and video signal processing); C1250 (Pattern recognition)", 5643 corpsource = "Stanford Res. Inst., Menlo Park, CA, USA", 5644 keywords = "angle radius; colinear points; curve detection; curves; detecting lines; Hough transformation; line detection; pattern recognition; picture processing; pictures; point-line transformation", 5645 treatment = "T Theoretical or Mathematical", 5646 } 5647 5648 @Article{Irons:1972:CES, 5649 author = "E. T. Irons and F. M. Djorup", 5650 title = "A {CRT} editing system", 5651 journal = j-CACM, 5652 volume = "15", 5653 number = "1", 5654 pages = "16--20", 5655 month = jan, 5656 year = "1972", 5657 CODEN = "CACMA2", 5658 ISSN = "0001-0782", 5659 bibdate = "Tue Mar 25 13:26:09 MST 1997", 5660 acknowledgement = ack-nhfb, 5661 classcodes = "C6130 (Data handling techniques)", 5662 corpsource = "Inst. Defense Analyses, Princeton, NJ, USA", 5663 keywords = "CRT editing system; entry display; manipulation program; text; text editing; time sharing", 5664 treatment = "A Application; E Economic; P Practical", 5665 } 5666 5667 @Article{Dwyer:1972:TSA, 5668 author = "T. A. Dwyer", 5669 title = "Teacher\slash student authored {CAI} using the {NEWBASIC} system", 5670 journal = j-CACM, 5671 volume = "15", 5672 number = "1", 5673 pages = "21--28", 5674 month = jan, 5675 year = "1972", 5676 CODEN = "CACMA2", 5677 ISSN = "0001-0782", 5678 bibdate = "Tue Mar 25 13:26:09 MST 1997", 5679 acknowledgement = ack-nhfb, 5680 classcodes = "C7810C (Computer-aided instruction)", 5681 corpsource = "Univ. Pittsburgh, PA, USA", 5682 keywords = "CAI; capability; CATALYST; computer aided instruction; flexible CAI scan; interactive; NEWBASIC system; secondary school", 5683 treatment = "A Application; P Practical", 5684 } 5685 5686 @Article{Shell:1972:COP, 5687 author = "Donald L. Shell", 5688 title = "Corrigendum: {``Optimizing the Polyphase Sort''}", 5689 journal = j-CACM, 5690 volume = "15", 5691 number = "1", 5692 pages = "28--28", 5693 month = jan, 5694 year = "1972", 5695 CODEN = "CACMA2", 5696 ISSN = "0001-0782", 5697 bibdate = "Fri Jan 17 18:37:36 1997", 5698 note = "See \cite{Shell:1971:OPS}.", 5699 } 5700 5701 @Article{McCalla:1972:MMU, 5702 author = "G. I. McCalla and J. R. Sampson", 5703 title = "{MUSE}: {A Model to Understand Simple English}", 5704 journal = j-CACM, 5705 volume = "15", 5706 number = "1", 5707 pages = "29--40", 5708 month = jan, 5709 year = "1972", 5710 CODEN = "CACMA2", 5711 ISSN = "0001-0782", 5712 bibdate = "Tue Mar 25 13:26:09 MST 1997", 5713 acknowledgement = ack-nhfb, 5714 classcodes = "C7820 (Humanities computing)", 5715 corpsource = "Univ. Alberta, Edmonton, Alta., Canada", 5716 keywords = "ambiguity; computer model; English sentences; generalization; information addition to memory; interpretation; intersection procedure; language translation and linguistics; MUSE; natural language processing; network; resolution; semantic memory; syntactic analysis; text", 5717 treatment = "P Practical; T Theoretical or Mathematical", 5718 } 5719 5720 @Article{Shrager:1972:QPN, 5721 author = "R. I. Shrager", 5722 title = "Quadratic programming for nonlinear regression", 5723 journal = j-CACM, 5724 volume = "15", 5725 number = "1", 5726 pages = "41--45", 5727 month = jan, 5728 year = "1972", 5729 CODEN = "CACMA2", 5730 ISSN = "0001-0782", 5731 bibdate = "Tue Mar 25 13:26:09 MST 1997", 5732 acknowledgement = ack-nhfb, 5733 classcodes = "B0260 (Optimisation techniques); C1180 (Optimisation techniques)", 5734 corpsource = "Dept. Health and Education, Bethesda, MD, USA", 5735 keywords = "diagonal method; linear constraints; magnified; nonlinear regression; quadratic programming", 5736 treatment = "T Theoretical or Mathematical", 5737 } 5738 5739 @Article{Salzer:1972:OOW, 5740 author = "H. E. Salzer", 5741 title = "Ordering +or-f(+or-f(+or-f(\ldots{}+or-f(x)\ldots{}))) when f(x) is positive monotonic", 5742 journal = j-CACM, 5743 volume = "15", 5744 number = "1", 5745 pages = "45--46", 5746 month = jan, 5747 year = "1972", 5748 CODEN = "CACMA2", 5749 ISSN = "0001-0782", 5750 bibdate = "Tue Mar 25 13:26:09 MST 1997", 5751 acknowledgement = ack-nhfb, 5752 classcodes = "C4190 (Other numerical methods)", 5753 keywords = "combination; numerical methods; ordering; positive monotonic; real arguments; signs", 5754 } 5755 5756 @Article{Einarsson:1972:AAC, 5757 author = "B. Einarsson", 5758 title = "{ACM} Algorithm 418: Calculation of {Fourier} Integrals", 5759 journal = j-CACM, 5760 volume = "15", 5761 number = "1", 5762 pages = "47--48", 5763 month = jan, 5764 year = "1972", 5765 CODEN = "CACMA2", 5766 ISSN = "0001-0782", 5767 bibdate = "Tue Mar 25 13:26:09 MST 1997", 5768 acknowledgement = ack-nhfb, 5769 classcodes = "C4160 (Numerical integration and differentiation); C7310 (Mathematics computing)", 5770 corpsource = "Res. Inst. Nat. Defense, Tumba, Sweden", 5771 keywords = "calculation; FORTRAN routine; Fourier integrals; integration; subroutines", 5772 treatment = "T Theoretical or Mathematical", 5773 } 5774 5775 @Article{Pager:1972:PCB, 5776 author = "David Pager", 5777 title = "A Proposal for a Computer-Based Interactive Scientific Community", 5778 journal = j-CACM, 5779 volume = "15", 5780 number = "2", 5781 pages = "71--75", 5782 month = feb, 5783 year = "1972", 5784 CODEN = "CACMA2", 5785 ISSN = "0001-0782", 5786 bibdate = "Tue Mar 25 13:26:09 MST 1997", 5787 abstract = "Because of the problems created by the explosion of papers in the mathematical sciences and the drawbacks that this places on research, it is suggested that a tree of all mathematical results and terminology be maintained in a multiterminal computer system.\par Users of the system can store in the computer an updated file of their current knowledge, and on selecting a paper to read, they can obtain from the computer the minimum subtree of theorems required to bring them from what they already know to the background knowledge which the paper assumes. Under certain conditions, means are also provided for the contribution of useful comments by the readers of a work and for interaction between commentators and with the author. \par This paper describes how the system can be organized and the role required of readers, writers, and commentators.", 5788 acknowledgement = ack-nhfb, 5789 classcodes = "C7250 (Information storage and retrieval)", 5790 corpsource = "Univ. Hawaii, Honolulu, HI, USA", 5791 keywords = "commentators; computer utility; data structures; information retrieval; interactive system; organization of scientific community; readers; trees; writers", 5792 keywords = "commentators; computer utility; data structures; information retrieval; information retrieval systems; interactive system; organization of scientific community; readers; trees; trees (mathematics); writers", 5793 treatment = "G General Review", 5794 } 5795 5796 @Article{Eastman:1972:PRS, 5797 author = "C. M. Eastman", 5798 title = "Preliminary report on a system for general space planning", 5799 journal = j-CACM, 5800 volume = "15", 5801 number = "2", 5802 pages = "76--87", 5803 month = feb, 5804 year = "1972", 5805 CODEN = "CACMA2", 5806 ISSN = "0001-0782", 5807 bibdate = "Tue Mar 25 13:26:09 MST 1997", 5808 acknowledgement = ack-nhfb, 5809 classcodes = "C6140D (High level languages); C7400 (Engineering computing)", 5810 corpsource = "Carnegie-Mellon Univ., Pittsburgh, PA, USA", 5811 keywords = "ALGOL; architects; CAD; computer language; computer-aided design; engineering; extension of ALGOL; general space planning; heuristic programming; orthographic drawings; set of programs; urban designers", 5812 treatment = "G General Review; P Practical", 5813 } 5814 5815 @Article{Martin:1972:OBT, 5816 author = "W. A. Martin and D. N. Ness", 5817 title = "Optimizing Binary Trees Grown with a Storing Algorithm", 5818 journal = j-CACM, 5819 volume = "15", 5820 number = "2", 5821 pages = "88--93", 5822 month = feb, 5823 year = "1972", 5824 CODEN = "CACMA2", 5825 ISSN = "0001-0782", 5826 bibdate = "Tue Mar 25 13:26:09 MST 1997", 5827 bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib", 5828 acknowledgement = ack-nhfb, 5829 classcodes = "C6130 (Data handling techniques)", 5830 corpsource = "MIT, Cambridge, MA, USA", 5831 keywords = "algorithm; binary trees; data handling; optimisation; optimization; recursion; retrieving information; sorting; trees (mathematics)", 5832 treatment = "A Application; T Theoretical or Mathematical", 5833 } 5834 5835 @Article{Oldehoeft:1972:MCP, 5836 author = "A. E. Oldehoeft and M. H. Halstead", 5837 title = "Maximum computing power and cost factors in the centralization problem", 5838 journal = j-CACM, 5839 volume = "15", 5840 number = "2", 5841 pages = "94--96", 5842 month = feb, 5843 year = "1972", 5844 CODEN = "CACMA2", 5845 ISSN = "0001-0782", 5846 bibdate = "Tue Mar 25 13:26:09 MST 1997", 5847 acknowledgement = ack-nhfb, 5848 classcodes = "C0310 (EDP management)", 5849 corpsource = "Iowa State Univ., Ames, IA, USA", 5850 keywords = "centralisation; computer management; cost factors; decentralisation; economics; economies of scale; installations; large single machine installations; management; maximum computing power; multimachine", 5851 treatment = "E Economic", 5852 } 5853 5854 @Article{Jenkins:1972:AAZ, 5855 author = "M. A. Jenkins and J. F. Traub", 5856 title = "{ACM} Algorithm 419: Zeros of a Complex Polynomial", 5857 journal = j-CACM, 5858 volume = "15", 5859 number = "2", 5860 pages = "97--99", 5861 month = feb, 5862 year = "1972", 5863 CODEN = "CACMA2", 5864 ISSN = "0001-0782", 5865 bibdate = "Tue Mar 25 13:26:09 MST 1997", 5866 acknowledgement = ack-nhfb, 5867 classcodes = "C4150 (Nonlinear and functional equations); C7310 (Mathematics computing)", 5868 corpsource = "Queen's Univ., Kingston, Ont., Canada", 5869 keywords = "complex polynomial; FORTRAN; poles and zeros; polynomials; roots; subroutine; subroutines; zeros", 5870 treatment = "P Practical", 5871 } 5872 5873 @Article{Williamson:1972:AAH, 5874 author = "H. Williamson", 5875 title = "{ACM} Algorithm 420: Hidden-Line Plotting Program", 5876 journal = j-CACM, 5877 volume = "15", 5878 number = "2", 5879 pages = "100--103", 5880 month = feb, 5881 year = "1972", 5882 CODEN = "CACMA2", 5883 ISSN = "0001-0782", 5884 bibdate = "Tue Mar 25 13:26:09 MST 1997", 5885 bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1972.bib", 5886 acknowledgement = ack-nhfb, 5887 classcodes = "C6130 (Data handling techniques)", 5888 corpsource = "Tracor Computing Corp., Austin, TX, USA", 5889 descriptors = "Fortran; graphics; iterative method; application; method; human factors; diagram manipulation; hidden line algorithm;", 5890 keywords = "computer graphics; data handling; FORTRAN; hidden line plotting; subroutine; subroutines; surface plot", 5891 treatment = "P Practical", 5892 } 5893 5894 @Article{Moorer:1972:MCC, 5895 author = "J. A. Moorer", 5896 title = "Music and computer composition", 5897 journal = j-CACM, 5898 volume = "15", 5899 number = "2", 5900 pages = "104--113", 5901 month = feb, 5902 year = "1972", 5903 CODEN = "CACMA2", 5904 ISSN = "0001-0782", 5905 bibdate = "Tue Mar 25 13:26:09 MST 1997", 5906 acknowledgement = ack-nhfb, 5907 classcodes = "C1230 (Artificial intelligence); C7820 (Humanities computing)", 5908 corpsource = "Stanford Univ., CA, USA", 5909 keywords = "artificial intelligence; composition; computer music; harmony; heuristic; humanities; models of cognitive processes; music theory; program; programming", 5910 treatment = "G General Review", 5911 } 5912 5913 @Article{Flores:1972:CAB, 5914 author = "Ivan Flores and George Madpis", 5915 title = "Corrigendum: {``Average Binary Search Length for Dense Ordered Lists''}", 5916 journal = j-CACM, 5917 volume = "15", 5918 number = "2", 5919 pages = "113--113", 5920 month = feb, 5921 year = "1972", 5922 CODEN = "CACMA2", 5923 ISSN = "0001-0782", 5924 bibdate = "Fri Jan 17 18:37:46 1997", 5925 note = "See \cite{Flores:1971:ABS}.", 5926 } 5927 5928 @Article{Gordon:1972:CRP, 5929 author = "Richard Gordon and Gabor T. Herman", 5930 title = "Corrigendum: {``Reconstruction of Pictures from Their Projections''}", 5931 journal = j-CACM, 5932 volume = "15", 5933 number = "2", 5934 pages = "113--113", 5935 month = feb, 5936 year = "1972", 5937 CODEN = "CACMA2", 5938 ISSN = "0001-0782", 5939 bibdate = "Fri Jan 17 18:38:30 1997", 5940 note = "See \cite{Gordon:1971:RPT}.", 5941 } 5942 5943 @Article{Anonymous:1972:PAS, 5944 author = "Anonymous", 5945 title = "Papers from the 3rd {ACM} symposium on operating systems principles", 5946 journal = j-CACM, 5947 volume = "15", 5948 number = "3", 5949 pages = "??--??", 5950 month = mar, 5951 year = "1972", 5952 CODEN = "CACMA2", 5953 ISSN = "0001-0782", 5954 bibdate = "Tue Mar 25 13:26:09 MST 1997", 5955 acknowledgement = ack-nhfb, 5956 classcodes = "C6150J (Operating systems)", 5957 conflocation = "Palo Alto, CA, USA; 18-20 Oct. 1971", 5958 conftitle = "Papers from the 3rd ACM symposium on operating systems principles", 5959 keywords = "access; computer; operating systems; operating systems (computers); parallel processing supervisory; partitioning; storage; time sharing systems", 5960 sponsororg = "Assoc. Computing machinery", 5961 treatment = "P Practical; T Theoretical or Mathematical", 5962 } 5963 5964 @Article{Bobrow:1972:TPT, 5965 author = "D. G. Bobrow and J. D. Burchfiel and D. L. Murphy and R. S. Tomlinson", 5966 title = "{TENEX}, {A} Paged Time-Sharing System for the {PDP-10}", 5967 journal = j-CACM, 5968 volume = "15", 5969 number = "3", 5970 pages = "135--143", 5971 month = mar, 5972 year = "1972", 5973 CODEN = "CACMA2", 5974 ISSN = "0001-0782", 5975 bibdate = "Tue Mar 25 13:26:09 MST 1997", 5976 bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib", 5977 acknowledgement = ack-nhfb, 5978 annote = "Includes description of file system aspects and protection.", 5979 classcodes = "C6150J (Operating systems)", 5980 conflocation = "Palo Alto, CA, USA; 18-20 Oct. 1971", 5981 conftitle = "Papers from the 3rd ACM symposium on operating systems principles", 5982 corpsource = "Computer Sci. Div., Cambridge, UK", 5983 keywords = "minicomputers; paged time sharing system; PDP 10; TENEX; time-sharing programs", 5984 sponsororg = "Assoc. Computing machinery", 5985 treatment = "P Practical", 5986 } 5987 5988 @Article{Liskov:1972:DVO, 5989 author = "B. H. Liskov", 5990 title = "The Design of the {Venus} Operating System", 5991 journal = j-CACM, 5992 volume = "15", 5993 number = "3", 5994 pages = "144--149", 5995 month = mar, 5996 year = "1972", 5997 CODEN = "CACMA2", 5998 ISSN = "0001-0782", 5999 bibdate = "Tue Mar 25 13:26:09 MST 1997", 6000 bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/os.bib", 6001 acknowledgement = ack-nhfb, 6002 classcodes = "C5220 (Computer architecture); C6150J (Operating systems)", 6003 conflocation = "Palo Alto, CA, USA; 18-20 Oct. 1971", 6004 conftitle = "Papers from the 3rd ACM symposium on operating systems principles", 6005 corpsource = "MITRE Corporation. Bedford, MA, USA", 6006 keywords = "architecture; computer architecture; operating systems (computers); small computer; software; Venus operating system", 6007 sponsororg = "Assoc. Computing machinery", 6008 treatment = "P Practical", 6009 } 6010 6011 @Article{Gains:1972:OSB, 6012 author = "R. Stockton Gains", 6013 title = "An operating system based on the concept of a supervisory computer", 6014 journal = j-CACM, 6015 volume = "15", 6016 number = "3", 6017 pages = "150--156", 6018 month = mar, 6019 year = "1972", 6020 CODEN = "CACMA2", 6021 ISSN = "0001-0782", 6022 bibdate = "Tue Mar 25 13:26:09 MST 1997", 6023 acknowledgement = ack-nhfb, 6024 classcodes = "C6150J (Operating systems)", 6025 conflocation = "Palo Alto, CA, USA; 18-20 Oct. 1971", 6026 conftitle = "Papers from the 3rd ACM symposium on operating systems principles", 6027 corpsource = "Inst. Defense Analyses, von Neumann Hall, Princeton, NJ, USA", 6028 keywords = "independent; operating system; operating systems (computers); processes; supervisory computer", 6029 sponsororg = "Assoc. Computing machinery", 6030 treatment = "P Practical; T Theoretical or Mathematical", 6031 } 6032 6033 @Article{Schroeder:1972:HAI, 6034 author = "Michael D. Schroeder and Jerome H. Saltzer", 6035 title = "A Hardware Architecture for Implementing Protection Rings", 6036 journal = j-CACM, 6037 volume = "15", 6038 number = "3", 6039 pages = "157--170", 6040 month = mar, 6041 year = "1972", 6042 CODEN = "CACMA2", 6043 ISSN = "0001-0782", 6044 bibdate = "Tue Mar 25 13:26:09 MST 1997", 6045 bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib", 6046 acknowledgement = ack-nhfb, 6047 classcodes = "C5220 (Computer architecture)", 6048 conflocation = "Palo Alto, CA, USA; 18-20 Oct. 1971", 6049 conftitle = "Papers from the 3rd ACM symposium on operating systems principles", 6050 corpsource = "MIT, Cambridge, MA, USA", 6051 keywords = "access control; access privileges; architecture; computer architecture; digital storage; Multics; protection rings; system", 6052 sponsororg = "Assoc. Computing machinery", 6053 treatment = "P Practical", 6054 } 6055 6056 @Article{Habermann:1972:SCP, 6057 author = "A. Nico Habermann", 6058 title = "Synchronization of Communicating Processes", 6059 journal = j-CACM, 6060 volume = "15", 6061 number = "3", 6062 pages = "171--176", 6063 month = mar, 6064 year = "1972", 6065 CODEN = "CACMA2", 6066 ISSN = "0001-0782", 6067 bibdate = "Tue Mar 25 13:26:09 MST 1997", 6068 bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Object/Nierstrasz.bib", 6069 acknowledgement = ack-nhfb, 6070 classcodes = "C6150J (Operating systems)", 6071 conflocation = "Palo Alto, CA, USA; 18-20 Oct. 1971", 6072 conftitle = "Papers from the 3rd ACM symposium on operating systems principles", 6073 corpsource = "Carnegie-Mellon Univ., Pittsburg, PA, USA", 6074 keywords = "buffer store; communication; concurrency; operating systems (computers); parallel processes; parallel processing; synchronisation; synchronization", 6075 sponsororg = "Assoc. Computing machinery", 6076 } 6077 6078 @Article{Teorey:1972:CAD, 6079 author = "Toby J. Teorey and Tad B. Pinkerton", 6080 title = "A Comparative Analysis of Disk Scheduling Policies", 6081 journal = j-CACM, 6082 volume = "15", 6083 number = "3", 6084 pages = "177--184", 6085 month = mar, 6086 year = "1972", 6087 CODEN = "CACMA2", 6088 ISSN = "0001-0782", 6089 bibdate = "Tue Mar 25 13:26:09 MST 1997", 6090 bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/is.bib", 6091 acknowledgement = ack-nhfb, 6092 annote = "Analysis, design of hardware. Minimizing seeks and latencies.", 6093 classcodes = "C6150J (Operating systems)", 6094 conflocation = "Palo Alto, CA, USA; 18-20 Oct. 1971", 6095 conftitle = "Papers from the 3rd ACM symposium on operating systems principles", 6096 corpsource = "Univ. Wisconsin, Madison, WI, USA", 6097 keywords = "criteria; disk scheduling policies; magnetic storage systems; multiprogramming; performance; seek time; waiting time", 6098 sponsororg = "Assoc. Computing machinery", 6099 treatment = "P Practical", 6100 } 6101 6102 @Article{Coffman:1972:SSP, 6103 author = "E. G. {Coffman, Jr.} and T. A. {Ryan, Jr.}", 6104 title = "A study of storage partitioning using a mathematical model of locality", 6105 journal = j-CACM, 6106 volume = "15", 6107 number = "3", 6108 pages = "185--190", 6109 month = mar, 6110 year = "1972", 6111 CODEN = "CACMA2", 6112 ISSN = "0001-0782", 6113 bibdate = "Tue Mar 25 13:26:09 MST 1997", 6114 bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/cache.bib", 6115 acknowledgement = ack-nhfb, 6116 classcodes = "C1220 (Simulation, modelling and identification); C6150J (Operating systems)", 6117 conflocation = "Palo Alto, CA, USA; 18-20 Oct. 1971", 6118 conftitle = "Papers from the 3rd ACM symposium on operating systems principles", 6119 corpsource = "Pennsylvania State Univ., University Park, PA, USA", 6120 keywords = "dynamic; fixed; mathematical model of locality; modelling; multiprogramming; storage allocation; storage partitioning", 6121 sponsororg = "Assoc. Computing machinery", 6122 treatment = "P Practical", 6123 } 6124 6125 @Article{Denning:1972:PWS, 6126 author = "Peter J. Denning and Stuart C. Schwartz", 6127 title = "Properties of the working-set model", 6128 journal = j-CACM, 6129 volume = "15", 6130 number = "3", 6131 pages = "191--198", 6132 month = mar, 6133 year = "1972", 6134 CODEN = "CACMA2", 6135 ISSN = "0001-0782", 6136 MRclass = "68A05", 6137 MRnumber = "47 6119", 6138 mrreviewer = "A. D. Booth", 6139 bibdate = "Tue Mar 25 13:26:09 MST 1997", 6140 note = "See corrigendum \cite{Denning:1973:CWM}.", 6141 abstract = "A program's working set $W(t,T)$ at time $t$ is the set of distinct pages among the T most recently referenced pages. Relations between the average working-set size, the missing-page rate, and the interreference-interval distribution may be derived both from time-average definitions and from ensemble-average (statistical) definitions. An efficient algorithm for estimating these quantities is given. The relation to LRU (least recently used) paging is characterized. The independent-reference model, in which page references are statistically independent, is used to assess the effects to interpage dependencies on working-set size observations. Under general assumptions, working-set size is shown to be normally distributed.", 6142 acknowledgement = ack-nhfb, 6143 classcodes = "C4290 (Other computer theory)", 6144 conflocation = "Palo Alto, CA, USA; 18-20 Oct. 1971", 6145 conftitle = "Papers from the 3rd ACM symposium on operating systems principles", 6146 corpsource = "Princeton Univ., NJ, USA", 6147 keywords = "paging; paging algorithms; program behavior; program modeling; working-set model", 6148 keywords = "model; modelling; paging; programming theory; supervisory programs; working set", 6149 sponsororg = "Assoc. Computing machinery", 6150 treatment = "T Theoretical or Mathematical", 6151 } 6152 6153 @Article{Conway:1972:ISM, 6154 author = "R. W. Conway and W. L. Maxwell and H. L. Morgan", 6155 title = "On the Implementation of Security Measures in Information Systems", 6156 journal = j-CACM, 6157 volume = "15", 6158 number = "4", 6159 pages = "211--220", 6160 month = apr, 6161 year = "1972", 6162 CODEN = "CACMA2", 6163 ISSN = "0001-0782", 6164 bibdate = "Tue Mar 25 13:26:09 MST 1997", 6165 bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib", 6166 acknowledgement = ack-nhfb, 6167 classcodes = "C6130 (Data handling techniques)", 6168 corpsource = "Cornell Univ., Ithaca, NY, USA", 6169 keywords = "access control confidentiality; access management; data banks; information systems; management; model; modelling; operating systems; privacy; security; security of data", 6170 treatment = "A Application; T Theoretical or Mathematical", 6171 } 6172 6173 @Article{Walden:1972:SIC, 6174 author = "D. C. Walden", 6175 title = "A system for interprocess communication in a resource sharing computer network", 6176 journal = j-CACM, 6177 volume = "15", 6178 number = "4", 6179 pages = "221--230", 6180 month = apr, 6181 year = "1972", 6182 CODEN = "CACMA2", 6183 ISSN = "0001-0782", 6184 bibdate = "Tue Mar 25 13:26:09 MST 1997", 6185 bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1972.bib and ftp://ftp.ira.uka.de/pub/bibliography/Distributed/network.bib", 6186 note = "Reproduced in ``Advances in Computer Communications'', W. W. Chu, (Ed.), (1974), 340--349.", 6187 abstract = "A system of communication between processes in a time-sharing system is described and the communication system is extended so that it may be used between processes distributed throughout a computer network. \par The hypothetical application of the system to an existing network is discussed.", 6188 acknowledgement = ack-nhfb, 6189 annote = "A system of communication between processes in a time-sharing system is described and the communication is extended so that it may be used between processes distributed throughout a computer network. The hypothetical application of the system to an existing network is discussed.", 6190 classcodes = "C5490 (Other aspects of analogue and digital computers); C5620 (Computer networks and techniques)", 6191 corpsource = "Bolt Beranek and Newman Inc., Cambridge, MA, USA", 6192 country = "USA", 6193 descriptors = "Resource management; computer network; time sharing; interprocess communication;", 6194 enum = "3213", 6195 keywords = "computer networks; digital communication systems; hypothetical application; interprocess communication; resource sharing; time sharing; time-sharing; time-sharing systems", 6196 language = "English", 6197 references = "10", 6198 treatment = "T Theoretical or Mathematical", 6199 } 6200 6201 @Article{Herbst:1972:ELP, 6202 author = "N. M. Herbst and P. M. Will", 6203 title = "An experimental laboratory for pattern recognition and signal processing", 6204 journal = j-CACM, 6205 volume = "15", 6206 number = "4", 6207 pages = "231--244", 6208 month = apr, 6209 year = "1972", 6210 CODEN = "CACMA2", 6211 ISSN = "0001-0782", 6212 bibdate = "Tue Mar 25 13:26:09 MST 1997", 6213 acknowledgement = ack-nhfb, 6214 classcodes = "C5490 (Other aspects of analogue and digital computers)", 6215 corpsource = "IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA", 6216 keywords = "analogue input and output facilities; computer; design; display systems; image; interactive terminal; pattern recognition; process control digital; processing; programming support; pseudorandom displays; scanner control; scanners; signal processing; system; TV camera", 6217 treatment = "A Application; X Experimental", 6218 } 6219 6220 @Article{Matsushita:1972:HLE, 6221 author = "Yutaka Matsushita", 6222 title = "Hidden lines elimination for a rotating object", 6223 journal = j-CACM, 6224 volume = "15", 6225 number = "4", 6226 pages = "245--252", 6227 month = apr, 6228 year = "1972", 6229 CODEN = "CACMA2", 6230 ISSN = "0001-0782", 6231 MRclass = "68A10", 6232 MRnumber = "47 7945", 6233 mrreviewer = "Rani Siromoney", 6234 bibdate = "Tue Mar 25 13:26:09 MST 1997", 6235 abstract = "A method is presented of determining which parts of three-dimensional objects are visible and which are invisible when the objects are rotated about some axis. This paper describes a polygon comparison scheme in which the relationships of two polygons can be classified into tree types, and also discusses how the relationship is changed for each pair of polygons under rotation about some axis. A rotation table is defined for each pair of polygons, which remains fixed as long as rotation is about one axis and provides a means of rapidly determining the visible and hidden line relationship between two polygons. \par Additional work must be done to extend this approach to simultaneous rotation about several axes.", 6236 acknowledgement = ack-nhfb, 6237 classcodes = "C6130 (Data handling techniques)", 6238 corpsource = "Univ. Illinois, Urbana-Champaign, IL, USA", 6239 keywords = "computer drawn picture; computer graphics; data handling; display programming; displays; graphics; hidden line; hidden line problem; polygon comparison scheme; problem; rotating object", 6240 treatment = "A Application; T Theoretical or Mathematical", 6241 } 6242 6243 @Article{Chase:1972:IGA, 6244 author = "S. M. Chase", 6245 title = "An implemented graph algorithm for winning {Shannon Switching Games}", 6246 journal = j-CACM, 6247 volume = "15", 6248 number = "4", 6249 pages = "253--256", 6250 month = apr, 6251 year = "1972", 6252 CODEN = "CACMA2", 6253 ISSN = "0001-0782", 6254 bibdate = "Tue Mar 25 13:26:09 MST 1997", 6255 acknowledgement = ack-nhfb, 6256 classcodes = "C1230 (Artificial intelligence)", 6257 corpsource = "IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA", 6258 keywords = "artificial intelligence; computer; game playing; graph algorithm; programme; Shannon Switching Games; winning strategy", 6259 treatment = "P Practical", 6260 } 6261 6262 @Article{Horowitz:1972:CSP, 6263 author = "E. Horowitz and H. L. Morgan and A. C. Shaw", 6264 title = "Computers and Society: {A} Proposed Course for Computer Scientists", 6265 journal = j-CACM, 6266 volume = "15", 6267 number = "4", 6268 pages = "257--261", 6269 month = apr, 6270 year = "1972", 6271 CODEN = "CACMA2", 6272 ISSN = "0001-0782", 6273 bibdate = "Tue Mar 25 13:26:09 MST 1997", 6274 abstract = "The purpose of this paper is to describe a course concerned with both the effects of computers on society and the responsibilities of computer scientists to society. The impact of computers is divided into five components: political, economic, cultural, social, and moral; the main part of the paper defines each component and presents examples of the relevant issues. In the remaining portions the possible formats for such a course are discussed, a topic by topic outline is given, and a selected set of references is listed. It is hoped that the proposal will make it easier to initiate courses on this subject.", 6275 acknowledgement = ack-nhfb, 6276 classcodes = "C0220 (Computing education and training)", 6277 corpsource = "Cornell Univ., Ithaca, NY, USA", 6278 keywords = "computer scientists; computers and society; course; course proposal; cultural; economic; economic and sociological effects; education; moral; political; social; social implications", 6279 treatment = "P Practical", 6280 } 6281 6282 @Article{Kuki:1972:CGF, 6283 author = "H. Kuki", 6284 title = "Complex gamma function with error control", 6285 journal = j-CACM, 6286 volume = "15", 6287 number = "4", 6288 pages = "262--267", 6289 month = apr, 6290 year = "1972", 6291 CODEN = "CACMA2", 6292 ISSN = "0001-0782", 6293 bibdate = "Tue Mar 25 13:26:09 MST 1997", 6294 acknowledgement = ack-nhfb, 6295 classcodes = "C4130 (Interpolation and function approximation); C7310 (Mathematics computing)", 6296 corpsource = "Univ. Chicago, IL, USA", 6297 keywords = "algorithm; complex; complex gamma function; error control; function approximation; loggamma function", 6298 treatment = "T Theoretical or Mathematical", 6299 } 6300 6301 @Article{Moler:1972:MCF, 6302 author = "C. B. Moler", 6303 title = "Matrix Computations with {Fortran} and Paging", 6304 journal = j-CACM, 6305 volume = "15", 6306 number = "4", 6307 pages = "268--270", 6308 month = apr, 6309 year = "1972", 6310 CODEN = "CACMA2", 6311 ISSN = "0001-0782", 6312 bibdate = "Tue Mar 25 13:26:09 MST 1997", 6313 bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Theory/Matrix.bib", 6314 acknowledgement = ack-nhfb, 6315 classcodes = "C4140 (Linear algebra); C6140D (High level languages)", 6316 corpsource = "Univ. Michigan, Ann Arbor, MI, USA", 6317 keywords = "FORTRAN; Fortran; linear equations; matrix algebra; matrix computations; memory hierarchy; nested loops; nla; paged memory; virtual memory", 6318 treatment = "P Practical", 6319 } 6320 6321 @Article{Kuki:1972:AAC, 6322 author = "Hirondo Kuki", 6323 title = "{ACM} Algorithm 421: Complex Gamma Function with Error Control", 6324 journal = j-CACM, 6325 volume = "15", 6326 number = "4", 6327 pages = "271--272", 6328 month = apr, 6329 year = "1972", 6330 CODEN = "CACMA2", 6331 ISSN = "0001-0782", 6332 MRclass = "65D20", 6333 MRnumber = "47 1249", 6334 mrreviewer = "L. Fox", 6335 bibdate = "Tue Mar 25 13:26:09 MST 1997", 6336 acknowledgement = ack-nhfb, 6337 classcodes = "C4130 (Interpolation and function approximation); C7310 (Mathematics computing)", 6338 corpsource = "Univ. Chicago, IL, USA", 6339 keywords = "complex gamma function; complex loggamma; error control; FORTRAN; function; function approximation; programme; subroutines", 6340 } 6341 6342 @Article{Whitney:1972:AAM, 6343 author = "V. K. M. Whitney", 6344 title = "{ACM} Algorithm 422: Minimal Spanning Tree", 6345 journal = j-CACM, 6346 volume = "15", 6347 number = "4", 6348 pages = "273--274", 6349 month = apr, 6350 year = "1972", 6351 CODEN = "CACMA2", 6352 ISSN = "0001-0782", 6353 bibdate = "Tue Mar 25 13:26:09 MST 1997", 6354 note = "See remark \cite{Kernighan:1973:RAM}.", 6355 acknowledgement = ack-nhfb, 6356 classcodes = "C7310 (Mathematics computing)", 6357 corpsource = "Univ. Michigan, Ann Arbor, MI, USA", 6358 keywords = "algorithm; FORTRAN; maximal spanning tree; minimal spanning tree; spanning tree; subroutines; trees (mathematics); undirected graph", 6359 } 6360 6361 @Article{Moler:1972:AAL, 6362 author = "C. B. Moler", 6363 title = "{ACM} Algorithm 423: Linear Equation Solver", 6364 journal = j-CACM, 6365 volume = "15", 6366 number = "4", 6367 pages = "274--274", 6368 month = apr, 6369 year = "1972", 6370 CODEN = "CACMA2", 6371 ISSN = "0001-0782", 6372 bibdate = "Tue Mar 25 13:26:09 MST 1997", 6373 acknowledgement = ack-nhfb, 6374 classcodes = "C4140 (Linear algebra)", 6375 corpsource = "Univ. Michigan, Ann Arbor, MI, USA", 6376 keywords = "array processing; Fortran; linear algebra; linear equation solver; memory; paged memory; subroutines; virtual", 6377 } 6378 6379 @Article{Walden:1972:NCN, 6380 author = "D. C. Walden", 6381 title = "A Note on {Cheney}'s Nonrecursive List-Compacting Algorithm", 6382 journal = j-CACM, 6383 volume = "15", 6384 number = "4", 6385 pages = "275--275", 6386 month = apr, 6387 year = "1972", 6388 CODEN = "CACMA2", 6389 ISSN = "0001-0782", 6390 bibdate = "Tue Mar 25 13:26:09 MST 1997", 6391 acknowledgement = ack-nhfb, 6392 classcodes = "C6130 (Data handling techniques)", 6393 corpsource = "A/S Norsk Data-Elektronikk, Oslo, Norway", 6394 keywords = "algorithm; garbage collection; list compacting; list processing; nonrecursive; storage management", 6395 treatment = "T Theoretical or Mathematical", 6396 } 6397 6398 @Article{Hu:1972:CDC, 6399 author = "T. C. Hu", 6400 key = "file searching, double-chained tree, binary search tree", 6401 title = "A Comment on the Double-Chained Tree", 6402 journal = j-CACM, 6403 volume = "15", 6404 number = "4", 6405 pages = "276--276", 6406 month = apr, 6407 year = "1972", 6408 CODEN = "CACMA2", 6409 ISSN = "0001-0782", 6410 bibdate = "Tue Mar 25 13:26:09 MST 1997", 6411 acknowledgement = ack-nhfb, 6412 classcodes = "C6120 (File organisation)", 6413 corpsource = "Univ. Wisconsin, Madison, WI, USA", 6414 keywords = "binary search tree; double chained tree; file organisation; file searching; trees (mathematics)", 6415 treatment = "T Theoretical or Mathematical", 6416 } 6417 6418 @Article{Mullin:1972:IIS, 6419 author = "James K. Mullin", 6420 title = "An Improved Indexed-Sequential Access Method Using Hashed Overflow", 6421 journal = j-CACM, 6422 volume = "15", 6423 number = "5", 6424 pages = "301--307", 6425 month = may, 6426 year = "1972", 6427 CODEN = "CACMA2", 6428 ISSN = "0001-0782", 6429 bibdate = "Tue Mar 25 13:26:09 MST 1997", 6430 bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/hash.bib", 6431 acknowledgement = ack-nhfb, 6432 classcodes = "C6120 (File organisation)", 6433 corpsource = "Univ. Western Ontario, Ont., Canada", 6434 keywords = "cylinder; file management systems; file organisation; hashed overflow; improved index sequential access method; long overflow chains; movable head disc devices; overflow records; record keys; scatter; space allocation; storage; storage allocation; storage management; treating", 6435 treatment = "P Practical", 6436 } 6437 6438 @Article{Bensoussan:1972:MVM, 6439 author = "A. Bensoussan and C. T. Clingen and R. C. Daley", 6440 title = "The {Multics} Virtual Memory: Concepts and Design", 6441 journal = j-CACM, 6442 volume = "15", 6443 number = "5", 6444 pages = "308--318", 6445 month = may, 6446 year = "1972", 6447 CODEN = "CACMA2", 6448 ISSN = "0001-0782", 6449 bibdate = "Tue Mar 25 13:26:09 MST 1997", 6450 bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Database/Graefe.bib", 6451 acknowledgement = ack-nhfb, 6452 classcodes = "C6150J (Operating systems)", 6453 corpsource = "Honeywell Information Systems Inc., Cambridge, MA, USA", 6454 keywords = "concepts; design; hierarchy; information sharing; memory; memory management; Multics virtual memory; online operating systems; Operating segments paging sharing management CACM; operating systems (computers); paging; segmentation", 6455 treatment = "P Practical", 6456 } 6457 6458 @Article{Christman:1972:MSA, 6459 author = "R. D. Christman", 6460 title = "{MUX}, a simple approach to on-line computing", 6461 journal = j-CACM, 6462 volume = "15", 6463 number = "5", 6464 pages = "319--329", 6465 month = may, 6466 year = "1972", 6467 CODEN = "CACMA2", 6468 ISSN = "0001-0782", 6469 bibdate = "Tue Mar 25 13:26:09 MST 1997", 6470 acknowledgement = ack-nhfb, 6471 classcodes = "C6150J (Operating systems)", 6472 corpsource = "Univ. California, Los Alamos, NM, USA", 6473 keywords = "batch system; CDC 6600 computer; cost; design criteria; economics; implementation; input; modify files; multi-access systems; multiplexer; MUX; online computing; online operation; operating; overhead; systems (computers); user reactions", 6474 treatment = "E Economic; P Practical", 6475 } 6476 6477 @Article{Parnas:1972:TSM, 6478 author = "David L. Parnas", 6479 title = "A technique for software module specification with examples", 6480 journal = j-CACM, 6481 volume = "15", 6482 number = "5", 6483 pages = "330--336", 6484 month = may, 6485 year = "1972", 6486 CODEN = "CACMA2", 6487 ISSN = "0001-0782", 6488 bibdate = "Tue Mar 25 13:26:09 MST 1997", 6489 bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Theory/obscure.bib", 6490 acknowledgement = ack-nhfb, 6491 classcodes = "C6110 (Systems analysis and programming)", 6492 corpsource = "Carnegie-Mellon Univ., Pittsburgh, PA, USA", 6493 keywords = "programming; software design; software module specification; technique", 6494 treatment = "P Practical", 6495 } 6496 6497 @Article{Gentleman:1972:ICCa, 6498 author = "W. Morven Gentleman", 6499 title = "Implementing {Clenshaw-Curtis} quadrature. {I}. Methodology and experience", 6500 journal = j-CACM, 6501 volume = "15", 6502 number = "5", 6503 pages = "337--342", 6504 month = may, 6505 year = "1972", 6506 CODEN = "CACMA2", 6507 ISSN = "0001-0782", 6508 MRclass = "65D30", 6509 MRnumber = "48 5343", 6510 mrreviewer = "D. F. Mayers", 6511 bibdate = "Tue Mar 25 13:26:09 MST 1997", 6512 bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Theory/Comp.Alg.1.bib", 6513 abstract = "Clenshaw-Curtis quadrature is a particularly important automatic quadrature scheme for a variety of reasons, especially the high accuracy obtained from relatively few integrand values. However, it has received little use because it requires the computation of a cosine transformation and the arithmetic cost of this has been prohibitive. This paper is in two parts; a companion paper, ``II Computing the Cosine Transformation,'' shows that this objection can be overcome by computing the cosine transformation by a modification of the fast Fourier transform algorithm. \par This first part discusses the strategy and various error estimates, and summarizes experience with a particular implementation of the scheme.", 6514 acknowledgement = ack-nhfb, 6515 classcodes = "C4110 (Error analysis in numerical methods); C4160 (Numerical integration and differentiation); C7310 (Mathematics computing)", 6516 corpsource = "Univ. Waterloo, Ont., Canada", 6517 keywords = "automatic quadrature; Chebyshev series; Clenshaw Curtis; Clenshaw-Curtis quadrature; error analysis; error estimates; experience; implementation; integration; numerical integration; numerical methods; strategy", 6518 treatment = "T Theoretical or Mathematical", 6519 } 6520 6521 @Article{Gentleman:1972:ICCb, 6522 author = "W. Morvin Gentleman", 6523 title = "Implementing {Clenshaw-Curtis} quadrature. {II}. Computing the cosine transformation", 6524 journal = j-CACM, 6525 volume = "15", 6526 number = "5", 6527 pages = "343--346", 6528 month = may, 6529 year = "1972", 6530 CODEN = "CACMA2", 6531 ISSN = "0001-0782", 6532 MRclass = "65D30", 6533 MRnumber = "48 5344", 6534 mrreviewer = "D. F. Mayers", 6535 bibdate = "Tue Mar 25 13:26:09 MST 1997", 6536 abstract = "In a companion paper to this, ``I Methodology and Experiences,'' the automatic Clenshaw-Curtis quadrature scheme was described and how each quadrature formula used in the scheme requires a cosine transformation of the integrand values was shown. The high cost of these cosine transformations has been a serious drawback in using Clenshaw-Curtis quadrature. \par Two other problems related to the cosine transformation have also been trouble some. First, the conventional computation of the cosine transformation by recurrence relation is numerically unstable, particularly at the low frequencies which have the largest effect upon the integral. Second, in case the automatic scheme should require refinement of the sampling, storage is required to save the integrand values after the cosine transformation is computed. This second part of the paper shows how the cosine transformation can be computed by a modification of the fast Fourier transform and all three problems overcome. The modification is also applicable in other circumstances requiring cosine or sine transformations, such as polynomial interpolation through the Chebyshev points.", 6537 acknowledgement = ack-nhfb, 6538 classcodes = "C4160 (Numerical integration and differentiation); C7310 (Mathematics computing)", 6539 corpsource = "Univ. Waterloo, Ont., Canada", 6540 keywords = "Chebyshev series; Clenshaw Curtis quadrature; Clenshaw-Curtis quadrature; cosine; cosine transformation; fast Fourier transformation; fast Fourier transforms; FFT; implementation; integration; numerical methods; polynomial interpolation; transformation", 6541 treatment = "T Theoretical or Mathematical", 6542 } 6543 6544 @Article{Greenspan:1972:FFD, 6545 author = "D. Greenspan and D. Schultz", 6546 title = "Fast finite-difference solution of biharmonic problems", 6547 journal = j-CACM, 6548 volume = "15", 6549 number = "5", 6550 pages = "347--350", 6551 month = may, 6552 year = "1972", 6553 CODEN = "CACMA2", 6554 ISSN = "0001-0782", 6555 MRclass = "65N05", 6556 MRnumber = "47 2829", 6557 bibdate = "Tue Mar 25 13:26:09 MST 1997", 6558 abstract = "Setting the Reynolds number equal to zero, in a method for solving the Navier-Strokes equations numerically, results in a fast numerical method for biharmonic problems. The equation is treated as a system of two second order equations and a simple smoothing process is essential for convergence. An application is made to a crack-type problem.", 6559 acknowledgement = ack-nhfb, 6560 classcodes = "C4170 (Differential equations)", 6561 corpsource = "Univ. Wisconsin, Madison, WI, USA", 6562 keywords = "biharmonic equation; boundary value problem; numerical analysis; partial differential equations", 6563 keywords = "biharmonic problems; boundary value problem; boundary-value problems; convergence; convergence of numerical methods; crack type problem; difference equations; fast finite difference solution; Navier Stokes equations; partial differential equations; process; smoothing; two second order equations", 6564 treatment = "T Theoretical or Mathematical", 6565 } 6566 6567 @Article{Dunham:1972:MNA, 6568 author = "C. B. Dunham", 6569 title = "Minimax nonlinear approximation by approximation on subsets", 6570 journal = j-CACM, 6571 volume = "15", 6572 number = "5", 6573 pages = "351--351", 6574 month = may, 6575 year = "1972", 6576 CODEN = "CACMA2", 6577 ISSN = "0001-0782", 6578 bibdate = "Tue Mar 25 13:26:09 MST 1997", 6579 acknowledgement = ack-nhfb, 6580 classcodes = "C4130 (Interpolation and function approximation)", 6581 corpsource = "Univ. Western Ontario, Ont., Canada", 6582 keywords = "function approximation; minimax nonlinear approximation; optimisation; subsets", 6583 treatment = "T Theoretical or Mathematical", 6584 } 6585 6586 @Article{Harter:1972:OWF, 6587 author = "Richard Harter", 6588 title = "The Optimality of {Winograd}'s Formula", 6589 journal = j-CACM, 6590 volume = "15", 6591 number = "5", 6592 pages = "352--352", 6593 month = may, 6594 year = "1972", 6595 CODEN = "CACMA2", 6596 ISSN = "0001-0782", 6597 MRclass = "352.65F05", 6598 MRnumber = "47 2801", 6599 bibdate = "Tue Mar 25 13:26:09 MST 1997", 6600 acknowledgement = ack-nhfb, 6601 classcodes = "C4140 (Linear algebra)", 6602 keywords = "inner product; linear algebra; numerical analysis; optimality; vectors; Winograd's formula", 6603 treatment = "T Theoretical or Mathematical", 6604 } 6605 6606 @Article{Gentleman:1972:AAC, 6607 author = "W. M. Gentleman", 6608 title = "{ACM} Algorithm 424: {Clenshaw-Curtis} Quadrature", 6609 journal = j-CACM, 6610 volume = "15", 6611 number = "5", 6612 pages = "353--355", 6613 month = may, 6614 year = "1972", 6615 CODEN = "CACMA2", 6616 ISSN = "0001-0782", 6617 bibdate = "Tue Mar 25 13:26:09 MST 1997", 6618 note = "See also \cite{Geddes:1979:RCC}.", 6619 acknowledgement = ack-nhfb, 6620 classcodes = "C4160 (Numerical integration and differentiation); C7310 (Mathematics computing)", 6621 corpsource = "Univ. Waterloo, Ont., Canada", 6622 keywords = "Chebyshev series; Clenshaw Curtis quadrature; cosine transform; FFT; FORTRAN subroutine; integration; subroutines", 6623 treatment = "T Theoretical or Mathematical", 6624 } 6625 6626 @Article{Hurst:1972:AAG, 6627 author = "R. L. Hurst and R. E. Knop", 6628 title = "{ACM} Algorithm 425: Generation of Random Correlated Normal Variables", 6629 journal = j-CACM, 6630 volume = "15", 6631 number = "5", 6632 pages = "355--357", 6633 month = may, 6634 year = "1972", 6635 CODEN = "CACMA2", 6636 ISSN = "0001-0782", 6637 bibdate = "Tue Mar 25 13:26:09 MST 1997", 6638 acknowledgement = ack-nhfb, 6639 classcodes = "C7310 (Mathematics computing)", 6640 corpsource = "Utah State Univ., Logan, UT, USA", 6641 keywords = "algorithms; FORTRAN subroutine; generation; multivariate normal density; random correlated normal variables; statistics; subroutines; timing", 6642 treatment = "T Theoretical or Mathematical", 6643 } 6644 6645 @Article{Bron:1972:AAM, 6646 author = "C. Bron", 6647 title = "{ACM} Algorithm 426: Merge Sort Algorithm", 6648 journal = j-CACM, 6649 volume = "15", 6650 number = "5", 6651 pages = "357--358", 6652 month = may, 6653 year = "1972", 6654 CODEN = "CACMA2", 6655 ISSN = "0001-0782", 6656 bibdate = "Tue Mar 25 13:26:09 MST 1997", 6657 acknowledgement = ack-nhfb, 6658 classcodes = "C6130 (Data handling techniques)", 6659 corpsource = "Technol. Univ., Eindhoven, Netherlands", 6660 keywords = "ALGOL 60 procedure; merge sort algorithm; merging; recursion; sorting; subroutines", 6661 treatment = "T Theoretical or Mathematical", 6662 } 6663 6664 @Article{Linz:1972:AAF, 6665 author = "P. Linz", 6666 title = "{ACM} Algorithm 427: {Fourier Cosine} Integral", 6667 journal = j-CACM, 6668 volume = "15", 6669 number = "5", 6670 pages = "358--360", 6671 month = may, 6672 year = "1972", 6673 CODEN = "CACMA2", 6674 ISSN = "0001-0782", 6675 bibdate = "Tue Mar 25 13:26:09 MST 1997", 6676 acknowledgement = ack-nhfb, 6677 classcodes = "C4160 (Numerical integration and differentiation); C7310 (Mathematics computing)", 6678 corpsource = "Univ. California, Davis, CA, USA", 6679 keywords = "FORTRAN procedure; Fourier cosine integral; integration; subroutines", 6680 treatment = "T Theoretical or Mathematical", 6681 } 6682 6683 @Article{Yohe:1972:AAH, 6684 author = "J. M. Yohe", 6685 title = "{ACM} Algorithm 428: {Hu-Tucker} Minimum Redundancy Alphabetic Coding Method", 6686 journal = j-CACM, 6687 volume = "15", 6688 number = "5", 6689 pages = "360--362", 6690 month = may, 6691 year = "1972", 6692 CODEN = "CACMA2", 6693 ISSN = "0001-0782", 6694 bibdate = "Tue Mar 25 13:26:09 MST 1997", 6695 acknowledgement = ack-nhfb, 6696 classcodes = "B6120B (Codes); C1260 (Information theory)", 6697 corpsource = "Univ. Wisconsin, Madison, WI, USA", 6698 keywords = "codes; encoding; FORTRAN subroutine; Hu Tucker minimum redundancy alphabetic binary coding; method; subroutines", 6699 treatment = "T Theoretical or Mathematical", 6700 } 6701 6702 @Article{Ashenhurst:1972:RAC, 6703 author = "R. L. Ashenhurst", 6704 title = "A report of the {ACM} curriculum committee on computer education for management. Curriculum recommendations for graduate professional programs in information systems", 6705 journal = j-CACM, 6706 volume = "15", 6707 number = "5", 6708 pages = "363--398", 6709 month = may, 6710 year = "1972", 6711 CODEN = "CACMA2", 6712 ISSN = "0001-0782", 6713 bibdate = "Tue Mar 25 13:26:09 MST 1997", 6714 bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib", 6715 acknowledgement = ack-nhfb, 6716 classcodes = "C0220 (Computing education and training)", 6717 keywords = "course descriptions; curriculum recommendations; education; implementation; information systems; systems analysis", 6718 treatment = "G General Review", 6719 } 6720 6721 @Article{Blatny:1972:OPT, 6722 author = "J. Blatny and S. R. Clark and T. A. Rourke", 6723 title = "On the optimization of performance of time-sharing systems by simulation", 6724 journal = j-CACM, 6725 volume = "15", 6726 number = "6", 6727 pages = "411--420", 6728 month = jun, 6729 year = "1972", 6730 CODEN = "CACMA2", 6731 ISSN = "0001-0782", 6732 bibdate = "Tue Mar 25 13:26:09 MST 1997", 6733 acknowledgement = ack-nhfb, 6734 classcodes = "C4290 (Other computer theory); C6150J (Operating systems)", 6735 corpsource = "Univ. Manitoba, Winnipeg, Man., Canada", 6736 keywords = "computation theory; finite; infinite auxiliary store; job scheduling algorithm; noncontiguous store; number of jobs allowed to execute simultaneously; optimisation; optimization of performance; optimum round robin cycle time selection; programs; sharing systems; simulation; slice techniques; store size; time; time-sharing; variable time", 6737 treatment = "T Theoretical or Mathematical", 6738 } 6739 6740 @Article{Spacek:1972:PEP, 6741 author = "T. R. Spacek", 6742 title = "A proposal to establish a pseudo virtual memory via writable overlays", 6743 journal = j-CACM, 6744 volume = "15", 6745 number = "6", 6746 pages = "421--426", 6747 month = jun, 6748 year = "1972", 6749 CODEN = "CACMA2", 6750 ISSN = "0001-0782", 6751 bibdate = "Tue Mar 25 13:26:09 MST 1997", 6752 acknowledgement = ack-nhfb, 6753 classcodes = "C6120 (File organisation)", 6754 corpsource = "CIA, Washington, DC, USA", 6755 keywords = "collector; display; establishment; executable storage size problems; folding; graphic; linkage editor; loader; overlay structure; paging; pseudovirtual memory; segmentation; storage allocation; writable overlays", 6756 } 6757 6758 @Article{Gilbert:1972:IBC, 6759 author = "P. Gilbert and W. J. Chandler", 6760 title = "Interference between Communicating Parallel Processes", 6761 journal = j-CACM, 6762 volume = "15", 6763 number = "6", 6764 pages = "427--437", 6765 month = jun, 6766 year = "1972", 6767 CODEN = "CACMA2", 6768 ISSN = "0001-0782", 6769 bibdate = "Tue Mar 25 13:26:09 MST 1997", 6770 bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib", 6771 acknowledgement = ack-nhfb, 6772 classcodes = "C4290 (Other computer theory); C6150J (Operating systems)", 6773 corpsource = "Univ. Southern California, Los Angeles, CA, USA", 6774 keywords = "computation theory; concurrent programming control; cooperating processes; formal programs; inclusion; interference between communicating parallel processes; mutual exclusion; operating systems; parallel processing; problem; sequences of states; transition rule", 6775 treatment = "T Theoretical or Mathematical", 6776 } 6777 6778 @Article{Gimpel:1972:BND, 6779 author = "J. F. Gimpel", 6780 title = "Blocks-a new datatype for {SNOBOL} 4", 6781 journal = j-CACM, 6782 volume = "15", 6783 number = "6", 6784 pages = "438--447", 6785 month = jun, 6786 year = "1972", 6787 CODEN = "CACMA2", 6788 ISSN = "0001-0782", 6789 bibdate = "Tue Mar 25 13:26:09 MST 1997", 6790 acknowledgement = ack-nhfb, 6791 classcodes = "C6130 (Data handling techniques); C6140D (High level languages)", 6792 corpsource = "Bell Telephone Labs. Inc., Holmdel, NJ, USA", 6793 keywords = "blocks; character; composing printable output; datatype; dimensional aggregate of characters; manipulation; overstriking; problem oriented languages; right parallelepiped; SNOBOL 4; string processing; text editing; text processing; three", 6794 treatment = "P Practical", 6795 } 6796 6797 @Article{Martin:1972:BMM, 6798 author = "David F. Martin", 6799 title = "A {Boolean} matrix method for the computation of linear precedence functions", 6800 journal = j-CACM, 6801 volume = "15", 6802 number = "6", 6803 pages = "448--454", 6804 month = jun, 6805 year = "1972", 6806 CODEN = "CACMA2", 6807 ISSN = "0001-0782", 6808 MRclass = "68A30", 6809 MRnumber = "54 9175", 6810 mrreviewer = "Daniel J. Rosenkrantz", 6811 bibdate = "Tue Mar 25 13:26:09 MST 1997", 6812 acknowledgement = ack-nhfb, 6813 classcodes = "C4210 (Formal logic)", 6814 corpsource = "Univ. California, Los Angeles, CA, USA", 6815 keywords = "analysis; Boolean functions; boolean matrix method; conflict free matrix; context; context-free grammars; free parsing; linear precedence functions; matrix algebra; precedence grammars; syntax", 6816 treatment = "T Theoretical or Mathematical", 6817 } 6818 6819 @Article{OReagan:1972:CAC, 6820 author = "Robert T. O'Reagan", 6821 title = "Computer Assigned Codes from Verbal Responses", 6822 journal = j-CACM, 6823 volume = "15", 6824 number = "6", 6825 pages = "455--459", 6826 month = jun, 6827 year = "1972", 6828 CODEN = "CACMA2", 6829 ISSN = "0001-0782", 6830 bibdate = "Tue Mar 25 13:26:09 MST 1997", 6831 bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib", 6832 acknowledgement = ack-nhfb, 6833 classcodes = "C6130 (Data handling techniques)", 6834 corpsource = "US Bureau of the Census, Washington, DC, USA", 6835 keywords = "codes; computer coding; concept; data handling; historical response patterns; reference list; translation; verbal responses; word coding; word strings", 6836 treatment = "T Theoretical or Mathematical", 6837 } 6838 6839 @Article{Iguchi:1972:SMS, 6840 author = "K. Iguchi", 6841 title = "A starting method for solving nonlinear {Volterra} integral equations of the second kind", 6842 journal = j-CACM, 6843 volume = "15", 6844 number = "6", 6845 pages = "460--461", 6846 month = jun, 6847 year = "1972", 6848 CODEN = "CACMA2", 6849 ISSN = "0001-0782", 6850 bibdate = "Tue Mar 25 13:26:09 MST 1997", 6851 acknowledgement = ack-nhfb, 6852 classcodes = "C4160 (Numerical integration and differentiation)", 6853 corpsource = "Nagoya Univ., Japan", 6854 keywords = "algorithm; fourth order method; integral equations; nonlinear Volterra integral equations; numerical methods; starting method", 6855 treatment = "T Theoretical or Mathematical", 6856 } 6857 6858 @Article{Pohl:1972:SPC, 6859 author = "I. Pohl", 6860 title = "A Sorting Problem and Its Complexity", 6861 journal = j-CACM, 6862 volume = "15", 6863 number = "6", 6864 pages = "462--464", 6865 month = jun, 6866 year = "1972", 6867 CODEN = "CACMA2", 6868 ISSN = "0001-0782", 6869 bibdate = "Tue Mar 25 13:26:09 MST 1997", 6870 abstract = "A technique for proving min-max norms of sorting algorithms is given. One new algorithm for finding the minimum and maximum elements of a set with fewest comparisons is proved optimal with this technique.", 6871 acknowledgement = ack-nhfb, 6872 classcodes = "C6130 (Data handling techniques)", 6873 corpsource = "Univ. California, Santa Cruz, CA, USA", 6874 keywords = "complexity; computational; computational combinatorics; computational combinatories; computational complexity; minimax norms; minimum and maximum elements; sorting", 6875 treatment = "T Theoretical or Mathematical", 6876 } 6877 6878 @Article{Kolbig:1972:CAC, 6879 author = "K. S. Kolbig", 6880 title = "Certification of algorithm 363 (complex error function)", 6881 journal = j-CACM, 6882 volume = "15", 6883 number = "6", 6884 pages = "465--466", 6885 month = jun, 6886 year = "1972", 6887 CODEN = "CACMA2", 6888 ISSN = "0001-0782", 6889 bibdate = "Tue Mar 25 13:26:09 MST 1997", 6890 acknowledgement = ack-nhfb, 6891 classcodes = "C4120 (Functional analysis); C7310 (Mathematics computing)", 6892 corpsource = "CERN, Geneva, Switzerland", 6893 keywords = "complex error function; function evaluation; special functions; subroutines; Voigt function", 6894 treatment = "T Theoretical or Mathematical", 6895 } 6896 6897 @Article{Niessner:1972:RAE, 6898 author = "H. Niessner", 6899 title = "Remark on algorithm 343 (Eigenvalues and eigenvectors of a real general matrix)", 6900 journal = j-CACM, 6901 volume = "15", 6902 number = "6", 6903 pages = "466--466", 6904 month = jun, 6905 year = "1972", 6906 CODEN = "CACMA2", 6907 ISSN = "0001-0782", 6908 bibdate = "Tue Mar 25 13:26:09 MST 1997", 6909 acknowledgement = ack-nhfb, 6910 classcodes = "C4140 (Linear algebra); C7310 (Mathematics computing)", 6911 corpsource = "Brown, Boveri and Co., Baden, Switzerland", 6912 keywords = "eigenvalues; eigenvalues and eigenfunctions; eigenvectors; FORTRAN; general; matrices; matrix algebra; nonsymmetric matrices; QR algorithm; subroutines", 6913 treatment = "T Theoretical or Mathematical", 6914 } 6915 6916 @Article{Proll:1972:RAA, 6917 author = "L. G. Proll", 6918 title = "Remark on ``{ACM Algorithm 370 (General random number generator) [G5]''}", 6919 journal = j-CACM, 6920 volume = "15", 6921 number = "6", 6922 pages = "467--468", 6923 month = jun, 6924 year = "1972", 6925 CODEN = "CACMA2", 6926 ISSN = "0001-0782", 6927 bibdate = "Tue Mar 25 13:26:09 MST 1997", 6928 bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1972.bib", 6929 acknowledgement = ack-nhfb, 6930 classcodes = "C7890 (Other special applications of computing)", 6931 corpsource = "Univ. Southampton, UK", 6932 country = "USA", 6933 descriptors = "RVG;", 6934 enum = "7783", 6935 keywords = "cumulative distribution function; probability density function; random number generation; random number generator; subroutines; transformation", 6936 language = "English", 6937 references = "0", 6938 treatment = "G General Review", 6939 } 6940 6941 @Article{Schrack:1972:RAR, 6942 author = "G. F. Schrack", 6943 title = "Remark on algorithm 381 (Random vectors uniform in solid angle)", 6944 journal = j-CACM, 6945 volume = "15", 6946 number = "6", 6947 pages = "468--468", 6948 month = jun, 6949 year = "1972", 6950 CODEN = "CACMA2", 6951 ISSN = "0001-0782", 6952 bibdate = "Tue Mar 25 13:26:09 MST 1997", 6953 acknowledgement = ack-nhfb, 6954 classcodes = "C7890 (Other special applications of computing)", 6955 corpsource = "Univ. British Columbia, Vancouver, BC, Canada", 6956 keywords = "points uniform on; random number generation; random vector generator; solid angle; sphere; spherically symmetric probability distribution; subroutines", 6957 treatment = "A Application", 6958 } 6959 6960 @Article{Sale:1972:RAS, 6961 author = "A. H. J. Sale", 6962 title = "Remark on algorithm 393 (Special series summation with arbitrary precision)", 6963 journal = j-CACM, 6964 volume = "15", 6965 number = "6", 6966 pages = "468--469", 6967 month = jun, 6968 year = "1972", 6969 CODEN = "CACMA2", 6970 ISSN = "0001-0782", 6971 bibdate = "Tue Mar 25 13:26:09 MST 1997", 6972 acknowledgement = ack-nhfb, 6973 classcodes = "C4120 (Functional analysis); C7310 (Mathematics computing)", 6974 corpsource = "Univ. Sydney, NSW, Australia", 6975 keywords = "approximation; function evaluation; harmonic series; series summation; subroutines", 6976 treatment = "A Application", 6977 } 6978 6979 @Article{Einarsson:1972:RAC, 6980 author = "B. Einarsson", 6981 title = "Remark on algorithm 418 (Calculation of {Fourier} integrals)", 6982 journal = j-CACM, 6983 volume = "15", 6984 number = "6", 6985 pages = "469--469", 6986 month = jun, 6987 year = "1972", 6988 CODEN = "CACMA2", 6989 ISSN = "0001-0782", 6990 bibdate = "Tue Mar 25 13:26:09 MST 1997", 6991 acknowledgement = ack-nhfb, 6992 classcodes = "C4160 (Numerical integration and differentiation); C7310 (Mathematics computing)", 6993 corpsource = "Res. Inst. Nat. Defense, Tumba, Sweden", 6994 keywords = "approximation; coefficients; Filon integration; Filon quadrature; Fourier; Fourier integrals; Fourier series; integration; numerical methods; quadrature; Richardson extrapolation; spline; splines (mathematics); subroutines", 6995 treatment = "T Theoretical or Mathematical", 6996 } 6997 6998 @Article{Johnson:1972:RAI, 6999 author = "S. C. Johnson and B. W. Kernighan", 7000 title = "Remark on algorithm 397 (An integer programming problem)", 7001 journal = j-CACM, 7002 volume = "15", 7003 number = "6", 7004 pages = "469--469", 7005 month = jun, 7006 year = "1972", 7007 CODEN = "CACMA2", 7008 ISSN = "0001-0782", 7009 bibdate = "Tue Mar 25 13:26:09 MST 1997", 7010 acknowledgement = ack-nhfb, 7011 classcodes = "B0260 (Optimisation techniques); C1180 (Optimisation techniques); C7310 (Mathematics computing)", 7012 corpsource = "Bell Labs., Murray Hill, NJ, USA", 7013 keywords = "change making problem; integer programming; subroutines", 7014 treatment = "A Application", 7015 } 7016 7017 @Article{Kandel:1972:CSV, 7018 author = "Abraham Kandel", 7019 title = "Computer Science --- {A} Vicious Circle", 7020 journal = j-CACM, 7021 volume = "15", 7022 number = "6", 7023 pages = "470--471", 7024 month = jun, 7025 year = "1972", 7026 CODEN = "CACMA2", 7027 ISSN = "0001-0782", 7028 bibdate = "Tue Mar 25 13:26:09 MST 1997", 7029 acknowledgement = ack-nhfb, 7030 classcodes = "C0220 (Computing education and training)", 7031 corpsource = "New Mexico Inst. Mining and Technol., Socorro, NM, USA", 7032 keywords = "computer engineering; computer personnel; computer science curriculum; education; personnel; systems design", 7033 treatment = "G General Review", 7034 } 7035 7036 @Article{Koffman:1972:IIG, 7037 author = "E. B. Koffman", 7038 title = "Individualizing instruction in a generative {CAI} tutor", 7039 journal = j-CACM, 7040 volume = "15", 7041 number = "6", 7042 pages = "472--473", 7043 month = jun, 7044 year = "1972", 7045 CODEN = "CACMA2", 7046 ISSN = "0001-0782", 7047 bibdate = "Tue Mar 25 13:26:09 MST 1997", 7048 acknowledgement = ack-nhfb, 7049 classcodes = "C0220 (Computing education and training); C7810C (Computer-aided instruction)", 7050 corpsource = "Univ. Connecticut, Storrs, CT, USA", 7051 keywords = "adaptive instruction; and sequential design; combinational; computer aided instruction; computer assisted instructions; education; generative CAI tutor; machine language programming", 7052 treatment = "A Application; P Practical", 7053 } 7054 7055 @Article{Houstis:1972:AAP, 7056 author = "E. N. Houstis and W. F. Mitchell and J. R. Rice", 7057 title = "{ACM} Algorithm 438: Product Type Two-point {Gauss-Legendre-Simpson}'s Integration", 7058 journal = j-CACM, 7059 volume = "15", 7060 number = "6", 7061 pages = "1071", 7062 month = jun, 7063 year = "1972", 7064 CODEN = "CACMA2", 7065 ISSN = "0001-0782", 7066 bibdate = "Thu Sep 08 09:34:02 1994", 7067 } 7068 7069 @Article{Revens:1972:FTF, 7070 author = "Lee Revens", 7071 title = "The first twenty-five years {ACM} 1947--1962", 7072 journal = j-CACM, 7073 volume = "15", 7074 number = "7", 7075 pages = "485--490", 7076 month = jul, 7077 year = "1972", 7078 CODEN = "CACMA2", 7079 ISSN = "0001-0782", 7080 MRclass = "68-03", 7081 MRnumber = "52 16081", 7082 bibdate = "Tue Dec 26 13:35:07 1995", 7083 note = "Twenty-fifth anniversary of the Association for Computing Machinery.", 7084 acknowledgement = ack-nhfb, 7085 } 7086 7087 @Article{Weiss:1972:PCI, 7088 author = "Eric A. Weiss", 7089 title = "Publications in computing: an informal review", 7090 journal = j-CACM, 7091 volume = "15", 7092 number = "7", 7093 pages = "491--497", 7094 month = jul, 7095 year = "1972", 7096 CODEN = "CACMA2", 7097 ISSN = "0001-0782", 7098 MRclass = "68-03", 7099 MRnumber = "52 16083", 7100 bibdate = "Tue Mar 25 13:26:09 MST 1997", 7101 note = "Twenty-fifth anniversary of the Association for Computing Machinery.", 7102 acknowledgement = ack-nhfb, 7103 classcodes = "C0200 (General computer topics)", 7104 keywords = "digital computers; publications in computing; review", 7105 treatment = "B Bibliography", 7106 } 7107 7108 @Article{Ershov:1972:AHF, 7109 author = "A. P. Ershov", 7110 title = "Aesthetics and the Human Factor in Programming", 7111 journal = j-CACM, 7112 volume = "15", 7113 number = "7", 7114 pages = "501--505", 7115 month = jul, 7116 year = "1972", 7117 CODEN = "CACMA2", 7118 ISSN = "0001-0782", 7119 bibdate = "Tue Mar 25 13:26:09 MST 1997", 7120 note = "See corrigendum \cite{Ershov:1972:CAH}.", 7121 acknowledgement = ack-nhfb, 7122 classcodes = "C6110 (Systems analysis and programming)", 7123 corpsource = "Novosibirsk Univ., USSR", 7124 keywords = "aesthetics; human factor; human factors; programming", 7125 treatment = "G General Review", 7126 } 7127 7128 @Article{Anonymous:1972:ISI, 7129 author = "Anonymous", 7130 title = "As the industry sees it", 7131 journal = j-CACM, 7132 volume = "15", 7133 number = "7", 7134 pages = "506--517", 7135 month = jul, 7136 year = "1972", 7137 CODEN = "CACMA2", 7138 ISSN = "0001-0782", 7139 bibdate = "Tue Mar 25 13:26:09 MST 1997", 7140 acknowledgement = ack-nhfb, 7141 classcodes = "C0200 (General computer topics)", 7142 keywords = "digital computers; future of computers; industry", 7143 treatment = "G General Review", 7144 } 7145 7146 @Article{Arbib:1972:TAT, 7147 author = "Michael A. Arbib", 7148 title = "Toward an Automata Theory of Brains", 7149 journal = j-CACM, 7150 volume = "15", 7151 number = "7", 7152 pages = "521--527", 7153 month = jul, 7154 year = "1972", 7155 CODEN = "CACMA2", 7156 ISSN = "0001-0782", 7157 MRclass = "68A25 (92A05)", 7158 MRnumber = "53 7131", 7159 mrreviewer = "Jill Humphries", 7160 bibdate = "Tue Mar 25 13:26:09 MST 1997", 7161 note = "Twenty-fifth anniversary of the Association for Computing Machinery.", 7162 acknowledgement = ack-nhfb, 7163 classcodes = "C4220 (Automata theory)", 7164 corpsource = "Univ. Massachusetts, Amherst, MA, USA", 7165 keywords = "automata theory; brain models; brains", 7166 treatment = "T Theoretical or Mathematical", 7167 } 7168 7169 @Article{Manna:1972:FAT, 7170 author = "Zohar Manna and Jean Vuillemin", 7171 title = "Fixpoint Approach to the Theory of Computation", 7172 journal = j-CACM, 7173 volume = "15", 7174 number = "7", 7175 pages = "528--536", 7176 month = jul, 7177 year = "1972", 7178 CODEN = "CACMA2", 7179 ISSN = "0001-0782", 7180 MRclass = "68A05", 7181 MRnumber = "55 13859", 7182 mrreviewer = "Andrea Maggiolo-Schettini", 7183 bibdate = "Tue Mar 25 13:26:09 MST 1997", 7184 bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Compiler/semantics.bib", 7185 note = "Twenty-fifth anniversary of the Association for Computing Machinery.", 7186 abstract = "Following the fix point theory of Scott, the semantics of computer programs are defined in terms of the least fix points of recursive programs. This allows not only the justification of all existing verification techniques, but also their extension to the handling, in a uniform manner of various properties of computer programs, including correctness, termination, and equivalence.", 7187 acknowledgement = ack-nhfb, 7188 classcodes = "C4290 (Other computer theory)", 7189 corpsource = "Stanford Univ., CA, USA", 7190 keywords = "computation; computational induction; computational linguistics; correctness; equivalence; fixpoints; least; least fix points; program diagnostics; programming; recursive programs; semantics of computer programs; semantics of programming languages; termination; theory; verification techniques", 7191 treatment = "T Theoretical or Mathematical", 7192 } 7193 7194 @Article{Traub:1972:NMC, 7195 author = "J. F. Traub", 7196 title = "Numerical Mathematics and Computer Science", 7197 journal = j-CACM, 7198 volume = "15", 7199 number = "7", 7200 pages = "537--541", 7201 month = jul, 7202 year = "1972", 7203 CODEN = "CACMA2", 7204 ISSN = "0001-0782", 7205 MRclass = "65-03", 7206 MRnumber = "54 4031", 7207 mrreviewer = "R. H. Bartels", 7208 bibdate = "Tue Mar 25 13:26:09 MST 1997", 7209 note = "Twenty-fifth anniversary of the Association for Computing Machinery.", 7210 acknowledgement = ack-nhfb, 7211 classcodes = "C4100 (Numerical analysis)", 7212 corpsource = "Carnegie-Mellon Univ., Pittsburgh, PA, USA", 7213 keywords = "algorithms; computer science; foundations; numerical mathematics; numerical methods; reviews; synthesis and analysis", 7214 treatment = "G General Review", 7215 } 7216 7217 @Article{Shanno:1972:MSV, 7218 author = "David F. Shanno and Roman L. Weil", 7219 title = "Management science: a view from nonlinear programming", 7220 journal = j-CACM, 7221 volume = "15", 7222 number = "7", 7223 pages = "542--549", 7224 month = jul, 7225 year = "1972", 7226 CODEN = "CACMA2", 7227 ISSN = "0001-0782", 7228 MRclass = "90C10 (90C30)", 7229 MRnumber = "55 9970", 7230 bibdate = "Tue Mar 25 13:26:09 MST 1997", 7231 note = "Twenty-fifth anniversary of the Association for Computing Machinery.", 7232 acknowledgement = ack-nhfb, 7233 classcodes = "B0260 (Optimisation techniques); C1180 (Optimisation techniques)", 7234 corpsource = "Univ. Toronto, Ont., Canada", 7235 keywords = "integer; management science; mathematical programming; nonlinear programming; reviews", 7236 treatment = "B Bibliography; G General Review", 7237 } 7238 7239 @Article{Moses:1972:TGT, 7240 author = "Joel Moses", 7241 title = "Toward a General Theory of Special Functions", 7242 journal = j-CACM, 7243 volume = "15", 7244 number = "7", 7245 pages = "550--556 (or 550--554??)", 7246 month = jul, 7247 year = "1972", 7248 CODEN = "CACMA2", 7249 ISSN = "0001-0782", 7250 MRclass = "34-02 12H05", 7251 MRnumber = "53 3384", 7252 mrreviewer = "K. Okugawa", 7253 bibdate = "Tue Mar 25 13:26:09 MST 1997", 7254 note = "Twenty-fifth anniversary of the Association for Computing Machinery.", 7255 acknowledgement = ack-nhfb, 7256 classcodes = "C1100 (Mathematical techniques)", 7257 keywords = "general theory; mathematics; special functions", 7258 treatment = "T Theoretical or Mathematical", 7259 } 7260 7261 @Article{Foster:1972:VCA, 7262 author = "C. C. Foster", 7263 title = "A view of computer architecture", 7264 journal = j-CACM, 7265 volume = "15", 7266 number = "7", 7267 pages = "557--565", 7268 month = jul, 7269 year = "1972", 7270 CODEN = "CACMA2", 7271 ISSN = "0001-0782", 7272 bibdate = "Tue Mar 25 13:26:09 MST 1997", 7273 acknowledgement = ack-nhfb, 7274 classcodes = "C5220 (Computer architecture)", 7275 corpsource = "Univ. Massachusetts, Amherst, MA, USA", 7276 keywords = "computer architecture; microcomputers; predict; reviews", 7277 treatment = "G General Review", 7278 } 7279 7280 @Article{Fraser:1972:IBC, 7281 author = "A. G. Fraser", 7282 title = "On the interface between computers and data communications systems", 7283 journal = j-CACM, 7284 volume = "15", 7285 number = "7", 7286 pages = "566--573", 7287 month = jul, 7288 year = "1972", 7289 CODEN = "CACMA2", 7290 ISSN = "0001-0782", 7291 bibdate = "Tue Mar 25 13:26:09 MST 1997", 7292 bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Distributed/network.bib", 7293 abstract = "Reproduced in Advances in Computer Commun., Chu,W.W (Ed.), (1974), 246-253.", 7294 acknowledgement = ack-nhfb, 7295 classcodes = "C5610 (Computer interfaces)", 7296 corpsource = "Bell Telephone Labs. Inc., Murray Hill, NJ, USA", 7297 keywords = "computer interfaces; computers; data communication systems; data communications; interface; specifying", 7298 treatment = "P Practical", 7299 } 7300 7301 @Article{BrinchHansen:1972:SM, 7302 author = "Per {Brinch Hansen}", 7303 title = "Structured Multiprogramming", 7304 journal = j-CACM, 7305 volume = "15", 7306 number = "7", 7307 pages = "574--578", 7308 month = jul, 7309 year = "1972", 7310 CODEN = "CACMA2", 7311 ISSN = "0001-0782", 7312 bibdate = "Tue Mar 25 13:26:09 MST 1997", 7313 bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Object/Nierstrasz.bib and ftp://ftp.ira.uka.de/pub/bibliography/Os/os.bib", 7314 acknowledgement = ack-nhfb, 7315 annote = "This paper presents a proposal for structured representation of multiprogramming in a high level language. Shared variables are introduced, and their role in `critical regions (denoted by the structured statement region var do Statement') is discussed. A synchronization primitive `await Boolean' delays a process until the components of a shared variable satisfy the boolean expression. For explicit control of the scheduling of resources, an event queue is associated with a shared variable, and two procedures await (event) (leave a critical region associated with the shared variable and join the event queue) and cause (event) (enable all processes in the event queue to reenter their critical regions) are provided, which can control process scheduling to any degree desired.", 7316 classcodes = "C6150J (Operating systems)", 7317 corpsource = "California Inst. Technol., Pasadena, CA, USA", 7318 keywords = "concurrency", 7319 keywords = "critical regions; event variables; high level; language; multiprogramming; operating systems; structured multiprogramming", 7320 treatment = "P Practical", 7321 } 7322 7323 @Article{Lynch:1972:OSP, 7324 author = "W. C. Lynch", 7325 title = "Operating system performance", 7326 journal = j-CACM, 7327 volume = "15", 7328 number = "7", 7329 pages = "579--585", 7330 month = jul, 7331 year = "1972", 7332 CODEN = "CACMA2", 7333 ISSN = "0001-0782", 7334 bibdate = "Tue Mar 25 13:26:09 MST 1997", 7335 acknowledgement = ack-nhfb, 7336 classcodes = "C6150J (Operating systems)", 7337 corpsource = "Case Western Res. Univ., Cleveland, OH, USA", 7338 keywords = "computer; model; operating system performance; operating systems (computers); reviews; systems; total system", 7339 treatment = "G General Review", 7340 } 7341 7342 @Article{Kimbleton:1972:RCS, 7343 author = "S. R. Kimbleton", 7344 title = "The role of computer system models in performance evaluation", 7345 journal = j-CACM, 7346 volume = "15", 7347 number = "7", 7348 pages = "586--590", 7349 month = jul, 7350 year = "1972", 7351 CODEN = "CACMA2", 7352 ISSN = "0001-0782", 7353 bibdate = "Tue Mar 25 13:26:09 MST 1997", 7354 acknowledgement = ack-nhfb, 7355 classcodes = "C0310 (EDP management); C1220 (Simulation, modelling and identification); C6150J (Operating systems)", 7356 corpsource = "UNIV. Michigan, Ann Arbor, MI, USA", 7357 keywords = "computer selection and evaluation; computer system models; evaluation; modelling; operating; operating systems; performance; systems (computers)", 7358 treatment = "P Practical", 7359 } 7360 7361 @Article{Rosen:1972:PSL, 7362 author = "Saul Rosen", 7363 title = "Programming Systems and Languages (1965--1975)", 7364 journal = j-CACM, 7365 volume = "15", 7366 number = "7", 7367 pages = "591--600", 7368 month = jul, 7369 year = "1972", 7370 CODEN = "CACMA2", 7371 ISSN = "0001-0782", 7372 bibdate = "Tue Mar 25 13:26:09 MST 1997", 7373 abstract = "In spite of impressive gains by PL/I, Fortran and Cobol remain the languages in which most of the world's production programs are written and will remain so into the foreseeable future. There is a great deal of theoretical interest in Algol 68 and in extensible languages, but so far at least they have had little practical impact. Problem-oriented languages may very well become the most important language development area in the next five to ten years.\par In the operating system area all major computer manufacturers set out to produce very ambitious multiprogramming systems, and they all ran into similar problems. A number of university projects,though not directly comparable to those of the manufacturers, have contributed greatly to a better understanding of operating system principles. Important trends include the increased interest in the development of system measurement and evaluation techniques,and increased use of microprogramming for some programming system functions.", 7374 acknowledgement = ack-nhfb, 7375 classcodes = "C6140 (Programming languages); C6150J (Operating systems)", 7376 corpsource = "Purdue Univ., Lafayette, IN, USA", 7377 keywords = "history; languages; microprogramming; multiprogramming; operating system; operating systems; operating systems (computers); problem oriented languages; programming; programming systems; reviews", 7378 treatment = "G General Review", 7379 } 7380 7381 @Article{Sammet:1972:PLH, 7382 author = "Jean E. Sammet", 7383 title = "Programming Languages: History and Future", 7384 journal = j-CACM, 7385 volume = "15", 7386 number = "7", 7387 pages = "601--610", 7388 month = jul, 7389 year = "1972", 7390 CODEN = "CACMA2", 7391 ISSN = "0001-0782", 7392 bibdate = "Tue Mar 25 13:26:09 MST 1997", 7393 abstract = "This paper discusses both the history and future of programming languages (= higher level languages). \par Some of the difficulties in writing such a history are indicated. A key part of the paper is a tree showing the chronological development of languages and their interrelationships. Reasons for the proliferation of languages are given. The major languages are listed with the reasons for their importance. A section on chronology indicates the happenings of the significant previous time periods and the major topics of 1972. Key concepts other than specific languages are discussed.", 7394 acknowledgement = ack-nhfb, 7395 classcodes = "C6140 (Programming languages)", 7396 corpsource = "IBM Corp., Cambridge, MA, USA", 7397 keywords = "chronological; development; future; future directions; higher level languages; history; language interrelationships; languages; programming language future; programming language history; programming language tree; programming languages; reviews", 7398 treatment = "G General Review", 7399 } 7400 7401 @Article{Fosdick:1972:PBM, 7402 author = "L. D. Fosdick", 7403 title = "The production of better mathematical software", 7404 journal = j-CACM, 7405 volume = "15", 7406 number = "7", 7407 pages = "611--617", 7408 month = jul, 7409 year = "1972", 7410 CODEN = "CACMA2", 7411 ISSN = "0001-0782", 7412 bibdate = "Tue Mar 25 13:26:09 MST 1997", 7413 acknowledgement = ack-nhfb, 7414 classcodes = "C6110 (Systems analysis and programming)", 7415 corpsource = "Univ. Colorado, Boulder, CO, USA", 7416 keywords = "computer software; mathematical software; mathematics; production; programming", 7417 treatment = "G General Review", 7418 } 7419 7420 @Article{Bobrow:1972:RAP, 7421 author = "D. G. Bobrow", 7422 title = "Requirements for Advanced Programming Systems for List Processing", 7423 journal = j-CACM, 7424 volume = "15", 7425 number = "7", 7426 pages = "618--627", 7427 month = jul, 7428 year = "1972", 7429 CODEN = "CACMA2", 7430 ISSN = "0001-0782", 7431 bibdate = "Tue Mar 25 13:26:09 MST 1997", 7432 bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Ai/lisp.bib", 7433 acknowledgement = ack-nhfb, 7434 classcodes = "C6130 (Data handling techniques)", 7435 corpsource = "Xerox, Palo Alto, CA, USA", 7436 keywords = "advanced programming systems; list processing; requirements", 7437 } 7438 7439 @Article{Bachman:1972:ESS, 7440 author = "Charles W. Bachman", 7441 title = "The Evolution of Storage Structures", 7442 journal = j-CACM, 7443 volume = "15", 7444 number = "7", 7445 pages = "628--634", 7446 month = jul, 7447 year = "1972", 7448 CODEN = "CACMA2", 7449 ISSN = "0001-0782", 7450 bibdate = "Tue Mar 25 13:26:09 MST 1997", 7451 bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib", 7452 acknowledgement = ack-nhfb, 7453 annote = "Good overview of basic definitions and their relationships", 7454 classcodes = "C6120 (File organisation)", 7455 corpsource = "Honeywell Information Systems, Billerica, MA, USA", 7456 keywords = "data base management systems; Data Structure Diagram graphic technique; data structures; evolution; storage management; storage structures", 7457 treatment = "P Practical", 7458 } 7459 7460 @Article{Rice:1972:PFS, 7461 author = "J. R. Rice", 7462 title = "On the present and future of scientific computation", 7463 journal = j-CACM, 7464 volume = "15", 7465 number = "7", 7466 pages = "637--639", 7467 month = jul, 7468 year = "1972", 7469 CODEN = "CACMA2", 7470 ISSN = "0001-0782", 7471 bibdate = "Tue Mar 25 13:26:09 MST 1997", 7472 acknowledgement = ack-nhfb, 7473 classcodes = "C7320 (Physics and chemistry computing); C7490 (Computing in other engineering fields)", 7474 corpsource = "Purdue Univ., Lafayette, IN, USA", 7475 keywords = "engineering applications of computers; future; natural sciences; physical sciences; physics; present; scientific computation", 7476 treatment = "G General Review", 7477 } 7478 7479 @Article{Benjamin:1972:GPI, 7480 author = "Robert I. Benjamin", 7481 title = "A generational perspective of information system development", 7482 journal = j-CACM, 7483 volume = "15", 7484 number = "7", 7485 pages = "640--643", 7486 month = jul, 7487 year = "1972", 7488 CODEN = "CACMA2", 7489 ISSN = "0001-0782", 7490 bibdate = "Tue Mar 25 13:26:09 MST 1997", 7491 bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib", 7492 acknowledgement = ack-nhfb, 7493 classcodes = "C7100 (Business and administration)", 7494 corpsource = "Xerox Corp., Rochester, NY, USA", 7495 keywords = "computing milieu; generational perspective; information system development; management data processing; management information systems", 7496 treatment = "G General Review", 7497 } 7498 7499 @Article{Sedelow:1972:LAH, 7500 author = "S. Y. Sedelow", 7501 title = "Language analysis in the humanities", 7502 journal = j-CACM, 7503 volume = "15", 7504 number = "7", 7505 pages = "644--647", 7506 month = jul, 7507 year = "1972", 7508 CODEN = "CACMA2", 7509 ISSN = "0001-0782", 7510 bibdate = "Tue Mar 25 13:26:09 MST 1997", 7511 acknowledgement = ack-nhfb, 7512 classcodes = "C7820 (Humanities computing)", 7513 corpsource = "Univ. Kansas, Lawrence, KS, USA", 7514 keywords = "concordances; humanities; indices; language analysis; language translation and linguistics; pattern generation; pattern recognition", 7515 treatment = "P Practical", 7516 } 7517 7518 @Article{Zinn:1972:CIP, 7519 author = "K. L. Zinn", 7520 title = "Computers in the instructional process: directions for research and development", 7521 journal = j-CACM, 7522 volume = "15", 7523 number = "7", 7524 pages = "648--651", 7525 month = jul, 7526 year = "1972", 7527 CODEN = "CACMA2", 7528 ISSN = "0001-0782", 7529 bibdate = "Tue Mar 25 13:26:09 MST 1997", 7530 acknowledgement = ack-nhfb, 7531 classcodes = "C7810C (Computer-aided instruction)", 7532 corpsource = "Univ. Michigan, Ann Arbor, MI, USA", 7533 keywords = "computer aided instruction; computers; development; directions; education; instructional process; research and", 7534 treatment = "G General Review", 7535 } 7536 7537 @Article{Sturman:1972:CUS, 7538 author = "G. M. Sturman", 7539 title = "Computers and urban society", 7540 journal = j-CACM, 7541 volume = "15", 7542 number = "7", 7543 pages = "652--657", 7544 month = jul, 7545 year = "1972", 7546 CODEN = "CACMA2", 7547 ISSN = "0001-0782", 7548 bibdate = "Tue Mar 25 13:26:09 MST 1997", 7549 acknowledgement = ack-nhfb, 7550 classcodes = "C7000 (Computer applications); C7130 (Public administration)", 7551 corpsource = "Parsons Brinckerhoff Quade and Douglas Inc., NY, USA", 7552 keywords = "administrative data processing; brief survey; computers; engineering analysis; engineering applications of computers; government; information systems; sciences; social and behavioural; urban society; urban systems", 7553 treatment = "P Practical", 7554 } 7555 7556 @Article{Salton:1972:DDP, 7557 author = "G. Salton", 7558 title = "Dynamic document processing", 7559 journal = j-CACM, 7560 volume = "15", 7561 number = "7", 7562 pages = "658--668", 7563 month = jul, 7564 year = "1972", 7565 CODEN = "CACMA2", 7566 ISSN = "0001-0782", 7567 bibdate = "Tue Mar 25 13:26:09 MST 1997", 7568 acknowledgement = ack-nhfb, 7569 classcodes = "C7250 (Information storage and retrieval)", 7570 corpsource = "Cornell Univ., Ithaca, NY, USA", 7571 keywords = "automatic; automatic indexing; automatic search and; clustered files; collection growth; dynamic document; indexing; information; information retrieval; interactive user controlled search process; iterative searching; library automation; library mechanisation; processing; query modification; retrieval", 7572 treatment = "P Practical", 7573 } 7574 7575 @Article{Knuth:1972:ABA, 7576 author = "Donald E. Knuth", 7577 title = "Ancient {Babylonian} algorithms", 7578 journal = j-CACM, 7579 volume = "15", 7580 number = "7", 7581 pages = "671--677", 7582 month = jul, 7583 year = "1972", 7584 CODEN = "CACMA2", 7585 ISSN = "0001-0782", 7586 MRnumber = "52 13132", 7587 bibdate = "Tue Mar 25 13:26:09 MST 1997", 7588 note = "Twenty-fifth anniversary of the Association for Computing Machinery. See errata \cite{Knuth:1976:EAB}.", 7589 acknowledgement = ack-nhfb, 7590 classcodes = "C1100 (Mathematical techniques)", 7591 corpsource = "Stanford Univ., CA, USA", 7592 keywords = "ancient Babylonian algorithms; Babylonian; computer science; history of computation; mathematics; origins of mathematics; sexagesimal number system; tablets", 7593 treatment = "T Theoretical or Mathematical", 7594 } 7595 7596 @Article{Bauer:1972:PKZ, 7597 author = "F. L. Bauer and H. W{\"o}ssner and Konrad Zuse", 7598 title = "The ``Plankalk{\"u}l'' of {Konrad Zuse}: a forerunner of today's programming languages.", 7599 journal = j-CACM, 7600 volume = "15", 7601 number = "7", 7602 pages = "678--685", 7603 month = jul, 7604 year = "1972", 7605 CODEN = "CACMA2", 7606 ISSN = "0001-0782", 7607 MRclass = "68A05 (68-03)", 7608 MRnumber = "52 16093", 7609 bibdate = "Tue Mar 25 13:26:09 MST 1997", 7610 note = "Twenty-fifth anniversary of the Association for Computing Machinery.", 7611 acknowledgement = ack-nhfb, 7612 classcodes = "C6140 (Programming languages)", 7613 corpsource = "Tech. Univ. M{\"u}nchen, West Germany", 7614 keywords = "history of; Konrad Zuse; languages; notational and conceptual system; Plankalkul; programming; programming languages; programming theory", 7615 treatment = "G General Review", 7616 } 7617 7618 @Article{Sprague:1972:WVC, 7619 author = "Richard E. Sprague", 7620 title = "A {Western} View of Computer History", 7621 journal = j-CACM, 7622 volume = "15", 7623 number = "7", 7624 pages = "686--692", 7625 month = jul, 7626 year = "1972", 7627 CODEN = "CACMA2", 7628 ISSN = "0001-0782", 7629 MRclass = "68-03", 7630 MRnumber = "52 16082", 7631 bibdate = "Tue Mar 25 13:26:09 MST 1997", 7632 note = "Twenty-fifth anniversary of the Association for Computing Machinery.", 7633 acknowledgement = ack-nhfb, 7634 classcodes = "C0200 (General computer topics)", 7635 corpsource = "Litton ARS, Morristown, NJ, USA", 7636 keywords = "1945 to 1955; computer history; digital computers", 7637 treatment = "G General Review", 7638 } 7639 7640 @Article{Alt:1972:ACR, 7641 author = "Franz L. Alt", 7642 title = "Archaeology of computers --- reminiscences, 1945--1947", 7643 journal = j-CACM, 7644 volume = "15", 7645 number = "7", 7646 pages = "693--694", 7647 month = jul, 7648 year = "1972", 7649 CODEN = "CACMA2", 7650 ISSN = "0001-0782", 7651 MRclass = "68-03", 7652 MRnumber = "52 16079", 7653 bibdate = "Tue Mar 25 13:26:09 MST 1997", 7654 note = "Twenty-fifth anniversary of the Association for Computing Machinery", 7655 acknowledgement = ack-nhfb, 7656 classcodes = "C5420 (Mainframes and minicomputers)", 7657 corpsource = "American Inst. Phys., NY, USA", 7658 keywords = "1945 to 1947; digital computers; ENIAC; history of computers; reminiscences; special purpose computers", 7659 treatment = "G General Review", 7660 } 7661 7662 @Article{Borodin:1972:CE, 7663 author = "A. Borodin and C. C. Gotlieb", 7664 title = "Computers and employment", 7665 journal = j-CACM, 7666 volume = "15", 7667 number = "7", 7668 pages = "695--702", 7669 month = jul, 7670 year = "1972", 7671 CODEN = "CACMA2", 7672 ISSN = "0001-0782", 7673 bibdate = "Tue Mar 25 13:26:09 MST 1997", 7674 acknowledgement = ack-nhfb, 7675 classcodes = "C0200 (General computer topics)", 7676 corpsource = "Univ. Toronto, Ont., Canada", 7677 keywords = "computers; economic and sociological effects; employment; social implications; unemployment", 7678 treatment = "G General Review", 7679 } 7680 7681 @Article{Herriot:1972:MGF, 7682 author = "John G. Herriot", 7683 title = "In memory of {George E. Forsythe}", 7684 journal = j-CACM, 7685 volume = "15", 7686 number = "8", 7687 pages = "719--720", 7688 month = aug, 7689 year = "1972", 7690 CODEN = "CACMA2", 7691 ISSN = "0001-0782", 7692 MRclass = "01A70", 7693 MRnumber = "52 7801", 7694 bibdate = "Tue Dec 26 13:35:07 1995", 7695 note = "Collection of articles in honor of {George E. Forsythe} ({ACM} Student Competition Award Papers).", 7696 acknowledgement = ack-nhfb, 7697 } 7698 7699 @Article{Knuth:1972:GFD, 7700 author = "Donald E. Knuth", 7701 title = "{George Forsythe} and the development of Computer Science", 7702 journal = j-CACM, 7703 volume = "15", 7704 number = "8", 7705 pages = "721--726", 7706 month = aug, 7707 year = "1972", 7708 CODEN = "CACMA2", 7709 ISSN = "0001-0782", 7710 MRclass = "01A70 (68-03)", 7711 MRnumber = "52 7802", 7712 bibdate = "Tue Dec 26 13:35:07 1995", 7713 note = "Collection of articles in honor of {George E. Forsythe} ({ACM} Student Competition Award Papers).", 7714 acknowledgement = ack-nhfb, 7715 } 7716 7717 @Article{Crowe:1972:GPA, 7718 author = "David Crowe", 7719 title = "Generating parsers for affix grammars. Collection of articles in honor of {George E. Forsythe (ACM Student Competition Award Papers)}", 7720 journal = j-CACM, 7721 volume = "15", 7722 number = "8", 7723 pages = "728--734", 7724 month = aug, 7725 year = "1972", 7726 CODEN = "CACMA2", 7727 ISSN = "0001-0782", 7728 MRclass = "68A30", 7729 MRnumber = "53 4635", 7730 mrreviewer = "Ole Lehrmann Madsen", 7731 bibdate = "Tue Mar 25 13:26:09 MST 1997", 7732 bibsource = "Compendex database", 7733 abstract = "Koster, the inventor of affix grammars, suggests a top-down scheme for parsing them, based on recursive procedures. This paper presents a bottom-up scheme for parsing them, based on an extension of Floyd Production Language (FPL). Included is an algorithm, similar to that of DeRemer's, for covering a large class of affix grammars into FPL. The paper discusses the applicabilities of the conversion algorithm and affix grammars in general, and some possible extensions to Koster's definition of affix grammars.", 7734 acknowledgement = ack-nhfb, 7735 classcodes = "C4210 (Formal logic)", 7736 classification = "721; 723", 7737 corpsource = "Univ. British Columbia, Vancouver, BC, Canada", 7738 journalabr = "Commun ACM", 7739 keywords = "affix grammars; algorithmic language processing; algorithmic languages; automata theory --- Grammars; bottom up; computer metatheory; grammars; parsers; syntax directed compiling; translator writing systems; two level grammars", 7740 treatment = "T Theoretical or Mathematical", 7741 } 7742 7743 @Article{Helbig:1972:PRC, 7744 author = "Robert E. Helbig and Patrick K. Orr and Robert R. Roediger", 7745 title = "Political Redistricting by Computer", 7746 journal = j-CACM, 7747 volume = "15", 7748 number = "8", 7749 pages = "735--741", 7750 month = aug, 7751 year = "1972", 7752 CODEN = "CACMA2", 7753 ISSN = "0001-0782", 7754 bibdate = "Tue Mar 25 13:26:09 MST 1997", 7755 bibsource = "Compendex database", 7756 abstract = "Criteria for acceptable redistricting are discussed, including population equality, compactness, contiguity, and preservation of natural and\slash or political boundaries. Only nonpartisan criteria are considered. Using 1970 Bureau of Census population data, specific results are given for the ten Congressional Districts in the state of Missouri and for the seven St. Louis county Council seats. Results from the use of the algorithm indicate the feasibility of political redistricting with the aid of a computer.", 7757 acknowledgement = ack-nhfb, 7758 classcodes = "C7810 (Social and behavioural sciences computing)", 7759 classification = "723", 7760 corpsource = "Washington Univ., St. Louis, MO, USA", 7761 journalabr = "Commun ACM", 7762 keywords = "algorithm; compactness; computer; contiguity; data processing, business; equal population; legislative districts; political redistricting; reapportionment; social and behavioural sciences; transportation", 7763 treatment = "A Application", 7764 } 7765 7766 @Article{Benjamin:1972:EES, 7767 author = "Arthur J. Benjamin", 7768 title = "Extensible Editor for a Small Machine with Disk Storage", 7769 journal = j-CACM, 7770 volume = "15", 7771 number = "8", 7772 pages = "742--747", 7773 month = aug, 7774 year = "1972", 7775 CODEN = "CACMA2", 7776 ISSN = "0001-0782", 7777 bibdate = "Tue Mar 25 13:26:09 MST 1997", 7778 bibsource = "Compendex database", 7779 abstract = "A design philosophy for developing a sophisticated utility program is illustrated by the actual design and implementation of a text editor. A versatile data structure is employed so that only a small number of programmed subroutines are necessary for all types of data manipulation. Such a data structure is described, and its merits are illustrated by the ease with which powerful extensions can be implemented in terms of a few basic editing functions.", 7780 acknowledgement = ack-nhfb, 7781 classcodes = "C6120 (File organisation); C6130 (Data handling techniques); C6150E (General utility programs)", 7782 classification = "723", 7783 corpsource = "Brandeis Univ., Waltham, MA, USA", 7784 journalabr = "Commun ACM", 7785 keywords = "collection; command; computer programming --- Macros; computer systems programming --- Supervisory and Executive Programs; context searching; data processing; data storage, magnetic --- Disk Storage; data structures; design; disc storage; executive program; extensible editor; garbage; interpreter; list processing; macro language; paging; parameter substitution; philosophy; processing; programs; recursion; small machine; state table; storage allocation; string manipulation; text editing; text editor; utility; utility program; virtual memory", 7786 treatment = "P Practical", 7787 } 7788 7789 @Article{Rosin:1972:ERM, 7790 author = "Robert F. Rosin and Gideon Frieder and Richard H. {Eckhouse, Jr.}", 7791 title = "Environment for Research in Microprogramming and Emulation", 7792 journal = j-CACM, 7793 volume = "15", 7794 number = "8", 7795 pages = "748--760", 7796 month = aug, 7797 year = "1972", 7798 CODEN = "CACMA2", 7799 ISSN = "0001-0782", 7800 bibdate = "Tue Mar 25 13:26:09 MST 1997", 7801 bibsource = "Compendex database", 7802 abstract = "The development of the research project in microprogramming and emulation at State University of New York at Buffalo consisted of three phases: the evaluation of various possible machines to support this research; the decision to purchase one such machine, which appears to be superior to the others considered; and the organization and definition of goals for each group in the project. Each of these phases is reported, with emphasis placed on the early results achieved in this research.", 7803 acknowledgement = ack-nhfb, 7804 classcodes = "C5220 (Computer architecture); C7430 (Computer engineering)", 7805 classification = "722; 723", 7806 corpsource = "State Univ. New York, Buffalo, NY, USA", 7807 journalabr = "Commun ACM", 7808 keywords = "computer architecture; computer systems; computer systems, digital; emulation; engineering applications of computers; environment for research; hardware evaluation; language processors; management; microprogramming; nanoprogram; project; simulation", 7809 treatment = "X Experimental", 7810 } 7811 7812 @Article{Oden:1972:MMC, 7813 author = "P. H. Oden and G. S. Shedler", 7814 title = "A Model of Memory Contention in a Paging Machine", 7815 journal = j-CACM, 7816 volume = "15", 7817 number = "8", 7818 pages = "761--771", 7819 month = aug, 7820 year = "1972", 7821 CODEN = "CACMA2", 7822 ISSN = "0001-0782", 7823 MRclass = "68A50", 7824 MRnumber = "55 13903", 7825 bibdate = "Tue Mar 25 13:26:09 MST 1997", 7826 bibsource = "Compendex database", 7827 note = "Collection of articles in honor of {George E. Forsythe} ({ACM} Student Competition Award Papers).", 7828 abstract = "In the model presented, the number of page-frames of main memory allocated to a problem program varies in time. These changes in memory configuration are represented explicitly in the model, CPU requirements and page exception characteristics of program material being described statistically. Expressions for the distribution of the number of page-frames allocated to an executing program, the long run expected fraction of a program's execution time in a given number of page-frames, and the average execution interval of the multiprogrammed load are obtained. It is pointed out heuristically and demonstrated numerically that an increase is obtainable in the average execution interval of the multiprogrammed load over that resulting from equal fixed partitioning of main memory.", 7829 acknowledgement = ack-nhfb, 7830 classcodes = "C6120 (File organisation)", 7831 classification = "723", 7832 corpsource = "IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA", 7833 journalabr = "Commun ACM", 7834 keywords = "computer operating systems; demand paging; file organisation; management; memory; memory contention; modelling; multiprogrammed; operating; paging machines; probability --- Queueing Theory; queuing analysis; storage; storage allocation; systems studies", 7835 treatment = "T Theoretical or Mathematical", 7836 } 7837 7838 @Article{Bernstein:1972:CFM, 7839 author = "H. J. Bernstein and H. T. Gladwin", 7840 title = "Compiling fixed-point multiplications", 7841 journal = j-CACM, 7842 volume = "15", 7843 number = "8", 7844 pages = "772--772", 7845 month = aug, 7846 year = "1972", 7847 CODEN = "CACMA2", 7848 ISSN = "0001-0782", 7849 bibdate = "Tue Mar 25 13:26:09 MST 1997", 7850 acknowledgement = ack-nhfb, 7851 classcodes = "C5230 (Digital arithmetic methods); C6110 (Systems analysis and programming)", 7852 corpsource = "Brookhaven Nat. Lab., Upton, NY, USA", 7853 keywords = "compiling multiplications; digital arithmetic; fixed point arithmetic; programming", 7854 treatment = "P Practical", 7855 } 7856 7857 @Article{vanderPoel:1972:CCS, 7858 author = "W. L. {van der Poel}", 7859 title = "Comment on the composition of semantics in {Algol 68}", 7860 journal = j-CACM, 7861 volume = "15", 7862 number = "8", 7863 pages = "772--772", 7864 month = aug, 7865 year = "1972", 7866 CODEN = "CACMA2", 7867 ISSN = "0001-0782", 7868 bibdate = "Tue Mar 25 13:26:09 MST 1997", 7869 acknowledgement = ack-nhfb, 7870 classcodes = "C6140D (High level languages)", 7871 corpsource = "Univ. Technol. Delft, Netherlands", 7872 keywords = "ALGOL; ALGOL 68; composition of semantics; data; design; programming languages; programming primitives; recursive composition; structures", 7873 treatment = "T Theoretical or Mathematical", 7874 } 7875 7876 @Article{Morris:1972:BVW, 7877 author = "James H. {Morris, Jr.}", 7878 title = "A Bonus from {van Wijngaarden}'s Device", 7879 journal = j-CACM, 7880 volume = "15", 7881 number = "8", 7882 pages = "773--773", 7883 month = aug, 7884 year = "1972", 7885 CODEN = "CACMA2", 7886 ISSN = "0001-0782", 7887 bibdate = "Tue Mar 25 13:26:09 MST 1997", 7888 bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Compiler/reynolds.bib", 7889 acknowledgement = ack-nhfb, 7890 classcodes = "C6140D (High level languages)", 7891 corpsource = "Univ. California, Berkeley, CA, USA", 7892 keywords = "ALGOL; ALGOL 60 programs; eliminate all labels; nonlocal transfers; procedure returns", 7893 treatment = "P Practical", 7894 } 7895 7896 @Article{Jones:1972:CAB, 7897 author = "P. R. Jones", 7898 title = "Comment on average binary search length", 7899 journal = j-CACM, 7900 volume = "15", 7901 number = "8", 7902 pages = "774--774", 7903 month = aug, 7904 year = "1972", 7905 CODEN = "CACMA2", 7906 ISSN = "0001-0782", 7907 bibdate = "Tue Mar 25 13:26:09 MST 1997", 7908 acknowledgement = ack-nhfb, 7909 classcodes = "C6130 (Data handling techniques)", 7910 keywords = "binary searching; data handling; record retrieval; search length", 7911 treatment = "P Practical", 7912 } 7913 7914 @Article{Read:1972:NGR, 7915 author = "Ronald C. Read and K. Harada", 7916 title = "A note on the generation of rosary permutations. With a response by {K. Harada}", 7917 journal = j-CACM, 7918 volume = "15", 7919 number = "8", 7920 pages = "775--775", 7921 month = aug, 7922 year = "1972", 7923 CODEN = "CACMA2", 7924 ISSN = "0001-0782", 7925 MRclass = "68A10", 7926 MRnumber = "53 9706", 7927 mrreviewer = "Dennis White", 7928 bibdate = "Tue Mar 25 13:26:09 MST 1997", 7929 note = "Collection of articles in honor of {George E. Forsythe} ({ACM} Student Competition Award Papers).", 7930 acknowledgement = ack-nhfb, 7931 classcodes = "B0250 (Combinatorial mathematics); C1160 (Combinatorial mathematics)", 7932 corpsource = "Univ. Waterloo, Ont., Canada", 7933 keywords = "associating an integer; combinatorial mathematics; generation; rosary permutations", 7934 treatment = "T Theoretical or Mathematical", 7935 } 7936 7937 @Article{Squire:1972:AAL, 7938 author = "W. Squire", 7939 title = "{ACM} Algorithm 429: Localization of the Roots of a Polynomial", 7940 journal = j-CACM, 7941 volume = "15", 7942 number = "8", 7943 pages = "776--777", 7944 month = aug, 7945 year = "1972", 7946 CODEN = "CACMA2", 7947 ISSN = "0001-0782", 7948 bibdate = "Thu Sep 08 09:34:06 1994", 7949 } 7950 7951 @Article{PurdomJr:1972:AAI, 7952 author = "P. W. {Purdom Jr.} and E. F. Moore", 7953 title = "{ACM} Algorithm 430: Immediate Predominators in a Directed Graph", 7954 journal = j-CACM, 7955 volume = "15", 7956 number = "8", 7957 pages = "777--778", 7958 month = aug, 7959 year = "1972", 7960 CODEN = "CACMA2", 7961 ISSN = "0001-0782", 7962 bibdate = "Thu Sep 08 09:34:05 1994", 7963 } 7964 7965 @Article{Levitt:1972:CAS, 7966 author = "K. N. Levitt and W. H. Kautz", 7967 title = "Cellular Arrays for the Solution of Graph Problems", 7968 journal = j-CACM, 7969 volume = "15", 7970 number = "9", 7971 pages = "789--801", 7972 month = sep, 7973 year = "1972", 7974 CODEN = "CACMA2", 7975 ISSN = "0001-0782", 7976 bibdate = "Tue Mar 25 13:26:09 MST 1997", 7977 bibsource = "Compendex database", 7978 abstract = "Several parallelized algorithms are presented for the solution of certain spanning tree, distance, and path problems, with direct applications to wire routing, PERT chart analysis, and the analysis of many types of networks. These algorithms exhibit a computation time that in many cases grows at a rate not exceeding log//2 n, where n is the number of nodes in the graph. Straightforward cellular implementations of the well-known serial algorithms for these problems require about n steps, and noncellular implementations require from n**2 to n**3 steps.", 7979 acknowledgement = ack-nhfb, 7980 classcodes = "C5420 (Mainframes and minicomputers); C7310 (Mathematics computing)", 7981 classification = "722; 723", 7982 corpsource = "Stanford Res. Inst., Menlo Park, CA, USA", 7983 journalabr = "Commun ACM", 7984 keywords = "cellular arrays; data storage, digital; graph problems; graph theory; mathematical techniques --- Graph Theory; special purpose computers", 7985 treatment = "A Application", 7986 } 7987 7988 @Article{Ghosh:1972:FOC, 7989 author = "Sakti P. Ghosh", 7990 title = "File Organization --- The Consecutive Retrieval Property", 7991 journal = j-CACM, 7992 volume = "15", 7993 number = "9", 7994 pages = "802--808", 7995 month = sep, 7996 year = "1972", 7997 CODEN = "CACMA2", 7998 ISSN = "0001-0782", 7999 bibdate = "Tue Mar 25 13:26:09 MST 1997", 8000 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib", 8001 abstract = "Some important theorems on the consecutive retrieval property are proved. Conditions under which the consecutive retrieval property exists and remain invariant have been established. An outline for designing an information retrieval system based on the consecutive retrieval property is discussed.", 8002 acknowledgement = ack-nhfb, 8003 classcodes = "C6120 (File organisation)", 8004 classification = "721; 723", 8005 corpsource = "IBM, San Jose, CA, USA", 8006 journalabr = "Commun ACM", 8007 keywords = "consecutive; consecutive retrieval; data processing; file organisation; file organization; information retrieval; information retrieval system; information retrieval systems; minimum access; query structure; record; storage; storage on tapes; storage space; structure; time", 8008 treatment = "T Theoretical or Mathematical", 8009 } 8010 8011 @Article{Mor:1972:NAA, 8012 author = "M. Mor and T. Lamdan", 8013 title = "A New Approach to Automatic Scanning of Contour Maps", 8014 journal = j-CACM, 8015 volume = "15", 8016 number = "9", 8017 pages = "809--812", 8018 month = sep, 8019 year = "1972", 8020 CODEN = "CACMA2", 8021 ISSN = "0001-0782", 8022 bibdate = "Tue Mar 25 13:26:09 MST 1997", 8023 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Graphics/imager/imager.75.bib", 8024 abstract = "The structure of a general contour map is analyzed, and its topological properties are utilized in developing a new scanning algorithm. The problem of detection and recognition of contour lines is solved by a two color labeling method. It is shown that for maps containing normal contour lines only, it suffices to distinguish between so-called ``even'' and ``odd'' lines. The ``tangency problem'' involved in practical scanning is discussed, and a solution base on minimizing computer memory space and simplifying control program is suggested.", 8025 acknowledgement = ack-nhfb, 8026 classcodes = "C6130 (Data handling techniques); C7890 (Other special applications of computing)", 8027 classification = "723", 8028 corpsource = "Israeli Min. Defense, Tel-Aviv, Israel", 8029 journalabr = "Commun ACM", 8030 keywords = "automatic scanning; cartography; computer graphics; contour maps; data handling; digitizing; image processing; topology", 8031 treatment = "P Practical", 8032 } 8033 8034 @Article{Richman:1972:AEA, 8035 author = "Paul L. Richman", 8036 title = "Automatic Error Analysis for Determining Precision", 8037 journal = j-CACM, 8038 volume = "15", 8039 number = "9", 8040 pages = "813--817", 8041 month = sep, 8042 year = "1972", 8043 CODEN = "CACMA2", 8044 ISSN = "0001-0782", 8045 MRclass = "65G05", 8046 MRnumber = "47 2808", 8047 bibdate = "Tue Mar 25 13:26:09 MST 1997", 8048 bibsource = "Compendex database", 8049 abstract = "The problem considered is that of evaluating a rational expression to within any desired tolerance on a computer which performs variable-precision floating-point arithmetic operations. An automatic error analysis technique is given for determining, directly from the results of a trial low-precision interval arithmetic calculation, just how much precision and data accuracy are required to achieve a desired final accuracy. The technique given generalize easily to the evaluation of many nonrational expressions.", 8050 acknowledgement = ack-nhfb, 8051 classcodes = "B0290B (Error analysis in numerical methods); C4110 (Error analysis in numerical methods); C5230 (Digital arithmetic methods)", 8052 classification = "921", 8053 corpsource = "Bell Telephone Labs. Inc., Denver, CO, USA", 8054 journalabr = "Commun ACM", 8055 keywords = "automatic error analysis; control; digital arithmetic; error analysis; floating point arithmetic; interval arithmetic; mathematical techniques; precision; precision control", 8056 treatment = "T Theoretical or Mathematical", 8057 } 8058 8059 @Article{Ravindran:1972:AAC, 8060 author = "A. Ravindran", 8061 title = "{ACM} Algorithm 431: {A} Computer Routine for Quadratic and Linear Programming Problems", 8062 journal = j-CACM, 8063 volume = "15", 8064 number = "9", 8065 pages = "818--820", 8066 month = sep, 8067 year = "1972", 8068 CODEN = "CACMA2", 8069 ISSN = "0001-0782", 8070 bibdate = "Mon Feb 12 14:34:00 1996", 8071 } 8072 8073 @Article{Bartels:1972:AAS, 8074 author = "R. H. Bartels and G. W. Stewart", 8075 title = "{ACM} Algorithm 432: Solution of the Matrix Equation ${\bf{A}}x+x{\bf{B}}={\bf{C}}$", 8076 journal = j-CACM, 8077 volume = "15", 8078 number = "9", 8079 pages = "820--826", 8080 month = sep, 8081 year = "1972", 8082 CODEN = "CACMA2", 8083 ISSN = "0001-0782", 8084 bibdate = "Thu Sep 08 09:33:59 1994", 8085 bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Parallel/par.lin.alg.bib", 8086 keywords = "linear algebra; linear equations; matrices", 8087 } 8088 8089 @Article{Deutsch:1972:TAR, 8090 author = "E. S. Deutsch", 8091 title = "Thinning Algorithms on Rectangular, Hexagonal, and Triangular Arrays", 8092 journal = j-CACM, 8093 volume = "15", 8094 number = "9", 8095 pages = "827--837", 8096 month = sep, 8097 year = "1972", 8098 CODEN = "CACMA2", 8099 ISSN = "0001-0782", 8100 bibdate = "Tue Mar 25 13:26:09 MST 1997", 8101 bibsource = "Compendex database", 8102 abstract = "Three thinning algorithms are developed: one each for use with rectangular, hexagonal, and triangular arrays. The approach to the development of each algorithm is the same. Pictorial results produced by each of the algorithms are presented and the relative performances of the algorithms are compared. It is found that the algorithm operating with the triangular array is the most sensitive to image irregularities and noise, yet it will yield a thinned image with an overall reduced number of points. It is concluded that the algorithm operating in conjunction with the hexagonal array has features which strike a balance between those of the other two arrays.", 8103 acknowledgement = ack-nhfb, 8104 classcodes = "C4290 (Other computer theory)", 8105 classification = "723", 8106 corpsource = "Univ. Maryland, College Park, MD, USA", 8107 journalabr = "Commun ACM", 8108 keywords = "arrays; computation theory; computer programming --- Subroutines; data handling; image processing; pattern recognition systems; rectangular, hexagonal, triangular; skeleton; thinning algorithms", 8109 treatment = "T Theoretical or Mathematical", 8110 } 8111 8112 @Article{Gregory:1972:CFP, 8113 author = "J. Gregory", 8114 title = "A Comparison of Floating Point Summation Methods", 8115 journal = j-CACM, 8116 volume = "15", 8117 number = "9", 8118 pages = "838--838", 8119 month = sep, 8120 year = "1972", 8121 CODEN = "CACMA2", 8122 ISSN = "0001-0782", 8123 bibdate = "Tue Mar 25 13:26:09 MST 1997", 8124 bibsource = "garbo.uwasa.fi:/pc/doc-soft/fpbiblio.txt and ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD.bib", 8125 acknowledgement = ack-nj # " and " # ack-nhfb, 8126 classcodes = "C5230 (Digital arithmetic methods)", 8127 corpsource = "Argonne Nat. Lab., IL, USA", 8128 descriptors = "Simulation; statistics; numeric calculation;", 8129 keywords = "comparison; digital arithmetic; error; error propagation; floating point summation methods; truncation", 8130 treatment = "T Theoretical or Mathematical", 8131 } 8132 8133 @Article{Khalil:1972:EBT, 8134 author = "Hatem M. Khalil", 8135 title = "The eigenproblem of block tridiagonal matrices", 8136 journal = j-CACM, 8137 volume = "15", 8138 number = "9", 8139 pages = "839--839", 8140 month = sep, 8141 year = "1972", 8142 CODEN = "CACMA2", 8143 ISSN = "0001-0782", 8144 MRclass = "839.65F15", 8145 MRnumber = "47 2802", 8146 bibdate = "Tue Mar 25 13:26:09 MST 1997", 8147 acknowledgement = ack-nhfb, 8148 classcodes = "B0290H (Linear algebra); C4140 (Linear algebra)", 8149 corpsource = "Univ. Delaware, Newark, DE, USA", 8150 keywords = "block tridiagonal matrices; eigenvalues; eigenvalues and eigenfunctions; eigenvalues and eigenvectors; eigenvectors; linear algebra; matrix algebra; partial differential equations", 8151 treatment = "T Theoretical or Mathematical", 8152 } 8153 8154 @Article{Parnas:1972:CDP, 8155 author = "D. L. Parnas and A. N. Habermann and R. C. Holt", 8156 title = "Comment on Deadlock Prevention Method", 8157 journal = j-CACM, 8158 volume = "15", 8159 number = "9", 8160 pages = "840--841", 8161 month = sep, 8162 year = "1972", 8163 CODEN = "CACMA2", 8164 ISSN = "0001-0782", 8165 bibdate = "Tue Mar 25 13:26:09 MST 1997", 8166 acknowledgement = ack-nhfb, 8167 classcodes = "C6150J (Operating systems)", 8168 corpsource = "Carnegie-Mellon Univ., Pittsburgh, PA, USA", 8169 keywords = "deadlock; deadlock prevention method; deadly embrace; interlock; knotting; lockout; multiprogramming; resource allocation; scheduling; time sharing; time-sharing; time-sharing systems", 8170 treatment = "G General Review; T Theoretical or Mathematical", 8171 } 8172 8173 @Article{Rubinstein:1972:CBT, 8174 author = "R. Rubinstein and J. Feldman", 8175 title = "A controller for a {Braille} terminal", 8176 journal = j-CACM, 8177 volume = "15", 8178 number = "9", 8179 pages = "841--842", 8180 month = sep, 8181 year = "1972", 8182 CODEN = "CACMA2", 8183 ISSN = "0001-0782", 8184 bibdate = "Tue Mar 25 13:26:09 MST 1997", 8185 acknowledgement = ack-nhfb, 8186 classcodes = "C5540 (Terminals and graphic displays); C5610 (Computer interfaces)", 8187 corpsource = "Univ. California, Irvine, CA, USA", 8188 keywords = "blind programming aid; braille; computer interfaces; computer peripheral equipment; computer terminal; controller; tactile terminal; terminal", 8189 treatment = "P Practical", 8190 } 8191 8192 @Article{Tan:1972:FIS, 8193 author = "K. C. Tan", 8194 title = "On {Foster}'s Information Storage and Retrieval Using {AVL} Trees", 8195 journal = j-CACM, 8196 volume = "15", 8197 number = "9", 8198 pages = "843--843", 8199 month = sep, 8200 year = "1972", 8201 CODEN = "CACMA2", 8202 ISSN = "0001-0782", 8203 bibdate = "Tue Mar 25 13:26:09 MST 1997", 8204 note = "See \cite{Foster:1972:VCA}.", 8205 acknowledgement = ack-nhfb, 8206 classcodes = "C6120 (File organisation)", 8207 corpsource = "Northwestern Univ., Evanston, IL, USA", 8208 keywords = "(mathematical); AVL trees; binary trees; file organisation; information retrieval; information storage; search trees; trees", 8209 treatment = "T Theoretical or Mathematical", 8210 xxnote = "Check cross-reference??", 8211 } 8212 8213 @Article{Dijkstra:1972:HP, 8214 author = "E. W. Dijkstra", 8215 title = "The Humble Programmer", 8216 journal = j-CACM, 8217 volume = "15", 8218 number = "10", 8219 pages = "859--866", 8220 month = oct, 8221 year = "1972", 8222 CODEN = "CACMA2", 8223 ISSN = "0001-0782", 8224 bibdate = "Sat Jan 18 14:08:21 1997", 8225 note = "1972 ACM Turing Award Lecture.", 8226 abstract = "We shall do a much better programming job, provided that we approach the task with a full appreciation if its tremendous difficulty, provided that we stick to modest and elegant programming languages, provided that we respect the intrinsic limitations of the human mind and approach the task as Very Humble Programmers.", 8227 } 8228 8229 @Article{Morris:1972:DPT, 8230 author = "James B. Morris", 8231 title = "Demand Paging Through Utilization of Working Sets on the {Maniac II}", 8232 journal = j-CACM, 8233 volume = "15", 8234 number = "10", 8235 pages = "867--872", 8236 month = oct, 8237 year = "1972", 8238 CODEN = "CACMA2", 8239 ISSN = "0001-0782", 8240 bibdate = "Tue Mar 25 13:26:09 MST 1997", 8241 bibsource = "Compendex database", 8242 abstract = "A hardware implementation on the Maniac II computer of the working set model for demand paging, as introduced by Denning, is discussed. characteristics of the Maniac II are given, along with a description of the basic demand paging scheme and the associative memory which has been added to the Maniac II hardware. A description of the hardware design for implementation of the working set model is discussed and a specification of the actions taken under various conditions which may arise during the operation of the full working set model, demand paging system is given.", 8243 acknowledgement = ack-nhfb, 8244 classcodes = "C5220 (Computer architecture); C6120 (File organisation)", 8245 classification = "723", 8246 corpsource = "Univ. California, Los Alamos, NM, USA", 8247 journalabr = "Commun ACM", 8248 keywords = "associative memory; associative storage; computer architecture; computer operating systems; data storage, digital; demand paging; dynamic storage allocation; file; hardware implementation; MANIAC II; model; organisation; storage allocation; storage management; utilization of working sets; virtual memory; working set", 8249 treatment = "T Theoretical or Mathematical", 8250 } 8251 8252 @Article{Ahrens:1972:CMS, 8253 author = "J. H. Ahrens and U. Dieter", 8254 title = "Computer Methods for Sampling from the Exponential and Normal Distributions", 8255 journal = j-CACM, 8256 volume = "15", 8257 number = "10", 8258 pages = "873--882", 8259 month = oct, 8260 year = "1972", 8261 CODEN = "CACMA2", 8262 ISSN = "0001-0782", 8263 MRclass = "65C10", 8264 MRnumber = "49 1728", 8265 mrreviewer = "V. Dupac", 8266 bibdate = "Tue Mar 25 13:26:09 MST 1997", 8267 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1972.bib", 8268 abstract = "Various methods are known for transforming uniformly distributed random numbers into exponentially and normally distributed quantities. The most efficient ones are compared, in terms of memory requirements and speed, with some new algorithms. A number of procedures convert Taylor series expansions directly into sampling steps, an approach which may be used for sampling from any continuous distribution. For the exponential distribution a definite recommendation can be made, whereas in the case of the normal distribution there remains a choice between slower and shorter algorithms and faster but space consuming methods.", 8269 acknowledgement = ack-nhfb, 8270 classcodes = "C7890 (Other special applications of computing)", 8271 classification = "913; 922", 8272 corpsource = "Nova Scotia Tech. Coll., Halifax, NS, Canada", 8273 country = "USA", 8274 descriptors = "RVG;", 8275 enum = "6926", 8276 journalabr = "Commun ACM", 8277 keywords = "computer aided sampling; computer methods; distributed random numbers; distributions; exponential; normal distributions; random number generation; sampled data systems; sampling; sampling steps; uniformly", 8278 language = "English", 8279 references = "0", 8280 treatment = "T Theoretical or Mathematical", 8281 } 8282 8283 @Article{Hanson:1972:IEI, 8284 author = "Richard J. Hanson", 8285 title = "Integral Equations of Immunology", 8286 journal = j-CACM, 8287 volume = "15", 8288 number = "10", 8289 pages = "883--890", 8290 month = oct, 8291 year = "1972", 8292 CODEN = "CACMA2", 8293 ISSN = "0001-0782", 8294 MRclass = "65R05", 8295 MRnumber = "48 10166", 8296 mrreviewer = "S. Malon", 8297 bibdate = "Tue Mar 25 13:26:09 MST 1997", 8298 bibsource = "Compendex database", 8299 abstract = "The inversion of a particular integral equation of the first (Fredholm) kind is the basic problem considered. The strategy which yielded success consisted of three essential points: (1) fit the known experimental data by a curve with properties which derive from properties of the (as yet unknown) function; (2) stabilize the computation for the unknown function by using singular value decomposition; (3) constrain the unknown function approximation (since it represents a probability distribution) to be nonnegative. \par A number of test cases are presented. One set of actual experimental data is analyzed with the procedures presented.", 8300 acknowledgement = ack-nhfb, 8301 classcodes = "B0290R (Integral equations); C4180 (Integral equations)", 8302 classification = "461; 921", 8303 corpsource = "California Inst. Technol., Pasadena, CA, USA", 8304 journalabr = "Commun ACM", 8305 keywords = "biomedical engineering; curve fitting; decomposition; experimental data; first kind; immunology; integral equation of; integral equations; integral equations of the first kind; inversion; mathematical techniques; medicine; nonnegative constraints; numerical methods; singular value; singular value analysis", 8306 treatment = "T Theoretical or Mathematical", 8307 } 8308 8309 @Article{Simmons:1972:GED, 8310 author = "Robert F. Simmons and Jonathan Slocum", 8311 title = "Generating {English} Discourse from Semantic Networks", 8312 journal = j-CACM, 8313 volume = "15", 8314 number = "10", 8315 pages = "891--905", 8316 month = oct, 8317 year = "1972", 8318 CODEN = "CACMA2", 8319 ISSN = "0001-0782", 8320 bibdate = "Tue Mar 25 13:26:09 MST 1997", 8321 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Ai/lisp.bib", 8322 abstract = "A system is described for generating English sentences from a form of semantic nets in which the nodes are word-sense meanings and the paths are primarily deep case relations. The grammar used by the system is in the form of a network that imposes an ordering on a set of syntactic transformations that are expressed as LISP functions. The generation algorithm uses the information in the semantic network to select appropriate generation paths through the grammar. The system is designed for use as a computational tool that allows a linguist to develop and study methods for generating surface strings from an underlying semantic structure. Initial findings with regard to form determiners such as voice, form, tense, and mood, some rules for embedding sentences, and some attention to pronominal substitution are reported. The system is programmed in LISP 1.5 and is available from the authors.", 8323 acknowledgement = ack-nhfb, 8324 classcodes = "C7820 (Humanities computing)", 8325 classification = "721; 723; 901", 8326 corpsource = "Univ. Texas, Austin, TX, USA", 8327 journalabr = "Commun ACM", 8328 keywords = "automata theory; computer applications; computer programming languages --- lisp; data processing --- Humanities Applications; deep case relations; English sentence generation; information science --- Language Translation and Linguistics; language translation and linguistics; LISP functions; semantic generation; semantic networks", 8329 treatment = "P Practical", 8330 } 8331 8332 @Article{Dathe:1972:CDT, 8333 author = "Gert Dathe", 8334 title = "Conversion of Decision Tables by Rule Mask Method without Rule Mask", 8335 journal = j-CACM, 8336 volume = "15", 8337 number = "10", 8338 pages = "906--909", 8339 month = oct, 8340 year = "1972", 8341 CODEN = "CACMA2", 8342 ISSN = "0001-0782", 8343 bibdate = "Tue Mar 25 13:26:09 MST 1997", 8344 bibsource = "Compendex database", 8345 abstract = "Two algorithms for generating computer programs from decision tables are described. The algorithms allow handling limited entry, extended entry, and mixed entry tables. The algorithms are based on the rule mask method but need not have the masks at execution time. They perform the logical operations immediately rather than at the end of the interpreting process. Execution time can be considerably reduced by instantly marking rules which are not applicable or conditions which are already tested. The new algorithms combine to a certain degree the advantages of mask methods with those of tree methods.", 8346 acknowledgement = ack-nhfb, 8347 classcodes = "C6110 (Systems analysis and programming); C6150C (Compilers, interpreters and other processors)", 8348 classification = "723", 8349 corpsource = "Software AG, Darmstadt, West Germany", 8350 journalabr = "Commun ACM", 8351 keywords = "computer programming; conversion; decision tables; mask; program generation; program processors; rule mask method without rule", 8352 treatment = "T Theoretical or Mathematical", 8353 } 8354 8355 @Article{Frazer:1972:SNS, 8356 author = "W. D. Frazer and C. K. Wong", 8357 title = "Sorting by Natural Selection", 8358 journal = j-CACM, 8359 volume = "15", 8360 number = "10", 8361 pages = "910--913", 8362 month = oct, 8363 year = "1972", 8364 CODEN = "CACMA2", 8365 ISSN = "0001-0782", 8366 bibdate = "Tue Mar 25 13:26:09 MST 1997", 8367 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Database/Graefe.bib", 8368 abstract = "A family of sorting algorithms is proposed, the members of which make fuller use of the memory space and thus yield longer sorted strings. Extensive simulation results are presented, and various implications and further applications are discussed.", 8369 acknowledgement = ack-nhfb, 8370 classcodes = "C6130 (Data handling techniques)", 8371 classification = "723", 8372 corpsource = "IBM Thomas J.Watson Res. Center, Yorktown Heights, NY, USA", 8373 journalabr = "Commun ACM", 8374 keywords = "CACM; computer programming --- Subroutines; computer systems programming; natural selection; sorting", 8375 treatment = "T Theoretical or Mathematical", 8376 } 8377 8378 @Article{Ershov:1972:CAH, 8379 author = "A. P. Ershov", 8380 title = "Corrigendum: {``Aesthetics and the Human Factor in Programming''}", 8381 journal = j-CACM, 8382 volume = "15", 8383 number = "10", 8384 pages = "913--913", 8385 month = oct, 8386 year = "1972", 8387 CODEN = "CACMA2", 8388 ISSN = "0001-0782", 8389 bibdate = "Sat Jan 18 14:08:57 1997", 8390 note = "See \cite{Ershov:1972:AHF}.", 8391 } 8392 8393 @Article{Akima:1972:AAI, 8394 author = "H. Akima", 8395 title = "{ACM} Algorithm 433: Interpolation and Smooth Curve Fitting Based on Local Procedures", 8396 journal = j-CACM, 8397 volume = "15", 8398 number = "10", 8399 pages = "914--918", 8400 month = oct, 8401 year = "1972", 8402 CODEN = "CACMA2", 8403 ISSN = "0001-0782", 8404 bibdate = "Thu Sep 08 09:47:55 1994", 8405 note = "See also \cite{Anderson:1976:RIS}.", 8406 } 8407 8408 @Article{Fox:1972:CSC, 8409 author = "Phyllis Fox", 8410 title = "Comparative Study of Computer Programs for Integrating Differential Equations", 8411 journal = j-CACM, 8412 volume = "15", 8413 number = "11", 8414 pages = "941--948", 8415 month = nov, 8416 year = "1972", 8417 CODEN = "CACMA2", 8418 ISSN = "0001-0782", 8419 bibdate = "Tue Mar 25 13:26:09 MST 1997", 8420 bibsource = "Compendex database", 8421 abstract = "The integration methods represented include multistep methods (predictor-correctors), single-step methods (Runge-Kutta) and extrapolation methods (both polynomial and rational). The testing procedure is described together with the evaluation criteria applied. A set of test problems on which the programs were tested is included in appendix. For the particular problems and criteria used in the investigation it was found that a program based on rational extrapolation showed the best performance.", 8422 acknowledgement = ack-nhfb, 8423 classcodes = "B0290P (Differential equations); C4170 (Differential equations)", 8424 classification = "723; 921", 8425 corpsource = "Newark Coll. Engng., NJ, USA", 8426 journalabr = "Commun ACM", 8427 keywords = "comparative study; computer programming; computer programs; differential; differential equations; equations; extrapolation methods; integration methods; mathematical techniques --- Differential Equations; mathematical techniques --- Integration; predictor-corrector methods", 8428 treatment = "T Theoretical or Mathematical", 8429 } 8430 8431 @Article{Malcolm:1972:ARP, 8432 author = "Michael A. Malcolm", 8433 title = "Algorithms to Reveal Properties of Floating-Point Arithmetic", 8434 journal = j-CACM, 8435 volume = "15", 8436 number = "11", 8437 pages = "949--951", 8438 month = nov, 8439 year = "1972", 8440 CODEN = "CACMA2", 8441 ISSN = "0001-0782", 8442 bibdate = "Tue Mar 25 13:26:09 MST 1997", 8443 bibsource = "Compendex database", 8444 note = "See also \cite{Gentleman:1974:MAR}.", 8445 abstract = "Two algorithms are presented in the form of Fortran subroutines. Each subroutine computes the radix and number of digits of the floating-point numbers and whether rounding or chopping is done by the machine on which it is run. The methods are shown to work on any ``reasonable'' floating-point computer.", 8446 acknowledgement = ack-nhfb, 8447 classcodes = "C5230 (Digital arithmetic methods)", 8448 classification = "723", 8449 corpsource = "Stanford Univ., CA, USA", 8450 journalabr = "Commun ACM", 8451 keywords = "chopping; computer programming; computer programming languages --- Fortran; digital arithmetic; digits; floating point arithmetic; Fortran subroutines; mathematical techniques --- Digital Arithmetic; number of; properties; radix; rounding", 8452 treatment = "T Theoretical or Mathematical", 8453 } 8454 8455 @Article{Patrick:1972:HPA, 8456 author = "Merrell L. Patrick", 8457 title = "A Highly Parallel Algorithm for Approximating All Zeros of a Polynomial with Only Real Zeros", 8458 journal = j-CACM, 8459 volume = "15", 8460 number = "11", 8461 pages = "952--955", 8462 month = nov, 8463 year = "1972", 8464 CODEN = "CACMA2", 8465 ISSN = "0001-0782", 8466 MRclass = "65H05", 8467 MRnumber = "48 1455", 8468 bibdate = "Tue Mar 25 13:26:09 MST 1997", 8469 bibsource = "Compendex database", 8470 abstract = "An algorithm is described based on Newton's method which simultaneously approximates all zeros of a polynomial with only real zeros. The algorithm, which is conceptually suitable for parallel computation, determines its own starting values so that convergence to the zeros is guaranteed. Multiple zeros and their multiplicity are readily determined. At no point in the method is polynomial deflation used.", 8471 acknowledgement = ack-nhfb, 8472 classcodes = "B0290F (Interpolation and function approximation); C4130 (Interpolation and function approximation)", 8473 classification = "723; 921", 8474 corpsource = "Duke Univ., Durham, NC, USA", 8475 journalabr = "Commun ACM", 8476 keywords = "approximation with real zeros; computer programming; function approximation; guaranteed convergence; highly; mathematical techniques --- Poles and Zeros; mathematical techniques --- Polynomials; multiple zeros; Newton's method; parallel algorithm; parallel numerical algorithms; poles and zeros; polynomial zeros; polynomials; real polynomials; real zeros; starting values", 8477 treatment = "T Theoretical or Mathematical", 8478 } 8479 8480 @Article{Ledgard:1972:MTC, 8481 author = "Henry F. Ledgard", 8482 title = "Model for Type Checking --- with an Application to {Algol 60}", 8483 journal = j-CACM, 8484 volume = "15", 8485 number = "11", 8486 pages = "956--966", 8487 month = nov, 8488 year = "1972", 8489 CODEN = "CACMA2", 8490 ISSN = "0001-0782", 8491 bibdate = "Tue Mar 25 13:26:09 MST 1997", 8492 bibsource = "Compendex database", 8493 abstract = "This paper attempts to isolate the notion of type checking and presents a partial solution to the type checking problem based on the notions of abstraction and application of functions. A program is mapped into an expression within a decidable subset of the lambda-calculus, which characterizes the type relations within the program and eliminates all other information. The determination of the type-wise correctness or incorrectness of the program is resolved by reducing its corresponding lambda-calculus expression to one of two normal forms, the constant ``correct'' for a type-wise correct program or the constant ``error.'' An application to type checking in Algol 60 is made, and the attendant problems faced for any notion of type checking are discussed.", 8494 acknowledgement = ack-nhfb, 8495 classcodes = "C6150C (Compilers, interpreters and other processors)", 8496 classification = "723", 8497 corpsource = "Johns Hopkins Univ., Baltimore, MD, USA", 8498 journalabr = "Commun ACM", 8499 keywords = "abstraction; ALGOL; ALGOL 60; application of functions; compilation; computer programming languages; execution; lambda calculus; model; program compilers; type checking", 8500 treatment = "T Theoretical or Mathematical", 8501 } 8502 8503 @Article{Henderson:1972:DSS, 8504 author = "Peter Henderson", 8505 title = "Derived Semantics for Some Programming Language Constructs", 8506 journal = j-CACM, 8507 volume = "15", 8508 number = "11", 8509 pages = "967--973", 8510 month = nov, 8511 year = "1972", 8512 CODEN = "CACMA2", 8513 ISSN = "0001-0782", 8514 bibdate = "Tue Mar 25 13:26:09 MST 1997", 8515 bibsource = "Compendex database", 8516 abstract = "The constructs of a simple programming language are introduced and described informally in terms of values and side-effects. a translator is defined which translates the language into flowcharts for a simple machine. The action of the machine in executing a flowchart is defined. A proof is constructed that the effect of translating and executing any program can be expressed solely in terms of the value and side-effect of the program. during the course of constructing the proof, formal definitions of the concepts of value and side-effect are derived in order to make the proof rigorous. Correctness of the implementation involves checking that the definitions derived in the step above are an acceptable formalization of the informal description given in the first step.", 8517 acknowledgement = ack-nhfb, 8518 classcodes = "C4240 (Programming and algorithm theory)", 8519 classification = "723", 8520 corpsource = "Univ. Newcastle upon Tyne, UK", 8521 journalabr = "Commun ACM", 8522 keywords = "computer programming languages; constructs; derived semantics; flowcharts; lambda calculus; programming language; programming theory; side effects; translator; values", 8523 treatment = "T Theoretical or Mathematical", 8524 } 8525 8526 @Article{Verhelst:1972:CLD, 8527 author = "M. Verhelst", 8528 title = "Conversion of Limited-Entry Decision Tables to Optimal and Near-Optimal Flowcharts: Two New Algorithms", 8529 journal = j-CACM, 8530 volume = "15", 8531 number = "11", 8532 pages = "974--980", 8533 month = nov, 8534 year = "1972", 8535 CODEN = "CACMA2", 8536 ISSN = "0001-0782", 8537 bibdate = "Tue Mar 25 13:26:09 MST 1997", 8538 bibsource = "Compendex database", 8539 abstract = "The algorithms are first derived for treating decision tables not containing an ELSE-rule, but the optimum-approaching algorithm is shown to be equally valid for tables including such a rule. Both algorithms are compared with existing ones and are applied to a somewhat large decision table derived from a real case.", 8540 acknowledgement = ack-nhfb, 8541 classcodes = "C6110 (Systems analysis and programming)", 8542 classification = "723", 8543 corpsource = "Univ. Louvain, Belgium", 8544 journalabr = "Commun ACM", 8545 keywords = "algorithm; computer programming --- Subroutines; computer programming languages; conversion; decision tables; flowcharting; limited entry decision tables; minimum execution time; near; optimal flowcharts; optimisation; optimum approaching algorithm; optimum finding", 8546 treatment = "T Theoretical or Mathematical", 8547 } 8548 8549 @Article{Baecker:1972:GCV, 8550 author = "H. D. Baecker", 8551 title = "Garbage Collection for Virtual Memory Computer Systems", 8552 journal = j-CACM, 8553 volume = "15", 8554 number = "11", 8555 pages = "981--986", 8556 month = nov, 8557 year = "1972", 8558 CODEN = "CACMA2", 8559 ISSN = "0001-0782", 8560 bibdate = "Tue Mar 25 13:26:09 MST 1997", 8561 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Compiler/garbage.collection.bib", 8562 abstract = "In list processing there is typically a growing demand for space during program execution. This paper examines the practical implications of this growth within a virtual memory computer system, proposes two new garbage collection techniques for virtual memory systems, and compares them with traditional methods by discussion and by simulation.", 8563 acknowledgement = ack-nhfb, 8564 classcodes = "C6120 (File organisation)", 8565 classification = "723", 8566 corpsource = "Univ. Calgary, Alta., Canada", 8567 journalabr = "Commun ACM", 8568 keywords = "computer operating systems --- Storage Allocation; computer programming languages; data storage, digital; file organisation; garbage collection; list; paging; processing; segmentation; storage allocation; storage management; virtual memory; virtual memory computer systems", 8569 treatment = "P Practical", 8570 } 8571 8572 @Article{Ramberg:1972:AMG, 8573 author = "John S. Ramberg and Bruce W. Schmeiser", 8574 title = "Approximate Method for Generating Symmetric Random Variables", 8575 journal = j-CACM, 8576 volume = "15", 8577 number = "11", 8578 pages = "987--990", 8579 month = nov, 8580 year = "1972", 8581 CODEN = "CACMA2", 8582 ISSN = "0001-0782", 8583 bibdate = "Tue Mar 25 13:26:09 MST 1997", 8584 bibsource = "Compendex database", 8585 abstract = "A method for generating values of continuous symmetric random variables that is relatively fast, requires essentially no computer memory, and is easy to use is developed. The method, which uses a uniform zero-one random number source, is based on the inverse function of the lambda distribution of Tukey. Since it approximates many of the continuous theoretical distributions and empirical distributions frequently used in simulations, the method should be useful to simulation practitioners.", 8586 acknowledgement = ack-nhfb, 8587 classcodes = "C7890 (Other special applications of computing)", 8588 classification = "922", 8589 corpsource = "Univ. Iowa, Iowa City, IA, USA", 8590 journalabr = "Commun ACM", 8591 keywords = "approximate method; inverse function; lambda distribution of Tukey; mathematical models; mathematical statistics; random number generation; random number source; simulation; symmetric random variable generation; uniform zero one", 8592 treatment = "T Theoretical or Mathematical", 8593 } 8594 8595 @Article{March:1972:AAE, 8596 author = "D. L. March", 8597 title = "{ACM} Algorithm 434: Exact Probabilities for ${R\times{C}}$ Contingency Tables", 8598 journal = j-CACM, 8599 volume = "15", 8600 number = "11", 8601 pages = "991--992", 8602 month = nov, 8603 year = "1972", 8604 CODEN = "CACMA2", 8605 ISSN = "0001-0782", 8606 bibdate = "Tue Sep 20 19:26:04 1994", 8607 note = "See also \cite{Boulton:1976:REP}.", 8608 } 8609 8610 @Article{Fullerton:1972:AAM, 8611 author = "W. Fullerton", 8612 title = "{ACM} Algorithm 435: Modified Incomplete Gamma Function", 8613 journal = j-CACM, 8614 volume = "15", 8615 number = "11", 8616 pages = "993--995", 8617 month = nov, 8618 year = "1972", 8619 CODEN = "CACMA2", 8620 ISSN = "0001-0782", 8621 bibdate = "Thu Sep 08 09:47:55 1994", 8622 note = "See also \cite{Schoene:1978:RMI}.", 8623 } 8624 8625 @Article{Lum:1972:ARK, 8626 author = "V. Y. Lum and P. S. T. Yuen", 8627 title = "Additional results on key-to-address transform techniques: a fundamental performance study on large existing formatted files", 8628 journal = j-CACM, 8629 volume = "15", 8630 number = "11", 8631 pages = "996--997", 8632 month = nov, 8633 year = "1972", 8634 CODEN = "CACMA2", 8635 ISSN = "0001-0782", 8636 bibdate = "Tue Mar 25 13:26:09 MST 1997", 8637 acknowledgement = ack-nhfb, 8638 classcodes = "C6120 (File organisation)", 8639 corpsource = "IBM Res. Lab., San Jose, CA, USA", 8640 keywords = "file; file organisation; fundamental performance; hash coding; key to address transform techniques; large existing formatted files; organization; study", 8641 treatment = "P Practical", 8642 } 8643 8644 @Article{Kennedy:1972:NOD, 8645 author = "S. Kennedy", 8646 title = "A note on optimal doubly-chained trees", 8647 journal = j-CACM, 8648 volume = "15", 8649 number = "11", 8650 pages = "997--998", 8651 month = nov, 8652 year = "1972", 8653 CODEN = "CACMA2", 8654 ISSN = "0001-0782", 8655 bibdate = "Tue Mar 25 13:26:09 MST 1997", 8656 acknowledgement = ack-nhfb, 8657 classcodes = "C6120 (File organisation)", 8658 corpsource = "California Inst. Technol., Pasadena, CA, USA", 8659 keywords = "binary search; file organisation; file searching; optimal doubly chained trees; tree; trees (mathematical)", 8660 treatment = "T Theoretical or Mathematical", 8661 } 8662 8663 @Article{Eisenberg:1972:FCD, 8664 author = "Murray A. Eisenberg and Michael R. McGuire", 8665 title = "Further comments on {Dijkstra}'s concurrent programming control problem", 8666 journal = j-CACM, 8667 volume = "15", 8668 number = "11", 8669 pages = "999--999", 8670 month = nov, 8671 year = "1972", 8672 CODEN = "CACMA2", 8673 ISSN = "0001-0782", 8674 bibdate = "Tue Mar 25 13:26:09 MST 1997", 8675 bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib", 8676 acknowledgement = ack-nhfb, 8677 classcodes = "C6150J (Operating systems)", 8678 keywords = "critical; Dijkstra's concurrent programming control problem; multiprocessing; multiprocessing programs; section", 8679 treatment = "T Theoretical or Mathematical", 8680 xxtitle = "Further Comments on {Dijkstra}'s Concurrent Programming Control Problems", 8681 } 8682 8683 @Article{Smoliar:1972:CMM, 8684 author = "S. W. Smoliar", 8685 title = "Comments on {Moorer's Music} and computer composition", 8686 journal = j-CACM, 8687 volume = "15", 8688 number = "11", 8689 pages = "1000--1001", 8690 month = nov, 8691 year = "1972", 8692 CODEN = "CACMA2", 8693 ISSN = "0001-0782", 8694 bibdate = "Tue Mar 25 13:26:09 MST 1997", 8695 acknowledgement = ack-nhfb, 8696 classcodes = "C7820 (Humanities computing)", 8697 corpsource = "Tech. Israel Inst. Technol., Haifa, Israel", 8698 keywords = "artificial intelligence; computer composition; computer music; heuristic; humanities; programming", 8699 treatment = "P Practical", 8700 } 8701 8702 @Article{Phillips:1972:DPA, 8703 author = "J. Richard Phillips and H. C. Adams", 8704 title = "Dynamic Partitioning for Array Languages", 8705 journal = j-CACM, 8706 volume = "15", 8707 number = "12", 8708 pages = "1023--1032", 8709 month = dec, 8710 year = "1972", 8711 CODEN = "CACMA2", 8712 ISSN = "0001-0782", 8713 bibdate = "Tue Mar 25 13:26:09 MST 1997", 8714 bibsource = "Compendex database", 8715 abstract = "The classical process of partitioning an array into subarrays is extended to a more useful array language operation. Various modes of partitioning are defined for different types of arrays, so that subarrays may vary over the original array in a nearly arbitrary manner. These definitions are motivated with several realistic examples to illustrate the value of partitioning for array languages. Of general interest is the data structure for partitioning. This consists of dynamic tree structures which are used to derive and maintain the array control information. These are described in sufficient detail to be of value in the design of other array languages. The description presented in this paper is implemented in a new array language, OL/2, currently under development at the University of Illinois.", 8716 acknowledgement = ack-nhfb, 8717 classcodes = "C6120 (File organisation); C6140D (High level languages)", 8718 classification = "723", 8719 corpsource = "Univ. Illinois, Urbana-Champaign, IL, USA", 8720 journalabr = "Commun ACM", 8721 keywords = "array languages; array partitioning; computer programming languages; data processing --- Data Structures; data structure; data structures; dynamic partitioning; dynamic tree structures; OL/2; programming languages", 8722 treatment = "T Theoretical or Mathematical", 8723 } 8724 8725 @Article{Bayer:1972:IRM, 8726 author = "R. Bayer and C. Witzgall", 8727 title = "Index Ranges for Matrix Calculi", 8728 journal = j-CACM, 8729 volume = "15", 8730 number = "12", 8731 pages = "1033--1039", 8732 month = dec, 8733 year = "1972", 8734 CODEN = "CACMA2", 8735 ISSN = "0001-0782", 8736 bibdate = "Tue Mar 25 13:26:09 MST 1997", 8737 bibsource = "Compendex database", 8738 abstract = "The paper describes a scheme for symbolic manipulation of index expressions which arise as a by-product of the symbolic manipulation of expressions in the matrix calculi described by the authors in a previous paper. This scheme attempts program optimization by transforming the original algorithm rather than the machine code. The goal is to automatically generate code for handling the tedious address calculations necessitated by complicated data structures. The paper is therefore preoccupied with ``indexing by position.'' The relationship of ``indexing by name'' and ``indexing by position'' is discussed.", 8739 acknowledgement = ack-nhfb, 8740 classcodes = "C6130 (Data handling techniques)", 8741 classification = "723", 8742 corpsource = "Boeing Sci. Res. Labs., Seattle, WA, USA", 8743 journalabr = "Commun ACM", 8744 keywords = "address calculations; algorithm; computer programming languages; data handling; data processing; data structures; expressions; index; index ranges; indexing by name; indexing by position; matrix algebra; matrix calculi; program optimization; symbolic manipulation; transformation", 8745 treatment = "T Theoretical or Mathematical", 8746 } 8747 8748 @Article{Earley:1972:MIC, 8749 author = "Jay Earley and Paul Caizergues", 8750 title = "Method for Incrementally Compiling Languages with Nested Statement Structure", 8751 journal = j-CACM, 8752 volume = "15", 8753 number = "12", 8754 pages = "1040--1044", 8755 month = dec, 8756 year = "1972", 8757 CODEN = "CACMA2", 8758 ISSN = "0001-0782", 8759 bibdate = "Tue Mar 25 13:26:09 MST 1997", 8760 bibsource = "Compendex database", 8761 abstract = "The method permits editing of the source language using a general purpose text editor, and incremental processing of changes without frequent recompilation of entire routines. The essential points of the method are: the syntax of the language is restricted insofar as which constructs may occur on lines; an internal data structure (called the skeleton) is maintained to represent the statement structure; the recompilation is partially batched in the sense that recompilation of modified lines does not occur until the last of a set of editing commands has been received; and the parsing and compilation are factored into two parts, that done on individual lines and that done globally to handle the relationships between the lines.", 8762 acknowledgement = ack-nhfb, 8763 classcodes = "C6150C (Compilers, interpreters and other processors)", 8764 classification = "723", 8765 corpsource = "Univ. California, Berkeley, CA, USA", 8766 journalabr = "Commun ACM", 8767 keywords = "ALGOL; computer operating systems --- Program Compilers; computer programming languages; data processing --- Data Structures; editor; general purpose text; incremental compilation; nested statement structure; PL/I; program compilers; programming languages; source language", 8768 treatment = "T Theoretical or Mathematical", 8769 } 8770 8771 @Article{Luccio:1972:WIL, 8772 author = "Fabrizio Luccio", 8773 title = "Weighted Increment Linear Search for Scatter Tables", 8774 journal = j-CACM, 8775 volume = "15", 8776 number = "12", 8777 pages = "1045--1047", 8778 month = dec, 8779 year = "1972", 8780 CODEN = "CACMA2", 8781 ISSN = "0001-0782", 8782 bibdate = "Tue Mar 25 13:26:09 MST 1997", 8783 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib", 8784 abstract = "A new linear search for hash tables whose increment step is a function of the key being addressed is presented. Comparisons with known methods are given, in terms of efficiency and computation complexity. In particular, the new method applies to tables of size n equals 2**r. It allows full table searching, and practically eliminates primary clustering at a very low cost.", 8785 acknowledgement = ack-nhfb, 8786 classcodes = "C6130 (Data handling techniques)", 8787 classification = "723", 8788 corpsource = "Univ. Pisa, Italy", 8789 journalabr = "Commun ACM", 8790 keywords = "clustering; computer programming; hash; information retrieval systems; information searching techniques; scatter tables; table lookup; tables; weighted increment linear search", 8791 treatment = "T Theoretical or Mathematical", 8792 } 8793 8794 @Article{Barr:1972:CMN, 8795 author = "D. R. Barr and N. L. Slezak", 8796 title = "A comparison of multivariate normal generators", 8797 journal = j-CACM, 8798 volume = "15", 8799 number = "12", 8800 pages = "1048--1049", 8801 month = dec, 8802 year = "1972", 8803 CODEN = "CACMA2", 8804 ISSN = "0001-0782", 8805 bibdate = "Tue Mar 25 13:26:09 MST 1997", 8806 acknowledgement = ack-nhfb, 8807 classcodes = "C7890 (Other special applications of computing)", 8808 corpsource = "Naval Postgraduate School, Monterey, CA, USA", 8809 keywords = "comparison; covariance matrix; Gaussian random number generator; multivariate; multivariate normal generators; normal random vectors; random number generation; simulation; triangular factorization", 8810 treatment = "T Theoretical or Mathematical", 8811 } 8812 8813 @Article{Moore:1972:NMS, 8814 author = "John Moore and Prentiss Robinson", 8815 title = "New Method for the Solution of the {Cauchy} Problem for Parabolic Equations", 8816 journal = j-CACM, 8817 volume = "15", 8818 number = "12", 8819 pages = "1050--1052", 8820 month = dec, 8821 year = "1972", 8822 CODEN = "CACMA2", 8823 ISSN = "0001-0782", 8824 bibdate = "Tue Mar 25 13:26:09 MST 1997", 8825 bibsource = "Compendex database", 8826 abstract = "An integral equation representation is given for parabolic partial differential equations. When the equations are defined in unbounded domains, as in the initial value (Cauchy) problem, the solution of the integral equation by the method of successive approximation has inherent advantages over other methods. Error bounds for the method are of order h**3**/**2 and h**7**/**2 (h is the increment size) depending on the finite difference approximations involved.", 8827 acknowledgement = ack-nhfb, 8828 classcodes = "B0290P (Differential equations); C4170 (Differential equations)", 8829 classification = "921", 8830 corpsource = "Univ. Newcastle, UK", 8831 journalabr = "Commun ACM", 8832 keywords = "Cauchy problem; initial value problem; integral equation representation; mathematical techniques; parabolic; partial differential equations; successive approximation", 8833 treatment = "T Theoretical or Mathematical", 8834 } 8835 8836 @Article{Parnas:1972:CBU, 8837 author = "D. L. Parnas", 8838 title = "On the Criteria to Be Used in Decomposing Systems into Modules", 8839 journal = j-CACM, 8840 volume = "15", 8841 number = "12", 8842 pages = "1053--1058", 8843 month = dec, 8844 year = "1972", 8845 CODEN = "CACMA2", 8846 ISSN = "0001-0782", 8847 bibdate = "Tue Mar 25 13:26:09 MST 1997", 8848 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Misc/softeng.bib", 8849 abstract = "This paper discusses modularization as a mechanism for improving the flexibility and comprehensibility of a system while allowing the shortening of its development time. The effectiveness of a ``modularization'' is dependent upon the criteria used in dividing the system into modules. A system design problem presented and both a conventional and unconventional decomposition are described. It is shown that the unconventional decompositions have distinct advantages for the goals outlined. The criteria used in arriving at the decompositions are discussed. The unconventional decomposition, if implemented with the conventional assumption that a module consists of one or more subroutines, will be less efficient in most cases. An alternative approach to implementation which does not this effect is sketched.", 8850 acknowledgement = ack-nhfb, 8851 classcodes = "C6110 (Systems analysis and programming)", 8852 classification = "723", 8853 corpsource = "Carnegie-Mellon Univ., Pittsburgh, PA, USA", 8854 journalabr = "Commun ACM", 8855 keywords = "comprehensibility; computer programming; criteria; decomposition; flexibility; modularization; modules; programming; software engineering; systems", 8856 treatment = "T Theoretical or Mathematical", 8857 } 8858 8859 @Article{Brown:1972:LLP, 8860 author = "P. J. Brown", 8861 title = "Levels of Language for Portable Software", 8862 journal = j-CACM, 8863 volume = "15", 8864 number = "12", 8865 pages = "1059--1062", 8866 month = dec, 8867 year = "1972", 8868 CODEN = "CACMA2", 8869 ISSN = "0001-0782", 8870 bibdate = "Tue Mar 25 13:26:09 MST 1997", 8871 bibsource = "Compendex database", 8872 abstract = "An increasing amount of software is being implemented in a portable form. A popular way of accomplishing this is to encode the software in a specially designed machine-independent language and then to map this language, often using a macro processor, into the assembly language of each desired object machine. The design of the machine-independent language is the key factor in this operation. This paper discusses the relative merits of pitching this language at a high level or a low level, and presents some comparative results.", 8873 acknowledgement = ack-nhfb, 8874 classcodes = "C6140D (High level languages)", 8875 classification = "723", 8876 corpsource = "Univ. Kent, Canterbury, UK", 8877 journalabr = "Commun ACM", 8878 keywords = "assembly language; computer programming; levels of language; machine independent language; macro processor; portable software; procedure oriented languages", 8879 treatment = "T Theoretical or Mathematical", 8880 } 8881 8882 @Article{Sherman:1972:TMA, 8883 author = "Stephen Sherman and Forest {Baskett, III} and J. C. Browne", 8884 title = "Trace-Driven Modeling and Analysis of {CPU} Scheduling in a Multiprogramming System", 8885 journal = j-CACM, 8886 volume = "15", 8887 number = "12", 8888 pages = "1063--1069", 8889 month = dec, 8890 year = "1972", 8891 CODEN = "CACMA2", 8892 ISSN = "0001-0782", 8893 bibdate = "Tue Mar 25 13:26:09 MST 1997", 8894 bibsource = "Compendex database", 8895 abstract = "The scheduling methods tested included the best possible and worst possible methods, the traditional methods of multiprogramming theory, round-robin, first-come-first-served, and dynamic predictors. The relative and absolute performances of these scheduling methods are given. It is concluded that a successful CPU scheduling method must be preemptive and must prevent a given job from holding the CPU for too long a period.", 8896 acknowledgement = ack-nhfb, 8897 classcodes = "C6150J (Operating systems)", 8898 classification = "723", 8899 corpsource = "Univ. Texas, Austin, TX, USA", 8900 journalabr = "Commun ACM", 8901 keywords = "analysis; computer systems programming; CPU scheduling; first come first served; microscopic level job stream data; modelling; multiprogramming; multiprogramming system; round robin; trace driven modelling", 8902 treatment = "T Theoretical or Mathematical", 8903 } 8904 8905 @Article{Boland:1972:AAPa, 8906 author = "W. R. Boland", 8907 title = "{ACM} Algorithm 436: Product Type Trapezoidal Integration", 8908 journal = j-CACM, 8909 volume = "15", 8910 number = "12", 8911 pages = "1070--1070", 8912 month = dec, 8913 year = "1972", 8914 CODEN = "CACMA2", 8915 ISSN = "0001-0782", 8916 bibdate = "Thu Sep 08 09:34:00 1994", 8917 } 8918 8919 @Article{Boland:1972:AAPb, 8920 author = "W. R. Boland", 8921 title = "{ACM} Algorithm 437: Product Type {Simpson}'s Integration", 8922 journal = j-CACM, 8923 volume = "15", 8924 number = "12", 8925 pages = "1070--1071", 8926 month = dec, 8927 year = "1972", 8928 CODEN = "CACMA2", 8929 ISSN = "0001-0782", 8930 bibdate = "Thu Sep 08 09:33:59 1994", 8931 } 8932 8933 @Article{Boland:1972:AAPc, 8934 author = "W. R. Boland", 8935 title = "{ACM} Algorithm 439: Product Type Three-point {Gauss-Legendre-Simpson}'s Integration", 8936 journal = j-CACM, 8937 volume = "15", 8938 number = "12", 8939 pages = "1072", 8940 month = dec, 8941 year = "1972", 8942 CODEN = "CACMA2", 8943 ISSN = "0001-0782", 8944 bibdate = "Thu Sep 08 09:34:00 1994", 8945 } 8946 8947 @Article{Denning:1973:CWM, 8948 author = "Peter J. Denning and Stuart C. Schwartz", 8949 title = "Corrigendum: ``{Properties of the working-set model}''", 8950 journal = j-CACM, 8951 volume = "15", 8952 number = "2", 8953 pages = "191--198", 8954 month = feb, 8955 year = "1973", 8956 CODEN = "CACMA2", 8957 ISSN = "0001-0782", 8958 bibdate = "Tue May 28 11:37:15 1996", 8959 note = "See \cite{Denning:1972:PWS}.", 8960 } 8961 8962 @Article{Shedler:1973:QMM, 8963 author = "G. S. Shedler", 8964 title = "A Queuing Model of a Multiprogrammed Computer with a Two-Level Storage System", 8965 journal = j-CACM, 8966 volume = "16", 8967 number = "1", 8968 pages = "3--10", 8969 month = jan, 8970 year = "1973", 8971 CODEN = "CACMA2", 8972 ISSN = "0001-0782", 8973 MRclass = "68A50", 8974 MRnumber = "51 14680", 8975 mrreviewer = "K. Vairaran", 8976 bibdate = "Tue Mar 25 13:26:09 MST 1997", 8977 bibsource = "Compendex database", 8978 abstract = "The results are presented of an analysis of a probabilistic model of a multiprogrammed computer system with a two-level storage system in which there is sequential dependency of accesses between the devices. Expressions are obtained for the long-run probability that both the CPU and each of the storage devices are busy. Some numerical results are given which quantify the gains in CPU utilization obtainable by multiprogramming in the presence of this type of storage system.", 8979 acknowledgement = ack-nhfb, 8980 classcodes = "C4290 (Other computer theory)", 8981 classification = "723; 922", 8982 corpsource = "IBM, San Jose, CA, USA", 8983 journalabr = "Commun ACM", 8984 keywords = "computer systems programming --- Multiprogramming; data storage, digital; dependency of accesses; hierarchical index ses; hierarchical index sets; modelling; multiprogrammed computer; multiprogrammed computer system; multiprogramming; probability; queueing theory; queuing model; sequential; storage system; two level", 8985 treatment = "T Theoretical or Mathematical", 8986 } 8987 8988 @Article{Bays:1973:RHC, 8989 author = "Carter Bays", 8990 title = "The Reallocation of Hash-Coded Tables", 8991 journal = j-CACM, 8992 volume = "16", 8993 number = "1", 8994 pages = "11--14", 8995 month = jan, 8996 year = "1973", 8997 CODEN = "CACMA2", 8998 ISSN = "0001-0782", 8999 bibdate = "Tue Mar 25 13:26:09 MST 1997", 9000 bibsource = "Compendex database", 9001 abstract = "When the space allocation for a hash-coded table is altered, the table entries must be rescattered over the new space. A technique for accomplishing this rescattering is presented. The technique is independent of both the length of the table and the hashing function used, and can be utilized in conjunction with a linear reallocation of the table being rescattered. Moreover, it can be used to eliminate previously flagged deletions from any hash-coded table, or to change from one hashing method to another. The efficiency of the technique is discussed and theoretical statistics are given.", 9002 acknowledgement = ack-nhfb, 9003 annote = "Algorithm to handle increase or decrease within a direct access table containing entries.", 9004 classcodes = "C6110 (Systems analysis and programming); C6120 (File organisation)", 9005 classification = "723", 9006 corpsource = "Univ. South Carolina, Columbia, SC, USA", 9007 journalabr = "Commun ACM", 9008 keywords = "computer systems programming; data storage, digital; dynamic storage; hash code; reallocation; scatter storage", 9009 keywords = "deletions; dynamic storage; hash code; programming; reallocation; scatter storage; storage allocation", 9010 treatment = "P Practical", 9011 } 9012 9013 @Article{Morris:1973:PPL, 9014 author = "James H. {Morris, Jr.}", 9015 title = "Protection in Programming Languages", 9016 journal = j-CACM, 9017 volume = "16", 9018 number = "1", 9019 pages = "15--21", 9020 month = jan, 9021 year = "1973", 9022 CODEN = "CACMA2", 9023 ISSN = "0001-0782", 9024 bibdate = "Tue Mar 25 13:26:09 MST 1997", 9025 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib", 9026 abstract = "Linguistic mechanisms which can be used to protect one subprogram from another's malfunctioning are described. Function-producing functions and various type-tagging schemes are considered. An attempt is made to distinguish between access limitation and authentication.", 9027 acknowledgement = ack-nhfb, 9028 classcodes = "C6100 (Software techniques and systems)", 9029 classification = "723", 9030 corpsource = "Univ. California, Berkeley, CA, USA", 9031 journalabr = "Commun ACM", 9032 keywords = "access control; access keys; authentication; computer programming languages; environments; programming languages; protection; seals; secrecy; security of data; trademarks; types", 9033 treatment = "G General Review; T Theoretical or Mathematical", 9034 } 9035 9036 @Article{Muraoka:1973:TRS, 9037 author = "Yoichi Muraoka and David J. Kuck", 9038 title = "On the Time Required for a Sequence of Matrix Products", 9039 journal = j-CACM, 9040 volume = "16", 9041 number = "1", 9042 pages = "22--26", 9043 month = jan, 9044 year = "1973", 9045 CODEN = "CACMA2", 9046 ISSN = "0001-0782", 9047 MRclass = "68A20", 9048 MRnumber = "51 2347", 9049 mrreviewer = "M. Tetruasvili", 9050 bibdate = "Tue Mar 25 13:26:09 MST 1997", 9051 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Parallel/Multi.bib", 9052 abstract = "This paper discusses the multiplication of conformable sequences of row vectors, column vectors, and square matrices. The minimum time required to evaluate such products on ordinary serial computers as well as parallel computers is discussed. Algorithms are presented which properly parse such matrix sequences subject to the constraints of the machine organization.", 9053 acknowledgement = ack-nhfb, 9054 classcodes = "C5230 (Digital arithmetic methods)", 9055 classification = "723", 9056 corpsource = "Univ. Illinois, Urbana-Champaign, IL, USA", 9057 journalabr = "Commun ACM", 9058 keywords = "computer programming; computer programming languages; computers; digital arithmetic; matrix algebra; matrix expressions; matrix multiplication; operation minimization; parallel computers; parallel machine; parallel processing; sequence of matrix products; serial; time required", 9059 treatment = "T Theoretical or Mathematical", 9060 } 9061 9062 @Article{James:1973:ACP, 9063 author = "E. B. James and D. P. Partridge", 9064 title = "Adaptive Correction of Program Statements", 9065 journal = j-CACM, 9066 volume = "16", 9067 number = "1", 9068 pages = "27--37", 9069 month = jan, 9070 year = "1973", 9071 CODEN = "CACMA2", 9072 ISSN = "0001-0782", 9073 bibdate = "Tue Mar 25 13:26:09 MST 1997", 9074 bibsource = "Compendex database", 9075 abstract = "A method of analyzing statements in a programming language which can tolerate a considerable inaccuracy in their specification is proposed. This method involves principles at present mainly confined to studies in the area of artificial intelligence such as feature extraction, approximate tree matching, and strategy improvement by feedback from the matching process. A pilot program incorporating the principles is described and preliminary operating results are presented. A final section surveys further principles which are currently being investigated.", 9076 acknowledgement = ack-nhfb, 9077 classcodes = "C4240 (Programming and algorithm theory)", 9078 classification = "723", 9079 corpsource = "Imperial Coll. Sci. and Technol., London, UK", 9080 journalabr = "Commun ACM", 9081 keywords = "adaptive correction; artificial intelligence; automatic parsing; compiler; computer metatheory; computer programming languages; linguistic pattern matching; program statements; programming; programming languages; syntax analysis; theory", 9082 treatment = "T Theoretical or Mathematical", 9083 } 9084 9085 @Article{Richman:1973:VE, 9086 author = "P. L. Richman", 9087 title = "Variable-Precision Exponentiation", 9088 journal = j-CACM, 9089 volume = "16", 9090 number = "1", 9091 pages = "38--40", 9092 month = jan, 9093 year = "1973", 9094 CODEN = "CACMA2", 9095 ISSN = "0001-0782", 9096 MRclass = "65D20", 9097 MRnumber = "51 4631", 9098 mrreviewer = "V. V. Ivanov", 9099 bibdate = "Tue Mar 25 13:26:09 MST 1997", 9100 bibsource = "Compendex database", 9101 abstract = "A previous paper presented an efficient algorithm, called the Recomputation Algorithm, for evaluating a rational expression to within any desired tolerance on a computer which performs variable-precision arithmetic operations. The Recomputation Algorithm can be applied to expressions involving any variable-precision operations having $O(10^(-p) + \sum_i|E_i|)$ error bounds, where $p$ denotes the operation's precision and $E_i$ denotes the error in the operation's $i$-th argument. \par This paper presents an efficient variable-precision exponential operation with an error bound of the above order. Other operations such as log, sin, and cos, which have simple series expansions, can be handled similarly.", 9102 acknowledgement = ack-nhfb, 9103 classcodes = "C5230 (Digital arithmetic methods)", 9104 classification = "723; 921", 9105 corpsource = "Bell Telephone Labs. Inc., Denver, CO, USA", 9106 journalabr = "Commun ACM", 9107 keywords = "computer programming; digital arithmetic; error analysis; exponential function; exponentiation; interval arithmetic; mathematical programming; variable precision; variable-precision", 9108 treatment = "T Theoretical or Mathematical", 9109 } 9110 9111 @Article{Crawford:1973:RBS, 9112 author = "C. R. Crawford", 9113 title = "Reduction of a Band-Symmetric Generalized Eigenvalue Problem", 9114 journal = j-CACM, 9115 volume = "16", 9116 number = "1", 9117 pages = "41--44", 9118 month = jan, 9119 year = "1973", 9120 CODEN = "CACMA2", 9121 ISSN = "0001-0782", 9122 MRclass = "65F15", 9123 MRnumber = "51 7266", 9124 mrreviewer = "W. Niethammer", 9125 bibdate = "Tue Mar 25 13:26:09 MST 1997", 9126 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Theory/gvl.bib and ftp://ftp.ira.uka.de/pub/bibliography/Theory/Matrix.bib", 9127 abstract = "An algorithm is described for reducing a generalized eigenvalue problem to an ordinary problem, in case A and B are symmetric band matrices with B positive definite. If n is the order of the matrix and m the bandwidth, the matrices A and B are partitioned into m-by-m blocks; and the algorithm is described in terms of these blocks. The algorithm reduces the generalized problem to an ordinary eigenvalue problem for a symmetric band matrix C whose bandwidth is the same as A and B. The algorithm is similar to those of Rutishauser and Schwartz for the reduction of symmetric matrices to band form. The calculation of C requires order N**2m operation. The round-off error in the calculation of C is of the same order as the sum of the errors at each of the n/m steps of the algorithm, the latter errors being largely determined by the condition of B with respect to inversion.", 9128 acknowledgement = ack-nhfb, 9129 classcodes = "B0290H (Linear algebra); C4140 (Linear algebra)", 9130 classification = "723; 921", 9131 corpsource = "Univ. Toronto, Ont., Canada", 9132 journalabr = "Commun ACM", 9133 keywords = "computer programming --- Subroutines; generalized eigenvalues; mathematical techniques; symmetric band matrices", 9134 keywords = "eigenvalues and eigenfunctions; generalized eigenvalues; matrix algebra; reduction; symmetric band matrices", 9135 kwds = "nla, geig, band matrix, symmetric matrix", 9136 treatment = "T Theoretical or Mathematical", 9137 } 9138 9139 @Article{Blount:1973:PAC, 9140 author = "S. E. Blount and L. Fein", 9141 title = "The practical aspect of computer science education --- discussion", 9142 journal = j-CACM, 9143 volume = "16", 9144 number = "1", 9145 pages = "45--46", 9146 month = jan, 9147 year = "1973", 9148 CODEN = "CACMA2", 9149 ISSN = "0001-0782", 9150 bibdate = "Tue Mar 25 13:26:09 MST 1997", 9151 acknowledgement = ack-nhfb, 9152 classcodes = "C0220 (Computing education and training)", 9153 corpsource = "Digital Equipment Corp., Acton, MA, USA", 9154 keywords = "computer engineering; computer science; curriculum; digital computers; education; systems design", 9155 treatment = "G General Review", 9156 } 9157 9158 @Article{Bays:1973:NWC, 9159 author = "C. Bays", 9160 title = "A note on when to chain overflow items within a direct-access table", 9161 journal = j-CACM, 9162 volume = "16", 9163 number = "1", 9164 pages = "46--47", 9165 month = jan, 9166 year = "1973", 9167 CODEN = "CACMA2", 9168 ISSN = "0001-0782", 9169 bibdate = "Tue Mar 25 13:26:09 MST 1997", 9170 acknowledgement = ack-nhfb, 9171 classcodes = "C6130 (Data handling techniques)", 9172 corpsource = "Univ. South Carolina, Columbia, SC, USA", 9173 keywords = "chaining; collision; data handling; direct access table; hash code; information; open hash; overflow items; retrieval", 9174 treatment = "T Theoretical or Mathematical", 9175 } 9176 9177 @Article{Atkins:1973:MRA, 9178 author = "M. S. Atkins", 9179 title = "Mutual recursion in {Algol 60} using restricted compilers", 9180 journal = j-CACM, 9181 volume = "16", 9182 number = "1", 9183 pages = "47--48", 9184 month = jan, 9185 year = "1973", 9186 CODEN = "CACMA2", 9187 ISSN = "0001-0782", 9188 bibdate = "Tue Mar 25 13:26:09 MST 1997", 9189 acknowledgement = ack-nhfb, 9190 classcodes = "C6140D (High level languages); C6150C (Compilers, interpreters and other processors)", 9191 corpsource = "Univ. Warwick, Coventry, UK", 9192 keywords = "ALGOL; ALGOL 60; mutual recursion; program compilers; restricted compilers", 9193 treatment = "P Practical", 9194 } 9195 9196 @Article{Gallaher:1973:AAM, 9197 author = "L. J. Gallaher", 9198 title = "{ACM} Algorithm 440: {A} Multidimensional {Monte} {Carlo} Quadrature with Adaptive Stratified Sampling", 9199 journal = j-CACM, 9200 volume = "16", 9201 number = "1", 9202 pages = "49--50", 9203 month = jan, 9204 year = "1973", 9205 CODEN = "CACMA2", 9206 ISSN = "0001-0782", 9207 bibdate = "Tue Mar 25 13:26:09 MST 1997", 9208 acknowledgement = ack-nhfb, 9209 classcodes = "B0290M (Numerical integration and differentiation); C4160 (Numerical integration and differentiation); C7310 (Mathematics computing)", 9210 corpsource = "Georgia Inst. Technol., Atlanta, GA, USA", 9211 keywords = "adaptive quadrature; ALGOL; integral; integration; Monte Carlo methods; Monte Carlo Quadrature; multidimensional; sampling; sequential stratification; stratified; subroutines", 9212 treatment = "P Practical", 9213 } 9214 9215 @Article{Knop:1973:AAR, 9216 author = "R. E. Knop", 9217 title = "{ACM} Algorithm 441: Random samples from the dipole distribution [{G5}]", 9218 journal = j-CACM, 9219 volume = "16", 9220 number = "1", 9221 pages = "51--51", 9222 month = jan, 9223 year = "1973", 9224 CODEN = "CACMA2", 9225 ISSN = "0001-0782", 9226 bibdate = "Tue Mar 25 13:26:09 MST 1997", 9227 bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1973.bib", 9228 acknowledgement = ack-nhfb, 9229 classcodes = "C7310 (Mathematics computing)", 9230 corpsource = "Florida State Univ., Tallahassee, FL, USA", 9231 country = "USA", 9232 descriptors = "RVG;", 9233 enum = "7514", 9234 keywords = "dipole distribution; FORTRAN; probability density; random deviates; random number; statistics; subroutines", 9235 language = "English", 9236 references = "0", 9237 treatment = "P Practical", 9238 } 9239 9240 @Article{Hill:1973:AAN, 9241 author = "G. W. Hill and A. W. Davis", 9242 title = "{ACM} Algorithm 442: Normal deviate [{S14}]", 9243 journal = j-CACM, 9244 volume = "16", 9245 number = "1", 9246 pages = "51--52", 9247 month = jan, 9248 year = "1973", 9249 CODEN = "CACMA2", 9250 ISSN = "0001-0782", 9251 bibdate = "Tue Mar 25 13:26:09 MST 1997", 9252 bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1973.bib", 9253 acknowledgement = ack-nhfb, 9254 classcodes = "C7310 (Mathematics computing)", 9255 corpsource = "CSIRO, Glen Osmond, Australia", 9256 country = "USA", 9257 descriptors = "RVG;", 9258 enum = "7393", 9259 keywords = "ALGOL; normal deviate; normal distribution inverse; probit; statistics; subroutines; Taylor series approximation; transform", 9260 language = "English", 9261 references = "0", 9262 treatment = "P Practical", 9263 } 9264 9265 @Article{Merrill:1973:RCR, 9266 author = "R. D. Merrill", 9267 title = "Representation of Contours and Regions for Efficient Computer Search", 9268 journal = j-CACM, 9269 volume = "16", 9270 number = "2", 9271 pages = "69--82", 9272 month = feb, 9273 year = "1973", 9274 CODEN = "CACMA2", 9275 ISSN = "0001-0782", 9276 MRclass = "68A10", 9277 MRnumber = "51 7362", 9278 mrreviewer = "Arnold Griffith", 9279 bibdate = "Tue Mar 25 13:26:09 MST 1997", 9280 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Graphics/imager/imager.75.bib", 9281 abstract = "A novel computer-searchable representation for the three basic pictorial features, contour maps, region coverage, and line structures, is described. The representation, which has practical storage requirements, provides a rapid means of searching large files for data associated with geometric position as well as with attribute value. An application of this representation to handling terrain information illustrates its utility. The algebraic properties of the data structure make it computationally easy to determine whether a point lies within a closed boundary; compute the area contained by a closed boundary; generate the closed boundary representing the union or intersection of two closed boundaries; and determine the neighboring boundaries to a point and the minimum distances between them and the point. Pertinent to mapping.", 9282 acknowledgement = ack-nhfb, 9283 classcodes = "C6130 (Data handling techniques); C7400 (Engineering computing)", 9284 classification = "405; 723", 9285 corpsource = "Lockheed Palo Alto Res. Laboratory, CA, USA", 9286 journalabr = "Commun ACM", 9287 keywords = "applications of computers; cartography; computer graphics; computer searchable structure; contour map representation; data handling; data processing --- Data Handling; data processing --- Data Structures; engineering; graphic data retrieval; maps and mapping; region boundary representation", 9288 treatment = "T Theoretical or Mathematical", 9289 } 9290 9291 @Article{Crespi-Reghizzi:1973:UGI, 9292 author = "S. Crespi-Reghizzi and M. A. Melkanoff and L. Lichten", 9293 title = "The Use of Grammatical Inference for Designing Programming Languages", 9294 journal = j-CACM, 9295 volume = "16", 9296 number = "2", 9297 pages = "83--90", 9298 month = feb, 9299 year = "1973", 9300 CODEN = "CACMA2", 9301 ISSN = "0001-0782", 9302 MRclass = "68A30", 9303 MRnumber = "50 15446", 9304 mrreviewer = "Leon Levy", 9305 bibdate = "Tue Mar 25 13:26:09 MST 1997", 9306 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Ai/colt.bib", 9307 abstract = "Both in designing a new programming language and in extending an existing language, the designer is faced with the problem of deriving a ``natural'' grammar for the language. We are proposing an interactive approach to the grammar design problem wherein the designer presents a sample of sentences and structures as input to a grammatical inference algorithm. The algorithm then constructs a grammar which is a reasonable generalization of the examples submitted by the designer. \par The implementation is presently restricted to a subclass of operator precedence grammars, but a second algorithm is outlined which applies to a larger class of context-free grammars.", 9308 acknowledgement = ack-nhfb, 9309 classcodes = "C4210 (Formal logic); C6140 (Programming languages)", 9310 classification = "723", 9311 corpsource = "Univ. California, Los Angeles, CA, USA", 9312 journalabr = "Commun ACM", 9313 keywords = "computer programming languages; context; context-free grammars; extensible languages; free grammars; grammar design; grammatical inference; identification in the limit; inference; language definition; operator; precedence grammars; programming languages", 9314 treatment = "P Practical", 9315 } 9316 9317 @Article{Gimpel:1973:TDP, 9318 author = "J. F. Gimpel", 9319 title = "A Theory of Discrete Patterns and Their Implementation in {SNOBOL4}", 9320 journal = j-CACM, 9321 volume = "16", 9322 number = "2", 9323 pages = "91--100", 9324 month = feb, 9325 year = "1973", 9326 CODEN = "CACMA2", 9327 ISSN = "0001-0782", 9328 MRclass = "68A15 (68A45)", 9329 MRnumber = "52 7198", 9330 mrreviewer = "John K. Debenham", 9331 bibdate = "Tue Mar 25 13:26:09 MST 1997", 9332 bibsource = "Compendex database", 9333 abstract = "The notion of a discrete pattern is formalized and certain properties deduced. A pattern is shown to be a generalization of a formal language. Algorithms for implementing the kinds of patterns in SNOBOL4 are given. The general approach is to create, in-so-far as possible, a bottom-up parse from a top-down specification.", 9334 acknowledgement = ack-nhfb, 9335 classcodes = "C4210 (Formal logic); C6140 (Programming languages)", 9336 classification = "723", 9337 corpsource = "Bell Telephone Labs., Holmdel, NJ, USA", 9338 journalabr = "Commun ACM", 9339 keywords = "computer programming languages; data processing --- Data Structures; discrete patterns; formal language; formal languages; parsing; pattern implementation; pattern matching; pattern recognition systems; pattern theory; patterns; programming languages; SNOBOL4; string processing", 9340 treatment = "T Theoretical or Mathematical", 9341 } 9342 9343 @Article{Rokne:1973:AES, 9344 author = "J. Rokne", 9345 title = "Automatic Errorbounds for Simple Zeros of Analytic Functions", 9346 journal = j-CACM, 9347 volume = "16", 9348 number = "2", 9349 pages = "101--104", 9350 month = feb, 9351 year = "1973", 9352 CODEN = "CACMA2", 9353 ISSN = "0001-0782", 9354 MRclass = "65E05", 9355 MRnumber = "51 4638", 9356 mrreviewer = "E. Maliszewski", 9357 bibdate = "Tue Mar 25 13:26:09 MST 1997", 9358 bibsource = "Compendex database", 9359 abstract = "The Cauchy-Ostrowski theorem on convergence of Newton iterates for an analytic function in one variable is extended to include computational errors using complex interval arithmetic. Several numerical examples are given for polynomials with real and complex roots and one example for the Bessel function of the first kind.", 9360 acknowledgement = ack-nhfb, 9361 classcodes = "B0290B (Error analysis in numerical methods); B0290D (Functional analysis); B0290K (Nonlinear and functional equations); C4110 (Error analysis in numerical methods); C4120 (Functional analysis); C4150 (Nonlinear and functional equations)", 9362 classification = "723", 9363 corpsource = "Univ. Calgary, Alta., Canada", 9364 journalabr = "Commun ACM", 9365 keywords = "analysis; analytic functions; automatic errorbounds; Bessel functions; Cauchy-Ostrowski theorem; complex interval arithmetic; complex intervals; convergence of numerical methods; data processing --- Data Handling; data processing --- Data Structures; error; interval arithmetic; iterative methods; mathematical techniques; Newton's method; poles and zeros; polynomials; real interval arithmetic; real intervals; simple zeros; zeros of Bessel functions; zeros of polynomials", 9366 treatment = "T Theoretical or Mathematical", 9367 } 9368 9369 @Article{Brent:1973:RRT, 9370 author = "Richard P. Brent", 9371 title = "Reducing the Retrieval Time of Scatter Storage Techniques", 9372 journal = j-CACM, 9373 volume = "16", 9374 number = "2", 9375 pages = "105--109", 9376 month = feb, 9377 year = "1973", 9378 CODEN = "CACMA2", 9379 ISSN = "0001-0782", 9380 bibdate = "Tue Mar 25 13:26:09 MST 1997", 9381 bibsource = "Compendex database", 9382 note = "Modification of open addressing with double hashing to reduce the average number of probes for a successful search.", 9383 abstract = "A new method for entering and retrieving information in a hash table is described. The method is intended to be efficient if most entries are looked up several times. The expected number of probes to look up an entry, predicted theoretically and verified by Monte Carlo experiments, is considerably less than for other comparable methods if the table is nearly full. An example of a possible Fortran implementation is given.", 9384 acknowledgement = ack-nhfb, 9385 classcodes = "C6120 (File organisation)", 9386 classification = "723; 901", 9387 journalabr = "Commun ACM", 9388 keywords = "address; address calculation; addressing; calculation; computer programming languages --- Fortran; content addressing; data storage, digital --- Random Access; file organisation; file searching; has; has code; hash addressing; information retrieval systems; linear probing; linear quotient; linear quotient method; method; retrieval time; scatter storage techniques; storage management; symbol table", 9389 treatment = "P Practical", 9390 } 9391 9392 @Article{Graham:1973:SDE, 9393 author = "Robert M. Graham and Gerald J. {Clancy, Jr.} and David B. DeVaney", 9394 title = "A software design and evaluation system", 9395 journal = j-CACM, 9396 volume = "16", 9397 number = "2", 9398 pages = "110--116", 9399 month = feb, 9400 year = "1973", 9401 CODEN = "CACMA2", 9402 ISSN = "0001-0782", 9403 bibdate = "Tue Mar 25 13:26:09 MST 1997", 9404 bibsource = "Compendex database", 9405 abstract = "A critical failure of current software system design and implementation methodology is that the performance of a proposed design is not evaluated before it is actually implemented. In this paper the reasons for this failure are explored, and a new methodology which overcomes many of the difficulties is proposed. A system which integrates performance evaluation with design and implementation is described. This system is based on a simple, high level language which is used to describe the evolving system at all stages of its development. The source language description is used as direct input to performance analysis and simulation routines. using the performance information obtained from these routines as feedback, the problems which adversely affect performance are detected early enough so that they can be corrected without costly major reimplementation of the proposed system.", 9406 acknowledgement = ack-nhfb, 9407 classcodes = "C6150C (Compilers, interpreters and other processors); C6150J (Operating systems)", 9408 classification = "723", 9409 corpsource = "Univ. California, Berkeley, CA, USA", 9410 journalabr = "Commun ACM", 9411 keywords = "compilers; computer programming languages; computer software; computer systems programming; computer systems programming --- Supervisory and Executive Programs; data processing --- Data Structures; debugging; des language; evaluation; executive programs; high level language; performance analysis; program maintenance; program processors; simulation; software design; supervisory and; supervisory systems; system programming", 9412 treatment = "P Practical", 9413 } 9414 9415 @Article{Balzer:1973:OIC, 9416 author = "R. M. Balzer", 9417 title = "An overview of the {ISPL} computer system design", 9418 journal = j-CACM, 9419 volume = "16", 9420 number = "2", 9421 pages = "117--122", 9422 month = feb, 9423 year = "1973", 9424 CODEN = "CACMA2", 9425 ISSN = "0001-0782", 9426 bibdate = "Tue Mar 25 13:26:09 MST 1997", 9427 bibsource = "Compendex database", 9428 abstract = "This paper explores the advantages of the concurrent design of the language, operating system, and machine (via microcode) to create an interactive programming laboratory. It describes the synergistic effect that the freedom to move and alter features from one of these domains to another has had on the design of this system (which has not been implemented). This freedom simplified both incremental compilation and the system's addressing structure, and centralized the communication mechanisms enabling the construction of hierarchical subsystems. It also suggested an important new concept for operating systems: separation of the scheduling from the maintenance functions in resource allocation. This separation enables incorporation of new scheduling algorithms (decision of what to do) without endangering the system integration (correctly performing the scheduling decisions).", 9429 acknowledgement = ack-nhfb, 9430 classcodes = "C6100 (Software techniques and systems); C6150J (Operating systems)", 9431 classification = "723", 9432 journalabr = "Commun ACM", 9433 keywords = "computer programming languages; computer system design; computer systems, digital --- Time Sharing; computers --- Data Communication Systems; hierarchical subsystems; incremental compilation; interactive programming laboratory; interprogram communication; ISPL; language; machine; operating system; operating systems (computers); programming", 9434 treatment = "G General Review; T Theoretical or Mathematical", 9435 } 9436 9437 @Article{Fritsch:1973:AAS, 9438 author = "F. N. Fritsch and R. E. Shafer and W. P. Crowley", 9439 title = "{ACM} Algorithm 443: Solution of the Transcendental Equation $w e^w = x$", 9440 journal = j-CACM, 9441 volume = "16", 9442 number = "2", 9443 pages = "123--124", 9444 month = feb, 9445 year = "1973", 9446 CODEN = "CACMA2", 9447 ISSN = "0001-0782", 9448 bibdate = "Tue Mar 25 13:26:09 MST 1997", 9449 acknowledgement = ack-nhfb, 9450 classcodes = "B0290D (Functional analysis); C4120 (Functional analysis); C7310 (Mathematics computing)", 9451 corpsource = "Univ. California, Livermore, CA, USA", 9452 keywords = "FORTRAN; function evaluation; iteration; iterative methods; subroutines; transcendental equation", 9453 treatment = "T Theoretical or Mathematical", 9454 xxauthor = "F. N. Fritsch and R. E. Shafer and W. P. Gowley", 9455 } 9456 9457 @Article{Austing:1973:CSC, 9458 author = "Richard H. Austing and Gerald L. Engel", 9459 title = "A Computer Science Course Program for Small Colleges", 9460 journal = j-CACM, 9461 volume = "16", 9462 number = "3", 9463 pages = "139--147", 9464 month = mar, 9465 year = "1973", 9466 CODEN = "CACMA2", 9467 ISSN = "0001-0782", 9468 bibdate = "Tue Mar 25 13:26:09 MST 1997", 9469 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib", 9470 abstract = "This report gives recommendations for the content, implementation, and operation of a program of computer science courses specifically directed to small colleges. Implementation problems are discussed, specifically within the constraints of limited faculty and for the purposes of satisfying a wide variety of objectives. Detailed descriptions of four courses are given; suggestions are made for more advanced work; and an extensive library list is included.", 9471 acknowledgement = ack-nhfb, 9472 classcodes = "C0220 (Computing education and training)", 9473 classification = "723; 901", 9474 corpsource = "Univ. Maryland, College Park, MD, USA", 9475 journalabr = "Commun ACM", 9476 keywords = "computer science education; data processing", 9477 keywords = "computer organization course; computer science course; education; file organization course; programming course; reviews; small colleges; social implications course; universities", 9478 treatment = "B Bibliography; G General Review", 9479 } 9480 9481 @Article{Wagner:1973:CPM, 9482 author = "Robert A. Wagner", 9483 title = "Common Phrases and Minimum-Space Text Storage", 9484 journal = j-CACM, 9485 volume = "16", 9486 number = "3", 9487 pages = "148--152", 9488 month = mar, 9489 year = "1973", 9490 CODEN = "CACMA2", 9491 ISSN = "0001-0782", 9492 bibdate = "Tue Mar 25 13:26:09 MST 1997", 9493 bibsource = "Compendex database", 9494 abstract = "A method for saving storage space for text strings, such as compiler diagnostic messages, is described. The method relies on hand selection of a set of text strings which are common to one or more messages. These phrases are then stored only once. The storage technique gives rise to a mathematical optimization problem: determine how each message should use the available phrases to minimize its storage requirement. This problem is nontrivial when phrases which overlap exist. However, a dynamic programming algorithm is presented which solves the problem in time which grows linearly with the number of characters in the text. Algorithm 444 applies to this paper.", 9495 acknowledgement = ack-nhfb, 9496 classcodes = "B0260 (Optimisation techniques); C1180 (Optimisation techniques); C6120 (File organisation); C6150G (Diagnostic, testing, debugging and evaluating systems)", 9497 classification = "723", 9498 corpsource = "Cornell Univ., NY, USA", 9499 journalabr = "Commun ACM", 9500 keywords = "common phrases; computer operating systems --- Program Compilers; computer programming; diagnostic messages; dynamic programming; error messages; file organisation; minimum space; optimization; program diagnostics; text storage", 9501 treatment = "P Practical", 9502 } 9503 9504 @Article{Feinroth:1973:TUF, 9505 author = "Y. Feinroth and E. Franceschini and M. Goldstein", 9506 title = "Telecommunications Using a Front-End Minicomputer", 9507 journal = j-CACM, 9508 volume = "16", 9509 number = "3", 9510 pages = "153--160", 9511 month = mar, 9512 year = "1973", 9513 CODEN = "CACMA2", 9514 ISSN = "0001-0782", 9515 bibdate = "Tue Mar 25 13:26:09 MST 1997", 9516 bibsource = "Compendex database", 9517 abstract = "The use of a front-end minicomputer to provide varied remote terminal access to a large scale computer is considered. The problems of embedding telecommunications I/O within an operating system are discussed, and it is shown how the decentralization of intelligence acquired by front-end processing vastly simplifies the problem. A specific implementation is discussed with emphasis on the main processor-minicomputer link, the hardware-software implementation, the effect on the main processor operating system, and an assessment of the advantages over a hardwired line controller.", 9518 acknowledgement = ack-nhfb, 9519 classcodes = "C5600 (Data communication equipment and techniques)", 9520 classification = "718; 723", 9521 corpsource = "New York Univ., NY, USA", 9522 journalabr = "Commun ACM", 9523 keywords = "computers; computers, miniature; digital communication systems; front end processor; front-end processor; large scale computer; minicomputer; minicomputers; operating; operating system; remote; remote job entry; systems (computers); telecommunication systems; telecommunications; terminals", 9524 treatment = "P Practical", 9525 } 9526 9527 @Article{Pack:1973:EMC, 9528 author = "Charles D. Pack", 9529 title = "The Effects of Multiplexing on a Computer-Communications System", 9530 journal = j-CACM, 9531 volume = "16", 9532 number = "3", 9533 pages = "161--168", 9534 month = mar, 9535 year = "1973", 9536 CODEN = "CACMA2", 9537 ISSN = "0001-0782", 9538 bibdate = "Tue Mar 25 13:26:09 MST 1997", 9539 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Distributed/network.bib", 9540 abstract = "A study is made of the way in which asynchronous time division multiplexing changes the stochastic nature of the arrival process from a user to the computer and, consequently, affects the performance of a time-shared computer-communications system. It is concluded that while, for certain values of system parameters, there is noticeable improvement in the performance of the computer (model), in the sense that time-shared scheduling delays are reduced, these improvements are offset by the transmission delays imposed by multiplexing so that there may be little or no change in the computer-communications system performance. Analytical and simulation results are based on the model of the computer-communications system being an M/D/I queue (the multiplexor) in tandem with a single exponential server (the computer). Analytical results include a general description of the output process of an M/D/1 queue and the conditions under which this output process is approximately Poisson.", 9541 acknowledgement = ack-nhfb, 9542 classcodes = "C5600 (Data communication equipment and techniques)", 9543 classification = "718; 722; 723", 9544 corpsource = "Bell Telephone Labs. Inc., Murray Hill, NJ, USA", 9545 journalabr = "Commun ACm", 9546 keywords = "computer communications; computer programming --- Subroutines; computers; digital communication systems; multiplexing; operating systems; scheduling algorithms; systems; time sharing; time-sharing", 9547 treatment = "T Theoretical or Mathematical", 9548 } 9549 9550 @Article{Conway:1973:DID, 9551 author = "Richard W. Conway and Thomas R. Wilcox", 9552 title = "Design and Implementation of Diagnostic Compiler for {PL/I}", 9553 journal = j-CACM, 9554 volume = "16", 9555 number = "3", 9556 pages = "169--179", 9557 month = mar, 9558 year = "1973", 9559 CODEN = "CACMA2", 9560 ISSN = "0001-0782", 9561 bibdate = "Tue Mar 25 13:26:09 MST 1997", 9562 bibsource = "Compendex database", 9563 abstract = "PL/C is a compiler for a dialect for PL/I. The design objective was to provide a maximum degree of diagnostic assistance in a batch processing environment. For the most part this assistance is implicit and is provided automatically by the compilers. The most remarkable characteristic of PL/C is its perseverance --- it completes translation of every program submitted and continues execution until a user-established error limit is reached. This requires that the compiler repair errors encountered during both translation and execution, and the design of PL/C is dominated by this consideration. PL/C also introduces several explicit user-controlled facilities for program testing. To accommodate these extensions to PL/I without abandoning compatibility with the IBM compiler, PL/C permits ``pseudo comments'' --- constructions whose contents can optionally be considered either source text or comment. In spite of the diagnostic effort PL/C is a fast and efficient processor. It effectively demonstrates that compilers can provide better diagnostic assistance than is customarily offered, even when a sophisticated source language is employed, and that this assistance need not be prohibitively costly.", 9564 acknowledgement = ack-nhfb, 9565 classcodes = "C6140D (High level languages); C6150C (Compilers, interpreters and other processors); C6150G (Diagnostic, testing, debugging and evaluating systems)", 9566 classification = "723", 9567 corpsource = "Cornell Univ., NY, USA", 9568 journalabr = "Commun ACM", 9569 keywords = "batch processing environment; batch-processing; computer operating systems; computer programming languages --- Program Debugging; computer programming languages --- Program Diagnostics; design; diagnostic compiler; diagnostics; implementation; PL/1; PL/C; PL/I; program; program compilers", 9570 treatment = "P Practical", 9571 xxtitle = "Design and implementation of a diagnostic compiler for {PL/I}", 9572 } 9573 9574 @Article{Salzer:1973:GCO, 9575 author = "H. E. Salzer", 9576 title = "{Gray} code and the +or-sign sequence when +or-f(+or-f(+or-f( . . +or-f(x) . . .))) is ordered", 9577 journal = j-CACM, 9578 volume = "16", 9579 number = "3", 9580 pages = "180--180", 9581 month = mar, 9582 year = "1973", 9583 CODEN = "CACMA2", 9584 ISSN = "0001-0782", 9585 bibdate = "Tue Mar 25 13:26:09 MST 1997", 9586 note = "Check title??", 9587 acknowledgement = ack-nhfb, 9588 classcodes = "C6130 (Data handling techniques)", 9589 keywords = "binary sequences; binary system; codes; functions; Galois sum; Gray code; ordering; positive monotonic; sign sequences", 9590 treatment = "T Theoretical or Mathematical", 9591 } 9592 9593 @Article{Bookstein:1973:HST, 9594 author = "Abraham Bookstein", 9595 title = "On {Harrison}'s Substring Testing Technique", 9596 journal = j-CACM, 9597 volume = "16", 9598 number = "3", 9599 pages = "180--181", 9600 month = mar, 9601 year = "1973", 9602 CODEN = "CACMA2", 9603 ISSN = "0001-0782", 9604 bibdate = "Tue Mar 25 13:26:09 MST 1997", 9605 acknowledgement = ack-nhfb, 9606 classcodes = "C6130 (Data handling techniques)", 9607 corpsource = "Univ. Chicago, IL, USA", 9608 keywords = "data handling; hashing; information storage; retrieval; substring testing technique", 9609 treatment = "P Practical", 9610 } 9611 9612 @Article{Payne:1973:GEP, 9613 author = "W. H. Payne", 9614 title = "Graduate Education: The {Ph.D.} Glut", 9615 journal = j-CACM, 9616 volume = "16", 9617 number = "3", 9618 pages = "181--182", 9619 month = mar, 9620 year = "1973", 9621 CODEN = "CACMA2", 9622 ISSN = "0001-0782", 9623 bibdate = "Tue Mar 25 13:26:09 MST 1997", 9624 note = "See response and rebuttal \cite{Freeman:1974:GEP}.", 9625 acknowledgement = ack-nhfb, 9626 classcodes = "C0220 (Computing education and training)", 9627 corpsource = "Univ. Illinois, Urbana-Champaign, IL, USA", 9628 keywords = "accreditation; education; graduate education; Ph.D. glut; Ph.D. production", 9629 treatment = "G General Review", 9630 } 9631 9632 @Article{Wagner:1973:AAA, 9633 author = "R. A. Wagner", 9634 title = "{ACM} Algorithm 444: An Algorithm for Extracting Phrases in a Space-Optimal Fashion", 9635 journal = j-CACM, 9636 volume = "16", 9637 number = "3", 9638 pages = "183--185", 9639 month = mar, 9640 year = "1973", 9641 CODEN = "CACMA2", 9642 ISSN = "0001-0782", 9643 bibdate = "Tue Mar 25 13:26:09 MST 1997", 9644 acknowledgement = ack-nhfb, 9645 classcodes = "C6130 (Data handling techniques)", 9646 corpsource = "Vanderbilt Univ., Nashville, TN, USA", 9647 keywords = "algorithm; coding; data handling; extracting phrases; information retrieval; PARSE; PL/I; subroutines; text compression", 9648 treatment = "P Practical", 9649 } 9650 9651 @Article{Chang:1973:AAB, 9652 author = "Shi-Kuo Chang", 9653 title = "{ACM} Algorithm 445: Binary Pattern Reconstruction from Projections", 9654 journal = j-CACM, 9655 volume = "16", 9656 number = "3", 9657 pages = "185--186", 9658 month = mar, 9659 year = "1973", 9660 CODEN = "CACMA2", 9661 ISSN = "0001-0782", 9662 bibdate = "Tue Mar 25 13:26:09 MST 1997", 9663 acknowledgement = ack-nhfb, 9664 classcodes = "B6140C (Optical information, image and video signal processing); C1250 (Pattern recognition); C7800 (Other computer applications)", 9665 corpsource = "Cornell Univ., Ithaca, NY, USA", 9666 keywords = "ALGOL; binary pattern; compression; data; picture processing; projections; reconstruction; subroutines", 9667 treatment = "P Practical; T Theoretical or Mathematical", 9668 } 9669 9670 @Article{Lau:1973:BPR, 9671 author = "J. Lau", 9672 title = "Binary pattern reconstruction from projections", 9673 journal = j-CACM, 9674 volume = "16", 9675 number = "3", 9676 pages = "186--186", 9677 month = mar, 9678 year = "1973", 9679 CODEN = "CACMA2", 9680 ISSN = "0001-0782", 9681 bibdate = "Tue Mar 25 13:26:09 MST 1997", 9682 acknowledgement = ack-nhfb, 9683 classcodes = "B6140C (Optical information, image and video signal processing); C1250 (Pattern recognition); C7800 (Other computer applications)", 9684 corpsource = "Univ. British Columbia, Vancouver, BC, Canada", 9685 keywords = "ALGOL; binary pattern reconstruction; compression; data; picture processing; projections; subroutines", 9686 treatment = "P Practical; T Theoretical or Mathematical", 9687 } 9688 9689 @Article{Hassitt:1973:IHL, 9690 author = "A. Hassitt and J. W. Lageschulte and L. E. Lyon", 9691 title = "Implementation of a High Level Language Machine", 9692 journal = j-CACM, 9693 volume = "16", 9694 number = "4", 9695 pages = "199--212", 9696 month = apr, 9697 year = "1973", 9698 CODEN = "CACMA2", 9699 ISSN = "0001-0782", 9700 bibdate = "Tue Mar 25 13:26:09 MST 1997", 9701 bibsource = "Compendex database", 9702 abstract = "Computing machines which directly execute the statements of a high level language have been proposed in the past. This report describes the actual implementation of such a machine: it is a computer whose ``machine language'' is APL. The machine is fully operational and correctly executes almost all of the APL operations on scalars, vectors, and arrays. The machine automatically allocates memory, executes statements, calls functions, converts numbers from one type to another, checks subscripts, and automatically detects many types of programmer errors.", 9703 acknowledgement = ack-nhfb, 9704 classcodes = "C5220 (Computer architecture); C6140D (High level languages)", 9705 classification = "723", 9706 corpsource = "IBM Palo Alto, CA, USA", 9707 journalabr = "Commun ACM", 9708 keywords = "APL; computer architecture; computer operating systems --- Program Compilers; computer programming languages; computing machines; emulators; high level language; high level language machine; implementation; interpreters; microprogramming; procedure oriented languages", 9709 treatment = "P Practical", 9710 } 9711 9712 @Article{Williams:1973:AMH, 9713 author = "John G. Williams", 9714 title = "Asymmetric Memory Hierarchies", 9715 journal = j-CACM, 9716 volume = "16", 9717 number = "4", 9718 pages = "213--222", 9719 month = apr, 9720 year = "1973", 9721 CODEN = "CACMA2", 9722 ISSN = "0001-0782", 9723 MRclass = "68A50", 9724 MRnumber = "51 2378", 9725 mrreviewer = "I. Kaufmann", 9726 bibdate = "Tue Mar 25 13:26:09 MST 1997", 9727 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Misc/storage.bib", 9728 abstract = "A study is presented of some of the system implications of memory hierarchies in which the backing or secondary store has a very small read time, relative of both the time required for writing and to the read time of conventional backing storage devices. Several analytic models are introduced, and it is shown that such hierarchies may operate in ways which differ from those of more conventional hierarchies. In particular, it is shown that it may not be necessary to multiprogram in such a situation. \par In the past, backing storage devices have been roughly symmetric with respect to their read and write times. This situation may not continue, as several devices are currently under development which may have a very small read-time/write-time ratio. This study places particular emphasis on one such system-the RCA read/write holographic optical memory.", 9729 acknowledgement = ack-nhfb, 9730 classcodes = "C5320Z (Other digital storage); C6120 (File organisation)", 9731 classification = "722; 723; 741", 9732 corpsource = "RCA, Princeton, NJ, USA", 9733 journalabr = "Commun ACM", 9734 keywords = "asymmetric memory; asymmetric memory hierarchies; asymmetric memory hierarchy; computer systems programming --- Multiprogramming; data storage, optical; demand paging; file organisation; holographic; holographic optical memory; holography; memory device; memory hierarchy; optical memory; optical stores; paging; Performance Evaluation: Analytic; storage device; storage hierarchy; virtual memory", 9735 treatment = "P Practical", 9736 } 9737 9738 @Article{Kuki:1973:SSA, 9739 author = "H. Kuki and W. J. Cody", 9740 title = "A Statistical Study of the Accuracy of Floating Point Number Systems", 9741 journal = j-CACM, 9742 volume = "16", 9743 number = "4", 9744 pages = "223--230", 9745 month = apr, 9746 year = "1973", 9747 CODEN = "CACMA2", 9748 ISSN = "0001-0782", 9749 MRclass = "68A20 (65G05)", 9750 MRnumber = "51 2344", 9751 mrreviewer = "I. Kaufmann", 9752 bibdate = "Tue Mar 25 13:26:09 MST 1997", 9753 bibsource = "Compendex database; garbo.uwasa.fi:/pc/doc-soft/fpbiblio.txt", 9754 abstract = "This paper presents the statistical results of tests of the accuracy of certain arithmetic systems in evaluating sums, products and inner products, and analytic error estimates for some of the computations. The arithmetic systems studied are 6-digit hexadecimal and 22-digit binary floating point number representations combined with the usual chop and round modes of arithmetic with various numbers of guard digits, and with a modified round mode with guard digits. In a certain sense, arithmetic systems differing only in their use of binary or hexadecimal number representations are shown to be approximately statistically equivalent in accuracy. Further, the usual round mode with guard digits is shown to be statistically superior in accuracy to the usual chop mode in all cases save one. The modified round mode is found to be superior to the chop mode in all cases.", 9755 acknowledgement = ack-nhfb # " and " # ack-nj, 9756 classcodes = "C5230 (Digital arithmetic methods)", 9757 classification = "723", 9758 corpsource = "Univ. Chicago, IL, USA", 9759 journalabr = "Commun ACM", 9760 keywords = "accuracy; arithmetic; computer programming; digital arithmetic; error analysis; floating point arithmetic; floating point number systems; guard digits; number representation; rounding; statistical study", 9761 treatment = "T Theoretical or Mathematical", 9762 } 9763 9764 @Article{Burkhard:1973:SAB, 9765 author = "W. A. Burkhard and R. M. Keller", 9766 title = "Some Approaches to Best-Match File Searching", 9767 journal = j-CACM, 9768 volume = "16", 9769 number = "4", 9770 pages = "230--236", 9771 month = apr, 9772 year = "1973", 9773 CODEN = "CACMA2", 9774 ISSN = "0001-0782", 9775 bibdate = "Tue Mar 25 13:26:09 MST 1997", 9776 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Graphics/siggraph/pre75.bib", 9777 abstract = "The problem of searching the set of keys in a file to find a key which is closest to a given query key is discussed. After ``closest'', in terms of a metric on the key space, is suitably defined, three file structures are presented together with their corresponding search algorithms, which are intended to reduce the number of comparisons required to achieve the desired result. These methods are derived using certain inequalities satisfied by metrics and by graph-theoretic concepts. Some empirical results are presented which compare the efficiency of the methods.", 9778 acknowledgement = ack-nhfb, 9779 classcodes = "C6120 (File organisation)", 9780 classification = "723; 901", 9781 corpsource = "Univ. California, San Diego, CA, USA", 9782 journalabr = "Commun ACM", 9783 keywords = "best match; data processing; file organisation; file searching; file structuring; heuristics; information retrieval systems", 9784 treatment = "T Theoretical or Mathematical", 9785 } 9786 9787 @Article{Strong:1973:RCT, 9788 author = "James P. {Strong, III} and Azriel Rosenfeld", 9789 title = "A region coloring technique for scene analysis", 9790 journal = j-CACM, 9791 volume = "16", 9792 number = "4", 9793 pages = "237--246", 9794 month = apr, 9795 year = "1973", 9796 CODEN = "CACMA2", 9797 ISSN = "0001-0782", 9798 bibdate = "Tue Mar 25 13:26:09 MST 1997", 9799 bibsource = "Compendex database", 9800 abstract = "A method of converting a picture into a ``cartoon'' or ``map'' whose regions correspond to differently textured regions is described. Texture edges in the picture are detected, and solid regions surrounded by these (usually broken) edges are ``colored in'' using a propagation process. The resulting map is cleaned by comparing the region colors with the textures of the corresponding regions in the picture, and also by merging some regions with others according to criteria based on topology and size. The method has been applied to the construction of could cover maps from cloud cover pictures obtained by satellites.", 9801 acknowledgement = ack-nhfb, 9802 classcodes = "C5540 (Terminals and graphic displays)", 9803 classification = "405; 723; 741", 9804 corpsource = "NASA, Greenbelt, MD, USA", 9805 journalabr = "Commun ACM", 9806 keywords = "computer graphics; data processing --- Natural Sciences Applications; edge detection; maps and mapping; pattern recognition systems; picture; picture processing; processing; region colouring technique; scene analysis", 9807 treatment = "P Practical", 9808 } 9809 9810 @Article{Rodriguez-Rosell:1973:DIE, 9811 author = "Juan Rodriguez-Rosell and Jean-Pierre Dupuy", 9812 title = "The design, implementation, and evaluation of a working set dispatcher", 9813 journal = j-CACM, 9814 volume = "16", 9815 number = "4", 9816 pages = "247--253", 9817 month = apr, 9818 year = "1973", 9819 CODEN = "CACMA2", 9820 ISSN = "0001-0782", 9821 bibdate = "Tue Mar 25 13:26:09 MST 1997", 9822 bibsource = "Compendex database", 9823 abstract = "The behavior of a computer system is largely dependent upon the algorithm employed to allocate the system resources to the processes competing for them. Recent research in time-sharing paging systems has developed the working set model for program behavior, and a resource allocation strategy based on this model has been proposed. Two implementations along these principles have been reported, but it seems that in neither case have further results been announced. This report discusses the design and implementation of a dispatcher based on the working set principle, presents data to permit analysis of its behavior, and indicates future directions of research on methods of controlling a computer system.", 9824 acknowledgement = ack-nhfb, 9825 classcodes = "C6150J (Operating systems)", 9826 classification = "722; 723", 9827 corpsource = "Royal Inst. Technol., Stockholm, Sweden", 9828 journalabr = "Commun ACM", 9829 keywords = "computer systems, digital; computers --- Operating Procedures; design; evaluation; implementation; operating systems; resource allocation; scheduler; software evaluation; supervisory and executive programs; supervisory systems; time sharing; time-sharing systems; working set; working set dispatcher", 9830 treatment = "T Theoretical or Mathematical", 9831 xxtitle = "Design, Implementation, and Evaluation of Working Set Dispatcher", 9832 } 9833 9834 @Article{Broucke:1973:AAT, 9835 author = "R. Broucke", 9836 title = "{ACM} Algorithm 446: Ten Subroutines for the Manipulation of {Chebyshev} Series", 9837 journal = j-CACM, 9838 volume = "16", 9839 number = "4", 9840 pages = "254--256", 9841 month = apr, 9842 year = "1973", 9843 CODEN = "CACMA2", 9844 ISSN = "0001-0782", 9845 bibdate = "Tue Mar 25 13:26:09 MST 1997", 9846 acknowledgement = ack-nhfb, 9847 classcodes = "B0290F (Interpolation and function approximation); C4130 (Interpolation and function approximation); C7310 (Mathematics computing)", 9848 corpsource = "Univ. California, Los Angeles, CA, USA", 9849 keywords = "approximations; Chebyshev approximation; Chebyshev series; curve fitting; Manipulation; negative powers; series (mathematics); subroutines", 9850 } 9851 9852 @Article{Ragland:1973:GCD, 9853 author = "L. C. Ragland and D. I. Good", 9854 title = "Greatest common divisor of $n$ integers and multipliers", 9855 journal = j-CACM, 9856 volume = "16", 9857 number = "4", 9858 pages = "257--257", 9859 month = apr, 9860 year = "1973", 9861 CODEN = "CACMA2", 9862 ISSN = "0001-0782", 9863 bibdate = "Tue Mar 25 13:26:09 MST 1997", 9864 acknowledgement = ack-nhfb, 9865 classcodes = "C5230 (Digital arithmetic methods)", 9866 corpsource = "Univ. Texas, Austin, TX, USA", 9867 keywords = "Euclidean algorithm; greatest common divisor; inductive assertion method; integers; multipliers; number theory; proof of algorithms", 9868 treatment = "P Practical", 9869 } 9870 9871 @Article{Pager:1973:PCC, 9872 author = "David Pager", 9873 title = "On the Problem of Communicating Complex Information", 9874 journal = j-CACM, 9875 volume = "16", 9876 number = "5", 9877 pages = "275--281", 9878 month = may, 9879 year = "1973", 9880 CODEN = "CACMA2", 9881 ISSN = "0001-0782", 9882 bibdate = "Tue Mar 25 13:26:09 MST 1997", 9883 bibsource = "Compendex database", 9884 abstract = "The nature of the difficulty involved in communicating mathematical results between scientists using a computer based information retrieval system is examined. The problem is analyzed in terms of psychological and information-processing processes, and what turns out to be a vicious circle of effects is described. The paper then considers how the presentation of information by a computer-based information retrieval system, or by other media, can be improved. Some trade-offs which affect the design of the presentation are mentioned, and a number of ideas for improvement are described. These include ways of augmenting written language by various notational and linguistic devices, the exhibition of the structure inherent in the information the authors are communicating, and a sophisticated interactive system controlled by computer.", 9885 acknowledgement = ack-nhfb, 9886 classcodes = "C7250 (Information storage and retrieval)", 9887 classification = "723; 901", 9888 corpsource = "Univ. Hawaii, Honolulu, HI, USA", 9889 journalabr = "Commun ACM", 9890 keywords = "communication; complex information; computer based information retrieval; computers --- Data Communication Systems; information; information retrieval systems; information science --- Information Retrieval; interactive system; language; mathematics; proof; psychology; system", 9891 treatment = "P Practical", 9892 } 9893 9894 @Article{Low:1973:PQE, 9895 author = "David W. Low", 9896 title = "Programming by Questionnaire: an Effective Way to Use Decision Tables", 9897 journal = j-CACM, 9898 volume = "16", 9899 number = "5", 9900 pages = "282--286", 9901 month = may, 9902 year = "1973", 9903 CODEN = "CACMA2", 9904 ISSN = "0001-0782", 9905 bibdate = "Tue Mar 25 13:26:09 MST 1997", 9906 bibsource = "Compendex database", 9907 abstract = "Programming by questionnaire combines aspects of decision table programming and general purpose programming by using decision tables to construct an application program through the selection of certain source statements from a predefined file. It is proposed that programming by questionnaire is a useful compromise between general and special purpose programming for a significant class of large scale problems. The elements of the approach are discussed and an existing application is described.", 9908 acknowledgement = ack-nhfb, 9909 classcodes = "C6110 (Systems analysis and programming)", 9910 classification = "723", 9911 corpsource = "IBM Corp., Los Angeles, CA, USA", 9912 journalabr = "Commun ACM", 9913 keywords = "automatic program; automatic program generation; computer systems programming; decision tables; generation; productivity; programmer; programming; questionnaire; simulator generation", 9914 treatment = "P Practical", 9915 } 9916 9917 @Article{King:1973:SCU, 9918 author = "P. J. H. King and R. G. Johnson", 9919 title = "Some Comments on the Use of Ambiguous Decision Tables and Their Conversion to Computer Programs", 9920 journal = j-CACM, 9921 volume = "16", 9922 number = "5", 9923 pages = "287--290", 9924 month = may, 9925 year = "1973", 9926 CODEN = "CACMA2", 9927 ISSN = "0001-0782", 9928 bibdate = "Tue Mar 25 13:26:09 MST 1997", 9929 bibsource = "Compendex database", 9930 abstract = "This paper comments upon recently published work on decision table translation using methods similar to rule-mask technique. The applicability of these methods under various possible conventions on overall table meaning is discussed, and it is argued that there is a place both for the multi-rule and the single-rule (or action set) convention in decision table usage.", 9931 acknowledgement = ack-nhfb, 9932 classcodes = "C6110 (Systems analysis and programming)", 9933 classification = "723", 9934 corpsource = "Birbeck Coll., Univ. London, UK", 9935 journalabr = "Commun ACM", 9936 keywords = "computer programs; computer systems programming; conversion; decision tables", 9937 treatment = "P Practical", 9938 } 9939 9940 @Article{Salasin:1973:HSI, 9941 author = "John Salasin", 9942 title = "Hierarchical Storage in Information Retrieval", 9943 journal = j-CACM, 9944 volume = "16", 9945 number = "5", 9946 pages = "291--295", 9947 month = may, 9948 year = "1973", 9949 CODEN = "CACMA2", 9950 ISSN = "0001-0782", 9951 bibdate = "Tue Mar 25 13:26:09 MST 1997", 9952 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Misc/storage.bib and ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib", 9953 abstract = "A probabilistic analysis is employed to determine the effect of hierarchical storage organizations on information retrieval operations. The data storage hardware is assumed to consist of n-levels of linearly connected memory hardware with increasing data access times and increasing data storage capabilities. A system might, for example, consist of fast semiconductor memory, computer core memory, extended core storage, disk memory, and data cells. Equations are derived to predict the effect of such a system on data access times using sequential files, random access files, and structured files employing multiple-hierarchical linked lists.", 9954 acknowledgement = ack-nhfb, 9955 annote = "Simple evaluation of record fetch costs using various accessing sequences.", 9956 classcodes = "C6120 (File organisation); C7250 (Information storage and retrieval)", 9957 classification = "723; 901", 9958 corpsource = "Univ. Minneapolis, MN, USA", 9959 journalabr = "Commun ACM", 9960 keywords = "analysis; analytic; computer operating systems --- Storage Allocation; data access times; file organisation; files; hierarchical storage; information retrieval; information retrieval systems; linked lists; memory hierarchy; performance evaluation; probabilistic; random access; sequential files; structured files", 9961 treatment = "T Theoretical or Mathematical", 9962 } 9963 9964 @Article{Corneil:1973:MEN, 9965 author = "D. G. Corneil and C. C. Gotlieb and Y. M. Lee", 9966 title = "Minimal Event-Node Network of Project Precedence Relations", 9967 journal = j-CACM, 9968 volume = "16", 9969 number = "5", 9970 pages = "296--298", 9971 month = may, 9972 year = "1973", 9973 CODEN = "CACMA2", 9974 ISSN = "0001-0782", 9975 bibdate = "Tue Mar 25 13:26:09 MST 1997", 9976 bibsource = "Compendex database", 9977 abstract = "A procedure for constructing a minimal event-node network to represent a set of precedence relations without parallel activities is presented. A minimal even-node network is an event-node network in which both the number of nodes and the number of arcs are the minima to preserve the given precedence relations. Counterexamples are given to show that the algorithm presented by A. C. Fisher, J. S. Liebman, and G. L. Nemhauser (1968) produces event-node networks which are not minimal. Since our procedure includes the set-covering problem, the time required may grow exponentially with the number of given activities.", 9978 acknowledgement = ack-nhfb, 9979 classcodes = "C7100 (Business and administration)", 9980 classification = "912", 9981 corpsource = "Univ. Toronto, Ont., Canada", 9982 journalabr = "Commun ACM", 9983 keywords = "event node network; event-node network; management science; management sciences; minimal; minimal event-node network; network analysis; operations research; project precedence relations", 9984 treatment = "T Theoretical or Mathematical", 9985 } 9986 9987 @Article{Mercer:1973:AGP, 9988 author = "Andrew Mercer and Azriel Rosenfeld", 9989 title = "An array grammar programming system", 9990 journal = j-CACM, 9991 volume = "16", 9992 number = "5", 9993 pages = "299--305", 9994 month = may, 9995 year = "1973", 9996 CODEN = "CACMA2", 9997 ISSN = "0001-0782", 9998 bibdate = "Tue Mar 25 13:26:09 MST 1997", 9999 bibsource = "Compendex database", 10000 abstract = "A package of Fortran programs has been developed that permits a user to interactively design and test array grammars. The user can control the rule selection procedure in a derivation or parse, using weighted programming matrices; he also has a choice of instance selection schemes (raster, random, parallel). Examples are given involving array languages consisting of simple geometrical patterns, as well as a language of ``neuron pictures.''", 10001 acknowledgement = ack-nhfb, 10002 classcodes = "C4210 (Formal logic); C7430 (Computer engineering)", 10003 classification = "721; 723", 10004 corpsource = "Kappa Systems Inc., Arlington, VA, USA", 10005 journalabr = "Commun ACM", 10006 keywords = "array grammar; array grammars; automata theory --- Grammars; automatic testing; CAD; computer graphics; computer programming languages; computer-aided design; Fortran programs; grammars; interactively; picture grammars; programming system; test", 10007 treatment = "A Application; T Theoretical or Mathematical", 10008 } 10009 10010 @Article{Reingold:1973:NLM, 10011 author = "Edward M. Reingold", 10012 title = "A Nonrecursive List Moving Algorithm", 10013 journal = j-CACM, 10014 volume = "16", 10015 number = "5", 10016 pages = "305--307", 10017 month = may, 10018 year = "1973", 10019 CODEN = "CACMA2", 10020 ISSN = "0001-0782", 10021 bibdate = "Tue Mar 25 13:26:09 MST 1997", 10022 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Compiler/garbage.collection.bib", 10023 abstract = "An efficient, nonrecursive algorithm is given for moving any LIST-type list. In particular, the algorithm requires no storage other than the new nodes into which the list is to be moved, and no additional bits per node for marking; the algorithm runs in time proportional to the number of nodes in the list. The original list structure is destroyed as it is moved.", 10024 acknowledgement = ack-nhfb, 10025 classcodes = "C6130 (Data handling techniques)", 10026 classification = "723", 10027 corpsource = "Univ. Illinois, Urbana-Champaign, IL, USA", 10028 journalabr = "Commun ACM", 10029 keywords = "computer programming --- Subroutines; computer programming languages; computer programming languages --- lisp; garbage collection; LISP; list moving; list processing; nonrecursive algorithm; storage management", 10030 treatment = "P Practical", 10031 } 10032 10033 @Article{Vos:1973:CWF, 10034 author = "H. Vos", 10035 title = "Coulomb wave functions", 10036 journal = j-CACM, 10037 volume = "16", 10038 number = "5", 10039 pages = "308--309", 10040 month = may, 10041 year = "1973", 10042 CODEN = "CACMA2", 10043 ISSN = "0001-0782", 10044 bibdate = "Tue Mar 25 13:26:09 MST 1997", 10045 acknowledgement = ack-nhfb, 10046 classcodes = "B0290D (Functional analysis); C4120 (Functional analysis); C7310 (Mathematics computing)", 10047 corpsource = "Vrije Univ., Amsterdam, Netherlands", 10048 keywords = "Coulomb wave functions; function evaluation; mathematics; wave functions", 10049 treatment = "A Application; T Theoretical or Mathematical", 10050 } 10051 10052 @Article{Bayer:1973:M, 10053 author = "G. Bayer", 10054 title = "Maxflow", 10055 journal = j-CACM, 10056 volume = "16", 10057 number = "5", 10058 pages = "309--309", 10059 month = may, 10060 year = "1973", 10061 CODEN = "CACMA2", 10062 ISSN = "0001-0782", 10063 bibdate = "Tue Mar 25 13:26:09 MST 1997", 10064 acknowledgement = ack-nhfb, 10065 classcodes = "C7300 (Natural sciences computing)", 10066 corpsource = "Tech. Univ., Braunschweig, West Germany", 10067 keywords = "arcs; flows; input parameters; maxflow; network; network analysis", 10068 treatment = "T Theoretical or Mathematical", 10069 } 10070 10071 @Article{Holmgren:1973:MAL, 10072 author = "B. Holmgren and A. Kolm and D. Obradovic", 10073 title = "Minit algorithm for linear programming", 10074 journal = j-CACM, 10075 volume = "16", 10076 number = "5", 10077 pages = "310--310", 10078 month = may, 10079 year = "1973", 10080 CODEN = "CACMA2", 10081 ISSN = "0001-0782", 10082 bibdate = "Tue Mar 25 13:26:09 MST 1997", 10083 acknowledgement = ack-nhfb, 10084 classcodes = "B0260 (Optimisation techniques); C1180 (Optimisation techniques); C7310 (Mathematics computing)", 10085 corpsource = "ASEA, Vasteras, Sweden", 10086 keywords = "linear programming; minit algorithm", 10087 treatment = "T Theoretical or Mathematical", 10088 } 10089 10090 @Article{Obradovic:1973:MAL, 10091 author = "D. Obradovic", 10092 title = "Minit algorithm for linear programming", 10093 journal = j-CACM, 10094 volume = "16", 10095 number = "5", 10096 pages = "310--310", 10097 month = may, 10098 year = "1973", 10099 CODEN = "CACMA2", 10100 ISSN = "0001-0782", 10101 bibdate = "Tue Mar 25 13:26:09 MST 1997", 10102 acknowledgement = ack-nhfb, 10103 classcodes = "B0260 (Optimisation techniques); C1180 (Optimisation techniques); C7310 (Mathematics computing)", 10104 corpsource = "Boris Kidric Inst. Nuclear Sci., Beograd, Yugoslavia", 10105 keywords = "linear programming; mini algorithm", 10106 treatment = "P Practical", 10107 } 10108 10109 @Article{Howell:1973:ESL, 10110 author = "J. A. Howell", 10111 title = "Exact solution of linear equations using residue arithmetic", 10112 journal = j-CACM, 10113 volume = "16", 10114 number = "5", 10115 pages = "311--311", 10116 month = may, 10117 year = "1973", 10118 CODEN = "CACMA2", 10119 ISSN = "0001-0782", 10120 bibdate = "Tue Mar 25 13:26:09 MST 1997", 10121 acknowledgement = ack-nhfb, 10122 classcodes = "B0290H (Linear algebra); C4140 (Linear algebra); C5230 (Digital arithmetic methods); C7310 (Mathematics computing)", 10123 corpsource = "Yale Univ., New Haven, CT, USA", 10124 keywords = "digital arithmetic; exact solution; inversion; linear algebra; linear equations; matrix; mixed radix conversion; modulus; prime number; residue arithmetic", 10125 treatment = "P Practical", 10126 } 10127 10128 @Article{Sale:1973:SMP, 10129 author = "A. H. J. Sale", 10130 title = "A sparse matrix package", 10131 journal = j-CACM, 10132 volume = "16", 10133 number = "5", 10134 pages = "311--311", 10135 month = may, 10136 year = "1973", 10137 CODEN = "CACMA2", 10138 ISSN = "0001-0782", 10139 bibdate = "Tue Mar 25 13:26:09 MST 1997", 10140 acknowledgement = ack-nhfb, 10141 classcodes = "B0290H (Linear algebra); C4140 (Linear algebra); C7310 (Mathematics computing)", 10142 corpsource = "Univ. Sydney, NSW, Australia", 10143 keywords = "algorithm; matrix algebra; sparse matrix package", 10144 treatment = "P Practical", 10145 } 10146 10147 @Article{Wheeler:1973:IEQ, 10148 author = "R. E. Wheeler", 10149 title = "Increasing the efficiency of quicksort", 10150 journal = j-CACM, 10151 volume = "16", 10152 number = "5", 10153 pages = "311--311", 10154 month = may, 10155 year = "1973", 10156 CODEN = "CACMA2", 10157 ISSN = "0001-0782", 10158 bibdate = "Tue Mar 25 13:26:09 MST 1997", 10159 acknowledgement = ack-nhfb, 10160 classcodes = "C6130 (Data handling techniques)", 10161 corpsource = "E. I. du Pont Nemours and Co., Wilmington, DE, USA", 10162 keywords = "efficiency; quicksort; sorting", 10163 treatment = "P Practical", 10164 } 10165 10166 @Article{Roy:1973:RPR, 10167 author = "M. K. Roy", 10168 title = "Reflection-free permutations, rosary permutations and adjacent transposition algorithms", 10169 journal = j-CACM, 10170 volume = "16", 10171 number = "5", 10172 pages = "312--312", 10173 month = may, 10174 year = "1973", 10175 CODEN = "CACMA2", 10176 ISSN = "0001-0782", 10177 bibdate = "Tue Mar 25 13:26:09 MST 1997", 10178 acknowledgement = ack-nhfb, 10179 classcodes = "B0250 (Combinatorial mathematics); C1160 (Combinatorial mathematics)", 10180 corpsource = "Jadavpur Univ., Calcutta, India", 10181 keywords = "adjacent transposition algorithms; combinatorial analysis; combinatorial mathematics; permutation; reflection free; rosary", 10182 treatment = "T Theoretical or Mathematical", 10183 } 10184 10185 @Article{McMorrow:1973:CMC, 10186 author = "C. H. McMorrow", 10187 title = "Concerning music and computer composition in computational linguistics", 10188 journal = j-CACM, 10189 volume = "16", 10190 number = "5", 10191 pages = "313--313", 10192 month = may, 10193 year = "1973", 10194 CODEN = "CACMA2", 10195 ISSN = "0001-0782", 10196 bibdate = "Tue Mar 25 13:26:09 MST 1997", 10197 acknowledgement = ack-nhfb, 10198 classcodes = "C7820 (Humanities computing)", 10199 corpsource = "Eagle Signal Corp., Davenport, IA, USA", 10200 keywords = "computational linguistics; computer composition; humanities; music", 10201 treatment = "G General Review", 10202 } 10203 10204 @Article{Wexelblat:1973:ACC, 10205 author = "R. L. Wexelblat", 10206 title = "Another comment on computer music", 10207 journal = j-CACM, 10208 volume = "16", 10209 number = "5", 10210 pages = "313--314", 10211 month = may, 10212 year = "1973", 10213 CODEN = "CACMA2", 10214 ISSN = "0001-0782", 10215 bibdate = "Tue Mar 25 13:26:09 MST 1997", 10216 acknowledgement = ack-nhfb, 10217 classcodes = "C7820 (Humanities computing)", 10218 corpsource = "Bell Labs., Holmdel, NJ, USA", 10219 keywords = "composer; computer music; humanities; musical taste; value judgment", 10220 treatment = "G General Review", 10221 } 10222 10223 @Article{Estell:1973:CPA, 10224 author = "R. G. Estell", 10225 title = "A comment on the practical aspects of computer science education", 10226 journal = j-CACM, 10227 volume = "16", 10228 number = "5", 10229 pages = "314--315", 10230 month = may, 10231 year = "1973", 10232 CODEN = "CACMA2", 10233 ISSN = "0001-0782", 10234 bibdate = "Tue Mar 25 13:26:09 MST 1997", 10235 acknowledgement = ack-nhfb, 10236 classcodes = "C0220 (Computing education and training)", 10237 keywords = "computer science education; curriculum; digital computers; education", 10238 treatment = "G General Review; P Practical", 10239 } 10240 10241 @Article{Fajman:1973:WIT, 10242 author = "Roger Fajman and John Borgelt", 10243 title = "{WYLBUR}, An Interactive Text Editing and Remote Job Entry System", 10244 journal = j-CACM, 10245 volume = "16", 10246 number = "5", 10247 pages = "314--322", 10248 month = may, 10249 year = "1973", 10250 CODEN = "CACMA2", 10251 ISSN = "0001-0782", 10252 bibdate = "Tue Mar 25 13:26:09 MST 1997", 10253 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/os.bib", 10254 abstract = "WYLBUR is a comprehensive system for manipulating all kinds of text, such as computer programs, letters, and manuscripts, using typewriter terminals connected to a computer. It has facilities for remote job entry and retrieval as well as facilities for text alignment and justification. A powerful method for addressing text by content is provided. This paper describes the external appearance of WYLBUR as well as its internal structure. A short description of the major features of ORVYL, a general purpose time-sharing system which operates in conjunction with WYLBUR, is also included.", 10255 acknowledgement = ack-nhfb, 10256 classcodes = "C6130 (Data handling techniques); C6150J (Operating systems)", 10257 classification = "723", 10258 corpsource = "Stanford Univ., CA, USA", 10259 journalabr = "Commun ACM", 10260 keywords = "addressing; computer systems programming; content; content addressing; data entry; data handling; data processing; document preparation; interactive text editing; ORVYL; remote; remote job entry; remote job retrieval; terminal; text editing", 10261 treatment = "P Practical", 10262 } 10263 10264 @Article{Frailey:1973:PAM, 10265 author = "Dennis J. Frailey", 10266 title = "A Practical Approach to Managing Resources and Avoiding Deadlocks", 10267 journal = j-CACM, 10268 volume = "16", 10269 number = "5", 10270 pages = "323--329", 10271 month = may, 10272 year = "1973", 10273 CODEN = "CACMA2", 10274 ISSN = "0001-0782", 10275 bibdate = "Tue Mar 25 13:26:09 MST 1997", 10276 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib", 10277 abstract = "Resource scheduling and allocation can be expensive with regard to time and space in multiprogramming or time-sharing environments involving large numbers of tasks and resources with conflicting requirements. \par Detection and\slash or prevention of deadlocks can require massive amounts of additional overhead if efficient usage of resources is to be maintained. A resource management program is described which uses linked lists along with other techniques to overcome a large portion of this overhead. The program, which is currently running as part of a large scale general purpose operating system, keeps resources relatively active but does not detect or prevent all deadlocks in its implemented state. Certain changes, which would permit more comprehensive levels of deadlock prevention\slash detection at additional cost, have not been incorporated in the running system due to the infrequency of deadlock situations.", 10278 acknowledgement = ack-nhfb, 10279 annote = "Description of a limited implementation and good overview.", 10280 classcodes = "C6150J (Operating systems)", 10281 classification = "723", 10282 corpsource = "Southern Methodist Univ., Dallas, TX, USA", 10283 journalabr = "Commun ACM", 10284 keywords = "(computers); allocation; computer systems programming; deadlock; deadly embrace; file organisation; multiprocessing; multiprogramming; operating systems; resource; resource allocation; resource management; resource scheduling; scheduling; storage allocation; time sharing; time-sharing; time-sharing programs", 10285 treatment = "P Practical", 10286 } 10287 10288 @Article{Hamlet:1973:EMR, 10289 author = "R. G. Hamlet", 10290 title = "Efficient multiprogramming resource allocation and accounting", 10291 journal = j-CACM, 10292 volume = "16", 10293 number = "6", 10294 pages = "337--342", 10295 month = jun, 10296 year = "1973", 10297 CODEN = "CACMA2", 10298 ISSN = "0001-0782", 10299 bibdate = "Tue Mar 25 13:26:09 MST 1997", 10300 acknowledgement = ack-nhfb, 10301 classcodes = "C6120 (File organisation); C6150J (Operating systems)", 10302 corpsource = "Univ. Maryland, Baltimore, MD, USA", 10303 keywords = "accounting; efficient; executive; memory; monitor; multiprogramming; resource allocation; storage allocation", 10304 treatment = "P Practical", 10305 } 10306 10307 @Article{Gelenbe:1973:MWS, 10308 author = "E. Gelenbe and J. C. A. Boekhorst and J. L. W. Kessels", 10309 title = "Minimizing wasted space in partitioned segmentation", 10310 journal = j-CACM, 10311 volume = "16", 10312 number = "6", 10313 pages = "343--349", 10314 month = jun, 10315 year = "1973", 10316 CODEN = "CACMA2", 10317 ISSN = "0001-0782", 10318 bibdate = "Tue Mar 25 13:26:09 MST 1997", 10319 acknowledgement = ack-nhfb, 10320 classcodes = "C6120 (File organisation); C6150J (Operating systems)", 10321 corpsource = "Univ. Michigan, Ann Arbor, MI, USA", 10322 keywords = "algorithms; dynamic storage allocation; file organisation; fragmentation; multiple; page sizes; paged virtual memory; partitioned segmentation; storage allocation; storage management; system; wasted space", 10323 treatment = "P Practical", 10324 } 10325 10326 @Article{Hill:1973:SPM, 10327 author = "J. C. Hill", 10328 title = "Synchronizing processors with memory-content-generated interrupts", 10329 journal = j-CACM, 10330 volume = "16", 10331 number = "6", 10332 pages = "350--351", 10333 month = jun, 10334 year = "1973", 10335 CODEN = "CACMA2", 10336 ISSN = "0001-0782", 10337 bibdate = "Tue Mar 25 13:26:09 MST 1997", 10338 acknowledgement = ack-nhfb, 10339 classcodes = "C6150J (Operating systems)", 10340 corpsource = "Univ. California, Livermore, CA, USA", 10341 keywords = "associative memories; debugging; interrupts; microprogramming; monitors; multiprocessing programs; multiprocessor; parallel processing; supervisors; synchronisation; synchronizing processors", 10342 treatment = "P Practical", 10343 } 10344 10345 @Article{Stone:1973:NOS, 10346 author = "Harold S. Stone and Samuel F. Fuller", 10347 title = "On the Near-Optimality of the Shortest-Latency-Time-First Drum Scheduling Discipline", 10348 journal = j-CACM, 10349 volume = "16", 10350 number = "6", 10351 pages = "352--353", 10352 month = jun, 10353 year = "1973", 10354 CODEN = "CACMA2", 10355 ISSN = "0001-0782", 10356 bibdate = "Tue Mar 25 13:26:09 MST 1997", 10357 bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib", 10358 note = "Also published in/as: Technical Note No.12, DSL.", 10359 acknowledgement = ack-nhfb, 10360 classcodes = "C6120 (File organisation)", 10361 corpsource = "Stanford Univ., CA, USA", 10362 keywords = "computer systems; drum scheduling discipline; file organisation; latency scheduling; minimal; shortest latency time first; storage allocation; storage management", 10363 treatment = "T Theoretical or Mathematical", 10364 } 10365 10366 @Article{Stockhausen:1973:AOC, 10367 author = "P. F. Stockhausen", 10368 title = "Adapting optimal code generation for arithmetic expressions to the instruction sets available on present-day computers", 10369 journal = j-CACM, 10370 volume = "16", 10371 number = "6", 10372 pages = "353--354", 10373 month = jun, 10374 year = "1973", 10375 CODEN = "CACMA2", 10376 ISSN = "0001-0782", 10377 bibdate = "Tue Mar 25 13:26:09 MST 1997", 10378 acknowledgement = ack-nhfb, 10379 classcodes = "C5230 (Digital arithmetic methods)", 10380 corpsource = "Bell Labs., Murray Hill., NJ, USA", 10381 keywords = "arithmetic expressions; codes; digital arithmetic; instruction; optimal code generation; sets", 10382 treatment = "P Practical", 10383 } 10384 10385 @Article{Ling:1973:CGA, 10386 author = "R. F. Ling", 10387 title = "A computer generated aid for cluster analysis", 10388 journal = j-CACM, 10389 volume = "16", 10390 number = "6", 10391 pages = "355--361", 10392 month = jun, 10393 year = "1973", 10394 CODEN = "CACMA2", 10395 ISSN = "0001-0782", 10396 bibdate = "Tue Mar 25 13:26:09 MST 1997", 10397 acknowledgement = ack-nhfb, 10398 classcodes = "C5530 (Pattern recognition and computer vision equipment); C5540 (Terminals and graphic displays)", 10399 corpsource = "Univ. Chicago, IL, USA", 10400 keywords = "cluster analysis; computer aided analysis; computer graphics; factor analysis; hierarchical clustering; numerical taxonomy; pattern; recognition", 10401 treatment = "P Practical", 10402 } 10403 10404 @Article{Shneiderman:1973:ODB, 10405 author = "Ben Shneiderman", 10406 title = "Optimum Data Base Reorganization Points", 10407 journal = j-CACM, 10408 volume = "16", 10409 number = "6", 10410 pages = "362--365", 10411 month = jun, 10412 year = "1973", 10413 CODEN = "CACMA2", 10414 ISSN = "0001-0782", 10415 bibdate = "Tue Mar 25 13:26:09 MST 1997", 10416 bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib", 10417 acknowledgement = ack-nhfb, 10418 annote = "Criteria for file reorganization", 10419 classcodes = "C6120 (File organisation)", 10420 corpsource = "State Univ. New York, Stony Brook, NY, USA", 10421 keywords = "cost per access; data base; file organisation; files; information retrieval; optimum; reorganization; strategies", 10422 treatment = "P Practical", 10423 } 10424 10425 @Article{Strunz:1973:DDT, 10426 author = "H. Strunz", 10427 title = "The development of decision tables via parsing of complex decision situations", 10428 journal = j-CACM, 10429 volume = "16", 10430 number = "6", 10431 pages = "366--369", 10432 month = jun, 10433 year = "1973", 10434 CODEN = "CACMA2", 10435 ISSN = "0001-0782", 10436 bibdate = "Tue Mar 25 13:26:09 MST 1997", 10437 acknowledgement = ack-nhfb, 10438 classcodes = "C6110 (Systems analysis and programming)", 10439 corpsource = "Mathematischer Beratungs- and Programmierungsdienst GmbH, Cologne, West Germany", 10440 keywords = "decision grid chart; decision tables; development; parsing; problem analysis", 10441 treatment = "P Practical", 10442 } 10443 10444 @Article{Bell:1973:TC, 10445 author = "James R. Bell", 10446 title = "Threaded Code", 10447 journal = j-CACM, 10448 volume = "16", 10449 number = "6", 10450 pages = "370--372", 10451 month = jun, 10452 year = "1973", 10453 CODEN = "CACMA2", 10454 ISSN = "0001-0782", 10455 bibdate = "Tue Mar 25 13:26:09 MST 1997", 10456 abstract = "The concept of ``threaded code'' is presented as an alternative to machine language code. Hardware and software realizations of it are given. In software it is realized as interpretive code not needing an interpreter. Extensions and optimizations are mentioned.", 10457 acknowledgement = ack-nhfb, 10458 classcodes = "C5220 (Computer architecture); C6110 (Systems analysis and programming); C6140B (Machine-oriented languages)", 10459 corpsource = "Digital Equipment Corp., Maynard, MA, USA", 10460 keywords = "code; compiled code; hardware; interpreter; machine; machine code; machine oriented languages; microprogramming; programming; software; space tradeoff; subroutine calls; threaded code; time tradeoff", 10461 treatment = "P Practical", 10462 } 10463 10464 @Article{Hopcroft:1973:AAE, 10465 author = "J. Hopcroft and R. Tarjan", 10466 title = "{ACM} Algorithm 447: Efficient Algorithms for Graph Manipulation", 10467 journal = j-CACM, 10468 volume = "16", 10469 number = "6", 10470 pages = "372--378", 10471 month = jun, 10472 year = "1973", 10473 CODEN = "CACMA2", 10474 ISSN = "0001-0782", 10475 bibdate = "Tue Mar 25 13:26:09 MST 1997", 10476 bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Parallel/Multi.bib", 10477 acknowledgement = ack-nhfb, 10478 classcodes = "C7310 (Mathematics computing)", 10479 corpsource = "Cornell Univ., Ithaca, NY, USA", 10480 keywords = "ALGOL; algorithms; graph manipulation; graph theory; mathematics; partitioning; subroutines", 10481 treatment = "P Practical", 10482 } 10483 10484 @Article{Beyer:1973:AAN, 10485 author = "T. Beyer and D. F. Swinehart", 10486 title = "{ACM} Algorithm 448: Number of Multiply-Restricted Partitions", 10487 journal = j-CACM, 10488 volume = "16", 10489 number = "6", 10490 pages = "379--379", 10491 month = jun, 10492 year = "1973", 10493 CODEN = "CACMA2", 10494 ISSN = "0001-0782", 10495 bibdate = "Tue Mar 25 13:26:09 MST 1997", 10496 acknowledgement = ack-nhfb, 10497 classcodes = "C5230 (Digital arithmetic methods)", 10498 corpsource = "Univ. Oregon, Eugene, OR, USA", 10499 keywords = "change making; digital arithmetic; enumeration; FORTRAN; multiply restricted partitions; positive integer; subroutine; subroutines", 10500 treatment = "P Practical", 10501 } 10502 10503 @Article{Ferguson:1973:LSP, 10504 author = "J. Ferguson and P. A. Staley", 10505 title = "Least squares piecewise cubic curve fitting", 10506 journal = j-CACM, 10507 volume = "16", 10508 number = "6", 10509 pages = "380--382", 10510 month = jun, 10511 year = "1973", 10512 CODEN = "CACMA2", 10513 ISSN = "0001-0782", 10514 MRclass = "65D10", 10515 MRnumber = "50 15267", 10516 mrreviewer = "Bernard H. Rosman", 10517 bibdate = "Tue Mar 25 13:26:09 MST 1997", 10518 abstract = "The matrices involved in a linear least squares formulation are determined for the problem of fitting piecewise cubic functions, those possessing a continuous derivative, to arrays of planar data.", 10519 acknowledgement = ack-nhfb, 10520 classcodes = "B0290F (Interpolation and function approximation); C4130 (Interpolation and function approximation)", 10521 corpsource = "Teledyne Ryan Aeronaut. Co., San Diego, CA, USA", 10522 keywords = "approximation splines; curve fitting; data; data reduction; data reduction and analysis; function approximation; least; least squares; piecewise cubic; reduction; squares approximations", 10523 treatment = "T Theoretical or Mathematical", 10524 } 10525 10526 @Article{Hoskins:1973:CSS, 10527 author = "W. D. Hoskins", 10528 title = "Cubic spline solutions to fourth-order boundary value problems", 10529 journal = j-CACM, 10530 volume = "16", 10531 number = "6", 10532 pages = "382--385", 10533 month = jun, 10534 year = "1973", 10535 CODEN = "CACMA2", 10536 ISSN = "0001-0782", 10537 MRclass = "65L10", 10538 MRnumber = "58 31861", 10539 bibdate = "Tue Mar 25 13:26:09 MST 1997", 10540 abstract = "The cubic spline approximation to the fourth-order differential equation $y''''+p(x)y''+q(x)y'+r(x)y=t(x)$ is shown to reduce to the solution of a five-term recurrence relationship. For some special cases the approximation is shown to be simply related to a finite difference representation with a local truncation error of order $(y/720)\delta^8$.", 10541 acknowledgement = ack-nhfb, 10542 classcodes = "B0290F (Interpolation and function approximation); B0290P (Differential equations); C4130 (Interpolation and function approximation); C4170 (Differential equations)", 10543 corpsource = "Univ. Manitoba, Winnipeg, Man., Canada", 10544 keywords = "(mathematics); boundary value problem; boundary value problems; boundary-value problems; cubic spline; differential; differential equations; equations; fourth order; splines", 10545 treatment = "T Theoretical or Mathematical", 10546 } 10547 10548 @Article{Alt:1973:CPT, 10549 author = "Franz L. Alt and Judith Yuni Kirk", 10550 title = "Computer Photocomposition of Technical Text", 10551 journal = j-CACM, 10552 volume = "16", 10553 number = "6", 10554 pages = "386--391", 10555 month = jun, 10556 year = "1973", 10557 CODEN = "CACMA2", 10558 ISSN = "0001-0782", 10559 bibdate = "Tue Mar 25 13:26:09 MST 1997", 10560 note = "Describes the typesetting system used by the American Institute of Physics.", 10561 abstract = "In computer assisted typesetting by means of photocomposition, special problems arise in highly technical material such as mathematical formulas. New solutions to several of these problems have been devised in the information system of the American Institute of Physics. They include: the representation of special characters (foreign alphabets, mathematical symbols, etc.) not available on input keyboards or on the photocomposer; the generation of such symbols, e.g. by overprinting; the precise positioning of accent marks (floating diacritics); line breaks, i.e. words or formulas placed partly at the end of one line and partly at the beginning of the next; and certain aspects of error correction.", 10562 acknowledgement = ack-nhfb, 10563 classcodes = "C7230 (Publishing and reproduction)", 10564 corpsource = "American Inst. Phys., New York, NY, USA", 10565 keywords = "computer; computer controlled typesetting; graphics; photocomposition; printing; technical text; text processing; typesetting", 10566 treatment = "P Practical", 10567 } 10568 10569 @Article{Nolan:1973:MCR, 10570 author = "Richard L. Nolan", 10571 title = "Managing the Computer Resource: Stage Hypothesis", 10572 journal = j-CACM, 10573 volume = "16", 10574 number = "7", 10575 pages = "399--405", 10576 month = jul, 10577 year = "1973", 10578 CODEN = "CACMA2", 10579 ISSN = "0001-0782", 10580 bibdate = "Tue Mar 25 13:26:09 MST 1997", 10581 bibsource = "Compendex database", 10582 abstract = "Based on the study of expenditures for data processing, a descriptive stage hypothesis is presented. It is suggested that the planning, organizing, and controlling activities associated with managing the computer resource will change in character over a period of time, and will evolve in patterns roughly correlated to four stages of the computer budget: Stage I (computer acquisition), Stage II (intense system development), Stage III (proliferation of controls), and Stage IV (user\slash service orientation). Each stage is described and related to individual tasks for managing the computer resource.", 10583 acknowledgement = ack-nhfb, 10584 classcodes = "C0310 (EDP management)", 10585 classification = "723", 10586 corpsource = "Harvard Univ. Cambridge, MA, USA", 10587 journalabr = "Commun ACM", 10588 keywords = "computer; computer budget; computer expenditures; computer management; computer resource; control; data processing; data processing, business; economics; management; organizing; planning; resource; stage hypothesis", 10589 treatment = "E Economic", 10590 xxtitle = "Managing the computer resource: a stage hypothesis", 10591 } 10592 10593 @Article{Huang:1973:NIO, 10594 author = "J. C. Huang", 10595 title = "A Note on Information Organization and Storage", 10596 journal = j-CACM, 10597 volume = "16", 10598 number = "7", 10599 pages = "406--410", 10600 month = jul, 10601 year = "1973", 10602 CODEN = "CACMA2", 10603 ISSN = "0001-0782", 10604 MRclass = "68A50", 10605 MRnumber = "55 13900", 10606 bibdate = "Tue Mar 25 13:26:09 MST 1997", 10607 bibsource = "Compendex database", 10608 abstract = "Since the logical structure of a data base can be represented by a tree or graph, it is quite natural for us to view the process of designing a data base as that of constructing a tree or a graph. \par A general method for constructing such a tree or a graph is provided. There are three important elements in this general construction method; namely, a set of binary relations, an algorithm for constructing subsets of a set, and an algorithm for selecting an element from the given set of objects. The use of different relations and algorithms results in different information structures, as list, tree, ring, etc. Thus the problem of information organization and storage is reduced to that of defining relations and formulating algorithms under a given set of constraints. \par The results presented may be valuable to designers as useful design concepts, and may serve as a basis for developing a formal theory on the subject.", 10609 acknowledgement = ack-nhfb, 10610 classcodes = "C6120 (File organisation)", 10611 classification = "723; 901; 921", 10612 corpsource = "Univ. Houston, TX, USA", 10613 journalabr = "Commun ACM", 10614 keywords = "(mathematical); data base; data-base management; file organisation; file organization; graph; graph theory; information; information retrieval; information retrieval systems; information structure; management; mathematical techniques --- Graph Theory; storage allocation; structure; tree; trees", 10615 treatment = "T Theoretical or Mathematical", 10616 } 10617 10618 @Article{Kozdrowicki:1973:CIC, 10619 author = "Edward W. Kozdrowicki and Dennis W. Cooper", 10620 title = "{COKO III}: the {Cooper-Koz} Chess Program", 10621 journal = j-CACM, 10622 volume = "16", 10623 number = "7", 10624 pages = "411--427 (or 411--426??)", 10625 month = jul, 10626 year = "1973", 10627 CODEN = "CACMA2", 10628 ISSN = "0001-0782", 10629 bibdate = "Tue Mar 25 13:26:09 MST 1997", 10630 bibsource = "Compendex database", 10631 abstract = "COKO III is a chess player written entirely in Fortran. On the IBM 360-65, COKO III plays a minimal chess game at the rate of. 2 sec cpu time per move, with a level close to lower chess club play. A selective tree searching procedure controlled by tactical chess logistics allows a deployment of multiple minimal game calculations to achieve some optimal move selection. In addition, an interesting phenomenon called a tree searching catastrophe has plagued COKO's entire development just as it troubles a human player. Standard exponential growth is curbed to a large extent by the definition and trimming of the Fischer set. Representation of the chess environment is described along with a strategic preanalysis procedure that maps the Lasker regions. Specific chess algorithms are described which could be used as a command structure by anyone desiring to do some chess program experimentation. A comparison is made of some mysterious actions of human players and COKO III.", 10632 acknowledgement = ack-nhfb, 10633 classcodes = "C1230 (Artificial intelligence); C7810 (Social and behavioural sciences computing)", 10634 classification = "723", 10635 corpsource = "Univ. California, Davis, CA, USA", 10636 journalabr = "Commun ACM", 10637 keywords = "artificial intelligence; chess program; COKO III; computer systems programming; FORTRAN; games of skill; heuristic programming; minimal chess game; selective searching; tree searching", 10638 treatment = "A Application", 10639 } 10640 10641 @Article{Howard:1973:MSD, 10642 author = "John H. {Howard, Jr.}", 10643 title = "Mixed Solutions for the Deadlock Problem", 10644 journal = j-CACM, 10645 volume = "16", 10646 number = "7", 10647 pages = "427--430", 10648 month = jul, 10649 year = "1973", 10650 CODEN = "CACMA2", 10651 ISSN = "0001-0782", 10652 bibdate = "Tue Mar 25 13:26:09 MST 1997", 10653 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Parallel/Multi.bib", 10654 abstract = "Mixtures of detection, avoidance, and prevention provide more effective and practical solutions to the deadlock problem than any one of these alone. The individual techniques can be tailored for subproblems of resource allocation and still operate together to prevent deadlocks. This paper presents a method, based on the concept of the hierarchical operating system, for constructing appropriate mixtures and suggests appropriate subsystems for the most frequently occurring resource allocation problems.", 10655 acknowledgement = ack-nhfb, 10656 classcodes = "C6150J (Operating systems)", 10657 classification = "723", 10658 corpsource = "Univ. Texas, Austin, TX, USA", 10659 journalabr = "Commun ACM", 10660 keywords = "computer operating systems; computer systems programming --- Multiprogramming; deadlock problem; deadlocks; hierarchical systems; mixed solutions; multiprogramming; operating systems; operating systems (computers); resource allocation", 10661 treatment = "P Practical", 10662 } 10663 10664 @Article{Gelenbe:1973:DPP, 10665 author = "Erol Gelenbe", 10666 title = "Distribution of a Program in Primary and Fast Buffer Storage", 10667 journal = j-CACM, 10668 volume = "16", 10669 number = "7", 10670 pages = "431--434", 10671 month = jul, 10672 year = "1973", 10673 CODEN = "CACMA2", 10674 ISSN = "0001-0782", 10675 bibdate = "Tue Mar 25 13:26:09 MST 1997", 10676 bibsource = "Compendex database", 10677 abstract = "A virtual memory computer system with a fast buffer (cache) memory between primary memory and central processing unit is considered. The optimal distribution of a program between the buffer and primary memory is studied using the program's lifetime function. Expressions for the distribution of a program which maximizes the useful fraction of the cost-time integral of primary and fast buffer storage are obtained for swapping and nonswapping buffer management policies.", 10678 acknowledgement = ack-nhfb, 10679 classcodes = "C6120 (File organisation)", 10680 classification = "723", 10681 journalabr = "Commun ACM", 10682 keywords = "cache; computer systems programming; cost time integral; distribution of a program; fast buffer; function; lifetime; lifetime function; storage; virtual memory; virtual memory computer system; virtual storage", 10683 treatment = "P Practical", 10684 } 10685 10686 @Article{Rosin:1973:TP, 10687 author = "Robert F. Rosin", 10688 title = "Teaching ``About Programming''", 10689 journal = j-CACM, 10690 volume = "16", 10691 number = "7", 10692 pages = "435--439", 10693 month = jul, 10694 year = "1973", 10695 CODEN = "CACMA2", 10696 ISSN = "0001-0782", 10697 bibdate = "Tue Mar 25 13:26:09 MST 1997", 10698 bibsource = "Compendex database", 10699 abstract = "This paper presents the goals and organization of a course about programming designed to provide entering students in a graduate program with a cultural enrichment in their professional lives. The students are expected to have taken at least two programming courses prior to this one and, therefore, to be familiar with at least two programming languages, both as students and users. Teaching someone how to program is similar to teaching him to play a musical instrument: neither skill can be taught-they must be learned. However, the teacher still serves several vital purposes: to present a set of rules for producing well-formed utterances; to offer numerous demonstrations of his own skill; and to function as an involved critic. Finally, the teacher is the source of information about the process in which the student is involved.", 10700 acknowledgement = ack-nhfb, 10701 classcodes = "C0220 (Computing education and training); C6110 (Systems analysis and programming)", 10702 classification = "723", 10703 corpsource = "Univ. Aarhus, Denmark", 10704 journalabr = "Commun ACM", 10705 keywords = "computer systems programming; education; professionalism; programming; programming concepts; teaching", 10706 } 10707 10708 @Article{McFarlan:1973:CRG, 10709 author = "F. Warren McFarlan and Richard L. Nolan", 10710 title = "Curriculum Recommendations for Graduate Professional Programs in Information Systems: Recommended Addendum on Information Systems Administration", 10711 journal = j-CACM, 10712 volume = "16", 10713 number = "7", 10714 pages = "439--442 (or 439--441??)", 10715 month = jul, 10716 year = "1973", 10717 CODEN = "CACMA2", 10718 ISSN = "0001-0782", 10719 bibdate = "Tue Mar 25 13:26:09 MST 1997", 10720 bibsource = "Compendex database", 10721 abstract = "An addendum to the Report of the ACM Curriculum Committee on Computer Education for Management is proposed. The proposed addendum is to include in the curriculum a course on Information Systems administration. It is important for two reasons: (1) the systems designer must understand the administrative framework in which he must operate to work effectively, and (2) an important objective of the curriculum recommendations is to prepare the future manager of the computer activity. \par It is felt that the importance of these two reasons justifies the addition of the recommended course. \par The course is outlined in the format of the original report.", 10722 acknowledgement = ack-nhfb, 10723 classcodes = "C0220 (Computing education and training); C0310 (EDP management); C7100 (Business and administration)", 10724 classification = "723; 901", 10725 corpsource = "Harvard Univ., Cambridge, MA, USA", 10726 journalabr = "Commun ACM", 10727 keywords = "administration; computer management; curriculum recommendations; education; information retrieval systems; information systems; information systems administration; information systems management; management; management information systems", 10728 treatment = "P Practical", 10729 } 10730 10731 @Article{Kandel:1973:CSS, 10732 author = "A. Kandel", 10733 title = "Computer Science --- Seminars for Undergraduates", 10734 journal = j-CACM, 10735 volume = "16", 10736 number = "7", 10737 pages = "442--442", 10738 month = jul, 10739 year = "1973", 10740 CODEN = "CACMA2", 10741 ISSN = "0001-0782", 10742 bibdate = "Tue Mar 25 13:26:09 MST 1997", 10743 acknowledgement = ack-nhfb, 10744 classcodes = "C0220 (Computing education and training)", 10745 corpsource = "New Mexico Inst. Mining Technol., Soccorro., NM, USA", 10746 keywords = "computer science; curriculum; digital computers; education; seminars; undergraduates", 10747 keywords = "computer science; curriculum; education; fuzzy educational structure; imprecise synthesis", 10748 treatment = "G General Review; P Practical", 10749 } 10750 10751 @Article{Bochmann:1973:MEL, 10752 author = "G. V. Bochmann", 10753 title = "Multiple Exits from a Loop Without the {GOTO}", 10754 journal = j-CACM, 10755 volume = "16", 10756 number = "7", 10757 pages = "443--444", 10758 month = jul, 10759 year = "1973", 10760 CODEN = "CACMA2", 10761 ISSN = "0001-0782", 10762 bibdate = "Tue Mar 25 13:26:09 MST 1997", 10763 acknowledgement = ack-nhfb, 10764 classcodes = "C6140 (Programming languages)", 10765 corpsource = "Univ. Montreal, Que., Canada", 10766 keywords = "control structures; exit statement; from loops; goto free programming; multiple exits; multiple exits from loops; programming languages", 10767 treatment = "P Practical", 10768 } 10769 10770 @Article{Hall:1973:EBA, 10771 author = "Patrick A. V. Hall", 10772 title = "Equivalence Between {AND\slash OR} Graphs and Context-Free Grammars", 10773 journal = j-CACM, 10774 volume = "16", 10775 number = "7", 10776 pages = "444--445", 10777 month = jul, 10778 year = "1973", 10779 CODEN = "CACMA2", 10780 ISSN = "0001-0782", 10781 bibdate = "Tue Mar 25 13:26:09 MST 1997", 10782 acknowledgement = ack-nhfb, 10783 classcodes = "C1230 (Artificial intelligence); C4210 (Formal logic)", 10784 corpsource = "City Univ., London, UK", 10785 keywords = "AND/OR graphs; artificial intelligence; context free grammars; context-free grammars; equivalance; graph theory; language theory", 10786 treatment = "T Theoretical or Mathematical", 10787 } 10788 10789 @Article{Fiala:1973:AAS, 10790 author = "F. Fiala", 10791 title = "{ACM} Algorithm 449: Solution of Linear Programming Problems in 0-1 Variables", 10792 journal = j-CACM, 10793 volume = "16", 10794 number = "7", 10795 pages = "445--448 (or 445--447??)", 10796 month = jul, 10797 year = "1973", 10798 CODEN = "CACMA2", 10799 ISSN = "0001-0782", 10800 bibdate = "Tue Mar 25 13:26:09 MST 1997", 10801 acknowledgement = ack-nhfb, 10802 classcodes = "B0260 (Optimisation techniques); C1180 (Optimisation techniques); C7310 (Mathematics computing)", 10803 corpsource = "Univ. Alberta, Edmonton, Alta., Canada", 10804 keywords = "FORTRAN; linear programming; subroutine; subroutines; zero one programming", 10805 treatment = "P Practical", 10806 } 10807 10808 @Article{Kernighan:1973:RAM, 10809 author = "B. W. Kernighan", 10810 title = "Remark on {``Algorithm 422: Minimal Spanning Tree''}", 10811 journal = j-CACM, 10812 volume = "16", 10813 number = "7", 10814 pages = "448--448", 10815 month = jul, 10816 year = "1973", 10817 CODEN = "CACMA2", 10818 ISSN = "0001-0782", 10819 bibdate = "Tue Mar 25 13:26:09 MST 1997", 10820 note = "See \cite{Whitney:1972:AAM}.", 10821 acknowledgement = ack-nhfb, 10822 classcodes = "C7310 (Mathematics computing)", 10823 corpsource = "Bell Telephone Labs. Inc., Murray Hill, NJ, USA", 10824 keywords = "minimal spanning tree; subroutine; trees (mathematical)", 10825 keywords = "minimal spanning tree; Prim algorithm; spanning tree", 10826 } 10827 10828 @Article{Macleod:1973:HPP, 10829 author = "I. D. G. Macleod and A. M. Collins", 10830 title = "Hidden-line plotting program", 10831 journal = j-CACM, 10832 volume = "16", 10833 number = "7", 10834 pages = "448--448", 10835 month = jul, 10836 year = "1973", 10837 CODEN = "CACMA2", 10838 ISSN = "0001-0782", 10839 bibdate = "Tue Mar 25 13:26:09 MST 1997", 10840 acknowledgement = ack-nhfb, 10841 classcodes = "C5540 (Terminals and graphic displays); C6130 (Data handling techniques)", 10842 corpsource = "Australian Nat. Univ., Canberra, Australia", 10843 keywords = "computer graphics; data handling; hidden line; surface plot", 10844 treatment = "P Practical", 10845 } 10846 10847 @Article{Nikolai:1973:DSO, 10848 author = "P. J. Nikolai", 10849 title = "{DIFSUB} for solution of ordinary differential equations", 10850 journal = j-CACM, 10851 volume = "16", 10852 number = "7", 10853 pages = "448--448", 10854 month = jul, 10855 year = "1973", 10856 CODEN = "CACMA2", 10857 ISSN = "0001-0782", 10858 bibdate = "Tue Mar 25 13:26:09 MST 1997", 10859 acknowledgement = ack-nhfb, 10860 classcodes = "B0290P (Differential equations); C4170 (Differential equations); C7310 (Mathematics computing)", 10861 corpsource = "Wright-Patterson Air Force Base, OH, USA", 10862 keywords = "boundary value; certification; differential equations; DIFSUB; ordinary differential equations; problems", 10863 treatment = "P Practical", 10864 } 10865 10866 @Article{Smith:1973:LPW, 10867 author = "Michael H. Smith", 10868 title = "A learning program which plays partnership dominoes", 10869 journal = j-CACM, 10870 volume = "16", 10871 number = "8", 10872 pages = "462--467", 10873 month = aug, 10874 year = "1973", 10875 CODEN = "CACMA2", 10876 ISSN = "0001-0782", 10877 bibdate = "Tue Mar 25 13:26:09 MST 1997", 10878 bibsource = "Compendex database", 10879 abstract = "A learning program has been written in BASIC to play four-player partnership dominoes. Because dominoes is a game of incomplete information, the program uses somewhat different principles of artificial intelligence from those used in programs for games of complete information, such as checkers, chess, and go. The program was constructed to use a ``strategy signature table'' which classifies board situations through the interactions of game parameters. Each entry in the table contains adaptively determined weights indicating the advisability of various strategies. Once chosen, a strategy then employs probability analysis and linear polynomial evaluation to choose a move. Our program wins approximately two-thirds of its games in tournament situations, and has defeated championship players.", 10880 acknowledgement = ack-nhfb, 10881 classcodes = "C1230 (Artificial intelligence); C7890 (Other special applications of computing)", 10882 classification = "461; 912", 10883 corpsource = "Univ. California, Berkeley, CA, USA", 10884 journalabr = "Commun ACM", 10885 keywords = "artificial intelligence; BASIC; game playing; games of skill; heuristic; intelligence; learning program; learning: heuristic procedures; partnership dominoes; problem; programming; solving; systems science and cybernetics", 10886 treatment = "P Practical", 10887 } 10888 10889 @Article{MacLennan:1973:FAB, 10890 author = "B. J. MacLennan", 10891 title = "{Fen} --- an Axiomatic Basis for Program Semantics", 10892 journal = j-CACM, 10893 volume = "16", 10894 number = "8", 10895 pages = "468--474", 10896 month = aug, 10897 year = "1973", 10898 CODEN = "CACMA2", 10899 ISSN = "0001-0782", 10900 MRclass = "68A05 (02G99)", 10901 MRnumber = "51 9561", 10902 mrreviewer = "W. D. Maurer", 10903 bibdate = "Tue Mar 25 13:26:09 MST 1997", 10904 bibsource = "Compendex database", 10905 abstract = "The notions of data item, function, and relation. It is argued that the system is more suitable than set theory (or its derivatives) for the concise and accurate description of program semantics. It is shown how the system can be used to build composite data types out of simper ones with the operations of rowing, structuring, and uniting. It is also demonstrated that completely new primitive types can be introduced into languages through the mechanism of singleton data types. Both deterministic and nondeterministic functions are shown to be definable in the system. \par It is described how the local environment can be modeled as a data item and how imperative statements can be considered functions on the environment. The nature of recursive functions is briefly discussed, and a technique is presented by which they can be introduced into the system. The technique is contrasted with the use of the paradoxical combinator, Y. The questions of local and global environments and of various modes of function calling and parameter passing are touched upon. The theory is applied to the proof of several elementary theorems concerning the semantics of the assignment, conditional, and iterative statements. An appendix is included which presents in detail the formal system governing webs and fen, the abstractions used informally in the body of the paper.", 10906 abstract2 = "A formal system is presented which abstracts the notions of data item, function, and relation. It is shown how the system can be used to build composite data types out of simpler ones with the operations of rowing, structuring, and uniting. It is also demonstrated that completely new primitive types can be introduced into languages through the mechanism of singleton data types. Both deterministic and nondeterministic functions are shown to be definable in the system. It is described how the local environment can be modeled as a data item and how imperative statements can be considered functions on the environment. The nature of recursive functions is briefly discussed, and a technique is presented by which they can be introduced into the system.", 10907 acknowledgement = ack-nhfb, 10908 classcodes = "C4210 (Formal logic)", 10909 classification = "723", 10910 corpsource = "Florida State Univ., Tallahassee, FL, USA", 10911 journalabr = "Commun ACM", 10912 keywords = "axioms; computer metatheory; correctness; data; data structures; data types; definition; description languages; extensible languages; fen; formal description; formal language; formal language definition; formal languages; formal systems; lambda-calculus; models of computation; modes; semantics; types", 10913 treatment = "T Theoretical or Mathematical", 10914 } 10915 10916 @Article{Misunas:1973:PNS, 10917 author = "David Misunas", 10918 title = "Petri Nets and Speed Independent Design", 10919 journal = j-CACM, 10920 volume = "16", 10921 number = "8", 10922 pages = "474--482 (or 474--481??)", 10923 month = aug, 10924 year = "1973", 10925 CODEN = "CACMA2", 10926 ISSN = "0001-0782", 10927 bibdate = "Tue Mar 25 13:26:09 MST 1997", 10928 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Misc/async.circuits.bib", 10929 abstract = "Petri nets are investigated as one method of modeling speed independent asynchronous circuits. A study of circuit realization of Petri nets leads to a demonstration of their usefulness in modeling speed independent operation. This usefulness is emphasized by the design of a speed independent processor from modules developed in the investigation of Petri net implementation.", 10930 acknowledgement = ack-nhfb, 10931 classcodes = "C4230D (Sequential switching theory); C5210 (Logic design methods)", 10932 classification = "721; 723", 10933 corpsource = "MIT, Cambridge, MA, USA", 10934 journalabr = "Commun ACM", 10935 keywords = "asynchronous circuits; asynchronous sequential logic; design; logic design; Petri nets; speed independent", 10936 treatment = "T Theoretical or Mathematical", 10937 } 10938 10939 @Article{MacHura:1973:AAR, 10940 author = "M. MacHura and A. Mulawa", 10941 title = "{ACM} Algorithm 450: {Rosenbrock} Function Minimization", 10942 journal = j-CACM, 10943 volume = "16", 10944 number = "8", 10945 pages = "482--483", 10946 month = aug, 10947 year = "1973", 10948 CODEN = "CACMA2", 10949 ISSN = "0001-0782", 10950 bibdate = "Tue Mar 25 13:26:09 MST 1997", 10951 note = "See also \cite{Davies:1976:RRF}.", 10952 acknowledgement = ack-nhfb, 10953 classcodes = "B0260 (Optimisation techniques); C1180 (Optimisation techniques); C7310 (Mathematics computing)", 10954 corpsource = "Inst. Automation and Measurements, Warsaw, Poland", 10955 keywords = "direct search; FORTRAN; function minimization; minimisation; Rosenbrock; subroutine; subroutines; unconstrained problem", 10956 treatment = "P Practical", 10957 } 10958 10959 @Article{Goldstein:1973:AAC, 10960 author = "R. B. Goldstein", 10961 title = "{ACM} Algorithm 451: Chi-Square Quantiles", 10962 journal = j-CACM, 10963 volume = "16", 10964 number = "8", 10965 pages = "483--485", 10966 month = aug, 10967 year = "1973", 10968 CODEN = "CACMA2", 10969 ISSN = "0001-0782", 10970 bibdate = "Tue Mar 25 13:26:09 MST 1997", 10971 acknowledgement = ack-nhfb, 10972 classcodes = "C7310 (Mathematics computing)", 10973 corpsource = "Providence Coll., RI, USA", 10974 keywords = "Chi square quantiles; probability; statistic; statistics; subroutines", 10975 treatment = "P Practical", 10976 } 10977 10978 @Article{Liu:1973:AAE, 10979 author = "C. N. Liu and D. T. Tang", 10980 title = "{ACM} Algorithm 452: Enumerating Combinations of $m$ Out of $n$ Objects", 10981 journal = j-CACM, 10982 volume = "16", 10983 number = "8", 10984 pages = "485--485", 10985 month = aug, 10986 year = "1973", 10987 CODEN = "CACMA2", 10988 ISSN = "0001-0782", 10989 bibdate = "Tue Mar 25 13:26:09 MST 1997", 10990 acknowledgement = ack-nhfb, 10991 classcodes = "C7310 (Mathematics computing)", 10992 corpsource = "IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA", 10993 keywords = "combinations; FORTRAN; NXCBN; permutations; statistics; subroutines", 10994 treatment = "P Practical", 10995 } 10996 10997 @Article{Piessens:1973:AAG, 10998 author = "Robert Piessens", 10999 title = "{ACM} Algorithm 453: {Gaussian} Quadrature Formulas for {Bromwich}'s Integral", 11000 journal = j-CACM, 11001 volume = "16", 11002 number = "8", 11003 pages = "486--487", 11004 month = aug, 11005 year = "1973", 11006 CODEN = "CACMA2", 11007 ISSN = "0001-0782", 11008 bibdate = "Tue Mar 25 13:26:09 MST 1997", 11009 acknowledgement = ack-nhfb, 11010 classcodes = "B0290M (Numerical integration and differentiation); C4160 (Numerical integration and differentiation); C7310 (Mathematics computing)", 11011 corpsource = "Univ. Leuven, Heverlee, Belgium", 11012 keywords = "BROMIN; Bromwich's integral; complex; FORTRAN; Gaussian quadrature formulas; integration; Laplace transform; Laplace transforms; numerical inversion; subroutines", 11013 treatment = "P Practical", 11014 } 11015 11016 @Article{Richardson:1973:AAC, 11017 author = "J. A. Richardson and J. L. Kuester", 11018 title = "{ACM} Algorithm 454: The Complex Method for Constrained Optimization", 11019 journal = j-CACM, 11020 volume = "16", 11021 number = "8", 11022 pages = "487--489", 11023 month = aug, 11024 year = "1973", 11025 CODEN = "CACMA2", 11026 ISSN = "0001-0782", 11027 bibdate = "Tue Mar 25 13:26:09 MST 1997", 11028 acknowledgement = ack-nhfb, 11029 classcodes = "B0260 (Optimisation techniques); C1180 (Optimisation techniques); C7310 (Mathematics computing)", 11030 corpsource = "Arizona State Univ., Tempe, AZ, USA", 11031 keywords = "Box's algorithm; complex method; constrained optimization; FORTRAN; maximum; multivariable; nonlinear function; optimisation; subroutines", 11032 treatment = "P Practical", 11033 } 11034 11035 @Article{Andrejkova:1973:CGF, 11036 author = "G. Andrejkova and J. Vinar", 11037 title = "Complex gamma function", 11038 journal = j-CACM, 11039 volume = "16", 11040 number = "8", 11041 pages = "489--489", 11042 month = aug, 11043 year = "1973", 11044 CODEN = "CACMA2", 11045 ISSN = "0001-0782", 11046 bibdate = "Tue Mar 25 13:26:09 MST 1997", 11047 acknowledgement = ack-nhfb, 11048 classcodes = "C7310 (Mathematics computing)", 11049 corpsource = "Safarik Univ., Kosice, Czechoslovakia", 11050 keywords = "algorithm; certification; comment; complex gamma function; functions", 11051 treatment = "P Practical", 11052 } 11053 11054 @Article{DeMorgan:1973:RAA, 11055 author = "R. M. {De Morgan}", 11056 title = "Remark on {``Algorithm 357 [A1]: An Efficient Prime Number Generator''}", 11057 journal = j-CACM, 11058 volume = "16", 11059 number = "8", 11060 pages = "489--489", 11061 month = aug, 11062 year = "1973", 11063 CODEN = "CACMA2", 11064 ISSN = "0001-0782", 11065 bibdate = "Tue Mar 25 13:26:09 MST 1997", 11066 acknowledgement = ack-nhfb, 11067 classcodes = "C7310 (Mathematics computing)", 11068 corpsource = "Digital Equipment Co. Ltd., Reading, UK", 11069 keywords = "algorithm; mathematics; prime number generator", 11070 treatment = "P Practical", 11071 } 11072 11073 @Article{Watkins:1973:GP, 11074 author = "R. P. Watkins", 11075 title = "Graph plotter", 11076 journal = j-CACM, 11077 volume = "16", 11078 number = "8", 11079 pages = "489--490", 11080 month = aug, 11081 year = "1973", 11082 CODEN = "CACMA2", 11083 ISSN = "0001-0782", 11084 bibdate = "Tue Mar 25 13:26:09 MST 1997", 11085 acknowledgement = ack-nhfb, 11086 classcodes = "C5540 (Terminals and graphic displays); C6130 (Data handling techniques)", 11087 corpsource = "Royal Melbourne Inst. Technol., Vic., Australia", 11088 keywords = "algorithm; computer graphics; graph plotter; plotters", 11089 treatment = "P Practical", 11090 } 11091 11092 @Article{Byrne:1973:HMR, 11093 author = "J. G. Byrne", 11094 title = "{Hu-Tucker} minimum redundancy alphabetic coding method", 11095 journal = j-CACM, 11096 volume = "16", 11097 number = "8", 11098 pages = "490--490", 11099 month = aug, 11100 year = "1973", 11101 CODEN = "CACMA2", 11102 ISSN = "0001-0782", 11103 bibdate = "Tue Mar 25 13:26:09 MST 1997", 11104 acknowledgement = ack-nhfb, 11105 classcodes = "C6130 (Data handling techniques)", 11106 corpsource = "Trinity Coll., Dublin, Ireland", 11107 keywords = "algorithm; alphabetic coding method; encoding; Hu; minimum redundancy; Tucker", 11108 treatment = "P Practical", 11109 } 11110 11111 @Article{Good:1973:CQ, 11112 author = "A. J. Good", 11113 title = "{Clenshaw-Curtis} quadrature", 11114 journal = j-CACM, 11115 volume = "16", 11116 number = "8", 11117 pages = "490--490", 11118 month = aug, 11119 year = "1973", 11120 CODEN = "CACMA2", 11121 ISSN = "0001-0782", 11122 bibdate = "Tue Mar 25 13:26:09 MST 1997", 11123 acknowledgement = ack-nhfb, 11124 classcodes = "B0290M (Numerical integration and differentiation); C4160 (Numerical integration and differentiation); C7310 (Mathematics computing)", 11125 corpsource = "Systems, Sci. and Software, La Jolla, CA, USA", 11126 keywords = "algorithm; Clenshaw Curtis quadrature; integration", 11127 treatment = "P Practical", 11128 } 11129 11130 @Article{Williams:1973:LRP, 11131 author = "E. J. Williams", 11132 title = "Localization of the roots of a polynomial", 11133 journal = j-CACM, 11134 volume = "16", 11135 number = "8", 11136 pages = "490--490", 11137 month = aug, 11138 year = "1973", 11139 CODEN = "CACMA2", 11140 ISSN = "0001-0782", 11141 bibdate = "Tue Mar 25 13:26:09 MST 1997", 11142 acknowledgement = ack-nhfb, 11143 classcodes = "B0290H (Linear algebra); C4140 (Linear algebra); C7310 (Mathematics computing)", 11144 corpsource = "Ford Motor Co., Dearborn, MI, USA", 11145 keywords = "algorithm; localization; polynomials; roots of a polynomial", 11146 treatment = "P Practical", 11147 } 11148 11149 @Article{Manna:1973:IMP, 11150 author = "Zohar Manna and Stephen Ness and Jean Vuillemin", 11151 title = "Inductive Methods for Proving Properties of Programs", 11152 journal = j-CACM, 11153 volume = "16", 11154 number = "8", 11155 pages = "491--502", 11156 month = aug, 11157 year = "1973", 11158 CODEN = "CACMA2", 11159 ISSN = "0001-0782", 11160 MRclass = "68A05", 11161 MRnumber = "51 2331", 11162 mrreviewer = "W. D. Maurer", 11163 bibdate = "Tue Mar 25 13:26:09 MST 1997", 11164 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Compiler/ml.bib", 11165 abstract = "There are two main purposes in this paper: first, clarification and extension of known results about computation of recursive programs, with emphasis on the difference between the theoretical and practical approaches; second, presentation and examination of various known methods for proving properties of recursive programs. Discussed in detail are two powerful inductive methods, computational induction and structural induction, including examples of their application.", 11166 acknowledgement = ack-nhfb, 11167 classcodes = "C4240 (Programming and algorithm theory)", 11168 classification = "723", 11169 corpsource = "Stanford Univ., CA, USA", 11170 journalabr = "Commun ACM", 11171 keywords = "computability and decidability; computation induction; computer metatheory; inductive methods; least fixedpoint; programming theory; properties of programs; proving; recursive programs; structural induction", 11172 treatment = "T Theoretical or Mathematical", 11173 } 11174 11175 @Article{Peterson:1973:CWR, 11176 author = "W. W. Peterson and T. Kasami and N. Tokura", 11177 title = "On the Capabilities of While, Repeat, and Exit Statements", 11178 journal = j-CACM, 11179 volume = "16", 11180 number = "8", 11181 pages = "503--512", 11182 month = aug, 11183 year = "1973", 11184 CODEN = "CACMA2", 11185 ISSN = "0001-0782", 11186 MRclass = "68A05", 11187 MRnumber = "51 4707", 11188 mrreviewer = "J. E. L. Peck", 11189 bibdate = "Tue Mar 25 13:26:09 MST 1997", 11190 bibsource = "Compendex database", 11191 abstract = "A well-formed program is defined as a program in which loops and if statements are properly nested and can be entered only at their beginning. A corresponding definition is given for a well-formed flowchart. It is shown that a program is well formed if and only if it can be written with if, repeat, and multi-level exit statements for sequence control. It is also shown that if, while, and repeat statements with single-level exit do not suffice. It is also shown that any flowchart can be converted to a well-formed flowchart by node splitting. Practical implications are discussed.", 11192 acknowledgement = ack-nhfb, 11193 classcodes = "C4240 (Programming and algorithm theory)", 11194 classification = "723", 11195 corpsource = "Univ. Hawaii, Honolulu, HI, USA", 11196 journalabr = "Commun ACM", 11197 keywords = "capabilities; computer metatheory; exit; exit statement; flowchart; go to statement; node splitting; programming theory; repeat statement; software reliability; statement; well formed program; well-formed program; while statement", 11198 treatment = "T Theoretical or Mathematical", 11199 } 11200 11201 @Article{Foster:1973:GAT, 11202 author = "Caxton C. Foster", 11203 title = "A Generalization of {AVL} Trees", 11204 journal = j-CACM, 11205 volume = "16", 11206 number = "8", 11207 pages = "513--517", 11208 month = aug, 11209 year = "1973", 11210 CODEN = "CACMA2", 11211 ISSN = "0001-0782", 11212 bibdate = "Tue Mar 25 13:26:09 MST 1997", 11213 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib", 11214 abstract = "A generalization of AVL trees is proposed in which imbalances up to (triangle shape) is a small integer. An experiment is performed to compare these trees with standard AVL trees and with balanced trees on the basis of mean retrieval time, of amount of restructuring expected, and on the worst case of retrieval time. It is shown that, by permitting imbalances of up to five units, the retrieval time is increased a small amount while the amount of restructuring required is decreased by a factor of ten. \par A few theoretical results are derived, including the correction of an earlier paper, and are duly compared with the experimental data. Reasonably good correspondence is found.", 11215 acknowledgement = ack-nhfb, 11216 classcodes = "C4210 (Formal logic); C6120 (File organisation)", 11217 classification = "723; 901", 11218 corpsource = "Univ. Massachusetts, Amherst, MA, USA", 11219 journalabr = "Commun ACM", 11220 keywords = "AVL trees; balanced trees; file organisation; generalisation; information retrieval systems; information storage and; information storage and retrieval; retrieval; trees (mathematical)", 11221 treatment = "T Theoretical or Mathematical", 11222 } 11223 11224 @Article{Buzen:1973:CAC, 11225 author = "Jeffrey P. Buzen", 11226 title = "Computational Algorithms for Closed Queueing Networks with Exponential Servers", 11227 journal = j-CACM, 11228 volume = "16", 11229 number = "9", 11230 pages = "527--531", 11231 month = sep, 11232 year = "1973", 11233 CODEN = "CACMA2", 11234 ISSN = "0001-0782", 11235 MRclass = "68A10", 11236 MRnumber = "50 15423", 11237 bibdate = "Tue Mar 25 13:26:09 MST 1997", 11238 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1973.bib", 11239 abstract = "Methods are presented for computing the equilibrium distribution of customers in closed queueing networks with exponential servers. Expressions for various marginal distributions are also derived. The computational algorithms are based on two-dimensional iterative techniques which are highly efficient and quite simple to implement. Implementation considerations such as storage allocation strategies and order of evaluation are examined in some detail.", 11240 acknowledgement = ack-nhfb, 11241 annote = "Methods are presented for computing the equilibrium distribution of customers in closed queueing networks with exponential servers. Expressions for various marginal distributions are also derived.", 11242 classcodes = "B0240C (Queueing theory); C1140C (Queueing theory)", 11243 classification = "912; 922", 11244 corpsource = "Harvard Univ., Cambridge, MA, USA", 11245 country = "USA", 11246 date = "14/12/79", 11247 descriptors = "Exponential queueing network; number of elements in system; method;", 11248 enum = "483", 11249 journalabr = "Commun ACM", 11250 keywords = "closed queueing networks; computational algorithms; distributions; equilibrium distributions; exponential servers; operations research; probability; queueing networks; queueing theory; steady state", 11251 language = "English", 11252 references = "6", 11253 treatment = "T Theoretical or Mathematical", 11254 } 11255 11256 @Article{Ganapathy:1973:ITA, 11257 author = "S. Ganapathy and V. Rajaraman", 11258 title = "Information Theory Applied to the Conversion of Decision Tables to Computer Programs", 11259 journal = j-CACM, 11260 volume = "16", 11261 number = "9", 11262 pages = "532--539", 11263 month = sep, 11264 year = "1973", 11265 CODEN = "CACMA2", 11266 ISSN = "0001-0782", 11267 bibdate = "Tue Mar 25 13:26:09 MST 1997", 11268 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Theory/inductive.inference.bib", 11269 abstract = "Using ideas from information theory, this paper develops a heuristic algorithm that converts a limited entry decision table to a tree structured computer program with near minimum average processing time. The method is applicable to any limited entry decision table and does not require that actions have single rules or that the cost of testing conditions be equal. It is thus more general than the previously published heuristic algorithms. Compared to the optimal algorithm of Reinwald and Soland, this algorithm is easy to code and takes a much smaller translation time; it is thus felt that it is more useful in practice. The algorithm is well suited for manual conversion of decision tables to flowcharts.", 11270 acknowledgement = ack-nhfb, 11271 classcodes = "C4240 (Programming and algorithm theory)", 11272 classification = "723; 731; 922", 11273 corpsource = "Indian Inst. Technol., New Delhi, India", 11274 journalabr = "Commun ACM", 11275 keywords = "computer; computer systems programming --- Decision Tables; conversion; decision tables; decision theory and analysis; information measure; information theory; optimum computer programs; programming theory; programs", 11276 treatment = "T Theoretical or Mathematical", 11277 } 11278 11279 @Article{Cardenas:1973:ESF, 11280 author = "Alfonso F. Cardenas", 11281 title = "Evaluation and Selection of File Organization --- {A} Model and a System", 11282 journal = j-CACM, 11283 volume = "16", 11284 number = "9", 11285 pages = "540--548", 11286 month = sep, 11287 year = "1973", 11288 CODEN = "CACMA2", 11289 ISSN = "0001-0782", 11290 bibdate = "Tue Mar 25 13:26:09 MST 1997", 11291 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib", 11292 abstract = "This work first discusses the factors that affect file (data base) organization performance, an elusive subject, and then presents a methodology, a model and a programmed system to estimate primarily total storage costs and average access time of several file organizations, given a specific data base, query characterization and device-related specifications. Based on these estimates, an appropriate file structure may be selected for the specific situation. The system is a convenient tool to study file structures and to facilitate as much as possible the process of data base structure design and evaluation.", 11293 acknowledgement = ack-nhfb, 11294 annote = "Tree, indexed, and ring files compared for six files and various retrieval requests.", 11295 classcodes = "C6120 (File organisation)", 11296 classification = "723", 11297 corpsource = "Univ. California, Los Angeles, CA, USA", 11298 journalabr = "Commun ACM", 11299 keywords = "access time; data base; data management; data processing; data structures; design; evaluation; file management; file organisation; file organization; file structures; model; selection; simulation; storage requirement", 11300 treatment = "P Practical", 11301 } 11302 11303 @Article{Casey:1973:DTS, 11304 author = "R. G. Casey", 11305 title = "Design of Tree Structures for Efficient Querying", 11306 journal = j-CACM, 11307 volume = "16", 11308 number = "9", 11309 pages = "549--556", 11310 month = sep, 11311 year = "1973", 11312 CODEN = "CACMA2", 11313 ISSN = "0001-0782", 11314 bibdate = "Tue Mar 25 13:26:09 MST 1997", 11315 bibsource = "Compendex database", 11316 abstract = "This paper poses an optimization problem in the design of such trees to serve a well-specified application. The problem is academic in the sense that ordinarily the optimal tree cannot be implemented by means of practical techniques. On the other hand, it is potentially useful for the comparison it affords between observed performance and that of an intuitively attractive ideal search procedure. As a practical application of such a model this paper considers the design of a novel tree search scheme based on a bit vector representation of data and shows that essentially the same algorithm can be used to design either an ideal search tree or a bit-vector tree. An experimental study of a small formatted file illustrates the concepts.", 11317 acknowledgement = ack-nhfb, 11318 classcodes = "C6120 (File organisation); C7250 (Information storage and retrieval)", 11319 classification = "723; 901", 11320 corpsource = "IBM, San Jose, CA, USA", 11321 journalabr = "Commun ACM", 11322 keywords = "clustering; data; data structure; data structures; design; file organisation; information retrieval; information retrieval systems; information storage; information storage and; management; querying; retrieval; search; tree file; tree structures", 11323 treatment = "P Practical", 11324 } 11325 11326 @Article{Rodriguez-Rosell:1973:EWS, 11327 author = "Juan Rodriguez-Rosell", 11328 title = "Empirical Working Set Behavior", 11329 journal = j-CACM, 11330 volume = "16", 11331 number = "9", 11332 pages = "556--560", 11333 month = sep, 11334 year = "1973", 11335 CODEN = "CACMA2", 11336 ISSN = "0001-0782", 11337 bibdate = "Tue Mar 25 13:26:09 MST 1997", 11338 bibsource = "Compendex database", 11339 abstract = "The working set model for program behavior has been proposed in recent years as a basis for the design of scheduling and paging algorithms. Although the words ``working set'' are now commonly encountered in the literature dealing with resource allocation, there is a dearth of published data on program working set behavior. It is the purpose of this paper to present empirical data from actual program measurements, in the hope that workers in the field might find experimental evidence upon which to substantiate and base theoretical work.", 11340 acknowledgement = ack-nhfb, 11341 classcodes = "C6120 (File organisation); C6150J (Operating systems)", 11342 classification = "723", 11343 corpsource = "Royal Inst. Technol., Stockholm, Sweden", 11344 journalabr = "Commun ACM", 11345 keywords = "computer metatheory; measurement; operating systems (computers); paging; program behaviour; scheduling; software; software measurement; virtual memory; virtual storage; working set", 11346 treatment = "P Practical", 11347 } 11348 11349 @Article{Gates:1973:STS, 11350 author = "Geoffrey W. Gates and David A. Poplawski", 11351 title = "A simple technique for structured variable lookup", 11352 journal = j-CACM, 11353 volume = "16", 11354 number = "9", 11355 pages = "561--565", 11356 month = sep, 11357 year = "1973", 11358 CODEN = "CACMA2", 11359 ISSN = "0001-0782", 11360 bibdate = "Tue Mar 25 13:26:09 MST 1997", 11361 bibsource = "Compendex database", 11362 abstract = "A simple technique for the symbol-table lookup of structured variables based on simple automata theory is presented. The technique offers a deterministic solution to a problem which is currently handled in a nondeterministic manner in PL/I and COBOL compilers.", 11363 acknowledgement = ack-nhfb, 11364 classcodes = "C6130 (Data handling techniques); C6140D (High level languages)", 11365 classification = "723", 11366 corpsource = "Michigan State Univ., East Lansing, MI, USA", 11367 journalabr = "Commun ACM", 11368 keywords = "automata theory; COBOL; computer programming languages; computer systems programming; deterministic; PL/1; PL/I; structured variable; table lookup", 11369 treatment = "P Practical", 11370 } 11371 11372 @Article{Zelkowitz:1973:RE, 11373 author = "M. V. Zelkowitz", 11374 title = "Reversible Execution", 11375 journal = j-CACM, 11376 volume = "16", 11377 number = "9", 11378 pages = "566--566", 11379 month = sep, 11380 year = "1973", 11381 CODEN = "CACMA2", 11382 ISSN = "0001-0782", 11383 bibdate = "Tue Mar 25 13:26:09 MST 1997", 11384 bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/debug.bib", 11385 acknowledgement = ack-nhfb, 11386 classcodes = "C6140D (High level languages); C6150G (Diagnostic, testing, debugging and evaluating systems)", 11387 corpsource = "Univ. Maryland, Baltimore, MD, USA", 11388 keywords = "backtracking; computer program; debugging; PL/I; program debugging; programming language; programming languages; reversible execution", 11389 treatment = "P Practical", 11390 } 11391 11392 @Article{Barnhill:1973:SKC, 11393 author = "Robert E. Barnhill and David T. Pilcher", 11394 title = "{Sard} kernels for certain bivariate cubatures", 11395 journal = j-CACM, 11396 volume = "16", 11397 number = "9", 11398 pages = "567--571 (or 567--570??)", 11399 month = sep, 11400 year = "1973", 11401 CODEN = "CACMA2", 11402 ISSN = "0001-0782", 11403 MRclass = "65D30", 11404 MRnumber = "52 2150", 11405 mrreviewer = "P. Brock", 11406 bibdate = "Tue Mar 25 13:26:09 MST 1997", 11407 bibsource = "Compendex database", 11408 abstract = "An error analysis for some bivariate cubatures is given. The remainders are obtained by the use of Sard kernels. Numerical results and computer graphs are given for some of the kernel functions.", 11409 acknowledgement = ack-nhfb, 11410 classcodes = "B0290B (Error analysis in numerical methods); B0290M (Numerical integration and differentiation); C4110 (Error analysis in numerical methods); C4160 (Numerical integration and differentiation)", 11411 classification = "921", 11412 corpsource = "Univ. Utah, Salt Lake City, UT, USA", 11413 journalabr = "Commun ACM", 11414 keywords = "bivariate cubatures; cubatures; error analysis; integration; mathematical techniques; numerical integration; numerical methods; remainder formulas; Sard kernels", 11415 treatment = "T Theoretical or Mathematical", 11416 } 11417 11418 @Article{Hunter:1973:AAA, 11419 author = "D. B. Hunter and J. M. Williams", 11420 title = "{ACM} Algorithm 455: Analysis of Skew Representations of the Symmetric Group", 11421 journal = j-CACM, 11422 volume = "16", 11423 number = "9", 11424 pages = "571--572", 11425 month = sep, 11426 year = "1973", 11427 CODEN = "CACMA2", 11428 ISSN = "0001-0782", 11429 bibdate = "Tue Mar 25 13:26:09 MST 1997", 11430 acknowledgement = ack-nhfb, 11431 classcodes = "C7310 (Mathematics computing)", 11432 corpsource = "Univ. Bradford, UK", 11433 keywords = "ALGOL; analysis; binary model; group theory; lattice; outer product; permutation; skew representations; subroutines; symmetric group", 11434 treatment = "P Practical", 11435 } 11436 11437 @Article{Fencl:1973:AAR, 11438 author = "Zden{\v{e}}k Fencl", 11439 title = "{ACM} Algorithm 456: Routing Problem", 11440 journal = j-CACM, 11441 volume = "16", 11442 number = "9", 11443 pages = "572--574", 11444 month = sep, 11445 year = "1973", 11446 CODEN = "CACMA2", 11447 ISSN = "0001-0782", 11448 bibdate = "Tue Mar 25 13:26:09 MST 1997", 11449 acknowledgement = ack-nhfb, 11450 classcodes = "C7310 (Mathematics computing)", 11451 corpsource = "RCA, Marlborough, MA, USA", 11452 keywords = "FORTRAN; graph theory; Hamiltonian circuit; optimisation; routing problem; shortest path; subroutines; travelling salesman problem", 11453 treatment = "P Practical", 11454 } 11455 11456 @Article{Bron:1973:AAF, 11457 author = "Coen Bron and Joep Kerbosch", 11458 title = "{ACM} Algorithm 457: Finding All Cliques of an Undirected Graph", 11459 journal = j-CACM, 11460 volume = "16", 11461 number = "9", 11462 pages = "575--577", 11463 month = sep, 11464 year = "1973", 11465 CODEN = "CACMA2", 11466 ISSN = "0001-0782", 11467 bibdate = "Tue Mar 25 13:26:09 MST 1997", 11468 bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Theory/graph.coloring.bib and ftp://ftp.ira.uka.de/pub/bibliography/Theory/clique.color.bib", 11469 acknowledgement = ack-nhfb, 11470 annote = "An implicit enumeration algorithm for listing all cliques in a graph. Includes easily translated code.", 11471 classcodes = "C7310 (Mathematics computing)", 11472 corpsource = "Technol. Univ., Eindhoven, Netherlands", 11473 keywords = "ALGOL; backtracking algorithm; branch and bound technique; cliques; clusters; fgraph coloring related clique backtracking branch and bound; graph theory; maximal complete; recursion; subgraph; subroutines; undirected graph", 11474 treatment = "P Practical", 11475 } 11476 11477 @Article{Roy:1973:RAG, 11478 author = "M. K. Roy", 11479 title = "Remark on {``Algorithm 323 [G6]: Generation of Permutations in Lexicographic Order''}", 11480 journal = j-CACM, 11481 volume = "16", 11482 number = "9", 11483 pages = "577--578", 11484 month = sep, 11485 year = "1973", 11486 CODEN = "CACMA2", 11487 ISSN = "0001-0782", 11488 bibdate = "Tue Mar 25 13:26:09 MST 1997", 11489 acknowledgement = ack-nhfb, 11490 classcodes = "C7310 (Mathematics computing)", 11491 corpsource = "Jadavpur Univ., Calcutta, India", 11492 keywords = "algorithm; generation; lexicographic order; permutations; statistics", 11493 treatment = "P Practical", 11494 } 11495 11496 @Article{Roy:1973:RGP, 11497 author = "Mohit Kumar Roy", 11498 title = "Remark on {``Algorithm 323 [G6]: Generation of Permutations in Lexicographic Order''}", 11499 journal = j-CACM, 11500 volume = "16", 11501 number = "9", 11502 pages = "577--578", 11503 month = sep, 11504 year = "1973", 11505 CODEN = "CACMA2", 11506 ISSN = "0001-0782", 11507 bibdate = "Sat Jan 18 14:55:49 1997", 11508 } 11509 11510 @Article{Lawrence:1973:SMP, 11511 author = "E. E. Lawrence", 11512 title = "A sparse matrix package. {I}", 11513 journal = j-CACM, 11514 volume = "16", 11515 number = "9", 11516 pages = "578--578", 11517 month = sep, 11518 year = "1973", 11519 CODEN = "CACMA2", 11520 ISSN = "0001-0782", 11521 bibdate = "Tue Mar 25 13:26:09 MST 1997", 11522 acknowledgement = ack-nhfb, 11523 classcodes = "B0290H (Linear algebra); C4140 (Linear algebra); C7310 (Mathematics computing)", 11524 corpsource = "Mullard Ltd., Mitcham, UK", 11525 keywords = "algorithm; matrix algebra; sparse matrix package", 11526 treatment = "P Practical", 11527 } 11528 11529 @Article{Williamson:1973:HPP, 11530 author = "H. Williamson", 11531 title = "Hidden-line plotting program", 11532 journal = j-CACM, 11533 volume = "16", 11534 number = "9", 11535 pages = "578--579", 11536 month = sep, 11537 year = "1973", 11538 CODEN = "CACMA2", 11539 ISSN = "0001-0782", 11540 bibdate = "Tue Mar 25 13:26:09 MST 1997", 11541 acknowledgement = ack-nhfb, 11542 classcodes = "C5540 (Terminals and graphic displays); C6130 (Data handling techniques)", 11543 corpsource = "Nat. Con-Serv. Inc., Austin, TX, USA", 11544 keywords = "algorithm; computer graphics; data handling; hidden line plotting; program", 11545 treatment = "P Practical", 11546 } 11547 11548 @Article{Driessen:1973:LRP, 11549 author = "H. B. Driessen and E. W. LeM. Hunt", 11550 title = "Localization of the roots of a polynomial", 11551 journal = j-CACM, 11552 volume = "16", 11553 number = "9", 11554 pages = "579--579", 11555 month = sep, 11556 year = "1973", 11557 CODEN = "CACMA2", 11558 ISSN = "0001-0782", 11559 bibdate = "Tue Mar 25 13:26:09 MST 1997", 11560 acknowledgement = ack-nhfb, 11561 classcodes = "B0290H (Linear algebra); C4140 (Linear algebra); C7310 (Mathematics computing)", 11562 corpsource = "Supreme Headquarters Allied Powers Europe, The Hague, Netherlands", 11563 keywords = "algorithm; localization; polynomial; polynomials; roots", 11564 treatment = "P Practical", 11565 } 11566 11567 @Article{McGeachie:1973:MTU, 11568 author = "John S. McGeachie", 11569 title = "Multiple Terminals Under User Program Control in a Time-Sharing Environment", 11570 journal = j-CACM, 11571 volume = "16", 11572 number = "10", 11573 pages = "587--590", 11574 month = oct, 11575 year = "1973", 11576 CODEN = "CACMA2", 11577 ISSN = "0001-0782", 11578 bibdate = "Tue Mar 25 13:26:09 MST 1997", 11579 bibsource = "Compendex database", 11580 abstract = "User-written programs on the Dartmouth Time-Sharing System can communicate with many remote terminals simultaneously and can control the interactions between these terminals. Such programs can be written using standard input and output instructions in any language available on the system. This paper describes how this multiple-terminal facility was implemented without requiring any changes in the system executive or in any of the system's compilers or interpreters.", 11581 acknowledgement = ack-nhfb, 11582 classcodes = "C6150J (Operating systems)", 11583 classification = "722", 11584 corpsource = "Dartmouth Coll., Hanover, NH, USA", 11585 journalabr = "Commun ACM", 11586 keywords = "computer systems, digital; multiple terminals; on-line interaction; remote consoles; time sharing; time-sharing programs; user program control", 11587 treatment = "P Practical", 11588 } 11589 11590 @Article{Bobrow:1973:MSI, 11591 author = "Daniel G. Bobrow and Ben Wegbreit", 11592 title = "A Model and Stack Implementation of Multiple Environments", 11593 journal = j-CACM, 11594 volume = "16", 11595 number = "10", 11596 pages = "591--603", 11597 month = oct, 11598 year = "1973", 11599 CODEN = "CACMA2", 11600 ISSN = "0001-0782", 11601 bibdate = "Tue Mar 25 13:26:09 MST 1997", 11602 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Compiler/garbage.collection.bib", 11603 abstract = "This paper presents an implementation technique using a single stack to hold procedure activation storage which allows retention of that storage for durations not necessarily tied to control flow. The technique has the property that, in the simple case, it runs identically to the usual automatic stack allocation and deallocation procedure. Applications of this technique to multitasking, coroutines, backtracking, label-valued variables, and functional arguments are discussed. In the initial model, a single real processor is assumed, and the implementation assumes multiple-processes coordinate by passing control explicitly to one another.", 11604 acknowledgement = ack-nhfb, 11605 classcodes = "C6110 (Systems analysis and programming); C6120 (File organisation)", 11606 classification = "723", 11607 corpsource = "Xerox Palo Alto Res. Center, CA, USA", 11608 journalabr = "Commun ACM", 11609 keywords = "computer programming; control; coroutines; dendrarchy; dynamic; funarg problem; label-valued variables; model; multiple environments; multiprocessing programs; multiprocessor; multitasking; programming; retention; stack allocation; stack implementation; storage allocation; structures; systems", 11610 treatment = "P Practical", 11611 } 11612 11613 @Article{Lum:1973:GPA, 11614 author = "Vincent Y. Lum", 11615 title = "General Performance Analysis of Key-to-Address Transformation Methods Using an Abstract File Concept", 11616 journal = j-CACM, 11617 volume = "16", 11618 number = "10", 11619 pages = "603--612", 11620 month = oct, 11621 year = "1973", 11622 CODEN = "CACMA2", 11623 ISSN = "0001-0782", 11624 bibdate = "Tue Mar 25 13:26:09 MST 1997", 11625 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib", 11626 abstract = "This paper presents a new approach to the analysis of performance of the various key-to-address transformation methods. In this approach the keys in a file are assumed to have been selected from the key space according to a certain probabilistic selection algorithm. All files with the same number of keys selected from this key space will be suitably weighted in accordance with the algorithm, and the average performance of the transformation methods on these files will be used as the potential of these methods. Using this analysis, methods with the same overall performance can be classified and key distributions partial to certain transformations can be identified. All this can be done analytically. The approach is applied to a group of transformation methods using files whose keys are selected randomly.", 11627 acknowledgement = ack-nhfb, 11628 annote = "analysis and results using distributions from the entire key domain.", 11629 classcodes = "C6120 (File organisation)", 11630 classification = "723; 901", 11631 corpsource = "IBM Res. Lab., San Jose, CA, USA", 11632 journalabr = "Commun ACM", 11633 keywords = "abstract file concept; access; direct addressing; file organisation; hashing; information retrieval systems; key to address transformation; performance analysis; random; scatter storage; storage management", 11634 treatment = "A Application; T Theoretical or Mathematical", 11635 } 11636 11637 @Article{Lampson:1973:NCP, 11638 author = "Butler W. Lampson", 11639 title = "A Note on the Confinement Problem", 11640 journal = j-CACM, 11641 volume = "16", 11642 number = "10", 11643 pages = "613--615", 11644 month = oct, 11645 year = "1973", 11646 CODEN = "CACMA2", 11647 ISSN = "0001-0782", 11648 bibdate = "Tue Mar 25 13:26:09 MST 1997", 11649 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib", 11650 abstract = "This note explores the problem of confining a program during its execution so that it cannot transmit information to any other program except its caller. A set of examples attempts to stake out the boundaries of the problem. Necessary conditions for a solution are stated and informally justified.", 11651 acknowledgement = ack-nhfb, 11652 annote = "Prevention of privacy leaks between programs.", 11653 classcodes = "C6130 (Data handling techniques); C6150J (Operating systems)", 11654 classification = "723", 11655 corpsource = "Xerox Palo Alto Res. Center, CA, USA", 11656 journalabr = "Commun ACM", 11657 keywords = "computer systems programming; confinement; leakage of data; operating systems (computers); privacy; proprietary program; protection; security; security of data", 11658 treatment = "P Practical", 11659 } 11660 11661 @Article{Hirschberg:1973:CDM, 11662 author = "Daniel S. Hirschberg", 11663 title = "A Class of Dynamic Memory Allocation Algorithms", 11664 journal = j-CACM, 11665 volume = "16", 11666 number = "10", 11667 pages = "615--618", 11668 month = oct, 11669 year = "1973", 11670 CODEN = "CACMA2", 11671 ISSN = "0001-0782", 11672 bibdate = "Tue Mar 25 13:26:09 MST 1997", 11673 bibsource = "Compendex database", 11674 abstract = "A new dynamic memory allocation algorithm, the Fibonacci system, is introduced. This algorithm is similar to, but seems to have certain advantages over, the ``buddy'' system. A generalization is mentioned which includes both of these systems as special cases.", 11675 acknowledgement = ack-nhfb, 11676 classcodes = "C6120 (File organisation)", 11677 classification = "723", 11678 corpsource = "Princeton Univ., NJ, USA", 11679 journalabr = "Commun ACM", 11680 keywords = "buddy system; computer operating systems; dynamic memory allocation algorithms; dynamic storage allocation; Fibonacci; Fibonacci system; fragmentation; simulation; storage allocation", 11681 treatment = "P Practical", 11682 } 11683 11684 @Article{Prieve:1973:UPR, 11685 author = "Barton G. Prieve", 11686 title = "Using Page Residency to Select the Working Set Parameter", 11687 journal = j-CACM, 11688 volume = "16", 11689 number = "10", 11690 pages = "619--620", 11691 month = oct, 11692 year = "1973", 11693 CODEN = "CACMA2", 11694 ISSN = "0001-0782", 11695 bibdate = "Tue Mar 25 13:26:09 MST 1997", 11696 bibsource = "Compendex database", 11697 abstract = "Denning's method for selecting the working set parameter, which uses interreference intervals, is examined. Several omissions in his model are noted, and new assumptions are introduced to overcome these omissions. Using this modified model, Denning's results on page residency are rederived and reconsidered for selecting the working set parameter.", 11698 acknowledgement = ack-nhfb, 11699 classcodes = "C4240 (Programming and algorithm theory); C6120 (File organisation)", 11700 classification = "723", 11701 corpsource = "Bell Telephone Labs., Inc., Naperville, IL, USA", 11702 journalabr = "Commun ACM", 11703 keywords = "computer operating systems; page residency; program behaviour; programming theory; virtual storage; working set parameter", 11704 treatment = "T Theoretical or Mathematical", 11705 } 11706 11707 @Article{Millstein:1973:CSI, 11708 author = "Robert E. Millstein", 11709 title = "Control Structures in {Illiac IV Fortran}", 11710 journal = j-CACM, 11711 volume = "16", 11712 number = "10", 11713 pages = "621--627", 11714 month = oct, 11715 year = "1973", 11716 CODEN = "CACMA2", 11717 ISSN = "0001-0782", 11718 bibdate = "Tue Mar 25 13:26:09 MST 1997", 11719 bibsource = "Compendex database", 11720 abstract = "As part of an effort to design and implement a Fortran compiler on the ILLIAC IV, an extended Fortran, called IVTRAN, has been developed. This language provides a means of expressing data and control structures suitable for exploiting ILLIAC IV parallelism. \par This paper reviews the hardware characteristics of the ILLIAC and singles out unconventional features which could be expected to influence language (and compiler) design. The implications of these features for data layout and algorithm structure are discussed, and the conclusion is drawn that data allocation rather than code structuring is the crucial ILLIAC optimization problem. A satisfactory method of data allocation is then presented. Language structures to utilize this storage method and express parallel algorithms are described.", 11721 acknowledgement = ack-nhfb, 11722 classcodes = "C6140D (High level languages); C6150C (Compilers, interpreters and other processors)", 11723 classification = "723", 11724 corpsource = "Massachusetts Computer Associates, Inc., Wakefield, MA, USA", 11725 journalabr = "Commun ACM", 11726 keywords = "array allocation; array processing; computer programming languages; control structures; explicit parallelism; FORTRAN; ILLIAC IV; ILLIAC IV Fortran; parallel control; parallel control structures; parallel processing; parallelism detection; procedure oriented languages; program compilers; structures", 11727 treatment = "P Practical", 11728 } 11729 11730 @Article{Robers:1973:AAD, 11731 author = "P. D. Robers and S. S. Robers", 11732 title = "{ACM} Algorithm 458: Discrete Linear ${L}_1$ Approximation by Interval Linear Programming", 11733 journal = j-CACM, 11734 volume = "16", 11735 number = "10", 11736 pages = "629--631", 11737 month = oct, 11738 year = "1973", 11739 CODEN = "CACMA2", 11740 ISSN = "0001-0782", 11741 bibdate = "Tue Mar 25 13:26:09 MST 1997", 11742 acknowledgement = ack-nhfb, 11743 classcodes = "B0260 (Optimisation techniques); B0290F (Interpolation and function approximation); C1180 (Optimisation techniques); C4130 (Interpolation and function approximation); C7310 (Mathematics computing)", 11744 corpsource = "Ernst and Ernst, Washington, DC, USA", 11745 keywords = "discrete linear; FORTRAN; function approximation; interval linear programming; L/sub 1/ approximation; linear programming; suboptimisation method; subroutine; subroutines", 11746 treatment = "P Practical", 11747 } 11748 11749 @Article{Syslo:1973:AAE, 11750 author = "M. M. Syslo", 11751 title = "{ACM} Algorithm 459: The Elementary Circuits of a Graph", 11752 journal = j-CACM, 11753 volume = "16", 11754 number = "10", 11755 pages = "632--633", 11756 month = oct, 11757 year = "1973", 11758 CODEN = "CACMA2", 11759 ISSN = "0001-0782", 11760 bibdate = "Tue Mar 25 13:26:09 MST 1997", 11761 acknowledgement = ack-nhfb, 11762 classcodes = "C7310 (Mathematics computing)", 11763 corpsource = "Univ. Wroclaw, Poland", 11764 keywords = "ALGOL; elementary circuits; graph; graph theory; path search algorithm; subroutines", 11765 treatment = "P Practical", 11766 } 11767 11768 @Article{Saylor:1973:AAC, 11769 author = "Paul E. Saylor and James D. Sebastian", 11770 title = "{ACM} Algorithm 460: Calculation of Optimum Parameters for Alternating Direction Implicit Procedures", 11771 journal = j-CACM, 11772 volume = "16", 11773 number = "10", 11774 pages = "633--635", 11775 month = oct, 11776 year = "1973", 11777 CODEN = "CACMA2", 11778 ISSN = "0001-0782", 11779 bibdate = "Tue Mar 25 13:26:09 MST 1997", 11780 acknowledgement = ack-nhfb, 11781 classcodes = "B0290P (Differential equations); C4170 (Differential equations); C7310 (Mathematics computing)", 11782 corpsource = "Univ. Illinois, Urbana, IL, USA", 11783 keywords = "alternating direction implicit; differential equations; elliptic difference; equations; FORTRAN; optimum parameters; procedures; simultaneous equations; subroutine; subroutines", 11784 treatment = "P Practical", 11785 } 11786 11787 @Article{Burkowski:1973:AAC, 11788 author = "F. J. Burkowski and W. D. Hoskins", 11789 title = "{ACM} Algorithm 461: Cubic Spline Solutions to a Class of Functional Differential Equations", 11790 journal = j-CACM, 11791 volume = "16", 11792 number = "10", 11793 pages = "635--637", 11794 month = oct, 11795 year = "1973", 11796 CODEN = "CACMA2", 11797 ISSN = "0001-0782", 11798 bibdate = "Tue Mar 25 13:26:09 MST 1997", 11799 acknowledgement = ack-nhfb, 11800 classcodes = "B0290F (Interpolation and function approximation); B0290P (Differential equations); C4130 (Interpolation and function approximation); C4170 (Differential equations); C7310 (Mathematics computing)", 11801 corpsource = "Univ. Manitoba, Winnipeg, Man., Canada", 11802 keywords = "(mathematics); boundary value problem; boundary-value problems; cubic spline solutions; differential equations; FORTRAN; functional differential equations; piecewise continuous approximation; splines; SPNBVF; subroutine; subroutines", 11803 treatment = "P Practical", 11804 } 11805 11806 @Article{Donnelly:1973:AAB, 11807 author = "T. G. Donnelly", 11808 title = "{ACM} Algorithm 462: Bivariate Normal Distribution", 11809 journal = j-CACM, 11810 volume = "16", 11811 number = "10", 11812 pages = "638--638", 11813 month = oct, 11814 year = "1973", 11815 CODEN = "CACMA2", 11816 ISSN = "0001-0782", 11817 bibdate = "Tue Mar 25 13:26:09 MST 1997", 11818 acknowledgement = ack-nhfb, 11819 classcodes = "C7310 (Mathematics computing)", 11820 corpsource = "Univ. North Carolina, Chapel Hill, NC, USA", 11821 keywords = "bivariate normal distribution; FORTRAN; frequency distribution; statistics; subroutine; subroutines", 11822 treatment = "P Practical", 11823 } 11824 11825 @Article{Lewart:1973:AAA, 11826 author = "C. R. Lewart", 11827 title = "{ACM} Algorithm 463: Algorithms {SCALE}1, {SCALE}2, and {SCALE}3 for Determination of Scales on Computer Generated Plots", 11828 journal = j-CACM, 11829 volume = "16", 11830 number = "10", 11831 pages = "639--640", 11832 month = oct, 11833 year = "1973", 11834 CODEN = "CACMA2", 11835 ISSN = "0001-0782", 11836 bibdate = "Tue Mar 25 13:26:09 MST 1997", 11837 acknowledgement = ack-nhfb, 11838 classcodes = "C5540 (Terminals and graphic displays); C6130 (Data handling techniques)", 11839 corpsource = "Bell Telephone Lab., Inc., Holmdel, NJ, USA", 11840 keywords = "algorithms; computer generated plots; computer graphics; determination of; FORTRAN; SCALE 1; SCALE 2; SCALE 3; scales; subroutines", 11841 treatment = "P Practical", 11842 } 11843 11844 @Article{Bachman:1973:PN, 11845 author = "Charles W. Bachman", 11846 title = "The Programmer as Navigator", 11847 journal = j-CACM, 11848 volume = "16", 11849 number = "11", 11850 pages = "653--658", 11851 month = nov, 11852 year = "1973", 11853 CODEN = "CACMA2", 11854 ISSN = "0001-0782", 11855 bibdate = "Tue Mar 25 13:26:09 MST 1997", 11856 bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib and ftp://ftp.ira.uka.de/pub/bibliography/Database/Graefe.bib", 11857 note = "1973 ACM Turing Award Lecture.", 11858 acknowledgement = ack-nhfb, 11859 annote = "Turing award acceptance speech-general view of the state of database work from a DBTG originator.", 11860 classcodes = "C6110 (Systems analysis and programming); C6120 (File organisation); C6130 (Data handling techniques)", 11861 corpsource = "Honeywell Information Systems Inc., Waltham, MA, USA", 11862 keywords = "access; addressing; data handling; database; file organisation; network hierarchical data model CACM; programmer; programming", 11863 treatment = "G General Review", 11864 } 11865 11866 @Article{Fabry:1973:DVO, 11867 author = "R. S. Fabry", 11868 title = "Dynamic Verification of Operating System Decisions", 11869 journal = j-CACM, 11870 volume = "16", 11871 number = "11", 11872 pages = "659--668", 11873 month = nov, 11874 year = "1973", 11875 CODEN = "CACMA2", 11876 ISSN = "0001-0782", 11877 bibdate = "Tue Mar 25 13:26:09 MST 1997", 11878 bibsource = "Compendex database", 11879 abstract = "Dynamic verification of a decision implies that every time the decision is made there is a consistency check performed on the decision using independent hardware and software. The dynamic verification of operating system decisions is used on the PRIME system being designed and constructed at the University of California, Berkeley. PRIME is an experimental time-sharing system which is to have the properties of continuous availability, data privacy, and cost effectiveness. The technique of dynamic verification allows the construction of an operating system which does not make certain decisions improperly even in the presence of a single hardware or software fault. Furthermore, multiple faults lead to unreliable operation only if the faults happen to reinforce each other. On PRIME, dynamic verification is used to ensure that one user's information cannot become available to another user gratuitously even in the presence of a single hardware or software fault.", 11880 acknowledgement = ack-nhfb, 11881 classcodes = "C6150G (Diagnostic, testing, debugging and evaluating systems); C6150J (Operating systems)", 11882 classification = "722; 723", 11883 corpsource = "Univ. California, Berkeley, CA, USA", 11884 journalabr = "Commun ACM", 11885 keywords = "computer operating systems; computer systems; computer systems, digital; data privacy; data security; dynamic verification; fault tolerance; modular; operating systems; operating systems (computers); program verification; reliability; security of data; software", 11886 treatment = "P Practical; X Experimental", 11887 } 11888 11889 @Article{Mickunas:1973:PSC, 11890 author = "M. D. Mickunas and V. B. Schneider", 11891 title = "Parser-Generating System for Constructing Compressed Compilers", 11892 journal = j-CACM, 11893 volume = "16", 11894 number = "11", 11895 pages = "669--676", 11896 month = nov, 11897 year = "1973", 11898 CODEN = "CACMA2", 11899 ISSN = "0001-0782", 11900 bibdate = "Tue Mar 25 13:26:09 MST 1997", 11901 bibsource = "Compendex database", 11902 abstract = "This paper describes a parser-generating system (PGS) currently in use on the CDC-6500 computer at Purdue University. The PGS is a FORTRAN-coded program that accepts a translation grammar as input and constructs from it a compact, machine-coded compiler. In the input translation grammar, each BNF syntactic rule corresponds to a (possibly empty) ``code generator'' realizable as an assembly language, FORTRAN or Algol, subroutine that is called whenever that syntactic rule is applied in the parse of a program. Typical one-pass compilers constructed by the PGS translate source programs at speeds approaching 14,000 cards per minute. For an XPL compiler, the parser program and its tables currently occupy 288 words of 60-bit core memory of which 140 words are parsing table entries and 82 words are links to code generators.", 11903 acknowledgement = ack-nhfb, 11904 classcodes = "C4210 (Formal logic); C4220 (Automata theory); C6150C (Compilers, interpreters and other processors)", 11905 classification = "723", 11906 corpsource = "Purdue Univ., Lafayette, IN, USA", 11907 journalabr = "Commun ACM", 11908 keywords = "BNF; compression algorithm; computer operating systems --- Program Compilers; computer programming languages; data compression; grammars; interpreters; parser generators; program; program compilers; pushdown automata; syntactic analysis; translation grammars; translator writing systems", 11909 treatment = "A Application; T Theoretical or Mathematical", 11910 } 11911 11912 @Article{Jordan:1973:SCA, 11913 author = "B. W. {Jordan, Jr.} and R. C. Barrett", 11914 title = "Scan Conversion Algorithm with Reduced Storage Requirements", 11915 journal = j-CACM, 11916 volume = "16", 11917 number = "11", 11918 pages = "676--682", 11919 month = nov, 11920 year = "1973", 11921 CODEN = "CACMA2", 11922 ISSN = "0001-0782", 11923 bibdate = "Tue Mar 25 13:26:09 MST 1997", 11924 bibsource = "Compendex database", 11925 abstract = "The scan conversion algorithm that is described uses a linked list data structure to process the lines of the drawing in strips corresponding to groups of scan lines. A relatively small primary memory buffer area is used to accumulate the binary image for a group of scan lines. When this portion of the drawing has been plotted, the buffer is reused for the next portion. Because of the list processing procedures used, only a single pass through the XY display file is required when generating the binary image and only a slight increase in execution time over the fully buffered core results. Results show that storage requirements can be reduced by more than 80\% while causing less than a 10\% increase in execution time.", 11926 acknowledgement = ack-nhfb, 11927 classcodes = "C5540 (Terminals and graphic displays); C6130 (Data handling techniques)", 11928 classification = "723", 11929 corpsource = "Northwestern Univ., Evanston, IL, USA", 11930 journalabr = "Commun ACM", 11931 keywords = "computer graphics; data handling; discrete image; dot generation; line drawing; raster plotter; reduced storage requirements; scan conversion; scan conversion algorithm", 11932 treatment = "P Practical", 11933 } 11934 11935 @Article{Slagle:1973:EAT, 11936 author = "James R. Slagle and Lewis M. Norton", 11937 title = "Experiments with an Automatic Theorem-Prover Having Partial Ordering Inference Rules", 11938 journal = j-CACM, 11939 volume = "16", 11940 number = "11", 11941 pages = "682--688", 11942 month = nov, 11943 year = "1973", 11944 CODEN = "CACMA2", 11945 ISSN = "0001-0782", 11946 bibdate = "Tue Mar 25 13:26:09 MST 1997", 11947 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Ai/nonmono.bib", 11948 abstract = "This paper presents a detailed description of the program and a comprehensive account of the experiments that have been performed with it.", 11949 acknowledgement = ack-nhfb, 11950 classcodes = "C1230 (Artificial intelligence)", 11951 classification = "723", 11952 corpsource = "Nat. Inst. Health, Bethesda, MD, USA", 11953 journalabr = "Commun ACM", 11954 keywords = "computer programming; heuristics; inference rules; paramodulation; partial ordering; resolution; theorem proving", 11955 treatment = "X Experimental", 11956 } 11957 11958 @Article{Reinsch:1973:AAE, 11959 author = "C. H. Reinsch", 11960 title = "{ACM} Algorithm 464: Eigenvalues of a Real Symmetric Tridiagonal Matrix", 11961 journal = j-CACM, 11962 volume = "16", 11963 number = "11", 11964 pages = "689--689", 11965 month = nov, 11966 year = "1973", 11967 CODEN = "CACMA2", 11968 ISSN = "0001-0782", 11969 bibdate = "Tue Mar 25 13:26:09 MST 1997", 11970 acknowledgement = ack-nhfb, 11971 classcodes = "B0290H (Linear algebra); C4140 (Linear algebra); C7310 (Mathematics computing)", 11972 corpsource = "Tech. Univ., M{\"u}nchen, West Germany", 11973 keywords = "ALGOL; eigenvalues; eigenvalues and eigenfunctions; matrix; matrix algebra; QR; real; subroutines; symmetric; transformation; tridiagonal", 11974 treatment = "P Practical", 11975 } 11976 11977 @Article{Hill:1973:AAS, 11978 author = "G. W. Hill", 11979 title = "{ACM} Algorithm 465: {Student}'s $t$ Frequency", 11980 journal = j-CACM, 11981 volume = "16", 11982 number = "11", 11983 pages = "690--690", 11984 month = nov, 11985 year = "1973", 11986 CODEN = "CACMA2", 11987 ISSN = "0001-0782", 11988 bibdate = "Tue Mar 25 13:26:09 MST 1997", 11989 acknowledgement = ack-nhfb, 11990 classcodes = "C7310 (Mathematics computing)", 11991 corpsource = "CSIRO, Glen Osmond, SA, Australia", 11992 keywords = "ALGOL; approximation; density function; series; statistics; student's t statistic; subroutine; subroutines", 11993 treatment = "P Practical", 11994 } 11995 11996 @Article{Ehrlich:1973:AAF, 11997 author = "G. Ehrlich", 11998 title = "{ACM} Algorithm 466: Four Combinatorial Algorithms", 11999 journal = j-CACM, 12000 volume = "16", 12001 number = "11", 12002 pages = "690--691", 12003 month = nov, 12004 year = "1973", 12005 CODEN = "CACMA2", 12006 ISSN = "0001-0782", 12007 bibdate = "Tue Mar 25 13:26:09 MST 1997", 12008 acknowledgement = ack-nhfb, 12009 classcodes = "C7310 (Mathematics computing)", 12010 corpsource = "Weizmann Inst. Sci., Rehovot, Israel", 12011 keywords = "combinations; combinatorial algorithms; permutations; PL/1; statistics; subroutines", 12012 treatment = "P Practical", 12013 } 12014 12015 @Article{Brenner:1973:AAM, 12016 author = "N. Brenner", 12017 title = "{ACM} Algorithm 467: Matrix Transposition in Place", 12018 journal = j-CACM, 12019 volume = "16", 12020 number = "11", 12021 pages = "692--694", 12022 month = nov, 12023 year = "1973", 12024 CODEN = "CACMA2", 12025 ISSN = "0001-0782", 12026 bibdate = "Tue Mar 25 13:26:09 MST 1997", 12027 note = "See also \cite{Leathers:1979:RAS}.", 12028 acknowledgement = ack-nhfb, 12029 classcodes = "B0290H (Linear algebra); C4140 (Linear algebra); C7310 (Mathematics computing)", 12030 corpsource = "MIT, Cambridge, MA, USA", 12031 keywords = "in place; matrix algebra; matrix operations; number theory; permutations; primitive; rectangular matrix; roots; subroutines; transposition", 12032 treatment = "P Practical", 12033 } 12034 12035 @Article{Patterson:1973:AAA, 12036 author = "T. N. L. Patterson", 12037 title = "{ACM} Algorithm 468: Algorithm for Automatic Numerical Integration Over a Finite Interval", 12038 journal = j-CACM, 12039 volume = "16", 12040 number = "11", 12041 pages = "694--699", 12042 month = nov, 12043 year = "1973", 12044 CODEN = "CACMA2", 12045 ISSN = "0001-0782", 12046 bibdate = "Tue Mar 25 13:26:09 MST 1997", 12047 acknowledgement = ack-nhfb, 12048 classcodes = "B0290M (Numerical integration and differentiation); C4160 (Numerical integration and differentiation); C7310 (Mathematics computing)", 12049 keywords = "finite interval; FORTRAN algorithm; integration; numerical; numerical integration; numerical methods; quadrature; subroutines", 12050 treatment = "P Practical", 12051 } 12052 12053 @Article{Lam:1973:AAA, 12054 author = "C. Lam and J. McKay", 12055 title = "{ACM} Algorithm 469: Arithmetic Over a Finite Field", 12056 journal = j-CACM, 12057 volume = "16", 12058 number = "11", 12059 pages = "699--699", 12060 month = nov, 12061 year = "1973", 12062 CODEN = "CACMA2", 12063 ISSN = "0001-0782", 12064 bibdate = "Tue Mar 25 13:26:09 MST 1997", 12065 acknowledgement = ack-nhfb, 12066 classcodes = "B0290H (Linear algebra); C4140 (Linear algebra); C5230 (Digital arithmetic methods); C7310 (Mathematics computing)", 12067 corpsource = "Caltech Univ., Pasadena, CA, USA", 12068 keywords = "algebra; ALGOL; arithmetic; digital arithmetic; finite field; linear algebra; rational operations; subroutines", 12069 treatment = "P Practical", 12070 } 12071 12072 @Article{Denning:1973:NSO, 12073 author = "Peter J. Denning and G. Scott Graham", 12074 title = "A Note on Subexpression Ordering in the Execution of Arithmetic Expressions", 12075 journal = j-CACM, 12076 volume = "16", 12077 number = "11", 12078 pages = "700--702", 12079 month = nov, 12080 year = "1973", 12081 CODEN = "CACMA2", 12082 ISSN = "0001-0782", 12083 MRclass = "68A20", 12084 MRnumber = "50 11844", 12085 mrreviewer = "B. S. Baker", 12086 bibdate = "Tue Mar 25 13:26:09 MST 1997", 12087 bibsource = "Compendex database", 12088 note = "Erratum, ibid. 17, 1974, 455.", 12089 abstract = "A counterexample to the supposed optimality of an algorithm for generating schedules for trees of tasks with unequal execution times is presented. A comparison with the ``critical path'' heuristic is discussed.", 12090 acknowledgement = ack-nhfb, 12091 classcodes = "C4240 (Programming and algorithm theory); C5230 (Digital arithmetic methods); C6150J (Operating systems)", 12092 classification = "723", 12093 corpsource = "Purdue Univ., Lafayette, IN, USA", 12094 journalabr = "Commun ACM", 12095 keywords = "arithmetic expressions; computer operating systems; digital arithmetic; execution; multiprocessing programs; multiprocessor scheduling; ordering; scheduling; subexpression; task; tree scheduling", 12096 treatment = "T Theoretical or Mathematical", 12097 } 12098 12099 @Article{Feldman:1973:CBS, 12100 author = "Jerome A. Feldman and James R. Low and R. P. Brent", 12101 title = "Comment on {Brent}'s scatter storage algorithm (and author's reply)", 12102 journal = j-CACM, 12103 volume = "16", 12104 number = "11", 12105 pages = "703--703", 12106 month = nov, 12107 year = "1973", 12108 CODEN = "CACMA2", 12109 ISSN = "0001-0782", 12110 bibdate = "Tue Mar 25 13:26:09 MST 1997", 12111 acknowledgement = ack-nhfb, 12112 classcodes = "C6120 (File organisation)", 12113 corpsource = "Stanford Univ., CA, USA", 12114 keywords = "dynamic chaining; file organisation; hashing; Hashing; information storage and retrieval; scatter storage; scatter storage algorithm; searching; storage allocation; storage management; symbol table", 12115 treatment = "T Theoretical or Mathematical", 12116 } 12117 12118 @Article{Wegner:1973:TP, 12119 author = "E. Wegner", 12120 title = "Tree-structured programs", 12121 journal = j-CACM, 12122 volume = "16", 12123 number = "11", 12124 pages = "704--705", 12125 month = nov, 12126 year = "1973", 12127 CODEN = "CACMA2", 12128 ISSN = "0001-0782", 12129 bibdate = "Tue Mar 25 13:26:09 MST 1997", 12130 acknowledgement = ack-nhfb, 12131 classcodes = "C4290 (Other computer theory); C6110 (Systems analysis and programming)", 12132 corpsource = "Tech. Univ., Berlin, West Germany", 12133 keywords = "compilers; control structures; data structures; fixpoints; flowcharts; goto statements; graphs; inductive assertion; least; program documentation; program flow; programming; programming language design; proof of programs; semantics of programming languages; structured programming; tree structure", 12134 treatment = "G General Review; P Practical", 12135 } 12136 12137 @Article{Salzer:1973:RSC, 12138 author = "Herbert E. Salzer", 12139 title = "A recurrence scheme for converting from one orthogonal expansion into another", 12140 journal = j-CACM, 12141 volume = "16", 12142 number = "11", 12143 pages = "705--707", 12144 month = nov, 12145 year = "1973", 12146 CODEN = "CACMA2", 12147 ISSN = "0001-0782", 12148 MRclass = "65D05 (65Q05)", 12149 MRnumber = "52 15956", 12150 bibdate = "Tue Mar 25 13:26:09 MST 1997", 12151 acknowledgement = ack-nhfb, 12152 classcodes = "B0290H (Linear algebra); C4140 (Linear algebra)", 12153 keywords = "Chebyshev; Clenshaw recurrence; Hamming recurrence; numerical methods; orthogonal expansions; polynomials; recurrence; schemes; series; series (mathematics); series interconversion", 12154 treatment = "T Theoretical or Mathematical", 12155 } 12156 12157 @Article{Stenger:1973:AAS, 12158 author = "F. Stenger", 12159 title = "An algorithm for the approximate solution of {Wiener-Hopf} integral equations", 12160 journal = j-CACM, 12161 volume = "16", 12162 number = "11", 12163 pages = "708--710", 12164 month = nov, 12165 year = "1973", 12166 CODEN = "CACMA2", 12167 ISSN = "0001-0782", 12168 bibdate = "Tue Mar 25 13:26:09 MST 1997", 12169 acknowledgement = ack-nhfb, 12170 classcodes = "B0290R (Integral equations); C4180 (Integral equations)", 12171 corpsource = "Univ. Utah, Salt Lake City, UT, USA", 12172 keywords = "algorithm; approximate solution; convolution; Hopf; integral equations; numerical methods; Wiener", 12173 treatment = "T Theoretical or Mathematical", 12174 } 12175 12176 @Article{Ehrlich:1973:SBE, 12177 author = "L. W. Ehrlich", 12178 title = "Solving the Biharmonic Equation in a Square: a Direct Versus a Semidirect Method", 12179 journal = j-CACM, 12180 volume = "16", 12181 number = "11", 12182 pages = "711--714", 12183 month = nov, 12184 year = "1973", 12185 CODEN = "CACMA2", 12186 ISSN = "0001-0782", 12187 bibdate = "Tue Mar 25 13:26:09 MST 1997", 12188 bibsource = "Compendex database", 12189 abstract = "Two methods for solving the biharmonic equation are compared. One method is direct, using eigenvalue-eigenvector decomposition. The other method is iterative, solving a Poisson equation directly at each iteration.", 12190 acknowledgement = ack-nhfb, 12191 classcodes = "B0290P (Differential equations); C4170 (Differential equations)", 12192 classification = "723", 12193 corpsource = "Johns Hopkins Univ., Baltimore, MD, USA", 12194 journalabr = "Commun ACM", 12195 keywords = "biharmonic; biharmonic equation; compared; computer systems programming; decomposition; difference; difference equations; eigenvalues and eigenfunctions; eigenvector; equations; iterative; iterative methods; numerical methods; partial differential; Poisson equation; square", 12196 treatment = "T Theoretical or Mathematical", 12197 } 12198 12199 @Article{Couger:1973:CRU, 12200 author = "J. Daniel Couger", 12201 title = "Curriculum Recommendations for Undergraduate Programs in Information Systems", 12202 journal = j-CACM, 12203 volume = "16", 12204 number = "12", 12205 pages = "727--749", 12206 month = dec, 12207 year = "1973", 12208 CODEN = "CACMA2", 12209 ISSN = "0001-0782", 12210 bibdate = "Tue Mar 25 13:26:09 MST 1997", 12211 abstract = "The need for education related to information systems in organizations is discussed, and a curriculum is proposed for an undergraduate program. Material necessary for such programs is identified, and courses incorporating it are specified.Detailed course descriptions are presented. Program organization and a problems of implementation are discussed.", 12212 acknowledgement = ack-nhfb, 12213 classcodes = "C0220 (Computing education and training); C0310 (EDP management); C6110 (Systems analysis and programming); C7100 (Business and administration)", 12214 keywords = "curriculum; education; information analysis; information systems; management information systems; management systems; recommendations; system design; systems analysis; undergraduate; undergraduate curricula", 12215 treatment = "B Bibliography; P Practical", 12216 } 12217 12218 @Article{Sibley:1973:DDM, 12219 author = "Edgar H. Sibley and Robert W. Taylor", 12220 title = "A Data Definition and Mapping Language", 12221 journal = j-CACM, 12222 volume = "16", 12223 number = "12", 12224 pages = "750--759", 12225 month = dec, 12226 year = "1973", 12227 CODEN = "CACMA2", 12228 ISSN = "0001-0782", 12229 bibdate = "Tue Mar 25 13:26:09 MST 1997", 12230 bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib", 12231 acknowledgement = ack-nhfb, 12232 annote = "Overview of data translation", 12233 classcodes = "C6120 (File organisation)", 12234 corpsource = "Univ. Michigan, Ann Arbor, MI, USA", 12235 keywords = "data base management; data definition language; data structures; data translation; file organisation; file translation; mapping language; storage allocation; storage structure; systems", 12236 treatment = "A Application; T Theoretical or Mathematical", 12237 } 12238 12239 @Article{Kubicek:1973:AAL, 12240 author = "M. Kubicek", 12241 title = "{ACM} Algorithm 470: Linear Systems with Almost Tridiagonal Matrix", 12242 journal = j-CACM, 12243 volume = "16", 12244 number = "12", 12245 pages = "760--761", 12246 month = dec, 12247 year = "1973", 12248 CODEN = "CACMA2", 12249 ISSN = "0001-0782", 12250 bibdate = "Tue Mar 25 13:26:09 MST 1997", 12251 acknowledgement = ack-nhfb, 12252 classcodes = "B0290H (Linear algebra); C4140 (Linear algebra); C7310 (Mathematics computing)", 12253 corpsource = "Tech. Univ., Praha, Czechoslovakia", 12254 keywords = "almost tridiagonal matrix; FAKUB; FORTRAN; linear systems; matrix algebra; program; sparse matrix; subroutines", 12255 treatment = "A Application; T Theoretical or Mathematical", 12256 } 12257 12258 @Article{Gautschi:1973:AAE, 12259 author = "W. Gautschi", 12260 title = "{ACM} Algorithm 471: Exponential Integrals", 12261 journal = j-CACM, 12262 volume = "16", 12263 number = "12", 12264 pages = "761--763", 12265 month = dec, 12266 year = "1973", 12267 CODEN = "CACMA2", 12268 ISSN = "0001-0782", 12269 bibdate = "Tue Mar 25 13:26:09 MST 1997", 12270 acknowledgement = ack-nhfb, 12271 classcodes = "B0290M (Numerical integration and differentiation); C4160 (Numerical integration and differentiation); C7310 (Mathematics computing)", 12272 corpsource = "Purdue Univ., Lafayette, IN, USA", 12273 keywords = "ALGOL; computation; continued fractions; exponential integrals; integration; recurrence relations; recursive; subroutine; subroutines", 12274 treatment = "A Application; T Theoretical or Mathematical", 12275 } 12276 12277 @Article{Herriot:1973:AAP, 12278 author = "J. G. Herriot and C. H. Reinsch", 12279 title = "{ACM} Algorithm 472: Procedures for Natural Spline Interpolation", 12280 journal = j-CACM, 12281 volume = "16", 12282 number = "12", 12283 pages = "763--768", 12284 month = dec, 12285 year = "1973", 12286 CODEN = "CACMA2", 12287 ISSN = "0001-0782", 12288 bibdate = "Tue Mar 25 13:26:09 MST 1997", 12289 acknowledgement = ack-nhfb, 12290 classcodes = "B0290F (Interpolation and function approximation); C4130 (Interpolation and function approximation); C7310 (Mathematics computing)", 12291 corpsource = "Stanford Univ., CA, USA", 12292 keywords = "approximation; cubic natural spline; interpolation; natural spline interpolation; procedures; splines (mathematics); subroutines", 12293 treatment = "A Application; T Theoretical or Mathematical", 12294 } 12295 12296 @Article{Lyon:1974:SLA, 12297 author = "G. Lyon", 12298 title = "Syntax-directed least-errors analysis for context-free languages: a practical approach", 12299 journal = j-CACM, 12300 volume = "17", 12301 number = "1", 12302 pages = "3--14", 12303 month = jan, 12304 year = "1974", 12305 CODEN = "CACMA2", 12306 ISSN = "0001-0782", 12307 bibdate = "Tue Mar 25 13:26:09 MST 1997", 12308 acknowledgement = ack-nhfb, 12309 classcodes = "C4210 (Formal logic)", 12310 corpsource = "Nat. Bur. Stand., Washington, DC, USA", 12311 keywords = "arbitrary input strings; context free grammars; context-free languages; dynamic programming; error analysis; least errors correction; merging; parsing; separability; state; stored subanalyses", 12312 treatment = "T Theoretical or Mathematical", 12313 } 12314 12315 @Article{Malcolm:1974:FMS, 12316 author = "Michael A. Malcolm and John Palmer", 12317 title = "A Fast Method For Solving a Class of Tridiagonal Systems of Linear Equations", 12318 journal = j-CACM, 12319 volume = "17", 12320 number = "1", 12321 pages = "14--17", 12322 month = jan, 12323 year = "1974", 12324 CODEN = "CACMA2", 12325 ISSN = "0001-0782", 12326 MRclass = "65F05", 12327 MRnumber = "48 10076", 12328 mrreviewer = "D. B. Hunter", 12329 bibdate = "Tue Mar 25 13:26:09 MST 1997", 12330 bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Theory/Matrix.bib", 12331 abstract = "The solution of linear systems having real, symmetric, diagonally dominant,tridiagonal coefficient matrices with constant diagonals is considered. It is proved that the diagonals of the LU decomposition converges when floating-point precision. It is also proved that the computed LU decomposition converges when floating-point arithmetic is used and that the limits of the LU diagonals using floating point are roughly within machine precision of the limits using real arithmetic. This fact is exploited to reduce the number of floating-point operations required to solve a linear system from $8n-7$ to $5n+2k-3$, where $k$ is much less than $n$, the order of the matrix. If the elements of the subdiagonals and superdiagonals are 1, then only $4n+2k-3$ operations are needed. The entire LU decomposition takes $k$ words of storage, and considerable savings in array subscripting are achieved. Upper and lower bounds on $k$ are obtained in terms of the ratio of the coefficient matrix diagonal constants and parameters of the floating-point number system. Various generalizations of these results are discussed.", 12332 acknowledgement = ack-nhfb, 12333 classcodes = "B0290H (Linear algebra); C4140 (Linear algebra); C5230 (Digital arithmetic methods)", 12334 corpsource = "Univ. Waterloo, Ont., Canada", 12335 keywords = "digital arithmetic; fast method; floating point; linear systems; matrix algebra; numerical linear algebra; operations; real arithmetic; Toeplitz matrices; tridiagonal matrices", 12336 kwds = "nla, linear system, tridiagonal matrix, fast algorithm", 12337 treatment = "T Theoretical or Mathematical", 12338 xxtitle = "A fast method for solving a class of tridiagonal linear systems", 12339 } 12340 12341 @Article{Akima:1974:MBI, 12342 author = "H. Akima", 12343 title = "A method of bivariate interpolation and smooth surface fitting based on local procedures", 12344 journal = j-CACM, 12345 volume = "17", 12346 number = "1", 12347 pages = "18--20", 12348 month = jan, 12349 year = "1974", 12350 CODEN = "CACMA2", 12351 ISSN = "0001-0782", 12352 bibdate = "Tue Mar 25 13:26:09 MST 1997", 12353 bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Graphics/siggraph/pre75.bib", 12354 acknowledgement = ack-nhfb, 12355 classcodes = "B0290F (Interpolation and function approximation); C4130 (Interpolation and function approximation)", 12356 corpsource = "US Dept. Commerce, Boulder, Colo., USA", 12357 keywords = "bivariate interpolation; interpolation; local; partial derivative; polynomial; procedures; smooth surface fitting", 12358 treatment = "T Theoretical or Mathematical", 12359 } 12360 12361 @Article{Gibbs:1974:TP, 12362 author = "Norman E. Gibbs and William G. {Poole, Jr.}", 12363 title = "Tridiagonalization by Permutations", 12364 journal = j-CACM, 12365 volume = "17", 12366 number = "1", 12367 pages = "20--24", 12368 month = jan, 12369 year = "1974", 12370 CODEN = "CACMA2", 12371 ISSN = "0001-0782", 12372 MRclass = "65F15", 12373 MRnumber = "48 7567", 12374 mrreviewer = "J. Hurt", 12375 bibdate = "Tue Mar 25 13:26:09 MST 1997", 12376 bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Theory/Matrix.bib", 12377 abstract = "Tridiagonalizing a matrix by similarity transformations is an important computational tool in numerical linear algebra. Consider the class of sparse matrices which can be tridiagonalized using only row and corresponding column permutations. The advantages of using such a transformation include the absence of round-off errors and improved computation time when compared with standard transformations. \par A graph theoretic algorithm which examines an arbitrary $n \times n$ matrix and determines whether or not it can be permuted into tridiagonal form is given. The algorithm requires no arithmetic while the number of comparisons, the number of assignments, and the number of increments are linear in $n$. This compares very favorably with standard transformation methods. \par If the matrix is permutable into tridiagonal form, the algorithm gives the explicit tridiagonal form. Otherwise, early rejection will occur.", 12378 acknowledgement = ack-nhfb, 12379 classcodes = "B0290H (Linear algebra); C4140 (Linear algebra)", 12380 corpsource = "College William and Mary, Williamsburg, VA, USA", 12381 keywords = "algorithm; bandwidth; eigenvalues; graph; matrix algebra; permutation; sparse matrix; tridiagonal matrix", 12382 kwds = "nla, tridiagonal matrix, permutation matrix", 12383 treatment = "T Theoretical or Mathematical", 12384 } 12385 12386 @Article{Piessens:1974:AAC, 12387 author = "R. Piessens", 12388 title = "{ACM} Algorithm 473: Computation of {Legendre} Series Coefficients", 12389 journal = j-CACM, 12390 volume = "17", 12391 number = "1", 12392 pages = "25--25", 12393 month = jan, 12394 year = "1974", 12395 CODEN = "CACMA2", 12396 ISSN = "0001-0782", 12397 bibdate = "Tue Mar 25 13:26:09 MST 1997", 12398 acknowledgement = ack-nhfb, 12399 classcodes = "B0290F (Interpolation and function approximation); C4130 (Interpolation and function approximation); C7310 (Mathematics computing)", 12400 corpsource = "Univ. Leuven, Heverlee, Belgium", 12401 keywords = "Chebyshev; Chebyshev approximation; coefficients; computation; FORTRAN; Legendre series; LEGSER; series; series (mathematics); subroutines", 12402 treatment = "A Application; T Theoretical or Mathematical", 12403 } 12404 12405 @Article{Akima:1974:AAB, 12406 author = "H. Akima", 12407 title = "{ACM} Algorithm 474: Bivariate Interpolation and Smooth Surface Fitting Based on Local Procedures", 12408 journal = j-CACM, 12409 volume = "17", 12410 number = "1", 12411 pages = "26--31", 12412 month = jan, 12413 year = "1974", 12414 CODEN = "CACMA2", 12415 ISSN = "0001-0782", 12416 bibdate = "Tue Mar 25 13:26:09 MST 1997", 12417 note = "See also \cite{Anderson:1979:RBI}.", 12418 acknowledgement = ack-nhfb, 12419 classcodes = "B0290F (Interpolation and function approximation); C4130 (Interpolation and function approximation); C7310 (Mathematics computing)", 12420 corpsource = "US Dept Commerce, Boulder, Colo., USA", 12421 keywords = "bivariate interpolation; FORTRAN; interpolation; ITPLBV; local; partial derivative; polynomial; procedures; SFCFIT; smooth surface fitting; subroutines", 12422 treatment = "A Application; T Theoretical or Mathematical", 12423 } 12424 12425 @Article{Sutherland:1974:RPC, 12426 author = "Ivan E. Sutherland and Gary W. Hodgman", 12427 title = "Reentrant Polygon Clipping", 12428 journal = j-CACM, 12429 volume = "17", 12430 number = "1", 12431 pages = "32--42", 12432 month = jan, 12433 year = "1974", 12434 CODEN = "CACMA2", 12435 ISSN = "0001-0782", 12436 bibdate = "Tue Mar 25 13:26:09 MST 1997", 12437 acknowledgement = ack-nhfb, 12438 classcodes = "C5540 (Terminals and graphic displays); C6130 (Data handling techniques)", 12439 corpsource = "Evand and Sutherland Computer Corp., Salt Lake City, UT, USA", 12440 keywords = "algorithms; computer; computer graphics; data handling; graphics; hidden line; perspective; perspective projection; pictures; planes; polygon clipping; reentrant polygon clipping; surface; three dimensions", 12441 treatment = "A Application; T Theoretical or Mathematical", 12442 } 12443 12444 @Article{King:1974:CAV, 12445 author = "P. J. H. King and R. G. Johnson", 12446 title = "Comments on the algorithms of {Verhelst} for the conversion of limited-entry decision tables to flowcharts (and author's reply)", 12447 journal = j-CACM, 12448 volume = "17", 12449 number = "1", 12450 pages = "43--45", 12451 month = jan, 12452 year = "1974", 12453 CODEN = "CACMA2", 12454 ISSN = "0001-0782", 12455 bibdate = "Tue Mar 25 13:26:09 MST 1997", 12456 acknowledgement = ack-nhfb, 12457 classcodes = "C6110 (Systems analysis and programming)", 12458 corpsource = "Birkbeck Coll., Univ. London, UK", 12459 keywords = "algorithms; conversion; decision table; decision tables; flow charting; flowcharting; optimal programs; preprocessor; search", 12460 treatment = "P Practical", 12461 } 12462 12463 @Article{Knott:1974:NSC, 12464 author = "Gary D. Knott", 12465 title = "A Numbering System for Combinations", 12466 journal = j-CACM, 12467 volume = "17", 12468 number = "1", 12469 pages = "45--46", 12470 month = jan, 12471 year = "1974", 12472 CODEN = "CACMA2", 12473 ISSN = "0001-0782", 12474 bibdate = "Tue Mar 25 13:26:09 MST 1997", 12475 acknowledgement = ack-nhfb, 12476 classcodes = "C6110 (Systems analysis and programming)", 12477 corpsource = "Nat. Inst. Health, Bethesda, MD, USA", 12478 keywords = "coding system; coding systems; combinations; combinatorics; numbering system; programming; programming techniques; storage mapping function; storage mapping functions", 12479 treatment = "A Application; T Theoretical or Mathematical", 12480 } 12481 12482 @Article{Lucas:1974:CRG, 12483 author = "H. C. {Lucas, Jr.}", 12484 title = "A {CRT} report generating system", 12485 journal = j-CACM, 12486 volume = "17", 12487 number = "1", 12488 pages = "47--48", 12489 month = jan, 12490 year = "1974", 12491 CODEN = "CACMA2", 12492 ISSN = "0001-0782", 12493 bibdate = "Tue Mar 25 13:26:09 MST 1997", 12494 acknowledgement = ack-nhfb, 12495 classcodes = "C6110 (Systems analysis and programming)", 12496 corpsource = "Stanford Univ., CA, USA", 12497 keywords = "automated systems design; data; management; processing; programming; report generation; report generators; systems analysis", 12498 treatment = "P Practical", 12499 } 12500 12501 @Article{Rothnie:1974:ABF, 12502 author = "James B. {Rothnie, Jr.} and Tomas Lozano", 12503 title = "Attribute Based File Organization in a Paged Memory Environment", 12504 journal = j-CACM, 12505 volume = "17", 12506 number = "2", 12507 pages = "63--69", 12508 month = feb, 12509 year = "1974", 12510 CODEN = "CACMA2", 12511 ISSN = "0001-0782", 12512 bibdate = "Tue Mar 25 13:26:09 MST 1997", 12513 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Database/database.bib", 12514 abstract = "This article analyzes the high cost of page accessing and proposes a method called multiple key hashing which attempts to minimize it. since this approach is not always preferable to inversion, a combined method is described. The exact specifications of this combination for a file with given data and traffic characteristics are formulated as a mathematical program. The proposed heuristic solution to this program can often improve on a simple inversion technique by a factor of 2 or 3.", 12515 acknowledgement = ack-nhfb, 12516 classcodes = "C6120 (File organisation)", 12517 classification = "723", 12518 corpsource = "MIT, Cambridge, MA, USA", 12519 journalabr = "Commun ACM", 12520 keywords = "attribute based file organization; cost; data organization; data processing; data storage, digital; file organisation; file organization; heuristic solution; inverted file; mathematical; mathematical programming; multikey retrieval; multiple key hashing; page accessing; paged memories; paged memory environment; paging; program; retrieval algorithm; virtual storage", 12521 treatment = "A Application; E Economic; T Theoretical or Mathematical", 12522 } 12523 12524 @Article{Jordan:1974:COR, 12525 author = "B. W. {Jordan, Jr.} and R. C. Barrett", 12526 title = "A cell organized raster display for line drawings", 12527 journal = j-CACM, 12528 volume = "17", 12529 number = "2", 12530 pages = "70--77", 12531 month = feb, 12532 year = "1974", 12533 CODEN = "CACMA2", 12534 ISSN = "0001-0782", 12535 bibdate = "Tue Mar 25 13:26:09 MST 1997", 12536 bibsource = "Compendex database", 12537 abstract = "Raster scan computer graphics displays with ``real time'' character generators have previously been limited to alphanumeric characters. A display is described which extends the capabilities of this organization to include general graphics. The feasibility of such a display is shown by deriving the minimum number of patterns required in the read only memory of the character generator to synthesize an arbitrary line. The synthesis process does not compromise picture quality, since the resulting dot patterns are identical with those of a conventional raster display. The time constraints of a raster display are shown to be satisfied for a typical design for very complex line drawings.", 12538 acknowledgement = ack-nhfb, 12539 classcodes = "C5540 (Terminals and graphic displays); C6130 (Data handling techniques)", 12540 classification = "722", 12541 corpsource = "Northwestern Univ., Evanston, IL, USA", 12542 journalabr = "Commun ACM", 12543 keywords = "arbitrary line; cell organized raster display; complex line drawings; computer; computer graphic equipment; computer graphics; computer peripheral equipment; discrete; dot; dot generation; graphics displays; image; line drawing; line drawings; matrix displays; minimum; number of patterns; patterns; read only memory; real time character generators", 12544 treatment = "P Practical", 12545 } 12546 12547 @Article{Ramberg:1974:AMG, 12548 author = "John S. Ramberg and Bruce W. Schmeiser", 12549 title = "An Approximate Method for Generating Asymmetric Random Variables", 12550 journal = j-CACM, 12551 volume = "17", 12552 number = "2", 12553 pages = "78--82", 12554 month = feb, 12555 year = "1974", 12556 CODEN = "CACMA2", 12557 ISSN = "0001-0782", 12558 MRclass = "65C10", 12559 MRnumber = "48 10043", 12560 mrreviewer = "J. Spanier", 12561 bibdate = "Tue Mar 25 13:26:09 MST 1997", 12562 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1974.bib", 12563 abstract = "Tukey's lambda distribution is generalized to provide an algorithm for generating values of unimodal asymmetric random variables. This algorithm has the same advantages as the symmetric random variable generator previously given by the authors, except that the addition of another parameter complicates the problem of finding the parameter values to fit a distribution.", 12564 acknowledgement = ack-nhfb, 12565 classcodes = "C7890 (Other special applications of computing)", 12566 classification = "723; 922", 12567 corpsource = "Univ. Iowa, IA, USA", 12568 country = "USA", 12569 descriptors = "RNG; RVG;", 12570 enum = "2505", 12571 journalabr = "Commun ACM", 12572 keywords = "approximate method; approximations; computer programming --- Subroutines; distribution; generating asymmetric random variables; mathematical statistics; moments; Monte Carlo; Monte Carlo methods; probability; random number generation; random numbers; random variables; simulation; statistics; Tukey's lambda distribution; unimodal asymmetric random; variables", 12573 language = "English", 12574 treatment = "T Theoretical or Mathematical", 12575 } 12576 12577 @Article{Lamport:1974:PED, 12578 author = "Leslie Lamport", 12579 title = "The Parallel Execution of {DO} Loops", 12580 journal = j-CACM, 12581 volume = "17", 12582 number = "2", 12583 pages = "83--93", 12584 month = feb, 12585 year = "1974", 12586 CODEN = "CACMA2", 12587 ISSN = "0001-0782", 12588 bibdate = "Tue Mar 25 13:26:09 MST 1997", 12589 bibsource = "Compendex database", 12590 abstract = "Methods are developed for the parallel execution of different iterations of a DO loop. Both asynchronous multiprocessor computers and array computers are considered. Practical application to the design of compilers for such computers is discussed.", 12591 acknowledgement = ack-nhfb, 12592 classcodes = "C6110 (Systems analysis and programming); C6150C (Compilers, interpreters and other processors)", 12593 classification = "722; 723", 12594 corpsource = "Massachusetts Computer Associates Inc., Wakefield, MA, USA", 12595 journalabr = "Commun ACM", 12596 keywords = "array computers; asynchronous multiprocessor; computer operating systems --- Program Compilers; computer systems, digital; computers; computing; design of compilers; DO loops; loops; parallel; parallel execution; parallel processing; program compilers; programming; vector computers", 12597 treatment = "A Application; T Theoretical or Mathematical", 12598 } 12599 12600 @Article{Ledgard:1974:PSC, 12601 author = "Henry F. Ledgard", 12602 title = "{Production Systems}: or can we do better than {BNF}?", 12603 journal = j-CACM, 12604 volume = "17", 12605 number = "2", 12606 pages = "94--102", 12607 month = feb, 12608 year = "1974", 12609 CODEN = "CACMA2", 12610 ISSN = "0001-0782", 12611 bibdate = "Tue Mar 25 13:26:09 MST 1997", 12612 bibsource = "Compendex database", 12613 abstract = "Since the development of BNF, the definition of the syntax of programming languages has been almost universally associated with context-free requirements. \par Yet numerous interesting and difficult issues in syntax stem from the context-sensitive requirements, notably the compatibility between the declaration of an identifier and its uses, the correspondence between actual and formal parameters, and issues arising from block structure. This paper explores the use of a formal notation called Production Systems in providing a readable and complete formal definition of syntax. As a practical illustration, a small but significant subset of PL/I is considered. A more detailed presentation, as well as the application to define abstract syntax and translations between languages, is given in a previous paper by the author.", 12614 acknowledgement = ack-nhfb, 12615 classcodes = "C4210 (Formal logic)", 12616 classification = "721; 723", 12617 corpsource = "Univ. Massachusetts, Amherst, MA, USA", 12618 journalabr = "Commun ACM", 12619 keywords = "automata theory; BNF; compilers; computer programming languages; context sensitive grammars; context sensitive requirements; context-sensitive grammars; definition; definition of syntax; formal; formal definition; PL/I standards; Production Systems; readable and complete formal; syntax; syntax of programming languages; translation", 12620 treatment = "A Application; T Theoretical or Mathematical", 12621 } 12622 12623 @Article{Wegbreit:1974:SLP, 12624 author = "Ben Wegbreit", 12625 title = "The Synthesis of Loop Predicates", 12626 journal = j-CACM, 12627 volume = "17", 12628 number = "2", 12629 pages = "102--112", 12630 month = feb, 12631 year = "1974", 12632 CODEN = "CACMA2", 12633 ISSN = "0001-0782", 12634 MRclass = "68A05", 12635 MRnumber = "49 8420", 12636 mrreviewer = "Armin Cremers", 12637 bibdate = "Tue Mar 25 13:26:09 MST 1997", 12638 bibsource = "Compendex database", 12639 abstract = "Current methods for mechanical program verification require a complete predicate specification on each loop. Because this is tedious and error prone, producing a program with complete, correct predicates is reasonably difficult and would be facilitated by machine assistance. This paper discusses techniques for mechanically synthesizing loop predicates. Two classes of techniques are considered: (1) heuristic methods which derive loop predicates from boundary conditions and/or partially specified inductive assertions: (2) extraction methods which use input predicates and appropriate weak interpretations to obtain certain classes of loop predicates by an evaluation on the weak interpretation.", 12640 acknowledgement = ack-nhfb, 12641 classcodes = "C4240 (Programming and algorithm theory); C6150G (Diagnostic, testing, debugging and evaluating systems)", 12642 classification = "721; 723", 12643 corpsource = "Harvard Univ., Cambridge, MA, USA", 12644 journalabr = "Commun ACM", 12645 keywords = "assertions; automata theory --- Theorem Proving; boundary conditions; computer operating systems; computer programming; extraction methods; heuristic methods; inductive; inductive assertions; input predicates; interpretations; loop predicates; mechanical program verification; program debugging; program verification; program verifiers; programming theory; property extraction; synthesis; synthesis of loop predicates; theorem proving; weak; weak interpretation; weak interpretations; well founded sets; well-founded sets", 12646 treatment = "A Application; T Theoretical or Mathematical", 12647 } 12648 12649 @Article{Sreenivasan:1974:CRS, 12650 author = "K. Sreenivasan and A. J. Kleinman", 12651 title = "On the Construction of a Representative Synthetic Workload", 12652 journal = j-CACM, 12653 volume = "17", 12654 number = "3", 12655 pages = "127--133", 12656 month = mar, 12657 year = "1974", 12658 CODEN = "CACMA2", 12659 ISSN = "0001-0782", 12660 bibdate = "Tue Mar 25 13:26:09 MST 1997", 12661 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib", 12662 abstract = "A general method of constructing a drive workload representative of a real workload is described. The real workload is characterized by its demands on the various system resources. These characteristics of the real workload are obtained from the system accounting data. The characteristics of the drive workload are determined by matching the joint probability density of the real workload with that of the drive workload. The drive workload is realized by using a synthetic program in which the characteristics can be varied by varying the appropriate parameters. Calibration experiments are conducted to determine expressions relating the synthetic program parameters with the workload characteristics. The general method is applied to the case of two variables, cpu seconds and number of I/O activities; and a synthetic workload with 88 jobs is constructed to represent a month's workload consisting of about 6000 jobs.", 12663 acknowledgement = ack-nhfb, 12664 classcodes = "C6150G (Diagnostic, testing, debugging and evaluating systems); C7430 (Computer engineering)", 12665 classification = "722", 12666 corpsource = "MITRE Corp., Bedford, MA, USA", 12667 journalabr = "Commun ACM", 12668 keywords = "activities; calibration experiments; computer systems, digital; computer testing; construction; cpu seconds; data; drive; joint probability density; number of I/O; real workload; representative synthetic workload; simulation; synthetic program; synthetic workload; system accounting; system resources; workload", 12669 treatment = "P Practical", 12670 } 12671 12672 @Article{Balkovich:1974:DMR, 12673 author = "E. Balkovich and W. Chiu and L. Presser and R. Wood", 12674 title = "Dynamic Memory Repacking", 12675 journal = j-CACM, 12676 volume = "17", 12677 number = "3", 12678 pages = "133--138", 12679 month = mar, 12680 year = "1974", 12681 CODEN = "CACMA2", 12682 ISSN = "0001-0782", 12683 bibdate = "Tue Mar 25 13:26:09 MST 1997", 12684 bibsource = "Compendex database", 12685 abstract = "A probabilistic model of a multiprogramming system is exercised in order to determine the conditions under which the dynamic repacking of main memory is beneficial. An expression is derived for the maximum interference that a repacking process may introduce before the original performance of the system is degraded. Alternative approaches to repacking are discussed, and the operating conditions that lead to improved system throughput through repacking are delineated.", 12686 acknowledgement = ack-nhfb, 12687 classcodes = "C6120 (File organisation); C6150J (Operating systems)", 12688 classification = "723", 12689 corpsource = "Univ. California, Santa Barbara, CA, USA", 12690 journalabr = "Commun ACM", 12691 keywords = "central; computer systems programming; dynamic memory repacking; file organisation; fragmentation; maximum interference; multiprogramming; multiprogramming system; multiprogramming system model; probabilistic model; processor productivity; resource utilization; storage; storage fragmentation; system; throughput", 12692 treatment = "A Application; T Theoretical or Mathematical", 12693 } 12694 12695 @Article{Morgan:1974:OSA, 12696 author = "Howard Lee Morgan", 12697 title = "Optimal Space Allocation on Disk Storage Devices", 12698 journal = j-CACM, 12699 volume = "17", 12700 number = "3", 12701 pages = "139--142", 12702 month = mar, 12703 year = "1974", 12704 CODEN = "CACMA2", 12705 ISSN = "0001-0782", 12706 bibdate = "Tue Mar 25 13:26:09 MST 1997", 12707 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib", 12708 abstract = "When the amount of space required for file storage exceeds the amount which can be kept online, decisions must be made as to which files are to be permanently resident and which mountable. These decisions will affect the number of mount requests issued to the operators. This is often a bottleneck in a computing facility, and reducing the number of mounts thus decreases turnaround time. An optimization model for the assignment of files to disk packs, and packs to either resident or nonresident status is presented. Heuristics are suggested for those cases in which it is inefficient to compute the actual optimum.", 12709 acknowledgement = ack-nhfb, 12710 annote = "Optimization of file allocation to mountable diskpacks.", 12711 classcodes = "C6120 (File organisation)", 12712 classification = "723", 12713 corpsource = "California Inst. Technol., Pasadena, CA, USA", 12714 journalabr = "Commun ACM", 12715 keywords = "bottleneck; computer operating systems; computing facility; disc analysis; disc files; disc storage devices; file; file systems; Heuristics; magnetic disc storage; memory hierarchy; optimal space allocation; optimization model; scheduling; storage; storage allocation", 12716 treatment = "T Theoretical or Mathematical", 12717 } 12718 12719 @Article{Loeser:1974:SPT, 12720 author = "Rudolf Loeser", 12721 title = "Some Performance Tests of ``Quicksort'' and Descendants", 12722 journal = j-CACM, 12723 volume = "17", 12724 number = "3", 12725 pages = "143--152", 12726 month = mar, 12727 year = "1974", 12728 CODEN = "CACMA2", 12729 ISSN = "0001-0782", 12730 bibdate = "Tue Mar 25 13:26:09 MST 1997", 12731 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Database/Graefe.bib", 12732 abstract = "Detailed performance evaluations are presented for six ACM algorithms: quicksort (No. 64), Shellsort (No. 201), stringsort (No. 207), ``TREESORTS3'' (No. 245), quickersort (No. 271), and qsort (No. 402). Algorithms 271 and 402 are refinements of algorithm 64, and all three are discussed in some detail. The evidence given here demonstrates that qsort (No. 402) requires many more comparisons that its author claims. Of all these algorithms, quickersort requires the fewest comparisons to sort random arrays.", 12733 acknowledgement = ack-nhfb, 12734 classcodes = "C6130 (Data handling techniques); C6150G (Diagnostic, testing, debugging and evaluating systems)", 12735 classification = "723", 12736 corpsource = "Smithsonian Astrophys. Obs., Cambridge, MA, USA", 12737 journalabr = "Commun ACM", 12738 keywords = "'quicksort'; ACM; algorithms; computer programming; computer testing; general; performance evaluations; performance tests; purpose sort algorithm; qsort; quicksort; quicksort quickersort qsort CACM; random arrays; Shellsort; sorting; sorting algorithm documentation; sorting efficiency; sorting performance tests; string sort; TREESORT3; utility sort algorithm", 12739 treatment = "P Practical", 12740 } 12741 12742 @Article{Wright:1974:VSP, 12743 author = "T. Wright", 12744 title = "Visible surface plotting program", 12745 journal = j-CACM, 12746 volume = "17", 12747 number = "3", 12748 pages = "152--157 (or 152--155??)", 12749 month = mar, 12750 year = "1974", 12751 CODEN = "CACMA2", 12752 ISSN = "0001-0782", 12753 bibdate = "Tue Mar 25 13:26:09 MST 1997", 12754 bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1972.bib", 12755 note = "See also \cite{Duta:1976:RVS,Swieten:1979:RVS}.", 12756 acknowledgement = ack-nhfb, 12757 classcodes = "C5540 (Terminals and graphic displays); C6130 (Data handling techniques)", 12758 corpsource = "Nat. Center Atmospheric Res., Boulder, CO, USA", 12759 country = "USA", 12760 descriptors = "FORTRAN; graphics; application; method; human factors; hidden line algorithm; contour surface", 12761 enum = "3343", 12762 keywords = "computer graphics; contour surface; hidden line problem; subroutines; visible surface plotting program", 12763 language = "English", 12764 references = "0", 12765 treatment = "P Practical", 12766 } 12767 12768 @Article{Bosten:1974:IBR, 12769 author = "N. E. Bosten and E. L. Battiste", 12770 title = "Incomplete beta ratio", 12771 journal = j-CACM, 12772 volume = "17", 12773 number = "3", 12774 pages = "156--157", 12775 month = mar, 12776 year = "1974", 12777 CODEN = "CACMA2", 12778 ISSN = "0001-0782", 12779 bibdate = "Tue Mar 25 13:26:09 MST 1997", 12780 acknowledgement = ack-nhfb, 12781 classcodes = "B0290F (Interpolation and function approximation); C4130 (Interpolation and function approximation); C7310 (Mathematics computing)", 12782 corpsource = "IMSL, Houston, TX, USA", 12783 keywords = "Algorithm 179; computer aided analysis; function approximation; incomplete beta ratio; subroutines", 12784 treatment = "T Theoretical or Mathematical", 12785 } 12786 12787 @Article{Barrett:1974:SCA, 12788 author = "R. C. Barrett and B. W. {Jordan, Jr.}", 12789 title = "Scan Conversion Algorithms for a Cell Organized Raster Display", 12790 journal = j-CACM, 12791 volume = "17", 12792 number = "3", 12793 pages = "157--163", 12794 month = mar, 12795 year = "1974", 12796 CODEN = "CACMA2", 12797 ISSN = "0001-0782", 12798 bibdate = "Tue Mar 25 13:26:09 MST 1997", 12799 bibsource = "Compendex database", 12800 abstract = "Raster scan computer graphics with ``real time'' character generators have previously been limited to alphanumeric characters. A display has been described which extends the capabilities of this organization to include general graphics. Two fundamentally different scan conversion algorithms which have been developed to support this display are presented. One is most suitable to noninteractive applications and the other to interactive applications. The algorithms were implemented in Fortran on the CDC6400 computer. Results obtained from the implementations show that the noninteractive algorithms can significantly reduce display file storage requirements at little cost in execution time over that of a conventional raster display. The interactive algorithm improve response time and reduce storage requirements.", 12801 acknowledgement = ack-nhfb, 12802 classcodes = "C5540 (Terminals and graphic displays); C6130 (Data handling techniques)", 12803 classification = "723", 12804 corpsource = "Hughes Aircraft Co., Culver City, CA, USA", 12805 journalabr = "Commun ACM", 12806 keywords = "'real time' character generators; cell organized raster display; computer graphics; computer programming --- Subroutines; data handling; general graphics; interactive applications; noninteractive applications; scan conversion algorithms", 12807 treatment = "A Application; P Practical", 12808 } 12809 12810 @Article{Ackerman:1974:QSH, 12811 author = "A. Frank Ackerman", 12812 title = "Quadratic Search for Hash Tables of Size $p^n$", 12813 journal = j-CACM, 12814 volume = "17", 12815 number = "3", 12816 pages = "164--164", 12817 month = mar, 12818 year = "1974", 12819 CODEN = "CACMA2", 12820 ISSN = "0001-0782", 12821 MRclass = "68A05", 12822 MRnumber = "48 10178", 12823 bibdate = "Tue Mar 25 13:26:09 MST 1997", 12824 acknowledgement = ack-nhfb, 12825 classcodes = "C6120 (File organisation); C6130 (Data handling techniques)", 12826 keywords = "file organisation; quadratic search for hash tables; table lookup", 12827 treatment = "T Theoretical or Mathematical", 12828 } 12829 12830 @Article{Stone:1974:NCP, 12831 author = "Harold S. Stone", 12832 title = "A note on a combinatorial problem of {Burnett} and {Coffman}", 12833 journal = j-CACM, 12834 volume = "17", 12835 number = "3", 12836 pages = "165--166", 12837 month = mar, 12838 year = "1974", 12839 CODEN = "CACMA2", 12840 ISSN = "0001-0782", 12841 MRclass = "05A05", 12842 MRnumber = "48 10826", 12843 bibdate = "Tue Mar 25 13:26:09 MST 1997", 12844 acknowledgement = ack-nhfb, 12845 classcodes = "B0250 (Combinatorial mathematics); C1160 (Combinatorial mathematics); C6130 (Data handling techniques)", 12846 corpsource = "Stanford Univ., CA, USA", 12847 keywords = "combinatorial analysis; combinatorial mathematics; combinatorial problem; derangements; file organisation; interleaved memory systems; interleaving; mean; memories; memory bandwidth; rencontres", 12848 treatment = "T Theoretical or Mathematical", 12849 } 12850 12851 @Article{Krogh:1974:EIV, 12852 author = "Fred T. Krogh", 12853 title = "Efficient Implementation of a Variable Projection Algorithm for Nonlinear Least Squares Problems", 12854 journal = j-CACM, 12855 volume = "17", 12856 number = "3", 12857 pages = "167--169", 12858 month = mar, 12859 year = "1974", 12860 CODEN = "CACMA2", 12861 ISSN = "0001-0782", 12862 MRclass = "65K05", 12863 MRnumber = "49 1773", 12864 bibdate = "Tue Mar 25 13:26:09 MST 1997", 12865 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Theory/Matrix.bib", 12866 note = "See errata \cite{Krogh:1974:EEI}.", 12867 abstract = "Nonlinear least squares problems frequently arise for which the variables to be solved for can be separated into a linear and a nonlinear part. A variable projection algorithm has been developed recently which is designed to take advantage of the structure of a problem whose variables separate in this way. This paper gives a slightly more efficient and slightly more general version of this algorithm than has appeared earlier.", 12868 acknowledgement = ack-nhfb, 12869 classcodes = "B0290F (Interpolation and function approximation); C4130 (Interpolation and function approximation); C7310 (Mathematics computing)", 12870 classification = "723; 921", 12871 corpsource = "California Inst. Technol., Pasadena, CA, USA", 12872 journalabr = "Commun ACM", 12873 keywords = "computer aided analysis; computer programming; least squares approximations; lsq; mathematical techniques --- Least Squares Approximations; nllsq; nlop; nlsq; nonlinear least squares; parameter estimation; problems; variable projection; variable projection algorithm; varpro", 12874 treatment = "T Theoretical or Mathematical", 12875 } 12876 12877 @Article{Saltzer:1974:SLM, 12878 author = "Jerome H. Saltzer", 12879 title = "A Simple Linear Model of Demand Paging Performance", 12880 journal = j-CACM, 12881 volume = "17", 12882 number = "4", 12883 pages = "181--186", 12884 month = apr, 12885 year = "1974", 12886 CODEN = "CACMA2", 12887 ISSN = "0001-0782", 12888 bibdate = "Tue Mar 25 13:26:09 MST 1997", 12889 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Misc/storage.bib and ftp://ftp.ira.uka.de/pub/bibliography/Misc/cache.bib", 12890 abstract = "This paper proposes and analyzes a demand paged virtual memory computer system. The simple model combines the effect of the information reference pattern with the effect of the automatic management algorithm to produce a single, composite statement: the mean number of memory references between paging exceptions increases linearly with the size of the paging memory. The resulting model is easy to manipulate, and is applicable to such diverse problems as choosing an optimum size for a paging memory, arranging for reproducible memory usage charges, and estimating the amount of core memory sharing.", 12891 acknowledgement = ack-nhfb, 12892 classcodes = "C6120 (File organisation); C6150J (Operating systems)", 12893 classification = "723", 12894 corpsource = "MIT, Cambridge, MA, USA", 12895 journalabr = "Commun ACM", 12896 keywords = "automatic management algorithm; automatically managed multilevel memory system; computer metatheory; computer testing; core memory; demand paging performance; information; linear model; memory hierarchy; memory models; operating systems (computers); optimum; paging; performance; Performance Evaluation: Analytic; performance measurement; predicting the; program reference model; reference pattern; reproducible memory usage charges; sharing; size; storage; virtual; virtual memory", 12897 treatment = "A Application; X Experimental", 12898 } 12899 12900 @Article{Franklin:1974:CPF, 12901 author = "M. A. Franklin and R. K. Gupta", 12902 title = "Computation of Page Fault Probability from Program Transition Diagram", 12903 journal = j-CACM, 12904 volume = "17", 12905 number = "4", 12906 pages = "186--191", 12907 month = apr, 12908 year = "1974", 12909 CODEN = "CACMA2", 12910 ISSN = "0001-0782", 12911 bibdate = "Tue Mar 25 13:26:09 MST 1997", 12912 bibsource = "Compendex database", 12913 abstract = "An algorithm is given for calculating page fault probability in a virtual memory system operating under demand paging with various memory sizes and replacement rules. A first order Markov model of program behavior is assumed, and a representation of the system based on memory states, control states, and memory substates is presented. The algorithm is general in the sense that the page fault probabilities can be calculated for nonpredictive replacement rules applied to any program represented by a one-step Markov chain. A detailed example is given to illustrate the algorithm for Random and Least Recently Used (LRU) replacement rules.", 12914 acknowledgement = ack-nhfb, 12915 classcodes = "C6120 (File organisation); C7430 (Computer engineering)", 12916 classification = "723", 12917 corpsource = "Washington Univ., St. Louis, MO, USA", 12918 journalabr = "Commun ACM", 12919 keywords = "computer metatheory; computer testing; control states; demand paging; fault tolerant computing; Markov model; memory; memory states; memory substates; nonpredictive replacement rules; page fault probability; program transition diagram; various memory sizes; virtual; virtual storage", 12920 treatment = "T Theoretical or Mathematical", 12921 } 12922 12923 @Article{Boyse:1974:ECP, 12924 author = "John W. Boyse", 12925 title = "Execution Characteristics of Programs in a Page-On-Demand System", 12926 journal = j-CACM, 12927 volume = "17", 12928 number = "4", 12929 pages = "192--196", 12930 month = apr, 12931 year = "1974", 12932 CODEN = "CACMA2", 12933 ISSN = "0001-0782", 12934 bibdate = "Tue Mar 25 13:26:09 MST 1997", 12935 bibsource = "Compendex database", 12936 abstract = "Data are presented which show the execution characteristics of two types of commonly used programs in a large-scale, time-shared computer system. A software monitoring facility built into the supervisor was used for data collection during normal system operation. These data were analyzed, and results of this analysis are presented for a FORTRAN compiler and an interactive line file editor. Probability distribution functions and other data are given for such things as CPU intervals, I/O intervals, and the number of such intervals during execution. Empirical distributions are compared with simple theoretical distributions (exponential, hyperexponential, and geometric). Other data show paging characteristics of tasks as a function of the number of pages those tasks have in core.", 12937 acknowledgement = ack-nhfb, 12938 classcodes = "C6120 (File organisation); C6150C (Compilers, interpreters and other processors); C6150G (Diagnostic, testing, debugging and evaluating systems); C6150J (Operating systems)", 12939 classification = "723", 12940 corpsource = "Univ. Michigan, Ann Arbor, MI, USA", 12941 journalabr = "Commun ACM", 12942 keywords = "characteristics; compiler execution behaviour; computer metatheory; computer testing; CPU intervals; demand paging; editor; execution behaviour; Fortran compiler; I/O intervals; interactive line file; large scale, time shared computer system; monitoring facility; page on demand system; paging characteristics; probability distribution functions; program behaviour; program execution; software; supervisory and executive programs; virtual memory; virtual storage", 12943 treatment = "A Application; P Practical", 12944 } 12945 12946 @Article{Smith:1974:LCE, 12947 author = "Graham Smith and Ian M. Sefton", 12948 title = "On {Lions}' Counter Example for {Gotlieb}'s Method for the Construction of School Timetables", 12949 journal = j-CACM, 12950 volume = "17", 12951 number = "4", 12952 pages = "196--197", 12953 month = apr, 12954 year = "1974", 12955 CODEN = "CACMA2", 12956 ISSN = "0001-0782", 12957 bibdate = "Tue Mar 25 13:26:09 MST 1997", 12958 bibsource = "Compendex database", 12959 abstract = "The timetable problem is an essentially discrete problem. Although the discrete problem may have no feasible solution, there may exist a solution to the equivalent continuous problem. An example is given, for which the nondiscrete solution can be interpreted as a set of timetables, differing from week to week, which together satisfy the long-term requirements of the timetable problem.", 12960 acknowledgement = ack-nhfb, 12961 classcodes = "C7110 (Educational administration); C7890 (Other special applications of computing)", 12962 classification = "921", 12963 corpsource = "Univ. New South Wales, Kensington, NSW, Australia", 12964 journalabr = "Commun ACM", 12965 keywords = "combinatorial; combinatorial mathematics; discrete problem; educational administrative data; Gotlieb's method; mathematical programming; multiindex problem; processing; schedule; scheduling; school timetables; timetable", 12966 treatment = "A Application; T Theoretical or Mathematical", 12967 } 12968 12969 @Article{Lindstrom:1974:CLS, 12970 author = "Gary Lindstrom", 12971 title = "Copying List Structures Using Bounded Workspace", 12972 journal = j-CACM, 12973 volume = "17", 12974 number = "4", 12975 pages = "198--202", 12976 month = apr, 12977 year = "1974", 12978 CODEN = "CACMA2", 12979 ISSN = "0001-0782", 12980 bibdate = "Tue Mar 25 13:26:09 MST 1997", 12981 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Compiler/garbage.collection.bib", 12982 abstract = "Two new algorithms are presented for list structure copying using bounded workspace. The first, of primarily theoretical interest, shows that without cell tag bits the task can be performed in time n**2. The second algorithm, assuming one tag bit in each cell, delivers attractive practical speed. Any noncyclic structure is copied in linear speed, while cyclic structures are copied in average time less than n log n. No foreknowledge of cycle absence is necessary to achieve linear speed. A variation of the second algorithm solves an open problem concerning list structure marking. That result demonstrates that marking can be done in average time n log n without the aid of supplemental tag bits or stacks.", 12983 acknowledgement = ack-nhfb, 12984 classcodes = "C6120 (File organisation); C6130 (Data handling techniques)", 12985 classification = "723", 12986 corpsource = "Univ. Pittsburgh, PA, USA", 12987 journalabr = "Commun ACM", 12988 keywords = "algorithms; bounded workspace; complexity; computer programming; copying list structures; cyclic; data structures; list; list processing; list structure marking; noncyclic structure; one tag bit; space; structure copying; structures", 12989 treatment = "T Theoretical or Mathematical", 12990 } 12991 12992 @Article{Even:1974:PTS, 12993 author = "Shimon Even", 12994 title = "Parallelism in Tape-Sorting", 12995 journal = j-CACM, 12996 volume = "17", 12997 number = "4", 12998 pages = "202--204", 12999 month = apr, 13000 year = "1974", 13001 CODEN = "CACMA2", 13002 ISSN = "0001-0782", 13003 bibdate = "Tue Mar 25 13:26:09 MST 1997", 13004 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Parallel/Multi.bib", 13005 abstract = "Two methods for employing parallelism in tape-sorting are presented. Method A is the natural way to use parallelism. Method B is new. Both approximately achieve the goal of reducing the processing time by a divisor which is the number of processors.", 13006 acknowledgement = ack-nhfb, 13007 classcodes = "C6130 (Data handling techniques)", 13008 classification = "723", 13009 corpsource = "Weizmann Inst. Sci., Rehovot, Israel", 13010 journalabr = "Commun ACM", 13011 keywords = "computer systems programming", 13012 keywords = "external sorting; parallel processing; parallelism; queues; reducing the processing time; sorting; stacks; tape sorting", 13013 treatment = "A Application; T Theoretical or Mathematical", 13014 } 13015 13016 @Article{Lucas:1974:SCU, 13017 author = "H. C. {Lucas, Jr.} and D. B. Montgomery and J. C. Larreche", 13018 title = "A study of computer use in a graduate school of business", 13019 journal = j-CACM, 13020 volume = "17", 13021 number = "4", 13022 pages = "205--206", 13023 month = apr, 13024 year = "1974", 13025 CODEN = "CACMA2", 13026 ISSN = "0001-0782", 13027 bibdate = "Tue Mar 25 13:26:09 MST 1997", 13028 acknowledgement = ack-nhfb, 13029 classcodes = "C0220 (Computing education and training); C7100 (Business and administration)", 13030 corpsource = "Stanford Univ., CA, USA", 13031 keywords = "accounting records; commerce; computer aided instruction; computer use; cumulative; curriculum; education; general problem solving tool; graduate school of business; process model; questionnaires; research", 13032 treatment = "G General Review", 13033 } 13034 13035 @Article{Freeman:1974:GEP, 13036 author = "Peter Freeman and Michael A. Malcolm and William H. Payne", 13037 title = "Graduate Education: The {Ph.D.} Glut: Response and Rebuttal", 13038 journal = j-CACM, 13039 volume = "17", 13040 number = "4", 13041 pages = "206--207", 13042 month = apr, 13043 year = "1974", 13044 CODEN = "CACMA2", 13045 ISSN = "0001-0782", 13046 bibdate = "Tue Mar 25 13:26:09 MST 1997", 13047 note = "See \cite{Payne:1973:GEP}.", 13048 acknowledgement = ack-nhfb, 13049 classcodes = "C0310 (EDP management)", 13050 corpsource = "Univ. California, Irvine, CA, USA", 13051 keywords = "accreditation; advanced degrees; education; graduate education; Ph.D.; Ph.D. production; response and rebutted; what kind", 13052 treatment = "G General Review", 13053 } 13054 13055 @Article{Sterling:1974:ITM, 13056 author = "T. D. Sterling and S. V. Pollack", 13057 title = "Ideal teaching machines --- a solution to the pedagogic language problem", 13058 journal = j-CACM, 13059 volume = "17", 13060 number = "4", 13061 pages = "207--208", 13062 month = apr, 13063 year = "1974", 13064 CODEN = "CACMA2", 13065 ISSN = "0001-0782", 13066 bibdate = "Tue Mar 25 13:26:09 MST 1997", 13067 acknowledgement = ack-nhfb, 13068 classcodes = "C0220 (Computing education and training); C6140D (High level languages)", 13069 corpsource = "Simon Fraser Univ., Burnaby, BC, Canada", 13070 keywords = "computer; education; ideal teaching machine; pedagogic language problem; problem oriented languages; simulated; teaching machines", 13071 treatment = "A Application; G General Review; P Practical", 13072 } 13073 13074 @Article{Abrahams:1974:SRL, 13075 author = "P. W. Abrahams", 13076 title = "Some remarks on lookup of structured variables", 13077 journal = j-CACM, 13078 volume = "17", 13079 number = "4", 13080 pages = "209--210", 13081 month = apr, 13082 year = "1974", 13083 CODEN = "CACMA2", 13084 ISSN = "0001-0782", 13085 bibdate = "Tue Mar 25 13:26:09 MST 1997", 13086 acknowledgement = ack-nhfb, 13087 classcodes = "C6120 (File organisation); C6130 (Data handling techniques)", 13088 corpsource = "New York Univ., NY, USA", 13089 keywords = "compilers; data structures; deterministic; finite state machine; lookup of structured variables; qualified references; sequence of identifiers; structured; symbol table; table lookup; variables", 13090 treatment = "G General Review; P Practical", 13091 } 13092 13093 @Article{Balfour:1974:AAM, 13094 author = "A. Balfour", 13095 title = "An alternative approach to mutual recursion {in Algol} 60 using restricted compilers", 13096 journal = j-CACM, 13097 volume = "17", 13098 number = "4", 13099 pages = "210--210", 13100 month = apr, 13101 year = "1974", 13102 CODEN = "CACMA2", 13103 ISSN = "0001-0782", 13104 bibdate = "Tue Mar 25 13:26:09 MST 1997", 13105 acknowledgement = ack-nhfb, 13106 classcodes = "C6140D (High level languages); C6150C (Compilers, interpreters and other processors)", 13107 corpsource = "Heriot-Watt Univ., Edinburgh, UK", 13108 keywords = "ALGOL; Algol 60; compiler; mutual recursion; program compilers; restricted compilers; restrictions", 13109 treatment = "P Practical", 13110 } 13111 13112 @Article{Lee:1974:IPS, 13113 author = "R. C. T. Lee and C. L. Chang and R. J. Waldinger", 13114 title = "An Improved Program-Synthesizing Algorithm and its Correctness", 13115 journal = j-CACM, 13116 volume = "17", 13117 number = "4", 13118 pages = "211--217", 13119 month = apr, 13120 year = "1974", 13121 CODEN = "CACMA2", 13122 ISSN = "0001-0782", 13123 MRclass = "68A05 (68A40)", 13124 MRnumber = "49 10175", 13125 mrreviewer = "S. Amarel", 13126 bibdate = "Tue Mar 25 13:26:09 MST 1997", 13127 bibsource = "Compendex database", 13128 abstract = "An improved program-synthesizing algorithm based on the algorithm proposed by Waldinger and Lee in 1969 is given. In the old algorithm, the program-synthesizing problem is translated into a theorem-proving problem, and a program is obtained by analyzing a proof. \par For the improved algorithm, the analysis is not necessary, and a program is obtained as soon as the proof is completed. This is achieved by using a modified variable tracing mechanism invented by Green in 1969. The correctness of the improved algorithm is also proved; i.e. the program thus obtained always satisfies the specification.", 13129 acknowledgement = ack-nhfb, 13130 classcodes = "C4240 (Programming and algorithm theory)", 13131 classification = "723", 13132 corpsource = "Nat. Inst. Health, Bethesda, MD, USA", 13133 journalabr = "Commun ACM", 13134 keywords = "computer metatheory; consequence finding; primitive resolutions; program-synthesizing algorithms; theorem proving", 13135 keywords = "consequence; correctness; finding; modified variable tracing mechanism; primitive resolutions; problem; program synthesizing algorithm; programming theory; theorem proving", 13136 treatment = "T Theoretical or Mathematical", 13137 } 13138 13139 @Article{Cline:1974:SPV, 13140 author = "A. K. Cline", 13141 title = "Scalar- and planar-valued curve fitting using splines under tension. {I}", 13142 journal = j-CACM, 13143 volume = "17", 13144 number = "4", 13145 pages = "218--220", 13146 month = apr, 13147 year = "1974", 13148 CODEN = "CACMA2", 13149 ISSN = "0001-0782", 13150 MRclass = "65D05", 13151 MRnumber = "49 8274", 13152 mrreviewer = "J. W. Jerome", 13153 bibdate = "Tue Mar 25 13:26:09 MST 1997", 13154 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1974.bib; ftp://ftp.ira.uka.de/pub/bibliography/Graphics/siggraph/pre75.bib", 13155 abstract = "The spline under tension was introduced by Schweikert in an attempt to imitate cubic splines but avoid the spurious critical points they induce. The defining equations are presented here, together with an efficient method for determining the necessary parameters and computing the resultant spline. The standard scalar-valued curve fitting problem is discussed, as well as the fitting of open and closed curves in the plane. The use of these curves and the importance of the tension in the fitting of contour lines are mentioned as application.", 13156 acknowledgement = ack-nhfb, 13157 classcodes = "B0290F (Interpolation and function approximation); C4130 (Interpolation and function approximation)", 13158 classification = "921", 13159 corpsource = "Nat. Center Atmospheric Res., Boulder, CO, USA", 13160 country = "USA", 13161 descriptors = "Realization; polynomial; approximation; method; interpolation; FORTRAN; graphics; iterative method; information system; spline; curve fitting;", 13162 enum = "597", 13163 journalabr = "Commun ACM", 13164 keywords = "contouring; cubic splines; curve fitting; curves in the plane; fitting; function approximation; interpolation; scalar valued curve; splines (mathematics); splines under tension", 13165 keywords = "contouring; curve fitting; interpolation; mathematical techniques; splines", 13166 language = "English", 13167 references = "3", 13168 treatment = "T Theoretical or Mathematical", 13169 } 13170 13171 @Article{Cline:1974:AAS, 13172 author = "A. K. Cline", 13173 title = "{ACM} Algorithm 476: Six Subprograms for Curve Fitting Using Splines Under Tension", 13174 journal = j-CACM, 13175 volume = "17", 13176 number = "4", 13177 pages = "220--223 (or 220--221??)", 13178 month = apr, 13179 year = "1974", 13180 CODEN = "CACMA2", 13181 ISSN = "0001-0782", 13182 bibdate = "Tue Mar 25 13:26:09 MST 1997", 13183 acknowledgement = ack-nhfb, 13184 classcodes = "B0290F (Interpolation and function approximation); C4130 (Interpolation and function approximation); C7310 (Mathematics computing)", 13185 corpsource = "Nat. Center Atmospheric Res., Boulder, CO, USA", 13186 keywords = "contouring; curve fitting; FORTRAN; function approximation; interpolation; splines (mathematics); splines under tension; subprograms; subroutines", 13187 treatment = "A Application; T Theoretical or Mathematical", 13188 } 13189 13190 @Article{Ehrlich:1974:AAG, 13191 author = "G. Ehrlich", 13192 title = "{ACM} Algorithm 477: Generator of Set-Partitions to Exactly ${R}$ Subsets", 13193 journal = j-CACM, 13194 volume = "17", 13195 number = "4", 13196 pages = "224--225", 13197 month = apr, 13198 year = "1974", 13199 CODEN = "CACMA2", 13200 ISSN = "0001-0782", 13201 bibdate = "Tue Mar 25 13:26:09 MST 1997", 13202 acknowledgement = ack-nhfb, 13203 classcodes = "B0250 (Combinatorial mathematics); C1160 (Combinatorial mathematics); C7310 (Mathematics computing)", 13204 corpsource = "Weizmann Inst. Sci., Rehovot, Israel", 13205 keywords = "mutually exclusive subsets; PARTEXACT; partitions; permutations; set theory; subroutines; subset generation; subsets", 13206 treatment = "A Application; T Theoretical or Mathematical", 13207 } 13208 13209 @Article{Einarsson:1974:STE, 13210 author = "B. Einarsson", 13211 title = "Solution of the transcendental equation we\slash sup w\slash =x", 13212 journal = j-CACM, 13213 volume = "17", 13214 number = "4", 13215 pages = "225--225", 13216 month = apr, 13217 year = "1974", 13218 CODEN = "CACMA2", 13219 ISSN = "0001-0782", 13220 bibdate = "Tue Mar 25 13:26:09 MST 1997", 13221 acknowledgement = ack-nhfb, 13222 classcodes = "B0290F (Interpolation and function approximation); C4130 (Interpolation and function approximation); C7310 (Mathematics computing)", 13223 corpsource = "Res. Inst. Nat. Defense, Tumba, Sweden", 13224 keywords = "function evaluation; subroutines; transcendental equation; violation of the Fortran standard", 13225 treatment = "G General Review; T Theoretical or Mathematical", 13226 } 13227 13228 @Article{Shaw:1974:RCC, 13229 author = "Mary Shaw", 13230 title = "Reduction of Compilation Costs Through Language Contraction", 13231 journal = j-CACM, 13232 volume = "17", 13233 number = "5", 13234 pages = "245--250", 13235 month = may, 13236 year = "1974", 13237 CODEN = "CACMA2", 13238 ISSN = "0001-0782", 13239 bibdate = "Tue Mar 25 13:26:09 MST 1997", 13240 bibsource = "Compendex database", 13241 abstract = "Programming languages tailored to particular groups of users can often be constructed by removing unwanted features from a general purpose language. This paper describes the use of simulation techniques to predict the savings in compilation cost achievable by such an approach. The results suggest a function which describes the effect of changes in the power of a language on the compilation cost of an algorithm expressed in that language: when features not actually used by the algorithm are removed from the language, the cost of compiling the algorithm decreases moderately, but when features that are needed are removed, the compilation cost increases sharply.", 13242 acknowledgement = ack-nhfb, 13243 classcodes = "C6140 (Programming languages); C6150C (Compilers, interpreters and other processors)", 13244 classification = "723", 13245 corpsource = "Carnegie-Mellon Univ., Pittsburgh, PA, USA", 13246 journalabr = "Commun ACM", 13247 keywords = "compilation costs; compiler design; computational complexity; computer programming languages; design of programming languages; general purpose language; language contraction; languages; programming; programming languages; simulation techniques", 13248 treatment = "A Application; T Theoretical or Mathematical", 13249 } 13250 13251 @Article{Wegbreit:1974:TDT, 13252 author = "Ben Wegbreit", 13253 title = "The treatment of data types in {EL1}", 13254 journal = j-CACM, 13255 volume = "17", 13256 number = "5", 13257 pages = "251--264", 13258 month = may, 13259 year = "1974", 13260 CODEN = "CACMA2", 13261 ISSN = "0001-0782", 13262 bibdate = "Tue Mar 25 13:26:09 MST 1997", 13263 bibsource = "Compendex database", 13264 abstract = "In constructing a general purpose programming language, a key issue is providing a sufficient set of data types and associated operations in a manner that permits both natural problem-oriented notation and efficient implementation. The EL1 language contains a number of features specifically designed to simultaneously satisfy both requirements. The resulting treatment of data types includes provision for programmer-defined data types and generic routines, programmer control over type conversion, and very flexible data type behavior, in a context that allows efficient compiled code and compact data representation.", 13265 acknowledgement = ack-nhfb, 13266 classcodes = "C6130 (Data handling techniques); C6140D (High level languages)", 13267 classification = "723", 13268 corpsource = "Harvard Univ., Cambridge, MA, USA", 13269 journalabr = "Commun ACM", 13270 keywords = "behaviour; coercion; compilation; computer programming languages; data description language; data handling; data type definition; data types; efficient implementation; EL1; extensible; flexible data type; general purpose programming language; generic routines; language; languages; mode unions; modes; problem oriented notation; procedure oriented languages; programmer control; programmer defined data types; type conversion", 13271 treatment = "A Application; T Theoretical or Mathematical", 13272 } 13273 13274 @Article{Wagner:1974:OCR, 13275 author = "Robert A. Wagner", 13276 title = "Order-$n$ Correction for Regular Languages", 13277 journal = j-CACM, 13278 volume = "17", 13279 number = "5", 13280 pages = "265--268", 13281 month = may, 13282 year = "1974", 13283 CODEN = "CACMA2", 13284 ISSN = "0001-0782", 13285 bibdate = "Tue Mar 25 13:26:09 MST 1997", 13286 bibsource = "Compendex database", 13287 abstract = "A method is presented for calculating a string B, belonging to a given regular language L, which is ``nearest'' (in number of edit operations) to a given input string $a$. $B$ is viewed as a reasonable ``correction'' for the possibly erroneous string $a$, where a was originally intended to be a string of $L$. \par The calculation of $B$ by the method presented requires time proportional to $|a|$, the number of characters in $a$. The method should find applications in information retrieval, artificial intelligence, and spelling correction systems.", 13288 acknowledgement = ack-nhfb, 13289 classcodes = "C4210 (Formal logic); C6130 (Data handling techniques)", 13290 classification = "723", 13291 corpsource = "Vanderbilt Univ., Nashville, TN, USA", 13292 journalabr = "Commun ACM", 13293 keywords = "artificial intelligence; compiler error recovery; computer programming languages; context free languages; context-free languages; correction; corrector; edit operations; error correction; error correction codes; errors; finite state automata; information; nondeterministic finite state automata; nondeterministic finite-state automata; order $n$ correction; regular events; regular languages; retrieval; spelling correction; string best match problem", 13294 treatment = "T Theoretical or Mathematical", 13295 } 13296 13297 @Article{Tsao:1974:DSD, 13298 author = "Nai Kuan Tsao", 13299 title = "On the Distributions of Significant Digits and Roundoff Errors", 13300 journal = j-CACM, 13301 volume = "17", 13302 number = "5", 13303 pages = "269--271", 13304 month = may, 13305 year = "1974", 13306 CODEN = "CACMA2", 13307 ISSN = "0001-0782", 13308 MRclass = "65G05", 13309 MRnumber = "49 6595", 13310 mrreviewer = "N. N. Abdelmalek", 13311 bibdate = "Tue Mar 25 13:26:09 MST 1997", 13312 bibsource = "Compendex database; garbo.uwasa.fi:/pc/doc-soft/fpbiblio.txt", 13313 abstract = "Generalized logarithmic law is derived for the distribution of the first t significant digits of a random digital integer. This result is then used to determine the distribution of the roundoff errors in floating-point operations, which is a mixture of uniform and reciprocal distributions.", 13314 acknowledgement = ack-nhfb, 13315 classcodes = "C5230 (Digital arithmetic methods)", 13316 classification = "921", 13317 corpsource = "Aerospace Res. Labs., Wright-Patterson AFB, OH, USA", 13318 journalabr = "Commun ACM", 13319 keywords = "digital arithmetic; digital integer; distributions; error analysis; floating point operations; logarithmic law; mathematical techniques; mean value; random; reciprocal; roundoff errors; significant digits; uniform distribution; variance", 13320 treatment = "T Theoretical or Mathematical", 13321 } 13322 13323 @Article{Wunderlich:1974:DNT, 13324 author = "M. C. Wunderlich and J. L. Selfridge", 13325 title = "Design for a Number Theory Package with an Optimized Trial Division Routine", 13326 journal = j-CACM, 13327 volume = "17", 13328 number = "5", 13329 pages = "272--276", 13330 month = may, 13331 year = "1974", 13332 CODEN = "CACMA2", 13333 ISSN = "0001-0782", 13334 bibdate = "Tue Mar 25 13:26:09 MST 1997", 13335 bibsource = "Compendex database", 13336 abstract = "A number theory package is described which uses doubly linked list structures for storing multiprecise integers. The package has been coded in IBM's Basic Assembly Language and makes heavy use of the macro language and conditional assembly. An optimally coded trial division routine is also described which can be used to determine the unique factorization of large integers.", 13337 acknowledgement = ack-nhfb, 13338 classcodes = "C5230 (Digital arithmetic methods)", 13339 classification = "921", 13340 corpsource = "Northern Illinois Univ., Dekalb, IL, USA", 13341 journalabr = "Commun ACM", 13342 keywords = "arithmetic; Basic; conditional assembly; design; doubly linked list structures; doubly linked lists; factorization; integers; macro language; mathematical techniques; multiprecise; number theory; number theory package; optimally coded; optimized trial division; pseudoprime; routine; trial division; utility programs", 13343 treatment = "T Theoretical or Mathematical", 13344 } 13345 13346 @Article{Gentleman:1974:MAR, 13347 author = "W. M. Gentleman and S. B. Marovich", 13348 title = "More on Algorithms that Reveal Properties of Floating Point Arithmetic Units", 13349 journal = j-CACM, 13350 volume = "17", 13351 number = "5", 13352 pages = "276--277", 13353 month = may, 13354 year = "1974", 13355 CODEN = "CACMA2", 13356 ISSN = "0001-0782", 13357 bibdate = "Tue Mar 25 13:26:09 MST 1997", 13358 bibsource = "garbo.uwasa.fi:/pc/doc-soft/fpbiblio.txt", 13359 acknowledgement = ack-nhfb, 13360 classcodes = "C5230 (Digital arithmetic methods)", 13361 corpsource = "Univ. Waterloo, Ont., Canada", 13362 keywords = "algorithms; base of the arithmetic; digital arithmetic; floating point arithmetic units; high level; languages; trailing digits", 13363 treatment = "T Theoretical or Mathematical", 13364 } 13365 13366 @Article{Gold:1974:MMR, 13367 author = "D. E. Gold and D. J. Kuck", 13368 title = "A Model for Masking Rotational Latency by Dynamic Disk Allocation", 13369 journal = j-CACM, 13370 volume = "17", 13371 number = "5", 13372 pages = "278--288", 13373 month = may, 13374 year = "1974", 13375 CODEN = "CACMA2", 13376 ISSN = "0001-0782", 13377 bibdate = "Tue Mar 25 13:26:09 MST 1997", 13378 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib", 13379 abstract = "This paper presents the background and algorithms for masking the rotational latency of a disk or drum. It discusses the anticipatory input and output of blocks of data to buffer and primary memories for a mono-programmed computer system. A basic permutation algorithm and several variations are given. Because of the anticipatory nature of the I/O scheduling, these algorithms are restricted to classes of programs with predictable behavior. While the methods are not restricted to numerical computations, matrix and partial differential equation methods are typical examples of their use. It is shown tha latency may be masked using a small amount of buffer memory. The methods discussed are independent of the overall size of the data base being considered.", 13380 acknowledgement = ack-nhfb, 13381 annote = "Optimal arrangement of data to minimize buffer needs.", 13382 classcodes = "C6120 (File organisation); C6150J (Operating systems)", 13383 classification = "722; 723", 13384 corpsource = "Univ. Illinois, Urbana-Champaign, IL, USA", 13385 journalabr = "Commun ACM", 13386 keywords = "(computers); algorithm; anticipatory input; anticipatory output; behaviour; buffer; buffer memory; computer operating systems; computer system; data storage, magnetic --- Disk; dynamic disc allocation; magnetic disc and drum storage; masking; memory hierarchy; model; monoprogrammed; operating systems; permutation; permutation algorithm; predictable; primary memories; rotational latency; staging; storage allocation", 13387 treatment = "A Application; T Theoretical or Mathematical", 13388 } 13389 13390 @Article{Cohen:1974:TLE, 13391 author = "Jacques Cohen and Carl Zuckerman", 13392 title = "Two Languages for Estimating Program Efficiency", 13393 journal = j-CACM, 13394 volume = "17", 13395 number = "6", 13396 pages = "301--308", 13397 month = jun, 13398 year = "1974", 13399 CODEN = "CACMA2", 13400 ISSN = "0001-0782", 13401 bibdate = "Tue Mar 25 13:26:09 MST 1997", 13402 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Misc/monitor.bib and ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1974.bib", 13403 abstract = "Two languages enabling their users to estimate the efficiency of computer programs are presented. The program whose efficiency one wishes to estimate is written in the first language, a go-to-less programming language which includes most of the features of Algol 60. The second language consists of interactive commands enabling its users to provide additional information about the program written in the first language and to output results estimating its efficiency. Processors for the two languages are also described. The first processor is a syntax-directed translator which compiles a program into a symbolic formula representing the execution time for that program. The second processor is a set of procedures for algebraic manipulation which can be called by the user to operate on the formula produced by the first processor. Examples of the usage of the two languages are included. The limitations of the present system, its relation to Knuth's work on the analysis of algorithms, and some of the directions for further research are also discussed.", 13404 acknowledgement = ack-nhfb, 13405 classcodes = "C6140D (High level languages); C6150C (Compilers, interpreters and other processors); C6150G (Diagnostic, testing, debugging and evaluating systems)", 13406 classification = "723", 13407 corpsource = "Brandeis Univ., Waltham, MA, USA", 13408 country = "USA", 13409 descriptors = "Programming language; runtime/storage efficiency; analysis; algorithm;", 13410 enum = "614", 13411 journalabr = "Commun ACM", 13412 keywords = "analysis of algorithms; computer programming languages; efficiency; estimating program efficiency; go to less; interactive commands; languages; procedure oriented languages; processors; program; program diagnostics; program efficiency; programming language; programming languages; symbolic manipulation; syntax directed translation; syntax-directed translation", 13413 language = "English", 13414 references = "16", 13415 treatment = "A Application; P Practical", 13416 } 13417 13418 @Article{Henschen:1974:TPL, 13419 author = "L. Henschen and Ross A. Overbeek and L. Wos", 13420 title = "A Theorem-Proving Language for Experimentation", 13421 journal = j-CACM, 13422 volume = "17", 13423 number = "6", 13424 pages = "308--314", 13425 month = jun, 13426 year = "1974", 13427 CODEN = "CACMA2", 13428 ISSN = "0001-0782", 13429 MRclass = "68A40", 13430 MRnumber = "49 6698", 13431 mrreviewer = "K. H. V. Booth", 13432 bibdate = "Tue Mar 25 13:26:09 MST 1997", 13433 bibsource = "Compendex database", 13434 abstract = "Because of the large number of strategies and inference rules presently under consideration in automated theorem proving, there is a need for developing a language especially oriented toward automated theorem proving. This paper discusses some of the features and instructions of this language. The use of this language permits easy extension of automated theorem-proving programs to include new strategies and/or new inference rules. Such extend ability will permit general experimentation with the various alternative systems.", 13435 acknowledgement = ack-nhfb, 13436 classcodes = "C1230 (Artificial intelligence); C6140D (High level languages)", 13437 classification = "723", 13438 corpsource = "Northwestern Univ., Evanston, IL, USA", 13439 journalabr = "Commun ACM", 13440 keywords = "computer programming languages; factoring; paramodulation; programming languages; resolution; theorem proving", 13441 keywords = "alternative systems; automated theorem proving; experimentation; factoring; paramodulation; problem oriented languages; programming languages; resolution; strategies and inference rules presently; theorem proving", 13442 treatment = "P Practical", 13443 } 13444 13445 @Article{Gimpel:1974:MSC, 13446 author = "James F. Gimpel", 13447 title = "The minimization of spatially-multiplexed character sets", 13448 journal = j-CACM, 13449 volume = "17", 13450 number = "6", 13451 pages = "315--318", 13452 month = jun, 13453 year = "1974", 13454 CODEN = "CACMA2", 13455 ISSN = "0001-0782", 13456 bibdate = "Tue Mar 25 13:26:09 MST 1997", 13457 bibsource = "Compendex database", 13458 abstract = "The paper describes a technique for compacting character sets in a digital computer while retaining fast access to individual bits. It considers the problem of minimizing the storage needed to contain such tables. Reduction techniques are developed, and the problem is shown to reduce to a covering problem.", 13459 acknowledgement = ack-nhfb, 13460 classcodes = "C6120 (File organisation); C6130 (Data handling techniques)", 13461 classification = "723", 13462 corpsource = "Bell Telephone Labs., Holmdel, NJ, USA", 13463 journalabr = "Commun ACM", 13464 keywords = "character sets; compacting character sets; computer programming; covering problem; data handling; data structures; fast access to; individual bits; lexical analysis; minimizing the storage; parsing; reduction; scanning; spatial multiplexing; string processing; techniques", 13465 treatment = "P Practical", 13466 } 13467 13468 @Article{Barrodale:1974:AAS, 13469 author = "I. Barrodale and F. D. K. Roberts", 13470 title = "{ACM} Algorithm 478: Solution of an Overdetermined System of Equations in the ${L_1}$ Norm", 13471 journal = j-CACM, 13472 volume = "17", 13473 number = "6", 13474 pages = "319--320", 13475 month = jun, 13476 year = "1974", 13477 CODEN = "CACMA2", 13478 ISSN = "0001-0782", 13479 bibdate = "Tue Mar 25 13:26:09 MST 1997", 13480 acknowledgement = ack-nhfb, 13481 classcodes = "B0260 (Optimisation techniques); B0290F (Interpolation and function approximation); C1180 (Optimisation techniques); C4130 (Interpolation and function approximation); C7310 (Mathematics computing)", 13482 corpsource = "Univ. Victoria, BC, Canada", 13483 keywords = "algorithm; function approximation; l/sub 1/ approximation; l1 norm; linear programming; minimizes; overdetermined system of equations; simplex method; subroutines; sum of the absolute values of the residuals", 13484 treatment = "A Application; T Theoretical or Mathematical", 13485 } 13486 13487 @Article{Page:1974:AAM, 13488 author = "R. L. Page", 13489 title = "{ACM} Algorithm 479: {A} Minimal Spanning Tree Clustering Method", 13490 journal = j-CACM, 13491 volume = "17", 13492 number = "6", 13493 pages = "321--323", 13494 month = jun, 13495 year = "1974", 13496 CODEN = "CACMA2", 13497 ISSN = "0001-0782", 13498 bibdate = "Tue Mar 25 13:26:09 MST 1997", 13499 note = "See also \cite{White:1976:RMS}.", 13500 acknowledgement = ack-nhfb, 13501 classcodes = "B6140C (Optical information, image and video signal processing); C1250 (Pattern recognition); C7310 (Mathematics computing)", 13502 corpsource = "Colorado State Univ., Fort Collins, CO, USA", 13503 keywords = "complete graph; feature; FORTRAN; graph theory; human perception; minimal spanning tree; pattern recognition; selection; subroutines", 13504 treatment = "P Practical", 13505 } 13506 13507 @Article{Gaither:1974:HPP, 13508 author = "B. Gaither", 13509 title = "Hidden-line plotting program", 13510 journal = j-CACM, 13511 volume = "17", 13512 number = "6", 13513 pages = "324--324", 13514 month = jun, 13515 year = "1974", 13516 CODEN = "CACMA2", 13517 ISSN = "0001-0782", 13518 bibdate = "Tue Mar 25 13:26:09 MST 1997", 13519 acknowledgement = ack-nhfb, 13520 classcodes = "C5540 (Terminals and graphic displays); C6130 (Data handling techniques); C7310 (Mathematics computing)", 13521 corpsource = "New Mexico Inst. Mining and Technol., Socorro, NM, USA", 13522 keywords = "algorithm; computer graphics; division by zero; hidden line; plotting program", 13523 treatment = "G General Review; P Practical", 13524 } 13525 13526 @Article{Piessens:1974:CFI, 13527 author = "R. Piessens", 13528 title = "Calculation of {Fourier} integrals", 13529 journal = j-CACM, 13530 volume = "17", 13531 number = "6", 13532 pages = "324--324", 13533 month = jun, 13534 year = "1974", 13535 CODEN = "CACMA2", 13536 ISSN = "0001-0782", 13537 bibdate = "Tue Mar 25 13:26:09 MST 1997", 13538 acknowledgement = ack-nhfb, 13539 classcodes = "B0290Z (Other numerical methods); C4190 (Other numerical methods); C7310 (Mathematics computing)", 13540 corpsource = "Univ. Leuven, Heverlee, Belgium", 13541 keywords = "algorithm; Fourier integrals; Fourier transforms; integration", 13542 treatment = "G General Review; P Practical", 13543 } 13544 13545 @Article{Piessens:1974:MHI, 13546 author = "R. Piessens", 13547 title = "Modified {Havie} integration", 13548 journal = j-CACM, 13549 volume = "17", 13550 number = "6", 13551 pages = "324--324", 13552 month = jun, 13553 year = "1974", 13554 CODEN = "CACMA2", 13555 ISSN = "0001-0782", 13556 bibdate = "Tue Mar 25 13:26:09 MST 1997", 13557 acknowledgement = ack-nhfb, 13558 classcodes = "B0290M (Numerical integration and differentiation); C4160 (Numerical integration and differentiation); C7310 (Mathematics computing)", 13559 corpsource = "Univ. Leuven, Heverlee, Belgium", 13560 keywords = "algorithm; automatic; integration; integrators; modified Havie integration; numerical analysis; overflows; specified tolerances", 13561 treatment = "G General Review; T Theoretical or Mathematical", 13562 } 13563 13564 @Article{Ellis:1974:HPP, 13565 author = "T. M. R. Ellis", 13566 title = "Hidden-line plotting program", 13567 journal = j-CACM, 13568 volume = "17", 13569 number = "6", 13570 pages = "324--325", 13571 month = jun, 13572 year = "1974", 13573 CODEN = "CACMA2", 13574 ISSN = "0001-0782", 13575 bibdate = "Tue Mar 25 13:26:09 MST 1997", 13576 acknowledgement = ack-nhfb, 13577 classcodes = "C5540 (Terminals and graphic displays); C6130 (Data handling techniques); C7310 (Mathematics computing)", 13578 corpsource = "Univ. Sheffield, UK", 13579 keywords = "algorithm; computer graphics; error; hidden line plotting program; plotting program", 13580 treatment = "G General Review; P Practical", 13581 } 13582 13583 @Article{Page:1974:GRC, 13584 author = "R. L. Page", 13585 title = "Generation of random correlated normal variables", 13586 journal = j-CACM, 13587 volume = "17", 13588 number = "6", 13589 pages = "325--325", 13590 month = jun, 13591 year = "1974", 13592 CODEN = "CACMA2", 13593 ISSN = "0001-0782", 13594 bibdate = "Tue Mar 25 13:26:09 MST 1997", 13595 acknowledgement = ack-nhfb, 13596 classcodes = "C7890 (Other special applications of computing)", 13597 corpsource = "Colorado State Univ., Fort Collins, CO, USA", 13598 keywords = "algorithm; array parameters; random correlated normal variables; random number generation; revises; work", 13599 treatment = "G General Review; P Practical", 13600 } 13601 13602 @Article{Boulton:1974:EPR, 13603 author = "D. M. Boulton", 13604 title = "Exact probabilities for {R}*{C} contingency tables", 13605 journal = j-CACM, 13606 volume = "17", 13607 number = "6", 13608 pages = "326--326", 13609 month = jun, 13610 year = "1974", 13611 CODEN = "CACMA2", 13612 ISSN = "0001-0782", 13613 bibdate = "Tue Mar 25 13:26:09 MST 1997", 13614 acknowledgement = ack-nhfb, 13615 classcodes = "C7310 (Mathematics computing)", 13616 corpsource = "Monash Univ., Melbourne, Vic., Australia", 13617 keywords = "algorithm; cell frequency combinations; contingency tables; dimensional contingency table; exact probabilities; inefficient; marginal sum constraints; probability; two", 13618 treatment = "G General Review; P Practical", 13619 } 13620 13621 @Article{Slysz:1974:ESS, 13622 author = "W. D. Slysz", 13623 title = "An evaluation of software in the social sciences", 13624 journal = j-CACM, 13625 volume = "17", 13626 number = "6", 13627 pages = "326--332", 13628 month = jun, 13629 year = "1974", 13630 CODEN = "CACMA2", 13631 ISSN = "0001-0782", 13632 bibdate = "Tue Mar 25 13:26:09 MST 1997", 13633 acknowledgement = ack-nhfb, 13634 classcodes = "C7810 (Social and behavioural sciences computing)", 13635 corpsource = "Univ. Connecticut, Storrs, CT, USA", 13636 keywords = "bivariate; BMD; college; cost; DATA TEXT; descriptive statistics; factor analysis; one way analysis of variance; OSIRIS; Pearson correlation; performance; regression; social and behavioural sciences; social sciences; SPSS; statistical analysis; statistical computation; statistical packages; statistical software; tables; TSAR; university", 13637 treatment = "A Application; P Practical", 13638 } 13639 13640 @Article{Adams:1974:CRC, 13641 author = "John Adams and John Gary", 13642 title = "Compact Representation of Contour Plots for Phone Line Transmission", 13643 journal = j-CACM, 13644 volume = "17", 13645 number = "6", 13646 pages = "333--336", 13647 month = jun, 13648 year = "1974", 13649 CODEN = "CACMA2", 13650 ISSN = "0001-0782", 13651 bibdate = "Tue Mar 25 13:26:09 MST 1997", 13652 bibsource = "Compendex database", 13653 abstract = "Methods for the compact representation of contour plots are described and tested. These are intended to reduce the cost of transmitting contour plots over phone lines. Some of these methods could be used to transmit contour plots over voice grade phone lines.", 13654 acknowledgement = ack-nhfb, 13655 classcodes = "B6210D (Telephony); C5540 (Terminals and graphic displays); C5600 (Data communication equipment and techniques)", 13656 classification = "723", 13657 corpsource = "Nat. Center Atmospheric Res., Boulder, CO, USA", 13658 journalabr = "Commun ACM", 13659 keywords = "compact representation; computer graphics; contour plots; data compaction; data transmission; data transmission systems; phone line; remote terminal; transmission; voice grade phone lines", 13660 treatment = "P Practical", 13661 } 13662 13663 @Article{Wulf:1974:HKM, 13664 author = "W. Wulf and E. Cohen and W. Corwin and A. Jones and R. Levin and C. Pierson and F. Pollack", 13665 title = "{HYDRA}: The Kernel of a Multiprocessor Operating System", 13666 journal = j-CACM, 13667 volume = "17", 13668 number = "6", 13669 pages = "337--345", 13670 month = jun, 13671 year = "1974", 13672 CODEN = "CACMA2", 13673 ISSN = "0001-0782", 13674 bibdate = "Tue Mar 25 13:26:09 MST 1997", 13675 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib and ftp://ftp.ira.uka.de/pub/bibliography/Object/Nierstrasz.bib", 13676 abstract = "This paper describes the design philosophy of HYDRA the kernel of an operating system for C. mmp, the Carnegie-Mellon Multi-Mini-Processor. This philosophy is realized through the introduction of a generalized notion of ``resource,'' both physical and virtual, called an ``object.'' Mechanisms are presented for dealing with objects, including the creation of new types, specification of new operations applicable to a given type, sharing, and protection of any reference to a given object against improper application of any of the operations defined with respect to that type of object. The mechanisms provide a coherent basis for extension of the system in two directions: the introduction of new facilities, and the creation of highly secure systems.", 13677 acknowledgement = ack-nhfb, 13678 annote = "Includes protection mechanism using capabilities attached to references.", 13679 classcodes = "C6150J (Operating systems)", 13680 classification = "722", 13681 corpsource = "Carnegie-Mellon Univ., Pittsburgh, PA, USA", 13682 journalabr = "Commun ACM", 13683 keywords = "computer operating systems; design philosophy; highly secure systems; HYDRA; kernel; multiprocessing programs; multiprocessor operating system; new facilities; nucleus; operating systems (computers); protection; security olit hydra capabilities; sharing", 13684 treatment = "A Application; P Practical", 13685 } 13686 13687 @Article{Barton:1974:ITA, 13688 author = "Ian J. Barton and Susan E. Creasey and Michael F. Lynch and Michael J. Snell", 13689 title = "An Information-Theoretic Approach to Text Searching in Direct Access Systems", 13690 journal = j-CACM, 13691 volume = "17", 13692 number = "6", 13693 pages = "345--350", 13694 month = jun, 13695 year = "1974", 13696 CODEN = "CACMA2", 13697 ISSN = "0001-0782", 13698 bibdate = "Tue Mar 25 13:26:09 MST 1997", 13699 bibsource = "Compendex database", 13700 abstract = "Using direct access computer files of bibliographic information, an attempt is made to overcome one of the problems often associated with information retrieval, namely, the maintenance and use of large dictionaries, the greater part of which is used only infrequently. A novel method is presented, which maps the hyperbolic frequency distribution. This is more suited to implementation on storage devices. \par This method treats text as a string of characters rather than words bounded by spaces, and chooses subsets of strings such that their frequencies of occurrence are more even than those of word types. The members of this subset are then used as index keys for retrieval. The rectangular distribution of key frequencies results in a much simplified file organization and promises considerable cost advantages.", 13701 acknowledgement = ack-nhfb, 13702 classcodes = "C6120 (File organisation); C7250 (Information storage and retrieval)", 13703 classification = "723; 731", 13704 corpsource = "Univ. Sheffield, UK", 13705 journalabr = "Commun ACM", 13706 keywords = "bit vector; character string; data processing --- File Organization; direct access; file organization; information retrieval; information theory; text searching", 13707 keywords = "bibliographic information; bit vector; character string; characteristics; computer files; dictionaries; direct access; direct access systems; file organisation; hyperbolic frequency distribution of text; index keys; information retrieval; information theory; large; rectangular distribution; simplified file organization; text searching", 13708 treatment = "P Practical", 13709 } 13710 13711 @Article{Minieka:1974:CSS, 13712 author = "Edward Minieka", 13713 title = "On Computing Sets of Shortest Paths in a Graph", 13714 journal = j-CACM, 13715 volume = "17", 13716 number = "6", 13717 pages = "351--353", 13718 month = jun, 13719 year = "1974", 13720 CODEN = "CACMA2", 13721 ISSN = "0001-0782", 13722 MRclass = "05C35", 13723 MRnumber = "49 7178", 13724 mrreviewer = "Torrence D. Parsons", 13725 bibdate = "Tue Mar 25 13:26:09 MST 1997", 13726 bibsource = "Compendex database", 13727 abstract = "Two algorithms are presented that construct the $k$ shortest paths between every pair of vertices in a directed graph. These algorithms generalize the Floyd algorithm and the Dantzig algorithm for finding the shortest path between every pair of vertices in a directed graph.", 13728 acknowledgement = ack-nhfb, 13729 classcodes = "C7190 (Other fields of business and administrative computing)", 13730 classification = "921", 13731 corpsource = "Univ. Illinois, Chicago, IL, USA", 13732 journalabr = "Commun ACM", 13733 keywords = "algorithm; computer aided analysis; critical path analysis; Dantzig algorithm; directed graph; Floyd algorithm; graph; mathematical techniques; network; shortest path; shortest paths", 13734 treatment = "A Application; P Practical", 13735 } 13736 13737 @Article{Ritchie:1974:UTS, 13738 author = "Dennis M. Ritchie and Ken Thompson", 13739 title = "The {UNIX} Time-Sharing System", 13740 journal = j-CACM, 13741 volume = "17", 13742 number = "7", 13743 pages = "365--375", 13744 month = jul, 13745 year = "1974", 13746 CODEN = "CACMA2", 13747 ISSN = "0001-0782", 13748 bibdate = "Tue Mar 25 13:26:09 MST 1997", 13749 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib and ftp://ftp.ira.uka.de/pub/bibliography/Parallel/Multi.bib", 13750 abstract = "This paper discusses the nature and implementation of the file system and of the user command interface. UNIX is a general-purpose, multi-user, interactive operating system for the Digital Equipment Corporation PDP-11\slash 40 and 11\slash 45 computers. It offers a number of features seldom found even in larger operating systems, including: (1) a hierarchical file system incorporating demountable volumes; (2) compatible file, device, and inter-process I/O; (3) the ability to initiate asynchronous processes; (4) system command language selectable on a per-user basis; and (5) over 100 subsystems including a dozen languages.", 13751 acknowledgement = ack-nhfb, 13752 annote = "Interactive operating system for PDP-11, VAX with a hierarchical file system incorporating demountable volumes.", 13753 classcodes = "C6120 (File organisation); C6150J (Operating systems)", 13754 classification = "723", 13755 corpsource = "Bell Labs., Murray Hill, NJ, USA", 13756 journalabr = "Commun ACM", 13757 keywords = "asynchronous; command language; compatible file; computer systems programming; demountable volumes; file organisation; file system; hierarchical file system; operating; operating systems (computers); processes; sharing systems; system; system command language; time sharing; time-; UNIX interactive operating system", 13758 treatment = "A Application; P Practical", 13759 } 13760 13761 @Article{Fuller:1974:MTP, 13762 author = "Samuel H. Fuller", 13763 title = "Minimal-Total-Processing Time Drum and Disk Scheduling Disciplines", 13764 journal = j-CACM, 13765 volume = "17", 13766 number = "7", 13767 pages = "376--381", 13768 month = jul, 13769 year = "1974", 13770 CODEN = "CACMA2", 13771 ISSN = "0001-0782", 13772 bibdate = "Tue Mar 25 13:26:09 MST 1997", 13773 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib", 13774 abstract = "This article investigates the application of minimal-total-processing-time (MTPT) scheduling disciplines to rotating storage units when random arrival of requests is allowed. Fixed-head drum and moving-head disk storage units are considered, and emphasis is placed on the relative merits of the MTPT scheduling discipline with respect to the shortest-latency-time-first (SLTF) scheduling discipline. The results of the simulation studies presented show that neither scheduling discipline is unconditionally superior to the other.", 13775 acknowledgement = ack-nhfb, 13776 classcodes = "C6120 (File organisation); C6150J (Operating systems)", 13777 classification = "723", 13778 corpsource = "Carnegie-Mellon Univ., Pittsburgh, PA, USA", 13779 journalabr = "Commun ACM", 13780 keywords = "computer programming languages", 13781 keywords = "disc scheduling; drum scheduling; fixed head drum; intra cylinder disc; management; minimal total processing time; moving head disc; operating systems (computers); rotating storage units; scheduling; scheduling disciplines; shortest latency time first; simulation; sorting; storage", 13782 treatment = "A Application; P Practical", 13783 } 13784 13785 @Article{Bruno:1974:SIT, 13786 author = "J. Bruno and E. G. {Coffman, Jr.} and R. Sethi", 13787 title = "Scheduling Independent Tasks To Reduce Mean Finishing Time", 13788 journal = j-CACM, 13789 volume = "17", 13790 number = "7", 13791 pages = "382--387", 13792 month = jul, 13793 year = "1974", 13794 CODEN = "CACMA2", 13795 ISSN = "0001-0782", 13796 MRclass = "90B35", 13797 MRnumber = "50 9338", 13798 mrreviewer = "John C. Gittins", 13799 bibdate = "Tue Mar 25 13:26:09 MST 1997", 13800 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1974.bib and ftp://ftp.ira.uka.de/pub/bibliography/Database/Graefe.bib", 13801 abstract = "A deterministic model of independent tasks is introduced and new results are derived which extend and generalize the algorithms known for minimizing mean finishing time. In addition to presenting and analyzing new algorithms it is shown that the most general mean-finishing-time problem for independent tasks is polynomial complete, hence unlikely to admit of a non-enumerative solution.", 13802 acknowledgement = ack-nhfb, 13803 classcodes = "B0260 (Optimisation techniques); C1180 (Optimisation techniques); C6150J (Operating systems)", 13804 classification = "723", 13805 corpsource = "Pennsylvania State Univ., University Park, PA, USA", 13806 descriptors = "Scheduling; Finish Time;", 13807 journalabr = "Commun ACM", 13808 keywords = "CACM; computer programming languages; deterministic model; independent tasks; mean finishing time; minimisation; minimize; minimizing mean finishing time; minimizing mean flow time; operating systems (computers); optimal; polynomial complete; scheduling; scheduling algorithms; scheduling independent tasks; sequencing algorithms; storage required", 13809 treatment = "A Application; T Theoretical or Mathematical", 13810 } 13811 13812 @Article{Saltzer:1974:PCI, 13813 author = "Jerome H. Saltzer", 13814 title = "Protection and the Control of Information Sharing in {Multics}", 13815 journal = j-CACM, 13816 volume = "17", 13817 number = "7", 13818 pages = "388--402", 13819 month = jul, 13820 year = "1974", 13821 CODEN = "CACMA2", 13822 ISSN = "0001-0782", 13823 bibdate = "Tue Mar 25 13:26:09 MST 1997", 13824 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Database/Graefe.bib", 13825 abstract = "The design of mechanisms to control the sharing of information in the Multics system is described. Five design principles help provide insight into the tradeoffs among different possible designs. The key mechanisms described include access control lists, hierarchical control of access specifications, identification and authentication of users, and primary memory protection. The paper ends with a discussion of several known weaknesses in the current protection mechanism design.", 13826 acknowledgement = ack-nhfb, 13827 classcodes = "C0310 (EDP management); C6130 (Data handling techniques); C6150J (Operating systems)", 13828 classification = "723", 13829 corpsource = "MIT, Cambridge, MA, USA", 13830 journalabr = "Commun ACM", 13831 keywords = "access control lists; authentication; computer systems programming; control; control of access specifications; descriptors; design principles; hierarchical; identification; information sharing; mechanism design; Multics system; operating systems (computers); operating virtual memory CACM; primary memory protection; privacy; protection; security; security of data; storage; time sharing systems; virtual; virtual memory", 13832 treatment = "A Application; P Practical", 13833 } 13834 13835 @Article{Fabry:1974:CBA, 13836 author = "R. S. Fabry", 13837 title = "Capability-Based Addressing", 13838 journal = j-CACM, 13839 volume = "17", 13840 number = "7", 13841 pages = "403--412", 13842 month = jul, 13843 year = "1974", 13844 CODEN = "CACMA2", 13845 ISSN = "0001-0782", 13846 bibdate = "Tue Mar 25 13:26:09 MST 1997", 13847 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Database/Graefe.bib and ftp://ftp.ira.uka.de/pub/bibliography/Misc/os.bib and ftp://ftp.ira.uka.de/pub/bibliography/Object/Nierstrasz.bib", 13848 abstract = "Various addressing schemes making use of segment tables are examined. The inadequacies of these schemes when dealing with shared addresses are explained. These inadequacies are traced to the lack of an efficient absolute address for objects in these systems. The direct use of a capability as an address is shown to overcome these difficulties because it provides the needed absolute address. Implementation of capability-based addressing is discussed. It is predicted that the use of tags to identify capabilities will dominate. A hardware address translation scheme which never requires the modification of the representation of capabilities is suggested.", 13849 acknowledgement = ack-nhfb, 13850 annote = "The direct use of a capability as an address is shown to be useful when dealing with shared addresses. Implementation of capability-based addressing is discussed.", 13851 classcodes = "C6120 (File organisation)", 13852 classification = "723; 901", 13853 corpsource = "Univ. California, Berkeley, CA, USA", 13854 journalabr = "Commun ACM", 13855 keywords = "address translation scheme; addresses; addressing; addressing hardware; addressing schemes; associative; capabilities; capability based addressing; code; computer utility; data structures; hardware; hash table; information sharing; operating systems; programming conventions; protection; protection hardware; registers; security of data; segment tables; shared; storage management; tagged architecture; tags", 13856 keywords = "CACM memory management segments pages operating security olit capabilities; information retrieval systems", 13857 treatment = "A Application; P Practical", 13858 } 13859 13860 @Article{Popek:1974:FRV, 13861 author = "Gerald J. Popek and Robert P. Goldberg", 13862 title = "Formal Requirements for Virtualizable Third Generation Architectures", 13863 journal = j-CACM, 13864 volume = "17", 13865 number = "7", 13866 pages = "412--421", 13867 month = jul, 13868 year = "1974", 13869 CODEN = "CACMA2", 13870 ISSN = "0001-0782", 13871 MRclass = "68A05", 13872 MRnumber = "49 10177", 13873 mrreviewer = "I. Kaufmann", 13874 bibdate = "Tue Mar 25 13:26:09 MST 1997", 13875 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib", 13876 abstract = "A model of a third-generation-like computer system is developed. Formal techniques are used to derive precise sufficient conditions to test whether such an architecture can support virtual machines.", 13877 acknowledgement = ack-nhfb, 13878 classcodes = "C5220 (Computer architecture); C7430 (Computer engineering)", 13879 classification = "722", 13880 corpsource = "Univ. California, Los Angeles, CA, USA", 13881 journalabr = "Commun ACM", 13882 keywords = "abstract model; architectures; computer architecture; computer operating systems; formal requirements; generation architecture; hypervisor; operating system; sufficient conditions; systems; third; third generation computer; virtual machine; virtual machine monitor; virtual machines; virtual memory; virtualizable third generation", 13883 treatment = "A Application; P Practical", 13884 } 13885 13886 @Article{Hahn:1974:NTC, 13887 author = "Bruce Hahn", 13888 title = "A New Technique for Compression and Storage of Data", 13889 journal = j-CACM, 13890 volume = "17", 13891 number = "8", 13892 pages = "434--436", 13893 month = aug, 13894 year = "1974", 13895 CODEN = "CACMA2", 13896 ISSN = "0001-0782", 13897 bibdate = "Tue Mar 25 13:26:09 MST 1997", 13898 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib", 13899 abstract = "This paper describes techniques that can, in most cases, decrease storage size by a factor of from two to four. The techniques involve special handling of leading and trailing blanks, and the encoding of other symbols in groups of fixed size as unique fixed point numbers. The efficiency of the system is considered and pertinent statistics are given and compared with statistics for other information coding techniques.", 13900 acknowledgement = ack-nhfb, 13901 annote = "Generation of a character dictionary and its use to minimize space.", 13902 classcodes = "C6120 (File organisation); C6130 (Data handling techniques)", 13903 classification = "731", 13904 corpsource = "Univ. Waterloo, Ont., Canada", 13905 journalabr = "Commun ACM", 13906 keywords = "coding techniques; compression; data handling; data management; data storage; efficiency; encoding; file maintenance; file organisation; fixed point numbers; information coding techniques; information theory; programs; text compression; utility", 13907 treatment = "A Application; P Practical", 13908 } 13909 13910 @Article{Evans:1974:UAS, 13911 author = "Arthur {Evans, Jr.} and William Kantrowitz and Edwin Weiss", 13912 title = "A User Authentication Scheme Not Requiring Secrecy in the Computer", 13913 journal = j-CACM, 13914 volume = "17", 13915 number = "8", 13916 pages = "437--442", 13917 month = aug, 13918 year = "1974", 13919 CODEN = "CACMA2", 13920 ISSN = "0001-0782", 13921 bibdate = "Tue Mar 25 13:26:09 MST 1997", 13922 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib", 13923 abstract = "In many computer operating systems a user authenticates himself by entering a secret password known solely to himself and the system. The system compares this password with one recorded in a Password Table which is available to only the authentication program. The integrity of the system depends on keeping the table secret. In this paper a password scheme is presented which does not require secrecy in the computer. All aspects of the system, including all relevant code and data bases, may be known by anyone attempting to intrude. The scheme is based on using a function H which the would-be intruder is unable to invert. This function is applied to the user's password and the result compared to a table entry, a match being interpreted as authentication of the user. The intruder may know all about H and have access to the table, but he can penetrate the system only if he can invert H to determine an input that produces a given output. This paper discusses issues surrounding selection of a suitable H.", 13924 acknowledgement = ack-nhfb, 13925 annote = "Password protection by irreversible transformation", 13926 classcodes = "C6130 (Data handling techniques); C6150J (Operating systems)", 13927 classification = "722; 723", 13928 corpsource = "MIT, Lexington, MA, USA", 13929 journalabr = "Commun ACM", 13930 keywords = "authentication; computer operating systems; cryptology; engineering problems; human; invert; one way encryption; operating system security; operating systems (computers); password scheme; security; security of data; user authentication scheme", 13931 treatment = "A Application; T Theoretical or Mathematical", 13932 } 13933 13934 @Article{Purdy:1974:HSL, 13935 author = "George B. Purdy", 13936 title = "A High Security Log-in Procedure", 13937 journal = j-CACM, 13938 volume = "17", 13939 number = "8", 13940 pages = "442--445", 13941 month = aug, 13942 year = "1974", 13943 CODEN = "CACMA2", 13944 ISSN = "0001-0782", 13945 bibdate = "Tue Mar 25 13:26:09 MST 1997", 13946 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib", 13947 abstract = "The protection of time sharing systems from unauthorized users is often achieved by the use of passwords. By using one-way ciphers to code the passwords, the risks involved with storing the passwords in the computer can be avoided. The selection of a suitable one-way cipher is discussed. It is suggested that for this purpose polynomials over a prime modulus are superior to one-way ciphers derived from Shannon codes.", 13948 acknowledgement = ack-nhfb, 13949 annote = "Password protection by irreversible cryptographic transformation", 13950 classcodes = "C6130 (Data handling techniques); C6150J (Operating systems)", 13951 classification = "722; 723", 13952 corpsource = "Univ. Illinois, Urbana-Champaign, IL, USA", 13953 journalabr = "Commun ACM", 13954 keywords = "code; computer operating systems; cryptography; data processing --- Security of Data; one way ciphers; operating systems; operating systems (computers); passwords; security; security of data; time sharing systems", 13955 treatment = "A Application; T Theoretical or Mathematical", 13956 } 13957 13958 @Article{Friedman:1974:ETR, 13959 author = "Theodore D. Friedman and Lance J. Hoffman", 13960 title = "Execution Time Requirements for Encipherment Programs", 13961 journal = j-CACM, 13962 volume = "17", 13963 number = "8", 13964 pages = "445--449", 13965 month = aug, 13966 year = "1974", 13967 CODEN = "CACMA2", 13968 ISSN = "0001-0782", 13969 bibdate = "Tue Mar 25 13:26:09 MST 1997", 13970 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib", 13971 abstract = "The time taken to decipher 20,000 words of data by four additive methods on a Control Data 6400 computer was measured using assembly language and Fortran routines. Standard deviations were computed for 100 runs by each method, and from this the range of error at the 95 percent confidence level was calculated. The time required for selecting and fetching the plaintext data and for storing the ciphertext was separately measured (the ``null transformation'' ), and was then compared with the times required by each enciphering method. The enciphering processes required at least four times as much cpu time when programmed in Fortran.", 13972 acknowledgement = ack-nhfb, 13973 classcodes = "C6130 (Data handling techniques); C6150J (Operating systems)", 13974 classification = "723", 13975 corpsource = "Univ. California, Berkeley, CA, USA", 13976 journalabr = "Commun ACM", 13977 keywords = "additive ciphers; assembly language; cpu; cryptography; cryptology; data processing; double key encipherment; enciphering time coefficient; encipherment programs; errors; execution time; experiments; Fortran; null; one word key; operating systems (computers); privacy transformations; protection; pseudo random key; security; security of data; time; transformation", 13978 treatment = "A Application; T Theoretical or Mathematical; X Experimental", 13979 } 13980 13981 @Article{Neufeld:1974:GCC, 13982 author = "G. A. Neufeld and J. Tartar", 13983 title = "Graph Coloring Conditions for the Existence of Solutions to the Timetable Problem", 13984 journal = j-CACM, 13985 volume = "17", 13986 number = "8", 13987 pages = "450--453", 13988 month = aug, 13989 year = "1974", 13990 CODEN = "CACMA2", 13991 ISSN = "0001-0782", 13992 MRclass = "90B35", 13993 MRnumber = "52 16594", 13994 mrreviewer = "Ethan D. Bolker", 13995 bibdate = "Tue Mar 25 13:26:09 MST 1997", 13996 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Theory/graph.coloring.bib", 13997 abstract = "A necessary and sufficient condition is presented for the existence of a solution to the Gotlieb class-teacher timetable problem. Several relationships are established between the class-teacher timetable problem and graphs with preconditions. These preconditions place additional restrictions on the coloration of a graph. The preconditions correspond to the unavailability constraints and preassigned meetings in the class-teacher timetable problem. Using some recent results that convert graphs with preconditions to graphs without them, it is shown that the existence of a coloration of a graph is the required necessary and sufficient condition.", 13998 acknowledgement = ack-nhfb, 13999 classcodes = "B0250 (Combinatorial mathematics); C1160 (Combinatorial mathematics); C7110 (Educational administration)", 14000 classification = "912; 921", 14001 corpsource = "Univ. Alberta, Edmonton, Alta., Canada", 14002 journalabr = "Commun ACM", 14003 keywords = "class-teacher timetable problem; class-teacher timetables; coloration; educational administrative data processing; graph colouring conditions; graph theory; graphs; graphs with preconditions; mathematical techniques; necessary and; operations research; preassignment; prevention of assignment; scheduling; sufficient condition; timetable problem", 14004 treatment = "A Application; T Theoretical or Mathematical", 14005 } 14006 14007 @Article{Lamport:1974:NSD, 14008 author = "Leslie Lamport", 14009 title = "A New Solution of {Dijkstra}'s Concurrent Programming Problem", 14010 journal = j-CACM, 14011 volume = "17", 14012 number = "8", 14013 pages = "453--455", 14014 month = aug, 14015 year = "1974", 14016 CODEN = "CACMA2", 14017 ISSN = "0001-0782", 14018 MRclass = "68A05", 14019 MRnumber = "49 8418", 14020 mrreviewer = "James Howland", 14021 bibdate = "Tue Mar 25 13:26:09 MST 1997", 14022 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib", 14023 abstract = "A simple solution to the mutual exclusion problem is presented which allows the system to continue to operate despite the failure of any individual component.", 14024 acknowledgement = ack-nhfb, 14025 annote = "A solution which is more failure proof.", 14026 classcodes = "C6150J (Operating systems)", 14027 classification = "723", 14028 journalabr = "Commun ACM", 14029 keywords = "computer systems programming; concurrent programming; critical section; Dijkstra's concurrent programming problem; failure; fault tolerant computing; multiprocessing; multiprocessing programs; mutual exclusion; semaphores", 14030 treatment = "A Application; T Theoretical or Mathematical", 14031 } 14032 14033 @Article{Cavouras:1974:CPD, 14034 author = "John C. Cavouras", 14035 title = "On the Conversion of Programs to Decision Tables: Method and Objectives", 14036 journal = j-CACM, 14037 volume = "17", 14038 number = "8", 14039 pages = "456--462", 14040 month = aug, 14041 year = "1974", 14042 CODEN = "CACMA2", 14043 ISSN = "0001-0782", 14044 bibdate = "Tue Mar 25 13:26:09 MST 1997", 14045 bibsource = "Compendex database", 14046 abstract = "The problems of converting programs to decision tables are investigated. Objectives of these conversions are mainly program debugging and optimization in practice. Extensions to the theory of computation and computability are suggested.", 14047 acknowledgement = ack-nhfb, 14048 classcodes = "C4290 (Other computer theory); C6110 (Systems analysis and programming); C6150G (Diagnostic, testing, debugging and evaluating systems)", 14049 classification = "723", 14050 corpsource = "Univ. Glasgow, UK", 14051 journalabr = "Commun ACM", 14052 keywords = "analysis; computability; computability and decidability; computer systems programming; conversion of programs; debugging; decision tables; objectives; optimization; program; semantics; systems; theory of programming", 14053 treatment = "T Theoretical or Mathematical", 14054 } 14055 14056 @Article{Lyche:1974:AAP, 14057 author = "T. Lyche and L. L. Schumaker", 14058 title = "{ACM} Algorithm 480: Procedures for Computing Smoothing and Interpolating Natural Splines", 14059 journal = j-CACM, 14060 volume = "17", 14061 number = "8", 14062 pages = "463--467", 14063 month = aug, 14064 year = "1974", 14065 CODEN = "CACMA2", 14066 ISSN = "0001-0782", 14067 bibdate = "Tue Mar 25 13:26:09 MST 1997", 14068 acknowledgement = ack-nhfb, 14069 classcodes = "B0290F (Interpolation and function approximation); C4130 (Interpolation and function approximation); C7310 (Mathematics computing)", 14070 corpsource = "Univ. Texas, Austin, TX, USA", 14071 keywords = "Algol; approximation; coefficients; interpolating; interpolation; natural sciences applications of computers; natural splines; smoothing; spline smoothing; splines (mathematics); subroutines", 14072 treatment = "A Application; T Theoretical or Mathematical", 14073 } 14074 14075 @Article{Crandall:1974:AAA, 14076 author = "K. C. Crandall", 14077 title = "{ACM} Algorithm 481: Arrow to Precedence Network Transformation", 14078 journal = j-CACM, 14079 volume = "17", 14080 number = "8", 14081 pages = "467--469", 14082 month = aug, 14083 year = "1974", 14084 CODEN = "CACMA2", 14085 ISSN = "0001-0782", 14086 bibdate = "Tue Mar 25 13:26:09 MST 1997", 14087 acknowledgement = ack-nhfb, 14088 classcodes = "C7100 (Business and administration)", 14089 corpsource = "Univ. California, Berkeley, CA, USA", 14090 keywords = "arrow convention; arrow convention networks; computer aided analysis; convention; critical path; critical path analysis; network transformation; precedence; precedence networks; resource allocation; scheduling; subroutines", 14091 treatment = "A Application; T Theoretical or Mathematical", 14092 } 14093 14094 @Article{McKay:1974:AAT, 14095 author = "John McKay and E. Regener", 14096 title = "{ACM} Algorithm 482: Transitivity Sets [{G7}]", 14097 journal = j-CACM, 14098 volume = "17", 14099 number = "8", 14100 pages = "470--470", 14101 month = aug, 14102 year = "1974", 14103 CODEN = "CACMA2", 14104 ISSN = "0001-0782", 14105 bibdate = "Tue Mar 25 13:26:09 MST 1997", 14106 bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Parallel/Multi.bib", 14107 acknowledgement = ack-nhfb, 14108 classcodes = "B0250 (Combinatorial mathematics); C1160 (Combinatorial mathematics); C7310 (Mathematics computing)", 14109 corpsource = "McGill Univ., Montreal, Que., Canada", 14110 keywords = "sets; transitivity", 14111 keywords = "Algol; algorithm; graph; natural sciences applications of computers; orbits; semigroup; set theory; sets; spanning tree; subroutines; transitivity; transitivity sets", 14112 page = "470", 14113 treatment = "T Theoretical or Mathematical", 14114 } 14115 14116 @Article{Stroud:1974:GHI, 14117 author = "A. H. Stroud", 14118 title = "{Gauss} Harmonic Interpolation Formulas", 14119 journal = j-CACM, 14120 volume = "17", 14121 number = "8", 14122 pages = "471--475", 14123 month = aug, 14124 year = "1974", 14125 CODEN = "CACMA2", 14126 ISSN = "0001-0782", 14127 MRclass = "65D05", 14128 MRnumber = "50 15265", 14129 mrreviewer = "Stephen Hilbert", 14130 bibdate = "Thu Jan 16 19:52:47 MST 1997", 14131 bibsource = "Compendex database", 14132 abstract = "Let $R$ be an open, bounded, simply connected region in the $(x,y)$-plane and let $(x*,y*)$ be a point in $R$. Assuming R is starlike with respect to $(x*,y*)$, we discuss a method for computing Gauss harmonic interpolation formulas for $R$ and the point $(x*,y*)$. \par Such formulas approximate a harmonic function at $(x*,y*)$ in terms of a linear combination of its values at certain selected points on the boundary of $R$. Such formulas are useful for approximating the solution of the Dirichlet problem for $R$.", 14133 acknowledgement = ack-nhfb, 14134 classification = "921", 14135 journalabr = "Commun ACM", 14136 keywords = "Dirichlet problem; harmonic interpolation; harmonic quadrature; interpolation; mathematical techniques; quadrature", 14137 } 14138 14139 @Article{Lagerloef:1974:IRR, 14140 author = "Rolf O. E. Lagerloef", 14141 title = "Interpolation with Rounded Ramp Functions", 14142 journal = j-CACM, 14143 volume = "17", 14144 number = "8", 14145 pages = "476--479", 14146 month = aug, 14147 year = "1974", 14148 CODEN = "CACMA2", 14149 ISSN = "0001-0782", 14150 bibdate = "Thu Jan 16 19:52:47 MST 1997", 14151 bibsource = "Compendex database", 14152 abstract = "A new interpolation function is introduced. It has infinitely many continuous derivatives and is a composition of ramp functions with smoothed bends called Rounded Ramp Functions. How the interpolation function can be extended to more than one variable is shown. An efficient Fortran program is given by which the interpolation function can be obtained for a given point set.", 14153 acknowledgement = ack-nhfb, 14154 classification = "921", 14155 journalabr = "Commun ACM", 14156 keywords = "mathematical techniques", 14157 } 14158 14159 @Article{Acton:1974:RRF, 14160 author = "Forman S. Acton", 14161 title = "Recurrence Relations for the {Fresnel} Integral $\int_0^\infty[\exp(-ct)dt/(t)^{1/2}(1+t^2)]$ and Similar Integrals", 14162 journal = j-CACM, 14163 volume = "17", 14164 number = "8", 14165 pages = "480--481", 14166 month = aug, 14167 year = "1974", 14168 CODEN = "CACMA2", 14169 ISSN = "0001-0782", 14170 MRclass = "65D20 (33A70)", 14171 MRnumber = "49 6554", 14172 bibdate = "Mon Jan 27 12:23:52 1997", 14173 bibsource = "Compendex database", 14174 abstract = "The class of functions defined by $\int_0^\infty[\exp(- cX)dt/(1+Y)(t^{1/2})^k]$ where $X$ and $Y$ are either $t$ or $t^2$ and $k$ is $-1$, $0$, or $1$ can be evaluated by recurrences for all but small values of the parameter $c$. These recurrences, given here, are more efficient than the usual asymptotic series.", 14175 acknowledgement = ack-nhfb, 14176 classification = "921", 14177 journalabr = "Commun ACM", 14178 keywords = "exponential integral; Fresnel integral; mathematical techniques; recurrence relations", 14179 } 14180 14181 @Article{Willers:1974:NIA, 14182 author = "I. M. Willers", 14183 title = "A New Integration Algorithm for Ordinary Differential Equations Based on Continued Fraction Approximations", 14184 journal = j-CACM, 14185 volume = "17", 14186 number = "9", 14187 pages = "504--508", 14188 month = sep, 14189 year = "1974", 14190 CODEN = "CACMA2", 14191 ISSN = "0001-0782", 14192 MRclass = "65L05", 14193 MRnumber = "49 8367", 14194 mrreviewer = "G. D. Byrne", 14195 bibdate = "Tue Mar 25 13:26:09 MST 1997", 14196 bibsource = "Compendex database", 14197 abstract = "A new integration algorithm is found, and an implementation is compared with other programmed algorithms. The new algorithm is a step-by-step procedure for solving the initial value problem in ordinary differential equations. It is designed to approximate poles of small integer order in the solutions of the differential equations by continued fractions obtained by manipulating the sums of truncated Taylor series expansions. The new method is compared with Gragg-Bulirsh-Stoer, and the Taylor series method. \par The Taylor series method and the new method are shown to be superior in speed and accuracy, while the new method is shown to be most superior when the solution is required near a singularity. The new method can finally be seen to pass automatically through singularities where all the other methods which are discussed will have failed.", 14198 acknowledgement = ack-nhfb, 14199 classcodes = "B0290M (Numerical integration and differentiation); B0290P (Differential equations); C4160 (Numerical integration and differentiation); C4170 (Differential equations)", 14200 classification = "921", 14201 corpsource = "CERN, Geneve, Switzerland", 14202 journalabr = "Commun ACM", 14203 keywords = "boundary-value problems; continued fraction approximations; continued fractions; differential equations; initial value problem; integration; integration algorithm; mathematical techniques; ordinary differential equations; program comparison; singularities; singularity; step by step procedure; Taylor series; Taylor series expansions", 14204 treatment = "T Theoretical or Mathematical", 14205 } 14206 14207 @Article{Aberth:1974:PNA, 14208 author = "Oliver Aberth", 14209 title = "A Precise Numerical Analysis Program", 14210 journal = j-CACM, 14211 volume = "17", 14212 number = "9", 14213 pages = "509--513", 14214 month = sep, 14215 year = "1974", 14216 CODEN = "CACMA2", 14217 ISSN = "0001-0782", 14218 bibdate = "Tue Mar 25 13:26:09 MST 1997", 14219 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1974.bib", 14220 abstract = "A description is given of a program for computing the solution to a small number of standard numerical analysis problems to any specified accuracy, up to a limit of 2000 correct decimal places. \par Each computed number is bounded in an interval with a multiple precision midpoint. Arithmetic operations involving these numbers are executed according to interval arithmetic concepts, with non-significant digits automatically discarded. Details are supplied of problem specification and problem computation.", 14221 acknowledgement = ack-nhfb, 14222 classcodes = "B0290 (Numerical analysis); C4100 (Numerical analysis); C7310 (Mathematics computing)", 14223 classification = "921", 14224 corpsource = "Texas A and M Univ., College Station, TX, USA", 14225 country = "USA", 14226 descriptors = "Method; realization; numerical method; optimization; information system; program construction; error control; interval arithmetic;", 14227 enum = "3", 14228 journalabr = "Commun ACM", 14229 keywords = "arithmetic; arithmetic operations; error control; interval; interval arithmetic; list structure; mathematical techniques; methods; multiple; multiple precision; natural sciences applications of computers; numerical; numerical analysis; precision midpoint; program; specified accuracy", 14230 language = "English", 14231 references = "11", 14232 } 14233 14234 @Article{Cheung:1974:IGD, 14235 author = "To-yat. Cheung", 14236 title = "Interactive Graphic Display for Region Partitioning by Linear Programming", 14237 journal = j-CACM, 14238 volume = "17", 14239 number = "9", 14240 pages = "513--516", 14241 month = sep, 14242 year = "1974", 14243 CODEN = "CACMA2", 14244 ISSN = "0001-0782", 14245 bibdate = "Tue Mar 25 13:26:09 MST 1997", 14246 bibsource = "Compendex database", 14247 abstract = "Using linear programming, an interactive graphic display system has been implemented to solve the region design problem of partitioning a region into N nonoverlapping subregions in such a way that their areas are in specified proportions and that the total cost of servicing them is a minimum. In a conversational manner, a user can easily obtain different partitionings by specifying and modifying the boundary, the service centers' locations, the area proportions, and the cost functions. Examples are included.", 14248 acknowledgement = ack-nhfb, 14249 classcodes = "B0260 (Optimisation techniques); C1180 (Optimisation techniques); C5540 (Terminals and graphic displays)", 14250 classification = "723; 921", 14251 corpsource = "Univ. Alberta, Edmonton, Alta., Canada", 14252 journalabr = "Commun ACM", 14253 keywords = "area proportions; area specification; boundary; computer graphics; cost; cost functions; interactive graphic display; interactive terminals; linear; linear programming; mathematical programming, linear; minimum; nonoverlapping subregions; of servicing; programming; region design; region partitioning; service centers' locations", 14254 treatment = "A Application; T Theoretical or Mathematical", 14255 } 14256 14257 @Article{Schkolnick:1974:ERT, 14258 author = "Mario Schkolnick", 14259 title = "The Equivalence of Reducing Transition Languages and Deterministic Languages", 14260 journal = j-CACM, 14261 volume = "17", 14262 number = "9", 14263 pages = "517--519", 14264 month = sep, 14265 year = "1974", 14266 CODEN = "CACMA2", 14267 ISSN = "0001-0782", 14268 MRclass = "68A30", 14269 MRnumber = "49 8436", 14270 bibdate = "Tue Mar 25 13:26:09 MST 1997", 14271 bibsource = "Compendex database", 14272 abstract = "The class of reducing transition languages introduced by Eickel, Paul, Bauer, and Samelson was shown by Morris to be a proper superclass of the simple precedence languages. In this paper this result is extended, showing that, in fact, the first class is equivalent to the class of deterministic context free languages.", 14273 acknowledgement = ack-nhfb, 14274 classcodes = "C4210 (Formal logic)", 14275 classification = "723", 14276 corpsource = "Carnegie-Mellon Univ., Pittsburgh, PA, USA", 14277 journalabr = "Commun ACM", 14278 keywords = "computer programming languages; context free languages; context-free languages; deterministic; deterministic context free grammars; deterministic context-free grammars; equivalence; languages; precedence languages; reducing transition languages; superclass; syntax controlled generators", 14279 treatment = "T Theoretical or Mathematical", 14280 } 14281 14282 @Article{Watkins:1974:AAM, 14283 author = "S. L. Watkins", 14284 title = "{ACM} Algorithm 483: Masked Three-Dimensional Plot Program with Rotations", 14285 journal = j-CACM, 14286 volume = "17", 14287 number = "9", 14288 pages = "520--523", 14289 month = sep, 14290 year = "1974", 14291 CODEN = "CACMA2", 14292 ISSN = "0001-0782", 14293 bibdate = "Tue Mar 25 13:26:09 MST 1997", 14294 bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1973.bib", 14295 note = "See also \cite{Feinstein:1975:RMT}.", 14296 acknowledgement = ack-nhfb, 14297 classcodes = "C5540 (Terminals and graphic displays); C6150E (General utility programs)", 14298 corpsource = "Univ. Texas, Austin, TX, USA", 14299 country = "USA", 14300 descriptors = "FORTRAN; graphics; application; method; human factors; diagram manipulation; three-dimensional plot;", 14301 enum = "3241", 14302 keywords = "complete computer programs; computer graphics; masked; plot program; programs; rotations; three dimensional plotting; utility", 14303 keywords = "plotting; three-dimensional plotting", 14304 language = "English", 14305 references = "0", 14306 treatment = "A Application", 14307 } 14308 14309 @Article{Burrell:1974:AAE, 14310 author = "K. H. Burrell", 14311 title = "{ACM} Algorithm 484: Evaluation of the Modified {Bessel} Functions ${K}_0(z)$ and ${K}_1(z)$ for Complex Arguments", 14312 journal = j-CACM, 14313 volume = "17", 14314 number = "9", 14315 pages = "524--526", 14316 month = sep, 14317 year = "1974", 14318 CODEN = "CACMA2", 14319 ISSN = "0001-0782", 14320 bibdate = "Tue Mar 25 13:26:09 MST 1997", 14321 acknowledgement = ack-nhfb, 14322 classcodes = "B0290D (Functional analysis); C4120 (Functional analysis); C7310 (Mathematics computing)", 14323 corpsource = "California Inst. Technol., Pasadena, CA, USA", 14324 keywords = "algorithm; applications of computers; Bessel functions; complex arguments; function evaluation; Gauss-Hermite quadrature; Hankel functions; modified Bessel functions; natural sciences; subroutines", 14325 treatment = "A Application; T Theoretical or Mathematical", 14326 } 14327 14328 @Article{Eidson:1974:AAC, 14329 author = "H. D. Eidson and L. L. Schumaker", 14330 title = "{ACM} Algorithm 485: Computation of $g$-Splines via a Factorization Method", 14331 journal = j-CACM, 14332 volume = "17", 14333 number = "9", 14334 pages = "526--530", 14335 month = sep, 14336 year = "1974", 14337 CODEN = "CACMA2", 14338 ISSN = "0001-0782", 14339 bibdate = "Tue Mar 25 13:26:09 MST 1997", 14340 acknowledgement = ack-nhfb, 14341 classcodes = "B0290F (Interpolation and function approximation); C4130 (Interpolation and function approximation); C7310 (Mathematics computing)", 14342 corpsource = "Univ. Texas, Austin, TX, USA", 14343 keywords = "approximation; computation; computers; factorization method; FORTRAN subroutines; function approximation; g-splines; Hermite/Birkoff data; interpolating; natural sciences applications of; spline approximation; splines; splines (mathematics); subroutines", 14344 treatment = "A Application; T Theoretical or Mathematical", 14345 } 14346 14347 @Article{Young:1974:FOA, 14348 author = "John W. Young", 14349 title = "A First Order Approximation to the Optimum Checkpoint Interval", 14350 journal = j-CACM, 14351 volume = "17", 14352 number = "9", 14353 pages = "530--531", 14354 month = sep, 14355 year = "1974", 14356 CODEN = "CACMA2", 14357 ISSN = "0001-0782", 14358 bibdate = "Tue Mar 25 13:26:09 MST 1997", 14359 bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib", 14360 acknowledgement = ack-nhfb, 14361 classcodes = "C6150J (Operating systems)", 14362 corpsource = "Martin Marietta Corp., Orlando, FL, USA", 14363 keywords = "checkpoint; diagnostics; errors; first order approximation; job failures; minimisation; minimize the cost; operating systems (computers); optimum checkpoint interval; program; programming checkpoint; random", 14364 treatment = "A Application; T Theoretical or Mathematical", 14365 } 14366 14367 @Article{Shwayder:1974:EIT, 14368 author = "Keith Shwayder", 14369 title = "Extending the Information Theory Approach to Converting Limited-Entry Decision Tables to Computer Programs", 14370 journal = j-CACM, 14371 volume = "17", 14372 number = "9", 14373 pages = "532--537", 14374 month = sep, 14375 year = "1974", 14376 CODEN = "CACMA2", 14377 ISSN = "0001-0782", 14378 bibdate = "Tue Mar 25 13:26:09 MST 1997", 14379 bibsource = "Compendex database", 14380 abstract = "This paper modifies an earlier algorithm for converting decision tables into flowcharts which minimize subsequent execution time when compiled into a computer program. The algorithms considered in this paper perform limited search and, accordingly, do not necessarily result in globally optimal solutions. There is an analogy between the problem of converting decision tables into efficient flowcharts and the well-understood problem in information theory of noiseless coding. The results of the noiseless coding literature are used to explore the limitations of algorithms used to solve the decision table problem.", 14381 acknowledgement = ack-nhfb, 14382 classcodes = "C6110 (Systems analysis and programming); C6130 (Data handling techniques)", 14383 classification = "723", 14384 corpsource = "Univ. Chicago, IL, USA", 14385 journalabr = "Commun ACM", 14386 keywords = "coding; computer programs; computer systems programming; converting; converting decision tables; decision tables; depth of search; flowcharting; flowcharts; information theory approach; limited search; list processing; noiseless channel; noiseless coding; sorting", 14387 treatment = "A Application; T Theoretical or Mathematical", 14388 } 14389 14390 @Article{Hoare:1974:MOS, 14391 author = "C. A. R. Hoare", 14392 title = "Monitors: An Operating System Structuring Concept", 14393 journal = j-CACM, 14394 volume = "17", 14395 number = "10", 14396 pages = "549--557", 14397 month = oct, 14398 year = "1974", 14399 CODEN = "CACMA2", 14400 ISSN = "0001-0782", 14401 bibdate = "Tue Mar 25 13:26:09 MST 1997", 14402 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Theory/ProbAlgs.bib and ftp://ftp.ira.uka.de/pub/bibliography/Database/Graefe.bib and ftp://ftp.ira.uka.de/pub/bibliography/Compiler/reynolds.bib", 14403 note = "Erratum in {\em Communications of the ACM}, Vol. 18, No. 2 (February), p. 95, 1975. This paper contains one of the first solutions to the Dining Philosophers problem.", 14404 abstract = "This paper develops Brinch-Hansen's concept of a monitor as a method of structuring an operating system. It introduces a form of synchronization, describes a possible method of implementation in terms of semaphores and gives a suitable proof rule. Illustrative examples include a single resource scheduler, a bounded buffer, an alarm clock, a buffer pool, a disk head optimizer, and a version of the problem of readers and writers.", 14405 acknowledgement = ack-nhfb, 14406 annote = "Monitors", 14407 checked = "7 April 1989", 14408 classcodes = "C6150J (Operating systems)", 14409 classification = "722; 723", 14410 corpsource = "Queen's Univ. Belfast, UK", 14411 journalabr = "Commun ACM", 14412 keywords = "alarm clock; bounded buffer; buffer pool; CACM synchronization communication semaphores; computer operating systems; disc; exclusion; head optimizer; monitors; multiprogramming; mutual; operating system structuring concept; operating systems (computers); proof rule; readers; scheduler; scheduling; semaphores; single resource; structured multiprogramming; structuring; synchronization; writers", 14413 treatment = "A Application; P Practical", 14414 } 14415 14416 @Article{Shen:1974:WBM, 14417 author = "Kenneth K. Shen and James L. Peterson", 14418 title = "A Weighted Buddy Method for Dynamic Storage Allocation", 14419 journal = j-CACM, 14420 volume = "17", 14421 number = "10", 14422 pages = "558--568 (or 558--562??)", 14423 month = oct, 14424 year = "1974", 14425 CODEN = "CACMA2", 14426 ISSN = "0001-0782", 14427 bibdate = "Tue Mar 25 13:26:09 MST 1997", 14428 bibsource = "Compendex database", 14429 note = "See corrigendum \cite{Shen:1975:CWB}.", 14430 abstract = "An extension of the buddy method, called the weighted buddy method, for dynamic storage allocation is presented. The weighted buddy method allows block sizes of $2^k$ and $3(2^k)$, whereas the original buddy method allowed only block sizes of $2^k$. This extension is achieved at an additional cost of only two bits per block. Simulation results are presented which compare this method with the buddy method. These results indicate that for a uniform request distribution, the buddy system has less total memory fragmentation than the weighted buddy algorithm. However, the total fragmentation is smaller for the weighted buddy method when the requests are for exponentially distributed block sizes.", 14431 acknowledgement = ack-nhfb, 14432 classcodes = "C6120 (File organisation); C6150J (Operating systems)", 14433 classification = "722; 723", 14434 corpsource = "Stanford Univ., CA, USA", 14435 journalabr = "Commun ACM", 14436 keywords = "allocation; buddy; buddy systems; computer operating systems; dynamic storage allocation; exponentially distributed block sizes; file organisation; fragmentation; memory allocation; operating systems (computers); simulation; storage; system; total memory; uniform request distribution; weighted buddy algorithm; weighted buddy method", 14437 treatment = "A Application; T Theoretical or Mathematical", 14438 } 14439 14440 @Article{Slutz:1974:NCA, 14441 author = "D. R. Slutz and I. L. Traiger", 14442 title = "A note on the calculation of average working set size", 14443 journal = j-CACM, 14444 volume = "17", 14445 number = "10", 14446 pages = "563--565", 14447 month = oct, 14448 year = "1974", 14449 CODEN = "CACMA2", 14450 ISSN = "0001-0782", 14451 bibdate = "Tue Mar 25 13:26:09 MST 1997", 14452 bibsource = "Compendex database", 14453 abstract = "Finite-length reference string of arbitrary structure are considered, and an exact expression for average working set size in terms of ``corrected'' interference interval statistics is derived. An example is discussed; upper and lower bounds are obtained; and the average working set size function is shown to be efficiently obtained for a set of page sizes, in a single pass of the reference string. This work follows the developments of a paper by Denning and Schwartz, who consider infinite-length reference strings which satisfy certain statistical properties and who derive an expression relating the asymptotic average working set size to the asymptotic missing page rate function under working set replacement.", 14454 acknowledgement = ack-nhfb, 14455 classcodes = "C6120 (File organisation); C6150J (Operating systems)", 14456 classification = "723", 14457 corpsource = "IBM, San Jose, CA, USA", 14458 journalabr = "Commun ACM", 14459 keywords = "arbitrary structure; average working set size; computer operating systems; data structures; finite length reference string; interference interval statistics; operating systems (computers); page; paging; program behaviour; sizes; storage; virtual; working set model", 14460 treatment = "A Application; T Theoretical or Mathematical", 14461 } 14462 14463 @Article{Shneiderman:1974:SDS, 14464 author = "Ben Shneiderman and Peter Scheuermann", 14465 title = "Structured Data Structures", 14466 journal = j-CACM, 14467 volume = "17", 14468 number = "10", 14469 pages = "566--574", 14470 month = oct, 14471 year = "1974", 14472 CODEN = "CACMA2", 14473 ISSN = "0001-0782", 14474 bibdate = "Tue Mar 25 13:26:09 MST 1997", 14475 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib", 14476 abstract = "Programming systems which permit arbitrary linked list structures enable the user to create complicated structures without sufficient protection. Deletions can result in unreachable data elements, and there is no guarantee that additions will be performed properly. To remedy this situation, this paper proposes a data structure description and manipulation language which provides for the creation of a restricted class of data structures but ensures the correctness of the program. This is accomplished by an explicit structure declaration facility, a restriction on the permissible operations, and execution-time checks.", 14477 acknowledgement = ack-nhfb, 14478 annote = "Operations on linked structures.", 14479 classcodes = "C6120 (File organisation)", 14480 classification = "723", 14481 corpsource = "Indiana Univ., Bloomington, IN, USA", 14482 journalabr = "Commun ACM", 14483 keywords = "arbitrary linked list; base management system; data; data processing; Data Structure Description and Manipulation; data structures; execution; explicit structure declaration facility; Language; storage management; structured data structures; structured programming; structures; time checks", 14484 treatment = "A Application; P Practical", 14485 } 14486 14487 @Article{Canaday:1974:BEC, 14488 author = "R. H. Canaday and R. D. Harrison and E. L. Ivie and J. L. Ryder and L. A. Wehr", 14489 title = "A Back-end Computer for Data Base Management", 14490 journal = j-CACM, 14491 volume = "17", 14492 number = "10", 14493 pages = "575--583 (or 575--582??)", 14494 month = oct, 14495 year = "1974", 14496 CODEN = "CACMA2", 14497 ISSN = "0001-0782", 14498 bibdate = "Tue Mar 25 13:26:09 MST 1997", 14499 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib", 14500 abstract = "It is proposed that the data base management function be placed on a dedicated back-end computer which accepts commands (in a relatively high level language such as the CODASYL Data Base Task Group, April 1971 Report) from a host computer, accesses the data base on secondary storage, and returns results. The advantages of such a configuration are discussed. An experimental implementation, called the Experimental Data Management System, XDAMS, is described and certain conclusions about the back-end approach are drawn from this implementation.", 14501 acknowledgement = ack-nhfb, 14502 annote = "Physical separation of data base management from data processing to gain flexibility, etc. in the XDMS system.", 14503 classcodes = "C6120 (File organisation)", 14504 classification = "723", 14505 corpsource = "Bell Telephone Labs. Inc., Piscataway, NJ, USA", 14506 journalabr = "Commun ACM", 14507 keywords = "data processing", 14508 keywords = "back end computer; computer configurations; computer networks; data base management; Data base Task; digital communication systems; eXperimental Data Management System; Group Language; host computer; secondary storage; storage management", 14509 treatment = "A Application; P Practical", 14510 } 14511 14512 @Article{Charnes:1974:GTP, 14513 author = "A. Charnes and W. M. Raike and J. D. Stutz and A. S. Walters", 14514 title = "On Generation of Test Problems for Linear Programming Codes", 14515 journal = j-CACM, 14516 volume = "17", 14517 number = "10", 14518 pages = "583--587 (or 583--586??)", 14519 month = oct, 14520 year = "1974", 14521 CODEN = "CACMA2", 14522 ISSN = "0001-0782", 14523 bibdate = "Tue Mar 25 13:26:09 MST 1997", 14524 bibsource = "Compendex database", 14525 abstract = "This paper presents a theoretical justification and an illustrative implementation of a method for generating linear programming test problems with known solutions. The method permits the generation of test problems that are of arbitrary size and have a wide range of numerical characteristics.", 14526 acknowledgement = ack-nhfb, 14527 classcodes = "B0260 (Optimisation techniques); C1180 (Optimisation techniques); C6130 (Data handling techniques)", 14528 classification = "723; 921", 14529 corpsource = "Univ. Texas, Austin, TX, USA", 14530 journalabr = "Commun ACM", 14531 keywords = "accuracy; codes; computer programming; data handling; large; linear programming; linear programming codes; LP; LP program validation; mathematical programming, linear; program evaluation; scale linear programming codes; test problem generation; test problems", 14532 treatment = "A Application; T Theoretical or Mathematical", 14533 } 14534 14535 @Article{Veillon:1974:AAN, 14536 author = "F. Veillon", 14537 title = "{ACM} Algorithm 486: Numerical Inversion of {Laplace} Transform", 14538 journal = j-CACM, 14539 volume = "17", 14540 number = "10", 14541 pages = "587--589 (or 587--588??)", 14542 month = oct, 14543 year = "1974", 14544 CODEN = "CACMA2", 14545 ISSN = "0001-0782", 14546 bibdate = "Tue Mar 25 13:26:09 MST 1997", 14547 note = "See also \cite{Koppelaar:1976:RNI,Veillon:1977:RNI}.", 14548 acknowledgement = ack-nhfb, 14549 classcodes = "B0230 (Integral transforms); C1130 (Integral transforms); C7310 (Mathematics computing)", 14550 corpsource = "Univ. Grenoble, France", 14551 keywords = "computers; inversion; Laplace transform; Laplace transforms; natural sciences applications of; numerical inversion; subroutines", 14552 treatment = "A Application; T Theoretical or Mathematical", 14553 } 14554 14555 @Article{Koppelaar:1974:CRA, 14556 author = "H. Koppelaar", 14557 title = "Certification and remark on algorithm 191", 14558 journal = j-CACM, 14559 volume = "17", 14560 number = "10", 14561 pages = "589--590", 14562 month = oct, 14563 year = "1974", 14564 CODEN = "CACMA2", 14565 ISSN = "0001-0782", 14566 bibdate = "Tue Mar 25 13:26:09 MST 1997", 14567 acknowledgement = ack-nhfb, 14568 classcodes = "C7310 (Mathematics computing)", 14569 corpsource = "Utrecht State Univ., Netherlands", 14570 keywords = "algorithm; hypergeometric; improvements; inefficiency; natural sciences applications of computers; subroutines", 14571 treatment = "G General Review; T Theoretical or Mathematical", 14572 } 14573 14574 @Article{Proll:1974:CRQ, 14575 author = "L. G. Proll", 14576 title = "A computer routine for quadratic and linear programming problems", 14577 journal = j-CACM, 14578 volume = "17", 14579 number = "10", 14580 pages = "590--590", 14581 month = oct, 14582 year = "1974", 14583 CODEN = "CACMA2", 14584 ISSN = "0001-0782", 14585 bibdate = "Tue Mar 25 13:26:09 MST 1997", 14586 acknowledgement = ack-nhfb, 14587 classcodes = "B0260 (Optimisation techniques); C1180 (Optimisation techniques); C7310 (Mathematics computing)", 14588 corpsource = "Univ. Leeds, UK", 14589 keywords = "algorithm; computer routine; computers; linear programming; natural sciences applications of; programming; quadratic and linear; quadratic programming; subroutines", 14590 treatment = "T Theoretical or Mathematical", 14591 } 14592 14593 @Article{Klemes:1974:RFM, 14594 author = "J. Klemes and J. Klemsa", 14595 title = "{Rosenbrock} function minimization", 14596 journal = j-CACM, 14597 volume = "17", 14598 number = "10", 14599 pages = "590--591", 14600 month = oct, 14601 year = "1974", 14602 CODEN = "CACMA2", 14603 ISSN = "0001-0782", 14604 bibdate = "Tue Mar 25 13:26:09 MST 1997", 14605 acknowledgement = ack-nhfb, 14606 classcodes = "B0260 (Optimisation techniques); C1180 (Optimisation techniques); C7310 (Mathematics computing)", 14607 corpsource = "CHEPOS, Brno, Czechoslovakia", 14608 keywords = "algorithm; minimisation; natural sciences applications of computers; Rosenbrock function minimization", 14609 treatment = "T Theoretical or Mathematical", 14610 } 14611 14612 @Article{Krogh:1974:EEI, 14613 author = "Fred T. Krogh", 14614 title = "Errata: ``{Efficient Implementation of a Variable Projection Algorithm for Nonlinear Least Squares}''", 14615 journal = j-CACM, 14616 volume = "17", 14617 number = "10", 14618 pages = "591--591", 14619 month = oct, 14620 year = "1974", 14621 CODEN = "CACMA2", 14622 ISSN = "0001-0782", 14623 bibdate = "Tue May 28 14:52:27 1996", 14624 note = "See \cite{Krogh:1974:EIV}.", 14625 acknowledgement = ack-nhfb, 14626 } 14627 14628 @Article{Gilchrist:1974:EFP, 14629 author = "Bruce Gilchrist and Richard E. Weber", 14630 title = "Enumerating Full-Time Programmers", 14631 journal = j-CACM, 14632 volume = "17", 14633 number = "10", 14634 pages = "592--593", 14635 month = oct, 14636 year = "1974", 14637 CODEN = "CACMA2", 14638 ISSN = "0001-0782", 14639 bibdate = "Thu Jan 16 19:52:47 MST 1997", 14640 bibsource = "Compendex database", 14641 abstract = "Data from the 1970 Census and the Department of Labor's Area Wage Surveys are used to derive estimates of the number of full-time programmers employed during the years 1969 through 1973. The 1973 figure of 180,000 is considerably less than suggested in earlier reports. It is recommended that educational administrators consider whether the many courses aimed at training programmers are justified on a vocational basis.", 14642 acknowledgement = ack-nhfb, 14643 classification = "723; 912", 14644 journalabr = "Commun ACM", 14645 keywords = "computer programming", 14646 } 14647 14648 @Article{Sterling:1974:GHC, 14649 author = "Theodor D. Sterling", 14650 title = "Guidelines for Humanizing Computerized Information Systems, {A} Report from Stanley House", 14651 journal = j-CACM, 14652 volume = "17", 14653 number = "11", 14654 pages = "609--613", 14655 month = nov, 14656 year = "1974", 14657 CODEN = "CACMA2", 14658 ISSN = "0001-0782", 14659 bibdate = "Tue Mar 25 13:26:09 MST 1997", 14660 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib", 14661 abstract = "This report is the result of an intensive analysis of conditions that may humanize or dehumanize participants in various computerized systems. The guidelines presented here were generated during a week-long workshop sponsored in August 1973 by Canada Council at Canada Council's Stanley House.", 14662 acknowledgement = ack-nhfb, 14663 classcodes = "C0200 (General computer topics); C7100 (Business and administration)", 14664 classification = "723; 901", 14665 corpsource = "Simon Fraser Univ., Burnaby, BC, Canada", 14666 journalabr = "Commun ACM", 14667 keywords = "computerized information systems; economic and sociological effects; guidelines; humanizing; information retrieval systems; management information; systems", 14668 treatment = "G General Review", 14669 } 14670 14671 @Article{Ferrari:1974:ILC, 14672 author = "Domenico Ferrari", 14673 title = "Improving Locality by Critical Working Sets", 14674 journal = j-CACM, 14675 volume = "17", 14676 number = "11", 14677 pages = "614--620", 14678 month = nov, 14679 year = "1974", 14680 CODEN = "CACMA2", 14681 ISSN = "0001-0782", 14682 bibdate = "Tue Mar 25 13:26:09 MST 1997", 14683 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Misc/cache.bib", 14684 abstract = "A new approach to program locality improvement via restructuring is described. The method is particularly suited to those systems where primary memory is managed according to a working set strategy. It is based on the concept of critical working set, a working set which does not contain the next memory reference. The data the method operates upon are extracted from a trace of the program to be restructured. It is shown that, except in some special cases, the method is not optimum. However, the experimental results obtained by using the method to restructure an interactive text editor and the file system module of an operating system have shown its substantial superiority over the other methods proposed in the literature.", 14685 acknowledgement = ack-nhfb, 14686 classcodes = "C6120 (File organisation); C6150J (Operating systems)", 14687 classification = "723", 14688 corpsource = "Univ. California, Berkeley, CA, USA", 14689 journalabr = "Commun ACM", 14690 keywords = "computer systems programming; critical working set; dynamic restructuring; file organisation; improvement; locality; memory hierarchies; multiprogramming; program restructuring; program segmentation; restructuring; restructuring techniques; static; virtual memory; working set strategy", 14691 treatment = "P Practical", 14692 } 14693 14694 @Article{Miller:1974:LPS, 14695 author = "Perry Lowell Miller", 14696 title = "A locally-organized parser for spoken input", 14697 journal = j-CACM, 14698 volume = "17", 14699 number = "11", 14700 pages = "621--630", 14701 month = nov, 14702 year = "1974", 14703 CODEN = "CACMA2", 14704 ISSN = "0001-0782", 14705 bibdate = "Tue Mar 25 13:26:09 MST 1997", 14706 bibsource = "Compendex database", 14707 abstract = "This paper describes LPARS, a locally-organized parsing system, designed for use in a continuous speech recognizer. LPARS processes a string of phonemes which contains ambiguity and error. The system is locally-organized in the sense that it builds local parse structures from reliable word candidates recognized anywhere in an input utterance. These local structures are used as ``islands of reliability'' to guide the search for more highly garbled words which might complete the utterance.", 14708 acknowledgement = ack-nhfb, 14709 classcodes = "C5530 (Pattern recognition and computer vision equipment)", 14710 classification = "723; 751", 14711 corpsource = "MIT, Cambridge, MA, USA", 14712 journalabr = "Commun ACM", 14713 keywords = "augmented; local parsing; parsing; speech recognition; speech understanding; transition networks", 14714 treatment = "P Practical", 14715 } 14716 14717 @Article{Rader:1974:MCS, 14718 author = "Gary M. Rader", 14719 title = "Method for Composing Simple Traditional Music by Computer", 14720 journal = j-CACM, 14721 volume = "17", 14722 number = "11", 14723 pages = "631--638", 14724 month = nov, 14725 year = "1974", 14726 CODEN = "CACMA2", 14727 ISSN = "0001-0782", 14728 bibdate = "Tue Mar 25 13:26:09 MST 1997", 14729 bibsource = "Compendex database", 14730 abstract = "A method is described for composing musical rounds by computer. This method uses some music theory plus additional heuristics. Fundamental to the method is a set of productions together with sets of applicability rules and weight rules which operate on the productions deciding when and to what extent they are available for use. Several rounds generated by the computer implementation of the method are presented. Generally, the resultant music sounds mediocre to the professional although usually pleasing to the layman. It appears that full-blown music theory is not needed for rounds --- all the hardware required for structural levels is not necessary for these pieces. The author has tried to address both musicians and computer scientists.", 14731 acknowledgement = ack-nhfb, 14732 classcodes = "C1230 (Artificial intelligence); C7820 (Humanities computing)", 14733 classification = "461; 723; 912", 14734 corpsource = "Univ. Pennsylvania, Philadelphia, PA, USA", 14735 journalabr = "Commun ACM", 14736 keywords = "artificial intelligence; computer composition; computer music; formal; heuristic programming; humanities; languages; models of cognitive processes; music theory; probabilistic grammars; systems science and cybernetics; traditional musical rounds", 14737 treatment = "A Application; P Practical", 14738 } 14739 14740 @Article{Freiburghouse:1974:RAU, 14741 author = "R. A. Freiburghouse", 14742 title = "Register Allocation via Usage Counts", 14743 journal = j-CACM, 14744 volume = "17", 14745 number = "11", 14746 pages = "638--642", 14747 month = nov, 14748 year = "1974", 14749 CODEN = "CACMA2", 14750 ISSN = "0001-0782", 14751 bibdate = "Tue Mar 25 13:26:09 MST 1997", 14752 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Compiler/Compiler.Lins.bib", 14753 abstract = "This paper introduces the notion of usage counts, shows how usage counts can be developed by algorithms that eliminate redundant computations, and describes how usage counts can provide the basis for register allocation. The paper compares register allocation based on usage counts to other commonly used register allocation techniques, and presents evidence which shows that the usage count technique is significantly better than these other techniques.", 14754 acknowledgement = ack-nhfb, 14755 classcodes = "C6110 (Systems analysis and programming); C6120 (File organisation)", 14756 classification = "723", 14757 corpsource = "Honeywell Information Systems Inc., Cambridge, MA, USA", 14758 journalabr = "Commun ACM", 14759 keywords = "common subexpressions; compilers; computations; computer programming; demand paging; languages; optimization; programming; redundant; register allocation; storage allocation; usage counts; virtual memory", 14760 treatment = "P Practical", 14761 } 14762 14763 @Article{Dijkstra:1974:SSS, 14764 author = "E. W. Dijkstra", 14765 title = "Self-stabilizing Systems in Spite of Distributed Control", 14766 journal = j-CACM, 14767 volume = "17", 14768 number = "11", 14769 pages = "643--644", 14770 month = nov, 14771 year = "1974", 14772 CODEN = "CACMA2", 14773 ISSN = "0001-0782", 14774 bibdate = "Tue Mar 25 13:26:09 MST 1997", 14775 bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/traces.bib", 14776 acknowledgement = ack-nhfb, 14777 classcodes = "C4220 (Automata theory); C6150J (Operating systems)", 14778 corpsource = "Burroughs Corp., Nuenen, Netherlands", 14779 keywords = "(computers); automata theory; distributed control; error recovery; fault tolerant computing; harmonious cooperation; multiprocessing; mutual exclusion; networks; operating systems; robustness; self repair; self stabilization; sharing; synchronization", 14780 treatment = "T Theoretical or Mathematical", 14781 } 14782 14783 @Article{Brown:1974:ODM, 14784 author = "J. A. Brown and B. Werner", 14785 title = "An on-site data management system application in field archaeology", 14786 journal = j-CACM, 14787 volume = "17", 14788 number = "11", 14789 pages = "644--646", 14790 month = nov, 14791 year = "1974", 14792 CODEN = "CACMA2", 14793 ISSN = "0001-0782", 14794 bibdate = "Tue Mar 25 13:26:09 MST 1997", 14795 acknowledgement = ack-nhfb, 14796 classcodes = "C6120 (File organisation); C7820 (Humanities computing)", 14797 corpsource = "Northwestern Univ., Evanston, IL, USA", 14798 keywords = "APL-PLUS; archaeology; data management system; field archaeology; file organisation; on site; prehistoric site; retrieval systems", 14799 treatment = "A Application; P Practical", 14800 } 14801 14802 @Article{Hanson:1974:STR, 14803 author = "D. R. Hanson", 14804 title = "A simple technique for representing strings in {Fortran IV}", 14805 journal = j-CACM, 14806 volume = "17", 14807 number = "11", 14808 pages = "646--647", 14809 month = nov, 14810 year = "1974", 14811 CODEN = "CACMA2", 14812 ISSN = "0001-0782", 14813 bibdate = "Tue Mar 25 13:26:09 MST 1997", 14814 acknowledgement = ack-nhfb, 14815 classcodes = "C6110 (Systems analysis and programming); C6120 (File organisation); C6140D (High level languages)", 14816 corpsource = "Univ. Arizona, Tucson, AZ, USA", 14817 keywords = "data structures; FORTRAN; FORTRAN IV; programming; representing strings; string processing; structured", 14818 treatment = "P Practical", 14819 } 14820 14821 @Article{VanRijsbergen:1974:BPD, 14822 author = "C. J. {Van Rijsbergen}", 14823 title = "The best-match problem in document retrieval", 14824 journal = j-CACM, 14825 volume = "17", 14826 number = "11", 14827 pages = "648--649", 14828 month = nov, 14829 year = "1974", 14830 CODEN = "CACMA2", 14831 ISSN = "0001-0782", 14832 bibdate = "Tue Mar 25 13:26:09 MST 1997", 14833 acknowledgement = ack-nhfb, 14834 classcodes = "C6120 (File organisation); C7250 (Information storage and retrieval)", 14835 corpsource = "Monash Univ., Clayton, Vic., Australia", 14836 keywords = "best match; classification; clustering; dissimilarity; document retrieval; file searching; hierarchy; information retrieval; matching", 14837 treatment = "T Theoretical or Mathematical", 14838 } 14839 14840 @Article{Evans:1974:MEL, 14841 author = "R. V. Evans", 14842 title = "Multiple exits from a loop using neither {GO TO} nor labels", 14843 journal = j-CACM, 14844 volume = "17", 14845 number = "11", 14846 pages = "650--650", 14847 month = nov, 14848 year = "1974", 14849 CODEN = "CACMA2", 14850 ISSN = "0001-0782", 14851 bibdate = "Tue Mar 25 13:26:09 MST 1997", 14852 acknowledgement = ack-nhfb, 14853 classcodes = "C6110 (Systems analysis and programming)", 14854 corpsource = "ICL Dataskil, Reading, UK", 14855 keywords = "control structures; exit statement; GO TO; go to free programming; labels; multiple exits from loops; programming", 14856 treatment = "P Practical", 14857 } 14858 14859 @Article{Knuth:1974:CPA, 14860 author = "Donald E. Knuth", 14861 title = "Computer Programming as an Art", 14862 journal = j-CACM, 14863 volume = "17", 14864 number = "12", 14865 pages = "667--673", 14866 month = dec, 14867 year = "1974", 14868 CODEN = "CACMA2", 14869 ISSN = "0001-0782", 14870 bibdate = "Tue Mar 25 13:26:09 MST 1997", 14871 bibsource = "Compendex database", 14872 note = "French translation, with three supplementary paragraphs, in {\sl L'Informatique Nouvelle}, No.\ 64 (June 1975), 20--27. Japanese translation by Makoto Arisawa in {\sl bit\/ \bf 7} (1975), 434--444; reprinted in {\sl Kunusu Sensei no Program-Ron\/} (see under Books), 2--19. English version reprinted with the supplementary paragraphs in {\sl ACM Turing Award Lectures: The First Twenty Years} (New York: ACM Press, 1987), 33--46; reprinted with corrections in \cite[pp.~1--16]{Knuth:1992:LP}. Russian translation by V. V. Martyn\t iuk in {\sl Lektsii laureatov premii T'\t\i uringa\/} (Moscow: Mir, 1993), 48--64.", 14873 abstract = "Discussion emphasizes that computer programming is an art as well as a science.", 14874 acknowledgement = ack-nhfb, 14875 classcodes = "C6110 (Systems analysis and programming)", 14876 classification = "723", 14877 corpsource = "Stanford Univ., CA, USA", 14878 journalabr = "Commun ACM", 14879 keywords = "art; computer; computer programming; programming; quality", 14880 treatment = "G General Review; P Practical", 14881 } 14882 14883 @Article{Press:1974:AMC, 14884 author = "Laurance I. Press", 14885 title = "Arguments for a Moratorium on the Construction of a Community Information Utility", 14886 journal = j-CACM, 14887 volume = "17", 14888 number = "12", 14889 pages = "674--678", 14890 month = dec, 14891 year = "1974", 14892 CODEN = "CACMA2", 14893 ISSN = "0001-0782", 14894 bibdate = "Tue Mar 25 13:26:09 MST 1997", 14895 bibsource = "Compendex database", 14896 abstract = "In this article the author urges a prudent and decentralized approach to the question of the design and desirability of computerized community information utilities. Current proposals for community information utilities are examined in this framework, and the conclusion is drawn that society is not yet in a position to justify either the construction of an information utility in a prototype community or the acceptance of a policy in favor of its widespread implementation.", 14897 acknowledgement = ack-nhfb, 14898 classcodes = "C7210 (Information services and centres)", 14899 classification = "723", 14900 corpsource = "Univ. Southern California, Los Angeles, CA, USA", 14901 journalabr = "Commun ACM", 14902 keywords = "community information utility; construction; decentralized; demand; design; desirability; effects; feasibility; information services; side; techniques; users; world view", 14903 treatment = "G General Review", 14904 } 14905 14906 @Article{Strauss:1974:AMH, 14907 author = "J. C. Strauss", 14908 title = "An analytic model of the {Hasp} execution task monitor", 14909 journal = j-CACM, 14910 volume = "17", 14911 number = "12", 14912 pages = "679--685", 14913 month = dec, 14914 year = "1974", 14915 CODEN = "CACMA2", 14916 ISSN = "0001-0782", 14917 bibdate = "Tue Mar 25 13:26:09 MST 1997", 14918 bibsource = "Compendex database", 14919 abstract = "A simple analytic model has been developed for investigating the effects of the HASP Execution Task Monitor on the performance of a multiprogramming system. A specific example is worked through in detail, and numerical results are reported. The model demonstrates the effect of the HETM priority algorithm and permits the evaluation of possible modifications to the algorithm.", 14920 acknowledgement = ack-nhfb, 14921 classcodes = "C6150G (Diagnostic, testing, debugging and evaluating systems); C6150J (Operating systems)", 14922 classification = "723", 14923 corpsource = "Washington Univ., St. Louis, MO, USA", 14924 journalabr = "Commun ACM", 14925 keywords = "(computers); analytic model; computer selection and evaluation; computer systems programming; dispatching; execution task monitor; HASP; hasp execution task monitor; operating systems; OS/360; performance evaluation; scheduling", 14926 treatment = "A Application; T Theoretical or Mathematical", 14927 } 14928 14929 @Article{Adam:1974:CLS, 14930 author = "Thomas L. Adam and K. M. Chandy and J. R. Dickson", 14931 title = "A Comparison of List Schedules for Parallel Processing Systems", 14932 journal = j-CACM, 14933 volume = "17", 14934 number = "12", 14935 pages = "685--690", 14936 month = dec, 14937 year = "1974", 14938 CODEN = "CACMA2", 14939 ISSN = "0001-0782", 14940 bibdate = "Tue Mar 25 13:26:09 MST 1997", 14941 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Parallel/OVR.bib", 14942 abstract = "The problem of scheduling two or more processors to minimize the execution time of a program which consists of a set of partially ordered tasks is studied. Cases where task execution times are deterministic and others in which execution times are random variables are analyzed. It is shown that different algorithms suggested in the literature vary significantly in execution time and that the B-schedule of Coffman and Graham is near-optimal. A dynamic programming solution for the case in which execution times are random variables is presented.", 14943 acknowledgement = ack-nhfb, 14944 classcodes = "C5400 (Analogue and digital computers and systems); C6150J (Operating systems)", 14945 classification = "722", 14946 corpsource = "Univ. Texas, Austin, TX, USA", 14947 journalabr = "Commun ACM", 14948 keywords = "comparison; computer systems, digital; dynamic programming; list schedules; list scheduling; optimisation; optimization; parallel processing; parallel processing systems; precedence graphs; scheduling", 14949 treatment = "A Application; T Theoretical or Mathematical", 14950 } 14951 14952 @Article{Wallace:1974:CGG, 14953 author = "N. D. Wallace", 14954 title = "Computer Generation of Gamma Random Variates with Non-Integral Shape Parameters", 14955 journal = j-CACM, 14956 volume = "17", 14957 number = "12", 14958 pages = "691--695", 14959 month = dec, 14960 year = "1974", 14961 CODEN = "CACMA2", 14962 ISSN = "0001-0782", 14963 MRclass = "65C10", 14964 MRnumber = "51 11920", 14965 mrreviewer = "R. R. Coveyou", 14966 bibdate = "Tue Mar 25 13:26:09 MST 1997", 14967 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD.bib", 14968 abstract = "When the shape parameter, alpha, is integral, generating gamma random variables with a digital computer is straightforward. There is no simple method for generating gamma random variates with non-integral shape parameters. A common procedure is to approximately generate such random variables by the use of the so-called probability switch method. Another procedure, which is exact, is due to Joehnk. This paper presents a rejection method for exactly generating gamma random variables when alpha is greater than 1. The efficiency of the rejection method is shown to be better than the efficiency of M. D. Joehnk's method. The paper concludes that when alpha is non-integral, the following mix of procedures yields the best combination of accuracy and efficiency: (1) when alpha is less than 1, use Joehnk's method; (2) when 1 is less than alpha and alpha is less than 5, use the rejection method; (3) when alpha is greater than 5, use the probability switch method.", 14969 acknowledgement = ack-nhfb, 14970 classcodes = "C7890 (Other special applications of computing)", 14971 classification = "922", 14972 corpsource = "Southern Illinois Univ., Edwardsville, IL, USA", 14973 country = "USA", 14974 descriptors = "RVG;", 14975 enum = "8007", 14976 journalabr = "Commun ACM", 14977 keywords = "computer generation; gamma random variables; probability; probability distribution; random number generation; random numbers; simulation", 14978 language = "English", 14979 location = "SEL: Wi", 14980 references = "0", 14981 revision = "16/01/94", 14982 treatment = "A Application; T Theoretical or Mathematical", 14983 } 14984 14985 @Article{Salazar:1974:GFS, 14986 author = "A. Salazar and R. V. Oakford", 14987 title = "A Graph Formulation of a School Scheduling Algorithm", 14988 journal = j-CACM, 14989 volume = "17", 14990 number = "12", 14991 pages = "696--698", 14992 month = dec, 14993 year = "1974", 14994 CODEN = "CACMA2", 14995 ISSN = "0001-0782", 14996 MRclass = "90B35", 14997 MRnumber = "51 12313", 14998 mrreviewer = "I. Gh. Ciobanu", 14999 bibdate = "Tue Mar 25 13:26:09 MST 1997", 15000 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Theory/graph.coloring.bib", 15001 note = "See \cite{Korfhage:1975:SO,Korfhage:1975:MSO,Garey:1975:SO}.", 15002 abstract = "The problem classically titled ``The Examination Schedule Problem'' takes various forms in the literature. Most of these formulations can be presented in the terminology of classical Network Theory. \par One such formulation is: Given a nondirected network, partition its nodes into a minimal number of subsets such that no two members of the same subset are connected by an arc. An obvious lower limit to this number is the size of the largest strongly connected subgraph. Kirchgassner proved that an upper limit is this size plus one. One logical extension of the previous work is the introduction of variable length examinations where $W(I)$ is the number of periods for exam $I$. The object of this paper is to generalize the definition of largest strongly connected subgraph to include the weighting of nodes, to present an approximate algorithm which usually finds the largest strongly connected subgraph, and to discuss the application of this algorithm to the solution of school scheduling and exam scheduling problems.", 15003 acknowledgement = ack-nhfb, 15004 classcodes = "B0260 (Optimisation techniques); C1180 (Optimisation techniques); C1290F (Systems theory applications in industry)C7110 (Educational administration)", 15005 classification = "723; 921", 15006 corpsource = "Stanford Univ., CA, USA", 15007 journalabr = "Commun ACM", 15008 keywords = "computer programming --- Subroutines; data processing; educational administrative data processing; examination; examination scheduling; graph; graph coloring; graph theory; mathematical techniques --- Graph Theory; nondirected network; scheduling; school; school scheduling; strongly connected; strongly connected subgraph; subgraph", 15009 treatment = "A Application; T Theoretical or Mathematical", 15010 } 15011 15012 @Article{Chu:1974:EMS, 15013 author = "Sherwood C. Chu and Mones Berman", 15014 title = "An Exponential Method for the Solution of Systems of Ordinary Differential Equations", 15015 journal = j-CACM, 15016 volume = "17", 15017 number = "12", 15018 pages = "699--702", 15019 month = dec, 15020 year = "1974", 15021 CODEN = "CACMA2", 15022 ISSN = "0001-0782", 15023 MRclass = "65L99", 15024 MRnumber = "51 4685", 15025 mrreviewer = "W. H. Enright", 15026 bibdate = "Tue Mar 25 13:26:09 MST 1997", 15027 bibsource = "Compendex database", 15028 abstract = "An explicit, coupled, single-step method for the numerical solution of initial value problems for systems of ordinary differential equations is presented. \par The method was designed to be general purpose in nature but to be especially efficient when dealing with stiff systems of differential equations. It is, in general, second order except for the case of a linear system with constant coefficients and linear forcing terms; in that case, the method is third order. It has been implemented and put to routine usage in biological applications-where stiffness frequently appears-with favorable results. When compared to a standard fourth order Runge-Kutta implementation, computation time required by this method has ranged from comparable for certain nonstiff problems to better than two orders of magnitude faster for some highly stiff systems.", 15029 acknowledgement = ack-nhfb, 15030 classcodes = "B0290P (Differential equations); C4170 (Differential equations)", 15031 classification = "921", 15032 corpsource = "Nat. Cancer Inst., Bethesda, MD, USA", 15033 journalabr = "Commun ACM", 15034 keywords = "boundary-value problems; initial; initial value problems; mathematical techniques; numerical methods; numerical solution; ordinary differential equations; stiff systems; value problems", 15035 treatment = "T Theoretical or Mathematical", 15036 } 15037 15038 @Article{Pomeranz:1974:AAE, 15039 author = "J. Pomeranz", 15040 title = "{ACM} Algorithm 487: Exact Cumulative Distribution of the {Kolmogorov-Smirnov} Statistic for Small Samples", 15041 journal = j-CACM, 15042 volume = "17", 15043 number = "12", 15044 pages = "703--704", 15045 month = dec, 15046 year = "1974", 15047 CODEN = "CACMA2", 15048 ISSN = "0001-0782", 15049 bibdate = "Tue Mar 25 13:26:09 MST 1997", 15050 note = "See also \cite{Pomeranz:1976:REC}.", 15051 acknowledgement = ack-nhfb, 15052 classcodes = "C7310 (Mathematics computing)", 15053 corpsource = "Purdue Univ., West Lafayette, IN, USA", 15054 keywords = "algorithm; exact cumulative distribution; FORTRAN; Kolmogorov Smirnov test; natural sciences applications of computers; small samples; statistic; statistics; subroutines", 15055 treatment = "A Application; T Theoretical or Mathematical", 15056 } 15057 15058 @Article{Brent:1974:AAG, 15059 author = "R. P. Brent", 15060 title = "{ACM} Algorithm 488: {A} {Gaussian} pseudo-random number generator [{G5}]", 15061 journal = j-CACM, 15062 volume = "17", 15063 number = "12", 15064 pages = "704--706 (or 704--705??)", 15065 month = dec, 15066 year = "1974", 15067 CODEN = "CACMA2", 15068 ISSN = "0001-0782", 15069 bibdate = "Tue Mar 25 13:26:09 MST 1997", 15070 bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD.bib", 15071 acknowledgement = ack-nhfb, 15072 classcodes = "C7890 (Other special applications of computing)", 15073 corpsource = "Australian Nat. Univ., Canberra, Australia", 15074 country = "USA", 15075 descriptors = "RVG;", 15076 enum = "7061", 15077 keywords = "distribution; FORTRAN; Gaussian; generator; GRAND; normal distribution; pseudo random numbers; random number generation; random numbers; subroutines", 15078 language = "English", 15079 location = "SEL: Wi", 15080 references = "0", 15081 revision = "16/01/94", 15082 treatment = "A Application; T Theoretical or Mathematical", 15083 } 15084 15085 @Article{Skinner:1974:HAI, 15086 author = "C. William Skinner", 15087 title = "Heuristic Approach to Inductive Inference in Fact Retrieval Systems", 15088 journal = j-CACM, 15089 volume = "17", 15090 number = "12", 15091 pages = "707--712", 15092 month = dec, 15093 year = "1974", 15094 CODEN = "CACMA2", 15095 ISSN = "0001-0782", 15096 bibdate = "Tue Mar 25 13:26:09 MST 1997", 15097 bibsource = "Compendex database", 15098 abstract = "Heuristic procedures are presented which have been developed to perform inferences by generalizing from available information. The procedures make use of a similarity structure which is imposed on the data base using nonnumerical clustering algorithms. They are implemented in a model fact retrieval system which uses a formal query language and a property-list data structure. A program of experiments is described wherein the procedures are used with test data bases which are altered by deleting part of the data and by purposely introducing false data. It is found that the system can infer the correct response under a variety of conditions involving incomplete and inconsistent data.", 15099 acknowledgement = ack-nhfb, 15100 classcodes = "C6120 (File organisation); C7100 (Business and administration); C7250 (Information storage and retrieval)", 15101 classification = "723; 901", 15102 corpsource = "North Carolina State Univ., Raleigh, NC, USA", 15103 journalabr = "Commun ACM", 15104 keywords = "clustering; fact retrieval; file organisation; formal query language; heuristic programming; heuristics; inductive; inference; information; information retrieval systems; management information systems; retrieval systems", 15105 treatment = "A Application; T Theoretical or Mathematical", 15106 } 15107 15108 @Article{Mitra:1974:SAH, 15109 author = "D. Mitra", 15110 title = "Some Aspects of Hierarchical Memory Systems", 15111 journal = j-CACM, 15112 volume = "21", 15113 number = "1", 15114 pages = "54--65", 15115 month = jan, 15116 year = "1974", 15117 CODEN = "CACMA2", 15118 ISSN = "0001-0782", 15119 bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/storage.bib", 15120 keywords = "memory hierarchy; Performance Evaluation: Analytic", 15121 } 15122 15123 @Article{Millstein:1975:CSI, 15124 author = "R. E. Millstein", 15125 title = "Control Structures in {Illiac IV Fortran}", 15126 journal = j-CACM, 15127 volume = "6", 15128 number = "10", 15129 pages = "157--164", 15130 month = oct, 15131 year = "1975", 15132 CODEN = "CACMA2", 15133 ISSN = "0001-0782", 15134 bibdate = "Tue Sep 20 22:19:34 1994", 15135 bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Parallel/Multi.bib", 15136 } 15137 15138 @Article{Sterling:1975:CHL, 15139 author = "T. Sterling and V. Lum and N. Shu and B. Housel", 15140 title = "{\em CONVERT\/}: {A} High Level Translation Definition Language for Data Conversion", 15141 journal = j-CACM, 15142 volume = "8", 15143 number = "10", 15144 pages = "557--567", 15145 month = oct, 15146 year = "1975", 15147 CODEN = "CACMA2", 15148 ISSN = "0001-0782", 15149 bibdate = "Mon Feb 12 14:34:00 1996", 15150 bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Database/database.bib", 15151 abstract = "This paper describes a high level and nonprocedural translation definition language, CONVERT, which provides very powerful and highly flexible data restructuring capabilities. Its design is based on the simple underlying concept of a form which enables the users to visualize the translation processes, and thus makes data translation a much simpler task. ``CONVERT'' has been chosen for conveying the purpose of the language and should not be confused with any other language or program bearing the same name.", 15152 annote = "A full description of the CONVERT language is given. It is fairly complete, and dealt well with record oriented systems. A good set of examples is given.", 15153 keywords = "data conversion; data restructuring; data translation; database reorganization; nonprocedural languages; programming languages; translation definition; utility program", 15154 owner = "curtis", 15155 } 15156 15157 @Article{Finerman:1975:PCF, 15158 author = "Aaron Finerman", 15159 title = "Professionalism in the Computing Field", 15160 journal = j-CACM, 15161 volume = "18", 15162 number = "1", 15163 pages = "4--9", 15164 month = jan, 15165 year = "1975", 15166 CODEN = "CACMA2", 15167 ISSN = "0001-0782", 15168 bibdate = "Tue Mar 25 13:26:09 MST 1997", 15169 bibsource = "Compendex database", 15170 abstract = "Each of the four types of institutions --- academic, industry, government, and the professional society --- that educate, employ, regulate, and mold the practitioner contributes to the ``nonprofessional'' status of the computing practitioner. The roles of these institutions are examined, various shortcomings are noted, and recommended changes are suggested.", 15171 acknowledgement = ack-nhfb, 15172 classcodes = "C0200 (General computer topics)", 15173 classification = "723; 912", 15174 corpsource = "State Univ. of New York, Stony Brook, NY, USA", 15175 journalabr = "Commun ACM", 15176 keywords = "academic; computers; computing; computing practitioner; economic and sociological effects; education; educational programmes; employment; government; industry; professional society; professionalism; social standards; technical standards", 15177 treatment = "G General Review; P Practical", 15178 } 15179 15180 @Article{Bauer:1975:PN, 15181 author = "F. L. Bauer", 15182 title = "Positivity and Norms", 15183 journal = j-CACM, 15184 volume = "18", 15185 number = "1", 15186 pages = "9--13", 15187 month = jan, 15188 year = "1975", 15189 CODEN = "CACMA2", 15190 ISSN = "0001-0782", 15191 MRclass = "65F35 (15A60 47A30)", 15192 MRnumber = "54 6476", 15193 bibdate = "Tue Mar 25 13:26:09 MST 1997", 15194 bibsource = "Compendex database", 15195 note = "Collection of articles honoring {Alston S. Householder}.", 15196 abstract = "Following some lines of joint work with A. S. Householder, the character and use of algebraic methods in the theory of norms is demonstrated. New results concerning norms with values in an Archimedian vector lattice (not necessarily being totally ordered) are given, in particular for the generalization of order unit norms, L-norms and M-norms. An example of application to operator norms is given concerning contraction properties of positive operators.", 15197 acknowledgement = ack-nhfb, 15198 classcodes = "B0290H (Linear algebra); C4140 (Linear algebra)", 15199 classification = "921", 15200 corpsource = "Math. Inst., Tech. Univ. of Munich, Munich, West Germany", 15201 journalabr = "Commun ACM", 15202 keywords = "absolute; algebraic methods; Archimedian vector lattice; contraction; L norms; M norms; mathematical techniques; matrices; matrix algebra; methods; monotonic; norms; numerical; numerical methods; numerical range; operator norms; order; positive operators; positivity; positivity cones; properties; unit norms; vector lattice; vectors", 15203 treatment = "T Theoretical or Mathematical", 15204 } 15205 15206 @Article{Todd:1975:LC, 15207 author = "John Todd", 15208 title = "The Lemniscate Constants", 15209 journal = j-CACM, 15210 volume = "18", 15211 number = "1", 15212 pages = "14--19", 15213 month = jan, 15214 year = "1975", 15215 CODEN = "CACMA2", 15216 ISSN = "0001-0782", 15217 MRclass = "65D20", 15218 MRnumber = "51 11935", 15219 mrreviewer = "L. Fox", 15220 bibdate = "Tue Mar 25 13:26:09 MST 1997", 15221 bibsource = "Compendex database", 15222 note = "Collection of articles honoring {Alston S. Householder}. See corrigendum \cite{Todd:1975:CLC}.", 15223 abstract = "The lemniscate constants, and indeed some of the methods used for actually computing them, have played an enormous part in the development of mathematics. An account is given here of some of the methods used --- most of the derivations can be made by elementary methods. This material can be used for teaching purposes, and there is much relevant and interesting historical material. The acceleration methods developed for the purpose of evaluating these constants are useful in other problems.", 15224 acknowledgement = ack-nhfb, 15225 classcodes = "B0290D (Functional analysis); B0290Z (Other numerical methods); C4120 (Functional analysis); C4190 (Other numerical methods)", 15226 classification = "921", 15227 corpsource = "California Inst. of Technol., Pasadena, CA, USA", 15228 journalabr = "Commun ACM", 15229 keywords = "acceleration; acceleration methods; elliptic functions; Euler transformation; function evaluation; lemniscate; lemniscate constants; mathematical techniques; mathematics; transforms", 15230 treatment = "B Bibliography; T Theoretical or Mathematical", 15231 } 15232 15233 @Article{Peters:1975:SGJ, 15234 author = "G. Peters and J. H. Wilkinson", 15235 title = "On the Stability of {Gauss-Jordan} Elimination with Pivoting", 15236 journal = j-CACM, 15237 volume = "18", 15238 number = "1", 15239 pages = "20--24", 15240 month = jan, 15241 year = "1975", 15242 CODEN = "CACMA2", 15243 ISSN = "0001-0782", 15244 MRclass = "65F05 (65G05)", 15245 MRnumber = "51 7261", 15246 mrreviewer = "L. B. Rall", 15247 bibdate = "Tue Mar 25 13:26:09 MST 1997", 15248 bibsource = "Compendex database", 15249 note = "Collection of articles honoring {Alston S. Householder}", 15250 abstract = "The stability of the Gauss-Jordan algorithm with partial pivoting for the solution of general systems of linear equations is commonly regarded as suspect. \par It is shown that in many respects suspicions are unfounded, and in general the absolute error in the solution is strictly comparable with that corresponding to Gaussian elimination with partial pivoting plus back substitution. However, when A is ill conditioned, the residual corresponding to the Gauss-Jordan solution will often be much greater than that corresponding to the Gaussian elimination solution.", 15251 acknowledgement = ack-nhfb, 15252 classcodes = "B0290B (Error analysis in numerical methods); B0290H (Linear algebra); C4110 (Error analysis in numerical methods); C4140 (Linear algebra)", 15253 classification = "921", 15254 corpsource = "Nat. Phys. Lab., Teddington, UK", 15255 journalabr = "Commun ACM", 15256 keywords = "back-substitution; backward error analysis; bound for residual; bounds for error in solution; Gauss-Jordan algorithm; Gaussian elimination; mathematical techniques", 15257 keywords = "absolute error; elimination; error analysis; Gauss Jordan algorithm; Gauss/Jordan; Gaussian elimination; linear algebra; linear equations; numerical methods; stability", 15258 treatment = "T Theoretical or Mathematical", 15259 } 15260 15261 @Article{Birkhoff:1975:THN, 15262 author = "Garrett Birkhoff", 15263 title = "Two {Hadamard} Numbers for Matrices", 15264 journal = j-CACM, 15265 volume = "18", 15266 number = "1", 15267 pages = "25--29", 15268 month = jan, 15269 year = "1975", 15270 CODEN = "CACMA2", 15271 ISSN = "0001-0782", 15272 MRclass = "65F35", 15273 MRnumber = "51 9464", 15274 mrreviewer = "John Todd", 15275 bibdate = "Tue Mar 25 13:26:09 MST 1997", 15276 bibsource = "Compendex database", 15277 note = "Collection of articles honoring {Alston S. Householder}.", 15278 abstract = "A discussion is given of two functions of the entries of a square matrix, both related to Hadamard's determinant theorem, which have some merits as alternatives to norm-bound ``condition numbers''. One (for linear systems) is known; the other (for eigensystems) seems to be new.", 15279 acknowledgement = ack-nhfb, 15280 classcodes = "B0290H (Linear algebra); C4140 (Linear algebra)", 15281 classification = "921", 15282 corpsource = "Harvard Univ., Cambridge, MA, USA", 15283 journalabr = "Commun ACM", 15284 keywords = "condition numbers; eigen systems; eigenvalues; error analysis; Gram-Schmidt orthogonalization; Gram/Schmidt organisation; Hadamard numbers; Hadamard's determinant; linear systems; mathematical techniques; matrices; matrix algebra; norm bound 'condition numbers'; norms; square matrix; theorem", 15285 treatment = "T Theoretical or Mathematical", 15286 } 15287 15288 @Article{vanderSluis:1975:PEN, 15289 author = "A. {van der Sluis}", 15290 title = "Perturbations of Eigenvalues of Non-Normal Matrices", 15291 journal = j-CACM, 15292 volume = "18", 15293 number = "1", 15294 pages = "30--36", 15295 month = jan, 15296 year = "1975", 15297 CODEN = "CACMA2", 15298 ISSN = "0001-0782", 15299 MRclass = "65F15", 15300 MRnumber = "51 9457a", 15301 mrreviewer = "Jan Zitko", 15302 bibdate = "Tue Mar 25 13:26:09 MST 1997", 15303 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Theory/gvl.bib", 15304 note = "Collection of articles honoring {Alston S. Householder}. See corrigendum \cite{vanderSluis:1975:CPE}.", 15305 abstract = "The problem considered is to give bounds for finite perturbations of simple and multiple eigenvalues $lambda_i$ of nonnormal matrices, where these bounds are in terms of the eigenvalues $\{\lambda_i\}$, the departure from normality $\sigma$, and the Frobenius norm of the perturbation matrix, but not in terms of the eigensystem. The bounds which are derived are shown to be almost attainable for any set of all matrices of given $\{\lambda_i\}$ and $\sigma$.", 15306 acknowledgement = ack-nhfb, 15307 classcodes = "B0290H (Linear algebra); C4140 (Linear algebra)", 15308 classification = "921", 15309 corpsource = "Univ. of Utrecht, Utrecht, Netherlands", 15310 journalabr = "Commun ACM", 15311 keywords = "circles; departure from normality; eigenvalues; eigenvalues and eigenfunctions; Frobenius norm; Gershgorin; Gershgorin circles; mathematical techniques; matrix algebra; non-normal matrices; nonnormal matrices; perturbation of eigenvalues; perturbations", 15312 treatment = "T Theoretical or Mathematical", 15313 } 15314 15315 @Article{Marcus:1975:EDT, 15316 author = "Marvin Marcus and Herbert Robinson", 15317 title = "Elementary Divisors of Tensor Products", 15318 journal = j-CACM, 15319 volume = "18", 15320 number = "1", 15321 pages = "36--39", 15322 month = jan, 15323 year = "1975", 15324 CODEN = "CACMA2", 15325 ISSN = "0001-0782", 15326 MRclass = "15A69", 15327 MRnumber = "51 571", 15328 mrreviewer = "George P. Barker", 15329 bibdate = "Tue Mar 25 13:26:09 MST 1997", 15330 bibsource = "Compendex database", 15331 abstract = "The elementary divisors of a tensor product of linear transformations have been known for 40 years. This paper provides a short, easily accessible proof of these results, and points out an interesting combinatorial consequence of the proof.", 15332 acknowledgement = ack-nhfb, 15333 classcodes = "B0290H (Linear algebra); C4140 (Linear algebra)", 15334 classification = "921", 15335 corpsource = "Univ. of California, Santa Barbara, CA, USA", 15336 journalabr = "Commun ACM", 15337 keywords = "combinatorial; combinatorial mathematics; consequence; elementary divisors; linear transformations; mathematical techniques; matrix algebra; tensor products; tensors", 15338 treatment = "T Theoretical or Mathematical", 15339 } 15340 15341 @Article{Hestenes:1975:PCG, 15342 author = "Magnus R. Hestenes", 15343 title = "Pseudoinverses and Conjugate Gradients", 15344 journal = j-CACM, 15345 volume = "18", 15346 number = "1", 15347 pages = "40--43", 15348 month = jan, 15349 year = "1975", 15350 CODEN = "CACMA2", 15351 ISSN = "0001-0782", 15352 MRclass = "65F20", 15353 MRnumber = "51 2269", 15354 mrreviewer = "G. Maess", 15355 bibdate = "Tue Mar 25 13:26:09 MST 1997", 15356 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Theory/Matrix.bib", 15357 note = "Collection of articles honoring {Alston S. Householder}", 15358 abstract = "This paper is devoted to the study of connections between pseudoinverses of matrices and conjugate gradients and conjugate direction routines.", 15359 acknowledgement = ack-nhfb, 15360 classcodes = "B0290H (Linear algebra); C4140 (Linear algebra)", 15361 classification = "921", 15362 corpsource = "IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA", 15363 journalabr = "Commun ACM", 15364 keywords = "cg; conjugate direction routines; conjugate gradients; ginv; hermitian matrix; mathematical techniques; matrices; matrix algebra; minimisation; minimization; nla; pseudoinverse; pseudoinverses", 15365 treatment = "T Theoretical or Mathematical", 15366 } 15367 15368 @Article{Mills:1975:NMC, 15369 author = "Harlan D. Mills", 15370 title = "The New Math of Computer Programming", 15371 journal = j-CACM, 15372 volume = "18", 15373 number = "1", 15374 pages = "43--48", 15375 month = jan, 15376 year = "1975", 15377 CODEN = "CACMA2", 15378 ISSN = "0001-0782", 15379 MRclass = "68A05", 15380 MRnumber = "51 2333a", 15381 mrreviewer = "E. Ikaunieks", 15382 bibdate = "Tue Mar 25 13:26:09 MST 1997", 15383 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Misc/softeng.bib", 15384 note = "Collection of articles honoring {Alston S. Householder}. See corrigendum \cite{Mills:1975:CNM}.", 15385 abstract = "Structured programming has proved to be an important methodology for systematic program design and development. Structured programs are identified as compound function expressions in the algebra of functions. The algebraic properties of these function expressions permit the reformulation (expansion as well as reduction) of a nested subexpression independently of its environment, thus modeling what is known as stepwise program refinement as well as program execution. Finally, structured programming is characterized in terms of the selection and solution of certain elementary equations defined in the algebra of functions. These solutions can be given in general formulas, each involving a single parameter, which display the entire freedom available in creating correct structure programs.", 15386 acknowledgement = ack-nhfb, 15387 classcodes = "C4240 (Programming and algorithm theory); C6110 (Systems analysis and programming)", 15388 classification = "723; 921", 15389 corpsource = "IBM Federal Systems Div., Owego, NY, USA", 15390 journalabr = "Commun ACM", 15391 keywords = "algebraic properties; compound; computer metatheory; computer programming; function expressions; mathematical techniques; program correctness; program execution; programming; programming theory; structured; systematic program design", 15392 treatment = "T Theoretical or Mathematical", 15393 } 15394 15395 @Article{Chen:1975:SER, 15396 author = "Tien Chi Chen and Irving T. Ho", 15397 title = "Storage-Efficient Representation of Decimal Data", 15398 journal = j-CACM, 15399 volume = "18", 15400 number = "1", 15401 pages = "49--52", 15402 month = jan, 15403 year = "1975", 15404 CODEN = "CACMA2", 15405 ISSN = "0001-0782", 15406 MRclass = "94A15 (68A20)", 15407 MRnumber = "50 16105", 15408 mrreviewer = "R. N. Goss", 15409 bibdate = "Tue Mar 25 13:26:09 MST 1997", 15410 bibsource = "Compendex database; garbo.uwasa.fi:/pc/doc-soft/fpbiblio.txt", 15411 note = "Collection of articles honoring {Alston S. Householder}", 15412 abstract = "Usually n decimal digits are represented by 4n bits in computers. Actually, two BCD digits can be compressed optimally and reversibly into 7 bits, and three digits into 10 bits, by a very simple algorithm based on the fixed-length combination of two variable field-length encodings. In over half of the cases the compressed code results from the conventional BCD code by simple removal of redundant 0 bits. A long decimal message can be subdivided into three-digit blocks, and separately compressed; the result differs from the asymptotic minimum length by only 0.34 percent. The hardware requirement is small, and the mappings can be done manually.", 15413 acknowledgement = ack-nhfb, 15414 classcodes = "C6130 (Data handling techniques)", 15415 classification = "722; 921", 15416 corpsource = "IBM San Jose Res. Lab., CA, USA", 15417 journalabr = "Commun ACM", 15418 keywords = "data storage units; mathematical techniques --- Digital Arithmetic", 15419 keywords = "asymptotic minimum; binary coded decimal; codes; compressed code; data compression; decimal data; fixed length combination; hardware; length; length encodings; representation; storage efficient; variable field", 15420 treatment = "T Theoretical or Mathematical", 15421 } 15422 15423 @Article{Liniger:1975:CBA, 15424 author = "Werner Liniger", 15425 title = "Connections Between Accuracy and Stability Properties of Linear Multistep Formulas", 15426 journal = j-CACM, 15427 volume = "18", 15428 number = "1", 15429 pages = "53--56", 15430 month = jan, 15431 year = "1975", 15432 CODEN = "CACMA2", 15433 ISSN = "0001-0782", 15434 MRclass = "65L05", 15435 MRnumber = "51 2291", 15436 mrreviewer = "Ian Gladwell", 15437 bibdate = "Tue Mar 25 13:26:09 MST 1997", 15438 bibsource = "Compendex database", 15439 note = "Collection of articles honoring {Alston S. Householder}", 15440 abstract = "This paper is concerned with stability and accuracy of families of linear $k$-step formulas depending on parameters, with particular emphasis on the numerical solution of stiff ordinary differential equations. \par An upper bound, $p=k$, is derived for the order of accuracy of $A(\infty)$-stable formulas. Three criteria are given for A$(0)$-stability. It is shown that (1) for $p=k$, $k$ arbitrary, $A(\infty)$-stability implies certain necessary conditions for $A(0)$-stability and for strict stability (meaning that the extraneous roots of $p(\psi)$ satisfy $|\psi|<1)$; (2) for $p=k=2,3,4, \mbox{and} 5$, $A(\infty)$-stability (for $k=5$ together with another constraint) implies strict stability; and (3) for certain one-parameter classes of formulas with $p=k=3,4,\mbox{and/or} 5$, $A(\infty)$-stability implies $A(0)$-stability.", 15441 acknowledgement = ack-nhfb, 15442 classcodes = "B0290B (Error analysis in numerical methods); B0290P (Differential equations); C4110 (Error analysis in numerical methods); C4170 (Differential equations)", 15443 classification = "921", 15444 corpsource = "IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA", 15445 journalabr = "Commun ACM", 15446 keywords = "A(0)-stability; A(inf)-stability; accuracy; differential equations; error analysis; linear multistep formulas; mathematical techniques; numerical; numerical methods; order of accuracy; parametrised linear multistep formulae; parametrized linear multistep formulas; solution; stability; stiff equations; stiff ordinary differential equations; strict stability", 15447 treatment = "T Theoretical or Mathematical", 15448 } 15449 15450 @Article{Hanson:1975:SUM, 15451 author = "Richard J. Hanson", 15452 title = "Stably Updating Mean and Standard Deviation of Data", 15453 journal = j-CACM, 15454 volume = "18", 15455 number = "1", 15456 pages = "57--58", 15457 month = jan, 15458 year = "1975", 15459 CODEN = "CACMA2", 15460 ISSN = "0001-0782", 15461 MRclass = "62-04", 15462 MRnumber = "51 7064", 15463 mrreviewer = "D. J. Evans", 15464 bibdate = "Tue Mar 25 13:26:09 MST 1997", 15465 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1975.bib", 15466 note = "Collection of articles honoring {Alston S. Householder}", 15467 abstract = "By considering the (sample) mean of a set of data as a fit to this data by a constant function, a computational method is given based on a matrix formulation and Givens transformations. The (sample) mean and standard deviation can be updated as data accumulates. The procedure is numerically stable and does not require storage of the data. Methods for dealing with weighted data and data removal are presented. When updating the mean and square of the standard deviation, the process requires no square roots.", 15468 acknowledgement = ack-nhfb, 15469 classcodes = "B0290F (Interpolation and function approximation); C4130 (Interpolation and function approximation)", 15470 classification = "921", 15471 corpsource = "Washington State Univ., Pullman, WA, USA", 15472 country = "USA", 15473 descriptors = "Simulation; statistics; numeric calculation;", 15474 enum = "7357", 15475 journalabr = "Commun ACM", 15476 keywords = "data removal; estimation; function approximation; Givens; iterative methods; least squares approximation; mathematical statistics; mathematical techniques; matrix formulation; mean; stably updating; standard deviation; theory; transformations; weighted data", 15477 language = "English", 15478 references = "0", 15479 treatment = "T Theoretical or Mathematical", 15480 } 15481 15482 @Article{McCarthy:1975:PCC, 15483 author = "John McCarthy", 15484 title = "Proposed Criterion for a Cipher to be Probable-Word Proof", 15485 journal = j-CACM, 15486 volume = "18", 15487 number = "2", 15488 pages = "??--??", 15489 month = feb, 15490 year = "1975", 15491 CODEN = "CACMA2", 15492 ISSN = "0001-0782", 15493 bibdate = "Sat Jan 18 15:50:16 1997", 15494 bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib", 15495 xxnote = "Cannot find in index to volume 18, nor in Compendex, nor in MathSciNet, nor in Zentralblatt f{\"u}r Mathematik, nor in ACM Computing Archive CD-ROM.", 15496 } 15497 15498 @Article{Burnett:1975:AIM, 15499 author = "G. J. Burnett and E. G. {Coffman, Jr.}", 15500 title = "Analysis of Interleaved Memory Systems Using Blockage Buffers", 15501 journal = j-CACM, 15502 volume = "18", 15503 number = "2", 15504 pages = "91--95", 15505 month = feb, 15506 year = "1975", 15507 CODEN = "CACMA2", 15508 ISSN = "0001-0782", 15509 bibdate = "Tue Mar 25 13:26:09 MST 1997", 15510 bibsource = "Compendex database", 15511 abstract = "A model of interleaved memory systems is presented, and the analysis of the model by Monte Carlo simulation is discussed. The simulations investigate the performance of various system structures, i.e., schemes for sending instruction and data requests to the memory system. Performance is measured by determining the distribution of the number of memory modules in operation during a memory cycle.", 15512 acknowledgement = ack-nhfb, 15513 classcodes = "C5310 (Storage system design); C6120 (File organisation)", 15514 classification = "723", 15515 corpsource = "Index Systems Inc., Cambridge, MA, USA", 15516 journalabr = "Commun ACM", 15517 keywords = "blockage buffers; data requests; data storage, digital; file organisation; interleaved memory systems; memory cycle; memory modules; Monte Carlo methods; Monte Carlo simulation; simulation; storage; structures; system; units", 15518 treatment = "T Theoretical or Mathematical", 15519 } 15520 15521 @Article{Goldman:1975:SPC, 15522 author = "Neil M. Goldman", 15523 title = "Sentence Paraphrasing from a Conceptual Base", 15524 journal = j-CACM, 15525 volume = "18", 15526 number = "2", 15527 pages = "96--106", 15528 month = feb, 15529 year = "1975", 15530 CODEN = "CACMA2", 15531 ISSN = "0001-0782", 15532 bibdate = "Tue Mar 25 13:26:09 MST 1997", 15533 bibsource = "Compendex database", 15534 abstract = "A model of natural language generation based on an underlying language-free representation of meaning is described. A program based on this model is able to produce sentence paraphrases which demonstrate understanding with respect to a given context. This generator operates in conjunction with a natural language analyzer and a combined memory and inference model. In generating sentences from meaning structures, the program employs both the information retrieval and deduction capabilities of the memory model.", 15535 acknowledgement = ack-nhfb, 15536 classcodes = "C1230 (Artificial intelligence); C7820 (Humanities computing)", 15537 classification = "721", 15538 corpsource = "Stanford Univ., Stanford, CA, USA", 15539 journalabr = "Commun ACM", 15540 keywords = "artificial intelligence; automata theory; conceptual base; conceptual properties; dictionary; discrimination nets; formal grammar; information retrieval; knowledge; language translation and; linguistics; memory and inference; model; natural language; sentence paraphrasing; surface grammatical; syntactic roles; systems science and cybernetics --- Artificial Intelligence; word sense", 15541 treatment = "X Experimental", 15542 } 15543 15544 @Article{VanderBrug:1975:SSP, 15545 author = "Gordon J. VanderBrug and Jack Minker", 15546 title = "State-Space, Problem-Reduction, and Theorem Proving --- Some Relationships", 15547 journal = j-CACM, 15548 volume = "18", 15549 number = "2", 15550 pages = "107--115", 15551 month = feb, 15552 year = "1975", 15553 CODEN = "CACMA2", 15554 ISSN = "0001-0782", 15555 MRclass = "68A45", 15556 MRnumber = "54 9192", 15557 mrreviewer = "Walter Oberschelp", 15558 bibdate = "Tue Mar 25 13:26:09 MST 1997", 15559 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Ai/nonmono.bib", 15560 abstract = "This paper suggests a bidirectional relationship between state-space and problem-reduction representations. It presents a formalism based on multiple-input and multiple-output operators which provides a basis for viewing the two types of representations in this manner. A representation of the language recognition problem which is based on the J. Cocke parsing algorithm is used as an illustration. A method for representing problems in first-order logic in such a way that the inference system employed by a resolution-based theorem prover determines whether the set of clauses is interpreted in the state-space mode or in the problem-reduction mode is presented.", 15561 acknowledgement = ack-nhfb, 15562 classcodes = "C1230 (Artificial intelligence); C1310 (Control system analysis and synthesis methods)", 15563 classification = "461; 731", 15564 corpsource = "Univ. of Maryland, College Park, MD, USA", 15565 journalabr = "Commun ACM", 15566 keywords = "systems science and cybernetics", 15567 keywords = "artificial intelligence; Cocke parsing algorithm; first order logic; inference; input-resolution; language recognition problem; linear resolution; multiple input operators; multiple output; operators; problem reduction; proving; resolution based theorem prover; state space; state-space methods; system; theorem; theorem proving", 15568 treatment = "T Theoretical or Mathematical", 15569 } 15570 15571 @Article{Kimme:1975:FCA, 15572 author = "Carolyn Kimme and Dana Ballard and Jack Sklansky", 15573 title = "Finding Circles by an Array of Accumulators", 15574 journal = j-CACM, 15575 volume = "18", 15576 number = "2", 15577 pages = "120--122", 15578 month = feb, 15579 year = "1975", 15580 CODEN = "CACMA2", 15581 ISSN = "0001-0782", 15582 bibdate = "Tue Mar 25 13:26:09 MST 1997", 15583 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Misc/Reverse.eng.bib", 15584 abstract = "An efficient procedure for detecting approximate circles and approximately circular arcs of varying gray levels in an edge-enhanced digitized picture is described.", 15585 acknowledgement = ack-nhfb, 15586 classcodes = "B6140C (Optical information, image and video signal processing); C1250 (Pattern recognition); C5530 (Pattern recognition and computer vision equipment); C7330 (Biology and medical computing)", 15587 classification = "723; 741", 15588 corpsource = "Univ. of California, Irvine, CA, USA", 15589 journalabr = "Commun ACM", 15590 keywords = "approximate circles; array of accumulators; biomedical applications of computers; circle finding; circular arcs; curve detection; edge enhanced digitised; grey levels; Haugh straight line finder; line fitting; pattern recognition; pattern recognition systems; picture; picture processing", 15591 treatment = "T Theoretical or Mathematical", 15592 } 15593 15594 @Article{Johnston:1975:MRE, 15595 author = "H. C. Johnston and C. A. R. Hoare", 15596 title = "Matrix Reduction --- an Efficient Method (school timetables)", 15597 journal = j-CACM, 15598 volume = "18", 15599 number = "3", 15600 pages = "141--150", 15601 month = mar, 15602 year = "1975", 15603 CODEN = "CACMA2", 15604 ISSN = "0001-0782", 15605 MRclass = "65K05", 15606 MRnumber = "52 2203", 15607 mrreviewer = "P. Brock", 15608 bibdate = "Tue Mar 25 13:26:09 MST 1997", 15609 bibsource = "Compendex database", 15610 abstract = "The paper describes an efficient method for reduction of the binary matrices which arise in some school time-tabling problems. It is a development of that described by John Lions. It has been generalized and adapted to fit into the complete timetabling process; to use a more compact data representation and more efficient processing techniques; to take fuller advantage of possible available previous knowledge about the matrix. And it is designed as a structured program, which can readily be coded by the reader in the high level or low level programming language of his choice. Practical tests of the method have shown it to be a good basis for a realistic timetabling algorithm.", 15611 acknowledgement = ack-nhfb, 15612 classcodes = "B0290H (Linear algebra); C4140 (Linear algebra); C7110 (Educational administration)", 15613 classification = "921", 15614 corpsource = "Queen's Univ. of Belfast, UK", 15615 journalabr = "Commun ACM", 15616 keywords = "binary matrices; data representation; educational administrative data processing; high level programming language; low level programming language; mathematical techniques; matrix algebra; matrix reduction; problems; processing techniques; school time tabling; school timetable construction; structured program; structured programming; tight set; timetabling algorithm", 15617 treatment = "A Application; T Theoretical or Mathematical", 15618 } 15619 15620 @Article{Kernighan:1975:STM, 15621 author = "Brian W. Kernighan and Lorinda L. Cherry", 15622 title = "A System for Typesetting Mathematics", 15623 journal = j-CACM, 15624 volume = "18", 15625 number = "3", 15626 pages = "151--157", 15627 month = mar, 15628 year = "1975", 15629 CODEN = "CACMA2", 15630 ISSN = "0001-0782", 15631 bibdate = "Tue Mar 25 13:26:09 MST 1997", 15632 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1975.bib", 15633 abstract = "This paper describes the design and implementation of a system for typesetting mathematics. \par The language has been designed to be easy to learn and to use by people (for example, secretaries and mathematical typists) who know neither mathematics nor typesetting. Experience indicates that the language can be learned in an hour or so, for it has few rules and fewer exceptions. For typical expressions, the size and font changes, positioning, line drawing, and the like necessary to print according to mathematical conventions are all done automatically. For example, the input {\tt sum from i=0 to infinity x sub i=pi over 2} produces $\sum_{i=0}^\infty x_i = \pi/2$. The syntax of the language is specified by a small context-free grammar; a compiler-compiler is used to make a compiler that translates this language into typesetting commands. Output maybe produced on either a phototypesetter or on a terminal with forward and reverse half-line motions. The system interfaces directly with text formatting programs, so mixtures of text and mathematics may be handled simply. This paper was typeset by the authors using the system described.", 15634 acknowledgement = ack-nhfb, 15635 classcodes = "C6130 (Data handling techniques); C6140D (High level languages); C7230 (Publishing and reproduction); C7310 (Mathematics computing)", 15636 classification = "723; 745", 15637 corpsource = "Bell Labs., Holmdel, NJ, USA", 15638 country = "USA", 15639 date = "15/05/84", 15640 descriptors = "Design; realization; command language; graphics language; text processing; graphics; interactive mode;", 15641 enum = "1645", 15642 journalabr = "Commun ACM", 15643 keywords = "compiler-compiler; computer controlled typesetting; computer graphics; computer programming languages; graphics; mathematics; oriented languages; photocomposition; phototypesetter; printing; problem; syntax; terminal; text formatting programs; text processing.; typesetting; typesetting mathematics", 15644 language = "English", 15645 references = "7", 15646 treatment = "A Application; P Practical", 15647 } 15648 15649 @Article{Lawrie:1975:GPL, 15650 author = "D. H. Lawrie and T. Layman and D. Baer and J. M. Randal", 15651 title = "{GLYPNIR} --- {A} programming language for {Illiac IV}", 15652 journal = j-CACM, 15653 volume = "18", 15654 number = "3", 15655 pages = "157--164", 15656 month = mar, 15657 year = "1975", 15658 CODEN = "CACMA2", 15659 ISSN = "0001-0782", 15660 bibdate = "Tue Mar 25 13:26:09 MST 1997", 15661 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Parallel/Multi.bib", 15662 abstract = "GLYPNIR is one of the earliest existing languages designed for programming the Illiac IV computer. The syntax of the language is based on ALGOL 60, but has been extended to allow the programmer explicitly to specify the parallelism of his algorithm in terms of 64-word vectors. This paper describes the characteristics, goals, and philosophy of the language, and discusses some of the problems associated with parallel computer architectures.", 15663 acknowledgement = ack-nhfb, 15664 classcodes = "C5400 (Analogue and digital computers and systems); C6140B (Machine-oriented languages)", 15665 classification = "723", 15666 corpsource = "Univ. of Illinois, Urbana-Champaign, IL, USA", 15667 journalabr = "Commun ACM", 15668 keywords = "ALGOL 60; algorithm; computer programming languages; GLYPNIR; GLYPNIR programming; Illiac IV computer; language; machine oriented languages; parallel computer architectures; parallel processing; parallelism; programming language; syntax", 15669 treatment = "G General Review; P Practical", 15670 } 15671 15672 @Article{Floyd:1975:ETB, 15673 author = "Robert W. Floyd and Ronald L. Rivest", 15674 title = "Expected Time Bounds for Selection", 15675 journal = j-CACM, 15676 volume = "18", 15677 number = "3", 15678 pages = "165--172", 15679 month = mar, 15680 year = "1975", 15681 CODEN = "CACMA2", 15682 ISSN = "0001-0782", 15683 bibdate = "Tue Mar 25 13:26:09 MST 1997", 15684 bibsource = "Compendex database", 15685 abstract = "A new selection algorithm is presented which is shown to be very efficient on the average, both theoretically and practically. The number of comparisons used to select the $i$-th smallest of $n$ numbers is $n + \min(i,n-i) + o(n)$. A lower bound within 9 percent of the above formula is also derived.", 15686 acknowledgement = ack-nhfb, 15687 classcodes = "C4240 (Programming and algorithm theory); C7310 (Mathematics computing)", 15688 classification = "723", 15689 corpsource = "Stanford Univ., Stanford, CA, USA", 15690 journalabr = "Commun ACM", 15691 keywords = "algorithm theory; bound; computational complexity; computer programming; mathematics; medians; quantiles; selection; selection algorithm; time bounds", 15692 treatment = "T Theoretical or Mathematical", 15693 } 15694 15695 @Article{Floyd:1975:AAA, 15696 author = "R. W. Floyd and R. L. Rivest", 15697 title = "{ACM} Algorithm 489: The Algorithm {SELECT} -- for Finding the $i$th Smallest of $n$ Elements", 15698 journal = j-CACM, 15699 volume = "18", 15700 number = "3", 15701 pages = "173--173", 15702 month = mar, 15703 year = "1975", 15704 CODEN = "CACMA2", 15705 ISSN = "0001-0782", 15706 bibdate = "Tue Mar 25 13:26:09 MST 1997", 15707 note = "See also \cite{Brown:1976:RAS}.", 15708 acknowledgement = ack-nhfb, 15709 classcodes = "C7310 (Mathematics computing)", 15710 corpsource = "Computer Sci. Dept., Stanford Univ., Stanford, CA, USA", 15711 keywords = "algorithm SELECT; Hoare's algorithm FIND; mathematics; sampling; subroutines", 15712 treatment = "P Practical", 15713 } 15714 15715 @Article{Erisman:1975:CCE, 15716 author = "A. M. Erisman and W. F. Tinney", 15717 title = "On Computing Certain Elements of the Inverse of a Sparse Matrix", 15718 journal = j-CACM, 15719 volume = "18", 15720 number = "3", 15721 pages = "177--179", 15722 month = mar, 15723 year = "1975", 15724 CODEN = "CACMA2", 15725 ISSN = "0001-0782", 15726 MRclass = "65F05", 15727 MRnumber = "51 14540", 15728 mrreviewer = "L. Hageman", 15729 bibdate = "Tue Mar 25 13:26:09 MST 1997", 15730 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Theory/Matrix.bib", 15731 abstract = "A recursive algorithm for computing the inverse of a matrix from the LU factors based on relationships in Takahashi, et al., is examined. The formulas for the algorithm are given; the dependency relationships are derived; the computational costs are developed; and some general comments on application and stability are made.", 15732 acknowledgement = ack-nhfb, 15733 classcodes = "B0290H (Linear algebra); C4140 (Linear algebra)", 15734 classification = "921", 15735 corpsource = "Boeing Computer Services, Seattle, WA, USA", 15736 journalabr = "Commun ACM", 15737 keywords = "application; computational costs; computing; covar; dependency relationships; elements of inverse; inverse; inverse matrix; mathematical techniques; matrix algebra; nla; recursive algorithm; sensitivities; sparse; sparse matrices; sparse matrix; stability; triangular factorization; tridiagonal matrix", 15738 treatment = "T Theoretical or Mathematical", 15739 } 15740 15741 @Article{Shampine:1975:DLS, 15742 author = "L. F. Shampine", 15743 title = "Discrete Least Squares Polynomial Fits", 15744 journal = j-CACM, 15745 volume = "18", 15746 number = "3", 15747 pages = "179--180", 15748 month = mar, 15749 year = "1975", 15750 CODEN = "CACMA2", 15751 ISSN = "0001-0782", 15752 MRclass = "65D10", 15753 MRnumber = "51 2247", 15754 mrreviewer = "S. F. McCormick", 15755 bibdate = "Tue Mar 25 13:26:09 MST 1997", 15756 bibsource = "Compendex database", 15757 abstract = "The recurrence relation between orthogonal polynomials is widely used for discrete least squares data fitting. A variant of the classical algorithm which has better numerical properties is presented and the reason for its improved performance is explained.", 15758 acknowledgement = ack-nhfb, 15759 classcodes = "B0290F (Interpolation and function approximation); C4130 (Interpolation and function approximation)", 15760 classification = "921", 15761 corpsource = "Sandia Labs., Albuquerque, NM, USA", 15762 journalabr = "Commun ACM", 15763 keywords = "algorithm; data fitting; least squares; least squares approximations; least squares polynomial fits; lud; mathematical techniques; orthogonal polynomials; polynomials; recurrence relation between orthogonal polynomials; residual; scale", 15764 treatment = "T Theoretical or Mathematical", 15765 } 15766 15767 @Article{vanderSluis:1975:CPE, 15768 author = "A. {van der Sluis}", 15769 title = "Corrigendum: {``Perturbations of eigenvalues of non-normal matrices''}", 15770 journal = j-CACM, 15771 volume = "18", 15772 number = "3", 15773 pages = "180", 15774 month = mar, 15775 year = "1975", 15776 CODEN = "CACMA2", 15777 ISSN = "0001-0782", 15778 MRclass = "65F15", 15779 MRnumber = "51 9457b", 15780 mrreviewer = "Jan Zitko", 15781 bibdate = "Tue May 28 16:24:24 1996", 15782 note = "See \cite{vanderSluis:1975:PEN}.", 15783 acknowledgement = ack-nhfb, 15784 } 15785 15786 @Article{Parnas:1975:SCS, 15787 author = "D. L. Parnas", 15788 title = "On a Solution to the Cigarette Smoker's Problem (Without Conditional Statements)", 15789 journal = j-CACM, 15790 volume = "18", 15791 number = "3", 15792 pages = "181--183", 15793 month = mar, 15794 year = "1975", 15795 CODEN = "CACMA2", 15796 ISSN = "0001-0782", 15797 bibdate = "Tue Mar 25 13:26:09 MST 1997", 15798 bibsource = "Compendex database", 15799 abstract = "This report discusses a problem first introduced by Patil, who has claimed that the cigarette smoker's problem cannot be solved using the $P$ and $V$ operations introduced by Dijkstra unless conditional statements are used. An examination of Patil's proof shows that he has established this claim only under strong restrictions on the use of $P$ and $V$. These restrictions eliminate programming techniques used by Dijkstra and others since the first introduction of the semaphore concept. This paper contains a solution to the problem. It also discusses the need for the generalized operators suggested by Patil.", 15800 acknowledgement = ack-nhfb, 15801 classcodes = "C6150J (Operating systems)", 15802 classification = "723", 15803 corpsource = "Tech. Hochschule Darmstadt, Darmstadt, West Germany", 15804 journalabr = "Commun ACM", 15805 keywords = "cigarette smoker's problem; co-operating processes; computer operating systems; conditional statements; generalized; operating systems; operating systems (computers); operators; process synchronization primitives; programming techniques; semaphore concept; synchronisation", 15806 treatment = "T Theoretical or Mathematical", 15807 } 15808 15809 @Article{Chambers:1975:CNH, 15810 author = "Jack A. Chambers and Ray V. Poore", 15811 title = "Computer Networks in Higher Education: Socio-Economic-Political Factors", 15812 journal = j-CACM, 15813 volume = "18", 15814 number = "4", 15815 pages = "193--199", 15816 month = apr, 15817 year = "1975", 15818 CODEN = "CACMA2", 15819 ISSN = "0001-0782", 15820 bibdate = "Tue Mar 25 13:26:09 MST 1997", 15821 bibsource = "Compendex database", 15822 abstract = "This study presents the results of a nationwide survey of computer networks in higher education conducted during 1971-73. Five major and 18 minor networks were identified. The five major networks included: the ARPA Net, the California State College network, the University of Iowa\slash Iowa State University network, the Michigan Educational Research Information Triad, Inc., and the Triangle Universities Computation Center network in North Carolina. In-depth studies were conducted of the latter two nets. Based on the experiences of these operating networks, a number of factors are identified for consideration in developing networks. Finally, recommendations are advanced regarding the development of networks in higher education in the future.", 15823 acknowledgement = ack-nhfb, 15824 classcodes = "C5400 (Analogue and digital computers and systems); C7110 (Educational administration); C7810C (Computer-aided instruction)", 15825 classification = "722; 723; 901", 15826 corpsource = "Univ. of South Florida, Tampa, FL, USA", 15827 journalabr = "Commun ACM", 15828 keywords = "administrative data processing; ARPA; California State; College network; computer aided instruction; computer networking; computer networks; computer systems, digital --- Time Sharing; data processing; educational; higher education; Michigan Education Research Information Triad Inc; nationwide survey; net; network; social economic and political factors; Triangle; Universities Computation Centre network; University of Iowa/Iowa State University", 15829 treatment = "E Economic", 15830 } 15831 15832 @Article{Ginsberg:1975:AAD, 15833 author = "E. S. Ginsberg and D. Zaborowski", 15834 title = "{ACM} Algorithm 490: The Dilogarithm Function of a Real Argument", 15835 journal = j-CACM, 15836 volume = "18", 15837 number = "4", 15838 pages = "200--202", 15839 month = apr, 15840 year = "1975", 15841 CODEN = "CACMA2", 15842 ISSN = "0001-0782", 15843 bibdate = "Tue Mar 25 13:26:09 MST 1997", 15844 note = "See also \cite{Morris:1976:RDF}.", 15845 acknowledgement = ack-nhfb, 15846 classcodes = "B0290D (Functional analysis); C4120 (Functional analysis); C7310 (Mathematics computing)", 15847 corpsource = "Dept. of Phys., Univ. of Massachusetts, Boston, MA, USA", 15848 keywords = "dilogarithm function; electrodynamics; ferromagnets; function evaluation; function subroutine; ideal; library; network analysis; polymers; quantum; real argument; subprograms; subroutines; thermodynamics", 15849 treatment = "A Application; T Theoretical or Mathematical", 15850 } 15851 15852 @Article{Shen:1975:CWB, 15853 author = "K. K. Shen and J. L. Peterson", 15854 title = "Corrigendum: ``{A Weighted Buddy Method for Dynamic Storage Allocation}''", 15855 journal = j-CACM, 15856 volume = "18", 15857 number = "4", 15858 pages = "202--202", 15859 month = apr, 15860 year = "1975", 15861 CODEN = "CACMA2", 15862 ISSN = "0001-0782", 15863 bibdate = "Sat Jan 18 15:14:25 1997", 15864 note = "See \cite{Shen:1974:WBM}.", 15865 } 15866 15867 @Article{Smith:1975:MOL, 15868 author = "Graham Smith", 15869 title = "On Maintenance of the Opportunity List for Class-Teacher Timetable Problems", 15870 journal = j-CACM, 15871 volume = "18", 15872 number = "4", 15873 pages = "203--208", 15874 month = apr, 15875 year = "1975", 15876 CODEN = "CACMA2", 15877 ISSN = "0001-0782", 15878 MRclass = "90B35", 15879 MRnumber = "51 12314", 15880 mrreviewer = "I. Gh. Ciobanu", 15881 bibdate = "Tue Mar 25 13:26:09 MST 1997", 15882 bibsource = "Compendex database", 15883 abstract = "One of the principal components of procedures for the solution of class-teacher timetable problems is that for maintenance of the opportunity list. Opportunity list maintenance methods are based on necessary conditions for the existence of a solution. A general framework for necessary conditions, together with four specific sets of necessary conditions, is given.", 15884 acknowledgement = ack-nhfb, 15885 classcodes = "C7110 (Educational administration)", 15886 classification = "723; 901", 15887 corpsource = "Univ. of New South Wales, Kensington, NSW, Australia", 15888 journalabr = "Commun ACM", 15889 keywords = "class teacher; combinatorial; data processing; educational administrative data processing; necessary conditions; opportunity list; schedule; scheduling; school timetable; timetable; timetable problems", 15890 treatment = "A Application; T Theoretical or Mathematical", 15891 } 15892 15893 @Article{Braid:1975:SSB, 15894 author = "I. C. Braid", 15895 title = "The Synthesis of Solids Bounded by Many Faces", 15896 journal = j-CACM, 15897 volume = "18", 15898 number = "4", 15899 pages = "209--216", 15900 month = apr, 15901 year = "1975", 15902 CODEN = "CACMA2", 15903 ISSN = "0001-0782", 15904 bibdate = "Tue Mar 25 13:26:09 MST 1997", 15905 bibsource = "Compendex database", 15906 abstract = "A technique is presented which allows a class of solid objects to be synthesized and stored using a computer. Synthesis begins with primitive solids like a cube, wedge, or cylinder. Any solid can be moved, scaled, or rotated. Solids may also be added together or subtracted. Two algorithms to perform addition are described. For practical designers, the technique has the advantage that operations are concise, readily composed, and are given in terms of easily imagined solids. Quite short sequences of operations suffice to build up complex solids bounded by many faces.", 15907 acknowledgement = ack-nhfb, 15908 classcodes = "C5540 (Terminals and graphic displays); C6130 (Data handling techniques); C7440 (Civil and mechanical engineering computing)", 15909 classification = "723", 15910 corpsource = "Univ. of Cambridge, Cambridge, UK", 15911 journalabr = "Commun ACM", 15912 keywords = "algorithms; computer graphics; computer-aided design; image processing; many faced solids; simulation; synthesis", 15913 treatment = "A Application; T Theoretical or Mathematical", 15914 } 15915 15916 @Article{Batagelj:1975:QHM, 15917 author = "Vladimir Batagelj", 15918 title = "Quadratic Hash Method When the Table Size is not a Prime Number", 15919 journal = j-CACM, 15920 volume = "18", 15921 number = "4", 15922 pages = "216--217", 15923 month = apr, 15924 year = "1975", 15925 CODEN = "CACMA2", 15926 ISSN = "0001-0782", 15927 bibdate = "Tue Mar 25 13:26:09 MST 1997", 15928 bibsource = "Compendex database", 15929 abstract = "Previous work on quadratic hash methods is limited mainly to the case where the table size is a prime number. Here, certain results are derived for composite numbers. It is shown that all composite numbers containing at least the square of one of the component primes have full-period integer-coefficient quadratic hash functions.", 15930 acknowledgement = ack-nhfb, 15931 classcodes = "B0260 (Optimisation techniques); C1180 (Optimisation techniques); C6130 (Data handling techniques)", 15932 classification = "723", 15933 corpsource = "Jozef Stefan Inst., Univ. of Ljubljana, Ljubljana, Yugoslavia", 15934 journalabr = "Commun ACM", 15935 keywords = "component primes; composite; computer programming; full period integer coefficient; numbers; prime number; quadratic hash functions; quadratic hash method; quadratic programming; table lookup; table size", 15936 treatment = "T Theoretical or Mathematical", 15937 } 15938 15939 @Article{Warren:1975:MWA, 15940 author = "Henry S. {Warren, Jr.}", 15941 title = "A Modification of {Warshall}'s Algorithm for the Transitive Closure of Binary Relations", 15942 journal = j-CACM, 15943 volume = "18", 15944 number = "4", 15945 pages = "218--220", 15946 month = apr, 15947 year = "1975", 15948 CODEN = "CACMA2", 15949 ISSN = "0001-0782", 15950 MRclass = "68A10", 15951 MRnumber = "51 2340", 15952 mrreviewer = "E. M. Reingold", 15953 bibdate = "Tue Mar 25 13:26:09 MST 1997", 15954 bibsource = "Compendex database", 15955 abstract = "An algorithm is given for computing the transitive closure of a binary relation that is represented by a Boolean matrix. The algorithm is similar to Warshall's although it executes faster for sparse matrices on most computers, particularly in a paging environment.", 15956 acknowledgement = ack-nhfb, 15957 classcodes = "B0290H (Linear algebra); C4140 (Linear algebra); C4210 (Formal logic)", 15958 classification = "723", 15959 corpsource = "IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA", 15960 journalabr = "Commun ACM", 15961 keywords = "binary relation; binary relations; Boolean algebra; Boolean matrix; computer programming; digraph; directed graph; matrix algebra; paging environment; reachability matrix; sparse matrices; transitive closure; Warshall's algorithm", 15962 treatment = "T Theoretical or Mathematical", 15963 } 15964 15965 @Article{Hinds:1975:ALA, 15966 author = "James A. Hinds", 15967 title = "Algorithm for Locating Adjacent Storage Blocks in the Buddy System", 15968 journal = j-CACM, 15969 volume = "18", 15970 number = "4", 15971 pages = "221--222", 15972 month = apr, 15973 year = "1975", 15974 CODEN = "CACMA2", 15975 ISSN = "0001-0782", 15976 bibdate = "Tue Mar 25 13:26:09 MST 1997", 15977 bibsource = "Compendex database", 15978 abstract = "A simple scheme for the determination of the location of a block of storage relative to other blocks is described. This scheme is applicable to the buddy type storage allocation systems.", 15979 acknowledgement = ack-nhfb, 15980 classcodes = "C6120 (File organisation)", 15981 classification = "723", 15982 corpsource = "State Univ. of New York, Buffalo, NY, USA", 15983 journalabr = "Commun ACM", 15984 keywords = "algorithm; buddy system; computer programming; locating adjacent storage blocks; storage allocation; storage allocation systems", 15985 treatment = "P Practical", 15986 } 15987 15988 @Article{Vaucher:1975:CSE, 15989 author = "Jean G. Vaucher and Pierre Duval", 15990 title = "A Comparison of Simulation Event List Algorithms", 15991 journal = j-CACM, 15992 volume = "18", 15993 number = "4", 15994 pages = "223--230", 15995 month = apr, 15996 year = "1975", 15997 CODEN = "CACMA2", 15998 ISSN = "0001-0782", 15999 bibdate = "Tue Mar 25 13:26:09 MST 1997", 16000 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1975.bib", 16001 note = "See corrigendum \cite{Vaucher:1975:CCS}.", 16002 abstract = "Four algorithms are considered which can be used to schedule events in a general purpose discrete simulation system. Two of the algorithms are new, one is based on an end-order tree structure for event notices, and another uses an indexed linear list. The algorithms are tested with a set of typical stochastic scheduling distributions especially chosen to show the advantages and limitations of the algorithms. \par The end-order tree algorithm is shown to be an advantageous, immediate replacement for the algorithm in use with current simulation languages. The most promising algorithm uses the indexed list concept. \par It will require an adaptive routine before it can be employed in general purpose simulators,but its performance is such that further study would be fruitful.", 16003 acknowledgement = ack-nhfb, 16004 classcodes = "C6130 (Data handling techniques); C7800 (Other computer applications)", 16005 classification = "723", 16006 corpsource = "Univ. de Montreal, Que., Canada", 16007 country = "USA", 16008 descriptors = "Simulation; event list control; time control;", 16009 enum = "3193", 16010 journalabr = "Commun ACM", 16011 keywords = "adaptive routine; computer programming; current simulation; discrete system simulation; end order tree structure; event list algorithm; event scheduling routine; indexed linear list; languages; scheduling; simulation; simulation event list algorithms; simulation executive; sorting; stochastic scheduling distributions; time flow mechanisms", 16012 language = "English", 16013 references = "0", 16014 treatment = "T Theoretical or Mathematical", 16015 } 16016 16017 @Article{Korfhage:1975:SO, 16018 author = "Robert R. Korfhage and David W. Matula", 16019 title = "On {Salazar} and {Oakford}", 16020 journal = j-CACM, 16021 volume = "18", 16022 number = "4", 16023 pages = "240--240", 16024 month = apr, 16025 year = "1975", 16026 CODEN = "CACMA2", 16027 ISSN = "0001-0782", 16028 bibdate = "Sat Jan 18 15:08:07 1997", 16029 bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Theory/graph.coloring.bib", 16030 note = "See \cite{Salazar:1974:GFS,Korfhage:1975:MSO,Garey:1975:SO}", 16031 keywords = "graph coloring", 16032 } 16033 16034 @Article{Garey:1975:SO, 16035 author = "Michael R. Garey and David S. Johnson", 16036 title = "On {Salazar} and {Oakford}", 16037 journal = j-CACM, 16038 volume = "18", 16039 number = "4", 16040 pages = "240--241", 16041 month = apr, 16042 year = "1975", 16043 CODEN = "CACMA2", 16044 ISSN = "0001-0782", 16045 bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Theory/graph.coloring.bib", 16046 note = "See \cite{Salazar:1974:GFS,Korfhage:1975:SO,Korfhage:1975:MSO}", 16047 keywords = "graph coloring", 16048 } 16049 16050 @Article{Fisher:1975:CCL, 16051 author = "David A. Fisher", 16052 title = "Copying Cyclic List Structures in Linear Time Using Bounded Workspace", 16053 journal = j-CACM, 16054 volume = "18", 16055 number = "5", 16056 pages = "251--252", 16057 month = may, 16058 year = "1975", 16059 CODEN = "CACMA2", 16060 ISSN = "0001-0782", 16061 bibdate = "Tue Mar 25 13:26:09 MST 1997", 16062 bibsource = "Compendex database", 16063 abstract = "A bounded workspace copying algorithm for arbitrary list structures is given. This algorithm operates in linear time and does not require tag bits. The best previous bounded workspace copying algorithms achieved n**2 time without tag bits and n log n time with one tag. The only restriction on the algorithm given here is that the copy must be placed into a contiguous section of memory. The method is applicable to fixed or variable size nodes.", 16064 acknowledgement = ack-nhfb, 16065 classcodes = "C6130 (Data handling techniques)", 16066 classification = "723", 16067 corpsource = "Inst. for Defense Analyses, Arlington, VA, USA", 16068 journalabr = "Commun ACM", 16069 keywords = "bounded workspace; computer programming; computer programming languages --- List Processing; copying algorithm; cyclic list structures; linear time; list processing; nodes; tag bits", 16070 treatment = "P Practical", 16071 } 16072 16073 @Article{Cardenas:1975:API, 16074 author = "Alfonso F. Cardenas", 16075 title = "Analysis and Performance of Inverted Data Base Structures", 16076 journal = j-CACM, 16077 volume = "18", 16078 number = "5", 16079 pages = "253--263", 16080 month = may, 16081 year = "1975", 16082 CODEN = "CACMA2", 16083 ISSN = "0001-0782", 16084 bibdate = "Tue Mar 25 13:26:09 MST 1997", 16085 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib and ftp://ftp.ira.uka.de/pub/bibliography/Database/Graefe.bib", 16086 abstract = "The need to envision and architecture data base systems in a hierarchical level by level framework is stressed. The inverted data base (file) organization is then analyzed, considering implementation oriented aspects. The inverted directory is viewed realistically as another large data base which itself is subjected to inversion. Formulations are derived to estimate average access time (read only) and storage requirements, formalizing the interaction of data base content characteristics, logical complexity of queries, and machine timing and blocking specifications identified as having a first-order effect on performance. The formulations presented are necessary to be used in conjunction with any index selection criteria to determine the optimum set of index keys.", 16087 acknowledgement = ack-nhfb, 16088 classcodes = "C6120 (File organisation); C7100 (Business and administration); C7250 (Information storage and retrieval)", 16089 classification = "723", 16090 corpsource = "IBM Res. Lab., San Jose, CA, USA", 16091 journalabr = "Commun ACM", 16092 keywords = "access; data processing; data structures; file organisation; index keys; index selection criteria; indexing; indices; information retrieval; information retrieval systems; information storage; inverted data base structures; inverted directory; machine timing; management information systems; time", 16093 treatment = "P Practical", 16094 } 16095 16096 @Article{Wilks:1975:IAU, 16097 author = "Yorick Wilks", 16098 title = "An intelligent analyzer and understander of {English}", 16099 journal = j-CACM, 16100 volume = "18", 16101 number = "5", 16102 pages = "264--274", 16103 month = may, 16104 year = "1975", 16105 CODEN = "CACMA2", 16106 ISSN = "0001-0782", 16107 bibdate = "Tue Mar 25 13:26:09 MST 1997", 16108 bibsource = "Compendex database", 16109 abstract = "The paper describes a working analysis and generation program for natural language, which handles paragraph length input. Its core is a system of preferential choice between deep semantic patterns, based on what we call ``semantic density.'' The system is contrasted: (1) with syntax oriented linguistic approaches, and (2) with theorem proving approaches to the understanding problem.", 16110 acknowledgement = ack-nhfb, 16111 classcodes = "C1230 (Artificial intelligence); C4290 (Other computer theory); C7820 (Humanities computing)", 16112 classification = "721; 731", 16113 corpsource = "Stanford Univ., Stanford, CA, USA", 16114 journalabr = "Commun ACM", 16115 keywords = "artificial intelligence; automata theory --- Computational Linguistics; computational linguistics; deep semantic patterns; generation program; intelligent analyzer; language; natural language; paragraph length; semantic density; syntax oriented linguistic approaches; systems science and cybernetics; translation and linguistics", 16116 treatment = "P Practical", 16117 } 16118 16119 @Article{Gibbs:1975:AAB, 16120 author = "N. E. Gibbs", 16121 title = "{ACM} Algorithm 491: Basic Cycle Generation", 16122 journal = j-CACM, 16123 volume = "18", 16124 number = "5", 16125 pages = "275--276 (or 275--275??)", 16126 month = may, 16127 year = "1975", 16128 CODEN = "CACMA2", 16129 ISSN = "0001-0782", 16130 bibdate = "Tue Mar 25 13:26:09 MST 1997", 16131 acknowledgement = ack-nhfb, 16132 classcodes = "B0250 (Combinatorial mathematics); C1160 (Combinatorial mathematics); C7310 (Mathematics computing)", 16133 corpsource = "Dept. of Math., Coll. of William and Mary, Williamsburg, VA, USA", 16134 keywords = "basic; BASIC GENERATOR; cycle generation; finite undirected graph; graph theory; Paton's algorithm; PL/I; subroutines; vertex adjacency matrix", 16135 treatment = "T Theoretical or Mathematical", 16136 } 16137 16138 @Article{Evans:1975:NLF, 16139 author = "D. J. Evans and M. Hatzopoulos", 16140 title = "A note on the {LU} factorization of a symmetric matrix", 16141 journal = j-CACM, 16142 volume = "18", 16143 number = "5", 16144 pages = "278--279", 16145 month = may, 16146 year = "1975", 16147 CODEN = "CACMA2", 16148 ISSN = "0001-0782", 16149 MRclass = "15A21 (65F30)", 16150 MRnumber = "52 8154", 16151 mrreviewer = "Marvin Marcus", 16152 bibdate = "Tue Mar 25 13:26:09 MST 1997", 16153 acknowledgement = ack-nhfb, 16154 classcodes = "B0290H (Linear algebra); C4140 (Linear algebra)", 16155 corpsource = "Univ. of Technol., Loughborough, UK", 16156 keywords = "factorization; matrix inversion; separable systems; symmetric matrices; test matrices", 16157 keywords = "inversion programs; linear equations; LU factorisation; matrix; matrix algebra; symmetric matrix; test matrices", 16158 treatment = "T Theoretical or Mathematical", 16159 } 16160 16161 @Article{Fox:1975:MKS, 16162 author = "B. L. Fox", 16163 title = "More on $k$th Shortest Paths", 16164 journal = j-CACM, 16165 volume = "18", 16166 number = "5", 16167 pages = "279--279", 16168 month = may, 16169 year = "1975", 16170 CODEN = "CACMA2", 16171 ISSN = "0001-0782", 16172 bibdate = "Tue Mar 25 13:26:09 MST 1997", 16173 acknowledgement = ack-nhfb, 16174 classcodes = "B0250 (Combinatorial mathematics); B0260 (Optimisation techniques); C1160 (Combinatorial mathematics); C1180 (Optimisation techniques)", 16175 corpsource = "Univ. of Montreal, Montreal, Que., Canada", 16176 keywords = "graph theory; kth shortest paths; N node network; networks; nodes; optimisation", 16177 treatment = "G General Review", 16178 xxauthor = "B. I. Fox", 16179 } 16180 16181 @Article{Wasserman:1975:PPP, 16182 author = "A. I. Wasserman", 16183 title = "A problem-list of public policy issues concerning computers and health care", 16184 journal = j-CACM, 16185 volume = "18", 16186 number = "5", 16187 pages = "279--280", 16188 month = may, 16189 year = "1975", 16190 CODEN = "CACMA2", 16191 ISSN = "0001-0782", 16192 bibdate = "Tue Mar 25 13:26:09 MST 1997", 16193 acknowledgement = ack-nhfb, 16194 classcodes = "C0200 (General computer topics); C7190 (Other fields of business and administrative computing); C7330 (Biology and medical computing)", 16195 corpsource = "Univ. of California, San Francisco, CA, USA", 16196 keywords = "biomedical applications of computers; computers and health care; economic and; medicine; public policy issues; sociological effects", 16197 treatment = "A Application; E Economic; G General Review", 16198 } 16199 16200 @Article{Mills:1975:CNM, 16201 author = "Harlan D. Mills", 16202 title = "Corrigendum: {``The New Math of Computer Programming''}", 16203 journal = j-CACM, 16204 volume = "18", 16205 number = "5", 16206 pages = "280--280", 16207 month = may, 16208 year = "1975", 16209 CODEN = "CACMA2", 16210 ISSN = "0001-0782", 16211 MRclass = "68A05", 16212 MRnumber = "51 2333b", 16213 mrreviewer = "E. Ikaunieks", 16214 bibdate = "Tue May 28 16:26:36 1996", 16215 note = "See \cite{Mills:1975:NMC}.", 16216 acknowledgement = ack-nhfb, 16217 } 16218 16219 @Article{Horowitz:1975:SAP, 16220 author = "Steven L. Horowitz", 16221 title = "Syntactic Algorithm for Peak Detection in Waveforms with Applications to Cardiography", 16222 journal = j-CACM, 16223 volume = "18", 16224 number = "5", 16225 pages = "281--285", 16226 month = may, 16227 year = "1975", 16228 CODEN = "CACMA2", 16229 ISSN = "0001-0782", 16230 bibdate = "Tue Mar 25 13:26:09 MST 1997", 16231 bibsource = "Compendex database", 16232 abstract = "Peaks in a digitized waveform are detected by an algorithm incorporating piecewise linear approximation and tabular parsing techniques. Several parameters serve to identify the waveform context enabling accurate measurement of peak amplitude, duration, and shape. The algorithm is of sufficient speed to allow on-line real-time processing. An example of its application is demonstrated on an electrocardiogram.", 16233 acknowledgement = ack-nhfb, 16234 classcodes = "A8770E (Patient diagnostic methods and instrumentation); B0290F (Interpolation and function approximation); B7510D (Bioelectric signals); C4130 (Interpolation and function approximation); C4210 (Formal logic); C7330 (Biology and medical computing)", 16235 classification = "723", 16236 corpsource = "Princeton Univ., Princeton, NJ, USA", 16237 journalabr = "Commun ACM", 16238 keywords = "amplitude; applications; biomedical engineering --- Electrocardiography; context-free grammars; duration; electrocardiogram; electrocardiography; parsing techniques; pattern recognition systems; peak detection; piecewise linear approximation; piecewise-linear; shape; syntactic algorithm; tabular; techniques; to cardiography; waveform analysis; waveforms", 16239 treatment = "A Application", 16240 } 16241 16242 @Article{Pfefferkorn:1975:HPS, 16243 author = "Charles E. Pfefferkorn", 16244 title = "Heuristic Problem Solving Design System for Equipment or Furniture Layouts", 16245 journal = j-CACM, 16246 volume = "18", 16247 number = "5", 16248 pages = "286--297", 16249 month = may, 16250 year = "1975", 16251 CODEN = "CACMA2", 16252 ISSN = "0001-0782", 16253 bibdate = "Tue Mar 25 13:26:09 MST 1997", 16254 bibsource = "Compendex database", 16255 abstract = "The Designer Problem Solver (DPS) demonstrates that the computer can perform simple design tasks. In particular, it designs furniture and equipment layouts. This task was chosen because it is simple, well defined, and characteristic of many design tasks in architecture, engineering, urban planning, and natural resource management. These space planning tasks usually involve manipulating two-dimensional representations of objects to create feasible or optimal solutions for problems involving topological and metric spatial constraints. The paper describes extensive tests performed on the program.", 16256 acknowledgement = ack-nhfb, 16257 classcodes = "C1230 (Artificial intelligence); C7800 (Other computer applications)", 16258 classification = "731; 901", 16259 corpsource = "Evans and Sutherland Computer Corp., Sunnyvale, CA, USA", 16260 journalabr = "Commun ACM", 16261 keywords = "architecture; computer graphics; computer-aided design; design; engineering; equipment layout; furniture layouts; heuristic; heuristic problem solving design system; management; metric; natural resource; optimal solutions; problem solver; program; programming; space planning tasks; spatial constraints; systems science and cybernetics --- Heuristic Programming; urban planning", 16262 treatment = "A Application; P Practical", 16263 } 16264 16265 @Article{Korfhage:1975:MSO, 16266 author = "Robert R. Korfhage and David W. Matula", 16267 title = "More on the {Salazar} and {Oakford} Paper", 16268 journal = j-CACM, 16269 volume = "18", 16270 number = "5", 16271 pages = "303--303", 16272 month = may, 16273 year = "1975", 16274 CODEN = "CACMA2", 16275 ISSN = "0001-0782", 16276 bibdate = "Sat Jan 18 15:08:07 1997", 16277 bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Theory/graph.coloring.bib", 16278 note = "See \cite{Salazar:1974:GFS,Korfhage:1975:SO,Garey:1975:SO}", 16279 keywords = "graph coloring", 16280 } 16281 16282 @Article{Gibbs:1975:AAG, 16283 author = "N. E. Gibbs", 16284 title = "{ACM} Algorithm 492: Generation of All the Cycles of a Graph from a Set of Basic Cycles", 16285 journal = j-CACM, 16286 volume = "18", 16287 number = "6", 16288 pages = "310--310", 16289 month = jun, 16290 year = "1975", 16291 CODEN = "CACMA2", 16292 ISSN = "0001-0782", 16293 bibdate = "Tue Mar 25 13:26:09 MST 1997", 16294 acknowledgement = ack-nhfb, 16295 classcodes = "C7310 (Mathematics computing)", 16296 corpsource = "Dept. of Math., Coll. of William and Mary, Williamsburg, VA, USA", 16297 keywords = "basic cycles; cycles; generation; graph; graph theory; PL/I; subroutines", 16298 treatment = "A Application; T Theoretical or Mathematical", 16299 } 16300 16301 @Article{Phong:1975:ICG, 16302 author = "Bui Tuong Phong", 16303 title = "Illumination for Computer Generated Pictures", 16304 journal = j-CACM, 16305 volume = "18", 16306 number = "6", 16307 pages = "311--317", 16308 month = jun, 16309 year = "1975", 16310 CODEN = "CACMA2", 16311 ISSN = "0001-0782", 16312 bibdate = "Tue Mar 25 13:26:09 MST 1997", 16313 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Graphics/imager/imager.75.bib", 16314 abstract = "The quality of computer generated images of three-dimensional scenes depends on the shading technique used to paint the objects on the cathode-ray tube screen. The shading algorithm itself depends in part on the method for modeling the object, which also determines the hidden surface algorithm. The various methods of object modeling, shading, and hidden surface removal are thus strongly interconnected. Several shading techniques corresponding to different methods of object modeling and the related hidden surface algorithms are presented here. Human visual perception and the fundamental laws of optics are considered in the development of a shading rule that provides better quality and increased realism in generated images.", 16315 acknowledgement = ack-nhfb, 16316 classcodes = "C5540 (Terminals and graphic displays)", 16317 classification = "723; 741", 16318 corpsource = "Univ. of Utah, Salt Lake City, UT, USA", 16319 journalabr = "Commun ACM", 16320 keywords = "computer generated images; computer graphics; hidden surface algorithm; image processing; Phong; shading; shading algorithm; technique; three dimensional scenes", 16321 treatment = "P Practical", 16322 } 16323 16324 @Article{Lum:1975:COA, 16325 author = "V. Y. Lum and M. E. Senko and C. P. Wang and H. Ling", 16326 title = "A Cost Oriented Algorithm for Data Set Allocation in Storage Hierarchies", 16327 journal = j-CACM, 16328 volume = "18", 16329 number = "6", 16330 pages = "318--322", 16331 month = jun, 16332 year = "1975", 16333 CODEN = "CACMA2", 16334 ISSN = "0001-0782", 16335 bibdate = "Tue Mar 25 13:26:09 MST 1997", 16336 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib", 16337 abstract = "The trend in computer systems is toward the use of multilevel storage hierarchy systems. In this kind of system, data set allocation is usually based on qualitative, ad hoc decisions. If automatic data migration is used at all, the data sets are allocated to slower level memories simply on the basis of an ad hoc threshold against a time interval since the last use. To achieve quantitative, more optimal allocation, both storage cost and access time cost must be carefully analyzed. This paper presents an appropriate automatic algorithm which includes many significant details of both costs.", 16338 acknowledgement = ack-nhfb, 16339 classcodes = "C6120 (File organisation)", 16340 classification = "723", 16341 corpsource = "IBM Res. Lab., San Jose, CA, USA", 16342 journalabr = "Commun ACM", 16343 keywords = "algorithm; computer operating systems; cost oriented; data migration; data set allocation; data staging; data storage; hierarchies; storage; storage allocation", 16344 treatment = "P Practical", 16345 } 16346 16347 @Article{Babich:1975:SES, 16348 author = "Alan F. Babich and John Grason and David L. Parnas", 16349 title = "Significant Event Simulation", 16350 journal = j-CACM, 16351 volume = "18", 16352 number = "6", 16353 pages = "323--329", 16354 month = jun, 16355 year = "1975", 16356 CODEN = "CACMA2", 16357 ISSN = "0001-0782", 16358 bibdate = "Tue Mar 25 13:26:09 MST 1997", 16359 bibsource = "Compendex database", 16360 abstract = "This paper compares a new method of simulation organization, called the significant event method, with an old one, called the clock pulse method, using as examples two automobile traffic models. The significant event method is found to be more efficient than the clock pulse method at low levels of system interaction and less efficient at high levels. A simple mathematical model for the trade-off in the relative running time of the two methods is developed. The model aids in choosing between the two simulation methods for a particular experiment. It is concluded that the significant event method can be of value in the simulation of some systems when computational efficiency is of sufficient importance.", 16361 acknowledgement = ack-nhfb, 16362 classcodes = "C6110 (Systems analysis and programming); C7800 (Other computer applications)", 16363 classification = "723", 16364 corpsource = "Carnegie-Mellon Univ., Pittsburg, PA, USA", 16365 journalabr = "Commun ACM", 16366 keywords = "clock pulse models; computational efficiency; computer simulation; efficient; significant event method; simulation", 16367 treatment = "P Practical", 16368 } 16369 16370 @Article{Dewar:1975:ITC, 16371 author = "Robert B. K. Dewar", 16372 title = "Indirect Threaded Code", 16373 journal = j-CACM, 16374 volume = "18", 16375 number = "6", 16376 pages = "330--331", 16377 month = jun, 16378 year = "1975", 16379 CODEN = "CACMA2", 16380 ISSN = "0001-0782", 16381 bibdate = "Tue Mar 25 13:26:09 MST 1997", 16382 bibsource = "Compendex database", 16383 abstract = "An efficient arrangement for interpretive code is described. It is related to Bell's notion of threaded code but requires less space and is more amenable to machine independent implementations.", 16384 acknowledgement = ack-nhfb, 16385 classcodes = "C6110 (Systems analysis and programming); C6150C (Compilers, interpreters and other processors)", 16386 classification = "723", 16387 corpsource = "Illinois Inst. of Technol., Chicago, IL, USA", 16388 journalabr = "Commun ACM", 16389 keywords = "code generation; codes, symbolic; implementations; indirect threaded code; interpretive code; interpretors; machine independent; program interpreters; programming; SNOBOL; SNOBOL4; SPITBOL; threaded code", 16390 treatment = "P Practical", 16391 } 16392 16393 @Article{Cranston:1975:SRS, 16394 author = "Ben Cranston and Rick Thomas", 16395 title = "Simplified Recombination Scheme for the {Fibonacci} Buddy System", 16396 journal = j-CACM, 16397 volume = "18", 16398 number = "6", 16399 pages = "331--332", 16400 month = jun, 16401 year = "1975", 16402 CODEN = "CACMA2", 16403 ISSN = "0001-0782", 16404 bibdate = "Tue Mar 25 13:26:09 MST 1997", 16405 bibsource = "Compendex database", 16406 abstract = "A simplified recombination scheme for the Fibonacci buddy system which requires neither tables nor repetitive calculations and uses only two additional bits per buffer is presented.", 16407 acknowledgement = ack-nhfb, 16408 classcodes = "C6120 (File organisation)", 16409 classification = "723", 16410 corpsource = "Univ. of Maryland, College Park, MD, USA", 16411 journalabr = "Commun ACM", 16412 keywords = "computer operating systems; dynamic storage allocation; Fibonacci buddy system; simplified recombination scheme; storage allocation", 16413 treatment = "P Practical", 16414 } 16415 16416 @Article{Aho:1975:ESM, 16417 author = "Alfred V. Aho and Margaret J. Corasick", 16418 title = "Efficient String Matching: an Aid to Bibliographic Search", 16419 journal = j-CACM, 16420 volume = "18", 16421 number = "6", 16422 pages = "333--340", 16423 month = jun, 16424 year = "1975", 16425 CODEN = "CACMA2", 16426 ISSN = "0001-0782", 16427 MRclass = "68A50", 16428 MRnumber = "51 7393", 16429 mrreviewer = "K. H. V. Booth", 16430 bibdate = "Tue Mar 25 13:26:09 MST 1997", 16431 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Misc/protein.pattern.bib; ftp://ftp.ira.uka.de/pub/bibliography/Object/Nierstrasz.bib", 16432 abstract = "This paper describes a simple, efficient algorithm to locate all occurrences of any of a finite number of keywords in a string of text. The algorithm consists of constructing a finite state pattern matching machine from the keywords and then using the pattern matching machine to process the text string in a single pass. Construction of the pattern matching machine takes time proportional to the sum of the lengths of the keywords. The number of state transitions made by the pattern matching machine in processing the text string is independent of the number of keywords. The algorithm has been used to improve the speed of a library bibliographic search program by a factor of 5 to 10.", 16433 acknowledgement = ack-nhfb, 16434 classcodes = "C6120 (File organisation); C7250 (Information storage and retrieval)", 16435 classification = "721; 723", 16436 corpsource = "Bell Labs., Murray Hill, NJ, USA", 16437 journalabr = "Commun ACM", 16438 keywords = "algorithm; automata theory --- Finite Automata; bibliographic search; computational complexity.; efficient; finite state machines; finite state pattern matching; information retrieval; information retrieval systems; keywords; keywords and phrases; patterns UNIX searching; string matching; string pattern matching; text; text editing; text-editing", 16439 treatment = "P Practical", 16440 } 16441 16442 @Article{Hirschberg:1975:LSA, 16443 author = "D. S. Hirschberg", 16444 title = "A Linear Space Algorithm for Computing Maximal Common Subsequences", 16445 journal = j-CACM, 16446 volume = "18", 16447 number = "6", 16448 pages = "341--343", 16449 month = jun, 16450 year = "1975", 16451 CODEN = "CACMA2", 16452 ISSN = "0001-0782", 16453 MRclass = "68A10 (68A20)", 16454 MRnumber = "51 12019", 16455 mrreviewer = "Claude Benzaken", 16456 bibdate = "Tue Mar 25 13:26:09 MST 1997", 16457 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Misc/protein.pattern.bib", 16458 abstract = "The problem of finding a longest common subsequence of two strings has been solved in quadratic time and space. An algorithm is presented which will solve this problem in quadratic time and in linear space.", 16459 acknowledgement = ack-nhfb, 16460 classcodes = "C6130 (Data handling techniques)", 16461 classification = "723", 16462 comment = "Algorithms are given that solve the longest common subsequence problem in quadratic time and linear space. Previously algorithms for this problem used quadratic time and quadratic space.", 16463 corpsource = "Princeton Univ., Princeton, NY, USA", 16464 journalabr = "Commun ACM", 16465 keywords = "computer programming; computing; data handling; editing; linear space; linear space algorithm; longest common subsequence; maximal common; quadratic time; string correction; subsequence; subsequences; two strings", 16466 treatment = "A Application; T Theoretical or Mathematical", 16467 } 16468 16469 @Article{Soule:1975:AAB, 16470 author = "Stephen Soule", 16471 title = "Addition in an Arbitrary Base Without Radix Conversion", 16472 journal = j-CACM, 16473 volume = "18", 16474 number = "6", 16475 pages = "344--346", 16476 month = jun, 16477 year = "1975", 16478 CODEN = "CACMA2", 16479 ISSN = "0001-0782", 16480 bibdate = "Tue Mar 25 13:26:09 MST 1997", 16481 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Theory/Seiferas/1975.bib", 16482 abstract = "This paper presents a generalization of an old programming technique; using it, one may add and subtract numbers represented in any radix, including a mixed radix, and stored one digit per byte in bytes of sufficient size. Radix conversion is unnecessary, no looping is required, and numbers may even be stored in a display (I/O) format. Applications to Cobol, MIX, and hexadecimal sums are discussed.", 16483 acknowledgement = ack-nhfb, 16484 classcodes = "C5230 (Digital arithmetic methods); C6130 (Data handling techniques)", 16485 classification = "723; 921", 16486 corpsource = "Univ. of Calgary, Calgary, Alta., Canada", 16487 journalabr = "Commun ACM", 16488 keywords = "add; addition; arbitrary base; arbitrary radix arithmetic; Cobol display arithmetic; computer systems programming; data handling; decimal arithmetic; digital arithmetic; mathematical techniques --- Digital Arithmetic; MIX arithmetic; mixed radix arithmetic; numbers; programming; radix conversion; subtract; subtraction; without radix conversion", 16489 treatment = "A Application; T Theoretical or Mathematical", 16490 } 16491 16492 @Article{Harper:1975:S, 16493 author = "L. H. Harper and T. H. Payne and J. E. Savage and E. Straus", 16494 title = "Sorting {$X + Y$}", 16495 journal = j-CACM, 16496 volume = "18", 16497 number = "6", 16498 pages = "347--350 (or 347--349??)", 16499 month = jun, 16500 year = "1975", 16501 CODEN = "CACMA2", 16502 ISSN = "0001-0782", 16503 MRclass = "68A20", 16504 MRnumber = "51 14641", 16505 mrreviewer = "Forbes D. Lewis", 16506 bibdate = "Tue Mar 25 13:26:09 MST 1997", 16507 bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Theory/Seiferas/1975.bib", 16508 acknowledgement = ack-nhfb, 16509 classcodes = "C4240 (Programming and algorithm theory); C6130 (Data handling techniques)", 16510 corpsource = "MIT, Dept. of Math., Cambridge, MA, USA", 16511 keywords = "binary comparisons; computational complexity; computing models; data modeling; merge sorting", 16512 keywords = "computation time; computational complexity; merge sorting; merging; sets of numbers; sorting", 16513 treatment = "T Theoretical or Mathematical", 16514 } 16515 16516 @Article{Wyman:1975:IES, 16517 author = "F. Paul Wyman", 16518 title = "Improved Event-Scanning Mechanisms for Discrete Event Simulation", 16519 journal = j-CACM, 16520 volume = "18", 16521 number = "6", 16522 pages = "350--353", 16523 month = jun, 16524 year = "1975", 16525 CODEN = "CACMA2", 16526 ISSN = "0001-0782", 16527 bibdate = "Tue Mar 25 13:26:09 MST 1997", 16528 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1975.bib", 16529 abstract = "Simulation models of large, complex ``real-world'' applications have occasionally earned the reputation of eating up hours of computer time. This problem may be attributed in part to difficulties such as slow stochastic convergence. However, an additional problem lies in the fact that a significant amount of bookkeeping time is required to keep future events in their proper sequence. This paper presents a method for significantly reducing the time spent scanning future event lists in discrete event simulations. \par There models are presented, all of which improve in effectiveness as the events-list scan problem becomes more burdensome.", 16530 acknowledgement = ack-nhfb, 16531 classcodes = "C7800 (Other computer applications)", 16532 classification = "723", 16533 corpsource = "Bechtel Inc., San Francisco, CA, USA", 16534 country = "USA", 16535 descriptors = "Simulation; time control;", 16536 enum = "3352", 16537 journalabr = "Commun ACM", 16538 keywords = "computer simulation; discrete event simulation; event scanning mechanisms; simulation", 16539 keywords = "bookkeeping time; discrete event simulation; scanning; simulation", 16540 language = "English", 16541 references = "0", 16542 treatment = "P Practical", 16543 } 16544 16545 @Article{Knuth:1975:ICU, 16546 author = "Donald E. Knuth and Charles T. {Zahn, Jr.}", 16547 title = "Ill-Chosen Use of ``Event''", 16548 journal = j-CACM, 16549 volume = "18", 16550 number = "6", 16551 pages = "360--360", 16552 month = jun, 16553 year = "1975", 16554 CODEN = "CACMA2", 16555 ISSN = "0001-0782", 16556 bibdate = "Tue Sep 20 23:34:24 1994", 16557 acknowledgement = ack-nhfb, 16558 } 16559 16560 @Article{Courtois:1975:DIS, 16561 author = "P. J. Courtois", 16562 title = "Decomposability, Instabilities, and Saturation in Multiprogramming Systems", 16563 journal = j-CACM, 16564 volume = "18", 16565 number = "7", 16566 pages = "371--377", 16567 month = jul, 16568 year = "1975", 16569 CODEN = "CACMA2", 16570 ISSN = "0001-0782", 16571 bibdate = "Tue Mar 25 13:26:09 MST 1997", 16572 bibsource = "Compendex database", 16573 abstract = "A step-by-step approach to model the dynamic behavior and evaluate the performance of computing systems is proposed. It is based on a technique of variable aggregation and the concept of nearly decomposable systems, both borrowed from Econometrics. This approach is taken in order to identify in multiprogramming paging systems (i) unstable regimes of operations and (ii) critical computing loads which bring the system into states of saturation. This analysis leads to a more complete definition of the circumstances in which ``thrashing'' can set in.", 16574 acknowledgement = ack-nhfb, 16575 classcodes = "C6120 (File organisation); C6150J (Operating systems)", 16576 classification = "723", 16577 corpsource = "MBLE Res. Lab., Brussels, Belgium", 16578 journalabr = "Commun ACM", 16579 keywords = "computer selection and evaluation; computer systems programming; computing systems; decomposable; instabilities; multiprogramming; multiprogramming systems; performance; saturation; storage; virtual", 16580 treatment = "T Theoretical or Mathematical", 16581 } 16582 16583 @Article{Lauesen:1975:LSB, 16584 author = "Soren Lauesen", 16585 title = "A large semaphore based operating system", 16586 journal = j-CACM, 16587 volume = "18", 16588 number = "7", 16589 pages = "377--389", 16590 month = jul, 16591 year = "1975", 16592 CODEN = "CACMA2", 16593 ISSN = "0001-0782", 16594 bibdate = "Tue Mar 25 13:26:09 MST 1997", 16595 bibsource = "Compendex database", 16596 abstract = "The paper describes the internal structure of a large operating system as a set of cooperating sequential processes. The processes synchronize by means of semaphores and extended semaphores (queue semaphores). The number of parallel processes is carefully justified, and the various semaphore constructions are explained. The system is proved to be free of ``deadly embrace'' (deadlock). The design principle is an alternative to Dijkstra's hierarchical structuring of operating systems. The project management and the performance are discussed, too. The operating system is the first large one using the RC 4000 multiprogramming system.", 16597 acknowledgement = ack-nhfb, 16598 classcodes = "C6150J (Operating systems)", 16599 classification = "723", 16600 corpsource = "Nordisk Brown Boveri, Copenhagen, Denmark", 16601 journalabr = "Commun ACM", 16602 keywords = "computer operating systems; large; multiprogramming system; operating system; operating systems (computers); parallel; parallel processing; processes; RC 4000; semaphore based", 16603 treatment = "P Practical", 16604 } 16605 16606 @Article{Sager:1975:RLC, 16607 author = "Naomi Sager and Ralph Grishman", 16608 title = "Restriction Language for Computer Grammars of Natural Language", 16609 journal = j-CACM, 16610 volume = "18", 16611 number = "7", 16612 pages = "390--400", 16613 month = jul, 16614 year = "1975", 16615 CODEN = "CACMA2", 16616 ISSN = "0001-0782", 16617 bibdate = "Tue Mar 25 13:26:09 MST 1997", 16618 bibsource = "Compendex database", 16619 abstract = "This paper presents a programming language designed specifically for the compact and perspicuous statement of restrictions of a natural language grammar. It is based on ten years' experience parsing text sentences with the comprehensive English grammar of the N. Y. U. Linguistic String Project, and embodies in its syntax and routines the relations which were found to be useful and adequate for computerized natural language analysis. The language is used in the current implementation of the Linguistic String Parser.", 16620 acknowledgement = ack-nhfb, 16621 classcodes = "C4210 (Formal logic); C6130 (Data handling techniques); C6140D (High level languages); C7820 (Humanities computing)", 16622 classification = "721; 723", 16623 corpsource = "New York Univ., New York, NY, USA", 16624 journalabr = "Commun ACM", 16625 keywords = "automata theory; computational linguistics; computer grammars; computer programming languages; grammars; literature; natural language; oriented languages; parsing; problem; programming language; Restriction Language; text; text editing", 16626 treatment = "A Application; P Practical", 16627 } 16628 16629 @Article{Parnas:1975:UCT, 16630 author = "D. L. Parnas and D. P. Siewiorek", 16631 title = "Use of the Concept of Transparency in the Design of Hierarchically Structured Systems", 16632 journal = j-CACM, 16633 volume = "18", 16634 number = "7", 16635 pages = "401--408", 16636 month = jul, 16637 year = "1975", 16638 CODEN = "CACMA2", 16639 ISSN = "0001-0782", 16640 bibdate = "Tue Mar 25 13:26:09 MST 1997", 16641 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Misc/softeng.bib", 16642 abstract = "This paper deals with the design of hierarchically structured programming systems. It develops a method for evaluating the cost of requiring programmers to work with an abstraction of a real machine. A number of examples from hardware and software are given as illustrations of the method.", 16643 acknowledgement = ack-nhfb, 16644 classcodes = "C6110 (Systems analysis and programming)", 16645 classification = "723", 16646 corpsource = "Tech. Hochschule Darmstadt, Darmstadt, West Germany", 16647 journalabr = "Commun ACM", 16648 keywords = "abstraction; computer systems programming; cost; design; hierarchically structured systems; programming; real machine; transparency", 16649 treatment = "A Application; T Theoretical or Mathematical", 16650 } 16651 16652 @Article{Freeman:1975:DMA, 16653 author = "H. Freeman and R. Shapira", 16654 title = "Determining the Minimum-Area Encasing Rectangle for an Arbitrary Closed Curve", 16655 journal = j-CACM, 16656 volume = "18", 16657 number = "7", 16658 pages = "409--413", 16659 month = jul, 16660 year = "1975", 16661 CODEN = "CACMA2", 16662 ISSN = "0001-0782", 16663 MRclass = "68A10 (52A40)", 16664 MRnumber = "51 12018", 16665 mrreviewer = "Jacques Dubois", 16666 bibdate = "Tue Mar 25 13:26:09 MST 1997", 16667 bibsource = "Compendex database", 16668 abstract = "This paper describes a method for finding the rectangle of minimum area in which a given arbitrary plane curve can be contained. The method is of interest in certain packing and optimum layout problems. It consists of first determining the minimal-perimeter convex polygon that encloses the given curve and then selecting the rectangle of minimum area capable of containing this polygon. Three theorems are introduced to show that one side of the minimum-area rectangle must be colinear with an edge of the enclosed polygon and that the minimum-area encasing rectangle for the convex polygon is also the minimum-area rectangle for the curve.", 16669 acknowledgement = ack-nhfb, 16670 classcodes = "B0260 (Optimisation techniques); C1180 (Optimisation techniques)", 16671 classification = "921; 922", 16672 corpsource = "New York Univ., New York, NY, USA", 16673 journalabr = "Commun ACM", 16674 keywords = "enclosed curve; minimum-area encasing rectangle; optimization; optimum layout; optimum packing", 16675 keywords = "arbitrary closed curve; encasing rectangle; minimisation; minimum area; optimum layout; packing", 16676 treatment = "T Theoretical or Mathematical", 16677 } 16678 16679 @Article{Bobrow:1975:NHL, 16680 author = "Daniel G. Bobrow", 16681 title = "A Note on Hash Linking", 16682 journal = j-CACM, 16683 volume = "18", 16684 number = "7", 16685 pages = "413--415", 16686 month = jul, 16687 year = "1975", 16688 CODEN = "CACMA2", 16689 ISSN = "0001-0782", 16690 bibdate = "Tue Mar 25 13:26:09 MST 1997", 16691 bibsource = "Compendex database", 16692 abstract = "Hash searching is a technique in which a key is mapped into a unique address associated with that key. Most applications of this technique are for insertion and fast retrieval of data records containing key fields. In the use of hash search described in this paper, the key field is the virtual address of a machine cell with which additional information is associated. An address to auxiliary data not contained in that cell is called hash linking. (A hash link function is one which maps any machine virtual address into another unique address where additional information can be stored. ) This note describes several nonobvious applications of this technique.", 16693 acknowledgement = ack-nhfb, 16694 classcodes = "C6120 (File organisation)", 16695 classification = "723; 901", 16696 corpsource = "Xerox Palo Alto Res. Center, Palo Alto, CA, USA", 16697 journalabr = "Commun ACM", 16698 keywords = "computer programming; hash linking; information retrieval systems; LISP; locations; machine address; storage; storage allocation", 16699 treatment = "P Practical", 16700 } 16701 16702 @Article{Weber:1975:DEW, 16703 author = "R. E. Weber and B. Gilchrist", 16704 title = "Discrimination in the employment of women in the computer industry", 16705 journal = j-CACM, 16706 volume = "18", 16707 number = "7", 16708 pages = "416--418", 16709 month = jul, 16710 year = "1975", 16711 CODEN = "CACMA2", 16712 ISSN = "0001-0782", 16713 bibdate = "Tue Mar 25 13:26:09 MST 1997", 16714 acknowledgement = ack-nhfb, 16715 classcodes = "C0200 (General computer topics)", 16716 corpsource = "Rutgers Univ., New Brunswick, NJ, USA", 16717 keywords = "computer industry; discrimination; employment; women", 16718 treatment = "G General Review", 16719 } 16720 16721 @Article{Shore:1975:ESF, 16722 author = "John E. Shore", 16723 title = "On the External Storage Fragmentation Produced by First-Fit and Best-Fit Allocation Strategies", 16724 journal = j-CACM, 16725 volume = "18", 16726 number = "8", 16727 pages = "433--440", 16728 month = aug, 16729 year = "1975", 16730 CODEN = "CACMA2", 16731 ISSN = "0001-0782", 16732 bibdate = "Tue Mar 25 13:26:09 MST 1997", 16733 bibsource = "Compendex database", 16734 abstract = "Report on some experiments whose results have helped to understand differences in the performance of two well-known storage-allocation strategies, first-fit and best-fit. For exponential and hyperexponential distributions of requests, first-fit outperformed best-fit; but for normal and uniform distributions, and for exponential distributions distorted in various ways, best-fit outperformed first-fit. It is hypothesized that when first-fit outperforms best-fit, it does so because first-fit, by preferentially allocating toward one end of memory, encourages large blocks to grow at the other end. Sufficient contiguous space is thereby more likely to be available for relatively large requests. Results of simulation experiments supported this hypothesis and showed that the relative performance of first-fit and best-fit depends on the frequency of requests that are large compared to the average request. when the coefficient of variation of the request distribution is greater than or approximately equal to unity, first-fit outperformed best-fit.", 16735 acknowledgement = ack-nhfb, 16736 classcodes = "C6120 (File organisation); C6150J (Operating systems)", 16737 classification = "722; 723", 16738 corpsource = "Naval Res. Lab., Washington, DC, USA", 16739 journalabr = "Commun ACM", 16740 keywords = "allocation strategies; best fit; computer operating systems; dynamic memory allocation; encountered block; external storage fragmentation; first fit; pending storage; starting addresses; storage allocation", 16741 treatment = "P Practical", 16742 } 16743 16744 @Article{Aho:1975:DPA, 16745 author = "A. V. Aho and S. C. Johnson and J. D. Ullman", 16746 title = "Deterministic Parsing of Ambiguous Grammars", 16747 journal = j-CACM, 16748 volume = "18", 16749 number = "8", 16750 pages = "441--452", 16751 month = aug, 16752 year = "1975", 16753 CODEN = "CACMA2", 16754 ISSN = "0001-0782", 16755 MRclass = "68A25", 16756 MRnumber = "51 12033", 16757 mrreviewer = "S. Ginsburg", 16758 bibdate = "Tue Mar 25 13:26:09 MST 1997", 16759 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Compiler/Compiler.Lins.bib", 16760 abstract = "Methods of describing the syntax of programming languages in ways that are more flexible and natural than conventional BNF descriptions are considered. These methods involve the use of ambiguous context-free grammars together with rules to resolve syntactic ambiguities. It is shown how efficient LR and LL parsers can be constructed directly from certain classes of these specifications.", 16761 acknowledgement = ack-nhfb, 16762 classcodes = "C4210 (Formal logic)", 16763 classification = "723", 16764 corpsource = "Bell Labs., Murray Hill, NJ, USA", 16765 journalabr = "Commun ACM", 16766 keywords = "ambiguities; ambiguous grammars; computer programming languages; context free grammars; context-free grammars; LL parsers; LR parsing; parser generation; programming languages; syntactic; translator writing systems", 16767 treatment = "T Theoretical or Mathematical", 16768 } 16769 16770 @Article{Dijkstra:1975:GCN, 16771 author = "Edsger W. Dijkstra", 16772 title = "Guarded Commands, Nondeterminacy and Formal Derivation of Programs", 16773 journal = j-CACM, 16774 volume = "18", 16775 number = "8", 16776 pages = "453--457", 16777 month = aug, 16778 year = "1975", 16779 CODEN = "CACMA2", 16780 ISSN = "0001-0782", 16781 MRclass = "68A05", 16782 MRnumber = "52 4688", 16783 mrreviewer = "John Kam", 16784 bibdate = "Tue Mar 25 13:26:09 MST 1997", 16785 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Parallel/par.synch.bib", 16786 abstract = "So-called ``guarded commands'' are introduced as a building block for alternative and repetitive constructs that allow nondeterministic program components for which at least the activity evoked, but possibly even the final state, is not necessarily uniquely determined by the initial state. For the formal derivation of programs expressed in terms of these constructs, a calculus is shown.", 16787 acknowledgement = ack-nhfb, 16788 annote = "Yet another ancient paper which is occasionally cited", 16789 classcodes = "C4210 (Formal logic)", 16790 classification = "723", 16791 corpsource = "Burroughs Corp., Nuenen, Netherlands", 16792 journalabr = "Commun ACM", 16793 keywords = "calculus; computer programming languages; constructs; correctness proof; derivation; guarded commands; k-guarded-commands; nondeterministic program components; programming language semantics; programming languages; programming methodology; sequencing primitives", 16794 treatment = "A Application; P Practical", 16795 } 16796 16797 @Article{Cotton:1975:RSU, 16798 author = "L. W. Cotton", 16799 title = "Remark on stably updating mean and standard deviation of data", 16800 journal = j-CACM, 16801 volume = "18", 16802 number = "8", 16803 pages = "458--458", 16804 month = aug, 16805 year = "1975", 16806 CODEN = "CACMA2", 16807 ISSN = "0001-0782", 16808 bibdate = "Tue Mar 25 13:26:09 MST 1997", 16809 bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Theory/Matrix.bib and ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD.bib", 16810 acknowledgement = ack-nhfb, 16811 classcodes = "B0290F (Interpolation and function approximation); C4130 (Interpolation and function approximation); C7310 (Mathematics computing)", 16812 corpsource = "Nat. Bur. of Stand., Washington, DC, USA", 16813 country = "USA", 16814 descriptors = "Simulation; statistics; numeric calculation;", 16815 enum = "7158", 16816 keywords = "algorithm; Hanson's article; new; numbers; numerical methods; remark; sequentially recomputing; series; stably updating mean; standard deviation of data; statistics", 16817 kwds = "stat, updating, mean, standard deviation, variance", 16818 language = "English", 16819 location = "SEL: Wi", 16820 references = "0", 16821 revision = "16/01/94", 16822 treatment = "A Application; G General Review", 16823 xxauthor = "I. W. Cotton", 16824 } 16825 16826 @Article{Shapiro:1975:ICN, 16827 author = "Stuart C. Shapiro and Stanley C. Kwasny", 16828 title = "Interactive Consulting via Natural Language", 16829 journal = j-CACM, 16830 volume = "18", 16831 number = "8", 16832 pages = "459--462", 16833 month = aug, 16834 year = "1975", 16835 CODEN = "CACMA2", 16836 ISSN = "0001-0782", 16837 bibdate = "Tue Mar 25 13:26:09 MST 1997", 16838 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Ai/expert.bib", 16839 abstract = "Interactive programming systems often contain help commands to give the programmer on-line instruction regarding the use of the various systems commands. It is argued that it would be relatively easy to make these help commands significantly more helpful by having them accept requests in natural language. As a demonstration, Weizenbaum's ELIZA program has been provided with a script that turns it into a natural language system consultant.", 16840 acknowledgement = ack-nhfb, 16841 annote = "Help commands are significantly more useful in an interactive environment if they accept commands in a natural language. As a demonstration, Weizenbaum's ELIZA program has been provided with a script that turns into a natural language system consultant.", 16842 classcodes = "C6110 (Systems analysis and programming); C6140 (Programming languages); C6150J (Operating systems)", 16843 classification = "723", 16844 corpsource = "Indiana Univ., Bloomington, IN, USA", 16845 journalabr = "Commun ACM", 16846 keywords = "computer aided instruction; computer assisted instruction; computer programming languages; ELIZA; help commands; instruction; interactive programming; natural language; natural language processing; natural language system consultant; on line; program; programming languages; sharing programs; systems commands; time sharing systems; time-; time-sharing systems", 16847 treatment = "T Theoretical or Mathematical", 16848 } 16849 16850 @Article{Todd:1975:CLC, 16851 author = "John Todd", 16852 title = "Corrigendum: {``The Lemniscate Constants''}", 16853 journal = j-CACM, 16854 volume = "18", 16855 number = "8", 16856 pages = "462--462", 16857 month = aug, 16858 year = "1975", 16859 CODEN = "CACMA2", 16860 ISSN = "0001-0782", 16861 bibdate = "Tue Dec 26 18:42:09 1995", 16862 note = "See \cite{Todd:1975:LC}.", 16863 } 16864 16865 @Article{Vaucher:1975:CCS, 16866 author = "J. G. Vaucher and P. Duval", 16867 title = "Corrigendum: ``{A comparison of simulation event list algorithms}''", 16868 journal = j-CACM, 16869 volume = "18", 16870 number = "8", 16871 pages = "462--462", 16872 month = aug, 16873 year = "1975", 16874 CODEN = "CACMA2", 16875 ISSN = "0001-0782", 16876 bibdate = "Sat Jan 18 15:17:34 1997", 16877 note = "See \cite{Vaucher:1975:CSE}.", 16878 } 16879 16880 @Article{Smith:1975:CPT, 16881 author = "A. J. Smith", 16882 title = "Comments on a paper by {T. C. Chen} and {I. T. Ho}", 16883 journal = j-CACM, 16884 volume = "18", 16885 number = "8", 16886 pages = "463--463", 16887 month = aug, 16888 year = "1975", 16889 CODEN = "CACMA2", 16890 ISSN = "0001-0782", 16891 bibdate = "Tue Mar 25 13:26:09 MST 1997", 16892 acknowledgement = ack-nhfb, 16893 classcodes = "C6130 (Data handling techniques)", 16894 corpsource = "Univ. of California, Berkeley, CA, USA", 16895 keywords = "advantages; alternatives; binary coded decimal; codes; coding; compression of numbers; data handling; decimal data; decoding; deletions; Huffman codes; insertions; permutations; storage efficient representation; variable length codes", 16896 treatment = "G General Review; T Theoretical or Mathematical", 16897 } 16898 16899 @Article{Ghosh:1975:CSR, 16900 author = "Sakti P. Ghosh", 16901 title = "Consecutive Storage of Relevant Records with Redundancy", 16902 journal = j-CACM, 16903 volume = "18", 16904 number = "8", 16905 pages = "464--471", 16906 month = aug, 16907 year = "1975", 16908 CODEN = "CACMA2", 16909 ISSN = "0001-0782", 16910 MRclass = "68A50", 16911 MRnumber = "52 4743", 16912 mrreviewer = "K. H. V. Booth", 16913 bibdate = "Tue Mar 25 13:26:09 MST 1997", 16914 bibsource = "Compendex database", 16915 abstract = "This paper studies the properties of a new class of file organizations (CRWR) where records relevant to every query are stored in consecutive storage locations but the organizations contain redundancy. Some theorems which provide tools for reducing redundancy in CRWR organizations have been also developed. Redundancies obtained by the application of these theorems are compared with that of query-inverted file organizations. Some CRWR organizations with minimum redundancy have also been developed for queries which specify sets of keys.", 16916 acknowledgement = ack-nhfb, 16917 classcodes = "C6120 (File organisation)", 16918 classification = "723", 16919 corpsource = "IBM Res. Lab., San Jose, CA, USA", 16920 journalabr = "Commun ACM", 16921 keywords = "consecutive storage; data processing; file organisation; file organizations; keys; query; records; redundancy; retrieval", 16922 treatment = "N New Development; T Theoretical or Mathematical", 16923 } 16924 16925 @Article{Lamport:1975:MBP, 16926 author = "Leslie Lamport", 16927 title = "Multiple Byte Processing with Full-Word Instructions", 16928 journal = j-CACM, 16929 volume = "18", 16930 number = "8", 16931 pages = "471--475", 16932 month = aug, 16933 year = "1975", 16934 CODEN = "CACMA2", 16935 ISSN = "0001-0782", 16936 bibdate = "Tue Mar 25 13:26:09 MST 1997", 16937 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Theory/Seiferas/1975.bib", 16938 abstract = "A method is described which allows parallel processing of packed data items using only ordinary full-word computer instructions, even though the processing requires operations whose execution is contingent upon the value of a datum. It provides a useful technique for processing small data items such as alphanumeric characters.", 16939 acknowledgement = ack-nhfb, 16940 classcodes = "C6110 (Systems analysis and programming)", 16941 classification = "723", 16942 corpsource = "Massachusetts Computer Associates, Inc., Wakefield, MA, USA", 16943 journalabr = "Commun ACM", 16944 keywords = "alphanumeric characters; byte processing; character processing; data processing; datum; full-word instructions; packed data; parallel; parallel processing; processing; programming", 16945 treatment = "P Practical", 16946 } 16947 16948 @Article{Shwayder:1975:CDR, 16949 author = "Keith Shwayder", 16950 title = "Combining Decision Rules in a Decision Table", 16951 journal = j-CACM, 16952 volume = "18", 16953 number = "8", 16954 pages = "476--480", 16955 month = aug, 16956 year = "1975", 16957 CODEN = "CACMA2", 16958 ISSN = "0001-0782", 16959 bibdate = "Tue Mar 25 13:26:09 MST 1997", 16960 bibsource = "Compendex database", 16961 abstract = "The techniques for minimizing logic circuits are applied to the simplification of decision tables by the combining of decision rules. This method is logically equivalent to the Quine-McCluskey method for finding prime implicants. If some of the decision rules implied in the ELSE Rule occur with low frequency, then the ELSE Rule can be used to further simplify the decision table. Several objectives merit consideration in optimizing a decision table. (1) reducing machine execution time; (2) reducing preprocessing time; (3) reducing required machine memory; (4) reducing the number of decision rules. Objectives (3) and (4) can be furthered with the above methods. Objective (1) is also attained if overspecified decision rules are not combined. Objective (2) must be compared against the potential benefits of objectives (1), (3), and (4) in deciding whether to use the above methods.", 16962 acknowledgement = ack-nhfb, 16963 classcodes = "C6110 (Systems analysis and programming)", 16964 classification = "723", 16965 corpsource = "Samsonite Corp., Furniture Div., Denver, CO, USA", 16966 journalabr = "Commun ACM", 16967 keywords = "Boolean method; coding; computer systems programming; decision rules; decision table; decision tables; flowcharting; minimisation; minimizing logic circuits; prime implicants; Quine McCluskey method; sorting", 16968 treatment = "T Theoretical or Mathematical", 16969 } 16970 16971 @Article{Steele:1975:MCG, 16972 author = "Guy L. {Steele, Jr.}", 16973 title = "Multiprocessing Compactifying Garbage Collection", 16974 journal = j-CACM, 16975 volume = "18", 16976 number = "9", 16977 pages = "495--508", 16978 month = sep, 16979 year = "1975", 16980 CODEN = "CACMA2", 16981 ISSN = "0001-0782", 16982 bibdate = "Tue Mar 25 13:26:09 MST 1997", 16983 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Compiler/garbage.collection.bib", 16984 note = "See corrigendum \cite{Steele:1976:CMC}.", 16985 abstract = "Algorithms for a multiprocessing compactifying garbage collector are presented and discussed. \par The simple case of two processors, one performing LISP-like list operations and the other performing garbage collection continuously, is thoroughly examined. The necessary capabilities of each processor are defined, as well as interprocessor communication and interlocks. Complete procedures for garbage collection and for standard list processing primitives are presented and thoroughly explained. Particular attention is given to the problems of marking and relocating list cells while another processor may be operating on them. The primary aim throughout is to allow the list processor to run unimpeded while the other processor reclaims list storage. The more complex cases involving several list processors and one or more garbage collection processors are also briefly discussed.", 16986 acknowledgement = ack-nhfb, 16987 classcodes = "C6120 (File organisation); C6150J (Operating systems)", 16988 classification = "723", 16989 corpsource = "Harvard Univ., Cambridge, MA, USA", 16990 journalabr = "Commun ACM", 16991 keywords = "capabilities; compactification; computer systems programming; data structures; free storage; garbage collection; gc processor; interlocks; interprocessor communication; LISP; list; list processing; list storage; management; multiprocessing; multiprocessing compactifying garbage collector; multiprocessing programs; operations; parallel processing; pointers; reclaimer; relocation; semaphores; storage; storage allocation; storage reclamation; synchronization", 16992 treatment = "P Practical", 16993 } 16994 16995 @Article{Bentley:1975:MBS, 16996 author = "Jon Louis Bentley", 16997 title = "Multidimensional Binary Search Trees Used for Associative Searching", 16998 journal = j-CACM, 16999 volume = "18", 17000 number = "9", 17001 pages = "509--517", 17002 month = sep, 17003 year = "1975", 17004 CODEN = "CACMA2", 17005 ISSN = "0001-0782", 17006 bibdate = "Tue Mar 25 13:26:09 MST 1997", 17007 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Database/database.bib and ftp://ftp.ira.uka.de/pub/bibliography/Database/Graefe.bib", 17008 abstract = "This paper develops the multidimensional binary search tree (or k-d tree, where k is the dimensionality of the search space) as a data structure for storage of information to be retrieved by associative searches. The k-d tree is defined and examples are given. It is shown to be quite efficient in its storage requirements. A significant advantage of this structure is that a single data structure can handle many types of queries very efficiently. Various utility algorithms are developed.", 17009 acknowledgement = ack-nhfb, 17010 classcodes = "C6120 (File organisation); C7250 (Information storage and retrieval)", 17011 classification = "723; 901", 17012 corpsource = "Stanford Univ., Stanford, CA, USA", 17013 journalabr = "Commun ACM", 17014 keywords = "algorithm; content-addressable storage; data structures; efficient; homogeneous splitting; information; information retrieval; information retrieval systems; intersection query; K-D trees; multidimensional binary search tree; partial match; queries; retrieval; running times; single data; structure; trees (mathematics); utility algorithms", 17015 treatment = "T Theoretical or Mathematical", 17016 } 17017 17018 @Article{Claudson:1975:DSR, 17019 author = "R. Mark Claudson", 17020 title = "Digital Simulation of River Plankton Population Dynamics", 17021 journal = j-CACM, 17022 volume = "18", 17023 number = "9", 17024 pages = "517--523", 17025 month = sep, 17026 year = "1975", 17027 CODEN = "CACMA2", 17028 ISSN = "0001-0782", 17029 bibdate = "Tue Mar 25 13:26:09 MST 1997", 17030 bibsource = "Compendex database", 17031 abstract = "This paper deals with the development of a mathematical model for and the digital simulation in Fortran IV of phytoplankton and zooplankton population densities in a river using previously developed rate expressions. As an investigation of the accuracy of the simulation methods, a simulation of the actual population dynamics of Asterionella in the Columbia River was made based on approximations of conditions in that river. The study demonstrates the usefulness of digital simulations in the examinations of certain aquatic ecosystems, as well as in environmental planning involving such examinations.", 17032 acknowledgement = ack-nhfb, 17033 classcodes = "C7330 (Biology and medical computing); C7440 (Civil and mechanical engineering computing)", 17034 classification = "723; 901", 17035 corpsource = "Hanford High School, Richland, WA, USA", 17036 journalabr = "Commun ACM", 17037 keywords = "approximations; aquatic ecosystems; computer simulation; digital simulation; ecological mechanisms; ecology; environmental engineering; environmental simulation; expressions; FORTRAN; mathematical modelling; mathematical models; pollution; rate; river plankton population dynamics; simulation; velocity cycle", 17038 treatment = "A Application; T Theoretical or Mathematical", 17039 } 17040 17041 @Article{Piepmeier:1975:OBI, 17042 author = "William F. Piepmeier", 17043 title = "Optimal Balancing of {I/O} Requests to Disks", 17044 journal = j-CACM, 17045 volume = "18", 17046 number = "9", 17047 pages = "524--527", 17048 month = sep, 17049 year = "1975", 17050 CODEN = "CACMA2", 17051 ISSN = "0001-0782", 17052 bibdate = "Tue Mar 25 13:26:09 MST 1997", 17053 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1975.bib", 17054 abstract = "Determining a policy for efficient allocation and utilization of a set of disk drives with differing operational characteristics is examined using analytical techniques. Using standard queueing theory, each disk drive is characterized by a queueing model with service time of a disk drive represented by the probability density function of the sum of two uniform distributions. Total response time of the set of disk models is then minimized under varying load conditions. The results indicate that faster devices should have higher utilization factors and that the number of different device types utilized tends to decrease with decreasing load. Specific examples using 2314 and 3330 combinations are examined.", 17055 acknowledgement = ack-nhfb, 17056 annote = "Determining a policy for efficient allocation and utilization of a set of disk drives with differing operational characteristics is examined using analytical techniques. Using standard queueing theory, each disk drive is characterized by a queueing model with service time of a disk drive represented by the probability density function of the sum of two uniform distributions. Total resp. time of the set of disk is minim. under vary. load. cond.", 17057 classcodes = "C6120 (File organisation); C6150J (Operating systems)", 17058 classification = "921; 922", 17059 corpsource = "Washington Univ., Saint Louis, MO, USA", 17060 country = "USA", 17061 descriptors = "Analysis; queueing theory; queueing system; model; disk; system evaluation; scheduling; distribution;", 17062 enum = "3649", 17063 journalabr = "Commun ACM", 17064 keywords = "allocation; analytical techniques; balancing; characteristics; device assignment; disc; drives; efficient allocation; file organisation; input/output; modelling; operational; optimization; probability --- Queueing Theory; probability density function; queueing theory; scheduling; storage; utilization factors", 17065 language = "English", 17066 references = "5", 17067 treatment = "A Application; T Theoretical or Mathematical", 17068 } 17069 17070 @Article{Wegbreit:1975:MPA, 17071 author = "Ben Wegbreit", 17072 title = "Mechanical Program Analysis", 17073 journal = j-CACM, 17074 volume = "18", 17075 number = "9", 17076 pages = "528--539", 17077 month = sep, 17078 year = "1975", 17079 CODEN = "CACMA2", 17080 ISSN = "0001-0782", 17081 MRclass = "68A05", 17082 MRnumber = "53 9701", 17083 mrreviewer = "A. D. Booth", 17084 bibdate = "Tue Mar 25 13:26:09 MST 1997", 17085 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Misc/Functional.bib", 17086 abstract = "One means of analyzing program performance is by deriving closed-form expressions for their execution behavior. This paper discusses the mechanization of such analysis, and describes a system, Metric, which is able to analyze simple Lisp programs and produce, for example, closed-form expressions for their running time expressed in terms of size of input. This paper presents the reasons for mechanizing program analysis, describes the operation of Metric, explains its implementation, and discusses its limitations.", 17087 acknowledgement = ack-nhfb, 17088 classcodes = "C6110 (Systems analysis and programming); C6140D (High level languages); C6150G (Diagnostic, testing, debugging and evaluating systems)", 17089 classification = "723", 17090 corpsource = "Xerox Palo Alto Res. Center, Palo Alto, CA, USA", 17091 journalabr = "Commun ACM", 17092 keywords = "algebraic manipulation; analysis; computer programming languages; execution behaviour; functional lisp; generating functions; LISP; lisp; list; mechanization; mechanizing program; metric; performance; processing; program analysis; programming; programming languages; programs; running time; size of input", 17093 treatment = "P Practical", 17094 } 17095 17096 @Article{Gerritsen:1975:PSD, 17097 author = "Rob Gerritsen", 17098 title = "A Preliminary System for the Design of {DBTG} Data Structures", 17099 journal = j-CACM, 17100 volume = "18", 17101 number = "10", 17102 pages = "551--557", 17103 month = oct, 17104 year = "1975", 17105 CODEN = "CACMA2", 17106 ISSN = "0001-0782", 17107 bibdate = "Tue Mar 25 13:26:09 MST 1997", 17108 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib", 17109 abstract = "The functional approach to database design is introduced. In this approach the goal of design is to derive a data structure which is capable of supporting a set of anticipated queries rather than a structure which ``models the business'' in some other way. An operational computer program is described which utilizes the functional approach to design data structures conforming to the Data Base Task Group specifications. The automatic programming technology utilized by this program, although typically used to generate procedure, is here used to generate declaratives.", 17110 acknowledgement = ack-nhfb, 17111 classcodes = "C6120 (File organisation)", 17112 classification = "723", 17113 corpsource = "Univ. of Pennsylvania, Philadelphia, PA, USA", 17114 journalabr = "Commun ACM", 17115 keywords = "automatic programming; Data Base; data processing; data structures; database design; functional approach; nonprocedural languages; operational computer program; preliminary system; Task Group; translation", 17116 review = "ACM CR 7604-??", 17117 treatment = "A Application; T Theoretical or Mathematical", 17118 } 17119 17120 @Article{Shu:1975:CHL, 17121 author = "Nan C. Shu and Barron C. Housel and Vincent Y. Lum", 17122 title = "{CONVERT}: {A} High Level Translation Definition Language for Data Conversion", 17123 journal = j-CACM, 17124 volume = "18", 17125 number = "10", 17126 pages = "557--567", 17127 month = oct, 17128 year = "1975", 17129 CODEN = "CACMA2", 17130 ISSN = "0001-0782", 17131 bibdate = "Tue Mar 25 13:26:09 MST 1997", 17132 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib", 17133 note = "Also published in/as: 19 ACM SIGMOD Conf. on the Management of Data, King(ed), May.1975.", 17134 abstract = "This paper describes a high level and nonprocedural translation definition language, CONVERT, which provides very powerful and highly flexible data restructuring capabilities. Its design is based on the simple underlying concept of a form which enables the users to visualize the translation processes, and thus makes data translation a much simpler task.", 17135 acknowledgement = ack-nhfb, 17136 classcodes = "C6130 (Data handling techniques); C6140D (High level languages)", 17137 classification = "723", 17138 corpsource = "IBM Res. Lab., San Jose, CA, USA", 17139 journalabr = "Commun ACM", 17140 keywords = "computer programming languages; convert; data; data conversion; data handling; data processing --- Data Structures; data translation; database reorganisation; nonprocedural translation definition language; problem oriented languages; programming languages; restructuring; translation definition language; utility program", 17141 treatment = "A Application; P Practical", 17142 } 17143 17144 @Article{Smith:1975:OPR, 17145 author = "John Miles Smith and Philip Yen-Tang Chang", 17146 title = "Optimizing the Performance of a Relational Algebra Data Base Interface", 17147 journal = j-CACM, 17148 volume = "18", 17149 number = "10", 17150 pages = "568--579", 17151 month = oct, 17152 year = "1975", 17153 CODEN = "CACMA2", 17154 ISSN = "0001-0782", 17155 bibdate = "Tue Mar 25 13:26:09 MST 1997", 17156 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib", 17157 abstract = "A relational algebra interface, called SQUIRAL, is described in detail. SQUIRAL seeks to minimize query response time and space utilization by: (1) performing global query optimization, (2) exploiting disjoint and pipelined concurrency, (3) coordinating sort orders in temporary relations, (4) employing directory analysis, and (5) maintaining locality in page references. Algorithms for implementing the operators of E. F. Codd's relational algebra are presented, and a methodology for composing them to optimize the performance of a particular user query is described.", 17158 acknowledgement = ack-nhfb, 17159 classcodes = "C6120 (File organisation)", 17160 classification = "723", 17161 corpsource = "Univ. of Utah, Salt Lake City, UT, USA", 17162 journalabr = "Commun ACM", 17163 keywords = "automatic; data; data processing; directory analysis; file; global query optimisation; inverted; manipulation language; optimisation; pipelined concurrency; programming; query response; query specification; relational algebra database interface; sort orders; space utilization; SQUIRAL; time; very high level language", 17164 treatment = "T Theoretical or Mathematical", 17165 } 17166 17167 @Article{Astrahan:1975:ISE, 17168 author = "M. M. Astrahan and D. D. Chamberlin", 17169 title = "Implementation of a {Structured English Query Language}", 17170 journal = j-CACM, 17171 volume = "18", 17172 number = "10", 17173 pages = "580--588", 17174 month = oct, 17175 year = "1975", 17176 CODEN = "CACMA2", 17177 ISSN = "0001-0782", 17178 bibdate = "Tue Mar 25 13:26:09 MST 1997", 17179 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Database/Graefe.bib and ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib", 17180 note = "Also published in/as: 19 ACM SIGMOD Conf. on the Management of Data, King(ed), May.1975", 17181 abstract = "SEQUEL is a nonprocedural language which does not make use of quantifiers or other mathematical concepts; rather, SEQUEL uses a block structured format of English key words (hence the acronym ``Structured English Query Language'' ). SEQUEL is intended for interactive, problem solving use by people who have need for interaction with a large database but who are not trained programmers. This class of users includes urban planners, sociologists, accountants, and other professionals. The objective of the language is to provide a simple, easy-to-learn means of expressing the primitive actions used by people to obtain information from tables, such as ``look up a value in a column.'' SEQUEL and its companion language, SQUARE, have been shown to be relationally complete, i.e. equivalent in power to Codd's relational calculus.", 17182 acknowledgement = ack-nhfb, 17183 annote = "Description of implementation of SEQUEL interpreter, especially optimizer, which uses indexes to simplify queries.", 17184 classcodes = "C6130 (Data handling techniques); C6140D (High level languages); C6150C (Compilers, interpreters and other processors)", 17185 classification = "723", 17186 corpsource = "IBM Res. Div., San Jose, CA, USA", 17187 journalabr = "Commun ACM", 17188 keywords = "CACM; data accessing; data handling; data organisation; data processing; data structure; data structures; data sublanguage; database; nonprocedural language; operations; optimisation algorithms; problem oriented languages; program interpreters; prototype interpreter; relation database IBM San Jose; relational model; SEQUEL; structured English query language", 17189 treatment = "A Application; T Theoretical or Mathematical", 17190 } 17191 17192 @Article{Gavril:1975:MPP, 17193 author = "Fanica Gavril", 17194 title = "Merging with Parallel Processors", 17195 journal = j-CACM, 17196 volume = "18", 17197 number = "10", 17198 pages = "588--591", 17199 month = oct, 17200 year = "1975", 17201 CODEN = "CACMA2", 17202 ISSN = "0001-0782", 17203 bibdate = "Tue Mar 25 13:26:09 MST 1997", 17204 bibsource = "Compendex database", 17205 abstract = "Consider two linearly ordered sets A, B, vertical A vertical equals m, vertical B vertical equals n, m less than equivalent to n, and p,p less than equivalent to m, parallel processors working synchronously. The paper presents an algorithm for merging A and B with the p parallel processors, which requires at most 2 left bracket log//2(2m plus 1) right bracket plus left bracket 3m/p right bracket plus left bracket m/p right bracket left bracket log//2(n/m) right bracket steps. If n equals 2** beta m ( beta an integer), the algorithm requires at most 2 left bracket log//2(m plus 1) right bracket plus left bracket m/p right bracket (2 plus beta ) steps. In the case where m and n are of the same order of magnitude, i.e. n equals km with k being a constant, the algorithm requires 2 left bracket log//2(m plus 1) right bracket plus right bracket m/p right bracket (3 plus k) steps. These performances compare very favorably with the previous best parallel merging algorithm, Batcher's algorithm, which requires n/p plus ((m plus n)/2p)log//2m steps in the general case and km/p plus ((k plus l)/2)(m/p)log//2m in the special case where n equals km.", 17206 acknowledgement = ack-nhfb, 17207 classcodes = "C4240 (Programming and algorithm theory)", 17208 classification = "722; 723", 17209 corpsource = "Univ. of Illinois, Chicago, IL, USA", 17210 journalabr = "Commun ACM", 17211 keywords = "Batcher's algorithm; computer systems programming --- Sorting; computer systems, digital; linearly ordered sets; merging; parallel binary insertion; parallel processing; parallel processors; programming theory", 17212 treatment = "T Theoretical or Mathematical", 17213 } 17214 17215 @Article{Reiser:1975:HRE, 17216 author = "M. Reiser and H. Kobayashi", 17217 title = "{Horner}'s Rule for the Evaluation of General Closed Queueing Networks", 17218 journal = j-CACM, 17219 volume = "18", 17220 number = "10", 17221 pages = "592--593", 17222 month = oct, 17223 year = "1975", 17224 CODEN = "CACMA2", 17225 ISSN = "0001-0782", 17226 bibdate = "Tue Mar 25 13:26:09 MST 1997", 17227 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1975.bib", 17228 abstract = "The solution of separable closed queueing networks requires the evaluation of homogeneous multinomial expressions. The number of terms in those expressions grows combinatorially with the size of the network such that a direct summation may become impractical. An algorithm is given which does not show a combinatorial operation count. The algorithm is based on a generalization of Horner's rule for polynomials. It is also shown how mean queue size and throughput can be obtained at negligible extra cost once the normalization constant is evaluated.", 17229 acknowledgement = ack-nhfb, 17230 annote = "An algorithm is given which makes it possible to solve separable closed queueing networks independent from the size of the network. The algorithm does not show a combinatorial operation count; it is based on a generalization of Horner's rule for polynomials. Also is shown how mean queue size and throughput can be obtained at negligible extra cost once the normalization constant is evaluated.", 17231 classcodes = "B0240C (Queueing theory); C1140C (Queueing theory)", 17232 classification = "723; 912; 922", 17233 corpsource = "IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA", 17234 country = "USA", 17235 descriptors = "Closed queueing network; algorithm; evaluation;", 17236 enum = "3660", 17237 journalabr = "Commun ACM", 17238 keywords = "closed queueing networks; combinatorial operation count; expressions; homogeneous multinomial; Horner's rule; load dependent service rate; multinomial sums; operations research --- Computer Applications; probability; queueing theory", 17239 language = "English", 17240 references = "8", 17241 treatment = "T Theoretical or Mathematical", 17242 } 17243 17244 @Article{Salton:1975:VSM, 17245 author = "G. Salton and A. Wong and C. S. Yang", 17246 title = "A Vector Space Model for Automatic Indexing", 17247 journal = j-CACM, 17248 volume = "18", 17249 number = "11", 17250 pages = "613--620", 17251 month = nov, 17252 year = "1975", 17253 CODEN = "CACMA2", 17254 ISSN = "0001-0782", 17255 bibdate = "Tue Mar 25 13:26:09 MST 1997", 17256 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib", 17257 abstract = "In a document retrieval, or other pattern matching environment where stored entities (documents) are compared with each other or with incoming patterns (search requests), it appears that the best indexing (property) space is one where each entity lies as far away from the others as possible; in these circumstances the value of an indexing system may be expressible as a function of the density of the object space; in particular, retrieval performance may correlate inversely with space density. An approach based on space density computations is used to choose an optimum indexing vocabulary for a collection of documents. Typical evaluation results are shown, demonstrating the usefulness of the model.", 17258 acknowledgement = ack-nhfb, 17259 annote = "Optimizing of relationship strength based data access.", 17260 classcodes = "C6130 (Data handling techniques); C7240 (Information analysis and indexing)", 17261 classification = "723; 901", 17262 corpsource = "Cornell Univ., Ithaca, NY, USA", 17263 journalabr = "Commun ACM", 17264 keywords = "automatic indexing; content analysis; density; document retrieval; incoming patterns; indexing; information science; library mechanisation; pattern matching environment; space; vector space model", 17265 treatment = "A Application; P Practical", 17266 } 17267 17268 @Article{Boyce:1975:SQR, 17269 author = "Raymond F. Boyce and Donald D. Chamberlin and W. Frank {King, III} and Michael M. Hammer", 17270 title = "Specifying Queries as Relational Expressions: The Square Data Sublanguage", 17271 journal = j-CACM, 17272 volume = "18", 17273 number = "11", 17274 pages = "621--628", 17275 month = nov, 17276 year = "1975", 17277 CODEN = "CACMA2", 17278 ISSN = "0001-0782", 17279 bibdate = "Tue Mar 25 13:26:09 MST 1997", 17280 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib", 17281 note = "Also published in/as: in Douque74 (IFIP TC-2), 1974. Also published in/as: ACM SIGPLAN-SIGIR 1974, Nance (ed), pp. 31--47. Also published in/as: IBM, San Jose Research Report RJ1291, October 1973.", 17282 abstract = "This paper presents a data sublanguage called SQUARE, intended for use in ad hoc, interactive problem solving by non-computer specialists. SQUARE is based on the relational model of data, and is shown to be relationally complete; however, it avoids the quantifiers and bound variables required by languages based on the relational calculus. Facilities for query, insertion, deletion, and update on tabular data bases are described. A syntax is given, and suggestions are made for alternative syntaxes, including a syntax based on English key words for users with limited mathematical background.", 17283 acknowledgement = ack-nhfb, 17284 classcodes = "C6130 (Data handling techniques); C6140D (High level languages)", 17285 classification = "723", 17286 corpsource = "IBM Res. Lab., San Jose, CA, USA", 17287 journalabr = "Commun ACM", 17288 keywords = "casual user; data processing; data sublanguage; database; English key words; interactive problem; nonprocedural language; problem oriented languages; query languages; relational calculus; relational expressions; SQUARE; square; tabular data", 17289 treatment = "A Application; P Practical", 17290 } 17291 17292 @Article{Ledgard:1975:GCS, 17293 author = "Henry F. Ledgard and Michael Marcotty", 17294 title = "A genealogy of control structures", 17295 journal = j-CACM, 17296 volume = "18", 17297 number = "11", 17298 pages = "629--639", 17299 month = nov, 17300 year = "1975", 17301 CODEN = "CACMA2", 17302 ISSN = "0001-0782", 17303 bibdate = "Tue Mar 25 13:26:09 MST 1997", 17304 bibsource = "Compendex database", 17305 abstract = "The classic result of Bohm and Jacopini on the theoretical completeness of if-then-else and while-do is discussed. Several recent ideas on control structures are then explored. These include a review of various other control structures, results on time\slash space limitations, and theorems relating the relative power of control structures under several notions of equivalence. In conclusion, the impact of theoretical results on the practicing programmer and the importance of one-in, one-out control structures as operational abstractions are discussed. It is argued further that there is insufficient evidence to warrant more than if-then-else, while-do, and their variants.", 17306 acknowledgement = ack-nhfb, 17307 classcodes = "C4290 (Other computer theory); C6110 (Systems analysis and programming)", 17308 classification = "723", 17309 corpsource = "Univ. of Massachusetts, Amherst, MA, USA", 17310 journalabr = "Commun ACM", 17311 keywords = "computer programming languages; go to statements; language design; operational abstractions; PASCAL; program control structures; programming; structured programming", 17312 treatment = "A Application; T Theoretical or Mathematical", 17313 } 17314 17315 @Article{Graham:1975:PSE, 17316 author = "Susan L. Graham and Steven P. Rhodes", 17317 title = "Practical Syntactic Error Recovery", 17318 journal = j-CACM, 17319 volume = "18", 17320 number = "11", 17321 pages = "639--650 (or 639--649??)", 17322 month = nov, 17323 year = "1975", 17324 CODEN = "CACMA2", 17325 ISSN = "0001-0782", 17326 bibdate = "Tue Mar 25 13:26:09 MST 1997", 17327 bibsource = "Compendex database", 17328 abstract = "This paper describes a recovery scheme for syntax errors which provides automatically-generated high quality recovery with good diagnostic information at relatively low cost. Previous recovery techniques are summarized and empirical comparisons are made. Suggestions for further research on this topic conclude the paper.", 17329 acknowledgement = ack-nhfb, 17330 classcodes = "C6110 (Systems analysis and programming); C6150C (Compilers, interpreters and other processors); C6150G (Diagnostic, testing, debugging and evaluating systems)", 17331 classification = "723", 17332 corpsource = "Univ. of California, Berkeley, CA, USA", 17333 journalabr = "Commun ACM", 17334 keywords = "compilers; computer programming languages; correction; debugging; diagnostic information; error; error compensation; error correction; parsing; program compilers; program debugging; simple precedence; syntactic error recovery; system recovery", 17335 treatment = "T Theoretical or Mathematical", 17336 } 17337 17338 @Article{Bitner:1975:BPT, 17339 author = "James R. Bitner and Edward M. Reingold", 17340 title = "Backtrack Programming Techniques", 17341 journal = j-CACM, 17342 volume = "18", 17343 number = "11", 17344 pages = "651--656", 17345 month = nov, 17346 year = "1975", 17347 CODEN = "CACMA2", 17348 ISSN = "0001-0782", 17349 bibdate = "Tue Mar 25 13:26:09 MST 1997", 17350 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Theory/graph.coloring.bib", 17351 abstract = "The purpose of this paper is twofold. First, a brief exposition of the general backtrack technique and its history is given. Second, it is shown how the use of macros can considerably shorten the computation time in many cases. In particular, this technique has allowed the solution of two previously open combinatorial problems, the computation of new terms in a well-known series, and the substantial reduction in computation time for the solution to another combinatorial problem.", 17352 acknowledgement = ack-nhfb, 17353 classcodes = "C4240 (Programming and algorithm theory); C6100 (Software techniques and systems)", 17354 classification = "723", 17355 corpsource = "Univ. of Illinois, Urbana, IL, USA", 17356 journalabr = "Commun ACM", 17357 keywords = "backtrack; combinatorial computing; combinatorial problems; computer programming; depth first search; depth-first search; difference-preserving codes; exhaustive; exhaustive search; graph coloring related algorithms; macros; non-attacking queen's problem; nonattacking queen's problem; pentominoes; problems; programming theory; search; shorten the computation time; squaring the square; tiling; tiling problems", 17358 treatment = "A Application; T Theoretical or Mathematical", 17359 } 17360 17361 @Article{Kou:1975:NSB, 17362 author = "Lawrence T. Kou and C. K. Wong", 17363 title = "A Note on the Set Basis Problem Related to the Compaction of Character Sets", 17364 journal = j-CACM, 17365 volume = "18", 17366 number = "11", 17367 pages = "656--657", 17368 month = nov, 17369 year = "1975", 17370 CODEN = "CACMA2", 17371 ISSN = "0001-0782", 17372 MRclass = "68A10", 17373 MRnumber = "52 7196", 17374 mrreviewer = "Dorothy Bollman", 17375 bibdate = "Tue Mar 25 13:26:09 MST 1997", 17376 bibsource = "Compendex database", 17377 abstract = "This note discusses the reduction of the set basis problem to the clique cover problem.", 17378 acknowledgement = ack-nhfb, 17379 classcodes = "C4240 (Programming and algorithm theory)", 17380 classification = "723", 17381 corpsource = "IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA", 17382 journalabr = "Commun ACM", 17383 keywords = "character sets; clique; compaction of character sets; computational complexity; computer programming; cover problem; data compression; polynomial completeness; set basis problem; set covering", 17384 treatment = "T Theoretical or Mathematical", 17385 } 17386 17387 @Article{Naur:1975:PLN, 17388 author = "Peter Naur", 17389 title = "Programming Languages, Natural Languages, and Mathematics", 17390 journal = j-CACM, 17391 volume = "18", 17392 number = "12", 17393 pages = "676--683", 17394 month = dec, 17395 year = "1975", 17396 CODEN = "CACMA2", 17397 ISSN = "0001-0782", 17398 MRclass = "68A05 (68A30)", 17399 MRnumber = "56 13752", 17400 bibdate = "Tue Mar 25 13:26:09 MST 1997", 17401 bibsource = "Compendex database", 17402 note = "Papers from the Second {ACM} Symposium on Principles of Programming Languages (Palo Alto, Calif., 1975).", 17403 abstract = "Some social aspects of programming are illuminated through analogies with similar aspects of mathematics and natural languages. The split between pure and applied mathematics is found similarly in programming. The development of natural languages toward flexionless, word-order based language types speaks for programming language design based on general, abstract constructs. By analogy with incidents of the history of artificial, auxiliary languages it is suggested that Fortran and Cobol will remain dominant for a long time to come. The most promising avenues for further work of wide influence are seen to be high quality program literature (i.e. programs) of general utility and studies of questions related to program style.", 17404 acknowledgement = ack-nhfb, 17405 classcodes = "C6110 (Systems analysis and programming)", 17406 classification = "723", 17407 corpsource = "Datalogisk Inst., Copenhagen Univ., Copenhagen, Denmark", 17408 journalabr = "Commun ACM", 17409 keywords = "abstract constructs; artificial; auxiliary languages; computer programming languages; descriptive and; literature; prescriptive attitudes; programming language; programming languages; pure and applied mathematics; social aspects of automation; social aspects of programming; style", 17410 treatment = "P Practical", 17411 } 17412 17413 @Article{Goodenough:1975:EHI, 17414 author = "John B. Goodenough", 17415 title = "Exception Handling: Issues and a Proposed Notation", 17416 journal = j-CACM, 17417 volume = "18", 17418 number = "12", 17419 pages = "683--696", 17420 month = dec, 17421 year = "1975", 17422 CODEN = "CACMA2", 17423 ISSN = "0001-0782", 17424 bibdate = "Tue Mar 25 13:26:09 MST 1997", 17425 bibsource = "Compendex database", 17426 abstract = "This paper defines exception conditions, discusses the requirements exception handling language features must satisfy, and proposes some new language features for dealing with exceptions in an orderly and reliable way. The proposed language features serve to highlight exception handling issues by showing how deficiencies in current approaches can be remedied.", 17427 acknowledgement = ack-nhfb, 17428 classcodes = "C6110 (Systems analysis and programming)", 17429 classification = "723", 17430 corpsource = "SofTech Inc., Waltham, MA, USA", 17431 journalabr = "Commun ACM", 17432 keywords = "computer programming languages; conditions; error; exception conditions; exception handling; goto statement; language features; multilevel exit; ON conditions; programming; programming languages; proposed notation; structured programming", 17433 treatment = "P Practical", 17434 } 17435 17436 @Article{Jazayeri:1975:IEC, 17437 author = "Mehdi Jazayeri and William F. Ogden and William C. Rounds", 17438 title = "The Intrinsically Exponential Complexity of the Circularity Problem for Attribute Grammars", 17439 journal = j-CACM, 17440 volume = "18", 17441 number = "12", 17442 pages = "697--706", 17443 month = dec, 17444 year = "1975", 17445 CODEN = "CACMA2", 17446 ISSN = "0001-0782", 17447 MRclass = "68A20", 17448 MRnumber = "52 16115", 17449 mrreviewer = "I. Hal Sudborough", 17450 bibdate = "Tue Mar 25 13:26:09 MST 1997", 17451 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Compiler/AG.bib", 17452 note = "Papers from the Second {ACM} Symposium on Principles of Programming Languages (Palo Alto, Calif., 1975)", 17453 abstract = "Attribute grammars are an extension of context-free grammars devised by Knuth as a mechanism for including the semantics of a context-free language with the syntax of the language. The circularity problem for a grammar is to determine whether the semantics for all possible sentences (programs) in fact will be well defined. It is proved that this problem is, in general, computationally intractable. Specifically, it is shown that any deterministic algorithm which solves the problem must for infinitely many cases use an exponential amount of time. An improved version of Knuth's circularity testing algorithm is also given, which actually solves the problem within exponential time.", 17454 acknowledgement = ack-nhfb, 17455 classcodes = "C4210 (Formal logic); C4240 (Programming and algorithm theory)", 17456 classification = "721; 723", 17457 corpsource = "Univ. of North Carolina, Chapel Hill, NC, USA", 17458 journalabr = "Commun ACM", 17459 keywords = "attribute grammars; automata theory; circ; circularity problem; computational complexity; computer programming languages; context free grammars; context-free grammars; deterministic algorithm; exponential time; intrinsically exponential complexity; semantics", 17460 treatment = "T Theoretical or Mathematical", 17461 } 17462 17463 @Article{Hunt:1975:CLK, 17464 author = "Harry B. {Hunt, III} and Thomas G. Szymanski and Jeffrey D. Ullman", 17465 title = "On the Complexity of {LR(k)} Testing", 17466 journal = j-CACM, 17467 volume = "18", 17468 number = "12", 17469 pages = "707--716", 17470 month = dec, 17471 year = "1975", 17472 CODEN = "CACMA2", 17473 ISSN = "0001-0782", 17474 MRclass = "68A20 (68A30)", 17475 MRnumber = "52 12402", 17476 mrreviewer = "Pavel Strnad", 17477 bibdate = "Tue Mar 25 13:26:09 MST 1997", 17478 bibsource = "Compendex database", 17479 note = "Papers from the Second ACM Symposium on Principles of Programming Languages (Palo Alto, Calif., 1975).", 17480 abstract = "The problem of determining whether an arbitrary context-free grammar is a member of some easily parsed subclass of grammars such as the LR(k) grammars is considered. The time complexity of this problem is analyzed both when k is considered to be a fixed integer and when k is considered to be a parameter of the test. In the first case, it is shown that for every k there exists an O(n**k** plus **2) algorithm for testing the LR(k) property, where n is the size of the grammar in question. On the other hand, if both k and the subject grammar are problem parameters, then the complexity of the problem depends very strongly on the representation chosen for k. More specifically, it is shown that this problem is NP-complete when k is expressed in unary. When k is expressed in binary the problem is complete for nondeterministic exponential time. These results carry over to many other parameterized classes of grammars, such as the LL(k), strong LL(k), SLR(k), and strong LC(k) grammars.", 17481 acknowledgement = ack-nhfb, 17482 classcodes = "C4210 (Formal logic); C4240 (Programming and algorithm theory)", 17483 classification = "721; 723", 17484 corpsource = "Harvard Univ., Cambridge, MA, USA", 17485 journalabr = "Commun ACM", 17486 keywords = "automata theory; computer programming languages", 17487 keywords = "computational complexity; context free grammar; context-free grammars; LR(k) grammars; nondeterministic exponential time; NP complete; parsing; problems; time complexity", 17488 treatment = "T Theoretical or Mathematical", 17489 } 17490 17491 @Article{Graham:1975:FUL, 17492 author = "Susan L. Graham and Mark Wegman", 17493 title = "A fast and usually linear algorithm for global flow analysis", 17494 journal = j-CACM, 17495 volume = "18", 17496 number = "12", 17497 pages = "716--716", 17498 month = dec, 17499 year = "1975", 17500 CODEN = "CACMA2", 17501 ISSN = "0001-0782", 17502 bibdate = "Tue Mar 25 13:26:09 MST 1997", 17503 note = "See \cite{Graham:1976:FUL} for full paper.", 17504 abstract = "A new algorithm for global flow analysis on reducible graphs is presented. The algorithm is shown to treat a very general class of function spaces. \par For a graph of $e$ edges, the algorithm has a worst case time bound of $O(e \log e)$ function operations. \par It is also shown that in programming terms, the number of operations is proportional to $e$ plus the number of exits from program loops. Consequently a restriction to one-entry one-exit control structures linearity. The algorithm can be extended to yet larger classes of function spaces and graphs by relaxing the time bound. Examples are given of code improvement problems which can be solved using the algorithm.", 17505 acknowledgement = ack-nhfb, 17506 classcodes = "B0250 (Combinatorial mathematics); C1160 (Combinatorial mathematics)", 17507 corpsource = "Univ. of California, Berkeley, CA, USA", 17508 keywords = "bound; code optimisation; code optimization; common; common subexpression elimination; compression; data flow; depth-first search; flow graph; function spaces; global flow analysis; go-to-less programming; graph theory; information propagation; live-dead analysis; path; path compression; reducibility; reducible graphs; subexpression elimination; worst case time", 17509 treatment = "T Theoretical or Mathematical", 17510 } 17511 17512 @Article{Lipton:1975:RMP, 17513 author = "Richard J. Lipton", 17514 title = "Reduction: {A} Method of Proving Properties of Parallel Programs", 17515 journal = j-CACM, 17516 volume = "18", 17517 number = "12", 17518 pages = "717--721", 17519 month = dec, 17520 year = "1975", 17521 CODEN = "CACMA2", 17522 ISSN = "0001-0782", 17523 MRclass = "68A05", 17524 MRnumber = "53 4599", 17525 mrreviewer = "O. A. Leticevskii", 17526 bibdate = "Tue Mar 25 13:26:09 MST 1997", 17527 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Compiler/semantics.bib", 17528 note = "Papers from the Second {ACM} Symposium on Principles of Programming Languages (Palo Alto, Calif., 1975).", 17529 abstract = "When proving that a parallel program has a given property it is often convenient to assume that a statement is indivisible, i.e. that the statement cannot be interleaved with the rest of the program. Here sufficient conditions are obtained to show that the assumption that a statement is indivisible can be relaxed and still preserve properties such as halting. Thus correctness proofs of a parallel system can often be greatly simplified.", 17530 acknowledgement = ack-nhfb, 17531 classcodes = "C4240 (Programming and algorithm theory)", 17532 classification = "723", 17533 corpsource = "Yale Univ., New Haven, CT, USA", 17534 journalabr = "Commun ACM", 17535 keywords = "computation sequence; computer metatheory; deadlock; free; halting; indivisible; interruptible; parallel processing; parallel programs; process; programming theory; reduction; semaphore; verification method", 17536 treatment = "T Theoretical or Mathematical", 17537 } 17538 17539 @Article{Schwartz:1975:ADS, 17540 author = "J. T. Schwartz", 17541 title = "Automatic Data Structure Choice in a Language of Very High Level", 17542 journal = j-CACM, 17543 volume = "18", 17544 number = "12", 17545 pages = "722--728", 17546 month = dec, 17547 year = "1975", 17548 CODEN = "CACMA2", 17549 ISSN = "0001-0782", 17550 bibdate = "Tue Mar 25 13:26:09 MST 1997", 17551 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Compiler/opt.compiler.bib", 17552 abstract = "SETL is a set-theoretically oriented language of very high level whose repertoire of semantic objects includes finite sets, ordered n-tuples, and sets of ordered n-tuples usable as mappings. This paper describes the structure of an optimizer for this language. Among other methods of interest, the optimizer uses techniques which allow relations of inclusion and membership to be established, the domains and ranges of (tabulated) mappings to be estimated from above and below, and the single-valuedness of (tabulated) mappings to be proved. Once facts of this kind have been established, automatic choice of data structures becomes possible. The methods employed are based upon, and extend, known techniques of data flow analysis.", 17553 acknowledgement = ack-nhfb, 17554 classcodes = "C4240 (Programming and algorithm theory); C6140D (High level languages)", 17555 classification = "723", 17556 corpsource = "New York Univ., New York, NY, USA", 17557 journalabr = "Commun ACM", 17558 keywords = "automatic programming; computer programming languages; data flow analysis; data processing --- Data Structures; data structure choice; data structures; language; mappings; optimisation; program; programming languages; programming theory; set theoretically oriented; SETL", 17559 treatment = "T Theoretical or Mathematical", 17560 } 17561 17562 @Article{Kleinrock:1976:SLO, 17563 author = "Leonard Kleinrock and William E. Naylor and Holger Opderbeck", 17564 title = "A Study of Line Overhead in the {ARPANET}", 17565 journal = j-CACM, 17566 volume = "19", 17567 number = "1", 17568 pages = "3--13", 17569 month = jan, 17570 year = "1976", 17571 CODEN = "CACMA2", 17572 ISSN = "0001-0782", 17573 bibdate = "Tue Mar 25 13:26:09 MST 1997", 17574 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1976.bib", 17575 abstract = "The form, extent, and effect of the communication line overhead in the ARPANET are considered. The source of this overhead is separated into various levels of protocol hierarchy and the characteristics of each level are summarized. Then the line efficiency for various models of system use is studied. Some measurements of line efficiency for the ARPANET are presented and by extrapolation these measurements are used to anticipate overhead in a heavily loaded network. Similar results are derived for a recently proposed network protocol and compared with those for the current system.", 17576 acknowledgement = ack-nhfb, 17577 annote = "The form, extend, and effect of the communication line overhead in the Arpanet are considered.", 17578 classcodes = "C5620 (Computer networks and techniques)", 17579 classification = "723", 17580 corpsource = "Univ. of California, Los Angeles, CA, USA", 17581 country = "USA", 17582 date = "08/12/80", 17583 descriptors = "ARPANET; packet switching; performance evaluation; OVERHEAD;", 17584 enum = "1703", 17585 journalabr = "Commun ACM", 17586 keywords = "ARPANET; communication line; computer networks; computer systems, digital --- Time Sharing; computers; heavily loaded network; hierarchy; line efficiency; line overhead; protocol", 17587 language = "English", 17588 references = "23", 17589 treatment = "P Practical", 17590 } 17591 17592 @Article{Wilhelm:1976:ADS, 17593 author = "Neil C. Wilhelm", 17594 title = "An Anomaly in Disk Scheduling: {A} Comparison of {FCFS} and {SSTF} Seek Scheduling Using an Empirical Model for Disk Accesses", 17595 journal = j-CACM, 17596 volume = "19", 17597 number = "1", 17598 pages = "13--18 (or 13--17??)", 17599 month = jan, 17600 year = "1976", 17601 CODEN = "CACMA2", 17602 ISSN = "0001-0782", 17603 bibdate = "Tue Mar 25 13:26:09 MST 1997", 17604 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib", 17605 abstract = "A model for disk accesses based on published measurements is developed. The model is used to show that under highly probable conditions, FCFS seek scheduling is superior to SSTF scheduling in the sense of having a lower mean queue length. A simple example of an arrival sequence illustrating this anomaly is presented.", 17606 acknowledgement = ack-nhfb, 17607 classcodes = "C6120 (File organisation); C6150J (Operating systems)", 17608 classification = "721; 722", 17609 corpsource = "Univ. of Rochester, Rochester, NY, USA", 17610 journalabr = "Commun ACM", 17611 keywords = "(computers); comparison; data storage, magnetic; disc accesses; disc scheduling; empirical model; FCFS; magnetic disc and drum storage; operating systems; seek scheduling; SSTF", 17612 treatment = "P Practical", 17613 } 17614 17615 @Article{Agnew:1976:QAR, 17616 author = "Carson E. Agnew", 17617 title = "On Quadratic Adaptive Routing Algorithms", 17618 journal = j-CACM, 17619 volume = "19", 17620 number = "1", 17621 pages = "18--22", 17622 month = jan, 17623 year = "1976", 17624 CODEN = "CACMA2", 17625 ISSN = "0001-0782", 17626 bibdate = "Tue Mar 25 13:26:09 MST 1997", 17627 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1976.bib", 17628 abstract = "Two analytic models of a store-and-forward communications network are constructed, one to find the optimal message routing and the other to illustrate the equilibrium (stationary state) maintained by an adaptive routing algorithm. These models show that adaptive routing does not satisfy the necessary conditions for an optimal routing. Adaptive routing tends to overuse the direct path and underuse alternate routes because it does not consider the impact of its current routing decision on the future state of the network. The form of the optimality conditions suggests that a modification of the adaptive algorithm will result in optimality. The modification requires the substitution of a quadratic bias term instead of a linear one in the routing table maintained at each network node. Simulation results are presented which confirm the theoretical analysis for a simple network.", 17629 acknowledgement = ack-nhfb, 17630 annote = "Two analytic models of a store-and-forward communications network are constructed, one to find the optimal message routing and the other to illustrate the equilibrium maintained by an adaptive routing algorithm. These models show that adaptive routing does not satisfy the necessary conditions for an optimal routing. Adaptive routing tends to overuse the direct path and underuse alternate routes because it does not consider the impact of the ro", 17631 classcodes = "B6210Z (Other data transmission); C5600 (Data communication equipment and techniques)", 17632 classification = "723", 17633 corpsource = "Stanford Univ., Stanford, CA, USA", 17634 country = "USA", 17635 descriptors = "Routing algorithm; adaptive routing; quadratic routing; alternate routing; store-and-forward; computer network; distributed computing system; message switching;", 17636 enum = "37", 17637 journalabr = "Commun ACM", 17638 keywords = "adaptive routing; algorithms; alternate routing; communications network; computer network; computer programming; digital communication systems; distributed network; equilibrium; forward; message switching; optimal message; quadratic adaptive routing; quadratic routing; routing; routing algorithms; store-and-forward network", 17639 language = "English", 17640 references = "0", 17641 treatment = "A Application; T Theoretical or Mathematical", 17642 } 17643 17644 @Article{Karlton:1976:PHB, 17645 author = "P. L. Karlton and S. H. Fuller and R. E. Scroggs and E. B. Kaehler", 17646 title = "Performance of Height-Balanced Trees", 17647 journal = j-CACM, 17648 volume = "19", 17649 number = "1", 17650 pages = "23--28", 17651 month = jan, 17652 year = "1976", 17653 CODEN = "CACMA2", 17654 ISSN = "0001-0782", 17655 bibdate = "Tue Mar 25 13:26:09 MST 1997", 17656 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib", 17657 abstract = "This paper presents the results of simulations that investigate the performance of height-balanced (HB left bracket k right bracket ) trees. It is shown that the only statistic of HB left bracket 1 right bracket trees (AVL trees) that is a function of the size of the tree is the time to search for an item in the tree. For sufficiently large trees, the execution times of all procedures for maintaining HB left bracket 1 right bracket trees are independent of the size of the tree.", 17658 acknowledgement = ack-nhfb, 17659 annote = "Binary tree balancing when inserting and deleting.", 17660 classcodes = "C4290 (Other computer theory); C6120 (File organisation)", 17661 classification = "723; 921", 17662 corpsource = "Carnegie-Mellon Univ., Pittsburgh, PA, USA", 17663 journalabr = "Commun ACM", 17664 keywords = "deletion; execution times; file organisation; height balanced trees; performance; search; traceback; trees (mathematics)", 17665 keywords = "information retrieval systems; mathematical techniques", 17666 treatment = "A Application; T Theoretical or Mathematical", 17667 } 17668 17669 @Article{Florentin:1976:IRC, 17670 author = "J. J. Florentin", 17671 title = "Information Reference Coding", 17672 journal = j-CACM, 17673 volume = "19", 17674 number = "1", 17675 pages = "29--33", 17676 month = jan, 17677 year = "1976", 17678 CODEN = "CACMA2", 17679 ISSN = "0001-0782", 17680 bibdate = "Tue Mar 25 13:26:09 MST 1997", 17681 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib", 17682 abstract = "Items in business systems have to be identified by reference codes, which can later be used as data codes and file keys in an associated data processing system. In business systems associated with large collections of integrated files (databases) it is vital to assign codes in a methodical way so as to control future extension and changes while maintaining correct program action. The principles of methodical coding are discussed, and the way in which logical connections between data items must be reflected in the reference code framework is shown through a set-theoretic information model.", 17683 acknowledgement = ack-nhfb, 17684 annote = "Codes to denote associative tuples.", 17685 classcodes = "C6120 (File organisation); C6130 (Data handling techniques)", 17686 classification = "723", 17687 corpsource = "Birkbeck Coll., Univ. of London, London, UK", 17688 journalabr = "Commun ACM", 17689 keywords = "business systems; data codes; data handling; data processing system; data processing, business; databases; file keys; file organisation; information model; integrated files; logical connections; methodical coding; reference codes", 17690 treatment = "P Practical", 17691 } 17692 17693 @Article{Litecky:1976:SEE, 17694 author = "Charles R. Litecky and Gordon B. Davis", 17695 title = "Study of Errors, Error-Proneness, and Error Diagnosis in {Cobol}", 17696 journal = j-CACM, 17697 volume = "19", 17698 number = "1", 17699 pages = "33--37", 17700 month = jan, 17701 year = "1976", 17702 CODEN = "CACMA2", 17703 ISSN = "0001-0782", 17704 bibdate = "Tue Mar 25 13:26:09 MST 1997", 17705 bibsource = "Compendex database", 17706 abstract = "This paper provides data on Cobol error frequency for correction of errors in student-oriented compilers, improvement of teaching, and changes in programming language. Cobol was studied because of economic importance, widespread usage, possible error-inducing design, and lack of research.", 17707 acknowledgement = ack-nhfb, 17708 classcodes = "C6110 (Systems analysis and programming); C6140D (High level languages); C6150G (Diagnostic, testing, debugging and evaluating systems)", 17709 classification = "723", 17710 corpsource = "Univ. of Wisconsin, Madison, WI, USA", 17711 journalabr = "Commun ACM", 17712 keywords = "COBOL; computer programming languages; error diagnosis; errors; misspellings; program diagnostics; programming", 17713 treatment = "P Practical", 17714 } 17715 17716 @Article{Knuth:1976:EAB, 17717 author = "Donald E. Knuth", 17718 title = "Errata: {``Ancient Babylonian algorithms''}", 17719 journal = j-CACM, 17720 volume = "19", 17721 number = "2", 17722 month = feb, 17723 year = "1976", 17724 CODEN = "CACMA2", 17725 ISSN = "0001-0782", 17726 MRclass = "108.01A15", 17727 MRnumber = "52 13133", 17728 bibdate = "Tue Dec 26 13:35:07 1995", 17729 note = "See \cite{Knuth:1972:ABA}.", 17730 acknowledgement = ack-nhfb, 17731 } 17732 17733 @Article{Bochmann:1976:SEL, 17734 author = "Gregor V. Bochmann", 17735 title = "Semantic Evaluation from Left to Right", 17736 journal = j-CACM, 17737 volume = "19", 17738 number = "2", 17739 pages = "55--62", 17740 month = feb, 17741 year = "1976", 17742 CODEN = "CACMA2", 17743 ISSN = "0001-0782", 17744 MRclass = "68A30", 17745 MRnumber = "55 13879", 17746 mrreviewer = "V. N. Agafonov", 17747 bibdate = "Tue Mar 25 13:26:09 MST 1997", 17748 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Compiler/AG.bib; ftp://ftp.ira.uka.de/pub/bibliography/Database/dbase.bib", 17749 abstract = "This paper describes attribute grammars and their use for the definition of programming languages and compilers; a formal definition of attribute grammars and a discussion of some of its important aspects are included. The paper concentrates on the evaluation of semantic attributes in a few passes from left to right over the derivation tree of a program. A condition for an attribute grammar is given which assures that the semantics of any program can be evaluated in a single pass over the derivation tree, and an algorithm is discussed which decides how many passes from left to right are in general necessary, given the attribute grammar. These notions are explained in terms of an example grammar which describes the scope rules of Algol 60. Practical questions, such as the relative efficiency of different evaluation schemes, and the ease of adapting the attribute grammar of a given programming language to the left-to-right evaluation scheme are discussed.", 17750 acknowledgement = ack-nhfb, 17751 classcodes = "C4210 (Formal logic)", 17752 classification = "723", 17753 corpsource = "Univ. of Montreal, Montreal, Que., Canada", 17754 journalabr = "Commun ACM", 17755 keywords = "Algol 60; attribute grammars; compilers; computer programming languages; context free grammar; context-free grammars; context-free languages; derivation tree; eval class; left to right; multipass; programming languages; semantic attributes", 17756 treatment = "T Theoretical or Mathematical", 17757 } 17758 17759 @Article{Rivest:1976:SOS, 17760 author = "Ronald L. Rivest", 17761 title = "On Self-Organizing Sequential Search Heuristics", 17762 journal = j-CACM, 17763 volume = "19", 17764 number = "2", 17765 pages = "63--67", 17766 month = feb, 17767 year = "1976", 17768 CODEN = "CACMA2", 17769 ISSN = "0001-0782", 17770 MRclass = "68A10 (68A20)", 17771 MRnumber = "53 12068", 17772 mrreviewer = "Robert Wagner", 17773 bibdate = "Tue Mar 25 13:26:09 MST 1997", 17774 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib", 17775 abstract = "This paper examines a class of heuristics for maintaining a sequential list in approximately optimal order with respect to the average time required to search for a specified element, assuming that each element is searched for with a fixed probability independent of previous searches performed. The ``move to front'' and ``transposition'' heuristics are shown to be optimal to within a constant factor, and the transposition rule is shown to be the more efficient of the two. Empirical evidence suggests that transposition is in fact optimal for any distribution of search probabilities.", 17776 acknowledgement = ack-nhfb, 17777 classcodes = "B0250 (Combinatorial mathematics); C1160 (Combinatorial mathematics); C6120 (File organisation); C6130 (Data handling techniques)", 17778 classification = "723; 922", 17779 corpsource = "MIT, Cambridge, MA, USA", 17780 journalabr = "Commun ACM", 17781 keywords = "computer systems programming; probability", 17782 keywords = "combinatorial mathematics; list processing; rule; self organising; sequential search heuristics; sorting; transposition", 17783 treatment = "T Theoretical or Mathematical", 17784 } 17785 17786 @Article{Ives:1976:PEF, 17787 author = "F. M. Ives", 17788 title = "Permutation Enumeration: Four New Permutation Algorithms", 17789 journal = j-CACM, 17790 volume = "19", 17791 number = "2", 17792 pages = "68--72", 17793 month = feb, 17794 year = "1976", 17795 CODEN = "CACMA2", 17796 ISSN = "0001-0782", 17797 bibdate = "Tue Mar 25 13:26:09 MST 1997", 17798 bibsource = "Compendex database", 17799 abstract = "Classical permutation enumeration algorithms encounter special cases requiring additional computation every nth permutation when generating the n! permutations on n marks. Four new algorithms have the attribute that special cases occur every n(n minus 1) permutations. Two of the algorithms produce the next permutation with a single exchange of two marks. The other two algorithms infrequently exchange more than two marks, but the rules for generating the next permutation are very simple. Performance tests which have counted execution of assignment statements, comparisons, arithmetic operations, and subscripted array references have shown superiority of the new algorithms compared to Boothroyd's implementation of M. B. Wells' algorithm and Erlich's implementation of the Johnson-Trotter algorithm.", 17800 acknowledgement = ack-nhfb, 17801 classcodes = "B0250 (Combinatorial mathematics); C1160 (Combinatorial mathematics)", 17802 classification = "723", 17803 corpsource = "Western Washington State Coll., Bellingham, WA, USA", 17804 journalabr = "Commun ACM", 17805 keywords = "combinatorial mathematics; computer programming; enumeration; loop free algorithms; permutation", 17806 treatment = "A Application; T Theoretical or Mathematical", 17807 } 17808 17809 @Article{Martelli:1976:AHS, 17810 author = "Alberto Martelli", 17811 title = "Application of Heuristic Search Methods to Edge and Contour Detection", 17812 journal = j-CACM, 17813 volume = "19", 17814 number = "2", 17815 pages = "73--83", 17816 month = feb, 17817 year = "1976", 17818 CODEN = "CACMA2", 17819 ISSN = "0001-0782", 17820 bibdate = "Tue Mar 25 13:26:09 MST 1997", 17821 bibsource = "Compendex database", 17822 abstract = "This paper presents a method for detecting edges and contours in noisy pictures. The properties of an edge are embedded in a figure of merit and the edge detection problem becomes the problem of minimizing the given figure of merit. This problem can be represented as a shortest path problem on a graph and can be solved using well-known graph search algorithms. The relations between this representation of the minimization problem and a dynamic programming approach are discussed, showing that the graph search method can lead to substantial improvements in computing time. Moreover, if heuristic search methods are used, the computing time will depend on the amount of noise in the picture. Some experimental results are given; these show how various information about the shape of the contour of an object can be embedded in the figure of merit, thus allowing the extraction of contours from noisy pictures and the separation of touching objects.", 17823 acknowledgement = ack-nhfb, 17824 classcodes = "B0260 (Optimisation techniques); B6140C (Optical information, image and video signal processing); C1180 (Optimisation techniques); C1230 (Artificial intelligence); C1250 (Pattern recognition); C5530 (Pattern recognition and computer vision equipment); C7490 (Computing in other engineering fields)", 17825 classification = "723; 921", 17826 corpsource = "Istituto di Elaborazione della Informazione Consiglio Nazionale delle Ricerche, Piza, Italy", 17827 journalabr = "Commun ACM", 17828 keywords = "contours; dynamic programming; edge and contour detection; extraction of; heuristic programming; heuristic search; image processing; mathematical programming, dynamic; noisy; pattern; pattern recognition; pattern recognition systems; picture processing; pictures; problem; recognition; shortest path; solving", 17829 treatment = "A Application; T Theoretical or Mathematical", 17830 } 17831 17832 @Article{Siler:1976:SEM, 17833 author = "Kenneth F. Siler", 17834 title = "A Stochastic Evaluation Model for Database Organizations in Data Retrieval Systems", 17835 journal = j-CACM, 17836 volume = "19", 17837 number = "2", 17838 pages = "84--95", 17839 month = feb, 17840 year = "1976", 17841 CODEN = "CACMA2", 17842 ISSN = "0001-0782", 17843 bibdate = "Tue Mar 25 13:26:09 MST 1997", 17844 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Database/Graefe.bib", 17845 abstract = "This paper discusses a simulation model of a data retrieval system which has the effect of significantly reducing the cost of experimentation and enabling research never attempted before. The model is designed to estimate the retrieval workload of alternative data retrieval systems. These data retrieval systems can be organized under several database organizations, including inverted list, threaded list, and cellular list organizations and hybrid combinations of these systems. Effectiveness of the methodology is demonstrated by using the model to study the effect of database organizations in data retrieval systems.", 17846 acknowledgement = ack-nhfb, 17847 classcodes = "C6120 (File organisation); C7250 (Information storage and retrieval)", 17848 classification = "723; 922", 17849 corpsource = "Univ. of California, Los Angeles, CA, USA", 17850 journalabr = "Commun ACM", 17851 keywords = "cellular list; data processing; data retrieval systems; database management systems; database organisations; information retrieval systems; inverted list; list; mathematical models; physical database design; simulation; stochastic evaluation model; stochastic processes; threaded", 17852 treatment = "P Practical", 17853 } 17854 17855 @Article{Fagin:1976:CEC, 17856 author = "Ronald Fagin", 17857 title = "A Counterintuitive Example of Computer Paging", 17858 journal = j-CACM, 17859 volume = "19", 17860 number = "2", 17861 pages = "96--97", 17862 month = feb, 17863 year = "1976", 17864 CODEN = "CACMA2", 17865 ISSN = "0001-0782", 17866 MRclass = "68A50", 17867 MRnumber = "55 7000a", 17868 mrreviewer = "W. Kwasowiec", 17869 bibdate = "Tue Mar 25 13:26:09 MST 1997", 17870 bibsource = "Compendex database", 17871 note = "See corrigendum \cite{Fagin:1976:CCE}.", 17872 abstract = "A counterexample is exhibited to a natural conjecture concerning the optimal way to group records into pages in the independent reference model of computer paging (an organization is said to be optimal if the ``least recently used'' miss ratio is minimized).", 17873 acknowledgement = ack-nhfb, 17874 classcodes = "C6120 (File organisation)", 17875 classification = "723", 17876 corpsource = "IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA", 17877 journalabr = "Commun ACM", 17878 keywords = "allocation; computer operating systems; computer paging; independent reference model; least recently; most likely together; record; storage organisation; used; virtual storage", 17879 treatment = "P Practical", 17880 } 17881 17882 @Article{Artzy:1976:FDT, 17883 author = "Ehud Artzy and James A. Hinds and Harry J. Saal", 17884 title = "A Fast Division Technique for Constant Divisors", 17885 journal = j-CACM, 17886 volume = "19", 17887 number = "2", 17888 pages = "98--101", 17889 month = feb, 17890 year = "1976", 17891 CODEN = "CACMA2", 17892 ISSN = "0001-0782", 17893 MRclass = "68A10 (10A10)", 17894 MRnumber = "54 1707", 17895 mrreviewer = "C. F. Kelemen", 17896 bibdate = "Tue Mar 25 13:26:09 MST 1997", 17897 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Compiler/Compiler.Lins.bib", 17898 abstract = "A fast algorithm for division by constant divisors is presented. The method has proved very useful implemented as microcode on a binary machine, and can be adapted directly into hardware. The mathematical foundations of the algorithm are presented as well as some performance measures.", 17899 acknowledgement = ack-nhfb, 17900 classcodes = "C5230 (Digital arithmetic methods)", 17901 classification = "723", 17902 corpsource = "State Univ. of New York, Buffalo, NY, USA", 17903 journalabr = "Commun ACM", 17904 keywords = "bit addressable memory; computer programming; constant divisors; digital arithmetic; fast division; microprogram", 17905 treatment = "A Application; T Theoretical or Mathematical", 17906 } 17907 17908 @Article{Newell:1976:CSE, 17909 author = "Allen Newell and Herbert A. Simon", 17910 title = "Computer Science as Empirical Inquiry: Symbols and Search", 17911 journal = j-CACM, 17912 volume = "19", 17913 number = "3", 17914 pages = "113--126", 17915 month = mar, 17916 year = "1976", 17917 CODEN = "CACMA2", 17918 ISSN = "0001-0782", 17919 MRclass = "68-01", 17920 MRnumber = "57 4555", 17921 bibdate = "Tue Mar 25 13:26:09 MST 1997", 17922 acknowledgement = ack-nhfb, 17923 classcodes = "C1230 (Artificial intelligence); C6130 (Data handling techniques)", 17924 corpsource = "Carnegie-Mellon Univ., Pittsburgh, PA, USA", 17925 keywords = "artificial intelligence; cognition; computer science; empirical inquiry; heuristic programming; heuristic search; list; list processing; physical symbol systems; problem solving; processing; symbols; Turing", 17926 treatment = "A Application; P Practical", 17927 } 17928 17929 @Article{Babad:1976:JPM, 17930 author = "Jair M. Babad and Mario M. Modiano", 17931 title = "Joining Policies in a Multipriority Multiclass Batch Computer System", 17932 journal = j-CACM, 17933 volume = "19", 17934 number = "3", 17935 pages = "127--136", 17936 month = mar, 17937 year = "1976", 17938 CODEN = "CACMA2", 17939 ISSN = "0001-0782", 17940 MRclass = "90B35 (68A99)", 17941 MRnumber = "53 7429", 17942 mrreviewer = "Erol Gelenbe", 17943 bibdate = "Tue Mar 25 13:26:09 MST 1997", 17944 bibsource = "Compendex database", 17945 abstract = "A multipriority batch computer system which users from several different classes may join, with toll, service, and waiting charges is formulated here as a semi-Markov decision process, in which the aim of arriving users is to minimize their expected loss. The optimal joining policy of arriving users who may join the system at some of its queues is a control limit policy, with a single control number for any possible queue and the user's class; a newly arriving user will join a queue that is not filled up to the control number corresponding to this queue and the user's class. In this paper control numbers, as well as lower and upper bounds for the control numbers and the capacities of the system's queues are derived.", 17946 acknowledgement = ack-nhfb, 17947 classcodes = "C6150J (Operating systems)", 17948 classification = "723; 922", 17949 corpsource = "Univ. of Chicago, Chicago, IL, USA", 17950 journalabr = "Commun ACM", 17951 keywords = "batch processing (computers); control number; data processing; Markov processes; multipriority batch computer system; operating system; operations; operations research; optimal joining policy; price; priority queues; probability --- Queueing Theory; research; scheduling; semi Markow process", 17952 treatment = "P Practical", 17953 } 17954 17955 @Article{Allen:1976:PDF, 17956 author = "F. E. Allen and J. Cocke", 17957 title = "A Program Data Flow Analysis Procedure", 17958 journal = j-CACM, 17959 volume = "19", 17960 number = "3", 17961 pages = "137--147 (or 137--146??)", 17962 month = mar, 17963 year = "1976", 17964 CODEN = "CACMA2", 17965 ISSN = "0001-0782", 17966 bibdate = "Tue Mar 25 13:26:09 MST 1997", 17967 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Parallel/Multi.bib", 17968 abstract = "The global data relationships in a program can be exposed and codified by the static analysis methods described in this paper. A procedure is given which determines all the definitions which can possibly ``reach'' each mode of the control flow graph of the program and all the definitions that are ``live'' on each edge of the graph. The procedure uses an ``interval'' ordered edge listing data structure and handles reducible and irreducible graphs indistinguishably.", 17969 acknowledgement = ack-nhfb, 17970 classcodes = "C4240 (Programming and algorithm theory)", 17971 classification = "723", 17972 corpsource = "IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA", 17973 journalabr = "Commun ACM", 17974 keywords = "compilers; data flow analysis; data processing; edge listing data; flow graphs; optimisation; program optimisation; programming theory; static analysis; structure", 17975 treatment = "A Application; T Theoretical or Mathematical", 17976 } 17977 17978 @Article{Minski:1976:IRP, 17979 author = "Naftaly Minski", 17980 title = "Intentional Resolution of Privacy Protection in Database Systems", 17981 journal = j-CACM, 17982 volume = "19", 17983 number = "3", 17984 pages = "148--159", 17985 month = mar, 17986 year = "1976", 17987 CODEN = "CACMA2", 17988 ISSN = "0001-0782", 17989 bibdate = "Sat Jan 18 15:28:23 1997", 17990 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib", 17991 abstract = "This paper is concerned with the control over what a user is allowed to do with a piece of information supplied to him by the database. The ability to condition the supply of information on its intended use is called here ``intentional resolution'' of privacy protection. The practical importance of intentional resolution is demonstrated by several examples, and its realization is discussed. It appears to be necessary for the database to impose a certain amount of control over the internal behavior of users' programs which interact with it. A model for user-database interaction which admits such a control is developed.", 17992 acknowledgement = ack-nhfb, 17993 classification = "723", 17994 journalabr = "Commun ACM", 17995 keywords = "data processing", 17996 } 17997 17998 @Article{Naftaly:1976:IRP, 17999 author = "M. Naftaly", 18000 title = "Intentional resolution of privacy protection in database systems", 18001 journal = j-CACM, 18002 volume = "19", 18003 number = "3", 18004 pages = "148--159", 18005 month = mar, 18006 year = "1976", 18007 CODEN = "CACMA2", 18008 ISSN = "0001-0782", 18009 bibdate = "Tue Mar 25 13:26:09 MST 1997", 18010 acknowledgement = ack-nhfb, 18011 classcodes = "C0200 (General computer topics); C6120 (File organisation); C7100 (Business and administration)", 18012 corpsource = "Rutgers Univ., New Brunswick, NJ, USA", 18013 keywords = "data base systems; database management systems; intentional; interaction with databases; privacy protection; protection in programming languages; resolution; security; security of data", 18014 treatment = "P Practical", 18015 } 18016 18017 @Article{Smoot:1976:DIS, 18018 author = "O. R. Smoot", 18019 title = "Development of an international system for legal protection of computer programs", 18020 journal = j-CACM, 18021 volume = "19", 18022 number = "4", 18023 pages = "171--174", 18024 month = apr, 18025 year = "1976", 18026 CODEN = "CACMA2", 18027 ISSN = "0001-0782", 18028 bibdate = "Tue Mar 25 13:26:09 MST 1997", 18029 acknowledgement = ack-nhfb, 18030 classcodes = "C0200 (General computer topics)", 18031 corpsource = "Computer and Business Equipment Mfg. Assoc., Washington, DC, USA", 18032 keywords = "computer programs; informal report; international system; legal protection; legislation; market data; security of data; software protection; technological predictions", 18033 treatment = "G General Review; P Practical", 18034 } 18035 18036 @Article{Lientz:1976:CEV, 18037 author = "Bennet P. Lientz", 18038 title = "A comparative evaluation of versions of {BASIC}", 18039 journal = j-CACM, 18040 volume = "19", 18041 number = "4", 18042 pages = "175--181", 18043 month = apr, 18044 year = "1976", 18045 CODEN = "CACMA2", 18046 ISSN = "0001-0782", 18047 bibdate = "Tue Mar 25 13:26:09 MST 1997", 18048 bibsource = "Compendex database", 18049 abstract = "From its inception, the BASIC language has grown in terms of its usage, scope of usage, and its features. This article compares ten of the current versions of BASIC with each other, with two earlier versions, and with the proposed standard for minimal BASIC. The comparison is arranged by the features of the versions and by computational comparison of computation and times and processing costs.", 18050 acknowledgement = ack-nhfb, 18051 classcodes = "C6140D (High level languages); C6150G (Diagnostic, testing, debugging and evaluating systems)", 18052 classification = "723", 18053 corpsource = "Univ. of California, Los Angeles, CA, USA", 18054 journalabr = "Commun ACM", 18055 keywords = "BASIC; computer programming languages; interpretive language summary", 18056 treatment = "P Practical", 18057 } 18058 18059 @Article{Raymond:1976:LLA, 18060 author = "J. Raymond", 18061 title = "{LG}: {A} language for analytic geometry", 18062 journal = j-CACM, 18063 volume = "19", 18064 number = "4", 18065 pages = "182--187", 18066 month = apr, 18067 year = "1976", 18068 CODEN = "CACMA2", 18069 ISSN = "0001-0782", 18070 MRclass = "50-04 50D15 68A05", 18071 MRnumber = "57 7341", 18072 mrreviewer = "Wolfgang Bohm", 18073 bibdate = "Tue Mar 25 13:26:09 MST 1997", 18074 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Graphics/imager/imager.76.bib", 18075 abstract = "A conversational programming language for analytic geometry is described, together with some aspects of its implementation. The language allows the flexible definition of geometric objects and elements, computes their parameters, and displays the results. It also provides the capability of specifying a geometric figure via a collection of parameters and displaying various loci corresponding to these parameters. A third characteristic consists of the possibility of using this language to design other user oriented languages. LG has been specifically designed for use by nonprogrammers; it is easy to learn and very close to the natural language used in geometry.", 18076 acknowledgement = ack-nhfb, 18077 classcodes = "C5540 (Terminals and graphic displays); C6140D (High level languages)", 18078 classification = "723", 18079 corpsource = "Univ. of Ottawa, Ottawa, Ont., Canada", 18080 journalabr = "Commun ACM", 18081 keywords = "analytic geometry; computer; computer graphics; computer programming languages; conventional programming language; geometry; graphics; interactive programming; LG; problem oriented language; problem oriented languages", 18082 treatment = "P Practical", 18083 } 18084 18085 @Article{Fagin:1976:CCE, 18086 author = "Ronald Fagin", 18087 title = "Corrigendum: {``A Counterintuitive Example of Computer Paging''}", 18088 journal = j-CACM, 18089 volume = "19", 18090 number = "4", 18091 pages = "187", 18092 month = apr, 18093 year = "1976", 18094 CODEN = "CACMA2", 18095 ISSN = "0001-0782", 18096 MRclass = "68A50", 18097 MRnumber = "55 7000b", 18098 mrreviewer = "W. Kwasowiec", 18099 bibdate = "Tue Dec 26 13:35:07 1995", 18100 note = "See \cite{Fagin:1976:CEC}.", 18101 acknowledgement = ack-nhfb, 18102 } 18103 18104 @Article{Katz:1976:LAP, 18105 author = "Shmuel Katz and Zohar Manna", 18106 title = "Logical Analysis of Programs", 18107 journal = j-CACM, 18108 volume = "19", 18109 number = "4", 18110 pages = "188--206", 18111 month = apr, 18112 year = "1976", 18113 CODEN = "CACMA2", 18114 ISSN = "0001-0782", 18115 MRclass = "68A05", 18116 MRnumber = "56 17183", 18117 bibdate = "Tue Mar 25 13:26:09 MST 1997", 18118 bibsource = "Compendex database", 18119 abstract = "Most present systems for verification of computer programs are incomplete in that intermediate inductive assertions must be provided manually by the user, termination is not proven, and incorrect programs are not treated. As a unified solution to these problems, this paper suggests conducting a logical analysis of programs by using invariants which express what is actually occurring in the program. Techniques for the automatic generation of invariants are examined. Criteria for using the invariants to check simultaneously for correctness (including termination) or incorrectness are provided. Implications of the approach for the automatic diagnosis and correction of logical errors are discussed.", 18120 acknowledgement = ack-nhfb, 18121 classcodes = "C6150G (Diagnostic, testing, debugging and evaluating systems)", 18122 classification = "723; 921", 18123 corpsource = "Weizmann Inst. of Sci., Rehovoth, Israel", 18124 journalabr = "Commun ACM", 18125 keywords = "automatic diagnosis; computer programming languages; correctness; incorrectness; invariants; logical analysis; mathematical techniques; program debugging; program testing; program verification", 18126 treatment = "P Practical", 18127 } 18128 18129 @Article{Denning:1976:LMS, 18130 author = "Dorothy E. Denning", 18131 title = "A Lattice Model of Secure Information Flow", 18132 journal = j-CACM, 18133 volume = "19", 18134 number = "5", 18135 pages = "236--243", 18136 month = may, 18137 year = "1976", 18138 CODEN = "CACMA2", 18139 ISSN = "0001-0782", 18140 MRclass = "68A25", 18141 MRnumber = "55 1821", 18142 mrreviewer = "George I. Davida", 18143 bibdate = "Tue Mar 25 13:26:09 MST 1997", 18144 bibsource = "Compendex database", 18145 note = "Papers from the Fifth ACM Symposium on Operating Systems Principles (Univ. Texas, Austin, Tex., 1975).", 18146 abstract = "Mechanisms that guarantee secure information flow in a computer system are discussed. These mechanisms are examined within a mathematical framework suitable for formulating the requirements of secure information flow among security classes. The central component of the model is a lattice structure derived from the security classes and justified by the semantics of information flow. The model provides a unifying view of all systems that restrict information flow, enables a classification of them according to security objectives, and suggests some new approaches. It also leads to the construction of automatic program certification mechanisms for verifying the secure flow of information through a program.", 18147 acknowledgement = ack-nhfb, 18148 classcodes = "C0200 (General computer topics); C6120 (File organisation); C6150J (Operating systems)", 18149 classification = "722; 723", 18150 corpsource = "Purdue Univ., Lafayette, IN, USA", 18151 journalabr = "Commun ACM", 18152 keywords = "computer operating systems; data processing; lattice; mathematical models; program certification; secure information flow; security; security classes; security of data", 18153 treatment = "A Application; T Theoretical or Mathematical", 18154 } 18155 18156 @Article{Millen:1976:SKV, 18157 author = "Jonathan K. Millen", 18158 title = "Security Kernel Validation in Practice", 18159 journal = j-CACM, 18160 volume = "19", 18161 number = "5", 18162 pages = "243--250", 18163 month = may, 18164 year = "1976", 18165 CODEN = "CACMA2", 18166 ISSN = "0001-0782", 18167 bibdate = "Tue Mar 25 13:26:09 MST 1997", 18168 bibsource = "Compendex database", 18169 abstract = "A security kernel is a software and hardware mechanism that enforces access controls within a computer system. The correctness of a security kernel on a PDP-11\slash 45 is being proved. This paper describes the technique used to carry out the first step of the proof: validating a formal specification of the program with respect to axioms for a secure system. Application of the kernel will be in providing normally responsive multiprogrammed or time-shared service to computer system users, while restricting access to data to those users with permission for it.", 18170 acknowledgement = ack-nhfb, 18171 classcodes = "C6120 (File organisation); C6150J (Operating systems)", 18172 classification = "722; 723", 18173 corpsource = "MITRE Corp., Bedford, MA, USA", 18174 journalabr = "Commun ACM", 18175 keywords = "computer operating systems; computer systems, digital --- Time Sharing; correctness; data processing; formal specification; operating systems (computers); protection; security kernel; security of data; validation; verification", 18176 treatment = "P Practical", 18177 } 18178 18179 @Article{Lampson:1976:ROS, 18180 author = "Butler W. Lampson and Howard E. Sturgis", 18181 title = "Reflections on an Operating System Design", 18182 journal = j-CACM, 18183 volume = "19", 18184 number = "5", 18185 pages = "251--265", 18186 month = may, 18187 year = "1976", 18188 CODEN = "CACMA2", 18189 ISSN = "0001-0782", 18190 bibdate = "Tue Mar 25 13:26:09 MST 1997", 18191 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Misc/os.bib", 18192 abstract = "The main features of a general purpose multiaccess operating system developed for the CDC 6400 at Berkeley are presented, and its good and bad points are discussed as they appear in retrospect. Distinctive features of the design were the use of capabilities for protection, and the organization of the system into a sequence of layers, each building on the facilities provided by earlier ones and protecting itself from the malfunctions of later ones. There were serious problems in maintaining the protection between layers when levels were added to the memory hierarchy. These problems are discussed and a new solution is described.", 18193 acknowledgement = ack-nhfb, 18194 classcodes = "C6120 (File organisation); C6150J (Operating systems)", 18195 classification = "723", 18196 corpsource = "Xerox Palo Alto Res. Center, Palo Alto, CA, USA", 18197 journalabr = "Commun ACM", 18198 keywords = "capabilities; CDC 6400; computer operating systems; faults; hierarchy; layering domains; memory; memory hierarchy; operating system; operating systems (computers); protection; security of data; sharing programs; time-", 18199 treatment = "P Practical", 18200 } 18201 18202 @Article{Habermann:1976:MHF, 18203 author = "A. N. Habermann and Lawrence Flon and Lee Cooprider", 18204 title = "Modularization and Hierarchy in a Family of Operating Systems", 18205 journal = j-CACM, 18206 volume = "19", 18207 number = "5", 18208 pages = "266--272", 18209 month = may, 18210 year = "1976", 18211 CODEN = "CACMA2", 18212 ISSN = "0001-0782", 18213 bibdate = "Tue Mar 25 13:26:09 MST 1997", 18214 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Misc/os.bib", 18215 abstract = "This paper describes the design philosophy used in the construction of a family of operating systems. Fundamental to the design are the concepts of level and module. Further, the system design is structured hierarchically based upon functions. Family members can share much of the software as a result of the implementation of run-time modules at the lowest system level. The system is expected to produce several family members --- including batch and timesharing system --- with widely differing storage management strategies.", 18216 acknowledgement = ack-nhfb, 18217 classcodes = "C6120 (File organisation); C6150J (Operating systems)", 18218 classification = "723", 18219 corpsource = "Carnegie-Mellon Univ., Pittsburgh, PA, USA", 18220 journalabr = "Commun ACM", 18221 keywords = "address space; computer operating systems; data; incremental machine design; module; operating systems; operating systems (computers); type; virtual memory; virtual storage", 18222 treatment = "P Practical", 18223 } 18224 18225 @Article{Howard:1976:PM, 18226 author = "John H. Howard", 18227 title = "Proving Monitors", 18228 journal = j-CACM, 18229 volume = "19", 18230 number = "5", 18231 pages = "273--279 (or 273--278??)", 18232 month = may, 18233 year = "1976", 18234 CODEN = "CACMA2", 18235 ISSN = "0001-0782", 18236 bibdate = "Tue Mar 25 13:26:09 MST 1997", 18237 bibsource = "Compendex database", 18238 abstract = "Monitors are devices for defining shared abstract objects in a multiprogramming system and for scheduling access to them. It is shown that scheduling and sequential properties of monitors can be proved by using state variables which record the monitors' history and by defining extended proof rules for their wait and signal operations. These two techniques are defined, discussed, and applied to examples to prove properties such as freedom from indefinitely repeated overtaking or unnecessary waiting, upper bounds on queue lengths, and historical behavior.", 18239 acknowledgement = ack-nhfb, 18240 classcodes = "C6120 (File organisation); C6150J (Operating systems)", 18241 classification = "723", 18242 corpsource = "Univ. of Texas, Austin, TX, USA", 18243 journalabr = "Commun ACM", 18244 keywords = "alarm; bounded buffer; clocks; computer metatheory; computer operating systems; computer systems programming --- Multiprogramming; concurrency; correctness; disc head; historical; monitors; multiprogramming; operating systems (computers); proof rules; scheduling; semaphores; variables", 18245 treatment = "P Practical", 18246 } 18247 18248 @Article{Owicki:1976:VPP, 18249 author = "Susan Owicki and David Gries", 18250 title = "Verifying Properties of Parallel Programs: An Axiomatic Approach", 18251 journal = j-CACM, 18252 volume = "19", 18253 number = "5", 18254 pages = "279--285", 18255 month = may, 18256 year = "1976", 18257 CODEN = "CACMA2", 18258 ISSN = "0001-0782", 18259 MRclass = "68A05 (68A40)", 18260 MRnumber = "55 6925", 18261 mrreviewer = "Derek C. Oppen", 18262 bibdate = "Tue Mar 25 13:26:09 MST 1997", 18263 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Parallel/Multi.bib", 18264 note = "Papers from the {Fifth {ACM} Symposium on Operating Systems Principles (Univ. Texas, Austin, Tex., 1975)}.", 18265 abstract = "An axiomatic method for proving a number of properties of parallel programs is presented. A deductive system which is in some sense complete for partial correctness is defined. A crucial axiom provides for the use of auxiliary variables, which are added to a parallel program as an aid to proving it correct. The information in a partial correctness proof can be used to prove such properties as mutual exclusion, freedom from deadlock, and program termination. Techniques for verifying these properties are presented and illustrated by application to the dining philosophers problem. The language and axioms offered give guides for the construction of correct and comprehensible programs.", 18266 acknowledgement = ack-nhfb, 18267 classcodes = "C6150G (Diagnostic, testing, debugging and evaluating systems); C6150J (Operating systems)", 18268 classification = "723", 18269 corpsource = "Computer Sci. Dept., Cornell Univ., Ithaca, NY, USA", 18270 journalabr = "Commun ACM", 18271 keywords = "axiomatic method; computer metatheory; computer operating systems; computer systems programming; concurrent processes; correctness proofs; deadlock; multiprogramming; mutual exclusion; parallel processing; parallel programs; program testing; program verification; structured; synchronisation", 18272 treatment = "P Practical", 18273 } 18274 18275 @Article{Madison:1976:CPL, 18276 author = "A. Wayne Madison and Alan P. Batson", 18277 title = "Characteristics of Program Localities", 18278 journal = j-CACM, 18279 volume = "19", 18280 number = "5", 18281 pages = "285--294", 18282 month = may, 18283 year = "1976", 18284 CODEN = "CACMA2", 18285 ISSN = "0001-0782", 18286 bibdate = "Tue Mar 25 13:26:09 MST 1997", 18287 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Misc/os.bib", 18288 abstract = "The term ``locality'' is used to denote that subset of a program's segments which are referenced during a particular phase of its execution. In this paper the concept of a locality is made more explicit through a formal definition of what constitutes a phase of localized reference behavior, and by a corresponding mechanism for the detection of localities in actual reference strings. This definition provides for the existence of a hierarchy of localities at any given time. empirical data from a sample of production Algol 60 programs is used to display distributions of locality sizes and lifetimes. These results are discussed in terms of their implications for the modeling of program behavior and memory management in virtual memory systems.", 18289 acknowledgement = ack-nhfb, 18290 classcodes = "C6120 (File organisation); C6150G (Diagnostic, testing, debugging and evaluating systems)", 18291 classification = "723", 18292 corpsource = "Dept. of Appl. Math. and Computer Sci., Univ. of Virginia, Charlottesville, VA, USA", 18293 journalabr = "Commun ACM", 18294 keywords = "bounded locality intervals; computer operating systems; computer programming languages; locality; memory; memory management; program behaviour; storage management; virtual; virtual storage", 18295 treatment = "P Practical", 18296 } 18297 18298 @Article{Prieve:1976:VOV, 18299 author = "Barton G. Prieve and R. S. Fabry", 18300 title = "{VMIN} --- an Optimal Variable-Space Page Replacement Algorithm", 18301 journal = j-CACM, 18302 volume = "19", 18303 number = "5", 18304 pages = "295--297", 18305 month = may, 18306 year = "1976", 18307 CODEN = "CACMA2", 18308 ISSN = "0001-0782", 18309 bibdate = "Tue Mar 25 13:26:09 MST 1997", 18310 bibsource = "Compendex database", 18311 abstract = "A criterion for comparing variable space page replacement algorithms is presented. An optimum page replacement algorithm, called VMIN, is described and shown to be optimum with respect to this criterion. The results of simulating VMIN, Denning's working set, and the page partitioning replacement algorithms on five virtual memory programs are presented to demonstrate the improvement possible over the known realizable variable space algorithms.", 18312 acknowledgement = ack-nhfb, 18313 classcodes = "C6120 (File organisation)", 18314 classification = "723", 18315 corpsource = "Bell Labs., Naperville, IL, USA", 18316 journalabr = "Commun ACM", 18317 keywords = "computer operating systems; computer systems programming --- Supervisory and Executive Programs; demand paging; multilevel memory; optimal page replacement; page replacement algorithms; performance measurement; systems; virtual memory programs; virtual storage; VMIN; working set", 18318 } 18319 18320 @Article{Chu:1976:APR, 18321 author = "Wesley W. Chu and Holger Opderbeck", 18322 title = "Analysis of the {PFF} Replacement Algorithm via a {Semi-Markov} Model", 18323 journal = j-CACM, 18324 volume = "19", 18325 number = "5", 18326 pages = "298--304", 18327 month = may, 18328 year = "1976", 18329 CODEN = "CACMA2", 18330 ISSN = "0001-0782", 18331 MRclass = "68A50", 18332 MRnumber = "54 9194", 18333 mrreviewer = "U. M. Von Maydell", 18334 bibdate = "Tue Mar 25 13:26:09 MST 1997", 18335 bibsource = "Compendex database", 18336 note = "Papers from the Fifth ACM Symposium on Operating Systems Principles (Univ. Texas, Austin, Tex., 1975). See corrigendum \cite{Chu:1976:CAP}.", 18337 abstract = "An analytical model is presented to estimate the performance of the Page Fault Frequency (PFF) replacement algorithm. In this model, program behavior is represented by the LRU stack distance model and the PFF replacement algorithm is represented by a semi-Markov model. Using these models, such parameters as the inter-page-fault interval distribution, the probability of the number of distinct pages being referenced during an inter-page-fault interval, etc., may be analytically determined. Using these models to evaluate these parameter values permits study of the performance of the replacement algorithm by simulating the page fault events rather than every page reference event. This significantly reduces the required computation time in estimating the performance of the PFF algorithm.", 18338 acknowledgement = ack-nhfb, 18339 classcodes = "C6120 (File organisation)", 18340 classification = "723", 18341 corpsource = "Univ. of California, Los Angeles, CA, USA", 18342 journalabr = "Commun ACM", 18343 keywords = "behaviour; computer operating systems; computer systems programming --- Supervisory and Executive Programs; mathematical models; of replacement algorithm; page fault events; Page Fault Frequency; PFF replacement algorithm; program; semi Markov model; simulation; virtual storage", 18344 treatment = "P Practical", 18345 } 18346 18347 @Article{Taulbee:1976:PEP, 18348 author = "O. E. Taulbee and S. D. Conte", 18349 title = "Production and employment of {Ph.D.}'s in computer science", 18350 journal = j-CACM, 18351 volume = "19", 18352 number = "6", 18353 pages = "311--313", 18354 month = jun, 18355 year = "1976", 18356 CODEN = "CACMA2", 18357 ISSN = "0001-0782", 18358 bibdate = "Tue Mar 25 13:26:09 MST 1997", 18359 acknowledgement = ack-nhfb, 18360 classcodes = "C0200 (General computer topics)", 18361 corpsource = "Univ. of Pittsburgh, Pittsburgh, PA, USA", 18362 keywords = "computer science; employment; faculty; production; salaries", 18363 treatment = "P Practical", 18364 } 18365 18366 @Article{Severance:1976:PGA, 18367 author = "Dennis G. Severance and Ricardo A. Duhne", 18368 title = "A Practitioner's Guide to Addressing Algorithms", 18369 journal = j-CACM, 18370 volume = "19", 18371 number = "6", 18372 pages = "314--326", 18373 month = jun, 18374 year = "1976", 18375 CODEN = "CACMA2", 18376 ISSN = "0001-0782", 18377 bibdate = "Tue Mar 25 13:26:09 MST 1997", 18378 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib and ftp://ftp.ira.uka.de/pub/bibliography/Object/Nierstrasz.bib", 18379 abstract = "This paper consolidates a number of popular rules of thumb which have been suggested for the design of record addressing algorithms, and discusses the applicability of these rules to large commercial databases. Guidelines for selecting identifier transformations, overflow techniques, loading factors, bucket sizes, and loading order are considered. Particular attention is focused on the reasonableness of common heuristics for determining primary or secondary bucket sizes. A mathematical model which explicitly considers storage device characteristics and time\slash space cost tradeoffs is used to analyze the effect of design parameters on overall system costs. A specific design example is presented and solved.", 18380 acknowledgement = ack-nhfb, 18381 annote = "This paper consolidates a number of popular rules of thumb which have been suggested for the design of record addressing algorithms, and discusses the applicability of these rules to large commercial databases.", 18382 classcodes = "C6120 (File organisation); C7100 (Business and administration)", 18383 classification = "823; 901", 18384 corpsource = "Cornell Univ., Ithaca, NY, USA", 18385 journalabr = "Commun ACM", 18386 keywords = "bucket; computer systems programming --- Utility Programs; data management; data processing; database management systems; file organisation; file retrieval; functions; hashing; information; information retrieval systems --- Evaluation; loading factors; record addressing; retrieval; rules of thumb; searching; sizes; synonym resolution", 18387 treatment = "A Application; E Economic; P Practical", 18388 } 18389 18390 @Article{Baskett:1976:IMC, 18391 author = "Forest Baskett and Alan Jay Smith", 18392 title = "Interference in Multiprocessor Computer Systems with Interleaved Memory", 18393 journal = j-CACM, 18394 volume = "19", 18395 number = "6", 18396 pages = "327--334", 18397 month = jun, 18398 year = "1976", 18399 CODEN = "CACMA2", 18400 ISSN = "0001-0782", 18401 bibdate = "Tue Mar 25 13:26:09 MST 1997", 18402 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Parallel/Multi.bib", 18403 abstract = "The memory interference caused by several processors simultaneously using several memory modules is analyzed. Exact results are computed for a simple model of such a system. The limiting value is derived for the relative degree of memory interference as the system size increases. The assumptions and results of the simple model are tested against some measurements of program behavior and simulations of systems using memory references from real programs. The model results provide a good indication of the performance that should be expected from real systems of this type.", 18404 acknowledgement = ack-nhfb, 18405 classcodes = "C4290 (Other computer theory); C5400 (Analogue and digital computers and systems)", 18406 classification = "722", 18407 corpsource = "Stanford Univ., Stanford, CA, USA", 18408 journalabr = "Commun ACM", 18409 keywords = "computer systems; computer systems, digital; interference; interleaved memory; memory; multiprocessing; multiprocessing systems; multiprocessor; trace driven simulation", 18410 treatment = "A Application; T Theoretical or Mathematical", 18411 } 18412 18413 @Article{Frieder:1976:PDA, 18414 author = "Gideon Frieder and Harry J. Saal", 18415 title = "Process for the Determination of Addresses in Variable Length Addressing", 18416 journal = j-CACM, 18417 volume = "19", 18418 number = "6", 18419 pages = "335--338", 18420 month = jun, 18421 year = "1976", 18422 CODEN = "CACMA2", 18423 ISSN = "0001-0782", 18424 bibdate = "Tue Mar 25 13:26:09 MST 1997", 18425 bibsource = "Compendex database", 18426 abstract = "An algorithm is presented for the assignment of instruction addresses and formats under the following conditions: the length of the instruction varies as a function of the distance of the instruction from its target; there exists an optimality criterion which implies some preferential choices subject to the addressing constraints. This may be, for example, achieving the smallest number of long instructions, in which case the total code length is minimized, or minimizing the assigned address of a specified point in the program. The algorithm is suitable for arbitrary program structure and a choice of optimization criteria.", 18427 acknowledgement = ack-nhfb, 18428 classcodes = "C6110 (Systems analysis and programming); C6120 (File organisation)", 18429 classification = "723", 18430 corpsource = "IBM Israel Sci. Center, Haifa, Israel", 18431 journalabr = "Commun ACM", 18432 keywords = "assembler; computer operating systems; formats; instruction addresses; paging; programming; variable length addressing; virtual storage", 18433 treatment = "P Practical", 18434 } 18435 18436 @Article{Wise:1976:RLE, 18437 author = "David S. Wise", 18438 title = "Referencing Lists by an Edge", 18439 journal = j-CACM, 18440 volume = "19", 18441 number = "6", 18442 pages = "338--342", 18443 month = jun, 18444 year = "1976", 18445 CODEN = "CACMA2", 18446 ISSN = "0001-0782", 18447 bibdate = "Tue Mar 25 13:26:09 MST 1997", 18448 bibsource = "Compendex database", 18449 abstract = "An edge reference into a list structure is a pair of pointers to adjacent nodes. Such a reference often requires little additional space, but its use can yield efficient algorithms. For instance, a circular link between the ends of a list is redundant if the list is always referenced by that edge, and list traversal is easier when that link is null. Edge references also allow threading of nonrecursive lists, can replace some header cells, and enhance the famous exclusive-or trick to double-link lists.", 18450 acknowledgement = ack-nhfb, 18451 classcodes = "C6110 (Systems analysis and programming); C6120 (File organisation); C6130 (Data handling techniques)", 18452 classification = "723", 18453 corpsource = "Indiana Univ., Bloomington, IN, USA", 18454 journalabr = "Commun ACM", 18455 keywords = "circular link; computer programming --- Subroutines; computer programming languages; cursor; data structures; doubly linked; edge reference; header cells; list; list processing; list structure; overlapping sublist; pointer; traversal", 18456 treatment = "A Application; P Practical", 18457 } 18458 18459 @Article{Schumacher:1976:SAD, 18460 author = "Helmut Schumacher and Kenneth C. Sevcik", 18461 title = "The synthetic approach to decision table conversion", 18462 journal = j-CACM, 18463 volume = "19", 18464 number = "6", 18465 pages = "343--351", 18466 month = jun, 18467 year = "1976", 18468 CODEN = "CACMA2", 18469 ISSN = "0001-0782", 18470 bibdate = "Tue Mar 25 13:26:09 MST 1997", 18471 bibsource = "Compendex database", 18472 abstract = "Previous approaches to the problem of automatically converting decision tables to computer programs have been based on decomposition. An optimal program is located only through implicit enumeration of all possible decision trees using a technique such as branch-and-bound. The new approach described in this paper uses dynamic programming to synthesize an optimal decision tree from which a program can be created. Using this approach, the efficiency of creating an optimal program is increased substantially, permitting generation of optimal programs for decision tables with as many as ten to twelve conditions.", 18473 acknowledgement = ack-nhfb, 18474 classcodes = "C4240 (Programming and algorithm theory); C6110 (Systems analysis and programming)", 18475 classification = "723; 921", 18476 corpsource = "Univ. of Toronto, Toronto, Ont., Canada", 18477 journalabr = "Commun ACM", 18478 keywords = "computer systems programming; decision table conversion; decision tables; decision trees; dynamic programming; mathematical techniques --- Combinatorial Mathematics; optimal program; programming theory", 18479 treatment = "A Application; T Theoretical or Mathematical", 18480 } 18481 18482 @Article{Clark:1976:ELM, 18483 author = "Douglas W. Clark", 18484 title = "An Efficient List Moving Algorithm Using constant Workspace", 18485 journal = j-CACM, 18486 volume = "19", 18487 number = "6", 18488 pages = "352--354 (or 353--354??)", 18489 month = jun, 18490 year = "1976", 18491 CODEN = "CACMA2", 18492 ISSN = "0001-0782", 18493 bibdate = "Tue Mar 25 13:26:09 MST 1997", 18494 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Compiler/garbage.collection.bib", 18495 abstract = "An efficient algorithm is presented for moving arbitrary list structures, using no storage (apart from program variables) other than that required to hold the original list and the copy. The original list is destroyed as it is moved. No mark bits are necessary, but pointers to the copy must be distinguishable from pointers to the original. The algorithm is superior in execution speed to previous algorithms for the same problem. Some variations and extensions of the algorithm are discussed.", 18496 acknowledgement = ack-nhfb, 18497 classcodes = "C6120 (File organisation); C6130 (Data handling techniques)", 18498 classification = "723", 18499 corpsource = "Carnegie-Mellon Univ., Pittsburgh, PA, USA", 18500 journalabr = "Commun ACM", 18501 keywords = "complexity; computer programming --- Subroutines; computer programming languages; constant workspace; data processing --- Data Structures; LISP; list copying; list moving; list processing; space; storage management", 18502 treatment = "A Application; T Theoretical or Mathematical", 18503 } 18504 18505 @Article{Steele:1976:CMC, 18506 author = "Guy L. {Steele, Jr.}", 18507 title = "Corrigendum: {``Multiprocessing Compactifying Garbage Collection''}", 18508 journal = j-CACM, 18509 volume = "19", 18510 number = "6", 18511 pages = "354--354", 18512 month = jun, 18513 year = "1976", 18514 CODEN = "CACMA2", 18515 ISSN = "0001-0782", 18516 bibdate = "Sat Jan 18 15:29:03 1997", 18517 bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Theory/Seiferas/1976.bib", 18518 note = "See \cite{Steele:1975:MCG}.", 18519 } 18520 18521 @Article{Knott:1976:NSP, 18522 author = "Gary D. Knott", 18523 title = "A Numbering System for Permutations of Combinations", 18524 journal = j-CACM, 18525 volume = "19", 18526 number = "6", 18527 pages = "355--356", 18528 month = jun, 18529 year = "1976", 18530 CODEN = "CACMA2", 18531 ISSN = "0001-0782", 18532 bibdate = "Tue Mar 25 13:26:09 MST 1997", 18533 bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Theory/Seiferas/1976.bib", 18534 acknowledgement = ack-nhfb, 18535 classcodes = "B0250 (Combinatorial mathematics); C1160 (Combinatorial mathematics); C7310 (Mathematics computing)", 18536 corpsource = "Nat. Inst. of Health, Bethesda, MD, USA", 18537 keywords = "Algol procedures; coding systems; combinatorial mathematics; combinatorics; inverse; permuted combination numbering system; storage mapping functions", 18538 treatment = "A Application; T Theoretical or Mathematical", 18539 } 18540 18541 @Article{Conte:1976:TCC, 18542 author = "S. D. Conte and M. H. Halstead", 18543 title = "Technology of Computer Center Management: a Proposed Course for Graduate Professional Programs in Computer Science or in Information Systems", 18544 journal = j-CACM, 18545 volume = "19", 18546 number = "7", 18547 pages = "369--370", 18548 month = jul, 18549 year = "1976", 18550 CODEN = "CACMA2", 18551 ISSN = "0001-0782", 18552 bibdate = "Tue Mar 25 13:26:09 MST 1997", 18553 bibsource = "Compendex database", 18554 abstract = "This paper is a report on a course entitled, ``The Technology of Computer Center Management,'' which has been offered at Purdue for the past four years. The course is suitable either for graduate professional programs in information systems or for graduate professional programs in computer science. Although there are currently no suitable textbooks for this course, a selected bibliography is included which covers various course topics.", 18555 acknowledgement = ack-nhfb, 18556 classcodes = "C0220 (Computing education and training)", 18557 classification = "723; 901; 912", 18558 corpsource = "Purdue Univ., West Lafayette, IN, USA", 18559 journalabr = "Commun ACM", 18560 keywords = "administration; computer centre management; computer science; computer system; data processing; education; educational courses; graduate professional programs; information science; information systems; management; management science; performance", 18561 treatment = "P Practical", 18562 } 18563 18564 @Article{Keller:1976:FVP, 18565 author = "Robert M. Keller", 18566 title = "Formal Verification of Parallel Programs", 18567 journal = j-CACM, 18568 volume = "19", 18569 number = "7", 18570 pages = "371--384", 18571 month = jul, 18572 year = "1976", 18573 CODEN = "CACMA2", 18574 ISSN = "0001-0782", 18575 MRclass = "68A05", 18576 MRnumber = "54 14430", 18577 mrreviewer = "W. D. Maurer", 18578 bibdate = "Tue Mar 25 13:26:09 MST 1997", 18579 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Parallel/Multi.bib", 18580 abstract = "Two formal models for parallel computation are presented: an abstract conceptual model and a parallel-program model. The former model does not distinguish between control and data states. The latter model is includes the capability for the representation of an infinite set of control states by allowing there to be arbitrarily many instruction pointers (or processes) executing the program. An induction principle is presented which treats the control and data state sets on the same ground. Through the use of ``place variables'', it is observed that certain correctness conditions can be expressed without enumeration of the set of all possible control states. Examples are presented in which the induction principle is used to demonstrate proofs of mutual exclusion. Also discussed is an extension of the program model which allows each process to have its own local variables and permits shared global variables. Correctness of certain forms of implementation is also discussed.", 18581 acknowledgement = ack-nhfb, 18582 classcodes = "C4290 (Other computer theory); C5400 (Analogue and digital computers and systems); C6150G (Diagnostic, testing, debugging and evaluating systems); C6150J (Operating systems)", 18583 classification = "722; 723", 18584 corpsource = "Princeton Univ., Princeton, NJ, USA", 18585 journalabr = "Commun ACM", 18586 keywords = "assertions; computer metatheory --- Programming Theory; computer systems, digital; correctness; data state sets; deadlock; exclusion; mutual; operating systems (computers); parallel processing; parallel programs; Petri net; program; testing; transition system; verification", 18587 treatment = "A Application; T Theoretical or Mathematical", 18588 } 18589 18590 @Article{King:1976:SEP, 18591 author = "James C. King", 18592 title = "Symbolic Execution and Program Testing", 18593 journal = j-CACM, 18594 volume = "19", 18595 number = "7", 18596 pages = "385--394", 18597 month = jul, 18598 year = "1976", 18599 CODEN = "CACMA2", 18600 ISSN = "0001-0782", 18601 MRclass = "68A05", 18602 MRnumber = "54 6541", 18603 mrreviewer = "P. W. Baker", 18604 bibdate = "Tue Mar 25 13:26:09 MST 1997", 18605 bibsource = "Compendex database", 18606 abstract = "This paper describes the symbolic execution of programs. Instead of supplying the normal inputs to a program (e.g. numbers) one supplies symbols representing arbitrary values. The execution proceeds as in a normal execution except that values may be symbolic formulas over the input symbols. The difficult, yet interesting issues arise during the symbolic execution of conditional branch type statements. A particular system called EFFIGY which provides symbolic execution for program testing and debugging is also described. It interpretively executes programs written in a simple PL/I style programming language. It includes many standard debugging features, the ability to manage and to prove things about symbolic expressions, a simple program testing manager, and a program verifier. A brief discussion of the relationship between symbolic execution and program proving is also included.", 18607 acknowledgement = ack-nhfb, 18608 classcodes = "C6110 (Systems analysis and programming); C6150G (Diagnostic, testing, debugging and evaluating systems)", 18609 classification = "723", 18610 corpsource = "IBM Thomas J. Watson Res. Center, Yorktown Heights, NJ, USA", 18611 journalabr = "Commun ACM", 18612 keywords = "computer metatheory --- Formal Logic; computer programming languages; debugging; EFFIGY; effigy; interpretation; PL/I; program debugging; program proving; program testing; program verification; symbolic; symbolic execution", 18613 treatment = "P Practical; T Theoretical or Mathematical", 18614 } 18615 18616 @Article{Metcalfe:1976:EDP, 18617 author = "Robert M. Metcalfe and David R. Boggs", 18618 title = "{Ethernet}: Distributed Packet Switching for Local Computer Networks", 18619 journal = j-CACM, 18620 volume = "19", 18621 number = "7", 18622 pages = "395--404", 18623 month = jul, 18624 year = "1976", 18625 CODEN = "CACMA2", 18626 ISSN = "0001-0782", 18627 bibdate = "Tue Mar 25 13:26:09 MST 1997", 18628 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Database/Graefe.bib and ftp://ftp.ira.uka.de/pub/bibliography/Ai/Ai.misc.bib and ftp://ftp.ira.uka.de/pub/bibliography/Misc/misc.1.bib", 18629 abstract = "Ethernet is a branching broadcast communication system for carrying digital data packets among locally distributed computing stations. The packet transport mechanism provided by Ethernet has been used to build systems which can be viewed as either local computer networks or loosely coupled multiprocessors. \par An Ethernet's shared communication facility, its Ether, is a passive broadcast medium with no central control. Coordination of access to the Ether for packet broadcasts is distributed among the contending transmitting stations using controlled statistical arbitration. \par Switching of packets to their destinations on the Ether is distributed among the receiving stations using packet address recognition. Design principles and implementation are described, based on experience with an operating Ethernet of 100 nodes along a kilometer of coaxial cable. A model for estimating performance under heavy loads and a packet protocol for error controlled communication are included for completeness.", 18630 acknowledgement = ack-nhfb, 18631 classcodes = "B6210L (Computer communications); C5620 (Computer networks and techniques)", 18632 classification = "718; 722; 723", 18633 corpsource = "Xerox Palo Alto Res. Center, Palo Alto, CA, USA", 18634 journalabr = "Commun ACM", 18635 keywords = "broadcast; broadcast communication; communication; computer networks; computer systems, digital --- Real Time Operation; computers --- Data Communication Systems; data transmission; digital communication systems; distributed communication; distributed computing; distributed control; Ethernet; LANs; multiprocessing; multiprocessors; networks; operating; packet switching; statistical arbitration; switching systems", 18636 treatment = "A Application; P Practical", 18637 } 18638 18639 @Article{Cheng:1976:SDR, 18640 author = "Cheng-Wen Cheng and Jonas Rabin", 18641 title = "Synthesis of Decision Rules", 18642 journal = j-CACM, 18643 volume = "19", 18644 number = "7", 18645 pages = "404--406", 18646 month = jul, 18647 year = "1976", 18648 CODEN = "CACMA2", 18649 ISSN = "0001-0782", 18650 bibdate = "Tue Mar 25 13:26:09 MST 1997", 18651 bibsource = "Compendex database", 18652 abstract = "Decision tables can be used as an effective tool during an interview to record the logic of processes to be automated. The result of such an interview is not a structure of complete decision tables but rather sets of decision rules. The purpose of this paper is to provide a procedure for synthesizing the decision rules and thus provide an aid in developing a structure of complete decision tables.", 18653 acknowledgement = ack-nhfb, 18654 classcodes = "C6110 (Systems analysis and programming); C7100 (Business and administration)", 18655 classification = "723; 922", 18656 corpsource = "Western Electric Res. Center, Princeton, NJ, USA", 18657 journalabr = "Commun ACM", 18658 keywords = "computer systems programming; data processing --- Security of Data; decision rules; decision tables; decision theory and analysis; interview; logical design; logical tables; management; specification language; system design", 18659 treatment = "P Practical; T Theoretical or Mathematical", 18660 } 18661 18662 @Article{Fishman:1976:SGD, 18663 author = "George S. Fishman", 18664 title = "Sampling from the {Gamma-distribution} on a computer", 18665 journal = j-CACM, 18666 volume = "19", 18667 number = "7", 18668 pages = "407--409", 18669 month = jul, 18670 year = "1976", 18671 CODEN = "CACMA2", 18672 ISSN = "0001-0782", 18673 MRclass = "65C10", 18674 MRnumber = "54 6449", 18675 mrreviewer = "Artenio De Matteis", 18676 bibdate = "Tue Mar 25 13:26:09 MST 1997", 18677 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1976.bib", 18678 abstract = "This paper describes a new technique for sampling from the gamma distribution on a digital computer and compares it with an alternative technique. The method suggested uses the rejection technique.", 18679 acknowledgement = ack-nhfb, 18680 classcodes = "B0240 (Probability and statistics); C1140 (Probability and statistics); C7100 (Business and administration); C7310 (Mathematics computing)", 18681 classification = "912; 922", 18682 corpsource = "Univ. of North Carolina, Chapel Hill, NC, USA", 18683 country = "USA", 18684 descriptors = "RNG; simulation;", 18685 enum = "951", 18686 journalabr = "Commun ACM", 18687 keywords = "gamma distribution; gamma variates; operations research; probability; probability --- Random Processes; rejection technique; sampling; shape parameter; Wallace's method", 18688 language = "English", 18689 references = "0", 18690 treatment = "A Application; T Theoretical or Mathematical", 18691 } 18692 18693 @Article{Maly:1976:CT, 18694 author = "Kurt Maly", 18695 title = "Compressed Tries", 18696 journal = j-CACM, 18697 volume = "19", 18698 number = "7", 18699 pages = "409--415", 18700 month = jul, 18701 year = "1976", 18702 CODEN = "CACMA2", 18703 ISSN = "0001-0782", 18704 MRclass = "68A50", 18705 MRnumber = "54 9195", 18706 mrreviewer = "Fabrizio Luccio", 18707 bibdate = "Tue Mar 25 13:26:09 MST 1997", 18708 bibsource = "Compendex database", 18709 abstract = "This paper presents a new data structure, called a compressed trie or C-trie, to be used in information retrieval systems. It has the same underlying m-ary tree structure as a trie, where m is a parameter of the trie, but whereas the fields of the nodes in a trie have to be large enough to hold a key or at least a pointer, the fields in a C-trie are only one bit long. First, the C-trie is analyzed as a data structure, and then several methods of its use for relatively static data bases are discussed.", 18710 acknowledgement = ack-nhfb, 18711 classcodes = "C6120 (File organisation); C7250 (Information storage and retrieval)", 18712 classification = "723; 901", 18713 corpsource = "Univ. of Minnesota, Minneapolis, MN, USA", 18714 journalabr = "Commun ACM", 18715 keywords = "data processing --- Data Structures; data storage, digital; data structure; data structures; database management systems; databases; information; information retrieval systems; key; m ary; retrieval systems; retrieval time; storage requirement; tree; trie", 18716 treatment = "P Practical", 18717 } 18718 18719 @Article{Burton:1976:BSV, 18720 author = "Warren Burton", 18721 title = "A buddy system variation for disk storage allocation", 18722 journal = j-CACM, 18723 volume = "19", 18724 number = "7", 18725 pages = "416--417", 18726 month = jul, 18727 year = "1976", 18728 CODEN = "CACMA2", 18729 ISSN = "0001-0782", 18730 bibdate = "Tue Mar 25 13:26:09 MST 1997", 18731 bibsource = "Compendex database", 18732 abstract = "A generalization of the buddy system for storage allocation is described. It is shown how limitations on block sizes make it possible to force logical storage blocks to coincide with physical storage blocks, such as tracks and cylinders. This new variation of the buddy system has been developed for allocating storage for geometrical data items (polygons, sets of points, etc. ).", 18733 acknowledgement = ack-nhfb, 18734 classcodes = "C5320C (Storage on moving magnetic media); C6120 (File organisation)", 18735 classification = "722; 723", 18736 corpsource = "Univ. of East Anglia, Norwich, UK", 18737 journalabr = "Commun ACM", 18738 keywords = "buddy system; computer operating systems; computer systems programming --- Supervisory and Executive Programs; data storage, magnetic --- Disk; disc storage; integral valued function; magnetic disc and drum storage; storage allocation", 18739 treatment = "P Practical", 18740 } 18741 18742 @Article{Gonnet:1976:HAE, 18743 author = "G. H. Gonnet", 18744 title = "Heaps applied to event driven mechanisms", 18745 journal = j-CACM, 18746 volume = "19", 18747 number = "7", 18748 pages = "417--418", 18749 month = jul, 18750 year = "1976", 18751 CODEN = "CACMA2", 18752 ISSN = "0001-0782", 18753 bibdate = "Tue Mar 25 13:26:09 MST 1997", 18754 bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1976.bib", 18755 acknowledgement = ack-nhfb, 18756 classcodes = "C4240 (Programming and algorithm theory); C6120 (File organisation)", 18757 corpsource = "Univ. of Waterloo, Waterloo, Ont., Canada", 18758 country = "USA", 18759 descriptors = "Simulation; event set;", 18760 enum = "7331", 18761 keywords = "algorithm theory; data structures; discrete event simulation; event; heaps; priority queue; scanning mechanisms", 18762 language = "English", 18763 references = "0", 18764 treatment = "P Practical", 18765 } 18766 18767 @Article{Donovan:1976:TPS, 18768 author = "John J. Donovan", 18769 title = "Tools and Philosophy for Software Education", 18770 journal = j-CACM, 18771 volume = "19", 18772 number = "8", 18773 pages = "430--436", 18774 month = aug, 18775 year = "1976", 18776 CODEN = "CACMA2", 18777 ISSN = "0001-0782", 18778 bibdate = "Tue Mar 25 13:26:09 MST 1997", 18779 bibsource = "Compendex database", 18780 abstract = "This paper describes a set of tools and a philosophy for teaching software that have been found very useful in course at MIT over the past seven years. \par The tools include programs such as simulators, graders, compilers, and monitor. These allow the instructor to augment the basic concepts with relevant, exciting, and economical student project activities.", 18781 acknowledgement = ack-nhfb, 18782 classcodes = "C0220 (Computing education and training); C6110 (Systems analysis and programming)", 18783 classification = "723; 901", 18784 corpsource = "MIT, Cambridge, MA, USA", 18785 journalabr = "Commun ACM", 18786 keywords = "computer programming; computer software; education; grading; grading programs; philosophy; programs; simulators; software education; student assignments; tools", 18787 treatment = "P Practical", 18788 } 18789 18790 @Article{Tennent:1976:DSP, 18791 author = "R. D. Tennent", 18792 title = "The Denotational Semantics of Programming Languages", 18793 journal = j-CACM, 18794 volume = "19", 18795 number = "8", 18796 pages = "437--453", 18797 month = aug, 18798 year = "1976", 18799 CODEN = "CACMA2", 18800 ISSN = "0001-0782", 18801 MRclass = "68A05", 18802 MRnumber = "55 1791", 18803 mrreviewer = "Gianni Aguzzi", 18804 bibdate = "Tue Mar 25 13:26:09 MST 1997", 18805 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Misc/Functional.bib; ftp://ftp.ira.uka.de/pub/bibliography/Object/Nierstrasz.bib", 18806 abstract = "This paper is a tutorial introduction to the theory of programming language semantics developed by D. Scott and C. Strachey. The application of the theory to formal language specification is demonstrated and other applications are surveyed. The first language considered, LOOP, is very elementary and its definition merely introduces the notation and methodology of the approach. Then the semantic concepts of environments, stores, and continuations are introduced to model classes of programming language features and the underlying mathematical theory of computation due to Scott is motivated and outlined. Finally, the paper presents a formal definition of the language GEDANKEN.", 18807 acknowledgement = ack-nhfb, 18808 classcodes = "C4210 (Formal logic)", 18809 classification = "721; 723", 18810 corpsource = "Queen's Univ., Kingston, Ont., Canada", 18811 journalabr = "Commun ACM", 18812 keywords = "applicative; automata theory --- Context Free Languages; computer metatheory; computer programming languages --- Analysis; continuation; environment; formal language; formal languages; function; functional; GEDANKEN; gedanken; higher order; higher-order function; imperative; loop; LOOP; mathematical theory of computation; pl-semantics binder; programming language; programming languages; recursive definition; semantics; store; theory of computation", 18813 treatment = "A Application; T Theoretical or Mathematical", 18814 } 18815 18816 @Article{Clark:1976:DS, 18817 author = "James H. Clark", 18818 title = "Designing Surfaces in {3-D}", 18819 journal = j-CACM, 18820 volume = "19", 18821 number = "8", 18822 pages = "454--460", 18823 month = aug, 18824 year = "1976", 18825 CODEN = "CACMA2", 18826 ISSN = "0001-0782", 18827 MRclass = "68A99 (50D15 65D10)", 18828 MRnumber = "54 4216", 18829 mrreviewer = "Wolfgang Bohm", 18830 bibdate = "Tue Mar 25 13:26:09 MST 1997", 18831 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Misc/virtual.bib", 18832 abstract = "An experimental system for computer-aided design of free-form surfaces in three dimensions is described. The surfaces are represented in the system as parametric basis splines. The principal features of the system are: the surfaces are rendered as isoparametric line drawings on a head-mounted display, and they are designed with the aid of a three-dimensional ``wand,'' which allows 3-D movements of the points controlling the shapes of the surfaces; all of the interactions with the surfaces are in real-time; and the mathematical formulations used assume no knowledge of them by the user of the system. Also examined are some of the features that should be part of a practical 3-D system for designing space-forms.", 18833 acknowledgement = ack-nhfb, 18834 classcodes = "C5540 (Terminals and graphic displays)", 18835 classification = "722; 723; 901", 18836 corpsource = "Univ. of Utah, Salt Lake City, UT, USA", 18837 journalabr = "Commun ACM", 18838 keywords = "3D displays; B splines; CAD; computer graphics; computer peripheral equipment --- Light Pens; computer systems, digital --- Real Time Operation; computer-aided design; engineering --- Computer Aided Design; free form surfaces; image processing; isoparametric line drawings; picture processing; real; surface design; surfaces; three dimensional surfaces; time graphics", 18839 treatment = "A Application; P Practical; X Experimental", 18840 } 18841 18842 @Article{Harrison:1976:POS, 18843 author = "Michael A. Harrison and Walter L. Ruzzo and Jeffrey D. Ullman", 18844 title = "Protection in Operating Systems", 18845 journal = j-CACM, 18846 volume = "19", 18847 number = "8", 18848 pages = "461--471", 18849 month = aug, 18850 year = "1976", 18851 CODEN = "CACMA2", 18852 ISSN = "0001-0782", 18853 MRclass = "68A99", 18854 MRnumber = "54 14474", 18855 mrreviewer = "George I. Davida", 18856 bibdate = "Tue Mar 25 13:26:09 MST 1997", 18857 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Misc/security.1.bib", 18858 abstract = "A model of protection mechanisms in computing systems is presented and its appropriateness is argued. The ``safety'' problem for protection systems under this model is to determine in a given situation whether a subject can acquire a particular right to an object. In restricted cases, it can be shown that this problem is decidable; i.e., there is an algorithm to determine whether a system in a particular configuration is safe. In general, and under surprisingly weak assumptions, it cannot be decided if a situation is safe. Various implications of this fact are discussed.", 18859 acknowledgement = ack-nhfb, 18860 classcodes = "C4210 (Formal logic); C4220 (Automata theory); C6150J (Operating systems)", 18861 classification = "721; 723", 18862 corpsource = "Univ. of California, Berkeley, CA, USA", 18863 journalabr = "Commun ACM", 18864 keywords = "(computers); automata theory --- Turing Machines; computability and decidability; computer operating systems --- Design; computer security; data processing; decidability; operating systems; protection; protection systems; security model; security of data; Turing machine; Turing machines", 18865 ort = "ordner sicherheit", 18866 treatment = "P Practical; T Theoretical or Mathematical", 18867 } 18868 18869 @Article{Hirschberg:1976:ITO, 18870 author = "D. S. Hirschberg", 18871 title = "An Insertion Technique for One-Sided Height-Balanced Trees", 18872 journal = j-CACM, 18873 volume = "19", 18874 number = "8", 18875 pages = "471--473", 18876 month = aug, 18877 year = "1976", 18878 CODEN = "CACMA2", 18879 ISSN = "0001-0782", 18880 bibdate = "Tue Mar 25 13:26:09 MST 1997", 18881 bibsource = "Compendex database", 18882 abstract = "A restriction on height-balanced binary trees is presented. It is seen that this restriction reduces the extra memory requirements by half (from two extra bits per node to one) and maintains fast search capabilities at a cost of increased time requirements for inserting new nodes.", 18883 acknowledgement = ack-nhfb, 18884 classcodes = "C4210 (Formal logic)", 18885 classification = "723", 18886 corpsource = "Princeton Univ., Princeton, NJ, USA", 18887 journalabr = "Commun ACM", 18888 keywords = "balanced; balanced trees; binary; binary trees; computer programming; data processing; insertion technique; one sided height; search; trees; trees (mathematics)", 18889 treatment = "A Application; T Theoretical or Mathematical", 18890 } 18891 18892 @Article{Chu:1976:CAP, 18893 author = "Wesley W. Chu and Holger Opderbeck", 18894 title = "Corrigendum: {``Analysis of the PFF replacement algorithm via a semi-Markov model''}", 18895 journal = j-CACM, 18896 volume = "19", 18897 number = "9", 18898 month = sep, 18899 year = "1976", 18900 CODEN = "CACMA2", 18901 ISSN = "0001-0782", 18902 MRclass = "529.68A50", 18903 MRnumber = "55 6998", 18904 bibdate = "Tue Dec 26 13:35:07 1995", 18905 note = "See \cite{Chu:1976:APR}.", 18906 acknowledgement = ack-nhfb, 18907 } 18908 18909 @Article{Wegbreit:1976:CRC, 18910 author = "Ben Wegbreit", 18911 title = "Corrigendum: ``{Faster Retrieval from Context Trees}''", 18912 journal = j-CACM, 18913 volume = "19", 18914 number = "9", 18915 pages = "??--??", 18916 month = sep, 18917 year = "1976", 18918 CODEN = "CACMA2", 18919 ISSN = "0001-0782", 18920 bibdate = "Sat Jan 18 15:31:01 1997", 18921 note = "See \cite{Wegbreit:1976:FRC}.", 18922 keywords = "context trees; data structures; frame problem; variable bindings", 18923 xxnote = "Cannot find this corrigendum in 1976--1977 issues, or on Compendex database, or in ACM Computing Archive CD-ROM.??", 18924 } 18925 18926 @Article{Wadler:1976:AAR, 18927 author = "Philip L. Wadler", 18928 title = "Analysis of an Algorithm for Real Time Garbage Collection", 18929 journal = j-CACM, 18930 volume = "19", 18931 number = "9", 18932 pages = "491--500", 18933 month = sep, 18934 year = "1976", 18935 CODEN = "CACMA2", 18936 ISSN = "0001-0782", 18937 MRclass = "68A50", 18938 MRnumber = "54 14473", 18939 mrreviewer = "George I. Davida", 18940 bibdate = "Tue Mar 25 13:26:09 MST 1997", 18941 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Compiler/garbage.collection.bib", 18942 abstract = "List processing systems often use a method called garbage collection for reclaiming unused memory space. A real time garbage collection system avoids suspending the operations of a list processor for the long times that garbage collection normally requires by performing garbage collection on a second processor in parallel with list processing operations, or on a single processor time-shared with them. Algorithms for recovering discarded list structures in this manner are presented and analyzed to determine sufficient conditions under which the list processor never need to wait on the collector. These techniques are shown to require at most twice as much processing power as regular garbage collectors, if they are used efficiently. The average behavior of the program is shown to be very nearly equal to the worst-case performance, so that the sufficient conditions are also suitable for measuring the typical behavior of the algorithm.", 18943 acknowledgement = ack-nhfb, 18944 classcodes = "C5400 (Analogue and digital computers and systems); C6120 (File organisation)", 18945 classification = "723", 18946 comment = "This algorithm contains an error that is pointed out by \cite{Gries:1977:BPB}", 18947 corpsource = "Stanford Univ., Stanford, CA, USA", 18948 journalabr = "Commun ACM", 18949 keywords = "computer programming --- Subroutines; computer programming languages --- lisp; computer systems programming; data processing --- Data Structures; data structure; data structures; garbage collection; Lisp; list; list processor; multiprocessing; parallel processing; processing; real time; storage management; storage reclamation; time change", 18950 treatment = "P Practical; T Theoretical or Mathematical", 18951 } 18952 18953 @Article{Yap:1976:NUB, 18954 author = "Chee K. Yap", 18955 title = "New Upper Bounds for Selection", 18956 journal = j-CACM, 18957 volume = "19", 18958 number = "9", 18959 pages = "501--508", 18960 month = sep, 18961 year = "1976", 18962 CODEN = "CACMA2", 18963 ISSN = "0001-0782", 18964 MRclass = "68A20", 18965 MRnumber = "54 6559", 18966 mrreviewer = "Thomas G. Szymanski", 18967 bibdate = "Tue Mar 25 13:26:09 MST 1997", 18968 bibsource = "Compendex database", 18969 abstract = "The worst-case, minimum number of comparisons complexity V//i (n) of the i-th selection problem is considered. A new upper bound for V//i (n) improves the bound given by the standard Hadian-Sobel algorithm by a generalization of the Kirkpatrick-Hadian-Sobel algorithm, and extends Kirkpatrick's method to a much wider range of application. This generalization compares favorably with a recent algorithm by L. Hyafil.", 18970 acknowledgement = ack-nhfb, 18971 classcodes = "C4240 (Programming and algorithm theory)", 18972 classification = "723", 18973 corpsource = "Dept. of Computer Sci., Yale Univ., New Haven, CT, USA", 18974 journalabr = "Commun ACM", 18975 keywords = "comparison problems; computational complexity; computer metatheory; concrete computational complexity; selection problem; upper bounds; worst case analysis", 18976 treatment = "T Theoretical or Mathematical", 18977 } 18978 18979 @Article{Loui:1976:WDT, 18980 author = "Michael C. Loui", 18981 title = "Weighted Derivation Trees", 18982 journal = j-CACM, 18983 volume = "19", 18984 number = "9", 18985 pages = "509--513", 18986 month = sep, 18987 year = "1976", 18988 CODEN = "CACMA2", 18989 ISSN = "0001-0782", 18990 MRclass = "68A30", 18991 MRnumber = "54 1727", 18992 mrreviewer = "Stephen Soule", 18993 bibdate = "Tue Mar 25 13:26:09 MST 1997", 18994 bibsource = "Compendex database", 18995 abstract = "The nodes of a weighted derivation tree are associated with weighting functions over the vocabulary of a context-free grammar. An algorithm is presented for constructing the optimal derivation tree having the same structure as a given weighted derivation tree. In addition, the correctness of the algorithm is established. The method may be applied to problems involving probabilistic parsing or combinatorial optimization.", 18996 acknowledgement = ack-nhfb, 18997 classcodes = "C4210 (Formal logic)", 18998 classification = "721; 723; 921", 18999 corpsource = "Dept. of Computer Sci., Yale Univ., New Haven, CT, USA", 19000 journalabr = "Commun ACM", 19001 keywords = "ambiguity; automata theory; combinatorial optimisation; computer programming --- Subroutines; context free grammars; context-free grammars; derivation trees; mathematical programming; parse tree; parsing; probabilistic; structural; trees (mathematics); weighting functions", 19002 treatment = "T Theoretical or Mathematical", 19003 } 19004 19005 @Article{Walter:1976:RAC, 19006 author = "Kenneth G. Walter", 19007 title = "Recursion Analysis for Compiler Optimization", 19008 journal = j-CACM, 19009 volume = "19", 19010 number = "9", 19011 pages = "514--516", 19012 month = sep, 19013 year = "1976", 19014 CODEN = "CACMA2", 19015 ISSN = "0001-0782", 19016 bibdate = "Tue Mar 25 13:26:09 MST 1997", 19017 bibsource = "Compendex database", 19018 abstract = "A relatively simple method for the detection of recursive use of procedures is presented for use in compiler optimization. Implementation considerations are discussed, and a modification of the algorithm is given to further improve optimization. This analysis can also be used to determine what possible subset of values could be assumed by variables which can only take on a relatively small discrete set of values. The most common are parameters of variables assuming values of label, procedure, or Pascal's enumerated type.", 19019 acknowledgement = ack-nhfb, 19020 classcodes = "C4290 (Other computer theory); C6150C (Compilers, interpreters and other processors)", 19021 classification = "723", 19022 corpsource = "Computing and Information Sci. Dept., Case Western Reserve Univ., Cleveland, OH, USA", 19023 journalabr = "Commun ACM", 19024 keywords = "compiler optimisation; computer operating systems; nonrecursion; optimisation; program compilers; recursion analysis; relative", 19025 treatment = "P Practical; T Theoretical or Mathematical", 19026 } 19027 19028 @Article{Bitner:1976:EGB, 19029 author = "James R. Bitner and Gideon Ehrlich and Edward M. Reingold", 19030 title = "Efficient Generation of the Binary Reflected {Gray} Code and Its Applications", 19031 journal = j-CACM, 19032 volume = "19", 19033 number = "9", 19034 pages = "517--521", 19035 month = sep, 19036 year = "1976", 19037 CODEN = "CACMA2", 19038 ISSN = "0001-0782", 19039 MRclass = "94A10 (68A10)", 19040 MRnumber = "54 12349", 19041 mrreviewer = "B. D. Sharma", 19042 bibdate = "Tue Mar 25 13:26:09 MST 1997", 19043 bibsource = "Compendex database", 19044 abstract = "Algorithms are presented to generate the n-bit binary reflected Gray code and codewords of fixed weight in that code. Both algorithms are efficient in that the time required to generate the next element from the current one is constant. Applications to the generation of the combinations of n things taken k at a time, the compositions of integers, and the permutations of a multiset are discussed.", 19045 acknowledgement = ack-nhfb, 19046 classcodes = "C4240 (Programming and algorithm theory)", 19047 classification = "723; 921", 19048 corpsource = "Dept. of Computer Sci., Univ. of Illinois, Urbana-Champaign, IL, USA", 19049 journalabr = "Commun ACM", 19050 keywords = "algorithm theory; codes, symbolic; combinations; combinatorial computing; compositions; computer programming --- Subroutines; fixed weight; Gray code; mathematical techniques; subsets", 19051 treatment = "A Application; T Theoretical or Mathematical", 19052 } 19053 19054 @Article{Deutsch:1976:EIA, 19055 author = "L. Peter Deutsch and Daniel G. Bobrow", 19056 title = "An Efficient, Incremental, Automatic Garbage Collector", 19057 journal = j-CACM, 19058 volume = "19", 19059 number = "9", 19060 pages = "522--526", 19061 month = sep, 19062 year = "1976", 19063 CODEN = "CACMA2", 19064 ISSN = "0001-0782", 19065 bibdate = "Tue Mar 25 13:26:09 MST 1997", 19066 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Object/Nierstrasz.bib", 19067 abstract = "This paper describes a new way of solving the storage reclamation problem for a system such as Lisp that allocates storage automatically from a heap, and does not require the programmer to give any indication that particular items are no longer useful or accessible. A reference count scheme for reclaiming non-self-referential structures, and a linearizing, compacting, copying scheme to reorganize all storage at the users discretion are proposed. The algorithms are designed to work well in systems which use multiple levels of storage, and large virtual address space. They depend on the fact that most cells are referenced exactly once, and that reference counts need only be accurate when storage is about to be reclaimed. A transaction file stores changes to reference counts, and a multiple reference table stores the count for items which are referenced more than once.", 19068 acknowledgement = ack-nhfb, 19069 classcodes = "C6120 (File organisation)", 19070 classification = "723", 19071 comment = "Transaction-based reference counting; interesting blend of marking and ref-counting collection", 19072 corpsource = "Xerox Palo Alto Res. Center, Palo Alto, CA, USA", 19073 journalabr = "Commun ACM", 19074 keywords = "address space; computer operating systems --- Storage Allocation; computer programming; computer programming languages --- lisp; garbage collector; Lisp; multiple reference; olit memory lisp; storage management; storage reclamation; table stores; transaction file stores; virtual", 19075 treatment = "P Practical; T Theoretical or Mathematical", 19076 } 19077 19078 @Article{Wegbreit:1976:FRC, 19079 author = "Ben Wegbreit", 19080 title = "Faster Retrieval from Context Trees", 19081 journal = j-CACM, 19082 volume = "19", 19083 number = "9", 19084 pages = "526--529", 19085 month = sep, 19086 year = "1976", 19087 CODEN = "CACMA2", 19088 ISSN = "0001-0782", 19089 bibdate = "Tue Mar 25 13:26:09 MST 1997", 19090 bibsource = "Compendex database", 19091 note = "See corrigendum \cite{Wegbreit:1976:CRC}.", 19092 abstract = "Context trees provide a convenient way of storing data which is to be viewed as a hierarchy of contexts. This note presents an algorithm which improves on previous context tree retrieval algorithms. It is based on the observation that in typical uses context changes are infrequent relative to retrievals, so that data can be cached to speed up retrieval. A retrieval is started from the position of the previous retrieval and auxiliary structures are built up to make the search rapid. Algorithms for addition and deletion of data and for garbage collection are outlined.", 19093 acknowledgement = ack-nhfb, 19094 classcodes = "C4290 (Other computer theory); C6120 (File organisation)", 19095 classification = "723", 19096 corpsource = "Xerox Palo Alto Res. Center, Palo Alto, CA, USA", 19097 journalabr = "Commun ACM", 19098 keywords = "computer programming; context tree; context trees; data processing --- Data Structures; data structure; data structures; frame problem; garbage collection; retrieval algorithms; storage management; trees (mathematics); variable bindings", 19099 treatment = "T Theoretical or Mathematical", 19100 } 19101 19102 @Article{Blinn:1976:TRC, 19103 author = "James F. Blinn and Martin E. Newell", 19104 title = "Texture and Reflection in Computer Generated Images", 19105 journal = j-CACM, 19106 volume = "19", 19107 number = "10", 19108 pages = "542--547", 19109 month = oct, 19110 year = "1976", 19111 CODEN = "CACMA2", 19112 ISSN = "0001-0782", 19113 bibdate = "Tue Mar 25 13:26:09 MST 1997", 19114 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Graphics/imager/imager.76.bib", 19115 abstract = "In 1974 E. A. Catmull developed a new algorithm for rendering images of bivariate surface patches. This paper describes extensions of this algorithm in the areas of texture simulation and lighting models. The parametrization of a patch defines a coordinate system which is used as a key for mapping patterns onto the surface. The intensity of the pattern at each picture element is computed as a weighted average of regions of the pattern definition function. The shape and size of this weighting function are chosen using digital signal processing theory. The patch rendering algorithm allows accurate computation of the surface normal to the patch at each picture element, permitting the simulation of mirror reflections. Several examples of images synthesized using these new techniques are included.", 19116 acknowledgement = ack-nhfb, 19117 annote = "early paper on texture mapping, discusses spherical sky textures", 19118 classcodes = "C5540 (Terminals and graphic displays); C6130B (Graphics techniques)", 19119 classification = "723", 19120 corpsource = "Univ. of Utah, Salt Lake City, UT, USA", 19121 journalabr = "Commun ACM", 19122 keywords = "CACM; computer graphics; computerised picture processing; graphic display; hidden surface removal; image processing; reflection of light; shading; texture environment; texture mapping; texture simulation", 19123 treatment = "A Application; P Practical; T Theoretical or Mathematical", 19124 } 19125 19126 @Article{Clark:1976:HGM, 19127 author = "James H. Clark", 19128 title = "Hierarchical Geometric Models for Visible Surface Algorithms", 19129 journal = j-CACM, 19130 volume = "19", 19131 number = "10", 19132 pages = "547--554", 19133 month = oct, 19134 year = "1976", 19135 CODEN = "CACMA2", 19136 ISSN = "0001-0782", 19137 bibdate = "Tue Mar 25 13:26:09 MST 1997", 19138 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Graphics/imager/imager.76.bib", 19139 abstract = "By using an extension of traditional structure information, or a geometric hierarchy, five significant improvements to current techniques of computer picture production are possible. First, the range of complexity of an environment is greatly increased while the visible complexity of any given scene is kept within a fixed upper limit. Second, a meaningful way is provided to vary the amount of detail presented in a scene. Third, ``clipping'' becomes a very fast logarithmic search for the resolvable parts of the environment within the field of view. Fourth, frame to frame coherence and clipping define a graphical ``working set,'' or fraction of the total structure that should be present in primary store for immediate access by the visible surface algorithm. Finally, the geometric structure suggests a recursive descent, visible surface algorithm in which the computation time potentially grows linearly with the visible complexity of the scene.", 19140 acknowledgement = ack-nhfb, 19141 classcodes = "C5540 (Terminals and graphic displays); C6130B (Graphics techniques)", 19142 classification = "723; 921", 19143 corpsource = "Univ. of California, Santa Cruz, CA, USA", 19144 journalabr = "Commun ACM", 19145 keywords = "algorithms; computer graphics; geometric models; hidden surface; hierarchical data structures; image processing; mathematical techniques --- Combinatorial Mathematics; model; visible surface algorithms", 19146 treatment = "A Application; P Practical; T Theoretical or Mathematical", 19147 } 19148 19149 @Article{Levin:1976:PAD, 19150 author = "Joshua Z. Levin", 19151 title = "A Parametric Algorithm for Drawing Pictures of Solid Objects Composed of Quadric Surfaces", 19152 journal = j-CACM, 19153 volume = "19", 19154 number = "10", 19155 pages = "555--563", 19156 month = oct, 19157 year = "1976", 19158 CODEN = "CACMA2", 19159 ISSN = "0001-0782", 19160 MRclass = "68A10", 19161 MRnumber = "55 13867", 19162 mrreviewer = "Wolfgang Bohm", 19163 bibdate = "Tue Mar 25 13:26:09 MST 1997", 19164 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Graphics/graphics.bib", 19165 abstract = "An algorithm for drawing pictures of three-dimensional objects, with surfaces made up of patches of quadric surfaces, is described. The emphasis of this algorithm is on calculating the intersections of quadric surfaces. A parameterization scheme is used. Each quadric surface intersection curve (QSIC) is represented as a set of coefficients and parameter limits. Each value of the parameter represents at most two points, and these may easily be distinguished. This scheme can find the coordinates of points of even quartic (fourth-order) intersection curves, using equations of no more than second order. Methods of parameterization for each type of QSIC are discussed, as well as surface bounding and hidden surface removal.", 19166 acknowledgement = ack-nhfb, 19167 classcodes = "C5540 (Terminals and graphic displays); C6130B (Graphics techniques)", 19168 classification = "723; 921", 19169 corpsource = "New York Univ., New York, NY, USA", 19170 journalabr = "Commun ACM", 19171 keywords = "algorithms; computer graphics; curves and surfaces; graphics; hidden; intersections; mathematical techniques --- Function Evaluation; parametric algorithm; quadric surface intersection curve; quadric surfaces; quadrics; scanline algorithms; solid objects; surface bounding; surface removal; surfaces; three dimensional", 19172 treatment = "A Application; P Practical; T Theoretical or Mathematical", 19173 } 19174 19175 @Article{Burtnyk:1976:IST, 19176 author = "N. Burtnyk and M. Wein", 19177 title = "Interactive Skeleton Techniques for Enhancing Motion Dynamics in Key Frame Animation", 19178 journal = j-CACM, 19179 volume = "19", 19180 number = "10", 19181 pages = "564--569", 19182 month = oct, 19183 year = "1976", 19184 CODEN = "CACMA2", 19185 ISSN = "0001-0782", 19186 bibdate = "Tue Mar 25 13:26:09 MST 1997", 19187 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Graphics/imager/imager.76.bib", 19188 abstract = "A significant increase in the capability for controlling motion dynamics in key frame animation is achieved through skeleton control. This technique allows an animator to develop a complex motion sequence by animating a stick figure representation of an image. This control sequence is then used to drive an image sequence through the same movement. \par The simplicity of the stick figure image encourages a high level of interaction during the design stage. Its compatibility with the basic key frame animation technique permits skeleton control to be applied selectively to only those components of a composite image sequence that require enhancement.", 19189 acknowledgement = ack-nhfb, 19190 classcodes = "C5540 (Terminals and graphic displays); C6130B (Graphics techniques)", 19191 classification = "723; 742", 19192 corpsource = "Nat. Res. Council of Canada, Ottawa, Ont., Canada", 19193 journalabr = "Commun ACM", 19194 keywords = "computer generated animation; computer graphics; computerised picture processing; figure animation; image processing; interactive graphics; interactive skeleton; interactive skeleton control; key frame animation; motion analysis and motion dynamics; motion pictures --- Animation; skeleton control; stick; stick figure animation", 19195 treatment = "A Application; P Practical; T Theoretical or Mathematical", 19196 } 19197 19198 @Article{Frane:1976:BBS, 19199 author = "James W. Frane", 19200 title = "The {BMD} and {BMDP} Series of Statistical Computer Programs", 19201 journal = j-CACM, 19202 volume = "19", 19203 number = "10", 19204 pages = "570--576", 19205 month = oct, 19206 year = "1976", 19207 CODEN = "CACMA2", 19208 ISSN = "0001-0782", 19209 bibdate = "Tue Mar 25 13:26:09 MST 1997", 19210 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/siggraph/76.bib", 19211 abstract = "The BMD and BMDP series are the results of methodological research and programming effort at the UCLA Health Sciences Computing Facility since 1957. The original users of the BMD and BMDP programs were intended to be researchers in the health sciences. However, the programs have been used for a wide variety of biological and behavioral applications. The programs are also used for problems in the physical sciences, although they are not intended to solve highly ill-conditioned problems which are sometimes encountered there. Control language, graphics capabilities, statistical features, data management and limitations are discussed.", 19212 acknowledgement = ack-nhfb, 19213 classcodes = "B0240 (Probability and statistics); C1140 (Probability and statistics); C6130 (Data handling techniques); C7310 (Mathematics computing); C7330 (Biology and medical computing); C7810 (Social and behavioural sciences computing)", 19214 classification = "723; 922", 19215 corpsource = "Univ. of California, Los Angeles, CA, USA", 19216 journalabr = "Commun ACM", 19217 keywords = "analysis; analysis of; biology computing; BMD; BMDP; cluster analysis; computing; contingency tables; data; data processing; discriminant analysis; factor analysis; graphics; mathematical statistics --- Computer Applications; outlines; regression; social and behavioural sciences; statistical analysis; statistical computer programs; statistics; time series; variance", 19218 treatment = "A Application; P Practical", 19219 } 19220 19221 @Article{Duong-Kien:1976:IMA, 19222 author = "C. Duong-Kien and H.-J. Hoffmann and D. Muth", 19223 title = "An improvement to {Martin}'s algorithm for computation of linear precedence functions", 19224 journal = j-CACM, 19225 volume = "19", 19226 number = "10", 19227 pages = "576--577", 19228 month = oct, 19229 year = "1976", 19230 CODEN = "CACMA2", 19231 ISSN = "0001-0782", 19232 MRclass = "68A30", 19233 MRnumber = "54 9176", 19234 mrreviewer = "Daniel J. Rosenkrantz", 19235 bibdate = "Tue Mar 25 13:26:09 MST 1997", 19236 acknowledgement = ack-nhfb, 19237 classcodes = "C4210 (Formal logic)", 19238 corpsource = "Tech. Hochschule Darmstadt, Darmstadt, West Germany", 19239 keywords = "Boolean; Boolean algebra; linear precedence functions; matrices; syntax analysis", 19240 treatment = "T Theoretical or Mathematical", 19241 } 19242 19243 @Article{Montanelli:1976:SWM, 19244 author = "Richard G. {Montanelli, Jr.} and Sandra A. Mamrak", 19245 title = "Status of Women and Minorities in Academic Computer Science", 19246 journal = j-CACM, 19247 volume = "19", 19248 number = "10", 19249 pages = "578--581", 19250 month = oct, 19251 year = "1976", 19252 CODEN = "CACMA2", 19253 ISSN = "0001-0782", 19254 bibdate = "Tue Mar 25 13:26:09 MST 1997", 19255 bibsource = "Compendex database", 19256 abstract = "The results of a survey concerning women and minority students and faculty in computer science during the years 1971 to 1975 are presented. Analysis of the data indicates that effective affirmative action programs for recruitment into graduate degree programs are needed to enlarge the number of women and minorities qualified for later employment in computer science. Also, possible discrimination in employment of women and minority graduate students is revealed.", 19257 acknowledgement = ack-nhfb, 19258 classcodes = "C0220 (Computing education and training)", 19259 classification = "723; 901", 19260 corpsource = "Dept. of Computer Sci., Univ. of Illinois, Urbana, IL, USA", 19261 journalabr = "Commun ACM", 19262 keywords = "academic employment; affirmative action; computer programming; computer science; computer science education; data processing; discrimination against; discrimination against women; education; employment; faculty; graduate students; minorities", 19263 treatment = "P Practical", 19264 } 19265 19266 @Article{Ross:1976:HHS, 19267 author = "D. T. Ross", 19268 title = "Homilies for humble standards (computer applications)", 19269 journal = j-CACM, 19270 volume = "19", 19271 number = "11", 19272 pages = "595--600", 19273 month = nov, 19274 year = "1976", 19275 CODEN = "CACMA2", 19276 ISSN = "0001-0782", 19277 bibdate = "Tue Mar 25 13:26:09 MST 1997", 19278 acknowledgement = ack-nhfb, 19279 classcodes = "C0310 (EDP management); C7000 (Computer applications)", 19280 corpsource = "SofTech. Inc., Waltham, MA, USA", 19281 keywords = "computer applications; standards; systems methodology", 19282 treatment = "P Practical", 19283 } 19284 19285 @Article{Ledgard:1976:CUC, 19286 author = "Henry F. Ledgard and William C. Cave", 19287 title = "{Cobol} Under Control", 19288 journal = j-CACM, 19289 volume = "19", 19290 number = "11", 19291 pages = "601--608", 19292 month = nov, 19293 year = "1976", 19294 CODEN = "CACMA2", 19295 ISSN = "0001-0782", 19296 bibdate = "Tue Mar 25 13:26:09 MST 1997", 19297 bibsource = "Compendex database", 19298 abstract = "A sample set of Cobol programming standards is offered. These standards constrain code to be developed in a ``structured'' form for both data and control structures. They do not require syntax beyond the existing Cobol language and in fact utilize a typical limited subset of the 1974 ANS Cobol standard. This approach has reduced the cost and time to produce and maintain large software systems.", 19299 acknowledgement = ack-nhfb, 19300 classcodes = "C6110 (Systems analysis and programming); C6140D (High level languages)", 19301 classification = "723; 912", 19302 corpsource = "Univ. of Massachusetts, Amherst, MA, USA", 19303 journalabr = "Commun ACM", 19304 keywords = "COBOL; computer programming --- Structured Programming; computer programming languages; computer programs --- Standardization; control structures; data structure; live; management; multiple customer environments; programming standards; sample set; standards; structured programming", 19305 treatment = "P Practical", 19306 } 19307 19308 @Article{Wilcox:1976:DIT, 19309 author = "Thomas R. Wilcox and Alan M. Davis and Michael H. Tindall", 19310 title = "Design and Implementation of a Table Driven, Interactive Diagnostic Programming System", 19311 journal = j-CACM, 19312 volume = "19", 19313 number = "11", 19314 pages = "609--616", 19315 month = nov, 19316 year = "1976", 19317 CODEN = "CACMA2", 19318 ISSN = "0001-0782", 19319 bibdate = "Tue Mar 25 13:26:09 MST 1997", 19320 bibsource = "Compendex database", 19321 abstract = "CAPS is a highly interactive diagnostic compiler\slash interpreter that allows beginning programmers to prepare, debug, and execute fairly simple programs at a graphics display terminal. Complete syntax checking and most semantic analysis is performed as the program is entered and as it is subsequently edited. Analysis is performed character by character. The most remarkable feature of CAPS is its ability to automatically diagnose errors both at compile time and at run time. Errors are not automatically corrected. Instead, CAPS interacts with the student to help him find the cause of his error. Most components of CAPS are table driven, both to reduce the space needed for implementation and to increase the flexibility of the multilingual system. Over 500 students have used CAPS to learn Fortran, PL/I, or Cobol in conjunction with a computer assisted course on introductory computer science.", 19322 acknowledgement = ack-nhfb, 19323 classcodes = "C0220 (Computing education and training); C6110 (Systems analysis and programming); C6150C (Compilers, interpreters and other processors)", 19324 classification = "722; 723; 901", 19325 corpsource = "Univ. of Illinois, Urbana-Champaign, IL, USA", 19326 journalabr = "Commun ACM", 19327 keywords = "caps; CAPS; compiler/interpreter; compilers; computer operating systems --- Program Compilers; computer programming languages --- Procedure Orientation; computer science education; computer systems, digital; data processing --- Educational Applications; design; education --- Computer Applications; implementation; interactive diagnostic; interactive programming; Plato IV; program; program interpreters; programming system; student; table driven", 19328 treatment = "P Practical", 19329 } 19330 19331 @Article{Rubin:1976:ETF, 19332 author = "Frank Rubin", 19333 title = "Experiments in Text File Compression", 19334 journal = j-CACM, 19335 volume = "19", 19336 number = "11", 19337 pages = "617--623 (or 617--622??)", 19338 month = nov, 19339 year = "1976", 19340 CODEN = "CACMA2", 19341 ISSN = "0001-0782", 19342 bibdate = "Tue Mar 25 13:26:09 MST 1997", 19343 bibsource = "Compendex database", 19344 abstract = "A system for the compression of data files, viewed as strings of characters, is presented. \par The method is general, and applies equally well to English, to PL/I, or to digital data. The system consists of an encoder, an analysis program, and a decoder. \par Two algorithms for encoding a string differ slightly from earlier proposals. The analysis program attempts to find an optimal set of codes for representing substrings of the file. Four new algorithms for this operation are described and compared. Various parameters in the algorithms are optimized to obtain a high degree of compression for sample texts.", 19345 acknowledgement = ack-nhfb, 19346 classcodes = "C6130 (Data handling techniques)", 19347 classification = "723", 19348 corpsource = "IBM, Poughkeepsie, NY, USA", 19349 journalabr = "Commun ACM", 19350 keywords = "analysis program; comparison of algorithms; computer programming --- Subroutines; data file compaction; data processing; decoder; encoder; Huffman codes; N-gram encoding; strings of characters; text compression; text editing; text file compression", 19351 treatment = "P Practical; X Experimental", 19352 } 19353 19354 @Article{Eswaran:1976:NCP, 19355 author = "K. P. Eswaran and J. N. Gray and R. A. Lorie and I. L. Traiger", 19356 title = "The notions of consistency and predicate locks in a database system", 19357 journal = j-CACM, 19358 volume = "19", 19359 number = "11", 19360 pages = "624--633", 19361 month = nov, 19362 year = "1976", 19363 CODEN = "CACMA2", 19364 ISSN = "0001-0782", 19365 MRclass = "68A50", 19366 MRnumber = "57 2005", 19367 mrreviewer = "W. W. Armstrong", 19368 bibdate = "Tue Mar 25 13:26:09 MST 1997", 19369 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib and ftp://ftp.ira.uka.de/pub/bibliography/Database/Graefe.bib and ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib", 19370 note = "Also published in/as: IBM Research Report RJ1487, San Jose, CA, December, 1974.", 19371 abstract = "In database systems, users access shared data under the assumption that the data satisfies certain consistency constraints. This paper defines the concepts of transaction, consistency and schedule and shows that consistency requires that a transaction cannot request new locks after releasing a lock. Then it is argued that a transaction needs to lock a logical rather than a physical subset of the database. These subsets may be specified by predicates. An implementation of predicate locks which satisfies the consistency condition is suggested.", 19372 acknowledgement = ack-nhfb, 19373 annote = "If transactions are well-formed (they obtain and release all locks required to avoid conflicts) and 2-phase (they don't obtain locks after having released one), they maintain consistency. Original 2-phase protocol. Serializability? Definitions of transactions, permissible locking sequence in transactions, the importance and complexity of predicate locks. Two-phase transactions.", 19374 classcodes = "C6120 (File organisation); C7100 (Business and administration)", 19375 classification = "723; 913", 19376 corpsource = "IBM Res. Lab., San Jose, CA, USA", 19377 journalabr = "Commun ACM", 19378 keywords = "computer operating systems --- Scheduling; computer systems programming --- Multiprocessing Programs; consistency; data base systems; database management systems; database system; predicate locks; relation database IBM San Jose CACM; schedule; shared data; transaction", 19379 treatment = "P Practical", 19380 } 19381 19382 @Article{Maruyama:1976:ORD, 19383 author = "K. Maruyama and S. E. Smith", 19384 title = "Optimal Reorganization of Distributed Space Disk Files", 19385 journal = j-CACM, 19386 volume = "19", 19387 number = "11", 19388 pages = "634--642", 19389 month = nov, 19390 year = "1976", 19391 CODEN = "CACMA2", 19392 ISSN = "0001-0782", 19393 bibdate = "Tue Mar 25 13:26:09 MST 1997", 19394 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Os/storage.bib", 19395 abstract = "A basic problem in database maintenance is to establish the proper tradeoff between performance, storage costs, and reorganization costs. This paper considers the optimum points at which to reorganize database. A disk file organization which allows for distributed free space is described. The file is called a DSDF (Distributed Space Disk File). A cost function describing the excess costs due to physical disorganization is defined, and this function is minimized to obtain the optimum reorganization points. Numerical examples based on the characteristics of existing disk storage devices are given.", 19396 acknowledgement = ack-nhfb, 19397 classcodes = "C6120 (File organisation)", 19398 classification = "722; 723; 901", 19399 corpsource = "IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA", 19400 journalabr = "Commun ACM", 19401 keywords = "accessing; cost; data base systems --- Optimization; data processing --- File Organization; data storage, magnetic; database organizations; disc files; distributed space; DSDF; file organisation; information retrieval systems; insertions; magnetic disc and drum storage; memory hierarchy; performance; reorganizing; updates", 19402 treatment = "P Practical", 19403 } 19404 19405 @Article{Hamlet:1976:HBL, 19406 author = "Richard G. Hamlet", 19407 title = "High-Level Binding with Low-Level Linkers", 19408 journal = j-CACM, 19409 volume = "19", 19410 number = "11", 19411 pages = "642--644", 19412 month = nov, 19413 year = "1976", 19414 CODEN = "CACMA2", 19415 ISSN = "0001-0782", 19416 bibdate = "Tue Mar 25 13:26:09 MST 1997", 19417 bibsource = "Compendex database", 19418 abstract = "An easy to implement scheme is described by which a compiler can enforce agreement between complex data types in separately compiled modules. The scheme is designed to work with any existing link editor or linking loader, no matter how deficient. Obscure run-time errors caused by inconsistent usages are forestalled by static errors detected at linking time.", 19419 acknowledgement = ack-nhfb, 19420 classcodes = "C6150C (Compilers, interpreters and other processors)", 19421 classification = "723", 19422 corpsource = "Univ. of Maryland, College Park, MD, USA", 19423 journalabr = "Commun ACM", 19424 keywords = "agreement; compiler; complex data types; computer operating systems; computer programming languages; high level binding; link editor; low level linkers; modules; program compilers; separately compiled", 19425 treatment = "P Practical", 19426 } 19427 19428 @Article{Sammet:1976:RPL, 19429 author = "Jean E. Sammet", 19430 title = "Roster of Programming Languages for 1974--75", 19431 journal = j-CACM, 19432 volume = "19", 19433 number = "12", 19434 pages = "655--669", 19435 month = dec, 19436 year = "1976", 19437 CODEN = "CACMA2", 19438 ISSN = "0001-0782", 19439 bibdate = "Tue Mar 25 13:26:09 MST 1997", 19440 bibsource = "Compendex database", 19441 abstract = "This roster contains a list of 167 currently existing higher-level languages which have been developed or reported in the United States; have been implemented on at least one general-purpose computer; and are believed to be in use in the United States by someone other than the developer. A programming ( equals higher-level) language is defined as a set of characters and rules for combining them which has the following characteristics: the language requires no knowledge of machine code by the user; the language is significantly independent of a particular computer; there is a one-many translation of instructions from source code to object code; and the notation of the language is fairly natural to its problem area and is not a fixed tabular format. Of the total of 167 languages, 79 are in categories: numerical scientific, business data processing, list processing, string processing, formula manipulation, and multipurpose. The remaining 88 are in various specialized application areas.", 19442 acknowledgement = ack-nhfb, 19443 classcodes = "C6140D (High level languages)", 19444 classification = "723", 19445 corpsource = "IBM, Cambridge, MA, USA", 19446 journalabr = "Commun ACM", 19447 keywords = "computer programming; computer programming languages; higher level language; programming languages", 19448 treatment = "G General Review; P Practical", 19449 } 19450 19451 @Article{Arden:1976:CSE, 19452 author = "Bruce W. Arden", 19453 title = "The Computer Science and Engineering Research Study ({COSERS})", 19454 journal = j-CACM, 19455 volume = "19", 19456 number = "12", 19457 pages = "670--673", 19458 month = dec, 19459 year = "1976", 19460 CODEN = "CACMA2", 19461 ISSN = "0001-0782", 19462 bibdate = "Tue Mar 25 13:26:09 MST 1997", 19463 bibsource = "Compendex database", 19464 abstract = "The Computer Science and Engineering Research Study (COSERS) is briefly described. The motivation, organization, and schedule for this NSF supported study are given. For possible further reference, the subject area panel chairmen and the members of the Steering Committee are identified.", 19465 acknowledgement = ack-nhfb, 19466 classcodes = "C0310 (EDP management)", 19467 classification = "901; 912", 19468 corpsource = "Princeton Univ., Princeton, NJ, USA", 19469 journalabr = "Commun ACM", 19470 keywords = "computer engineering research; computer science research; computers --- Research; COSERS; engineering research; national research study; research and development management", 19471 treatment = "P Practical", 19472 } 19473 19474 @Article{Nunamaker:1976:CAD, 19475 author = "J. F. {Nunamaker, Jr.} and Benn R. {Konsynski, Jr.} and Thomas Ho and Carl Singer", 19476 title = "Computer-Aided Analysis and Design of Information Systems", 19477 journal = j-CACM, 19478 volume = "19", 19479 number = "12", 19480 pages = "674--687", 19481 month = dec, 19482 year = "1976", 19483 CODEN = "CACMA2", 19484 ISSN = "0001-0782", 19485 bibdate = "Tue Mar 25 13:26:09 MST 1997", 19486 bibsource = "Compendex database", 19487 abstract = "This paper describes the use of computer-aided analysis for the design and development of an integrated financial management system by the Navy Material Command Support Activity (NMCSA). Computer-aided analysis consists of a set of procedures and computer programs specifically designed to aid in the process of applications software design, computer selection and performance evaluation. There are four major components: Problem Statement Language, Problem Statement Analyzer, Generator of Alternative Designs, and Performance Evaluator. The statement of requirements was written in ADS (Accurately Defined Systems) and analyzed by a Problem Statement Analyzer for ADS. The analyzed problem statement was translated to the form necessary for use by the SODA (Systems Optimization and Design Algorithm) program for the generation of alternative specifications of program modules and logical database structures.", 19488 acknowledgement = ack-nhfb, 19489 classcodes = "B7900 (Military systems and equipment); B7990 (Other military topics); C6110 (Systems analysis and programming); C7120 (Financial computing); C7150 (Military computing)", 19490 classification = "723; 901", 19491 corpsource = "Univ. of Arizona, Tucson, AZ, USA", 19492 journalabr = "Commun ACM", 19493 keywords = "accurately defined systems; ads; analysis; CAD; computer aided analysis; computer systems, digital --- Computer Aided Design; computer-aided analysis; data base systems --- Computer Aided Design; data processing --- Financial Applications; financial data processing; financial management system; information retrieval systems; information systems; integrated; logic design --- Computer Aids; logical database structures; management information systems; military computing; performance evaluator; problem statement analyser; problem statement language; soda; systems", 19494 treatment = "A Application; E Economic; P Practical", 19495 } 19496 19497 @Article{Stockman:1976:SPR, 19498 author = "George Stockman and Laveen Kanal and M. C. Kyle", 19499 title = "Structural Pattern Recognition of Carotid Pulse Waves Using a General Waveform Parsing System", 19500 journal = j-CACM, 19501 volume = "19", 19502 number = "12", 19503 pages = "688--695", 19504 month = dec, 19505 year = "1976", 19506 CODEN = "CACMA2", 19507 ISSN = "0001-0782", 19508 bibdate = "Tue Mar 25 13:26:09 MST 1997", 19509 bibsource = "Compendex database", 19510 abstract = "A general waveform parsing system (WPS) with application to structural pattern recognition of carotid pulse waves is described. The carotid arterial pulse wave is of medical importance because of variation in its structure induced by arterial aging and cardiovascular disease. The syntax-driven waveform analysis system has been applied with good results to these pulse waves to detect and measure structural variations. The waveform applied with good results to these pulse waves to detect and measure structural variations. The waveform parsing system is modeled on a compiler-compiler system and allows the user to enter application specific information as data. It is thus general enough to be applicable to other waveforms.", 19511 acknowledgement = ack-nhfb, 19512 classcodes = "B6140C (Optical information, image and video signal processing); C1120 (Mathematical analysis); C1250 (Pattern recognition); C1290L (Systems theory applications in biology and medicine); C7330 (Biology and medical computing)", 19513 classification = "461; 721; 723", 19514 journalabr = "Commun ACM", 19515 keywords = "automata theory --- Context Free Languages; biomedical engineering --- Computer Aided Diagnosis; cardiovascular disease; carotid pulse waves; data processing --- Medical Information; medical computing; pattern recognition; pattern recognition systems; structural pattern recognition; waveform analysis; waveform parsing system", 19516 treatment = "T Theoretical or Mathematical", 19517 } 19518 19519 @Article{vanGelder:1977:SPC, 19520 author = "Allen {van Gelder}", 19521 title = "Structured programming in {COBOL}: an approach for application programmers", 19522 journal = j-CACM, 19523 volume = "20", 19524 number = "1", 19525 pages = "2--12", 19526 month = jan, 19527 year = "1977", 19528 CODEN = "CACMA2", 19529 ISSN = "0001-0782", 19530 bibdate = "Tue Mar 25 13:26:09 MST 1997", 19531 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1977.bib", 19532 abstract = "Techniques for designing and writing Cobol programs are presented. Previous work in structured programming is drawn upon and adapted. The presentation is informal: the terminology is nonmathematical as far as possible, no theorems are proved, and examples are used frequently. Top-down program design is implemented through the use of structured flowcharts, disciplined specifications, and step by step verification. A well-formed Cobol program is defined. The proper use of the GO TO and other Cobol coding practices are discussed.", 19533 acknowledgement = ack-nhfb, 19534 classcodes = "C6110 (Systems analysis and programming); C6140D (High level languages)", 19535 classification = "723", 19536 corpsource = "ACM, Seattle, WA, USA", 19537 country = "USA", 19538 descriptors = "Program construction; COBOL; standard;", 19539 enum = "3174", 19540 journalabr = "Commun ACM", 19541 keywords = "application; application programming; COBOL; Cobol; computer metatheory --- Programming Theory; computer programming; computer programming languages --- Cobol; flowchart; GO TO; GO TO statement; program verification; programming; repeat statement; software reliability; structured flowcharts; structured programming; top down; top-down; well formed program; well-formed program", 19542 language = "English", 19543 references = "24", 19544 treatment = "P Practical", 19545 } 19546 19547 @Article{Austing:1977:SLC, 19548 author = "Richard H. Austing and Bruce H. Barnes and Gerald L. Engel", 19549 title = "A Survey of the Literature in Computer Science Education Since {Curriculum '68}", 19550 journal = j-CACM, 19551 volume = "20", 19552 number = "1", 19553 pages = "13--21", 19554 month = jan, 19555 year = "1977", 19556 CODEN = "CACMA2", 19557 ISSN = "0001-0782", 19558 bibdate = "Tue Mar 25 13:26:09 MST 1997", 19559 bibsource = "Compendex database", 19560 abstract = "A bibliography of approximately two hundred references in computer science education appearing in the literature since the publication of ``Curriculum '68'' is presented. The bibliography itself is preceded by brief descriptive materials organizing the references into the categories of survey reports, activities of professional organizations, philosophy of programs, description of programs, description of courses and other materials.", 19561 acknowledgement = ack-nhfb, 19562 classcodes = "C0220 (Computing education and training)", 19563 classification = "723; 901; 912", 19564 corpsource = "ACM, Seattle, WA, USA", 19565 journalabr = "Commun ACM", 19566 keywords = "bibliography; computer science; computer science curricula; computer science education; computers; curricula; education; education --- Bibliographies", 19567 treatment = "B Bibliography", 19568 } 19569 19570 @Article{Babad:1977:RFP, 19571 author = "Jair M. Babad", 19572 title = "A Record and File Partitioning Model", 19573 journal = j-CACM, 19574 volume = "20", 19575 number = "1", 19576 pages = "22--31 (or 22--30??)", 19577 month = jan, 19578 year = "1977", 19579 CODEN = "CACMA2", 19580 ISSN = "0001-0782", 19581 bibdate = "Tue Mar 25 13:26:09 MST 1997", 19582 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib", 19583 abstract = "This paper presents a model in which several requests access a file system, and each request requires information from one or more variable length data-items. The file system uses one or more storage devices, and each record may be partitioned into subrecords that are stored on different devices. One of the subrecords is designated as the primary record; when a request for a record is made, the primary record is first accessed, and other subrecords are accessed only if the pertinent information is not stored in the primary record. The model that is presented in this paper, both as a nonlinear programming model and a mixed integer programming model, is a very general one; several types of file systems may be derived from it by an appropriate selection of its parameters. This model has already been used in the optimization of library routines' storage at a large scale operating system.", 19584 acknowledgement = ack-nhfb, 19585 classcodes = "C6120 (File organisation)", 19586 classification = "722; 723; 901; 921", 19587 corpsource = "Univ. of Chicago, Chicago, IL, USA", 19588 journalabr = "Commun ACM", 19589 keywords = "data processing; data storage, digital --- Mathematical Models; file design; file organisation; file partitioning; file systems; information retrieval systems --- Optimization; integer programming; integer programming model; mixed; nonlinear; nonlinear programming model; partitioning; programming; record", 19590 treatment = "A Application; P Practical; T Theoretical or Mathematical", 19591 } 19592 19593 @Article{Zobrist:1977:DCO, 19594 author = "Albert L. Zobrist and Frederick R. {Carlson, Jr.}", 19595 title = "Detection of Combined Occurrences", 19596 journal = j-CACM, 19597 volume = "20", 19598 number = "1", 19599 pages = "31--36 (or 31--35??)", 19600 month = jan, 19601 year = "1977", 19602 CODEN = "CACMA2", 19603 ISSN = "0001-0782", 19604 bibdate = "Tue Mar 25 13:26:09 MST 1997", 19605 bibsource = "Compendex database", 19606 abstract = "In this paper it is supposed that the variables x//1,\ldots{},x//n each have finite range with the variable x//i taking on p//i possible values and that the values of the variables are changing with time. It is supposed further that it is desired to detect occurrences in which some subset of the variables achieve particular values. Finally, it is supposed that the problem involves the detection of a large number of combined occurrences for a large number of changes of values of variables. Two efficient solutions for this problem are described. Both methods have the unusual property of being faster for systems where the sum p//1 plus\ldots{} plus p//n is larger. A chess playing application of the second solution algorithm is provided.", 19607 acknowledgement = ack-nhfb, 19608 classcodes = "C4240 (Programming and algorithm theory); C6110 (Systems analysis and programming); C6130 (Data handling techniques)", 19609 classification = "461; 723; 912", 19610 corpsource = "Jet Propulsion Lab., Pasadena, CA, USA", 19611 journalabr = "Commun ACM", 19612 keywords = "$n$ tuples; artificial; artificial intelligence; chess; coding; combined occurrences; computer programming; error analysis; hash coding; intelligence; pattern recognition; pattern recognition systems; programming; retrieval; secondary keys; sorting; systems science and cybernetics --- Artificial Intelligence; theory", 19613 treatment = "P Practical; T Theoretical or Mathematical", 19614 } 19615 19616 @Article{Batson:1977:SSL, 19617 author = "A. P. Batson and R. E. Brundage", 19618 title = "Segment Sizes and Lifetimes in {Algol 60} Programs", 19619 journal = j-CACM, 19620 volume = "20", 19621 number = "1", 19622 pages = "36--44", 19623 month = jan, 19624 year = "1977", 19625 CODEN = "CACMA2", 19626 ISSN = "0001-0782", 19627 bibdate = "Tue Mar 25 13:26:09 MST 1997", 19628 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Compiler/Heaps.bib", 19629 abstract = "The characteristics of the virtual memory requirements of a sample of Algol 60 programs have been measured. Distributions are presented for the sizes of memory requests and for their holding times (lifetimes). The results are presented in terms of J. B. Johnston's contour model and a simple abstract machine. They provide new empirical evidence of certain aspects of the construction and behavior of real programs, and some of their implications for the design of virtual memory systems are presented and discussed.", 19630 acknowledgement = ack-nhfb, 19631 classcodes = "C6120 (File organisation)", 19632 classification = "722; 723", 19633 corpsource = "Univ. of Virginia, Charlottesville, VA, USA", 19634 journalabr = "Commun ACM", 19635 keywords = "abstract; ALGOL; ALGOL 60; computer operating systems --- Storage Allocation; computer programming languages --- Algol; computer systems, digital; data storage, digital; Johnston's contour model; machine; program behaviour; segmentation; storage allocation; virtual memory; virtual storage", 19636 treatment = "P Practical", 19637 } 19638 19639 @Article{Gries:1977:BPB, 19640 author = "David Gries", 19641 title = "On Believing Programs to be Correct", 19642 journal = j-CACM, 19643 volume = "20", 19644 number = "1", 19645 pages = "49--50", 19646 month = jan, 19647 year = "1977", 19648 CODEN = "CACMA2", 19649 ISSN = "0001-0782", 19650 bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Compiler/garbage.collection.bib", 19651 } 19652 19653 @Article{Muller:1977:AMD, 19654 author = "Mervin E. Muller", 19655 title = "An Approach to Multidimensional Data Array Processing by Computer", 19656 journal = j-CACM, 19657 volume = "20", 19658 number = "2", 19659 pages = "63--77", 19660 month = feb, 19661 year = "1977", 19662 CODEN = "CACMA2", 19663 ISSN = "0001-0782", 19664 bibdate = "Tue Mar 25 13:26:09 MST 1997", 19665 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Parallel/Multi.bib", 19666 abstract = "Attention is first given to some of the general problems of multidimensional table and array processing. This is followed by a summary of some recent developments in array processing capabilities at the World Bank, in particular, the system identified as WRAPS (World Bank Retrieval and Array Processing System).", 19667 acknowledgement = ack-nhfb, 19668 classcodes = "C6130 (Data handling techniques)", 19669 classification = "723; 901", 19670 journalabr = "Commun ACM", 19671 keywords = "array processing; arrays; computer; data processing; information retrieval systems; multidimensional data; table lookup; World Bank Retrieval and Array Processing System; WRAPS; wraps", 19672 treatment = "P Practical", 19673 } 19674 19675 @Article{Clark:1977:ESL, 19676 author = "Douglas W. Clark and C. Cordell Green", 19677 title = "An Empirical Study of List Structure in {LISP}", 19678 journal = j-CACM, 19679 volume = "20", 19680 number = "2", 19681 pages = "78--87", 19682 month = feb, 19683 year = "1977", 19684 CODEN = "CACMA2", 19685 ISSN = "0001-0782", 19686 bibdate = "Tue Mar 25 13:26:09 MST 1997", 19687 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Compiler/garbage.collection.bib", 19688 abstract = "Static measurements of the list structure of five large Lisp programs are reported and analyzed. These measurements reveal substantial regularity, or predictability, among pointers to atoms and especially among pointers to lists. Pointers to atoms are found to obey, roughly, Zipf's law, which governs word frequencies in natural languages; pointers to lists usually point to a location physically nearby in memory. The use of such regularities in the space-efficient representation of list structure is discussed.", 19689 acknowledgement = ack-nhfb, 19690 classcodes = "C6130 (Data handling techniques); C6140D (High level languages)", 19691 classification = "723", 19692 comment = "Great paper; evidence pro CDR-coding, con fancy CONS", 19693 corpsource = "Carnegie-Mellon Univ., Pittsburgh, PA, USA", 19694 journalabr = "Commun ACM", 19695 keywords = "computer programming languages; data processing --- Data Structures; empirical study; LISP; list structure; measurements; regularity", 19696 treatment = "P Practical", 19697 } 19698 19699 @Article{Preparata:1977:CHF, 19700 author = "F. P. Preparata and S. J. Hong", 19701 title = "Convex Hulls of Finite Sets of Points in Two and Three Dimensions", 19702 journal = j-CACM, 19703 volume = "20", 19704 number = "2", 19705 pages = "87--93", 19706 month = feb, 19707 year = "1977", 19708 CODEN = "CACMA2", 19709 ISSN = "0001-0782", 19710 MRclass = "68A10 (52A25)", 19711 MRnumber = "58 8475", 19712 mrreviewer = "V. Medek", 19713 bibdate = "Tue Mar 25 13:26:09 MST 1997", 19714 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Graphics/siggraph/77.bib", 19715 abstract = "The convex hulls of sets of n points in two and three dimensions can be determined with O(n log n) operations. The presented algorithms use the ``divide and conquer'' technique and recursively apply a merge procedure for two nonintersecting convex hulls. Since any convex hull algorithm requires at least O(n log n) operations, the time complexity of the proposed algorithms is optimal within a multiplicative constant.", 19716 acknowledgement = ack-nhfb, 19717 annote = "$O(n \log n)$ time", 19718 classcodes = "C6130B (Graphics techniques)", 19719 classification = "723; 931", 19720 corpsource = "Univ. of Illinois, Urbana-Champaign, IL, USA", 19721 journalabr = "Commun ACM", 19722 keywords = "complexity; computational complexity; computer graphics; computer programming; convex hull algorithm; divide-and-conquer; finite sets of points; structural analysis --- Computer Applications; time; worst-case analysis", 19723 treatment = "A Application; T Theoretical or Mathematical", 19724 } 19725 19726 @Article{Easton:1977:TFW, 19727 author = "M. C. Easton and B. T. Bennett", 19728 title = "Transient-Free Working-Set Statistics", 19729 journal = j-CACM, 19730 volume = "20", 19731 number = "2", 19732 pages = "93--99", 19733 month = feb, 19734 year = "1977", 19735 CODEN = "CACMA2", 19736 ISSN = "0001-0782", 19737 MRclass = "68A20", 19738 MRnumber = "58 25108", 19739 mrreviewer = "A. D. Booth", 19740 bibdate = "Tue Mar 25 13:26:09 MST 1997", 19741 bibsource = "Compendex database", 19742 abstract = "Transient free-average working-set size and transient-free missing-page rate for a finite sample of a reference string are defined. Use of these statistics is appropriate if the contents of the working set at the start of the recorded string are unknown. If a certain stationarity condition holds, these statistics provide unbiased estimates of expected working-set sizes, missing-page probabilities, and interference distance probabilities. Two other pairs of estimators are shown to be biased. Expressions for the transient-free statistics are obtained in terms of interval statistics. Methods are described for handling long strings containing many distinct page names.", 19743 acknowledgement = ack-nhfb, 19744 classcodes = "C4240 (Programming and algorithm theory); C6110 (Systems analysis and programming)", 19745 classification = "723; 922", 19746 corpsource = "IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA", 19747 journalabr = "Commun ACM", 19748 keywords = "computer operating systems; statistical methods", 19749 keywords = "missing page rate; programming; statistics; transient free; working set", 19750 treatment = "A Application; T Theoretical or Mathematical", 19751 } 19752 19753 @Article{Bresenham:1977:LAI, 19754 author = "Jack Bresenham", 19755 title = "A Linear Algorithm for Incremental Digital Display of Circular Arcs", 19756 journal = j-CACM, 19757 volume = "20", 19758 number = "2", 19759 pages = "100--106", 19760 month = feb, 19761 year = "1977", 19762 CODEN = "CACMA2", 19763 ISSN = "0001-0782", 19764 bibdate = "Tue Mar 25 13:26:09 MST 1997", 19765 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Graphics/imager/imager.77.bib", 19766 abstract = "Circular arcs can be drawn on an incremental display device such as a cathode ray tube, digital plotter, or matrix printer using only sign testing and elementary addition and subtraction. This paper describes methodology for producing dot or step patterns closest to the true circle.", 19767 acknowledgement = ack-nhfb, 19768 classcodes = "C6130B (Graphics techniques)", 19769 classification = "723", 19770 corpsource = "IBM System Communications Div., Palo Alto, CA, USA", 19771 journalabr = "Commun ACM", 19772 keywords = "addition; arc generation; arcs; circle drawing; circular; computer graphics; computer programming --- Subroutines; dot generation; imaging techniques; incremental digital display; linear algorithm; raster display; sign testing; subtraction", 19773 treatment = "P Practical", 19774 } 19775 19776 @Article{Kotiah:1977:OCO, 19777 author = "Thoddi C. T. Kotiah and David I. Steinberg", 19778 title = "Occurrences of Cycling and Other Phenomena Arising in a Class of Linear Programming Models", 19779 journal = j-CACM, 19780 volume = "20", 19781 number = "2", 19782 pages = "107--112", 19783 month = feb, 19784 year = "1977", 19785 CODEN = "CACMA2", 19786 ISSN = "0001-0782", 19787 bibdate = "Tue Mar 25 13:26:09 MST 1997", 19788 bibsource = "Compendex database", 19789 abstract = "An investigation into the average queue size for a certain class of queues has resulted in the formulation of linear programming problems which are ill-conditioned in some cases. In attempting to solve these linear programming models, using IBM's MPS package, instances of cycling were encountered. Small perturbations in the input data resulted in problems which did not cycle. This fact, plus several other observed phenomena suggest that the primary reason that cycling is not known to occur more frequently is that round-off errors in the computations perturb the problem sufficiently to prevent cycling (or at least to prevent indefinite cycling).", 19790 acknowledgement = ack-nhfb, 19791 classcodes = "C1140C (Queueing theory); C1180 (Optimisation techniques)", 19792 classification = "723; 921; 922", 19793 corpsource = "Southern Illinois Univ., Edwardsville, IL, USA", 19794 journalabr = "Commun ACM", 19795 keywords = "average queue size; cycling; linear programming; mathematical programming, linear; MPS package; phenomena; probability --- Queueing Theory; queueing theory", 19796 treatment = "T Theoretical or Mathematical", 19797 } 19798 19799 @Article{Knott:1977:NSB, 19800 author = "Gary D. Knott", 19801 title = "A Numbering System for Binary Trees", 19802 journal = j-CACM, 19803 volume = "20", 19804 number = "2", 19805 pages = "113--115", 19806 month = feb, 19807 year = "1977", 19808 CODEN = "CACMA2", 19809 ISSN = "0001-0782", 19810 bibdate = "Tue Mar 25 13:26:09 MST 1997", 19811 acknowledgement = ack-nhfb, 19812 classcodes = "B0250 (Combinatorial mathematics); C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", 19813 corpsource = "Nat. Inst. of Health, Bethesda, MD, USA", 19814 keywords = "binary search trees; binary trees; numbering system; permutations; ranking function; trees (mathematics)", 19815 treatment = "T Theoretical or Mathematical", 19816 } 19817 19818 @Article{Clapson:1977:IAT, 19819 author = "Philip Clapson", 19820 title = "Improving the Access Time for Random Access Files", 19821 journal = j-CACM, 19822 volume = "20", 19823 number = "3", 19824 pages = "127--135", 19825 month = mar, 19826 year = "1977", 19827 CODEN = "CACMA2", 19828 ISSN = "0001-0782", 19829 bibdate = "Tue Mar 25 13:26:09 MST 1997", 19830 bibsource = "Compendex database", 19831 abstract = "Clustering in the key set is decreased by smoothing the key-to-address transformation, and by adding shadow buckets to an open chaining file. The keys are pre-hashed before the address division, to remove the effect of sequential properties in the key set. Shadow buckets in the key search sequence reduce the effect of nonuniformity in file loading, and decrease the number of maximum probes needed to locate a record. The combined effects of these techniques lead to improved file performance for secondary storage devices, as shown by empirical studies.", 19832 acknowledgement = ack-nhfb, 19833 classcodes = "C6120 (File organisation)", 19834 classification = "723; 901", 19835 corpsource = "IBM United Kingdom Ltd., Feltham, UK", 19836 journalabr = "Commun ACM", 19837 keywords = "access time; chaining file; data processing --- File Organization; data storage, digital; file loading; file organisation; improved file; information retrieval systems --- Design; key search sequence; maximum probes; nonuniformity; open; performance; random access files; secondary storage devices; sequential properties; shadow buckets", 19838 treatment = "P Practical", 19839 } 19840 19841 @Article{Yu:1977:EIR, 19842 author = "C. T. Yu and G. Salton", 19843 title = "Effective Information Retrieval Using Term Accuracy", 19844 journal = j-CACM, 19845 volume = "20", 19846 number = "3", 19847 pages = "135--142", 19848 month = mar, 19849 year = "1977", 19850 CODEN = "CACMA2", 19851 ISSN = "0001-0782", 19852 MRclass = "68A50", 19853 MRnumber = "55 7012", 19854 mrreviewer = "Fujio Nishida", 19855 bibdate = "Tue Mar 25 13:26:09 MST 1997", 19856 bibsource = "Compendex database", 19857 abstract = "Evaluation of a retrieval system in this study is based on optimizing the performance of a specific user query. The concept of query term accuracy is introduced as the probability of occurrence of a query term in the documents relevant to that query. By relating term accuracy to the frequency of occurrence of the term in the documents of a collection it is possible to give formal proofs of the effectiveness with respect to a given user query of a number of automatic indexing systems that have been used successfully in experimental situations. Among these are inverse document frequency weighting, thesaurus construction, and phrase generation.", 19858 acknowledgement = ack-nhfb, 19859 classcodes = "C7250 (Information storage and retrieval)", 19860 classification = "723; 901", 19861 corpsource = "Univ. of Alberta, Edmonton, Alta., Canada", 19862 journalabr = "Commun ACM", 19863 keywords = "automatic indexing; concept; evaluation; formal proofs; information retrieval; information retrieval system evaluation; information retrieval systems; information science --- Indexing; performance; query term accuracy", 19864 treatment = "T Theoretical or Mathematical", 19865 } 19866 19867 @Article{Lunde:1977:EES, 19868 author = "Amund Lunde", 19869 title = "Empirical Evaluation of Some Features of Instruction Set Processor Architectures", 19870 journal = j-CACM, 19871 volume = "20", 19872 number = "3", 19873 pages = "143--153", 19874 month = mar, 19875 year = "1977", 19876 CODEN = "CACMA2", 19877 ISSN = "0001-0782", 19878 bibdate = "Tue Mar 25 13:26:09 MST 1997", 19879 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Misc/risc.bib", 19880 abstract = "This paper presents methods for empirical evaluation of features of Instruction Set Processors (ISPs). ISP features are evaluated in terms of the time used or saved by having or not having the feature. \par The methods are based on analysis of traces of program executions. The concept of a register life is in troduced, and used to answer questions like: How many registers are used simultaneously? How many would be sufficient all of the time? Most of the time? What would the overhead be if the number of registers were reduced? What are registers used for during their lives? The paper also discusses the problem of detecting desirable but non-existing instructions. Other problems are briefly discussed. Experimental results are presented, obtained by analyzing 41 programs running on the DEC system 10 ISP.", 19881 acknowledgement = ack-nhfb, 19882 classcodes = "C5220 (Computer architecture); C6150G (Diagnostic, testing, debugging and evaluating systems)", 19883 classification = "722; 723", 19884 corpsource = "Carnegie-Mellon Univ., Pittsburg, PA, USA", 19885 journalabr = "Commun ACM", 19886 keywords = "architectures; computer architecture; computer programming languages --- Machine Orientation; computer selection and evaluation; computers, digital --- General Purpose Application; evaluation; execution time; instruction set processor; instruction sets; instruction tracing; microcoding; MIPS; op code utilization; pipelining; program behavior; reduced; register life; register structures; register utilization; restricted instruction set computer architecture; RISC; simultaneous register lives", 19887 treatment = "A Application; T Theoretical or Mathematical", 19888 } 19889 19890 @Article{Brown:1977:MMR, 19891 author = "R. M. Brown and J. C. Browne and K. M. Chandy", 19892 title = "Memory Management and Response Time", 19893 journal = j-CACM, 19894 volume = "20", 19895 number = "3", 19896 pages = "153--165", 19897 month = mar, 19898 year = "1977", 19899 CODEN = "CACMA2", 19900 ISSN = "0001-0782", 19901 MRclass = "68A50 (60K30)", 19902 MRnumber = "55 6996", 19903 mrreviewer = "Jacek Blazewicz", 19904 bibdate = "Tue Mar 25 13:26:09 MST 1997", 19905 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Distributed/simulan.bib", 19906 abstract = "This paper presents a methodology for including the effects of finite memory size and workload memory requirements in queueing network models of computer systems. Empirical analyses and analytic studies based on applying this methodology to an actual multiaccess interactive system are reported. A multiphase, analytically soluble model is proposed as being broadly applicable to the analysis of interactive computer systems which use nonpaged memories.", 19907 acknowledgement = ack-nhfb, 19908 classcodes = "C6120 (File organisation)", 19909 classification = "722; 723; 922", 19910 corpsource = "Univ. of Texas, Austin, TX, USA", 19911 journalabr = "Commun ACM", 19912 keywords = "computer operating systems --- Storage Allocation; computer systems, digital; distribution; interactive computer; job swap time; memory; memory requirement; model; multi-access systems; multiphase; nonpaged memories; performance measures; probability --- Queueing Theory; response time; storage management; systems; utilization; workload variables", 19913 treatment = "T Theoretical or Mathematical", 19914 } 19915 19916 @Article{Burton:1977:RMS, 19917 author = "Warren Burton", 19918 title = "Representation of Many-Sided Polygons and Polygonal Lines for Rapid Processing", 19919 journal = j-CACM, 19920 volume = "20", 19921 number = "3", 19922 pages = "166--171", 19923 month = mar, 19924 year = "1977", 19925 CODEN = "CACMA2", 19926 ISSN = "0001-0782", 19927 bibdate = "Tue Mar 25 13:26:09 MST 1997", 19928 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/siggraph/77.bib", 19929 abstract = "A representation for polygons and polygonal lines is described which allows sets of consecutive sides to be collectively examined. The sets of sides are arranged in a binary tree hierarchy by inclusion. A fast algorithm for testing the inclusion of a point in a many-sided polygon is given. It is shown that the points of intersection of two polygonal lines can be located by what is essentially a binary tree search. The algorithm and a practical example are discussed.", 19930 acknowledgement = ack-nhfb, 19931 classcodes = "C6130B (Graphics techniques)", 19932 classification = "723; 921", 19933 corpsource = "Michigan Tech. Univ., Houghton, MI, USA", 19934 journalabr = "Commun ACM", 19935 keywords = "computer programming --- Subroutines; data processing --- Natural Sciences Applications; image processing; mathematical techniques --- Trees", 19936 keywords = "binary tree hierarchy; computer graphics; fast algorithm; inclusion; polygonal lines; polygons; rapid processing; representation; speed", 19937 treatment = "A Application; T Theoretical or Mathematical", 19938 } 19939 19940 @Article{Hunt:1977:OSR, 19941 author = "H. B. {Hunt, III} and T. G. Szymanski and J. D. Ullman", 19942 title = "Operations on Sparse Relations", 19943 journal = j-CACM, 19944 volume = "20", 19945 number = "3", 19946 pages = "171--176", 19947 month = mar, 19948 year = "1977", 19949 CODEN = "CACMA2", 19950 ISSN = "0001-0782", 19951 MRclass = "68A20 (68A30)", 19952 MRnumber = "55 4774", 19953 mrreviewer = "Armin Cremers", 19954 bibdate = "Tue Mar 25 13:26:09 MST 1997", 19955 bibsource = "Compendex database", 19956 abstract = "Various computations on relations, Boolean matrices, or directed graphs, such as the computation of precedence relations for a context-free grammar, can be done by a practical algorithm that is asymptotically faster than those in common use. The heart of the algorithms is a general theorem giving sufficient conditions under which an expression whose operands are sparse relations and whose operators are composition, transitive closure, union, and inverse, can be computed efficiently.", 19957 acknowledgement = ack-nhfb, 19958 classcodes = "C4210 (Formal logic)", 19959 classification = "721; 723", 19960 corpsource = "Harvard Univ., Cambridge, MA, USA", 19961 journalabr = "Commun ACM", 19962 keywords = "automata theory --- Grammars; computational complexity; computations; computer metatheory --- Programming Theory; computer programming; context free grammar; context-free grammars; precedence relations; sparse relations", 19963 treatment = "T Theoretical or Mathematical", 19964 } 19965 19966 @Article{Nolan:1977:ECU, 19967 author = "Richard L. Nolan", 19968 title = "Effects of Chargeout on User\slash Manager Attitudes", 19969 journal = j-CACM, 19970 volume = "20", 19971 number = "3", 19972 pages = "177--185", 19973 month = mar, 19974 year = "1977", 19975 CODEN = "CACMA2", 19976 ISSN = "0001-0782", 19977 bibdate = "Tue Mar 25 13:26:09 MST 1997", 19978 bibsource = "Compendex database", 19979 abstract = "The relationship of internal pricing systems for computer services (chargeout systems) and user management attitudes about their computer-based information systems is investigated. Development and maintenance of computer-based systems is asserted to be a category of organizational change. A ``felt need'' for the change on the part of the user\slash manager is prerequisite to any change taking place. The research methods of behavioral science are applied to investigate the user\slash manager environment and the effects of chargeout.", 19980 acknowledgement = ack-nhfb, 19981 classcodes = "C0310 (EDP management)", 19982 classification = "723", 19983 corpsource = "Harvard Univ., Boston, MA, USA", 19984 journalabr = "Commun ACM", 19985 keywords = "attitudes; chargeout; computer facilities; computer services; data processing, business; DP management; internal pricing systems; user/manager attitudes", 19986 treatment = "E Economic", 19987 } 19988 19989 @Article{Borovits:1977:CUM, 19990 author = "Israel Borovits and Philip Ein-Dor", 19991 title = "Cost\slash utilization: {A} measure of system performance", 19992 journal = j-CACM, 19993 volume = "20", 19994 number = "3", 19995 pages = "185--191", 19996 month = mar, 19997 year = "1977", 19998 CODEN = "CACMA2", 19999 ISSN = "0001-0782", 20000 bibdate = "Tue Mar 25 13:26:09 MST 1997", 20001 bibsource = "Compendex database", 20002 abstract = "A method is presented for evaluating computer system performance in terms of a cost\slash utilization factor and a measure of imbalance. These coefficients indicate the extent to which the total system cost is effectively utilized. The method includes a technique for the visual representation of system performance.", 20003 acknowledgement = ack-nhfb, 20004 classcodes = "C0310 (EDP management); C6150G (Diagnostic, testing, debugging and evaluating systems)", 20005 classification = "723; 911", 20006 corpsource = "Tel-Aviv Univ., Tel-Aviv, Israel", 20007 journalabr = "Commun ACM", 20008 keywords = "computer systems, digital; cost accounting", 20009 keywords = "computer; computer selection and evaluation; cost; cost/utilization factor; evaluating; measure; measure of imbalance; system performance; total system", 20010 treatment = "E Economic; P Practical", 20011 } 20012 20013 @Article{Bays:1977:CNF, 20014 author = "C. Bays", 20015 title = "A comparison of next-fit, first-fit, and best-fit", 20016 journal = j-CACM, 20017 volume = "20", 20018 number = "3", 20019 pages = "191--192", 20020 month = mar, 20021 year = "1977", 20022 CODEN = "CACMA2", 20023 ISSN = "0001-0782", 20024 bibdate = "Tue Mar 25 13:26:09 MST 1997", 20025 acknowledgement = ack-nhfb, 20026 classcodes = "C6120 (File organisation)", 20027 corpsource = "Univ. of South Carolina, Columbia, SC, USA", 20028 keywords = "best; comparison; first fit; fit; next fit; storage allocation", 20029 treatment = "P Practical", 20030 } 20031 20032 @Article{Bertsch:1977:SRP, 20033 author = "Eberhard Bertsch", 20034 title = "The storage requirement in precedence parsing", 20035 journal = j-CACM, 20036 volume = "20", 20037 number = "3", 20038 pages = "192--196 (or 192--194??)", 20039 month = mar, 20040 year = "1977", 20041 CODEN = "CACMA2", 20042 ISSN = "0001-0782", 20043 bibdate = "Tue Mar 25 13:26:09 MST 1997", 20044 bibsource = "Compendex database", 20045 abstract = "Precedence tables and linear precedence functions have been used and extensively studied as aids for syntax-directed compiling. If a precedence table exists but cannot be reshaped into a pair of precedence functions, several techniques for eliminating blank entries may be used. In that case, all nonblank entries have to be kept, however. Thus, there is a considerable gap between the storage requirements of precedence functions and precedence tables. The purpose of this paper is to show that the gap between precedence functions and precedence tables can be closed in a natural way.", 20046 acknowledgement = ack-nhfb, 20047 classcodes = "C6150C (Compilers, interpreters and other processors)", 20048 classification = "723", 20049 corpsource = "Univ des Saarlandes, Saarbrucken, West Germany", 20050 journalabr = "Commun ACM", 20051 keywords = "computer metatheory --- Programming Theory; computer operating systems; computer programming --- Subroutines; precedence parsing; program compilers; storage requirement; value table", 20052 treatment = "A Application; T Theoretical or Mathematical", 20053 } 20054 20055 @Article{Morris:1977:SI, 20056 author = "James H. {Morris, Jr.} and Ben Wegbreit", 20057 title = "Subgoal Induction", 20058 journal = j-CACM, 20059 volume = "20", 20060 number = "4", 20061 pages = "209--222", 20062 month = apr, 20063 year = "1977", 20064 CODEN = "CACMA2", 20065 ISSN = "0001-0782", 20066 MRclass = "68A05", 20067 MRnumber = "56 4222", 20068 mrreviewer = "Andrea Maggiolo-Schettini", 20069 bibdate = "Tue Mar 25 13:26:09 MST 1997", 20070 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Misc/Functional.bib", 20071 abstract = "A proof method, subgoal induction, is presented as an alternative or supplement to the commonly used inductive assertion method. Its major virtue is that it can often be used to prove a loop's correctness directly from its input-output specification without the use of an invariant. The relation between subgoal induction and other commonly used induction rules is explored and, in particular, it is shown that subgoal induction can be viewed as a specialized form of computation induction.", 20072 acknowledgement = ack-nhfb, 20073 classcodes = "C4240 (Programming and algorithm theory)", 20074 classification = "723", 20075 corpsource = "Xerox Palo Alto Res. Center, Palo Alto, CA, USA", 20076 journalabr = "Commun ACM", 20077 keywords = "computer metatheory --- Programming Theory; computer programming; computer programming languages --- Program Debugging; functional verification correctness; program proving; programming theory; subgoal induction", 20078 treatment = "T Theoretical or Mathematical", 20079 } 20080 20081 @Article{Tanimoto:1977:EPS, 20082 author = "Steven L. Tanimoto and Theodosios Pavlidis", 20083 title = "Editing of Picture Segmentations Using Local Analysis of Graphs", 20084 journal = j-CACM, 20085 volume = "20", 20086 number = "4", 20087 pages = "223--229", 20088 month = apr, 20089 year = "1977", 20090 CODEN = "CACMA2", 20091 ISSN = "0001-0782", 20092 bibdate = "Tue Mar 25 13:26:09 MST 1997", 20093 bibsource = "Compendex database", 20094 abstract = "A major problem in picture processing is the elimination of the large number of spurious regions that result from an initial segmentation by region growing techniques. This paper describes a nonsemantic editing scheme which performs eliminations on the basis of local properties of the region adjacency graph. The scheme is based on definitions of graph properties which are satisfied when a spurious region is present; then editing is equivalent to fast graph operations. A number of examples are shown.", 20095 acknowledgement = ack-nhfb, 20096 classcodes = "B6140C (Optical information, image and video signal processing); C1250 (Pattern recognition)", 20097 classification = "723; 921", 20098 corpsource = "Univ. of Connecticut, Storrs, CT, USA", 20099 journalabr = "Commun ACM", 20100 keywords = "editing; graphs; image processing; local analysis; mathematical techniques --- Graph Theory; pattern recognition systems; picture processing; picture segmentations", 20101 treatment = "T Theoretical or Mathematical", 20102 } 20103 20104 @Article{Findler:1977:SMC, 20105 author = "Nicholas V. Findler", 20106 title = "Studies in Machine Cognition Using the Game of Poker", 20107 journal = j-CACM, 20108 volume = "20", 20109 number = "4", 20110 pages = "230--245", 20111 month = apr, 20112 year = "1977", 20113 CODEN = "CACMA2", 20114 ISSN = "0001-0782", 20115 bibdate = "Tue Mar 25 13:26:09 MST 1997", 20116 bibsource = "Compendex database", 20117 abstract = "A progress report is presented of on-going research efforts concerning human decision-making under uncertainty and risk and human problem-solving and learning processes on the one hand, and machine learning, large scale programming system, and novel programming techniques on the other. There has also been interest in how humans make deductive and inductive inferences and form and optimize heuristic rules, and how machines can reach similar results. Although the vehicle of these investigations has been the game of poker, a conceptual framework has been provided that should have a fairly wide range of applicability.", 20118 acknowledgement = ack-nhfb, 20119 classcodes = "C1230 (Artificial intelligence)", 20120 classification = "461; 723; 912; 922", 20121 corpsource = "State Univ. of New York, Buffalo, NY, USA", 20122 journalabr = "Commun ACM", 20123 keywords = "artificial intelligence; data processing --- Psychology Applications; decision theory and analysis; human decision making; human problem solving; large scale programming systems; learning; machine cognition; machine learning; poker; probability; processes; risk; systems science and cybernetics; uncertainty", 20124 treatment = "T Theoretical or Mathematical", 20125 } 20126 20127 @Article{Maruyama:1977:ADA, 20128 author = "K. Maruyama and S. E. Smith", 20129 title = "Analysis of Design Alternatives for Virtual Memory Indexes", 20130 journal = j-CACM, 20131 volume = "20", 20132 number = "4", 20133 pages = "245--254", 20134 month = apr, 20135 year = "1977", 20136 CODEN = "CACMA2", 20137 ISSN = "0001-0782", 20138 bibdate = "Tue Mar 25 13:26:09 MST 1997", 20139 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib", 20140 abstract = "A class of index structures modeled after the structure of VSAM --- similar to B-trees but biased toward sequential processing --- is described. Design alternatives within this class of index structures are analyzed. These alternatives include a choice of search strategy, whether or not pages in the index are structured, and whether or not keys are compressed. The average cost of retrieving entries from these indexes is expressed as a weighted sum of the cost of a basic key comparison and the cost of crossing a page boundary in the index structure. Formulas for the retrieval costs for possible combinations of design alternatives are given.", 20141 acknowledgement = ack-nhfb, 20142 classcodes = "C6120 (File organisation)", 20143 classification = "723", 20144 corpsource = "IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA", 20145 journalabr = "Commun ACM", 20146 keywords = "compressed; costs; data processing --- Data Handling; data storage, digital; design alternatives; index structures; pages; retrieval; search strategy; structured; virtual memory; virtual storage", 20147 treatment = "P Practical", 20148 } 20149 20150 @Article{Lucas:1977:SHS, 20151 author = "Henry C. {Lucas, Jr.} and Jimmy A. Sutton", 20152 title = "Stage Hypothesis and the {S}-Curve: Some Contradictory Evidence", 20153 journal = j-CACM, 20154 volume = "20", 20155 number = "4", 20156 pages = "254--259", 20157 month = apr, 20158 year = "1977", 20159 CODEN = "CACMA2", 20160 ISSN = "0001-0782", 20161 bibdate = "Tue Mar 25 13:26:09 MST 1997", 20162 bibsource = "Compendex database", 20163 abstract = "The s-shaped budget curve of R. Nolan's stage model of computer development in an organization (Comm ACM v 16 n 7 Jul 1973 p 399) is tested. Research on the data processing budgets of California counties fails to support the s-shaped curve or the use of budgets as a basis for a stage model. However, the results do not invalidate the concept of a stage model. The analysis suggests an alternative model of budget growth and a separation between models of budgeting growth and growth stages in the development of the computer resource.", 20164 acknowledgement = ack-nhfb, 20165 classcodes = "C0310 (EDP management)", 20166 classification = "723; 911; 912", 20167 corpsource = "New York Univ., New York, NY, USA", 20168 journalabr = "Commun ACM", 20169 keywords = "budget curve; computer development; data; data processing; DP management; management --- Applications; processing budgets; stage hypothesis", 20170 treatment = "T Theoretical or Mathematical", 20171 } 20172 20173 @Article{Yao:1977:ABA, 20174 author = "S. B. Yao", 20175 title = "Approximating block accesses in database organizations", 20176 journal = j-CACM, 20177 volume = "20", 20178 number = "4", 20179 pages = "260--261", 20180 month = apr, 20181 year = "1977", 20182 CODEN = "CACMA2", 20183 ISSN = "0001-0782", 20184 bibdate = "Tue Mar 25 13:26:09 MST 1997", 20185 bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Database/Graefe.bib and ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib", 20186 acknowledgement = ack-nhfb, 20187 classcodes = "C6120 (File organisation)", 20188 corpsource = "Purdue Univ., West Lafayette, IN, USA", 20189 keywords = "approximating; block accesses; database organizations; file organisation; inverted file; selectivity estimation I/O cost query optimization CACM", 20190 treatment = "A Application; T Theoretical or Mathematical", 20191 xxtitle = "Approximating Block Accesses in Database Organization", 20192 } 20193 20194 @Article{Hollander:1977:RUI, 20195 author = "C. R. Hollander", 20196 title = "Remark on uniform insertion on structured data structures", 20197 journal = j-CACM, 20198 volume = "20", 20199 number = "4", 20200 pages = "261--262", 20201 month = apr, 20202 year = "1977", 20203 CODEN = "CACMA2", 20204 ISSN = "0001-0782", 20205 bibdate = "Tue Mar 25 13:26:09 MST 1997", 20206 acknowledgement = ack-nhfb, 20207 classcodes = "C6120 (File organisation)", 20208 corpsource = "IBM Sci. Center, Palo Alto, CA, USA", 20209 keywords = "data structures; structured data structures; uniform insertion", 20210 treatment = "T Theoretical or Mathematical", 20211 } 20212 20213 @Article{Bandyopadhyay:1977:CWI, 20214 author = "S. K. Bandyopadhyay", 20215 title = "Comment on weighted increment linear search for scatter tables", 20216 journal = j-CACM, 20217 volume = "20", 20218 number = "4", 20219 pages = "262--263", 20220 month = apr, 20221 year = "1977", 20222 CODEN = "CACMA2", 20223 ISSN = "0001-0782", 20224 bibdate = "Tue Mar 25 13:26:09 MST 1997", 20225 acknowledgement = ack-nhfb, 20226 classcodes = "C6120 (File organisation)", 20227 corpsource = "Aeronautical Dev. Establ., Bangalore, India", 20228 keywords = "address; file organisation; hash; primary clustering; scatter tables; weighted increment linear search", 20229 treatment = "P Practical", 20230 } 20231 20232 @Article{Thompson:1977:SMC, 20233 author = "C. D. Thompson and H. T. Kung", 20234 title = "Sorting on a Mesh-Connected Parallel Computer", 20235 journal = j-CACM, 20236 volume = "20", 20237 number = "4", 20238 pages = "263--271", 20239 month = apr, 20240 year = "1977", 20241 CODEN = "CACMA2", 20242 ISSN = "0001-0782", 20243 MRclass = "68A10 (68A20)", 20244 MRnumber = "55 11693", 20245 mrreviewer = "Jo Ann Howell", 20246 bibdate = "Tue Mar 25 13:26:09 MST 1997", 20247 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Parallel/par.comm.bib", 20248 abstract = "Two algorithms are presented for sorting n**2 elements on an n multiplied by n mesh-connected processor array that require O (n) routing and comparison steps. The best previous algorithm takes time O(n log n). The algorithms are shown to be optimal in time within small constant factors. Extensions to higher-dimensional arrays are also given.", 20249 acknowledgement = ack-nhfb, 20250 classcodes = "C6130 (Data handling techniques)", 20251 classification = "722; 723", 20252 corpsource = "Carnegie-Mellon Univ., Pittsburgh, PA, USA", 20253 journalabr = "Commun ACM", 20254 keywords = "computer programming --- Subroutines; computer systems programming --- Sorting; computer systems, digital", 20255 keywords = "mesh connected; parallel computer; parallel processing; sorting", 20256 treatment = "P Practical", 20257 } 20258 20259 @Article{Robinson:1977:PTH, 20260 author = "Lawrence Robinson and Karl N. Levitt", 20261 title = "Proof Techniques for Hierarchically Structured Programs", 20262 journal = j-CACM, 20263 volume = "20", 20264 number = "4", 20265 pages = "271--283", 20266 month = apr, 20267 year = "1977", 20268 CODEN = "CACMA2", 20269 ISSN = "0001-0782", 20270 MRclass = "68A05", 20271 MRnumber = "57 14584", 20272 mrreviewer = "Franco Sirovich", 20273 bibdate = "Tue Mar 25 13:26:09 MST 1997", 20274 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Compiler/semantics.bib", 20275 abstract = "A method for describing and structuring programs that simplifies proofs of their correctness is presented. The method formally represents a program in terms of levels of abstraction, each level of which can be described by a self-contained nonprocedural specification. The proofs, like the programs, are structured by levels. Although only manual proofs are described, the method is also applicable to semiautomatic and automatic proofs. Preliminary results indicate that the method can be applied to large programs, such as operating systems.", 20276 acknowledgement = ack-nhfb, 20277 classcodes = "C6110 (Systems analysis and programming)", 20278 classification = "461; 723; 912", 20279 corpsource = "Stanford Res. Inst., Menlo Park, CA, USA", 20280 journalabr = "Commun ACM", 20281 keywords = "computer metatheory --- Programming Theory; computer programming; correctness; hierarchically structured programs; program testing; proofs; structured programming; systems science and cybernetics --- Hierarchical Systems", 20282 treatment = "P Practical", 20283 } 20284 20285 @Article{Holt:1977:SKS, 20286 author = "R. C. Holt and D. B. Wortman and D. T. Barnard and J. R. Cordy", 20287 title = "{SP/k}: {A} System for Teaching Computer Programming", 20288 journal = j-CACM, 20289 volume = "20", 20290 number = "5", 20291 pages = "301--309", 20292 month = may, 20293 year = "1977", 20294 CODEN = "CACMA2", 20295 ISSN = "0001-0782", 20296 bibdate = "Tue Mar 25 13:26:09 MST 1997", 20297 bibsource = "Compendex database", 20298 abstract = "SP/k, a compatible subset of the PL/I language, is a sequence of language subsets called SP/1, SP/2,\ldots{} SP/8. Each subset introduces new programming language constructs while retaining all the constructs of preceding subsets. The features of the SP/k language were chosen to encourage structured problem solving by computers, to make the language easy to learn and use, to eliminate confusing and redundant constructs, and to make the language easy to compile. Language features, processor design, and system experience are discussed.", 20299 acknowledgement = ack-nhfb, 20300 classcodes = "C0220 (Computing education and training); C6110 (Systems analysis and programming); C6140D (High level languages)", 20301 classification = "723; 901", 20302 corpsource = "Univ. of Toronto, Toronto, Ont., Canada", 20303 journalabr = "Commun ACM", 20304 keywords = "compatible subset; computer programming; computer science education; PL/1; PL/I language; programming; SP/k; teaching", 20305 keywords = "computer programming languages; education", 20306 treatment = "P Practical", 20307 } 20308 20309 @Article{Fishman:1977:ASA, 20310 author = "George S. Fishman", 20311 title = "Achieving Specific Accuracy in Simulation Output Analysis", 20312 journal = j-CACM, 20313 volume = "20", 20314 number = "5", 20315 pages = "310--315", 20316 month = may, 20317 year = "1977", 20318 CODEN = "CACMA2", 20319 ISSN = "0001-0782", 20320 bibdate = "Tue Mar 25 13:26:09 MST 1997", 20321 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1977.bib", 20322 abstract = "This paper extends the use of the regenerative property of queueing systems in the analysis of simulation output. In particular, it describes a sequential estimation method which when used with the regenerative property allows results to be obtained with specified statistical accuracy. This method includes a test to check the normality assumption on which the sequential procedure relies. The paper illustrates the method using the empty and idle state as the regenerative state. A second example then describes how using the most frequently entered state as the regenerative state reduces the chance of making a costly error in a preliminary simulation run. The paper also described how a variance reduction method due to Page [9] can be used to obtain a specified accuracy with considerably fewer job completions than are required when no variance reduction technique is applied.", 20323 acknowledgement = ack-nhfb, 20324 classcodes = "C1220 (Simulation, modelling and identification)", 20325 classification = "723; 912; 922", 20326 corpsource = "Univ. of North Carolina, Chapel Hill, NC, USA", 20327 country = "USA", 20328 descriptors = "Simulation; time series analysis;", 20329 enum = "952", 20330 journalabr = "Commun ACM", 20331 keywords = "accuracy; computer simulation; confidence in terval; mathematical statistics; operations research --- Computer Applications; probability --- Queueing Theory; queueing systems; queueing theory; ratio estimator; regenerative property; sequential estimation method; sequential estimator; simulation; simulation output analysis; stopping rule; variance reduction", 20332 language = "English", 20333 references = "0", 20334 treatment = "P Practical", 20335 } 20336 20337 @Article{Morgan:1977:OPD, 20338 author = "Howard L. Morgan and K. Dan Levin", 20339 title = "Optimal Program and Data Locations in Computer Networks", 20340 journal = j-CACM, 20341 volume = "20", 20342 number = "5", 20343 pages = "315--322", 20344 month = may, 20345 year = "1977", 20346 CODEN = "CACMA2", 20347 ISSN = "0001-0782", 20348 bibdate = "Tue Mar 25 13:26:09 MST 1997", 20349 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/storage.bib", 20350 abstract = "An optimization procedure for the allocation of program and data files in a computer network is presented. This algorithm takes into account the dependencies between files and programs such as occur in real heterogeneous computer networks. A search procedure for the file location problem is described, along with an example and a possible application of the model.", 20351 acknowledgement = ack-nhfb, 20352 classcodes = "C5620 (Computer networks and techniques); C6120 (File organisation)", 20353 classification = "723", 20354 corpsource = "Univ. of Pennsylvania, Philadelphia, PA, USA", 20355 journalabr = "Commun ACM", 20356 keywords = "computer networks; computer programming --- Subroutines; computers --- Data Communication Systems; data base systems --- Optimization; data locations; data processing --- Data Handling; mathematical models; optimization procedure; program; storage allocation", 20357 treatment = "A Application; T Theoretical or Mathematical", 20358 } 20359 20360 @Article{Baer:1977:CTB, 20361 author = "J.-L. Baer and B. Schwab", 20362 title = "A Comparison of Tree-Balancing Algorithms", 20363 journal = j-CACM, 20364 volume = "20", 20365 number = "5", 20366 pages = "322--330", 20367 month = may, 20368 year = "1977", 20369 CODEN = "CACMA2", 20370 ISSN = "0001-0782", 20371 bibdate = "Tue Mar 25 13:26:09 MST 1997", 20372 bibsource = "Compendex database", 20373 abstract = "Several algorithms-height-balance (i.e. AVL and extensions), weight-balance (i.e. BB and WB), and total restructuring-for building balanced binary search trees are compared. The criteria for comparison encompass theoretical aspects (e.g. path lengths) and implementation independent and machine/algorithm-dependent measures (e.g. run time). A detailed analysis of code is also presented at a level believed to be language-and compiler-independent. The quality of the resulting trees and the overhead spent on building them are analyzed, and some guidelines are given for an efficient use of the methods. If insertion and subsequent queries are the only operations of in terest, then ``pure'' AVL trees present the overall best qualities.", 20374 acknowledgement = ack-nhfb, 20375 classcodes = "C4240 (Programming and algorithm theory)", 20376 classification = "723; 901; 921", 20377 corpsource = "Univ. of Washington, Seattle, WA, USA", 20378 journalabr = "Commun ACM", 20379 keywords = "algorithm theory; balance; balanced binary search; comparison; height balance; total restructuring; tree balancing algorithms; trees; weight", 20380 keywords = "analysis of algorithms; AVL trees; binary search trees; computer programming --- Subroutines; data processing; information retrieval systems; information storage and retrieval; mathematical techniques --- Trees; path length; weight-balanced trees", 20381 treatment = "T Theoretical or Mathematical", 20382 } 20383 20384 @Article{Stillman:1977:CHS, 20385 author = "Neil J. Stillman and P. Bruce Berra", 20386 title = "A Comparison of Hardware and Software Associative Memories in the Context of Computer Graphics", 20387 journal = j-CACM, 20388 volume = "20", 20389 number = "5", 20390 pages = "331--339", 20391 month = may, 20392 year = "1977", 20393 CODEN = "CACMA2", 20394 ISSN = "0001-0782", 20395 bibdate = "Tue Mar 25 13:26:09 MST 1997", 20396 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Graphics/siggraph/77.bib", 20397 abstract = "The Associative Processing of Line Drawings (APLD) System utilizes a hardware associative memory and creates, modifies, deletes, stores, and retrieves two-dimensional line drawings consisting of points, lines, rectangles, and triangles. The APLD functions were duplicated on the TX-2 computer at M. I. T. 's Lincoln Laboratory under the LEAP Language and Data Structure. A comparison of the hardware approach with the software simulation illustrates the advantages of the hardware associative memory.", 20398 acknowledgement = ack-nhfb, 20399 classcodes = "C6120 (File organisation); C6130B (Graphics techniques)", 20400 classification = "722; 723", 20401 corpsource = "Defense Communications Agency, Washington, DC, USA", 20402 journalabr = "Commun ACM", 20403 keywords = "associative and memory; associative memories; associative processing of line drawings; comparison; computer graphics; computer systems, digital --- Parallel Processing; content-addressable storage; data storage, digital --- Associative; hardware; image processing; software", 20404 treatment = "P Practical", 20405 } 20406 20407 @Article{Shapiro:1977:CRP, 20408 author = "Marvin Shapiro", 20409 title = "Choice of Reference Points in Best-Match File Searching", 20410 journal = j-CACM, 20411 volume = "20", 20412 number = "5", 20413 pages = "339--343", 20414 month = may, 20415 year = "1977", 20416 CODEN = "CACMA2", 20417 ISSN = "0001-0782", 20418 bibdate = "Tue Mar 25 13:26:09 MST 1997", 20419 bibsource = "Compendex database", 20420 abstract = "Improvements to the exhaustive search method of best-match file searching have previously been achieved by doing a preprocessing step involving the calculation of distances from a reference point (Comm ACM, V16 n 4 April 1973 p 230). This paper discusses the proper choice of reference points and extends the previous algorithm to use more than one reference point. It is shown that reference points should be located outside of data clusters.", 20421 acknowledgement = ack-nhfb, 20422 classcodes = "C6120 (File organisation)", 20423 classification = "723; 901", 20424 corpsource = "Nat. Inst. of Health, Bethesda, MD, USA", 20425 journalabr = "Commun ACM", 20426 keywords = "best match; choice; computer programming --- Subroutines; data processing; file organisation; file searching; information retrieval systems; reference points", 20427 treatment = "P Practical", 20428 } 20429 20430 @Article{Hanani:1977:OEB, 20431 author = "Michael Z. Hanani", 20432 title = "An Optimal Evaluation of {Boolean} Expressions in an Online Query System", 20433 journal = j-CACM, 20434 volume = "20", 20435 number = "5", 20436 pages = "344--347", 20437 month = may, 20438 year = "1977", 20439 CODEN = "CACMA2", 20440 ISSN = "0001-0782", 20441 MRclass = "68A50", 20442 MRnumber = "55 9627", 20443 mrreviewer = "K. H. V. Booth", 20444 bibdate = "Tue Mar 25 13:26:09 MST 1997", 20445 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Database/Graefe.bib", 20446 abstract = "In the system discussed, in a response to a query, the entire file containing hundreds of thousands of records has to be searched, and the Boolean expression is evaluated for each record. The method presented improves the performance of such a system by speeding up the process of computing the truth value of a Boolean expression for an individual record. This is done by evaluating the expression based on the values of a subset of its components rather than the entire expression.", 20447 acknowledgement = ack-nhfb, 20448 classcodes = "C4210 (Formal logic); C6120 (File organisation)", 20449 classification = "722; 723; 901", 20450 corpsource = "Ben Gurion Univ., Negev, Israel", 20451 journalabr = "Commun ACM", 20452 keywords = "Boolean algebra; Boolean expressions; computer programming --- Subroutines; computer systems, digital --- On Line Systems; data base systems; data processing --- Data Handling; file organisation; file searching; information retrieval systems; online query system; optimal evaluation; order sort clauses by cost and selectivity CACM", 20453 treatment = "A Application; T Theoretical or Mathematical", 20454 } 20455 20456 @Article{Milman:1977:AOD, 20457 author = "Y. Milman", 20458 title = "An Approach to Optimal Design of Storage Parameters in Databases", 20459 journal = j-CACM, 20460 volume = "20", 20461 number = "5", 20462 pages = "347--350", 20463 month = may, 20464 year = "1977", 20465 CODEN = "CACMA2", 20466 ISSN = "0001-0782", 20467 MRclass = "68A50", 20468 MRnumber = "55 7007", 20469 mrreviewer = "Clement T. Yu", 20470 bibdate = "Tue Mar 25 13:26:09 MST 1997", 20471 bibsource = "Compendex database", 20472 abstract = "Storage and response-time requirements are contradictory in nature, and in any real-world, the problem, one has to attain a rational equilibrium between them. The actual location of this equilibrium depends on the conditions of the specific problem. The purpose of this paper is to present a simple approach that can be employed to locate such an equilibrium, and to demonstrate its use in an actual application.", 20473 acknowledgement = ack-nhfb, 20474 classcodes = "C6120 (File organisation)", 20475 classification = "723", 20476 corpsource = "Contahal Ltd., Tel-Aviv, Israel", 20477 journalabr = "Commun ACM", 20478 keywords = "data base systems; data storage, digital; database management systems; databases; optimal design; storage parameters", 20479 treatment = "P Practical", 20480 } 20481 20482 @Article{Hunt:1977:FAC, 20483 author = "James W. Hunt and Thomas G. Szymanski", 20484 title = "A Fast Algorithm for Computing Longest Common Subsequences", 20485 journal = j-CACM, 20486 volume = "20", 20487 number = "5", 20488 pages = "350--353", 20489 month = may, 20490 year = "1977", 20491 CODEN = "CACMA2", 20492 ISSN = "0001-0782", 20493 MRclass = "68A10 (68A20)", 20494 MRnumber = "55 9596", 20495 mrreviewer = "C. L. Liu", 20496 bibdate = "Tue Mar 25 13:26:09 MST 1997", 20497 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Misc/protein.pattern.bib", 20498 abstract = "Previously published algorithms for handling the longest common subsequence of two sequence of length n have had a best-case running time of O(n//2). An algorithm for this problem is presented which has a running time O((r plus n) log n), where r is the total number of ordered pairs of positions at which the two sequences match. Thus in the worst case the algorithm has a running time of O(n**2 log n).", 20499 acknowledgement = ack-nhfb, 20500 classcodes = "C4240 (Programming and algorithm theory)", 20501 classification = "723", 20502 comment = "``Previously published algorithms for finding the longest common subsequence of two sequences of length $n$ have had a best--case running time of $O(n^2)$. An algorithm for this problem is presented which has a running time of $O((r + n) \log n)$, where $r$ is the total number of ordered pairs of positions at which the two sequences match. Thus in the worst case the algorithm has a running time of $O(n^2 \log n)$. However, for those applications where most positions of one sequence match relatively few positions in the other sequence, a running time of $O(n \log n$) can be expected.''", 20503 corpsource = "Stanford Univ., Stanford, CA, USA", 20504 journalabr = "Commun ACM", 20505 keywords = "algorithm theory; computer programming --- Subroutines; data processing; fast algorithm; file searching; longest common subsequences; two sequences", 20506 treatment = "T Theoretical or Mathematical", 20507 } 20508 20509 @Article{Taulbee:1977:PEP, 20510 author = "Orrin E. Taulbee and S. D. Conte", 20511 title = "Production and Employment of {Ph.D.}'s in Computer Science --- 1976", 20512 journal = j-CACM, 20513 volume = "20", 20514 number = "6", 20515 pages = "370--372", 20516 month = jun, 20517 year = "1977", 20518 CODEN = "CACMA2", 20519 ISSN = "0001-0782", 20520 bibdate = "Tue Mar 25 13:26:09 MST 1997", 20521 bibsource = "Compendex database", 20522 abstract = "Statistics are presented on the production and employment of Ph. D's in computer science for the calendar year 1975-76. Data include profiles of graduate students and of faculty at 60 Ph. D. --- producing departments as well as breakdown of degrees granted by specialty areas. Significant trends are noted and comparisons with comparable data gathered for the 1974-75 calendar year are made.", 20523 acknowledgement = ack-nhfb, 20524 classcodes = "C0220 (Computing education and training)", 20525 classification = "723; 901; 912", 20526 corpsource = "Univ. of Pittsburgh, Pittsburgh, PA, USA", 20527 journalabr = "Commun ACM", 20528 keywords = "computer science; computer science education; data processing; education; employment; PhD; production; statistics", 20529 treatment = "G General Review", 20530 } 20531 20532 @Article{Shneiderman:1977:EIU, 20533 author = "Ben Shneiderman and Richard Mayer and Don McKay and Peter Heller", 20534 title = "Experimental Investigations of the Utility of Detailed Flowcharts in Programming", 20535 journal = j-CACM, 20536 volume = "20", 20537 number = "6", 20538 pages = "373--381", 20539 month = jun, 20540 year = "1977", 20541 CODEN = "CACMA2", 20542 ISSN = "0001-0782", 20543 bibdate = "Tue Mar 25 13:26:09 MST 1997", 20544 bibsource = "Compendex database", 20545 abstract = "This paper describes previous research on flowcharts and a series of controlled experiments to test the utility of detailed flowcharts as an aid to program composition, comprehension, debugging, and modification. No statistically significant difference between flowchart and nonflowchart groups has been shown, thereby calling into question the utility of detailed flowcharting. A program of further research is suggested.", 20546 acknowledgement = ack-nhfb, 20547 classcodes = "C6110 (Systems analysis and programming)", 20548 classification = "723", 20549 corpsource = "Indiana Univ., Bloomington, IN, USA", 20550 journalabr = "Commun ACM", 20551 keywords = "aid; comprehension; computer programming; computer programming languages; controlled experiments; debugging; detailed flowcharts; flowcharting; modification; program composition; utility", 20552 treatment = "P Practical", 20553 } 20554 20555 @Article{Ledgard:1977:TVD, 20556 author = "H. F. Ledgard and R. W. Taylor", 20557 title = "Two Views of Data Abstraction", 20558 journal = j-CACM, 20559 volume = "20", 20560 number = "6", 20561 pages = "382--384", 20562 month = jun, 20563 year = "1977", 20564 CODEN = "CACMA2", 20565 ISSN = "0001-0782", 20566 bibdate = "Tue Mar 25 13:26:09 MST 1997", 20567 bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Object/Nierstrasz.bib", 20568 acknowledgement = ack-nhfb, 20569 classcodes = "C6120 (File organisation)", 20570 corpsource = "Univ. of Massachusetts, Amherst, MA, USA", 20571 keywords = "data abstraction; data structures; database; language; types data abstraction", 20572 treatment = "G General Review", 20573 } 20574 20575 @Article{Zloof:1977:SBA, 20576 author = "Mosh{\'e} M. Zloof and S. Peter {de Jong}", 20577 title = "The System {for Business Automation} ({SBA}): Programming Language", 20578 journal = j-CACM, 20579 volume = "20", 20580 number = "6", 20581 pages = "385--396", 20582 month = jun, 20583 year = "1977", 20584 CODEN = "CACMA2", 20585 ISSN = "0001-0782", 20586 bibdate = "Tue Mar 25 13:26:09 MST 1997", 20587 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Object/Nierstrasz.bib", 20588 abstract = "The system for business automation (SBA) is a system within which application experts --- nonprogrammers --- can describe and execute their applications on a computer. The user of SBA views the application as manipulation of information in two-dimensional pictures of tables, business forms, and reports on a display terminal. The application can be automated gradually by giving ``examples'' to the system of how the information would be manipulated manually. The Query-by-Example database language is a subset of the SBA programming language.", 20589 acknowledgement = ack-nhfb, 20590 classcodes = "C6140D (High level languages); C7100 (Business and administration)", 20591 classification = "723; 901", 20592 corpsource = "IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA", 20593 journalabr = "Commun ACM", 20594 keywords = "administrative data processing; automatic programming; business automation; by Example; computer programming languages; data processing --- Data Structures; data processing, business; database language; display terminal; information retrieval systems; nonprogrammers; problem oriented languages; programming language; Query; SBA", 20595 treatment = "E Economic; P Practical", 20596 } 20597 20598 @Article{Guttag:1977:ADT, 20599 author = "John V. Guttag", 20600 title = "Abstract Data Types and the Development of Data Structures", 20601 journal = j-CACM, 20602 volume = "20", 20603 number = "6", 20604 pages = "396--404", 20605 month = jun, 20606 year = "1977", 20607 CODEN = "CACMA2", 20608 ISSN = "0001-0782", 20609 bibdate = "Tue Mar 25 13:26:09 MST 1997", 20610 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Object/Nierstrasz.bib and ftp://ftp.ira.uka.de/pub/bibliography/Misc/Functional.bib", 20611 abstract = "Abstract data types can play a significant role in the development of software that is reliable, efficient, and flexible. This paper presents and discusses the application of an algebraic technique for the specification of abstract data types. Among the examples presented is a top-down development of a symbol table for a block structured language; a discussion of the proof of its correctness is given. A brief discussion of the problems involved in constructing algebraic specifications that are both consistent and complete is also provided.", 20612 acknowledgement = ack-nhfb, 20613 classcodes = "C6120 (File organisation)", 20614 classification = "723; 921", 20615 corpsource = "Univ. of Southern California, Los Angeles, CA, USA", 20616 journalabr = "Commun ACM", 20617 keywords = "abstract data types; algebraic technique; computer metatheory; computer programming --- Reliability; computer programming languages; data processing --- Data Structures; data structures; data types; development; functional types olit data abstraction; mathematical techniques --- Algebra; specification", 20618 treatment = "P Practical", 20619 } 20620 20621 @Article{Smith:1977:DAA, 20622 author = "John Miles Smith and Diane C. P. Smith", 20623 title = "Database Abstractions: Aggregation", 20624 journal = j-CACM, 20625 volume = "20", 20626 number = "6", 20627 pages = "405--413", 20628 month = jun, 20629 year = "1977", 20630 CODEN = "CACMA2", 20631 ISSN = "0001-0782", 20632 bibdate = "Tue Mar 25 13:26:09 MST 1997", 20633 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib", 20634 abstract = "A new data type, called aggregate, is developed which, under certain criteria of ``well-definedness,'' specifies aggregation abstractions. A top-down methodology for database design is described which separates decisions concerning aggregate structure from decisions concerning key identification. It is suggested that aggregate types, and other types which support real-world abstractions without introducing implementation detail, should be incorporated into programming languages.", 20635 acknowledgement = ack-nhfb, 20636 classcodes = "C6120 (File organisation)", 20637 classification = "723", 20638 corpsource = "Univ. of Utah, Salt Lake City, UT, USA", 20639 journalabr = "Commun ACM", 20640 keywords = "computer programming languages; data aggregates; data base systems --- Design; data processing; data types", 20641 keywords = "abstractions; aggregation; data structures; databases", 20642 treatment = "T Theoretical or Mathematical", 20643 } 20644 20645 @Article{Gries:1977:SID, 20646 author = "David Gries and Narain Gehani", 20647 title = "Some Ideas on Data Types in High-Level Languages", 20648 journal = j-CACM, 20649 volume = "20", 20650 number = "6", 20651 pages = "414--420", 20652 month = jun, 20653 year = "1977", 20654 CODEN = "CACMA2", 20655 ISSN = "0001-0782", 20656 bibdate = "Tue Mar 25 13:26:09 MST 1997", 20657 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Object/Nierstrasz.bib", 20658 abstract = "A number of issues are explored concerning the notion that a data type is a set of values together with a set of primitive operations on those values. Among these are the need for a notation for iterating over the elements of any finite set (instead of the more narrow for i: equals 1 to n notation), the use of the domain of an array as a data type, the need for a simple notation for allowing types of parameters to be themselves parameters (but in a restrictive fashion), and resulting problems with conversion of values from one type to another.", 20659 acknowledgement = ack-nhfb, 20660 classcodes = "C4240 (Programming and algorithm theory); C6120 (File organisation)", 20661 classification = "723", 20662 corpsource = "Cornell Univ., Ithaca, NY, USA", 20663 journalabr = "Commun ACM", 20664 keywords = "computer meta theory --- Algorithmic Languages; computer programming languages; data processing --- Data Structures; data structures; data types; high level languages; primitive operations; programming theory; types olit iteration", 20665 treatment = "T Theoretical or Mathematical", 20666 } 20667 20668 @Article{Peterson:1977:BS, 20669 author = "James L. Peterson and Theodore A. Norman", 20670 title = "Buddy Systems", 20671 journal = j-CACM, 20672 volume = "20", 20673 number = "6", 20674 pages = "421--431", 20675 month = jun, 20676 year = "1977", 20677 CODEN = "CACMA2", 20678 ISSN = "0001-0782", 20679 bibdate = "Tue Mar 25 13:26:09 MST 1997", 20680 bibsource = "Compendex database", 20681 abstract = "Two algorithms are presented for implementing any of a class of buddy systems for dynamic storage allocation. Each buddy system corresponds to a set of recurrence relations which relate the block sizes provided to each other. Analyses of the internal fragmentation of the binary buddy system, the Fibonacci buddy system, and the weighted buddy system are given. Comparative simulation results are also presented for internal, external, and total fragmentation.", 20682 acknowledgement = ack-nhfb, 20683 classcodes = "C6120 (File organisation)", 20684 classification = "723", 20685 corpsource = "Univ. of Texas, Austin, TX, USA", 20686 journalabr = "Commun ACM", 20687 keywords = "algorithms; buddy systems; computer operating systems; computer programming --- Subroutines; computer programs; data storage, digital; dynamic storage allocation; recurrence relations; storage allocation", 20688 treatment = "T Theoretical or Mathematical", 20689 } 20690 20691 @Article{Robson:1977:BSA, 20692 author = "J. M. Robson", 20693 title = "A Bounded Storage Algorithm for Copying Cyclic Structures", 20694 journal = j-CACM, 20695 volume = "20", 20696 number = "6", 20697 pages = "431--433", 20698 month = jun, 20699 year = "1977", 20700 CODEN = "CACMA2", 20701 ISSN = "0001-0782", 20702 bibdate = "Tue Mar 25 13:26:09 MST 1997", 20703 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Compiler/garbage.collection.bib", 20704 abstract = "A new algorithm is presented which copies cyclic list structures using bounded workspace and linear time. Unlike a previous similar algorithm, this one makes no assumptions about the storage allocation system in use and uses only operations likely to be available in a high-level language. The distinctive feature of this algorithm is a technique for traversing the structure twice, using the same spanning tree in each case, first from left to right and then from right to left.", 20705 acknowledgement = ack-nhfb, 20706 classcodes = "C6120 (File organisation); C6130 (Data handling techniques)", 20707 classification = "723", 20708 corpsource = "Univ. of Lancaster, Lancaster, UK", 20709 journalabr = "Commun ACM", 20710 keywords = "bounded storage algorithm; computer programming --- Subroutines; computer programs; computer systems programming; copying; cyclic structures; list; list processing; structures", 20711 treatment = "P Practical", 20712 } 20713 20714 @Article{Bird:1977:NRE, 20715 author = "R. S. Bird", 20716 title = "Notes on Recursion Elimination", 20717 journal = j-CACM, 20718 volume = "20", 20719 number = "6", 20720 pages = "434--439", 20721 month = jun, 20722 year = "1977", 20723 CODEN = "CACMA2", 20724 ISSN = "0001-0782", 20725 bibdate = "Tue Mar 25 13:26:09 MST 1997", 20726 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Misc/Functional.bib", 20727 abstract = "Various methods of recursion elimination are applied to the schematic recursive procedure: proc S(x); px then N(x); S(fx); S(gx); M(x) fi. Procedures with this general form arise in connection with tree traversal and sorting algorithms. Each method of recursion removal involves the use of one or more stacks, and the solutions are compared on the basis of their running time.", 20728 acknowledgement = ack-nhfb, 20729 classcodes = "C4240 (Programming and algorithm theory)", 20730 classification = "721; 723", 20731 corpsource = "Univ. of Reading, Reading, UK", 20732 journalabr = "Commun ACM", 20733 keywords = "automata theory --- Recursive Functions; computer programming; computer systems programming --- Sorting; functional; programming theory; recursion elimination; running time; sorting algorithms; stacks; tree traversal", 20734 treatment = "T Theoretical or Mathematical", 20735 } 20736 20737 @Article{Warren:1977:FRW, 20738 author = "Henry S. {Warren, Jr.}", 20739 title = "Functions Realizable with Word-Parallel Logical and Two's-Complement Addition Instructions", 20740 journal = j-CACM, 20741 volume = "20", 20742 number = "6", 20743 pages = "439--441", 20744 month = jun, 20745 year = "1977", 20746 CODEN = "CACMA2", 20747 ISSN = "0001-0782", 20748 MRclass = "94A20", 20749 MRnumber = "58 26591", 20750 bibdate = "Tue Mar 25 13:26:09 MST 1997", 20751 bibsource = "Compendex database", 20752 abstract = "A theorem is given for deducing whether or not a given function can be computed through the use of ``programming tricks'' involving binary numbers. This is followed by an efficient implementation of sign propagation that does not use shifting instructions or branching instructions. The sign-propagation device and a given expression for mixed length adds and subtracts are used in an experimental compiler currently being developed for translating PL/I to microcode for a variety of machines.", 20753 acknowledgement = ack-nhfb, 20754 classcodes = "C5230 (Digital arithmetic methods); C6130 (Data handling techniques)", 20755 classification = "722; 723", 20756 corpsource = "IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA", 20757 journalabr = "Commun ACM", 20758 keywords = "addition instructions; computer architecture --- Microprogramming; computer metatheory; computer programming; digital arithmetic; functions realisable; two's complement; word parallel logical instructions", 20759 treatment = "P Practical", 20760 } 20761 20762 @Article{Mamrak:1977:DRT, 20763 author = "Sandra A. Mamrak", 20764 title = "Dynamic Response Time Prediction for Computer Networks", 20765 journal = j-CACM, 20766 volume = "20", 20767 number = "7", 20768 pages = "461--468", 20769 month = jul, 20770 year = "1977", 20771 CODEN = "CACMA2", 20772 ISSN = "0001-0782", 20773 bibdate = "Tue Mar 25 13:26:09 MST 1997", 20774 bibsource = "Compendex database", 20775 abstract = "Five interactive systems currently available on the ARPA network are compared. A system environment is defined in which response time measurements can be made, and statistical, simulation, and analytical tools are used to describe and then predict the response time behavior. The effect of network queueing delays is discussed. Finally, a dynamic response time monitor for ARPA network users is proposed based on the success of the response time prediction methodologies and models.", 20776 acknowledgement = ack-nhfb, 20777 classcodes = "C5620 (Computer networks and techniques)", 20778 classification = "722; 723; 922", 20779 corpsource = "Ohio State Univ., Columbus, OH, USA", 20780 journalabr = "Commun ACM", 20781 keywords = "ARPA; computer networks; computer simulation; computer systems, digital --- Fast Response Capability; dynamic prediction; mathematical models; response time; statistical methods; time-sharing systems", 20782 treatment = "P Practical", 20783 } 20784 20785 @Article{Ruschitzka:1977:UAS, 20786 author = "Manfred Ruschitzka and R. S. Fabry", 20787 title = "A Unifying Approach to Scheduling", 20788 journal = j-CACM, 20789 volume = "20", 20790 number = "7", 20791 pages = "469--477", 20792 month = jul, 20793 year = "1977", 20794 CODEN = "CACMA2", 20795 ISSN = "0001-0782", 20796 bibdate = "Tue Mar 25 13:26:09 MST 1997", 20797 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1977.bib", 20798 abstract = "This paper presents a scheme for classifying scheduling algorithms based on an abstract model of a scheduling system which formalizes the notion of priority. Various classes of scheduling algorithms are defined and related to existing algorithms. A criterion for the implementation efficiency of an algorithm is developed and results in the definition of time-invariant algorithms, which include most of the commonly implemented ones. For time-invariant algorithms, the dependence of processing rates on priorities is derived. The abstract model provides a framework for implementing flexible schedulers in real operating systems. The policy-driven scheduler of Bernstein and Sharp is discussed as an example of such an implementation.", 20799 acknowledgement = ack-nhfb, 20800 classcodes = "C5420 (Mainframes and minicomputers)", 20801 classification = "723; 922", 20802 corpsource = "Rutgers Univ., New Brunswick, NJ, USA", 20803 country = "USA", 20804 descriptors = "Scheduling; queueing discipline; priority; processor sharing; process management;", 20805 enum = "2645", 20806 journalabr = "Commun ACM", 20807 keywords = "algorithms; computer operating systems --- Scheduling; computer programming --- Subroutines; computer systems programming; implementation efficiency; operating systems; priority; probability --- Queueing Theory; processor sharing; scheduling; scheduling algorithms; scheduling models; time-sharing systems; unifying approach", 20808 language = "English", 20809 references = "0", 20810 treatment = "P Practical; T Theoretical or Mathematical", 20811 } 20812 20813 @Article{Tajibnapis:1977:CPT, 20814 author = "William D. Tajibnapis", 20815 title = "A Correctness Proof of a Topology Information Maintenance Protocol for a Distributed Computer Network", 20816 journal = j-CACM, 20817 volume = "20", 20818 number = "7", 20819 pages = "477--485", 20820 month = jul, 20821 year = "1977", 20822 CODEN = "CACMA2", 20823 ISSN = "0001-0782", 20824 MRclass = "94A20", 20825 MRnumber = "58 4703", 20826 mrreviewer = "Fan R. K. Chung", 20827 bibdate = "Tue Mar 25 13:26:09 MST 1997", 20828 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1977.bib", 20829 abstract = "One of the major constraints on a topology information scheme is that it may not involve a central controller. The Topology Information Protocol that was implemented on the MERIT Computer Network is presented and explained; this protocol is quite general and could be implemented on any computer network. It is based on Baran's ``Hot Potato Heuristic Routing Doctrine.'' A correctness proof of this Topology Information Protocol is also presented.", 20830 acknowledgement = ack-nhfb, 20831 annote = "(VBI-001559)", 20832 classcodes = "C5620 (Computer networks and techniques)", 20833 classification = "722; 723", 20834 country = "USA", 20835 descriptors = "Protocol verification;", 20836 enum = "11285", 20837 journalabr = "Commun ACM", 20838 keywords = "computer networks; computer programming --- Subroutines; computer systems, digital --- Multiprocessing; computers --- Data Communication Systems; correctness proof; distributed computer network; protocol; protocols; topology information maintenance", 20839 language = "English", 20840 references = "0", 20841 treatment = "T Theoretical or Mathematical", 20842 } 20843 20844 @Article{Heckel:1977:TCS, 20845 author = "Paul G. Heckel and Butler W. Lampson", 20846 title = "A terminal-oriented communication system", 20847 journal = j-CACM, 20848 volume = "20", 20849 number = "7", 20850 pages = "486--494", 20851 month = jul, 20852 year = "1977", 20853 CODEN = "CACMA2", 20854 ISSN = "0001-0782", 20855 bibdate = "Tue Mar 25 13:26:09 MST 1997", 20856 bibsource = "Compendex database", 20857 abstract = "This paper describes a system for full-duplex communication between a time-shared computer and its terminals. The system consists of a communications computer directly connected to the time-shared system, a number of small remote computers to which the terminals are attached, and connecting medium speed telephone lines. It can service a large number of terminals of various types. The overall system design is presented along with the algorithms used to solve three specific problems: local echoing, error detection and correction on the telephone lines, and multiplexing of character output.", 20858 acknowledgement = ack-nhfb, 20859 classcodes = "B6210L (Computer communications); C5600 (Data communication equipment and techniques)", 20860 classification = "718; 722; 723", 20861 corpsource = "Interactive Systems Consultants, Palo Alto, CA, USA", 20862 journalabr = "Commun ACM", 20863 keywords = "character output; communication system; computer networks; computer programming --- Subroutines; computers --- Data Communication Systems; data communication systems; detection and correction; digital communication systems --- Computer Interfaces; error; full duplex; local echoing; multiplexing; system design; terminal oriented; time sharing; time-sharing systems", 20864 treatment = "P Practical", 20865 } 20866 20867 @Article{Schneider:1977:SIT, 20868 author = "Ben Ross {Schneider, Jr.} and Reid M. Watts", 20869 title = "{SITAR}: an Interactive Text Processing System for Small Computers", 20870 journal = j-CACM, 20871 volume = "20", 20872 number = "7", 20873 pages = "495--499", 20874 month = jul, 20875 year = "1977", 20876 CODEN = "CACMA2", 20877 ISSN = "0001-0782", 20878 bibdate = "Tue Mar 25 13:26:09 MST 1997", 20879 bibsource = "Compendex database", 20880 abstract = "SITAR, a System for Interactive Text-editing, Analysis, and Retrieval, is in many ways comparable to interactive bibliographical search and retrieval systems, but has several additional features. It is implemented on a PDP\slash 11 time-sharing computer invoked by a CRT with microprogrammed editing functions. Extensive experience with SITAR shows that the combined powers of simple commands, string orientation, circular file structure, a CRT with local memory, and conversational computing produce a system much more powerful than the sum of its parts.", 20881 acknowledgement = ack-nhfb, 20882 classcodes = "C6130 (Data handling techniques); C7250 (Information storage and retrieval)", 20883 classification = "722; 723; 901", 20884 corpsource = "Lawrence Univ., Appleton, WI, USA", 20885 journalabr = "Commun ACM", 20886 keywords = "circular file structure; computer systems, digital; computers, miniature --- Applications; conversational computing; CRT with local memory; data processing --- Humanities Applications; information retrieval; information retrieval systems; interactive text processing system; orientation; simple commands; SITAR; small computers; string; text analysis; text editing; text handling", 20887 treatment = "P Practical", 20888 } 20889 20890 @Article{Kessels:1977:AEQ, 20891 author = "J. L. W. Kessels", 20892 title = "Alternative to Event Queues for Synchronization in Monitors", 20893 journal = j-CACM, 20894 volume = "20", 20895 number = "7", 20896 pages = "500--503", 20897 month = jul, 20898 year = "1977", 20899 CODEN = "CACMA2", 20900 ISSN = "0001-0782", 20901 bibdate = "Tue Mar 25 13:26:09 MST 1997", 20902 bibsource = "Compendex database", 20903 abstract = "In the monitor concept, as proposed by Brinch Hansen and Hoare, event queues are used for synchronization. This paper describes another synchronizing primitive which is nearly as expressive as the conditional wait, but can be implemented more efficiently. An implementation of this primitive in terms of P and V operations is given together with a correctness proof. Two examples are presented: the readers and writers problem and the problem of information streams sharing a finite buffer pool.", 20904 acknowledgement = ack-nhfb, 20905 classcodes = "C6150J (Operating systems)", 20906 classification = "723", 20907 corpsource = "Philips Res. Labs., Eindhoven, Netherlands", 20908 journalabr = "Commun ACM", 20909 keywords = "alternative; computer operating systems --- Scheduling; computer programming --- Subroutines; computer systems programming; event queues; monitors; operating systems (computers); synchronization", 20910 treatment = "T Theoretical or Mathematical", 20911 } 20912 20913 @Article{Denning:1977:CPS, 20914 author = "Dorothy E. Denning and Peter J. Denning", 20915 title = "Certification of Programs for Secure Information Flow", 20916 journal = j-CACM, 20917 volume = "20", 20918 number = "7", 20919 pages = "504--513", 20920 month = jul, 20921 year = "1977", 20922 CODEN = "CACMA2", 20923 ISSN = "0001-0782", 20924 bibdate = "Tue Mar 25 13:26:09 MST 1997", 20925 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib", 20926 abstract = "An information flow policy specifies a set of security classes for information, a flow relation defining permissible flows among these classes, and a method of binding each storage object to some class. This paper presents a compile-time mechanism that certifies a program only if it specifies no flows in violation of the flow policy. Because it exploits the properties of a lattice structure among security classes, the procedure is sufficiently simple that it can easily be included in the analysis phase of most existing compilers. Appropriate semantics are presented and proved correct. An important application is the confinement problem. The mechanism can prove that a program cannot cause supposedly nonconfidential results to depend on confidential input data.", 20927 acknowledgement = ack-nhfb, 20928 classcodes = "C6150C (Compilers, interpreters and other processors)", 20929 classification = "723", 20930 corpsource = "Purdue Univ., West Lafayette, IN, USA", 20931 journalabr = "Commun ACM", 20932 keywords = "certification mechanism; compilers; computer operating systems --- Program Compilers; data processing; lattice structure; program compilers; programs; secure information flow; security of data", 20933 treatment = "P Practical; T Theoretical or Mathematical", 20934 } 20935 20936 @Article{Barth:1977:SGC, 20937 author = "Jeffrey M. Barth", 20938 title = "Shifting Garbage Collection Overhead to Compile Time", 20939 journal = j-CACM, 20940 volume = "20", 20941 number = "7", 20942 pages = "513--518", 20943 month = jul, 20944 year = "1977", 20945 CODEN = "CACMA2", 20946 ISSN = "0001-0782", 20947 bibdate = "Tue Mar 25 13:26:09 MST 1997", 20948 bibsource = "Compendex database", 20949 abstract = "The paper assumes a transaction oriented collection scheme, as proposed by Deutsch and Bobrow, the necessary features of which are summarized. Implementing the described optimization requires global flow analysis to be performed on the source program. It is shown that at compile time certain program actions that affect the reference counts of cells can be deduced. This information is used to find actions that cancel when the code is executed and those that can be grouped to achieve improved efficiency.", 20950 acknowledgement = ack-nhfb, 20951 classcodes = "C6120 (File organisation)", 20952 classification = "723", 20953 corpsource = "Univ. of California, Berkeley, CA, USA", 20954 journalabr = "Commun ACM", 20955 keywords = "automatic storage; compile time; computer operating systems; computer programming languages --- List Processing; flow analysis; garbage collection overhead; global; optimization; reclamation; storage management; transaction oriented collection scheme", 20956 treatment = "P Practical", 20957 } 20958 20959 @Article{Ashcroft:1977:LNL, 20960 author = "E. A. Ashcroft and W. W. Wadge", 20961 title = "{Lucid}, a Nonprocedural Language with Iteration", 20962 journal = j-CACM, 20963 volume = "20", 20964 number = "7", 20965 pages = "519--526", 20966 month = jul, 20967 year = "1977", 20968 CODEN = "CACMA2", 20969 ISSN = "0001-0782", 20970 bibdate = "Tue Mar 25 13:26:09 MST 1997", 20971 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Parallel/Pfpbib.bib", 20972 abstract = "Lucid is a formal system in which programs can be written and proofs of programs carried out. The proofs are particularly easy to follow and straight-forward to produce because the statements in a Lucid program are simply axioms from which the proof proceeds by (almost) conventional logic reasoning, with the help of a few axioms and rules of inference for the special lucid functions. As a programming language, Lucid is unconventional because, among other things, the order of statements is irrelevant and assignment statements are equations. Nevertheless, Lucid programs need not look much different than iterative programs in a conventional structured programming language using assignment and conditional statements and loops.", 20973 acknowledgement = ack-nhfb, 20974 classcodes = "C4210 (Formal logic); C6140D (High level languages)", 20975 classification = "723", 20976 corpsource = "Univ. of Waterloo, Waterloo, Ont., Canada", 20977 journalabr = "Commun ACM", 20978 keywords = "computer metatheory --- Algorithmic Languages; computer programming --- Reliability; computer programming languages; Dataflow; formal languages; formal system; Formal Systems; iteration; Lucid; lucid; nonprocedural language; proofs; Proving; Semantics; structured programming", 20979 treatment = "P Practical; T Theoretical or Mathematical", 20980 } 20981 20982 @Article{Brownlee:1977:AIS, 20983 author = "J. Nevil Brownlee", 20984 title = "An {Algol-based} implementation of {SNOBOL} 4 patterns", 20985 journal = j-CACM, 20986 volume = "20", 20987 number = "7", 20988 pages = "527--529", 20989 month = jul, 20990 year = "1977", 20991 CODEN = "CACMA2", 20992 ISSN = "0001-0782", 20993 bibdate = "Tue Mar 25 13:26:09 MST 1997", 20994 bibsource = "Compendex database", 20995 abstract = "When a string appears as the subject of a SNOBOL4 statement, it may be scanned to see whether or not it contains a specified pattern. However, since the scanner is fundamentally an interpreter (using pattern graphs as its input code), pattern matching appears to be a time-consuming process. This paper describes an alternative approach in which SNOBOL4 patterns are compiled into Algol functions, which can be combined into larger (more complicated) patterns, and which are directly executed. It was developed as part of the implementation of ``Snobal\slash 67'', a Burroughs B6700 compiler for a SNOBAL4-like language.", 20996 acknowledgement = ack-nhfb, 20997 classcodes = "C6140D (High level languages)", 20998 classification = "723", 20999 corpsource = "Univ. of Auckland, Private Bag, Auckland, New Zealand", 21000 journalabr = "Commun ACM", 21001 keywords = "ALGOL; compiled; computer operating systems --- Program Compilers; computer programming languages; implementation; pattern recognition systems; patterns; procedure oriented languages; SNOBOL 4", 21002 treatment = "P Practical", 21003 } 21004 21005 @Article{Geschke:1977:EEM, 21006 author = "Charles M. Geschke and James H. {Morris, Jr.} and Edwin H. Satterthwaite", 21007 title = "Early Experience with {Mesa}", 21008 journal = j-CACM, 21009 volume = "20", 21010 number = "8", 21011 pages = "540--553", 21012 month = aug, 21013 year = "1977", 21014 CODEN = "CACMA2", 21015 ISSN = "0001-0782", 21016 bibdate = "Tue Mar 25 13:26:09 MST 1997", 21017 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Object/Nierstrasz.bib and ftp://ftp.ira.uka.de/pub/bibliography/Compiler/semantics.bib", 21018 abstract = "The experiences of Mesa's first users --- primarily its implementors --- are discussed, and some implications for Mesa and similar programming languages are suggested. The specific topics addressed are: module structure and its use in defining abstractions, data-structuring facilities in Mesa, an equivalence algorithm for types and type coercions, the benefits of the type system and why it is breached occasionally, and the difficulty of making the treatment of variant records safe.", 21019 acknowledgement = ack-nhfb, 21020 classcodes = "C6140D (High level languages); C6150 (Systems software)", 21021 classification = "723", 21022 corpsource = "Xerox Palo Alto Res. Center, Palo Alto, CA, USA", 21023 journalabr = "Commun ACM", 21024 keywords = "abstractions; computer programming languages; computer systems programming; data processing --- Data Structures; data structuring; defining; equivalence algorithm; mesa; Mesa; module structure; olit-oopl mesa; problem oriented languages; programming languages; systems programming; type coercions; types", 21025 treatment = "P Practical", 21026 } 21027 21028 @Article{Shaw:1977:AVA, 21029 author = "Mary Shaw and William A. Wulf and Ralph L. London", 21030 title = "Abstraction and Verification in {Alphard}: Defining and Specifying Iteration and Generators", 21031 journal = j-CACM, 21032 volume = "20", 21033 number = "8", 21034 pages = "553--564", 21035 month = aug, 21036 year = "1977", 21037 CODEN = "CACMA2", 21038 ISSN = "0001-0782", 21039 bibdate = "Tue Mar 25 13:26:09 MST 1997", 21040 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Compiler/semantics.bib; ftp://ftp.ira.uka.de/pub/bibliography/Object/Nierstrasz.bib and ftp://ftp.ira.uka.de/pub/bibliography/Theory/obscure.bib", 21041 abstract = "The Alphard ``form'' provides the programmer with a great deal of control over the implementation of abstract data types. In this paper the abstraction techniques are extended from simple data representation and function definition to the iteration statement, the most important point of interaction between data and the control structure of the language itself. A means of specializing Alphard's loops to operate on abstract entities without explicit dependence on the representation of those entities is in troduced. \par Specification and verification techniques that allow the properties of the generators for such iterations to be expressed in the form of proof rules are developed. \par Results are obtained that for common special cases of these loops are essentially identical to the corresponding constructs in other languages. A means of showing that a generator will terminate is also provided.", 21042 acknowledgement = ack-nhfb, 21043 classcodes = "C6140D (High level languages)", 21044 classification = "723", 21045 corpsource = "Dept. of Computer Sci., Carnegie-Mellon Univ., Schenley Park, Pittsburgh, PA, USA", 21046 journalabr = "Commun ACM", 21047 keywords = "abstract data types; abstraction and representation; Alphard; assertions; computer programming; computer programming languages; control specialization; correctness; defining; generators; invariants; iteration; iteration statements; language; modular decomposition; olit lang alphard data abstraction; program specifications; programmer; programming languages; programming methodology; proofs of correctness; specifying; types; verification", 21048 treatment = "P Practical", 21049 } 21050 21051 @Article{Liskov:1977:AMC, 21052 author = "Barbara Liskov and Alan Snyder and Russell Atkinson and Craig Schaffert", 21053 title = "Abstraction Mechanisms in {CLU}", 21054 journal = j-CACM, 21055 volume = "20", 21056 number = "8", 21057 pages = "564--576", 21058 month = aug, 21059 year = "1977", 21060 CODEN = "CACMA2", 21061 ISSN = "0001-0782", 21062 bibdate = "Tue Mar 25 13:26:09 MST 1997", 21063 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib", 21064 note = "Also published in/as: In ``Readings in Object-Oriented Database Systems'' edited by S.Zdonik and D.Maier, Morgan Kaufman, 1990.", 21065 abstract = "CLU is a new programming language designed to support the use of abstractions in program construction. Work in programming methodology has led to the realization that three kinds of abstractions --- procedural, control, and especially data abstractions --- are useful in the programming process. Of these, only the procedural abstraction is supported well by conventional languages, through the procedure or subroutine. CLU provides, in addition to procedures, novel linguistic mechanisms that support the use of data and control abstractions. This paper provides an introduction to the abstractions mechanisms in CLU.", 21066 acknowledgement = ack-nhfb, 21067 classcodes = "C6140D (High level languages)", 21068 classification = "723", 21069 corpsource = "Lab. for Computer Sci., MIT, Cambridge, MA, USA", 21070 journalabr = "Commun ACM", 21071 keywords = "abstractions; CLU; computer programming; computer programming languages; construction; linguistic mechanisms; program; programming language; programming languages", 21072 treatment = "P Practical", 21073 } 21074 21075 @Article{Wirth:1977:TDR, 21076 author = "Niklaus Wirth", 21077 title = "Toward a Discipline of Real-Time Programming", 21078 journal = j-CACM, 21079 volume = "20", 21080 number = "8", 21081 pages = "577--583", 21082 month = aug, 21083 year = "1977", 21084 CODEN = "CACMA2", 21085 ISSN = "0001-0782", 21086 bibdate = "Tue Mar 25 13:26:09 MST 1997", 21087 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Misc/Discrete.event.bib", 21088 abstract = "Programming is divided into three major categories with increasing complexity of reasoning in program validation: sequential programming, multiprogramming, and real-time programming. By adhering to a strict programming discipline and by using a suitable high-level language molded after this discipline, the complexity of reasoning about concurrency and execution time constraints may be drastically reduced. This may be the only practical way to make real-time systems analytically verifiable and ultimately reliable. A possible discipline is outlined and expressed in terms of the language Modula.", 21089 acknowledgement = ack-nhfb, 21090 classcodes = "C6110 (Systems analysis and programming); C6150J (Operating systems)", 21091 classification = "722; 723", 21092 corpsource = "ETH, Zurich, Switzerland", 21093 journalabr = "Commun ACM", 21094 keywords = "computer programming languages; computer systems, digital; concurrency; discipline; execution time; Modula; multiprogramming; online operation; program testing; programming; real time", 21095 treatment = "P Practical", 21096 } 21097 21098 @Article{Gannon:1977:EED, 21099 author = "J. D. Gannon", 21100 title = "An experimental evaluation of data type conventions", 21101 journal = j-CACM, 21102 volume = "20", 21103 number = "8", 21104 pages = "584--595", 21105 month = aug, 21106 year = "1977", 21107 CODEN = "CACMA2", 21108 ISSN = "0001-0782", 21109 bibdate = "Tue Mar 25 13:26:09 MST 1997", 21110 bibsource = "Compendex database", 21111 abstract = "This paper discusses an experiment that compares the programming reliability of subjects using a statically typed language and a ``typeless'' language. Analysis of the number of errors and the number of runs containing errors shows that, at least in one environment, the use of a statically typed language can increase programming reliability.", 21112 acknowledgement = ack-nhfb, 21113 classcodes = "C6140D (High level languages)", 21114 classification = "723", 21115 corpsource = "Dept. of Computer Sci., Univ. of Maryland, College Park, MD, USA", 21116 journalabr = "Commun ACM", 21117 keywords = "computer programming languages; data type conventions; data types; evaluation; programming languages; programming reliability", 21118 treatment = "X Experimental", 21119 } 21120 21121 @Article{Franta:1977:EDS, 21122 author = "W. R. Franta and Kurt Maly", 21123 title = "An Efficient Data Structure for the Simulation Event Set", 21124 journal = j-CACM, 21125 volume = "20", 21126 number = "8", 21127 pages = "596--602", 21128 month = aug, 21129 year = "1977", 21130 CODEN = "CACMA2", 21131 ISSN = "0001-0782", 21132 bibdate = "Tue Mar 25 13:26:09 MST 1997", 21133 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Distributed/simulan.bib and ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD.bib", 21134 abstract = "A new event scheduling algorithm is presented which improves on two aspects of the best of the previously published algorithms. First, the new algorithm's performance is quite insensitive to skewed distributions, and second, its worst-case complexity is O(square root of n), where n is the number of events in the set. Furthermore, tests conducted to estimate the average complexity showed it to be nearly independent of n.", 21135 acknowledgement = ack-nhfb, 21136 classcodes = "C6120 (File organisation)", 21137 classification = "723; 913", 21138 corpsource = "Dept. of Computer Sci., Univ. of Minnesota, Minneapolis, MN, USA", 21139 descriptors = "Simulation; event sequencing; method;", 21140 journalabr = "Commun ACM", 21141 keywords = "algorithm; computer programming --- Subroutines; data processing; data structure; data structures; digital simulation; event scheduling; scheduling; simulation event set", 21142 treatment = "P Practical", 21143 } 21144 21145 @Article{Lawler:1977:CCS, 21146 author = "Eugene L. Lawler", 21147 title = "Comment on computing the $k$ shortest paths in a graph", 21148 journal = j-CACM, 21149 volume = "20", 21150 number = "8", 21151 pages = "603--604", 21152 month = aug, 21153 year = "1977", 21154 CODEN = "CACMA2", 21155 ISSN = "0001-0782", 21156 MRclass = "68A20 (90B10)", 21157 MRnumber = "58 19354", 21158 mrreviewer = "Colin J. H. McDiarmid", 21159 bibdate = "Tue Mar 25 13:26:09 MST 1997", 21160 acknowledgement = ack-nhfb, 21161 classcodes = "C1160 (Combinatorial mathematics)", 21162 corpsource = "Div. of Computer Sci., Univ. of California, Berkeley, CA, USA", 21163 keywords = "$k$ shortest paths; algorithms; computing; graph; graph theory", 21164 treatment = "T Theoretical or Mathematical", 21165 } 21166 21167 @Article{Francez:1977:AAK, 21168 author = "N. Francez", 21169 title = "Another advantage of keyword notation for parameter communication with subprograms", 21170 journal = j-CACM, 21171 volume = "20", 21172 number = "8", 21173 pages = "604--605", 21174 month = aug, 21175 year = "1977", 21176 CODEN = "CACMA2", 21177 ISSN = "0001-0782", 21178 bibdate = "Tue Mar 25 13:26:09 MST 1997", 21179 acknowledgement = ack-nhfb, 21180 classcodes = "C6110 (Systems analysis and programming)", 21181 corpsource = "Weizmann Inst. of Sci., Rehovoth, Israel", 21182 keywords = "advantage; keyword notation; parameter communication; structured programming; subprograms", 21183 treatment = "P Practical", 21184 } 21185 21186 @Article{Rabin:1977:CC, 21187 author = "Michael O. Rabin", 21188 title = "Complexity of Computations", 21189 journal = j-CACM, 21190 volume = "20", 21191 number = "9", 21192 pages = "625--633", 21193 month = sep, 21194 year = "1977", 21195 CODEN = "CACMA2", 21196 ISSN = "0001-0782", 21197 MRclass = "68A20", 21198 MRnumber = "56 10141", 21199 mrreviewer = "Claus-Peter Schnorr", 21200 bibdate = "Tue Mar 25 13:26:09 MST 1997", 21201 bibsource = "Compendex database", 21202 note = "See corrigendum \cite{Rabin:1978:CCC}.", 21203 abstract = "The framework for research in the theory of complexity of computations is described, emphasizing the interrelation between seemingly diverse problems and methods. Illustrative examples of practical and theoretical significance are given. Directions for new research are discussed.", 21204 acknowledgement = ack-nhfb, 21205 classcodes = "C4240 (Programming and algorithm theory)", 21206 classification = "721", 21207 corpsource = "Dept. of Maths., Hebrew Univ. of Jerusalem, Jerusalem, Israel", 21208 journalabr = "Commun ACM", 21209 keywords = "algebraic complexity; algorithmic cost functions; algorithms; automata theory; complexity of computations; computational complexity; intractable problems; probabilistic", 21210 treatment = "E Economic; T Theoretical or Mathematical", 21211 } 21212 21213 @Article{Scott:1977:LPL, 21214 author = "Dana S. Scott", 21215 title = "Logic and Programming Languages", 21216 journal = j-CACM, 21217 volume = "20", 21218 number = "9", 21219 pages = "634--641", 21220 month = sep, 21221 year = "1977", 21222 CODEN = "CACMA2", 21223 ISSN = "0001-0782", 21224 MRclass = "68A05", 21225 MRnumber = "56 10114", 21226 mrreviewer = "Horst Reichel", 21227 bibdate = "Tue Mar 25 13:26:09 MST 1997", 21228 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Compiler/semantics.bib", 21229 abstract = "Logic has been long interested in whether answers to certain questions are computable in principle, since the outcome puts bounds on the possibilities of formalization. It would seem that the understanding of higher-level program features involves one with infinite objects and forces one to pass through several levels of explanation to go from the conceptual ideas to the final simulation on a real machine. These levels can be made mathematically exact if the right abstractions can be found to represent the necessary structures. In this paper, the author outlines his approach to these problems, specifically his lambda -calculus orientation.", 21230 acknowledgement = ack-nhfb, 21231 classcodes = "C4210 (Formal logic); C6140 (Programming languages)", 21232 classification = "721; 723", 21233 corpsource = "Math. Inst., Univ. of Oxford, Oxford, UK", 21234 journalabr = "Commun ACM", 21235 keywords = "automata theory --- Computability and Decidability; computability and decidability; computability theory; computational linguistics; computer metatheory; computer programming languages; decision methods; formal logic; methods of logic; programming languages; semantical; syntactic formalization; theory", 21236 treatment = "A Application; T Theoretical or Mathematical", 21237 } 21238 21239 @Article{Austing:1977:GAT, 21240 author = "Richard H. Austing", 21241 title = "The {GRE Advanced Test in Computer Science}", 21242 journal = j-CACM, 21243 volume = "20", 21244 number = "9", 21245 pages = "642--645", 21246 month = sep, 21247 year = "1977", 21248 CODEN = "CACMA2", 21249 ISSN = "0001-0782", 21250 bibdate = "Tue Mar 25 13:26:09 MST 1997", 21251 bibsource = "Compendex database", 21252 abstract = "This report describes the Advanced Test in Computer Science which was recently introduced in the Graduate Record Examination Program. The GRE program is described in general, and, the events leading to the establishment of the Advanced Computer Science Test are discussed. Content specifications and their rationale are given. A set of sample questions is included.", 21253 acknowledgement = ack-nhfb, 21254 classcodes = "C0220 (Computing education and training)", 21255 classification = "723; 901", 21256 corpsource = "Dept. of Computer Sci., Univ. of Maryland, College Park, MD, USA", 21257 journalabr = "Commun ACM", 21258 keywords = "Advanced Test in Computer Science; computer programming; computer science education; education; Examination Program; Graduate Record; questions; rationale; sample; specifications", 21259 treatment = "G General Review; P Practical", 21260 } 21261 21262 @Article{Scheifler:1977:AIS, 21263 author = "Robert W. Scheifler", 21264 title = "An Analysis of Inline Substitution for a Structured Programming Language", 21265 journal = j-CACM, 21266 volume = "20", 21267 number = "9", 21268 pages = "647--654", 21269 month = sep, 21270 year = "1977", 21271 CODEN = "CACMA2", 21272 ISSN = "0001-0782", 21273 bibdate = "Tue Mar 25 13:26:09 MST 1997", 21274 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Compiler/compiler.bib", 21275 abstract = "An optimization technique known as inline substitution is analyzed. The optimization consists of replacing a procedure invocation by a modified copy of the procedure body. The general problem of using inline substitution to minimize execution time subject to size constraints is formulated, and an approximate algorithmic solution is proposed. The algorithm depends on run-time statistics about the program to be optimized. Preliminary results for the CLU structured programming language indicate that, in programs with a low degree of recursion, over 90 percent of all procedure calls can be eliminated, with little increase in the size of compiled code and a small savings in execution time.", 21276 acknowledgement = ack-nhfb, 21277 classcodes = "C6140 (Programming languages); C6150C (Compilers, interpreters and other processors)", 21278 classification = "723", 21279 corpsource = "MIT, Cambridge, MA, USA", 21280 journalabr = "Commun ACM", 21281 keywords = "algorithmic solution; compiled code; computational linguistics; computer operating systems; computer programming --- Structured Programming; computer programming languages; execution time; inline substitution; languages; optimization technique; procedure calls; program compilers; programming; run time statistics; structured programming; structured programming language", 21282 treatment = "P Practical", 21283 } 21284 21285 @Article{Gifford:1977:HEP, 21286 author = "David K. Gifford", 21287 title = "Hardware Estimation of a Process' Primary Memory Requirements", 21288 journal = j-CACM, 21289 volume = "20", 21290 number = "9", 21291 pages = "655--663", 21292 month = sep, 21293 year = "1977", 21294 CODEN = "CACMA2", 21295 ISSN = "0001-0782", 21296 bibdate = "Tue Mar 25 13:26:09 MST 1997", 21297 bibsource = "Compendex database", 21298 abstract = "A minor hardware extension to the Honeywell 6180 processor is demonstrated to allow the primary memory requirements of a process in Multics to be approximated. The additional hardware required for this estimate to be computed consists of a program accessible register containing the miss rate of the associative memory used for page table words. This primary memory requirement estimate was employed in an experimental version of Multics to control the level of multiprogramming in the system and to bill for memory usage. The resulting system's tuning parameters display configuration insensitivity, and it is conjectured that the system would also track shifts in the referencing characteristics of its workload and keep the system in tune.", 21299 acknowledgement = ack-nhfb, 21300 classcodes = "C5220 (Computer architecture); C6150J (Operating systems)", 21301 classification = "722; 723", 21302 corpsource = "MIT, Cambridge, MA, USA", 21303 journalabr = "Commun ACM", 21304 keywords = "associative memory; computer systems programming --- Multiprogramming; configuration insensitivity; content-addressable storage; data storage, digital; hardware extension; memory usage; Multics; multiprogramming; primary memory requirements; program accessible register; referencing characteristics; tuning; tuning parameters; virtual storage", 21305 treatment = "P Practical", 21306 } 21307 21308 @Article{Mairson:1977:SNU, 21309 author = "Harry G. Mairson", 21310 title = "Some New Upper Bounds on the Generation of Prime Numbers", 21311 journal = j-CACM, 21312 volume = "20", 21313 number = "9", 21314 pages = "664--669", 21315 month = sep, 21316 year = "1977", 21317 CODEN = "CACMA2", 21318 ISSN = "0001-0782", 21319 MRclass = "68A20 (10A25 10-04)", 21320 MRnumber = "56 4236", 21321 mrreviewer = "G. Wechsung", 21322 bibdate = "Tue Mar 25 13:26:09 MST 1997", 21323 bibsource = "Compendex database", 21324 abstract = "Given an integer N, what is the computational complexity of finding all the primes less than N? A modified sieve of Eratosthenes using doubly linked lists yields an algorithm of O//A(N) arithmetic complexity. This upper bound is shown to be equivalent to the theoretical lower bound for sieve methods without preprocessing. Use of preprocessing techniques involving space-time and additive-multiplicative tradeoffs reduces this upper bound to O//A(N/log logN) and the bit complexity to O//B(N logN log log logN). A storage requirement is described using O//B(N logN\slash log logN) bits as well.", 21325 acknowledgement = ack-nhfb, 21326 classcodes = "C5230 (Digital arithmetic methods)", 21327 classification = "723; 921", 21328 corpsource = "Calhoun College, Yale Univ., New Haven, CT, USA", 21329 journalabr = "Commun ACM", 21330 keywords = "computational complexity; computer programming --- Subroutines; generation of prime numbers; mathematical techniques; methods; number theory; preprocessing techniques; requirement; sieve; storage; upper bound", 21331 treatment = "T Theoretical or Mathematical", 21332 } 21333 21334 @Article{McCreight:1977:PBT, 21335 author = "Edward M. McCreight", 21336 title = "Pagination of {B*}-Trees with Variable-Length Records", 21337 journal = j-CACM, 21338 volume = "20", 21339 number = "9", 21340 pages = "670--674", 21341 month = sep, 21342 year = "1977", 21343 CODEN = "CACMA2", 21344 ISSN = "0001-0782", 21345 bibdate = "Tue Mar 25 13:26:09 MST 1997", 21346 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib", 21347 abstract = "A strategy is presented for pagination of B*-trees with variable-length records. If records of each length are uniformly distributed within the file, and if a wide distribution of record lengths exists within the file, then this strategy results in shallow trees with fast access times. The performance of this strategy in an application is presented, compared with that of another strategy, and analyzed.", 21348 acknowledgement = ack-nhfb, 21349 classcodes = "C6120 (File organisation)", 21350 classification = "723; 901; 921", 21351 corpsource = "Xerox Palo Alto Res. Center, Palo Alto, CA, USA", 21352 journalabr = "Commun ACM", 21353 keywords = "data base systems; data processing --- Data Handling; data searching; information retrieval systems; mathematical techniques --- Trees", 21354 keywords = "B* tree; fast access times; file; file organisation; pagination; shallow trees; strategy; trees (mathematics); variable length records", 21355 treatment = "P Practical", 21356 } 21357 21358 @Article{Fuchs:1977:OSR, 21359 author = "H. Fuchs and Z. M. Kedem and S. P. Uselton", 21360 title = "Optimal Surface Reconstruction from Planar Contours", 21361 journal = j-CACM, 21362 volume = "20", 21363 number = "10", 21364 pages = "693--702", 21365 month = oct, 21366 year = "1977", 21367 CODEN = "CACMA2", 21368 ISSN = "0001-0782", 21369 MRclass = "68A45", 21370 MRnumber = "58 25163", 21371 mrreviewer = "Giorgio Balconi", 21372 bibdate = "Tue Mar 25 13:26:09 MST 1997", 21373 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Graphics/imager/imager.77.bib and ftp://ftp.ira.uka.de/pub/bibliography/Graphics/siggraph/77.bib", 21374 abstract = "This paper presents a general solution to the problem of constructing a surface over a set of cross-sectional contours. This surface, to be composed of triangular tiles, is constructed by separately determining an optimal surface between each pair of consecutive contours. Determining such a surface is reduced to the problem of finding certain minimum cost cycles in a directed toroidal graph. A new fast algorithm for finding such cycles is utilized. Also developed is a closed-form expression, in terms of the number of contour points, for an upper bound on the number of operations required to execute the algorithm. An illustrated example which involves the construction of a minimum area surface describing a human head is included.", 21375 acknowledgement = ack-nhfb, 21376 annote = "Also in Computer Graphics (Special issue of SIGGRAPH '77, preliminary papers), pp. 11--24.", 21377 classcodes = "C6130B (Graphics techniques)", 21378 classification = "723", 21379 corpsource = "Univ. of Texas, Dallas, TX, USA", 21380 journalabr = "Commun ACM", 21381 keywords = "computer graphics; optimal; planar contours; reconstruction of objects; surface reconstruction; triangular tiles", 21382 treatment = "T Theoretical or Mathematical", 21383 } 21384 21385 @Article{Wu:1977:ICG, 21386 author = "Sheng-Chuan C. Wu and John F. Abel and Donald P. Greenberg", 21387 title = "An Interactive Computer Graphics Approach to Surface Representation", 21388 journal = j-CACM, 21389 volume = "20", 21390 number = "10", 21391 pages = "703--712", 21392 month = oct, 21393 year = "1977", 21394 CODEN = "CACMA2", 21395 ISSN = "0001-0782", 21396 bibdate = "Tue Mar 25 13:26:09 MST 1997", 21397 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1977.bib and ftp://ftp.ira.uka.de/pub/bibliography/Graphics/imager/imager.77.bib", 21398 abstract = "An interactive computer graphics method has been developed for the rapid generation of arbitrary shaped three-dimensional surfaces. The method is a synthesis of spline theory and algorithms, an interactive means for man-machine communication, and software for static or dynamic graphics display. The basic technique employed is a modified lofting method in which sectional curves are represented by uniform B-splines and the surface is interpolated between sections by Cardinal splines. Among the features of this method are algorithms which enable interactive modification of the B-spline representation of the sectional curves. At all stages of the process, the spatial information is graphically displayed to the user. Complex surfaces can be created by the combination of a number of shapes that have been separately generated and automatically joined. The system has been successfully interfaced to a variety of analytical routines for structural, medical and graphical applications.", 21399 acknowledgement = ack-nhfb, 21400 annote = "Also in Computer Graphics (Special issue of SIGGRAPH '77, preliminary papers), pp. 1--10. An interactive computer graphics method has been developed for the rapid generation of arbitrary shaped three-dimensional surfaces. The method is a synthesis of spline theory and algorithms, an interactive means for man-machine communication, and software for static or dynamic graphics display. The basic technique employed is a modified lofting method in which sectional curves are represented by uniform B-splines and the surface is interpolated", 21401 classcodes = "C6130B (Graphics techniques)", 21402 classification = "723", 21403 corpsource = "Cornell Univ., Ithaca, NY, USA", 21404 descriptors = "Graphics; two-dimensional plot; three-dimensional plot; method; process interaction; interpolation; human factors; spline; finite element input method", 21405 journalabr = "Commun ACM", 21406 keywords = "computer graphics; interactive computer graphics; representation; representation graphic; representation surface geometry; splines; splines (mathematics); surface representation", 21407 treatment = "A Application; T Theoretical or Mathematical", 21408 } 21409 21410 @Article{Rosen:1977:HLD, 21411 author = "Barry K. Rosen", 21412 title = "High-Level Data Flow Analysis", 21413 journal = j-CACM, 21414 volume = "20", 21415 number = "10", 21416 pages = "712--724", 21417 month = oct, 21418 year = "1977", 21419 CODEN = "CACMA2", 21420 ISSN = "0001-0782", 21421 bibdate = "Tue Mar 25 13:26:09 MST 1997", 21422 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Compiler/Compiler.Lins.bib", 21423 abstract = "In contrast to the predominant use of low-level in termediate text, high-level data flow analysis deals with programs essentially at source level and exploits the control flow information implicit in the parse tree. The need for high-level flow analysis arises from several aspects of recent work on advanced methods of program certification and optimization. \par This paper proposes a simple general method of high-level data flow analysis that allows free use of escape and jump statements, avoids large graphs when compiling large programs, facilitates updating of data flow information to reflect program changes, and derives new global information helpful in solving many familiar global flow analysis problems. An illustrative application to live variable analysis is presented. \par Many of the graphs involved are constructed and analyzed before any programs are compiled, thus avoiding certain costs that low-level methods incur repeatedly at compile time.", 21424 acknowledgement = ack-nhfb, 21425 classcodes = "C4240 (Programming and algorithm theory); C6110 (Systems analysis and programming)", 21426 classification = "723", 21427 corpsource = "IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA", 21428 journalabr = "Commun ACM", 21429 keywords = "computer programming --- Structural Programming; computer programming languages; control flow graph; data flow analysis; data processing --- Data Reduction and Analysis; escapes; exits; goto statements; high-level language; jumps; structured programming", 21430 keywords = "data flow analysis; escape; high; jump; level; programs; statements; structured programming", 21431 treatment = "T Theoretical or Mathematical", 21432 } 21433 21434 @Article{Montangero:1977:TCS, 21435 author = "C. Montangero and G. Pacini and F. Turini", 21436 title = "Two-Level Control Structure for Nondeterministic Programming", 21437 journal = j-CACM, 21438 volume = "20", 21439 number = "10", 21440 pages = "725--730", 21441 month = oct, 21442 year = "1977", 21443 CODEN = "CACMA2", 21444 ISSN = "0001-0782", 21445 bibdate = "Tue Mar 25 13:26:09 MST 1997", 21446 bibsource = "Compendex database", 21447 abstract = "The basic ideas of nondeterministic programming are critically reconsidered to single out a proper attitude and programming style for languages allowing direct control of nondeterministic features. The proposed attitude aims at retaining the purity of the nondeterministic formulation of search processes on one level (the attempt level), deferring the coordination of problem solving efforts to another (the choice level). The feasibility of recognizing these two levels is discussed, stressing that the structure to be managed at the choice level is a tree of contexts. The leaves are computational environments, each holding an alternative under inspection, while the other nodes are associated with choice points. According to the proposed programming style, a generative function is associated with each choice point, which expresses the desired choice strategy. The main advantage of this approach is the localization of the search strategies: Each nonterminal node of the tree keeps track of the state of the computation as it was when the choice point was last interrogated, holding at the same time the strategy to coordinate the available alternatives. Examples are given in term of ND-Lisp, an extension of Lisp designed and implemented according to these guidelines.", 21448 acknowledgement = ack-nhfb, 21449 classcodes = "C4240 (Programming and algorithm theory)", 21450 classification = "723", 21451 corpsource = "Univ. of Pisa, Pisa, Italy", 21452 journalabr = "Commun ACM", 21453 keywords = "computer programming languages; control structure; languages; nondeterministic programming; programming theory; two level", 21454 treatment = "T Theoretical or Mathematical", 21455 } 21456 21457 @Article{LaLonde:1977:RRP, 21458 author = "Wilf R. LaLonde", 21459 title = "Regular Right Part Grammars and Their Parsers", 21460 journal = j-CACM, 21461 volume = "20", 21462 number = "10", 21463 pages = "731--741", 21464 month = oct, 21465 year = "1977", 21466 CODEN = "CACMA2", 21467 ISSN = "0001-0782", 21468 MRclass = "68A30", 21469 MRnumber = "58 13974", 21470 bibdate = "Tue Mar 25 13:26:09 MST 1997", 21471 bibsource = "Compendex database", 21472 abstract = "Regular right part (RRP) grammars, which resemble PASCAL syntax diagrams, describe the syntax of programming languages more concisely and more understandably than is possible with CF grammars. Also introduced is a class of parsers, RRP LR(m, k) parsers, which includes the CF LR(k) parsers and provides the same advantages. Informally, an RRP LR(m, k) parser can determine the right end of each handle by considering at most k symbols to the right of the handle and the left end, after the right end has been found, by considering at most m symbols to the left of the handle. A mechanism for determining the left end is required because there is no bound on the length of the handle.", 21473 acknowledgement = ack-nhfb, 21474 classcodes = "C4210 (Formal logic); C4220 (Automata theory)", 21475 classification = "721; 723", 21476 corpsource = "Carleton Univ., Ottawa, Ont., Canada", 21477 journalabr = "Commun ACM", 21478 keywords = "automata theory; computer programming languages; finite automata; finite state machines; grammars; parsers; regular right part; regular right part grammar; RRP grammars", 21479 treatment = "T Theoretical or Mathematical", 21480 } 21481 21482 @Article{Devillers:1977:GID, 21483 author = "R. Devillers", 21484 title = "Game Interpretation of the Deadlock Avoidance Problem", 21485 journal = j-CACM, 21486 volume = "20", 21487 number = "10", 21488 pages = "741--745", 21489 month = oct, 21490 year = "1977", 21491 CODEN = "CACMA2", 21492 ISSN = "0001-0782", 21493 bibdate = "Tue Mar 25 13:26:09 MST 1997", 21494 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Parallel/Multi.bib", 21495 abstract = "The deadlock avoidance problem may be defined informally as the determination, from some a priori information about the processes, resources, operating system, etc., of the ``safe situations'' which may be realized without endangering the smooth running of the system. When each process specifies its future needs by a flowchart of need-defined steps, a global approach to the phenomenon and its interpretation as a game between the operating system and the processes allows formalization of risk and safety concepts. The bipartite graph representation of this game may then be used to construct explicitly the set of safe states and to study their properties.", 21496 acknowledgement = ack-nhfb, 21497 classcodes = "C4240 (Programming and algorithm theory); C6150J (Operating systems)", 21498 classification = "723; 922", 21499 corpsource = "Free Univ. of Brussels, Brussels, Belgium", 21500 journalabr = "Commun ACM", 21501 keywords = "computer operating systems; deadlock avoidance; multiprogramming; operating system; probability --- Game Theory; processes; resources", 21502 treatment = "T Theoretical or Mathematical", 21503 } 21504 21505 @Article{Ivie:1977:PWM, 21506 author = "Evan L. Ivie", 21507 title = "Programmer's Workbench --- a Machine for Software Development", 21508 journal = j-CACM, 21509 volume = "20", 21510 number = "10", 21511 pages = "746--753", 21512 month = oct, 21513 year = "1977", 21514 CODEN = "CACMA2", 21515 ISSN = "0001-0782", 21516 bibdate = "Tue Mar 25 13:26:09 MST 1997", 21517 bibsource = "Compendex database", 21518 abstract = "In this paper it is suggested that there are many situations where it would be advantageous to separate the program development and maintenance function onto a specialized computer which is dedicated to that purpose. Such a computer is here called a Programmer's Workbench. The four basic sections of the paper introduce the subject, outline the general concept, discuss areas where such an approach may prove beneficial, and described and operational system utilizing this concept.", 21519 acknowledgement = ack-nhfb, 21520 classcodes = "C5420 (Mainframes and minicomputers); C6110 (Systems analysis and programming)", 21521 classification = "723", 21522 corpsource = "Bell Telephone Labs., Murray Hill, NJ, USA", 21523 journalabr = "Commun ACM", 21524 keywords = "computer operating systems; computer programming; dedicated; maintenance; Programmer's Workbench; programming; software development; special purpose computers; specialized computer", 21525 treatment = "P Practical", 21526 } 21527 21528 @Article{Smith:1977:MMO, 21529 author = "Alan Jay Smith", 21530 title = "Multiprocessor Memory Organization and Memory Interference", 21531 journal = j-CACM, 21532 volume = "20", 21533 number = "10", 21534 pages = "754--761", 21535 month = oct, 21536 year = "1977", 21537 CODEN = "CACMA2", 21538 ISSN = "0001-0782", 21539 bibdate = "Tue Mar 25 13:26:09 MST 1997", 21540 bibsource = "Compendex database", 21541 abstract = "The structure of shared memory in a multiprocessor computer system is examined with particular attention to noninterleaved memory. Alternative memory organizations are compared and it is shown that a home memory organization, in which each processor is associated with one or more memories in which its address space concentrated, is quite effective in reducing memory interference. Home memory organization is shown to be particularly suited to certain specialized computational problems as well as to possess advantages in terms of interference and reliability for general purpose computation. Results for interleaved memory are drawn from previous work and are used for comparison. Trace-driven simulations are used to verify the conclusions of the analysis.", 21542 acknowledgement = ack-nhfb, 21543 classcodes = "C5220 (Computer architecture)", 21544 classification = "723", 21545 corpsource = "Univ. of California, Berkeley, CA, USA", 21546 journalabr = "Commun ACM", 21547 keywords = "computer system; computer systems programming; file organisation; memory interference; memory organization; multiprocessing systems; multiprocessor; noninterleaved memory; shared memory", 21548 treatment = "T Theoretical or Mathematical", 21549 } 21550 21551 @Article{Boyer:1977:FSS, 21552 author = "Robert S. Boyer and J. Strother Moore", 21553 title = "A Fast String Searching Algorithm", 21554 journal = j-CACM, 21555 volume = "20", 21556 number = "10", 21557 pages = "762--772", 21558 month = oct, 21559 year = "1977", 21560 CODEN = "CACMA2", 21561 ISSN = "0001-0782", 21562 bibdate = "Tue Mar 25 13:26:09 MST 1997", 21563 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Misc/protein.pattern.bib", 21564 note = "See also \cite{Knuth:1977:FPM} and \cite{Sunday:1990:VFS}.", 21565 abstract = "An algorithm is presented that searches for the location, ``i,'' of the first occurrence of a character string, ``pat,'' in another string, ``string.'' During the search operation, the characters of pat are matched starting with the last character of pat. The information gained by starting the match at the end of the pattern often allows the algorithm to proceed in large jumps through the text being searched. Thus the algorithm has the unusual property that, in most cases, not all of the first i characters of string are inspected. The number of characters actually inspected (on the average) decreases as a function of the length of pat. For a random English pattern of length 5, the algorithm will typically inspect i/4 characters of string before finding a match at i. Furthermore, the algorithm has been implemented so that (on the average) fewer than i plus patlen machine instructions are executed. These conclusions are supported with empirical evidence and a theoretical analysis of the average behavior of the algorithm. The worst case behavior of the algorithm is linear in i plus patlen, assuming the availability of array space for tables linear in patlen plus the size of the alphabet.", 21566 acknowledgement = ack-nhfb, 21567 classcodes = "C4240 (Programming and algorithm theory); C6130 (Data handling techniques)", 21568 classification = "723; 901", 21569 comment = "The Boyer-Moore string matching algorithm is, in the worst case, linear in the length of the text + length of the pattern. The average case behavior is sublinear. Practical efficient implementations of this algorithm exist. By starting the comparisons at the right of the pattern instead of the left of the pattern, large jumps can be made in the text.", 21570 corpsource = "Stanford Res. Inst., Stanford, CA, USA", 21571 journalabr = "Commun ACM", 21572 keywords = "algorithm; Boyer-Moore; character string; computer operating systems; computer programming; fast; information science --- Information Retrieval; list processing; pattern matching; string matching; string searching; text; text editing", 21573 treatment = "T Theoretical or Mathematical", 21574 } 21575 21576 @Article{Lee:1977:CFP, 21577 author = "J. A. N. Lee", 21578 title = "Considerations for future programming language standards activities", 21579 journal = j-CACM, 21580 volume = "20", 21581 number = "11", 21582 pages = "788--794", 21583 month = nov, 21584 year = "1977", 21585 CODEN = "CACMA2", 21586 ISSN = "0001-0782", 21587 bibdate = "Tue Mar 25 13:26:09 MST 1997", 21588 acknowledgement = ack-nhfb, 21589 classcodes = "C6140D (High level languages)", 21590 corpsource = "Dept. of Computer Sci., Virginia Polytech. Inst. and State Univ., Blacksburg, VA, USA", 21591 keywords = "BASIC; COBOL; documentation; error conditions; FORTRAN; future; PL/I; procedure oriented languages; programming language; standards", 21592 treatment = "G General Review; P Practical", 21593 } 21594 21595 @Article{Turner:1977:ULS, 21596 author = "Rollins Turner and Bill Strecker", 21597 title = "Use of the {LRU} Stack Depth Distribution for Simulation of Paging Behavior", 21598 journal = j-CACM, 21599 volume = "20", 21600 number = "11", 21601 pages = "795--798", 21602 month = nov, 21603 year = "1977", 21604 CODEN = "CACMA2", 21605 ISSN = "0001-0782", 21606 bibdate = "Tue Mar 25 13:26:09 MST 1997", 21607 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Misc/storage.bib", 21608 abstract = "Two families of probability distributions are needed for use by a virtual memory simulation model: headway between page fault distributions, and working set size distributions. All members of both families can be derived from the LRU stack depth distribution. Simple expressions for the computation of both kinds of distributions are given. Finally, examples are given of both families of distributions as computed from a published stack depth distribution.", 21609 acknowledgement = ack-nhfb, 21610 classcodes = "C6120 (File organisation)", 21611 classification = "723", 21612 corpsource = "Digital Equipment Corp., Maynard, MA, USA", 21613 journalabr = "Commun ACM", 21614 keywords = "computer operating systems; fault distributions; least; LRU; memory hierarchy; paging; Performance Evaluation: Experimental; probability; recently used; simulation; stack depth distribution; virtual memory; virtual storage", 21615 treatment = "T Theoretical or Mathematical", 21616 } 21617 21618 @Article{Crow:1977:APC, 21619 author = "Franklin C. Crow", 21620 title = "The Aliasing Problem in Computer-Generated Shaded Images", 21621 journal = j-CACM, 21622 volume = "20", 21623 number = "11", 21624 pages = "799--805", 21625 month = nov, 21626 year = "1977", 21627 CODEN = "CACMA2", 21628 ISSN = "0001-0782", 21629 bibdate = "Tue Mar 25 13:26:09 MST 1997", 21630 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1977.bib", 21631 abstract = "Certain defects, such as jagged edges and disappearing detail, have long been an annoyance in digitally generated shaded images. Although increasing the resolution or defocusing the display can attenuate them, an understanding of these defects leads to more effective methods. This paper explains the observed defects in terms of the aliasing phenomenon inherent in sampled signals and discusses prefiltering as a recognized cure. A method for evaluating filters is presented, the application of prefiltering to hidden-surface algorithms is discussed, and an implementation of a filtering tiler is shown accompanied by examples of its effectiveness.", 21632 acknowledgement = ack-nhfb, 21633 annote = "Certain defects, such as jagged edges and disappearing detail, have long been an annoyance in digitally generated shaded images. Although increasing the resolution or defocusing the display can attenuate them, an understanding of these defects leads to more effective methods. This paper explains the observed defects in terms of the aliasing phenomenon inherent in sampled signals and discusses prefiltering as a recognized cure \ldots.", 21634 classcodes = "C6130B (Graphics techniques)", 21635 classification = "723", 21636 corpsource = "Univ. of Texas, Austin, TX, USA", 21637 descriptors = "Method; graphics; three-dimensional plot; display; filter theory; sampling; aliasing; convolutional filtering; hidden line algorithm", 21638 journalabr = "Commun ACM", 21639 keywords = "aliasing; antialiasing; CACM; computer graphics; defects; filtering tiler; prefiltering; sampled signals; shaded images", 21640 treatment = "P Practical", 21641 } 21642 21643 @Article{Lamport:1977:CRW, 21644 author = "Leslie Lamport", 21645 title = "Concurrent Reading and Writing", 21646 journal = j-CACM, 21647 volume = "20", 21648 number = "11", 21649 pages = "806--811", 21650 month = nov, 21651 year = "1977", 21652 CODEN = "CACMA2", 21653 ISSN = "0001-0782", 21654 MRclass = "68A05", 21655 MRnumber = "57 4572", 21656 mrreviewer = "Richard A. DeMillo", 21657 bibdate = "Tue Mar 25 13:26:09 MST 1997", 21658 bibsource = "Compendex database", 21659 abstract = "The problem of sharing data among asynchronous processes is considered. It is assumed that only one process at a time can modify the data, but concurrent reading and writing is permitted. Two general theorems are proved, and some algorithms are presented to illustrate their use. These include a solution to the general problem in which a read is repeated if it might have obtained an incorrect result, and two techniques for transmitting messages between processes. These solutions do not assume any synchronizing mechanism other than data which can be written by one process and read by other processes.", 21660 acknowledgement = ack-nhfb, 21661 classcodes = "C6150J (Operating systems)", 21662 classification = "723", 21663 corpsource = "Massachusetts Computer Associates, Wakefield, MA, USA", 21664 journalabr = "Commun ACM", 21665 keywords = "algorithms; asynchronous processes; computer systems programming; concurrent; multiprocessing programs; reading; sharing data; theorems; writing", 21666 treatment = "T Theoretical or Mathematical", 21667 } 21668 21669 @Article{Shore:1977:ABF, 21670 author = "John E. Shore", 21671 title = "Anomalous Behavior of the Fifty-Percent Rule in Dynamic Memory Allocation", 21672 journal = j-CACM, 21673 volume = "20", 21674 number = "11", 21675 pages = "812--820", 21676 month = nov, 21677 year = "1977", 21678 CODEN = "CACMA2", 21679 ISSN = "0001-0782", 21680 bibdate = "Tue Mar 25 13:26:09 MST 1997", 21681 bibsource = "Compendex database", 21682 abstract = "Simulation data are reported showing that, in dynamic memory allocation, the average free-to-allocated-block ratio can differ considerably and in both directions from the predictions of the 50 percent rule. A new derivation is given, and it is shown that previous derivations make an assumption that may be violated frequently. On the basis of the simulation data and the derivation, it is hypothesized that the anomalous behavior results from the combined effects of systematic placement and the statistics of the release process. Additional simulations support this hypothesis. Systematic placement, which refers to the natural convention of always allocating storage requests against the same end of the free block selected by the allocation strategy, tends to order blocks within contiguous groups, according to their allocation time. The degree of anomalous behavior depends on the extent to which allocated blocks are released in the order of their allocation. For non-Markovian release processes, the extent of the correlation between allocation order and release order varies approximately inversely with the coefficient of variation of the memory residence time distribution. The simulations show that allocation efficiency depends strongly on the residence time distribution; efficiency decreases as the distribution's coefficient of variation increases. Some practical implications are briefly discussed.", 21683 acknowledgement = ack-nhfb, 21684 classcodes = "C6120 (File organisation)", 21685 classification = "723", 21686 corpsource = "Naval Res. Lab., Washington, DC, USA", 21687 journalabr = "Commun ACM", 21688 keywords = "50 percent rule; anomalous behaviour; computer operating systems; dynamic memory allocation; release process; simulation; storage allocation; systematic placement", 21689 treatment = "T Theoretical or Mathematical", 21690 } 21691 21692 @Article{Stockman:1977:EHC, 21693 author = "G. C. Stockman and A. K. Agrawala", 21694 title = "Equivalence of {Hough} curve detection to template matching", 21695 journal = j-CACM, 21696 volume = "20", 21697 number = "11", 21698 pages = "820--822", 21699 month = nov, 21700 year = "1977", 21701 CODEN = "CACMA2", 21702 ISSN = "0001-0782", 21703 bibdate = "Tue Mar 25 13:26:09 MST 1997", 21704 acknowledgement = ack-nhfb, 21705 classcodes = "B6140C (Optical information, image and video signal processing); C1250 (Pattern recognition)", 21706 corpsource = "LNK Corp., Silver Spring, MD, USA", 21707 keywords = "Hough; Hough curve detection; pattern recognition; template matching; transformation", 21708 treatment = "T Theoretical or Mathematical", 21709 } 21710 21711 @Article{Wirth:1977:WCW, 21712 author = "N. Wirth", 21713 title = "What can we do about the unnecessary diversity of notation for syntactic definitions?", 21714 journal = j-CACM, 21715 volume = "20", 21716 number = "11", 21717 pages = "822--823", 21718 month = nov, 21719 year = "1977", 21720 CODEN = "CACMA2", 21721 ISSN = "0001-0782", 21722 bibdate = "Tue Mar 25 13:26:09 MST 1997", 21723 acknowledgement = ack-nhfb, 21724 classcodes = "C4210 (Formal logic); C4240 (Programming and algorithm theory); C6140D (High level languages)", 21725 corpsource = "Federal Inst. of Technol., ETH, Zurich, Switzerland", 21726 keywords = "notation; programming languages; syntactic definitions", 21727 treatment = "T Theoretical or Mathematical", 21728 } 21729 21730 @Article{Roy:1977:NRP, 21731 author = "M. K. Roy", 21732 title = "A note on reflection-free permutation enumeration", 21733 journal = j-CACM, 21734 volume = "20", 21735 number = "11", 21736 pages = "823--823", 21737 month = nov, 21738 year = "1977", 21739 CODEN = "CACMA2", 21740 ISSN = "0001-0782", 21741 bibdate = "Tue Mar 25 13:26:09 MST 1997", 21742 acknowledgement = ack-nhfb, 21743 classcodes = "C6110 (Systems analysis and programming)", 21744 corpsource = "Jadavpur Univ., Calcutta, India", 21745 keywords = "enumeration; permutation; programming; reflection free", 21746 treatment = "P Practical; T Theoretical or Mathematical", 21747 } 21748 21749 @Article{Manna:1977:OAR, 21750 author = "Zohar Manna and Adi Shamir", 21751 title = "The Optimal Approach to Recursive Programs", 21752 journal = j-CACM, 21753 volume = "20", 21754 number = "11", 21755 pages = "824--831", 21756 month = nov, 21757 year = "1977", 21758 CODEN = "CACMA2", 21759 ISSN = "0001-0782", 21760 MRclass = "68A05", 21761 MRnumber = "56 13748", 21762 mrreviewer = "Giorgio Levi", 21763 bibdate = "Tue Mar 25 13:26:09 MST 1997", 21764 acknowledgement = ack-nhfb, 21765 classcodes = "C4240 (Programming and algorithm theory) 1 Years All Years in which items were published. 2 Type All Publication types. 3 Language All Find only items published in this language. In any year A hyphen or ALL - In a certain year The four-digit year 1923 In or after a certain year The year and a hyphen 1960- In or before a certain year A hyphen and a year -1955 In or between two years Both years and a hyphen 1960-1975 1 Years 1970-1979 Years in which items were published. 2 Type All Publication types. 3 Language All Find only items published in this language.", 21766 corpsource = "Weizmann Inst. of Sci., Rehovoth, Israel", 21767 keywords = "optimal approach; optimal fixedpoints; programming theory; recursive programs", 21768 treatment = "T Theoretical or Mathematical", 21769 } 21770 21771 @Article{Hammer:1977:VHL, 21772 author = "Michael Hammer and W. Gerry Howe and Vincent J. Kruskal and Irving Wladawsky", 21773 title = "Very High Level Programming Language for Data Processing Applications", 21774 journal = j-CACM, 21775 volume = "20", 21776 number = "11", 21777 pages = "832--840", 21778 month = nov, 21779 year = "1977", 21780 CODEN = "CACMA2", 21781 ISSN = "0001-0782", 21782 bibdate = "Tue Mar 25 13:26:09 MST 1997", 21783 bibsource = "Compendex database", 21784 abstract = "The structure of a very high level language designed for use in business data processing applications is described. The language, Business Definition Language (BDL), has been subjected to a number of validation studies where it was used to code parts of existing systems. An implementation is currently under way, as is a modeling and customization effort using BDL as the underlying system language. This latter system will be used to tailor predesigned application systems to an individual's needs by means of his responses to a questionnaire.", 21785 acknowledgement = ack-nhfb, 21786 classcodes = "C6140D (High level languages); C7100 (Business and administration)", 21787 classification = "723", 21788 corpsource = "IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA", 21789 journalabr = "Commun ACM", 21790 keywords = "administrative data processing; BDL; business; business definition; business forms; calculations; computer programming languages; data processing, business; language; organization; problem oriented languages; sublanguages; very high level programming language", 21791 treatment = "P Practical", 21792 } 21793 21794 @Article{Sprugnoli:1977:PHF, 21795 author = "Renzo Sprugnoli", 21796 title = "Perfect Hashing Functions: {A} Single Probe Retrieving Method for Static Sets", 21797 journal = j-CACM, 21798 volume = "20", 21799 number = "11", 21800 pages = "841--850", 21801 month = nov, 21802 year = "1977", 21803 CODEN = "CACMA2", 21804 ISSN = "0001-0782", 21805 MRclass = "68A50", 21806 MRnumber = "56 17255", 21807 mrreviewer = "Eberhard Ludde", 21808 bibdate = "Tue Mar 25 13:26:09 MST 1997", 21809 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Theory/ProbAlgs.bib", 21810 note = "This is the first discussion on perfect hashing; describes heuristics for constructing perfect hash functions.", 21811 abstract = "A refinement of hashing which allows retrieval of an item in a static table with a single probe is considered. Given a set I of identifiers, two methods are presented for building, in a mechanical way, perfect hashing functions, i.e. functions transforming the elements of I into unique addresses. The first method, the ``quotient reduction'' method, is shown to be complete in the sense that for every set I the smallest table in which the elements of I can be stored and from which they can be retrieved by using a perfect hashing function constructed by this method can be found. However, for nonuniformly distributed sets, this method can give rather sparse tables. The second method, the ``remainder reduction'' method, is not complete in the above sense, but it seems to give minimal (or almost minimal) tables for every kind of set. The two techniques are applicable directly to small sets. Some methods to extend these results to larger sets are also presented. A rough comparison with ordinary hashing is given which shows that this method can be used conveniently in several practical applications.", 21812 acknowledgement = ack-nhfb, 21813 classcodes = "C6120 (File organisation)", 21814 classification = "723", 21815 corpsource = "Istituto di Elaborazione della Informazione, CNR, Pisa, Italy", 21816 journalabr = "Commun ACM", 21817 keywords = "computer programming; file organisation; functions; perfect hashing; retrieving; single probe; static sets", 21818 treatment = "T Theoretical or Mathematical", 21819 } 21820 21821 @Article{Cocke:1977:ARO, 21822 author = "John Cocke and Ken Kennedy", 21823 title = "An Algorithm for Reduction of Operator Strength", 21824 journal = j-CACM, 21825 volume = "20", 21826 number = "11", 21827 pages = "850--856", 21828 month = nov, 21829 year = "1977", 21830 CODEN = "CACMA2", 21831 ISSN = "0001-0782", 21832 bibdate = "Tue Mar 25 13:26:09 MST 1997", 21833 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Compiler/Compiler.Lins.bib", 21834 abstract = "A simple algorithm which uses an indexed temporary table to perform reduction of operator strength in strongly connected regions is presented. Several extensions, including linear function test replacement, are discussed. These algorithms should fit well into an integrated package of local optimization algorithms.", 21835 acknowledgement = ack-nhfb, 21836 classcodes = "C6150C (Compilers, interpreters and other processors)", 21837 classification = "723", 21838 corpsource = "IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA", 21839 journalabr = "Commun ACM", 21840 keywords = "algorithm; computer programming; indexed temporary; linear function test; local optimization; operator strength; program compilers; reduction; replacement; strongly connected regions; table", 21841 treatment = "P Practical; T Theoretical or Mathematical", 21842 } 21843 21844 @Article{Bird:1977:IPI, 21845 author = "R. S. Bird", 21846 title = "Improving Programs by the Introduction of Recursion", 21847 journal = j-CACM, 21848 volume = "20", 21849 number = "11", 21850 pages = "856--863", 21851 month = nov, 21852 year = "1977", 21853 CODEN = "CACMA2", 21854 ISSN = "0001-0782", 21855 MRclass = "68A05", 21856 MRnumber = "56 17179", 21857 mrreviewer = "V. Cazanescu", 21858 bibdate = "Tue Mar 25 13:26:09 MST 1997", 21859 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Misc/Functional.bib", 21860 abstract = "A new technique of program transformation, called ``recursion introduction,'' is described and applied to two algorithms which solve pattern matching problems. By using a recursion introduction, algorithms which manipulate a stack are first translated into recursive algorithms in which no stack operations occur. These algorithms are then subjected to a second transformation, a method of recursion elimination called ``tabulation,'' to produce programs with a very efficient running time. In particular, it is shown how the fast linear pattern matching algorithm of Knuth, Morris, and Pratt can be derived in a few steps from a simple nonlinear stack algorithm.", 21861 acknowledgement = ack-nhfb, 21862 classcodes = "C4240 (Programming and algorithm theory)", 21863 classification = "723", 21864 corpsource = "Univ. of Reading, Reading, UK", 21865 journalabr = "Commun ACM", 21866 keywords = "computer programming; functional program transformation optimization recursion elimination pattern matching computational induction; program transformation; programming theory; recursion introduction; stack", 21867 treatment = "T Theoretical or Mathematical", 21868 } 21869 21870 @Article{Nielsen:1977:DMA, 21871 author = "Norman R. Nielsen", 21872 title = "Dynamic Memory Allocation in Computer Simulation", 21873 journal = j-CACM, 21874 volume = "20", 21875 number = "11", 21876 pages = "864--873", 21877 month = nov, 21878 year = "1977", 21879 CODEN = "CACMA2", 21880 ISSN = "0001-0782", 21881 bibdate = "Tue Mar 25 13:26:09 MST 1997", 21882 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Compiler/garbage.collection.bib", 21883 abstract = "Investigation is made of the performance of 35 dynamic memory allocation algorithms when used to service simulation programs as represented by 18 test cases. Algorithm performance was measured in terms of processing time, memory usage, and external memory fragmentation. Algorithms maintaining separate free space lists for each size of memory block used tended to perform quite well compared with other algorithms. Simple algorithms operating on memory ordered lists (without any free list) performed surprisingly well. Algorithms employing power-of-two block sizes had favorable processing requirements but generally unfavorable memory usage. Algorithms employing LIFO, FIFO, or memory ordered free lists generally performed poorly compared with others.", 21884 acknowledgement = ack-nhfb, 21885 classcodes = "C6120 (File organisation)", 21886 classification = "723", 21887 corpsource = "Stanford Res. Inst., Menlo Park, CA, USA", 21888 journalabr = "Commun ACM", 21889 keywords = "algorithms; computer operating systems --- Storage Allocation; computer simulation; digital simulation; dynamic memory allocation; external memory; fragmentation; memory usage; performance; processing time; storage allocation", 21890 treatment = "P Practical; T Theoretical or Mathematical", 21891 } 21892 21893 @Article{Blasgen:1977:EMM, 21894 author = "Michael W. Blasgen and Richard G. Casey and Kapali P. Eswaran", 21895 title = "An Encoding Method for Multifield Sorting and Indexing", 21896 journal = j-CACM, 21897 volume = "20", 21898 number = "11", 21899 pages = "874--878", 21900 month = nov, 21901 year = "1977", 21902 CODEN = "CACMA2", 21903 ISSN = "0001-0782", 21904 bibdate = "Tue Mar 25 13:26:09 MST 1997", 21905 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib", 21906 note = "Also published in/as: IBM, Res.R., RJ 1753, IBM San Jose, Res.Lab, Mar.1976.", 21907 abstract = "The efficient retrieval from a database of records that satisfy an expression involving more than one data field is examined. Sequences of character strings with an order relation imposed between sequences are considered. An encoding scheme is described which produces a single, order-preserving string from a sequence of strings. The original sequence can be recovered from the encoded string, and one sequence of strings precedes another if and only if the encoding of the first precedes the encoding of the second. The strings may be variable length, without a maximum length restriction, and no symbols need be reserved for control purposes. Hence any symbol may occur in any string. The scheme is useful for multifield sorting, multifield indexing, and other applications where ordering on more than one field is important.", 21908 acknowledgement = ack-nhfb, 21909 annote = "Coding for SYSTEM R multi-field indexes.", 21910 classcodes = "C6130 (Data handling techniques)", 21911 classification = "723", 21912 corpsource = "IBM Res. Lab., San Jose, CA, USA", 21913 journalabr = "Commun ACM", 21914 keywords = "character; codes, symbolic; encoding method; indexing; information science --- Information Retrieval; multifield sorting; order relation; sorting; strings", 21915 treatment = "P Practical; T Theoretical or Mathematical", 21916 } 21917 21918 @Article{Grapa:1977:STA, 21919 author = "Enrique Grapa and Geneva G. Belford", 21920 title = "Some Theorems to Aid in Solving the File Allocation Problem", 21921 journal = j-CACM, 21922 volume = "20", 21923 number = "11", 21924 pages = "878--882", 21925 month = nov, 21926 year = "1977", 21927 CODEN = "CACMA2", 21928 ISSN = "0001-0782", 21929 MRclass = "68A50", 21930 MRnumber = "57 4705", 21931 mrreviewer = "Witold Lipski", 21932 bibdate = "Tue Mar 25 13:26:09 MST 1997", 21933 bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib", 21934 acknowledgement = ack-nhfb, 21935 classcodes = "C0310 (EDP management); C5620 (Computer networks and techniques); C6120 (File organisation)", 21936 corpsource = "Univ. of Illinois, Urbana, IL, USA", 21937 keywords = "computer networks; copies; DP management; file allocation problem; network sites; storage allocation; theorems", 21938 treatment = "T Theoretical or Mathematical", 21939 } 21940 21941 @Article{Lopez:1977:SCS, 21942 author = "A. A. Lopez and R. Raymond and R. Tardiff", 21943 title = "A survey of computer science offerings in small liberal arts colleges", 21944 journal = j-CACM, 21945 volume = "20", 21946 number = "12", 21947 pages = "902--906", 21948 month = dec, 21949 year = "1977", 21950 CODEN = "CACMA2", 21951 ISSN = "0001-0782", 21952 bibdate = "Tue Mar 25 13:26:09 MST 1997", 21953 acknowledgement = ack-nhfb, 21954 classcodes = "C0220 (Computing education and training)", 21955 corpsource = "Univ. of Minnosota, Morris, MN, USA", 21956 keywords = "computer science; computer science education; curricular; development; programming courses; small liberal arts colleges", 21957 treatment = "G General Review", 21958 } 21959 21960 @Article{Kessels:1977:CFN, 21961 author = "J. L. W. Kessels", 21962 title = "A Conceptual Framework for a Nonprocedural Programming Language", 21963 journal = j-CACM, 21964 volume = "20", 21965 number = "12", 21966 pages = "906--913", 21967 month = dec, 21968 year = "1977", 21969 CODEN = "CACMA2", 21970 ISSN = "0001-0782", 21971 bibdate = "Tue Mar 25 13:26:09 MST 1997", 21972 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Parallel/Multi.bib", 21973 abstract = "A sequential programming language forces the programmer to prescribe explicitly the order in which the operations in his program have to be executed, even if the order is not relevant to the solution of his problem. The requirement to indicate irrelevant sequencing can be removed if the language provides facilities for specifying a task in a nonprocedural manner. In general, a program specified in this way will allow concurrent evaluation. A conceptual framework for a high level programming language is described providing both nonprocedural and sequential facilities. Within a program, nonprocedural and sequential program modules may be nested freely.", 21974 acknowledgement = ack-nhfb, 21975 classcodes = "C4240 (Programming and algorithm theory); C6140D (High level languages)", 21976 classification = "723", 21977 corpsource = "Philips Res. Labs., Eindhoven, Netherlands", 21978 journalabr = "Commun ACM", 21979 keywords = "computer programming languages; conceptual framework; concurrent; nonprocedural programming language; parallel; programming languages; sequential", 21980 treatment = "T Theoretical or Mathematical", 21981 } 21982 21983 @Article{Carter:1977:CSN, 21984 author = "J. Lawrence Carter", 21985 title = "A Case Study of a New Code Generation Technique for Compilers", 21986 journal = j-CACM, 21987 volume = "20", 21988 number = "12", 21989 pages = "914--920", 21990 month = dec, 21991 year = "1977", 21992 CODEN = "CACMA2", 21993 ISSN = "0001-0782", 21994 bibdate = "Tue Mar 25 13:26:09 MST 1997", 21995 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Compiler/compiler.bib and ftp://ftp.ira.uka.de/pub/bibliography/Compiler/semantics.bib", 21996 abstract = "Recent developments in optimizing techniques have allowed a new design for compilers to emerge. Such a compiler translates the parsed source code into lower level code by a sequence of steps. Each step expands higher level statements into blocks of lower level code and then performs optimizations on the result. Evidence is provided that this strategy can indeed result in good object code. The traditionally difficult PL/I concatenate statement was investigated as a detailed example.", 21997 acknowledgement = ack-nhfb, 21998 annote = "Describes a unified system which can handle both interpretation and compilation.", 21999 classcodes = "C6150C (Compilers, interpreters and other processors)", 22000 classification = "723", 22001 corpsource = "IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA", 22002 journalabr = "Commun ACM", 22003 keywords = "case study; code generation technique; codes, symbolic; compilers; computer operating systems; program compilers", 22004 treatment = "T Theoretical or Mathematical", 22005 } 22006 22007 @Article{Gries:1977:EPP, 22008 author = "David Gries", 22009 title = "An Exercise in Proving Parallel Programs Correct", 22010 journal = j-CACM, 22011 volume = "20", 22012 number = "12", 22013 pages = "921--930", 22014 month = dec, 22015 year = "1977", 22016 CODEN = "CACMA2", 22017 ISSN = "0001-0782", 22018 MRclass = "68A05", 22019 MRnumber = "58 3615", 22020 mrreviewer = "Andrzej Blikle", 22021 bibdate = "Tue Mar 25 13:26:09 MST 1997", 22022 bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Compiler/garbage.collection.bib", 22023 note = "See corrigendum \cite{Gries:1978:CEP}.", 22024 acknowledgement = ack-nhfb, 22025 classcodes = "C4240 (Programming and algorithm theory)", 22026 corpsource = "Cornell Univ., Ithaca, NY, USA", 22027 keywords = "correct; garbage collector; parallel processing; parallel programs; programming theory; proving; storage management", 22028 treatment = "T Theoretical or Mathematical", 22029 } 22030 22031 @Article{Grief:1977:LFP, 22032 author = "Irene Grief", 22033 title = "A language for formal problem specification", 22034 journal = j-CACM, 22035 volume = "20", 22036 number = "12", 22037 pages = "931--935", 22038 month = dec, 22039 year = "1977", 22040 CODEN = "CACMA2", 22041 ISSN = "0001-0782", 22042 bibdate = "Tue Mar 25 13:26:09 MST 1997", 22043 bibsource = "Compendex database", 22044 abstract = "A language for specifying the intended behavior of communicating parallel processes is described. The specifications are constraints on the order in which events of a computation can occur. The language is used to write specifications of the readers\slash writers problem and the writer priority of the second readers\slash writers problem.", 22045 acknowledgement = ack-nhfb, 22046 classcodes = "C4210 (Formal logic); C4240 (Programming and algorithm theory)", 22047 classification = "723", 22048 corpsource = "Univ. of Washington, Seattle, WA, USA", 22049 journalabr = "Commun ACM", 22050 keywords = "communicating; computer programming languages; constraints; formal languages; formal problem specification; language; parallel processes; parallel processing; readers/writers problem; writer priority", 22051 treatment = "T Theoretical or Mathematical", 22052 xxauthor = "Irene Greif", 22053 } 22054 22055 @Article{Abrams:1977:MIC, 22056 author = "Marshall D. Abrams and Siegfried Treu", 22057 title = "A Methodology for Interactive Computer Service Measurement", 22058 journal = j-CACM, 22059 volume = "20", 22060 number = "12", 22061 pages = "936--944", 22062 month = dec, 22063 year = "1977", 22064 CODEN = "CACMA2", 22065 ISSN = "0001-0782", 22066 bibdate = "Tue Mar 25 13:26:09 MST 1997", 22067 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1977.bib", 22068 abstract = "A measurement methodology applicable to in teractive computer service is described. Its primary purpose is to enable external, user-oriented assessment of computer performance, instead of the more frequently used in ternal system measurement techniques. \par The NBS Network Measurement System is employed as the external measurement tool. Example data have been collected and analyzed. A demonstration of the methodology, leading to a pragmatic figure-of-merit evaluation of results, is included.", 22069 acknowledgement = ack-nhfb, 22070 annote = "A measurement methodology applicable to interactive computer service is described. Its primary purpose is to enable external, user-oriented assessment of computer performance, instead of the more frequently used internal system measurement techniques. The NBS Network Measurement System is employed as the external measurement tool. Example data have been collected and analyzed. A demonstration of the methodology, leading to a pragmatic figure-of\ldots.", 22071 classcodes = "C6150G (Diagnostic, testing, debugging and evaluating systems)", 22072 classification = "722; 723", 22073 corpsource = "Nat. Bur. of Stand., Washington, DC, USA", 22074 country = "USA", 22075 descriptors = "Man-machine interaction; performance measure; measurement; method; survey;", 22076 enum = "5", 22077 journalabr = "Commun ACM", 22078 keywords = "computer selection and evaluation; computer service; computer systems, digital; external; external measurement; figure-of-merit.; in teractive system; interactive; interactive computer systems; measurement; measurement model; measures; methodology; network measurement system; performance", 22079 language = "English", 22080 references = "24", 22081 treatment = "T Theoretical or Mathematical", 22082 } 22083 22084 @Article{Danziger:1977:CIA, 22085 author = "J. N. Danziger and W. H. Dutton", 22086 title = "Computers as an innovation in {American} local governments", 22087 journal = j-CACM, 22088 volume = "20", 22089 number = "12", 22090 pages = "945--956", 22091 month = dec, 22092 year = "1977", 22093 CODEN = "CACMA2", 22094 ISSN = "0001-0782", 22095 bibdate = "Tue Mar 25 13:26:09 MST 1997", 22096 acknowledgement = ack-nhfb, 22097 classcodes = "C0230 (Economic, social and political aspects of computing); C7130 (Public administration)", 22098 corpsource = "Univ. of California, Irvine, CA, USA", 22099 keywords = "American local governments; applications; computer technology; EDP; financial support; government data processing; innovation; social aspects of automation", 22100 treatment = "G General Review", 22101 } 22102 22103 @Article{Summers:1977:MLP, 22104 author = "P. D. Summers", 22105 title = "A Methodology for {LISP} Program Construction from Examples", 22106 journal = j-CACM, 22107 volume = "24", 22108 number = "1", 22109 pages = "161--175", 22110 month = jan, 22111 year = "1977", 22112 CODEN = "CACMA2", 22113 ISSN = "0001-0782", 22114 bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Ai/lisp.bib", 22115 keywords = "LISP", 22116 } 22117 22118 @Article{Lavington:1978:MMA, 22119 author = "S. H. Lavington", 22120 title = "The {Manchester Mark I} and {Atlas}: a historical perspective", 22121 journal = j-CACM, 22122 volume = "21", 22123 number = "1", 22124 pages = "4--12", 22125 month = jan, 22126 year = "1978", 22127 CODEN = "CACMA2", 22128 ISSN = "0001-0782", 22129 bibdate = "Tue Mar 25 13:26:09 MST 1997", 22130 acknowledgement = ack-nhfb, 22131 classcodes = "C5220 (Computer architecture); C6150J (Operating systems)", 22132 corpsource = "Univ. of Manchester, Manchester, UK", 22133 keywords = "(computers); address generation; computer architecture; computer software; operating systems; store management", 22134 treatment = "P Practical", 22135 } 22136 22137 @Article{Ibbett:1978:DMC, 22138 author = "R. N. Ibbett and P. C. Capon", 22139 title = "The development of the {MU5} computer system", 22140 journal = j-CACM, 22141 volume = "21", 22142 number = "1", 22143 pages = "13--24", 22144 month = jan, 22145 year = "1978", 22146 CODEN = "CACMA2", 22147 ISSN = "0001-0782", 22148 bibdate = "Tue Mar 25 13:26:09 MST 1997", 22149 bibsource = "Compendex database", 22150 abstract = "Following a brief outline of the background of the MU5 project, the aims and ideas for MU5 are discussed. A description is then given of the instruction set, which includes a number of features conducive to the production of efficient compiled code from high-level language source programs. The design of the processor is then traced from the initial ideas for an associatively addressed ``name store'' to the final multistage pipeline structure involving a prediction mechanism for instruction prefetching and a function queue for array element accessing. An overall view of the complete MU5 complex is presented together with a brief indication of its performance.", 22151 acknowledgement = ack-nhfb, 22152 classcodes = "C5220 (Computer architecture); C5420 (Mainframes and minicomputers); C6150J (Operating systems)", 22153 classification = "722; 723", 22154 corpsource = "Univ. of Manchester, Manchester, UK", 22155 journalabr = "Commun ACM", 22156 keywords = "architecture; code; computer; computer architecture; computer systems, digital; function queue; instruction prefetching; instruction set; MU5; name store; operating systems (computers); pipeline processing; pipeline structure", 22157 treatment = "P Practical", 22158 } 22159 22160 @Article{Borgerson:1978:ESU, 22161 author = "B. R. Borgerson and M. L. Hanson and P. A. Hartley", 22162 title = "Evolution of the {Sperry Univac 1100 Series}: a History, Analysis, and Projection", 22163 journal = j-CACM, 22164 volume = "21", 22165 number = "1", 22166 pages = "25--43", 22167 month = jan, 22168 year = "1978", 22169 CODEN = "CACMA2", 22170 ISSN = "0001-0782", 22171 bibdate = "Tue Mar 25 13:26:09 MST 1997", 22172 bibsource = "Compendex database", 22173 abstract = "The 1100 series systems are Sperry Univac's large-scale mainframe computer systems. Beginning with the 1107 in 1962, the 1100 series has progressed through a succession of eight compatible computer models to the latest system, the 1100\slash 80, introduced in 1977. The 1100 series hardware architecture is based on a 36-bit word, ones complement structure which obtains one operand from storage and one from a high-speed register, or two operands from high-speed registers. The 1100 Operating System is designed to support a symmetrical multiprocessor configuration simultaneously providing multiprogrammed batch, timesharing, and transaction environments.", 22174 acknowledgement = ack-nhfb, 22175 classcodes = "C5220 (Computer architecture); C5420 (Mainframes and minicomputers); C6150J (Operating systems)", 22176 classification = "722; 723", 22177 corpsource = "Sperry Univac, Blue Bell, PA, USA", 22178 journalabr = "Commun ACM", 22179 keywords = "computer architecture; computer systems, digital; hardware architecture; multiprocessing systems; operating; Sperry Univac 1100 series; symmetrical multiprocessor configuration; systems (computers)", 22180 treatment = "P Practical", 22181 } 22182 22183 @Article{Bell:1978:ED, 22184 author = "C. G. Bell and A. Kotok and T. N. Hastings and R. Hill", 22185 title = "The Evolution of the {DECsystem 10}", 22186 journal = j-CACM, 22187 volume = "21", 22188 number = "1", 22189 pages = "44--63", 22190 month = jan, 22191 year = "1978", 22192 CODEN = "CACMA2", 22193 ISSN = "0001-0782", 22194 bibdate = "Tue Mar 25 13:26:09 MST 1997", 22195 bibsource = "Compendex database", 22196 abstract = "The DECsystem 10, also known as the PDP-10, evolved from the PDP-6 (circa 1963) over five generations of implementations to presently include systems covering a price range of five to one. The origin and evolution of the hardware, operating system, and languages are described in terms of technological change, user requirements, and user developments. The PDP-10's contributions to computing technology include: accelerating the transition from batch oriented to time sharing computing systems; transferring hardware technology within DEC (and elsewhere) to minicomputer design and manufacturing; supporting minicomputer hardware and software development; and serving as a model for single user and timeshared interactive minicomputer\slash microcomputer systems.", 22197 acknowledgement = ack-nhfb, 22198 classcodes = "C5220 (Computer architecture); C5420 (Mainframes and minicomputers); C6150J (Operating systems)", 22199 classification = "722; 723", 22200 corpsource = "Digital Equipment Corp., Maynard, MA, USA", 22201 journalabr = "Commun ACM", 22202 keywords = "architecture; computer; computer architecture; computer systems, digital; DECsystem 10; operating system; operating systems (computers); sharing systems; time sharing; time-", 22203 treatment = "P Practical", 22204 } 22205 22206 @Article{Russell:1978:CCS, 22207 author = "Richard M. Russell", 22208 title = "The {CRAY-1} Computer System", 22209 journal = j-CACM, 22210 volume = "21", 22211 number = "1", 22212 pages = "63--72", 22213 month = jan, 22214 year = "1978", 22215 CODEN = "CACMA2", 22216 ISSN = "0001-0782", 22217 bibdate = "Tue Mar 25 13:26:09 MST 1997", 22218 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Parallel/par.misc.bib", 22219 abstract = "This paper describes the CRAY-1, discusses the evolution of its architecture, and gives an account of some of the problems that were overcome during its manufacture. The CRAY-1 is the only computer to have been built to date that satisfies ERDA's Class VI requirement (a computer capable of processing from 20 to 60 million floating point operations per second) [1]. The CRAY-1's Fortran compiler (CFT) is designed to give the scientific user immediate access to the benefits of the CRAY-1's vector processing architecture. An optimizing compiler, CFT, ``vectorizes'' innermost DO loops. Compatible with the ANSI 1966 Fortran Standard and with many commonly supported Fortran extensions, CFT does not require any source program modifications or the use of additional nonstandard Fortran statements to achieve vectorization. \par Thus the user's investment of hundreds of man months of effort to develop Fortran programs for other contemporary computers is protected.", 22220 acknowledgement = ack-nhfb, 22221 annote = "The original paper describing the Cray-1. This paper is reproduced in Kuhn and Padua's (1981, IEEE) survey ``Tutorial on Parallel Processing.'' Also reproduced in ``Computer Structures: Principles and Examples'' by Daniel P. Siewiorek, C. Gordon Bell, and Allen Newell, McGraw-Hill, 1982, pp. 743-752. Reproduced in Dharma P. Agrawal's (ed.) ``Advanced Computer Architecture,'' IEEE, 1986, pp.15-24. Literature search yields: 00712248 E. I. Monthly No: EI7804023850 E. I. Yearly No: EI78014612 Title: Cray-1 Computer System. Author: Russell, Richard M. Corporate Source: Cray Res Inc, Minneapolis, Minn Source: Communications of the ACM v 21 n 1 Jan 1978 p 63--72 Publication Year: 1978 CODEN: CACMA2 ISSN: 0001-0782 Language: ENGLISH Journal Announcement: 7804 Abstract: The CRAY-1 is described, the evolution of its architecture is discussed, and an account is given of some of the problems that were overcome during its manufacture. The CRAY-1 is the only computer to have been built to date that satisfies ERDA's Class VI requirement (a computer capable of processing from 20 to 60 million floating point operations per second). The CRAY-1's Fortran compiler (CFT) is designed to give the scientific user immediate access to the benefits of the CRAY-1's vector processing architecture. An optimizing compiler, CFT, ``vectorizes'' innermost DO loops. Compatible with the ANSI 1966 Fortran Standard and with many commonly supported Fortran extensions, CFT does not require any source program modifications or the use of additional nonstandard Fortran statements to achieve vectorization. 6 refs. Descriptors: *COMPUTER ARCHITECTURE; COMPUTER SYSTEMS, DIGITAL Classification Codes: 722 (Computer Hardware); 723 (Computer Software) 72 (COMPUTERS \& DATA PROCESSING)", 22222 classcodes = "C5220 (Computer architecture); C5420 (Mainframes and minicomputers); C6150J (Operating systems)", 22223 classification = "722; 723", 22224 corpsource = "Cray Res. Inc., Minneapolis, MN, USA", 22225 journalabr = "Commun ACM", 22226 keywords = "architecture; CFT; computer architecture; computer systems; computer systems, digital; CRAY-1 computer system; existing classic architecture; ginsberg biblio: bhibbard enm; grecommended91; implementation; j\-lb; maeder biblio: parallel hardware and devices; operating systems (computers); processing; vector", 22227 treatment = "P Practical", 22228 } 22229 22230 @Article{Case:1978:AIS, 22231 author = "Richard P. Case and Andris Padegs", 22232 title = "Architecture of the {IBM System}\slash 370", 22233 journal = j-CACM, 22234 volume = "21", 22235 number = "1", 22236 pages = "73--96", 22237 month = jan, 22238 year = "1978", 22239 CODEN = "CACMA2", 22240 ISSN = "0001-0782", 22241 bibdate = "Tue Mar 25 13:26:09 MST 1997", 22242 bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/storage.bib", 22243 acknowledgement = ack-nhfb, 22244 classcodes = "C5220 (Computer architecture); C5420 (Mainframes and minicomputers); C6150J (Operating systems)", 22245 corpsource = "IBM Corp., White Plains, NY, USA", 22246 keywords = "Architectures; computer architecture; data manipulation; debugging; design considerations; error handling; input/output operations; instructions; memory hierarchy; monitoring; multiprocessing; operating systems (computers); program control; timing facilities; virtual storage", 22247 treatment = "P Practical", 22248 } 22249 22250 @Article{Mamrak:1978:CSF, 22251 author = "S. A. Mamrak and R. G. {Montanelli, Jr.}", 22252 title = "Computer science faculties: the current status of minorities and women", 22253 journal = j-CACM, 22254 volume = "21", 22255 number = "2", 22256 pages = "115--119", 22257 month = feb, 22258 year = "1978", 22259 CODEN = "CACMA2", 22260 ISSN = "0001-0782", 22261 bibdate = "Tue Mar 25 13:26:09 MST 1997", 22262 acknowledgement = ack-nhfb, 22263 classcodes = "C0220 (Computing education and training)", 22264 corpsource = "Ohio State Univ., Columbus, OH, USA", 22265 keywords = "academic computer science; computer science education; discrimination; minorities; women", 22266 treatment = "G General Review", 22267 } 22268 22269 @Article{Rivest:1978:MOD, 22270 author = "R. L. Rivest and A. Shamir and L. Adelman", 22271 title = "A Method for Obtaining Digital Signatures and Public-Key Cryptosystems", 22272 journal = j-CACM, 22273 volume = "21", 22274 number = "2", 22275 pages = "120--126", 22276 month = feb, 22277 year = "1978", 22278 CODEN = "CACMA2", 22279 ISSN = "0001-0782", 22280 MRclass = "94A05", 22281 MRnumber = "83m:94003", 22282 mrreviewer = "J. L. Selfridge", 22283 bibdate = "Tue Mar 25 13:26:09 MST 1997", 22284 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Theory/ProbAlgs.bib and ftp://ftp.ira.uka.de/pub/bibliography/Database/Graefe.bib and ftp://ftp.ira.uka.de/pub/bibliography/Ai/nonmono.bib", 22285 note = "The basics of trap-door functions and the famous RSA public key cryptosystem are presented in this paper.", 22286 abstract = "An encryption method is presented with the novel property that publicly revealing an encryption key does not thereby reveal the corresponding decryption key. This has two important consequences: (1) Couriers or other secure means are not needed to transmit keys, since a message can be enciphered using an encryption key publicly revealed by the intended recipient. (2) A message can be ``signed'' using a privately held decryption key. Anyone can verify this signature using the corresponding publicly revealed encryption key. Signatures cannot be forged, and a signer cannot later deny the validity of his signature.", 22287 acknowledgement = ack-nhfb, 22288 classcodes = "C6130 (Data handling techniques)", 22289 classification = "723", 22290 corpsource = "Dept. of Math., MIT, Cambridge, MA, USA", 22291 journalabr = "Commun ACM", 22292 keywords = "computer programming; cryptography; cryptosystems; data handling; data processing --- Security of Data; decryption key; digital signatures; encryption key; number theory; operating protection; RSA; security; security of data", 22293 treatment = "T Theoretical or Mathematical", 22294 } 22295 22296 @Article{Auslander:1978:SRR, 22297 author = "M. A. Auslander and H. R. Strong", 22298 title = "Systematic Recursion Removal", 22299 journal = j-CACM, 22300 volume = "21", 22301 number = "2", 22302 pages = "127--134", 22303 month = feb, 22304 year = "1978", 22305 CODEN = "CACMA2", 22306 ISSN = "0001-0782", 22307 bibdate = "Tue Mar 25 13:26:09 MST 1997", 22308 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Compiler/semantics.bib", 22309 abstract = "The recursion removal algorithm presented by Strong and Walker is amplified and applied to a relatively complex PL/I program. The aim is to demonstrate systematic recursion-removal techniques on something more complex than Knuth's ``sturdy toddler'' and to obtain measurements of the cost of procedure linkage in PL/I and the savings achievable via procedure integration in the presence of recursion. First, the paper describes the recursion-removal process and the example on which it will be illustrated. Recursion removal is then applied to the two major parts of this example and the final result of the process is displayed. Our performance comparison results are presented and our conclusions are briefly discussed.", 22310 acknowledgement = ack-nhfb, 22311 classcodes = "C4240 (Programming and algorithm theory); C6140D (High level languages)", 22312 classification = "723", 22313 corpsource = "IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA", 22314 journalabr = "Commun ACM", 22315 keywords = "computer programming; linkage; optimization; PL/1; procedure; procedure integration; procedure linkage; programming theory; recursion elimination; recursion removal; recursion removal algorithm", 22316 treatment = "A Application; T Theoretical or Mathematical", 22317 } 22318 22319 @Article{Kou:1978:CEC, 22320 author = "L. T. Kou and L. J. Stockmeyer and C. K. Wong", 22321 title = "Covering Edges by Cliques with Regard to Keyword Conflicts and Intersection Graphs", 22322 journal = j-CACM, 22323 volume = "21", 22324 number = "2", 22325 pages = "135--139", 22326 month = feb, 22327 year = "1978", 22328 CODEN = "CACMA2", 22329 ISSN = "0001-0782", 22330 MRclass = "68A20 (05C35)", 22331 MRnumber = "57 4620", 22332 mrreviewer = "A. T. Amin", 22333 bibdate = "Tue Mar 25 13:26:09 MST 1997", 22334 bibsource = "Compendex database", 22335 abstract = "E. Kellerman has presented a method for determining keyword conflicts and described a heuristic algorithm which solves a certain combinatorial optimization problem in connection with this method. This optimization problem is shown to be equivalent to the problem of covering the edges of a graph by complete subgraphs with the objective of minimizing the number of complete subgraphs. A relationship between this edge-clique-cover problem and the graph coloring problem is established which allows algorithms for either one of these problems to be constructed from algorithms for the other.", 22336 acknowledgement = ack-nhfb, 22337 classcodes = "C1160 (Combinatorial mathematics); C1180 (Optimisation techniques); C4240 (Programming and algorithm theory)", 22338 classification = "723; 921", 22339 corpsource = "IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA", 22340 journalabr = "Commun ACM", 22341 keywords = "clique cover problem; cliques; combinatorial optimization problem; computational complexity; computer programming; edge; graph colouring; intersection graphs; keyword conflicts; optimisation; optimization", 22342 treatment = "T Theoretical or Mathematical", 22343 } 22344 22345 @Article{Held:1978:BTR, 22346 author = "Gerald Held and Michael Stonebraker", 22347 title = "{B}-Trees Re-Examined", 22348 journal = j-CACM, 22349 volume = "21", 22350 number = "2", 22351 pages = "139--143", 22352 month = feb, 22353 year = "1978", 22354 CODEN = "CACMA2", 22355 ISSN = "0001-0782", 22356 bibdate = "Tue Mar 25 13:26:09 MST 1997", 22357 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib and ftp://ftp.ira.uka.de/pub/bibliography/Database/Graefe.bib", 22358 note = "Also published in/as: UCB, Elec. Res. Lab, No.ERL-M528, July 1975.", 22359 abstract = "The B-tree and its variants have, with increasing frequency, been proposed as a basic storage structure for multiuser database applications. Three potential problems which must be dealt with in such a structure that do not arise in more traditional static directory structures are indicated. One problem is a possible performance penalty.", 22360 acknowledgement = ack-nhfb, 22361 annote = "Static versus dynamic indexes.", 22362 classcodes = "C1160 (Combinatorial mathematics); C6120 (File organisation)", 22363 classification = "723", 22364 corpsource = "Tandem Computers Inc., Capertino, CA, USA", 22365 journalabr = "Commun ACM", 22366 keywords = "data base systems; Ingres ISAM CACM", 22367 keywords = "(mathematics); B-tree; data structures; database; database management systems; directory structures; storage structure; trees", 22368 treatment = "G General Review; T Theoretical or Mathematical", 22369 } 22370 22371 @Article{Stewart:1978:CNT, 22372 author = "William J. Stewart", 22373 title = "A Comparison of Numerical Techniques in {Markov} Modeling", 22374 journal = j-CACM, 22375 volume = "21", 22376 number = "2", 22377 pages = "144--152", 22378 month = feb, 22379 year = "1978", 22380 CODEN = "CACMA2", 22381 ISSN = "0001-0782", 22382 bibdate = "Tue Mar 25 13:26:09 MST 1997", 22383 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1978.bib", 22384 abstract = "Presentation of several numerical methods which may be used to obtain the stationary probability vectors of Markovian models. An example of a nearly decomposable system is considered, and the results obtained by the different methods examined. A post mortem reveals why standard techniques often fail to yield the correct results. Finally, a means of estimating the error inherent in the decomposition of certain models is presented.", 22385 acknowledgement = ack-nhfb, 22386 classcodes = "C1140Z (Other topics in statistics); C1220 (Simulation, modelling and identification); C4110 (Error analysis in numerical methods)", 22387 classification = "912", 22388 corpsource = "Univ. de Rennes, Rennes, France", 22389 country = "USA", 22390 descriptors = "Markov chain; linear equation;", 22391 enum = "7926", 22392 journalabr = "Commun ACM", 22393 keywords = "decomposable system; error analysis; management science; Markov processes; Markovian; methods; modelling; models; numerical; numerical methods; operations research; stationary probability vectors", 22394 language = "English", 22395 references = "0", 22396 treatment = "T Theoretical or Mathematical", 22397 } 22398 22399 @Article{Herman:1978:RMI, 22400 author = "Gabor T. Herman and Arnold Lent and Peter H. Lutz", 22401 title = "Relaxation Methods for Image Reconstruction", 22402 journal = j-CACM, 22403 volume = "21", 22404 number = "2", 22405 pages = "152--158", 22406 month = feb, 22407 year = "1978", 22408 CODEN = "CACMA2", 22409 ISSN = "0001-0782", 22410 MRclass = "68A45 (92A05)", 22411 MRnumber = "58 19419", 22412 mrreviewer = "J. J. Buckley", 22413 bibdate = "Tue Mar 25 13:26:09 MST 1997", 22414 bibsource = "Compendex database", 22415 abstract = "It is shown that, for a consistent system of linear inequalities, any sequence of relaxation parameters lying strictly between 0 and 2 generates a sequence of vectors which converges to a solution. Under the same assumptions, for a system of linear equations, the relaxation method converges to the minimum norm solution. Previously proposed techniques are shown to be special cases of our procedure with different choices of relaxation parameters. The practical consequences for image reconstruction of the choice of the relaxation parameters are discussed. This work is applicable to biomedical engineering and mathematical programming.", 22416 acknowledgement = ack-nhfb, 22417 classcodes = "C1180 (Optimisation techniques); C1260 (Information theory); C4140 (Linear algebra)", 22418 classification = "461; 723; 921", 22419 corpsource = "State Univ. of New York, Buffalo, NY, USA", 22420 journalabr = "Commun ACM", 22421 keywords = "biomedical engineering; convergence of numerical methods; greyness integrals; image processing; image reconstruction; linear inequalities; mathematical programming; method; picture processing; relaxation", 22422 treatment = "T Theoretical or Mathematical", 22423 } 22424 22425 @Article{Manna:1978:SSB, 22426 author = "Zohar Manna and Richard Waldinger", 22427 title = "Is `Sometime' Sometimes Better Than `Always'? (Intermittent Assertions in Proving Program Correctness)", 22428 journal = j-CACM, 22429 volume = "21", 22430 number = "2", 22431 pages = "159--172", 22432 month = feb, 22433 year = "1978", 22434 CODEN = "CACMA2", 22435 ISSN = "0001-0782", 22436 MRclass = "68A05", 22437 MRnumber = "58 3630", 22438 mrreviewer = "Franco Sirovich", 22439 bibdate = "Tue Mar 25 13:26:09 MST 1997", 22440 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Compiler/semantics.bib", 22441 abstract = "This paper explores a technique for proving the correctness and termination of programs simultaneously. \par This approach, the intermittent-assertion method, involves documenting the program with assertions that must be true at some time when control passes through the corresponding point, but that need not be true every time. The method, introduced by Burstall, promises to provide a valuable complement to the more conventional methods. The intermittent-assertion method is presented with a number of examples of correctness and termination proofs. Some of these proofs are markedly simpler than their conventional counterparts. \par On the other hand, it is shown that a proof of correctness or termination by any of the conventional techniques can be rephrased directly as a proof using intermittent assertions. Finally, it is shown how the intermittent-assertion method can be applied to prove the validity of program transformations and the correctness of continuously operating programs.", 22442 acknowledgement = ack-nhfb, 22443 classcodes = "C4240 (Programming and algorithm theory)", 22444 classification = "723", 22445 corpsource = "Stanford Univ., Stanford, CA, USA", 22446 journalabr = "Commun ACM", 22447 keywords = "computer programming languages; continuously operating programs.; correctness of programs; intermittent assertions; program transformation; program verification; termination of programs", 22448 keywords = "assertions; continuously operating programs; intermittent-assertion method; program; program correctness; programming theory; termination proofs; transformations", 22449 treatment = "T Theoretical or Mathematical", 22450 } 22451 22452 @Article{Schachter:1978:SNM, 22453 author = "Bruce J. Schachter and Azriel Rosenfeld", 22454 title = "Some New Methods of Detecting Step Edges in Digital Pictures", 22455 journal = j-CACM, 22456 volume = "21", 22457 number = "2", 22458 pages = "172--176", 22459 month = feb, 22460 year = "1978", 22461 CODEN = "CACMA2", 22462 ISSN = "0001-0782", 22463 bibdate = "Tue Mar 25 13:26:09 MST 1997", 22464 bibsource = "Compendex database", 22465 abstract = "Description of two operators that respond to step edges, but not to ramps. The first is similar to the digital Laplacian, but uses the max, rather than the sum, of the x and y second differences. The second uses the difference between the mean and median gray levels in a neighborhood. The outputs obtained from these operators applied to a set of test pictures are compared with each other and with the standard digital Laplacian and gradient. A third operator, which uses the distance between the center and centroid of a neighborhood as an edge value, is also briefly considered; it turns out to be equivalent to one of the standard digital approximations to the gradient.", 22466 acknowledgement = ack-nhfb, 22467 classcodes = "B6140C (Optical information, image and video signal processing); C1250 (Pattern recognition); C1260 (Information theory); C6130B (Graphics techniques)", 22468 classification = "723", 22469 corpsource = "Univ. of Maryland, College Park, MD, USA", 22470 journalabr = "Commun ACM", 22471 keywords = "computer graphics; digital; digital pictures; edge detection; gray levels; image processing; Laplacian; pattern recognition; picture processing; step edges", 22472 treatment = "A Application; T Theoretical or Mathematical", 22473 } 22474 22475 @Article{Rabin:1978:CCC, 22476 author = "Michael O. Rabin", 22477 title = "Corrigendum: {``Complexity of computations''}", 22478 journal = j-CACM, 22479 volume = "21", 22480 number = "3", 22481 month = mar, 22482 year = "1978", 22483 CODEN = "CACMA2", 22484 ISSN = "0001-0782", 22485 MRclass = "231.68A20", 22486 MRnumber = "57 8156", 22487 bibdate = "Tue Dec 26 13:35:07 1995", 22488 note = "See \cite{Rabin:1977:CC}.", 22489 acknowledgement = ack-nhfb, 22490 } 22491 22492 @Article{Lucas:1978:UII, 22493 author = "Henry C. {Lucas, Jr.}", 22494 title = "Use of an Interactive Information Storage and Retrieval System in Medical Research", 22495 journal = j-CACM, 22496 volume = "21", 22497 number = "3", 22498 pages = "197--205", 22499 month = mar, 22500 year = "1978", 22501 CODEN = "CACMA2", 22502 ISSN = "0001-0782", 22503 bibdate = "Tue Mar 25 13:26:09 MST 1997", 22504 bibsource = "Compendex database", 22505 abstract = "Results of a study of the use of an interactive computerized storage and retrieval system. A monitor built into the computer system provided usage data for the study. Additional data on user reactions were gathered from a questionnaire. The results show the important role played by frequently chosen laboratory reference leaders in influencing the use of this system. The implications of the study for the design of similar systems are discussed.", 22506 acknowledgement = ack-nhfb, 22507 classcodes = "C7220 (Generation, dissemination, and use of information); C7250 (Information storage and retrieval); C7330 (Biology and medical computing)", 22508 classification = "723; 901", 22509 corpsource = "New York Univ., New York, NY, USA", 22510 journalabr = "Commun ACM", 22511 keywords = "computing; information retrieval system; information retrieval systems; information storage; information use; interactive; laboratory reference leaders; medical; medical research; monitor; use; user reactions", 22512 treatment = "A Application; P Practical", 22513 } 22514 22515 @Article{Dutton:1978:MUC, 22516 author = "William H. Dutton and Kenneth L. Kraemer", 22517 title = "Management Utilization of Computers in {American} Local Governments", 22518 journal = j-CACM, 22519 volume = "21", 22520 number = "3", 22521 pages = "206--218", 22522 month = mar, 22523 year = "1978", 22524 CODEN = "CACMA2", 22525 ISSN = "0001-0782", 22526 bibdate = "Tue Mar 25 13:26:09 MST 1997", 22527 bibsource = "Compendex database", 22528 abstract = "Traditional concepts of management information systems (MIS) bear little relation to the information systems currently in use by top management in most US local governments. What exists is management-oriented computing, involving the use of relatively unsophisticated applications. Despite the unsophisticated nature of these systems, management use of computing is surprisingly common, but also varied in its extent among local governments. Management computing is most prevalent in those governments with professional management practices where top management is supportive of computing and tends to control computing decisions and where department users have less control over design and implementation activities. Finally, management computing clearly has impacts for top managers, mostly involving improvements in decision information.", 22529 acknowledgement = ack-nhfb, 22530 classcodes = "C0230 (Economic, social and political aspects of computing); C7130 (Public administration)", 22531 classification = "723; 901; 912; 922", 22532 corpsource = "Public Policy Res. Organization, Univ. of California, Irvine, CA, USA", 22533 journalabr = "Commun ACM", 22534 keywords = "concepts; decision information; decision theory and analysis; government data processing; information retrieval systems; local governments; management information systems; management practices; management science; management use of computing; professional; social aspects of automation; top management; US", 22535 treatment = "G General Review; P Practical", 22536 } 22537 22538 @Article{Anderson:1978:VOC, 22539 author = "R. E. Anderson", 22540 title = "Value orientation of computer science students", 22541 journal = j-CACM, 22542 volume = "21", 22543 number = "3", 22544 pages = "219--225", 22545 month = mar, 22546 year = "1978", 22547 CODEN = "CACMA2", 22548 ISSN = "0001-0782", 22549 bibdate = "Tue Mar 25 13:26:09 MST 1997", 22550 acknowledgement = ack-nhfb, 22551 classcodes = "C0220 (Computing education and training); C0230 (Economic, social and political aspects of computing)", 22552 corpsource = "Univ. of Minnesota, Minneapolis, MN, USA", 22553 keywords = "computer science education; computer science students; social aspects of automation; social science; students; value structures", 22554 treatment = "G General Review", 22555 } 22556 22557 @Article{Kosaraju:1978:IDO, 22558 author = "S. Rao Kosaraju", 22559 title = "Insertions and Deletions in One-Sided Height-Balanced Trees", 22560 journal = j-CACM, 22561 volume = "21", 22562 number = "3", 22563 pages = "226--227", 22564 month = mar, 22565 year = "1978", 22566 CODEN = "CACMA2", 22567 ISSN = "0001-0782", 22568 MRclass = "68A10", 22569 MRnumber = "57 18210", 22570 mrreviewer = "Fabrizio Luccio", 22571 bibdate = "Tue Mar 25 13:26:09 MST 1997", 22572 bibsource = "Compendex database", 22573 abstract = "D. S. Hischberg has established that insertions into one-sided height-balanced trees can be done in O(log**2N) steps. It is proved that deletions can also be performed in O(log**2N) steps, which answers the open problem posed by D. S. Hirschberg.", 22574 acknowledgement = ack-nhfb, 22575 classcodes = "C4240 (Programming and algorithm theory); C6110 (Systems analysis and programming)", 22576 classification = "723", 22577 corpsource = "Johns Hopkins Univ., Baltimore, MD, USA", 22578 journalabr = "Commun ACM", 22579 keywords = "AVL trees; balanced trees; binary search; computer programming; dynamic balancing", 22580 keywords = "deletions; insertions; one sided height balanced trees; programming theory; trees (mathematics)", 22581 treatment = "T Theoretical or Mathematical", 22582 } 22583 22584 @Article{DeMillo:1978:PAP, 22585 author = "Richard A. DeMillo and Stanley C. Eisenstat and Richard J. Lipton", 22586 title = "Preserving Average Proximity in Arrays", 22587 journal = j-CACM, 22588 volume = "21", 22589 number = "3", 22590 pages = "228--231", 22591 month = mar, 22592 year = "1978", 22593 CODEN = "CACMA2", 22594 ISSN = "0001-0782", 22595 MRclass = "68A50", 22596 MRnumber = "57 8217", 22597 mrreviewer = "Dorothy Bollman", 22598 bibdate = "Tue Mar 25 13:26:09 MST 1997", 22599 bibsource = "Compendex database", 22600 abstract = "Programmers and data structure designers are often forced to choose between alternative structures. \par In storing these structures, preserving logical adjacencies or ``proximity'' is usually an important consideration. \par The combinatorial problem of storing arrays as various kinds of list structures is examined. Embeddings of graphs are used to model the loss of proximity involved in such storage schemes, and an elementary proof that arrays cannot be stored as linear lists with bounded loss of proximity is presented. Average loss of proximity is then considered, and it is shown that arrays cannot be stored as linear lists with only bounded loss of average proximity, but can be so stored in binary trees. The former result implies, for instance, that row major order is an asymptotically optimal storage strategy for arrays.", 22601 acknowledgement = ack-nhfb, 22602 classcodes = "C6120 (File organisation)", 22603 classification = "723", 22604 corpsource = "Georgia Inst. of Technol., Atlanta, GA, USA", 22605 journalabr = "Commun ACM", 22606 keywords = "arrays; average proximity; computer programming; data processing; data structure; data structures; graph embedding; linear lists; list structures; logical adjacencies; preserving; proximity; trees", 22607 treatment = "T Theoretical or Mathematical", 22608 } 22609 22610 @Article{Franklin:1978:AVP, 22611 author = "M. A. Franklin and G. Scott Graham and R. K. Gupta", 22612 title = "Anomalies with Variable Partition Paging Algorithms", 22613 journal = j-CACM, 22614 volume = "21", 22615 number = "3", 22616 pages = "232--236", 22617 month = mar, 22618 year = "1978", 22619 CODEN = "CACMA2", 22620 ISSN = "0001-0782", 22621 MRclass = "68A50", 22622 MRnumber = "57 14659", 22623 mrreviewer = "Johnson M. Hart", 22624 bibdate = "Tue Mar 25 13:26:09 MST 1997", 22625 bibsource = "Compendex database", 22626 abstract = "Five types of anomalous behavior which may occur in paged virtual memory operating systems are defined. One type of anomaly, for example, concerns the fact that, with certain reference strings and paging algorithms, an increase in mean memory allocation may result in an increase in fault rate. Two paging algorithms, the page fault frequency and working set algorithms, are examined in terms of their anomaly potential, and reference string examples of various anomalies are presented. Two paging algorithm properties, the inclusion property and the generalized inclusion property, are discussed and the anomaly implications of these properties presented.", 22627 acknowledgement = ack-nhfb, 22628 classcodes = "C6120 (File organisation); C6150J (Operating systems)", 22629 classification = "723", 22630 corpsource = "Washington Univ., St. Louis, MO, USA", 22631 journalabr = "Commun ACM", 22632 keywords = "anomalous behaviour; computer operating systems; computer programming --- Subroutines; operating systems (computers); page fault frequency; variable partition paging algorithms; virtual memory operating systems; virtual storage; working set algorithms", 22633 treatment = "T Theoretical or Mathematical", 22634 } 22635 22636 @Article{Tanenbaum:1978:ISP, 22637 author = "Andrew S. Tanenbaum", 22638 title = "Implications of Structured Programming for Machine Architecture", 22639 journal = j-CACM, 22640 volume = "21", 22641 number = "3", 22642 pages = "237--246", 22643 month = mar, 22644 year = "1978", 22645 CODEN = "CACMA2", 22646 ISSN = "0001-0782", 22647 bibdate = "Tue Mar 25 13:26:09 MST 1997", 22648 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Misc/risc.bib", 22649 abstract = "Based on an empirical study of more than 10,000 lines of program text written in a GOTO-less language, a machine architecture specifically designed for structured programs is proposed. Since assignment, CALL, RETURN, and IF statements together account for 93 percent of all executable statements, special care is given to ensure that these statements can be implemented efficiently. A highly compact instruction encoding scheme is presented, which can reduce program size by a factor of 3. Unlike a Huffman code, which utilizes variable length fields, this method uses only fixed length (1-byte) op code and address fields. The most frequent instructions consist of a single 1-byte field. As a consequence, instruction decoding time is minimized, and the machine is efficient with respect to both space and time.", 22650 acknowledgement = ack-nhfb, 22651 classcodes = "C5220 (Computer architecture); C6110 (Systems analysis and programming)", 22652 classification = "723", 22653 corpsource = "Vrije Univ., Amsterdam, Netherlands", 22654 journalabr = "Commun ACM", 22655 keywords = "computer architecture; computer operating systems; computer organization; instruction set design; machine architecture; MIPS RISC reduced restricted instruction set computer architecture pipelining microcoding; program characteristics; structured programming", 22656 treatment = "P Practical", 22657 } 22658 22659 @Article{Payne:1978:OEN, 22660 author = "W. H. Payne and K. L. McMillen", 22661 title = "Orderly Enumeration of Nonsingular Binary Matrices Applied to Text Encryption", 22662 journal = j-CACM, 22663 volume = "21", 22664 number = "4", 22665 pages = "259--263", 22666 month = apr, 22667 year = "1978", 22668 CODEN = "CACMA2", 22669 ISSN = "0001-0782", 22670 MRclass = "68C05", 22671 MRnumber = "80h:68031", 22672 mrreviewer = "P. E. O'Neil", 22673 bibdate = "Tue Mar 25 13:26:09 MST 1997", 22674 bibsource = "Compendex database", 22675 abstract = "Nonsingular binary matrices of order N, i.e., nonsingular over the field left brace 0,1 right brace, and an initial segment of the natural numbers are placed in one-to-one correspondence. Each natural number corresponds to two intermediate vectors. These vectors are mapped into a nonsingular binary matrix. Examples of complete enumeration of all 2 multiplied by 2 and 3 multiplied by 3 nonsingular binary matrices were produced by mapping the intermediate vectors to the matrices. The mapping has application to the Vernam encipherment method using pseudorandom number sequences. A bit string formed from bytes of text of a data encryption key can be used as a representation of a natural number. This natural number is transformed to a nonsingular binary matrix. Key leverage is obtained by using the matrix as a ``seed'' in a shift register sequence pseudorandom number generator.", 22676 acknowledgement = ack-nhfb, 22677 classcodes = "C4140 (Linear algebra); C6130 (Data handling techniques)", 22678 classification = "723", 22679 corpsource = "Washington State Univ., Pullman, WA, USA", 22680 journalabr = "Commun ACM", 22681 keywords = "binary sequences; bit string; computer programming; data encryption key; encoding; enumeration; mapped; matrix algebra; natural number; nonsingular binary matrices; pseudorandom number; sequences; text editing; text encryption; Vernam encipherment method", 22682 treatment = "A Application; T Theoretical or Mathematical", 22683 } 22684 22685 @Article{Heckel:1978:TID, 22686 author = "Paul Heckel", 22687 title = "A Technique for Isolating Differences Between Files", 22688 journal = j-CACM, 22689 volume = "21", 22690 number = "4", 22691 pages = "264--268", 22692 month = apr, 22693 year = "1978", 22694 CODEN = "CACMA2", 22695 ISSN = "0001-0782", 22696 bibdate = "Tue Mar 25 13:26:09 MST 1997", 22697 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Misc/scm.bib", 22698 abstract = "A simple algorithm is described for isolating the differences between two files. One application is the comparing of two versions of a source program or other file in order to display all differences. The algorithm isolates differences in a way that corresponds closely to our intuitive notion of difference, is easy to implement, and is computationally efficient, with time linear in the file length. For most applications the algorithm isolates differences similar to those isolated by the longest common subsequence. Another application of this algorithm merges files containing independently generated changes into a single file. The algorithm can also be used to generate efficient encodings of a file in the form of the differences between itself and a given ``datum'' file, permitting reconstruction of the original file from the difference and datum files.", 22699 acknowledgement = ack-nhfb, 22700 classcodes = "C6120 (File organisation)", 22701 classification = "723", 22702 corpsource = "Interactive Systems Consultants, Palo Alto, CA, USA", 22703 journalabr = "Commun ACM", 22704 keywords = "computer programming; delta storage; encodings; file organisation; files; independently generated changes; isolating differences; longest common; merges; source program; subsequence; text editing", 22705 treatment = "T Theoretical or Mathematical", 22706 } 22707 22708 @Article{Lew:1978:OCE, 22709 author = "Art Lew", 22710 title = "Optimal Conversion of Extended-Entry Decision Tables with General Cost Criteria", 22711 journal = j-CACM, 22712 volume = "21", 22713 number = "4", 22714 pages = "269--279", 22715 month = apr, 22716 year = "1978", 22717 CODEN = "CACMA2", 22718 ISSN = "0001-0782", 22719 MRclass = "68C05 (49C20)", 22720 MRnumber = "80a:68032", 22721 mrreviewer = "C. L. Liu", 22722 bibdate = "Tue Mar 25 13:26:09 MST 1997", 22723 bibsource = "Compendex database", 22724 abstract = "A general dynamic programming algorithm for converting limited extended, or mixed entry decision tables to optimal decision trees is presented which can take into account rule frequencies or probabilities, minimum time and\slash or space cost criteria, common action sets, compressed rules and ELSE rules, sequencing constraints on condition tests, excludable combinations of conditions, certain ambiguities, and interrupted rule masking.", 22725 acknowledgement = ack-nhfb, 22726 classcodes = "C6110 (Systems analysis and programming)", 22727 classification = "723", 22728 corpsource = "Univ. of Hawaii, Honolulu, HI, USA", 22729 journalabr = "Commun ACM", 22730 keywords = "common action sets; compressed; computer programming; condition tests; conversion; decision tables; ELSE rules; entry decision tables; extended entry decision tables; frequencies; general cost criteria; interrupted rule masking; minimum time; mixed; optimal decision trees; rule; rules; sequencing constraints", 22731 treatment = "T Theoretical or Mathematical", 22732 } 22733 22734 @Article{Baker:1978:LPR, 22735 author = "Henry G. {Baker, Jr.}", 22736 title = "List Processing in Real Time on a Serial Computer", 22737 journal = j-CACM, 22738 volume = "21", 22739 number = "4", 22740 pages = "280--294", 22741 month = apr, 22742 year = "1978", 22743 CODEN = "CACMA2", 22744 ISSN = "0001-0782", 22745 bibdate = "Tue Mar 25 13:26:09 MST 1997", 22746 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Compiler/semantics.bib", 22747 note = "Originally appeared as MIT Artificial Intelligence Laboratory Working Paper No. 39, February 1977", 22748 abstract = "A real-time list processing system is one in which the time required by the elementary list operations (e.g. CONS CAR, CDR, RPLACA, RPLACD, EQ, and ATOM in LISP) is bounded by a (small) constant. Classical implementations of list processing systems lack this property because allocating a list cell from the heap may cause a garbage collection, which process requires time proportional to the heap size to finish. A real-time list processing system is presented which continuously reclaims garbage, including directed cycles, while linearizing and compacting the accessible cells into contiguous locations to avoid fragmenting the free storage pool.", 22749 acknowledgement = ack-nhfb, 22750 classcodes = "C6120 (File organisation); C6130 (Data handling techniques)", 22751 classification = "723", 22752 corpsource = "MIT, Cambridge, MA, USA", 22753 journalabr = "Commun ACM", 22754 keywords = "collection; computer programming; data processing; garbage; list processing; list processing system; real time; serial computer; storage management", 22755 treatment = "T Theoretical or Mathematical", 22756 } 22757 22758 @Article{Merkle:1978:SCI, 22759 author = "Ralph C. Merkle", 22760 title = "Secure Communications Over Insecure Channels", 22761 journal = j-CACM, 22762 volume = "21", 22763 number = "4", 22764 pages = "294--299", 22765 month = apr, 22766 year = "1978", 22767 CODEN = "CACMA2", 22768 ISSN = "0001-0782", 22769 bibdate = "Tue Mar 25 13:26:09 MST 1997", 22770 bibsource = "Compendex database", 22771 abstract = "According to traditional conceptions of cryptographic security, it is necessary to transmit a key, by secret means, before encrypted messages can be sent securely. This paper shows that it is possible to select a key over open communications channels in such a fashion that communications security can be maintained. A method is described which forces any enemy to expend an amount of work which increases as the square of the work required of the two communicants to select the key. The method provides a logically new kind of protection against the passive eaves dropper. It suggests that further research on this topic will be highly rewarding, both in a theoretical and a practical sense.", 22772 acknowledgement = ack-nhfb, 22773 classcodes = "C5600 (Data communication equipment and techniques); C6130 (Data handling techniques)", 22774 classification = "723", 22775 corpsource = "Dept. of Electrical Engng. and Computer Sci., Univ. of California, Berkeley, CA, USA", 22776 journalabr = "Commun ACM", 22777 keywords = "communications channels; communications security; computer network security; cryptographic security; cryptography; cryptology; data communication systems; data processing; insecure channels; key distribution; open; passive eavesdropper; passive eavesdropping; protection; public key cryptosystem; Security; security of data; wiretap", 22778 treatment = "T Theoretical or Mathematical", 22779 } 22780 22781 @Article{Szymanski:1978:ACM, 22782 author = "Thomas G. Szymanski", 22783 title = "Assembling Code for machines with Span-Dependent Instructions", 22784 journal = j-CACM, 22785 volume = "21", 22786 number = "4", 22787 pages = "300--308", 22788 month = apr, 22789 year = "1978", 22790 CODEN = "CACMA2", 22791 ISSN = "0001-0782", 22792 MRclass = "68B05 (68C05)", 22793 MRnumber = "82g:68015", 22794 mrreviewer = "R. K. Shyamasundar", 22795 bibdate = "Tue Mar 25 13:26:09 MST 1997", 22796 bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Compiler/Compiler.Lins.bib", 22797 acknowledgement = ack-nhfb, 22798 classcodes = "C4240 (Programming and algorithm theory); C6150C (Compilers, interpreters and other processors)", 22799 corpsource = "Princeton Univ., Princeton, NJ, USA", 22800 keywords = "code assembling; computational complexity; instructions; lengths of programs; program assemblers; programming; span dependent; theory", 22801 treatment = "T Theoretical or Mathematical", 22802 } 22803 22804 @Article{Vuillemin:1978:DSM, 22805 author = "Jean Vuillemin", 22806 title = "A Data Structure for Manipulating Priority Queues", 22807 journal = j-CACM, 22808 volume = "21", 22809 number = "4", 22810 pages = "309--315", 22811 month = apr, 22812 year = "1978", 22813 CODEN = "CACMA2", 22814 ISSN = "0001-0782", 22815 MRclass = "68A10", 22816 MRnumber = "57 18215", 22817 mrreviewer = "Bernard H. Rosman", 22818 bibdate = "Tue Mar 25 13:26:09 MST 1997", 22819 bibsource = "Compendex database", 22820 abstract = "A data structure is described which can be used for representing a collection of priority queues. The primitive operations are insertion, deletion, union, update, and search for an item of earliest priority.", 22821 acknowledgement = ack-nhfb, 22822 classcodes = "C6120 (File organisation)", 22823 classification = "723", 22824 corpsource = "Univ. de Paris-Sud, Orsay, France", 22825 journalabr = "Commun ACM", 22826 keywords = "computer programming; data structure; data structures; deletion; earliest priority; insertion; manipulating priority queues; operations; primitive; search; union; update", 22827 treatment = "T Theoretical or Mathematical", 22828 } 22829 22830 @Article{Even:1978:EEC, 22831 author = "S. Even and M. Rodeh", 22832 title = "Economical Encoding of Commas Between Strings", 22833 journal = j-CACM, 22834 volume = "21", 22835 number = "4", 22836 pages = "315--317", 22837 month = apr, 22838 year = "1978", 22839 CODEN = "CACMA2", 22840 ISSN = "0001-0782", 22841 MRclass = "68A10", 22842 MRnumber = "58 3648", 22843 mrreviewer = "John Cherniavsky", 22844 bibdate = "Tue Mar 25 13:26:09 MST 1997", 22845 acknowledgement = ack-nhfb, 22846 classcodes = "C6130 (Data handling techniques)", 22847 corpsource = "Israel Inst. of Technol., Haifa, Israel", 22848 keywords = "commas; data handling; delimiters; encoding; extra cost; strings", 22849 treatment = "T Theoretical or Mathematical", 22850 } 22851 22852 @Article{Cheng:1978:GBV, 22853 author = "R. C. H. Cheng", 22854 title = "Generating beta variates with nonintegral shape parameters", 22855 journal = j-CACM, 22856 volume = "21", 22857 number = "4", 22858 pages = "317--322", 22859 month = apr, 22860 year = "1978", 22861 CODEN = "CACMA2", 22862 ISSN = "0001-0782", 22863 MRclass = "65C10", 22864 MRnumber = "58 13609", 22865 mrreviewer = "George Marsaglia", 22866 bibdate = "Tue Mar 25 13:26:09 MST 1997", 22867 bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD.bib", 22868 acknowledgement = ack-nhfb, 22869 classcodes = "C7310 (Mathematics computing)", 22870 corpsource = "Univ. of Wales Inst. of Sci. and Technol., Cardiff, UK", 22871 country = "USA", 22872 descriptors = "RVG;", 22873 enum = "7128", 22874 keywords = "beta variates; computer timings; generating; method; nonintegral shape parameters; random number generation; random numbers; rejection; simplicity; speed; statistics", 22875 language = "English", 22876 location = "SEL: Wi", 22877 references = "0", 22878 revision = "16/01/94", 22879 treatment = "T Theoretical or Mathematical", 22880 } 22881 22882 @Article{Clark:1978:FAC, 22883 author = "Douglas W. Clark", 22884 title = "A Fast Algorithm for Copying List Structures", 22885 journal = j-CACM, 22886 volume = "21", 22887 number = "5", 22888 pages = "351--357", 22889 month = may, 22890 year = "1978", 22891 CODEN = "CACMA2", 22892 ISSN = "0001-0782", 22893 bibdate = "Tue Mar 25 13:26:09 MST 1997", 22894 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Compiler/garbage.collection.bib", 22895 abstract = "An algorithm is presented for copying an arbitrarily linked list structure into a block of contiguous storage locations without destroying the original list. Apart from a fixed number of program variables, no auxiliary storage, such as a stack, is used. The algorithm needs no mark bits and operates in linear time. It is shown to be significantly faster than Fisher's algorithm, the fastest previous linear-time algorithm for the same problem. Its speed comes mainly from its efficient list-traversal technique, which folds the processing stack into the structure being built, and from its classification of list cells into nine types, which enables processing operations to be optimized for each type.", 22896 acknowledgement = ack-nhfb, 22897 classcodes = "C6130 (Data handling techniques)", 22898 classification = "723", 22899 corpsource = "Xerox Palo Alto Res. Center, Palo Alto, CA, USA", 22900 journalabr = "Commun ACM", 22901 keywords = "arbitrarily linked; classification; computer programming; contiguous storage locations; copying; fast algorithm; linear time; list processing; list structure; list structures; list traversal technique", 22902 treatment = "T Theoretical or Mathematical", 22903 } 22904 22905 @Article{Jones:1978:LEE, 22906 author = "Anita K. Jones and Barbara H. Liskov", 22907 title = "A Language Extension for Expressing Constraints on Data Access", 22908 journal = j-CACM, 22909 volume = "21", 22910 number = "5", 22911 pages = "358--367", 22912 month = may, 22913 year = "1978", 22914 CODEN = "CACMA2", 22915 ISSN = "0001-0782", 22916 bibdate = "Tue Mar 25 13:26:09 MST 1997", 22917 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Theory/obscure.bib", 22918 abstract = "Controlled sharing of information is needed and desirable for many applications and is supported in operating systems by access control mechanisms. This work shows how to extend programming languages to provide controlled sharing. The extension permits expression of access constraints on shared data. Access constraints can apply both to simple objects, and to objects that are components of larger objects, such as bank account records in a bank's data base. The approach can be used to extend any strongly-typed language, but is particularly suitable for extending languages that support the notion of abstract data types.", 22919 acknowledgement = ack-nhfb, 22920 classcodes = "C6120 (File organisation); C6140D (High level languages)", 22921 classification = "723", 22922 corpsource = "Carnegie-Mellon Univ., Pittsburg, PA, USA", 22923 journalabr = "Commun ACM", 22924 keywords = "abstract data types; access control; computer programming languages; constraints; data access; data structures; language extension; mechanisms; programming languages", 22925 treatment = "T Theoretical or Mathematical", 22926 } 22927 22928 @Article{Geller:1978:TDA, 22929 author = "Matthew Geller", 22930 title = "Test Data as an Aid in Proving Program Correctness", 22931 journal = j-CACM, 22932 volume = "21", 22933 number = "5", 22934 pages = "368--375", 22935 month = may, 22936 year = "1978", 22937 CODEN = "CACMA2", 22938 ISSN = "0001-0782", 22939 MRclass = "68A05", 22940 MRnumber = "57 14575", 22941 mrreviewer = "Luigia Aiello", 22942 bibdate = "Tue Mar 25 13:26:09 MST 1997", 22943 bibsource = "Compendex database", 22944 abstract = "Proofs of program correctness tend to be long and tedious, whereas testing, though useful in detecting errors, usually does not guarantee correctness. A technique is introduced whereby test data can be used in proving program correctness. In addition to simplifying the process of proving correctness, this method simplifies the process of providing accurate specification for a program. The applicability of this technique to procedures and recursive programs is demonstrated.", 22945 acknowledgement = ack-nhfb, 22946 classcodes = "C4240 (Programming and algorithm theory); C6150G (Diagnostic, testing, debugging and evaluating systems)", 22947 classification = "723", 22948 corpsource = "Univ. of Michigan, Ann Arbor, MI, USA", 22949 journalabr = "Commun ACM", 22950 keywords = "computer programming; procedures; program testing; programming theory; proving program correctness; recursive programs; specification; test data", 22951 treatment = "T Theoretical or Mathematical", 22952 } 22953 22954 @Article{Low:1978:ADS, 22955 author = "James R. Low", 22956 title = "Automatic Data Structure Selection: an Example and Overview", 22957 journal = j-CACM, 22958 volume = "21", 22959 number = "5", 22960 pages = "376--385", 22961 month = may, 22962 year = "1978", 22963 CODEN = "CACMA2", 22964 ISSN = "0001-0782", 22965 bibdate = "Tue Mar 25 13:26:09 MST 1997", 22966 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Theory/obscure.bib", 22967 abstract = "In the past, programming systems have provided only a single general purpose implementation for an abstract type. Thus the programs produced using abstract types were often inefficient in space or time. A system for automatically choosing efficient implementations for abstract types from a library of implementations for abstract types from a library of implementations is discussed. This process is discussed in detail for an example program. General issues in data structure selection are also reviewed.", 22968 acknowledgement = ack-nhfb, 22969 classcodes = "C6110 (Systems analysis and programming); C6120 (File organisation); C6150C (Compilers, interpreters and other processors)", 22970 classification = "723", 22971 corpsource = "Univ. of Rochester, Rochester, NY, USA", 22972 journalabr = "Commun ACM", 22973 keywords = "abstract data types; automatic programming; automatically; computer programming; data processing --- Data Structures; data structure selection; data structures; lists; program compilers; programs; sets", 22974 treatment = "T Theoretical or Mathematical", 22975 } 22976 22977 @Article{Karr:1978:IUP, 22978 author = "Michael Karr and David B. {Loveman III}", 22979 title = "Incorporation of Units into Programming Languages", 22980 journal = j-CACM, 22981 volume = "21", 22982 number = "5", 22983 pages = "385--391", 22984 month = may, 22985 year = "1978", 22986 CODEN = "CACMA2", 22987 ISSN = "0001-0782", 22988 bibdate = "Tue Mar 25 13:26:09 MST 1997", 22989 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Database/database.bib", 22990 abstract = "The issues of how a programming language might aid in keeping track of physical units (feet, sec, etc. ) are discussed. A method is given for the introduction of relationships among units (a watt is volts *amps, a yard is three feet) and subsequent automatic conversion based upon these relationships. Various proposals for syntax are considered.", 22991 acknowledgement = ack-nhfb, 22992 classcodes = "C6110 (Systems analysis and programming); C6140D (High level languages); C6150C (Compilers, interpreters and other processors)", 22993 classification = "723", 22994 corpsource = "Massachusetts Computer Associates Inc., Wakesfield, MA, USA", 22995 journalabr = "Commun ACM", 22996 keywords = "(measurement); automatic conversion; computer programming languages; physical units; program compilers; programming language; programming languages; relationships among; syntax; units", 22997 treatment = "T Theoretical or Mathematical", 22998 } 22999 23000 @Article{Hanson:1978:SPM, 23001 author = "David R. Hanson and Ralph E. Griswold", 23002 title = "The {SL5} procedure mechanism", 23003 journal = j-CACM, 23004 volume = "21", 23005 number = "5", 23006 pages = "392--400", 23007 month = may, 23008 year = "1978", 23009 CODEN = "CACMA2", 23010 ISSN = "0001-0782", 23011 bibdate = "Tue Mar 25 13:26:09 MST 1997", 23012 bibsource = "Compendex database", 23013 abstract = "Description of an integrated procedure mechanism that permits procedures to be used as recursive functions or as coroutines. This integration is accomplished by treating procedures and their activation records (called environments) as data objects and by decomposing procedure invocation into three separate components at the source-language level. In addition, argument binding is under the control of the programmer, permitting the definition of various methods of argument transmission in the source language itself. The resulting procedure mechanism, which is part of the SL5 programming language, is well suited to goal-oriented problems and to other problems that are more readily programmed by using coroutines. Several examples are given.", 23014 acknowledgement = ack-nhfb, 23015 classcodes = "C6140D (High level languages); C6150C (Compilers, interpreters and other processors)", 23016 classification = "723", 23017 corpsource = "Yale Univ., New Haven, CT, USA", 23018 journalabr = "Commun ACM", 23019 keywords = "activation records; argument binding; argument transmission; computer programming languages; coroutines; procedure invocation; procedure mechanism; program interpreters; programming languages; recursive functions; SL5", 23020 treatment = "T Theoretical or Mathematical", 23021 } 23022 23023 @Article{Hayes-Roth:1978:IMT, 23024 author = "Frederick Hayes-Roth and John McDermott", 23025 title = "An Interference Matching Technique for Inducing Abstractions", 23026 journal = j-CACM, 23027 volume = "21", 23028 number = "5", 23029 pages = "401--411", 23030 month = may, 23031 year = "1978", 23032 CODEN = "CACMA2", 23033 ISSN = "0001-0782", 23034 bibdate = "Tue Mar 25 13:26:09 MST 1997", 23035 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Ai/colt.bib", 23036 abstract = "A method for inducing knowledge by abstraction from a sequence of training examples is described. \par The proposed method, interference matching, induces abstractions by finding relational properties common to two or more exemplars. Three tasks solved by a program that uses an interference-matching algorithm are presented. Several problems concerning the description of the training examples and the adequacy of interference matching are discussed, and directions for future research are considered.", 23037 acknowledgement = ack-nhfb, 23038 classcodes = "C1230 (Artificial intelligence); C6140D (High level languages)", 23039 classification = "723", 23040 corpsource = "Rand Corp., Santa Monica, CA, USA", 23041 journalabr = "Commun ACM", 23042 keywords = "abstraction; abstractions; artificial intelligence; complexity; computer metatheory --- Programming Theory; computer programming; generalization; graph matching; inducing knowledge; induction; informal retrieval; interference; interference matching; knowledge acquisition; knowledge representation; language learning; learning; partial matching; predicate discovery.; programming languages; relational properties; Rule induction; SPROUTER; training examples", 23043 treatment = "T Theoretical or Mathematical", 23044 } 23045 23046 @Article{Fleisher:1978:NSO, 23047 author = "J. M. Fleisher and R. R. Meyer", 23048 title = "New Sufficient Optimality Conditions for Integer Programming and Their Application", 23049 journal = j-CACM, 23050 volume = "21", 23051 number = "5", 23052 pages = "411--418", 23053 month = may, 23054 year = "1978", 23055 CODEN = "CACMA2", 23056 ISSN = "0001-0782", 23057 MRclass = "90C10", 23058 MRnumber = "58 15137", 23059 mrreviewer = "F. Giannessi", 23060 bibdate = "Tue Mar 25 13:26:09 MST 1997", 23061 bibsource = "Compendex database", 23062 abstract = "Report on a new class of sufficient optimality conditions for pure and mixed integer programming problems. Some of the sets of sufficient conditions presented can be thought of as generalizations of optimality conditions based on primal-dual complementarity in linear programming. These sufficient conditions are particularly useful for the construction of difficult integer programming problems with known optimal solutions. These problems may then be used to test and\slash or ``benchmark'' integer programming codes.", 23063 acknowledgement = ack-nhfb, 23064 classcodes = "C1180 (Optimisation techniques); C1290 (Applications of systems theory)", 23065 classification = "723; 921", 23066 corpsource = "Univ. of Wisconsin, Madison, WI, USA", 23067 journalabr = "Commun ACM", 23068 keywords = "integer programming; mathematical programming; sufficient optimality conditions", 23069 treatment = "T Theoretical or Mathematical", 23070 } 23071 23072 @Article{Tadikamalla:1978:CGG, 23073 author = "Pandu R. Tadikamalla", 23074 title = "Computer Generation of Gamma Random Variables", 23075 journal = j-CACM, 23076 volume = "21", 23077 number = "5", 23078 pages = "419--422", 23079 month = may, 23080 year = "1978", 23081 CODEN = "CACMA2", 23082 ISSN = "0001-0782", 23083 MRclass = "65C10", 23084 MRnumber = "58 13614", 23085 mrreviewer = "George Marsaglia", 23086 bibdate = "Tue Mar 25 13:26:09 MST 1997", 23087 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1978.bib", 23088 abstract = "A new method for generating random variables from the gamma distribution with nonintegral shape parameter alpha is proposed. This method is similar to two other methods recently given by N. D. Wallace and G. S. Fishman. It is compared with Fishman's and J. H. Ahrens and U. Dieter's methods. The core storage requirements and programming effort for this method are similar to those of Fishman's method. The proposed method is the same as Fishman's method for 1 less than equivalent to alpha less than 2 and is faster than Fishman's method for 3 less than equivalent to alpha less than equivalent to 19. Also, the proposed method is much simpler than Ahrens and Dieter's method and is faster for alpha less than equivalent to 8.", 23089 acknowledgement = ack-nhfb, 23090 classcodes = "C1140 (Probability and statistics); C7310 (Mathematics computing)", 23091 classification = "723; 922", 23092 corpsource = "Eastern Kentucky Univ., Richmond, KY, USA", 23093 country = "USA", 23094 date = "13/05/93", 23095 descriptors = "RVG;", 23096 enum = "7943", 23097 journalabr = "Commun ACM", 23098 keywords = "computer programming; mathematical statistics --- Random Number Generation", 23099 keywords = "core; gamma distribution; gamma random variables; generating; programming effort; statistics; storage requirements", 23100 language = "English", 23101 references = "0", 23102 treatment = "T Theoretical or Mathematical", 23103 } 23104 23105 @Article{Sites:1978:OSS, 23106 author = "Richard L. Sites", 23107 title = "Optimal Shift Strategy for a Block-Transfer {CCD} Memory", 23108 journal = j-CACM, 23109 volume = "21", 23110 number = "5", 23111 pages = "423--425", 23112 month = may, 23113 year = "1978", 23114 CODEN = "CACMA2", 23115 ISSN = "0001-0782", 23116 bibdate = "Tue Mar 25 13:26:09 MST 1997", 23117 bibsource = "Compendex database", 23118 abstract = "It is shown that the optimal shift strategy for an electronic paging drum with variable but bounded rotation speed is to shift as quickly as possible over most of a cycle, then to shift as slowly as possible over the rest, where the fraction of a cycle to be covered slowly is a function of the square root of the ratio between the maximum and minimum rotation speeds. For a ratio of 100:1, 10\slash 11 of a full cycle should be covered quickly and 1/11 should be covered slowly. As device manufacturers increase this ratio, the average latency for a block transfer will slowly decrease. Increasing the raw shift speed will of course directly reduce both the latency time and the block transfer time.", 23119 acknowledgement = ack-nhfb, 23120 classcodes = "C6120 (File organisation)", 23121 classification = "722", 23122 corpsource = "Univ. of California, San Diego, La Jolla, CA, USA", 23123 journalabr = "Commun ACM", 23124 keywords = "best shift strategy; block transfer CCD memory; charge-coupled device circuits; computer operating systems; critical boundary; hurry up and wait; optimal; paging drum; serial shift registers; storage allocation; strategy", 23125 treatment = "T Theoretical or Mathematical", 23126 } 23127 23128 @Article{Zweben:1978:OMD, 23129 author = "S. H. Zweben and M. A. McDonald", 23130 title = "An Optimal Method for Deletion in One-Sided Height-Balanced Trees", 23131 journal = j-CACM, 23132 volume = "21", 23133 number = "6", 23134 pages = "441--445", 23135 month = jun, 23136 year = "1978", 23137 CODEN = "CACMA2", 23138 ISSN = "0001-0782", 23139 MRclass = "68E10 (68B05 68C25)", 23140 MRnumber = "80k:68054", 23141 mrreviewer = "A. T. Amin", 23142 bibdate = "Tue Mar 25 13:26:09 MST 1997", 23143 bibsource = "Compendex database", 23144 abstract = "A one-sided height-balanced tree is a binary tree in which every mode's right subtree has a height which is equal to or exactly one greater than the height of its left subtree. It has an advantage over the more general AVL tree in that only one bit of balancing information is required (two bits are required for the AVL tree). It is shown that deletion of an arbitrary node of such a tree can be accomplished in O(log n) operations, where n is the number of nodes in the tree. Moreover the method is optimal in the sense that its complexity cannot be reduced in order of magnitude. This result, coupled with earlier results by D. S. Hirschberg, indicates that, of the three basic problems of insertion, deletion, and retrieval, only insertion is adversely affected by this modification of an AVL tree.", 23145 acknowledgement = ack-nhfb, 23146 classcodes = "C4240 (Programming and algorithm theory); C6120 (File organisation)", 23147 classification = "723", 23148 corpsource = "Ohio State Univ., Columbus, OH, USA", 23149 journalabr = "Commun ACM", 23150 keywords = "arbitrary node; binary tree; computer programming; data structures; deletion; one; optimal method; programming theory; sided height balanced trees; trees (mathematics)", 23151 treatment = "T Theoretical or Mathematical", 23152 } 23153 23154 @Article{Driscoll:1978:STA, 23155 author = "James R. Driscoll and Y. Edmund Lien", 23156 title = "A Selective Traversal Algorithm for Binary Search Trees", 23157 journal = j-CACM, 23158 volume = "21", 23159 number = "6", 23160 pages = "445--447", 23161 month = jun, 23162 year = "1978", 23163 CODEN = "CACMA2", 23164 ISSN = "0001-0782", 23165 bibdate = "Tue Mar 25 13:26:09 MST 1997", 23166 bibsource = "Compendex database", 23167 abstract = "The problem of selecting data items from a binary search tree according to a list of range conditions is considered. The process of visiting a minimal number of nodes to retrieve data satisfying the range conditions is called selective traversal. Presented in this paper is an algorithm for selective traversal which uses a tag field for each node in the tree. The algorithm is particularly useful and efficient when examination of data is more time consuming than examination of a tag field.", 23168 acknowledgement = ack-nhfb, 23169 classcodes = "C4240 (Programming and algorithm theory); C6120 (File organisation)", 23170 classification = "723", 23171 corpsource = "Florida Technol. Univ., Orlando, FL, USA", 23172 journalabr = "Commun ACM", 23173 keywords = "binary search tree; binary search trees; computer programming; Data retrieval; data structures; programming theory; range conditions; retrieve; selective traversal; selective traversal algorithm; tag field; tree traversal; trees (mathematics)", 23174 treatment = "T Theoretical or Mathematical", 23175 } 23176 23177 @Article{Cohen:1978:ADP, 23178 author = "Jacques Cohen and Martin S. Roth", 23179 title = "Analyses of Deterministic Parsing Algorithms", 23180 journal = j-CACM, 23181 volume = "21", 23182 number = "6", 23183 pages = "448--458", 23184 month = jun, 23185 year = "1978", 23186 CODEN = "CACMA2", 23187 ISSN = "0001-0782", 23188 MRclass = "68A20", 23189 MRnumber = "58 13920", 23190 mrreviewer = "David B. Benson", 23191 bibdate = "Tue Mar 25 13:26:09 MST 1997", 23192 bibsource = "Compendex database", 23193 abstract = "An approach is presented for determining the minimum, maximum, and average times to parse sentences acceptable by a deterministic parser. These quantities are presented in the form of symbolic formulas, called time-formulas. The variables in these formulas represent not only the length of the input string but also the time to perform elementary operations such as pushing, popping, subscripting, iterating, etc. By binding to the variables actual numerical values corresponding to a given compiler-machine configuration, one can determine the execution time for that configuration. Time-formulas are derived by examining the grammar rules and the program representing the algorithm one wishes to analyze. The approach is described by using a specific grammar that defines simple arithmetic expressions.", 23194 acknowledgement = ack-nhfb, 23195 classcodes = "C4210 (Formal logic); C4240 (Programming and algorithm theory)", 23196 classification = "723", 23197 corpsource = "Brandeis Univ., Waltham, MA, USA", 23198 journalabr = "Commun ACM", 23199 keywords = "algorithm theory; average times; benchmarks; bottom up SLR(1) parser; computer programming languages; deterministic parsing algorithms; estimates; grammars; maximum time; minimum time; PDP 10; recursive descent LL(1) parser; relative efficiencies; top down", 23200 treatment = "T Theoretical or Mathematical", 23201 } 23202 23203 @Article{Mickunas:1978:AER, 23204 author = "M. Dennis Mickunas and John A. Modry", 23205 title = "Automatic Error Recovery for {LR} Parsers", 23206 journal = j-CACM, 23207 volume = "21", 23208 number = "6", 23209 pages = "459--465", 23210 month = jun, 23211 year = "1978", 23212 CODEN = "CACMA2", 23213 ISSN = "0001-0782", 23214 bibdate = "Tue Mar 25 13:26:09 MST 1997", 23215 bibsource = "Compendex database", 23216 abstract = "A scheme is given for detecting and recovering from syntax errors in programs. The scheme, which is based on LR parsing, is driven by information which is directly and automatically obtainable from the information that is already present in an LR parser. The approach, which is patterned after that of Levy and Graham and Rhodes, appears to provide error recovery which is both simple and powerful.", 23217 acknowledgement = ack-nhfb, 23218 classcodes = "C6150G (Diagnostic, testing, debugging and evaluating systems)", 23219 classification = "723", 23220 corpsource = "Univ. of Illinois, Urbana-Champaign, IL, USA", 23221 journalabr = "Commun ACM", 23222 keywords = "automatically; compilers; computer programming languages; detecting; error correction; error recovery; fault tolerant computing; LR parsers; program; syntax errors; system recovery", 23223 treatment = "T Theoretical or Mathematical", 23224 } 23225 23226 @Article{Lientz:1978:CAS, 23227 author = "B. P. Lientz and E. B. Swanson and G. E. Tompkins", 23228 title = "Characteristics of Application Software Maintenance", 23229 journal = j-CACM, 23230 volume = "21", 23231 number = "6", 23232 pages = "466--471", 23233 month = jun, 23234 year = "1978", 23235 CODEN = "CACMA2", 23236 ISSN = "0001-0782", 23237 bibdate = "Tue Mar 25 13:26:09 MST 1997", 23238 bibsource = "Compendex database", 23239 abstract = "Maintenance and enhancement of application software consume a major portion of the total life cycle cost of a system. Rough estimates of the total systems and programming resources consumed range as high as 75-80 percent in each category. However, the area has been given little attention in the literature. To analyze the problems in this area a questionnaire was developed and pretested. It was then submitted to 120 organizations. Respondents totaled 69. Responses were analyzed with the SPSS statistical package. The results of the analysis are examined in detail.", 23240 acknowledgement = ack-nhfb, 23241 classcodes = "C0310 (EDP management); C6110 (Systems analysis and programming)", 23242 classification = "723", 23243 corpsource = "Univ. of California, Los Angeles, CA, USA", 23244 journalabr = "Commun ACM", 23245 keywords = "application software maintenance; characteristics; computer programming; DP management; enhancement; extension; management; programming; resources; systems; user demands", 23246 treatment = "G General Review", 23247 } 23248 23249 @Article{Chrysler:1978:SBD, 23250 author = "Earl Chrysler", 23251 title = "Some Basic Determinants of Computer Programming Productivity", 23252 journal = j-CACM, 23253 volume = "21", 23254 number = "6", 23255 pages = "472--483", 23256 month = jun, 23257 year = "1978", 23258 CODEN = "CACMA2", 23259 ISSN = "0001-0782", 23260 bibdate = "Tue Mar 25 13:26:09 MST 1997", 23261 bibsource = "Compendex database", 23262 abstract = "Examination of the relationship between processing characteristics of programs and experience characteristics of programmers and program development time. The ultimate objective was to develop a technique for predicting the amount of time necessary to create a computer program. The fifteen program characteristics hypothesized as being associated with an increase in programming time required are objectively measurable from preprogramming specifications. The five programmer characteristics are experience-related and are also measurable before a programming task is begun. Nine program characteristics emerged as major influences on program development time, each associated with increased program development time. All five programmer characteristics are found to be related to reduced program development time.", 23263 acknowledgement = ack-nhfb, 23264 classcodes = "C0310 (EDP management); C6110 (Systems analysis and programming)", 23265 classification = "723", 23266 corpsource = "Univ. of Wisconsin, Parkside, WI, USA", 23267 journalabr = "Commun ACM", 23268 keywords = "characteristics; computer programming; computer programming productivity; determinants; DP management; forecasting; predicting; program development time; programmers; programming", 23269 treatment = "P Practical", 23270 } 23271 23272 @Article{Kling:1978:AWC, 23273 author = "Rob Kling", 23274 title = "Automated Welfare Client-Tracking and Service Integration: the Political Economy of Computing", 23275 journal = j-CACM, 23276 volume = "21", 23277 number = "6", 23278 pages = "484--493", 23279 month = jun, 23280 year = "1978", 23281 CODEN = "CACMA2", 23282 ISSN = "0001-0782", 23283 bibdate = "Tue Mar 25 13:26:09 MST 1997", 23284 bibsource = "Compendex database", 23285 abstract = "The impact of an automated client-tracking system on the clients, caseworkers, administrators, and operations of the welfare agencies that use it are reported. The major impact of this system was to enhance the administrative attractiveness of the using agencies in the eyes of funders rather than to increase their internal administrative efficiency. This impact is a joint product of both the technical features of the computer-based system and of the organizational demands placed upon different agencies, administrators, and caseworkers. It illustrates the way ``successful'' automated information systems fit the political economies of the groups that use them.", 23286 acknowledgement = ack-nhfb, 23287 classcodes = "C0230 (Economic, social and political aspects of computing); C7130 (Public administration)", 23288 classification = "723", 23289 corpsource = "Univ. of California, Irvine, CA, USA", 23290 journalabr = "Commun ACM", 23291 keywords = "administrative attractiveness; client; computing; data processing; government data processing; impact; political economies; service integration; social aspects of automation; social impact; tracking; welfare agencies", 23292 treatment = "G General Review", 23293 } 23294 23295 @Article{Gelenbe:1978:PRR, 23296 author = "E. Gelenbe and D. Derochette", 23297 title = "Performance of Rollback Recovery Systems Under Intermittent Failures", 23298 journal = j-CACM, 23299 volume = "21", 23300 number = "6", 23301 pages = "493--499", 23302 month = jun, 23303 year = "1978", 23304 CODEN = "CACMA2", 23305 ISSN = "0001-0782", 23306 MRclass = "68H05", 23307 MRnumber = "80a:68113", 23308 mrreviewer = "Menachem Dishon", 23309 bibdate = "Tue Mar 25 13:26:09 MST 1997", 23310 bibsource = "Compendex database", 23311 abstract = "A mathematical model of a transaction-oriented system under intermittent failures is proposed. The system is assumed to operate with a checkpointing and rollback\slash recovery method to ensure reliable information processing. The model is used to derive the principal performance measures, including availability, response time, and the system saturation point.", 23312 acknowledgement = ack-nhfb, 23313 classcodes = "C6150J (Operating systems)", 23314 classification = "723", 23315 corpsource = "Univ. Paris-Sud, Orsay, France", 23316 journalabr = "Commun ACM", 23317 keywords = "availability; checkpointing; computer operating systems; data base systems; intermittent failures; mathematical model; performance measures; response time; rollback recovery systems; system recovery; system saturation point", 23318 treatment = "T Theoretical or Mathematical", 23319 } 23320 23321 @Article{Teorey:1978:GEI, 23322 author = "Toby J. Teorey", 23323 title = "General Equations for Idealized {CPU-I/O} Overlap Configurations", 23324 journal = j-CACM, 23325 volume = "21", 23326 number = "6", 23327 pages = "500--507", 23328 month = jun, 23329 year = "1978", 23330 CODEN = "CACMA2", 23331 ISSN = "0001-0782", 23332 MRclass = "68A05", 23333 MRnumber = "58 3643", 23334 mrreviewer = "A. D. Booth", 23335 bibdate = "Tue Mar 25 13:26:09 MST 1997", 23336 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib", 23337 abstract = "General equations are derived for estimating the maximum possible utilization of main storage partitions, CPU and I/O devices under different conditions in an idealized CPU-I/O overlap model of multiprogrammed computer systems. The equations are directly applicable to any configuration consisting of sets of identical CPU's, I/O processors, main storage partitions and user tasks. Examples are provided to illustrate the use of the equations to compute effective processing time per record and expected timesharing response time under both balanced and unbalanced resource utilization conditions.", 23338 acknowledgement = ack-nhfb, 23339 classcodes = "C6150J (Operating systems)", 23340 classification = "723", 23341 corpsource = "Univ. of Michigan, Ann Arbor, MI, USA", 23342 journalabr = "Commun ACM", 23343 keywords = "balanced; computer systems programming; CPU; devices; expected timesharing response time; I/O; input-output programs; main storage partitions; multiprogrammed computer systems; multiprogramming; overlap configurations; per record; processing time; storage allocation; time-sharing systems; unbalanced", 23344 treatment = "T Theoretical or Mathematical", 23345 } 23346 23347 @Article{Waltz:1978:ELQ, 23348 author = "David L. Waltz", 23349 title = "An {English} Language Query Answering System for a Large Relational Data Base", 23350 journal = j-CACM, 23351 volume = "21", 23352 number = "7", 23353 pages = "526--539", 23354 month = jul, 23355 year = "1978", 23356 CODEN = "CACMA2", 23357 ISSN = "0001-0782", 23358 bibdate = "Tue Mar 25 13:26:09 MST 1997", 23359 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib", 23360 abstract = "By typing requests in English, casual users will be able to obtain explicit answers from a large relational database of aircraft flight and maintenance data using a system called PLANES. The design and implementation of this system is described and illustrated with detailed examples of the operation of system components and examples of overall system operation. Also included are discussions of important issues in programming natural language systems for limited domains, and the relationship of this system to others.", 23361 acknowledgement = ack-nhfb, 23362 annote = "the PLANES system.", 23363 classcodes = "C6120 (File organisation); C7250 (Information storage and retrieval); C7460 (Aerospace engineering computing)", 23364 classification = "723", 23365 corpsource = "Univ. of Illinois, Urbana-Champaign, IL, USA", 23366 journalabr = "Commun ACM", 23367 keywords = "aerospace computing; aircraft; data base systems; database management systems; English language; flight; information retrieval; large; maintenance; PLANES; question answering system; relational database", 23368 treatment = "A Application; T Theoretical or Mathematical", 23369 xxtitle = "An {English} language question answering system for a large relational database", 23370 } 23371 23372 @Article{Fredman:1978:CCM, 23373 author = "Michael L. Fredman and Bruce Weide", 23374 title = "On the complexity of computing the measure of {$\bigcup[a_i,b_i]$}", 23375 journal = j-CACM, 23376 volume = "21", 23377 number = "7", 23378 pages = "540--544", 23379 month = jul, 23380 year = "1978", 23381 CODEN = "CACMA2", 23382 ISSN = "0001-0782", 23383 MRclass = "68A20", 23384 MRnumber = "58 13924", 23385 mrreviewer = "Jan van Leeuwen", 23386 bibdate = "Tue Mar 25 13:26:09 MST 1997", 23387 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Graphics/siggraph/78.bib", 23388 abstract = "The decision tree complexity of computing the measure of the union of $n$ (possibly overlapping) intervals is shown to be $\Omega(n \log n)$, even if comparisons between linear functions of the interval endpoints are allowed. The existence of an $\Omega (n \log n)$ lower bound to determine whether any two of $n$ real numbers are within $\epsilon$ of each other is also demonstrated. These problems provide an excellent opportunity for discussing the effects of the computational model on the ease of analysis and on the results produced.", 23389 acknowledgement = ack-nhfb, 23390 classcodes = "C4240 (Programming and algorithm theory)", 23391 classification = "723", 23392 corpsource = "Univ. of California, San Diego, CA, USA", 23393 journalabr = "Commun ACM", 23394 keywords = "algorithm theory; computational complexity; computational model; computer metatheory; computer programming; computing; decision tree complexity; intervals; measure; union", 23395 treatment = "T Theoretical or Mathematical", 23396 } 23397 23398 @Article{Chin:1978:ADN, 23399 author = "Francis Y. Chin", 23400 title = "An ${O}(n)$ Algorithm for Determining a Near-Optimal Computation Order of Matrix Chain Products", 23401 journal = j-CACM, 23402 volume = "21", 23403 number = "7", 23404 pages = "544--549", 23405 month = jul, 23406 year = "1978", 23407 CODEN = "CACMA2", 23408 ISSN = "0001-0782", 23409 MRclass = "68C25 (65F05)", 23410 MRnumber = "80a:68037", 23411 mrreviewer = "Ondrej S{\'y}kora", 23412 bibdate = "Tue Mar 25 13:26:09 MST 1997", 23413 bibsource = "Compendex database", 23414 abstract = "Discussion of the computation of matrix chain products of the form M//1 multiplied by M//2 multiplied by\ldots{} multiplied by M//n where M//i's are matrices. The order in which the matrices are computed affects the number of operations. A sufficient condition about the association of the matrices in the optimal order is presented. An O(n) algorithm to find an order of computation which takes less than 25 percent longer than the optimal time T(opt) is also presented. In most cases, the algorithm yields the optimal order or an order which takes only a few percent longer than T(opt) (less than 1 percent on the average).", 23415 acknowledgement = ack-nhfb, 23416 classcodes = "C4140 (Linear algebra)", 23417 classification = "723", 23418 corpsource = "Univ. of Alberta, Edmonton, Alta., Canada", 23419 journalabr = "Commun ACM", 23420 keywords = "algorithm; computation order; computer programming; matrix algebra; matrix chain products; optimal order", 23421 treatment = "T Theoretical or Mathematical", 23422 } 23423 23424 @Article{Perl:1978:ISL, 23425 author = "Yehoshua Perl and Alon Itai and Haim Avni", 23426 title = "Interpolation Search --- {A} Log Log {N} Search", 23427 journal = j-CACM, 23428 volume = "21", 23429 number = "7", 23430 pages = "550--553", 23431 month = jul, 23432 year = "1978", 23433 CODEN = "CACMA2", 23434 ISSN = "0001-0782", 23435 MRclass = "68A50", 23436 MRnumber = "58 8582", 23437 mrreviewer = "Amitava Bagchi", 23438 bibdate = "Tue Mar 25 13:26:09 MST 1997", 23439 bibsource = "Compendex database", 23440 abstract = "Interpolation search is a method of retrieving a desired record by key in an ordered file by using the value of the key and the statistical distribution of the keys. It is shown that on the average log log N file accesses are required to retrieve a key, assuming that the N keys are uniformly distributed. The number of extra accesses is also estimated and shown to be very low. The same holds if the cumulative distribution function of the keys is known. Computational experiments confirm these results.", 23441 acknowledgement = ack-nhfb, 23442 classcodes = "C6120 (File organisation)", 23443 classification = "723", 23444 corpsource = "Bar-Ilan Univ., Ramat-Gan, Israel", 23445 journalabr = "Commun ACM", 23446 keywords = "Average number of accesses; binary search; computer programming; database; file organisation; interpolation search; key; log; logN file accesses; ordered file; retrieval; retrieve; searching; statistical distribution of the keys; uniform distribution", 23447 treatment = "T Theoretical or Mathematical", 23448 } 23449 23450 @Article{Halatsis:1978:PHT, 23451 author = "Constantine Halatsis and George Philokyprou", 23452 title = "Pseudochaining in Hash Tables", 23453 journal = j-CACM, 23454 volume = "21", 23455 number = "7", 23456 pages = "554--557", 23457 month = jul, 23458 year = "1978", 23459 CODEN = "CACMA2", 23460 ISSN = "0001-0782", 23461 MRclass = "68A50", 23462 MRnumber = "58 3784", 23463 mrreviewer = "Eberhard Ludde", 23464 bibdate = "Tue Mar 25 13:26:09 MST 1997", 23465 bibsource = "Compendex database", 23466 abstract = "Presentation of pseudochaining as a new collision-resolution method. Pseudochaining is half way between open addressing and chaining. It owes its name to the fact that link fields are present in each cell of the hash table which permits ``chaining'' of the first overflow items in the table. The efficiency of the method is derived and a tradeoff analysis is given.", 23467 acknowledgement = ack-nhfb, 23468 classcodes = "C6120 (File organisation)", 23469 classification = "723", 23470 corpsource = "NRC 'Demokritos', Athens, Greece", 23471 journalabr = "Commun ACM", 23472 keywords = "collision resolution method; computer programming; efficiency; file organisation; hash tables; pseudochaining; tradeoff analysis", 23473 treatment = "T Theoretical or Mathematical", 23474 } 23475 23476 @Article{Lamport:1978:TCO, 23477 author = "Leslie Lamport", 23478 title = "Time, Clocks, and the Ordering of Events in a Distributed System", 23479 journal = j-CACM, 23480 volume = "21", 23481 number = "7", 23482 pages = "558--565", 23483 month = jul, 23484 year = "1978", 23485 CODEN = "CACMA2", 23486 ISSN = "0001-0782", 23487 bibdate = "Tue Mar 25 13:26:09 MST 1997", 23488 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Parallel/par.misc.bib", 23489 abstract = "The concept of one event happening before another in a distributed system is examined, and is shown to define a partial ordering of the events. A distributed algorithm is given for synchronizing a system of logical clocks which can be used to totally order the events. The use of the total ordering is illustrated with a method for solving synchronization problems. The algorithm is then specialized for synchronizing physical clocks, and a bound is derived on how far out of synchrony the clocks can become.", 23490 acknowledgement = ack-nhfb, 23491 annote = "Classic paper on logical clocks. A classic paper on synchronization. Reproduced in ``Distributed Computing: Concepts and Implementations'' edited by McEntire, O'Reilly and Larson, IEEE, 1984. The concept of one event happening before another in a distributed system is examined, and is shown to define a partial ordering of the events. A distributed algorithm is given for synchronising a system of logical clocks which can be used to totally order the events. The use of the total ordering is illustrated with a method for solving synchronisation problems. The algorithm is then specialised for synchronising physical clocks, and a bound is derived on how far out of synchrony the clocks can become.", 23492 classcodes = "C6150J (Operating systems)", 23493 classification = "723", 23494 journalabr = "Commun ACM", 23495 keywords = "5.29 distributed processing computer networks multiprocessing programs ordering of events distributed system synchronising total ordering clocks computer networks multiprocessing bsatya enm; clock synchronization; clocks; computer networks; computer operating systems; distributed computer systems; distributed processing; distributed system; distributed systems; dmp; grecommended91 CR categories: 4.32; jw; multiprocess systems; multiprocessing; ordering; ordering of events; programs; synchronising; total", 23496 treatment = "T Theoretical or Mathematical", 23497 } 23498 23499 @Article{Baker:1978:SBL, 23500 author = "Henry Givens {Baker, Jr.}", 23501 title = "Shallow Binding in {Lisp} 1.5", 23502 journal = j-CACM, 23503 volume = "21", 23504 number = "7", 23505 pages = "565--569", 23506 month = jul, 23507 year = "1978", 23508 CODEN = "CACMA2", 23509 ISSN = "0001-0782", 23510 bibdate = "Tue Mar 25 13:26:09 MST 1997", 23511 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Ai/lisp.bib", 23512 abstract = "Shallow binding is a scheme which allows the value of a variable to be accessed in a bounded amount of computation. An elegant model for shallow binding in Lisp 1.5 is presented in which context-switching is an environment tree transformation called rerooting. Rerooting is completely general and reversible, and is optional in the sense that a Lisp 1.5 interpreter will operate correctly whether or not rerooting is invoked on every context change. Since rerooting leaves assoc left bracket v, a right bracket invariant, for all variables v and all environments a, the programmer can have access to a rerooting primitive, shallow left bracket right bracket, which gives him dynamic control over whether accesses are shallow or deep, and which affects only the speed of execution of a program, not its semantics.", 23513 acknowledgement = ack-nhfb, 23514 classcodes = "C6140D (High level languages)", 23515 classification = "723", 23516 corpsource = "MIT, Cambridge, MA, USA", 23517 journalabr = "Commun ACM", 23518 keywords = "computer programming languages; context switching; environment; LISP; LISP 1.5; rerooting; shallow binding; tree transformation", 23519 treatment = "T Theoretical or Mathematical", 23520 } 23521 23522 @Article{Samet:1978:PCH, 23523 author = "Hanan Samet", 23524 title = "Proving the Correctness of Heuristically Optimized Code", 23525 journal = j-CACM, 23526 volume = "21", 23527 number = "7", 23528 pages = "570--582", 23529 month = jul, 23530 year = "1978", 23531 CODEN = "CACMA2", 23532 ISSN = "0001-0782", 23533 bibdate = "Tue Mar 25 13:26:09 MST 1997", 23534 bibsource = "Compendex database", 23535 abstract = "A system for proving that programs written in a high level language are correctly translated to a low level language is described. A primary use of the system is as a postoptimization step in code generation. The low level language programs need not be generated by a compiler and in fact could be hand coded. Examples of the usefulness of such a system are given. Some interesting results are the ability to handle programs that implement recursion by bypassing the start of the program, and the detection and pinpointing of a wide class of errors in the low level language programs. The examples demonstrate that optimization of the genre of this paper can result in a substantially faster operation and the saving of memory in terms of program and stack sizes.", 23536 acknowledgement = ack-nhfb, 23537 classcodes = "C4240 (Programming and algorithm theory); C6150C (Compilers, interpreters and other processors); C6150G (Diagnostic, testing, debugging and evaluating systems)", 23538 classification = "723", 23539 corpsource = "Univ. of Maryland, College Park, MO, USA", 23540 journalabr = "Commun ACM", 23541 keywords = "code generation; compiler; computer programming languages; correctness proving; heuristically optimised code; high level language; low level language; postoptimisation; program compilers; program testing", 23542 treatment = "T Theoretical or Mathematical", 23543 xxtitle = "Proving the correctness of heuristically optimised code", 23544 } 23545 23546 @Article{Shostak:1978:ARA, 23547 author = "Robert E. Shostak", 23548 title = "An Algorithm for Reasoning About Equality", 23549 journal = j-CACM, 23550 volume = "21", 23551 number = "7", 23552 pages = "583--585", 23553 month = jul, 23554 year = "1978", 23555 CODEN = "CACMA2", 23556 ISSN = "0001-0782", 23557 MRclass = "02-04 02B10", 23558 MRnumber = "58 4976", 23559 mrreviewer = "A. Pliuskeviciene", 23560 bibdate = "Tue Mar 25 13:26:09 MST 1997", 23561 bibsource = "Compendex database", 23562 abstract = "A simple technique for reasoning about equalities that is fast and complete for ground formulas with function symbols and equality is presented. A proof of correctness is given as well.", 23563 acknowledgement = ack-nhfb, 23564 classcodes = "C4240 (Programming and algorithm theory); C6150G (Diagnostic, testing, debugging and evaluating systems)", 23565 classification = "723", 23566 corpsource = "Stanford Res. Inst., Menlo Park, CA, USA", 23567 journalabr = "Commun ACM", 23568 keywords = "algorithm; computer programming; correctness; equality; program testing; reasoning; theorem proving", 23569 treatment = "T Theoretical or Mathematical", 23570 } 23571 23572 @Article{Chattergy:1978:AAC, 23573 author = "Rahul Chattergy and Udo W. Pooch", 23574 title = "Analysis of the Availability of Computer Systems Using Computer-Aided Algebra", 23575 journal = j-CACM, 23576 volume = "21", 23577 number = "7", 23578 pages = "586--591", 23579 month = jul, 23580 year = "1978", 23581 CODEN = "CACMA2", 23582 ISSN = "0001-0782", 23583 MRclass = "60K20 (68A15)", 23584 MRnumber = "58 3091", 23585 mrreviewer = "Ralph L. Disney", 23586 bibdate = "Tue Mar 25 13:26:09 MST 1997", 23587 bibsource = "Compendex database", 23588 abstract = "Analytical results, related to the availability of a computer system constructed of unreliable processors, are presented in this paper. These results are obtained by using various computer-aided algebraic manipulation techniques. A major purpose of this paper is to demonstrate that the difficulties of obtaining analytical solutions to Markov processes can be considerably reduced by the application of symbol manipulation programs. Since many physical systems can be modeled by Markov and semi-Markov processes, the potential range of application of these techniques is much wider than the problem of availability analyzed.", 23589 acknowledgement = ack-nhfb, 23590 classcodes = "C4290 (Other computer theory); C5420 (Mainframes and minicomputers)", 23591 classification = "722; 723", 23592 corpsource = "Univ. of Hawaii, Honolulu, HI, USA", 23593 journalabr = "Commun ACM", 23594 keywords = "algebraic manipulation; availability; computer systems; computer systems, digital; manipulation; Markov processes; real-time systems; reliability; symbol; unreliable processors", 23595 treatment = "T Theoretical or Mathematical", 23596 } 23597 23598 @Article{Snyder:1978:BRE, 23599 author = "Lawrence Snyder", 23600 title = "{B-Trees} Re-examined", 23601 journal = j-CACM, 23602 volume = "21", 23603 number = "7", 23604 pages = "594--594", 23605 month = jul, 23606 year = "1978", 23607 CODEN = "CACMA2", 23608 ISSN = "0001-0782", 23609 bibdate = "Sat Jan 18 15:40:20 1997", 23610 bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib", 23611 } 23612 23613 @Article{Backus:1978:CPB, 23614 author = "John Backus", 23615 title = "Can Programming Be Liberated From the {von Neumann} Style? {A} Functional Style and its Algebra of Programs", 23616 journal = j-CACM, 23617 volume = "21", 23618 number = "8", 23619 pages = "613--641", 23620 month = aug, 23621 year = "1978", 23622 CODEN = "CACMA2", 23623 ISSN = "0001-0782", 23624 bibdate = "Tue Mar 25 13:26:09 MST 1997", 23625 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Parallel/par.misc.bib and ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1978.bib", 23626 note = "Reproduced in ``Selected Reprints on Dataflow and Reduction Architectures'' ed. S. S. Thakkar, IEEE, 1987, pp. 215-243.", 23627 abstract = "Conventional programming languages are growing ever more enormous, but not stronger. Inherent defects at the most basic level cause them to be both fat and weak: their primitive word-at-a-time style of programming inherited from their common ancestor, the von Neumann computer; their division of programming into a world of expressions and a world of statements; their inability to effectively use powerful combining forms for building new programs from existing ones; and their lack of useful mathematical properties for reasoning about programs. An alternative functional style of programming is founded on the use of combining forms for creating programs. Functional programs deal with structured data, are often nonrepetitive and nonrecursive, are hierarchically constructed, do not name their arguments, and do not require the complex machinery of procedure declarations to become generally applicable. Combining forms can use high level programs to build still higher level ones in a style not possible in conventional languages.", 23628 acknowledgement = ack-nhfb, 23629 annote = "Conventional programming languages are growing ever more enormous, but not stronger. Inherent defects at the most basic level cause them to be both fat and weak: their primitive word-at-a-time style of programming inherited from their common ancestor - the von Neumann computer, their close coupling of semantics to state transitions, their division of programming into a world of expressions and a world of statements, their inability to effectively \ldots{}", 23630 classcodes = "C6140 (Programming languages)", 23631 classification = "723", 23632 corpsource = "IMB Res. Lab., San Jose, CA, USA", 23633 descriptors = "Programming language; reliability; future outlook; von Neumann computer; applicative computing system;", 23634 journalabr = "Commun ACM", 23635 keywords = "4.29; 5.20; 5.24; 5.26; algebra of programs; applicative computing systems; combining forms; computer metatheory; conventional languages; CR categories: 4.20; functional style; grecommended91; Key words and phrases: functional programming; metacomposition; models of computing systems; program correctness; program termination; program transformation; programming languages; Rhighnam; structured data; theory ak; Turing award lecture; von Neuman style; von Neumann computers; von Neumann languages", 23636 treatment = "T Theoretical or Mathematical", 23637 } 23638 23639 @Article{Kling:1978:VCS, 23640 author = "R. Kling", 23641 title = "Value conflicts and social choice in electronic funds transfer system developments", 23642 journal = j-CACM, 23643 volume = "21", 23644 number = "8", 23645 pages = "642--657", 23646 month = aug, 23647 year = "1978", 23648 CODEN = "CACMA2", 23649 ISSN = "0001-0782", 23650 bibdate = "Tue Mar 25 13:26:09 MST 1997", 23651 acknowledgement = ack-nhfb, 23652 classcodes = "C7120 (Financial computing)", 23653 corpsource = "Univ. of California, Irvine, CA, USA", 23654 keywords = "EFT; EFTS; electronic funds transfer; privacy of transactions; reliability; social choice; system", 23655 treatment = "E Economic; G General Review", 23656 } 23657 23658 @Article{Hirschberg:1978:FPS, 23659 author = "D. S. Hirschberg", 23660 title = "Fast Parallel Sorting Algorithms", 23661 journal = j-CACM, 23662 volume = "21", 23663 number = "8", 23664 pages = "657--661", 23665 month = aug, 23666 year = "1978", 23667 CODEN = "CACMA2", 23668 ISSN = "0001-0782", 23669 MRclass = "68C25", 23670 MRnumber = "80c:68028", 23671 mrreviewer = "J. Misra", 23672 bibdate = "Tue Mar 25 13:26:09 MST 1997", 23673 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Misc/protein.pattern.bib", 23674 abstract = "A parallel bucket-sort algorithm is presented that requires time O(log n) and the use of n processors. The algorithm makes use of a technique that requires more space than the product of processors and time. A realistic model is used in which no memory contention is permitted. A procedure is also presented to sort n numbers in time O(k log n) using n**1** plus **1**/**k processors, for k an arbitrary integer. The model of computation for this procedure permits simultaneous fetches from the same memory location.", 23675 acknowledgement = ack-nhfb, 23676 classcodes = "C6130 (Data handling techniques); C6150J (Operating systems)", 23677 classification = "723", 23678 comment = "``A parallel bucket--sort algorithm is presented that requires time $O(\log n)$ and the use of $n$ processors. The algorithm makes use of a technique that requires more space than the product of processors and time. A realistic model is used in which no memory contention is permitted. A procedure is also presented to sort $n$ numbers in time $O(k \log n)$ using $n^{1+1/k}$ processors, for $k$ an arbitrary integer. The model of computation for this procedure permits simultaneous fetches from the same memory location.''", 23679 corpsource = "Rice Univ., Houston, TX, USA", 23680 journalabr = "Commun ACM", 23681 keywords = "bucket sort algorithm; computer programming --- Subroutines; computer systems programming; parallel processing; parallel sorting algorithms; sorting", 23682 treatment = "T Theoretical or Mathematical", 23683 } 23684 23685 @Article{Morris:1978:TSE, 23686 author = "F. Lockwood Morris", 23687 title = "A Time- and Space-Efficient Garbage Compaction Algorithm", 23688 journal = j-CACM, 23689 volume = "21", 23690 number = "8", 23691 pages = "662--665", 23692 month = aug, 23693 year = "1978", 23694 CODEN = "CACMA2", 23695 ISSN = "0001-0782", 23696 bibdate = "Tue Mar 25 13:26:09 MST 1997", 23697 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Compiler/reynolds.bib", 23698 abstract = "Given an area of storage containing scattered, marked nodes of differing sizes, one may wish to rearrange them into a compact mass at one end of the area while revising all pointers to marked nodes to show their new locations. An algorithm is described which accomplishes this task in linear time relative to the size of the storage area, and in a space of the order of one bit for each pointer. The algorithm operates by reversibly encoding the situation (that a collection of locations point to a single location) by a linear list, emanating from the pointed-to location, passing through the pointing locations, and terminating with the pointed-to location's transplanted contents.", 23699 acknowledgement = ack-nhfb, 23700 classcodes = "C6120 (File organisation)", 23701 classification = "723", 23702 corpsource = "Syracuse Univ., Syracuse, NY, USA", 23703 journalabr = "Commun ACM", 23704 keywords = "computer operating systems --- Storage Allocation; computer programming; encoding; garbage compaction algorithm; pointers; pointing locations; reversibly; storage; storage management", 23705 treatment = "T Theoretical or Mathematical", 23706 } 23707 23708 @Article{Hoare:1978:CSP, 23709 author = "C. A. R. Hoare", 23710 title = "Communicating Sequential Processes", 23711 journal = j-CACM, 23712 volume = "21", 23713 number = "8", 23714 pages = "666--677", 23715 month = aug, 23716 year = "1978", 23717 CODEN = "CACMA2", 23718 ISSN = "0001-0782", 23719 bibdate = "Tue Mar 25 13:26:09 MST 1997", 23720 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Parallel/par.misc.bib", 23721 note = "See corrigendum \cite{Hoare:1978:CCS}.", 23722 abstract = "This paper suggests that input and output are basic primitives of programming and that parallel composition of communicating sequential processes is a fundamental program structuring method. When combined with a development of Dijkstra's guarded command, these concepts are surprisingly versatile. \par Their use is illustrated by sample solutions of a variety of familiar programming exercises.", 23723 acknowledgement = ack-nhfb, 23724 annote = "This paper is now expanded into an excellent book detailed by Hoare and published by Prentice-Hall. This paper is reproduced in Kuhn and Padua's (1981, IEEE) survey ``Tutorial on Parallel Processing.'' Reproduced in ``Distributed Computing: Concepts and Implementations'' edited by McEntire, O'Reilly and Larson, IEEE, 1984. Somewhat dated.", 23725 classcodes = "C6110 (Systems analysis and programming)", 23726 classification = "723", 23727 corpsource = "Queen's Univ., Belfast, UK", 23728 journalabr = "Commun ACM", 23729 keywords = "4.22; 4.32 maeder biblio: synchronisation and concurrency in processes; ak; bhibbard grecommended91; classes; computer programming; concurrency; conditional critical regions; coroutines; CR categories: 4.20; CSP; data representations; Dijkstra's guarded command; guarded commands; hcc; input; iterative arrays; k-concurrency; k-csp; k-guarded-commands; monitors; multiple entries; multiple exits; nondeterminacy; output; parallel composition; parallel programming; primitives; procedures; program; program structures; programming; Programming; programming languages; programming primitives; recursion; sequential processes; structured programming; structuring method", 23730 treatment = "T Theoretical or Mathematical", 23731 } 23732 23733 @Article{Brice:1978:FCR, 23734 author = "Richard S. Brice and J. C. Browne", 23735 title = "Feedback Coupled Resource Allocation Policies in the Multiprogramming-Multiprocessor Computer System", 23736 journal = j-CACM, 23737 volume = "21", 23738 number = "8", 23739 pages = "678--686", 23740 month = aug, 23741 year = "1978", 23742 CODEN = "CACMA2", 23743 ISSN = "0001-0782", 23744 bibdate = "Tue Mar 25 13:26:09 MST 1997", 23745 bibsource = "Compendex database", 23746 abstract = "Model studies of some integrated, feedback-driven scheduling systems for multiprogrammed-multiprocessor computer systems are presented. The basic control variables used are the data-flow rates for the processes executing on the CPU. The model systems feature simulated continuous-flow and preempt-resume scheduling of input-output activity. Attention is given to the amount of memory resource required for effective processing of the I/O activity (buffer space assignment). The model studies used both distribution-driven and trace-driven techniques. Even relatively simple dynamic schedulers are shown to improve system performance (as measured by user CPU time) over that given by optimal or near-optimal static schedulers imbedded in identical system structures and workload environments. The improvement is greatest under a heavy I/O demand workload.", 23747 acknowledgement = ack-nhfb, 23748 classcodes = "C6150J (Operating systems)", 23749 classification = "722; 723", 23750 corpsource = "George Washington Univ., Washington, DC, USA", 23751 journalabr = "Commun ACM", 23752 keywords = "buffer space assignment; computer systems programming; computer systems, digital; dynamic schedulers; feedback scheduling; I/O activity; multiprogramming; scheduling; scheduling systems", 23753 treatment = "T Theoretical or Mathematical", 23754 } 23755 23756 @Article{Scheuermann:1978:SAP, 23757 author = "Peter Scheuermann and C. Robert Carlson", 23758 title = "Self-Assessment Procedure {V}: a self-assessment procedure dealing with database systems", 23759 journal = j-CACM, 23760 volume = "21", 23761 number = "8", 23762 pages = "687--693", 23763 month = aug, 23764 year = "1978", 23765 CODEN = "CACMA2", 23766 ISSN = "0001-0782", 23767 bibdate = "Sat Jan 18 15:40:45 1997", 23768 bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib", 23769 } 23770 23771 @Article{Harris:1978:AUS, 23772 author = "R. A. Harris and J. D. Zund", 23773 title = "An algorithm using symbolic techniques for the {Bel-Petrov} classification of gravitational fields", 23774 journal = j-CACM, 23775 volume = "21", 23776 number = "9", 23777 pages = "715--717", 23778 month = sep, 23779 year = "1978", 23780 CODEN = "CACMA2", 23781 ISSN = "0001-0782", 23782 bibdate = "Tue Mar 25 13:26:09 MST 1997", 23783 acknowledgement = ack-nhfb, 23784 classcodes = "A0270 (Computational techniques); A0420C (Fundamental problems and general formalism in general relativity); A0430 (Gravitational waves and radiation: theory); C6130 (Data handling techniques); C7320 (Physics and chemistry computing)", 23785 corpsource = "HRB-Singer Inc., State College, PA, USA", 23786 keywords = "Bel; classification scheme; FORMAC; general relativity; gravitation; gravitational fields; gravitational waves; Petrov types; physics computing; symbol manipulation", 23787 treatment = "A Application; T Theoretical or Mathematical", 23788 } 23789 23790 @Article{Schwetman:1978:HSM, 23791 author = "H. D. Schwetman", 23792 title = "Hybrid Simulation Models of Computer Systems", 23793 journal = j-CACM, 23794 volume = "21", 23795 number = "9", 23796 pages = "718--723", 23797 month = sep, 23798 year = "1978", 23799 CODEN = "CACMA2", 23800 ISSN = "0001-0782", 23801 bibdate = "Tue Mar 25 13:26:09 MST 1997", 23802 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Distributed/simulan.bib", 23803 abstract = "A description is given of the structure and operation of a hybrid simulation model in which both discrete-event simulation and analytic techniques are combined to produce efficient yet accurate system models. In an example based on a simple hypothetical computer system, discrete-event simulation is used to model the arrival and activation of jobs, and a central-server queueing network models the use of system processors. The accuracy and efficiency of the hybrid technique are demonstrated by comparing the result and computational costs of the hybrid model of the example with those of an equivalent simulation-only model.", 23804 acknowledgement = ack-nhfb, 23805 classcodes = "C7430 (Computer engineering)", 23806 classification = "722; 723", 23807 corpsource = "Purdue Univ., Lafayette, IN, USA", 23808 journalabr = "Commun ACM", 23809 keywords = "activation of jobs; analytic techniques; arrival; central server queueing; computer selection and evaluation; computer simulation; computer systems; computer systems, digital; digital simulation; discrete event; hypothetical computer; network; simulation; simulation model; system", 23810 treatment = "A Application; T Theoretical or Mathematical", 23811 } 23812 23813 @Article{Barth:1978:PID, 23814 author = "Jeffrey M. Barth", 23815 title = "A Practical Interprocedural Data Flow Analysis Algorithm", 23816 journal = j-CACM, 23817 volume = "21", 23818 number = "9", 23819 pages = "724--736", 23820 month = sep, 23821 year = "1978", 23822 CODEN = "CACMA2", 23823 ISSN = "0001-0782", 23824 bibdate = "Tue Mar 25 13:26:09 MST 1997", 23825 bibsource = "Compendex database", 23826 abstract = "A new interprocedural data flow analysis algorithm is presented and analyzed. The algorithm associates with each procedure in a program information about which variables may be modified, which may be used, and which are possibly preserved by a call on the procedure, and all of its subcalls. The algorithm is sufficiently powerful to be used on recursive programs and to deal with the sharing of variables which arises through reference parameters. The algorithm is unique in that it can compute all of this information in a single pass, not requiring a prepass to compute calling relationships or sharing patterns. The algorithm is asymptotically optimal in time complexity. It has been implemented and is practical even on programs which are quite large.", 23827 acknowledgement = ack-nhfb, 23828 classcodes = "C4240 (Programming and algorithm theory)", 23829 classification = "723", 23830 corpsource = "Stanford Univ., Stanford, CA, USA", 23831 journalabr = "Commun ACM", 23832 keywords = "asymptotically; computer programming; interprocedural data flow analysis algorithm; optimal in time complexity; program; programming theory; recursive programs; reference parameters", 23833 treatment = "T Theoretical or Mathematical", 23834 } 23835 23836 @Article{Popek:1978:MVD, 23837 author = "Gerald J. Popek and David A. Farber", 23838 title = "Model for Verification of Data Security in Operating Systems", 23839 journal = j-CACM, 23840 volume = "21", 23841 number = "9", 23842 pages = "737--749", 23843 month = sep, 23844 year = "1978", 23845 CODEN = "CACMA2", 23846 ISSN = "0001-0782", 23847 bibdate = "Tue Mar 25 13:26:09 MST 1997", 23848 bibsource = "Compendex database", 23849 abstract = "Program verification applied to kernel architectures forms a promising method for providing uncircumventably secure, shared computer systems. A precise definition of data security is developed in terms of a general model for operating systems. This model is suitable as a basis for verifying many of those properties of an operating system which are necessary to assure reliable enforcement of security. The application of this approach to the UCLA secure operating system is also discussed.", 23850 acknowledgement = ack-nhfb, 23851 classcodes = "C6150J (Operating systems)", 23852 classification = "722; 723", 23853 corpsource = "Univ. of California, Los Angeles, CA, USA", 23854 journalabr = "Commun ACM", 23855 keywords = "computer operating systems; computer systems, digital --- Time Sharing; data processing; data security; kernel architectures; model; operating systems; operating systems (computers); security of data; verification", 23856 treatment = "P Practical", 23857 } 23858 23859 @Article{Denning:1978:GWS, 23860 author = "Peter J. Denning and Donald R. Slutz", 23861 title = "Generalized Working Sets for Segment Reference Strings", 23862 journal = j-CACM, 23863 volume = "21", 23864 number = "9", 23865 pages = "750--759", 23866 month = sep, 23867 year = "1978", 23868 CODEN = "CACMA2", 23869 ISSN = "0001-0782", 23870 bibdate = "Tue Mar 25 13:26:09 MST 1997", 23871 bibsource = "Compendex database", 23872 abstract = "The working-set concept is extended for programs that reference segments of different sizes. The generalized working-set policy (GWS) keeps as its resident set those segments whose retention costs do not exceed their retrieval costs. The GWS is a model for the entire class of demand-fetching memory policies that satisfy a resident-set inclusion property. A generalized optimal policy (GOPT) is also defined; at its operating points it minimizes aggregated retention and swapping costs. Special cases of the cost structure allow GWS and GOPT to simulate any known stack algorithm, the working set, and VMIN. Efficient procedures for computing demand curves showing swapping load as a function of memory usage are developed for GWS and GOPT policies. Empirical data from an actual system are included.", 23873 acknowledgement = ack-nhfb, 23874 classcodes = "C6120 (File organisation)", 23875 classification = "723", 23876 corpsource = "Purdue Univ., Lafayette, IN, USA", 23877 journalabr = "Commun ACM", 23878 keywords = "computer operating systems; demand fetching memory policies; generalised optimal policy; generalised working set policy; operating systems (computers); property; resident set inclusion; retention costs; retrieval costs; segment reference strings; storage; storage management; swapping costs; virtual", 23879 treatment = "T Theoretical or Mathematical", 23880 xxtitle = "Generalized working sets of segment reference strings", 23881 } 23882 23883 @Article{Myers:1978:CEP, 23884 author = "Glenford J. Myers", 23885 title = "Controlled Experiment in Program Testing and Code Walkthroughs\slash Inspections", 23886 journal = j-CACM, 23887 volume = "21", 23888 number = "9", 23889 pages = "760--768", 23890 month = sep, 23891 year = "1978", 23892 CODEN = "CACMA2", 23893 ISSN = "0001-0782", 23894 bibdate = "Tue Mar 25 13:26:09 MST 1997", 23895 bibsource = "Compendex database", 23896 abstract = "An experiment in program testing is described that employs 59 highly experienced data processing professionals using seven methods to test a small PL/I program. The results show that the popular code walkthrough\slash inspection method was as effective as other computer-based methods in finding errors and that the most effective methods (in terms of errors found and cost) employed pairs of subjects who tested the program independently and then pooled their findings. The study also shows that there is a tremendous amount of variability among subjects and that the ability to detect certain types of errors varies from method to method.", 23897 acknowledgement = ack-nhfb, 23898 classcodes = "C6110 (Systems analysis and programming); C6150G (Diagnostic, testing, debugging and evaluating systems)", 23899 classification = "723", 23900 corpsource = "IBM Systems Res. Inst., Palo Alto, CA, USA", 23901 journalabr = "Commun ACM", 23902 keywords = "code; computer programming; controlled experiment; effective; errors; experienced data processing; of subjects; pairs; professionals; program debugging; program testing; small PL/I program; variability; walkthroughs/inspections", 23903 treatment = "P Practical; X Experimental", 23904 } 23905 23906 @Article{Ottmann:1978:RBT, 23907 author = "Th. Ottmann and H. W. Six and D. Wood", 23908 title = "Right Brother Trees", 23909 journal = j-CACM, 23910 volume = "21", 23911 number = "9", 23912 pages = "769--776", 23913 month = sep, 23914 year = "1978", 23915 CODEN = "CACMA2", 23916 ISSN = "0001-0782", 23917 MRclass = "68A10", 23918 MRnumber = "58 13898", 23919 mrreviewer = "Stephen Soule", 23920 bibdate = "Tue Mar 25 13:26:09 MST 1997", 23921 acknowledgement = ack-nhfb, 23922 classcodes = "C1160 (Combinatorial mathematics); C6120 (File organisation)", 23923 corpsource = "Univ. of Karlsruhe, Karlsruhe, West Germany", 23924 keywords = "balanced trees; data structures; deletion algorithms; file organisation; insertion algorithm; one sided height; right brother trees; trees (mathematics)", 23925 treatment = "T Theoretical or Mathematical", 23926 } 23927 23928 @Article{Ulrich:1978:EMD, 23929 author = "Ernst G. Ulrich", 23930 title = "Event Manipulation for Discrete Simulations Requiring Large Numbers of Events", 23931 journal = j-CACM, 23932 volume = "21", 23933 number = "9", 23934 pages = "777--785", 23935 month = sep, 23936 year = "1978", 23937 CODEN = "CACMA2", 23938 ISSN = "0001-0782", 23939 bibdate = "Tue Mar 25 13:26:09 MST 1997", 23940 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD.bib", 23941 abstract = "An event-manipulation system is presented consisting of two parts. The first part addresses the familiar problem of event scheduling efficiency when the number of scheduled events grows large. The second part deals with the less apparent problem of providing efficiency and flexibility as scheduled events are accessed to be executed. Additional features and problems dealt with include the proper handling of simultaneous events; that certain events must be created, scheduled, and executed at the same points in simulated time; that infinite loops caused by the concatenation of such ``zero-time'' events are possible and must be diagnosed; that maintaining various event counts is practical and economical; and that a capability for handling ``time-displaceable'' events is desirable and possible.", 23942 acknowledgement = ack-nhfb, 23943 classcodes = "C1290 (Applications of systems theory)", 23944 classification = "723; 912", 23945 corpsource = "Digital Equipment Corp., Maynard, MA, USA", 23946 country = "USA", 23947 descriptors = "Simulation; event set;", 23948 enum = "7988", 23949 journalabr = "Commun ACM", 23950 keywords = "computer programming --- Subroutines; digital simulation; discrete simulations; event; event scheduling efficiency; large numbers of events; manipulation system; operations research; scheduling; scheduling algorithms; simultaneous events; time flow mechanisms", 23951 language = "English", 23952 location = "SEL: Wi", 23953 references = "0", 23954 revision = "16/01/94", 23955 treatment = "T Theoretical or Mathematical", 23956 } 23957 23958 @Article{Maly:1978:NVM, 23959 author = "K. Maly", 23960 title = "A note on virtual memory indexes", 23961 journal = j-CACM, 23962 volume = "21", 23963 number = "9", 23964 pages = "786--787", 23965 month = sep, 23966 year = "1978", 23967 CODEN = "CACMA2", 23968 ISSN = "0001-0782", 23969 bibdate = "Tue Mar 25 13:26:09 MST 1997", 23970 acknowledgement = ack-nhfb, 23971 classcodes = "C6120 (File organisation)", 23972 corpsource = "Univ. of Minnesota, Minneapolis, MN, USA", 23973 keywords = "construction; linked; maintenance; representation; retrieval cost; virtual memory indexes; virtual storage; within a page", 23974 treatment = "T Theoretical or Mathematical", 23975 } 23976 23977 @Article{Ward:1978:RTP, 23978 author = "Stephen A. Ward", 23979 title = "Real Time Plotting of Approximate Contour Maps", 23980 journal = j-CACM, 23981 volume = "21", 23982 number = "9", 23983 pages = "788--790", 23984 month = sep, 23985 year = "1978", 23986 CODEN = "CACMA2", 23987 ISSN = "0001-0782", 23988 bibdate = "Tue Mar 25 13:26:09 MST 1997", 23989 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Graphics/siggraph/78.bib", 23990 abstract = "For output to a character-oriented device, it is generally preferable to plot a contour map in raster-scan order (rather than to follow individual contour lines). A technique is described for the production of crude contour maps on a serial character-oriented device. The method described runs in real time in the sense that the computation required per output character is constant. While the contours produced exhibit local inaccuracies, they retain the properties of not crossing and of forming closed curves (except where they intersect the boundaries of the map).", 23991 acknowledgement = ack-nhfb, 23992 classcodes = "C6130B (Graphics techniques); C7340 (Geophysics computing)", 23993 classification = "405; 723", 23994 corpsource = "MIT, Cambridge, MA, USA", 23995 journalabr = "Commun ACM", 23996 keywords = "approximate contour maps; cartography; computer graphics; contour maps; contour output; geophysics computing; maps and mapping; oriented device; plotting; real time; serial character", 23997 treatment = "A Application; P Practical", 23998 } 23999 24000 @Article{Tenenbaum:1978:SDS, 24001 author = "A. Tenenbaum", 24002 title = "Simulations of dynamic sequential search algorithms", 24003 journal = j-CACM, 24004 volume = "21", 24005 number = "9", 24006 pages = "790--791", 24007 month = sep, 24008 year = "1978", 24009 CODEN = "CACMA2", 24010 ISSN = "0001-0782", 24011 bibdate = "Tue Mar 25 13:26:09 MST 1997", 24012 acknowledgement = ack-nhfb, 24013 classcodes = "C6130 (Data handling techniques)", 24014 corpsource = "Brooklyn Coll., New York, NY, USA", 24015 keywords = "dynamic reordering; dynamic sequential search algorithms; list; list processing; processing; simulation", 24016 treatment = "T Theoretical or Mathematical", 24017 } 24018 24019 @Article{Brainerd:1978:F, 24020 author = "Walt Brainerd", 24021 title = "{Fortran 77}", 24022 journal = j-CACM, 24023 volume = "21", 24024 number = "10", 24025 pages = "806--820", 24026 month = oct, 24027 year = "1978", 24028 CODEN = "CACMA2", 24029 ISSN = "0001-0782", 24030 bibdate = "Tue Mar 25 13:26:09 MST 1997", 24031 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib", 24032 abstract = "A compiler for Fortran 77 may be larger than one for the 1966 standard Fortran, but not much larger than most current compilers. The compilation should be almost as efficient as before and the code produced should be almost as efficient, except possible for some of the new features such as the character data type and some of the new types of input\slash output. In several cases, such as DO loops (due to deletion of extended range) and IF blocks, it should be possible to generate even more efficient code than before. Furthermore the modest but powerful language extensions should serve to reduce greatly the costs of developing, maintaining, and transporting Fortran software.", 24033 acknowledgement = ack-nhfb, 24034 annote = "I-O and OPEN statements.", 24035 classcodes = "C6140D (High level languages)", 24036 classification = "723", 24037 corpsource = "Burroughs Corp., Encino, CA, USA", 24038 journalabr = "Commun ACM", 24039 keywords = "computer programming languages; FORTRAN; FORTRAN 77; standard FORTRAN; standards", 24040 treatment = "G General Review; N New Development", 24041 } 24042 24043 @Article{Towsley:1978:MPP, 24044 author = "D. Towsley and K. M. Chandy and J. C. Browne", 24045 title = "Models for Parallel Processing Within Programs: Application to {CPU:I/O} and {I/O:I/O} Overlap", 24046 journal = j-CACM, 24047 volume = "21", 24048 number = "10", 24049 pages = "821--831", 24050 month = oct, 24051 year = "1978", 24052 CODEN = "CACMA2", 24053 ISSN = "0001-0782", 24054 bibdate = "Tue Mar 25 13:26:09 MST 1997", 24055 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib and ftp://ftp.ira.uka.de/pub/bibliography/Parallel/Parallel.io.bib", 24056 abstract = "Approximate queueing models for internal parallel processing by individual programs in a multiprogrammed system are developed. The solution technique is developed by network decomposition. The models are formulated in terms of CPU:I/O and I/O:I/O overlap and applied to the analysis of these problems. The percentage performance improvement from CPU:I/O overlap is found to be greatest for systems which are in approximate CPU:I/O utilization balance and for low degrees of multiprogramming. The percentage improvement from I/O:I/O overlap is found to be greatest for systems in which the I/O system is more utilized than the CPU.", 24057 acknowledgement = ack-nhfb, 24058 annote = "Queueing models for parallel processing by improvement from CPU:I/O overlap if found to be greatest for systems which are in CPU:I/O balance and for low degrees of multiprogramming. Improvement from I/O:I/O overlap is found to be greatest for systems in which the I/O system is more utilized than the CPU.", 24059 classcodes = "C1140C (Queueing theory); C6150J (Operating systems)", 24060 classification = "722; 723", 24061 comment = "Models CPU:I/O and I/O:I/O overlap within a program. ``Overlapping is helpful only when it allows a device to be utilized which would not be utilized without overlapping.'' In general the overlapping seems to help.", 24062 corpsource = "Univ. of Texas, Austin, TX, USA", 24063 journalabr = "Commun ACM", 24064 keywords = "computer systems programming; computer systems, digital --- Multiprocessing; internal parallel; network decomposition; parallel I/O; parallel processing; pario bib; processing; queueing models; queueing theory", 24065 treatment = "T Theoretical or Mathematical", 24066 } 24067 24068 @Article{Shneiderman:1978:JSF, 24069 author = "Ben Shneiderman", 24070 title = "Jump Searching: {A} Fast Sequential Search Technique", 24071 journal = j-CACM, 24072 volume = "21", 24073 number = "10", 24074 pages = "831--834", 24075 month = oct, 24076 year = "1978", 24077 CODEN = "CACMA2", 24078 ISSN = "0001-0782", 24079 bibdate = "Tue Mar 25 13:26:09 MST 1997", 24080 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib", 24081 abstract = "When sequential file structures must be used and binary searching is not feasible, jump searching becomes an appealing alternative. An exploration is made of variants of the classic jump searching scheme where the optimum jump size is the square root of the number of records. Multiple level and variable size jump strategies are explored, appropriate applications are discussed and performance is evaluated.", 24082 acknowledgement = ack-nhfb, 24083 annote = "Explores variants of the classic jump searching scheme where the optimum jump size is the square root of the number of records.", 24084 classcodes = "C6120 (File organisation)", 24085 classification = "723", 24086 corpsource = "Univ. of Maryland, College Park, MD, USA", 24087 journalabr = "Commun ACM", 24088 keywords = "computer systems programming; data structures; database structures; file management; file organisation; index searching; jump searching; Jump searching; jump strategies; search strategies; sequential file structures; sequential files; sequential search technique", 24089 treatment = "G General Review", 24090 } 24091 24092 @Article{Chang:1978:OHM, 24093 author = "Shi-Kuo Chang and Yin-Wah Wong", 24094 title = "Optimal Histogram Matching by Monotone Gray Level Transformation", 24095 journal = j-CACM, 24096 volume = "21", 24097 number = "10", 24098 pages = "835--840", 24099 month = oct, 24100 year = "1978", 24101 CODEN = "CACMA2", 24102 ISSN = "0001-0782", 24103 bibdate = "Tue Mar 25 13:26:09 MST 1997", 24104 bibsource = "Compendex database", 24105 abstract = "Investigation of the problem of optimal histogram matching using monotone gray level transformation, which always assigns all picture points of a given gray level i to another gray level T(i) such that if i greater than equivalent to j, then T(i) greater than equivalent to T(j). The objective is to find a transformed digital picture of a given picture such that the sum of absolute errors between the gray level histogram of the transformed picture and that of a reference picture is minimized. This is equivalent to placing k1 linearly ordered objects of different sizes one by one into k2 linearly ordered boxes of assorted sizes, such that the accumulated error of space underpacked or overpacked in the boxes is minimized; the placement function is monotonic, which ensures a polynomial time solution to this problem. A tree search algorithm for optimal histogram matching is presented which has time complexity O(k1 multiplied by k2). If the monotone property is dropped, then the problem becomes NP-complete, even if it is restricted to k2 equals 2.", 24106 acknowledgement = ack-nhfb, 24107 classcodes = "C1260 (Information theory)", 24108 classification = "723; 741", 24109 corpsource = "Univ. of Illinois at Chicago Circle, Chicago, IL, USA", 24110 journalabr = "Commun ACM", 24111 keywords = "algorithm; complete computer programs; computer systems programming; computerised picture processing; histogram matching; image processing; optimal histogram matching; tree search", 24112 treatment = "T Theoretical or Mathematical", 24113 } 24114 24115 @Article{Morris:1978:CLN, 24116 author = "Robert Morris", 24117 title = "Counting Large Numbers of Events in Small Registers", 24118 journal = j-CACM, 24119 volume = "21", 24120 number = "10", 24121 pages = "840--842", 24122 month = oct, 24123 year = "1978", 24124 CODEN = "CACMA2", 24125 ISSN = "0001-0782", 24126 bibdate = "Tue Mar 25 13:26:09 MST 1997", 24127 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Misc/bin-packing.bib", 24128 abstract = "It is possible to use a small counter to keep approximate counts of large numbers. The resulting expected error can be rather precisely controlled. An example is given in which 8-bit counters (bytes) are used to keep track of as many as 130,000 events with a relative error which is substantially independent of the number n of events. This relative error can be expected to be 24 percent or less 95 percent of the time. The techniques could be used to advantage in multichannel counting hardware or software used for the monitoring of experiments or processes.", 24129 acknowledgement = ack-nhfb, 24130 classcodes = "C6130 (Data handling techniques)", 24131 classification = "723", 24132 corpsource = "Bell Labs., Murray Hill, NJ, USA", 24133 journalabr = "Commun ACM", 24134 keywords = "computer systems programming; counting; data handling; multichannel counting hardware", 24135 treatment = "G General Review", 24136 } 24137 24138 @Article{McMaster:1978:AAD, 24139 author = "Colin L. McMaster", 24140 title = "An Analysis of Algorithms for the {Dutch National Flag Problem}", 24141 journal = j-CACM, 24142 volume = "21", 24143 number = "10", 24144 pages = "842--846", 24145 month = oct, 24146 year = "1978", 24147 CODEN = "CACMA2", 24148 ISSN = "0001-0782", 24149 bibdate = "Tue Mar 25 13:26:09 MST 1997", 24150 note = "See corrigendum \cite{McMaster:1979:CAA}.", 24151 abstract = "Solutions to the Dutch National Flag Problem have been given by Dijkstra [1] and Meyer [3]. \par Dijkstra starts with a simple program and arrives at an improved program by refinement. Both of the algorithms given by Dijkstra are shown to have an expected number of swaps which is $2/3N + O(1)$ and that these values differ at most by $1/3$ of a swap and asymptotically by $1/4$ of a swap. The algorithm of Meyer is shown to have expected swap complexity$ 5/9N$.", 24152 acknowledgement = ack-nhfb, 24153 classcodes = "C6110 (Systems analysis and programming)", 24154 corpsource = "Univ. of California, Berkeley, CA, USA", 24155 keywords = "Algorithmic analysis; algorithmic analysis; complete computer programs; Dutch National Flag Problem; program refinement; programming; refinement; structured programming", 24156 treatment = "T Theoretical or Mathematical", 24157 } 24158 24159 @Article{Sedgewick:1978:IQP, 24160 author = "Robert Sedgewick", 24161 title = "Implementing {Quicksort} Programs", 24162 journal = j-CACM, 24163 volume = "21", 24164 number = "10", 24165 pages = "847--857", 24166 month = oct, 24167 year = "1978", 24168 CODEN = "CACMA2", 24169 ISSN = "0001-0782", 24170 bibdate = "Tue Mar 25 13:26:09 MST 1997", 24171 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Database/Graefe.bib", 24172 note = "See corrigendum \cite{Sedgewick:1979:CIQ}.", 24173 abstract = "This paper is a practical study of how to implement the Quicksort sorting algorithm and its best variants on real computers, including how to apply various code optimization techniques. A detailed implementation combining the most effective improvements to Quicksort is given, along with a discussion of how to implement it in assembly language. Analytic results describing the performance of the programs are summarized. A variety of special situations are considered from a practical standpoint to illustrate Quicksort's wide applicability as an internal sorting method which requires negligible extra storage.", 24174 acknowledgement = ack-nhfb, 24175 classcodes = "C6130 (Data handling techniques)", 24176 classification = "723", 24177 corpsource = "Brown Univ., Providence, RI, USA", 24178 journalabr = "Commun ACM", 24179 keywords = "analysis of algorithms; code optimisation techniques; code optimization; computer systems programming; internal; Quicksort; Quicksort programs; sorting; sorting algorithm; sorting method", 24180 treatment = "G General Review", 24181 } 24182 24183 @Article{Lyon:1978:PST, 24184 author = "Gordon Lyon", 24185 title = "Packed Scatter Tables", 24186 journal = j-CACM, 24187 volume = "21", 24188 number = "10", 24189 pages = "857--865", 24190 month = oct, 24191 year = "1978", 24192 CODEN = "CACMA2", 24193 ISSN = "0001-0782", 24194 bibdate = "Tue Mar 25 13:26:09 MST 1997", 24195 bibsource = "Compendex database", 24196 abstract = "Scatter tables for open addressing benefit from recursive entry displacements, cutoffs for unsuccessful searches, and auxiliary cost functions. Compared with conventional methods, the new techniques provide substantially improved tables that resemble exact-solution optimal packings. The displacements are depth-limited approximations to an enumerative (exhaustive) optimization, although packing costs remain linear --- O(n) --- with table size n. The techniques are primarily suited for important fixed (but possibly quite large) tables for which reference frequencies may be known: op-code tables, spelling dictionaries, access arrays. Introduction of frequency weights further improves retrievals, but the enhancement may degrade cutoffs.", 24197 acknowledgement = ack-nhfb, 24198 classcodes = "C6130 (Data handling techniques)", 24199 classification = "723", 24200 corpsource = "Nat. Bur. of Stand., Washington, DC, USA", 24201 journalabr = "Commun ACM", 24202 keywords = "computer systems programming; costs; data handling; open addressing; optimal packings; packed scatter tables; packing; recursion; reference frequencies; scatter tables", 24203 treatment = "G General Review", 24204 } 24205 24206 @Article{Easton:1978:CSV, 24207 author = "Malcolm C. Easton and Ronald Fagin", 24208 title = "Cold-Start Vs. Warm-Start Miss Ratios", 24209 journal = j-CACM, 24210 volume = "21", 24211 number = "10", 24212 pages = "866--872", 24213 month = oct, 24214 year = "1978", 24215 CODEN = "CACMA2", 24216 ISSN = "0001-0782", 24217 bibdate = "Tue Mar 25 13:26:09 MST 1997", 24218 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Misc/storage.bib", 24219 abstract = "In a two-level computer storage hierarchy, miss ratio measurements are often made from a ``cold start'', that is, made with the first-level store initially empty. For large capacities the effect on the measured miss ratio of the misses incurred while filling the first-level store can be significant, even for long reference strings. Use of ``warm-start'' rather than ``cold-start'' miss ratios cast doubt on the widespread belief that the observed ``S-shape'' of lifetime (reciprocal of miss ratio) versus capacity curve indicates a property of behavior of programs that maintain a constant number of pages in main storage. It is shown how to obtain, under simple assumptions, the cache miss ratio for multiprogramming from cold-start miss ratio values and how to obtain approximate cold-start miss ratios from warm-start miss ratios.", 24220 acknowledgement = ack-nhfb, 24221 classcodes = "C6150J (Operating systems)", 24222 classification = "723", 24223 corpsource = "IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA", 24224 journalabr = "Commun ACM", 24225 keywords = "computer operating systems; computer systems programming --- Multiprogramming; memory hierarchy; Performance Evaluation: Analytic", 24226 keywords = "cache miss ratio; cold start; hierarchy; lifetime; lifetime function; miss ratios; multiprogramming; operating systems (computers); storage; warm start", 24227 treatment = "G General Review", 24228 } 24229 24230 @Article{Franta:1978:CHT, 24231 author = "W. R. Franta and Kurt Maly", 24232 title = "A comparison of heaps and the {TL} structure for the simulation event set", 24233 journal = j-CACM, 24234 volume = "21", 24235 number = "10", 24236 pages = "873--875", 24237 month = oct, 24238 year = "1978", 24239 CODEN = "CACMA2", 24240 ISSN = "0001-0782", 24241 bibdate = "Tue Mar 25 13:26:09 MST 1997", 24242 bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1978.bib", 24243 acknowledgement = ack-nhfb, 24244 classcodes = "C1290 (Applications of systems theory); C6130 (Data handling techniques)", 24245 corpsource = "Univ. of Minnesota, Minneapolis, MN, USA", 24246 country = "USA", 24247 descriptors = "Simulation;", 24248 enum = "1005", 24249 keywords = "data handling; event set; heaps; operations research; Simulation; simulation event set; TL structure", 24250 language = "English", 24251 references = "0", 24252 treatment = "G General Review", 24253 } 24254 24255 @Article{Lyons:1978:SDE, 24256 author = "Norman R. Lyons", 24257 title = "Systems Design Education: a Gaming Approach", 24258 journal = j-CACM, 24259 volume = "21", 24260 number = "11", 24261 pages = "889--895", 24262 month = nov, 24263 year = "1978", 24264 CODEN = "CACMA2", 24265 ISSN = "0001-0782", 24266 bibdate = "Tue Mar 25 13:26:09 MST 1997", 24267 bibsource = "Compendex database", 24268 abstract = "One of the problems facing managers of computer installations is the problem of configuring the computer system to meet the demands made by the mix of jobs that the computer center must service. A management game is presented that allows the player to configure a computer system to meet a hypothetical job mix. The job mix is under the control of a game administrator and can be varied to simulate a variety of real-world situations (I/O bound jobs, compute bound jobs, etc. ). The player of the game receives a set of detailed reports on the cost of his choices and a simulated run of the center operating under his choices.", 24269 acknowledgement = ack-nhfb, 24270 classcodes = "C0220 (Computing education and training); C0310 (EDP management)", 24271 classification = "722; 723; 912", 24272 corpsource = "Texas Tech. Univ., Lubbock, TX, USA", 24273 journalabr = "Commun ACM", 24274 keywords = "computer installation; computer installation management; computer installations; computer science education; computer systems, digital; configuring the computer system; cost; DP; management; management game; mix; of jobs", 24275 treatment = "A Application; T Theoretical or Mathematical", 24276 } 24277 24278 @Article{Wendorf:1978:SEM, 24279 author = "J. W. Wendorf", 24280 title = "A Simply Extended and Modified Batch Environment Graphical System (Sembegs)", 24281 journal = j-CACM, 24282 volume = "21", 24283 number = "11", 24284 pages = "897--904", 24285 month = nov, 24286 year = "1978", 24287 CODEN = "CACMA2", 24288 ISSN = "0001-0782", 24289 bibdate = "Tue Mar 25 13:26:09 MST 1997", 24290 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Graphics/imager/imager.78.bib", 24291 abstract = "SEMBEGS is a complete batch environment graphical system containing components for handling graphical data files, for displaying the contents files on a variety of graphical hardware, and for performing graphical batch input operations. SEMBERG is easy to extend and modify to meet the growing needs of a large batch environment, and is even extendable to a fully interactive system. The paper presents the conceptual view of graphics leading to the design of SEMBEGS and outlines the major components of the system. The design of SEMBEGS is founded upon the basic assumption that the true aim of computer graphics is to describe graphical entities, rather than, as commonly held, to provide graphical input and output functional capabilities. SEMBEGS is built around a Basic Graphical Data Management System (BAGDAMS) which provides a common means of communicating the descriptions of graphical entities between the various components of SEMBEGS. BAGDAMS provides facilities for storing, retrieving, and manipulating the descriptions of graphical entities provided by, and received by application programs, graphics packages, and graphical devices.", 24292 acknowledgement = ack-nhfb, 24293 classcodes = "C6130B (Graphics techniques); C6150E (General utility programs)", 24294 classification = "723", 24295 corpsource = "Univ. of Waterloo, Waterloo, Ont., Canada", 24296 journalabr = "Commun ACM", 24297 keywords = "BAGDAMS; Basic Graphical Data; batch; batch environment; batch processing (computers); computer graphics; displaying; extend; files; fully interactive system; graphical batch input operations; graphical data; graphical system; Management System; modify; SEMBEGS", 24298 treatment = "P Practical", 24299 } 24300 24301 @Article{Kumar:1978:PEH, 24302 author = "B. Kumar and E. S. Davidson", 24303 title = "Performance Evaluation of Highly Concurrent Computers by Deterministic Simulation", 24304 journal = j-CACM, 24305 volume = "21", 24306 number = "11", 24307 pages = "904--913", 24308 month = nov, 24309 year = "1978", 24310 CODEN = "CACMA2", 24311 ISSN = "0001-0782", 24312 bibdate = "Tue Mar 25 13:26:09 MST 1997", 24313 bibsource = "Compendex database", 24314 abstract = "Simulation is presented as a practical technique for performance evaluation of alternative configurations of highly concurrent computers. A technique is described for constructing a detailed deterministic simulation model of a system. In the model a control stream replaces the instruction and data streams of the real system. Simulation of the system model yields the timing resource usage statistics needed for performance evaluation, without the necessity of emulating the system. As a case study, the implementation of a simulation of a model of the CPU-memory subsystem of the IBM 360\slash 191 is described. The results of evaluating some alternative system designs are discussed. The experiments reveal that, for the case study, the major bottlenecks in the system are the memory unit and the fixed point unit. Further, it appears that many of the sophisticated pipelining and buffering techniques implemented in the architecture of the IBM 360\slash 91 are of little value when high-speed (cache) memory is used, as in the IBM 360\slash 195.", 24315 acknowledgement = ack-nhfb, 24316 classcodes = "C5220 (Computer architecture); C6150G (Diagnostic, testing, debugging and evaluating systems); C7430 (Computer engineering)", 24317 classification = "722; 723", 24318 corpsource = "Univ. of Illinois, Urbana, IL, USA", 24319 journalabr = "Commun ACM", 24320 keywords = "computer selection and evaluation; computer systems, digital; CPU memory subsystem; deterministic simulation; highly concurrent computers; IBM 360/91; multiprocessing systems; performance evaluation; virtual machines", 24321 treatment = "P Practical", 24322 } 24323 24324 @Article{Horn:1978:USI, 24325 author = "Berthold K. P. Horn and Brett L. Bachman", 24326 title = "Using Synthetic Images to Register Real Images with Surface Models", 24327 journal = j-CACM, 24328 volume = "21", 24329 number = "11", 24330 pages = "914--924", 24331 month = nov, 24332 year = "1978", 24333 CODEN = "CACMA2", 24334 ISSN = "0001-0782", 24335 bibdate = "Tue Mar 25 13:26:09 MST 1997", 24336 bibsource = "Compendex database", 24337 abstract = "A number of image analysis tasks can benefit from registration of the image with a model of the surface being imaged. Automatic navigation using visible light or radar images requires exact alignment of such images with digital terrain models. In addition, automatic classification of terrain, using satellite imagery, requires such alignment to deal correctly with the effects of varying sun angle and surface slope. Even inspection techniques for certain industrial parts may be improved by this means. The required alignment is achieved by matching the real image with a synthetic image obtained from a surface model and known positions of the light sources. The synthetic image intensity is calculated using the reflectance map, a convenient way of describing surface reflection as a function of surface gradient. The technique is illustrated using LANDSAT images and digital terrain models.", 24338 acknowledgement = ack-nhfb, 24339 classcodes = "C6130B (Graphics techniques)", 24340 classification = "723", 24341 corpsource = "MIT, Cambridge, MA, USA", 24342 journalabr = "Commun ACM", 24343 keywords = "automatic classification of terrain; computer graphics; computerised picture processing; image processing; industrial parts; inspection techniques; real images; registration; satellite imagery; surface models; synthetic images", 24344 treatment = "A Application; T Theoretical or Mathematical", 24345 } 24346 24347 @Article{Tadikamalla:1978:CGGb, 24348 author = "P. R. Tadikamalla", 24349 title = "Computer Generation of Gamma Random Variables --- {II}", 24350 journal = j-CACM, 24351 volume = "21", 24352 number = "11", 24353 pages = "925--928", 24354 month = nov, 24355 year = "1978", 24356 CODEN = "CACMA2", 24357 ISSN = "0001-0782", 24358 bibdate = "Tue Mar 25 13:26:09 MST 1997", 24359 bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1978.bib", 24360 acknowledgement = ack-nhfb, 24361 classcodes = "C1140Z (Other topics in statistics); C7310 (Mathematics computing)", 24362 corpsource = "Univ. of Pittsburgh, Pittsburgh, PA, USA", 24363 country = "USA", 24364 descriptors = "RVG;", 24365 enum = "7944", 24366 keywords = "computational; computer generation; core; gamma random variables; nonintegral shape parameter; programming effort; random processes; statistics; storage requirements; times", 24367 language = "English", 24368 references = "0", 24369 treatment = "T Theoretical or Mathematical", 24370 } 24371 24372 @Article{Ripley:1978:SRP, 24373 author = "G. David Ripley", 24374 title = "Simple Recovery-Only Procedure for Simple Precedence Parsers", 24375 journal = j-CACM, 24376 volume = "21", 24377 number = "11", 24378 pages = "928--930", 24379 month = nov, 24380 year = "1978", 24381 CODEN = "CACMA2", 24382 ISSN = "0001-0782", 24383 bibdate = "Tue Mar 25 13:26:09 MST 1997", 24384 bibsource = "Compendex database", 24385 abstract = "A simple method is described enabling simple precedence parsers to recover from syntax errors. No attempt to repair errors is made, yet parsing and most semantic processing can continue. The result is a good ``first approximation'' to syntax error handling with negligible increase in parsing time, space, and complexity of both the parser and its table generator.", 24386 acknowledgement = ack-nhfb, 24387 classcodes = "C4210 (Formal logic); C6150C (Compilers, interpreters and other processors); C6150G (Diagnostic, testing, debugging and evaluating systems)", 24388 classification = "723", 24389 corpsource = "RCA Labs., Princeton, NJ, USA", 24390 journalabr = "Commun ACM", 24391 keywords = "compilers; computer programming languages; debugging; grammars; processing; program compilers; program debugging; recovery; semantic; simple precedence parsers; syntax errors; system; table generator", 24392 treatment = "T Theoretical or Mathematical", 24393 } 24394 24395 @Article{Friedman:1978:NCE, 24396 author = "D. P. Friedman and D. S. Wise", 24397 title = "A Note on Conditional Expressions", 24398 journal = j-CACM, 24399 volume = "21", 24400 number = "11", 24401 pages = "931--933", 24402 month = nov, 24403 year = "1978", 24404 CODEN = "CACMA2", 24405 ISSN = "0001-0782", 24406 bibdate = "Tue Mar 25 13:26:09 MST 1997", 24407 bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/Functional.bib", 24408 abstract = "Evaluation of a conditional expression may succeed even when the ``deciding predicate'' diverges and the alternatives are records (or nodes) whose fields have different content.", 24409 acknowledgement = ack-nhfb, 24410 classcodes = "C4240 (Programming and algorithm theory); C6140D (High level languages)", 24411 corpsource = "Indiana Univ., Bloomington, IN, USA", 24412 keywords = "ambiguous function; conditional expression; conditional forms; functional; if-then-else; infinite structures; LISP; Lisp; LISP; Parallel evaluation; parallel evaluation; programming theory; suspending cons", 24413 treatment = "T Theoretical or Mathematical", 24414 } 24415 24416 @Article{BrinchHansen:1978:DPC, 24417 author = "Per {Brinch Hansen}", 24418 title = "Distributed Processes: {A} Concurrent Programming Concept", 24419 journal = j-CACM, 24420 volume = "21", 24421 number = "11", 24422 pages = "934--941", 24423 month = nov, 24424 year = "1978", 24425 CODEN = "CACMA2", 24426 ISSN = "0001-0782", 24427 bibdate = "Tue Mar 25 13:26:09 MST 1997", 24428 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Misc/os.bib and ftp://ftp.ira.uka.de/pub/bibliography/Parallel/par.synch.bib and ftp://ftp.ira.uka.de/pub/bibliography/Database/Graefe.bib", 24429 abstract = "A language concept for concurrent processes without common variables is introduced. These processes communicate and synchronize by means of procedure calls and guarded regions. This concept is proposed for real-time applications controlled by microcomputer networks with distributed storage. The paper gives several examples of distributed processes and shows that they include procedures, coroutines, classes, monitors, processes, semaphores, buffers, path expressions, and input-output as special cases.", 24430 acknowledgement = ack-nhfb, 24431 annote = "Dated, but it's one of those papers that will always be referenced. This is an early paper which proposes having a Boolean guard at the start of a procedure. The procedure is not allowed to execute until the guard becomes true. This paper is also a reference for the Shortest Job Next (SJN) scheduler.", 24432 classcodes = "C4240 (Programming and algorithm theory); C6140D (High level languages)", 24433 classification = "723", 24434 corpsource = "Univ. of Southern California, Los Angeles, CA, USA", 24435 journalabr = "Commun ACM", 24436 keywords = "buffers; classes; communication; computer programming languages; concurrency; concurrent programming; coroutines; distributed; distributed processes; expressions; guarded command; guarded regions; input/output; k-boolean-guards; k-shortest-job-next; language concept; microcomputer networks; monitors; operating synchronization; parallel processing; path; path expressions; procedure calls; procedures; processes; programming theory; semaphores; storage", 24437 treatment = "T Theoretical or Mathematical", 24438 } 24439 24440 @Article{Luccio:1978:PT, 24441 author = "Fabrizio Luccio and Linda Pagli", 24442 title = "Power Trees", 24443 journal = j-CACM, 24444 volume = "21", 24445 number = "11", 24446 pages = "941--947", 24447 month = nov, 24448 year = "1978", 24449 CODEN = "CACMA2", 24450 ISSN = "0001-0782", 24451 MRclass = "68B10 (68C25)", 24452 MRnumber = "80a:68018", 24453 mrreviewer = "Stephen Soule", 24454 bibdate = "Tue Mar 25 13:26:09 MST 1997", 24455 bibsource = "Compendex database", 24456 abstract = "The new class of PK trees is presented, where height balance is maintained for the nodes lying on particular paths. The number of nodes of a Pk tree asymptotically grows as a power of the height, in the worst case. A procedure for node insertion is given, and the class of trees considered is restricted to IPk trees, which are buildable by such a procedure. The average behavior of such trees, studied by an extensive set of simulation runs, is close to that of AVL trees. In particular, the family of IPO trees whose main advantage is the reduced number of restructurings required after node insertion, is analyzed.", 24457 acknowledgement = ack-nhfb, 24458 classcodes = "C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory); C6120 (File organisation)", 24459 classification = "723; 921", 24460 corpsource = "Univ. of Pisa, Pisa, Italy", 24461 journalabr = "Commun ACM", 24462 keywords = "AVL trees; binary search trees; computer metatheory; computer programming; file organisation; height balance; IP0 trees; IPk trees; mathematical techniques --- Trees; node insertion; Pk trees; power trees; trees (mathematics)", 24463 treatment = "T Theoretical or Mathematical", 24464 } 24465 24466 @Article{Sheil:1978:MST, 24467 author = "B. A. Sheil", 24468 title = "Median Split Trees: {A} Fast Lookup Technique for Frequently Occurring Keys", 24469 journal = j-CACM, 24470 volume = "21", 24471 number = "11", 24472 pages = "947--958", 24473 month = nov, 24474 year = "1978", 24475 CODEN = "CACMA2", 24476 ISSN = "0001-0782", 24477 MRclass = "68H05", 24478 MRnumber = "80a:68116", 24479 bibdate = "Tue Mar 25 13:26:09 MST 1997", 24480 bibsource = "Compendex database", 24481 note = "Early work on minimal perfect hash functions.", 24482 abstract = "Split trees are a new technique for searching sets of keys with highly skewed frequency distributions. A split tree is a binary search tree each node of which contains two key values --- a node value which is a maximally frequent key in that subtree, and a split value which partitions the remaining keys (with respect to their lexical ordering) between the left and right subtrees. A median split tree (MST) uses the lexical median of a node's descendents as its split value to force the search tree to be perfectly balanced, achieving both a space efficient representation of the tree and high search speed. Unlike frequency ordered binary search trees, the cost of a successful search of an MST is log n bounded and very stable around minimal values. Further, an MST can be built for a given key ordering and set of frequencies in time n log n, as opposed to n**2 for an optimum binary search tree. A discussion of the application of MST's to dictionary lookup for English is presented, and the performance obtained is contrasted with that of other techniques.", 24483 acknowledgement = ack-nhfb, 24484 classcodes = "C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory); C6120 (File organisation)", 24485 classification = "723; 921", 24486 corpsource = "Harvard Univ., Cambridge, MA, USA", 24487 journalabr = "Commun ACM", 24488 keywords = "computer programming; fast lookup technique; file organisation; frequently occurring keys; lexical median; mathematical techniques --- Trees; median split tree; searching; trees (mathematics)", 24489 treatment = "T Theoretical or Mathematical", 24490 } 24491 24492 @Article{Hoare:1978:CCS, 24493 author = "C. A. R. Hoare", 24494 title = "Corrigendum: {``Communicating Sequential Processes''}", 24495 journal = j-CACM, 24496 volume = "21", 24497 number = "11", 24498 pages = "958--958", 24499 month = nov, 24500 year = "1978", 24501 CODEN = "CACMA2", 24502 ISSN = "0001-0782", 24503 bibdate = "Sat Jan 18 15:39:32 1997", 24504 note = "See \cite{Hoare:1978:CSP}.", 24505 } 24506 24507 @Article{Freuder:1978:SCE, 24508 author = "Eugene C. Freuder", 24509 title = "Synthesizing Constraint Expressions", 24510 journal = j-CACM, 24511 volume = "21", 24512 number = "11", 24513 pages = "958--966", 24514 month = nov, 24515 year = "1978", 24516 CODEN = "CACMA2", 24517 ISSN = "0001-0782", 24518 MRclass = "68E99", 24519 MRnumber = "80a:68074", 24520 bibdate = "Tue Mar 25 13:26:09 MST 1997", 24521 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Ai/lisp.bib", 24522 note = "Also published as MIT AI MEMO 370, Cambridge, MA, USA, 1976", 24523 abstract = "A constraint network representation is presented for a combinatorial search problem: finding values for a set of variables subject to a set of constraints. A theory of consistency levels in such networks is formulated, which is related to problems of backtrack tree search efficiency. An algorithm is developed that can achieve any level of consistency desired, in order to preprocess the problem for subsequent backtrack search, or to function as an alternative to backtrack search by explicitly determining all solutions.", 24524 acknowledgement = ack-nhfb, 24525 classcodes = "C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", 24526 classification = "723", 24527 corpsource = "Univ. of New Hampshire, Durham, NH, USA", 24528 journalabr = "Commun ACM", 24529 keywords = "combinatorial search; computer programming; constraint network representation; graph colouring; LISP; problem; programming theory; theory of consistency levels", 24530 treatment = "T Theoretical or Mathematical", 24531 } 24532 24533 @Article{Dijkstra:1978:FGC, 24534 author = "Edsger W. Dijkstra and Leslie Lamport and A. J. Martin and C. S. Scholten and E. F. M. Steffens", 24535 title = "On-the-Fly Garbage Collection: An Exercise in Cooperation", 24536 journal = j-CACM, 24537 volume = "21", 24538 number = "11", 24539 pages = "966--975", 24540 month = nov, 24541 year = "1978", 24542 CODEN = "CACMA2", 24543 ISSN = "0001-0782", 24544 bibdate = "Tue Mar 25 13:26:09 MST 1997", 24545 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Misc/Functional.bib and ftp://ftp.ira.uka.de/pub/bibliography/Object/Nierstrasz.bib and ftp://ftp.ira.uka.de/pub/bibliography/Compiler/garbage.collection.bib and ftp://ftp.ira.uka.de/pub/bibliography/Compiler/Heaps.bib", 24546 note = "Also E. W. Dijkstra Note EWD496, June 1975.", 24547 abstract = "As an example of cooperation between sequential processes with very little mutual interference despite frequent manipulations of a large shared data space, a technique is developed which allows nearly all of the activity needed for garbage detection and collection to be performed by an additional processor operating concurrently with the processor devoted to the computation proper. Exclusion and synchronization constraints have been kept as weak as could be achieved; the severe complexities engendered by doing so are illustrated.", 24548 acknowledgement = ack-nhfb, 24549 classcodes = "C6120 (File organisation); C6150J (Operating systems)", 24550 classification = "723", 24551 comment = "much overlooked algorithm, presented as more of a concurrency exercise than a garbage collector", 24552 corpsource = "Burroughs Corp., Al Nuenen, Netherlands", 24553 journalabr = "Commun ACM", 24554 keywords = "computer operating systems; functional garbage collection multiprocessing cooperating sequential processes minimised mutual exclusion correctness concurrency memory", 24555 keywords = "cooperation; garbage detection; multiprogramming; on the fly; sequential processes; storage management", 24556 treatment = "T Theoretical or Mathematical", 24557 } 24558 24559 @Article{Gries:1978:CEP, 24560 author = "David Gries", 24561 title = "Corrigendum: {``An exercise in proving parallel programs correct''}", 24562 journal = j-CACM, 24563 volume = "21", 24564 number = "12", 24565 month = dec, 24566 year = "1978", 24567 CODEN = "CACMA2", 24568 ISSN = "0001-0782", 24569 MRclass = "1048.68B10", 24570 MRnumber = "80b:68022", 24571 bibdate = "Tue Dec 26 13:35:07 1995", 24572 note = "See \cite{Gries:1977:EPP}.", 24573 acknowledgement = ack-nhfb, 24574 } 24575 24576 @Article{Needham:1978:UEA, 24577 author = "Roger M. Needham and Michael D. Schroeder", 24578 title = "Using Encryption for Authentication in Large Networks of Computers", 24579 journal = j-CACM, 24580 volume = "21", 24581 number = "12", 24582 pages = "993--999", 24583 month = dec, 24584 year = "1978", 24585 CODEN = "CACMA2", 24586 ISSN = "0001-0782", 24587 bibdate = "Tue Mar 25 13:26:09 MST 1997", 24588 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib", 24589 abstract = "Use of encryption to achieve authenticated communication in computer networks is discussed. Example protocols are presented for the establishment of authenticated connections, for the management of authenticated mail, and for signature verification and document integrity guarantee. Both conventional and public-key encryption algorithms are considered as the basis for protocols.", 24590 acknowledgement = ack-nhfb, 24591 classcodes = "C5620 (Computer networks and techniques); C6130 (Data handling techniques)", 24592 classification = "723", 24593 corpsource = "Xerox Palo Alto Res. Center, Palo Alto, CA, USA", 24594 journalabr = "Commun ACM", 24595 keywords = "authenticated communication; computer networks; data processing --- Security of Data; document integrity; encryption; guarantee; protocols; public key encryption algorithms; security of data; signature verification", 24596 treatment = "P Practical", 24597 } 24598 24599 @Article{Gries:1978:LSA, 24600 author = "David Gries and Jayadev Misra", 24601 title = "A Linear Sieve Algorithm for Finding Prime Numbers", 24602 journal = j-CACM, 24603 volume = "21", 24604 number = "12", 24605 pages = "999--1003", 24606 month = dec, 24607 year = "1978", 24608 CODEN = "CACMA2", 24609 ISSN = "0001-0782", 24610 MRclass = "10A25 (68C25)", 24611 MRnumber = "80d:10010", 24612 mrreviewer = "D. H. Lehmer", 24613 bibdate = "Tue Mar 25 13:26:09 MST 1997", 24614 bibsource = "Compendex database", 24615 abstract = "A new algorithm is presented for finding all primes between 2 and n. The algorithm executes in time proportional to n (assuming that multiplication of integers not larger than n can be performed in unit time). The method has the same arithmetic complexity as the algorithm presented by N. G. Mairson; however, this version is perhaps simpler and more elegant. It is also easily extended to find the prime factorization of all integers between 2 and n in time proportional to n.", 24616 acknowledgement = ack-nhfb, 24617 classcodes = "C1160 (Combinatorial mathematics); C5230 (Digital arithmetic methods)", 24618 classification = "723", 24619 corpsource = "Cornell Univ., Ithaca, NY, USA", 24620 journalabr = "Commun ACM", 24621 keywords = "computer programming; linear sieve algorithm; number theory; prime factorization; prime numbers", 24622 treatment = "T Theoretical or Mathematical", 24623 } 24624 24625 @Article{Peterson:1978:SOT, 24626 author = "James L. Peterson and James R. Bitner and John H. Howard", 24627 title = "The Selection of Optimal Tab Settings", 24628 journal = j-CACM, 24629 volume = "21", 24630 number = "12", 24631 pages = "1004--1007", 24632 month = dec, 24633 year = "1978", 24634 CODEN = "CACMA2", 24635 ISSN = "0001-0782", 24636 bibdate = "Tue Mar 25 13:26:09 MST 1997", 24637 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Graphics/siggraph/78.bib", 24638 abstract = "A new generation of computer terminals allows tab settings to be selected and set by the computer. This feature can be used to reduce the number of characters that are needed to represent a document for transmission and printing. An algorithm is given for selecting the optimal set of tab stops for minimizing the number of characters transmitted. An implementation of the algorithm has reduced the number of characters transmitted by from 7 to 30 percent, but requires a prepass through the document to compute a matrix used in determining the optimal set of tab stops. The use of fixed tab stops, as a heuristic alternative, can achieve about 80 percent of optimal with no prepass.", 24639 acknowledgement = ack-nhfb, 24640 classcodes = "C6130D (Document processing techniques); C6130 (Data handling techniques)", 24641 classification = "723", 24642 corpsource = "Univ. of Texas, Austin, TX, USA", 24643 journalabr = "Commun ACM", 24644 keywords = "algorithm; computer programming; computer terminals; document; number; of characters; optimal tab settings; printing; selection; transmission; word processing", 24645 treatment = "P Practical", 24646 } 24647 24648 @Article{Wetherbe:1978:SPM, 24649 author = "James C. Wetherbe and V. Thomas Dock", 24650 title = "Strategic Planning Methodology for the Computing Effort in Higher Education: an Empirical Evaluation", 24651 journal = j-CACM, 24652 volume = "21", 24653 number = "12", 24654 pages = "1008--1015", 24655 month = dec, 24656 year = "1978", 24657 CODEN = "CACMA2", 24658 ISSN = "0001-0782", 24659 bibdate = "Tue Mar 25 13:26:09 MST 1997", 24660 bibsource = "Compendex database", 24661 abstract = "The findings of a study designed to address the pressing problems associated with the strategic planning of the computing effort in higher education are presented here. A planning methodology was developed and tested through implementation at a university. Two years after the methodology was implemented, the effectiveness of the planning methodology was assessed in terms of the improvement of the delivery of computing services to the major institutional roles of instruction, research, and administration. Two control institutions were employed to contrast the improvements at the test institution. The results of the research indicate the planning methodology significantly enhanced the delivery of computing services.", 24662 acknowledgement = ack-nhfb, 24663 classcodes = "C0310 (EDP management); C7110 (Educational administration)", 24664 classification = "723; 901", 24665 corpsource = "Univ. of Houston, Houston, TX, USA", 24666 journalabr = "Commun ACM", 24667 keywords = "administration; computing effort; DP management; education; educational computing; higher; instruction; research; strategic planning methodology; university", 24668 treatment = "P Practical", 24669 } 24670 24671 @Article{Ibramsha:1978:DLE, 24672 author = "M. Ibramsha and V. Rajaraman", 24673 title = "Detection of Logical Errors in Decision Table Programs", 24674 journal = j-CACM, 24675 volume = "21", 24676 number = "12", 24677 pages = "1016--1025", 24678 month = dec, 24679 year = "1978", 24680 CODEN = "CACMA2", 24681 ISSN = "0001-0782", 24682 bibdate = "Tue Mar 25 13:26:09 MST 1997", 24683 bibsource = "Compendex database", 24684 abstract = "An algorithm to detect logical errors in a limited-entry decision table and in loop-free programs with embedded decision tables is developed. All the conditions in the decision tables are assumed to be inequalities or equalities relating linear expressions. It is also assumed that actions in a decision table are linear in variables which occur in the condition stub of the decision table (or tables) to which control is transferred from the table. The algorithm is based on determining whether a set of linear inequalities has or does not have a solution. The algorithm is implemented in Fortran IV.", 24685 acknowledgement = ack-nhfb, 24686 classcodes = "C6150G (Diagnostic, testing, debugging and evaluating systems)", 24687 classification = "723", 24688 corpsource = "Indian Inst. of Technol., Kanpur, India", 24689 journalabr = "Commun ACM", 24690 keywords = "computer programming; decision table programs; decision tables; error diagnosis; logical errors; program diagnostics", 24691 treatment = "P Practical", 24692 } 24693 24694 @Article{Martelli:1978:ODT, 24695 author = "Alberto Martelli and Ugo Montanari", 24696 title = "Optimizing Decision Trees Through Heuristically Guided Search", 24697 journal = j-CACM, 24698 volume = "21", 24699 number = "12", 24700 pages = "1025--1039", 24701 month = dec, 24702 year = "1978", 24703 CODEN = "CACMA2", 24704 ISSN = "0001-0782", 24705 MRclass = "68A50", 24706 MRnumber = "58 19444", 24707 bibdate = "Tue Mar 25 13:26:09 MST 1997", 24708 bibsource = "Compendex database", 24709 abstract = "Optimal decision table conversion has been tackled in the literature using two approaches, dynamic programming and branch-and-bound. The former technique is quite effective, but its time and space requirements are independent of how ``easy'' the given table is. Furthermore, it cannot be used to produce good, quasioptimal solutions The branch-and-bound technique uses a good heuristic to direct the search, but is cluttered up by an enormous search space, since the number of solutions increases with the number of test variables according to a double exponential. In this paper authors suggest a heuristically guided top-down search algorithm which, like dynamic programming, recognizes identical subproblems but which can be used to find both optimal and quasioptimal solutions. A heuristic search method is introduced that combines the positive aspects of the above two techniques. Compressed tables with a large number of variables can be handled without deriving expanded tables first.", 24710 acknowledgement = ack-nhfb, 24711 classcodes = "C4240 (Programming and algorithm theory)", 24712 classification = "921", 24713 corpsource = "Consiglio Nazionale delle Ricerche, Pisa, Italy", 24714 journalabr = "Commun ACM", 24715 keywords = "decision table conversion; decision tables; heuristically guided search; mathematical programming, dynamic; optimal; programming theory", 24716 treatment = "T Theoretical or Mathematical", 24717 } 24718 24719 @Article{Dalal:1978:RPF, 24720 author = "Yogen K. Dalal and Robert M. Metcalfe", 24721 title = "Reverse Path Forwarding of Broadcast Packets", 24722 journal = j-CACM, 24723 volume = "21", 24724 number = "12", 24725 pages = "1040--1048", 24726 month = dec, 24727 year = "1978", 24728 CODEN = "CACMA2", 24729 ISSN = "0001-0782", 24730 bibdate = "Tue Mar 25 13:26:09 MST 1997", 24731 bibsource = "Compendex database", 24732 abstract = "A broadcast packet is for delivery to all nodes of a network. Algorithms for accomplishing this delivery through a store-and-forward packet switching computer network include (1) transmission of separately addressed packets, (2) multidestination addressing, (3) hot potato forwarding, (4) spanning tree forwarding, and (5) source based forwarding. To this list of algorithms is added (6) reverse path forwarding, a broadcast routing method which exploits routing procedures and data structures already available for packet switching. Reverse path forwarding is a practical algorithm for broadcast routing in store-and-forward packet switching computer networks. The algorithm is described as being practical because it is not optimal according to metrics developed for its analysis in this paper, and also because it can be implemented in existing networks with less complexity than that required for the known alternatives.", 24733 acknowledgement = ack-nhfb, 24734 classcodes = "C5620 (Computer networks and techniques)", 24735 classification = "723", 24736 corpsource = "Xerox Corp., Palo Alto, CA, USA", 24737 journalabr = "Commun ACM", 24738 keywords = "broadcast packets; broadcast routing; computer networks; packet switching; reverse path forwarding", 24739 treatment = "P Practical", 24740 } 24741 24742 @Article{Guttag:1978:ADT, 24743 author = "John V. Guttag and Ellis Horowitz and David R. Musser", 24744 title = "Abstract Data Types and Software Validation", 24745 journal = j-CACM, 24746 volume = "21", 24747 number = "12", 24748 pages = "1048--1064", 24749 month = dec, 24750 year = "1978", 24751 CODEN = "CACMA2", 24752 ISSN = "0001-0782", 24753 MRclass = "68B15", 24754 MRnumber = "80b:68030", 24755 mrreviewer = "J. Paredaens", 24756 bibdate = "Tue Mar 25 13:26:09 MST 1997", 24757 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Misc/Functional.bib", 24758 abstract = "A data abstraction can be naturally specified using algebraic axioms. The virtue of these axioms is that they permit a representation-independent formal specification of a data type. An example is given which shows how to employ algebraic axioms at successive levels of implementation. First, it is shown how the use of algebraic axiomatizations can simplify the process of proving the correctness of an implementation of an abstract data type. Second, semi-automatic tools are described which can be used both to automate such proofs of correctness and to derive an immediate implementation from the axioms. This implementation allows for limited testing of programs at design time, before a conventional implementation is accomplished.", 24759 acknowledgement = ack-nhfb, 24760 classcodes = "C6120 (File organisation); C6150G (Diagnostic, testing, debugging and evaluating systems)", 24761 classification = "723", 24762 corpsource = "Univ. of Southern California, Los Angeles, CA, USA", 24763 journalabr = "Commun ACM", 24764 keywords = "abstract data type; algebraic axiomatizations; algebraic axioms; computer programming languages; correctness; data abstraction; data structures; functional; program testing; software validation; testing of programs", 24765 treatment = "A Application; T Theoretical or Mathematical", 24766 } 24767 24768 @Article{Spitzen:1978:EHD, 24769 author = "Jay M. Spitzen and Karl N. Levitt and Lawrence Robinson", 24770 title = "An Example of Hierarchical Design and Proof", 24771 journal = j-CACM, 24772 volume = "21", 24773 number = "12", 24774 pages = "1064--1075", 24775 month = dec, 24776 year = "1978", 24777 CODEN = "CACMA2", 24778 ISSN = "0001-0782", 24779 bibdate = "Tue Mar 25 13:26:09 MST 1997", 24780 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Compiler/semantics.bib", 24781 abstract = "Hierarchical programming is being increasingly recognized as helpful in the construction of large programs. Users of hierarchical techniques claim or predict substantial increases in productivity and in the reliability of the programs produced. In this paper we describe a formal method for hierarchical program specification, implementation, and proof. We apply this method to a significant list processing problem and also discuss a number of extensions to current programming languages that ease hierarchical program design and proof.", 24782 acknowledgement = ack-nhfb, 24783 classcodes = "C4240 (Programming and algorithm theory); C6110 (Systems analysis and programming)", 24784 classification = "723", 24785 corpsource = "SRI Internat., Menlo Park, CA, USA", 24786 journalabr = "Commun ACM", 24787 keywords = "computer programming; computer programming languages; data abstraction; hierarchical design; hierarchical program; hierarchical structures; implementation; large programs; list processing; productivity; Program verification; programming languages; proof; reliability; software modules; specification; structured programming", 24788 treatment = "A Application; T Theoretical or Mathematical", 24789 } 24790 24791 @Article{Bentley:1978:MDC, 24792 author = "J. L. Bentley", 24793 title = "Multidimensional Divide-and-Conquer", 24794 journal = j-CACM, 24795 volume = "23", 24796 number = "4", 24797 pages = "214--228", 24798 month = may, 24799 year = "1978", 24800 CODEN = "CACMA2", 24801 ISSN = "0001-0782", 24802 bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Parallel/Multi.bib", 24803 } 24804 24805 @Article{Boyse:1979:IDA, 24806 author = "John W. Boyse", 24807 title = "Interference Detection Among Solids and Surfaces", 24808 journal = j-CACM, 24809 volume = "22", 24810 number = "1", 24811 pages = "3--9", 24812 month = jan, 24813 year = "1979", 24814 CODEN = "CACMA2", 24815 ISSN = "0001-0782", 24816 bibdate = "Tue Mar 25 13:26:09 MST 1997", 24817 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Graphics/imager/imager.79.bib", 24818 abstract = "In many industrial environments it is necessary to determine whether there is interference among components. There are many potential interference problems in products made up of assemblies of components and in product manufacturing and testing. Typically, drawings are used in an attempt to detect such unwanted interferences, but the two-dimensional, static drafting medium does not always show interferences among three-dimensional, moving parts. A computer representation for solids and surfaces and algorithms which carry out interference checking among objects so represented are presented. Objects are represented as polyhedra or as piecewise planar surfaces. Two types of interference checking are discussed: detection of intersections among objects in fixed positions and detection of collisions among objects moving along specified trajectories.", 24819 acknowledgement = ack-nhfb, 24820 classcodes = "C6130B (Graphics techniques); C7440 (Civil and mechanical engineering computing)", 24821 classification = "723", 24822 corpsource = "Computer Sci. Dept., General Motors Res. Labs., Warren, MI, USA", 24823 journalabr = "Commun ACM", 24824 keywords = "CAD; collision detection graphics; components; computer graphics; data processing --- Manufacturing Applications; detection; drawings; industrial environments; interference; interference checking; intersection; manufacturing and testing; mechanical engineering computing; Methodologies; Modeling geometric design/modeling and Algorithmic Aspects intersection determination and solids interface detection; piecewise planar surfaces; polyhedra; potential interference problems; product; solids; surfaces; Techniques", 24825 treatment = "T Theoretical or Mathematical", 24826 } 24827 24828 @Article{Colton:1979:IUC, 24829 author = "Kent W. Colton", 24830 title = "The impact and use of computer technology by the police", 24831 journal = j-CACM, 24832 volume = "22", 24833 number = "1", 24834 pages = "10--20", 24835 month = jan, 24836 year = "1979", 24837 CODEN = "CACMA2", 24838 ISSN = "0001-0782", 24839 bibdate = "Tue Mar 25 13:26:09 MST 1997", 24840 bibsource = "Compendex database", 24841 abstract = "Over the past decade there has been a significant growth in the use of computer technology by U. S. police departments. This growth, however, has been at a slower rate than predicted in the early 1970's. Further, when computer applications extend beyond ``routine'' uses to ``nonroutine'' efforts, such as resource allocation or computer-aided-dispatch systems where the machine begins to become a tool for decision making, strategic planning and person\slash machine interaction, the results of the technology to date have been mixed. Case studies and surveys are discussed which provide insights on the implementation and impact of police computer technology and the relationship of this technology to law enforcement and society.", 24842 acknowledgement = ack-nhfb, 24843 classcodes = "C7130 (Public administration)", 24844 classification = "723", 24845 corpsource = "Public Systems Evaluation, MIT, Cambridge, MA, USA", 24846 journalabr = "Commun ACM", 24847 keywords = "command and control systems; computer aided dispatch; computer technology; computers; data processing --- Governmental Applications; decision; making; person/machine interaction; police; police command and control; police data processing; resource allocation; strategic planning", 24848 treatment = "G General Review", 24849 } 24850 24851 @Article{Bongiovanni:1979:PDB, 24852 author = "Gian Carlo Bongiovanni and Fabrizio Luccio", 24853 title = "Permutation of Data Blocks in a Bubble Memory", 24854 journal = j-CACM, 24855 volume = "22", 24856 number = "1", 24857 pages = "21--25", 24858 month = jan, 24859 year = "1979", 24860 CODEN = "CACMA2", 24861 ISSN = "0001-0782", 24862 MRclass = "68B15", 24863 MRnumber = "80b:68026", 24864 bibdate = "Tue Mar 25 13:26:09 MST 1997", 24865 bibsource = "Compendex database", 24866 abstract = "A common internal organization of bubble memories consists of a set of (minor) loops, connected through another (major) loop. The problem of obtaining any given permutation of the minor loop contents in minimum time is studied in this paper. A lower bound to the number of steps required by a permutation algorithm is derived, and the class of optimum algorithms is identified.", 24867 acknowledgement = ack-nhfb, 24868 classcodes = "C5320E (Storage on stationary magnetic media); C6120 (File organisation)", 24869 classification = "721; 723", 24870 corpsource = "Univ. of Pisa, Pisa, Italy", 24871 journalabr = "Commun ACM", 24872 keywords = "algorithms; bubble memory; computer programming --- Subroutines; data block shift; data blocks; data storage, magnetic; digital storage; file organisation; magnetic film stores; memory loops; optimum; permutation algorithm", 24873 treatment = "T Theoretical or Mathematical", 24874 } 24875 24876 @Article{Sauer:1979:IDD, 24877 author = "Charles H. Sauer and K. Mani Chandy", 24878 title = "The Impact of Distributions and Disciplines on Multiple Processor Systems", 24879 journal = j-CACM, 24880 volume = "22", 24881 number = "1", 24882 pages = "25--34", 24883 month = jan, 24884 year = "1979", 24885 CODEN = "CACMA2", 24886 ISSN = "0001-0782", 24887 bibdate = "Tue Mar 25 13:26:09 MST 1997", 24888 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1979.bib", 24889 abstract = "Simple queueing models are used to study the performance tradeoffs of multiple processor systems. Issues considered include the impact of CPU service disciplines and distributions, level of multiprogramming, multitasking, and job priorities.", 24890 acknowledgement = ack-nhfb, 24891 annote = "(VBI-000696)", 24892 classcodes = "C5420 (Mainframes and minicomputers); C6150J (Operating systems)", 24893 classification = "722; 723", 24894 corpsource = "IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA", 24895 country = "USA", 24896 descriptors = "Multiprocessor; queueing discipline;", 24897 enum = "11092", 24898 journalabr = "Commun ACM", 24899 keywords = "computer systems programming --- Multiprogramming; computer systems, digital; CPU service; job; multiple processor systems; multiprocessing systems; multiprogramming; multitasking; performance; priorities; queueing models; queueing theory; tradeoffs", 24900 language = "English", 24901 references = "0", 24902 treatment = "G General Review; T Theoretical or Mathematical", 24903 } 24904 24905 @Article{Banatre:1979:ECT, 24906 author = "J. P. Ban{\^a}tre and J. P. Routeau and L. Trilling", 24907 title = "An event-driven compiling technique", 24908 journal = j-CACM, 24909 volume = "22", 24910 number = "1", 24911 pages = "34--42", 24912 month = jan, 24913 year = "1979", 24914 CODEN = "CACMA2", 24915 ISSN = "0001-0782", 24916 bibdate = "Tue Mar 25 13:26:09 MST 1997", 24917 bibsource = "Compendex database", 24918 abstract = "Due to the linear structure of source text, difficulties may arise in a one-pass compilation process. These difficulties occur when an entity cannot be processed because of a forward reference to information only obtainable from subsequent entities. Classic solutions ask for data structures appropriate for each case. A technique is presented which uses instead control structures, namely events and processes. The work of the compiler-writer becomes easier both conceptually and in practice because he can forget these problems at the outset and he avoids special processing for each problem. This technique has been applied to the construction of an Algol 68 compiler. Three examples from that implementation are described and discussed here.", 24919 acknowledgement = ack-nhfb, 24920 classcodes = "C6120 (File organisation); C6150C (Compilers, interpreters and other processors)", 24921 classification = "723", 24922 corpsource = "Univ. de Rennes, Rennes, France", 24923 journalabr = "Commun ACM", 24924 keywords = "ALGOL 68 compiler; compilation; computer operating systems --- Program Compilers; computer programming languages; control structures; data; data structures; forward reference to information; one pass; program compilers; semantic analysis; source text; structures", 24925 treatment = "G General Review; P Practical", 24926 } 24927 24928 @Article{Arsac:1979:SSS, 24929 author = "Jacques J. Arsac", 24930 title = "Syntactic Source to Source Transforms and Program Manipulation", 24931 journal = j-CACM, 24932 volume = "22", 24933 number = "1", 24934 pages = "43--54", 24935 month = jan, 24936 year = "1979", 24937 CODEN = "CACMA2", 24938 ISSN = "0001-0782", 24939 bibdate = "Tue Mar 25 13:26:09 MST 1997", 24940 bibsource = "Compendex database", 24941 abstract = "Syntactic transforms are the source to source program transformations which preserve the history of computation, and thus do not modify the execution time. Combined with a small number of primitive semantic transforms, they provide a powerful tool for program manipulation. A complete catalogue of syntactic transforms, and its use for solution of a system of program equations, is given. Examples of derivation of more complex source to source transformations are also presented. Two case studies illustrate the way in which syntactic and semantic source to source transformations may be used for development of clear, simple, and reasonably efficient programs.", 24942 acknowledgement = ack-nhfb, 24943 classcodes = "C4240 (Programming and algorithm theory); C6110 (Systems analysis and programming)", 24944 classification = "723", 24945 corpsource = "Inst. de Programmation, Univ. Pierre et Marie Curie, Paris, France", 24946 journalabr = "Commun ACM", 24947 keywords = "computer programming; program manipulation; program transformations; programming theory; semantic transforms; source to source; source transforms; structured programming; syntactic; transforms", 24948 treatment = "T Theoretical or Mathematical", 24949 } 24950 24951 @Article{Taulbee:1979:PEP, 24952 author = "O. E. Taulbee and S. D. Conte", 24953 title = "Production and employment of {Ph.D.s} in computer science --- 1977 and 1978", 24954 journal = j-CACM, 24955 volume = "22", 24956 number = "2", 24957 pages = "75--76", 24958 month = feb, 24959 year = "1979", 24960 CODEN = "CACMA2", 24961 ISSN = "0001-0782", 24962 bibdate = "Tue Mar 25 13:26:09 MST 1997", 24963 acknowledgement = ack-nhfb, 24964 classcodes = "C0220 (Computing education and training)", 24965 corpsource = "Univ. of Pittsburgh, Pittsburgh, PA, USA", 24966 keywords = "1977; 1978; computer science; computer science education; employment; Ph.Ds", 24967 treatment = "G General Review", 24968 } 24969 24970 @Article{Fairley:1979:ECD, 24971 author = "R. E. Fairley", 24972 title = "Employment characteristics of doctoral level computer scientists", 24973 journal = j-CACM, 24974 volume = "22", 24975 number = "2", 24976 pages = "77--78", 24977 month = feb, 24978 year = "1979", 24979 CODEN = "CACMA2", 24980 ISSN = "0001-0782", 24981 bibdate = "Tue Mar 25 13:26:09 MST 1997", 24982 acknowledgement = ack-nhfb, 24983 classcodes = "C0230 (Economic, social and political aspects of computing)", 24984 corpsource = "Colorado State Univ., Fort Collins, CO, USA", 24985 keywords = "academic; business; computer scientists; doctoral; employment; industry; opportunities; Ph.D.; professional aspects; work activities", 24986 treatment = "G General Review", 24987 } 24988 24989 @Article{Gull:1979:RDS, 24990 author = "W. E. Gull and M. A. Jenkins", 24991 title = "Recursive data structures in {APL.}", 24992 journal = j-CACM, 24993 volume = "22", 24994 number = "2", 24995 pages = "79--96", 24996 month = feb, 24997 year = "1979", 24998 CODEN = "CACMA2", 24999 ISSN = "0001-0782", 25000 MRclass = "68B15 (68E10 68H05)", 25001 MRnumber = "80b:68028", 25002 bibdate = "Tue Mar 25 13:26:09 MST 1997", 25003 bibsource = "Compendex database", 25004 abstract = "A mathematical study of three approaches for defining nested array in APL is presented. Theorems exhibiting the relationships between the definitional systems are given and illustrated through graph representations. One of the approaches is used to define an APL array to be a recursive data structure equivalent to a tree structure in which all data is stored at the leaves as homogeneous arrays of numbers and characters. An extension of APL is proposed that includes new primitive functions to manipulate the nesting level of arrays and new operators to assist in the construction of data-driven algorithms.", 25005 acknowledgement = ack-nhfb, 25006 classcodes = "C6120 (File organisation); C6140D (High level languages)", 25007 classification = "723", 25008 corpsource = "Univ. Zurich, Zurich, Switzerland", 25009 journalabr = "Commun ACM", 25010 keywords = "APL; computer programming languages; data structures; functions; nested arrays; primitive; procedure oriented languages; recursive data structure", 25011 treatment = "T Theoretical or Mathematical", 25012 } 25013 25014 @Article{Morel:1979:GOS, 25015 author = "{\'E}. Morel and C. Renvoise", 25016 title = "Global Optimization by Suppression of Partial Redundancies", 25017 journal = j-CACM, 25018 volume = "22", 25019 number = "2", 25020 pages = "96--103", 25021 month = feb, 25022 year = "1979", 25023 CODEN = "CACMA2", 25024 ISSN = "0001-0782", 25025 MRclass = "68B05", 25026 MRnumber = "80b:68016", 25027 bibdate = "Tue Mar 25 13:26:09 MST 1997", 25028 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Compiler/opt.compiler.bib", 25029 note = "Data Flow Analysis", 25030 abstract = "The elimination of redundant computations and the moving of invariant computations out of loops are often done separately, with invariants moved outward loop by loop. It is proposed to do both at once and to move each expression directly to the entrance of the outermost loop in which it is invariant. This is done by solving a more general problem, i.e. the elimination of computations performed twice on a given execution path. Such computations are termed partially redundant. Moreover, the algorithm does not require any graphical information or restrictions on the shape of the program graph. Testing this algorithm has shown that its execution cost is nearly linear with the size of the program, and that it leads to a smaller optimizer that requires less execution time.", 25031 acknowledgement = ack-nhfb, 25032 classcodes = "C4240 (Programming and algorithm theory); C6150C (Compilers, interpreters and other processors)", 25033 classification = "723", 25034 corpsource = "Compagnie Internat. pour l'Informatique, Honeywell Bull, Louveciennes, France", 25035 journalabr = "Commun ACM", 25036 keywords = "computer programming; execution cost; execution time; optimizer; partial redundancies; program; program compilers; programming theory; redundant computations", 25037 treatment = "T Theoretical or Mathematical", 25038 } 25039 25040 @Article{Anderson:1979:CPH, 25041 author = "M. R. Anderson and M. G. Anderson", 25042 title = "Comments on Perfect Hashing Functions: {A} Single Probe Retrieving Method for Static Sets", 25043 journal = j-CACM, 25044 volume = "22", 25045 number = "2", 25046 pages = "104--105", 25047 month = feb, 25048 year = "1979", 25049 CODEN = "CACMA2", 25050 ISSN = "0001-0782", 25051 bibdate = "Tue Mar 25 13:26:09 MST 1997", 25052 note = "Corrects errors in \cite{Sprugnoli:1977:PHF}. See corrigendum \cite{Anderson:1979:CCP}.", 25053 acknowledgement = ack-nhfb, 25054 classcodes = "C6130 (Data handling techniques)", 25055 corpsource = "Dept. of Computer and Communication Sci., Univ. of Michigan, Ann Arbor, MI, USA", 25056 keywords = "algorithm; data handling; perfect hashing functions; single probe retrieving method; static sets", 25057 treatment = "T Theoretical or Mathematical", 25058 } 25059 25060 @Article{Cheriton:1979:TPR, 25061 author = "David R. Cheriton and Michael A. Malcolm and Lawrence S. Melen and Gary R. Sager", 25062 title = "{Thoth}, a Portable Real-Time Operating System", 25063 journal = j-CACM, 25064 volume = "22", 25065 number = "2", 25066 pages = "105--115", 25067 month = feb, 25068 year = "1979", 25069 CODEN = "CACMA2", 25070 ISSN = "0001-0782", 25071 bibdate = "Tue Mar 25 13:26:09 MST 1997", 25072 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Database/Graefe.bib", 25073 abstract = "Thoth is a real-time operating system which is designed to be portable over a large set of machines. It is currently running on two minicomputers with quite different architectures. Both the system and application programs which use it are written in a high-level language. Because the system is implemented by the same software on different hardware, it has the same interface to user programs. Hence, application programs which use Thoth are highly portable. Thoth encourages structuring programs as networks of communicating processes by providing efficient interprocess communication primitives.", 25074 acknowledgement = ack-nhfb, 25075 classcodes = "C6150J (Operating systems)", 25076 classification = "723", 25077 corpsource = "Dept. of Computer Sci., Univ. of Waterloo, Waterloo, Ont., Canada", 25078 journalabr = "Commun ACM", 25079 keywords = "CACM synchronization communication real time; computer operating systems; minicomputers; online; online operation; operating system; portable; real time; software portability; Thoth", 25080 treatment = "P Practical", 25081 } 25082 25083 @Article{Reed:1979:SES, 25084 author = "David P. Reed and Rajendra K. Kanodia", 25085 title = "Synchronization with Eventcounts and Sequencers", 25086 journal = j-CACM, 25087 volume = "22", 25088 number = "2", 25089 pages = "115--123", 25090 month = feb, 25091 year = "1979", 25092 CODEN = "CACMA2", 25093 ISSN = "0001-0782", 25094 bibdate = "Tue Mar 25 13:26:09 MST 1997", 25095 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib; ftp://ftp.ira.uka.de/pub/bibliography/Parallel/par.synch.bib", 25096 abstract = "Synchronization of concurrent processes requires controlling the relative ordering of events in the processes. A new synchronization mechanism is proposed, using abstract objects called eventcounts and sequencers, that allows processes to control the ordering of events directly, rather than using mutual exclusion to protect manipulation of shared variables that control ordering of events. Direct control of ordering seems to simplify correctness arguments and also simplifies implementation in distributed systems. The mechanism is defined formally, and then several examples of its uses are given. The relationship of the mechanism to protection mechanisms in the system is explained; in particular, eventcounts are shown to be applicable to situations where confinement of information matters. An implementation of eventcounts and sequencers in a system with shared memory is described.", 25097 acknowledgement = ack-nhfb, 25098 annote = "Dated, but needs to be referenced every now and again.", 25099 classcodes = "C6150J (Operating systems)", 25100 classification = "723", 25101 corpsource = "Lab. for Computer Sci., MIT, Cambridge, MA, USA", 25102 journalabr = "Commun ACM", 25103 keywords = "computer systems programming; concurrent processes; distributed systems; eventcounts; operating systems (computers); protection; sequences; shared memory; synchronization", 25104 treatment = "T Theoretical or Mathematical", 25105 } 25106 25107 @Article{Mendelson:1979:OSA, 25108 author = "Haim Mendelson and Joseph S. Pliskin and Uri Yechiali", 25109 title = "Optimal Storage Allocation for Serial Files", 25110 journal = j-CACM, 25111 volume = "22", 25112 number = "2", 25113 pages = "124--130", 25114 month = feb, 25115 year = "1979", 25116 CODEN = "CACMA2", 25117 ISSN = "0001-0782", 25118 MRclass = "68B15", 25119 MRnumber = "80b:68032", 25120 bibdate = "Tue Mar 25 13:26:09 MST 1997", 25121 bibsource = "Compendex database", 25122 abstract = "A computer system uses several serial files. The files reside on a direct-access storage device in which storage space is limited. Records are added to the files either by jobs in batch processing mode, or by on-line transactions. Each transaction (or job) generates a demand vector which designates the space required in each file for record addition. Whenever one file runs out of space, the system must be reorganized. This paper considers several criteria for best allocating storage space to the files.", 25123 acknowledgement = ack-nhfb, 25124 classcodes = "C6120 (File organisation)", 25125 classification = "723", 25126 corpsource = "Dept. of Statistics, Tel Aviv Univ., Tel Aviv, Israel", 25127 journalabr = "Commun ACM", 25128 keywords = "computer operating systems; optimal; serial files; storage allocation", 25129 treatment = "T Theoretical or Mathematical", 25130 } 25131 25132 @Article{Austing:1979:CRU, 25133 author = "Richard H. Austing and Bruce H. Barnes and Della T. Bonnette and Gerald L. Engel and Gordon Stokes", 25134 title = "Curriculum '78: Recommendations for the Undergraduate Program in Computer Science --- {A} Report of the {ACM} Curriculum Committee on Computer Science", 25135 journal = j-CACM, 25136 volume = "22", 25137 number = "3", 25138 pages = "147--166", 25139 month = mar, 25140 year = "1979", 25141 CODEN = "CACMA2", 25142 ISSN = "0001-0782", 25143 bibdate = "Tue Mar 25 13:26:09 MST 1997", 25144 bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib", 25145 acknowledgement = ack-nhfb, 25146 annote = "A report of the ACM Curriculum Committee on Computer Science. CS 5: Introduction to File Processing (3-0-3) Prerequisite: CS 2. The objectives of this course are: (a) to introduce concepts and techniques of structuring data on bulk storage devices; (2) to provide experience in the use of bulk storage devices; and (3) to provide the foundation for applications of data structures and file processing techniques.", 25147 classcodes = "C0220 (Computing education and training)", 25148 corpsource = "Univ. of Maryland, College Park, MD, USA", 25149 keywords = "computer science; computer science education; courses; curriculum; education; educational courses; elementary level; intermediate level; undergraduate program", 25150 treatment = "G General Review; P Practical", 25151 } 25152 25153 @Article{Edgar:1979:FMN, 25154 author = "Albert D. Edgar and Samuel C. Lee", 25155 title = "{FOCUS} microcomputer number system", 25156 journal = j-CACM, 25157 volume = "22", 25158 number = "3", 25159 pages = "166--177", 25160 month = mar, 25161 year = "1979", 25162 CODEN = "CACMA2", 25163 ISSN = "0001-0782", 25164 bibdate = "Tue Mar 25 13:26:09 MST 1997", 25165 bibsource = "Compendex database", 25166 abstract = "FOCUS is a number system and supporting computational algorithms especially useful for microcomputer control and other signal processing applications. FOCUS has the wide-ranging character of floating-point numbers with a uniformity of state distributions that give FOCUS better than a twofold accuracy advantage over an equal word length floating-point system. FOCUS computations are typically five times faster than single precision fixed-point or integer arithmetic for a mixture of operations, comparable in speed with hardware arithmetic for many applications. Algorithms for 8-bit and 16-bit implementations of FOCUS are included.", 25167 acknowledgement = ack-nhfb, 25168 classcodes = "C5230 (Digital arithmetic methods); C5250 (Microcomputer techniques)", 25169 classification = "723", 25170 corpsource = "Univ. of Oklahoma, Norman, OK, USA", 25171 journalabr = "Commun ACM", 25172 keywords = "algorithms; arithmetic; computational; computers, microprocessor; digital arithmetic; floating point numbers; FOCUS; microcomputer; microcomputer control; microcomputers; number system; signal processing", 25173 treatment = "P Practical", 25174 } 25175 25176 @Article{Slagle:1979:ESA, 25177 author = "James Slagle", 25178 title = "Experiments with Some Algorithms that Find Central Solutions for Pattern Classification", 25179 journal = j-CACM, 25180 volume = "22", 25181 number = "3", 25182 pages = "178--183", 25183 month = mar, 25184 year = "1979", 25185 CODEN = "CACMA2", 25186 ISSN = "0001-0782", 25187 bibdate = "Tue Mar 25 13:26:09 MST 1997", 25188 bibsource = "Compendex database", 25189 abstract = "In two-class pattern recognition, it is a standard technique to have an algorithm finding hyperplanes which separates the two classes in a linearly separable training set. The traditional methods find a hyperplane which separates all points in one class from all points in the other, but such a hyperplane is not necessarily centered in the empty space between the two classes. Since a central hyperplane does not favor one class or the other, it should have a lower error rate in classifying new points and is therefore better than a noncentral hyperplane. Six algorithms for finding central hyperplanes are tested on three data sets. Although frequently used in practice, the modified relaxation algorithm is very poor. Three algorithms which are defined in the paper are found to be quite good.", 25190 acknowledgement = ack-nhfb, 25191 classcodes = "B6140C (Optical information, image and video signal processing); C1250 (Pattern recognition)", 25192 classification = "723", 25193 corpsource = "Naval Res. Lab., Washington, DC, USA", 25194 journalabr = "Commun ACM", 25195 keywords = "algorithms; central solutions; pattern classification; pattern recognition; pattern recognition systems", 25196 treatment = "T Theoretical or Mathematical", 25197 } 25198 25199 @Article{Deliyanni:1979:LSN, 25200 author = "Amaryllis Deliyanni and Robert A. Kowalski", 25201 title = "Logic and Semantic Networks", 25202 journal = j-CACM, 25203 volume = "22", 25204 number = "3", 25205 pages = "184--192", 25206 month = mar, 25207 year = "1979", 25208 CODEN = "CACMA2", 25209 ISSN = "0001-0782", 25210 bibdate = "Tue Mar 25 13:26:09 MST 1997", 25211 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Ai/nonmono.bib", 25212 abstract = "An extended form of semantic network is defined, which can be regarded as a syntactic variant of the clausal form of logic. By virtue of its relationship with logic,the extended semantic network is provided with a precise semantics, inference rules, and a procedural interpretation. On the other hand, by regarding semantic networks as an abstract data structure for the representation of clauses, we provide a theorem-prover with a potentially useful indexing scheme and path-following strategy for guiding the search for a proof.", 25213 acknowledgement = ack-nhfb, 25214 classcodes = "C1230 (Artificial intelligence); C4210 (Formal logic)", 25215 classification = "723", 25216 corpsource = "Univ. of Athens, Athens, Greece", 25217 journalabr = "Commun ACM", 25218 keywords = "abstract data; computer metatheory; formal logic; inference rules; logic; semantic networks; structure; theorem prover; theorem proving", 25219 treatment = "T Theoretical or Mathematical", 25220 } 25221 25222 @Article{Motzkin:1979:UNM, 25223 author = "Dalia Motzkin", 25224 title = "Use of Normal Multiplication Tables for Information Storage and Retrieval", 25225 journal = j-CACM, 25226 volume = "22", 25227 number = "3", 25228 pages = "193--207", 25229 month = mar, 25230 year = "1979", 25231 CODEN = "CACMA2", 25232 ISSN = "0001-0782", 25233 bibdate = "Tue Mar 25 13:26:09 MST 1997", 25234 bibsource = "Compendex database", 25235 abstract = "A method is described for the organization and retrieval of attribute based information systems, using the normal multiplication table as a directory for the information system. Algorithms for the organization and retrieval of information are described. This method is particularly suitable for queries requesting a group of information items, all of which possess a particular set of attributes (and possibly some other attributes as well). Several examples are given; the results with respect to the number of disk accesses and disk space are compared to other common approaches. Algorithms evaluating the appropriateness of the above approach to a given information system are described. For a certain class of information systems, the normal multiplication table method yields far more rapid retrieval with a more economical space requirement than conventional systems. Moreover this method incorporates an improved modification of the inverted file technique.", 25236 acknowledgement = ack-nhfb, 25237 classcodes = "C6120 (File organisation)", 25238 classification = "723; 901", 25239 corpsource = "Univ. of Haifa, Haifa, Israel", 25240 journalabr = "Commun ACM", 25241 keywords = "attribute based information systems; directory; disk accesses; disk space; file organisation; information retrieval; information retrieval systems; information storage; inverted file; normal multiplication tables; retrieval; storage allocation", 25242 treatment = "T Theoretical or Mathematical", 25243 } 25244 25245 @Article{McMaster:1979:CAA, 25246 author = "C. L. McMaster", 25247 title = "Corrigendum: {``An Analysis of Algorithms for the Dutch National Flag Problem''}", 25248 journal = j-CACM, 25249 volume = "22", 25250 number = "3", 25251 pages = "207--207", 25252 month = mar, 25253 year = "1979", 25254 CODEN = "CACMA2", 25255 ISSN = "0001-0782", 25256 bibdate = "Sat Jan 18 15:42:53 1997", 25257 note = "See \cite{McMaster:1978:AAD}.", 25258 } 25259 25260 @Article{Lesk:1979:DTP, 25261 author = "Arthur M. Lesk", 25262 title = "Detection of Three-Dimensional Patterns of Atoms in Chemical Structures", 25263 journal = j-CACM, 25264 volume = "22", 25265 number = "4", 25266 pages = "219--224", 25267 month = apr, 25268 year = "1979", 25269 CODEN = "CACMA2", 25270 ISSN = "0001-0782", 25271 bibdate = "Tue Mar 25 13:26:09 MST 1997", 25272 bibsource = "Compendex database", 25273 abstract = "An algorithm for detecting occurrences of a three-dimensional pattern of objects within a larger structure is presented. The search technique presented used the geometric structure of the pattern to define characteristics demanded of candidates for matching. This is useful in cases where the properties of each atom, considered individually, do not adequately limit the number of sets of possible matchings. Several applications of this technique in the field of chemistry are: (1) in pharmacology: Searching for a common constellation of atoms in molecules possessing similar biological activities; (2) in X-ray crystallography: fitting a structure or a structural fragment to a set of peaks in the electron-density distribution of a Fourier map; (3) in chemical documentation: retrieving from a file the structures containing specified substructures.", 25274 acknowledgement = ack-nhfb, 25275 classcodes = "C7320 (Physics and chemistry computing)", 25276 classification = "462; 482; 501; 723; 804; 901", 25277 corpsource = "Fairleigh Dickinson Univ., Teaneck, NJ, USA", 25278 journalabr = "Commun ACM", 25279 keywords = "atoms; chemical documentation; chemical structures; chemistry computing; crystallography; crystallography --- X-Ray Analysis; drug products; information science --- Information Retrieval; pattern recognition; pattern recognition systems; pharmacology; search; three dimensional; X-ray", 25280 treatment = "A Application", 25281 } 25282 25283 @Article{Cale:1979:PPP, 25284 author = "E. G. Cale and L. L. Gremillion and J. L. McKenney", 25285 title = "Price\slash Performance Patterns of {U.S.} Computer Systems", 25286 journal = j-CACM, 25287 volume = "22", 25288 number = "4", 25289 pages = "225--233", 25290 month = apr, 25291 year = "1979", 25292 CODEN = "CACMA2", 25293 ISSN = "0001-0782", 25294 bibdate = "Tue Mar 25 13:26:09 MST 1997", 25295 bibsource = "Compendex database", 25296 abstract = "Econometric models of the U. S. computer market have been developed to study the relationships between system price and hardware performance. Single measures of price-performance such as ``Grosch's Law'' are shown to be so oversimplified as to be meaningless. Multiple-regression models predicting system cost as a function of several hardware characteristics do, however, reveal a market dichotomy. On one hand there exists a stable, price predictable market for larger, general purpose computer systems. The other market is the developing one for small business computer systems, a market which is relatively unstable with low price predictability.", 25297 acknowledgement = ack-nhfb, 25298 classcodes = "C0230 (Economic, social and political aspects of computing)", 25299 classification = "722", 25300 corpsource = "Harvard Univ., Boston, MA, USA", 25301 journalabr = "Commun ACM", 25302 keywords = "computer market; digital computers; hardware performance; price predictability; price/performance; system price; US", 25303 keywords = "computer systems, digital", 25304 treatment = "E Economic", 25305 } 25306 25307 @Article{Bucci:1979:MDD, 25308 author = "Giacomo Bucci and Donald N. Streeter", 25309 title = "Methodology for the Design of Distributed Information Systems", 25310 journal = j-CACM, 25311 volume = "22", 25312 number = "4", 25313 pages = "233--245", 25314 month = apr, 25315 year = "1979", 25316 CODEN = "CACMA2", 25317 ISSN = "0001-0782", 25318 bibdate = "Tue Mar 25 13:26:09 MST 1997", 25319 bibsource = "Compendex database", 25320 abstract = "A macro model of a distributed information system is presented. The model describes the major costs of using an information system from the perspective of the end-user. The model is intended to provide guidance to the system designer by making evident the effect of various design and operating parameters on overall cost per transaction. The technique is illustrated by application to the design of an interactive transaction processing system.", 25321 acknowledgement = ack-nhfb, 25322 classcodes = "C6110 (Systems analysis and programming)", 25323 classification = "722", 25324 corpsource = "IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA", 25325 journalabr = "Commun ACM", 25326 keywords = "computer systems, digital; costs; design; distributed information systems; distributed processing; macro; methodology; model; systems analysis", 25327 treatment = "A Application; T Theoretical or Mathematical", 25328 } 25329 25330 @Article{Hanson:1979:MPU, 25331 author = "Richard J. Hanson and John A. Wisniewski", 25332 title = "A Mathematical Programming Updating Method Using Modified {Givens} Transformations and Applied to {LP} Problems", 25333 journal = j-CACM, 25334 volume = "22", 25335 number = "4", 25336 pages = "245--251", 25337 month = apr, 25338 year = "1979", 25339 CODEN = "CACMA2", 25340 ISSN = "0001-0782", 25341 MRclass = "90C05 (65F35)", 25342 MRnumber = "80c:90096", 25343 bibdate = "Tue Mar 25 13:26:09 MST 1997", 25344 bibsource = "Compendex database", 25345 abstract = "An efficient and numerically stable method is presented for the problem of updating an orthogonal decomposition of a matrix of column (or row) vectors. The fundamental idea is to add a column (or row) analogous to adding an additional row of data in linear least squares problem. A column (or row) is dropped by a formal scaling with the imaginary unit, followed by least squares addition of the column (or row). The elimination process for the procedure is successive application of the Givens transformation in modified (more efficient) form. These ideas are illustrated with an implementation of the revised simplex method. The algorithm is a general purpose one that does not account for any particular structure or sparsity in the equations. Some suggested computational tests for determining signs of various controlling parameters in the revised simplex algorithm are mentioned. A simple means of constructing test cases and some sample computing times are presented.", 25346 acknowledgement = ack-nhfb, 25347 classcodes = "C1180 (Optimisation techniques)", 25348 classification = "723", 25349 corpsource = "Sandia Labs., Albuquerque, NM, USA", 25350 journalabr = "Commun ACM", 25351 keywords = "linear programming; mathematical programming; mathematical programming, linear; modified Givens; revised simplex; transformations; updating", 25352 treatment = "T Theoretical or Mathematical", 25353 } 25354 25355 @Article{Brelaz:1979:NMC, 25356 author = "Daniel Br{\'e}laz", 25357 title = "New Methods to Color the Vertices of a Graph", 25358 journal = j-CACM, 25359 volume = "22", 25360 number = "4", 25361 pages = "251--256", 25362 month = apr, 25363 year = "1979", 25364 CODEN = "CACMA2", 25365 ISSN = "0001-0782", 25366 MRclass = "90B35", 25367 MRnumber = "80c:90080", 25368 mrreviewer = "G. Berman", 25369 bibdate = "Tue Mar 25 13:26:09 MST 1997", 25370 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Theory/clique.color.bib", 25371 abstract = "Efficient new heuristic methods to color the vertices of a graph are described which rely upon the comparison of the degrees and structure of a graph. A method is developed which is exact for bipartite graphs and is an important part of heuristic procedures to find maximal cliques in general graphs. Finally an exact method is given which performs better than the Randall-Brown algorithm and is able to color larger graphs, and the new heuristic methods, the classical methods, and the exact method are compared.", 25372 acknowledgement = ack-nhfb, 25373 annote = "Successive augmentation approach to graph coloring. DSATUR chooses the vertex adjacent to the largest number of distinctly colored vertices. Paper also discusses an implicit enumeration scheme for finding an optimal coloring using some of the principles of DSATUR to guide the search.", 25374 classcodes = "C1160 (Combinatorial mathematics)", 25375 classification = "912; 921", 25376 corpsource = "Ecole Polytech. Federale de Lausanne, Lausanne, Switzerland", 25377 journalabr = "Commun ACM", 25378 keywords = "bipartite graphs; cliques; colouring; graph; graph colouring; heuristic; mathematical techniques --- Graph Theory; maximal; operations research; vertices", 25379 treatment = "T Theoretical or Mathematical", 25380 } 25381 25382 @Article{DeMillo:1979:SPP, 25383 author = "Richard A. {De Millo} and Richard J. Lipton and Alan J. Perlis", 25384 title = "Social Processes and Proofs of Theorems and Programs", 25385 journal = j-CACM, 25386 volume = "22", 25387 number = "5", 25388 pages = "271--280", 25389 month = may, 25390 year = "1979", 25391 CODEN = "CACMA2", 25392 ISSN = "0001-0782", 25393 bibdate = "Tue Mar 25 13:26:09 MST 1997", 25394 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Misc/softeng.bib", 25395 abstract = "It is argued that formal verifications of programs, no matter how obtained, will not play the same key role in the development of computer science and software engineering as proofs do in mathematics. Furthermore the absence of continuity, the inevitability of change, and the complexity of specification of significantly many real programs make the formal verification process difficult to justify and manage. It is felt that ease of formal verification should not dominate program language design.", 25396 acknowledgement = ack-nhfb, 25397 classcodes = "C4240 (Programming and algorithm theory)", 25398 classification = "723", 25399 corpsource = "Georgia Inst. of Technol., Atlanta, GA, USA", 25400 journalabr = "Commun ACM", 25401 keywords = "computer programming; formal verification; philosophical aspects; program language design; programming theory; specification", 25402 treatment = "G General Review; T Theoretical or Mathematical", 25403 } 25404 25405 @Article{Chang:1979:IAD, 25406 author = "Ernest Chang and Rosemary Roberts", 25407 title = "An Improved Algorithm for Decentralized Extrema-Finding in Circular Configurations of Processors", 25408 journal = j-CACM, 25409 volume = "22", 25410 number = "5", 25411 pages = "281--283", 25412 month = may, 25413 year = "1979", 25414 CODEN = "CACMA2", 25415 ISSN = "0001-0782", 25416 bibdate = "Tue Mar 25 13:26:09 MST 1997", 25417 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Theory/ProbAlgs.bib", 25418 note = "They present a deterministic distributed algorithm for finding the largest of a set of $n$ uniquely numbered processes in a ring. The algorithm uses $O(n \log n)$ messages on the average and $O(n^2)$ messages in the worst case, and does not assume that $n$ is known a priori.", 25419 abstract = "An improvement is presented of LeLann's algorithm for finding the largest (or smallest) of a set of uniquely numbered processes arranged in a circle, in which no central controller exists and the number of processes is not known a priori. This decentralized algorithm uses a technique of selective message extinction in order to achieve an average number of message passes of order (n log n) rather than O(n**2).", 25420 acknowledgement = ack-nhfb, 25421 classcodes = "C4290 (Other computer theory); C6150J (Operating systems)", 25422 classification = "723", 25423 corpsource = "Univ. of Toronto, Ont., Canada", 25424 journalabr = "Commun ACM", 25425 keywords = "algorithm; circular configurations; computer operating systems; computer programming --- Subroutines; decentralized; distributed processing; distributed systems; extrema; operating systems; operating systems (computers); processes", 25426 treatment = "T Theoretical or Mathematical", 25427 xxtitle = "An improved algorithm for decentralized extrema-finding in circular configurations of processes", 25428 } 25429 25430 @Article{Sterling:1979:CDC, 25431 author = "T. D. Sterling", 25432 title = "Consumer Difficulties with Computerized Transactions: an Empirical Investigation", 25433 journal = j-CACM, 25434 volume = "22", 25435 number = "5", 25436 pages = "283--289", 25437 month = may, 25438 year = "1979", 25439 CODEN = "CACMA2", 25440 ISSN = "0001-0782", 25441 bibdate = "Tue Mar 25 13:26:09 MST 1997", 25442 bibsource = "Compendex database", 25443 abstract = "Results show that with the present state of the art, approximately 40 percent of individuals (or households) having average contacts with different types of accounts experience one or more errors per year. Eighty percent relate to billing. Attempts to correct errors often turned out to be difficult and not always successful. There appears to be some conflict between computer-using organizations and their public. Also the role of poor management packages including poor software is indicated. While most management systems may be adequate, results of the survey raise concerns about the timeliness and the number of designs of very large linked program packages (as EFT for instance).", 25444 acknowledgement = ack-nhfb, 25445 classcodes = "C0230 (Economic, social and political aspects of computing); C7100 (Business and administration); C7120 (Financial computing)", 25446 classification = "723", 25447 corpsource = "Simon Fraser Univ., Burnaby, BC, Canada", 25448 journalabr = "Commun ACM", 25449 keywords = "administrative data processing; billing; computerized transactions; consumers; data processing, business; economic and sociological; effects; errors; management; packages", 25450 treatment = "P Practical", 25451 } 25452 25453 @Article{Reynolds:1979:RAA, 25454 author = "John C. Reynolds", 25455 title = "Reasoning About Arrays", 25456 journal = j-CACM, 25457 volume = "22", 25458 number = "5", 25459 pages = "290--299", 25460 month = may, 25461 year = "1979", 25462 CODEN = "CACMA2", 25463 ISSN = "0001-0782", 25464 MRclass = "68B10 (68E05)", 25465 MRnumber = "80f:68018", 25466 bibdate = "Tue Mar 25 13:26:09 MST 1997", 25467 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Compiler/reynolds.bib", 25468 abstract = "A variety of concepts, laws, and notations are presented which facilitate reasoning about arrays. The basic concepts include intervals and their partitions, functional restriction, images, pointwise extension of relations, ordering, single-point variation of functions, various equivalence relations for array values, and concatenation. The effectiveness of these ideas is illustrated by informal descriptions of algorithms for binary search and merging, and by a short formal proof.", 25469 acknowledgement = ack-nhfb, 25470 checked = "4 September 1990", 25471 classcodes = "C4240 (Programming and algorithm theory)", 25472 classification = "723", 25473 corpsource = "Syracuse Univ., Syracuse, NY, USA", 25474 journalabr = "Commun ACM", 25475 keywords = "arrays; binary; computer programming; concatenation; concepts; equivalence relations; extension of relations; functional restriction; functions; imaging; intervals; laws; merging; notations; ordering; partitions; pointwise; programming theory; programs; reasoning; search; single point variation of", 25476 treatment = "A Application; T Theoretical or Mathematical", 25477 } 25478 25479 @Article{Manthey:1979:MDM, 25480 author = "Michael J. Manthey", 25481 title = "Model for and Discussion of Multi-Interpreter Systems", 25482 journal = j-CACM, 25483 volume = "22", 25484 number = "5", 25485 pages = "299--309", 25486 month = may, 25487 year = "1979", 25488 CODEN = "CACMA2", 25489 ISSN = "0001-0782", 25490 bibdate = "Tue Mar 25 13:26:09 MST 1997", 25491 bibsource = "Compendex database", 25492 abstract = "A multi-interpreter system is a system in which programs execute by virtue of being interpreted by other programs, which themselves may either be interpreted (i.e. nested interpreters) or run directly on the host machine. The model reveals the anatomy of interpreters and how these differ from procedures, and exhibits links to protection domains and multiprocessor architectures.", 25493 acknowledgement = ack-nhfb, 25494 classcodes = "C6150C (Compilers, interpreters and other processors)", 25495 classification = "722; 723", 25496 corpsource = "State Univ. of New York, Buffalo, NY, USA", 25497 journalabr = "Commun ACM", 25498 keywords = "computer systems, digital; multi interpreter systems; multiprocessor; program interpreters; programs", 25499 treatment = "A Application; T Theoretical or Mathematical", 25500 } 25501 25502 @Article{Lemos:1979:ISW, 25503 author = "R. S. Lemos", 25504 title = "An implementation of structured walk-throughs in teaching {COBAL} programming", 25505 journal = j-CACM, 25506 volume = "22", 25507 number = "6", 25508 pages = "335--340", 25509 month = jun, 25510 year = "1979", 25511 CODEN = "CACMA2", 25512 ISSN = "0001-0782", 25513 bibdate = "Tue Mar 25 13:26:09 MST 1997", 25514 acknowledgement = ack-nhfb, 25515 classcodes = "C0220 (Computing education and training); C6110 (Systems analysis and programming)", 25516 corpsource = "California State Univ., Los Angeles, CA, USA", 25517 keywords = "COBAL programming; computer science education; multiple covariance; programming; structured walk-throughs; teaching", 25518 treatment = "G General Review", 25519 } 25520 25521 @Article{Busenberg:1979:APP, 25522 author = "S. N. Busenberg and W. C. Tam", 25523 title = "An academic program providing realistic training in software engineering", 25524 journal = j-CACM, 25525 volume = "22", 25526 number = "6", 25527 pages = "341--345", 25528 month = jun, 25529 year = "1979", 25530 CODEN = "CACMA2", 25531 ISSN = "0001-0782", 25532 bibdate = "Tue Mar 25 13:26:09 MST 1997", 25533 acknowledgement = ack-nhfb, 25534 classcodes = "C6110 (Systems analysis and programming)", 25535 corpsource = "Harvey Mudd Coll., Claremont, CA, USA", 25536 keywords = "Clinic program; communication skills; computer science education; methodology; realistic training; software design; software engineering; software project management; team work", 25537 treatment = "G General Review", 25538 } 25539 25540 @Article{Alter:1979:MAF, 25541 author = "Steven Alter", 25542 title = "Model for Automating File and Program Design in Business Application Systems", 25543 journal = j-CACM, 25544 volume = "22", 25545 number = "6", 25546 pages = "345--353", 25547 month = jun, 25548 year = "1979", 25549 CODEN = "CACMA2", 25550 ISSN = "0001-0782", 25551 bibdate = "Tue Mar 25 13:26:09 MST 1997", 25552 bibsource = "Compendex database", 25553 abstract = "A model is discussed for finding an efficient implementation of a business application system whose logical specifications have been determined in advance. The model views file and program design as a problem of systematically coordinating the configurations of datasets and computations. It uses a straightforward search technique to determine aggregations of computations, aggregations of datasets, device, organization, and key order for each dataset, key order for each computation, and access method for each dataset-computation pair. Although computational results are presented for a sample problem involving 54 computations and 49 datasets, the main point of the paper is that the underlying model works computationally and is simple enough to be adapted to many file design situations.", 25554 acknowledgement = ack-nhfb, 25555 classcodes = "C6120 (File organisation)", 25556 classification = "723", 25557 corpsource = "Steven Alter and Associates Inc., San Francisco, CA, USA", 25558 journalabr = "Commun ACM", 25559 keywords = "automating file; business application; computations; computer programming; datasets; design; file; file organisation; program design; search technique; software engineering; systems", 25560 treatment = "P Practical", 25561 } 25562 25563 @Article{Feldman:1979:HLP, 25564 author = "Jerome A. Feldman", 25565 title = "High Level Programming for Distributed Computing", 25566 journal = j-CACM, 25567 volume = "22", 25568 number = "6", 25569 pages = "353--368", 25570 month = jun, 25571 year = "1979", 25572 CODEN = "CACMA2", 25573 ISSN = "0001-0782", 25574 bibdate = "Tue Mar 25 13:26:09 MST 1997", 25575 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Object/Nierstrasz.bib", 25576 abstract = "An approach to distributed computing at the level of general purpose programming languages is described. Based on primitive notions of module, message, and transaction key, the methodology is shown to be independent of particular languages and machines. It appears to be useful for programming a wide range of tasks. This is part of an ambitious program of development in advanced programming languages, and relations with other aspects of the project are also discussed.", 25577 acknowledgement = ack-nhfb, 25578 classcodes = "C6110 (Systems analysis and programming)", 25579 classification = "723", 25580 corpsource = "Univ. of Rochester, Rochester, NY, USA", 25581 journalabr = "Commun ACM", 25582 keywords = "computer programming languages; distributed computing; distributed processing; high level programming; message; misc modules messages; module; multiprogramming; transaction key", 25583 treatment = "G General Review", 25584 } 25585 25586 @Article{Sedgewick:1979:CIQ, 25587 author = "Robert Sedgewick", 25588 title = "Corrigendum: {``Implementing {Quicksort} Programs''}", 25589 journal = j-CACM, 25590 volume = "22", 25591 number = "6", 25592 pages = "368--368", 25593 month = jun, 25594 year = "1979", 25595 CODEN = "CACMA2", 25596 ISSN = "0001-0782", 25597 bibdate = "Sat Jan 18 15:43:13 1997", 25598 bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Theory/Seiferas/1979.bib", 25599 note = "See \cite{Sedgewick:1978:IQP}.", 25600 } 25601 25602 @Article{Shapira:1979:COP, 25603 author = "R. Shapira and H. Freeman", 25604 title = "The Cyclic Order Property of Vertices as an Aid in Scene Analysis", 25605 journal = j-CACM, 25606 volume = "22", 25607 number = "6", 25608 pages = "368--375", 25609 month = jun, 25610 year = "1979", 25611 CODEN = "CACMA2", 25612 ISSN = "0001-0782", 25613 bibdate = "Tue Mar 25 13:26:09 MST 1997", 25614 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Graphics/imager/imager.79.bib", 25615 abstract = "A cyclic-order property is defined for bodies bounded by smooth-curved faces. The property is shown to be useful for analyzing pictures of such bodies, particularly when the line data extracted from the pictures are imperfect. This property augments previously known grammatical rules that determine the existence of three-dimensional bodies corresponding to given two-dimensional line-structure data.", 25616 acknowledgement = ack-nhfb, 25617 classcodes = "B6140C (Optical information, image and video signal processing); C1250 (Pattern recognition); C1260 (Information theory)", 25618 classification = "723", 25619 corpsource = "Rensselaer Polytech. Inst., Troy, NY, USA", 25620 journalabr = "Commun ACM", 25621 keywords = "AI; algorithmic aspects; algorithms; computer graphics; cyclic order; grammatical; image processing; line data; pattern; pattern recognition; picture processing; pictures; recognition; reconstruction; reconstruction of objects and three-dimensional graphics; rules; scene analysis; see Section 6; vertices", 25622 } 25623 25624 @Article{Winograd:1979:BPL, 25625 author = "T. Winograd", 25626 title = "Beyond Programming Languages", 25627 journal = j-CACM, 25628 volume = "22", 25629 number = "7", 25630 pages = "391--401", 25631 month = jul, 25632 year = "1979", 25633 CODEN = "CACMA2", 25634 ISSN = "0001-0782", 25635 bibdate = "Tue Mar 25 13:26:09 MST 1997", 25636 abstract = "As computer technology matures, our growing ability to create large systems is leading to basic changes in the nature of programming. Current programming language concepts will not be adequate for building and maintaining systems of the complexity called for by the tasks we attempt. Just as high level languages enabled the programmer to escape from the intricacies of a machine's order code, higher level programming systems can provide the means to understand and manipulate complex systems and components. In order to develop such systems, we need to shift our attention away from the detailed specification of algorithms, towards the description of the properties of the packages and objects with which we build. This paper analyzes some of the shortcomings of programming languages as they now exist, and lays out some possible directions for future research.", 25637 acknowledgement = ack-nhfb, 25638 classcodes = "C0200 (General computer topics); C6110 (Systems analysis and programming); C6140D (High level languages)", 25639 corpsource = "Stanford Univ., Stanford, CA, USA", 25640 keywords = "future; higher level programming systems; Programming; programming languages; programming systems; research; shortcomings; systems development; technological forecasting", 25641 treatment = "G General Review", 25642 } 25643 25644 @Article{Preparata:1979:ORT, 25645 author = "F. P. Preparata", 25646 title = "An Optimal Real-Time Algorithm for Planar Convex Hulls", 25647 journal = j-CACM, 25648 volume = "22", 25649 number = "7", 25650 pages = "402--405", 25651 month = jul, 25652 year = "1979", 25653 CODEN = "CACMA2", 25654 ISSN = "0001-0782", 25655 MRclass = "68C05 (68C25)", 25656 MRnumber = "80e:68075", 25657 bibdate = "Tue Mar 25 13:26:09 MST 1997", 25658 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Graphics/imager/imager.79.bib", 25659 abstract = "An algorithm is described for the construction in real-time of the convex hull of a set of n points in the plane. Using an appropriate data structure, the algorithm constructs the convex hull by successive updates, each taking time O(log n), thereby achieving a total processing time O(n log n).", 25660 acknowledgement = ack-nhfb, 25661 classcodes = "C6130B (Graphics techniques)", 25662 classification = "723", 25663 corpsource = "Univ. of Illinois, Urbana, IL, USA", 25664 journalabr = "Commun ACM", 25665 keywords = "algorithmic aspects; computer programming; convex hull and mathematical aspects", 25666 keywords = "algorithm; computer graphics; data structure; optimal; planar convex hulls; real time", 25667 treatment = "P Practical", 25668 } 25669 25670 @Article{Fischer:1979:SRT, 25671 author = "Patrick C. Fischer and Robert L. Probert", 25672 title = "Storage Reorganization Techniques for Matrix Computation in a Paging Environment", 25673 journal = j-CACM, 25674 volume = "22", 25675 number = "7", 25676 pages = "405--415", 25677 month = jul, 25678 year = "1979", 25679 CODEN = "CACMA2", 25680 ISSN = "0001-0782", 25681 MRclass = "68B20 (65F30)", 25682 MRnumber = "80e:68055", 25683 bibdate = "Tue Mar 25 13:26:09 MST 1997", 25684 bibsource = "Compendex database", 25685 abstract = "In order to multiply matrices while minimizing the number of page fetches required, it is often more efficient to reorganize the data into submatrix form and to use block multiplication rather than to use the best known algorithms which leave the matrices stored in row-(or column-)oriented form. An efficient method for accomplishing this reorganization is given. This also makes possible the derivation of an asymptotically better bound for multiplication of matrices given in row-oriented form by adapting the technique of Strassen to the reorganized data. The reorganization\slash block multiplication scheme is shown to be advantageous for matrices and pages of realistic size; the Strassen adaptation is not. The former scheme is also shown to be advantageous even if the transpose of one of the matrices is available at no additional cost.", 25686 acknowledgement = ack-nhfb, 25687 classcodes = "C4140 (Linear algebra); C6120 (File organisation); C6130 (Data handling techniques)", 25688 classification = "723", 25689 corpsource = "Pennsylvania State Univ., University Park, PA, USA", 25690 journalabr = "Commun ACM", 25691 keywords = "block; computer operating systems; matrix algebra; matrix computation; multiplication; paging; reorganization; virtual storage", 25692 treatment = "P Practical", 25693 } 25694 25695 @Article{Hine:1979:CRT, 25696 author = "J. H. Hine and I. Mitrani and S. Tsur", 25697 title = "The Control of Response Times in Multi-Class Systems by Memory Allocation", 25698 journal = j-CACM, 25699 volume = "22", 25700 number = "7", 25701 pages = "415--424", 25702 month = jul, 25703 year = "1979", 25704 CODEN = "CACMA2", 25705 ISSN = "0001-0782", 25706 bibdate = "Tue Mar 25 13:26:09 MST 1997", 25707 bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1979.bib", 25708 abstract = "The possibility of giving different quality of service to jobs of different classes by regulating their memory allocation is examined in the context of a paged computer system. Two parameterized algorithms which partition the main memory between two classes of jobs are considered. Initially, a closed system consisting of a processor and paging and file devices, with fixed number of jobs, is studied to determine optimal degrees of multiprogramming and the proportion of processor time devoted to each class. Applying a decomposition approach and treating the closed system as a single server, the response times in an open system with external arrivals are studied. The object is to investigate the effect of the memory allocation parameters on the expected response times under the two algorithms. Numerical solutions and economical lower bounds for the expected response times as functions of the control parameters are obtained. A way of applying the results to systems with more than two job classes is indicated.", 25709 acknowledgement = ack-nhfb, 25710 annote = "The possibility of giving different quality of service to jobs of different classes by regulating their memory allocation is examined in the context of a paged computer system.", 25711 classcodes = "C6120 (File organisation); C6150J (Operating systems)", 25712 classification = "723", 25713 corpsource = "Univ. of Newcastle upon Tyne, Newcastle upon Tyne, UK", 25714 country = "USA", 25715 descriptors = "Queueing network; response time; memory management; priority; performance evaluation; memory organization; operating system;", 25716 enum = "1369", 25717 journalabr = "Commun ACM", 25718 keywords = "computer operating systems; control; memory allocation; multiclass systems; multiprogramming; operating systems (computers); paged computer; paging; performance control; Queueing networks; response times; storage; storage allocation; system; virtual; virtual memory", 25719 language = "English", 25720 references = "13", 25721 treatment = "P Practical", 25722 } 25723 25724 @Article{Kowalski:1979:ALC, 25725 author = "Robert A. Kowalski", 25726 title = "Algorithm = Logic + Control", 25727 journal = j-CACM, 25728 volume = "22", 25729 number = "7", 25730 pages = "424--436", 25731 month = jul, 25732 year = "1979", 25733 CODEN = "CACMA2", 25734 ISSN = "0001-0782", 25735 bibdate = "Tue Mar 25 13:26:09 MST 1997", 25736 bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Ai/prolog.bib and ftp://ftp.ira.uka.de/pub/bibliography/Ai/prolog.1.bib", 25737 acknowledgement = ack-nhfb, 25738 classcodes = "C4240 (Programming and algorithm theory)", 25739 corpsource = "Imperial Coll., London, UK", 25740 keywords = "algorithm; algorithm theory; computer programs; control; logic; programming theory; prolog; theorem proving", 25741 treatment = "T Theoretical or Mathematical", 25742 } 25743 25744 @Article{Wong:1979:SAP, 25745 author = "J. W. Wong and G. Scott Graham", 25746 title = "Self-Assessment Procedure {VI}: a self-assessment procedure dealing with queueing network models of computer systems", 25747 journal = j-CACM, 25748 volume = "22", 25749 number = "8", 25750 pages = "449--454", 25751 month = aug, 25752 year = "1979", 25753 CODEN = "CACMA2", 25754 ISSN = "0001-0782", 25755 bibdate = "Sat Jan 18 15:44:35 1997", 25756 bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1979.bib", 25757 country = "USA", 25758 descriptors = "Queueing system; simulation; measurement; communication network; solved exercise; bibliography;", 25759 enum = "3335", 25760 language = "English", 25761 references = "34", 25762 } 25763 25764 @Article{Floyd:1979:PP, 25765 author = "R. W. Floyd", 25766 title = "The paradigms of programming", 25767 journal = j-CACM, 25768 volume = "22", 25769 number = "8", 25770 pages = "455--460", 25771 month = aug, 25772 year = "1979", 25773 CODEN = "CACMA2", 25774 ISSN = "0001-0782", 25775 bibdate = "Tue Mar 25 13:26:09 MST 1997", 25776 bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Ai/constr.logic.bib", 25777 acknowledgement = ack-nhfb, 25778 classcodes = "C6110 (Systems analysis and programming)", 25779 corpsource = "Dept. of Computer Sci., Stanford Univ., Stanford, CA, USA", 25780 keywords = "computer programs; languages; paradigms; programming; structural programming", 25781 treatment = "G General Review", 25782 } 25783 25784 @Article{Hirschberg:1979:CCC, 25785 author = "D. S. Hirschberg and A. K. Chandra and D. V. Sarwate", 25786 title = "Computing Connected Components on Parallel Computers", 25787 journal = j-CACM, 25788 volume = "22", 25789 number = "8", 25790 pages = "461--464", 25791 month = aug, 25792 year = "1979", 25793 CODEN = "CACMA2", 25794 ISSN = "0001-0782", 25795 MRclass = "68C25 (68B20 68E10)", 25796 MRnumber = "80h:68041", 25797 bibdate = "Tue Mar 25 13:26:09 MST 1997", 25798 bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Parallel/Multi.bib", 25799 abstract = "We present a parallel algorithm which uses $n^2$ processors to find the connected components of an undirected graph with $n$ vertices in time $O(log2n)$. An $O(\log_2n)$ time bound also can be achieved using only $n n/\log_2n$ processors. The algorithm can be used to find the transitive closure of a symmetric Boolean matrix. We assume that the processors have access to a common memory. Simultaneous access to the same location is permitted for fetch instructions but not for store instructions.", 25800 acknowledgement = ack-nhfb, 25801 classcodes = "C6120 (File organisation); C6150J (Operating systems)", 25802 corpsource = "Dept. of Electrical Engng., Rice Univ., Houston, TX, USA", 25803 keywords = "(computers); algorithm; algorithms; Boolean matrix; connected component; connected components; fetch instructions; file organisation; Graph theory; graph theory; operating systems; OS; parallel; parallel computers; parallel processing; store instructions; time bound; transitive closure; undirected graph", 25804 treatment = "P Practical; T Theoretical or Mathematical", 25805 } 25806 25807 @Article{Dershowitz:1979:PTM, 25808 author = "Nachum Dershowitz and Zohar Manna", 25809 title = "Proving Termination with Multiset Orderings", 25810 journal = j-CACM, 25811 volume = "22", 25812 number = "8", 25813 pages = "465--476", 25814 month = aug, 25815 year = "1979", 25816 CODEN = "CACMA2", 25817 ISSN = "0001-0782", 25818 MRclass = "68B10", 25819 MRnumber = "80g:68017", 25820 bibdate = "Tue Mar 25 13:26:09 MST 1997", 25821 bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Theory/obscure.bib", 25822 acknowledgement = ack-nhfb, 25823 classcodes = "C4240 (Programming and algorithm theory)", 25824 corpsource = "Computer Sci. Dept., Stanford Univ., Stanford, CA, USA", 25825 keywords = "multiset orderings; program variables; programming theory; proving the termination of programs; termination function", 25826 treatment = "T Theoretical or Mathematical", 25827 } 25828 25829 @Article{Denning:1979:SPC, 25830 author = "Dorothy E. Denning", 25831 title = "Secure Personal Computing in an Insecure Network", 25832 journal = j-CACM, 25833 volume = "22", 25834 number = "8", 25835 pages = "476--482", 25836 month = aug, 25837 year = "1979", 25838 CODEN = "CACMA2", 25839 ISSN = "0001-0782", 25840 MRclass = "68A05 (68B15 94A99)", 25841 MRnumber = "80d:68010", 25842 bibdate = "Tue Mar 25 13:26:09 MST 1997", 25843 acknowledgement = ack-nhfb, 25844 classcodes = "C6130 (Data handling techniques)", 25845 corpsource = "Computer Sci. Dept., Purdue Univ., West Lafayette, IN, USA", 25846 keywords = "communication links; confidential data; confidential files; encoding; encryption; insecure network; secure personal computing; security of data", 25847 treatment = "P Practical", 25848 } 25849 25850 @Article{Nelson:1979:FRS, 25851 author = "L. S. Nelson", 25852 title = "Further remark on stably updating mean and standard deviation estimates", 25853 journal = j-CACM, 25854 volume = "22", 25855 number = "8", 25856 pages = "483--483", 25857 month = aug, 25858 year = "1979", 25859 CODEN = "CACMA2", 25860 ISSN = "0001-0782", 25861 bibdate = "Tue Mar 25 13:26:09 MST 1997", 25862 bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1979.bib", 25863 acknowledgement = ack-nhfb, 25864 classcodes = "C6110 (Systems analysis and programming); C7310 (Mathematics computing)", 25865 corpsource = "Appl. Math. Lab., General Electric Co., Louisville, KY, USA", 25866 country = "USA", 25867 descriptors = "expectation; standard deviation; moment estimation; numerical method", 25868 enum = "2249", 25869 keywords = "Mean; programming; standard deviation; standard deviation estimates; statistics; updating", 25870 language = "English", 25871 references = "3", 25872 treatment = "P Practical; T Theoretical or Mathematical", 25873 } 25874 25875 @Article{Feldman:1979:REC, 25876 author = "Jerome A. Feldman and William R. Sutherland", 25877 title = "Rejuvenating Experimental Computer Science --- {A} Report to the {National Science Foundation} and Others", 25878 journal = j-CACM, 25879 volume = "22", 25880 number = "9", 25881 pages = "497--502", 25882 month = sep, 25883 year = "1979", 25884 CODEN = "CACMA2", 25885 ISSN = "0001-0782", 25886 bibdate = "Tue Mar 25 13:26:09 MST 1997", 25887 abstract = "This report is based on the results of an NSF sponsored workshop held in Washington, DC, on November 2, 1978. The co-authors of the report are: Gordon Bell, Digital Equipment Corporation; Bernard A. Galler, University of Michigan; Patricia Goldberg, IBM Corporation; John Hamblen, University of Missouri at Rolla; Elliot Pinson, Bell Telephone Laboratories; and Ivan Sutherland, California Institute of Technology. Also participating in the workshop were representatives of NSF and other government agencies. In addition to the authors, a number of other people have contributed to the contents of this report. In preparation for the original workshop, all doctorate-granting computer science departments in the nation were asked for comments and suggestions on the problems of experimental computer science. A version of the current report dated January 15 was circulated to these departments and to a number of industrial and government groups for criticism. The editors and authors of this final version gratefully acknowledge the contribution of a large number of other people at all stages in the preparation of the report. \par Note: Following this presentation of the report, there is a position paper on the crisis in experimental computer science written by the ACM Executive Committee.", 25888 acknowledgement = ack-nhfb, 25889 classcodes = "C0220 (Computing education and training)", 25890 corpsource = "Univ. of Rochester, Rochester, NY, USA", 25891 keywords = "capital equipment; computer science education; experimental computer science; investment; universities", 25892 treatment = "G General Review", 25893 } 25894 25895 @Article{McCracken:1979:AAE, 25896 author = "Daniel D. {McCracken, CCP} and Peter J. Denning and David H. Brandin", 25897 title = "Addendum: An {ACM} Executive Committee Position on the Crisis in Experimental Computer Science", 25898 journal = j-CACM, 25899 volume = "22", 25900 number = "9", 25901 pages = "503--504", 25902 month = sep, 25903 year = "1979", 25904 CODEN = "CACMA2", 25905 ISSN = "0001-0782", 25906 bibdate = "Sat Jan 18 15:46:13 1997", 25907 } 25908 25909 @Article{Galil:1979:IWC, 25910 author = "Zvi Galil", 25911 title = "On Improving the Worse Case Running Time of the {Boyer-Moore} String Matching Algorithm", 25912 journal = j-CACM, 25913 volume = "22", 25914 number = "9", 25915 pages = "505--508", 25916 month = sep, 25917 year = "1979", 25918 CODEN = "CACMA2", 25919 ISSN = "0001-0782", 25920 MRclass = "68H05 (68C25)", 25921 MRnumber = "80m:68083", 25922 mrreviewer = "Andrew Yao", 25923 bibdate = "Tue Mar 25 13:26:09 MST 1997", 25924 bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib", 25925 acknowledgement = ack-nhfb, 25926 annote = "It compares the pattern with the text from the right end of the pattern. Whenever a mismatch occurs, it shifts the pattern according to a precomputed table. In the case that the text character positioned against the last character in the pattern does not appear in the pattern, we can immediately shift the pattern right a distance equal to the size of the pattern. Thus, we need to inspect only about $n/m$ characters of the text (where $n$ and $m$ are the sizes of the text pattern).", 25927 classcodes = "C4240 (Programming and algorithm theory); C6130 (Data handling techniques)", 25928 corpsource = "Tel-Aviv Univ., Tel-Aviv, Israel", 25929 keywords = "algorithm; computational complexity; data handling; running time; string matching; worst case", 25930 treatment = "T Theoretical or Mathematical", 25931 } 25932 25933 @Article{Raiha:1979:OIA, 25934 author = "Kari-Jouko R{\"a}ih{\"a} and Stuart H. Zweben", 25935 title = "An Optimal Insertion Algorithm for One-Sided Height-Balanced Binary Search Trees", 25936 journal = j-CACM, 25937 volume = "22", 25938 number = "9", 25939 pages = "508--512", 25940 month = sep, 25941 year = "1979", 25942 CODEN = "CACMA2", 25943 ISSN = "0001-0782", 25944 MRclass = "68C25 (68E10)", 25945 MRnumber = "80h:68044", 25946 bibdate = "Tue Mar 25 13:26:09 MST 1997", 25947 bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1979.bib", 25948 abstract = "An algorithm for inserting an element into a one-sided height-balanced (OSHB) binary search tree is presented. The algorithm operates in time $O(\log n)$, where $n$ is the number of nodes in the tree. This represents an improvement over the best previous ly known insertion algorithms of Hirschberg and Kosaraju, which require time $O(\log 2n)$. Moreover, the $O(\log n)$ complexity is optimal. Earlier results have shown that deletion in such a structure can also be performed in $O(\log n)$ time. Thus the result of this paper gives a negative answer to the question of whether such trees should be the first examples of their kind, where deletion has a smaller time complexity than insertion. Furthermore, it can now be concluded that insertion, deletion, and retrieval in OSHB trees can be performed in the same time as the corresponding operations for the more general AVL trees, to within a constant factor. However, the insertion and deletion algorithms for OSHB trees appear much more complicated than the corresponding algorithms for AVL trees.", 25949 acknowledgement = ack-nhfb, 25950 annote = "An algorithm for inserting an element into a one-sided height-balanced (OSHB) binary search tree is presented. The algorithm operates in time $O(\log{N})$, where $N$ is the number of nodes in the tree. This represents an improvement over the best previously known insertion algorithms of Hirschberg and Kosaraju, which require time $O(\log{N}\log{N})$.", 25951 classcodes = "C4240 (Programming and algorithm theory); C6130 (Data handling techniques)", 25952 corpsource = "Univ. of Helsinki, Helsinki, Finland", 25953 country = "USA", 25954 descriptors = "Method; information system; search tree; graph theory;", 25955 enum = "2486", 25956 keywords = "binary; binary trees; data handling; height balanced; height-balanced trees; Insertion; insertion algorithm; one; one-sided height-balanced trees; optimal; search trees; search trees.; sided", 25957 language = "English", 25958 references = "13", 25959 treatment = "T Theoretical or Mathematical", 25960 } 25961 25962 @Article{Hansen:1979:PAD, 25963 author = "Wilfred J. Hansen", 25964 title = "Progressive acyclic digraphs --- a tool for database integrity", 25965 journal = j-CACM, 25966 volume = "22", 25967 number = "9", 25968 pages = "513--518", 25969 month = sep, 25970 year = "1979", 25971 CODEN = "CACMA2", 25972 ISSN = "0001-0782", 25973 MRclass = "68B15 (68C05)", 25974 MRnumber = "80h:68011", 25975 bibdate = "Tue Mar 25 13:26:09 MST 1997", 25976 acknowledgement = ack-nhfb, 25977 classcodes = "C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory); C6160 (Database management systems (DBMS))", 25978 corpsource = "Univ. of Illinois, Urbana, IL, USA", 25979 keywords = "database integrity; database management systems; directed graphs; progressive acyclic digraph", 25980 treatment = "T Theoretical or Mathematical", 25981 } 25982 25983 @Article{Nagy:1979:APM, 25984 author = "G. Nagy and S. G. Wagle", 25985 title = "Approximation of Polygonal Maps by Cellular Maps", 25986 journal = j-CACM, 25987 volume = "22", 25988 number = "9", 25989 pages = "518--525", 25990 month = sep, 25991 year = "1979", 25992 CODEN = "CACMA2", 25993 ISSN = "0001-0782", 25994 bibdate = "Tue Mar 25 13:26:09 MST 1997", 25995 bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Graphics/imager/imager.79.bib", 25996 acknowledgement = ack-nhfb, 25997 classcodes = "C6120 (File organisation); C7340 (Geophysics computing)", 25998 corpsource = "Univ. of Nebraska, Lincoln, NE, USA", 25999 keywords = "and Applications; approximation; cartography; cellular maps; data structure; data structures; geographical; mathematical aspects; polygonal maps", 26000 treatment = "A Application; T Theoretical or Mathematical", 26001 xxauthor = "G. Nagy and G. Wagle", 26002 } 26003 26004 @Article{Chan:1979:CSD, 26005 author = "T. F. Chan and J. G. Lewis", 26006 title = "Computing standard deviations: accuracy", 26007 journal = j-CACM, 26008 volume = "22", 26009 number = "9", 26010 pages = "526--531", 26011 month = sep, 26012 year = "1979", 26013 CODEN = "CACMA2", 26014 ISSN = "0001-0782", 26015 bibdate = "Tue Mar 25 13:26:09 MST 1997", 26016 bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1979.bib", 26017 abstract = "Four algorithms for the numerical computation of the standard deviation of (unweighted) sampled data are analyzed. Two of the algorithms are well-known in the statistical and computational literature; the other two are new algorithms specifically intended for automatic computation. Our discussion is expository, with emphasis on reaching a suitable definition of ``accuracy.'' Each of the four algorithms is analyzed for the conditions under which it will be accurate. We conclude that all four algorithms will provide accurate answers for many problems, but two of the algorithms, one new, one old, are substantially more accurate on difficult problems than are the other two.", 26018 acknowledgement = ack-nhfb, 26019 classcodes = "C1140Z (Other topics in statistics); C7310 (Mathematics computing)", 26020 corpsource = "Stanford Univ., Stanford, CA, USA", 26021 country = "USA", 26022 descriptors = "Expectation; standard deviation; moment estimation; numerical method; comparison; runtime/storage efficiency; rounding error; computer arithmetic;", 26023 enum = "515", 26024 keywords = "accuracy; condition number.; least squares; Mean; numerical computation; rounding error analysis; sampled data; standard deviation; standard deviations; statistics; updating estimates", 26025 language = "English", 26026 references = "11", 26027 treatment = "A Application; T Theoretical or Mathematical", 26028 xxtitle = "Computing Standard Deviation: Accuracy", 26029 } 26030 26031 @Article{West:1979:UMV, 26032 author = "D. H. D. West", 26033 title = "Updating mean and variance estimates: an improved method", 26034 journal = j-CACM, 26035 volume = "22", 26036 number = "9", 26037 pages = "532--535", 26038 month = sep, 26039 year = "1979", 26040 CODEN = "CACMA2", 26041 ISSN = "0001-0782", 26042 bibdate = "Tue Mar 25 13:26:09 MST 1997", 26043 bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1979.bib and ftp://ftp.ira.uka.de/pub/bibliography/Theory/Matrix.bib", 26044 abstract = "A method of improved efficiency is given for updating the mean and variance of weighted sampled data when an additional data value is included in the set. Evidence is presented that the method is stable and at least as accurate as the best existing updating method.", 26045 acknowledgement = ack-nhfb, 26046 annote = "A method of improved efficiency is given for updating the mean and variance of weighted sampled data when an additional data value is included in the set. Evidence is presented that the method is stable and at least as accurate as the best existing updating method.", 26047 classcodes = "C1140Z (Other topics in statistics); C7310 (Mathematics computing)", 26048 corpsource = "Univ. of Dublin, Dublin, Ireland", 26049 country = "USA", 26050 descriptors = "Expectation; standard deviation; moment estimation; numerical method; comparison; runtime/storage efficiency; variance;", 26051 enum = "3271", 26052 keywords = "efficiency; estimates; mean; Mean; removing data; sampled data; standard deviation; statistics; updating; updating estimates; variance; weighted", 26053 kwds = "mean, standard deviation, variance, updating", 26054 language = "English", 26055 references = "7", 26056 treatment = "A Application; T Theoretical or Mathematical", 26057 } 26058 26059 @Article{Laird:1979:COE, 26060 author = "P. D. Laird", 26061 title = "Comment on: {``An optimal evaluation of Boolean expressions in an online query system'' [Comm. ACM, 20, 1977, no. 5, 344--347, MR 55 \#9627] by M. Z. Hanani}", 26062 journal = j-CACM, 26063 volume = "22", 26064 number = "10", 26065 pages = "549--550", 26066 month = oct, 26067 year = "1979", 26068 CODEN = "CACMA2", 26069 ISSN = "0001-0782", 26070 MRclass = "68H05 (68B15)", 26071 MRnumber = "81b:68118", 26072 mrreviewer = "K. H. V. Booth", 26073 bibdate = "Tue Mar 25 13:26:09 MST 1997", 26074 acknowledgement = ack-nhfb, 26075 classcodes = "C6120 (File organisation); C7250L (Non-bibliographic retrieval systems)", 26076 corpsource = "Shared Medical Systems Corp., King of Prussia, PA, USA", 26077 keywords = "Boolean expressions; Boolean functions; file organisation; information; information retrieval; online query system; retrieval", 26078 treatment = "T Theoretical or Mathematical", 26079 } 26080 26081 @Article{Gudes:1979:NOE, 26082 author = "Ehud Gudes and Anthony Hoffman", 26083 title = "A note on: {``An optimal evaluation of Boolean expressions in an online query system'' [Comm. ACM, 20, 1977, no. 5, 344--347, MR 55 \#9627] by M. Z. Hanani}", 26084 journal = j-CACM, 26085 volume = "22", 26086 number = "10", 26087 pages = "550--553", 26088 month = oct, 26089 year = "1979", 26090 CODEN = "CACMA2", 26091 ISSN = "0001-0782", 26092 MRclass = "68H05", 26093 MRnumber = "80k:68085", 26094 mrreviewer = "K. H. V. Booth", 26095 bibdate = "Tue Mar 25 13:26:09 MST 1997", 26096 acknowledgement = ack-nhfb, 26097 classcodes = "C7250L (Non-bibliographic retrieval systems)", 26098 corpsource = "Pennsylvania State Univ., University Park, PA, USA", 26099 keywords = "Boolean expressions; Boolean functions; information retrieval; online query system", 26100 treatment = "P Practical", 26101 } 26102 26103 @Article{Anderson:1979:CCP, 26104 author = "M. R. Anderson and M. G. Anderson", 26105 title = "Corrigendum: {``Comments on Perfect Hashing Functions: A Single Probe Retrieving Method for Static Sets''}", 26106 journal = j-CACM, 26107 volume = "22", 26108 number = "10", 26109 pages = "553", 26110 month = oct, 26111 year = "1979", 26112 CODEN = "CACMA2", 26113 ISSN = "0001-0782", 26114 bibdate = "Wed Dec 27 08:06:10 1995", 26115 note = "Corrects \cite{Anderson:1979:CPH}.", 26116 acknowledgement = ack-nhfb, 26117 } 26118 26119 @Article{Lamport:1979:PCC, 26120 author = "Leslie Lamport", 26121 title = "On the Proof of Correctness of a Calendar Program", 26122 journal = j-CACM, 26123 volume = "22", 26124 number = "10", 26125 pages = "554--556", 26126 month = oct, 26127 year = "1979", 26128 CODEN = "CACMA2", 26129 ISSN = "0001-0782", 26130 MRclass = "68B10", 26131 MRnumber = "80f:68017", 26132 bibdate = "Tue Mar 25 13:26:09 MST 1997", 26133 acknowledgement = ack-nhfb, 26134 classcodes = "C4240 (Programming and algorithm theory)", 26135 corpsource = "SRI Internat., Menlo Part, CA, USA", 26136 keywords = "calendar program; correctness; formal specification; programming theory; proof", 26137 treatment = "T Theoretical or Mathematical", 26138 } 26139 26140 @Article{Klint:1979:LNM, 26141 author = "Paul Klint", 26142 title = "Line Numbers Made Cheap", 26143 journal = j-CACM, 26144 volume = "22", 26145 number = "10", 26146 pages = "557--559", 26147 month = oct, 26148 year = "1979", 26149 CODEN = "CACMA2", 26150 ISSN = "0001-0782", 26151 bibdate = "Tue Mar 25 13:26:09 MST 1997", 26152 acknowledgement = ack-nhfb, 26153 classcodes = "C6110 (Systems analysis and programming)", 26154 corpsource = "Math. Centrum, Amsterdam, Netherlands", 26155 keywords = "execution; line number administration; programming", 26156 treatment = "P Practical", 26157 } 26158 26159 @Article{Lozano-Perez:1979:APC, 26160 author = "Tom{\'a}s Lozano-P{\'e}rez and Michael A. Wesley", 26161 title = "An Algorithm for Planning Collision-Free Paths Among Polyhedral Obstacles", 26162 journal = j-CACM, 26163 volume = "22", 26164 number = "10", 26165 pages = "560--570", 26166 month = oct, 26167 year = "1979", 26168 CODEN = "CACMA2", 26169 ISSN = "0001-0782", 26170 bibdate = "Tue Mar 25 13:26:09 MST 1997", 26171 bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Graphics/imager/imager.79.bib", 26172 acknowledgement = ack-nhfb, 26173 classcodes = "C7490 (Computing in other engineering fields)", 26174 corpsource = "IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA", 26175 keywords = "algorithmic aspects; collision avoidance algorithm; collision free; digital simulation; forbidden positions; intersection; intersection determination; network; path; path planning; polyhedral obstacles; representation of objects; safe; solids; three-dimensional graphics; vertex", 26176 ref = "VV35", 26177 treatment = "P Practical; T Theoretical or Mathematical", 26178 } 26179 26180 @Article{Morris:1979:CGC, 26181 author = "F. L. Morris", 26182 title = "On a Comparison of Garbage Collection Techniques", 26183 journal = j-CACM, 26184 volume = "22", 26185 number = "10", 26186 pages = "571", 26187 month = oct, 26188 year = "1979", 26189 CODEN = "CACMA2", 26190 ISSN = "0001-0782", 26191 bibdate = "Wed Sep 21 22:40:09 1994", 26192 bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Compiler/garbage.collection.bib", 26193 } 26194 26195 @Article{Mayer:1979:PLB, 26196 author = "R. E. Mayer", 26197 title = "A psychology of learning {BASIC}", 26198 journal = j-CACM, 26199 volume = "22", 26200 number = "11", 26201 pages = "589--593", 26202 month = nov, 26203 year = "1979", 26204 CODEN = "CACMA2", 26205 ISSN = "0001-0782", 26206 bibdate = "Tue Mar 25 13:26:09 MST 1997", 26207 acknowledgement = ack-nhfb, 26208 classcodes = "C0220 (Computing education and training); C6110 (Systems analysis and programming); C6140D (High level languages)", 26209 corpsource = "Univ. of California, Santa Barbara, CA, USA", 26210 keywords = "BASIC; computer science education; prestatement; programming; transaction", 26211 treatment = "T Theoretical or Mathematical", 26212 } 26213 26214 @Article{Morris:1979:PSC, 26215 author = "R. Morris and K. Thompson", 26216 title = "Password Security --- {A} Case History", 26217 journal = j-CACM, 26218 volume = "22", 26219 number = "11", 26220 pages = "594--597", 26221 month = nov, 26222 year = "1979", 26223 CODEN = "CACMA2", 26224 ISSN = "0001-0782", 26225 bibdate = "Tue Mar 25 13:26:09 MST 1997", 26226 bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Database/Graefe.bib and ftp://ftp.ira.uka.de/pub/bibliography/Misc/security.1.bib", 26227 acknowledgement = ack-nhfb, 26228 classcodes = "C6130 (Data handling techniques); C6150J (Operating systems)", 26229 corpsource = "Bell Labs., Murray Hill, NJ, USA", 26230 keywords = "operating systems (computers); OS; password security scheme; remotely accessed time sharing; security of data; system; UNIX ATT operating CACM", 26231 ort = "ordner sicherheit", 26232 treatment = "A Application; G General Review", 26233 } 26234 26235 @Article{Peleg:1979:BSC, 26236 author = "Shmuel Peleg and Azriel Rosenfeld", 26237 title = "Breaking Substitution Ciphers Using a Relaxation Algorithm", 26238 journal = j-CACM, 26239 volume = "22", 26240 number = "11", 26241 pages = "598--605", 26242 month = nov, 26243 year = "1979", 26244 CODEN = "CACMA2", 26245 ISSN = "0001-0782", 26246 bibdate = "Tue Mar 25 13:26:09 MST 1997", 26247 bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/security.1.bib", 26248 acknowledgement = ack-nhfb, 26249 classcodes = "C1230 (Artificial intelligence)", 26250 corpsource = "Univ. of Maryland, College Park, MD, USA", 26251 keywords = "artificial intelligence; computer security; cryptography; decoding; joint letter probabilities; letters; plaintext; relaxation; relaxation algorithm; substitution ciphers; updating scheme", 26252 ort = "ordner sicherheit", 26253 treatment = "T Theoretical or Mathematical", 26254 } 26255 26256 @Article{Tarjan:1979:SST, 26257 author = "Robert Endre Tarjan and Andrew Chi Chih Yao", 26258 title = "Storing a Sparse Table", 26259 journal = j-CACM, 26260 volume = "22", 26261 number = "11", 26262 pages = "606--611", 26263 month = nov, 26264 year = "1979", 26265 CODEN = "CACMA2", 26266 ISSN = "0001-0782", 26267 MRclass = "68B15 (68H05)", 26268 MRnumber = "81e:68019", 26269 mrreviewer = "Armin Cremers", 26270 bibdate = "Tue Mar 25 13:26:09 MST 1997", 26271 acknowledgement = ack-nhfb, 26272 classcodes = "C6120 (File organisation)", 26273 corpsource = "Stanford Univ., Stanford, CA, USA", 26274 keywords = "hashing; LR parsing tables; sparse table; static table; storage allocation", 26275 treatment = "P Practical; T Theoretical or Mathematical", 26276 } 26277 26278 @Article{Shamir:1979:HSS, 26279 author = "Adi Shamir", 26280 title = "How to Share a Secret", 26281 journal = j-CACM, 26282 volume = "22", 26283 number = "11", 26284 pages = "612--613", 26285 month = nov, 26286 year = "1979", 26287 CODEN = "CACMA2", 26288 ISSN = "0001-0782", 26289 MRclass = "94B99 (68E99)", 26290 MRnumber = "80g:94070", 26291 bibdate = "Tue Mar 25 13:26:09 MST 1997", 26292 bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/security.1.bib and ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib", 26293 acknowledgement = ack-nhfb, 26294 annote = "protection against loss of keys by dividing the data into pieces.", 26295 classcodes = "C6130 (Data handling techniques)", 26296 corpsource = "MIT, Cambridge, MA, USA", 26297 keywords = "computer security; cryptographic systems; cryptography; encoding; key management; robust key management schemes; security breaches; security of data", 26298 ort = "ordner sicherheit", 26299 treatment = "P Practical; T Theoretical or Mathematical", 26300 } 26301 26302 @Article{Lipis:1979:CCU, 26303 author = "A. H. Lipis", 26304 title = "Costs of the current {US} payments system", 26305 journal = j-CACM, 26306 volume = "22", 26307 number = "12", 26308 pages = "644--647", 26309 month = dec, 26310 year = "1979", 26311 CODEN = "CACMA2", 26312 ISSN = "0001-0782", 26313 bibdate = "Tue Mar 25 13:26:09 MST 1997", 26314 acknowledgement = ack-nhfb, 26315 classcodes = "C7120 (Financial computing)", 26316 corpsource = "Electronic Banking Inc., Atlanta, GA, USA", 26317 keywords = "banking industry; cash; credit cards; EFT; EFT transactions; EFTS; systems", 26318 treatment = "E Economic; P Practical", 26319 } 26320 26321 @Article{Long:1979:PPE, 26322 author = "R. H. Long", 26323 title = "Public protection and education with {EFT}", 26324 journal = j-CACM, 26325 volume = "22", 26326 number = "12", 26327 pages = "648--654", 26328 month = dec, 26329 year = "1979", 26330 CODEN = "CACMA2", 26331 ISSN = "0001-0782", 26332 bibdate = "Tue Mar 25 13:26:09 MST 1997", 26333 acknowledgement = ack-nhfb, 26334 classcodes = "C0230 (Economic, social and political aspects of computing); C7120 (Financial computing)", 26335 corpsource = "Bank Administration Inst., Park Ridge, IL, USA", 26336 keywords = "consumers; education; EFT; EFTS; social aspects of automation", 26337 treatment = "P Practical", 26338 } 26339 26340 @Article{Parker:1979:VEI, 26341 author = "D. B. Parker", 26342 title = "Vulnerabilities of {EFTs} to intentionally caused losses", 26343 journal = j-CACM, 26344 volume = "22", 26345 number = "12", 26346 pages = "654--660", 26347 month = dec, 26348 year = "1979", 26349 CODEN = "CACMA2", 26350 ISSN = "0001-0782", 26351 bibdate = "Tue Mar 25 13:26:09 MST 1997", 26352 acknowledgement = ack-nhfb, 26353 classcodes = "C0230 (Economic, social and political aspects of computing); C7120 (Financial computing)", 26354 corpsource = "SRI Internat., Menlo Park, CA, USA", 26355 keywords = "back-up requirements; business crimes; economics; EFTs; EFTS; electronic funds transfer systems; legislative actions; security; security of data", 26356 treatment = "P Practical", 26357 } 26358 26359 @Article{Kraemer:1979:PVE, 26360 author = "K. L. Kraemer and K. Colton", 26361 title = "Policy, values, and {EFT} research: anatomy of a research agenda", 26362 journal = j-CACM, 26363 volume = "22", 26364 number = "12", 26365 pages = "660--671", 26366 month = dec, 26367 year = "1979", 26368 CODEN = "CACMA2", 26369 ISSN = "0001-0782", 26370 bibdate = "Tue Mar 25 13:26:09 MST 1997", 26371 acknowledgement = ack-nhfb, 26372 classcodes = "C0230 (Economic, social and political aspects of computing); C7120 (Financial computing)", 26373 corpsource = "Univ. of California, Irvine, CA, USA", 26374 keywords = "American society; EFT research; EFTS; social aspects of automation", 26375 treatment = "B Bibliography; P Practical", 26376 } 26377 26378 @Article{Shoch:1979:MPE, 26379 author = "J. F. Shoch and J. A. Hupp", 26380 title = "Measured Performance of an {ETHERNET} Local Network", 26381 journal = j-CACM, 26382 volume = "23", 26383 number = "12", 26384 pages = "711--721", 26385 month = dec, 26386 year = "1979", 26387 CODEN = "CACMA2", 26388 ISSN = "0001-0782", 26389 bibdate = "Sat Jan 18 15:47:21 1997", 26390 bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1979.bib", 26391 country = "USA", 26392 descriptors = "LAN;", 26393 enum = "2893", 26394 language = "English", 26395 references = "0", 26396 } 26397 26398 @Article{Samet:1979:QMA, 26399 author = "Hanan Samet", 26400 title = "A quadtree medial axis transform", 26401 journal = j-CACM, 26402 volume = "26", 26403 number = "9", 26404 pages = "680--693", 26405 month = sep, 26406 year = "1979", 26407 CODEN = "CACMA2", 26408 ISSN = "0001-0782", 26409 bibdate = "Sat Jan 18 15:48:10 1997", 26410 bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Graphics/siggraph/79.bib", 26411 } 26412 26413 @Article{Pearson:1990:FHV, 26414 author = "Peter K. Pearson", 26415 title = "Fast Hashing of Variable-Length Text Strings", 26416 journal = j-CACM, 26417 volume = "33", 26418 number = "6", 26419 pages = "677--680", 26420 month = jun, 26421 year = "1990", 26422 CODEN = "CACMA2", 26423 ISSN = "0001-0782", 26424 bibdate = "Sat Apr 06 08:06:41 1996", 26425 bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/protein.pattern.bib", 26426 abstract = "Tailored to variable-length text strings, this hashing function uses very little arithmetic and can be used where perfect hashing is desired.", 26427 acknowledgement = ack-nhfb, 26428 annote = "Based on exclusive OR (XOR).", 26429 comment = "A simple fast hashing algorithm is given for variable length text strings. Essentially an xor is done over all of the characters of the string and the result is the hash value. Some analysis is done and a practical implementation is reported on.", 26430 review = "ACM CR 9012-0958", 26431 } 26432 26433 @Article{Sunday:1990:VFS, 26434 author = "Daniel M. Sunday", 26435 title = "A Very Fast Substring Search Algorithm", 26436 journal = j-CACM, 26437 volume = "33", 26438 number = "8", 26439 pages = "132--142", 26440 month = aug, 26441 year = "1990", 26442 CODEN = "CACMA2", 26443 ISSN = "0001-0782", 26444 bibdate = "Tue Jan 09 09:26:55 1996", 26445 note = "See also \cite{Boyer:1977:FSS} and \cite{Knuth:1977:FPM}.", 26446 acknowledgement = ack-nhfb, 26447 } 26448 26449 @Article{Dittmer:1991:NFH, 26450 author = "I. Dittmer", 26451 title = "Note on Fast Hashing of Variable Length Text Strings", 26452 journal = j-CACM, 26453 volume = "34", 26454 number = "11", 26455 pages = "118", 26456 month = nov, 26457 year = "1991", 26458 CODEN = "CACMA2", 26459 ISSN = "0001-0782", 26460 bibdate = "Sun Jul 17 19:42:16 1994", 26461 note = "Points out that Pearson's hashing algorithm \cite{Pearson:1990:FHV} was discovered fourteen years earlier by this author \cite{Dittmer:1976:IEP}. See also comments in \cite{Savoy:1991:NFH,Litsios:1991:NFH,Pearson:1991:NFH}.", 26462 } 26463 26464 @Article{Savoy:1991:NFH, 26465 author = "Jacques Savoy", 26466 title = "Note on Fast Hashing of Variable Length Text Strings", 26467 journal = j-CACM, 26468 volume = "34", 26469 number = "11", 26470 pages = "118--119", 26471 month = nov, 26472 year = "1991", 26473 CODEN = "CACMA2", 26474 ISSN = "0001-0782", 26475 bibdate = "Tue Jul 19 17:58:09 1994", 26476 note = "Suggests an improvement to Pearson's hashing algorithm \cite{Pearson:1990:FHV} that avoids secondary clustering. Exhibits a key set for which Pearson's algorithm produces alarming clustering. See also comments in \cite{Dittmer:1991:NFH,Litsios:1991:NFH,Pearson:1991:NFH}.", 26477 acknowledgement = ack-nhfb, 26478 } 26479 26480 @Article{Litsios:1991:NFH, 26481 author = "James Litsios", 26482 title = "Note on Fast Hashing of Variable Length Text Strings", 26483 journal = j-CACM, 26484 volume = "34", 26485 number = "11", 26486 pages = "118--120", 26487 month = nov, 26488 year = "1991", 26489 CODEN = "CACMA2", 26490 ISSN = "0001-0782", 26491 bibdate = "Tue Jul 19 18:02:04 1994", 26492 note = "Suggests a simple extension of Pearson's hashing algorithm \cite{Pearson:1990:FHV} that supports non-character data. See also comments in \cite{Dittmer:1991:NFH,Savoy:1991:NFH,Pearson:1991:NFH}.", 26493 acknowledgement = ack-nhfb, 26494 } 26495 26496 %======================================================================= 26497 % Cross-referenced entries come last. 26498 26499 @Article{Pearson:1991:NFH, 26500 author = "Peter Pearson", 26501 title = "Note on Fast Hashing of Variable Length Text Strings", 26502 journal = j-CACM, 26503 volume = "34", 26504 number = "11", 26505 pages = "120", 26506 month = nov, 26507 year = "1991", 26508 CODEN = "CACMA2", 26509 ISSN = "0001-0782", 26510 bibdate = "Tue Jul 19 17:58:54 1994", 26511 note = "Responds to several comments \cite{Dittmer:1991:NFH,Litsios:1991:NFH,Savoy:1991:NFH} on the author's earlier paper \cite{Pearson:1990:FHV}.", 26512 acknowledgement = ack-nhfb, 26513 } 26514 26515 @Article{Knuth:1974:SPG, 26516 author = "Donald E. Knuth", 26517 title = "Structured Programming with {\bf go to} Statements", 26518 journal = j-COMP-SURV, 26519 volume = "6", 26520 number = "4", 26521 pages = "261--301", 26522 month = dec, 26523 year = "1974", 26524 CODEN = "CMSVAN", 26525 ISSN = "0360-0300", 26526 bibdate = "Sat Aug 27 10:36:49 1994", 26527 note = "Reprinted with revisions in {\sl Current Trends in Programming Methodology}, Raymond T. Yeh, ed., {\bf 1} (Englewood Cliffs, NJ: Prentice-Hall, 1977), 140--194; {\sl Classics in Software Engineering}, Edward Nash Yourdon, ed.\ (New York: Yourdon Press, 1979), 259--321. Reprinted with ``final'' revisions in \cite[pp. 17--89]{Knuth:1992:LP}. This paper is a response to \cite{Dijkstra:1968:GSC}.", 26528 acknowledgement = ack-nhfb, 26529 } 26530 26531 @Article{Graham:1976:FUL, 26532 author = "Susan L. Graham and Mark Wegman", 26533 title = "A Fast and Usually Linear Algorithm for Global Flow Analysis", 26534 journal = j-J-ACM, 26535 volume = "23", 26536 number = "1", 26537 pages = "172--202", 26538 month = jan, 26539 year = "1976", 26540 CODEN = "JACOAH", 26541 ISSN = "0004-5411", 26542 bibdate = "Wed Jan 15 18:12:53 MST 1997", 26543 bibsource = "Compendex database", 26544 abstract = "A new algorithm for global flow analysis on reducible graphs is presented. The algorithm is shown to treat a very general class of function spaces. For a graph of e edges, the algorithm has a worst-case time bound of 0(e log e) function operations. It is also shown that in programming terms, the number of operations is proportional to e plus the number of exits from program loops. Consequently a restriction to one-entry one-exit control structures guarantees linearity. The algorithm can be extended to yet larger classes of function spaces and graphs by relaxing the time bound. Examples are given of code improvement problems which can be solved using the algorithm.", 26545 acknowledgement = ack-nhfb, 26546 classification = "723; 921", 26547 journalabr = "J Assoc Comput Mach", 26548 keywords = "computer programming; mathematical programming", 26549 } 26550 26551 @Article{Brown:1972:CSC, 26552 author = "R. J. Brown", 26553 title = "Chromatic scheduling and the chromatic number problem", 26554 journal = j-MANAGEMENT-SCIENCE, 26555 volume = "19", 26556 pages = "451--463", 26557 year = "1972", 26558 CODEN = "MSCIAM", 26559 ISSN = "0025-1909", 26560 annote = "Implicit enumeration algorithm [not seen].", 26561 } 26562 26563 @Article{Knuth:1977:FPM, 26564 author = "Donald E. Knuth and J. H. Morris and V. R. Pratt", 26565 title = "Fast pattern matching in strings", 26566 journal = j-SIAM-J-COMPUT, 26567 volume = "6", 26568 number = "2", 26569 pages = "323--350", 26570 month = jun, 26571 year = "1977", 26572 CODEN = "SMJCAT", 26573 ISSN = "0097-5397", 26574 bibdate = "Tue Feb 6 05:29:37 1996", 26575 note = "See also \cite{Boyer:1977:FSS} and \cite{Sunday:1990:VFS}.", 26576 } 26577 26578 @Article{Tharp:1982:PTS, 26579 author = "A. L. Tharp and K.-C. Tai", 26580 title = "The practicality of text signatures for accelerating string searching", 26581 journal = j-SPE, 26582 volume = "12", 26583 number = "1", 26584 pages = "35--44", 26585 month = jan, 26586 year = "1982", 26587 CODEN = "SPEXBL", 26588 ISSN = "0038-0644", 26589 bibdate = "Tue Feb 06 05:30:19 1996", 26590 note = "Expands Harrison's work \cite{Harrison:1971:IST}.", 26591 acknowledgement = ack-nhfb, 26592 } 26593 26594 @Article{Skovgaard:1975:RBF, 26595 author = "Ove Skovgaard", 26596 title = "Remark on {``Algorithm 236: Bessel Functions of the First Kind [S17]''}", 26597 journal = j-TOMS, 26598 volume = "1", 26599 number = "3", 26600 pages = "282--284", 26601 month = sep, 26602 year = "1975", 26603 CODEN = "ACMSCU", 26604 ISSN = "0098-3500", 26605 bibdate = "Tue Feb 06 05:26:43 1996", 26606 note = "See \cite{Gautschi:1964:AAB}.", 26607 acknowledgement = ack-nhfb, 26608 } 26609 26610 @Article{Misra:1975:RG, 26611 author = "Jayadev Misra", 26612 title = "Remark on {``Algorithm 246: Graycode [Z]''}", 26613 journal = j-TOMS, 26614 volume = "1", 26615 number = "3", 26616 pages = "285--285", 26617 month = sep, 26618 year = "1975", 26619 CODEN = "ACMSCU", 26620 ISSN = "0098-3500", 26621 bibdate = "Tue Feb 06 05:25:57 1996", 26622 note = "See \cite{Boothroyd:1964:AAG,Er:1985:RG}.", 26623 acknowledgement = ack-nhfb, 26624 } 26625 26626 @Article{Feinstein:1975:RMT, 26627 author = "Robert Feinstein", 26628 title = "Remark on {``Algorithm 483: Masked Three-Dimensional Plot Program with Rotations [J6]''}", 26629 journal = j-TOMS, 26630 volume = "1", 26631 number = "9", 26632 pages = "285--285", 26633 month = sep, 26634 year = "1975", 26635 CODEN = "ACMSCU", 26636 ISSN = "0098-3500", 26637 bibdate = "Tue Feb 06 05:25:34 1996", 26638 note = "See \cite{Watkins:1974:AAM}.", 26639 acknowledgement = ack-nhfb, 26640 } 26641 26642 @Article{Boulton:1976:REP, 26643 author = "D. M. Boulton", 26644 title = "Remark on {``Algorithm 434: Exact Probabilities for $R\times{C}$ Contingency Tables [G2]''}", 26645 journal = j-TOMS, 26646 volume = "2", 26647 number = "1", 26648 pages = "108--108", 26649 month = mar, 26650 year = "1976", 26651 CODEN = "ACMSCU", 26652 ISSN = "0098-3500", 26653 bibdate = "Tue Feb 06 05:26:29 1996", 26654 note = "See \cite{March:1972:AAE}.", 26655 acknowledgement = ack-nhfb, 26656 } 26657 26658 @Article{Duta:1976:RVS, 26659 author = "Lucian D. Duta", 26660 title = "Remark on {``Algorithm 475: Visible Surface Plotting Program [J6]''}", 26661 journal = j-TOMS, 26662 volume = "2", 26663 number = "1", 26664 pages = "109--110", 26665 month = mar, 26666 year = "1976", 26667 CODEN = "ACMSCU", 26668 ISSN = "0098-3500", 26669 bibdate = "Tue Feb 06 05:26:59 1996", 26670 note = "See \cite{Wright:1974:VSP}.", 26671 acknowledgement = ack-nhfb, 26672 } 26673 26674 @Article{White:1976:RMS, 26675 author = "G. M. White and S. Goudreau and J. L. Legros", 26676 title = "Remark on {``Algorithm 479: A Minimal Spanning Tree Clustering Method [Z]''}", 26677 journal = j-TOMS, 26678 volume = "2", 26679 number = "1", 26680 pages = "110--111", 26681 month = mar, 26682 year = "1976", 26683 CODEN = "ACMSCU", 26684 ISSN = "0098-3500", 26685 bibdate = "Tue Feb 06 05:28:06 1996", 26686 note = "See \cite{Page:1974:AAM}.", 26687 acknowledgement = ack-nhfb, 26688 } 26689 26690 @Article{Pomeranz:1976:REC, 26691 author = "J. Pomeranz", 26692 title = "Remark on {``Algorithm 487: Exact Cumulative Distribution of the Kolmogorov-Smirnov Statistic for Small Samples [S14]''}", 26693 journal = j-TOMS, 26694 volume = "2", 26695 number = "1", 26696 pages = "111--111", 26697 month = mar, 26698 year = "1976", 26699 CODEN = "ACMSCU", 26700 ISSN = "0098-3500", 26701 bibdate = "Tue Feb 06 05:28:05 1996", 26702 note = "See \cite{Pomeranz:1974:AAE}.", 26703 acknowledgement = ack-nhfb, 26704 } 26705 26706 @Article{Morris:1976:RDF, 26707 author = "Robert Morris", 26708 title = "Remark on {``Algorithm 490: The Dilogarithm Function of a Real Argument [S22]''}", 26709 journal = j-TOMS, 26710 volume = "2", 26711 number = "1", 26712 pages = "112--112", 26713 month = mar, 26714 year = "1976", 26715 CODEN = "ACMSCU", 26716 ISSN = "0098-3500", 26717 bibdate = "Tue Feb 06 05:28:02 1996", 26718 note = "See \cite{Ginsberg:1975:AAD}.", 26719 acknowledgement = ack-nhfb, 26720 } 26721 26722 @Article{Pike:1976:RIB, 26723 author = "Malcolm C. Pike and Jennie SooHoo", 26724 title = "Remark on {``Algorithm 179: Incomplete Beta Ratio [S14]''}", 26725 journal = j-TOMS, 26726 volume = "2", 26727 number = "2", 26728 pages = "207--208", 26729 month = jun, 26730 year = "1976", 26731 CODEN = "ACMSCU", 26732 ISSN = "0098-3500", 26733 bibdate = "Tue Feb 06 05:28:04 1996", 26734 note = "See \cite{Ludwig:1963:AAI}.", 26735 acknowledgement = ack-nhfb, 26736 } 26737 26738 @Article{Anderson:1976:RIS, 26739 author = "Michael R. Anderson", 26740 title = "Remark on {``Algorithm 433: Interpolation and Smooth Curve Fitting Based on Local Procedures [E2]''}", 26741 journal = j-TOMS, 26742 volume = "2", 26743 number = "2", 26744 pages = "208--208", 26745 month = jun, 26746 year = "1976", 26747 CODEN = "ACMSCU", 26748 ISSN = "0098-3500", 26749 bibdate = "Tue Feb 06 05:26:36 1996", 26750 note = "See \cite{Akima:1972:AAI}.", 26751 acknowledgement = ack-nhfb, 26752 } 26753 26754 @Article{Davies:1976:RRF, 26755 author = "Alan M. Davies", 26756 title = "Remark on {``Algorithm 450: Rosenbrock Function Minimization [E4]''}", 26757 journal = j-TOMS, 26758 volume = "2", 26759 number = "3", 26760 pages = "300--301", 26761 month = sep, 26762 year = "1976", 26763 CODEN = "ACMSCU", 26764 ISSN = "0098-3500", 26765 bibdate = "Tue Feb 06 05:26:54 1996", 26766 note = "See \cite{MacHura:1973:AAR}.", 26767 acknowledgement = ack-nhfb, 26768 } 26769 26770 @Article{Brown:1976:RAS, 26771 author = "Theodore Brown", 26772 title = "Remark on {``Algorithm 489: The Algorithm SELECT --- for Finding the $i$th Smallest of $n$ Elements [M1]''}", 26773 journal = j-TOMS, 26774 volume = "2", 26775 number = "3", 26776 pages = "301--304", 26777 month = sep, 26778 year = "1976", 26779 CODEN = "ACMSCU", 26780 ISSN = "0098-3500", 26781 bibdate = "Tue Feb 06 05:26:24 1996", 26782 note = "See \cite{Floyd:1975:AAA}.", 26783 acknowledgement = ack-nhfb, 26784 } 26785 26786 @Article{Ito:1976:RIT, 26787 author = "M. R. Ito", 26788 title = "Remark on {``Algorithm 284: Interchange of Two Blocks of Data [K2]''}", 26789 journal = j-TOMS, 26790 volume = "2", 26791 number = "4", 26792 pages = "392--393", 26793 month = dec, 26794 year = "1976", 26795 CODEN = "ACMSCU", 26796 ISSN = "0098-3500", 26797 bibdate = "Tue Feb 06 05:27:37 1996", 26798 note = "See \cite{Fletcher:1966:AAI}.", 26799 acknowledgement = ack-nhfb, 26800 } 26801 26802 @Article{Lozy:1976:RCS, 26803 author = "Mohamed el Lozy", 26804 title = "Remark on {``Algorithm 299: Chi-Squared Integral [S15]''}", 26805 journal = j-TOMS, 26806 volume = "2", 26807 number = "4", 26808 pages = "393--395", 26809 month = dec, 26810 year = "1976", 26811 CODEN = "ACMSCU", 26812 ISSN = "0098-3500", 26813 bibdate = "Tue Feb 06 05:28:00 1996", 26814 note = "See \cite{Hill:1967:AAC,Hill:1985:RCS}.", 26815 acknowledgement = ack-nhfb, 26816 } 26817 26818 @Article{Koppelaar:1976:RNI, 26819 author = "Henk Koppelaar and Peter Molenaar", 26820 title = "Remark on {``Algorithm 486: Numerical Inversion of Laplace Transform [D5]''}", 26821 journal = j-TOMS, 26822 volume = "2", 26823 number = "4", 26824 pages = "395--396", 26825 month = dec, 26826 year = "1976", 26827 CODEN = "ACMSCU", 26828 ISSN = "0098-3500", 26829 bibdate = "Tue Feb 06 05:27:48 1996", 26830 note = "See \cite{Veillon:1974:AAN}.", 26831 acknowledgement = ack-nhfb, 26832 } 26833 26834 @Article{Cate:1977:AAS, 26835 author = "Esko G. Cate and David W. Twigg", 26836 title = "Algorithm 513: Analysis of In-Situ Transposition [{F1}]", 26837 journal = j-TOMS, 26838 volume = "3", 26839 number = "1", 26840 pages = "104--110", 26841 month = mar, 26842 year = "1977", 26843 CODEN = "ACMSCU", 26844 ISSN = "0098-3500", 26845 bibdate = "Tue Feb 06 05:28:07 1996", 26846 acknowledgement = ack-nhfb, 26847 } 26848 26849 @Article{Veillon:1977:RNI, 26850 author = "Fran{\c{c}}oise Veillon", 26851 title = "Remark on {``Algorithm 486: Numerical Inversion of Laplace Transform''}", 26852 journal = j-TOMS, 26853 volume = "3", 26854 number = "1", 26855 pages = "111--111", 26856 month = mar, 26857 year = "1977", 26858 CODEN = "ACMSCU", 26859 ISSN = "0098-3500", 26860 bibdate = "Tue Feb 06 05:28:10 1996", 26861 note = "See \cite{Veillon:1974:AAN}.", 26862 acknowledgement = ack-nhfb, 26863 } 26864 26865 @Article{Jansen:1977:RLF, 26866 author = "J. K. M. Jansen", 26867 title = "Remark on {``Algorithm 259: Legendre Functions for Arguments Larger than One''}", 26868 journal = j-TOMS, 26869 volume = "3", 26870 number = "2", 26871 pages = "204--250", 26872 month = jun, 26873 year = "1977", 26874 CODEN = "ACMSCU", 26875 ISSN = "0098-3500", 26876 bibdate = "Tue Feb 06 05:28:08 1996", 26877 note = "See \cite{Gautschi:1965:AAL}.", 26878 acknowledgement = ack-nhfb, 26879 } 26880 26881 @Article{Sipala:1977:RAS, 26882 author = "Paolo Sipala", 26883 title = "Remark on {``Algorithm 408: A Sparse Matrix Package (Part I) [F4]''}", 26884 journal = j-TOMS, 26885 volume = "3", 26886 number = "3", 26887 pages = "303--303", 26888 month = sep, 26889 year = "1977", 26890 CODEN = "ACMSCU", 26891 ISSN = "0098-3500", 26892 bibdate = "Tue Feb 06 05:28:09 1996", 26893 note = "See \cite{McNamee:1971:AAS}.", 26894 acknowledgement = ack-nhfb, 26895 } 26896 26897 @Article{Tenney:1977:RAT, 26898 author = "Dennis Tenney", 26899 title = "Remark on {``Algorithm 219: Topological Ordering for PERT Networks''}", 26900 journal = j-TOMS, 26901 volume = "3", 26902 number = "3", 26903 pages = "303--303", 26904 month = sep, 26905 year = "1977", 26906 CODEN = "ACMSCU", 26907 ISSN = "0098-3500", 26908 bibdate = "Tue Feb 06 05:28:09 1996", 26909 note = "See \cite{Kase:1963:AAT}.", 26910 acknowledgement = ack-nhfb, 26911 } 26912 26913 @Article{Skovgaard:1978:RCE, 26914 author = "Ove Skovgaard", 26915 title = "Remark on {``Algorithm 149: Complete Elliptic Integral [S21]''}", 26916 journal = j-TOMS, 26917 volume = "4", 26918 number = "1", 26919 pages = "95--95", 26920 month = mar, 26921 year = "1978", 26922 CODEN = "ACMSCU", 26923 ISSN = "0098-3500", 26924 bibdate = "Tue Feb 06 05:28:13 1996", 26925 note = "See \cite{Merner:1962:AAC}.", 26926 acknowledgement = ack-nhfb, 26927 } 26928 26929 @Article{Coleman:1978:RAS, 26930 author = "John P. Coleman", 26931 title = "Remark on {``Algorithm 49: Spherical Neumann Function''}", 26932 journal = j-TOMS, 26933 volume = "4", 26934 number = "3", 26935 pages = "295--295", 26936 month = sep, 26937 year = "1978", 26938 CODEN = "ACMSCU", 26939 ISSN = "0098-3500", 26940 bibdate = "Tue Feb 06 05:28:11 1996", 26941 note = "See \cite{Herndon:1961:AAS}.", 26942 acknowledgement = ack-nhfb, 26943 } 26944 26945 @Article{Gustavson:1978:RAS, 26946 author = "Fred G. Gustavson", 26947 title = "Remark on {``Algorithm 408: A Sparse Matrix Package (Part I) [F4]''}", 26948 journal = j-TOMS, 26949 volume = "4", 26950 number = "3", 26951 pages = "295--295", 26952 month = sep, 26953 year = "1978", 26954 CODEN = "ACMSCU", 26955 ISSN = "0098-3500", 26956 bibdate = "Tue Feb 06 05:28:12 1996", 26957 note = "See \cite{McNamee:1971:AAS}.", 26958 acknowledgement = ack-nhfb, 26959 } 26960 26961 @Article{Schoene:1978:RMI, 26962 author = "Andrew Y. Schoene", 26963 title = "Remark on {``Algorithm 435: Modified Incomplete Gamma Function [S14]''}", 26964 journal = j-TOMS, 26965 volume = "4", 26966 number = "3", 26967 pages = "296--304", 26968 month = sep, 26969 year = "1978", 26970 CODEN = "ACMSCU", 26971 ISSN = "0098-3500", 26972 bibdate = "Tue Feb 06 05:28:12 1996", 26973 note = "See \cite{Fullerton:1972:AAM}.", 26974 acknowledgement = ack-nhfb, 26975 } 26976 26977 @Article{Lozy:1979:RSD, 26978 author = "Mohamed el Lozy", 26979 title = "Remark on {``Algorithm 395: Student's $t$-Distribution''} and Remark on {``Algorithm 396: Student's Quantiles [S14]''}", 26980 journal = j-TOMS, 26981 volume = "5", 26982 number = "2", 26983 pages = "238--239", 26984 month = jun, 26985 year = "1979", 26986 CODEN = "ACMSCU", 26987 ISSN = "0098-3500", 26988 bibdate = "Tue Feb 06 05:28:16 1996", 26989 note = "See \cite{Hill:1970:AASa,Hill:1970:AASb,Hill:1981:RSD,Hill:1985:RCS}.", 26990 acknowledgement = ack-nhfb, 26991 } 26992 26993 @Article{Geddes:1979:RCC, 26994 author = "K. O. Geddes", 26995 title = "Remark on {``Algorithm 424: Clenshaw-Curtis Quadrature [O1]''}", 26996 journal = j-TOMS, 26997 volume = "5", 26998 number = "2", 26999 pages = "240--240", 27000 month = jun, 27001 year = "1979", 27002 CODEN = "ACMSCU", 27003 ISSN = "0098-3500", 27004 bibdate = "Tue Feb 06 05:28:14 1996", 27005 note = "See \cite{Gentleman:1972:AAC}.", 27006 acknowledgement = ack-nhfb, 27007 } 27008 27009 @Article{Anderson:1979:RBI, 27010 author = "M. R. Anderson", 27011 title = "Remark on {``Algorithm 474: Bivariate Interpolation and Smooth Surface Fitting Based on Local Procedures''}", 27012 journal = j-TOMS, 27013 volume = "5", 27014 number = "2", 27015 pages = "241--241", 27016 month = jun, 27017 year = "1979", 27018 CODEN = "ACMSCU", 27019 ISSN = "0098-3500", 27020 bibdate = "Tue Feb 06 05:28:13 1996", 27021 note = "See \cite{Akima:1974:AAB}.", 27022 acknowledgement = ack-nhfb, 27023 } 27024 27025 @Article{Leathers:1979:RAS, 27026 author = "Burton L. Leathers", 27027 title = "Remark on {``Algorithm 513: Analysis of In-Situ Transposition [F1]''} and Remark on {``Algorithm 467: Matrix Transposition in Place''}", 27028 journal = j-TOMS, 27029 volume = "5", 27030 number = "4", 27031 pages = "520--520", 27032 month = dec, 27033 year = "1979", 27034 CODEN = "ACMSCU", 27035 ISSN = "0098-3500", 27036 bibdate = "Tue Feb 06 05:28:15 1996", 27037 note = "See \cite{Cate:1977:AAS,Brenner:1973:AAM}.", 27038 acknowledgement = ack-nhfb, 27039 } 27040 27041 @Article{Swieten:1979:RVS, 27042 author = "A. C. M. van Swieten and J. Th. M. de Hosson", 27043 title = "Remark on {``Algorithm 475: Visible Surface Plotting Program''}", 27044 journal = j-TOMS, 27045 volume = "5", 27046 number = "4", 27047 pages = "521--523", 27048 month = dec, 27049 year = "1979", 27050 CODEN = "ACMSCU", 27051 ISSN = "0098-3500", 27052 bibdate = "Tue Feb 06 05:28:16 1996", 27053 note = "See \cite{Wright:1974:VSP}.", 27054 acknowledgement = ack-nhfb, 27055 } 27056 27057 @Article{Harms:1980:RSM, 27058 author = "U. Harms and H. Kollakowski and G. M{\"{o}}ller", 27059 title = "Remark on {``Algorithm 408: A Sparse Matrix Package (Part 1) [F4]''}", 27060 journal = j-TOMS, 27061 volume = "6", 27062 number = "3", 27063 pages = "456--457", 27064 month = sep, 27065 year = "1980", 27066 CODEN = "ACMSCU", 27067 ISSN = "0098-3500", 27068 bibdate = "Tue Feb 06 05:28:17 1996", 27069 note = "See \cite{McNamee:1971:AAS}.", 27070 acknowledgement = ack-nhfb, 27071 } 27072 27073 @Article{Hill:1981:RSD, 27074 author = "G. W. Hill", 27075 title = "Remark on {``Algorithm 395: Student's $t$-Distribution''}", 27076 journal = j-TOMS, 27077 volume = "7", 27078 number = "2", 27079 pages = "247--249", 27080 month = jun, 27081 year = "1981", 27082 CODEN = "ACMSCU", 27083 ISSN = "0098-3500", 27084 bibdate = "Tue Feb 06 05:28:18 1996", 27085 note = "See \cite{Hill:1970:AASa,Hill:1970:AASb,Lozy:1979:RSD}.", 27086 acknowledgement = ack-nhfb, 27087 } 27088 27089 @Article{Hill:1981:RSQ, 27090 author = "G. W. Hill", 27091 title = "Remark on {``Algorithm 396: Student's $t$-Quantiles''}", 27092 journal = j-TOMS, 27093 volume = "7", 27094 number = "2", 27095 pages = "250--251", 27096 month = jun, 27097 year = "1981", 27098 CODEN = "ACMSCU", 27099 ISSN = "0098-3500", 27100 bibdate = "Tue Feb 06 05:28:19 1996", 27101 note = "See \cite{Hill:1970:AASb}.", 27102 acknowledgement = ack-nhfb, 27103 } 27104 27105 @Article{Hill:1985:RCS, 27106 author = "I. D. Hill and M. C. Pike", 27107 title = "Remark on {``Algorithm 299: Chi-Squared Integral''}", 27108 journal = j-TOMS, 27109 volume = "11", 27110 number = "2", 27111 pages = "185--185", 27112 month = jun, 27113 year = "1985", 27114 CODEN = "ACMSCU", 27115 ISSN = "0098-3500", 27116 bibdate = "Tue Feb 06 05:28:22 1996", 27117 note = "See \cite{Hill:1967:AAC,Lozy:1976:RCS}.", 27118 acknowledgement = ack-nhfb, 27119 } 27120 27121 @Article{Er:1985:RG, 27122 author = "M. C. Er", 27123 title = "Remark on {``Algorithm 246: Graycode [Z]''}", 27124 journal = j-TOMS, 27125 volume = "11", 27126 number = "4", 27127 pages = "441--443", 27128 month = dec, 27129 year = "1985", 27130 CODEN = "ACMSCU", 27131 ISSN = "0098-3500", 27132 bibdate = "Tue Feb 06 05:28:21 1996", 27133 note = "See \cite{Boothroyd:1964:AAG,Misra:1975:RG}.", 27134 acknowledgement = ack-nhfb, 27135 } 27136 27137 @Manual{ANSI:1966:AF, 27138 title = "{ANSI Fortran X3.9-1966}", 27139 organization = pub-ANSI, 27140 address = pub-ANSI:adr, 27141 pages = "??--??", 27142 year = "1966", 27143 bibdate = "Sat Jan 18 15:48:20 1997", 27144 note = "Approved March 7, 1966 (also known as Fortran 66). See also subsequent clarifications \cite{ANSI:1969:CFS} and \cite{ANSI:1971:CFS}.", 27145 } 27146 27147 @PhdThesis{deBalbine:1969:CAR, 27148 author = "Guy {de Balbine}", 27149 title = "Computational Analysis of the Random Components Induced by a Binary Equivalence Relation", 27150 type = "Ph.D. thesis", 27151 school = "California Institute of Technology", 27152 address = "Pasadena, CA, USA", 27153 pages = "168", 27154 year = "1969", 27155 bibdate = "Sat Feb 17 13:24:16 1996", 27156 note = "First use of second hash function for computing next hash table location after a collision.", 27157 abstract = "The problem of partitioning into classes by means of a binary equivalence relation is investigated. Several algorithms for determining the number of components in the graph associated with a particular set of elements are constructed and compared. When the classification process operates on independently-drawn samples of $n$ distinct elements from a population, the expected number of components is shown to be obtainable recursively for a class of problems called separable; in all cases, estimates are available to reach any desired level of accuracy. Clustering models in Euclidean space are analyzed in detail and asymptotic formulas obtained to complement experiments. Conjectures concerning the general behavior of the expected number of components are presented also. Finally, several computational tools of general interest are improved significantly.", 27158 acknowledgement = ack-nhfb, 27159 annote = "Abstract in Dissertation Abstracts, v30 n2 p645b 1969.", 27160 } 27161 27162 @InProceedings{Korman:1970:CO, 27163 author = "S. M. Korman", 27164 editor = "N. Christofides and A. Mingozzi and P. Toth and C. Sandi", 27165 booktitle = "Combinatorial Optimization", 27166 title = "The graph-colouring problem", 27167 publisher = "Wiley", 27168 address = "New York", 27169 pages = "211--235", 27170 year = "1970", 27171 annote = "Implicit enumeration algorithm [not seen].", 27172 } 27173 27174 @Book{Knuth:1973:ACP, 27175 author = "D. E. Knuth", 27176 title = "The Art of Computer Programming, Sorting and Searching", 27177 volume = "3", 27178 publisher = pub-AW, 27179 address = pub-AW:adr, 27180 pages = "xi + 723", 27181 year = "1973", 27182 ISBN = "0-201-03803-X", 27183 LCCN = "QA76.5 .K74", 27184 bibdate = "Wed Dec 15 15:47:47 1993", 27185 acknowledgement = ack-nhfb, 27186 annote = "Standardwerk ueber Suchen und Sortieren 5. Sorting 5.1. Combinatorial Properties of Permutations 5.2. Internal Sorting 5.3. Optimum Sorting 5.4. External Sorting 5.5. Summary, History, and Bibliography 6. Searching 6.1. Sequential Search 6.2. Searching By Comparison of Keys 6.3. Digital Searching 6.4. Hashing 6.5. Retrieval on Secondary Keys Answers to Exercises Appendix A: Tables of Numerical Quantities Appendix B: Index to Notations Index and Glossary.", 27187 annote2 = "A basic source for computational algorithms such as hashing (pp.506--568), search tree construction(pp.406--505), and some notes on disk performance evaluation (pp.361--371).", 27188 descriptor = "Algorithmus, B-baum, Baum, Binaer-baum, Gestreute Speicherung, Hash-verfahren, Mischen, Sortieren, Speicherung, Suchen, Zugriff", 27189 } 27190 27191 @MastersThesis{Dittmer:1976:IEP, 27192 author = "Ingo Dittmer", 27193 title = "{Implementation eines Einschrittcompilers f{\"u}r die Progammiersprache PASCAL auf der Rechenanlage IBM\slash 360 der Universit{\"a}t M{\"u}nster}. ({English} title: Implementation of a One-Step Compiler for the Programming Language {PASCAL} on the {IBM}\slash 360 of the {University of Muenster})", 27194 type = "Diplomearbeit", 27195 school = "Universit{\"a}t M{\"u}nster", 27196 address = "M{\"u}nster, Germany", 27197 pages = "??", 27198 month = "??", 27199 year = "1976", 27200 bibdate = "Sat Feb 17 13:24:29 1996", 27201 note = "Diplomearbeit M{\"u}nster 1976 und doert angegebene Literatur (English: Muenster diploma work 1976 and the literature cited therein). The hashing method was rediscovered fourteen years later by Pearson \cite{Pearson:1990:FHV}, and then commented on by several authors \cite{Dittmer:1991:NFH,Savoy:1991:NFH,Litsios:1991:NFH,Pearson:1991:NFH}.", 27202 acknowledgement = ack-nhfb, 27203 xxnote = "Cannot find in Dissertation Abstracts, European.", 27204 } 27205 27206 @Book{Knuth:1992:LP, 27207 author = "Donald E. Knuth", 27208 title = "Literate Programming", 27209 publisher = pub-SUCSLI, 27210 address = pub-SUCSLI:adr, 27211 pages = "xvi + 368", 27212 year = "1992", 27213 ISBN = "0-937073-80-6 (paperback), 0-937073-81-4 (hardcover)", 27214 LCCN = "QA76.6 .K644 1992", 27215 bibdate = "Fri Jul 22 09:08:14 1994", 27216 note = "Distributed by the University of Chicago Press.", 27217 price = "US\$24.95 (paperback), US\$59.95 (hardcover)", 27218 series = "CSLI Lecture Notes Number 27", 27219 acknowledgement = ack-nhfb, 27220 } 27221
Indexes created Sat Jul 18 00:24:37 UTC 2026