Debian Codegraph @

texmf-dist/bibtex/bib/beebe/stanford-cstr.bib

raw
1 %%% -*-BibTeX-*-
2 %%% ====================================================================
3 %%% BibTeX-file{
4 %%% author = "Nelson H. F. Beebe",
5 %%% version = "1.10",
6 %%% date = "03 February 2026",
7 %%% time = "08:00:42 MDT",
8 %%% filename = "stanford-cstr.bib",
9 %%% address = "University of Utah
10 %%% Department of Mathematics, 110 LCB
11 %%% 155 S 1400 E RM 233
12 %%% Salt Lake City, UT 84112-0090
13 %%% USA",
14 %%% telephone = "+1 801 581 5254",
15 %%% URL = "https://www.math.utah.edu/~beebe",
16 %%% checksum = "03566 53346 275184 2557082",
17 %%% email = "beebe at math.utah.edu, beebe at acm.org,
18 %%% beebe at computer.org (Internet)",
19 %%% codetable = "ISO/ASCII",
20 %%% keywords = "bibliography; BibTeX; Stanford University
21 %%% Computer Science technical reports",
22 %%% license = "public domain",
23 %%% supported = "yes",
24 %%% docstring = "This file provides BibTeX entries for Stanford
25 %%% University Computer Science technical reports.
26 %%%
27 %%% At version 1.10, the COMPLETE year coverage
28 %%% looked like this:
29 %%%
30 %%% 1963 ( 2) 1982 ( 54) 2001 ( 3)
31 %%% 1964 ( 12) 1983 ( 47) 2002 ( 3)
32 %%% 1965 ( 19) 1984 ( 37) 2003 ( 6)
33 %%% 1966 ( 19) 1985 ( 62) 2004 ( 4)
34 %%% 1967 ( 29) 1986 ( 53) 2005 ( 9)
35 %%% 1968 ( 37) 1987 ( 39) 2006 ( 14)
36 %%% 1969 ( 28) 1988 ( 55) 2007 ( 18)
37 %%% 1970 ( 50) 1989 ( 62) 2008 ( 6)
38 %%% 1971 ( 60) 1990 ( 49) 2009 ( 4)
39 %%% 1972 ( 87) 1991 ( 58) 2010 ( 4)
40 %%% 1973 ( 73) 1992 ( 53) 2011 ( 4)
41 %%% 1974 ( 69) 1993 ( 33) 2012 ( 4)
42 %%% 1975 ( 62) 1994 ( 35) 2013 ( 3)
43 %%% 1976 ( 56) 1995 ( 27) 2014 ( 4)
44 %%% 1977 ( 59) 1996 ( 16) 2015 ( 1)
45 %%% 1978 ( 57) 1997 ( 23) 2016 ( 2)
46 %%% 1979 ( 79) 1998 ( 16) 2017 ( 1)
47 %%% 1980 ( 60) 1999 ( 9)
48 %%% 1981 ( 61) 2000 ( 8)
49 %%%
50 %%% Article: 3
51 %%% Book: 3
52 %%% TechReport: 1739
53 %%%
54 %%% Total entries: 1745
55 %%%
56 %%% The highest recorded report number up to 1999
57 %%% is CS-TR-99-1625, where the last number
58 %%% increments sequentially since the first
59 %%% report in 1963. From the year 2000, global
60 %%% sequential numbers are no longer supplied,
61 %%% and reports are identified as CSTR YYYY-nn,
62 %%% where nn is reset at each year YYYY. In
63 %%% addition, none of those reports carries a
64 %%% normal title page or a STAN-CS report number:
65 %%% most appear to be conference proceedings
66 %%% preprints. Thus, there appear to be at least
67 %%% 1625 + 97 = 1722 reports, and we have found
68 %%% more than that number [some reports were
69 %%% issued twice on different dates with the same
70 %%% CSTR number]. No evidence has yet been found
71 %%% for reports from 2018 onward.
72 %%%
73 %%% At least 344 of these reports are marked as
74 %%% theses (presumably, doctoral). Where the
75 %%% thesis mentions a research advisor, that
76 %%% person is recorded in the BibTeX entry.
77 %%% Substantial further work is needed to
78 %%% identify their locations in the Proquest
79 %%% database of dissertations and theses at
80 %%%
81 %%% https://www.proquest.com/pqdtglobal
82 %%%
83 %%% The initial BibTeX entries are derived
84 %%% automatically from listings of Stanford
85 %%% University Computer Science technical reports
86 %%% from 1963 to 1999 at
87 %%%
88 %%% http://i.stanford.edu/TR/cstr6x.html
89 %%% http://i.stanford.edu/TR/cstr7x.html
90 %%% http://i.stanford.edu/TR/cstr8x.html
91 %%% http://i.stanford.edu/TR/cstr9x.html
92 %%%
93 %%% and for 2000 to 2017 at
94 %%%
95 %%% http://hci.stanford.edu/cstr/
96 %%%
97 %%% and from data extracted from report
98 %%% CS-TR-94-1507. Those files contain author,
99 %%% title, month, year, report number, abstract,
100 %%% and URL values in a relatively clean format
101 %%% that was first reformatted to a consistent
102 %%% layout with html-pretty, and then converted
103 %%% with modest awk programs to rough BibTeX
104 %%% form.
105 %%%
106 %%% Those BibTeX entries are then subjected to
107 %%% numerous heuristic checks, spelling
108 %%% correction, doubled word detection, proper
109 %%% noun identification in titles, SQL sanity
110 %%% checks, and other tools developed for the
111 %%% BibNet Project and TeX User Group
112 %%% bibliography archives. That effort showed
113 %%% that the error rate in the original Stanford
114 %%% sources is regrettably rather high, and it
115 %%% took many days of cross checking data
116 %%% against PDF file contents to repair most of
117 %%% those errors.
118 %%%
119 %%% There is a small archive of a dozen Stanford
120 %%% reports at
121 %%%
122 %%% https://bitsavers.org/pdf/stanford/cs_techReports
123 %%%
124 %%% The most recent of those is numbered 1992
125 %%% from the year 1988. Entries for all of them
126 %%% are included in this file.
127 %%%
128 %%% The initial HTML-to-BibTeX conversion
129 %%% produced 482 entries. Additional entries
130 %%% from the BibNet Project and the TeX User
131 %%% Group archives were then merged in,
132 %%% increasing the report count to 518. There
133 %%% were MANY mathematical markup errors in the
134 %%% original report abstracts, but after a lot of
135 %%% tedious editing, they have now all been
136 %%% corrected. However, there remain numerous
137 %%% instances of text in abstracts that should be
138 %%% in math mode, but is not: fixing that
139 %%% deficiency is not planned. The only remaining
140 %%% instance of unmatched delimiters is the
141 %%% closed--open interval in the abstract of
142 %%% entry Malcolm:1973:UUR.
143 %%%
144 %%% Early reports were numbered CSnn, CS-nn,
145 %%% TR-nn, or CS-TR-nn, but later ones were
146 %%% designated CS-TR-dd-nnn, where dd means the
147 %%% year 19dd, and nnn increases through the
148 %%% report history. Stanford HTML files use the
149 %%% latter form, even if it disagrees with title
150 %%% page information. We follow that practice
151 %%% here in order to support automated entry
152 %%% sorting by report number with ``bibsort
153 %%% --bynumber''. There is at least one report,
154 %%% Malcolm:1972:PRA (STAN-CS-71-215), which is a
155 %%% revision of an earlier one, without changing
156 %%% the report number.
157 %%%
158 %%% From entry Mashack:1994:BDC, ``Some reports
159 %%% are noted with a National Technical
160 %%% Information Service (NTIS) retrieval number
161 %%% (i.e., AD-XXXXXX), if available from the
162 %%% NTIS. Other reports are noted with Knowledge
163 %%% Systems Laboratory (KSL) or Computer Systems
164 %%% Laboratory (CSL) numbers (KSL-XXXX;
165 %%% CSL-TR-XX-XX), and may be requested from KSL
166 %%% or CSL, respectively.'' However, attempts
167 %%% in late 2025 to search the NTIS database at
168 %%%
169 %%% https://www.ntis.gov/site-search/
170 %%%
171 %%% are blocked because the site requires a login
172 %%% account. I later found an NTIS site with a
173 %%% search facility:
174 %%%
175 %%% https://ntrl.ntis.gov/NTRL/
176 %%%
177 %%% However, data from that site are messy,
178 %%% confused with other reports outside the
179 %%% STAN-CS series, difficult to deal with, and
180 %%% there seems to be no way to easily download
181 %%% in bulk the reports that match the search
182 %%% requests. In addition, searches often fail,
183 %%% or time out, or they recognize the document
184 %%% number, but offer no PDF file for it. When
185 %%% PDF files have been located in the NTIS
186 %%% archives, they are often severely defaced by
187 %%% human scribbling, and/or rubber stamping, on
188 %%% the front matter pages. More than 50 of the
189 %%% PDF files for the Stanford reports suffer
190 %%% from this problem. All of the ADnnnnn.pdf
191 %%% files obtained from NTIS have been renamed to
192 %%% match the CS-TR-yy-nnnn.pdf convention.
193 %%%
194 %%% Another useful document archive site is the
195 %%% US Defense Technical Information Center:
196 %%%
197 %%% https://discover.dtic.mil/
198 %%%
199 %%% Other report number prefixes in this file
200 %%% include AIM (Stanford Artificial Intelligence
201 %%% Project Memo), HPP (Stanford Heuristic
202 %%% Programming Project), LBL (Lawrence Berkeley
203 %%% Laboratory), SLAC (Stanford Linear
204 %%% Accelerator Center), SU (Stanford
205 %%% University), and TT (????).
206 %%%
207 %%% Although the report numbers embed a two-digit
208 %%% year, that year often differs by one or two
209 %%% from the date on the report cover pages.
210 %%%
211 %%% I checked many entries from the bibliography
212 %%% reports against their PDF files, and found
213 %%% that errors of months and pages are, alas,
214 %%% common in the reports (e.g., STAN-CS-94-1507
215 %%% in entry Mashack:1994:BDC).
216 %%%
217 %%% While page counts can be automatically
218 %%% extracted from PDF files, such as with the
219 %%% pdfinfo tool, that number is only an upper
220 %%% bound, because some reports have unnumbered
221 %%% pages, some have section-numbered pages, some
222 %%% have embedded or trailing unnumbered blank
223 %%% pages, and cover pages are usually not
224 %%% included in page numbering. Entries with
225 %%% pages values of roman number + arabic number
226 %%% have been obtained by viewing the report PDF
227 %%% file. Numerous corrections have been made,
228 %%% but users of this bibliography are strongly
229 %%% advised to make their own checks of metadata
230 %%% validity against actual document contents,
231 %%% whether in print, or in electronic form.
232 %%%
233 %%% For PDF files for the reports that have been
234 %%% located and downloaded, the pdfinfo tool
235 %%% extracted page counts that have been
236 %%% automatically merged into this file as
237 %%% pdfpages values. About sixty percent of the
238 %%% BibTeX entries in this file have URL values;
239 %%% extensive Web searching has so far failed to
240 %%% locate the remainder. Some reports were
241 %%% later published in journals or books, and
242 %%% where possible, DOI and remark fields
243 %%% identify them.
244 %%%
245 %%% Of particular interest to me, the
246 %%% bibliographer, are works in numerical
247 %%% analysis by George Forsythe and Gene Golub
248 %%% and their collaborators (Robert S. Anderssen,
249 %%% Richard H. Bartels, Henry R. Bauer, Sheldon
250 %%% I. Becker, {\AA}ke Bj{\"o}rck, Petter
251 %%% Bj{\o}rstad, Daniel L. Boley, Peter Businger,
252 %%% Tony F. Chan, Paul Concus, Richard W. Cottle,
253 %%% Germund Dahlquist, Carl de Boor, Bart
254 %%% L. R. De Moor, Warren T. Dent, Fred W. Dorr,
255 %%% Stanley C. Eisenstat, Sylvan Elhay, Howard
256 %%% C. Elman, D. Fischer, Robert W. Floyd, John
257 %%% Alan George, Phillip E. Gill, Susan
258 %%% L. Graham, Martin H. Gutknecht, O. Hald,
259 %%% Michael Heath, William Kahan, Jaroslav
260 %%% Kautsky, Virginia C. Klema, Erastus H. Lee,
261 %%% Randall J. LeVeque, C. Levin, Franklin
262 %%% T. Luk, William F. Miller, Walter A. Murray,
263 %%% Stephen Nash, C. W. Nielson, Dianne Prost
264 %%% O'Leary, Michael L. Overton, Victor Pereyra,
265 %%% Robert J. Plemmons, Christian H. Reinsch,
266 %%% Thomas N. Robertson, Richard S. Sacher,
267 %%% Michael A. Saunders, Edwin H. Satterthwaite,
268 %%% Eugene Seneta, Lyle B. Smith, Gilbert
269 %%% W. Stewart, George P. H. Styan, Richard
270 %%% R. Underwood, Charles F. Van Loan, James
271 %%% M. Varah, E. A. Volkov, Grace Wahba, John
272 %%% H. Welsch, O. Widlund, Niklaus Wirth, James
273 %%% H. Wilkinson, and John H. Welsch), and works
274 %%% on the development of TeX, Metafont, fonts,
275 %%% and typography by Donald Knuth and his
276 %%% collaborators (Charles A. Bigelow, Neenie
277 %%% Billawala, David R. Fuchs, John D. Hobby,
278 %%% Pijush K. Ghosh, Gu Guoan, Frank M. Liang,
279 %%% Tung Yun Mei, Tomas G. Rokicki, Lynn Ruggles,
280 %%% Arthur L. Samuel, Richard Southall, Chih-sung
281 %%% Tang, Luis {Trabb Pardo}, Howard W. Trickey,
282 %%% and Ignacio Andres Zabala-Salelles).
283 %%%
284 %%% The checksum field above contains a CRC-16
285 %%% checksum as the first value, followed by the
286 %%% equivalent of the standard UNIX wc (word
287 %%% count) utility output of lines, words, and
288 %%% characters. This is produced by Robert
289 %%% Solovay's checksum utility.",
290 %%% }
291 %%% ====================================================================
292
293 @Preamble{
294 "\input bibnames.sty " #
295 "\ifx \undefined \booktitle \def \booktitle#1{{{\em #1}}} \fi"
296 }
297
298 %%% ====================================================================
299 %%% Acknowledgement abbreviations:
300
301 @String{ack-nhfb = "Nelson H. F. Beebe,
302 University of Utah,
303 Department of Mathematics, 110 LCB,
304 155 S 1400 E RM 233,
305 Salt Lake City, UT 84112-0090, USA,
306 Tel: +1 801 581 5254,
307 e-mail: \path|[email protected]|,
308 \path|[email protected]|,
309 \path|[email protected]| (Internet),
310 URL: \path|https://www.math.utah.edu/~beebe/|"}
311
312 %%% ====================================================================
313 %%% Institutional abbreviations:
314
315 @String{inst-STAN-CS = "Stanford University, Department of Computer
316 Science"}
317 @String{inst-STAN-CS:adr = "Stanford, CA, USA"}
318
319 %%% ====================================================================
320 %%% Journal abbreviations:
321
322 @String{j-LINEAR-ALGEBRA-APPL = "Linear Algebra and its Applications"}
323
324 @String{j-NUM-MATH = "Numerische Mathematik"}
325
326 @String{j-SIAM-REVIEW = "SIAM Review"}
327
328 %%% ====================================================================
329 %%% Publishers and their addresses:
330
331 @String{pub-AMS = "American Mathematical Society"}
332 @String{pub-AMS:adr = "Providence, RI, USA"}
333
334 @String{pub-DP = "Digital Press"}
335 @String{pub-DP:adr = "12 Crosby Drive, Bedford, MA 01730,
336 USA"}
337
338 @String{pub-KLUWER = "Kluwer Academic Publishers"}
339 @String{pub-KLUWER:adr = "Norwell, MA, USA, and Dordrecht, The
340 Netherlands"}
341
342 @String{pub-OXFORD = "Oxford University Press"}
343 @String{pub-OXFORD:adr = "Walton Street, Oxford OX2 6DP, UK"}
344
345 %%% ====================================================================
346 %%% Bibliography entries, ordered by year and them by report number.
347
348 @TechReport{Rosen:1963:PPP,
349 author = "J. B. Rosen",
350 title = "Primal Partition Programming for Block Diagonal
351 Matrices",
352 type = "Technical Report",
353 number = "STAN-CS-63-1 (AD462108)",
354 institution = inst-STAN-CS,
355 address = inst-STAN-CS:adr,
356 pages = "23",
357 month = nov,
358 year = "1963",
359 bibdate = "Thu Nov 20 14:45:07 2025",
360 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
361 URL = "https://apps.dtic.mil/sti/html/tr/AD0426108/index.html",
362 abstract = "The complete linear $l$-block problem in the dual form
363 and the complete primal problem corresponding to it are
364 considered. Since both are dual linear problems, an
365 optimum solution to either one also gives an optimum
366 solution to the other. The method of solution described
367 gives a sequence of feasible solutions to the former
368 which are obtained by solving subproblems of the
369 latter. At each cycle a test is made for a complete
370 problem optimum solution. When this test is satisfied,
371 the optimum solution to both is given. The solution
372 method is summarized and illustrated by means of a
373 two-block example. The solution algorithm is described
374 in detail. The validity of this algorithm is
375 demonstrated by means of the three theorems. Theorem 1
376 shows that there is an optimum solution to both
377 problems if, and only if, the optimality test is
378 satisfied. The proof that a basis change is made in
379 every nonoptimal block is given in Theorem 2. In
380 Theorem 3 it is shown that the optimum solution is
381 obtained after a finite sequence of nondecreasing
382 function values. The computational results obtained
383 with this method are summarized.",
384 acknowledgement = ack-nhfb,
385 remark = "No PDF file in DTIC or NTRL, but abstract found in
386 DTIC.",
387 }
388
389 @TechReport{Pavkovich:1963:SLS,
390 author = "John M. Pavkovich",
391 title = "The Solution of Large Systems of Algebraic Equations",
392 type = "Technical Report",
393 number = "CS-TR-63-2 (AD427753)",
394 institution = inst-STAN-CS,
395 address = inst-STAN-CS:adr,
396 pages = "46",
397 month = dec,
398 year = "1963",
399 bibdate = "Fri Nov 7 07:11:14 MST 2025",
400 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
401 URL = "http://i.stanford.edu/TR/CS-TR-63-2.html",
402 abstract = "The solution of a system of linear algebraic equations
403 using a computer is not a difficult problem as long as
404 the equations are not ill-conditioned and all of the
405 coefficients can be stored in the computer. However,
406 when the number of coefficients is so large that
407 supplemental means of storage, such as magnetic tape,
408 are required, the problem of solving the system in an
409 efficient manner increases considerably. This paper
410 describes a method of solution whereby such systems of
411 equations can be solved in an efficient manner. The
412 problems associated with ill-conditioned systems of
413 equations are not discussed.",
414 acknowledgement = ack-nhfb,
415 pdfpages = "50",
416 }
417
418 @TechReport{Forsythe:1964:TPV,
419 author = "G. E. Forsythe",
420 title = "The Theorems in a Paper by {V. K. Saulev,
421 \booktitle{On an Estimate of the Error in Obtaining
422 Characteristic Functions by the Method of Finite
423 Differences}}",
424 type = "Technical Report",
425 number = "STAN-CS-64-3 (AD430445)",
426 institution = inst-STAN-CS,
427 address = inst-STAN-CS:adr,
428 pages = "6",
429 month = jan,
430 year = "1964",
431 bibdate = "Thu Nov 20 14:48:03 2025",
432 bibsource = "https://www.math.utah.edu/pub/bibnet/authors/f/forsythe-george-elmer.bib;
433 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
434 note = "Translation from Russian to English by GEF.",
435 URL = "",
436 acknowledgement = ack-nhfb,
437 author-dates = "George Elmer Forsythe (8 January 1917--9 April 1972)",
438 }
439
440 @TechReport{Bergman:1964:NSB,
441 author = "Stefan Bergman and J. G. Herriot",
442 title = "Numerical Solution of Boundary Value Problems by the
443 Method of Integral Operators",
444 type = "Technical Report",
445 number = "STAN-CS-64-4 (AD434858)",
446 institution = inst-STAN-CS,
447 address = inst-STAN-CS:adr,
448 pages = "24",
449 month = feb,
450 year = "1964",
451 bibdate = "Thu Nov 20 14:48:03 2025",
452 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
453 URL = "",
454 acknowledgement = ack-nhfb,
455 }
456
457 @TechReport{Rosen:1964:EUE,
458 author = "J. B. Rosen",
459 title = "Existence and Uniqueness of Equilibrium Points for
460 Concave {$N$}-Person Games",
461 type = "Technical Report",
462 number = "STAN-CS-64-5 (N-6519765)",
463 institution = inst-STAN-CS,
464 address = inst-STAN-CS:adr,
465 pages = "28",
466 month = mar,
467 year = "1964",
468 bibdate = "Thu Nov 20 14:48:03 2025",
469 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
470 URL = "https://ntrs.nasa.gov/api/citations/19650010164/downloads/19650010164.pdf",
471 abstract = "A constrained $n$-person game is considered in which
472 the constraints for each player, as well as his payoff
473 function, may depend on the strategy of every player.
474 The existence of an equilibrium point for such a game
475 is shown. By requiring appropriate concavity in the
476 payoff functions, a concave game is defined. It is
477 proved that there is a unique equilibrium point for
478 every strictly concave game. A dynamic model for
479 nonequilibrium situations is proposed. This model
480 consists of a system of differential equations which
481 specify the rate of change of each player's strategy.
482 It is shown that for a strictly concave game the system
483 is globally asymptotically stable with respect to the
484 unique equilibrium point of the game. Finally, it is
485 shown how a gradient method suitable for a concave
486 mathematical programming problem can be used to find
487 the equilibrium point for a concave game.",
488 acknowledgement = ack-nhfb,
489 pdfpages = "28",
490 remark = "No PDF in NTRL archive, but found in NASA archive.",
491 }
492
493 @TechReport{Hockney:1964:FDS,
494 author = "Roger W. Hockney",
495 title = "A fast direct solution of {Poisson}'s equation using
496 {Fourier} analysis",
497 type = "Technical Report",
498 number = "STAN-CS-64-6 (AD600164)",
499 institution = inst-STAN-CS,
500 address = inst-STAN-CS:adr,
501 pages = "ii + 39",
502 day = "14",
503 month = apr,
504 year = "1964",
505 bibdate = "Fri Nov 7 07:11:14 MST 2025",
506 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
507 URL = "http://i.stanford.edu/TR/CS-TR-64-6.html",
508 abstract = "The demand for rapid procedures to solve Poisson's
509 equation has lead to the development of a direct method
510 of solution involving Fourier analysis which can solve
511 Poisson's equation in a square region covered by a $ 48
512 \times 48 $ mesh in 0.9 seconds on the IBM 7090. This
513 compares favorably with the best iterative methods
514 which would require about 10 seconds to solve the same
515 problem. The method is applicable to rectangular
516 regions with simple boundary conditions and the maximum
517 observed error in the potential for several random
518 charge distributions is $ 5 \times 10^{-7} $ of the
519 maximum potential charge in the region.",
520 acknowledgement = ack-nhfb,
521 pdfpages = "42",
522 }
523
524 @TechReport{Rosen:1964:SCO,
525 author = "J. B. Rosen",
526 title = "Sufficient Conditions for Optimal Control of Convex
527 Processes",
528 type = "Technical Report",
529 number = "STAN-CS-64-7 (PE3176753)",
530 institution = inst-STAN-CS,
531 address = inst-STAN-CS:adr,
532 pages = "29",
533 month = may,
534 year = "1964",
535 bibdate = "Thu Nov 20 14:48:03 2025",
536 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
537 URL = "",
538 acknowledgement = ack-nhfb,
539 }
540
541 @TechReport{Golub:1964:CSV,
542 author = "Gene H. Golub and William Kahan",
543 title = "Calculating the Singular Values and Pseudo-inverse of
544 a Matrix",
545 type = "Technical Report",
546 number = "STAN-CS-64-8 (AD603116)",
547 institution = inst-STAN-CS,
548 address = inst-STAN-CS:adr,
549 pages = "33",
550 month = may,
551 year = "1964",
552 bibdate = "Thu Nov 20 14:48:03 2025",
553 bibsource = "https://www.math.utah.edu/pub/bibnet/authors/g/golub-gene-h.bib;
554 https://www.math.utah.edu/pub/bibnet/authors/k/kahan-william-m.bib;
555 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
556 URL = "",
557 abstract = "A numerically stable and fairly fast scheme is
558 described to compute the unitary matrices $U$ and $V$
559 which transform a given matrix $A$ into a diagonal form
560 $ \sigma U A V$, thus exhibiting as singular values on
561 $ \sigma $'s diagonal. The scheme first transforms $A$
562 to a bidiagonal matrix $J$, then diagonalizes $J$. The
563 scheme described here is complicated but does not
564 suffer from the computational difficulties which
565 occasionally afflict some previously known methods.
566 Some applications are mentioned, in particular the use
567 of the pseudo-inverse $ A V \sigma I U$ to solve least
568 squares problems in a way which dampens spurious
569 oscillation and cancellation",
570 acknowledgement = ack-nhfb,
571 author-dates = "Gene Howard Golub (February 29, 1932--November 16,
572 2007)",
573 remark = "No PDF in NTRL or DTIC archives. Published in Journal
574 of the Society for Industrial and Applied Mathematics:
575 Series B, Numerical Analysis, {\bf 2}(2) 205--224,
576 1965.",
577 }
578
579 @TechReport{Andersen:1964:AMF,
580 author = "Christian Andersen",
581 title = "The {$ Q D $}-Algorithm as a Method for Finding the
582 Roots of a Polynomial Equation When All Roots are
583 Positive",
584 type = "Technical Report",
585 number = "STAN-CS-64-9 (AD604012)",
586 institution = inst-STAN-CS,
587 address = inst-STAN-CS:adr,
588 pages = "74",
589 month = jun,
590 year = "1964",
591 bibdate = "Fri Nov 7 07:11:14 MST 2025",
592 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
593 URL = "http://i.stanford.edu/TR/CS-TR-64-9.html",
594 abstract = "The Quotient--Difference (QD)-scheme, symmetric
595 functions and some results from the theory of Hankel
596 determinants are treated. Some well known relations
597 expressing the elements of the QD-scheme by means of
598 the Hankel determinants are presented. The question of
599 convergence of the columns of the QD-scheme is treated.
600 An exact expression for $ q_n^k $ is developed for the
601 case of different roots. It is proved that the columns
602 of the QD-scheme will converge not only in the well
603 known case of different roots, but in all cases where
604 the roots are positive. A detailed examination of the
605 convergence to the smallest root is presented. An exact
606 expression for $ q_n^N $ is developed. This expression
607 is correct in all cases of multiple positive roots. It
608 is shown that the progressive form of the QD-algorithm
609 is only 'mildly unstable'. Finally, some ALGOL programs
610 and some results obtained by means of these are
611 given.",
612 acknowledgement = ack-nhfb,
613 pdfpages = "86",
614 xxauthor = "Charles Anderson",
615 xxnumber = "CS-TR-64-9",
616 }
617
618 @TechReport{Causey:1964:CNM,
619 author = "R. L. Causey",
620 title = "On Closest Normal Matrices",
621 type = "Technical Report",
622 number = "STAN-CS-64-10 (AD603163)",
623 institution = inst-STAN-CS,
624 address = inst-STAN-CS:adr,
625 pages = "v + 131",
626 day = "30",
627 month = jun,
628 year = "1964",
629 bibdate = "Thu Nov 20 14:48:03 2025",
630 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
631 URL = "",
632 acknowledgement = ack-nhfb,
633 pdfpages = "139",
634 remark = "This is the author's thesis.",
635 }
636
637 @TechReport{Nakamura:1964:EPA,
638 author = "Tsuneyoshi Nakamura and Judah {Ben Rosen}",
639 title = "Elastic-plastic analysis of trusses by the gradient
640 projection method",
641 type = "Technical Report",
642 number = "CS-TR-64-11 (PB176754)",
643 institution = inst-STAN-CS,
644 address = inst-STAN-CS:adr,
645 pages = "ii + 32",
646 day = "17",
647 month = jul,
648 year = "1964",
649 bibdate = "Fri Nov 7 07:11:14 MST 2025",
650 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
651 URL = "http://i.stanford.edu/TR/CS-TR-64-11.html",
652 abstract = "The gradient projection method has been applied to the
653 problem of obtaining the elastic-plastic response of a
654 perfectly plastic ideal truss with several degrees of
655 redundancy to several independently varying sets of
656 quasi-static loads. It is proved that the minimization
657 of stress rate intensity subject to a set of yield
658 inequalities is equivalent to the maximization process
659 of the gradient projection method. This equivalence
660 proof establishes the basis of the computational
661 method. The technique is applied to the problem of
662 investigating the possibilities of shake down and to
663 limit analysis. A closed convex `safe load domain' is
664 defined to represent the load carrying capacity
665 characteristics of a truss subjected to various
666 combinations of the several sets of loads.",
667 acknowledgement = ack-nhfb,
668 pdfpages = "36",
669 }
670
671 @TechReport{Golub:1964:NMS,
672 author = "Gene H. Golub and Peter A. Businger",
673 title = "{{\booktitle{Numerical methods for solving linear
674 least squares problems}} (by G. Golub); \booktitle{An
675 ALGOL procedure for finding linear least squares
676 solutions} (by Peter Businger)}",
677 type = "Technical Report",
678 number = "STAN-CS-64-12 (AD608292)",
679 institution = inst-STAN-CS,
680 address = inst-STAN-CS:adr,
681 pages = "ii + 27",
682 day = "28",
683 month = aug,
684 year = "1964",
685 bibdate = "Fri Nov 7 07:11:14 MST 2025",
686 bibsource = "https://www.math.utah.edu/pub/bibnet/authors/g/golub-gene-h.bib;
687 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
688 URL = "http://i.stanford.edu/TR/CS-TR-64-12.html",
689 abstract = "A common problem in a Computer Laboratory is that of
690 finding linear least squares solutions. These problems
691 arise in a variety of areas and in a variety of
692 contexts. Linear least squares problems are
693 particularly difficult to solve because they frequently
694 involve large quantities of data, and they are
695 ill-conditioned by their very nature. In this paper, we
696 shall consider stable numerical methods for handling
697 these problems. Our basic tool is a matrix
698 decomposition based on orthogonal Householder
699 transformations.",
700 acknowledgement = ack-nhfb,
701 author-dates = "Gene Howard Golub (February 29, 1932--November 16,
702 2007)",
703 pdfpages = "32",
704 xxnumber = "CS-TR-64-12 (AD608292)",
705 }
706
707 @TechReport{Pereyra:1964:CPM,
708 author = "Victor Pereyra and Judah {Ben Rosen}",
709 title = "Computation of the pseudoinverse of a matrix of
710 unknown rank",
711 type = "Technical Report",
712 number = "CS-TR-64-13 (N6527058)",
713 institution = inst-STAN-CS,
714 address = inst-STAN-CS:adr,
715 pages = "??",
716 month = sep,
717 year = "1964",
718 bibdate = "Fri Nov 7 07:11:14 MST 2025",
719 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
720 URL = "http://i.stanford.edu/TR/CS-TR-64-13.html",
721 abstract = "A program is described which computes the
722 pseudoinverse, and other related quantities, of an $ m
723 \times n $ matrix $A$ of unknown rank. The program
724 obtains least square solutions to singular and\slash or
725 inconsistent linear systems $ A x = B$, where $ m \leq
726 n$ or $ m > n$ and the rank of $A$ may be less than $
727 \min (m, n)$. A complete description of the programs
728 and its use is given, including computational
729 experience on a variety of problems.",
730 acknowledgement = ack-nhfb,
731 pdfpages = "30",
732 }
733
734 @TechReport{Efimenko:1964:ACE,
735 author = "V. A. Efimenko",
736 title = "On Approximate Calculations of the Eigenvalues and
737 Eigenfunctions of Boundary Value Problems in Partial
738 Differential Equations",
739 type = "Technical Report",
740 number = "STAN-CS-64-14 (TT-65-61724)",
741 institution = inst-STAN-CS,
742 address = inst-STAN-CS:adr,
743 pages = "20",
744 month = nov,
745 year = "1964",
746 bibdate = "Thu Nov 20 15:10:53 2025",
747 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
748 note = "Translated by G. Reiter and C. Moler.",
749 URL = "",
750 acknowledgement = ack-nhfb,
751 }
752
753 @TechReport{Grace:1965:CSN,
754 author = "Donald W. Grace",
755 title = "Computer Search for Non-Isomorphic Convex Polyhedra",
756 type = "Technical Report",
757 number = "STAN-CS-65-15 (AD611366)",
758 institution = inst-STAN-CS,
759 address = inst-STAN-CS:adr,
760 pages = "viii + 137",
761 day = "29",
762 month = jan,
763 year = "1965",
764 bibdate = "Thu Nov 20 15:10:53 2025",
765 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
766 URL = "",
767 acknowledgement = ack-nhfb,
768 pdfpages = "156",
769 remark = "This is the author's thesis.",
770 }
771
772 @TechReport{Forsythe:1965:MSD,
773 author = "George E. Forsythe and Gene H. Golub",
774 title = "Maximizing a second-degree polynomial on the unit
775 sphere",
776 type = "Technical Report",
777 number = "STAN-CS-65-16 (AD611427)",
778 institution = inst-STAN-CS,
779 address = inst-STAN-CS:adr,
780 pages = "iv + 31",
781 day = "5",
782 month = feb,
783 year = "1965",
784 bibdate = "Fri Nov 7 07:11:14 MST 2025",
785 bibsource = "https://www.math.utah.edu/pub/bibnet/authors/f/forsythe-george-elmer.bib;
786 https://www.math.utah.edu/pub/bibnet/authors/g/golub-gene-h.bib;
787 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
788 URL = "http://i.stanford.edu/TR/CS-TR-65-16.html",
789 abstract = "Let $A$ be a Hermitian matrix of order $n$, and $b$ a
790 known vector in $ C^n$. The problem is to determine
791 which vectors make $ \Phi (x) = {(x - b)}^H A(x - b)$ a
792 maximum or minimum on the unit sphere {$ U = \{ x
793 \colon x^H x = 1 \} $}. The problem is reduced to the
794 determination of a finite point set, the spectrum of $
795 (A, b)$. The theory reduces to the usual theory of
796 Hermitian forms when $ b = 0$.",
797 acknowledgement = ack-nhfb,
798 author-dates = "Gene Howard Golub (February 29, 1932--November 16,
799 2007); George Elmer Forsythe (8 January 1917--9 April
800 1972)",
801 pdfpages = "36",
802 xxnumber = "CS-TR-65-16",
803 }
804
805 @TechReport{Forsythe:1965:AGP,
806 author = "George E. Forsythe and Niklaus Wirth",
807 title = "Automatic Grading Programs",
808 type = "Technical Report",
809 number = "CS-TR-65-17",
810 institution = inst-STAN-CS,
811 address = inst-STAN-CS:adr,
812 pages = "ii + 17",
813 month = feb,
814 year = "1965",
815 bibdate = "Fri Jan 12 06:41:18 2024",
816 bibsource = "https://www.math.utah.edu/pub/bibnet/authors/f/forsythe-george-elmer.bib;
817 https://www.math.utah.edu/pub/bibnet/authors/w/wirth-niklaus.bib;
818 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
819 URL = "http://i.stanford.edu/pub/cstr/reports/cs/tr/65/17/CS-TR-65-17.pdf;
820 http://i.stanford.edu/TR/CS-TR-65-17.html",
821 abstract = "The ALGOL grader programs are presented for the
822 computer evaluation of student ALGOL programs. One is
823 for a beginner's program; it furnishes random data and
824 checks answers. The other provides a searching test of
825 the reliability and efficiency of a rootfinding
826 procedure. There is a statement of the essential
827 properties of a computer system, in order that grader
828 programs can be effectively used.",
829 acknowledgement = ack-nhfb,
830 author-dates = "George Elmer Forsythe (8 January 1917--9 April 1972);
831 Niklaus Wirth (15 February 1934--1 January 2024)",
832 pdfpages = "19",
833 }
834
835 @TechReport{Pereyra:1965:DCM,
836 author = "Victor Pereyra",
837 title = "The difference correction method for non-linear
838 two-point boundary value problems",
839 type = "Technical Report",
840 number = "CS-TR-65-18",
841 institution = inst-STAN-CS,
842 address = inst-STAN-CS:adr,
843 pages = "??",
844 month = feb,
845 year = "1965",
846 bibdate = "Fri Nov 7 07:11:14 MST 2025",
847 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
848 URL = "http://i.stanford.edu/TR/CS-TR-65-18.html",
849 abstract = "The numerical solution of non-linear two-point
850 boundary value problems is discussed. It is shown that
851 for a certain class of finite difference approximations
852 the a posteriori use of a difference correction raises
853 the order of the approximation by at least two orders.
854 The difference correction itself involves only the
855 solution of one system of linear equations. If Newton's
856 method is used in the early stage, then it is shown
857 that the matrices in both processes are identical,
858 which is a useful feature in coding the method for an
859 automatic computer. Several numerical examples are
860 given.",
861 acknowledgement = ack-nhfb,
862 pdfpages = "42",
863 }
864
865 @TechReport{Ageev:1965:EEM,
866 author = "M. I. Ageev and J. Maclaren",
867 title = "{English} Equivalents of Metalinguistic Terms of
868 {Russian ALGOL}",
869 type = "Technical Report",
870 number = "STAN-CS-65-19 (AD0612686, TT-65-61839)",
871 institution = inst-STAN-CS,
872 address = inst-STAN-CS:adr,
873 pages = "115",
874 month = apr,
875 year = "1965",
876 bibdate = "Fri Nov 21 14:21:14 2025",
877 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
878 URL = "https://apps.dtic.mil/sti/citations/tr/AD0612686",
879 abstract = "The Russian versions of the metalinguistic terms of
880 ALGOL 60 are listed in Russian alphabetical order,
881 together with the English originals.",
882 acknowledgement = ack-nhfb,
883 remark = "No PDF file in DTIC or NWRL, but DTIC has abstract.
884 Translated from monograph \booktitle{Osnovy
885 Algoritmicheskogo Yazyka Algol-60 (Principles of the
886 Algol-60 Algorithmic Language)} Moscow, 1964.",
887 }
888
889 @TechReport{Wirth:1965:EGA,
890 author = "Niklaus Wirth and Helmut Weber",
891 title = "{EULER}: a Generalization of {ALGOL}, and its Formal
892 Definition",
893 type = "Technical Report",
894 number = "CS-TR-65-20",
895 institution = inst-STAN-CS,
896 address = inst-STAN-CS:adr,
897 pages = "xv + 115",
898 day = "27",
899 month = apr,
900 year = "1965",
901 bibdate = "Fri Nov 7 07:11:14 MST 2025",
902 bibsource = "https://www.math.utah.edu/pub/bibnet/authors/w/wirth-niklaus.bib;
903 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
904 URL = "http://i.stanford.edu/pub/cstr/reports/cs/tr/65/20/CS-TR-65-20.pdf;
905 http://i.stanford.edu/TR/CS-TR-65-20.html",
906 abstract = "A method for defining programming languages is
907 developed which introduces a rigorous relationship
908 between structure and meaning. The structure of a
909 language is defined by a phrase structure syntax, the
910 meaning in terms of the effects which the execution of
911 a sequence of interpretation rules exerts upon a fixed
912 set of variables, called the Environment. There exists.
913 a one-to-one correspondence between syntactic rules and
914 interpretation rules, and the sequence of executed
915 interpretation rules is determined by the sequence of
916 corresponding syntactic reductions which constitute a
917 parse.\par
918
919 The individual interpretation rules are explained in
920 terms of an elementary and obvious algorithmic
921 notation. A constructive method for evaluating a text
922 is provided, and for certain decidable classes of
923 languages their unambiguity is proven. As an example, a
924 generalization of ALGOL is described in full detail to
925 demonstrate that concepts like block-structure,
926 procedures, parameters etc. can be defined adequately
927 and precisely by this method.",
928 acknowledgement = ack-nhfb,
929 author-dates = "Niklaus Wirth (15 February 1934--1 January 2024)",
930 pdfpages = "130",
931 }
932
933 @TechReport{Fisher:1965:VAD,
934 author = "Donald D. Fisher and Jobst von der Groeben and J.
935 Gerald Toole",
936 title = "Vectorcardiographic analysis by digital computer,
937 selected results",
938 type = "Technical Report",
939 number = "CS-TR-65-21",
940 institution = inst-STAN-CS,
941 address = inst-STAN-CS:adr,
942 pages = "??",
943 month = may,
944 year = "1965",
945 bibdate = "Fri Nov 7 07:11:14 MST 2025",
946 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
947 URL = "http://i.stanford.edu/TR/CS-TR-65-21.html",
948 abstract = "Instrumentation, recording devices and digital
949 computers now may be combined to obtain detailed
950 statistical measures of physiological phenomena.
951 Computers make it possible to study several models of a
952 system in depth as well as breadth. This report is
953 concerned with methods employed in a detailed
954 statistical study of some 600 vectorcardiograms from
955 different `normal' individuals which were recorded on
956 analog magnetic tape using two different orthogonal
957 lead systems (Helm, Frank) giving a total of 1200
958 cardiograms. A `normal' individual is defined as one in
959 which no abnormal heart condition was detected by
960 either medical history or physical examination. One
961 heartbeat in a train of 15 or 20 was selected for
962 digitization. An average of 1.2 seconds worth of data
963 was digitized from each of the three vector leads
964 simultaneously at a rate of 1000 samples per second for
965 each lead giving a total of over $ {4.10}^6 $ values.
966 Statistical models by sex and lead system of the P wave
967 and QRS complex (at 1 millisecond intervals) and T wave
968 (normalized to 60 points in time) were obtained for 43
969 age groups from age 19 to 61 in rectangular
970 coordinates, polar coordinates and ellipsoidal fit
971 (F-test) coordinates. Several programs were written to
972 perform the analyses on an IBM 7090. Two of the
973 programs used 300000+ words of disk storage to collect
974 the necessary statistics. Various aspects of the study
975 are presented in this report.",
976 acknowledgement = ack-nhfb,
977 pdfpages = "108",
978 }
979
980 @TechReport{Moler:1965:FDM,
981 author = "C. B. Moler",
982 title = "Finite Difference Methods for the Eigenvalues of
983 {Laplace}'s Operator",
984 type = "Technical Report",
985 number = "STAN-CS-65-22 (AD0616675)",
986 institution = inst-STAN-CS,
987 address = inst-STAN-CS:adr,
988 pages = "142",
989 day = "27",
990 month = may,
991 year = "1965",
992 bibdate = "Fri Nov 21 14:21:14 2025",
993 bibsource = "https://www.math.utah.edu/pub/bibnet/authors/m/moler-cleve-b.bib;
994 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
995 URL = "https://apps.dtic.mil/sti/citations/AD0616675",
996 acknowledgement = ack-nhfb,
997 pdfpages = "148",
998 remark = "This is the author's thesis. No PDF in DTIC or NTRL
999 archives.",
1000 }
1001
1002 @TechReport{Rudin:1965:CPA,
1003 author = "Bernard D. Rudin",
1004 title = "Convex polynomial approximation",
1005 type = "Technical Report",
1006 number = "CS-TR-65-23",
1007 institution = inst-STAN-CS,
1008 address = inst-STAN-CS:adr,
1009 pages = "iv + 44",
1010 day = "4",
1011 month = jun,
1012 year = "1965",
1013 DOI = "https://doi.org/10.5555/891684",
1014 bibdate = "Fri Nov 7 07:11:14 MST 2025",
1015 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
1016 URL = "http://i.stanford.edu/TR/CS-TR-65-23.html;
1017 https://dl.acm.org/doi/10.5555/891684;
1018 https://www.proquest.com/pqdtglobal/results/C5640F46CA624452PQ/",
1019 abstract = "Let $ f(t) $ be a continuous function on $ [0, 1] $,
1020 or let it be discretely defined on a finite point set
1021 in $ [0, 1] $. The problem is the following: among all
1022 polynomials $ p(t) $ of degree $n$ or less which are
1023 convex on $ [0, 1] $, find one which minimizes the
1024 functional $ \vert p(t) - f(t) \vert $, where $ \vert
1025 \cdot \vert $ is a suitably defined norm (in
1026 particular, the $ L^p $, $ \ell^p $, and Chebyshev
1027 norms). The problem is treated by showing it to be a
1028 particular case of a more general problem: let $f$ be
1029 an element of a real normed linear space $V$; let $ x_1
1030 (z), \ldots, x_k(z) $ be continuous functions on a
1031 subset $S$ of the Euclidean space $ E^n $ into $V$ such
1032 that for each $ z_o $ in $S$ the set $ \{ x_1 (z_o),
1033 \ldots, x_k(z_o) \} $ is linearly independent in $V$;
1034 let $ (y_1, \ldots, y_k) $ denote an element of the
1035 Euclidean space $ E^k $ and let $H$ be a subset of $
1036 K^k $; then among all $ (y, z)$ in $ H \times S $, find
1037 one which minimizes the functional $ \vert y_1 x_1 (z)
1038 + \ldots {} + y_k x_k(z) - f \vert $. It is shown that
1039 solutions to this problem exist when $H$ is closed and
1040 $S$ is compact. Conditions for uniqueness and location
1041 of solutions on the boundary of $ H \times S $ are also
1042 given. Each polynomial of degree $ n + 2$ or less which
1043 is convex on $ [0, 1] $ is shown to be uniquely
1044 representable in the form $ y_o + y_1 t + y_2 \int \int
1045 p(z, t) d t^2 $, where $ p(z, t) $ is a certain
1046 representation of the polynomials positive on $ [0, 1]
1047 $, $ y_2 \geq 0 $, and $z$ is constrained to lie in a
1048 certain convex hyperpolyhedron. With this
1049 representation, the convex polynomial approximation
1050 problem can be treated by the theory mentioned above.
1051 It is reduced to a problem of minimizing a functional
1052 subject to linear constraints. Computation of best
1053 least squares convex polynomial approximation is
1054 illustrated in the continuous and discrete cases.",
1055 acknowledgement = ack-nhfb,
1056 pdfpages = "48",
1057 remark = "This is the author's thesis. The abstract text with
1058 complicated math text from the HTML file is not in the
1059 PDF file, and the full thesis text is not available in
1060 the Proquest database to check against.",
1061 }
1062
1063 @TechReport{Klyuyev:1965:MNA,
1064 author = "V. V. Klyuyev and N. I. Kokovkin Shoherbak",
1065 title = "On the Minimization of the Number of Arithmetic
1066 Operations for the Solution of Linear Algebraic Systems
1067 of Equations",
1068 type = "Technical Report",
1069 number = "STAN-CS-65-24 (AD616611)",
1070 institution = inst-STAN-CS,
1071 address = inst-STAN-CS:adr,
1072 pages = "24",
1073 month = jun,
1074 year = "1965",
1075 bibdate = "Fri Nov 21 14:21:14 2025",
1076 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
1077 note = "Translated by G. J. Tee.",
1078 URL = "",
1079 acknowledgement = ack-nhfb,
1080 remark = "No PDF in DTIC or NTRL archives.",
1081 }
1082
1083 @TechReport{Hodge:1965:YPL,
1084 author = "Philip G. {Hodge, Jr.}",
1085 title = "Yield-point load determination by nonlinear
1086 programming",
1087 type = "Technical Report",
1088 number = "CS-TR-65-25",
1089 institution = inst-STAN-CS,
1090 address = inst-STAN-CS:adr,
1091 pages = "??",
1092 month = jun,
1093 year = "1965",
1094 bibdate = "Fri Nov 7 07:11:14 MST 2025",
1095 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
1096 URL = "http://i.stanford.edu/TR/CS-TR-65-25.html",
1097 abstract = "The determination of the yield-point load of a
1098 perfectly plastic structure can be formulated as a
1099 nonlinear programming problem by means of the theorems
1100 of limit analysis. This formulation is discussed in
1101 general terms and then applied to the problem of a
1102 curved beam. Recent results in the theory of nonlinear
1103 programming are called upon to solve typical problems
1104 for straight and curved beams. The theory of limit
1105 analysis enables intermediate answers to be given a
1106 physical interpretation in terms of upper and lower
1107 bounds on the yield-point load. The paper closes with
1108 some indication of how the method may be generalized to
1109 more complex problems of plastic yield-point load
1110 determination.",
1111 acknowledgement = ack-nhfb,
1112 pdfpages = "27",
1113 }
1114
1115 @TechReport{Forsythe:1965:SUP,
1116 author = "George E. Forsythe",
1117 title = "{Stanford University}'s {Program in Computer
1118 Science}",
1119 type = "Technical Report",
1120 number = "CS-TR-65-26",
1121 institution = inst-STAN-CS,
1122 address = inst-STAN-CS:adr,
1123 pages = "i + 27",
1124 day = "25",
1125 month = jun,
1126 year = "1965",
1127 bibdate = "Fri Nov 7 07:11:14 MST 2025",
1128 bibsource = "https://www.math.utah.edu/pub/bibnet/authors/f/forsythe-george-elmer.bib;
1129 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
1130 URL = "http://i.stanford.edu/TR/CS-TR-65-26.html",
1131 abstract = "This report discusses the nature and objectives of
1132 Stanford University's Program in Computer Science.
1133 Listings of course offerings and syllabi for Ph.D.
1134 examinations are given in appendices.",
1135 acknowledgement = ack-nhfb,
1136 author-dates = "George Elmer Forsythe (8 January 1917--9 April 1972)",
1137 pdfpages = "28",
1138 }
1139
1140 @TechReport{Volkov:1965:AOA,
1141 author = "E. A. Volkov",
1142 title = "An Analysis of One Algorithm of Heightened Precision
1143 of the Method of Nets for the Solution of {Poisson}'s
1144 Equation",
1145 type = "Technical Report",
1146 number = "STAN-CS-65-27 (AD618216)",
1147 institution = inst-STAN-CS,
1148 address = inst-STAN-CS:adr,
1149 pages = "29",
1150 month = jul,
1151 year = "1965",
1152 bibdate = "Fri Nov 21 14:21:14 2025",
1153 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
1154 note = "Translated by R. Bartels.",
1155 URL = "",
1156 acknowledgement = ack-nhfb,
1157 remark = "No PDF in DTIC or NTRL archives.",
1158 }
1159
1160 @TechReport{Miller:1965:MTP,
1161 author = "John J. H. Miller and Gilbert Strang",
1162 title = "Matrix theorems for partial differential and
1163 difference equations",
1164 type = "Technical Report",
1165 number = "CS-TR-65-28",
1166 institution = inst-STAN-CS,
1167 address = inst-STAN-CS:adr,
1168 pages = "??",
1169 month = jul,
1170 year = "1965",
1171 bibdate = "Fri Nov 7 07:11:14 MST 2025",
1172 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
1173 URL = "http://i.stanford.edu/TR/CS-TR-65-28.html",
1174 abstract = "We extend the work of Kreiss and Morton to prove: for
1175 some constant $ K(m) $, where $m$ is the order of the
1176 matrix $A$, $ |A^(n)v| \leq C(v) $ for all $ n \geq 0$
1177 and $ |v| = 1$ implies that $ |{SAS}^{-1}| \leq 1 $ for
1178 some $S$ with $ |S^{-1}| \leq 1 $, $ |S v| \leq
1179 k(m)C(v)$. We establish the analogue for exponentials $
1180 e^{Pt} $, and use it to construct the minimal Hilbert
1181 norm dominating $ L_2 $ in which a given partial
1182 differential equation with constant coefficients is
1183 well-posed.",
1184 acknowledgement = ack-nhfb,
1185 pdfpages = "36",
1186 }
1187
1188 @TechReport{Pereyra:1965:IAS,
1189 author = "Victor Pereyra",
1190 title = "On improving an approximate solution of a functional
1191 equation by deferred corrections",
1192 type = "Technical Report",
1193 number = "CS-TR-65-29",
1194 institution = inst-STAN-CS,
1195 address = inst-STAN-CS:adr,
1196 pages = "??",
1197 month = aug,
1198 year = "1965",
1199 bibdate = "Fri Nov 7 07:11:14 MST 2025",
1200 bibsource = "https://www.math.utah.edu/pub/bibnet/authors/f/fox-leslie.bib;
1201 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
1202 URL = "http://i.stanford.edu/TR/CS-TR-65-29.html",
1203 abstract = "The improvement of discretization algorithms for the
1204 approximate solution of nonlinear functional equations
1205 is considered. Extensions to the method of difference
1206 corrections by Fox are discussed and some general
1207 results are proved. Applications to nonlinear boundary
1208 problems and numerical examples are given in some
1209 detail.",
1210 acknowledgement = ack-nhfb,
1211 pdfpages = "40",
1212 }
1213
1214 @TechReport{Marchuk:1965:ACC,
1215 author = "S. Marchuk",
1216 title = "The Automatic Construction of Computational
1217 Algorithms",
1218 type = "Technical Report",
1219 number = "STAN-CS-65-30 (SS624-829)",
1220 institution = inst-STAN-CS,
1221 address = inst-STAN-CS:adr,
1222 pages = "56",
1223 month = sep,
1224 year = "1965",
1225 bibdate = "Fri Nov 21 14:21:14 2025",
1226 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
1227 note = "Translated by G. J. Tee.",
1228 URL = "",
1229 acknowledgement = ack-nhfb,
1230 remark = "No PDF in DTIC or NTRL archives.",
1231 }
1232
1233 @TechReport{Raviart:1965:AWS,
1234 author = "Pierre Arnaud Raviart",
1235 title = "On the approximation of weak solutions of linear
1236 parabolic equations by a class of multistep difference
1237 methods",
1238 type = "Technical Report",
1239 number = "CS-TR-65-31",
1240 institution = inst-STAN-CS,
1241 address = inst-STAN-CS:adr,
1242 pages = "??",
1243 day = "6",
1244 month = dec,
1245 year = "1965",
1246 bibdate = "Fri Nov 7 07:11:14 MST 2025",
1247 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
1248 URL = "http://i.stanford.edu/TR/CS-TR-65-31.html",
1249 abstract = "We consider evolution equations of the form \par
1250
1251 (1) $ d u(t) / d t + A(t)u(t) = f(t) $, $ 0 \leq \ t
1252 \leq \ T $, $f$ given, \par
1253
1254 with the initial condition\par
1255
1256 (2) $ u(o) = u_o $, $ u_o $ given, \par
1257
1258 where each $ A(t)$ is an unbounded linear operator in a
1259 Hilbert space $H$, which is in practice an elliptic
1260 partial differential operator subject to appropriate
1261 boundary conditions.\par
1262
1263 Let $ V_h $ be a Hilbert space which depends on the
1264 parameter $h$. Let $k$ be the time-step such that $ m =
1265 \frac {T}{k} $ is an integer. We approximate the
1266 solution $u$ of (1), (2) by the solution $ u_{h, k}
1267 (u_{h, k} = \{ u_{h, k}(r k) \in V_h, r = 0, 1, \ldots
1268 {}, m - 1 \})$ of the multistep difference
1269 scheme\par
1270
1271 (3) $ \frac {u_{h, k}^{(rk)} - u_{h, k}^{((r -
1272 1)k)}}{k} = \sum_{\ell = 0}^p \gamma_\ell A_h((r -
1273 \ell)k) u_{h, k}((r - \ell) k) = \sum_{\ell = 0}^p
1274 {\gamma }_\ell f_{h, k}((r - \ell)k), r = p, \ldots {},
1275 m - 1 $ \par
1276
1277 (4) $ u_{h, k}(o), \ldots {}, u_{h, k}((p - 1)k) $
1278 given,\par
1279
1280 where each $ A_h(r k) $ is a linear continuous operator
1281 from $ V_h $ into $ V_h $, $ f_{h, k}(r k) (r = 0, 1,
1282 \ldots {}, m - 1)$ are given, and $ \gamma_\ell (\ell =
1283 0, \ldots {}, p)$ are given complex numbers. Our paper
1284 is mainly concerned by the study of the stability of
1285 the approximation. The methods used here are very
1286 closely related to those developed in the author's
1287 thesis and we shall refer to the thesis frequently. In
1288 Section 1, 2, we define the continuous and approximate
1289 problems in precise terms. In Section 4, we find
1290 sufficient conditions for $ u_{h, k} $ to satisfy some
1291 a priori estimates. The definition of the stability is
1292 given in Section 5 and we use the a priori estimates
1293 for proving a general stability theorem. In Section 6
1294 we prove that the stability conditions may be weakened
1295 when $ A(t) $ is a self-adjoint operator (or when only
1296 the principal part of $ A(t) $ is self-adjoint). We
1297 give in Section 7 a weak convergence theorem. Section 8
1298 is concerned with regularity properties. We apply our
1299 abstract analysis to a class of parabolic partial
1300 differential equations with variable coefficients in
1301 Section 9. Strong convergence theorems can be obtained
1302 as in the author's thesis (via compactness arguments)
1303 or as in the thesis of J. P. Aubin. We do not study
1304 here the discretization error (see author's thesis).
1305 For the study of the stability of multistep difference
1306 methods in the case of the Cauchy problem for parabolic
1307 differential operators, we refer to Kreiss [1959],
1308 Widlund [1965].",
1309 acknowledgement = ack-nhfb,
1310 pdfpages = "64",
1311 }
1312
1313 @TechReport{Hockney:1965:MMF,
1314 author = "Roger W. Hockney",
1315 title = "Minimum multiplication {Fourier} analysis",
1316 type = "Technical Report",
1317 number = "CS-TR-65-32",
1318 institution = inst-STAN-CS,
1319 address = inst-STAN-CS:adr,
1320 pages = "??",
1321 month = dec,
1322 year = "1965",
1323 bibdate = "Fri Nov 7 07:11:14 MST 2025",
1324 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
1325 URL = "http://i.stanford.edu/TR/CS-TR-65-32.html",
1326 abstract = "Fourier analysis and synthesis is a frequently used
1327 tool in applied mathematics but is found to be a time
1328 consuming process to apply on a digital computer and
1329 this fact may prevent the practical application of the
1330 technique. This paper describes an algorithm which uses
1331 the symmetries of the sine and cosine functions to
1332 reduce the number of arithmetic operations by a factor
1333 between 10 and 30. The algorithm is applicable to a
1334 finite Fourier (or harmonic) analysis on $ 12
1335 \bigotimes \ 2^q $ values, where $q$ is any integer $
1336 \geq 0 $ and is applicable to a variety of end
1337 conditions. A complete and tested B5000 Algol program
1338 known as FOURIER12 is included.",
1339 acknowledgement = ack-nhfb,
1340 pdfpages = "60",
1341 }
1342
1343 @TechReport{Wirth:1965:PLC,
1344 author = "Niklaus Wirth",
1345 title = "A programming language for the 360 computers",
1346 type = "Technical Report",
1347 number = "CS-TR-65-33",
1348 institution = inst-STAN-CS,
1349 address = inst-STAN-CS:adr,
1350 pages = "??",
1351 day = "24",
1352 month = dec,
1353 year = "1965",
1354 bibdate = "Fri Nov 7 07:11:14 MST 2025",
1355 bibsource = "https://www.math.utah.edu/pub/bibnet/authors/w/wirth-niklaus.bib;
1356 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
1357 URL = "http://i.stanford.edu/TR/CS-TR-65-33.html;
1358 https://bitsavers.org/pdf/stanford/cs_techReports/CS33_Wirth_PL360_Dec65.pdf",
1359 abstract = "This paper is a preliminary definition of a
1360 programming language which is specifically designed for
1361 use on IBM 360 computers, and is therefore
1362 appropriately called PL360.",
1363 acknowledgement = ack-nhfb,
1364 pdfpages = "25",
1365 }
1366
1367 @TechReport{Varah:1966:ERM,
1368 author = "James M. Varah",
1369 title = "Eigenvectors of a real matrix by inverse iteration",
1370 type = "Technical Report",
1371 number = "CS-TR-66-34",
1372 institution = inst-STAN-CS,
1373 address = inst-STAN-CS:adr,
1374 pages = "??",
1375 month = feb,
1376 year = "1966",
1377 bibdate = "Fri Nov 7 07:11:14 MST 2025",
1378 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
1379 URL = "http://i.stanford.edu/TR/CS-TR-66-34.html",
1380 abstract = "This report contains the description and listing of an
1381 ALGOL 60 program which calculates the eigenvectors of
1382 an arbitrary real matrix, using the technique of
1383 inverse iteration.",
1384 acknowledgement = ack-nhfb,
1385 pdfpages = "26",
1386 }
1387
1388 @TechReport{Wirth:1966:CDA,
1389 author = "N. Wirth and C. Hoare",
1390 title = "A Contribution to the Development of {ALGOL}",
1391 type = "Technical Report",
1392 number = "STAN-CS-66-35 (PB176758)",
1393 institution = inst-STAN-CS,
1394 address = inst-STAN-CS:adr,
1395 pages = "64",
1396 month = feb,
1397 year = "1966",
1398 DOI = "https://doi.org/10.1145/365696.365702",
1399 bibdate = "Fri Nov 21 14:21:14 2025",
1400 bibsource = "https://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
1401 https://www.math.utah.edu/pub/bibnet/authors/w/wirth-niklaus.bib;
1402 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
1403 URL = "",
1404 acknowledgement = ack-nhfb,
1405 remark = "No PDF in NTRL archive. Published in
1406 \booktitle{Communications of the ACM} {\bf 9}(6)
1407 413--432, June 1966, doi:10.1145/365696.365702.",
1408 }
1409
1410 @TechReport{Traub:1966:CZP,
1411 author = "J. F. Traub",
1412 title = "The Calculation of Zeros of Polynomials and Analytic
1413 Functions",
1414 type = "Technical Report",
1415 number = "STAN-CS-66-36 (PB176759)",
1416 institution = inst-STAN-CS,
1417 address = inst-STAN-CS:adr,
1418 pages = "iii + 26",
1419 month = apr,
1420 year = "1966",
1421 bibdate = "Fri Nov 21 14:21:14 2025",
1422 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
1423 URL = "",
1424 acknowledgement = ack-nhfb,
1425 pdfpages = "29",
1426 remark = "No abstract is available.",
1427 }
1428
1429 @TechReport{Reynolds:1966:COM,
1430 author = "John C. Reynolds",
1431 title = "{COGENT 1.2} operations manual",
1432 type = "Technical Report",
1433 number = "CS-TR-66-37",
1434 institution = inst-STAN-CS,
1435 address = inst-STAN-CS:adr,
1436 pages = "??",
1437 month = apr,
1438 year = "1966",
1439 bibdate = "Fri Nov 7 07:11:14 MST 2025",
1440 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
1441 URL = "http://i.stanford.edu/TR/CS-TR-66-37.html",
1442 abstract = "This document is an addendum to the COGENT Programming
1443 Manual (Argonne National Laboratory, ANL-7022, March
1444 1965, hereafter referred to as CPM) which describes a
1445 specific implementation of the COGENT system, COGENT
1446 1.2, written for the Control Data 3600 Computer.
1447 Chapters I and II describe a variety of features
1448 available in COGENT 1.2 which are not mentioned in CPM;
1449 these chapters parallel the material in Chapters II and
1450 III of CPM. Chapter III of this report gives various
1451 operational details concerning the assembly and loading
1452 of both COGENT-compiled programs and the compiler
1453 itself. Chapter IV describes system and error messages.
1454 Familiarity with the contents of CPM is assumed
1455 throughout this report. In addition, a knowledge of the
1456 3600 operating system SCOPE, and the assembler COMPASS
1457 is assumed in Chapter III.",
1458 acknowledgement = ack-nhfb,
1459 pdfpages = "44",
1460 }
1461
1462 @TechReport{McCarthy:1966:CCA,
1463 author = "John McCarthy and James Painter",
1464 title = "Correctness of a Compiler for Arithmetic Expressions",
1465 type = "Technical Report",
1466 number = "STAN-CS-66-38 (AIM-40, AD662880)",
1467 institution = inst-STAN-CS,
1468 address = inst-STAN-CS:adr,
1469 pages = "ii + 13",
1470 day = "29",
1471 month = apr,
1472 year = "1966",
1473 bibdate = "Fri Nov 21 14:21:14 2025",
1474 bibsource = "https://www.math.utah.edu/pub/tex/bib/fparith.bib;
1475 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
1476 URL = "",
1477 abstract = "This is a preprint of a paper given at the Symposium
1478 on Mathematical Aspects of Computer Science of the
1479 American Mathematical Society held April 6 and 7, 1966.
1480 It contains a proof of the correctness of a compiler
1481 for arithmetic expressions.",
1482 acknowledgement = ack-nhfb,
1483 author-dates = "John McCarthy (4 September 1927--24 October 2011)",
1484 pdfpages = "15",
1485 }
1486
1487 @TechReport{Forsythe:1966:UEP,
1488 author = "George E. Forsythe",
1489 title = "A university's educational program in computer
1490 science",
1491 type = "Technical Report",
1492 number = "CS-TR-66-39",
1493 institution = inst-STAN-CS,
1494 address = inst-STAN-CS:adr,
1495 pages = "i + 26",
1496 day = "18",
1497 month = may,
1498 year = "1966",
1499 bibdate = "Fri Nov 7 07:11:14 MST 2025",
1500 bibsource = "https://www.math.utah.edu/pub/bibnet/authors/f/forsythe-george-elmer.bib;
1501 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
1502 URL = "http://i.stanford.edu/TR/CS-TR-66-39.html",
1503 abstract = "After a review of the power of contemporary computers,
1504 computer science is defined in several ways. The
1505 objectives of computer science education are stated,
1506 and it is asserted that in a U.S. university these will
1507 be achieved only through a computer science department.
1508 The program at Stanford University is reviewed as an
1509 example. The appendix includes syllabi of Ph.D.
1510 qualifying examinations for Stanford's Computer Science
1511 Department. This is a revision of a previous Stanford
1512 Computer Science Department report, CS 26",
1513 acknowledgement = ack-nhfb,
1514 author-dates = "George Elmer Forsythe (8 January 1917--9 April 1972)",
1515 pdfpages = "27",
1516 }
1517
1518 @TechReport{Forsythe:1966:HDY,
1519 author = "George E. Forsythe",
1520 title = "How do you solve a quadratic equation?",
1521 type = "Technical Report",
1522 number = "CS-TR-66-40",
1523 institution = inst-STAN-CS,
1524 address = inst-STAN-CS:adr,
1525 pages = "i + 19",
1526 day = "16",
1527 month = jun,
1528 year = "1966",
1529 bibdate = "Fri Nov 7 07:11:14 MST 2025",
1530 bibsource = "https://www.math.utah.edu/pub/bibnet/authors/f/forsythe-george-elmer.bib;
1531 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
1532 URL = "http://i.stanford.edu/TR/CS-TR-66-40.html",
1533 abstract = "The nature of the floating-point number system of
1534 digital computers is explained to a reader whose
1535 university mathematical background is very limited. The
1536 possibly large errors in using mathematical algorithms
1537 blindly with floating-point computation are illustrated
1538 by the formula for solving a quadratic equation. An
1539 accurate way of solving a quadratic is outlined. A few
1540 general remarks are made about computational
1541 mathematics, including the backwards analysis of
1542 rounding error.",
1543 acknowledgement = ack-nhfb,
1544 author-dates = "George Elmer Forsythe (8 January 1917--9 April 1972)",
1545 pdfpages = "20",
1546 }
1547
1548 @TechReport{Kahan:1966:AES,
1549 author = "William M. Kahan",
1550 title = "Accurate Eigenvalues of a Symmetric Tri-Diagonal
1551 Matrix",
1552 type = "Technical Report",
1553 number = "CS-TR-66-41",
1554 institution = inst-STAN-CS,
1555 address = inst-STAN-CS:adr,
1556 pages = "iv + 53",
1557 day = "22",
1558 month = jul,
1559 year = "1966",
1560 bibdate = "Fri Nov 7 07:11:14 MST 2025",
1561 bibsource = "https://www.math.utah.edu/pub/bibnet/authors/k/kahan-william-m.bib;
1562 https://www.math.utah.edu/pub/bibnet/subjects/acc-stab-num-alg.bib;
1563 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
1564 note = "Revised June 1968",
1565 URL = "http://i.stanford.edu/TR/CS-TR-66-41.html",
1566 abstract = "Having established tight bounds for the quotient of
1567 two different lub-norms of the same tri-diagonal matrix
1568 $J$, the author observes that these bounds could be of
1569 use in an error-analysis provided a suitable algorithm
1570 were found. Such an algorithm is exhibited, and its
1571 errors are thoroughly accounted for, including the
1572 effects of scaling, over/underflow and roundoff. A
1573 typical result is that, on a computer using rounded
1574 floating point binary arithmetic, the biggest
1575 eigenvalue of $J$ can be computed easily to within 2.5
1576 units in its last place, and the smaller eigenvalues
1577 will suffer absolute errors which are no larger. These
1578 results are somewhat stronger than had been known
1579 before.",
1580 acknowledgement = ack-nhfb,
1581 pdfpages = "58",
1582 }
1583
1584 @TechReport{Kahan:1966:WND,
1585 author = "William Kahan",
1586 title = "When to neglect off-diagonal elements of symmetric
1587 tri-diagonal matrices",
1588 type = "Technical Report",
1589 number = "CS-TR-66-42",
1590 institution = inst-STAN-CS,
1591 address = inst-STAN-CS:adr,
1592 pages = "i + 10",
1593 day = "25",
1594 month = jul,
1595 year = "1966",
1596 bibdate = "Fri Nov 7 07:11:14 MST 2025",
1597 bibsource = "https://www.math.utah.edu/pub/bibnet/authors/k/kahan-william-m.bib;
1598 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
1599 URL = "ftp://reports.stanford.edu/pub/cstr/reports/cs/tr/66/42/CS-TR-66-42.pdf;
1600 http://i.stanford.edu/TR/CS-TR-66-42.html",
1601 abstract = "Given a tolerance $ \epsilon > 0, $ we seek a
1602 criterion by which an off-diagonal element of the
1603 symmetric tri-diagonal matrix $J$ may be deleted
1604 without changing any eigenvalue of $J$ by more than $
1605 \epsilon $. The criterion obtained here permits the
1606 deletion of elements of order $ \sqrt {\epsilon }$
1607 under favorable circumstances, without requiring any
1608 prior knowledge about the separation between the
1609 eigenvalues of $J$.",
1610 acknowledgement = ack-nhfb,
1611 pdfpages = "11",
1612 }
1613
1614 @TechReport{Kahan:1966:TWA,
1615 author = "William Kahan and James M. Varah",
1616 title = "Two working algorithms for the eigenvalues of a
1617 symmetric tridiagonal matrix",
1618 type = "Technical Report",
1619 number = "CS-TR-66-43",
1620 institution = inst-STAN-CS,
1621 address = inst-STAN-CS:adr,
1622 pages = "iv + 28",
1623 day = "1",
1624 month = aug,
1625 year = "1966",
1626 bibdate = "Fri Nov 7 07:11:14 MST 2025",
1627 bibsource = "https://www.math.utah.edu/pub/bibnet/authors/k/kahan-william-m.bib;
1628 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
1629 URL = "http://i.stanford.edu/TR/CS-TR-66-43.html",
1630 abstract = "Two tested programs are supplied to find the
1631 eigenvalues of a symmetric tridiagonal matrix. One
1632 program uses a square-root-free version of the $ Q R $
1633 algorithm. The other uses a compact kind of Sturm
1634 sequence algorithm. These programs are faster and more
1635 accurate than the other comparable programs published
1636 previously with which they have been compared.",
1637 acknowledgement = ack-nhfb,
1638 pdfpages = "32",
1639 }
1640
1641 @TechReport{Kahan:1966:RME,
1642 author = "William Kahan",
1643 title = "Relaxation methods for an eigenproblem",
1644 type = "Technical Report",
1645 number = "CS-TR-66-44",
1646 institution = inst-STAN-CS,
1647 address = inst-STAN-CS:adr,
1648 pages = "iv + 35",
1649 day = "8",
1650 month = aug,
1651 year = "1966",
1652 bibdate = "Fri Nov 7 07:11:14 MST 2025",
1653 bibsource = "https://www.math.utah.edu/pub/bibnet/authors/k/kahan-william-m.bib;
1654 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
1655 URL = "http://i.stanford.edu/TR/CS-TR-66-44.html",
1656 abstract = "A theory is developed to account for the convergence
1657 properties of certain relaxation iterations which have
1658 been widely used to solve the eigenproblem $ (A -
1659 \lambda B) \underline {x} = 0 $, $ \underline {x} \neq
1660 0 $, with large symmetric matrices $A$ and $B$ and
1661 positive definite $B$. These iterations always
1662 converge, and almost always converge to the right
1663 answer. Asymptotically, the theory is essentially that
1664 of the relaxation iteration applied to a semi-definite
1665 linear system discussed in the author's previous report
1666 [Stanford University Computer Science Department report
1667 CS45, 1966].",
1668 acknowledgement = ack-nhfb,
1669 pdfpages = "40",
1670 }
1671
1672 @TechReport{Kahan:1966:RMS,
1673 author = "William Kahan",
1674 title = "Relaxation methods for semi-definite systems",
1675 type = "Technical Report",
1676 number = "CS-TR-66-45",
1677 institution = inst-STAN-CS,
1678 address = inst-STAN-CS:adr,
1679 pages = "iv + 32",
1680 day = "9",
1681 month = aug,
1682 year = "1966",
1683 bibdate = "Fri Nov 7 07:11:14 MST 2025",
1684 bibsource = "https://www.math.utah.edu/pub/bibnet/authors/k/kahan-william-m.bib;
1685 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
1686 URL = "http://i.stanford.edu/TR/CS-TR-66-45.html",
1687 abstract = "Certain non-stationary relaxation iterations, which
1688 are commonly applied to positive definite symmetric
1689 systems of linear equations, are also applicable to a
1690 semi-definite system provided that system is
1691 consistent. Some of the convergence theory of the
1692 former application is herein extended to the latter
1693 application. The effects of rounding errors and of
1694 inconsistency are discussed too, but with few helpful
1695 conclusions. Finally, the application of these
1696 relaxation iterations to an indefinite system is shown
1697 here to be ill-advised because these iterations will
1698 almost certainly diverge exponentially.",
1699 acknowledgement = ack-nhfb,
1700 pdfpages = "36",
1701 }
1702
1703 @TechReport{Forsythe:1966:TCM,
1704 author = "G. E. Forsythe",
1705 title = "Today's Computational Methods of Linear Algebra",
1706 type = "Technical Report",
1707 number = "STAN-CS-66-46 (SS638-809)",
1708 institution = inst-STAN-CS,
1709 address = inst-STAN-CS:adr,
1710 pages = "47",
1711 day = "11",
1712 month = aug,
1713 year = "1966",
1714 DOI = "https://doi.org/10.1137/1009071",
1715 bibdate = "Fri Nov 21 14:21:14 2025",
1716 bibsource = "https://www.math.utah.edu/pub/bibnet/authors/f/forsythe-george-elmer.bib;
1717 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
1718 URL = "https://apps.dtic.mil/sti/tr/pdf/AD0638809.pdf",
1719 acknowledgement = ack-nhfb,
1720 author-dates = "George Elmer Forsythe (8 January 1917--9 April 1972)",
1721 remark = "Invited address presented 15 May 1966 to a national
1722 meeting of SIAM at Iowa City. Published in
1723 \booktitle{SIAM Review} {\bf 9}(3) 489--515, 1967,
1724 doi:10.1137/1009071.",
1725 }
1726
1727 @TechReport{Abrams:1966:IIN,
1728 author = "Philip S. Abrams",
1729 title = "An interpreter for `{Iverson} notation'",
1730 type = "Technical Report",
1731 number = "CS-TR-66-47",
1732 institution = inst-STAN-CS,
1733 address = inst-STAN-CS:adr,
1734 pages = "??",
1735 month = aug,
1736 year = "1966",
1737 bibdate = "Fri Nov 7 07:11:14 MST 2025",
1738 bibsource = "https://www.math.utah.edu/pub/bibnet/authors/w/wirth-niklaus.bib;
1739 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
1740 URL = "http://i.stanford.edu/TR/CS-TR-66-47.html",
1741 abstract = "Kenneth E. Iverson's book, `\booktitle{A Programming
1742 Language}' [New York: Wiley, 1962], presented a highly
1743 elegant language for the description and analysis of
1744 algorithms. Although not widely acclaimed at first,
1745 `Iverson notation' (referred to as `the language' in
1746 this report) is coming to be recognized as an important
1747 tool by computer scientists and programmers. The
1748 current report contains an up-to-date definition of a
1749 subset of the language, based on recent work by Iverson
1750 and his colleagues. Chapter III describes an
1751 interpreter for the language, written jointly by the
1752 author and Lawrence M. Breed of IBM. The remainder of
1753 the paper consists of critiques of the implementation
1754 and the language, with suggestions for improvement.
1755 This report was originally submitted in fulfillment of
1756 a Computer Science 239 project supervised by Professor
1757 Niklaus Wirth, Stanford University, May 30, 1966.",
1758 acknowledgement = ack-nhfb,
1759 pdfpages = "64",
1760 }
1761
1762 @TechReport{McKeeman:1966:ACL,
1763 author = "W. M. McKeeman",
1764 title = "An Approach to Computer Language Design",
1765 type = "Technical Report",
1766 number = "STAN-CS-66-48 (AD0639166, SS639-166)",
1767 institution = inst-STAN-CS,
1768 address = inst-STAN-CS:adr,
1769 pages = "iv + 124",
1770 day = "31",
1771 month = aug,
1772 year = "1966",
1773 bibdate = "Fri Nov 21 14:21:14 2025",
1774 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
1775 URL = "https://apps.dtic.mil/sti/citations/AD0639166",
1776 abstract = "The problem of an extendable compiler is approached by
1777 attempting to simplify the methods of generating a
1778 compiler and by designing a basic language upon which
1779 to build. A context-free grammar is required as the
1780 initial input to a syntax preprocessor which produces
1781 syntactic analysis tables for the extendable compiler.
1782 A formal mathematical description of a class of
1783 analysis algorithms, two new syntax preprocessor
1784 algorithms, and theorems concerning the behavior of the
1785 algorithms and the nature of the acceptable grammars
1786 are given. The EULER development of Wirth and Weber
1787 EULER A generalization of Algol and its formal
1788 definition. Technical report, CS20 is carried to a more
1789 concise and powerful form. We advocate languages that
1790 are minimal and involuted. A minimal language combines
1791 into a single construct any two conceptually similar
1792 but notationally different constructs. An involuted
1793 language avoids constructs that are applicable only in
1794 local context. Control over the flow of execution
1795 within a program is obtained that is sufficiently
1796 complete so that the traditional label and go-to
1797 statement can be discarded as irrelevant. An extendable
1798 compiler is presented that is written in the kernel
1799 language itself. Conclusions are that the precedence
1800 grammar techniques are efficient and useful. Further
1801 improvement could make them substantially superior to
1802 other methods of compiler generation.",
1803 acknowledgement = ack-nhfb,
1804 pdfpages = "132",
1805 remark = "This is the author's thesis. From the Acknowledgments:
1806 ``I am well aware that I, as the first student to enter
1807 the Computer Science curriculum for the Ph.D. at
1808 Stanford, have received more than my share of help and
1809 advice. I wish to express my gratitude to Professor
1810 Niklaus Wirth, upon whose work the major part of this
1811 paper is based. Professor Wirth has been a patient and
1812 gentle critic as well as a constant source of ideas.
1813 Professor George Forsythe, who first introduced me to
1814 the intricacies of automatic computation, has been
1815 extremely generous with his time.'' The abstract is
1816 missing from the PDF file, and the contents found seem
1817 to be partially jumbled. The abstract in the DTIC PDF
1818 file front matter seems to be supplied independently of
1819 the thesis, and has no similarity to the one from
1820 Stanford.",
1821 }
1822
1823 @TechReport{Reddy:1968:ACS,
1824 author = "D. R. Reddy",
1825 title = "An Approach to Computer Speech Recognition by Direct
1826 Analysis of Speech Wave",
1827 type = "Technical Report",
1828 number = "STAN-CS-66-49 (AIM-43, SS640-836)",
1829 institution = inst-STAN-CS,
1830 address = inst-STAN-CS:adr,
1831 pages = "143",
1832 month = sep,
1833 year = "1968",
1834 bibdate = "Fri Nov 21 14:21:14 2025",
1835 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
1836 URL = "",
1837 acknowledgement = ack-nhfb,
1838 remark = "This is the author's thesis.",
1839 }
1840
1841 @TechReport{Persson:1966:SSE,
1842 author = "Staffan Persson",
1843 title = "Some Sequence Extrapolating Programs: a Study of
1844 Representation and Modelling in Inquiring Systems",
1845 type = "Technical Report",
1846 number = "STAN-CS-66-50 (AIM-46, PB176761)",
1847 institution = inst-STAN-CS,
1848 address = inst-STAN-CS:adr,
1849 pages = "176",
1850 month = sep,
1851 year = "1966",
1852 bibdate = "Fri Nov 21 14:21:14 2025",
1853 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
1854 URL = "",
1855 abstract = "",
1856 acknowledgement = ack-nhfb,
1857 pdfpages = "187",
1858 remark = "This is the author's thesis.",
1859 }
1860
1861 @TechReport{Bergman:1966:NCT,
1862 author = "Stefan Bergman and John G. Herriot and Thomas G.
1863 Kurtz",
1864 title = "Numerical Calculation of Transonic Flow Patterns",
1865 type = "Technical Report",
1866 number = "STAN-CS-66-51 (AD648394)",
1867 institution = inst-STAN-CS,
1868 address = inst-STAN-CS:adr,
1869 pages = "i + 35",
1870 day = "14",
1871 month = oct,
1872 year = "1966",
1873 bibdate = "Fri Nov 21 14:21:14 2025",
1874 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
1875 URL = "",
1876 acknowledgement = ack-nhfb,
1877 pdfpages = "36",
1878 }
1879
1880 @TechReport{Shaw:1966:LNC,
1881 author = "Alan C. Shaw",
1882 title = "Lecture notes on a course in systems programming",
1883 type = "Technical Report",
1884 number = "CS-TR-66-52",
1885 institution = inst-STAN-CS,
1886 address = inst-STAN-CS:adr,
1887 pages = "??",
1888 month = dec,
1889 year = "1966",
1890 bibdate = "Fri Nov 7 07:11:14 MST 2025",
1891 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
1892 URL = "http://i.stanford.edu/TR/CS-TR-66-52.html",
1893 abstract = "These notes are based on the lectures of Professor
1894 Niklaus Wirth which were given during the winter and
1895 spring of 1965/66 as CS 236a and part of CS 236b,
1896 Computer Science Department, Stanford University.",
1897 acknowledgement = ack-nhfb,
1898 pdfpages = "226",
1899 }
1900
1901 @TechReport{Wirth:1966:PLC,
1902 author = "Niklaus Wirth",
1903 title = "A programming language for the 360 computers",
1904 type = "Technical Report",
1905 number = "CS-TR-66-53",
1906 institution = inst-STAN-CS,
1907 address = inst-STAN-CS:adr,
1908 pages = "ii + 81",
1909 day = "20",
1910 month = dec,
1911 year = "1966",
1912 bibdate = "Fri Nov 7 07:11:14 MST 2025",
1913 bibsource = "https://www.math.utah.edu/pub/bibnet/authors/w/wirth-niklaus.bib;
1914 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
1915 URL = "http://i.stanford.edu/pub/cstr/reports/cs/tr/66/53/CS-TR-66-53.pdf;
1916 http://i.stanford.edu/TR/CS-TR-66-53.html",
1917 abstract = "A programming language for the IBM 360 computers and
1918 its implementation are described. The language, called
1919 PL360, provides the facilities of a symbolic machine
1920 language, but displays a structure defined by a
1921 recursive syntax. The compiler, consisting of a
1922 precedence syntax analyser and a set of interpretation
1923 rules with strict one-to-one correspondence to the set
1924 of syntactic rules directly reflects the definition of
1925 the language.\par
1926
1927 $k$-th syntax rule: $ S_0 : := S_1 S_2 \ldots {} S_n$
1928 \par
1929
1930 $k$-th interpretation rule: $ V_0 := f_k(V_1, V_2,
1931 \ldots {}, V_n)$ \par
1932
1933 PL360 was designed to improve the readability of
1934 programs which must take into account specific
1935 characteristics and limitations of a particular
1936 computer. It represents an attempt to further the state
1937 of the art of programming by encouraging and even
1938 forcing the programmer to improve his style of
1939 exposition and his principles and discipline in program
1940 organization, and not by merely providing a multitude
1941 of `new' features and facilities. The language is
1942 therefore particularly well suited for tutorial
1943 purposes.\par
1944
1945 The attempt to present a computer as a systematically
1946 organized entity is also hoped to be of interest to
1947 designers of future computers.",
1948 acknowledgement = ack-nhfb,
1949 author-dates = "Niklaus Wirth (15 February 1934--1 January 2024)",
1950 pdfpages = "96",
1951 }
1952
1953 @TechReport{Golub:1967:GBAa,
1954 author = "Gene H. Golub and Thomas N. Robertson",
1955 title = "A generalized {Bairstow} algorithm",
1956 type = "Technical Report",
1957 number = "STAN-CS-67-54 (AD662882)",
1958 institution = inst-STAN-CS,
1959 address = inst-STAN-CS:adr,
1960 pages = "i + 10",
1961 day = "13",
1962 month = jan,
1963 year = "1967",
1964 bibdate = "Thu Nov 06 17:13:36 2025",
1965 bibsource = "https://www.math.utah.edu/pub/bibnet/authors/g/golub-gene-h.bib;
1966 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
1967 URL = "http://i.stanford.edu/TR/CS-TR-67-54.html",
1968 abstract = "This report discusses convergence and applications for
1969 the generalized Bairstow algorithm.",
1970 acknowledgement = ack-nhfb,
1971 author-dates = "Gene Howard Golub (February 29, 1932--November 16,
1972 2007)",
1973 pdfpages = "11",
1974 xxnumber = "CS-TR-67-54",
1975 }
1976
1977 @TechReport{Adams:1967:SCP,
1978 author = "Duane A. Adams",
1979 title = "A stopping criterion for polynomial root finding",
1980 type = "Technical Report",
1981 number = "CS-TR-67-55",
1982 institution = inst-STAN-CS,
1983 address = inst-STAN-CS:adr,
1984 pages = "??",
1985 month = feb,
1986 year = "1967",
1987 bibdate = "Fri Nov 7 07:11:14 MST 2025",
1988 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
1989 URL = "http://i.stanford.edu/TR/CS-TR-67-55.html",
1990 abstract = "When solving for the roots of a polynomial, it is
1991 generally difficult to know just when to terminate the
1992 iteration process. In this paper an algorithm is
1993 derived and discussed which allows one to terminate the
1994 iteration process on the basis of calculated bounds for
1995 the roundoff error.",
1996 acknowledgement = ack-nhfb,
1997 pdfpages = "12",
1998 }
1999
2000 @TechReport{Bauer:1967:MNS,
2001 author = "Friedrich L. Bauer",
2002 title = "{$ Q D $}-method with {Newton} shift",
2003 type = "Technical Report",
2004 number = "CS-TR-67-56",
2005 institution = inst-STAN-CS,
2006 address = inst-STAN-CS:adr,
2007 pages = "ii + 6",
2008 month = mar,
2009 year = "1967",
2010 bibdate = "Fri Nov 7 07:11:14 MST 2025",
2011 bibsource = "https://www.math.utah.edu/pub/bibnet/authors/b/bauer-friedrich-ludwig.bib;
2012 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
2013 URL = "http://i.stanford.edu/TR/CS-TR-67-56.html",
2014 abstract = "Theoretically, for symmetric matrices, a QR-step is
2015 equivalent to two successive LR-steps, and the
2016 LR-transformation for a tridiagonal matrix is, apart
2017 from organizational details, identical with the
2018 qd-method. For non-positive definite matrices, however,
2019 the LR-transformation cannot be guaranteed to be
2020 numerically stable unless pivotal interchanges are
2021 made. This has led to preference for the
2022 QR-transformation, which is always numerically stable.
2023 If, however, some of the smallest or some of the
2024 largest eigenvalues are wanted, then the
2025 QR-transformation will not necessarily give only these,
2026 and bisection might seem too slow with its fixed
2027 convergence rate of 1/2. In this situation, Newton's
2028 method would be fine if the Newton correction can be
2029 computed sufficiently simply, since it will always tend
2030 monotonically to the nearest root starting from a point
2031 outside the spectrum. Consequently, if one always
2032 worked with positive (or negative) definite matrices,
2033 there would be no objection to using the now stable
2034 qd-algorithm. The report shows that for a qd-algorithm,
2035 the Newton correction can very easily be calculated,
2036 and accordingly a shift which avoids under-shooting, or
2037 a lower bound. Since the last diagonal element gives an
2038 upper bound, the situation is quite satisfactory with
2039 respect to bounds.",
2040 acknowledgement = ack-nhfb,
2041 pdfpages = "8",
2042 }
2043
2044 @TechReport{Gries:1967:UTM,
2045 author = "David Gries",
2046 title = "The use of transition matrices in compiling",
2047 type = "Technical Report",
2048 number = "CS-TR-67-57",
2049 institution = inst-STAN-CS,
2050 address = inst-STAN-CS:adr,
2051 pages = "??",
2052 month = mar,
2053 year = "1967",
2054 bibdate = "Fri Nov 7 07:11:14 MST 2025",
2055 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
2056 URL = "http://i.stanford.edu/TR/CS-TR-67-57.html",
2057 abstract = "The construction of efficient parsing algorithms for
2058 programming languages has been the subject of many
2059 papers in the last few years. Techniques for efficient
2060 parsing and algorithms which generate the parser from a
2061 grammar or phrase structure system have been derived.
2062 Some of the well-known methods are the precedence
2063 techniques of Floyd, and Wirth and Weber, and the
2064 production language of Feldman. Perhaps the first such
2065 discussion was by Samelson and Bauer. There the concept
2066 of the push-down stack was introduced, along with the
2067 idea of a transition matrix. A transition matrix is
2068 just a switching table which lets one determine from
2069 the top element of the stack (denoting a row of the
2070 table) and the next symbol of the program to be
2071 processed (represented by a column of the table)
2072 exactly what should be done. Either a reduction is made
2073 in the stack, or the incoming symbol is pushed onto the
2074 stack. Considering its efficiency, the transition
2075 matrix technique does not seem to have achieved much
2076 attention, probably because it was not sufficiently
2077 well-defined. The purpose of this paper is to define
2078 the concept more formally, to illustrate that the
2079 technique is very efficient, and to describe an
2080 algorithm which generates a transition matrix from a
2081 suitable grammar. The report also describes other uses
2082 of transition matrices besides the usual ones of syntax
2083 checking and compiling.",
2084 acknowledgement = ack-nhfb,
2085 pdfpages = "63",
2086 subject-dates = "Robert W. Floyd (8 June 1936--25 September 2001)",
2087 }
2088
2089 @TechReport{Tixier:1967:RFR,
2090 author = "Vincent Emile-Louis Tixier",
2091 title = "Recursive Functions of Regular Expressions in Language
2092 Analysis",
2093 type = "Technical Report",
2094 number = "STAN-CS-67-58 (PB176766)",
2095 institution = inst-STAN-CS,
2096 address = inst-STAN-CS:adr,
2097 pages = "146",
2098 month = mar,
2099 year = "1967",
2100 bibdate = "Fri Nov 21 14:21:14 2025",
2101 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib;
2102 https://www.math.utah.edu/pub/tex/bib/string-matching.bib",
2103 URL = "",
2104 acknowledgement = ack-nhfb,
2105 pdfpages = "153",
2106 remark = "This is the author's Ph.D. thesis.",
2107 }
2108
2109 @TechReport{Wilkinson:1967:ADM,
2110 author = "James H. Wilkinson",
2111 title = "Almost Diagonal Matrices with Multiple or Close
2112 Eigenvalues",
2113 type = "Technical Report",
2114 number = "CS-TR-67-59",
2115 institution = inst-STAN-CS,
2116 address = inst-STAN-CS:adr,
2117 pages = "??",
2118 month = apr,
2119 year = "1967",
2120 bibdate = "Fri Nov 7 07:11:14 MST 2025",
2121 bibsource = "https://www.math.utah.edu/pub/bibnet/authors/w/wilkinson-james-hardy.bib;
2122 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
2123 note = "Published as \cite{Wilkinson:1968:ADM}.",
2124 URL = "http://i.stanford.edu/TR/CS-TR-67-59.html",
2125 abstract = "If $ A = D + E $ where $D$ is the matrix of diagonal
2126 elements of $A$, then when $A$ has some multiple or
2127 very close eigenvalues, $E$ has certain characteristic
2128 properties. These properties are considered both for
2129 Hermitian and non-Hermitian $A$. The properties are
2130 important in connexion with several algorithms for
2131 diagonalizing matrices by similarity transformations.",
2132 acknowledgement = ack-nhfb,
2133 author-dates = "James H. Wilkinson (27 September 1919--5 October
2134 1986)",
2135 pdfpages = "19",
2136 }
2137
2138 @TechReport{Wilkinson:1967:TAB,
2139 author = "James H. Wilkinson",
2140 title = "Two Algorithms Based on Successive Linear
2141 Interpolation",
2142 type = "Technical Report",
2143 number = "CS-TR-67-60",
2144 institution = inst-STAN-CS,
2145 address = inst-STAN-CS:adr,
2146 pages = "i + 15",
2147 day = "10",
2148 month = apr,
2149 year = "1967",
2150 bibdate = "Fri Nov 7 07:11:14 MST 2025",
2151 bibsource = "https://www.math.utah.edu/pub/bibnet/authors/w/wilkinson-james-hardy.bib;
2152 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
2153 URL = "http://i.stanford.edu/TR/CS-TR-67-60.html",
2154 abstract = "The method of successive linear interpolation has a
2155 very satisfactory asymptotic rate of convergence but
2156 the behavior in the early steps may lead to divergence.
2157 The regular falsi has the advantage of being safe but
2158 its asymptotic behavior is unsatisfactory. Two modified
2159 algorithms are described here which overcome these
2160 weaknesses. Although neither is new, discussions of
2161 their main features do not appear to be readily
2162 available in the literature.",
2163 acknowledgement = ack-nhfb,
2164 author-dates = "James H. Wilkinson (27 September 1919--5 October
2165 1986)",
2166 pdfpages = "16",
2167 }
2168
2169 @TechReport{Forsythe:1967:ADD,
2170 author = "George E. Forsythe",
2171 title = "On the asymptotic directions of the $s$-dimensional
2172 optimum gradient method",
2173 type = "Technical Report",
2174 number = "CS-TR-67-61",
2175 institution = inst-STAN-CS,
2176 address = inst-STAN-CS:adr,
2177 pages = "ii + 43",
2178 day = "13",
2179 month = apr,
2180 year = "1967",
2181 bibdate = "Fri Nov 7 07:11:14 MST 2025",
2182 bibsource = "https://www.math.utah.edu/pub/bibnet/authors/f/forsythe-george-elmer.bib;
2183 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
2184 URL = "http://i.stanford.edu/TR/CS-TR-67-61.html",
2185 abstract = "The optimum $s$-gradient method for minimizing a
2186 positive definite quadratic function $ f(x)$ on $ E_n$
2187 has long been known to converge for $ s \geq 1 $. For
2188 these $ \underline {s}$ the author studies the
2189 directions from which the iterates $ x_k$ approach
2190 their limit, and extends to $ s > 1 $ a theory proved
2191 by Akaike for $ s = 1 $. It is shown that $ f(x_k)$ can
2192 never converge to its minimum value faster than
2193 linearly, except in degenerate cases where it attains
2194 the minimum in one step.",
2195 acknowledgement = ack-nhfb,
2196 author-dates = "George Elmer Forsythe (8 January 1917--9 April 1972)",
2197 pdfpages = "45",
2198 }
2199
2200 @TechReport{Tienari:1967:VLF,
2201 author = "Martti Tienari",
2202 title = "Varying length floating point arithmetic: a necessary
2203 tool for the numerical analyst",
2204 type = "Technical Report",
2205 number = "CS-TR-67-62",
2206 institution = inst-STAN-CS,
2207 address = inst-STAN-CS:adr,
2208 pages = "38",
2209 day = "17",
2210 month = apr,
2211 year = "1967",
2212 bibdate = "Fri Nov 7 07:11:14 MST 2025",
2213 bibsource = "https://www.math.utah.edu/pub/tex/bib/fparith.bib;
2214 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
2215 URL = "http://i.stanford.edu/TR/CS-TR-67-62.html",
2216 abstract = "The traditional floating point arithmetic of
2217 scientific computers is biased towards fast and easy
2218 production of numerical results without enough
2219 provision to enable the programmer to control and solve
2220 problems connected with numerical accuracy and
2221 cumulative round-off errors. The author suggests the
2222 varying length floating point arithmetic as a general
2223 purpose solution for most of these problems. Some
2224 general philosophies are outlined for applications of
2225 this feature in numerical analysis. The idea is
2226 analyzed further discussing hardware and software
2227 implementations.",
2228 acknowledgement = ack-nhfb,
2229 pdfpages = "40",
2230 }
2231
2232 @TechReport{Polya:1967:GME,
2233 author = "George Polya",
2234 title = "{Graeffe}'s method for eigenvalues",
2235 type = "Technical Report",
2236 number = "CS-TR-67-63",
2237 institution = inst-STAN-CS,
2238 address = inst-STAN-CS:adr,
2239 pages = "??",
2240 month = apr,
2241 year = "1967",
2242 bibdate = "Fri Nov 7 07:11:14 MST 2025",
2243 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
2244 URL = "http://i.stanford.edu/TR/CS-TR-67-63.html",
2245 abstract = "Let an entire function F(z) of finite genus have
2246 infinitely many zeros which are all positive, and take
2247 real values for real z. Then it is shown how to give
2248 two-sided bounds for all the zeros of F in terms of the
2249 coefficients of the power series of F, and of
2250 coefficients obtained by Graeffe's algorithm applied to
2251 F. A simple numerical illustration is given for a
2252 Bessel function.",
2253 acknowledgement = ack-nhfb,
2254 pdfpages = "11",
2255 }
2256
2257 @TechReport{Richman:1967:FPN,
2258 author = "Paul L. Richman",
2259 title = "Floating-point number representations: base choice
2260 versus exponent range",
2261 type = "Technical Report",
2262 number = "CS-TR-67-64",
2263 institution = inst-STAN-CS,
2264 address = inst-STAN-CS:adr,
2265 pages = "??",
2266 month = apr,
2267 year = "1967",
2268 bibdate = "Fri Nov 7 07:11:14 MST 2025",
2269 bibsource = "https://www.math.utah.edu/pub/tex/bib/fparith.bib;
2270 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
2271 URL = "http://i.stanford.edu/TR/CS-TR-67-64.html",
2272 abstract = "A digital computer whose memory words are composed of
2273 r-state devices is considered. The choice of the base,
2274 $ \Beta $, for the internal floating-point numbers on
2275 such a computer is discussed. Larger values of $ \Beta
2276 $ necessitate the use of more r-state devices for the
2277 mantissa, in order to preserve some `minimum accuracy,'
2278 leaving fewer r-state devices for the exponent of $
2279 \Beta $. As $ \Beta $ increases, the exponent range may
2280 increase for a short period, but it must ultimately
2281 decrease to zero. Of course, this behavior depends on
2282 what definition of accuracy is used. This behavior is
2283 analyzed for a recently proposed definition of accuracy
2284 which specifies when it is to be said that the set of
2285 q-digit base $ \Beta $ floating-point numbers is
2286 accurate to p-digits base t. The only case of practical
2287 importance today is t=10 and r=2; and in this case we
2288 find that $ \Beta $ = 2 is always best. However the
2289 analysis is done to cover all cases.",
2290 acknowledgement = ack-nhfb,
2291 pdfpages = "36",
2292 }
2293
2294 @TechReport{Wirth:1967:CBC,
2295 author = "Niklaus Wirth",
2296 title = "On certain basic concepts of programming languages",
2297 type = "Technical Report",
2298 number = "CS-TR-67-65",
2299 institution = inst-STAN-CS,
2300 address = inst-STAN-CS:adr,
2301 pages = "ii + 30",
2302 day = "1",
2303 month = may,
2304 year = "1967",
2305 bibdate = "Fri Nov 7 07:11:14 MST 2025",
2306 bibsource = "https://www.math.utah.edu/pub/bibnet/authors/w/wirth-niklaus.bib;
2307 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
2308 URL = "http://i.stanford.edu/pub/cstr/reports/cs/tr/67/65/CS-TR-67-65.pdf;
2309 http://i.stanford.edu/TR/CS-TR-67-65.html",
2310 abstract = "Recent developments of programming languages have led
2311 to the emergence of languages whose growth showed
2312 cancerous symptoms: the proliferation of new elements
2313 defied every control exercised by the designers, and
2314 the nature of the new cells often proved to be
2315 incompatible with the existing body. In order that a
2316 language be free from such symptoms, it is necessary
2317 that it be built upon basic concepts which are sound
2318 and mutually independent. The rules governing the
2319 language must be simple, generally applicable and
2320 consistent. In order that simplicity and consistency
2321 can be achieved, the fundamental concepts of a language
2322 must be well-chosen and defined with utmost clarity. In
2323 practice, it turns out that there exists an optimum in
2324 the number of basic concepts, below which not only
2325 implementability of these concepts on actual computers,
2326 but also their appeal to human intuition becomes
2327 questionable because of their high degree of
2328 generalization. These informal notes do not abound with
2329 ready-made solutions, but it is hoped they shed some
2330 light on several related subjects and inherent
2331 difficulties. They are intended to summarize and
2332 interrelate various ideas which are partly present in
2333 existing languages, partly debated within the IFIP
2334 Working Group 2.1, and partly new. While emphasis is
2335 put on clarification of conceptual issues,
2336 consideration of notation cannot be ignored. However,
2337 no formal or concise definitions of notation (syntax)
2338 will be given or used; the concepts will instead be
2339 illustrated by examples, using notation based on Algol
2340 as far as possible.",
2341 acknowledgement = ack-nhfb,
2342 author-dates = "Niklaus Wirth (15 February 1934--1 January 2024)",
2343 pdfpages = "33",
2344 }
2345
2346 @TechReport{Varah:1967:CBI,
2347 author = "J. M. Varah",
2348 title = "The Computation of Bounds for the Invariant Subspaces
2349 of a General Matrix Operator",
2350 type = "Technical Report",
2351 number = "STAN-CS-67-66 (AD652921)",
2352 institution = inst-STAN-CS,
2353 address = inst-STAN-CS:adr,
2354 pages = "240",
2355 month = may,
2356 year = "1967",
2357 bibdate = "Fri Nov 21 14:21:14 2025",
2358 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
2359 URL = "",
2360 acknowledgement = ack-nhfb,
2361 remark = "No PDF in NTRL archive.",
2362 }
2363
2364 @TechReport{Bartels:1967:CCR,
2365 author = "Richard H. Bartels and Gene H. Golub",
2366 title = "Computational considerations regarding the calculation
2367 of {Chebyshev} solutions for overdetermined linear
2368 equation systems by the exchange method",
2369 type = "Technical Report",
2370 number = "STAN-CS-67-67 (AD652992)",
2371 institution = inst-STAN-CS,
2372 address = inst-STAN-CS:adr,
2373 pages = "??",
2374 month = jun,
2375 year = "1967",
2376 bibdate = "Fri Nov 7 07:11:14 MST 2025",
2377 bibsource = "https://www.math.utah.edu/pub/bibnet/authors/g/golub-gene-h.bib;
2378 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
2379 URL = "http://i.stanford.edu/TR/CS-TR-67-67.html",
2380 abstract = "An implementation, using Gaussian $ L U $
2381 decomposition with row interchanges, of Stiefel's
2382 exchange algorithm for determining a Chebyshev solution
2383 to an overdetermined system of linear equations is
2384 presented. The implementation is computationally more
2385 stable than those usually given in the literature. A
2386 generalization of Stiefel's algorithm is developed
2387 which permits the occasional exchange of two equations
2388 simultaneously. Finally, some experimental comparisons
2389 are offered",
2390 acknowledgement = ack-nhfb,
2391 author-dates = "Gene Howard Golub (February 29, 1932--November 16,
2392 2007)",
2393 pdfpages = "66",
2394 xxnumber = "CS-TR-67-67",
2395 }
2396
2397 @TechReport{Wirth:1967:PS,
2398 author = "Niklaus Wirth",
2399 title = "The {PL360} system",
2400 type = "Technical Report",
2401 number = "CS-TR-67-68",
2402 institution = inst-STAN-CS,
2403 address = inst-STAN-CS:adr,
2404 pages = "??",
2405 month = jun,
2406 year = "1967",
2407 bibdate = "Fri Nov 7 07:11:14 MST 2025",
2408 bibsource = "https://www.math.utah.edu/pub/bibnet/authors/w/wirth-niklaus.bib;
2409 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
2410 URL = "http://i.stanford.edu/TR/CS-TR-67-68.html",
2411 abstract = "This report describes the use and the organization of
2412 the operating system which serves as the environment of
2413 the PL360 language defined in the companion report, CS
2414 53 [Niklaus Wirth, `A Programming Language for the 360
2415 Computers,' Stanford University Department of Computer
2416 Science, June 1967]. Edited by Niklaus Wirth.",
2417 acknowledgement = ack-nhfb,
2418 pdfpages = "72",
2419 }
2420
2421 @TechReport{Feldman:1967:TWS,
2422 author = "Jerome A. Feldman and David Gries",
2423 title = "Translator writing systems",
2424 type = "Technical Report",
2425 number = "CS-TR-67-69",
2426 institution = inst-STAN-CS,
2427 address = inst-STAN-CS:adr,
2428 pages = "??",
2429 month = jun,
2430 year = "1967",
2431 bibdate = "Fri Nov 7 07:11:14 MST 2025",
2432 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
2433 URL = "http://i.stanford.edu/TR/CS-TR-67-69.html",
2434 abstract = "Compiler writing has long been a glamour field within
2435 programming and has a well developed folklore. More
2436 recently, the attention of researchers has been
2437 directed toward various schemes for automating
2438 different parts of the compiler writer's task. This
2439 paper contains neither a history of nor an introduction
2440 to these developments; the references at the end of
2441 this section provide what introductory material there
2442 is in the literature. Although we will make comparisons
2443 between individual systems and between various
2444 techniques, this is certainly not a consumer's guide to
2445 translator writing systems. Our intended purpose is to
2446 carefully consider the existing work in an attempt to
2447 form a unified scientific basis for future research.",
2448 acknowledgement = ack-nhfb,
2449 pdfpages = "136",
2450 }
2451
2452 @TechReport{Bergman:1967:CFP,
2453 author = "Stefan Bergman and John G. Herriot and Paul L.
2454 Richman",
2455 title = "On computation of flow patterns of compressible fluids
2456 in the transonic region",
2457 type = "Technical Report",
2458 number = "CS-TR-67-70",
2459 institution = inst-STAN-CS,
2460 address = inst-STAN-CS:adr,
2461 pages = "??",
2462 month = jul,
2463 year = "1967",
2464 bibdate = "Fri Nov 7 07:11:14 MST 2025",
2465 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
2466 URL = "http://i.stanford.edu/TR/CS-TR-67-70.html",
2467 abstract = "The first task in devising a numerical procedure for
2468 solving a given problem is that of finding a
2469 constructive mathematical solution to the problem. But
2470 even after such a solution is found there is much to be
2471 done. Mathematical solutions normally involve infinite
2472 processes such as integration and differentiation as
2473 well as infinitely precise arithmetic and functions
2474 defined in arbitrarily involved ways. Numerical
2475 procedures suitable for a computer can involve only
2476 finite processes, fixed or at least bounded length
2477 arithmetic and rational functions. Thus one must find
2478 efficient methods which yield approximate solutions. Of
2479 interest here are the initial and boundary value
2480 problems for compressible fluid flow. Constructive
2481 solutions to these problems can be found in [Bergman,
2482 S., `On representation of stream functions of subsonic
2483 and supersonic flows of compressible fluids,' Journal
2484 of Rational Mechanics and Analysis, v.4 (1955), no. 6,
2485 pp. 883-905]. As presented there, solution of the
2486 boundary value problem is limited to the subsonic
2487 region, and is given symbolically as a linear
2488 combination of orthogonal functions. A numerical
2489 continuation of this (subsonic) solution into the
2490 supersonic region can be done by using the (subsonic)
2491 solution and its derivative to set up an initial value
2492 problem. The solution to the initial value problem may
2493 then be valid in (some part of) the supersonic region.
2494 Whether this continuation will lead to a closed,
2495 meaningful flow is an open question. In this paper, we
2496 deal with the numerical solution of the initial value
2497 problem. We are currently working on the rest of the
2498 procedure described above.",
2499 acknowledgement = ack-nhfb,
2500 pdfpages = "84",
2501 }
2502
2503 @TechReport{Jenkins:1967:AAG,
2504 author = "M. A. Jenkins and J. F. Traub",
2505 title = "An Algorithm for an Automatic General Polynomial
2506 Solver",
2507 type = "Technical Report",
2508 number = "STAN-CS-67-71 (AD655230)",
2509 institution = inst-STAN-CS,
2510 address = inst-STAN-CS:adr,
2511 pages = "iii + 34",
2512 day = "21",
2513 month = jul,
2514 year = "1967",
2515 bibdate = "Fri Nov 21 14:21:14 2025",
2516 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
2517 URL = "",
2518 acknowledgement = ack-nhfb,
2519 pdfpages = "43",
2520 }
2521
2522 @TechReport{Golub:1967:CAC,
2523 author = "Gene H. Golub and Lyle B. Smith",
2524 title = "{Chebyshev} approximation of continuous functions by a
2525 {Chebyshev} system of functions",
2526 type = "Technical Report",
2527 number = "STAN-CS-67-72 (PB175581)",
2528 institution = inst-STAN-CS,
2529 address = inst-STAN-CS:adr,
2530 pages = "54",
2531 month = jul,
2532 year = "1967",
2533 bibdate = "Fri Nov 7 07:11:14 MST 2025",
2534 bibsource = "https://www.math.utah.edu/pub/bibnet/authors/g/golub-gene-h.bib;
2535 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
2536 URL = "http://i.stanford.edu/TR/CS-TR-67-72.html",
2537 abstract = "The second algorithm of Remez can be used to compute
2538 the minimax approximation to a function, $ f(x) $, by a
2539 linear combination of functions, $ {\{ Q_i (x) \} }^N_O
2540 $, which form a Chebyshev system. The only restriction
2541 on the function to be approximated is that it be
2542 continuous on a finite interval $ [a, b] $. An Algol 60
2543 procedure is given which will accomplish the
2544 approximation. This implementation of the second
2545 algorithm of Remez is quite general in that the
2546 continuity of $ f(x) $ is all that is required whereas
2547 previous implementations have required
2548 differentiability, that the end points of the interval
2549 be ``critical points,'' and that the number of
2550 ``critical points'' be exactly $ N + 2 $. Discussion of
2551 the method used and its numerical properties is given
2552 as well as some computational examples of the use of
2553 the algorithm. The use of orthogonal polynomials (which
2554 change at each iteration) as the Chebyshev system is
2555 also discussed.",
2556 acknowledgement = ack-nhfb,
2557 author-dates = "Gene Howard Golub (February 29, 1932--November 16,
2558 2007)",
2559 pdfpages = "60",
2560 xxnumber = "CS-TR-67-72",
2561 }
2562
2563 @TechReport{Golub:1967:LSS,
2564 author = "Gene H. Golub and Peter Businger",
2565 title = "Least Squares, Singular Values and Matrix
2566 Approximations (and an {ALGOL} Procedure for Computing
2567 the Singular Value Decomposition)",
2568 type = "Technical Report",
2569 number = "STAN-CS-67-73 (AD662883)",
2570 institution = inst-STAN-CS,
2571 address = inst-STAN-CS:adr,
2572 pages = "i + 22",
2573 day = "31",
2574 month = jul,
2575 year = "1967",
2576 bibdate = "Fri Nov 21 14:21:14 2025",
2577 bibsource = "https://www.math.utah.edu/pub/bibnet/authors/g/golub-gene-h.bib;
2578 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
2579 URL = "https://apps.dtic.mil/sti/html/tr/AD0662883",
2580 acknowledgement = ack-nhfb,
2581 author-dates = "Gene Howard Golub (February 29, 1932--November 16,
2582 2007)",
2583 pdfpages = "23",
2584 remark = "No abstract is available.",
2585 }
2586
2587 @TechReport{Forsythe:1967:WSQ,
2588 author = "George E. Forsythe",
2589 title = "What is a Satisfactory Quadratic Equation Solver?",
2590 type = "Technical Report",
2591 number = "CS-TR-67-74 (AD657639)",
2592 institution = inst-STAN-CS,
2593 address = inst-STAN-CS:adr,
2594 pages = "ii + 9",
2595 day = "7",
2596 month = aug,
2597 year = "1967",
2598 bibdate = "Wed Jul 01 15:33:08 2009",
2599 bibsource = "https://www.math.utah.edu/pub/bibnet/authors/f/forsythe-george-elmer.bib;
2600 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
2601 URL = "https://apps.dtic.mil/sti/pdfs/AD0657639.pdf",
2602 abstract = "The report discusses precise requirements for a
2603 satisfactory computer program to solve a quadratic
2604 equation with floating-point coefficients. The
2605 principal practical problem is coping with overflow and
2606 underflow.",
2607 abstract-2 = "Following the suggestions of Professor W. Kahan, the
2608 author details precise requirements for a satisfactory
2609 computer program to solve a quadratic equation with
2610 floating-point coefficients. The principal practical
2611 problem is coping with overflow and underflow.",
2612 acknowledgement = ack-nhfb,
2613 author-dates = "George Elmer Forsythe (8 January 1917--9 April 1972)",
2614 pdfpages = "13",
2615 remark = "There no abstract in the paper; one was supplied in a
2616 Web source. The AD0657639 file NTRL back matter
2617 supplies the second abstract.",
2618 }
2619
2620 @TechReport{Bauer:1967:TN,
2621 author = "Friedrich L. Bauer",
2622 title = "Theory of norms",
2623 type = "Technical Report",
2624 number = "CS-TR-67-75",
2625 institution = inst-STAN-CS,
2626 address = inst-STAN-CS:adr,
2627 pages = "??",
2628 month = aug,
2629 year = "1967",
2630 bibdate = "Fri Nov 7 07:11:14 MST 2025",
2631 bibsource = "https://www.math.utah.edu/pub/bibnet/authors/b/bauer-friedrich-ludwig.bib;
2632 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
2633 URL = "http://i.stanford.edu/TR/CS-TR-67-75.html",
2634 abstract = "These notes are based on lectures given during the
2635 winter of 1967 as CS 233, Computer Science Department,
2636 Stanford University.",
2637 acknowledgement = ack-nhfb,
2638 pdfpages = "146",
2639 }
2640
2641 @TechReport{Anselone:1967:CCO,
2642 author = "Phillip M. Anselone",
2643 title = "Collectively compact operator approximations",
2644 type = "Technical Report",
2645 number = "CS-TR-67-76",
2646 institution = inst-STAN-CS,
2647 address = inst-STAN-CS:adr,
2648 pages = "??",
2649 month = sep,
2650 year = "1967",
2651 bibdate = "Fri Nov 7 07:11:14 MST 2025",
2652 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
2653 URL = "http://i.stanford.edu/TR/CS-TR-67-76.html",
2654 abstract = "This report consists of notes based on lectures
2655 presented July--August 1967. The notes were prepared by
2656 Lyle Smith. A general approximation theory for linear
2657 and nonlinear operators on Banach spaces is presented.
2658 It is applied to numerical integration approximations
2659 of integral operators. Convergence of the operator
2660 approximations is pointwise rather than uniform on
2661 bounded sets, which is assumed in other theories. The
2662 operator perturbations form a collectively compact set,
2663 i.e., they map each bounded set into a single compact
2664 set. In the nonlinear case, Frechet differentiability
2665 conditions are also imposed. Principal results include
2666 convergence and error bounds for approximate solutions
2667 and, for linear operators, results on spectral
2668 approximations.",
2669 acknowledgement = ack-nhfb,
2670 pdfpages = "68",
2671 }
2672
2673 @TechReport{Forsythe:1967:WDT,
2674 author = "George E. Forsythe",
2675 title = "What to do till the computer scientist comes",
2676 type = "Technical Report",
2677 number = "CS-TR-67-77",
2678 institution = inst-STAN-CS,
2679 address = inst-STAN-CS:adr,
2680 pages = "ii + 13",
2681 day = "22",
2682 month = sep,
2683 year = "1967",
2684 bibdate = "Fri Nov 7 07:11:14 MST 2025",
2685 bibsource = "https://www.math.utah.edu/pub/bibnet/authors/f/forsythe-george-elmer.bib;
2686 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
2687 URL = "http://i.stanford.edu/TR/CS-TR-67-77.html",
2688 abstract = "The potential impact of computer science departments
2689 in the field of education is discussed. This is an
2690 expanded version of a presentation to a panel session
2691 before the Mathematics Association of America, Toronto,
2692 30 August 1967.",
2693 acknowledgement = ack-nhfb,
2694 author-dates = "George Elmer Forsythe (8 January 1917--9 April 1972)",
2695 pdfpages = "15",
2696 }
2697
2698 @TechReport{Colby:1967:MUN,
2699 author = "Kenneth Mark Colby and Horace J. Enea",
2700 title = "Machine utilization of the natural language word
2701 'good'",
2702 type = "Technical Report",
2703 number = "CS-TR-67-78",
2704 institution = inst-STAN-CS,
2705 address = inst-STAN-CS:adr,
2706 pages = "??",
2707 month = sep,
2708 year = "1967",
2709 bibdate = "Fri Nov 7 07:11:14 MST 2025",
2710 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
2711 URL = "http://i.stanford.edu/TR/CS-TR-67-78.html",
2712 abstract = "Using the term 'good' as an example, the effect of
2713 natural language input on an interviewing computer
2714 program is described. The program utilizes syntactic
2715 and semantic information to generate relevant plausible
2716 inferences from which statements for a goal-directed
2717 man--machine dialogue can be constructed.",
2718 acknowledgement = ack-nhfb,
2719 pdfpages = "11",
2720 }
2721
2722 @TechReport{Doran:1967:FIF,
2723 author = "Robert W. Doran",
2724 title = "{360 O.S. FORTRAN IV} free field input\slash output
2725 subroutine package",
2726 type = "Technical Report",
2727 number = "CS-TR-67-79",
2728 institution = inst-STAN-CS,
2729 address = inst-STAN-CS:adr,
2730 pages = "??",
2731 month = oct,
2732 year = "1967",
2733 bibdate = "Fri Nov 7 07:11:14 MST 2025",
2734 bibsource = "http://www.math.utah.edu/pub/tex/bib/fortran1.bib;
2735 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
2736 URL = "http://i.stanford.edu/TR/CS-TR-67-79.html",
2737 abstract = "Programmers dealing with aspects of natural language
2738 processing have a difficult task in choosing a computer
2739 language which enables them to program easily, produce
2740 efficient code and accept as data freely written
2741 sentences with words of arbitrary length. List
2742 processing languages such as LISP are reasonably easy
2743 to program in but do not execute very quickly. Other,
2744 formula oriented, languages like FORTRAN are not
2745 provided with free field input. The Computational
2746 Linguistics group at the Stanford University Computer
2747 Science Department is writing a system for testing
2748 transformational grammars. As these grammars are
2749 generally large and complicated, it is important to
2750 make the system as efficient as possible, so we are
2751 using FORTRAN IV (O.S. on IBM 360-65) as our language.
2752 To enable us to handle free field input we have
2753 developed a subroutine package which we describe here
2754 in the hope that it will be useful to others embarking
2755 on natural language tasks. The package consists of two
2756 main programs, free field reader, free field writer,
2757 with a number of utility routines and constant COMMON
2758 blocks.",
2759 acknowledgement = ack-nhfb,
2760 pdfpages = "22",
2761 }
2762
2763 @TechReport{Friedman:1967:DRG,
2764 author = "Joyce Friedman",
2765 title = "Directed random generation of sentences",
2766 type = "Technical Report",
2767 number = "CS-TR-67-80",
2768 institution = inst-STAN-CS,
2769 address = inst-STAN-CS:adr,
2770 pages = "??",
2771 month = oct,
2772 year = "1967",
2773 bibdate = "Fri Nov 7 07:11:14 MST 2025",
2774 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
2775 URL = "http://i.stanford.edu/TR/CS-TR-67-80.html",
2776 abstract = "The problem of producing sentences of a
2777 transformational grammar by using a random generator to
2778 create phrase structure trees for input to the lexical
2779 insertion and transformational phases is discussed. A
2780 purely random generator will produce base trees which
2781 will be blocked by the transformations, and which are
2782 frequently too long to be of practical interest. A
2783 solution is offered in the form of a computer program
2784 which allows the user to constrain and direct the
2785 generation by the simple but powerful device of
2786 restricted subtrees. The program is a directed random
2787 generator which accepts as input a subtree with
2788 restrictions and produces around it a tree which
2789 satisfies the restrictions and is ready for the next
2790 phase of the grammar. The underlying linguistic model
2791 is that of Noam Chomsky, as presented in `Aspects of
2792 the Theory of Syntax.' The program is written in
2793 Fortran IV for the IBM 360/67 and is part of the
2794 Stanford Transformational Grammar Testing System. It is
2795 currently being used with several partial grammars of
2796 English.",
2797 acknowledgement = ack-nhfb,
2798 pdfpages = "32",
2799 }
2800
2801 @TechReport{Golub:1967:CGQ,
2802 author = "Gene H. Golub and John H. Welsch",
2803 title = "Calculation of {Gauss} quadrature rules",
2804 type = "Technical Report",
2805 number = "STAN-CS-67-81 (AD661217)",
2806 institution = inst-STAN-CS,
2807 address = inst-STAN-CS:adr,
2808 pages = "28",
2809 month = nov,
2810 year = "1967",
2811 bibdate = "Fri Nov 7 07:11:14 MST 2025",
2812 bibsource = "https://www.math.utah.edu/pub/bibnet/authors/g/golub-gene-h.bib;
2813 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
2814 URL = "http://i.stanford.edu/TR/CS-TR-67-81.html",
2815 abstract = "Most numerical integration techniques consist of
2816 approximating the integrand by a polynomial in a region
2817 or regions and then integrating the polynomial exactly.
2818 Often a complicated integrand can be factored into a
2819 non-negative 'weight' function and another function
2820 better approximated by a polynomial, thus $ \int_a^b
2821 g(t)d t = \int_a^b \omega (t)f(t)d t \approx \sum_{i =
2822 1}^N w_i f(t_i) $. Hopefully, the quadrature rule $ {\{
2823 w_j, t_j \} }_{j = 1}^N $ corresponding to the weight
2824 function $ \omega (t) $ is available in tabulated form,
2825 but more likely it is not. We present here two
2826 algorithms for generating the Gaussian quadrature rule
2827 defined by the weight function when: (a) the three term
2828 recurrence relation is known for the orthogonal
2829 polynomials generated by $ \omega (t) $, and (b) the
2830 moments of the weight function are known or can be
2831 calculated.",
2832 acknowledgement = ack-nhfb,
2833 author-dates = "Gene Howard Golub (February 29, 1932--November 16,
2834 2007)",
2835 pdfpages = "31",
2836 xxnumber = "CS-TR-67-81",
2837 }
2838
2839 @TechReport{Tesler:1967:DGR,
2840 author = "Lawrence Tesler and Horace Enea and Kenneth Mark
2841 Colby",
2842 title = "A Directed Graph Representation for Computer
2843 Simulation of Belief Systems",
2844 type = "Technical Report",
2845 number = "STAN-CS-67-82 (PB176775)",
2846 institution = inst-STAN-CS,
2847 address = inst-STAN-CS:adr,
2848 pages = "iv + 28",
2849 day = "29",
2850 month = dec,
2851 year = "1967",
2852 bibdate = "Fri Nov 21 14:21:14 2025",
2853 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
2854 URL = "https://en.wikipedia.org/wiki/Larry_Tesler",
2855 abstract = "A method of representing data-structures in the form
2856 of a directed graph is described. Such a graph is
2857 suitable for the data-base of belief systems in
2858 particular and of large memory structures in general.",
2859 acknowledgement = ack-nhfb,
2860 author-dates = "Lawrence Gordon Tesler (24 April 1945--16 February
2861 2020)",
2862 pdfpages = "33",
2863 }
2864
2865 @TechReport{Colby:1968:CAL,
2866 author = "Kenneth Mark Colby",
2867 title = "Computer-Aided Language Development in Nonspeaking
2868 Mentally Disturbed Children",
2869 type = "Technical Report",
2870 number = "STAN-CS-68-85 (PB177426)",
2871 institution = inst-STAN-CS,
2872 address = inst-STAN-CS:adr,
2873 pages = "35",
2874 month = dec,
2875 year = "1968",
2876 bibdate = "Fri Nov 7 07:11:14 MST 2025",
2877 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
2878 URL = "http://i.stanford.edu/TR/CS-TR-68-85.html",
2879 abstract = "Experience with a computer-based method for aiding
2880 language development in nonspeaking mentally disturbed
2881 children is described. Out of a group of 10 children, 8
2882 improved linguistically, while 2 were unimproved.
2883 Problems connected with the method and its future
2884 prospects are briefly discussed.",
2885 acknowledgement = ack-nhfb,
2886 pdfpages = "37",
2887 xxnumber = "CS-TR-68-85",
2888 }
2889
2890 @TechReport{Bredt:1968:CMI,
2891 author = "Thomas H. Bredt",
2892 title = "A Computer Model of Information Processing in
2893 Children",
2894 type = "Technical Report",
2895 number = "STAN-CS-68-100 (PB178877)",
2896 institution = inst-STAN-CS,
2897 address = inst-STAN-CS:adr,
2898 pages = "60",
2899 month = jun,
2900 year = "1968",
2901 bibdate = "Fri Nov 7 07:11:14 MST 2025",
2902 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
2903 URL = "http://i.stanford.edu/TR/CS-TR-68-100.html",
2904 abstract = "A model of cognitive information processing has been
2905 constructed on the basis of a protocol gathered from a
2906 child taking an object association test. The basic
2907 elements of the model are a graph-like data base and
2908 strategy. The data base contains facts that relate
2909 objects in the experiment. The graph distance that
2910 separates two objects in the data base is the measure
2911 of how well a relation is known. The strategy used in
2912 searching for facts that relate two objects is
2913 sequential in nature. The model has been programmed for
2914 computer testing in the LISP programming language. The
2915 responses of the computer model and the original
2916 subject are compared. To aid in the model evaluation a
2917 revised test was defined and administered to two
2918 children. The results were modeled and the
2919 correspondence of model and subject performance is
2920 discussed.",
2921 acknowledgement = ack-nhfb,
2922 pdfpages = "74",
2923 xxnumber = "CS-TR-68-100",
2924 }
2925
2926 @TechReport{Pnueli:1968:IPC,
2927 author = "Amir Pnueli",
2928 title = "Integer Programming Over a Cone",
2929 type = "Technical Report",
2930 number = "STAN-CS-68-102 (AD677982)",
2931 institution = inst-STAN-CS,
2932 address = inst-STAN-CS:adr,
2933 pages = "29",
2934 month = jul,
2935 year = "1968",
2936 bibdate = "Fri Nov 7 07:11:14 MST 2025",
2937 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
2938 URL = "http://i.stanford.edu/TR/CS-TR-68-102.html",
2939 abstract = "The properties of a special form integer programming
2940 problem are discussed. We restrict ourselves to
2941 optimization over a cone (a set of n constraints in n
2942 unconstrained variables) with a square matrix of
2943 positive diagonal and non positive off-diagonal
2944 elements. (Called a bounding form by F. Glover [1964]).
2945 It is shown that a simple iterational process gives the
2946 optimal integer solution in a finite number of steps.
2947 It is then shown that any cone problem with bounded
2948 rational solution can be transformed to the bounding
2949 form and hence solved by the outlined method. Some
2950 extensions to more than n constraints are discussed and
2951 a numerical example is shown to solve a bigger
2952 problem.",
2953 acknowledgement = ack-nhfb,
2954 pdfpages = "30",
2955 xxnumber = "CS-TR-68-102",
2956 }
2957
2958 @TechReport{Friedman:1968:LIT,
2959 author = "Joyce Friedman and Thomas H. Bredt",
2960 title = "Lexical Insertion in Transformational Grammar",
2961 type = "Technical Report",
2962 number = "STAN-CS-68-103 (AD692689)",
2963 institution = inst-STAN-CS,
2964 address = inst-STAN-CS:adr,
2965 pages = "vi + 47",
2966 month = jun,
2967 year = "1968",
2968 bibdate = "Fri Nov 7 07:11:14 MST 2025",
2969 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
2970 URL = "http://i.stanford.edu/TR/CS-TR-68-103.html",
2971 abstract = "In this paper, we describe the lexical insertion
2972 process for generative transformational grammars. We
2973 also give detailed descriptions of many of the concepts
2974 in transformational theory. These include the notions
2975 of complex symbol, syntactic feature (particularly
2976 contextual feature), redundancy rule, tests for pairs
2977 of complex symbols, and change operations that may be
2978 applied to complex symbols. Because of our general
2979 interpretation of redundancy rules, we define a new
2980 complex symbol test known as compatibility. This test
2981 replaces the old notion of nondistinctness. The form of
2982 a lexicon suitable for use with a generative grammar is
2983 specified.\par
2984
2985 In lexical insertion, vocabulary words and associated
2986 complex symbols are selected from a lexicon and
2987 inserted at lexical category nodes in the tree. Complex
2988 symbols are lists of syntactic features. The
2989 compatibility of a pair of complex symbols and the
2990 analysis procedure used for contextual features are
2991 basic in determining suitable items for insertion.
2992 Contextual features (subcategorization and selectional)
2993 have much in common with the structural description for
2994 a transformation and we use the same analysis procedure
2995 for both. A problem encountered in the insertion of a
2996 complex symbol that contains selectional features is
2997 side effects. We define the notion of side effects and
2998 describe how these effects are to be treated.\par
2999
3000 The development of the structure of the lexicon and the
3001 lexical insertion algorithm has been aided by a system
3002 of computer programs that enable the linguist to study
3003 transformational grammar. In the course of this
3004 development, a computer program to perform lexical
3005 insertion was written. Results obtained using this
3006 program with fragments of transformational grammar are
3007 presented. The paper concludes with suggestions for
3008 extensions of this work and a discussion of
3009 interpretations of transformational theory that do not
3010 fit immediately into our framework.",
3011 acknowledgement = ack-nhfb,
3012 pdfpages = "53",
3013 xxnumber = "CS-TR-68-103",
3014 }
3015
3016 @TechReport{Jenkins:1968:TSV,
3017 author = "M. A. Jenkins and J. F. Traub",
3018 title = "A Three-Stage Variable-Shift Iteration for Polynomial
3019 Zeros and its Relation to Generalized {Rayleigh}
3020 Iteration",
3021 type = "Technical Report",
3022 number = "STAN-CS-68-107 (AD668558, AD0673673)",
3023 institution = inst-STAN-CS,
3024 address = inst-STAN-CS:adr,
3025 pages = "viii + 40 + 2",
3026 day = "26",
3027 month = aug,
3028 year = "1968",
3029 bibdate = "Fri Nov 7 07:11:14 MST 2025",
3030 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
3031 URL = "http://i.stanford.edu/TR/CS-TR-68-107.html;
3032 https://apps.dtic.mil/sti/html/tr/AD0673673/index.html",
3033 abstract = "We introduce a new three-stage process for calculating
3034 the zeros of a polynomial with complex coefficients.
3035 The algorithm is similar in spirit to the two-stage
3036 algorithms studied by Traub in a series of papers. The
3037 algorithm is restriction free, that is, it converges
3038 for any distribution of zeros. A proof of global
3039 convergence is given.\par
3040
3041 Zeros are calculated in roughly increasing order of
3042 magnitude to avoid deflation instability. Shifting is
3043 incorporated in a natural and stable way to break
3044 equimodularity and speed convergence. The three stages
3045 use no shift, a fixed shift, and a variable shift,
3046 respectively.\par
3047
3048 To obtain additional insight we recast the problem and
3049 algorithm into matrix form. The third stage is inverse
3050 iteration with the companion matrix, followed by
3051 generalized Rayleigh iteration. A program implementing
3052 the algorithm was written in a dialect of ALGOL 60 and
3053 run on Stanford University's IBM 360/67. The program
3054 has been extensively tested and testing is continuing.
3055 For polynomials with complex coefficients and of
3056 degrees ranging from 20 to 50, the time required to
3057 calculate all zeros averages $ 8 n^2 $ milliseconds.
3058 Timing information and a numerical example are
3059 provided. A description of the implementation, an
3060 analysis of the effects of finite-precision arithmetic,
3061 an ALGOL 60 program, the results of extensive testing,
3062 and a second program which clusters the zeros and
3063 provides a posteriori error bounds will appear
3064 elsewhere.",
3065 acknowledgement = ack-nhfb,
3066 pdfpages = "52",
3067 xxnumber = "CS-TR-68-107",
3068 }
3069
3070 @TechReport{Friedman:1968:CSW,
3071 author = "Joyce Friedman",
3072 title = "A Computer System for Writing and Testing
3073 Transformational Grammars --- Final Report",
3074 type = "Technical Report",
3075 number = "STAN-CS-68-109 (AD692690)",
3076 institution = inst-STAN-CS,
3077 address = inst-STAN-CS:adr,
3078 pages = "14",
3079 month = sep,
3080 year = "1968",
3081 bibdate = "Fri Nov 7 07:11:14 MST 2025",
3082 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
3083 URL = "http://i.stanford.edu/TR/CS-TR-68-109.html",
3084 abstract = "A comprehensive system for transformational grammar
3085 has been designed and is being implemented on the IBM
3086 360/67 computer. The system deals with the
3087 transformational model of syntax, along the lines of
3088 Chomsky's `Aspects of the Theory of Syntax.' The major
3089 innovations include a full and formal description of
3090 the syntax of a transformational grammar, a directed
3091 random phrase structure generator, a lexical insertion
3092 algorithm, and a simple problem-oriented programming
3093 language in which the algorithm for application of
3094 transformations can be expressed. In this paper we
3095 present the system as a whole, first discussing the
3096 philosophy underlying the development of the system,
3097 then outlining the system and discussing its more
3098 important special features. References are given to
3099 papers which consider particular aspects of the system
3100 in detail.",
3101 acknowledgement = ack-nhfb,
3102 pdfpages = "16",
3103 xxnumber = "CS-TR-68-109",
3104 }
3105
3106 @TechReport{Friedman:1968:ATG,
3107 author = "Joyce Friedman and Theodore S. Martner",
3108 title = "Analysis in Transformational Grammar",
3109 type = "Technical Report",
3110 number = "STAN-CS-68-111 (AD692691)",
3111 institution = inst-STAN-CS,
3112 address = inst-STAN-CS:adr,
3113 pages = "18",
3114 month = aug,
3115 year = "1968",
3116 bibdate = "Fri Nov 7 07:11:14 MST 2025",
3117 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
3118 URL = "http://i.stanford.edu/TR/CS-TR-68-111.html",
3119 abstract = "In generating sentences by means of a transformational
3120 grammar, it is necessary to analyze trees, testing for
3121 the presence or absence of various structures. This
3122 analysis occurs at two stages in the generation process
3123 --- during insertion of lexical items (more precisely,
3124 in testing contextual features), and during the
3125 transformation process, when individual transformations
3126 are being tested for applicability. In this paper we
3127 describe a formal system for the definition of tree
3128 structure of sentences. The system consists of a formal
3129 language for partial or complete definition of the tree
3130 structure of a sentence, plus an algorithm for
3131 comparison of such a definition with a tree. It
3132 represents a significant generalization of Chomsky's
3133 notion of `proper analysis', and is flexible enough to
3134 be used within any transformational grammar which we
3135 have seen.",
3136 acknowledgement = ack-nhfb,
3137 pdfpages = "22",
3138 xxnumber = "CS-TR-68-111",
3139 }
3140
3141 @TechReport{Friedman:1968:CLT,
3142 author = "Joyce Friedman and Bary W. Pollack",
3143 title = "A Control Language for Transformational Grammar",
3144 type = "Technical Report",
3145 number = "STAN-CS-68-112 (AD692687)",
3146 institution = inst-STAN-CS,
3147 address = inst-STAN-CS:adr,
3148 pages = "51",
3149 month = aug,
3150 year = "1968",
3151 bibdate = "Fri Nov 7 07:11:14 MST 2025",
3152 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
3153 URL = "http://i.stanford.edu/TR/CS-TR-68-112.html",
3154 abstract = "Various orders of application of transformations have
3155 been considered in transformational grammar, ranging
3156 from unorder to cyclical orders involving notions of
3157 `lowest sentence' and of numerical indices on depth of
3158 embedding. The general theory of transformational
3159 grammar does not yet offer a uniform set of `traffic
3160 rules' which are accepted by most linguists. Thus, in
3161 designing a model of transformational grammar, it seems
3162 advisable to allow the specification of the order and
3163 point of application of transformations to be a proper
3164 part of the grammar. In this paper we present a simple
3165 control language designed to be used by linguists for
3166 this specification. In the control language the user
3167 has the ability to: 1. Group transformations into
3168 ordered sets and apply transformations either
3169 individually or by transformation set. 2. Specify the
3170 order in which the transformation sets are to be
3171 considered. 3. Specify the subtrees in which a
3172 transformation set is to be applied. 4. Allow the order
3173 of application to depend on which transformations have
3174 previously modified the tree. 5. Apply a transformation
3175 set either once or repeatedly. In addition, since the
3176 control language has been implemented as part of a
3177 computer system, the behavior of the transformations
3178 may be monitored giving additional information on their
3179 operation. In this paper we present the control
3180 language and examples of its use. Discussion of the
3181 computer implementation will be found in [Pollack, B.
3182 W. The Control Program and Associated Subroutines.
3183 Stanford University. Computer Science Department.
3184 Computational Linguistics Project. Report no. AF-28.
3185 June 1968.].",
3186 acknowledgement = ack-nhfb,
3187 pdfpages = "55",
3188 xxnumber = "CS-TR-68-112",
3189 }
3190
3191 @TechReport{George:1968:CIP,
3192 author = "James E. George",
3193 title = "{Calgen} --- an interactive picture calculus
3194 generation system",
3195 type = "Technical Report",
3196 number = "CS-TR-68-114",
3197 institution = inst-STAN-CS,
3198 address = inst-STAN-CS:adr,
3199 pages = "??",
3200 month = dec,
3201 year = "1968",
3202 bibdate = "Fri Nov 7 07:11:14 MST 2025",
3203 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
3204 URL = "http://i.stanford.edu/TR/CS-TR-68-114.html",
3205 abstract = "A sub-set of the Picture Calculus was implemented on
3206 the IBM 360/75 to experiment with the proposed data
3207 structure, to study the capability of PL/1 for
3208 implementing the Picture Calculus and to evaluate the
3209 usefulness of drawing pictures with this formalized
3210 language. The system implemented is referred to as
3211 Calgen. Like many other drawing programs, Calgen
3212 utilizes a graphic display console; however, it differs
3213 from previous drawing systems in one major area,
3214 namely, Calgen retains structure information. Since the
3215 Picture Calculus is highly structured, Calgen retains
3216 structure information, and only scope images where
3217 convenient; further, these scope images saved may be
3218 altered by changing the structure information. The only
3219 reason scope images are saved by Calgen is to avoid
3220 regeneration of a previously generated picture.",
3221 acknowledgement = ack-nhfb,
3222 pdfpages = "79",
3223 }
3224
3225 @TechReport{Friedman:1968:PMC,
3226 author = "Joyce Friedman and Thomas H. Bredt and Robert W. Doran
3227 and Theodore S. Martner and Bary W. Pollack",
3228 title = "Programmers manual for a computer system for
3229 transformational grammar",
3230 type = "Technical Report",
3231 number = "CS-TR-68-115",
3232 institution = inst-STAN-CS,
3233 address = inst-STAN-CS:adr,
3234 pages = "??",
3235 month = aug,
3236 year = "1968",
3237 bibdate = "Fri Nov 7 07:11:14 MST 2025",
3238 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
3239 URL = "http://i.stanford.edu/TR/CS-TR-68-115.html",
3240 abstract = "This volume provides programming notes on a computer
3241 system for transformational grammar. The important
3242 ideas of the system have been presented in a series of
3243 reports which are listed in Appendix B; this document
3244 is the description of the system as a program. It is
3245 intended for programmers who might wish to maintain,
3246 modify or extend the system.",
3247 acknowledgement = ack-nhfb,
3248 pdfpages = "202",
3249 }
3250
3251 @TechReport{Pieper:1968:KMU,
3252 author = "Donald Lee Pieper",
3253 title = "The Kinematics of Manipulators Under Computer
3254 Control",
3255 type = "Technical Report",
3256 number = "STAN-CS-68-116 (AIM-72, AD680036)",
3257 institution = inst-STAN-CS,
3258 address = inst-STAN-CS:adr,
3259 pages = "167",
3260 day = "24",
3261 month = oct,
3262 year = "1968",
3263 bibdate = "Fri Nov 21 14:21:14 2025",
3264 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
3265 URL = "",
3266 abstract = "",
3267 acknowledgement = ack-nhfb,
3268 pdfpages = "180",
3269 remark = "This is the author's thesis.",
3270 }
3271
3272 @TechReport{Adams:1968:CMD,
3273 author = "D. Adams",
3274 title = "A Computational Model with Data Flow Sequencing",
3275 type = "Technical Report",
3276 number = "STAN-CS-68-117 (PB182151)",
3277 institution = inst-STAN-CS,
3278 address = inst-STAN-CS:adr,
3279 pages = "130",
3280 month = dec,
3281 year = "1968",
3282 bibdate = "Fri Nov 21 14:21:14 2025",
3283 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
3284 URL = "",
3285 acknowledgement = ack-nhfb,
3286 remark = "This is the author's thesis. No PDF in NTRL archive.",
3287 }
3288
3289 @TechReport{Waterman:1968:MLH,
3290 author = "Donald Arthur Waterman",
3291 title = "Machine Learning of Heuristics",
3292 type = "Technical Report",
3293 number = "STAN-CS-68-118 (AIM-74, AD681027)",
3294 institution = inst-STAN-CS,
3295 address = inst-STAN-CS:adr,
3296 pages = "235",
3297 month = dec,
3298 year = "1968",
3299 bibdate = "Fri Nov 21 14:21:14 2025",
3300 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
3301 URL = "",
3302 acknowledgement = ack-nhfb,
3303 pdfpages = "251",
3304 remark = "This is the author's thesis.",
3305 }
3306
3307 @TechReport{Bayer:1968:MMP,
3308 author = "Rudolf Bayer and James H. Bigelow and George B.
3309 Dantzig and David J. Gries and Michael B. McGrath and
3310 Paul D. Pinsky and Stephen K. Schuck and Christoph
3311 Witzgall",
3312 title = "{MPL}: {Mathematical Programming Language}",
3313 type = "Technical Report",
3314 number = "CS-TR-68-119",
3315 institution = inst-STAN-CS,
3316 address = inst-STAN-CS:adr,
3317 pages = "??",
3318 month = may,
3319 year = "1968",
3320 bibdate = "Fri Nov 7 07:11:14 MST 2025",
3321 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
3322 URL = "http://i.stanford.edu/TR/CS-TR-68-119.html",
3323 abstract = "The purpose of MPL is to provide a language for
3324 writing mathematical programming algorithms that will
3325 be easier to write, to read, and to modify than those
3326 written in currently available computer languages. It
3327 is believed that the writing, testing, and modification
3328 of codes for solving large-scale linear programs will
3329 be a less formidable undertaking once MPL becomes
3330 available. It is hoped that by the Fall of 1968, work
3331 on a compiler for MPL will be well underway.",
3332 acknowledgement = ack-nhfb,
3333 pdfpages = "92",
3334 }
3335
3336 @TechReport{Bjorck:1968:IRL,
3337 author = "{\AA}ke Bj{\"o}rck and Gene H. Golub",
3338 title = "Iterative refinements of linear least squares
3339 solutions by {Householder} transformations",
3340 type = "Technical Report",
3341 number = "STAN-CS-68-83 (AD664237)",
3342 institution = inst-STAN-CS,
3343 address = inst-STAN-CS:adr,
3344 pages = "i + 28",
3345 day = "19",
3346 month = jan,
3347 year = "1968",
3348 bibdate = "Thu Nov 06 17:24:15 2025",
3349 bibsource = "https://www.math.utah.edu/pub/bibnet/authors/g/golub-gene-h.bib;
3350 https://www.math.utah.edu/pub/bibnet/authors/h/householder-alston-s.bib;
3351 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
3352 URL = "http://i.stanford.edu/TR/CS-TR-68-83.html",
3353 abstract = "An algorithm is presented in ALGOL for iteratively
3354 refining the solution to a linear least squares problem
3355 with linear constraints. Numerical results presented
3356 show that a high degree of accuracy is obtained.",
3357 acknowledgement = ack-nhfb,
3358 author-dates = "Gene Howard Golub (February 29, 1932--November 16,
3359 2007)",
3360 pdfpages = "29",
3361 xxnumber = "CS-TR-68-83",
3362 xxtitle = "Iterative Refinements of Linear Squares Solutions by
3363 {Householder} Transformations",
3364 }
3365
3366 @TechReport{Friedman:1968:CST,
3367 author = "Joyce Friedman",
3368 title = "A Computer System for Transformational Grammar",
3369 type = "Technical Report",
3370 number = "CS-TR-68-84 (AD692680)",
3371 institution = inst-STAN-CS,
3372 address = inst-STAN-CS:adr,
3373 pages = "31",
3374 month = jan,
3375 year = "1968",
3376 bibdate = "Fri Nov 7 07:11:14 MST 2025",
3377 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
3378 URL = "http://i.stanford.edu/TR/CS-TR-68-84.html",
3379 abstract = "A comprehensive system for transformational grammar
3380 has been designed and is being implemented on the IBM
3381 360/67 computer. The system deals with the
3382 transformational model of syntax, along the lines of
3383 Chomsky's `Aspects of the Theory of Syntax.' The major
3384 innovations include a full and formal description of
3385 the syntax of a transformational grammar, a directed
3386 random phrase structure generator, a lexical insertion
3387 algorithm, and a simple problem-oriented programming
3388 language in which the algorithm for application of
3389 transformations can be expressed. In this paper we
3390 present the system as a whole, first discussing the
3391 philosophy underlying the development of the system,
3392 then outlining the system and discussing its more
3393 important special features. References are given to
3394 papers which consider particular aspects of the system
3395 in detail.",
3396 acknowledgement = ack-nhfb,
3397 pdfpages = "35",
3398 xxnumber = "STAN-CS-68-84 (AD692680)",
3399 }
3400
3401 @TechReport{Bauer:1968:AW,
3402 author = "Henry R. Bauer and Sheldon I. Becker and Susan L.
3403 Graham",
3404 title = "{ALGOL W}",
3405 type = "Technical Report",
3406 number = "CS-TR-68-86",
3407 institution = inst-STAN-CS,
3408 address = inst-STAN-CS:adr,
3409 pages = "??",
3410 month = jan,
3411 year = "1968",
3412 bibdate = "Fri Nov 7 07:11:14 MST 2025",
3413 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
3414 URL = "http://i.stanford.edu/TR/CS-TR-68-86.html",
3415 abstract = "The textbook `Introduction to Algol' by Baumann,
3416 Feliciano, Bauer, and Samelson describes the
3417 internationally recognized language ALGOL 60 for
3418 algorithm communication. ALGOL W can be viewed as an
3419 extension of ALGOL. This document consists of (1)
3420 `Algol W Notes for Introductory Computer Science
3421 Courses' [by Henry R. Bauer, Sheldon Becker, and Susan
3422 L. Graham] which describes the differences between
3423 ALGOL 60 and ALGOL W and presents the new features of
3424 ALGOL W; (2) `Deck Set-Up'; (3) `Algol W Language
3425 Description' [by Henry R. Bauer, Sheldon Becker, and
3426 Susan L. Graham], a complete syntactic and semantic
3427 description of the language; (4) `Unit Record
3428 Equipment'; and (5) `Error Message.'",
3429 acknowledgement = ack-nhfb,
3430 pdfpages = "116",
3431 }
3432
3433 @TechReport{Ehrman:1968:CLN,
3434 author = "John R. Ehrman",
3435 title = "{CS139} lecture notes. {Part I}: {Sections} 1 thru 21.
3436 {Preliminary} version",
3437 type = "Technical Report",
3438 number = "CS-TR-68-87",
3439 institution = inst-STAN-CS,
3440 address = inst-STAN-CS:adr,
3441 pages = "??",
3442 month = "????",
3443 year = "1968",
3444 bibdate = "Fri Nov 7 07:11:14 MST 2025",
3445 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
3446 URL = "http://i.stanford.edu/TR/CS-TR-68-87.html",
3447 abstract = "These notes are meant to provide an introduction to
3448 the IBM System/360 which will help the reader to
3449 understand and to make effective use of the
3450 capabilities of both the machinery and some of its
3451 associated service programs. They are largely
3452 self-contained, and in general the reader should need
3453 to make only occasional reference to the `System/360
3454 Principles of Operation' manual (IBM File No. S360-01,
3455 Form A22-6821) and to the `Operating System/360
3456 Assembler Language' manual (IBM File No. S360-21, Form
3457 C28-6514).",
3458 acknowledgement = ack-nhfb,
3459 pdfpages = "202",
3460 }
3461
3462 @TechReport{Schechter:1968:RMC,
3463 author = "Samuel Schechter",
3464 title = "Relaxation methods for convex problems",
3465 type = "Technical Report",
3466 number = "CS-TR-68-88",
3467 institution = inst-STAN-CS,
3468 address = inst-STAN-CS:adr,
3469 pages = "??",
3470 month = feb,
3471 year = "1968",
3472 bibdate = "Fri Nov 7 07:11:14 MST 2025",
3473 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
3474 URL = "http://i.stanford.edu/TR/CS-TR-68-88.html",
3475 abstract = "Extensions and simplifications are made for
3476 convergence proofs of relaxation methods for nonlinear
3477 systems arising from the minimization of strictly
3478 convex functions. This work extends these methods to
3479 group relaxation, which includes an extrapolated form
3480 of Newton's method, for various orderings. A relatively
3481 simple proof is given for cyclic orderings, sometimes
3482 referred to as nonlinear overrelaxation, and for
3483 residual orderings where an error estimate is given. A
3484 less restrictive choice of relaxation parameter is
3485 obtained than that previously. Applications are
3486 indicated primarily to the solution of nonlinear
3487 elliptic boundary problems.",
3488 acknowledgement = ack-nhfb,
3489 pdfpages = "20",
3490 }
3491
3492 @TechReport{Bauer:1968:AWR,
3493 author = "Henry R. Bauer and Sheldon I. Becker and Susan L.
3494 Graham and George E. Forsythe and Edwin H.
3495 Satterthwaite",
3496 title = "{ALGOL W} (revised)",
3497 type = "Technical Report",
3498 number = "CS-TR-68-89",
3499 institution = inst-STAN-CS,
3500 address = inst-STAN-CS:adr,
3501 pages = "i + 124",
3502 month = mar,
3503 year = "1968",
3504 bibdate = "Fri Nov 7 07:11:14 MST 2025",
3505 bibsource = "https://www.math.utah.edu/pub/bibnet/authors/f/forsythe-george-elmer.bib;
3506 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
3507 URL = "http://i.stanford.edu/TR/CS-TR-68-89.html",
3508 abstract = "The textbook ``\booktitle{Introduction to Algol}' by
3509 Baumann, Feliciano, Bauer, and Samelson describes the
3510 internationally recognized language ALGOL 60 for
3511 algorithm communication. ALGOL W can be viewed as an
3512 extension of ALGOL. This document consists of (1)
3513 ``Algol W Deck Set-Up'' [by E. H. Satterthwaite, Jr.];
3514 (2) ``Algol W Language Description'' [by Henry R.
3515 Bauer, Sheldon Becker, and Susan L. Graham], a complete
3516 syntactic and semantic description of the language; (3)
3517 ``Algol W Error Messages'' [by Henry R. Bauer, Sheldon
3518 Becker, and Susan L. Graham]; (4) ``Algol W Notes for
3519 Introductory Computer Science Courses'' [by Henry R.
3520 Bauer, Sheldon Becker, and Susan L. Graham] which
3521 describes the differences tween ALGOL 60 and ALGOL W
3522 and presents the new features of ALGOL W; and (5)
3523 ``Notes on Number Representation on System/360 and
3524 relations to Algol W'' [by George E. Forsythe].",
3525 acknowledgement = ack-nhfb,
3526 author-dates = "George Elmer Forsythe (8 January 1917--9 April 1972)",
3527 pdfpages = "125",
3528 }
3529
3530 @TechReport{Lesser:1968:MLC,
3531 author = "Victor R. Lesser",
3532 title = "A multi-level computer organization designed to
3533 separate data-accessing from the computation",
3534 type = "Technical Report",
3535 number = "CS-TR-68-90",
3536 institution = inst-STAN-CS,
3537 address = inst-STAN-CS:adr,
3538 pages = "??",
3539 month = mar,
3540 year = "1968",
3541 bibdate = "Fri Nov 7 07:11:14 MST 2025",
3542 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
3543 URL = "http://i.stanford.edu/TR/CS-TR-68-90.html",
3544 abstract = "The computer organization to be described in this
3545 paper has been developed to overcome the inflexibility
3546 of computers designed around a few fixed data
3547 structures, and only binary operations. This has been
3548 accomplished by separating the data-accessing
3549 procedures from the computational algorithm. By this
3550 separation, a new and different language may be used to
3551 express data-accessing procedures. The new language has
3552 been designed to allow the programmer to define the
3553 procedures for generating the names of the operands for
3554 each computation, and locating the value of an operand
3555 given its name.",
3556 acknowledgement = ack-nhfb,
3557 pdfpages = "23",
3558 }
3559
3560 @TechReport{Wirth:1968:PS,
3561 author = "Niklaus Wirth and Joseph W. {Wells, Jr.} and Edwin H.
3562 {Satterthwaite, Jr.}",
3563 title = "The {PL360} system",
3564 type = "Technical Report",
3565 number = "CS-TR-68-91",
3566 institution = inst-STAN-CS,
3567 address = inst-STAN-CS:adr,
3568 pages = "viii + 89",
3569 day = "1",
3570 month = apr,
3571 year = "1968",
3572 bibdate = "Fri Nov 7 07:11:14 MST 2025",
3573 bibsource = "https://www.math.utah.edu/pub/bibnet/authors/w/wirth-niklaus.bib;
3574 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
3575 URL = "http://i.stanford.edu/pub/cstr/reports/cs/tr/68/91/CS-TR-68-91.pdf;
3576 http://i.stanford.edu/TR/CS-TR-68-91.html",
3577 abstract = "This report describes the use of two operating systems
3578 which serve as environments for the PL360 language
3579 defined in the companion report CS 53 [1]. Some
3580 additions to that language, not described in CS 53, are
3581 documented in the Appendix. One of the systems is a
3582 stand-alone, self-loading program specifically designed
3583 for PL360; the other is a subsystem operating under
3584 IBM's Operating System/360 (0S). With the 2 minor
3585 exceptions noted in Chapter 5, these two systems were
3586 designed to be entirely compatible at the source
3587 language level.",
3588 abstract-2 = "This report describes the use of two operating systems
3589 which serve as environments for the PL360 language
3590 defined in the companion report [Niklaus Wirth, `A
3591 Programming Language for the 360 Computers,' Stanford
3592 University Computer Science Department report CS 53
3593 (revised), June 1967]. Some additions to that language,
3594 not described in CS 53, are documented in the
3595 Appendix.",
3596 acknowledgement = ack-nhfb,
3597 author-dates = "Niklaus Wirth (15 February 1934--1 January 2024)",
3598 pdfpages = "102",
3599 }
3600
3601 @TechReport{Enea:1968:M,
3602 author = "Horace J. Enea",
3603 title = "{MLISP}",
3604 type = "Technical Report",
3605 number = "CS-TR-68-92 (PB178078)",
3606 institution = inst-STAN-CS,
3607 address = inst-STAN-CS:adr,
3608 pages = "??",
3609 month = mar,
3610 year = "1968",
3611 bibdate = "Fri Nov 7 07:11:14 MST 2025",
3612 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
3613 URL = "http://i.stanford.edu/TR/CS-TR-68-92.html",
3614 abstract = "Mlisp is an Algol-like list processing language based
3615 on Lisp 1.5. It is currently implemented on the IBM
3616 360/67 at the Stanford Computation Center, and is being
3617 implemented on the DEC PDP-6 at the Stanford Artificial
3618 Intelligence Project. The balance of this paper is a
3619 very informal presentation of the language so that the
3620 reader will be able to run programs in Mlisp with a
3621 minimum of effort. The language has an extremely simple
3622 syntax which is presented in Appendix I.",
3623 acknowledgement = ack-nhfb,
3624 pdfpages = "20",
3625 remark = "No PDF in NTRL archive. Same NTIS number as
3626 STAN-CS-68-93: no PDF file available to resolve
3627 confusion.",
3628 }
3629
3630 @TechReport{Forsythe:1968:CSE,
3631 author = "G. E. Forsythe",
3632 title = "Computer Science and Education",
3633 type = "Technical Report",
3634 number = "STAN-CS-68-93 (PB178078)",
3635 institution = inst-STAN-CS,
3636 address = inst-STAN-CS:adr,
3637 pages = "50",
3638 month = mar,
3639 year = "1968",
3640 bibdate = "Fri Nov 21 14:21:14 2025",
3641 bibsource = "https://www.math.utah.edu/pub/bibnet/authors/f/forsythe-george-elmer.bib;
3642 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
3643 URL = "",
3644 acknowledgement = ack-nhfb,
3645 author-dates = "George Elmer Forsythe (8 January 1917--9 April 1972)",
3646 remark = "Same NTIS number as STAN-CS-68-92: no PDF file
3647 available to resolve confusion.",
3648 }
3649
3650 @TechReport{Shaw:1968:FDP,
3651 author = "A. C. Shaw",
3652 title = "The Formal Description and Parsing of Pictures",
3653 type = "Technical Report",
3654 number = "STAN-CS-68-94 (SLACR-84)",
3655 institution = inst-STAN-CS,
3656 address = inst-STAN-CS:adr,
3657 pages = "205",
3658 month = apr,
3659 year = "1968",
3660 bibdate = "Fri Nov 21 14:21:14 2025",
3661 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
3662 URL = "",
3663 acknowledgement = ack-nhfb,
3664 remark = "This is the author's thesis.",
3665 }
3666
3667 @TechReport{Friedman:1968:FST,
3668 author = "Joyce Friedman and Robert W. Doran",
3669 title = "A formal syntax for transformational grammar",
3670 type = "Technical Report",
3671 number = "CS-TR-68-95",
3672 institution = inst-STAN-CS,
3673 address = inst-STAN-CS:adr,
3674 pages = "??",
3675 month = mar,
3676 year = "1968",
3677 bibdate = "Fri Nov 7 07:11:14 MST 2025",
3678 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
3679 URL = "http://i.stanford.edu/TR/CS-TR-68-95.html",
3680 abstract = "A formal definition of the syntax of a
3681 transformational grammar is given using a modified
3682 Backus Naur Form as the metalanguage. Syntax
3683 constraints and interpretation are added in English.
3684 The underlying model is that presented by Chomsky in
3685 `Aspects of the Theory of Syntax.' Definitions are
3686 given for the basic concepts of tree, analysis,
3687 restriction, complex symbol, and structural change, as
3688 well as for the major components of a transformational
3689 grammar, phrase structure, lexicon, and
3690 transformations. The syntax was developed as a
3691 specification of input formats for the computer system
3692 for transformational grammar described in [Joyce
3693 Friedman, `A Computer System for Transformational
3694 Grammar,' Stanford University Computer Science
3695 Department report CS-84, January 1968]. It includes as
3696 a subcase a fairly standard treatment of
3697 transformational grammar, but has been generalized in
3698 many respects.",
3699 acknowledgement = ack-nhfb,
3700 pdfpages = "51",
3701 }
3702
3703 @TechReport{Smith:1968:IAD,
3704 author = "Lyle B. Smith",
3705 title = "Interval arithmetic determinant evaluation and its use
3706 in testing for a {Chebyshev} system",
3707 type = "Technical Report",
3708 number = "CS-TR-68-96",
3709 institution = inst-STAN-CS,
3710 address = inst-STAN-CS:adr,
3711 pages = "??",
3712 month = apr,
3713 year = "1968",
3714 bibdate = "Fri Nov 7 07:11:14 MST 2025",
3715 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
3716 URL = "http://i.stanford.edu/TR/CS-TR-68-96.html",
3717 abstract = "Two recent papers by Hansen and by Hansen and R. R.
3718 Smith have shown how interval arithmetic (I.A.) can be
3719 used effectively to bound errors in matrix
3720 computations. This paper compares a method proposed by
3721 Hansen and R. R. Smith to straight-forward use of I.A.
3722 in determinant evaluation. Computational results show
3723 what accuracy and running times can be expected when
3724 using I.A. for determinant evaluation. An application
3725 using I.A. determinants in a program to test a set of
3726 functions to see if they form a Chebyshev system is
3727 then presented.",
3728 acknowledgement = ack-nhfb,
3729 keywords = "interval arithmetic",
3730 pdfpages = "27",
3731 }
3732
3733 @TechReport{Miller:1968:RCS,
3734 author = "W. F. Miller",
3735 title = "Research in the {Computer Science Department at
3736 Stanford University}",
3737 type = "Technical Report",
3738 number = "STAN-CS-68-97",
3739 institution = inst-STAN-CS,
3740 address = inst-STAN-CS:adr,
3741 pages = "49",
3742 month = apr,
3743 year = "1968",
3744 bibdate = "Fri Nov 21 14:21:14 2025",
3745 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
3746 URL = "",
3747 acknowledgement = ack-nhfb,
3748 }
3749
3750 @TechReport{Bauer:1968:AWI,
3751 author = "Henry R. Bauer and Sheldon I. Becker and Susan L.
3752 Graham",
3753 title = "{ALGOL W} implementation",
3754 type = "Technical Report",
3755 number = "CS-TR-68-98",
3756 institution = inst-STAN-CS,
3757 address = inst-STAN-CS:adr,
3758 pages = "??",
3759 month = may,
3760 year = "1968",
3761 bibdate = "Fri Nov 7 07:11:14 MST 2025",
3762 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
3763 URL = "http://i.stanford.edu/TR/CS-TR-68-98.html",
3764 abstract = "In writing a compiler of a new language (ALGOL W) for
3765 a new machine (IBM System/360) we were forced to deal
3766 with many unforeseen problems in addition to the
3767 problems we expected to encounter. This report
3768 describes the final version of the compiler. The
3769 implemented language ALGOL W is based on the
3770 Wirth/Hoare proposal for a successor to ALGOL 60. The
3771 major differences from that proposal are in string
3772 definition and operations and in complex number
3773 representation.",
3774 acknowledgement = ack-nhfb,
3775 pdfpages = "153",
3776 }
3777
3778 @TechReport{Friedman:1968:LNF,
3779 author = "Joyce Friedman",
3780 title = "Lecture Notes on Foundations for Computer Science",
3781 type = "Technical Report",
3782 number = "STAN-CS-68-99 (PB179057)",
3783 institution = inst-STAN-CS,
3784 address = inst-STAN-CS:adr,
3785 pages = "212",
3786 month = jun,
3787 year = "1968",
3788 bibdate = "Fri Nov 21 14:21:14 2025",
3789 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
3790 URL = "",
3791 acknowledgement = ack-nhfb,
3792 }
3793
3794 @TechReport{Kaplan:1968:FTA,
3795 author = "D. M. Kaplan",
3796 title = "The Formal Theoretic Analysis of Stront Equivalence
3797 for Elemental Programs",
3798 type = "Technical Report",
3799 number = "STAN-CS-68-101 (AIM-60, AD672923)",
3800 institution = inst-STAN-CS,
3801 address = inst-STAN-CS:adr,
3802 pages = "263",
3803 month = jun,
3804 year = "1968",
3805 bibdate = "Fri Nov 21 14:21:14 2025",
3806 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
3807 URL = "",
3808 acknowledgement = ack-nhfb,
3809 pdfpages = "278",
3810 remark = "This is the author's thesis.",
3811 }
3812
3813 @TechReport{Bartels:1968:NIS,
3814 author = "Richard H. Bartels",
3815 title = "A Numerical Investigation of the Simplex Method",
3816 type = "Technical Report",
3817 number = "STAN-CS-68-104 (AD673010)",
3818 institution = inst-STAN-CS,
3819 address = inst-STAN-CS:adr,
3820 pages = "iv + 118",
3821 day = "31",
3822 month = jul,
3823 year = "1968",
3824 bibdate = "Fri Nov 21 14:21:14 2025",
3825 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
3826 URL = "https://apps.dtic.mil/sti/pdfs/AD0673010.pdf",
3827 abstract = "This report analyzes the behavior of the round-off
3828 errors associated with three different computer
3829 implementations of the simplex method of linear
3830 programming. One of the three Is representative of
3831 computer implementations in common use, and it is shown
3832 that the standard method of updating the basic-matrix
3833 inverse is numerically unstable. The remaining two
3834 implementations are suggested by the author and use
3835 triangular decompositions of the basic matrix or
3836 substitutes for its inverse. The implementations are
3837 shown to be stable, and one of them is shown to be
3838 competitive in speed with the standard simplex-method
3839 computer implementations. Error bounds which may be
3840 calculated from intermediate results are developed for
3841 each of the three implementations, and their use during
3842 computation for error monitoring and control is
3843 discussed",
3844 acknowledgement = ack-nhfb,
3845 advisor = "Gene H. Golub",
3846 pdfpages = "123",
3847 remark = "This is the author's thesis. No PDF in NTRL archive,
3848 and no abstract in thesis. The abstract in the
3849 backmatter seems to be added later.",
3850 }
3851
3852 @TechReport{Richman:1968:EC,
3853 author = "Paul Lawrence Richman",
3854 title = "Epsilon-Calculus",
3855 type = "Technical Report",
3856 number = "STAN-CS-68-105 (AD673674)",
3857 institution = inst-STAN-CS,
3858 address = inst-STAN-CS:adr,
3859 pages = "vii + 138",
3860 day = "16",
3861 month = aug,
3862 year = "1968",
3863 bibdate = "Fri Nov 21 14:21:14 2025",
3864 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
3865 URL = "",
3866 abstract = "We use recursive function theory to lay the basis for
3867 a partially constructive theory of calculus, which we
3868 call {\em the $ \epsilon $-calculus}. This theory
3869 differs from other theories that have grown out of
3870 recursive function theory in that\par
3871
3872 (1) it is directly related to the variable-precision
3873 computations used in scientific computation today,
3874 and\par
3875
3876 (2) it deals explicitly with intermediate results
3877 rather than ideal answers.\par
3878
3879 As $ \epsilon \to 0$, intermediate results in the $
3880 \epsilon $-calculus approach their corresponding
3881 answers in the calculus. Thus we say ``the $ \epsilon
3882 $-calculus approaches the calculus, as $ \epsilon \to
3883 0$.'' It is hoped that investigations in the $ \epsilon
3884 $-calculus will lead to a better understanding of
3885 numerical analysis. Several new results in this
3886 direction are presented, concerning instability and
3887 also machine numbers. Discrete notions of limit,
3888 convergence, continuity, arithmetic, derivative and
3889 integral are also presented and analyzed.",
3890 acknowledgement = ack-nhfb,
3891 pdfpages = "153",
3892 remark = "This is the author's thesis.",
3893 }
3894
3895 @TechReport{Huberman:1968:PPC,
3896 author = "Barbara Jane Huberman",
3897 title = "A Program to Play Chess End Games",
3898 type = "Technical Report",
3899 number = "STAN-CS-68-106 (AIM-65, AD673971)",
3900 institution = inst-STAN-CS,
3901 address = inst-STAN-CS:adr,
3902 pages = "168",
3903 day = "19",
3904 month = aug,
3905 year = "1968",
3906 bibdate = "Fri Nov 21 14:21:14 2025",
3907 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
3908 URL = "",
3909 acknowledgement = ack-nhfb,
3910 pdfpages = "180",
3911 remark = "This is the author's thesis.",
3912 }
3913
3914 @TechReport{Friedman:1968:CET,
3915 author = "Joyce Friedman",
3916 title = "Computer Experiments in Transformational Grammar",
3917 type = "Technical Report",
3918 number = "STAN-CS-68-108 (AD692681)",
3919 institution = inst-STAN-CS,
3920 address = inst-STAN-CS:adr,
3921 pages = "36",
3922 month = aug,
3923 year = "1968",
3924 bibdate = "Fri Nov 21 14:21:14 2025",
3925 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
3926 URL = "",
3927 acknowledgement = ack-nhfb,
3928 remark = "No PDF in NTRL archive.",
3929 }
3930
3931 @TechReport{Bauer:1969:AWR,
3932 author = "Henry R. Bauer and Sheldon I. Becker and Susan L.
3933 Graham and Robert W. Floyd and George E. Forsythe and
3934 Edwin H. Satterthwaite",
3935 title = "{ALGOL W} (revised)",
3936 type = "Technical Report",
3937 number = "CS-TR-68-110",
3938 institution = inst-STAN-CS,
3939 address = inst-STAN-CS:adr,
3940 pages = "??",
3941 month = sep,
3942 year = "1969",
3943 bibdate = "Fri Nov 7 07:11:14 MST 2025",
3944 bibsource = "https://www.math.utah.edu/pub/bibnet/authors/f/forsythe-george-elmer.bib;
3945 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
3946 URL = "http://i.stanford.edu/TR/CS-TR-68-110.html;
3947 https://bitsavers.org/pdf/stanford/cs_techReports/CS110_ALGOL_W_Revised_Sep69.pdf",
3948 abstract = "``\booktitle{A Contribution to the Development of
3949 ALGOL}'' by Niklaus Wirth and C. A. R. Hoare [Comm.
3950 ACM, v.9, no. 6 (June 1966), pp. 413-431] was the basis
3951 for a compiler developed for the IBM 360 at Stanford
3952 University. This report is a description of the
3953 implemented language, ALGOL W. Historical background
3954 and the goals of the language may be found in the Wirth
3955 and Hoare paper.",
3956 acknowledgement = ack-nhfb,
3957 author-dates = "Robert W. Floyd (8 June 1936--25 September 2001);
3958 George Elmer Forsythe (8 January 1917--9 April 1972)",
3959 pdfpages = "112",
3960 tableofcontents = "ALGOL W Language Description / Henry R. Bauer,
3961 Sheldon Becker, Susan L. Graham, Edwin Satterthwaite /
3962 1--65 \\
3963 ALGOL W / Henry R. Bauer, Sheldon Becker, Susan L.
3964 Graham / Error Messages / 66--75 \\
3965 Notes on Number Representation on System/360 and
3966 Relations to ALGOL W / George E. Forsythe / 76--89 \\
3967 ALGOL W Deck Set-Up / 90--91 \\
3968 Grammatical Description of ALGOL W / R. Floyd /
3969 92--103",
3970 }
3971
3972 @TechReport{Hansen:1969:ISM,
3973 author = "Wildred J. Hansen",
3974 title = "The impact of storage management on plex processing
3975 language implementation",
3976 type = "Technical Report",
3977 number = "CS-TR-69-113",
3978 institution = inst-STAN-CS,
3979 address = inst-STAN-CS:adr,
3980 pages = "??",
3981 month = jul,
3982 year = "1969",
3983 bibdate = "Fri Nov 7 07:11:14 MST 2025",
3984 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
3985 URL = "http://i.stanford.edu/TR/CS-TR-68-113.html",
3986 abstract = "A plex processing system is implemented within a set
3987 of environments whose relationships are vital to the
3988 system's time/space efficiency: Data Environment Stack
3989 Structures Data Structures Subroutine Environment
3990 Routine Linkage Variable Binding Storage Management
3991 Environment Memory Organization for Allocation Storage
3992 Control This paper discusses these environments and
3993 their relationships in detail. For each environment
3994 there is some discussion of alternative implementation
3995 techniques, the dependence of the implementation on the
3996 hardware, and the dependence of the environment on the
3997 language design. In particular, two language features
3998 are shown to affect substantially the environment
3999 design: variable length plexes and 'release' of active
4000 plexes. Storage management is complicated by the
4001 requirement for variable length plexes, but they can
4002 substantially reduce memory requirements. If inactive
4003 plexes are released, a garbage collector can be
4004 avoided; but considerable tedious programming may be
4005 required to maintain the status of each plex. Many plex
4006 processing systems store numbers in strange formats and
4007 compile arithmetic operations as subroutine calls, thus
4008 handicapping the computer on the only operations it
4009 does well. Careful coordination of the system
4010 environments can permit direct numeric computation,
4011 that is, a single instruction for each arithmetic
4012 operation. This paper considers with each environment,
4013 the requirements for direct numeric computation. To
4014 explore the techniques discussed, a collection of
4015 environments called Swym was implemented. This system
4016 permits variable length plexes and compact lists. The
4017 latter is a list representation requiring less space
4018 than chained lists because pointers to the elements are
4019 stored in consecutive words. In Swym, a list can be
4020 partly compact and partly chained. The garbage
4021 collector converts chained lists into compact lists
4022 when possible. Swym has careful provision for direct
4023 numeric computation, but no compiler has been built. To
4024 illustrate Swym, an interpreter was implemented for a
4025 small language similar to LISP 1.5. Details of Swym and
4026 the language are in a series of appendices.",
4027 acknowledgement = ack-nhfb,
4028 pdfpages = "282",
4029 }
4030
4031 @TechReport{Satterthwaite:1969:MEP,
4032 author = "Edwin H. Satterthwaite",
4033 title = "{MUTANT 0.5}: an experimental programming language",
4034 type = "Technical Report",
4035 number = "CS-TR-69-120",
4036 institution = inst-STAN-CS,
4037 address = inst-STAN-CS:adr,
4038 pages = "??",
4039 month = feb,
4040 year = "1969",
4041 bibdate = "Fri Nov 7 07:11:14 MST 2025",
4042 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
4043 URL = "http://i.stanford.edu/TR/CS-TR-69-120.html",
4044 abstract = "A programming language which continues the extension
4045 and simplification of ALGOL 60 in the direction
4046 suggested by EULER is defined and described. Techniques
4047 used in an experimental implementation of that
4048 language, called MUTANT 0.5, are briefly summarized.
4049 The final section of this report is an attempt to
4050 assess the potential value of the approach to
4051 procedural programming language design exemplified by
4052 MUTANT 0.5. Implementation and use of the experimental
4053 system have indicated a sufficient number of conceptual
4054 and practical problems to suggest that the general
4055 approach is of limited value; however, a number of
4056 specific features were found to be convenient, useful,
4057 and adaptable to other philosophies of language
4058 design.",
4059 acknowledgement = ack-nhfb,
4060 pdfpages = "63",
4061 }
4062
4063 @TechReport{Moler:1969:ABE,
4064 author = "Cleve B. Moler",
4065 title = "Accurate bounds for the eigenvalues of the {Laplacian}
4066 and applications to rhombical domains",
4067 type = "Technical Report",
4068 number = "CS-TR-69-121",
4069 institution = inst-STAN-CS,
4070 address = inst-STAN-CS:adr,
4071 pages = "i + 17",
4072 day = "19",
4073 month = feb,
4074 year = "1969",
4075 bibdate = "Fri Nov 7 07:11:14 MST 2025",
4076 bibsource = "https://www.math.utah.edu/pub/bibnet/authors/m/moler-cleve-b.bib;
4077 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
4078 URL = "http://i.stanford.edu/TR/CS-TR-69-121.html",
4079 abstract = "We deal with the eigenvalues and eigenfunctions of
4080 Laplace's differential operator on a bounded
4081 two-dimensional domain G with zero values on the
4082 boundary. The paper describes a new technique for
4083 determining the coefficients in the expansion of an
4084 eigenfunction in terms of particular eigenfunctions of
4085 the differential operator. The coefficients are chosen
4086 to make the sum of the expansion come close to
4087 satisfying the boundary conditions. As an example, the
4088 eigenvalues and eigenfunctions are determined for a
4089 rhombical membrane.",
4090 acknowledgement = ack-nhfb,
4091 pdfpages = "18",
4092 }
4093
4094 @TechReport{Mitchell:1969:HAN,
4095 author = "William C. Mitchell and Douglas L. McCraith",
4096 title = "Heuristic analysis of numerical variants of the
4097 {Gram--Schmidt} orthonormalization process",
4098 type = "Technical Report",
4099 number = "CS-TR-69-122",
4100 institution = inst-STAN-CS,
4101 address = inst-STAN-CS:adr,
4102 pages = "??",
4103 month = feb,
4104 year = "1969",
4105 bibdate = "Fri Nov 7 07:11:14 MST 2025",
4106 bibsource = "https://www.math.utah.edu/pub/bibnet/authors/r/rice-john-r.bib;
4107 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
4108 URL = "http://i.stanford.edu/TR/CS-TR-69-122.html",
4109 abstract = "The Gram--Schmidt orthonormalization process is a
4110 fundamental formula of analysis which is notoriously
4111 unstable computationally. This report provides a
4112 heuristic analysis of the process, which shows why the
4113 method is unstable. Formulas are derived which describe
4114 the propagation of round-off error through the process.
4115 These formulas are supported by numerical experiments.
4116 These formulas are then applied to a computational
4117 variant of a basic method proposed by John R. Rice, and
4118 this method is shown to offer significant improvement
4119 over the basic algorithm. This finding is also
4120 supported by numerical experiment. The formulas for the
4121 error propagation are then used to produce a linear
4122 corrector for the basic Gram--Schmidt process, which
4123 shows significant improvement over both previous
4124 methods, but at the cost of slightly more
4125 computations.",
4126 acknowledgement = ack-nhfb,
4127 pdfpages = "24",
4128 }
4129
4130 @TechReport{Brent:1969:EEP,
4131 author = "R. P. Brent",
4132 title = "Empirical Evidence for a Proposed Distribution of
4133 Small Prime Gaps",
4134 type = "Technical Report",
4135 number = "STAN-CS-69-123 (AD696982)",
4136 institution = inst-STAN-CS,
4137 address = inst-STAN-CS:adr,
4138 pages = "ii + 18",
4139 day = "28",
4140 month = feb,
4141 year = "1969",
4142 bibdate = "Fri Nov 21 14:21:14 2025",
4143 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
4144 URL = "",
4145 acknowledgement = ack-nhfb,
4146 pdfpages = "22",
4147 }
4148
4149 @TechReport{Golub:1969:MDS,
4150 author = "Gene H. Golub",
4151 title = "Matrix decompositions and statistical calculations",
4152 type = "Technical Report",
4153 number = "STAN-CS-69-124 (AD687719)",
4154 institution = inst-STAN-CS,
4155 address = inst-STAN-CS:adr,
4156 pages = "52",
4157 month = mar,
4158 year = "1969",
4159 bibdate = "Fri Nov 7 07:11:14 MST 2025",
4160 bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Theory/Matrix.bib;
4161 https://www.math.utah.edu/pub/bibnet/authors/g/golub-gene-h.bib;
4162 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
4163 URL = "http://i.stanford.edu/TR/CS-TR-69-124.html",
4164 abstract = "Several matrix decompositions which are of some
4165 interest in statistical calculations are presented. An
4166 accurate method for calculating the canonical
4167 correlation is given.",
4168 acknowledgement = ack-nhfb,
4169 author-dates = "Gene Howard Golub (February 29, 1932--November 16,
4170 2007)",
4171 keywords = "stat, nla, lsq, qrd, svd",
4172 pdfpages = "52",
4173 xxnumber = "CS-TR-69-124",
4174 }
4175
4176 @TechReport{Feldman:1969:GCI,
4177 author = "Jerome A. Feldman and James Gips and James J. Horning
4178 and Stephen Reder",
4179 title = "Grammatical complexity and inference",
4180 type = "Technical Report",
4181 number = "CS-TR-69-125",
4182 institution = inst-STAN-CS,
4183 address = inst-STAN-CS:adr,
4184 pages = "??",
4185 month = jun,
4186 year = "1969",
4187 bibdate = "Fri Nov 7 07:11:14 MST 2025",
4188 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
4189 URL = "http://i.stanford.edu/TR/CS-TR-69-125.html",
4190 abstract = "The problem of inferring a grammar for a set of symbol
4191 strings is considered and a number of new decidability
4192 results obtained. Several notions of grammatical
4193 complexity and their properties are studied. The
4194 question of learning the least complex grammar for a
4195 set of strings is investigated leading to a variety of
4196 positive and negative results. This work is part of a
4197 continuing effort to study the problems of
4198 representation and generalization through the
4199 grammatical inference question. Appendices A and B and
4200 Section 2a.0 are primarily the work of Reder, Sections
4201 2b and 3d of Horning, Section 4 and Appendix C of Gips,
4202 and the remainder the responsibility of Feldman.",
4203 acknowledgement = ack-nhfb,
4204 pdfpages = "110",
4205 }
4206
4207 @TechReport{Dantzig:1969:CST,
4208 author = "George B. Dantzig",
4209 title = "Complementary spanning trees",
4210 type = "Technical Report",
4211 number = "CS-TR-69-126",
4212 institution = inst-STAN-CS,
4213 address = inst-STAN-CS:adr,
4214 pages = "??",
4215 month = mar,
4216 year = "1969",
4217 bibdate = "Fri Nov 7 07:11:14 MST 2025",
4218 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
4219 URL = "http://i.stanford.edu/TR/CS-TR-69-126.html",
4220 abstract = "Given a network G whose arcs partition into
4221 non-overlapping 'clubs' (sets) $ R_i $, D. Ray
4222 Fulkerson has considered the problem of constructing a
4223 spanning tree such that no two of its arcs belong to
4224 (represent) the same club and has stated necessary and
4225 sufficient conditions for such trees to exist. When
4226 each club $ R_i $ consists of exactly two arcs, we
4227 shall refer to each of the arc pair as the 'complement'
4228 of the other, and the representative tree as a
4229 complementary tree. Our objective is to prove the
4230 following theorem: If there exists one complementary
4231 tree, there exists at least two.",
4232 acknowledgement = ack-nhfb,
4233 pdfpages = "12",
4234 }
4235
4236 @TechReport{Vicens:1969:ASR,
4237 author = "Pierre Vicens",
4238 title = "Aspects of Speech Recognition by Computer",
4239 type = "Technical Report",
4240 number = "STAN-CS-69-127 (AIM-85, AD687720)",
4241 institution = inst-STAN-CS,
4242 address = inst-STAN-CS:adr,
4243 pages = "210",
4244 month = apr,
4245 year = "1969",
4246 bibdate = "Fri Nov 21 14:21:14 2025",
4247 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
4248 URL = "",
4249 acknowledgement = ack-nhfb,
4250 remark = "This is the author's thesis.",
4251 }
4252
4253 @TechReport{Buzbee:1969:MOE,
4254 author = "B. L. Buzbee and Gene H. Golub and C. W. Nielson",
4255 title = "The method of odd\slash even reduction and
4256 factorization with application to {Poisson}'s
4257 equation",
4258 type = "Technical Report",
4259 number = "STAN-CS-69-128 (AD687717)",
4260 institution = inst-STAN-CS,
4261 address = inst-STAN-CS:adr,
4262 pages = "iii + 37",
4263 month = apr,
4264 year = "1969",
4265 bibdate = "Fri Nov 7 07:11:14 MST 2025",
4266 bibsource = "https://www.math.utah.edu/pub/bibnet/authors/g/golub-gene-h.bib;
4267 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
4268 URL = "http://i.stanford.edu/TR/CS-TR-69-128.html",
4269 abstract = "Several algorithms are presented for solving block
4270 tridiagonal systems of linear algebraic equations when
4271 the matrices on the diagonal are equal to each other
4272 and the matrices on the subdiagonals are all equal to
4273 each other. It is shown that these matrices arise from
4274 the finite difference approximation to certain elliptic
4275 partial differential equations on rectangular regions.
4276 Generalizations are derived for higher order equations
4277 and non-rectangular regions.",
4278 acknowledgement = ack-nhfb,
4279 author-dates = "Gene Howard Golub (February 29, 1932--November 16,
4280 2007)",
4281 pdfpages = "40",
4282 xxnumber = "CS-TR-69-128",
4283 }
4284
4285 @TechReport{Miller:1969:RCS,
4286 author = "William F. Miller",
4287 title = "Research in the {Computer Science Department, Stanford
4288 University}",
4289 type = "Technical Report",
4290 number = "CS-TR-69-129",
4291 institution = inst-STAN-CS,
4292 address = inst-STAN-CS:adr,
4293 pages = "??",
4294 month = apr,
4295 year = "1969",
4296 bibdate = "Fri Nov 7 07:11:14 MST 2025",
4297 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
4298 URL = "http://i.stanford.edu/TR/CS-TR-69-129.html",
4299 abstract = "The research program of the Computer Science
4300 Department can perhaps be best summarized in terms of
4301 its research projects. The chart on the following page
4302 lists the projects and the participation by faculty and
4303 students. Two observations should be made to complete
4304 the picture. Within the Artificial Intelligence
4305 Project, the Stanford Computation Center, the SLAC
4306 Computation Group, and the INFO project, there are a
4307 large number of highly competent professional computer
4308 scientists who add greatly to the total capability of
4309 the campus. Also, there are a number of projects in
4310 other schools or departments which are making
4311 significant contributions to computer science. These,
4312 too, add to the total computer environment. Summarized
4313 by Professor W. F. Miller.",
4314 acknowledgement = ack-nhfb,
4315 pdfpages = "87",
4316 }
4317
4318 @TechReport{Schank:1969:CDR,
4319 author = "R. C. Schank",
4320 title = "A Conceptual Dependency Representation for a
4321 Computer-Oriented Semantics",
4322 type = "Technical Report",
4323 number = "STAN-CS-69-130 (AIM-83, PB183907)",
4324 institution = inst-STAN-CS,
4325 address = inst-STAN-CS:adr,
4326 pages = "201",
4327 month = mar,
4328 year = "1969",
4329 bibdate = "Fri Nov 21 14:21:14 2025",
4330 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
4331 URL = "",
4332 acknowledgement = ack-nhfb,
4333 remark = "This is the author's thesis. No PDF in NTRL archive.",
4334 remark = "Check: one reference dates this as January 1970. Not
4335 found in DTIC or NTRL archives.",
4336 }
4337
4338 @TechReport{Smith:1969:UMM,
4339 author = "L. B. Smith",
4340 title = "The Use of Man--Machine Interaction in Data-Fitting
4341 Problems",
4342 type = "Technical Report",
4343 number = "STAN-CS-69-131 (SLAC-96)",
4344 institution = inst-STAN-CS,
4345 address = inst-STAN-CS:adr,
4346 pages = "287",
4347 month = mar,
4348 year = "1969",
4349 bibdate = "Fri Nov 21 14:21:14 2025",
4350 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
4351 URL = "",
4352 acknowledgement = ack-nhfb,
4353 remark = "This is the author's thesis. No PDF in NTRL archive.",
4354 }
4355
4356 @TechReport{Anonymous:1969:NP,
4357 author = "Anonymous",
4358 title = "{NEVER PRINTED}",
4359 type = "Technical Report",
4360 number = "STAN-CS-69-132",
4361 institution = inst-STAN-CS,
4362 address = inst-STAN-CS:adr,
4363 pages = "??",
4364 month = "????",
4365 year = "1969",
4366 bibdate = "Fri Nov 21 14:21:14 2025",
4367 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
4368 URL = "",
4369 acknowledgement = ack-nhfb,
4370 }
4371
4372 @TechReport{Golub:1969:HSL,
4373 author = "Gene H. Golub and Christian H. Reinsch",
4374 title = "Handbook Series Linear Algebra: Singular Value
4375 Decompositions and Least Squares Solutions",
4376 type = "Technical Report",
4377 number = "STAN-CS-69-133 (AD687718)",
4378 institution = inst-STAN-CS,
4379 address = inst-STAN-CS:adr,
4380 pages = "ii + 38",
4381 month = may,
4382 year = "1969",
4383 bibdate = "Fri Nov 21 14:21:14 2025",
4384 bibsource = "https://www.math.utah.edu/pub/bibnet/authors/g/golub-gene-h.bib;
4385 https://www.math.utah.edu/pub/bibnet/authors/r/reinsch-christian-h.bib;
4386 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
4387 URL = "",
4388 acknowledgement = ack-nhfb,
4389 author-dates = "Gene Howard Golub (February 29, 1932--November 16,
4390 2007); Christian H. Reinsch (?? ?? 1932--8 October
4391 2022)",
4392 pdfpages = "42",
4393 }
4394
4395 @TechReport{Golub:1969:LLS,
4396 author = "Gene H. Golub and Michael A. Saunders",
4397 title = "Linear least squares and quadratic programming",
4398 type = "Technical Report",
4399 number = "STAN-CS-69-134 (AD700923)",
4400 institution = inst-STAN-CS,
4401 address = inst-STAN-CS:adr,
4402 pages = "35",
4403 month = may,
4404 year = "1969",
4405 bibdate = "Fri Nov 7 07:11:14 MST 2025",
4406 bibsource = "https://www.math.utah.edu/pub/bibnet/authors/g/golub-gene-h.bib;
4407 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
4408 URL = "http://i.stanford.edu/TR/CS-TR-69-134.html",
4409 abstract = "Several algorithms are presented for solving linear
4410 least squares problems; the basic tool is
4411 orthogonalization techniques. A highly accurate
4412 algorithm is presented for solving least squares
4413 problems with linear inequality constraints. A method
4414 is also given for finding the least squares solution
4415 when there is a quadratic constraint on the solution.",
4416 acknowledgement = ack-nhfb,
4417 author-dates = "Gene Howard Golub (February 29, 1932--November 16,
4418 2007)",
4419 pdfpages = "38",
4420 xxnumber = "CS-TR-69-134",
4421 }
4422
4423 @TechReport{Gries:1969:CCI,
4424 author = "David Gries",
4425 title = "{CIL}: {Compiler Implementation Language}",
4426 type = "Technical Report",
4427 number = "STAN-CS-69-135 (SLACR-102)",
4428 institution = inst-STAN-CS,
4429 address = inst-STAN-CS:adr,
4430 pages = "??",
4431 month = may,
4432 year = "1969",
4433 bibdate = "Fri Nov 7 07:11:14 MST 2025",
4434 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
4435 URL = "http://i.stanford.edu/TR/CS-TR-69-135.html",
4436 abstract = "This report is a manual for the proposed Compiler
4437 Implementation Language, CIL. It is not an expository
4438 paper on the subject of compiler writing or
4439 compiler-compilers. The language definition may change
4440 as work progresses on the project.",
4441 acknowledgement = ack-nhfb,
4442 pdfpages = "124",
4443 xxnumber = "CS-TR-69-135",
4444 }
4445
4446 @TechReport{Pohl:1969:BDH,
4447 author = "I. Pohl",
4448 title = "Bi-Directional and Heuristic Search in Path Problems",
4449 type = "Technical Report",
4450 number = "STAN-CS-69-136 (SLACR-104)",
4451 institution = inst-STAN-CS,
4452 address = inst-STAN-CS:adr,
4453 pages = "157",
4454 month = may,
4455 year = "1969",
4456 bibdate = "Fri Nov 21 14:21:14 2025",
4457 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
4458 URL = "",
4459 acknowledgement = ack-nhfb,
4460 remark = "This is the author's thesis.",
4461 }
4462
4463 @TechReport{Henrici:1969:FPA,
4464 author = "Peter Henrici",
4465 title = "Fixed points of analytic functions",
4466 type = "Technical Report",
4467 number = "CS-TR-69-137",
4468 institution = inst-STAN-CS,
4469 address = inst-STAN-CS:adr,
4470 pages = "iii + 5",
4471 month = jul,
4472 year = "1969",
4473 bibdate = "Thu Nov 06 15:42:03 2025",
4474 bibsource = "https://www.math.utah.edu/pub/bibnet/authors/h/henrici-peter.bib;
4475 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
4476 URL = "http://i.stanford.edu/TR/CS-TR-69-137.html",
4477 abstract = "A continuous mapping of a simply connected, closed,
4478 bounded set of the Euclidean plane into itself is known
4479 to have at least one fixed point. It is shown that the
4480 usual condition for the fixed point to be unique, and
4481 for convergence of the iteration sequence to the fixed
4482 point, can be relaxed if the mapping is defined by an
4483 analytic function of a complex variable.",
4484 acknowledgement = ack-nhfb,
4485 author-dates = "Peter Karl Henrici (13 September 1923--13 March
4486 1987)",
4487 pdfpages = "8",
4488 }
4489
4490 @TechReport{Green:1969:ATP,
4491 author = "Cordell C. Green",
4492 title = "The Application of Theorem Proving to
4493 Question-Answering Systems",
4494 type = "Technical Report",
4495 number = "STAN-CS-69-138 (AIM-96, AD696394)",
4496 institution = inst-STAN-CS,
4497 address = inst-STAN-CS:adr,
4498 pages = "162",
4499 month = jun,
4500 year = "1969",
4501 bibdate = "Fri Nov 21 14:21:14 2025",
4502 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
4503 URL = "",
4504 acknowledgement = ack-nhfb,
4505 pdfpages = "168",
4506 remark = "This is the author's thesis.",
4507 }
4508
4509 @TechReport{Horning:1969:SGI,
4510 author = "James Jay Horning",
4511 title = "A Study of Grammatical Inference",
4512 type = "Technical Report",
4513 number = "STAN-CS-69-139 (AIM-98, AD695401)",
4514 institution = inst-STAN-CS,
4515 address = inst-STAN-CS:adr,
4516 pages = "166",
4517 month = aug,
4518 year = "1969",
4519 bibdate = "Fri Nov 21 14:21:14 2025",
4520 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
4521 URL = "",
4522 acknowledgement = ack-nhfb,
4523 pdfpages = "177",
4524 remark = "This is the author's thesis.",
4525 }
4526
4527 @TechReport{Forsythe:1969:DTN,
4528 author = "George E. Forsythe",
4529 title = "Design --- Then and Now",
4530 type = "Technical Report",
4531 number = "STAN-CS-69-140 (AD698799)",
4532 institution = inst-STAN-CS,
4533 address = inst-STAN-CS:adr,
4534 pages = "ii + 14",
4535 month = sep,
4536 year = "1969",
4537 bibdate = "Fri Nov 21 14:21:14 2025",
4538 bibsource = "https://www.math.utah.edu/pub/bibnet/authors/f/forsythe-george-elmer.bib;
4539 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
4540 URL = "",
4541 acknowledgement = ack-nhfb,
4542 author-dates = "George Elmer Forsythe (8 January 1917--9 April 1972)",
4543 pdfpages = "19",
4544 }
4545
4546 @TechReport{Dahlquist:1969:BEL,
4547 author = "Germund Dahlquist and Stanley C. Eisenstat and Gene H.
4548 Golub",
4549 title = "Bounds for the error of linear systems of equations
4550 using the theory of moments",
4551 type = "Technical Report",
4552 number = "STAN-CS-69-141 (PB188542)",
4553 institution = inst-STAN-CS,
4554 address = inst-STAN-CS:adr,
4555 pages = "??",
4556 month = oct,
4557 year = "1969",
4558 bibdate = "Fri Nov 7 07:11:14 MST 2025",
4559 bibsource = "https://www.math.utah.edu/pub/bibnet/authors/g/golub-gene-h.bib;
4560 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
4561 URL = "http://i.stanford.edu/TR/CS-TR-69-141.html",
4562 abstract = "Consider the system of linear equations $ A \underset
4563 ~ \to x = \underset ~ \to b $ where A is an $ n \times
4564 n $ real symmetric, positive definite matrix and $
4565 \underset \to b $ is a known vector. Suppose we are
4566 given an approximation to $ \underset ~ \to x $, $
4567 \underset ~ \to \xi $, and we wish to determine upper
4568 and lower bounds for $ \Vert \underset ~ \to x \ -
4569 \underset ~ \to \xi \Vert $ where $ \Vert \ldots {}
4570 \Vert $ indicates the Euclidean norm. Given the
4571 sequence of vectors $ {\{ {\underset \to r}_i \} }^k_{i
4572 = 0} $ where $ {\underset ~ \to r}_i \ = A{\underset ~
4573 \to r}_{i - 1} $ and $ {\underset ~ \to r}_o \ =
4574 \underset ~ \to b - A \underset ~ \to \xi $, it is
4575 shown how to construct a sequence of upper and lower
4576 bounds for $ \Vert \underset ~ \to x \ - \underset ~
4577 \to \xi \Vert $ using the theory of moments. In
4578 addition, consider the Jacobi algorithm for solving the
4579 system $ \underset ~ \to x \ = M \underset ~ \to x +
4580 \underset ~ \to b \underline {viz.} {\underset ~ \to
4581 x}_{i + 1} = M{\underset \to x}_i + \underset ~ \to b
4582 $. It is shown that by examining $ {\underset ~ \to
4583 \delta }_i \ = {\underset ~ \to x}_{i + 1} - {\underset
4584 ~ \to x}_i $, it is possible to construct upper and
4585 lower bounds for $ \Vert {\underset \to x}_i -
4586 \underset ~ \to x \Vert $.",
4587 acknowledgement = ack-nhfb,
4588 author-dates = "Gene Howard Golub (February 29, 1932--November 16,
4589 2007); Germund Dahlquist (16 January 1925--8 February
4590 2005)",
4591 pdfpages = "29",
4592 xxnumber = "CS-TR-69-141",
4593 }
4594
4595 @TechReport{Golub:1969:SVR,
4596 author = "Gene H. Golub and Richard R. Underwood",
4597 title = "Stationary Values of the Ratio of Quadratic Forms
4598 Subject to Linear Constraints",
4599 type = "Technical Report",
4600 number = "STAN-CS-69-142",
4601 institution = inst-STAN-CS,
4602 address = inst-STAN-CS:adr,
4603 pages = "22",
4604 month = nov,
4605 year = "1969",
4606 bibdate = "Fri Nov 7 07:11:14 MST 2025",
4607 bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Theory/Matrix.bib;
4608 https://www.math.utah.edu/pub/bibnet/authors/g/golub-gene-h.bib;
4609 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
4610 note = "Cited in {\AA}ke Bj{\"o}rck's bibliography on least
4611 squares, which is available by anonymous ftp from {\tt
4612 math.liu.se} in {\tt pub/references}.",
4613 URL = "http://i.stanford.edu/TR/CS-TR-69-142.html",
4614 abstract = "Let $A$ be a real symmetric matrix of order $n$, $B$ a
4615 real symmetric positive definite matrix of order $n$,
4616 and $C$ an $ n \times p$ matrix of rank $r$ with $ r
4617 \leq p < n$. We wish to determine vectors $ \underset ~
4618 \to x $ for which $ {\underset ~ \to x}^T \ A \underset
4619 ~ \to x \ / {\underset \to x}^T \ B \underset ~ \to x $
4620 is stationary and $ C^T \underset ~ \to x \ = \underset
4621 ~ \to \Theta $, the null vector. An algorithm is given
4622 for generating a symmetric eigensystem whose
4623 eigenvalues are the stationary values and for
4624 determining the vectors $ \underset ~ \to x $. Several
4625 Algol procedures are included.",
4626 acknowledgement = ack-nhfb,
4627 author-dates = "Gene Howard Golub (February 29, 1932--November 16,
4628 2007)",
4629 keywords = "nla, geig, regularization",
4630 pdfpages = "24",
4631 xxnumber = "CS-TR-69-142",
4632 }
4633
4634 @TechReport{Jenkins:1969:TSV,
4635 author = "M. A. Jenkins",
4636 title = "Three-Stage Variable-Shift for the Solution of
4637 Polynomial Equations with a Posteriori Error Bounds for
4638 the Zeros",
4639 type = "Technical Report",
4640 number = "STAN-CS-69-143 (AD694464)",
4641 institution = inst-STAN-CS,
4642 address = inst-STAN-CS:adr,
4643 pages = "199",
4644 month = aug,
4645 year = "1969",
4646 bibdate = "Fri Nov 21 14:21:14 2025",
4647 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
4648 URL = "",
4649 acknowledgement = ack-nhfb,
4650 pdfpages = "204",
4651 remark = "This is the author's thesis. This has also been
4652 printed incorrectly as STAN-CS-69-138. No PDF in NTRL
4653 archive.",
4654 }
4655
4656 @TechReport{Forsythe:1969:MMP,
4657 author = "George E. Forsythe",
4658 title = "The maximum and minimum of a positive definite
4659 quadratic polynomial on a sphere are convex functions
4660 of the radius",
4661 type = "Technical Report",
4662 number = "CS-TR-69-144",
4663 institution = inst-STAN-CS,
4664 address = inst-STAN-CS:adr,
4665 pages = "iii + 7",
4666 month = jul,
4667 year = "1969",
4668 bibdate = "Fri Nov 7 07:11:14 MST 2025",
4669 bibsource = "https://www.math.utah.edu/pub/bibnet/authors/f/forsythe-george-elmer.bib;
4670 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
4671 URL = "http://i.stanford.edu/TR/CS-TR-69-144.html",
4672 abstract = "It is proved that in Euclidean $n$-space the maximum $
4673 M(\rho) $ and minimum $ m(\rho) $ of a fixed positive
4674 definite quadratic polynomial $Q$ on spheres with fixed
4675 center are both convex functions of the radius $ \rho $
4676 of the sphere. In the proof, which uses elementary
4677 calculus and a result of Forsythe and Golub, $ m(\rho)$
4678 and $ M(\rho)$ are shown to exist and lie in the
4679 interval $ [2 \lambda_1, 2 \lambda_n]$, where $
4680 \lambda_i$ are the eigenvalues of the quadratic form of
4681 $Q$. Hence $ m''(\rho) > 0$ and $ M''(\rho) > 0$.",
4682 acknowledgement = ack-nhfb,
4683 author-dates = "George Elmer Forsythe (8 January 1917--9 April 1972)",
4684 pdfpages = "10",
4685 }
4686
4687 @TechReport{Henrici:1969:MSS,
4688 author = "Peter Henrici",
4689 title = "Methods of search for solving polynomial equations",
4690 type = "Technical Report",
4691 number = "CS-TR-69-145",
4692 institution = inst-STAN-CS,
4693 address = inst-STAN-CS:adr,
4694 pages = "iii + 23",
4695 month = dec,
4696 year = "1969",
4697 bibdate = "Thu Nov 06 15:46:55 2025",
4698 bibsource = "https://www.math.utah.edu/pub/bibnet/authors/h/henrici-peter.bib;
4699 https://www.math.utah.edu/pub/bibnet/authors/l/lehmer-derrick-henry.bib;
4700 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
4701 note = "Dedicated to D. H. Lehmer on his 65th birthday.",
4702 URL = "http://i.stanford.edu/TR/CS-TR-69-145.html",
4703 abstract = "The problem of determining a zero of a given
4704 polynomial with guaranteed error bounds, using an
4705 amount of work that can be estimated a priori, is
4706 attacked here by means of a class of algorithms based
4707 on the idea of systematic search. Lehmer's ``machine
4708 method'' for solving polynomial equations is a special
4709 case. The use of the Schur--Cohn algorithm in Lehmer's
4710 method is replaced by a more general proximity test
4711 which reacts positively if applied at a point close to
4712 a zero of a polynomial. Various such tests are
4713 described, and the work involved in their use is
4714 estimated. The optimality and non-optimality of certain
4715 methods, both on a deterministic and on a probabilistic
4716 basis, are established.",
4717 acknowledgement = ack-nhfb,
4718 author-dates = "Peter Karl Henrici (13 September 1923--13 March
4719 1987)",
4720 pdfpages = "26",
4721 }
4722
4723 @TechReport{Ramos:1970:REA,
4724 author = "George U. Ramos",
4725 title = "Roundoff error analysis of the {Fast Fourier
4726 Transform}",
4727 type = "Technical Report",
4728 number = "STAN-CS-70-146",
4729 institution = inst-STAN-CS,
4730 address = inst-STAN-CS:adr,
4731 pages = "ii + 29",
4732 month = feb,
4733 year = "1970",
4734 bibdate = "Fri Nov 7 07:00:05 MST 2025",
4735 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
4736 URL = "http://i.stanford.edu/TR/CS-TR-70-146.html",
4737 abstract = "This paper presents an analysis of roundoff errors
4738 occurring in the floating-point computation of the fast
4739 Fourier transform. Upper bounds are derived for the
4740 ratios of the root-mean-square (RMS) and maximum
4741 roundoff errors in the output data to the RMS value of
4742 the input data for both single and multidimensional
4743 transformations. These bounds are compared
4744 experimentally with actual roundoff errors.",
4745 acknowledgement = ack-nhfb,
4746 pdfpages = "31",
4747 xxnumber = "CS-TR-70-146",
4748 }
4749
4750 @TechReport{Forsythe:1970:PCW,
4751 author = "George E. Forsythe",
4752 title = "Pitfalls in Computation, or Why a Math Book Isn't
4753 Enough",
4754 type = "Technical Report",
4755 number = "STAN-CS-70-147 (AD699897)",
4756 institution = inst-STAN-CS,
4757 address = inst-STAN-CS:adr,
4758 pages = "iv + 43",
4759 month = jan,
4760 year = "1970",
4761 bibdate = "Fri Jan 12 06:07:12 2024",
4762 bibsource = "https://www.math.utah.edu/pub/bibnet/authors/f/forsythe-george-elmer.bib;
4763 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
4764 URL = "http://i.stanford.edu/pub/cstr/reports/cs/tr/70/147/CS-TR-70-147.pdf;
4765 http://i.stanford.edu/TR/CS-TR-70-147.html;
4766 https://apps.dtic.mil/sti/pdfs/AD0699897.pdf",
4767 abstract = "The floating-point number system is contrasted with
4768 the real numbers. The author then illustrates the
4769 variety of computational pitfalls a person can fall
4770 into who merely translates information gained from pure
4771 mathematics courses into computer programs. Examples
4772 include summing a Taylor series, solving a quadratic
4773 equation, solving linear algebraic systems, solving
4774 ordinary and partial differential equations, and
4775 finding polynomial zeros. It is concluded that
4776 mathematics courses should be taught with a greater
4777 awareness of automatic computation.",
4778 acknowledgement = ack-nhfb,
4779 author-dates = "George Elmer Forsythe (8 January 1917--9 April 1972)",
4780 pdfpages = "54",
4781 xxnumber = "CS-TR-70-147",
4782 }
4783
4784 @TechReport{Knuth:1970:NAG,
4785 author = "Donald E. Knuth and Robert W. Floyd",
4786 title = "Notes on avoiding `go to' statements",
4787 type = "Technical Report",
4788 number = "STAN-CS-70-148 (PB188749)",
4789 institution = inst-STAN-CS,
4790 address = inst-STAN-CS:adr,
4791 pages = "ii + 15",
4792 month = jan,
4793 year = "1970",
4794 DOI = "https://doi.org/10.1016/0020-0190(71)90018-4;
4795 https://doi.org/10.1016/0020-0190(72)90054-3",
4796 bibdate = "Thu Jan 11 16:32:28 2024",
4797 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
4798 URL = "https://bitsavers.org/pdf/stanford/cs_techReports/STAN-CS-70-148_Notes_on_Avoiding_GO_TO_Statements_Jan1970.pdf",
4799 abstract = "During the last decade there has been a growing
4800 sentiment that the use of `go to' statements is
4801 undesirable, or actually harmful. This attitude is
4802 apparently inspired by the idea that programs expressed
4803 solely in terms of conventional iterative constructions
4804 (`for', `while', etc.) are more readable and more
4805 easily proved correct. In this note we will make a few
4806 exploratory observations about the use and disuse of go
4807 to statements, based on two typical programming
4808 examples (from `symbol table searching' and
4809 `backtracking').",
4810 acknowledgement = ack-nhfb,
4811 author-dates = "Robert W. Floyd (8 June 1936--25 September 2001)",
4812 pdfpages = "17",
4813 remark = "Published in \booktitle{Information Processing
4814 Letters}, {\bf 1}(1) 23--31, February 1971,
4815 doi:10.1016/0020-0190(71)90018-4, and erratum {\bf
4816 1}(4) 177, June 1972,
4817 doi:/10.1016/0020-0190(72)90054-3.",
4818 xxnumber = "CS-TR-70-148",
4819 }
4820
4821 @TechReport{Knuth:1970:OBS,
4822 author = "Donald E. Knuth",
4823 title = "Optimum Binary Search Trees",
4824 type = "Technical Report",
4825 number = "STAN-CS-70-149 (PB188748)",
4826 institution = inst-STAN-CS,
4827 address = inst-STAN-CS:adr,
4828 pages = "19",
4829 month = jan,
4830 year = "1970",
4831 bibdate = "Fri Nov 21 14:21:14 2025",
4832 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
4833 URL = "",
4834 acknowledgement = ack-nhfb,
4835 remark = "No PDF in NTRL archive. Published in \booktitle{Acta
4836 Informatica}, {\bf 1} 14--25, 270 (1971).",
4837 }
4838
4839 @TechReport{Wilkinson:1970:EPW,
4840 author = "James H. Wilkinson",
4841 title = "Elementary Proof of the {Wielandt--Hoffman} Theorem
4842 and of its Generalization",
4843 type = "Technical Report",
4844 number = "STAN-CS-70-150 (AD699898)",
4845 institution = inst-STAN-CS,
4846 address = inst-STAN-CS:adr,
4847 pages = "??",
4848 month = jan,
4849 year = "1970",
4850 bibdate = "Fri Nov 7 07:00:05 MST 2025",
4851 bibsource = "https://www.math.utah.edu/pub/bibnet/authors/w/wilkinson-james-hardy.bib;
4852 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
4853 URL = "http://i.stanford.edu/TR/CS-TR-70-150.html",
4854 abstract = "An elementary proof is given of the Wielandt--Hoffman
4855 Theorem for normal matrices and of a generalization of
4856 this theorem. The proof makes no direct appeal to
4857 results from linear-programming theory.",
4858 acknowledgement = ack-nhfb,
4859 author-dates = "James H. Wilkinson (27 September 1919--5 October
4860 1986)",
4861 pdfpages = "10",
4862 xxnumber = "CS-TR-70-150",
4863 }
4864
4865 @TechReport{Volkov:1970:PDS,
4866 author = "E. A. Volkov and George E. Forsythe",
4867 title = "`{{\booktitle{On the Properties of the Derivatives of
4868 the Solutions of Laplace's Equation and the Errors of
4869 the Method of Finite Differences for Boundary Values in
4870 $ C_2 $ and $ C_{1, 1} $}}' by E. A. Volkov}",
4871 type = "Technical Report",
4872 number = "STAN-CS-70-151",
4873 institution = inst-STAN-CS,
4874 address = inst-STAN-CS:adr,
4875 pages = "??",
4876 month = jan,
4877 year = "1970",
4878 bibdate = "Fri Nov 7 07:00:05 MST 2025",
4879 bibsource = "https://www.math.utah.edu/pub/bibnet/authors/f/forsythe-george-elmer.bib;
4880 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
4881 URL = "http://i.stanford.edu/TR/CS-TR-70-151.html",
4882 abstract = "If a function $u$ is harmonic in a circular disk and
4883 its boundary values are twice continuously
4884 differentiable, $u$ need not have bounded second
4885 derivatives in the open disk. For the Dirichlet problem
4886 for Laplace's equation in a more general
4887 two-dimensional region the discretization error of the
4888 ordinary method of finite differences is studied, when
4889 Collatz's method of linear interpolation is used at the
4890 boundary. If the boundary of the region has a tangent
4891 line whose angle satisfies a Lipschitz condition, and
4892 if the boundary values have a first derivative
4893 satisfying a Lipschitz condition, then the
4894 discretization error is shown to be of order $ h^2 \ln
4895 h^{-1} $. This bound is shown to be sharp. By a
4896 different method of interpolation at the boundary one
4897 can improve the bound to $ o(h^2) $. There are other
4898 similar results. Translated by G. E. Forsythe.",
4899 acknowledgement = ack-nhfb,
4900 author-dates = "George Elmer Forsythe (8 January 1917--9 April 1972)",
4901 pdfpages = "28",
4902 xxnumber = "CS-TR-70-151",
4903 }
4904
4905 @TechReport{Gustafson:1970:RCI,
4906 author = "Sven-{\AA}ke Gustafson",
4907 title = "Rapid Computation of Interpolation Formulae and
4908 Mechanical Quadrature Rules",
4909 type = "Technical Report",
4910 number = "STAN-CS-70-152",
4911 institution = inst-STAN-CS,
4912 address = inst-STAN-CS:adr,
4913 pages = "23",
4914 month = feb,
4915 year = "1970",
4916 bibdate = "Fri Nov 21 14:21:14 2025",
4917 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
4918 URL = "",
4919 acknowledgement = ack-nhfb,
4920 }
4921
4922 @TechReport{Gustafson:1970:EPU,
4923 author = "Sven-{\AA}ke Gustafson",
4924 title = "Error Propagation by Use of Interpolation Formulae and
4925 Quadrature Rules which are Computed Numerically",
4926 type = "Technical Report",
4927 number = "STAN-CS-70-153 (AD701358)",
4928 institution = inst-STAN-CS,
4929 address = inst-STAN-CS:adr,
4930 pages = "ii + 17",
4931 month = feb,
4932 year = "1970",
4933 bibdate = "Fri Nov 21 14:21:14 2025",
4934 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
4935 URL = "",
4936 abstract = "Approximate rules for evaluating linear functionals
4937 are often obtained by requiring that the rule shall
4938 give exact value for a certain linear class of
4939 functions. The parameters of the rule appear hence as
4940 the solution of a system of equations. exactly but only
4941 ``numerically''. This can generally not be solved
4942 Sometimes large errors occur in the parameters defining
4943 the rule, but the resultant error in the computed value
4944 of the functional is small. In the present paper we
4945 shall develop efficient methods of computing a strict
4946 bound for this error in the case when the parameters of
4947 the rule are determined from a linear system of
4948 equations.",
4949 acknowledgement = ack-nhfb,
4950 pdfpages = "23",
4951 }
4952
4953 @TechReport{Stone:1970:SID,
4954 author = "H. S. Stone",
4955 title = "The Spectrum of Incorrectly Decoded Bursts for Cyclic
4956 Error Codes",
4957 type = "Technical Report",
4958 number = "STAN-CS-70-154",
4959 institution = inst-STAN-CS,
4960 address = inst-STAN-CS:adr,
4961 pages = "24",
4962 month = feb,
4963 year = "1970",
4964 bibdate = "Fri Nov 21 14:21:14 2025",
4965 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
4966 URL = "",
4967 acknowledgement = ack-nhfb,
4968 }
4969
4970 @TechReport{Buzbee:1970:MOE,
4971 author = "B. L. Buzbee and Gene H. Golub and C. W. Nielson",
4972 title = "The method of odd\slash even reduction and
4973 factorization with application to {Poisson}'s equation,
4974 part {II}",
4975 type = "Technical Report",
4976 number = "STAN-CS-70-155 (AD705508)",
4977 institution = inst-STAN-CS,
4978 address = inst-STAN-CS:adr,
4979 pages = "36",
4980 month = mar,
4981 year = "1970",
4982 bibdate = "Fri Nov 7 07:00:05 MST 2025",
4983 bibsource = "https://www.math.utah.edu/pub/bibnet/authors/g/golub-gene-h.bib;
4984 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
4985 URL = "http://i.stanford.edu/TR/CS-TR-70-155.html",
4986 abstract = "In this paper, we derive and generalize the methods of
4987 Buneman for solving elliptic partial difference
4988 equations in a rectangular region. We show why the
4989 Buneman methods lead to numerically accurate solutions
4990 whereas the CORF algorithm may be numerically unstable.
4991 Several numerical examples are given and discussed.",
4992 acknowledgement = ack-nhfb,
4993 author-dates = "Gene Howard Golub (February 29, 1932--November 16,
4994 2007)",
4995 pdfpages = "37",
4996 xxnumber = "CS-TR-70-155",
4997 }
4998
4999 @TechReport{Dantzig:1970:MCR,
5000 author = "George B. Dantzig",
5001 title = "On a model for computing round-off error of a sum",
5002 type = "Technical Report",
5003 number = "STAN-CS-70-156 (AD713972)",
5004 institution = inst-STAN-CS,
5005 address = inst-STAN-CS:adr,
5006 pages = "??",
5007 month = mar,
5008 year = "1970",
5009 bibdate = "Fri Nov 7 07:00:05 MST 2025",
5010 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
5011 URL = "http://i.stanford.edu/TR/CS-TR-70-156.html",
5012 acknowledgement = ack-nhfb,
5013 pdfpages = "7",
5014 remark = "No abstract is available.",
5015 xxnumber = "CS-TR-70-156",
5016 }
5017
5018 @TechReport{Brent:1970:AMM,
5019 author = "Richard P. Brent",
5020 title = "Algorithms for matrix multiplication",
5021 type = "Technical Report",
5022 number = "STAN-CS-70-157 (AD705509)",
5023 institution = inst-STAN-CS,
5024 address = inst-STAN-CS:adr,
5025 pages = "??",
5026 month = mar,
5027 year = "1970",
5028 bibdate = "Fri Nov 7 07:00:05 MST 2025",
5029 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
5030 URL = "http://i.stanford.edu/TR/CS-TR-70-157.html",
5031 abstract = "Strassen's and Winograd's algorithms for matrix
5032 multiplication are investigated and compared with the
5033 normal algorithm. Floating-point error bounds are
5034 obtained, and it is shown that scaling is essential for
5035 numerical accuracy using Winograd's method. In
5036 practical cases Winograd's method appears to be
5037 slightly faster than the other two methods, but the
5038 gain is, at most, about 20\%. Finally, an attempt to
5039 generalize Strassen's method is described.",
5040 acknowledgement = ack-nhfb,
5041 pdfpages = "55",
5042 xxnumber = "CS-TR-70-157",
5043 }
5044
5045 @TechReport{Stone:1970:PPP,
5046 author = "H. Stone",
5047 title = "Parallel Processing with the Perfect Shuffle",
5048 type = "Technical Report",
5049 number = "STAN-CS-70-158",
5050 institution = inst-STAN-CS,
5051 address = inst-STAN-CS:adr,
5052 pages = "36",
5053 month = mar,
5054 year = "1970",
5055 bibdate = "Fri Nov 21 14:21:14 2025",
5056 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
5057 URL = "",
5058 acknowledgement = ack-nhfb,
5059 }
5060
5061 @TechReport{George:1970:UDM,
5062 author = "John Alan George",
5063 title = "The use of direct methods for the solution of the
5064 discrete {Poisson} equation on non-rectangular
5065 regions",
5066 type = "Technical Report",
5067 number = "STAN-CS-70-159 (AD708690)",
5068 institution = inst-STAN-CS,
5069 address = inst-STAN-CS:adr,
5070 pages = "??",
5071 month = jun,
5072 year = "1970",
5073 bibdate = "Fri Nov 7 07:00:05 MST 2025",
5074 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
5075 URL = "http://i.stanford.edu/TR/CS-TR-70-159.html",
5076 abstract = "Some direct and iterative schemes are presented for
5077 solving a standard finite-difference scheme for
5078 Poisson's equation on a two-dimensional bounded region
5079 R with Dirichlet conditions specified on the boundary $
5080 \delta $R. These procedures make use of special-purpose
5081 direct methods for solving rectangular Poisson
5082 problems. The region is imbedded in a rectangle and a
5083 uniform mesh is superimposed on it. The usual
5084 five-point Poisson difference operator is applied over
5085 the whole rectangle, yielding a block-tridiagonal
5086 system of equations. The original problem, however,
5087 determines only the elements of the right-hand side
5088 which correspond to grid points lying within $ \delta
5089 $R; the remaining elements can be treated as
5090 parameters. The iterative algorithms construct a
5091 sequence of right-hand sides in such a way that the
5092 corresponding sequence of solutions on the rectangle
5093 converges to the solution of the imbedded problem.",
5094 acknowledgement = ack-nhfb,
5095 pdfpages = "26",
5096 xxnumber = "CS-TR-70-159",
5097 }
5098
5099 @TechReport{Bredt:1970:MPC,
5100 author = "Thomas H. Bredt and Edward J. McCluskey",
5101 title = "A model for parallel computer systems",
5102 type = "Technical Report",
5103 number = "STAN-CS-70-160 (CSL-TR-5, AD707762)",
5104 institution = inst-STAN-CS,
5105 address = inst-STAN-CS:adr,
5106 pages = "??",
5107 month = apr,
5108 year = "1970",
5109 bibdate = "Fri Nov 7 07:00:05 MST 2025",
5110 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
5111 URL = "http://i.stanford.edu/TR/CS-TR-70-160.html",
5112 abstract = "A flow table model is defined for parallel computer
5113 systems. In this model, fundamental-mode flow tables
5114 are used to describe the operation of system
5115 componenets, which may be programs or circuits.
5116 Components communicate by changing the values on
5117 interconnecting lines which carry binary level signals.
5118 It is assumed that there is no bound on the time for
5119 value changes to propagate over the interconnecting
5120 lines. Given this delay assumption, it is necessary to
5121 specify a mode of operation for system components such
5122 that input changes which arrive while a component is
5123 unstable do not affect the operation of the component.
5124 Such a mode of operation is specified. Using the flow
5125 table model, a new control algorithm for the
5126 two-process mutual exclusion problem is designed. This
5127 algorithm does not depend on the exclusive execution of
5128 any primitive operations used in its implementation. A
5129 circuit implementation of the control algorithm is
5130 described.",
5131 acknowledgement = ack-nhfb,
5132 pdfpages = "66",
5133 xxnumber = "CS-TR-70-160",
5134 }
5135
5136 @TechReport{Hoffman:1970:FMA,
5137 author = "L. J. Hoffman",
5138 title = "The Formulary Model for Access Control and Privacy in
5139 Computer Systems",
5140 type = "Technical Report",
5141 number = "STAN-CS-70-161 (SLACR-117, UC-32)",
5142 institution = inst-STAN-CS,
5143 address = inst-STAN-CS:adr,
5144 pages = "81",
5145 month = may,
5146 year = "1970",
5147 bibdate = "Fri Nov 21 14:21:14 2025",
5148 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
5149 URL = "",
5150 acknowledgement = ack-nhfb,
5151 remark = "This is the author's Ph.D. thesis.",
5152 }
5153
5154 @TechReport{Bartels:1970:NTMa,
5155 author = "Richard H. Bartels and Gene H. Golub and Michael A.
5156 Saunders",
5157 title = "Numerical techniques in mathematical programming",
5158 type = "Technical Report",
5159 number = "STAN-CS-70-162 (SLACP-760, AD709564)",
5160 institution = inst-STAN-CS,
5161 address = inst-STAN-CS:adr,
5162 pages = "iv + 61",
5163 month = may,
5164 year = "1970",
5165 bibdate = "Fri Nov 7 07:00:05 MST 2025",
5166 bibsource = "https://www.math.utah.edu/pub/bibnet/authors/g/golub-gene-h.bib;
5167 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
5168 URL = "http://i.stanford.edu/TR/CS-TR-70-162.html",
5169 abstract = "The application of numerically stable matrix
5170 decompositions to minimization problems involving
5171 linear constraints is discussed and shown to be
5172 feasible without undue loss of efficiency. Part A
5173 describes computation and updating of the product-form
5174 of the LU decomposition of a matrix and shows it can be
5175 applied to solving linear systems at least as
5176 efficiently as standard techniques using the
5177 product-form of the inverse. Part B discusses
5178 orthogonalization via Householder transformations, with
5179 applications to least squares and quadratic programming
5180 algorithms based on the principal pivoting method of
5181 Cottle and Dantzig. Part C applies the singular value
5182 decomposition to the nonlinear least squares problem
5183 and discusses related eigenvalue problems.",
5184 acknowledgement = ack-nhfb,
5185 author-dates = "Gene Howard Golub (February 29, 1932--November 16,
5186 2007)",
5187 keywords = "complementary pivoting; householder transformations;
5188 least squares; linear programming; matrix
5189 decompositions; non-linear least squares; quadratic
5190 programming",
5191 pdfpages = "74",
5192 xxnumber = "CS-TR-70-162 (SLACP-760, AD709564)",
5193 }
5194
5195 @TechReport{Malcolm:1970:AFP,
5196 author = "Michael A. Malcolm",
5197 title = "An algorithm for floating-point accumulation of sums
5198 with small relative error",
5199 type = "Technical Report",
5200 number = "STAN-CS-70-163 (AD708691)",
5201 institution = inst-STAN-CS,
5202 address = inst-STAN-CS:adr,
5203 pages = "21",
5204 month = jun,
5205 year = "1970",
5206 bibdate = "Sat Feb 24 15:01:45 MST 1996",
5207 bibsource = "https://www.math.utah.edu/pub/tex/bib/fparith.bib;
5208 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
5209 URL = "http://i.stanford.edu/TR/CS-TR-70-163.html",
5210 abstract = "A practical algorithm for floating-point accumulation
5211 is presented. Through the use of multiple accumulators,
5212 errors due to cancellation are avoided. An example in
5213 Fortran is included. An error analysis providing a
5214 sharp bound on the relative error is also given.",
5215 acknowledgement = ack-nhfb,
5216 keywords = "accurate floating-point summation; Algorithms.;
5217 FORTRAN (Computer program language); Numerical
5218 calculations --- Computer programs.",
5219 pdfpages = "26",
5220 remark = "Reproduced by National Technical Information Service.
5221 AD 708 691.",
5222 xxnumber = "CS-TR-70-163",
5223 }
5224
5225 @TechReport{Gordonova:1970:ERE,
5226 author = "V. I. Gordonova and Linda C. Kaufman",
5227 title = "`{{\booktitle{Estimates of the Roundoff Error in the
5228 Solution of a System of Conditional Equations}}' by V.
5229 I. Gordonova}",
5230 type = "Technical Report",
5231 number = "STAN-CS-70-164 (AD708692)",
5232 institution = inst-STAN-CS,
5233 address = inst-STAN-CS:adr,
5234 pages = "??",
5235 month = jun,
5236 year = "1970",
5237 bibdate = "Fri Nov 7 07:00:05 MST 2025",
5238 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
5239 URL = "http://i.stanford.edu/TR/CS-TR-70-164.html",
5240 abstract = "Using backward error analysis, this paper compares the
5241 roundoff error in the least-squares solution of a
5242 system of conditional equations Ax=f by two different
5243 methods. The first one entails solving the normal
5244 equations $ A^T $Ax=$ A^T $ f and the second is one
5245 proposed by Faddeev, Faddeeva, and Kublanovskaya in
5246 1966. This latter method involves multiplying the
5247 system by orthogonal matrices to transform the matrix A
5248 into upper triangular form. Translated by Linda
5249 Kaufman.",
5250 acknowledgement = ack-nhfb,
5251 pdfpages = "22",
5252 xxnumber = "CS-TR-70-164",
5253 }
5254
5255 @TechReport{Bauer:1970:STM,
5256 author = "Henry R. Bauer and Harold S. Stone",
5257 title = "The scheduling of $n$ tasks with $m$ operations on two
5258 processors",
5259 type = "Technical Report",
5260 number = "STAN-CS-70-165",
5261 institution = inst-STAN-CS,
5262 address = inst-STAN-CS:adr,
5263 pages = "??",
5264 month = jul,
5265 year = "1970",
5266 bibdate = "Fri Nov 7 07:00:05 MST 2025",
5267 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
5268 URL = "http://i.stanford.edu/TR/CS-TR-70-165.html",
5269 abstract = "The job shop problem is one scheduling problem for
5270 which no efficient algorithm exists. That is, no
5271 algorithm is known in which the number of computational
5272 steps grow algebraically as the problem enlarges. This
5273 paper presents a discussion of the problem of
5274 scheduling N tasks on two processors when each task
5275 consists of three operations. The operations of each
5276 task must be performed in order and among the
5277 processors. We analyze this problem through four
5278 sub-problems. Johnson's scheduling algorithm is
5279 generalized to solve two of these sub-problems, and
5280 functional equation algorithms are used to solve the
5281 remaining two problems. Except for one case, the
5282 algorithms are efficient. The exceptional case has been
5283 labelled the `core' problem and the difficulties are
5284 described.",
5285 acknowledgement = ack-nhfb,
5286 pdfpages = "44",
5287 xxnumber = "CS-TR-70-165",
5288 }
5289
5290 @TechReport{Sandewall:1970:RNL,
5291 author = "Erik J. Sandewall",
5292 title = "Representing Natural-Language Information in Predicate
5293 Calculus",
5294 type = "Technical Report",
5295 number = "STAN-CS-70-166 (AIM-128, AD713841)",
5296 institution = inst-STAN-CS,
5297 address = inst-STAN-CS:adr,
5298 pages = "iii + 27",
5299 month = jul,
5300 year = "1970",
5301 bibdate = "Fri Nov 21 14:21:14 2025",
5302 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
5303 URL = "",
5304 abstract = "A set of general conventions are proposed for
5305 representing natural language Information in
5306 many-sorted first order predicate calculus. The purpose
5307 is to provide a testing-ground for existing
5308 theorem-proving programs,",
5309 acknowledgement = ack-nhfb,
5310 pdfpages = "31",
5311 }
5312
5313 @TechReport{Igarashi:1970:SAL,
5314 author = "Shigeru Igarashi",
5315 title = "Semantics of {ALGOL}-Like Statements",
5316 type = "Technical Report",
5317 number = "STAN-CS-70-167 (AIM-129, AD712460)",
5318 institution = inst-STAN-CS,
5319 address = inst-STAN-CS:adr,
5320 pages = "iii + 95",
5321 month = jun,
5322 year = "1970",
5323 bibdate = "Fri Nov 21 14:21:14 2025",
5324 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
5325 URL = "",
5326 abstract = "The semantics of elementary Algol-like statements is
5327 discussed, mainly based on an axiomatic
5328 method.\par
5329
5330 Firstly, a class of Algol-like statements is introduced
5331 by generalized inductive definition, and the
5332 interpretation of the statements belonging to it is
5333 defined in the form of a function over this class,
5334 using the induction principle induced by the above
5335 definition. Then a category of program is introduced in
5336 order to clarify the concept of equivalence of
5337 statements, which becomes a special case of isomorphism
5338 in that category.\par
5339
5340 A revised formal system representing the concept of
5341 equivalence of Algol-like statements is presented,
5342 followed by elementary metatheorems.\par
5343
5344 Finally, a process of decomposition of Algol-like
5345 statements, which can be regarded as a conceptual
5346 compiler, or a constructive description of semantics
5347 based on primitive actions, is defined and its
5348 correctness is proved formally, by the help of the
5349 induced induction principle.",
5350 acknowledgement = ack-nhfb,
5351 pdfpages = "101",
5352 }
5353
5354 @TechReport{Kelly:1970:VIP,
5355 author = "Michael David Kelly",
5356 title = "Visual Identification of People by Computer",
5357 type = "Technical Report",
5358 number = "STAN-CS-70-168 (AIM-130, AD713252)",
5359 institution = inst-STAN-CS,
5360 address = inst-STAN-CS:adr,
5361 month = aug,
5362 year = "1970",
5363 bibdate = "Fri Nov 21 14:21:14 2025",
5364 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
5365 URL = "",
5366 abstract = "The thesis describes a computer program which performs
5367 a complex picture processing task. The task is to
5368 choose, from a collection of pictures of people taken
5369 by a TV camera, those pictures that depict the same
5370 person. The primary purpose of this research has been
5371 directed toward the development of new techniques for
5372 picture processing",
5373 acknowledgement = ack-nhfb,
5374 pdfpages = "513",
5375 remark = "This is the author's Ph.D. thesis. The PDF file from
5376 Google Books has many blank pages.",
5377 xxpages = "138",
5378 }
5379
5380 @TechReport{Knuth:1970:EFS,
5381 author = "Donald E. Knuth",
5382 title = "Examples of Formal Semantics",
5383 type = "Technical Report",
5384 number = "STAN-CS-70-169 (AIM-126, AD711329)",
5385 institution = inst-STAN-CS,
5386 address = inst-STAN-CS:adr,
5387 pages = "ii + 34",
5388 month = jul,
5389 year = "1970",
5390 bibdate = "Fri Nov 21 14:21:14 2025",
5391 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
5392 URL = "",
5393 abstract = "A technique of formal definition, based on relations
5394 between ``attributes'' associated with nonterminal
5395 symbols in a context-free grammar, is illustrated by
5396 several applications to simple yet typical problems.
5397 First we define the basic properties of lambda
5398 expressions, involving substitution and renaming of
5399 bound variables. Then a simple programming language is
5400 defined using several different points of view. The
5401 emphasis is on ``declarative'' rather than
5402 ``imperative'' or ``algorithmic'' forms of
5403 definition.",
5404 acknowledgement = ack-nhfb,
5405 keywords = "information structures; inherited attributes; Lambda
5406 expressions; synthesized attributes; TL/I; Turingol",
5407 pdfpages = "36",
5408 remark = "Published in \booktitle{Symposium on semantics of
5409 algorithmic languages}, Springer (1971), ISBN
5410 0-387-05377-8, pp. 212--235.",
5411 }
5412
5413 @TechReport{Bredt:1970:ASC,
5414 author = "Thomas H. Bredt",
5415 title = "Analysis and synthesis of concurrent sequential
5416 programs",
5417 type = "Technical Report",
5418 number = "STAN-CS-70-170 (CSL-TR-6, AD711334)",
5419 institution = inst-STAN-CS,
5420 address = inst-STAN-CS:adr,
5421 pages = "??",
5422 month = may,
5423 year = "1970",
5424 bibdate = "Fri Nov 7 07:00:05 MST 2025",
5425 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
5426 URL = "http://i.stanford.edu/TR/CS-TR-70-170.html",
5427 abstract = "This paper presents analysis and synthesis procedures
5428 for a class of sequential programs. These procedures
5429 aid in the design of programs for parallel computer
5430 systems. In particular, the interactions of a given
5431 program with other programs or circuits in a system can
5432 be described precisely. The basis for this work is a
5433 model for parallel computer systems in which the
5434 operation of each component is described by a flow
5435 table and the components interact by changing values on
5436 interconnecting lines. The details of this model are
5437 discussed in another paper [Stanford University
5438 Department of Computer Science report STAN-CS-70-160].
5439 The analysis procedure produces a flow table
5440 description of a program. In program synthesis, a flow
5441 table description is converted to a sequential program.
5442 Using flow table design procedures, a control program
5443 for the two-program mutual exclusion problem is
5444 produced.",
5445 acknowledgement = ack-nhfb,
5446 pdfpages = "56",
5447 xxnumber = "CS-TR-70-170",
5448 }
5449
5450 @TechReport{Bredt:1970:SMP,
5451 author = "Thomas H. Bredt",
5452 title = "A survey of models for parallel computing",
5453 type = "Technical Report",
5454 number = "STAN-CS-70-171 (CSL-TR-8, AD714202)",
5455 institution = inst-STAN-CS,
5456 address = inst-STAN-CS:adr,
5457 pages = "??",
5458 month = aug,
5459 year = "1970",
5460 bibdate = "Fri Nov 7 07:00:05 MST 2025",
5461 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
5462 URL = "http://i.stanford.edu/TR/CS-TR-70-171.html",
5463 abstract = "The work of Adams, Karp and Miller, Luconi, and
5464 Rodriguez on formal models for parallel computations
5465 and computer systems is reviewed. A general definition
5466 of a parallel schema is given so that the similarities
5467 and differences of the models can be discussed. Primary
5468 emphasis is on the control structures used to achieve
5469 parallel operation and on properties of the models such
5470 as determinacy and equivalence. Decidable and
5471 undecidable properties are summarized.",
5472 acknowledgement = ack-nhfb,
5473 pdfpages = "62",
5474 xxnumber = "CS-TR-70-171",
5475 }
5476
5477 @TechReport{Bredt:1970:APS,
5478 author = "Thomas H. Bredt",
5479 title = "Analysis of parallel systems",
5480 type = "Technical Report",
5481 number = "STAN-CS-70-172 (CSL-TR-7, AD714180)",
5482 institution = inst-STAN-CS,
5483 address = inst-STAN-CS:adr,
5484 pages = "??",
5485 month = aug,
5486 year = "1970",
5487 bibdate = "Fri Nov 7 07:00:05 MST 2025",
5488 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
5489 URL = "http://i.stanford.edu/TR/CS-TR-70-172.html",
5490 abstract = "A formal analysis procedure for parallel computer
5491 systems is presented. The flow table model presented in
5492 an earlier paper [Stanford University Department of
5493 Computer Science report STAN-CS-70-160] is used to
5494 describe a system. Each component to the system is
5495 described by a completely specified fundamental-mode
5496 flow table. All delays in a parallel system are assumed
5497 to be finite. Component delays are assumed to be
5498 bounded and line delays unbounded. The concept of an
5499 output hazard is introduced to account for the effects
5500 of line delay and the lack of synchronization among
5501 components. Necessary and sufficient conditions for the
5502 absence of output hazards are given. The state of a
5503 parallel system is defined by the present internal
5504 state and input state of each component. The operation
5505 of the system is described by a system state graph
5506 which specifies all possible state transitions for a
5507 specified initial system state. A procedure for
5508 constructing the system state graph is given. The
5509 analysis procedure may be summarized as follows. A
5510 problem is stated in terms of restrictions on system
5511 operation. A parallel system is said to operate
5512 correctly with respect to the given problem if the
5513 associated restrictions are always satisfied. The
5514 restrictions specify either forbidden system states,
5515 which are never to be entered during the operation of
5516 the system, or forbidden system state sequences, which
5517 must never appear during system operation. The
5518 restrictions are tested by examining the system state
5519 graph. A parallel system for the two-process mutual
5520 exclusion problem is analyzed and the system is shown
5521 to operate correctly with respect to this problem.
5522 Finally, the conditions of determinacy and output
5523 functionality, which have been used in other models of
5524 parallel computing, are discussed as they relate to
5525 correct solutions to the mutual exclusion problem.",
5526 acknowledgement = ack-nhfb,
5527 pdfpages = "64",
5528 xxnumber = "CS-TR-70-172",
5529 }
5530
5531 @TechReport{Bredt:1970:MEP,
5532 author = "Thomas H. Bredt",
5533 title = "The mutual exclusion problem",
5534 type = "Technical Report",
5535 number = "STAN-CS-70-173 (CSL-TR-9, AD714181)",
5536 institution = inst-STAN-CS,
5537 address = inst-STAN-CS:adr,
5538 pages = "??",
5539 month = aug,
5540 year = "1970",
5541 bibdate = "Fri Nov 7 07:00:05 MST 2025",
5542 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
5543 URL = "http://i.stanford.edu/TR/CS-TR-70-173.html",
5544 abstract = "This paper discusses how $n$ components, which may be
5545 programs or circuits, in a computer system can be
5546 controlled so that (1) at most one component may
5547 perform a designated `critical' operation at any
5548 instant and (2) if one component wants to perform its
5549 critical operation, it is eventually allowed to do so.
5550 This control problem is known as the mutual exclusion
5551 or interlock problem. A summary of the flow table model
5552 [Stanford University Department of Computer Science
5553 report STAN-CS-70-160] for computer systems is given.
5554 In this model, a control algorithm is represented by a
5555 flow table. The number of internal states in the
5556 control flow table is used as a measure of the
5557 complexity of control algorithms. A lower bound of $ n
5558 + 1 $ internal states is shown to be necessary if the
5559 mutual exclusion problem is to be solved. Procedures to
5560 generate control flow tables for the mutual exclusion
5561 problem which require the minimum number of internal
5562 states are described and it is proved that these
5563 procedures given correct control solutions. Other
5564 so-called `unbiased' algorithms are described which
5565 require $ 2 n!$ internal states but break ties in the
5566 case of multiple requests in favor of the component
5567 that least recently executed its critical operation.
5568 The paper concludes with a discussion of the tradeoffs
5569 between central and distributed control algorithms.",
5570 acknowledgement = ack-nhfb,
5571 pdfpages = "72",
5572 xxnumber = "CS-TR-70-173",
5573 }
5574
5575 @TechReport{Manna:1970:TAP,
5576 author = "Zohar Manna and Richard J. Waldinger",
5577 title = "Towards automatic program synthesis",
5578 type = "Technical Report",
5579 number = "STAN-CS-70-174 (AIM-127, AD711395)",
5580 institution = inst-STAN-CS,
5581 address = inst-STAN-CS:adr,
5582 pages = "??",
5583 month = jul,
5584 year = "1970",
5585 bibdate = "Fri Nov 7 07:00:05 MST 2025",
5586 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
5587 URL = "http://i.stanford.edu/TR/CS-TR-70-174.html",
5588 abstract = "An elementary outline of the theorem-proving approach
5589 to automatic program synthesis is given, without
5590 dwelling on technical details. The method is
5591 illustrated by the automatic construction of both
5592 recursive and iterative programs operating on natural
5593 numbers, lists, and trees. In order to construct a
5594 program satisfying certain specifications, a theorem
5595 induced by those specifications is proved, and the
5596 desired program is extracted from the proof. The same
5597 technique is applied to transform recursively defined
5598 functions into iterative programs, frequently with a
5599 major gain in efficiency. It is emphasized that in
5600 order to construct a program with loops or with
5601 recursion, the principle of mathematical induction must
5602 be applied. The relation between the version of the
5603 induction rule used and the form of the program
5604 constructed is explored in some detail.",
5605 acknowledgement = ack-nhfb,
5606 pdfpages = "62",
5607 xxnumber = "CS-TR-70-174",
5608 }
5609
5610 @TechReport{Malcolm:1970:DCS,
5611 author = "Michael A. Malcolm",
5612 title = "A description and comparison of subroutines for
5613 computing {Euclidean} inner products on the {IBM 360}",
5614 type = "Technical Report",
5615 number = "STAN-CS-70-175 (AD713842)",
5616 institution = inst-STAN-CS,
5617 address = inst-STAN-CS:adr,
5618 pages = "??",
5619 month = oct,
5620 year = "1970",
5621 bibdate = "Fri Nov 7 07:00:05 MST 2025",
5622 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
5623 URL = "http://i.stanford.edu/TR/CS-TR-70-175.html",
5624 abstract = "Several existing subroutines and an Algol W procedure
5625 for computing inner products on the IBM 360, using more
5626 precision than long, are described and evaluated. Error
5627 bounds (when they exist) and execution timing tests are
5628 included.",
5629 acknowledgement = ack-nhfb,
5630 pdfpages = "18",
5631 xxnumber = "CS-TR-70-175",
5632 }
5633
5634 @TechReport{Feigenbaum:1970:GPS,
5635 author = "Edward A. Feigenbaum and Bruce G. Buchanan and Joshua
5636 Lederberg",
5637 title = "On generality and problem solving: a case study using
5638 the {DENDRAL} program",
5639 type = "Technical Report",
5640 number = "STAN-CS-70-176 (AIM-131, AD715128)",
5641 institution = inst-STAN-CS,
5642 address = inst-STAN-CS:adr,
5643 pages = "iv + 48",
5644 month = aug,
5645 year = "1970",
5646 bibdate = "Fri Nov 7 07:00:05 MST 2025",
5647 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
5648 URL = "http://i.stanford.edu/TR/CS-TR-70-176.html",
5649 abstract = "Heuristic DENDRAL is a computer program written to
5650 solve problems of inductive inference in organic
5651 chemistry. This paper will use the design of Heuristic
5652 DENDRAL and its performance on different problems for a
5653 discussion of the following topics: 1. the design for
5654 generality; 2. the performance problems attendant upon
5655 too much generality; 3. the coupling of expertise to
5656 the general problem solving processes; 4. the symbiotic
5657 relationship between generality and expertness, and the
5658 implications of this symbiosis for the study and design
5659 of problem solving systems. We conclude the paper with
5660 a view of the design for a general problem solver that
5661 is a variant of the `big switch' theory of
5662 generality.",
5663 acknowledgement = ack-nhfb,
5664 pdfpages = "54",
5665 xxnumber = "CS-TR-70-176",
5666 }
5667
5668 @TechReport{Floyd:1970:BNS,
5669 author = "Robert W. Floyd and Donald E. Knuth",
5670 title = "The {Bose--Nelson} Sorting Problem",
5671 type = "Technical Report",
5672 number = "STAN-CS-70-177 (AD715511)",
5673 institution = inst-STAN-CS,
5674 address = inst-STAN-CS:adr,
5675 pages = "ii + 16",
5676 month = oct,
5677 year = "1970",
5678 bibdate = "Fri Nov 21 14:21:14 2025",
5679 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
5680 note = "Dedicated to R. C. Bose on his seventieth birthday.",
5681 URL = "",
5682 acknowledgement = ack-nhfb,
5683 author-dates = "Robert W. Floyd (8 June 1936--25 September 2001)",
5684 pdfpages = "20",
5685 remark = "No abstract is available. Published in \booktitle{A
5686 Survey of Combinatorial Theory}, North Holland (1973),
5687 ISBN 0-444-10425-9, pp. 189--195.",
5688 }
5689
5690 @TechReport{Forsythe:1970:RCS,
5691 author = "George E. Forsythe and William F. Miller",
5692 title = "Research in the {Computer Science Department} and
5693 selected other research in computing at {Stanford
5694 University}",
5695 type = "Technical Report",
5696 number = "STAN-CS-70-178",
5697 institution = inst-STAN-CS,
5698 address = inst-STAN-CS:adr,
5699 pages = "??",
5700 month = oct,
5701 year = "1970",
5702 bibdate = "Fri Nov 7 07:00:05 MST 2025",
5703 bibsource = "https://www.math.utah.edu/pub/bibnet/authors/f/forsythe-george-elmer.bib;
5704 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
5705 URL = "http://i.stanford.edu/TR/CS-TR-70-178.html",
5706 abstract = "The research program of the Computer Science
5707 Department can perhaps be best summarized in terms of
5708 its research projects. The chart on page ii lists the
5709 projects and the participation by faculty and students.
5710 The sections following the chart provide descriptions
5711 of the individual projects. There are a number of
5712 projects in other schools or departments which are
5713 making significant contributions to computer science;
5714 and these add to the total computer environment.
5715 Descriptions of a few of these projects are also
5716 included with this report. This list of projects
5717 outside of Computer Science does not purport to be
5718 complete or even representative.",
5719 acknowledgement = ack-nhfb,
5720 author-dates = "George Elmer Forsythe (8 January 1917--9 April 1972)",
5721 pdfpages = "206",
5722 xxnumber = "CS-TR-70-178",
5723 }
5724
5725 @TechReport{Smith:1970:M,
5726 author = "David Canfield Smith",
5727 title = "{MLISP}",
5728 type = "Technical Report",
5729 number = "STAN-CS-70-179 (AIM-135, AD716566)",
5730 institution = inst-STAN-CS,
5731 address = inst-STAN-CS:adr,
5732 pages = "??",
5733 month = oct,
5734 year = "1970",
5735 bibdate = "Fri Nov 7 07:00:05 MST 2025",
5736 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
5737 URL = "http://i.stanford.edu/TR/CS-TR-70-179.html",
5738 abstract = "MLISP is a high level list-processing and
5739 symbol-manipulation language based on the programming
5740 language LISP. MLISP programs are translated into LISP
5741 programs and then executed or compiled. MLISP exists
5742 for two purposes: (1) to facilitate the writing and
5743 understanding of LISP programs; (2) to remedy certain
5744 important deficiencies in the list-processing ability
5745 of LISP.",
5746 acknowledgement = ack-nhfb,
5747 pdfpages = "106",
5748 xxnumber = "CS-TR-70-179",
5749 }
5750
5751 @TechReport{Falk:1970:CII,
5752 author = "Gilbert Falk",
5753 title = "Computer Interpretation of Imperfect Line Data as a
5754 Three-Dimensional Scene",
5755 type = "Technical Report",
5756 number = "STAN-CS-70-180 (AIM-132, AD715665)",
5757 institution = inst-STAN-CS,
5758 address = inst-STAN-CS:adr,
5759 pages = "ix + 187",
5760 month = aug,
5761 year = "1970",
5762 bibdate = "Fri Nov 21 14:21:14 2025",
5763 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
5764 URL = "",
5765 abstract = "The major portion of this paper describes a heuristic
5766 scene description program. This program accepts as
5767 input a sequence represented as a line drawing. Based
5768 on a set of known object models the program attempts to
5769 determine the identity and location of each object
5770 viewed. The most significant feature of the program is
5771 its ability to deal with imperfect input data.\par
5772
5773 We also present some preliminary results concerning
5774 constraints in projections of planar-faced solids. We
5775 show that for a restricted class of projections, points
5776 located in 3-space in addition to complete monocular
5777 information are sufficient to specify all the visible
5778 point locations precisely.",
5779 acknowledgement = ack-nhfb,
5780 advisor = "Jerome A. Feldman",
5781 pdfpages = "202",
5782 remark = "This is the author's Ph.D. thesis.",
5783 }
5784
5785 @TechReport{Hearn:1970:RUM,
5786 author = "Anthony C. Hearn",
5787 title = "{Reduce 2} --- User's Manual",
5788 type = "Technical Report",
5789 number = "STAN-CS-70-181 (AIM-133)",
5790 institution = inst-STAN-CS,
5791 address = inst-STAN-CS:adr,
5792 pages = "85",
5793 month = oct,
5794 year = "1970",
5795 bibdate = "Fri Nov 21 14:21:14 2025",
5796 bibsource = "http://www.math.utah.edu/pub/tex/bib/red-g-l.bib;
5797 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
5798 URL = "",
5799 acknowledgement = ack-nhfb,
5800 }
5801
5802 @TechReport{Tenenbaum:1970:ACV,
5803 author = "Jay Martin Tenenbaum",
5804 title = "Accommodation in Computer Vision",
5805 type = "Technical Report",
5806 number = "STAN-CS-70-182 (AIM-134, AD748565)",
5807 institution = inst-STAN-CS,
5808 address = inst-STAN-CS:adr,
5809 pages = "xiv + 452",
5810 month = sep,
5811 year = "1970",
5812 bibdate = "Fri Nov 21 14:21:14 2025",
5813 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
5814 URL = "",
5815 abstract = "We describe an evolving computer vision system in
5816 which the parameters of the camera are controlled by
5817 the computer. It is distinguished from conventional
5818 picture processing systems by the fact that sensor
5819 accommodation is automatic and treated as an integral
5820 part of the recognition process.\par
5821
5822 A machine, like a person, comes in contact with far
5823 more visual information than it can process.
5824 Furthermore, no physical sensor can simultaneously
5825 provide information about the full range of the
5826 environment. Consequently, both man and machine must
5827 accommodate their sensors to emphasize selected
5828 characteristics of the environment.\par
5829
5830 Accommodation improves the reliability and efficiency
5831 of machine perception by matching the information
5832 provided by the sensor with that required by specific
5833 perceptual functions. The advantages of accommodation
5834 are demonstrated in the context of five key functions
5835 in computer vision: acquisition, contour following,
5836 verifying the presence of an expected edge,
5837 range-finding, and color recognition.\par
5838
5839 We have modeled the interaction of camera parameters
5840 with scene characteristics to determine the composition
5841 of an image. Using a priori knowledge of the
5842 environment, the camera is tuned to satisfy the
5843 information requirements of a particular task.\par
5844
5845 Task performance depends implicitly on the
5846 appropriateness of available information. If a function
5847 fails to perform as expected, and if this failure is
5848 attributable to a specific image deficiency, then the
5849 relevant accommodation parameters can be
5850 refined.\par
5851
5852 This schema for automating sensor accommodating can be
5853 applied in a variety of perceptual domains.",
5854 acknowledgement = ack-nhfb,
5855 pdfpages = "470",
5856 remark = "This is the author's Ph.D. thesis.",
5857 }
5858
5859 @TechReport{White:1970:MLT,
5860 author = "George M. White",
5861 title = "Machine learning through signature trees: applications
5862 to human speech",
5863 type = "Technical Report",
5864 number = "STAN-CS-70-183 (AIM-136, AD717600)",
5865 institution = inst-STAN-CS,
5866 address = inst-STAN-CS:adr,
5867 pages = "??",
5868 month = oct,
5869 year = "1970",
5870 bibdate = "Fri Nov 7 07:00:05 MST 2025",
5871 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
5872 URL = "http://i.stanford.edu/TR/CS-TR-70-183.html",
5873 abstract = "Signature tree `machine learning', pattern recognition
5874 heuristics are investigated for the specific problem of
5875 computer recognition of human speech. When the data
5876 base of given utterances is insufficient to establish
5877 trends with confidence, a large number of feature
5878 extractors must be employed and `recognition' of an
5879 unknown pattern made by comparing its feature values
5880 with those of known patterns. When the data base is
5881 replete, a `signature' tree can be constructed and
5882 recognition can be achieved by the evaluation of a
5883 select few features. Learning results from selecting an
5884 optimal minimal set of features to achieve recognition.
5885 Properties of signature trees and the heuristics for
5886 this type of learning are of primary interest in this
5887 exposition.",
5888 acknowledgement = ack-nhfb,
5889 pdfpages = "48",
5890 xxnumber = "CS-TR-70-183",
5891 }
5892
5893 @TechReport{Malcolm:1970:NCJ,
5894 author = "Michael A. Malcolm",
5895 title = "A note on a conjecture of {L. J. Mordell}",
5896 type = "Technical Report",
5897 number = "STAN-CS-70-184 (AD715512)",
5898 institution = inst-STAN-CS,
5899 address = inst-STAN-CS:adr,
5900 pages = "??",
5901 month = nov,
5902 year = "1970",
5903 bibdate = "Fri Nov 7 07:00:05 MST 2025",
5904 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
5905 URL = "http://i.stanford.edu/TR/CS-TR-70-184.html",
5906 abstract = "A computer proof is described for a previously
5907 unsolved problem concerning the inequality $ \sum {i =
5908 1}{n} x_i / (x_{i + 1} \ + x_{i + 2}) \geq \ f r a
5909 c{n}{2} $.",
5910 acknowledgement = ack-nhfb,
5911 pdfpages = "7",
5912 xxnumber = "CS-TR-70-184",
5913 }
5914
5915 @TechReport{Nelson:1970:GPS,
5916 author = "Edward C. Nelson",
5917 title = "Graph program simulation",
5918 type = "Technical Report",
5919 number = "STAN-CS-70-185 (TID22593)",
5920 institution = inst-STAN-CS,
5921 address = inst-STAN-CS:adr,
5922 pages = "??",
5923 month = oct,
5924 year = "1970",
5925 bibdate = "Fri Nov 7 07:00:05 MST 2025",
5926 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
5927 URL = "http://i.stanford.edu/TR/CS-TR-70-185.html",
5928 abstract = "This reports the simulation of a parallel processing
5929 system based on a directed graph representation of
5930 parallel computations. The graph representation is
5931 based on the model developed by Duane Adams in which
5932 programs are written as directed graphs whose nodes
5933 represent operations and whose edges represent data
5934 flow. The first part of the report describes a
5935 simulator which interprets these graph programs. The
5936 second part describes the use of the simulator in a
5937 hypothetical environment which has an unlimited number
5938 of processors and an unlimited amount of memory. Three
5939 programs, a trapezoidal quadrature, a sort and a matrix
5940 multiplication, were used to study the effect of
5941 varying the relative speed of primitive operations on
5942 computation time with problem size. The system was able
5943 to achieve a high degree of parallelism. For example,
5944 the simulator multiplied two $n$ by $n$ matrices in a
5945 simulated time proportional to $n$.",
5946 acknowledgement = ack-nhfb,
5947 pdfpages = "198",
5948 xxnumber = "CS-TR-70-185",
5949 }
5950
5951 @TechReport{Knuth:1970:ESF,
5952 author = "Donald E. Knuth",
5953 title = "An Empirical Study of {Fortran} Programs",
5954 type = "Technical Report",
5955 number = "STAN-CS-70-186 (AIM-137, AD715513)",
5956 institution = inst-STAN-CS,
5957 address = inst-STAN-CS:adr,
5958 pages = "ii + 42",
5959 month = nov,
5960 year = "1970",
5961 bibdate = "Fri Nov 21 14:21:14 2025",
5962 bibsource = "https://www.math.utah.edu/pub/tex/bib/fortran1.bib;
5963 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
5964 URL = "https://apps.dtic.mil/sti/tr/pdf/AD0715513.pdf",
5965 abstract = "A sample of programs, written in FORTRAN by a wide
5966 variety of people for a wide variety of applications,
5967 was chosen ``at random'' in an attempt to discover
5968 quantitatively ``what programmers really do.''
5969 Statistical results of this survey are presented here,
5970 together with some of their apparent implications for
5971 future work in compiler design. The principal
5972 conclusion which may be drawn is the importance of a
5973 program ``profile,'' namely a table of frequency counts
5974 which record how often each statement is performed in a
5975 typical run; there are strong indications that
5976 profile-keeping should become a standard practice in
5977 all computer systems, for casual users as well as
5978 system programmers. This paper is the report of a three
5979 month study undertaken by the author and about a dozen
5980 students and representatives of the software industry
5981 during the summer 1970. It is hoped that a reader who
5982 studies this report will obtain a fairly clear
5983 conception of how FORTRAN is being used, and what
5984 compilers can do about it.",
5985 acknowledgement = ack-nhfb,
5986 pdfpages = "45",
5987 }
5988
5989 @TechReport{Eisenstat:1970:MMP,
5990 author = "Stanley C. Eisenstat and Thomas L. Magnanti and Steven
5991 F. Maier and Michael B. McGrath and Vincent J.
5992 Nicholson and Christiane Riedl and George B. Dantzig",
5993 title = "{MPL}, {Mathematical Programming Language}:
5994 specification manual for {Committee} review",
5995 type = "Technical Report",
5996 number = "STAN-CS-70-187 (AD197154)",
5997 institution = inst-STAN-CS,
5998 address = inst-STAN-CS:adr,
5999 pages = "??",
6000 month = nov,
6001 year = "1970",
6002 bibdate = "Fri Nov 7 07:00:05 MST 2025",
6003 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
6004 URL = "http://i.stanford.edu/TR/CS-TR-70-187.html",
6005 abstract = "Mathematical Programming Language (MPL) is intended as
6006 a highly readable, user oriented, programming tool for
6007 use in the writing and testing of mathematical
6008 algorithms, in particular experimental algorithms for
6009 solving large-scale linear programs. It combines the
6010 simplicity of standard mathematical notation with the
6011 power of complex data structures. Variables may be
6012 implicitly introduced into a program by their use in
6013 the statement in which they first appear. No formal
6014 defining statement is necessary. Statements of the
6015 `let' and `where' type are part of the language.
6016 Included within the allowable data structures of MPL
6017 are matrices, partitioned matrices, and
6018 multidimensional arrays. Ordered sets are included as
6019 vectors with their constructs closely paralleling those
6020 found in set theory. Allocation of storage is dynamic,
6021 thereby eliminating the need for a data manipulating
6022 subset of the language, as is characteristic of most
6023 high level scientific programming languages. This
6024 report summarizes the progress that has been made to
6025 date in developing MPL. It contains a specification
6026 manual, examples of the application of the language,
6027 and the future directions and goals of the project. A
6028 version of MPL, called MPL/70, has been implemented
6029 using PL/I as a translator. This will be reported
6030 separately. Until fully implemented, MPL is expected to
6031 serve primarily as a highly readable communication
6032 language for mathematical algorithms.",
6033 acknowledgement = ack-nhfb,
6034 pdfpages = "72",
6035 xxnumber = "CS-TR-70-187",
6036 }
6037
6038 @TechReport{Ashcroft:1971:TGP,
6039 author = "Edward A. Ashcroft and Zohar Manna",
6040 title = "The Translation of {``Go To''} Programs to {``While''}
6041 Programs",
6042 type = "Technical Report",
6043 number = "STAN-CS-71-188 (AIM-138, PB197161)",
6044 institution = inst-STAN-CS,
6045 address = inst-STAN-CS:adr,
6046 pages = "ii + 29",
6047 month = jan,
6048 year = "1971",
6049 bibdate = "Fri Nov 21 14:21:14 2025",
6050 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
6051 URL = "http://i.stanford.edu/TR/CS-TR-71-188.html",
6052 abstract = "In this paper we show that every flowchart program can
6053 be written without {\bf go to} statements by using {\bf
6054 while} statements. The main idea is to introduce new
6055 variables to preserve the values of certain variables
6056 at particular points in the program; or alternatively,
6057 to introduce special boolean variables to keep
6058 information about the course of the
6059 computation.\par
6060
6061 The `while' programs produced yield the same final
6062 results as the original flowchart program but need not
6063 perform computations in exactly the same way. However,
6064 the new programs do preserve the `topology' of the
6065 original flowchart program, and are of the same order
6066 of efficiency.\par
6067
6068 We also show that this cannot be done in general
6069 without adding variables.",
6070 acknowledgement = ack-nhfb,
6071 pdfpages = "34",
6072 xxnumber = "CS-TR-71-188",
6073 }
6074
6075 @TechReport{Manna:1970:MTP,
6076 author = "Zohar Manna",
6077 title = "Mathematical Theory of Partial Correctness",
6078 type = "Technical Report",
6079 number = "STAN-CS-71-189 (AIM-139, AD717601)",
6080 institution = inst-STAN-CS,
6081 address = inst-STAN-CS:adr,
6082 pages = "ii + 23",
6083 month = jan,
6084 year = "1971",
6085 bibdate = "Fri Nov 21 14:21:14 2025",
6086 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
6087 URL = "",
6088 abstract = "In this work we show that it is possible to express
6089 most properties regularly observed in algorithms in
6090 terms of 'partial correctness' (i.e., the property that
6091 the final results of the algorithm, if any, satisfy
6092 some given input--output relation).\par
6093
6094 This result is of special interest since `partial
6095 correctness' has already been formulated in predicate
6096 calculus and in partial function logic for many classes
6097 of algorithms.",
6098 acknowledgement = ack-nhfb,
6099 pdfpages = "25",
6100 }
6101
6102 @TechReport{Hopcroft:1970:AMS,
6103 author = "John Hopcroft",
6104 title = "An {$ N \log N $} Algorithm for Minimizing States in a
6105 Finite Automaton",
6106 type = "Technical Report",
6107 number = "STAN-CS-70-190 (AD719398)",
6108 institution = inst-STAN-CS,
6109 address = inst-STAN-CS:adr,
6110 pages = "12",
6111 month = dec,
6112 year = "1970",
6113 bibdate = "Fri Nov 21 14:21:14 2025",
6114 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
6115 URL = "https://apps.dtic.mil/sti/html/tr/AD0719398/index.html",
6116 abstract = "An algorithm is given for minimizing the number of
6117 states in a finite automaton or for determining if two
6118 automata are equivalent. The asymptotic running time of
6119 the algorithm is bounded by $ k n \log n $ where $k$ is
6120 some constant and $n$ is the number of states. The
6121 constant $k$ depends linearly on the size of the input
6122 alphabet.",
6123 acknowledgement = ack-nhfb,
6124 pdfpages = "15",
6125 remark = "No PDF in DTIC or NTRL archives. Abstract from DTIC
6126 site.",
6127 }
6128
6129 @TechReport{Lesser:1970:IDE,
6130 author = "V. Lesser",
6131 title = "An Introduction to the Direct Emulation of Control
6132 Structures by a Parallel Micro-Computer",
6133 type = "Technical Report",
6134 number = "STAN-CS-70-191 (SLACP-904, PB198494)",
6135 institution = inst-STAN-CS,
6136 address = inst-STAN-CS:adr,
6137 pages = "26",
6138 month = dec,
6139 year = "1970",
6140 bibdate = "Fri Nov 21 14:21:14 2025",
6141 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
6142 URL = "",
6143 acknowledgement = ack-nhfb,
6144 remark = "No PDF in NTRL archive.",
6145 }
6146
6147 @TechReport{Hopcroft:1970:AIP,
6148 author = "John Hopcroft",
6149 title = "An {$ N \log N $} Algorithm for Isomorphism of Planar
6150 Triply Connected Graphs",
6151 type = "Technical Report",
6152 number = "STAN-CS-70-192 (AD719399)",
6153 institution = inst-STAN-CS,
6154 address = inst-STAN-CS:adr,
6155 pages = "6",
6156 month = dec,
6157 year = "1970",
6158 bibdate = "Fri Nov 21 14:21:14 2025",
6159 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
6160 URL = "",
6161 acknowledgement = ack-nhfb,
6162 remark = "No PDF in NTRL archive.",
6163 }
6164
6165 @TechReport{Schank:1970:IMC,
6166 author = "R. Schank",
6167 title = "Intention, Memory and Computer Understanding",
6168 type = "Technical Report",
6169 number = "STAN-CS-70-193 (AIM-140)",
6170 institution = inst-STAN-CS,
6171 address = inst-STAN-CS:adr,
6172 pages = "59",
6173 month = dec,
6174 year = "1970",
6175 bibdate = "Fri Nov 21 14:21:14 2025",
6176 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
6177 URL = "",
6178 acknowledgement = ack-nhfb,
6179 remark = "TO DO: One source cites this report with date January
6180 1971.",
6181 }
6182
6183 @TechReport{Knuth:1970:ACP,
6184 author = "Donald E. Knuth",
6185 title = "{{\booktitle{The Art of Computer Programming}}} ---
6186 Errata et Addenda",
6187 type = "Technical Report",
6188 number = "STAN-CS-70-194 (PB198495)",
6189 institution = inst-STAN-CS,
6190 address = inst-STAN-CS:adr,
6191 pages = "28",
6192 month = dec,
6193 year = "1970",
6194 bibdate = "Fri Nov 21 14:21:14 2025",
6195 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
6196 URL = "",
6197 acknowledgement = ack-nhfb,
6198 remark = "No PDF in NTRL archive.",
6199 }
6200
6201 @TechReport{Buzbee:1970:DSD,
6202 author = "B. L. Buzbee and Fred W. Dorr and John Alan George and
6203 Gene H. Golub",
6204 title = "The Direct Solution of the Discrete {Poisson} Equation
6205 on Irregular Regions",
6206 type = "Technical Report",
6207 number = "STAN-CS-71-195 (723871)",
6208 institution = inst-STAN-CS,
6209 address = inst-STAN-CS:adr,
6210 pages = "vi + 30",
6211 month = dec,
6212 year = "1970",
6213 bibdate = "Fri Nov 7 07:00:05 MST 2025",
6214 bibsource = "https://www.math.utah.edu/pub/bibnet/authors/g/golub-gene-h.bib;
6215 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
6216 URL = "http://i.stanford.edu/TR/CS-TR-71-195.html",
6217 abstract = "There are several very fast direct methods which can
6218 be used to solve the discrete Poisson equation on
6219 rectangular domains. We show that these methods can
6220 also be used to treat problems on irregular regions.",
6221 acknowledgement = ack-nhfb,
6222 author-dates = "Gene Howard Golub (February 29, 1932--November 16,
6223 2007)",
6224 pdfpages = "40",
6225 xxnumber = "CS-TR-71-195",
6226 }
6227
6228 @TechReport{Moler:1970:MCF,
6229 author = "C. B. Moler",
6230 title = "Matrix Computations with {Fortran} and Paging",
6231 type = "Technical Report",
6232 number = "STAN-CS-70-196 (AD725167)",
6233 institution = inst-STAN-CS,
6234 address = inst-STAN-CS:adr,
6235 pages = "13",
6236 month = dec,
6237 year = "1970",
6238 DOI = "https://doi.org/10.1145/361284.361297",
6239 bibdate = "Fri Nov 21 14:21:14 2025",
6240 bibsource = "https://www.math.utah.edu/pub/bibnet/authors/m/moler-cleve-b.bib;
6241 https://www.math.utah.edu/pub/tex/bib/fortran1.bib;
6242 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
6243 URL = "",
6244 acknowledgement = ack-nhfb,
6245 remark = "No PDF in NTRL archive. Published in
6246 \booktitle{Communications of the ACM}, {\bf 15}(4)
6247 268--270, April 1972, doi:10.1145/361284.361297.",
6248 }
6249
6250 @TechReport{Manna:1971:MTP,
6251 author = "Zohar Manna",
6252 title = "Mathematical theory of partial correctness",
6253 type = "Technical Report",
6254 number = "STAN-CS-71-189",
6255 institution = inst-STAN-CS,
6256 address = inst-STAN-CS:adr,
6257 pages = "??",
6258 month = jan,
6259 year = "1971",
6260 bibdate = "Fri Nov 7 07:00:05 MST 2025",
6261 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
6262 URL = "http://i.stanford.edu/TR/CS-TR-71-189.html",
6263 abstract = "In this work we show that it is possible to express
6264 most properties regularly observed in algorithms in
6265 terms of 'partial correctness' (i.e., the property that
6266 the final results of the algorithm, if any, satisfy
6267 some given input-output relation). This result is of
6268 special interest since 'partial correctness' has
6269 already been formulated in predicate calculus and in
6270 partial function logic for many classes of
6271 algorithms.",
6272 acknowledgement = ack-nhfb,
6273 pdfpages = "30",
6274 xxnumber = "CS-TR-71-189",
6275 }
6276
6277 @TechReport{Hopcroft:1971:LAM,
6278 author = "John E. Hopcroft",
6279 title = "An $ n \log n $ algorithm for minimizing states in a
6280 finite automaton",
6281 type = "Technical Report",
6282 number = "STAN-CS-71-190",
6283 institution = inst-STAN-CS,
6284 address = inst-STAN-CS:adr,
6285 pages = "??",
6286 month = jan,
6287 year = "1971",
6288 bibdate = "Fri Nov 7 07:00:05 MST 2025",
6289 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
6290 URL = "http://i.stanford.edu/TR/CS-TR-71-190.html",
6291 abstract = "An algorithm is given for minimizing the number of
6292 states in a finite automaton or for determining if two
6293 finite automata are equivalent. The asymptotic running
6294 time of the algorithm is bounded by $ k n \log n $
6295 where $k$ is some constant and $n$ is the number of
6296 states. The constant $k$ depends linearly on the size
6297 of the input alphabet.",
6298 acknowledgement = ack-nhfb,
6299 pdfpages = "16",
6300 xxnumber = "CS-TR-71-190",
6301 }
6302
6303 @TechReport{Lesser:1971:IDE,
6304 author = "Victor R. Lesser",
6305 title = "An introduction to the direct emulation of control
6306 structures by a parallel micro-computer",
6307 type = "Technical Report",
6308 number = "STAN-CS-71-191",
6309 institution = inst-STAN-CS,
6310 address = inst-STAN-CS:adr,
6311 pages = "??",
6312 month = jan,
6313 year = "1971",
6314 bibdate = "Fri Nov 7 07:00:05 MST 2025",
6315 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
6316 URL = "http://i.stanford.edu/TR/CS-TR-71-191.html",
6317 abstract = "This paper is an investigation of the organization of
6318 a parallel micro-computer designed to emulate a wide
6319 variety of sequential and parallel computers. This
6320 micro-computer allows tailoring of its control
6321 structure so that it is appropriate for the particular
6322 computer to be emulated. The control structure of this
6323 micro-computer is dynamically modified by changing the
6324 organization of its data structure for control. The
6325 micro-computer contains six primitive operators which
6326 dynamically manipulate and generate a tree type data
6327 structure for control. This data structure for control
6328 is used as a syntactic framework within which
6329 particular implementations of control concepts, such as
6330 iteration, recursion, co-routines, parallelism,
6331 interrupts, etc., can be easily expressed. The major
6332 features of the control data structure and the
6333 primitive operators are: (1) once the fixed control and
6334 data linkages among processes have been defined, they
6335 need not be rebuilt on subsequent executions of the
6336 control structure; (2) micro-programs may be written so
6337 that they execute independently of the number of
6338 physical processors present and still take advantage of
6339 available processors; (3) control structures for I/O
6340 processes, data-accessing processes, and computational
6341 processes are expressed in a single uniform framework.
6342 An emulator programmed on this micro-computer works as
6343 an iterative two-step process similar to the process of
6344 dynamic compilation or run time macro-expansion. This
6345 dynamic compilation approach to emulation differs
6346 considerably from the conventional approach to
6347 emulation, and provides a unifying approach to the
6348 emulation of a wide variety of sequential and parallel
6349 computers.",
6350 acknowledgement = ack-nhfb,
6351 pdfpages = "40",
6352 xxnumber = "CS-TR-71-191",
6353 }
6354
6355 @TechReport{Hopcroft:1971:LAI,
6356 author = "John E. Hopcroft",
6357 title = "An $ n \log n $ algorithm for isomorphism of planar
6358 triply connected graphs",
6359 type = "Technical Report",
6360 number = "STAN-CS-71-192",
6361 institution = inst-STAN-CS,
6362 address = inst-STAN-CS:adr,
6363 pages = "??",
6364 month = jan,
6365 year = "1971",
6366 bibdate = "Fri Nov 7 07:00:05 MST 2025",
6367 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
6368 URL = "http://i.stanford.edu/TR/CS-TR-71-192.html",
6369 abstract = "It is shown that the isomorphism problem for triply
6370 connected planar graphs can be reduced to the problem
6371 of minimizing states in a finite automaton. By making
6372 use of an $ n \log n $ algorithm for minimizing the
6373 number of states in a finite automaton, an algorithm
6374 for determining whether two planar triply connected
6375 graphs are isomorphic is developed. The asymptotic
6376 growth rate of the algorithm grows as $ n \log n $
6377 where $n$ is the number of vertices in the graph.",
6378 acknowledgement = ack-nhfb,
6379 pdfpages = "10",
6380 xxnumber = "CS-TR-71-192",
6381 }
6382
6383 @TechReport{Schank:1971:IMC,
6384 author = "Roger C. Schank",
6385 title = "Intention, memory, and computer understanding",
6386 type = "Technical Report",
6387 number = "STAN-CS-71-193",
6388 institution = inst-STAN-CS,
6389 address = inst-STAN-CS:adr,
6390 pages = "??",
6391 month = jan,
6392 year = "1971",
6393 bibdate = "Fri Nov 7 07:00:05 MST 2025",
6394 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
6395 URL = "http://i.stanford.edu/TR/CS-TR-71-193.html",
6396 abstract = "Procedures are described for discovering the intention
6397 of a speaker by relating the Conceptual Dependency
6398 representation of the speaker's utterance to the
6399 computer's world model such that simple implications
6400 can be made. These procedures function at levels higher
6401 than that of the sentence by allowing for predictions
6402 based on context and the structure of the memory.
6403 Computer understanding of natural language is shown to
6404 consist of the following parts: assigning a conceptual
6405 representation to an input; relating that
6406 representation to the memory such as to extract the
6407 intention of the speaker; and selecting the correct
6408 response type triggered by such an utterance according
6409 to the situation.",
6410 acknowledgement = ack-nhfb,
6411 pdfpages = "68",
6412 xxnumber = "CS-TR-71-193",
6413 }
6414
6415 @TechReport{Knuth:1971:MUG,
6416 author = "Donald E. Knuth and Richard L. Sites",
6417 title = "{MIX\slash 360} user's guide",
6418 type = "Technical Report",
6419 number = "STAN-CS-71-197",
6420 institution = inst-STAN-CS,
6421 address = inst-STAN-CS:adr,
6422 pages = "??",
6423 day = "1",
6424 month = mar,
6425 year = "1971",
6426 bibdate = "Fri Nov 7 07:00:05 MST 2025",
6427 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
6428 URL = "http://i.stanford.edu/TR/CS-TR-71-197.html;
6429 http://www-db.stanford.edu/TR/CS-TR-71-197.html;
6430 http://www.ncstrl.org:8900/ncstrl/servlet/search?formname=detail&id=oai%3Ancstrlh%3Astan%3ASTAN%2F%2FCS-TR-71-197",
6431 abstract = "MIX/360 is an assembler and simulator for the
6432 hypothetical MIX machine, which is described for
6433 example in Knuth's $ \underline {The Art of Computer
6434 Programming} $, Section 1.3.1. The system contains
6435 several debugging aids to help program construction and
6436 verification.",
6437 acknowledgement = ack-nhfb,
6438 documentid = "oai:ncstrlh:stan:STAN//CS-TR-71-197",
6439 pdfpages = "16",
6440 xxnumber = "CS-TR-71-197",
6441 }
6442
6443 @TechReport{Brent:1971:AFZ,
6444 author = "Richard P. Brent",
6445 title = "Algorithms for Finding Zeros and Extrema of Functions
6446 without Calculating Derivatives",
6447 type = "Technical Report",
6448 number = "STAN-CS-71-198 (AD726170)",
6449 institution = inst-STAN-CS,
6450 address = inst-STAN-CS:adr,
6451 pages = "+ 313",
6452 month = feb,
6453 year = "1971",
6454 bibdate = "Fri Nov 21 14:21:14 2025",
6455 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
6456 URL = "",
6457 acknowledgement = ack-nhfb,
6458 pdfpages = "166",
6459 remark = "No abstract is available. This is the author's thesis.
6460 PDF pages show two physical pages. A revision was
6461 published as \booktitle{Algorithms for Minimization
6462 without Derivatives}, Prentice-Hall, Englewood Cliffs,
6463 NJ, 1973, ISBN 0-486-41998-3.",
6464 }
6465
6466 @TechReport{Staff:1971:BSC,
6467 author = "{Staff}",
6468 title = "Bibliography of {Stanford Computer Science} Reports
6469 1963--1971",
6470 type = "Technical Report",
6471 number = "STAN-CS-71-199 (PB198415)",
6472 institution = inst-STAN-CS,
6473 address = inst-STAN-CS:adr,
6474 pages = "28",
6475 month = feb,
6476 year = "1971",
6477 bibdate = "Fri Nov 21 14:21:14 2025",
6478 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
6479 URL = "",
6480 acknowledgement = ack-nhfb,
6481 }
6482
6483 @TechReport{Herriot:1971:APC,
6484 author = "J. G. Herriot and Christian H. Reinsch",
6485 title = "{ALGOL 60} Procedures for the Calculation of
6486 Interpolating Natural Spline Functions",
6487 type = "Technical Report",
6488 number = "STAN-CS-71-200 (PB198416)",
6489 institution = inst-STAN-CS,
6490 address = inst-STAN-CS:adr,
6491 pages = "ii + 30",
6492 month = feb,
6493 year = "1971",
6494 bibdate = "Fri Nov 21 14:21:14 2025",
6495 bibsource = "https://www.math.utah.edu/pub/bibnet/authors/r/reinsch-christian-h.bib;
6496 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
6497 URL = "",
6498 ZMnumber = "0252.65006",
6499 acknowledgement = ack-nhfb,
6500 author-dates = "Christian H. Reinsch (?? ?? 1932--8 October 2022)",
6501 remark = "No PDF in NTRL archive.",
6502 }
6503
6504 @TechReport{Hopcroft:1971:PTV,
6505 author = "John E. Hopcroft and Robert Endre Tarjan",
6506 title = "Planarity testing in {$ V \log V $} steps: extended
6507 abstract",
6508 type = "Technical Report",
6509 number = "STAN-CS-71-201 (AD722434)",
6510 institution = inst-STAN-CS,
6511 address = inst-STAN-CS:adr,
6512 pages = "??",
6513 month = feb,
6514 year = "1971",
6515 bibdate = "Fri Nov 7 07:00:05 MST 2025",
6516 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
6517 URL = "http://i.stanford.edu/TR/CS-TR-71-201.html",
6518 abstract = "An efficient algorithm is presented for determining
6519 whether or not a given graph is planar. If V is the
6520 number of vertices in the graph, the algorithm requires
6521 time proportional to $ V \log V $ and space
6522 proportional to $V$ when run on a random-access
6523 computer. The algorithm constructs the facial
6524 boundaries of a planar representation without backup,
6525 using extensive list-processing features to speed
6526 computation. The theoretical time bound improves on
6527 that of previously published algorithms. Experimental
6528 evidence indicates that graphs with a few thousand
6529 edges can be tested within seconds.",
6530 acknowledgement = ack-nhfb,
6531 pdfpages = "24",
6532 xxnumber = "CS-TR-71-201",
6533 }
6534
6535 @TechReport{Saal:1971:CS,
6536 author = "Harry J. Saal and William E. Riddle",
6537 title = "Communicating semaphores",
6538 type = "Technical Report",
6539 number = "STAN-CS-71-202 (SLAC-117)",
6540 institution = inst-STAN-CS,
6541 address = inst-STAN-CS:adr,
6542 pages = "??",
6543 month = feb,
6544 year = "1971",
6545 bibdate = "Fri Nov 7 07:00:05 MST 2025",
6546 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
6547 URL = "http://i.stanford.edu/TR/CS-TR-71-202.html",
6548 abstract = "This paper describes two extensions to the semaphore
6549 operators originally introduced by Dijkstra. These
6550 extensions can be used to reduce: (1) the number of
6551 semaphore references; (2) the time spent in critical
6552 sections; and (3) the number of distinct semaphores
6553 required for proper synchronization without greatly
6554 increasing the time required for semaphore operations.
6555 Communicating semaphores may be utilized not only for
6556 synchronization but also for message switching,
6557 resource allocation from pools and as general queueing
6558 mechanisms.",
6559 acknowledgement = ack-nhfb,
6560 pdfpages = "24",
6561 xxnumber = "CS-TR-71-202",
6562 }
6563
6564 @TechReport{Buchanan:1971:HDP,
6565 author = "Bruce G. Buchanan and Joshua Lederberg",
6566 title = "The {Heuristic DENDRAL} program for explaining
6567 empirical data",
6568 type = "Technical Report",
6569 number = "STAN-CS-71-203 (AIM-141, AD730506)",
6570 institution = inst-STAN-CS,
6571 address = inst-STAN-CS:adr,
6572 pages = "??",
6573 month = feb,
6574 year = "1971",
6575 bibdate = "Fri Nov 7 07:00:05 MST 2025",
6576 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
6577 URL = "http://i.stanford.edu/TR/CS-TR-71-203.html",
6578 abstract = "The Heuristic DENDRAL program uses an information
6579 processing model of scientific reasoning to explain
6580 experimental data in organic chemistry. This report
6581 summarizes the organization and results of the program
6582 for computer scientists. The program is divided into
6583 three main parts: planning, structure generation, and
6584 evaluation. The planning phase infers constraints on
6585 the search space from the empirical data input to the
6586 system. The structure generation phase searches a tree
6587 whose termini are models of chemical molecules using
6588 pruning heuristics of various kinds. The evaluation
6589 phase tests the candidate structures against the
6590 original data. Results of the program's analyses of
6591 some test data are discussed.",
6592 acknowledgement = ack-nhfb,
6593 pdfpages = "21",
6594 xxnumber = "CS-TR-71-203",
6595 }
6596
6597 @TechReport{Ingalls:1971:FFE,
6598 author = "Daniel H. H. Ingalls",
6599 title = "{FETE}: a {Fortran} execution time estimator",
6600 type = "Technical Report",
6601 number = "STAN-CS-71-204 (PB198510)",
6602 institution = inst-STAN-CS,
6603 address = inst-STAN-CS:adr,
6604 pages = "??",
6605 month = feb,
6606 year = "1971",
6607 bibdate = "Fri Nov 7 07:00:05 MST 2025",
6608 bibsource = "https://www.math.utah.edu/pub/tex/bib/fortran1.bib;
6609 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
6610 URL = "http://i.stanford.edu/TR/CS-TR-71-204.html",
6611 abstract = "If you want to live cheaply, you must make a list of
6612 how much money is spent on each thing every day. This
6613 enumeration will quickly reveal the principal areas of
6614 waste. The same method works for saving computer time.
6615 Originally, one had to put his own timers and counters
6616 into a program to determine the distribution of time
6617 spent in each part. Recently several automated systems
6618 have appeared which either insert counters
6619 automatically or interrupt the program during its
6620 execution to produce the tallies. FETE is a system of
6621 the former type which has two outstanding
6622 characteristics: it is very easy to implement and it is
6623 very easy to use. By demonstrating such convenience, it
6624 should establish execution timing as a standard tool in
6625 program development.",
6626 acknowledgement = ack-nhfb,
6627 pdfpages = "14",
6628 xxnumber = "CS-TR-71-204",
6629 }
6630
6631 @TechReport{Milner:1971:ADS,
6632 author = "Robin Milner",
6633 title = "An algebraic definition of simulation between
6634 programs",
6635 type = "Technical Report",
6636 number = "STAN-CS-71-205 (AIM-142, AD731383)",
6637 institution = inst-STAN-CS,
6638 address = inst-STAN-CS:adr,
6639 pages = "??",
6640 month = feb,
6641 year = "1971",
6642 bibdate = "Fri Nov 7 07:00:05 MST 2025",
6643 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
6644 URL = "http://i.stanford.edu/TR/CS-TR-71-205.html",
6645 abstract = "A simulation relation between programs is defined
6646 which is quasi-ordering. Mutual simulation is then an
6647 equivalence relation, and by dividing out by it we
6648 abstract from a program such details as how the
6649 sequencing is controlled and how data is represented.
6650 The equivalence classes are approximations to the
6651 algorithms which are realized, or expressed, by their
6652 member programs. A technique is given and illustrated
6653 for proving simulation and equivalence of programs;
6654 there is an analogy with Floyd's technique for proving
6655 correctness of programs. Finally, necessary and
6656 sufficient conditions for simulation are given.",
6657 acknowledgement = ack-nhfb,
6658 pdfpages = "23",
6659 subject-dates = "Robert W. Floyd (8 June 1936--25 September 2001)",
6660 xxnumber = "CS-TR-71-205",
6661 }
6662
6663 @TechReport{Knuth:1971:MAA,
6664 author = "Donald E. Knuth",
6665 title = "Mathematical Analysis of Algorithms",
6666 type = "Technical Report",
6667 number = "STAN-CS-71-206 (AD726158)",
6668 institution = inst-STAN-CS,
6669 address = inst-STAN-CS:adr,
6670 pages = "iii + 26",
6671 month = mar,
6672 year = "1971",
6673 bibdate = "Fri Nov 21 14:21:14 2025",
6674 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
6675 URL = "",
6676 abstract = "This report consists of the Texts of lectures
6677 presented to the International Congress of
6678 Mathematicians in 1970 and to the IFIP Congress in
6679 1971. The lectures are essentially sales pitches
6680 intended to popularize work in algorithmic analysis, a
6681 field of study which involves numerous applications of
6682 discrete mathematics to computer science. Both lectures
6683 attempt To indicate the flavor of the general field by
6684 considering particular applications in detail. The
6685 ``mathematical'' lecture deals with the problem of
6686 calculating greatest common divisors, and includes a
6687 presentation of a new algorithm which lowers the
6688 asymptotic running time for gcd of $n$-bit integers
6689 from $ n^2 $ to $ n^{1 + \epsilon } $. The
6690 ``information processing'' lecture deals with the
6691 problems of in situ permutation and selection of the
6692 $t$-th largest element, emphasizing techniques for
6693 analyzing particular algorithms which have appeared in
6694 the literature.",
6695 acknowledgement = ack-nhfb,
6696 pdfpages = "36",
6697 }
6698
6699 @TechReport{Hopcroft:1971:EAG,
6700 author = "John E. Hopcroft and Robert Endre Tarjan",
6701 title = "Efficient algorithms for graph manipulation",
6702 type = "Technical Report",
6703 number = "STAN-CS-71-207 (AD726169)",
6704 institution = inst-STAN-CS,
6705 address = inst-STAN-CS:adr,
6706 pages = "??",
6707 month = mar,
6708 year = "1971",
6709 bibdate = "Fri Nov 7 07:00:05 MST 2025",
6710 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
6711 URL = "http://i.stanford.edu/TR/CS-TR-71-207.html",
6712 abstract = "Efficient algorithms are presented for partitioning a
6713 graph into connected components, biconnected components
6714 and simple paths. The algorithm for partitioning of a
6715 graph into simple paths is iterative and each iteration
6716 produces a new path between two vertices already on
6717 paths. (The start vertex can be specified dynamically.)
6718 If V is the number of vertices and E is the number of
6719 edges each algorithm requires time and space
6720 proportional to max(V,E) when executed on a random
6721 access computer.",
6722 acknowledgement = ack-nhfb,
6723 pdfpages = "24",
6724 xxnumber = "CS-TR-71-207",
6725 }
6726
6727 @TechReport{George:1971:CIF,
6728 author = "John Alan George",
6729 title = "Computer Implementation of the Finite Element Method",
6730 type = "Technical Report",
6731 number = "STAN-CS-71-208 (AD726171)",
6732 institution = inst-STAN-CS,
6733 address = inst-STAN-CS:adr,
6734 pages = "vi + 222",
6735 month = feb,
6736 year = "1971",
6737 bibdate = "Fri Nov 21 14:21:14 2025",
6738 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
6739 URL = "",
6740 acknowledgement = ack-nhfb,
6741 advisor = "George E. Forsythe",
6742 pdfpages = "228",
6743 remark = "This is the author's thesis. No abstract is
6744 available.",
6745 }
6746
6747 @TechReport{McCarthy:1971:PTR,
6748 author = "John McCarthy and Arthur L. Samuel and Edward A.
6749 Feigenbaum and Joshua Lederberg",
6750 title = "Project technical report",
6751 type = "Technical Report",
6752 number = "STAN-CS-71-209 (AIM-143, AD724867)",
6753 institution = inst-STAN-CS,
6754 address = inst-STAN-CS:adr,
6755 pages = "??",
6756 month = mar,
6757 year = "1971",
6758 bibdate = "Fri Nov 7 07:00:05 MST 2025",
6759 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
6760 URL = "http://i.stanford.edu/TR/CS-TR-71-209.html",
6761 abstract = "An overview is presented of current research at
6762 Stanford in artificial intelligence and heuristic
6763 programming. This report is largely the text of a
6764 proposal to the Advanced Research Projects Agency for
6765 fiscal years 1972-73.",
6766 acknowledgement = ack-nhfb,
6767 author-dates = "John McCarthy (4 September 1927--24 October 2011);
6768 Arthur Lee Samuel (5 December 1901--29 July 1990)",
6769 pdfpages = "90",
6770 xxnumber = "CS-TR-71-209",
6771 }
6772
6773 @TechReport{Purdy:1971:APC,
6774 author = "J. Gerry Purdy",
6775 title = "{ACCESS}: a program for the catalog and access of
6776 information",
6777 type = "Technical Report",
6778 number = "STAN-CS-71-210 (PB201917)",
6779 institution = inst-STAN-CS,
6780 address = inst-STAN-CS:adr,
6781 pages = "??",
6782 month = mar,
6783 year = "1971",
6784 bibdate = "Fri Nov 7 07:00:05 MST 2025",
6785 bibsource = "http://www.math.utah.edu/pub/tex/bib/fortran1.bib;
6786 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
6787 URL = "http://i.stanford.edu/TR/CS-TR-71-210.html",
6788 abstract = "ACCESS is a program for the catalog and access of
6789 information. The program is primarily designed for and
6790 intended to handle a personal library, although larger
6791 applications are possible. ACCESS produces a listing of
6792 all entries by locator code (so one knows where to find
6793 the entry in his library), a listing of entry titles by
6794 user-specified category codes, and a keyword-in-context
6795 KWIC listing (each keyword specified by the user).
6796 ACCESS is presently programmed in FORTRAN and operates
6797 on any IBM System/360 under OS (it uses the IBM
6798 SORT/MERGE package). It is anticipated a machine
6799 language version (soon to be implemented) will greatly
6800 decrease the running time of the program.",
6801 acknowledgement = ack-nhfb,
6802 pdfpages = "30",
6803 xxnumber = "CS-TR-71-210",
6804 }
6805
6806 @TechReport{Malcolm:1971:ARP,
6807 author = "Michael A. Malcolm",
6808 title = "Algorithms to reveal properties of floating-point
6809 arithmetic",
6810 type = "Technical Report",
6811 number = "STAN-CS-71-211 (AD727104)",
6812 institution = inst-STAN-CS,
6813 address = inst-STAN-CS:adr,
6814 pages = "??",
6815 month = mar,
6816 year = "1971",
6817 bibdate = "Fri Nov 7 07:00:05 MST 2025",
6818 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
6819 URL = "http://i.stanford.edu/TR/CS-TR-71-211.html",
6820 abstract = "Two algorithms are presented in the form of Fortran
6821 subroutines. Each subroutine computes the radix and
6822 number of digits of the floating-point numbers and
6823 whether rounding or chopping is done by the machine on
6824 which it is run. The methods are shown to work on any
6825 `reasonable' floating-point computer.",
6826 acknowledgement = ack-nhfb,
6827 pdfpages = "10",
6828 xxnumber = "CS-TR-71-211",
6829 }
6830
6831 @TechReport{Morgana:1971:TMR,
6832 author = "Maria Aurora Morgana",
6833 title = "Time and memory requirements for solving linear
6834 systems",
6835 type = "Technical Report",
6836 number = "STAN-CS-71-212 (AD727107)",
6837 institution = inst-STAN-CS,
6838 address = inst-STAN-CS:adr,
6839 pages = "??",
6840 month = mar,
6841 year = "1971",
6842 bibdate = "Fri Nov 7 07:00:05 MST 2025",
6843 bibsource = "http://www.math.utah.edu/pub/tex/bib/fortran1.bib;
6844 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
6845 URL = "http://i.stanford.edu/TR/CS-TR-71-212.html",
6846 abstract = "The Computer Science Department program library
6847 contains a number of ALGOL W procedures and FORTRAN
6848 subroutines which can be used to solve systems of
6849 linear equations. This report describes the results of
6850 tests to determine the amount of time and memory
6851 required to solve systems of various orders.",
6852 acknowledgement = ack-nhfb,
6853 pdfpages = "9",
6854 xxnumber = "CS-TR-71-212",
6855 }
6856
6857 @TechReport{Tarjan:1971:SPS,
6858 author = "Robert Endre Tarjan",
6859 title = "The switchyard problem: sorting using networks of
6860 queues and stacks",
6861 type = "Technical Report",
6862 number = "STAN-CS-71-213 (PB201629)",
6863 institution = inst-STAN-CS,
6864 address = inst-STAN-CS:adr,
6865 pages = "??",
6866 month = apr,
6867 year = "1971",
6868 bibdate = "Fri Nov 7 07:00:05 MST 2025",
6869 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
6870 URL = "http://i.stanford.edu/TR/CS-TR-71-213.html",
6871 abstract = "The problem of sorting a sequence of numbers using a
6872 network of queues and stacks is presented. A
6873 characterization of sequences sortable using parallel
6874 queues is given, and partial characterizations of
6875 sequences sortable using parallel stacks and networks
6876 of queues are given.",
6877 acknowledgement = ack-nhfb,
6878 pdfpages = "15",
6879 xxnumber = "CS-TR-71-213",
6880 }
6881
6882 @TechReport{Graham:1971:CTC,
6883 author = "Ronald L. Graham and Donald E. Knuth and T. S.
6884 Motzkin",
6885 title = "Complements and Transitive Closures",
6886 type = "Technical Report",
6887 number = "STAN-CS-71-214 (AD727108)",
6888 institution = inst-STAN-CS,
6889 address = inst-STAN-CS:adr,
6890 pages = "13",
6891 month = apr,
6892 year = "1971",
6893 bibdate = "Fri Nov 21 14:21:14 2025",
6894 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
6895 URL = "",
6896 abstract = "The complement of the transitive closure of the
6897 complement of a transitive relation is transitive. We
6898 prove this fact in three ways, analyze the underlying
6899 structure and consider various refinements and
6900 applications.",
6901 acknowledgement = ack-nhfb,
6902 author-dates = "Ronald Lewis Graham (31 October 1935--6 July 2020)",
6903 remark = "Published in \booktitle{Discrete Mathematics}, {\bf 2}
6904 17--29, 1972. NTIS PDF file is that of the journal
6905 article.",
6906 }
6907
6908 @TechReport{Malcolm:1971:PRP,
6909 author = "Michael A. Malcolm",
6910 title = "{PL360} (Revised) A Programming Language for the {IBM
6911 360}",
6912 type = "Technical Report",
6913 number = "STAN-CS-71-215 (AD727115)",
6914 institution = inst-STAN-CS,
6915 address = inst-STAN-CS:adr,
6916 pages = "v + 94",
6917 month = may,
6918 year = "1971",
6919 bibdate = "Thu Jan 11 16:35:00 2024",
6920 bibsource = "https://www.math.utah.edu/pub/bibnet/authors/w/wirth-niklaus.bib;
6921 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
6922 URL = "http://infolab.stanford.edu/pub/cstr/reports/cs/tr/71/215/CS-TR-71-215.pdf;
6923 https://bitsavers.org/pdf/stanford/cs_techReports/STAN-CS-71-215_PL360_Rev_May72.pdf",
6924 abstract = "In 1968, N. Wirth (Jan. JACM) published a formal
6925 description of PL360, a programming language designed
6926 specifically for the IBM 360. PL360 has an appearance
6927 similar to that of Algol, but it provides the
6928 facilities of a symbolic machine language. Since 1968,
6929 numerous extensions and modifications have been made to
6930 the PL360 compiler which was originally designed and
6931 implemented by N. Wirth and J. Wells. Interface and
6932 input--output subroutines have been written which allow
6933 the use of PL360 under OS, DOS, MTS and Orvyl.\par
6934
6935 A formal description of PL360 as it is presently
6936 implemented is given. The description of the language
6937 is followed by sections on the use of PL360 under
6938 various operating systems, namely OS, DOS and MTS.
6939 Instructions on how to use the PL360 compiler and PL360
6940 programs in an interactive mode under the Orvyl
6941 time-sharing monitor are also included.",
6942 acknowledgement = ack-nhfb,
6943 pdfpages = "112",
6944 xxnumber = "CS-TR-71-215",
6945 }
6946
6947 @TechReport{Kling:1971:RAA,
6948 author = "Robert Elliot Kling",
6949 title = "Reasoning by Analogy with Applications to Heuristics
6950 Problem Solving: a Case Study",
6951 type = "Technical Report",
6952 number = "STAN-CS-71-216 (AIM-147, AD732457)",
6953 institution = inst-STAN-CS,
6954 address = inst-STAN-CS:adr,
6955 pages = "ix + 191",
6956 month = aug,
6957 year = "1971",
6958 bibdate = "Fri Nov 21 14:21:14 2025",
6959 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
6960 URL = "",
6961 abstract = "An information-processing approach to reasoning by
6962 analogy is developed that promises to increase the
6963 efficiency of heuristic deductive problem-solving
6964 systems. When a deductive problem-solving system
6965 accesses a large set of axioms more than sufficient to
6966 solve a particular problem, it will often create many
6967 irrelevant deductions that are derived from the
6968 unnecessary axioms. These irrelevant deductions may be
6969 quite numerous and saturate the memory of the problem
6970 solver before it solves the problem. At the current
6971 state of the art, the most complex problems solved by
6972 automatic procedures require less than two dozen axioms
6973 to solve. A data base twice this size is sufficient to
6974 render any but the simplest problem unsolvable. In
6975 general, there is no decision procedure which can be
6976 used to restrict a data base to a set of necessary
6977 axioms. Here, an analogy with some previously solved
6978 problem and a new unsolved problem is used to restrict
6979 the data base to a small set of appropriate
6980 axioms.\par
6981
6982 This procedure (ZORBA) is studied in detail for a
6983 resolution theorem proving system. A set of algorithms
6984 (ZORBA-I) which automatically generates an analogy
6985 between a new unproved theorem, $ T_A $, and a
6986 previously proved theorem, $T$, is described in detail.
6987 ZORBA-I is implemented in LISP on a PDP-10. \ldots{}",
6988 acknowledgement = ack-nhfb,
6989 advisor = "Edward Feigenbaum",
6990 pdfpages = "212",
6991 }
6992
6993 @TechReport{Ashcroft:1971:DPM,
6994 author = "Edward A. Ashcroft and Zohar Manna and Amir Pneuli",
6995 title = "Decidable properties of monadic functional schemas",
6996 type = "Technical Report",
6997 number = "STAN-CS-71-217 (AIM-148, AD731730)",
6998 institution = inst-STAN-CS,
6999 address = inst-STAN-CS:adr,
7000 pages = "??",
7001 month = jul,
7002 year = "1971",
7003 bibdate = "Fri Nov 7 07:00:05 MST 2025",
7004 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
7005 URL = "http://i.stanford.edu/TR/CS-TR-71-217.html",
7006 abstract = "We define a class of (monadic) functional schemas
7007 which properly includes 'Ianov' flowchart schemas. We
7008 show that the termination, divergence and freedom
7009 problems for functional schemas are decidable. Although
7010 it is possible to translate a large class of non-free
7011 functional schemas into equivalent free functional
7012 schemas, we show that this cannot be done in general.
7013 We show also that the equivalence problem for free
7014 functional schemas is decidable. Most of the results
7015 are obtained from well-known results in Formal
7016 Languages and Automata Theory.",
7017 acknowledgement = ack-nhfb,
7018 pdfpages = "11",
7019 xxnumber = "CS-TR-71-217",
7020 }
7021
7022 @TechReport{deBruijn:1971:AHP,
7023 author = "N. G. de Bruijn and Donald E. Knuth and S. O. Rice",
7024 title = "The Average Height of Plane Trees",
7025 type = "Technical Report",
7026 number = "STAN-CS-71-218 (AD731038)",
7027 institution = inst-STAN-CS,
7028 address = inst-STAN-CS:adr,
7029 pages = "iv + 7",
7030 month = may,
7031 year = "1971",
7032 bibdate = "Fri Nov 21 14:21:14 2025",
7033 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
7034 URL = "",
7035 abstract = "An asymptotic expression for the average height of a
7036 planted plane tree is derived, based on an asymptotic
7037 series for sums such as $ \sum_{k \geq 1} \binom {2
7038 n}{n + k} d(k) $ and $ \sum_{k \geq 1} \exp ( - k^2 /
7039 2) d(k) $, where $ d(n) $ is the number of divisors of
7040 $n$.",
7041 acknowledgement = ack-nhfb,
7042 keywords = "asymptotic series; ballot problem; divisor function;
7043 gamma function; height of tree; Planted plane tree;
7044 random walk; zeta function",
7045 pdfpages = "11",
7046 }
7047
7048 @TechReport{Quam:1971:CCP,
7049 author = "Lynn H. Quam",
7050 title = "Computer Comparison of Pictures",
7051 type = "Technical Report",
7052 number = "STAN-CS-71-219 (AIM-144)",
7053 institution = inst-STAN-CS,
7054 address = inst-STAN-CS:adr,
7055 pages = "x + 118",
7056 month = may,
7057 year = "1971",
7058 bibdate = "Fri Nov 21 14:21:14 2025",
7059 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
7060 URL = "https://apps.dtic.mil/sti/tr/pdf/AD0785172.pdf",
7061 abstract = "This dissertation reports the development of digital
7062 computer techniques for detecting changes in scenes by
7063 normalizing and comparing pictures which were taken
7064 from different camera positions and under different
7065 conditions of illumination. The pictures are first
7066 geometrically normalized to a common point of view.
7067 Then they are photometrically normalized to eliminate
7068 the differences due to different illumination, camera
7069 characteristics, and reflectance properties of the
7070 scene due to different sun and view angles. These
7071 pictures are then geometrically registered by
7072 maximizing the cross correlation between areas in them.
7073 The final normalized and registered pictures are then
7074 differenced point by point.\par
7075
7076 The geometric normalization techniques require
7077 relatively accurate geometric models for the camera and
7078 the scene, and static spatial features must be present
7079 in the pictures to allow precise geometric alignment
7080 using the technique of cross correlation
7081 maximation.\par
7082
7083 Photometric normalization also requires a relatively
7084 accurate model for the photometric response of the
7085 camera, a reflective model for the scene I reflectance
7086 as a function of the illumination view, and phase
7087 angles, and some assumptions about the kinds of
7088 reflectance changes which are to be detected.\par
7089
7090 These techniques have been incorporated in a system for
7091 comparing Mariner 1971 pictures of Mars to detect
7092 variable surface phenomena as well as color and
7093 polarization differences. The system has been tested
7094 using Mariner 6 and 7 pictures of Mars.\par
7095
7096 Although the techniques described in this dissertation
7097 were developed for Mars pictures, their use is not
7098 limited to this application. Various parts of this
7099 software package, which was developed for interactive
7100 use on the time-sharing system of the Stanford
7101 Artificial Intelligence Laboratory, are currently being
7102 applied to other scenery.",
7103 acknowledgement = ack-nhfb,
7104 advisor = "John McCarthy",
7105 pdfpages = "131",
7106 remark = "This is the author's thesis.",
7107 }
7108
7109 @TechReport{Stone:1971:DME,
7110 author = "Harold S. Stone",
7111 title = "Dynamic Memories with Enhanced Data Access",
7112 type = "Technical Report",
7113 number = "STAN-CS-71-220 (CSL-14, AD727116)",
7114 institution = inst-STAN-CS,
7115 address = inst-STAN-CS:adr,
7116 pages = "vii + 29 + 5",
7117 month = jan,
7118 year = "1971",
7119 bibdate = "Fri Nov 21 14:21:14 2025",
7120 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
7121 URL = "",
7122 abstract = "Dynamic memories are commonly constructed as
7123 circulating shift registers, and thus have access times
7124 that are proportional to the size of memory. When each
7125 word in a dynamic memory is connected to $r$ words, $ r
7126 > 2$, access time can be proportional to the base $r$
7127 logarithm of the size of memory. This paper describes a
7128 memory that achieves minimum access time for $ r = 2$.
7129 The memory can also be operated in an efficient binary
7130 search mode. Slight variations of the interconnection
7131 patterns lead to a memory that is well suited for FFT
7132 and certain matrix computations,",
7133 acknowledgement = ack-nhfb,
7134 pdfpages = "45",
7135 }
7136
7137 @TechReport{Buchanan:1971:HPS,
7138 author = "Bruce G. Buchanan and Edward A. Feigenbaum and Joshua
7139 Lederberg",
7140 title = "A heuristic programming study of theory formation in
7141 science",
7142 type = "Technical Report",
7143 number = "STAN-CS-71-221 (AIM-145, AD731729)",
7144 institution = inst-STAN-CS,
7145 address = inst-STAN-CS:adr,
7146 pages = "??",
7147 month = jul,
7148 year = "1971",
7149 bibdate = "Fri Nov 7 07:00:05 MST 2025",
7150 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
7151 URL = "http://i.stanford.edu/TR/CS-TR-71-221.html",
7152 abstract = "The Meta-DENDRAL program is a vehicle for studying
7153 problems of theory formation in science. The general
7154 strategy of Meta-DENDRAL is to reason from data to
7155 plausible generalizations and then to organize the
7156 generalizations into a unified theory. Three main
7157 subproblems are discussed: (1) explain the experimental
7158 data for each individual chemical structure, (2)
7159 generalize the results from each structure to all
7160 structures, and (3) organize the generalizations into a
7161 unified theory. The program is built upon the concepts
7162 and programmed routines already available in the
7163 Heuristic DENDRAL performance program, but goes beyond
7164 the performance program in attempting to formulate the
7165 theory which the performance program will use.",
7166 acknowledgement = ack-nhfb,
7167 pdfpages = "44",
7168 xxnumber = "CS-TR-71-221",
7169 }
7170
7171 @TechReport{Meyers:1971:LRT,
7172 author = "W. J. Meyers",
7173 title = "Linear Representation of Tree Structure (a
7174 Mathematical Theory of Parenthesis-Free Notations)",
7175 type = "Technical Report",
7176 number = "STAN-CS-71-222 (PB235417/AS)",
7177 institution = inst-STAN-CS,
7178 address = inst-STAN-CS:adr,
7179 pages = "245",
7180 month = jun,
7181 year = "1971",
7182 bibdate = "Fri Nov 21 14:21:14 2025",
7183 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
7184 URL = "",
7185 acknowledgement = ack-nhfb,
7186 remark = "This is the author's thesis. No PDF in NTRL archive.",
7187 }
7188
7189 @TechReport{Graham:1971:PLB,
7190 author = "Susan Graham",
7191 title = "Precedence Languages and Bounded Right Context
7192 Languages",
7193 type = "Technical Report",
7194 number = "STAN-CS-71-223 (PB203429)",
7195 institution = inst-STAN-CS,
7196 address = inst-STAN-CS:adr,
7197 pages = "192",
7198 month = jul,
7199 year = "1971",
7200 bibdate = "Fri Nov 21 14:21:14 2025",
7201 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
7202 URL = "",
7203 acknowledgement = ack-nhfb,
7204 remark = "This is the author's thesis. No PDF in NTRL archive.",
7205 }
7206
7207 @TechReport{Ershov:1971:PP,
7208 author = "Andrei P. Ershov",
7209 title = "Parallel programming",
7210 type = "Technical Report",
7211 number = "STAN-CS-71-224 (AIM-146, PB212183)",
7212 institution = inst-STAN-CS,
7213 address = inst-STAN-CS:adr,
7214 pages = "15",
7215 month = jul,
7216 year = "1971",
7217 bibdate = "Fri Nov 7 07:00:05 MST 2025",
7218 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
7219 URL = "http://i.stanford.edu/TR/CS-TR-71-224.html",
7220 abstract = "This report is based on lectures given at Stanford
7221 University by Dr. Ershov in November, 1970.",
7222 acknowledgement = ack-nhfb,
7223 pdfpages = "16",
7224 xxnumber = "CS-TR-71-224",
7225 }
7226
7227 @TechReport{Bjorck:1971:NMC,
7228 author = "{\AA}ke Bj{\"o}rck and Gene H. Golub",
7229 title = "Numerical methods for computing angles between linear
7230 subspaces",
7231 type = "Technical Report",
7232 number = "STAN-CS-71-225 (PB203344)",
7233 institution = inst-STAN-CS,
7234 address = inst-STAN-CS:adr,
7235 pages = "30",
7236 month = jul,
7237 year = "1971",
7238 bibdate = "Fri Nov 7 07:00:05 MST 2025",
7239 bibsource = "https://www.math.utah.edu/pub/bibnet/authors/g/golub-gene-h.bib;
7240 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
7241 URL = "http://i.stanford.edu/TR/CS-TR-71-225.html",
7242 abstract = "Assume that two subspaces $F$ and $G$ of unitary space
7243 are defined as the ranges (or nullspaces) of given
7244 rectangular matrices $A$ and $B$. Accurate numerical
7245 methods are developed for computing the principal
7246 angles $ \theta_k (F, G) $ and orthogonal sets of
7247 principal vectors $ u_k \ \epsilon F $ and $ v_k
7248 \epsilon G $, $ k = 1, 2, \ldots {}, q = \dim (G) \leq
7249 \dim (F)$. An important application in statistics is
7250 computing the canonical correlations $ \sigma_k = \cos
7251 \theta_k $ between two sets of variates. A perturbation
7252 analysis shows that the condition number for $ \theta_k
7253 $ essentially is $ \max (\kappa (A), \kappa (B)) $,
7254 where $ \kappa $ denotes the condition number of a
7255 matrix. The algorithms are based on a preliminary $ Q
7256 R$-factorization of $A$ and $B$ (or $ A^H$ and $ B^H
7257 $), for which either the method of Householder
7258 transformations (HT) or the modified Gram--Schmidt
7259 method (MGS) is used. Then $ \cos \theta_k$ and $ \sin
7260 \theta_k$ are computed as the singular values of
7261 certain related matrices. Experimental results are
7262 given, which indicates that MGS gives $ \theta_k $ with
7263 equal precision and fewer arithmetic operations than
7264 HT. However, HT gives principal vectors, which are
7265 orthogonal to working accuracy, which is not in general
7266 true for MGS. Finally the case when $A$ and\slash or
7267 $B$ are rank deficient is discussed.",
7268 acknowledgement = ack-nhfb,
7269 author-dates = "Gene Howard Golub (February 29, 1932--November 16,
7270 2007)",
7271 pdfpages = "33",
7272 xxnumber = "CS-TR-71-225",
7273 }
7274
7275 @TechReport{George:1971:SSP,
7276 author = "James E. George",
7277 title = "{SIMPLE}: a simple precedence translator writing
7278 system",
7279 type = "Technical Report",
7280 number = "STAN-CS-71-226 (SLAC-133)",
7281 institution = inst-STAN-CS,
7282 address = inst-STAN-CS:adr,
7283 pages = "??",
7284 month = jul,
7285 year = "1971",
7286 bibdate = "Fri Nov 7 07:00:05 MST 2025",
7287 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
7288 URL = "http://i.stanford.edu/TR/CS-TR-71-226.html",
7289 abstract = "SIMPLE is a translator writing system composed of a
7290 simple precedence syntax analyzer and a semantic
7291 constructor and is implemented in PL/I. It provides an
7292 error diagnostic and recovery mechanism for any system
7293 implemented using SIMPLE. The removal of precedence
7294 conflicts is discussed in detail with several examples.
7295 The utilization of SIMPLE is illustrated by defining a
7296 command language meta system for the construction of
7297 scanners for a wide variety of command oriented
7298 languages. This meta system is illustrated by defining
7299 commands from several text editors.",
7300 acknowledgement = ack-nhfb,
7301 pdfpages = "98",
7302 xxnumber = "CS-TR-71-226",
7303 }
7304
7305 @TechReport{George:1971:GGE,
7306 author = "James E. George",
7307 title = "{GEMS} --- a Graphical Experimental Meta System",
7308 type = "Technical Report",
7309 number = "STAN-CS-71-227 (SLAC-134)",
7310 institution = inst-STAN-CS,
7311 address = inst-STAN-CS:adr,
7312 pages = "184",
7313 month = jul,
7314 year = "1971",
7315 bibdate = "Fri Nov 21 14:21:14 2025",
7316 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
7317 URL = "",
7318 acknowledgement = ack-nhfb,
7319 remark = "This is the author's thesis. No PDF in NTRL archive.",
7320 }
7321
7322 @TechReport{Kaufman:1971:FMA,
7323 author = "Linda C. Kaufman",
7324 title = "Function minimization and automatic therapeutic
7325 control",
7326 type = "Technical Report",
7327 number = "STAN-CS-71-228 (PB203343)",
7328 institution = inst-STAN-CS,
7329 address = inst-STAN-CS:adr,
7330 pages = "??",
7331 month = jul,
7332 year = "1971",
7333 bibdate = "Fri Nov 7 07:00:05 MST 2025",
7334 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
7335 URL = "http://i.stanford.edu/TR/CS-TR-71-228.html",
7336 acknowledgement = ack-nhfb,
7337 pdfpages = "38",
7338 remark = "No abstract is available.",
7339 xxnumber = "CS-TR-71-228",
7340 }
7341
7342 @TechReport{Lee:1971:VSN,
7343 author = "Erastus H. Lee and George E. Forsythe",
7344 title = "Variational study of nonlinear spline curves",
7345 type = "Technical Report",
7346 number = "STAN-CS-71-229 (AD732766)",
7347 institution = inst-STAN-CS,
7348 address = inst-STAN-CS:adr,
7349 pages = "??",
7350 month = aug,
7351 year = "1971",
7352 bibdate = "Fri Nov 7 07:00:05 MST 2025",
7353 bibsource = "https://www.math.utah.edu/pub/bibnet/authors/f/forsythe-george-elmer.bib;
7354 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
7355 URL = "http://i.stanford.edu/TR/CS-TR-71-229.html",
7356 abstract = "This is an exposition of the variational and
7357 differential properties of nonlinear spline curves,
7358 based on the Euler-Bernoulli theory for the bending of
7359 thin beams or elastica. For both open and closed
7360 splines through prescribed nodal points in the
7361 Euclidean plane, various types of nodal constraints are
7362 considered, and the corresponding algebraic and
7363 differential equations relating curvature, angle, arc
7364 length, and tangential force are derived in a simple
7365 manner. The results for closed splines are apparently
7366 new, and they cannot be derived by the consideration of
7367 a constrained conservative system. There is a survey of
7368 the scanty recent literature.",
7369 acknowledgement = ack-nhfb,
7370 author-dates = "George Elmer Forsythe (8 January 1917--9 April 1972)",
7371 pdfpages = "27",
7372 xxnumber = "CS-TR-71-229",
7373 }
7374
7375 @TechReport{Sites:1971:ARM,
7376 author = "Richard L. Sites",
7377 title = "{ALGOL} With Reference Manual",
7378 type = "Technical Report",
7379 number = "STAN-CS-71-230 (PB203601)",
7380 institution = inst-STAN-CS,
7381 address = inst-STAN-CS:adr,
7382 pages = "141",
7383 month = aug,
7384 year = "1971",
7385 bibdate = "Fri Nov 21 14:21:14 2025",
7386 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
7387 URL = "",
7388 acknowledgement = ack-nhfb,
7389 }
7390
7391 @TechReport{Schmidt:1971:SRT,
7392 author = "Rodney A. {Schmidt, Jr.}",
7393 title = "A Study of the Real-Time Control of a Computer Driven
7394 Vehicle",
7395 type = "Technical Report",
7396 number = "STAN-CS-71-231 (AIM-149, AD732644)",
7397 institution = inst-STAN-CS,
7398 address = inst-STAN-CS:adr,
7399 pages = "iv + 164",
7400 month = aug,
7401 year = "1971",
7402 bibdate = "Fri Nov 21 14:21:14 2025",
7403 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
7404 URL = "",
7405 abstract = "Vehicle control by the computer analysis of visual
7406 images is investigated. The areas of guidance,
7407 navigation, and incident avoidance are considered. A
7408 television camera is used as the prime source of visual
7409 image data.\par
7410
7411 In the guidance system developed for an experimental
7412 vehicle, visual data is used to gain information about
7413 the vehicle system dynamics, as well as to guide the
7414 vehicle. This information is used in real time to
7415 improve performance of the non-linear, time-varying
7416 vehicle system.\par
7417
7418 A scheme for navigation by pilotage through the
7419 recognition of two dimensional scenes is developed. A
7420 method is proposed to link this to a computer-modelled
7421 map in order to make journeys.\par
7422
7423 Various difficulties in avoiding anomalous incidents in
7424 the automatic control of automobiles are discussed,
7425 together with suggestions for the application of this
7426 study to remote exploration vehicles or industrial
7427 automation.",
7428 acknowledgement = ack-nhfb,
7429 pdfpages = "172",
7430 remark = "This is the author's {Ph.D.} thesis, submitted May
7431 1971.",
7432 }
7433
7434 @TechReport{Moler:1971:AGM,
7435 author = "Cleve B. Moler and Gilbert W. Stewart",
7436 title = "An algorithm for the generalized matrix eigenvalue
7437 problem {$ A x = \lambda B x $}",
7438 type = "Technical Report",
7439 number = "STAN-CS-71-232 (AD733073, CNA-32)",
7440 institution = inst-STAN-CS,
7441 address = inst-STAN-CS:adr,
7442 pages = "ii + 50",
7443 month = oct,
7444 year = "1971",
7445 bibdate = "Sat Apr 07 09:36:51 2007",
7446 bibsource = "https://www.math.utah.edu/pub/bibnet/authors/m/moler-cleve-b.bib;
7447 https://www.math.utah.edu/pub/bibnet/authors/s/stewart-gilbert-w.bib;
7448 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
7449 note = "Issued jointly as report CNA 32 by the Center for
7450 Numerical Analysis, the University of Texas at
7451 Austin.",
7452 URL = "https://apps.dtic.mil/sti/tr/pdf/AD0746896.pdf",
7453 abstract = "A new method, called the $ Q Z $ algorithm, solution
7454 of the matrix eigenvalue problem $ A x = \lambda B x $
7455 with general square matrices $A$ and $B$. Particular
7456 attention is paid to the degeneracies which result when
7457 $B$ is singular. No inversions of $B$ or its
7458 submatrices are used. The algorithm is a generalization
7459 of the $ Q R $ algorithm, and reduces to it when $ B =
7460 I$. A Fortran program and some illustrative examples
7461 are included.",
7462 acknowledgement = ack-nhfb,
7463 pdfpages = "52",
7464 xxnumber = "CS-TR-71-232",
7465 }
7466
7467 @TechReport{Wilner:1971:DSD,
7468 author = "Wayne Wilner",
7469 title = "Declarative Semantic Definition",
7470 type = "Technical Report",
7471 number = "STAN-CS-71-233",
7472 institution = inst-STAN-CS,
7473 address = inst-STAN-CS:adr,
7474 pages = "211",
7475 month = aug,
7476 year = "1971",
7477 bibdate = "Fri Nov 21 14:21:14 2025",
7478 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
7479 URL = "",
7480 acknowledgement = ack-nhfb,
7481 }
7482
7483 @TechReport{Golub:1971:SMEa,
7484 author = "Gene H. Golub",
7485 title = "Some modified eigenvalue problems",
7486 type = "Technical Report",
7487 number = "STAN-CS-71-234 (SU326 P30-11)",
7488 institution = inst-STAN-CS,
7489 address = inst-STAN-CS:adr,
7490 pages = "38",
7491 month = aug,
7492 year = "1971",
7493 bibdate = "Fri Nov 7 07:00:05 MST 2025",
7494 bibsource = "https://www.math.utah.edu/pub/bibnet/authors/g/golub-gene-h.bib;
7495 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
7496 URL = "http://i.stanford.edu/TR/CS-TR-71-234.html",
7497 abstract = "We consider the numerical calculation of several
7498 eigenvalue problems which require some manipulation
7499 before the standard algorithms may be used. This
7500 includes finding the stationary values of a quadratic
7501 form subject to linear constraints and determining the
7502 eigenvalues of a matrix which is modified by a matrix
7503 of rank one. We also consider several inverse
7504 eigenvalue problems. This includes the problem of
7505 computing the Gauss--Radau and Gauss--Lobatto
7506 quadrature rules. In addition, we study several
7507 eigenvalue problems which arise in least squares.",
7508 acknowledgement = ack-nhfb,
7509 author-dates = "Gene Howard Golub (February 29, 1932--November 16,
7510 2007)",
7511 pdfpages = "38",
7512 xxnumber = "CS-TR-71-234",
7513 }
7514
7515 @TechReport{Floyd:1971:TID,
7516 author = "Robert W. Floyd",
7517 title = "Toward Iterative Design of Correct Programs",
7518 type = "Technical Report",
7519 number = "STAN-CS-71-235 (AIM-150)",
7520 institution = inst-STAN-CS,
7521 address = inst-STAN-CS:adr,
7522 pages = "12",
7523 month = sep,
7524 year = "1971",
7525 bibdate = "Fri Nov 21 14:21:14 2025",
7526 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
7527 URL = "",
7528 acknowledgement = ack-nhfb,
7529 author-dates = "Robert W. Floyd (8 June 1936--25 September 2001)",
7530 }
7531
7532 @TechReport{Golub:1971:NCU,
7533 author = "Gene H. Golub and George P. H. Styan",
7534 title = "Numerical computations for univariate linear models",
7535 type = "Technical Report",
7536 number = "STAN-CS-71-236 (AD737648)",
7537 institution = inst-STAN-CS,
7538 address = inst-STAN-CS:adr,
7539 pages = "35",
7540 month = sep,
7541 year = "1971",
7542 bibdate = "Fri Nov 7 07:00:05 MST 2025",
7543 bibsource = "https://www.math.utah.edu/pub/bibnet/authors/g/golub-gene-h.bib;
7544 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
7545 URL = "http://i.stanford.edu/TR/CS-TR-71-236.html",
7546 abstract = "We consider the usual univariate linear model $
7547 E(\underset ~ \to y) = \underset ~ \to X \underset ~
7548 \to \gamma $, $ V (\underset ~ \to y) = \sigma^2
7549 \underset ~ \to I $. In Part One of this paper $
7550 \underset ~ \to X $ has full column rank. Numerically
7551 stable and efficient computational procedures are
7552 developed for the least squares estimation of $
7553 \underset ~ \to \gamma $ and the error sum of squares.
7554 We employ an orthogonal triangular decomposition of $
7555 \underset ~ \to X $ using Householder transformations.
7556 A lower bound for the condition number of $ \underset ~
7557 \to X $ is immediately obtained from this
7558 decomposition. Similar computational procedures are
7559 presented for the usual F-test of the general linear
7560 hypothesis $ \underset ~ \to L \ ' \underset ~ \to
7561 \gamma = \underset ~ \to 0 $ ; $ \underset ~ \to L \ '
7562 \underset ~ \to \gamma = \underset ~ \to m $ is also
7563 considered for $ \underset ~ \to m \ \neq \ 0 $.
7564 Updating techniques are given for adding to or removing
7565 from ($ \underset ~ \to X, \underset ~ \to y $) a row,
7566 a set of rows or a column. In Part Two, $ \underset ~
7567 \to X$ has less than full rank. Least squares estimates
7568 are obtained using generalized inverses. The function $
7569 \underset ~ \to L ' \underset ~ \to \gamma $ is
7570 estimable whenever it admits an unbiased estimator
7571 linear in $ \underset ~ \to y$. We show how to
7572 computationally verify estimability of $ \underset ~
7573 \to L ' \underset ~ \to \gamma $ and the equivalent
7574 testability of $ \underset ~ \to L ' \underset ~ \to
7575 \gamma \ = \underset ~ \to 0$.",
7576 acknowledgement = ack-nhfb,
7577 author-dates = "Gene Howard Golub (February 29, 1932--November 16,
7578 2007)",
7579 pdfpages = "39",
7580 xxnumber = "CS-TR-71-236",
7581 }
7582
7583 @TechReport{VanVoorhis:1971:GDS,
7584 author = "David C. {Van Voorhis}",
7585 title = "A generalization of the divide-sort-merge strategy for
7586 sorting networks",
7587 type = "Technical Report",
7588 number = "STAN-CS-71-237 (CSL-TR-16, AD737270)",
7589 institution = inst-STAN-CS,
7590 address = inst-STAN-CS:adr,
7591 pages = "??",
7592 month = aug,
7593 year = "1971",
7594 bibdate = "Fri Nov 7 07:00:05 MST 2025",
7595 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
7596 URL = "http://i.stanford.edu/TR/CS-TR-71-237.html",
7597 abstract = "With a few notable exceptions the best sorting
7598 networks known have employed a `divide-sort-merge'
7599 strategy. That is, the N inputs are divided into 2
7600 groups --- normally of size $ \lceil \frac {1}{2} N
7601 \rceil $ and $ \lfloor \frac {1}{2} N \rfloor $ [Here $
7602 \lceil x \rceil $ denotes the smallest integer greater
7603 than or equal to $x$, whereas $ \lfloor x \rfloor $
7604 denotes the largest integer less than or equal to $x$]
7605 that are sorted independently and then `merged'
7606 together to form a single sorted sequence. An N-sorter
7607 network that uses this strategy consists of 2 smaller
7608 sorting networks followed by a merge network. The best
7609 merge networks known are also constructed recursively,
7610 using 2 smaller merge networks followed by a simple
7611 arrangement of $ \lceil \frac {1}{2} N \rceil $ - 1
7612 comparators. We consider a generalization of the
7613 divide-sort-merge strategy in which the N inputs are
7614 divided into g $ \geq $ 2 disjoint groups that are
7615 sorted independently and then merged together. The
7616 merge network that combines these $g$ sorted groups
7617 uses $ d \geq 2 $ smaller merge networks as an initial
7618 subnetwork. The two parameters g and d together define
7619 what we call a `$ [g, d]$' strategy. A $ [g, d]$
7620 $N$-sorter network consists of g smaller sorting
7621 networks followed by a $ [g, d]$ merge network. The
7622 initial portion of the $ [g, d]$ merge network consists
7623 of d smaller merge networks; the final portion, which
7624 we call the `$f$-network,' includes whatever additional
7625 comparators are required to complete the merge. When $
7626 g = d = 2$, the $f$-network is a simple arrangement of
7627 $ \lceil \frac {1}{2} N \rceil $ - 1 comparators;
7628 however, for larger $ g, d$ the structure of the $ [g,
7629 d]$ $f$-network becomes increasingly complicated. In
7630 this paper we describe how to construct $ [g, d]$
7631 $f$-networks for arbitrary g,d. For $ N > 8$ the
7632 resulting $ [g, d]$ $N$-sorter networks are more
7633 economical than any previous networks that use the
7634 divide-sort-merge strategy; for $ N > 34$ the resulting
7635 networks are more economical than previous networks of
7636 any construction. The $ [4, 4]$ $N$-sorter network
7637 described in this paper requires $ \frac {1}{4}
7638 N{(log_2 N)}^2 \ \frac {1}{3} N(\log_2 N) + O(N) $
7639 comparators, which represents an asymptotic improvement
7640 of $ \frac {1}{12} N(\log_2 N) $ comparators over the
7641 best previous $N$-sorter. We indicate that special
7642 constructions (not described in this paper) have been
7643 found for [$ 2^r, 2^r$] $f$-networks, which lead to an
7644 $N$-sorter network that requires only $ 0.25 N{(\log_2
7645 N)}^2 - 0.372 N(\log_2 N) + O(N)$ comparators.",
7646 acknowledgement = ack-nhfb,
7647 pdfpages = "76",
7648 xxnumber = "CS-TR-71-237",
7649 }
7650
7651 @TechReport{VanVoorhis:1971:LBS,
7652 author = "David C. {Van Voorhis}",
7653 title = "A lower bound for sorting networks that use the
7654 divide-sort-merge strategy",
7655 type = "Technical Report",
7656 number = "STAN-CS-71-238 (CSL-TR-17, AD735901)",
7657 institution = inst-STAN-CS,
7658 address = inst-STAN-CS:adr,
7659 pages = "??",
7660 month = aug,
7661 year = "1971",
7662 bibdate = "Fri Nov 7 07:00:05 MST 2025",
7663 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
7664 URL = "http://i.stanford.edu/TR/CS-TR-71-238.html",
7665 abstract = "Let $ M_g (g^{k + 1}) $ represent the minimum number
7666 of comparators required by a network that merges g
7667 sorted multisets containing $ g^k $ members each. In
7668 this paper we prove that $ M_g (g^{k + 1}) \geq \ g
7669 M_g(g^k) + g^{k - 1} \sum_{\ell = 2}^g \lfloor (\ell -
7670 1)g / \ell \rfloor $. From this relation we are able to
7671 show that an N-sorter network which uses the g-way
7672 divide-sort-merge strategy must contain at least order
7673 $ N{(log_2 N)}^2 $ comparators.",
7674 acknowledgement = ack-nhfb,
7675 pdfpages = "15",
7676 xxnumber = "CS-TR-71-238",
7677 }
7678
7679 @TechReport{VanVoorhis:1971:LSN,
7680 author = "David C. {Van Voorhis}",
7681 title = "Large $ [g, d] $ sorting networks",
7682 type = "Technical Report",
7683 number = "STAN-CS-71-239 (CSL-TR-18, AD736610)",
7684 institution = inst-STAN-CS,
7685 address = inst-STAN-CS:adr,
7686 pages = "??",
7687 month = aug,
7688 year = "1971",
7689 bibdate = "Fri Nov 7 07:00:05 MST 2025",
7690 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
7691 URL = "http://i.stanford.edu/TR/CS-TR-71-239.html",
7692 abstract = "With only a few exceptions the minimum-comparator
7693 $N$-sorter networks employ the generalized
7694 `divide-sort-merge' strategy. That is, the $N$ inputs
7695 are divided among $ g \geq 2 $ smaller sorting networks
7696 --- of size $ N_1, N_2, \ldots {}, N_g $, where $ N =
7697 \sum_{k = 1}^g N_k $ --- that comprise the initial
7698 portion of the $N$-sorter network. The remainder of the
7699 $N$-sorter is a comparator network that merges the
7700 outputs of the $ N_1 -, N_2 -, \ldots {}, $ and $
7701 N_g$-sorter networks into a single sorted sequence. The
7702 most economical merge networks yet designed, known as
7703 the `$ [g, d]$' merge networks, consist of $d$ smaller
7704 merge networks --- where $d$ is a common divisor of $
7705 N_1, N_2, \ldots {}, N_g$ --- followed by a special
7706 comparator network labeled a `$ [g, d]$ $f$-network.'
7707 In this paper we describe special constructions for $
7708 [2^r, 2^r]$ $f$-networks, $ r > 1$, which enable us to
7709 reduce the number of comparators required by a large
7710 $N$-sorter network from $ 0.25 N {(\log_2 N)}^2 - 0.25
7711 N(\log_2 N) + O(N)$ to $ 0.25 N{(\log_2 N)}^2 - 0.37
7712 N(\log_2 N) + O(N)$.",
7713 acknowledgement = ack-nhfb,
7714 pdfpages = "68",
7715 xxnumber = "CS-TR-71-239",
7716 }
7717
7718 @TechReport{London:1971:CTC,
7719 author = "Ralph L. London",
7720 title = "Correctness of two compilers for a {Lisp} subset",
7721 type = "Technical Report",
7722 number = "STAN-CS-71-240 (AIM-151, AD738568)",
7723 institution = inst-STAN-CS,
7724 address = inst-STAN-CS:adr,
7725 pages = "??",
7726 month = oct,
7727 year = "1971",
7728 bibdate = "Fri Nov 7 07:00:05 MST 2025",
7729 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
7730 URL = "http://i.stanford.edu/TR/CS-TR-71-240.html",
7731 abstract = "Using mainly structural induction, proofs of
7732 correctness of each of two running Lisp compilers for
7733 the PDP-10 computer are given. Included are the
7734 rationale for presenting these proofs, a discussion of
7735 the proofs, and the changes needed to the second
7736 compiler to complete its proof.",
7737 acknowledgement = ack-nhfb,
7738 pdfpages = "50",
7739 xxnumber = "CS-TR-71-240",
7740 }
7741
7742 @TechReport{Bierman:1971:ITM,
7743 author = "Alan W. Biermann",
7744 title = "On the Inference of {Turing} Machines from Sample
7745 Computations",
7746 type = "Technical Report",
7747 number = "STAN-CS-71-241 (AIM-152, AD732642)",
7748 institution = inst-STAN-CS,
7749 address = inst-STAN-CS:adr,
7750 pages = "ii + 31",
7751 month = oct,
7752 year = "1971",
7753 DOI = "https://doi.org/10.1016/0004-3702(72)90048-3",
7754 bibdate = "Fri Nov 21 14:21:14 2025",
7755 bibsource = "https://www.math.utah.edu/pub/bibnet/authors/t/turing-alan-mathison.bib;
7756 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
7757 URL = "",
7758 abstract = "An algorithm is presented which, when given a complete
7759 description of a set of Turing machine computations,
7760 finds a Turing machine which is capable of doing those
7761 computations. This algorithm can serve as the basis for
7762 designing a trainable device which can be trained to
7763 simulate any Turing machine by being led through a
7764 series of sample computations done by that machine. A
7765 number of examples illustrate the use of the techniques
7766 and the possibility of its application to other types
7767 of problems.",
7768 acknowledgement = ack-nhfb,
7769 pdfpages = "33",
7770 remark = "Published in \booktitle{Artificial Intelligence}, {\bf
7771 3}, 181--198, 1972, doi:10.1016/0004-3702(72)90048-3.",
7772 }
7773
7774 @TechReport{Hayes:1971:FPR,
7775 author = "Patrick J. Hayes",
7776 title = "The frame problem and related problems in artificial
7777 intelligence",
7778 type = "Technical Report",
7779 number = "STAN-CS-71-242 (AIM-153, AD738569)",
7780 institution = inst-STAN-CS,
7781 address = inst-STAN-CS:adr,
7782 pages = "??",
7783 month = nov,
7784 year = "1971",
7785 bibdate = "Fri Nov 7 07:00:05 MST 2025",
7786 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
7787 URL = "http://i.stanford.edu/TR/CS-TR-71-242.html",
7788 abstract = "The frame problem arises in considering the logical
7789 structure of a robot's beliefs. It has been known for
7790 some years, but only recently has much progress been
7791 made. The problem is described and discussed. Various
7792 suggested methods for its solution are outlined, and
7793 described in a uniform notation. Finally, brief
7794 consideration is given to the problem of adjusting a
7795 belief system in the face of evidence which contradicts
7796 beliefs. It is shown that a variation on the situation
7797 notation of (McCarthy and Hayes, 1969) permits an
7798 elegant approach, and relates this problem to the frame
7799 problem.",
7800 acknowledgement = ack-nhfb,
7801 pdfpages = "20",
7802 xxnumber = "CS-TR-71-242",
7803 }
7804
7805 @TechReport{Manna:1971:IMP,
7806 author = "Zohar Manna and Stephen Ness and Jean Vuillemin",
7807 title = "Inductive Methods for Proving Properties of Programs",
7808 type = "Technical Report",
7809 number = "STAN-CS-71-243 (AIM-154, AD738570)",
7810 institution = inst-STAN-CS,
7811 address = inst-STAN-CS:adr,
7812 pages = "iv + 24",
7813 month = nov,
7814 year = "1971",
7815 bibdate = "Fri Nov 21 14:21:14 2025",
7816 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
7817 URL = "",
7818 abstract = "We have two main purposes in this paper. First, we
7819 clarify and extend known results about computation of
7820 recursive programs, emphasizing the difference between
7821 the theoretical and practical approaches. Secondly, we
7822 present and examine various known methods for proving
7823 properties of recursive programs. We discuss in detail
7824 two powerful inductive methods, computational induction
7825 and structural induction, illustrating their
7826 applications by various examples. We also briefly
7827 discuss some other related methods.\par
7828
7829 Our aim in this work is to introduce inductive methods
7830 to as wide a class of readers as possible and to
7831 demonstrate their power as practical techniques. We ask
7832 the forgiveness of our more theoretical-minded
7833 colleagues for our occasional choice of clarity over
7834 precision.",
7835 acknowledgement = ack-nhfb,
7836 pdfpages = "28",
7837 }
7838
7839 @TechReport{Tarjan:1971:EPA,
7840 author = "Robert E. Tarjan",
7841 title = "An Efficient Planarity Algorithm",
7842 type = "Technical Report",
7843 number = "STAN-CS-71-244 (AD738027)",
7844 institution = inst-STAN-CS,
7845 address = inst-STAN-CS:adr,
7846 pages = "v + 154",
7847 month = nov,
7848 year = "1971",
7849 bibdate = "Fri Nov 21 14:21:14 2025",
7850 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
7851 URL = "",
7852 abstract = "An efficient algorithm is presented for determining
7853 whether a graph $G$ can be embedded in the plane.
7854 Depth-first search, or backtracking, is the most
7855 important of the techniques used by the algorithm. If
7856 $G$ has $V$ vertices, the algorithm requires $ O(V)$
7857 space and $ O(V)$ time when implemented on a random
7858 access computer. An implementation on the Stanford IBM
7859 360\slash 67 successfully analyzed graphs with as many
7860 as 900 vertices in less than 12 seconds.",
7861 acknowledgement = ack-nhfb,
7862 pdfpages = "159",
7863 remark = "This is the author's thesis.",
7864 }
7865
7866 @TechReport{Ryder:1971:HAL,
7867 author = "John Ryder",
7868 title = "Heuristic Analysis of Large Trees as Generated in the
7869 Game of {Go}",
7870 type = "Technical Report",
7871 number = "STAN-CS-71-245 (AIM-155)",
7872 institution = inst-STAN-CS,
7873 address = inst-STAN-CS:adr,
7874 pages = "350",
7875 month = nov,
7876 year = "1971",
7877 bibdate = "Fri Nov 21 14:21:14 2025",
7878 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
7879 URL = "",
7880 acknowledgement = ack-nhfb,
7881 remark = "This is the author's thesis.",
7882 }
7883
7884 @TechReport{Colby:1971:RTV,
7885 author = "Kenneth Mark Colby and Franklin Dennis Hilf and Sylvia
7886 Weber and Helena C. Kraemer",
7887 title = "A resemblance test for the validation of a computer
7888 simulation of paranoid processes",
7889 type = "Technical Report",
7890 number = "STAN-CS-71-246 (AIM-156, AD740141)",
7891 institution = inst-STAN-CS,
7892 address = inst-STAN-CS:adr,
7893 pages = "??",
7894 month = nov,
7895 year = "1971",
7896 bibdate = "Fri Nov 7 07:00:05 MST 2025",
7897 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
7898 URL = "http://i.stanford.edu/TR/CS-TR-71-246.html",
7899 abstract = "A computer simulation of paranoid processes in the
7900 form of a dialogue algorithm was subjected to a
7901 validation study using an experimental resemblance test
7902 in which judges rated degrees of paranoia present in
7903 initial psychiatric interviews of both paranoid
7904 patients and of versions of the paranoid model. The
7905 statistical results indicate a satisfactory degree of
7906 resemblance between the two groups of interviews. It is
7907 concluded that the model provides a successful
7908 simulation of naturally occurring paranoid processes.",
7909 acknowledgement = ack-nhfb,
7910 pdfpages = "31",
7911 xxnumber = "CS-TR-71-246",
7912 }
7913
7914 @TechReport{Wilks:1971:OSH,
7915 author = "Yorick A. Wilks",
7916 title = "One small head --- some remarks on the use of 'model'
7917 in linguistics",
7918 type = "Technical Report",
7919 number = "STAN-CS-71-247 (AIM-157)",
7920 institution = inst-STAN-CS,
7921 address = inst-STAN-CS:adr,
7922 pages = "??",
7923 month = dec,
7924 year = "1971",
7925 bibdate = "Fri Nov 7 07:00:05 MST 2025",
7926 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
7927 URL = "http://i.stanford.edu/TR/CS-TR-71-247.html",
7928 abstract = "I argue that the present situation in formal
7929 linguistics, where much new work is presented as being
7930 a `model of the brain', or of `human language
7931 behavior', is an undesirable one. My reason for this
7932 judgement is not the conservative (Braithwaitian) one
7933 that the entities in question are not really models but
7934 theories. It is rather that they are called models
7935 because they cannot be theories of the brain at the
7936 present stage of brain research, and hence that the use
7937 of `model' in this context is not so much aspirational
7938 as resigned about our total ignorance of how the brain
7939 stores and processes linguistic information. The reason
7940 such explanatory entities cannot be theories is that
7941 this ignorance precludes any `semantic ascent' up the
7942 theory; i.e., interpreting the items of the theory in
7943 terms of observables. And the brain items, whatever
7944 they may be, are not, as Chomsky has sometimes claimed,
7945 in the same position as the `occult entities' of
7946 Physics like Gravitation; for the brain items are not
7947 theoretically unreachable, merely unreached. I then
7948 examine two possible alternate views of what linguistic
7949 theories should be proffered as theories of: theories
7950 of sets of sentences, and theories of a particular
7951 class of algorithms. I argue for a form of the latter
7952 view, and that its acceptance would also have the
7953 effect of making Computational Linguistics a central
7954 part of Linguistics, rather than the poor relation it
7955 is now. I examine a distinction among `linguistic
7956 models' proposed recently by Mey, who was also arguing
7957 for the self-sufficiency of Computational Linguistics,
7958 though as a `theory of performance'. I argue that his
7959 distinction is a bad one, partly for the reasons
7960 developed above and partly because he attempts to tie
7961 it to Chomsky's inscrutable competence-performance
7962 distinction. I conclude that the independence and
7963 self-sufficiency of Computational Linguistics are
7964 better supported by the arguments of this paper.",
7965 acknowledgement = ack-nhfb,
7966 pdfpages = "18",
7967 xxnumber = "CS-TR-71-247",
7968 }
7969
7970 @TechReport{Fredman:1971:RRB,
7971 author = "Michael L. Fredman and Donald E. Knuth",
7972 title = "Recurrence Relations Based on Minimization",
7973 type = "Technical Report",
7974 number = "STAN-CS-71-248 (AD739335)",
7975 institution = inst-STAN-CS,
7976 address = inst-STAN-CS:adr,
7977 pages = "ii + 35",
7978 month = dec,
7979 year = "1971",
7980 bibdate = "Fri Nov 21 14:21:14 2025",
7981 bibsource = "https://www.math.utah.edu/pub/tex/bib/fibquart.bib;
7982 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
7983 URL = "",
7984 abstract = "This paper investigates solutions of the general
7985 recurrence\par
7986
7987 $ M(0) = g(0) $, $ M(n + 1) = g(n + 1) + \min_{i \leq k
7988 \leq n} (\alpha M(k) + \beta M(n - k)) $ \par
7989
7990 for various choices of $ \alpha $, $ \beta $, and $
7991 g(n) $. In a large number of cases it is possible to
7992 prove that $ M(n) $ is a convex function whose values
7993 can be computed much more efficiently than would be
7994 suggested by the defining recurrence. The asymptotic
7995 behavior of $ M(n) $ can be deduced using combinatorial
7996 methods in conjunction with analytic techniques. In
7997 some cases there are strong connections between $ M(n)
7998 $ and the function $ H(x) $ defined by\par
7999
8000 $ H(x) = 1 $ for $ x < 1 $, $ H(x) = H((x - 1) /
8001 \alpha) + H((x - 1) / \beta) $ for $ x \geq 1
8002 $.\par
8003
8004 Special cases of these recurrences lead to a surprising
8005 number of interesting problems involving both discrete
8006 and continuous mathematics.",
8007 acknowledgement = ack-nhfb,
8008 keywords = "asymptotic methods; binary trees; convex functions;
8009 Dirichlet integrals; discrete dynamic programming;
8010 gapless partitions; generalized Fibonacci numbers",
8011 pdfpages = "40",
8012 remark = "Published in \booktitle{Notices of the American
8013 Mathematical Society}, {\bf 18}(6) 960--??, October
8014 1971.",
8015 }
8016
8017 @TechReport{Pollack:1971:ABC,
8018 author = "Bary W. Pollack",
8019 title = "An annotated bibliography on the construction of
8020 compilers",
8021 type = "Technical Report",
8022 number = "STAN-CS-71-249",
8023 institution = inst-STAN-CS,
8024 address = inst-STAN-CS:adr,
8025 pages = "??",
8026 month = dec,
8027 year = "1971",
8028 bibdate = "Fri Nov 7 07:00:05 MST 2025",
8029 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
8030 URL = "http://i.stanford.edu/TR/CS-TR-71-249.html",
8031 abstract = "This bibliography is divided into 9 sections: 1.
8032 General Information on Compiling Techniques 2. Syntax-
8033 and Base-Directed Parsing 3. Parsing in General 4.
8034 Resource Allocation 5. Errors - Detection and
8035 Correction 6. Compiler Implementation in General 7.
8036 Details of Compiler Construction 8. Additional Topics
8037 9. Miscellaneous Related References Within each section
8038 the entries are alphabetical by author. Keywords
8039 describing the entry will be found for each entry set
8040 off by pound signs (\#). Some amount of
8041 cross-referencing has been done; e.g., entries which
8042 fall into Section 3 as well as Section 7 will generally
8043 be found in both sections. However, entries will be
8044 found listed only under the principle or first author's
8045 name. `Computing Reviews' citations are given following
8046 the annotation when available.",
8047 acknowledgement = ack-nhfb,
8048 pdfpages = "172",
8049 xxnumber = "CS-TR-71-249",
8050 }
8051
8052 @TechReport{Chandra:1971:PSE,
8053 author = "Ashok K. Chandra and Zohar Manna",
8054 title = "Program schemas with equality",
8055 type = "Technical Report",
8056 number = "STAN-CS-71-250 (AIM-158, AD740127)",
8057 institution = inst-STAN-CS,
8058 address = inst-STAN-CS:adr,
8059 pages = "??",
8060 month = dec,
8061 year = "1971",
8062 bibdate = "Fri Nov 7 07:00:05 MST 2025",
8063 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
8064 URL = "http://i.stanford.edu/TR/CS-TR-71-250.html",
8065 abstract = "We discuss the class of program schemas augmented with
8066 equality tests, that is, tests of equality between
8067 terms. In the first part of the paper we discuss and
8068 illustrate the `power' of equality tests. It turns out
8069 that the class of program schemas with equality is more
8070 powerful than the `maximal' classes of schemas
8071 suggested by other investigators. In the second part of
8072 the paper we discuss the decision problems of program
8073 schemas with equality. It is shown for example that
8074 while the decision problems normally considered for
8075 schemas (such as halting, divergence, equivalence,
8076 isomorphism and freedom) are solvable for Ianov
8077 schemas, they all become unsolvable if general equality
8078 tests are added. We suggest, however, limited equality
8079 tests which can be added to certain subclasses of
8080 program schemas while preserving their solvable
8081 properties.",
8082 acknowledgement = ack-nhfb,
8083 pdfpages = "14",
8084 xxnumber = "CS-TR-71-250",
8085 }
8086
8087 @TechReport{Malcolm:1972:PRP,
8088 author = "Michael A. Malcolm",
8089 title = "{PL360} (revised): a programming language for the {IBM
8090 360}",
8091 type = "Technical Report",
8092 number = "STAN-CS-71-215 (AD727115)",
8093 institution = inst-STAN-CS,
8094 address = inst-STAN-CS:adr,
8095 pages = "vii + 103",
8096 month = may,
8097 year = "1972",
8098 bibdate = "Fri Nov 7 07:00:05 MST 2025",
8099 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
8100 URL = "http://i.stanford.edu/TR/CS-TR-71-215.html",
8101 abstract = "In 1968, N. Wirth (Jan. JACM) published a formal
8102 description of PL360, a programming language designed
8103 specifically for the IBM 360. PL360 has an appearance
8104 similar to that of Algol, but it provides the
8105 facilities of a symbolic machine language. Since 1968,
8106 numerous extensions and modifications have been made to
8107 the PL360 compiler which was originally designed and
8108 implemented by N. Wirth and J. Wells. Interface and
8109 input-output subroutines have been written which allow
8110 the use of PL360 under OS, DOS, MTS and Orvyl. A formal
8111 description of PL360 as it is presently implemented is
8112 given. The description of the language is followed by
8113 sections on the use of PL360 under various operating
8114 systems, namely OS, DOS and MTS. Instructions on how to
8115 use the PL360 compiler and PL360 programs in an
8116 interactive mode under the Orvyl time-sharing monitor
8117 are also included.",
8118 acknowledgement = ack-nhfb,
8119 pdfpages = "112",
8120 xxnumber = "CS-TR-71-215",
8121 }
8122
8123 @TechReport{Malcolm:1972:PRA,
8124 author = "Michael A. Malcolm",
8125 title = "{PL360} (Revised Again) A Programming Language for the
8126 {IBM 360}",
8127 type = "Technical Report",
8128 number = "STAN-CS-71-215 (revised again)",
8129 institution = inst-STAN-CS,
8130 address = inst-STAN-CS:adr,
8131 pages = "iv + 103",
8132 month = may,
8133 year = "1972",
8134 bibdate = "Thu Jan 11 16:35:00 2024",
8135 bibsource = "https://www.math.utah.edu/pub/bibnet/authors/w/wirth-niklaus.bib;
8136 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
8137 note = "Original version May 1971.",
8138 URL = "https://bitsavers.org/pdf/stanford/cs_techReports/STAN-CS-71-215_PL360_Revised_A_Programming_Language_For_The_IBM_360_May71.pdf",
8139 abstract = "In 1968, N. Wirth (Jan. JACM) published a formal
8140 description of PL360, a programming language designed
8141 specifically for the IBM 360. PL360 has an appearance
8142 similar to that of Algol, but it provides the
8143 facilities of a symbolic machine language. Since 1968,
8144 numerous extensions and modifications have been made to
8145 the PL360 compiler which was originally designed and
8146 implemented by N. Wirth and J. Wells. Interface and
8147 input--output subroutines have been written which allow
8148 the use of PL360 under OS, DOS, MTS and Orvyl.\par
8149
8150 A formal description of PL360 as it is presently
8151 implemented is given. The description of the language
8152 is followed by sections on the use of PL360 under
8153 various operating systems, namely OS, DOS and MTS.
8154 Instructions on how to use the PL360 compiler and PL360
8155 programs in an interactive mode under the Orvyl
8156 time-sharing monitor are also included.",
8157 acknowledgement = ack-nhfb,
8158 pdfpages = "107",
8159 xxnumber = "CS-TR-71-215 (revised again)",
8160 }
8161
8162 @TechReport{Sites:1972:AWR,
8163 author = "Richard L. Sites",
8164 title = "{ALGOL W} reference manual",
8165 type = "Technical Report",
8166 number = "STAN-CS-71-230 (PB203601)",
8167 institution = inst-STAN-CS,
8168 address = inst-STAN-CS:adr,
8169 pages = "i + 141",
8170 month = feb,
8171 year = "1972",
8172 bibdate = "Fri Nov 7 07:00:05 MST 2025",
8173 bibsource = "https://www.math.utah.edu/pub/bibnet/authors/w/wirth-niklaus.bib;
8174 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
8175 URL = "http://i.stanford.edu/TR/CS-TR-71-230.html;
8176 https://bitsavers.org/pdf/stanford/cs_techReports/STAN-CS-71-230_Algol_W_Reference_Manual_Feb72.pdf",
8177 abstract = "``A Contribution to the Development of ALGOL'' by
8178 Niklaus Wirth and C. A. R. Hoare was the basis for a
8179 compiler developed for the IBM 360 at stanford
8180 University. This report is a description of the
8181 implemented language, ALGOL W. Historical background
8182 and the goals of the language may be found in the Wirth
8183 and Hoare paper.\par
8184
8185 This document is a major revision of and supersedes CS
8186 110. The revisions were made in order to document a
8187 significantly improved version of the ALGOL W compiler.
8188 This version was known as X ALGOL W during the spring
8189 and summer of 1971. In addition to new debugging
8190 facilities documented under Compiler Options, the new
8191 version of the compiler has slightly more meaningful
8192 error messages documented in the completely re-written
8193 Error Messages section. Various minor corrections and
8194 changes have been made throughout the book, and same
8195 examples have been added. There is now an index, and a
8196 complete list of all words the compiler treats in any
8197 special way.",
8198 abstract-2 = "'A Contribution to the Development of ALGOL' by
8199 Niklaus Wirth and C. A. R. Hoare was the basis for a
8200 compiler developed for the IBM 360 at Stanford
8201 University. This report is a description of the
8202 implemented language, ALGOL W. Historical background
8203 and the goals of the language may be found in the Wirth
8204 and Hoare paper. This manual refers to the version of
8205 the Algol W compiler dated 16 January 1972.",
8206 acknowledgement = ack-nhfb,
8207 pdfpages = "160",
8208 xxnumber = "CS-TR-71-230",
8209 }
8210
8211 @TechReport{Stone:1972:EPA,
8212 author = "Harold Stone",
8213 title = "An Efficient Parallel Algorithm for the Solution of a
8214 Tridiagonal Linear System of Equation",
8215 type = "Technical Report",
8216 number = "STAN-CS-72-251 (CSL-TR-19, AD736814)",
8217 institution = inst-STAN-CS,
8218 address = inst-STAN-CS:adr,
8219 pages = "iii + 21",
8220 month = dec,
8221 year = "1971",
8222 bibdate = "Fri Nov 21 14:21:14 2025",
8223 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
8224 URL = "",
8225 abstract = "Tridiagonal linear systems of equations can be solved
8226 on conventional serial machines in a time proportional
8227 to $N$, where $N$ is the number of equations. The
8228 conventional algorithms do not lend themselves directly
8229 to parallel computation on computers of the ILLIAC IV
8230 class, in the sense that they appear to be inherently
8231 serial. An efficient parallel algorithm is presented in
8232 which computation time grows as $ \log_2 N$. The
8233 algorithm is based on recursive doubling solutions of
8234 linear recurrence relations, and can be used to solve
8235 recurrence relations of all orders.",
8236 acknowledgement = ack-nhfb,
8237 pdfpages = "26",
8238 }
8239
8240 @TechReport{Saunders:1972:LSL,
8241 author = "Michael A. Saunders",
8242 title = "Large-scale linear programming using the {Cholesky}
8243 factorization",
8244 type = "Technical Report",
8245 number = "STAN-CS-72-252 (SU326 P30-14)",
8246 institution = inst-STAN-CS,
8247 address = inst-STAN-CS:adr,
8248 pages = "64",
8249 month = jan,
8250 year = "1972",
8251 bibdate = "Fri Nov 7 07:00:05 MST 2025",
8252 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
8253 URL = "http://i.stanford.edu/TR/CS-TR-72-252.html",
8254 abstract = "A variation of the revised simplex method is proposed
8255 for solving the standard linear programming problem.
8256 The method is derived from an algorithm recently
8257 proposed by Gill and Murray, and is based upon the
8258 orthogonal factorization $ B = L Q $ or, equivalently,
8259 upon the Cholesky factorization $ B B^T = L L^T $ where
8260 $B$ is the usual square basis, $L$ is lower triangular
8261 and $Q$ is orthogonal. We wish to retain the favorable
8262 numerical properties of the orthogonal factorization,
8263 while extending the work of Gill and Murray to the case
8264 of linear programs which are both large and sparse. The
8265 principal property exploited is that the Cholesky
8266 factor $L$ depends only on $ \underline {\rm which} $
8267 variables are in the basis, and not upon the $
8268 \underline {\rm order} $ in which they happen to enter.
8269 A preliminary ordering of the rows of the full data
8270 matrix therefore promises to ensure that $L$ will
8271 remain sparse throughout the iterations of the simplex
8272 method. An initial (in-core) version of the algorithm
8273 has been implemented in Algol W on the IBM 360/91 and
8274 tested on several medium-scale problems from industry
8275 (up to 930 constraints). While performance has not been
8276 especially good on problems of high density, the method
8277 does appear to be efficient on problems which are very
8278 sparse, and on structured problems which have either
8279 generalized upper bounding, block-angular, or staircase
8280 form.",
8281 acknowledgement = ack-nhfb,
8282 pdfpages = "64",
8283 xxnumber = "CS-TR-72-252",
8284 }
8285
8286 @TechReport{Feldman:1972:TCI,
8287 author = "Jerome A. Feldman and Paul C. Shields",
8288 title = "Total complexity and the inference of best programs",
8289 type = "Technical Report",
8290 number = "STAN-CS-72-253 (AIM-159)",
8291 institution = inst-STAN-CS,
8292 address = inst-STAN-CS:adr,
8293 pages = "??",
8294 month = apr,
8295 year = "1972",
8296 bibdate = "Fri Nov 7 07:00:05 MST 2025",
8297 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
8298 URL = "http://i.stanford.edu/TR/CS-TR-72-253.html",
8299 abstract = "Axioms for a total complexity measure for abstract
8300 programs are presented. Essentially, they require that
8301 total complexity be an unbounded increasing function of
8302 the Blum time and size measures. Algorithms for finding
8303 the best program on a finite domain are presented, and
8304 their limiting behaviour for infinite domains
8305 described. For total complexity, there are important
8306 senses in which a machine $ \underline {\rm can} $ find
8307 the best program for a large class of functions.",
8308 acknowledgement = ack-nhfb,
8309 pdfpages = "22",
8310 xxnumber = "CS-TR-72-253",
8311 }
8312
8313 @TechReport{Forsythe:1972:NCMa,
8314 author = "George E. Forsythe",
8315 title = "{Von Neumann}'s comparison method for random sampling
8316 from the normal and other distributions",
8317 type = "Technical Report",
8318 number = "STAN-CS-72-254 (AD740330)",
8319 institution = inst-STAN-CS,
8320 address = inst-STAN-CS:adr,
8321 pages = "ii + 19",
8322 month = jan,
8323 year = "1972",
8324 bibdate = "Mon Jun 06 19:17:03 2005",
8325 bibsource = "https://www.math.utah.edu/pub/bibnet/authors/f/forsythe-george-elmer.bib;
8326 https://www.math.utah.edu/pub/bibnet/authors/v/von-neumann-john.bib;
8327 https://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Techreports/NCSTRL/STAN.bib;
8328 https://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Techreports/STAN.bib;
8329 https://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Techreports/Stanford.bib;
8330 https://www.math.utah.edu/pub/tex/bib/prng.bib;
8331 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
8332 URL = "http://i.stanford.edu/TR/CS-TR-72-254.html;
8333 https://apps.dtic.mil/sti/tr/pdf/AD0740330.pdf",
8334 abstract = "The author presents a generalization he worked out in
8335 1950 of von Neumann's method of generating random
8336 samples from the exponential distribution by
8337 comparisons of uniform random numbers on $ (0, 1) $. It
8338 is shown how to generate samples from any distribution
8339 whose probability density function is piecewise both
8340 absolutely continuous and monotonic on $ ( - \infty,
8341 \infty) $. A special case delivers normal deviates at
8342 an average cost of only 4.036 uniform deviates each.
8343 This seems more efficient than the Center--Tail method
8344 of Dieter and Ahrens, which uses a related, but
8345 different, method of generalizing the von Neumann idea
8346 to the normal distribution.",
8347 acknowledgement = ack-nhfb,
8348 author-dates = "George Elmer Forsythe (8 January 1917--9 April 1972)",
8349 notes = "[Adminitrivia V1/Prg/19951016]",
8350 pdfpages = "21",
8351 subject-dates = "John von Neumann (28 December 1903--8 February
8352 1957)",
8353 xxnumber = "CS-TR-72-254",
8354 }
8355
8356 @TechReport{Feldman:1972:AP,
8357 author = "Jerome A. Feldman",
8358 title = "Automatic programming",
8359 type = "Technical Report",
8360 number = "STAN-CS-72-255 (AIM-160, AD740140)",
8361 institution = inst-STAN-CS,
8362 address = inst-STAN-CS:adr,
8363 pages = "??",
8364 month = feb,
8365 year = "1972",
8366 bibdate = "Fri Nov 7 07:00:05 MST 2025",
8367 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
8368 URL = "http://i.stanford.edu/TR/CS-TR-72-255.html",
8369 abstract = "The revival of interest in Automatic Programming is
8370 considered. The research is divided into direct efforts
8371 and theoretical developments and the successes and
8372 prospects of each are described.",
8373 acknowledgement = ack-nhfb,
8374 pdfpages = "20",
8375 xxnumber = "CS-TR-72-255",
8376 }
8377
8378 @TechReport{Chvatal:1972:EPW,
8379 author = "Vaclav Chv{\'a}tal",
8380 title = "{Edmonds} polyhedra and weakly {Hamiltonian} graphs",
8381 type = "Technical Report",
8382 number = "STAN-CS-72-256 (AD740331)",
8383 institution = inst-STAN-CS,
8384 address = inst-STAN-CS:adr,
8385 pages = "??",
8386 month = jan,
8387 year = "1972",
8388 bibdate = "Fri Nov 7 07:00:05 MST 2025",
8389 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
8390 URL = "http://i.stanford.edu/TR/CS-TR-72-256.html",
8391 abstract = "Jack Edmonds developed a new way of looking at
8392 extremal combinatorial problems and applied his
8393 technique with a great success to the problems of the
8394 maximal-weight degree-constrained subgraphs. Professor
8395 C. St. J. A. Nash-Williams suggested to use Edmonds'
8396 approach in the context of Hamiltonian graphs. In the
8397 present paper, we determine a new set of inequalities
8398 (the `comb inequalities') which are satisfied by the
8399 characteristic functions of Hamiltonian circuits but
8400 are not explicit in the straightforward integer
8401 programming formulation. A direct application of the
8402 linear programming duality theorem then leads to a new
8403 necessary condition for the existence of Hamiltonian
8404 circuits; this condition appears to be stronger than
8405 the previously known ones. Relating linear programming
8406 to Hamiltonian circuits, the present paper can also be
8407 seen as a continuation of the work of Dantzig,
8408 Fulkerson and Johnson on the travelling salesman
8409 problem.",
8410 acknowledgement = ack-nhfb,
8411 pdfpages = "24",
8412 xxnumber = "CS-TR-72-256",
8413 }
8414
8415 @TechReport{Wirth:1972:PCG,
8416 author = "Niklaus Wirth",
8417 title = "On `{PASCAL},' code generation, and the {CDC 6000}
8418 computer",
8419 type = "Technical Report",
8420 number = "STAN-CS-72-257 (PB208519)",
8421 institution = inst-STAN-CS,
8422 address = inst-STAN-CS:adr,
8423 pages = "??",
8424 month = feb,
8425 year = "1972",
8426 bibdate = "Fri Nov 7 07:00:05 MST 2025",
8427 bibsource = "https://www.math.utah.edu/pub/bibnet/authors/w/wirth-niklaus.bib;
8428 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
8429 URL = "http://i.stanford.edu/TR/CS-TR-72-257.html;
8430 https://bitsavers.org/pdf/stanford/cs_techReports/STAN-CS-72-257_6600_PASCAL_Feb72.pdf",
8431 abstract = "'PASCAL' is a general purpose programming language
8432 with characteristics similar to ALGOL 60, but with an
8433 enriched set of program- and data structuring
8434 facilities. It has been implemented on the CDC 6000
8435 computer. This paper discusses selected topics of code
8436 generation, in particular the selection of instruction
8437 sequences to represent simple operations on arithmetic,
8438 Boolean, and powerset operands. Methods to implement
8439 recursive procedures are briefly described, and it is
8440 hinted that the more sophisticated solutions are not
8441 necessarily also the best. The CDC 6000 architecture
8442 appears as a frequent source of pitfalls and nuisances,
8443 and its main trouble spots are scrutinized and
8444 discussed.",
8445 acknowledgement = ack-nhfb,
8446 pdfpages = "40",
8447 xxnumber = "CS-TR-72-257",
8448 }
8449
8450 @TechReport{Brown:1972:SBM,
8451 author = "Harold Brown",
8452 title = "Some basic machine algorithms for integral order
8453 computations",
8454 type = "Technical Report",
8455 number = "STAN-CS-72-258 (AD740332)",
8456 institution = inst-STAN-CS,
8457 address = inst-STAN-CS:adr,
8458 pages = "??",
8459 month = feb,
8460 year = "1972",
8461 bibdate = "Fri Nov 7 07:00:05 MST 2025",
8462 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
8463 URL = "http://i.stanford.edu/TR/CS-TR-72-258.html",
8464 abstract = "Three machine implemented algorithms for computing
8465 with integral orders are described. The algorithms are:
8466 1. For an integral order R given in terms of its left
8467 regular representation relative to any basis, compute
8468 the nil radical J(R) and a left regular representation
8469 of R/J(R). 2. For a semisimple order R given in terms
8470 of its left regular representation relative to any
8471 basis, compute a new basis for R and the associated
8472 left regular representation of R such that the first
8473 basis element of the transformed basis is an integral
8474 multiple of the identity element in Q $ \bigotimes $ R.
8475 3. Relative to any fixed Z -basis for R, compute a
8476 unique canonical form for any given finitely generated
8477 Z -submodule of Q $ \bigotimes $ R described in terms
8478 of that basis.",
8479 acknowledgement = ack-nhfb,
8480 pdfpages = "16",
8481 xxnumber = "CS-TR-72-258",
8482 }
8483
8484 @TechReport{Crane:1972:LLP,
8485 author = "Clark A. Crane",
8486 title = "Linear Lists and Priority Queues as Balanced Binary
8487 Trees",
8488 type = "Technical Report",
8489 number = "STAN-CS-72-259 (PB208595)",
8490 institution = inst-STAN-CS,
8491 address = inst-STAN-CS:adr,
8492 pages = "131",
8493 month = feb,
8494 year = "1972",
8495 bibdate = "Fri Nov 21 14:21:14 2025",
8496 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
8497 URL = "",
8498 acknowledgement = ack-nhfb,
8499 remark = "This is the author's thesis. No PDF in DTIC or NTRL
8500 archives.",
8501 }
8502
8503 @TechReport{Pratt:1972:SSN,
8504 author = "Vaughan R. Pratt",
8505 title = "Shellsort and Sorting Networks",
8506 type = "Technical Report",
8507 number = "STAN-CS-72-260 (AD740110)",
8508 institution = inst-STAN-CS,
8509 address = inst-STAN-CS:adr,
8510 pages = "v + 59",
8511 month = feb,
8512 year = "1972",
8513 bibdate = "Fri Nov 21 14:21:14 2025",
8514 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
8515 URL = "",
8516 abstract = "Shellsort is a particular method of sorting data on
8517 digital computers. Associated with each variant of
8518 Shellsort is a sequence of integers that characterizes
8519 that variant. In this paper we answer some open
8520 questions about the speed of Shellsort with certain
8521 characteristic sequences, and suggest a novel
8522 application of Shellsort, namely to sorting
8523 networks.\par
8524
8525 Shellsort with any characteristic sequence that
8526 approximates a geometric progression and that has short
8527 coprime subsequences throughout takes $ O(n^{3 / 2}) $
8528 units of time. For any sequence that approximates a
8529 geometric progression with an integer common ratio,
8530 this bound is the best possible. (The notion of
8531 ``sorting template'' is used to prove this.) However,
8532 if the sequence consists of the descending sequence of
8533 positive integers less than $n$ and having only 2 and 3
8534 as prime factors, then Shellsort takes only $ O(n \log
8535 n)$ units of time. Sorting networks based on Shellsort
8536 with this sequence operate approximately 1.5 times as
8537 fast as with previous methods.",
8538 acknowledgement = ack-nhfb,
8539 advisor = "Donald E. Knuth",
8540 pdfpages = "66",
8541 remark = "This is the author's thesis.",
8542 }
8543
8544 @TechReport{Golub:1972:DPN,
8545 author = "Gene H. Golub and Victor Pereyra",
8546 title = "The differentiation of pseudoinverses and nonlinear
8547 least squares problems whose variables separate",
8548 type = "Technical Report",
8549 number = "STAN-CS-72-261 (SU326 P30 15)",
8550 institution = inst-STAN-CS,
8551 address = inst-STAN-CS:adr,
8552 pages = "35",
8553 month = feb,
8554 year = "1972",
8555 bibdate = "Fri Nov 7 07:00:05 MST 2025",
8556 bibsource = "https://www.math.utah.edu/pub/bibnet/authors/g/golub-gene-h.bib;
8557 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
8558 URL = "http://i.stanford.edu/TR/CS-TR-72-261.html",
8559 abstract = "For given data $ (t_i, y_i), i = 1, \ldots, m $, we
8560 consider the least squares fit of nonlinear models of
8561 the form\par
8562
8563 $ F(\underset \tilde a, \underset \tilde \alpha; t) =
8564 \sum_{j = 1}^n g_j (\underset \tilde a) \varphi_j
8565 (\underset \tilde \alpha; t), \underset \tilde a \in
8566 R^s, \underset \tilde \alpha \in R^k $.\par
8567
8568 For this purpose we study the minimization of the
8569 nonlinear functional\par
8570
8571 $ r(\underset \tilde a, \underset \tilde \alpha) =
8572 \sum_{i = 1}^m {(y_i - F(\underset \tilde a, \underset
8573 \tilde \alpha, t_i))}^2 $.\par
8574
8575 It is shown that by defining the matrix $ \{ \Phi
8576 (\underset \tilde \alpha) \}_{i, j} = \varphi_j
8577 (\underset \tilde \alpha; t_i) $, and the modified
8578 functional $ r_2 (\underset \tilde \alpha) = \|
8579 \underset \tilde y - \Phi (\underset \tilde \alpha)
8580 \Phi^+(\underset \tilde \alpha) \underset \tilde y
8581 \|_2^2 $, it is possible to optimize first with respect
8582 to the parameters $ \underset \tilde \alpha $, and then
8583 to obtain, a posteriori, the optimal parameters $
8584 \overset^\to {\underset \tilde a} $. The matrix $
8585 \Phi^+(\underset \tilde \alpha) $ is the Moore--Penrose
8586 generalized inverse of $ \Phi (\underset \tilde \alpha)
8587 $, and we develop formulas for its Frechet derivative
8588 under the hypothesis that $ \Phi (\underset \tilde \to
8589 \alpha) $ is of constant (though not necessarily full)
8590 rank. From these formulas we readily obtain the
8591 derivatives of the orthogonal projectors associated
8592 with $ \Phi (\underset \tilde \alpha) $, and also that
8593 of the functional $ r_2 (\underset \tilde \alpha) $.
8594 Detailed algorithms are presented which make extensive
8595 use of well-known reliable linear least squares
8596 techniques, and numerical results and comparisons are
8597 given. These results are generalizations of those of H.
8598 D. Scolnik [1971].",
8599 acknowledgement = ack-nhfb,
8600 author-dates = "Gene Howard Golub (February 29, 1932--November 16,
8601 2007)",
8602 pdfpages = "52",
8603 xxnumber = "CS-TR-72-261",
8604 }
8605
8606 @TechReport{Staff:1972:B,
8607 author = "{Staff}",
8608 title = "Bibliography",
8609 type = "Technical Report",
8610 number = "STAN-CS-72-262 (PB209357)",
8611 institution = inst-STAN-CS,
8612 address = inst-STAN-CS:adr,
8613 pages = "36",
8614 month = feb,
8615 year = "1972",
8616 bibdate = "Fri Nov 21 14:21:14 2025",
8617 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
8618 URL = "",
8619 acknowledgement = ack-nhfb,
8620 remark = "No PDF in NTRL archive.",
8621 }
8622
8623 @TechReport{Klarner:1972:PIU,
8624 author = "David A. Klarner and Ronald L. Rivest",
8625 title = "A procedure for improving the upper bound for the
8626 number of $n$-ominoes",
8627 type = "Technical Report",
8628 number = "STAN-CS-72-263 (AD741189)",
8629 institution = inst-STAN-CS,
8630 address = inst-STAN-CS:adr,
8631 pages = "??",
8632 month = feb,
8633 year = "1972",
8634 bibdate = "Fri Nov 7 07:00:05 MST 2025",
8635 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
8636 URL = "http://i.stanford.edu/TR/CS-TR-72-263.html",
8637 abstract = "An $n$-omino is a plane figure composed of n unit
8638 squares joined together along their edges. Every
8639 $n$-omino is generated by joining the edge of a unit
8640 square to the edge of a unit square in some $ (n -
8641 1)$-omino so that the new square does not overlap any
8642 squares. Let $ t(n)$ denote the number of $n$-ominoes,
8643 then it is known that the sequence $ \{ ((t(n)) \}^{1 /
8644 n} : n = 1, 2, \ldots)$ increases to a limit $ \Theta
8645 $, and $ 3.72 < \Theta < 6.75$. A procedure exists for
8646 computing an increasing sequence of numbers bounded
8647 above by $ \Theta $. (Chandra recently showed that the
8648 limit of this sequence is $ \Theta $.) In the present
8649 work we give a procedure for computing a sequence of
8650 numbers bounded below by $ \Theta $. Whether or not the
8651 limit of this sequence is $ \Theta $ remains an open
8652 question. By computing the first ten terms of our
8653 sequence, we have shown that $ \Theta $ < 4.65.",
8654 acknowledgement = ack-nhfb,
8655 pdfpages = "36",
8656 xxnumber = "CS-TR-72-263",
8657 }
8658
8659 @TechReport{Wilks:1972:AIA,
8660 author = "Yorick A. Wilks",
8661 title = "An artificial intelligence approach to machine
8662 translation",
8663 type = "Technical Report",
8664 number = "STAN-CS-72-264 (AIM-161, AD741189)",
8665 institution = inst-STAN-CS,
8666 address = inst-STAN-CS:adr,
8667 pages = "??",
8668 month = feb,
8669 year = "1972",
8670 bibdate = "Fri Nov 7 07:00:05 MST 2025",
8671 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
8672 URL = "http://i.stanford.edu/TR/CS-TR-72-264.html",
8673 abstract = "The paper describes a system of semantic analysis and
8674 generation, programmed in LISP 1.5 and designed to pass
8675 from paragraph length input in English to French via an
8676 interlingual representation. A wide class of English
8677 input forms will be covered, but the vocabulary will
8678 initially be restricted to one of a few hundred words.
8679 With this subset working, and during the current year
8680 (71-72), it is also hoped to map the interlingual
8681 representation onto some predicate calculus notation so
8682 as to make possible the answering of very simple
8683 questions about the translated matter. The
8684 specification of the translation system itself is
8685 complete, and its main points of interest that
8686 distinguish it from other systems are: (i) It
8687 translated phrase by phrase --- with facilities for
8688 reordering phrases and establishing essential semantic
8689 connectivities between them --- by mapping complex
8690 semantic structures of `message' onto each phrase.
8691 These constitute the interlingual representation to be
8692 translated. This matching is done without the explicit
8693 use of a conventional syntax analysis, by taking as the
8694 appropriate matched structure the `most dense' of the
8695 alternative structures derived. This method has been
8696 found highly successful in earlier versions of this
8697 analysis system. (ii) The French output strings are
8698 generated without the explicit use of a generative
8699 grammar. That is done by means of STEREOTYPES: strings
8700 of French words, and functions evaluating to French
8701 words, which are attached to English word senses in the
8702 dictionary and built into the interlingual
8703 representation by the analysis routines. The generation
8704 program thus receives an interlingual representation
8705 that already contains both French output and implicit
8706 procedures for assembling the output, since the
8707 stereotypes are in effect recursive procedures
8708 specifying the content and production of the output
8709 word strings. Thus the generation program at no time
8710 consults a word dictionary or inventory of grammar
8711 rules. It is claimed that the system of notation and
8712 translation described is a convenient one for
8713 expressing and handling the items of semantic
8714 information that are ESSENTIAL to any effective MT
8715 system, I discuss in some detail the semantic
8716 information needed to ensure the correct choice of
8717 output prepositions in French, a vital matter
8718 inadequately treated by virtually all previous
8719 formalisms and projects.",
8720 acknowledgement = ack-nhfb,
8721 pdfpages = "50",
8722 xxnumber = "CS-TR-72-264",
8723 }
8724
8725 @TechReport{Schank:1972:PCU,
8726 author = "Roger C. Schank and Neil M. Goldman and Charles J.
8727 Rieger and Christopher K. Riesbeck",
8728 title = "Primitive concepts underlying verbs of thought",
8729 type = "Technical Report",
8730 number = "STAN-CS-72-265 (AIM-162, AD744634)",
8731 institution = inst-STAN-CS,
8732 address = inst-STAN-CS:adr,
8733 pages = "iv + 98",
8734 month = feb,
8735 year = "1972",
8736 bibdate = "Fri Nov 7 07:00:05 MST 2025",
8737 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
8738 URL = "http://i.stanford.edu/TR/CS-TR-72-265.html;
8739 https://apps.dtic.mil/sti/tr/pdf/AD0744634.pdf",
8740 abstract = "In order to create conceptual structures that will
8741 uniquely and unambiguously represent the meaning of an
8742 utterance, it is necessary to establish 'primitive'
8743 underlying actions and states into which verbs can be
8744 mapped. This paper presents analyses of the most common
8745 mental verbs in terms of such primitive actions and
8746 states. In order to represent the way people speak
8747 about their mental processes, it was necessary to add
8748 to the usual ideas of memory structure the notion of
8749 Immediate Memory. It is then argued that there are only
8750 three primitive mental ACTs.",
8751 acknowledgement = ack-nhfb,
8752 pdfpages = "110",
8753 pdfpages = "104",
8754 remark = "The cover page inconsistently gives the report number
8755 as STAN-CS-265-72 instead of the usual STANCS-72-265.",
8756 xxnumber = "CS-TR-72-265",
8757 }
8758
8759 @TechReport{Cadiou:1972:RDP,
8760 author = "Jean M. Cadiou",
8761 title = "Recursive Definitions of Partial and Functions and
8762 Their Computation",
8763 type = "Technical Report",
8764 number = "STAN-CS-72-266 (AIM-163)",
8765 institution = inst-STAN-CS,
8766 address = inst-STAN-CS:adr,
8767 pages = "v + 157",
8768 month = mar,
8769 year = "1972",
8770 bibdate = "Fri Nov 21 14:21:14 2025",
8771 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
8772 URL = "https://apps.dtic.mil/sti/tr/pdf/ADA022048.pdf",
8773 abstract = "A formal syntactic and semantic model is presented for
8774 'recursive definitions' which are generalizations of
8775 those found in LISP for example. Such recursive
8776 definitions can have two classes of fixpoints, the
8777 strong fixpoints and the weak fixpoints, and also
8778 possess a class of computed partial
8779 functions.\par
8780
8781 Relations between these classes are presented:
8782 fixpoints are shown to be extensions of computed
8783 functions. More precisely, strong fixpoints are shown
8784 to be extensions of computed functions when the
8785 complications may involve ``call by name''
8786 substitutions; weak fixpoints are shown to be
8787 extensions of computed functions when the computation
8788 only involves ``call by value'' substitutions. The
8789 Church--Rosser property for recursive definitions with
8790 fixpoints also follows from these results.\par
8791
8792 Then conditions are given on the recursive definitions
8793 to ensure that they possess least fixpoints (of both
8794 classes), and computation rules are given for computing
8795 these two fixpoints: the 'full' computation rule, which
8796 leads to the least strong fixpoint, and the `standard
8797 innermost' computation rule, which lead, to the least
8798 weak fixpoint. A general class of computation rules,
8799 called 'safe innermost', also lead to the latter
8800 fixpoint. The ``leftmost innermost'' rule is a special
8801 case of those, for the MSP recursive definitions.",
8802 acknowledgement = ack-nhfb,
8803 advisor = "Zohar Manna",
8804 pdfpages = "165",
8805 remark = "This is the author's thesis.",
8806 }
8807
8808 @TechReport{Bonzon:1972:MPL,
8809 author = "Pierre E. Bonzon",
8810 title = "Mathematical Programming Language: an appraisal based
8811 on practical experiments",
8812 type = "Technical Report",
8813 number = "STAN-CS-72-267 (PB209629)",
8814 institution = inst-STAN-CS,
8815 address = inst-STAN-CS:adr,
8816 pages = "??",
8817 month = mar,
8818 year = "1972",
8819 bibdate = "Fri Nov 7 07:00:05 MST 2025",
8820 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
8821 URL = "http://i.stanford.edu/TR/CS-TR-72-267.html",
8822 abstract = "The newly proposed Mathematical Programming Language
8823 is approached from the user's point of view. To
8824 demonstrate its facility of use, three programs are
8825 presented which solve large scale linear programming
8826 problems with the generalized upper-bounding
8827 structure.",
8828 acknowledgement = ack-nhfb,
8829 pdfpages = "27",
8830 xxnumber = "CS-TR-72-267",
8831 }
8832
8833 @TechReport{Chvatal:1972:DM,
8834 author = "Vaclav Chv{\'a}tal",
8835 title = "Degrees and matchings",
8836 type = "Technical Report",
8837 number = "STAN-CS-72-268 (AD742348)",
8838 institution = inst-STAN-CS,
8839 address = inst-STAN-CS:adr,
8840 pages = "??",
8841 month = mar,
8842 year = "1972",
8843 bibdate = "Fri Nov 7 07:00:05 MST 2025",
8844 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
8845 URL = "http://i.stanford.edu/TR/CS-TR-72-268.html",
8846 abstract = "Let $n$, $b$, $d$ be positive integers. D. Hanson
8847 proposed to evaluate $ f(n, b, d)$, the largest
8848 possible number of edges in a graph with $n$ vertices
8849 having no vertex of degree greater than $d$ and no set
8850 of more than $b$ independent edges. Using the
8851 alternating path method, he found partial results in
8852 this direction. We complete Hanson's work; our proof
8853 technique has a linear programming flavor and uses
8854 Berge's matching formula.",
8855 acknowledgement = ack-nhfb,
8856 pdfpages = "17",
8857 xxnumber = "CS-TR-72-268",
8858 }
8859
8860 @TechReport{Klarner:1972:APC,
8861 author = "David A. Klarner and Richard Rado",
8862 title = "Arithmetic properties of certain recursively defined
8863 sets",
8864 type = "Technical Report",
8865 number = "STAN-CS-72-269 (AD742747)",
8866 institution = inst-STAN-CS,
8867 address = inst-STAN-CS:adr,
8868 pages = "??",
8869 month = mar,
8870 year = "1972",
8871 bibdate = "Fri Nov 7 07:00:05 MST 2025",
8872 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
8873 URL = "http://i.stanford.edu/TR/CS-TR-72-269.html",
8874 abstract = "Let $R$ denote a set of linear operations defined on
8875 the set $P$ of positive integers; for example, a
8876 typical element of R has the form $ \rho (x_1, \ldots,
8877 x_r) = m_0 + m_1 x_1 + \ldots + m_r x_r$ where $ m_0,
8878 \ldots, m_r $ denote certain integers. Given a set $A$
8879 of positive integers, there is a smallest set of
8880 positive integers denoted",
8881 acknowledgement = ack-nhfb,
8882 pdfpages = "31",
8883 xxnumber = "CS-TR-72-269",
8884 }
8885
8886 @TechReport{Golub:1972:LAS,
8887 author = "Gene H. Golub and Richard R. Underwood and James H.
8888 Wilkinson",
8889 title = "The {Lanczos} Algorithm for the Symmetric {$ A x =
8890 \lambda B x $} Problem",
8891 type = "Technical Report",
8892 number = "STAN-CS-72-270 (PB209616 SU326P30-16)",
8893 institution = inst-STAN-CS,
8894 address = inst-STAN-CS:adr,
8895 pages = "iii + 24",
8896 month = mar,
8897 year = "1972",
8898 bibdate = "Fri Nov 7 07:00:05 MST 2025",
8899 bibsource = "https://www.math.utah.edu/pub/bibnet/authors/g/golub-gene-h.bib;
8900 https://www.math.utah.edu/pub/bibnet/authors/l/lanczos-cornelius.bib;
8901 https://www.math.utah.edu/pub/bibnet/authors/w/wilkinson-james-hardy.bib;
8902 https://www.math.utah.edu/pub/tex/bib/gvl.bib;
8903 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
8904 URL = "http://i.stanford.edu/TR/CS-TR-72-270.html",
8905 abstract = "The problem of computing the eigensystem of $ A x =
8906 \lambda B x $ when $A$ and $B$ are symmetric and $B$ is
8907 positive definite is considered. A generalization of
8908 the Lanczos algorithm for reducing the problem to a
8909 symmetric tridiagonal eigenproblem is given. A
8910 numerically stable variant of the algorithm is
8911 described. The new algorithm depends heavily upon the
8912 computation of elementary Hermitian matrices. An ALGOL
8913 W procedure and a numerical example are also given.",
8914 acknowledgement = ack-nhfb,
8915 author-dates = "Gene Howard Golub (February 29, 1932--November 16,
8916 2007); James H. Wilkinson (27 September 1919--5 October
8917 1986)",
8918 keywords = "band; Cholesky; eigenvalue; eigenvector; elementary
8919 Hermitian matrix; error analysis; geig; generalized;
8920 Householder; Lanczos; Lanczos algorithm; matrix; nla;
8921 orthogonalization; positive definite; symmetric;
8922 tridiagonal",
8923 pdfpages = "27",
8924 subject-dates = "Cornelius Lanczos (2 February 1893--25 June 1974)",
8925 xxnumber = "CS-TR-72-270",
8926 }
8927
8928 @TechReport{Riddle:1972:MAS,
8929 author = "William E. Riddle",
8930 title = "The Modeling and Analysis of Supervisory Systems",
8931 type = "Technical Report",
8932 number = "STAN-CS-72-271",
8933 institution = inst-STAN-CS,
8934 address = inst-STAN-CS:adr,
8935 pages = "174",
8936 month = mar,
8937 year = "1972",
8938 bibdate = "Fri Nov 21 14:21:14 2025",
8939 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
8940 URL = "",
8941 acknowledgement = ack-nhfb,
8942 remark = "This is the author's thesis.",
8943 }
8944
8945 @TechReport{Manna:1972:FAT,
8946 author = "Zohar Manna and Jean Vuillemin",
8947 title = "Fixpoint approach to the theory of computation",
8948 type = "Technical Report",
8949 number = "STAN-CS-72-272 (A7IM-164, AD742748)",
8950 institution = inst-STAN-CS,
8951 address = inst-STAN-CS:adr,
8952 pages = "??",
8953 month = mar,
8954 year = "1972",
8955 bibdate = "Fri Nov 7 07:00:05 MST 2025",
8956 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
8957 URL = "http://i.stanford.edu/TR/CS-TR-72-272.html",
8958 abstract = "Following the fixpoint theory of Scott, we propose to
8959 define the semantics of computer programs in terms of
8960 the least fixpoints of recursive programs. This allows
8961 one not only to justify all existing verification
8962 techniques, but also to extend them to handle various
8963 properties of computer programs, including correctness,
8964 termination and equivalence, in a uniform manner.",
8965 acknowledgement = ack-nhfb,
8966 pdfpages = "31",
8967 xxnumber = "CS-TR-72-272",
8968 }
8969
8970 @TechReport{Chvatal:1972:CAG,
8971 author = "Vaclav Chv{\'a}tal and Jiri Sichler",
8972 title = "Chromatic automorphisms of graphs",
8973 type = "Technical Report",
8974 number = "STAN-CS-72-273 (PB209806)",
8975 institution = inst-STAN-CS,
8976 address = inst-STAN-CS:adr,
8977 pages = "??",
8978 month = mar,
8979 year = "1972",
8980 bibdate = "Fri Nov 7 07:00:05 MST 2025",
8981 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
8982 URL = "http://i.stanford.edu/TR/CS-TR-72-273.html",
8983 abstract = "The coloring group and the full automorphism group of
8984 an n-chromatic graph are independent if and only if n
8985 is an integer $ \geq $ 3.",
8986 acknowledgement = ack-nhfb,
8987 pdfpages = "13",
8988 xxnumber = "CS-TR-72-273",
8989 }
8990
8991 @TechReport{Klarner:1972:LCS,
8992 author = "D. Klarner and Richard Rado",
8993 title = "Linear Combinations of Sets of Consecutive Integers",
8994 type = "Technical Report",
8995 number = "STAN-CS-72-274 (AD742749)",
8996 institution = inst-STAN-CS,
8997 address = inst-STAN-CS:adr,
8998 pages = "12",
8999 month = mar,
9000 year = "1972",
9001 bibdate = "Fri Nov 21 14:21:14 2025",
9002 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
9003 URL = "",
9004 acknowledgement = ack-nhfb,
9005 pdfpages = "11",
9006 }
9007
9008 @TechReport{Klarner:1972:SGI,
9009 author = "David A. Klarner",
9010 title = "Sets generated by iteration of a linear operation",
9011 type = "Technical Report",
9012 number = "STAN-CS-72-275 (AD742750)",
9013 institution = inst-STAN-CS,
9014 address = inst-STAN-CS:adr,
9015 pages = "16",
9016 month = mar,
9017 year = "1972",
9018 bibdate = "Fri Nov 7 07:00:05 MST 2025",
9019 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
9020 URL = "http://i.stanford.edu/TR/CS-TR-72-275.html",
9021 abstract = "This note is a continuation of the paper
9022 `\booktitle{Arithmetic properties of certain
9023 recursively defined sets}', written in collaboration
9024 with Richard Rado. Here the sets under consideration
9025 are those having the form $ = \langle m_1 x_1 + \ldots
9026 \ + m_r x_r : 1 \rangle $ where $ m_1, \ldots, m_r $
9027 are given natural numbers with greatest common divisor
9028 1. The set $S$ is the smallest set of natural numbers
9029 which contains 1 and is closed under the operation $
9030 m_1 x_1 + \ldots \ + m_r x_r$. Also, $S$ can be
9031 constructed by iterating the operation $ m_1 x_1 +
9032 \ldots \ + m_r X_r$ over the set $ \{ 1 \} $. For
9033 example, $ \langle 2 x + 3 y : 1 \rangle = \{ 1, 5, 13,
9034 17, 25, \ldots \} = (1 + 12 N) \cup (5 + 12 N)$ where $
9035 N = \{ 0, 1, 2, \ldots \} $. It is shown in this note
9036 that $S$ contains an infinite arithmetic progression
9037 for all natural numbers $ r - 1, m_1, \ldots, m_r$.
9038 Furthermore, if $ (m_1, \ldots, m_r) = (m_1 \ldots m_r,
9039 m_1 + \ldots \ + m_r) = 1$, then $S$ is a per-set; that
9040 is, $S$ is a finite union of infinite arithmetic
9041 progressions. In particular, this implies $ (m x + n y
9042 : 1)$ is a per-set for all pairs $ \{ m, n \} $ of
9043 relatively prime natural numbers. It is an open
9044 question whether $S$ is a per-set when $ (m_1, \ldots,
9045 m_r) = 1$, but $ (m_1 \ldots m_r, m_1 + \ldots \ + m_r)
9046 > 1$.",
9047 acknowledgement = ack-nhfb,
9048 pdfpages = "11",
9049 xxnumber = "CS-TR-72-275",
9050 }
9051
9052 @TechReport{Kaufman:1972:GMS,
9053 author = "Linda Kaufman",
9054 title = "A Generalization of the {$ L R $} Method to Solve {$ A
9055 x = \lambda B x $}",
9056 type = "Technical Report",
9057 number = "STAN-CS-72-276 (AD745022)",
9058 institution = inst-STAN-CS,
9059 address = inst-STAN-CS:adr,
9060 pages = "ii + 72",
9061 month = apr,
9062 year = "1972",
9063 bibdate = "Fri Nov 21 14:21:14 2025",
9064 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
9065 URL = "https://apps.dtic.mil/sti/tr/pdf/AD0745022.pdf",
9066 abstract = "In this paper, we will present and analyze an
9067 algorithm for finding $x$ and $ \lambda $ such that $ A
9068 x = \lambda B x $ where $A$ and $B$ are $ n \timws n$
9069 matrices. The algorithm does not require matrix
9070 inversion, and may be used when either or both matrices
9071 are singular. Our method is a generalization of
9072 Rutishauser's $ L R $ method [17] for the standard
9073 eigenvalue problem $$ A x = \lambda x $$ and closely
9074 resembles the $ Q Z $ algorithm given by Moler and
9075 Stewart [10] for the generalized problem given above.
9076 Unlike the $ Q Z $ algorithm, which uses orthogonal
9077 transformations, our method, the $ L Z $ algorithm,
9078 uses elementary transformations. When either $A$ or $B$
9079 is complex, our method should be more efficient.",
9080 acknowledgement = ack-nhfb,
9081 pdfpages = "74",
9082 }
9083
9084 @TechReport{Zahn:1972:RBT,
9085 author = "C. T. Zahn",
9086 title = "Region Boundaries on a Triangular Grid",
9087 type = "Technical Report",
9088 number = "STAN-CS-72-277 (SLAC-149)",
9089 institution = inst-STAN-CS,
9090 address = inst-STAN-CS:adr,
9091 pages = "40",
9092 month = apr,
9093 year = "1972",
9094 bibdate = "Fri Nov 21 14:21:14 2025",
9095 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
9096 URL = "",
9097 acknowledgement = ack-nhfb,
9098 remark = "No PDF in DTIC or NTRL archives.",
9099 }
9100
9101 @TechReport{Concus:1972:UFD,
9102 author = "Paul Concus and Gene H. Golub",
9103 title = "Use of fast direct methods for the efficient numerical
9104 solution of nonseparable elliptic equations",
9105 type = "Technical Report",
9106 number = "STAN-CS-72-278 (SU326 P30-17)",
9107 institution = inst-STAN-CS,
9108 address = inst-STAN-CS:adr,
9109 pages = "ii + 39",
9110 month = apr,
9111 year = "1972",
9112 bibdate = "Fri Nov 7 07:00:05 MST 2025",
9113 bibsource = "https://www.math.utah.edu/pub/bibnet/authors/g/golub-gene-h.bib;
9114 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
9115 URL = "http://i.stanford.edu/TR/CS-TR-72-278.html",
9116 abstract = "We study an iterative technique for the numerical
9117 solution of strongly elliptic equations of divergence
9118 form in two dimensions with Dirichlet boundary
9119 conditions on a rectangle. The technique is based on
9120 the repeated solution by a fast direct method of a
9121 discrete Helmholtz equation on a uniform rectangular
9122 mesh. The problem is suitably scaled before iteration,
9123 and Chebyshev acceleration is applied to improve
9124 convergence. We show that convergence can be
9125 exceedingly rapid and independent of mesh size for
9126 smooth coefficients. Extensions to other boundary
9127 conditions, other equations, and irregular mesh
9128 spacings are discussed, and the performance of the
9129 technique is illustrated with numerical examples.",
9130 acknowledgement = ack-nhfb,
9131 author-dates = "Gene Howard Golub (February 29, 1932--November 16,
9132 2007)",
9133 pdfpages = "41",
9134 xxnumber = "CS-TR-72-278",
9135 }
9136
9137 @TechReport{Osborne:1972:TO,
9138 author = "Michael R. Osborne",
9139 title = "Topics in optimization",
9140 type = "Technical Report",
9141 number = "STAN-CS-72-279 (AD744313)",
9142 institution = inst-STAN-CS,
9143 address = inst-STAN-CS:adr,
9144 pages = "??",
9145 month = apr,
9146 year = "1972",
9147 bibdate = "Fri Nov 7 07:00:05 MST 2025",
9148 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
9149 URL = "http://i.stanford.edu/TR/CS-TR-72-279.html",
9150 abstract = "These notes are based on a course of lectures given at
9151 Stanford, and cover three major topics relevant to
9152 optimization theory. First an introduction is given to
9153 those results in mathematical programming which appear
9154 to be most important for the development and analysis
9155 of practical algorithms. Next unconstrained
9156 optimization problems are considered. The main emphasis
9157 is on that subclass of descent methods which (a)
9158 requires the evaluation of first derivatives of the
9159 objective function, and (b) has a family connection
9160 with the conjugate direction methods. Numerical results
9161 obtained using a program based on this material are
9162 discussed in an Appendix. In the third section, penalty
9163 and barrier function methods for mathematical
9164 programming problems are studied in some detail, and
9165 possible methods for accelerating their convergence
9166 indicated.",
9167 acknowledgement = ack-nhfb,
9168 pdfpages = "154",
9169 xxnumber = "CS-TR-72-279",
9170 }
9171
9172 @TechReport{Bochvar:1972:TPP,
9173 author = "D. A. Bochvar",
9174 title = "Two Papers on Partial Predicate Calculus",
9175 type = "Technical Report",
9176 number = "STAN-CS-72-280 (AIM-165, AD742751)",
9177 institution = inst-STAN-CS,
9178 address = inst-STAN-CS:adr,
9179 pages = "i + 50",
9180 month = apr,
9181 year = "1972",
9182 bibdate = "Fri Nov 21 14:21:14 2025",
9183 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
9184 URL = "",
9185 acknowledgement = ack-nhfb,
9186 pdfpages = "51",
9187 remark = "An abstract is present, but OCR fails to recognize
9188 most of it.",
9189 }
9190
9191 @TechReport{Quam:1972:CIP,
9192 author = "Lynn H. Quam and Sidney {Liebes, Jr.} and Robert B.
9193 Tucker and Marsha Jo Hannah and Botond G. Eross",
9194 title = "Computer interactive picture processing",
9195 type = "Technical Report",
9196 number = "STAN-CS-72-281 (AIM-166, AD743598)",
9197 institution = inst-STAN-CS,
9198 address = inst-STAN-CS:adr,
9199 pages = "??",
9200 month = apr,
9201 year = "1972",
9202 bibdate = "Fri Nov 7 07:00:05 MST 2025",
9203 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
9204 URL = "http://i.stanford.edu/TR/CS-TR-72-281.html",
9205 abstract = "This report describes work done in image processing
9206 using an interactive computer system. Techniques for
9207 image differencing are described and examples using
9208 images returned from Mars by the Mariner Nine
9209 spacecraft are shown. Also described are techniques for
9210 stereo image processing. Stereo processing for both
9211 conventional camera systems and the Viking 1975 Lander
9212 camera system is reviewed.",
9213 acknowledgement = ack-nhfb,
9214 pdfpages = "48",
9215 xxnumber = "CS-TR-72-281",
9216 }
9217
9218 @TechReport{Chandra:1972:ECL,
9219 author = "Ashok K. Chandra",
9220 title = "Efficient compilation of linear recursive programs",
9221 type = "Technical Report",
9222 number = "STAN-CS-72-282 (AIM-167, AD747254)",
9223 institution = inst-STAN-CS,
9224 address = inst-STAN-CS:adr,
9225 pages = "??",
9226 month = apr,
9227 year = "1972",
9228 bibdate = "Fri Nov 7 07:00:05 MST 2025",
9229 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
9230 URL = "http://i.stanford.edu/TR/CS-TR-72-282.html",
9231 abstract = "We consider the class of linear recursive programs. A
9232 linear recursive program is a set of procedures where
9233 each procedure can make at most one recursive call. The
9234 conventional stack implementation of recursion requires
9235 time and space both proportional to n, the depth of
9236 recursion. It is shown that in order to implement
9237 linear recursion so as to execute in time n one doesn't
9238 need space proportional to n: $ n^\epsilon $ for
9239 arbitrarily small $ \epsilon $ will do. It is also
9240 known that with constant space one can implement linear
9241 recursion in time $ n^2 $. We show that one can do much
9242 better: $ n^{1 + \epsilon } $ for arbitrarily small $
9243 \epsilon $. We also describe an algorithm that lies
9244 between these two: it takes time n.log(n) and space
9245 log(n). It is shown that several problems are closely
9246 related to the linear recursion problem, for example,
9247 the problem of reversing an input tape given a finite
9248 automaton with several one-way heads. By casting all
9249 these problems into a canonical form, efficient
9250 solutions are obtained simultaneously for all.",
9251 acknowledgement = ack-nhfb,
9252 pdfpages = "56",
9253 xxnumber = "CS-TR-72-282",
9254 }
9255
9256 @TechReport{Stoutemyer:1972:NIS,
9257 author = "David R. Stoutemyer",
9258 title = "Numerical Implementation of the {Schwarz} Alternating
9259 Procedure for Elliptic Partial Differential Equations",
9260 type = "Technical Report",
9261 number = "STAN-CS-72-283",
9262 institution = inst-STAN-CS,
9263 address = inst-STAN-CS:adr,
9264 pages = "131",
9265 month = may,
9266 year = "1972",
9267 bibdate = "Fri Nov 21 14:21:14 2025",
9268 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
9269 URL = "",
9270 acknowledgement = ack-nhfb,
9271 remark = "This is the author's thesis.",
9272 }
9273
9274 @TechReport{Chvatal:1972:EPH,
9275 author = "Vaclav Chv{\'a}tal",
9276 title = "{Edmonds} polyhedra and a hierarchy of combinatorial
9277 problems",
9278 type = "Technical Report",
9279 number = "STAN-CS-72-284 (O.R. 72-6, AD745778)",
9280 institution = inst-STAN-CS,
9281 address = inst-STAN-CS:adr,
9282 pages = "??",
9283 month = may,
9284 year = "1972",
9285 bibdate = "Fri Nov 7 07:00:05 MST 2025",
9286 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
9287 URL = "http://i.stanford.edu/TR/CS-TR-72-284.html",
9288 abstract = "Let S be a set of linear inequalities that determine a
9289 bounded polyhedron P. The closure of S is the smallest
9290 set of inequalities that contains S and is closed under
9291 two operations: (i) taking linear combinations of
9292 inequalities, (ii) replacing an inequality $ \sum \ a_j
9293 x_j \leq \ a_0 $, where $ a_1, a_2, \ldots {}, a_n $
9294 are integers, by the inequality $ \sum \ a_j x_j \leq \
9295 a $ with $ a \geq \ [a_0] $. Obviously, if integers $
9296 x_1, x_2, \ldots {}, x_n $ satisfy all the inequalities
9297 in S then they satisfy also all the inequalities in the
9298 closure of S. Conversely, let $ \sum \ c_j x_j \leq \
9299 c_0 $ hold for all choices of integers $ x_1, x_2,
9300 \ldots {}, x_n $, that satisfy all the inequalities in
9301 S. Then we prove that $ \sum \ c_j x_j \leq \ c_0 $
9302 belongs to the closure of S. To each integer linear
9303 programming problem, we assign a nonnegative integer,
9304 called its rank. (The rank is the minimum number of
9305 iterations of the operation (ii) that are required in
9306 order to eliminate the integrality constraint.) We
9307 prove that there is no upper bound on the rank of
9308 problems arising from the search for largest
9309 independent sets in graphs.",
9310 acknowledgement = ack-nhfb,
9311 pdfpages = "52",
9312 xxnumber = "CS-TR-72-284",
9313 }
9314
9315 @TechReport{Floyd:1972:LTT,
9316 author = "Robert W. Floyd and Alan J. Smith",
9317 title = "A Linear Time Two Tape Merge",
9318 type = "Technical Report",
9319 number = "STAN-CS-72-285 (PB210910)",
9320 institution = inst-STAN-CS,
9321 address = inst-STAN-CS:adr,
9322 pages = "16",
9323 month = may,
9324 year = "1972",
9325 bibdate = "Fri Nov 21 14:21:14 2025",
9326 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
9327 URL = "",
9328 acknowledgement = ack-nhfb,
9329 author-dates = "Robert W. Floyd (8 June 1936--25 September 2001)",
9330 remark = "No PDF in DTIC or NTRL archives.",
9331 }
9332
9333 @TechReport{Chandra:1972:SMP,
9334 author = "Ashok K. Chandra",
9335 title = "On the solution of {Moser}'s problem in four
9336 dimensions, and related issues. {A} collection of two
9337 papers: On the solution of {Moser}'s problem in four
9338 dimensions and Independent permutations as related to a
9339 problem of {Moser} and a theorem of {Polya}",
9340 type = "Technical Report",
9341 number = "STAN-CS-72-286 (PB211036)",
9342 institution = inst-STAN-CS,
9343 address = inst-STAN-CS:adr,
9344 pages = "??",
9345 month = may,
9346 year = "1972",
9347 bibdate = "Fri Nov 7 07:00:05 MST 2025",
9348 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
9349 URL = "http://i.stanford.edu/TR/CS-TR-72-286.html",
9350 abstract = "The problem of finding the largest set of nodes in a
9351 d-cube of side 3 such that no three nodes are collinear
9352 was proposed by Moser. Small values of d (viz., $ d
9353 \leq \ 3$) resulted in elegant symmetric solutions. It
9354 is shown that this does not remain the case in 4
9355 dimensions where at most 43 nodes can be chosen, and
9356 these must not include the center node.",
9357 acknowledgement = ack-nhfb,
9358 pdfpages = "35",
9359 xxnumber = "CS-TR-72-286",
9360 }
9361
9362 @TechReport{Igarashi:1972:AFP,
9363 author = "Shigeru Igarashi",
9364 title = "Admissibility of Fixed-Point Induction in First-Order
9365 Logic of Typed Theories",
9366 type = "Technical Report",
9367 number = "STAN-CS-72-287 (AIM-168, AD746146)",
9368 institution = inst-STAN-CS,
9369 address = inst-STAN-CS:adr,
9370 pages = "iii + 41",
9371 month = may,
9372 year = "1972",
9373 DOI = "https://doi.org/10.1007/3-540-06720-5_22",
9374 bibdate = "Thu Nov 27 18:06:23 2025",
9375 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
9376 URL = "https://dl.acm.org/doi/10.5555/646795.759643",
9377 acknowledgement = ack-nhfb,
9378 pdfpages = "44",
9379 remark = "Abstract is present, but OCR recognition is too poor.
9380 Published in \booktitle{Proceedings of the
9381 International Symposium on Theoretical Programming},
9382 Pages 344--383, 07 August 1972.",
9383 }
9384
9385 @TechReport{Milner:1972:LCF,
9386 author = "Robin Milner",
9387 title = "Logic for Computable Functions: Description of a
9388 Machine Implementation",
9389 type = "Technical Report",
9390 number = "STAN-CS-72-288 (AIM-169)",
9391 institution = inst-STAN-CS,
9392 address = inst-STAN-CS:adr,
9393 pages = "ii + 36",
9394 month = may,
9395 year = "1972",
9396 bibdate = "Fri Nov 7 07:00:05 MST 2025",
9397 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
9398 URL = "http://i.stanford.edu/TR/CS-TR-72-288.html;
9399 https://apps.dtic.mil/sti/pdfs/AD0785072.pdf",
9400 abstract = "This paper is primarily a user's manual for LCF, a
9401 proof-checking program for a logic of computable
9402 functions proposed by Dana Scott in 1969 but
9403 unpublished by him. We use the name LCF also for the
9404 logic itself, which is presented at the start of the
9405 paper. The proof-checking program is designed to allow
9406 the user interactively to generate formal proofs about
9407 computable functions and functionals over a variety of
9408 domains, including those of interest to the computer
9409 scientist - for example, integers, lists and computer
9410 programs and their semantics. The user's task is
9411 alleviated by two features: a subgoaling facility and a
9412 powerful simplification mechanism. Applications include
9413 proofs of program correctness and in particular of
9414 compiler correctness; these applications are not
9415 discussed herein, but are illustrated in the papers
9416 referenced in this introduction.",
9417 acknowledgement = ack-nhfb,
9418 pdfpages = "42",
9419 xxnumber = "CS-TR-72-288",
9420 }
9421
9422 @TechReport{Wilks:1972:LLN,
9423 author = "Yorick A. Wilks",
9424 title = "{Lakoff} on linguistics and natural logic",
9425 type = "Technical Report",
9426 number = "STAN-CS-72-289 (AIM-170, AD748607)",
9427 institution = inst-STAN-CS,
9428 address = inst-STAN-CS:adr,
9429 pages = "??",
9430 month = jun,
9431 year = "1972",
9432 bibdate = "Fri Nov 7 07:00:05 MST 2025",
9433 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
9434 URL = "http://i.stanford.edu/TR/CS-TR-72-289.html",
9435 abstract = "The paper examines and criticises Lakoff's notions of
9436 a natural logic and of a generative semantics described
9437 in terms of logic. I argue that the relationship of
9438 these notions to logic as normally understood is
9439 unclear, but I suggest, in the course of the paper, a
9440 number of possible interpretations of his thesis of
9441 generative semantics. I argue further that on these
9442 interpretations the thesis (of Generative Semantics) is
9443 false, unless it be taken as a mere notational variant
9444 of Chomskyan theory. I argue, too, that Lakoff's work
9445 may provide a service in that it constitutes a {\em
9446 reductio ad absurdum\/} of the derivational paradigm of
9447 modern linguistics; and shows, inadvertently, that only
9448 a system with the ability to reconsider its own
9449 inferences can do the job that Lakoff sets up for
9450 linguistic enquiry --- that is to say, only an
9451 `artificial intelligence' system.",
9452 acknowledgement = ack-nhfb,
9453 pdfpages = "21",
9454 xxnumber = "CS-TR-72-289",
9455 }
9456
9457 @TechReport{Schank:1972:AB,
9458 author = "Roger C. Schank",
9459 title = "Adverbs and belief",
9460 type = "Technical Report",
9461 number = "STAN-CS-72-290 (AIM-171, AD746147)",
9462 institution = inst-STAN-CS,
9463 address = inst-STAN-CS:adr,
9464 pages = "??",
9465 month = jun,
9466 year = "1972",
9467 bibdate = "Fri Nov 7 07:00:05 MST 2025",
9468 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
9469 URL = "http://i.stanford.edu/TR/CS-TR-72-290.html",
9470 abstract = "The treatment of a certain class of adverbs in
9471 conceptual representation is given. Certain adverbs are
9472 shown to be representative of complex belief
9473 structures. These adverbs serve as pointers that
9474 explain where the sentence that they modify belongs in
9475 a belief structure.",
9476 acknowledgement = ack-nhfb,
9477 pdfpages = "36",
9478 xxnumber = "CS-TR-72-290",
9479 }
9480
9481 @TechReport{Knuth:1972:SCL,
9482 author = "Donald E. Knuth",
9483 title = "Some combinatorial lemmas",
9484 type = "Technical Report",
9485 number = "STAN-CS-72-291 (AD746189)",
9486 institution = inst-STAN-CS,
9487 address = inst-STAN-CS:adr,
9488 pages = "??",
9489 day = "1",
9490 month = jun,
9491 year = "1972",
9492 bibdate = "Fri Nov 7 07:00:05 MST 2025",
9493 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
9494 URL = "http://i.stanford.edu/TR/CS-TR-72-291.html;
9495 http://www-db.stanford.edu/TR/CS-TR-72-291.html;
9496 http://www.ncstrl.org:8900/ncstrl/servlet/search?formname=detail&id=oai%3Ancstrlh%3Astan%3ASTAN%2F%2FCS-TR-72-291",
9497 abstract = "This report consists of several short papers which are
9498 completely independent of each other: 1. ``Wheels
9499 Within Wheels.'' Every finite strongly connected
9500 digraph is either a single point or a set of $n$
9501 smaller strongly connected digraphs joined by an
9502 oriented cycle of length $n$. This result is proved in
9503 somewhat stronger form, and two applications are given.
9504 2. ``An Experiment in Optimal Sorting.'' An
9505 unsuccessful attempt, to sort 13 or 14 elements in less
9506 comparisons than the Ford--Johnson algorithm, is
9507 described. (Coauthor: E. B. Kaehler.) 3. ``Permutations
9508 With Nonnegative Partial Sums.'' A sequence of $s$
9509 positive and $t$ negative real numbers, whose sum is
9510 zero, can be arranged in at least $ (s + t - 1)!$ and
9511 at most $ (s + t)! / (\max (s, t) + 1) < 2 (s + t -
9512 1)!$ ways such that the partial sums $ x_1 + \cdots {}
9513 + x_j$ are nonnegative for $ 1 \leq j \leq s + t$.",
9514 acknowledgement = ack-nhfb,
9515 documentid = "oai:ncstrlh:stan:STAN//CS-TR-72-291",
9516 pdfpages = "22",
9517 xxnumber = "CS-TR-72-291",
9518 }
9519
9520 @TechReport{Chvatal:1972:SCR,
9521 author = "Vaclav Chv{\'a}tal and David A. Klarner and Donald E.
9522 Knuth",
9523 title = "Selected combinatorial research problems",
9524 type = "Technical Report",
9525 number = "STAN-CS-72-292 (AD746150)",
9526 institution = inst-STAN-CS,
9527 address = inst-STAN-CS:adr,
9528 pages = "??",
9529 day = "1",
9530 month = jun,
9531 year = "1972",
9532 bibdate = "Fri Nov 7 07:00:05 MST 2025",
9533 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
9534 URL = "http://i.stanford.edu/TR/CS-TR-72-292.html;
9535 http://www-db.stanford.edu/TR/CS-TR-72-292.html;
9536 http://www.ncstrl.org:8900/ncstrl/servlet/search?formname=detail&id=oai%3Ancstrlh%3Astan%3ASTAN%2F%2FCS-TR-72-292",
9537 abstract = "Thirty-seven research problems are described, covering
9538 a wide range of combinatorial topics. Unlike Hilbert's
9539 problems, most of these are not especially famous and
9540 they might be ``do-able'' in the next few years.
9541 (Problems 1--16 were contributed by Klarner, 17--26 by
9542 Chv{\'a}tal, 27--37 by Knuth). All cash awards are
9543 Chv{\'a}tal's responsibility.",
9544 acknowledgement = ack-nhfb,
9545 documentid = "oai:ncstrlh:stan:STAN//CS-TR-72-292",
9546 pdfpages = "31",
9547 xxnumber = "CS-TR-72-292",
9548 }
9549
9550 @TechReport{Lukes:1972:CSP,
9551 author = "J. A. Lukes",
9552 title = "Combinatorial Solutions to Partitioning Problems",
9553 type = "Technical Report",
9554 number = "STAN-CS-72-293 (CSL-TN-32, PB212234)",
9555 institution = inst-STAN-CS,
9556 address = inst-STAN-CS:adr,
9557 pages = "xi + 120",
9558 month = jun,
9559 year = "1972",
9560 bibdate = "Fri Nov 21 14:21:14 2025",
9561 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
9562 URL = "",
9563 abstract = "In this dissertation we describe algorithms that use
9564 graph properties and dynamic programming techniques to
9565 generate the optimal partition of an arbitrary graph.
9566 In particular, let $G$ be a graph with weighted nodes
9567 and weighted edges. We consider algorithms that solve
9568 the problem of partitioning $G$ into clusters of nodes
9569 such that the sum of the node weights in any cluster
9570 does not exceed a given maximum $W$ and the weights of
9571 the intercluster edges are minimized. An interesting
9572 application of such an algorithm is the assignment of a
9573 program's subroutines and data to pages in a paged
9574 memory system so as to minimize paging faults.
9575 \ldots{}",
9576 acknowledgement = ack-nhfb,
9577 advisor = "Harold S. Stone",
9578 pdfpages = "131",
9579 remark = "This is the author's thesis.",
9580 }
9581
9582 @TechReport{Saal:1972:MIC,
9583 author = "Harry J. Saal and Leonard J. Shustek",
9584 title = "Microprogrammed Implementation of Computer Measurement
9585 Techniques",
9586 type = "Technical Report",
9587 number = "STAN-CS-72-294 (SLACP-1072)",
9588 institution = inst-STAN-CS,
9589 address = inst-STAN-CS:adr,
9590 pages = "20",
9591 month = jun,
9592 year = "1972",
9593 bibdate = "Fri Nov 21 14:21:14 2025",
9594 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
9595 URL = "",
9596 acknowledgement = ack-nhfb,
9597 }
9598
9599 @TechReport{Paige:1972:BMS,
9600 author = "C. C. Paige",
9601 title = "Bidiagonalization of Matrices and Solution of Linear
9602 Equations",
9603 type = "Technical Report",
9604 number = "STAN-CS-72-295 (PB212130)",
9605 institution = inst-STAN-CS,
9606 address = inst-STAN-CS:adr,
9607 pages = "ii + 28",
9608 month = jun,
9609 year = "1972",
9610 bibdate = "Fri Nov 21 14:21:14 2025",
9611 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
9612 URL = "",
9613 abstract = "An algorithm given by Golub and Kahan [2] for reducing
9614 a general matrix to bidiagonal form is shown to be very
9615 important for large sparse matrices, The singular
9616 values of the matrix are those of the bidiagonal form,
9617 and these can be easily computed. The bidiagonalization
9618 algorithm is shown to be the basis of important methods
9619 for solving the linear least squares problem for large
9620 sparse matrices. Eigenvalues of certain 2-cyclic
9621 matrices can also be efficiently computed using this
9622 bidiagonalization.",
9623 acknowledgement = ack-nhfb,
9624 keywords = "bidiagonalization; conjugate gradients; eigenvalues;
9625 least squares; linear equations; minimized iterations;
9626 singular values",
9627 pdfpages = "30",
9628 }
9629
9630 @TechReport{Fredman:1972:GPC,
9631 author = "Michael L. Fredman",
9632 title = "Growth Properties of a Class of Recursively Defined
9633 Functions",
9634 type = "Technical Report",
9635 number = "STAN-CS-72-296 (AD748606)",
9636 institution = inst-STAN-CS,
9637 address = inst-STAN-CS:adr,
9638 pages = "84",
9639 month = jun,
9640 year = "1972",
9641 bibdate = "Fri Nov 21 14:21:14 2025",
9642 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
9643 URL = "",
9644 acknowledgement = ack-nhfb,
9645 remark = "This is the author's thesis. No PDF in NTRL archive.",
9646 }
9647
9648 @TechReport{Paige:1972:EAM,
9649 author = "C. C. Paige",
9650 title = "An Error Analysis of a Method for Solving Matrix
9651 Equations",
9652 type = "Technical Report",
9653 number = "STAN-CS-72-297 (PB212300)",
9654 institution = inst-STAN-CS,
9655 address = inst-STAN-CS:adr,
9656 pages = "13",
9657 month = jun,
9658 year = "1972",
9659 bibdate = "Fri Nov 21 14:21:14 2025",
9660 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
9661 URL = "",
9662 acknowledgement = ack-nhfb,
9663 pdfpages = "15",
9664 remark = "Abstract is present, but OCR recognition is too
9665 poor.",
9666 }
9667
9668 @TechReport{Kogge:1972:PAEa,
9669 author = "Peter M. Kogge and Harold S. Stone",
9670 title = "A Parallel Algorithm for the Efficient Solution of a
9671 General Class of Recurrence Equations",
9672 type = "Technical Report",
9673 number = "STAN-CS-72-298 (CSL-TR-25)",
9674 institution = inst-STAN-CS,
9675 address = inst-STAN-CS:adr,
9676 pages = "33",
9677 month = jul,
9678 year = "1972",
9679 DOI = "https://doi.org/10.1109/TC.1973.5009159",
9680 bibdate = "Fri Nov 21 14:21:14 2025",
9681 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
9682 URL = "",
9683 acknowledgement = ack-nhfb,
9684 remark = "Published in \booktitle{IEEE Transactions on
9685 Computers}, {\bf C-22}(8), 786--793, August 1973,
9686 doi:10.1109/TC.1973.5009159. No PDF in DTIC or NTRL.",
9687 }
9688
9689 @TechReport{Russell:1972:SCN,
9690 author = "Sylvia Weber Russell",
9691 title = "semantic categories of nominals for conceptual
9692 dependency analysis of natural language",
9693 type = "Technical Report",
9694 number = "STAN-CS-72-299 (AIM-172, AD752801)",
9695 institution = inst-STAN-CS,
9696 address = inst-STAN-CS:adr,
9697 pages = "??",
9698 month = jul,
9699 year = "1972",
9700 bibdate = "Fri Nov 7 07:00:05 MST 2025",
9701 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
9702 URL = "http://i.stanford.edu/TR/CS-TR-72-299.html",
9703 abstract = "A system for the semantic categorization of conceptual
9704 objects (nominals) is provided. The system is intended
9705 to aid computer understanding of natural language.
9706 Specific implementations for `noun-pairs' and
9707 prepositional phrases are offered.",
9708 acknowledgement = ack-nhfb,
9709 pdfpages = "74",
9710 xxnumber = "CS-TR-72-299",
9711 }
9712
9713 @TechReport{Kaufman:1972:CCF,
9714 author = "Marc T. Kaufman",
9715 title = "Counterexample to a conjecture of {Fujii}, {Kasami}
9716 and {Ninomiya}",
9717 type = "Technical Report",
9718 number = "STAN-CS-72-300 (CSL-TN-17, AD749848)",
9719 institution = inst-STAN-CS,
9720 address = inst-STAN-CS:adr,
9721 pages = "??",
9722 month = jun,
9723 year = "1972",
9724 bibdate = "Fri Nov 7 07:00:05 MST 2025",
9725 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
9726 URL = "http://i.stanford.edu/TR/CS-TR-72-300.html",
9727 abstract = "In a recent paper [1], Fujii, Kasami and Ninomiya
9728 presented a procedure for the optimal scheduling of a
9729 system of unit length tasks represented as a directed
9730 acyclic graph on two identical processors. The authors
9731 conjecture that the algorithm can be extended to the
9732 case where more than two processors are employed. This
9733 note presents a counterexample to that conjecture. [1]
9734 Fujii, M., T. Kasami and K. Ninomiya, `Optimal
9735 Sequencing of Two Equivalent Processors, SIAM J. Appl.
9736 Math., Vol. 17, No.4, July 1969, pp. 784-789.",
9737 acknowledgement = ack-nhfb,
9738 pdfpages = "4",
9739 xxnumber = "CS-TR-72-300",
9740 }
9741
9742 @TechReport{Saunders:1972:PFC,
9743 author = "Michael A. Saunders",
9744 title = "Product form of the {Cholesky} factorization for
9745 large-scale linear programming",
9746 type = "Technical Report",
9747 number = "STAN-CS-72-301 (SU326 P30-21)",
9748 institution = inst-STAN-CS,
9749 address = inst-STAN-CS:adr,
9750 pages = "??",
9751 month = aug,
9752 year = "1972",
9753 bibdate = "Fri Nov 7 07:00:05 MST 2025",
9754 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
9755 URL = "http://i.stanford.edu/TR/CS-TR-72-301.html",
9756 abstract = "A variation of Gill and Murray's version of the
9757 revised simplex algorithm is proposed, using the
9758 Cholesky factorization $ {BB}^T = {LDL}^T $ where B is
9759 the usual basis, D is diagonal and L is unit lower
9760 triangular. It is shown that during change of basis L
9761 may be updated in product form. As with standard
9762 methods using the product form of inverse, this allows
9763 use of sequential storage devices for accumulating
9764 updates to L. In addition the favorable numerical
9765 properties of Gill and Murray's algorithm are retained.
9766 Cloase attention is given to efficient out-of-core
9767 implementation. In the case of large-scale
9768 block-angular problems, the updates to L will remain
9769 very sparse for all iterations.",
9770 acknowledgement = ack-nhfb,
9771 pdfpages = "41",
9772 xxnumber = "CS-TR-72-301",
9773 }
9774
9775 @TechReport{Golub:1972:SUL,
9776 author = "G. H. Golub",
9777 title = "Some Uses of the {Lanczos} Algorithm in Numerical
9778 Linear Algebra",
9779 type = "Technical Report",
9780 number = "STAN-CS-72-302 (SU326, P30-19)",
9781 institution = inst-STAN-CS,
9782 address = inst-STAN-CS:adr,
9783 pages = "23",
9784 month = aug,
9785 year = "1972",
9786 bibdate = "Fri Nov 21 14:21:14 2025",
9787 bibsource = "https://www.math.utah.edu/pub/bibnet/authors/g/golub-gene-h.bib;
9788 https://www.math.utah.edu/pub/bibnet/authors/l/lanczos-cornelius.bib;
9789 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
9790 URL = "",
9791 acknowledgement = ack-nhfb,
9792 remark = "No PDF in NTRL archive.",
9793 subject-dates = "Cornelius Lanczos (2 February 1893--25 June 1974);
9794 Gene Howard Golub (February 29, 1932--November 16,
9795 2007)",
9796 }
9797
9798 @TechReport{Morris:1972:CTP,
9799 author = "Francis Lockwood Morris",
9800 title = "Correctness of Translations of Programming Languages
9801 --- an Algebraic Approach",
9802 type = "Technical Report",
9803 number = "STAN-CS-72-303 (AIM-174, PB212827, AD-A954771)",
9804 institution = inst-STAN-CS,
9805 address = inst-STAN-CS:adr,
9806 pages = "iii + 126",
9807 month = aug,
9808 year = "1972",
9809 bibdate = "Fri Nov 21 14:21:14 2025",
9810 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
9811 URL = "",
9812 abstract = "Programming languages and their sets of meanings can
9813 be modelled by general operator algebras; semantic
9814 functions and compiling functions by homomorphisms of
9815 operator algebras. A restricted class of individual to
9816 computing are compatible: the semantic function
9817 provided by interpreting (``running'') one binary
9818 relational algebra on another is a homomorphism on an
9819 operator algebra whose elements are binary relational
9820 algebras.\par
9821
9822 Using these mathematical tools, proofs can be provided
9823 systematically of the correctness of compilers for
9824 fragmentary programming languages, each embodying a
9825 single language `feature'. Exemplary proofs are given
9826 for statement sequences, arithmetic expressions,
9827 Boolean expressions, assignment statements, and while
9828 statements. Moreover, proofs of this sort can be
9829 combined to provide (synthetic) proofs for, in
9830 principle, many different complete programming
9831 languages. One example of such a synthesis is given.",
9832 acknowledgement = ack-nhfb,
9833 pdfpages = "129",
9834 remark = "This is the author's thesis.",
9835 }
9836
9837 @TechReport{Anderssen:1972:RNS,
9838 author = "Robert S. Anderssen and Gene H. Golub",
9839 title = "{Richardson}'s non-stationary matrix iterative
9840 procedure",
9841 type = "Technical Report",
9842 number = "STAN-CS-72-304 (SU326 P30-20)",
9843 institution = inst-STAN-CS,
9844 address = inst-STAN-CS:adr,
9845 pages = "76",
9846 month = aug,
9847 year = "1972",
9848 bibdate = "Fri Nov 7 07:00:05 MST 2025",
9849 bibsource = "https://www.math.utah.edu/pub/bibnet/authors/g/golub-gene-h.bib;
9850 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
9851 URL = "http://i.stanford.edu/TR/CS-TR-72-304.html",
9852 abstract = "Because of its simplicity, Richardson's non-stationary
9853 iterative scheme is a potentially powerful method for
9854 the solution of (linear) operator equations. However,
9855 its general application has more or less been blocked
9856 by (a) the problem of constructing polynomials, which
9857 deviate least from zero on the spectrum of the given
9858 operator, and which are required for the determination
9859 of the iteration parameters of the non-stationary
9860 method, and (b) the instability of this scheme with
9861 respect to rounding error effects. Recently, these
9862 difficulties were examined in two Russian papers. In
9863 the first, Lebedev [1969] constructed polynomials which
9864 deviate least from zero on a set of subintervals of the
9865 real axis which contains the spectrum of the given
9866 operator. In the second, Lebedev and Finogenov [1971]
9867 gave an ordering for the iteration parameters of the
9868 non-stationary Richardson scheme which makes it a
9869 stable numerical process. Translation of these two
9870 papers appear as Appendices 1 and 2, respectively, in
9871 this report. The body of the report represents an
9872 examination of the properties of Richardson's
9873 non-stationary scheme and the pertinence of the two
9874 mentioned papers along with the results of numerical
9875 experimentation testing the actual implementation of
9876 the procedures given in them.",
9877 acknowledgement = ack-nhfb,
9878 author-dates = "Gene Howard Golub (February 29, 1932--November 16,
9879 2007)",
9880 pdfpages = "76",
9881 xxnumber = "CS-TR-72-304",
9882 }
9883
9884 @TechReport{Agin:1972:RDC,
9885 author = "Gerald Jacob Agin",
9886 title = "Representation and Description of Curved Objects",
9887 type = "Technical Report",
9888 number = "STAN-CS-72-305 (AIM-173, AD755139)",
9889 institution = inst-STAN-CS,
9890 address = inst-STAN-CS:adr,
9891 pages = "iv + 133",
9892 month = oct,
9893 year = "1972",
9894 bibdate = "Fri Nov 21 14:21:14 2025",
9895 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
9896 URL = "",
9897 acknowledgement = ack-nhfb,
9898 pdfpages = "140",
9899 remark = "This is the author's thesis.",
9900 }
9901
9902 @TechReport{Pollack:1972:BCG,
9903 author = "Bary W. Pollack",
9904 title = "A bibliography on computer graphics",
9905 type = "Technical Report",
9906 number = "STAN-CS-72-306 (SU326 P23-X-2)",
9907 institution = inst-STAN-CS,
9908 address = inst-STAN-CS:adr,
9909 pages = "??",
9910 month = aug,
9911 year = "1972",
9912 bibdate = "Fri Nov 7 07:00:05 MST 2025",
9913 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
9914 URL = "http://i.stanford.edu/TR/CS-TR-72-306.html",
9915 abstract = "This bibliography includes the most important works
9916 describing the software aspects of generative computer
9917 graphics. As such it will be of most usefullness to
9918 researchers, system designers and programmers whose
9919 interests and responsibilities include the development
9920 of software systems for interactive graphical
9921 input/output. The bibliography does include a short
9922 section on hardware systems. Image analysis, pattern
9923 recognition and picture processing and related fields
9924 are rather poorly represented here. The interested
9925 researcher is referred to journals in this field and to
9926 the reports of Azriel Rosenfeld, University of
9927 Maryland, which include excellent bibliographic
9928 references.",
9929 acknowledgement = ack-nhfb,
9930 pdfpages = "156",
9931 xxnumber = "CS-TR-72-306 (SU326 P23-X-2)",
9932 }
9933
9934 @TechReport{Tanaka:1972:HTS,
9935 author = "Hozumi Tanaka",
9936 title = "{Hadamard} transform for speech wave analysis",
9937 type = "Technical Report",
9938 number = "STAN-CS-72-307 (AIM-175)",
9939 institution = inst-STAN-CS,
9940 address = inst-STAN-CS:adr,
9941 pages = "??",
9942 month = aug,
9943 year = "1972",
9944 bibdate = "Fri Nov 7 07:00:05 MST 2025",
9945 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
9946 URL = "http://i.stanford.edu/TR/CS-TR-72-307.html",
9947 abstract = "Two methods of speech wave analysis using the Hadamard
9948 transform are discussed. The first method is a direct
9949 application of the Hadamard transform for speech waves.
9950 The reason this method yields poor results is
9951 discussed. The second method is the application of the
9952 Hadamard transform to a log-magnitude frequency
9953 spectrum. After the application of the Fourier
9954 transform the Hadamard transform is applied to detect a
9955 pitch period or to get a smoothed spectrum. This method
9956 shows some positive aspects of the Hadamard transform
9957 for the analysis of a speech wave with regard to the
9958 reduction of processing time required for smoothing,
9959 but at the cost of precision. A formant tracking
9960 program for voiced speech is implemented by using this
9961 method and an edge following technique used in scene
9962 analysis.",
9963 acknowledgement = ack-nhfb,
9964 pdfpages = "34",
9965 xxnumber = "CS-TR-72-307",
9966 }
9967
9968 @TechReport{Feldman:1972:RDS,
9969 author = "Jerome A. Feldman and James R. Low and Daniel C.
9970 Swinehart and Russell H. Taylor",
9971 title = "Recent developments in {SAIL}, an {ALGOL}-based
9972 language for artificial intelligence",
9973 type = "Technical Report",
9974 number = "STAN-CS-72-308 (AIM-176, AD754109)",
9975 institution = inst-STAN-CS,
9976 address = inst-STAN-CS:adr,
9977 pages = "??",
9978 month = nov,
9979 year = "1972",
9980 bibdate = "Fri Nov 7 07:00:05 MST 2025",
9981 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
9982 URL = "http://i.stanford.edu/TR/CS-TR-72-308.html",
9983 abstract = "New features added to SAIL, an ALGOL based language
9984 for the PDP-10, are discussed. The features include:
9985 procedure variables; multiple processes; coroutines; a
9986 limited form of backtracking; an event mechanism for
9987 inter-process communication; and matching procedures, a
9988 new way of searching the LEAP associative data base.",
9989 acknowledgement = ack-nhfb,
9990 pdfpages = "28",
9991 xxnumber = "CS-TR-72-308",
9992 }
9993
9994 @TechReport{Lesser:1972:DCS,
9995 author = "V. Lesser",
9996 title = "Dynamic Control Structures and Their Use in
9997 Emulation",
9998 type = "Technical Report",
9999 number = "STAN-CS-72-309",
10000 institution = inst-STAN-CS,
10001 address = inst-STAN-CS:adr,
10002 pages = "251",
10003 month = aug,
10004 year = "1972",
10005 bibdate = "Fri Nov 21 14:21:14 2025",
10006 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
10007 URL = "",
10008 acknowledgement = ack-nhfb,
10009 remark = "This is the author's thesis.",
10010 }
10011
10012 @TechReport{Kaufman:1972:ASU,
10013 author = "Marc T. Kaufman",
10014 title = "Anomalies in scheduling unit-time tasks",
10015 type = "Technical Report",
10016 number = "STAN-CS-72-310 (CSL-TR-34, AD750671)",
10017 institution = inst-STAN-CS,
10018 address = inst-STAN-CS:adr,
10019 pages = "??",
10020 month = jun,
10021 year = "1972",
10022 bibdate = "Fri Nov 7 07:00:05 MST 2025",
10023 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
10024 URL = "http://i.stanford.edu/TR/CS-TR-72-310.html",
10025 abstract = "In this paper we examine the problem of scheduling a
10026 set of tasks on a system with a number of identical
10027 processors. Several timing anomalies are known to exist
10028 for the general case, in which the execution time can
10029 increase when inter-task constraints are removed or
10030 processors are added. It is shown that these anomalies
10031 also exist when tasks are restricted to be of equal
10032 (unit) length. Several, increasingly restrictive,
10033 heuristic scheduling algorithms are reviewed. The
10034 `added processor' anomaly is shown to persist through
10035 all of them, though in successively weaker form.",
10036 acknowledgement = ack-nhfb,
10037 pdfpages = "32",
10038 xxnumber = "CS-TR-72-310",
10039 }
10040
10041 @TechReport{Paul:1972:MTC,
10042 author = "Richard Paul",
10043 title = "Modelling, Trajectory Calculation and Serving of a
10044 Computer Controlled Arm",
10045 type = "Technical Report",
10046 number = "STAN-CS-72-311 (AIM-177, AD785071)",
10047 institution = inst-STAN-CS,
10048 address = inst-STAN-CS:adr,
10049 pages = "iv + 89",
10050 month = nov,
10051 year = "1972",
10052 bibdate = "Fri Nov 21 14:21:14 2025",
10053 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
10054 URL = "https://apps.dtic.mil/sti/tr/pdf/AD0785071.pdf",
10055 abstract = "The problem of computer control of an arm is divided
10056 into four parts: modelling, trajectory calculation,
10057 servoing and control.\par
10058
10059 In modelling we use a symbolic data structure to
10060 represent objects in the environment. The program
10061 considers hew the hand may be positioned to grasp these
10062 objects and plans how to turn and position them in
10063 order to make various moves. An arm model if used to
10064 calculate the configuration-dependent dynamic
10065 properties of the arm before it is moved.\par
10066
10067 The arm is moved along time-coordinated space
10068 trajectories in which velocity and acceleration are
10069 controlled. Trajectories are calculated for motions
10070 along defined space curves, as in turning a crank; in
10071 such trajectories various joints must be free due to
10072 external motion constraints.\par
10073
10074 The arm is servoed by a small computer. No analog servo
10075 is used. The servo is compensated for gravity loading
10076 and for configuration-dependent dynamic properties of
10077 the arm.\par
10078
10079 In order to control the arm, a planning program
10080 interprets symbolic arm control instructions and
10081 generates a plan consisting of arm motion and hand
10082 actions.\par
10083
10084 The move planning program has worked successfully in
10085 the manipulation of plane faced objects. Complex
10086 motions, such as locating a bolt and screwing a nut
10087 onto it, have also been performed.",
10088 acknowledgement = ack-nhfb,
10089 pdfpages = "96",
10090 remark = "This is the author's thesis.",
10091 }
10092
10093 @TechReport{Gill:1972:VFR,
10094 author = "Aharon Gill",
10095 title = "Visual Feedback and Related Problems in Computer
10096 Controlled Hand-Eye Coordination",
10097 type = "Technical Report",
10098 number = "STAN-CS-72-312 (AIM-178, AD754108)",
10099 institution = inst-STAN-CS,
10100 address = inst-STAN-CS:adr,
10101 pages = "v + 130",
10102 month = oct,
10103 year = "1972",
10104 bibdate = "Fri Nov 21 14:21:14 2025",
10105 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
10106 URL = "",
10107 abstract = "A set of programs for precise manipulation of simple
10108 planar bounded objects, by means of visual feedback,
10109 was developed for use in the Stanford hand--eye system.
10110 The system includes a six degrees of freedom computer
10111 controlled manipulator (arm and hand) and a fully
10112 instrumented computer controlled television
10113 camera.\par
10114
10115 The image of the hand and manipulated objects is
10116 acquired by the computer through the camera. The stored
10117 image is analyzed using a corner and line finding
10118 program developed for this purpose. The analysis is
10119 simplified by using all the information available about
10120 the objects and the hand, and previously measured
10121 coordination errors. Simple touch and force sensing by
10122 the arm help the determination of three dimensional
10123 positions from one view.\par
10124
10125 The utility of the information used to simplify the
10126 scene analysis depends on the accuracy of the
10127 geometrical models of the camera and arm. A set of
10128 calibration updating techniques and program was
10129 developed to maintain the accuracy of the camera model
10130 relative to the arm model.\par
10131
10132 The precision obtained is better than 0.1 inch. It is
10133 limited by the resolution of the imaging system and of
10134 the arm position measuring system.",
10135 acknowledgement = ack-nhfb,
10136 pdfpages = "140",
10137 remark = "This is the author's thesis.",
10138 }
10139
10140 @TechReport{Staff:1972:BCS,
10141 author = "{Staff}",
10142 title = "Bibliography of Computer Science Reports",
10143 type = "Technical Report",
10144 number = "STAN-CS-72-313 (PB218353/1)",
10145 institution = inst-STAN-CS,
10146 address = inst-STAN-CS:adr,
10147 pages = "42",
10148 month = sep,
10149 year = "1972",
10150 bibdate = "Fri Nov 21 14:21:14 2025",
10151 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
10152 URL = "",
10153 acknowledgement = ack-nhfb,
10154 remark = "No PDF in NTRL archive.",
10155 }
10156
10157 @TechReport{Kogge:1972:PAEb,
10158 author = "Peter M. Kogge",
10159 title = "Parallel Algorithms for the Efficient Solution of
10160 Recurrence Problems",
10161 type = "Technical Report",
10162 number = "STAN-CS-72-314 (CSL-TR-43, PB212893)",
10163 institution = inst-STAN-CS,
10164 address = inst-STAN-CS:adr,
10165 pages = "74",
10166 month = sep,
10167 year = "1972",
10168 bibdate = "Fri Nov 21 14:21:14 2025",
10169 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
10170 URL = "",
10171 acknowledgement = ack-nhfb,
10172 remark = "This is the author's thesis (Part I). No PDF in NTRL
10173 archive.",
10174 }
10175
10176 @TechReport{Kogge:1972:NSP,
10177 author = "Peter M. Kogge",
10178 title = "The Numerical Stability of Parallel Algorithms for
10179 Solving Recurrence Problems",
10180 type = "Technical Report",
10181 number = "STAN-CS-72-315 (CSL-TR-44, PB212894)",
10182 institution = inst-STAN-CS,
10183 address = inst-STAN-CS:adr,
10184 pages = "49",
10185 month = sep,
10186 year = "1972",
10187 bibdate = "Fri Nov 21 14:21:14 2025",
10188 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
10189 URL = "",
10190 acknowledgement = ack-nhfb,
10191 remark = "This is the author's thesis (Part II). No PDF in NTRL
10192 archive.",
10193 }
10194
10195 @TechReport{Kogge:1972:MPS,
10196 author = "Peter M. Kogge",
10197 title = "Minimal Parallelism in the Solution of Recurrence
10198 Problems",
10199 type = "Technical Report",
10200 number = "STAN-CS-72-316 (CSL-TR-45, PB212828)",
10201 institution = inst-STAN-CS,
10202 address = inst-STAN-CS:adr,
10203 pages = "45",
10204 month = sep,
10205 year = "1972",
10206 bibdate = "Fri Nov 21 14:21:14 2025",
10207 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
10208 URL = "",
10209 acknowledgement = ack-nhfb,
10210 remark = "This is the author's thesis (Part III). No PDF in NTRL
10211 archive.",
10212 }
10213
10214 @TechReport{Fuller:1972:ADS,
10215 author = "Samuel H. Fuller and Forest Baskett",
10216 title = "An analysis of drum storage units",
10217 type = "Technical Report",
10218 number = "STAN-CS-72-317 (CSL-TR-26, AD750672)",
10219 institution = inst-STAN-CS,
10220 address = inst-STAN-CS:adr,
10221 pages = "??",
10222 month = aug,
10223 year = "1972",
10224 bibdate = "Fri Nov 7 07:00:05 MST 2025",
10225 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
10226 URL = "http://i.stanford.edu/TR/CS-TR-72-317.html",
10227 abstract = "This article discusses the modeling and analysis of
10228 drum-like storage units. Two common forms of drum
10229 organizations and two common scheduling disciplines are
10230 considered: the file drum and the paging drum;
10231 first-in-first-out (FIFO) scheduling and
10232 shortest-latency-time-first (SLTF) scheduling. The
10233 modeling of the I/O requests to the drum is an
10234 important aspect of this analysis. Measurements are
10235 presented to indicate that it is realistic to model
10236 requests for records, or blocks of information to a
10237 file drum, as requests that have starting addresses
10238 uniformly distributed around the circumference of the
10239 drum and transfer times that are exponentially
10240 distributed with a mean of 1/2 to 1/3 of a drum
10241 revolution. The arrival of I/O requests is first
10242 assumed to be a Poisson process and then generalized to
10243 the case of a computer system with a finite degree of
10244 multiprogramming. An exact analysis of all the models
10245 except the SLTF file drum is presented; in this case
10246 the complexity of the drum organization has forced us
10247 to accept an approximate analysis. In order to examine
10248 the error introduced into the analysis of the SLTF file
10249 drum by our approximations, the results of the analytic
10250 models are compared to a simulation model of the SLTF
10251 file drum.",
10252 acknowledgement = ack-nhfb,
10253 pdfpages = "70",
10254 xxnumber = "CS-TR-72-317",
10255 }
10256
10257 @TechReport{Brown:1972:CGL,
10258 author = "Harold Brown and Larry M. Masinter and Larry
10259 Hjelmeland",
10260 title = "Constructive graph labeling using double cosets",
10261 type = "Technical Report",
10262 number = "STAN-CS-72-318 (AD755140)",
10263 institution = inst-STAN-CS,
10264 address = inst-STAN-CS:adr,
10265 pages = "??",
10266 month = oct,
10267 year = "1972",
10268 bibdate = "Fri Nov 7 07:00:05 MST 2025",
10269 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
10270 URL = "http://i.stanford.edu/TR/CS-TR-72-318.html",
10271 abstract = "Two efficient computer implemented algorithms are
10272 presented for explicitly constructing all distinct
10273 labelings of a graph G with a set of (not necessarily
10274 distinct) labels L, given the symmetry group B of G.
10275 Two recursive reductions of the problem and a
10276 precomputation involving certain orbits of stabilizer
10277 subgroups are the techniques used by the algorithm.
10278 Moreover, for each labeling, the subgroup of B which
10279 preserves that labeling is calculated.",
10280 acknowledgement = ack-nhfb,
10281 pdfpages = "48",
10282 xxnumber = "CS-TR-72-318",
10283 }
10284
10285 @TechReport{Golub:1972:CBS,
10286 author = "Gene H. Golub and James M. Varah",
10287 title = "On a characterization of the best $ \ell_2 $ scaling
10288 of a matrix",
10289 type = "Technical Report",
10290 number = "STAN-CS-72-319 (SU326 P30-22)",
10291 institution = inst-STAN-CS,
10292 address = inst-STAN-CS:adr,
10293 pages = "14",
10294 month = oct,
10295 year = "1972",
10296 bibdate = "Fri Nov 7 07:00:05 MST 2025",
10297 bibsource = "https://www.math.utah.edu/pub/bibnet/authors/g/golub-gene-h.bib;
10298 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
10299 URL = "http://i.stanford.edu/TR/CS-TR-72-319.html",
10300 abstract = "This paper is concerned with best two-sided scaling of
10301 a general square matrix, and in particular with a
10302 certain characterization of that best scaling: namely
10303 that the first and last singular vectors (on left and
10304 right) of the scaled matrix have components of equal
10305 modulus. Necessity, sufficiency, and its relation with
10306 other characterizations are discussed. Then the problem
10307 of best scaling for rectangular matrices is introduced
10308 and a conjecture made regarding a possible best
10309 scaling. The conjecture is verified for some special
10310 cases.",
10311 acknowledgement = ack-nhfb,
10312 author-dates = "Gene Howard Golub (February 29, 1932--November 16,
10313 2007)",
10314 pdfpages = "15",
10315 xxnumber = "CS-TR-72-319",
10316 }
10317
10318 @TechReport{Baumgart:1972:WEP,
10319 author = "Bruce G. Baumgart",
10320 title = "Winged edge polyhedron representation",
10321 type = "Technical Report",
10322 number = "STAN-CS-72-320 (AIM-179)",
10323 institution = inst-STAN-CS,
10324 address = inst-STAN-CS:adr,
10325 pages = "??",
10326 month = oct,
10327 year = "1972",
10328 bibdate = "Fri Nov 7 07:00:05 MST 2025",
10329 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
10330 URL = "http://i.stanford.edu/TR/CS-TR-72-320.html",
10331 abstract = "A winged edge polyhedron representation is stated and
10332 a set of primitives that preserve Euler's F-E+V = 2
10333 equation are explained. Present use of this
10334 representation in artificial intelligence for computer
10335 graphics and world modeling is illustrated and its
10336 intended future application to computer vision is
10337 described.",
10338 acknowledgement = ack-nhfb,
10339 pdfpages = "54",
10340 xxnumber = "CS-TR-72-320",
10341 }
10342
10343 @TechReport{Bajcsy:1972:CIT,
10344 author = "Ruzena Bajcsy",
10345 title = "Computer Identification of Textured Visual Scenes",
10346 type = "Technical Report",
10347 number = "STAN-CS-72-321 (AIM-180, AD759712)",
10348 institution = inst-STAN-CS,
10349 address = inst-STAN-CS:adr,
10350 pages = "iv + 157",
10351 month = oct,
10352 year = "1972",
10353 bibdate = "Fri Nov 21 14:21:14 2025",
10354 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
10355 URL = "https://apps.dtic.mil/sti/tr/pdf/AD0759712.pdf",
10356 abstract = "This work deals with computer analysis of textured
10357 outdoor scenes involving grass, trees, water and
10358 clouds. Descriptions of texture are formalized from
10359 natural language descriptions; local descriptors are
10360 obtained from the directional and non- directional
10361 components of the Fourier transform power spectrum.
10362 Analytic expressions are obtained for orientation,
10363 contrast, size, spacing, and in periodic cases, the
10364 locations of texture elements. These local descriptors
10365 are defined over windows of various sizes: the choice
10366 of sizes is made by a simple higher- level
10367 program.\par
10368
10369 The process of region growing is represented by a
10370 sheaf-theoretical model which formalizes the operation
10371 of pasting local structure (over a window) into global
10372 structure (over a region). Programs were implemented
10373 which form regions of similar color and similar texture
10374 with respect to the local descriptors.\par
10375
10376 An interpretation is made of texture gradient as
10377 distance gradient in space. A simple world model is
10378 described. An interpretation of texture regions and
10379 texture gradient is made with a simulated
10380 correspondence with the world model. We find that a
10381 problem-solving approach, involving
10382 hypothesis-verification, more satisfactory than an
10383 earlier pattern recognition effort (Bajcsy 1970) and
10384 more crucial to work with complex scenes than in scenes
10385 of polyhedra. Geometric clues from relative sizes,
10386 texture gradients, and interposition are important in
10387 interpretation.",
10388 acknowledgement = ack-nhfb,
10389 pdfpages = "168",
10390 remark = "This is the author's thesis.",
10391 }
10392
10393 @TechReport{Gill:1972:MMM,
10394 author = "Phillip E. Gill and Gene H. Golub and Walter A. Murray
10395 and Michael A. Saunders",
10396 title = "Methods for modifying matrix factorizations",
10397 type = "Technical Report",
10398 number = "STAN-CS-72-322 (SU326 P30-23)",
10399 institution = inst-STAN-CS,
10400 address = inst-STAN-CS:adr,
10401 pages = "62",
10402 month = nov,
10403 year = "1972",
10404 bibdate = "Fri Nov 7 07:00:05 MST 2025",
10405 bibsource = "https://www.math.utah.edu/pub/bibnet/authors/g/golub-gene-h.bib;
10406 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
10407 URL = "http://i.stanford.edu/TR/CS-TR-72-322.html",
10408 abstract = "In recent years several algorithms have appeared for
10409 modifying the factors of a matrix following a rank-one
10410 change. These methods have always been given in the
10411 context of specific applications and this has probably
10412 inhibited their use over a wider field. In this report
10413 several methods are described for modifying Cholesky
10414 factors. Some of these have been published previously
10415 while others appear for the first time. In addition, a
10416 new algorithm is presented for modifying the complete
10417 orthogonal factorization of a general matrix, from
10418 which the conventional QR factors are obtained as a
10419 special case. A uniform notation has been used and
10420 emphasis has been placed on illustrating the similarity
10421 between different methods.",
10422 acknowledgement = ack-nhfb,
10423 author-dates = "Gene Howard Golub (February 29, 1932--November 16,
10424 2007)",
10425 pdfpages = "63",
10426 xxnumber = "CS-TR-72-322",
10427 }
10428
10429 @TechReport{Malcolm:1972:FMS,
10430 author = "Michael A. Malcolm and John Palmer",
10431 title = "A fast method for solving a class of tri-diagonal
10432 linear systems",
10433 type = "Technical Report",
10434 number = "STAN-CS-72-323",
10435 institution = inst-STAN-CS,
10436 address = inst-STAN-CS:adr,
10437 pages = "??",
10438 month = nov,
10439 year = "1972",
10440 bibdate = "Fri Nov 7 07:00:05 MST 2025",
10441 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
10442 URL = "http://i.stanford.edu/TR/CS-TR-72-323.html",
10443 abstract = "The solution of linear systems having real, symmetric,
10444 diagonally dominant, tridiagonal coefficient matrices
10445 with constant diagonals is considered. It is proved
10446 that the diagonals of the LU decomposition of the
10447 coefficient matrix rapidly converge to full
10448 floating-point precision. It is also proved that the
10449 computed LU decomposition converges when floating-point
10450 arithmetic is used and that the limits of the LU
10451 diagonals using floating point are roughly within
10452 machine precision of the limits using real arithmetic.
10453 This fact is exploited to reduce the number of
10454 floating-point operations required to solve a linear
10455 system from 8n-7 to 5n+2k-3, where k is much less than
10456 n, the order of the matrix. If the elements of the sub-
10457 and superdiagonals are 1, then only 4n+2k-3 operations
10458 are needed. The entire LU decomposition takes k words
10459 of storage, and considerable savings in array
10460 subscripting are achieved. Upper and lower bounds on k
10461 are obtained in terms of the ratio of the coefficient
10462 matrix diagonal constants and parameters of the
10463 floating-point number system. Various generalizations
10464 of these results are discussed.",
10465 acknowledgement = ack-nhfb,
10466 pdfpages = "19",
10467 xxnumber = "CS-TR-72-323",
10468 }
10469
10470 @TechReport{Bauer:1972:SMX,
10471 author = "Henry Raymond {Bauer, III}",
10472 title = "Subproblems of the $ m \times n $ Sequencing Problem",
10473 type = "Technical Report",
10474 number = "STAN-CS-72-324 (CSL-TR-48, SU-SEL-72-057, PB214612)",
10475 institution = inst-STAN-CS,
10476 address = inst-STAN-CS:adr,
10477 pages = "viii + 110",
10478 month = nov,
10479 year = "1972",
10480 bibdate = "Fri Nov 21 14:21:14 2025",
10481 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
10482 URL = "",
10483 abstract = "Assume that a set of tasks is to be scheduled on m
10484 processors, each task is indivisible, and each
10485 processor may be concerned with only one task at a
10486 time. Then the $ m \times n $ sequencing problem is to
10487 find the schedule in which the total completion time
10488 for all tasks is minimal, In addition, we seek an
10489 algorithmic solution which is efficient; that is, the
10490 computation must grow algebraically with the size of
10491 the problem rather than combinatorially.\ldots{}",
10492 acknowledgement = ack-nhfb,
10493 advisor = "Harold S. Stone",
10494 pdfpages = "123",
10495 remark = "This is the author's thesis.",
10496 }
10497
10498 @TechReport{Buchanan:1972:RHD,
10499 author = "Bruce G. Buchanan",
10500 title = "Review of {Hubert Dreyfus}' {{\booktitle{What
10501 Computers Can't Do: a Critique of Artificial Reason}}
10502 (Harper \& Row, New York, 1972)}",
10503 type = "Technical Report",
10504 number = "STAN-CS-72-325 (AIM-181)",
10505 institution = inst-STAN-CS,
10506 address = inst-STAN-CS:adr,
10507 pages = "??",
10508 month = nov,
10509 year = "1972",
10510 bibdate = "Fri Nov 7 07:00:05 MST 2025",
10511 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
10512 URL = "http://i.stanford.edu/TR/CS-TR-72-325.html",
10513 abstract = "The recent book $ \underline {What Computers Can't Do}
10514 $ by Hubert Dreyfus is an attack on artificial
10515 intelligence research. This review takes the position
10516 that the philosophical content of the book is
10517 interesting, but that the attack on artificial
10518 intelligence is not well reasoned.",
10519 acknowledgement = ack-nhfb,
10520 pdfpages = "16",
10521 xxnumber = "CS-TR-72-325",
10522 }
10523
10524 @TechReport{Colby:1972:CEJ,
10525 author = "Kenneth Mark Colby and Franklin Dennis Hilf",
10526 title = "Can expert judges, using transcripts of teletyped
10527 psychiatric interviews, distinguish human paranoid
10528 patients from a computer simulation of paranoid
10529 processes?",
10530 type = "Technical Report",
10531 number = "STAN-CS-72-326 (AIM-182, AD754107)",
10532 institution = inst-STAN-CS,
10533 address = inst-STAN-CS:adr,
10534 pages = "??",
10535 month = dec,
10536 year = "1972",
10537 bibdate = "Fri Nov 7 07:00:05 MST 2025",
10538 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
10539 URL = "http://i.stanford.edu/TR/CS-TR-72-326.html",
10540 abstract = "Expert judges (psychiatrists and computer scientists)
10541 could not correctly distinguish a simulation model of
10542 paranoid processes from actual paranoid patients.",
10543 acknowledgement = ack-nhfb,
10544 pdfpages = "12",
10545 xxnumber = "CS-TR-72-326",
10546 }
10547
10548 @TechReport{Klarner:1972:ABN,
10549 author = "David A. Klarner and Ronald L. Rivest",
10550 title = "Asymptotic Bounds for the Number of Convex
10551 $n$-Ominoes",
10552 type = "Technical Report",
10553 number = "STAN-CS-72-327 (AD755138)",
10554 institution = inst-STAN-CS,
10555 address = inst-STAN-CS:adr,
10556 pages = "iii + 14",
10557 month = dec,
10558 year = "1972",
10559 bibdate = "Fri Nov 21 14:21:14 2025",
10560 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
10561 URL = "",
10562 abstract = "Unit squares having their vertices at integer points
10563 in the Cartesian plane are called {\em cells}. A point
10564 set equal to a union of n distinct cells which is
10565 connected and has no finite cut set is called an {\em
10566 $n$-omino}. Two $n$-ominoes are considered the same if
10567 one is mapped onto the other by some translation of the
10568 plane. An $n$-omino is convex if all cells in a row or
10569 column form a connected strip. Letting $ c(n)$ denote
10570 the number of different convex $n$-ominoes, we show
10571 that the sequence $ ((c(n))^{1 / n}. n = 1, 2, \ldots)$
10572 tends to a limit $ \gamma $, and $ \gamma = 2.309138
10573 \ldots {}$.",
10574 acknowledgement = ack-nhfb,
10575 pdfpages = "17",
10576 }
10577
10578 @TechReport{Gabow:1972:EIE,
10579 author = "Harold N. Gabow",
10580 title = "An efficient implementation of {Edmonds}' maximum
10581 matching algorithm",
10582 type = "Technical Report",
10583 number = "STAN-CS-72-328 (CSL-TR-31, PB218929)",
10584 institution = inst-STAN-CS,
10585 address = inst-STAN-CS:adr,
10586 pages = "??",
10587 month = jun,
10588 year = "1972",
10589 bibdate = "Fri Nov 7 07:00:05 MST 2025",
10590 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib;
10591 https://www.math.utah.edu/pub/tex/bib/string-matching.bib",
10592 URL = "http://i.stanford.edu/TR/CS-TR-72-328.html",
10593 abstract = "A matching in a graph is a collection of edges, no two
10594 of which share a vertex. A maximum matching contains
10595 the greatest number of edges possible. This paper
10596 presents an efficient implementation of Edmonds'
10597 algorithm for finding maximum matchings. The
10598 computation time is proportional to $ V^3 $, where V is
10599 the number of vertices; previous algorithms have
10600 computation time proportional to $ V^4 $. The
10601 implementation avoids Edmonds' blossom reduction by
10602 using pointers to encode the structure of alternating
10603 paths.",
10604 acknowledgement = ack-nhfb,
10605 pdfpages = "78",
10606 xxnumber = "CS-TR-72-328",
10607 }
10608
10609 @TechReport{Fang:1972:FDF,
10610 author = "Isu Fang",
10611 title = "{FOLDS}, a Declarative Formal Language Definition
10612 System",
10613 type = "Technical Report",
10614 number = "STAN-CS-72-329 (PB218875)",
10615 institution = inst-STAN-CS,
10616 address = inst-STAN-CS:adr,
10617 pages = "+ 286",
10618 month = dec,
10619 year = "1972",
10620 bibdate = "Fri Nov 21 14:21:14 2025",
10621 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
10622 URL = "",
10623 abstract = "This thesis describes FOLDS, a declarative formal
10624 language definition system. The system implements and
10625 extends Knuth's method for the specification of the
10626 semantics of context-free languages. The system
10627 provides a language (SPINDLE) and data structures to
10628 define the syntax and semantics of a language. It also
10629 includes a machine (MUTILATE) that from the definition
10630 compiles programs of the defined language. Both the
10631 consistency and the correctness of the definition can
10632 be checked in this way. The language imposes very few
10633 restrictions on definitions while preserving the
10634 declarative nature of Knuth's method; i.e., the
10635 compilation process is transparent in the definition.
10636 In addition, the system provides a means for
10637 semantically resolving syntactic ambiguities. FOLDS is
10638 intended primarily for the language designer, giving
10639 him the opportunity of realizing his definition with
10640 very little concern about implementation details. A
10641 definition of SIMULA 67 in SPINDLE and a set of SIMULA
10642 67 programs, as compiled by the definition, are
10643 included to illustrate the capabilities of the
10644 system.",
10645 acknowledgement = ack-nhfb,
10646 pdfpages = "298",
10647 remark = "This is the author's thesis.",
10648 }
10649
10650 @TechReport{Newey:1972:ATI,
10651 author = "Malcolm Newey",
10652 title = "Axioms and Theorems for Integers, Lists and Finite
10653 Sets in {LCF}",
10654 type = "Technical Report",
10655 number = "STAN-CS-73-330 (AIM-184, AD758651)",
10656 institution = inst-STAN-CS,
10657 address = inst-STAN-CS:adr,
10658 pages = "53",
10659 month = jan,
10660 year = "1972",
10661 bibdate = "Fri Nov 21 14:21:14 2025",
10662 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
10663 URL = "",
10664 acknowledgement = ack-nhfb,
10665 }
10666
10667 @TechReport{Fuller:1972:PCM,
10668 author = "Samuel H. Fuller",
10669 title = "Performance of an {I/O} channel with multiple paging
10670 drums (digest edition)",
10671 type = "Technical Report",
10672 number = "STAN-CS-73-351 (SU-SEL-73-010)",
10673 institution = inst-STAN-CS,
10674 address = inst-STAN-CS:adr,
10675 pages = "iii + 6",
10676 month = aug,
10677 year = "1972",
10678 bibdate = "Fri Nov 7 07:00:05 MST 2025",
10679 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
10680 URL = "http://i.stanford.edu/TR/CS-TR-73-351.html",
10681 abstract = "For rotating storage units, a paging drum organization
10682 is known to offer substantially better response time to
10683 I/O requests than is a more conventional (file)
10684 organization [Abate and Dubner, 1969; Fuller and
10685 Baskett, 1972]. When several, asynchronous paging drums
10686 are attached to a single I/O channel, however, much of
10687 the gain in response time due to the paging
10688 organization is lost; this article investigates the
10689 reasons for this loss in performance. A model of an I/O
10690 channel with multiple paging drums is presented and we
10691 embed into the model a Markov chain that closely
10692 approximates the behavior of the I/O channel. The
10693 analysis then leads to the moment generating function
10694 of sector queue size and the Laplace--Stieltjes
10695 transform of the waiting time. A significant
10696 observation is that the expected waiting time for an
10697 I/O request to a drum can be divided into two terms:
10698 one independent of the load of I/O requests to the drum
10699 and another that monotonically increases with
10700 increasing load. Moreover, the load varying term of the
10701 waiting time is nearly proportional to (2 - l/k) where
10702 k is the number of drums connected to the I/O channel.
10703 The validity of the Markov chain approximation is
10704 examined in several cases by a comparison of the
10705 analytic results to the actual performance of an I/O
10706 channel with several paging drums.",
10707 acknowledgement = ack-nhfb,
10708 pdfpages = "9",
10709 }
10710
10711 @TechReport{Fuller:1972:EDB,
10712 author = "Samuel H. Fuller",
10713 title = "The expected difference between the {SLTF} and {MTPT}
10714 drum scheduling disciplines (digest edition)",
10715 type = "Technical Report",
10716 number = "STAN-CS-73-352 (CSL-TR-28, AD761176)",
10717 institution = inst-STAN-CS,
10718 address = inst-STAN-CS:adr,
10719 pages = "??",
10720 month = aug,
10721 year = "1972",
10722 bibdate = "Fri Nov 7 07:00:05 MST 2025",
10723 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
10724 URL = "http://i.stanford.edu/TR/CS-TR-73-352.html",
10725 abstract = "This report is a sequel to an earlier report [Fuller,
10726 1971] that develops a minimal-total-processing-time
10727 (MTPT) drum scheduling algorithm. A quantitative
10728 comparison between MTPT schedules and
10729 shortest-latency-time-first (SLTF) schedules, commonly
10730 acknowledged as good schedules for drum-like storage
10731 units, is presented here. The analysis develops an
10732 analogy to random walks and proves several asymptotic
10733 properties of collections of records on drums. These
10734 properties are specialized to the MTPT and SLTF
10735 algorithms and it is shown that for sufficiently large
10736 sets of records, the expected processing time of a SLTF
10737 schedule is longer than a MTPT schedule by the expected
10738 record length. The results of a simulation study are
10739 also presented to show the difference in MTPT and SLTF
10740 schedules for small sets of records and for situations
10741 not covered in the analytic discussion.",
10742 acknowledgement = ack-nhfb,
10743 pdfpages = "7",
10744 xxnumber = "CS-TR-73-352",
10745 }
10746
10747 @TechReport{Fuller:1972:RAM,
10748 author = "Samuel H. Fuller",
10749 title = "Random arrivals and {MTPT} disk scheduling
10750 disciplines",
10751 type = "Technical Report",
10752 number = "STAN-CS-73-353 (CSL-TR-29, AD761185)",
10753 institution = inst-STAN-CS,
10754 address = inst-STAN-CS:adr,
10755 pages = "??",
10756 month = aug,
10757 year = "1972",
10758 bibdate = "Fri Nov 7 07:00:05 MST 2025",
10759 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
10760 URL = "http://i.stanford.edu/TR/CS-TR-73-353.html",
10761 abstract = "This article investigates the application of
10762 minimal-total-processing-time (MTPT) scheduling
10763 disciplines to rotating storage units when random
10764 arrival of requests is allowed. Fixed-head drum and
10765 moving-head disk storage units are considered and
10766 particular emphasis is placed on the relative merits of
10767 the MTPT scheduling discipline with respect to the
10768 shortest-latency-time-first (SLTF) scheduling
10769 discipline. The data presented are the results of
10770 simulation studies. Situations are discovered in which
10771 the MTPT discipline is superior to the SLTF discipline,
10772 and situations are also discovered in which the
10773 opposite is true. An implementation of the MTPT
10774 scheduling algorithm is presented and the computational
10775 requirements of the algorithm are discussed. It is
10776 shown that the sorting procedure is the most time
10777 consuming phase of the algorithm.",
10778 acknowledgement = ack-nhfb,
10779 pdfpages = "64",
10780 xxnumber = "CS-TR-73-353",
10781 }
10782
10783 @TechReport{Muntz:1972:OCM,
10784 author = "Richard R. Muntz and Forest {Baskett, III}",
10785 title = "Open, closed, and mixed networks of queues with
10786 different classes of customers",
10787 type = "Technical Report",
10788 number = "STAN-CS-73-360 (CSL-TR-33, AD764014)",
10789 institution = inst-STAN-CS,
10790 address = inst-STAN-CS:adr,
10791 pages = "iv + 35",
10792 month = aug,
10793 year = "1972",
10794 bibdate = "Fri Nov 7 07:00:05 MST 2025",
10795 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
10796 URL = "http://i.stanford.edu/TR/CS-TR-73-360.html",
10797 abstract = "We derive the joint equilibrium distribution of queue
10798 sizes in a network of queues containing N service
10799 centers and R classes of customers. The equilibrium
10800 state probabilities have the general form: P(S) - Cd(S)
10801 $ f_1 $ ($ x_1$)$ f_2$ ($ x_2$) \ldots{} $ f_N$ ($
10802 x_N$) where S is the state of the system, $ x_i$ is the
10803 configuration of customers at the $i$-th service
10804 center, d(S) is a function of the state of the model, $
10805 f_i$ is a function that depends on the type of the
10806 $i$-th service center, and C is a normalizing constant.
10807 We consider four types of service centers to model
10808 central processors, data channels, terminals, and
10809 routing delays. The queueing disciplines associated
10810 with these service centers include
10811 first-come-first-served, processor sharing, no
10812 queueing, and last-come-first-served. Each customer
10813 belongs to a single class of customers while awaiting
10814 or receiving service at a service center but may change
10815 classes and service centers according to fixed
10816 probabilities at the completion of a service request.
10817 For open networks we consider state dependent arrival
10818 processes. Closed networks are those with no arrivals.
10819 A network may be closed with respect to some classes of
10820 customers and open with respect to other classes of
10821 customers. At three of the four types of service
10822 centers, the service times of customers are governed by
10823 probability distributions having rational Laplace
10824 transforms, different classes of customers having
10825 different distributions. At first-come-first-served
10826 type service centers the service time distribution must
10827 be identical and exponential for all classes of
10828 customers. Many of the network results of Jackson on
10829 arrival and service rate dependencies, of Posner and
10830 Bernholtz on different classes of customers, and of
10831 Chandy on different types of service centers are
10832 combined and extended in this paper. The results become
10833 special cases of the model presented here. An example
10834 shows how different classes of customers can affect
10835 models of computer systems. Finally, we show that an
10836 equivalent model encompassing all of the results
10837 involves only classes of customers with identical
10838 exponentially distributed service times. All of the
10839 other structure of the first model can be absorbed into
10840 the fixed probabilities governing the change of class
10841 and change of service center of each class of
10842 customers.",
10843 acknowledgement = ack-nhfb,
10844 pdfpages = "44",
10845 xxnumber = "CS-TR-73-360",
10846 }
10847
10848 @TechReport{Newey:1973:ATI,
10849 author = "Malcolm C. Newey",
10850 title = "Axioms and theorems for integers, lists and finite
10851 sets in {LCF}",
10852 type = "Technical Report",
10853 number = "STAN-CS-73-330 (AIM-184, AD758651)",
10854 institution = inst-STAN-CS,
10855 address = inst-STAN-CS:adr,
10856 pages = "??",
10857 month = jan,
10858 year = "1973",
10859 bibdate = "Fri Nov 7 07:00:05 MST 2025",
10860 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
10861 URL = "http://i.stanford.edu/TR/CS-TR-73-330.html",
10862 abstract = "LCF (Logic for Computable Functions) is being promoted
10863 as a formal language suitable for the discussion of
10864 various problems in the Mathematical Theory of
10865 Computation (MTC). To this end, several examples of MTC
10866 problems have been formalised and proofs have been
10867 exhibited using the LCF proof-checker. However, in
10868 these examples, there has been a certain amount of
10869 ad-hoc-ery in the proofs; namely, many mathematical
10870 theorems have been assumed without proof and no
10871 axiomatisation of the mathematical domains involved was
10872 given. This paper describes a suitable mathematical
10873 environment for future LCF experiments and its
10874 axiomatic basis. The environment developed, deemed
10875 appropriate for such experiments, consists of a large
10876 body of theorems from the areas of integer arithmetic,
10877 list manipulation and finite set theory.",
10878 acknowledgement = ack-nhfb,
10879 pdfpages = "56",
10880 xxnumber = "CS-TR-73-330",
10881 }
10882
10883 @TechReport{Collins:1973:CTE,
10884 author = "George E. Collins",
10885 title = "The Computing Time of the {Euclidian} Algorithm",
10886 type = "Technical Report",
10887 number = "STAN-CS-73-331 (AIM-187, AD757364)",
10888 institution = inst-STAN-CS,
10889 address = inst-STAN-CS:adr,
10890 pages = "17",
10891 month = jan,
10892 year = "1973",
10893 bibdate = "Fri Nov 7 07:00:05 MST 2025",
10894 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
10895 URL = "http://i.stanford.edu/TR/CS-TR-73-331.html",
10896 abstract = "The maximum, minimum and average computing times of
10897 the classical Euclidean algorithm for the greatest
10898 common divisor of two integers are derived, to within
10899 codominance, as functions of the lengths of the two
10900 inputs and the output.",
10901 acknowledgement = ack-nhfb,
10902 pdfpages = "19",
10903 xxnumber = "CS-TR-73-331",
10904 }
10905
10906 @TechReport{Milner:1973:ML,
10907 author = "Robin Milner",
10908 title = "Models of {LCF}",
10909 type = "Technical Report",
10910 number = "STAN-CS-73-332 (AIM-186, AD758645)",
10911 institution = inst-STAN-CS,
10912 address = inst-STAN-CS:adr,
10913 pages = "17",
10914 month = jan,
10915 year = "1973",
10916 bibdate = "Fri Nov 7 07:00:05 MST 2025",
10917 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
10918 URL = "http://i.stanford.edu/TR/CS-TR-73-332.html",
10919 abstract = "LCF is a deductive system for computable functions
10920 proposed by D. Scott in 1969 in an unpublished
10921 memorandum. The purpose of the present paper is to
10922 demonstrate the soundness of the system with respect to
10923 certain models, which are partially ordered domains of
10924 continuous functions. This demonstration was supplied
10925 by Scott in his memorandum; the present paper is merely
10926 intended to make this work more accessible.",
10927 acknowledgement = ack-nhfb,
10928 pdfpages = "19",
10929 xxnumber = "CS-TR-73-332",
10930 }
10931
10932 @TechReport{Chandra:1973:PPF,
10933 author = "Ashok K. Chandra and Zohar Manna",
10934 title = "On the Power of Programming Features",
10935 type = "Technical Report",
10936 number = "STAN-CS-73-333 (AIM-185, AD757367)",
10937 institution = inst-STAN-CS,
10938 address = inst-STAN-CS:adr,
10939 pages = "29",
10940 month = jan,
10941 year = "1973",
10942 bibdate = "Fri Nov 7 07:00:05 MST 2025",
10943 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
10944 URL = "http://i.stanford.edu/TR/CS-TR-73-333.html",
10945 abstract = "We consider the power of several programming features
10946 such as counters, pushdown stacks, queues, arrays,
10947 recursion and equality. In this study program schemas
10948 are used as the model for computation. The relations
10949 between the powers of these features is completely
10950 described by a comparison diagram.",
10951 acknowledgement = ack-nhfb,
10952 pdfpages = "30",
10953 xxnumber = "CS-TR-73-333",
10954 }
10955
10956 @TechReport{Malcolm:1973:UUR,
10957 author = "Michael A. Malcolm and Cleve B. Moler",
10958 title = "{URAND}, a Universal Random Number Generator",
10959 type = "Technical Report",
10960 number = "STAN-CS-73-334 (AD757366)",
10961 institution = inst-STAN-CS,
10962 address = inst-STAN-CS:adr,
10963 pages = "i + 6",
10964 month = jan,
10965 year = "1973",
10966 bibdate = "Fri Nov 7 07:00:05 MST 2025",
10967 bibsource = "https://www.math.utah.edu/pub/bibnet/authors/m/moler-cleve-b.bib;
10968 https://www.math.utah.edu/pub/tex/bib/prng.bib;
10969 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
10970 URL = "http://i.stanford.edu/TR/CS-TR-73-334.html",
10971 abstract = "A subroutine for generating uniformly-distributed
10972 floating-point numbers in the interval $ [0, 1) $ is
10973 presented in ANSI Standard Fortran. The subroutine,
10974 URAND, is designed to be relatively machine
10975 independent. URAND has undergone minimal testing on
10976 various machines and is thought to work properly on any
10977 machine having binary integer number representation,
10978 integer multiplication modulo $m$ and integer addition
10979 either modulo $m$ or yielding at least $ \log_2 (m) $
10980 significant bits, where $m$ is some integral power of
10981 2. Upon the first call of URAND, the value of $m$ is
10982 automatically determined and appropriate constants for
10983 a linear congruential generator are computed following
10984 the suggestions of Donald E. Knuth, volume 2. URAND is
10985 guaranteed to have a full-length cycle. Readers are
10986 invited to apply their favorite statistical tests to
10987 URAND, using any binary machine, and report the results
10988 to the authors.",
10989 acknowledgement = ack-nhfb,
10990 pdfpages = "7",
10991 xxnumber = "CS-TR-73-334",
10992 xxpages = "10",
10993 }
10994
10995 @TechReport{Golub:1973:CSDa,
10996 author = "Gene H. Golub and Eugene Seneta",
10997 title = "Computation of the Stationary Distribution of an
10998 Infinite {Markov} Matrix",
10999 type = "Technical Report",
11000 number = "STAN-CS-73-335 (SU326 P30-24)",
11001 institution = inst-STAN-CS,
11002 address = inst-STAN-CS:adr,
11003 pages = "12",
11004 month = jan,
11005 year = "1973",
11006 bibdate = "Fri Nov 21 14:21:14 2025",
11007 bibsource = "https://www.math.utah.edu/pub/bibnet/authors/g/golub-gene-h.bib;
11008 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
11009 URL = "http://i.stanford.edu/TR/CS-TR-73-335.html",
11010 abstract = "An algorithm is presented for computing the unique
11011 stationary distribution of an infinite stochastic
11012 matrix possessing at least one column whose elements
11013 are bounded away from zero. Elementwise convergence
11014 rate is discussed by means of two examples.",
11015 acknowledgement = ack-nhfb,
11016 author-dates = "Gene Howard Golub (February 29, 1932--November 16,
11017 2007)",
11018 pdfpages = "13",
11019 xxnumber = "CS-TR-73-335",
11020 }
11021
11022 @TechReport{Chandra:1973:PAP,
11023 author = "Ashok K. Chandra",
11024 title = "On the Properties and Applications of Program
11025 Schemas",
11026 type = "Technical Report",
11027 number = "STAN-CS-73-336 (AIM-188, AD758646)",
11028 institution = inst-STAN-CS,
11029 address = inst-STAN-CS:adr,
11030 pages = "viii + 231",
11031 month = mar,
11032 year = "1973",
11033 bibdate = "Fri Nov 21 14:21:14 2025",
11034 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
11035 URL = "https://apps.dtic.mil/sti/tr/pdf/AD0758646.pdf",
11036 abstract = "The interesting questions one can ask about program
11037 schemas include questions about the ``power'' of
11038 classes of schemas and their decision problems viz.
11039 halting, divergence, equivalence, etc. We first
11040 consider the powers of schemas with various features:
11041 recursion, equality tests, and several data structures
11042 such as pushdown stacks, lists, queues and arrays. We
11043 then consider the decision problems for schemas with
11044 equality and with commutative and invertible functions.
11045 Finally a generalized class of schemas is described in
11046 an attempt to unify the various classes of
11047 uninterpreted and semi-interpreted schemas and schemas
11048 with special data structures.",
11049 acknowledgement = ack-nhfb,
11050 advisor = "Zohar Manna",
11051 pdfpages = "242",
11052 remark = "This is the author's thesis.",
11053 }
11054
11055 @TechReport{Gips:1973:AS,
11056 author = "James Gips and George Stiny",
11057 title = "Aesthetics Systems",
11058 type = "Technical Report",
11059 number = "STAN-CS-73-337 (AIM-189, PB218682)",
11060 institution = inst-STAN-CS,
11061 address = inst-STAN-CS:adr,
11062 pages = "22",
11063 month = jan,
11064 year = "1973",
11065 bibdate = "Fri Nov 7 07:00:05 MST 2025",
11066 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
11067 URL = "http://i.stanford.edu/TR/CS-TR-73-337.html",
11068 abstract = "The formal structure of aesthetics systems is defined.
11069 Aesthetics systems provide for the essential tasks of
11070 interpretation and evaluation in aesthetic analysis.
11071 Kolmogorov's formulation of information theory is
11072 applicable. An aesthetics system for a class of
11073 non-representational, geometric paintings and its
11074 application to three actual paintings is described in
11075 the Appendix.",
11076 acknowledgement = ack-nhfb,
11077 pdfpages = "24",
11078 xxnumber = "CS-TR-73-337",
11079 }
11080
11081 @TechReport{Klarner:1973:FBT,
11082 author = "David A. Klarner",
11083 title = "A Finite Basis Theorem Revisited",
11084 type = "Technical Report",
11085 number = "STAN-CS-73-338 (AD759713)",
11086 institution = inst-STAN-CS,
11087 address = inst-STAN-CS:adr,
11088 pages = "10",
11089 month = feb,
11090 year = "1973",
11091 bibdate = "Fri Nov 7 07:00:05 MST 2025",
11092 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
11093 URL = "http://i.stanford.edu/TR/CS-TR-73-338.html",
11094 abstract = "Let S denote a set of k-dimensional boxes each having
11095 integral sides. Let $ \Gamma $ (S) denote the set of
11096 all boxes which can be filled completely with
11097 translates of elements of S. It is shown here that S
11098 contains a finite subset B such that $ \Gamma $ (B) = $
11099 \Gamma $ (S). This result was proved for k = 1,2 in an
11100 earlier paper, but the proof for k > 2 contained an
11101 error.",
11102 acknowledgement = ack-nhfb,
11103 pdfpages = "10",
11104 xxnumber = "CS-TR-73-338",
11105 }
11106
11107 @TechReport{Dent:1973:CLI,
11108 author = "Warren T. Dent and Gene H. Golub",
11109 title = "Computation of the Limited Information Maximum
11110 Likelihood Estimator",
11111 type = "Technical Report",
11112 number = "STAN-CS-73-339 (SU326 P30-25)",
11113 institution = inst-STAN-CS,
11114 address = inst-STAN-CS:adr,
11115 pages = "ii + 27",
11116 month = feb,
11117 year = "1973",
11118 bibdate = "Fri Nov 7 07:00:05 MST 2025",
11119 bibsource = "https://www.math.utah.edu/pub/bibnet/authors/g/golub-gene-h.bib;
11120 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
11121 URL = "http://i.stanford.edu/TR/CS-TR-73-339.html",
11122 abstract = "Computation of the Limited Information Maximum
11123 Likelihood Estimator (LIMLE) of the set of coefficients
11124 in a single equation of a system of interdependent
11125 relations is sufficiently complicated to detract from
11126 other potentially interesting properties. Although for
11127 finite samples the LIMLE has no moments [18],
11128 asymptotically it remains normally distributed [2] and
11129 retains other properties associated with maximum
11130 likelihood. The most extensive application of the
11131 estimator has been made in the Brookings studies [7].
11132 We believe that current methods of estimation are
11133 clumsy, and present a numerically stable estimation
11134 schema based on Householder transformations and the
11135 singular value decomposition. The analysis permits a
11136 convenient demonstration of equivalence with the Two
11137 Stage Least Squares Estimator (TSLSE) in the instance
11138 of just identification.",
11139 acknowledgement = ack-nhfb,
11140 author-dates = "Gene Howard Golub (February 29, 1932--November 16,
11141 2007)",
11142 pdfpages = "29",
11143 xxnumber = "CS-TR-73-339",
11144 }
11145
11146 @TechReport{Newey:1973:NPI,
11147 author = "Malcolm C. Newey",
11148 title = "Notes on a Problem Involving Permutations as
11149 Subsequences",
11150 type = "Technical Report",
11151 number = "STAN-CS-73-340 (AIM-190, AD759714)",
11152 institution = inst-STAN-CS,
11153 address = inst-STAN-CS:adr,
11154 pages = "20",
11155 month = mar,
11156 year = "1973",
11157 bibdate = "Fri Nov 7 07:00:05 MST 2025",
11158 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
11159 URL = "http://i.stanford.edu/TR/CS-TR-73-340.html",
11160 abstract = "The problem (attributed to R. M. Karp by Knuth) is to
11161 describe the sequences of minimum length which contain,
11162 as subsequences, all the permutations of an alphabet of
11163 n symbols. This paper catalogs some of the easy
11164 observations on the problem and proves that the minimum
11165 lengths for n=5, n=6 \& n=7 are 19, 28 and 39
11166 respectively. Also presented is a construction which
11167 yields (for n > 2) many appropriate sequences of length
11168 $ n^2$-2n+4 so giving an upper bound on length of
11169 minimum strings which matches exactly all known
11170 values.",
11171 acknowledgement = ack-nhfb,
11172 pdfpages = "22",
11173 xxnumber = "CS-TR-73-340",
11174 }
11175
11176 @TechReport{Katz:1973:HAP,
11177 author = "Shmuel M. Katz and Zohar Manna",
11178 title = "A Heuristic Approach to Program Verification",
11179 type = "Technical Report",
11180 number = "STAN-CS-73-341 (AIM-191, AD764272)",
11181 institution = inst-STAN-CS,
11182 address = inst-STAN-CS:adr,
11183 pages = "40",
11184 month = mar,
11185 year = "1973",
11186 bibdate = "Fri Nov 7 07:00:05 MST 2025",
11187 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
11188 URL = "http://i.stanford.edu/TR/CS-TR-73-341.html",
11189 abstract = "We present various heuristic techniques for use in
11190 proving the correctness of computer programs. The
11191 techniques are designed to obtain automatically the
11192 `inductive assertions' attached to the loops of the
11193 program which previously required human `understanding'
11194 of the program's performance. We distinguish between
11195 two general approaches: one in which we obtain the
11196 inductive assertion by analyzing predicates which are
11197 known to be true at the entrances and exits of the loop
11198 ($ \underline {top - down} $ approach), and another in
11199 which we generate the inductive assertion directly from
11200 the statements of the loop ($ \underline {bottom - up}
11201 $ approach).",
11202 acknowledgement = ack-nhfb,
11203 pdfpages = "42",
11204 xxnumber = "CS-TR-73-341",
11205 }
11206
11207 @TechReport{Knuth:1973:MP,
11208 author = "Donald E. Knuth",
11209 title = "Matroid Partitioning",
11210 type = "Technical Report",
11211 number = "STAN-CS-73-342 (AD759715)",
11212 institution = inst-STAN-CS,
11213 address = inst-STAN-CS:adr,
11214 pages = "12",
11215 day = "1",
11216 month = mar,
11217 year = "1973",
11218 bibdate = "Fri Nov 7 07:00:05 MST 2025",
11219 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
11220 URL = "http://i.stanford.edu/TR/CS-TR-73-342.html;
11221 http://www-db.stanford.edu/TR/CS-TR-73-342.html;
11222 http://www.ncstrl.org:8900/ncstrl/servlet/search?formname=detail&id=oai%3Ancstrlh%3Astan%3ASTAN%2F%2FCS-TR-73-342",
11223 abstract = "This report discusses a modified version of Edmonds's
11224 algorithm for partitioning of a set into subsets
11225 independent in various given matroids. If $ {\cal M}_1,
11226 \ldots, {\cal M}_k $ are matroids defined on a finite
11227 set $E$, the algorithm yields a simple necessary and
11228 sufficient condition for whether or not the elements of
11229 $E$ can be colored with $k$ colors such that (i) all
11230 elements of color $j$ are independent in $ {\cal M}_j
11231 $, and (ii) the number of elements of color $j$ lies
11232 between given limits, $ n_j \leq \| E_j \| \leq
11233 {n'}_j$. The algorithm either finds such a coloring or
11234 it finds a proof that none exists, after making at most
11235 $ n^3 + n^2 k$ tests of independence in the given
11236 matroids, where $n$ is the number of elements in $E$.",
11237 acknowledgement = ack-nhfb,
11238 documentid = "oai:ncstrlh:stan:STAN//CS-TR-73-342",
11239 keywords = "combinatorial geometry; matching; matroid",
11240 pdfpages = "13",
11241 xxnumber = "CS-TR-73-342",
11242 }
11243
11244 @TechReport{Levine:1973:CBA,
11245 author = "David R. Levine",
11246 title = "Computer-Based Analytic Grading for {German} Grammar
11247 Instruction",
11248 type = "Technical Report",
11249 number = "STAN-CS-73-343",
11250 institution = inst-STAN-CS,
11251 address = inst-STAN-CS:adr,
11252 pages = "220",
11253 month = mar,
11254 year = "1973",
11255 bibdate = "Fri Nov 21 14:21:14 2025",
11256 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
11257 URL = "",
11258 acknowledgement = ack-nhfb,
11259 remark = "This is the author's thesis.",
11260 }
11261
11262 @TechReport{Schank:1973:FPA,
11263 author = "Roger C. Schank",
11264 title = "The Fourteen Primitive Actions and Their Inferences",
11265 type = "Technical Report",
11266 number = "STAN-CS-73-344 (AIM-183, AD759716)",
11267 institution = inst-STAN-CS,
11268 address = inst-STAN-CS:adr,
11269 pages = "71",
11270 month = mar,
11271 year = "1973",
11272 bibdate = "Fri Nov 7 07:00:05 MST 2025",
11273 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
11274 URL = "http://i.stanford.edu/TR/CS-TR-73-344.html",
11275 abstract = "In order to represent the conceptual information
11276 underlying a natural language sentence, a conceptual
11277 structure has been established that uses the basic
11278 actor-action-object framework. It was the intent that
11279 these structures have only one representation for one
11280 meaning, regardless of the semantic form of the
11281 sentence being represented. Actions were reduced to
11282 their basic parts so as to effect this. It was found
11283 that only fourteen basic actions were needed as
11284 building blocks by which all verbs can be represented.
11285 Each of these actions has a set of actions or states
11286 which can be inferred when they are present.",
11287 acknowledgement = ack-nhfb,
11288 pdfpages = "76",
11289 xxnumber = "CS-TR-73-344",
11290 }
11291
11292 @TechReport{Collins:1973:MRS,
11293 author = "George E. Collins and Ellis Horowitz",
11294 title = "The Minimum Root Separation of a Polynomial",
11295 type = "Technical Report",
11296 number = "STAN-CS-73-345 (AIM-192)",
11297 institution = inst-STAN-CS,
11298 address = inst-STAN-CS:adr,
11299 pages = "71",
11300 month = apr,
11301 year = "1973",
11302 bibdate = "Fri Nov 7 07:00:05 MST 2025",
11303 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
11304 URL = "http://i.stanford.edu/TR/CS-TR-73-345.html",
11305 abstract = "The minimum root separation of a complex polynomial A
11306 is defined as the minimum of the distances between
11307 distinct roots of A. For polynomials with Gaussian
11308 integer coefficients and no multiple roots, three lower
11309 bounds are derived for the root separation. In each
11310 case the bound is a function of the degree, n, of A and
11311 the sum, d, of the absolute values of the coefficients
11312 of A. The notion of a semi-norm for a commutative ring
11313 is defined, and it is shown how any semi-norm can be
11314 extended to polynomial rings and matrix rings,
11315 obtaining a very general analogue of Hadamard's
11316 determinant theorem.",
11317 acknowledgement = ack-nhfb,
11318 pdfpages = "15",
11319 xxnumber = "CS-TR-73-345",
11320 }
11321
11322 @TechReport{Colby:1973:RCB,
11323 author = "Kenneth Mark Colby",
11324 title = "The Rational for Computer Based Treatment of Language
11325 Difficulties in Nonspeaking Autistic Children",
11326 type = "Technical Report",
11327 number = "STAN-CS-73-346 (AIM-193, AD759717)",
11328 institution = inst-STAN-CS,
11329 address = inst-STAN-CS:adr,
11330 pages = "8",
11331 month = mar,
11332 year = "1973",
11333 bibdate = "Fri Nov 7 07:00:05 MST 2025",
11334 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
11335 URL = "http://i.stanford.edu/TR/CS-TR-73-346.html",
11336 abstract = "The principles underlying a computer-based treatment
11337 method for language acquisition in nonspeaking autistic
11338 children are described. The main principle involves
11339 encouragement of exploratory learning with minimum
11340 adult interference.",
11341 acknowledgement = ack-nhfb,
11342 pdfpages = "15",
11343 xxnumber = "CS-TR-73-346",
11344 }
11345
11346 @TechReport{Colby:1973:MAE,
11347 author = "Kenneth Mark Colby and Franklin Dennis Hilf",
11348 title = "Multidimensional analysis in evaluating a simulation
11349 of paranoid thought",
11350 type = "Technical Report",
11351 number = "STAN-CS-73-347 (AIM-194, PB221170/4)",
11352 institution = inst-STAN-CS,
11353 address = inst-STAN-CS:adr,
11354 pages = "??",
11355 month = may,
11356 year = "1973",
11357 bibdate = "Fri Nov 7 07:00:05 MST 2025",
11358 bibsource = "https://www.math.utah.edu/pub/bibnet/authors/t/turing-alan-mathison.bib;
11359 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
11360 URL = "http://i.stanford.edu/TR/CS-TR-73-347.html",
11361 abstract = "The limitations of Turing's Test as an evaluation
11362 procedure are reviewed. More valuable are tests which
11363 ask expert judges to make ratings along multiple
11364 dimensions essential to the model. In this way the
11365 model's weaknesses become clarified and the model
11366 builder learns where the model must be improved.",
11367 acknowledgement = ack-nhfb,
11368 pdfpages = "16",
11369 xxnumber = "CS-TR-73-347",
11370 }
11371
11372 @TechReport{Colby:1973:MDA,
11373 author = "Kenneth M. Colby and Franklin Dennis Hilf",
11374 title = "Multi Dimensional Analysis in Evaluating a Simulation
11375 of Paranoid Thought Processes",
11376 type = "Technical Report",
11377 number = "STAN-CS-73-347 (AIM-194, PB221170/4)",
11378 institution = inst-STAN-CS,
11379 address = inst-STAN-CS:adr,
11380 pages = "10",
11381 month = apr,
11382 year = "1973",
11383 bibdate = "Fri Nov 21 14:21:14 2025",
11384 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
11385 URL = "",
11386 acknowledgement = ack-nhfb,
11387 }
11388
11389 @TechReport{Pereyra:1973:HOF,
11390 author = "Victor Pereyra",
11391 title = "High Order Finite Difference Solution of Differential
11392 Equations",
11393 type = "Technical Report",
11394 number = "STAN-CS-73-348 (SU326 P30-26, PB222513)",
11395 institution = inst-STAN-CS,
11396 address = inst-STAN-CS:adr,
11397 pages = "86",
11398 month = apr,
11399 year = "1973",
11400 bibdate = "Fri Nov 7 07:00:05 MST 2025",
11401 bibsource = "http://www.math.utah.edu/pub/tex/bib/fortran1.bib;
11402 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
11403 URL = "http://i.stanford.edu/TR/CS-TR-73-348.html",
11404 abstract = "These seminar notes give a detailed treatment of
11405 finite difference approximations to smooth nonlinear
11406 two-point boundary value problems for second order
11407 differential equations. Consistency, stability,
11408 convergence, and asymptotic expansions are discussed.
11409 Most results are stated in such a way as to indicate
11410 extensions to more general problems. Successive
11411 extrapolations and deferred corrections are described
11412 and their implementations are explored thoroughly. A
11413 very general deferred correction generator is developed
11414 and it is employed in the implementation of a variable
11415 order, variable (uniform) step method. Complete FORTRAN
11416 programs and extensive numerical experiments and
11417 comparisons are included together with a set of 48
11418 references.",
11419 acknowledgement = ack-nhfb,
11420 pdfpages = "88",
11421 xxnumber = "CS-TR-73-348",
11422 }
11423
11424 @TechReport{Blum:1973:TPS,
11425 author = "Manual Blum and Robert W. Floyd and Vaughan R. Pratt
11426 and Ronald L. Rivest and Robert Endre Tarjan",
11427 title = "Two papers on the selection problem: \booktitle{Time
11428 Bounds for Selection} [by {Manual Blum}, {Robert W.
11429 Floyd}, {Vaughan Pratt}, {Ronald L. Rivest}, and
11430 {Robert E. Tarjan}] and \booktitle{Expected Time Bounds
11431 for Selection} [by {Robert W. Floyd} and {Ronald L.
11432 Rivest}]",
11433 type = "Technical Report",
11434 number = "STAN-CS-73-349 (PB221115)",
11435 institution = inst-STAN-CS,
11436 address = inst-STAN-CS:adr,
11437 pages = "??",
11438 month = apr,
11439 year = "1973",
11440 bibdate = "Fri Nov 7 07:00:05 MST 2025",
11441 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
11442 URL = "http://i.stanford.edu/TR/CS-TR-73-349.html",
11443 abstract = "(1) The number of comparisons required to select the
11444 $i$-th smallest of $n$ numbers is shown to be at most a
11445 linear function of $n$ by analysis of a new selection
11446 algorithm --- PICK. Specifically, no more than $ 5.4305
11447 n$ comparisons are ever required. This bound is
11448 improved for extreme values of $i$, and a new lower
11449 bound on the requisite number of comparisons is also
11450 proved. (2) A new selection algorithm is presented
11451 which is shown to be very efficient on the average,
11452 both theoretically and practically. The number of
11453 comparisons used to select the $i$-th smallest of $n$
11454 numbers is $ n + \min (i, n - i) + o(n)$. A lower bound
11455 within 9\% of the above formula is also derived.",
11456 acknowledgement = ack-nhfb,
11457 author-dates = "Robert W. Floyd (8 June 1936--25 September 2001)",
11458 pdfpages = "53",
11459 xxnumber = "CS-TR-73-349",
11460 }
11461
11462 @TechReport{Blum:1973:TBS,
11463 author = "Manuel Blum and Robert Floyd and Vaughn Pratt and
11464 Ronald Rivest and Robert Tarjan",
11465 title = "Time Bounds for Selection",
11466 type = "Technical Report",
11467 number = "STAN-CS-73-349 (PB221115) [part 1]",
11468 institution = inst-STAN-CS,
11469 address = inst-STAN-CS:adr,
11470 pages = "51",
11471 month = apr,
11472 year = "1973",
11473 bibdate = "Fri Nov 21 14:21:14 2025",
11474 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
11475 URL = "",
11476 acknowledgement = ack-nhfb,
11477 author-dates = "Robert W. Floyd (8 June 1936--25 September 2001)",
11478 }
11479
11480 @TechReport{Floyd:1973:ETB,
11481 author = "Robert Floyd and Ronald Rivest",
11482 title = "Expected Time Bounds for Selection",
11483 type = "Technical Report",
11484 number = "STAN-CS-73-349 (PB221115) [part 2]",
11485 institution = inst-STAN-CS,
11486 address = inst-STAN-CS:adr,
11487 pages = "51",
11488 month = apr,
11489 year = "1973",
11490 bibdate = "Fri Nov 21 14:21:14 2025",
11491 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
11492 URL = "",
11493 acknowledgement = ack-nhfb,
11494 author-dates = "Robert W. Floyd (8 June 1936--25 September 2001)",
11495 }
11496
11497 @TechReport{Kaufman:1973:AOA,
11498 author = "Marc T. Kaufman",
11499 title = "An Almost-Optimal Algorithm for the Assembly Line
11500 Scheduling Problem",
11501 type = "Technical Report",
11502 number = "STAN-CS-73-350 (CSL-TR-53, AD761177, SU-SEL-73-009)",
11503 institution = inst-STAN-CS,
11504 address = inst-STAN-CS:adr,
11505 pages = "26",
11506 month = jan,
11507 year = "1973",
11508 bibdate = "Fri Nov 7 07:00:05 MST 2025",
11509 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
11510 URL = "http://i.stanford.edu/TR/CS-TR-73-350.html",
11511 abstract = "This paper considers a solution to the multiprocessor
11512 scheduling problem for the case where the ordering
11513 relation between tasks can be represented as a tree.
11514 Assume that we have n identical processors, and a
11515 number of tasks to perform. Each task $ T_i $ requires
11516 an amount of time $ \mu_i $ to complete, $ 0 < \mu_i
11517 \leq k $, so that $k$ is an upper bound on task length.
11518 Tasks are indivisible, so that a processor once
11519 assigned must remain assigned until the task completes
11520 (no preemption). Then the `longest path' scheduling
11521 method is almost-optimal in the following sense: Let $
11522 \omage $ be the total time required to process all of
11523 the tasks by the `longest path' algorithm. Let $
11524 \omega_o $ be the minimal time in which all of the
11525 tasks can be processed. Let $ \omega_p $ be the minimal
11526 time to process all of the tasks if arbitrary
11527 preemption of processors is allowed. Then: $ \omega_p
11528 \leq \omega_o \leq \omega \leq \omega_p + k - k / n $,
11529 where $n$ is the number of processors available to any
11530 of the algorithms.",
11531 acknowledgement = ack-nhfb,
11532 pdfpages = "26",
11533 xxnumber = "CS-TR-73-350",
11534 }
11535
11536 @TechReport{Klarner:1973:NSC,
11537 author = "David A. Klarner",
11538 title = "The Number of {SDR}'s in Certain Regular Systems",
11539 type = "Technical Report",
11540 number = "STAN-CS-73-354 (PB221165/4)",
11541 institution = inst-STAN-CS,
11542 address = inst-STAN-CS:adr,
11543 pages = "7",
11544 month = apr,
11545 year = "1973",
11546 bibdate = "Fri Nov 7 07:00:05 MST 2025",
11547 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
11548 URL = "http://i.stanford.edu/TR/CS-TR-73-354.html",
11549 abstract = "Let ($ a_1 $, \ldots{}, $ a_k$) = $ \bar {a}$ denote a
11550 vector of numbers, and let C($ \bar {a}$,n) denote the
11551 n $ \times $ n cyclic matrix having ($ a_1$, \ldots{},
11552 $ a_k$,0, \ldots{}, 0) as its first row. It is shown
11553 that the sequences (det C($ \bar {a}$,n): n = k,k+1,
11554 \ldots{} ) and (per C($ \bar {a}$,n): n = k,k+1,
11555 \ldots{} ) satisfy linear homogeneous difference
11556 equations with constant coefficients. The permanent,
11557 per C, of a matrix C is defined like the determinant
11558 except that one forgets about $ {( - 1)}^{sign \pi }$
11559 where $ \pi $ is a permutation.",
11560 acknowledgement = ack-nhfb,
11561 pdfpages = "8",
11562 xxnumber = "CS-TR-73-354",
11563 }
11564
11565 @TechReport{Price:1973:ACP,
11566 author = "Thomas G. Price",
11567 title = "An analysis of central processor scheduling in
11568 multiprogrammed computer systems (digest edition)",
11569 type = "Technical Report",
11570 number = "STAN-CS-73-355 (CSL-TR-57, AD764598, SU-SEL-73-013)",
11571 institution = inst-STAN-CS,
11572 address = inst-STAN-CS:adr,
11573 pages = "8",
11574 month = apr,
11575 year = "1973",
11576 bibdate = "Fri Nov 7 07:00:05 MST 2025",
11577 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
11578 URL = "http://i.stanford.edu/TR/CS-TR-73-355.html",
11579 abstract = "A simple finite source model is used to gain insight
11580 into the effect of central processor scheduling in
11581 multiprogrammed computer systems. CPU utilization is
11582 chosen as the measure of performance and this decision
11583 is discussed. A relation between CPU utilization and
11584 flow time is developed. It is shown that the
11585 shortest-remaining-processing-time discipline maximizes
11586 both CPU utilization and I/O utilization for the
11587 queueing model M/G/1/N. An exact analysis of processor
11588 utilization using shortest-remaining-processing-time
11589 scheduling for systems with two jobs is given and it is
11590 observed that the processor utilization is independent
11591 of the form of the processing time distribution. The
11592 effect of the CPU processing time distribution on
11593 performance is discussed. For first-come-first-served
11594 scheduling, it is shown that distributions with the
11595 same mean and variance can yield significantly
11596 different processor utilizations and that utilization
11597 may or may not significantly decrease with increasing
11598 variance. The results are used to compare several
11599 scheduling disciplines of practical interest. An
11600 approximate expression for CPU utilization using
11601 shortest-remaining-processing-time scheduling in
11602 systems with N jobs is given.",
11603 acknowledgement = ack-nhfb,
11604 pdfpages = "9",
11605 xxnumber = "CS-TR-73-355 (CSL-TR-57, AD764598)",
11606 }
11607
11608 @TechReport{Smith:1973:M,
11609 author = "David Canfield Smith and Horace J. Enea",
11610 title = "{MLISP2}",
11611 type = "Technical Report",
11612 number = "STAN-CS-73-356 (AIM-195, PB222164)",
11613 institution = inst-STAN-CS,
11614 address = inst-STAN-CS:adr,
11615 pages = "92",
11616 month = may,
11617 year = "1973",
11618 bibdate = "Fri Nov 7 07:00:05 MST 2025",
11619 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib;
11620 https://www.math.utah.edu/pub/tex/bib/string-matching.bib",
11621 URL = "http://i.stanford.edu/TR/CS-TR-73-356.html",
11622 abstract = "MLISP2 is a high-level programming language based on
11623 LISP. Features: 1. The notation of MLISP. 2.
11624 Extensibility---the ability to extend the language and
11625 to define new languages. 3. Pattern matching---the
11626 ability to match input against context free or
11627 sensitive patterns. 4. Backtracking--the ability to set
11628 decision points, manipulate contexts and backtrack.",
11629 acknowledgement = ack-nhfb,
11630 pdfpages = "106",
11631 xxnumber = "CS-TR-73-356",
11632 }
11633
11634 @TechReport{Goldman:1973:CBS,
11635 author = "Neil M. Goldman and Christopher K. Riesbeck",
11636 title = "A Conceptually Based Sentence Paraphraser",
11637 type = "Technical Report",
11638 number = "STAN-CS-73-357 (AIM-196, AD762471)",
11639 institution = inst-STAN-CS,
11640 address = inst-STAN-CS:adr,
11641 pages = "88",
11642 month = may,
11643 year = "1973",
11644 bibdate = "Fri Nov 7 07:00:05 MST 2025",
11645 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
11646 URL = "http://i.stanford.edu/TR/CS-TR-73-357.html",
11647 abstract = "This report describes a system of programs which
11648 performs natural language processing based on an
11649 underlying language free (conceptual) representation of
11650 meaning. This system is used to produce sentence
11651 paraphrases which demonstrate a form of understanding
11652 with respect to a given context. Particular emphasis
11653 has been placed on the major subtasks of language
11654 analysis (mapping natural language into conceptual
11655 structures) and language generation (mapping conceptual
11656 structures into natural language), and on the
11657 interaction between these processes and a conceptual
11658 memory model.",
11659 acknowledgement = ack-nhfb,
11660 pdfpages = "91",
11661 xxnumber = "CS-TR-73-357",
11662 }
11663
11664 @TechReport{Schank:1973:ICU,
11665 author = "Roger C. Schank and Charles J. {Rieger III}",
11666 title = "Inference and the Computer Understanding of Natural
11667 Language",
11668 type = "Technical Report",
11669 number = "STAN-CS-73-358 (AIM-197, AD762470)",
11670 institution = inst-STAN-CS,
11671 address = inst-STAN-CS:adr,
11672 pages = "40",
11673 month = may,
11674 year = "1973",
11675 bibdate = "Fri Nov 7 07:00:05 MST 2025",
11676 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
11677 URL = "http://i.stanford.edu/TR/CS-TR-73-358.html",
11678 abstract = "The notion of computer understanding of natural
11679 language is examined relative to inference mechanisms
11680 designed to function in a language-free deep conceptual
11681 base (Conceptual Dependency). The conceptual analysis
11682 of a natural language sentence into this conceptual
11683 base, and the nature of the memory which stores and
11684 operates upon these conceptual structures are described
11685 from both theoretical and practical standpoints. The
11686 various types of inferences which can be made during
11687 and after the conceptual analysis of a sentence are
11688 defined, and a functioning program which performs these
11689 inference tasks is described. Actual computer output is
11690 included.",
11691 acknowledgement = ack-nhfb,
11692 pdfpages = "66",
11693 remark = "Published in \booktitle{Artificial Intelligence}, {\bf
11694 5}, 373--412 (1974).",
11695 xxnumber = "CS-TR-73-358",
11696 }
11697
11698 @TechReport{Stone:1973:NCP,
11699 author = "Harold S. Stone",
11700 title = "A Note on a Combinatorial Problem of {Burnett} and
11701 {Coffman}",
11702 type = "Technical Report",
11703 number = "STAN-CS-73-359 (CSL-TN-25, PB222064)",
11704 institution = inst-STAN-CS,
11705 address = inst-STAN-CS:adr,
11706 pages = "iv + 7",
11707 month = apr,
11708 year = "1973",
11709 bibdate = "Fri Nov 21 14:21:14 2025",
11710 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
11711 URL = "",
11712 abstract = "A problem arising in the analysis of interleaved
11713 memories is shown to be identical to a well-known
11714 problem in the combinatorial literature, The former
11715 problem concerns the number of sequences of length $k$
11716 drawn from the integers $ \{ 1, 2, \ldots {}, n \} $
11717 such that each sequence contains distinct integers and
11718 does not contain a subsequence of the form (\ldots{},
11719 i, i + 1, \ldots{}). The corresponding combinatorial
11720 problem concerns derangements, that is, the class of
11721 permutations in which no element is left invariant by
11722 the permutation, In the interleaved memory problem,
11723 when $ k = n$, the number of sequences is $ n! / e $,
11724 which is the same as the number of derangements on $n$
11725 letters.",
11726 acknowledgement = ack-nhfb,
11727 pdfpages = "11",
11728 }
11729
11730 @TechReport{Brown:1973:ACG,
11731 author = "Harold Brown and Larry M. Masinter",
11732 title = "An algorithm for the construction of the graphs of
11733 organic molecules",
11734 type = "Technical Report",
11735 number = "STAN-CS-73-361 (Serra, AD764273)",
11736 institution = inst-STAN-CS,
11737 address = inst-STAN-CS:adr,
11738 pages = "??",
11739 month = may,
11740 year = "1973",
11741 bibdate = "Fri Nov 7 07:00:05 MST 2025",
11742 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
11743 URL = "http://i.stanford.edu/TR/CS-TR-73-361.html",
11744 abstract = "A description and a formal proof of an efficient
11745 computer implemented algorithm for the construction of
11746 graphs is presented. This algorithm, which is part of a
11747 program for the automated analysis of organic
11748 compounds, constructs all of the non-isomorphic,
11749 connected multi-graphs based on a given degree sequence
11750 of nodes and which arise from a relatively small
11751 `catalog' of certain canonical graphs. For the graphs
11752 of the more common organic molecules, a catalog of most
11753 of the canonical graphs is known, and the algorithm can
11754 produce all of the distinct valence isomers of these
11755 organic molecules.",
11756 acknowledgement = ack-nhfb,
11757 pdfpages = "27",
11758 xxnumber = "CS-TR-73-361",
11759 }
11760
11761 @TechReport{Kaufman:1973:ASG,
11762 author = "Linda C. Kaufman",
11763 title = "The {$ L Z $} Algorithm to Solve the Generalized
11764 Eigenvalue Problem",
11765 type = "Technical Report",
11766 number = "STAN-CS-73-363 (Serra, PB222099)",
11767 institution = inst-STAN-CS,
11768 address = inst-STAN-CS:adr,
11769 pages = "101",
11770 month = may,
11771 year = "1973",
11772 bibdate = "Fri Nov 21 14:21:14 2025",
11773 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
11774 URL = "",
11775 acknowledgement = ack-nhfb,
11776 remark = "This is the author's thesis. No PDF in NTRL archive.",
11777 }
11778
11779 @TechReport{Thosar:1973:EPD,
11780 author = "Ravindra B. Thosar",
11781 title = "Estimation of probability density using signature
11782 tables for applications to pattern recognition",
11783 type = "Technical Report",
11784 number = "STAN-CS-73-364 (AIM-198, AD763611)",
11785 institution = inst-STAN-CS,
11786 address = inst-STAN-CS:adr,
11787 pages = "36",
11788 month = may,
11789 year = "1973",
11790 bibdate = "Fri Nov 7 07:00:05 MST 2025",
11791 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
11792 URL = "http://i.stanford.edu/TR/CS-TR-73-364.html",
11793 abstract = "Signature table training method consists of cumulative
11794 evaluation of a function (such as a probability
11795 density) at pre-assigned co-ordinate values of input
11796 parameters to the table. The training is conditional:
11797 based on a binary valued `learning' input to a table
11798 which is compared to the label attached to each
11799 training sample. Interpretation of an unknown sample
11800 vector is then equivalent of a table look-up, i.e.
11801 extraction of the function value stored at the proper
11802 co-ordinates. Such a technique is very useful when a
11803 large number of samples must be interpreted as in the
11804 case of speech recognition and the time required for
11805 the training as well as for the recognition is at a
11806 premium. However, this method is limited by prohibitive
11807 storage requirements, even for a moderate number of
11808 parameters, when their relative independence cannot be
11809 assumed. This report investigates the conditions under
11810 which the higher dimensional probability density
11811 function can be decomposed so that the density estimate
11812 is obtained by a hierarchy of signature tables with
11813 consequent reduction in the storage requirement.
11814 Practical utility of the theoretical results obtained
11815 in the report is demonstrated by a vowel recognition
11816 experiment.",
11817 acknowledgement = ack-nhfb,
11818 pdfpages = "40",
11819 xxnumber = "CS-TR-73-364",
11820 }
11821
11822 @TechReport{Igarashi:1973:APV,
11823 author = "Shigeru Igarashi and Ralph L. London and David C.
11824 Luckham",
11825 title = "Automatic program verification {I}: a logical basis
11826 and its implementation",
11827 type = "Technical Report",
11828 number = "STAN-CS-73-365 (AIM-200, AD767331)",
11829 institution = inst-STAN-CS,
11830 address = inst-STAN-CS:adr,
11831 pages = "iv + 53",
11832 month = may,
11833 year = "1973",
11834 bibdate = "Fri Nov 7 07:00:05 MST 2025",
11835 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
11836 URL = "http://i.stanford.edu/TR/CS-TR-73-365.html;
11837 https://apps.dtic.mil/sti/tr/pdf/AD0767331.pdf",
11838 abstract = "Defining the semantics of programming languages by
11839 axioms and rules of inference yields a deduction system
11840 within which proofs may be given that programs satisfy
11841 specifications. The deduction system herein is shown to
11842 be consistent and also deduction complete with respect
11843 to Hoare's system. A subgoaler for the deduction system
11844 is described whose input is a significant subset of
11845 Pascal programs plus inductive assertions. The output
11846 is a set of verification conditions or lemmas to be
11847 proved. Several non-trivial arithmetic and sorting
11848 programs have been shown to satisfy specifications by
11849 using an interactive theorem prover to automatically
11850 generate proofs of the verification conditions.
11851 Additional components for a more powerful verification
11852 system are under construction.",
11853 acknowledgement = ack-nhfb,
11854 pdfpages = "57",
11855 remark = "The Stanford PDF file is truncated to 27 pages, but
11856 the DTIC file has 57 pages and appears to be
11857 complete.",
11858 xxnumber = "CS-TR-73-365",
11859 }
11860
11861 @TechReport{Grape:1973:MBI,
11862 author = "Gunnar Rutger Grape",
11863 title = "Model Bases (Intermediate-Level Computer Vision)",
11864 type = "Technical Report",
11865 number = "STAN-CS-73-366 (AIM-201, AD763673)",
11866 institution = inst-STAN-CS,
11867 address = inst-STAN-CS:adr,
11868 pages = "256",
11869 month = may,
11870 year = "1973",
11871 bibdate = "Fri Nov 21 14:21:14 2025",
11872 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
11873 URL = "",
11874 acknowledgement = ack-nhfb,
11875 remark = "This is the author's thesis.",
11876 }
11877
11878 @TechReport{Amble:1973:OHT,
11879 author = "Ole Amble and Donald E. Knuth",
11880 title = "Ordered Hash Tables",
11881 type = "Technical Report",
11882 number = "STAN-CS-73-367 (AD763601)",
11883 institution = inst-STAN-CS,
11884 address = inst-STAN-CS:adr,
11885 pages = "34",
11886 month = may,
11887 year = "1973",
11888 DOI = "https://doi.org/10.1093/comjnl/17.2.135",
11889 bibdate = "Fri Nov 21 14:21:14 2025",
11890 bibsource = "https://www.math.utah.edu/pub/tex/bib/hash.bib;
11891 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
11892 URL = "",
11893 abstract = "Some variants of the traditional hash method, making
11894 use of the numerical or alphabetical order of the keys,
11895 lead to faster searching at the expense of a little
11896 extra work when items are inserted. The paper presents
11897 the new algorithms and analyzes their average running
11898 time.",
11899 acknowledgement = ack-nhfb,
11900 remark = "Published in \booktitle{The Computer Journal}, {\bf
11901 17}(2) 135--142, May 1974,
11902 doi:10.1093/comjnl/17.2.135.",
11903 }
11904
11905 @TechReport{Schank:1973:GLT,
11906 author = "Roger C. Schank and Yorick A. Wilks",
11907 title = "The goals of linguistic theory revisited",
11908 type = "Technical Report",
11909 number = "STAN-CS-73-368 (AIM-202, AD764396)",
11910 institution = inst-STAN-CS,
11911 address = inst-STAN-CS:adr,
11912 pages = "44",
11913 month = may,
11914 year = "1973",
11915 bibdate = "Fri Nov 7 07:00:05 MST 2025",
11916 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
11917 URL = "http://i.stanford.edu/TR/CS-TR-73-368.html",
11918 abstract = "We examine the original goals of generative linguistic
11919 theory. We suggest that these goals were well defined
11920 but misguided with respect to their avoidance of the
11921 problem of modelling performance. With developments
11922 such as Generative Semantics, it is no longer clear
11923 that the goals are clearly defined. We argue that it is
11924 vital for linguistics to concern itself with the
11925 procedures that humans use in language. We then
11926 introduce a number of basic human competencies, in the
11927 field of language understanding, understanding in
11928 context and the use of inferential information, and
11929 argue that the modelling of these aspects of language
11930 understanding requires procedures of a sort that cannot
11931 be easily accommodated within the dominant paradigm. In
11932 particular, we argue that the procedures that will be
11933 required in these cases ought to be linguistic, and
11934 that the simple-minded importation of techniques from
11935 logic may create a linguistics in which there cannot be
11936 procedures of the required sort.",
11937 acknowledgement = ack-nhfb,
11938 pdfpages = "46",
11939 xxnumber = "CS-TR-73-368",
11940 }
11941
11942 @TechReport{Schank:1973:DCS,
11943 author = "Roger C. Schank",
11944 title = "The development of conceptual structures in children",
11945 type = "Technical Report",
11946 number = "STAN-CS-73-369 (AIM-203, AD764274)",
11947 institution = inst-STAN-CS,
11948 address = inst-STAN-CS:adr,
11949 pages = "??",
11950 month = may,
11951 year = "1973",
11952 bibdate = "Fri Nov 7 07:00:05 MST 2025",
11953 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
11954 URL = "http://i.stanford.edu/TR/CS-TR-73-369.html",
11955 abstract = "Previous papers by the author have hypothesized that
11956 it is possible to represent the meaning of natural
11957 language sentences using a framework which has only
11958 fourteen primitive ACTs. This paper addresses the
11959 problem of when and how these ACTs might be learned by
11960 children. The speech of a child of age 2 is examined
11961 for possible knowledge of the primitive ACTs as well as
11962 the conceptual relations underlying language. It is
11963 shown that there is evidence that the conceptual
11964 structures underlying language are probably complete by
11965 age 2. Next a child is studied from birth to age 1. The
11966 emergence of the primitive ACTs and the conceptual
11967 relations is traced. The hypothesis is made that the
11968 structures that underlie and are necessary for language
11969 are present by age 1.",
11970 acknowledgement = ack-nhfb,
11971 pdfpages = "33",
11972 xxnumber = "CS-TR-73-369",
11973 }
11974
11975 @TechReport{Sridharan:1973:HPD,
11976 author = "N. S. Sridharan and G. Gelernter and A. J. Hart and W.
11977 F. Fowler and H. J. Shue",
11978 title = "A Heuristic Program to Discover Syntheses for Complex
11979 Organic Molecule",
11980 type = "Technical Report",
11981 number = "STAN-CS-73-370 (AIM-205, AD764288)",
11982 institution = inst-STAN-CS,
11983 address = inst-STAN-CS:adr,
11984 pages = "30",
11985 month = jun,
11986 year = "1973",
11987 bibdate = "Fri Nov 21 14:21:14 2025",
11988 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
11989 URL = "",
11990 acknowledgement = ack-nhfb,
11991 }
11992
11993 @TechReport{Knuth:1973:RSP,
11994 author = "Donald E. Knuth",
11995 title = "A review of {``Structured Programming''}",
11996 type = "Technical Report",
11997 number = "STAN-CS-73-371 (AD223572/AS)",
11998 institution = inst-STAN-CS,
11999 address = inst-STAN-CS:adr,
12000 pages = "25",
12001 day = "1",
12002 month = jun,
12003 year = "1973",
12004 bibdate = "Fri Nov 7 07:00:05 MST 2025",
12005 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
12006 URL = "http://i.stanford.edu/TR/CS-TR-73-371.html;
12007 http://www-db.stanford.edu/TR/CS-TR-73-371.html;
12008 http://www.ncstrl.org:8900/ncstrl/servlet/search?formname=detail&id=oai%3Ancstrlh%3Astan%3ASTAN%2F%2FCS-TR-73-371",
12009 abstract = "The recent book \booktitle{Structured Programming} by
12010 0. J. Dahl, E. W. Dijkstra, and C. A. R. Hoare promises
12011 to have a significant impact on computer science. This
12012 report contains a detailed review of the topics treated
12013 in that book, in the form of three informal `open
12014 letters' to the three authors. It is hoped that
12015 circulation of these letters to a wider audience at
12016 this time will help to promote useful discussion of the
12017 important issues.",
12018 acknowledgement = ack-nhfb,
12019 documentid = "oai:ncstrlh:stan:STAN//CS-TR-73-371",
12020 pdfpages = "26",
12021 xxnumber = "CS-TR-73-371",
12022 }
12023
12024 @TechReport{Malcolm:1973:NSF,
12025 author = "Michael A. Malcolm",
12026 title = "Nonlinear Spline Functions",
12027 type = "Technical Report",
12028 number = "STAN-CS-73-372 (AD767970)",
12029 institution = inst-STAN-CS,
12030 address = inst-STAN-CS:adr,
12031 pages = "60",
12032 month = jun,
12033 year = "1973",
12034 bibdate = "Fri Nov 21 14:21:14 2025",
12035 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
12036 URL = "https://apps.dtic.mil/sti/tr/pdf/AD0767970.pdf",
12037 acknowledgement = ack-nhfb,
12038 remark = "This is the author's thesis (Part II).",
12039 }
12040
12041 @TechReport{VanLehn:1973:SUM,
12042 author = "Kurt A. VanLehn",
12043 title = "{SAIL} user manual",
12044 type = "Technical Report",
12045 number = "STAN-CS-73-373 (AIM-204, AD765353/BWC)",
12046 institution = inst-STAN-CS,
12047 address = inst-STAN-CS:adr,
12048 pages = "124",
12049 month = jul,
12050 year = "1973",
12051 bibdate = "Fri Nov 7 07:00:05 MST 2025",
12052 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
12053 URL = "http://i.stanford.edu/TR/CS-TR-73-373.html",
12054 abstract = "SAIL is a high-level programming language for the
12055 PDP-10 computer. It includes an extended ALGOL 60
12056 compiler and a companion set of execution-time
12057 routines. In addition to ALGOL, the language features:
12058 (1) flexible linking to hand-coded machine language
12059 algorithms, (2) complete access to the PDP-10 I/O
12060 facilities, (3) a complete system of compile-time
12061 arithmetic and logic as well as a flexible macro
12062 system, (4) user modifiable error handling, (5)
12063 backtracking, and (6) interrupt facilities.
12064 Furthermore, a subset of the SAIL language, called
12065 LEAP, provides facilities for (1) sets and lists, (2)
12066 an associative data structure, (3) independent
12067 processes, and (4) procedure variables. The LEAP subset
12068 of SAIL is an extension of the LEAP language, which was
12069 designed by J. Feldman and P. Rovner, and implemented
12070 on Lincoln Laboratory's TX-2 (see [Feldman \& Rovner,
12071 `An Algol-Based Associative Language,' Communications
12072 of the ACM, v.12, no. 8 (Aug. 1969), pp.439-449]). The
12073 extensions to LEAP are partially described in `Recent
12074 Developments is SAIL' (see [Feldman et al., Proceedings
12075 of the AFIPS Fall Joint Computer Conference, 1972, pp.
12076 1193-1202]). This manual describes the SAIL language
12077 and the execution-time routines for the typical SAIL
12078 user: a non-novice programmer with some knowledge of
12079 ALGOL. It lies somewhere between being a tutorial and a
12080 reference manual.",
12081 acknowledgement = ack-nhfb,
12082 pdfpages = "124",
12083 xxnumber = "CS-TR-73-373",
12084 }
12085
12086 @TechReport{Malcolm:1973:MIA,
12087 author = "Michael A. Malcolm",
12088 title = "A Machine Independent {ALGOL} Procedure for Accurate
12089 Floating-Point Summation",
12090 type = "Technical Report",
12091 number = "STAN-CS-73-374 (AD-764275)",
12092 institution = inst-STAN-CS,
12093 address = inst-STAN-CS:adr,
12094 pages = "iii + 6",
12095 month = jun,
12096 year = "1973",
12097 bibdate = "Fri Nov 21 14:21:14 2025",
12098 bibsource = "https://www.math.utah.edu/pub/tex/bib/fparith.bib;
12099 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
12100 URL = "https://apps.dtic.mil/sti/tr/pdf/AD0764275.pdf",
12101 acknowledgement = ack-nhfb,
12102 keywords = "accurate floating-point summation",
12103 pdfpages = "9",
12104 remark = "This is an extract from the author's thesis.",
12105 }
12106
12107 @TechReport{Fischer:1973:FTM,
12108 author = "D. Fischer and G. H. Golub and O. Hald and C. Levin
12109 and O. Widlund",
12110 title = "On {Fourier--Toeplitz} Methods for Separable Elliptic
12111 Problems",
12112 type = "Technical Report",
12113 number = "STAN-CS-73-375 (SU-326, P30-27)",
12114 institution = inst-STAN-CS,
12115 address = inst-STAN-CS:adr,
12116 pages = "30",
12117 month = jul,
12118 year = "1973",
12119 bibdate = "Fri Nov 21 14:21:14 2025",
12120 bibsource = "https://www.math.utah.edu/pub/bibnet/authors/g/golub-gene-h.bib;
12121 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
12122 URL = "",
12123 abstract = "Some very fast numerical methods have been developed
12124 in recent years for the solution of elliptic
12125 differential equations which allow for separation of
12126 variables. In this paper a Fourier--Toeplitz method is
12127 developed as an alternative to the well-known methods
12128 of Hockney and Buneman. It is based on the Fast Fourier
12129 Transform and Toeplitz factorization. The use of
12130 Toeplitz factorizations combined with the
12131 Sherman--Morrison formula is also systematically
12132 explored for linear systems of algebraic equations with
12133 band matrices of Toeplitz, or almost Toeplitz, form.
12134 Finally, results of numerical experiments are
12135 described.",
12136 acknowledgement = ack-nhfb,
12137 author-dates = "Gene Howard Golub (February 29, 1932--November 16,
12138 2007)",
12139 pdfpages = "39",
12140 }
12141
12142 @TechReport{Meinardus:1973:LEE,
12143 author = "G{\"u}nter Meinardus and Gerald D. Taylor",
12144 title = "Lower estimates for the error of best uniform
12145 approximation",
12146 type = "Technical Report",
12147 number = "STAN-CS-73-376 (SU326 P30-28)",
12148 institution = inst-STAN-CS,
12149 address = inst-STAN-CS:adr,
12150 pages = "20",
12151 month = jul,
12152 year = "1973",
12153 bibdate = "Fri Nov 7 07:00:05 MST 2025",
12154 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
12155 URL = "http://i.stanford.edu/TR/CS-TR-73-376.html;
12156 https://en.wikipedia.org/wiki/Remez_algorithm",
12157 abstract = "In this paper the lower bounds of de La Vall{\'e}e
12158 Poussin and Remes for the error of best uniform
12159 approximation from a linear subspace are generalized to
12160 give analogous estimates based on $k$ points, $ k = 1,
12161 \ldots {}, n$.",
12162 acknowledgement = ack-nhfb,
12163 pdfpages = "20",
12164 xxnumber = "CS-TR-73-376",
12165 }
12166
12167 @TechReport{Wilks:1973:PS,
12168 author = "Yorick Wilks",
12169 title = "Preference Semantics",
12170 type = "Technical Report",
12171 number = "STAN-CS-73-377 (AIM-206, AD764652)",
12172 institution = inst-STAN-CS,
12173 address = inst-STAN-CS:adr,
12174 pages = "20",
12175 month = jun,
12176 year = "1973",
12177 bibdate = "Fri Nov 21 14:21:14 2025",
12178 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
12179 URL = "",
12180 acknowledgement = ack-nhfb,
12181 }
12182
12183 @TechReport{Moorer:1973:OCM,
12184 author = "James Anderson Moorer",
12185 title = "The optimum comb method of pitch period analysis of
12186 continuous digitized speech",
12187 type = "Technical Report",
12188 number = "STAN-CS-73-378 (AIM-207, AD767333)",
12189 institution = inst-STAN-CS,
12190 address = inst-STAN-CS:adr,
12191 pages = "22",
12192 month = jul,
12193 year = "1973",
12194 bibdate = "Fri Nov 7 07:00:05 MST 2025",
12195 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
12196 URL = "http://i.stanford.edu/TR/CS-TR-73-378.html",
12197 abstract = "A new method of tracking the fundamental frequency of
12198 voiced speech is described. The method is shown to be
12199 of similar accuracy as the Cepstrum technique. Since
12200 the method involves only additions, no multiplication,
12201 it is shown to be faster than the SIFT algorithm.",
12202 acknowledgement = ack-nhfb,
12203 pdfpages = "22",
12204 xxnumber = "CS-TR-73-378",
12205 }
12206
12207 @TechReport{Moorer:1973:HFT,
12208 author = "James Anderson Moorer",
12209 title = "The heterodyne filter as a tool for analysis of
12210 transient waveforms",
12211 type = "Technical Report",
12212 number = "STAN-CS-73-379 (AIM-208, AD767334)",
12213 institution = inst-STAN-CS,
12214 address = inst-STAN-CS:adr,
12215 pages = "27",
12216 month = jul,
12217 year = "1973",
12218 bibdate = "Fri Nov 7 07:00:05 MST 2025",
12219 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
12220 URL = "http://i.stanford.edu/TR/CS-TR-73-379.html",
12221 abstract = "A method of analysis of transient waveforms is
12222 discussed. Its properties and limitations are presented
12223 in the context of musical tones. The method is shown to
12224 be useful when the risetimes of the partials of the
12225 tone are not too short. An extension to inharmonic
12226 partials and polyphonic musical sound is discussed.",
12227 acknowledgement = ack-nhfb,
12228 pdfpages = "27",
12229 xxnumber = "CS-TR-73-379",
12230 }
12231
12232 @TechReport{Yakimovsky:1973:SAU,
12233 author = "Yoram Yakimovsky",
12234 title = "Scene Analysis Using a Semantic Base for Region
12235 Growing",
12236 type = "Technical Report",
12237 number = "STAN-CS-73-380 (AIM-209, AD767695/OWC)",
12238 institution = inst-STAN-CS,
12239 address = inst-STAN-CS:adr,
12240 pages = "120",
12241 month = jun,
12242 year = "1973",
12243 bibdate = "Fri Nov 21 14:21:14 2025",
12244 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
12245 URL = "",
12246 acknowledgement = ack-nhfb,
12247 remark = "This is the author's thesis.",
12248 }
12249
12250 @TechReport{Sridharan:1973:CGV,
12251 author = "N. S. Sridharan",
12252 title = "Computer Generation of Vertex-Graphs",
12253 type = "Technical Report",
12254 number = "STAN-CS-73-381 (AD767694)",
12255 institution = inst-STAN-CS,
12256 address = inst-STAN-CS:adr,
12257 pages = "18",
12258 month = jul,
12259 year = "1973",
12260 bibdate = "Fri Nov 21 14:21:14 2025",
12261 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
12262 note = "See also \cite{Sridharan:1974:CQT}.",
12263 URL = "",
12264 acknowledgement = ack-nhfb,
12265 }
12266
12267 @TechReport{Manna:1973:AAT,
12268 author = "Zohar Manna and Amir Pnueli",
12269 title = "Axiomatic approach to total correctness of programs",
12270 type = "Technical Report",
12271 number = "STAN-CS-73-382 (AIM-210, AD767335)",
12272 institution = inst-STAN-CS,
12273 address = inst-STAN-CS:adr,
12274 pages = "??",
12275 month = jul,
12276 year = "1973",
12277 bibdate = "Fri Nov 7 07:00:05 MST 2025",
12278 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
12279 URL = "http://i.stanford.edu/TR/CS-TR-73-382.html",
12280 abstract = "We present here an axiomatic approach which enables
12281 one to prove by formal methods that his program is
12282 `totally correct' (i.e., it terminates and is logically
12283 correct --- does what it is supposed to do). The
12284 approach is similar to Hoare's approach for proving
12285 that a program is `partially correct' (i.e., that
12286 whenever it terminates it produces correct results).
12287 Our extension to Hoare's method lies in the possibility
12288 of proving correctness {\em and\/} termination at once,
12289 and in the enlarged scope of properties that can be
12290 proved by it.",
12291 acknowledgement = ack-nhfb,
12292 pdfpages = "27",
12293 xxnumber = "CS-TR-73-382",
12294 }
12295
12296 @TechReport{Wilks:1973:NLI,
12297 author = "Yorick A. Wilks",
12298 title = "Natural language inference",
12299 type = "Technical Report",
12300 number = "STAN-CS-73-383 (AIM-211, AD769673)",
12301 institution = inst-STAN-CS,
12302 address = inst-STAN-CS:adr,
12303 pages = "ii + 24",
12304 month = aug,
12305 year = "1973",
12306 bibdate = "Fri Nov 7 07:00:05 MST 2025",
12307 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
12308 URL = "http://i.stanford.edu/TR/CS-TR-73-383.html",
12309 abstract = "The paper describes the way in which a Preference
12310 Semantics system for natural language analysis and
12311 generation tackles a difficult class of anaphoric
12312 inference problems (finding the correct referent for an
12313 English pronoun in context): those requiring either
12314 analysis (conceptual) knowledge of a complex sort, or
12315 requiring weak inductive knowledge of the course of
12316 events in the real world. The method employed converts
12317 all available knowledge to a canonical template form
12318 and endeavors to create chains of non-deductive
12319 inferences from the unknowns to the possible referents.
12320 Its method of selecting among possible chains of
12321 inferences is consistent with the overall principle of
12322 `semantic preference' used to set up the original
12323 meaning representation, of which these anaphoric
12324 inference procedures are a manipulation.",
12325 acknowledgement = ack-nhfb,
12326 pdfpages = "26",
12327 xxnumber = "CS-TR-73-383",
12328 }
12329
12330 @TechReport{Herskovits:1973:GFS,
12331 author = "Annette Herskovits",
12332 title = "The generation of {French} from a semantic
12333 representation",
12334 type = "Technical Report",
12335 number = "STAN-CS-73-384 (AIM-212, AD769379)",
12336 institution = inst-STAN-CS,
12337 address = inst-STAN-CS:adr,
12338 pages = "??",
12339 month = aug,
12340 year = "1973",
12341 bibdate = "Fri Nov 7 07:00:05 MST 2025",
12342 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
12343 URL = "http://i.stanford.edu/TR/CS-TR-73-384.html",
12344 abstract = "The report contains first a brief description of
12345 Preference Semantics, a system of representation and
12346 analysis of the meaning structure of natural language.
12347 The analysis algorithm which transforms phrases into
12348 semantic items called templates has been considered in
12349 detail elsewhere, so this report concentrates on the
12350 second phase of analysis, which binds templates
12351 together into a higher level semantic block
12352 corresponding to an English paragraph, and which, in
12353 operation, interlocks with the French generation
12354 procedure. During this phase, the semantic relations
12355 between templates are extracted, pronouns are referred
12356 and those word disambiguations are done that require
12357 the context of a whole paragraph. These tasks require
12358 items called PARAPLATES which are attached to keywords
12359 such as prepositions, subjunctions and relative
12360 pronouns. The system chooses the representation which
12361 maximises a carefully defined `semantic density.' A
12362 system for the generation of French sentences is then
12363 described, based on the recursive evaluation of
12364 procedural generation patterns called STEREOTYPES. The
12365 stereotypes are semantically context sensitive, are
12366 attached to each sense of English words and keywords
12367 and are carried into the representation by the analysis
12368 procedure. The representation of the meaning of words,
12369 and the versatility of the stereotype format, allow for
12370 fine meaning distinctions to appear in the French, and
12371 for the construction of French differing radically from
12372 the English original.",
12373 acknowledgement = ack-nhfb,
12374 pdfpages = "22",
12375 xxnumber = "CS-TR-73-384",
12376 }
12377
12378 @TechReport{Thosar:1973:RCS,
12379 author = "Ravindra B. Thosar",
12380 title = "Recognition of continuous speech: segmentation and
12381 classification using signature table adaptation",
12382 type = "Technical Report",
12383 number = "STAN-CS-73-385 (AIM-213)",
12384 institution = inst-STAN-CS,
12385 address = inst-STAN-CS:adr,
12386 pages = "??",
12387 month = sep,
12388 year = "1973",
12389 bibdate = "Fri Nov 7 07:00:05 MST 2025",
12390 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
12391 URL = "http://i.stanford.edu/TR/CS-TR-73-385.html",
12392 abstract = "This report explores the possibility of using a set of
12393 features for segmentation and recognition of continuous
12394 speech. The features are not necessarily `distinctive'
12395 or minimal, in the sense that they do not divide the
12396 phonemes into mutually exclusive subsets, and can have
12397 high redundancy. This concept of feature can thus avoid
12398 apriori binding between the phoneme categories to be
12399 recognized and the set of features defined in a
12400 particular system. An adaptive technique is used to
12401 find the probability of the presence of a feature. Each
12402 feature is treated independently of other features. An
12403 unknown utterance is thus represented by a feature
12404 graph with associated probabilities. It is hoped that
12405 such a representation would be valuable for a
12406 hypothesize-test paradigm as opposed to one which
12407 operates on a linear symbolic input.",
12408 acknowledgement = ack-nhfb,
12409 pdfpages = "39",
12410 xxnumber = "CS-TR-73-385",
12411 }
12412
12413 @TechReport{Perkins:1973:CFV,
12414 author = "W. A. Perkins and Thomas O. Binford",
12415 title = "A corner finder for visual feedback",
12416 type = "Technical Report",
12417 number = "STAN-CS-73-386 (AIM-214, AD767332)",
12418 institution = inst-STAN-CS,
12419 address = inst-STAN-CS:adr,
12420 pages = "??",
12421 month = aug,
12422 year = "1973",
12423 bibdate = "Fri Nov 7 07:00:05 MST 2025",
12424 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
12425 URL = "http://i.stanford.edu/TR/CS-TR-73-386.html",
12426 abstract = "In visual-feedback work often a model of an object and
12427 its approximate location are known and it is only
12428 necessary to determine its location and orientation
12429 more accurately. The purpose of the program described
12430 herein is to provide such information for the case in
12431 which the model is an edge or corner. Given a model of
12432 a line or a corner with two or three edges, the program
12433 searches a TV window of arbitrary size looking for one
12434 or all corners which match the model. A model-driven
12435 program directs the search. It calls on another program
12436 to find all lines inside the window. Then it looks at
12437 these lines and eliminates lines which cannot match any
12438 of the model lines. It next calls on a program to form
12439 vertices and then checks for a matching vertex. If this
12440 simple procedure fails, the model-driver has two backup
12441 procedures. First it works with the lines that it has
12442 and tries to form a matching vertex (corner). If this
12443 fails, it matches parts of the model with vertices and
12444 lines that are present and then takes a careful look in
12445 a small region in which it expects to find a missing
12446 line. The program often finds weak contrast edges in
12447 this manner. Lines are found by a global method after
12448 the entire window has been scanned with the Hueckel
12449 edge operator.",
12450 acknowledgement = ack-nhfb,
12451 pdfpages = "62",
12452 xxnumber = "CS-TR-73-386",
12453 }
12454
12455 @TechReport{Buchanan:1973:ABC,
12456 author = "Bruce G. Buchanan and Natesa S. Sridharan",
12457 title = "Analysis of behavior of chemical molecules: rule
12458 formation on non-homogeneous classes of objects",
12459 type = "Technical Report",
12460 number = "STAN-CS-73-387 (AIM-215, AD769380)",
12461 institution = inst-STAN-CS,
12462 address = inst-STAN-CS:adr,
12463 pages = "??",
12464 month = aug,
12465 year = "1973",
12466 bibdate = "Fri Nov 7 07:00:05 MST 2025",
12467 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
12468 URL = "http://i.stanford.edu/TR/CS-TR-73-387.html",
12469 abstract = "An information processing model of some important
12470 aspects of inductive reasoning is presented within the
12471 context of one scientific discipline. Given a
12472 collection of experimental (mass spectrometry) data
12473 from several chemical molecules the computer program
12474 described here separates the molecules into
12475 `well-behaved' subclasses and selects from the space of
12476 all explanatory processes the `characteristic'
12477 processes for each subclass. The definitions of
12478 `well-behaved' and `characteristic' embody several
12479 heuristics which are discussed. Some results of the
12480 program are discussed which have been useful to
12481 chemists and which lend credibility to this approach.",
12482 acknowledgement = ack-nhfb,
12483 pdfpages = "28",
12484 xxnumber = "CS-TR-73-387",
12485 }
12486
12487 @TechReport{Swanson:1973:IPM,
12488 author = "Roger C. Swanson",
12489 title = "Interconnections for parallel memories to unscramble
12490 $p$-ordered vectors",
12491 type = "Technical Report",
12492 number = "STAN-CS-73-388 (CSL-TR-74, PB226044/AS)",
12493 institution = inst-STAN-CS,
12494 address = inst-STAN-CS:adr,
12495 pages = "??",
12496 month = may,
12497 year = "1973",
12498 bibdate = "Fri Nov 7 07:00:05 MST 2025",
12499 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
12500 URL = "http://i.stanford.edu/TR/CS-TR-73-388.html",
12501 abstract = "Several methods are being considered for storing
12502 arrays in a parallel memory system so that various
12503 useful partitions of an array can be fetched from the
12504 memory with a single access. Some of these methods
12505 fetch vectors in an order scrambled from that required
12506 for a computation. This paper considers the problem of
12507 unscrambling such vectors when the vectors belong to a
12508 class called p-ordered vectors and the memory system
12509 consists of a prime number of modules. Pairs of
12510 interconnections are described that can unscramble
12511 p-ordered vectors in a number of steps that grows as
12512 the square root of the number of memories. Lower and
12513 upper bounds are given for the number of steps to
12514 unscramble the worst case vector. The upper bound
12515 calculation that is derived also provides an upper
12516 bound on the minimum diameter of a star polygon with a
12517 fixed number of nodes and two interconnections. An
12518 algorithm is given that has produced optimal pairs of
12519 interconnections for all sizes of memory that have been
12520 tried. The algorithm appears to find optimal pairs for
12521 all memory sizes, but no proof has yet been found.",
12522 acknowledgement = ack-nhfb,
12523 pdfpages = "58",
12524 xxnumber = "CS-TR-73-388",
12525 }
12526
12527 @TechReport{Masinter:1973:AAI,
12528 author = "L. Masinter and N. S. Sridharan and J. Lederberg and
12529 D. H. Smit",
12530 title = "Applications of Artificial Intelligence for Chemical
12531 Inference {XII}. {Exhaustive} Generation of Cyclic and
12532 Acyclic Isomers",
12533 type = "Technical Report",
12534 number = "STAN-CS-73-389 (AIM-216, AD771299)",
12535 institution = inst-STAN-CS,
12536 address = inst-STAN-CS:adr,
12537 pages = "iii + 58",
12538 month = sep,
12539 year = "1973",
12540 bibdate = "Fri Nov 21 14:21:14 2025",
12541 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
12542 URL = "",
12543 abstract = "A systematic method of identification of all possible
12544 graph isomers consistent with a given empirical formula
12545 is described. The method, embodied in a computer
12546 program, generates a complete list of isomers.
12547 Duplicate structures are avoided prospectively.",
12548 acknowledgement = ack-nhfb,
12549 pdfpages = "62",
12550 }
12551
12552 @TechReport{Gips:1973:CIT,
12553 author = "James Gips",
12554 title = "A construction for the inverse of a {Turing} machine",
12555 type = "Technical Report",
12556 number = "STAN-CS-73-390",
12557 institution = inst-STAN-CS,
12558 address = inst-STAN-CS:adr,
12559 pages = "??",
12560 month = aug,
12561 year = "1973",
12562 bibdate = "Fri Nov 7 07:00:05 MST 2025",
12563 bibsource = "https://www.math.utah.edu/pub/bibnet/authors/t/turing-alan-mathison.bib;
12564 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
12565 URL = "http://i.stanford.edu/TR/CS-TR-73-390.html",
12566 abstract = "A direct construction for the inverse of a Turing
12567 machine is presented.",
12568 acknowledgement = ack-nhfb,
12569 pdfpages = "11",
12570 xxnumber = "CS-TR-73-390",
12571 }
12572
12573 @TechReport{Sridharan:1973:SST,
12574 author = "Natesa S. Sridharan",
12575 title = "Search strategies for the task of organic chemical
12576 synthesis",
12577 type = "Technical Report",
12578 number = "STAN-CS-73-391 (AIM-217, AD770610)",
12579 institution = inst-STAN-CS,
12580 address = inst-STAN-CS:adr,
12581 pages = "??",
12582 month = oct,
12583 year = "1973",
12584 bibdate = "Fri Nov 7 07:00:05 MST 2025",
12585 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
12586 URL = "http://i.stanford.edu/TR/CS-TR-73-391.html",
12587 abstract = "A computer program has been written that successfully
12588 discovers syntheses for complex organic chemical
12589 molecules. The definition of the search space and
12590 strategies for heuristic search are described in this
12591 paper.",
12592 acknowledgement = ack-nhfb,
12593 pdfpages = "33",
12594 xxnumber = "CS-TR-73-391",
12595 }
12596
12597 @TechReport{Knuth:1973:SSE,
12598 author = "Donald E. Knuth",
12599 title = "{{\booktitle{Sorting and Searching}}} --- errata and
12600 addenda",
12601 type = "Technical Report",
12602 number = "STAN-CS-73-392",
12603 institution = inst-STAN-CS,
12604 address = inst-STAN-CS:adr,
12605 pages = "??",
12606 day = "1",
12607 month = oct,
12608 year = "1973",
12609 bibdate = "Fri Nov 7 07:00:05 MST 2025",
12610 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
12611 URL = "http://i.stanford.edu/TR/CS-TR-73-392.html;
12612 http://www-db.stanford.edu/TR/CS-TR-73-392.html;
12613 http://www.ncstrl.org:8900/ncstrl/servlet/search?formname=detail&id=oai%3Ancstrlh%3Astan%3ASTAN%2F%2FCS-TR-73-392",
12614 abstract = "This report lists all the typographical errors, in
12615 \booktitle{The Art of Computer Programming / Volume 3},
12616 that are presently known to its author. Several recent
12617 developments and references to the literature, which
12618 will be incorporated in the second printing, are also
12619 included in an attempt to keep the book up-to-date.
12620 Several dozen corrections to the second (1971) printing
12621 of volume two are also included.",
12622 acknowledgement = ack-nhfb,
12623 documentid = "oai:ncstrlh:stan:STAN//CS-TR-73-392",
12624 pdfpages = "38",
12625 xxnumber = "CS-TR-73-392",
12626 }
12627
12628 @TechReport{Vuillemin:1973:PTR,
12629 author = "Jean {\'E}tienne Vuillemin",
12630 title = "Proof Techniques for Recursive Programs",
12631 type = "Technical Report",
12632 number = "STAN-CS-73-393 (AIM-218, AD772063/4WC)",
12633 institution = inst-STAN-CS,
12634 address = inst-STAN-CS:adr,
12635 pages = "iv + 97",
12636 month = oct,
12637 year = "1973",
12638 bibdate = "Fri Nov 21 14:21:14 2025",
12639 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
12640 URL = "",
12641 abstract = "The concept of least fixed-point of a continuous
12642 function can be considered as the unifying thread of
12643 this dissertation.\par
12644
12645 The connections between fixed-points and recursive
12646 programs are detailed in Chapter 2, providing some
12647 insights on practical implementations of recursion.
12648 There are two usual characterizations of the least
12649 fixed-point of a continuous function. To the first
12650 characterization, due to Knaster and Tarski,
12651 corresponds a class of proof techniques for programs,
12652 as described in Chapter 3. The other characterization
12653 of least fixed points, better known as Kleene's first
12654 recursion theorem, is discussed in Chapter 4. It has
12655 the advantage of being effective and it leads to a
12656 wider class of proof techniques.",
12657 acknowledgement = ack-nhfb,
12658 pdfpages = "108",
12659 remark = "This is the author's thesis.",
12660 }
12661
12662 @TechReport{Hoare:1973:PPA,
12663 author = "C. A. R. Hoare",
12664 title = "Parallel programming: an axiomatic approach",
12665 type = "Technical Report",
12666 number = "STAN-CS-73-394 (AIM-219, AD769674)",
12667 institution = inst-STAN-CS,
12668 address = inst-STAN-CS:adr,
12669 pages = "97",
12670 month = oct,
12671 year = "1973",
12672 bibdate = "Fri Nov 7 07:00:05 MST 2025",
12673 bibsource = "https://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
12674 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
12675 URL = "http://i.stanford.edu/TR/CS-TR-73-394.html",
12676 abstract = "This paper develops some ideas expounded in [C. A. R.
12677 Hoare. `\booktitle{Towards a Theory of Parallel
12678 Programming},' in \booktitle{Operating Systems
12679 Techniques}, ed. C. A. R. Hoare and R. H. Perrot.
12680 Academic Press. 1972]. It distinguishes a number of
12681 ways of using parallelism, including disjoint
12682 processes, competition, cooperation, communication and
12683 `colluding'. In each case an axiomatic proof rule is
12684 given. Some light is thrown on traps or ON conditions.
12685 Warning: the program structuring methods described here
12686 are not suitable for the construction of operating
12687 systems.",
12688 acknowledgement = ack-nhfb,
12689 pdfpages = "33",
12690 xxnumber = "CS-TR-73-394",
12691 }
12692
12693 @TechReport{Staff:1973:BCS,
12694 author = "{Staff}",
12695 title = "Bibliography of Computer Science Reports",
12696 type = "Technical Report",
12697 number = "STAN-CS-73-395",
12698 institution = inst-STAN-CS,
12699 address = inst-STAN-CS:adr,
12700 pages = "48",
12701 month = oct,
12702 year = "1973",
12703 bibdate = "Fri Nov 21 14:21:14 2025",
12704 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
12705 URL = "",
12706 acknowledgement = ack-nhfb,
12707 }
12708
12709 @TechReport{Bolles:1973:USF,
12710 author = "Robert C. Bolles and Richard P. Paul",
12711 title = "The use of sensory feedback in a programmable assembly
12712 system",
12713 type = "Technical Report",
12714 number = "STAN-CS-73-396 (AIM-220, AD772064)",
12715 institution = inst-STAN-CS,
12716 address = inst-STAN-CS:adr,
12717 pages = "24",
12718 month = oct,
12719 year = "1973",
12720 bibdate = "Fri Nov 7 07:00:05 MST 2025",
12721 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
12722 URL = "http://i.stanford.edu/TR/CS-TR-73-396.html",
12723 abstract = "This article describes an experimental, automated
12724 assembly system which uses sensory feedback to control
12725 an electro-mechanical arm and TV camera. Visual,
12726 tactile, and force feedback are used to improve
12727 positional information, guide manipulations, and
12728 perform inspections. The system has two phases: a
12729 'planning' phase in which the computer is programmed to
12730 assemble some object, and a 'working' phase in which
12731 the computer controls the arm and TV camera in actually
12732 performing the assembly. The working phase is designed
12733 to be run on a mini-computer. The system has been used
12734 to assemble a water pump, consisting of a base, gasket,
12735 top, and six screws. This example is used to explain
12736 how the sensory data is incorporated into the control
12737 system. A movie showing the pump assembly is available
12738 from the Stanford Artificial Intelligence Laboratory.",
12739 acknowledgement = ack-nhfb,
12740 pdfpages = "27",
12741 xxnumber = "CS-TR-73-396",
12742 }
12743
12744 @TechReport{Henrici:1973:CCA,
12745 author = "Peter Henrici",
12746 title = "Computational Complex Analysis",
12747 type = "Technical Report",
12748 number = "STAN-CS-73-397 (SU326, P30-28A)",
12749 institution = inst-STAN-CS,
12750 address = inst-STAN-CS:adr,
12751 pages = "14",
12752 month = oct,
12753 year = "1973",
12754 bibdate = "Fri Nov 21 14:21:14 2025",
12755 bibsource = "https://www.math.utah.edu/pub/bibnet/authors/h/henrici-peter.bib;
12756 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
12757 URL = "",
12758 acknowledgement = ack-nhfb,
12759 author-dates = "Peter Karl Henrici (13 September 1923--13 March
12760 1987)",
12761 remark = "No PDF in NTRL archive.",
12762 }
12763
12764 @TechReport{Baumgart:1973:ICC,
12765 author = "Bruce G. Baumgart",
12766 title = "Image contouring and comparing",
12767 type = "Technical Report",
12768 number = "STAN-CS-73-398 (AIM-199, AD771300) (also mistakenly
12769 assigned STAN-CS-73-362)",
12770 institution = inst-STAN-CS,
12771 address = inst-STAN-CS:adr,
12772 pages = "??",
12773 month = oct,
12774 year = "1973",
12775 bibdate = "Fri Nov 7 07:00:05 MST 2025",
12776 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
12777 URL = "http://i.stanford.edu/TR/CS-TR-73-398.html",
12778 abstract = "A contour image representation is stated and an
12779 algorithm for converting a set of digital television
12780 images into this representation is explained. The
12781 algorithm consists of five steps: digital image
12782 thresholding, binary image contouring, polygon nesting,
12783 polygon smoothing, and polygon comparing. An
12784 implementation of the algorithm is the main routine of
12785 a program called CRE; auxiliary routines provide cart
12786 and turn table control, TV camera input, image display,
12787 and Xerox printer output. A serendip application of CRE
12788 to type font construction is explained. Details about
12789 the intended application of CRE to the perception of
12790 physical objects will appear in sequels to this
12791 paper.",
12792 acknowledgement = ack-nhfb,
12793 pdfpages = "54",
12794 xxnumber = "CS-TR-73-398 (also mistakenly assigned
12795 STAN-CS-73-362)",
12796 }
12797
12798 @TechReport{Paige:1973:SSI,
12799 author = "C. C. Paige and M. A. Saunders",
12800 title = "Solution of Sparse Indefinite Systems of Equations and
12801 Least Squares Problems",
12802 type = "Technical Report",
12803 number = "STAN-CS-73-399 (SU326, P30-29)",
12804 institution = inst-STAN-CS,
12805 address = inst-STAN-CS:adr,
12806 pages = "i + 49",
12807 month = nov,
12808 year = "1973",
12809 bibdate = "Fri Nov 21 14:21:14 2025",
12810 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
12811 URL = "",
12812 abstract = "The method of conjugate gradients for solving systems
12813 of linear equations with a symmetric positive definite
12814 matrix $A$ is given as a logical development of the
12815 Lanczos algorithm for tridiagonalizing $A$. This
12816 approach suggests numerical algorithms for solving such
12817 systems when $A$ is symmetric but indefinite. The new
12818 methods can be applied to linear least squares problems
12819 with or without constraints, with simplifications when
12820 there are no constraints. These methods have advantages
12821 when $A$ is large and sparse. Fortran subroutines are
12822 included.",
12823 acknowledgement = ack-nhfb,
12824 pdfpages = "50",
12825 }
12826
12827 @TechReport{Hoare:1973:RDS,
12828 author = "C. A. R. Hoare",
12829 title = "Recursive Data Structures",
12830 type = "Technical Report",
12831 number = "STAN-CS-73-400 (AIM-223, AD-772509)",
12832 institution = inst-STAN-CS,
12833 address = inst-STAN-CS:adr,
12834 pages = "iii + 32",
12835 month = oct,
12836 year = "1973",
12837 bibdate = "Fri Nov 21 14:21:14 2025",
12838 bibsource = "https://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
12839 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
12840 URL = "https://apps.dtic.mil/sti/tr/pdf/AD0772509.pdf",
12841 abstract = "The power and convenience of a programming language
12842 may be enhanced for certain applications by permitting
12843 data structures to be defined by recursion. This paper
12844 suggests a pleasing notation by which such structures
12845 can be declared and processed; it gives the axioms
12846 which specify their properties, and suggests an
12847 efficient implementation method. It shows how a
12848 recursive data structure may be used to represent
12849 another data type, for example, a set. It then
12850 discusses two ways in which significant gains in
12851 efficiency can be made by selective updating of
12852 structures, and gives the relevant proof rules and
12853 hints for implementation. It is shown by examples that
12854 a certain range of applications can be efficiently
12855 programmed, without introducing the low-level concept
12856 of a reference into a high-level programming
12857 language.",
12858 acknowledgement = ack-nhfb,
12859 pdfpages = "35",
12860 }
12861
12862 @TechReport{Hoare:1973:MOS,
12863 author = "C. A. R. Hoare",
12864 title = "Monitors: an operating system structuring concept",
12865 type = "Technical Report",
12866 number = "STAN-CS-73-401 (PB226691/AS)",
12867 institution = inst-STAN-CS,
12868 address = inst-STAN-CS:adr,
12869 pages = "i + 25",
12870 month = nov,
12871 year = "1973",
12872 bibdate = "Fri Nov 7 07:00:05 MST 2025",
12873 bibsource = "https://www.math.utah.edu/pub/bibnet/authors/h/hansen-per-brinch.bib;
12874 https://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
12875 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
12876 URL = "http://i.stanford.edu/TR/CS-TR-73-401.html",
12877 abstract = "This paper develops Brinch Hansen's concept of a
12878 monitor as a method of structuring an operating system.
12879 It introduces a form of synchronization, describes a
12880 possible method of implementation in terms of
12881 semaphores, and gives a suitable proof rule.
12882 Illustrative examples include a single resource
12883 scheduler, a bounded buffer, an alarm clock, a buffer
12884 pool, a disc head optimizer, and a version of the
12885 problem of readers and writers.",
12886 acknowledgement = ack-nhfb,
12887 pdfpages = "26",
12888 xxnumber = "CS-TR-73-401",
12889 }
12890
12891 @TechReport{Herriot:1974:APC,
12892 author = "John G. Herriot and Christian H. Reinsch",
12893 title = "{Algol 60} Procedures for the Calculation of
12894 Interpolating Natural Quintic Spline Functions",
12895 type = "Technical Report",
12896 number = "STAN-CS-74-402 (PB229616/AS)",
12897 institution = inst-STAN-CS,
12898 address = inst-STAN-CS:adr,
12899 pages = "iv + 40",
12900 month = jan,
12901 year = "1974",
12902 bibdate = "Fri Nov 21 14:21:14 2025",
12903 bibsource = "https://www.math.utah.edu/pub/bibnet/authors/r/reinsch-christian-h.bib;
12904 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
12905 URL = "",
12906 abstract = "Three Algol 60 procedures are described for finding
12907 interpolating natural quintic spline functions. The
12908 first procedure treats the case of an arbitrary set of
12909 knots and the second procedure handles the case of
12910 equidistant knots. The third procedure finds the
12911 quintic natural spline of deficiency 2 when the values
12912 of both the function and its first derivative are given
12913 at the knots. These procedures are much faster than
12914 more general procedures, which find interpolating
12915 natural splines of degree $ 2 m - 1 $, when used with $
12916 m = 3 $",
12917 acknowledgement = ack-nhfb,
12918 author-dates = "Christian H. Reinsch (?? ?? 1932--8 October 2022)",
12919 pdfpages = "44",
12920 }
12921
12922 @TechReport{Hoare:1973:HPL,
12923 author = "C. A. R. Hoare",
12924 title = "Hints on programming language design",
12925 type = "Technical Report",
12926 number = "STAN-CS-73-403 (AIM-224, AD773391)",
12927 institution = inst-STAN-CS,
12928 address = inst-STAN-CS:adr,
12929 pages = "??",
12930 month = dec,
12931 year = "1973",
12932 bibdate = "Fri Nov 7 07:00:05 MST 2025",
12933 bibsource = "https://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
12934 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
12935 URL = "http://i.stanford.edu/TR/CS-TR-73-403.html",
12936 abstract = "This paper (based on a keynote address presented at
12937 the SIGACT/SIGPLAN Symposium on Principles of
12938 Programming Languages, Boston, October 1-3, 1973)
12939 presents the view that a programming language is a tool
12940 which should assist the programmer in the most
12941 difficult aspects of his art, namely program design,
12942 documentation, and debugging. It discusses the
12943 objective criteria for evaluating a language design,
12944 and illustrates them by application to language
12945 features of both high level languages and machine code
12946 programming. It concludes with an annotated reading
12947 list, recommended for all intending language
12948 designers.",
12949 acknowledgement = ack-nhfb,
12950 pdfpages = "30",
12951 xxnumber = "CS-TR-73-403",
12952 }
12953
12954 @TechReport{Earnest:1973:FRF,
12955 author = "Lester D. Earnest and John McCarthy and Edward A.
12956 Feigenbaum and Joshua Lederberg",
12957 title = "Final report: the first ten years of artificial
12958 intelligence research at {Stanford}",
12959 type = "Technical Report",
12960 number = "STAN-CS-74-409 (AIM-228, AD776233)",
12961 institution = inst-STAN-CS,
12962 address = inst-STAN-CS:adr,
12963 pages = "??",
12964 month = jul,
12965 year = "1973",
12966 bibdate = "Fri Nov 7 07:00:05 MST 2025",
12967 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
12968 URL = "http://i.stanford.edu/TR/CS-TR-74-409.html",
12969 abstract = "The first ten years of research in artificial
12970 intelligence and related fields at Stanford University
12971 have yielded significant results in computer vision and
12972 control of manipulators, speech recognition, heuristic
12973 programming, representation theory, mathematical theory
12974 of computation, and modeling of organic chemical
12975 processes. This report summarizes the accomplishments
12976 and provides bibliographies in each research area.",
12977 acknowledgement = ack-nhfb,
12978 author-dates = "John McCarthy (4 September 1927--24 October 2011)",
12979 pdfpages = "124",
12980 xxnumber = "CS-TR-74-409",
12981 }
12982
12983 @TechReport{Sridharan:1974:CQT,
12984 author = "Natesa S. Sridharan",
12985 title = "A Catalog of Quadri\slash Trivalent Graphs",
12986 type = "Technical Report",
12987 number = "STAN-CS-74-404 (AD775452)",
12988 institution = inst-STAN-CS,
12989 address = inst-STAN-CS:adr,
12990 pages = "48",
12991 month = jan,
12992 year = "1974",
12993 bibdate = "Fri Nov 7 07:00:05 MST 2025",
12994 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
12995 URL = "http://i.stanford.edu/TR/CS-TR-74-404.html",
12996 abstract = "In a previous report \cite{Sridharan:1973:CGV} a
12997 method for computer generation of quadri\slash
12998 trivalent `vertex-graphs' was presented in detail. This
12999 report is a catalog of 13 classes of graphs generated
13000 by using this method.",
13001 acknowledgement = ack-nhfb,
13002 pdfpages = "50",
13003 xxnumber = "CS-TR-74-404",
13004 }
13005
13006 @TechReport{Davis:1974:SCS,
13007 author = "Randall Davis and Margaret H. Wright",
13008 title = "{Stanford Computer Science Department} research
13009 report",
13010 type = "Technical Report",
13011 number = "STAN-CS-74-405",
13012 institution = inst-STAN-CS,
13013 address = inst-STAN-CS:adr,
13014 pages = "??",
13015 month = jan,
13016 year = "1974",
13017 bibdate = "Fri Nov 7 07:00:05 MST 2025",
13018 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
13019 URL = "http://i.stanford.edu/TR/CS-TR-74-405.html",
13020 abstract = "This collection of reports is divided into two
13021 sections. The first contains the research summaries for
13022 individual faculty members and research associates in
13023 the Computer Science Department. Two professors from
13024 Electrical Engineering are included as `Affiliated
13025 Faculty' because their interests are closely related to
13026 those of the Department, while Professors George
13027 Dantzig and Roger Schank do not appear because they
13028 were on leave and unavailable when the summaries were
13029 prepared. The second section gives an overview of the
13030 activities of research groups in the Department.
13031 `Group' here is taken to imply many different things,
13032 including people related by various degrees of
13033 intellectual interests, physical proximity, or funding
13034 considerations. We have tried to describe any group
13035 whose scope of interest is greater than that of one
13036 person. The list of recent publications for each is not
13037 intended to be comprehensive, but rather to give a
13038 feeling for the range of topics considered. This
13039 collection of reports has been assembled to provide a
13040 reasonably comprehensive review of research activities
13041 in the Department. We hope that it will be widely
13042 useful --- in particular, students in the Department
13043 may find it helpful in discovering interesting projects
13044 and possible thesis topics. We expect also that it will
13045 be of interest to many other people, both within and
13046 outside the Department.",
13047 acknowledgement = ack-nhfb,
13048 pdfpages = "40",
13049 xxnumber = "CS-TR-74-405",
13050 }
13051
13052 @TechReport{Perkins:1974:MMR,
13053 author = "W. A. Perkins",
13054 title = "Memory model for a robot",
13055 type = "Technical Report",
13056 number = "STAN-CS-74-406 (AIM-225, AD775645)",
13057 institution = inst-STAN-CS,
13058 address = inst-STAN-CS:adr,
13059 pages = "??",
13060 month = jan,
13061 year = "1974",
13062 bibdate = "Fri Nov 7 07:00:05 MST 2025",
13063 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
13064 URL = "http://i.stanford.edu/TR/CS-TR-74-406.html",
13065 abstract = "A memory model for a robot has been designed and
13066 tested in a simple toy-block world for which it has
13067 shown clarity, efficiency, and generality. In a
13068 constrained pseudo-English one can ask the program to
13069 manipulate objects and query it about the present,
13070 past, and possible future states of its world. The
13071 program has a good understanding of its world and gives
13072 intelligent answers in reasonably good English. Past
13073 and hypothetical states of the world are handled by
13074 changing the state of the world in an imaginary
13075 context. Procedures interrogate and modify two global
13076 databases, one which contains the present
13077 representation of the world and another which contains
13078 the past history of events, conversations, etc. The
13079 program has the ability to create, destroy, and even
13080 resurrect objects in its world.",
13081 acknowledgement = ack-nhfb,
13082 pdfpages = "119",
13083 xxnumber = "CS-TR-74-406",
13084 }
13085
13086 @TechReport{Wright:1974:F,
13087 author = "F. H. G. {Wright, II} and Ralph E. Gorin",
13088 title = "{FAIL}",
13089 type = "Technical Report",
13090 number = "STAN-CS-74-407 (AIM-226, AD778310)",
13091 institution = inst-STAN-CS,
13092 address = inst-STAN-CS:adr,
13093 pages = "??",
13094 month = apr,
13095 year = "1974",
13096 bibdate = "Fri Nov 7 07:00:05 MST 2025",
13097 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
13098 URL = "http://i.stanford.edu/TR/CS-TR-74-407.html",
13099 abstract = "This is a reference manual for FAIL, a fast, one-pass
13100 assembler for PDP-10 and PDP-6 machine language. FAIL
13101 statements, pseudo-operations, macros, and conditional
13102 assembly features are described. Although FAIL uses
13103 substantially more main memory than MACRO-10, it
13104 assembles typical programs about five time faster. FAIL
13105 assembles the entire Stanford time-sharing operating
13106 system (two million characters) in less than four
13107 minutes of CPU time on a KA-10 processor. FAIL permits
13108 an ALGOL-type block structure which provides a way of
13109 localizing the usage of some symbols to certain parts
13110 of the program, such that the same symbol name can be
13111 used to mean different things in different blocks.",
13112 acknowledgement = ack-nhfb,
13113 pdfpages = "70",
13114 xxnumber = "CS-TR-74-407",
13115 }
13116
13117 @TechReport{Thomas:1974:IPA,
13118 author = "Arthur J. Thomas and Thomas O. Binford",
13119 title = "Information Processing Analysis of Visual Perception:
13120 a review",
13121 type = "Technical Report",
13122 number = "STAN-CS-74-408 (AIM-227, AD-A003483)",
13123 institution = inst-STAN-CS,
13124 address = inst-STAN-CS:adr,
13125 pages = "i + 60",
13126 month = jun,
13127 year = "1974",
13128 bibdate = "Fri Nov 21 14:21:14 2025",
13129 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
13130 URL = "",
13131 abstract = "We suggest that recent advances in the construction of
13132 artificial vision systems provide the beginnings of a
13133 framework for an information processing analysis of
13134 human visual perception. We review some pertinent
13135 investigations which have appeared in the psychological
13136 literature, and discuss what we think to be some of the
13137 salient end potentially useful theoretical concepts
13138 which have resulted from the attempts to build computer
13139 vision systems. Finally we try to integrate these two
13140 sources of ideas to suggest some desirable structural
13141 and behavioural concepts which apply to both the
13142 natural end artificial systems.",
13143 acknowledgement = ack-nhfb,
13144 pdfpages = "62",
13145 }
13146
13147 @TechReport{Peterson:1974:MPS,
13148 author = "James L. Peterson",
13149 title = "Modelling of Parallel Systems",
13150 type = "Technical Report",
13151 number = "STAN-CS-74-410 (CSL-TR-46, PB231926/AS)",
13152 institution = inst-STAN-CS,
13153 address = inst-STAN-CS:adr,
13154 pages = "241",
13155 month = feb,
13156 year = "1974",
13157 bibdate = "Fri Nov 21 14:21:14 2025",
13158 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
13159 URL = "",
13160 acknowledgement = ack-nhfb,
13161 remark = "This is the author's thesis. No PDF in NTRL archive.",
13162 }
13163
13164 @TechReport{Anderson:1974:ALL,
13165 author = "D. Bruce Anderson and Thomas O. Binford and Arthur J.
13166 Thomas and Richard W. Weyhrauch and Yorick A. Wilks",
13167 title = "After {Leibniz} \ldots{}: discussions on philosophy
13168 and artificial intelligence",
13169 type = "Technical Report",
13170 number = "STAN-CS-74-411 (AIM-229)",
13171 institution = inst-STAN-CS,
13172 address = inst-STAN-CS:adr,
13173 pages = "??",
13174 month = mar,
13175 year = "1974",
13176 bibdate = "Fri Nov 7 07:00:05 MST 2025",
13177 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
13178 URL = "http://i.stanford.edu/TR/CS-TR-74-411.html",
13179 abstract = "This is an edited transcript of informal conversations
13180 which we have had over recent months, in which we
13181 looked at some of the issues which seem to arise when
13182 artificial intelligence and philosophy meet. Our aim
13183 was to see what might be some of the fundamental
13184 principles of attempts to build intelligent machines.
13185 The major topics covered are the relationship of AI and
13186 philosophy and what help they might be to each other:
13187 the mechanisms of natural inference and deduction; the
13188 question of what kind of theory of meaning would be
13189 involved in a successful natural language understanding
13190 program, and the nature of models in AI research.",
13191 acknowledgement = ack-nhfb,
13192 pdfpages = "44",
13193 xxnumber = "CS-TR-74-411",
13194 }
13195
13196 @TechReport{Swinehart:1974:CMP,
13197 author = "Daniel Carl Swinehart",
13198 title = "{COPILOT}: a Multiple Process Approach to Interactive
13199 Programming Systems",
13200 type = "Technical Report",
13201 number = "STAN-CS-74-412 (AIM-230, AD786721)",
13202 institution = inst-STAN-CS,
13203 address = inst-STAN-CS:adr,
13204 pages = "",
13205 month = jul,
13206 year = "1974",
13207 bibdate = "Fri Nov 21 14:21:14 2025",
13208 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
13209 URL = "https://apps.dtic.mil/sti/tr/pdf/AD0786721.pdf",
13210 abstract = "An experimental interactive system, COPILOT, 1s used
13211 as the concrete vehicle for testing and describing
13212 methods for adding multiple processing facilities to an
13213 interactive language environment.\par
13214
13215 COPILOT allows the user to create, modify, investigate,
13216 and control programs written in an Algol-like language,
13217 augmented for multiple processing. Although COPILOT is
13218 compiler-based, many of our solutions could also be
13219 applied to an interpretive system.\par
13220
13221 Central to the design is the use of CRT displays to
13222 present programs, program data, and system status. This
13223 continuous display of information in context allows the
13224 user to retain comprehension of complex program
13225 environments, and to indicate the environments to be
13226 affected by his commands.\par
13227
13228 COPILOT uses the multiple processing facilities to its
13229 advantage to achieve a ``no-preemptive'' kind of
13230 interactive control. The user's terminal is
13231 continuously available for commands of any kind:
13232 program editing, variable inquiry, program control,
13233 etc., independent of the execution state of the
13234 processes he is controlling. No process may
13235 unilaterally gain possession of the user's input; the
13236 user retains control at all times.\par
13237
13238 The emphasis throughout is on improving the
13239 characteristics of the interface between the user and
13240 the system.",
13241 acknowledgement = ack-nhfb,
13242 advisor = "Jerry Feldman",
13243 pdfpages = "215",
13244 remark = "This is the author's thesis.",
13245 }
13246
13247 @TechReport{Gips:1974:SGT,
13248 author = "James Gips",
13249 title = "Shape Grammars and Their Uses",
13250 type = "Technical Report",
13251 number = "STAN-CS-74-413 (AIM-231, AD-A001814)",
13252 institution = inst-STAN-CS,
13253 address = inst-STAN-CS:adr,
13254 pages = "xi + 233",
13255 month = mar,
13256 year = "1974",
13257 bibdate = "Fri Nov 21 14:21:14 2025",
13258 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
13259 URL = "",
13260 abstract = "Shape grammars are defined and their uses are
13261 investigated. Shape grammars provide a means for the
13262 recursive specification of shapes. A shape grammar is
13263 presented that generates a new class of reversible
13264 figures. Shape grammars are given for some well known
13265 mathematical curves. A simple method for constructing
13266 shape grammars that simulate Turing machines is
13267 presented. A program has been developed that uses a
13268 shape grammar to solve a perceptual task involving the
13269 analysis and comparison of line drawings that portray
13270 three-dimensional objects of a restricted type. A
13271 formalism that uses shape grammars to generate
13272 paintings is defined, its implementation on the
13273 computer is described, and examples of generated
13274 paintings are shown. The use of shape grammars in
13275 generating paintings has led to an investigation of
13276 aesthetics. A formalism for specifying aesthetic
13277 viewpoints is described. A program has been written
13278 that evaluates the paintings generated using shape
13279 grammars in terms of a well-defined aesthetic viewpoint
13280 specified with this formalism.",
13281 acknowledgement = ack-nhfb,
13282 pdfpages = "244",
13283 remark = "This is the author's thesis.",
13284 }
13285
13286 @TechReport{Baumgart:1974:GGE,
13287 author = "Bruce G. Baumgart",
13288 title = "{GEOMED} --- a geometric editor",
13289 type = "Technical Report",
13290 number = "STAN-CS-74-414 (AIM-232, AD780452)",
13291 institution = inst-STAN-CS,
13292 address = inst-STAN-CS:adr,
13293 pages = "??",
13294 month = may,
13295 year = "1974",
13296 bibdate = "Fri Nov 7 07:00:05 MST 2025",
13297 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
13298 URL = "http://i.stanford.edu/TR/CS-TR-74-414.html",
13299 abstract = "GEOMED is a system for doing 3-D geometric modeling;
13300 used from a keyboard, it is an interactive drawing
13301 program; used as a package of SAIL or LISP accessible
13302 subroutines, it is a graphics language. With GEOMED,
13303 arbitrary polyhedra can be constructed, moved about and
13304 viewed in perspective with hidden lines eliminated. In
13305 addition to polyhedra, camera and image models are
13306 provided so that simulators relevant to computer
13307 vision, problem solving, and animation may be
13308 constructed.",
13309 acknowledgement = ack-nhfb,
13310 pdfpages = "54",
13311 xxnumber = "CS-TR-74-414",
13312 }
13313
13314 @TechReport{Rivest:1974:AAR,
13315 author = "Ronald Linn Rivest",
13316 title = "Analysis of Associative Retrieval Algorithms",
13317 type = "Technical Report",
13318 number = "STAN-CS-74-415 (PB233065/AS)",
13319 institution = inst-STAN-CS,
13320 address = inst-STAN-CS:adr,
13321 pages = "viii + 102",
13322 month = may,
13323 year = "1974",
13324 bibdate = "Fri Nov 21 14:21:14 2025",
13325 bibsource = "https://www.math.utah.edu/pub/tex/bib/hash.bib;
13326 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
13327 URL = "https://people.csail.mit.edu/rivest/pubs/rivest-1974-PhD.pdf",
13328 abstract = "This thesis examines various methods of performing
13329 associative searches of a random-access file. An
13330 abstract model of the retrieval process is used to
13331 evaluate the different techniques.\par
13332
13333 For partial-match queries, both generalized hash-coding
13334 and trie algorithms are analyzed. An exact lower bound
13335 is derived for the required average number of buckets
13336 examined by hash-coding algorithms, and the optimal
13337 hash functions are precisely characterized. A new class
13338 of combinatorial designs, called associative block
13339 designs, is introduced which have excellent worst-case
13340 behavior as well as optimal average retrieval time when
13341 employed as hash functions. Tries are found to be about
13342 as efficient as the optimal hash functions on the
13343 average. In general, the time required to answer a
13344 partial match query is found to decrease approximately
13345 exponentially with the amount of information specified
13346 in the query. The efficiency gains achievable through
13347 storing records in several locations are also
13348 examined.\par
13349
13350 For answering best-match queries, a hash-coding
13351 algorithm due to Elias based on error-correcting codes
13352 1s shown to be optimal.",
13353 acknowledgement = ack-nhfb,
13354 advisor = "Robert W. Floyd",
13355 pdfpages = "124",
13356 remark = "This is the author's Ph.D. thesis, dated March 1974.",
13357 }
13358
13359 @TechReport{Knuth:1974:SPG,
13360 author = "Donald E. Knuth",
13361 title = "Structured Programming with {{\tt Go To}} Statements",
13362 type = "Technical Report",
13363 number = "STAN-CS-74-416 (PB233507/AS)",
13364 institution = inst-STAN-CS,
13365 address = inst-STAN-CS:adr,
13366 pages = "100",
13367 month = apr,
13368 year = "1974",
13369 DOI = "https://doi.org/10.1145/356635.356640",
13370 bibdate = "Fri Nov 21 14:21:14 2025",
13371 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
13372 URL = "",
13373 acknowledgement = ack-nhfb,
13374 remark = "No PDF in NTRL archive. Published in
13375 \booktitle{Computing Surveys}, {\bf 6}(4) 261--301,
13376 December 1974. doi:10.1145/356635.356640.",
13377 }
13378
13379 @TechReport{Sites:1974:STP,
13380 author = "Richard L. Sites",
13381 title = "Some Thoughts on Proving That Programs Terminate
13382 Cleanly",
13383 type = "Technical Report",
13384 number = "STAN-CS-74-417 (PB233045/AS)",
13385 institution = inst-STAN-CS,
13386 address = inst-STAN-CS:adr,
13387 pages = "68",
13388 month = may,
13389 year = "1974",
13390 bibdate = "Fri Nov 21 14:21:14 2025",
13391 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
13392 URL = "",
13393 acknowledgement = ack-nhfb,
13394 xxtitle = "Some thoughts on proving clean termination of
13395 programs",
13396 }
13397
13398 @TechReport{Sites:1974:PCP,
13399 author = "Richard L. Sites",
13400 title = "Proving That Computer Programs Terminate Cleanly",
13401 type = "Technical Report",
13402 number = "STAN-CS-74-418 (PB233045/AS)",
13403 institution = inst-STAN-CS,
13404 address = inst-STAN-CS:adr,
13405 pages = "vi + 139",
13406 month = may,
13407 year = "1974",
13408 bibdate = "Fri Nov 7 07:00:05 MST 2025",
13409 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
13410 URL = "http://i.stanford.edu/TR/CS-TR-74-417.html",
13411 abstract = "Proof of clean termination is a useful sub-goal in the
13412 process of proving that a program is totally correct.
13413 Clean termination means that the program terminates (no
13414 infinite loops) and that it does so normally, without
13415 any execution-time semantic errors (integer overflow,
13416 use of undefined variables, subscript out of range,
13417 etc.). In contrast to proofs of correctness, proof of
13418 clean termination requires no extensive annotation of a
13419 program by a human user, but the proof says nothing
13420 about the results calculated by the program, just that
13421 whatever it does, it terminates cleanly. Two example
13422 proofs are given, of previously published programs:
13423 TREESORT3 by Robert Floyd, and SELECT by Ronald L.
13424 Rivest and Robert Floyd.",
13425 acknowledgement = ack-nhfb,
13426 advisor = "Donald E. Knuth",
13427 pdfpages = "145",
13428 remark = "This is the author's thesis.",
13429 xxnumber = "CS-TR-74-417",
13430 }
13431
13432 @TechReport{Rieger:1974:CMT,
13433 author = "Charles {Rieger III}",
13434 title = "Conceptual Memory: a Theory and Computer Program for
13435 Processing the Meaning Content of Natural Language
13436 Utterances",
13437 type = "Technical Report",
13438 number = "STAN-CS-74-419 (AIM-233, AD-A000086)",
13439 institution = inst-STAN-CS,
13440 address = inst-STAN-CS:adr,
13441 pages = "xv + 393",
13442 month = may,
13443 year = "1974",
13444 bibdate = "Fri Nov 21 14:21:14 2025",
13445 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
13446 URL = "",
13447 abstract = "Humans perform vast quantities of spontaneous,
13448 subconscious computation in order to understand even
13449 the simplest language utterances. The computation is
13450 principally meaning-based, with syntax and traditional
13451 semantics playing insignificant roles. This thesis
13452 supports this conjecture by synthesis of a theory and
13453 computer program which account for many aspects of
13454 language behavior in humans. It is a theory of language
13455 and memory.\par
13456
13457 Since the theory and program deal with language in the
13458 domain of conceptual meaning, they are independent of
13459 language form and of any specific language. Input to
13460 the memory has the form of analyzed conceptual
13461 dependency graphs which represent the underlying
13462 meaning of language utterances. Output from the memory
13463 is also in the form of meaning graphs which have been
13464 produced by the active (inferential) memory processes
13465 which dissect, transform, extend and recombine the
13466 input graphs in ways which are dependent upon the
13467 meaning context in which they were perceived.\par
13468
13469 A memory formalism for the computer model is first
13470 developed as a basis for examining the inferential
13471 processes by which comprehension Occurs. Then, the
13472 notion of inference space is presented, and sixteen
13473 classes of conceptual inference and their
13474 implementation in the computer model are examined,
13475 emphasizing the contribution of each class to the total
13476 problem of understanding. Among the sixteen inference
13477 classes are: causative\slash resultative inferences
13478 (those which explain and predict cause and effect
13479 relationships relative to the memory's model of the
13480 world), motivational inferences (those which infer the
13481 probable intentions of actors), enabling inferences
13482 (those which predictively fill out the circumstances
13483 which were likely to have obtained at the time of an
13484 action), action prediction inferences (those which make
13485 guesses about what a person might be expected to do in
13486 some situation), knowledge propagation inferences
13487 (those which predict what knowledge is available to a
13488 person, based on what the memory already knows or can
13489 infer he knows), normative inferences (those which
13490 assess the ``normality'' of a given piece of
13491 information), and state duration inferences (those
13492 which predict the probable duration of specific states
13493 in the world). All inferences are probabilistic, and
13494 ``backup'' is deemphasized as a programming
13495 tool.\par
13496
13497 The idea of points of contact of information structures
13498 in inference space is explored. A point of contact
13499 occurs when an inferred unit of meaning from one
13500 starting point within one utterance's meaning graph
13501 either confirms (matches) or contradicts an inferred
13502 unit of meaning from another point within the graph, or
13503 from within the graph of another utterance. The
13504 quantity and quality of points of contact serve as the
13505 primary definition of understanding, since such points
13506 provide an effective measure of the memory's ability to
13507 relate and fill in information.\par
13508
13509 Interactions between the inference processes and (1)
13510 word sense promotion (how meaning context influences
13511 the language analyzer's choice of lexical senses of
13512 words during the parse), and (2) the processes of
13513 reference (how memory pointers to tokens of real world
13514 entities are established) are examined. In particular,
13515 an important inference-reference ``relaxation cycle''
13516 is identified and solved.\par
13517
13518 The theory forms a basis for a computationally
13519 effective and comprehensive theory of language
13520 understanding by conceptual inference. Numerous
13521 computer examples are included to illustrate key
13522 points. Most issues are approached from both
13523 psychological and computational points of view, and the
13524 thesis is intended to be comprehensible to people with
13525 a limited background in computers and symbolic
13526 computation.",
13527 acknowledgement = ack-nhfb,
13528 pdfpages = "420",
13529 remark = "This is the author's thesis.",
13530 }
13531
13532 @TechReport{Wakerly:1973:PSC,
13533 author = "John F. Wakerly",
13534 title = "Partially self-checking ciruits and their use in
13535 performing logical operations",
13536 type = "Technical Report",
13537 number = "STAN-CS-74-420 (CSL-TR-50, PB232543/AS)",
13538 institution = inst-STAN-CS,
13539 address = inst-STAN-CS:adr,
13540 pages = "??",
13541 month = aug,
13542 year = "1973",
13543 bibdate = "Fri Nov 7 07:00:05 MST 2025",
13544 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
13545 URL = "http://i.stanford.edu/TR/CS-TR-74-420.html",
13546 abstract = "A new class of circuits called partially self-checking
13547 circuits is described. These circuits have one mode of
13548 operation called secure mode in which they have the
13549 properties of totally self-checking circuits; that is,
13550 every fault is tested during normal operation and no
13551 fault can cause an undetected error. They also have an
13552 insecure mode of operation with the property that any
13553 fault which affects a result in insecure mode is tested
13554 by some input in secure mode; however, undetected
13555 errors may occur in insecure mode. One application of
13556 these circuits is in the arithmetic and logic unit of a
13557 computer with data encoded in an error-detecting code.
13558 While there is no code simpler than duplication which
13559 detects single errors in logical operations such as AND
13560 and OR, it is shown that there exist partially
13561 self-checking networks to perform these operations. A
13562 commercially available MSI chip, the 74181 4-bit ALU,
13563 can be used in a partially self-checking network to
13564 perform arithmetic and logical operations.",
13565 acknowledgement = ack-nhfb,
13566 pdfpages = "56",
13567 xxnumber = "CS-TR-74-420",
13568 }
13569
13570 @TechReport{Wakerly:1974:LCE,
13571 author = "John Wakerly",
13572 title = "Low-Cost Error Detection Techniques for Small
13573 Computers",
13574 type = "Technical Report",
13575 number = "STAN-CS-74-421 (CSL-TR-51, PB232356/AS)",
13576 institution = inst-STAN-CS,
13577 address = inst-STAN-CS:adr,
13578 pages = "232",
13579 month = may,
13580 year = "1974",
13581 bibdate = "Fri Nov 21 14:21:14 2025",
13582 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
13583 URL = "",
13584 acknowledgement = ack-nhfb,
13585 remark = "No PDF in NTRL archive.",
13586 remark = "This is the author's thesis",
13587 }
13588
13589 @TechReport{Stone:1974:PTD,
13590 author = "Harold Stone",
13591 title = "Parallel Tri-Diagonal Equation Solvers",
13592 type = "Technical Report",
13593 number = "STAN-CS-74-422 (CSL-TR-79, NASA-TM-62,370)",
13594 institution = inst-STAN-CS,
13595 address = inst-STAN-CS:adr,
13596 pages = "42",
13597 month = may,
13598 year = "1974",
13599 bibdate = "Fri Nov 21 14:21:14 2025",
13600 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
13601 URL = "",
13602 acknowledgement = ack-nhfb,
13603 }
13604
13605 @TechReport{Rao:1974:ARA,
13606 author = "Gururaj S. Rao",
13607 title = "Asymptotic representation of the average number of
13608 active modules in an $n$-way interleaved memory",
13609 type = "Technical Report",
13610 number = "STAN-CS-74-423 (CSL-TN-41, PB232860/AS)",
13611 institution = inst-STAN-CS,
13612 address = inst-STAN-CS:adr,
13613 pages = "??",
13614 month = apr,
13615 year = "1974",
13616 bibdate = "Fri Nov 7 07:00:05 MST 2025",
13617 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
13618 URL = "http://i.stanford.edu/TR/CS-TR-74-423.html",
13619 abstract = "In an $n$-way interleaved memory the effective
13620 bandwidth depends on the average number of concurrently
13621 active modules. Using a model for the memory which does
13622 not permit queueing on busy modules and which assumes
13623 an infinite stream of calls on the modules, where the
13624 elements in the stream occur with equal probability,
13625 the average number is a combinatorial quantity.
13626 Hellerman has previously approximated this quantity by
13627 $ n^{0.56} $. We show in this paper that the average
13628 number is asymptotically equal to $ \sqrt {\frac {\pi
13629 n}{2}} - \frac {1}{3} $. The method is due to Knuth and
13630 expresses the combinatorial quantity in terms of the
13631 incomplete gamma function and its derivatives.",
13632 acknowledgement = ack-nhfb,
13633 pdfpages = "15",
13634 xxnumber = "CS-TR-74-423",
13635 }
13636
13637 @TechReport{Schlumberger:1974:LCN,
13638 author = "Maurice Schlumberger",
13639 title = "Logarithmic Communications Networks",
13640 type = "Technical Report",
13641 number = "STAN-CS-74-424 (CSL-TR-80, PB232602/AS)",
13642 institution = inst-STAN-CS,
13643 address = inst-STAN-CS:adr,
13644 pages = "38",
13645 month = may,
13646 year = "1974",
13647 bibdate = "Fri Nov 21 14:21:14 2025",
13648 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
13649 URL = "",
13650 acknowledgement = ack-nhfb,
13651 remark = "This is the author's thesis (Chapter 1).",
13652 }
13653
13654 @TechReport{Schlumberger:1974:VBC,
13655 author = "Maurice Schlumberger",
13656 title = "Vulnerability of {de Bruijn} Communications Networks",
13657 type = "Technical Report",
13658 number = "STAN-CS-74-425 (CSL-TR-81, PB232598/AS)",
13659 institution = inst-STAN-CS,
13660 address = inst-STAN-CS:adr,
13661 pages = "iii + 65",
13662 month = apr,
13663 year = "1974",
13664 bibdate = "Fri Nov 21 14:21:14 2025",
13665 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
13666 URL = "",
13667 acknowledgement = ack-nhfb,
13668 pdfpages = "68",
13669 remark = "This is the author's thesis (Chapter 2). No abstract
13670 is available.",
13671 }
13672
13673 @TechReport{Schlumberger:1974:QEL,
13674 author = "Maurice Schlumberger",
13675 title = "Queueing Equal Length Messages in a Logarithmic
13676 Network",
13677 type = "Technical Report",
13678 number = "STAN-CS-74-426 (CSL-TR-82, PB232597)",
13679 institution = inst-STAN-CS,
13680 address = inst-STAN-CS:adr,
13681 pages = "75",
13682 month = may,
13683 year = "1974",
13684 bibdate = "Fri Nov 21 14:21:14 2025",
13685 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
13686 URL = "",
13687 acknowledgement = ack-nhfb,
13688 remark = "This is the author's thesis (Chapter 3). No PDF in
13689 NTRL archive.",
13690 }
13691
13692 @TechReport{Lang:1974:PPS,
13693 author = "Tomas Lang",
13694 title = "Performing the Perfect Schuffle in an Array Computer",
13695 type = "Technical Report",
13696 number = "STAN-CS-74-427 (CSL-TN-36, PB232624/AS)",
13697 institution = inst-STAN-CS,
13698 address = inst-STAN-CS:adr,
13699 pages = "18",
13700 month = may,
13701 year = "1974",
13702 bibdate = "Fri Nov 21 14:21:14 2025",
13703 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
13704 URL = "",
13705 acknowledgement = ack-nhfb,
13706 remark = "This is an excerpt from the author's thesis. No PDF in
13707 NTRL archive.",
13708 }
13709
13710 @TechReport{Lang:1974:IBP,
13711 author = "Tomas Lang",
13712 title = "Interconnections Between Processors and Memory Modules
13713 Using the Schuffle--Exchange Network",
13714 type = "Technical Report",
13715 number = "STAN-CS-74-428 (CSL-TR-76, PB232633/AS)",
13716 institution = inst-STAN-CS,
13717 address = inst-STAN-CS:adr,
13718 pages = "32",
13719 month = may,
13720 year = "1974",
13721 bibdate = "Fri Nov 21 14:21:14 2025",
13722 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
13723 URL = "",
13724 acknowledgement = ack-nhfb,
13725 remark = "This is an excerpt from the author's thesis. No PDF in
13726 NTRL archive.",
13727 }
13728
13729 @TechReport{Orcutt:1974:EDR,
13730 author = "Samuel E. Orcutt",
13731 title = "Efficient Data Routing Schemes for {ILLIAC IV}-Type
13732 Computers",
13733 type = "Technical Report",
13734 number = "STAN-CS-74-429 (CSL-TR-70, PB232623/AS)",
13735 institution = inst-STAN-CS,
13736 address = inst-STAN-CS:adr,
13737 pages = "+ 26",
13738 month = may,
13739 year = "1974",
13740 bibdate = "Fri Nov 21 14:21:14 2025",
13741 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
13742 URL = "",
13743 abstract = "Much research has recently been done on processor
13744 interconnection schemes for parallel computers, These
13745 interconnection schemes allow certain permutations to
13746 be performed in less than linear time, typically $
13747 O(\log N) $ or $ O(\sqrt {N}) $ for a vector of $N$
13748 elements and $N$ processors, In this + paper we show
13749 that many permutations can also be performed in less
13750 than linear time on a machine with an ILLIAC IV-type
13751 interconnection scheme, that is connections to
13752 processors at distances of $ \pm 1$ and $ \pm \sqrt
13753 {N}$. These results show that recently developed
13754 interconnection schemes yield less speedup over the
13755 ILLIAC IV-type interconnections than was thought, These
13756 results are of current interest due to the present
13757 ILLIAC IV programming effort.",
13758 acknowledgement = ack-nhfb,
13759 pdfpages = "46",
13760 remark = "This is an excerpt from the author's thesis.",
13761 }
13762
13763 @TechReport{Orcutt:1974:NPC,
13764 author = "Samuel E. Orcutt",
13765 title = "A Novel Parallel Computer Architecture and Some
13766 Applications",
13767 type = "Technical Report",
13768 number = "STAN-CS-74-430 (CSL-TR-71, PB234513/AS)",
13769 institution = inst-STAN-CS,
13770 address = inst-STAN-CS:adr,
13771 pages = "vi + 41",
13772 month = may,
13773 year = "1974",
13774 bibdate = "Fri Nov 21 14:21:14 2025",
13775 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
13776 URL = "",
13777 abstract = "Present day computers have been designed with
13778 processing elements and memories in a one-to-one
13779 correspondence, architecture limits the speed of
13780 solution. For many problems this In this paper a
13781 machine architecture is presented in which processing
13782 elements and memories are considered independent
13783 resources, This architecture provides a technique for
13784 increasing the logical bandwidth of the memory without
13785 increasing the physical bandwidth. The scheme for
13786 interconnecting processing elements and memories is
13787 based on the mathematical formulation of a
13788 matrix-matrix product.\par
13789
13790 Of interest in determining the usefulness of a
13791 particular computer architecture are the problem
13792 classes which it is able to solve efficiently. For this
13793 machine we consider several problems. On a serial
13794 processor the multiplication of two $ n \times n $
13795 matrices requires $ O(n^3) $ steps when using the
13796 classical algorithm or $ O(n^{\log_2 7}) $ steps when
13797 using Strassen's algorithm, We present an algorithm for
13798 our machine which performs this multiplication in $
13799 O(\log n) $ steps. This can easily be shown to be the
13800 minimum time possible.\par
13801
13802 We also consider the solution of linear triangular
13803 systems of equations. This problem requires $ O(n^2) $
13804 steps for a serial processor, and $ O(n) $ steps for a
13805 parallel processor of the ILLIAC IV-type. We present a
13806 parallel algorithm suited to execution on our machine
13807 which solves these systems in $ O(\log n) $. This
13808 algorithm is based on an extension of the principle of
13809 recursive doubling,\par
13810
13811 In addition to numerical type algorithms, we present
13812 algorithms for several combinatorial type problems, In
13813 particular, we give methods for performing permutations
13814 and sorting. These algorithms require $ O(\log n) $
13815 steps when operating on $n$ items",
13816 acknowledgement = ack-nhfb,
13817 pdfpages = "47",
13818 remark = "This is an excerpt from the author's thesis.",
13819 }
13820
13821 @TechReport{Colby:1974:PMR,
13822 author = "Kenneth Mark Colby and Roger C. Parkison and William
13823 S. Faught",
13824 title = "Pattern-matching rules for the recognition of natural
13825 language dialogue expressions",
13826 type = "Technical Report",
13827 number = "STAN-CS-74-431 (AIM-234)",
13828 institution = inst-STAN-CS,
13829 address = inst-STAN-CS:adr,
13830 pages = "23",
13831 month = jun,
13832 year = "1974",
13833 bibdate = "Fri Nov 7 07:00:05 MST 2025",
13834 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib;
13835 https://www.math.utah.edu/pub/tex/bib/string-matching.bib",
13836 URL = "http://i.stanford.edu/TR/CS-TR-74-431.html",
13837 abstract = "Man--machine dialogues using everyday conversational
13838 English present problems for computer processing of
13839 natural language. Grammar-based parsers which perform a
13840 word-by-word, parts-of-speech analysis are too fragile
13841 to operate satisfactorily in real time interviews
13842 allowing unrestricted English. In constructing a
13843 simulation of paranoid thought processes, we designed
13844 an algorithm capable of handling the linguistic
13845 expressions used by interviewers in teletyped
13846 diagnostic psychiatric interviews. The algorithm uses
13847 pattern-matching rules which attempt to characterize
13848 the input expressions by progressively transforming
13849 them into patterns which match, completely or fuzzily,
13850 abstract stored patterns. The power of this approach
13851 lies in its ability to ignore recognized and
13852 unrecognized words and still grasp the meaning of the
13853 message. The methods utilized are general and could
13854 serve any `host' system which takes natural language
13855 input.",
13856 acknowledgement = ack-nhfb,
13857 pdfpages = "25",
13858 xxnumber = "CS-TR-74-431",
13859 }
13860
13861 @TechReport{Weyhrauch:1974:FPC,
13862 author = "Richard W. Weyhrauch and Arthur J. Thomas",
13863 title = "{FOL}: a Proof Checker for First-Order Logic",
13864 type = "Technical Report",
13865 number = "STAN-CS-74-432 (AIM-235, AD-A006898)",
13866 institution = inst-STAN-CS,
13867 address = inst-STAN-CS:adr,
13868 pages = "vi + 56",
13869 month = sep,
13870 year = "1974",
13871 bibdate = "Fri Nov 21 14:21:14 2025",
13872 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
13873 URL = "",
13874 abstract = "This manual describes the use of the interactive proof
13875 checker FOL. FOL implements a version of the system of
13876 natural deduction described by Prawitz, augmented in
13877 the following ways:\par
13878
13879 (i) it is a many-sorted first-order logic and a partial
13880 order over sorts may be declared: this reduces the size
13881 of formulas;\par
13882
13883 (ii) purely propositional deductions can be made in a
13884 single step:\par
13885
13886 (iii) the truth values of assertions involving
13887 numerical and LISP constants can be derived by
13888 computation;\par
13889
13890 (iv) there is a limited ability to make
13891 metamathematical arguments, and\par
13892
13893 (v) there are many operational conveniences.\par
13894
13895 The goal of FOL is to use formal proof techniques as
13896 practical tools for checking proofs in pure mathematics
13897 and proofs of the correctness of programs. It is also
13898 intended to be used as a research tool in modelling
13899 common-sense reasoning in the representation theory of
13900 artificial intelligence.",
13901 acknowledgement = ack-nhfb,
13902 pdfpages = "63",
13903 }
13904
13905 @TechReport{Buchanan:1974:ACP,
13906 author = "Jack R. Buchanan and David C. Luckham",
13907 title = "On automating the construction of programs",
13908 type = "Technical Report",
13909 number = "STAN-CS-74-433 (AIM-236, AD784513)",
13910 institution = inst-STAN-CS,
13911 address = inst-STAN-CS:adr,
13912 pages = "65",
13913 month = may,
13914 year = "1974",
13915 bibdate = "Fri Nov 7 07:00:05 MST 2025",
13916 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
13917 URL = "http://i.stanford.edu/TR/CS-TR-74-433.html",
13918 abstract = "An experimental system for automatically generating
13919 certain simple kinds of programs is described. The
13920 programs constructed are expressed in a subset of ALGOL
13921 containing assignments, function calls, conditional
13922 statements, while loops, and non-recursive procedure
13923 calls. The input is an environment of primitive
13924 programs and programming methods specified in a
13925 language currently used to define the semantics of the
13926 output programming language. The system has been used
13927 to generate programs for symbolic manipulation, robot
13928 control, every day planning, and computing arithmetical
13929 functions.",
13930 acknowledgement = ack-nhfb,
13931 pdfpages = "72",
13932 xxnumber = "CS-TR-74-433",
13933 }
13934
13935 @TechReport{Ruhe:1974:ASN,
13936 author = "Axel Ruhe and Per {\AA}ke Wedin",
13937 title = "Algorithms for Separable Nonlinear Least Squares
13938 Problems",
13939 type = "Technical Report",
13940 number = "STAN-CS-74-434 (SU326, P30-31)",
13941 institution = inst-STAN-CS,
13942 address = inst-STAN-CS:adr,
13943 pages = "50",
13944 month = jun,
13945 year = "1974",
13946 DOI = "https://doi.org/10.1137/1022057",
13947 bibdate = "Fri Nov 21 14:21:14 2025",
13948 bibsource = "https://www.math.utah.edu/pub/bibnet/authors/r/ruhe-axel.bib;
13949 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
13950 URL = "",
13951 acknowledgement = ack-nhfb,
13952 remark = "Published in \booktitle{SIAM Review}, {\bf 22}(3)
13953 318--337, July 1980, doi:10.1137/1022057.",
13954 }
13955
13956 @TechReport{Price:1974:BCS,
13957 author = "Thomas G. Price",
13958 title = "Balanced computer systems",
13959 type = "Technical Report",
13960 number = "STAN-CS-74-435 (CSL-TR-88, A001-071, SU-SEL-74-037)",
13961 institution = inst-STAN-CS,
13962 address = inst-STAN-CS:adr,
13963 pages = "56",
13964 month = apr,
13965 year = "1974",
13966 bibdate = "Fri Nov 7 07:00:05 MST 2025",
13967 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
13968 URL = "http://i.stanford.edu/TR/CS-TR-74-435.html",
13969 abstract = "We use the central server model to extend Buzen's
13970 results on balance and bottlenecks. We develop two
13971 measures which appear to be useful for evaluating and
13972 improving computer system performance. The first
13973 measure, called the balance index, is useful for
13974 balancing requests to the peripheral processors. The
13975 second quantity, called the sensitivity index,
13976 indicates which processing rates have the most effect
13977 on overall system performance. We define the capacity
13978 of a central server model as the maximum throughput as
13979 we vary the peripheral processor probabilities. We show
13980 that the reciprocal of the CPU utilization is a convex
13981 function of the peripheral processor probabilities and
13982 that a necessary and sufficient condition for the
13983 peripheral processor probabilities to achieve capacity
13984 is that the balance indexes are equal for all
13985 peripheral processors. We give a method to calculate
13986 capacity using classical optimization techniques.
13987 Finally, we consider the problem of balancing the
13988 processing rates of the processors. Two conditions for
13989 `balance' are derived. The first condition maximizes
13990 our uncertainty about the next state of the system.
13991 This condition has several desirable properties
13992 concerning throughput, utilizations, overlap, and
13993 resistance to changes in job mix. The second condition
13994 is based on obtaining the most throughput for a given
13995 cost.",
13996 acknowledgement = ack-nhfb,
13997 pdfpages = "56",
13998 xxnumber = "CS-TR-74-435",
13999 }
14000
14001 @TechReport{Wilks:1974:NLU,
14002 author = "Yorick A. Wilks",
14003 title = "Natural language understanding systems within the {AI}
14004 paradigm: a survey and some comparisons",
14005 type = "Technical Report",
14006 number = "STAN-CS-74-436 (AIM-237, AD-A012477)",
14007 institution = inst-STAN-CS,
14008 address = inst-STAN-CS:adr,
14009 pages = "ii + 40",
14010 month = dec,
14011 year = "1974",
14012 bibdate = "Fri Nov 7 07:00:05 MST 2025",
14013 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
14014 URL = "http://i.stanford.edu/TR/CS-TR-74-436.html",
14015 abstract = "The paper surveys the major projects on the
14016 understanding of natural language that fall within what
14017 may now be called the artificial intelligence paradigm
14018 for natural language systems. Some space is devoted to
14019 arguing that the paradigm is now a reality and
14020 different in significant respects from the generative
14021 paradigm of present day linguistics. The comparisons
14022 between systems center around questions of the relative
14023 perspicuity of procedural and static representations;
14024 the advantages and disadvantages of developing systems
14025 over a period survey and some comparisons.",
14026 acknowledgement = ack-nhfb,
14027 pdfpages = "42",
14028 xxnumber = "CS-TR-74-436",
14029 }
14030
14031 @TechReport{Riesbeck:1974:CUA,
14032 author = "Christopher Kevin Riesbeck",
14033 title = "Computational Understanding: Analysis of Sentences and
14034 Context",
14035 type = "Technical Report",
14036 number = "STAN-CS-74-437 (AIM-238, AD-A005040)",
14037 institution = inst-STAN-CS,
14038 address = inst-STAN-CS:adr,
14039 pages = "vi + 242",
14040 month = may,
14041 year = "1974",
14042 bibdate = "Fri Nov 21 14:21:14 2025",
14043 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
14044 URL = "",
14045 abstract = "The goal of this thesis was to develop a system for
14046 the computer analysis of written natural language texts
14047 that could also serve as a theory of human
14048 comprehension of natural language. Therefore the
14049 construction of this system was guided by four basic
14050 assumptions about natural language comprehension.
14051 First, the primary goal of comprehension is always to
14052 find meanings as soon as possible. Other tasks, such as
14053 discovering syntactic relationships, are performed only
14054 when essential to decisions about meaning. Second, an
14055 attempt is made to understand each word as soon as it
14056 is read, to decide what it means and how it relates to
14057 the rest of the text. Third, comprehension means not
14058 only understanding what has been seen but also
14059 predicting what is likely to be seen next. Fourth, the
14060 words of a text provide the cues for finding the
14061 information necessary for comprehending that text.",
14062 acknowledgement = ack-nhfb,
14063 pdfpages = "249",
14064 remark = "This is the author's Ph.D. thesis.",
14065 }
14066
14067 @TechReport{Hanna:1974:CMA,
14068 author = "Marsha Jo Hanna",
14069 title = "Computer Matching of Areas in Stereo Images",
14070 type = "Technical Report",
14071 number = "STAN-CS-74-438 (AIM-239, AD786720)",
14072 institution = inst-STAN-CS,
14073 address = inst-STAN-CS:adr,
14074 pages = "v + 94",
14075 month = jul,
14076 year = "1974",
14077 bibdate = "Fri Nov 21 14:21:14 2025",
14078 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
14079 URL = "",
14080 abstract = "This dissertation describes techniques for efficiently
14081 matching corresponding areas of a stereo pair of
14082 images. Measures of match which are suitable for this
14083 purpose are discussed, as are methods for pruning the
14084 search for a match. The mathematics necessary to
14085 convert a set of matchings into a workable camera model
14086 are given, along with calculations which use this model
14087 and a pair of image points to locate the corresponding
14088 scene point. Methods are included to detect some types
14089 of unmatchable target areas the original data and for
14090 detecting when a supposed match is invalid. Region
14091 growing techniques are discussed for extending matching
14092 areas into regions of constant parallax and for
14093 delimiting uniform regions in an image. Also, two
14094 algorithms are presented to show some of the ways in
14095 which these techniques can be combined to perform
14096 useful tasks in the processing of stereo images.",
14097 acknowledgement = ack-nhfb,
14098 pdfpages = "104",
14099 remark = "This is the author's thesis.",
14100 }
14101
14102 @TechReport{Cottle:1974:SLS,
14103 author = "Richard W. Cottle and Gene H. Golub and Richard S.
14104 Sacher",
14105 title = "On the solution of large, structured linear
14106 complementarity problems: {III}",
14107 type = "Technical Report",
14108 number = "STAN-CS-74-439 (OR-74-7, SU326 P30-32)",
14109 institution = inst-STAN-CS,
14110 address = inst-STAN-CS:adr,
14111 pages = "87",
14112 month = aug,
14113 year = "1974",
14114 bibdate = "Fri Nov 7 07:00:05 MST 2025",
14115 bibsource = "https://www.math.utah.edu/pub/bibnet/authors/g/golub-gene-h.bib;
14116 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
14117 URL = "http://i.stanford.edu/TR/CS-TR-74-439.html",
14118 abstract = "This paper addresses the problem of solving a class of
14119 specially-structured linear complementarity problems of
14120 potentially very large size. An efficient method which
14121 couples a modification of the block successive
14122 overrelaxation technique and several techniques
14123 discussed by the authors in previous papers is
14124 proposed. Problems of the type considered arise, for
14125 example, in solving approximations to both the free
14126 boundary problem for finite-length journal bearings and
14127 percolation problems in porous dams by numerical
14128 methods. These applications and our computational
14129 experience with the method are presented here.",
14130 acknowledgement = ack-nhfb,
14131 author-dates = "Gene Howard Golub (February 29, 1932--November 16,
14132 2007)",
14133 pdfpages = "89",
14134 xxnumber = "CS-TR-74-439",
14135 }
14136
14137 @TechReport{Morris:1974:FPM,
14138 author = "Donald E. Knuth and James H. {Morris, Jr.} and Vaughn
14139 R. Pratt",
14140 title = "Fast Pattern Matching in Strings",
14141 type = "Technical Report",
14142 number = "STAN-CS-74-440 (PB237360/AS)",
14143 institution = inst-STAN-CS,
14144 address = inst-STAN-CS:adr,
14145 pages = "iii + 32",
14146 month = aug,
14147 year = "1974",
14148 DOI = "https://doi.org/10.1137/0206024",
14149 bibdate = "Fri Nov 21 14:21:14 2025",
14150 bibsource = "https://www.math.utah.edu/pub/tex/bib/fibquart.bib;
14151 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib;
14152 https://www.math.utah.edu/pub/tex/bib/string-matching.bib",
14153 URL = "",
14154 abstract = "An algorithm is presented which finds all occurrences
14155 of one given string within another, in running time
14156 proportional to the sum of the lengths of the strings.
14157 The constant of proportionality is low enough to make
14158 this algorithm of practical use, and the procedure can
14159 also be extended to deal with some more general
14160 pattern-matching problems. A theoretical application of
14161 the algorithm shows that the set of concatenations of
14162 even palindromes, i.e., the language $ \{ \alpha
14163 \alpha^R \} * $, can be recognized in linear time.",
14164 acknowledgement = ack-nhfb,
14165 keywords = "Fibonacci string; optimum algorithm; palindrome;
14166 pattern; pattern-matching; period of a string; regular
14167 expression.; searching; string; text-editing; trie
14168 memory",
14169 pdfpages = "35",
14170 remark = "Published in \booktitle{SIAM Journal on Computing},
14171 {\bf 6}(2) 323--350, June 1977, doi:10.1137/0206024.",
14172 }
14173
14174 @TechReport{Knuth:1974:AAB,
14175 author = "Donald E. Knuth and Ronald W. Moore",
14176 title = "An Analysis of Alpha--Beta Pruning",
14177 type = "Technical Report",
14178 number = "STAN-CS-74-441 (AD-A000284)",
14179 institution = inst-STAN-CS,
14180 address = inst-STAN-CS:adr,
14181 pages = "ii + 64",
14182 month = aug,
14183 year = "1974",
14184 DOI = "https://doi.org/10.1016/0004-3702(75)90019-3",
14185 bibdate = "Fri Nov 21 14:21:14 2025",
14186 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
14187 URL = "https://apps.dtic.mil/sti/citations/tr/ADA000284;
14188 https://kodu.ut.ee/~ahto/eio/2011.07.11/ab.pdf",
14189 abstract = "The alpha--beta technique for searching game trees is
14190 analyzed, in an attempt to provide some insight into
14191 its behavior. The first portion of this paper is an
14192 expository presentation of the method together with a
14193 proof of its correctness and a historical discussion.
14194 The alpha--beta procedure is shown to be optimal in a
14195 certain sense, and bounds are obtained for its running
14196 time with various kinds of random data.",
14197 acknowledgement = ack-nhfb,
14198 pdfpages = "66",
14199 remark = "Published in \booktitle{Artificial Intelligence}, {\bf
14200 6}(4) 293--326, 1975.
14201 doi:10.1016/0004-3702(75)90019-3.",
14202 }
14203
14204 @TechReport{Knuth:1974:EEB,
14205 author = "Donald E. Knuth",
14206 title = "Estimating the efficiency of backtrack programs",
14207 type = "Technical Report",
14208 number = "STAN-CS-74-442 (AD-A004208)",
14209 institution = inst-STAN-CS,
14210 address = inst-STAN-CS:adr,
14211 pages = "i + 29",
14212 month = aug,
14213 year = "1974",
14214 MRclass = "68A20 05-04 O5A15 65005 90B99",
14215 bibdate = "Fri Nov 7 07:00:05 MST 2025",
14216 bibsource = "https://www.math.utah.edu/pub/bibnet/authors/l/lehmer-derrick-henry.bib;
14217 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
14218 note = "Dedicated to Derrich H. Lehmer on his 70th birthday,
14219 February 32, 1975.",
14220 URL = "http://i.stanford.edu/TR/CS-TR-74-442.html;
14221 http://www-db.stanford.edu/TR/CS-TR-74-442.html;
14222 http://www.ncstrl.org:8900/ncstrl/servlet/search?formname=detail&id=oai%3Ancstrlh%3Astan%3ASTAN%2F%2FCS-TR-74-442",
14223 abstract = "One of the chief difficulties associated with the
14224 so-called backtracking technique for combinatorial
14225 problems has been our inability to predict the
14226 efficiency of a given algorithm, or to compare the
14227 efficiencies of different approaches, without actually
14228 writing and running the programs. This paper presents a
14229 simple method which produces reasonable estimates for
14230 most applications, requiring only a modest amount of
14231 hand calculation. The method should prove to be of
14232 considerable utility in connection with D. H. Lehmer's
14233 branch-and-bound approach to combinatorial
14234 optimization.",
14235 acknowledgement = ack-nhfb,
14236 documentid = "oai:ncstrlh:stan:STAN//CS-TR-74-442",
14237 keywords = "analysis of algorithms; backtrack; branch and bound;
14238 color cubes; Instant Insanity; knight's |tours; Monte
14239 Carlo method; tree functions",
14240 pdfpages = "34",
14241 remark = "Published in \booktitle{Mathematics of Computation},
14242 {\bf 29}(129) 121--136, January 1975.",
14243 xxnumber = "CS-TR-74-442",
14244 }
14245
14246 @TechReport{Brotz:1974:EHP,
14247 author = "Douglas K. Brotz",
14248 title = "Embedding Heuristic Problem Solving Methods in a
14249 Mechanical Theorem Prover",
14250 type = "Technical Report",
14251 number = "STAN-CS-74-443 (PB-236471/AS)",
14252 institution = inst-STAN-CS,
14253 address = inst-STAN-CS:adr,
14254 pages = "107",
14255 month = jul,
14256 year = "1974",
14257 bibdate = "Fri Nov 21 14:21:14 2025",
14258 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
14259 URL = "",
14260 acknowledgement = ack-nhfb,
14261 remark = "No PDF in NTRL archive.",
14262 }
14263
14264 @TechReport{Green:1974:PRP,
14265 author = "C. Cordell Green and Richard J. Waldinger and David R.
14266 Barstow and Robert A. Elschlager and Douglas B. Lenat
14267 and Brian P. McCune and David E. Shaw and Louis I.
14268 Steinberg",
14269 title = "Progress report on program-understanding systems",
14270 type = "Technical Report",
14271 number = "STAN-CS-74-444 (AIM-240, AD787035)",
14272 institution = inst-STAN-CS,
14273 address = inst-STAN-CS:adr,
14274 pages = "50",
14275 month = jul,
14276 year = "1974",
14277 bibdate = "Fri Nov 7 07:00:05 MST 2025",
14278 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
14279 URL = "http://i.stanford.edu/TR/CS-TR-74-444.html",
14280 abstract = "This progress report covers the first year and one
14281 half of work by our automatic-programming research
14282 group at the Stanford Artificial Intelligence
14283 Laboratory. Major emphasis has been placed on methods
14284 of program specification, codification of programming
14285 knowledge, and implementation of pilot systems for
14286 program writing and understanding. List processing has
14287 been used as the general problem domain for this
14288 work.",
14289 acknowledgement = ack-nhfb,
14290 pdfpages = "52",
14291 xxnumber = "CS-TR-74-444",
14292 }
14293
14294 @TechReport{Friedman:1974:REA,
14295 author = "J. H. Friedman and F. Baskett and L. J. Shustek",
14296 title = "A Relatively Efficient Algorithm for Finding Nearest
14297 Neighbors",
14298 type = "Technical Report",
14299 number = "STAN-CS-74-445 (SLACP-1448)",
14300 institution = inst-STAN-CS,
14301 address = inst-STAN-CS:adr,
14302 pages = "21",
14303 month = sep,
14304 year = "1974",
14305 bibdate = "Fri Nov 21 14:21:14 2025",
14306 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
14307 URL = "",
14308 acknowledgement = ack-nhfb,
14309 }
14310
14311 @TechReport{Aiello:1974:LIL,
14312 author = "Luigia Aiello and Richard W. Weyhrauch",
14313 title = "{LCFsmall}: an implementation of {LCF}",
14314 type = "Technical Report",
14315 number = "STAN-CS-74-446 (AIM-241, AD786723)",
14316 institution = inst-STAN-CS,
14317 address = inst-STAN-CS:adr,
14318 pages = "iv + 45",
14319 month = aug,
14320 year = "1974",
14321 bibdate = "Fri Nov 7 07:00:05 MST 2025",
14322 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
14323 URL = "http://i.stanford.edu/TR/CS-TR-74-446.html",
14324 abstract = "This is a report on a computer program implementing a
14325 simplified version of LCF. It is written (with minor
14326 exceptions) entirely in pure LISP and has none of the
14327 user oriented features of the implementation described
14328 by Milner. We attempt to represent directly in code the
14329 metamathematical notions necessary to describe LCF. We
14330 hope that the code is simple enough and the
14331 metamathematics is clear enough so that properties of
14332 this particular program (e.g. its correctness) can
14333 eventually be proved. The program is reproduced in
14334 full.",
14335 acknowledgement = ack-nhfb,
14336 pdfpages = "49",
14337 xxnumber = "CS-TR-74-446",
14338 }
14339
14340 @TechReport{Aiello:1974:SPL,
14341 author = "Luigia Aiello and Mario Aiello and Richard W.
14342 Weyhrauch",
14343 title = "The semantics of {PASCAL} in {LCF}",
14344 type = "Technical Report",
14345 number = "STAN-CS-74-447 (AIM-221, AD787631)",
14346 institution = inst-STAN-CS,
14347 address = inst-STAN-CS:adr,
14348 pages = "??",
14349 month = aug,
14350 year = "1974",
14351 bibdate = "Fri Nov 7 07:00:05 MST 2025",
14352 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
14353 URL = "http://i.stanford.edu/TR/CS-TR-74-447.html",
14354 abstract = "We define a semantics for the arithmetic part of
14355 PASCAL by giving it an interpretation in LCF, a
14356 language based on the typed $ \lambda $-calculus.
14357 Programs are represented in terms of their abstract
14358 syntax. We show sample proofs, using LCF, of some
14359 general properties of PASCAL and the correctness of
14360 some particular programs. A program implementing the
14361 McCarthy Airline reservation system is proved
14362 correct.",
14363 acknowledgement = ack-nhfb,
14364 pdfpages = "82",
14365 xxnumber = "CS-TR-74-447",
14366 }
14367
14368 @TechReport{Goldfarb:1974:MFO,
14369 author = "D. Goldfarb",
14370 title = "Matrix Factorizations in Optimization of Nonlinear
14371 Functions Subject to Linear Constraints",
14372 type = "Technical Report",
14373 number = "STAN-CS-74-448 (SU326, P30-33)",
14374 institution = inst-STAN-CS,
14375 address = inst-STAN-CS:adr,
14376 pages = "45",
14377 month = sep,
14378 year = "1974",
14379 bibdate = "Fri Nov 21 14:21:14 2025",
14380 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
14381 URL = "",
14382 acknowledgement = ack-nhfb,
14383 remark = "No PDF in NTRL archive.",
14384 }
14385
14386 @TechReport{Smith:1974:PAC,
14387 author = "Alan Jay Smith",
14388 title = "Performance Analysis of Computer Systems Components",
14389 type = "Technical Report",
14390 number = "STAN-CS-74-449 (CSL-TR-89, AD785027)",
14391 institution = inst-STAN-CS,
14392 address = inst-STAN-CS:adr,
14393 pages = "323",
14394 month = sep,
14395 year = "1974",
14396 bibdate = "Fri Nov 21 14:21:14 2025",
14397 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
14398 URL = "https://apps.dtic.mil/sti/html/tr/AD0785027/index.html",
14399 abstract = "A number of aspects of computer system organization
14400 and operation are considered. Mathematical analysis,
14401 simulation and trace driven simulation are all used to
14402 obtain and verify models and\slash or algorithms. Each
14403 of the topics in this dissertation are discussed in
14404 further detail.",
14405 acknowledgement = ack-nhfb,
14406 pdfpages = "325",
14407 remark = "This is the author's thesis. No PDF in DTIC or NTRL
14408 archives.",
14409 }
14410
14411 @TechReport{Baskett:1974:IMC,
14412 author = "Forest Baskett and Alan Jay Smith",
14413 title = "Interference in Multiprocessor Computer Systems with
14414 Interleaved Memory",
14415 type = "Technical Report",
14416 number = "STAN-CS-74-450 (CSL-TR-90, AD787008)",
14417 institution = inst-STAN-CS,
14418 address = inst-STAN-CS:adr,
14419 pages = "iii + 41",
14420 month = aug,
14421 year = "1974",
14422 bibdate = "Fri Nov 21 14:21:14 2025",
14423 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
14424 URL = "",
14425 abstract = "We analyze the memory interference caused by several
14426 processors simultaneously using several memory modules.
14427 We compute exact results for a simple model of such a
14428 system. We derive the limiting value for the relative
14429 degree of memory interference as the system size
14430 increases. The model of the limiting behavior of the
14431 system yields approximate results for the simple model
14432 and also suggests that the results are valid for a much
14433 larger class of models including those more nearly like
14434 real systems than the simple model. We test the
14435 assumptions and results of the simple model against
14436 some measurements of program behavior and simulations
14437 of systems using memory references from real programs.
14438 The model results provide a very good indication of the
14439 performance we should expect from real systems of this
14440 type",
14441 acknowledgement = ack-nhfb,
14442 pdfpages = "44",
14443 remark = "This is Chapter 3 of the author's thesis.",
14444 }
14445
14446 @TechReport{Smith:1974:MWS,
14447 author = "Alan Jay Smith",
14448 title = "A Modified Working Set Paging Algorithm",
14449 type = "Technical Report",
14450 number = "STAN-CS-74-451 (CSL-TR-91, AD786999)",
14451 institution = inst-STAN-CS,
14452 address = inst-STAN-CS:adr,
14453 pages = "43",
14454 month = jul,
14455 year = "1974",
14456 bibdate = "Fri Nov 21 14:21:14 2025",
14457 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
14458 URL = "",
14459 abstract = "The working set paging algorithm is known to be highly
14460 efficient, yet has the disadvantage that during changes
14461 of locality large numbers of pages are accumulated in
14462 memory unnecessarily. The author proposes a
14463 modification of the working set algorithm called the
14464 Damped Working Set algorithm which resists sudden
14465 expansion of working set size and exhibits far greater
14466 stability in the number of page frames allocated to an
14467 active process. Program address traces are analyzed to
14468 determine the effectiveness of the Damped Working Set
14469 algorithm.",
14470 acknowledgement = ack-nhfb,
14471 remark = "This is Chapter 5 of the author's thesis. No PDF in
14472 DTIC or NTRL archives.",
14473 xxmonth = oct,
14474 }
14475
14476 @TechReport{Low:1974:ACC,
14477 author = "James Richard Low",
14478 title = "Automatic Coding: Choice of Data Structures",
14479 type = "Technical Report",
14480 number = "STAN-CS-74-452 (AIM-242, AD-A000-500)",
14481 institution = inst-STAN-CS,
14482 address = inst-STAN-CS:adr,
14483 pages = "v + 103",
14484 month = aug,
14485 year = "1974",
14486 bibdate = "Fri Nov 21 14:21:14 2025",
14487 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
14488 URL = "https://apps.dtic.mil/sti/tr/pdf/ADA000500.pdf",
14489 abstract = "A system is described which automatically chooses
14490 representations for high-level information structures
14491 such as sets, sequences, and relations for a given
14492 computer program, Representations are picked from a
14493 fixed library of low-level data structures including
14494 linked-lists, binary trees and hash tables. The
14495 representations are chosen by attempting to minimize
14496 the predicted space--time integral of the user's
14497 program execution. Predictions are based upon
14498 statistics of information structure use provided
14499 directly by the user and collected by monitoring
14500 executions of the user program using default
14501 representations for the high-level structures. A
14502 demonstration system has been constructed. Results
14503 using that system are presented.",
14504 acknowledgement = ack-nhfb,
14505 advisor = "Jerry Feldman",
14506 pdfpages = "111",
14507 remark = "This is the author's Ph.D. thesis.",
14508 }
14509
14510 @TechReport{Knuth:1974:RM,
14511 author = "Donald E. Knuth",
14512 title = "Random Matroids",
14513 type = "Technical Report",
14514 number = "STAN-CS-74-453 (AD-A000034)",
14515 institution = inst-STAN-CS,
14516 address = inst-STAN-CS:adr,
14517 pages = "30",
14518 month = sep,
14519 year = "1974",
14520 DOI = "https://doi.org/10.1016/0012-365X(75)90075-8",
14521 bibdate = "Fri Nov 21 14:21:14 2025",
14522 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
14523 URL = "https://apps.dtic.mil/sti/html/tr/ADA000084/",
14524 abstract = "A simple combinatorial construction capable of
14525 producing an arbitrary matroid is introduced, and some
14526 of its properties are investigated. The structure of a
14527 matroid is defined one rank at a time, and when random
14528 choices are made the result might be called a random
14529 matroid. Some experimental statistics about such
14530 matroids are tabulated. If the subsets of rank $ \leq k
14531 $ are specified, the construction defines a rank
14532 function having the richest possible matroid structure
14533 on the remaining subsets, in the sense that no new
14534 relationships are introduced except those implied by
14535 the given subsets of rank $ \leq k $. An appendix to
14536 this paper presents several computer programs for
14537 dealing with matroids over small sets.",
14538 acknowledgement = ack-nhfb,
14539 remark = "No PDF in NTRL archive. Published in
14540 \booktitle{Discrete Mathematics}, {\bf 12}(4) 341--358,
14541 1975. doi:10.1016/0012-365X(75)90075-8.",
14542 }
14543
14544 @TechReport{Jennings:1974:CAS,
14545 author = "L. S. Jennings",
14546 title = "A Computational Approach to Simultaneous Estimation",
14547 type = "Technical Report",
14548 number = "STAN-CS-74-454 (SU326, P30-35)",
14549 institution = inst-STAN-CS,
14550 address = inst-STAN-CS:adr,
14551 pages = "15",
14552 month = sep,
14553 year = "1974",
14554 bibdate = "Fri Nov 21 14:21:14 2025",
14555 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
14556 URL = "",
14557 acknowledgement = ack-nhfb,
14558 remark = "No PDF in DTIC or NTRL archives.",
14559 }
14560
14561 @TechReport{Tarjan:1974:EDS,
14562 author = "Robert Endre Tarjan",
14563 title = "Edge-disjoint spanning trees, dominators, and
14564 depth-first search",
14565 type = "Technical Report",
14566 number = "STAN-CS-74-455 (AD-A000083)",
14567 institution = inst-STAN-CS,
14568 address = inst-STAN-CS:adr,
14569 pages = "40",
14570 month = sep,
14571 year = "1974",
14572 bibdate = "Fri Nov 7 07:00:05 MST 2025",
14573 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
14574 URL = "http://i.stanford.edu/TR/CS-TR-74-455.html",
14575 abstract = "This paper presents an algorithm for finding two
14576 edge-disjoint spanning trees rooted at a fixed vertex
14577 of a directed graph. The algorithm uses depth-first
14578 search, an efficient method for computing disjoint set
14579 unions, and an efficient method for computing
14580 dominators. It requires $ O(V \log V + E) $ time and $
14581 O(V + E) $ space to analyze a graph with $V$ vertices
14582 and $E$ edges.",
14583 acknowledgement = ack-nhfb,
14584 pdfpages = "42",
14585 xxnumber = "CS-TR-74-455",
14586 }
14587
14588 @TechReport{Finkel:1974:APS,
14589 author = "Raphael A. Finkel and Russell H. Taylor and Robert C.
14590 Bolles and Richard P. Paul and Jerome A. Feldman",
14591 title = "{AL}, a programming system for automation",
14592 type = "Technical Report",
14593 number = "STAN-CS-74-456 (AIM-243, AD-A003815)",
14594 institution = inst-STAN-CS,
14595 address = inst-STAN-CS:adr,
14596 pages = "??",
14597 month = nov,
14598 year = "1974",
14599 bibdate = "Fri Nov 7 07:00:05 MST 2025",
14600 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
14601 URL = "http://i.stanford.edu/TR/CS-TR-74-456.html",
14602 abstract = "AL is a high-level programming system for
14603 specification of manipulatory tasks such as assembly of
14604 an object from parts. AL includes an ALGOL-like source
14605 language, a translator for converting programs into
14606 runnable code, and a runtime system for controlling
14607 manipulators and other devices. The system includes
14608 advanced features for describing individual motions of
14609 manipulators, for using sensory information, and for
14610 describing assembly algorithms in terms of common
14611 domain-specific primitives. This document describes the
14612 design of AL, which is currently being implemented as a
14613 successor to the Stanford WAVE system.",
14614 acknowledgement = ack-nhfb,
14615 pdfpages = "139",
14616 xxnumber = "CS-TR-74-456",
14617 }
14618
14619 @TechReport{Colby:1974:TCP,
14620 author = "Kenneth Mark Colby",
14621 title = "Ten criticisms of {PARRY}",
14622 type = "Technical Report",
14623 number = "STAN-CS-74-457 (AIM-244)",
14624 institution = inst-STAN-CS,
14625 address = inst-STAN-CS:adr,
14626 pages = "??",
14627 month = sep,
14628 year = "1974",
14629 bibdate = "Fri Nov 7 07:00:05 MST 2025",
14630 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
14631 URL = "http://i.stanford.edu/TR/CS-TR-74-457.html",
14632 abstract = "Some major criticisms of a computer simulation of
14633 paranoid processes (PARRY) are reviewed and
14634 discussed.",
14635 acknowledgement = ack-nhfb,
14636 pdfpages = "9",
14637 xxnumber = "CS-TR-74-457",
14638 }
14639
14640 @TechReport{Buchanan:1974:SAP,
14641 author = "Jack R. Buchanan",
14642 title = "A Study in Automatic Programming",
14643 type = "Technical Report",
14644 number = "STAN-CS-74-458 (AIM-245, AD784816)",
14645 institution = inst-STAN-CS,
14646 address = inst-STAN-CS:adr,
14647 pages = "vii + 148",
14648 month = may,
14649 year = "1974",
14650 bibdate = "Fri Nov 21 14:21:14 2025",
14651 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
14652 URL = "",
14653 abstract = "A description of methods and an implementation of a
14654 system for automatic generation of programs is given.
14655 The problems of writing programs for numerical
14656 computation, symbol manipulation, robot control and
14657 everyday planning have been studied and some programs
14658 generated. A particular formalism, i.e. a FRAME, has
14659 been developed to define the programming environment
14660 and permit the statement of a problem. A frame, F, is
14661 formulated within the Logic of Programs [Hoare 1969,
14662 Hoare and Wirth 1972] and includes primitive functions
14663 and procedures, axioms, definitions and rules of
14664 program composition. Given a frame, F, a problem for
14665 program construction may be stated as a pair $ < I, G >
14666 $ where $I$ is an input assertion and $G$ is an output
14667 assertion. The program generation task is to construct
14668 a program $A$ such that $ I \{ A \} I'$, where $ I`
14669 \supset G$. This process may be viewed as a search in
14670 the Logic of Programs for a proof that the generated
14671 program satisfies the given input-output assertions.
14672 Correctness of programs generated using the formal
14673 algorithm is discussed.\par
14674
14675 A frame is translated into a backtrack problem solver
14676 augmented by special search procedures. The system is
14677 interactive, responds to simple advice and allows
14678 incremental and structured program development.\par
14679
14680 The output solution program is a subset of ALGOL
14681 containing procedure calls, assignments, while loops
14682 and conditional statements.",
14683 acknowledgement = ack-nhfb,
14684 pdfpages = "157",
14685 remark = "This is the author's thesis.",
14686 }
14687
14688 @TechReport{Winograd:1974:FLA,
14689 author = "Terry A. Winograd",
14690 title = "Five Lectures on Artificial Intelligence",
14691 type = "Technical Report",
14692 number = "STAN-CS-74-459 (AIM-246, AD-A000085)",
14693 institution = inst-STAN-CS,
14694 address = inst-STAN-CS:adr,
14695 pages = "viii + 95",
14696 month = sep,
14697 year = "1974",
14698 bibdate = "Fri Nov 21 14:21:14 2025",
14699 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
14700 URL = "",
14701 abstract = "This publication is a slightly edited transcription of
14702 five lectures delivered at the Electrotechnical
14703 Laboratory in Tokyo, Japan from March 18 to March 23,
14704 1974. They were intended as an introduction to current
14705 research problems in Artificial Intelligence,
14706 particularly in the area of natural language
14707 understanding. They are exploratory in nature,
14708 concentrating on open problems and directions for
14709 future work. The five lectures include: A survey of
14710 past work in natural language understanding; A
14711 description of the SHRDLU system; A comparison of
14712 representations used in AI programs; A rough sketch of
14713 some ideas for a new representation which combines
14714 features of the previous ones; A discussion of the
14715 applications of these ideas to programming systems.",
14716 acknowledgement = ack-nhfb,
14717 pdfpages = "102",
14718 }
14719
14720 @TechReport{Porter:1974:RIP,
14721 author = "Thomas Porter and Istvan Simon",
14722 title = "Random insertion into a priority queue structure",
14723 type = "Technical Report",
14724 number = "STAN-CS-74-460 (PB238148/AS)",
14725 institution = inst-STAN-CS,
14726 address = inst-STAN-CS:adr,
14727 pages = "25",
14728 month = oct,
14729 year = "1974",
14730 bibdate = "Fri Nov 7 07:00:05 MST 2025",
14731 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
14732 URL = "http://i.stanford.edu/TR/CS-TR-74-460.html",
14733 abstract = "The average number of levels that a new element moves
14734 up when inserted into a heap is investigated. Two
14735 probabilistic models, under which such an average might
14736 be computed are proposed. A `lemma of conservation of
14737 ignorance' is formulated and used in the derivation of
14738 an exact formula for the average in one of these
14739 models. It is shown that this average is bounded by a
14740 constant and its asymptotic behavior is discussed.
14741 Numerical data for the second model is also provided
14742 and analyzed.",
14743 acknowledgement = ack-nhfb,
14744 pdfpages = "28",
14745 xxnumber = "CS-TR-74-460",
14746 }
14747
14748 @TechReport{Goldman:1974:CGN,
14749 author = "Neil Murray Goldman",
14750 title = "Computer Generation of Natural Language from a Deep
14751 Conceptual Base",
14752 type = "Technical Report",
14753 number = "STAN-CS-74-461 (AIM-247, AD-A005041)",
14754 institution = inst-STAN-CS,
14755 address = inst-STAN-CS:adr,
14756 pages = "ix + 309",
14757 month = jan,
14758 year = "1974",
14759 bibdate = "Fri Nov 21 14:21:14 2025",
14760 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
14761 URL = "https://apps.dtic.mil/sti/tr/pdf/ADA005041.pdf",
14762 abstract = "For many tasks involving communication between humans
14763 and computers, it is necessary for the machine to
14764 produce as well as understand natural language. We
14765 describe an implemented system which generates English
14766 sentences from conceptual dependency networks, which
14767 are unambiguous, language-free representations of
14768 meaning. The system is designed to be task independent
14769 and thus capable of providing the language generation
14770 mechanism for such diverse problem areas as question
14771 answering, machine translation, and interviewing.",
14772 acknowledgement = ack-nhfb,
14773 pdfpages = "321",
14774 remark = "This is the author's Ph.D. thesis, dated January
14775 1974.",
14776 }
14777
14778 @TechReport{Baumgart:1974:GMC,
14779 author = "Bruce Guenther Baumgart",
14780 title = "Geometric Modeling for Computer Vision",
14781 type = "Technical Report",
14782 number = "STAN-CS-74-463 (AIM-249, AD-A002261)",
14783 institution = inst-STAN-CS,
14784 address = inst-STAN-CS:adr,
14785 pages = "v + 136",
14786 month = oct,
14787 year = "1974",
14788 bibdate = "Fri Nov 21 14:21:14 2025",
14789 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
14790 URL = "",
14791 abstract = "The main contribution of this thesis is the
14792 development of a three dimensional geometric modeling
14793 system for application to computer vision. In computer
14794 vision geometric models provide a goal for descriptive
14795 image analysis, an origin for verification image
14796 synthesis, and a context for spatial problem solving.
14797 Some of the design ideas presented have been
14798 implemented in two programs named GEOMED and CRE; the
14799 programs are demonstrated in situations involving
14800 camera motion relative to a static world.",
14801 acknowledgement = ack-nhfb,
14802 advisor = "John McCarthy",
14803 pdfpages = "154",
14804 remark = "This is the author's thesis. Typography note from page
14805 v: ``The original copy of this document was produced on
14806 a Xerox Graphics Printer with a resolution of two
14807 hundred points per inch. The principal font is News
14808 Gothic Boldface, 25 units high, which originated at
14809 Carnegie Mellon University. The page layout, text
14810 justification, boxes, halftones and line drawings were
14811 done using the author's document-formatting program,
14812 XIP. The source files were prepared using the text
14813 editor, E, created by Dan Swinehart and Fred
14814 Wright.''",
14815 }
14816
14817 @TechReport{Nevatia:1974:SDC,
14818 author = "Ramakant Nevatia",
14819 title = "Structured Descriptions of Complex Curved Objects for
14820 Recognition and Visual Memory",
14821 type = "Technical Report",
14822 number = "STAN-CS-74-464 (AIM-250, AD-A003486)",
14823 institution = inst-STAN-CS,
14824 address = inst-STAN-CS:adr,
14825 pages = "v + 120",
14826 month = oct,
14827 year = "1974",
14828 bibdate = "Fri Nov 21 14:21:14 2025",
14829 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
14830 URL = "",
14831 abstract = "Description and recognition of three-dimensional
14832 objects from range data obtained by a laser
14833 triangulation technique are described. A complex object
14834 is described by decomposition into sub-parts and
14835 relations of these sub-parts. The individual parts are
14836 described by generalized cones, which are defined by a
14837 space curve known as the axis, and arbitrary shaped
14838 normal cross-sections along this axis.\par
14839
14840 Techniques for segmenting an object into sup-parts and
14841 generating structured, symbolic, graph like
14842 descriptions are described. These symbolic descriptions
14843 are matched with stored descriptions and the best match
14844 is picked for recognition. A limited amount of indexing
14845 capability exists to efficiently retrieve a sub-class
14846 of similar objects from the models stored in the
14847 memory. Indexing is a necessity if a large number of
14848 visual models is to be used.\par
14849
14850 Results of working programs for the stated tasks oh
14851 many actual scenes are presented. The scenes consist of
14852 single a3 well as multiple object",
14853 acknowledgement = ack-nhfb,
14854 advisor = "Thomas O. Binford",
14855 pdfpages = "128",
14856 remark = "This is the author's thesis.",
14857 }
14858
14859 @TechReport{Shortliffe:1974:MRB,
14860 author = "E. H. Shortliffe",
14861 title = "{MYCIN}: a Rule-Based Computer Program for Advising
14862 Physicians Regarding Antimicrobial Therapy Selection",
14863 type = "Technical Report",
14864 number = "STAN-CS-74-465 (AIM-251, AD-A001373)",
14865 institution = inst-STAN-CS,
14866 address = inst-STAN-CS:adr,
14867 pages = "409",
14868 month = nov,
14869 year = "1974",
14870 bibdate = "Fri Nov 21 14:21:14 2025",
14871 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
14872 URL = "",
14873 acknowledgement = ack-nhfb,
14874 remark = "This is the author's thesis.",
14875 }
14876
14877 @TechReport{Earnest:1974:RRA,
14878 author = "Lester D. Earnest and John McCarthy and Edward A.
14879 Feigenbaum and Joshua Lederberg and Vinton G. Cerf",
14880 title = "Recent research in artificial intelligence, heuristic
14881 programming, and network protocols",
14882 type = "Technical Report",
14883 number = "STAN-CS-74-466 (AIM-252, AD-A002246)",
14884 institution = inst-STAN-CS,
14885 address = inst-STAN-CS:adr,
14886 pages = "79",
14887 month = jul,
14888 year = "1974",
14889 bibdate = "Fri Nov 7 07:00:05 MST 2025",
14890 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
14891 URL = "http://i.stanford.edu/TR/CS-TR-74-466.html",
14892 abstract = "This is a progress report for ARPA-sponsored research
14893 projects in computer science for the period July 1973
14894 to July 1974. Accomplishments are reported in
14895 artificial intelligence (especially heuristic
14896 programming, robotics, theorem proving, automatic
14897 programming, and natural language understanding),
14898 mathematical theory of computation, and protocol
14899 development for computer communication networks.
14900 References to recent publications are provided for each
14901 topic.",
14902 acknowledgement = ack-nhfb,
14903 author-dates = "John McCarthy (4 September 1927--24 October 2011)",
14904 pdfpages = "80",
14905 xxnumber = "CS-TR-74-466",
14906 }
14907
14908 @TechReport{Aiello:1974:CPM,
14909 author = "Mario Aiello and Richard W. Weyhrauch",
14910 title = "Checking proofs in the metamathematics of first order
14911 logic",
14912 type = "Technical Report",
14913 number = "STAN-CS-74-467 (AIM-222, AD-A007562)",
14914 institution = inst-STAN-CS,
14915 address = inst-STAN-CS:adr,
14916 pages = "viii + 51",
14917 month = aug,
14918 year = "1974",
14919 bibdate = "Fri Nov 7 07:00:05 MST 2025",
14920 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
14921 URL = "http://i.stanford.edu/TR/CS-TR-74-467.html",
14922 abstract = "This is a report on some of the first experiments of
14923 any size carried out using the new first order proof
14924 checker FOL. We present two different first order
14925 axiomatizations of the metamathematics of the logic
14926 which FOL itself checks and show several proofs using
14927 each one. The difference between the axiomatizations is
14928 that one defines the metamathematics in a many sorted
14929 logic, the other does not.",
14930 acknowledgement = ack-nhfb,
14931 pdfpages = "59",
14932 xxnumber = "CS-TR-74-467",
14933 }
14934
14935 @TechReport{Krogdahl:1974:CBS,
14936 author = "Stein Krogdahl",
14937 title = "A combinatorial base for some optimal matroid
14938 intersection algorithms",
14939 type = "Technical Report",
14940 number = "STAN-CS-74-468 (AD-A003832)",
14941 institution = inst-STAN-CS,
14942 address = inst-STAN-CS:adr,
14943 pages = "55",
14944 month = nov,
14945 year = "1974",
14946 bibdate = "Fri Nov 7 07:00:05 MST 2025",
14947 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
14948 URL = "http://i.stanford.edu/TR/CS-TR-74-468.html",
14949 abstract = "E. Lawler has given an algorithm for finding maximum
14950 weight intersections for a pair of matroids, using
14951 linear programming concepts and constructions to prove
14952 its correctness. In this paper another theoretical base
14953 for this algorithm is given which depends only on the
14954 basic properties of matroids, and which involves no
14955 linear programming concepts.",
14956 acknowledgement = ack-nhfb,
14957 pdfpages = "30",
14958 xxnumber = "CS-TR-74-468",
14959 }
14960
14961 @TechReport{Brown:1974:MSE,
14962 author = "Harold Brown",
14963 title = "Molecular structure elucidation {III}",
14964 type = "Technical Report",
14965 number = "STAN-CS-74-469",
14966 institution = inst-STAN-CS,
14967 address = inst-STAN-CS:adr,
14968 pages = "38",
14969 month = dec,
14970 year = "1974",
14971 bibdate = "Fri Nov 7 07:00:05 MST 2025",
14972 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
14973 URL = "http://i.stanford.edu/TR/CS-TR-74-469.html",
14974 abstract = "A computer implemented algorithm to solve the
14975 following graph theoretical problem is presented: given
14976 the empirical formula for a molecule and one or more
14977 non-overlapping substructural fragments of the
14978 molecule, determine all the distinct molecular
14979 structures based on the formula and containing the
14980 fragments. That is, given a degree sequence of labeled
14981 nodes and one or more connected multigraphs, determine
14982 a representative set of the isomorphism classes of the
14983 connected multigraphs based on the degree sequence and
14984 containing the given multi-graphs as non-overlapping
14985 subgraphs.",
14986 acknowledgement = ack-nhfb,
14987 pdfpages = "39",
14988 xxnumber = "CS-TR-74-469",
14989 }
14990
14991 @TechReport{TrabbPardo:1974:SSM,
14992 author = "Luis {Trabb Pardo}",
14993 title = "Stable sorting and merging with optimal space and time
14994 bounds",
14995 type = "Technical Report",
14996 number = "STAN-CS-74-470",
14997 institution = inst-STAN-CS,
14998 address = inst-STAN-CS:adr,
14999 pages = "iv + 74",
15000 month = dec,
15001 year = "1974",
15002 bibdate = "Fri Nov 7 07:00:05 MST 2025",
15003 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
15004 URL = "http://i.stanford.edu/pub/cstr/reports/cs/tr/74/470/CS-TR-74-470.pdf;
15005 http://i.stanford.edu/TR/CS-TR-74-470.html",
15006 abstract = "This work introduces two algorithms for stable merging
15007 and stable sorting of files.\par
15008
15009 The algorithms have optimal worst case time bounds, the
15010 merge is linear and the sort is of order $ n \log n $.
15011 Extra storage requirements are also optimal, since both
15012 algorithms make use of a fixed number of pointers.
15013 Files are handled only by means of the primitives
15014 exchange and comparison of records and basic pointer
15015 transformations.",
15016 acknowledgement = ack-nhfb,
15017 pdfpages = "78",
15018 xxnumber = "CS-TR-74-470",
15019 }
15020
15021 @TechReport{Faught:1974:IIA,
15022 author = "William S. Faught and Kenneth Mark Colby and Roger C.
15023 Parkison",
15024 title = "The interaction of inferences, affects, and
15025 intentions, in a model of paranoia",
15026 type = "Technical Report",
15027 number = "STAN-CS-74-471 (AIM-253, AD-A003487)",
15028 institution = inst-STAN-CS,
15029 address = inst-STAN-CS:adr,
15030 pages = "38",
15031 month = dec,
15032 year = "1974",
15033 bibdate = "Fri Nov 7 07:00:05 MST 2025",
15034 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
15035 URL = "http://i.stanford.edu/TR/CS-TR-74-471.html",
15036 abstract = "The analysis of natural language input into its
15037 underlying semantic content is but one of the tasks
15038 necessary for a system (human or non-human) to use
15039 natural language. Responding to natural language input
15040 requires performing a number of tasks: (1) deriving
15041 facts about the input and the situation in which it was
15042 spoken; (2) attending to the system's needs, desires,
15043 and interests; (3) choosing intentions to fulfill these
15044 interests; (4) deriving and executing actions from
15045 these intentions. We describe a series of processes in
15046 a model of paranoia which performs these tasks. We also
15047 describe the modifications made by the paranoid
15048 processes to the normal processes. A computer program
15049 has been constructed to test this theory.",
15050 acknowledgement = ack-nhfb,
15051 pdfpages = "39",
15052 xxnumber = "CS-TR-74-471",
15053 }
15054
15055 @TechReport{Quam:1974:SAP,
15056 author = "Lynn H. Quam and Marsha Jo Hannah",
15057 title = "{Stanford} automatic photogrammetry research",
15058 type = "Technical Report",
15059 number = "STAN-CS-74-472 (AIM-254, AD-A005407)",
15060 institution = inst-STAN-CS,
15061 address = inst-STAN-CS:adr,
15062 pages = "15",
15063 month = dec,
15064 year = "1974",
15065 bibdate = "Fri Nov 7 07:00:05 MST 2025",
15066 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
15067 URL = "http://i.stanford.edu/TR/CS-TR-74-472.html",
15068 abstract = "This report documents the feasibility study done at
15069 Stanford University's Artificial Intelligence
15070 Laboratory on the problem of computer automated
15071 aerial/orbital photogrammetry. The techniques
15072 investigated were based on correlation matching of
15073 small areas in digitized pairs of stereo images taken
15074 from high altitude or planetary orbit, with the
15075 objective of deriving a 3-dimensional model for the
15076 surface of a planet.",
15077 acknowledgement = ack-nhfb,
15078 pdfpages = "17",
15079 xxnumber = "CS-TR-74-472",
15080 }
15081
15082 @TechReport{Suzuki:1974:APV,
15083 author = "Norihisa Suzuki",
15084 title = "Automatic program verification {II}: verifying
15085 programs by algebraic and logical reduction",
15086 type = "Technical Report",
15087 number = "STAN-CS-74-473 (AIM-255, AD-A005412)",
15088 institution = inst-STAN-CS,
15089 address = inst-STAN-CS:adr,
15090 pages = "28",
15091 month = dec,
15092 year = "1974",
15093 bibdate = "Fri Nov 7 07:00:05 MST 2025",
15094 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
15095 URL = "http://i.stanford.edu/TR/CS-TR-74-473.html",
15096 abstract = "Methods for verifying programs written in a higher
15097 level programming language are devised and implemented.
15098 The system can verify programs written in a subset of
15099 PASCAL, which may have data structures and control
15100 structures such as WHILE, REPEAT, FOR, PROCEDURE,
15101 FUNCTION and COROUTINE. The process of creation of
15102 verification conditions is an extension of the work
15103 done by Igarashi, London and Luckham which is based on
15104 the deductive theory by Hoare. Verification conditions
15105 are proved using specialized simplification and proof
15106 techniques, which consist of an arithmetic simplifier,
15107 equality replacement rules, fast algorithm for
15108 simplifying formulas using propositional truth value
15109 evaluation, and a depth first proof search process. The
15110 basis of deduction mechanism used in this prover is
15111 Gentzen-type formal system. Several sorting programs
15112 including Floyd's TREESORT3 and Hoare's FIND are
15113 verified. It is shown that the resulting array is not
15114 only well-ordered but also a permutation of the input
15115 array.",
15116 acknowledgement = ack-nhfb,
15117 pdfpages = "30",
15118 xxnumber = "CS-TR-74-473",
15119 }
15120
15121 @TechReport{vonHenke:1974:APV,
15122 author = "Friedrich W. von Henke and David C. Luckham",
15123 title = "Automatic program verification {III}: a methodology
15124 for verifying programs",
15125 type = "Technical Report",
15126 number = "STAN-CS-74-474 (AIM-256, AD-A007563)",
15127 institution = inst-STAN-CS,
15128 address = inst-STAN-CS:adr,
15129 pages = "45",
15130 month = dec,
15131 year = "1974",
15132 bibdate = "Fri Nov 7 07:00:05 MST 2025",
15133 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib;
15134 https://www.math.utah.edu/pub/tex/bib/string-matching.bib",
15135 URL = "http://i.stanford.edu/TR/CS-TR-74-474.html",
15136 abstract = "The paper investigates methods for applying an on-line
15137 interactive verification system designed to prove
15138 properties of PASCAL programs. The methodology is
15139 intended to provide techniques for developing a
15140 debugged and verified version starting from a program,
15141 that (a) is possibly unfinished in some respects, (b)
15142 may not satisfy the given specifications, e.g., may
15143 contain bugs, (c) may have incomplete documentation,
15144 (d) may be written in non-standard ways, e.g., may
15145 depend on user-defined data structures. The methodology
15146 involves (i) interactive application of a verification
15147 condition generator, an algebraic simplifier and a
15148 theorem-prover; (ii) techniques for describing data
15149 structures, type constraints, and properties of
15150 programs and subprograms (i.e. lower level procedures);
15151 (iii) the use of (abstract) data types in structuring
15152 programs and proofs. Within each unit (i.e. segment of
15153 a problem), the interactive use is aimed at reducing
15154 verification conditions to manageable proportions so
15155 that the non-trivial factors may be analysed. Analysis
15156 of verification conditions attempts to localize errors
15157 in the program logic, to extend assertions inside the
15158 program, to spotlight additional assumptions on program
15159 subfunctions (beyond those already specified by the
15160 programmer), and to generate appropriate lemmas that
15161 allow a verification to be completed. Methods for
15162 structuring correctness proofs are discussed that are
15163 similar to those of `structured programming'. A
15164 detailed case study of a pattern matching algorithm
15165 illustrating the various aspects of the methodology
15166 (including the role played by the user) is given.",
15167 acknowledgement = ack-nhfb,
15168 pdfpages = "44",
15169 xxnumber = "CS-TR-74-474",
15170 }
15171
15172 @TechReport{Newey:1975:FSL,
15173 author = "M. C. Newey",
15174 title = "Formal Semantics of {LISP} with Applications to
15175 Program Correctness",
15176 type = "Technical Report",
15177 number = "STAN-CS-75-475 (AIM-257, AD-A005413)",
15178 institution = inst-STAN-CS,
15179 address = inst-STAN-CS:adr,
15180 pages = "184",
15181 month = jan,
15182 year = "1975",
15183 bibdate = "Fri Nov 21 14:21:14 2025",
15184 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
15185 URL = "",
15186 acknowledgement = ack-nhfb,
15187 remark = "This is the author's thesis.",
15188 }
15189
15190 @TechReport{Pingle:1975:FFD,
15191 author = "Karl K. Pingle and Arthur J. Thomas",
15192 title = "A fast, feature-driven stereo depth program",
15193 type = "Technical Report",
15194 number = "STAN-CS-74-462 (AIM-248)",
15195 institution = inst-STAN-CS,
15196 address = inst-STAN-CS:adr,
15197 pages = "ii + 17",
15198 month = may,
15199 year = "1975",
15200 bibdate = "Fri Nov 7 07:00:05 MST 2025",
15201 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
15202 URL = "http://i.stanford.edu/TR/CS-TR-74-462.html",
15203 abstract = "In this paper we describe a fast, feature-driven
15204 program for extracting depth information from
15205 stereoscopic sets of digitized TV images. This is
15206 achieved by two means: in the simplest case, by
15207 statistically correlating variable-sized windows on the
15208 basis of visual texture, and in the more complex case
15209 by pre-processing the images to extract significant
15210 visual features such as corners, and then using these
15211 features to control the correlation process.\par
15212
15213 The program runs on the PDP-10 but uses a PDP-11/45 and
15214 an SPS-41 Signal Processing Computer as subsidiary
15215 processors. The use of the two small, fast machines for
15216 the performance of simple but often-repeated
15217 computations effects an increase in speed sufficient to
15218 allow us to think of using this program as a fast
15219 3-dimensional segmentation method, preparatory to more
15220 complex image processing. It is also intended for use
15221 in visual feedback tasks involved in hand-eye
15222 coordination and automated assembly. The current
15223 program is able to calculate the three-dimensional
15224 positions of 10 points to within 5 millimeters, using 5
15225 seconds of computation for extracting features, 1
15226 second per image for correlation, and 0.1 second for
15227 the depth calculation.",
15228 acknowledgement = ack-nhfb,
15229 pdfpages = "23",
15230 xxnumber = "CS-TR-74-462",
15231 }
15232
15233 @TechReport{Green:1975:HDE,
15234 author = "C. Cordell Green and David R. Barstow",
15235 title = "A hypothetical dialogue exhibiting a knowledge base
15236 for a program-understanding system",
15237 type = "Technical Report",
15238 number = "STAN-CS-75-476 (AIM-258, AD-A006294)",
15239 institution = inst-STAN-CS,
15240 address = inst-STAN-CS:adr,
15241 pages = "45",
15242 month = jan,
15243 year = "1975",
15244 bibdate = "Fri Nov 7 07:00:05 MST 2025",
15245 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
15246 URL = "http://i.stanford.edu/TR/CS-TR-75-476.html",
15247 abstract = "A hypothetical dialogue with a fictitious
15248 program-understanding system is presented. In the
15249 interactive dialogue the computer carries out a
15250 detailed synthesis of a simple insertion sort program
15251 for linked lists. The content, length and complexity of
15252 the dialogue reflect the underlying programming
15253 knowledge which would be required for a system to
15254 accomplish this task. The nature of the knowledge is
15255 discussed and the codification of such programming
15256 knowledge is suggested as a major research area in the
15257 development of program-understanding systems.",
15258 acknowledgement = ack-nhfb,
15259 pdfpages = "44",
15260 xxnumber = "CS-TR-75-476",
15261 }
15262
15263 @TechReport{Chvatal:1975:LCS,
15264 author = "Vaclav Chv{\'a}tal and David Sankoff",
15265 title = "Longest common subsequences of two random sequences",
15266 type = "Technical Report",
15267 number = "STAN-CS-75-477",
15268 institution = inst-STAN-CS,
15269 address = inst-STAN-CS:adr,
15270 pages = "??",
15271 month = jan,
15272 year = "1975",
15273 bibdate = "Fri Nov 7 07:00:05 MST 2025",
15274 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
15275 URL = "http://i.stanford.edu/TR/CS-TR-75-477.html",
15276 abstract = "Given two random $k$-ary sequences of length $n$, what
15277 is $ f(n, k)$, the expected length of their longest
15278 common subsequence? This problem arises in the study of
15279 molecular evolution. We calculate $ f(n, k)$ for all
15280 $k$, where $ n \leq 5$, and $ f(n, 2)$ where $ n \leq
15281 10$. We study the limiting behavior of $ n^{-1} f(n,
15282 k)$ and derive upper and lower bounds on these limits
15283 for all $k$. Finally we estimate by Monte-Carlo methods
15284 $ f(100, k)$, $ f(1000, 2)$ and $ f(5000, 2)$.",
15285 acknowledgement = ack-nhfb,
15286 pdfpages = "19",
15287 xxnumber = "CS-TR-75-477",
15288 }
15289
15290 @TechReport{Golub:1975:ICE,
15291 author = "Gene H. Golub and James H. Wilkinson",
15292 title = "Ill-Conditioned Eigensystems and the Computation of
15293 the {Jordan} Canonical Form",
15294 type = "Technical Report",
15295 number = "STAN-CS-75-478 (SU326 P30-36)8",
15296 institution = inst-STAN-CS,
15297 address = inst-STAN-CS:adr,
15298 pages = "66",
15299 month = feb,
15300 year = "1975",
15301 bibdate = "Fri Nov 7 07:00:05 MST 2025",
15302 bibsource = "https://www.math.utah.edu/pub/bibnet/authors/g/golub-gene-h.bib;
15303 https://www.math.utah.edu/pub/bibnet/authors/w/wilkinson-james-hardy.bib;
15304 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
15305 note = "Published as \cite{Golub:1976:ICE}.",
15306 URL = "http://i.stanford.edu/TR/CS-TR-75-478.html",
15307 abstract = "The solution of the complete eigenvalue problem for a
15308 non-normal matrix A presents severe practical
15309 difficulties when A is defective or close to a
15310 defective matrix. However in the presence of rounding
15311 errors one cannot even determine whether or not a
15312 matrix is defective. Several of the more stable methods
15313 for computing the Jordan canonical form are discussed
15314 together with the alternative approach of computing
15315 well-defined bases (usually orthogonal) of the relevant
15316 invariant subspaces.",
15317 acknowledgement = ack-nhfb,
15318 author-dates = "Gene Howard Golub (February 29, 1932--November 16,
15319 2007); James H. Wilkinson (27 September 1919--5 October
15320 1986)",
15321 pdfpages = "38",
15322 xxnumber = "CS-TR-75-478",
15323 }
15324
15325 @TechReport{Chatelin:1975:EBA,
15326 author = "Fran{\c{c}}ois Chatelin and J. Lemordant",
15327 title = "Error bounds in the approximation of eigenvalues of
15328 differential and integral operators",
15329 type = "Technical Report",
15330 number = "STAN-CS-75-479 (SU326 P30-38)",
15331 institution = inst-STAN-CS,
15332 address = inst-STAN-CS:adr,
15333 pages = "24",
15334 month = feb,
15335 year = "1975",
15336 bibdate = "Fri Nov 7 07:00:05 MST 2025",
15337 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
15338 URL = "http://i.stanford.edu/TR/CS-TR-75-479.html",
15339 abstract = "Various methods of approximating the eigenvalues and
15340 invariant subspaces of nonself-adjoint differential and
15341 integral operators are unified in a general theory.
15342 Error bounds are given, from which most of the error
15343 bounds in the literature can be derived.",
15344 acknowledgement = ack-nhfb,
15345 pdfpages = "26",
15346 xxnumber = "CS-TR-75-479",
15347 }
15348
15349 @TechReport{Knuth:1975:NGD,
15350 author = "Donald E. Knuth",
15351 title = "Notes on Generalized {Dedekind} Sums",
15352 type = "Technical Report",
15353 number = "STAN-CS-75-480 (AD-A008804)",
15354 institution = inst-STAN-CS,
15355 address = inst-STAN-CS:adr,
15356 pages = "45",
15357 month = feb,
15358 year = "1975",
15359 bibdate = "Fri Nov 21 14:21:14 2025",
15360 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
15361 URL = "http://matwbn.icm.edu.pl/ksiazki/aa/aa33/aa3341.pdf;
15362 https://apps.dtic.mil/sti/pdfs/ADA008804.pdf;
15363 https://apps.dtic.mil/sti/tr/pdf/ADA008804.pdf",
15364 acknowledgement = ack-nhfb,
15365 remark = "No PDF in NTRL archive, but found in DTIC archive.
15366 Published in \booktitle{Acta Arithmetica}, {\bf 33}(4)
15367 297--325, 1975.",
15368 xxabstract = "Generalized Dedekind sums sigma h,k,c have proved to
15369 be useful in connection with the analysis of linear
15370 congruential random number generators. This paper
15371 introduces a simple algorithm for the calculation of
15372 generalized Dedekind sums using only integer
15373 arithmetic. A second algorithm, for calculating the
15374 value of $c$ which maximizes or minimizes sigma h,k,c
15375 when $h$ and $k$ are given, is used to deduce optimal a
15376 priori bounds on sigma h,k,c. Finally the reciprocity
15377 law for Dedekind sums is shown to be a consequence of a
15378 much more general reciprocity law.",
15379 }
15380
15381 @TechReport{Oliger:1975:HDM,
15382 author = "Joseph E. Oliger",
15383 title = "Hybrid difference methods for the initial
15384 boundary-value problem for hyperbolic equations",
15385 type = "Technical Report",
15386 number = "STAN-CS-75-481 (SU326 P30-39)",
15387 institution = inst-STAN-CS,
15388 address = inst-STAN-CS:adr,
15389 pages = "31",
15390 month = feb,
15391 year = "1975",
15392 bibdate = "Fri Nov 7 07:00:05 MST 2025",
15393 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
15394 URL = "http://i.stanford.edu/TR/CS-TR-75-481.html",
15395 abstract = "The use of lower order approximations in the
15396 neighborhood of boundaries coupled with higher order
15397 interior approximations is examined for the mixed
15398 initial boundary-value problem for hyperbolic partial
15399 differential equations. Uniform error can be maintained
15400 using smaller grid intervals with the lower order
15401 approximations near the boundaries. Stability results
15402 are presented for approximations to the initial
15403 boundary-value problem for the model equation $ u_t $ +
15404 $ {cu}_x $ = O which are fourth order in space and
15405 second order in time in the interior and second order
15406 in both space and time near the boundaries. These
15407 results are generalized to a class of methods of this
15408 type for hyperbolic systems. Computational results are
15409 presented and comparisons are made with other
15410 methods.",
15411 acknowledgement = ack-nhfb,
15412 pdfpages = "31",
15413 xxnumber = "CS-TR-75-481",
15414 }
15415
15416 @TechReport{Friedman:1975:AFB,
15417 author = "J. A. Friedman and J. L. Bentley and R. A. Finkel",
15418 title = "An Algorithm for Finding Best Matches in Logarithmic
15419 Time",
15420 type = "Technical Report",
15421 number = "STAN-CS-75-482 (SLACP-1549)",
15422 institution = inst-STAN-CS,
15423 address = inst-STAN-CS:adr,
15424 pages = "31",
15425 month = mar,
15426 year = "1975",
15427 bibdate = "Fri Nov 21 14:21:14 2025",
15428 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
15429 URL = "",
15430 acknowledgement = ack-nhfb,
15431 }
15432
15433 @TechReport{Erdos:1975:PSE,
15434 author = "Paul Erd{\H{o}}s and Ronald L. Graham",
15435 title = "On packing squares with equal squares",
15436 type = "Technical Report",
15437 number = "STAN-CS-75-483 (AD-A011835)",
15438 institution = inst-STAN-CS,
15439 address = inst-STAN-CS:adr,
15440 pages = "8",
15441 month = mar,
15442 year = "1975",
15443 bibdate = "Fri Nov 7 07:00:05 MST 2025",
15444 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
15445 URL = "http://i.stanford.edu/TR/CS-TR-75-483.html",
15446 abstract = "The following problem arises in connection with
15447 certain multi-dimensional stock cutting problems: How
15448 many non-overlapping open unit squares may be packed
15449 into a large square of side {$ \alpha $}? Of course, if
15450 $ \alpha $ is a positive integer, it is trivial to see
15451 that unit squares ean be successfully packed. However,
15452 if $ \alpha $ is not an integer, the problem becomes
15453 much more complicated. Intuitively, one feels that for
15454 $ \alpha $ = N + 1/100, say, (where N is an integer),
15455 one should pack $ N^2 $ unit squares in the obvious way
15456 and surrender the uncovered border area (which is about
15457 $ \alpha $ /50) as unusable waste. After all, how could
15458 it help to place the unit squares at all sorts of
15459 various skew angles? In this note, we show how it
15460 helps. In particular, we prove that we can always keep
15461 the amount of uncovered area down to at most
15462 proportional to $ {\alpha }^{7 / 11} $, which for large
15463 $ \alpha $ is much less than the linear waste produced
15464 by the `natural' packing above.",
15465 acknowledgement = ack-nhfb,
15466 author-dates = "Paul Erd{\H{o}}s (26 March 1913--20 September 1996);
15467 Ronald Lewis Graham (31 October 1935--6 July 2020)",
15468 pdfpages = "9",
15469 xxnumber = "CS-TR-75-483",
15470 }
15471
15472 @TechReport{Graham:1975:SNI,
15473 author = "Ronald L. Graham and Endre Szemer{\'e}di",
15474 title = "On subgraph number independence in trees",
15475 type = "Technical Report",
15476 number = "STAN-CS-75-484 (AD-A011832)",
15477 institution = inst-STAN-CS,
15478 address = inst-STAN-CS:adr,
15479 pages = "18",
15480 month = mar,
15481 year = "1975",
15482 bibdate = "Fri Nov 7 07:00:05 MST 2025",
15483 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
15484 URL = "http://i.stanford.edu/TR/CS-TR-75-484.html",
15485 abstract = "For finite graphs $F$ and $G$, let $ N_F (G) $ denote
15486 the number of occurrences of $F$ in $G$, i.e., the
15487 number of subgraphs of $G$ which are isomorphic to $F$.
15488 If $ {\cal F} $ and $ {\cal G} $ are families of
15489 graphs, it is natural to ask them whether or not the
15490 quantities $ N_F (G)$, $ F \in {\cal F} $, are linearly
15491 independent when $G$ is restricted to $ {\cal G} $. For
15492 example, if $ {\cal F} = \{ K_1, K_2 \} $ (where $ K_n
15493 $ denotes the complete graph on $n$ vertices) and $
15494 {\cal G} $ is the family of all (finite) $ \underline
15495 {\rm trees} $ then of course $ N_{K_1} (T) - N_{K_2}
15496 (T) = 1 $ for all $ T \in {\cal G} $. Slightly less
15497 trivially, if $ {\cal F} = \{ S_n : n = 1, 2, 3, \ldots
15498 {} \} $ (where $ S_n $ denotes the $ \underline {\rm
15499 star} $ on $n$ edges) and $ {\cal G}$ again is the
15500 family of all trees then $ \sum_{n - 1}^{\infty } {( -
15501 1)}^{n + 1} N_{S_n} (T) = 1 {\rm forall} T \in {\cal
15502 G}$. It will be proved that such a linear dependence
15503 can $ \underline {\rm never}$ occur if $ {\cal F}$ is
15504 finite, no $ F \in {\cal F}$ has an isolated point and
15505 $ {\cal G}$ contains all trees. This result has
15506 important applications in recent work of L. Lov{\'a}sz
15507 and one of the authors.",
15508 acknowledgement = ack-nhfb,
15509 author-dates = "Ronald Lewis Graham (31 October 1935--6 July 2020)",
15510 pdfpages = "19",
15511 xxnumber = "CS-TR-75-484",
15512 }
15513
15514 @TechReport{Erdos:1975:MRI,
15515 author = "Paul Erd{\H{o}}s and Endre Szemer{\'e}di",
15516 title = "On multiplicative representations of integers",
15517 type = "Technical Report",
15518 number = "STAN-CS-75-485 (AD-A011834)",
15519 institution = inst-STAN-CS,
15520 address = inst-STAN-CS:adr,
15521 pages = "18",
15522 month = mar,
15523 year = "1975",
15524 bibdate = "Fri Nov 7 07:00:05 MST 2025",
15525 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
15526 URL = "http://i.stanford.edu/TR/CS-TR-75-485.html",
15527 abstract = "In 1969 it was shown by P. Erd{\H{o}}s that if $ 0 <
15528 a_1 < a_2 < \cdots {} < a_k \leq x $ is a sequence of
15529 integers for which the products $ a_i a_j $ are all
15530 distinct then the maximum possible value of k satisfies
15531 $ \pi (x) + c_2 x^{3 / 4} / {(\log x)}^{3 / 2} < m a x
15532 k < \pi (x) + c_1 x^{3 / 4} / (\log x)^{3 / 2} $ where
15533 $ \pi (x) $ denotes the number of primes not exceeding
15534 $x$ and $ c_1 $ and $ c_2 $ are absolute constants. In
15535 this paper we will be concerned with similar results of
15536 the following type. Suppose $ 0 < a_1 < \cdots {} < a_k
15537 \leq x $, $ 0 < b_1 < \cdots {} < b_\ell \leq x $ are
15538 sequences of integers. Let $ g(n)$ denote the number of
15539 representations of $n$ in the form $ a_i b_j $. Then we
15540 prove: (i) If $ g(n) \leq 1$ for all $n$ then for some
15541 constant $ c_3 $, $ k \ell < c_3 x^2 / \log x$. (ii)
15542 For every $c$ there is an $ f(c) $ so that if $ g(n)
15543 \leq c$ for all $n$ then for some constant $ c_4, k
15544 \ell < c_4 x^2 / \log x {(\log = \log x)}^{f(c)}$.",
15545 acknowledgement = ack-nhfb,
15546 author-dates = "Paul Erd{\H{o}}s (26 March 1913--20 September 1996)",
15547 pdfpages = "19",
15548 xxnumber = "CS-TR-75-485",
15549 }
15550
15551 @TechReport{Bjorck:1975:EMA,
15552 author = "{\AA}ke Bj{\"o}rck and Gene H. Golub",
15553 title = "Eigenproblems for matrices associated with periodic
15554 boundary conditions",
15555 type = "Technical Report",
15556 number = "STAN-CS-75-486 (SU326 P30-37)",
15557 institution = inst-STAN-CS,
15558 address = inst-STAN-CS:adr,
15559 pages = "19",
15560 month = mar,
15561 year = "1975",
15562 bibdate = "Fri Nov 7 07:00:05 MST 2025",
15563 bibsource = "https://www.math.utah.edu/pub/bibnet/authors/g/golub-gene-h.bib;
15564 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
15565 URL = "http://i.stanford.edu/TR/CS-TR-75-486.html",
15566 abstract = "A survey of algorithms for solving the eigenproblem
15567 for a class of matrices of nearly tridiagonal form is
15568 given. These matrices arise from eigenvalue problems
15569 for differential equations where the solution is
15570 subject to periodic boundary conditions. Algorithms
15571 both for computing selected eigenvalues and
15572 eigenvectors and for solving the complete eigenvalue
15573 problem are discussed.",
15574 acknowledgement = ack-nhfb,
15575 author-dates = "Gene Howard Golub (February 29, 1932--November 16,
15576 2007)",
15577 pdfpages = "22",
15578 xxnumber = "CS-TR-75-486",
15579 }
15580
15581 @TechReport{Friedman:1975:VMD,
15582 author = "J. H. Friedman",
15583 title = "A Variable Metric Decision Rule for {NonParametric}
15584 Classification",
15585 type = "Technical Report",
15586 number = "STAN-CS-75-487 (SLACP-1573)",
15587 institution = inst-STAN-CS,
15588 address = inst-STAN-CS:adr,
15589 pages = "34",
15590 month = apr,
15591 year = "1975",
15592 bibdate = "Fri Nov 21 14:21:14 2025",
15593 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
15594 URL = "",
15595 acknowledgement = ack-nhfb,
15596 }
15597
15598 @TechReport{Bollabas:1975:CSC,
15599 author = "Bela Bollabas and Paul Erd{\H{o}}s and Endre
15600 Szemer{\'e}di",
15601 title = "On complete subgraphs of $r$-chromatic graphs",
15602 type = "Technical Report",
15603 number = "STAN-CS-75-488 (AD-A011445)",
15604 institution = inst-STAN-CS,
15605 address = inst-STAN-CS:adr,
15606 pages = "16",
15607 month = apr,
15608 year = "1975",
15609 bibdate = "Fri Nov 7 07:00:05 MST 2025",
15610 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
15611 URL = "http://i.stanford.edu/TR/CS-TR-75-488.html",
15612 abstract = "Denote by $ G(p, q) $ a graph of $p$ vertices and $q$
15613 edges. $ K_r = G(r, (^r_2))$ is the complete graph with
15614 $r$ vertices and $ K_r$ (t) is the complete $r$
15615 chromatic (i.e., $r$-partite) graph with $t$ vertices
15616 in each color class. $ G_r(n)$ denotes an $r$-chromatic
15617 graph, and $ \delta (G)$ is the minimal degree of a
15618 vertex of graph $G$. Furthermore denote by $ f_r(n)$
15619 the smalleest integer so that every $ G_r(n)$ with $
15620 \delta G_r(n) > f_r(n)$ contains a $ K_r$. It is easy
15621 to see that $ \lim_{n \rightarrow \infty } f_r (n) / n
15622 = c_r$ exists. We show that $ c_4 \geq 2 + 1 / 9$ and $
15623 c_r \geq r - 2 + 1 / 2 - \frac {1}{2(r - 2)}$ for $ r >
15624 4$. We prove that if $ \delta G_3 (n) \geq n + t$ then
15625 $G$ contains at least $ t^3$ triangles but does not
15626 have to contain more than $ 4 t^3$ of them.",
15627 acknowledgement = ack-nhfb,
15628 author-dates = "Paul Erd{\H{o}}s (26 March 1913--20 September 1996)",
15629 pdfpages = "17",
15630 xxnumber = "CS-TR-75-488",
15631 }
15632
15633 @TechReport{Szemeredi:1975:RPG,
15634 author = "Endre Szemer{\'e}di",
15635 title = "Regular partitions of graphs",
15636 type = "Technical Report",
15637 number = "STAN-CS-75-489 (AD-A011833)",
15638 institution = inst-STAN-CS,
15639 address = inst-STAN-CS:adr,
15640 pages = "8",
15641 month = apr,
15642 year = "1975",
15643 bibdate = "Fri Nov 7 07:00:05 MST 2025",
15644 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
15645 URL = "http://i.stanford.edu/TR/CS-TR-75-489.html",
15646 abstract = "A crucial lemma in recent work of the author (showing
15647 that k-term arithmetic progression-free sets of
15648 integers must have density zero) stated (approximately)
15649 that any large bipartite graph can be decomposed into
15650 relatively few `nearly regular' bipartite subgraphs. In
15651 this note we generalize this result to arbitrary
15652 graphs, at the same time strengthening and simplifying
15653 the original bipartite result.",
15654 acknowledgement = ack-nhfb,
15655 pdfpages = "9",
15656 xxnumber = "CS-TR-75-489",
15657 }
15658
15659 @TechReport{Gosper:1975:NES,
15660 author = "R. William Gosper",
15661 title = "Numerical experiments with the spectral test",
15662 type = "Technical Report",
15663 number = "STAN-CS-75-490 (AD-A014429)",
15664 institution = inst-STAN-CS,
15665 address = inst-STAN-CS:adr,
15666 pages = "31",
15667 month = may,
15668 year = "1975",
15669 bibdate = "Fri Nov 7 07:00:05 MST 2025",
15670 bibsource = "https://www.math.utah.edu/pub/bibnet/authors/m/marsaglia-george.bib;
15671 https://www.math.utah.edu/pub/tex/bib/prng.bib;
15672 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
15673 URL = "http://i.stanford.edu/TR/CS-TR-75-490.html",
15674 abstract = "Following Marsaglia and Dieter, the spectral test for
15675 linear congruential random number generators is
15676 developed from the grid or lattice point model rather
15677 than the Fourier transform model. Several modifications
15678 to the published algorithms were tried. One of these
15679 refinements, which uses results from lesser dimensions
15680 to compute higher dimensional ones, was found to
15681 decrease the computation time substantially. A change
15682 in the definition of the spectral test is proposed in
15683 the section entitled `A Question of Independence.'",
15684 acknowledgement = ack-nhfb,
15685 pdfpages = "32",
15686 xxnumber = "CS-TR-75-490",
15687 }
15688
15689 @TechReport{Knott:1975:DBS,
15690 author = "G. D. Knott",
15691 title = "Deletion in Binary Storage Trees",
15692 type = "Technical Report",
15693 number = "STAN-CS-75-491",
15694 institution = inst-STAN-CS,
15695 address = inst-STAN-CS:adr,
15696 pages = "93",
15697 month = may,
15698 year = "1975",
15699 bibdate = "Fri Nov 21 14:21:14 2025",
15700 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
15701 URL = "",
15702 acknowledgement = ack-nhfb,
15703 remark = "This is the author's thesis.",
15704 }
15705
15706 @TechReport{Sedgewick:1975:Q,
15707 author = "Robert Sedgewick",
15708 title = "Quicksort",
15709 type = "Technical Report",
15710 number = "STAN-CS-75-492",
15711 institution = inst-STAN-CS,
15712 address = inst-STAN-CS:adr,
15713 pages = "352",
15714 month = may,
15715 year = "1975",
15716 bibdate = "Fri Nov 21 14:21:14 2025",
15717 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
15718 URL = "",
15719 acknowledgement = ack-nhfb,
15720 remark = "This is the author's thesis.",
15721 }
15722
15723 @TechReport{Kurki-Suonio:1975:DAT,
15724 author = "Reino Kurki-Suonio",
15725 title = "Describing automata in terms of languages associated
15726 with their peripheral devices",
15727 type = "Technical Report",
15728 number = "STAN-CS-75-493 (PB244421/AS)",
15729 institution = inst-STAN-CS,
15730 address = inst-STAN-CS:adr,
15731 pages = "37",
15732 month = may,
15733 year = "1975",
15734 bibdate = "Fri Nov 7 07:00:05 MST 2025",
15735 bibsource = "https://www.math.utah.edu/pub/bibnet/authors/t/turing-alan-mathison.bib;
15736 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
15737 URL = "http://i.stanford.edu/TR/CS-TR-75-493.html",
15738 abstract = "A unified approach is presented to deal with automata
15739 having different kinds of peripheral devices. This
15740 approach is applied to pushdown automata and Turing
15741 machines, leading to elementary proofs of several
15742 well-known theorems concerning transductions,
15743 relationship between pushdown automata and context-free
15744 languages, as well as homomorphic characterization and
15745 undecidability questions. In general, this approach
15746 leads to homomorphic characterization of language
15747 families generated by a single language by finite
15748 transduction.",
15749 acknowledgement = ack-nhfb,
15750 pdfpages = "38",
15751 xxnumber = "CS-TR-75-493",
15752 }
15753
15754 @TechReport{Satterthwaite:1975:SLD,
15755 author = "E. H. {Satterthwaite, Jr.}",
15756 title = "Source Language Debugging Tools",
15757 type = "Technical Report",
15758 number = "STAN-CS-75-494",
15759 institution = inst-STAN-CS,
15760 address = inst-STAN-CS:adr,
15761 pages = "345",
15762 month = may,
15763 year = "1975",
15764 bibdate = "Fri Nov 21 14:21:14 2025",
15765 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
15766 URL = "",
15767 acknowledgement = ack-nhfb,
15768 remark = "This is the author's thesis.",
15769 }
15770
15771 @TechReport{Krogdahl:1975:DGB,
15772 author = "Stein Krogdahl",
15773 title = "The Dependence Graph for Bases in Matroids",
15774 type = "Technical Report",
15775 number = "STAN-CS-75-495 (AD-A014424)",
15776 institution = inst-STAN-CS,
15777 address = inst-STAN-CS:adr,
15778 pages = "iv + 28",
15779 month = may,
15780 year = "1975",
15781 bibdate = "Fri Nov 21 14:21:14 2025",
15782 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
15783 URL = "",
15784 abstract = "This paper discusses a certain graph, called the
15785 ``dependence graph'' (``the DFG''), that can be defined
15786 naturally for a given independent set in a matroid. We
15787 are mainly concerned with the DRG of bases, and we stud
15788 what the DFG of a base tells about the matroid. We show
15789 that there is a nice connection between the DFG and
15790 duality, and between the DFG and connectivity for
15791 matroids. This last fact leads to an algorithm for
15792 determining the connected components of a matroid and
15793 also to one for computing a circuit containing two
15794 given distinct elements in the same such component. A
15795 simple algorithm using depth-first search is given for
15796 solving this last problem for graphic matroids.",
15797 acknowledgement = ack-nhfb,
15798 pdfpages = "32",
15799 }
15800
15801 @TechReport{Underwood:1975:IBL,
15802 author = "Richard Ray Underwood",
15803 title = "An Iterative Block {Lanczos} Method for the Solution
15804 of Large Sparse Symmetric Eigenproblems",
15805 type = "Technical Report",
15806 number = "STAN-CS-75-496 (SU326 P30-41)",
15807 institution = inst-STAN-CS,
15808 address = inst-STAN-CS:adr,
15809 pages = "v + 133",
15810 month = may,
15811 year = "1975",
15812 bibdate = "Fri Nov 21 14:21:14 2025",
15813 bibsource = "https://www.math.utah.edu/pub/bibnet/authors/l/lanczos-cornelius.bib;
15814 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
15815 URL = "https://www.proquest.com/pqdtglobal/docview/302727419",
15816 acknowledgement = ack-nhfb,
15817 advisor = "Gene H. Golub",
15818 pdfpages = "138",
15819 remark = "No abstract is available.",
15820 remark = "This is the author's Ph.D. thesis.",
15821 subject-dates = "Cornelius Lanczos (2 February 1893--25 June 1974)",
15822 }
15823
15824 @TechReport{Graham:1975:DMT,
15825 author = "Ronald L. Graham and L. Lov{\'a}sz",
15826 title = "Distance Matrices of Trees",
15827 type = "Technical Report",
15828 number = "STAN-CS-75-497 (AD-A016825)",
15829 institution = inst-STAN-CS,
15830 address = inst-STAN-CS:adr,
15831 pages = "48",
15832 month = aug,
15833 year = "1975",
15834 bibdate = "Fri Nov 21 14:21:14 2025",
15835 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
15836 URL = "",
15837 acknowledgement = ack-nhfb,
15838 author-dates = "Ronald Lewis Graham (31 October 1935--6 July 2020)",
15839 pdfpages = "51",
15840 remark = "No PDF in NTRL archive.",
15841 }
15842
15843 @TechReport{Samet:1975:APC,
15844 author = "Hanan Samet",
15845 title = "Automatically Proving the Correctness of Translations
15846 Involving Optimized Code",
15847 type = "Technical Report",
15848 number = "STAN-CS-75-498 (AIM-259, AD-A017025)",
15849 institution = inst-STAN-CS,
15850 address = inst-STAN-CS:adr,
15851 pages = "vi + 214",
15852 month = may,
15853 year = "1975",
15854 bibdate = "Fri Nov 7 07:00:05 MST 2025",
15855 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
15856 URL = "http://i.stanford.edu/TR/CS-TR-75-498.html",
15857 abstract = "A formalism is described for proving that programs
15858 written in a higher level language are correctly
15859 translated to assembly language. In order to
15860 demonstrate the validity of the formalism a system has
15861 been designed and implemented for proving that programs
15862 written in a subset of LISP 1.6 as the high level
15863 language are correctly translated to LAP (an assembly
15864 language for the PDP-10) as the low level language.
15865 This work involves the identification of critical
15866 semantic properties of the language and their
15867 interrelationship to the instruction repertoire of the
15868 computer executing these programs. A primary use of the
15869 system is as a postoptimization step in code generation
15870 as well as a compiler debugger.",
15871 acknowledgement = ack-nhfb,
15872 pdfpages = "222",
15873 remark = "This is the author's thesis.",
15874 xxnumber = "CS-TR-75-498",
15875 }
15876
15877 @TechReport{Smith:1975:PCP,
15878 author = "David Canfield Smith",
15879 title = "{PYGMALION}: a Creative Programming Environment",
15880 type = "Technical Report",
15881 number = "STAN-CS-75-499 (AIM-260)",
15882 institution = inst-STAN-CS,
15883 address = inst-STAN-CS:adr,
15884 pages = "187",
15885 month = jun,
15886 year = "1975",
15887 bibdate = "Fri Nov 21 14:21:14 2025",
15888 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
15889 URL = "",
15890 abstract = "PYGMALION 1s a two-dimensional, visual programming
15891 system implemented on an interactive computer with
15892 graphics display. Communication between human being and
15893 computer is by means of visual entities called
15894 ``icons'', subsuming the notions of ``variable'',
15895 ``reference'', ``data structure'', ``function'' and
15896 ``picture''. The heart of the system is an interactive
15897 remembering editor for icons, which executes and
15898 (optionally) saves operations for later re-execution.
15899 The display screen is viewed as a document to be
15900 edited. Programming consists of creating a sequence of
15901 display frames, the last of which contains the desired
15902 information. Display frames are modified by editing
15903 operations. PYGMALION employs a powerful paradigm that
15904 can be incorporated in virtually any other programming
15905 language: Every operation has both visual (aesthetic)
15906 semantics and internal (mechanical) semantics. In fact,
15907 every operation in PYGMALION has three
15908 responsibilities: (a) for accomplishing a given
15909 internal machine task --- the machine ``semantics'' of
15910 the operation; (b) in display mode, for generating a
15911 representative visual action; (c) in remember mode, for
15912 adding onto a code list the operation(s) necessary to
15913 reproduce itself.\ldots{}",
15914 acknowledgement = ack-nhfb,
15915 pdfpages = "199",
15916 remark = "This is the author's thesis.",
15917 }
15918
15919 @TechReport{Kurki-Suonio:1975:TBS,
15920 author = "Reino Kurki-Suonio",
15921 title = "Towards better structured definitions of programming
15922 languages",
15923 type = "Technical Report",
15924 number = "STAN-CS-75-500 (PB246708/AS)",
15925 institution = inst-STAN-CS,
15926 address = inst-STAN-CS:adr,
15927 pages = "i + 29",
15928 month = sep,
15929 year = "1975",
15930 bibdate = "Fri Nov 7 07:00:05 MST 2025",
15931 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
15932 URL = "http://i.stanford.edu/TR/CS-TR-75-500.html",
15933 abstract = "The use of abstract syntax and a behavioral model is
15934 discussed from the viewpoint of structuring the
15935 complexity in definitions of programming languages. A
15936 formalism for abstract syntax is presented which
15937 reflects the possibility of having one defining
15938 occurrence and an arbitrary number of applied
15939 occurrences of objects. Attributes can be associated
15940 with such a syntax for restricting the set of objects
15941 generated, and for defining character string
15942 representations and semantic interpretations for the
15943 objects. A system of co-operating automata, described
15944 by another abstract syntax, is proposed as a behavioral
15945 model for semantic definition.",
15946 acknowledgement = ack-nhfb,
15947 pdfpages = "30",
15948 xxnumber = "CS-TR-75-500",
15949 }
15950
15951 @TechReport{Pettersen:1975:PES,
15952 author = "Odd Pettersen",
15953 title = "Procedural events as software interrupts",
15954 type = "Technical Report",
15955 number = "STAN-CS-75-501 (AIM-261, AD-A016810)",
15956 institution = inst-STAN-CS,
15957 address = inst-STAN-CS:adr,
15958 pages = "??",
15959 month = jun,
15960 year = "1975",
15961 bibdate = "Fri Nov 7 07:00:05 MST 2025",
15962 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
15963 URL = "http://i.stanford.edu/TR/CS-TR-75-501.html",
15964 abstract = "The paper deals with procedural events, providing a
15965 basis for synchronization and scheduling, particularly
15966 applied on real-time program systems of multiple
15967 parallel activities ('multi-task'). There is a great
15968 need for convenient scheduling mechanisms for
15969 minicomputer systems as used in process control, but so
15970 far mechanisms somewhat similar to those proposed here
15971 are found only in PL/I among the generally known
15972 high-level languages. PL/I, however, is not very common
15973 on computers of this size. Also, the mechanisms in PL/I
15974 seem more restricted, as compared to those proposed
15975 here. A new type of boolean program variable, the
15976 EVENTMARK, is proposed. Eventmarks represent events of
15977 any kind that may occur within a computational process
15978 and are believed to give very efficient and convenient
15979 activation and scheduling of program modules in a
15980 real-time system. An eventmark is declared similar to a
15981 procedure, and the proposed feature could easily be
15982 amended as an extension to existing languages, as well
15983 as incorporated in future language designs.",
15984 acknowledgement = ack-nhfb,
15985 pdfpages = "9",
15986 xxnumber = "CS-TR-75-501",
15987 }
15988
15989 @TechReport{Pettersen:1975:SCP,
15990 author = "Odd Pettersen",
15991 title = "Synchronization of concurrent processes",
15992 type = "Technical Report",
15993 number = "STAN-CS-75-502 (AIM-262, AD-A016808)",
15994 institution = inst-STAN-CS,
15995 address = inst-STAN-CS:adr,
15996 pages = "??",
15997 month = jul,
15998 year = "1975",
15999 bibdate = "Fri Nov 7 07:00:05 MST 2025",
16000 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
16001 URL = "http://i.stanford.edu/TR/CS-TR-75-502.html",
16002 abstract = "The paper gives an overview of commonly used
16003 synchronization primitives and literature, and presents
16004 a new form of primitive expressing conditional critical
16005 regions. A new solution is presented to the problem of
16006 `readers and writers', utilizing the proposed
16007 synchronization primitive. The solution is simpler and
16008 shorter than other known algorithms. The first sections
16009 of the paper give a tutorial introduction into
16010 established methods, in order to provide a suitable
16011 background for the remaining parts.",
16012 acknowledgement = ack-nhfb,
16013 pdfpages = "14",
16014 xxnumber = "CS-TR-75-502",
16015 }
16016
16017 @TechReport{Pettersen:1975:MPS,
16018 author = "Odd Pettersen",
16019 title = "The macro processing system {STAGE2}: transfer of
16020 comments to the generated text",
16021 type = "Technical Report",
16022 number = "STAN-CS-75-503 (AIM-263, AD-A016807)",
16023 institution = inst-STAN-CS,
16024 address = inst-STAN-CS:adr,
16025 pages = "??",
16026 month = jul,
16027 year = "1975",
16028 bibdate = "Fri Nov 7 07:00:05 MST 2025",
16029 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
16030 URL = "http://i.stanford.edu/TR/CS-TR-75-503.html",
16031 abstract = "This paper is a short description of a small extension
16032 of STAGE2, providing possibilities to copy comments
16033 etc. from the source text to the generated text. The
16034 description presupposes familiarity with the STAGE2
16035 system: its purpose, use and descriptions. Only section
16036 3 of this paper requires knowledge of the internal
16037 structures and working of the system, and that section
16038 is unnecessary for the plain use of the described
16039 feature. The extension, if not used, is completely
16040 invisible to the user: No rules, as described in the
16041 original literature, are changed. A user, unaware of
16042 the extension, will see no difference from the original
16043 version.",
16044 acknowledgement = ack-nhfb,
16045 pdfpages = "24",
16046 xxnumber = "CS-TR-75-503",
16047 }
16048
16049 @TechReport{Erdos:1975:SGD,
16050 author = "Paul Erd{\H{o}}s and Ronald L. Graham and Endre
16051 Szemer{\'e}di",
16052 title = "On sparse graphs with dense long paths",
16053 type = "Technical Report",
16054 number = "STAN-CS-75-504 (AD-A017370)",
16055 institution = inst-STAN-CS,
16056 address = inst-STAN-CS:adr,
16057 pages = "??",
16058 month = sep,
16059 year = "1975",
16060 bibdate = "Fri Nov 7 07:00:05 MST 2025",
16061 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
16062 URL = "http://i.stanford.edu/TR/CS-TR-75-504.html",
16063 abstract = "The following problem was raised by H.-J. Stoss in
16064 connection with certain questions related to the
16065 complexity of Boolean functions. An acyclic directed
16066 graph $G$ is said to have property $ P(m, n)$ if for
16067 any set $X$ of $m$ vertices of $G$, there is a directed
16068 path of length $n$ in $G$ which does not intersect $X$.
16069 Let $ f(m, n)$ denote the minimum number of edges a
16070 graph with property $ P(m, n)$ can have. The problem is
16071 to estimate $ f(m, n)$. For the remainder of the paper,
16072 we shall restrict ourselves to the case $ m = n$. We
16073 shall prove (1) $ c_1 n \log n \log \log n < f(n, n) <
16074 c_2 n \log n$ (where $ c_1 $, $ c_2 $, \ldots{}, will
16075 hereafter denote suitable positive constraints). In
16076 fact, the graph we construct in order to establish the
16077 upper bound on $ f(n, n) $ in (1) will have just $ c_3
16078 n $ vertices. In this case the upper bound in (1) is
16079 essentially best possible since it will also be shown
16080 that for $ c_4 $ sufficiently large, every graph on $
16081 c_4 n $ vertices having property $ P(n, n)$ must have
16082 at least $ c_5 n \log n $ edges.",
16083 acknowledgement = ack-nhfb,
16084 author-dates = "Paul Erd{\H{o}}s (26 March 1913--20 September 1996);
16085 Ronald Lewis Graham (31 October 1935--6 July 2020)",
16086 pdfpages = "15",
16087 xxnumber = "CS-TR-75-504",
16088 }
16089
16090 @TechReport{Chvatal:1975:SLP,
16091 author = "Vaclav Chv{\'a}tal",
16092 title = "Some linear programming aspects of combinatorics",
16093 type = "Technical Report",
16094 number = "STAN-CS-75-505 (AD-A017053)",
16095 institution = inst-STAN-CS,
16096 address = inst-STAN-CS:adr,
16097 pages = "??",
16098 month = sep,
16099 year = "1975",
16100 bibdate = "Fri Nov 7 07:00:05 MST 2025",
16101 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
16102 URL = "http://i.stanford.edu/TR/CS-TR-75-505.html",
16103 abstract = "This is the text of a lecture given at the Conference
16104 on Algebraic Aspects of Combinatorics at the University
16105 of Toronto in January 1975. The lecture was expository,
16106 aimed at an audience with no previous knowledge of
16107 linear programming.",
16108 acknowledgement = ack-nhfb,
16109 pdfpages = "31",
16110 xxnumber = "CS-TR-75-505",
16111 }
16112
16113 @TechReport{Gordon:1975:ORD,
16114 author = "Michael J. C. Gordon",
16115 title = "Operational reasoning and denotational semantics",
16116 type = "Technical Report",
16117 number = "STAN-CS-75-506 (AIM-264, AD-A017176)",
16118 institution = inst-STAN-CS,
16119 address = inst-STAN-CS:adr,
16120 pages = "??",
16121 month = aug,
16122 year = "1975",
16123 bibdate = "Fri Nov 7 07:00:05 MST 2025",
16124 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
16125 URL = "http://i.stanford.edu/TR/CS-TR-75-506.html",
16126 abstract = "'Obviously true' properties of programs can be hard to
16127 prove when meanings are specified with a denotational
16128 semantics. One cause of this is that such a semantics
16129 usually abstracts away from the running process - thus
16130 properties which are obvious when one thinks about this
16131 lose the basis of their obviousness in the absence of
16132 it. To enable process-based intuitions to be used in
16133 constructing proofs one can associate with the
16134 semantics an abstract interpreter so that reasoning
16135 about the semantics can be done by reasoning about
16136 computations on the interpreter. This technique is used
16137 to prove several facts about a semantics of pure LISP.
16138 First a denotational semantics and an abstract
16139 interpreter are described. Then it is shown that the
16140 denotation of any LISP form is correctly computed by
16141 the interpreter. This is used to justify an inference
16142 rule - called `LlSP-induction' - which formalises
16143 induction on the size of computations on the
16144 interpreter. Finally LlSP-induction is used to prove a
16145 number of results. In particular it is shown that the
16146 function eval is correct relative to the semantics -
16147 i.e. that it denotes a mapping which maps forms (coded
16148 as S-expressions) on to their correct values.",
16149 acknowledgement = ack-nhfb,
16150 pdfpages = "34",
16151 xxnumber = "CS-TR-75-506",
16152 }
16153
16154 @TechReport{Gordon:1975:TST,
16155 author = "Michael J. C. Gordon",
16156 title = "Towards a semantic theory of dynamic binding",
16157 type = "Technical Report",
16158 number = "STAN-CS-75-507 (AIM-265)",
16159 institution = inst-STAN-CS,
16160 address = inst-STAN-CS:adr,
16161 pages = "??",
16162 month = aug,
16163 year = "1975",
16164 bibdate = "Fri Nov 7 07:00:05 MST 2025",
16165 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
16166 URL = "http://i.stanford.edu/TR/CS-TR-75-507.html",
16167 abstract = "The results in this paper contribute to the
16168 formulation of a semantic theory of dynamic binding
16169 (fluid variables). The axioms and theorems are language
16170 independent in that they don't talk about programs -
16171 i.e, syntactic objects - but just about elements in
16172 certain domains. Firstly the equivalence (in the
16173 circumstances where it's true) of `tying a knot'
16174 through the environment (elaborated in the paper) and
16175 taking a least fixed point is shown. This is central in
16176 proving the correctness of LISP `eval' type
16177 interpreters. Secondly the relation which must hold
16178 between two environments if a program is to have the
16179 same meaning in both is established. It is shown how
16180 the theory can be applied to LISP to yield previously
16181 known facts.",
16182 acknowledgement = ack-nhfb,
16183 pdfpages = "29",
16184 xxnumber = "CS-TR-75-507",
16185 }
16186
16187 @TechReport{Eve:1975:CTC,
16188 author = "James Eve",
16189 title = "On computing the transitive closure of a relation",
16190 type = "Technical Report",
16191 number = "STAN-CS-75-508",
16192 institution = inst-STAN-CS,
16193 address = inst-STAN-CS:adr,
16194 pages = "??",
16195 month = sep,
16196 year = "1975",
16197 bibdate = "Fri Nov 7 07:00:05 MST 2025",
16198 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
16199 URL = "http://i.stanford.edu/TR/CS-TR-75-508.html",
16200 abstract = "An algorithm is presented for computing the transitive
16201 closure of an arbitrary relation which is based upon a
16202 variant of Tarjan's algorithm [1972] for finding the
16203 strongly connected components of a directed graph. This
16204 variant leads to a more compact statement of Tarjan's
16205 algorithm. If V is the number of vertices in the
16206 directed graph representing the relation then the worst
16207 case behavior of the proposed algorithm involves $
16208 O(V^3) $ operations. In this respect it is inferior to
16209 existing algorithms which require $ O(V^3 / \log V) $
16210 and $ O(V^{\log_2 7} \log V) $ operations respectively.
16211 The best case behavior involves only $ O(V^2) $
16212 operations.",
16213 acknowledgement = ack-nhfb,
16214 pdfpages = "15",
16215 xxnumber = "CS-TR-75-508",
16216 }
16217
16218 @TechReport{Overton:1975:FMI,
16219 author = "Michael L. Overton and Andrzej Proskurowski",
16220 title = "Finding the maximal incidence matrix of a large
16221 graph",
16222 type = "Technical Report",
16223 number = "STAN-CS-75-509 (AD-A017331)",
16224 institution = inst-STAN-CS,
16225 address = inst-STAN-CS:adr,
16226 pages = "??",
16227 month = sep,
16228 year = "1975",
16229 bibdate = "Fri Nov 7 07:00:05 MST 2025",
16230 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
16231 URL = "http://i.stanford.edu/TR/CS-TR-75-509.html",
16232 abstract = "This paper deals with the computation of two canonical
16233 representations of a graph. A computer program is
16234 presented which searches for `the maximal incidence
16235 matrix' of a large connected graph without multiple
16236 edges or self-loops. The use of appropriate algorithms
16237 and data structures is discussed.",
16238 acknowledgement = ack-nhfb,
16239 pdfpages = "76",
16240 xxnumber = "CS-TR-75-509",
16241 }
16242
16243 @TechReport{Yao:1975:ASA,
16244 author = "Andrew C. Yao and Donald E. Knuth",
16245 title = "Analysis of the Subtractive Algorithm for Greatest
16246 Common Divisors",
16247 type = "Technical Report",
16248 number = "STAN-CS-75-510 (AD-A017054)",
16249 institution = inst-STAN-CS,
16250 address = inst-STAN-CS:adr,
16251 pages = "iv + 11",
16252 month = sep,
16253 year = "1975",
16254 DOI = "https://doi.org/10.1145/1093397.1093401",
16255 bibdate = "Fri Nov 21 14:21:14 2025",
16256 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
16257 note = "To the memory of Hans A. Heilbronn, 1908--1975.",
16258 URL = "https://www.jstor.org/stable/65273",
16259 abstract = "The sum of all partial quotients in the regular
16260 continued fraction expansions of $ m / n $, for $ 1 < m
16261 < n $, is shown to be $ 6 \pi^{-2} n (\ln n)^2 + O(n
16262 \log n (\log \log n)^2) $. This result is applied to
16263 the analysis of what is perhaps the oldest nontrivial
16264 algorithm for number-theoretic computations.",
16265 acknowledgement = ack-nhfb,
16266 keywords = "Euclidean algorithm; greatest common divisor",
16267 pdfpages = "15",
16268 remark = "Published in \booktitle{Proceedings of the National
16269 Academy of Sciences of the United States of America},
16270 {\bf 72}(12) 4720--4722, December 1975.
16271 doi:10.1145/1093397.1093401.",
16272 }
16273
16274 @TechReport{Dubost:1975:SIN,
16275 author = "Pierre Dubost and Jean-Michel Trousse",
16276 title = "Software implementation of a new method of
16277 combinatorial hashing",
16278 type = "Technical Report",
16279 number = "STAN-CS-75-511 (AD-A017294)",
16280 institution = inst-STAN-CS,
16281 address = inst-STAN-CS:adr,
16282 pages = "??",
16283 month = sep,
16284 year = "1975",
16285 bibdate = "Fri Nov 7 07:00:05 MST 2025",
16286 bibsource = "https://www.math.utah.edu/pub/tex/bib/hash.bib;
16287 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
16288 URL = "http://i.stanford.edu/TR/CS-TR-75-511.html",
16289 abstract = "This is a study of the software implementation of a
16290 new method of searching with retrieval on secondary
16291 keys. A new family of partial match file designs is
16292 presented, the 'worst case' is determined, a detailed
16293 algorithm and program are given and the average
16294 execution time is studied.",
16295 acknowledgement = ack-nhfb,
16296 pdfpages = "36",
16297 xxnumber = "CS-TR-75-511",
16298 }
16299
16300 @TechReport{Tarjan:1975:APC,
16301 author = "Robert Endre Tarjan",
16302 title = "Applications of path compression on balanced trees",
16303 type = "Technical Report",
16304 number = "STAN-CS-75-512 (PB247895/AS)",
16305 institution = inst-STAN-CS,
16306 address = inst-STAN-CS:adr,
16307 pages = "??",
16308 month = aug,
16309 year = "1975",
16310 bibdate = "Fri Nov 7 07:00:05 MST 2025",
16311 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
16312 URL = "http://i.stanford.edu/TR/CS-TR-75-512.html",
16313 abstract = "We devise a method for computing functions defined on
16314 paths in trees. The method is based on tree
16315 manipulation techniques first used for efficiently
16316 representing equivalence relations. It has an
16317 almost-linear running time. We apply the method to give
16318 $ O(m \alpha (m, n)) $ algorithms for two problems. A.
16319 Verifying a minimum spanning tree in an undirected
16320 graph (best previous bound: $ O(m \log \log n) $). B.
16321 Finding dominators in a directed graph (best previous
16322 bound: $ O(n \log n + m) $). Here $n$ is the number of
16323 vertices and $m$ the number of edges in the problem
16324 graph, and $ \alpha (m, n) $ is a very slowly growing
16325 function which is related to a functional inverse of
16326 Ackermann's function. The method is also useful for
16327 solving, in $ O(m \alpha (m, n)) $ time, certain kinds
16328 of pathfinding problems on reducible graphs. Such
16329 problems occur in global flow analysis of computer
16330 programs and in other contexts. A companion paper will
16331 discuss this application.",
16332 acknowledgement = ack-nhfb,
16333 pdfpages = "58",
16334 xxnumber = "CS-TR-75-512",
16335 }
16336
16337 @TechReport{Bentley:1975:STF,
16338 author = "Jon Louis Bentley",
16339 title = "A survey of techniques for fixed radius near neighbor
16340 searching",
16341 type = "Technical Report",
16342 number = "STAN-CS-75-513 (SLACR-186)",
16343 institution = inst-STAN-CS,
16344 address = inst-STAN-CS:adr,
16345 pages = "??",
16346 month = aug,
16347 year = "1975",
16348 bibdate = "Fri Nov 7 07:00:05 MST 2025",
16349 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
16350 URL = "http://i.stanford.edu/TR/CS-TR-75-513.html",
16351 abstract = "This paper is a survey of techniques used for
16352 searching in a multidimensional space. Though we
16353 consider specifically the problem of searching for
16354 fixed radius near neighbors (that is, all points within
16355 a fixed distance of a given point), the structures
16356 presented here are applicable to many different search
16357 problems in multidimensional spaces. The orientation of
16358 this paper is practical; no theoretical results are
16359 presented. Many areas open for further research are
16360 mentioned.",
16361 acknowledgement = ack-nhfb,
16362 pdfpages = "22",
16363 xxnumber = "CS-TR-75-513",
16364 }
16365
16366 @TechReport{Tokura:1975:MCU,
16367 author = "Nobuki Tokura",
16368 title = "A microprogram control unit based on a tree memory",
16369 type = "Technical Report",
16370 number = "STAN-CS-75-514 (PB247561/AS)",
16371 institution = inst-STAN-CS,
16372 address = inst-STAN-CS:adr,
16373 pages = "??",
16374 month = aug,
16375 year = "1975",
16376 bibdate = "Fri Nov 7 07:00:05 MST 2025",
16377 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
16378 URL = "http://i.stanford.edu/TR/CS-TR-75-514.html",
16379 abstract = "A modularized control unit for microprocessors is
16380 proposed that implements ancestor tree programs. This
16381 leads to a reduction of storage required for address
16382 information. The basic architecture is extended to
16383 paged tree memory to enhance the memory space usage.
16384 Finally, the concept of an ancestor tree with shared
16385 subtrees is introduced, and the existence of an
16386 efficient algorithm to find sharable subtrees is
16387 shown.",
16388 acknowledgement = ack-nhfb,
16389 pdfpages = "30",
16390 xxnumber = "CS-TR-75-514",
16391 }
16392
16393 @TechReport{Brent:1975:FMP,
16394 author = "Richard P. Brent",
16395 title = "Fast Multiple-precision Evaluation of Elementary
16396 Functions",
16397 type = "Technical Report",
16398 number = "STAN-CS-75-515",
16399 institution = inst-STAN-CS,
16400 address = inst-STAN-CS:adr,
16401 pages = "i + 22",
16402 month = aug,
16403 year = "1975",
16404 bibdate = "Thu Jan 11 16:47:21 2024",
16405 bibsource = "https://www.math.utah.edu/pub/tex/bib/agm.bib;
16406 https://www.math.utah.edu/pub/tex/bib/elefunt.bib;
16407 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
16408 URL = "https://bitsavers.org/pdf/stanford/cs_techReports/STAN-CS-75_515_Brent_Fast_Multiple-Precision_Evaluation_Of_Elementary_Functions_Aug75.pdf",
16409 abstract = "Let $ f(x) $ be one of the usual elementary functions
16410 ($ \exp $, $ \log $, $ \arctan $, $ \sin $, $ \cosh $,
16411 etc.), and let $ M(n) $ be the number of
16412 single-precision operations required to multiply n-bit
16413 integers. We show that $ f(x) $ can be evaluated, with
16414 relative error $ O(2^{-n}) $, in $ O(M(n) \log (n)) $
16415 operations as $ n \to \infty $, for any floating-point
16416 number $x$ (with an $n$-bit fraction) in a suitable
16417 finite interval. From the Sch{\"o}nhage--Strassen bound
16418 on $ M(n) $, it follows that an $n$-bit approximation
16419 to $ f(x) $ may be evaluated in $ O(n \log^2 (n) \log
16420 \log (n)) $ operations. Special cases include the
16421 evaluation of constants such as $ \pi $, $e$, and $ e^p
16422 i $. The algorithms depend on the theory of elliptic
16423 integrals, using the arithmetic--geometric mean
16424 iteration and ascending Landen transformations.",
16425 acknowledgement = ack-nhfb,
16426 pdfpages = "46",
16427 xxnumber = "CS-TR-75-515",
16428 }
16429
16430 @TechReport{Stoer:1975:RBQ,
16431 author = "J. Stoer",
16432 title = "On the Relation Between Quadratic Termination and
16433 Convergence Properties of Minimization Algorithms",
16434 type = "Technical Report",
16435 number = "STAN-CS-75-516 (SU326, P30-42)",
16436 institution = inst-STAN-CS,
16437 address = inst-STAN-CS:adr,
16438 pages = "103",
16439 month = oct,
16440 year = "1975",
16441 bibdate = "Fri Nov 21 14:21:14 2025",
16442 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
16443 URL = "",
16444 acknowledgement = ack-nhfb,
16445 remark = "No PDF in NTRL archive.",
16446 }
16447
16448 @TechReport{Chvatal:1975:DOG,
16449 author = "Vaclav Chv{\'a}tal and Carsten Thomassen",
16450 title = "Distances in orientations of graphs",
16451 type = "Technical Report",
16452 number = "STAN-CS-75-517",
16453 institution = inst-STAN-CS,
16454 address = inst-STAN-CS:adr,
16455 pages = "??",
16456 month = aug,
16457 year = "1975",
16458 bibdate = "Fri Nov 7 07:00:05 MST 2025",
16459 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
16460 URL = "http://i.stanford.edu/TR/CS-TR-75-517.html",
16461 abstract = "We prove that there is a function $ h(k) $ such that
16462 every undirected graph $G$ admits an orientation $H$
16463 with the following property: if an edge $ u v$ belongs
16464 to a cycle of length $k$ in $G$, then $ u v$ or $ v u$
16465 belongs to a directed cycle of length at most $ h(k)$
16466 in $H$. Next, we show that every undirected bridgeless
16467 graph of radius $r$ admits an orientation of radius at
16468 most $ R^2 + r$, and this bound is best possible. We
16469 consider the same problem with radius replaced by
16470 diameter. Finally, we show that the problem of deciding
16471 whether an undirected graph admits an orientation of
16472 diameter (resp. radius) two belongs to a class of
16473 problems called NP-hard.",
16474 acknowledgement = ack-nhfb,
16475 pdfpages = "25",
16476 xxnumber = "CS-TR-75-517",
16477 }
16478
16479 @TechReport{Chvatal:1975:AII,
16480 author = "Vaclav Chv{\'a}tal and Peter L. Hammer",
16481 title = "Aggregation of inequalities in integer programming",
16482 type = "Technical Report",
16483 number = "STAN-CS-75-518 (AD-A018461)",
16484 institution = inst-STAN-CS,
16485 address = inst-STAN-CS:adr,
16486 pages = "??",
16487 month = aug,
16488 year = "1975",
16489 bibdate = "Fri Nov 7 07:00:05 MST 2025",
16490 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
16491 URL = "http://i.stanford.edu/TR/CS-TR-75-518.html",
16492 abstract = "Given an m $ \times $ n zero-one matrix $ \underset
16493 \tilde \to A $ we ask whether there is a single linear
16494 inequality $ \underset \tilde \to a \underset \tilde
16495 \to x \leq b $ whose zero-one solutions are precisely
16496 the zero-one solutions of $ \underset \tilde \to A
16497 \underset \tilde \to x \leq e $. We develop an
16498 algorithm for answering this question in O(m$ n^2$)
16499 steps and investigate other related problems. Our
16500 results may be interpreted in terms of graph theory and
16501 threshold logic.",
16502 acknowledgement = ack-nhfb,
16503 pdfpages = "28",
16504 xxnumber = "CS-TR-75-518",
16505 }
16506
16507 @TechReport{Davis:1975:PRR,
16508 author = "Randall Davis and Bruce Buchanan and Edward
16509 Shortliffe",
16510 title = "Production Rules as a Representation for a
16511 Knowledge-Based Consultation Program",
16512 type = "Technical Report",
16513 number = "STAN-CS-75-519 (AIM-266, AD-A019641)",
16514 institution = inst-STAN-CS,
16515 address = inst-STAN-CS:adr,
16516 pages = "iii + 37",
16517 month = oct,
16518 year = "1975",
16519 bibdate = "Fri Nov 21 14:21:14 2025",
16520 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
16521 URL = "",
16522 abstract = "The MYCIN system has begun to exhibit a high level of
16523 performance as a consultant on the difficult task of
16524 selecting antibiotic therapy for bacteremia. This
16525 report discusses issues of representation and design
16526 for the system. We describe the basic task and document
16527 the constraints involved m the use of a program as a
16528 consultant. The control structure and knowledge
16529 representation of the system are examined in this
16530 light, and special attention is given 10 the impact of
16531 production rules as a representation. The extent of the
16532 domain independence of the methodology is also
16533 examined. This is a pre-print of a paper submitted to
16534 \booktitle{Artificial Intelligence}.",
16535 acknowledgement = ack-nhfb,
16536 pdfpages = "42",
16537 }
16538
16539 @TechReport{vonHenke:1975:RDS,
16540 author = "Friedrich W. von Henke",
16541 title = "On the representation of data structures in {LCF} with
16542 applications to program generation",
16543 type = "Technical Report",
16544 number = "STAN-CS-75-520 (AIM-267, AD-A019664)",
16545 institution = inst-STAN-CS,
16546 address = inst-STAN-CS:adr,
16547 pages = "41",
16548 month = sep,
16549 year = "1975",
16550 bibdate = "Fri Nov 7 07:00:05 MST 2025",
16551 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
16552 URL = "http://i.stanford.edu/TR/CS-TR-75-520.html",
16553 abstract = "In this paper we discuss techniques of exploiting the
16554 obvious relationship between program structure and data
16555 structure for program generation. We develop methods of
16556 program specification that are derived from a
16557 representation of recursive data structures in the
16558 Logic for Computable Functions (LCF). As a step towards
16559 a formal problem specification language we define
16560 definitional extensions of LCF. These include a
16561 calculus for (computable) homogeneous sets and
16562 restricted quantification. Concepts that are obtained
16563 by interpreting data types as algebras are used to
16564 derive function definition schemes from an LCF term
16565 representing a data structure; they also lead to
16566 techniques for the simplification of expressions in the
16567 extended language. The specification methods are
16568 illustrated with a detailed example.",
16569 acknowledgement = ack-nhfb,
16570 pdfpages = "43",
16571 xxnumber = "CS-TR-75-520",
16572 }
16573
16574 @TechReport{Thompson:1975:DPS,
16575 author = "Clark Thompson",
16576 title = "Depth perception in stereo computer vision",
16577 type = "Technical Report",
16578 number = "STAN-CS-75-521 (AIM-268)",
16579 institution = inst-STAN-CS,
16580 address = inst-STAN-CS:adr,
16581 pages = "??",
16582 month = oct,
16583 year = "1975",
16584 bibdate = "Fri Nov 7 07:00:05 MST 2025",
16585 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
16586 URL = "http://i.stanford.edu/TR/CS-TR-75-521.html",
16587 abstract = "This report describes a stereo vision approach to
16588 depth perception; the author has build upon a set of
16589 programs that decompose the problem in the following
16590 way: (1) Production of a camera model: the position and
16591 orientation of the cameras in 3-space. (2) Generation
16592 of matching point-pairs: loci of corresponding features
16593 in the two pictures. (3) Computation of the point in
16594 3-space for each point-pair. (4) Presentation of the
16595 resultant depth information.",
16596 acknowledgement = ack-nhfb,
16597 pdfpages = "17",
16598 xxnumber = "CS-TR-75-521",
16599 }
16600
16601 @TechReport{Luckham:1975:APV,
16602 author = "David C. Luckham and Norihisa Suzuki",
16603 title = "Automatic program verification {IV}: proof of
16604 termination within a weak logic of programs",
16605 type = "Technical Report",
16606 number = "STAN-CS-75-522 (AIM-269, AD-A019569)",
16607 institution = inst-STAN-CS,
16608 address = inst-STAN-CS:adr,
16609 pages = "??",
16610 month = oct,
16611 year = "1975",
16612 bibdate = "Fri Nov 7 07:00:05 MST 2025",
16613 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
16614 URL = "http://i.stanford.edu/TR/CS-TR-75-522.html",
16615 abstract = "A weak logic of programs is a formal system in which
16616 statements that mean `the program halts' cannot be
16617 expressed. In order to prove termination, we would
16618 usually have to use a stronger logical system. In this
16619 paper we show how we can prove termination of both
16620 iterative and recursive programs within a weak logic by
16621 adding pieces of code and placing restrictions on loop
16622 invariants and entry conditions. Thus, most of the
16623 existing verifiers which are based on a weak logic of
16624 programs can be used to prove termination of programs
16625 without any modification. We give examples of proofs of
16626 termination and of accurate bounds on computation time
16627 that were obtained using the Stanford Pascal program
16628 verifier.",
16629 acknowledgement = ack-nhfb,
16630 pdfpages = "32",
16631 xxnumber = "CS-TR-75-522",
16632 }
16633
16634 @TechReport{Reiser:1975:BDS,
16635 author = "John F. Reiser",
16636 title = "{BAIL}: a debugger for {SAIL}",
16637 type = "Technical Report",
16638 number = "STAN-CS-75-523 (AIM-270, AD-A019467)",
16639 institution = inst-STAN-CS,
16640 address = inst-STAN-CS:adr,
16641 pages = "??",
16642 month = oct,
16643 year = "1975",
16644 bibdate = "Fri Nov 7 07:00:05 MST 2025",
16645 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
16646 URL = "http://i.stanford.edu/TR/CS-TR-75-523.html",
16647 abstract = "BAIL is a debugging aid for SAIL programs, where SAIL
16648 is an extended dialect of ALGOL60 which runs on the
16649 PDP-10 computer. BAIL consists of a breakpoint package
16650 and an expression interpreter which allow the user to
16651 stop his program at selected points, examine and change
16652 the values of variables, and evaluate general SAIL
16653 expressions. In addition, BAIL can display text from
16654 the source file corresponding to the current location
16655 in the program. In may respects BAIL is like DDT or
16656 RAID, except that BAIL is oriented towards SAIL and
16657 knows about SAIL data types, primitive operations, and
16658 procedure implementation.",
16659 acknowledgement = ack-nhfb,
16660 pdfpages = "34",
16661 xxnumber = "CS-TR-75-523",
16662 }
16663
16664 @TechReport{Davis:1975:OPS,
16665 author = "Randall Davis and Jonathan King",
16666 title = "An Overview of Production Systems",
16667 type = "Technical Report",
16668 number = "STAN-CS-75-524 (AIM-271, AD-A019702)",
16669 institution = inst-STAN-CS,
16670 address = inst-STAN-CS:adr,
16671 pages = "v + 38",
16672 month = oct,
16673 year = "1975",
16674 bibdate = "Fri Nov 21 14:21:14 2025",
16675 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
16676 URL = "",
16677 abstract = "Since production systems were first proposed in 1943
16678 as a general computational mechanism, the methodology
16679 has seen a great deal of development and has been
16680 applied to a diverse collection of problems. Despite
16681 the wide scope of goals and perspectives demonstrated
16682 by the various systems, there appear to be many
16683 recurrent themes. This paper is an attempt to provide
16684 ab analysis and overview of those themes, as well as a
16685 conceptual framework by which many of the seemingly
16686 disparate efforts can be viewed, both in relation to
16687 each other, and to other
16688 methodologies.\par
16689
16690 Accordingly, we use the term 'production system' in a
16691 broad sense, and attempt to show how most systems which
16692 have used the term can be fit into the framework. The
16693 comparison with other methodologies is intended to
16694 provide a view of PS characteristics in a broader
16695 context, with primary reference to procedurally-based
16696 techniques, but with reference also to some of the
16697 current developments in programming and the
16698 organization of data and knowledge bases. This is a
16699 slightly revised version of a paper to appear in
16700 \booktitle{Machine Representations of Knowledge},
16701 Dordrecht, D. Reidel Publishing Company (1976).",
16702 acknowledgement = ack-nhfb,
16703 pdfpages = "43",
16704 }
16705
16706 @TechReport{Ganapathy:1975:RSC,
16707 author = "S. Ganapathy",
16708 title = "Reconstruction of Scenes Containing Polyhedra from
16709 Stereo Pair of Views",
16710 type = "Technical Report",
16711 number = "STAN-CS-75-525 (AIM-272)",
16712 institution = inst-STAN-CS,
16713 address = inst-STAN-CS:adr,
16714 pages = "204",
16715 month = nov,
16716 year = "1975",
16717 bibdate = "Fri Nov 21 14:21:14 2025",
16718 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
16719 URL = "",
16720 acknowledgement = ack-nhfb,
16721 remark = "This is the author's thesis.",
16722 }
16723
16724 @TechReport{Tarjan:1975:GTG,
16725 author = "Robert Endre Tarjan",
16726 title = "Graph theory and {Gaussian} elimination",
16727 type = "Technical Report",
16728 number = "STAN-CS-75-526 (AD-A020848)",
16729 institution = inst-STAN-CS,
16730 address = inst-STAN-CS:adr,
16731 pages = "23",
16732 month = nov,
16733 year = "1975",
16734 bibdate = "Fri Nov 7 07:00:05 MST 2025",
16735 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
16736 URL = "http://i.stanford.edu/TR/CS-TR-75-526.html",
16737 abstract = "This paper surveys graph-theoretic ideas which apply
16738 to the problem of solving a sparse system of linear
16739 equations by Gaussian elimination. Included are a
16740 discussion of bandwidth, profile, and general sparse
16741 elimination schemes, and of two graph-theoretic
16742 partitioning methods. Algorithms based on these ideas
16743 are presented.",
16744 acknowledgement = ack-nhfb,
16745 pdfpages = "24",
16746 xxnumber = "CS-TR-75-526",
16747 }
16748
16749 @TechReport{McCluskey:1975:CRC,
16750 author = "Edward J. McCluskey and John F. Wakerly and Roy C.
16751 Ogus",
16752 title = "{Center for Reliable Computing}: current research",
16753 type = "Technical Report",
16754 number = "STAN-CS-75-527 (CSL-TR-100, SU-SEL-75-044)",
16755 institution = inst-STAN-CS,
16756 address = inst-STAN-CS:adr,
16757 pages = "v + 99",
16758 month = oct,
16759 year = "1975",
16760 bibdate = "Fri Nov 7 07:00:05 MST 2025",
16761 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
16762 URL = "http://i.stanford.edu/TR/CS-TR-75-527.html",
16763 abstract = "This report summarizes the research work which has
16764 been performed, and is currently active in the Center
16765 for Reliable Computing in the Digital Systems
16766 Laboratory, Stanford University.",
16767 acknowledgement = ack-nhfb,
16768 pdfpages = "110",
16769 xxnumber = "CS-TR-75-527",
16770 }
16771
16772 @TechReport{Tarjan:1975:SPP,
16773 author = "Robert Endre Tarjan",
16774 title = "Solving path problems on directed graphs",
16775 type = "Technical Report",
16776 number = "STAN-CS-75-528 (AD-A020597)",
16777 institution = inst-STAN-CS,
16778 address = inst-STAN-CS:adr,
16779 pages = "45",
16780 month = oct,
16781 year = "1975",
16782 bibdate = "Fri Nov 7 07:00:05 MST 2025",
16783 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
16784 URL = "http://i.stanford.edu/TR/CS-TR-75-528.html",
16785 abstract = "This paper considers path problems on directed graphs
16786 which are solvable by a method similar to Gaussian
16787 elimination. The paper gives an axiom system for such
16788 problems which is a weakening of Salomaa's axioms for a
16789 regular algebra. The paper presents a general solution
16790 method which requires $ O(n^3) $ time for dense graphs
16791 with $n$ vertices and considerably less time for sparse
16792 graphs. The paper also presents a decomposition method
16793 which solves a path problem by breaking it into
16794 subproblems, solving each subproblem by elimination,
16795 and combining the solutions. This method is a
16796 generalization of the `reducibility' notion of data
16797 flow analysis, and is a kind of single-element
16798 `tearing'. Efficiently implemented, the method requires
16799 $ O(m \alpha (m, n)) $ time plus time to solve the
16800 subproblems, for problem graphs with n vertices and m
16801 edges. Here $ \alpha (m, n)$ is a very slowly growing
16802 function which is a functional inverse of Ackermann's
16803 function. The paper considers variants of the axiom
16804 system for which the solution methods still work, and
16805 presents several applications including solving
16806 simultaneous linear equations and analyzing control
16807 flow in computer programs.",
16808 acknowledgement = ack-nhfb,
16809 pdfpages = "45",
16810 xxnumber = "CS-TR-75-528",
16811 }
16812
16813 @TechReport{Bentley:1975:FAC,
16814 author = "J. L. Bentley and J. H. Friedman",
16815 title = "Fast Algorithms for Constructing Minimal Spanning
16816 Trees in Coordinate Spaces",
16817 type = "Technical Report",
16818 number = "STAN-CS-75-529 (SLACP-1665)",
16819 institution = inst-STAN-CS,
16820 address = inst-STAN-CS:adr,
16821 pages = "29",
16822 month = nov,
16823 year = "1975",
16824 bibdate = "Fri Nov 21 14:21:14 2025",
16825 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
16826 URL = "",
16827 acknowledgement = ack-nhfb,
16828 }
16829
16830 @TechReport{Lentini:1975:AFD,
16831 author = "M. Lentini and Victor Pereyra",
16832 title = "An adaptive finite difference solver for nonlinear two
16833 point boundary problems with mild boundary layers",
16834 type = "Technical Report",
16835 number = "STAN-CS-75-530 (SU326 P30-40)",
16836 institution = inst-STAN-CS,
16837 address = inst-STAN-CS:adr,
16838 pages = "42",
16839 month = nov,
16840 year = "1975",
16841 bibdate = "Fri Nov 7 07:00:05 MST 2025",
16842 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
16843 URL = "http://i.stanford.edu/TR/CS-TR-75-530.html",
16844 abstract = "A variable order variable step finite difference
16845 algorithm for approximately solving m-dimensional
16846 systems of the form y' = f(t,y), t $ \in $ [a,b]
16847 subject to the nonlinear boundary conditions
16848 g(y(a),y(b)) = 0 is presented. A program, PASVAR,
16849 implementing these ideas has been written and the
16850 results on several test runs are presented together
16851 with comparisons with other methods. The main features
16852 of the new procedure are: (a) Its ability to produce
16853 very precise global error estimates, which in turn
16854 allow a very fine control between desired tolerance and
16855 actual output precision. (b) Non-uniform meshes allow
16856 an economical and accurate treatment of boundary layers
16857 and other sharp changes in the solutions. (c) The
16858 combination of automatic variable order (via deferred
16859 corrections) and automatic (adaptive) mesh selection
16860 produces, as in the case of initial value problem
16861 solvers, a versatile, robust, and efficient
16862 algorithm.",
16863 acknowledgement = ack-nhfb,
16864 pdfpages = "43",
16865 xxnumber = "CS-TR-75-530",
16866 }
16867
16868 @TechReport{Rose:1975:AAV,
16869 author = "Donald J. Rose and Robert Endre Tarjan",
16870 title = "Algorithmic aspects of vertex elimination on directed
16871 graphs",
16872 type = "Technical Report",
16873 number = "STAN-CS-75-531 (AD-A020847)",
16874 institution = inst-STAN-CS,
16875 address = inst-STAN-CS:adr,
16876 pages = "45",
16877 month = nov,
16878 year = "1975",
16879 bibdate = "Fri Nov 7 07:00:05 MST 2025",
16880 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
16881 URL = "http://i.stanford.edu/TR/CS-TR-75-531.html",
16882 abstract = "We consider a graph-theoretic elimination process
16883 which is related to performing Gaussian elimination on
16884 sparse systems of linear equations. We give efficient
16885 algorithms to: (1) calculate the fill-in produced by
16886 any elimination ordering; (2) find a perfect
16887 elimination ordering if one exists; and (3) find a
16888 minimal elimination ordering. We also show that
16889 problems (1) and (2) are at least as time-consuming as
16890 testing whether a directed graph is transitive, and
16891 that the problem of finding a minimum ordering is
16892 NP-complete.",
16893 acknowledgement = ack-nhfb,
16894 pdfpages = "45",
16895 xxnumber = "CS-TR-75-531",
16896 }
16897
16898 @TechReport{Jacobs:1975:BCS,
16899 author = "Patricia E. Jacobs",
16900 title = "Bibliography of {Computer Science Department}
16901 technical reports",
16902 type = "Technical Report",
16903 number = "STAN-CS-75-532",
16904 institution = inst-STAN-CS,
16905 address = inst-STAN-CS:adr,
16906 pages = "??",
16907 month = nov,
16908 year = "1975",
16909 bibdate = "Fri Nov 7 07:00:05 MST 2025",
16910 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
16911 URL = "http://i.stanford.edu/TR/CS-TR-75-532.html",
16912 abstract = "This report lists, in chronological order, all reports
16913 from the Stanford Computer Science series
16914 (STAN-CS-xx-xxx), Artificial Intelligence Memos (AIM),
16915 Digital Systems Laboratory Technical reports (TR) and
16916 Technical Notes (TN), plus Stanford Linear Accelerator
16917 Center publications (SLACP) and reports (SLACR). Also,
16918 for the first time, we have provided an author index
16919 for these reports (at the end of the report listings).
16920 The bibliography issued in October of 1973 is hereby
16921 brought up to date. Each report is identified by title,
16922 author's name, National Technical Information Service
16923 (NTIS) retrieval number, date, number of pages and the
16924 computer science areas treated. Subsequent journal
16925 publication (when known) is also indicated.",
16926 acknowledgement = ack-nhfb,
16927 pdfpages = "79",
16928 xxnumber = "CS-TR-75-532",
16929 }
16930
16931 @TechReport{Concus:1976:GCG,
16932 author = "Paul Concus and Gene H. Golub and Dianne Prost
16933 O'Leary",
16934 title = "A Generalized Conjugate Gradient Method for the
16935 Numerical Solution of Elliptic Partial Differential
16936 Equations",
16937 type = "Technical Report",
16938 number = "STAN-CS-76-533 (LBL-4604, SU326 P30-44)",
16939 institution = inst-STAN-CS,
16940 address = inst-STAN-CS:adr,
16941 pages = "24",
16942 month = jan,
16943 year = "1976",
16944 bibdate = "Fri Nov 7 07:00:05 MST 2025",
16945 bibsource = "https://www.math.utah.edu/pub/bibnet/authors/g/golub-gene-h.bib;
16946 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
16947 URL = "http://i.stanford.edu/TR/CS-TR-76-533.html",
16948 abstract = "We consider a generalized conjugate gradient method
16949 for solving sparse, symmetric, positive-definite
16950 systems of linear equations, principally those arising
16951 from the discretization of boundary value problems for
16952 elliptic partial differential equations. The method is
16953 based on splitting off from the original coefficient
16954 matrix a symmetric, positive-definite one that
16955 corresponds to a more easily solvable system of
16956 equations, and then accelerating the associated
16957 iteration using conjugate gradients. Optimality and
16958 convergence properties are presented, and the relation
16959 to other methods is discussed. Several splittings for
16960 which the method seems particularly effective are also
16961 discussed, and for some, numerical examples are
16962 given.",
16963 acknowledgement = ack-nhfb,
16964 author-dates = "Gene Howard Golub (February 29, 1932--November 16,
16965 2007)",
16966 pdfpages = "30",
16967 xxnumber = "CS-TR-76-533",
16968 }
16969
16970 @TechReport{Hemphill:1976:CAA,
16971 author = "Linda G. Hemphill",
16972 title = "A Conceptual Approach to Automatic Language
16973 Understanding and Belief Structures: With
16974 Disambiguation of the Word {``For''}",
16975 type = "Technical Report",
16976 number = "STAN-CS-76-534 (AIM-273)",
16977 institution = inst-STAN-CS,
16978 address = inst-STAN-CS:adr,
16979 pages = "254",
16980 month = jan,
16981 year = "1976",
16982 bibdate = "Fri Nov 21 14:21:14 2025",
16983 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
16984 URL = "",
16985 acknowledgement = ack-nhfb,
16986 remark = "This is the author's thesis.",
16987 }
16988
16989 @TechReport{Grossman:1975:IGO,
16990 author = "David D. Grossman and Russell H. Taylor",
16991 title = "Interactive generation of object models with a
16992 manipulator",
16993 type = "Technical Report",
16994 number = "STAN-CS-75-536",
16995 institution = inst-STAN-CS,
16996 address = inst-STAN-CS:adr,
16997 pages = "??",
16998 month = dec,
16999 year = "1975",
17000 bibdate = "Fri Nov 7 07:00:05 MST 2025",
17001 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
17002 URL = "http://i.stanford.edu/TR/CS-TR-75-536.html",
17003 abstract = "Manipulator programs in a high level language consist
17004 of manipulation procedures and object model
17005 declarations. As higher level languages are developed,
17006 the procedures will shrink while the declarations will
17007 grow. This trend makes it desirable to develop means
17008 for automating the generation of these declarations. A
17009 system is proposed which would permit users to specify
17010 certain object models interactively, using the
17011 manipulator itself as a measuring tool in three
17012 dimensions. A preliminary version of the system has
17013 been tested.",
17014 acknowledgement = ack-nhfb,
17015 pdfpages = "34",
17016 xxnumber = "CS-TR-75-536",
17017 }
17018
17019 @TechReport{Bolles:1975:VVW,
17020 author = "Robert C. Bolles",
17021 title = "{Verification Vision} within a programmable assembly
17022 system: an introductory discussion",
17023 type = "Technical Report",
17024 number = "STAN-CS-75-537",
17025 institution = inst-STAN-CS,
17026 address = inst-STAN-CS:adr,
17027 pages = "??",
17028 month = dec,
17029 year = "1975",
17030 bibdate = "Fri Nov 7 07:00:05 MST 2025",
17031 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
17032 URL = "http://i.stanford.edu/TR/CS-TR-75-537.html",
17033 abstract = "This paper defines a class of visual feedback tasks
17034 called `Verification Vision' which includes a
17035 significant portion of the feedback tasks required
17036 within a programmable assembly system. It characterizes
17037 a set of general-purpose capabilities which, if
17038 implemented, would provide a user with a system in
17039 which to write programs to perform such tasks. Example
17040 tasks and protocols are used to motivate these semantic
17041 capabilities. Of particular importance are the tools
17042 required to extract as much information as possible
17043 from planning and/or training sessions. Four different
17044 levels of verification systems are discussed. They
17045 range from a straightforward interactive system which
17046 could handle a subset of the verification vision tasks,
17047 to a completely automatic system which could plan its
17048 own strategies and handle the total range of
17049 verification tasks. Several unsolved problems in the
17050 area are discussed.",
17051 acknowledgement = ack-nhfb,
17052 pdfpages = "88",
17053 xxnumber = "CS-TR-75-537",
17054 }
17055
17056 @TechReport{Knuth:1976:ASF,
17057 author = "Donald E. Knuth and L. {Trabb Pardo}",
17058 title = "Analysis of a Simple Factorization Algorithm",
17059 type = "Technical Report",
17060 number = "STAN-CS-76-538 (AD-A024416)",
17061 institution = inst-STAN-CS,
17062 address = inst-STAN-CS:adr,
17063 pages = "43",
17064 month = jan,
17065 year = "1976",
17066 DOI = "https://doi.org/10.1016/0304-3975(76)90050-5",
17067 bibdate = "Fri Nov 21 14:21:14 2025",
17068 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
17069 URL = "https://apps.dtic.mil/sti/tr/pdf/ADA024416.pdf",
17070 abstract = "The probability that the $k$-th largest prime factor
17071 of a number $n$ is at most $n$ is shown to approach a
17072 limit, $ F_k(x)$ as $ n \to \infty $. Several
17073 interesting properties of $ F_(x)$ are explored, and
17074 numerical tables are given. These results are applied
17075 to the analysis of an algorithm commonly used to find
17076 all prime factors of a given number. The average number
17077 of digits in the $k$-th largest prime factor of a
17078 random $m$-digit number is shown to be asymptotically
17079 equivalent to the average length of the $k$-th longest
17080 cycle in a permutation on $m$ objects.",
17081 acknowledgement = ack-nhfb,
17082 keywords = "asymptotic methods; cycle lengths in random
17083 permutation; Dickman's function; prime factors;
17084 probability distributions in number theory.",
17085 pdfpages = "51",
17086 remark = "Published in \booktitle{Theoretical Computer Science}
17087 {\bf 3}(3) 321--348, December 1974.",
17088 }
17089
17090 @TechReport{Manna:1975:NAR,
17091 author = "Zohar Manna and Adi Shamir",
17092 title = "A new approach to recursive programs",
17093 type = "Technical Report",
17094 number = "STAN-CS-75-539 (AIM-276, AD-A021055/9WC)",
17095 institution = inst-STAN-CS,
17096 address = inst-STAN-CS:adr,
17097 pages = "30",
17098 month = dec,
17099 year = "1975",
17100 bibdate = "Fri Nov 7 07:00:05 MST 2025",
17101 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
17102 URL = "http://i.stanford.edu/TR/CS-TR-75-539.html",
17103 abstract = "In this paper we critically evaluate the classical
17104 least-fixedpoint approach towards recursive programs.
17105 We suggest a new approach which extracts the maximal
17106 amount of valuable information embedded in the
17107 programs. The presentation is informal, with emphasis
17108 on examples.",
17109 acknowledgement = ack-nhfb,
17110 pdfpages = "30",
17111 xxnumber = "CS-TR-75-539",
17112 }
17113
17114 @TechReport{Friedman:1976:AFB,
17115 author = "Jerome Friedman and Jon Louis Bentley and Raphael Ari
17116 Finkel",
17117 title = "An Algorithm for Finding Best Matches in Logarithmic
17118 Expected Time",
17119 type = "Technical Report",
17120 number = "STAN-CS-75-482 (SLACP-1549)",
17121 institution = inst-STAN-CS,
17122 address = inst-STAN-CS:adr,
17123 pages = "??",
17124 month = jul,
17125 year = "1976",
17126 bibdate = "Fri Nov 7 07:00:05 MST 2025",
17127 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
17128 note = "Original version February 1975. Revised December 1975
17129 and July 1976.",
17130 URL = "http://i.stanford.edu/TR/CS-TR-75-482.html",
17131 abstract = "An algorithm and data structure are presented for
17132 searching a file containing $N$ records, each described
17133 by $k$ real valued keys, for the $m$ closest matches or
17134 nearest neighbors to a given query record. The
17135 computation required to organize the file is
17136 proportional to $ k N \log N$. The expected number of
17137 records examined in each search is independent of the
17138 file size. The expected computation to perform each
17139 search is proportional to $ \log N$. Empirical evidence
17140 suggests that except for very small files, this
17141 algorithm is considerably faster than other methods.",
17142 acknowledgement = ack-nhfb,
17143 pdfpages = "20",
17144 xxnumber = "CS-TR-75-482",
17145 }
17146
17147 @TechReport{Davis:1976:SCS,
17148 author = "Randall Davis and Margaret H. Wright",
17149 title = "{Stanford Computer Science Department} research
17150 report",
17151 type = "Technical Report",
17152 number = "STAN-CS-76-405",
17153 institution = inst-STAN-CS,
17154 address = inst-STAN-CS:adr,
17155 pages = "??",
17156 month = jan,
17157 year = "1976",
17158 bibdate = "Fri Nov 7 07:00:05 MST 2025",
17159 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
17160 URL = "http://i.stanford.edu/TR/CS-TR-76-405.html",
17161 abstract = "This collection of reports is divided into two
17162 sections. The first contains the research summaries for
17163 individual faculty members and research associates in
17164 the Computer Science Department. Two professors from
17165 Electrical Engineering are included as `Affiliated
17166 Faculty' because their interests are closely related to
17167 those of the Department. The second section gives an
17168 overview of the activities of research groups in the
17169 Department. `Group' here is taken to imply many
17170 different things, including people related by various
17171 degrees of intellectual interests, physical proximity,
17172 or funding considerations. We have tried to describe
17173 any group whose scope of interest is greater than that
17174 of one person. The list of recent publications for each
17175 is not intended to be comprehensive, but rather to give
17176 a feeling for the range of topics considered. This
17177 collection of reports has been assembled to provide a
17178 reasonably comprehensive review of research activities
17179 in the Department. We hope that it will be widely
17180 useful --- in particular, students in the Department
17181 may find it helpful in discovering interesting projects
17182 and possible thesis topics. We expect also that it will
17183 be of interest to many other people, both within and
17184 outside the Department.",
17185 acknowledgement = ack-nhfb,
17186 pdfpages = "47",
17187 xxnumber = "CS-TR-76-405",
17188 }
17189
17190 @TechReport{Concus:1976:GCGb,
17191 author = "Paul Concus and Gene H. Golub",
17192 title = "A Generalized {Conjugate Gradient} Method for
17193 Nonsymmetric Systems of Linear Equations",
17194 type = "Technical Report",
17195 number = "STAN-CS-76-535",
17196 institution = inst-STAN-CS,
17197 address = inst-STAN-CS:adr,
17198 pages = "12",
17199 month = jan,
17200 year = "1976",
17201 bibdate = "Fri Nov 7 07:00:05 MST 2025",
17202 bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Parallel/par.lin.alg.bib;
17203 https://www.math.utah.edu/pub/bibnet/authors/g/golub-gene-h.bib;
17204 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
17205 URL = "http://i.stanford.edu/TR/CS-TR-76-535.html",
17206 abstract = "We consider a generalized conjugate gradient method
17207 for solving systems of linear equations having
17208 nonsymmetric coefficient matrices with
17209 positive-definite symmetric part. The method is based
17210 on splitting the matrix into its symmetric and
17211 skew-symmetric parts, and then accelerating the
17212 associated iteration using conjugate gradients, which
17213 simplifies in this case, as only one of the two usual
17214 parameters is required. The method is most effective
17215 for cases in which the symmetric part of the matrix
17216 corresponds to an easily solvable system of equations.
17217 Convergence properties are discussed, as well as an
17218 application to the numerical solution of elliptic
17219 partial differential equations.",
17220 acknowledgement = ack-nhfb,
17221 author-dates = "Gene Howard Golub (February 29, 1932--November 16,
17222 2007)",
17223 pdfpages = "16",
17224 xxnumber = "CS-TR-76-535",
17225 }
17226
17227 @TechReport{Graham:1976:ACM,
17228 author = "Ronald L. Graham and Andrew Chi-Chih Yao and F.
17229 Frances Yao",
17230 title = "Addition chains with multiplicative cost",
17231 type = "Technical Report",
17232 number = "STAN-CS-76-540 (AD-A021587)",
17233 institution = inst-STAN-CS,
17234 address = inst-STAN-CS:adr,
17235 pages = "7",
17236 month = jan,
17237 year = "1976",
17238 bibdate = "Fri Nov 7 07:00:05 MST 2025",
17239 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
17240 URL = "http://i.stanford.edu/TR/CS-TR-76-540.html",
17241 abstract = "If each step in an addition chain is assigned a cost
17242 equal to the product of the numbers added at that step,
17243 `binary' addition chains are shown to minimize total
17244 cost.",
17245 acknowledgement = ack-nhfb,
17246 author-dates = "Ronald Lewis Graham (31 October 1935--6 July 2020)",
17247 pdfpages = "8",
17248 xxnumber = "CS-TR-76-540",
17249 }
17250
17251 @TechReport{Knuth:1976:MCS,
17252 author = "Donald E. Knuth",
17253 title = "Mathematics and Computer Science: Coping with
17254 Finiteness",
17255 type = "Technical Report",
17256 number = "STAN-CS-76-541",
17257 institution = inst-STAN-CS,
17258 address = inst-STAN-CS:adr,
17259 pages = "30",
17260 month = mar,
17261 year = "1976",
17262 DOI = "https://doi.org/10.1126/science.194.4271.1235",
17263 bibdate = "Fri Nov 21 14:21:14 2025",
17264 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
17265 URL = "",
17266 abstract = "By presenting these examples, I have tried to
17267 illustrate four main points. (1) Finite numbers can be
17268 really enormous, and the known universe is very small.
17269 Therefore the distinction between finite and infinite
17270 is not as relevant as the distinction between realistic
17271 and unrealistic. (2) In many cases there are subtle
17272 ways to solve very large problems quickly, in spite of
17273 the fact that they appear at first to require
17274 examination of too many possibilities. (3) There are
17275 also cases where we can prove that a fairly natural
17276 problem is intrinsically hard, far beyond our
17277 conceivable capabilities. (4) It takes a good deal of
17278 skill to decide whether a given problem is in the easy
17279 or hard class; but even if a problem does turn out to
17280 be hard there are useful and interesting ways to change
17281 it into one that can be done satisfactorily",
17282 acknowledgement = ack-nhfb,
17283 remark = "Published in \booktitle{Science}, {\bf 194}(4271)
17284 1235--1242, 17 December 1976,
17285 doi:10.1126/science.194.4271.1235, and
17286 \booktitle{Fiz.-Mat. Spis. Bulgar. Akad. Nauk.}, {\bf
17287 21(54)}(1) 58--74, 1982.",
17288 }
17289
17290 @TechReport{Manna:1976:TAO,
17291 author = "Zohar Manna and Adi Shamir",
17292 title = "The theoretical aspects of the optimal fixedpoint",
17293 type = "Technical Report",
17294 number = "STAN-CS-76-542 (AIM-277, AD-A027454)",
17295 institution = inst-STAN-CS,
17296 address = inst-STAN-CS:adr,
17297 pages = "iv + 22",
17298 month = mar,
17299 year = "1976",
17300 bibdate = "Fri Nov 7 07:00:05 MST 2025",
17301 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
17302 URL = "http://i.stanford.edu/TR/CS-TR-76-542.html",
17303 abstract = "In this paper we define a new type of fixedpoint of
17304 recursive definitions and investigate some of its
17305 properties. This optimal fixedpoint (which always
17306 uniquely exists) contains, in some sense, the maximal
17307 amount of `interesting' information which can be
17308 extracted from the recursive definition, and it may be
17309 strictly more defined than the program's least
17310 fixedpoint. This fixedpoint can be the basis for
17311 assigning a new semantics to recursive programs. This
17312 is a modified and extended version of part 1 of a paper
17313 presented at the Symposium on Theory of Computing,
17314 Albuquerque, New Mexico (May 1975).",
17315 acknowledgement = ack-nhfb,
17316 pdfpages = "26",
17317 xxnumber = "CS-TR-76-542, AIM-277",
17318 }
17319
17320 @TechReport{Zave:1976:OPS,
17321 author = "Derek A. Zave",
17322 title = "Optimal polyphase sorting",
17323 type = "Technical Report",
17324 number = "STAN-CS-76-543",
17325 institution = inst-STAN-CS,
17326 address = inst-STAN-CS:adr,
17327 pages = "??",
17328 month = mar,
17329 year = "1976",
17330 bibdate = "Fri Nov 7 07:00:05 MST 2025",
17331 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
17332 URL = "http://i.stanford.edu/TR/CS-TR-76-543.html",
17333 abstract = "A read-forward polyphase merge algorithm is described
17334 which performs the polyphase merge starting from an
17335 arbitrary string distribution. This algorithm minimizes
17336 the volume of information moved. Since this volume is
17337 easily computed, it is possible to construct dispersion
17338 algorithms which anticipate the merge algorithm. Two
17339 such dispersion techniques are described. The first
17340 algorithm requires that the number of strings to be
17341 dispersed be known in advance; this algorithm is
17342 optimal. The second algorithm makes no such
17343 requirement, but is not always optimal. In addition,
17344 performance estimates are derived and both algorithms
17345 are shown to be asymptotically optimal.",
17346 acknowledgement = ack-nhfb,
17347 pdfpages = "80",
17348 xxnumber = "CS-TR-76-543",
17349 }
17350
17351 @TechReport{Mont-Reynaud:1976:RTA,
17352 author = "Bernard Mont-Reynaud",
17353 title = "Removing trivial assignments from programs",
17354 type = "Technical Report",
17355 number = "STAN-CS-76-544",
17356 institution = inst-STAN-CS,
17357 address = inst-STAN-CS:adr,
17358 pages = "??",
17359 month = mar,
17360 year = "1976",
17361 bibdate = "Fri Nov 7 07:00:05 MST 2025",
17362 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
17363 URL = "http://i.stanford.edu/TR/CS-TR-76-544.html",
17364 abstract = "An assignment X $ \leftarrow $ Y in a program is
17365 `trivial' when both X and Y are simple program
17366 variables. The paper describes a transformation which
17367 removes all such assignments from a program P,
17368 producing a program P' which executes faster than P but
17369 usually has a larger size. The number of variables used
17370 by P' is also minimized. Worst-case analysis of the
17371 transformation algorithm leads to nonpolynomial bounds.
17372 Such inefficiency, however, does not arise in typical
17373 situations, and the technique appears to be of interest
17374 for practical compiler optimization.",
17375 acknowledgement = ack-nhfb,
17376 pdfpages = "38",
17377 xxnumber = "CS-TR-76-544",
17378 }
17379
17380 @TechReport{Paul:1976:SBG,
17381 author = "Wolfgang J. Paul and Robert Endre Tarjan and James R.
17382 Celoni",
17383 title = "Space bounds for a game on graphs",
17384 type = "Technical Report",
17385 number = "STAN-CS-76-545",
17386 institution = inst-STAN-CS,
17387 address = inst-STAN-CS:adr,
17388 pages = "i + 21",
17389 month = mar,
17390 year = "1976",
17391 bibdate = "Fri Nov 7 07:00:05 MST 2025",
17392 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
17393 URL = "http://i.stanford.edu/pub/cstr/reports/cs/tr/76/545/CS-TR-76-545.pdf;
17394 http://i.stanford.edu/TR/CS-TR-76-545.html",
17395 abstract = "We study a one-person game played by placing pebbles,
17396 according to certain rules, on the vertices of a
17397 directed graph. In [John Hopcroft, W. Paul, and L.
17398 Valiant, `On time versus space and related problems,'
17399 Proc. 16th Annual Symposium on Foundations of Computer
17400 Science (1975), pp.57--64] it was shown that for each
17401 graph with $n$ vertices and maximum in-degree $d$,
17402 there is a pebbling strategy which requires at most $
17403 c(d) n \log n$ pebbles. Here we show that this bound is
17404 tight to within a constant factor. We also analyze a
17405 variety of pebbling algorithms, including one which
17406 achieves the $ O(n \log n)$ bound.",
17407 acknowledgement = ack-nhfb,
17408 pdfpages = "22",
17409 xxnumber = "CS-TR-76-545",
17410 }
17411
17412 @TechReport{Baskett:1976:DLC,
17413 author = "F. Baskett and L. Sustek",
17414 title = "The Design of a Low Cost Video Graphics Terminal",
17415 type = "Technical Report",
17416 number = "STAN-CS-76-546 (SLACP-1715)",
17417 institution = inst-STAN-CS,
17418 address = inst-STAN-CS:adr,
17419 pages = "25",
17420 month = mar,
17421 year = "1976",
17422 bibdate = "Fri Nov 21 14:21:14 2025",
17423 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
17424 URL = "",
17425 acknowledgement = ack-nhfb,
17426 remark = "No PDF in NTRL archive.",
17427 }
17428
17429 @TechReport{Tarjan:1976:IAG,
17430 author = "Robert Endre Tarjan",
17431 title = "Iterative algorithms for global flow analysis",
17432 type = "Technical Report",
17433 number = "STAN-CS-76-547",
17434 institution = inst-STAN-CS,
17435 address = inst-STAN-CS:adr,
17436 pages = "??",
17437 month = mar,
17438 year = "1976",
17439 bibdate = "Fri Nov 7 07:00:05 MST 2025",
17440 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
17441 URL = "http://i.stanford.edu/TR/CS-TR-76-547.html",
17442 abstract = "This paper studies iterative methods for the global
17443 flow analysis of computer programs. We define a
17444 hierarchy of global flow problem classes, each solvable
17445 by an appropriate generalization of the `node listing'
17446 method of Kennedy. We show that each of these
17447 generalized methods is optimum, among all iterative
17448 algorithms, for solving problems within its class. We
17449 give lower bounds on the time required by iterative
17450 algorithms for each of the problem classes.",
17451 acknowledgement = ack-nhfb,
17452 pdfpages = "38",
17453 xxnumber = "CS-TR-76-547",
17454 }
17455
17456 @TechReport{OLeary:1976:HCG,
17457 author = "Dianne Prost O'Leary",
17458 title = "Hybrid Conjugate Gradient Algorithms",
17459 type = "Technical Report",
17460 number = "STAN-CS-76-548",
17461 institution = inst-STAN-CS,
17462 address = inst-STAN-CS:adr,
17463 pages = "120",
17464 month = mar,
17465 year = "1976",
17466 bibdate = "Fri Nov 21 14:21:14 2025",
17467 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
17468 URL = "",
17469 acknowledgement = ack-nhfb,
17470 remark = "This is the author's thesis.",
17471 }
17472
17473 @TechReport{Luckham:1976:APV,
17474 author = "David C. Luckham and Norihisa Suzuki",
17475 title = "Automatic program verification V:
17476 verification-oriented proof rules for arrays, records
17477 and pointers",
17478 type = "Technical Report",
17479 number = "STAN-CS-76-549 (AIM-278, AD-A027455)",
17480 institution = inst-STAN-CS,
17481 address = inst-STAN-CS:adr,
17482 pages = "??",
17483 month = mar,
17484 year = "1976",
17485 bibdate = "Fri Nov 7 07:00:05 MST 2025",
17486 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
17487 URL = "http://i.stanford.edu/TR/CS-TR-76-549.html",
17488 abstract = "A practical method is presented for automating in a
17489 uniform way the verification of Pascal programs that
17490 operate on the standard Pascal data structures ARRAY,
17491 RECORD, and POINTER. New assertion language primitives
17492 are introduced for describing computational effects of
17493 operations on these data structures. Axioms defining
17494 the semantics of the new primitives are given. Proof
17495 rules for standard Pascal operations on pointer
17496 variables are then defined in terms of the extended
17497 assertion language. Similar rules for records and
17498 arrays are special cases. An extensible axiomatic rule
17499 for the Pascal memory allocation operation, NEW, is
17500 also given. These rules have been implemented in the
17501 Stanford Pascal program verifier. Examples illustrating
17502 the verification of programs which operate on list
17503 structures implemented with pointers and records are
17504 discussed. These include programs with side-effects.",
17505 acknowledgement = ack-nhfb,
17506 pdfpages = "52",
17507 xxnumber = "CS-TR-76-549",
17508 }
17509
17510 @TechReport{Tarjan:1976:FMI,
17511 author = "Robert Endre Tarjan and Anthony E. Trojanowski",
17512 title = "Finding a maximum independent set",
17513 type = "Technical Report",
17514 number = "STAN-CS-76-550",
17515 institution = inst-STAN-CS,
17516 address = inst-STAN-CS:adr,
17517 pages = "??",
17518 month = jun,
17519 year = "1976",
17520 bibdate = "Fri Nov 7 07:00:05 MST 2025",
17521 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
17522 URL = "http://i.stanford.edu/TR/CS-TR-76-550.html",
17523 abstract = "We present an algorithm which finds a maximum
17524 independent set in an n-vertex graph in 0($ 2^{n / 3}$)
17525 time. The algorithm can thus handle graphs roughly
17526 three times as large as could be analyzed using a naive
17527 algorithm.",
17528 acknowledgement = ack-nhfb,
17529 pdfpages = "23",
17530 xxnumber = "CS-TR-76-550",
17531 }
17532
17533 @TechReport{Knuth:1976:SACb,
17534 author = "Donald E. Knuth",
17535 title = "The state of the {Art of Computer Programming}",
17536 type = "Technical Report",
17537 number = "STAN-CS-76-551 (AD-A032347)",
17538 institution = inst-STAN-CS,
17539 address = inst-STAN-CS:adr,
17540 pages = "??",
17541 day = "1",
17542 month = jun,
17543 year = "1976",
17544 bibdate = "Fri Nov 7 07:00:05 MST 2025",
17545 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
17546 URL = "http://i.stanford.edu/TR/CS-TR-76-551.html;
17547 http://www-db.stanford.edu/TR/CS-TR-76-551.html;
17548 http://www.ncstrl.org:8900/ncstrl/servlet/search?formname=detail&id=oai%3Ancstrlh%3Astan%3ASTAN%2F%2FCS-TR-76-551",
17549 abstract = "This report lists all corrections and changes to
17550 volumes 1 and 3 of ``The Art of Computer Programming,''
17551 as of May 14, 1976. The changes apply to the most
17552 recent printings of both volumes (February and March,
17553 1975); if you have an earlier printing there have been
17554 many other changes not indicated here.",
17555 acknowledgement = ack-nhfb,
17556 documentid = "oai:ncstrlh:stan:STAN//CS-TR-76-551",
17557 pdfpages = "60",
17558 xxnumber = "CS-TR-76-551",
17559 }
17560
17561 @TechReport{Suzuki:1976:AVP,
17562 author = "Norihsa Suzuki",
17563 title = "Automatic Verification of Programs with Complex Data
17564 Structures",
17565 type = "Technical Report",
17566 number = "STAN-CS-76-552 (AIM-279)",
17567 institution = inst-STAN-CS,
17568 address = inst-STAN-CS:adr,
17569 pages = "194",
17570 month = feb,
17571 year = "1976",
17572 bibdate = "Fri Nov 21 14:21:14 2025",
17573 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
17574 URL = "",
17575 acknowledgement = ack-nhfb,
17576 remark = "This is the author's thesis.",
17577 }
17578
17579 @TechReport{Tarjan:1976:CMN,
17580 author = "Robert Endre Tarjan",
17581 title = "Complexity of monotone networks for computing
17582 conjunctions",
17583 type = "Technical Report",
17584 number = "STAN-CS-76-553 (AD-A032772)",
17585 institution = inst-STAN-CS,
17586 address = inst-STAN-CS:adr,
17587 pages = "21",
17588 month = jun,
17589 year = "1976",
17590 bibdate = "Fri Nov 7 07:00:05 MST 2025",
17591 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
17592 URL = "http://i.stanford.edu/TR/CS-TR-76-553.html",
17593 abstract = "Let $ F_1 $, $ F_2 $, \ldots{}, $ F_m $ be a set of
17594 Boolean functions of the form $ F_i $ = $ \wedge $ {x$
17595 \in X_i $}, where $ \wedge $ denotes conjunction and
17596 each $ X_i $ is a subset of a set X of n Boolean
17597 variables. We study the size of monotone Boolean
17598 networks for computing such sets of functions. We
17599 exhibit anomalous sets of conjunctions whose smallest
17600 monotone networks contain disjunctions. We show that if
17601 |$ F_i $ | is sufficiently small for all i, such
17602 anomalies cannot happen. We exhibit sets of m
17603 conjunctions in n unknowns which require $ c_2 $ m$
17604 \alpha $ (m,n) binary conjunctions, where $ \alpha $
17605 (m,n) is a very slowly growing function related to a
17606 functional inverse of Ackermann's function. This class
17607 of examples shows that an algorithm given in
17608 [STAN-CS-75-512] for computing functions defined on
17609 paths in trees is optimum to within a constant
17610 factor.",
17611 acknowledgement = ack-nhfb,
17612 pdfpages = "25",
17613 xxnumber = "CS-TR-76-553",
17614 }
17615
17616 @TechReport{Yu:1976:MWB,
17617 author = "F. S. Yu",
17618 title = "Modeling the Write Behavior of Computer Programs",
17619 type = "Technical Report",
17620 number = "STAN-CS-76-554",
17621 institution = inst-STAN-CS,
17622 address = inst-STAN-CS:adr,
17623 pages = "185",
17624 month = jun,
17625 year = "1976",
17626 bibdate = "Fri Nov 21 14:21:14 2025",
17627 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
17628 URL = "",
17629 acknowledgement = ack-nhfb,
17630 remark = "This is the author's thesis.",
17631 }
17632
17633 @TechReport{Grossman:1976:MCS,
17634 author = "David D. Grossman",
17635 title = "{Monte Carlo} simulation of tolerancing in discrete
17636 parts manufacturing and assembly",
17637 type = "Technical Report",
17638 number = "STAN-CS-76-555 (AIM-280)",
17639 institution = inst-STAN-CS,
17640 address = inst-STAN-CS:adr,
17641 pages = "25",
17642 month = may,
17643 year = "1976",
17644 bibdate = "Fri Nov 7 07:00:05 MST 2025",
17645 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
17646 URL = "http://i.stanford.edu/TR/CS-TR-76-555.html",
17647 abstract = "The assembly of discrete parts is strongly affected by
17648 imprecise components, imperfect fixtures and tools, and
17649 inexact measurements. It is often necessary to design
17650 higher precision into the manufacturing and assembly
17651 process than is functionally needed in the final
17652 product. Production engineers must trade off between
17653 alternative ways of selecting individual tolerances in
17654 order to achieve minimum cost while preserving product
17655 integrity. This paper describes a comprehensive Monte
17656 Carlo method for systematically analysing the
17657 stochastic implications of tolerancing and related
17658 forms of imprecision. The method is illustrated by four
17659 examples, one of which is chosen from the field of
17660 assembly by computer controlled manipulators.",
17661 acknowledgement = ack-nhfb,
17662 pdfpages = "28",
17663 xxnumber = "CS-TR-76-555",
17664 }
17665
17666 @TechReport{Guibas:1976:AHA,
17667 author = "Leonidas John Guibas",
17668 title = "The Analysis of Hashing Algorithms",
17669 type = "Technical Report",
17670 number = "STAN-CS-76-556",
17671 institution = inst-STAN-CS,
17672 address = inst-STAN-CS:adr,
17673 pages = "136",
17674 month = aug,
17675 year = "1976",
17676 bibdate = "Fri Nov 21 14:21:14 2025",
17677 bibsource = "https://www.math.utah.edu/pub/tex/bib/hash.bib;
17678 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
17679 URL = "https://doc.lagout.org/science/0_Computer%20Science/0_Computer%20History/old-hardware/xerox/parc/techReports/CSL-76-3_The_Analysis_of_Hashing_Algorithms.pdf;
17680 https://en.wikipedia.org/wiki/Leonidas_J._Guibas;
17681 https://www.proquest.com/pqdtglobal/docview/302823644",
17682 abstract = "In this thesis we relate the performance of hashing
17683 algorithms to the notion of clustering, that is the
17684 pile-up phenomenon that occurs because many keys may
17685 probe the table locations in the same sequence. We will
17686 say that a hashing technique exhibits $k$-ary
17687 clustering if the search for a key begins with $k$
17688 independent random probes and the subsequent sequence
17689 of probes is completely determined by the location of
17690 the $k$ initial probes. Such techniques may be very
17691 bad; for instance, the average number of probes
17692 necessary for insertion may grow linearly with the
17693 table size. However, on the average (that is if the
17694 permutations describing the method are randomly
17695 chosen), $k$-ary clustering techniques for $ k > 1$ are
17696 very good. In fact the average performance is
17697 asymptotically equivalent to the performance of uniform
17698 probing, a method that exhibits no clustering and is
17699 known to be optimal in a certain sense.\par
17700
17701 Perhaps the most famous among tertiary clustering
17702 techniques is double hashing, the method in which we
17703 probe the hash table along arithmetic progressions
17704 where the initial element and the increment of the
17705 progression are chosen randomly and independently
17706 depending only on the key $K$ of the search. We prove
17707 that double hashing is also asymptotically equivalent
17708 to uniform probing for load factors a not exceeding a
17709 certain constant $ \alpha_0 = 0.31 \ldots $. Our proof
17710 method has a different flavor from those previously
17711 used in algorithmic analysis. We begin by showing that
17712 the tail of the hypergeometric distribution a fixed
17713 percent away from the mean is exponentially small. We
17714 use this result to prove that random subsets of the
17715 finite ring of integers modulo $m$ of cardinality am
17716 have always nearly the expected number of arithmetic
17717 progressions of length $k$, except with exponentially
17718 small probability. We then use this theorem to start up
17719 a process (called the extension process) of looking at
17720 snapshots of the table as it fills up with double
17721 hashing. Between steps of the extension process we can
17722 show that the effect of clustering is negligible, and
17723 that we therefore never depart too far from the truly
17724 random situation.",
17725 acknowledgement = ack-nhfb,
17726 remark = "This is the author's Ph.D. thesis.",
17727 }
17728
17729 @TechReport{Paterson:1976:IBF,
17730 author = "Michael S. Paterson",
17731 title = "An Introduction to {Boolean} Function Complexity",
17732 type = "Technical Report",
17733 number = "STAN-CS-76-557 (AD-A032122)",
17734 institution = inst-STAN-CS,
17735 address = inst-STAN-CS:adr,
17736 pages = "iv + 19",
17737 month = aug,
17738 year = "1976",
17739 bibdate = "Fri Nov 21 14:21:14 2025",
17740 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
17741 URL = "",
17742 abstract = "The ``complexity'' of a finite Boolean function may be
17743 defined with respect to its computation by networks of
17744 logical elements in a variety of ways. The three
17745 complexities of ``circuit size'', ``formula size'' and
17746 ``depth'' are considered, and some of the principal
17747 results concerning their relationships and estimations
17748 are presented, with outlined proofs for some of the
17749 simpler theorems. This survey is ruthlessly restricted
17750 to networks in which all two-argument logical functions
17751 may be used. A rich corpus of theory related to logical
17752 networks under a variety of restrictions may be found
17753 in the literature, but is apt to be confusing in a
17754 first introduction.",
17755 acknowledgement = ack-nhfb,
17756 keywords = "Boolean functions; complexity; depth; finite
17757 functions; formula size; logical networks",
17758 pdfpages = "23",
17759 }
17760
17761 @TechReport{Manna:1976:SSB,
17762 author = "Zohar Manna and Richard J. Waldinger",
17763 title = "Is ``sometime'' sometimes better than ``always''?
17764 {Intermittent} assertions in proving program
17765 correctness",
17766 type = "Technical Report",
17767 number = "STAN-CS-76-558 (AIM-281, AD-A031406)",
17768 institution = inst-STAN-CS,
17769 address = inst-STAN-CS:adr,
17770 pages = "v + 39",
17771 day = "16",
17772 month = jun,
17773 year = "1976",
17774 bibdate = "Sun Dec 14 07:08:15 2025",
17775 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
17776 URL = "https://apps.dtic.mil/sti/tr/pdf/ADA031406.pdf",
17777 abstract = "This paper explores a technique for proving the
17778 correctness and termination of programs simultaneously.
17779 This approach, which we call the {\em
17780 intermittent-assertion method}, involves documenting
17781 the program with assertions that must be true at some
17782 time when control is passing through the corresponding
17783 point, but that need not be true every time. The
17784 method, introduced by Knuth and further developed by
17785 Burstall, promises to provide a valuable complement to
17786 the more conventional methods.\par
17787
17788 We first introduce illustrate the technique with a
17789 number of examples. We then show that a correctness
17790 proof using the invariant assertion method or the
17791 subgoal induction method always be expressed using
17792 intermittent assertions instead, but that the reverse
17793 is not always the case. The method can also be used
17794 just to prove termination, and any proof of termination
17795 using the conventional we1l-founded sets approach can
17796 be rephrased as a proof using intermittent assertions.
17797 Finally, we show how the method can be applied to prove
17798 the validity of program transformations and the
17799 correctness of continuously operating programs",
17800 acknowledgement = ack-nhfb,
17801 pdfpages = "44",
17802 }
17803
17804 @TechReport{Manna:1977:SSB,
17805 author = "Zohar Manna and Richard J. Waldinger",
17806 title = "Is ``sometime'' sometimes better than ``always''?
17807 {Intermittent} assertions in proving program
17808 correctness",
17809 type = "Technical Report",
17810 number = "STAN-CS-76-558 (AIM-281.1, AD-A042507)",
17811 institution = inst-STAN-CS,
17812 address = inst-STAN-CS:adr,
17813 pages = "v + 38",
17814 month = mar,
17815 year = "1977",
17816 bibdate = "Fri Nov 21 14:21:14 2025",
17817 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
17818 note = "See also original version \cite{Manna:1976:SSB}.",
17819 URL = "http://i.stanford.edu/TR/CS-TR-76-558.html",
17820 abstract = "This paper explores a technique for proving the
17821 correctness and termination of programs simultaneously.
17822 This approach, which we call the intermittent-assertion
17823 method, involves documenting the program with
17824 assertions that must be true at some time when control
17825 passes through the corresponding point, but that need
17826 not be true every time. The method, introduced by
17827 Burstall, promises to provide a valuable complement to
17828 the more conventional methods.\par
17829
17830 We first introduce the intermittent-assertion method
17831 with a number of examples of correctness and
17832 termination proofs. Some of these proofs are markedly
17833 simpler than their conventional counterparts. On the
17834 other hand, we show that a proof of correctness or
17835 termination by any of the conventional techniques can
17836 be rephrased directly as a proof using intermittent
17837 assertions. Finally, we show how the intermittent
17838 assertion method can be applied to prove the validity
17839 of program transformations and the correctness of
17840 continuously operating programs.\par
17841
17842 This is a revised and simplified version of a previous
17843 paper with the same title (AIM-281, June 1976).",
17844 acknowledgement = ack-nhfb,
17845 pdfpages = "44",
17846 }
17847
17848 @TechReport{Golub:1976:RDL,
17849 author = "Gene H. Golub and Virginia C. Klema and Gilbert W.
17850 Stewart",
17851 title = "Rank degeneracy and least squares problems",
17852 type = "Technical Report",
17853 number = "STAN-CS-76-559 (AD-A032348)",
17854 institution = inst-STAN-CS,
17855 address = inst-STAN-CS:adr,
17856 pages = "38",
17857 month = aug,
17858 year = "1976",
17859 bibdate = "Fri Nov 7 07:00:05 MST 2025",
17860 bibsource = "https://www.math.utah.edu/pub/bibnet/authors/g/golub-gene-h.bib;
17861 https://www.math.utah.edu/pub/bibnet/authors/s/stewart-gilbert-w.bib;
17862 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
17863 URL = "http://i.stanford.edu/TR/CS-TR-76-559.html",
17864 abstract = "This paper is concerned with least squares problems
17865 when the least squares matrix $A$ is near a matrix that
17866 is not of full rank. A definition of numerical rank is
17867 given. It is shown that under certain conditions when A
17868 has numerical rank r there is a distinguished r
17869 dimensional subspace of the column space of $A$ that is
17870 insensitive to how it is approximated by $r$
17871 independent columns of A. The consequences of this fact
17872 for the least squares problem are examined. Algorithms
17873 are described for approximating the stable part of the
17874 column space of A.",
17875 acknowledgement = ack-nhfb,
17876 author-dates = "Gene Howard Golub (February 29, 1932--November 16,
17877 2007)",
17878 pdfpages = "42",
17879 xxnumber = "CS-TR-76-559",
17880 }
17881
17882 @TechReport{Taylor:1976:SMC,
17883 author = "Russell Taylor",
17884 title = "Synthesis of Manipulator Control Programs from
17885 Task-level Specifications",
17886 type = "Technical Report",
17887 number = "STAN-CS-76-560 (AIM-282)",
17888 institution = inst-STAN-CS,
17889 address = inst-STAN-CS:adr,
17890 pages = "229",
17891 month = jul,
17892 year = "1976",
17893 bibdate = "Fri Nov 21 14:21:14 2025",
17894 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
17895 URL = "",
17896 acknowledgement = ack-nhfb,
17897 remark = "This is the author's thesis.",
17898 }
17899
17900 @TechReport{Woods:1976:MPL,
17901 author = "Donald R. Woods",
17902 title = "{Mathematical Programming Language} --- user's guide",
17903 type = "Technical Report",
17904 number = "STAN-CS-76-561",
17905 institution = inst-STAN-CS,
17906 address = inst-STAN-CS:adr,
17907 pages = "??",
17908 month = aug,
17909 year = "1976",
17910 bibdate = "Fri Nov 7 07:00:05 MST 2025",
17911 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
17912 URL = "http://i.stanford.edu/TR/CS-TR-76-561.html",
17913 abstract = "Mathematical Programming Language (MPL) is a
17914 programming language specifically designed for the
17915 implementation of mathematical software and, in
17916 particular, experimental mathematical programming
17917 software. In the past there has been a wide gulf
17918 between the applied mathematicians who design
17919 mathematical algorithms (but often have little
17920 appreciation of the fine points of computing) and the
17921 professional programmer, who may have little or no
17922 understanding of the mathematics of the problem he is
17923 programming. The result is that a vast number of
17924 mathematical algorithms have been devised and
17925 published, with only a small fraction being actually
17926 implemented and experimentally compared on selected
17927 representative problems. MPL is designed to be as close
17928 as possible to the terminology used by the
17929 mathematician while retaining as far as possible
17930 programming sophistications which make for good
17931 software systems. The result is a programming language
17932 which (hopefully!) allows the writing of clear,
17933 concise, easily read programs, especially by persons
17934 who are not professional programmers.",
17935 acknowledgement = ack-nhfb,
17936 pdfpages = "140",
17937 xxnumber = "CS-TR-76-561",
17938 }
17939
17940 @TechReport{Knuth:1976:EDP,
17941 author = "Donald E. Knuth and L. {Trabb Pardo}",
17942 title = "The early development of programming languages",
17943 type = "Technical Report",
17944 number = "STAN-CS-76-562 (AD-A032123)",
17945 institution = inst-STAN-CS,
17946 address = inst-STAN-CS:adr,
17947 pages = "i + 109",
17948 month = aug,
17949 year = "1976",
17950 bibdate = "Thu Jan 11 16:54:37 2024",
17951 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
17952 URL = "https://bitsavers.org/pdf/stanford/cs_techReports/STAN-CS-76-562_EarlyDevelPgmgLang_Aug76.pdf",
17953 abstract = "This paper surveys the evolution of ``high level''
17954 programming languages during the first decade of
17955 computer programming activity. We discuss the
17956 contributions of Zuse (``Plankalkiul'', 1945),
17957 Goldstine/von Neumann (``Flow Diagrams'', 1946), Curry
17958 (``Composition'', 1948), Mauchly et al. (``Short
17959 Code'', 1950), Burks (``Intermediate PL'', 1950),
17960 Rutishauser (1951), Bohm (1951), Glennie (``AUTOCODE'',
17961 1952), Hopper et al. (``A-2'', 1953), Laning/Zierler
17962 (1953), Backus et al. (``FORTRAN'', 1954-1957), Brooker
17963 (``Mark I Autocode', 1954), Kemynin/Liubimskii
17964 (``mm-2'', 1954), Ershov (``mm'', 1955), Grems/Porter
17965 (``BACAIC'', 1955), Elsworth et al. (``Kompiler 2'',
17966 1955), Blum (``ADES'', 1956), Perlis et al. (``IT'',
17967 1956), Katz et al. (``MATH-MATIC'', 1956-1958), Hopper
17968 et al. (``FLOW-MATIC'', 1956-1958), Bauer/Samelson
17969 (1956-1958). The principal features of each
17970 contribution are illustrated; and for purposes of
17971 comparison, a particular fixed algorithm has been
17972 encoded (as far as possible) in each of the languages.
17973 This research is based primarily on unpublished source
17974 materials, and the authors hope that they have been
17975 able to compile a fairly complete picture of the early
17976 developments in this area.\par
17977
17978 This article was commissioned by the Encyclopedia of
17979 Computer Science and Technology, ed. by Jack Belzer,
17980 Albert G. Holzman, and Allen Kent, and it is scheduled
17981 to appear in vol. 6 or vol, 7 of that encyclopedia
17982 during 1977.",
17983 acknowledgement = ack-nhfb,
17984 pdfpages = "110",
17985 }
17986
17987 @TechReport{Russell:1976:SRA,
17988 author = "D. L. Russell",
17989 title = "State Restoration Among Communicating Processes",
17990 type = "Technical Report",
17991 number = "STAN-CS-76-563",
17992 institution = inst-STAN-CS,
17993 address = inst-STAN-CS:adr,
17994 pages = "173",
17995 month = aug,
17996 year = "1976",
17997 bibdate = "Fri Nov 21 14:21:14 2025",
17998 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
17999 URL = "",
18000 acknowledgement = ack-nhfb,
18001 remark = "This is the author's thesis.",
18002 }
18003
18004 @TechReport{Davis:1976:AML,
18005 author = "Randall Davis",
18006 title = "Applications of Meta Level Knowledge to the
18007 Construction, Maintenance and Use of Large Knowledge
18008 Bases",
18009 type = "Technical Report",
18010 number = "STAN-CS-76-564 (AIM-283, HPP-76-112)",
18011 institution = inst-STAN-CS,
18012 address = inst-STAN-CS:adr,
18013 pages = "304",
18014 month = jul,
18015 year = "1976",
18016 bibdate = "Fri Nov 21 14:21:14 2025",
18017 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
18018 URL = "",
18019 acknowledgement = ack-nhfb,
18020 remark = "This is the author's thesis.",
18021 }
18022
18023 @TechReport{Strikwerda:1976:IBV,
18024 author = "John Charles Strikwerda",
18025 title = "Initial Boundary Value Problems for Incompletely
18026 Parabolic Systems",
18027 type = "Technical Report",
18028 number = "STAN-CS-76-565 (AD-A032802)",
18029 institution = inst-STAN-CS,
18030 address = inst-STAN-CS:adr,
18031 pages = "iv + 107",
18032 month = oct,
18033 year = "1976",
18034 bibdate = "Fri Nov 21 14:21:14 2025",
18035 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
18036 URL = "https://apps.dtic.mil/sti/tr/pdf/ADA032802.pdf",
18037 abstract = "This thesis deals with initial boundary value problems
18038 for incompletely parabolic systems of partial
18039 differential equations. Such systems can be described
18040 as a second order Petrovskii parabolic system and a
18041 first order hyperbolic system coupled together by terms
18042 with first order spatial derivatives. The dependent
18043 variables are then of either parabolic or hyperbolic
18044 type. Examples are the equations for couple[d] sound
18045 and heat flow and the viscous shallow water
18046 equations.\par
18047
18048 The Cauchy problem for incompletely parabolic systems
18049 is well-posed and by means of the energy method we
18050 prove existence and uniqueness of the solution.\par
18051
18052 The method we use for the initial boundary value
18053 problem is similar to that used by Kreiss for strictly
18054 hyperbolic systems. We first treat systems with
18055 constant coefficients on a half-space. The boundary
18056 conditions are linear combinations of the dependent
18057 variables and many contain first derivatives of the
18058 variables of parabolic type. We obtain necessary and
18059 sufficient conditions for the initial boundary value
18060 problem to be well-posed when the coefficients are
18061 constant and the domain is a half-space. The
18062 appropriate norm involves weighting factors which
18063 accommodate both hyperbolic and parabolic
18064 variables.\par
18065
18066 The well-posedness is equivalent to the non-existence
18067 of eigensolutions. Eigensolutions are solutions to
18068 simpler problems than the original incompletely
18069 parabolic initial boundary value problem.
18070 Eigensolutions are of either parabolic or hyperbolic
18071 type and their presence indicates that the solution
18072 does not depend continuously on the boundary data in
18073 the appropriate norm. The conditions for the
18074 non-existence of eigensolutions are essentially
18075 algebraic in character.\par
18076
18077 We also consider incompletely parabolic systems with
18078 smooth coefficients on bounded domain with smooth
18079 boundary. We show that the initial boundary value
18080 problem is well-posed if certain constant coefficient
18081 problems on half-spaces are well-posed. This is carried
18082 out using freezing arguments which utilize
18083 G{\aa}rding's inequalities for pseudo-differential
18084 operators.\par
18085
18086 In the final chapter we develop a theory of
18087 pseudo-differential operators that depend on a
18088 parameter. This theory is used to prove the necessary
18089 G{\aa}rding's inequalities referred to above.\par
18090
18091 In an appendix we present some illustrations of the use
18092 of the methods presented in this thesis.",
18093 acknowledgement = ack-nhfb,
18094 advisor = "Joseph Oliger",
18095 pdfpages = "117",
18096 remark = "This is the author's Ph.D. thesis. No PDF in NTRL
18097 archive. Found in DTIC archive. The ADA032802 PDF file
18098 is OCR'ed scans of microfiche page images. No abstract
18099 is present in the thesis. The ADA032802 PDF file
18100 backmatter supplies an abstract.",
18101 }
18102
18103 @TechReport{Wright:1976:NMN,
18104 author = "Margaret Wright",
18105 title = "Numerical Methods for Nonlinearly Constrained
18106 Optimization",
18107 type = "Technical Report",
18108 number = "STAN-CS-76-566",
18109 institution = inst-STAN-CS,
18110 address = inst-STAN-CS:adr,
18111 pages = "262",
18112 month = nov,
18113 year = "1976",
18114 bibdate = "Fri Nov 21 14:21:14 2025",
18115 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
18116 URL = "",
18117 acknowledgement = ack-nhfb,
18118 remark = "This is the author's thesis.",
18119 }
18120
18121 @TechReport{Finkel:1976:CDM,
18122 author = "Rafael Finkel",
18123 title = "Constructing and Debugging Manipulator Programs",
18124 type = "Technical Report",
18125 number = "STAN-CS-76-567 (AIM-284)",
18126 institution = inst-STAN-CS,
18127 address = inst-STAN-CS:adr,
18128 pages = "171",
18129 month = aug,
18130 year = "1976",
18131 bibdate = "Fri Nov 21 14:21:14 2025",
18132 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
18133 URL = "",
18134 acknowledgement = ack-nhfb,
18135 }
18136
18137 @TechReport{Binford:1976:ESC,
18138 author = "Thomas O. Binford and David D. Grossman and C. Richard
18139 Liu and Robert C. Bolles and Raphael A. Finkel and M.
18140 Shahid Mujtaba and Michael D. Roderick and Bruce E.
18141 Shimano and Russell H. Taylor and Ronald H. Goldman and
18142 J. Pitts {Jarvis, III} and Victor D. Scheinman and
18143 Thomas A. Gafford",
18144 title = "Exploratory study of computer integrated assembly
18145 systems. {Progress} report 3, covering the period
18146 {December 1, 1975} to {July 31, 1976}",
18147 type = "Technical Report",
18148 number = "STAN-CS-76-568 (AIM-285, PB-259 130/2WC)",
18149 institution = inst-STAN-CS,
18150 address = inst-STAN-CS:adr,
18151 pages = "356",
18152 month = aug,
18153 year = "1976",
18154 bibdate = "Fri Nov 7 07:00:05 MST 2025",
18155 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
18156 URL = "http://i.stanford.edu/TR/CS-TR-76-568.html",
18157 abstract = "The Computer Integrated Assembly Systems project is
18158 concerned with developing the software technology of
18159 programmable assembly devices, including computer
18160 controlled manipulators and vision systems. A complete
18161 hardware system has been implemented that includes
18162 manipulators with tactile sensors and TV cameras,
18163 tools, fixtures, and auxiliary devices, a dedicated
18164 minicomputer, and a time-shared large computer equipped
18165 with graphic display terminals. An advanced software
18166 system called AL has been developed that can be used to
18167 program assembly applications. Research currently
18168 underway includes refinement of AL, development of
18169 improved languages and interactive programming
18170 techniques for assembly and vision, extension of
18171 computer vision to areas which are currently
18172 infeasible, geometric modeling of objects and
18173 constraints, assembly simulation, control algorithms,
18174 and adaptive methods of calibration.",
18175 acknowledgement = ack-nhfb,
18176 pdfpages = "160 + 196",
18177 xxnumber = "CS-TR-76-568",
18178 }
18179
18180 @TechReport{Herriot:1976:CIN,
18181 author = "John G. Herriot",
18182 title = "Calculation of interpolating natural spline functions
18183 using {de Boor}'s package for calculating with
18184 {B}-splines",
18185 type = "Technical Report",
18186 number = "STAN-CS-76-569 (P261 814/AS)",
18187 institution = inst-STAN-CS,
18188 address = inst-STAN-CS:adr,
18189 pages = "i + 44",
18190 month = oct,
18191 year = "1976",
18192 bibdate = "Fri Nov 7 07:00:05 MST 2025",
18193 bibsource = "http://www.math.utah.edu/pub/tex/bib/fortran1.bib;
18194 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
18195 URL = "http://i.stanford.edu/TR/CS-TR-76-569.html",
18196 abstract = "A FORTRAN subroutine is described for finding
18197 interpolating natural splines of odd degree for an
18198 arbitrary set of data points. The subroutine makes use
18199 of several of the subroutines in de Boor's package for
18200 calculating with B-splines. An Algol W translation of
18201 the interpolating natural spline subroutine and of the
18202 required subroutines of the de Boor package are also
18203 given. Timing tests and accuracy tests for the routines
18204 are described.",
18205 acknowledgement = ack-nhfb,
18206 pdfpages = "52",
18207 xxnumber = "CS-TR-76-569",
18208 }
18209
18210 @TechReport{Lenat:1976:AIA,
18211 author = "Douglas Lenat",
18212 title = "{AM}: an Artificial Intelligence Approach to Discovery
18213 in Mathematics as Heuristic Search",
18214 type = "Technical Report",
18215 number = "STAN-CS-76-570 (AIM-286)",
18216 institution = inst-STAN-CS,
18217 address = inst-STAN-CS:adr,
18218 pages = "viii + 345",
18219 month = jul,
18220 year = "1976",
18221 bibdate = "Fri Nov 21 14:21:14 2025",
18222 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
18223 URL = "",
18224 abstract = "A program, called ``AM'', is described which models
18225 one aspect of elementary mathematics research:
18226 developing new concepts under the guidance of a large
18227 body of heuristic rules. ``Mathematics'' is considered
18228 as a type of intelligent behavior, not as a finished
18229 product.",
18230 acknowledgement = ack-nhfb,
18231 pdfpages = "352",
18232 remark = "This is the author's Ph.D. thesis.",
18233 }
18234
18235 @TechReport{Roderick:1976:DCR,
18236 author = "Michael Roderick",
18237 title = "Discrete Control of a Robot Arm",
18238 type = "Technical Report",
18239 number = "STAN-CS-76-571 (AIM-287)",
18240 institution = inst-STAN-CS,
18241 address = inst-STAN-CS:adr,
18242 pages = "98",
18243 month = aug,
18244 year = "1976",
18245 bibdate = "Fri Nov 21 14:21:14 2025",
18246 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
18247 URL = "",
18248 acknowledgement = ack-nhfb,
18249 remark = "This is the author's thesis.",
18250 }
18251
18252 @TechReport{Filman:1976:FP,
18253 author = "Robert E. Filman and Richard W. Weyhrauch",
18254 title = "An {FOL} primer",
18255 type = "Technical Report",
18256 number = "STAN-CS-76-572 (AIM-288)",
18257 institution = inst-STAN-CS,
18258 address = inst-STAN-CS:adr,
18259 pages = "36",
18260 month = sep,
18261 year = "1976",
18262 bibdate = "Fri Nov 7 07:00:05 MST 2025",
18263 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
18264 URL = "http://i.stanford.edu/TR/CS-TR-76-572.html",
18265 abstract = "This primer is an introduction to FOL, an interactive
18266 proof checker for first order logic. Its examples can
18267 be used to learn the FOL system, or read independently
18268 for a flavor of our style of interactive proof
18269 checking. Several example proofs are presented,
18270 successively increasing in the complexity of the FOL
18271 commands employed.",
18272 acknowledgement = ack-nhfb,
18273 pdfpages = "40",
18274 xxnumber = "CS-TR-76-572",
18275 }
18276
18277 @TechReport{Jonassen:1976:STF,
18278 author = "Arne T. Jonassen",
18279 title = "The stationary $p$-tree forest",
18280 type = "Technical Report",
18281 number = "STAN-CS-76-573 (AD-A032945)",
18282 institution = inst-STAN-CS,
18283 address = inst-STAN-CS:adr,
18284 pages = "iii + 88",
18285 month = oct,
18286 year = "1976",
18287 bibdate = "Fri Nov 7 07:00:05 MST 2025",
18288 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
18289 URL = "http://i.stanford.edu/TR/CS-TR-76-573.html",
18290 abstract = "This paper contains a theoretical analysis of the
18291 conditions of a priority queue strategy after an
18292 infinite number of alternating insert/remove steps.
18293 Expected insertion time, expected length, etc. are
18294 found.",
18295 acknowledgement = ack-nhfb,
18296 pdfpages = "94",
18297 xxnumber = "CS-TR-76-573",
18298 }
18299
18300 @TechReport{Reiser:1976:S,
18301 author = "John F. Reiser",
18302 title = "{SAIL}",
18303 type = "Technical Report",
18304 number = "STAN-CS-76-574 (AIM-289)",
18305 institution = inst-STAN-CS,
18306 address = inst-STAN-CS:adr,
18307 pages = "178",
18308 month = aug,
18309 year = "1976",
18310 bibdate = "Fri Nov 7 07:00:05 MST 2025",
18311 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
18312 URL = "http://i.stanford.edu/pub/cstr/reports/cs/tr/76/574/CS-TR-76-574.pdf;
18313 http://i.stanford.edu/TR/CS-TR-76-574.html",
18314 abstract = "Sail is a high-level programming language for the
18315 PDP-10 computer. It includes an extended ALGOL 60
18316 compiler and a companion set of execution-time
18317 routines. In addition to ALGOL, the language features:
18318 (1) flexible linking to hand-coded machine language
18319 algorithms, (2) complete access to the PDP-10 I/O
18320 facilities, (3) a complete system of compile-time
18321 arithmetic and logic as well as a flexible macro
18322 system, (4) a high-level debugger, (5) records and
18323 references, (6) sets and lists, (7) an associative data
18324 structure, (8) independent processes, (9) procedure
18325 variables, (10) user modifiable error handling, (11)
18326 backtracking, and (12) interrupt facilities. This
18327 manual describes the Sail language and the
18328 execution-time routines for the typical Sail user: a
18329 non-novice programmer with some knowledge of ALGOL. It
18330 lies somewhere between being a tutorial and a reference
18331 manual.",
18332 acknowledgement = ack-nhfb,
18333 pdfpages = "182",
18334 xxnumber = "CS-TR-76-574",
18335 }
18336
18337 @TechReport{Smith:1976:ST,
18338 author = "Nancy W. Smith",
18339 title = "{SAIL} tutorial",
18340 type = "Technical Report",
18341 number = "STAN-CS-76-575 (AIM-290, AD-A042494)",
18342 institution = inst-STAN-CS,
18343 address = inst-STAN-CS:adr,
18344 pages = "54",
18345 month = oct,
18346 year = "1976",
18347 bibdate = "Fri Nov 7 07:00:05 MST 2025",
18348 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
18349 URL = "http://i.stanford.edu/TR/CS-TR-76-575.html",
18350 abstract = "This tutorial is designed for a beginning user of
18351 Sail, an ALGOL-like language for the PDP10. The first
18352 part covers the basic statements and expressions of the
18353 language; remaining topics include macros, records,
18354 conditional compilation, and input/output. Detailed
18355 examples of Sail programming are included throughout,
18356 and only a minimum of programming background is
18357 assumed.",
18358 acknowledgement = ack-nhfb,
18359 pdfpages = "58",
18360 xxnumber = "CS-TR-76-575",
18361 }
18362
18363 @TechReport{McDiarmid:1976:DCN,
18364 author = "Colin McDiarmid",
18365 title = "Determining the Chromatic Number of a Graph",
18366 type = "Technical Report",
18367 number = "STAN-CS-76-576 (AD-A035350)",
18368 institution = inst-STAN-CS,
18369 address = inst-STAN-CS:adr,
18370 pages = "61",
18371 month = dec,
18372 year = "1976",
18373 bibdate = "Fri Nov 21 14:21:14 2025",
18374 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
18375 URL = "",
18376 acknowledgement = ack-nhfb,
18377 pdfpages = "64",
18378 }
18379
18380 @TechReport{Buchanan:1976:TRJ,
18381 author = "Bruce Buchanan and Joshua Lederberg and John
18382 McCarthy",
18383 title = "Three Reviews of {J. Weizenbaum}'s
18384 {{\booktitle{Computer Power and Human Reason}}}",
18385 type = "Technical Report",
18386 number = "STAN-CS-76-577 (AIM-291, A044713)",
18387 institution = inst-STAN-CS,
18388 address = inst-STAN-CS:adr,
18389 pages = "28",
18390 month = nov,
18391 year = "1976",
18392 bibdate = "Fri Nov 21 14:21:14 2025",
18393 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
18394 URL = "",
18395 acknowledgement = ack-nhfb,
18396 author-dates = "John McCarthy (4 September 1927--24 October 2011)",
18397 }
18398
18399 @TechReport{Oliger:1976:TPA,
18400 author = "Joseph Oliger and Arne Sundstr{\"o}m",
18401 title = "Theoretical and practical aspects of some
18402 initial-boundary value problems in fluid dynamics",
18403 type = "Technical Report",
18404 number = "STAN-CS-76-578 (AD-A035219)",
18405 institution = inst-STAN-CS,
18406 address = inst-STAN-CS:adr,
18407 pages = "iv + 61",
18408 month = nov,
18409 year = "1976",
18410 bibdate = "Fri Nov 7 07:00:05 MST 2025",
18411 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
18412 URL = "http://i.stanford.edu/TR/CS-TR-76-578.html",
18413 abstract = "Initial-boundary value problems for several systems of
18414 partial differential equations from fluid dynamics are
18415 discussed. Both rigid wall and open boundary problems
18416 are treated. Boundary conditions are formulated and
18417 shown to yield well-posed problems for the Eulerian
18418 equations for gas dynamics, the shallow-water
18419 equations, and linearized constant coefficient versions
18420 of the incompressible, anelastic equations. The
18421 `primitive' hydrostatic meteorological equations are
18422 shown to be ill-posed with any specification of local,
18423 pointwise boundary conditions. Analysis of simplified
18424 versions of this system illustrates the mechanism
18425 responsible for ill-posedness.",
18426 acknowledgement = ack-nhfb,
18427 pdfpages = "66",
18428 xxnumber = "CS-TR-76-578",
18429 }
18430
18431 @TechReport{Baskett:1976:AIM,
18432 author = "Forest Baskett and Abbas Rafii",
18433 title = "The {A0} inversion model of program paging behavior",
18434 type = "Technical Report",
18435 number = "STAN-CS-76-579 (SLACP-1826)",
18436 institution = inst-STAN-CS,
18437 address = inst-STAN-CS:adr,
18438 pages = "30",
18439 month = nov,
18440 year = "1976",
18441 bibdate = "Fri Nov 7 07:00:05 MST 2025",
18442 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
18443 URL = "http://i.stanford.edu/TR/CS-TR-76-579.html",
18444 abstract = "When the parameters of a simple stochastic model of
18445 the memory referencing behavior of computer programs
18446 are carefully selected, the model is able to mimic the
18447 paging behavior of a set of actual programs. The
18448 mimicry is successful using several different page
18449 replacement algorithms and a wide range of real memory
18450 sizes in a virtual memory environment. The model is
18451 based on the independent reference model with a new
18452 procedure for determining the page reference
18453 probabilities, the parameters of the model. We call the
18454 result the A0 inversion independent reference model.
18455 Since the fault rate (or miss ratio) is one aspect of
18456 program behavior that the model is able to capture for
18457 many different memory sizes, the model should be
18458 especially useful for evaluating multilevel memory
18459 organizations based on newly emerging memory
18460 technologies.",
18461 acknowledgement = ack-nhfb,
18462 pdfpages = "36",
18463 xxnumber = "CS-TR-76-579",
18464 }
18465
18466 @TechReport{Winograd:1976:TPU,
18467 author = "Terry A. Winograd",
18468 title = "Towards a procedural understanding of semantics",
18469 type = "Technical Report",
18470 number = "STAN-CS-76-580 (AIM-292)",
18471 institution = inst-STAN-CS,
18472 address = inst-STAN-CS:adr,
18473 pages = "30",
18474 month = nov,
18475 year = "1976",
18476 bibdate = "Fri Nov 7 07:00:05 MST 2025",
18477 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
18478 URL = "http://i.stanford.edu/TR/CS-TR-76-580.html",
18479 abstract = "The term `procedural semantics' has been used in a
18480 variety of ways, not all compatible, and not all
18481 comprehensible. In this paper, I have chosen to apply
18482 the term to a broad paradigm for studying semantics
18483 (and in fact, all of linguistics). This paradigm has
18484 developed in a context of writing computer programs
18485 which use natural language, but it is not a theory of
18486 computer programs or programming techniques. It is
18487 `procedural' because it looks at the underlying
18488 structure of language as fundamentally shaped by the
18489 nature of processes for language production and
18490 comprehension. It is based on the belief that there is
18491 a level of explanation at which there are significant
18492 similarities between the psychological processes of
18493 human language use and the computational processes in
18494 computer programs we can construct and study. Its goal
18495 is to develop a body of theory at this level. This
18496 approach necessitates abandoning or modifying several
18497 currently accepted doctrines, including the way in
18498 which distinctions have been drawn between `semantics'
18499 and `pragmatics' and between `performance' and
18500 `competence'. The paper has three major sections. It
18501 first lays out the paradigm assumptions which guide the
18502 enterprise, and elaborates a model of cognitive
18503 processing and language use. It then illustrates how
18504 some specific semantic problems might be approached
18505 from a procedural perspective, and contrasts the
18506 procedural approach with formal structural and truth
18507 conditional approaches. Finally, it discusses the goals
18508 of linguistic theory and the nature of the linguistic
18509 explanation. Much of what is presented here is a
18510 speculation about the nature of a paradigm yet to be
18511 developed. This paper is an attempt to be evocative
18512 rather than definitive; to convey intuitions rather
18513 than to formulate crucial arguments which justify this
18514 approach over others. It will be successful if it
18515 suggests some ways of looking at language which lead to
18516 further understanding.",
18517 acknowledgement = ack-nhfb,
18518 pdfpages = "34",
18519 xxnumber = "CS-TR-76-580",
18520 }
18521
18522 @TechReport{Bobrow:1976:OKK,
18523 author = "Daniel G. Bobrow and Terry A. Winograd",
18524 title = "An overview of {KRL}, a {Knowledge Representation
18525 Language}",
18526 type = "Technical Report",
18527 number = "STAN-CS-76-581 (AIM-293, AD-A042508)",
18528 institution = inst-STAN-CS,
18529 address = inst-STAN-CS:adr,
18530 pages = "40",
18531 month = nov,
18532 year = "1976",
18533 bibdate = "Fri Nov 7 07:00:05 MST 2025",
18534 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
18535 URL = "http://i.stanford.edu/TR/CS-TR-76-581.html",
18536 abstract = "This paper describes KRL, a Knowledge Representation
18537 Language designed for use in understander systems. It
18538 outlines both the general concepts which underlie our
18539 research and the details of KRL-0, an experimental
18540 implementation of some of these concepts. KRL is an
18541 attempt to integrate procedural knowledge with a broad
18542 base of declarative forms. These forms provide a
18543 variety of ways to express the logical structure of the
18544 knowledge, in order to give flexibility in associating
18545 procedures (for memory and reasoning) with specific
18546 pieces of knowledge, and to control the relative
18547 accessibility of different facts and descriptions. The
18548 formalism for declarative knowledge is based on
18549 structured conceptual objects with associated
18550 descriptions. These objects form a network of memory
18551 units with several different sorts of linkages, each
18552 having well-specified implications for the retrieval
18553 process. Procedures can be associated directly with the
18554 internal structure of a conceptual object. This
18555 procedural attachment allows the steps for a particular
18556 operation to be determined by characteristics of the
18557 specific entities involved. The control structure of
18558 KRL is based on the belief that the next generation of
18559 intelligent programs will integrate data-directed and
18560 goal-directed processing by using multi-processing. It
18561 provides for a priority-ordered multi-process agenda
18562 with explicit (user-provided) strategies for scheduling
18563 and resource allocation. It provides procedure
18564 directories which operate along with process frameworks
18565 to allow procedural parameterization of the fundamental
18566 system processes for building, comparing, and
18567 retrieving memory structures. Future development of KRL
18568 will include integrating procedure definition with the
18569 descriptive formalism.",
18570 acknowledgement = ack-nhfb,
18571 pdfpages = "43",
18572 xxnumber = "CS-TR-76-581",
18573 }
18574
18575 @TechReport{Chvatal:1976:TRC,
18576 author = "Vaclav Chv{\'a}tal and M. R. Garey and D. S. Johnson",
18577 title = "Two Results Concerning Multicoloring",
18578 type = "Technical Report",
18579 number = "STAN-CS-76-582 (AD-A038863)",
18580 institution = inst-STAN-CS,
18581 address = inst-STAN-CS:adr,
18582 pages = "iv + 8",
18583 month = dec,
18584 year = "1976",
18585 bibdate = "Fri Nov 21 14:21:14 2025",
18586 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
18587 URL = "https://apps.dtic.mil/sti/pdfs/ADA038863.pdf",
18588 abstract = "The $m$-chromatic number $ \chi_m(G)$ of a graph $ G =
18589 (V, E)$ is the least integer $k$ such that there exists
18590 a mapping $ f \colon V + \{ S \subseteq \{ 1, 2, \ldots
18591 {}, k \} \colon |S| = m \} $ having the property that $
18592 f(u) \cap f(v) = \phi $ whenever $ \{ u, v \} \in E$.
18593 This is a generalization of the standard notion of
18594 chromatic number and arises in connection with mobile
18595 telephone frequency assignments. Answering a question
18596 of Lov{\'a}sz, our first result shows that for any $ m
18597 \geq 1$ and any $ \epsilon > 0$, there exists a graph
18598 $G$ for which $ \chi_{m + l}(G) / \chi_m(G) > 2 -
18599 \epsilon $. This shows that the known bound of 2 for
18600 all $m$ and $G$ is essentially best possible. Our
18601 second result shows that the least integer $ m_0$ for
18602 which $ \chi_m(G) / m_0 = \lim_{m \to \infty }
18603 \chi_m(G) / m$ can be asymptotically as large as $
18604 e{^\sqrt {(n \log n) / 2}}$ for some $n$ vertex graphs,
18605 though it can never exceed $ e^{(n \log n) / 2}$.",
18606 acknowledgement = ack-nhfb,
18607 pdfpages = "12",
18608 }
18609
18610 @TechReport{Chvatal:1976:DSN,
18611 author = "Vaclav Chv{\'a}tal",
18612 title = "Determining the stability number of a graph",
18613 type = "Technical Report",
18614 number = "STAN-CS-76-583 (AD-A038864)",
18615 institution = inst-STAN-CS,
18616 address = inst-STAN-CS:adr,
18617 pages = "ii + 39",
18618 month = dec,
18619 year = "1976",
18620 bibdate = "Fri Nov 7 07:00:05 MST 2025",
18621 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
18622 URL = "http://i.stanford.edu/TR/CS-TR-76-583.html;
18623 https://apps.dtic.mil/sti/pdfs/ADA038864.pdf",
18624 abstract = "We formalize certain rules for deriving upper bounds
18625 on the stability number of a graph. The resulting
18626 system is powerful enough to (i) encompass the
18627 algorithms of Tarjan's type and (ii) provide very short
18628 proofs on graphs for which the stability number equals
18629 the clique-covering number. However, our main result
18630 shows that for almost all graphs with a (sufficiently
18631 large) linear number of edges, proofs within our system
18632 must have at least exponential length.",
18633 acknowledgement = ack-nhfb,
18634 pdfpages = "42",
18635 remark = "The ADA038864 PDF file is OCR'ed scans of microfiche
18636 page images, but the Stanford PDF file is clean.",
18637 xxnumber = "CS-TR-76-583",
18638 }
18639
18640 @TechReport{Knuth:1976:DPR,
18641 author = "Donald E. Knuth",
18642 title = "Deletions That Preserve Randomness",
18643 type = "Technical Report",
18644 number = "STAN-CS-77-584 (AD-A038865)",
18645 institution = inst-STAN-CS,
18646 address = inst-STAN-CS:adr,
18647 pages = "v + 32",
18648 month = dec,
18649 year = "1976",
18650 DOI = "https://doi.org/10.1109/TSE.1977.231160",
18651 bibdate = "Fri Nov 21 14:21:14 2025",
18652 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
18653 URL = "https://apps.dtic.mil/sti/tr/pdf/ADA038865.pdf",
18654 abstract = "This paper discusses dynamic properties of data
18655 structures under insertions and deletions. It is shown
18656 that, in certain circumstances, the result of $n$
18657 random insertions and $m$ random deletions will be
18658 equivalent to $ n - m$ random insertions, under various
18659 interpretations of the word `random' and under various
18660 constraints on the order of insertions and deletions.",
18661 acknowledgement = ack-nhfb,
18662 pdfpages = "37",
18663 remark-1 = "Published in \booktitle{IEEE Transactions on Software
18664 Engineering}, {\bf SE-3}(5) 351--359, September\slash
18665 October 1977, doi:10.1109/TSE.1977.231160.",
18666 remark-2 = "The PDF file is OCR'ed scans of microfiche page
18667 images.",
18668 }
18669
18670 @TechReport{Concus:1976:NSN,
18671 author = "Paul Concus and Gene H. Golub and Dianne Prost
18672 O'Leary",
18673 title = "Numerical solution of nonlinear elliptic partial
18674 differential equations by a generalized conjugate
18675 gradient method",
18676 type = "Technical Report",
18677 number = "STAN-CS-76-585 (SU326 P30-50)",
18678 institution = inst-STAN-CS,
18679 address = inst-STAN-CS:adr,
18680 pages = "vi + 43",
18681 month = dec,
18682 year = "1976",
18683 bibdate = "Fri Nov 7 07:00:05 MST 2025",
18684 bibsource = "https://www.math.utah.edu/pub/bibnet/authors/g/golub-gene-h.bib;
18685 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
18686 URL = "http://i.stanford.edu/TR/CS-TR-76-585.html",
18687 abstract = "We have studied previously a generalized conjugate
18688 gradient method for solving sparse positive-definite
18689 systems of linear equations arising from the
18690 discretization of elliptic partial-differential
18691 boundary-value problems. Here, extensions to the
18692 nonlinear case are considered. We split the original
18693 discretized operator into the sum of two operators, one
18694 of which corresponds to a more easily solvable system
18695 of equations, and accelerate the associated iteration
18696 based on this splitting by (nonlinear) conjugate
18697 gradients. The behavior of the method is illustrated
18698 for the minimal surface equation with splittings
18699 corresponding to nonlinear SSOR, to approximate
18700 factorization of the Jacobian matrix, and to elliptic
18701 operators suitable for use with fast direct methods.
18702 The results of numerical experiments are given as well
18703 for a mildly nonlinear example, for which, in the
18704 corresponding linear case, the finite termination
18705 property of the conjugate gradient algorithm is
18706 crucial.",
18707 acknowledgement = ack-nhfb,
18708 author-dates = "Gene Howard Golub (February 29, 1932--November 16,
18709 2007)",
18710 keywords = "differential equations, elliptic --- numerical
18711 solutions",
18712 pdfpages = "50",
18713 xxnumber = "CS-TR-76-585",
18714 }
18715
18716 @TechReport{Dershowitz:1976:EPS,
18717 author = "Nachum Dershowitz and Zohar Manna",
18718 title = "The evolution of programs: a system for automatic
18719 program modification",
18720 type = "Technical Report",
18721 number = "STAN-CS-76-586 (AIM-294, AD-A042516)",
18722 institution = inst-STAN-CS,
18723 address = inst-STAN-CS:adr,
18724 pages = "45",
18725 month = dec,
18726 year = "1976",
18727 bibdate = "Fri Nov 7 07:00:05 MST 2025",
18728 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
18729 URL = "http://i.stanford.edu/TR/CS-TR-76-586.html",
18730 abstract = "An attempt is made to formulate techniques of program
18731 modification, whereby a program that achieves one
18732 result can be transformed into a new program that uses
18733 the same principles to achieve a different goal. For
18734 example, a program that uses the binary search paradigm
18735 to calculate the square-root of a number may be
18736 modified to divide two numbers in a similar manner, or
18737 vice versa. Program debugging is considered as a
18738 special case of modification: if a program computes
18739 wrong results, it must be modified to achieve the
18740 intended results. The application of abstract program
18741 schemata to concrete problems is also viewed from the
18742 perspective of modification techniques. We have
18743 embedded this approach in a running implementation; our
18744 methods are illustrated with several examples that have
18745 been performed by it.",
18746 acknowledgement = ack-nhfb,
18747 pdfpages = "48",
18748 xxnumber = "CS-TR-76-586",
18749 }
18750
18751 @TechReport{Garey:1977:CRB,
18752 author = "Michael R. Garey and Ronald L. Graham and David S.
18753 Johnson and Donald E. Knuth",
18754 title = "Complexity Results for Bandwidth Minimization",
18755 type = "Technical Report",
18756 number = "STAN-CS-77-587 (AD-A038867)",
18757 institution = inst-STAN-CS,
18758 address = inst-STAN-CS:adr,
18759 pages = "v + 36",
18760 month = feb,
18761 year = "1977",
18762 bibdate = "Fri Nov 21 14:21:14 2025",
18763 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
18764 URL = "https://apps.dtic.mil/sti/tr/pdf/ADA038867.pdf;
18765 https://www.jstor.org/stable/2100947",
18766 abstract = "We present a linear-time algorithm for sparse
18767 symmetric matrices which converts a matrix into
18768 pentadiagonal form (``bandwidth 2''), whenever it is
18769 possible to do so using simultaneous row and column
18770 permutations. On the other hand when an arbitrary
18771 integer $k$ and graph $G$ are given, we show that it is
18772 NP-complete to determine whether or not there exists an
18773 ordering of the vertices with bandwidth $ \leq k$, even
18774 when $G$ is restricted to the class of free trees with
18775 all vertices of degree $ \leq 3$. Related problems for
18776 acyclic directed graphs (upper triangular matrices) are
18777 also discussed.",
18778 acknowledgement = ack-nhfb,
18779 author-dates = "Ronald Lewis Graham (31 October 1935--6 July 2020)",
18780 pdfpages = "41",
18781 remark-1 = "Published in \booktitle{SIAM Journal on Applied
18782 Mathematics}, {\bf 34}(3) 477--495, May 1978.",
18783 remark-2 = "The PDF file is OCR'ed scans of microfiche page
18784 images.",
18785 }
18786
18787 @TechReport{Weyhrauch:1977:UMF,
18788 author = "Richard W. Weyhrauch",
18789 title = "A users manual for {FOL}",
18790 type = "Technical Report",
18791 number = "STAN-CS-77-432",
18792 institution = inst-STAN-CS,
18793 address = inst-STAN-CS:adr,
18794 pages = "iv + 68",
18795 month = jul,
18796 year = "1977",
18797 bibdate = "Fri Nov 7 07:00:05 MST 2025",
18798 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
18799 URL = "http://i.stanford.edu/TR/CS-TR-77-432.html",
18800 abstract = "This manual explains how to use of the proof checker
18801 FOL, and supersedes all previous manuals. FOL checks
18802 proofs of a natural deduction style formulation of
18803 first order functional calculus with equality augmented
18804 in the following ways: (i) it is a many-sorted
18805 first-order logic in which a partial order over the
18806 sorts may be specified; (ii) conditional expressions
18807 are allowed for forming terms (iii) axiom schemata with
18808 predicate and function parameters are allowed (iv)
18809 purely propositional deductions can be made in a single
18810 step; (v) a partial model of the language can be built
18811 in a LISP environment and some deductions can be made
18812 by direct computation in this model; (vi) there is a
18813 limited ability to make metamathematical arguments;
18814 (vii) there are many operational conveniences. A major
18815 goal of FOL is to create an environment where formal
18816 proofs can be carefully examined with the eventual aim
18817 of designing practical tools for manipulating proofs in
18818 pure mathematics and about the correctness of programs.
18819 This includes checking proofs generated by other
18820 programs. FOL is also a research tool in modeling
18821 common-sense reasoning including reasoning about
18822 knowledge and belief.",
18823 acknowledgement = ack-nhfb,
18824 pdfpages = "76",
18825 xxnumber = "CS-TR-77-432",
18826 }
18827
18828 @TechReport{Chan:1977:CSV,
18829 author = "Tony Fan C. Chan",
18830 title = "On computing the singular value decomposition",
18831 type = "Technical Report",
18832 number = "STAN-CS-77-588 (PB-266 381/AS)",
18833 institution = inst-STAN-CS,
18834 address = inst-STAN-CS:adr,
18835 pages = "??",
18836 month = feb,
18837 year = "1977",
18838 bibdate = "Fri Nov 7 07:00:05 MST 2025",
18839 bibsource = "https://www.math.utah.edu/pub/bibnet/authors/r/reinsch-christian-h.bib;
18840 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
18841 URL = "http://i.stanford.edu/TR/CS-TR-77-588.html",
18842 abstract = "The most well-known and widely-used algorithm for
18843 computing the Singular Value Decomposition (SVD) of an
18844 $ m \times n $ rectangular matrix $A$ nowadays is the
18845 Golub--Reinsch algorithm [1971]. In this paper, it is
18846 shown that by (1) first triangularizing the matrix $A$
18847 by Householder transformations before bidiagonalizing
18848 it, and (2) accumulating some left transformations on a
18849 $ n \times n$ array instead of on an $ m \times n$
18850 array, the resulting algorithm is often more efficient
18851 than the Golub--Reinsch algorithm, especially for
18852 matrices with considerably more rows than columns $ (m
18853 \gg n)$, such as in least squares applications. The two
18854 algorithms are compared in terms of operation counts,
18855 and computational experiments that have been carried
18856 out verify the theoretical comparisons. The modified
18857 algorithm is more efficient even when $m$ is only
18858 slightly greater than $n$, and in some cases can
18859 achieve as much as 50\% savings when $ m \gg n$. If
18860 accumulation of left transformations is desired, then $
18861 n^2$ extra storage locations are required (relatively
18862 small if $ m > > n$), but otherwise no extra storage is
18863 required. The modified algorithm uses only orthogonal
18864 transformations and is therefore numerically stable. In
18865 the Appendix, we give the Fortran code of a hybrid
18866 method which automatically selects the more efficient
18867 of the two algorithms to use depending upon the input
18868 values for $m$ and $n$.",
18869 acknowledgement = ack-nhfb,
18870 pdfpages = "64",
18871 xxnumber = "CS-TR-77-588",
18872 }
18873
18874 @TechReport{Engelmore:1977:KBS,
18875 author = "Robert S. Engelmore and H. Penny Nii",
18876 title = "A knowledge-based system for the interpretation of
18877 protein {X}-ray crystallographic data",
18878 type = "Technical Report",
18879 number = "STAN-CS-77-589 (HPP-77-2, AD-A038866)",
18880 institution = inst-STAN-CS,
18881 address = inst-STAN-CS:adr,
18882 pages = "??",
18883 month = feb,
18884 year = "1977",
18885 bibdate = "Fri Nov 7 07:00:05 MST 2025",
18886 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
18887 URL = "http://i.stanford.edu/TR/CS-TR-77-589.html",
18888 abstract = "The broad goal of this project is to develop
18889 intelligent computational systems to infer the
18890 three-dimensional structures of proteins from x-ray
18891 crystallographic data. The computational systems under
18892 development use both formal and judgmental knowledge
18893 from experts to select appropriate procedures and to
18894 constrain the space of plausible protein structures.
18895 The hypothesis generating and testing procedures
18896 operate upon a variety of representations of the data,
18897 and work with several different descriptions of the
18898 structure being inferred. The system consists of a
18899 number of independent but cooperating knowledge sources
18900 which propose, augment and verify a solution to the
18901 problem as it is incrementally generated.",
18902 acknowledgement = ack-nhfb,
18903 pdfpages = "40",
18904 xxnumber = "CS-TR-77-589",
18905 }
18906
18907 @TechReport{Knuth:1977:IPI,
18908 author = "Donald E. Knuth and Michael S. Paterson",
18909 title = "Identities from Partition Involutions",
18910 type = "Technical Report",
18911 number = "STAN-CS-77-590 (AD-A038868)",
18912 institution = inst-STAN-CS,
18913 address = inst-STAN-CS:adr,
18914 pages = "v + 22",
18915 month = feb,
18916 year = "1977",
18917 DOI = "https://doi.org/10.1080/00150517.1978.12430319",
18918 bibdate = "Fri Nov 21 14:21:14 2025",
18919 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
18920 URL = "https://apps.dtic.mil/sti/tr/pdf/ADA038868.pdf",
18921 abstract = "Subbarao and Andrews have observed that the
18922 combinatorial technique used by F. Franklin to prove
18923 Euler's famous partition identity\par
18924
18925 $$ (1 - x) (1 - x^2) (1 - x^3) (1 - x^4) \cdots {} = 1
18926 - x - x^2 + x^5 + x^7 - x^{12} - x^{15} + \cdots {} $$
18927 \par
18928
18929 can be applied to prove the more general formula\par
18930
18931 $$ 1 - x - x^2 (1 - x y) - x^3 y^2 (1 - x y) (1 - x^2
18932 y) - x^4 y^3 (1 - x y) (1 - x^2 y)(1 - x^3 y) - \cdots
18933 {} = 1 - x + x^2 y + x^5 y^3 + x^7 y^4 - x^{12} y^6 -
18934 x^{15} y^7 + \cdots {} $$ \par
18935
18936 which reduces to Euler's when $ y = 1 $. This note
18937 shows that several finite versions of Euler's identity
18938 can also be demonstrated using this elementary
18939 technique; for example,\par
18940
18941 $$ \ldots {} $$ \par
18942
18943 By using Sylvester's modification of Franklin's
18944 construction, it is also possible to generalize
18945 Jacobi's triple product identity.",
18946 acknowledgement = ack-nhfb,
18947 pdfpages = "30",
18948 remark = "Published in \booktitle{The Fibonacci Quarterly}, {\bf
18949 16}(3) 198--212, June 1978.
18950 doi:10.1080/00150517.1978.12430319.",
18951 remark-2 = "The PDF file is OCR'ed scans of microfiche page
18952 images.",
18953 }
18954
18955 @TechReport{Bolles:1976:VVW,
18956 author = "Robert C. Bolles",
18957 title = "Verification Vision Within a Programmable Assembly
18958 System",
18959 type = "Technical Report",
18960 number = "STAN-CS-77-591 (AIM-295, AD-A045723)",
18961 institution = inst-STAN-CS,
18962 address = inst-STAN-CS:adr,
18963 pages = "vii + 239",
18964 month = dec,
18965 year = "1976",
18966 bibdate = "Fri Nov 21 14:21:14 2025",
18967 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
18968 URL = "",
18969 abstract = "The research reported in this thesis concentrates on a
18970 subclass of visual information processing referred to
18971 as {\em verification vision\/} (abbreviated VV). VV
18972 uses a model of a scene to locate objects of interest
18973 in a picture of the scene. The characteristics that
18974 distinguish VV from the other types of visual
18975 information processing are: (1) the system has a great
18976 deal of prior knowledge about the type, placement, and
18977 appearance of the objects that form the scene and (2)
18978 the goal is to verify and refine the location of one or
18979 more objects in the scene. VV includes a significant
18980 portion of the visual feedback tasks required within
18981 programmable assembly. For example, locating a screw
18982 hole and determining the relative displacement between
18983 a screw and the screw hole are both VV tasks.\par
18984
18985 here are several types of information available in VV
18986 tasks that can facilitate the solution of such tasks: a
18987 model of each object in the scene, a set of initial
18988 constraints on the locations of the objects, and a set
18989 of previous pictures of this scene or similar scenes.
18990 Additional information can be obtained by applying
18991 visual operators to a current picture of the
18992 scene.\par
18993
18994 How can all of this information be used to minimize the
18995 amount of work required to perform a task? Two steps
18996 are involved in answering this question: (1) formalize
18997 the types of tasks, available information, and
18998 quantities of interest and (2) formulate combination
18999 rules that use the available information to estimate
19000 the quantities of interest. The combination rules that
19001 estimate confidences are based upon Bayes theorem. They
19002 are designed to combine the results of operators that
19003 are not completely reliable, i.e., operators that may
19004 find any one of several known features or a {\em
19005 surprise}. The combination rules that estimate
19006 precisions are based upon a least-squares technique.
19007 They use the expected precisions of the operators to
19008 check the structural consistency of a set of matches
19009 and to estimate the resulting precisions of the points
19010 of interest.
19011
19012 An interactive VV system based upon these ideas has
19013 been implemented. It helps the programmer select
19014 potentially useful operator\slash feature pairs,
19015 provides a training session to gather statistics on the
19016 behavior of the operators, automatically ranks the
19017 operator\slash feature pairs according to their
19018 expected contributions, and performs the desired task.
19019 The VV system has also been interfaced to the AL
19020 control system for the mechanical arms and has been
19021 tested on tasks that involve a combination of touch,
19022 force, and visual feedback.",
19023 acknowledgement = ack-nhfb,
19024 advisor = "Jerry Feldman",
19025 pdfpages = "246",
19026 remark = "This is the author's Ph.D. thesis.",
19027 }
19028
19029 @TechReport{Cartwright:1976:PFS,
19030 author = "Robert {Cartwright, Jr.}",
19031 title = "A Practical Formal Semantic Definition and
19032 Verification Systems for Typed {LISP}",
19033 type = "Technical Report",
19034 number = "STAN-CS-77-592 (AIM-296)",
19035 institution = inst-STAN-CS,
19036 address = inst-STAN-CS:adr,
19037 pages = "v + 153",
19038 month = dec,
19039 year = "1976",
19040 bibdate = "Fri Nov 21 14:21:14 2025",
19041 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
19042 URL = "",
19043 acknowledgement = ack-nhfb,
19044 advisor = "David Luckham",
19045 pdfpages = "160",
19046 remark = "This is the author's thesis.",
19047 remark = "An abstract is present, but OCR fails to recognize
19048 most of it.",
19049 }
19050
19051 @TechReport{Scott:1977:ECP,
19052 author = "A. Carlisle Scott and William J. Clancey and Randall
19053 Davis and Edward H. Shortliffe",
19054 title = "Explanation capabilities of production-based
19055 consultation systems",
19056 type = "Technical Report",
19057 number = "STAN-CS-77-593 (HPP-77-1)",
19058 institution = inst-STAN-CS,
19059 address = inst-STAN-CS:adr,
19060 pages = "30",
19061 month = feb,
19062 year = "1977",
19063 bibdate = "Fri Nov 7 07:00:05 MST 2025",
19064 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
19065 URL = "http://i.stanford.edu/TR/CS-TR-77-593.html",
19066 abstract = "A computer program that models an expert in a given
19067 domain is more likely to be accepted by experts in that
19068 domain, and by non-experts seeking its advice, if the
19069 system can explain its actions. An explanation
19070 capability not only adds to the system's credibility,
19071 but also enables the non-expert user to learn from it.
19072 Furthermore, clear explanations allow an expert to
19073 check the system's `reasoning', possibly discovering
19074 the need for refinements and additions to the system's
19075 knowledge base. In a developing system, an explanation
19076 capability can be used as a debugging aid to verify
19077 that additions to the system are working as they
19078 should. This paper discusses the general
19079 characteristics of explanation systems: what types of
19080 explanations they should be able to give, what types of
19081 knowledge will be needed in order to give these
19082 explanations, and how this knowledge might be
19083 organized. The explanation facility in MYCIN is
19084 discussed as an illustration of how the various
19085 problems might be approached.",
19086 acknowledgement = ack-nhfb,
19087 pdfpages = "38",
19088 xxnumber = "CS-TR-77-593",
19089 }
19090
19091 @TechReport{Stritter:1977:FM,
19092 author = "Edwin P. Stritter",
19093 title = "File Migration",
19094 type = "Technical Report",
19095 number = "STAN-CS-77-594 (SLAC-200)",
19096 institution = inst-STAN-CS,
19097 address = inst-STAN-CS:adr,
19098 pages = "112",
19099 month = apr,
19100 year = "1977",
19101 bibdate = "Fri Nov 21 14:21:14 2025",
19102 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
19103 URL = "",
19104 acknowledgement = ack-nhfb,
19105 remark = "This is the author's thesis. No PDF in NTRL archive.",
19106 }
19107
19108 @TechReport{Lewis:1977:ASM,
19109 author = "John Gregg Lewis",
19110 title = "Algorithms for Sparse Matrix Eigenvalue Problems",
19111 type = "Technical Report",
19112 number = "STAN-CS-77-595",
19113 institution = inst-STAN-CS,
19114 address = inst-STAN-CS:adr,
19115 pages = "212",
19116 month = apr,
19117 year = "1977",
19118 bibdate = "Fri Nov 21 14:21:14 2025",
19119 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
19120 URL = "",
19121 acknowledgement = ack-nhfb,
19122 remark = "This is the author's thesis.",
19123 }
19124
19125 @TechReport{Stefik:1977:RKB,
19126 author = "Mark J. Stefik and Nancy Martin",
19127 title = "A review of knowledge based problem solving as a basis
19128 for a genetics experiment designing system",
19129 type = "Technical Report",
19130 number = "STAN-CS-77-596 (HPP-77-5)",
19131 institution = inst-STAN-CS,
19132 address = inst-STAN-CS:adr,
19133 pages = "97",
19134 month = feb,
19135 year = "1977",
19136 bibdate = "Fri Nov 7 07:00:05 MST 2025",
19137 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
19138 URL = "http://i.stanford.edu/TR/CS-TR-77-596.html",
19139 abstract = "It is generally accepted that problem solving systems
19140 require a wealth of domain specific knowledge for
19141 effective performance in complex domains. This report
19142 takes the view that all domain specific knowledge
19143 should be expressed in a knowledge base. With this in
19144 mind, the ideas and techniques from problem solving and
19145 knowledge base research are reviewed and outstanding
19146 problems are identified. Finally, a task domain is
19147 characterized in terms of objects, actions, and
19148 control/strategy knowledge and suggestions are made for
19149 creating a uniform knowledge base management system to
19150 be used for knowledge acquisition, problem solving, and
19151 explanation.",
19152 acknowledgement = ack-nhfb,
19153 pdfpages = "96",
19154 xxnumber = "CS-TR-77-596",
19155 }
19156
19157 @TechReport{Buchanan:1977:MDL,
19158 author = "Bruce G. Buchanan and Tom M. Mitchell",
19159 title = "Model-Directed Learning of Production Rules",
19160 type = "Technical Report",
19161 number = "STAN-CS-77-597 (HPP-77-6)",
19162 institution = inst-STAN-CS,
19163 address = inst-STAN-CS:adr,
19164 pages = "26",
19165 month = mar,
19166 year = "1977",
19167 bibdate = "Fri Nov 7 07:00:05 MST 2025",
19168 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
19169 URL = "http://i.stanford.edu/TR/CS-TR-77-597.html",
19170 abstract = "The Meta-DENDRAL program is described in general terms
19171 that are intended to clarify the similarities and
19172 differences to other learning programs. Its approach of
19173 model-directed heuristic search through a complex space
19174 of possible rules appears well suited to many induction
19175 tasks. The use of a strong model of the domain to
19176 direct the rule search has been demonstrated for rule
19177 formation in two areas of chemistry. The high
19178 performance of programs which use the generated rules
19179 attests to the success of this learning strategy.",
19180 acknowledgement = ack-nhfb,
19181 pdfpages = "26",
19182 xxnumber = "CS-TR-77-597",
19183 }
19184
19185 @TechReport{Jonassen:1977:TAW,
19186 author = "Arne T. Jonassen and Donald E. Knuth",
19187 title = "A Trivial Algorithm Whose Analysis Isn't",
19188 type = "Technical Report",
19189 number = "STAN-CS-77-598 (AD-A040486)",
19190 institution = inst-STAN-CS,
19191 address = inst-STAN-CS:adr,
19192 pages = "iv + 32",
19193 month = apr,
19194 year = "1977",
19195 bibdate = "Thu Nov 27 18:18:30 2025",
19196 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
19197 URL = "https://apps.dtic.mil/sti/tr/pdf/ADA040486.pdf",
19198 abstract = "Very few theoretical results have been obtained to
19199 date about the behavior of information retrieval
19200 algorithms under random deletions, as well as random
19201 insertions. The present paper offers a possible
19202 explanation for this dearth of results, by showing that
19203 one of the simplest such algorithms already requires a
19204 surprisingly intricate analysis. Even when the data
19205 structure never contains more than three items at a
19206 time, it is shown that the performance of the standard
19207 tree search\slash insertion\slash deletion algorithm
19208 involves Bessel functions and the solution of bivariate
19209 integral equations. A step-by-step expository analysis
19210 of this problem is given, and it is shown how the
19211 difficulties arise and can be surmounted.",
19212 acknowledgement = ack-nhfb,
19213 pdfpages = "36",
19214 remark = "The PDF file is OCR'ed scans of microfiche page
19215 images.",
19216 }
19217
19218 @TechReport{Knuth:1977:ELS,
19219 author = "Donald E. Knuth and Arnold Sch{\"o}nhage",
19220 title = "The Expected Linearity of a Simple Equivalence
19221 Algorithm",
19222 type = "Technical Report",
19223 number = "STAN-CS-77-599 (AD-A040441)",
19224 institution = inst-STAN-CS,
19225 address = inst-STAN-CS:adr,
19226 pages = "iv + 56",
19227 month = mar,
19228 year = "1977",
19229 bibdate = "Fri Nov 21 14:21:14 2025",
19230 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
19231 URL = "https://apps.dtic.mil/sti/tr/pdf/ADA040441.pdf",
19232 abstract = "The average time needed to form unions of disjoint
19233 equivalence classes, using an algorithm suggested by
19234 Aho, Hopcroft, and Ullman, is shown to be linear in the
19235 total number of elements, thereby establishing a
19236 conjecture of A. C. Yao. he analytic methods used to
19237 prove this result are of interest in themselves, as
19238 they are based on extensions of Stepanov's approach to
19239 the study of random graphs. Several refinement of Yao's
19240 analyses of related algorithms are also presented.",
19241 acknowledgement = ack-nhfb,
19242 keywords = "analysis of algorithms; asymptotic methods; connected
19243 components; random graphs; random trees; recurrence
19244 relations; set union algorithms; union-find problems",
19245 pdfpages = "60",
19246 remark-1 = "Published in \booktitle{Theoretical Computer Science}
19247 {\bf 6}(3) 281--315, June 1978.",
19248 remark-2 = "The PDF file is OCR'ed scans of microfiche page
19249 images.",
19250 }
19251
19252 @TechReport{Brown:1977:APN,
19253 author = "Mark R. Brown",
19254 title = "The Analysis of a Practical and Nearly Optimal
19255 Priority Queue",
19256 type = "Technical Report",
19257 number = "STAN-CS-77-600 (AD-A040538)",
19258 institution = inst-STAN-CS,
19259 address = inst-STAN-CS:adr,
19260 pages = "iii + 99",
19261 month = mar,
19262 year = "1977",
19263 bibdate = "Fri Nov 21 14:21:14 2025",
19264 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
19265 URL = "",
19266 abstract = "The binomial queue, a new data structure for
19267 implementing priority queues that can be efficiently
19268 merged, was recently discovered by Jean Vuillemin; we
19269 explore the properties of this structure in detail. New
19270 methods of representing binomial queues are given which
19271 reduce the storage overhead of the structure and
19272 increase the efficiency of operations on it. One of
19273 these representations allows any element of an unknown
19274 priority queue to be deleted in log time, using only
19275 two pointers per element of the queue. A complete
19276 analysis of the average time for insertion into and
19277 deletion from a binomial queue is performed. This
19278 analysis is based on the result that the distribution
19279 of keys in a random binomial queue is also the
19280 stationary distribution obtained after repeated
19281 insertions and deletions.\par
19282
19283 An abstract notion of priority queue efficiency is
19284 defined, based on comparison counting. A good lower
19285 bound on the average and worst case number of
19286 comparisons is derived; several priority queue
19287 algorithms are exhibited which nearly attain the bound.
19288 It is shown that one of these algorithms, using
19289 binomial queues, can be characterized in a simple way
19290 based on the number and type of comparisons that it
19291 requires. The proof of this result involves an
19292 interesting problem on trees for which Huffman's
19293 construction gives a solution.",
19294 acknowledgement = ack-nhfb,
19295 pdfpages = "106",
19296 remark = "This is the author's thesis.",
19297 }
19298
19299 @TechReport{Reiser:1977:AAR,
19300 author = "John Frederick Reiser",
19301 title = "Analysis of Additive Random Number Generators",
19302 type = "Technical Report",
19303 number = "STAN-CS-77-601 (AD-A045652)",
19304 institution = inst-STAN-CS,
19305 address = inst-STAN-CS:adr,
19306 pages = "vi + 34",
19307 month = apr,
19308 year = "1977",
19309 bibdate = "Fri Nov 21 14:21:14 2025",
19310 bibsource = "https://www.math.utah.edu/pub/tex/bib/prng.bib;
19311 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
19312 URL = "https://apps.dtic.mil/sti/tr/pdf/ADA045652.pdf",
19313 abstract = "This thesis presents an analysis of the distribution
19314 of residues generated by the $ k^{\rm th}$-order linear
19315 homogeneous recurrence $ y_{n + k} = a_{k - 1} y + {n +
19316 k - 1} + \cdots {} + a_0 y_n \bmod p^\alpha $ when $
19317 x^k - a_{k - 1} x^{k - 1} - \cdots {} - a_0$ is a
19318 primitive polynomial in $ Z_p[x]$. It is shown that for
19319 $ t \leq k$ the tuples of $t$ consecutive residues are
19320 equidistributed in $t$ dimensions in the limit as $
19321 \alpha \to \infty $, subject only to a much weaker
19322 condition on the distribution of the residues. When
19323 specialized to $ |a_j| \leq 1$, the recurrence is the
19324 basis for a computer random number generator which can
19325 be efficiently implemented directly in floating-point
19326 arithmetic with no multiplication and little machine
19327 dependence. The results of empirical tests comparing
19328 generators of this type with standard linear
19329 congruential generators are also presented.",
19330 acknowledgement = ack-nhfb,
19331 pdfpages = "43",
19332 remark = "This is the author's Ph.D. thesis. The PDF file is
19333 OCR'ed scans of microfiche page images.",
19334 }
19335
19336 @TechReport{deBoor:1977:NSR,
19337 author = "Carl de Boor and Gene H. Golub",
19338 title = "The numerically stable reconstruction of a {Jacobi}
19339 matrix from spectral data",
19340 type = "Technical Report",
19341 number = "STAN-CS-77-602",
19342 institution = inst-STAN-CS,
19343 address = inst-STAN-CS:adr,
19344 pages = "vi + 18",
19345 month = mar,
19346 year = "1977",
19347 bibdate = "Fri Nov 7 07:00:05 MST 2025",
19348 bibsource = "https://www.math.utah.edu/pub/bibnet/authors/g/golub-gene-h.bib;
19349 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
19350 URL = "http://i.stanford.edu/TR/CS-TR-77-602.html",
19351 abstract = "We show how to construct, from certain spectral data,
19352 a discrete inner product for which the associated
19353 sequence of monic orthogonal polynomials coincides with
19354 the sequence of appropriately normalized characteristic
19355 polynomials of the left principal submatrices of the
19356 Jacobi matrix. The generation of these orthogonal
19357 polynomials via their three term recurrence relation,
19358 as popularized by Forsythe, then provides a stable
19359 means of computing the entries of the Jacobi matrix.
19360 The resulting algorithm might be of help in the
19361 approximate solution of inverse eigenvalue problems for
19362 Sturm-Liouville equations. Our construction provides,
19363 incidentally, very simple proofs of known results
19364 concerning existence and uniqueness of a Jacobi matrix
19365 satisfying given spectral data and its continuous
19366 dependence on that data.",
19367 acknowledgement = ack-nhfb,
19368 author-dates = "Gene Howard Golub (February 29, 1932--November 16,
19369 2007)",
19370 keywords = "Jacobi varieties; matrices",
19371 pdfpages = "26",
19372 xxnumber = "CS-TR-77-602",
19373 }
19374
19375 @TechReport{Tarjan:1977:RMR,
19376 author = "Robert Endre Tarjan",
19377 title = "Reference machines require non-linear time to maintain
19378 disjoint sets",
19379 type = "Technical Report",
19380 number = "STAN-CS-77-603 (AD-A041292)",
19381 institution = inst-STAN-CS,
19382 address = inst-STAN-CS:adr,
19383 pages = "45",
19384 month = mar,
19385 year = "1977",
19386 bibdate = "Fri Nov 7 07:00:05 MST 2025",
19387 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
19388 URL = "http://i.stanford.edu/TR/CS-TR-77-603.html",
19389 abstract = "This paper describes a machine model intended to be
19390 useful in deriving realistic complexity bounds for
19391 tasks requiring list processing. As an example of the
19392 use of the model, the paper shows that any such machine
19393 requires non-linear time in the worst case to compute
19394 unions of disjoint sets on-line. All set union
19395 algorithms known to me are instances of the model and
19396 are thus subject to the derived bound. One of the known
19397 algorithms achieves the bound to within a constant
19398 factor.",
19399 acknowledgement = ack-nhfb,
19400 pdfpages = "48",
19401 xxnumber = "CS-TR-77-603",
19402 }
19403
19404 @TechReport{Chan:1977:CDL,
19405 author = "Tony Fan C. Chan and Joseph Oliger",
19406 title = "Control of the dissipativity of {Lax--Wendroff} type
19407 methods for first order systems or hyperbolic
19408 equations",
19409 type = "Technical Report",
19410 number = "STAN-CS-77-604 (AD-A040399)",
19411 institution = inst-STAN-CS,
19412 address = inst-STAN-CS:adr,
19413 pages = "45",
19414 month = mar,
19415 year = "1977",
19416 bibdate = "Fri Nov 7 07:00:05 MST 2025",
19417 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
19418 URL = "http://i.stanford.edu/TR/CS-TR-77-604.html",
19419 abstract = "Lax--Wendroff methods for hyperbolic systems have two
19420 characteristics which are sometimes troublesome. They
19421 are sometimes too dissipative --- they may smooth the
19422 solution excessively --- and their dissipative behavior
19423 does not affect all modes of the solution equally. Both
19424 of these difficulties can be remedied by adding
19425 properly chosen accretive terms. We develop
19426 modifications of the Lax--Wendroff method which
19427 equilibrate the dissipativity over the fundamental
19428 modes of the solution and allow the magnitude of the
19429 dissipation to be controlled. We show that these
19430 methods are stable for the mixed initial boundary value
19431 problem and develop analogous formulations for the
19432 two-step Lax--Wendroff and MacCormack methods.",
19433 acknowledgement = ack-nhfb,
19434 pdfpages = "48",
19435 xxnumber = "CS-TR-77-604",
19436 }
19437
19438 @TechReport{Smith:1977:MLS,
19439 author = "Reid G. Smith and Tom M. Mitchell and Richard A.
19440 Chestek and Bruce G. Buchanan",
19441 title = "A model for learning systems",
19442 type = "Technical Report",
19443 number = "STAN-CS-77-605 (HPP-77-14, AD-A042834)",
19444 institution = inst-STAN-CS,
19445 address = inst-STAN-CS:adr,
19446 pages = "??",
19447 month = mar,
19448 year = "1977",
19449 bibdate = "Fri Nov 7 07:00:05 MST 2025",
19450 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
19451 URL = "http://i.stanford.edu/TR/CS-TR-77-605.html",
19452 abstract = "A model for learning systems is presented, and
19453 representative AI, pattern recognition, and control
19454 systems are discussed in terms of its framework. The
19455 model details the functional components felt to be
19456 essential for any learning system, independent of the
19457 techniques used for its construction, and the specific
19458 environment in which it operates. These components are
19459 performance element, instance selector, critic,
19460 learning element, blackboard, and world model.
19461 Consideration of learning system design leads naturally
19462 to the concept of a layered system, each layer
19463 operating at a different level of abstraction.",
19464 acknowledgement = ack-nhfb,
19465 pdfpages = "26",
19466 xxnumber = "CS-TR-77-605",
19467 }
19468
19469 @TechReport{Clancy:1977:PPS,
19470 author = "Michael J. Clancy and Donald E. Knuth",
19471 title = "A programming and problem-solving seminar",
19472 type = "Technical Report",
19473 number = "STAN-CS-77-606",
19474 institution = inst-STAN-CS,
19475 address = inst-STAN-CS:adr,
19476 pages = "??",
19477 day = "1",
19478 month = apr,
19479 year = "1977",
19480 bibdate = "Fri Nov 7 07:00:05 MST 2025",
19481 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
19482 URL = "http://i.stanford.edu/TR/CS-TR-77-606.html;
19483 http://www-db.stanford.edu/TR/CS-TR-77-606.html;
19484 http://www.ncstrl.org:8900/ncstrl/servlet/search?formname=detail&id=oai%3Ancstrlh%3Astan%3ASTAN%2F%2FCS-TR-77-606",
19485 abstract = "This report contains edited transcripts of the
19486 discussions held in Stanford's course CS 204, Problem
19487 Seminar, during autumn quarter 1976. Since the topics
19488 span a large range of ideas in computer science, and
19489 since most of the important research paradigms and
19490 programming paradigms came up during the discussions,
19491 the notes may be of use to graduate students of
19492 computer science at other universities, as well as to
19493 their professors and to professional people in the
19494 ``real world''.",
19495 acknowledgement = ack-nhfb,
19496 documentid = "oai:ncstrlh:stan:STAN//CS-TR-77-606",
19497 pdfpages = "108",
19498 xxnumber = "CS-TR-77-606",
19499 }
19500
19501 @TechReport{Owicki:1977:SPA,
19502 author = "Susan S. Owicki",
19503 title = "Specifications and proofs for abstract data types in
19504 concurrent programs",
19505 type = "Technical Report",
19506 number = "STAN-CS-77-607 (CSL-TR-133)",
19507 institution = inst-STAN-CS,
19508 address = inst-STAN-CS:adr,
19509 pages = "??",
19510 month = apr,
19511 year = "1977",
19512 bibdate = "Fri Nov 7 07:00:05 MST 2025",
19513 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
19514 URL = "http://i.stanford.edu/TR/CS-TR-77-607.html",
19515 abstract = "Shared abstract data types, such as queues and
19516 buffers, are useful tools for building well-structured
19517 concurrent programs. This paper presents a method for o
19518 specifying shared types in a way that simplifies
19519 concurrent program verification. The specifications
19520 describe the operations of the shared type in terms of
19521 their effect on variables of the process invoking the
19522 operation. This makes it possible to verify the
19523 processes independently, reducing the complexity of the
19524 proof. The key to defining such specifications is the
19525 concept of a private variable: a variable which is part
19526 of a shared object but belongs to just one process.
19527 Shared types can be implemented using an extended form
19528 of monitors; proof rules are given for verifying that a
19529 monitor correctly implements its specifications.
19530 Finally, it is shown how concurrent programs can be
19531 verified using the specifications of their shared
19532 types. The specification and proof techniques are
19533 illustrated with a number of examples involving a
19534 shared bounded buffer.",
19535 acknowledgement = ack-nhfb,
19536 pdfpages = "30",
19537 xxnumber = "CS-TR-77-607",
19538 }
19539
19540 @TechReport{Simon:1977:SSR,
19541 author = "Istvan Simon",
19542 title = "On Some Subrecursive Reducibilities",
19543 type = "Technical Report",
19544 number = "STAN-CS-77-608",
19545 institution = inst-STAN-CS,
19546 address = inst-STAN-CS:adr,
19547 pages = "102",
19548 month = jun,
19549 year = "1977",
19550 bibdate = "Fri Nov 21 14:21:14 2025",
19551 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
19552 URL = "",
19553 acknowledgement = ack-nhfb,
19554 remark = "This is the author's thesis.",
19555 }
19556
19557 @TechReport{Tarjan:1977:CCA,
19558 author = "Robert Endre Tarjan",
19559 title = "Complexity of combinatorial algorithms",
19560 type = "Technical Report",
19561 number = "STAN-CS-77-609 (AD-A043362)",
19562 institution = inst-STAN-CS,
19563 address = inst-STAN-CS:adr,
19564 pages = "??",
19565 month = apr,
19566 year = "1977",
19567 bibdate = "Fri Nov 7 07:00:05 MST 2025",
19568 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
19569 URL = "http://i.stanford.edu/TR/CS-TR-77-609.html",
19570 abstract = "This paper examines recent work on the complexity of
19571 combinatorial algorithms, highlighting the aims of the
19572 work, the mathematical tools used, and the important
19573 results. Included are sections discussing ways to
19574 measure the complexity of an algorithm, methods for
19575 proving that certain problems are very hard to solve,
19576 tools useful in the design of good algorithms, and
19577 recent improvements in algorithms for solving ten
19578 representative problems. The final section suggests
19579 some directions for future research.",
19580 acknowledgement = ack-nhfb,
19581 pdfpages = "90",
19582 xxnumber = "CS-TR-77-609",
19583 }
19584
19585 @TechReport{Winograd:1977:FUD,
19586 author = "Terry A. Winograd",
19587 title = "A Framework for Understanding Discourse",
19588 type = "Technical Report",
19589 number = "STAN-CS-77-610 (AIM-297)",
19590 institution = inst-STAN-CS,
19591 address = inst-STAN-CS:adr,
19592 pages = "97",
19593 month = jun,
19594 year = "1977",
19595 bibdate = "Fri Nov 21 14:21:14 2025",
19596 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
19597 URL = "",
19598 acknowledgement = ack-nhfb,
19599 }
19600
19601 @TechReport{Manna:1977:LCP,
19602 author = "Zohar Manna and Richard J. Waldinger",
19603 title = "The logic of computer programming",
19604 type = "Technical Report",
19605 number = "STAN-CS-77-611 (AIM-298, AD-A046703)",
19606 institution = inst-STAN-CS,
19607 address = inst-STAN-CS:adr,
19608 pages = "90",
19609 month = aug,
19610 year = "1977",
19611 bibdate = "Fri Nov 7 07:00:05 MST 2025",
19612 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
19613 URL = "http://i.stanford.edu/TR/CS-TR-77-611.html",
19614 abstract = "Techniques derived from mathematical logic promise to
19615 provide an alternative to the conventional methodology
19616 for constructing, debugging, and optimizing computer
19617 programs. Ultimately, these techniques are intended to
19618 lead to the automation of many of the facets of the
19619 programming process. This paper provides a unified
19620 tutorial exposition of the logical techniques,
19621 illustrating each with examples. The strengths and
19622 limitations of each technique as a practical
19623 programming aid are assessed and attempts to implement
19624 these methods in experimental systems are discussed.",
19625 acknowledgement = ack-nhfb,
19626 pdfpages = "88",
19627 xxnumber = "CS-TR-77-611",
19628 }
19629
19630 @TechReport{Nii:1977:RBU,
19631 author = "H. Penny Nii and Edward A. Feigenbaum",
19632 title = "Rule-Based Understanding of Signals",
19633 type = "Technical Report",
19634 number = "STAN-CS-77-612 (HPP-77-7, AD-A042756)",
19635 institution = inst-STAN-CS,
19636 address = inst-STAN-CS:adr,
19637 pages = "iv + 23",
19638 month = apr,
19639 year = "1977",
19640 bibdate = "Fri Nov 21 14:21:14 2025",
19641 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
19642 URL = "",
19643 abstract = "SU/X and SU/P are knowledge-based programs which
19644 employ pattern-invoked inference methods. Both tasks
19645 are concerned with the interpretation of large
19646 quantities of digitized signal data. The task of SU/X
19647 is to understand ``continuous signals,'' that is,
19648 signals which persist over time. The task of SU/P is to
19649 interpret protein X-ray crystallographic data. Some
19650 features of the design are: (1) incremental
19651 interpretation of data employing many different
19652 pattern-invoked sources of knowledge, (2) production
19653 rule representation of knowledge, including high level
19654 strategy knowledge, (3) ``opportunistic'' hypothesis
19655 formation using both data-driven and model-driven
19656 techniques within a general hypothesize-and~test
19657 paradigm; and (4) multilevel representation of the
19658 solution hypothesis.",
19659 acknowledgement = ack-nhfb,
19660 keywords = "application; data-driven; event-driven program;
19661 expectation-driven; experts; heuristics; hierarchical
19662 control; hierarchical hypothesis; hypothesis formation;
19663 incremental hypothesis formation; knowledge sources;
19664 knowledge-based program; levels of abstraction;
19665 model-driven; problem solving strategy; production
19666 rules; signal interpretation",
19667 pdfpages = "27",
19668 }
19669
19670 @TechReport{Spedicato:1977:SCQ,
19671 author = "E. Spedicato",
19672 title = "On Some Classes of Quasi-{Newton} Methods for Systems
19673 of Nonlinear Algebraic Equations",
19674 type = "Technical Report",
19675 number = "STAN-CS-77-613",
19676 institution = inst-STAN-CS,
19677 address = inst-STAN-CS:adr,
19678 pages = "23",
19679 month = jun,
19680 year = "1977",
19681 bibdate = "Fri Nov 21 14:21:14 2025",
19682 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
19683 URL = "",
19684 acknowledgement = ack-nhfb,
19685 }
19686
19687 @TechReport{Manna:1977:CFF,
19688 author = "Zohar Manna and Adi Shamir",
19689 title = "The convergence of functions to fixedpoints of
19690 recursive definitions",
19691 type = "Technical Report",
19692 number = "STAN-CS-77-614 (AIM-299)",
19693 institution = inst-STAN-CS,
19694 address = inst-STAN-CS:adr,
19695 pages = "45",
19696 month = may,
19697 year = "1977",
19698 bibdate = "Fri Nov 7 07:00:05 MST 2025",
19699 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
19700 URL = "http://i.stanford.edu/TR/CS-TR-77-614.html",
19701 abstract = "The classical method for constructing the least
19702 fixedpoint of a recursive definition is to generate a
19703 sequence of functions whose initial element is the
19704 totally undefined function and which converges to the
19705 desired least fixedpoint. This method, due to Kleene,
19706 cannot be generalized to allow the construction of
19707 other fixedpoints. In this paper we present an
19708 alternate definition of convergence and a new
19709 fixedpoint access method of generating sequences of
19710 functions for a given recursive definition. The initial
19711 function of the sequence can be an arbitrary function,
19712 and the sequence will always converge to a fixedpoint
19713 that is `close' to the initial function. This defines a
19714 monotonic mapping from the set of partial functions
19715 onto the set of all fixedpoints of the given recursive
19716 definition.",
19717 acknowledgement = ack-nhfb,
19718 pdfpages = "52",
19719 xxnumber = "CS-TR-77-614",
19720 }
19721
19722 @TechReport{Glowinski:1977:NMF,
19723 author = "Roland Glowinski and Olivier Pironneau",
19724 title = "Numerical methods for the first biharmonic equation
19725 and for the two-dimensional {Stokes} problem",
19726 type = "Technical Report",
19727 number = "STAN-CS-77-615",
19728 institution = inst-STAN-CS,
19729 address = inst-STAN-CS:adr,
19730 pages = "??",
19731 month = may,
19732 year = "1977",
19733 bibdate = "Fri Nov 7 07:00:05 MST 2025",
19734 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
19735 URL = "http://i.stanford.edu/TR/CS-TR-77-615.html",
19736 abstract = "We describe in this report various methods, iterative
19737 and `almost direct,' for solving the first biharmonic
19738 problem on general two-dimensional domains once the
19739 continuous problem has been approximated by an
19740 appropriate mixed finite element method. Using the
19741 approach described in this report we recover some well
19742 known methods for solving the first biharmonic equation
19743 as a system of coupled harmonic equations, but some of
19744 the methods discussed here are completely new,
19745 including a conjugate gradient type algorithm. In the
19746 last part of this report we discuss the extension of
19747 the above methods to the numerical solution of the two
19748 dimensional Stokes problem in $p$-connected domains $
19749 (p \geq 1)$ through the stream function-vorticity
19750 formulation.",
19751 acknowledgement = ack-nhfb,
19752 pdfpages = "90",
19753 xxnumber = "CS-TR-77-615",
19754 }
19755
19756 @TechReport{Kreiss:1977:SFM,
19757 author = "Heinz-Otto Kreiss and Joseph Oliger",
19758 title = "Stability of the {Fourier} method",
19759 type = "Technical Report",
19760 number = "STAN-CS-77-616 (AD-A046311)",
19761 institution = inst-STAN-CS,
19762 address = inst-STAN-CS:adr,
19763 pages = "25",
19764 month = aug,
19765 year = "1977",
19766 bibdate = "Fri Nov 7 07:00:05 MST 2025",
19767 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
19768 URL = "http://i.stanford.edu/TR/CS-TR-77-616.html",
19769 abstract = "In this paper we develop a stability theory for the
19770 Fourier (or pseudo-spectral) method for linear
19771 hyperbolic and parabolic partial differential equations
19772 with variable coefficients.",
19773 acknowledgement = ack-nhfb,
19774 pdfpages = "32",
19775 xxnumber = "CS-TR-77-616",
19776 }
19777
19778 @TechReport{Winograd:1977:SCS,
19779 author = "Terry A. Winograd",
19780 title = "On some Contested Suppositions of Generative
19781 Linguistics about the Scientific Study of Language",
19782 type = "Technical Report",
19783 number = "STAN-CS-77-617 (AIM-300)",
19784 institution = inst-STAN-CS,
19785 address = inst-STAN-CS:adr,
19786 pages = "25",
19787 month = sep,
19788 year = "1977",
19789 bibdate = "Fri Nov 21 14:21:14 2025",
19790 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
19791 URL = "",
19792 acknowledgement = ack-nhfb,
19793 }
19794
19795 @TechReport{Nilsson:1977:PSA,
19796 author = "Nils J. Nilsson",
19797 title = "A production system for automatic deduction",
19798 type = "Technical Report",
19799 number = "STAN-CS-77-618 (HPP-77-28, AD-A045948)",
19800 institution = inst-STAN-CS,
19801 address = inst-STAN-CS:adr,
19802 pages = "42",
19803 month = aug,
19804 year = "1977",
19805 bibdate = "Fri Nov 7 07:00:05 MST 2025",
19806 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
19807 URL = "http://i.stanford.edu/TR/CS-TR-77-618.html",
19808 abstract = "A new predicate calculus deduction system based on
19809 production rules is proposed. The system combines
19810 several developments in Artificial Intelligence and
19811 Automatic Theorem Proving research including the use of
19812 domain-specific inference rules and separate mechanisms
19813 for forward and backward reasoning. It has a clean
19814 separation between the data base, the production rules,
19815 and the control system. Goals and subgoals are
19816 maintained in an AND/OR tree to represent assertions.
19817 The production rules modify these structures until they
19818 `connect' in a fashion that proves the goal theorem.
19819 Unlike some previous systems that used production
19820 rules, ours is not limited to rules in Horn Clause
19821 form. Unlike previous PLANNER-like systems, ours can
19822 handle the full range of predicate calculus expressions
19823 including those with quantified variables, disjunctions
19824 and negations.",
19825 acknowledgement = ack-nhfb,
19826 pdfpages = "54",
19827 xxnumber = "CS-TR-77-618",
19828 }
19829
19830 @TechReport{Paul:1977:TST,
19831 author = "Wolfgang J. Paul and Robert Endre Tarjan",
19832 title = "Time-space trade-offs in a pebble game",
19833 type = "Technical Report",
19834 number = "STAN-CS-77-619 (AD-A046481)",
19835 institution = inst-STAN-CS,
19836 address = inst-STAN-CS:adr,
19837 pages = "8",
19838 month = jul,
19839 year = "1977",
19840 bibdate = "Fri Nov 7 07:00:05 MST 2025",
19841 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
19842 URL = "http://i.stanford.edu/TR/CS-TR-77-619.html",
19843 abstract = "A certain pebble game on graphs has been studied in
19844 various contexts as a model for the time and space
19845 requirements of computations. In this note it is shown
19846 that there exists a family of directed acyclic graphs $
19847 G_n $ and constants $ c_1 $, $ c_2 $, $ c_3 $ such that
19848 (1) $ G_n $ has n nodes and each node in $ G_n $ has
19849 indegree at most 2. (2) Each graph $ G_n $ can be
19850 pebbled with $ c_1 \sqrt {n} $ pebbles in n moves. (3)
19851 Each graph $ G_n $ can also be pebbled with $ C_2 \sqrt
19852 {n} $ pebbles, $ c_2 $ < $ c_1 $, but every strategy
19853 which achieves this has at least $ 2^{c_3 \sqrt {n}} $
19854 moves.",
19855 acknowledgement = ack-nhfb,
19856 pdfpages = "10",
19857 xxnumber = "CS-TR-77-619",
19858 }
19859
19860 @TechReport{Bolstad:1977:AFM,
19861 author = "J. Bolstad and J. Oliger",
19862 title = "Adaptation of the {Fourier} Method to the Nonperiodic
19863 Initial Boundary Value Problem",
19864 type = "Technical Report",
19865 number = "STAN-CS-77-620",
19866 institution = inst-STAN-CS,
19867 address = inst-STAN-CS:adr,
19868 pages = "80",
19869 month = sep,
19870 year = "1977",
19871 bibdate = "Fri Nov 21 14:21:14 2025",
19872 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
19873 URL = "",
19874 acknowledgement = ack-nhfb,
19875 }
19876
19877 @TechReport{Feigenbaum:1977:AAI,
19878 author = "Edward A. Feigenbaum",
19879 title = "The art of artificial intelligence: {I}. {Themes} and
19880 case studies of knowledge engineering",
19881 type = "Technical Report",
19882 number = "STAN-CS-77-621 (HPP-77-25, AD-A046289)",
19883 institution = inst-STAN-CS,
19884 address = inst-STAN-CS:adr,
19885 pages = "80",
19886 month = aug,
19887 year = "1977",
19888 bibdate = "Fri Nov 7 07:00:05 MST 2025",
19889 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
19890 URL = "http://i.stanford.edu/TR/CS-TR-77-621.html",
19891 abstract = "The knowledge engineer practices the art of bringing
19892 the principles and tools of AI research to bear on
19893 difficult applications problems requiring experts'
19894 knowledge for their solution. The technical issues of
19895 acquiring this knowledge, representing it, and using it
19896 appropriately to construct and explain
19897 lines-of-reasoning, are important problems in the
19898 design of knowledge-based systems. Various systems that
19899 have achieved expert level performance in scientific
19900 and medical inference illuminates the art of knowledge
19901 engineering and its parent science, Artificial
19902 Intelligence.",
19903 acknowledgement = ack-nhfb,
19904 pdfpages = "20",
19905 xxnumber = "CS-TR-77-621",
19906 }
19907
19908 @TechReport{Golub:1977:GCV,
19909 author = "Gene H. Golub and Michael Heath and Grace Wahba",
19910 title = "Generalized cross-validation as a method for choosing
19911 a good ridge parameter",
19912 type = "Technical Report",
19913 number = "STAN-CS-77-622",
19914 institution = inst-STAN-CS,
19915 address = inst-STAN-CS:adr,
19916 pages = "25",
19917 month = sep,
19918 year = "1977",
19919 DOI = "https://doi.org/10.1080/00401706.1979.10489751",
19920 bibdate = "Mon Oct 24 10:35:29 MDT 1994",
19921 bibsource = "https://www.math.utah.edu/pub/bibnet/authors/g/golub-gene-h.bib;
19922 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
19923 note = "Also issued as Department of Statistics Technical
19924 Report number 491, University of Wisconsin, Madison,
19925 WI.",
19926 URL = "http://www.stat.yale.edu/~jtc5/312_612/readings/generalized-cross-validation-and-ridge_Golub-Heath-Wahba_79.pdf;
19927 https://www.jstor.org/stable/10.2307/1268518",
19928 acknowledgement = ack-nhfb,
19929 author-dates = "Gene Howard Golub (February 29, 1932--November 16,
19930 2007)",
19931 keywords = "graphic methods; regression analysis",
19932 remark = "Published in \booktitle{Technometrics}, {\bf 21}(2)
19933 215--223, May 1979,
19934 doi:10.1080/00401706.1979.10489751.",
19935 xxnumber = "CS-TR-77-622",
19936 }
19937
19938 @TechReport{Boley:1977:IEPa,
19939 author = "D. Boley and Gene H. Golub",
19940 title = "Inverse eigenvalue problems for band matrices",
19941 type = "Technical Report",
19942 number = "STAN-CS-77-623",
19943 institution = inst-STAN-CS,
19944 address = inst-STAN-CS:adr,
19945 pages = "9",
19946 month = sep,
19947 year = "1977",
19948 bibdate = "Mon Oct 24 10:35:29 MDT 1994",
19949 bibsource = "https://www.math.utah.edu/pub/bibnet/authors/g/golub-gene-h.bib;
19950 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
19951 URL = "",
19952 acknowledgement = ack-nhfb,
19953 author-dates = "Gene Howard Golub (February 29, 1932--November 16,
19954 2007)",
19955 keywords = "eigenvalues; matrices",
19956 remark = "Published in \booktitle{Numerical Analysis:
19957 Proceedings of the Biennial Conference held at Dundee,
19958 June 28--July 1, 1977}, Springer 1978, ISBN
19959 0-387-08538-6.",
19960 xxnumber = "CS-TR-77-623",
19961 }
19962
19963 @TechReport{McCarthy:1977:RRC,
19964 author = "John McCarthy and Thomas O. Binford and Cordell C.
19965 Green and David C. Luckham and Zohar Manna and Terry A.
19966 Winograd and Lester D. Earnest",
19967 title = "Recent research in computer science",
19968 type = "Technical Report",
19969 number = "STAN-CS-77-624 (AIM-301, AD-A044231)",
19970 institution = inst-STAN-CS,
19971 address = inst-STAN-CS:adr,
19972 pages = "118",
19973 month = jun,
19974 year = "1977",
19975 bibdate = "Fri Nov 7 07:00:05 MST 2025",
19976 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
19977 URL = "http://i.stanford.edu/TR/CS-TR-77-624.html;
19978 https://apps.dtic.mil/sti/tr/pdf/ADA044231.pdf",
19979 abstract = "This report summarizes recent accomplishments in six
19980 related areas: (1) basic AI research and formal
19981 reasoning, (2) image understanding, (3) mathematical
19982 theory of computation, (4) program verification, (5)
19983 natural language understanding, and (6) knowledge based
19984 programming.",
19985 acknowledgement = ack-nhfb,
19986 author-dates = "John McCarthy (4 September 1927--24 October 2011)",
19987 pdfpages = "126",
19988 xxnumber = "CS-TR-77-624",
19989 }
19990
19991 @TechReport{Brown:1977:FMA,
19992 author = "Mark R. Brown and Robert Endre Tarjan",
19993 title = "A fast merging algorithm",
19994 type = "Technical Report",
19995 number = "STAN-CS-77-625 (AD-A046090)",
19996 institution = inst-STAN-CS,
19997 address = inst-STAN-CS:adr,
19998 pages = "iv + 42",
19999 month = aug,
20000 year = "1977",
20001 bibdate = "Fri Nov 7 07:00:05 MST 2025",
20002 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
20003 URL = "http://i.stanford.edu/TR/CS-TR-77-625.html;
20004 https://apps.dtic.mil/sti/tr/pdf/ADA046090.pdf",
20005 abstract = "We give an algorithm which merges sorted lists
20006 represented as balanced binary trees. If the lists have
20007 lengths $m$ and $ n (m \leq n)$, then the merging
20008 procedure runs in $ O(m \log n / m) $ steps, which is
20009 the same order as the lower bound on all
20010 comparison-based algorithms for this problem.",
20011 acknowledgement = ack-nhfb,
20012 pdfpages = "44",
20013 remark = "The ADA046090 PDF file is OCR'ed scans of microfiche
20014 page images.",
20015 xxnumber = "CS-TR-77-625",
20016 }
20017
20018 @TechReport{Yao:1977:LSA,
20019 author = "Andrew Chi-Chih Yao",
20020 title = "On the loop switching addressing problem",
20021 type = "Technical Report",
20022 number = "STAN-CS-77-626",
20023 institution = inst-STAN-CS,
20024 address = inst-STAN-CS:adr,
20025 pages = "21",
20026 month = oct,
20027 year = "1977",
20028 bibdate = "Fri Nov 7 07:00:05 MST 2025",
20029 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
20030 URL = "http://i.stanford.edu/TR/CS-TR-77-626.html",
20031 abstract = "The following graph addressing problem was studied by
20032 Graham and Pollak in devising a routing scheme for
20033 Pierce's Loop Switching Network. Let $G$ be a graph
20034 with $n$ vertices. It is desired to assign to each
20035 vertex $ v_i$ an address in $ {{0, 1, *}}^\ell $, such
20036 that the Hamming distance between the addresses of any
20037 two vertices agrees with their distance in $G$. Let $
20038 N(G)$ be the minimum length $ \ell $ for which an
20039 assignment is possible. It was shown by Graham and
20040 Pollak that $ N(G) \leq m_G(n - 1)$, where $ m_G$ is
20041 the diameter of $G$. In the present paper, we shall
20042 prove that $ N(G) \leq 1.09 (\lg m_G)n + 8 n$ by an
20043 explicit construction. This shows in particular that
20044 any graph has an addressing scheme of length $ O(n \log
20045 n)$.",
20046 acknowledgement = ack-nhfb,
20047 pdfpages = "24",
20048 xxnumber = "CS-TR-77-626",
20049 }
20050
20051 @TechReport{Lipton:1977:STP,
20052 author = "Richard J. Lipton and Robert Endre Tarjan",
20053 title = "A separator theorem for planar graphs",
20054 type = "Technical Report",
20055 number = "STAN-CS-77-627 (AD-A048786)",
20056 institution = inst-STAN-CS,
20057 address = inst-STAN-CS:adr,
20058 pages = "31",
20059 month = oct,
20060 year = "1977",
20061 bibdate = "Fri Nov 7 07:00:05 MST 2025",
20062 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
20063 URL = "http://i.stanford.edu/TR/CS-TR-77-627.html",
20064 abstract = "Let $G$ be any $n$-vertex planar graph. We prove that
20065 the vertices of $G$ can be partitioned into three sets
20066 $A$, $B$, $C$ such that no edge joins a vertex in $A$
20067 with a vertex in $B$, neither $A$ nor $B$ contains more
20068 than $ 2 n / 3 $ vertices, and $C$ contains no more
20069 than $ 2 \sqrt {2} \sqrt {2} $ vertices. We exhibit an
20070 algorithm which finds such a partition $A$, $B$, $C$ in
20071 $ O(n)$ time.",
20072 acknowledgement = ack-nhfb,
20073 pdfpages = "34",
20074 xxnumber = "CS-TR-77-627",
20075 }
20076
20077 @TechReport{Lipton:1977:APS,
20078 author = "Richard J. Lipton and Robert Endre Tarjan",
20079 title = "Applications of a planar separator theorem",
20080 type = "Technical Report",
20081 number = "STAN-CS-77-628 (AD-A048787)",
20082 institution = inst-STAN-CS,
20083 address = inst-STAN-CS:adr,
20084 pages = "34",
20085 month = oct,
20086 year = "1977",
20087 bibdate = "Fri Nov 7 07:00:05 MST 2025",
20088 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
20089 URL = "http://i.stanford.edu/TR/CS-TR-77-628.html",
20090 abstract = "Any $n$-vertex planar graph has the property that it
20091 can be divided into components of roughly equal size by
20092 removing only $ O(\sqrt {n}) $ vertices. This separator
20093 theorem, in combination with a divide-and-conquer
20094 strategy, leads to many new complexity results for
20095 planar graph problems. This paper describes some of
20096 these results.",
20097 acknowledgement = ack-nhfb,
20098 pdfpages = "36",
20099 xxnumber = "CS-TR-77-628",
20100 }
20101
20102 @TechReport{Yao:1977:CPM,
20103 author = "Andrew Chi-Chih Yao",
20104 title = "The complexity of pattern matching for a random
20105 string",
20106 type = "Technical Report",
20107 number = "STAN-CS-77-629",
20108 institution = inst-STAN-CS,
20109 address = inst-STAN-CS:adr,
20110 pages = "43",
20111 month = oct,
20112 year = "1977",
20113 bibdate = "Fri Nov 7 07:00:05 MST 2025",
20114 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib;
20115 https://www.math.utah.edu/pub/tex/bib/string-matching.bib",
20116 URL = "http://i.stanford.edu/TR/CS-TR-77-629.html",
20117 abstract = "We study the average-case complexity of finding all
20118 occurrences of a given pattern $ \alpha $ in an input
20119 text string. Over an alphabet of q symbols, let $
20120 c(\alpha, n) $ be the minimum average number of
20121 characters that need to be examined in a random text
20122 string of length $n$. We prove that, for large $m$,
20123 almost all patterns $ \alpha $ of length $m$ satisfy $
20124 c(\alpha, n) = \Theta (\lceil \log_q ({n - m} / {\ln m}
20125 + 2) \rceil)$ if $ m \leq n \leq 2 m$, and $ c(\alpha,
20126 n) = \Theta ({\lceil \log_q m \rceil } / m n)$ if $ n >
20127 2 m$. This in particular confirms a conjecture raised
20128 in a recent paper by Knuth, Morris, and Pratt [1977].",
20129 acknowledgement = ack-nhfb,
20130 pdfpages = "46",
20131 xxnumber = "CS-TR-77-629",
20132 }
20133
20134 @TechReport{Manna:1977:SDP,
20135 author = "Zohar Manna and Richard Waldinger",
20136 title = "Synthesis: Dreams => Programs",
20137 type = "Technical Report",
20138 number = "STAN-CS-77-630 (AIM-302, AD-A049761)",
20139 institution = inst-STAN-CS,
20140 address = inst-STAN-CS:adr,
20141 pages = "119",
20142 month = oct,
20143 year = "1977",
20144 bibdate = "Fri Nov 21 14:21:14 2025",
20145 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
20146 URL = "",
20147 acknowledgement = ack-nhfb,
20148 }
20149
20150 @TechReport{Dershowitz:1977:IRP,
20151 author = "Nachum Dershowitz and Zohar Manna",
20152 title = "Inference rules for program annotation",
20153 type = "Technical Report",
20154 number = "STAN-CS-77-631 (AIM-303, AD-A050806)",
20155 institution = inst-STAN-CS,
20156 address = inst-STAN-CS:adr,
20157 pages = "46",
20158 month = oct,
20159 year = "1977",
20160 bibdate = "Fri Nov 7 07:00:05 MST 2025",
20161 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
20162 URL = "http://i.stanford.edu/TR/CS-TR-77-631.html;
20163 https://apps.dtic.mil/sti/tr/pdf/ADA050806.pdf",
20164 abstract = "Methods are presented whereby an Algol-like program,
20165 given together with its specifications, can be
20166 documented automatically. The program is incrementally
20167 annotated with invariant relationships that hold
20168 between program variables at intermediate points in the
20169 program and explain the actual workings of the program
20170 regardless of whether the program is correct. Thus this
20171 documentation can be used for proving the correctness
20172 of the program or may serve as an aid in the debugging
20173 of an incorrect program. The annotation techniques are
20174 formulated as Hoare-like inference rules which derive
20175 invariants from the assignment statements, from the
20176 control structure of the program, or, heuristically,
20177 from suggested invariants. The application of these
20178 rules is demonstrated by two examples which have run on
20179 an experimental implementation.",
20180 acknowledgement = ack-nhfb,
20181 pdfpages = "54",
20182 remark = "The ADA0050806 PDF file is OCR'ed scans of microfiche
20183 page images, but the Stanford version is clean.",
20184 xxnumber = "CS-TR-77-631",
20185 }
20186
20187 @TechReport{Wagner:1977:HV,
20188 author = "Todd Jeffery Wagner",
20189 title = "Hardware Verification",
20190 type = "Technical Report",
20191 number = "STAN-CS-77-632 (AIM-304, AD-A048684)",
20192 institution = inst-STAN-CS,
20193 address = inst-STAN-CS:adr,
20194 pages = "iv + 99",
20195 month = sep,
20196 year = "1977",
20197 bibdate = "Fri Nov 21 14:21:14 2025",
20198 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
20199 URL = "",
20200 abstract = "Methods for detecting logical errors in computer
20201 hardware designs using symbolic manipulation instead of
20202 digital simulation are discussed. A non-procedural
20203 register transfer language is proposed that is suitable
20204 for describing how a digital circuit should perform.
20205 This language can also be used to describe each of the
20206 components used in the design. Transformations are
20207 presented which should enable the designer to either
20208 prove or disprove that the set of interconnected
20209 components correctly satisfy the specifications for the
20210 overall system.\par
20211
20212 The problem of detecting timing anomalies such as
20213 races, hazards, and oscillations is addressed. Also
20214 explored are some interesting relationships between the
20215 problems of hardware verification and program
20216 verification. Finally, the results of using an existing
20217 proof checking program on some digital circuits are
20218 presented. Although the theorem proving approach is not
20219 very efficient for simple circuits, it becomes
20220 increasingly as circuits become more complex. This is
20221 because the theorem proving approach can use
20222 complicated component specifications without reducing
20223 them to the gate level.",
20224 acknowledgement = ack-nhfb,
20225 pdfpages = "105",
20226 remark = "This is the author's Ph.D. thesis.",
20227 }
20228
20229 @TechReport{Faught:1977:MIC,
20230 author = "William S. Faught",
20231 title = "Motivation and Intensionality in a Computer Simulation
20232 Model",
20233 type = "Technical Report",
20234 number = "STAN-CS-77-633 (AIM-305, AD-A048660)",
20235 institution = inst-STAN-CS,
20236 address = inst-STAN-CS:adr,
20237 pages = "v + 99",
20238 month = sep,
20239 year = "1977",
20240 bibdate = "Fri Nov 21 14:21:14 2025",
20241 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
20242 URL = "",
20243 abstract = "This dissertation describes a computer simulation
20244 model of paranoia. The model mimics the behavior of a
20245 patient participating in a psychiatric interview by
20246 answering questions, introducing its own topics, and
20247 responding to negatively-valued (e.g., threatening or
20248 shame. producing) situations.\par
20249
20250 The focus of this work is on the motivational
20251 mechanisms required to instigate and direct the
20252 modelled behavior.\par
20253
20254 The major components of the model are:\par
20255
20256 (1) A production system (PS) formalism accounting for
20257 the instigation and guidance of behavior as a function
20258 of internal (affective) and external (real-world)
20259 environmental factors, Each rule in the PS is either an
20260 action pattern (AP) or an interpretation pattern (IP).
20261 Both may have either affect (emotion) conditions,
20262 external variables, or outputs of other patterns as
20263 their initial conditions (left-hand sides). The PS
20264 activates all rules whose left-hand sides are true,
20265 selects the one with the highest affect, and performs
20266 the action specified by the right-hand side.\par
20267
20268 (2) A model of affects (emotions) as an anticipation
20269 mechanism based on a small number of basic
20270 pain-pleasure factors. Primary activation (raising an
20271 affects strength) occurs when the particular condition
20272 for the affect is anticipated (e.g., anticipation of
20273 pain for the fear affect). Secondary activation occurs
20274 when an internal construct (AP, IP, belief) is used and
20275 its associated affect is processed.\par
20276
20277 (3) A formalism for intensional behavior (directed by
20278 internal models) requiring a dual representation of
20279 symbol and concept. An intensional object (belief) can
20280 be accessed either by sensing it in the environment
20281 (concept) or by its name (token). Similarly, an
20282 intensional action (intention) can be specified either
20283 by its conditions in the immediate environment
20284 (concept) or by its name (token).",
20285 acknowledgement = ack-nhfb,
20286 pdfpages = "107",
20287 remark = "This is the author's thesis.",
20288 }
20289
20290 @TechReport{Hoffmann:1977:NPGb,
20291 author = "Walter Hoffmann and Beresford N. Parlett",
20292 title = "A new proof of global convergence for the tridiagonal
20293 {$ Q L $} algorithm",
20294 type = "Technical Report",
20295 number = "STAN-CS-77-634",
20296 institution = inst-STAN-CS,
20297 address = inst-STAN-CS:adr,
20298 pages = "18",
20299 month = oct,
20300 year = "1977",
20301 bibdate = "Fri Nov 7 07:00:05 MST 2025",
20302 bibsource = "https://www.math.utah.edu/pub/bibnet/authors/p/parlett-beresford-n.bib;
20303 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
20304 URL = "http://i.stanford.edu/TR/CS-TR-77-634.html",
20305 abstract = "By exploiting the relation of the $ Q L $ algorithm to
20306 inverse iteration we obtain a proof of global
20307 convergence which is more conceptual and less
20308 computational than previous analyses. The proof uses a
20309 new, but simple, error estimate for the first step of
20310 inverse iteration.",
20311 acknowledgement = ack-nhfb,
20312 pdfpages = "20",
20313 xxnumber = "CS-TR-77-634",
20314 }
20315
20316 @TechReport{Golub:1977:BLMa,
20317 author = "Gene H. Golub and Franklin T. Luk and Michael L.
20318 Overton",
20319 title = "A block {Lanczos} method to compute the singular
20320 values and corresponding singular vectors of a matrix",
20321 type = "Technical Report",
20322 number = "STAN-CS-77-635",
20323 institution = inst-STAN-CS,
20324 address = inst-STAN-CS:adr,
20325 pages = "80",
20326 month = oct,
20327 year = "1977",
20328 bibdate = "Fri Nov 7 07:00:05 MST 2025",
20329 bibsource = "https://www.math.utah.edu/pub/bibnet/authors/g/golub-gene-h.bib;
20330 https://www.math.utah.edu/pub/bibnet/authors/l/lanczos-cornelius.bib;
20331 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
20332 URL = "http://i.stanford.edu/TR/CS-TR-77-635.html",
20333 abstract = "We present a block Lanczos method to compute the
20334 largest singular values and corresponding left and
20335 right singular vectors of a large sparse matrix. Our
20336 algorithm does not transform the matrix $A$ but
20337 accesses it only through a user-supplied routine which
20338 computes $ A X $ or $ A^t X $ for a given matrix $X$.
20339 This paper also includes a thorough discussion of the
20340 various ways to compute the singular value
20341 decomposition of a banded upper triangular matrix; this
20342 problem arises as a subproblem to be solved during the
20343 block Lanczos procedure.",
20344 acknowledgement = ack-nhfb,
20345 author-dates = "Gene Howard Golub (February 29, 1932--November 16,
20346 2007)",
20347 pdfpages = "86",
20348 subject-dates = "Cornelius Lanczos (2 February 1893--25 June 1974)",
20349 xxnumber = "CS-TR-77-635",
20350 }
20351
20352 @TechReport{Bube:1977:CTI,
20353 author = "Kenneth P. Bube",
20354 title = "{$ C^m $} convergence of trigonometric interpolants",
20355 type = "Technical Report",
20356 number = "STAN-CS-77-636 (AD-A048788)",
20357 institution = inst-STAN-CS,
20358 address = inst-STAN-CS:adr,
20359 pages = "25",
20360 month = oct,
20361 year = "1977",
20362 bibdate = "Fri Nov 7 07:00:05 MST 2025",
20363 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
20364 URL = "http://i.stanford.edu/TR/CS-TR-77-636.html",
20365 abstract = "For $ m \geq 0 $, we obtain sharp estimates of the
20366 uniform accuracy of the $m$-th derivative of the
20367 n-point trigonometric interpolant of a function for two
20368 classes of periodic functions on $R$. As a corollary,
20369 the $n$-point interpolant of a function in $ C^k $
20370 uniformly approximates the function to order $ o(n^{1 /
20371 2 - k})$, improving the recent estimate of $ O(n^{1 -
20372 k})$. These results remain valid if we replace the
20373 trigonometric interpolant by its $K$-th partial sum,
20374 replacing $n$ by $K$ in the estimates.",
20375 acknowledgement = ack-nhfb,
20376 pdfpages = "28",
20377 xxnumber = "CS-TR-77-636",
20378 }
20379
20380 @TechReport{Ramshaw:1977:GSS,
20381 author = "Lyle H. Ramshaw",
20382 title = "On the gap structure of sequences of points on a
20383 circle",
20384 type = "Technical Report",
20385 number = "STAN-CS-77-637",
20386 institution = inst-STAN-CS,
20387 address = inst-STAN-CS:adr,
20388 pages = "26",
20389 month = nov,
20390 year = "1977",
20391 bibdate = "Fri Nov 7 07:00:05 MST 2025",
20392 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
20393 URL = "http://i.stanford.edu/TR/CS-TR-77-637.html",
20394 abstract = "Considerable mathematical effort has gone into
20395 studying sequences of points in the interval (0,1)
20396 which are evenly distributed, in the sense that certain
20397 intervals contain roughly the correct percentages of
20398 the first n points. This paper explores the related
20399 notion in which a sequence is evenly distributed if its
20400 first n points split a given circle into intervals
20401 which are roughly equal in length, regardless of their
20402 relative positions. The sequence $ x_k $ = ($ \log_2 $
20403 (2k-1) mod 1) was introduced in this context by
20404 DeBruijn and Erd{\H{o}}s. We will see that the gap
20405 structure of this sequence is uniquely optimal in a
20406 certain sense, and optimal under a wide class of
20407 measures.",
20408 acknowledgement = ack-nhfb,
20409 pdfpages = "28",
20410 xxnumber = "CS-TR-77-637",
20411 }
20412
20413 @TechReport{OLeary:1977:GCG,
20414 author = "Dianne Prost O'Leary",
20415 title = "A generalized conjugate gradient algorithm for solving
20416 a class of quadratic programming problems",
20417 type = "Technical Report",
20418 number = "STAN-CS-77-638 (SU326 P30-57)",
20419 institution = inst-STAN-CS,
20420 address = inst-STAN-CS:adr,
20421 pages = "49",
20422 month = dec,
20423 year = "1977",
20424 bibdate = "Fri Nov 7 07:00:05 MST 2025",
20425 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
20426 URL = "http://i.stanford.edu/TR/CS-TR-77-638.html",
20427 abstract = "In this paper we apply matrix splitting techniques and
20428 a conjugate gradient algorithm to the problem of
20429 minimizing a convex quadratic form subject to upper and
20430 lower bounds on the variables. This method exploits
20431 sparsity structure in the matrix of the quadratic form.
20432 Choices of the splitting operator are discussed and
20433 convergence results are established. We present the
20434 results of numerical experiments showing the
20435 effectiveness of the algorithm on free boundary
20436 problems for elliptic partial differential equations,
20437 and we give comparisons with other algorithms.",
20438 acknowledgement = ack-nhfb,
20439 pdfpages = "54",
20440 xxnumber = "CS-TR-77-638",
20441 }
20442
20443 @TechReport{Green:1977:PSK,
20444 author = "Cordell C. Green and David R. Barstow",
20445 title = "On program synthesis knowledge",
20446 type = "Technical Report",
20447 number = "STAN-CS-77-639 (AIM-306, AD-A053175)",
20448 institution = inst-STAN-CS,
20449 address = inst-STAN-CS:adr,
20450 pages = "63",
20451 month = nov,
20452 year = "1977",
20453 bibdate = "Fri Nov 7 07:00:05 MST 2025",
20454 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
20455 URL = "http://i.stanford.edu/TR/CS-TR-77-639.html",
20456 abstract = "This paper presents a body of program synthesis
20457 knowledge dealing with array operations, space
20458 reutilization, the divide and conquer paradigm,
20459 conversion from recursive paradigms to iterative
20460 paradigms, and ordered set enumerations. Such knowledge
20461 can be used for the synthesis of efficient and in-place
20462 sorts including quicksort, mergesort, sinking sort, and
20463 bubble sort, as well as other ordered set operations
20464 such as set union, element removal, and element
20465 addition. The knowledge is explicated to a level of
20466 detail such that it is possible to codify this
20467 knowledge as a set of program synthesis rules for use
20468 by a computer-based synthesis system. The use and
20469 content of this set of programming rules is illustrated
20470 herein by the methodical synthesis of bubble sort,
20471 sinking sort, quicksort, and mergesort.",
20472 acknowledgement = ack-nhfb,
20473 pdfpages = "68",
20474 xxnumber = "CS-TR-77-639",
20475 }
20476
20477 @TechReport{Barstow:1977:ACA,
20478 author = "David Barstow",
20479 title = "Automatic Construction of Algorithms",
20480 type = "Technical Report",
20481 number = "STAN-CS-77-641 (AIM-308, AD-A053184)",
20482 institution = inst-STAN-CS,
20483 address = inst-STAN-CS:adr,
20484 pages = "220",
20485 month = dec,
20486 year = "1977",
20487 bibdate = "Fri Nov 21 14:21:14 2025",
20488 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
20489 URL = "",
20490 acknowledgement = ack-nhfb,
20491 remark = "This is the author's thesis.",
20492 }
20493
20494 @TechReport{Yao:1977:CMS,
20495 author = "Andrew Chi-Chih Yao",
20496 title = "On constructing minimum spanning trees in
20497 $k$-dimensional spaces and related problems",
20498 type = "Technical Report",
20499 number = "STAN-CS-77-642",
20500 institution = inst-STAN-CS,
20501 address = inst-STAN-CS:adr,
20502 pages = "??",
20503 month = dec,
20504 year = "1977",
20505 bibdate = "Fri Nov 7 07:00:05 MST 2025",
20506 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
20507 URL = "http://i.stanford.edu/TR/CS-TR-77-642.html",
20508 abstract = "The problem of finding a minimum spanning tree
20509 connecting n points in a $k$-dimensional space is
20510 discussed under three common distance metrics ---
20511 Euclidean, rectilinear, and $ L_\infty $. By employing
20512 a subroutine that solves the post office problem, we
20513 show that, for fixed $ k \geq 3 $, such a minimum
20514 spanning tree can be found in time $ O(n^{2 - a(k)}
20515 {(log n)}^{1 - a(k)})$, where $ a(k) = 2^{-(k + 1)}$.
20516 The bound can be improved to $ O((n \log n)^{1.8}) $
20517 for points in the 3-dimensional Euclidean space. We
20518 also obtain $ o(n^2) $ algorithms for finding a
20519 farthest pair in a set of $n$ points and for other
20520 related problems.",
20521 acknowledgement = ack-nhfb,
20522 pdfpages = "40",
20523 xxnumber = "CS-TR-77-642",
20524 }
20525
20526 @TechReport{Tanabe:1977:GMN,
20527 author = "Kunio Tanabe",
20528 title = "A Geometric Method in Nonlinear Programming",
20529 type = "Technical Report",
20530 number = "STAN-CS-77-643",
20531 institution = inst-STAN-CS,
20532 address = inst-STAN-CS:adr,
20533 pages = "53",
20534 month = dec,
20535 year = "1977",
20536 bibdate = "Fri Nov 21 14:21:14 2025",
20537 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
20538 URL = "",
20539 acknowledgement = ack-nhfb,
20540 }
20541
20542 @TechReport{Mont-Reynaud:1977:HPF,
20543 author = "Bernard Mont-Reynaud",
20544 title = "Hierarchical Properties of Flows and the Determination
20545 of Inner Loops",
20546 type = "Technical Report",
20547 number = "STAN-CS-77-644",
20548 institution = inst-STAN-CS,
20549 address = inst-STAN-CS:adr,
20550 pages = "164",
20551 month = dec,
20552 year = "1977",
20553 bibdate = "Fri Nov 21 14:21:14 2025",
20554 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
20555 URL = "",
20556 acknowledgement = ack-nhfb,
20557 remark = "This is the author's thesis.",
20558 }
20559
20560 @TechReport{Lipton:1977:GND,
20561 author = "Richard J. Lipton and Donald J. Rose and Robert Endre
20562 Tarjan",
20563 title = "Generalized nested dissection",
20564 type = "Technical Report",
20565 number = "STAN-CS-77-645",
20566 institution = inst-STAN-CS,
20567 address = inst-STAN-CS:adr,
20568 pages = "32",
20569 month = dec,
20570 year = "1977",
20571 bibdate = "Fri Nov 7 07:00:05 MST 2025",
20572 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
20573 URL = "http://i.stanford.edu/TR/CS-TR-77-645.html",
20574 abstract = "J. A. George has discovered a method, called nested
20575 dissection, for solving a system of linear equations
20576 defined on an $ n = k \times k $ square grid in $ O(n
20577 \log n) $ space and $ O(n^{3 / 2}) $ time. We
20578 generalize this method without degrading the time and
20579 space bounds so that it applies to any system of
20580 equations defined on a planar or almost-planar graph.
20581 Such systems arise in the solution of two-dimensional
20582 finite element problems. Our method uses the fact that
20583 planar graphs have good separators. More generally, we
20584 show that sparse Gaussian elimination is efficient for
20585 any class of graphs which have good separators, and
20586 conversely that graphs without good separators
20587 (including almost all sparse graphs) are not amenable
20588 to sparse Gaussian elimination.",
20589 acknowledgement = ack-nhfb,
20590 pdfpages = "34",
20591 xxnumber = "CS-TR-77-645",
20592 }
20593
20594 @TechReport{Yao:1977:LBP,
20595 author = "Andrew Chi-Chih Yao",
20596 title = "A lower bound to palindrome recognition by
20597 probabilistic {Turing} machines",
20598 type = "Technical Report",
20599 number = "STAN-CS-77-647",
20600 institution = inst-STAN-CS,
20601 address = inst-STAN-CS:adr,
20602 pages = "??",
20603 month = dec,
20604 year = "1977",
20605 bibdate = "Fri Nov 7 07:00:05 MST 2025",
20606 bibsource = "https://www.math.utah.edu/pub/bibnet/authors/t/turing-alan-mathison.bib;
20607 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
20608 URL = "http://i.stanford.edu/TR/CS-TR-77-647.html",
20609 abstract = "We call attention to the problem of proving lower
20610 bounds on probabilistic Turing machine computations. It
20611 is shown that any probabilistic Turing machine
20612 recognizing the language $ L = \{ w \phi w | w \epsilon
20613 \{ 0, 1 \}^* \} $ with error $ \lambda < 1 / 2 $ must
20614 take $ \Omega (n \log n) $ time.",
20615 acknowledgement = ack-nhfb,
20616 pdfpages = "22",
20617 xxnumber = "CS-TR-77-647",
20618 }
20619
20620 @TechReport{Manna:1978:SPR,
20621 author = "Zohar Manna and Richard J. Waldinger",
20622 title = "Structured programming with recursion",
20623 type = "Technical Report",
20624 number = "STAN-CS-77-640 (AIM-307, AD-A053176)",
20625 institution = inst-STAN-CS,
20626 address = inst-STAN-CS:adr,
20627 pages = "ii + 5",
20628 month = jan,
20629 year = "1978",
20630 bibdate = "Fri Nov 7 07:00:05 MST 2025",
20631 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
20632 URL = "http://i.stanford.edu/TR/CS-TR-77-640.html",
20633 acknowledgement = ack-nhfb,
20634 pdfpages = "7",
20635 remark = "No abstract is available.",
20636 xxnumber = "CS-TR-77-640",
20637 }
20638
20639 @TechReport{Nelson:1978:FDA,
20640 author = "Charles Gregory Nelson and Derek C. Oppen",
20641 title = "Fast decision algorithms based on congruence closure",
20642 type = "Technical Report",
20643 number = "STAN-CS-77-646 (AIM-309 MU-309)",
20644 institution = inst-STAN-CS,
20645 address = inst-STAN-CS:adr,
20646 pages = "i + 13",
20647 month = feb,
20648 year = "1978",
20649 bibdate = "Fri Nov 7 07:00:05 MST 2025",
20650 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
20651 URL = "http://i.stanford.edu/TR/CS-TR-77-646.html",
20652 abstract = "We define the notion of the 'congruence closure' of a
20653 relation on a graph and give a simple algorithm for
20654 computing it. We then give decision procedures for the
20655 quantifier-free theory of equality and the
20656 quantifier-free theory of LISP list structure, both
20657 based on this algorithm. The procedures are fast enough
20658 to be practical in mechanical theorem proving: each
20659 procedure determines the satisfiability of a
20660 conjunction of length $n$ of literals in time $ O(n^2)
20661 $. We also show that if the axiomatization of the
20662 theory of list structure is changed slightly, the
20663 problem of determining the satisfiability of a
20664 conjunction of literals becomes NP-complete. We have
20665 implemented the decision procedures in our simplifier
20666 for the Stanford Pascal Verifier.",
20667 acknowledgement = ack-nhfb,
20668 pdfpages = "14",
20669 xxnumber = "CS-TR-77-646",
20670 }
20671
20672 @TechReport{Knuth:1978:MT,
20673 author = "Donald E. Knuth",
20674 title = "Mathematical Typography",
20675 type = "Technical Report",
20676 number = "STAN-CS-78-648 (AD-A054143)",
20677 institution = inst-STAN-CS,
20678 address = inst-STAN-CS:adr,
20679 pages = "v + 68",
20680 month = feb,
20681 year = "1978",
20682 bibdate = "Tue Nov 25 08:51:44 2025",
20683 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
20684 note = "Josiah Willard Gibb's Lecture, given under the
20685 auspices of the American Mathematical Society, January
20686 4, 1978.",
20687 URL = "https://apps.dtic.mil/sti/tr/pdf/ADA054143.pdf",
20688 abstract = "Mathematics books and journals do not look as
20689 beautiful at they used to. It is not that their
20690 mathematical content is unsatisfactory, rather that the
20691 old and well-developed traditions of typesetting have
20692 become too expensive. Fortunately, it now appear. that
20693 mathematics itself can be used to solve this
20694 problem.\par
20695
20696 A first step in the solution is to devise a method for
20697 unambiguously specifying mathematical manuscripts in
20698 such a way that they can easily be manipulated by
20699 machines. Such languages, when properly designed, can
20700 be learned quickly by authors and their typists, yet
20701 manuscripts in this f*a will lead directly to high
20702 quality plates for the printer with little or no human
20703 intervention.\par
20704
20705 A second step in the solution makes use of classical
20706 mathematics to design the shapes of the letters and
20707 symbols themselves. It is possible to give a rigorous
20708 definition of the exact shape of the letter ``a'', for
20709 example, in such a way that infinitely many styles
20710 (bold, extended, sans-serif, italic, etc.) are obtained
20711 from a single definition by changing only a few
20712 parameters. When the same is done for the other letters
20713 and symbols, we obtain a mathematical definition of
20714 type fonts, a definition that can be used on all
20715 machines both now and in the future. The main
20716 significance of this approach is that new symbols can
20717 readily be added in such a way that they are
20718 automatically consistent with the old ones.\par
20719
20720 Of course it is necessary that the
20721 mathematically-defined letters be beautiful according
20722 to traditional notions of aesthetics, Given a sequence
20723 of points in the plane, what is the most pleasing curve
20724 that connects them? This question leads to interesting
20725 mathematics, and one solution based on a novel family
20726 of spline curves has produced excellent fonts of type
20727 in the author's preliminary experiments. We may
20728 conclude that a mathematical approach to the design of
20729 alphabets does not eliminate the artists who have been
20730 doing the job for so many years; on the contrary, it
20731 gives them an exciting new medium to work with.",
20732 acknowledgement = ack-nhfb,
20733 pdfpages = "73",
20734 remark-1 = "Published in \booktitle{Bulletin of the American
20735 Mathematical Society (new series)}, {\bf 1}(2)
20736 337--372, March 1979.",
20737 remark-2 = "The PDF file is OCR'ed scans of microfiche page
20738 images.",
20739 }
20740
20741 @TechReport{Buchanan:1978:DMD,
20742 author = "Bruce G. Buchanan and Edward A. Feigenbaum",
20743 title = "{DENDRAL} and {Meta-DENDRAL}: their applications
20744 dimension",
20745 type = "Technical Report",
20746 number = "STAN-CS-78-649 (HPP-78-1)",
20747 institution = inst-STAN-CS,
20748 address = inst-STAN-CS:adr,
20749 pages = "??",
20750 month = feb,
20751 year = "1978",
20752 bibdate = "Fri Nov 7 07:00:05 MST 2025",
20753 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
20754 URL = "http://i.stanford.edu/TR/CS-TR-78-649.html",
20755 abstract = "The DENDRAL and Meta-DENDRAL programs assist chemists
20756 with data interpretation problems. The design of each
20757 program is described in the context of the chemical
20758 inference problems the program solves. Some chemical
20759 results produced by the programs are mentioned.",
20760 acknowledgement = ack-nhfb,
20761 pdfpages = "30",
20762 xxnumber = "CS-TR-78-649",
20763 }
20764
20765 @TechReport{Lengauer:1978:FAF,
20766 author = "Thomas Lengauer and Robert Endre Tarjan",
20767 title = "A Fast Algorithm for Finding Dominators in a Flow
20768 Graph",
20769 type = "Technical Report",
20770 number = "STAN-CS-78-650 (AD-A054144)",
20771 institution = inst-STAN-CS,
20772 address = inst-STAN-CS:adr,
20773 pages = "ii + 40",
20774 month = mar,
20775 year = "1978",
20776 bibdate = "Fri Nov 21 14:21:14 2025",
20777 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
20778 URL = "",
20779 abstract = "This paper presents a fast algorithm for finding
20780 dominators in a flow graph. The algorithm uses
20781 depth-first search and an efficient method of computing
20782 functions defined on paths in trees. A simple
20783 implementation of the algorithm runs in $ O(m \log n) $
20784 time, where $m$ is the number of edges and $n$ is the
20785 number of vertices in the problem graph. A
20786 sophisticated implementation runs in $ O(M \alpha (m,
20787 n))$ time, where $ \alpha (m, n)$ is a functional
20788 inverse of Ackermann's function.\par
20789
20790 Both versions of the algorithm were implemented in
20791 Algol W, a Stanford University version of Algol, and
20792 tested on an IBM 370/168. The programs were compared
20793 with an implementation by Purdom and Moore of a
20794 straightforward $ O(m n)$-time algorithm, and with a
20795 bit vector algorithm described by Aho and Ullman. The
20796 fast algorithm beat the straightforward algorithm and
20797 the bit vector algorithm on all but the smallest graphs
20798 tests.",
20799 acknowledgement = ack-nhfb,
20800 keywords = "depth-first search; global flow analysis; graph
20801 algorithms; path compression. denominators",
20802 pdfpages = "42",
20803 }
20804
20805 @TechReport{Dershowitz:1978:PTM,
20806 author = "Nachum Dershowitz and Zohar Manna",
20807 title = "Proving termination and multiset orderings",
20808 type = "Technical Report",
20809 number = "STAN-CS-78-651 (AIM-310, AD-A058601)",
20810 institution = inst-STAN-CS,
20811 address = inst-STAN-CS:adr,
20812 pages = "??",
20813 month = mar,
20814 year = "1978",
20815 bibdate = "Fri Nov 7 07:00:05 MST 2025",
20816 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
20817 URL = "http://i.stanford.edu/TR/CS-TR-78-651.html",
20818 abstract = "A common tool for proving the termination of programs
20819 is the well-founded set, a set ordered in such a way as
20820 to admit no infinite descending sequences. The basic
20821 approach is to find a termination function that maps
20822 the elements of the program into some well-founded set,
20823 such that the value of the termination function is
20824 continually reduced throughout the computation. All too
20825 often, the termination functions required are difficult
20826 to find and are of a complexity out of proportion to
20827 the program under consideration. However, by providing
20828 more sophisticated well-founded sets, the corresponding
20829 termination functions can be simplified. Given a
20830 well-founded set S, we consider multisets over S,
20831 `sets' that admit multiple occurrences of elements
20832 taken from S. We define an ordering on all finite
20833 multisets over S that is induced by the given ordering
20834 on S. This multiset ordering is shown to be
20835 well-founded. The value of the multiset ordering is
20836 that it permits the use of relatively simple and
20837 intuitive termination functions in otherwise difficult
20838 termination proofs. In particular, we apply the
20839 multiset ordering to provide simple proofs of the
20840 termination of production systems, programs defined in
20841 terms of sets of rewriting rules.",
20842 acknowledgement = ack-nhfb,
20843 pdfpages = "38",
20844 xxnumber = "CS-TR-78-651",
20845 }
20846
20847 @TechReport{Nelson:1978:SCD,
20848 author = "Charles Gregory Nelson and Derek C. Oppen",
20849 title = "Simplification by cooperating decision procedures",
20850 type = "Technical Report",
20851 number = "STAN-CS-78-652 (AIM-311)",
20852 institution = inst-STAN-CS,
20853 address = inst-STAN-CS:adr,
20854 pages = "??",
20855 month = apr,
20856 year = "1978",
20857 bibdate = "Fri Nov 7 07:00:05 MST 2025",
20858 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
20859 URL = "http://i.stanford.edu/TR/CS-TR-78-652.html",
20860 abstract = "We describe a simplifier for use in program
20861 manipulation and verification. The simplifier finds a
20862 normal form for any expression over the language
20863 consisting of individual variables, the usual boolean
20864 connectives, equality, the conditional function cond
20865 (denoting if-then-else), the numerals, the arithmetic
20866 functions and predicates +, - and $ \leq $, the LISP
20867 constants, functions and predicates nil, car, cdr, cons
20868 and atom, the functions store and select for storing
20869 into and selecting from arrays, and uninterpreted
20870 function symbols. Individual variables range over the
20871 union of the reals, the set of arrays, LISP list
20872 structure and the booleans true and false. The
20873 simplifier is complete; that is, it simplifies every
20874 valid formula to true. Thus it is also a decision
20875 procedure for the quantifier-free theory of reals,
20876 arrays and list structure under the above functions and
20877 predicates. The organization of the simplifier is based
20878 on a method for combining decision procedures for
20879 several theories into a single decision procedure for a
20880 theory combining the original theories. More precisely,
20881 given a set S of functions and predicates over a fixed
20882 domain, a satisfiability program for S is a program
20883 which determines the satisfiability of conjunctions of
20884 literals (signed atomic formulas) whose predicate and
20885 function symbols are in S. We give a general procedure
20886 for combining satisfiability programs for sets S and T
20887 into a single satisfiability program for S $ \cup $ T,
20888 given certain conditions on S and T. The simplifier
20889 described in this paper is currently used in the
20890 Stanford Pascal Verifier.",
20891 acknowledgement = ack-nhfb,
20892 pdfpages = "21",
20893 xxnumber = "CS-TR-78-652",
20894 }
20895
20896 @TechReport{Shiloach:1978:MTF,
20897 author = "Yossi Shiloach",
20898 title = "Multi-terminal $0$--$1$ flow",
20899 type = "Technical Report",
20900 number = "STAN-CS-78-653",
20901 institution = inst-STAN-CS,
20902 address = inst-STAN-CS:adr,
20903 pages = "??",
20904 month = apr,
20905 year = "1978",
20906 bibdate = "Fri Nov 7 07:00:05 MST 2025",
20907 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
20908 URL = "http://i.stanford.edu/TR/CS-TR-78-653.html",
20909 abstract = "Given an undirected $0$--$1$ flow network with n
20910 vertices and m edges, we present an $ O(n^2 (m + n))$
20911 algorithm which generates all $ (n \choose 2) $ maximal
20912 flows between all the pairs of vertices. Since $ O(n^2
20913 (m + n)) $ is also the size of the output, this
20914 algorithm is optimal up to a constant factor.",
20915 acknowledgement = ack-nhfb,
20916 pdfpages = "20",
20917 xxnumber = "CS-TR-78-653",
20918 }
20919
20920 @TechReport{Shiloach:1978:TPP,
20921 author = "Yossi Shiloach",
20922 title = "The two paths problem is polynomial",
20923 type = "Technical Report",
20924 number = "STAN-CS-78-654 (PB288520/AS)",
20925 institution = inst-STAN-CS,
20926 address = inst-STAN-CS:adr,
20927 pages = "??",
20928 month = apr,
20929 year = "1978",
20930 bibdate = "Fri Nov 7 07:00:05 MST 2025",
20931 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
20932 URL = "http://i.stanford.edu/TR/CS-TR-78-654.html",
20933 abstract = "Given an undirected graph G = (V,E) and vertices $ s_1
20934 $,$ t_1 $;$ s_2 $,$ t_2 $, the problem is to determine
20935 whether or not G admits two vertex disjoint paths $ P_1
20936 $ and $ P_2 $, connecting $ s_1 $ with $ t_1 $ and $
20937 s_2 $ with $ t_2 $ respectively. This problem is solved
20938 by an $ O(n \cdot m) $ algorithm $ (n = |V|, m = |E|)
20939 $. An important by-product of the paper is a theorem
20940 that states that if $G$ is 4-connected and non-planar,
20941 then such paths $ P_1 $ and $ P_2 $ exist for any
20942 choice of $ s_1 $, $ s_2 $, $ t_1 $, and $ t_2 $, (as
20943 was conjectured by Watkins [1968]).",
20944 acknowledgement = ack-nhfb,
20945 pdfpages = "26",
20946 xxnumber = "CS-TR-78-654",
20947 }
20948
20949 @TechReport{Dahlquist:1978:AUS,
20950 author = "Germund Dahlquist",
20951 title = "On accuracy and unconditional stability of linear
20952 multistep methods for second order differential
20953 equations",
20954 type = "Technical Report",
20955 number = "STAN-CS-78-655",
20956 institution = inst-STAN-CS,
20957 address = inst-STAN-CS:adr,
20958 pages = "??",
20959 month = apr,
20960 year = "1978",
20961 bibdate = "Fri Nov 7 07:00:05 MST 2025",
20962 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
20963 URL = "http://i.stanford.edu/TR/CS-TR-78-655.html",
20964 abstract = "Linear multistep methods for the solution of the
20965 equation y' = f(t,y) are studied by means of the test
20966 equation y' = -$ \omega^2 $ y, with $ \omega $ real. It
20967 is shown that the order of accuracy cannot exceed 2 for
20968 an unconditionally stable method.",
20969 acknowledgement = ack-nhfb,
20970 author-dates = "Germund Dahlquist (16 January 1925--8 February 2005)",
20971 pdfpages = "14",
20972 xxnumber = "CS-TR-78-655",
20973 }
20974
20975 @TechReport{Heath:1978:NAN,
20976 author = "Michael Thomas Heath",
20977 title = "Numerical Algorithms for Nonlinearly Constrained
20978 Optimization",
20979 type = "Technical Report",
20980 number = "STAN-CS-78-656",
20981 institution = inst-STAN-CS,
20982 address = inst-STAN-CS:adr,
20983 pages = "x + 142",
20984 month = apr,
20985 year = "1978",
20986 bibdate = "Fri Nov 21 14:21:14 2025",
20987 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
20988 URL = "https://apps.dtic.mil/sti/tr/pdf/ADA057962.pdf",
20989 abstract = "This dissertation is concerned with the development
20990 and numerical implementation of algorithms for solving
20991 finite dimensional optimization problems. Special
20992 emphasis is given to robustness, by which is meant the
20993 ability of an algorithm to cope with adverse
20994 circumstances, whether due to pathologies of a
20995 particular problem or to the short- comings of finite
20996 precision computer arithmetic. A uniform framework is
20997 developed in which a common set of techniques may be
20998 applied to all of the standard problems of
20999 optimization. The algorithms are based on Newton-like
21000 methods implemented in a robust manner by means of
21001 hybrid, curved line searches and stable linear algebra
21002 techniques. Developed first in the context of systems
21003 of nonlinear equations, non- linear least squares, and
21004 unconstrained minimization, the algorithms are combined
21005 and extended to include problems with equality or
21006 inequality constraints. Constrained problems are
21007 handled by means of separate line searches in the range
21008 and null spaces of the matrix of constraint normals.
21009 The classical Lagrangian is modified to allow the same
21010 Newton-like methods to be applied to inequality
21011 constraints. Test results are presented which show the
21012 validity and promise of the methods developed in this
21013 dissertation.",
21014 acknowledgement = ack-nhfb,
21015 advisor = "Gene H. Golub",
21016 pdfpages = "156",
21017 remark = "This is the author's thesis.",
21018 remark = "The PDF file is OCR'ed scans of microfiche page
21019 images.",
21020 }
21021
21022 @TechReport{McCarthy:1978:MTK,
21023 author = "John McCarthy and Masahiko Sato and Takeshi Hayashi
21024 and Shigeru Igarashi",
21025 title = "On the model theory of knowledge",
21026 type = "Technical Report",
21027 number = "STAN-CS-78-657 (AIM-312)",
21028 institution = inst-STAN-CS,
21029 address = inst-STAN-CS:adr,
21030 pages = "12",
21031 month = apr,
21032 year = "1978",
21033 bibdate = "Fri Nov 7 07:00:05 MST 2025",
21034 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
21035 URL = "http://i.stanford.edu/TR/CS-TR-78-657.html",
21036 abstract = "Another language for expressing `knowing that' is
21037 given together with axioms and rules of inference and a
21038 Kripke type semantics. The formalism is extended to
21039 time-dependent knowledge. Completeness and decidability
21040 theorems are given. The problem of the wise men with
21041 spots on their foreheads and the problem of the
21042 unfaithful wives are expressed in the formalism and
21043 solved.",
21044 acknowledgement = ack-nhfb,
21045 author-dates = "John McCarthy (4 September 1927--24 October 2011)",
21046 pdfpages = "12",
21047 xxnumber = "CS-TR-78-657",
21048 }
21049
21050 @TechReport{Shustek:1978:APC,
21051 author = "Leonard Jay Shustek",
21052 title = "Analysis and Performance of Computer Instruction
21053 Sets",
21054 type = "Technical Report",
21055 number = "STAN-CS-78-658 (SLAC-205)",
21056 institution = inst-STAN-CS,
21057 address = inst-STAN-CS:adr,
21058 pages = "x + 167",
21059 month = jan,
21060 year = "1978",
21061 bibdate = "Tue Nov 25 08:51:44 2025",
21062 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
21063 URL = "",
21064 abstract = "This study is concerned with measurements of the
21065 characteristics of current use of digital computer
21066 instruction sets, and an analysis of those measurements
21067 to produce conclusions useful for future design
21068 evaluation. The results include conclusions about
21069 computer architectures and their implementations, as
21070 well as techniques generally applicable to studies of
21071 this type.\par
21072
21073 In order to apportion the time spent by an executing
21074 program among the various system components, a model of
21075 high-performance computers is derived from instruction
21076 timing formulas, with compensation for pipeline and
21077 cache memory effects. The model is used to predict the
21078 performance of the IBM 370/168 and the Amdahl 470 V/6
21079 on specific programs, and the results are verified by
21080 comparison with actual performance. This technique is
21081 one which is not as difficult as full hardware
21082 simulation, yet yields information about specific
21083 implementations which can be used to detect bottlenecks
21084 in processor execution and to predict the effect of
21085 changes to the processor.\par
21086
21087 The data for the performance analysis is obtained by
21088 interpretively tracing a variety of benchmark programs
21089 for the 370 architecture. In addition to the data
21090 needed for the performance evaluation, these traces are
21091 analyzed to provide information about the
21092 characteristics and use of the instruction set itself.
21093 Some of the issues discussed are: opcode distributions,
21094 instruction length, branch analysis, branch and
21095 execution distance, opcode pair distributions,
21096 displacement values, address register utilization,
21097 operand lengths, cache memory effects, and pipeline
21098 breaks.\par
21099
21100 Some of the same measurements are made and discussed
21101 for other instruction set architectures, including a
21102 current microprocessor (the INTEL 8080), a popular
21103 minicomputer (the DEC PDP-11) and a pseudo-computer
21104 used as an intermediate step for PASCAL compilation or
21105 interpretation (PCODE).\par
21106
21107 Using the data and techniques developed, some
21108 predictive models are investigated. As an example of
21109 the effect of refinement of an implementation, an
21110 improved mechanism for conditional branch prediction is
21111 proposed and simulated. The performance of a radically
21112 different implementation of the 370 is examined and its
21113 performance is predicted. Finally, some of the data
21114 gathered is used as the basis for a model of the
21115 instruction fetch process; that model is solved
21116 analytically.\par
21117
21118 The last chapter summarizes the architectural
21119 conclusions and recommendations which result from this
21120 study. The emphasis is on design rules which should be
21121 followed to allow instruction sets to be implemented
21122 with high-performance processors.",
21123 acknowledgement = ack-nhfb,
21124 pdfpages = "102",
21125 remark = "This is the author's thesis. Most of the PDF pages are
21126 two physical pages rotated 90 degrees upward.",
21127 }
21128
21129 @TechReport{Zolnowsky:1978:TCG,
21130 author = "John E. Zolnowsky",
21131 title = "Topics in Computational Geometry",
21132 type = "Technical Report",
21133 number = "STAN-CS-78-659 (SLAC-206)",
21134 institution = inst-STAN-CS,
21135 address = inst-STAN-CS:adr,
21136 pages = "63",
21137 month = mar,
21138 year = "1978",
21139 bibdate = "Tue Nov 25 08:51:44 2025",
21140 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
21141 URL = "",
21142 acknowledgement = ack-nhfb,
21143 remark = "This is the author's thesis. No PDF in NTRL archive.",
21144 }
21145
21146 @TechReport{Shimano:1978:KDF,
21147 author = "Bruce E. Shimano",
21148 title = "The Kinematic Design and Force Control of Computer
21149 Controlled Manipulators",
21150 type = "Technical Report",
21151 number = "STAN-CS-78-660 (AIM-313)",
21152 institution = inst-STAN-CS,
21153 address = inst-STAN-CS:adr,
21154 pages = "135",
21155 month = mar,
21156 year = "1978",
21157 bibdate = "Tue Nov 25 08:51:44 2025",
21158 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
21159 URL = "",
21160 acknowledgement = ack-nhfb,
21161 remark = "This is the author's thesis.",
21162 }
21163
21164 @TechReport{Gilbert:1978:VPG,
21165 author = "John R. Gilbert and Robert Endre Tarjan",
21166 title = "Variations of a pebble game on graphs",
21167 type = "Technical Report",
21168 number = "STAN-CS-78-661 (AD-A060794)",
21169 institution = inst-STAN-CS,
21170 address = inst-STAN-CS:adr,
21171 pages = "??",
21172 month = sep,
21173 year = "1978",
21174 bibdate = "Fri Nov 7 07:00:05 MST 2025",
21175 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
21176 URL = "http://i.stanford.edu/TR/CS-TR-78-661.html",
21177 abstract = "We examine two variations of a one-person pebble game
21178 played on directed graphs, which has been studied as a
21179 model of register allocation. The black-white pebble
21180 game of Cook and Sethi is shown to require as many
21181 pebbles in the worst case as the normal pebble game, to
21182 within a constant factor. For another version of the
21183 pebble game, the problem of deciding whether a given
21184 number of pebbles is sufficient for a given graph is
21185 shown to be complete in polynomial space.",
21186 acknowledgement = ack-nhfb,
21187 pdfpages = "26",
21188 xxnumber = "CS-TR-78-661",
21189 }
21190
21191 @TechReport{Yao:1978:NAP,
21192 author = "Andrew Chi-Chih Yao",
21193 title = "New algorithms in bin packing",
21194 type = "Technical Report",
21195 number = "STAN-CS-78-662",
21196 institution = inst-STAN-CS,
21197 address = inst-STAN-CS:adr,
21198 pages = "ii + 50",
21199 month = sep,
21200 year = "1978",
21201 bibdate = "Fri Nov 7 07:00:05 MST 2025",
21202 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
21203 URL = "http://i.stanford.edu/TR/CS-TR-78-662.html",
21204 abstract = "In the bin-packing problem a list $L$ of $n$ numbers
21205 are to be packed into unit-capacity bins. For any
21206 algorithm $S$, let $ r(S)$ be the maximum ratio $ S(L)
21207 / L^* $ for large $ L^* $, where $ S(L)$ denotes the
21208 number of bins used by $S$ and $ L^* $ denotes the
21209 minimum number needed. In this paper we give an on-line
21210 $ O(n \log n)$-time algorithm RFF with $ r({\rm RFF}) =
21211 5 / 3$, and an off-line polynomial-time algorithm RFFD
21212 with $ r({\rm RFFD}) = (11 / 9) - \epsilon $ for some
21213 fixed $ \epsilon $ > 0. These are strictly better
21214 respectively than two prominent algorithms --- the
21215 First-Fit (FF) which is on-line with $ r({\rm FF}) = 17
21216 / 10$, and the First-Fit-Decreasing (FFD) with $ r({\rm
21217 FFD}) = 11 / 9$. Furthermore, it is shown that any
21218 on-line algorithm $S$ must have $ r(S) \geq 3 / 2$. We
21219 also discuss the question `how well can an $ O(n)$-time
21220 algorithm perform?', showing that, in the generalized
21221 $d$-dimensional bin-packing, any $ O(n)$-time algorithm
21222 $S$ must have $ r(S) \geq d$.",
21223 acknowledgement = ack-nhfb,
21224 pdfpages = "52",
21225 xxnumber = "CS-TR-78-662",
21226 }
21227
21228 @TechReport{Grosse:1978:SRG,
21229 author = "Eric H. Grosse",
21230 title = "Software restyling in graphics and programming
21231 languages",
21232 type = "Technical Report",
21233 number = "STAN-CS-78-663 (AD-A060793)",
21234 institution = inst-STAN-CS,
21235 address = inst-STAN-CS:adr,
21236 pages = "??",
21237 month = sep,
21238 year = "1978",
21239 bibdate = "Fri Nov 7 07:00:05 MST 2025",
21240 bibsource = "https://www.math.utah.edu/pub/bibnet/authors/g/grosse-eric.bib;
21241 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
21242 URL = "http://i.stanford.edu/TR/CS-TR-78-663.html",
21243 abstract = "The value of large software products can be cheaply
21244 increased by adding restyled interfaces that attract
21245 new users. As examples of this approach, a set of
21246 graphics primitives and a language precompiler for
21247 scientific computation are described. These two systems
21248 include a general user-defined coordinate system
21249 instead of numerous system settings, indention to
21250 specify block structure, a modified indexing convention
21251 for array parameters, a syntax for
21252 n-and-a-half-times-'round loops, and engineering format
21253 for real constants; most of all, they strive to be as
21254 small as possible.",
21255 acknowledgement = ack-nhfb,
21256 pdfpages = "19",
21257 xxnumber = "CS-TR-78-663",
21258 }
21259
21260 @TechReport{Bjorstad:1978:ANA,
21261 author = "Petter E. Bj{\o}rstad and Jorge Nocedal",
21262 title = "Analysis of a New Algorithm for One-Dimensional
21263 Minimization",
21264 type = "Technical Report",
21265 number = "STAN-CS-78-664",
21266 institution = inst-STAN-CS,
21267 address = inst-STAN-CS:adr,
21268 pages = "18",
21269 month = may,
21270 year = "1978",
21271 bibdate = "Tue Nov 25 08:51:44 2025",
21272 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
21273 URL = "",
21274 acknowledgement = ack-nhfb,
21275 }
21276
21277 @TechReport{McWilliams:1978:SSC,
21278 author = "Thomas M. McWilliams and Lawrence C. {Widdoes, Jr.}",
21279 title = "{SCALD}: {Structured Computer-Aided Logic Design}",
21280 type = "Technical Report",
21281 number = "STAN-CS-78-665 (CSL-TR-152)",
21282 institution = inst-STAN-CS,
21283 address = inst-STAN-CS:adr,
21284 pages = "??",
21285 month = mar,
21286 year = "1978",
21287 bibdate = "Fri Nov 7 07:00:05 MST 2025",
21288 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
21289 URL = "http://i.stanford.edu/TR/CS-TR-78-665.html",
21290 abstract = "SCALD, a graphics-based hierarchical digital logic
21291 design system, is described and an example of its use
21292 is given. SCALD provides a total computer-aided design
21293 environment which inputs a high-level description of a
21294 digital system, and produces output for computer-aided
21295 manufacture of the system. SCALD has been used in the
21296 design of an operational, 15-MIPS, 5500-chip ECL-10k
21297 processor.",
21298 acknowledgement = ack-nhfb,
21299 pdfpages = "42",
21300 xxnumber = "CS-TR-78-665",
21301 }
21302
21303 @TechReport{McWilliams:1978:SPD,
21304 author = "Thomas M. McWilliams and Lawrence C. {Widdoes, Jr.}",
21305 title = "The {SCALD} physical design subsystem",
21306 type = "Technical Report",
21307 number = "STAN-CS-78-666 (CSL-TR-153)",
21308 institution = inst-STAN-CS,
21309 address = inst-STAN-CS:adr,
21310 pages = "??",
21311 month = mar,
21312 year = "1978",
21313 bibdate = "Fri Nov 7 07:00:05 MST 2025",
21314 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
21315 URL = "http://i.stanford.edu/TR/CS-TR-78-666.html",
21316 abstract = "The SCALD physical design subsystem is described.
21317 SCALD supports the automatic construction of ECL-10k
21318 logic on wire wrap cards from the output of a
21319 hierarchical design system. Results of its use in the
21320 design of an operational 15-MIPS 5500-chip processor
21321 are presented and discussed.",
21322 acknowledgement = ack-nhfb,
21323 pdfpages = "31",
21324 xxnumber = "CS-TR-78-666",
21325 }
21326
21327 @TechReport{Smith:1978:DPS,
21328 author = "Reid G. Smith and Randall Davis",
21329 title = "Distributed Problem Solving: The Contract Net
21330 Approach",
21331 type = "Technical Report",
21332 number = "STAN-CS-78-667 (HPP-78-7, AD-A060795)",
21333 institution = inst-STAN-CS,
21334 address = inst-STAN-CS:adr,
21335 pages = "27",
21336 month = jun,
21337 year = "1978",
21338 bibdate = "Tue Nov 25 08:51:44 2025",
21339 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
21340 URL = "",
21341 acknowledgement = ack-nhfb,
21342 }
21343
21344 @TechReport{Bonnet:1978:BPR,
21345 author = "Alain Bonnet",
21346 title = "{BAOBAB}, a parser for a rule-based system using a
21347 semantic grammar",
21348 type = "Technical Report",
21349 number = "STAN-CS-78-668 (HPP-78-10)",
21350 institution = inst-STAN-CS,
21351 address = inst-STAN-CS:adr,
21352 pages = "??",
21353 month = sep,
21354 year = "1978",
21355 bibdate = "Fri Nov 7 07:00:05 MST 2025",
21356 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
21357 URL = "http://i.stanford.edu/TR/CS-TR-78-668.html",
21358 abstract = "Until a recent knowledge-based system is able to learn
21359 by itself, it must acquire new knowledge and new
21360 heuristics from human experts. This is traditionally
21361 done with the aid of a computer programmer acting as
21362 intermediary. The direct transfer of knowledge from an
21363 expert to the system requires a natural-language
21364 processor capable of handling a substantial subset of
21365 English. The development of such a natural-language
21366 processor is a long-term goal of automating knowledge
21367 acquisition; facilitating the interface between the
21368 expert and the system is a first step toward this goal.
21369 This paper describes BAOBAB, a program designed and
21370 implemented for MYCIN (Shortliffe 1974), a medical
21371 consultation system for infectious disease diagnosis
21372 and therapy selection. BAOBAB is concerned with the
21373 problem of parsing - recognizing natural language
21374 sentences and encoding them into MYClN's internal
21375 representation. For this purpose, it uses a semantic
21376 grammar in which the non-terminal symbols denote
21377 semantic categories (e.g., infections and symptoms), or
21378 conceptual categories which are common tools of
21379 knowledge representation in artificial intelligence
21380 (e.g., attributes, objects, values and predicate
21381 functions). This differs from a syntactic grammar in
21382 which non-terminal symbols are syntactic elements such
21383 as nouns or verbs.",
21384 acknowledgement = ack-nhfb,
21385 pdfpages = "48",
21386 xxnumber = "CS-TR-78-668",
21387 }
21388
21389 @TechReport{Stockmeyer:1978:OLM,
21390 author = "Paul K. Stockmeyer and F. Frances Yao",
21391 title = "On the Optimality of Linear Merge",
21392 type = "Technical Report",
21393 number = "STAN-CS-78-669",
21394 institution = inst-STAN-CS,
21395 address = inst-STAN-CS:adr,
21396 pages = "11",
21397 month = jun,
21398 year = "1978",
21399 bibdate = "Tue Nov 25 08:51:44 2025",
21400 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
21401 URL = "",
21402 acknowledgement = ack-nhfb,
21403 }
21404
21405 @TechReport{Graham:1978:IBW,
21406 author = "Ronald L. Graham and Andrew C. Yao and F. Frances
21407 Yao",
21408 title = "Information bounds are weak in the shortest distance
21409 problem",
21410 type = "Technical Report",
21411 number = "STAN-CS-78-670",
21412 institution = inst-STAN-CS,
21413 address = inst-STAN-CS:adr,
21414 pages = "??",
21415 month = sep,
21416 year = "1978",
21417 bibdate = "Fri Nov 7 07:00:05 MST 2025",
21418 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
21419 URL = "http://i.stanford.edu/TR/CS-TR-78-670.html",
21420 abstract = "In the all-pair shortest distance problem, one
21421 computes the matrix D = ($ d_{ij}$) where $ d_{ij}$ is
21422 the minimum weighted length of any path from vertex i
21423 to vertex j in a directed complete graph with a weight
21424 on each edge. In all the known algorithms, a shortest
21425 path $ p_{ij}$ achieving $ d_{ij}$ is also implicitly
21426 computed. In fact, $ \log_3$ f(n) is an
21427 information-theoretic lower bound where f(n) is the
21428 total number of distinct patterns ($ p_{ij}$) for
21429 n-vertex graphs. As f(n) potentially can be as large as
21430 $ 2^{n^3}$, it is hopeful that a non-trivial lower
21431 bound can be derived this way in the decision tree
21432 model. We study the characterization and enumeration of
21433 realizable patterns, and show that f(n) $ \leq
21434 C^{n^2}$. Thus no lower bound greater than C$ n^2$ can
21435 be derived from this approach. We prove as a corollary
21436 that the Triangular polyhedron $ T^{(n)}$, defined in $
21437 E^{(n \choose 2)}$ by $ d_{ij} \geq 0$ and the triangle
21438 inequalities $ d_{ij} + d_{jk} \geq d_{ik}$, has at
21439 most $ C^{n^2}$ faces of all dimensions, thus resolving
21440 an open question in a similar information bound
21441 approach to the shortest distance problem.",
21442 acknowledgement = ack-nhfb,
21443 author-dates = "Ronald Lewis Graham (31 October 1935--6 July 2020)",
21444 pdfpages = "42",
21445 xxnumber = "CS-TR-78-670",
21446 }
21447
21448 @TechReport{Ginsparg:1978:NLP,
21449 author = "Jerrold M. Ginsparg",
21450 title = "Natural Language Processing in an Automatic
21451 Programming Domain",
21452 type = "Technical Report",
21453 number = "STAN-CS-78-671 (AIM-316, AD-A058531)",
21454 institution = inst-STAN-CS,
21455 address = inst-STAN-CS:adr,
21456 pages = "vii + 166",
21457 month = jun,
21458 year = "1978",
21459 bibdate = "Tue Nov 25 08:51:44 2025",
21460 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
21461 URL = "",
21462 abstract = "This paper is about communicating with computers in
21463 English. In particular, It describes an interface
21464 system which allows a human user to communicate with an
21465 automatic programming system in an English
21466 dialogue.\par
21467
21468 The interface consists of two parts. The first is a
21469 parser called Reader. Reader was designed to facilitate
21470 writing English grammars which are nearly deterministic
21471 in that they consider a very small number of parse
21472 paths during the processing of a sentence. This
21473 efficiency is primarily derived from using a single
21474 parse structure to represent more than one syntactic
21475 interpretation of the input sentence.\par
21476
21477 The second part of the interface is an interpreter
21478 which represents Reader's output in a form that can be
21479 used by a computer program without linguist knowledge.
21480 The Interpreter is responsible for asking questions of
21481 the user, processing the user's replies building a
21482 representation of the program the user's replies
21483 describe, and supplying the parser with any of the
21484 contextual information of general knowledge it needs
21485 while parsing.",
21486 acknowledgement = ack-nhfb,
21487 advisor = "Terry Winograd",
21488 pdfpages = "173",
21489 remark = "This is the author's thesis.",
21490 }
21491
21492 @TechReport{Chan:1978:CNM,
21493 author = "Tony F. C. Chan",
21494 title = "Comparison of Numerical Methods for Initial Value
21495 Problems",
21496 type = "Technical Report",
21497 number = "STAN-CS-78-672",
21498 institution = inst-STAN-CS,
21499 address = inst-STAN-CS:adr,
21500 pages = "195",
21501 month = jun,
21502 year = "1978",
21503 bibdate = "Tue Nov 25 08:51:44 2025",
21504 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
21505 URL = "",
21506 acknowledgement = ack-nhfb,
21507 remark = "This is the author's thesis.",
21508 }
21509
21510 @TechReport{Chan:1978:NLS,
21511 author = "Tony F. Chan and William M. {Coughran, Jr.} and Eric
21512 H. Grosse and Michael T. Heath",
21513 title = "A numerical library and its support",
21514 type = "Technical Report",
21515 number = "STAN-CS-78-673 (SU326 P30-59)",
21516 institution = inst-STAN-CS,
21517 address = inst-STAN-CS:adr,
21518 pages = "iv + 20",
21519 month = nov,
21520 year = "1978",
21521 bibdate = "Fri Nov 7 07:00:05 MST 2025",
21522 bibsource = "https://www.math.utah.edu/pub/bibnet/authors/c/coughran-william-m.bib;
21523 https://www.math.utah.edu/pub/bibnet/authors/g/grosse-eric.bib;
21524 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
21525 URL = "http://i.stanford.edu/TR/CS-TR-78-673.html",
21526 abstract = "Reflecting on four years of numerical consulting at
21527 the Stanford Linear Accelerator Center, we point out
21528 solved and outstanding problems in selecting and
21529 installing mathematical software, helping users,
21530 maintaining the library and monitoring its use, and
21531 managing the consulting operation.",
21532 acknowledgement = ack-nhfb,
21533 pdfpages = "26",
21534 xxnumber = "CS-TR-78-673",
21535 }
21536
21537 @TechReport{Chan:1978:FEA,
21538 author = "Tony F. Chan and Roland Glowinski",
21539 title = "Finite element approximation and iterative solution of
21540 a class of mildly non-linear elliptic equations",
21541 type = "Technical Report",
21542 number = "STAN-CS-78-674 (SU326 P30-60)",
21543 institution = inst-STAN-CS,
21544 address = inst-STAN-CS:adr,
21545 pages = "??",
21546 month = nov,
21547 year = "1978",
21548 bibdate = "Fri Nov 7 07:00:05 MST 2025",
21549 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
21550 URL = "http://i.stanford.edu/TR/CS-TR-78-674.html",
21551 abstract = "We describe in this report the numerical analysis of a
21552 particular class of nonlinear Dirichlet problems. We
21553 consider an equivalent variational inequality
21554 formulation on which the problems of existence,
21555 uniqueness and approximation are easier to discuss. We
21556 prove in particular the convergence of an approximation
21557 by piecewise linear finite elements. Finally, we
21558 describe and compare several iterative methods for
21559 solving the approximate problems and particularly some
21560 new algorithms of augmented Lagrangian type, which
21561 contain as special case some well-known alternating
21562 direction methods. Numerical results are presented.",
21563 acknowledgement = ack-nhfb,
21564 pdfpages = "80",
21565 xxnumber = "CS-TR-78-674",
21566 }
21567
21568 @TechReport{Knuth:1978:TEC,
21569 author = "Donald E. Knuth",
21570 title = "{Tau Epsilon Chi}, a system for technical text",
21571 type = "Technical Report",
21572 number = "STAN-CS-78-675 (AIM-317)",
21573 institution = inst-STAN-CS,
21574 address = inst-STAN-CS:adr,
21575 pages = "200",
21576 month = nov,
21577 year = "1978",
21578 bibdate = "Tue Nov 25 08:51:44 2025",
21579 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
21580 URL = "",
21581 acknowledgement = ack-nhfb,
21582 remark = "Revised version published as book
21583 \cite{Knuth:1979:TMN}.",
21584 }
21585
21586 @TechReport{Banning:1978:MDS,
21587 author = "John Phineas Banning",
21588 title = "A Method for Determining the Side Effects of Procedure
21589 Calls",
21590 type = "Technical Report",
21591 number = "STAN-CS-78-676 (SLACR-213)",
21592 institution = inst-STAN-CS,
21593 address = inst-STAN-CS:adr,
21594 pages = "283",
21595 month = nov,
21596 year = "1978",
21597 bibdate = "Tue Nov 25 08:51:44 2025",
21598 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
21599 URL = "",
21600 acknowledgement = ack-nhfb,
21601 remark = "This is the author's thesis. No PDF in NTRL archive.",
21602 }
21603
21604 @TechReport{fsSUCSD:1978:CE,
21605 author = "{The faculty and students of the Stanford University
21606 Computer Science Department}",
21607 title = "Comprehensive Examinations 1972--1978",
21608 type = "Technical Report",
21609 number = "STAN-CS-78-677",
21610 institution = inst-STAN-CS,
21611 address = inst-STAN-CS:adr,
21612 pages = "??",
21613 month = nov,
21614 year = "1978",
21615 bibdate = "Fri Nov 7 07:00:05 MST 2025",
21616 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
21617 URL = "http://i.stanford.edu/pub/cstr/reports/cs/tr/78/677/CS-TR-78-677.pdf",
21618 abstract = "Since Spring 1972, the Stanford Computer Science
21619 Department has periodically given a `comprehensive
21620 examination' as one of the qualifying exams for
21621 graduate students. Such exams generally have consisted
21622 of a six-hour written test followed by a several-day
21623 programming problem. Their intent is to make it
21624 possible to assess whether a student is sufficiently
21625 prepared in all the important aspects of computer
21626 science. This report presents the examination questions
21627 from thirteen comprehensive examinations, along with
21628 their solutions.",
21629 acknowledgement = ack-nhfb,
21630 pdfpages = "250",
21631 xxnumber = "CS-TR-78-677",
21632 }
21633
21634 @TechReport{Oppen:1978:RAR,
21635 author = "Derek C. Oppen",
21636 title = "Reasoning about recursively defined data structures",
21637 type = "Technical Report",
21638 number = "STAN-CS-78-678 (AIM-314)",
21639 institution = inst-STAN-CS,
21640 address = inst-STAN-CS:adr,
21641 pages = "??",
21642 month = jul,
21643 year = "1978",
21644 bibdate = "Fri Nov 7 07:00:05 MST 2025",
21645 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
21646 URL = "http://i.stanford.edu/TR/CS-TR-78-678.html",
21647 abstract = "A decision algorithm is given for the quantifier-free
21648 theory of recursively defined data structures which,
21649 for a conjunction of length n, decides its
21650 satisfiability in time linear in n. The first-order
21651 theory of recursively defined data structures, in
21652 particular the first-order theory of LISP list
21653 structure (the theory of CONS, CAR and CDR), is shown
21654 to be decidable but not elementary recursive.",
21655 acknowledgement = ack-nhfb,
21656 pdfpages = "15",
21657 xxnumber = "CS-TR-78-678",
21658 }
21659
21660 @TechReport{Murray:1978:SAM,
21661 author = "Walter Murray and Michael L. Overton",
21662 title = "Steplength algorithms for minimizing a class of
21663 nondifferentiable functions",
21664 type = "Technical Report",
21665 number = "STAN-CS-78-679",
21666 institution = inst-STAN-CS,
21667 address = inst-STAN-CS:adr,
21668 pages = "??",
21669 month = nov,
21670 year = "1978",
21671 bibdate = "Fri Nov 7 07:00:05 MST 2025",
21672 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
21673 URL = "http://i.stanford.edu/TR/CS-TR-78-679.html",
21674 abstract = "Four steplength algorithms are presented for
21675 minimizing a class of nondifferentiable functions which
21676 includes functions arising from $ \ell_1 $ and $
21677 \ell_\infty $ approximation problems and penalty
21678 functions arising from constrained optimization
21679 problems. Two algorithms are given for the case when
21680 derivatives are available wherever they exist and two
21681 for the case when they are not available. We take the
21682 view that although a simple steplength algorithm may be
21683 all that is required to meet convergence criteria for
21684 the overall algorithm, from the point of view of
21685 efficiency it is important that the step achieve as
21686 large a reduction in the function value as possible,
21687 given a certain limit on the effort to be expended. The
21688 algorithms include the facility for varying this limit,
21689 producing anything from an algorithm requiring a single
21690 function evaluation to one doing an exact linear
21691 search. They are based on univariate minimization
21692 algorithms which we present first. These are normally
21693 at least quadratically convergent when derivatives are
21694 used and superlinearly convergent otherwise, regardless
21695 of whether or not the function is differentiable at the
21696 minimum.",
21697 acknowledgement = ack-nhfb,
21698 pdfpages = "68",
21699 xxnumber = "CS-TR-78-679",
21700 }
21701
21702 @TechReport{Stanley:1978:BSC,
21703 author = "Connie J. Stanley",
21704 title = "Bibliography of {Stanford Computer Science} reports,
21705 1963--1978",
21706 type = "Technical Report",
21707 number = "STAN-CS-78-680",
21708 institution = inst-STAN-CS,
21709 address = inst-STAN-CS:adr,
21710 pages = "??",
21711 month = nov,
21712 year = "1978",
21713 bibdate = "Fri Nov 7 07:00:05 MST 2025",
21714 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
21715 URL = "http://i.stanford.edu/TR/CS-TR-78-680.html",
21716 abstract = "This report lists, in chronological order, all reports
21717 published by the Stanford Computer Science Department
21718 since 1963. Each report is identified by Computer
21719 Science number, author's name, title, National
21720 Technical Information Service (NTIS) retrieval number,
21721 date, and number of pages. Complete listings of Theses,
21722 Artificial Intelligence Memos, and Heuristic
21723 Programming Reports are given in the Appendix. Also,
21724 for the first time, each report has been marked as to
21725 its availability for ordering and the cost if
21726 applicable.",
21727 acknowledgement = ack-nhfb,
21728 pdfpages = "110",
21729 xxnumber = "CS-TR-78-680",
21730 }
21731
21732 @TechReport{TrabbPardo:1978:SRS,
21733 author = "Luis {Trabb Pardo}",
21734 title = "Set Representation and Set Intersection",
21735 type = "Technical Report",
21736 number = "STAN-CS-78-681 (AD-A065283)",
21737 institution = inst-STAN-CS,
21738 address = inst-STAN-CS:adr,
21739 pages = "viii + 81",
21740 month = dec,
21741 year = "1978",
21742 DOI = "https://doi.org/10.1145/800133.804328",
21743 bibdate = "Tue Nov 25 08:51:44 2025",
21744 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
21745 URL = "https://apps.dtic.mil/sti/tr/pdf/ADA065283.pdf;
21746 https://dl.acm.org/doi/10.1145/800133.804328",
21747 abstract = "This work discusses the representation and
21748 manipulation of sets based on two different concepts:
21749 tries, and hashing functions.\par
21750
21751 The sets considered here are assumed to be static: once
21752 created, there will be no further insertions or
21753 deletions. For both trie- and hash-based strategies, a
21754 series of representations is introduced which together
21755 with the availability of preprocessing reduces the
21756 average sizes of the sets to nearly optimal values, yet
21757 retains the inherently good retrieval
21758 characteristics.\par
21759
21760 The intersection procedure for trie-based
21761 representations is based on the traversal in parallel
21762 of the tries representing the sets to be intersected,
21763 and it behaves like a series of binary searches when
21764 the sets to be intersected are of very different sizes.
21765 Hashed intersection runs very fast. The average time is
21766 proportional to the size of the smallest set to be
21767 intersected and is independent of the number of sets
21768 (except for the intersection set itself which has to be
21769 checked for every set)",
21770 acknowledgement = ack-nhfb,
21771 pdfpages = "89",
21772 remark = "This is the author's thesis. The PDF file is OCR'ed
21773 scans of microfiche page images.",
21774 }
21775
21776 @TechReport{Valdes:1978:PFS,
21777 author = "Jacobo Valdes",
21778 title = "Parsing Flowcharts and Series Parallel Graphs",
21779 type = "Technical Report",
21780 number = "STAN-CS-78-682 (AD-A065265)",
21781 institution = inst-STAN-CS,
21782 address = inst-STAN-CS:adr,
21783 pages = "iv + 228",
21784 month = dec,
21785 year = "1978",
21786 bibdate = "Tue Nov 25 08:51:44 2025",
21787 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
21788 URL = "https://apps.dtic.mil/sti/tr/pdf/ADA065265.pdf",
21789 abstract = "The main results presented in this work are an
21790 algorithm for the recognition of General Series
21791 Parallel (GSP) digraphs and an approach to the
21792 structural analysis of the control flow graphs of
21793 programs.\par
21794
21795 The GSP recognition algorithm determines in an acyclic
21796 digraph with $ O(n + m) $ steps whether an acyclic
21797 digraph with $n$ vertices and $m$ edges is GSP, and if
21798 it is, describes its structure in terms of two simple
21799 operations on digraphs. The algorithm is based on the
21800 relationship between GSP digraphs and the more standard
21801 class of TTSP multidigraphs.\par
21802
21803 Our approach to the analysis of flow graphs uses the
21804 triconnected components algorithm to find single-entry,
21805 single-exit regions. Under certain conditions --- that
21806 we identify --- this method will produce structural
21807 information suitable for the global flow analysis of
21808 control flow graphs in time proportional to the number
21809 of vertices and edges of the graph being analyzed.",
21810 acknowledgement = ack-nhfb,
21811 advisor = "Robert Endre Tarjan (??)",
21812 pdfpages = "235",
21813 remark = "This is the author's thesis. No PDF in NTRL archive,
21814 but found in DTIC archive.",
21815 }
21816
21817 @TechReport{Tarjan:1978:SST,
21818 author = "Robert Endre Tarjan",
21819 title = "Storing a sparse table",
21820 type = "Technical Report",
21821 number = "STAN-CS-78-683 (AD-A065284)",
21822 institution = inst-STAN-CS,
21823 address = inst-STAN-CS:adr,
21824 pages = "??",
21825 month = dec,
21826 year = "1978",
21827 bibdate = "Fri Nov 7 07:00:05 MST 2025",
21828 bibsource = "https://www.math.utah.edu/pub/tex/bib/hash.bib;
21829 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
21830 URL = "http://i.stanford.edu/TR/CS-TR-78-683.html",
21831 abstract = "The problem of storing and searching large sparse
21832 tables arises in compiling and in other areas of
21833 computer science. The standard technique for storing
21834 such tables is hashing, but hashing has poor worst-case
21835 performance. We consider good worst-case methods for
21836 storing a table of n entries, each an integer between 0
21837 and N-1. For dynamic tables, in which look-ups and
21838 table additions are intermixed, the use of a trie
21839 requires $ O(k n) $ storage and allows $ O(\log_k (N /
21840 n)) $ worst-case access time, where $k$ is an arbitrary
21841 parameter. For static tables, in which the entire table
21842 is constructed before any look-ups are made, we propose
21843 a method which requires $ O(n \log^{(\ell)} n)$ storage
21844 and allows $ O(\ell \log_n N)$ access time, where $
21845 \ell $ is an arbitrary parameter. Choosing $ \ell =
21846 \log^* n$ gives a method with $ O(n)$ storage and $
21847 O((\log^* n)(\log_n N)) $ access time.",
21848 acknowledgement = ack-nhfb,
21849 pdfpages = "26",
21850 xxnumber = "CS-TR-78-683",
21851 }
21852
21853 @TechReport{Boley:1978:MIE,
21854 author = "Daniel L. Boley and Gene H. Golub",
21855 title = "The Matrix Inverse Eigenvalue Problem for Periodic
21856 {Jacobi} Matrices",
21857 type = "Technical Report",
21858 number = "STAN-CS-78-684 (SU326 P30-63)",
21859 institution = inst-STAN-CS,
21860 address = inst-STAN-CS:adr,
21861 pages = "[5] + 14",
21862 month = dec,
21863 year = "1978",
21864 bibdate = "Fri Nov 7 07:00:05 MST 2025",
21865 bibsource = "https://www.math.utah.edu/pub/bibnet/authors/g/golub-gene-h.bib;
21866 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
21867 URL = "http://i.stanford.edu/TR/CS-TR-78-684.html",
21868 abstract = "A stable numerical algorithm is presented for
21869 generating a periodic Jacobi matrix from two sets of
21870 eigenvalues and the product of the off-diagonal
21871 elements of the matrix. The algorithm requires a simple
21872 generalization of the Lanczos algorithm. It is shown
21873 that the matrix is not unique, but the algorithm will
21874 generate all possible solutions.",
21875 acknowledgement = ack-nhfb,
21876 author-dates = "Gene Howard Golub (February 29, 1932--November 16,
21877 2007)",
21878 keywords = "eigenvalues; matrices",
21879 pdfpages = "22",
21880 xxnumber = "CS-TR-78-684",
21881 }
21882
21883 @TechReport{Luk:1978:SPM,
21884 author = "Franklin Tai-Cheung Luk",
21885 title = "Sparse and Parallel Matrix Computations",
21886 type = "Technical Report",
21887 number = "STAN-CS-78-685 (AD-A065285)",
21888 institution = inst-STAN-CS,
21889 address = inst-STAN-CS:adr,
21890 pages = "168",
21891 month = dec,
21892 year = "1978",
21893 bibdate = "Tue Nov 25 08:51:44 2025",
21894 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
21895 URL = "",
21896 acknowledgement = ack-nhfb,
21897 pdfpages = "168",
21898 remark = "This is the author's thesis. No PDF in DTIC or NTRL
21899 archives.",
21900 }
21901
21902 @TechReport{Lipton:1978:EHS,
21903 author = "Richard J. Lipton and Arnold L. Rosenberg and Andrew
21904 C. Yao",
21905 title = "External Hashing Schemes for Collections of Data
21906 Structures",
21907 type = "Technical Report",
21908 number = "STAN-CS-78-686",
21909 institution = inst-STAN-CS,
21910 address = inst-STAN-CS:adr,
21911 pages = "33",
21912 month = dec,
21913 year = "1978",
21914 bibdate = "Tue Nov 25 08:51:44 2025",
21915 bibsource = "https://www.math.utah.edu/pub/tex/bib/hash.bib;
21916 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
21917 URL = "",
21918 acknowledgement = ack-nhfb,
21919 remark = "Published in \booktitle{Journal of the ACM} {\bf
21920 27}(1) 81--95, January 1980.",
21921 }
21922
21923 @TechReport{Weyhrauch:1978:PTF,
21924 author = "Richard W. Weyhrauch",
21925 title = "Prolegomena to a theory of formal reasoning",
21926 type = "Technical Report",
21927 number = "STAN-CS-78-687 (AIM-315, AD-A065698)",
21928 institution = inst-STAN-CS,
21929 address = inst-STAN-CS:adr,
21930 pages = "??",
21931 month = dec,
21932 year = "1978",
21933 bibdate = "Fri Nov 7 07:00:05 MST 2025",
21934 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
21935 URL = "http://i.stanford.edu/TR/CS-TR-78-687.html",
21936 abstract = "This paper is an introduction to the mechanization of
21937 a theory of reasoning. Currently formal systems are out
21938 of favor with the AI community. The aim of this paper
21939 is to explain how formal systems can be used in AI by
21940 explaining how traditional ideas of logic can be
21941 mechanized in a practical way. The paper presents
21942 several new ideas. Each of these is illustrated by
21943 giving simple examples of how this idea is mechanized
21944 in the reasoning system FOL. That is, this is not just
21945 theory but there is an existing running implementation
21946 of these ideas. In this paper: (1) we show how to
21947 mechanize the notion of model using the idea of a
21948 simulation structure and explain why this is
21949 particularly important to AI, (2) we show how to
21950 mechanize the notion of satisfaction, (3) we present a
21951 very general evaluator for first order expressions,
21952 which subsumes PROLOG and we propose as a natural way
21953 of thinking about logic programming, (4) we show how to
21954 formalize metatheory, (5) we describe reflection
21955 principles, which connect theories to their
21956 metatheories in a way new to AI, (6) we show how these
21957 ideas can be used to dynamically extend the strength of
21958 FOL by `implementing' subsidiary deduction rules, and
21959 how this in turn can be extended to provide a method of
21960 describing and proving theorems about heuristics for
21961 using these rules, (7) we discuss one notion of what it
21962 could mean for a computer to learn and give an example,
21963 (8) we describe a new kind of formal system that has
21964 the property that it can reason about its own
21965 properties, (9) we give examples of all of the above.",
21966 acknowledgement = ack-nhfb,
21967 pdfpages = "46",
21968 xxnumber = "CS-TR-78-687",
21969 }
21970
21971 @TechReport{Manna:1978:SLL,
21972 author = "Zohar Manna",
21973 title = "Six Lectures on the Logic of Computer Programming",
21974 type = "Technical Report",
21975 number = "STAN-CS-78-688 (AIM-318)",
21976 institution = inst-STAN-CS,
21977 address = inst-STAN-CS:adr,
21978 pages = "54",
21979 month = dec,
21980 year = "1978",
21981 bibdate = "Tue Nov 25 08:51:44 2025",
21982 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
21983 URL = "",
21984 acknowledgement = ack-nhfb,
21985 }
21986
21987 @TechReport{Nelson:1978:ATV,
21988 author = "Charles Gregory Nelson",
21989 title = "An $ n^{\log n} $ algorithm for the
21990 two-variable-per-constraint linear programming
21991 satisfiability problem",
21992 type = "Technical Report",
21993 number = "STAN-CS-78-689 (AIM-319)",
21994 institution = inst-STAN-CS,
21995 address = inst-STAN-CS:adr,
21996 pages = "??",
21997 month = nov,
21998 year = "1978",
21999 bibdate = "Fri Nov 7 07:00:05 MST 2025",
22000 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
22001 URL = "http://i.stanford.edu/TR/CS-TR-78-689.html",
22002 abstract = "A simple algorithm is described which determines the
22003 satisfiability over the reals of a conjunction of
22004 linear inequalities, none of which contains more than
22005 two variables. In the worst case the algorithm requires
22006 time $ O({mn}^{\lceil \log^2 n \rceil + 3}) $, where
22007 $n$ is the number of variables and m the number of
22008 inequalities. Several considerations suggest that the
22009 algorithm may be useful in practice: it is simple to
22010 implement, it is fast for some important special cases,
22011 and if the inequalities are satisfiable it provides
22012 valuable information about their so1ution set. The
22013 algorithm is particularly suited to applications in
22014 mechanical program verification.",
22015 acknowledgement = ack-nhfb,
22016 pdfpages = "21",
22017 xxnumber = "CS-TR-78-689",
22018 }
22019
22020 @TechReport{Manna:1978:DAP,
22021 author = "Zohar Manna and Richard J. Waldinger",
22022 title = "A deductive approach to program synthesis",
22023 type = "Technical Report",
22024 number = "STAN-CS-78-690 (AIM-320, AD-A065558)",
22025 institution = inst-STAN-CS,
22026 address = inst-STAN-CS:adr,
22027 pages = "??",
22028 month = nov,
22029 year = "1978",
22030 bibdate = "Fri Nov 7 07:00:05 MST 2025",
22031 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
22032 URL = "http://i.stanford.edu/TR/CS-TR-78-690.html",
22033 abstract = "Program synthesis is the systematic derivation of a
22034 program from a given specification. A deductive
22035 approach to program synthesis is presented for the
22036 construction of recursive programs. This approach
22037 regards program synthesis as a theorem-proving task and
22038 relies on a theorem-proving method that combines the
22039 features of transformation rules, unification, and
22040 mathematical induction within a single framework.",
22041 acknowledgement = ack-nhfb,
22042 pdfpages = "48",
22043 xxnumber = "CS-TR-78-690",
22044 }
22045
22046 @TechReport{Bube:1978:CID,
22047 author = "Kenneth P. Bube",
22048 title = "The Construction of Initial Data for Hyperbolic
22049 Systems from Nonstandard Data",
22050 type = "Technical Report",
22051 number = "STAN-CS-78-691 (AD-A066058)",
22052 institution = inst-STAN-CS,
22053 address = inst-STAN-CS:adr,
22054 pages = "119",
22055 month = nov,
22056 year = "1978",
22057 bibdate = "Tue Nov 25 08:51:44 2025",
22058 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
22059 URL = "",
22060 acknowledgement = ack-nhfb,
22061 pdfpages = "691",
22062 remark = "This is the author's thesis. No PDF in DTIC or NTRL
22063 archives.",
22064 }
22065
22066 @TechReport{Buchanan:1979:MLS,
22067 author = "Bruce G. Buchanan and Tom M. Mitchell and Reid G.
22068 Smith and C. Richard {Johnson, Jr.}",
22069 title = "Models of Learning Systems",
22070 type = "Technical Report",
22071 number = "STAN-CS-79-692 (HPP-77-39, AD-A066147)",
22072 institution = inst-STAN-CS,
22073 address = inst-STAN-CS:adr,
22074 pages = "iii + 37",
22075 month = jan,
22076 year = "1979",
22077 bibdate = "Tue Nov 25 08:51:44 2025",
22078 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
22079 URL = "",
22080 abstract = "The terms adaptation, learning, concept-formation,
22081 induction, self-organization, and self-repair have all
22082 been used in the context of learning system (LS)
22083 research. in this article, three distinct approaches to
22084 machine learning and adaptation are considered: (i) the
22085 adaptive control approach, (ii) the pattern recognition
22086 approach, and (iii) the artificial intelligence
22087 approach.\par
22088
22089 Progress in each of these areas is summarized in the
22090 first part of the article. In the next part a general
22091 model for learning systems is presented that allows
22092 characterization and comparison of individual
22093 algorithms and programs in all of these areas. The
22094 model details the functional components felt to be
22095 essential for any learning system, independent of the
22096 techniques used for its construction, and the specific
22097 environment in which it operates. Specific examples of
22098 learning systems are described in terms of the model.",
22099 acknowledgement = ack-nhfb,
22100 pdfpages = "40",
22101 }
22102
22103 @TechReport{West:1978:CSG,
22104 author = "Douglas B. West",
22105 title = "A class of solutions to the gossip problem",
22106 type = "Technical Report",
22107 number = "STAN-CS-78-693 (AD-A066099)",
22108 institution = inst-STAN-CS,
22109 address = inst-STAN-CS:adr,
22110 pages = "??",
22111 month = nov,
22112 year = "1978",
22113 bibdate = "Fri Nov 7 07:00:05 MST 2025",
22114 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
22115 URL = "http://i.stanford.edu/TR/CS-TR-78-693.html",
22116 abstract = "We characterize and count optimal solutions to the
22117 gossip problem in which no one hears his own
22118 information. That is, we consider graphs with n
22119 vertices where the edges have a linear ordering such
22120 that an increasing path exists from each vertex to
22121 every other, but there is no increasing path from any
22122 vertex to itself. Such graphs exist only when n is
22123 even, in which case the fewest number of edges is 2n-4,
22124 as in the original gossip problem. We characterize
22125 optimal solutions of this sort (NOHO-graphs) using a
22126 correspondence with a set of permutations and binary
22127 sequences. This correspondence enables us to count
22128 these solutions and several subclasses of solutions.
22129 The numbers of solutions in each class are simple
22130 powers of 2 and 3, with exponents determined by n. We
22131 also show constructively that NOHO-graphs are planar
22132 and Hamiltonian, and we mention applications to related
22133 problems.",
22134 acknowledgement = ack-nhfb,
22135 pdfpages = "66",
22136 xxnumber = "CS-TR-78-693",
22137 }
22138
22139 @TechReport{King:1978:CSS,
22140 author = "Jonathan J. King",
22141 title = "Computer science at {Stanford}, 1977--1978",
22142 type = "Technical Report",
22143 number = "STAN-CS-78-694",
22144 institution = inst-STAN-CS,
22145 address = inst-STAN-CS:adr,
22146 pages = "??",
22147 month = nov,
22148 year = "1978",
22149 bibdate = "Fri Nov 7 07:00:05 MST 2025",
22150 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
22151 URL = "http://i.stanford.edu/TR/CS-TR-78-694.html",
22152 abstract = "This is a review of research and teaching in the
22153 Stanford Computer Science Department during the
22154 1977-1978 academic year.",
22155 acknowledgement = ack-nhfb,
22156 pdfpages = "30",
22157 xxnumber = "CS-TR-78-694",
22158 }
22159
22160 @TechReport{McCarthy:1978:RRA,
22161 author = "John McCarthy and Tom Binford and Cordell Green and
22162 David Luckham and Zohar Manna and Les Earnest",
22163 title = "Recent Research in Artificial Intelligence and
22164 Foundations of Programming",
22165 type = "Technical Report",
22166 number = "STAN-CS-78-695 (AIM-321, AD-A066562)",
22167 institution = inst-STAN-CS,
22168 address = inst-STAN-CS:adr,
22169 pages = "iv + 92",
22170 month = sep,
22171 year = "1978",
22172 bibdate = "Tue Nov 25 08:51:44 2025",
22173 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
22174 note = "Edited by Les Earnest.",
22175 URL = "",
22176 abstract = "Summarizes recent research in the following areas:
22177 artificial intelligence and formal reasoning;
22178 mathematical theory of computation and program
22179 synthesis; program verification; image understanding;
22180 knowledge based programming.",
22181 acknowledgement = ack-nhfb,
22182 author-dates = "John McCarthy (4 September 1927--24 October 2011)",
22183 pdfpages = "96",
22184 }
22185
22186 @TechReport{Smith:1978:CMB,
22187 author = "Reid G. Smith and Tom M. Mitchell",
22188 title = "Considerations for Microprocessor-Based Terminal
22189 Design",
22190 type = "Technical Report",
22191 number = "STAN-CS-78-696 (HPP-78-22, AD-A068538)",
22192 institution = inst-STAN-CS,
22193 address = inst-STAN-CS:adr,
22194 pages = "iv + 14",
22195 month = nov,
22196 year = "1978",
22197 bibdate = "Tue Nov 25 08:51:44 2025",
22198 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
22199 URL = "https://apps.dtic.mil/sti/tr/pdf/ADA068538.pdf",
22200 abstract = "We discuss the design of hardware and software for
22201 inexpensive microprocessor-based
22202 terminal/microcomputers. Such devices are fundamentally
22203 microcomputers that have been adapted, with specialized
22204 software, to operate as remote terminals for a host
22205 computer.\par
22206
22207 The discussion centers on a specific video terminal
22208 designed and constructed by the authors. This terminal
22209 is based on the Intel 8080 microprocessor and is
22210 equipped with software sufficient to emulate the
22211 characteristics of standard video terminals required by
22212 several available screen-oriented text editors in
22213 common use at sites throughout the ARPAnet.\par
22214
22215 We have found that the microprocessor adequately serves
22216 as the controller for such terminals, and that a
22217 software-based approach to the design of such terminals
22218 offers substantial advantages in capabilities,
22219 flexibility, and cost over the hardware-based approach.
22220 We suggest guidelines for future designs of
22221 microprocessor-based terminals on the basis of our
22222 experience designing and using the terminal described
22223 here.\par
22224
22225 In order to take full advantage of the flexibility
22226 afforded by microprocessor-based designs, we have
22227 Implemented the capability to download and execute 8080
22228 programs written and assembled on a host computer. This
22229 allows the user to customize and extend the features of
22230 his terminal. At the same time, it provides access to
22231 the 8080 as a microcomputer with the software
22232 development tools and mass storage provided by the host
22233 computer. The terminal is thus a complete, stand-alone
22234 microcomputer system specially configured for its role
22235 as a terminal.",
22236 acknowledgement = ack-nhfb,
22237 pdfpages = "18",
22238 remark = "No PDF in NTRL archive. Found in DTIC archive. The PDF
22239 file is OCR'ed scans of microfiche page images.",
22240 }
22241
22242 @TechReport{Gander:1978:LLS,
22243 author = "Walter Gander",
22244 title = "On the linear least squares problem with a quadratic
22245 constraint",
22246 type = "Technical Report",
22247 number = "STAN-CS-78-697",
22248 institution = inst-STAN-CS,
22249 address = inst-STAN-CS:adr,
22250 pages = "??",
22251 month = nov,
22252 year = "1978",
22253 bibdate = "Fri Nov 7 07:00:05 MST 2025",
22254 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
22255 URL = "http://i.stanford.edu/TR/CS-TR-78-697.html",
22256 abstract = "In this paper we present the theory and practical
22257 computational aspects of the linear least squares
22258 problem with a quadratic constraint. New theorems
22259 characterizing properties of the solutions are given
22260 and extended for the problem of minimizing a general
22261 quadratic function subject to a quadratic constraint.
22262 For two important regularization methods we formulate
22263 dual equations which proved to be very useful for the
22264 applications of smoothing of data. The resulting
22265 algorithm is a numerically stable version of an
22266 algorithm proposed by Rutishauser. We show also how to
22267 choose a third order iteration method to solve the
22268 secular equations. However we are still far away from a
22269 foolproof machine independent algorithm.",
22270 acknowledgement = ack-nhfb,
22271 pdfpages = "62",
22272 xxnumber = "CS-TR-78-697",
22273 }
22274
22275 @TechReport{Sweet:1978:EEP,
22276 author = "Richard E. Sweet",
22277 title = "Empirical Estimates of Program Entropy",
22278 type = "Technical Report",
22279 number = "STAN-CS-78-698",
22280 institution = inst-STAN-CS,
22281 address = inst-STAN-CS:adr,
22282 pages = "167",
22283 month = nov,
22284 year = "1978",
22285 bibdate = "Tue Nov 25 08:51:44 2025",
22286 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
22287 URL = "",
22288 acknowledgement = ack-nhfb,
22289 remark = "This is the author's thesis.",
22290 }
22291
22292 @TechReport{Bennett:1978:SKB,
22293 author = "James Bennett and Lewis Creary and Robert S. Engelmore
22294 and Robert Melosh",
22295 title = "{SACON}: a knowledge-based consultant for structural
22296 analysis",
22297 type = "Technical Report",
22298 number = "STAN-CS-78-699 (HPP-78-23, AD-A068539)",
22299 institution = inst-STAN-CS,
22300 address = inst-STAN-CS:adr,
22301 pages = "??",
22302 month = sep,
22303 year = "1978",
22304 bibdate = "Fri Nov 7 07:00:05 MST 2025",
22305 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
22306 URL = "http://i.stanford.edu/TR/CS-TR-78-699.html",
22307 abstract = "In this report we describe an application of
22308 artificial intelligence (AI) methods to structural
22309 analysis. We describe the development and (partial)
22310 implementation of an `automated consultant' to advise
22311 non-expert engineers in the use of a general-purpose
22312 structural analysis program. The analysis program
22313 numerically simulates the behavior of a physical
22314 structure subjected to various mechanical loading
22315 conditions. The automated consultant, called SACON
22316 (Structural Analysis CONsultant), is based on a version
22317 of the MYCIN program [Shortliffe, 1974], originally
22318 developed to advise physicians in the diagnosis and
22319 treatment of infectious diseases. The domain-specific
22320 knowledge in MYCIN is represented as situation-action
22321 rules, and is kept independent of the `inference
22322 engine' that uses the rules. By substituting structural
22323 engineering knowledge for the medical knowledge, the
22324 program was converted easily from the domain of
22325 infectious diseases to the domain of structural
22326 analysis.",
22327 acknowledgement = ack-nhfb,
22328 pdfpages = "70",
22329 xxnumber = "CS-TR-78-699",
22330 }
22331
22332 @TechReport{Smith:1978:FPS,
22333 author = "Reid Garfield Smith",
22334 title = "A Framework for Problem Solving in a Distributed
22335 Processing Environment",
22336 type = "Technical Report",
22337 number = "STAN-CS-78-700 (HPP-78-28, AD-A068230)",
22338 institution = inst-STAN-CS,
22339 address = inst-STAN-CS:adr,
22340 pages = "150",
22341 month = dec,
22342 year = "1978",
22343 bibdate = "Tue Nov 25 08:51:44 2025",
22344 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
22345 URL = "",
22346 acknowledgement = ack-nhfb,
22347 pdfpages = "160",
22348 remark = "This is the author's thesis. No PDF in NTRL archive.",
22349 }
22350
22351 @TechReport{Shiloach:1978:MFA,
22352 author = "Yossi Shiloach",
22353 title = "An {$ O(n \cdot I \log^2 I) $} maximum-flow
22354 algorithm",
22355 type = "Technical Report",
22356 number = "STAN-CS-78-702",
22357 institution = inst-STAN-CS,
22358 address = inst-STAN-CS:adr,
22359 pages = "33",
22360 month = dec,
22361 year = "1978",
22362 bibdate = "Fri Nov 7 07:00:05 MST 2025",
22363 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
22364 URL = "http://i.stanford.edu/TR/CS-TR-78-702.html",
22365 abstract = "We present in this paper a new algorithm to find a
22366 maximum flow in a flow-network which has n vertices and
22367 $m$ edges in time of $ O(n \cdot I \log^2 I) $, where $
22368 I = M + n $ is the input size (up to a constant
22369 factor). This result improves the previous upper bound
22370 of $Z$. Galil [1978] which was $ O(I^{7 / 3})$ in the
22371 worst case.",
22372 acknowledgement = ack-nhfb,
22373 pdfpages = "36",
22374 xxnumber = "CS-TR-78-702",
22375 }
22376
22377 @TechReport{Brown:1978:DAD,
22378 author = "Mark R. Brown and Robert E. Tarjan",
22379 title = "Design and Analysis of a Data Structure for
22380 Representing Sorted Lines",
22381 type = "Technical Report",
22382 number = "STAN-CS-78-709 (AD-A068231)",
22383 institution = inst-STAN-CS,
22384 address = inst-STAN-CS:adr,
22385 pages = "50",
22386 month = dec,
22387 year = "1978",
22388 bibdate = "Fri Nov 7 07:00:05 MST 2025",
22389 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
22390 URL = "http://i.stanford.edu/TR/CS-TR-78-709.html",
22391 abstract = "In this paper we explore the use of 2-3 trees to
22392 represent sorted lists. We analyze the worst-case cost
22393 of sequences of insertions and deletions in 2-3 trees
22394 under each of the following three assumptions: (i) only
22395 insertions are performed; (ii) only deletions are
22396 performed; (iii) deletions occur only at the small end
22397 of the list and insertions occur only away from the
22398 small end. Our analysis leads to a data structure for
22399 representing sorted lists when the access pattern
22400 exhibits a (perhaps time-varying) locality of
22401 reference. This structure has many of the properties of
22402 the representation proposed by Guibas, McCreight,
22403 Plass, and Roberts [1977], but it is substantially
22404 simpler and may be practical for lists of moderate
22405 size.",
22406 acknowledgement = ack-nhfb,
22407 pdfpages = "48",
22408 xxnumber = "CS-TR-78-709",
22409 }
22410
22411 @TechReport{Mitchell:1978:VSA,
22412 author = "Tom Michael Mitchell",
22413 title = "Version Spaces: an Approach to Concept Learning",
22414 type = "Technical Report",
22415 number = "STAN-CS-78-711",
22416 institution = inst-STAN-CS,
22417 address = inst-STAN-CS:adr,
22418 pages = "216",
22419 month = dec,
22420 year = "1978",
22421 bibdate = "Tue Nov 25 08:51:44 2025",
22422 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
22423 URL = "",
22424 acknowledgement = ack-nhfb,
22425 remark = "This is the author's thesis.",
22426 }
22427
22428 @TechReport{Model:1979:MSB,
22429 author = "Mitch L. Model",
22430 title = "Monitoring System Behavior in a Complex Computational
22431 Environment",
22432 type = "Technical Report",
22433 number = "STAN-CS-79-701",
22434 institution = inst-STAN-CS,
22435 address = inst-STAN-CS:adr,
22436 pages = "189",
22437 month = jan,
22438 year = "1979",
22439 bibdate = "Tue Nov 25 08:51:44 2025",
22440 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
22441 URL = "",
22442 acknowledgement = ack-nhfb,
22443 remark = "This is the author's thesis.",
22444 }
22445
22446 @TechReport{Aspvall:1979:PTA,
22447 author = "Bengt Aspvall and Yossi Shiloach",
22448 title = "A Polynomial Time Algorithm for Solving Systems of
22449 Linear Inequalities With Two Variables Per Inequality",
22450 type = "Technical Report",
22451 number = "STAN-CS-79-703 (AD-A068228)",
22452 institution = inst-STAN-CS,
22453 address = inst-STAN-CS:adr,
22454 pages = "25",
22455 month = jan,
22456 year = "1979",
22457 bibdate = "Fri Nov 7 07:00:05 MST 2025",
22458 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
22459 URL = "http://i.stanford.edu/TR/CS-TR-79-703.html",
22460 abstract = "We present a constructive algorithm for solving
22461 systems of linear inequalities (LI) with at most two
22462 variables per inequality. The algorithm is polynomial
22463 in the size of the input. The LI problem is of
22464 importance in complexity theory since it is polynomial
22465 time equivalent to linear programming. The subclass of
22466 LI treated in this paper is also of practical interest
22467 in mechanical verification systems, and we believe that
22468 the ideas presented can be extended to the general LI
22469 problem.",
22470 acknowledgement = ack-nhfb,
22471 pdfpages = "28",
22472 xxnumber = "CS-TR-79-703",
22473 }
22474
22475 @TechReport{Sweet:1979:SSS,
22476 author = "Roland A. Sweet",
22477 title = "A Survey of the State of Software for Partial
22478 Differential Equations",
22479 type = "Technical Report",
22480 number = "STAN-CS-79-704 (AD-A068232)",
22481 institution = inst-STAN-CS,
22482 address = inst-STAN-CS:adr,
22483 pages = "31",
22484 month = jan,
22485 year = "1979",
22486 bibdate = "Fri Nov 7 07:00:05 MST 2025",
22487 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
22488 URL = "http://i.stanford.edu/TR/CS-TR-79-704.html",
22489 abstract = "This paper surveys the state of general purpose
22490 software for the solution of partial differential
22491 equations. A discussion of the purported capabilities
22492 of twenty-one programs is presented. No testing of the
22493 routines was performed.",
22494 acknowledgement = ack-nhfb,
22495 pdfpages = "36",
22496 xxnumber = "CS-TR-79-704",
22497 }
22498
22499 @TechReport{Drysdale:1979:GVD,
22500 author = "Robert Lewis (Scot) {Drysdale, III}",
22501 title = "Generalized {Voronoi} Diagrams and Geometric
22502 Searching",
22503 type = "Technical Report",
22504 number = "STAN-CS-79-705",
22505 institution = inst-STAN-CS,
22506 address = inst-STAN-CS:adr,
22507 pages = "196",
22508 month = jan,
22509 year = "1979",
22510 bibdate = "Tue Nov 25 08:51:44 2025",
22511 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
22512 URL = "",
22513 acknowledgement = ack-nhfb,
22514 remark = "This is the author's thesis.",
22515 }
22516
22517 @TechReport{Yao:1979:GIN,
22518 author = "F. Francis Yao",
22519 title = "Graph 2-Isomorphism is {NP}-Complete",
22520 type = "Technical Report",
22521 number = "STAN-CS-79-706",
22522 institution = inst-STAN-CS,
22523 address = inst-STAN-CS:adr,
22524 pages = "12",
22525 month = jan,
22526 year = "1979",
22527 bibdate = "Fri Nov 7 07:00:05 MST 2025",
22528 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
22529 URL = "http://i.stanford.edu/TR/CS-TR-79-706.html",
22530 abstract = "Two graphs G and G' are said to be k-isomorphic if
22531 their edge sets can be partitioned into E(G) = $ E_1
22532 \cup E_2 \cup \ldots {} \cup E_k $ and E(G') = $ {E'}_1
22533 \cup {E'}_2 \cup \ldots {} \cup {E'}_k $ such that as
22534 graphs, $ E_i $ and $ {E'}_i $ are isomorphic for $ 1
22535 \leq i \leq k $. In this note we show that it is
22536 NP-complete to decide whether two graphs are
22537 2-isomorphic.",
22538 acknowledgement = ack-nhfb,
22539 pdfpages = "13",
22540 xxnumber = "CS-TR-79-706",
22541 }
22542
22543 @TechReport{VanWyk:1979:PPS,
22544 author = "Christopher J. {Van Wyk} and Donald E. Knuth",
22545 title = "A Programming and Problem Solving Seminar",
22546 type = "Technical Report",
22547 number = "STAN-CS-79-707",
22548 institution = inst-STAN-CS,
22549 address = inst-STAN-CS:adr,
22550 pages = "83",
22551 day = "1",
22552 month = jan,
22553 year = "1979",
22554 bibdate = "Fri Apr 18 05:25:51 2003",
22555 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
22556 URL = "http://i.stanford.edu/TR/CS-TR-79-707.html;
22557 http://www-db.stanford.edu/TR/CS-TR-79-707.html;
22558 http://www.ncstrl.org:8900/ncstrl/servlet/search?formname=detail&id=oai%3Ancstrlh%3Astan%3ASTAN%2F%2FCS-TR-79-707",
22559 abstract = "This report contains edited transcripts of the
22560 discussions held in Stanford's course CS 204, Problem
22561 Seminar, during autumn quarter 1978. Since the topics
22562 span a large range of ideas in computer science, and
22563 since most of the important research paradigms and
22564 programming paradigms came up during the discussions,
22565 these notes may be of interest to graduate students of
22566 computer science at other universities, as well as to
22567 their professors and to professional people in the
22568 `real world.'",
22569 acknowledgement = ack-nhfb,
22570 documentid = "oai:ncstrlh:stan:STAN//CS-TR-79-707",
22571 pdfpages = "86",
22572 xxnumber = "CS-TR-79-707",
22573 }
22574
22575 @TechReport{Yao:1979:AMA,
22576 author = "Andrew C. Yao",
22577 title = "An analysis of a memory allocation scheme for
22578 implementing stacks",
22579 type = "Technical Report",
22580 number = "STAN-CS-79-708",
22581 institution = inst-STAN-CS,
22582 address = inst-STAN-CS:adr,
22583 pages = "??",
22584 month = jan,
22585 year = "1979",
22586 bibdate = "Fri Nov 7 07:00:05 MST 2025",
22587 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
22588 URL = "http://i.stanford.edu/TR/CS-TR-79-708.html",
22589 abstract = "Consider the implementation of two stacks by letting
22590 them grow towards each other in a table of size $m$.
22591 Suppose a random sequence of insertions and deletions
22592 are executed, with each instruction having a fixed
22593 probability $p$ $ (0 < p < 1 / 2)$ to be a deletion.
22594 Let $ A_p (m)$ denote the expected value of $ \max \{
22595 x, y \} $, where $x$ and $y$ are the stack heights when
22596 the table first becomes full. We shall prove that, as $
22597 m \rightarrow \infty $, $ A_p (m) = \sqrt {m / (2 \pi
22598 (1 - 2 p))} + O((\log m) / \sqrt {m})$. This gives a
22599 solution to an open problem in Knuth ['The Art of
22600 Computer Programming, Vol. 1, Exercise 2.2.2-13].",
22601 acknowledgement = ack-nhfb,
22602 pdfpages = "20",
22603 xxnumber = "CS-TR-79-708",
22604 }
22605
22606 @TechReport{Trefethen:1979:NCS,
22607 author = "Lloyd N. Trefethen",
22608 title = "Numerical computation of the {Schwarz--Christoffel}
22609 transformation",
22610 type = "Technical Report",
22611 number = "STAN-CS-79-710 (AD-A068210)",
22612 institution = inst-STAN-CS,
22613 address = inst-STAN-CS:adr,
22614 pages = "??",
22615 month = mar,
22616 year = "1979",
22617 bibdate = "Fri Nov 7 07:00:05 MST 2025",
22618 bibsource = "https://www.math.utah.edu/pub/bibnet/authors/t/trefethen-lloyd-n.bib;
22619 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
22620 URL = "http://i.stanford.edu/TR/CS-TR-79-710.html",
22621 abstract = "A program is described which computes
22622 Schwarz--Christoffel transformations that map the unit
22623 disk conformally onto the interior of a bounded or
22624 unbounded polygon in the complex plane. The inverse map
22625 is also computed. The computational problem is
22626 approached by setting up a nonlinear system of
22627 equations whose unknowns are essentially the `accessory
22628 parameters' $ z_k $. This system is then solved with a
22629 packaged subroutine. New features of this work include
22630 the evaluation of integrals within the disk rather than
22631 along the boundary, making possible the treatment of
22632 unbounded polygons; the use of a compound form of
22633 Gauss-Jacobi quadrature to evaluate the
22634 Schwarz--Christoffel integral, making possible high
22635 accuracy at reasonable cost; and the elimination of
22636 constraints in the nonlinear system by a simple change
22637 of variables. Schwarz--Christoffel transformations may
22638 be applied to solve the Laplace and Poisson equations
22639 and related problems in two-dimensional domains with
22640 irregular or unbounded (but not curved or multiply
22641 connected) geometries. Computational examples are
22642 presented. The time required to solve the mapping
22643 problem is roughly proportional to $ N^3 $, where $N$
22644 is the number of vertices of the polygon. A typical set
22645 of computations to 8-place accuracy with $ N \leq 10 $
22646 takes 1 to 10 seconds on an IBM 370/168.",
22647 acknowledgement = ack-nhfb,
22648 pdfpages = "58",
22649 xxnumber = "CS-TR-79-710",
22650 }
22651
22652 @TechReport{Knuth:1979:ECP,
22653 author = "Donald E. Knuth",
22654 title = "The errata of computer programming",
22655 type = "Technical Report",
22656 number = "STAN-CS-79-712 (AD-A068393)",
22657 institution = inst-STAN-CS,
22658 address = inst-STAN-CS:adr,
22659 pages = "ii + 56",
22660 day = "1",
22661 month = jan,
22662 year = "1979",
22663 bibdate = "Fri Nov 7 07:00:05 MST 2025",
22664 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
22665 URL = "http://i.stanford.edu/TR/CS-TR-79-712.html;
22666 http://www-db.stanford.edu/TR/CS-TR-79-712.html;
22667 http://www.ncstrl.org:8900/ncstrl/servlet/search?formname=detail&id=oai%3Ancstrlh%3Astan%3ASTAN%2F%2FCS-TR-79-712;
22668 https://apps.dtic.mil/sti/pdfs/ADA068393.pdf",
22669 abstract = "This report lists all corrections and changes of
22670 Volumes 1 and 3 of ``The Art of Computer Programming,''
22671 as of January 5, 1979. This updates the previous list
22672 in report CS551, May 1976. The second edition of Volume
22673 2 has been delayed two years due to the fact that it
22674 was completely revised and put into the {\TeX}
22675 typesetting language; since publication of this new
22676 edition is not far off, no changes to Volume 2 are
22677 listed here.",
22678 acknowledgement = ack-nhfb,
22679 documentid = "oai:ncstrlh:stan:STAN//CS-TR-79-712",
22680 pdfpages = "58",
22681 remark = "The ADA068393 PDF file is OCR'ed scans of microfiche
22682 page images, but the Stanford version is clean.",
22683 xxnumber = "CS-TR-79-712",
22684 }
22685
22686 @TechReport{Golub:1979:HSMa,
22687 author = "Gene H. Golub and Stephen Nash and Charles F. {Van
22688 Loan}",
22689 title = "A {Hessenberg--Schur} method for the problem {$ {AX +
22690 XB = C} $}",
22691 type = "Technical Report",
22692 number = "STAN-CS-79-713",
22693 institution = inst-STAN-CS,
22694 address = inst-STAN-CS:adr,
22695 pages = "50",
22696 month = jan,
22697 year = "1979",
22698 DOI = "https://doi.org/10.1109/TAC.1979.1102170",
22699 bibdate = "Mon Oct 24 10:35:29 MDT 1994",
22700 bibsource = "https://www.math.utah.edu/pub/bibnet/authors/g/golub-gene-h.bib;
22701 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
22702 URL = "",
22703 acknowledgement = ack-nhfb,
22704 author-dates = "Gene Howard Golub (February 29, 1932--November 16,
22705 2007)",
22706 keywords = "matrix mechanics; numerical analysis",
22707 remark = "Published in \booktitle{IEEE Transactions on Automatic
22708 Control} {\bf 24}(6) 909--913, 1979,
22709 doi:10.1109/TAC.1979.1102170.",
22710 xxnumber = "CS-TR-79-713",
22711 }
22712
22713 @TechReport{Castaneda:1979:PFP,
22714 author = "Fernando Castaneda and Frederick C. Chow and Peter Nye
22715 and Daniel D. Sleator and Gio Wiederhold",
22716 title = "{PCFORT}: a {Fortran-to-Pcode} translator",
22717 type = "Technical Report",
22718 number = "STAN-CS-79-714 (CSL-TN-160)",
22719 institution = inst-STAN-CS,
22720 address = inst-STAN-CS:adr,
22721 pages = "vi + 85",
22722 month = jan,
22723 year = "1979",
22724 bibdate = "Sun Oct 12 09:17:11 1997",
22725 bibsource = "https://www.math.utah.edu/pub/bibnet/authors/w/wirth-niklaus.bib;
22726 https://www.math.utah.edu/pub/tex/bib/fortran1.bib;
22727 https://www.math.utah.edu/pub/tex/bib/master.bib;
22728 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
22729 URL = "http://i.stanford.edu/pub/cstr/reports/cs/tr/79/714/CS-TR-79-714.pdf;
22730 http://i.stanford.edu/TR/CS-TR-79-714.html;
22731 https://bitsavers.org/pdf/stanford/cs_techReports/STAN-CS-79-714_PCFORT_Jan79.pdf",
22732 abstract = "PCFORT is a compiler for the FORTRAN language designed
22733 to fit as a building block into a PASCAL oriented
22734 environment. It forms part of the programming systems
22735 being developed for the S-1 multiprocessor. It is
22736 written in PASCAL, and generates P-code, an
22737 intermediate language used by transportable PASCAL
22738 compilers to represent the program in a simple form.
22739 P-code is either compiled or interpreted depending upon
22740 the objectives of the programming system.\par
22741
22742 A PASCAL written FORTRAN compiler provides a bridge
22743 between the FORTRAN and PASCAL communities. The
22744 implementation allows PASCAL and FORTRAN generated code
22745 to be combined into one program. The FORTRAN language
22746 supported here is FORTRAN to the full 1966 standard,
22747 extended with those features commonly expected by
22748 available large scientific programs.",
22749 acknowledgement = ack-nhfb,
22750 keywords = "compiler; FORTRAN; P-code; PASCAL; S-1; translator",
22751 pdfpages = "96",
22752 xxnumber = "CS-TR-79-714",
22753 }
22754
22755 @TechReport{Hailpern:1979:AM,
22756 author = "Brent T. Hailpern and Bruce L. Hitson",
22757 title = "{S-1} architecture manual",
22758 type = "Technical Report",
22759 number = "STAN-CS-79-715 (CSL-TR-79-161)",
22760 institution = inst-STAN-CS,
22761 address = inst-STAN-CS:adr,
22762 pages = "iii + iv + 366",
22763 month = jan,
22764 year = "1979",
22765 bibdate = "Fri Nov 7 07:00:05 MST 2025",
22766 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
22767 URL = "http://i.stanford.edu/TR/CS-TR-79-715.html;
22768 https://bitsavers.org/pdf/stanford/cs_techReports/STAN-CS-79-715_S-1_Arch_Man.pdf",
22769 abstract = "This manual provides a complete description of the
22770 instruction-set architecture of the S-1 Uniprocessor
22771 (Mark IIA), exclusive of vector operations. It is
22772 assumed that the reader has a general knowledge of
22773 computer architecture. The manual was designed to be
22774 both a detailed introduction to the S-1 and an
22775 architecture reference manual. Also included are user
22776 manuals for the FASM Assembler and the S-1 Formal
22777 Description Syntax.",
22778 acknowledgement = ack-nhfb,
22779 pdfpages = "376 (CS-TR-79-715)",
22780 xxnumber = "CS-TR-79-715, CSL-TR-79-161",
22781 }
22782
22783 @TechReport{Georgeff:1979:FCP,
22784 author = "Michael P. Georgeff",
22785 title = "A framework for control in production systems",
22786 type = "Technical Report",
22787 number = "STAN-CS-79-716 (AIM-322)",
22788 institution = inst-STAN-CS,
22789 address = inst-STAN-CS:adr,
22790 pages = "??",
22791 month = jan,
22792 year = "1979",
22793 bibdate = "Fri Nov 7 07:00:05 MST 2025",
22794 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
22795 URL = "http://i.stanford.edu/TR/CS-TR-79-716.html",
22796 abstract = "A formal model for representing control in production
22797 systems is defined. The formalism allows control to be
22798 directly specified independently of the conflict
22799 resolution scheme, and thus allows the issues of
22800 control and nondeterminism to be treated separately.
22801 Unlike previous approaches, it allows control to be
22802 examined within a uniform and consistent framework. It
22803 is shown that the formalism provides a basis for
22804 implementing control constructs which, unlike existing
22805 schemes, retain all the properties desired of a
22806 knowledge based system --- modularity, flexibility,
22807 extensibility and explanatory capacity. Most
22808 importantly, it is shown that these properties are not
22809 a function of the lack of control constraints, but of
22810 the type of information allowed to establish these
22811 constraints. Within the formalism it is also possible
22812 to provide a meaningful notion of the power of control
22813 constructs. This enables the types of control required
22814 in production systems to be examined and the capacity
22815 of various schemes to meet these requirements to be
22816 determined. Schemes for improving system efficiency and
22817 resolving nondeterminism are examined, and devices for
22818 representing such meta-level knowledge are described.
22819 In particular, the objectification of control
22820 information is shown to provide a better paradigm for
22821 problem solving and for talking about problem solving.
22822 It is also shown that the notion of control provides a
22823 basis for a theory of transformation of production
22824 systems, and that this provides a uniform and
22825 consistent approach to problems involving subgoal
22826 protection.",
22827 acknowledgement = ack-nhfb,
22828 pdfpages = "38",
22829 xxnumber = "CS-TR-79-716",
22830 }
22831
22832 @TechReport{Cartwright:1979:RPF,
22833 author = "Robert Cartwright and John McCarthy",
22834 title = "Recursive Programs as Functions in a First Order
22835 Theory",
22836 type = "Technical Report",
22837 number = "STAN-CS-79-717 (AIM-324, AD-A071421)",
22838 institution = inst-STAN-CS,
22839 address = inst-STAN-CS:adr,
22840 pages = "32",
22841 month = mar,
22842 year = "1979",
22843 bibdate = "Tue Nov 25 08:51:44 2025",
22844 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
22845 URL = "",
22846 abstract = "Pure Lisp style recursive function programs are
22847 represented in a new way by sentences and schemata of
22848 first order logic. This permits easy and natural proofs
22849 of extensional properties of such programs by methods
22850 that generalize structural induction. It also
22851 systematizes known methods such as {\em recursion
22852 induction}, {\em subgoal induction}, {\em inductive
22853 assertions\/} by interpreting them as first order axiom
22854 schemata. We discuss the metatheorems justifying the
22855 representation and techniques for proving facts about
22856 specific programs. We also give a simpler version of
22857 the Goedel--Kleene way of representing computable
22858 functions by first order sentences. This paper is to be
22859 published in \booktitle{Proceedings of The
22860 International Conference on Mathematical Studies of
22861 Information Processing}, edited by S. Takasu and
22862 published by Springer-Verlag.",
22863 acknowledgement = ack-nhfb,
22864 author-dates = "John McCarthy (4 September 1927--24 October 2011)",
22865 pdfpages = "36",
22866 remark = "The PDF file is OCR'ed scans of microfiche page
22867 images.",
22868 }
22869
22870 @TechReport{Mujtaba:1979:AUM,
22871 author = "Mohamed Shahid Mujtaba and Ron Goldman",
22872 title = "{AL} Users' manual",
22873 type = "Technical Report",
22874 number = "STAN-CS-79-718 (AIM-323)",
22875 institution = inst-STAN-CS,
22876 address = inst-STAN-CS:adr,
22877 pages = "??",
22878 month = jan,
22879 year = "1979",
22880 bibdate = "Fri Nov 7 07:00:05 MST 2025",
22881 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
22882 URL = "http://i.stanford.edu/TR/CS-TR-79-718.html",
22883 abstract = "This document describes the current state of the AL
22884 system now in operation at the Stanford Artificial
22885 Intelligence Laboratory, and teaches the reader how to
22886 use it. The system consists of AL, a high-level
22887 programming language for manipulator control useful in
22888 industrial assembly research; POINTY, an interactive
22889 system for specifying representation of parts; and
22890 ALAID, an interactive debugger for AL.",
22891 acknowledgement = ack-nhfb,
22892 pdfpages = "140",
22893 xxnumber = "CS-TR-79-718",
22894 }
22895
22896 @TechReport{Bjorstad:1979:EAE,
22897 author = "Petter Bj{\o}rstad and Germund Dahlquist and Eric H.
22898 Grosse",
22899 title = "Extrapolation of asymptotic expansions by a modified
22900 {Aitken} $ \delta^2$-formula",
22901 type = "Technical Report",
22902 number = "STAN-CS-79-719 (SU326 P30-61)",
22903 institution = inst-STAN-CS,
22904 address = inst-STAN-CS:adr,
22905 pages = "iv + 45 + 7",
22906 month = mar,
22907 year = "1979",
22908 bibdate = "Fri Nov 7 07:00:05 MST 2025",
22909 bibsource = "https://www.math.utah.edu/pub/bibnet/authors/g/grosse-eric.bib;
22910 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
22911 URL = "http://i.stanford.edu/TR/CS-TR-79-719.html",
22912 abstract = "A modified Aitken formula permits iterated
22913 extrapolations to efficiently estimate $ s_\infty $
22914 from $ s_n $ when an asymptotic expansion $ s_n =
22915 s_\infty + n^{-k} (c_0 + c_1 n^{-1} + c_2 n^{-2} +
22916 \ldots {}) $ holds for some (unknown) coefficients $
22917 c_j $. We study the truncation and irregular error and
22918 compare the method with other forms of extrapolation.",
22919 acknowledgement = ack-nhfb,
22920 author-dates = "Germund Dahlquist (16 January 1925--8 February 2005)",
22921 pdfpages = "56",
22922 xxnumber = "CS-TR-79-719",
22923 }
22924
22925 @TechReport{Glowinski:1979:GOB,
22926 author = "Roland Glowinski",
22927 title = "On grid optimization for boundary value problems",
22928 type = "Technical Report",
22929 number = "STAN-CS-79-720",
22930 institution = inst-STAN-CS,
22931 address = inst-STAN-CS:adr,
22932 pages = "??",
22933 month = feb,
22934 year = "1979",
22935 bibdate = "Fri Nov 7 07:00:05 MST 2025",
22936 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
22937 URL = "http://i.stanford.edu/TR/CS-TR-79-720.html",
22938 abstract = "We discuss in this report the numerical procedures
22939 which can be used to obtain the optimal grid when
22940 solving by a finite element method a model boundary
22941 value problem of elliptic type modelling the potential
22942 flow of an incompressible inviscid fluid. Results of
22943 numerical experiments are presented.",
22944 acknowledgement = ack-nhfb,
22945 pdfpages = "24",
22946 xxnumber = "CS-TR-79-720",
22947 }
22948
22949 @TechReport{Yao:1979:FTN,
22950 author = "Andrew C. Yao and F. Frances Yao",
22951 title = "On fault-tolerant networks for sorting",
22952 type = "Technical Report",
22953 number = "STAN-CS-79-721",
22954 institution = inst-STAN-CS,
22955 address = inst-STAN-CS:adr,
22956 pages = "??",
22957 month = feb,
22958 year = "1979",
22959 bibdate = "Fri Nov 7 07:00:05 MST 2025",
22960 bibsource = "https://www.math.utah.edu/pub/bibnet/authors/s/shannon-claude-elwood.bib;
22961 https://www.math.utah.edu/pub/bibnet/authors/v/von-neumann-john.bib;
22962 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
22963 URL = "http://i.stanford.edu/TR/CS-TR-79-721.html",
22964 abstract = "The study of constructing reliable systems from
22965 unreliable components goes back to the work of von
22966 Neumann, and of Moore and Shannon. The present paper
22967 studies the use of redundancy to enhance reliability
22968 for sorting and related networks built from unreliable
22969 comparators. Two models of fault-tolerant networks are
22970 discussed. The first model patterns after the concept
22971 of error-correcting codes in information theory, and
22972 the other follows the stochastic criterion used by von
22973 Neumann and Moore--Shannon. It is shown, for example,
22974 that an additional $ k (2 n - 3) $ comparators are
22975 sufficient to render a sorting network reliable,
22976 provided that no more than $k$ of its comparators may
22977 be faulty.",
22978 acknowledgement = ack-nhfb,
22979 pdfpages = "24",
22980 xxnumber = "CS-TR-79-721",
22981 }
22982
22983 @TechReport{Wiederhold:1979:SMD,
22984 author = "Gio Wiederhold and Ramez A. El-Masri",
22985 title = "A structural model for database systems",
22986 type = "Technical Report",
22987 number = "STAN-CS-79-722 (AD-A074077)",
22988 institution = inst-STAN-CS,
22989 address = inst-STAN-CS:adr,
22990 pages = "??",
22991 month = feb,
22992 year = "1979",
22993 bibdate = "Fri Nov 7 07:00:05 MST 2025",
22994 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
22995 URL = "http://i.stanford.edu/TR/CS-TR-79-722.html",
22996 abstract = "This report presents a model to be used for database
22997 design. Because our motivation extends to providing
22998 guidance for the structured implementation of a
22999 database, we call our model the 'Structural Model.' We
23000 derive the design using criteria of correctness,
23001 relevance, and performance from semantic and
23002 operational specifications obtained from multiple
23003 sources. These sources typically correspond to
23004 prospective users or user groups of the database. The
23005 integration of such specifications is a central issue
23006 in the development of an integrated structural database
23007 model. The structural model is used for the design of
23008 the logical structures that represent a real-world
23009 situation. However, it is not meant to represent all
23010 possible real-world semantics, but a subset of the
23011 semantics which are important in database modelling.
23012 The model uses relations as building blocks, and hence
23013 can be considered as an extension of Codd's relational
23014 model [1970]. The main extensions to the relational
23015 model are the explicit representation of logical
23016 connections between relations, the inclusion of
23017 insertion-deletion constraints in the model itself, and
23018 the separation of relations into several structural
23019 types. Connections between relations are used to
23020 represent existence dependencies of tuples in different
23021 relations. These existence dependencies are important
23022 for the definition of semantics of relationships
23023 between classes of real-world entities. The connections
23024 between relations are used to specify these existence
23025 dependencies, and to ensure that they remain valid when
23026 the database is updated. Hence, connections implicitly
23027 define a basic, limited set of integrity constraints on
23028 the database, those that identify and maintain
23029 existence dependencies among tuples from different
23030 relations. Consequently, the rules for the maintenance
23031 of the structural integrity of the model under
23032 insertion and deletion of tuples are easy to specify.
23033 Structural relation types are used to specify how each
23034 relation may be connected to other relations in the
23035 model. Relations are classified into five types:
23036 primary relations, referenced relations, nest
23037 relations, association relations, and lexicon
23038 relations. The motivation behind the choice of these
23039 relation types is discussed, as is their use in data
23040 model design. A methodology for combining multiple,
23041 overlapping data models - also called user views in the
23042 literature - is associated with the structural model.
23043 The database model, or conceptual schema, which
23044 represents the integrated database, may thus be derived
23045 from the individual data models of the users. We
23046 believe that the structural model can be used to
23047 represent the data relationships within the conceptual
23048 schema of the ANSI/SPARC DBMS model since it can
23049 support database submodels, also called external
23050 schema, and maintain the integrity of the submodels
23051 with respect to the integrity constraints expressable
23052 in the structural model. We then briefly discuss the
23053 use of the structural model in database design and
23054 implementation. The structural model provides a tool to
23055 deal effectively with the complexity of large,
23056 real-world databases. We begin this report with a very
23057 short review of existing database models. In Chapter 2,
23058 we state the purpose of the model, and in Chapter 3 we
23059 describe the structural model, first informally and
23060 then using a formal framework based on extensions of
23061 the relational model. Chapter 4 defines the
23062 representations we use, and Chapter 5 covers the
23063 integration of data models that represent the different
23064 user specifications into an integrated database model.
23065 Formal descriptions and examples of the prevalent cases
23066 are given. The work is then placed into context first
23067 relative to other work (Chapter 6) and then briefly
23068 within our methodology for database design (Chapter
23069 7).",
23070 acknowledgement = ack-nhfb,
23071 pdfpages = "62",
23072 xxnumber = "CS-TR-79-722",
23073 }
23074
23075 @TechReport{Shortliffe:1979:KEM,
23076 author = "Edward H. Shortliffe and Bruce G. Buchanan and Edward
23077 A. Feigenbaum",
23078 title = "Knowledge Engineering for Medical Decision Making: a
23079 review of computer-based clinical decision aids",
23080 type = "Technical Report",
23081 number = "STAN-CS-79-723 (AD-A074076)",
23082 institution = inst-STAN-CS,
23083 address = inst-STAN-CS:adr,
23084 pages = "v + 48",
23085 month = feb,
23086 year = "1979",
23087 bibdate = "Tue Nov 25 08:51:44 2025",
23088 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
23089 URL = "",
23090 abstract = "Computer-based models of medical decision making
23091 account for a large proportion of clinical computing
23092 efforts. This article reviews representative examples
23093 from each of several major medical computing paradigms.
23094 These examples include (1) clinical algorithms, (2)
23095 clinical databanks that include analytic functions, (3)
23096 mathematical models of physical processes, (4) pattern
23097 recognition, (5) Bayesian statistics, (6) intelligence.
23098 decision analysis, and (7) symbolic reasoning or
23099 artificial intelligence. Because the techniques used in
23100 the various systems cannot be examined exhaustively,
23101 the case studies in each category are used as a basis
23102 for studying general best strengths and limitations. It
23103 is noted that no one method is best for all
23104 applications. However, emphasis is given to the
23105 limitations of early work that have made artificial
23106 intelligence techniques and knowledge engineering
23107 research particularly attractive. We stress that
23108 considerable basic research in medical computing
23109 remains to be done and that powerful new approaches may
23110 lie in the melding of two or more established
23111 techniques.",
23112 acknowledgement = ack-nhfb,
23113 pdfpages = "53",
23114 }
23115
23116 @TechReport{McCarthy:1979:FOT,
23117 author = "John McCarthy",
23118 title = "First Order Theories of Individual Concepts and
23119 Propositions",
23120 type = "Technical Report",
23121 number = "STAN-CS-79-724 (AIM-325)",
23122 institution = inst-STAN-CS,
23123 address = inst-STAN-CS:adr,
23124 pages = "26",
23125 month = mar,
23126 year = "1979",
23127 bibdate = "Tue Nov 25 08:51:44 2025",
23128 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
23129 URL = "",
23130 abstract = "We discuss first order theories in which individual
23131 concepts are admitted as mathematical objects along
23132 with the things that reify them. This allows very
23133 straightforward formalizations of knowledge, belief,
23134 wanting, and necessity in ordinary first order logic
23135 without modal operators. Applications are given in
23136 philosophy and in artificial intelligence. We do not
23137 treat general concepts, and we do not present any full
23138 axiomatizations but rather show how various facts can
23139 be expressed",
23140 acknowledgement = ack-nhfb,
23141 author-dates = "John McCarthy (4 September 1927--24 October 2011)",
23142 pdfpages = "26",
23143 remark = "PDF file is a reprint dated 31 October 2000.",
23144 }
23145
23146 @TechReport{McCarthy:1979:AMQ,
23147 author = "John McCarthy",
23148 title = "Ascribing Mental Qualities to Machines",
23149 type = "Technical Report",
23150 number = "STAN-CS-79-725 (AIM-326, AD-A071423)",
23151 institution = inst-STAN-CS,
23152 address = inst-STAN-CS:adr,
23153 pages = "25",
23154 month = mar,
23155 year = "1979",
23156 bibdate = "Tue Nov 25 08:51:44 2025",
23157 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
23158 URL = "",
23159 acknowledgement = ack-nhfb,
23160 author-dates = "John McCarthy (4 September 1927--24 October 2011)",
23161 }
23162
23163 @TechReport{Yao:1979:AHK,
23164 author = "Andrew Chi-Chih Yao",
23165 title = "An analysis of $ (h, k, l)$-shellsort",
23166 type = "Technical Report",
23167 number = "STAN-CS-79-726",
23168 institution = inst-STAN-CS,
23169 address = inst-STAN-CS:adr,
23170 pages = "??",
23171 month = mar,
23172 year = "1979",
23173 bibdate = "Fri Nov 7 07:00:05 MST 2025",
23174 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
23175 URL = "http://i.stanford.edu/TR/CS-TR-79-726.html",
23176 abstract = "One classical sorting algorithm, whose performance in
23177 many cases remains unanalyzed, is Shellsort. Let $ \vec
23178 {h} $ be a $t$-component vector of positive integers.
23179 An $ \vec {h}$-Shellsort will sort any given n elements
23180 in t passes, by means of comparisons and exchanges of
23181 elements. Let $ S_j(\vec {h}; n)$ denote the average
23182 number of element exchanges in the $j$-th pass,
23183 assuming that all the $ n!$ initial orderings are
23184 equally likely. In this paper we derive asymptotic
23185 formulas of $ S_j(\vec {h}; n)$ for any fixed $ \vec
23186 {h} = (h, k, l)$, making use of a new combinatorial
23187 interpretation of $ S_3$. For the special case $ \vec
23188 {h} = (3, 2, 1)$, the analysis if further sharpened to
23189 yield exact expressions.",
23190 acknowledgement = ack-nhfb,
23191 pdfpages = "58",
23192 xxnumber = "CS-TR-79-726",
23193 }
23194
23195 @TechReport{Filman:1979:IOI,
23196 author = "Robert Elliot Filman",
23197 title = "The Interaction of Observation and Inference",
23198 type = "Technical Report",
23199 number = "STAN-CS-79-727 (AIM-327, AD-A076794)",
23200 institution = inst-STAN-CS,
23201 address = inst-STAN-CS:adr,
23202 pages = "vii + 226",
23203 month = apr,
23204 year = "1979",
23205 bibdate = "Tue Nov 25 08:51:44 2025",
23206 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
23207 URL = "",
23208 abstract = "An intelligent computer program must have both a
23209 representation of its knowledge, and a mechanism for
23210 manipulating that knowledge in 2a reasoning process.
23211 This thesis is an examination of the problem of
23212 formalizing the expression and solution of reasoning
23213 problems in a machine manipulable form. It is
23214 particularly concerned with analyzing the interaction
23215 of the standard form of deductive steps with an
23216 observational analogy obtained by performing
23217 computation in a semantic model.\par
23218
23219 Consideration in this dissertation is centered on the
23220 world of retrograde analysis chess, a particularly rich
23221 domain for both observational tasks and long deductive
23222 sequences.\par
23223
23224 A formalization is embodied in its axioms, and a major
23225 portion of this dissertation is devoted to both
23226 axiomatizing the rules of chess, and discussing and
23227 comparing the representational decisions involved in
23228 that axiomatization. Consideration was given to not
23229 only the necessity for these particular choices (and
23230 possible alternatives) but also the implications of
23231 these results for designers of representational systems
23232 for other domains.\par
23233
23234 Using a reasoning system for first order logic,
23235 ``FOL'', a detailed proof of the solution of a
23236 difficult retrograde chess puzzle was constructed. The
23237 close correspondence between this ``formal'' solution
23238 to the problem, and an ``informal, descriptive''
23239 analysis a human might present was shown.\par
23240
23241 The proof and axioms were then examined for their
23242 relevance to general epistemological formalisms. The
23243 importance of several different mechanisms were
23244 considered. These included: (1) retaining both the
23245 notion of ``current status'' (typically embodied as the
23246 current chessboard) and that of ``historical state'' (a
23247 hypothetical game played to reach desired place), (2)
23248 evaluating functional and predicate objects in the
23249 semantic model (the chess eye), (3) the value of
23250 ``induction schemas'' as partial solutions to frame
23251 problems, (4) the retention of explicit undefined
23252 elements within the representation, (5) the importance
23253 of manipulating multiple representations of objects,
23254 and (6) a comparison of state vector and modal
23255 representations.",
23256 acknowledgement = ack-nhfb,
23257 advisor = "John McCarthy",
23258 pdfpages = "236",
23259 remark = "This is the author's thesis.",
23260 }
23261
23262 @TechReport{Shiloach:1979:UMA,
23263 author = "Yossi Shiloach",
23264 title = "Union-member algorithms for non-disjoint sets",
23265 type = "Technical Report",
23266 number = "STAN-CS-79-728",
23267 institution = inst-STAN-CS,
23268 address = inst-STAN-CS:adr,
23269 pages = "??",
23270 month = jan,
23271 year = "1979",
23272 bibdate = "Fri Nov 7 07:00:05 MST 2025",
23273 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
23274 URL = "http://i.stanford.edu/TR/CS-TR-79-728.html",
23275 abstract = "In this paper we deal with the following problem. We
23276 are given a finite set $ U = \{ u_1, \ldots {}, u_n \}
23277 $ and a set $ {\cal S} = \{ S_1, \ldots {}, S_m \} $ of
23278 subsets of $U$. We are also given $ m - 1$ UNION
23279 instructions that have the form UNION($ S_i $,$ S_j$)
23280 and mean `add the set $ S_i \cup S_j$ to the collection
23281 and delete $ S_i$ and $ S_j$.' Interspaced among the
23282 UNIONs are MEMBER(i,j) questions that mean `does $ u_i$
23283 belong to {$ S_j $}?' We present two algorithms that
23284 exhibit the trade-off among the three interesting
23285 parameters of this problem, which are: 1. Time required
23286 to answer one membership question. 2. Time required to
23287 perform the $ m - 1$ UNIONs altogether. 3. Space. We
23288 also give an application of these algorithms to the
23289 problem of 5-coloring of planar graphs.",
23290 acknowledgement = ack-nhfb,
23291 pdfpages = "13",
23292 xxnumber = "CS-TR-79-728",
23293 }
23294
23295 @TechReport{Tarjan:1979:UAP,
23296 author = "Robert Endre Tarjan",
23297 title = "A unified approach to path problems",
23298 type = "Technical Report",
23299 number = "STAN-CS-79-729 (AD-A068229)",
23300 institution = inst-STAN-CS,
23301 address = inst-STAN-CS:adr,
23302 pages = "??",
23303 month = apr,
23304 year = "1979",
23305 bibdate = "Fri Nov 7 07:00:05 MST 2025",
23306 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib;
23307 https://www.math.utah.edu/pub/tex/bib/string-matching.bib",
23308 URL = "http://i.stanford.edu/TR/CS-TR-79-729.html",
23309 abstract = "We describe a general method for solving path problems
23310 on directed graphs. Such path problems include finding
23311 shortest paths, solving sparse systems of linear
23312 equations, and carrying out global flow analysis of
23313 computer programs. Our method consists of two steps.
23314 First, we construct a collection of regular expressions
23315 representing sets of paths in the graph. This can be
23316 done by using any standard algorithm, such as Gaussian
23317 or Gauss--Jordan elimination. Next, we apply a natural
23318 mapping from regular expressions into the given problem
23319 domain. We exhibit the mappings required to find
23320 shortest paths, solve sparse systems of linear
23321 equations, and carry out global flow analysis. Our
23322 results provide a general-purpose algorithm for solving
23323 any path problem, and show that the problem of
23324 constructing path expressions is in some sense the most
23325 general path problem.",
23326 acknowledgement = ack-nhfb,
23327 pdfpages = "44",
23328 xxnumber = "CS-TR-79-729",
23329 }
23330
23331 @TechReport{Liang:1979:QEC,
23332 author = "Frank M. Liang",
23333 title = "Qualifying examinations in computer science,
23334 1965--1978",
23335 type = "Technical Report",
23336 number = "STAN-CS-79-730",
23337 institution = inst-STAN-CS,
23338 address = inst-STAN-CS:adr,
23339 pages = "??",
23340 month = apr,
23341 year = "1979",
23342 bibdate = "Fri Nov 7 07:00:05 MST 2025",
23343 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
23344 URL = "http://i.stanford.edu/TR/CS-TR-79-730.html",
23345 abstract = "Since 1965, the Stanford Computer Science Department
23346 has periodically given `qualifying examinations' as one
23347 of the requirements of its graduate program. These
23348 examinations are given in each of six subareas of
23349 computer science: Programming Languages and Systems,
23350 Artificial Intelligence, Numerical Analysis, Computer
23351 Design, Theory of Computation, and Analysis of
23352 Algorithms. This report presents the questions from
23353 these examinations, and also the associated reading
23354 lists.",
23355 acknowledgement = ack-nhfb,
23356 pdfpages = "234",
23357 xxnumber = "CS-TR-79-730",
23358 }
23359
23360 @TechReport{Luckham:1979:SPV,
23361 author = "David C. Luckham and Steven M. German and Friedrich W.
23362 von Henke and Richard A. Karp and P. W. Milne and Derek
23363 C. Oppen and Wolfgang Polak and William L. Scherlis",
23364 title = "{Stanford Pascal Verifier} user manual",
23365 type = "Technical Report",
23366 number = "STAN-CS-79-731 (PVG-11, AD-A071900)",
23367 institution = inst-STAN-CS,
23368 address = inst-STAN-CS:adr,
23369 pages = "??",
23370 month = mar,
23371 year = "1979",
23372 bibdate = "Fri Nov 7 07:00:05 MST 2025",
23373 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
23374 URL = "http://i.stanford.edu/TR/CS-TR-79-731.html",
23375 abstract = "The Stanford PASCAL verifier is an interactive program
23376 verification system. It automates much of the work
23377 necessary to analyze a program for consistency with its
23378 documentation, and to give a rigorous mathematical
23379 proof of such consistency or to pin-point areas of
23380 inconsistency. It has been shown to have applications
23381 as an aid to programming, and to have potential for
23382 development as a new and useful tool in the production
23383 of reliable software.",
23384 acknowledgement = ack-nhfb,
23385 pdfpages = "124",
23386 xxnumber = "CS-TR-79-731",
23387 }
23388
23389 @TechReport{Woods:1979:NIC,
23390 author = "Donald R. Woods",
23391 title = "Notes on introductory combinatorics",
23392 type = "Technical Report",
23393 number = "STAN-CS-79-732",
23394 institution = inst-STAN-CS,
23395 address = inst-STAN-CS:adr,
23396 pages = "??",
23397 month = apr,
23398 year = "1979",
23399 bibdate = "Fri Nov 7 07:00:05 MST 2025",
23400 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
23401 URL = "http://i.stanford.edu/TR/CS-TR-79-732.html",
23402 abstract = "In the spring of 1978, Professors George Polya and
23403 Robert Tarjan teamed up to teach CS 150 - Introduction
23404 to Combinatorics. This report consists primarily of the
23405 class notes and other handouts produced by the author
23406 as teaching assistant for the course. Among the topics
23407 covered are elementary subjects such as combinations
23408 and permutations, mathematical tools such as generating
23409 functions and Polya's Theory of Counting, and analyses
23410 of specific problems such as Ramsey Theory, matchings,
23411 and Hamiltonian and Eulerian paths.",
23412 acknowledgement = ack-nhfb,
23413 pdfpages = "124",
23414 xxnumber = "CS-TR-79-732",
23415 }
23416
23417 @TechReport{Yao:1979:LBF,
23418 author = "Andrew Chi-Chih Yao",
23419 title = "A lower bound to finding convex hulls",
23420 type = "Technical Report",
23421 number = "STAN-CS-79-733",
23422 institution = inst-STAN-CS,
23423 address = inst-STAN-CS:adr,
23424 pages = "??",
23425 month = apr,
23426 year = "1979",
23427 bibdate = "Fri Nov 7 07:00:05 MST 2025",
23428 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
23429 URL = "http://i.stanford.edu/TR/CS-TR-79-733.html",
23430 abstract = "Given a set S of n distinct points {($ x_i $,$ y_i$) |
23431 0 $ \leq $ i < n}, the convex hull problem is to
23432 determine the vertices of the convex hull H(S). All the
23433 known algorithms for solving this problem have a
23434 worst-case running time of c$ n \log n $ or higher, and
23435 employ only quadratic tests, i.e., tests of the form
23436 f($ x_0$, $ y_0$, $ x_1$, $ y_1$, \ldots{}, $ x_{n -
23437 1}$, $ y_{n - 1}$): 0 with f being any polynomial of
23438 degree not exceeding 2. In this paper, we show that any
23439 algorithm in the quadratic decision-tree model must
23440 make c$ n \log n $ tests for some input.",
23441 acknowledgement = ack-nhfb,
23442 pdfpages = "24",
23443 xxnumber = "CS-TR-79-733",
23444 }
23445
23446 @TechReport{Tarjan:1979:FAS,
23447 author = "Robert Endre Tarjan",
23448 title = "Fast algorithms for solving path problems",
23449 type = "Technical Report",
23450 number = "STAN-CS-79-734 (AD-A074079)",
23451 institution = inst-STAN-CS,
23452 address = inst-STAN-CS:adr,
23453 pages = "??",
23454 month = apr,
23455 year = "1979",
23456 bibdate = "Fri Nov 7 07:00:05 MST 2025",
23457 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib;
23458 https://www.math.utah.edu/pub/tex/bib/string-matching.bib",
23459 URL = "http://i.stanford.edu/TR/CS-TR-79-734.html",
23460 abstract = "Let $ G = (V, E) $ be a directed graph with a
23461 distinguished source vertex $s$. The single-source path
23462 expression problem is to find, for each vertex $v$, a
23463 regular expression $ P(s, v)$ which represents the set
23464 of all paths in $G$ from $s$ to $v$. A solution to this
23465 problem can be used to solve shortest path problems,
23466 solve sparse systems of linear equations, and carry out
23467 global flow analysis. We describe a method to compute
23468 path expressions by dividing $G$ into components,
23469 computing path expressions on the components by
23470 Gaussian elimination, and combining the solutions. This
23471 method requires $ O(m \alpha (m, n))$ time on a
23472 reducible flow graph, where $n$ is the number of
23473 vertices in $G$, $m$ is the number of edges in $G$, and
23474 $ \alpha $ is a functional inverse of Ackermann's
23475 function. The method makes use of an algorithm for
23476 evaluating functions defined on paths in trees. A
23477 simplified version of the algorithm, which runs in $
23478 O(m \log n)$ time on reducible flow graphs, is quite
23479 easy to implement and efficient in practice.",
23480 acknowledgement = ack-nhfb,
23481 pdfpages = "50",
23482 xxnumber = "CS-TR-79-734",
23483 }
23484
23485 @TechReport{Wilkinson:1979:KCF,
23486 author = "James Hardy Wilkinson",
23487 title = "{Kronecker}'s canonical form and the {$ Q Z $}
23488 algorithm",
23489 type = "Technical Report",
23490 number = "STAN-CS-79-735",
23491 institution = inst-STAN-CS,
23492 address = inst-STAN-CS:adr,
23493 pages = "??",
23494 month = apr,
23495 year = "1979",
23496 bibdate = "Fri Nov 7 07:00:05 MST 2025",
23497 bibsource = "https://www.math.utah.edu/pub/bibnet/authors/w/wilkinson-james-hardy.bib;
23498 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
23499 URL = "http://i.stanford.edu/TR/CS-TR-79-735.html",
23500 abstract = "In the QZ algorithm the eigenvalues of Ax = $ \lambda
23501 $Bx are computed via a reduction to the form $ \tilde
23502 {A} $ x = $ \lambda \tilde {B} $ x where $ \tilde {A} $
23503 and $ \tilde {B} $ are upper triangular. The
23504 eigenvalues are given by $ {\lambda }_i $ = $ a_{ii} $
23505 /$ b_{ii} $. It is shown that when the pencil $ \tilde
23506 {A} $ - $ \lambda \tilde {B} $ is singular or nearly
23507 singular a value of $ {\lambda }_i $ may have no
23508 significance even when $ \tilde {a}_{ii} $ and $ \tilde
23509 {b}_{ii} $ are of full size.",
23510 acknowledgement = ack-nhfb,
23511 pdfpages = "28",
23512 xxnumber = "CS-TR-79-735",
23513 }
23514
23515 @TechReport{Wilkinson:1979:NPS,
23516 author = "James Hardy Wilkinson",
23517 title = "Note on the practical significance of the {Drazin}
23518 inverse",
23519 type = "Technical Report",
23520 number = "STAN-CS-79-736",
23521 institution = inst-STAN-CS,
23522 address = inst-STAN-CS:adr,
23523 pages = "??",
23524 month = apr,
23525 year = "1979",
23526 bibdate = "Fri Nov 7 07:00:05 MST 2025",
23527 bibsource = "https://www.math.utah.edu/pub/bibnet/authors/w/wilkinson-james-hardy.bib;
23528 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
23529 URL = "http://i.stanford.edu/TR/CS-TR-79-736.html",
23530 abstract = "The solution of the differential system $ B x = A x +
23531 f $ where $A$ and $B$ are $ n \times n $ matrices and $
23532 A - \lambda B $ is not a singular pencil may be
23533 expressed in terms of the Drazin inverse. It is shown
23534 that there is a simple reduced form for the pencil $ A
23535 - \lambda B $ which is adequate for the determination
23536 of the general solution and that although the Drazin
23537 inverse could be determined efficiently from this
23538 reduced form it is inadvisable to do so.",
23539 acknowledgement = ack-nhfb,
23540 pdfpages = "24",
23541 xxnumber = "CS-TR-79-736",
23542 }
23543
23544 @TechReport{Yao:1979:ACC,
23545 author = "Andrew C. Yao and F. Frances Yao",
23546 title = "On the average-case complexity of selecting the $k$-th
23547 best",
23548 type = "Technical Report",
23549 number = "STAN-CS-79-737",
23550 institution = inst-STAN-CS,
23551 address = inst-STAN-CS:adr,
23552 pages = "??",
23553 month = apr,
23554 year = "1979",
23555 bibdate = "Fri Nov 7 07:00:05 MST 2025",
23556 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
23557 URL = "http://i.stanford.edu/TR/CS-TR-79-737.html",
23558 abstract = "Let $ {\bar {V}}_k (n) $ be the minimum average number
23559 of pairwise comparisons needed to find the $k$-th
23560 largest of $n$ numbers $ (k \leq 2) $, assuming that
23561 all $ n! $ orderings are equally likely. D. W. Matula
23562 proved that, for some absolute constant $c$, $ {\bar
23563 {V}}_k (n) - n \leq c k \log \log n $ as $ n \to \infty
23564 $. In the present paper, we show that there exists an
23565 absolute constant $ c' > 0 $ such that $ {\bar {V}}_k
23566 (n) - n \leq c' k \log \log n $ as $ n \to \infty $,
23567 proving a conjecture of Matula.",
23568 acknowledgement = ack-nhfb,
23569 pdfpages = "48",
23570 xxnumber = "CS-TR-79-737",
23571 }
23572
23573 @TechReport{LeVeque:1979:CRG,
23574 author = "Randall J. LeVeque and Germund Dahlquist and Dan
23575 Andree",
23576 title = "Computations related to G-stability of linear
23577 multistep methods",
23578 type = "Technical Report",
23579 number = "STAN-CS-79-738 (SU326 P30-65)",
23580 institution = inst-STAN-CS,
23581 address = inst-STAN-CS:adr,
23582 pages = "??",
23583 month = may,
23584 year = "1979",
23585 bibdate = "Fri Nov 7 07:00:05 MST 2025",
23586 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
23587 URL = "http://i.stanford.edu/TR/CS-TR-79-738.html",
23588 abstract = "In Dahlquist's recent proof of the equivalence of
23589 A-stability and G-stability, an algorithm was presented
23590 for calculating a G-stability matrix for any A-stable
23591 linear multistep method. Such matrices, and various
23592 quantities computable from them, are useful in many
23593 aspects of the study of the stability of a given
23594 method. For example, information may be gained as to
23595 the shape of the stability region, or the rate of
23596 growth of unstable solutions. We present a summary of
23597 the relevant theory and the results of some numerical
23598 calculations performed for several backward
23599 differentiation, Adams--Bashforth, and Adams--Moulton
23600 methods of low order.",
23601 acknowledgement = ack-nhfb,
23602 author-dates = "Germund Dahlquist (16 January 1925--8 February 2005)",
23603 pdfpages = "28",
23604 xxnumber = "CS-TR-79-738",
23605 }
23606
23607 @TechReport{Quinlan:1979:ILD,
23608 author = "J. R. Quinlan",
23609 title = "Induction over large data bases",
23610 type = "Technical Report",
23611 number = "STAN-CS-79-739 (HPP-79-14, AD-A074075)",
23612 institution = inst-STAN-CS,
23613 address = inst-STAN-CS:adr,
23614 pages = "??",
23615 month = may,
23616 year = "1979",
23617 bibdate = "Fri Nov 7 07:00:05 MST 2025",
23618 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
23619 URL = "http://i.stanford.edu/TR/CS-TR-79-739.html",
23620 abstract = "Techniques for discovering rules by induction from
23621 large collections of instances are developed. These are
23622 based on an iterative scheme for dividing the instances
23623 into two sets, only one of which needs to be randomly
23624 accessible. These techniques have made it possible to
23625 discover complex rules from data bases containing many
23626 thousands of instances. Results of several experiments
23627 using them are reported.",
23628 acknowledgement = ack-nhfb,
23629 pdfpages = "20",
23630 xxnumber = "CS-TR-79-739",
23631 }
23632
23633 @TechReport{Cartwright:1979:LA,
23634 author = "Robert Cartwright and Derek C. Oppen",
23635 title = "The logic of aliasing",
23636 type = "Technical Report",
23637 number = "STAN-CS-79-740 (PVG-12)",
23638 institution = inst-STAN-CS,
23639 address = inst-STAN-CS:adr,
23640 pages = "??",
23641 month = sep,
23642 year = "1979",
23643 bibdate = "Fri Nov 7 07:00:05 MST 2025",
23644 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
23645 URL = "http://i.stanford.edu/TR/CS-TR-79-740.html",
23646 abstract = "We give a new version of Hoare's logic which correctly
23647 handles programs with aliased variables. The central
23648 proof rules of the logic (procedure call and
23649 assignment) are proved sound and complete.",
23650 acknowledgement = ack-nhfb,
23651 pdfpages = "24",
23652 xxnumber = "CS-TR-79-740",
23653 }
23654
23655 @TechReport{Ramshaw:1979:FAA,
23656 author = "Lyle Harold Ramshaw",
23657 title = "Formalizing the Analysis of Algorithms",
23658 type = "Technical Report",
23659 number = "STAN-CS-79-741",
23660 institution = inst-STAN-CS,
23661 address = inst-STAN-CS:adr,
23662 pages = "123",
23663 month = jun,
23664 year = "1979",
23665 bibdate = "Tue Nov 25 08:51:44 2025",
23666 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
23667 URL = "",
23668 acknowledgement = ack-nhfb,
23669 remark = "This is the author's thesis.",
23670 }
23671
23672 @TechReport{Gardner:1979:HAI,
23673 author = "Anne Gardner",
23674 title = "Handbook of Artificial Intelligence: Search",
23675 type = "Technical Report",
23676 number = "STAN-CS-79-742 (HPP-79-12, AD-A074078)",
23677 institution = inst-STAN-CS,
23678 address = inst-STAN-CS:adr,
23679 pages = "ix + 104",
23680 month = jun,
23681 year = "1979",
23682 bibdate = "Tue Nov 25 08:51:44 2025",
23683 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
23684 note = "A section of the \booktitle{Handbook of Artificial
23685 Intelligence} edited by Avron Barr and Edward A.
23686 Feigenbaum.",
23687 URL = "",
23688 acknowledgement = ack-nhfb,
23689 pdfpages = "113",
23690 remark = "No abstract is present.",
23691 }
23692
23693 @TechReport{Bulnes-Rozas:1979:GGO,
23694 author = "Juan Bautista Bulnes-Rozas",
23695 title = "{GOAL}: a Goal Oriented Command Language for
23696 Interactive Proof Construction",
23697 type = "Technical Report",
23698 number = "STAN-CS-79-743 (AIM-328)",
23699 institution = inst-STAN-CS,
23700 address = inst-STAN-CS:adr,
23701 pages = "vi + 172",
23702 month = jun,
23703 year = "1979",
23704 bibdate = "Tue Nov 25 08:51:44 2025",
23705 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
23706 URL = "",
23707 abstract = "This thesis represents a contribution to the
23708 development of practical computer systems for
23709 interactive construction of formal proofs. Beginning
23710 with a summary of current research in automatic theorem
23711 proving, goal oriented systems, proof checking, and
23712 program verification, this work aims at bridging the
23713 gap between proof checking and theorem
23714 proving.\par
23715
23716 Specifically, It describes a system GOAL for the First
23717 Order Logic proof checker FOL. GOAL helps the user of
23718 FOL in the creation of long proofs in three ways: (1)
23719 as a facility for structured, top down proof
23720 construction; (2) as a semi-automatic theorem prover;
23721 and (3) as an extensible environment for the
23722 programming of theorem proving heuristics.\par
23723
23724 In GOAL, the user defines top level goals. These are
23725 then recursively decomposed into subgoals. The main
23726 part of a goal is a well formed formula that one
23727 desires to prove, but they include assertions,
23728 simplification sets, and other information. Goals can
23729 be tried by three different types of elements:
23730 matchers, tactics, and strategies.\par
23731
23732 The matchers attempt to prove a goal directly --- that
23733 is without reducing it into subgoals --- by calling
23734 decision procedures of FOL. Successful application of a
23735 matcher causes the proved goal to be added to the FOL
23736 proof.\par
23737
23738 A tactic reduces a goal into one or more subgoals. Each
23739 tactic is the Inverse of some inference rule of FOL;
23740 the goal structure records all the necessary
23741 information so that the appropriate Inference rule is
23742 called when all the subgoals of a goal are proved. In
23743 this way the goal tree unwinds automatically, producing
23744 a FOL proof of the top level goal from the proofs or
23745 its leaves.",
23746 acknowledgement = ack-nhfb,
23747 advisor = "John McCarthy",
23748 pdfpages = "179",
23749 remark = "This is the author's thesis.",
23750 }
23751
23752 @TechReport{Garcia-Molina:1979:PUA,
23753 author = "Hector Garcia-Molina",
23754 title = "Performance of Update Algorithms for Replicated Data
23755 in a Distributed Database",
23756 type = "Technical Report",
23757 number = "STAN-CS-79-744 (CSL-TR-172, AD-A075268)",
23758 institution = inst-STAN-CS,
23759 address = inst-STAN-CS:adr,
23760 pages = "xii + 307",
23761 month = jun,
23762 year = "1979",
23763 bibdate = "Tue Nov 25 08:51:44 2025",
23764 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
23765 URL = "https://apps.dtic.mil/sti/citations/ADA075268;
23766 https://apps.dtic.mil/sti/pdfs/ADA075268.pdf",
23767 abstract = "In this thesis we study the performance of update
23768 algorithms for replicated data in a distributed
23769 database. In doing so, we also investigate several
23770 other related issues.\par
23771
23772 We start by presenting a simple model of a distributed
23773 database which is suitable for studying updates and
23774 concurrency control. We also develop a performance
23775 model and a set of parameters which represent the most
23776 important performance features of a distributed
23777 database.\par
23778
23779 The distributed database models are used to study the
23780 performance of update algorithms for replicated data.
23781 This is done in two steps. First the algorithms are
23782 analyzed in the case of completely replicated databases
23783 in a no failure, update only environment. Then, the
23784 restrictions that we made are eliminated one at a time,
23785 and the impact on the system performance of doing this
23786 is evaluated. For the first step, we develop a new
23787 technique for analyzing the performance of update
23788 algorithms. This iterative technique is based on
23789 queueing theory. Several well known update algorithms
23790 are analyzed using this technique. The performance
23791 results are verified through detailed simulations of
23792 the algorithms. The results show that centralized
23793 control algorithms nearly always perform better than
23794 the more popular distributed control algorithms. This
23795 is a surprising result because t he distributed
23796 algorithms were thought to be more efficient.\par
23797
23798 The performance results are also useful for identifying
23799 the critical system resources. This insight leads to
23800 the development of several new update algorithms with
23801 improved performance. In particular, the MCLA-h
23802 algorithm which we present per forms better than all
23803 other update algorithms in most cases of interest. The
23804 MCLA-h algorithm is based on the new concept of hole
23805 lists which are used to increase the parallelism of
23806 updates. Several variations of the MCLA-h algorithms
23807 arc also analyzed.\par
23808
23809 In order to investigate the validity of our results in
23810 a general system, we relax the assumptions made
23811 initially in the performance studies. We show that it
23812 is possible to make a centralized control algorithm
23813 (like the MCLA-h) resilient in the face of many types
23814 of failures. We show that the cost in terms of
23815 performance for doing this is roughly the same for all
23816 algorithms and thus, the original performance
23817 comparisons are still valid in the case of crash
23818 resistant algorithms.\par
23819
23820 We analyze distributed databases with partitioned data
23821 and multiple independent control mechanisms (called
23822 controllers). We describe transaction processing in
23823 this environment and we discuss how the performance
23824 results of the fully duplicated case can be used to
23825 design update algorithms in this environment.\par
23826
23827 We demonstrate how updates that do not specify their
23828 base set initially can be processed. We present three
23829 fundamental alternatives for processing these updates
23830 and we analyze their performance.\par
23831
23832 The operation of read only transactions (queries) and
23833 their interaction with the update algorithms has not
23834 been covered in the literature. In this thesis, we
23835 classify queries into free, consistent and current
23836 queries, and we present algorithms for processing each
23837 type of query under the different update algorithms.",
23838 acknowledgement = ack-nhfb,
23839 pdfpages = "167",
23840 remark = "This is the author's thesis. Most of the PDF pages are
23841 two physical pages rotated 90 degrees upward. No PDF in
23842 NTRL archive. Found in DTIC archive.",
23843 }
23844
23845 @TechReport{Lengauer:1979:ULB,
23846 author = "Thomas Lengauer",
23847 title = "Upper and Lower Bounds on Time-Space Tradeoffs in a
23848 Pebble Game",
23849 type = "Technical Report",
23850 number = "STAN-CS-79-745 (AD-A076264)",
23851 institution = inst-STAN-CS,
23852 address = inst-STAN-CS:adr,
23853 pages = "vii + 75",
23854 month = jul,
23855 year = "1979",
23856 bibdate = "Tue Nov 25 08:51:44 2025",
23857 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
23858 URL = "https://apps.dtic.mil/sti/tr/pdf/ADA076264.pdf",
23859 abstract = "We derive asymptotically light time--space tradeoffs
23860 for pebbling three different classes of directed
23861 acyclic graphs. Let $N$ be the size of the graph, $S$
23862 the number of available pebbles, and T the time
23863 necessary for pebbling the graph. (a) A time--space
23864 tradeoff of the form\par
23865
23866 $$ S T = \Theta (N^2) $$ \par
23867
23868 Is proved for pebbling (using only black pebbles) a
23869 special class of permutation graphs that implement the
23870 bit reversal permutation. If we are allowed to use
23871 black and white pebbles the time--space tradeoff is
23872 shown to be of the form\par
23873
23874 $$ T = \Theta (N^2 / S^2) + \Theta (N) $$ \par
23875
23876 (b) A time-apace tradeoff of the form\par
23877
23878 $$ T = S \Theta (N / S)^{\Theta (N / S)} $$ \par
23879
23880 is proved for pebbling a class of graphs constructed by
23881 stacking superconcentrators in series. This time--space
23882 tradeoff holds whether we use only black or black and
23883 white pebbles.\par
23884
23885 (c) A time--space tradeoff of the form\par
23886
23887 $$ T = S 2^{2^{\Theta (N / S)}} $$ \par
23888
23889 is proved for pebbling general directed acyclic graphs
23890 with only black or black and white pebbles.",
23891 acknowledgement = ack-nhfb,
23892 pdfpages = "86",
23893 remark = "This is the author's thesis. No PDF in NTRL archive.
23894 Found in DTIC archive.",
23895 }
23896
23897 @TechReport{Borning:1979:TCO,
23898 author = "Alan Borning",
23899 title = "{ThingLab} ---- a Constraint- Oriented Simulation
23900 Laboratory",
23901 type = "Technical Report",
23902 number = "STAN-CS-79-746",
23903 institution = inst-STAN-CS,
23904 address = inst-STAN-CS:adr,
23905 pages = "109",
23906 month = jul,
23907 year = "1979",
23908 bibdate = "Tue Nov 25 08:51:44 2025",
23909 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
23910 URL = "",
23911 acknowledgement = ack-nhfb,
23912 remark = "This is the author's thesis.",
23913 }
23914
23915 @TechReport{Wilkins:1979:UPP,
23916 author = "David E. Wilkins",
23917 title = "Using Patterns and Plans to Solve Problems and Control
23918 Search",
23919 type = "Technical Report",
23920 number = "STAN-CS-79-747 (AIM-329, AD-A076872)",
23921 institution = inst-STAN-CS,
23922 address = inst-STAN-CS:adr,
23923 pages = "264",
23924 month = jun,
23925 year = "1979",
23926 bibdate = "Tue Nov 25 08:51:44 2025",
23927 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
23928 URL = "",
23929 acknowledgement = ack-nhfb,
23930 remark = "This is the author's thesis.",
23931 }
23932
23933 @TechReport{Yun:1979:FAS,
23934 author = "David Y. Y. Yun",
23935 title = "Fast algorithms for solving {Toeplitz} systems of
23936 equations and finding rational {Hermite} interpolants",
23937 type = "Technical Report",
23938 number = "STAN-CS-79-748 (AD-A075376)",
23939 institution = inst-STAN-CS,
23940 address = inst-STAN-CS:adr,
23941 pages = "??",
23942 month = jul,
23943 year = "1979",
23944 bibdate = "Fri Nov 7 07:00:05 MST 2025",
23945 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
23946 URL = "http://i.stanford.edu/TR/CS-TR-79-748.html",
23947 abstract = "We present a new algorithm that reduces the
23948 computation for solving a Toeplitz system to O(n $
23949 {log}^2 $ n) and automatically resolves all degenerate
23950 cases of the past. Our fundamental results show that
23951 all rational Hermite interpolants, including Pade
23952 approximants which is intimately related to this
23953 solution process, can be computed fast by an Euclidean
23954 algorithm. In this report we bring out all these
23955 relationships with mathematical justifications and
23956 mention important applications including decoding BCH
23957 codes.",
23958 acknowledgement = ack-nhfb,
23959 pdfpages = "10",
23960 xxnumber = "CS-TR-79-748",
23961 }
23962
23963 @TechReport{Clancey:1979:AOA,
23964 author = "William J. Clancey and James S. Bennett and Paul R.
23965 Cohen",
23966 title = "Applications-Oriented {AI} Research: Education",
23967 type = "Technical Report",
23968 number = "STAN-CS-79-749 (HPP-79-17, AD-A075517)",
23969 institution = inst-STAN-CS,
23970 address = inst-STAN-CS:adr,
23971 pages = "ix + 56",
23972 month = jul,
23973 year = "1979",
23974 bibdate = "Tue Nov 25 08:51:44 2025",
23975 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
23976 note = "A section of the \booktitle{Handbook of Artificial
23977 Intelligence} edited by Avron Barr and Edward A.
23978 Feigenbaum.",
23979 URL = "https://apps.dtic.mil/sti/pdfs/ADA075517.pdf",
23980 acknowledgement = ack-nhfb,
23981 pdfpages = "65",
23982 remark = "No PDF in NTRL archive. Found in DTIC archive. No
23983 abstract, but ADA075517 PDF file uses Foreword
23984 instead.",
23985 }
23986
23987 @TechReport{Gacs:1979:KAL,
23988 author = "Peter G{\'a}cs and Laszlo Lov{\'a}sz",
23989 title = "{Khachian}'s Algorithm for Linear Programming",
23990 type = "Technical Report",
23991 number = "STAN-CS-79-750 (AD-A075171)",
23992 institution = inst-STAN-CS,
23993 address = inst-STAN-CS:adr,
23994 pages = "iv + 12",
23995 month = jul,
23996 year = "1979",
23997 bibdate = "Tue Nov 25 08:51:44 2025",
23998 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
23999 URL = "",
24000 abstract = "L. G. Khachian's algorithm to check the solvability of
24001 a system of linear inequalities with integral
24002 coefficients is described. The running time of the
24003 algorithm is polynomial in the number of digits of the
24004 coefficients. It can be applied to solve linear
24005 programs in polynomial time",
24006 acknowledgement = ack-nhfb,
24007 pdfpages = "16",
24008 }
24009
24010 @TechReport{Manna:1979:MLP,
24011 author = "Zohar Manna and Amir Pnueli",
24012 title = "The Modal Logic of Programs",
24013 type = "Technical Report",
24014 number = "STAN-CS-79-751 (AIM-330, AD-A155071)",
24015 institution = inst-STAN-CS,
24016 address = inst-STAN-CS:adr,
24017 pages = "ii + 35",
24018 month = sep,
24019 year = "1979",
24020 bibdate = "Tue Nov 25 08:51:44 2025",
24021 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
24022 URL = "",
24023 abstract = "We explore the general framework of Modal Logic and
24024 its applicability to program reasoning. We relate the
24025 basic concepts of Modal Logic to the programming
24026 environment: the concept of ``world'' corresponds to a
24027 program state, and the concept of ``accessibility
24028 relation'' corresponds to the relation of derivability
24029 between states during execution. Thus we adopt the
24030 Temporal interpretation of Modal Logic. The variety of
24031 program properties expressible within the modal
24032 formalism is demonstrated.\par
24033
24034 The first axiomatic system studied, the sometime
24035 system, is adequate for proving total correctness and
24036 `eventuality' properties. However, it is inadequate for
24037 proving invariance properties. The stronger {\em
24038 nexttime system\/} obtained by adding the {\em next}
24039 operator is shown to be adequate for invariances as
24040 well.",
24041 acknowledgement = ack-nhfb,
24042 pdfpages = "37",
24043 }
24044
24045 @TechReport{Overton:1979:PLA,
24046 author = "Michael Lockhart Overton",
24047 title = "Projected {Lagrangian} Algorithms for Nonlinear
24048 Minimax and $ l_1 $ Optimization",
24049 type = "Technical Report",
24050 number = "STAN-CS-79-752",
24051 institution = inst-STAN-CS,
24052 address = inst-STAN-CS:adr,
24053 pages = "164",
24054 month = jul,
24055 year = "1979",
24056 bibdate = "Tue Nov 25 08:51:44 2025",
24057 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
24058 URL = "",
24059 acknowledgement = ack-nhfb,
24060 remark = "This is the author's thesis.",
24061 }
24062
24063 @TechReport{Yao:1979:STS,
24064 author = "Andrew Chi-Chih Yao",
24065 title = "Should tables by sorted?",
24066 type = "Technical Report",
24067 number = "STAN-CS-79-753",
24068 institution = inst-STAN-CS,
24069 address = inst-STAN-CS:adr,
24070 pages = "??",
24071 month = jul,
24072 year = "1979",
24073 bibdate = "Fri Nov 7 07:00:05 MST 2025",
24074 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
24075 URL = "http://i.stanford.edu/TR/CS-TR-79-753.html",
24076 abstract = "We examine optimality questions in the following
24077 information retrieval problem: Given a set S of n keys,
24078 store them so that queries of the form `Is x $ \in $
24079 S?' can be answered quickly. It is shown that, in a
24080 rather general model including al1 the commonly-used
24081 schemes, $ \lceil $ lg(n+l) $ \rceil $ probes to the
24082 table are needed in the worst case, provided the key
24083 space is sufficiently large. The effects of smaller key
24084 space and arbitrary encoding are also explored.",
24085 acknowledgement = ack-nhfb,
24086 pdfpages = "38",
24087 xxnumber = "CS-TR-79-753",
24088 }
24089
24090 @TechReport{Gardner:1979:NLU,
24091 author = "Anne Gardner and James Davidson and Terry A.
24092 Winograd",
24093 title = "Natural Language Understanding",
24094 type = "Technical Report",
24095 number = "STAN-CS-79-754 (HPP-79-21, AD-A076873)",
24096 institution = inst-STAN-CS,
24097 address = inst-STAN-CS:adr,
24098 pages = "xii + 93",
24099 month = jul,
24100 year = "1979",
24101 bibdate = "Tue Nov 25 08:51:44 2025",
24102 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
24103 URL = "",
24104 acknowledgement = ack-nhfb,
24105 pdfpages = "106",
24106 remark = "No abstract is available.",
24107 remark = "A section of the \booktitle{Handbook of Artificial
24108 Intelligence}, edited by Avron Barr and Edward A,
24109 Feigenbaum.",
24110 }
24111
24112 @TechReport{Kant:1979:ECP,
24113 author = "Elaine Kant",
24114 title = "Efficiency Considerations in Program Synthesis: a
24115 Knowledge-Based Approach",
24116 type = "Technical Report",
24117 number = "STAN-CS-79-755 (AIM-331)",
24118 institution = inst-STAN-CS,
24119 address = inst-STAN-CS:adr,
24120 pages = "160",
24121 month = jul,
24122 year = "1979",
24123 bibdate = "Tue Nov 25 08:51:44 2025",
24124 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
24125 URL = "",
24126 acknowledgement = ack-nhfb,
24127 remark = "This is the author's thesis.",
24128 }
24129
24130 @TechReport{Bennett:1979:AOA,
24131 author = "James S. Bennett and Bruce G. Buchanan and Paul R.
24132 Cohen and Fritz Fisher",
24133 title = "Applications-Oriented {AI} Research: Science and
24134 Mathematics",
24135 type = "Technical Report",
24136 number = "STAN-CS-79-756 (HPP-79-22, AD-A076875)",
24137 institution = inst-STAN-CS,
24138 address = inst-STAN-CS:adr,
24139 pages = "ix + 100",
24140 month = aug,
24141 year = "1979",
24142 bibdate = "Tue Nov 25 08:51:44 2025",
24143 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
24144 note = "A section of the \booktitle{Handbook of Artificial
24145 Intelligence} edited by Avron Barr and Edward A.
24146 Feigenbaum.",
24147 URL = "",
24148 acknowledgement = ack-nhfb,
24149 pdfpages = "111",
24150 remark = "No abstract is available.",
24151 }
24152
24153 @TechReport{Clesielski:1979:AOA,
24154 author = "Victor B. Clesielski and James S. Bennett and Paul R.
24155 Cohen",
24156 title = "Applications-Oriented {AI} Research: Medicine",
24157 type = "Technical Report",
24158 number = "STAN-CS-79-757 (HPP-79-23, AD-A075402)",
24159 institution = inst-STAN-CS,
24160 address = inst-STAN-CS:adr,
24161 pages = "ix + 53",
24162 month = jul,
24163 year = "1979",
24164 DOI = "https://doi.org/10.1016/B978-0-86576-090-5.50008-2",
24165 bibdate = "Thu Nov 27 18:27:18 2025",
24166 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
24167 URL = "https://apps.dtic.mil/sti/tr/pdf/ADA075402.pdf",
24168 acknowledgement = ack-nhfb,
24169 pdfpages = "62",
24170 remark = "Published as a section of the \booktitle{Handbook of
24171 Artificial Intelligence}, edited by Avron Barr and
24172 Edward A. Feigenbaum, pp. 175--222, 1982.",
24173 }
24174
24175 @TechReport{Elschlager:1979:AP,
24176 author = "Robert Elschlager and Jorge Phillips",
24177 title = "Automatic Programming",
24178 type = "Technical Report",
24179 number = "STAN-CS-79-758 (HPP-79-24, AD-A076874)",
24180 institution = inst-STAN-CS,
24181 address = inst-STAN-CS:adr,
24182 pages = "v + 89",
24183 month = jul,
24184 year = "1979",
24185 bibdate = "Tue Nov 25 08:51:44 2025",
24186 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
24187 URL = "https://apps.dtic.mil/sti/tr/pdf/ADA076874.pdf",
24188 acknowledgement = ack-nhfb,
24189 pdfpages = "98",
24190 pdfpages = "102",
24191 remark = "Published as a section of the \booktitle{Handbook of
24192 Artificial Intelligence}, edited by Avron Barr and
24193 Edward A. Feigenbaum. No abstract. No PDF in NTRL
24194 archive, but found in DTIC archive. The PDF file is
24195 OCR'ed scans of microfiche page images.",
24196 }
24197
24198 @TechReport{Bonnet:1979:SSS,
24199 author = "Alain Bonnet",
24200 title = "Schema-Shift Strategies for Understanding Structured
24201 Texts in Natural Language",
24202 type = "Technical Report",
24203 number = "STAN-CS-79-759 (HPP-79-25)",
24204 institution = inst-STAN-CS,
24205 address = inst-STAN-CS:adr,
24206 pages = "vi + ii + 40",
24207 month = aug,
24208 year = "1979",
24209 bibdate = "Fri Nov 7 07:00:05 MST 2025",
24210 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
24211 URL = "http://i.stanford.edu/TR/CS-TR-79-759.html",
24212 abstract = "This report presents BAOBAB-2, a computer program
24213 built upon MYCIN [Shortliffe, 1974] that is used for
24214 understanding medical summaries describing the status
24215 of patients. Due both to the conventional way
24216 physicians present medical problems in these summaries
24217 and the constrained nature of medical jargon, these
24218 texts have a very strong structure. BAOBAB-2 takes
24219 advantage of this structure by using a model of this
24220 organization as a set of related schemas that
24221 facilitate the interpretation of these texts.
24222 Structures of the schemas and their relation to the
24223 surface structure are described. Issues relating to
24224 selection and use of these schemas by the program
24225 during interpretation of the summaries are discussed.",
24226 acknowledgement = ack-nhfb,
24227 pdfpages = "48",
24228 xxnumber = "CS-TR-79-759",
24229 }
24230
24231 @TechReport{Graham:1979:SMP,
24232 author = "Ronald L. Graham and Andrew C. Yao and F. Frances
24233 Yao",
24234 title = "Some monotonicity properties of partial orders",
24235 type = "Technical Report",
24236 number = "STAN-CS-79-760",
24237 institution = inst-STAN-CS,
24238 address = inst-STAN-CS:adr,
24239 pages = "??",
24240 month = sep,
24241 year = "1979",
24242 bibdate = "Fri Nov 7 07:00:05 MST 2025",
24243 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
24244 URL = "http://i.stanford.edu/TR/CS-TR-79-760.html",
24245 abstract = "A fundamental quantity which arises in the sorting of
24246 $n$ numbers $ a_1, a_2, \ldots {}, a_n $ is $ {\rm
24247 Pr}(a_i < a_j | P) $, the probability that $ a_i < a_j
24248 $ assuming that all linear extensions of the partial
24249 order $P$ are equally likely. In this paper we
24250 establish various properties of $ {\rm Pr}(a_i < a_j |
24251 P)$ and related quantities. In particular, it is shown
24252 that $ {\rm Pr}(a_i < b_j | P') \geq {\rm Pr}(a_i < b_j
24253 | P)$, if the partial order $P$ consists of two
24254 disjoint linearly ordered sets $ A = \{ a_1 < a_2 <
24255 \cdots {} < a_m \} $, $ B = \{ b_1 < b_2 < \ldots {} <
24256 b_n \} $ and $ P' = P \cup \{ {\rm any relations of the
24257 form} a_k < b_l \} $. These inequalities have
24258 applications in determining the complexity of certain
24259 sorting --- like computations.",
24260 acknowledgement = ack-nhfb,
24261 author-dates = "Ronald Lewis Graham (31 October 1935--6 July 2020)",
24262 pdfpages = "24",
24263 xxnumber = "CS-TR-79-760",
24264 }
24265
24266 @TechReport{West:1979:GDT,
24267 author = "Douglas B. West",
24268 title = "Gossiping without duplicate transmissions",
24269 type = "Technical Report",
24270 number = "STAN-CS-79-761 (AD-A084021)",
24271 institution = inst-STAN-CS,
24272 address = inst-STAN-CS:adr,
24273 pages = "??",
24274 month = aug,
24275 year = "1979",
24276 bibdate = "Fri Nov 7 07:00:05 MST 2025",
24277 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
24278 URL = "http://i.stanford.edu/TR/CS-TR-79-761.html",
24279 abstract = "n people have distinct bits of information, which they
24280 communicate via telephone calls in which they transmit
24281 everything they know. We require that no one ever hear
24282 the same piece of information twice. In the case 4
24283 divides n, n $ \geq $ 8, we provide a construction that
24284 transmits all information using only 9n/4-6 calls.
24285 Previous constructions used 1/2 $ n \log n $ calls.",
24286 acknowledgement = ack-nhfb,
24287 pdfpages = "6",
24288 xxnumber = "CS-TR-79-761",
24289 }
24290
24291 @TechReport{Knuth:1979:MSA,
24292 author = "Donald E. Knuth",
24293 title = "{METAFONT}: a system for alphabet design",
24294 type = "Technical Report",
24295 number = "STAN-CS-79-762 (AIM-332, AD-A083229)",
24296 institution = inst-STAN-CS,
24297 address = inst-STAN-CS:adr,
24298 pages = "??",
24299 month = sep,
24300 year = "1979",
24301 bibdate = "Fri Nov 7 07:00:05 MST 2025",
24302 bibsource = "https://www.math.utah.edu/pub/tex/bib/font.bib;
24303 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib;
24304 https://www.math.utah.edu/pub/tex/bib/texbook3.bib",
24305 URL = "http://i.stanford.edu/TR/CS-TR-79-762.html",
24306 abstract = "This is the user's manual for METAFONT, a companion to
24307 the \TeX{} typesetting system. The system makes it
24308 fairly easy to define high quality fonts of type in a
24309 machine-independent manner; a user writes `programs' in
24310 a new language developed for this purpose. By varying
24311 parameters of a design, an unlimited number of
24312 typefaces can be obtained from a single set of
24313 programs. The manual also sketches the algorithms used
24314 by the system to draw the character shapes.",
24315 acknowledgement = ack-nhfb,
24316 pdfpages = "58",
24317 xxnumber = "CS-TR-79-762",
24318 }
24319
24320 @TechReport{West:1979:SCD,
24321 author = "Douglas B. West",
24322 title = "A symmetric chain decomposition of {$ L(4, n) $}",
24323 type = "Technical Report",
24324 number = "STAN-CS-79-763 (AD-A076876)",
24325 institution = inst-STAN-CS,
24326 address = inst-STAN-CS:adr,
24327 pages = "??",
24328 month = aug,
24329 year = "1979",
24330 bibdate = "Fri Nov 7 07:00:05 MST 2025",
24331 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
24332 URL = "http://i.stanford.edu/TR/CS-TR-79-763.html",
24333 abstract = "L(m,n) is the set of integer m-tuples ($ a_1 $,
24334 \ldots{}, $ a_m$) with $ 0 \leq a_1 \leq \ldots {} \leq
24335 a_m \leq n$, ordered by $ \underline {a} \leq
24336 \underline {b}$ when $ a_i \leq b_i$ for all i. R.
24337 Stanley conjectured that L(m,n) is a symmetric chain
24338 order for all (m,n). We verify this by construction for
24339 m = 4.",
24340 acknowledgement = ack-nhfb,
24341 pdfpages = "16",
24342 xxnumber = "CS-TR-79-763",
24343 }
24344
24345 @TechReport{Yao:1979:TST,
24346 author = "Andrew Chi-Chih Yao",
24347 title = "On the time-space tradeoff for sorting with linear
24348 queries",
24349 type = "Technical Report",
24350 number = "STAN-CS-79-764",
24351 institution = inst-STAN-CS,
24352 address = inst-STAN-CS:adr,
24353 pages = "??",
24354 month = aug,
24355 year = "1979",
24356 bibdate = "Fri Nov 7 07:00:05 MST 2025",
24357 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
24358 URL = "http://i.stanford.edu/TR/CS-TR-79-764.html",
24359 abstract = "Extending a result of Borodin, et al., we show that
24360 any branching program using linear queries ` $ \sum_i
24361 {\lambda }_i {x_i} : c $ ` to sort n numbers $ x_1 $,$
24362 x_2 $, \ldots{}, $ x_n $ must satisfy the time-space
24363 tradeoff relation TS = $ \Omega (n_2) $. The same
24364 relation is also shown to be true for branching
24365 programs that use queries ` min R = ? ` where R is any
24366 subset of {$ x_1 $,$ x_2 $, \ldots{}, $ x_n $}.",
24367 acknowledgement = ack-nhfb,
24368 pdfpages = "36",
24369 xxnumber = "CS-TR-79-764",
24370 }
24371
24372 @TechReport{Gacs:1979:RBC,
24373 author = "Peter G{\'a}cs",
24374 title = "Relation between the complexity and the probability of
24375 large numbers",
24376 type = "Technical Report",
24377 number = "STAN-CS-79-765 (AD-A083192)",
24378 institution = inst-STAN-CS,
24379 address = inst-STAN-CS:adr,
24380 pages = "??",
24381 month = sep,
24382 year = "1979",
24383 bibdate = "Fri Nov 7 07:00:05 MST 2025",
24384 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
24385 URL = "http://i.stanford.edu/TR/CS-TR-79-765.html",
24386 abstract = "$ H(x) $, the negative logarithm of the apriori
24387 probability $ M(x) $, is Levin's variant of
24388 Kolmogorov's complexity of a natural number $x$. Let $
24389 \alpha (n)$ be the minimum complexity of a number
24390 larger than $n$, $ s(n)$ the logarithm of the apriori
24391 probability of obtaining a number larger than $n$. It
24392 was known that $ s(n) \leq \alpha (n) \leq s(n) +
24393 H(\lceil s(n) \rceil)$. We show that the second
24394 estimate is in some sense sharp.",
24395 acknowledgement = ack-nhfb,
24396 pdfpages = "9",
24397 xxnumber = "CS-TR-79-765",
24398 }
24399
24400 @TechReport{Kautsky:1979:EMC,
24401 author = "J. Kautsky and N. K. Nichols",
24402 title = "Equidistributing Meshes with Constraints",
24403 type = "Technical Report",
24404 number = "STAN-CS-79-766 (SU326, P30-69)",
24405 institution = inst-STAN-CS,
24406 address = inst-STAN-CS:adr,
24407 pages = "27",
24408 month = sep,
24409 year = "1979",
24410 bibdate = "Tue Nov 25 08:51:44 2025",
24411 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
24412 URL = "",
24413 acknowledgement = ack-nhfb,
24414 remark = "No PDF in NTRL archive.",
24415 }
24416
24417 @TechReport{VanLoan:1979:SSV,
24418 author = "Charles {Van Loan}",
24419 title = "On {Stewart}'s singular value decomposition for
24420 partitioned orthogonal matrices",
24421 type = "Technical Report",
24422 number = "STAN-CS-79-767",
24423 institution = inst-STAN-CS,
24424 address = inst-STAN-CS:adr,
24425 pages = "??",
24426 month = sep,
24427 year = "1979",
24428 bibdate = "Fri Nov 7 07:00:05 MST 2025",
24429 bibsource = "https://www.math.utah.edu/pub/bibnet/authors/s/stewart-gilbert-w.bib;
24430 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
24431 URL = "http://i.stanford.edu/TR/CS-TR-79-767.html",
24432 abstract = "A variant of the singular value decomposition for
24433 orthogonal matrices due to G. W. Stewart is discussed.
24434 It is shown to be useful in the analysis of (a) the
24435 total least squares problem, (b) the
24436 Golub--Klema--Stewart subset selection algorithm, and
24437 (c) the algebraic Riccati equation.",
24438 acknowledgement = ack-nhfb,
24439 pdfpages = "19",
24440 xxnumber = "CS-TR-79-767",
24441 }
24442
24443 @TechReport{Clancey:1979:TRB,
24444 author = "William John Clancey",
24445 title = "Transfer of Rule-Based Expertise Through a Tutorial
24446 Dialogue",
24447 type = "Technical Report",
24448 number = "STAN-CS-79-769 (AD-A083432)",
24449 institution = inst-STAN-CS,
24450 address = inst-STAN-CS:adr,
24451 pages = "xi + 450 + xiii",
24452 month = sep,
24453 year = "1979",
24454 DOI = "https://doi.org/10.5555/908721",
24455 bibdate = "Thu Nov 27 18:35:50 2025",
24456 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
24457 URL = "https://apps.dtic.mil/sti/citations/ADA083432;
24458 https://apps.dtic.mil/sti/tr/pdf/ADA083432.pdf;
24459 https://dl.acm.org/doi/10.5555/908721;
24460 https://www.semanticscholar.org/paper/Transfer-of-rule-based-expertise-through-a-tutorial-Clancey/754d8ce1fb8511a780a72b120bfad7b7d73a583e",
24461 abstract = "This dissertation describes an intelligent,
24462 computer-aided instructional (ICAI) program, named
24463 GUIDON, with capabilities to carry on a structured case
24464 method dialogue, generate teaching material from
24465 production rules, construct and verify a model of what
24466 the student knows, and explain expert reasoning.
24467 objective of this research has been to convert MYCiN, a
24468 knowledge-based consultation program, into an effective
24469 instructional tool. GUIDON combines the subject matter
24470 knowledge of the consultation system with tutorial
24471 discourse knowledge, while keeping the two
24472 distinct.\par
24473
24474 MYCIN-like knowledge-based consultation programs are
24475 designed to provide expert-level advice about difficult
24476 scientific and medical problems. High performance is
24477 attained by interpreting a large, specialized set of
24478 facts and domain relations that take the form of rules
24479 about what do to in a given circumstance. Such a rule
24480 base is generally built by interviewing human experts
24481 to formulate the knowledge that they use to solve
24482 similar problems In their area of expertise. While it
24483 is generally believed that these programs have
24484 significant educational potential, little work has been
24485 done to evaluate the problems of realizing this
24486 potential.\par
24487
24488 Using a rule base for teaching provides a new
24489 perspective for showing what production rules have to
24490 do with human expertise. This dissertation closely
24491 examines the usefulness and adequacy of MYCIN's rules
24492 for infectious disease diagnosis as an instructional
24493 vehicle: as topics to be discussed in a tutorial, as
24494 problem-solving methods for understanding a student's
24495 behavior, and as skills to be learned by a student. It
24496 is argued that MYCIN-like rule-based systems constitute
24497 a good starting point for developing a tutorial
24498 program, but they are not sufficient in themselves for
24499 making knowledge accessible to a student. Using GUIDON
24500 as an Interactive medium for transferring expertise
24501 provides a larger context about human cognition; this
24502 Is reflected in our consideration of subject matter
24503 representation and principles of tutorial
24504 discourse.\par
24505
24506 The study of subject matter representation focuses on
24507 knowledge that allows the tutor to articulate the
24508 structure, underlying principles, and strategies of the
24509 domain. This dissertation pays particular attention to
24510 aspects of human expertise that have not been captured
24511 by the MYCIN rule base, a kind of Investigation that
24512 has not arisen in the construction, maintenance, and
24513 use of this knowledge base for consultation.\par
24514
24515 The study of tutorial discourse principles focuses on
24516 managing the dialogue to achieve economical, systematic
24517 presentation of problem-solving expertise. In
24518 addition,. tutoring methods for opportunistically
24519 presenting new material and providing hints on the
24520 basis of an hypothesis revision strategy are
24521 demonstrated. GUIDON's teaching and discourse expertise
24522 is represented as explicit rules. These rules comprise
24523 strategies for modeling the student, means for sharing
24524 Initiative, and knowledge of conventional procedures
24525 for discussing a problem in a ``goal-directed''
24526 way.\par
24527
24528 After the basic set of tutorial expertise was developed
24529 using MYCIN's Infectious disease rule set, some
24530 perspective on GUIDON's generality and domain
24531 independence was attained by coupling it to rule sets
24532 for other domains, including an engineering
24533 application. Two experiments of this type were
24534 performed. They reveal the relationship of discourse
24535 strategies to the reasoning structure of the problem
24536 being discussed.",
24537 acknowledgement = ack-nhfb,
24538 pdfpages = "474",
24539 remark = "This is the author's Ph.D. thesis.",
24540 }
24541
24542 @TechReport{Oppen:1979:PP,
24543 author = "Derek C. Oppen",
24544 title = "Pretty printing",
24545 type = "Technical Report",
24546 number = "STAN-CS-79-770 (PVG-13)",
24547 institution = inst-STAN-CS,
24548 address = inst-STAN-CS:adr,
24549 pages = "??",
24550 month = oct,
24551 year = "1979",
24552 bibdate = "Fri Nov 7 07:00:05 MST 2025",
24553 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
24554 URL = "http://i.stanford.edu/TR/CS-TR-79-770.html",
24555 abstract = "An algorithm for pretty printing is given. For an
24556 input stream of length $n$ and an output device with
24557 margin width $m$, the algorithm requires time $ O(n)$
24558 and space $ O(m)$. The algorithrn is described in terms
24559 of two parallel processes; the first scans the input
24560 stream to determine the space required to print logical
24561 blocks of tokens; the second uses this information to
24562 decide where to break lines of text; the two processes
24563 communicate by means of a buffer of size $ O(m)$. The
24564 algorithm does not wait for the entire stream to be
24565 input, but begins printing as soon as it has received a
24566 linefull of input. The algorithm is easily
24567 implemented.",
24568 acknowledgement = ack-nhfb,
24569 pdfpages = "26",
24570 xxnumber = "CS-TR-79-770",
24571 }
24572
24573 @TechReport{Friedland:1979:KBE,
24574 author = "Peter E. Friedland",
24575 title = "Knowledge-Based Experiment Design in Molecular
24576 Genetics",
24577 type = "Technical Report",
24578 number = "STAN-CS-79-771 (HPP-79-29)",
24579 institution = inst-STAN-CS,
24580 address = inst-STAN-CS:adr,
24581 pages = "137",
24582 month = aug,
24583 year = "1979",
24584 bibdate = "Tue Nov 25 08:51:44 2025",
24585 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
24586 URL = "",
24587 acknowledgement = ack-nhfb,
24588 remark = "This is the author's thesis.",
24589 }
24590
24591 @TechReport{McCune:1979:BPM,
24592 author = "Brian P. McCune",
24593 title = "Building Program Models Incrementally from Informal
24594 Descriptions",
24595 type = "Technical Report",
24596 number = "STAN-CS-79-772 (AIM-333, AD-A086504)",
24597 institution = inst-STAN-CS,
24598 address = inst-STAN-CS:adr,
24599 pages = "vii + 140",
24600 month = oct,
24601 year = "1979",
24602 bibdate = "Tue Nov 25 08:51:44 2025",
24603 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
24604 URL = "https://apps.dtic.mil/sti/tr/pdf/ADA086504.pdf",
24605 abstract = "Program acquisition is the transformation of a program
24606 specification into an executable, but not necessarily
24607 efficient, program that meets the given specification.
24608 This thesis presents a solution to one aspect of the
24609 program acquisition problem: the incremental
24610 construction of program models from informal
24611 descriptions. The key to the solution is a framework
24612 for incremental program acquisition that includes (1) a
24613 formal language for expressing program fragments that
24614 contain informalities, (2) a control structure for the
24615 incremental recognition and assimilation of such
24616 fragments, and (3) a knowledge base of rules for
24617 acquiring programs specified with
24618 informalities.\par
24619
24620 The thesis describes a LISP based computer system
24621 called the Program Model Builder (abbreviated ``PMB''),
24622 which receives informal program fragments incrementally
24623 and assembles them into a very high level program model
24624 that is complete, semantically consistent, unambiguous,
24625 and executable. The program specification comes in the
24626 form of partial program fragments that arrive in any
24627 order and may exhibit such informalities as
24628 inconsistencies and ambiguous references. Possible
24629 sources of fragments are a natural language parser or a
24630 parser for a surface form of the fragments. PMB
24631 produces a program model that is a complete and
24632 executable computer program. The program fragment
24633 language used for specifications is a superset of the
24634 language in which program models are built. This
24635 program modelling language is a very high level
24636 programming language for symbolic processing that deals
24637 with such information structures as sets and
24638 mappings.\par
24639
24640 The recognition paradigm used by PMB is a form of
24641 subgoaling that allows the parts of the program to be
24642 specified in an order chosen by the user, rather than
24643 dictated by the system. Knowledge is represented as a
24644 set of data driven antecedent rules of two types,
24645 response rules and demons, which are triggered
24646 respectively by either the input of new fragments or
24647 changes in the partial program model. In processing a
24648 fragment, a response rule may update the partial
24649 program model and create new subgoals with associated
24650 response rules. To process subgoals that are completely
24651 internal to PMB (e.g., model consistency checks), demon
24652 rules are created that delay execution until their
24653 prerequisite information in the program model has been
24654 filled in by response rules or perhaps other
24655 demons.\par
24656
24657 PMB has been tested both as a module of the PSI program
24658 synthesis system and independently. Models built as
24659 part of PSI have been acquired via natural language
24660 dialogs and execution traces and have been
24661 automatically coded into LISP by other PSI modules. PMB
24662 has successfully built a number of moderately complex
24663 programs for symbolic computation.",
24664 acknowledgement = ack-nhfb,
24665 pdfpages = "146",
24666 remark = "This is the author's Ph.D. thesis. The PDF file is
24667 OCR'ed scans of microfiche page images.",
24668 }
24669
24670 @TechReport{Chan:1979:UFP,
24671 author = "Tony F. Chan and Gene H. Golub and Randall J.
24672 LeVeque",
24673 title = "Updating formulae and a pairwise algorithm for
24674 computing sample variances",
24675 type = "Technical Report",
24676 number = "STAN-CS-79-773 (AD-A083170)",
24677 institution = inst-STAN-CS,
24678 address = inst-STAN-CS:adr,
24679 pages = "19",
24680 month = nov,
24681 year = "1979",
24682 bibdate = "Fri Nov 7 07:00:05 MST 2025",
24683 bibsource = "https://www.math.utah.edu/pub/bibnet/authors/g/golub-gene-h.bib;
24684 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
24685 URL = "http://i.stanford.edu/TR/CS-TR-79-773.html",
24686 abstract = "A general formula is presented for computing the
24687 simple variance for a sample of size m + n given the
24688 means and variances for two subsamples of sizes m and
24689 n. This formula is used in the construction of a
24690 pairwise algorithm for computing the variance. Other
24691 applications are discussed as well, including the use
24692 of updating formulae in a parallel computing
24693 environment. We present numerical results and rounding
24694 error analyses for several numerical schemes.",
24695 acknowledgement = ack-nhfb,
24696 author-dates = "Gene Howard Golub (February 29, 1932--November 16,
24697 2007)",
24698 pdfpages = "22",
24699 xxnumber = "CS-TR-79-773",
24700 }
24701
24702 @TechReport{Golub:1979:LSG,
24703 author = "Gene H. Golub and Robert J. Plemmons",
24704 title = "Large scale geodetic least squares adjustment by
24705 dissection and orthogonal decomposition",
24706 type = "Technical Report",
24707 number = "STAN-CS-79-774 (AD-A083193)",
24708 institution = inst-STAN-CS,
24709 address = inst-STAN-CS:adr,
24710 pages = "33",
24711 month = nov,
24712 year = "1979",
24713 bibdate = "Fri Nov 7 07:00:05 MST 2025",
24714 bibsource = "https://www.math.utah.edu/pub/bibnet/authors/g/golub-gene-h.bib;
24715 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
24716 URL = "http://i.stanford.edu/TR/CS-TR-79-774.html",
24717 abstract = "Very large scale matrix problems currently arise in
24718 the context of accurately computing the coordinates of
24719 points on the surface of the earth. Here geodesists
24720 adjust the approximate values of these coordinates by
24721 computing least squares solutions to large sparse
24722 systems of equations which result from relating the
24723 coordinates to certain observations such as distances
24724 or angles between points. The purpose of this paper is
24725 to suggest an alternative to the formation and solution
24726 of the normal equations for these least squares
24727 adjustment problems. In particular, it is shown how a
24728 block-orthogonal decomposition method can be used in
24729 conjunction with a nested dissection scheme to produce
24730 an algorithm for solving such problems which combines
24731 efficient data management with numerical stability. As
24732 an indication of the magnitude that these least squares
24733 adjustment problems can sometimes attain, the
24734 forthcoming readjustment of the North American Datum in
24735 1983 by the National Geodetic Survey is discussed. Here
24736 it becomes necessary to linearize and solve an
24737 overdetermined system of approximately 6,000,000
24738 equations in 400,000 unknowns - a truly large-scale
24739 matrix problem.",
24740 acknowledgement = ack-nhfb,
24741 author-dates = "Gene Howard Golub (February 29, 1932--November 16,
24742 2007)",
24743 pdfpages = "40",
24744 xxnumber = "CS-TR-79-774 (AD-A083 193)",
24745 }
24746
24747 @TechReport{Diaconis:1979:ASE,
24748 author = "Persi Diaconis and Ronald L. Graham",
24749 title = "The analysis of sequential experiments with feedback
24750 to subjects",
24751 type = "Technical Report",
24752 number = "STAN-CS-79-775 (AD-A083288)",
24753 institution = inst-STAN-CS,
24754 address = inst-STAN-CS:adr,
24755 pages = "??",
24756 month = nov,
24757 year = "1979",
24758 bibdate = "Fri Nov 7 07:00:05 MST 2025",
24759 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
24760 URL = "http://i.stanford.edu/TR/CS-TR-79-775.html",
24761 abstract = "A problem arising in taste testing, medical, and
24762 parapsychology experiments can be modeled as follows. A
24763 deck of n cards contains $ c_i $ cards labeled i, $ 1
24764 \leq i \leq r $. A subject guesses at the cards
24765 sequentially. After each guess the subject is told the
24766 card just guessed (or at least if the guess was correct
24767 or not). We determine the optimal and worst case
24768 strategies for subjects and the distribution of the
24769 number of correct guesses under these strategies. We
24770 show how to use skill scoring to evaluate such
24771 experiments in a way which (asymptotically) does not
24772 depend on the subject's strategy.",
24773 acknowledgement = ack-nhfb,
24774 author-dates = "Ronald Lewis Graham (31 October 1935--6 July 2020)",
24775 pdfpages = "52",
24776 xxnumber = "CS-TR-79-775",
24777 }
24778
24779 @TechReport{Aspvall:1979:KLP,
24780 author = "Bengt Aspvall and Richard E. Stone",
24781 title = "{Khachiyan}'s Linear Programming Algorithm",
24782 type = "Technical Report",
24783 number = "STAN-CS-79-776",
24784 institution = inst-STAN-CS,
24785 address = inst-STAN-CS:adr,
24786 pages = "13",
24787 month = nov,
24788 year = "1979",
24789 bibdate = "Tue Nov 25 08:51:44 2025",
24790 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
24791 note = "This paper supersedes STAN-CS-79-750
24792 \cite{Gacs:1979:KAL}.",
24793 URL = "",
24794 acknowledgement = ack-nhfb,
24795 }
24796
24797 @TechReport{Graham:1979:CWC,
24798 author = "Ronald L. Graham and Neil J. A. Sloane",
24799 title = "On constant weight codes and harmonious graphs",
24800 type = "Technical Report",
24801 number = "STAN-CS-79-777 (AD-A083176)",
24802 institution = inst-STAN-CS,
24803 address = inst-STAN-CS:adr,
24804 pages = "??",
24805 month = dec,
24806 year = "1979",
24807 bibdate = "Fri Nov 7 07:00:05 MST 2025",
24808 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
24809 URL = "http://i.stanford.edu/TR/CS-TR-79-777.html",
24810 abstract = "Very recently a new method has been developed for
24811 finding lower bounds on the maximum number of codewords
24812 possible in a code of minimum distance d and length n.
24813 This method has led in turn to a number of interesting
24814 questions in graph theory and additive number theory.
24815 In this brief survey we summarize some of these
24816 developments.",
24817 acknowledgement = ack-nhfb,
24818 author-dates = "Ronald Lewis Graham (31 October 1935--6 July 2020)",
24819 pdfpages = "18",
24820 xxnumber = "CS-TR-79-777",
24821 }
24822
24823 @TechReport{Shaw:1979:HAA,
24824 author = "David Elliot Shaw",
24825 title = "A hierarchical associative architecture for the
24826 parallel evaluation of relational algebraic database
24827 primitives",
24828 type = "Technical Report",
24829 number = "STAN-CS-79-778 (AD-A083573)",
24830 institution = inst-STAN-CS,
24831 address = inst-STAN-CS:adr,
24832 pages = "??",
24833 month = oct,
24834 year = "1979",
24835 bibdate = "Fri Nov 7 07:00:05 MST 2025",
24836 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
24837 URL = "http://i.stanford.edu/TR/CS-TR-79-778.html",
24838 abstract = "Algorithms are described and analyzed for the
24839 efficient evaluation of the primitive operators of a
24840 relational algebra on a proposed non-von Neumann
24841 machine based on a hierarchy of associative storage
24842 devices. This architecture permits an O(log n) decrease
24843 in time complexity over the best known evaluation
24844 methods on a conventional computer system, without the
24845 use of redundant storage, and using currently available
24846 and potentially competitive technology. In many eases
24847 of practical import, the proposed architecture may also
24848 permit a significant improvement (by a factor roughly
24849 proportional to the capacity of the primary associative
24850 storage device) over the performance of previously
24851 implemented or proposed database machine architectures
24852 based on associative secondary storage devices.",
24853 acknowledgement = ack-nhfb,
24854 pdfpages = "60",
24855 xxnumber = "CS-TR-79-778",
24856 }
24857
24858 @TechReport{King:1979:EUD,
24859 author = "Jonathan J. King",
24860 title = "Exploring the Use of Domain Knowledge for Query
24861 Processing Efficiency",
24862 type = "Technical Report",
24863 number = "STAN-CS-79-781",
24864 institution = inst-STAN-CS,
24865 address = inst-STAN-CS:adr,
24866 pages = "iv + 21",
24867 month = dec,
24868 year = "1979",
24869 bibdate = "Fri Nov 7 07:00:05 MST 2025",
24870 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
24871 URL = "http://i.stanford.edu/TR/CS-TR-79-781.html",
24872 abstract = "An approach to query optimization is described that
24873 draws on two sources of knowledge: real world
24874 constraints on the values for the application domain
24875 served by the database; and knowledge about the current
24876 structure of the database and the cost of available
24877 retrieval processes. Real world knowledge is embodied
24878 in rules that are much like semantic integrity rules.
24879 The approach, called `query rephrasing', is to generate
24880 semantic equivalents of user queries that cost less to
24881 process than the original queries. The operation of a
24882 prototype system based on this approach is discussed in
24883 the context of simple queries which restrict a single
24884 file. The need for heuristics to limit the generation
24885 of equivalent queries is also discussed, and a method
24886 using `constraint thresholds' derived from a model of
24887 the retrieval process is proposed.",
24888 acknowledgement = ack-nhfb,
24889 pdfpages = "26",
24890 xxnumber = "CS-TR-79-781",
24891 }
24892
24893 @TechReport{Karp:1979:PCS,
24894 author = "Richard Alan Karp",
24895 title = "Proving Concurrent Systems Correct",
24896 type = "Technical Report",
24897 number = "STAN-CS-80-783 (PVG-14)",
24898 institution = inst-STAN-CS,
24899 address = inst-STAN-CS:adr,
24900 pages = "151",
24901 month = nov,
24902 year = "1979",
24903 bibdate = "Tue Nov 25 08:51:44 2025",
24904 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
24905 URL = "",
24906 acknowledgement = ack-nhfb,
24907 }
24908
24909 @TechReport{Chow:1980:UFU,
24910 author = "Frederick Chow and Peter Nye and Gio Wiederhold",
24911 title = "{UFORT}: a {Fortran-to-Universal PCODE} Translator",
24912 type = "Technical Report",
24913 number = "CSL-TR-79-168",
24914 institution = inst-STAN-CS,
24915 address = inst-STAN-CS:adr,
24916 pages = "iv + 88",
24917 month = jan,
24918 year = "1980",
24919 bibdate = "Fri Jan 12 05:37:03 2024",
24920 bibsource = "https://www.math.utah.edu/pub/bibnet/authors/w/wirth-niklaus.bib;
24921 https://www.math.utah.edu/pub/tex/bib/fortran1.bib;
24922 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
24923 URL = "http://i.stanford.edu/pub/cstr/reports/csl/tr/79/168/CSL-TR-79-168.pdf",
24924 abstract = "The Fortran compiler described in this document,
24925 UFORT, was written specifically to serve in a Pascal
24926 environment using the Universal P-Code as an
24927 intermediate pseudomachine. The need for implementation
24928 of Fortran these days is due to the great volume of
24929 existing Fortran programs, rather than to a desire to
24930 have this language available to develop new programs.
24931 We have hence implemented the full, but traditional
24932 Fortran standard, rather than the recently adopted
24933 augmented Fortran standard. All aspects of Fortran
24934 which are commonly used in large scientific programs
24935 are available, including such features as SUBROUTINES,
24936 labelled COMMON, and COMPLEX arithmetic. In addition, a
24937 few common extensions, such as integers of different
24938 lengths and assignment of strings to variables, have
24939 been added.",
24940 acknowledgement = ack-nhfb,
24941 }
24942
24943 @TechReport{Gacs:1980:CNW,
24944 author = "Peter G{\'a}cs and Leonid A. Levin",
24945 title = "Causal nets or what is a deterministic computation",
24946 type = "Technical Report",
24947 number = "STAN-CS-80-768",
24948 institution = inst-STAN-CS,
24949 address = inst-STAN-CS:adr,
24950 pages = "20",
24951 month = oct,
24952 year = "1980",
24953 bibdate = "Thu Nov 20 12:11:36 MST 2025",
24954 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
24955 URL = "http://www-db.stanford.edu/TR/CS-TR-80-768.html",
24956 abstract = "We introduce the concept of causal nets --- it can be
24957 considered as the most general and elementary concept
24958 of the history of a deterministic computation
24959 (sequential or parallel). Causality and locality are
24960 distinguished as the only important properties of nets
24961 representing such records. Different types of
24962 complexities of computations correspond to different
24963 geometrical characteristics of the corresponding causal
24964 nets --- which have the advantage of being finite
24965 objects. Synchrony becomes a relative notion. Nets can
24966 have symmetries; therefore it will make sense to ask
24967 what can be computed from arbitrary symmetric inputs.
24968 Here, we obtain a complete group-theoretical
24969 characterization of the kind of symmetries that can be
24970 allowed in parallel computations.",
24971 acknowledgement = ack-nhfb,
24972 xxnumber = "CS-TR-80-768",
24973 }
24974
24975 @TechReport{Manna:1980:PFP,
24976 author = "Zohar Manna and Richard J. Waldinger",
24977 title = "Problematic features of programming languages: a
24978 situational-calculus approach",
24979 type = "Technical Report",
24980 number = "STAN-CS-80-779",
24981 institution = inst-STAN-CS,
24982 address = inst-STAN-CS:adr,
24983 pages = "??",
24984 month = sep,
24985 year = "1980",
24986 bibdate = "Thu Nov 20 12:11:36 MST 2025",
24987 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
24988 URL = "http://www-db.stanford.edu/TR/CS-TR-80-779.html",
24989 abstract = "Certain features of programming languages, such as
24990 data structure operations and procedure call
24991 mechanisms, have been found to resist formalization by
24992 classical techniques. An alternate approach is
24993 presented, based on a ``situational calculus,'' which
24994 makes explicit reference to the states of a
24995 computation. For each state, a distinction is drawn
24996 between an expression, its value, and the location of
24997 the value. Within this conceptual framework, the
24998 features of a programming language can be described
24999 axiomatically. Programs in the language can then be
25000 synthesized, executed, verified, or transformed by
25001 performing deductions in this axiomatic system.
25002 Properties of entire classes of programs, and of
25003 programming languages, can also be expressed and proved
25004 in this way. The approach is amenable to machine
25005 implementation. In a situational-calculus formalism it
25006 is possible to model precisely many ``problematic''
25007 features of programming languages, including operations
25008 on such data structures as arrays, pointers, lists, and
25009 records, and such procedure call mechanisms as
25010 call-by-reference, call-by-value, and call-by-name. No
25011 particular obstacle is presented by aliasing between
25012 variables, by declarations, or by recursive procedures.
25013 The paper is divided into three parts, focusing
25014 respectively on the assignment statement, on data
25015 structure operations, and on procedure call mechanisms.
25016 In this first part, we introduce the conceptual
25017 framework to be applied throughout and present the
25018 axiomatic definition of the assignment statement. If
25019 suitable restrictions on the programming language are
25020 imposed, the well-known Hoare assignment axiom can then
25021 be proved as a theorem. However, our definition can
25022 also describe the assignment statement of unrestricted
25023 programming languages, for which the Hoare axiom does
25024 not hold.",
25025 acknowledgement = ack-nhfb,
25026 xxnumber = "CS-TR-80-779",
25027 }
25028
25029 @TechReport{Knuth:1980:CMF,
25030 author = "Donald E. Knuth",
25031 title = "The {Computer Modern Family} of Typefaces",
25032 type = "Technical Report",
25033 number = "STAN-CS-80-780",
25034 institution = inst-STAN-CS,
25035 address = inst-STAN-CS:adr,
25036 pages = "406",
25037 day = "1",
25038 month = jan,
25039 year = "1980",
25040 bibdate = "Fri Apr 18 05:25:51 2003",
25041 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
25042 URL = "http://www-db.stanford.edu/TR/CS-TR-80-780.html;
25043 http://www.ncstrl.org:8900/ncstrl/servlet/search?formname=detail&id=oai%3Ancstrlh%3Astan%3ASTAN%2F%2FCS-TR-80-780",
25044 abstract = "This report gives machine-independent definitions of
25045 all the styles of type planned for use in future
25046 editions of ``The Art of Computer Programming.'' Its
25047 main purpose is to provide a detailed example of a
25048 complete family of font definitions using METAFONT, so
25049 that people who want new symbols for their own books
25050 and papers will understand how to incorporate them
25051 easily. The fonts are intended to have the same spirit
25052 as those used in earlier editions of ``The Art of
25053 Computer Programming,'' but each character has been
25054 redesigned and defined in the METAFONT idiom. It is
25055 hoped that some readers will be inspired to make
25056 similar definitions of other important families of
25057 fonts. The bulk of this report consists of about 400
25058 short METAFONT programs for the various symbols needed,
25059 and as such it is pretty boring, but there are some
25060 nice illustrations.",
25061 acknowledgement = ack-nhfb # "\slash " # ack-hk,
25062 documentid = "oai:ncstrlh:stan:STAN//CS-TR-80-780",
25063 pdfpages = "210",
25064 remark = "Most of the PDF pages are two physical pages rotated
25065 90 degrees upward.",
25066 xxnumber = "CS-TR-80-780",
25067 }
25068
25069 @TechReport{Anonymous:1980:NP,
25070 author = "Anonymous",
25071 title = "{NEVER PRINTED}",
25072 type = "Technical Report",
25073 number = "STAN-CS-80-782",
25074 institution = inst-STAN-CS,
25075 address = inst-STAN-CS:adr,
25076 pages = "????",
25077 month = "????",
25078 year = "1980",
25079 bibdate = "Tue Nov 25 08:51:44 2025",
25080 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
25081 URL = "",
25082 acknowledgement = ack-nhfb,
25083 }
25084
25085 @TechReport{Stefik:1980:PC,
25086 author = "Mark Jeffrey Stefik",
25087 title = "Planning with Constraints",
25088 type = "Technical Report",
25089 number = "STAN-CS-80-784 (HPP-80-2)",
25090 institution = inst-STAN-CS,
25091 address = inst-STAN-CS:adr,
25092 pages = "230",
25093 month = jan,
25094 year = "1980",
25095 bibdate = "Tue Nov 25 08:51:44 2025",
25096 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
25097 URL = "",
25098 acknowledgement = ack-nhfb,
25099 remark = "This is the author's thesis.",
25100 }
25101
25102 @TechReport{Huet:1980:ERR,
25103 author = "Gerard Huet and Derek C. Oppen",
25104 title = "Equations and rewrite rules: a survey",
25105 type = "Technical Report",
25106 number = "STAN-CS-80-785 (PVG-15)",
25107 institution = inst-STAN-CS,
25108 address = inst-STAN-CS:adr,
25109 pages = "??",
25110 month = jan,
25111 year = "1980",
25112 bibdate = "Thu Nov 20 12:11:36 MST 2025",
25113 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
25114 URL = "http://www-db.stanford.edu/TR/CS-TR-80-785.html",
25115 abstract = "Equations occur frequently in mathematics, logic and
25116 computer science. In this paper, we survey the main
25117 results concerning equations, and the methods available
25118 for reasoning about them and computing with them. The
25119 survey is self-contained and unified, using traditional
25120 abstract algebra. Reasoning about equations may involve
25121 deciding if an equation follows from a given set of
25122 equations (axioms), or if an equation is true in a
25123 given theory. When used in this manner, equations state
25124 properties that hold between objects. Equations may
25125 also be used as definitions; this use is well known in
25126 computer science: programs written in applicative
25127 languages, abstract interpreter definitions, and
25128 algebraic data type definitions are clearly of this
25129 nature. When these equations are regarded as oriented
25130 ``rewrite rules,'' we may actually use them to compute.
25131 In addition to covering these topics, we discuss the
25132 problem of ``solving'' equations (the ``unification''
25133 problem), the problem of proving termination of sets of
25134 rewrite rules, and the decidability and complexity of
25135 word problems and of combinations of equational
25136 theories. We restrict ourselves to first-order
25137 equations, and do not treat equations which define
25138 non-terminating computations or recent work on rewrite
25139 rules applied to equational congruence classes.",
25140 acknowledgement = ack-nhfb,
25141 xxnumber = "CS-TR-80-785",
25142 }
25143
25144 @TechReport{Knuth:1980:AMM,
25145 author = "Donald E. Knuth",
25146 title = "Algorithms in modern mathematics and computer
25147 science",
25148 type = "Technical Report",
25149 number = "STAN-CS-80-786 (AD-A089912)",
25150 institution = inst-STAN-CS,
25151 address = inst-STAN-CS:adr,
25152 pages = "iv + 25",
25153 month = jan,
25154 year = "1980",
25155 bibdate = "Fri Apr 18 05:25:51 2003",
25156 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
25157 URL = "http://i.stanford.edu/pub/cstr/reports/cs/tr/80/786/CS-TR-80-786.pdf;
25158 http://www-db.stanford.edu/TR/CS-TR-80-786.html",
25159 abstract = "The life and work of the ninth century scientist
25160 al-Khwarizmi, ``the father of algebra and algorithms,''
25161 is surveyed briefly. Then a random sampling technique
25162 is used in an attempt to better understand the kinds of
25163 thinking that good mathematicians and computer
25164 scientists do and to analyze whether such thinking is
25165 significantly ``algorithmic'' in nature. (This is the
25166 text of a talk given at the opening session of a
25167 symposium on ``Algorithms in Modern Mathematics and
25168 Computer Science'' held in Urgench, Khorezm Oblast',
25169 Uzbek S.S.R., during the week of September 16--22,
25170 1979.)",
25171 acknowledgement = ack-nhfb,
25172 documentid = "oai:ncstrlh:stan:STAN//CS-TR-80-786",
25173 pdfpages = "30",
25174 xxnumber = "CS-TR-80-786",
25175 }
25176
25177 @TechReport{Symm:1980:REBa,
25178 author = "H. J. Symm and James H. Wilkinson",
25179 title = "Realistic Error Bounds for a Simple Eigenvalue and its
25180 Associated Eigenvector",
25181 type = "Technical Report",
25182 number = "STAN-CS-80-787",
25183 institution = inst-STAN-CS,
25184 address = inst-STAN-CS:adr,
25185 pages = "??",
25186 year = "1980",
25187 DOI = "https://doi.org/10.1007/BF01396310",
25188 bibdate = "Fri Nov 21 09:13:28 2025",
25189 bibsource = "https://www.math.utah.edu/pub/bibnet/authors/w/wilkinson-james-hardy.bib;
25190 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
25191 note = "Published as \cite{Symm:1980:REBb}.",
25192 URL = "",
25193 acknowledgement = ack-nhfb,
25194 author-dates = "James H. Wilkinson (27 September 1919--5 October
25195 1986)",
25196 remark = "Published in \booktitle{Numerische Mathematik} {\bf
25197 35}(2) 113--126, June 1980, doi:10.1007/BF01396310.",
25198 xxnumber = "CS-TR-80-787",
25199 }
25200
25201 @TechReport{McCarthy:1980:CFN,
25202 author = "John McCarthy",
25203 title = "Circumscription --- a form of non-monotonic
25204 reasoning",
25205 type = "Technical Report",
25206 number = "STAN-CS-80-788 (AIM-334, AD-A086574)",
25207 institution = inst-STAN-CS,
25208 address = inst-STAN-CS:adr,
25209 pages = "iii + 15",
25210 month = feb,
25211 year = "1980",
25212 bibdate = "Thu Nov 20 12:11:36 MST 2025",
25213 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
25214 URL = "http://www-db.stanford.edu/TR/CS-TR-80-788.html;
25215 https://apps.dtic.mil/sti/tr/pdf/ADA086574.pdf",
25216 abstract = "Humans and intelligent computer programs must often
25217 jump to the conclusion that the objects they can
25218 determine to have certain properties or relations are
25219 the only objects that do. Circumscription formalizes
25220 such conjectural reasoning.",
25221 acknowledgement = ack-nhfb,
25222 author-dates = "John McCarthy (4 September 1927--24 October 2011)",
25223 pdfpages = "18",
25224 xxnumber = "CS-TR-80-788",
25225 }
25226
25227 @TechReport{Luckham:1980:AES,
25228 author = "David C. Luckham and Wolfgang Polak",
25229 title = "{ADA} exceptions: specification and proof techniques",
25230 type = "Technical Report",
25231 number = "STAN-CS-80-789",
25232 institution = inst-STAN-CS,
25233 address = inst-STAN-CS:adr,
25234 pages = "??",
25235 month = feb,
25236 year = "1980",
25237 bibdate = "Thu Nov 20 12:11:36 MST 2025",
25238 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
25239 URL = "http://www-db.stanford.edu/TR/CS-TR-80-789.html",
25240 abstract = "A method of documenting exception propagation and
25241 handling in Ada programs is proposed. Exception
25242 propagation declarations are introduced as a new
25243 component of Ada specifications. This permits
25244 documentation of those exceptions that can be
25245 propagated by a subprogram. Exception handlers are
25246 documented by entry assertions. Axioms and proof rules
25247 for Ada exceptions are given. These rules are simple
25248 extensions of previous rules for Pascal and define an
25249 axiomatic semantics of Ada exceptions. As a result, Ada
25250 programs specified according to the method can be
25251 analysed by formal proof techniques for consistency
25252 with their specifications, even if they employ
25253 exception propagation and handling to achieve required
25254 results (i.e. non-error situations). Example
25255 verifications are given.",
25256 acknowledgement = ack-nhfb,
25257 xxnumber = "CS-TR-80-789",
25258 }
25259
25260 @TechReport{Wiederhold:1980:DH,
25261 author = "Gio Wiederhold",
25262 title = "Databases in healthcare",
25263 type = "Technical Report",
25264 number = "STAN-CS-80-790",
25265 institution = inst-STAN-CS,
25266 address = inst-STAN-CS:adr,
25267 pages = "??",
25268 month = mar,
25269 year = "1980",
25270 bibdate = "Thu Nov 20 12:11:36 MST 2025",
25271 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
25272 URL = "http://www-db.stanford.edu/TR/CS-TR-80-790.html",
25273 abstract = "This report defines database design and implementation
25274 technology as applicable to healthcare. The
25275 relationship of technology to various healthcare
25276 settings is explored, and the effectiveness on
25277 healthcare costs, quality and access is evaluated. A
25278 summary of relevant development directions is included.
25279 Detailed examples of 5 typical clinical applications
25280 (public health, clinical trials, clinical research,
25281 ambulatory care, and hospitals) are appended. There is
25282 an extended bibliography.",
25283 acknowledgement = ack-nhfb,
25284 xxnumber = "CS-TR-80-790",
25285 }
25286
25287 @TechReport{Wilcox:1980:MLM,
25288 author = "Clark R. Wilcox and Mary L. Dageforde and Gregory A.
25289 Jirak",
25290 title = "{Mainsail} Language Manual",
25291 type = "Technical Report",
25292 number = "STAN-CS-80-791 (CSL 78-166)",
25293 institution = inst-STAN-CS,
25294 address = inst-STAN-CS:adr,
25295 pages = "247",
25296 month = mar,
25297 year = "1980",
25298 bibdate = "Tue Nov 25 08:51:44 2025",
25299 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
25300 note = "This reported was misnumbered as CS-80-790.",
25301 URL = "",
25302 acknowledgement = ack-nhfb,
25303 }
25304
25305 @TechReport{Wilcox:1980:MIO,
25306 author = "Clark R. Wilcox and Mary L. Dageforde and Gregory A.
25307 Jirak",
25308 title = "{MAINSAIL} implementation overview",
25309 type = "Technical Report",
25310 number = "STAN-CS-80-792 (CSL 78-167)",
25311 institution = inst-STAN-CS,
25312 address = inst-STAN-CS:adr,
25313 pages = "??",
25314 month = mar,
25315 year = "1980",
25316 bibdate = "Thu Nov 20 12:11:36 MST 2025",
25317 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
25318 URL = "http://www-db.stanford.edu/TR/CS-TR-80-792.html",
25319 abstract = "The MAINSAIL programming language and the supporting
25320 implementations have been developed over the past five
25321 years as an integrated approach to a viable
25322 machine-independent system suitable for the development
25323 of large, portable programs. Particular emphasis has
25324 been placed on minimizing the effort involved in moving
25325 the system to a new machine and/or operating system.
25326 For this reason, almost all of the compiler and runtime
25327 support is written in MAINSAIL, and is utilized in each
25328 implementation without alteration. This use of a
25329 high-level language to support its own implementation
25330 has proved to be a significant advantage in terms of
25331 documentation and maintenance, without unduly affecting
25332 the execution speed. This paper gives an overview of
25333 the compiler and runtime implementation strategies, and
25334 indicates what an implementation requires for the
25335 machine-dependent and operating-system-dependent
25336 parts.",
25337 acknowledgement = ack-nhfb,
25338 xxnumber = "CS-TR-80-792",
25339 }
25340
25341 @TechReport{Barr:1980:RK,
25342 author = "Avron Barr and James Davidson",
25343 title = "Representation of Knowledge",
25344 type = "Technical Report",
25345 number = "STAN-CS-80-793",
25346 institution = inst-STAN-CS,
25347 address = inst-STAN-CS:adr,
25348 pages = "82",
25349 month = mar,
25350 year = "1980",
25351 bibdate = "Tue Nov 25 08:51:44 2025",
25352 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
25353 URL = "",
25354 acknowledgement = ack-nhfb,
25355 }
25356
25357 @TechReport{Tarjan:1980:RDC,
25358 author = "Robert Endre Tarjan",
25359 title = "Recent developments in the complexity of combinatorial
25360 algorithms",
25361 type = "Technical Report",
25362 number = "STAN-CS-80-794",
25363 institution = inst-STAN-CS,
25364 address = inst-STAN-CS:adr,
25365 pages = "??",
25366 month = jun,
25367 year = "1980",
25368 bibdate = "Thu Nov 20 12:11:36 MST 2025",
25369 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
25370 URL = "http://www-db.stanford.edu/TR/CS-TR-80-794.html",
25371 abstract = "The last three years have witnessed several major
25372 advances in the area of combinatorial algorithms. These
25373 include improved algorithms for matrix multiplication
25374 and maximum network flow, a polynomial-time algorithm
25375 for linear programming, and steps toward a
25376 polynomial-time algorithm for graph isomorphism. This
25377 paper surveys these results and suggests directions for
25378 future research. Included is a discussion of recent
25379 work by the author and his students on dynamic
25380 dictionaries, network flow problems, and related
25381 questions.",
25382 acknowledgement = ack-nhfb,
25383 xxnumber = "CS-TR-80-794",
25384 }
25385
25386 @TechReport{Knuth:1980:L,
25387 author = "Donald E. Knuth",
25388 title = "The Letter {S}",
25389 type = "Technical Report",
25390 number = "STAN-CS-80-795",
25391 institution = inst-STAN-CS,
25392 address = inst-STAN-CS:adr,
25393 pages = "iii + 34",
25394 month = apr,
25395 year = "1980",
25396 DOI = "https://doi.org/10.1007/BF03023051",
25397 bibdate = "Tue Nov 25 08:51:44 2025",
25398 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
25399 URL = "https://apps.dtic.mil/sti/tr/pdf/ADA090470.pdf",
25400 acknowledgement = ack-nhfb,
25401 pdfpages = "37",
25402 remark-1 = "Published in \booktitle{The Mathematical
25403 Intelligencer}, {\bf 2}(3) 114--122, 1979.",
25404 remark-2 = "The PDF file is OCR'ed scans of microfiche page
25405 images.",
25406 xxabstract = "This expository paper explains how the problem of
25407 drawing the letter ``S'' leads to interesting problems
25408 in elementary calculus and analytic geometry. It also
25409 gives a brief introduction to the authors METAFONT
25410 language for alphabet design.",
25411 }
25412
25413 @TechReport{Samuel:1980:E,
25414 author = "Arthur L. Samuel",
25415 title = "Essential {E}",
25416 type = "Technical Report",
25417 number = "STAN-CS-80-796 (AIM-335)",
25418 institution = inst-STAN-CS,
25419 address = inst-STAN-CS:adr,
25420 pages = "ii + 33",
25421 month = mar,
25422 year = "1980",
25423 bibdate = "Thu Nov 20 12:11:36 MST 2025",
25424 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
25425 URL = "http://www-db.stanford.edu/TR/CS-TR-80-796.html",
25426 abstract = "This is an introductory manual describing the
25427 display-oriented text editor E that is available on the
25428 Stanford A.I. Laboratory PDP-10 computer. The present
25429 manual is intended to be used as an aid for the
25430 beginner as well as for experienced computer users who
25431 either are unfamiliar with the E editor or use it
25432 infrequently. Reference is made to the two on-line
25433 manuals that help the beginner to get started and that
25434 provide a complete description of the editor for the
25435 experienced user. E is commonly used for writing
25436 computer programs and for preparing reports and
25437 memoranda. It is not a document editor, although it
25438 does provide some facilities for getting a document
25439 into a pleasing format. The primary emphasis is that of
25440 speed, both in terms of the number of key strokes
25441 required of the user and in terms of the demands made
25442 on the computer system. At the same time, E is easy to
25443 learn and it offers a large range of facilities that
25444 are not available on many editors.",
25445 acknowledgement = ack-nhfb,
25446 author-dates = "Arthur Lee Samuel (5 December 1901--29 July 1990)",
25447 xxnumber = "CS-TR-80-796",
25448 }
25449
25450 @TechReport{Garcia-Molina:1980:ROT,
25451 author = "Hector Garcia-Molina and Gio Wiederhold",
25452 title = "Read-only transactions in a distributed database",
25453 type = "Technical Report",
25454 number = "STAN-CS-80-797",
25455 institution = inst-STAN-CS,
25456 address = inst-STAN-CS:adr,
25457 pages = "??",
25458 month = apr,
25459 year = "1980",
25460 bibdate = "Thu Nov 20 12:11:36 MST 2025",
25461 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
25462 URL = "http://www-db.stanford.edu/TR/CS-TR-80-797.html",
25463 abstract = "A read-only transaction or query is a transaction
25464 which does not modify any data. Read-only transactions
25465 could be processed with general transaction processing
25466 algorithms, but in many cases it is more efficient to
25467 process read-only transactions with special algorithms
25468 which take advantage of the knowledge that the
25469 transaction only reads. This paper defines the various
25470 consistency and currency requirements that read-only
25471 transactions may have. The processing of the different
25472 classes of read-only transactions in a distributed
25473 database is discussed. The concept of R insularity is
25474 introduced to characterize both the read-only and
25475 update algorithms. Several simple update and read-only
25476 transaction processing algorithms are presented to
25477 illustrate how the query requirements and the update
25478 algorithms affect the read-only transaction processing
25479 algorithms.",
25480 acknowledgement = ack-nhfb,
25481 xxnumber = "CS-TR-80-797",
25482 }
25483
25484 @TechReport{Floyd:1980:CRE,
25485 author = "Robert W. Floyd and Jeffrey D. Ullman",
25486 title = "The Compilation of Regular Expressions into Integrated
25487 Circuits",
25488 type = "Technical Report",
25489 number = "STAN-CS-80-798",
25490 institution = inst-STAN-CS,
25491 address = inst-STAN-CS:adr,
25492 pages = "v + 28",
25493 month = apr,
25494 year = "1980",
25495 bibdate = "Tue Nov 25 08:51:44 2025",
25496 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib;
25497 https://www.math.utah.edu/pub/tex/bib/string-matching.bib",
25498 URL = "https://apps.dtic.mil/sti/tr/pdf/ADA090507.pdf",
25499 abstract = "We consider the design of integrated circuits to
25500 implement arbitrary regular expressions. In general, we
25501 may use the McNaughton--Yamada algorithm to convert a
25502 regular expression of length n into a nondeterministic
25503 finite automaton with at most $ 2 n $ states and $ 4 n
25504 $ transitions. Instead of converting the
25505 nondeterministic device to a deterministic one, we
25506 propose two ways of implementing the nondeterministic
25507 device directly. First, we could produce a PLA
25508 (programmable logic array) of approximate dimensions $
25509 4 n \times 4 n $ by representing the states directly by
25510 columns, rather than coding the states in binary. This
25511 approach, while theoretically suboptimal, makes use of
25512 carefully developed technology and, because of the care
25513 with which PLA implementation has been done, may be the
25514 preferred technique in many real situations. Another
25515 approach is to use the hierarchical structure of the
25516 automaton produced from the regular expression to guide
25517 a hierarchical layout of the circuit. This method
25518 produces a circuit $ O(\sqrt {n}) $ on a side and is,
25519 to within a constant factor, the best that can be done
25520 in general.",
25521 acknowledgement = ack-nhfb,
25522 author-dates = "Robert W. Floyd (8 June 1936--25 September 2001)",
25523 pdfpages = "33",
25524 remark = "The PDF file is OCR'ed scans of microfiche page
25525 images.",
25526 }
25527
25528 @TechReport{Friedman:1980:MAS,
25529 author = "Jerome H. Friedman and Eric Grosse and Werner
25530 Stuetzle",
25531 title = "Multidimensional additive spline approximation",
25532 type = "Technical Report",
25533 number = "STAN-CS-80-799",
25534 institution = inst-STAN-CS,
25535 address = inst-STAN-CS:adr,
25536 pages = "??",
25537 month = may,
25538 year = "1980",
25539 bibdate = "Thu Nov 20 12:11:36 MST 2025",
25540 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
25541 URL = "http://www-db.stanford.edu/TR/CS-TR-80-799.html",
25542 abstract = "We describe an adaptive procedure that approximates a
25543 function of many variables by a sum of (univariate)
25544 spline functions $ s_m $ of selected linear
25545 combinations $ a_m \cdot x $ of the coordinates $
25546 \theta (x) = \sum_{1 \leq m \leq M} s_m (a_m \cdot x)
25547 $. The procedure is nonlinear in that not only the
25548 spline coefficients but also the linear combinations
25549 are optimized for the particular problem. The sample
25550 need not lie on a regular grid, and the approximation
25551 is affine invariant, smooth, and lends itself to
25552 graphical interpretation. Function values, derivatives,
25553 and integrals are cheap to evaluate.",
25554 acknowledgement = ack-nhfb,
25555 xxnumber = "CS-TR-80-799",
25556 }
25557
25558 @TechReport{Blum:1979:ASC,
25559 author = "Robert L. Blum",
25560 title = "Automating the Study of Clinical Hypotheses on a
25561 Time-Oriented Data Base: The {RX Project}",
25562 type = "Technical Report",
25563 number = "STAN-CS-79-816",
25564 institution = inst-STAN-CS,
25565 address = inst-STAN-CS:adr,
25566 pages = "12",
25567 month = nov,
25568 year = "1979",
25569 bibdate = "Fri Nov 7 07:00:05 MST 2025",
25570 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
25571 URL = "http://i.stanford.edu/TR/CS-TR-79-816.html",
25572 abstract = "The existence of large chronic disease data bases
25573 offers the possibility of studying hypotheses of major
25574 medical importance. An objective of the RX Project is
25575 to assist a clinical researcher with the tasks of
25576 experimental design and statistical analysis. A major
25577 component of RX is a knowledge base of medicine and
25578 statistics, organized as a frame-based, taxonomic tree.
25579 RX determines confounding variables, study design, and
25580 analytic techniques. It then gathers data, analyzes it,
25581 and interprets results. The American Rheumatism
25582 Association Medical Information System is used.",
25583 acknowledgement = ack-nhfb,
25584 pdfpages = "13",
25585 xxnumber = "CS-TR-79-816",
25586 }
25587
25588 @TechReport{Vitter:1980:ACH,
25589 author = "Jeffrey Scott Vitter",
25590 title = "Analysis of Coalesced Hashing",
25591 type = "Technical Report",
25592 number = "STAN-CS-79-817",
25593 institution = inst-STAN-CS,
25594 address = inst-STAN-CS:adr,
25595 pages = "111",
25596 month = aug,
25597 year = "1980",
25598 bibdate = "Wed Nov 26 08:55:07 2025",
25599 bibsource = "https://www.math.utah.edu/pub/tex/bib/hash.bib;
25600 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
25601 URL = "",
25602 acknowledgement = ack-nhfb,
25603 remark = "This is the author's thesis.",
25604 }
25605
25606 @TechReport{Knuth:1980:DLC,
25607 author = "Donald E. Knuth",
25608 title = "Deciphering a Linear Congruential Encryption",
25609 type = "Technical Report",
25610 number = "STAN-CS-80-800",
25611 institution = inst-STAN-CS,
25612 address = inst-STAN-CS:adr,
25613 pages = "10",
25614 month = apr,
25615 year = "1980",
25616 DOI = "https://doi.org/10.1109/tit.1985.1056997",
25617 bibdate = "Tue Nov 25 08:51:44 2025",
25618 bibsource = "https://www.math.utah.edu/pub/tex/bib/prng.bib;
25619 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
25620 URL = "",
25621 acknowledgement = ack-nhfb,
25622 remark = "Published in \booktitle{IEEE Transactions on
25623 Information Theory}, {\bf 31}(1) 49--52, January 1985,
25624 doi:10.1109/tit.1985.1056997.",
25625 }
25626
25627 @TechReport{El-Masri:1980:DUI,
25628 author = "Ramez Aziz El-Masri",
25629 title = "On the Design, Use, and Integration of Data Models",
25630 type = "Technical Report",
25631 number = "STAN-CS-80-801",
25632 institution = inst-STAN-CS,
25633 address = inst-STAN-CS:adr,
25634 pages = "228",
25635 month = may,
25636 year = "1980",
25637 bibdate = "Tue Nov 25 08:51:44 2025",
25638 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
25639 URL = "",
25640 acknowledgement = ack-nhfb,
25641 remark = "This is the author's thesis.",
25642 }
25643
25644 @TechReport{Polak:1980:TCS,
25645 author = "Wolfgang Heinz Polak",
25646 title = "Theory of Compiler Specification and Verification",
25647 type = "Technical Report",
25648 number = "STAN-CS-80-802 (PVG-17, AD-A094604)",
25649 institution = inst-STAN-CS,
25650 address = inst-STAN-CS:adr,
25651 pages = "xiv + 281",
25652 month = may,
25653 year = "1980",
25654 bibdate = "Tue Nov 25 08:51:44 2025",
25655 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
25656 URL = "https://apps.dtic.mil/sti/citations/ADA094604;
25657 https://apps.dtic.mil/sti/pdfs/ADA094604.pdf",
25658 abstract = "The formal specification, design, implementation, and
25659 verification of a compiler for a Pascal-like language
25660 is described. All components of the compilation process
25661 such as scanning, parsing, type checking, and code
25662 generation are considered.\par
25663
25664 The implemented language contains most control
25665 structures of Pascal, recursive procedures and
25666 functions, and jumps. It provides user defined data
25667 types including arrays, records, and pointers. A simple
25668 facility for input-output is provided.\par
25669
25670 The target language assumes a stack machine including a
25671 display mechanism to handle procedure and function
25672 calls.\par
25673
25674 The compiler itself is written in Pascal Plus, a
25675 dialect of Pascal accepted by the Stanford verifier.
25676 The Stanford verifier is used to give a complete formal
25677 machine checked verification of the compiler.\par
25678
25679 One of the main problem areas considered is the formal
25680 mathematical treatment of programming languages and
25681 compilers suitable as input for automated program
25682 verification systems.\par
25683
25684 Several technical and methodological problems of
25685 mechanically verifying large software systems are
25686 considered. Some new verification techniques are
25687 developed, notably methods to reason about pointers,
25688 fixed points, and quantification. These techniques are
25689 of general importance and are not limited to compiler
25690 verification.\par
25691
25692 The result of this research demonstrates that
25693 construction of large correct programs is possible with
25694 the existing verification technology. It indicates that
25695 verification will become a useful software engineering
25696 tool in the future. Several problem areas of current
25697 verification systems are pointed out and areas for
25698 future research are outlined.",
25699 acknowledgement = ack-nhfb,
25700 pdfpages = "157",
25701 remark = "This is the author's thesis. The PDF file is OCR'ed
25702 scans of microfiche page images. Most of the PDF pages
25703 are two physical pages rotated 90 degrees upward.",
25704 }
25705
25706 @TechReport{VanWyk:1980:LTG,
25707 author = "Christopher John {Van Wyk}",
25708 title = "A Language for Typesetting Graphics",
25709 type = "Technical Report",
25710 number = "STAN-CS-80-803",
25711 institution = inst-STAN-CS,
25712 address = inst-STAN-CS:adr,
25713 pages = "may",
25714 month = "1980",
25715 year = "1980",
25716 bibdate = "Tue Nov 25 08:51:44 2025",
25717 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
25718 URL = "",
25719 acknowledgement = ack-nhfb,
25720 remark = "This is the author's thesis.",
25721 }
25722
25723 @TechReport{Brooks:1980:DCT,
25724 author = "Martin Brooks",
25725 title = "Determining Correctness by Testing",
25726 type = "Technical Report",
25727 number = "STAN-CS-80-804 (AIM-336)",
25728 institution = inst-STAN-CS,
25729 address = inst-STAN-CS:adr,
25730 pages = "59",
25731 month = may,
25732 year = "1980",
25733 bibdate = "Tue Nov 25 08:51:44 2025",
25734 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
25735 URL = "",
25736 acknowledgement = ack-nhfb,
25737 remark = "This is the author's thesis.",
25738 }
25739
25740 @TechReport{Gennery:1980:MEE,
25741 author = "Donald B. Gennery",
25742 title = "Modelling the Environment of an Exploring Vehicle by
25743 Means of Stereo Vision",
25744 type = "Technical Report",
25745 number = "STAN-CS-80-805 (AIM-339, AD-A091081)",
25746 institution = inst-STAN-CS,
25747 address = inst-STAN-CS:adr,
25748 pages = "viii + 144",
25749 month = jun,
25750 year = "1980",
25751 bibdate = "Tue Nov 25 08:51:44 2025",
25752 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
25753 URL = "https://apps.dtic.mil/sti/tr/pdf/ADA091081.pdf",
25754 abstract = "This dissertation describes research involving vision
25755 techniques which would be useful in an autonomous
25756 exploring vehicle, such as a Mars rover. These
25757 techniques produce a description of the surroundings of
25758 the vehicle in terms of the position, size, and
25759 approximate shape of objects, and can match such scene
25760 descriptions with others previously produced. The
25761 information produced is thus useful both for navigation
25762 and obstacle avoidance. The techniques operate by using
25763 three-dimensional data which they can produce by means
25764 of stereo vision from stereo picture pairs or which can
25765 be obtained from a laser rangefinder. The research thus
25766 divides conveniently into two portions: stereo mapping
25767 and three-dimensional modelling and matching.\par
25768
25769 The stereo mapping techniques are designed to be
25770 suitable for the kind of pictures that a Mars rover
25771 might obtain and to produce the kind of data that the
25772 modelling techniques need. These stereo techniques are
25773 based upon area correlation and produce a depth map of
25774 the scene. Emphasis is placed upon extraction of useful
25775 data from noisy pictures and upon the estimation of the
25776 accuracy of the data produced. Included are the
25777 following: a self-calibration method for computing the
25778 stereo camera model (the relative position and
25779 orientation of the two camera positions); a
25780 high-resolution stereo correlator for producing
25781 accurate matches with accuracy and confidence
25782 estimates, which includes the ability to compensate for
25783 brightness and contrast changes between the pictures; a
25784 search technique for using the correlator to produce a
25785 dense sampling of matched points for a pair of
25786 pictures; and the computation of the distances to the
25787 matched points, including the propagation of the
25788 accuracy estimates.\par
25789
25790 The three-dimensional modelling and matching techniques
25791 are designed to be tolerant of the errors that stereo
25792 mapping techniques often produce. First, a ground
25793 surface finder tries to find a set of points that form
25794 a well-defined smooth surface that lies below most of
25795 the other points. Then, by using this knowledge of the
25796 ground surface and knowledge of the camera viewpoint
25797 that produced the points in the scene, an object finder
25798 approximates the objects that are above the ground by
25799 ellipsoids. Finally, a scene matcher can use the
25800 descriptions of scenes in terms of ellipsoidal objects.
25801 By using a search pruned by using probabilities
25802 obtained by means of Bayes' theorem, it determines the
25803 probability that two scene descriptions refer to the
25804 same scene and the linear transformation needed to
25805 bring the two scenes into alignment.\par
25806
25807 These techniques have been tried on stereo pictures of
25808 the Martian surface taken by the Viking Lander I. The
25809 object finder was able to locate rocks fairly
25810 successfully, and the scene matcher was able to match
25811 successfully the resulting scene descriptions. Examples
25812 of these results are shown.",
25813 acknowledgement = ack-nhfb,
25814 pdfpages = "158",
25815 remark = "This is the author's thesis. From page iv: ``The
25816 thesis itself was written using the POX document
25817 compiler produced by Robert Maas.''",
25818 }
25819
25820 @TechReport{Coughran:1980:ASH,
25821 author = "William Marvin Coughran",
25822 title = "On the Approximate Solution of Hyperbolic
25823 Initial-Boundary Value Problems",
25824 type = "Technical Report",
25825 number = "STAN-CS-80-806",
25826 institution = inst-STAN-CS,
25827 address = inst-STAN-CS:adr,
25828 pages = "177",
25829 month = jun,
25830 year = "1980",
25831 bibdate = "Tue Nov 25 08:51:44 2025",
25832 bibsource = "https://www.math.utah.edu/pub/bibnet/authors/c/coughran-william-m.bib;
25833 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
25834 URL = "https://apps.dtic.mil/sti/tr/pdf/ADA091183.pdf",
25835 acknowledgement = ack-nhfb,
25836 remark = "This is the author's thesis.",
25837 }
25838
25839 @TechReport{Matula:1980:PRG,
25840 author = "David W. Matula and Danny Dolev",
25841 title = "Path-regular graphs",
25842 type = "Technical Report",
25843 number = "STAN-CS-80-807 (AD-A091123)",
25844 institution = inst-STAN-CS,
25845 address = inst-STAN-CS:adr,
25846 pages = "39",
25847 month = jun,
25848 year = "1980",
25849 bibdate = "Thu Nov 20 12:11:36 MST 2025",
25850 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
25851 URL = "http://www-db.stanford.edu/TR/CS-TR-80-807.html",
25852 abstract = "A graph is vertex-[edge-]path-regular if a list of
25853 shortest paths, allowing multiple copies of paths,
25854 exists where every pair of vertices are the endvertices
25855 of the same number of paths and each vertex [edge]
25856 occurs in the same number of paths of the list. The
25857 dependencies and independencies between the various
25858 path-regularity, regularity of degree, and symmetry
25859 properties are investigated. We show that every
25860 connected vertex-[edge-]symmetric graph is
25861 vertex-[edge-]path-regular, but not conversely. We show
25862 that the product of any two vertex-path-regular graphs
25863 is vertex-path-regular but not conversely, and the
25864 iterated product $ G \times G \times \cdots {} \times G
25865 $ is edge-path-regular if and only if $G$ is
25866 edge-path-regular. An interpretation of path-regular
25867 graphs is given regarding the efficient design of
25868 concurrent communication networks.",
25869 acknowledgement = ack-nhfb,
25870 xxnumber = "CS-TR-80-807",
25871 }
25872
25873 @TechReport{McCarthy:1980:FRB,
25874 author = "John McCarthy and Thomas O. Binford and David C.
25875 Luckham and Zohar Manna and Richard W. Weyhrauch and
25876 Les Earnest",
25877 title = "Final report: Basic Research in Artificial
25878 Intelligence and Foundations of Programming",
25879 type = "Technical Report",
25880 number = "STAN-CS-80-808 (AIM-337, AD-A091183)",
25881 institution = inst-STAN-CS,
25882 address = inst-STAN-CS:adr,
25883 pages = "iii + 73",
25884 month = may,
25885 year = "1980",
25886 bibdate = "Thu Nov 20 12:11:36 MST 2025",
25887 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
25888 note = "Edited by Les Earnest.",
25889 URL = "http://www-db.stanford.edu/TR/CS-TR-80-808.html;
25890 https://apps.dtic.mil/sti/tr/pdf/ADA091183.pdf",
25891 abstract = "Recent research results are reviewed in the areas of
25892 formal reasoning, mathematical theory of computation,
25893 program verification, and image understanding.",
25894 acknowledgement = ack-nhfb,
25895 author-dates = "John McCarthy (4 September 1927--24 October 2011)",
25896 pdfpages = "76",
25897 xxnumber = "CS-TR-80-808",
25898 }
25899
25900 @TechReport{Ohwovoriole:1980:EST,
25901 author = "Morgan S. Ohwovoriole",
25902 title = "An Extension of Screw Theory and its Application to
25903 the Automation of Industrial Assemblies",
25904 type = "Technical Report",
25905 number = "STAN-CS-80-809 (AIM-338)",
25906 institution = inst-STAN-CS,
25907 address = inst-STAN-CS:adr,
25908 pages = "186",
25909 month = apr,
25910 year = "1980",
25911 bibdate = "Tue Nov 25 08:51:44 2025",
25912 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
25913 URL = "",
25914 acknowledgement = ack-nhfb,
25915 remark = "This is the author's thesis.",
25916 }
25917
25918 @TechReport{Steele:1980:LBA,
25919 author = "J. Michael Steele and Andrew C. Yao",
25920 title = "Lower Bounds for Algebraic Decision Trees",
25921 type = "Technical Report",
25922 number = "STAN-CS-80-810 (AD-A091124)",
25923 institution = inst-STAN-CS,
25924 address = inst-STAN-CS:adr,
25925 pages = "12",
25926 month = jul,
25927 year = "1980",
25928 bibdate = "Tue Nov 25 08:51:44 2025",
25929 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
25930 URL = "",
25931 acknowledgement = ack-nhfb,
25932 }
25933
25934 @TechReport{German:1980:ESD,
25935 author = "Steven M. German",
25936 title = "An extended semantic definition of {Pascal} for
25937 proving the absence of common runtime errors",
25938 type = "Technical Report",
25939 number = "STAN-CS-80-811 (PVG-18, AD-A091313)",
25940 institution = inst-STAN-CS,
25941 address = inst-STAN-CS:adr,
25942 pages = "??",
25943 month = jun,
25944 year = "1980",
25945 bibdate = "Thu Nov 20 12:11:36 MST 2025",
25946 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
25947 URL = "http://www-db.stanford.edu/TR/CS-TR-80-811.html",
25948 abstract = "We present an axiomatic definition of Pascal which is
25949 the logical basis of the Runcheck system, a working
25950 verifier for proving the absence of runtime errors such
25951 as arithmetic overflow, array subscripting out of
25952 range, and accessing an uninitialized variable. Such
25953 errors cannot be detected at compile time by most
25954 compilers. Because the occurrence of a runtime error
25955 may depend on the values of data supplied to a program,
25956 techniques for assuring the absence of errors must be
25957 based on program specifications. Runcheck accepts
25958 Pascal programs documented with assertions, and proves
25959 that the specifications are consistent with the program
25960 and that no runtime errors can occur. Our axiomatic
25961 definition is similar to Hoare's axiom system, but it
25962 takes into account certain restrictions that have not
25963 been considered in previous definitions. For instance,
25964 our definition accurately models uninitialized
25965 variables, and requires a variable to have a well
25966 defined value before it can be accessed. The logical
25967 problems of introducing the concept of uninitialized
25968 variables are discussed. Our definition of expression
25969 evaluation deals more fully with function calls than
25970 previous axiomatic definitions. Some generalizations of
25971 our semantics are presented, including a new method for
25972 verifying programs with procedure and function
25973 parameters. Our semantics can be easily adopted to
25974 similar languages, such as ADA. One of the main
25975 potential problems for the user of a verifier is the
25976 need to write detailed, repetitious assertions. We
25977 develop some simple logical properties of our
25978 definition which are exploited by Runcheck to reduce
25979 the need for such detailed assertions.",
25980 acknowledgement = ack-nhfb,
25981 remark = "No PDF in NTRL archive.",
25982 xxnumber = "CS-TR-80-811",
25983 }
25984
25985 @TechReport{Feigenbaum:1980:KEA,
25986 author = "Edward A. Feigenbaum",
25987 title = "Knowledge Engineering: The Applied Side of Artificial
25988 Intelligence",
25989 type = "Technical Report",
25990 number = "STAN-CS-80-812 (HPP-80-14)",
25991 institution = inst-STAN-CS,
25992 address = inst-STAN-CS:adr,
25993 pages = "vi + 14",
25994 month = sep,
25995 year = "1980",
25996 bibdate = "Tue Nov 25 08:51:44 2025",
25997 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
25998 URL = "https://apps.dtic.mil/sti/html/tr/ADA092574/index.html;
25999 https://apps.dtic.mil/sti/tr/pdf/ADA092574.pdf",
26000 abstract = "Expert System research in an emerging area of computer
26001 science that exploits the capabilities of computers for
26002 symbolic manipulation and inference to solve complex
26003 and difficult reasoning problems at the level of
26004 performance of human experts. The methods of this area
26005 are designed to acquire and represent both the formal
26006 and the informal knowledge that experts hold about the
26007 tasks of their discipline. Numerous applications to
26008 science, engineering, and medicine have been
26009 accomplished. Expert System projects represent applied
26010 artificial intelligence research, though they also make
26011 salient numerous fundamental research issues in the
26012 acquisition, representation and utilization of
26013 knowledge by computer programs. Knowledge engineering
26014 approaches promise significant cost savings in certain
26015 applications intelligent computer-based aids for
26016 practitioners in fields whose knowledge is primarily
26017 nonmathematical and the elucidation of the heuristic
26018 knowledge of experts --- the largely private knowledge
26019 of practice. There are major problems of knowledge
26020 engineering including the shortage of adequate computer
26021 equipment, the shortage of trained specialists in
26022 applied artificial intelligence, the scientific base
26023 for adequate knowledge acquisition, and the lack of
26024 sustained funding.",
26025 acknowledgement = ack-nhfb,
26026 pdfpages = "20",
26027 remark = "No PDF in NTRL archive. Found in DTIC archive. No
26028 abstract is present in the document, but one is
26029 supplied in the DTIC frontmatter.",
26030 }
26031
26032 @TechReport{Moravec:1980:OAN,
26033 author = "Hans Peter Moravec",
26034 title = "Obstacle Avoidance and Navigation in the Real World by
26035 a Seeing Robot Rover",
26036 type = "Technical Report",
26037 number = "STAN-CS-80-813 (AIM-340, AD-A092604)",
26038 institution = inst-STAN-CS,
26039 address = inst-STAN-CS:adr,
26040 pages = "174",
26041 month = sep,
26042 year = "1980",
26043 bibdate = "Wed Nov 26 08:55:07 2025",
26044 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
26045 URL = "",
26046 abstract = "The Stanford AI Lab cart is a card-table sized mobile
26047 robot controlled remotely through a radio link, and
26048 equipped with a TV camera and transmitter. A computer
26049 has been programmed to drive the cart through cluttered
26050 indoor and outdoor spaces, gaining its knowledge of the
26051 world entirely from images broadcast by the onboard TV
26052 system.\par
26053
26054 The cart uses several kinds of stereo to locate objects
26055 around it in 3D and t0 deduce its own A motion. It
26056 plans an obstacle avoiding path to a desired
26057 destination on the basis of a model built with this
26058 information. The plan changes as the cart perceives new
26059 obstacles on its journey.\par
26060
26061 The system is reliable for short runs, but slow. The
26062 cart moves one meter every ten to fifteen minutes, in
26063 lurches. After rolling a meter it stops, takes some
26064 pictures and thinks about them for a long time. Then it
26065 plans a new path, executes a little of it, and pauses
26066 again.\par
26067
26068 The program his successfully driven the cart through
26069 several 20 meter indoor courses (each taking about five
26070 hours) complex enough to necessitate three or four
26071 avoiding swerves. A less successful outdoor run, in
26072 which the cart skirted two obstacles but collided with
26073 a third, was also done. Harsh lighting (very bright
26074 surfaces next to very dark shadows) giving poor
26075 pictures and movement of shadows during the cart's
26076 creeping progress were major reasons for the poorer
26077 outdoor performance. The action portions of these runs
26078 were filmed by computer controlled cameras.",
26079 acknowledgement = ack-nhfb,
26080 pdfpages = "94",
26081 remark = "This is the author's Ph.D. thesis. The PDF file is
26082 OCR'ed scans of microfiche page images, most with two
26083 images per page, rotated upward by 90 degrees.",
26084 }
26085
26086 @TechReport{Aikins:1980:PPR,
26087 author = "Janice S. Aikins",
26088 title = "Prototypes and Production Rules: a Knowledge
26089 Representation for Computer Consultations",
26090 type = "Technical Report",
26091 number = "STAN-CS-80-814 (HPP-80-17, AD-A091177)",
26092 institution = inst-STAN-CS,
26093 address = inst-STAN-CS:adr,
26094 pages = "viii + 204",
26095 month = aug,
26096 year = "1980",
26097 bibdate = "Wed Nov 26 08:55:07 2025",
26098 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
26099 URL = "https://apps.dtic.mil/sti/citations/ADA091177;
26100 https://apps.dtic.mil/sti/pdfs/ADA091177.pdf",
26101 abstract = "This thesis presents a system called CENTAUR, which
26102 demonstrates the effectiveness of representing
26103 prototypical knowledge in a combination of frames and
26104 production rules for performing computer consultations.
26105 Key knowledge representation and control structure
26106 problems in production rule systems similar to MYCIN
26107 are identified, and a set of important characteristics
26108 of the structures used for representing problem-solving
26109 knowledge is given. CENTAUR's frames, or prototypes,
26110 complement the production rules to satisfy these
26111 characteristics and represent expected patterns of data
26112 that permit a more focused, hypothesis-directed
26113 approach to problem solving.\par
26114
26115 Among the characteristics identified as desirable in
26116 the representation structures are the ability to
26117 explicitly represent (a) prototypical cases, (b) the
26118 context in which knowledge is applied, and (c) the
26119 strategies for applying that knowledge. CENTAUR's
26120 prototypes consist of patterns of knowledge in the
26121 domain which serve as broad contexts, guiding the more
26122 detailed processing of the production, rules.
26123 Strategies for the consultation, or control knowledge,
26124 are represented in the prototypes separately from other
26125 kinds of domain knowledge. This allows the domain
26126 expert to specify control knowledge that is specific to
26127 each prototype. Examples are presented which
26128 demonstrate how this explicit representation
26129 facilitates explanations of the system's reasoning.
26130 Further, the organization of knowledge in CENTAUR
26131 provides a useful framework for acquiring new
26132 knowledge.\par
26133
26134 CENTAUR has been applied to the domain of pulmonary
26135 (lung) physiology in which it provides interpretations
26136 of pulmonary function tests. The prototypes represent
26137 standard pulmonary disease patterns, and the production
26138 rules serve as a stylized form of {\em attached
26139 procedure}. At the highest level, the stages of the
26140 consultation itself are represented in a consultation
26141 prototype. Thus the advantages of explicit
26142 representation apply to control of the consultation
26143 process as well.\par
26144
26145 Other important features of the representation include
26146 the use of prototypes as a standard of comparison in
26147 order to detect inconsistent or erroneous data, and the
26148 representation in production rules of domain expertise
26149 to deal with data discrepancies and diagnosis
26150 refinement.\par
26151
26152 Several experiments demonstrating the flexibility of
26153 the representation have also been performed. These
26154 Include the implementation of different top-level
26155 prototype selection strategies (confirmation,
26156 elimination, and fixed-order), and the use of a second
26157 high-level prototype which can review knowledge stored
26158 In the domain-level prototypes.",
26159 acknowledgement = ack-nhfb,
26160 advisor = "Bruce Buchanan",
26161 pdfpages = "112",
26162 remark = "This is the author's thesis. No PDF in NTRL archive.
26163 Found in DTIC archive. The PDF file is OCR'ed scans of
26164 microfiche page images, most with two images per page,
26165 rotated upward by 90 degrees.",
26166 }
26167
26168 @TechReport{Shortliffe:1980:TPM,
26169 author = "Edward H. Shortliffe",
26170 title = "Two Papers on Medical Computing --- (1) Medical
26171 Cybernetics: The Challenges of Clinical Computing, (2)
26172 Consultation Systems for Physicians: The Role of
26173 Artificial Intelligence Techniques",
26174 type = "Technical Report",
26175 number = "STAN-CS-80-815 (HPP-80-16)",
26176 institution = inst-STAN-CS,
26177 address = inst-STAN-CS:adr,
26178 pages = "56",
26179 month = jul,
26180 year = "1980",
26181 bibdate = "Wed Nov 26 08:55:07 2025",
26182 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
26183 URL = "",
26184 acknowledgement = ack-nhfb,
26185 }
26186
26187 @TechReport{Scherlis:1980:EPP,
26188 author = "William Louis Scherlis",
26189 title = "Expression Procedures and Program Derivation",
26190 type = "Technical Report",
26191 number = "STAN-CS-80-818 (AIM-341, AD-A091187)",
26192 institution = inst-STAN-CS,
26193 address = inst-STAN-CS:adr,
26194 pages = "x + 178",
26195 month = aug,
26196 year = "1980",
26197 bibdate = "Wed Nov 26 08:55:07 2025",
26198 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
26199 URL = "",
26200 abstract = "We explore techniques for systematically deriving
26201 programs from specifications. The goal of this
26202 exploration is a better understanding of the
26203 development of algorithms. Thus, the intention is not
26204 to develop a theory of programs, concerned with the
26205 analysis of existing programs, but instead to develop a
26206 theory of programming, dealing with the process of
26207 constructing new programs. Such a theory would have
26208 practical benefits both for programming methodology and
26209 for automatic program synthesis.\par
26210
26211 We investigate the derivation of programs by program
26212 transformation techniques. By expanding an ordinary
26213 language of recursion equations to include a
26214 generalized procedure construct (the expression
26215 procedure), our ability to manipulate programs in that
26216 language is greatly facilitated. The expression
26217 procedure provides a means of expressing information
26218 not just about the properties of individual program
26219 elements, but also about the way they relate to each
26220 other.\par
26221
26222 A set of three operations --- abstraction, application,
26223 and composition --- for transforming programs in this
26224 extended language is presented. We prove using
26225 operational semantics that these operations preserve
26226 the strong equivalence of programs. The well-known
26227 systems of Burstall and Darlington and of Manna and
26228 Waldinger are both based on an underlying rule system
26229 that does not have this property.\par
26230
26231 Our transformation system is illustrated with several
26232 small examples, which are examined in detail to give
26233 insight to the heuristic problems of program
26234 development. A tactic of program specialization is
26235 shown to underlie many of these derivations. While we
26236 present no implemented system, some consideration is
26237 given to issues related to the development of
26238 programming tools.",
26239 acknowledgement = ack-nhfb,
26240 advisor = "Zohar Manna",
26241 pdfpages = "101",
26242 remark = "This is the author's Ph.D. thesis. The PDF file is
26243 OCR'ed scans of microfiche page images, most with two
26244 images per page, rotated upward by 90 degrees.",
26245 }
26246
26247 @TechReport{Goad:1980:CUM,
26248 author = "Christopher Alan Goad",
26249 title = "Computational Uses of the Manipulation of Formal
26250 Proofs",
26251 type = "Technical Report",
26252 number = "STAN-CS-80-819 (AD-A091180)",
26253 institution = inst-STAN-CS,
26254 address = inst-STAN-CS:adr,
26255 pages = "vii + 122",
26256 month = aug,
26257 year = "1980",
26258 bibdate = "Wed Nov 26 08:55:07 2025",
26259 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
26260 URL = "",
26261 abstract = "Mechanical procedures for the manipulation of formal
26262 proofs have played a central role in proof theory for
26263 more than fifty years. However, such procedures have
26264 not been widely applied to computational problems. One
26265 reason for this is that work in computer science to do
26266 with formal proof systems has emphasized the use of
26267 formal proofs as evidence --- as tools for
26268 automatically establishing the truth of propositions.
26269 As a consequence of this emphasis, the problem for
26270 mechanizing the construction of proofs has received
26271 much attention, whereas the manipulation of proofs ---
26272 that is, the conversion of one form of evidence into
26273 another --- has not.\par
26274
26275 However, formal proofs can serve purposes other than
26276 the presentation of evidence. In particular, a formal
26277 proof of a proposition having the form, ``for each $x$
26278 there is a $y$ such that the relation $R$ holds between
26279 $x$ and $y$'' provides, under the right conditions, a
26280 method for computing values of $y$ from values of $x$.
26281 That is, such a proof describes an algorithm $A$ where
26282 $A$ satisfies the specification $R$ in the sense that
26283 for each $x$, $ R(x, A(x))$ holds. Thus formal proof
26284 systems can serve as programming languages ---
26285 languages for the formal description of algorithms. A
26286 proof which describes an algorithm may be ``executed''
26287 by use of any of a variety of procedures developed in
26288 proof theory.\par
26289
26290 A proof differs from more conventional descriptions of
26291 the same algorithm in that it formalizes additional
26292 information about the algorithm beyond that formalized
26293 in the conventional description. This information
26294 expands the class of transformations on the algorithm
26295 which are amenable to automation. For example, there is
26296 a class of ``pruning'' transformations which improve
26297 the computational efficiency of a natural proof
26298 regarded as a program by removing unneeded case
26299 analyses. These transformations make essential use of
26300 dependency information which finds formal expression in
26301 a proof, but not in a conventional program. Pruning is
26302 particularly useful for removing redundancies which
26303 arise when a general purpose algorithm is adapted to a
26304 special situation by symbolic execution.\par
26305
26306 This thesis concerns (1) computational uses of the
26307 additional information contained in proofs, and (2)
26308 efficient methods for the representation and
26309 transformation of proofs. An extended lambda-calculus
26310 is presented which allows compact expression of the
26311 computationally significant part of the information
26312 contained in proofs. Terms of the calculus preserve
26313 dependency data, but can be efficiently executed by an
26314 interpreter of the kind used for lambda-calculus based
26315 languages such as LISP. The calculus has been
26316 implemented on the Stanford Artificial Intelligence
26317 Laboratory PDP-10 computer. Results of experiments on
26318 the use of pruning transformations in the
26319 specialization of a bin-packing algorithm are
26320 reported.",
26321 acknowledgement = ack-nhfb,
26322 pdfpages = "132",
26323 }
26324
26325 @TechReport{vanMelle:1980:DIS,
26326 author = "William James van Melle",
26327 title = "A Domain-Independent System That Aids in Constructing
26328 Knowledge-Based Consultation Programs",
26329 type = "Technical Report",
26330 number = "STAN-CS-80-820 (HPP-80-22)",
26331 institution = inst-STAN-CS,
26332 address = inst-STAN-CS:adr,
26333 pages = "viii + 192",
26334 month = jun,
26335 year = "1980",
26336 bibdate = "Wed Nov 26 08:55:07 2025",
26337 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
26338 URL = "https://www.proquest.com/pqdtglobal/docview/303069110/",
26339 acknowledgement = ack-nhfb,
26340 advisor = "Bruce G. Buchanan",
26341 pdfpages = "202",
26342 remark = "This is the author's Ph.D. thesis. No PDF in NTRL
26343 archive. Found in Proquest database at link in URL
26344 field, but not redistributable from that source.",
26345 }
26346
26347 @TechReport{West:1980:SUC,
26348 author = "Douglas B. West and Craig A. Tovey",
26349 title = "Semiantichains and unichain coverings in direct
26350 products of partial orders",
26351 type = "Technical Report",
26352 number = "STAN-CS-80-821",
26353 institution = inst-STAN-CS,
26354 address = inst-STAN-CS:adr,
26355 pages = "??",
26356 month = sep,
26357 year = "1980",
26358 bibdate = "Thu Nov 20 12:11:36 MST 2025",
26359 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
26360 URL = "http://www-db.stanford.edu/TR/CS-TR-80-821.html",
26361 abstract = "We conjecture a generalization of Dilworth's theorem
26362 to direct products of partial orders. In particular, we
26363 conjecture that the largest ``semiantichain'' and the
26364 smallest ``unichain covering'' have the same size. We
26365 consider a special class of semiantichains and unichain
26366 coverings and determine when equality holds for them.
26367 This conjecture implies the existence of k-saturated
26368 partitions. A stronger conjecture, for which we also
26369 prove a special case, implies the Greene-Kleitman
26370 result on simultaneous k and $ (k + 1)$-saturated
26371 partitions.",
26372 acknowledgement = ack-nhfb,
26373 xxnumber = "CS-TR-80-821",
26374 }
26375
26376 @TechReport{Aspvall:1980:EAC,
26377 author = "Bengt Aspvall",
26378 title = "Efficient Algorithms for Certain Satisfiability and
26379 Linear Programming Problems",
26380 type = "Technical Report",
26381 number = "STAN-CS-80-822",
26382 institution = inst-STAN-CS,
26383 address = inst-STAN-CS:adr,
26384 pages = "59",
26385 month = sep,
26386 year = "1980",
26387 bibdate = "Wed Nov 26 08:55:07 2025",
26388 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
26389 URL = "",
26390 acknowledgement = ack-nhfb,
26391 remark = "This is the author's thesis.",
26392 }
26393
26394 @TechReport{Shaw:1980:KBR,
26395 author = "David Elliot Shaw",
26396 title = "Knowledge-Based Retrieval on a Relational Database
26397 Machine",
26398 type = "Technical Report",
26399 number = "STAN-CS-80-823",
26400 institution = inst-STAN-CS,
26401 address = inst-STAN-CS:adr,
26402 pages = "280",
26403 month = aug,
26404 year = "1980",
26405 bibdate = "Wed Nov 26 08:55:07 2025",
26406 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
26407 URL = "",
26408 acknowledgement = ack-nhfb,
26409 }
26410
26411 @TechReport{Mei:1980:LLC,
26412 author = "Tung Yun Mei",
26413 title = "{LCCD}, a language for {Chinese} character design",
26414 type = "Technical Report",
26415 number = "STAN-CS-80-824",
26416 institution = inst-STAN-CS,
26417 address = inst-STAN-CS:adr,
26418 pages = "??",
26419 month = oct,
26420 year = "1980",
26421 bibdate = "Thu Nov 20 12:11:36 MST 2025",
26422 bibsource = "https://www.math.utah.edu/pub/tex/bib/font.bib;
26423 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
26424 URL = "http://www-db.stanford.edu/TR/CS-TR-80-824.html",
26425 abstract = "LCCD is a computer system able to produce
26426 aesthetically pleasing Chinese characters for use on
26427 raster-oriented printing devices. It is analogous to
26428 METAFONT, in that the user writes a little program that
26429 explains how to draw each character; but it uses
26430 different types of simulated 'pens' that are more
26431 appropriate to the Chinese idiom, and it includes
26432 special scaling features so that a complex character
26433 can easily be built up from simpler ones, in an
26434 interactive manner. This report contains a user's
26435 manual for LCCD, together with many illustrative
26436 examples and a discussion of the algorithms used.",
26437 acknowledgement = ack-nhfb,
26438 xxnumber = "CS-TR-80-824",
26439 }
26440
26441 @TechReport{Schnorr:1980:RAI,
26442 author = "C. P. Schnorr",
26443 title = "Refined Analysis and Improvements on Some Factoring
26444 Algorithm",
26445 type = "Technical Report",
26446 number = "STAN-CS-80-825",
26447 institution = inst-STAN-CS,
26448 address = inst-STAN-CS:adr,
26449 pages = "30",
26450 month = nov,
26451 year = "1980",
26452 bibdate = "Wed Nov 26 08:55:07 2025",
26453 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
26454 URL = "",
26455 acknowledgement = ack-nhfb,
26456 }
26457
26458 @TechReport{Wiederhold:1980:DAC,
26459 author = "Gio Wiederhold and Anne Beetem and Garrett Short",
26460 title = "A database approach to communication in {VLSI}
26461 design",
26462 type = "Technical Report",
26463 number = "STAN-CS-80-826",
26464 institution = inst-STAN-CS,
26465 address = inst-STAN-CS:adr,
26466 pages = "??",
26467 month = oct,
26468 year = "1980",
26469 bibdate = "Thu Nov 20 12:11:36 MST 2025",
26470 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
26471 URL = "http://www-db.stanford.edu/TR/CS-TR-80-826.html",
26472 abstract = "This paper describes recent and planned work at
26473 Stanford in applying database technology to the
26474 problems of VLSI design. In particular, it addresses
26475 the issue of communication within a design's different
26476 representations and hierarchical levels in a multiple
26477 designer environment. We demonstrate the heretofore
26478 questioned utility of using commercial database
26479 systems, at least while developing a versatile,
26480 flexible, and generally efficient model and its
26481 associated communication paths. Completed work and
26482 results from initial work using DEC DBMS-20 is
26483 presented, including macro expansion within the
26484 database, and signalling of changes to higher
26485 structural levels. Considerable discussion regarding
26486 overall philosophy for continued work is also
26487 included.",
26488 acknowledgement = ack-nhfb,
26489 xxnumber = "CS-TR-80-826",
26490 }
26491
26492 @TechReport{Yao:1980:PCK,
26493 author = "Andrew Chi-Chih Yao",
26494 title = "On the parallel computation for the knapsack problem",
26495 type = "Technical Report",
26496 number = "STAN-CS-80-827",
26497 institution = inst-STAN-CS,
26498 address = inst-STAN-CS:adr,
26499 pages = "??",
26500 month = nov,
26501 year = "1980",
26502 bibdate = "Thu Nov 20 12:11:36 MST 2025",
26503 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
26504 URL = "http://www-db.stanford.edu/TR/CS-TR-80-827.html",
26505 abstract = "We are interested in the complexity of solving the
26506 knapsack problem with n input real numbers on a
26507 parallel computer with real arithmetic and branching
26508 operations. A processor-time tradeoff constraint is
26509 derived; in particular, it is shown that an exponential
26510 number of processors have to be used if the problem is
26511 to be solved in time $ t \leq \sqrt {n} / 2 $.",
26512 acknowledgement = ack-nhfb,
26513 xxnumber = "CS-TR-80-827",
26514 }
26515
26516 @TechReport{Knuth:1980:BPL,
26517 author = "Donald E. Knuth and Michael F. Plass",
26518 title = "Breaking Paragraphs Into Lines",
26519 type = "Technical Report",
26520 number = "STAN-CS-80-828",
26521 institution = inst-STAN-CS,
26522 address = inst-STAN-CS:adr,
26523 pages = "66",
26524 month = nov,
26525 year = "1980",
26526 DOI = "https://doi.org/10.1002/spe.4380111102",
26527 bibdate = "Wed Nov 26 08:55:07 2025",
26528 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
26529 URL = "",
26530 acknowledgement = ack-nhfb,
26531 remark = "Published in \booktitle{Software --- Practice and
26532 Experience}, {\bf 11}(11) 1119--1184, November 1981.
26533 doi:10.1002/spe.4380111102.",
26534 }
26535
26536 @TechReport{Aspvall:1980:DTP,
26537 author = "Bengt Aspvall and Frank M. Liang",
26538 title = "The dinner table problem",
26539 type = "Technical Report",
26540 number = "STAN-CS-80-829",
26541 institution = inst-STAN-CS,
26542 address = inst-STAN-CS:adr,
26543 pages = "13",
26544 month = dec,
26545 year = "1980",
26546 bibdate = "Thu Nov 20 12:11:36 MST 2025",
26547 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
26548 URL = "http://www-db.stanford.edu/TR/CS-TR-80-829.html",
26549 abstract = "This report contains two papers inspired by the
26550 ``dinner table problem'': If n people are seated
26551 randomly around a circular table for two meals, what is
26552 the probability that no two people sit together at both
26553 meals? We show that this probability approaches $
26554 e^{-2} $ as $ n \rightarrow \infty $, and also give a
26555 closed form. We then observe that in many similar
26556 problems on permutations with restricted position, the
26557 number of permutations satisfying a given number of
26558 properties is approximately Poisson distributed. We
26559 generalize our asymptotic argument to prove such a
26560 limit theorem, and mention applications to the problems
26561 of derangements, menages, and the asymptotic number of
26562 Latin rectangles.",
26563 acknowledgement = ack-nhfb,
26564 xxnumber = "CS-TR-80-829",
26565 }
26566
26567 @TechReport{Matula:1980:TLT,
26568 author = "David W. Matula and Yossi Shiloach and Robert E.
26569 Tarjan",
26570 title = "Two linear-time algorithms for five-coloring a planar
26571 graph",
26572 type = "Technical Report",
26573 number = "STAN-CS-80-830",
26574 institution = inst-STAN-CS,
26575 address = inst-STAN-CS:adr,
26576 pages = "??",
26577 month = nov,
26578 year = "1980",
26579 bibdate = "Thu Nov 20 12:11:36 MST 2025",
26580 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
26581 URL = "http://www-db.stanford.edu/TR/CS-TR-80-830.html",
26582 abstract = "A ``sequential processing'' algorithm using bicolor
26583 interchange that five-colors an n vertex planar graph
26584 in $ O(n^2) $ time was given by Matula, Marble, and
26585 Isaacson [1972]. Lipton and Miller used a ``batch
26586 processing'' algorithm with bicolor interchange for the
26587 same problem and achieved an improved $ O(n \log n) $
26588 time bound [1978]. In this paper we use graph
26589 contraction arguments instead of bicolor interchange
26590 and improve both the sequential processing and batch
26591 processing methods to obtain five-coloring algorithms
26592 that operate in O(n) time.",
26593 acknowledgement = ack-nhfb,
26594 xxnumber = "CS-TR-80-830",
26595 }
26596
26597 @TechReport{Sleator:1980:AMN,
26598 author = "Daniel D. K. Sleator",
26599 title = "An {$ O(n m \log n) $} Algorithm for Maximum Network
26600 Flow",
26601 type = "Technical Report",
26602 number = "STAN-CS-80-831",
26603 institution = inst-STAN-CS,
26604 address = inst-STAN-CS:adr,
26605 pages = "81",
26606 month = dec,
26607 year = "1980",
26608 bibdate = "Wed Nov 26 08:55:07 2025",
26609 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
26610 URL = "",
26611 acknowledgement = ack-nhfb,
26612 }
26613
26614 @TechReport{Dolev:1980:SWG,
26615 author = "Danny Dolev",
26616 title = "Scheduling wide graphs",
26617 type = "Technical Report",
26618 number = "STAN-CS-80-832",
26619 institution = inst-STAN-CS,
26620 address = inst-STAN-CS:adr,
26621 pages = "??",
26622 month = dec,
26623 year = "1980",
26624 bibdate = "Thu Nov 20 12:11:36 MST 2025",
26625 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
26626 URL = "http://www-db.stanford.edu/TR/CS-TR-80-832.html",
26627 abstract = "The problem of scheduling a partially ordered set of
26628 unit length tasks on m identical processors is known to
26629 be NP-complete. There are efficient algorithms for only
26630 a few special cases of this problem. In this paper we
26631 explore the relations between the structure of the
26632 precedence graph (the partial order) and optimal
26633 schedules. We prove that in finding an optimal schedule
26634 for certain systems it suffices to consider at each
26635 step high roots which belong to at most the m-1 highest
26636 components of the precedence graph. This result reduces
26637 the number of cases we have to check during the
26638 construction of an optimal schedule. Our method may
26639 lead to the development of linear scheduling algorithms
26640 for many practical cases and to better bounds for
26641 complex algorithms. In particular, in the case the
26642 precedence graph contains only inforest and outforest
26643 components, this result leads to efficient algorithms
26644 for obtaining an optimal schedule on two or three
26645 processors.",
26646 acknowledgement = ack-nhfb,
26647 xxnumber = "CS-TR-80-832",
26648 }
26649
26650 @TechReport{Gilbert:1980:GST,
26651 author = "John Russell Gilbert",
26652 title = "Graph Separator Theorems and Sparse {Gaussian}
26653 Elimination",
26654 type = "Technical Report",
26655 number = "STAN-CS-80-833",
26656 institution = inst-STAN-CS,
26657 address = inst-STAN-CS:adr,
26658 pages = "104",
26659 month = dec,
26660 year = "1980",
26661 bibdate = "Wed Nov 26 12:13:45 MST 2025",
26662 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
26663 URL = "",
26664 acknowledgement = ack-nhfb,
26665 remark = "This is the author's thesis.",
26666 }
26667
26668 @TechReport{Bjorstad:1980:NSB,
26669 author = "Petter E. Bj{\o}rstad",
26670 title = "Numerical Solution of the Biharmonic Equation",
26671 type = "Technical Report",
26672 number = "STAN-CS-80-834 (SU326 P3070)",
26673 institution = inst-STAN-CS,
26674 address = inst-STAN-CS:adr,
26675 pages = "139",
26676 month = dec,
26677 year = "1980",
26678 bibdate = "Wed Nov 26 12:13:45 MST 2025",
26679 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
26680 URL = "https://apps.dtic.mil/sti/tr/pdf/ADA104084.pdf",
26681 abstract = "The numerical solution of discrete approximations to
26682 the first biharmonic boundary value problem in
26683 rectangular domains is studied. Several finite
26684 difference schemes are compared and a family of new
26685 fast algorithms for the solution of the discrete
26686 systems is developed. These methods are optimal, having
26687 a theoretical computational complexity of $ O(N^2) $
26688 arithmetic operations and requiring $ N^2 + O(N) $
26689 storage locations when solving the problem on an $N$ by
26690 $N$ grid. Several practical computer implementations of
26691 the algorithm are discussed and compared. These
26692 implementations require $ a N^2 + b N^2 \log N$
26693 arithmetic operations with $ b \ll a$. The algorithms
26694 take full advantage of vector or parallel computers and
26695 can also be used to solve a sequence of problems
26696 efficiently. A new fast direct method for the
26697 biharmonic problem on a disk is also developed. It is
26698 shown how the new method of solution is related to the
26699 associated eigenvalue problem. The results of extensive
26700 numerical tests and comparisons are included throughout
26701 the dissertation.\par
26702
26703 It is believed that the material presented provides a
26704 good foundation for practical computer implementations
26705 and that the numerical solution of the biharmonic
26706 equation in rectangular domains from now on, will be
26707 considered no more difficult than Poisson's equation.",
26708 acknowledgement = ack-nhfb,
26709 remark = "This is the author's thesis. The PDF file is OCR'ed
26710 scans of microfiche page images.",
26711 }
26712
26713 @TechReport{Grosse:1980:AOE,
26714 author = "Eric H. Grosse",
26715 title = "Approximation and Optimization of Electron Density
26716 Maps",
26717 type = "Technical Report",
26718 number = "STAN-CS-80-835",
26719 institution = inst-STAN-CS,
26720 address = inst-STAN-CS:adr,
26721 pages = "118",
26722 month = dec,
26723 year = "1980",
26724 bibdate = "Wed Nov 26 12:13:45 MST 2025",
26725 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
26726 URL = "",
26727 acknowledgement = ack-nhfb,
26728 remark = "This is the author's thesis.",
26729 }
26730
26731 @TechReport{Spector:1980:PRO,
26732 author = "Alfred Z. Spector",
26733 title = "Performing remote operations efficiently on a local
26734 computer network",
26735 type = "Technical Report",
26736 number = "STAN-CS-80-850 (CSL 81-207)",
26737 institution = inst-STAN-CS,
26738 address = inst-STAN-CS:adr,
26739 pages = "23",
26740 month = dec,
26741 year = "1980",
26742 bibdate = "Thu Nov 20 12:11:36 MST 2025",
26743 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
26744 URL = "http://www-db.stanford.edu/TR/CS-TR-80-850.html",
26745 abstract = "This paper presents a communication model for local
26746 networks, whereby processes execute generalized remote
26747 references that cause operations to be performed by
26748 remote processes. This remote reference/remote
26749 operation model provides a taxonomy of primitives that
26750 (1) are naturally useful in many applications and (2)
26751 can be efficiently implemented. The motivation for this
26752 work is our desire to develop systems architectures for
26753 local network based multiprocessors that support
26754 distributed applications requiring frequent
26755 interprocessor communication. After a section
26756 containing a brief overview, Section 2 of this paper
26757 discusses the remote reference/remote operation model.
26758 In it, we derive a set of remote reference types that
26759 can be supported by a communication system carefully
26760 integrated with the local network interface. The third
26761 section exemplifies a communication system that
26762 provides one remote reference type. These references
26763 (i.e., remote load, store, compare-and-swap, enqueue,
26764 and dequeue) take about 150 microseconds, or 50 average
26765 instruction times, to perform on Xerox Alto computers
26766 connected by a 2.94 megabit Ethernet. The last section
26767 summarizes this work and proposes a complete
26768 implementation resulting in a highly efficient
26769 communication system.",
26770 acknowledgement = ack-nhfb,
26771 xxnumber = "CS-TR-80-850",
26772 }
26773
26774 @TechReport{Genesereth:1980:RPI,
26775 author = "Michael R. Genesereth",
26776 title = "The Role of Plans In Intelligent Teaching Systems",
26777 type = "Technical Report",
26778 number = "STAN-CS-81-842",
26779 institution = inst-STAN-CS,
26780 address = inst-STAN-CS:adr,
26781 pages = "19",
26782 month = nov,
26783 year = "1980",
26784 bibdate = "Wed Nov 26 12:13:45 MST 2025",
26785 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
26786 URL = "",
26787 acknowledgement = ack-nhfb,
26788 }
26789
26790 @TechReport{Hailpern:1980:VCP,
26791 author = "Brent T. Hailpern",
26792 title = "Verifying Concurrent Processes Using Temporal Logic",
26793 type = "Technical Report",
26794 number = "STAN-CS-82-942",
26795 institution = inst-STAN-CS,
26796 address = inst-STAN-CS:adr,
26797 pages = "114",
26798 month = aug,
26799 year = "1980",
26800 bibdate = "Wed Nov 26 12:13:45 MST 2025",
26801 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
26802 URL = "",
26803 acknowledgement = ack-nhfb,
26804 remark = "This is the author's thesis.",
26805 }
26806
26807 @TechReport{Manna:1981:TVCa,
26808 author = "Zohar Manna and Amir Pnueli",
26809 title = "Verification of concurrent programs, {Part I}: The
26810 temporal framework",
26811 type = "Technical Report",
26812 number = "STAN-CS-81-836",
26813 institution = inst-STAN-CS,
26814 address = inst-STAN-CS:adr,
26815 pages = "ii + 62",
26816 month = jun,
26817 year = "1981",
26818 bibdate = "Thu Nov 20 12:11:36 MST 2025",
26819 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
26820 URL = "http://www-db.stanford.edu/TR/CS-TR-81-836.html",
26821 abstract = "This is the first in a series of reports describing
26822 the application of temporal logic to the specification
26823 and verification of concurrent programs. We first
26824 introduce temporal logic as a tool for reasoning about
26825 sequences of states. Models of concurrent programs
26826 based both on transition graphs and on linear-text
26827 representations are presented and the notions of
26828 concurrent and fair executions are defined. The general
26829 temporal language is then specialized to reason about
26830 those execution sequences that are fair computations of
26831 a concurrent program. Subsequently, the language is
26832 used to describe properties of concurrent programs. The
26833 set of interesting properties is classified into
26834 invariance (safety), eventuality (liveness), and
26835 precedence (until) properties. Among the properties
26836 studied are: partial correctness, global invariance,
26837 clean behavior, mutual exclusion, absence of deadlock,
26838 termination, total correctness, intermittent
26839 assertions, accessibility, responsiveness, safe
26840 liveness, absence of unsolicited response, fair
26841 responsiveness, and precedence. In the following
26842 reports of this series, we will use the temporal
26843 formalism to develop proof methodologies for proving
26844 the properties discussed here.",
26845 acknowledgement = ack-nhfb,
26846 pdfpages = "65",
26847 xxnumber = "CS-TR-81-836",
26848 }
26849
26850 @TechReport{Buchanan:1981:RES,
26851 author = "Bruce G. Buchanan",
26852 title = "Research on Expert Systems",
26853 type = "Technical Report",
26854 number = "STAN-CS-81-837",
26855 institution = inst-STAN-CS,
26856 address = inst-STAN-CS:adr,
26857 pages = "iv + 38",
26858 month = mar,
26859 year = "1981",
26860 bibdate = "Thu Nov 20 12:11:36 MST 2025",
26861 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
26862 URL = "http://www-db.stanford.edu/TR/CS-TR-81-837.html",
26863 abstract = "All AI programs are essentially reasoning programs.
26864 And, to the extent that they reason well about a
26865 problem area, all exhibit some expertise at problem
26866 solving. Programs that solve the Tower of Hanoi puzzle,
26867 for example, reason about the goal state and the
26868 initial state in order to find ``expert-level''
26869 solutions. Unlike other programs, however, the claims
26870 about expert systems are related to questions of
26871 usefulness and understandability as well as
26872 performance.",
26873 acknowledgement = ack-nhfb,
26874 pdfpages = "42",
26875 xxnumber = "CS-TR-81-837",
26876 }
26877
26878 @TechReport{Brown:1981:DPB,
26879 author = "Peter Brown",
26880 title = "Dynamic Program Building",
26881 type = "Technical Report",
26882 number = "STAN-CS-81-838",
26883 institution = inst-STAN-CS,
26884 address = inst-STAN-CS:adr,
26885 pages = "13",
26886 month = feb,
26887 year = "1981",
26888 bibdate = "Thu Nov 20 12:11:36 MST 2025",
26889 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
26890 URL = "http://www-db.stanford.edu/TR/CS-TR-81-838.html",
26891 abstract = "This report argues that programs are better regarded
26892 as dynamic running objects rather than as static
26893 textual ones. The concept of dynamic building, whereby
26894 a program is constructed as it runs, is described. The
26895 report then describes the Build system, which is an
26896 implementation of dynamic building for an interactive
26897 algebraic programming language. Dynamic building aids
26898 the locating of run-time errors, and is especially
26899 valuable in environments where programs are relatively
26900 short but run-time errors are frequent and/or costly.",
26901 acknowledgement = ack-nhfb,
26902 xxnumber = "CS-TR-81-838",
26903 }
26904
26905 @TechReport{Samuel:1981:SW,
26906 author = "Arthur L. Samuel",
26907 title = "Short {WAITS}",
26908 type = "Technical Report",
26909 number = "STAN-CS-81-839",
26910 institution = inst-STAN-CS,
26911 address = inst-STAN-CS:adr,
26912 pages = "ix + 33",
26913 month = feb,
26914 year = "1981",
26915 bibdate = "Thu Nov 20 12:11:36 MST 2025",
26916 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
26917 URL = "http://i.stanford.edu/pub/cstr/reports/cs/tr/81/839/CS-TR-81-839.pdf;
26918 http://www-db.stanford.edu/TR/CS-TR-81-839.html",
26919 abstract = "This is an introductory manual describing the SU-AI
26920 timesharing system that is available primarily for
26921 sponsored research in the Computer Science Department.
26922 The present manual is written for the beginner and the
26923 user interested primarily in the message handling
26924 capability as well as for the experienced computer user
26925 and programmer who either is unfamiliar with the SU-AI
26926 computer or who uses it infrequently. References are
26927 made to the available hard-copy manuals and to the
26928 extensive on-line document files where more complete
26929 information can be obtained. The principal advantages
26930 of this system are: (1) The availability of a large
26931 repertoire of useful system features; (2) The large
26932 memory; (3) The large file storage system; (4) The ease
26933 with which one can access other computers via the ARPA
26934 net; (5) The file transfer facilities via the EFTP
26935 program and the ETHERNET; (6) The XGP and the DOVER
26936 printers and the large collections of fonts available
26937 for them; and (7) The fast and convenient E editor with
26938 its macro facilities.",
26939 acknowledgement = ack-nhfb,
26940 author-dates = "Arthur Lee Samuel (5 December 1901--29 July 1990)",
26941 xxnumber = "CS-TR-81-839",
26942 }
26943
26944 @TechReport{Knuth:1981:VLL,
26945 author = "Donald E. Knuth",
26946 title = "Verification of Link-Level Protocols",
26947 type = "Technical Report",
26948 number = "STAN-CS-81-840",
26949 institution = inst-STAN-CS,
26950 address = inst-STAN-CS:adr,
26951 pages = "iii + 6",
26952 month = jan,
26953 year = "1981",
26954 DOI = "https://doi.org/10.1007/BF01934068",
26955 bibdate = "Wed Nov 26 12:13:45 MST 2025",
26956 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
26957 URL = "https://apps.dtic.mil/sti/pdfs/ADA099140.pdf",
26958 abstract = "Stein Krogdahl [1] has given an interesting
26959 demonstration of the partial correctness of a protocol
26960 skeleton, by which the validity of the essential
26961 aspects of a large variety of data transmission schemes
26962 can be demonstrated. The purpose of this note is to
26963 present a simpler way to obtain the same results, by
26964 first establishing the validity of a less efficient
26965 skeleton and then optimizing the algorithms. The
26966 present approach, which was introduced for a particular
26967 protocol by N. V. Stenning [2], also solves a wider
26968 class of problems that do not require
26969 first-in-first-out transmissions",
26970 acknowledgement = ack-nhfb,
26971 pdfpages = "9",
26972 remark-1 = "Published in \booktitle{BIT} {\bf 21}(1) 31--36, March
26973 1981. doi:10.1007/BF01934068.",
26974 remark-2 = "The PDF file is OCR'ed scans of microfiche page
26975 images.",
26976 }
26977
26978 @TechReport{Knuth:1981:HAA,
26979 author = "Donald E. Knuth",
26980 title = "{Huffman}'s Algorithm via Algebra",
26981 type = "Technical Report",
26982 number = "STAN-CS-81-841 (AD-A099103)",
26983 institution = inst-STAN-CS,
26984 address = inst-STAN-CS:adr,
26985 pages = "ii + 6",
26986 month = mar,
26987 year = "1981",
26988 bibdate = "Wed Nov 26 12:13:45 MST 2025",
26989 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
26990 URL = "https://apps.dtic.mil/sti/tr/pdf/ADA099103.pdf",
26991 abstract = "The well known algorithm of David A. Huffman for
26992 finding minimum redundancy codes has found many diverse
26993 applications, and in recent years it has been extended
26994 in a variety of ways. The purpose of this note is to
26995 discuss a simple algebraic approach that seems to fit
26996 essentially all of the applications of Huffman's method
26997 that are presently known.",
26998 acknowledgement = ack-nhfb,
26999 pdfpages = "8",
27000 }
27001
27002 @TechReport{Manna:1981:TVCb,
27003 author = "Zohar Manna and Amir Pnueli",
27004 title = "Temporal Verification of Concurrent Programs, {Part
27005 II}: Proving Invariances",
27006 type = "Technical Report",
27007 number = "STAN-CS-81-843",
27008 institution = inst-STAN-CS,
27009 address = inst-STAN-CS:adr,
27010 pages = "30",
27011 month = mar,
27012 year = "1981",
27013 bibdate = "Wed Nov 26 12:13:45 MST 2025",
27014 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
27015 URL = "",
27016 acknowledgement = ack-nhfb,
27017 }
27018
27019 @TechReport{Anonymous:1981:NPa,
27020 author = "Anonymous",
27021 title = "{NEVER PRINTED}",
27022 type = "Technical Report",
27023 number = "STAN-CS-81-844",
27024 institution = inst-STAN-CS,
27025 address = inst-STAN-CS:adr,
27026 pages = "??",
27027 month = "???",
27028 year = "1981",
27029 bibdate = "Wed Nov 26 08:55:07 2025",
27030 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
27031 URL = "",
27032 acknowledgement = ack-nhfb,
27033 }
27034
27035 @TechReport{Anonymous:1981:NPb,
27036 author = "Anonymous",
27037 title = "{NEVER PRINTED}",
27038 type = "Technical Report",
27039 number = "STAN-CS-81-845",
27040 institution = inst-STAN-CS,
27041 address = inst-STAN-CS:adr,
27042 pages = "??",
27043 month = "???",
27044 year = "1981",
27045 bibdate = "Wed Nov 26 08:55:07 2025",
27046 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
27047 URL = "",
27048 acknowledgement = ack-nhfb,
27049 }
27050
27051 @TechReport{Dolev:1981:BGS,
27052 author = "Danny Dolev",
27053 title = "The {Byzantine Generals} Strike Again",
27054 type = "Technical Report",
27055 number = "STAN-CS-81-846",
27056 institution = inst-STAN-CS,
27057 address = inst-STAN-CS:adr,
27058 pages = "26",
27059 month = mar,
27060 year = "1981",
27061 bibdate = "Thu Nov 20 12:11:36 MST 2025",
27062 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
27063 URL = "http://www-db.stanford.edu/TR/CS-TR-81-846.html",
27064 abstract = "Can unanimity be achieved in an unreliable distributed
27065 system? This problem was named ``The Byzantine Generals
27066 Problem,'' by Lamport, Pease and Shostak [1980]. The
27067 results obtained in the present paper prove that
27068 unanimity is achievable in any distributed system if
27069 and only if the number of faulty processors in the
27070 system is: (1) less than one third of the total number
27071 of processors; and (2) less than one half of the
27072 connectivity of the system's network. In cases where
27073 unanimity is achievable, algorithms to obtain it are
27074 given. This result forms a complete characterization of
27075 networks in light of the Byzantine Problem.",
27076 acknowledgement = ack-nhfb,
27077 xxnumber = "CS-TR-81-846",
27078 }
27079
27080 @TechReport{Korth:1981:OLP,
27081 author = "Henry F. Korth",
27082 title = "The optimal locking problem in a directed acyclic
27083 graph",
27084 type = "Technical Report",
27085 number = "STAN-CS-81-847",
27086 institution = inst-STAN-CS,
27087 address = inst-STAN-CS:adr,
27088 pages = "6",
27089 month = mar,
27090 year = "1981",
27091 bibdate = "Thu Nov 20 12:11:36 MST 2025",
27092 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
27093 URL = "http://www-db.stanford.edu/TR/CS-TR-81-847.html",
27094 abstract = "We assume a multiple granularity database locking
27095 scheme similar to that of Gray, et al. [197S] in which
27096 a rooted directed acyclic graph is used to represent
27097 the levels of granularity. We prove that even if it is
27098 known in advance exactly what database references the
27099 transaction will make, it is NP-complete to find the
27100 optimal locking strategy for the transaction.",
27101 acknowledgement = ack-nhfb,
27102 xxnumber = "CS-TR-81-847",
27103 }
27104
27105 @TechReport{Tang:1981:PIC,
27106 author = "Chih-sung Tang",
27107 title = "On the Problem of Inputting {Chinese} Characters",
27108 type = "Technical Report",
27109 number = "STAN-CS-81-848",
27110 institution = inst-STAN-CS,
27111 address = inst-STAN-CS:adr,
27112 pages = "9",
27113 month = apr,
27114 year = "1981",
27115 bibdate = "Thu Nov 20 12:11:36 MST 2025",
27116 bibsource = "https://www.math.utah.edu/pub/tex/bib/font.bib;
27117 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
27118 URL = "http://www-db.stanford.edu/TR/CS-TR-81-848.html",
27119 abstract = "If Chinese-speaking society is to make the best use of
27120 computers, it is important to develop an easy, quick,
27121 and convenient way to input Chinese characters together
27122 with other conventional characters. Many people have
27123 tried to approach this problem by designing special
27124 typewriters for Chinese character input, but such
27125 methods have serious deficiencies and they do not take
27126 advantage of the fact that the input process is just
27127 part of a larger system in which a powerful computer
27128 lies behind the keyboard. The purpose of this note is
27129 to clarify the problem and to illustrate a promising
27130 solution based entirely on a standard ASCII keyboard.",
27131 acknowledgement = ack-nhfb,
27132 xxnumber = "CS-TR-81-848",
27133 }
27134
27135 @TechReport{Nishigaki:1981:EKC,
27136 author = "Tohru Nishigaki",
27137 title = "Experiments on the {Knee Criterion} in a
27138 multiprogrammed computer system",
27139 type = "Technical Report",
27140 number = "STAN-CS-81-849 (CSL 81-205)",
27141 institution = inst-STAN-CS,
27142 address = inst-STAN-CS:adr,
27143 pages = "28",
27144 month = mar,
27145 year = "1981",
27146 bibdate = "Thu Nov 20 12:11:36 MST 2025",
27147 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
27148 URL = "http://www-db.stanford.edu/TR/CS-TR-81-849.html",
27149 abstract = "Although the effectiveness of the Knee Criterion as a
27150 virtual memory management strategy is widely accepted,
27151 it has been impossible to take advantage of it in a
27152 practical system, because little information is
27153 available about the program behavior of executing jobs.
27154 A new memory management technique to achieve the Knee
27155 Criterion in a multiprogrammed virtual memory system is
27156 developed. The technique, termed the Optimum
27157 Working-set Estimator (OWE), abstracts the programs'
27158 behavior from their past histories by exponential
27159 smoothing, and modifies their working set window sizes
27160 in order to attain the Knee Criterion. The OWE method
27161 was implemented and investigated. Measurements
27162 demonstrate its ability to control a variety of jobs.
27163 Furthermore, the results also reveal that the
27164 throughput improvement is possible in a space-squeezing
27165 environment. This technique is expected to increase the
27166 efficiency of multiprogrammed virtual memory systems.",
27167 acknowledgement = ack-nhfb,
27168 xxnumber = "CS-TR-81-849",
27169 }
27170
27171 @TechReport{Wiederhold:1981:BIP,
27172 author = "Gio Wiederhold",
27173 title = "Binding in Information Processing",
27174 type = "Technical Report",
27175 number = "STAN-CS-81-851",
27176 institution = inst-STAN-CS,
27177 address = inst-STAN-CS:adr,
27178 pages = "41",
27179 month = may,
27180 year = "1981",
27181 bibdate = "Thu Nov 20 12:11:36 MST 2025",
27182 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
27183 URL = "http://www-db.stanford.edu/TR/CS-TR-81-851.html",
27184 abstract = "The concept of binding, as used in programming
27185 systems, is analyzed and defined in a number of
27186 contexts. The attributes of variables to be bound and
27187 the phases of binding are enumerated. The definition is
27188 then broadened to cover general issues in information
27189 systems. Its applicability is demonstrated in a wide
27190 range of system design and implementation issues. A
27191 number of Database Management Systems are categorized
27192 according to the terms defined. A first-order
27193 quantitative model is developed and compared with
27194 current practice. The concepts and the model are
27195 considered helpful when used as a tool for the global
27196 design phase of large information systems.",
27197 acknowledgement = ack-nhfb,
27198 xxnumber = "CS-TR-81-851",
27199 }
27200
27201 @TechReport{Ullman:1981:VDR,
27202 author = "Jeffrey D. Ullman",
27203 title = "A View of Directions in Relational Database Theory",
27204 type = "Technical Report",
27205 number = "STAN-CS-81-852",
27206 institution = inst-STAN-CS,
27207 address = inst-STAN-CS:adr,
27208 pages = "9",
27209 month = may,
27210 year = "1981",
27211 bibdate = "Wed Nov 26 12:13:45 MST 2025",
27212 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
27213 URL = "",
27214 acknowledgement = ack-nhfb,
27215 }
27216
27217 @TechReport{Maier:1981:CAH,
27218 author = "David Maier and Jeffrey D. Ullman",
27219 title = "Connections in Acyclic Hypergraphs",
27220 type = "Technical Report",
27221 number = "STAN-CS-81-853",
27222 institution = inst-STAN-CS,
27223 address = inst-STAN-CS:adr,
27224 pages = "10",
27225 month = may,
27226 year = "1981",
27227 bibdate = "Wed Nov 26 12:13:45 MST 2025",
27228 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
27229 URL = "",
27230 acknowledgement = ack-nhfb,
27231 }
27232
27233 @TechReport{Dolev:1981:SPK,
27234 author = "Danny Dolev and Andrew C. Yao",
27235 title = "On the Security of Public Key Protocols",
27236 type = "Technical Report",
27237 number = "STAN-CS-81-854",
27238 institution = inst-STAN-CS,
27239 address = inst-STAN-CS:adr,
27240 pages = "22",
27241 month = may,
27242 year = "1981",
27243 bibdate = "Thu Nov 20 12:11:36 MST 2025",
27244 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
27245 URL = "http://www-db.stanford.edu/TR/CS-TR-81-854.html",
27246 abstract = "Recently, the use of public key encryption to provide
27247 secure network communication has received considerable
27248 attention. Such public key systems are usually
27249 effective against passive eavesdroppers, who merely tap
27250 the lines and try to decipher the message. It has been
27251 pointed out, however, that an improperly designed
27252 protocol could be vulnerable to an active saboteur, one
27253 who may impersonate another user or alter the message
27254 being transmitted. In this paper we formulate several
27255 models in which the security of protocols can be
27256 discussed precisely. Algorithms and characterizations
27257 that can be used to determine protocol security in
27258 these models will be given.",
27259 acknowledgement = ack-nhfb,
27260 xxnumber = "CS-TR-81-854",
27261 }
27262
27263 @TechReport{Manna:1981:DSU,
27264 author = "Zohar Manna and Richard Waldinger",
27265 title = "Deductive Synthesis of the Unification Algorithm",
27266 type = "Technical Report",
27267 number = "STAN-CS-81-855",
27268 institution = inst-STAN-CS,
27269 address = inst-STAN-CS:adr,
27270 pages = "51",
27271 month = jun,
27272 year = "1981",
27273 bibdate = "Wed Nov 26 12:13:45 MST 2025",
27274 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
27275 URL = "",
27276 acknowledgement = ack-nhfb,
27277 }
27278
27279 @TechReport{Gabriel:1981:OPF,
27280 author = "Richard Paul Gabriel",
27281 title = "An Organization for Programs in Fluid Domains",
27282 type = "Technical Report",
27283 number = "STAN-CS-81-856",
27284 institution = inst-STAN-CS,
27285 address = inst-STAN-CS:adr,
27286 pages = "190",
27287 month = jun,
27288 year = "1981",
27289 bibdate = "Wed Nov 26 12:13:45 MST 2025",
27290 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
27291 URL = "",
27292 acknowledgement = ack-nhfb,
27293 remark = "This is the author's thesis.",
27294 }
27295
27296 @TechReport{King:1981:QOS,
27297 author = "Jonathan Jay King",
27298 title = "Query Optimization by Semantic Reasoning",
27299 type = "Technical Report",
27300 number = "STAN-CS-81-857",
27301 institution = inst-STAN-CS,
27302 address = inst-STAN-CS:adr,
27303 pages = "128",
27304 month = jun,
27305 year = "1981",
27306 bibdate = "Wed Nov 26 12:13:45 MST 2025",
27307 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
27308 URL = "",
27309 acknowledgement = ack-nhfb,
27310 remark = "This is the author's thesis.",
27311 }
27312
27313 @TechReport{Pan:1981:BOC,
27314 author = "Pan and V. Y.",
27315 title = "The Bit Operation Complexity of Approximate Evaluation
27316 of Matrix and Polynomial Products Using Arithmetic",
27317 type = "Technical Report",
27318 number = "STAN-CS-81-858",
27319 institution = inst-STAN-CS,
27320 address = inst-STAN-CS:adr,
27321 pages = "6",
27322 month = jun,
27323 year = "1981",
27324 bibdate = "Wed Nov 26 12:13:45 MST 2025",
27325 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
27326 URL = "",
27327 acknowledgement = ack-nhfb,
27328 }
27329
27330 @TechReport{Pan:1981:ALC,
27331 author = "V. Y. Pan",
27332 title = "The Additive and Logical Complexities of Linear and
27333 Bilinear Arithmetic Algorithms",
27334 type = "Technical Report",
27335 number = "STAN-CS-81-859",
27336 institution = inst-STAN-CS,
27337 address = inst-STAN-CS:adr,
27338 pages = "21",
27339 month = jun,
27340 year = "1981",
27341 bibdate = "Wed Nov 26 12:13:45 MST 2025",
27342 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
27343 URL = "",
27344 acknowledgement = ack-nhfb,
27345 }
27346
27347 @TechReport{Boley:1981:CCO,
27348 author = "Daniel Boley",
27349 title = "Computing the Controllability\slash Observability
27350 Decomposition of a Linear Time-Invariant Dynamic
27351 System: a Numerical Approach",
27352 type = "Technical Report",
27353 number = "STAN-CS-81-860",
27354 institution = inst-STAN-CS,
27355 address = inst-STAN-CS:adr,
27356 pages = "81",
27357 month = jun,
27358 year = "1981",
27359 bibdate = "Wed Nov 26 12:13:45 MST 2025",
27360 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
27361 URL = "",
27362 acknowledgement = ack-nhfb,
27363 remark = "This is the author's thesis.",
27364 }
27365
27366 @TechReport{Brooks:1981:SRA,
27367 author = "Rodney A. Brooks",
27368 title = "Symbolic Reasoning Among {3-D} Models and {2-D}
27369 Images",
27370 type = "Technical Report",
27371 number = "STAN-CS-81-861",
27372 institution = inst-STAN-CS,
27373 address = inst-STAN-CS:adr,
27374 pages = "181",
27375 month = jun,
27376 year = "1981",
27377 bibdate = "Wed Nov 26 12:13:45 MST 2025",
27378 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
27379 URL = "",
27380 acknowledgement = ack-nhfb,
27381 remark = "This is the author's thesis.",
27382 }
27383
27384 @TechReport{Pan:1981:LBA,
27385 author = "V. Y. Pan",
27386 title = "The Lower Bounds on the Additive Complexity of
27387 Bilinear Problems in Terms of Some Algebraic
27388 Quantities",
27389 type = "Technical Report",
27390 number = "STAN-CS-81-862",
27391 institution = inst-STAN-CS,
27392 address = inst-STAN-CS:adr,
27393 pages = "4",
27394 month = jun,
27395 year = "1981",
27396 bibdate = "Wed Nov 26 12:13:45 MST 2025",
27397 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
27398 URL = "",
27399 acknowledgement = ack-nhfb,
27400 }
27401
27402 @TechReport{Knuth:1981:PPS,
27403 author = "Donald E. Knuth and Allan A. Miller",
27404 title = "A Programming and Problem-Solving Seminar",
27405 type = "Technical Report",
27406 number = "STAN-CS-81-863",
27407 institution = inst-STAN-CS,
27408 address = inst-STAN-CS:adr,
27409 pages = "84",
27410 day = "1",
27411 month = jun,
27412 year = "1981",
27413 bibdate = "Fri Apr 18 05:25:51 2003",
27414 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
27415 URL = "http://www-db.stanford.edu/TR/CS-TR-81-863.html;
27416 http://www.ncstrl.org:8900/ncstrl/servlet/search?formname=detail&id=oai%3Ancstrlh%3Astan%3ASTAN%2F%2FCS-TR-81-863",
27417 abstract = "This report contains a record of the autumn 1980
27418 session of CS 204, a problem-solving and programming
27419 seminar taught at Stanford that is primarily intended
27420 for first-year Ph.D. students. The seminar covers a
27421 large range of topics, research paradigms, and
27422 programming paradigms in computer science, so these
27423 notes will be of interest to graduate students,
27424 professors, and professional computer scientists.",
27425 acknowledgement = ack-nhfb,
27426 documentid = "oai:ncstrlh:stan:STAN//CS-TR-81-863",
27427 xxnumber = "CS-TR-81-863",
27428 }
27429
27430 @TechReport{Doyle:1981:TSE,
27431 author = "Jon Doyle",
27432 title = "Three Short Essays on Decisions, Reasons, and Logics",
27433 type = "Technical Report",
27434 number = "STAN-CS-81-864",
27435 institution = inst-STAN-CS,
27436 address = inst-STAN-CS:adr,
27437 pages = "19",
27438 month = jun,
27439 year = "1981",
27440 bibdate = "Wed Nov 26 12:13:45 MST 2025",
27441 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
27442 URL = "",
27443 acknowledgement = ack-nhfb,
27444 }
27445
27446 @TechReport{Tang:1981:TUL,
27447 author = "Chih-sung Tang",
27448 title = "Toward a unified logical basis for programming
27449 languages",
27450 type = "Technical Report",
27451 number = "STAN-CS-81-865",
27452 institution = inst-STAN-CS,
27453 address = inst-STAN-CS:adr,
27454 pages = "21",
27455 month = jun,
27456 year = "1981",
27457 bibdate = "Thu Nov 20 12:11:36 MST 2025",
27458 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
27459 URL = "http://www-db.stanford.edu/TR/CS-TR-81-865.html",
27460 abstract = "In recent years, more and more computer scientists
27461 have been paying attention to temporal logic, since
27462 there are many properties of programs that can be
27463 described only by bringing the time parameter into
27464 consideration. But existing temporal logic languages,
27465 such as Lucid, in spite of their mathematical elegance,
27466 are still far from practical. I believe that a
27467 practical temporal-logic language, once it came into
27468 being, would have a wide spectrum of applications. XYZ
27469 /E is a temporal-logic language. Like other logic
27470 languages, it is a logic system as well as a
27471 programming language. But unlike them, it can express
27472 all conventional data structures and control
27473 structures, nondeterminate or concurrent programs, even
27474 programs with branching-time order. We find that the
27475 difficulties met in other logic languages often stem
27476 from the fact that they try to deal with these
27477 structures in a higher level. XYZ /E adopts another
27478 approach. We divide the language into two forms: the
27479 internal form and the external form. The former is
27480 lower level, while the latter is higher. Just as any
27481 logic system contains rules of abbreviation, so also in
27482 XYZ /E there are rules of abbreviation to transform the
27483 internal form into the external form, and vice versa.
27484 These two forms can be considered to be different
27485 representations of the same thing. We find that this
27486 approach can ameliorate many problems of
27487 formalization.",
27488 acknowledgement = ack-nhfb,
27489 xxnumber = "CS-TR-81-865",
27490 }
27491
27492 @TechReport{German:1981:VAC,
27493 author = "Steven Mark German",
27494 title = "Verifying the Absence of Common Runtime Errors in
27495 Computer Programs",
27496 type = "Technical Report",
27497 number = "STAN-CS-81-866 (CSL 81-208, CSL-TR-208, PVG-19,
27498 AD-A109433)",
27499 institution = inst-STAN-CS,
27500 address = inst-STAN-CS:adr,
27501 pages = "v + 179",
27502 month = jun,
27503 year = "1981",
27504 bibdate = "Wed Nov 26 12:13:45 MST 2025",
27505 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
27506 URL = "https://apps.dtic.mil/sti/tr/pdf/ADA109433.pdf",
27507 abstract = "The Runcheck verifier is a working prototype system
27508 for proving the absence at runtime errors such as
27509 arithmetic overflow, array subscripting out of
27510 range.,accessing an uninitialized variable, and
27511 dereferencing a null pointer. Such errors cannot be
27512 detected at compile time by most compilers. Runcheck
27513 accepts Pascal program documented with assertions and
27514 proves that the assertions are consistent with the
27515 program and that no runtime error can
27516 occur.\par
27517
27518 Runcheck is designed to guarantee the complete absence
27519 of runtime errors in this respect, it differs from the
27520 anomaly detection or data flow approach, which attempts
27521 to uncover runtime errors but cannot guarantee their
27522 absence. Another important distinction from previous
27523 approaches is that Runcheck is based on a detailed,
27524 rigorous semantic definition of the programming
27525 language and its data types (including pointers).
27526 Because the implementation contains a general purpose
27527 theorem prover, proofs can be arbitrarily
27528 detailed.\par
27529
27530 The thesis begins by presenting an axiomatic definition
27531 of Pascal for proving the absence of runtime errors.
27532 Our definition is similar to Hoare's axiom system, but
27533 it takes into account certain restrictions which have
27534 not been considered in previous axiomatic definitions.
27535 The definition is based on a special predicate,
27536 DEF($x$), which is true if $x$ has a properly
27537 initialized value. We discuss the problem of
27538 introducing uninitialized variables in an axiomatic
27539 definition, and construct models of the data types from
27540 nonstandard models of the integers to Justify our new
27541 approach to uninitialized variables.\par
27542
27543 The thesis contains many example of verified programs
27544 of various levels of difficulty. The verification of a
27545 four page example program is discussed in
27546 detail.\par
27547
27548 The final section draws on experience with Runcheck and
27549 the Stanford Pascal Verifier to discuss some of the
27550 major issues concerning verification and software
27551 reliability, including how verification Can contribute
27552 to reliability even if absolute correctness cannot be
27553 obtained, and which applications of program
27554 verification may be feasible for large programs.",
27555 acknowledgement = ack-nhfb,
27556 advisor = "David Luckham",
27557 pdfpages = "181",
27558 remark = "This is the author's Ph.D. (Applied Mathematics)
27559 thesis. No PDF in NTRL archive. Found in DTIC archive.
27560 Pagination changes in each chapter.",
27561 }
27562
27563 @TechReport{Luckham:1981:AAB,
27564 author = "David C. Luckham and Howard J. Larsen and David R.
27565 Stevenson and Friedrich W. von Henke",
27566 title = "{ADAM} --- an {Ada} based language for
27567 multi-processing",
27568 type = "Technical Report",
27569 number = "STAN-CS-81-867",
27570 institution = inst-STAN-CS,
27571 address = inst-STAN-CS:adr,
27572 pages = "v + 71",
27573 month = jul,
27574 year = "1981",
27575 bibdate = "Thu Nov 20 12:11:36 MST 2025",
27576 bibsource = "https://www.math.utah.edu/pub/tex/bib/adabooks.bib;
27577 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
27578 URL = "http://www-db.stanford.edu/TR/CS-TR-81-867.html;
27579 https://apps.dtic.mil/sti/pdfs/ADA110920.pdf",
27580 abstract = "Adam is an experimental language derived from Ada. It
27581 was developed to facilitate study of issues in Ada
27582 implementation. The two primary objectives which
27583 motivated the development of Adam were: to program
27584 supervisory packages for multitask scheduling, and to
27585 formulate algorithms for compilation of Ada tasking.
27586 Adam is a subset of the sequential program constructs
27587 of Ada combined with a set of parallel processing
27588 constructs which are lower level than Ada tasking. In
27589 addition, Adam places strong restrictions on sharing of
27590 global objects between processes. Import declarations
27591 and propagate declarations are included. A compiler has
27592 been implemented in Maclisp on a DEC PDP-10. It
27593 produces assembly code for a PDP-10. It supports
27594 separate compilation, generics, exceptions, and
27595 parallel processes. Algorithms translating Ada tasking
27596 into Adam parallel processing have been developed and
27597 implemented. An experimental compiler for most of the
27598 final Ada language design, including task types and
27599 task rendezvous constructs, based on the Adam compiler,
27600 is presently available on PDP-10's. This compiler uses
27601 a procedure call implementation of task rendezvous, but
27602 will be used to develop and study alternate
27603 implementations.",
27604 acknowledgement = ack-nhfb,
27605 pdfpages = "76",
27606 xxnumber = "CS-TR-81-867",
27607 }
27608
27609 @TechReport{Knuth:1981:LWE,
27610 author = "Donald E. Knuth",
27611 title = "The Last Whole Errata Catalog",
27612 type = "Technical Report",
27613 number = "STAN-CS-81-868",
27614 institution = inst-STAN-CS,
27615 address = inst-STAN-CS:adr,
27616 pages = "42",
27617 day = "1",
27618 month = jul,
27619 year = "1981",
27620 bibdate = "Fri Apr 18 05:25:51 2003",
27621 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
27622 URL = "http://www-db.stanford.edu/TR/CS-TR-81-868.html;
27623 http://www.ncstrl.org:8900/ncstrl/servlet/search?formname=detail&id=oai%3Ancstrlh%3Astan%3ASTAN%2F%2FCS-TR-81-868",
27624 abstract = "This list supplements previous errata published in
27625 Stanford reports CS551 (1976) and CS712 (1979). It
27626 includes the first corrections and changes to the
27627 second edition of volume two (published January, 1981)
27628 as well as to the most recent printings of volumes one
27629 and three (first published in 1975). In addition to the
27630 errors listed here, about half of the occurrences of
27631 'which' in volumes one and three should be changed to
27632 'that'.",
27633 acknowledgement = ack-nhfb,
27634 documentid = "oai:ncstrlh:stan:STAN//CS-TR-81-868",
27635 xxnumber = "CS-TR-81-868",
27636 }
27637
27638 @TechReport{Tajnai:1981:CSC,
27639 author = "Carolyn E. Tajnai",
27640 title = "{Computer Science} comprehensive examinations,
27641 1978\slash 79--1980\slash 81",
27642 type = "Technical Report",
27643 number = "STAN-CS-81-869",
27644 institution = inst-STAN-CS,
27645 address = inst-STAN-CS:adr,
27646 pages = "xvi + 216",
27647 month = aug,
27648 year = "1981",
27649 bibdate = "Thu Nov 20 12:11:36 MST 2025",
27650 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
27651 URL = "http://www-db.stanford.edu/TR/CS-TR-81-869.html",
27652 abstract = "The Stanford Computer Science Comprehensive
27653 Examination was conceived Spring Quarter 1971/72 and
27654 since then has been given winter and spring quarters
27655 each year. The 'Comp' serves several purposes in the
27656 department. There are no course requirements in the
27657 Ph.D. and the Ph.D. Minor programs, and only one
27658 (CS293, Computer Laboratory) in the Master's program.
27659 Therefore, the 'Comp' fulfills the breadth and depth
27660 requirements. The Ph.D. Minor and Master's student must
27661 pass at the Master's level to be eligible for the
27662 degree. For the Ph.D. student it serves as a ``Rite of
27663 Passage''; the exam must be passed at the Ph.D. level
27664 by the end of six quarters of full-time study
27665 (excluding summers) for the student to continue in the
27666 program.\par
27667
27668 This report is a collection of comprehensive
27669 examinations from Winter Quarter 1978/79 through Spring
27670 Quarter 1980/81.",
27671 acknowledgement = ack-nhfb,
27672 pdfpages = "232",
27673 xxnumber = "CS-TR-81-869",
27674 }
27675
27676 @TechReport{Plass:1981:OPT,
27677 author = "Michael F. Plass",
27678 title = "Optimal Pagination Techniques for Automatic
27679 Typesetting Systems",
27680 type = "Technical Report",
27681 number = "STAN-CS-81-870",
27682 institution = inst-STAN-CS,
27683 address = inst-STAN-CS:adr,
27684 pages = "77",
27685 month = jun,
27686 year = "1981",
27687 bibdate = "Wed Nov 26 12:13:45 MST 2025",
27688 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
27689 URL = "",
27690 acknowledgement = ack-nhfb,
27691 remark = "This is the author's thesis.",
27692 }
27693
27694 @TechReport{Trickey:1981:GLP,
27695 author = "Howard W. Trickey",
27696 title = "Good Layouts for Pattern Recognizers",
27697 type = "Technical Report",
27698 number = "STAN-CS-81-871",
27699 institution = inst-STAN-CS,
27700 address = inst-STAN-CS:adr,
27701 pages = "iv + 14",
27702 month = aug,
27703 year = "1981",
27704 bibdate = "Thu Nov 20 12:11:36 MST 2025",
27705 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib;
27706 https://www.math.utah.edu/pub/tex/bib/string-matching.bib",
27707 URL = "http://i.stanford.edu/pub/cstr/reports/cs/tr/81/871/CS-TR-81-871.pdf;
27708 http://www-db.stanford.edu/TR/CS-TR-81-871.html",
27709 abstract = "A system to lay out custom circuits that recognize
27710 regular languages can be a useful VLSI design
27711 automation tool. This paper describes the algorithms
27712 used in an implementation of a regular expression
27713 compiler. Layouts that use a network of programmable
27714 logic arrays (PLA's) have smaller areas than those of
27715 some other methods, but there are the problems of
27716 partitioning the circuit and then placing the
27717 individual PLA's. Regular expressions have a structure
27718 which allows a novel solution to these problems:
27719 dynamic programming can be used to find layouts which
27720 are in some sense optimal. Various search pruning
27721 heuristics have been used to increase the speed of the
27722 compiler, and the experience with these is reported in
27723 the conclusions.",
27724 acknowledgement = ack-nhfb,
27725 keywords = "control logic design; dynamic programming;
27726 partitioning; programmable logic arrays; regular
27727 expressions; silicon compilers; string pattern
27728 recognition; VLSI layout",
27729 pdfpages = "18",
27730 xxnumber = "CS-TR-81-871",
27731 }
27732
27733 @TechReport{Manna:1981:SCP,
27734 author = "Zohar Manna and Pierre Wolper",
27735 title = "Synthesis of Communicating Processes from Temporal
27736 Logic Specifications",
27737 type = "Technical Report",
27738 number = "STAN-CS-81-872",
27739 institution = inst-STAN-CS,
27740 address = inst-STAN-CS:adr,
27741 pages = "28",
27742 month = sep,
27743 year = "1981",
27744 bibdate = "Wed Nov 26 12:13:45 MST 2025",
27745 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
27746 URL = "",
27747 acknowledgement = ack-nhfb,
27748 }
27749
27750 @TechReport{Carr:1981:VMM,
27751 author = "Richard William Carr",
27752 title = "Virtual Memory Management",
27753 type = "Technical Report",
27754 number = "STAN-CS-81-873",
27755 institution = inst-STAN-CS,
27756 address = inst-STAN-CS:adr,
27757 pages = "238",
27758 month = dec,
27759 year = "1981",
27760 bibdate = "Wed Nov 26 12:13:45 MST 2025",
27761 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
27762 URL = "",
27763 acknowledgement = ack-nhfb,
27764 }
27765
27766 @TechReport{Spector:1981:MAL,
27767 author = "Alfred Z. Spector",
27768 title = "Multiprocessing Architectures for Local Computer
27769 Networks",
27770 type = "Technical Report",
27771 number = "STAN-CS-81-874",
27772 institution = inst-STAN-CS,
27773 address = inst-STAN-CS:adr,
27774 pages = "125",
27775 month = aug,
27776 year = "1981",
27777 bibdate = "Wed Nov 26 12:13:45 MST 2025",
27778 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
27779 URL = "",
27780 acknowledgement = ack-nhfb,
27781 }
27782
27783 @TechReport{Hu:1981:CMC,
27784 author = "T. C. Hu and M. T. Shing",
27785 title = "Computation of matrix chain products: {Part I}, Part
27786 {II}",
27787 type = "Technical Report",
27788 number = "STAN-CS-81-875",
27789 institution = inst-STAN-CS,
27790 address = inst-STAN-CS:adr,
27791 pages = "124",
27792 month = sep,
27793 year = "1981",
27794 bibdate = "Thu Nov 20 12:11:36 MST 2025",
27795 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
27796 URL = "http://www-db.stanford.edu/TR/CS-TR-81-875.html",
27797 abstract = "This paper considers the computation of matrix chain
27798 products of the form $ M_1 x M_2 x \ldots {} x M_{n -
27799 1} $. If the matrices are of different dimensions, the
27800 order in which the product is computed affects the
27801 number of operations. An optimum order is an order
27802 which minimizes the total number of operations. Some
27803 theorems about an optimum order of computing the
27804 matrices are presented in part I. Based on these
27805 theorems, an $ O(n \log n) $ algorithm for finding an
27806 optimum order is presented in part II.",
27807 acknowledgement = ack-nhfb,
27808 xxnumber = "CS-TR-81-875",
27809 }
27810
27811 @TechReport{Dolev:1981:LAE,
27812 author = "Danny Dolev and Howard W. Trickey",
27813 title = "On Linear Area Embedding of Planar Graphs",
27814 type = "Technical Report",
27815 number = "STAN-CS-81-876",
27816 institution = inst-STAN-CS,
27817 address = inst-STAN-CS:adr,
27818 pages = "ii + 21",
27819 month = sep,
27820 year = "1981",
27821 bibdate = "Thu Nov 20 12:11:36 MST 2025",
27822 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
27823 URL = "ehttp://www-db.stanford.edu/TR/CS-TR-81-876.html;
27824 http://i.stanford.edu/pub/cstr/reports/cs/tr/81/876/CS-TR-81-876.pdf",
27825 abstract = "Planar embedding with minimal area of graphs on an
27826 integer grid is one of the major issues in VLSI.
27827 Valiant [1981] gave an algorithm to construct a planar
27828 embedding for trees in linear area; he also proved that
27829 there are planar graphs that require quadratic
27830 area.\par
27831
27832 We give an algorithm to embed outerplanar graphs in
27833 linear area. We extend this algorithm to work for every
27834 planar graph that has the following property: for every
27835 vertex there exists a path of length less than K to the
27836 exterior face, where K is a constant.\par
27837
27838 Finally, finding a minimal embedding area is shown to
27839 be NP-complete for forests, and hence for more general
27840 types of graphs.",
27841 acknowledgement = ack-nhfb,
27842 pdfpages = "24",
27843 xxnumber = "CS-TR-81-876",
27844 }
27845
27846 @TechReport{Manna:1981:VSP,
27847 author = "Zohar Manna",
27848 title = "Verification of Sequential Programs: Temporal
27849 Axiomatization",
27850 type = "Technical Report",
27851 number = "STAN-CS-81-877",
27852 institution = inst-STAN-CS,
27853 address = inst-STAN-CS:adr,
27854 pages = "45",
27855 month = sep,
27856 year = "1981",
27857 bibdate = "Wed Nov 26 12:13:45 MST 2025",
27858 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
27859 URL = "",
27860 acknowledgement = ack-nhfb,
27861 }
27862
27863 @TechReport{Maier:1981:MOS,
27864 author = "David Maier and Jeffrey D. Ullman",
27865 title = "Maximal Objects and the Semantics of Universal
27866 Relation Databases",
27867 type = "Technical Report",
27868 number = "STAN-CS-81-878",
27869 institution = inst-STAN-CS,
27870 address = inst-STAN-CS:adr,
27871 pages = "10",
27872 month = oct,
27873 year = "1981",
27874 bibdate = "Wed Nov 26 12:13:45 MST 2025",
27875 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
27876 URL = "",
27877 acknowledgement = ack-nhfb,
27878 }
27879
27880 @TechReport{Masinter:1981:IVR,
27881 author = "Larry M. Masinter",
27882 title = "{Interlisp-VAX}: a Report",
27883 type = "Technical Report",
27884 number = "STAN-CS-81-879",
27885 institution = inst-STAN-CS,
27886 address = inst-STAN-CS:adr,
27887 pages = "12",
27888 month = aug,
27889 year = "1981",
27890 bibdate = "Thu Nov 20 12:11:36 MST 2025",
27891 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
27892 URL = "http://www-db.stanford.edu/TR/CS-TR-81-879.html",
27893 abstract = "This report documents the results of a study to
27894 evaluate the feasibility of implementing the Interlisp
27895 language to run on the DEC VAX computer. Specific goals
27896 of the study were to: (1) assess the technical status
27897 of the on-going implementation project at USC-ISI; (2)
27898 estimate the expected performance of Interlisp on the
27899 VAX family of machines as compared to Interlisp-10,
27900 other Lisp systems for the VAX, and other Interlisp
27901 implementations where performance data were available;
27902 and (3) identify serious obstacles and alternatives to
27903 the timely completion of an effective Interlisp-VAX
27904 system.",
27905 acknowledgement = ack-nhfb,
27906 pdfpages = "13",
27907 xxnumber = "CS-TR-81-879",
27908 }
27909
27910 @TechReport{Mayr:1981:WSP,
27911 author = "Ernst W. Mayr",
27912 title = "Well structured parallel programs are not easier to
27913 schedule",
27914 type = "Technical Report",
27915 number = "STAN-CS-81-880",
27916 institution = inst-STAN-CS,
27917 address = inst-STAN-CS:adr,
27918 pages = "ii + 16",
27919 month = sep,
27920 year = "1981",
27921 bibdate = "Thu Nov 20 12:11:36 MST 2025",
27922 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
27923 URL = "http://www-db.stanford.edu/TR/CS-TR-81-880.html",
27924 abstract = "The scheduling problem for unit time task systems with
27925 arbitrary precedence constraints is known to be
27926 NP-complete. We show that the same is true even if the
27927 precedence constraints are restricted to certain
27928 subclasses which make the corresponding parallel
27929 programs more structured. Among these classes are those
27930 derived from hierarchic cobegin--coend programming
27931 constructs, level graph forests, and the parallel or
27932 serial composition of an out-tree and an in-tree. In
27933 each case, the completeness proof depends heavily on
27934 the number of processors being part of the problem
27935 instances.",
27936 acknowledgement = ack-nhfb,
27937 pdfpages = "17",
27938 xxnumber = "CS-TR-81-880",
27939 }
27940
27941 @TechReport{Ullman:1981:URS,
27942 author = "Jeffrey D. Ullman",
27943 title = "The {U.R.} Strikes Back",
27944 type = "Technical Report",
27945 number = "STAN-CS-81-881 (AD-A119145)",
27946 institution = inst-STAN-CS,
27947 address = inst-STAN-CS:adr,
27948 pages = "iv + 15",
27949 month = oct,
27950 year = "1981",
27951 bibdate = "Wed Nov 26 12:13:45 MST 2025",
27952 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
27953 URL = "https://apps.dtic.mil/sti/pdfs/ADA119145.pdf",
27954 abstract = "In this paper, we try to put to rest many of the
27955 objections to the universal relation concept that have
27956 appeared in the literature. First, we shall taxonomize
27957 the varieties of ideas that are sometimes called the
27958 ``universal relation assumption''. Then, we consider
27959 some of the arguments pro and con. In some cases, the
27960 arguments against were expressed prematurely, and
27961 solutions to the problems they expose have since been
27962 found. In other case, the arguments against are simply
27963 fallacious. In still other cases, the problems pointed
27964 out are real, but simply serve to point out that the
27965 advantages of the universal relation are not gotten for
27966 free. We shall conclude the paper with a description of
27967 the algorithm used to interpret queries in System/U,
27968 and the reasoning behind it.",
27969 acknowledgement = ack-nhfb,
27970 pdfpages = "20",
27971 }
27972
27973 @TechReport{Pan:1981:FMM,
27974 author = "V. Pan",
27975 title = "Fast Matrix Multiplication Without {APP} Algorithms",
27976 type = "Technical Report",
27977 number = "STAN-CS-81-882",
27978 institution = inst-STAN-CS,
27979 address = inst-STAN-CS:adr,
27980 pages = "30",
27981 month = oct,
27982 year = "1981",
27983 bibdate = "Wed Nov 26 12:13:45 MST 2025",
27984 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
27985 URL = "",
27986 acknowledgement = ack-nhfb,
27987 }
27988
27989 @TechReport{Pepper:1981:PTA,
27990 author = "P. Pepper",
27991 title = "On program transformations for abstract data types and
27992 concurrency",
27993 type = "Technical Report",
27994 number = "STAN-CS-81-883",
27995 institution = inst-STAN-CS,
27996 address = inst-STAN-CS:adr,
27997 pages = "37",
27998 month = oct,
27999 year = "1981",
28000 bibdate = "Thu Nov 20 12:11:36 MST 2025",
28001 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
28002 URL = "http://www-db.stanford.edu/TR/CS-TR-81-883.html",
28003 abstract = "We study transformation rules for a particular class
28004 of abstract data types, namely types that are
28005 representable by recursive mode declarations. The
28006 transformations are tailored to the development of
28007 efficient tree traversal and they allow for
28008 concurrency. The techniques are exemplified by an
28009 implementation of concurrent insertion and deletion in
28010 2-3-trees.",
28011 acknowledgement = ack-nhfb,
28012 xxnumber = "CS-TR-81-883",
28013 }
28014
28015 @TechReport{Ceri:1981:ODD,
28016 author = "Stefano Ceri and Shamkant Navathe and Gio Wiederhold",
28017 title = "Optimal Design of Distributed Databases",
28018 type = "Technical Report",
28019 number = "STAN-CS-81-884",
28020 institution = inst-STAN-CS,
28021 address = inst-STAN-CS:adr,
28022 pages = "48",
28023 month = dec,
28024 year = "1981",
28025 bibdate = "Wed Nov 26 12:13:45 MST 2025",
28026 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
28027 URL = "",
28028 acknowledgement = ack-nhfb,
28029 }
28030
28031 @TechReport{vanMelle:1981:EM,
28032 author = "William James van Melle and A. C. Scott and J. S.
28033 Bennett and M. Peairs",
28034 title = "The {EMYCIN} Manual",
28035 type = "Technical Report",
28036 number = "STAN-CS-81-885 (HPP-81-16)",
28037 institution = inst-STAN-CS,
28038 address = inst-STAN-CS:adr,
28039 pages = "iii + 138",
28040 month = oct,
28041 year = "1981",
28042 LCCN = "QA76.76.E95 E49 1981",
28043 bibdate = "Tue Feb 03 08:00:20 2026",
28044 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
28045 URL = "https://bitsavers.org/pdf/stanford/Stanford_CS_TR_Collection_2025-12-12/PDF/1981/CS-TR-81-885_The_Emycin_Manual_198110.pdf",
28046 abstract = "This manual describes a domain-independent system,
28047 called EMYCIN, for constructing one class of expert
28048 computer programs: rule-based consultants. The
28049 resulting programs use knowledge specific to a problem
28050 domain to provide consultative advice to a client. The
28051 system-building tool, EMYCIN, is based on the
28052 domain-independent core of the MYCIN program. Domain
28053 knowledge is represented in EMYCIN systems primarily as
28054 production rules, which are applied by a goal-directed
28055 backward-chaining control structure. Rules and
28056 consultation data may have associated measures of
28057 certainty, and incomplete data entry is allowed. The
28058 system includes an explanation facility that can
28059 display the line of reasoning followed by the
28060 consultation program, and answer questions from the
28061 client about the contents of its knowledge base.\par
28062
28063 To aid the system designer in producing a knowledge
28064 base for a domain quickly and accurately, EMYCIN
28065 provides the following features: (1) a terse, stylized,
28066 but easily understood language for writing rules; (2)
28067 extensive checks to catch common user errors, such as
28068 misspellings; and (3) methods for handling all
28069 necessary bookkeeping chores. Other. human-engineering
28070 features allow the system architect to produce, with a
28071 minimum of effort, a consultation program that is
28072 pleasing in appearance to the client.\par
28073
28074 Several consultation programs have been developed using
28075 EMYCIN, including consultants for medical problems and
28076 a consultant for structural analysis.",
28077 acknowledgement = ack-nhfb,
28078 subject = "EMYCIN (Computer system); Handbooks, manuals, etc;
28079 Expert systems (Computer science); Syst{\`e}mes experts
28080 (Informatique); Guides, manuels, etc; Expert systems
28081 (Computer science)",
28082 }
28083
28084 @TechReport{Knuth:1981:CMF,
28085 author = "Donald E. Knuth",
28086 title = "The Concept of a {Meta-Font}",
28087 type = "Technical Report",
28088 number = "STAN-CS-81-886",
28089 institution = inst-STAN-CS,
28090 address = inst-STAN-CS:adr,
28091 pages = "12",
28092 month = oct,
28093 year = "1981",
28094 bibdate = "Wed Nov 26 12:13:45 MST 2025",
28095 bibsource = "https://www.math.utah.edu/pub/tex/bib/font.bib;
28096 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
28097 URL = "https://s3-us-west-2.amazonaws.com/visiblelanguage/pdf/V16N1_1982_E.pdf",
28098 acknowledgement = ack-nhfb,
28099 remark = "Published in \booktitle{Visible Language}, {\bf
28100 XVI}(1) 3--27, Winter 1982.",
28101 }
28102
28103 @TechReport{Graham:1981:FCH,
28104 author = "Ronald L. Graham and Frances Yao",
28105 title = "Finding the Convex Hull of a Simple Polygon",
28106 type = "Technical Report",
28107 number = "STAN-CS-81-887",
28108 institution = inst-STAN-CS,
28109 address = inst-STAN-CS:adr,
28110 pages = "9",
28111 month = nov,
28112 year = "1981",
28113 bibdate = "Thu Nov 20 12:11:36 MST 2025",
28114 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
28115 URL = "http://www-db.stanford.edu/TR/CS-TR-81-887.html",
28116 abstract = "It is well known that the convex hull of a set of n
28117 points in the (Euclidean) plane can be found by an
28118 algorithm having worst-case complexity $ O(n \log n) $.
28119 In this note we give a short linear algorithm for
28120 finding the convex hull in the case that the (ordered)
28121 set of points from the vertices of a simple (i.e.,
28122 non-self-intersecting) polygon.",
28123 acknowledgement = ack-nhfb,
28124 author-dates = "Ronald Lewis Graham (31 October 1935--6 July 2020)",
28125 xxnumber = "CS-TR-81-887",
28126 }
28127
28128 @TechReport{Gropp:1981:NST,
28129 author = "William D. Gropp",
28130 title = "Numerical Solution of Transport Equations",
28131 type = "Technical Report",
28132 number = "STAN-CS-81-888",
28133 institution = inst-STAN-CS,
28134 address = inst-STAN-CS:adr,
28135 pages = "108",
28136 month = dec,
28137 year = "1981",
28138 bibdate = "Wed Nov 26 12:13:45 MST 2025",
28139 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
28140 URL = "",
28141 acknowledgement = ack-nhfb,
28142 }
28143
28144 @TechReport{Mujtaba:1981:AUM,
28145 author = "Shahid Mujtaba and Ron Goldman",
28146 title = "{AL} users' manual",
28147 type = "Technical Report",
28148 number = "STAN-CS-81-889",
28149 institution = inst-STAN-CS,
28150 address = inst-STAN-CS:adr,
28151 pages = "168",
28152 month = dec,
28153 year = "1981",
28154 bibdate = "Thu Nov 20 12:11:36 MST 2025",
28155 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
28156 URL = "http://www-db.stanford.edu/TR/CS-TR-81-889.html",
28157 abstract = "AL is a high-level programming language for
28158 manipulator control useful in industrial assembly
28159 research. This document describes the current state of
28160 the AL system now in operation at the Stanford
28161 Artificial Intelligence Laboratory, and teaches the
28162 reader how to use it. The system consists of the AL
28163 compiler and runtime system and the source code
28164 interpreter, POINTY, which facilitates specifying
28165 representation of parts, and interactive execution of
28166 AL statements.",
28167 acknowledgement = ack-nhfb,
28168 xxnumber = "CS-TR-81-889",
28169 }
28170
28171 @TechReport{Higdon:1981:BCH,
28172 author = "Robert L. Higdon",
28173 title = "Boundary Conditions for Hyperbolic Systems of Partial
28174 Differential Equations Having Multiple Time Scales",
28175 type = "Technical Report",
28176 number = "STAN-CS-81-890",
28177 institution = inst-STAN-CS,
28178 address = inst-STAN-CS:adr,
28179 pages = "136",
28180 month = aug,
28181 year = "1981",
28182 bibdate = "Wed Nov 26 12:13:45 MST 2025",
28183 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
28184 URL = "",
28185 acknowledgement = ack-nhfb,
28186 }
28187
28188 @TechReport{Dietterich:1981:RCL,
28189 author = "T. G. Dietterich and B. G. Buchanan",
28190 title = "The Role of the Critic in Learning Systems",
28191 type = "Technical Report",
28192 number = "STAN-CS-81-891 (HPP-81-19, CSL 81-222, AD-A113479)",
28193 institution = inst-STAN-CS,
28194 address = inst-STAN-CS:adr,
28195 pages = "23",
28196 month = dec,
28197 year = "1981",
28198 bibdate = "Wed Nov 26 12:13:45 MST 2025",
28199 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
28200 URL = "https://apps.dtic.mil/sti/tr/pdf/ADA113479.pdf",
28201 abstract = "Buchanan, Mitchell, Smith. and Johnson [Buchanan 78a]
28202 described a general model of learning systems that
28203 included a component called the Critic. The task of the
28204 Critic was described as threefold: evaluation of the
28205 past actions of the performance element of the learning
28206 system, localization of credit and blame to particular
28207 portions of that performance element, and
28208 recommendation of possible improvements and
28209 modifications in the performance element. This article
28210 analyzes these three tasks in detail and surveys the
28211 methods that have been employed in existing learning
28212 systems to accomplish them. The principle method used
28213 to evaluate the performance element is to develop a
28214 global performance standard by (a) consulting an
28215 external source of knowledge. (b) consulting an
28216 internal source of knowledge. or (c) conducting deep
28217 search. Credit and blame have been localized by (a)
28218 asking an external knowledge source to do the
28219 localization, (b) factoring the global performance
28220 standard to produce a local performance standard, and
28221 (c) conducting controlled experiments on the
28222 performance element. Recommendations have been
28223 communicated to the learning element using (a) local
28224 training instances, (b) correlation coefficients, and
28225 (c) partially-instantiated schemata,",
28226 acknowledgement = ack-nhfb,
28227 pdfpages = "ii + 20",
28228 remark = "The DTIC ADA113479 PDF file is OCR'ed scans of
28229 microfiche page images (27 pages).",
28230 }
28231
28232 @TechReport{Clancey:1981:MBI,
28233 author = "William J. Clancey",
28234 title = "Methodology for Building an Intelligent Tutoring
28235 System",
28236 type = "Technical Report",
28237 number = "STAN-CS-81-894 (HPP-81-18)",
28238 institution = inst-STAN-CS,
28239 address = inst-STAN-CS:adr,
28240 pages = "55",
28241 month = oct,
28242 year = "1981",
28243 bibdate = "Thu Nov 20 12:11:36 MST 2025",
28244 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
28245 URL = "http://www-db.stanford.edu/TR/CS-TR-81-894.html",
28246 abstract = "Over the past 6 years we have been developing a
28247 computer program to teach medical diagnosis. Our
28248 research synthesizes and extends results in artificial
28249 intelligence (Al), medicine, and cognitive psychology.
28250 This paper describes the progression of the research,
28251 and explains how theories from these fields are
28252 combined in a computational model. The general problem
28253 has been to develop an ``intelligent tutoring system''
28254 by adapting the MYCIN ``expert system.'' Thls
28255 conversion requires a deeper understanding of the
28256 nature of expertise and explanation than originally
28257 required for developing MYCIN, and a concomitant shift
28258 in perspective from simple performance goals to
28259 attaining psychological validity in the program's
28260 reasoning process. Others have written extensively
28261 about the relation of artificial intelligence to
28262 cognitive science (e.g., [Pylyshyn, 1978] [Boden,
28263 1977]). Our purpose here is not to repeat those
28264 arguments, but to present a case study which will
28265 provide a common point for further discussion. To this
28266 end, to help evaluate the state of cognitive science,
28267 we will outline our methodology and survey what
28268 resources and viewpoints have helped our research. We
28269 will also discuss pitfalls that other Al-oriented
28270 cognitive scientists may encounter. Finally, we will
28271 present some questions coming out of our work which
28272 might suggest possible collaboration with other fields
28273 of research.",
28274 acknowledgement = ack-nhfb,
28275 pdfpages = "62",
28276 xxnumber = "CS-TR-81-894",
28277 }
28278
28279 @TechReport{Clancey:1981:ERB,
28280 author = "William J. Clancey",
28281 title = "The Epistemology of a Rule-Based Expert System: a
28282 Framework for Explanation",
28283 type = "Technical Report",
28284 number = "STAN-CS-81-896 (HPP-81-17)",
28285 institution = inst-STAN-CS,
28286 address = inst-STAN-CS:adr,
28287 pages = "vii + 60",
28288 month = nov,
28289 year = "1981",
28290 bibdate = "Thu Nov 20 12:11:36 MST 2025",
28291 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
28292 URL = "http://www-db.stanford.edu/TR/CS-TR-81-896.html;
28293 https://apps.dtic.mil/sti/tr/pdf/ADA112672.pdf",
28294 abstract = "Production rules are a popular representation for
28295 encoding heuristic knowledge in programs for scientific
28296 and medical problem solving. However, experience with
28297 one of these programs, MYCIN, indicates that the
28298 representation has serious limitations: people other
28299 than the original rule authors find it difficult to
28300 modify the rule set, and the rules are unsuitable for
28301 use in other settings, such as for application to
28302 teaching. These problems are rooted in fundamental
28303 limitations in MYCIN's original rule representation:
28304 the view that expert knowledge can be encoded as a
28305 uniform, weakly-structured set of if/then associations
28306 is found to be wanting. To illustrate these problems,
28307 this paper examines MYCIN's rules from the perspective
28308 of a teacher trying to justify them and to convey a
28309 problem-solving approach. We discover that individual
28310 rules play different roles, have different kinds of
28311 justifications, and are constructed using different
28312 rationales for the ordering and choice of premise
28313 clauses. This design knowledge, consisting of
28314 structural and strategic concepts which lie outside the
28315 representation, is shown to be procedurally embedded in
28316 the rules. Moreover, because the data/hypothesis
28317 associations are themselves a proceduralized form of
28318 underlying disease models, they can only be supported
28319 by appealing to this deeper level of knowledge. Making
28320 explicit this structural, strategic and support
28321 knowledge enhances the ability to understand and modify
28322 the system.",
28323 acknowledgement = ack-nhfb,
28324 pdfpages = "68",
28325 remark = "The ADA112672 PDF file is OCR'ed scans of microfiche
28326 page images, but the Stanford PDF file is clean.",
28327 xxnumber = "CS-TR-81-896",
28328 }
28329
28330 @TechReport{Whang:1981:SPD,
28331 author = "Kyu-Young Whang and Gio Wiederhold and Daniel
28332 Sagalowicz",
28333 title = "Separability as a Physical Database Design
28334 Methodology",
28335 type = "Technical Report",
28336 number = "STAN-CS-81-898 (CSL-TR-222)",
28337 institution = inst-STAN-CS,
28338 address = inst-STAN-CS:adr,
28339 pages = "iv + 60",
28340 month = oct,
28341 year = "1981",
28342 bibdate = "Thu Nov 20 12:11:36 MST 2025",
28343 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
28344 URL = "http://www-db.stanford.edu/TR/CS-TR-81-898.html",
28345 abstract = "A theoretical approach to the optimal design of large
28346 multifile physical databases is presented. The design
28347 algorithm is based on the theory that, given a set of
28348 join methods that satisfy a certain property called
28349 ``separability,'' the problem of optimal assignment of
28350 access structures to the whole database can be reduced
28351 to the subproblem of optimizing individual relations
28352 independently of one another. Coupling factors are
28353 defined to represent all the interactions among the
28354 relations. This approach not only reduces the
28355 complexity of the problem significantly, but also
28356 provides a better understanding of underlying
28357 mechanisms. A closed noniterative formula is introduced
28358 for estimating the number of block accesses in a
28359 database organization, and the error analyzed. This
28360 formula, an approximation of Yao's exact formula, has a
28361 maximum error of 3.7\%, and significantly reduces the
28362 computation time by eliminating the iterative loop. It
28363 also achieves a much higher accuracy than an
28364 approximation proposed by Cardenas.",
28365 acknowledgement = ack-nhfb,
28366 pdfpages = "64",
28367 remark = "Outer cover says October 1981, but inner title page
28368 says 17 January 1982.",
28369 xxnumber = "CS-TR-81-898",
28370 }
28371
28372 @TechReport{Paulson:1981:CGS,
28373 author = "Lawrence Paulson",
28374 title = "A Compiler Generator for Semantic Grammars",
28375 type = "Technical Report",
28376 number = "STAN-CS-82-893",
28377 institution = inst-STAN-CS,
28378 address = inst-STAN-CS:adr,
28379 pages = "166",
28380 month = dec,
28381 year = "1981",
28382 bibdate = "Wed Nov 26 12:13:45 MST 2025",
28383 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
28384 URL = "",
28385 acknowledgement = ack-nhfb,
28386 }
28387
28388 @TechReport{Appelt:1981:PNL,
28389 author = "Douglas E. Appelt",
28390 title = "Planning Natural-Language Utterances to Satisfy
28391 Multiple Goals",
28392 type = "Technical Report",
28393 number = "STAN-CS-82-918",
28394 institution = inst-STAN-CS,
28395 address = inst-STAN-CS:adr,
28396 pages = "188",
28397 month = dec,
28398 year = "1981",
28399 bibdate = "Wed Nov 26 12:13:45 MST 2025",
28400 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
28401 URL = "",
28402 acknowledgement = ack-nhfb,
28403 remark = "This is the author's thesis.",
28404 }
28405
28406 @TechReport{Roberts:1981:ETE,
28407 author = "Teresa L. Roberts",
28408 title = "Evaluation of Text Editors",
28409 type = "Technical Report",
28410 number = "STAN-CS-82-920",
28411 institution = inst-STAN-CS,
28412 address = inst-STAN-CS:adr,
28413 pages = "188",
28414 month = dec,
28415 year = "1981",
28416 bibdate = "Wed Nov 26 12:13:45 MST 2025",
28417 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
28418 URL = "",
28419 acknowledgement = ack-nhfb,
28420 remark = "This is the author's thesis.",
28421 }
28422
28423 @TechReport{Woods:1981:DPG,
28424 author = "Donald R. Woods",
28425 title = "Drawing Planar Graphs",
28426 type = "Technical Report",
28427 number = "STAN-CS-82-943",
28428 institution = inst-STAN-CS,
28429 address = inst-STAN-CS:adr,
28430 pages = "58",
28431 month = jun,
28432 year = "1981",
28433 bibdate = "Wed Nov 26 12:13:45 MST 2025",
28434 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
28435 URL = "",
28436 acknowledgement = ack-nhfb,
28437 remark = "This is the author's thesis.",
28438 }
28439
28440 @TechReport{Anonymous:1989:NP,
28441 author = "Anonymous",
28442 title = "{NEVER PRINTED}",
28443 type = "Technical Report",
28444 number = "STAN-CS-89-1298",
28445 institution = inst-STAN-CS,
28446 address = inst-STAN-CS:adr,
28447 pages = "??",
28448 month = "???",
28449 year = "1981",
28450 bibdate = "Wed Nov 26 08:55:07 2025",
28451 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
28452 URL = "",
28453 acknowledgement = ack-nhfb,
28454 }
28455
28456 @TechReport{Kuper:1982:ARA,
28457 author = "Gabriel M. Kuper",
28458 title = "An Algorithm for Reducing Acyclic Hypergraphs",
28459 type = "Technical Report",
28460 number = "STAN-CS-82-892",
28461 institution = inst-STAN-CS,
28462 address = inst-STAN-CS:adr,
28463 pages = "9",
28464 month = jan,
28465 year = "1982",
28466 bibdate = "Thu Nov 20 12:11:36 MST 2025",
28467 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
28468 URL = "http://www-db.stanford.edu/TR/CS-TR-82-892.html",
28469 abstract = "This report is a description of an algorithm to
28470 compute efficiently the Graham reduction of an acyclic
28471 hypergraph with sacred nodes. To apply the algorithm we
28472 must already have a tree representation of the
28473 hypergraphs, and therefore it is useful when we have a
28474 fixed hypergraph and wish to compute Graham reductions
28475 many times, as we do in the System/U query
28476 interpretation algorithm.",
28477 acknowledgement = ack-nhfb,
28478 xxnumber = "CS-TR-82-892",
28479 }
28480
28481 @TechReport{Novak:1982:GUM,
28482 author = "Gordon S. {Novak, Jr.}",
28483 title = "{GLISP} users' manual",
28484 type = "Technical Report",
28485 number = "STAN-CS-82-895 (HPP-82-1)",
28486 institution = inst-STAN-CS,
28487 address = inst-STAN-CS:adr,
28488 pages = "38",
28489 month = jan,
28490 year = "1982",
28491 bibdate = "Thu Nov 20 12:11:36 MST 2025",
28492 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
28493 URL = "http://www-db.stanford.edu/TR/CS-TR-82-895.html",
28494 abstract = "GLISP is a high-level, LISP-based language which is
28495 compiled into LISP. GLISP provides a powerful abstract
28496 datatype facility, allowing description and use of both
28497 LISP objects and objects in A.I. representation
28498 languages. GLISP language features include PASCAL-like
28499 control structures, infix expressions with operators
28500 which facilitate list manipulation, and reference to
28501 objects in PASCAL-like or English-like syntax.
28502 English-like definite reference to features of objects
28503 which are in the current computational context is
28504 allowed; definite references are understood and
28505 compiled relative to a knowledge base of object
28506 descriptions. Object-centered programming is supported;
28507 GLISP can substantially improve runtime performance of
28508 object-centered programs by optimized compilation of
28509 references to objects. This manual describes the GLISP
28510 language and use of GLISP within INTERLISP.",
28511 acknowledgement = ack-nhfb,
28512 xxnumber = "CS-TR-82-895",
28513 }
28514
28515 @TechReport{Goad:1982:ACS,
28516 author = "Christopher Goad",
28517 title = "Automatic Construction of Special Purpose Programs",
28518 type = "Technical Report",
28519 number = "STAN-CS-82-897",
28520 institution = inst-STAN-CS,
28521 address = inst-STAN-CS:adr,
28522 pages = "15",
28523 month = jan,
28524 year = "1982",
28525 bibdate = "Wed Nov 26 12:13:45 MST 2025",
28526 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
28527 URL = "",
28528 acknowledgement = ack-nhfb,
28529 }
28530
28531 @TechReport{Bolstad:1982:AFD,
28532 author = "John H. Bolstad",
28533 title = "An Adaptive Finite Difference Method for Hyperbolic
28534 Systems in One Space Dimension",
28535 type = "Technical Report",
28536 number = "STAN-CS-82-899",
28537 institution = inst-STAN-CS,
28538 address = inst-STAN-CS:adr,
28539 pages = "175",
28540 month = feb,
28541 year = "1982",
28542 bibdate = "Wed Nov 26 12:13:45 MST 2025",
28543 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
28544 URL = "",
28545 acknowledgement = ack-nhfb,
28546 remark = "This is the author's thesis.",
28547 }
28548
28549 @TechReport{Blum:1982:DRC,
28550 author = "Robert L. Blum",
28551 title = "Discovery and Representation of Causal Relationships
28552 from a Large Time-Oriented Clinical Database: The {RX
28553 Project}",
28554 type = "Technical Report",
28555 number = "STAN-CS-82-900",
28556 institution = inst-STAN-CS,
28557 address = inst-STAN-CS:adr,
28558 pages = "264",
28559 month = jan,
28560 year = "1982",
28561 bibdate = "Wed Nov 26 12:13:45 MST 2025",
28562 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
28563 URL = "",
28564 acknowledgement = ack-nhfb,
28565 remark = "This is the author's thesis.",
28566 }
28567
28568 @TechReport{Fuchs:1982:OFC,
28569 author = "David R. Fuchs and Donald E. Knuth",
28570 title = "Optimal Font Caching",
28571 type = "Technical Report",
28572 number = "STAN-CS-82-901 (AD-A119439)",
28573 institution = inst-STAN-CS,
28574 address = inst-STAN-CS:adr,
28575 pages = "ii + 19",
28576 month = mar,
28577 year = "1982",
28578 DOI = "https://doi.org/10.1145/2363.2367",
28579 bibdate = "Wed Nov 26 12:13:45 MST 2025",
28580 bibsource = "https://www.math.utah.edu/pub/tex/bib/font.bib;
28581 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
28582 URL = "https://apps.dtic.mil/sti/tr/pdf/ADA119439.pdf;
28583 https://dl.acm.org/doi/pdf/10.1145/2363.2367",
28584 abstract = "An efficient algorithm is presented for communicating
28585 letter-shape information from a high-speed computer
28586 with a large memory to a typesetting device that has a
28587 limited memory. The encoding is optimum, in the sense
28588 that the total time for typesetting is minimized, using
28589 a model that generalizes well-known ``demand paging''
28590 strategies to the case where changes to the cache are
28591 allowed before the associated information is actually
28592 needed. Extensive empirical data shows that good
28593 results are obtained even when difficult technical
28594 material is being typeset on a machine that can store
28595 information concerning only 100 characters. The methods
28596 of this paper are also applicable to other hardware and
28597 software caching applications with restricted
28598 lookahead.",
28599 acknowledgement = ack-nhfb,
28600 keywords = "Cache memory; data reduction; data structures;
28601 lookahead; optimum allocation; prepaging; typesetting",
28602 pdfpages = "21",
28603 remark = "The ADA119439 PDF file is OCR'ed scans of microfiche
28604 page images. Published as ``Optimal Prepaging and Font
28605 Caching'', ACM Transactions on Programming Languages
28606 and Systems, {\bf 7}(1) 67--79, January 1985, at DOI
28607 recorded above.",
28608 }
28609
28610 @TechReport{Manna:1982:SRP,
28611 author = "Zohar Manna and Richard Waldinger",
28612 title = "Special Relations in Program-Synthetic Deduction",
28613 type = "Technical Report",
28614 number = "STAN-CS-82-902",
28615 institution = inst-STAN-CS,
28616 address = inst-STAN-CS:adr,
28617 pages = "75",
28618 month = mar,
28619 year = "1982",
28620 bibdate = "Wed Nov 26 12:13:45 MST 2025",
28621 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
28622 URL = "",
28623 acknowledgement = ack-nhfb,
28624 }
28625
28626 @TechReport{McCarthy:1982:CMK,
28627 author = "John McCarthy",
28628 title = "Coloring Maps and the {Kowalski Doctrine}",
28629 type = "Technical Report",
28630 number = "STAN-CS-82-903",
28631 institution = inst-STAN-CS,
28632 address = inst-STAN-CS:adr,
28633 pages = "8",
28634 month = apr,
28635 year = "1982",
28636 bibdate = "Thu Nov 20 12:11:36 MST 2025",
28637 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
28638 URL = "http://www-db.stanford.edu/TR/CS-TR-82-903.html",
28639 abstract = "It is attractive to regard an algorithm as composed of
28640 the logic determining what the results are and the
28641 control determining how the result is obtained. Logic
28642 programmers like to regard programming as controlled
28643 deduction, and there have been several proposals for
28644 controlling the deduction expressed by a Prolog program
28645 and not always using Prolog's normal backtracking
28646 algorithm. The present note discusses a map coloring
28647 program proposed by Pereira and Porto and two coloring
28648 algorithms that can be regarded as control applied to
28649 its logic. However, the control mechanisms required go
28650 far beyond those that have been contemplated in the
28651 Prolog literature.",
28652 acknowledgement = ack-nhfb,
28653 author-dates = "John McCarthy (4 September 1927--24 October 2011)",
28654 xxnumber = "CS-TR-82-903",
28655 }
28656
28657 @TechReport{LeVeque:1982:TSM,
28658 author = "Randall John LeVeque",
28659 title = "Time-Split Methods for Partial Differential
28660 Equations",
28661 type = "Technical Report",
28662 number = "STAN-CS-82-904",
28663 institution = inst-STAN-CS,
28664 address = inst-STAN-CS:adr,
28665 pages = "102",
28666 month = apr,
28667 year = "1982",
28668 bibdate = "Wed Nov 26 12:13:45 MST 2025",
28669 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
28670 URL = "",
28671 acknowledgement = ack-nhfb,
28672 remark = "This is the author's thesis.",
28673 }
28674
28675 @TechReport{Trefethen:1982:WPS,
28676 author = "Lloyd N. Trefethen",
28677 title = "Wave Propagation and Stability for Finite Difference
28678 Schemes",
28679 type = "Technical Report",
28680 number = "STAN-CS-82-905",
28681 institution = inst-STAN-CS,
28682 address = inst-STAN-CS:adr,
28683 pages = "207",
28684 month = apr,
28685 year = "1982",
28686 bibdate = "Wed Nov 26 12:13:45 MST 2025",
28687 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
28688 URL = "",
28689 acknowledgement = ack-nhfb,
28690 }
28691
28692 @TechReport{Nash:1982:TNM,
28693 author = "Stephen G. Nash",
28694 title = "Truncated-{Newton} Methods",
28695 type = "Technical Report",
28696 number = "STAN-CS-82-906",
28697 institution = inst-STAN-CS,
28698 address = inst-STAN-CS:adr,
28699 pages = "120",
28700 month = may,
28701 year = "1982",
28702 bibdate = "Wed Nov 26 12:13:45 MST 2025",
28703 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
28704 URL = "",
28705 acknowledgement = ack-nhfb,
28706 }
28707
28708 @TechReport{Mayr:1982:CA,
28709 author = "Ernst W. Mayr",
28710 title = "Combinatorial Algorithms {I}",
28711 type = "Technical Report",
28712 number = "STAN-CS-82-907",
28713 institution = inst-STAN-CS,
28714 address = inst-STAN-CS:adr,
28715 pages = "83",
28716 month = may,
28717 year = "1982",
28718 bibdate = "Wed Nov 26 12:13:45 MST 2025",
28719 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
28720 URL = "",
28721 acknowledgement = ack-nhfb,
28722 }
28723
28724 @TechReport{Clancey:1982:NRR,
28725 author = "William J. Clancey and Reed Letsinger",
28726 title = "Neomycin: Reconfiguring a Rule-Based Expert System for
28727 Application to Teaching",
28728 type = "Technical Report",
28729 number = "STAN-CS-82-908 (HPP-81-2)",
28730 institution = inst-STAN-CS,
28731 address = inst-STAN-CS:adr,
28732 pages = "12",
28733 month = may,
28734 year = "1982",
28735 bibdate = "Thu Nov 20 12:11:36 MST 2025",
28736 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
28737 URL = "http://www-db.stanford.edu/TR/CS-TR-82-908.html",
28738 abstract = "NEOMYClN is a medical consultation system in which
28739 MYClN's knowledge base is reorganized and extended for
28740 use in GUIDON, a teaching program. The new system
28741 constitutes a psychological model for doing diagnosis
28742 designed to provide a basis for interpreting student
28743 behavior and teaching diagnostic strategy. The model
28744 separates out kinds of knowledge that are procedurally
28745 embedded in MYClN's rules and so inaccessible to the
28746 teaching program. The key idea is to represent
28747 explicitly and separately a domain-independent
28748 diagnostic strategy in the form of meta-rules,
28749 knowledge about the structure of the problem space,
28750 causal and data/hypothesis rules and world facts. As a
28751 psychological model, NEOMYCIN captures the
28752 forward-directed, ``compiled associations'' mode of
28753 reasoning that characterizes expert behavior.
28754 Collection and interpretation of data are focused by
28755 the ``differential'' or working memory of hypotheses.
28756 Moreover, the knowledge base is broadened so that
28757 GUIDON can teach a student when to consider a specific
28758 infectious disease and what competing hypotheses to
28759 consider, essentially the knowledge a human would need
28760 in order to use the MYCIN consultation system
28761 properly.",
28762 acknowledgement = ack-nhfb,
28763 xxnumber = "CS-TR-82-908",
28764 }
28765
28766 @TechReport{London:1982:PRS,
28767 author = "Bob London and William J. Clancey",
28768 title = "Plan recognition strategies in student modeling:
28769 prediction and description",
28770 type = "Technical Report",
28771 number = "STAN-CS-82-909 (HPP-82-7)",
28772 institution = inst-STAN-CS,
28773 address = inst-STAN-CS:adr,
28774 pages = "13",
28775 month = may,
28776 year = "1982",
28777 bibdate = "Thu Nov 20 12:11:36 MST 2025",
28778 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
28779 URL = "http://www-db.stanford.edu/TR/CS-TR-82-909.html",
28780 abstract = "This paper describes the student modeler of the
28781 GUIDON2 tutor, which understands plans by a dual search
28782 strategy. It first produces multiple predictions of
28783 student behavior by a model-driven simulation of the
28784 expert. Focused, data-driven searches then explain
28785 incongruities. By supplementing each other, these
28786 methods lead to an efficient and robust plan
28787 understander for a complex domain.",
28788 acknowledgement = ack-nhfb,
28789 xxnumber = "CS-TR-82-909",
28790 }
28791
28792 @TechReport{Clancey:1982:ETP,
28793 author = "William J. Clancey and Bruce G. Buchanan",
28794 title = "Exploration of Teaching and Problem-Solving
28795 Strategies, 1979--1982",
28796 type = "Technical Report",
28797 number = "STAN-CS-82-910 (HPP-82-8)",
28798 institution = inst-STAN-CS,
28799 address = inst-STAN-CS:adr,
28800 pages = "17",
28801 month = may,
28802 year = "1982",
28803 bibdate = "Thu Nov 20 12:11:36 MST 2025",
28804 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
28805 URL = "http://www-db.stanford.edu/TR/CS-TR-82-910.html",
28806 abstract = "This is the final report for Contract
28807 N-00014-79-C-0302, covering the period of 15 March 1979
28808 through 14 March 1982. The goal of the project was to
28809 develop methods for representing teaching and
28810 problem-solving knowledge in computer-based tutorial
28811 systems. One focus of the work was formulation of
28812 principles for managing a case method tutorial
28813 dialogue; the other major focus was investigation of
28814 the use of a production rule representation for the
28815 subject material of a tutorial program. The main theme
28816 pursued by this research is that representing teaching
28817 and problem-solving knowledge separately and explicitly
28818 enhances the ability to build, modify and test complex
28819 tutorial programs. Two major computer programs were
28820 constructed. One was the tutorial program, GUIDON,
28821 which uses a set of explicit ``discourse procedures''
28822 for carrying on a case method dialogue with a student.
28823 GUIDON uses the original MYCIN knowledge base as
28824 subject material, and as such, was an experiment in
28825 exploring the ways in which production rules can be
28826 used in tutoring. GUlDON's teaching knowledge is
28827 separate from and compatible with any knowledge base
28828 that is encoded in MYClN's rule language.
28829 Demonstrations of GUIDON were given for two medical and
28830 one engineering application. Thus, the generality of
28831 this kind of system goes beyond being able to teach
28832 about any problem in a ``case library''--it also allows
28833 teaching expertise to be transferred and tested in
28834 multiple problem domains. The second major program is
28835 the consultation program, NEOMYCIN. This is a second
28836 generation system in which MYClN's knowledge has been
28837 reconfigured to make explicit distinctions that are
28838 important for teaching. Unlike MYCIN, the program uses
28839 the hypothesis-oriented approach and predominantly
28840 forward-directed reasoning. As such, NEOMYCIN is
28841 consistent with and extends psychological models of
28842 diagnostic problem-solving. The program differs from
28843 other knowledge-based Al systems in that reasoning is
28844 completely controlled by a set of explicit meta-rules.
28845 These meta-rules are domain independent and constitute
28846 the diagnostic procedure to be taught to students: the
28847 tasks of diagnosis and heuristics for attending to and
28848 confirming relevant diagnostic hypotheses.",
28849 acknowledgement = ack-nhfb,
28850 xxnumber = "CS-TR-82-910",
28851 }
28852
28853 @TechReport{Roberts:1982:BSC,
28854 author = "Barbara J. Roberts and Irris Marashian",
28855 title = "Bibliography of {Stanford Computer Science} reports,
28856 1963--1982",
28857 type = "Technical Report",
28858 number = "STAN-CS-82-911",
28859 institution = inst-STAN-CS,
28860 address = inst-STAN-CS:adr,
28861 pages = "59",
28862 month = may,
28863 year = "1982",
28864 bibdate = "Thu Nov 20 12:11:36 MST 2025",
28865 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
28866 URL = "http://www-db.stanford.edu/TR/CS-TR-82-911.html",
28867 abstract = "This report lists, in chronological order, all reports
28868 published by the Stanford Computer Science Department
28869 since 1963. Each report is identified by a Computer
28870 Science number, author's name, title, National
28871 Technical Information Service (NTIS) retrieval number
28872 (i.e., AD-XXXXXX), date, and number of pages. If the
28873 NTIS number is not given, it means that the report is
28874 probably not available from NTIS.",
28875 acknowledgement = ack-nhfb,
28876 xxnumber = "CS-TR-82-911",
28877 }
28878
28879 @TechReport{Vardi:1982:IFI,
28880 author = "Moshe Y. Vardi",
28881 title = "The Implication and Finite Implication Problems for
28882 Typed Template Dependencies",
28883 type = "Technical Report",
28884 number = "STAN-CS-82-912",
28885 institution = inst-STAN-CS,
28886 address = inst-STAN-CS:adr,
28887 pages = "iv + 34",
28888 month = may,
28889 year = "1982",
28890 bibdate = "Thu Nov 20 12:11:36 MST 2025",
28891 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
28892 URL = "http://i.stanford.edu/pub/cstr/reports/cs/tr/82/912/CS-TR-82-912.pdf;
28893 http://www-db.stanford.edu/TR/CS-TR-82-912.html",
28894 abstract = "The class of typed template dependencies is a class of
28895 data dependencies that includes embedded multivalued
28896 and join dependencies. We show that the implication and
28897 the finite implication problems for this class are
28898 unsolvable. An immediate corollary is that this class
28899 has no formal system for finite implication. We also
28900 show how to construct a finite set of typed template
28901 dependencies whose implication and finite implication
28902 problems are unsolvable. The class of projected join
28903 dependencies is a proper subclass of the above class,
28904 and it generalizes slightly embedded join dependencies.
28905 It is shown that the implication and the finite
28906 implication problems for this class are also
28907 unsolvable. An immediate corollary is that this class
28908 has no universe-bounded formal system for either
28909 implication or finite implication.",
28910 acknowledgement = ack-nhfb,
28911 pdfpages = "38",
28912 remark = "The outside cover has the incorrect spelling Varde,
28913 but the inside title page has the correct Vardi.",
28914 xxnumber = "CS-TR-82-912",
28915 }
28916
28917 @TechReport{Dietterich:1982:LII,
28918 author = "Thomas Dietterich and Bob London and Kenneth Clarkson
28919 and Geoff Dromey",
28920 title = "Learning and Inductive Inference",
28921 type = "Technical Report",
28922 number = "STAN-CS-82-913 (HPP-82-10, AD-A122351)",
28923 institution = inst-STAN-CS,
28924 address = inst-STAN-CS:adr,
28925 pages = "[various]",
28926 month = may,
28927 year = "1982",
28928 bibdate = "Wed Nov 26 12:13:45 MST 2025",
28929 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
28930 note = "A section of the \booktitle{Handbook of Artificial
28931 Intelligence}, edited by Paul R. Cohen and Edward A.
28932 Feigenbaum.",
28933 URL = "https://apps.dtic.mil/sti/pdfs/ADA122351.pdf",
28934 acknowledgement = ack-nhfb,
28935 pdfpages = "210",
28936 remark = "No PDF in NTRL archive. Found in DTIC archive. No
28937 abstract in document.",
28938 }
28939
28940 @TechReport{Guoan:1982:USM,
28941 author = "Gu Guoan and John Hobby",
28942 title = "Using String Matching to Compress {Chinese}
28943 Characters",
28944 type = "Technical Report",
28945 number = "STAN-CS-82-914",
28946 institution = inst-STAN-CS,
28947 address = inst-STAN-CS:adr,
28948 pages = "ii + 15",
28949 month = may,
28950 year = "1982",
28951 bibdate = "Thu Nov 20 12:11:36 MST 2025",
28952 bibsource = "https://www.math.utah.edu/pub/tex/bib/font.bib;
28953 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib;
28954 https://www.math.utah.edu/pub/tex/bib/string-matching.bib",
28955 URL = "http://i.stanford.edu/pub/cstr/reports/cs/tr/82/914/CS-TR-82-914.pdf;
28956 http://www-db.stanford.edu/TR/CS-TR-82-914.html",
28957 abstract = "A new method for font compression is introduced and
28958 compared to existing methods. A very compact
28959 representation is achieved by using a variant of
28960 McCreight's string matching algorithm to compress the
28961 bounding contour. Results from an actual implementation
28962 are given showing the improvement over other methods
28963 and how this varies with resolution and character
28964 complexity. Compression ratios of up to 150 are
28965 achieved for Chinese characters.",
28966 acknowledgement = ack-nhfb,
28967 pdfpages = "18",
28968 xxnumber = "CS-TR-82-914",
28969 }
28970
28971 @TechReport{Manna:1982:VCP,
28972 author = "Zohar Manna and Amir Pnueli",
28973 title = "Verification of concurrent programs: proving
28974 eventualities by well-founded ranking",
28975 type = "Technical Report",
28976 number = "STAN-CS-82-915",
28977 institution = inst-STAN-CS,
28978 address = inst-STAN-CS:adr,
28979 pages = "iii + 25",
28980 month = may,
28981 year = "1982",
28982 bibdate = "Thu Nov 20 12:11:36 MST 2025",
28983 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
28984 URL = "http://www-db.stanford.edu/TR/CS-TR-82-915.html",
28985 abstract = "In this paper, one of a series on verification of
28986 concurrent programs, we present proof methods for
28987 establishing eventuality and until properties. The
28988 methods are based on well-founded ranking and are
28989 applicable to both ``just'' and ``fair'' computations.
28990 These methods do not assume a decrease of the rank at
28991 each computation step. It is sufficient that there
28992 exists one process which decreases the rank when
28993 activated. Fairness then ensures that the program will
28994 eventually attain its goal.",
28995 acknowledgement = ack-nhfb,
28996 pdfpages = "28",
28997 xxnumber = "CS-TR-82-915",
28998 }
28999
29000 @TechReport{Bent:1982:DWD,
29001 author = "Samuel Watkins Bent",
29002 title = "Dynamic Weighted Data Structures",
29003 type = "Technical Report",
29004 number = "STAN-CS-82-916",
29005 institution = inst-STAN-CS,
29006 address = inst-STAN-CS:adr,
29007 pages = "vii + 75 + 2",
29008 month = may,
29009 year = "1982",
29010 bibdate = "Wed Nov 26 12:13:45 MST 2025",
29011 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
29012 URL = "https://apps.dtic.mil/sti/tr/pdf/ADA122046.pdf",
29013 abstract = "This thesis discusses implementations of an abstract
29014 data structure called a {\em dynamic dictionary}. Such
29015 a data structure stores a collection of items, each of
29016 which is equipped with a key and a weight. Among the
29017 operations we might wish to perform on such a
29018 collection are:\par
29019
29020 (a) accessing an item, given its key\par
29021
29022 (b) inserting a new item\par
29023
29024 (c) deleting an item \par
29025
29026 (d) joining two collections into one\par
29027
29028 (e) splitting a collection into two\par
29029
29030 (f) changing the weight of an item\par
29031
29032 Operations (b)--(f) provide the dynamic nature of the
29033 data structure.\par
29034
29035 [TO BE COMPLETED]",
29036 acknowledgement = ack-nhfb,
29037 pdfpages = "82",
29038 remark = "This is the author's Ph.D. thesis. The ADA122046 PDF
29039 file is OCR'ed scans of microfiche page images.",
29040 }
29041
29042 @TechReport{Mujtaba:1982:MSM,
29043 author = "Mohamed Shahid Mujtaba",
29044 title = "Motion Sequencing of Manipulators",
29045 type = "Technical Report",
29046 number = "STAN-CS-82-917",
29047 institution = inst-STAN-CS,
29048 address = inst-STAN-CS:adr,
29049 pages = "307",
29050 month = jul,
29051 year = "1982",
29052 bibdate = "Wed Nov 26 12:13:45 MST 2025",
29053 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
29054 URL = "",
29055 acknowledgement = ack-nhfb,
29056 remark = "This is the author's thesis.",
29057 }
29058
29059 @TechReport{Wall:1982:MBS,
29060 author = "David Wall",
29061 title = "Mechanisms for Broadcast and Selective Broadcast",
29062 type = "Technical Report",
29063 number = "STAN-CS-82-919 (CSL 80-190)",
29064 institution = inst-STAN-CS,
29065 address = inst-STAN-CS:adr,
29066 pages = "122",
29067 month = nov,
29068 year = "1982",
29069 bibdate = "Wed Nov 26 12:13:45 MST 2025",
29070 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
29071 URL = "",
29072 acknowledgement = ack-nhfb,
29073 remark = "This is the author's thesis.",
29074 }
29075
29076 %%% !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
29077 %%% Tue Dec 16 12:08:43 2025: Continue searches here:
29078
29079 @TechReport{Salisbury:1982:KFA,
29080 author = "J. Kenneth Salisbury",
29081 title = "Kinematic and Force Analysis of Articulated Hands",
29082 type = "Technical Report",
29083 number = "STAN-CS-82-921",
29084 institution = inst-STAN-CS,
29085 address = inst-STAN-CS:adr,
29086 pages = "106",
29087 month = jul,
29088 year = "1982",
29089 bibdate = "Wed Nov 26 12:13:45 MST 2025",
29090 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
29091 URL = "",
29092 acknowledgement = ack-nhfb,
29093 remark = "This is the author's thesis.",
29094 }
29095
29096 @TechReport{Suwa:1982:AVC,
29097 author = "Motoi Suwa and A. Carlisle Scott and Edward H.
29098 Shortliffe",
29099 title = "An approach to verifying completeness and consistency
29100 in a rule-based expert system",
29101 type = "Technical Report",
29102 number = "STAN-CS-82-922 (HPP-81-5, AD-A120806)",
29103 institution = inst-STAN-CS,
29104 address = inst-STAN-CS:adr,
29105 pages = "iii + 19",
29106 month = jun,
29107 year = "1982",
29108 bibdate = "Thu Nov 20 12:11:36 MST 2025",
29109 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
29110 URL = "http://www-db.stanford.edu/TR/CS-TR-82-922.html;
29111 https://apps.dtic.mil/sti/pdfs/ADA120806.pdf",
29112 abstract = "We describe a program for verifying that a set of
29113 rules in an expert system comprehensively spans the
29114 knowledge of a specialized domain. The program has been
29115 devised and tested within the context of the ONCOCIN
29116 System, a rule-based consultant for clinical oncology.
29117 The stylized format of ONCOCIN's rules has allowed the
29118 automatic detection of a number of common errors as the
29119 knowledge base has been developed. This capability
29120 suggests a general mechanism for correcting many
29121 problems with knowledge base completeness and
29122 consistency before they can cause performance errors.",
29123 acknowledgement = ack-nhfb,
29124 pdfpages = "30",
29125 remark = "No PDF in NTRL archive.",
29126 xxnumber = "CS-TR-82-922",
29127 }
29128
29129 @TechReport{Wallis:1982:EPM,
29130 author = "Jerold W. Wallis and Edward H. Shortliffe",
29131 title = "Explanatory power for medical expert systems: studies
29132 in the representation of causal relationships for
29133 clinical consultations",
29134 type = "Technical Report",
29135 number = "STAN-CS-82-923",
29136 institution = inst-STAN-CS,
29137 address = inst-STAN-CS:adr,
29138 pages = "44",
29139 month = jul,
29140 year = "1982",
29141 bibdate = "Thu Nov 20 12:11:36 MST 2025",
29142 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
29143 URL = "http://www-db.stanford.edu/TR/CS-TR-82-923.html",
29144 abstract = "This paper reports on experiments designed to identify
29145 and implement mechanisms for enhancing the explanation
29146 capabilities of reasoning programs for medical
29147 consultation. The goals of an explanation system are
29148 discussed, as is the additional knowledge needed to
29149 meet these goals in a medical domain. We have focussed
29150 on the generation of explanations that are appropriate
29151 for different types of system users. This task requires
29152 a knowledge of what is complex and what is important;
29153 it is further strengthened by a classification of the
29154 associations or causal mechanisms inherent in the
29155 inference rules. A causal representation can also be
29156 used to aid in refining a comprehensive knowledge base
29157 so that the reasoning and explanations are more
29158 adequate. We describe a prototype system which reasons
29159 from causal inference rules and generates explanations
29160 that are appropriate for the user.",
29161 acknowledgement = ack-nhfb,
29162 xxnumber = "CS-TR-82-923",
29163 }
29164
29165 @TechReport{Berger:1982:AMR,
29166 author = "Marsha J. Berger",
29167 title = "Adaptive Mesh Refinement for Hyperbolic Partial
29168 Differential Equations",
29169 type = "Technical Report",
29170 number = "STAN-CS-82-924",
29171 institution = inst-STAN-CS,
29172 address = inst-STAN-CS:adr,
29173 pages = "123",
29174 month = aug,
29175 year = "1982",
29176 bibdate = "Wed Nov 26 12:13:45 MST 2025",
29177 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
29178 URL = "",
29179 acknowledgement = ack-nhfb,
29180 remark = "This is the author's thesis.",
29181 }
29182
29183 @TechReport{Wolper:1982:SCP,
29184 author = "Pierre L. Wolper",
29185 title = "Synthesis of Communicating Processes from Temporal
29186 Logic Specifications",
29187 type = "Technical Report",
29188 number = "STAN-CS-82-925",
29189 institution = inst-STAN-CS,
29190 address = inst-STAN-CS:adr,
29191 pages = "120",
29192 month = aug,
29193 year = "1982",
29194 bibdate = "Wed Nov 26 12:13:45 MST 2025",
29195 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
29196 URL = "",
29197 acknowledgement = ack-nhfb,
29198 remark = "This is the author's thesis.",
29199 }
29200
29201 @TechReport{Buchanan:1982:PRB,
29202 author = "Bruce G. Buchanan and Richard O. Duda",
29203 title = "Principles of Rule-Based Expert Systems",
29204 type = "Technical Report",
29205 number = "STAN-CS-82-926 (HPP-82-14)",
29206 institution = inst-STAN-CS,
29207 address = inst-STAN-CS:adr,
29208 pages = "58",
29209 month = aug,
29210 year = "1982",
29211 bibdate = "Thu Nov 20 12:11:36 MST 2025",
29212 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
29213 URL = "http://www-db.stanford.edu/TR/CS-TR-82-926.html",
29214 abstract = "Rule-based expert systems are surveyed. The most
29215 important considerations are representation and
29216 inference. Rule-based systems make strong assumptions
29217 about the representation of knowledge as conditional
29218 sentences and about the control of inference in one of
29219 three ways. The problem of reasoning with incomplete or
29220 inexact information is also discussed, as are several
29221 other issues regarding the design of expert systems.",
29222 acknowledgement = ack-nhfb,
29223 xxnumber = "CS-TR-82-926",
29224 }
29225
29226 @TechReport{Ullman:1982:CSM,
29227 author = "Jeffrey D. Ullman",
29228 title = "Combining state machines and regular expressions for
29229 automatic synthesis of {VLSI} circuits",
29230 type = "Technical Report",
29231 number = "STAN-CS-82-927",
29232 institution = inst-STAN-CS,
29233 address = inst-STAN-CS:adr,
29234 pages = "14",
29235 month = sep,
29236 year = "1982",
29237 bibdate = "Thu Nov 20 12:11:36 MST 2025",
29238 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib;
29239 https://www.math.utah.edu/pub/tex/bib/string-matching.bib",
29240 URL = "http://www-db.stanford.edu/TR/CS-TR-82-927.html",
29241 abstract = "We discuss a system for translating regular
29242 expressions into logic equations or PLA's, with
29243 particular attention to how we can obtain both the
29244 benefits of regular expressions and state machines as
29245 input languages. An extended example of the method is
29246 given, and the results of our approach is compared with
29247 hand design; in this example we use less than twice the
29248 area of a hand-designed, machine optimized PLA.",
29249 acknowledgement = ack-nhfb,
29250 xxnumber = "CS-TR-82-927",
29251 }
29252
29253 @TechReport{Kuhn:1982:AAM,
29254 author = "Ingeborg M. Kuhn and Gio Wiederhold and Jonathan E.
29255 Rodnick and Diane M. Ramsey-Klee and Sanford Benett and
29256 Donald D. Beck",
29257 title = "Automated ambulatory medical record systems in the
29258 {U.S.}",
29259 type = "Technical Report",
29260 number = "STAN-CS-82-928",
29261 institution = inst-STAN-CS,
29262 address = inst-STAN-CS:adr,
29263 pages = "70",
29264 month = aug,
29265 year = "1982",
29266 bibdate = "Thu Nov 20 12:11:36 MST 2025",
29267 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
29268 URL = "http://www-db.stanford.edu/TR/CS-TR-82-928.html",
29269 abstract = "This report presents an overview of the developments
29270 in Automated Ambulatory Medical Record Systems (AAMRS)
29271 from 1975 to the present. A summary of findings from a
29272 1975 state-of-the-art review is presented along with
29273 the current findings of a follow-up study of a selected
29274 number of the AAMRS operating today. The studies
29275 revealed that effective automated medical record
29276 systems have been developed for ambulatory care
29277 settings and that they are now in the process of being
29278 transferred to other sites or users, either privately
29279 or as a commercial product. Since 1975 there have been
29280 no significant advances in system design. However,
29281 progress has been substantial in terms of achieving
29282 production goals. Even though a variety of systems are
29283 commercially available, there is a continuing need for
29284 research and development to improve the effectiveness
29285 of the systems in use today.",
29286 acknowledgement = ack-nhfb,
29287 xxnumber = "CS-TR-82-928",
29288 }
29289
29290 @TechReport{Maier:1982:FR,
29291 author = "David Maier and Jeffrey D. Ullman",
29292 title = "Fragments of Relations",
29293 type = "Technical Report",
29294 number = "STAN-CS-82-929",
29295 institution = inst-STAN-CS,
29296 address = inst-STAN-CS:adr,
29297 pages = "11",
29298 month = sep,
29299 year = "1982",
29300 bibdate = "Wed Nov 26 12:13:45 MST 2025",
29301 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
29302 URL = "",
29303 acknowledgement = ack-nhfb,
29304 }
29305
29306 @TechReport{Baker:1982:DEI,
29307 author = "Henry Harlyn Baker",
29308 title = "Depth from Edge and Intensity Based Stereo",
29309 type = "Technical Report",
29310 number = "STAN-CS-82-930 (AIM-347)",
29311 institution = inst-STAN-CS,
29312 address = inst-STAN-CS:adr,
29313 pages = "viii + 90",
29314 month = sep,
29315 year = "1982",
29316 bibdate = "Wed Nov 26 12:13:45 MST 2025",
29317 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
29318 URL = "",
29319 abstract = "The past few years have seen a growing interest in the
29320 application of three-dimensional image processing. With
29321 the increasing demand for 3-D spatial information for
29322 tasks of passive navigation ([Gennory 1980]; [Moravec
29323 1980]), automatic surveillance ([Henderson 1979]),
29324 aerial cartography, ([Kelly 1977], [Panton 1978]), and
29325 inspection in industrial automation, the importance of
29326 effective stereo analysis has been made quite clear. A
29327 particular challenge in this area is to provide
29328 reliable and accurate depth data for input to object or
29329 terrain modelling systems, (such as ACRONYM [Brooks
29330 1981a]). This report describes an algorithm for such
29331 stereo sensing. It is founded on an edge-based
29332 line-by-line stereo correspondence scheme --- one which
29333 provides this three-dimensional analysis in a fast,
29334 robust, and parallel implementable way. Its processing
29335 consists of extracting edge descriptions of the images,
29336 matching the edge descriptions on the basis of local
29337 edge measures, and cooperative! removing those edge
29338 pairings formed by the correspondence process which
29339 violate the connectivity structure of the two images. A
29340 further matching process, using a technique similar to
29341 that used for the edges, is done on the image intensity
29342 values within intervals defined by the edge
29343 correspondence. The result of the processing is a full
29344 image array depth map of the scene viewed.",
29345 acknowledgement = ack-nhfb,
29346 pdfpages = "100",
29347 }
29348
29349 @TechReport{Aikins:1982:PES,
29350 author = "Janice S. Aikins and John C. Kunz and Edward H.
29351 Shortliffe and Robert J. Fallat",
29352 title = "{PUFF}: an expert system for interpretation of
29353 pulmonary function data",
29354 type = "Technical Report",
29355 number = "STAN-CS-82-931 (HPP-82-13)",
29356 institution = inst-STAN-CS,
29357 address = inst-STAN-CS:adr,
29358 pages = "iv + 21",
29359 month = sep,
29360 year = "1982",
29361 bibdate = "Thu Nov 20 12:11:36 MST 2025",
29362 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
29363 URL = "http://www-db.stanford.edu/TR/CS-TR-82-931.html",
29364 abstract = "The application of Artificial Intelligence techniques
29365 to real-world problems has produced promising research
29366 results, but seldom has a system become a useful tool
29367 in its domain of expertise. Notable exceptions are the
29368 DENDRAL and MOLGEN systems. This paper describes PUFF,
29369 a program that interprets lung function test data and
29370 has become a working tool in the pulmonary physiology
29371 lab of a large hospital. Elements of the problem that
29372 paved the way for its success are examined, as are
29373 significant limitations of the solution that warrant
29374 further study.",
29375 acknowledgement = ack-nhfb,
29376 pdfpages = "26",
29377 xxnumber = "CS-TR-82-931",
29378 }
29379
29380 @TechReport{Shortliffe:1982:ESR,
29381 author = "Edward H. Shortliffe and Lawrence M. Fagan",
29382 title = "Expert systems research: modeling the medical decision
29383 making process",
29384 type = "Technical Report",
29385 number = "STAN-CS-82-932 (HPP-82-3)",
29386 institution = inst-STAN-CS,
29387 address = inst-STAN-CS:adr,
29388 pages = "iv + 23",
29389 month = sep,
29390 year = "1982",
29391 bibdate = "Thu Nov 20 12:11:36 MST 2025",
29392 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
29393 URL = "http://www-db.stanford.edu/TR/CS-TR-82-932.html",
29394 abstract = "During the quarter century since the birth of the
29395 branch of computer science known as artificial
29396 intelligence (AI), much of the research has focused on
29397 developing symbolic models of human inference. In the
29398 last decade several related AI research themes have
29399 come together to form what is now known as ``expert
29400 systems research.'' In this paper we review AI and
29401 expert systems to acquaint the reader with the field
29402 and to suggest ways in which this research will
29403 eventually be applied to advanced medical monitoring.",
29404 acknowledgement = ack-nhfb,
29405 pdfpages = "28",
29406 xxnumber = "CS-TR-82-932",
29407 }
29408
29409 @TechReport{Klein:1982:AMS,
29410 author = "Shmuel T. Klein and Eli Shamir",
29411 title = "An algorithmic method for studying percolation
29412 clusters",
29413 type = "Technical Report",
29414 number = "STAN-CS-82-933",
29415 institution = inst-STAN-CS,
29416 address = inst-STAN-CS:adr,
29417 pages = "13",
29418 month = sep,
29419 year = "1982",
29420 bibdate = "Thu Nov 20 12:11:36 MST 2025",
29421 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
29422 URL = "http://www-db.stanford.edu/TR/CS-TR-82-933.html",
29423 abstract = "In percolation theory one studies configurations,
29424 based on some infinite lattice, where the sites of the
29425 lattice are randomly made F (full) with probability p
29426 or E (empty) with probability 1-p. For p &gt; $ p_c $,
29427 the set of configurations which contain an infinite
29428 cluster (a connectivity component) has probability 1.
29429 Using an algorithmic method and a rearrangement lemma
29430 for Bernoulli sequences, we compute the
29431 boundary-to-body quotient of infinite clusters and
29432 prove it has the definite value (1-p)/p with
29433 probability 1.",
29434 acknowledgement = ack-nhfb,
29435 xxnumber = "CS-TR-82-933",
29436 }
29437
29438 @TechReport{Barr:1982:USL,
29439 author = "A. Barr and P. Cohen and L. Fagan",
29440 title = "Understanding Spoken Language",
29441 type = "Technical Report",
29442 number = "STAN-CS-82-934 (HPP-82-16)",
29443 institution = inst-STAN-CS,
29444 address = inst-STAN-CS:adr,
29445 pages = "52",
29446 month = sep,
29447 year = "1982",
29448 bibdate = "Wed Nov 26 12:13:45 MST 2025",
29449 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
29450 URL = "",
29451 acknowledgement = ack-nhfb,
29452 pdfpages = "96",
29453 remark = "No PDF in NTRL archive. Published in
29454 \booktitle{Handbook of Artificial Intelligence}, Vol.
29455 I, Chap. 5, July 1982, 50 pages.",
29456 }
29457
29458 @TechReport{Tappel:1982:PLA,
29459 author = "Tappel and Westfold and Barr",
29460 title = "Programming Languages for {AI} Research",
29461 type = "Technical Report",
29462 number = "STAN-CS-82-935 (HPP-82-17)",
29463 institution = inst-STAN-CS,
29464 address = inst-STAN-CS:adr,
29465 pages = "90",
29466 month = sep,
29467 year = "1982",
29468 bibdate = "Wed Nov 26 12:13:45 MST 2025",
29469 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
29470 URL = "",
29471 acknowledgement = ack-nhfb,
29472 }
29473
29474 @TechReport{Cohen:1982:MC,
29475 author = "Paul R. Cohen",
29476 title = "Models of Cognition",
29477 type = "Technical Report",
29478 number = "STAN-CS-82-936 (HPP-82-18, AD-A222300)",
29479 institution = inst-STAN-CS,
29480 address = inst-STAN-CS:adr,
29481 pages = "81",
29482 month = oct,
29483 year = "1982",
29484 bibdate = "Wed Nov 26 12:13:45 MST 2025",
29485 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
29486 URL = "",
29487 acknowledgement = ack-nhfb,
29488 pdfpages = "84",
29489 remark = "Many pages are rotated 90 degrees up or down. The
29490 abstract is present, but not extractable.",
29491 }
29492
29493 @TechReport{Ballantyne:1982:AD,
29494 author = "Michael Ballantyne and W. W. Bledsoe and Jon Doyle and
29495 Robert C. Moore and Richard Pattis and Stanley J.
29496 Rosenschein",
29497 title = "Automatic Deduction",
29498 type = "Technical Report",
29499 number = "STAN-CS-82-937 (HPP-82-19, PB96-150883)",
29500 institution = inst-STAN-CS,
29501 address = inst-STAN-CS:adr,
29502 pages = "77--132",
29503 month = oct,
29504 year = "1982",
29505 bibdate = "Wed Nov 26 12:13:45 MST 2025",
29506 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
29507 note = "Chapter XII of Volume III of the \booktitle{Handbook
29508 of Artificial Intelligence}, edited by Paul R. Cohen
29509 and Edward A. Feigenbaum.",
29510 URL = "",
29511 acknowledgement = ack-nhfb,
29512 pdfpages = "64",
29513 remark = "No abstract is available.",
29514 }
29515
29516 @TechReport{Kanade:1982:V,
29517 author = "Takeo Kanade",
29518 title = "Vision",
29519 type = "Technical Report",
29520 number = "STAN-CS-82-938 (HPP-82-20)",
29521 institution = inst-STAN-CS,
29522 address = inst-STAN-CS:adr,
29523 pages = "220",
29524 month = sep,
29525 year = "1982",
29526 bibdate = "Wed Nov 26 12:13:45 MST 2025",
29527 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
29528 URL = "",
29529 acknowledgement = ack-nhfb,
29530 remark = "No PDF in NTRL archive.",
29531 }
29532
29533 @TechReport{Cohen:1982:PPS,
29534 author = "Paul R. Cohen",
29535 title = "Planning and Problem Solving",
29536 type = "Technical Report",
29537 number = "STAN-CS-82-939 (HPP-82-21, AD-A222298)",
29538 institution = inst-STAN-CS,
29539 address = inst-STAN-CS:adr,
29540 pages = "515--567",
29541 month = oct,
29542 year = "1982",
29543 bibdate = "Wed Nov 26 12:13:45 MST 2025",
29544 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
29545 note = "Chapter XV of Volume III of the \booktitle{Handbook of
29546 Artificial Intelligence}, edited by Paul R. Cohen and
29547 Edward A. Feigenbaum.",
29548 URL = "",
29549 acknowledgement = ack-nhfb,
29550 pdfpages = "60",
29551 remark = "No abstract is available.",
29552 }
29553
29554 @TechReport{Ullman:1982:EUR,
29555 author = "Jeffrey D. Ullman and Moshe Y. Vardi and David Maier",
29556 title = "The Equivalence of Universal Relation Definitions",
29557 type = "Technical Report",
29558 number = "STAN-CS-82-940",
29559 institution = inst-STAN-CS,
29560 address = inst-STAN-CS:adr,
29561 pages = "i + 27",
29562 month = oct,
29563 year = "1982",
29564 bibdate = "Wed Nov 26 12:13:45 MST 2025",
29565 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
29566 URL = "https://apps.dtic.mil/sti/html/tr/ADA324622/;
29567 https://apps.dtic.mil/sti/tr/pdf/ADA324622.pdf",
29568 abstract = "The universal relation model aims at achieving
29569 complete access path independence by relieving the user
29570 of the need for logical navigation among relations. It
29571 assumes that for every set of attributes there is a
29572 basic relationship that the user has in mind. Two
29573 fundamentally different approaches to the universal
29574 relation model have been taken. The first approach sees
29575 the universal relation as a user view, about which he
29576 poses queries. Specifically, a representative instance
29577 is constructed, and queries are answered based on its
29578 non-null part. The second approach sees the model as
29579 having query-processing capabilities that relieve the
29580 user of the need to specify the logical access path.
29581 The relationship between the user's view and the
29582 computation answering a query is a central issue that
29583 systems supporting a universal view of data must
29584 handle.\par
29585
29586 We introduce ``lossless'' and ``monotone'' expressions
29587 and show that the representative instance construction
29588 has these properties. Also, every lossless monotone
29589 expression produces a result that is a subset of what
29590 the representative instance produces. We show that the
29591 existence of any first-order formula to simulate the
29592 representative instance is equivalent to a
29593 ``boundedness'' condition on the dependencies defining
29594 the database scheme. In addition, whenever there is a
29595 first-order formula to simulate the representative
29596 instance, then we can do so with an expression of
29597 simple form: the union of tableau mappings. We close
29598 with a discussion of some of the problems with the
29599 representative instance approach that suggest better
29600 universal relation models may be possible.",
29601 acknowledgement = ack-nhfb,
29602 pdfpages = "28",
29603 }
29604
29605 @TechReport{Martin:1982:ILI,
29606 author = "Paul A. Martin",
29607 title = "Integrating Local Information to Understand Dialog",
29608 type = "Technical Report",
29609 number = "STAN-CS-82-941 (AIM-348)",
29610 institution = inst-STAN-CS,
29611 address = inst-STAN-CS:adr,
29612 pages = "131",
29613 month = oct,
29614 year = "1982",
29615 bibdate = "Wed Nov 26 12:13:45 MST 2025",
29616 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
29617 URL = "",
29618 acknowledgement = ack-nhfb,
29619 remark = "This is the author's thesis.",
29620 }
29621
29622 @TechReport{Rowe:1982:MDI,
29623 author = "Neil C. Rowe",
29624 title = "Modelling degrees of item interest for a general
29625 database query system",
29626 type = "Technical Report",
29627 number = "STAN-CS-82-947",
29628 institution = inst-STAN-CS,
29629 address = inst-STAN-CS:adr,
29630 pages = "vii + 34",
29631 month = apr,
29632 year = "1982",
29633 bibdate = "Thu Nov 20 12:11:36 MST 2025",
29634 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
29635 URL = "http://www-db.stanford.edu/TR/CS-TR-82-947.html",
29636 abstract = "Many databases support decision-making. Often this
29637 means choices between alternatives according to partly
29638 subjective or conflicting criteria. Database query
29639 languages are generally designed for precise, logical
29640 specification of the data of interest, and tend to be
29641 awkward in the aforementioned circumstances.
29642 Information retrieval research suggests several
29643 solutions, but there are obstacles to generalizing
29644 these ideas to most databases. To address this problem
29645 we propose a methodology for automatically deriving and
29646 monitoring ``degrees of interest'' among alternatives
29647 for a user of a database system. This includes (a) a
29648 decision theory model of the value of information to
29649 the user, and (b) inference mechanisms, based in part
29650 on ideas from artificial intelligence, that can tune
29651 the model to observed user behavior. This theory has
29652 important applications to improving efficiency and
29653 cooperativeness of the interface between a
29654 decision-maker and a database system.",
29655 acknowledgement = ack-nhfb,
29656 pdfpages = "42",
29657 xxnumber = "CS-TR-82-947",
29658 }
29659
29660 @TechReport{Rowe:1982:TPR,
29661 author = "Neil C. Rowe",
29662 title = "Three Papers on Rule-Based Estimation of Statistics on
29663 Databases",
29664 type = "Technical Report",
29665 number = "STAN-CS-82-948",
29666 institution = inst-STAN-CS,
29667 address = inst-STAN-CS:adr,
29668 pages = "38",
29669 month = oct,
29670 year = "1982",
29671 bibdate = "Wed Nov 26 12:13:45 MST 2025",
29672 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
29673 URL = "",
29674 acknowledgement = ack-nhfb,
29675 }
29676
29677 @TechReport{Broder:1982:SN,
29678 author = "Andrei Z. Broder",
29679 title = "The $r$-{Stirling} Numbers",
29680 type = "Technical Report",
29681 number = "STAN-CS-82-949",
29682 institution = inst-STAN-CS,
29683 address = inst-STAN-CS:adr,
29684 pages = "ii + 22",
29685 month = dec,
29686 year = "1982",
29687 bibdate = "Thu Nov 20 12:11:36 MST 2025",
29688 bibsource = "http://i.stanford.edu/pub/cstr/reports/cs/tr/82/949/CS-TR-82-949.pdf;
29689 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
29690 URL = "http://www-db.stanford.edu/TR/CS-TR-82-949.html",
29691 abstract = "The $r$-Stirling numbers of the first and second kind
29692 count restricted permutations and respectively
29693 restricted partitions, the restriction being that the
29694 first r elements must be in distinct cycles and
29695 respectively distinct subsets. The combinatorial and
29696 algebraic properties of these numbers, which is most
29697 cases generalize similar properties of the regular
29698 Stirling numbers, are explored starting from the above
29699 definition.",
29700 acknowledgement = ack-nhfb,
29701 pdfpages = "26",
29702 xxnumber = "CS-TR-82-949",
29703 }
29704
29705 @TechReport{Pratt:1982:FPS,
29706 author = "Vaughan Pratt",
29707 title = "Five paradigm shifts in programming language design
29708 and their realization in {Viron}, a dataflow
29709 programming environment",
29710 type = "Technical Report",
29711 number = "STAN-CS-82-951",
29712 institution = inst-STAN-CS,
29713 address = inst-STAN-CS:adr,
29714 pages = "ii + 9",
29715 month = dec,
29716 year = "1982",
29717 bibdate = "Thu Nov 20 12:11:36 MST 2025",
29718 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
29719 URL = "http://www-db.stanford.edu/TR/CS-TR-82-951.html",
29720 abstract = "We describe five paradigm shifts in programming
29721 language design, some old and some relatively new,
29722 namely Effect to Entity, Serial to Parallel, Partition
29723 Types to Predicate Types, Computable to Definable, and
29724 Syntactic Consistency to Semantic Consistency. We argue
29725 for the adoption of each. We exhibit a programming
29726 language, Viron, that capitalizes on these shifts.",
29727 acknowledgement = ack-nhfb,
29728 pdfpages = "12",
29729 xxnumber = "CS-TR-82-951",
29730 }
29731
29732 @TechReport{Moszkowski:1982:TLM,
29733 author = "Ben Moszkowski",
29734 title = "A Temporal Logic for Multi-Level Reasoning about
29735 Hardware",
29736 type = "Technical Report",
29737 number = "STAN-CS-82-952",
29738 institution = inst-STAN-CS,
29739 address = inst-STAN-CS:adr,
29740 pages = "25",
29741 month = nov,
29742 year = "1982",
29743 bibdate = "Wed Nov 26 12:13:45 MST 2025",
29744 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
29745 URL = "",
29746 acknowledgement = ack-nhfb,
29747 }
29748
29749 @TechReport{Buchanan:1982:PBW,
29750 author = "Bruce G. Buchanan",
29751 title = "Partial Bibliography of Work on Expert Systems",
29752 type = "Technical Report",
29753 number = "STAN-CS-82-953 (HPP-82-30)",
29754 institution = inst-STAN-CS,
29755 address = inst-STAN-CS:adr,
29756 pages = "15",
29757 month = dec,
29758 year = "1982",
29759 bibdate = "Thu Nov 20 12:11:36 MST 2025",
29760 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
29761 URL = "http://www-db.stanford.edu/TR/CS-TR-82-953.html",
29762 abstract = "Since 1971 many publications on expert systems have
29763 appeared in conference proceedings and the technical
29764 literature. Over 200 titles are listed in the
29765 bibliography. Many relevant publications are omitted
29766 because they overlap publications on the list; others
29767 should be called to my attention.",
29768 acknowledgement = ack-nhfb,
29769 remark = "No PDF in NTRL archive.",
29770 xxnumber = "CS-TR-82-953",
29771 }
29772
29773 @TechReport{Manna:1982:HCT,
29774 author = "Zohar Manna and Amir Pnueli",
29775 title = "How to Cook a Temporal Proof System for Your Pet
29776 Language",
29777 type = "Technical Report",
29778 number = "STAN-CS-82-954",
29779 institution = inst-STAN-CS,
29780 address = inst-STAN-CS:adr,
29781 pages = "14",
29782 month = nov,
29783 year = "1982",
29784 bibdate = "Wed Nov 26 12:13:45 MST 2025",
29785 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
29786 URL = "",
29787 acknowledgement = ack-nhfb,
29788 }
29789
29790 @TechReport{Goldman:1982:DIM,
29791 author = "Ron Goldman",
29792 title = "Design of an Interactive Manipulator Programming
29793 Environment",
29794 type = "Technical Report",
29795 number = "STAN-CS-82-955 (AIM-350)",
29796 institution = inst-STAN-CS,
29797 address = inst-STAN-CS:adr,
29798 pages = "149",
29799 month = dec,
29800 year = "1982",
29801 bibdate = "Wed Nov 26 12:13:45 MST 2025",
29802 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
29803 URL = "",
29804 acknowledgement = ack-nhfb,
29805 remark = "This is the author's thesis.",
29806 }
29807
29808 @TechReport{Barr:1982:AIC,
29809 author = "Avron Barr",
29810 title = "Artificial Intelligence: Cognition as Computation",
29811 type = "Technical Report",
29812 number = "STAN-CS-82-956 (HPP-82-29, AD-A131804)",
29813 institution = inst-STAN-CS,
29814 address = inst-STAN-CS:adr,
29815 pages = "iv + 28",
29816 month = aug,
29817 year = "1982",
29818 bibdate = "Wed Nov 26 12:13:45 MST 2025",
29819 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
29820 URL = "",
29821 abstract = "The ability and compulsion to know are as
29822 characteristic of our human nature as arc our physical
29823 posture and our languages. Knowledge and intelligence,
29824 as scientific concepts, arc used to describe how an
29825 organism's experience appears to mediate its behavior.
29826 This report discusses the relation between artificial
29827 intelligence (AI) research in computer science and the
29828 approaches of other disciplines that study the nature
29829 of intelligence, cognition, and mind. The state of AI
29830 after 25 years of work in the field is reviewed, as are
29831 the views of its practitioners about its relation to
29832 cognate disciplines. The report concludes with a
29833 discussion of some possible effects on our scientific
29834 work of emerging commercial applications of AI
29835 technology, that is, machines that can know and can
29836 take part in human cognitive activities.",
29837 acknowledgement = ack-nhfb,
29838 pdfpages = "32",
29839 }
29840
29841 @TechReport{Zabala-Salelles:1982:IGO,
29842 author = "Ignacio Andres Zabala-Salelles",
29843 title = "Interfacing with Graphic Objects",
29844 type = "Technical Report",
29845 number = "STAN-CS-82-960",
29846 institution = inst-STAN-CS,
29847 address = inst-STAN-CS:adr,
29848 pages = "146",
29849 month = dec,
29850 year = "1982",
29851 bibdate = "Wed Nov 26 12:13:45 MST 2025",
29852 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
29853 URL = "",
29854 acknowledgement = ack-nhfb,
29855 remark = "This is the author's thesis.",
29856 }
29857
29858 @TechReport{Korth:1983:SUD,
29859 author = "Henry Korth and Gabriel Kuper and Jeffrey Ullman",
29860 title = "{System/U}: a Database System based on the Universal
29861 Relation Assumption",
29862 type = "Technical Report",
29863 number = "STAN-CS-82-944",
29864 institution = inst-STAN-CS,
29865 address = inst-STAN-CS:adr,
29866 pages = "17",
29867 month = jan,
29868 year = "1983",
29869 bibdate = "Wed Nov 26 12:13:45 MST 2025",
29870 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
29871 URL = "",
29872 acknowledgement = ack-nhfb,
29873 }
29874
29875 @TechReport{Gilbert:1983:APT,
29876 author = "Erik James Gilbert",
29877 title = "Algorithm Partitioning Tools for a High-Performance
29878 Multiprocessor",
29879 type = "Technical Report",
29880 number = "STAN-CS-82-946",
29881 institution = inst-STAN-CS,
29882 address = inst-STAN-CS:adr,
29883 pages = "133",
29884 month = feb,
29885 year = "1983",
29886 bibdate = "Wed Nov 26 12:13:45 MST 2025",
29887 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
29888 URL = "",
29889 acknowledgement = ack-nhfb,
29890 remark = "This is the author's thesis.",
29891 }
29892
29893 @TechReport{Winston:1983:LPD,
29894 author = "Patrick H. Winston and Thomas O. Binford and Boris
29895 Katz and Michael Lowry",
29896 title = "Learning physical description from functional
29897 definitions, examples and precedents",
29898 type = "Technical Report",
29899 number = "STAN-CS-82-950 (AIM-349)",
29900 institution = inst-STAN-CS,
29901 address = inst-STAN-CS:adr,
29902 pages = "25",
29903 month = jan,
29904 year = "1983",
29905 bibdate = "Thu Nov 20 12:11:36 MST 2025",
29906 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
29907 URL = "http://www-db.stanford.edu/TR/CS-TR-82-950.html",
29908 abstract = "It is too hard to tell vision systems what things look
29909 like. It is easier to talk about purpose and what
29910 things are for. Consequently, we want vision systems to
29911 use functional descriptions to identify things, when
29912 necessary, and we want them to learn physical
29913 descriptions for themselves, when possible. This paper
29914 describes a theory that explains how to make such
29915 systems work. The theory is a synthesis of two sets of
29916 ideas: ideas about learning from precedents and
29917 exercises developed at MIT and ideas about physical
29918 description developed at Stanford. The strength of the
29919 synthesis is illustrated by way of representative
29920 experiments. All of these experiments have been
29921 performed with an implementation system.",
29922 acknowledgement = ack-nhfb,
29923 xxnumber = "CS-TR-82-950",
29924 }
29925
29926 @TechReport{Navathe:1983:VPP,
29927 author = "Navathe and Ceri and Wiederhold and Dou",
29928 title = "Vertical Partitioning for Physical and Distribution
29929 Design of Databases",
29930 type = "Technical Report",
29931 number = "STAN-CS-82-957",
29932 institution = inst-STAN-CS,
29933 address = inst-STAN-CS:adr,
29934 pages = "33",
29935 month = jan,
29936 year = "1983",
29937 bibdate = "Wed Nov 26 12:13:45 MST 2025",
29938 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
29939 URL = "",
29940 acknowledgement = ack-nhfb,
29941 }
29942
29943 @TechReport{Mulsant:1983:KED,
29944 author = "Benoit Mulsant and David Servan-Schreiber",
29945 title = "Knowledge Engineering: a Daily Activity on a Hospital
29946 Ward",
29947 type = "Technical Report",
29948 number = "STAN-CS-82-998 (HPP-83-40)",
29949 institution = inst-STAN-CS,
29950 address = inst-STAN-CS:adr,
29951 pages = "iii + 41",
29952 month = sep,
29953 year = "1983",
29954 bibdate = "Thu Nov 20 12:11:36 MST 2025",
29955 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
29956 URL = "http://www-db.stanford.edu/TR/CS-TR-82-998.html",
29957 abstract = "Two common barriers against the development and
29958 diffusion of Expert Systems in Medicine are the
29959 difficulty of design and the low level of acceptance.
29960 This paper reports on an original experience which
29961 entails potential solutions of these issues: the task
29962 of Knowledge Engineering is performed by medical
29963 students and residents on a hospital ward using a
29964 sophisticated Knowledge Acquisition System, EMYCIN. The
29965 Knowledge Engineering sessions are analysed in detail
29966 and a structured method is proposed. A transcript of a
29967 sample run of the resulting program is presented along
29968 with an evaluation of its performance, acceptance,
29969 educational potential and amount of endeavour required.
29970 The impact of the Knowledge Engineering process itself
29971 is then assessed both from the residents and the
29972 medical students standpoint. Finally, the possibility
29973 of generalizing the experiment is examined.",
29974 acknowledgement = ack-nhfb,
29975 pdfpages = "46",
29976 xxnumber = "CS-TR-82-998",
29977 }
29978
29979 @TechReport{Zwaenepoel:1983:PRP,
29980 author = "Willy Zwaenepoel and Keith A. Lantz",
29981 title = "{Perseus}: Retrospective on a Portable Operating
29982 System",
29983 type = "Technical Report",
29984 number = "STAN-CS-83-945 (CSL-TR-206)",
29985 institution = inst-STAN-CS,
29986 address = inst-STAN-CS:adr,
29987 pages = "ii + 8",
29988 month = feb,
29989 year = "1983",
29990 bibdate = "Thu Nov 20 12:11:36 MST 2025",
29991 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
29992 URL = "http://www-db.stanford.edu/TR/CS-TR-83-945.html",
29993 abstract = "We describe the operating system Perseus, developed as
29994 part of a study into the issues of computer
29995 communications and their impact on operating system and
29996 programming language design. Perseus was designed to be
29997 portable by virtue of its kernel-based structure and
29998 its implementation in Pascal. In particular,
29999 machine-dependent code is limited to the kernel and
30000 most operating systems functions are provided by server
30001 processes, running in user mode. Perseus was designed
30002 to evolve into a distributed operating system by virtue
30003 of its interprocess communication facilities, based on
30004 message-passing. This paper presents an overview of the
30005 system and gives an assessment of how far it satisfied
30006 its original goals. Specifically, we evaluate its
30007 interprocess communication facilities and kernel-based
30008 structure, followed by a discussion of portability. We
30009 close with a brief history of the project, pointing out
30010 major milestones and stumbling blocks along the way.",
30011 acknowledgement = ack-nhfb,
30012 pdfpages = "10",
30013 xxnumber = "CS-TR-83-945",
30014 }
30015
30016 @TechReport{Lantz:1983:TGG,
30017 author = "Keith A. Lantz and David R. Cheriton and William I.
30018 Nowicki",
30019 title = "Third Generation Graphics for Distributed Systems",
30020 type = "Technical Report",
30021 number = "STAN-CS-83-958 (CSL Technical Report 235,
30022 AD-A126695)",
30023 institution = inst-STAN-CS,
30024 address = inst-STAN-CS:adr,
30025 pages = "v + 36",
30026 month = feb,
30027 year = "1983",
30028 bibdate = "Wed Nov 26 12:13:45 MST 2025",
30029 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
30030 URL = "https://apps.dtic.mil/sti/tr/pdf/ADA126695.pdf",
30031 abstract = "The Stanford Network Graphics Project has the goal of
30032 providing high-quality interactive graphics over both
30033 local-area and long-haul networks. Specifically, a user
30034 sitting at an intelligent workstation should have
30035 simultaneous access to a variety of graphical and
30036 non-graphical applications distributed throughout an
30037 internetwork. Interaction with these applications must
30038 be responsive, which requires that much of the
30039 interaction be handled by the workstation itself. To do
30040 so the workstation must deal in terms of high-level
30041 objects, rather than graphical output primitives. That
30042 is, it must provide both modeling and viewing
30043 facilities, in contrast to contemporary graphics
30044 systems. This paper describes the system architecture
30045 we have developed and the hardware and software
30046 components we are using to realize this architecture in
30047 the Stanford University Network environment.",
30048 acknowledgement = ack-nhfb,
30049 pdfpages = "39",
30050 remark = "No PDF in NTRL archive. Found in DTIC archive. The PDF
30051 file is OCR'ed scans of microfiche page images.",
30052 }
30053
30054 @TechReport{Karplus:1983:CIP,
30055 author = "Kevin Karplus",
30056 title = "{CHISEL} --- an Introduction to the Programming
30057 Language {C} for {VLSI} Layout",
30058 type = "Technical Report",
30059 number = "STAN-CS-83-959",
30060 institution = inst-STAN-CS,
30061 address = inst-STAN-CS:adr,
30062 pages = "137",
30063 month = jan,
30064 year = "1983",
30065 bibdate = "Wed Nov 26 12:13:45 MST 2025",
30066 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
30067 URL = "",
30068 acknowledgement = ack-nhfb,
30069 remark = "This is the author's thesis.",
30070 }
30071
30072 @TechReport{Arnold:1983:ASP,
30073 author = "R. David Arnold",
30074 title = "Automated Stereo Perception",
30075 type = "Technical Report",
30076 number = "STAN-CS-83-961 (AIM-351, AD-A130645)",
30077 institution = inst-STAN-CS,
30078 address = inst-STAN-CS:adr,
30079 pages = "vii + 123",
30080 month = mar,
30081 year = "1983",
30082 bibdate = "Wed Nov 26 12:13:45 MST 2025",
30083 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
30084 URL = "",
30085 acknowledgement = ack-nhfb,
30086 advisor = "Thomas O. Binford",
30087 pdfpages = "133",
30088 remark = "No abstract is available.",
30089 remark = "This is the author's Ph.D. thesis.",
30090 }
30091
30092 @TechReport{Berg:1983:BSC,
30093 author = "Kathryn A. Berg",
30094 title = "Bibliography of {Stanford Computer Science} reports,
30095 1963--1983",
30096 type = "Technical Report",
30097 number = "STAN-CS-83-962",
30098 institution = inst-STAN-CS,
30099 address = inst-STAN-CS:adr,
30100 pages = "65",
30101 month = mar,
30102 year = "1983",
30103 bibdate = "Thu Nov 20 12:11:36 MST 2025",
30104 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
30105 URL = "http://www-db.stanford.edu/TR/CS-TR-83-962.html",
30106 abstract = "This report lists, in chronological order, all reports
30107 published by the Stanford Computer Science Department
30108 since 1963. Each report is identified by a Computer
30109 Science number, author's name, title, National
30110 Technical Information Service (NTIS) retrieval number
30111 (i.e., AD-XXXXXX), date, and number of pages. If an
30112 NTIS number is not given, it means that the report is
30113 probably not available from NTIS.",
30114 acknowledgement = ack-nhfb,
30115 pdfpages = "71",
30116 xxnumber = "CS-TR-83-962",
30117 }
30118
30119 @TechReport{Halpern:1983:HSB,
30120 author = "Joseph Halpern and Zohar Manna and Ben Moszkowski",
30121 title = "A Hardware Semantics Based on Temporal Intervals",
30122 type = "Technical Report",
30123 number = "STAN-CS-83-963",
30124 institution = inst-STAN-CS,
30125 address = inst-STAN-CS:adr,
30126 pages = "26",
30127 month = mar,
30128 year = "1983",
30129 bibdate = "Thu Nov 20 12:11:36 MST 2025",
30130 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
30131 URL = "http://www-db.stanford.edu/TR/CS-TR-83-963.html",
30132 abstract = "We present an interval-based temporal logic that
30133 permits the rigorous specification of a variety of
30134 hardware components and facilitates describing
30135 properties such as correctness of implementation.
30136 Conceptual levels of circuit operation ranging from
30137 detailed quantitative timing and signal propagation up
30138 to functional behavior are integrated in a unified way.
30139 After giving some motivation for reasoning about
30140 hardware, we present the propositional and first-order
30141 syntax and semantics of the temporal logic. In addition
30142 we illustrate techniques for describing signal
30143 transitions as well as for formally specifying and
30144 comparing a number of delay models. Throughout the
30145 discussion, the formalism provides a means for
30146 examining such concepts as device equivalence and
30147 internal states.",
30148 acknowledgement = ack-nhfb,
30149 xxnumber = "CS-TR-83-963",
30150 }
30151
30152 @TechReport{Manna:1983:PPP,
30153 author = "Zohar Manna and Amir Pnueli",
30154 title = "Proving Precedence Properties: The Temporal Way",
30155 type = "Technical Report",
30156 number = "STAN-CS-83-964",
30157 institution = inst-STAN-CS,
30158 address = inst-STAN-CS:adr,
30159 pages = "ii + 38",
30160 month = apr,
30161 year = "1983",
30162 bibdate = "Thu Nov 20 12:11:36 MST 2025",
30163 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
30164 URL = "http://i.stanford.edu/pub/cstr/reports/cs/tr/83/964/CS-TR-83-964.pdf;
30165 http://www-db.stanford.edu/TR/CS-TR-83-964.html",
30166 abstract = "This paper explores the three important classes of
30167 temporal properties of concurrent programs: invariance,
30168 liveness and precedence. It presents the first
30169 methodological approach to the precedence properties,
30170 while providing a review of the invariance and liveness
30171 properties. The approach is based on the 'unless'
30172 operator, which is a weak version of the 'until'
30173 operator. For each class of properties, we present a
30174 single complete proof principle. Finally, we show that
30175 the properties of each class are decidable over finite
30176 state programs.",
30177 acknowledgement = ack-nhfb,
30178 pdfpages = "40",
30179 xxnumber = "CS-TR-83-964",
30180 }
30181
30182 @TechReport{Ghosh:1983:ATD,
30183 author = "Pijush K. Ghosh",
30184 title = "An approach to type design and text composition in
30185 {Indian} scripts",
30186 type = "Technical Report",
30187 number = "STAN-CS-83-965",
30188 institution = inst-STAN-CS,
30189 address = inst-STAN-CS:adr,
30190 pages = "131",
30191 month = apr,
30192 year = "1983",
30193 bibdate = "Thu Nov 20 12:11:36 MST 2025",
30194 bibsource = "https://www.math.utah.edu/pub/tex/bib/font.bib;
30195 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib;
30196 https://www.math.utah.edu/pub/tex/bib/typeset.bib",
30197 URL = "http://www-db.stanford.edu/TR/CS-TR-83-965.html",
30198 abstract = "The knowledge of letters exerts a dual enchantment.
30199 When it uncovers the relationships between a series of
30200 arbitrary symbols and the sounds of speech, it fills us
30201 with joy. For others the visible expression of the
30202 letters, their graphical forms, their history and their
30203 development become fascinating. The advent of digital
30204 information technology has opened new vistas in the
30205 concept of letter forms. Unfortunately the graphics
30206 industry in India has remained almost unaffected by
30207 these technological advances, especially in the field
30208 of type design and text composition. This report
30209 strives to demonstrate how to use various tools and
30210 techniques, so that the new technology can cope with
30211 the plurality of Indian scripts. To start with all you
30212 need to know is the basic shapes of the letters of the
30213 Roman alphabet and the sounds they represent. With this
30214 slender thread of knowledge an enjoyable study of
30215 letter design and text composition in Indian scripts
30216 can begin.",
30217 acknowledgement = ack-nhfb,
30218 xxnumber = "CS-TR-83-965",
30219 }
30220
30221 @TechReport{Ghosh:1983:FAL,
30222 author = "Pijush K. Ghosh and Charles A. Bigelow",
30223 title = "A formal approach to lettershape description for type
30224 design",
30225 type = "Technical Report",
30226 number = "STAN-CS-83-966",
30227 institution = inst-STAN-CS,
30228 address = inst-STAN-CS:adr,
30229 pages = "vi + 51",
30230 month = may,
30231 year = "1983",
30232 bibdate = "Thu Nov 20 12:11:36 MST 2025",
30233 bibsource = "https://www.math.utah.edu/pub/tex/bib/font.bib;
30234 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
30235 URL = "http://i.stanford.edu/pub/cstr/reports/cs/tr/83/966/CS-TR-83-966.pdf;
30236 http://www-db.stanford.edu/TR/CS-TR-83-966.html",
30237 abstract = "This report is designed to explore some analytic means
30238 of specifying lettershapes. Computer representation and
30239 analysis of lettershape have made use of two
30240 diametrically different approaches, one representing a
30241 shape by its boundary, the other by its skeleton or
30242 medial axis. Generally speaking, the boundary
30243 representation is conceptually simpler to the designer,
30244 but the skeletal representation provides more insight
30245 into the ``piecedness'' of the shape. Donald Knuth's
30246 METAFONT is one of the sophisticated lettering design
30247 systems which has basically adopted the medial axis
30248 approach. Moreover, the METAFONT system has introduced
30249 the idea of metafont-description of a letter, i.e., to
30250 give a rigorous definition of the shape of a letter in
30251 such a way that many styles are obtained from a single
30252 definition by changing only a few user-defined
30253 parameters. That is why we have considered the METAFONT
30254 system as our starting point and have shown how we can
30255 arrive at the definition of a formal language for
30256 specifying lettershapes. We have also introduced a
30257 simple mathematical model for decomposing a letter into
30258 its constituent elements.",
30259 acknowledgement = ack-nhfb,
30260 xxnumber = "CS-TR-83-966",
30261 }
30262
30263 @TechReport{Manna:1983:VCP,
30264 author = "Zohar Manna and Amir Pnueli",
30265 title = "Verification of concurrent programs: a temporal proof
30266 system",
30267 type = "Technical Report",
30268 number = "STAN-CS-83-967",
30269 institution = inst-STAN-CS,
30270 address = inst-STAN-CS:adr,
30271 pages = "92",
30272 month = jun,
30273 year = "1983",
30274 bibdate = "Thu Nov 20 12:11:36 MST 2025",
30275 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
30276 URL = "http://www-db.stanford.edu/TR/CS-TR-83-967.html",
30277 abstract = "A proof system based on temporal logic is presented
30278 for proving properties of concurrent programs based on
30279 the shared-variables computation model. The system
30280 consists of three parts: the general uninterpreted
30281 part, the domain dependent part and the program
30282 dependent part. In the general part we give a complete
30283 proof system for first-order temporal logic with
30284 detailed proofs of useful theorems. This logic enables
30285 reasoning about general time sequences. The domain
30286 dependent part characterizes the special properties of
30287 the domain over which the program operates. The program
30288 dependent part introduces program axioms which restrict
30289 the time sequences considered to be execution sequences
30290 of a given program. The utility of the full system is
30291 demonstrated by proving invariance, liveness and
30292 precedence properties of several concurrent programs.
30293 Derived proof principles for these classes of
30294 properties are obtained and lead to a compact
30295 representation of proofs.",
30296 acknowledgement = ack-nhfb,
30297 xxnumber = "CS-TR-83-967",
30298 }
30299
30300 @TechReport{Whang:1983:PDD,
30301 author = "Kyu-Young Whang",
30302 title = "A Physical Database Design Methodology Using the
30303 Property of Separability",
30304 type = "Technical Report",
30305 number = "STAN-CS-83-968",
30306 institution = inst-STAN-CS,
30307 address = inst-STAN-CS:adr,
30308 pages = "271",
30309 month = jun,
30310 year = "1983",
30311 bibdate = "Wed Nov 26 12:13:45 MST 2025",
30312 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
30313 URL = "",
30314 acknowledgement = ack-nhfb,
30315 remark = "This is the author's thesis.",
30316 }
30317
30318 @TechReport{Moszkowski:1983:RIT,
30319 author = "Ben Moszkowski and Zohar Manna",
30320 title = "Reasoning in Interval Temporal Logic",
30321 type = "Technical Report",
30322 number = "STAN-CS-83-969",
30323 institution = inst-STAN-CS,
30324 address = inst-STAN-CS:adr,
30325 pages = "18",
30326 month = jul,
30327 year = "1983",
30328 bibdate = "Thu Nov 20 12:11:36 MST 2025",
30329 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
30330 URL = "http://www-db.stanford.edu/TR/CS-TR-83-969.html",
30331 abstract = "Predicate logic is a powerful and general descriptive
30332 formalism with a long history of development. However,
30333 since the logic's underlying semantics have no notion
30334 of time, statements such as ``I increases by 2'' cannot
30335 be directly expressed. We discuss interval temporal
30336 logic (ITL), a formalism that augments standard
30337 predicate logic with operators for time-dependent
30338 concepts. Our earlier work used ITL to specify and
30339 reason about hardware. In this paper we show how ITL
30340 can also directly capture various control structures
30341 found in conventional programming languages. Constructs
30342 are given for treating assignment, iteration,
30343 sequential and parallel computations and scoping. The
30344 techniques used permit specification and reasoning
30345 about such algorithms as concurrent Quicksort. We
30346 compare ITL with the logic-based programming languages
30347 Lucid and Prolog.",
30348 acknowledgement = ack-nhfb,
30349 xxnumber = "CS-TR-83-969",
30350 }
30351
30352 @TechReport{Moszkowski:1983:RAD,
30353 author = "Ben Moszkowski",
30354 title = "Reasoning about Digital Circuits",
30355 type = "Technical Report",
30356 number = "STAN-CS-83-970",
30357 institution = inst-STAN-CS,
30358 address = inst-STAN-CS:adr,
30359 pages = "146",
30360 month = jul,
30361 year = "1983",
30362 bibdate = "Wed Nov 26 12:13:45 MST 2025",
30363 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
30364 URL = "",
30365 acknowledgement = ack-nhfb,
30366 remark = "This is the author's thesis.",
30367 }
30368
30369 @TechReport{Ruggles:1983:LDS,
30370 author = "Lynn Ruggles",
30371 title = "Letterform Design Systems",
30372 type = "Technical Report",
30373 number = "STAN-CS-83-971",
30374 institution = inst-STAN-CS,
30375 address = inst-STAN-CS:adr,
30376 pages = "iv + 24",
30377 month = apr,
30378 year = "1983",
30379 bibdate = "Thu Nov 20 12:11:36 MST 2025",
30380 bibsource = "https://www.math.utah.edu/pub/tex/bib/font.bib;
30381 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
30382 URL = "http://i.stanford.edu/pub/cstr/reports/cs/tr/83/971/CS-TR-83-971.pdf;
30383 http://www-db.stanford.edu/TR/CS-TR-83-971.html",
30384 abstract = "The design of letterforms requires a skilled hand, an
30385 eye for fine detail and an understanding of the
30386 letterforms themselves. This work has traditionally
30387 been done by experienced artisans, but in the last
30388 fifteen years there have been attempts to integrate the
30389 design process with the use of computers in order to
30390 create digital type forms. The use of design systems
30391 for the creation of these digital forms has led to an
30392 analysis of the way type designs are created by type
30393 designers. Their methods have been integrated into a
30394 variety of systems for creating digital forms. This
30395 paper describes these design systems and discusses the
30396 relevant issues for the success of the systems that
30397 exist and are used today.",
30398 acknowledgement = ack-nhfb,
30399 pdfpages = "28",
30400 xxnumber = "CS-TR-83-971",
30401 }
30402
30403 @TechReport{Karlin:1983:ERE,
30404 author = "Anna R. Karlin and Howard W. Trickey and Jeffrey D.
30405 Ullman",
30406 title = "Experience with a Regular Expression Compiler",
30407 type = "Technical Report",
30408 number = "STAN-CS-83-972",
30409 institution = inst-STAN-CS,
30410 address = inst-STAN-CS:adr,
30411 pages = "ii + 23",
30412 month = jun,
30413 year = "1983",
30414 bibdate = "Thu Nov 20 12:11:36 MST 2025",
30415 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib;
30416 https://www.math.utah.edu/pub/tex/bib/string-matching.bib",
30417 URL = "http://www-db.stanford.edu/TR/CS-TR-83-972.html",
30418 abstract = "The language of regular expressions is a useful one
30419 for specifying certain sequential processes at a very
30420 high level. They allow easy modification of designs for
30421 circuits, like controllers, that are described by
30422 patterns of events they must recognize and the
30423 responses they must make to those patterns. This paper
30424 discusses the compilation of such expressions into
30425 reasonably compact layouts. The translation of regular
30426 expressions into nondeterministic automata by two
30427 different methods is discussed, along with the
30428 advantages of each method. A major part of the
30429 compilation problem is selection of good state codes
30430 for the nondeterministic automata; one successful
30431 strategy is explained in the paper.",
30432 acknowledgement = ack-nhfb,
30433 pdfpages = "26",
30434 xxnumber = "CS-TR-83-972",
30435 }
30436
30437 @TechReport{Cheriton:1983:DVK,
30438 author = "David R. Cheriton and Willy Zwaenepoel",
30439 title = "The Distributed {V} Kernel and Its Performance for
30440 Diskless Workstations",
30441 type = "Technical Report",
30442 number = "STAN-CS-83-973",
30443 institution = inst-STAN-CS,
30444 address = inst-STAN-CS:adr,
30445 pages = "12",
30446 month = jul,
30447 year = "1983",
30448 bibdate = "Thu Nov 20 12:11:36 MST 2025",
30449 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
30450 URL = "http://www-db.stanford.edu/TR/CS-TR-83-973.html",
30451 abstract = "The distributed V kernel is a message-oriented kernel
30452 that provides uniform local and network interprocess
30453 communication. It is primarily being used in an
30454 environment of diskless workstations connected by a
30455 high-speed local network to a set of file servers. We
30456 describe a performance evaluation of the kernel, with
30457 particular emphasis on the cost of network file access.
30458 Our results show that over a local network: 1. Diskless
30459 workstations can access remole files with minimal
30460 performance penalty. 2. The V message facility can be
30461 used to access remote files at comparable cost to any
30462 well-tuned specialized file access protocol. We
30463 conclude that it is feasible to build a distributed
30464 system with all network communication using the V
30465 message facility even when most of the network nodes
30466 have no secondary storage.",
30467 acknowledgement = ack-nhfb,
30468 xxnumber = "CS-TR-83-973",
30469 }
30470
30471 @TechReport{Hobby:1983:CMF,
30472 author = "John Hobby and Gu Guoan",
30473 title = "A {Chinese Meta-Font}",
30474 type = "Technical Report",
30475 number = "STAN-CS-83-974",
30476 institution = inst-STAN-CS,
30477 address = inst-STAN-CS:adr,
30478 pages = "ii + 22",
30479 month = jul,
30480 year = "1983",
30481 bibdate = "Thu Nov 20 12:11:36 MST 2025",
30482 bibsource = "https://www.math.utah.edu/pub/tex/bib/font.bib;
30483 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
30484 URL = "http://i.stanford.edu/pub/cstr/reports/cs/tr/83/974/CS-TR-83-974.pdf;
30485 http://www-db.stanford.edu/TR/CS-TR-83-974.html",
30486 abstract = "METAFONT is Donald E. Knuth's system for alphabet
30487 design. The system allows an entire family of fonts or
30488 ``meta-fonts'' to be specified precisely and
30489 mathematically so that it can be produced in different
30490 sizes and styles for different raster devices.\par
30491
30492 We present a new technique for defining Chinese
30493 characters hierarchically with METAFONT. We define
30494 METAFONT subroutines for commonly used portions of
30495 strokes and then combine some of these into routines
30496 for drawing complete strokes. Parameters describe the
30497 skeletons of the strokes and the stroke routines are
30498 carefully designed to transform themselves
30499 appropriately. This allows us to handle all of the
30500 basic strokes with only 14 different routines.\par
30501
30502 The stroke routines in turn are used to build up groups
30503 of strokes and radicals. Special routines for
30504 positioning control points ensure that the strokes will
30505 join properly in a variety of different styles. The
30506 radical routines are parameterized to allow them to be
30507 placed at different locations in the typeface and to
30508 allow for adjusting their size and shape. Key points
30509 are positioned relative to the bounding box for the
30510 radical, and the special positioning routines find
30511 other points that must be passed to the stroke
30512 routines.\par
30513
30514 We use this method to design high quality Song style
30515 characters. Global parameters control the style, and we
30516 show how these can be used to create Song and Long Song
30517 from the same designs. Other settings can produce other
30518 familiar styles or even new styles. We show how it is
30519 possible to create completely different styles, such as
30520 Bold style, merely by substituting different stroke
30521 routines. The global parameters can be used to augment
30522 simple scaling by altering stroke width and other
30523 details to account for changes in size. We can adjust
30524 stroke widths to help even out the overall darkness of
30525 the characters. We also show how it is possible to
30526 experiment with new ideas such as adjusting character
30527 widths individually.\par
30528
30529 While many of our characters are based on existing
30530 designs, the stroke routines facilitate the design of
30531 new characters without the need to refer to detailed
30532 drawings. The skeletal parameters and special
30533 positioning routines make it easy to position the
30534 strokes properly. In our previous paper, in contrast to
30535 this, we parameterized the strokes according to their
30536 boundaries and copied an existing design. The previous
30537 approach made it very difficult to create different
30538 styles with the same METAFONT program.",
30539 acknowledgement = ack-nhfb,
30540 pdfpages = "24",
30541 xxnumber = "CS-TR-83-974",
30542 }
30543
30544 @TechReport{Rowe:1983:RBS,
30545 author = "Neil C. Rowe",
30546 title = "Rule-Based Statistical Calculations on a Database
30547 Abstract",
30548 type = "Technical Report",
30549 number = "STAN-CS-83-975",
30550 institution = inst-STAN-CS,
30551 address = inst-STAN-CS:adr,
30552 pages = "167",
30553 month = jul,
30554 year = "1983",
30555 bibdate = "Wed Nov 26 12:13:45 MST 2025",
30556 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
30557 URL = "",
30558 acknowledgement = ack-nhfb,
30559 remark = "This is the author's thesis.",
30560 }
30561
30562 @TechReport{Beeri:1983:ADD,
30563 author = "Catriel Beeri and Moshe Vardi",
30564 title = "On Acyclic Database Decompositions",
30565 type = "Technical Report",
30566 number = "STAN-CS-83-976",
30567 institution = inst-STAN-CS,
30568 address = inst-STAN-CS:adr,
30569 pages = "11",
30570 month = jul,
30571 year = "1983",
30572 bibdate = "Wed Nov 26 12:13:45 MST 2025",
30573 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
30574 URL = "",
30575 acknowledgement = ack-nhfb,
30576 }
30577
30578 @TechReport{Liang:1983:WHP,
30579 author = "Franklin Mark Liang",
30580 title = "{Word Hy-phen-a-tion by Com-put-er}",
30581 type = "Technical Report",
30582 number = "STAN-CS-83-977",
30583 institution = inst-STAN-CS,
30584 address = inst-STAN-CS:adr,
30585 pages = "v + 85",
30586 month = aug,
30587 year = "1983",
30588 bibdate = "Wed Nov 26 12:13:45 MST 2025",
30589 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib;
30590 https://www.math.utah.edu/pub/tex/bib/texbook3.bib;
30591 https://www.math.utah.edu/pub/tex/bib/typeset.bib",
30592 URL = "https://www.tug.org/docs/liang/liang-thesis.pdf",
30593 abstract = "This thesis describes research leading to an improved
30594 word hyphenation algorithm for the {\TeX82} typesetting
30595 system. Hyphenation is viewed primarily as a data
30596 compression problem, where we are given a dictionary of
30597 words with allowable division points, and try to devise
30598 methods that take advantage of the large amount of
30599 redundancy present.\par
30600
30601 The new hyphenation algorithm is based on the idea of
30602 hyphenating and inhibiting patterns. These are simply
30603 strings of letters that, when they match in a word,
30604 give us information about hyphenation at some point in
30605 the pattern. For example, `-tion' and `c-c' are good
30606 hyphenating patterns. An important feature of this
30607 method is that a suitable set of patterns can be
30608 extracted automatically from the dictionary.\par
30609
30610 In order to represent the set of patterns in a compact
30611 form that is also reasonably efficient for searching,
30612 the author has developed a new data structure called a
30613 packed trie. This data structure allows the very fast
30614 search times characteristic of indexed tries, but in
30615 many cases it entirely eliminates the wasted space for
30616 null links usually present in such tries. We
30617 demonstrate the versatility and practical advantages of
30618 this data structure by using a variant of it as the
30619 critical component of the program that generates the
30620 patterns from the dictionary.\par
30621
30622 The resulting hyphenation algorithm uses about 4500
30623 patterns that compile into a packed trie occupying 25K
30624 bytes of storage. These patterns find 89\% of the
30625 hyphens in a pocket dictionary word list, with
30626 essentially no error. By comparison, the uncompressed
30627 dictionary occupies over 500K bytes.",
30628 acknowledgement = ack-nhfb,
30629 pdfpages = "62",
30630 remark = "This is the author's Ph.D. thesis. Pages 45--73 are
30631 missing from the PDF file.",
30632 tableofcontents = "Introduction / 1 \\
30633 Examples / 2 \\
30634 \TeX{} and hyphenation / 3 \\
30635 Time magazine algorithm / 4 \\
30636 Patterns / 5 \\
30637 Overview of thesis / 7 \\
30638 \\
30639 The dictionary problem / 8 \\
30640 Data structures / 9 \\
30641 Superimposed coding / 10 \\
30642 Tries / 11 \\
30643 Packed tries / 15 \\
30644 Suffix compression / 16 \\
30645 Derived forms / 18 \\
30646 Spelling checkers / 19 \\
30647 Related work / 21 \\
30648 \\
30649 Hyphenation / 28 \\
30650 Finite-state machines with output / 28 \\
30651 Minimization with don't cares / 24 \\
30652 Pattern matching / 26 \\
30653 \\
30654 Pattern generation / 29 \\
30655 Heuristics / 30 \\
30656 Collecting pattern statistics / 31 \\
30657 Dynamic packed tries / 32 \\
30658 Experimental results / 34 \\
30659 Examples / 37 \\
30660 \\
30661 History and Conclusion / 39 \\
30662 \\
30663 Appendix / 45 \\
30664 The PATGEN program / 45 \\
30665 List of patterns / 74 \\
30666 \\
30667 References / 83",
30668 }
30669
30670 @TechReport{Knuth:1983:LLM,
30671 author = "Donald E. Knuth",
30672 title = "Lessons Learned from {METAFONT}",
30673 type = "Technical Report",
30674 number = "STAN-CS-83-978",
30675 institution = inst-STAN-CS,
30676 address = inst-STAN-CS:adr,
30677 pages = "22",
30678 month = aug,
30679 year = "1983",
30680 bibdate = "Wed Nov 26 12:13:45 MST 2025",
30681 bibsource = "https://www.math.utah.edu/pub/tex/bib/font.bib;
30682 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
30683 URL = "https://journals.uc.edu/index.php/vl/article/view/5401/4265",
30684 acknowledgement = ack-nhfb,
30685 remark = "Published in \booktitle{Visible Language} {\bf XIX}(1)
30686 35--53, Winter 1985.",
30687 }
30688
30689 @TechReport{Graham:1983:NDS,
30690 author = "M. H. Graham and A. O. Mendelzon and M. Y. Vardi",
30691 title = "Notions of Dependency Satisfaction",
30692 type = "Technical Report",
30693 number = "STAN-CS-83-979",
30694 institution = inst-STAN-CS,
30695 address = inst-STAN-CS:adr,
30696 pages = "35",
30697 month = aug,
30698 year = "1983",
30699 bibdate = "Wed Nov 26 12:13:45 MST 2025",
30700 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
30701 URL = "",
30702 acknowledgement = ack-nhfb,
30703 }
30704
30705 @TechReport{Knuth:1983:WSS,
30706 author = "Donald E. Knuth",
30707 title = "The {WEB} System of Structured Documentation",
30708 type = "Technical Report",
30709 number = "STAN-CS-83-980",
30710 institution = inst-STAN-CS,
30711 address = inst-STAN-CS:adr,
30712 pages = "iv + 206",
30713 day = "1",
30714 month = sep,
30715 year = "1983",
30716 bibdate = "Fri Apr 18 05:25:51 2003",
30717 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
30718 note = "Version 2.3.",
30719 URL = "http://i.stanford.edu/pub/cstr/reports/cs/tr/83/980/CS-TR-83-980.pdf;
30720 http://www-db.stanford.edu/TR/CS-TR-83-980.html;
30721 http://www.ncstrl.org:8900/ncstrl/servlet/search?formname=detail&id=oai%3Ancstrlh%3Astan%3ASTAN%2F%2FCS-TR-83-980",
30722 abstract = "This memo describes how to write programs in the WEB
30723 language (Version 2.3, September 1983); and it also
30724 includes the full WEB documentation for WEAVE and
30725 TANGLE, the programs that read WEB input and produce
30726 {\TeX} and PASCAL output, respectively. The philosophy
30727 behind WEB is that an experienced system programmer,
30728 who wants to provide the best possible documentation of
30729 his or her software products, needs two things
30730 simultaneously: a language like {\TeX} for formatting,
30731 and a language like PASCAL for programming. Neither
30732 type of language can provide the best documentation by
30733 itself; but when both are appropriately combined, we
30734 obtain a system that is much more useful than either
30735 language separately",
30736 acknowledgement = ack-nhfb # "\slash " # ack-hk,
30737 documentid = "oai:ncstrlh:stan:STAN//CS-TR-83-980",
30738 pdfpages = "210",
30739 xxnumber = "CS-TR-83-980",
30740 }
30741
30742 @TechReport{Knuth:1983:LP,
30743 author = "Donald E. Knuth",
30744 title = "Literate Programming",
30745 type = "Technical Report",
30746 number = "STAN-CS-83-981",
30747 institution = inst-STAN-CS,
30748 address = inst-STAN-CS:adr,
30749 pages = "15",
30750 month = sep,
30751 year = "1983",
30752 DOI = "https://doi.org/10.1093/comjnl/27.2.97",
30753 bibdate = "Wed Nov 26 12:13:45 MST 2025",
30754 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
30755 URL = "",
30756 acknowledgement = ack-nhfb,
30757 remark = "Published in \booktitle{The Computer Journal}, {\bf
30758 27}(2) 97--111, May 1984. doi:10.1093/comjnl/27.2.97.",
30759 }
30760
30761 @TechReport{Greene:1983:LFL,
30762 author = "Daniel H. Greene",
30763 title = "Labelled Formal Languages and Their Uses",
30764 type = "Technical Report",
30765 number = "STAN-CS-83-982",
30766 institution = inst-STAN-CS,
30767 address = inst-STAN-CS:adr,
30768 pages = "150",
30769 month = aug,
30770 year = "1983",
30771 bibdate = "Wed Nov 26 12:13:45 MST 2025",
30772 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
30773 URL = "",
30774 acknowledgement = ack-nhfb,
30775 remark = "This is the author's thesis.",
30776 }
30777
30778 @TechReport{Ullman:1983:CTT,
30779 author = "Jeffrey D. Ullman",
30780 title = "A Communication-Time Tradeoff",
30781 type = "Technical Report",
30782 number = "STAN-CS-83-983",
30783 institution = inst-STAN-CS,
30784 address = inst-STAN-CS:adr,
30785 pages = "11",
30786 month = aug,
30787 year = "1983",
30788 bibdate = "Wed Nov 26 12:13:45 MST 2025",
30789 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
30790 URL = "",
30791 acknowledgement = ack-nhfb,
30792 }
30793
30794 @TechReport{Brown:1983:PEE,
30795 author = "Harold Brown and Christopher Tong and Gordon Foyster",
30796 title = "{Palladio}: an Exploratory Environment for Circuit
30797 Design",
30798 type = "Technical Report",
30799 number = "STAN-CS-83-984 (HPP-83-31, AD-A266696)",
30800 institution = inst-STAN-CS,
30801 address = inst-STAN-CS:adr,
30802 pages = "48",
30803 month = jun,
30804 year = "1983",
30805 bibdate = "Wed Nov 26 12:13:45 MST 2025",
30806 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
30807 URL = "https://apps.dtic.mil/sti/tr/pdf/ADA266696.pdf",
30808 acknowledgement = ack-nhfb,
30809 pdfpages = "51",
30810 remark = "No PDF in NTRL archive. Found in DTIC archive. No
30811 abstract in document.",
30812 }
30813
30814 @TechReport{Samuel:1983:FGT,
30815 author = "Arthur L. Samuel",
30816 title = "First grade {\TeX}: a beginner's {\TeX} manual",
30817 type = "Technical Report",
30818 number = "STAN-CS-83-985",
30819 institution = inst-STAN-CS,
30820 address = inst-STAN-CS:adr,
30821 pages = "iv + 34",
30822 month = nov,
30823 year = "1983",
30824 bibdate = "Thu Nov 20 12:11:36 MST 2025",
30825 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
30826 URL = "http://i.stanford.edu/pub/cstr/reports/cs/tr/83/985/CS-TR-83-985.pdf;
30827 http://www-db.stanford.edu/TR/CS-TR-83-985.html",
30828 abstract = "This is an introductory ready-reference TEX82 manual
30829 for the beginner who would like to do First Grade TEX
30830 work. Only the most basic features of the TEX system
30831 are discussed in detail. Other features are summarized
30832 in an appendix and references are given to the more
30833 complete documentation available elsewhere.",
30834 acknowledgement = ack-nhfb,
30835 author-dates = "Arthur Lee Samuel (5 December 1901--29 July 1990)",
30836 xxnumber = "CS-TR-83-985",
30837 }
30838
30839 @TechReport{Cohen:1983:HRA,
30840 author = "Paul R. Cohen",
30841 title = "Heuristic Reasoning about Uncertainty: an Artificial
30842 Intelligence Approach",
30843 type = "Technical Report",
30844 number = "STAN-CS-83-986",
30845 institution = inst-STAN-CS,
30846 address = inst-STAN-CS:adr,
30847 pages = "200",
30848 month = sep,
30849 year = "1983",
30850 bibdate = "Wed Nov 26 12:13:45 MST 2025",
30851 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
30852 URL = "",
30853 acknowledgement = ack-nhfb,
30854 }
30855
30856 @TechReport{Ullman:1983:STA,
30857 author = "Jeffrey D. Ullman",
30858 title = "Some Thoughts about Supercomputer Organization",
30859 type = "Technical Report",
30860 number = "STAN-CS-83-987",
30861 institution = inst-STAN-CS,
30862 address = inst-STAN-CS:adr,
30863 pages = "17",
30864 month = oct,
30865 year = "1983",
30866 bibdate = "Wed Nov 26 12:13:45 MST 2025",
30867 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
30868 URL = "",
30869 acknowledgement = ack-nhfb,
30870 }
30871
30872 @TechReport{Mairson:1983:PCS,
30873 author = "Harry George Mairson",
30874 title = "The Program Complexity of Searching a Table",
30875 type = "Technical Report",
30876 number = "STAN-CS-83-988",
30877 institution = inst-STAN-CS,
30878 address = inst-STAN-CS:adr,
30879 pages = "85",
30880 month = nov,
30881 year = "1983",
30882 bibdate = "Wed Nov 26 12:13:45 MST 2025",
30883 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
30884 URL = "",
30885 acknowledgement = ack-nhfb,
30886 }
30887
30888 @TechReport{Knuth:1983:PPS,
30889 author = "Donald E. Knuth and Joseph S. Weening",
30890 title = "A Programming and Problem-Solving Seminar",
30891 type = "Technical Report",
30892 number = "STAN-CS-83-989",
30893 institution = inst-STAN-CS,
30894 address = inst-STAN-CS:adr,
30895 pages = "vi + 91",
30896 month = dec,
30897 year = "1983",
30898 bibdate = "Fri Apr 18 05:25:51 2003",
30899 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
30900 URL = "http://www-db.stanford.edu/TR/CS-TR-83-989.html;
30901 http://www.ncstrl.org:8900/ncstrl/servlet/search?formname=detail&id=oai%3Ancstrlh%3Astan%3ASTAN%2F%2FCS-TR-83-989",
30902 abstract = "his report contains edited transcripts of the
30903 discussions held in Stanford's course CS 204, Problem
30904 Seminar, during autumn quarter 1981. Since the topics
30905 span a large range of ideas in computer science, and
30906 since most of the important research paradigms and
30907 programming paradigms were touched on during the
30908 discussions, these notes may be of interest to graduate
30909 students of computer science at other universities, as
30910 well as to their professors and to professional people
30911 in the ``real world.''\par
30912
30913 The present report is the fourth in a series of such
30914 transcripts, continuing the tradition established in
30915 CS606 (Michael J. Clancy, 1977), CS707 (Chris Van Wyk,
30916 1979), and CS863 (Allan A. Miller, 1981).",
30917 acknowledgement = ack-nhfb,
30918 documentid = "oai:ncstrlh:stan:STAN//CS-TR-83-989",
30919 pdfpages = "100",
30920 xxnumber = "CS-TR-83-989",
30921 }
30922
30923 @TechReport{Hobby:1983:PPS,
30924 author = "John D. Hobby and Donald E. Knuth",
30925 title = "A Programming and Problem-Solving Seminar",
30926 type = "Technical Report",
30927 number = "STAN-CS-83-990",
30928 institution = inst-STAN-CS,
30929 address = inst-STAN-CS:adr,
30930 pages = "vii + 61",
30931 month = dec,
30932 year = "1983",
30933 bibdate = "Fri Apr 18 05:25:51 2003",
30934 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
30935 URL = "http://www-db.stanford.edu/TR/CS-TR-83-990.html;
30936 http://www.ncstrl.org:8900/ncstrl/servlet/search?formname=detail&id=oai%3Ancstrlh%3Astan%3ASTAN%2F%2FCS-TR-83-990",
30937 abstract = "This report contains edited transcripts of the
30938 discussions held in Stanford's course CS204, Problem
30939 Seminar, during autumn quarter 1982. Since the topics
30940 span a large range of ideas in computer science, and
30941 since most of the important research paradigms and
30942 programming paradigms were touched on during the
30943 discussions, these notes may be of interest to graduate
30944 students of computer science at other universities, as
30945 well as to their professors and to professional people
30946 in the ``real world.''\par
30947
30948 The present report is the fifth in a series of such
30949 transcripts, continuing the tradition established in
30950 STAN-CS-77-606 (Michael J. Clancy, 1977),
30951 STAN-CS-79-707 (Chris Van Wyk, 1979), STAN-CS-81-863
30952 (Allan A. Miller, 1981), STAN-CS-83-989 (Joseph S.
30953 Weening, 1983).",
30954 acknowledgement = ack-nhfb,
30955 documentid = "oai:ncstrlh:stan:STAN//CS-TR-83-990",
30956 pdfpages = "68",
30957 xxnumber = "CS-TR-83-990",
30958 }
30959
30960 @TechReport{Morgensteren:1983:PAA,
30961 author = "Moshe Morgensteren and Eli Shamir",
30962 title = "Parallel algorithms for arithmetics, irreducibility
30963 and factoring of {GFq}-polynomials",
30964 type = "Technical Report",
30965 number = "STAN-CS-83-991",
30966 institution = inst-STAN-CS,
30967 address = inst-STAN-CS:adr,
30968 pages = "10",
30969 month = dec,
30970 year = "1983",
30971 bibdate = "Thu Nov 20 12:11:36 MST 2025",
30972 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
30973 URL = "http://www-db.stanford.edu/TR/CS-TR-83-991.html",
30974 abstract = "A new algorithm for testing irreducibility of
30975 polynomials over finite fields without gcd computations
30976 makes it possible to devise efficient parallel
30977 algorithms for polynomial factorization. We also study
30978 the probability that a random polynomial over a finite
30979 field has no factors of small degree.",
30980 acknowledgement = ack-nhfb,
30981 xxnumber = "CS-TR-83-991",
30982 }
30983
30984 @TechReport{Ketonen:1983:LIP,
30985 author = "Jussi Ketonen and Joseph S. Weening",
30986 title = "The Language of an Interactive Proof Checker",
30987 type = "Technical Report",
30988 number = "STAN-CS-83-992",
30989 institution = inst-STAN-CS,
30990 address = inst-STAN-CS:adr,
30991 pages = "34",
30992 month = dec,
30993 year = "1983",
30994 bibdate = "Thu Nov 20 12:11:36 MST 2025",
30995 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
30996 URL = "http://www-db.stanford.edu/TR/CS-TR-83-992.html",
30997 abstract = "We describe the underlying language for EKL, an
30998 interactive theorem-proving system currently under
30999 development at the Stanford Artificial Intelligence
31000 Laboratory. Some of the reasons for its development as
31001 well as its mathematical properties are discussed.",
31002 acknowledgement = ack-nhfb,
31003 xxnumber = "CS-TR-83-992",
31004 }
31005
31006 @TechReport{Lansky:1983:SAC,
31007 author = "Amy Lansky",
31008 title = "Specification and Analysis of Concurrency",
31009 type = "Technical Report",
31010 number = "STAN-CS-83-993",
31011 institution = inst-STAN-CS,
31012 address = inst-STAN-CS:adr,
31013 pages = "290",
31014 month = dec,
31015 year = "1983",
31016 bibdate = "Wed Nov 26 12:13:45 MST 2025",
31017 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
31018 URL = "",
31019 acknowledgement = ack-nhfb,
31020 remark = "This is the author's thesis.",
31021 }
31022
31023 @TechReport{Chapiro:1983:SRP,
31024 author = "Daniel M. Chapiro",
31025 title = "Sorting by Recursive Partitioning",
31026 type = "Technical Report",
31027 number = "STAN-CS-83-994",
31028 institution = inst-STAN-CS,
31029 address = inst-STAN-CS:adr,
31030 pages = "32",
31031 month = dec,
31032 year = "1983",
31033 bibdate = "Thu Nov 20 12:11:36 MST 2025",
31034 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
31035 URL = "http://www-db.stanford.edu/TR/CS-TR-83-994.html",
31036 abstract = "We present a new $ O(n \lg \lg n) $ time sort
31037 algorithm that is more robust than $ O(n) $
31038 distribution sorting algorithms. The algorithm uses a
31039 recursive partition-concatenate approach, partitioning
31040 each set into a variable number of subsets using
31041 information gathered dynamically during execution.
31042 Sequences are partitioned using statistical information
31043 computed during the sort for each sequence. Space
31044 complexity is $ O(n) $ and is independent from the
31045 order and distribution of the data. If the data is
31046 originally in a list, only $ O(\sqrt {n}) $ extra space
31047 is necessary. The algorithm is insensitive to the
31048 initial ordering of the data, and it is much less
31049 sensitive to the distribution of the values of the
31050 sorting keys than distribution sorting algorithms. Its
31051 worst-case time is $ O(n \lg \lg n) $ across all
31052 distributions that satisfy a new ``fractalness''
31053 criterion. This condition, which is sufficient but not
31054 necessary, is satisfied by any set with bounded length
31055 keys and bounded repetition of each key. If this
31056 condition is not satisfied, its worst case performance
31057 degrades gracefully to $ O(n \lg n) $. In practice,
31058 this occurs when the density of the distribution over $
31059 \Omega (n) $ of the keys is a fractal curve (for sets
31060 of numbers whose values are bounded), or when the
31061 distribution has very heavy tails with arbitrarily long
31062 keys (for sets of numbers whose precision is bounded).
31063 In some preliminary tests, it was faster than Quicksort
31064 for sets of more than 150 elements. The algorithm is
31065 practical, works basically ``in place'', can be easily
31066 implemented and is particularly well suited both for
31067 parallel processing and for external sorting.",
31068 acknowledgement = ack-nhfb,
31069 xxnumber = "CS-TR-83-994",
31070 }
31071
31072 @TechReport{Clancey:1983:AAC,
31073 author = "William J. Clancey",
31074 title = "The advantages of abstract control knowledge in expert
31075 system design",
31076 type = "Technical Report",
31077 number = "STAN-CS-83-995 (HPP-83-17, AD-A139978)",
31078 institution = inst-STAN-CS,
31079 address = inst-STAN-CS:adr,
31080 pages = "v + 14",
31081 month = nov,
31082 year = "1983",
31083 bibdate = "Thu Nov 20 12:11:36 MST 2025",
31084 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
31085 URL = "http://www-db.stanford.edu/TR/CS-TR-83-995.html;
31086 https://apps.dtic.mil/sti/tr/pdf/ADA139978.pdf",
31087 abstract = "A poorly designed knowledge base can be as cryptic as
31088 an arbitrary program and just as difficult to maintain.
31089 Representing control knowledge abstractly, separately
31090 from domain facts and relations, makes the design more
31091 transparent and explainable. A body of abstract control
31092 knowledge provides a generic framework for constructing
31093 knowledge bases for related problems in other domains
31094 and also provides a useful starting point for studying
31095 the nature of strategies.",
31096 acknowledgement = ack-nhfb,
31097 pdfpages = "23",
31098 remark = "No PDF in NTRL archive.",
31099 xxnumber = "CS-TR-83-995",
31100 }
31101
31102 @TechReport{Hasling:1983:SED,
31103 author = "Diane Warner Hasling and William J. Clancey and Glenn
31104 Rennels",
31105 title = "Strategic explanations for a diagnostic consultation
31106 system",
31107 type = "Technical Report",
31108 number = "STAN-CS-83-996 (HPP-83-41, AD-A140014)",
31109 institution = inst-STAN-CS,
31110 address = inst-STAN-CS:adr,
31111 pages = "ii + 23",
31112 month = nov,
31113 year = "1983",
31114 bibdate = "Thu Nov 20 12:11:36 MST 2025",
31115 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
31116 URL = "http://www-db.stanford.edu/TR/CS-TR-83-996.html;
31117 https://apps.dtic.mil/sti/tr/pdf/ADA140014.pdf",
31118 abstract = "This paper examines the problem of automatic
31119 explanation of reasoning, especially as it relates to
31120 expert systems. By explanation we mean the ability of a
31121 program to discuss what it is doing in some
31122 understandable way. We first present a general
31123 framework in which to view explanation and review some
31124 of the research done in this area. We then focus on the
31125 explanation system for NEOMYCIN, a medical consultation
31126 program. A consultation program interactively helps a
31127 user to solve a problem. Our goal is to have NEOMYCIN
31128 explain its problem-solving strategies. An explanation
31129 of strategy describes the plan the program is using to
31130 reach a solution. Such an explanation is usually
31131 concrete, referring to aspects of the current problem
31132 situation. Abstract explanations articulate a general
31133 principle, which can be applied in different
31134 situations; such explanations are useful in teaching
31135 and in explaining by analogy. We describe the aspects
31136 of NEOMYCIN that make abstract strategic explanations
31137 possible--the representation of strategic knowledge
31138 explicitly and separately from domain knowledge--and
31139 demonstrate how this representation can be used to
31140 generate explanations.",
31141 acknowledgement = ack-nhfb,
31142 pdfpages = "35",
31143 remark = "No PDF in NTRL archive. Found in DTIC archive.",
31144 xxnumber = "CS-TR-83-996",
31145 }
31146
31147 @TechReport{Clancey:1983:G,
31148 author = "William J. Clancey",
31149 title = "{GUIDON}",
31150 type = "Technical Report",
31151 number = "STAN-CS-83-997 (HPP-83-42)",
31152 institution = inst-STAN-CS,
31153 address = inst-STAN-CS:adr,
31154 pages = "13",
31155 month = nov,
31156 year = "1983",
31157 bibdate = "Wed Nov 26 12:13:45 MST 2025",
31158 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
31159 URL = "",
31160 acknowledgement = ack-nhfb,
31161 }
31162
31163 @TechReport{Phillips:1983:SDP,
31164 author = "Jorge Phillips",
31165 title = "Self-Described Programming Environments --- an
31166 Application of a Theory of Design to Programming
31167 Systems",
31168 type = "Technical Report",
31169 number = "STAN-CS-84-1008",
31170 institution = inst-STAN-CS,
31171 address = inst-STAN-CS:adr,
31172 pages = "262",
31173 month = mar,
31174 year = "1983",
31175 bibdate = "Wed Nov 26 12:13:45 MST 2025",
31176 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
31177 URL = "",
31178 acknowledgement = ack-nhfb,
31179 remark = "This is the author's thesis.",
31180 }
31181
31182 @TechReport{Ullman:1984:ILQ,
31183 author = "Jeffrey D. Ullman",
31184 title = "Implementation of Logical Query Languages for
31185 Databases",
31186 type = "Technical Report",
31187 number = "STAN-CS-84-1000",
31188 institution = inst-STAN-CS,
31189 address = inst-STAN-CS:adr,
31190 pages = "41",
31191 month = may,
31192 year = "1984",
31193 bibdate = "Wed Nov 26 12:13:45 MST 2025",
31194 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
31195 URL = "",
31196 acknowledgement = ack-nhfb,
31197 }
31198
31199 @TechReport{Brinkley:1984:UTD,
31200 author = "James F. Brinkley",
31201 title = "Ultrasonic Three-Dimensional Organ Modelling",
31202 type = "Technical Report",
31203 number = "STAN-CS-84-1001",
31204 institution = inst-STAN-CS,
31205 address = inst-STAN-CS:adr,
31206 pages = "141",
31207 month = mar,
31208 year = "1984",
31209 bibdate = "Wed Nov 26 12:13:45 MST 2025",
31210 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
31211 URL = "",
31212 acknowledgement = ack-nhfb,
31213 }
31214
31215 @TechReport{VanGelder:1984:STN,
31216 author = "Allen {Van Gelder}",
31217 title = "A Satisfiability Tester for Non-Clausal Propositional
31218 Calculus",
31219 type = "Technical Report",
31220 number = "STAN-CS-84-1002",
31221 institution = inst-STAN-CS,
31222 address = inst-STAN-CS:adr,
31223 pages = "14",
31224 month = mar,
31225 year = "1984",
31226 bibdate = "Wed Nov 26 12:13:45 MST 2025",
31227 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
31228 URL = "",
31229 acknowledgement = ack-nhfb,
31230 }
31231
31232 @TechReport{Anderson:1984:PGA,
31233 author = "Richard Anderson and Ernst Mayr",
31234 title = "Parallelism and Greedy Algorithms",
31235 type = "Technical Report",
31236 number = "STAN-CS-84-1003",
31237 institution = inst-STAN-CS,
31238 address = inst-STAN-CS:adr,
31239 pages = "17",
31240 month = apr,
31241 year = "1984",
31242 bibdate = "Thu Nov 20 12:11:36 MST 2025",
31243 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
31244 URL = "http://www-db.stanford.edu/TR/CS-TR-84-1003.html",
31245 abstract = "A number of greedy algorithms are examined and are
31246 shown to be probably inherently sequential. Greedy
31247 algorithms are presented for finding a maximal path,
31248 for finding a maximal set of disjoint paths in a
31249 layered dag, and for finding the largest induced
31250 subgraph of a graph that has all vertices of degree at
31251 least k. It is shown that for all of these algorithms,
31252 the problem of determining if a given node is in the
31253 solution set of the algorithm is P-complete. This means
31254 that it is unlikely that these sequential algorithms
31255 can be sped up significantly using parallelism.",
31256 acknowledgement = ack-nhfb,
31257 xxnumber = "CS-TR-84-1003",
31258 }
31259
31260 @TechReport{Goldschlager:1984:CTH,
31261 author = "Leslie M. Goldschlager",
31262 title = "A Computational Theory of Higher Brain Function",
31263 type = "Technical Report",
31264 number = "STAN-CS-84-1004",
31265 institution = inst-STAN-CS,
31266 address = inst-STAN-CS:adr,
31267 pages = "29",
31268 month = apr,
31269 year = "1984",
31270 bibdate = "Thu Nov 20 12:11:36 MST 2025",
31271 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
31272 URL = "http://www-db.stanford.edu/TR/CS-TR-84-1004.html",
31273 abstract = "The higher functions of the brain are believed to
31274 occur in the cortex. This region of the brain is
31275 modelled as a memory surface which performs both
31276 storage and computation. Concepts are modelled as
31277 patterns of activity on the memory surface, and the
31278 model explains how these patterns interact with one
31279 another to give the computations which the brain
31280 performs. The method of interaction can explain the
31281 formation of abstract concepts, association of ideas
31282 and train of thought. It is shown that creativity,
31283 self, consciousness and free will are explainable
31284 within the same framework. A theory of sleep is
31285 presented which is consistent with the model.",
31286 acknowledgement = ack-nhfb,
31287 xxnumber = "CS-TR-84-1004",
31288 }
31289
31290 @TechReport{Manna:1984:APP,
31291 author = "Zohar Manna and Amir Pnueli",
31292 title = "Adequate Proof Principles for Invariance and Liveness
31293 Properties of Concurrent Programs",
31294 type = "Technical Report",
31295 number = "STAN-CS-84-1005",
31296 institution = inst-STAN-CS,
31297 address = inst-STAN-CS:adr,
31298 pages = "35",
31299 month = may,
31300 year = "1984",
31301 bibdate = "Thu Nov 20 12:11:36 MST 2025",
31302 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
31303 URL = "http://www-db.stanford.edu/TR/CS-TR-84-1005.html",
31304 abstract = "This paper presents proof principles for establishing
31305 invariance and liveness properties of concurrent
31306 programs. Invariance properties are established by
31307 systematically checking that they are preserved by
31308 every atomic instruction in the program. The methods
31309 for establishing liveness properties are based on
31310 'well-founded assertions' and are applicable to both
31311 ``just'' and ``fair'' computations. These methods do
31312 not assume a decrease of the rank at each computation
31313 step. It is sufficient that there exists one process
31314 which decreases the rank when activated. Fairness then
31315 ensures that the program will eventually attain its
31316 goal. In the finite state case such proofs can be
31317 represented by diagrams. Several examples are given.",
31318 acknowledgement = ack-nhfb,
31319 pdfpages = "38",
31320 xxnumber = "CS-TR-84-1005",
31321 }
31322
31323 @TechReport{Ketonen:1984:EIP,
31324 author = "Jussi Ketonen and Joseph S. Weening",
31325 title = "{EKL} --- an interactive proof checker user's
31326 reference manual",
31327 type = "Technical Report",
31328 number = "STAN-CS-84-1006",
31329 institution = inst-STAN-CS,
31330 address = inst-STAN-CS:adr,
31331 pages = "55",
31332 month = jun,
31333 year = "1984",
31334 bibdate = "Thu Nov 20 12:11:36 MST 2025",
31335 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
31336 URL = "http://www-db.stanford.edu/TR/CS-TR-84-1006.html",
31337 abstract = "EKL is an interactive proof checker and constructor.
31338 Its main goal is to facilitate the checking of
31339 mathematical proofs. Some of the special features of
31340 EKL are: * The language of EKL can be extended all the
31341 way to finite-order predicate logic with typed
31342 lambda-calculus. * Several proofs can be handled at the
31343 same time. * Metatheoretic reasoning allows formal
31344 extensions of the capabilities of EKL. * EKL is a
31345 programmable system. The MACLISP language is available
31346 to the user, and LISP functions can be written to
31347 create input to EKL, thereby allowing expression of
31348 proofs in an arbitrary input language. This document is
31349 a reference manual for EKL. Each of the sections
31350 discusses a major part of the language, beginning with
31351 an overview of that area, and proceeding to a detailed
31352 discussion of available features. To gain an
31353 acquaintance with EKL, it is recommended that you read
31354 only the introductory part of each section. EKL may be
31355 used both at the Stanford Artificial Intelligence
31356 Laboratory (SAIL) computer system, and on DEC TOPS-20
31357 systems that support MACLISP.",
31358 acknowledgement = ack-nhfb,
31359 xxnumber = "CS-TR-84-1006",
31360 }
31361
31362 @TechReport{Gabriel:1984:QBM,
31363 author = "Richard P. Gabriel and John McCarthy",
31364 title = "Queue-based Multi-processing {Lisp}",
31365 type = "Technical Report",
31366 number = "STAN-CS-84-1007",
31367 institution = inst-STAN-CS,
31368 address = inst-STAN-CS:adr,
31369 pages = "35",
31370 month = jun,
31371 year = "1984",
31372 bibdate = "Thu Nov 20 12:11:36 MST 2025",
31373 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
31374 URL = "http://www-db.stanford.edu/TR/CS-TR-84-1007.html",
31375 abstract = "This report presents a dialect of Lisp, called
31376 QLAMBDA, which supports multi-processing. Along with
31377 the definition of the dialect, the report presents
31378 programming examples and performance studies of some
31379 programs written in QLAMBDA. Unlike other proposed
31380 multi-processing Lisps, QLAMBDA provides only a few
31381 very powerful and intuitive primitives rather than a
31382 number of parallel variants of familiar constructs.",
31383 acknowledgement = ack-nhfb,
31384 author-dates = "John McCarthy (4 September 1927--24 October 2011)",
31385 xxnumber = "CS-TR-84-1007",
31386 }
31387
31388 @TechReport{Sagiv:1984:CTC,
31389 author = "Yehoshua Sagiv and Jeffrey D. Ullman",
31390 title = "Complexity of a top-down capture rule",
31391 type = "Technical Report",
31392 number = "STAN-CS-84-1009",
31393 institution = inst-STAN-CS,
31394 address = inst-STAN-CS:adr,
31395 pages = "ii + 35",
31396 month = jul,
31397 year = "1984",
31398 bibdate = "Thu Nov 20 12:11:36 MST 2025",
31399 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
31400 URL = "http://i.stanford.edu/pub/cstr/reports/cs/tr/84/1009/CS-TR-84-1009.pdf;
31401 http://www-db.stanford.edu/TR/CS-TR-84-1009.html",
31402 abstract = "Capture rules were introduced in [U] as a method for
31403 planning the evaluation of a query expressed in
31404 first-order logic. We examine a capture rule that is
31405 substantiated by a simple top-down implementation of
31406 restricted Horn clause logic. A necessary and
31407 sufficient condition for the top-down algorithm to
31408 converge is shown. It is proved that, provided there is
31409 a bound on the number of arguments of predicates, the
31410 test can be performed in polynomial time; however, if
31411 the arity of predicates is made part of the input, then
31412 the problem of deciding whether the top-down algorithm
31413 converges is NP-hard. We then consider relaxation of
31414 some of our constraints on the form of the logic,
31415 showing that success of the top-down algorithm can
31416 still be tested in polynomial time if the number of
31417 arguments is limited and in exponential time if not.",
31418 acknowledgement = ack-nhfb,
31419 pdfpages = "38",
31420 xxnumber = "CS-TR-84-1009",
31421 }
31422
31423 @TechReport{Lazowska:1984:FAP,
31424 author = "Edward D. Lazowska and John Zahorjan and David R.
31425 Cheriton and Willy Zwaenepoel",
31426 title = "File Access Performance of Diskless Workstations",
31427 type = "Technical Report",
31428 number = "STAN-CS-84-1010",
31429 institution = inst-STAN-CS,
31430 address = inst-STAN-CS:adr,
31431 pages = "29",
31432 month = aug,
31433 year = "1984",
31434 bibdate = "Wed Nov 26 12:13:45 MST 2025",
31435 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
31436 URL = "",
31437 acknowledgement = ack-nhfb,
31438 }
31439
31440 @TechReport{Cheriton:1984:OMI,
31441 author = "David R. Cheriton and Willy Zwaenepoel",
31442 title = "One-to-Many Interprocess Communication in the
31443 {V-System}",
31444 type = "Technical Report",
31445 number = "STAN-CS-84-1011",
31446 institution = inst-STAN-CS,
31447 address = inst-STAN-CS:adr,
31448 pages = "8",
31449 month = aug,
31450 year = "1984",
31451 bibdate = "Wed Nov 26 12:13:45 MST 2025",
31452 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
31453 URL = "",
31454 acknowledgement = ack-nhfb,
31455 }
31456
31457 @TechReport{Malachi:1984:TDT,
31458 author = "Yonathan Malachi and Zohar Manna and Richard
31459 Waldinger",
31460 title = "{TABLOG}: The Deductive-Tableau Programming Language",
31461 type = "Technical Report",
31462 number = "STAN-CS-84-1012",
31463 institution = inst-STAN-CS,
31464 address = inst-STAN-CS:adr,
31465 pages = "16",
31466 month = jun,
31467 year = "1984",
31468 bibdate = "Thu Nov 20 12:11:36 MST 2025",
31469 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
31470 URL = "http://www-db.stanford.edu/TR/CS-TR-84-1012.html",
31471 abstract = "TABLOG (Tableau Logic Programming Language) is a
31472 language based on first-order predicate logic with
31473 equality that combines functional and logic
31474 programming. TABLOG incorporates advantages of LISP and
31475 PROLOG. A program in TABLOG is a list of formulas in a
31476 first-order logic (including equality, negation, and
31477 equivalence) that is more general and more expressive
31478 than PROLOG's Horn clauses. Whereas PROLOG programs
31479 must be relational, TABLOG programs may define either
31480 relations or functions. While LISP programs yield
31481 results of a computation by returning a single output
31482 value, TABLOG programs can be relations and can produce
31483 several results simultaneously through their arguments.
31484 TABLOG employs the Manna-Waldinger deductive-tableau
31485 proof system as an interpreter in the same way that
31486 PROLOG uses a resolution-based proof system.
31487 Unification is used by TABLOG to match a call with a
31488 line in the program and to bind arguments. The basic
31489 rules of deduction used for computing are nonclausal
31490 resolution and rewriting by means of equality and
31491 equivalence. A pilot interpreter for the language has
31492 been implemented.",
31493 acknowledgement = ack-nhfb,
31494 xxnumber = "CS-TR-84-1012",
31495 }
31496
31497 @TechReport{Desarmenien:1984:HRT,
31498 author = "Jacques Desarmenien",
31499 title = "How to Run {\TeX} in {French}",
31500 type = "Technical Report",
31501 number = "STAN-CS-84-1013",
31502 institution = inst-STAN-CS,
31503 address = inst-STAN-CS:adr,
31504 pages = "42",
31505 month = aug,
31506 year = "1984",
31507 bibdate = "Wed Nov 26 12:13:45 MST 2025",
31508 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
31509 URL = "",
31510 acknowledgement = ack-nhfb,
31511 }
31512
31513 @TechReport{Anderson:1984:PCP,
31514 author = "Richard Anderson and Ernst W. Mayr",
31515 title = "A {P}-Complete Problem and Approximations to It",
31516 type = "Technical Report",
31517 number = "STAN-CS-84-1014",
31518 institution = inst-STAN-CS,
31519 address = inst-STAN-CS:adr,
31520 pages = "12",
31521 month = sep,
31522 year = "1984",
31523 bibdate = "Thu Nov 20 12:11:36 MST 2025",
31524 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
31525 URL = "http://www-db.stanford.edu/TR/CS-TR-84-1014.html",
31526 abstract = "The P-complete problem that we will consider is the
31527 High Degree Subgraph Problem. This problem is: given a
31528 graph G = (V,E) and an integer k, find the maximum
31529 induced subgraph of G that has all nodes of degree at
31530 least k. After showing that this problem is P-complete,
31531 we will discuss two approaches to finding approximate
31532 solutions to it in NC. We will give a variant of the
31533 problem that is also P-complete that can be
31534 approximated to within a factor of c in NC, for any c
31535 &lt; 1/2, but cannot be approximated by a factor of
31536 better than 1/2 unless P = NC. We will also give an
31537 algorithm that finds a subgraph with moderately high
31538 minimum degree. This algorithm exhibits an interesting
31539 relationship between its performance and the time it
31540 takes.",
31541 acknowledgement = ack-nhfb,
31542 xxnumber = "CS-TR-84-1014",
31543 }
31544
31545 @TechReport{Kirousis:1984:CRP,
31546 author = "Lefteris Kirousis and Christos Papadimitriou",
31547 title = "The Complexity of Recognizing Polyhedral Scenes",
31548 type = "Technical Report",
31549 number = "STAN-CS-84-1015",
31550 institution = inst-STAN-CS,
31551 address = inst-STAN-CS:adr,
31552 pages = "33",
31553 month = aug,
31554 year = "1984",
31555 bibdate = "Wed Nov 26 12:13:45 MST 2025",
31556 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
31557 URL = "",
31558 acknowledgement = ack-nhfb,
31559 }
31560
31561 @TechReport{Papadimitriou:1984:IPC,
31562 author = "Christos Papadimitriou and John Tsitsiklis",
31563 title = "Intractable Problems in Control Theory",
31564 type = "Technical Report",
31565 number = "STAN-CS-84-1016",
31566 institution = inst-STAN-CS,
31567 address = inst-STAN-CS:adr,
31568 pages = "23",
31569 month = aug,
31570 year = "1984",
31571 bibdate = "Wed Nov 26 12:13:45 MST 2025",
31572 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
31573 URL = "",
31574 acknowledgement = ack-nhfb,
31575 }
31576
31577 @TechReport{Papadimitriou:1984:TPB,
31578 author = "Christos Papadimitriou and John Tsitsiklis",
31579 title = "The Throughput of a Precedence-Based Queuing
31580 Discipline",
31581 type = "Technical Report",
31582 number = "STAN-CS-84-1017",
31583 institution = inst-STAN-CS,
31584 address = inst-STAN-CS:adr,
31585 pages = "9",
31586 month = aug,
31587 year = "1984",
31588 bibdate = "Wed Nov 26 12:13:45 MST 2025",
31589 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
31590 URL = "",
31591 acknowledgement = ack-nhfb,
31592 }
31593
31594 @TechReport{Clancey:1984:CPS,
31595 author = "William J. Clancey",
31596 title = "Classification Problem Solving",
31597 type = "Technical Report",
31598 number = "STAN-CS-84-1018",
31599 institution = inst-STAN-CS,
31600 address = inst-STAN-CS:adr,
31601 pages = "iv + 23",
31602 month = jul,
31603 year = "1984",
31604 bibdate = "Thu Nov 20 12:11:36 MST 2025",
31605 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
31606 URL = "http://www-db.stanford.edu/TR/CS-TR-84-1018.html",
31607 abstract = "A broad range of heuristic programs--embracing forms
31608 of diagnosis. catalog selection, and skeletal
31609 planning--accomplish a kind of well-structured problem
31610 solving called classification. These programs have a
31611 characteristic inference structure that systematically
31612 relates data to a pre-enumerated set of solutions by
31613 abstraction, heuristic association, and refinement.
31614 This level of description specifies the knowledge
31615 needed to solve a problem, independent of its
31616 representation in a particular computer language. The
31617 classification problem-solving model provides a useful
31618 framework for recognizing and representing similar
31619 problems, for designing representation tools, and for
31620 understanding the problem-solving methods used by
31621 non-classification programs.",
31622 acknowledgement = ack-nhfb,
31623 pdfpages = "28",
31624 xxnumber = "CS-TR-84-1018",
31625 }
31626
31627 @TechReport{Lifschitz:1984:SRC,
31628 author = "Vladimir Lifschitz",
31629 title = "Some Results on Circumscription",
31630 type = "Technical Report",
31631 number = "STAN-CS-84-1019",
31632 institution = inst-STAN-CS,
31633 address = inst-STAN-CS:adr,
31634 pages = "14",
31635 month = sep,
31636 year = "1984",
31637 bibdate = "Wed Nov 26 12:13:45 MST 2025",
31638 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
31639 URL = "",
31640 acknowledgement = ack-nhfb,
31641 }
31642
31643 @TechReport{Lowe:1984:POV,
31644 author = "David Lowe",
31645 title = "Perceptual Organization and Visual Recognition",
31646 type = "Technical Report",
31647 number = "STAN-CS-84-1020",
31648 institution = inst-STAN-CS,
31649 address = inst-STAN-CS:adr,
31650 pages = "152",
31651 month = sep,
31652 year = "1984",
31653 bibdate = "Wed Nov 26 12:13:45 MST 2025",
31654 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
31655 URL = "",
31656 acknowledgement = ack-nhfb,
31657 remark = "This is the author's thesis.",
31658 }
31659
31660 @TechReport{Kunz:1984:UAI,
31661 author = "John C. Kunz",
31662 title = "Use of Artificial Intelligence and Simple
31663 Mathematics",
31664 type = "Technical Report",
31665 number = "STAN-CS-84-1021",
31666 institution = inst-STAN-CS,
31667 address = inst-STAN-CS:adr,
31668 pages = "182",
31669 month = jul,
31670 year = "1984",
31671 bibdate = "Wed Nov 26 12:13:45 MST 2025",
31672 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
31673 URL = "",
31674 acknowledgement = ack-nhfb,
31675 remark = "This is the author's thesis.",
31676 }
31677
31678 @TechReport{Konolige:1984:DMB,
31679 author = "Kurt Konolige",
31680 title = "A Deduction Model of Belief and its Logics",
31681 type = "Technical Report",
31682 number = "STAN-CS-84-1022",
31683 institution = inst-STAN-CS,
31684 address = inst-STAN-CS:adr,
31685 pages = "312",
31686 month = aug,
31687 year = "1984",
31688 bibdate = "Wed Nov 26 12:13:45 MST 2025",
31689 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
31690 URL = "",
31691 acknowledgement = ack-nhfb,
31692 remark = "This is the author's thesis.",
31693 }
31694
31695 @TechReport{Gordon:1984:MME,
31696 author = "Jean Gordon and Edward H. Shortliffe",
31697 title = "A method for managing evidential reasoning in a
31698 hierarchical hypothesis space",
31699 type = "Technical Report",
31700 number = "STAN-CS-84-1023",
31701 institution = inst-STAN-CS,
31702 address = inst-STAN-CS:adr,
31703 pages = "41",
31704 month = sep,
31705 year = "1984",
31706 bibdate = "Thu Nov 20 12:11:36 MST 2025",
31707 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
31708 URL = "http://www-db.stanford.edu/TR/CS-TR-84-1023.html",
31709 acknowledgement = ack-nhfb,
31710 remark = "No abstract is available.",
31711 xxnumber = "CS-TR-84-1023",
31712 }
31713
31714 @TechReport{Upfal:1984:HSM,
31715 author = "Eli Upfal and Avi Wigderson",
31716 title = "How to Share Memory in a Distributed System",
31717 type = "Technical Report",
31718 number = "STAN-CS-84-1024",
31719 institution = inst-STAN-CS,
31720 address = inst-STAN-CS:adr,
31721 pages = "19",
31722 month = oct,
31723 year = "1984",
31724 bibdate = "Thu Nov 20 12:11:36 MST 2025",
31725 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
31726 URL = "http://www-db.stanford.edu/TR/CS-TR-84-1024.html",
31727 abstract = "We study the power of shared-memory in models of
31728 parallel computation. We describe a novel distributed
31729 data structure that eliminates the need for shared
31730 memory without significantly increasing the run time of
31731 the parallel computation. More specifically we show how
31732 a complete network of processors can deterministically
31733 simulate one PRAM step in O(log n $ {(loglog n)}^2$)
31734 time, when both models use n processors, and the size
31735 of the PRAM's shared memory is polynomial in n. (The
31736 best previously known upper bound was the trivial
31737 O(n)). We also establish that this upper bound is
31738 nearly optimal. We prove that an on-line simulation of
31739 T PRAM steps by a complete network of processors
31740 requires $ \Omega (T \log n / \log \log n)$ time. A
31741 simple consequence of the upper bound is that an
31742 Ultracomputer (the only currently feasible general
31743 purpose parallel machine), can simulate one step of a
31744 PRAM (the most convenient parallel model to program),
31745 in $ O({(log n loglog n)}^2) $ steps.",
31746 acknowledgement = ack-nhfb,
31747 xxnumber = "CS-TR-84-1024",
31748 }
31749
31750 @TechReport{Helmbold:1984:FSA,
31751 author = "David Helmbold and Ernst Mayr",
31752 title = "Fast Scheduling Algorithms on Parallel Computers",
31753 type = "Technical Report",
31754 number = "STAN-CS-84-1025",
31755 institution = inst-STAN-CS,
31756 address = inst-STAN-CS:adr,
31757 pages = "31",
31758 month = nov,
31759 year = "1984",
31760 bibdate = "Thu Nov 20 12:11:36 MST 2025",
31761 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
31762 URL = "http://www-db.stanford.edu/TR/CS-TR-84-1025.html",
31763 abstract = "With the introduction of parallel processing,
31764 scheduling problems have generated great interest.
31765 Although there are good sequential algorithms for many
31766 scheduling problems, there are few fast parallel
31767 scheduling algorithms. In this paper we present several
31768 good scheduling algorithms that run on EREW PRAMS. For
31769 the unit time execution case, we have algorithms that
31770 will schedule n jobs with intree or outtree precedence
31771 constraints in O(log n) time. The intree algorithm
31772 requires $ n^3 $ processors, and the outtree algorithm
31773 requires $ n^4 $ processors. Another type of scheduling
31774 problem is list scheduling, where a list of n jobs with
31775 integer execution times is to be scheduled in list
31776 order. We show that the general list scheduling problem
31777 on two identical processors is polynomial-time
31778 complete, and therefore is not likely to have a fast
31779 parallel algorithm. However, when the length of the
31780 (binary representation of the) execution times is
31781 bounded by $ O(\log^c n) $ there is an NC algorithm
31782 using $ n^4 $ processors.",
31783 acknowledgement = ack-nhfb,
31784 xxnumber = "CS-TR-84-1025",
31785 }
31786
31787 @TechReport{Chapiro:1984:GAL,
31788 author = "Daniel M. Chapiro",
31789 title = "Globally-Asynchronous Locally-Synchronous Systems",
31790 type = "Technical Report",
31791 number = "STAN-CS-84-1026",
31792 institution = inst-STAN-CS,
31793 address = inst-STAN-CS:adr,
31794 pages = "136",
31795 month = nov,
31796 year = "1984",
31797 bibdate = "Wed Nov 26 12:13:45 MST 2025",
31798 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
31799 URL = "",
31800 acknowledgement = ack-nhfb,
31801 remark = "This is the author's thesis.",
31802 }
31803
31804 @TechReport{Knuth:1984:TTT,
31805 author = "Donald E. Knuth",
31806 title = "A torture test for {\TeX}",
31807 type = "Technical Report",
31808 number = "STAN-CS-84-1027",
31809 institution = inst-STAN-CS,
31810 address = inst-STAN-CS:adr,
31811 pages = "iv + 142",
31812 month = nov,
31813 year = "1984",
31814 bibdate = "Fri Apr 18 05:25:51 2003",
31815 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
31816 URL = "http://www-db.stanford.edu/TR/CS-TR-84-1027.html;
31817 http://www.ncstrl.org:8900/ncstrl/servlet/search?formname=detail&id=oai%3Ancstrlh%3Astan%3ASTAN%2F%2FCS-TR-84-1027",
31818 abstract = "Programs that claim to be implementations of {\TeX82}
31819 are supposed to be able to process the test routine
31820 contained in this report, producing the outputs
31821 contained in this report.",
31822 acknowledgement = ack-nhfb # "\slash " # ack-hk,
31823 documentid = "oai:ncstrlh:stan:STAN//CS-TR-84-1027",
31824 pdfpages = "146",
31825 xxnumber = "CS-TR-84-1027",
31826 }
31827
31828 @TechReport{Hochschild:1984:PGA,
31829 author = "Peter H. Hochschild and Ernst W. Mayr and Alan R.
31830 Siegel",
31831 title = "Parallel Graph Algorithms",
31832 type = "Technical Report",
31833 number = "STAN-CS-84-1028",
31834 institution = inst-STAN-CS,
31835 address = inst-STAN-CS:adr,
31836 pages = "57",
31837 month = dec,
31838 year = "1984",
31839 bibdate = "Thu Nov 20 12:11:36 MST 2025",
31840 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
31841 URL = "http://www-db.stanford.edu/TR/CS-TR-84-1028.html",
31842 abstract = "This paper presents new paradigms to solve efficiently
31843 a variety of graph problems on parallel machines. These
31844 paradigms make it possible to discover and exploit the
31845 ``parallelism'' inherent in many classical graph
31846 problems. We abandon attempts to force sequential
31847 algorithms into parallel environments for such attempts
31848 usually result in transforming a good uniprocessor
31849 algorithm into a hopelessly greedy parallel algorithm.
31850 We show that by employing more local computation and
31851 mild redundance, a variety of problems can be solved in
31852 a resource- and time-efficient manner on a variety of
31853 architectures.",
31854 acknowledgement = ack-nhfb,
31855 xxnumber = "CS-TR-84-1028",
31856 }
31857
31858 @TechReport{Dietterich:1984:CPT,
31859 author = "Thomas G. Dietterich",
31860 title = "Constraint Propagation Techniques for Theory-Driven
31861 Data Interpretation",
31862 type = "Technical Report",
31863 number = "STAN-CS-84-1030",
31864 institution = inst-STAN-CS,
31865 address = inst-STAN-CS:adr,
31866 pages = "180",
31867 month = dec,
31868 year = "1984",
31869 bibdate = "Wed Nov 26 12:13:45 MST 2025",
31870 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
31871 URL = "",
31872 acknowledgement = ack-nhfb,
31873 remark = "This is the author's thesis.",
31874 }
31875
31876 @TechReport{Cooper:1984:NCB,
31877 author = "Gregory Floyd Cooper",
31878 title = "{NESTOR}: a Computer-Based Medical Diagnostic Aid that
31879 Integrates Causal and Probabilistic Knowledge",
31880 type = "Technical Report",
31881 number = "STAN-CS-84-1031 (HPP-84-48, AD-A152046)",
31882 institution = inst-STAN-CS,
31883 address = inst-STAN-CS:adr,
31884 pages = "xiii + 239",
31885 month = nov,
31886 year = "1984",
31887 bibdate = "Wed Nov 26 12:13:45 MST 2025",
31888 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
31889 URL = "https://apps.dtic.mil/sti/tr/pdf/ADA152046.pdf",
31890 abstract = "In order to address some existing problems in
31891 computer-aided medical decision making, a computer
31892 program called NESTOR has been developed to aid
31893 physicians in determining the most likely diagnostic
31894 hypothesis to account for a set of patient findings.
31895 The domain of hypercalcemic disorders is used to test
31896 solution methods that should be applicable to other
31897 medical areas.\par
31898
31899 A key design philosophy underlying NESTOR is that the
31900 physician should have control of the computer
31901 interaction to determine what is done and when. In
31902 order to provide such a controllable, interactive aid,
31903 specific technical tasks had to be addressed. The
31904 unifying philosophy in addressing them is the use of
31905 knowledge-based methods within a formal probability
31906 theory framework. The tasks are as follows:\par
31907
31908 1. Scoring Hypotheses: The likelihood of an hypothesis
31909 is determined by using formal probabilistic reasoning
31910 with heuristic knowledge introduced explicitly as
31911 assumptions. During the scoring process causal
31912 knowledge is used in guiding the application of
31913 relatively sparse probabilistic knowledge. The scoring
31914 method emphasizes bounding the probability of an
31915 hypothesis rather than calculating it exactly.\par
31916
31917 2. Searching Hypotheses: A branch and bound search
31918 technique is used to search among diagnostic hypotheses
31919 for the most probable one. This technique is able to
31920 locate the most probable hypothesis without exploring
31921 the entire hypothesis space, which is particularly
31922 useful in diagnosing complex, multidisease cases where
31923 the space may be Very large.\par
31924
31925 3. Explanation: NESTOR is able to critique and compare
31926 hypotheses which are generated by the system.
31927 volunteered by the user, or both. Critiquing a single
31928 hypothesis involves explaining the critical qualitative
31929 causal and quantitative probabilistic factors that
31930 affect its score. In addition, any two hypotheses can
31931 be comparatively critiqued.\par
31932
31933 A user interface module gives the physician control
31934 over when and how these tasks are used to aid in
31935 diagnosing the cause of a patient's condition.\par
31936
31937 This dissertation presents the problems that are
31938 addressed by each of the three tasks, and the details
31939 of the methods used to address them. In addition, the
31940 results of an evaluation of the hypothesis scoring and
31941 search techniques are presented and discussed.",
31942 acknowledgement = ack-nhfb,
31943 advisor = "Ted Shortliffe",
31944 pdfpages = "263",
31945 remark = "This is the author's Ph.D. thesis in Medical
31946 Information Sciences. The PDF file is OCR'ed scans of
31947 microfiche page images.",
31948 }
31949
31950 @TechReport{Genesereth:1984:SPD,
31951 author = "Michael R. Genesereth and Matthew L. Ginsberg and
31952 Jeffrey S. Rosenschein",
31953 title = "Solving the {Prisoner's Dilemma}",
31954 type = "Technical Report",
31955 number = "STAN-CS-84-1032",
31956 institution = inst-STAN-CS,
31957 address = inst-STAN-CS:adr,
31958 pages = "12",
31959 month = nov,
31960 year = "1984",
31961 bibdate = "Thu Nov 20 12:11:36 MST 2025",
31962 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
31963 URL = "http://www-db.stanford.edu/TR/CS-TR-84-1032.html",
31964 abstract = "A framework is proposed for analyzing various types of
31965 rational interaction. We consider a variety of
31966 restrictions of participants' moves; each leads to a
31967 different characterization of rational behavior. Under
31968 an assumption of ``common rationality,'' it is proven
31969 that participants will cooperate, rather than defect,
31970 in the Prisoner's Dilemma.",
31971 acknowledgement = ack-nhfb,
31972 xxnumber = "CS-TR-84-1032",
31973 }
31974
31975 @TechReport{Gischer:1984:POA,
31976 author = "Jay L. Gischer",
31977 title = "Partial Orders and the Axiomatic Theory of Shuffle",
31978 type = "Technical Report",
31979 number = "STAN-CS-84-1033",
31980 institution = inst-STAN-CS,
31981 address = inst-STAN-CS:adr,
31982 pages = "46",
31983 month = dec,
31984 year = "1984",
31985 bibdate = "Wed Nov 26 12:13:45 MST 2025",
31986 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
31987 URL = "",
31988 acknowledgement = ack-nhfb,
31989 remark = "This is the author's thesis.",
31990 }
31991
31992 @TechReport{Hayes-Roth:1984:BAB,
31993 author = "Barbara Hayes-Roth",
31994 title = "{BB1}: an architecture for blackboard systems that
31995 control, explain, and learn about their own behavior",
31996 type = "Technical Report",
31997 number = "STAN-CS-84-1034",
31998 institution = inst-STAN-CS,
31999 address = inst-STAN-CS:adr,
32000 pages = "??",
32001 month = dec,
32002 year = "1984",
32003 bibdate = "Thu Nov 20 12:11:36 MST 2025",
32004 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
32005 URL = "http://www-db.stanford.edu/TR/CS-TR-84-1034.html",
32006 abstract = "BB1 implements a domain-independent ``blackboard
32007 control architecture'' for Al systems that control,
32008 explain, and learn about their own problem-solving
32009 behavior. A BB1 system comprises: a user-defined domain
32010 blackboard, a pre-defined control blackboard,
32011 user-defined domain and control knowledge sources, a
32012 few generic control knowledge sources, and a
32013 pre-defined basic control loop. The architecture's run
32014 time user interface provides capabilities for:
32015 displaying the blackboard, knowledge sources, and
32016 pending knowledge source actions, recommending an
32017 action for execution, explaining a recommendation,
32018 accepting a user's override, executing a designated
32019 action, and running without user intervention. BB1
32020 supports a variety of control behavior ranging from
32021 execution of pre-defined control procedures to dynamic
32022 construction and modification of complex control plans
32023 during problem solving. It explains problem-solving
32024 actions by showing their roles in the underlying
32025 control plan. It learns new control heuristics from
32026 experience, applies them within the current
32027 problem-solving session, and uses them to construct new
32028 control plans in subsequent sessions.",
32029 acknowledgement = ack-nhfb,
32030 xxnumber = "CS-TR-84-1034",
32031 }
32032
32033 @TechReport{Ullman:1984:CFW,
32034 author = "Jeffrey Ullman and Harry Mairson and Danny Dolev and
32035 David Maier",
32036 title = "Correcting Faults in Write-Once Memory",
32037 type = "Technical Report",
32038 number = "STAN-CS-84-999",
32039 institution = inst-STAN-CS,
32040 address = inst-STAN-CS:adr,
32041 pages = "5",
32042 month = jan,
32043 year = "1984",
32044 bibdate = "Wed Nov 26 12:13:45 MST 2025",
32045 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
32046 URL = "",
32047 acknowledgement = ack-nhfb,
32048 }
32049
32050 @TechReport{Ginsberg:1984:C,
32051 author = "Matthew L. Ginsberg",
32052 title = "Counterfactuals",
32053 type = "Technical Report",
32054 number = "STAN-CS-85-1029",
32055 institution = inst-STAN-CS,
32056 address = inst-STAN-CS:adr,
32057 pages = "13",
32058 month = dec,
32059 year = "1984",
32060 bibdate = "Wed Nov 26 12:13:45 MST 2025",
32061 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
32062 URL = "",
32063 acknowledgement = ack-nhfb,
32064 }
32065
32066 @TechReport{Gardner:1984:AIA,
32067 author = "Anne von der Leith Gardner",
32068 title = "An Artificial Intelligence Approach to Legal
32069 Reasoning",
32070 type = "Technical Report",
32071 number = "STAN-CS-85-1045",
32072 institution = inst-STAN-CS,
32073 address = inst-STAN-CS:adr,
32074 pages = "205",
32075 month = jun,
32076 year = "1984",
32077 bibdate = "Wed Nov 26 12:13:45 MST 2025",
32078 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
32079 URL = "",
32080 acknowledgement = ack-nhfb,
32081 }
32082
32083 @TechReport{Apers:1983:TCS,
32084 author = "Peter M. G. Apers and Gio Wiederhold",
32085 title = "Transaction Classification to Survive a Network
32086 Partition",
32087 type = "Technical Report",
32088 number = "STAN-CS-85-1053",
32089 institution = inst-STAN-CS,
32090 address = inst-STAN-CS:adr,
32091 pages = "ii + 24",
32092 month = aug,
32093 year = "1983",
32094 bibdate = "Thu Nov 20 12:11:36 MST 2025",
32095 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
32096 URL = "http://i.stanford.edu/pub/cstr/reports/cs/tr/85/1053/CS-TR-85-1053.pdf;
32097 http://www-db.stanford.edu/TR/CS-TR-85-1053.html",
32098 abstract = "When comparing centralized and distributed databases
32099 one of the advantages of distributed databases is said
32100 to be the greater availability of the data.
32101 Availability is defined as having access to the stored
32102 data for update and retrieval, even when some
32103 distributed sites are down due to hardware failures. We
32104 will investigate the functioning of a distributed
32105 database of which the underlying computer network may
32106 fail. A classification of transactions is given to
32107 allow an implementation of different levels of
32108 operatability. Some transactions can be guaranteed to
32109 commit in spite of a network partition, while others
32110 have to wait until the state of potential transactions
32111 in the other partitions is also known. An algorithm is
32112 given to compute a classification. Based on historics
32113 of transactions kept in the different partitions a
32114 merge of histories is computed, generating the new
32115 values for some data items when communication is
32116 re-established. The algorithm to compute the merge of
32117 the histories makes use of a knowledge base containing
32118 knowledge about the transactions, to decide whether to
32119 merge, delete, or delay a transaction.",
32120 acknowledgement = ack-nhfb,
32121 pdfpages = "26",
32122 xxnumber = "CS-TR-85-1053",
32123 }
32124
32125 @TechReport{Ossher:1984:NPS,
32126 author = "Harold L. Ossher",
32127 title = "A New Program Structuring Mechanism Based on Layered
32128 Graphs",
32129 type = "Technical Report",
32130 number = "STAN-CS-85-1078",
32131 institution = inst-STAN-CS,
32132 address = inst-STAN-CS:adr,
32133 pages = "247",
32134 month = dec,
32135 year = "1984",
32136 bibdate = "Wed Nov 26 12:13:45 MST 2025",
32137 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
32138 URL = "",
32139 acknowledgement = ack-nhfb,
32140 remark = "This is the author's thesis.",
32141 }
32142
32143 @TechReport{Hayes-Roth:1985:BAB,
32144 author = "Barbara Hayes-Roth",
32145 title = "{BB1}: an architecture for blackboard systems that
32146 control and explain, and learn about their own
32147 behavior",
32148 type = "Technical Report",
32149 number = "STAN-CS-85-1034",
32150 institution = inst-STAN-CS,
32151 address = inst-STAN-CS:adr,
32152 pages = "22",
32153 month = jan,
32154 year = "1985",
32155 bibdate = "Wed Nov 26 12:13:45 MST 2025",
32156 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
32157 URL = "",
32158 acknowledgement = ack-nhfb,
32159 }
32160
32161 @TechReport{Finger:1985:RDA,
32162 author = "J. J. Finger and Michael R. Genesereth",
32163 title = "{RESIDUE}: a Deductive Approach to Design Synthesis",
32164 type = "Technical Report",
32165 number = "STAN-CS-85-1035",
32166 institution = inst-STAN-CS,
32167 address = inst-STAN-CS:adr,
32168 pages = "20",
32169 month = jan,
32170 year = "1985",
32171 bibdate = "Thu Nov 20 12:11:36 MST 2025",
32172 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
32173 URL = "http://www-db.stanford.edu/TR/CS-TR-85-1035.html",
32174 abstract = "We present a new approach to deductive design
32175 synthesis, the Residue Approach, in which designs are
32176 represented as sets of constraints. Previous
32177 approaches, such as PROLOG [18] or the work of Manna
32178 and Waldinger [11], express designs as bindings on
32179 single terms. We give a complete and sound procedure
32180 for finding sets of propositions constituting a legal
32181 design. The size of the search space of the procedure
32182 and the advantages and disadvantages of the Residue
32183 Approach are analysed. In particular we show how
32184 Residue can avoid backtracking caused by making design
32185 decisions of overly coarse granularity. In contrast, it
32186 is awkward for the single term approaches to do the
32187 same. In addition we give a rule for constraint
32188 propagation in deductive synthesis, and show its use in
32189 pruning the design space. Finally, Residue is related
32190 to other work, in particular, to Default Logic [16] and
32191 to Assumption-Based Truth Maintenance [1].",
32192 acknowledgement = ack-nhfb,
32193 xxnumber = "CS-TR-85-1035",
32194 }
32195
32196 @TechReport{Hayes-Roth:1985:LCH,
32197 author = "Barbara Hayes-Roth and Michael Hewett",
32198 title = "Learning Control Heuristics in {BB1}",
32199 type = "Technical Report",
32200 number = "STAN-CS-85-1036",
32201 institution = inst-STAN-CS,
32202 address = inst-STAN-CS:adr,
32203 pages = "12",
32204 month = jan,
32205 year = "1985",
32206 bibdate = "Thu Nov 20 12:11:36 MST 2025",
32207 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
32208 URL = "http://www-db.stanford.edu/TR/CS-TR-85-1036.html",
32209 abstract = "BB1, a blackboard system building architecture,
32210 ameliorates the knowledge acquisition bottleneck with
32211 generic knowledge sources that learn control
32212 heuristics. Some learning knowledge sources replace the
32213 knowledge engineer, interacting directly with domain
32214 experts. Others operate autonomously. The paper
32215 presents a trace from the illustrative knowledge
32216 source. Understand-Preference, running in PROTEAN, a
32217 blackboard system for elucidating protein structure.
32218 Understand-Preference is triggered when a domain expert
32219 overrides one of BB1's scheduling recommendations. It
32220 identifies and encodes the heuristic underlying the
32221 expert's scheduling decision. The trace illustrates how
32222 learning knowledge sources exploit BB1's rich
32223 representation of domain and control knowledge,
32224 actions, and results.",
32225 acknowledgement = ack-nhfb,
32226 xxnumber = "CS-TR-85-1036",
32227 }
32228
32229 @TechReport{MacKinlay:1985:ELC,
32230 author = "Jock MacKinlay and Michael R. Genesereth",
32231 title = "Expressiveness and Language Choice",
32232 type = "Technical Report",
32233 number = "STAN-CS-85-1037",
32234 institution = inst-STAN-CS,
32235 address = inst-STAN-CS:adr,
32236 pages = "17",
32237 month = jan,
32238 year = "1985",
32239 bibdate = "Thu Nov 20 12:11:36 MST 2025",
32240 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
32241 URL = "http://www-db.stanford.edu/TR/CS-TR-85-1037.html",
32242 abstract = "Specialized languages are often more appropriate than
32243 general languages for expressing certain information.
32244 However, specialized languages must be chosen carefully
32245 because they do not allow all sets of facts to be
32246 stated. This paper considers the problems associated
32247 with choosing among specialized languages. Methods are
32248 presented for determining that a set of facts is
32249 expressible in a language, for identifying when
32250 additional facts are stated accidentally, and for
32251 choosing among languages that can express a set of
32252 facts. This research is being used to build a system
32253 that automatically chooses an appropriate graphical
32254 language to present a given set of facts.",
32255 acknowledgement = ack-nhfb,
32256 xxnumber = "CS-TR-85-1037",
32257 }
32258
32259 @TechReport{Yao:1985:UHO,
32260 author = "Andrew C. Yao",
32261 title = "Uniform Hashing Is Optimal",
32262 type = "Technical Report",
32263 number = "STAN-CS-85-1038",
32264 institution = inst-STAN-CS,
32265 address = inst-STAN-CS:adr,
32266 pages = "9",
32267 month = jan,
32268 year = "1985",
32269 bibdate = "Thu Nov 20 12:11:36 MST 2025",
32270 bibsource = "https://www.math.utah.edu/pub/tex/bib/hash.bib;
32271 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
32272 URL = "http://www-db.stanford.edu/TR/CS-TR-85-1038.html",
32273 abstract = "It was conjectured by J. Ullman that uniform hashing
32274 is optimal in its expected retrieval cost among all
32275 open-address hashing schemes (JACM {\bf 19} (1972),
32276 569--575). In this paper we show that, for any
32277 open-address hashing scheme, the expected cost of
32278 retrieving a record from a large table which is $
32279 \alpha $-fraction full is at least $ 1 / \alpha \log 1
32280 / (1 - \alpha) + o(1)$. This proves Ullman's conjecture
32281 to be true in the asymptotic sense.",
32282 acknowledgement = ack-nhfb,
32283 xxnumber = "CS-TR-85-1038",
32284 }
32285
32286 @TechReport{Feigenbaum:1985:PTA,
32287 author = "Joan Feigenbaum and John Hershberger and Alejandro A.
32288 Schaffer",
32289 title = "A Polynomial Time Algorithm for Finding the Prime
32290 Factors of Cartesian Product Graphs",
32291 type = "Technical Report",
32292 number = "STAN-CS-85-1039",
32293 institution = inst-STAN-CS,
32294 address = inst-STAN-CS:adr,
32295 pages = "27",
32296 month = jan,
32297 year = "1985",
32298 bibdate = "Wed Nov 26 12:13:45 MST 2025",
32299 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
32300 URL = "",
32301 acknowledgement = ack-nhfb,
32302 }
32303
32304 @TechReport{Keller:1985:URD,
32305 author = "Arthur M. Keller",
32306 title = "Updating Relational Databases through Views",
32307 type = "Technical Report",
32308 number = "STAN-CS-85-1040",
32309 institution = inst-STAN-CS,
32310 address = inst-STAN-CS:adr,
32311 pages = "119",
32312 month = feb,
32313 year = "1985",
32314 bibdate = "Wed Nov 26 12:13:45 MST 2025",
32315 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
32316 URL = "",
32317 acknowledgement = ack-nhfb,
32318 remark = "This is the author's thesis.",
32319 }
32320
32321 @TechReport{Blicher:1985:EDG,
32322 author = "A. Peter Blicher",
32323 title = "Edge Detection and Geometric Methods in Computer
32324 Vision",
32325 type = "Technical Report",
32326 number = "STAN-CS-85-1041",
32327 institution = inst-STAN-CS,
32328 address = inst-STAN-CS:adr,
32329 pages = "266",
32330 month = feb,
32331 year = "1985",
32332 bibdate = "Wed Nov 26 12:13:45 MST 2025",
32333 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
32334 URL = "",
32335 acknowledgement = ack-nhfb,
32336 remark = "This is the author's thesis.",
32337 }
32338
32339 @TechReport{Rosenschein:1985:DAR,
32340 author = "Jeffrey S. Rosenschein and Michael R. Genesereth",
32341 title = "Deals Among Rational Agents",
32342 type = "Technical Report",
32343 number = "STAN-CS-85-1042",
32344 institution = inst-STAN-CS,
32345 address = inst-STAN-CS:adr,
32346 pages = "25",
32347 month = mar,
32348 year = "1985",
32349 bibdate = "Wed Nov 26 12:13:45 MST 2025",
32350 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
32351 URL = "",
32352 acknowledgement = ack-nhfb,
32353 }
32354
32355 @TechReport{Karp:1985:CPM,
32356 author = "Richard M. Karp and Eli Upfal and Avi Wigderson",
32357 title = "Constructing a Perfect Matching is in Random {NC}",
32358 type = "Technical Report",
32359 number = "STAN-CS-85-1043",
32360 institution = inst-STAN-CS,
32361 address = inst-STAN-CS:adr,
32362 pages = "15",
32363 month = mar,
32364 year = "1985",
32365 bibdate = "Thu Nov 20 12:11:36 MST 2025",
32366 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
32367 URL = "http://www-db.stanford.edu/TR/CS-TR-85-1043.html",
32368 abstract = "We show that the problem of constructing a perfect
32369 matching in a graph is in the complexity class Random
32370 NC: i.e., the problem is solvable in polylog time by a
32371 randomized parallel algorithm using a
32372 polynomial-bounded number of processors. We also show
32373 that several related problems lie in Random NC. These
32374 include: (i) Constructing a perfect matching of maximum
32375 weight in a graph whose edge weights are given in unary
32376 notation; (ii) Constructing a maximum-cardinality
32377 matching; (iii) Constructing a matching covering a set
32378 of vertices of maximum weight in a graph whose vertex
32379 weights are given in binary; (iv) Constructing a
32380 maximum s-t flow in a directed graph whose edge weights
32381 are given in unary.",
32382 acknowledgement = ack-nhfb,
32383 xxnumber = "CS-TR-85-1043",
32384 }
32385
32386 @TechReport{Manna:1985:OBS,
32387 author = "Zohar Manna and Richard Waldinger",
32388 title = "The Origins of the Binary-Search Paradigm",
32389 type = "Technical Report",
32390 number = "STAN-CS-85-1044 (AD-A154367)",
32391 institution = inst-STAN-CS,
32392 address = inst-STAN-CS:adr,
32393 pages = "iii + 23",
32394 month = mar,
32395 year = "1985",
32396 bibdate = "Wed Nov 26 12:13:45 MST 2025",
32397 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
32398 note = "See revised version \cite{Manna:1986:OBS}.",
32399 URL = "https://apps.dtic.mil/sti/tr/pdf/ADA154367.pdf",
32400 abstract = "In a binary-search algorithm for the computation of a
32401 numerical function, the interval in which the desired
32402 output is sought is divided in half at each iteration.
32403 The paper considers how such algorithms might be
32404 derived from their specifications by an automatic
32405 system for program synthesis. The derivation of the
32406 binary-search concept has been found to be surprisingly
32407 straightforward. The programs obtained, though
32408 reasonably simple and efficient. are quite different
32409 from those that would have been constructed by informal
32410 means",
32411 acknowledgement = ack-nhfb,
32412 journal-URL = "http://www.sciencedirect.com/science/journal/01676423/",
32413 keywords = "binary search; program synthesis; real square root;
32414 theorem proving",
32415 pdfpages = "27",
32416 remark = "No PDF in NTRL archive, but listed there as a 1985
32417 report number ADA154367, and a 1986 revision, report
32418 number ADA193996. PDF files located in dtic.mil
32419 archive. Revised version published in
32420 \booktitle{Science of Computer Programming}, {\bf 9}(1)
32421 37--83, August 1987, CODEN SCPGD4, ISSN 0167-6423
32422 (print), 1872-7964 (electronic).",
32423 }
32424
32425 @TechReport{Manna:1986:OBS,
32426 author = "Zohar Manna and Richard Waldinger",
32427 title = "The Origins of the Binary-Search Paradigm",
32428 type = "SRI Technical Note",
32429 number = "351R (AD-A193996)",
32430 institution = "SRI International",
32431 address = "Menlo Park, CA 94025, USA",
32432 pages = "i + 50",
32433 month = oct,
32434 year = "1986",
32435 bibdate = "Wed Nov 26 12:13:45 MST 2025",
32436 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
32437 note = "Revision of \cite{Manna:1985:OBS}.",
32438 URL = "https://apps.dtic.mil/sti/tr/pdf/ADA193996.pdf",
32439 abstract = "In a binary-search algorithm for the computation of a
32440 numerical function, the interval in which the desired
32441 output is sought is divided in half at each iteration.
32442 The paper considers how such algorithms might be
32443 derived from their specifications by an automatic
32444 system for program synthesis. The derivation of the
32445 binary-search concept has been found to be surprisingly
32446 straightforward. The programs obtained, though
32447 reasonably simple and efficient. are quite different
32448 from those that would have been constructed by informal
32449 means",
32450 acknowledgement = ack-nhfb,
32451 journal-URL = "http://www.sciencedirect.com/science/journal/01676423/",
32452 keywords = "binary search; lambo function; program synthesis; real
32453 square root; theorem proving",
32454 pdfpages = "54",
32455 remark = "No PDF in NTRL archive, but listed there as a 1985
32456 report number ADA154367, and a 1986 revision, report
32457 number ADA193996. PDF files located in dtic.mil
32458 archive. Revised version published in
32459 \booktitle{Science of Computer Programming}, {\bf 9}(1)
32460 37--83, August 1987, CODEN SCPGD4, ISSN 0167-6423
32461 (print), 1872-7964 (electronic).",
32462 xxnumber = "STAN-CS-TR-351R (AD-A193996)",
32463 }
32464
32465 @TechReport{Ullman:1985:TAT,
32466 author = "Jeffrey D. Ullman and Allen {Van Gelder}",
32467 title = "Testing Applicability of Top-Down Capture Rules",
32468 type = "Technical Report",
32469 number = "STAN-CS-85-1046",
32470 institution = inst-STAN-CS,
32471 address = inst-STAN-CS:adr,
32472 pages = "13",
32473 month = apr,
32474 year = "1985",
32475 bibdate = "Wed Nov 26 12:13:45 MST 2025",
32476 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
32477 URL = "",
32478 acknowledgement = ack-nhfb,
32479 }
32480
32481 @TechReport{Hobby:1985:SEC,
32482 author = "John D. Hobby",
32483 title = "Smooth, Easy to Compute Interpolating Splines",
32484 type = "Technical Report",
32485 number = "STAN-CS-85-1047",
32486 institution = inst-STAN-CS,
32487 address = inst-STAN-CS:adr,
32488 pages = "ii + 14",
32489 month = jan,
32490 year = "1985",
32491 bibdate = "Thu Nov 20 12:11:36 MST 2025",
32492 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
32493 URL = "http://i.stanford.edu/pub/cstr/reports/cs/tr/85/1047/CS-TR-85-1047.pdf;
32494 http://www-db.stanford.edu/TR/CS-TR-85-1047.html",
32495 abstract = "We present a system of interpolating splines with
32496 first and approximate second order geometric
32497 continuity. The curves are easily computed in linear
32498 time by solving a system of linear equations without
32499 the need to resort to any kind of successive
32500 approximation scheme. Emphasis is placed on the need to
32501 find aesthetically pleasing curves in a wide range of
32502 circumstances; favorable results are obtained even when
32503 the knots are very unequally spaced or widely
32504 separated. The curves are invariant under scaling,
32505 rotation, and reflection, and the effects of a local
32506 change fall off exponentially as one moves away from
32507 the disturbed knot.\par
32508
32509 Approximate second order continuity is achieved by
32510 using a linear ``mock curvature'' function in place of
32511 the actual endpoint curvature for each spline segment
32512 and choosing tangent directions at knots so as to
32513 equalize these. This avoids extraneous solutions and
32514 other forms of undesirable behavior without seriously
32515 compromising the quality of the results.\par
32516
32517 The actual spline segments can come from any family of
32518 curves whose endpoint curvatures can be suitably
32519 approximated, but we propose a specific family of
32520 parametric cubics. There is freedom to allow tangent
32521 directions and ``tension'' parameters to be specified
32522 at knots, and special ``curl'' parameters may be given
32523 for additional control near the endpoints of open
32524 curves.",
32525 acknowledgement = ack-nhfb,
32526 pdfpages = "16",
32527 xxnumber = "CS-TR-85-1047",
32528 }
32529
32530 @TechReport{Pratt:1985:SCO,
32531 author = "Vaughan Pratt",
32532 title = "Some constructions for order-theoretic models of
32533 concurrency",
32534 type = "Technical Report",
32535 number = "STAN-CS-85-1048",
32536 institution = inst-STAN-CS,
32537 address = inst-STAN-CS:adr,
32538 pages = "17",
32539 month = mar,
32540 year = "1985",
32541 bibdate = "Thu Nov 20 12:11:36 MST 2025",
32542 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
32543 URL = "http://www-db.stanford.edu/TR/CS-TR-85-1048.html",
32544 abstract = "We give ``tight'' and ``loose'' constructions suitable
32545 for specifying processes represented as sets of pomsets
32546 (partially ordered multisets). The tight construction
32547 is suitable for specifying ``primitive'' processes; it
32548 introduces the dual notions of concurrence and
32549 orthocurrence. The loose construction specifies a
32550 process in terms of a net of communicating
32551 subprocesses; it introduces the notion of a utilization
32552 embedding a process in a net.",
32553 acknowledgement = ack-nhfb,
32554 xxnumber = "CS-TR-85-1048",
32555 }
32556
32557 @TechReport{Pratt:1985:PMP,
32558 author = "Vaughan Pratt",
32559 title = "The {Pomset} Model of Parallel Processes: Unifying the
32560 Temporal and the Special",
32561 type = "Technical Report",
32562 number = "STAN-CS-85-1049",
32563 institution = inst-STAN-CS,
32564 address = inst-STAN-CS:adr,
32565 pages = "20",
32566 month = jan,
32567 year = "1985",
32568 bibdate = "Thu Nov 20 12:11:36 MST 2025",
32569 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
32570 URL = "http://www-db.stanford.edu/TR/CS-TR-85-1049.html",
32571 acknowledgement = ack-nhfb,
32572 remark = "No abstract is available.",
32573 xxnumber = "CS-TR-85-1049",
32574 }
32575
32576 @TechReport{Hershberger:1985:FSA,
32577 author = "John Hershberger and Ernst Mayr",
32578 title = "Fast sequential algorithms to find shuffle-minimizing
32579 and shortest paths in a shuffle-exchange network",
32580 type = "Technical Report",
32581 number = "STAN-CS-85-1050",
32582 institution = inst-STAN-CS,
32583 address = inst-STAN-CS:adr,
32584 pages = "18",
32585 month = may,
32586 year = "1985",
32587 bibdate = "Thu Nov 20 12:11:36 MST 2025",
32588 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib;
32589 https://www.math.utah.edu/pub/tex/bib/string-matching.bib",
32590 URL = "http://www-db.stanford.edu/TR/CS-TR-85-1050.html",
32591 abstract = "This paper analyzes the problem of finding shortest
32592 paths and shuffle-minimizing paths in an n-node
32593 shuffle-exchange network, where $ n = 2^m $. Such paths
32594 have the properties needed by the Valiant--Brebner
32595 permutation routing algorithm, unlike the trivial $ (m
32596 1) $-shuffle paths usually used for shuffle-exchange
32597 routing. The Valiant--Brebner algorithm requires n
32598 simultaneous route computations, one for each packet to
32599 be routed, which can be done in parallel. We give fast
32600 sequential algorithms for both problems we consider.
32601 Restricting the shortest path problem to allow only
32602 paths that use fewer than m shuffles provides intuition
32603 applicable to the general problem. Linear-time pattern
32604 matching techniques solve part of the restricted
32605 problem; as a consequence, a path using fewest shuffles
32606 can be found in $ O(m) $ time, which is optimal up to a
32607 constant factor. The shortest path problem is
32608 equivalent to the problem of finding the Hamming
32609 distances between a bitstring and all shifted instances
32610 of another. An application of the fast Fourier
32611 transform solves this problem and the shortest path
32612 problem in $ O(m \log m) $ time.",
32613 acknowledgement = ack-nhfb,
32614 xxnumber = "CS-TR-85-1050",
32615 }
32616
32617 @TechReport{Manna:1985:SRA,
32618 author = "Zohar Manna and Richard Waldinger",
32619 title = "Special Relations in Automated Deduction",
32620 type = "Technical Report",
32621 number = "STAN-CS-85-1051",
32622 institution = inst-STAN-CS,
32623 address = inst-STAN-CS:adr,
32624 pages = "63",
32625 month = may,
32626 year = "1985",
32627 bibdate = "Thu Nov 20 12:11:36 MST 2025",
32628 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
32629 URL = "http://www-db.stanford.edu/TR/CS-TR-85-1051.html",
32630 abstract = "Two deduction rules are introduced to give streamlined
32631 treatment to relations of special importance in an
32632 automated theorem-proving system. These rules, the
32633 relation replacement and relation matching rules,
32634 generalize to an arbitrary binary relation the
32635 paramodulation and E-resolution rules, respectively,
32636 for equality, and may operate within a nonclausal or
32637 clausal system. The new rules depend on an extension of
32638 the notion of polarity to apply to subterms as well as
32639 to subsentences, with respect to a given binary
32640 relation. The rules allow us to eliminate troublesome
32641 axioms, such as transitivity and monotonicity, from the
32642 system; proofs are shorter and more comprehensible, and
32643 the search space is correspondingly deflated.",
32644 acknowledgement = ack-nhfb,
32645 xxnumber = "CS-TR-85-1051",
32646 }
32647
32648 @TechReport{Tajnai:1985:FSV,
32649 author = "Carolyn E. Tajnai and Fred Terman",
32650 title = "the Father of Silicon Valley",
32651 type = "Technical Report",
32652 number = "STAN-CS-85-1052",
32653 institution = inst-STAN-CS,
32654 address = inst-STAN-CS:adr,
32655 pages = "19",
32656 month = may,
32657 year = "1985",
32658 bibdate = "Wed Nov 26 12:13:45 MST 2025",
32659 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
32660 URL = "",
32661 acknowledgement = ack-nhfb,
32662 }
32663
32664 @TechReport{Broder:1985:WRM,
32665 author = "Andrei Zary Broder",
32666 title = "Weighted Random Mappings; Properties and
32667 Applications",
32668 type = "Technical Report",
32669 number = "STAN-CS-85-1054",
32670 institution = inst-STAN-CS,
32671 address = inst-STAN-CS:adr,
32672 pages = "77",
32673 month = may,
32674 year = "1985",
32675 bibdate = "Wed Nov 26 12:13:45 MST 2025",
32676 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
32677 URL = "",
32678 acknowledgement = ack-nhfb,
32679 remark = "This is the author's thesis.",
32680 }
32681
32682 @TechReport{Haddad:1985:PPS,
32683 author = "Ramsey W. Haddad and Donald E. Knuth",
32684 title = "A Programming and Problem-Solving Seminar",
32685 type = "Technical Report",
32686 number = "STAN-CS-85-1055",
32687 institution = inst-STAN-CS,
32688 address = inst-STAN-CS:adr,
32689 pages = "iv + 103",
32690 day = "1",
32691 month = jun,
32692 year = "1985",
32693 bibdate = "Fri Apr 18 05:25:51 2003",
32694 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
32695 URL = "http://www-db.stanford.edu/TR/CS-TR-85-1055.html;
32696 http://www.ncstrl.org:8900/ncstrl/servlet/search?formname=detail&id=oai%3Ancstrlh%3Astan%3ASTAN%2F%2FCS-TR-85-1055",
32697 abstract = "This report contains edited transcripts of the
32698 discussions held in Stanford's course CS204, Problem
32699 Seminar, during winter quarter 1985. Since the topics
32700 span a large range of ideas in computer science, and
32701 since most of the important research paradigms and
32702 programming paradigms were touched on during the
32703 discussions, these notes may be of interest to graduate
32704 students of computer science at other universities, as
32705 well as to their professors and to professional people
32706 in the ``real world.''\par
32707
32708 The present report is the sixth in a series of such
32709 transcripts, continuing the tradition established in
32710 STAN-CS-77-606 (Michael J. Clancy, 1977),
32711 STAN-CS-79-707 (Chris Van Wyk, 1979), STAN-CS-81-863
32712 (Allan A. Miller, 1981), STAN-CS-83-989 (Joseph S.
32713 Weening, 1983), STAN-CS-83-990 (John D. Hobby, 1983).",
32714 acknowledgement = ack-nhfb,
32715 documentid = "oai:ncstrlh:stan:STAN//CS-TR-85-1055",
32716 pdfpages = "108",
32717 xxnumber = "CS-TR-85-1055",
32718 }
32719
32720 @TechReport{Abadi:1985:NTD,
32721 author = "Martin Abadi and Zohar Manna",
32722 title = "Nonclausal Temporal Deduction",
32723 type = "Technical Report",
32724 number = "STAN-CS-85-1056",
32725 institution = inst-STAN-CS,
32726 address = inst-STAN-CS:adr,
32727 pages = "ii + 17",
32728 month = jun,
32729 year = "1985",
32730 bibdate = "Thu Nov 20 12:11:36 MST 2025",
32731 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
32732 URL = "http://www-db.stanford.edu/TR/CS-TR-85-1056.html",
32733 abstract = "We present a proof system for propositional temporal
32734 logic. This system is based on nonclausal resolution;
32735 proofs are natural and generally short. Its extension
32736 to first-order temporal logic is considered. Two
32737 variants of the system are described. The first one is
32738 for a logic with $ \Box $ (''always''), $ \Diamond $
32739 (''sometime''), and $ \bigcirc $ (''next''). The second
32740 variant is an extension of the first one to a logic
32741 with the additional operators U (''until'') and P
32742 (''precedes''). Each of these variants is proved
32743 complete.",
32744 acknowledgement = ack-nhfb,
32745 pdfpages = "20",
32746 xxnumber = "CS-TR-85-1056",
32747 }
32748
32749 @TechReport{Mason:1985:MEP,
32750 author = "Ian A. Mason and Carolyn L. Talcott",
32751 title = "Memories of {S}-expressions Proving properties of
32752 {Lisp}-like programs that destructively alter memory",
32753 type = "Technical Report",
32754 number = "STAN-CS-85-1057",
32755 institution = inst-STAN-CS,
32756 address = inst-STAN-CS:adr,
32757 pages = "46",
32758 month = jun,
32759 year = "1985",
32760 bibdate = "Wed Nov 26 12:13:45 MST 2025",
32761 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
32762 URL = "",
32763 acknowledgement = ack-nhfb,
32764 }
32765
32766 @TechReport{Cheriton:1985:HGM,
32767 author = "David R. Cheriton and Stephen E. Deering",
32768 title = "Host groups: a multicast extension for datagram
32769 internetworks",
32770 type = "Technical Report",
32771 number = "STAN-CS-85-1058",
32772 institution = inst-STAN-CS,
32773 address = inst-STAN-CS:adr,
32774 pages = "i + 8",
32775 month = jul,
32776 year = "1985",
32777 bibdate = "Thu Nov 20 12:11:36 MST 2025",
32778 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
32779 URL = "http://www-db.stanford.edu/TR/CS-TR-85-1058.html",
32780 abstract = "The extensive use of local networks is beginning to
32781 drive requirements for internetwork facilities that
32782 connect these local networks. In particular, the
32783 availability of multicast addressing in many local
32784 networks and its use by sophisticated distributed
32785 applications motivates providing multicast across
32786 internetworks. In this paper, we propose a model of
32787 service for multicast in an internetwork, describe how
32788 this service can be used, and describe aspects of its
32789 implementation, including how it would fit into one
32790 existing internetwork architecture, namely the US DoD
32791 Internet Architecture.",
32792 acknowledgement = ack-nhfb,
32793 pdfpages = "9",
32794 xxnumber = "CS-TR-85-1058",
32795 }
32796
32797 @TechReport{Trickey:1985:CPP,
32798 author = "Howard Wellington Trickey",
32799 title = "Compiling {Pascal} Programs into Silicon",
32800 type = "Technical Report",
32801 number = "STAN-CS-85-1059",
32802 institution = inst-STAN-CS,
32803 address = inst-STAN-CS:adr,
32804 pages = "x + 184",
32805 month = jul,
32806 year = "1985",
32807 bibdate = "Wed Nov 26 12:13:45 MST 2025",
32808 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
32809 URL = "",
32810 abstract = "The hardware design process is ripe for the same kind
32811 of aid that software compilers give to software
32812 development. This thesis describes a ``silicon
32813 compiler'' called Flamel. It operates on higher level
32814 specifications than other such compilers. Specifically,
32815 ordinary Pascal programs are used to define the
32816 behavior required of the chip. Flamel undertakes to
32817 find parallelism in the program, so it can produce a
32818 fast-running implementation if there is sufficient
32819 silicon area available.\par
32820
32821 The basic method is to manipulate a dataflow-like
32822 representation of the various computations to be
32823 performed, trying to reduce the estimated running time
32824 of the chip while obeying a user-supplied constraint on
32825 the chip area. A new algorithm for expression height
32826 reduction has been developed to work on the types of
32827 graphs that arise in this application. Expression
32828 height reduction works best on large expressions, and
32829 such expressions can be formed by unrolling the loops
32830 and merging the ``then'' and ``else'' computations of
32831 an ``if'' statement. Flamel has a method for deciding
32832 how much of this sort of thing to do, again controlled
32833 by the area constraint.\par
32834
32835 An implementation of Flamel has been completed. The
32836 output is a description of a datapath and a controller,
32837 at a sufficient level of detail that good area and
32838 execution time figures can be estimated. On a series of
32839 tests, Flamel produces implementations of programs that
32840 would run 22 to 200 times faster than an MC68000
32841 running the same programs, if the clock cycles were the
32842 same. The tests also show that a wide range of
32843 time-area tradeoffs are produced by varying the area
32844 constraint",
32845 acknowledgement = ack-nhfb,
32846 remark = "This is the author's Ph.D. thesis.",
32847 }
32848
32849 @TechReport{Talcott:1985:ERT,
32850 author = "Carolyn L. Talcott",
32851 title = "The Essence of {Rum}: a theory of the Intensional and
32852 Extensional Aspects of {Lisp}-like Computation",
32853 type = "Technical Report",
32854 number = "STAN-CS-85-1060 (AD-A327435)",
32855 institution = inst-STAN-CS,
32856 address = inst-STAN-CS:adr,
32857 pages = "viii + 237",
32858 month = aug,
32859 year = "1985",
32860 bibdate = "Wed Nov 26 12:13:45 MST 2025",
32861 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
32862 URL = "https://apps.dtic.mil/sti/tr/pdf/ADA327435.pdf",
32863 acknowledgement = ack-nhfb,
32864 advisor = "Solomon Feferman [formerly, John McCarthy]",
32865 pdfpages = "250",
32866 remark = "This is the author's thesis. No abstract is available,
32867 but ADA327435 uses first page of page 1 for that
32868 purpose.",
32869 }
32870
32871 @TechReport{Knuth:1985:TP,
32872 author = "Donald E. Knuth",
32873 title = "Theory and Practice",
32874 type = "Technical Report",
32875 number = "STAN-CS-85-1061",
32876 institution = inst-STAN-CS,
32877 address = inst-STAN-CS:adr,
32878 pages = "10",
32879 month = aug,
32880 year = "1985",
32881 bibdate = "Wed Nov 26 12:13:45 MST 2025",
32882 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
32883 URL = "",
32884 acknowledgement = ack-nhfb,
32885 }
32886
32887 @TechReport{Keller:1985:CSC,
32888 author = "Arthur M. Keller",
32889 title = "Computer Science comprehensive examinations,
32890 1981\slash 82--1984\slash 85",
32891 type = "Technical Report",
32892 number = "STAN-CS-85-1062",
32893 institution = inst-STAN-CS,
32894 address = inst-STAN-CS:adr,
32895 pages = "294",
32896 month = aug,
32897 year = "1985",
32898 bibdate = "Thu Nov 20 12:11:36 MST 2025",
32899 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
32900 URL = "http://www-db.stanford.edu/TR/CS-TR-85-1062.html",
32901 abstract = "This report is a collection of the eight comprehensive
32902 examinations from Winter 1982 through Spring 1985
32903 prepared by the faculty and students of Stanford's
32904 Computer Science Department together with solutions to
32905 the problems posed.",
32906 acknowledgement = ack-nhfb,
32907 xxnumber = "CS-TR-85-1062",
32908 }
32909
32910 @TechReport{Smith:1985:CRI,
32911 author = "David Smith and Michael Genesereth and Matthew
32912 Ginsberg",
32913 title = "Controlling Recursive Inference",
32914 type = "Technical Report",
32915 number = "STAN-CS-85-1063",
32916 institution = inst-STAN-CS,
32917 address = inst-STAN-CS:adr,
32918 pages = "58",
32919 month = jun,
32920 year = "1985",
32921 bibdate = "Wed Nov 26 12:13:45 MST 2025",
32922 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
32923 URL = "",
32924 acknowledgement = ack-nhfb,
32925 }
32926
32927 @TechReport{Ginsberg:1985:DP,
32928 author = "Matthew L. Ginsberg",
32929 title = "Decision Procedures",
32930 type = "Technical Report",
32931 number = "STAN-CS-85-1064",
32932 institution = inst-STAN-CS,
32933 address = inst-STAN-CS:adr,
32934 pages = "21",
32935 month = may,
32936 year = "1985",
32937 bibdate = "Wed Nov 26 12:13:45 MST 2025",
32938 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
32939 URL = "",
32940 acknowledgement = ack-nhfb,
32941 }
32942
32943 @TechReport{Clancey:1985:RSC,
32944 author = "William J. Clancey",
32945 title = "Review of {Sowa}'s ``{{\booktitle{Conceptual
32946 Structures}}}''",
32947 type = "Technical Report",
32948 number = "STAN-CS-85-1065",
32949 institution = inst-STAN-CS,
32950 address = inst-STAN-CS:adr,
32951 pages = "22",
32952 month = mar,
32953 year = "1985",
32954 bibdate = "Thu Nov 20 12:11:36 MST 2025",
32955 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
32956 URL = "http://www-db.stanford.edu/TR/CS-TR-85-1065.html",
32957 abstract = "''Conceptual Structures'' is a bold, provocative
32958 synthesis of logic, linguistics, and Artificial
32959 Intelligence research. At the very least, Sowa has
32960 provided a clean, well-grounded notation for knowledge
32961 representation that many researchers will want to
32962 emulate and build upon. At its best, Sowa's notation
32963 and proofs hint at what a future Principia Mathematica
32964 of knowledge and reasoning may look like. No other AI
32965 text achieves so much in breadth, style, and
32966 mathematical precision. This is a book that everyone in
32967 AI and cognitive science should know about, and that
32968 experienced researchers will profit from studying in
32969 some detail.",
32970 acknowledgement = ack-nhfb,
32971 xxnumber = "CS-TR-85-1065",
32972 }
32973
32974 @TechReport{Clancey:1985:HC,
32975 author = "William J. Clancey",
32976 title = "Heuristic Classification",
32977 type = "Technical Report",
32978 number = "STAN-CS-85-1066",
32979 institution = inst-STAN-CS,
32980 address = inst-STAN-CS:adr,
32981 pages = "86",
32982 month = jun,
32983 year = "1985",
32984 bibdate = "Thu Nov 20 12:11:36 MST 2025",
32985 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
32986 URL = "http://www-db.stanford.edu/TR/CS-TR-85-1066.html",
32987 abstract = "A broad range of well-structured problems--embracing
32988 forms of diagnosis, catalog selection, and skeletal
32989 planning--are solved in ``expert systems'' by the
32990 method of heuristic classification. These programs have
32991 a characteristic inference structure that
32992 systematically relates data to a pre-enumerated set of
32993 solutions by abstraction, heuristic association, and
32994 refinement. In contrast with previous descriptions of
32995 classification reasoning, particularly in psychology,
32996 this analysis emphasizes the role of a heuristic in
32997 routine problem solving as a non-hierarchical, direct
32998 association between concepts. In contrast with other
32999 descriptions of expert systems, this analysis specifies
33000 the knowledge needed to solve a problem, independent of
33001 its representation in a particular computer language.
33002 The heuristic classification problem-solving model
33003 provides a useful framework for characterizing kinds of
33004 problems, for designing representation tools, and for
33005 understanding non-classification (constructive)
33006 problem-solving methods.",
33007 acknowledgement = ack-nhfb,
33008 xxnumber = "CS-TR-85-1066",
33009 }
33010
33011 @TechReport{Clancey:1985:ARE,
33012 author = "William J. Clancey",
33013 title = "Acquiring, representing, and evaluating a competence
33014 model of diagnostic strategy",
33015 type = "Technical Report",
33016 number = "STAN-CS-85-1067",
33017 institution = inst-STAN-CS,
33018 address = inst-STAN-CS:adr,
33019 pages = "94",
33020 month = aug,
33021 year = "1985",
33022 bibdate = "Thu Nov 20 12:11:36 MST 2025",
33023 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
33024 URL = "http://www-db.stanford.edu/TR/CS-TR-85-1067.html",
33025 abstract = "NEOMYCIN is a computer program that models one
33026 physician's diagnostic reasoning within a limited area
33027 of medicine. NEOMYCIN's diagnostic procedure is
33028 represented in a well-structured way, separately from
33029 the domain knowledge it operates upon. We are testing
33030 the hypothesis that such a procedure can be used to
33031 simulate both expert problem-solving behavior and a
33032 good teacher's explanations of reasoning. The model is
33033 acquired by protocol analysis, using a framework that
33034 separates an expert's causal explanations of evidence
33035 from his descriptions of knowledge relations and
33036 strategies. The model is represented by a procedural
33037 network of goals and rules that are stated in terms of
33038 the effect the problem solver is trying to have on his
33039 evolving model of the world. The model is evaluated for
33040 sufficiency by testing it in different settings
33041 requiring expertise, such as providing advice and
33042 teaching. The model is evaluated for plausibility by
33043 arguing that the constraints implicit in the diagnostic
33044 procedure are imposed by the task domain and human
33045 computational capability. This paper discusses
33046 NEOMYCIN's diagnostic procedure in detail, viewing it
33047 as a memory aid, as a set of operators, as
33048 proceduralized constraints, and as a grammar. This
33049 study provides new perspectives on the nature of
33050 ``knowledge compilation'' and how an expert-teacher's
33051 explanations relate to a working program.",
33052 acknowledgement = ack-nhfb,
33053 xxnumber = "CS-TR-85-1067",
33054 }
33055
33056 @TechReport{Richer:1985:GWG,
33057 author = "Mark H. Richer and William J. Clancey",
33058 title = "{GUIDON-WATCH}: a graphic interface for viewing a
33059 knowledge-based system",
33060 type = "Technical Report",
33061 number = "STAN-CS-85-1068",
33062 institution = inst-STAN-CS,
33063 address = inst-STAN-CS:adr,
33064 pages = "v + 33",
33065 month = aug,
33066 year = "1985",
33067 bibdate = "Thu Nov 20 12:11:36 MST 2025",
33068 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
33069 URL = "http://www-db.stanford.edu/TR/CS-TR-85-1068.html",
33070 abstract = "This paper describes GUIDON-WATCH, a graphic interface
33071 that uses multiple windows and a mouse to allow a
33072 student to browse a knowledge base and view reasoning
33073 processes during diagnostic problem solving. Methods
33074 are presented for providing multiple views of
33075 hierarchical structures, overlaying results of a search
33076 process on top of static structures to make the
33077 strategy visible, and graphically expressing evidence
33078 relations between findings and hypotheses. This work
33079 demonstrates the advantages of stating a diagnostic
33080 search procedure in a well-structured, rule-based
33081 language, separate from domain knowledge. A number of
33082 issues in software design are also considered,
33083 including the automatic management of a multiple-window
33084 display.",
33085 acknowledgement = ack-nhfb,
33086 pdfpages = "38",
33087 xxnumber = "CS-TR-85-1068",
33088 }
33089
33090 @TechReport{Kuper:1985:LDM,
33091 author = "Gabriel M. Kuper",
33092 title = "The Logical Data Model: a New Approach to Database
33093 Logic",
33094 type = "Technical Report",
33095 number = "STAN-CS-85-1069",
33096 institution = inst-STAN-CS,
33097 address = inst-STAN-CS:adr,
33098 pages = "107",
33099 month = sep,
33100 year = "1985",
33101 bibdate = "Wed Nov 26 12:13:45 MST 2025",
33102 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
33103 URL = "",
33104 acknowledgement = ack-nhfb,
33105 remark = "This is the author's thesis.",
33106 }
33107
33108 @TechReport{Hobby:1985:DBT,
33109 author = "John D. Hobby",
33110 title = "Digitized Brush Trajectories",
33111 type = "Technical Report",
33112 number = "STAN-CS-85-1070",
33113 institution = inst-STAN-CS,
33114 address = inst-STAN-CS:adr,
33115 pages = "125",
33116 month = sep,
33117 year = "1985",
33118 bibdate = "Wed Nov 26 12:13:45 MST 2025",
33119 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
33120 URL = "https://searchworks.stanford.edu/view/1181669",
33121 acknowledgement = ack-nhfb,
33122 remark = "This is the author's thesis.",
33123 }
33124
33125 @TechReport{Greiner:1985:LUA,
33126 author = "Russell Greiner",
33127 title = "Learning by Understanding Analogies",
33128 type = "Technical Report",
33129 number = "STAN-CS-85-1071",
33130 institution = inst-STAN-CS,
33131 address = inst-STAN-CS:adr,
33132 pages = "423",
33133 month = sep,
33134 year = "1985",
33135 bibdate = "Wed Nov 26 12:13:45 MST 2025",
33136 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
33137 URL = "",
33138 acknowledgement = ack-nhfb,
33139 remark = "This is the author's thesis.",
33140 }
33141
33142 @TechReport{Mayr:1985:PPS,
33143 author = "Ernst W. Mayr and Richard J. Anderson and Peter H.
33144 Hochschild",
33145 title = "A Programming and Problem-Solving Seminar",
33146 type = "Technical Report",
33147 number = "STAN-CS-85-1072",
33148 institution = inst-STAN-CS,
33149 address = inst-STAN-CS:adr,
33150 pages = "68",
33151 month = oct,
33152 year = "1985",
33153 bibdate = "Thu Nov 20 12:11:36 MST 2025",
33154 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
33155 URL = "http://www-db.stanford.edu/TR/CS-TR-85-1072.html",
33156 abstract = "This report contains edited transcripts of the
33157 discussions held in Stanford's course CS204, Problem
33158 Seminar, during winter quarter 1984. The course topics
33159 consisted of five problems coming from different areas
33160 of computer science. The problems were discussed in
33161 class and solved and programmed by the students working
33162 in teams.",
33163 acknowledgement = ack-nhfb,
33164 xxnumber = "CS-TR-85-1072",
33165 }
33166
33167 @TechReport{Hochschild:1985:REP,
33168 author = "Peter H. Hochschild",
33169 title = "Resource-Efficient Parallel Algorithms",
33170 type = "Technical Report",
33171 number = "STAN-CS-85-1073",
33172 institution = inst-STAN-CS,
33173 address = inst-STAN-CS:adr,
33174 pages = "90",
33175 month = sep,
33176 year = "1985",
33177 bibdate = "Wed Nov 26 12:13:45 MST 2025",
33178 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
33179 URL = "",
33180 acknowledgement = ack-nhfb,
33181 remark = "This is the author's thesis.",
33182 }
33183
33184 @TechReport{Southall:1985:DNT,
33185 author = "Richard Southall",
33186 title = "Designing New Typefaces with {Metafont}",
33187 type = "Technical Report",
33188 number = "STAN-CS-85-1074",
33189 institution = inst-STAN-CS,
33190 address = inst-STAN-CS:adr,
33191 pages = "ii + 37",
33192 month = sep,
33193 year = "1985",
33194 bibdate = "Thu Nov 20 12:11:36 MST 2025",
33195 bibsource = "https://www.math.utah.edu/pub/tex/bib/font.bib;
33196 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
33197 URL = "http://i.stanford.edu/pub/cstr/reports/cs/tr/85/1074/CS-TR-85-1074.pdf;
33198 http://www-db.stanford.edu/TR/CS-TR-85-1074.html",
33199 abstract = "The report discusses issues associated with the
33200 symbolic design of new typefaces using programming
33201 languages such as Metafont. A consistent terminology
33202 for the subject area is presented. A schema for type
33203 production systems is described that lays stress on the
33204 importance of communication between the designer of a
33205 new typeface and the producer of the fonts that embody
33206 it. The methods used for the design of printers' type
33207 from the sixteenth century to the present day are
33208 surveyed in the context of this schema. The differences
33209 in the designer's task in symbolic and graphic design
33210 modes are discussed. A new typeface design made with
33211 Metafont is presented, and the usefulness of Metafont
33212 as a tool for making new designs considered.",
33213 acknowledgement = ack-nhfb,
33214 xxnumber = "CS-TR-85-1074",
33215 }
33216
33217 @TechReport{Buchanan:1985:ESWa,
33218 author = "Bruce G. Buchanan",
33219 title = "Expert systems: Working Systems and the Research
33220 Literature",
33221 type = "Technical Report",
33222 number = "STAN-CS-85-1075",
33223 institution = inst-STAN-CS,
33224 address = inst-STAN-CS:adr,
33225 pages = "26",
33226 month = oct,
33227 year = "1985",
33228 bibdate = "Thu Nov 20 12:11:36 MST 2025",
33229 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
33230 URL = "http://www-db.stanford.edu/TR/CS-TR-85-1075.html",
33231 abstract = "Expert systems are the subject of considerable
33232 interest among persons in AI research or applications.
33233 There is no single definition of an expert system, and
33234 thus no precisely defined set of programs or set of
33235 literature references that represent work on expert
33236 systems. This report provides (a) a characterization of
33237 what an expert systems is, (b) a list of expert systems
33238 in routine use or field testing, and (c) a list of
33239 relevant references in the AI research literature.",
33240 acknowledgement = ack-nhfb,
33241 xxnumber = "CS-TR-85-1075",
33242 }
33243
33244 @TechReport{Buchanan:1985:SAK,
33245 author = "Bruce G. Buchanan",
33246 title = "Some Approaches to Knowledge Acquisition",
33247 type = "Technical Report",
33248 number = "STAN-CS-85-1076",
33249 institution = inst-STAN-CS,
33250 address = inst-STAN-CS:adr,
33251 pages = "25",
33252 month = jul,
33253 year = "1985",
33254 bibdate = "Thu Nov 20 12:11:36 MST 2025",
33255 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
33256 note = "This paper is superseded by STAN-CS-86-1094
33257 \cite{Buchanan:1985:ESWb}.",
33258 URL = "http://www-db.stanford.edu/TR/CS-TR-85-1076.html",
33259 abstract = "Knowledge acquisition is not a single, monolithic
33260 problem for AI. There are many ways to approach the
33261 topic in order to understand issues and design useful
33262 tools for constructing knowledge-based systems. Several
33263 of those approaches are being explored in the Knowledge
33264 Systems Laboratory (KSL) at Stanford.",
33265 acknowledgement = ack-nhfb,
33266 xxnumber = "CS-TR-85-1076",
33267 }
33268
33269 @TechReport{McCarthy:1985:ACF,
33270 author = "John McCarthy",
33271 title = "Applications of Circumscription to Formalizing Common
33272 Sense Knowledge",
33273 type = "Technical Report",
33274 number = "STAN-CS-85-1077",
33275 institution = inst-STAN-CS,
33276 address = inst-STAN-CS:adr,
33277 pages = "29",
33278 month = sep,
33279 year = "1985",
33280 bibdate = "Wed Nov 26 12:13:45 MST 2025",
33281 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
33282 URL = "",
33283 acknowledgement = ack-nhfb,
33284 author-dates = "John McCarthy (4 September 1927--24 October 2011)",
33285 }
33286
33287 @TechReport{Helmbold:1985:TPS,
33288 author = "David Helmbold and Ernst Mayr",
33289 title = "Two-Processor Scheduling is in {NC}",
33290 type = "Technical Report",
33291 number = "STAN-CS-85-1079",
33292 institution = inst-STAN-CS,
33293 address = inst-STAN-CS:adr,
33294 pages = "18",
33295 month = oct,
33296 year = "1985",
33297 bibdate = "Thu Nov 20 12:11:36 MST 2025",
33298 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
33299 URL = "http://www-db.stanford.edu/TR/CS-TR-85-1079.html",
33300 abstract = "We present a parallel algorithm for the two processor
33301 scheduling problem. This algorithm constructs an
33302 optimal schedule for unit execution time task systems
33303 with arbitrary precedence constraints using a
33304 polynomial number of processors and running in time
33305 polylog in the size of the input. Whereas previous
33306 parallel solutions for the problem made extensive use
33307 of randomization, our algorithm is completely
33308 deterministic and based on an interesting decomposition
33309 technique. And it is of independent relevance for two
33310 more reasons. It provides another example for the
33311 apparent difference in complexity between decision and
33312 search problems in the context of fast parallel
33313 computation, and it gives an NC-algorithm for the
33314 matching problem in certain restricted cases.",
33315 acknowledgement = ack-nhfb,
33316 xxnumber = "CS-TR-85-1079",
33317 }
33318
33319 @TechReport{Russell:1985:CGM,
33320 author = "Stuart Russell",
33321 title = "The Compleat Guide to {MRS}",
33322 type = "Technical Report",
33323 number = "STAN-CS-85-1080",
33324 institution = inst-STAN-CS,
33325 address = inst-STAN-CS:adr,
33326 pages = "126",
33327 month = jun,
33328 year = "1985",
33329 bibdate = "Thu Nov 20 12:11:36 MST 2025",
33330 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
33331 URL = "http://www-db.stanford.edu/TR/CS-TR-85-1080.html",
33332 abstract = "MRS is a logic programming system with extensive
33333 meta-level facilities. As such it can be used to
33334 implement virtually all kinds of artificial
33335 intelligence applications in a wide variety of
33336 architectures. This guide is intended to be a
33337 comprehensive text and reference for MRS. It also
33338 attempts to explain the foundations of the logic
33339 programming approach from the ground up, and it is
33340 hoped that it will thus provide access, even for the
33341 uninitiated, to all the benefits of AI methods. The
33342 only prerequisites for understanding MRS are a passing
33343 acquaintance with LISP and an open mind.",
33344 acknowledgement = ack-nhfb,
33345 xxnumber = "CS-TR-85-1080",
33346 }
33347
33348 @TechReport{Rosenschein:1985:RIC,
33349 author = "Jeffrey Solomon Rosenschein",
33350 title = "Rational Interaction: Cooperation among Intelligent
33351 Agents",
33352 type = "Technical Report",
33353 number = "STAN-CS-85-1081",
33354 institution = inst-STAN-CS,
33355 address = inst-STAN-CS:adr,
33356 pages = "133",
33357 month = oct,
33358 year = "1985",
33359 bibdate = "Wed Nov 26 12:13:45 MST 2025",
33360 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
33361 URL = "",
33362 acknowledgement = ack-nhfb,
33363 remark = "This is the author's thesis.",
33364 }
33365
33366 @TechReport{Nowicki:1985:PFD,
33367 author = "William I. Nowicki",
33368 title = "Partitioning of Function in a Distributed Graphics
33369 System",
33370 type = "Technical Report",
33371 number = "STAN-CS-85-1082 (CSL-85-282, AD-A16634)",
33372 institution = inst-STAN-CS,
33373 address = inst-STAN-CS:adr,
33374 pages = "vii + 136",
33375 month = mar,
33376 year = "1985",
33377 bibdate = "Wed Nov 26 12:13:45 MST 2025",
33378 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
33379 URL = "https://apps.dtic.mil/sti/tr/pdf/ADA166935.pdf",
33380 abstract = "Although recent advances in graphics workstations
33381 promise much computing power for the future needs of
33382 researchers, traditional approaches to software
33383 organization waste much of this power. Most systems
33384 treat the workstation as either a fixed-function
33385 terminal or a self-contained personal computer; these
33386 roles have limitations that can be overcome by
33387 considering the workstation a multi-function component
33388 of a distributed system. Traditional standard graphics
33389 packages and object-oriented window systems offer
33390 important functionality, but a third approach, virtual
33391 terminal management systems, is more appropriate for a
33392 distributed operating system.\par
33393
33394 The Stanford Distributed Systems Group has implemented
33395 such a distributed system for graphics workstations.
33396 organized as a collection of servers providing services
33397 to {\em clients}. Major issues are how to partition
33398 functions between the server and its clients, and
33399 physically partition the server. In particular, the
33400 service that displays graphical objects is called the
33401 Virtual Graphics Terminal Service (VGTS). The VGTS
33402 architecture is described, as well as a prototype
33403 implementation.\par
33404
33405 This thesis discusses the trade-offs involved in
33406 partitioning of function in a distributed graphics
33407 system. Performance is one important property traded
33408 for advanced functionality or decreased cost. To
33409 provide adequate performance in a distributed system.
33410 communication costs should be kept low. as well as the
33411 frequency of the communication. By providing modeling
33412 as well as viewing facilities, the VGTS reduces the
33413 communication required between applications and the
33414 service.\par
33415
33416 Measurements verify that performance is insensitive to
33417 network bandwidth, but depends heavily on CPU speed and
33418 protocol characteristics. Using structure provides
33419 important speed improvements in some cases, but other
33420 basic factors such as inner loop optimization and
33421 proper batching of requests make even larger
33422 differences.\par
33423
33424 Finally. conclusions are drawn regarding the
33425 partitioning approaches taken in the VGTS. The VGTS is
33426 suitable for a large class of applications that perform
33427 graphics as an aid to user interface, and is portable
33428 to a wide range of powerful workstations. Moreover, the
33429 VGTS can be used as a basis for further research on
33430 many open questions in distributed systems",
33431 acknowledgement = ack-nhfb,
33432 pdfpages = "152",
33433 remark = "This is the author's thesis. The PDF file is OCR'ed
33434 scans of microfiche page images.",
33435 }
33436
33437 @TechReport{Zwaenepoel:1985:MPL,
33438 author = "Willy Zwaenepoel",
33439 title = "Message Passing on a Local Network",
33440 type = "Technical Report",
33441 number = "STAN-CS-85-1083",
33442 institution = inst-STAN-CS,
33443 address = inst-STAN-CS:adr,
33444 pages = "112",
33445 month = oct,
33446 year = "1985",
33447 bibdate = "Wed Nov 26 12:13:45 MST 2025",
33448 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
33449 URL = "",
33450 acknowledgement = ack-nhfb,
33451 remark = "This is the author's thesis.",
33452 }
33453
33454 @TechReport{Edighoffer:1985:TDB,
33455 author = "Judy L. Edighoffer and Keith A. Lantz",
33456 title = "{Taliesin}: a Distributed Bulletin Board System",
33457 type = "Technical Report",
33458 number = "STAN-CS-85-1084",
33459 institution = inst-STAN-CS,
33460 address = inst-STAN-CS:adr,
33461 pages = "11",
33462 month = sep,
33463 year = "1985",
33464 bibdate = "Thu Nov 20 12:11:36 MST 2025",
33465 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
33466 URL = "http://www-db.stanford.edu/TR/CS-TR-85-1084.html",
33467 abstract = "This paper describes a computer bulletin board
33468 facility intended to support replicated bulletin boards
33469 on a network that may frequently be in a state of
33470 partition. The two major design issues covered are the
33471 choice of a name space and the choice of replication
33472 algorithms. The impact of the name space on
33473 communication costs is explained. A special purpose
33474 replication algorithm that provides high availability
33475 and response despite network partition is introduced.",
33476 acknowledgement = ack-nhfb,
33477 xxnumber = "CS-TR-85-1084",
33478 }
33479
33480 @TechReport{Lantz:1985:TUD,
33481 author = "Keith A. Lantz and Judy L. Edighoffer and Bruce L.
33482 Hitson",
33483 title = "Towards a Universal Directory Service",
33484 type = "Technical Report",
33485 number = "STAN-CS-85-1086",
33486 institution = inst-STAN-CS,
33487 address = inst-STAN-CS:adr,
33488 pages = "19",
33489 month = aug,
33490 year = "1985",
33491 bibdate = "Thu Nov 20 12:11:36 MST 2025",
33492 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
33493 URL = "http://www-db.stanford.edu/TR/CS-TR-85-1086.html",
33494 abstract = "Directory services and name servers have been
33495 discussed and implemented for a number of distributed
33496 systems. Most have been tightly interwoven with the
33497 particular distributed systems of which they are a
33498 part; a few are more general in nature. In this paper
33499 we survey recent work in this area and discuss the
33500 advantages and disadvantages of a number of approaches.
33501 From this, we are able to extract some fundamental
33502 requirements of a naming system capable of handling a
33503 wide variety of object types in a heterogeneous
33504 environment. We outline how these requirements can be
33505 met in a universal directory service.",
33506 acknowledgement = ack-nhfb,
33507 xxnumber = "CS-TR-85-1086",
33508 }
33509
33510 @TechReport{Theimer:1985:PRE,
33511 author = "Marvin M. Theimer and Keith A. Lantz and David R.
33512 Cheriton",
33513 title = "Preemptable remote execution facilities for the
33514 {V}-system",
33515 type = "Technical Report",
33516 number = "STAN-CS-85-1087",
33517 institution = inst-STAN-CS,
33518 address = inst-STAN-CS:adr,
33519 pages = "15",
33520 month = sep,
33521 year = "1985",
33522 bibdate = "Thu Nov 20 12:11:36 MST 2025",
33523 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
33524 URL = "http://www-db.stanford.edu/TR/CS-TR-85-1087.html",
33525 abstract = "A remote execution facility allows a user of a
33526 workstation-based distributed system to offload
33527 programs onto idle workstations, thereby providing the
33528 user with access to computational resources beyond that
33529 provided by his personal workstation. In this paper, we
33530 describe the design and performance of the remote
33531 execution facility in the V distributed system, as well
33532 as several implementation issues of interest. In
33533 particular, we focus on network transparency of the
33534 execution environment, preemption and migration of
33535 remotely executed programs, and avoidance of residual
33536 dependencies on the original host. We argue that
33537 preemptable remote execution allows idle workstations
33538 to be used as a ``pool of processors'' without
33539 interfering with use by their owners and without
33540 significant overhead for the normal execution of
33541 programs. In general, we conclude that the cost of
33542 providing preemption is modest compared to providing a
33543 similar amount of computation service by dedicated
33544 ``computation engines''.",
33545 acknowledgement = ack-nhfb,
33546 xxnumber = "CS-TR-85-1087",
33547 }
33548
33549 @TechReport{VanGelder:1985:MPF,
33550 author = "Allen {Van Gelder}",
33551 title = "A Message Passing Framework for Logical Query
33552 Evaluation",
33553 type = "Technical Report",
33554 number = "STAN-CS-85-1088",
33555 institution = inst-STAN-CS,
33556 address = inst-STAN-CS:adr,
33557 pages = "18",
33558 month = dec,
33559 year = "1985",
33560 bibdate = "Wed Nov 26 12:13:45 MST 2025",
33561 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
33562 URL = "",
33563 acknowledgement = ack-nhfb,
33564 }
33565
33566 @TechReport{Ullman:1985:PCL,
33567 author = "Jeffrey D. Ullman and Allen {Van Gelder}",
33568 title = "Parallel Complexity of Logical Query Programs",
33569 type = "Technical Report",
33570 number = "STAN-CS-85-1089",
33571 institution = inst-STAN-CS,
33572 address = inst-STAN-CS:adr,
33573 pages = "42",
33574 month = dec,
33575 year = "1985",
33576 bibdate = "Wed Nov 26 12:13:45 MST 2025",
33577 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
33578 URL = "",
33579 acknowledgement = ack-nhfb,
33580 }
33581
33582 @TechReport{Yue:1985:CAS,
33583 author = "Kaizhi Yue",
33584 title = "Constructing and Analyzing Specifications of Real
33585 World Systems",
33586 type = "Technical Report",
33587 number = "STAN-CS-86-1090",
33588 institution = inst-STAN-CS,
33589 address = inst-STAN-CS:adr,
33590 pages = "290",
33591 month = sep,
33592 year = "1985",
33593 bibdate = "Wed Nov 26 12:13:45 MST 2025",
33594 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
33595 URL = "",
33596 acknowledgement = ack-nhfb,
33597 remark = "This is the author's thesis.",
33598 }
33599
33600 @TechReport{Fu:1985:LOL,
33601 author = "Li-Min Fu",
33602 title = "Learning Object-Level and Meta-Level Knowledge in
33603 Expert Systems",
33604 type = "Technical Report",
33605 number = "STAN-CS-86-1091",
33606 institution = inst-STAN-CS,
33607 address = inst-STAN-CS:adr,
33608 pages = "229",
33609 month = nov,
33610 year = "1985",
33611 bibdate = "Wed Nov 26 12:13:45 MST 2025",
33612 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
33613 URL = "",
33614 acknowledgement = ack-nhfb,
33615 remark = "This is the author's thesis.",
33616 }
33617
33618 @TechReport{Anderson:1985:CPA,
33619 author = "Richard Anderson",
33620 title = "The Complexity of Parallel Algorithms",
33621 type = "Technical Report",
33622 number = "STAN-CS-86-1092",
33623 institution = inst-STAN-CS,
33624 address = inst-STAN-CS:adr,
33625 pages = "72",
33626 month = nov,
33627 year = "1985",
33628 bibdate = "Wed Nov 26 12:13:45 MST 2025",
33629 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
33630 URL = "",
33631 acknowledgement = ack-nhfb,
33632 remark = "This is the author's thesis.",
33633 }
33634
33635 @TechReport{Subramanian:1985:GRL,
33636 author = "Devika Subramanian and Bruce G. Buchanan",
33637 title = "A General Reading List for Artificial Intelligence",
33638 type = "Technical Report",
33639 number = "STAN-CS-86-1093",
33640 institution = inst-STAN-CS,
33641 address = inst-STAN-CS:adr,
33642 pages = "66",
33643 month = dec,
33644 year = "1985",
33645 bibdate = "Thu Nov 20 12:11:36 MST 2025",
33646 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
33647 URL = "http://www-db.stanford.edu/TR/CS-TR-86-1093.html",
33648 abstract = "This reading list is based on the syllabus for the
33649 course CS229b offered in Winter 1985. This course was
33650 an intensive 10 week survey intended as preparation for
33651 the 1984-85 qualifying examination in Artificial
33652 Intelligence at Stanford University.",
33653 acknowledgement = ack-nhfb,
33654 xxnumber = "CS-TR-86-1093",
33655 }
33656
33657 @TechReport{Buchanan:1985:ESWb,
33658 author = "Bruce G. Buchanan",
33659 title = "Expert Systems: Working Systems and the Research
33660 Literature",
33661 type = "Technical Report",
33662 number = "STAN-CS-86-1094",
33663 institution = inst-STAN-CS,
33664 address = inst-STAN-CS:adr,
33665 pages = "57",
33666 month = dec,
33667 year = "1985",
33668 bibdate = "Thu Nov 20 12:11:36 MST 2025",
33669 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
33670 URL = "http://www-db.stanford.edu/TR/CS-TR-86-1094.html",
33671 abstract = "Many expert systems have moved out of development
33672 laboratories into field test and routine use. About
33673 sixty such systems are listed. Academic research
33674 laboratories are contributing manpower to fuel the
33675 commercial development of AI. But the quantity of AI
33676 research may decline as a result unless the applied
33677 systems are experimented with and analyzed.",
33678 acknowledgement = ack-nhfb,
33679 xxnumber = "CS-TR-86-1094",
33680 }
33681
33682 @TechReport{Malik:1985:ILD,
33683 author = "Jitendra Malik",
33684 title = "Interpreting Line Drawings of Curved Objects",
33685 type = "Technical Report",
33686 number = "STAN-CS-86-1099",
33687 institution = inst-STAN-CS,
33688 address = inst-STAN-CS:adr,
33689 pages = "138",
33690 month = dec,
33691 year = "1985",
33692 bibdate = "Wed Nov 26 12:13:45 MST 2025",
33693 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
33694 URL = "",
33695 acknowledgement = ack-nhfb,
33696 remark = "This is the author's thesis.",
33697 }
33698
33699 @TechReport{Malachi:1985:TNA,
33700 author = "Yonathan Malachi and Zohar Manna and Richard
33701 Waldinger",
33702 title = "{Tablog} --- a New Approach to Logic Programming",
33703 type = "Technical Report",
33704 number = "STAN-CS-86-1110",
33705 institution = inst-STAN-CS,
33706 address = inst-STAN-CS:adr,
33707 pages = "22",
33708 month = mar,
33709 year = "1985",
33710 bibdate = "Wed Nov 26 12:13:45 MST 2025",
33711 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
33712 URL = "",
33713 acknowledgement = ack-nhfb,
33714 }
33715
33716 @TechReport{Fu:1985:IKA,
33717 author = "Li-Min Fu and Bruce G. Buchanan",
33718 title = "Inductive knowledge acquisition for rule-based expert
33719 systems",
33720 type = "Technical Report",
33721 number = "STAN-CS-86-1116 (KSL-85-42)",
33722 institution = inst-STAN-CS,
33723 address = inst-STAN-CS:adr,
33724 pages = "36",
33725 month = oct,
33726 year = "1985",
33727 bibdate = "Thu Nov 20 12:11:36 MST 2025",
33728 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
33729 URL = "http://www-db.stanford.edu/TR/CS-TR-86-1116.html",
33730 abstract = "The RL program was developed to construct knowledge
33731 bases automatically in rule-based expert systems,
33732 primarily in MYCIN-like evidence-gathering systems
33733 where there is uncertainty about data as well as the
33734 strength of inference, and where rules are chained
33735 together or combined to infer complex hypotheses. This
33736 program comprises three subprograms: (1) a program that
33737 learns confirming rules, which employs a heuristic
33738 search commencing with the most general hypothesis; (2)
33739 a subprogram that learns rules containing intermediate
33740 concepts, which exploits the old partial knowledge or
33741 defines new intermediate concepts, based on heuristics;
33742 (3) a program that learns disconfirming rules, which is
33743 based on the expert's heuristics to formulate
33744 disconfirming rules. RL's validity has been
33745 demonstrated with a performance program that diagnoses
33746 the causes of jaundice.",
33747 acknowledgement = ack-nhfb,
33748 xxnumber = "CS-TR-86-1116",
33749 }
33750
33751 @TechReport{Lantz:1985:ESD,
33752 author = "Keith A. Lantz and William I. Nowicki and Marvin M.
33753 Theimer",
33754 title = "An Empirical Study of Distributed Application
33755 Performance",
33756 type = "Technical Report",
33757 number = "STAN-CS-86-1117 (CSL-85-287, AD-A221759)",
33758 institution = inst-STAN-CS,
33759 address = inst-STAN-CS:adr,
33760 pages = "iv + 20",
33761 month = oct,
33762 year = "1985",
33763 bibdate = "Thu Nov 20 12:11:36 MST 2025",
33764 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
33765 URL = "http://www-db.stanford.edu/TR/CS-TR-86-1117.html",
33766 abstract = "A major reason for the rarity of distributed
33767 applications, despite the proliferation of networks, is
33768 the sensitivity of their performance to various aspects
33769 of the network environment. We demonstrate that
33770 distributed applications can run faster than local
33771 ones, using common hardware. We also show that the
33772 primary factors affecting performance are, in
33773 approximate order of importance: speed of the user's
33774 workstation, speed of the remote host (if any), and the
33775 high-level (above the transport level) protocols used.
33776 In particular, the use of batching pipelining, and
33777 structure in high-level protocols reduces the
33778 degradation often experienced between different
33779 bandwidth networks. Less significant, but still
33780 noticeable improvements result from proper design and
33781 implementation of underlying transport protocols.
33782 Ultimately, with proper application of these
33783 techniques, network bandwidth is rendered virtually
33784 insignificant.",
33785 acknowledgement = ack-nhfb,
33786 pdfpages = "24",
33787 xxnumber = "CS-TR-86-1117",
33788 }
33789
33790 @TechReport{Clancey:1985:RCK,
33791 author = "William J. Clancey and Conrad Bock",
33792 title = "Representing Control Knowledge as Abstract Task and
33793 Metarules",
33794 type = "Technical Report",
33795 number = "STAN-CS-87-1168 (KSL-85-16, AD-A187021)",
33796 institution = inst-STAN-CS,
33797 address = inst-STAN-CS:adr,
33798 pages = "iii + 56",
33799 month = apr,
33800 year = "1985",
33801 bibdate = "Thu Nov 20 12:11:36 MST 2025",
33802 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
33803 URL = "http://www-db.stanford.edu/TR/CS-TR-87-1168.html;
33804 https://apps.dtic.mil/sti/tr/pdf/ADA187021.pdf",
33805 abstract = "A poorly designed knowledge base can be as cryptic as
33806 an arbitrary program and just as difficult to maintain.
33807 Representing inference procedures abstractly,
33808 separately from domain facts and relations, makes the
33809 design more transparent and explainable. The
33810 combination of abstract procedures and a relational
33811 language for organizing domain knowledge provides a
33812 generic framework for constructing knowledge bases for
33813 related problems in other domains and also provides a
33814 useful starting point for studying the nature of
33815 strategies. In HERACLES, inference procedures are
33816 represented as abstract metarules, expressed in a form
33817 of the predicate calculus, organized and controlled as
33818 rule sets. A compiler converts the rules into Lisp code
33819 and allows domain relations to be encoded as arbitrary
33820 data structures for efficiency. Examples are given of
33821 the explanation and teaching capabilities afforded by
33822 this representation. Different perspectives for
33823 understanding HERACLES' inference procedure and how it
33824 defines knowledge bases are discussed in some detail.",
33825 acknowledgement = ack-nhfb,
33826 pdfpages = "74",
33827 remark = "No PDF in NTRL archive. Found in DTIC archive.",
33828 xxnumber = "CS-TR-87-1168",
33829 }
33830
33831 @TechReport{Berg:1986:BCS,
33832 author = "Kathryn A. Berg and Taleen Marashian",
33833 title = "Bibliography of {Computer Science} reports,
33834 1963--1986",
33835 type = "Technical Report",
33836 number = "STAN-CS-86-1085",
33837 institution = inst-STAN-CS,
33838 address = inst-STAN-CS:adr,
33839 pages = "iv + 71",
33840 month = jun,
33841 year = "1986",
33842 bibdate = "Thu Nov 20 12:11:36 MST 2025",
33843 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
33844 URL = "http://www-db.stanford.edu/TR/CS-TR-86-1085.html",
33845 abstract = "This report lists, in chronological order, all reports
33846 published by the Stanford Computer Science Department
33847 since 1963. Each report is identified by a Computer
33848 Science number, author's name, title, National
33849 Technical Information Service (NTIS) retrieval number
33850 (i.e., AD-XXXXXX), date, and number of pages.",
33851 acknowledgement = ack-nhfb,
33852 pdfpages = "76",
33853 xxnumber = "CS-TR-86-1085",
33854 }
33855
33856 @TechReport{Knuth:1986:TTM,
33857 author = "Donald E. Knuth",
33858 title = "A Torture Test for {\METAFONT}",
33859 type = "Technical Report",
33860 number = "STAN-CS-86-1095",
33861 institution = inst-STAN-CS,
33862 address = inst-STAN-CS:adr,
33863 pages = "79",
33864 day = "1",
33865 month = jan,
33866 year = "1986",
33867 bibdate = "Fri Apr 18 05:25:51 2003",
33868 bibsource = "https://www.math.utah.edu/pub/tex/bib/font.bib;
33869 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
33870 URL = "http://www-db.stanford.edu/TR/CS-TR-86-1095.html;
33871 http://www.ncstrl.org:8900/ncstrl/servlet/search?formname=detail&id=oai%3Ancstrlh%3Astan%3ASTAN%2F%2FCS-TR-86-1095",
33872 abstract = "Programs that claim to be implementations of
33873 METAFONT84 are supposed to be able to process the test
33874 routine contained in this report, producing the outputs
33875 contained in this report.",
33876 acknowledgement = ack-nhfb # "\slash " # ack-hk,
33877 documentid = "oai:ncstrlh:stan:STAN//CS-TR-86-1095",
33878 xxnumber = "CS-TR-86-1095",
33879 }
33880
33881 @TechReport{Wilkins:1986:MTA,
33882 author = "Marianne Winslett Wilkins",
33883 title = "A model-theoretic approach to updating logical
33884 databases",
33885 type = "Technical Report",
33886 number = "STAN-CS-86-1096",
33887 institution = inst-STAN-CS,
33888 address = inst-STAN-CS:adr,
33889 pages = "23",
33890 month = jan,
33891 year = "1986",
33892 bibdate = "Thu Nov 20 12:11:36 MST 2025",
33893 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
33894 URL = "http://www-db.stanford.edu/TR/CS-TR-86-1096.html",
33895 abstract = "We show that it is natural to extend the concept of
33896 database updates to encompass databases with incomplete
33897 information. Our approach embeds the incomplete
33898 database and the updates in the language of first-order
33899 logic, which we believe has strong advantages over
33900 relational tables and traditional data manipulation
33901 languages in the incomplete information situation. We
33902 present semantics for our update operators, and also
33903 provide an efficient algorithm to perform the
33904 operations.",
33905 acknowledgement = ack-nhfb,
33906 xxnumber = "CS-TR-86-1096",
33907 }
33908
33909 @TechReport{Knuth:1986:T,
33910 author = "Donald E. Knuth",
33911 title = "{{\TeX}ware}",
33912 type = "Technical Report",
33913 number = "STAN-CS-86-1097",
33914 institution = inst-STAN-CS,
33915 address = inst-STAN-CS:adr,
33916 pages = "146",
33917 day = "1",
33918 month = apr,
33919 year = "1986",
33920 bibdate = "Fri Apr 18 05:25:51 2003",
33921 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
33922 URL = "http://www-db.stanford.edu/TR/CS-TR-86-1097.html;
33923 http://www.ncstrl.org:8900/ncstrl/servlet/search?formname=detail&id=oai%3Ancstrlh%3Astan%3ASTAN%2F%2FCS-TR-86-1097",
33924 abstract = "This report documents four TEX utility programs: The
33925 POOLtype processor (Version 2, July 1983), The TFtoPL
33926 processor (Version 2.5, September 1985), The PLtoTF
33927 processor (Version 2.3, August 1985), and The DVItype
33928 processor (Version 2.8, August 1984).",
33929 acknowledgement = ack-nhfb,
33930 documentid = "oai:ncstrlh:stan:STAN//CS-TR-86-1097",
33931 xxnumber = "CS-TR-86-1097",
33932 }
33933
33934 @TechReport{Cheriton:1986:DNF,
33935 author = "David Cheriton and Timothy Mann",
33936 title = "A Decentralized Naming Facility",
33937 type = "Technical Report",
33938 number = "STAN-CS-86-1098",
33939 institution = inst-STAN-CS,
33940 address = inst-STAN-CS:adr,
33941 pages = "26",
33942 month = feb,
33943 year = "1986",
33944 bibdate = "Wed Nov 26 12:13:45 MST 2025",
33945 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
33946 URL = "",
33947 acknowledgement = ack-nhfb,
33948 }
33949
33950 @TechReport{Abadi:1986:MTP,
33951 author = "Martin Abadi and Zohar Manna",
33952 title = "Modal Theorem Proving",
33953 type = "Technical Report",
33954 number = "STAN-CS-86-1100",
33955 institution = inst-STAN-CS,
33956 address = inst-STAN-CS:adr,
33957 pages = "ii + 20",
33958 month = may,
33959 year = "1986",
33960 bibdate = "Thu Nov 20 12:11:36 MST 2025",
33961 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
33962 URL = "http://i.stanford.edu/pub/cstr/reports/cs/tr/86/1100/CS-TR-86-1100.pdf;
33963 http://www-db.stanford.edu/TR/CS-TR-86-1100.html",
33964 abstract = "We describe resolution proof systems for several modal
33965 logics. First we present the propositional versions of
33966 the systems and prove their completeness. The
33967 first-order resolution rule for classical logic is then
33968 modified to handle quantifiers directly. This new
33969 resolution rule enables us to extend our propositional
33970 systems to complete first-order systems. The systems
33971 for the different modal logics are closely related.",
33972 acknowledgement = ack-nhfb,
33973 pdfpages = "22",
33974 xxnumber = "CS-TR-86-1100",
33975 }
33976
33977 @TechReport{Foulser:1986:RSS,
33978 author = "David E. Foulser",
33979 title = "On Random Strings and Sequence Comparisons",
33980 type = "Technical Report",
33981 number = "STAN-CS-86-1101",
33982 institution = inst-STAN-CS,
33983 address = inst-STAN-CS:adr,
33984 pages = "138",
33985 month = feb,
33986 year = "1986",
33987 bibdate = "Wed Nov 26 12:13:45 MST 2025",
33988 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
33989 URL = "",
33990 acknowledgement = ack-nhfb,
33991 remark = "This is the author's thesis.",
33992 }
33993
33994 @TechReport{Naughton:1986:DIR,
33995 author = "Jeffrey F. Naughton",
33996 title = "Data Independent Recursion in Deductive Databases",
33997 type = "Technical Report",
33998 number = "STAN-CS-86-1102",
33999 institution = inst-STAN-CS,
34000 address = inst-STAN-CS:adr,
34001 pages = "34",
34002 month = feb,
34003 year = "1986",
34004 bibdate = "Thu Nov 20 12:11:36 MST 2025",
34005 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
34006 URL = "http://www-db.stanford.edu/TR/CS-TR-86-1102.html",
34007 abstract = "Some recursive definitions in deductive database
34008 systems can be replaced by equivalent nonrecursive
34009 definitions. In this paper we give a linear-time
34010 algorithm that detects many such definitions, and
34011 specify a useful subset of recursive definitions for
34012 which the algorithm is complete. It is unlikely that
34013 our algorithm can be extended significantly, as recent
34014 results by Gaifman [5] and Vardi [19] show that the
34015 general problem is undecidable. We consider two types
34016 of initialization of the recursively defined relation:
34017 arbitrary initialization, and initialization by a given
34018 nonrecursive rule. This extends earlier work by Minker
34019 and Nicolas [10], and by Ioannidis [7], and is related
34020 to bounded tableau results by Sagiv [14]. Even if there
34021 is no equivalent nonrecursive definition, a
34022 modification of our algorithm can be used to optimize a
34023 recursive definition and improve the efficiency of the
34024 compiled evaluation algorithms proposed in Henschen and
34025 Naqvi [6] and in Bancilhon et al. [3].",
34026 acknowledgement = ack-nhfb,
34027 xxnumber = "CS-TR-86-1102",
34028 }
34029
34030 @TechReport{Mogul:1986:RIA,
34031 author = "Jeffrey C. Mogul",
34032 title = "Representing Information about Files",
34033 type = "Technical Report",
34034 number = "STAN-CS-86-1103",
34035 institution = inst-STAN-CS,
34036 address = inst-STAN-CS:adr,
34037 pages = "204",
34038 month = apr,
34039 year = "1986",
34040 bibdate = "Wed Nov 26 12:13:45 MST 2025",
34041 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
34042 URL = "",
34043 acknowledgement = ack-nhfb,
34044 remark = "This is the author's thesis.",
34045 }
34046
34047 @TechReport{Subramanian:1986:CSA,
34048 author = "Devika Subramanian",
34049 title = "{CS229b}: a survey of {AI} classnotes for Winter
34050 84--85",
34051 type = "Technical Report",
34052 number = "STAN-CS-86-1104",
34053 institution = inst-STAN-CS,
34054 address = inst-STAN-CS:adr,
34055 pages = "201",
34056 month = apr,
34057 year = "1986",
34058 bibdate = "Thu Nov 20 12:11:36 MST 2025",
34059 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
34060 URL = "http://www-db.stanford.edu/TR/CS-TR-86-1104.html",
34061 abstract = "These are the compiled classnotes for the course
34062 CS229b offered in Winter 1985. This course was an
34063 intensive 10 week survey intended as preparation for
34064 the 1984-85 qualifying examination in Artificial
34065 Intelligence at Stanford University.",
34066 acknowledgement = ack-nhfb,
34067 xxnumber = "CS-TR-86-1104",
34068 }
34069
34070 @TechReport{Cheriton:1986:SCC,
34071 author = "David R. Cheriton and Gert A. Slavenburg and Patrick
34072 D. Boyle",
34073 title = "Software-Controlled Caches in the {VMP}
34074 Multiprocessor",
34075 type = "Technical Report",
34076 number = "STAN-CS-86-1105",
34077 institution = inst-STAN-CS,
34078 address = inst-STAN-CS:adr,
34079 pages = "12",
34080 month = mar,
34081 year = "1986",
34082 bibdate = "Thu Nov 20 12:11:36 MST 2025",
34083 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
34084 URL = "http://www-db.stanford.edu/TR/CS-TR-86-1105.html",
34085 abstract = "VMP is an experimental multiprocessor that follows the
34086 familiar basic design of multiple processors, each with
34087 a cache, connected by a shared bus to global memory.
34088 Each processor has a synchronous, virtually addressed,
34089 single master connection to its cache, providing very
34090 high memory bandwidth. An unusually large cache page
34091 size and fast sequential memory copy hardware make it
34092 feasible for cache misses to be handled in software,
34093 analogously to the handling of virtual memory page
34094 faults. Hardware support for cache consistency is
34095 limited to a simple state machine that monitors the bus
34096 and interrupts the processor when a cache consistency
34097 action is required. In this paper, we show how the VMP
34098 design provides the high memory bandwidth required by
34099 modern high-performance processors with a minimum of
34100 hardware complexity and cost. We also describe simple
34101 solutions to the consistency problems associated with
34102 virtually addressed caches. Simulation results indicate
34103 that the design achieves good performance providing
34104 data contention is not excessive.",
34105 acknowledgement = ack-nhfb,
34106 pdfpages = "13",
34107 xxnumber = "CS-TR-86-1105",
34108 }
34109
34110 @TechReport{Abadi:1986:TR,
34111 author = "Martin Abadi and Zohar Manna",
34112 title = "A Timely Resolution",
34113 type = "Technical Report",
34114 number = "STAN-CS-86-1106",
34115 institution = inst-STAN-CS,
34116 address = inst-STAN-CS:adr,
34117 pages = "21",
34118 month = apr,
34119 year = "1986",
34120 bibdate = "Thu Nov 20 12:11:36 MST 2025",
34121 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
34122 URL = "http://www-db.stanford.edu/TR/CS-TR-86-1106.html",
34123 abstract = "We present a novel proof system R for First-order
34124 (Linear) Temporal Logic. This system extends our
34125 Propositional Temporal Logic proof system ([AM]). The
34126 system R is based on nonclausal resolution; proofs are
34127 natural and generally short. Special quantifier rules,
34128 unification techniques, and a resolution rule are
34129 introduced. We relate R to other proof systems for
34130 First-order Temporal Logic and discuss completeness
34131 issues. The system R should be useful as a tool for
34132 such tasks as verification of concurrent programs and
34133 reasoning about hardware devices.",
34134 acknowledgement = ack-nhfb,
34135 xxnumber = "CS-TR-86-1106",
34136 }
34137
34138 @TechReport{Smith:1986:CI,
34139 author = "David E. Smith",
34140 title = "Controlling Inference",
34141 type = "Technical Report",
34142 number = "STAN-CS-86-1107",
34143 institution = inst-STAN-CS,
34144 address = inst-STAN-CS:adr,
34145 pages = "199",
34146 month = apr,
34147 year = "1986",
34148 bibdate = "Wed Nov 26 12:13:45 MST 2025",
34149 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
34150 URL = "",
34151 acknowledgement = ack-nhfb,
34152 remark = "This is the author's thesis.",
34153 }
34154
34155 @TechReport{Morris:1986:DON,
34156 author = "Katherine Morris and Jeffrey D. Ullman and Allen {Van
34157 Gelder}",
34158 title = "Design Overview of the {NAIL!} System",
34159 type = "Technical Report",
34160 number = "STAN-CS-86-1108",
34161 institution = inst-STAN-CS,
34162 address = inst-STAN-CS:adr,
34163 pages = "13",
34164 month = may,
34165 year = "1986",
34166 bibdate = "Wed Nov 26 12:13:45 MST 2025",
34167 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
34168 URL = "",
34169 acknowledgement = ack-nhfb,
34170 }
34171
34172 @TechReport{Casley:1986:PEP,
34173 author = "Ross Casley",
34174 title = "A Proof Editor for Propositional Temporal Logic",
34175 type = "Technical Report",
34176 number = "STAN-CS-86-1109",
34177 institution = inst-STAN-CS,
34178 address = inst-STAN-CS:adr,
34179 pages = "26",
34180 month = may,
34181 year = "1986",
34182 bibdate = "Thu Nov 20 12:11:36 MST 2025",
34183 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
34184 URL = "http://www-db.stanford.edu/TR/CS-TR-86-1109.html",
34185 abstract = "This report describes PTL, a program to assist in
34186 constructing proofs in propositional logic extended by
34187 the operators $ \Box $ (''always''), $ \Diamond $
34188 (''eventually'') and $ \bigcirc $ (''at the next
34189 step''). This is called propositional temporal logic
34190 and is one of two systems of logic presented by Abadi
34191 and Manna in [1].",
34192 acknowledgement = ack-nhfb,
34193 xxnumber = "CS-TR-86-1109",
34194 }
34195
34196 @TechReport{Rosenbloom:1986:MEB,
34197 author = "Paul S. Rosenbloom and John E. Laird",
34198 title = "Mapping Explanation-Based Generalization onto {Soar}",
34199 type = "Technical Report",
34200 number = "STAN-CS-86-1111",
34201 institution = inst-STAN-CS,
34202 address = inst-STAN-CS:adr,
34203 pages = "18",
34204 month = jun,
34205 year = "1986",
34206 bibdate = "Wed Nov 26 12:13:45 MST 2025",
34207 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
34208 URL = "",
34209 acknowledgement = ack-nhfb,
34210 keywords = "SOAR (Smalltalk on a RISC)",
34211 }
34212
34213 @TechReport{Demetrescu:1986:SLA,
34214 author = "Stefan G. Demetrescu",
34215 title = "Scan Line Access Memories for High Speed Image
34216 Rasterization",
34217 type = "Technical Report",
34218 number = "STAN-CS-86-1112",
34219 institution = inst-STAN-CS,
34220 address = inst-STAN-CS:adr,
34221 pages = "137",
34222 month = jun,
34223 year = "1986",
34224 bibdate = "Wed Nov 26 12:13:45 MST 2025",
34225 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
34226 URL = "",
34227 acknowledgement = ack-nhfb,
34228 remark = "This is the author's thesis.",
34229 }
34230
34231 @TechReport{Pratt:1986:MCP,
34232 author = "Vaughan Pratt",
34233 title = "Modelling Concurrency with Partial Orders",
34234 type = "Technical Report",
34235 number = "STAN-CS-86-1113",
34236 institution = inst-STAN-CS,
34237 address = inst-STAN-CS:adr,
34238 pages = "33",
34239 month = jun,
34240 year = "1986",
34241 bibdate = "Wed Nov 26 12:13:45 MST 2025",
34242 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
34243 URL = "",
34244 acknowledgement = ack-nhfb,
34245 }
34246
34247 @TechReport{Naughton:1986:OFF,
34248 author = "Jeffrey F. Naughton",
34249 title = "Optimizing Function-Free Recursive Inference Rules",
34250 type = "Technical Report",
34251 number = "STAN-CS-86-1114",
34252 institution = inst-STAN-CS,
34253 address = inst-STAN-CS:adr,
34254 pages = "27",
34255 month = may,
34256 year = "1986",
34257 bibdate = "Thu Nov 20 12:11:36 MST 2025",
34258 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
34259 URL = "http://www-db.stanford.edu/TR/CS-TR-86-1114.html",
34260 abstract = "Recursive inference rules arise in recursive
34261 definitions in logic programming systems and in
34262 database systems with recursive query languages. Let D
34263 be a recursive definition of a relation t. We say that
34264 D is minimal if for any predicate p in a recursive rule
34265 in D, p must appear in a recursive rule in any
34266 definition of t. We show that testing for minimality is
34267 in general undecidable. However, we do present an
34268 efficient algorithm for a useful class of recursive
34269 rules, and show how to use it to transform a recursive
34270 definition to a minimal recursive definition.
34271 Evaluating the optimized definition will avoid
34272 redundant computation without the overhead of caching
34273 intermediate results and run-time checking for
34274 duplicate goals.",
34275 acknowledgement = ack-nhfb,
34276 xxnumber = "CS-TR-86-1114",
34277 }
34278
34279 @TechReport{Buchanan:1986:HRM,
34280 author = "Bruce G. Buchanan and Barbara Hayes-Roth and Olivier
34281 Lichtarge and Russ Altman and James Brinkley and
34282 Michael Hewett and Craig Cornelius and Bruce Duncan and
34283 Oleg Jardetzky",
34284 title = "The heuristic refinement method for deriving solution
34285 structures of proteins",
34286 type = "Technical Report",
34287 number = "STAN-CS-86-1115",
34288 institution = inst-STAN-CS,
34289 address = inst-STAN-CS:adr,
34290 pages = "25",
34291 month = mar,
34292 year = "1986",
34293 bibdate = "Thu Nov 20 12:11:36 MST 2025",
34294 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
34295 URL = "http://www-db.stanford.edu/TR/CS-TR-86-1115.html",
34296 abstract = "A new method is presented for determining structures
34297 of proteins in solution. The method uses constraints
34298 inferred from analytic data to successively refine both
34299 the locations for parts of the structure and the levels
34300 of detail for describing those parts. A computer
34301 program, called PROTEAN, which encodes this method, has
34302 been partially implemented and was used to derive
34303 structures for the lac-repressor headpiece from
34304 experimental data.",
34305 acknowledgement = ack-nhfb,
34306 xxnumber = "CS-TR-86-1115",
34307 }
34308
34309 @TechReport{Helmbold:1986:APS,
34310 author = "David Helmbold and Ernst Mayr",
34311 title = "Applications of Parallel Scheduling to Perfect
34312 Graphs",
34313 type = "Technical Report",
34314 number = "STAN-CS-86-1118",
34315 institution = inst-STAN-CS,
34316 address = inst-STAN-CS:adr,
34317 pages = "20",
34318 month = jun,
34319 year = "1986",
34320 bibdate = "Thu Nov 20 12:11:36 MST 2025",
34321 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
34322 URL = "http://www-db.stanford.edu/TR/CS-TR-86-1118.html",
34323 abstract = "We combine a parallel algorithm for the two processor
34324 scheduling problem, which runs in polylog time on a
34325 polynomial number of processors, with an algorithm to
34326 find transitive orientations of graphs where they
34327 exist. Both algorithms together solve the maximum
34328 clique problem and the minimum coloring problem for
34329 comparability graphs, and the maximum matching problem
34330 for co-comparability graphs. These parallel algorithms
34331 can also be used to identify permutation graphs and
34332 interval graphs, important subclasses of perfect
34333 graphs.",
34334 acknowledgement = ack-nhfb,
34335 xxnumber = "CS-TR-86-1118",
34336 }
34337
34338 @TechReport{Rosenblum:1986:SUS,
34339 author = "David S. Rosenblum and Ernst W. Mayr",
34340 title = "Simulation of an {Ultracomputer} with Several 'Hot
34341 Spots'",
34342 type = "Technical Report",
34343 number = "STAN-CS-86-1119",
34344 institution = inst-STAN-CS,
34345 address = inst-STAN-CS:adr,
34346 pages = "37",
34347 month = jun,
34348 year = "1986",
34349 bibdate = "Thu Nov 20 12:11:36 MST 2025",
34350 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
34351 URL = "http://www-db.stanford.edu/TR/CS-TR-86-1119.html",
34352 abstract = "This report describes the design and results of a
34353 time-driven simulation of an Ultracomputer-like
34354 multiprocessor in the presence of several ``hot
34355 spots,'' or memory modules which are frequent targets
34356 of requests. Such hot spots exist during execution of
34357 parallel programs in which the several threads of
34358 control synchronize through manipulation of a small
34359 number of shared variables. The simulated system is
34360 comprised of N processing elements (PEs) and N shared
34361 memory modules connected by an N x N buffered,
34362 packet-switched Omega network. The simulator was
34363 designed to accept a wide variety of system
34364 configurations to enable observation of many different
34365 characteristics of the system behavior. We present the
34366 results of four experiments: (1) General simulation of
34367 several 16-PE configurations, (2) General simulation of
34368 several 512-PE configurations, (3) Determination of
34369 critical queue lengths as a function of request rate
34370 (512 PEs) and (4) Determination of the effect of hot
34371 spot spacing on system performance (512 PEs).",
34372 acknowledgement = ack-nhfb,
34373 xxnumber = "CS-TR-86-1119",
34374 }
34375
34376 @TechReport{Moses:1986:KDE,
34377 author = "Yoram Moses",
34378 title = "Knowledge in Distributed Environment",
34379 type = "Technical Report",
34380 number = "STAN-CS-86-1120",
34381 institution = inst-STAN-CS,
34382 address = inst-STAN-CS:adr,
34383 pages = "113",
34384 month = mar,
34385 year = "1986",
34386 bibdate = "Wed Nov 26 12:13:45 MST 2025",
34387 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
34388 URL = "",
34389 acknowledgement = ack-nhfb,
34390 remark = "This is the author's thesis.",
34391 }
34392
34393 @TechReport{Feigenbaum:1986:PGS,
34394 author = "Joan Feigenbaum",
34395 title = "Product Graphs: Some Algorithmic and Combinatorial
34396 Results",
34397 type = "Technical Report",
34398 number = "STAN-CS-86-1121",
34399 institution = inst-STAN-CS,
34400 address = inst-STAN-CS:adr,
34401 pages = "69",
34402 month = jun,
34403 year = "1986",
34404 bibdate = "Wed Nov 26 12:13:45 MST 2025",
34405 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
34406 URL = "",
34407 acknowledgement = ack-nhfb,
34408 remark = "This is the author's thesis.",
34409 }
34410
34411 @TechReport{Rennels:1986:CMR,
34412 author = "Glenn D. Rennels",
34413 title = "A Computational Model of Reasoning from the Clinical
34414 Literature",
34415 type = "Technical Report",
34416 number = "STAN-CS-86-1122",
34417 institution = inst-STAN-CS,
34418 address = inst-STAN-CS:adr,
34419 pages = "263",
34420 month = jun,
34421 year = "1986",
34422 bibdate = "Wed Nov 26 12:13:45 MST 2025",
34423 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
34424 URL = "",
34425 acknowledgement = ack-nhfb,
34426 remark = "This is the author's thesis.",
34427 }
34428
34429 @TechReport{Nii:1986:BS,
34430 author = "H. Penny Nii",
34431 title = "Blackboard Systems",
34432 type = "Technical Report",
34433 number = "STAN-CS-86-1123 (KSL-86-18)",
34434 institution = inst-STAN-CS,
34435 address = inst-STAN-CS:adr,
34436 pages = "95",
34437 month = jun,
34438 year = "1986",
34439 bibdate = "Thu Nov 20 12:11:36 MST 2025",
34440 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
34441 URL = "http://www-db.stanford.edu/TR/CS-TR-86-1123.html",
34442 abstract = "The first blackboard system was the HEARSAY-II speech
34443 understanding system that evolved between 1971 and
34444 1976. Subsequently, many systems have been built that
34445 have similar system organizations and run-time
34446 behavior. The objectives of this document are: (1) to
34447 define what is meant by ``blackboard systems,'' and (2)
34448 to show the richness and diversity of blackboard system
34449 designs. The article begins with a discussion of the
34450 underlying concept behind all blackboard systems, the
34451 blackboard model of problem solving. In order to bridge
34452 the gap between a model and working systems, the
34453 blackboard framework, an extension of the basic
34454 blackboard model is introduced, including a detailed
34455 description of the model's components and their
34456 behavior. A model does not come into existence on its
34457 own and is usually an abstraction of many examples. In
34458 section 2, the history of ideas is traced and the
34459 designs of some applications systems that helped shape
34460 the blackboard model are detailed. We then describe and
34461 contrast existing blackboard systems. Blackboard
34462 systems can generally be divided into two categories;
34463 application and skeletal systems. In application
34464 systems the blackboard system components are integrated
34465 with the domain knowledge required to solve the problem
34466 at hand. Skeletal systems are devoid of domain
34467 knowledge, and, as the name implies, consist of the
34468 essential system components from which application
34469 systems can be built by the addition of knowledge and
34470 the specification of control (i.e. meta-knowledge).
34471 Application systems will be discussed in Section 3, and
34472 skeletal systems will be discussed elsewhere. In
34473 Section 3.6, we summarize the features of the
34474 applications systems and in Section 4 present the
34475 author's perspective on the utility of the blackboard
34476 approach to problem solving and knowledge
34477 engineering.",
34478 acknowledgement = ack-nhfb,
34479 remark = "No PDF in NTRL archive.",
34480 xxnumber = "CS-TR-86-1123",
34481 }
34482
34483 @TechReport{Scales:1986:EMA,
34484 author = "Daniel J. Scales",
34485 title = "Efficient Matching Algorithms for the {SOARIOPSS}
34486 Production System",
34487 type = "Technical Report",
34488 number = "STAN-CS-86-1124 (KSL-86-47)",
34489 institution = inst-STAN-CS,
34490 address = inst-STAN-CS:adr,
34491 pages = "59",
34492 month = jun,
34493 year = "1986",
34494 bibdate = "Thu Nov 20 12:11:36 MST 2025",
34495 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
34496 URL = "http://www-db.stanford.edu/TR/CS-TR-86-1124.html",
34497 abstract = "SOAR is a problem-solving and learning program
34498 intended to exhibit intelligent behavior. SOAR uses a
34499 modified form of the OPS5 production system for storage
34500 of and access to long-term knowledge. As with most
34501 programs which use production system systems, the match
34502 phase of SOAR's production system dominates all other
34503 SOAR processing. This paper describes the results of an
34504 investigation of various ways of speeding up the
34505 matching process in SOAR through additions and changes
34506 to the OPS5 matching algorithm.",
34507 acknowledgement = ack-nhfb,
34508 remark = "No PDF in NTRL archive.",
34509 xxnumber = "CS-TR-86-1124",
34510 }
34511
34512 @TechReport{Schoen:1986:CS,
34513 author = "Eric Schoen",
34514 title = "The {CAOS} System",
34515 type = "Technical Report",
34516 number = "STAN-CS-86-1125 (KSL-86-22)",
34517 institution = inst-STAN-CS,
34518 address = inst-STAN-CS:adr,
34519 pages = "75",
34520 month = mar,
34521 year = "1986",
34522 bibdate = "Thu Nov 20 12:11:36 MST 2025",
34523 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
34524 URL = "http://www-db.stanford.edu/TR/CS-TR-86-1125.html",
34525 abstract = "The CAOS system is a framework designed to facilitate
34526 the development of highly concurrent real-time signal
34527 interpretation applications. It explores the potential
34528 of multiprocessor architectures to improve the
34529 performance of expert systems in the domain of signal
34530 interpretation. CAOS is implemented in Lisp on a
34531 (simulated) collection of processor-memory sites,
34532 linked by a high-speed communications subsystem. The
34533 ``virtual machine'' on which it depends provides remote
34534 evaluation and packet-based message exchange between
34535 processes, using virtual circuits known as streams. To
34536 this presentation layer, CAOS adds (1) a flexible
34537 process scheduler, and (2) an object-centered notion of
34538 agents, dynamically-instantiable entities which model
34539 interpreted signal features. This report documents the
34540 principal ideas, programming model, and implementation
34541 of CAOS. A model of real-time signal interpretation,
34542 based on replicated ``abstraction'' pipelines, is
34543 presented. For some applications, this model offers a
34544 means by which large numbers of processors may be
34545 utilized without introducing
34546 synchronization-necessitated software bottlenecks. The
34547 report concludes with a description of the performance
34548 of a large CAOS application over various sizes of
34549 multiprocessor configurations. Lessons about problem
34550 decomposition grain size, global problem solving
34551 control strategy, and appropriate service provided to
34552 CAOS by the underlying architecture are discussed.",
34553 acknowledgement = ack-nhfb,
34554 remark = "No PDF in NTRL archive.",
34555 xxnumber = "CS-TR-86-1125",
34556 }
34557
34558 @TechReport{Davies:1986:CVD,
34559 author = "Byron Davies",
34560 title = "{CAREL}: a Visible Distributed {Lisp}",
34561 type = "Technical Report",
34562 number = "STAN-CS-86-1126 (KSL-86-14)",
34563 institution = inst-STAN-CS,
34564 address = inst-STAN-CS:adr,
34565 pages = "23",
34566 month = mar,
34567 year = "1986",
34568 bibdate = "Thu Nov 20 12:11:36 MST 2025",
34569 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
34570 URL = "http://www-db.stanford.edu/TR/CS-TR-86-1126.html",
34571 abstract = "CAREL is a Lisp implementation designed to be a
34572 high-level interactive systems programming language for
34573 a distributed-memory multiprocessor. CAREL insulates
34574 the user from the machine language of the
34575 multiprocessor architecture, but still makes it
34576 possible for the user to specify explicitly the
34577 assignment of tasks to processors in the multiprocessor
34578 network. CAREL has been implemented to run on a TI
34579 Explorer Lisp machine using Stanford's CARE
34580 multiprocessor simulator. CAREL is more than a
34581 language: real-time graphical displays provided by the
34582 CARE simulator make CAREL a novel graphical programming
34583 environment for distributed computing. CAREL enables
34584 the user to create programs interactively and then
34585 watch them run on a network of simulated processors. As
34586 a CAREL program executes, the CARE simulator
34587 graphically displays the activity of the processors and
34588 the transmission of data through the network. Using
34589 this capability, CAREL has demonstrated its utility as
34590 an educational tool for multiprocessor computing.",
34591 acknowledgement = ack-nhfb,
34592 remark = "No PDF in NTRL archive.",
34593 xxnumber = "CS-TR-86-1126",
34594 }
34595
34596 @TechReport{Malachi:1986:NLP,
34597 author = "Yonathan Malachi",
34598 title = "Nonclausal Logic Programming",
34599 type = "Technical Report",
34600 number = "STAN-CS-86-1127",
34601 institution = inst-STAN-CS,
34602 address = inst-STAN-CS:adr,
34603 pages = "167",
34604 month = mar,
34605 year = "1986",
34606 bibdate = "Wed Nov 26 12:13:45 MST 2025",
34607 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
34608 URL = "",
34609 acknowledgement = ack-nhfb,
34610 remark = "This is the author's thesis.",
34611 }
34612
34613 @TechReport{Theimer:1986:PRE,
34614 author = "Marvin M. Theimer",
34615 title = "Preemptable Remote Execution Facilities for
34616 Loosely-Coupled Distributed Systems",
34617 type = "Technical Report",
34618 number = "STAN-CS-86-1128 (CSL-86-302)",
34619 institution = inst-STAN-CS,
34620 address = inst-STAN-CS:adr,
34621 pages = "139",
34622 month = jun,
34623 year = "1986",
34624 bibdate = "Wed Nov 26 12:13:45 MST 2025",
34625 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
34626 URL = "",
34627 acknowledgement = ack-nhfb,
34628 remark = "This is the author's thesis.",
34629 }
34630
34631 @TechReport{Cohn:1986:BOE,
34632 author = "Evan R. Cohn and Ramsey W. Haddad",
34633 title = "Beta Operations: Efficient Implementation of a
34634 Primitive Parallel Operation",
34635 type = "Technical Report",
34636 number = "STAN-CS-86-1129",
34637 institution = inst-STAN-CS,
34638 address = inst-STAN-CS:adr,
34639 pages = "18",
34640 month = aug,
34641 year = "1986",
34642 bibdate = "Thu Nov 20 12:11:36 MST 2025",
34643 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
34644 URL = "http://www-db.stanford.edu/TR/CS-TR-86-1129.html",
34645 abstract = "We will consider the primitive parallel operation of
34646 the Connection Machine, the Beta Operation. Let the
34647 imput size of the problem be N and output size M. We
34648 will show how to perform the Beta Operation on an
34649 N-node hypercube in O(log N + $ \log^2 $ M) time. For a
34650 $ \sqrt {N} x \sqrt {M} $ mesh-of-trees, we require
34651 O(log N + $ \sqrt {M}$) time.",
34652 acknowledgement = ack-nhfb,
34653 xxnumber = "CS-TR-86-1129",
34654 }
34655
34656 @TechReport{Nalwa:1986:DE,
34657 author = "Vishvjit S. Nalwa and Thomas O. Binford",
34658 title = "On Detecting Edges",
34659 type = "Technical Report",
34660 number = "STAN-CS-86-1130",
34661 institution = inst-STAN-CS,
34662 address = inst-STAN-CS:adr,
34663 pages = "50",
34664 month = mar,
34665 year = "1986",
34666 bibdate = "Thu Nov 20 12:11:36 MST 2025",
34667 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
34668 URL = "http://www-db.stanford.edu/TR/CS-TR-86-1130.html",
34669 abstract = "An edge in an image corresponds to a discontinuity in
34670 the intensity surface of the underlying scene. It can
34671 be approximated by a piecewise straight curve composed
34672 of edgels, i.e., short, linear edge-elements, each
34673 characterized by a direction and a position. The
34674 approach to edgel-detection here, is to fit a series of
34675 one-dimensional surfaces to each window (kernel of the
34676 operator) and accept the surface-description which is
34677 adequate in the least squares sense and has the fewest
34678 parameters. (A one-dimensional surface is one which is
34679 constant along some direction.) The tanh is an adequate
34680 basis for the step-edge and its combinations are
34681 adequate for the roof-edge and the line-edge. The
34682 proposed method of step-edgel detection is robust with
34683 respect to noise; for (step-size/$ {\sigma }_{noise}$)
34684 &gt;= 2.5, it has subpixel position localization ($
34685 {\sigma }_{position}$ &lt; 1/3) and an angular
34686 localization better than $ 10^\infty $; further, it is
34687 designed to be insensitive to smooth shading. These
34688 results are demonstrated by some simple analysis,
34689 statistical data and edgel-images. Also included is a
34690 comparison, of performance on a real image, with a
34691 typical operator (Difference-of-Gaussians). The results
34692 indicate that the proposed operator is superior with
34693 respect to detection, localization and resolution.",
34694 acknowledgement = ack-nhfb,
34695 xxnumber = "CS-TR-86-1130",
34696 }
34697
34698 @TechReport{Bar-Noy:1986:PRA,
34699 author = "Amotz Bar-Noy and David Peleg",
34700 title = "Processor Renaming in Asynchronous Environments",
34701 type = "Technical Report",
34702 number = "STAN-CS-86-1131",
34703 institution = inst-STAN-CS,
34704 address = inst-STAN-CS:adr,
34705 pages = "15",
34706 month = sep,
34707 year = "1986",
34708 bibdate = "Thu Nov 20 12:11:36 MST 2025",
34709 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
34710 URL = "http://www-db.stanford.edu/TR/CS-TR-86-1131.html",
34711 abstract = "Fischer, Lynch and Paterson proved that in a
34712 completely asynchronous system ``weak agreement''
34713 cannot be achieved even in the presence of a single
34714 ``benign'' fault. Following the direction proposed in
34715 Attiya, Bar-Noy, Dolev and Koller (Aug 1986), we
34716 demonstrate the interesting fact that some weaker forms
34717 of processor cooperation are still achievable in such a
34718 situation, and in fact, even in the presence of up to t
34719 &lt; n/2 such faulty processors. In particular, we show
34720 that n processors, each having a distinct name taken
34721 from an unbounded ordered domain, can individually
34722 choose new distinct names from a space of size n + t
34723 (where n is an obvious lower bound). In case the new
34724 names are required also to preserve the original order,
34725 we give an algorithm in which the space of new names is
34726 of size $ {2^t}(n - t + 1) - 1 $, which is tight.",
34727 acknowledgement = ack-nhfb,
34728 xxnumber = "CS-TR-86-1131",
34729 }
34730
34731 @TechReport{Sagiv:1986:ODP,
34732 author = "Yehoshua Sagiv",
34733 title = "Optimizing Datalog Programs",
34734 type = "Technical Report",
34735 number = "STAN-CS-86-1132",
34736 institution = inst-STAN-CS,
34737 address = inst-STAN-CS:adr,
34738 pages = "29",
34739 month = mar,
34740 year = "1986",
34741 bibdate = "Thu Nov 20 12:11:36 MST 2025",
34742 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
34743 URL = "http://www-db.stanford.edu/TR/CS-TR-86-1132.html",
34744 abstract = "Datalog programs, i.e., Prolog programs without
34745 function symbols, are considered. It is assumed that a
34746 variable appearing in the head of a rule must also
34747 appear in the body of the rule. The input of a program
34748 is a set of ground atoms (which are given in addition
34749 to the program's rules) and, therefore, can be viewed
34750 as an assignment of relations to some of the program's
34751 predicates. Two programs are equivalent if they produce
34752 the same result for all possible assignments of
34753 relations to the extensional predicates (i.e., the
34754 predicates that do not appear as heads of rules). Two
34755 programs are uniformly equivalent if they produce the
34756 same result for all possible assignments of initial
34757 relations to all the predicates (i.e. both extensional
34758 and intentional). The equivalence problem for Datalog
34759 programs is known to be undecidable. It is shown that
34760 uniform equivalence is decidable, and an algorithm is
34761 given for minimizing a Datalog program under
34762 equivalence. A technique for removing parts of a
34763 program that are redundant under equivalence (but not
34764 under uniform equivalence) is developed. A procedure
34765 for testing uniform equivalence is also developed for
34766 the case in which the database satisfies some
34767 constraints.",
34768 acknowledgement = ack-nhfb,
34769 xxnumber = "CS-TR-86-1132",
34770 }
34771
34772 @TechReport{Edighoffer:1986:DRC,
34773 author = "Judy Lynn Edighoffer",
34774 title = "Distributed, Replicated Computer Bulletin Board
34775 Service",
34776 type = "Technical Report",
34777 number = "STAN-CS-86-1133",
34778 institution = inst-STAN-CS,
34779 address = inst-STAN-CS:adr,
34780 pages = "152",
34781 month = jun,
34782 year = "1986",
34783 bibdate = "Wed Nov 26 12:13:45 MST 2025",
34784 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
34785 URL = "",
34786 acknowledgement = ack-nhfb,
34787 remark = "This is the author's thesis.",
34788 }
34789
34790 @TechReport{Cheriton:1986:UUS,
34791 author = "David R. Cheriton",
34792 title = "{UIO}: a Uniform {I/O} System Interface for
34793 Distributed Systems",
34794 type = "Technical Report",
34795 number = "STAN-CS-86-1134",
34796 institution = inst-STAN-CS,
34797 address = inst-STAN-CS:adr,
34798 pages = "30",
34799 month = nov,
34800 year = "1986",
34801 bibdate = "Thu Nov 20 12:11:36 MST 2025",
34802 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
34803 URL = "http://www-db.stanford.edu/TR/CS-TR-86-1134.html",
34804 abstract = "A uniform I/O interface allows programs to be written
34805 relatively independent of specific I/O services and yet
34806 work with a wide variety of the I/O services available
34807 in a distributed environment. Ideally, the interface
34808 provides this uniform access without excessive
34809 complexity in the interface or loss of performance.
34810 However, a uniform interface does not arise from
34811 careful design of individual system interfaces alone;
34812 it requires explicit definition. In this paper, we
34813 describe the UIO (uniform I/O) system interface that
34814 has been used for the past five years in the V
34815 distributed operating systems, focusing on the key
34816 design issues. This interface provides several
34817 extensions beyond the I/O interface of UNIX, including
34818 support for record I/O, locking, atomic transactions
34819 and replications as well as attributes that indicate
34820 whether optional semantics and operations are
34821 available. We also describe our experience in using and
34822 implementing this interface with a variety of different
34823 I/O services plus the performance of both local and
34824 network I/O. We conclude that the UIO interface
34825 provides a uniform I/O system interface with
34826 significant functionality, wide applicability and no
34827 significant performance penalty.",
34828 acknowledgement = ack-nhfb,
34829 xxnumber = "CS-TR-86-1134",
34830 }
34831
34832 @TechReport{Treitel:1986:SLP,
34833 author = "Richard Treitel",
34834 title = "Sequentialization of Logic Programs",
34835 type = "Technical Report",
34836 number = "STAN-CS-86-1135",
34837 institution = inst-STAN-CS,
34838 address = inst-STAN-CS:adr,
34839 pages = "167",
34840 month = nov,
34841 year = "1986",
34842 bibdate = "Wed Nov 26 12:13:45 MST 2025",
34843 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
34844 URL = "",
34845 acknowledgement = ack-nhfb,
34846 remark = "This is the author's thesis.",
34847 }
34848
34849 @TechReport{Brown:1986:EKB,
34850 author = "Harold D. Brown and Eric Schoen and Bruce A. Delagi",
34851 title = "An Experiment in Knowledge-based Signal Understanding
34852 Using Parallel Architectures",
34853 type = "Technical Report",
34854 number = "STAN-CS-86-1136 (KSL-86-69)",
34855 institution = inst-STAN-CS,
34856 address = inst-STAN-CS:adr,
34857 pages = "ix + 36",
34858 month = oct,
34859 year = "1986",
34860 bibdate = "Thu Nov 20 12:11:36 MST 2025",
34861 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
34862 URL = "http://www-db.stanford.edu/TR/CS-TR-86-1136.html",
34863 abstract = "This report documents an experiment investigating the
34864 potential of a parallel computing architecture to
34865 enhance the performance of a knowledge-based signal
34866 understanding system. The experiment consisted of
34867 implementing and evaluating an application encoded in a
34868 parallel programming extension of Lisp and executing on
34869 a simulated multiprocessor system.\par
34870
34871 The chosen application for the experiment was a
34872 knowledge-based system for interpreting pre-processed,
34873 passively acquired radar emissions from aircraft. The
34874 application was implemented in an experimental
34875 concurrent, asynchronous object-oriented framework.
34876 This framework, in turn, relied on the services
34877 provided by the underlying hardware system. The
34878 hardware system for the experiment was a simulation of
34879 various sized grids of processors with inter-processor
34880 communication via message-passing.\par
34881
34882 The experiment investigated the effects of various
34883 high-level control strategies on the quality of the
34884 problem solution, the speedup of the overall system
34885 performance as a function of the number of processors
34886 in the grid, and some of the issues in implementing and
34887 debugging a knowledge-based system on a message-passing
34888 multiprocessor system.\par
34889
34890 In this report we describe the software and (simulated)
34891 hardware components of the experiment and present the
34892 qualitative and quantitative experimental results.",
34893 acknowledgement = ack-nhfb,
34894 pdfpages = "46",
34895 remark = "No PDF in NTRL archive. Found in DTIC archive.",
34896 xxnumber = "CS-TR-86-1136",
34897 }
34898
34899 @TechReport{Mogul:1986:LFA,
34900 author = "Jeffrey Mogul",
34901 title = "The {Leaf} File Access Protocol",
34902 type = "Technical Report",
34903 number = "STAN-CS-86-1137",
34904 institution = inst-STAN-CS,
34905 address = inst-STAN-CS:adr,
34906 pages = "25",
34907 month = dec,
34908 year = "1986",
34909 bibdate = "Thu Nov 20 12:11:36 MST 2025",
34910 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
34911 URL = "http://www-db.stanford.edu/TR/CS-TR-86-1137.html",
34912 abstract = "Personal computers are superior to timesharing systems
34913 in many ways, but they are inferior in this respect:
34914 they make it harder for users to share files. A local
34915 area network provides a substrate upon which file
34916 sharing can be built; one must also have a protocol for
34917 sharing files. This report describes Leaf, one of the
34918 first protocols to allow remote access to files. Leaf
34919 is a remote file access protocol rather than a file
34920 transfer protocol. Unlike a file transfer protocol,
34921 which must create a complete copy of a file, a file
34922 access protocol provides random access directly to the
34923 file itself. This promotes sharing because it allows
34924 simultaneous access to a file by several remote users,
34925 and because it avoids the creation of new copies and
34926 the associated consistency-maintenance problem. The
34927 protocol described in this report is nearly obsolete.
34928 It is interesting for historical reasons, primarily
34929 because it was perhaps the first non-proprietary remote
34930 file access protocol actually implemented, and also
34931 because it serves as a case study in practical protocol
34932 design. The specification of Leaf is included as an
34933 appendix; it has not been widely available outside of
34934 Stanford.",
34935 acknowledgement = ack-nhfb,
34936 xxnumber = "CS-TR-86-1137",
34937 }
34938
34939 @TechReport{Mackinlay:1986:ADG,
34940 author = "Jock Mackinlay",
34941 title = "Automatic Design of Graphical Presentations",
34942 type = "Technical Report",
34943 number = "STAN-CS-86-1138",
34944 institution = inst-STAN-CS,
34945 address = inst-STAN-CS:adr,
34946 pages = "200",
34947 month = dec,
34948 year = "1986",
34949 bibdate = "Wed Nov 26 12:13:45 MST 2025",
34950 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
34951 URL = "",
34952 acknowledgement = ack-nhfb,
34953 remark = "This is the author's thesis.",
34954 }
34955
34956 @TechReport{Healey:1986:LSS,
34957 author = "Glenn Healey and Thomas O. Binford",
34958 title = "Local Shape from Specularity",
34959 type = "Technical Report",
34960 number = "STAN-CS-86-1139",
34961 institution = inst-STAN-CS,
34962 address = inst-STAN-CS:adr,
34963 pages = "29",
34964 month = jun,
34965 year = "1986",
34966 bibdate = "Thu Nov 20 12:11:36 MST 2025",
34967 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
34968 URL = "http://www-db.stanford.edu/TR/CS-TR-86-1139.html",
34969 abstract = "We show that highlights in images of objects with
34970 specularly reflecting surfaces provide significant
34971 information about the surfaces which generate them. A
34972 brief survey is given of specular reflectance models
34973 which have been used in computer vision and graphics.
34974 For our work, we adopt the Torrance-Sparrow specular
34975 model which, unlike most previous models, considers the
34976 underlying physics of specular reflection from rough
34977 surfaces. From this model we derive powerful
34978 relationships between the properties of a specular
34979 feature in an image and local properties of the
34980 corresponding surface. We show how this analysis can be
34981 used for both prediction and interpretation in a vision
34982 system. A shape from specularity system has been
34983 implemented to test our approach. The performance of
34984 the system is demonstrated by careful experiments with
34985 specularly reflecting objects.",
34986 acknowledgement = ack-nhfb,
34987 xxnumber = "CS-TR-86-1139",
34988 }
34989
34990 @TechReport{Newell:1987:SAG,
34991 author = "John E. Laird and Allen Newell and Paul S.
34992 Rosenbloom",
34993 title = "Soar: an Architecture for General Intelligence",
34994 type = "Technical Report",
34995 number = "STAN-CS-86-1140 (KSL-86-70, AD-A179583)",
34996 institution = inst-STAN-CS,
34997 address = inst-STAN-CS:adr,
34998 pages = "vii + 63",
34999 day = "3",
35000 month = dec,
35001 year = "1986",
35002 bibdate = "Wed Nov 26 12:13:45 MST 2025",
35003 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
35004 URL = "https://apps.dtic.mil/sti/tr/pdf/ADA179583.pdf",
35005 abstract = "The ultimate goal of work in cognitive architecture is
35006 to provide the foundation for a system capable of
35007 general intelligent behavior. That is, the goal is to
35008 provide the underlying structure that would enable a
35009 system to perform the full range of cognitive tasks,
35010 employ the full range of problem-solving methods and
35011 representations appropriate for the tasks, and learn
35012 about all aspects of the tasks and its performance on
35013 them. In this article we present Soar, an implemented
35014 proposal for such an architecture. We describe its
35015 organizational principles, the system as currently
35016 implemented, and demonstrations of its capabilities",
35017 acknowledgement = ack-nhfb,
35018 pdfpages = "72",
35019 remark = "No PDF in NTRL archive. Found in DTIC archive.",
35020 }
35021
35022 @TechReport{Manna:1986:HCB,
35023 author = "Zohar Manna and Richard Waldinger",
35024 title = "How to Clear a Block: a Theory of Plans",
35025 type = "Technical Report",
35026 number = "STAN-CS-87-1141",
35027 institution = inst-STAN-CS,
35028 address = inst-STAN-CS:adr,
35029 pages = "39",
35030 month = dec,
35031 year = "1986",
35032 bibdate = "Wed Nov 26 12:13:45 MST 2025",
35033 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
35034 URL = "",
35035 acknowledgement = ack-nhfb,
35036 }
35037
35038 @TechReport{Hayes-Roth:1986:LER,
35039 author = "Barbara Hayes-Roth and Alan Garvey and M. Vaughan
35040 {Johnson, Jr.} and Michael Hewett",
35041 title = "A Layered Environment for Reasoning about Action",
35042 type = "Technical Report",
35043 number = "STAN-CS-87-1147 (KSL-86-38)",
35044 institution = inst-STAN-CS,
35045 address = inst-STAN-CS:adr,
35046 pages = "83",
35047 month = nov,
35048 year = "1986",
35049 bibdate = "Thu Nov 20 12:11:36 MST 2025",
35050 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
35051 URL = "http://www-db.stanford.edu/TR/CS-TR-87-1147.html",
35052 abstract = "An intelligent systems reasons about --- controls,
35053 explains, learns about --- its action, thereby
35054 improving its efforts to achieve goals and function in
35055 its environment. In order to perform effectively, a
35056 system must have knowledge of the actions it can
35057 perform, the events and states that occur, and the
35058 relationships among instances of those actions, events
35059 and states. We represent such knowledge in a hierarchy
35060 of knowledge abstractions and impose uniform standards
35061 of knowledge content and representation on modules
35062 within each hierarchical level. We refer to the
35063 evolving set of such modules as the BB* environment. To
35064 illustrate, we describe selected elements of BB*: * the
35065 foundational BB1 architecture * the ACCORD framework
35066 for solving arrangement problems by means of an
35067 assembly method * two applications of BB1-ACCORD, the
35068 PROTEAN system for modeling protein structures and the
35069 SIGHTPLAN system for designing construction-site
35070 layouts * two hypothetical multifaceted systems that
35071 integrate ACCORD, PROTEAN and SIGHTPLAN with other
35072 possible BB* frameworks and applications.",
35073 acknowledgement = ack-nhfb,
35074 remark = "No PDF in NTRL archive.",
35075 xxnumber = "CS-TR-87-1147",
35076 }
35077
35078 @TechReport{Russell:1986:AIR,
35079 author = "Stuart J. Russell",
35080 title = "Analogical and Inductive Reasoning",
35081 type = "Technical Report",
35082 number = "STAN-CS-87-1150",
35083 institution = inst-STAN-CS,
35084 address = inst-STAN-CS:adr,
35085 pages = "230",
35086 month = dec,
35087 year = "1986",
35088 bibdate = "Wed Nov 26 12:13:45 MST 2025",
35089 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
35090 URL = "",
35091 acknowledgement = ack-nhfb,
35092 remark = "This is the author's thesis.",
35093 }
35094
35095 @TechReport{Bellin:1986:EAT,
35096 author = "Gianluigi Bellin and Jussi Ketonen",
35097 title = "Experiments in Automatic Theorem Proving",
35098 type = "Technical Report",
35099 number = "STAN-CS-87-1155",
35100 institution = inst-STAN-CS,
35101 address = inst-STAN-CS:adr,
35102 pages = "265",
35103 month = dec,
35104 year = "1986",
35105 bibdate = "Thu Nov 20 12:11:36 MST 2025",
35106 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
35107 URL = "http://www-db.stanford.edu/TR/CS-TR-87-1155.html",
35108 abstract = "The experiments described in this report are proofs in
35109 EKL of properties of different LISP programs operating
35110 different representations of the same mathematical
35111 structures --- finite permutations. EKL is an
35112 interactive proof checker based upon the language of
35113 higher order logic, higher order unification and a
35114 decision procedure for a fragment of first order logic.
35115 The following questions are asked: What representations
35116 of mathematical structure and facts are better suited
35117 for formalization and also applicable to several
35118 interesting situations? What methods and strategies
35119 will make it possible to prove automatically an
35120 extensive body of mathematical knowledge? Can higher
35121 order logic be conveniently applied in the proof of
35122 elementary facts? The fact (*) that finite permutations
35123 form a group is proved from the axioms of arithmetic
35124 and elementary set theory, via the ``Pigeon Hole
35125 Principle'' (PHP). Permutations are represented (1) as
35126 association lists and (2) as lists of numbers. In
35127 representation (2) operations on permutations are
35128 represented (2.1) using predicates (2.2) using
35129 functions. Proofs of (*) using the different
35130 representations are compared. The results and
35131 conclusions include the following. Methods to control
35132 the rewriting process and to replace logic inference by
35133 high order rewriting are presented. PHP is formulated
35134 as a second order statement which is then easily
35135 applied to (1) and (2). This demonstrates the value of
35136 abstract, higher order formulation of facts for
35137 application in different contexts. A case is given in
35138 which representation of properties of programs by
35139 predicates may be more convenient than by functions.
35140 Evidence is given that convenient organization of
35141 proofs into lemmata is essential for large scale
35142 computer aided theorem proving.",
35143 acknowledgement = ack-nhfb,
35144 xxnumber = "CS-TR-87-1155",
35145 }
35146
35147 @TechReport{Thompson:1986:AQM,
35148 author = "Timothy F. Thompson and William J. Clancey",
35149 title = "Applying a Qualitative Modeling Shell to Process
35150 Diagnosis: The {Caster} System",
35151 type = "Technical Report",
35152 number = "STAN-CS-87-1169 (KSL-85-32, AD-A186994)",
35153 institution = inst-STAN-CS,
35154 address = inst-STAN-CS:adr,
35155 pages = "35 + 9",
35156 month = mar,
35157 year = "1986",
35158 bibdate = "Wed Nov 26 12:13:45 MST 2025",
35159 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
35160 URL = "",
35161 acknowledgement = ack-nhfb,
35162 pdfpages = "47",
35163 remark = "No abstract is available. The document is undated, but
35164 NTRL cover pages say March 1986.",
35165 }
35166
35167 @TechReport{Clancey:1986:VKB,
35168 author = "William J. Clancey",
35169 title = "Viewing Knowledge Bases as Qualitative Models",
35170 type = "Technical Report",
35171 number = "STAN-CS-87-1170 (KSL-86-27, AD-A187091)",
35172 institution = inst-STAN-CS,
35173 address = inst-STAN-CS:adr,
35174 pages = "v + 20",
35175 month = may,
35176 year = "1986",
35177 bibdate = "Thu Nov 20 12:11:36 MST 2025",
35178 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
35179 URL = "http://www-db.stanford.edu/TR/CS-TR-87-1170.html;
35180 https://apps.dtic.mil/sti/tr/pdf/ADA187091.pdf",
35181 abstract = "The concept of a qualitative model provides a unifying
35182 perspective for understanding how expert systems differ
35183 from conventional programs. Knowledge bases contain
35184 qualitative models of systems in the world, that is
35185 primarily non-numeric descriptions that provide a basis
35186 for explaining and predicting behavior and formulating
35187 action plans. The prevalent view that a qualitative
35188 model must be a simulation, to the exclusion of
35189 prototypic and behavioral descriptions, has fragmented
35190 our field, so that we have failed to usefully
35191 synthesize what we have learned about modeling
35192 processes. For example, our ideas about ``scoring
35193 functions'' and ``casual network traversal,'' developed
35194 apart from a modeling perspective, have obscured the
35195 inherent explanatory nature of diagnosis. While
35196 knowledge engineering has greatly benefited from the
35197 study of human experts as a means of informing model
35198 construction, overemphasis on modeling the expert's
35199 knowledge has detracted from the primary objective of
35200 modeling a system in the world. Placing AI squarely in
35201 the evolutionary line of telelogic and topologic
35202 modeling, this talk argues that the study of network
35203 representations has established a foundation for a
35204 science and engineering of qualitative models.",
35205 acknowledgement = ack-nhfb,
35206 pdfpages = "35",
35207 remark = "No PDF in NTRL archive. Found in DTIC archive. No
35208 abstract in report, but one is supplied in DTIC front
35209 matter.",
35210 xxnumber = "CS-TR-87-1170",
35211 }
35212
35213 @TechReport{Clancey:1986:QSM,
35214 author = "William J. Clancey",
35215 title = "Qualitative Student Models",
35216 type = "Technical Report",
35217 number = "STAN-CS-87-1171 (KSL-86-15)",
35218 institution = inst-STAN-CS,
35219 address = inst-STAN-CS:adr,
35220 pages = "50",
35221 month = may,
35222 year = "1986",
35223 bibdate = "Wed Nov 26 12:13:45 MST 2025",
35224 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
35225 URL = "",
35226 acknowledgement = ack-nhfb,
35227 remark = "No PDF in NTRL archive.",
35228 }
35229
35230 @TechReport{Clancey:1986:GNH,
35231 author = "William J. Clancey",
35232 title = "From {GUIDON} to {NEOMYCIN} and {HERACLES} in Twenty
35233 Short Lessons",
35234 type = "Technical Report",
35235 number = "STAN-CS-87-1172 (KSL-86-11)",
35236 institution = inst-STAN-CS,
35237 address = inst-STAN-CS:adr,
35238 pages = "40--60, 187--187",
35239 month = jul,
35240 year = "1986",
35241 bibdate = "Wed Nov 26 12:13:45 MST 2025",
35242 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
35243 URL = "https://apps.dtic.mil/sti/tr/pdf/ADA186953.pdf",
35244 abstract = "I review the research leading from the GUIDON
35245 rule-based tutoring system, including the
35246 reconfiguration of MYCIN into NEOMYCIN and NEOMYCIN's
35247 generalization in the heuristic classification shell,
35248 HERACLES. The presentation is organized chronologically
35249 around pictures and dialogues that represent conceptual
35250 turning points and crystallize the basic ideas. My
35251 purpose is to collect the important results in one
35252 place, so they can be easily grasped. In the
35253 conclusion, I make some observations about our research
35254 methodology.",
35255 acknowledgement = ack-nhfb,
35256 pdfpages = "35",
35257 remark = "No abstract is available. PDF file contains a reprint
35258 from \booktitle{The AI Magazine}, August 1986. The DTIC
35259 PDF file is OCR'ed scans of microfiche page images. No
35260 abstract in report, but one is supplied in DTIC front
35261 matter.",
35262 }
35263
35264 @TechReport{Clancey:1986:RWF,
35265 author = "William J. Clancey",
35266 title = "Review of {Winograd} and {Flores}'
35267 {{\booktitle{Understanding Computers and Cognition}}}",
35268 type = "Technical Report",
35269 number = "STAN-CS-87-1173 (KSL-86-48)",
35270 institution = inst-STAN-CS,
35271 address = inst-STAN-CS:adr,
35272 pages = "vi + 13",
35273 month = jul,
35274 year = "1986",
35275 bibdate = "Thu Nov 20 12:11:36 MST 2025",
35276 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
35277 URL = "http://www-db.stanford.edu/TR/CS-TR-87-1173.html;
35278 https://apps.dtic.mil/sti/tr/pdf/ADA187092.pdf",
35279 abstract = "AI researchers and cognitive scientists commonly
35280 believe that thinking involves manipulating
35281 representations. Thinking involves search, inference,
35282 and making choice. This is how we model reasoning and
35283 what goes on in the brain is similar. Winograd and
35284 Flores present a radically different view. They claim
35285 that our knowledge is not represented in the brain at
35286 all, but rather consists of an unformalized shared
35287 background, from which we articulate representations in
35288 order to cope with new situations. In contrast,
35289 computer programs contain only pre-selected objects and
35290 properties, and there is no basis for moving beyond
35291 this initial formalization when breakdown occurs.
35292 Winograd and Flores provide convincing arguments with
35293 examples familiar to most AI researchers. However, they
35294 significantly understate the role of representation in
35295 mediating intelligent behavior, specifically in the
35296 process of reflection, when representations are
35297 generated prior to physical action. Furthermore, they
35298 do not consider the practical benefits of expert
35299 systems and the extent of what can be accomplished.
35300 Nevertheless, the book is crisp and stimulating. It
35301 should make AI researchers more cautious about what
35302 they are doing, more aware of the nature of
35303 formalization, and more open to alternative views.",
35304 acknowledgement = ack-nhfb,
35305 pdfpages = "29",
35306 remark = "No PDF in NTRL archive. Found in DTIC archive. No
35307 abstract in report, but one is supplied in DTIC front
35308 matter.",
35309 xxnumber = "CS-TR-87-1173",
35310 }
35311
35312 @TechReport{Clancey:1986:ITS,
35313 author = "William J. Clancey",
35314 title = "Intelligent Tutoring Systems: a Tutorial Survey",
35315 type = "Technical Report",
35316 number = "STAN-CS-87-1174 (KSL-86-58)",
35317 institution = inst-STAN-CS,
35318 address = inst-STAN-CS:adr,
35319 pages = "ii + 43",
35320 month = sep,
35321 year = "1986",
35322 bibdate = "Thu Nov 20 12:11:36 MST 2025",
35323 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
35324 URL = "http://www-db.stanford.edu/TR/CS-TR-87-1174.html;
35325 https://apps.dtic.mil/sti/tr/pdf/ADA187066.pdf",
35326 abstract = "This survey of Intelligent Tutoring Systems is based
35327 on a tutorial originally presented by John Seely Brown,
35328 Richard R. Burton (Xerox --- PARC, USA) and William J.
35329 Clancey at the National Conference on AI (AAAI) in
35330 Austin, TX in August, 1984. The survey describes the
35331 components of tutoring systems, different teaching
35332 scenarios, and their relation to a theory of
35333 instruction. The underlying pedagogical approach is to
35334 make latent knowledge manifest, which the research
35335 accomplishes by different forms of qualitative
35336 modeling: simulating physical processes; simulating
35337 expert problem-solving, including strategies for
35338 montoring and controlling problem solving
35339 (metacognition); modeling the plans behind procedural
35340 behavior; and forcing articulation of model
35341 inconsistencies through the Socratic method of
35342 instruction. Proceeding chronologically, examples of
35343 intelligent tutoring systems are described in terms of
35344 their internal knowledge representations and the
35345 evolving pedagogical theory. Although these programs
35346 are generally only research projects, examples of what
35347 they can do make abundantly clear the long-term
35348 scientific and software-engineering advantages of the
35349 new modeling methodology.",
35350 acknowledgement = ack-nhfb,
35351 pdfpages = "60",
35352 remark = "No PDF in NTRL archive. Found in DTIC archive. The PDF
35353 file is OCR'ed scans of microfiche page images.",
35354 xxnumber = "CS-TR-87-1174",
35355 }
35356
35357 @TechReport{Brinkley:1987:HRS,
35358 author = "James Brinkley and Bruce Buchanan and Russ Altman and
35359 Bruce Duncan and Craig Cornelius",
35360 title = "A Heuristic Refinement for Spacial Constraint
35361 Satisfaction Problems",
35362 type = "Technical Report",
35363 number = "STAN-CS-87-1142 (KSL-87-05)",
35364 institution = inst-STAN-CS,
35365 address = inst-STAN-CS:adr,
35366 pages = "vi + 15",
35367 month = jan,
35368 year = "1987",
35369 bibdate = "Thu Nov 20 12:11:36 MST 2025",
35370 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
35371 URL = "http://www-db.stanford.edu/TR/CS-TR-87-1142.html",
35372 abstract = "The problem of arranging a set of physical objects
35373 according to a set of constraints is formulated as a
35374 geometric constraint satisfaction problem (GCSP), in
35375 which the variables are the objects, the possible
35376 locations of the objects are the possible values for
35377 the variables, and the constraints are geometric
35378 constraints between objects. A GCSP is a type of
35379 multidimensional constraint satisfaction problem in
35380 which the number of objects and/or the number of
35381 possible locations per object is too large to permit
35382 direct solution by backtrack search. A method is
35383 described for reducing these numbers by refinement
35384 along two dimensions. The number of objects is reduced
35385 by refinement of the structure, representing a group of
35386 objects as a single abstract object before considering
35387 each object individually. The abstraction used depends
35388 on domain specific knowledge. The number of locations
35389 per object is reduced by applying node and arc
35390 consistency algorithms to refine the accessible volume
35391 of each object. Heuristics are employed to control the
35392 order of operations (and hence to affect the efficiency
35393 of search) but not to change the correctness in the
35394 sense that no solutions that would be found by
35395 backtrack search are eliminated. Application of the
35396 method to the problem of protein structure
35397 determination is described.",
35398 acknowledgement = ack-nhfb,
35399 pdfpages = "22",
35400 xxnumber = "CS-TR-87-1142",
35401 }
35402
35403 @TechReport{Winslett:1987:UDI,
35404 author = "Marianne S. Winslett",
35405 title = "Updating Databases with Incomplete Information",
35406 type = "Technical Report",
35407 number = "STAN-CS-87-1143",
35408 institution = inst-STAN-CS,
35409 address = inst-STAN-CS:adr,
35410 pages = "164",
35411 month = jan,
35412 year = "1987",
35413 bibdate = "Wed Nov 26 12:13:45 MST 2025",
35414 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
35415 URL = "",
35416 acknowledgement = ack-nhfb,
35417 remark = "This is the author's thesis.",
35418 }
35419
35420 @TechReport{Byrd:1987:CMT,
35421 author = "Gregory T. Byrd and Bruce A. Delagi",
35422 title = "Considerations for Multiprocessor Topologies",
35423 type = "Technical Report",
35424 number = "STAN-CS-87-1144 (KSL-87-07 PB96-148416)",
35425 institution = inst-STAN-CS,
35426 address = inst-STAN-CS:adr,
35427 pages = "6",
35428 month = jan,
35429 year = "1987",
35430 bibdate = "Thu Nov 20 12:11:36 MST 2025",
35431 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
35432 URL = "http://www-db.stanford.edu/TR/CS-TR-87-1144.html",
35433 abstract = "Choosing a multiprocessor interconnection topology may
35434 depend on high-level considerations, such as the
35435 intended application domain and the expected number of
35436 processors. It certainly depends on low-level
35437 implementation details, such as packaging and
35438 communications protocols. We first use rough measures
35439 of cost and performance to characterize several
35440 topologies. We then examine how implementation details
35441 can affect the realizable performance of a topology.",
35442 acknowledgement = ack-nhfb,
35443 pdfpages = "9",
35444 xxnumber = "CS-TR-87-1144",
35445 }
35446
35447 @TechReport{Cheriton:1987:NMV,
35448 author = "David R. Cheriton and Cary L. Williamson",
35449 title = "Network Measurement of the {VMTP} Request-Response
35450 Protocol in the {V Distributed System}",
35451 type = "Technical Report",
35452 number = "STAN-CS-87-1145",
35453 institution = inst-STAN-CS,
35454 address = inst-STAN-CS:adr,
35455 pages = "23",
35456 month = feb,
35457 year = "1987",
35458 bibdate = "Wed Nov 26 12:13:45 MST 2025",
35459 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
35460 URL = "",
35461 acknowledgement = ack-nhfb,
35462 }
35463
35464 @TechReport{Byrd:1987:PPM,
35465 author = "Gregory Byrd and Russell Nakano and Bruce Delagi",
35466 title = "A Point-to-Point Multicast Communications Protocol",
35467 type = "Technical Report",
35468 number = "STAN-CS-87-1146 (KSL-87-02)",
35469 institution = inst-STAN-CS,
35470 address = inst-STAN-CS:adr,
35471 pages = "viii + 30",
35472 month = jan,
35473 year = "1987",
35474 bibdate = "Thu Nov 20 12:11:36 MST 2025",
35475 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
35476 URL = "http://www-db.stanford.edu/TR/CS-TR-87-1146.html",
35477 abstract = "Many network topologies have been proposed for
35478 connecting a large number of processor-memory pairs in
35479 a high-performance multiprocessor system. In terms of
35480 performance, however, the communications protocol
35481 decisions may be as crucial as topology. This paper
35482 describes a protocol to support point-to-point
35483 interprocessor communications with multicast. Dynamic,
35484 cut- through routing with local flow control is used to
35485 provide a high-throughput, low latency communications
35486 path between processors. In addition, multicast
35487 transmissions are available, in which copies of a
35488 packet are sent to multiple destinations using common
35489 resources as much as possible. Special packet
35490 terminators and selective buffering are introduced to
35491 avoid deadlock during multicasts. A simulated
35492 implementation of the protocol is also described.",
35493 acknowledgement = ack-nhfb,
35494 pdfpages = "38",
35495 xxnumber = "CS-TR-87-1146",
35496 }
35497
35498 @TechReport{Delagi:1987:IASa,
35499 author = "Bruce Delagi and Nakul Saraiya and Sayuri Nishimura
35500 and Greg Byrd",
35501 title = "An Instrumented Architectural Simulation System",
35502 type = "Technical Report",
35503 number = "STAN-CS-87-1148 (KSL-86-36)",
35504 institution = inst-STAN-CS,
35505 address = inst-STAN-CS:adr,
35506 pages = "vii + 21",
35507 day = "29",
35508 month = jan,
35509 year = "1987",
35510 bibdate = "Thu Nov 20 12:11:36 MST 2025",
35511 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
35512 URL = "http://www-db.stanford.edu/TR/CS-TR-87-1148.html",
35513 abstract = "Simulation of systems at an architectural level can
35514 offer an effective way to study critical design choices
35515 if 1. the performance of the simulator is adequate to
35516 examine designs executing significant code bodies ---
35517 not just toy problems or small application fragments 2.
35518 the details of the simulation include the critical
35519 details of the design 3. The view of the design
35520 presented by the simulator instrumentation leads to
35521 useful insights on the problems with the design 4.
35522 there is enough flexibility in the simulation system so
35523 that the asking of unplanned questions is not
35524 suppressed by the weight of the mechanics involved in
35525 making changes either in the design or its measurement.
35526 A simulation system with these goals is described
35527 together with the approach to its implementation. Its
35528 application to the study of a particular class of
35529 multiprocessor hardware system architectures is
35530 illustrated.",
35531 acknowledgement = ack-nhfb,
35532 pdfpages = "28",
35533 xxnumber = "CS-TR-87-1148",
35534 }
35535
35536 @TechReport{Millen:1987:PNA,
35537 author = "Katie Mac Millen and Ann Diaz-Barriga and Carolyn
35538 Tajnai",
35539 title = "Proceedings from the {Nineteenth Annual Meeting of the
35540 Stanford Computer Forum}",
35541 type = "Technical Report",
35542 number = "STAN-CS-87-1149",
35543 institution = inst-STAN-CS,
35544 address = inst-STAN-CS:adr,
35545 pages = "24",
35546 month = feb,
35547 year = "1987",
35548 bibdate = "Thu Nov 20 12:11:36 MST 2025",
35549 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
35550 URL = "http://www-db.stanford.edu/TR/CS-TR-87-1149.html",
35551 abstract = "Operating for almost two decades, the Stanford
35552 Computer Forum is a cooperative venture of the Computer
35553 Science Department and the Computer Systems Laboratory
35554 (a laboratory operated jointly by the Computer Science
35555 and Electrical Engineering Departments). CSD and CSL
35556 are internationally recognized for their excellence;
35557 their faculty members, research staff, and students are
35558 widely known for leadership in developing new ideas and
35559 trends in the organization, design and use of
35560 computers. They are in the forefront of applying
35561 research results to a wide range of applications. The
35562 Forum holds an annual meeting in February to which
35563 three representatives of each member company are
35564 invited. The meeting lasts two days and features
35565 technical sessions at which timely computer research at
35566 Stanford is described by advanced graduate students and
35567 faculty members. There are opportunities for informal
35568 discussions to complement the presentations. This
35569 report includes information on the Forum, the program,
35570 abstracts of the talks and viewgraphs used in the
35571 presentations.",
35572 acknowledgement = ack-nhfb,
35573 xxnumber = "CS-TR-87-1149",
35574 }
35575
35576 @TechReport{Abadi:1987:TLT,
35577 author = "Martin Abadi",
35578 title = "Temporal-Logic Theorem Proving",
35579 type = "Technical Report",
35580 number = "STAN-CS-87-1151",
35581 institution = inst-STAN-CS,
35582 address = inst-STAN-CS:adr,
35583 pages = "179",
35584 month = mar,
35585 year = "1987",
35586 bibdate = "Wed Nov 26 12:13:45 MST 2025",
35587 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
35588 URL = "",
35589 acknowledgement = ack-nhfb,
35590 remark = "This is the author's thesis.",
35591 }
35592
35593 @TechReport{Davidson:1987:INL,
35594 author = "James E. Davidson",
35595 title = "Interpreting Natural Language Database Updates",
35596 type = "Technical Report",
35597 number = "STAN-CS-87-1152",
35598 institution = inst-STAN-CS,
35599 address = inst-STAN-CS:adr,
35600 pages = "119",
35601 month = apr,
35602 year = "1987",
35603 bibdate = "Wed Nov 26 12:13:45 MST 2025",
35604 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
35605 URL = "",
35606 acknowledgement = ack-nhfb,
35607 remark = "This is the author's thesis.",
35608 }
35609
35610 @TechReport{Markenscoff:1987:OGP,
35611 author = "Xanthippi Markenscoff and Christos Papadimitriou",
35612 title = "Optimum Grip of a Polygon",
35613 type = "Technical Report",
35614 number = "STAN-CS-87-1153",
35615 institution = inst-STAN-CS,
35616 address = inst-STAN-CS:adr,
35617 pages = "21",
35618 month = apr,
35619 year = "1987",
35620 bibdate = "Thu Nov 20 12:11:36 MST 2025",
35621 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
35622 URL = "http://www-db.stanford.edu/TR/CS-TR-87-1153.html",
35623 abstract = "It has been shown by Baker, Fortune and Grosse that
35624 any two-dimensional polygonal object can be prehended
35625 stably with three fingers, so that its weight (along
35626 the third dimension) is balanced. Besides, in this
35627 paper we show that form closure of a polygon object can
35628 be achieved by four fingers (previous proofs were not
35629 complete). We formulate and solve the problem of
35630 finding the optimum stable grip or form closure of any
35631 given polygon. For stable grip it is most natural to
35632 minimize the forces needed to balance through friction
35633 the object's weight along the third dimension. For form
35634 closure, we minimize the worst-case forces needed to
35635 balance any unit force acting on the center of gravity
35636 of the object. The mathematical techniques used in the
35637 two instances are an interesting mix of Optimization
35638 and Euclidean geometry. Our results lead to algorithms
35639 for the efficient computation of the optimum grip in
35640 each case.",
35641 acknowledgement = ack-nhfb,
35642 xxnumber = "CS-TR-87-1153",
35643 }
35644
35645 @TechReport{Rokicki:1987:PPS,
35646 author = "Tomas G. Rokicki and Donald E. Knuth",
35647 title = "A Programming and Problem-Solving Seminar",
35648 type = "Technical Report",
35649 number = "STAN-CS-87-1154",
35650 institution = inst-STAN-CS,
35651 address = inst-STAN-CS:adr,
35652 pages = "vi + 89",
35653 month = apr,
35654 year = "1987",
35655 bibdate = "Thu Nov 20 12:11:36 MST 2025",
35656 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
35657 URL = "http://i.stanford.edu/pub/cstr/reports/cs/tr/87/1154/CS-TR-87-1154.pdf;
35658 http://www-db.stanford.edu/TR/CS-TR-87-1154.html;
35659 http://www.ncstrl.org:8900/ncstrl/servlet/search?formname=detail&id=oai%3Ancstrlh%3Astan%3ASTAN%2F%2FCS-TR-87-1154",
35660 abstract = "This report contains edited transcripts of the
35661 discussions held in Stanford's course CS304, Problem
35662 Seminar, during winter quarter 1987. Since the topics
35663 span a large range of ideas in computer science, and
35664 since most of the important research paradigms and
35665 programming paradigms were touched on during the
35666 discussions, these notes may be of interest to graduate
35667 students of computer science at other universities, as
35668 well to their professors and to professional people in
35669 the ``real world.''\par
35670
35671 The present report is the seventh in a series of such
35672 transcripts, continuing the tradition established in
35673 STAN- CS-77-606 (Michael J. Clancy, 1977),
35674 STAN-CS-79-707 (Chris Van Wyk, 1979), STAN-CS-81-863
35675 (Allan A. Miller, 1981), STAN-CS-83-989 (Joseph S.
35676 Weening, 1983), STAN-CS-83-990 (John D. Hobby, 1983),
35677 and STAN-CS-85-1055 (Ramsey W. Haddad, 1985).",
35678 acknowledgement = ack-nhfb,
35679 documentid = "oai:ncstrlh:stan:STAN//CS-TR-87-1154",
35680 xxnumber = "CS-TR-87-1154",
35681 }
35682
35683 @TechReport{Mayr:1987:DTE,
35684 author = "Ernst W. Mayr",
35685 title = "The Dynamic Tree Expression Problem",
35686 type = "Technical Report",
35687 number = "STAN-CS-87-1156",
35688 institution = inst-STAN-CS,
35689 address = inst-STAN-CS:adr,
35690 pages = "19",
35691 month = may,
35692 year = "1987",
35693 bibdate = "Thu Nov 20 12:11:36 MST 2025",
35694 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
35695 URL = "http://www-db.stanford.edu/TR/CS-TR-87-1156.html",
35696 abstract = "Presented is a uniform method for obtaining efficient
35697 parallel algorithms for a rather large class of
35698 problems. The method is based on a logic programming
35699 model, and it derives its efficiency form fast parallel
35700 routines for the evaluation of expression trees.",
35701 acknowledgement = ack-nhfb,
35702 xxnumber = "CS-TR-87-1156",
35703 }
35704
35705 @TechReport{Mayr:1987:NID,
35706 author = "Ernst W. Mayr and C. Greg Plaxton",
35707 title = "Network Implementation of the {DTEP} Algorithm",
35708 type = "Technical Report",
35709 number = "STAN-CS-87-1157",
35710 institution = inst-STAN-CS,
35711 address = inst-STAN-CS:adr,
35712 pages = "22",
35713 month = may,
35714 year = "1987",
35715 bibdate = "Thu Nov 20 12:11:36 MST 2025",
35716 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
35717 URL = "http://www-db.stanford.edu/TR/CS-TR-87-1157.html",
35718 abstract = "The dynamic tree expression problem (DTEP) was defined
35719 in [Ma87]. In this paper, efficient implementations of
35720 the DTEP algorithm are developed for the hypercube,
35721 butterfly, perfect shuffle and multidimensional mesh of
35722 trees families of networks.",
35723 acknowledgement = ack-nhfb,
35724 xxnumber = "CS-TR-87-1157",
35725 }
35726
35727 @TechReport{Winograd:1987:LAP,
35728 author = "Terry A. Winograd",
35729 title = "A Language\slash Action Perspective on the Design of
35730 Cooperative Work",
35731 type = "Technical Report",
35732 number = "STAN-CS-87-1158",
35733 institution = inst-STAN-CS,
35734 address = inst-STAN-CS:adr,
35735 pages = "34",
35736 month = may,
35737 year = "1987",
35738 bibdate = "Wed Nov 26 12:13:45 MST 2025",
35739 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
35740 URL = "",
35741 acknowledgement = ack-nhfb,
35742 }
35743
35744 @TechReport{Winograd:1987:MTL,
35745 author = "Terry A. Winograd",
35746 title = "{Muir}: a Tool for Language Design",
35747 type = "Technical Report",
35748 number = "STAN-CS-87-1159",
35749 institution = inst-STAN-CS,
35750 address = inst-STAN-CS:adr,
35751 pages = "30",
35752 month = may,
35753 year = "1987",
35754 bibdate = "Thu Nov 20 12:11:36 MST 2025",
35755 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
35756 URL = "http://www-db.stanford.edu/TR/CS-TR-87-1159.html",
35757 abstract = "Muir is a language design environment, intended for
35758 use in creating and experimenting with languages such
35759 as programming languages, specification languages,
35760 grammar formalisms, and logical notations. It provides
35761 facilities for a language designer to create a language
35762 specification, which controls the behavior of generic
35763 language manipulating tools typically found in a
35764 language-specific environment, such as structure
35765 editors, interactive interfaces, storage management and
35766 attribute analysis. It is oriented towards use with
35767 evolving languages, providing for mixed structures
35768 (combining different versions), semi-automated updating
35769 of structures from one language version to another, and
35770 incremental language specification. A new hierarchical
35771 grammar formalism serves as the framework for language
35772 specification, with multiple presentation formalisms
35773 and a unified interactive environment based on an
35774 extended notion of edit operations. A prototype version
35775 is operating and has been tested on a small number of
35776 languages.",
35777 acknowledgement = ack-nhfb,
35778 xxnumber = "CS-TR-87-1159",
35779 }
35780
35781 @TechReport{Winograd:1987:SCR,
35782 author = "Terry A. Winograd",
35783 title = "Strategic Computing Research and the Universities",
35784 type = "Technical Report",
35785 number = "STAN-CS-87-1160",
35786 institution = inst-STAN-CS,
35787 address = inst-STAN-CS:adr,
35788 pages = "17",
35789 month = mar,
35790 year = "1987",
35791 bibdate = "Thu Nov 20 12:11:36 MST 2025",
35792 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
35793 URL = "http://www-db.stanford.edu/TR/CS-TR-87-1160.html",
35794 abstract = "The Strategic Computing Initiative offers the
35795 potential of new research funds for university computer
35796 science departments. As with all funds, they bring
35797 benefits and can have unwanted strings attached. In the
35798 case of military funding, the web of attached strings
35799 can be subtle and confusing. The goal of this paper is
35800 to delineate some of these entanglements and perhaps
35801 provide some guidance for loosening and eliminating
35802 them.",
35803 acknowledgement = ack-nhfb,
35804 xxnumber = "CS-TR-87-1160",
35805 }
35806
35807 @TechReport{Winogad:1987:TMC,
35808 author = "Terry A. Winogad",
35809 title = "Thinking Machines: Can There Be? {Are} We?",
35810 type = "Technical Report",
35811 number = "STAN-CS-87-1161",
35812 institution = inst-STAN-CS,
35813 address = inst-STAN-CS:adr,
35814 pages = "34",
35815 month = jun,
35816 year = "1987",
35817 bibdate = "Wed Nov 26 12:13:45 MST 2025",
35818 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
35819 URL = "",
35820 acknowledgement = ack-nhfb,
35821 }
35822
35823 @TechReport{Spencer:1987:WMA,
35824 author = "Thomas Spencer",
35825 title = "Weighted Matching Algorithms",
35826 type = "Technical Report",
35827 number = "STAN-CS-87-1162",
35828 institution = inst-STAN-CS,
35829 address = inst-STAN-CS:adr,
35830 pages = "130",
35831 month = jun,
35832 year = "1987",
35833 bibdate = "Wed Nov 26 12:13:45 MST 2025",
35834 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
35835 URL = "",
35836 acknowledgement = ack-nhfb,
35837 }
35838
35839 @TechReport{Hershberger:1987:EAS,
35840 author = "John E. Hershberger",
35841 title = "Efficient Algorithms for Shortest Path and Visibility
35842 Problems",
35843 type = "Technical Report",
35844 number = "STAN-CS-87-1163",
35845 institution = inst-STAN-CS,
35846 address = inst-STAN-CS:adr,
35847 pages = "193",
35848 month = jun,
35849 year = "1987",
35850 bibdate = "Wed Nov 26 12:13:45 MST 2025",
35851 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
35852 URL = "",
35853 acknowledgement = ack-nhfb,
35854 remark = "This is the author's thesis.",
35855 }
35856
35857 @TechReport{Karlin:1987:SMD,
35858 author = "Anna R. Karlin",
35859 title = "Sharing Memory in Distributed Systems --- Methods and
35860 Applications",
35861 type = "Technical Report",
35862 number = "STAN-CS-87-1164",
35863 institution = inst-STAN-CS,
35864 address = inst-STAN-CS:adr,
35865 pages = "76",
35866 month = jun,
35867 year = "1987",
35868 bibdate = "Wed Nov 26 12:13:45 MST 2025",
35869 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
35870 URL = "",
35871 acknowledgement = ack-nhfb,
35872 remark = "This is the author's thesis.",
35873 }
35874
35875 @TechReport{Fraley:1987:SNL,
35876 author = "Christina Fraley",
35877 title = "Solution of Nonlinear Least-Squares Problems",
35878 type = "Technical Report",
35879 number = "STAN-CS-87-1165",
35880 institution = inst-STAN-CS,
35881 address = inst-STAN-CS:adr,
35882 pages = "325",
35883 month = jun,
35884 year = "1987",
35885 bibdate = "Wed Nov 26 12:13:45 MST 2025",
35886 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
35887 URL = "",
35888 acknowledgement = ack-nhfb,
35889 remark = "This is the author's thesis.",
35890 }
35891
35892 @TechReport{Okuno:1987:PEO,
35893 author = "Hiroshi G. Okuno and Anoop Gupta",
35894 title = "Parallel Execution of {OPS5} in {QLISP}",
35895 type = "Technical Report",
35896 number = "STAN-CS-87-1166 (KSL-87-43, AD-A323588)",
35897 institution = inst-STAN-CS,
35898 address = inst-STAN-CS:adr,
35899 pages = "19",
35900 month = jun,
35901 year = "1987",
35902 bibdate = "Thu Nov 20 12:11:36 MST 2025",
35903 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
35904 URL = "http://www-db.stanford.edu/TR/CS-TR-87-1166.html",
35905 abstract = "Production systems (or rule-based systems) are widely
35906 used for the development of expert systems. To speed-up
35907 the execution of production systems, a number of
35908 different approaches are being taken, a majority of
35909 them being based on the use of parallelism. In this
35910 paper, we explore the issues involved in the parallel
35911 implementation of OPS5 (a widely used production-system
35912 language) in QLISP (a parallel dialect of Lisp proposed
35913 by John McCarthy and Richard Gabriel). This paper shows
35914 that QLISP can easily encode most sources of
35915 parallelism in OPS5 that have been previously discussed
35916 in literature. This is significant because the OPS5
35917 interpreter is the first large program to be encoded in
35918 QLISP, and as a result, this is the first practical
35919 demonstration of the expressive power of QLISP. The
35920 paper also lists the most commonly used QLISP
35921 constructs in the parallel implementation (and the
35922 contexts in which they are used), which serve as a hint
35923 to the QLISP implementor about what to optimize. Also
35924 discussed is the exploitation of speculative
35925 parallelism in RHS-evaluation for OPSS. This has not
35926 been previously discussed in the literature.",
35927 acknowledgement = ack-nhfb,
35928 remark = "No PDF in NTRL or DTIC archives.",
35929 subject-dates = "John McCarthy (4 September 1927--24 October 2011)",
35930 xxnumber = "CS-TR-87-1166",
35931 }
35932
35933 @TechReport{Tang:1987:SST,
35934 author = "Wei-Pai Tang",
35935 title = "{Schwarz} Splitting and Template Operators",
35936 type = "Technical Report",
35937 number = "STAN-CS-87-1167 (Classic-87-03, AD-A187956)",
35938 institution = inst-STAN-CS,
35939 address = inst-STAN-CS:adr,
35940 pages = "x + 129",
35941 month = jul,
35942 year = "1987",
35943 bibdate = "Wed Nov 26 12:13:45 MST 2025",
35944 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
35945 URL = "https://apps.dtic.mil/sti/tr/pdf/ADA187956.pdf",
35946 abstract = "Schwarz alternating method (SAM)is an old mathematical
35947 technique dating from 1869. It was commonly believed
35948 that SAM was a useful tool for theoretical analysis but
35949 not a very practical approach for computations. The
35950 earlier experiences showed that SAM converged slowly.
35951 In this thesis, SAM reexamined and generalized. The
35952 governing factors of convergence of SAM are explored
35953 through the analysis for the model problem. Based on
35954 this knowledge, many acceleration schemes can be
35955 combined with SAM to yield a new type of iterative
35956 method for large sparse matrix problems. In particular,
35957 when these techniques are applied to the solution of
35958 the model problem, an optimal complexity can be
35959 achieved. Some generalizations of SAM, namely Schwarz
35960 splittings (SS), are presented here. For many important
35961 applications, such as performing parallel computations
35962 in a non-shared memory environment, using composite
35963 grids and also applying fast solvers in an irregular
35964 region, SSs are found to be useful techniques.\par
35965
35966 In order to identify the types of problems for which
35967 SSs are most suitable, a new structure for the linear
35968 operators called template operators has been developed.
35969 Some decay results for the elements of the inverses of
35970 sparse operators are given. These results provide a
35971 theoretical basis for determining when these SS
35972 techniques can be used successfully.",
35973 acknowledgement = ack-nhfb,
35974 advisor = "Joseph Oliger",
35975 pdfpages = "145",
35976 remark = "This is the author's Ph.D. thesis. No PDF in NTRL
35977 archive. Found in DTIC archive. The PDF file is OCR'ed
35978 scans of microfiche page images. The thesis is dated
35979 June 1987, but the cover is dated July 1987.",
35980 }
35981
35982 @TechReport{Wilkin:1987:UED,
35983 author = "David C. Wilkins and William J. Clancey and Bruce G.
35984 Buchanan",
35985 title = "Using and Evaluating Differential Modeling in
35986 Intelligent Tutoring and Apprentice Learning Systems",
35987 type = "Technical Report",
35988 number = "STAN-CS-87-1175 (KSL-86-62, AD-A187503)",
35989 institution = inst-STAN-CS,
35990 address = inst-STAN-CS:adr,
35991 pages = "v + 26",
35992 month = jan,
35993 year = "1987",
35994 bibdate = "Thu Nov 20 12:11:36 MST 2025",
35995 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
35996 note = "To appear in: \booktitle{Intelligent Tutoring Systems:
35997 Lessons Learned}, J. Psotka, D. Massey and S. Mutter,
35998 editors, Lawrence Erlbaum Publishers, 1987.",
35999 URL = "http://www-db.stanford.edu/TR/CS-TR-87-1175.html;
36000 https://apps.dtic.mil/sti/tr/pdf/ADA187503.pdf",
36001 abstract = "A powerful approach to debugging and refining the
36002 knowledge structures of a problem solving agent is to
36003 differentially model the actions of the agent against a
36004 gold standard. This paper proposes a framework for
36005 exploring the inherent limitations of such an approach
36006 when a problem solver is differentially modeled against
36007 an expert system. A procedure is described for
36008 determining a performance upper bound for debugging via
36009 differential modeling, called the synthetic agent
36010 method. The synthetic agent method systematically
36011 explores the space of near miss training instances and
36012 expresses the limits of debugging in terms of the
36013 knowledge representation and control language
36014 constructs of the expert system.",
36015 acknowledgement = ack-nhfb,
36016 pdfpages = "41",
36017 remark = "No PDF in NTRL archive. Found in DTIC archive. The PDF
36018 file is OCR'ed scans of microfiche page images.",
36019 xxnumber = "CS-TR-87-1175",
36020 }
36021
36022 @TechReport{Flajolet:1987:BPC,
36023 author = "Philippe Flajolet and Dani{\`e}le Gardy and Lo{\"y}s
36024 Thimonier",
36025 title = "Birthday Paradox, Coupon Collectors, Caching
36026 Algorithms, and Self-Organizing Search",
36027 type = "Technical Report",
36028 number = "STAN-CS-87-1176 (RR-0720)",
36029 institution = inst-STAN-CS,
36030 address = inst-STAN-CS:adr,
36031 pages = "18",
36032 month = aug,
36033 year = "1987",
36034 DOI = "https://doi.org/10.1016/0166-218X(92)90177-C",
36035 bibdate = "Wed Nov 26 12:13:45 MST 2025",
36036 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib;
36037 https://www.math.utah.edu/pub/tex/bib/string-matching.bib",
36038 URL = "https://inria.hal.science/inria-00075832v1/file/RR-0720.pdf",
36039 abstract = "This paper introduces a unified framework for the
36040 analysis of a class of random allocation processes that
36041 include: (i) the birthday paradox; (ii) the coupon
36042 collector problem; (iii) least-recently-used (LRU)
36043 caching in memory management systems under the
36044 independent reference model; (iv) the move-to-front
36045 heuristic of self-organizing search. All analyses are
36046 relative to general (non uniform) probability
36047 distributions.\par
36048
36049 Our approach to these problems comprises two stages.
36050 First, the probabilistic phenomena of interest are
36051 described by means of regular languages extended by
36052 addition of the shuffle product. Next, systematic
36053 translation mechanisms are used to derive integral
36054 representations for expectations and probability
36055 distributions.",
36056 acknowledgement = ack-nhfb,
36057 author-dates = "Philippe Flajolet (1 December 1948--22 March 2011)",
36058 remark = "Published in \booktitle{Discrete Applied Mathematics},
36059 {\bf 39}(3) 207--229, 11 November 1992,
36060 doi:10.1016/0166-218X(92)90177-C.",
36061 }
36062
36063 @TechReport{Finlayson:1987:LFE,
36064 author = "Ross S. Finlayson and David R. Cheriton",
36065 title = "Log Files: an Extended File Service Exploiting
36066 Write-Once Storage",
36067 type = "Technical Report",
36068 number = "STAN-CS-87-1177",
36069 institution = inst-STAN-CS,
36070 address = inst-STAN-CS:adr,
36071 pages = "14",
36072 month = aug,
36073 year = "1987",
36074 bibdate = "Thu Nov 20 12:11:36 MST 2025",
36075 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
36076 URL = "http://www-db.stanford.edu/TR/CS-TR-87-1177.html",
36077 abstract = "A log service provides efficient storage and retrieval
36078 of data that is written sequentially (append-only) and
36079 not subsequently modified. Application programs an
36080 subsystems use log services for recovery, to record
36081 security audit trails, and for performance monitoring.
36082 Ideally, a log service should accommodate very large,
36083 long-lived logs, and provide efficient retrieval and
36084 low space overhead. In this paper, we describe the
36085 design and implementation of the Clio log service. Clio
36086 provides the abstraction of log files: readable,
36087 append-only files that are accessed in the same way as
36088 conventional files. The underlying storage medium is
36089 required only to be append-only; more general types of
36090 write access are not necessary. We show how log files
36091 can be implemented efficiently and robustly on top of
36092 such storage media --- in particular, write-once.
36093 optical disk. In addition, we describe a general
36094 application software storage architecture that makes
36095 use of log files.",
36096 acknowledgement = ack-nhfb,
36097 xxnumber = "CS-TR-87-1177",
36098 }
36099
36100 @TechReport{Byrd:1987:DCT,
36101 author = "Gregory T. Byrd and Russell Nakano and Bruce A.
36102 Delagi",
36103 title = "A Dynamic, Cut-Through Communications Protocol with
36104 Multicast",
36105 type = "Technical Report",
36106 number = "STAN-CS-87-1178 (KSL-87-44, AD-A197006)",
36107 institution = inst-STAN-CS,
36108 address = inst-STAN-CS:adr,
36109 pages = "ii + 23",
36110 month = aug,
36111 year = "1987",
36112 bibdate = "Thu Nov 20 12:11:36 MST 2025",
36113 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
36114 URL = "http://www-db.stanford.edu/TR/CS-TR-87-1178.html",
36115 abstract = "This paper describes a protocol to support
36116 point-to-point interprocessor communications with
36117 multicast. Dynamic, cut-through routing with local flow
36118 control is used to provide a high-throughput,
36119 low-latency communications path between processors. In
36120 addition, multicast transmissions are available, in
36121 which copies of a packet are sent to multiple
36122 destinations using common resources as much as
36123 possible. special packet terminators and selective
36124 buffering are introduced to avoid deadlock during
36125 multicasts. A simulated implementation of the protocol
36126 is also described.",
36127 acknowledgement = ack-nhfb,
36128 pdfpages = "34",
36129 xxnumber = "CS-TR-87-1178",
36130 }
36131
36132 @TechReport{Mann:1987:DND,
36133 author = "Timothy Paul Mann",
36134 title = "Decentralized Naming in Distributed Computer Systems",
36135 type = "Technical Report",
36136 number = "STAN-CS-87-1179",
36137 institution = inst-STAN-CS,
36138 address = inst-STAN-CS:adr,
36139 pages = "101",
36140 month = sep,
36141 year = "1987",
36142 bibdate = "Wed Nov 26 12:13:45 MST 2025",
36143 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
36144 URL = "",
36145 acknowledgement = ack-nhfb,
36146 remark = "This is the author's thesis.",
36147 }
36148
36149 @TechReport{Wilkins:1987:DRS,
36150 author = "David C. Wilkins and Bruce G. Buchanan",
36151 title = "On Debugging Rule Sets When Reasoning Under
36152 Uncertainty",
36153 type = "Technical Report",
36154 number = "STAN-CS-87-1181 (KSL-86-30)",
36155 institution = inst-STAN-CS,
36156 address = inst-STAN-CS:adr,
36157 pages = "21",
36158 month = may,
36159 year = "1987",
36160 bibdate = "Thu Nov 20 12:11:36 MST 2025",
36161 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
36162 URL = "http://www-db.stanford.edu/TR/CS-TR-87-1181.html",
36163 abstract = "Heuristic inference rules with a measure of strength
36164 less than certainty have an unusual property: better
36165 individual rules do not necessarily lead to a better
36166 overall rule set. All less-than-certain rules
36167 contribute evidence towards erroneous conclusions for
36168 some problem instances, and the distribution of these
36169 erroneous conclusions over the instances is not
36170 necessarily related to individual rule quality. This
36171 has important consequences for automatic machine
36172 learning of rules, since rule selection is usually
36173 based on measures of quality of individual rules. In
36174 this paper, we explain why the most obvious and
36175 intuitively reasonable solution to this problem,
36176 incremental modification and deletion of rules
36177 responsible for wrong conclusions a la Teiresias, is
36178 not always appropriate. In our experience, it usually
36179 fails to converge to an optimal set of rules. Given a
36180 set of heuristic rules, we explain why the best rule
36181 set should be considered to be the element of the power
36182 set of rules that yields a global minimum error with
36183 respect to generating erroneous positive and negative
36184 conclusions. This selection process is modeled as a
36185 bipartite graph minimization problem and shown to be
36186 NP-complete. A solution method is described, the
36187 Antidote Algorithm, that performs a model-directed
36188 search of the rule space. On an example from medical
36189 diagnosis, the Antidote Algorithm significantly reduced
36190 the number of misdiagnoses when applied to a rule set
36191 generated from 104 training instances.",
36192 acknowledgement = ack-nhfb,
36193 xxnumber = "CS-TR-87-1181",
36194 }
36195
36196 @TechReport{Wilkins:1987:KBR,
36197 author = "David C. Wilkins and Bruce G. Buchanan",
36198 title = "Knowledge Base Refinement by Monitoring Abstract
36199 Control Knowledge",
36200 type = "Technical Report",
36201 number = "STAN-CS-87-1182 (KSL-87-01)",
36202 institution = inst-STAN-CS,
36203 address = inst-STAN-CS:adr,
36204 pages = "21",
36205 month = aug,
36206 year = "1987",
36207 bibdate = "Thu Nov 20 12:11:36 MST 2025",
36208 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
36209 URL = "http://www-db.stanford.edu/TR/CS-TR-87-1182.html",
36210 abstract = "An explicit representation of the problem solving
36211 method of an expert system shell as abstract control
36212 knowledge provides a powerful foundation for learning.
36213 This paper describes the abstract control knowledge of
36214 the Heracles expert system shell for heuristic
36215 classification problems, and describes how the Odysseus
36216 apprenticeship learning program uses this
36217 representation to automate ``end-game'' knowledge
36218 acquisition. Particular emphasis is given to showing
36219 how abstract control knowledge facilitates the use of
36220 underlying domain theories by a learning program.",
36221 acknowledgement = ack-nhfb,
36222 xxnumber = "CS-TR-87-1182",
36223 }
36224
36225 @TechReport{Clancey:1987:KES,
36226 author = "William J. Clancey",
36227 title = "The Knowledge Engineer as Student: Metacognitive bases
36228 for asking good questions",
36229 type = "Technical Report",
36230 number = "STAN-CS-87-1183 (KSL-87-12, AD-A186995)",
36231 institution = inst-STAN-CS,
36232 address = inst-STAN-CS:adr,
36233 pages = "iv + 34",
36234 month = jan,
36235 year = "1987",
36236 bibdate = "Thu Nov 20 12:11:36 MST 2025",
36237 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
36238 URL = "http://www-db.stanford.edu/TR/CS-TR-87-1183.html;
36239 https://apps.dtic.mil/sti/tr/pdf/ADA186995.pdf",
36240 abstract = "Knowledge engineers are efficient, active learners.
36241 They systematically approach domains and acquire
36242 knowledge to solve routine, practical problems. By
36243 modeling their methods, we may develop a basis for
36244 teaching other students how to direct their own
36245 learning. In particular, a knowledge engineer is good
36246 at detecting gaps in a knowledge base and asking
36247 focused questions to improve an expert system's
36248 performance. This ability stems from domain-general
36249 knowledge about: problem-solving procedures, the
36250 categorization of routine problem-solving knowledge,
36251 and domain and task differences. this paper studies
36252 these different forms of metaknowledge, and illustrates
36253 its incorporation in an intelligent tutoring system. A
36254 model of learning is presented that describes how the
36255 knowledge engineer detects problem-solving failures and
36256 tracks them back to gaps in domain knowledge, which are
36257 then reformulated as questions to ask a teacher. We
36258 describe how this model of active learning is being
36259 developed and tested in a knowledge acquisition program
36260 for an expert system.",
36261 acknowledgement = ack-nhfb,
36262 pdfpages = "47",
36263 remark = "No PDF in NTRL archive. Found in DTIC archive.",
36264 xxnumber = "CS-TR-87-1183",
36265 }
36266
36267 @TechReport{Okuno:1987:FAF,
36268 author = "Hiroshi G. Okuno and Nobuyasu Osato and Ikuo
36269 Takeuchi",
36270 title = "Firmware Approach to Fast {Lisp} Interpreter",
36271 type = "Technical Report",
36272 number = "STAN-CS-87-1184 (KSL-87-57)",
36273 institution = inst-STAN-CS,
36274 address = inst-STAN-CS:adr,
36275 pages = "v + 22",
36276 month = sep,
36277 year = "1987",
36278 bibdate = "Thu Nov 20 12:11:36 MST 2025",
36279 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
36280 URL = "http://www-db.stanford.edu/TR/CS-TR-87-1184.html",
36281 abstract = "The approach to speed up a Lisp interpreter by
36282 implementing it in firmware seems promising. A
36283 microcoded Lisp interpreter shows good performance for
36284 very simple benchmarks, while it often fails to provide
36285 good performance for larger benchmarks and applications
36286 unless speedup techniques are devised for it. This was
36287 the case for the TAO/ELIS system. This paper describes
36288 various techniques devised for the TAO/ELIS system in
36289 order to speed up the interpreter of the TAO language
36290 implemented on the ELIS Lisp machine. The techniques
36291 include data type dispatch, variable access, function
36292 call and so on. TAO is not only upward compatible with
36293 Common Lisp, but also incorporates logic programming,
36294 object-oriented programming and Fortran/C-like
36295 programming into Lisp programming. TAO also provides
36296 concurrent programming and supports multiple users (up
36297 to eight users). The TAO interpreter for those
36298 programming paradigms is coded fully in microcodes. In
36299 spite of rich functionalities, the speed of interpreted
36300 codes of TAO is comparable to that of compiled codes of
36301 commercial Lisp machines. Furthermore, the speeds of
36302 the {\em interpreted\/} codes of the same program
36303 written in various programming paradigms in TAO does
36304 not differ so much. This speed balance is very
36305 important for the user.\par
36306
36307 Another outstanding feature of the TAO/ELIS system is
36308 its firmware development environments. Micro Assembler
36309 and Linker are written in TAO, which enables the user
36310 to use the capability of TAO in microcodes. Since
36311 debugging tools are also written in mini-Lisp, many new
36312 tools were developed in parallel to debugging of
36313 microcodes. This high level approach to firmware
36314 development environments is very important to provide
36315 high productivity of development.",
36316 acknowledgement = ack-nhfb,
36317 pdfpages = "28",
36318 remark = "To appear in \booktitle{Proceedings of the Twentieth
36319 Annual Workshop on Microprogramming (MICRO-20)}.",
36320 xxnumber = "CS-TR-87-1184",
36321 }
36322
36323 @TechReport{Haas:1987:BPI,
36324 author = "Zygmunt Haas and David R. Cheriton",
36325 title = "{{\em Blazenet\/}}: a Photonic Implementable Wide-Area
36326 Network",
36327 type = "Technical Report",
36328 number = "STAN-CS-87-1185 (CSL-TR-87-346, AD-A197005)",
36329 institution = inst-STAN-CS,
36330 address = inst-STAN-CS:adr,
36331 pages = "ii + 21",
36332 day = "5",
36333 month = oct,
36334 year = "1987",
36335 bibdate = "Thu Nov 20 12:11:36 MST 2025",
36336 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
36337 URL = "http://www-db.stanford.edu/TR/CS-TR-87-1185.html",
36338 abstract = "High-performance wide-area networks are required to
36339 interconnect clusters of computers connected by local
36340 area and metropolitan area networks. Optical fiber
36341 technology provides long distance channels in the
36342 multi-gigabit per second range. The challenge is to
36343 provide switching nodes that handle these data rates
36344 with minimum delay, and at a reasonable cost. In this
36345 paper, we describe a packet switching network,
36346 christened Blazenet, that provides low delay and has
36347 minimal memory requirements. It can be extended to
36348 support multicast and priority delivery. Such a network
36349 can revolutionize the opportunities for distributed
36350 command and control, information and resources sharing,
36351 real-time conferencing, and wide-area parallel
36352 computation, to mention but a few applications.",
36353 acknowledgement = ack-nhfb,
36354 pdfpages = "23",
36355 xxnumber = "CS-TR-87-1185",
36356 }
36357
36358 @TechReport{Manna:1987:HTP,
36359 author = "Zohar Manna and Amir Pnueli",
36360 title = "A Hierarchy of Temporal Properties",
36361 type = "Technical Report",
36362 number = "STAN-CS-87-1186",
36363 institution = inst-STAN-CS,
36364 address = inst-STAN-CS:adr,
36365 pages = "44",
36366 month = oct,
36367 year = "1987",
36368 bibdate = "Thu Nov 20 12:11:36 MST 2025",
36369 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
36370 URL = "http://www-db.stanford.edu/TR/CS-TR-87-1186.html",
36371 abstract = "We propose a classification of temporal properties
36372 into a hierarchy which refines the known
36373 safety-liveness classification of properties. The new
36374 classification recognizes the classes of safety,
36375 guarantee, persistence, fairness, and hyper-fairness.
36376 The classification suggested here is based on the
36377 different ways a property of finite computations can be
36378 extended into a property of infinite computations. For
36379 properties that are expressible by temporal logic and
36380 predicate automata, we provide a syntactic
36381 characterization of the formulae and automata that
36382 specify properties in the different classes. We
36383 consider the verification of properties over a given
36384 program, and provide a unique proof principle for each
36385 class.",
36386 acknowledgement = ack-nhfb,
36387 xxnumber = "CS-TR-87-1186",
36388 }
36389
36390 @TechReport{Morris:1987:YYA,
36391 author = "K. Morris and J. F. Naughton and Y. Saraiya and J. D.
36392 Ullman and A. {Van Gelder}",
36393 title = "{YAWN}! ({YET ANOTHER WINDOW ON NAIL!})",
36394 type = "Technical Report",
36395 number = "STAN-CS-87-1187",
36396 institution = inst-STAN-CS,
36397 address = inst-STAN-CS:adr,
36398 pages = "16",
36399 month = oct,
36400 year = "1987",
36401 bibdate = "Wed Nov 26 12:13:45 MST 2025",
36402 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
36403 URL = "",
36404 acknowledgement = ack-nhfb,
36405 }
36406
36407 @TechReport{Nakano:1987:EKB,
36408 author = "Russell Nakano and Masafumi Minami",
36409 title = "Experiments with a Knowledge-Based System on a
36410 Multiprocessor",
36411 type = "Technical Report",
36412 number = "STAN-CS-87-1188 (KSL-87-61, AD-A198708)",
36413 institution = inst-STAN-CS,
36414 address = inst-STAN-CS:adr,
36415 pages = "vii + 45",
36416 month = oct,
36417 year = "1987",
36418 bibdate = "Thu Nov 20 12:11:36 MST 2025",
36419 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
36420 URL = "http://www-db.stanford.edu/TR/CS-TR-87-1188.html",
36421 abstract = "This paper documents the results we obtained and the
36422 lessons we learned in the design, implementation, and
36423 execution of a simulated real-time application on a
36424 simulated parallel processor. Specifically, our
36425 parallel program ran 100 times faster on a
36426 100-processor multiprocessor. The machine architecture
36427 is a distributed-memory multiprocessor. The target
36428 machine consists of 10 to 1000 processors, but because
36429 of simulator limitations, we ran simulations of
36430 machines consisting of 1 to 100 processors. Each
36431 processor is a computer with its own local memory,
36432 executing an independent instruction stream. There is
36433 no global shared memory; all processes communicate by
36434 message passing. The target programming environment,
36435 called Lamina, encourages a programming style that
36436 stresses performance gains through problem
36437 decomposition, allowing many processors to be brought
36438 to bear on a problem. THe key is to distribute the
36439 processing load over replicated objects, and to
36440 increase throughput by building pipelined sequences of
36441 objects that handle stages of problem solving. We
36442 focused on a knowledge-based application that simulates
36443 real-time understanding of radar tracks, called
36444 Airtrac. This paper describes a portion of the Airtrac
36445 application implemented in Lamina and a set of
36446 experiments that we performed. We confirmed the
36447 following hypotheses: (1) Performance of our concurrent
36448 program improves with additional processors, and
36449 thereby attains a significant level of speedup. (2)
36450 Correctness of our concurrent program can be maintained
36451 despite a high degree of problem decomposition and
36452 highly overloaded input data conditions.",
36453 acknowledgement = ack-nhfb,
36454 pdfpages = "52",
36455 xxnumber = "CS-TR-87-1188",
36456 }
36457
36458 @TechReport{Delagi:1987:IASb,
36459 author = "Bruce A. Delagi and Nakul Saraiya and Sayuri Nishimura
36460 and Greg Byrd",
36461 title = "Instrumented Architectural Simulation",
36462 type = "Technical Report",
36463 number = "STAN-CS-87-1189 (KSL-87-65)",
36464 institution = inst-STAN-CS,
36465 address = inst-STAN-CS:adr,
36466 pages = "iv + 6",
36467 month = nov,
36468 year = "1987",
36469 bibdate = "Thu Nov 20 12:11:36 MST 2025",
36470 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
36471 URL = "http://www-db.stanford.edu/TR/CS-TR-87-1189.html",
36472 abstract = "Simulation of systems at an architectural level can
36473 offer an effective way to study critical design choices
36474 if (1) the performance of the simulator is adequate to
36475 examine designs executing significant code bodies ---
36476 not just toy problems or small application fragments,
36477 (2) the details of the simulation include the critical
36478 details of the design, (3) the view of the design
36479 presented by the simulator instrumentation leads to
36480 useful insights on the problems with the design, and
36481 (4) there is enough flexibility in the simulation
36482 system so that the asking of unplanned questions is not
36483 suppressed by the weight of the mechanics involved in
36484 making changes either in the design or its measurement.
36485 A simulation system with these goals is described
36486 together with the approach to its implementation. Its
36487 application to the study of a particular class of
36488 multiprocessor hardware system architectures is
36489 illustrated.",
36490 acknowledgement = ack-nhfb,
36491 pdfpages = "10",
36492 xxnumber = "CS-TR-87-1189",
36493 }
36494
36495 @TechReport{Finger:1987:ECD,
36496 author = "Joseph Jeffrey Finger",
36497 title = "Exploiting Constraints in Design Synthesis",
36498 type = "Technical Report",
36499 number = "STAN-CS-88-1204",
36500 institution = inst-STAN-CS,
36501 address = inst-STAN-CS:adr,
36502 pages = "128",
36503 month = apr,
36504 year = "1987",
36505 bibdate = "Wed Nov 26 12:13:45 MST 2025",
36506 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
36507 URL = "",
36508 acknowledgement = ack-nhfb,
36509 remark = "This is the author's thesis.",
36510 }
36511
36512 @TechReport{Nazarian:1988:BDC,
36513 author = "Taleen Marashian Nazarian",
36514 title = "Bibliography; {Department of Computer Science}
36515 Technical Reports, 1963--1988",
36516 type = "Technical Report",
36517 number = "CS-TR-87-1180",
36518 institution = inst-STAN-CS,
36519 address = inst-STAN-CS:adr,
36520 pages = "92",
36521 month = jan,
36522 year = "1988",
36523 bibdate = "Thu Nov 20 12:11:36 MST 2025",
36524 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
36525 URL = "http://www-db.stanford.edu/TR/CS-TR-87-1180.html",
36526 abstract = "This report lists, in chronological order, all reports
36527 published by the Stanford Computer Science Department
36528 (CSD) since 1963. Each report is identified by CSD
36529 number, author's name, title, number of pages, and
36530 date. If a given report is available from the
36531 department at the time of the Bibliography's printing,
36532 price is listed. For convenience, an author index,
36533 ordering information, codes, and alternative sources
36534 are also included.",
36535 acknowledgement = ack-nhfb,
36536 xxnumber = "STAN-CS-87-1180",
36537 }
36538
36539 @TechReport{Kim:1988:VTC,
36540 author = "Scott Edward Kim",
36541 title = "Viewpoint: Toward a Computer for Visual Thinkers",
36542 type = "Technical Report",
36543 number = "STAN-CS-88-1190",
36544 institution = inst-STAN-CS,
36545 address = inst-STAN-CS:adr,
36546 pages = "137",
36547 month = jan,
36548 year = "1988",
36549 bibdate = "Wed Nov 26 12:13:45 MST 2025",
36550 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
36551 URL = "",
36552 acknowledgement = ack-nhfb,
36553 remark = "This is the author's thesis.",
36554 }
36555
36556 @TechReport{Cai:1988:IRM,
36557 author = "Chunsheng Cai",
36558 title = "Instantaneous Robot Motion with Contact between
36559 Surfaces",
36560 type = "Technical Report",
36561 number = "STAN-CS-88-1191 (AD-A198709)",
36562 institution = inst-STAN-CS,
36563 address = inst-STAN-CS:adr,
36564 pages = "x + 173",
36565 month = jan,
36566 year = "1988",
36567 bibdate = "Wed Nov 26 12:13:45 MST 2025",
36568 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
36569 URL = "https://apps.dtic.mil/sti/tr/pdf/ADA198709.pdf",
36570 abstract = "In this work, we analyze the motion constraints needed
36571 to maintain direct contact between two rigid bodies,
36572 when one or both bodies are being moved under p
36573 computer control. We first study the time-based
36574 instantaneous contact kinematics, then develop a
36575 control formulation and specifications within the AL
36576 robot language for moving so as to maintain the desired
36577 contact. Finally we study the impact which results when
36578 bodies are moved into direct contact. These studies on
36579 robot motion with direct contact between bodies are
36580 useful for robot motion planning and control.\par
36581
36582 We studied the instantaneous contact kinematics, under
36583 planar and spatial motion, of a moving object with
36584 point or line contact between surfaces. In particular,
36585 the velocity, acceleration and jerk of the
36586 instantaneous contact point, and the constraints on the
36587 angular velocity and angular acceleration for line
36588 contact have been obtained as functions of surface
36589 geometries and the rigid body motions under contact.
36590 These results have been specialized for the study of
36591 the special motions of pure rolling and pure sliding,
36592 and for the contact geometries where contact occurs on
36593 a sharp vertex, a sharp edge or a plane. They have also
36594 been used to study bodies moving with multiple
36595 contacts.\par
36596
36597 Body trajectories to maintain the contact can be
36598 preplanned using the equations developed in this
36599 thesis. In addition these results can be used in real
36600 time control in conjunction with tactile sensing. The
36601 equations for the trajectory of an instantaneous
36602 contact point are useful in position and force control.
36603 We have shown that die availability of a proper force
36604 sensor can replace the need for knowledge of the
36605 contact surfaces' geometry in determining the normal
36606 acceleration at contact.\par
36607
36608 As an implementation of the instantaneous contact
36609 kinematics, we have formulated a controller to maintain
36610 the direct contact motion, and extended the AL robot
36611 language to facilitate direct contact motion
36612 specification. The control can be formulated directly
36613 in contact-task variables, and include the inertia
36614 force corresponding to acceleration along the contact
36615 normal. The language extensions allow for the
36616 specification of contact surface geometry, contact
36617 trajectories, and the motion parameters such as error
36618 tolerance and directional wobble.\par
36619
36620 Concerning the instant of making contact, we have
36621 studied the sensitivity of the impact impulse to the
36622 link-mass distribution of a revolute-jointed planar
36623 manipulator. In this connection, link-space
36624 representations, optimal pivot location, influence of
36625 the mass and orientation of each link on the impact
36626 impulse at the end-effector have been considered.",
36627 acknowledgement = ack-nhfb,
36628 advisor = "Bernard Roth",
36629 pdfpages = "187",
36630 remark = "This is the author's Ph.D. thesis.",
36631 }
36632
36633 @TechReport{Cheriton:1988:UMM,
36634 author = "David R. Cheriton",
36635 title = "The Unified Management of Memory in the {V}
36636 Distributed System",
36637 type = "Technical Report",
36638 number = "STAN-CS-88-1192 (CSL-TR-88-359)",
36639 institution = inst-STAN-CS,
36640 address = inst-STAN-CS:adr,
36641 pages = "24",
36642 month = aug,
36643 year = "1988",
36644 bibdate = "Wed Nov 26 12:13:45 MST 2025",
36645 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
36646 URL = "",
36647 acknowledgement = ack-nhfb,
36648 }
36649
36650 @TechReport{Knuth:1988:MW,
36651 author = "Donald E. Knuth and Tracy Larrabee and Paul M.
36652 Roberts",
36653 title = "Mathematical Writing",
36654 type = "Technical Report",
36655 number = "STAN-CS-88-1193",
36656 institution = inst-STAN-CS,
36657 address = inst-STAN-CS:adr,
36658 pages = "115",
36659 month = jan,
36660 year = "1988",
36661 bibdate = "Thu Nov 20 12:11:36 MST 2025",
36662 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
36663 URL = "http://www-db.stanford.edu/TR/CS-TR-88-1193.html",
36664 abstract = "This report is based on a course of the same name
36665 given at Stanford University during autumn quarter,
36666 1987. Here's the catalog description: CS 209.
36667 Mathematical Writing--Issues of technical writing and
36668 the effective presentation of mathematics and computer
36669 science. Preparation of theses, papers, books, and
36670 ``literate'' computer programs. A term paper on a topic
36671 of your choice; this paper may be used for credit in
36672 another course.",
36673 acknowledgement = ack-nhfb,
36674 xxnumber = "CS-TR-88-1193",
36675 }
36676
36677 @TechReport{Musen:1988:GMB,
36678 author = "Mark A. Musen",
36679 title = "Generation of Model-Based Knowledge-Acquisition Tools
36680 for Clinical-Trial Advice Systems",
36681 type = "Technical Report",
36682 number = "STAN-CS-88-1194",
36683 institution = inst-STAN-CS,
36684 address = inst-STAN-CS:adr,
36685 pages = "294",
36686 month = jan,
36687 year = "1988",
36688 bibdate = "Wed Nov 26 12:13:45 MST 2025",
36689 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
36690 URL = "",
36691 acknowledgement = ack-nhfb,
36692 }
36693
36694 @TechReport{Bar-Noy:1988:LBR,
36695 author = "A. Bar-Noy and N. Linial and D. Peleg",
36696 title = "A Lower Bound for Radio Broadcast",
36697 type = "Technical Report",
36698 number = "STAN-CS-88-1195",
36699 institution = inst-STAN-CS,
36700 address = inst-STAN-CS:adr,
36701 pages = "15",
36702 month = feb,
36703 year = "1988",
36704 bibdate = "Thu Nov 20 12:11:36 MST 2025",
36705 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
36706 URL = "http://www-db.stanford.edu/TR/CS-TR-88-1195.html",
36707 abstract = "A radio network is a synchronous network of processors
36708 that communicate by transmitting messages to their
36709 neighbors, where a processor receives a message in a
36710 given step if and only if it is silent in this step and
36711 precisely one of its neighbors transmits. In this paper
36712 we prove the existence of a family of radius-2 networks
36713 on n vertices for which any broadcast schedule requires
36714 at least $ \Omega ((\log n / \log n)^2) $ rounds of
36715 transmissions. This almost matches an upper bound of $
36716 O(\log_n) $ rounds for networks of radius 2 proved
36717 earlier by Bar-Yehuda, Goldreich, and Itai.",
36718 acknowledgement = ack-nhfb,
36719 xxnumber = "CS-TR-88-1195",
36720 }
36721
36722 @TechReport{Latombe:1988:MPU,
36723 author = "Jean-Claude Latombe",
36724 title = "Motion Planning with Uncertainty: The Preimage
36725 Backchaining Approach",
36726 type = "Technical Report",
36727 number = "STAN-CS-88-1196",
36728 institution = inst-STAN-CS,
36729 address = inst-STAN-CS:adr,
36730 pages = "i + 62",
36731 month = mar,
36732 year = "1988",
36733 bibdate = "Thu Nov 20 12:11:36 MST 2025",
36734 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
36735 URL = "http://www-db.stanford.edu/TR/CS-TR-88-1196.html",
36736 abstract = "This paper addresses the problem of planning robot
36737 motions in the presence of uncertainty. It explores an
36738 approach to this problem, known as the preimage
36739 backchaining approach. Basically, a preimage is a
36740 region in space, such that if the robot executes a
36741 certain motion command from within this region, it is
36742 guaranteed to attain a target and to terminate into it.
36743 Preimage backchaining consists of reasoning backward
36744 from a given goal region, by computing preimages of the
36745 goal, and then recursively preimages of the preimages,
36746 until some preimages include the initial region where
36747 it is known at planning time that the robot will be
36748 before executing the motion plan.",
36749 acknowledgement = ack-nhfb,
36750 pdfpages = "63",
36751 xxnumber = "CS-TR-88-1196",
36752 }
36753
36754 @TechReport{Cheriton:1988:VMI,
36755 author = "D. R. Cheriton and Anoop Gupta and P. D. Boyle and H.
36756 A. Goosen",
36757 title = "The {VMP} Multiprocessor: Initial Experience,
36758 Refinements and Performance Evaluation",
36759 type = "Technical Report",
36760 number = "STAN-CS-88-1197 (CSL-TR-88-354)",
36761 institution = inst-STAN-CS,
36762 address = inst-STAN-CS:adr,
36763 pages = "24",
36764 month = mar,
36765 year = "1988",
36766 bibdate = "Thu Nov 20 12:11:36 MST 2025",
36767 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
36768 URL = "http://www-db.stanford.edu/TR/CS-TR-88-1197.html",
36769 abstract = "VMP is an experimental multiprocessor being developed
36770 at Stanford University, suitable for high-performance
36771 workstations and server machines. Its primary novelty
36772 lies in the use of software management of the
36773 preprocessor caches and the design decisions in the
36774 cache and bus that make this approach feasible. The
36775 design and some uniprocessor trace-driven simulations
36776 indicating its performance have been reported
36777 previously. In this paper, we present our initial
36778 experience with the VMP design based on a running
36779 prototype as well as various refinements to the design.
36780 Performance evaluation is based both on measurement of
36781 actual execution as well as trace-driven simulation of
36782 multiprocessor executions from the Mach operating
36783 system.",
36784 acknowledgement = ack-nhfb,
36785 xxnumber = "CS-TR-88-1197",
36786 }
36787
36788 @TechReport{Lamping:1988:USP,
36789 author = "John Lamping",
36790 title = "A Unified System of Parameterization for Programming
36791 Languages",
36792 type = "Technical Report",
36793 number = "STAN-CS-88-1198",
36794 institution = inst-STAN-CS,
36795 address = inst-STAN-CS:adr,
36796 pages = "141",
36797 month = apr,
36798 year = "1988",
36799 bibdate = "Wed Nov 26 12:13:45 MST 2025",
36800 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
36801 URL = "",
36802 acknowledgement = ack-nhfb,
36803 remark = "This is the author's thesis.",
36804 }
36805
36806 @TechReport{Buning:1988:PVA,
36807 author = "H. K. Buning and T. Lettman and E. W. Mayr",
36808 title = "Projections of Vector Addition System Reachability
36809 Sets are Semilinear",
36810 type = "Technical Report",
36811 number = "STAN-CS-88-1199",
36812 institution = inst-STAN-CS,
36813 address = inst-STAN-CS:adr,
36814 pages = "9",
36815 month = mar,
36816 year = "1988",
36817 bibdate = "Thu Nov 20 12:11:36 MST 2025",
36818 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
36819 URL = "http://www-db.stanford.edu/TR/CS-TR-88-1199.html",
36820 abstract = "The reachability sets of Vector Addition Systems of
36821 dimension six or more can be non-semilinear. This may
36822 be one reason why the inclusion problem (as well as the
36823 equality problem) for reachability sets of vector
36824 addition systems in general is undecidable, even though
36825 the reachability problem itself is known to be
36826 decidable. We show that any one-dimensional projection
36827 of the reachability set of an arbitrary vector addition
36828 system is semilinear, and hence, ``simple''.",
36829 acknowledgement = ack-nhfb,
36830 xxnumber = "CS-TR-88-1199",
36831 }
36832
36833 @TechReport{Anderson:1988:PAA,
36834 author = "R. J. Anderson and E. W. Mayr and M. K. Warmuth",
36835 title = "Parallel Approximation Algorithms for Bin Packing",
36836 type = "Technical Report",
36837 number = "STAN-CS-88-1200",
36838 institution = inst-STAN-CS,
36839 address = inst-STAN-CS:adr,
36840 pages = "16",
36841 month = mar,
36842 year = "1988",
36843 bibdate = "Thu Nov 20 12:11:36 MST 2025",
36844 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
36845 URL = "http://www-db.stanford.edu/TR/CS-TR-88-1200.html",
36846 abstract = "We study the parallel complexity of polynomial
36847 heuristics for the bin packing problem. We show that
36848 some well-known (and simple) methods like first-fit-
36849 decreasing are P-complete, and it is hence very
36850 unlikely that they can be efficiently parallelized. On
36851 the other hand, we exhibit an optimal NC algorithm that
36852 achieves the same performance bound as does FFD.
36853 Finally, we discuss parallelization of polynomial
36854 approximation algorithms for bin packing based on
36855 discretization.",
36856 acknowledgement = ack-nhfb,
36857 xxnumber = "CS-TR-88-1200",
36858 }
36859
36860 @TechReport{Flajolet:1988:SAG,
36861 author = "Philippe Flajolet and Andrew Odlyzko",
36862 title = "Singularity Analysis of Generating Functions",
36863 type = "Technical Report",
36864 number = "STAN-CS-88-1201",
36865 institution = inst-STAN-CS,
36866 address = inst-STAN-CS:adr,
36867 pages = "25",
36868 month = apr,
36869 year = "1988",
36870 bibdate = "Wed Nov 26 12:13:45 MST 2025",
36871 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
36872 URL = "",
36873 acknowledgement = ack-nhfb,
36874 author-dates = "Philippe Flajolet (1 December 1948--22 March 2011)",
36875 }
36876
36877 @TechReport{Baudinet:1988:PTP,
36878 author = "Marianne Baudinet",
36879 title = "Proving Termination Properties of {PROLOG} Programs: a
36880 Semantic Approach",
36881 type = "Technical Report",
36882 number = "STAN-CS-88-1202",
36883 institution = inst-STAN-CS,
36884 address = inst-STAN-CS:adr,
36885 pages = "14",
36886 month = mar,
36887 year = "1988",
36888 bibdate = "Wed Nov 26 12:13:45 MST 2025",
36889 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
36890 URL = "",
36891 acknowledgement = ack-nhfb,
36892 }
36893
36894 @TechReport{Baudinet:1988:STL,
36895 author = "Marianne Baudinet",
36896 title = "On the Semantics of Temporal Logic Programming",
36897 type = "Technical Report",
36898 number = "STAN-CS-88-1203",
36899 institution = inst-STAN-CS,
36900 address = inst-STAN-CS:adr,
36901 pages = "30",
36902 month = jun,
36903 year = "1988",
36904 bibdate = "Thu Nov 20 12:11:36 MST 2025",
36905 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
36906 URL = "http://www-db.stanford.edu/TR/CS-TR-88-1203.html",
36907 abstract = "Recently, several researchers have suggested directly
36908 exploiting in a programming language temporal logic's
36909 ability to describe changing worlds. The resulting
36910 languages are quite diverse. They are based on
36911 different subsets of temporal logic and use a variety
36912 of execution mechanisms. So far, little attention has
36913 been paid to the formal semantics of these languages.
36914 In this paper, we study the semantics of an instance of
36915 temporal logic programming, namely, the TEMPLOG
36916 language defined by Abadi and Manna. We first give
36917 declarative semantics for TEMPLOG, in model-theoretic
36918 and in fixpoint terms. Then, we study its operational
36919 semantics and prove soundness and completeness theorems
36920 for the temporal-resolution proof method underlying its
36921 execution mechanism.",
36922 acknowledgement = ack-nhfb,
36923 xxnumber = "CS-TR-88-1203",
36924 }
36925
36926 @TechReport{Armstrong:1988:DRC,
36927 author = "Brian Stewart Randall Armstrong",
36928 title = "Dynamics for Robot Control: Friction Modeling and
36929 Ensuring Excitation During Parameter Identification",
36930 type = "Technical Report",
36931 number = "STAN-CS-88-1205",
36932 institution = inst-STAN-CS,
36933 address = inst-STAN-CS:adr,
36934 pages = "198",
36935 month = may,
36936 year = "1988",
36937 bibdate = "Wed Nov 26 12:13:45 MST 2025",
36938 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
36939 URL = "",
36940 acknowledgement = ack-nhfb,
36941 remark = "This is the author's thesis.",
36942 }
36943
36944 @TechReport{Weening:1988:PLS,
36945 author = "Joseph S. Weening",
36946 title = "A Parallel {Lisp} Simulator",
36947 type = "Technical Report",
36948 number = "STAN-CS-88-1206",
36949 institution = inst-STAN-CS,
36950 address = inst-STAN-CS:adr,
36951 pages = "27",
36952 month = may,
36953 year = "1988",
36954 bibdate = "Thu Nov 20 12:11:36 MST 2025",
36955 bibsource = "http://www.math.utah.edu/pub/tex/bib/common-lisp.bib;
36956 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
36957 URL = "http://www-db.stanford.edu/TR/CS-TR-88-1206.html",
36958 abstract = "CSIM is a simulator for parallel Lisp, based on a
36959 continuation passing interpreter. It models a
36960 shared-memory multiprocessor executing programs written
36961 in Common Lisp, extended with several primitives for
36962 creating and controlling processes. This paper
36963 describes the structure of the simulator, measures its
36964 performance, and gives an examples its use with a
36965 parallel Lisp program.",
36966 acknowledgement = ack-nhfb,
36967 xxnumber = "CS-TR-88-1206",
36968 }
36969
36970 @TechReport{Burdick:1988:KAD,
36971 author = "Joel W. Burdick",
36972 title = "Kinematic Analysis and Design of Redundant Robot
36973 Manipulators",
36974 type = "Technical Report",
36975 number = "STAN-CS-88-1207",
36976 institution = inst-STAN-CS,
36977 address = inst-STAN-CS:adr,
36978 pages = "267",
36979 month = mar,
36980 year = "1988",
36981 bibdate = "Wed Nov 26 12:13:45 MST 2025",
36982 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
36983 URL = "",
36984 acknowledgement = ack-nhfb,
36985 remark = "This is the author's thesis.",
36986 }
36987
36988 @TechReport{Feder:1988:T,
36989 author = "Tomas Feder",
36990 title = "Toetjes",
36991 type = "Technical Report",
36992 number = "STAN-CS-88-1208",
36993 institution = inst-STAN-CS,
36994 address = inst-STAN-CS:adr,
36995 pages = "13",
36996 month = jun,
36997 year = "1988",
36998 bibdate = "Thu Nov 20 12:11:36 MST 2025",
36999 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
37000 URL = "http://www-db.stanford.edu/TR/CS-TR-88-1208.html",
37001 abstract = "A number is secretly chosen from the interval [0, 1],
37002 and n players try to guess this number. When the secret
37003 number is revealed, the player with the closest guess
37004 wins. We describe an optimal strategy for a version of
37005 this game.",
37006 acknowledgement = ack-nhfb,
37007 xxnumber = "CS-TR-88-1208",
37008 }
37009
37010 @TechReport{Goldberg:1988:CAG,
37011 author = "A. V. Goldberg and S. A. Plotkin and E. Tardos",
37012 title = "Combinatorial Algorithms for the Generalized
37013 Circulation Problem",
37014 type = "Technical Report",
37015 number = "STAN-CS-88-1209",
37016 institution = inst-STAN-CS,
37017 address = inst-STAN-CS:adr,
37018 pages = "36",
37019 month = jun,
37020 year = "1988",
37021 bibdate = "Thu Nov 20 12:11:36 MST 2025",
37022 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
37023 URL = "http://www-db.stanford.edu/TR/CS-TR-88-1209.html",
37024 abstract = "We consider a generalization of the maximum flow
37025 problem in which the amounts of flow entering and
37026 leaving an arc are linearly related. More precisely, if
37027 x(e) units of flow enter an arc e, x(e) gamma(e) units
37028 arrive at the other end. For instance, nodes of the
37029 graph can correspond to different currencies, with the
37030 multipliers being the exchange rates. We require
37031 conservation of flow at every node except a given
37032 source node. The goal is to maximize the amount of flow
37033 excess at the source. This problem is a special case of
37034 linear programming, and therefore can be solved in
37035 polynomial time. In this paper we present the first
37036 polynomial time combinatorial algorithms for this
37037 problem. The algorithms are simple and intuitive.",
37038 acknowledgement = ack-nhfb,
37039 xxnumber = "CS-TR-88-1209",
37040 }
37041
37042 @TechReport{Bronstein:1988:SFS,
37043 author = "Alexandre Bronstein and Carolyn L. Talcott",
37044 title = "String-Functional Semantics for Formal Verification of
37045 Synchronous Circuits",
37046 type = "Technical Report",
37047 number = "STAN-CS-88-1210",
37048 institution = inst-STAN-CS,
37049 address = inst-STAN-CS:adr,
37050 pages = "62",
37051 month = jun,
37052 year = "1988",
37053 bibdate = "Thu Nov 20 12:11:36 MST 2025",
37054 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
37055 URL = "http://www-db.stanford.edu/TR/CS-TR-88-1210.html",
37056 abstract = "A new functional semantics is proposed for synchronous
37057 circuits, as a basis for reasoning formally about that
37058 class of hardware systems. Technically, we define an
37059 extensional semantics with monotonic length-preserving
37060 functions on finite strings, and an intensional
37061 semantics based on functionals on those functions. As
37062 support for the semantics we prove the equivalence of
37063 the extensional semantics with a simple operational
37064 semantics, as well as a characterization of circuits
37065 which obey the ``every loop is clocked'' design rule.
37066 Also, we develop the foundations in complete detail
37067 both to increase confidence in the theory, and as a
37068 prerequisite to its future mechanization.",
37069 acknowledgement = ack-nhfb,
37070 xxnumber = "CS-TR-88-1210",
37071 }
37072
37073 @TechReport{Goldberg:1988:STP,
37074 author = "A. V. Goldberg and S. A. Plotkin and P. M. Vaidya",
37075 title = "Sublinear-Time Parallel Algorithms",
37076 type = "Technical Report",
37077 number = "STAN-CS-88-1211",
37078 institution = inst-STAN-CS,
37079 address = inst-STAN-CS:adr,
37080 pages = "27",
37081 month = jun,
37082 year = "1988",
37083 bibdate = "Thu Nov 20 12:11:36 MST 2025",
37084 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
37085 URL = "http://www-db.stanford.edu/TR/CS-TR-88-1211.html",
37086 abstract = "This paper presents the first sublinear-time
37087 deterministic parallel algorithms for bipartite
37088 matching and several related problems, including
37089 maximal node-disjoint paths, depth-first search, and
37090 flows in zero-one networks. Our results are based on a
37091 better understanding of the combinatorial structure of
37092 the above problems, which leads to new algorithmic
37093 techniques. In particular, we show how to use maximal
37094 matching to extend, in parallel, a current set of
37095 node-disjoint paths and how to take advantage of the
37096 parallelism that arises when a large number of nodes
37097 are ``active'' during an execution of a push/relabel
37098 network flow algorithm. We also show how to apply our
37099 techniques to design parallel algorithms for the
37100 weighted versions of the above problems. In particular,
37101 we present sublinear-time deterministic parallel
37102 algorithms for finding a minimum-weight bipartite
37103 matching and for finding a minimum-cost flow in a
37104 network with zero-one capacities, if the weights are
37105 polynomially bounded integers.",
37106 acknowledgement = ack-nhfb,
37107 xxnumber = "CS-TR-88-1211",
37108 }
37109
37110 @TechReport{Worley:1988:IRI,
37111 author = "Patrick Haven Worley",
37112 title = "Information Requirements and the Implications for
37113 Parallel Computation",
37114 type = "Technical Report",
37115 number = "STAN-CS-88-1212",
37116 institution = inst-STAN-CS,
37117 address = inst-STAN-CS:adr,
37118 pages = "148",
37119 month = jun,
37120 year = "1988",
37121 bibdate = "Wed Nov 26 12:13:45 MST 2025",
37122 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
37123 URL = "",
37124 acknowledgement = ack-nhfb,
37125 remark = "This is the author's thesis.",
37126 }
37127
37128 @TechReport{Cheriton:1988:ERS,
37129 author = "David R. Cheriton",
37130 title = "Exploiting Recursion to Simplify {RPC} Communication
37131 Architectures",
37132 type = "Technical Report",
37133 number = "STAN-CS-88-1213 (CSL-TR-88-360, AD-A198711)",
37134 institution = inst-STAN-CS,
37135 address = inst-STAN-CS:adr,
37136 pages = "14",
37137 month = jun,
37138 year = "1988",
37139 bibdate = "Wed Nov 26 12:13:45 MST 2025",
37140 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
37141 URL = "",
37142 abstract = "Current communication architectures suffer from a
37143 growing collection of protocols in the host operating
37144 systems, gateways and applications, resulting in
37145 increasing implementation and maintenance cost,
37146 unreliability and difficulties with interoperability.
37147 The {\em remote procedure call (RPC)} approach has been
37148 used in some distributed systems to contain the
37149 diversity of application layer protocols within the
37150 procedure call abstraction. However, the same technique
37151 cannot be applied to lower layer protocols without
37152 violating the strict notion of layers.\par
37153
37154 In this paper, we show how the RPC approach can be used
37155 for lower layer protocols so that the resulting ``layer
37156 violations'' generate a simple recursive structure. The
37157 benefits of exploiting recursion in a communication
37158 architecture are similar to those realized from its use
37159 as a programming technique; the resulting protocol
37160 architecture minimizes the complexity and duplication
37161 of protocols and mechanism, thereby reducing the cost
37162 of implementation and verification. We also sketch a
37163 redesigned DoD Internet architecture that illustrates
37164 the potential benefits of this approach.",
37165 acknowledgement = ack-nhfb,
37166 pdfpages = "15",
37167 }
37168
37169 @TechReport{Deering:1988:MRI,
37170 author = "Stephen E. Deering",
37171 title = "Multicast Routing in Internetworks and Extended
37172 {LANs}",
37173 type = "Technical Report",
37174 number = "STAN-CS-88-1214 (CSL-TR-88-361, AD-A200911)",
37175 institution = inst-STAN-CS,
37176 address = inst-STAN-CS:adr,
37177 pages = "14",
37178 month = jul,
37179 year = "1988",
37180 bibdate = "Thu Nov 20 12:11:36 MST 2025",
37181 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
37182 URL = "http://www-db.stanford.edu/TR/CS-TR-88-1214.html",
37183 abstract = "Multicasting is used within local-area networks to
37184 make distributed applications more robust and more
37185 efficient. The growing need to distribute applications
37186 across multiple, interconnected networks, and the
37187 increasing availability of high-performance,
37188 high-capacity switching nodes and networks, lead us to
37189 consider providing LAN-style multicasting across an
37190 internetwork. In this paper, we propose extensions to
37191 two common internetwork routing algorithms ---
37192 distance-vector routing and link-state routing --- to
37193 support low-delay datagram multicasting. We also
37194 suggest modifications to the single-spanning-tree
37195 routing algorithm, commonly used by link-layer bridges,
37196 to reduce the costs of multicasting in large extended
37197 LANs. Finally, we show how different link-layer and
37198 network-layer multicast routing algorithms can be
37199 combined hierarchically to support multicasting across
37200 large, heterogeneous internetworks.",
37201 acknowledgement = ack-nhfb,
37202 pdfpages = "15",
37203 xxnumber = "CS-TR-88-1214",
37204 }
37205
37206 @TechReport{Stolfi:1988:PCG,
37207 author = "Jorge Stolfi",
37208 title = "Primitives for Computational Geometry",
37209 type = "Technical Report",
37210 number = "STAN-CS-88-1215",
37211 institution = inst-STAN-CS,
37212 address = inst-STAN-CS:adr,
37213 pages = "236",
37214 month = jun,
37215 year = "1988",
37216 bibdate = "Wed Nov 26 12:13:45 MST 2025",
37217 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
37218 URL = "",
37219 acknowledgement = ack-nhfb,
37220 remark = "This is the author's thesis.",
37221 }
37222
37223 @TechReport{Schaffer:1988:API,
37224 author = "Alejandro A. Schaffer",
37225 title = "Algorithmic Problems on Intersection Graphs",
37226 type = "Technical Report",
37227 number = "STAN-CS-88-1216",
37228 institution = inst-STAN-CS,
37229 address = inst-STAN-CS:adr,
37230 pages = "139",
37231 month = jul,
37232 year = "1988",
37233 bibdate = "Wed Nov 26 12:13:45 MST 2025",
37234 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
37235 URL = "",
37236 acknowledgement = ack-nhfb,
37237 remark = "This is the author's thesis.",
37238 }
37239
37240 @TechReport{Brooks:1988:TVD,
37241 author = "Kenneth P. Brooks",
37242 title = "A Two-View Document Editor with User-Definable
37243 Document Structure",
37244 type = "Technical Report",
37245 number = "STAN-CS-88-1217",
37246 institution = inst-STAN-CS,
37247 address = inst-STAN-CS:adr,
37248 pages = "203",
37249 month = jun,
37250 year = "1988",
37251 bibdate = "Wed Nov 26 12:13:45 MST 2025",
37252 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
37253 URL = "",
37254 acknowledgement = ack-nhfb,
37255 remark = "This is the author's thesis.",
37256 }
37257
37258 @TechReport{Bar-Noy:1988:SMA,
37259 author = "Amotz Bar-Noy and David Peleg",
37260 title = "Square Meshes are not Always Optimal",
37261 type = "Technical Report",
37262 number = "STAN-CS-88-1218",
37263 institution = inst-STAN-CS,
37264 address = inst-STAN-CS:adr,
37265 pages = "28",
37266 month = aug,
37267 year = "1988",
37268 bibdate = "Thu Nov 20 12:11:36 MST 2025",
37269 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
37270 URL = "http://www-db.stanford.edu/TR/CS-TR-88-1218.html",
37271 abstract = "In this paper we consider mesh connected computers
37272 with multiple buses, providing broadcast facilities
37273 along rows and columns.",
37274 acknowledgement = ack-nhfb,
37275 xxnumber = "CS-TR-88-1218",
37276 }
37277
37278 @TechReport{Flajolet:1988:FCE,
37279 author = "Philippe Flajolet and Donald E. Knuth and Boris
37280 Pittel",
37281 title = "The First Cycles in an Evolving Graph",
37282 type = "Technical Report",
37283 number = "STAN-CS-88-1219",
37284 institution = inst-STAN-CS,
37285 address = inst-STAN-CS:adr,
37286 pages = "49",
37287 month = sep,
37288 year = "1988",
37289 bibdate = "Wed Nov 26 12:13:45 MST 2025",
37290 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
37291 URL = "",
37292 acknowledgement = ack-nhfb,
37293 author-dates = "Philippe Flajolet (1 December 1948--22 March 2011)",
37294 remark = "No PDF file found in DTIC or NTRL. This report is
37295 summarized in a 3-page progress report by Donald E.
37296 Knuth at
37297 https://apps.dtic.mil/sti/tr/pdf/ADA200895.pdf",
37298 }
37299
37300 @TechReport{Vistnes:1988:CTA,
37301 author = "Richard L. Vistnes",
37302 title = "Computer Texture Analysis and Segmentation",
37303 type = "Technical Report",
37304 number = "STAN-CS-88-1220",
37305 institution = inst-STAN-CS,
37306 address = inst-STAN-CS:adr,
37307 pages = "186",
37308 month = jun,
37309 year = "1988",
37310 bibdate = "Wed Nov 26 12:13:45 MST 2025",
37311 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
37312 URL = "",
37313 acknowledgement = ack-nhfb,
37314 remark = "This is the author's thesis.",
37315 }
37316
37317 @TechReport{Beigel:1988:QLR,
37318 author = "Richard Beigel",
37319 title = "Query-Limited Reducibilities",
37320 type = "Technical Report",
37321 number = "STAN-CS-88-1221",
37322 institution = inst-STAN-CS,
37323 address = inst-STAN-CS:adr,
37324 pages = "144",
37325 month = jul,
37326 year = "1988",
37327 bibdate = "Wed Nov 26 12:13:45 MST 2025",
37328 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
37329 URL = "",
37330 acknowledgement = ack-nhfb,
37331 remark = "This is the author's thesis.",
37332 }
37333
37334 @TechReport{Hailpern:1988:LBM,
37335 author = "Max Hailpern",
37336 title = "Load Balancing for Massively-Parallel Soft-Real-Time
37337 Systems",
37338 type = "Technical Report",
37339 number = "STAN-CS-88-1222 (KSL-88-62, AD-A200912)",
37340 institution = inst-STAN-CS,
37341 address = inst-STAN-CS:adr,
37342 pages = "ii + 18",
37343 day = "30",
37344 month = aug,
37345 year = "1988",
37346 bibdate = "Wed Nov 26 12:13:45 MST 2025",
37347 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
37348 URL = "",
37349 abstract = "Global load balancing, if practical, would allow the
37350 effective use of massively-parallel ensemble
37351 architectures for large soft-real-time problems. The
37352 challenge is to replace quick global communications,
37353 which is impractical in p massively-parallel system,
37354 with statistical techniques. In this vein, we propose
37355 novel approach to decentralized load balancing based on
37356 statistical time-series analysis. Each site estimates
37357 the system-wide average load using information about
37358 past loads of individual sites and attempts to equal
37359 that average. This estimation process is practical
37360 because the soft-real-time systems we are interested in
37361 naturally exhibit loads that are periodic, in a
37362 statistical sense akin to seasonality in econometrics.
37363 We show how this load-characterization technique can be
37364 the foundation for a load-balancing system in an
37365 architecture employing cut-through routing and an
37366 efficient multicast protocol.",
37367 acknowledgement = ack-nhfb,
37368 pdfpages = "20",
37369 }
37370
37371 @TechReport{Knuth:1988:ET,
37372 author = "Donald E. Knuth",
37373 title = "The Errors of {\TeX}",
37374 type = "Technical Report",
37375 number = "STAN-CS-88-1223",
37376 institution = inst-STAN-CS,
37377 address = inst-STAN-CS:adr,
37378 pages = "75",
37379 month = sep,
37380 year = "1988",
37381 bibdate = "Wed Nov 26 12:13:45 MST 2025",
37382 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
37383 URL = "",
37384 acknowledgement = ack-nhfb,
37385 }
37386
37387 @TechReport{Singh:1988:DBC,
37388 author = "Vineet Singh",
37389 title = "Distributing Backward-Chaining Deductions to Multiple
37390 Processors",
37391 type = "Technical Report",
37392 number = "STAN-CS-88-1224",
37393 institution = inst-STAN-CS,
37394 address = inst-STAN-CS:adr,
37395 pages = "222",
37396 month = apr,
37397 year = "1988",
37398 bibdate = "Wed Nov 26 12:13:45 MST 2025",
37399 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
37400 URL = "",
37401 acknowledgement = ack-nhfb,
37402 remark = "This is the author's thesis.",
37403 }
37404
37405 @TechReport{Mayr:1988:PAA,
37406 author = "Ernst W. Mayr",
37407 title = "Parallel Approximation Algorithms",
37408 type = "Technical Report",
37409 number = "STAN-CS-88-1225",
37410 institution = inst-STAN-CS,
37411 address = inst-STAN-CS:adr,
37412 pages = "17",
37413 month = sep,
37414 year = "1988",
37415 bibdate = "Thu Nov 20 12:11:36 MST 2025",
37416 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
37417 URL = "http://www-db.stanford.edu/TR/CS-TR-88-1225.html",
37418 abstract = "Many problems of great practical importance are hard
37419 to solve computationally, at least if exact solutions
37420 are required. We survey a number of (NP- or P-complete)
37421 problems for which fast parallel approximation
37422 algorithms are known: The 0-1 knapsack problem,
37423 binpacking, the minimal makeshift problem, the list
37424 scheduling problem, greedy scheduling, and the high
37425 density subgraph problem. Algorithms for these problems
37426 are presented highlighting the underlying techniques
37427 and principles, and several types of parallel
37428 approximation schemes are exhibited.",
37429 acknowledgement = ack-nhfb,
37430 xxnumber = "CS-TR-88-1225",
37431 }
37432
37433 @TechReport{Hayes-Roth:1988:MIS,
37434 author = "Barbara Hayes-Roth",
37435 title = "Making Intelligent Systems Adaptive",
37436 type = "Technical Report",
37437 number = "STAN-CS-88-1226 (KSL-88-64, AD-A200913)",
37438 institution = inst-STAN-CS,
37439 address = inst-STAN-CS:adr,
37440 pages = "iv + 24",
37441 month = jul,
37442 year = "1988",
37443 bibdate = "Thu Nov 20 12:11:36 MST 2025",
37444 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
37445 note = "To appear as a chapter in the book,
37446 \booktitle{Architectures for Intelligence}, edited by
37447 K. Van Lehn and published by Lawrence Erlbaum, 1988.",
37448 URL = "http://www-db.stanford.edu/TR/CS-TR-88-1226.html;
37449 https://apps.dtic.mil/sti/tr/pdf/ADA200913.pdf",
37450 abstract = "Contemporary intelligent systems are isolated
37451 problem-solvers. They accept particular classes of
37452 problems, reason about them, perhaps request additional
37453 information, and eventually produce solutions. By
37454 contrast, human beings and other intelligent animals
37455 continuously adapt to the demands and opportunities
37456 presented by a dynamic environment. Adaptation plays a
37457 critical role in everyday behaviors, such as conducting
37458 a conversation, as well as in sophisticated
37459 professional behaviors, such as monitoring critically
37460 ill medical patients. To make intelligent systems
37461 similarly adaptive, we must augment their reasoning
37462 capabilities with capabilities for perception and
37463 action. Equally important, we must endow them with an
37464 attentional mechanism to allocate their limited
37465 computational resources among competing perceptions,
37466 actions, and cognitions, in real time. In this paper,
37467 we discuss functional objectives for ``adaptive
37468 intelligent systems,'' an architecture designed to
37469 achieve those objectives, and our continuing study of
37470 both objectives and architecture in the context of
37471 particular tasks.",
37472 acknowledgement = ack-nhfb,
37473 pdfpages = "28",
37474 remark = "Wrong PDF in NTRL archive. Found in DTIC archive.
37475 Cover page says April 1988, revised July 1988.",
37476 xxnumber = "CS-TR-88-1226",
37477 }
37478
37479 @TechReport{Ahuja:1988:FMC,
37480 author = "Ravindra K. Ahuja and Andrew V. Goldberg and James B.
37481 Orlin and Robert E. Tarjan",
37482 title = "Finding Minimum-Cost Flows by Double Scaling",
37483 type = "Technical Report",
37484 number = "STAN-CS-88-1227",
37485 institution = inst-STAN-CS,
37486 address = inst-STAN-CS:adr,
37487 pages = "iv + 27",
37488 month = sep,
37489 year = "1988",
37490 bibdate = "Thu Nov 20 12:11:36 MST 2025",
37491 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
37492 URL = "http://www-db.stanford.edu/TR/CS-TR-88-1227.html",
37493 abstract = "Several researchers have recently developed new
37494 techniques that give fast algorithms for the
37495 minimum-cost flow problem. In this paper we combine
37496 several of these techniques to yield an algorithm
37497 running in $ O(n m \log \log U \log (n C)) $ time on
37498 networks with $n$ vertices, $m$ edges, maximum arc
37499 capacity $U$, and maximum arc cost magnitude $C$. The
37500 major techniques used are the capacity-scaling approach
37501 of Edmonds and Karp, the excess-scaling approach of
37502 Ahuja and Orlin, the cost-scaling approach Goldberg and
37503 Tarjan, and the dynamic tree data structure of Sleator
37504 and Tarjan. For nonsparse graphs with large maximum arc
37505 capacity, we obtain a similar but slightly better
37506 bound. We also obtain a slightly better bound for the
37507 (noncapacitated) transportation problem. In addition,
37508 we discuss a capacity-bounding approach to the
37509 minimum-cost flow problem.",
37510 acknowledgement = ack-nhfb,
37511 pdfpages = "32",
37512 xxnumber = "CS-TR-88-1227",
37513 }
37514
37515 @TechReport{Goldberg:1988:PAF,
37516 author = "A. V. Goldberg and R. E. Tarjan",
37517 title = "A Parallel Algorithm for Finding a Blocking Flow in an
37518 Acyclic Network",
37519 type = "Technical Report",
37520 number = "STAN-CS-88-1228",
37521 institution = inst-STAN-CS,
37522 address = inst-STAN-CS:adr,
37523 pages = "9",
37524 month = nov,
37525 year = "1988",
37526 bibdate = "Thu Nov 20 12:11:36 MST 2025",
37527 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
37528 URL = "http://www-db.stanford.edu/TR/CS-TR-88-1228.html",
37529 abstract = "We propose a simple parallel algorithm for finding a
37530 blocking flow in an acyclic network. On an $n$-vertex,
37531 $m$-arc network, our algorithm runs in $ O(n \log n) $
37532 time and $ O(n m) $ space using an m-processor EREW
37533 PRAM. A consequence of our algorithm is an $ O(n^2
37534 (\log n) \log (n C)) $-time, $ O(n m) $-space,
37535 $m$-processor algorithm for the minimum-cost
37536 circulation problem, on a network with integer arc
37537 capacities of magnitude at most $C$.",
37538 acknowledgement = ack-nhfb,
37539 xxnumber = "CS-TR-88-1228",
37540 }
37541
37542 @TechReport{Hayes-Roth:1988:DIWa,
37543 author = "Barbara Hayes-Roth and Michael Hewett and Richard
37544 Washington and Rattikorn Hewett and Adam Seiver",
37545 title = "Distributing Intelligence within an Individual",
37546 type = "Technical Report",
37547 number = "STAN-CS-88-1229 (KSL-88-50)",
37548 institution = inst-STAN-CS,
37549 address = inst-STAN-CS:adr,
37550 pages = "23",
37551 month = nov,
37552 year = "1988",
37553 bibdate = "Thu Nov 20 12:11:36 MST 2025",
37554 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
37555 URL = "http://www-db.stanford.edu/TR/CS-TR-88-1229.html",
37556 abstract = "Distributed artificial intelligence (DAI) refers to
37557 systems in which decentralized, cooperative agents work
37558 synergistically to perform a task. Alternative
37559 specifications of DAI resemble particular biological or
37560 social systems, such as teams, contract nets, or
37561 societies. Our DAI model resembles a single individual
37562 comprising multiple loosely coupled agents for
37563 perception, action, and cognition functions. We
37564 demonstrate the DAI individual in the Guardian system
37565 for intensive-care monitoring and argue that it is more
37566 appropriate than the prevalent team model for a large
37567 class of similar applications.",
37568 acknowledgement = ack-nhfb,
37569 pdfpages = "26",
37570 xxauthor = "B. Hayes-Roth and M. Hewett and R. Washington and R.
37571 Hewett",
37572 xxnumber = "CS-TR-88-1229",
37573 }
37574
37575 @TechReport{Manna:1988:SVC,
37576 author = "Zohar Manna and Amir Pnueli",
37577 title = "Specification and Verification of Concurrent Programs
37578 by For-All Automata",
37579 type = "Technical Report",
37580 number = "STAN-CS-88-1230",
37581 institution = inst-STAN-CS,
37582 address = inst-STAN-CS:adr,
37583 pages = "41",
37584 month = nov,
37585 year = "1988",
37586 bibdate = "Thu Nov 20 12:11:36 MST 2025",
37587 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
37588 URL = "http://www-db.stanford.edu/TR/CS-TR-88-1230.html",
37589 abstract = "For-all automata are non-deterministic finite-state
37590 automata over infinite sequences. They differ from
37591 conventional automata in that a sequence is accepted if
37592 all runs of the automaton over the sequence are
37593 accepting. These automata are suggested as a formalism
37594 for the specification and verification of temporal
37595 properties of concurrent programs. It is shown that
37596 they are as expressive as extended temporal logic
37597 (ETL), and, in some cases, provide a more compact
37598 representation of properties than temporal logic. A
37599 structured diagram notation is suggested for the
37600 graphical representation of these automata. A single
37601 sound and complete proof rule is presented for proving
37602 that all computations of a program have the property
37603 specified by a for-all automaton.",
37604 acknowledgement = ack-nhfb,
37605 xxnumber = "CS-TR-88-1230",
37606 }
37607
37608 @TechReport{Cohn:1988:BOP,
37609 author = "Evan R. Cohn",
37610 title = "The Beta Operation: a Parallel Primitive",
37611 type = "Technical Report",
37612 number = "STAN-CS-88-1231",
37613 institution = inst-STAN-CS,
37614 address = inst-STAN-CS:adr,
37615 pages = "69",
37616 month = nov,
37617 year = "1988",
37618 bibdate = "Wed Nov 26 12:13:45 MST 2025",
37619 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
37620 URL = "",
37621 acknowledgement = ack-nhfb,
37622 remark = "This is the author's thesis.",
37623 }
37624
37625 @TechReport{Baudinet:1988:TLP,
37626 author = "Marianne Baudinet",
37627 title = "Temporal Logic Programming is Complete and
37628 Expressive",
37629 type = "Technical Report",
37630 number = "STAN-CS-88-1232",
37631 institution = inst-STAN-CS,
37632 address = inst-STAN-CS:adr,
37633 pages = "15",
37634 month = oct,
37635 year = "1988",
37636 bibdate = "Wed Nov 26 12:13:45 MST 2025",
37637 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
37638 URL = "",
37639 acknowledgement = ack-nhfb,
37640 }
37641
37642 @TechReport{Ross:1988:PSW,
37643 author = "Kenneth A. Ross",
37644 title = "A Procedural Semantics for Well Founded Negation in
37645 Logic Programs",
37646 type = "Technical Report",
37647 number = "STAN-CS-88-1233",
37648 institution = inst-STAN-CS,
37649 address = inst-STAN-CS:adr,
37650 pages = "ii + 29",
37651 month = dec,
37652 year = "1988",
37653 bibdate = "Thu Nov 20 12:11:36 MST 2025",
37654 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
37655 URL = "http://i.stanford.edu/pub/cstr/reports/cs/tr/88/1233/CS-TR-88-1233.pdf;
37656 http://www-db.stanford.edu/TR/CS-TR-88-1233.html",
37657 abstract = "We introduce global SLS-resolution, a procedural
37658 semantics for well-founded negation as defined by Van
37659 Gelder, Ross and Schlipf. Global SLS-resolution extends
37660 Przymusinski's SLS-resolution, and may be applied to
37661 all programs, whether locally stratified or not. Global
37662 SLS-resolution is defined in terms of global trees, a
37663 new data structure representing the dependence of goals
37664 on derived negative subgoals. We prove that global
37665 SLS-resolution is sound with respect to the
37666 well-founded semantics, and complete for
37667 non-floundering queries.",
37668 acknowledgement = ack-nhfb,
37669 pdfpages = "32",
37670 xxnumber = "CS-TR-88-1233",
37671 }
37672
37673 @TechReport{Pittel:1988:ANS,
37674 author = "Boris Pittel",
37675 title = "The Average Number of Stable Matchings",
37676 type = "Technical Report",
37677 number = "STAN-CS-88-1234",
37678 institution = inst-STAN-CS,
37679 address = inst-STAN-CS:adr,
37680 pages = "21",
37681 month = dec,
37682 year = "1988",
37683 bibdate = "Thu Nov 20 12:11:36 MST 2025",
37684 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
37685 URL = "http://www-db.stanford.edu/TR/CS-TR-88-1234.html",
37686 abstract = "The probable behavior of an instance of size n of the
37687 stable marriage problem, chosen uniformly at random, is
37688 studied.",
37689 acknowledgement = ack-nhfb,
37690 xxnumber = "CS-TR-88-1234",
37691 }
37692
37693 @TechReport{Knuth:1988:CME,
37694 author = "Donald E. Knuth",
37695 title = "Concrete Mathematics Errata",
37696 type = "Technical Report",
37697 number = "STAN-CS-88-1235",
37698 institution = inst-STAN-CS,
37699 address = inst-STAN-CS:adr,
37700 pages = "30",
37701 month = dec,
37702 year = "1988",
37703 bibdate = "Wed Nov 26 12:13:45 MST 2025",
37704 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
37705 URL = "",
37706 acknowledgement = ack-nhfb,
37707 }
37708
37709 @TechReport{Shoham:1988:TAR,
37710 author = "Yoav Shoham",
37711 title = "Time for Action: On the Relation between Time,
37712 Knowledge, and Action",
37713 type = "Technical Report",
37714 number = "STAN-CS-88-1236",
37715 institution = inst-STAN-CS,
37716 address = inst-STAN-CS:adr,
37717 pages = "16",
37718 month = dec,
37719 year = "1988",
37720 bibdate = "Thu Nov 20 12:11:36 MST 2025",
37721 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
37722 URL = "http://www-db.stanford.edu/TR/CS-TR-88-1236.html",
37723 abstract = "We consider the role played by the concept of action
37724 in AI. We first briefly summarize the advantages and
37725 limitations of past approaches to taking the concept as
37726 primitive, as embodied in the situation calculus and
37727 dynamic logic. We also briefly summarize the
37728 alternative, namely adopting a temporal framework, and
37729 point out its complementary advantages and limitations.
37730 We then propose a framework that retains the advantages
37731 of both viewpoints, and that ties the notion of action
37732 closely to that of knowledge. Specifically, we propose
37733 starting with the notion of time lines, and defining
37734 the notion of action as the ability to make certain
37735 choices among sets of time lines. Our definitions shed
37736 new light on the connection between time, action,
37737 knowledge and ignorance, choice-making, feasibility,
37738 and simultaneous reasoning about the same events at
37739 different levels of detail.",
37740 acknowledgement = ack-nhfb,
37741 xxnumber = "CS-TR-88-1236",
37742 }
37743
37744 @TechReport{Shoham:1988:BDK,
37745 author = "Yoav Shoham and Yoram Moses",
37746 title = "Belief as Defeasible Knowledge",
37747 type = "Technical Report",
37748 number = "STAN-CS-88-1237",
37749 institution = inst-STAN-CS,
37750 address = inst-STAN-CS:adr,
37751 pages = "11",
37752 month = dec,
37753 year = "1988",
37754 bibdate = "Thu Nov 20 12:11:36 MST 2025",
37755 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
37756 URL = "http://www-db.stanford.edu/TR/CS-TR-88-1237.html",
37757 abstract = "We investigate the relation between the notions of
37758 knowledge and belief. Contrary to the well-known slogan
37759 about knowledge being ``justified, true belief,'' we
37760 propose that belief be viewed as defeasible knowledge.
37761 Specifically, we offer a definition of belief as
37762 knowledge-relative-to-assumptions, and tie the
37763 definition to the notion of nonmonotonicity. Our
37764 definition has several advantages. First, it is short.
37765 Second, we do not need to add anything to the logic of
37766 knowledge: the right properties of belief fall out of
37767 the definition and the properties of knowledge. Third,
37768 the connection between knowledge and belief is derived
37769 from one fundamental principle, which is more
37770 enlightening than a collection of arbitrary-seeming
37771 axioms relating the two notions.",
37772 acknowledgement = ack-nhfb,
37773 xxnumber = "CS-TR-88-1237",
37774 }
37775
37776 @TechReport{Bothner:1988:ECL,
37777 author = "Per Magnus Bothner",
37778 title = "Efficiently Combining Logical Constraints with
37779 Functions",
37780 type = "Technical Report",
37781 number = "STAN-CS-88-1238",
37782 institution = inst-STAN-CS,
37783 address = inst-STAN-CS:adr,
37784 pages = "191",
37785 month = dec,
37786 year = "1988",
37787 bibdate = "Wed Nov 26 12:13:45 MST 2025",
37788 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
37789 URL = "",
37790 acknowledgement = ack-nhfb,
37791 }
37792
37793 @TechReport{Bar-Noy:1988:SMF,
37794 author = "Amotz Bar-Noy and Joseph Naor",
37795 title = "Sorting, Minimal Feedback Sets and {Hamilton} Paths in
37796 Tournaments",
37797 type = "Technical Report",
37798 number = "STAN-CS-88-1239",
37799 institution = inst-STAN-CS,
37800 address = inst-STAN-CS:adr,
37801 pages = "iv + 20",
37802 month = dec,
37803 year = "1988",
37804 bibdate = "Thu Nov 20 12:11:36 MST 2025",
37805 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
37806 URL = "http://www-db.stanford.edu/TR/CS-TR-88-1239.html",
37807 abstract = "We present a general method for translating sorting by
37808 comparisons algorithms to algorithms that compute a
37809 Hamilton path in a tournament. The translation is based
37810 on the relation between minimal feedback sets and
37811 Hamilton paths in tournaments. We prove that there is a
37812 one to one correspondence between the set of minimal
37813 feedback sets and the set of Hamilton paths. In the
37814 comparison model, all the tradeoffs for sorting between
37815 the number of processors and the number of rounds hold
37816 when a Hamilton path is computed. For the CRCW model,
37817 with O(n) processors, we show the following: (i) Two
37818 paths in a tournament can be merged in $ O(\log \log n)
37819 $ time (Valiant's algorithm): (ii) a Hamilton path can
37820 be computed in $ O(\log n) $ time (Cole's algorithm).
37821 This improves a previous algorithm for computing a
37822 Hamilton path.",
37823 acknowledgement = ack-nhfb,
37824 pdfpages = "24",
37825 xxnumber = "CS-TR-88-1239",
37826 }
37827
37828 @TechReport{Gafni:1988:SEC,
37829 author = "E. Gafni and J. Naor and P. Ragde",
37830 title = "On Separating the {EREW} and {CREW PRAM} Models",
37831 type = "Technical Report",
37832 number = "STAN-CS-88-1240",
37833 institution = inst-STAN-CS,
37834 address = inst-STAN-CS:adr,
37835 pages = "6",
37836 month = dec,
37837 year = "1988",
37838 bibdate = "Thu Nov 20 12:11:36 MST 2025",
37839 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
37840 URL = "http://www-db.stanford.edu/TR/CS-TR-88-1240.html",
37841 abstract = "In [6], Snir proposed the Selection Problem (searching
37842 in a sorted table) to show that the CREW PRAM is
37843 strictly more powerful than the EREW PRAM. This problem
37844 defines a partial function, that is, one that is
37845 defined only on a restricted set of inputs. Recognizing
37846 whether an arbitrary input belongs to this restricted
37847 set is hard for both CREW and EREW PRAMs. The existence
37848 of a total function that exhibits the power of the CREW
37849 model over the EREW model was an open problem. Here we
37850 solve this problem by generalizing the Selection
37851 problem to a Decision Tree problem which is defined on
37852 a full domain and to which Snir's lower bound
37853 applies.",
37854 acknowledgement = ack-nhfb,
37855 xxnumber = "CS-TR-88-1240",
37856 }
37857
37858 @TechReport{Knuth:1988:SH,
37859 author = "Donald Knuth and Rajeev Motwani and Boris Pittel",
37860 title = "Stable Husbands",
37861 type = "Technical Report",
37862 number = "STAN-CS-88-1241",
37863 institution = inst-STAN-CS,
37864 address = inst-STAN-CS:adr,
37865 pages = "16",
37866 month = dec,
37867 year = "1988",
37868 bibdate = "Wed Nov 26 12:13:45 MST 2025",
37869 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
37870 URL = "",
37871 acknowledgement = ack-nhfb,
37872 }
37873
37874 @TechReport{Wilkins:1988:ALT,
37875 author = "David C. Wilkins",
37876 title = "Apprenticeship Learning Techniques for Knowledge Based
37877 Systems",
37878 type = "Technical Report",
37879 number = "STAN-CS-88-1242",
37880 institution = inst-STAN-CS,
37881 address = inst-STAN-CS:adr,
37882 pages = "153",
37883 month = dec,
37884 year = "1988",
37885 bibdate = "Wed Nov 26 12:13:45 MST 2025",
37886 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
37887 URL = "",
37888 acknowledgement = ack-nhfb,
37889 remark = "This is the author's thesis.",
37890 }
37891
37892 @TechReport{Hayes-Roth:1988:DIWb,
37893 author = "Barbara Hayes-Roth and Michael Hewett and Richard
37894 Washington and Rattikorn Hewett and Adam Seiver",
37895 title = "Distributing Intelligence within an Individual",
37896 type = "Technical Report",
37897 number = "STAN-CS-88-1992 (KSL-88-50)",
37898 institution = inst-STAN-CS,
37899 address = inst-STAN-CS:adr,
37900 pages = "iv + 21",
37901 month = oct,
37902 year = "1988",
37903 bibdate = "Sat Nov 08 10:17:52 2025",
37904 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
37905 URL = "https://bitsavers.org/pdf/stanford/cs_techReports/CS-TR-88-1229_Distributing_Intelligence_Within_An_Individual.pdf",
37906 acknowledgement = ack-nhfb,
37907 remark = "The first four authors are from the Knowledge Systems
37908 Laboratory, and the fifth form the Palo Alto Veterans
37909 Administration Medical Center. To appear in
37910 \booktitle{Distributed Artificial Intelligence}, Vol.
37911 2, L. Gasser and M. N. Huhns (Eds.), Morgan Kaufman,
37912 1988.",
37913 }
37914
37915 @TechReport{DeMoor:1989:RSV,
37916 author = "Bart L. R. {De Moor} and Gene H. Golub",
37917 title = "The restricted singular value decomposition:
37918 properties and applications",
37919 type = "Technical Report",
37920 number = "STAN-CS-2001",
37921 institution = inst-STAN-CS,
37922 address = inst-STAN-CS:adr,
37923 pages = "69",
37924 month = "????",
37925 year = "1989",
37926 bibdate = "Mon Oct 24 10:35:29 MDT 1994",
37927 bibsource = "https://www.math.utah.edu/pub/bibnet/authors/g/golub-gene-h.bib;
37928 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
37929 URL = "",
37930 acknowledgement = ack-nhfb,
37931 author-dates = "Gene Howard Golub (February 29, 1932--November 16,
37932 2007)",
37933 keywords = "decomposition (mathematics)",
37934 xxnumber = "CS-TR-2001",
37935 }
37936
37937 @TechReport{DeMoor:1989:GSV,
37938 author = "Bart L. R. {De Moor} and Gene H. Golub",
37939 title = "Generalized singular value decompositions: a proposal
37940 for a standardized nomenclature",
37941 type = "Technical Report",
37942 number = "STAN-CS-2002",
37943 institution = inst-STAN-CS,
37944 address = inst-STAN-CS:adr,
37945 pages = "12",
37946 month = "????",
37947 year = "1989",
37948 bibdate = "Mon Oct 24 10:35:29 MDT 1994",
37949 bibsource = "https://www.math.utah.edu/pub/bibnet/authors/g/golub-gene-h.bib;
37950 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
37951 URL = "",
37952 acknowledgement = ack-nhfb,
37953 author-dates = "Gene Howard Golub (February 29, 1932--November 16,
37954 2007)",
37955 keywords = "decomposition (mathematics)",
37956 xxnumber = "CS-TR-2002",
37957 }
37958
37959 @TechReport{Elman:1989:IMC,
37960 author = "Howard C. Elman and Gene H. Golub",
37961 title = "Iterative methods for cyclically reduced
37962 non-self-adjoint linear systems {II}",
37963 type = "Technical Report",
37964 number = "STAN-CS-2238 (UMIACS-TR-89-45)",
37965 institution = inst-STAN-CS,
37966 address = inst-STAN-CS:adr,
37967 pages = "ii + 26",
37968 month = jun,
37969 year = "1989",
37970 DOI = "https://doi.org/10.1090/S0025-5718-1991-1052093-1;
37971 https://doi.org/10.5555/891608",
37972 MRclass = "65F10 65N20 15A06",
37973 bibdate = "Mon Oct 24 10:35:29 MDT 1994",
37974 bibsource = "https://www.math.utah.edu/pub/bibnet/authors/g/golub-gene-h.bib;
37975 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
37976 URL = "https://dl.acm.org/doi/10.5555/891608;
37977 https://www.jstor.org/stable/2008506",
37978 abstract = "We perform an analytic and experimental study of line
37979 iterative methods for solving linear systems arising
37980 from finite difference discretizations of
37981 non-self-adjoint elliptic partial differential
37982 equations on two-dimensional domains. The methods
37983 consist of performing one step of cyclic reduction,
37984 followed by solution of the resulting reduced system by
37985 line relaxation. We augment previous analyses of
37986 one-line methods, and we derive a new convergence
37987 analysis for two-line methods, showing that both
37988 classes of methods are highly effective for solving the
37989 convection--diffusion equation. In addition, we compare
37990 the experimental performance of several variants of
37991 these methods, and we show that the methods can be
37992 implemented efficiently on parallel architectures",
37993 abstract-2 = "We study iterative methods for solving linear systems
37994 of the type arising from two-cyclic discretizations of
37995 non-self-adjoint two-dimensional elliptic partial
37996 differential equations. A prototype is the
37997 convection-diffusion equation. The methods consist of
37998 applying one step of cyclic reduction, resulting in a
37999 ``reduced system'' of half the order of the original
38000 discrete problem, combined with a reordering and a
38001 block iterative technique for solving the reduced
38002 system. For constant coefficient problems, we present
38003 analytic bounds on the spectral radii of the iteration
38004 matrices in terms of cell Reynolds numbers that show
38005 the methods to be rapidly convergent. In addition, we
38006 describe numerical experiments that supplement the
38007 analysis and that indicate that the methods compare
38008 favorably with methods for solving the ``unreduced''
38009 system.",
38010 acknowledgement = ack-nhfb,
38011 author-dates = "Gene Howard Golub (February 29, 1932--November 16,
38012 2007)",
38013 keywords = "convection--diffusion; iterative methods
38014 (mathematics); linear systems; non-self-adjoint;
38015 reduced system",
38016 remark = "Published in \booktitle{Mathematics of Computation},
38017 {\bf 54}(190) 671--700, April 1990,
38018 doi:10.2307/2008506.",
38019 xxnumber = "CS-TR-2238, UMIACS-TR-89-45",
38020 }
38021
38022 @TechReport{Elhay:1989:UDO,
38023 author = "Sylvan Elhay and Gene H. Golub and Jaroslav
38024 Kautsk{\'y}",
38025 title = "Updating and downdating of orthogonal polynomials with
38026 data fitting applications",
38027 type = "Technical Report",
38028 number = "STAN-CS-89-04 (NA-89-04)",
38029 institution = inst-STAN-CS,
38030 address = inst-STAN-CS:adr,
38031 pages = "32",
38032 month = "????",
38033 year = "1989",
38034 DOI = "https://doi.org/10.1137/0612024",
38035 bibdate = "Mon Oct 24 10:35:29 MDT 1994",
38036 bibsource = "https://www.math.utah.edu/pub/bibnet/authors/g/golub-gene-h.bib;
38037 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
38038 URL = "https://dl.acm.org/doi/10.1137/0612024",
38039 acknowledgement = ack-nhfb,
38040 author-dates = "Gene Howard Golub (February 29, 1932--November 16,
38041 2007)",
38042 keywords = "least squares; orthogonal polynomials",
38043 remark = "Published in \booktitle{SIAM Journal on Matrix
38044 Analysis and Applications}, {\bf 12}(2) 327--353, April
38045 1991. doi:10.1137/0612024.",
38046 xxnumber = "CS-TR-89-04, NA-89-04",
38047 }
38048
38049 @TechReport{Golub:1989:MMI,
38050 author = "Gene H. Golub and Martin H. Gutknecht",
38051 title = "Modified moments for indefinite weight functions",
38052 type = "Technical Report",
38053 number = "STAN-CS-89-08 (NA-89-08)",
38054 institution = inst-STAN-CS,
38055 address = inst-STAN-CS:adr,
38056 pages = "19",
38057 month = "????",
38058 year = "1989",
38059 bibdate = "Mon Oct 24 10:35:29 MDT 1994",
38060 bibsource = "https://www.math.utah.edu/pub/bibnet/authors/g/golub-gene-h.bib;
38061 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
38062 URL = "https://people.math.ethz.ch/~mhg/talks/GolGreview/GolGrev.pdf
38063 (slides)",
38064 acknowledgement = ack-nhfb,
38065 author-dates = "Gene Howard Golub (February 29, 1932--November 16,
38066 2007)",
38067 keywords = "orthogonal polynomials",
38068 remark = "Published in \booktitle{Numerische Mathematik}, {\bf
38069 57}(6/7) 607--624, July 1990.",
38070 xxnumber = "CS-TR-89-08, NA-89-08",
38071 }
38072
38073 @TechReport{Lin:1989:ASU,
38074 author = "Fangzhen Lin and Yoav Shoham",
38075 title = "Argument Systems: a uniform basis for nonmonotonic
38076 reasoning",
38077 type = "Technical Report",
38078 number = "STAN-CS-89-1243",
38079 institution = inst-STAN-CS,
38080 address = inst-STAN-CS:adr,
38081 pages = "28",
38082 month = jan,
38083 year = "1989",
38084 bibdate = "Wed Nov 26 12:13:45 MST 2025",
38085 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
38086 URL = "",
38087 acknowledgement = ack-nhfb,
38088 }
38089
38090 @TechReport{Fraley:1989:SPN,
38091 author = "Christina Fraley",
38092 title = "Software Performance on Nonlinear Least-Squares
38093 Problems",
38094 type = "Technical Report",
38095 number = "STAN-CS-89-1244",
38096 institution = inst-STAN-CS,
38097 address = inst-STAN-CS:adr,
38098 pages = "128",
38099 month = jan,
38100 year = "1989",
38101 bibdate = "Thu Nov 20 12:11:36 MST 2025",
38102 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
38103 URL = "http://www-db.stanford.edu/TR/CS-TR-89-1244.html",
38104 abstract = "This paper presents numerical results for a large and
38105 varied set of problems using software that is widely
38106 available and has undergone extensive testing. The
38107 algorithms implemented in this software include
38108 Newton-based linesearch and trust-region methods for
38109 unconstrained optimization, as well as Gauss-Newton,
38110 Levenberg-Marquardt, and special quasi-Newton methods
38111 for nonlinear least squares. Rather than give a
38112 critical assessment of the software itself, our
38113 original purpose was to use the best available software
38114 to compare the underlying algorithms, to identify
38115 classes of problems for each method on which the
38116 performance is either very good or very poor and to
38117 provide benchmarks for future work in nonlinear least
38118 squares and unconstrained optimization. The variability
38119 in the results made it impossible to meet either of the
38120 first two goals; however the results are significant as
38121 a step toward explaining why these aims are so
38122 difficult to accomplish.",
38123 acknowledgement = ack-nhfb,
38124 xxnumber = "CS-TR-89-1244",
38125 }
38126
38127 @TechReport{Wiederhold:1989:MOR,
38128 author = "Gio Wiederhold and Thierry Barsalou and Surajit
38129 Chaoudhuri",
38130 title = "Managing Objects in a Relational Framework",
38131 type = "Technical Report",
38132 number = "STAN-CS-89-1245",
38133 institution = inst-STAN-CS,
38134 address = inst-STAN-CS:adr,
38135 pages = "103",
38136 month = jan,
38137 year = "1989",
38138 bibdate = "Wed Nov 26 12:13:45 MST 2025",
38139 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
38140 URL = "",
38141 acknowledgement = ack-nhfb,
38142 }
38143
38144 @TechReport{Byrd:1989:MCM,
38145 author = "Gregory Byrd and Nakul Saraiya and Bruce Delagi",
38146 title = "Multicast Communication in Multiprocessor Systems",
38147 type = "Technical Report",
38148 number = "STAN-CS-89-1246",
38149 institution = inst-STAN-CS,
38150 address = inst-STAN-CS:adr,
38151 pages = "19",
38152 month = jan,
38153 year = "1989",
38154 bibdate = "Wed Nov 26 12:13:45 MST 2025",
38155 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
38156 URL = "",
38157 acknowledgement = ack-nhfb,
38158 }
38159
38160 @TechReport{Rabinov:1989:PQC,
38161 author = "Arkady Rabinov and Igor Rivin",
38162 title = "Programming in {Qlisp} --- a Case Study",
38163 type = "Technical Report",
38164 number = "STAN-CS-89-1247",
38165 institution = inst-STAN-CS,
38166 address = inst-STAN-CS:adr,
38167 pages = "17",
38168 month = jan,
38169 year = "1989",
38170 bibdate = "Wed Nov 26 12:13:45 MST 2025",
38171 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
38172 URL = "",
38173 acknowledgement = ack-nhfb,
38174 }
38175
38176 @TechReport{Goldberg:1989:ENS,
38177 author = "Andrew V. Goldberg and Michael D. Grigoriadis and
38178 Robert E. Tarjan",
38179 title = "Efficiency of the Network Simplex Algorithm for the
38180 Maximum Flow Problem",
38181 type = "Technical Report",
38182 number = "STAN-CS-89-1248",
38183 institution = inst-STAN-CS,
38184 address = inst-STAN-CS:adr,
38185 pages = "18",
38186 month = feb,
38187 year = "1989",
38188 bibdate = "Thu Nov 20 12:11:36 MST 2025",
38189 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
38190 URL = "http://www-db.stanford.edu/TR/CS-TR-89-1248.html",
38191 abstract = "Goldfarb and Hao have proposed a network simplex
38192 algorithm that will solve a maximum flow problem on an
38193 $n$-vertex, $m$-arc network in at most $ n m$ pivots
38194 and $ O(n^2 m) $ time. In this paper we describe how to
38195 implement their algorithm to run in $ O(n m \log n) $
38196 time by using an extension of the dynamic tree data
38197 structure of Sleator and Tarjan. This bound is less
38198 than a logarithmic factor larger than that of any other
38199 known algorithm for the problem.",
38200 acknowledgement = ack-nhfb,
38201 xxnumber = "CS-TR-89-1248",
38202 }
38203
38204 @TechReport{Baudinet:1989:LPS,
38205 author = "Marianne Baudinet",
38206 title = "Logic Programming Semantics: Techniques and
38207 Applications",
38208 type = "Technical Report",
38209 number = "STAN-CS-89-1249",
38210 institution = inst-STAN-CS,
38211 address = inst-STAN-CS:adr,
38212 pages = "172",
38213 month = feb,
38214 year = "1989",
38215 bibdate = "Wed Nov 26 12:13:45 MST 2025",
38216 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
38217 URL = "",
38218 acknowledgement = ack-nhfb,
38219 }
38220
38221 @TechReport{Mason:1989:SCA,
38222 author = "Ian Mason and Carolyn Talcott",
38223 title = "A sound and complete axiomatization of operational
38224 equivalence between programs with memory",
38225 type = "Technical Report",
38226 number = "STAN-CS-89-1250",
38227 institution = inst-STAN-CS,
38228 address = inst-STAN-CS:adr,
38229 pages = "27",
38230 month = mar,
38231 year = "1989",
38232 bibdate = "Thu Nov 20 12:11:36 MST 2025",
38233 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
38234 URL = "http://www-db.stanford.edu/TR/CS-TR-89-1250.html",
38235 abstract = "In this paper we present a formal system for deriving
38236 assertions about programs with memory. The assertions
38237 we consider are of the following three forms: (i) e
38238 diverges (i.e. fails to reduce to a value), written $
38239 \arru e $; (ii) $ e_O $ and $ e_1 $ reduce to the same
38240 value and have exactly the same effect on memory,
38241 written $ e_O \bksimlr e_1 $; and (iii) $ e_O $ and $
38242 e_1 $ reduce to the same value and have the same effect
38243 on memory up to production of garbage (are strongly
38244 isomorphic), written $_O \bksimeq e_1$. The e, $ e_j$
38245 are expressions of a first-order Scheme- or Lisp-like
38246 language with the data operations atom, eq, car, cdr,
38247 cons, setcar, setcdr, the control primitives let and
38248 if, and recursive definition of function symbols.",
38249 acknowledgement = ack-nhfb,
38250 xxnumber = "CS-TR-89-1250",
38251 }
38252
38253 @TechReport{Huggins:1988:EHM,
38254 author = "K. Cleo R. Huggins",
38255 title = "{Egyptian} Hieroglyphs for Modern Printing Devices: an
38256 Outline Font of {Egyptian} Hieroglyphs for
38257 {PostScript(R)} Printers",
38258 type = "Technical Report",
38259 number = "STAN-CS-89-1251",
38260 institution = inst-STAN-CS,
38261 address = inst-STAN-CS:adr,
38262 pages = "ii + 60",
38263 day = "1",
38264 month = jun,
38265 year = "1988",
38266 bibdate = "Wed Nov 26 12:13:45 MST 2025",
38267 bibsource = "https://www.math.utah.edu/pub/tex/bib/font.bib;
38268 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
38269 URL = "https://apps.dtic.mil/sti/tr/pdf/ADA326695.pdf",
38270 abstract = "Students of Egyptian history face economic and
38271 technological constraints in the reproduction of
38272 hieroglyphs. Ideally, they need a system which provides
38273 a collection of professional quality symbols and a
38274 means to arrange and integrate them in print. The Apple
38275 Macintosh and a laser printer font might offer a
38276 reasonable and inexpensive solution. The goal of this
38277 project is to develop that font and, in so doing,
38278 provide a model for solving similar problems in the
38279 reproduction of unusual, non-Latin characters.",
38280 acknowledgement = ack-nhfb,
38281 pdfpages = "61",
38282 remark = "This is the author's thesis.",
38283 }
38284
38285 @TechReport{Goldberg:1989:NFA,
38286 author = "Andrew Goldberg and Eva Tardos and Robert Tarjan",
38287 title = "Network Flow Algorithms",
38288 type = "Technical Report",
38289 number = "STAN-CS-89-1252",
38290 institution = inst-STAN-CS,
38291 address = inst-STAN-CS:adr,
38292 pages = "82",
38293 month = mar,
38294 year = "1989",
38295 bibdate = "Wed Nov 26 12:13:45 MST 2025",
38296 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
38297 URL = "",
38298 acknowledgement = ack-nhfb,
38299 }
38300
38301 @TechReport{Vavasis:1989:CFP,
38302 author = "Stephen A. Vavasis",
38303 title = "Complexity of Fixed Point Computations",
38304 type = "Technical Report",
38305 number = "STAN-CS-89-1253",
38306 institution = inst-STAN-CS,
38307 address = inst-STAN-CS:adr,
38308 pages = "102",
38309 month = apr,
38310 year = "1989",
38311 bibdate = "Wed Nov 26 12:13:45 MST 2025",
38312 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
38313 URL = "",
38314 acknowledgement = ack-nhfb,
38315 remark = "This is the author's thesis.",
38316 }
38317
38318 @TechReport{Knuth:1989:M,
38319 author = "Donald E. Knuth and Tomas G. Rokicki and Arthur L.
38320 Samuel",
38321 title = "{METAFONTware}",
38322 type = "Technical Report",
38323 number = "STAN-CS-89-1255",
38324 institution = inst-STAN-CS,
38325 address = inst-STAN-CS:adr,
38326 pages = "209",
38327 day = "1",
38328 month = may,
38329 year = "1989",
38330 bibdate = "Fri Apr 18 05:25:51 2003",
38331 bibsource = "https://www.math.utah.edu/pub/tex/bib/font.bib;
38332 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
38333 URL = "http://i.stanford.edu/pub/cstr/reports/cs/tr/89/1255/CS-TR-89-1255.pdf;
38334 http://www-db.stanford.edu/TR/CS-TR-89-1255.html;
38335 http://www.ncstrl.org:8900/ncstrl/servlet/search?formname=detail&id=oai%3Ancstrlh%3Astan%3ASTAN%2F%2FCS-TR-89-1255",
38336 abstract = "This report contains the complete WEB documentation
38337 for four utility programs that are often used in
38338 conjunction with METAFONT: GFtype, GFtoPK, GFtoDVI, and
38339 MFT. This report is analogous to TeXware, published in
38340 1986 (STAN-CS-86-1097). METAFONTware completes the
38341 set.",
38342 acknowledgement = ack-nhfb,
38343 author-dates = "Arthur Lee Samuel (5 December 1901--29 July 1990)",
38344 documentid = "oai:ncstrlh:stan:STAN//CS-TR-89-1255",
38345 xxnumber = "CS-TR-89-1255",
38346 }
38347
38348 @TechReport{Billawala:1989:MPS,
38349 author = "Neenie Billawala",
38350 title = "{Metamarks}: Preliminary Studies for a {Pandora}'s Box
38351 of Shapes",
38352 type = "Technical Report",
38353 number = "STAN-CS-89-1256",
38354 institution = inst-STAN-CS,
38355 address = inst-STAN-CS:adr,
38356 pages = "131",
38357 month = may,
38358 year = "1989",
38359 bibdate = "Wed Nov 26 12:13:45 MST 2025",
38360 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
38361 URL = "",
38362 acknowledgement = ack-nhfb,
38363 }
38364
38365 @TechReport{Barraquand:1989:RMP,
38366 author = "Jerome Barraquand and Jean-Claude Latombe",
38367 title = "Robot Motion Planning: a distributed representation
38368 approach",
38369 type = "Technical Report",
38370 number = "STAN-CS-89-1257",
38371 institution = inst-STAN-CS,
38372 address = inst-STAN-CS:adr,
38373 pages = "56",
38374 month = may,
38375 year = "1989",
38376 bibdate = "Wed Nov 26 12:13:45 MST 2025",
38377 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
38378 URL = "",
38379 acknowledgement = ack-nhfb,
38380 }
38381
38382 @TechReport{Chen:1989:HSB,
38383 author = "Pang-Chieh Chen",
38384 title = "Heuristic Sampling on Backtrack Trees",
38385 type = "Technical Report",
38386 number = "STAN-CS-89-1258",
38387 institution = inst-STAN-CS,
38388 address = inst-STAN-CS:adr,
38389 pages = "172",
38390 month = may,
38391 year = "1989",
38392 bibdate = "Wed Nov 26 12:13:45 MST 2025",
38393 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
38394 URL = "",
38395 acknowledgement = ack-nhfb,
38396 }
38397
38398 @TechReport{Goldberg:1989:IPM,
38399 author = "Andrew V. Goldberg and Serge A. Plotkin and David B.
38400 Shmoys and Eva Tardos",
38401 title = "Interior-Point Methods in Parallel Computation",
38402 type = "Technical Report",
38403 number = "STAN-CS-89-1259",
38404 institution = inst-STAN-CS,
38405 address = inst-STAN-CS:adr,
38406 pages = "15",
38407 month = may,
38408 year = "1989",
38409 bibdate = "Thu Nov 20 12:11:36 MST 2025",
38410 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
38411 URL = "http://www-db.stanford.edu/TR/CS-TR-89-1259.html",
38412 abstract = "ln this paper we use interior-point methods for linear
38413 programming, developed in the context of sequential
38414 computation, to obtain a parallel algorithm for the
38415 bipartite matching problem. Our algorithm runs in $ O^n
38416 (\sqrt m) $ time. Our results extend to the weighted
38417 bipartite matching problem and to the zero-one
38418 minimum-cost flow problem, yielding $ O^n ((\sqrt m)
38419 \log C) $ algorithms. This improves previous bounds on
38420 these problems and illustrates the importance of
38421 interior-point methods in the context of parallel
38422 algorithm design.",
38423 acknowledgement = ack-nhfb,
38424 xxnumber = "CS-TR-89-1259",
38425 }
38426
38427 @TechReport{Subramanian:1989:TJR,
38428 author = "Devika Subramanian",
38429 title = "A Theory of Justified Reformulations",
38430 type = "Technical Report",
38431 number = "STAN-CS-89-1260",
38432 institution = inst-STAN-CS,
38433 address = inst-STAN-CS:adr,
38434 pages = "134",
38435 month = may,
38436 year = "1989",
38437 bibdate = "Wed Nov 26 12:13:45 MST 2025",
38438 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
38439 URL = "",
38440 acknowledgement = ack-nhfb,
38441 remark = "This is the author's thesis.",
38442 }
38443
38444 @TechReport{Mayr:1989:PPP,
38445 author = "Ernst W. Mayr and C. Greg Plaxton",
38446 title = "Pipelined Parallel Computations, and Sorting on a
38447 Pipelined Hypercube",
38448 type = "Technical Report",
38449 number = "STAN-CS-89-1261",
38450 institution = inst-STAN-CS,
38451 address = inst-STAN-CS:adr,
38452 pages = "iv + 15",
38453 month = may,
38454 year = "1989",
38455 bibdate = "Thu Nov 20 12:11:36 MST 2025",
38456 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
38457 URL = "http://i.stanford.edu/pub/cstr/reports/cs/tr/89/1261/CS-TR-89-1261.pdf;
38458 http://www-db.stanford.edu/TR/CS-TR-89-1261.html",
38459 abstract = "This paper brings together a number of previously
38460 known techniques in order to obtain practical and
38461 efficient implementations of the prefix operation for
38462 the complete binary tree, hypercube and shuffle
38463 exchange families of networks. For each of these
38464 networks, we also provide a ``pipelined'' scheme for
38465 performing $k$ prefix operations in $ O(k + \log p) $
38466 time on $p$ processors. This implies a similar
38467 pipelining result for the ``data distribution''
38468 operation of Ullman [16]. The data distribution
38469 primitive leads to a simplified implementation of the
38470 optimal merging algorithm of Varman and Doshi, which
38471 runs on a pipelined model of the hypercube [17].
38472 Finally, a pipelined version of the multi-way merge
38473 sort of Nassimi and Sahni [10], running on the
38474 pipelined hypercube model, is described. Given $p$
38475 processors and $ n < p \log p$ values to be sorted, the
38476 running time of the pipelined algorithm is $ O(l o g^2
38477 p / \log ((p \log p) / n)) $. Note that for the
38478 interesting case $ n = p $ this yields a running time
38479 of $ O(\log_2 p / \log \log p) $, which is
38480 asymptotically faster than Batcher's bitonic sort
38481 [3].",
38482 acknowledgement = ack-nhfb,
38483 pdfpages = "19",
38484 xxnumber = "CS-TR-89-1261",
38485 }
38486
38487 @TechReport{Swami:1989:OLJ,
38488 author = "Arun N. Swami",
38489 title = "Optimization of Large Join Queries",
38490 type = "Technical Report",
38491 number = "STAN-CS-89-1262",
38492 institution = inst-STAN-CS,
38493 address = inst-STAN-CS:adr,
38494 pages = "145",
38495 month = jun,
38496 year = "1989",
38497 bibdate = "Wed Nov 26 12:13:45 MST 2025",
38498 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
38499 URL = "",
38500 acknowledgement = ack-nhfb,
38501 remark = "This is the author's thesis.",
38502 }
38503
38504 @TechReport{Karp:1989:HFQ,
38505 author = "Peter D. Karp",
38506 title = "Hypothesis Formation and Qualitative Reasoning in
38507 Molecular Biology",
38508 type = "Technical Report",
38509 number = "STAN-CS-89-1263",
38510 institution = inst-STAN-CS,
38511 address = inst-STAN-CS:adr,
38512 pages = "339",
38513 month = jun,
38514 year = "1989",
38515 bibdate = "Wed Nov 26 12:13:45 MST 2025",
38516 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
38517 URL = "",
38518 acknowledgement = ack-nhfb,
38519 remark = "This is the author's thesis.",
38520 }
38521
38522 @TechReport{Fischer:1989:CPA,
38523 author = "Bernd Fischer and Roland Freund",
38524 title = "{Chebyshev} Polynomials are not always Optimal",
38525 type = "Technical Report",
38526 number = "STAN-CS-89-1264",
38527 institution = inst-STAN-CS,
38528 address = inst-STAN-CS:adr,
38529 pages = "14",
38530 month = jun,
38531 year = "1989",
38532 bibdate = "Thu Nov 20 12:11:36 MST 2025",
38533 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
38534 URL = "http://www-db.stanford.edu/TR/CS-TR-89-1264.html",
38535 abstract = "We are concerned with the problem of finding among all
38536 polynomials of degree at most $n$ and normalized to be
38537 1 at $c$, the one with minimal uniform norm on Epsilon.
38538 Here, Epsilon is a given ellipse with both foci on the
38539 real axis and $c$ is a given real point not contained
38540 in Epsilon. Problems of this type arise in certain
38541 iterative matrix computations, and, in this context, it
38542 is generally believed and widely referenced that
38543 suitably normalized Chebyshev polynomials are optimal
38544 for such constrained approximation problems. In this
38545 note, we show that this is not true in general.
38546 Moreover, we derive sufficient conditions which
38547 guarantee that Chebyshev polynomials are optimal. Also,
38548 some numerical examples are presented.",
38549 acknowledgement = ack-nhfb,
38550 xxnumber = "CS-TR-89-1264",
38551 }
38552
38553 @TechReport{Weening:1989:PEL,
38554 author = "Joseph S. Weening",
38555 title = "Parallel Execution of {Lisp} Programs",
38556 type = "Technical Report",
38557 number = "STAN-CS-89-1265",
38558 institution = inst-STAN-CS,
38559 address = inst-STAN-CS:adr,
38560 pages = "94",
38561 month = jun,
38562 year = "1989",
38563 bibdate = "Wed Nov 26 12:13:45 MST 2025",
38564 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
38565 URL = "",
38566 acknowledgement = ack-nhfb,
38567 remark = "This is the author's thesis.",
38568 }
38569
38570 @TechReport{Cheriton:1989:MLS,
38571 author = "David R. Cheriton and Hendrik A. Goosen and Patrick D.
38572 Boyle",
38573 title = "Multi-level shared caching techniques for scalability
38574 in {VMP-MC}",
38575 type = "Technical Report",
38576 number = "STAN-CS-89-1266",
38577 institution = inst-STAN-CS,
38578 address = inst-STAN-CS:adr,
38579 pages = "ii + 18",
38580 month = may,
38581 year = "1989",
38582 bibdate = "Thu Nov 20 12:11:36 MST 2025",
38583 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
38584 URL = "http://www-db.stanford.edu/TR/CS-TR-89-1266.html",
38585 abstract = "The problem of building a scalable shared memory
38586 multiprocessor can be reduced to that of building a
38587 scalable memory hierarchy, assuming interprocessor
38588 communication is handled by the memory system. In this
38589 paper, we describe the VMP-MC design, a distributed
38590 parallel multi-computer based on the VMP multiprocessor
38591 design, that is intended to provide a set of building
38592 blocks for configuring machines from one to several
38593 thousand processors. VMP-MC uses a memory hierarchy
38594 based on shared caches, ranging from on-chip caches to
38595 board-level caches connected by busses to, at the
38596 bottom, a high-speed fiber optic ring. In addition to
38597 describing the building block components of this
38598 architecture, we identify the key performance issues
38599 associated with the design and provide performance
38600 evaluation of these issues using trace-drive simulation
38601 and measurements from the VMP.",
38602 acknowledgement = ack-nhfb,
38603 pdfpages = "20",
38604 xxnumber = "CS-TR-89-1266",
38605 }
38606
38607 @TechReport{Alur:1989:RTL,
38608 author = "Rajeev Alur and Thomas A. Henzinger",
38609 title = "A Really Temporal Logic",
38610 type = "Technical Report",
38611 number = "STAN-CS-89-1267",
38612 institution = inst-STAN-CS,
38613 address = inst-STAN-CS:adr,
38614 pages = "27",
38615 month = jul,
38616 year = "1989",
38617 bibdate = "Thu Nov 20 12:11:36 MST 2025",
38618 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
38619 URL = "http://www-db.stanford.edu/TR/CS-TR-89-1267.html",
38620 abstract = "We introduce a real-time temporal logic for the
38621 specification of reactive systems. The novel feature of
38622 our logic, TPTL, is the adoption of temporal operators
38623 as quantifiers over time variables; every modality
38624 binds a variable to the time(s) it refers to. TPTL is
38625 demonstrated to be both a natural specification
38626 language as well as a suitable formalism for
38627 verification and synthesis. We present a tableau-based
38628 decision procedure and model-checking algorithm for
38629 TPTL. Several generalizations of TPTL are shown to be
38630 highly undecidable.",
38631 acknowledgement = ack-nhfb,
38632 xxnumber = "CS-TR-89-1267",
38633 }
38634
38635 @TechReport{Floyd:1989:AMa,
38636 author = "Robert W. Floyd and Donald E. Knuth",
38637 title = "Addition Machines",
38638 type = "Technical Report",
38639 number = "STAN-CS-89-1254",
38640 institution = inst-STAN-CS,
38641 address = inst-STAN-CS:adr,
38642 pages = "16",
38643 month = apr,
38644 year = "1989",
38645 bibdate = "Wed Nov 26 12:13:45 MST 2025",
38646 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
38647 URL = "",
38648 acknowledgement = ack-nhfb,
38649 author-dates = "Robert W. Floyd (8 June 1936--25 September 2001)",
38650 }
38651
38652 @TechReport{Floyd:1989:AMb,
38653 author = "Robert W. Floyd and Donald E. Knuth",
38654 title = "Addition Machines",
38655 type = "Technical Report",
38656 number = "STAN-CS-89-1268",
38657 institution = inst-STAN-CS,
38658 address = inst-STAN-CS:adr,
38659 pages = "16",
38660 day = "1",
38661 month = jul,
38662 year = "1989",
38663 bibdate = "Fri Apr 18 05:25:51 2003",
38664 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
38665 URL = "http://www-db.stanford.edu/TR/CS-TR-89-1268.html;
38666 http://www.ncstrl.org:8900/ncstrl/servlet/search?formname=detail&id=oai%3Ancstrlh%3Astan%3ASTAN%2F%2FCS-TR-89-1268",
38667 abstract = "An addition machine is a computing device with a
38668 finite number of registers, limited to the following
38669 six types of operations: read $x$ \{input to register
38670 $x$ \} $ x \longleftarrow y$ \{copy register $y$ to
38671 register $x$ \} $ x \longleftarrow x + y$ \{add
38672 register $y$ to register $x$ \} $ x \longleftarrow x -
38673 y$ \{subtract register $y$ from register $x$ \} if $ x
38674 \ge y$ \{compare register $x$ to register $y$ \} write
38675 $x$ \{output from register $x$ \} The register contents
38676 are assumed to belong to a given set $A$, which is an
38677 additive subgroup of the real numbers. If $A$ is the
38678 set of all integers, we say the device is an integer
38679 addition machine; if $A$ is the set of all real
38680 numbers, we say the device is a real addition machine.
38681 We will consider how efficiently an integer addition
38682 machine can do operations such multiplication,
38683 division, greatest common divisor, exponentiation, and
38684 sorting. We will also show that any addition machine
38685 with at least six registers can compute the ternary
38686 operation $ x[y / z]$ with reasonable efficiency, given
38687 $x$, $y$, $z$ in $A$ with $z$ not equal to 0.",
38688 acknowledgement = ack-nhfb,
38689 author-dates = "Robert W. Floyd (8 June 1936--25 September 2001)",
38690 documentid = "oai:ncstrlh:stan:STAN//CS-TR-89-1268",
38691 pdfpages = "17",
38692 xxnumber = "CS-TR-89-1268",
38693 }
38694
38695 @TechReport{Ross:1989:PPS,
38696 author = "Kenneth A. Ross and Donald E. Knuth",
38697 title = "A Programming and Problem Solving Seminar",
38698 type = "Technical Report",
38699 number = "STAN-CS-89-1269",
38700 institution = inst-STAN-CS,
38701 address = inst-STAN-CS:adr,
38702 pages = "88",
38703 day = "1",
38704 month = jul,
38705 year = "1989",
38706 bibdate = "Fri Apr 18 05:25:51 2003",
38707 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
38708 URL = "http://www-db.stanford.edu/TR/CS-TR-89-1269.html;
38709 http://www.ncstrl.org:8900/ncstrl/servlet/search?formname=detail&id=oai%3Ancstrlh%3Astan%3ASTAN%2F%2FCS-TR-89-1269",
38710 abstract = "This report contains edited transcripts of the
38711 discussions held in Stanford's Computer Science problem
38712 solving course, CS304, during winter quarter 1989.
38713 Since the topics span a large range of ideas in
38714 computer science, and since most of the important
38715 research paradigms and programming paradigms were
38716 touched on during the discussions, these notes may be
38717 of interest to graduate students of computer science at
38718 other universities, as well as to their professors and
38719 to professional people in the ``real world.''\par
38720
38721 The present report is the eighth in a series of such
38722 transcripts, continuing the tradition established in
38723 STAN-CS-77-606 (Michael J. Clancy, 1977),
38724 STAN-CS-79-707 (Chris Van Wyk, 1979), STAN-CS-81-863
38725 (Allan A. Miller, 1981), STAN-CS-83-989 (Joseph S.
38726 Weening, 1983), STAN-CS-83-990 (John D. Hobby, 1983),
38727 STAN-CS-85-1055 (Ramsey W. Haddad, 1985) and
38728 STAN-CS-87-1154 (Tomas G. Rokicki, 1987).",
38729 acknowledgement = ack-nhfb,
38730 documentid = "oai:ncstrlh:stan:STAN//CS-TR-89-1269",
38731 xxnumber = "CS-TR-89-1269",
38732 }
38733
38734 @TechReport{Holstege:1989:MDN,
38735 author = "Mary A. Holstege",
38736 title = "Marking and the Design of Notations",
38737 type = "Technical Report",
38738 number = "STAN-CS-89-1270",
38739 institution = inst-STAN-CS,
38740 address = inst-STAN-CS:adr,
38741 pages = "255",
38742 month = jul,
38743 year = "1989",
38744 bibdate = "Wed Nov 26 12:13:45 MST 2025",
38745 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
38746 URL = "",
38747 acknowledgement = ack-nhfb,
38748 }
38749
38750 @TechReport{Kent:1989:CKL,
38751 author = "Mark David Kent",
38752 title = "{Chebyshev}, {Krylov}, {Lanczos}: Matrix Relationships
38753 and Computations",
38754 type = "Technical Report",
38755 number = "STAN-CS-89-1271",
38756 institution = inst-STAN-CS,
38757 address = inst-STAN-CS:adr,
38758 pages = "x + 126",
38759 month = jul,
38760 year = "1989",
38761 bibdate = "Wed Nov 26 12:13:45 MST 2025",
38762 bibsource = "https://www.math.utah.edu/pub/bibnet/authors/l/lanczos-cornelius.bib;
38763 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
38764 URL = "https://www.proquest.com/pqdtglobal/docview/303724638",
38765 abstract = "The thesis presents a unified approach to
38766 understanding the important symmetric Lanczos algorithm
38767 and its variants.\par
38768
38769 The Chebyshev algorithm for computing orthogonal
38770 polynomials is derived and characterized in terms of
38771 transformations between polynomial bases. This leads to
38772 generalized Krylov sequences and a demonstration of the
38773 equivalence of the modified Chebyshev algorithm and the
38774 symmetric Lanczos algorithm for determining eigenvalues
38775 of linear operators. The theory is successfully
38776 generalized to the block case where matrix-valued
38777 orthogonal polynomials play the key role.\par
38778
38779 Immediate applications include determining optimal
38780 parameters and error bounds for polynomial iterative
38781 methods for solving systems of linear
38782 equations.\par
38783
38784 Comrade matrices naturally appear when generalized
38785 Krylov methods are applied to bounded linear operators.
38786 Properties of comrade matrices, and alternate methods
38787 of computing them, are presented. Finally, parallel
38788 implementations of Bairstow's method and the
38789 Hyman--Laguerre method for computing eigenvalues of
38790 comrade matrices are presented.",
38791 acknowledgement = ack-nhfb,
38792 pdfpages = "140",
38793 remark = "This is the author's Ph.D. thesis.",
38794 }
38795
38796 @TechReport{Finlayson:1989:LFS,
38797 author = "Ross S. Finlayson",
38798 title = "A Log File Service Exploiting Write-Once Storage",
38799 type = "Technical Report",
38800 number = "STAN-CS-89-1272",
38801 institution = inst-STAN-CS,
38802 address = inst-STAN-CS:adr,
38803 pages = "98",
38804 month = jul,
38805 year = "1989",
38806 bibdate = "Wed Nov 26 12:13:45 MST 2025",
38807 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
38808 URL = "",
38809 acknowledgement = ack-nhfb,
38810 remark = "This is the author's thesis.",
38811 }
38812
38813 @TechReport{Cheriton:1989:SHP,
38814 author = "David R. Cheriton",
38815 title = "{{Sirpent$^{\rm TM}$}}: a High-Performance
38816 Internetworking Approach",
38817 type = "Technical Report",
38818 number = "STAN-CS-89-1273",
38819 institution = inst-STAN-CS,
38820 address = inst-STAN-CS:adr,
38821 pages = "ii + 12",
38822 month = jul,
38823 year = "1989",
38824 bibdate = "Thu Nov 20 12:11:36 MST 2025",
38825 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
38826 URL = "http://www-db.stanford.edu/TR/CS-TR-89-1273.html",
38827 abstract = "A clear target for computer communication technology
38828 is to support a high-performance global internetwork.
38829 Current internetworking approaches use either
38830 concatenated virtual circuits, as in X.75, or a
38831 ``universal'' internetwork datagram, as in the DoD
38832 Internet IP protocol and the IS0 connectionless network
38833 protocol (CLNP). Both approaches have significant
38834 disadvantages. This paper describes Sirpent[TM] (Source
38835 Internetwork Routing Protocol with Extended Network
38836 Transfer), a new approach to an internetwork
38837 architecture that makes source routing the basis for
38838 interconnection, rather than an option as in IP. Its
38839 benefits include simple switching with low per-packet
38840 processing and delay, support for accounting and
38841 congestion control, and scalability to a global
38842 internetwork. It also supports flexible,
38843 user-controlled routing such as required for security,
38844 policy-based routing and real-time applications. We
38845 also propose a specific internetwork protocol, called
38846 VIPER[TM], as a realization of the Sirpent approach.",
38847 acknowledgement = ack-nhfb,
38848 pdfpages = "14",
38849 xxnumber = "CS-TR-89-1273",
38850 }
38851
38852 @TechReport{Hirsh:1989:IVS,
38853 author = "Haym Hirsh",
38854 title = "Incremental Version-Space Merging: a General Framework
38855 for Concept Learning",
38856 type = "Technical Report",
38857 number = "STAN-CS-89-1274",
38858 institution = inst-STAN-CS,
38859 address = inst-STAN-CS:adr,
38860 pages = "103",
38861 month = aug,
38862 year = "1989",
38863 bibdate = "Wed Nov 26 12:13:45 MST 2025",
38864 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
38865 URL = "",
38866 acknowledgement = ack-nhfb,
38867 remark = "This is the author's thesis.",
38868 }
38869
38870 @TechReport{Subramanian:1989:NAS,
38871 author = "Ashok Subramanian",
38872 title = "A New Approach to Stable Matching Problems",
38873 type = "Technical Report",
38874 number = "STAN-CS-89-1275",
38875 institution = inst-STAN-CS,
38876 address = inst-STAN-CS:adr,
38877 pages = "35",
38878 month = aug,
38879 year = "1989",
38880 bibdate = "Thu Nov 20 12:11:36 MST 2025",
38881 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
38882 URL = "http://www-db.stanford.edu/TR/CS-TR-89-1275.html",
38883 abstract = "We show that Stable Matching problems are the same as
38884 problems about stable configurations of X-networks.
38885 Consequences include easy proofs of old theorems, a new
38886 simple algorithm for finding a stable matching, an
38887 understanding of the difference between Stable Marriage
38888 and Stable Roommates, NP-completeness of Three-party
38889 Stable Marriage, CC-completeness of several Stable
38890 Matching problems, and a fast parallel reduction from
38891 the Stable Marriage problem to the Assignment
38892 problem.",
38893 acknowledgement = ack-nhfb,
38894 xxnumber = "CS-TR-89-1275",
38895 }
38896
38897 @TechReport{Plaxton:1989:NCS,
38898 author = "C. Greg Plaxton",
38899 title = "On the Network Complexity of Selection",
38900 type = "Technical Report",
38901 number = "STAN-CS-89-1276",
38902 institution = inst-STAN-CS,
38903 address = inst-STAN-CS:adr,
38904 pages = "20",
38905 month = aug,
38906 year = "1989",
38907 bibdate = "Thu Nov 20 12:11:36 MST 2025",
38908 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
38909 URL = "http://www-db.stanford.edu/TR/CS-TR-89-1276.html",
38910 abstract = "The selection problem is to determine the kth largest
38911 out of a given set of $n$ keys, and its sequential
38912 complexity is well known to be linear. Thus, given a
38913 $p$ processor parallel machine, it is natural to ask
38914 whether or not an $ O(n / p) $ selection algorithm can
38915 be devised for that machine. For the EREW PRAM, Vishkin
38916 has exhibited a straightforward selection algorithm
38917 that achieves optimal speedup for $ n = \Omega (p \log
38918 p \log \log p)$ [18]. For the network model, the
38919 sorting result of Leighton [12] and the token
38920 distribution result of Peleg and Upfal [13] together
38921 imply that Vishkin's algorithm can be adapted to run in
38922 the same asymptotic time bound on a certain class of
38923 bounded degree expander networks. On the other hand,
38924 none of the network families currently of practical
38925 interest have sufficient expansion to permit an
38926 efficient implementation of Vishkin's algorithm. The
38927 main result of this paper is an $ \Omega ((n / p) \log
38928 \log p + \log p) $ lower bound for selection on any
38929 network that satisfies a particular low expansion
38930 property. The class of networks satisfying this
38931 property includes all of the common network families
38932 such as the tree, multi-dimensional mesh, hypercube,
38933 butterfly and shuffle exchange. When $ n / p$ is
38934 sufficiently large (for example, greater than $ \log_2
38935 p$ on the butterfly, hypercube and shuffle exchange),
38936 this result is matched by the upper bound presented in
38937 [14].",
38938 acknowledgement = ack-nhfb,
38939 xxnumber = "CS-TR-89-1276",
38940 }
38941
38942 @TechReport{Mitchell:1989:TSP,
38943 author = "John C. Mitchell",
38944 title = "Type Systems for Programming Languages",
38945 type = "Technical Report",
38946 number = "STAN-CS-89-1277",
38947 institution = inst-STAN-CS,
38948 address = inst-STAN-CS:adr,
38949 pages = "90",
38950 month = aug,
38951 year = "1989",
38952 bibdate = "Wed Nov 26 12:13:45 MST 2025",
38953 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
38954 URL = "",
38955 acknowledgement = ack-nhfb,
38956 }
38957
38958 @TechReport{Mayr:1989:CCV,
38959 author = "Ernst W. Mayr and Ashok Subramanian",
38960 title = "The complexity of circuit value and network
38961 stability",
38962 type = "Technical Report",
38963 number = "STAN-CS-89-1278",
38964 institution = inst-STAN-CS,
38965 address = inst-STAN-CS:adr,
38966 pages = "19",
38967 month = aug,
38968 year = "1989",
38969 bibdate = "Thu Nov 20 12:11:36 MST 2025",
38970 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
38971 URL = "http://www-db.stanford.edu/TR/CS-TR-89-1278.html",
38972 abstract = "We develop a method for non-trivially restricting
38973 fanout in a circuit. We study the complexity of the
38974 Circuit Value problem and a new problem, Network
38975 Stability, when fanout is limited. This leads to new
38976 classes of problems within P. We conjecture that the
38977 new classes are different from P and incomparable to
38978 NC. One of these classes, CC, contains several natural
38979 complete problems, including Circuit Value for
38980 comparator circuits, Lex-first Maximal Matching, and
38981 problems related to Stable Marriage and Stable
38982 Roommates. When fanout is appropriately limited, we get
38983 positive results: a parallel algorithm for Circuit
38984 Value that runs in time about the square root of the
38985 number of gates, a linear-time sequential algorithm for
38986 Network Stability, and logspace reductions between
38987 Circuit Value and Network Stability.",
38988 acknowledgement = ack-nhfb,
38989 xxnumber = "CS-TR-89-1278",
38990 }
38991
38992 @TechReport{Zhu:1989:HAE,
38993 author = "David Zhu and Jean-Claude Latombe",
38994 title = "The Heuristic Algorithms for Efficient Hierarchical
38995 Path Planning",
38996 type = "Technical Report",
38997 number = "STAN-CS-89-1279",
38998 institution = inst-STAN-CS,
38999 address = inst-STAN-CS:adr,
39000 pages = "44",
39001 month = aug,
39002 year = "1989",
39003 bibdate = "Wed Nov 26 12:13:45 MST 2025",
39004 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
39005 URL = "",
39006 acknowledgement = ack-nhfb,
39007 }
39008
39009 @TechReport{Plotkin:1989:SBU,
39010 author = "Serge A. Plotkin",
39011 title = "Sticky Bits and Universality of Consensus",
39012 type = "Technical Report",
39013 number = "STAN-CS-89-1280",
39014 institution = inst-STAN-CS,
39015 address = inst-STAN-CS:adr,
39016 pages = "19",
39017 month = aug,
39018 year = "1989",
39019 bibdate = "Thu Nov 20 12:11:36 MST 2025",
39020 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
39021 URL = "http://www-db.stanford.edu/TR/CS-TR-89-1280.html",
39022 abstract = "In this paper we consider implementation of atomic
39023 wait-free objects in the context of a shared-memory
39024 multiprocessor. We introduce a new primitive object,
39025 the ``Sticky-Bit'', and show its universality by
39026 proving that any safe implementation of a sequential
39027 object can be transformed into a wait-free atomic one
39028 using only Sticky Bits and safe registers. The Sticky
39029 Bit may be viewed as a memory-oriented version of
39030 consensus. In particular, the results of this paper
39031 imply ``universality of consensus'' in the sense that
39032 given an algorithm to achieve n-processor consensus, we
39033 can transform any safe implementation of a sequential
39034 object into a wait-free atomic one using polynomial
39035 number of additional safe bits. The presented results
39036 also imply that the Read-Modify-Write (RMW) hierarchy
39037 ``collapses''. More precisely, we show that although an
39038 object that supports a 1-bit atomic wait-free RMW is
39039 strictly more powerful than safe register and an object
39040 that supports 3-valued atomic wait-free RMW is strictly
39041 more powerful than 1-bit RMW, the 3-value RMW is
39042 universal in the sense that any RMW can be atomically
39043 implemented from a 3-value atomic RMW in a wait-free
39044 fashion.",
39045 acknowledgement = ack-nhfb,
39046 xxnumber = "CS-TR-89-1280",
39047 }
39048
39049 @TechReport{Plaxton:1989:LBH,
39050 author = "C. Greg Plaxton",
39051 title = "Load Balancing on the Hypercube and Shuffle-Exchange",
39052 type = "Technical Report",
39053 number = "STAN-CS-89-1281",
39054 institution = inst-STAN-CS,
39055 address = inst-STAN-CS:adr,
39056 pages = "19",
39057 month = aug,
39058 year = "1989",
39059 bibdate = "Thu Nov 20 12:11:36 MST 2025",
39060 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
39061 URL = "http://www-db.stanford.edu/TR/CS-TR-89-1281.html",
39062 abstract = "Maintaining a balanced load is of fundamental
39063 importance on any parallel computer, since a strongly
39064 imbalanced load often leads to low processor
39065 utilization. This paper considers two load balancing
39066 operations: Balance and MultiBalance. The Balance
39067 operation corresponds to the token distribution problem
39068 considered by Peleg and Upfal [9] for certain expander
39069 networks. The MultiBalance operation balances several
39070 populations of distinct token types simultaneously.
39071 Efficient implementations of these operations will be
39072 given for the hypercube and shuffle-exchange, along
39073 with tight or near-tight lower bounds.",
39074 acknowledgement = ack-nhfb,
39075 xxnumber = "CS-TR-89-1281",
39076 }
39077
39078 @TechReport{Sankar:1989:ARC,
39079 author = "Sriram Sankar",
39080 title = "Automatic Runtime Consistency Checking and Debugging
39081 of Formally Specified Programs",
39082 type = "Technical Report",
39083 number = "STAN-CS-89-1282",
39084 institution = inst-STAN-CS,
39085 address = inst-STAN-CS:adr,
39086 pages = "210",
39087 month = aug,
39088 year = "1989",
39089 bibdate = "Wed Nov 26 12:13:45 MST 2025",
39090 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
39091 URL = "",
39092 acknowledgement = ack-nhfb,
39093 }
39094
39095 @TechReport{Plaxton:1989:ECS,
39096 author = "C. Gregory Plaxton",
39097 title = "Efficient Computation on Sparse Interconnection
39098 Networks",
39099 type = "Technical Report",
39100 number = "STAN-CS-89-1283",
39101 institution = inst-STAN-CS,
39102 address = inst-STAN-CS:adr,
39103 pages = "122",
39104 month = sep,
39105 year = "1989",
39106 bibdate = "Wed Nov 26 12:13:45 MST 2025",
39107 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
39108 URL = "",
39109 acknowledgement = ack-nhfb,
39110 remark = "This is the author's thesis.",
39111 }
39112
39113 @TechReport{Knuth:1989:TP,
39114 author = "Donald E. Knuth",
39115 title = "Theory and Practice",
39116 type = "Technical Report",
39117 number = "STAN-CS-89-1284",
39118 institution = inst-STAN-CS,
39119 address = inst-STAN-CS:adr,
39120 pages = "25",
39121 month = sep,
39122 year = "1989",
39123 bibdate = "Wed Nov 26 12:13:45 MST 2025",
39124 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
39125 URL = "https://arxiv.org/pdf/cs/9301114",
39126 abstract = "The author argues to Silicon Valley that the most
39127 important and powerful part of computer science is work
39128 that is simultaneously theoretical and practical. He
39129 particularly considers the intersection of the theory
39130 of algorithms and practical software development. He
39131 combines examples from the development of the TeX
39132 typesetting system with clever jokes, criticisms, and
39133 encouragements.",
39134 acknowledgement = ack-nhfb,
39135 remark = "Published in \booktitle{Theoretical Computer Science},
39136 {\bf 90}(1) 1--15, November 1991.",
39137 }
39138
39139 @TechReport{Barraquand:1989:NPF,
39140 author = "J. Barraquand and B. Langlois and J. Latombe",
39141 title = "Numerical Potential Field Techniques for Robot Path
39142 Planning",
39143 type = "Technical Report",
39144 number = "STAN-CS-89-1285",
39145 institution = inst-STAN-CS,
39146 address = inst-STAN-CS:adr,
39147 pages = "39",
39148 month = oct,
39149 year = "1989",
39150 bibdate = "Wed Nov 26 12:13:45 MST 2025",
39151 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
39152 URL = "",
39153 acknowledgement = ack-nhfb,
39154 }
39155
39156 @TechReport{Rothberg:1989:FSM,
39157 author = "Edward Rothberg and Anoop Gupta",
39158 title = "Fast sparse matrix factorization on modern
39159 workstations",
39160 type = "Technical Report",
39161 number = "STAN-CS-89-1286",
39162 institution = inst-STAN-CS,
39163 address = inst-STAN-CS:adr,
39164 pages = "ii + 15",
39165 month = oct,
39166 year = "1989",
39167 bibdate = "Thu Nov 20 12:11:36 MST 2025",
39168 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
39169 URL = "http://www-db.stanford.edu/TR/CS-TR-89-1286.html",
39170 abstract = "The performance of workstation-class machines has
39171 experienced a dramatic increase in the recent past.
39172 Relatively inexpensive machines which offer 14 MIPS and
39173 2 MFLOPS performance are now available, and machines
39174 with even higher performance are not far off. One
39175 important characteristic of these machines is that they
39176 rely on a small amount of high-speed cache memory for
39177 their high performance. In this paper, we consider the
39178 problem of Cholesky factorization of a large sparse
39179 positive definite system of equations on a high
39180 performance workstation. We find that the major factor
39181 limiting performance is the cost of moving data between
39182 memory and the processor. We use two techniques to
39183 address this limitation; we decrease the number of
39184 memory references and we improve cache behavior to
39185 decrease the cost of each reference. When run on
39186 benchmarks from the Harwell-Boeing Sparse Matrix
39187 Collection, the resulting factorization code is almost
39188 three times as fast as SPARSPAK on a DECStation 3100.
39189 We believe that the issues brought up in this paper
39190 will play an important role in the effective use of
39191 high performance workstations on large numerical
39192 problems.",
39193 acknowledgement = ack-nhfb,
39194 pdfpages = "17",
39195 xxnumber = "CS-TR-89-1286",
39196 }
39197
39198 @TechReport{DeMichiel:1989:PDO,
39199 author = "Linda Gail DeMichiel",
39200 title = "Performing Database Operations Over Mismatched
39201 Domains",
39202 type = "Technical Report",
39203 number = "STAN-CS-89-1287",
39204 institution = inst-STAN-CS,
39205 address = inst-STAN-CS:adr,
39206 pages = "172",
39207 month = oct,
39208 year = "1989",
39209 bibdate = "Wed Nov 26 12:13:45 MST 2025",
39210 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
39211 URL = "",
39212 acknowledgement = ack-nhfb,
39213 }
39214
39215 @TechReport{Talcott:1989:PPF,
39216 author = "Carolyn Talcott",
39217 title = "Programming and proving with function and control
39218 abstractions",
39219 type = "Technical Report",
39220 number = "STAN-CS-89-1288",
39221 institution = inst-STAN-CS,
39222 address = inst-STAN-CS:adr,
39223 pages = "121",
39224 month = oct,
39225 year = "1989",
39226 bibdate = "Thu Nov 20 12:11:36 MST 2025",
39227 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
39228 URL = "http://www-db.stanford.edu/TR/CS-TR-89-1288.html",
39229 abstract = "Rum is an intensional semantic theory of function and
39230 control abstractions as computation primitives. It is a
39231 mathematical foundation for understanding and improving
39232 current practice in symbolic (Lisp-style) computation.
39233 The theory provides, in a single context, a variety of
39234 semantics ranging from structures and rules for
39235 carrying out computations to an interpretation as
39236 functions on the computation domain. Properties of
39237 powerful programming tools such as functions as values,
39238 streams, aspects of object oriented programming, escape
39239 mechanisms, and coroutines can be represented
39240 naturally. In addition a wide variety of operations on
39241 programs can be treated including program
39242 transformations which introduce function and control
39243 abstractions, compiling morphisms that transform
39244 control abstractions into function abstractions, and
39245 operations that transform intensional properties of
39246 programs into extensional properties. The theory goes
39247 beyond a theory of functions computed by programs,
39248 providing tools for treating both intensional and
39249 extensional properties of programs. This provides
39250 operations on programs with meanings to transform as
39251 well as meanings to preserve. Applications of this
39252 theory include expressing and proving properties of
39253 particular programs and of classes of programs and
39254 studying mathematical properties of computation
39255 mechanisms. Additional applications are the design and
39256 implementation of interactive computation systems and
39257 the mechanization of reasoning about computation. These
39258 notes are based on lectures given at the Western
39259 Institute of Computer Science summer program, 31 July
39260 --- 1 August 1986. Here we focus on programming and
39261 proving with function and control abstractions and
39262 present a variety of example programs, properties, and
39263 techniques for proving these properties.",
39264 acknowledgement = ack-nhfb,
39265 xxnumber = "CS-TR-89-1288",
39266 }
39267
39268 @TechReport{Healey:1989:UOI,
39269 author = "Glenn Healey",
39270 title = "The Use of Optical Info in a Machine Vision System",
39271 type = "Technical Report",
39272 number = "STAN-CS-89-1289",
39273 institution = inst-STAN-CS,
39274 address = inst-STAN-CS:adr,
39275 pages = "131",
39276 month = sep,
39277 year = "1989",
39278 bibdate = "Wed Nov 26 12:13:45 MST 2025",
39279 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
39280 URL = "",
39281 acknowledgement = ack-nhfb,
39282 remark = "This is the author's thesis.",
39283 }
39284
39285 @TechReport{Myers:1989:RLQ,
39286 author = "Karen Myers and Devika Subramanian and Ramin Zabih",
39287 title = "Reading list for the Qualifying Examination in
39288 Artificial Intelligence",
39289 type = "Technical Report",
39290 number = "STAN-CS-89-1290",
39291 institution = inst-STAN-CS,
39292 address = inst-STAN-CS:adr,
39293 pages = "16",
39294 month = nov,
39295 year = "1989",
39296 bibdate = "Thu Nov 20 12:11:36 MST 2025",
39297 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
39298 URL = "http://www-db.stanford.edu/TR/CS-TR-89-1290.html",
39299 abstract = "This report contains the reading list for the
39300 Qualifying Examination in Artificial Intelligence.
39301 Areas covered include search, representation,
39302 reasoning, planning and problem solving, learning,
39303 expert systems, vision, robotics, natural language,
39304 perspectives and AI programming. An extensive
39305 bibliography is also provided.",
39306 acknowledgement = ack-nhfb,
39307 xxnumber = "CS-TR-89-1290",
39308 }
39309
39310 @TechReport{Quian:1989:DSD,
39311 author = "Xiaolei Quian",
39312 title = "The Deductive Synthesis of Database Transactions",
39313 type = "Technical Report",
39314 number = "STAN-CS-89-1291",
39315 institution = inst-STAN-CS,
39316 address = inst-STAN-CS:adr,
39317 pages = "194",
39318 month = nov,
39319 year = "1989",
39320 bibdate = "Wed Nov 26 12:13:45 MST 2025",
39321 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
39322 URL = "",
39323 acknowledgement = ack-nhfb,
39324 remark = "This is the author's thesis.",
39325 }
39326
39327 @TechReport{Latombe:1989:RMP,
39328 author = "Jean-Claude Latombe and Anthony Lazanas and Shashank
39329 Shekhar",
39330 title = "Robot Motion Planning with Uncertainty in Control and
39331 Sensing",
39332 type = "Technical Report",
39333 number = "STAN-CS-89-1292",
39334 institution = inst-STAN-CS,
39335 address = inst-STAN-CS:adr,
39336 pages = "iv + 46",
39337 month = nov,
39338 year = "1989",
39339 DOI = "https://doi.org/10.1016/0004-3702(91)90023-D",
39340 bibdate = "Wed Nov 26 12:13:45 MST 2025",
39341 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
39342 URL = "https://apps.dtic.mil/sti/citations/ADA323613;
39343 https://apps.dtic.mil/sti/pdfs/ADA323613.pdf",
39344 acknowledgement = ack-nhfb,
39345 pdfpages = "52",
39346 remark = "Published in \booktitle{Artificial Intelligence}, {\bf
39347 52}(1) 1--47, November 1991.",
39348 }
39349
39350 @TechReport{Bronstein:1989:SFS,
39351 author = "Alexandre Bronstein",
39352 title = "{MLP}: String-Functional Semantics and {Boyer--Moore}
39353 Mechanization for the Formal Verification of
39354 Synchronous Circuits",
39355 type = "Technical Report",
39356 number = "STAN-CS-89-1293",
39357 institution = inst-STAN-CS,
39358 address = inst-STAN-CS:adr,
39359 pages = "viii + 279",
39360 month = dec,
39361 year = "1989",
39362 bibdate = "Wed Nov 26 12:13:45 MST 2025",
39363 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
39364 URL = "https://www.proquest.com/pqdtglobal/docview/303871822",
39365 acknowledgement = ack-nhfb,
39366 pdfpages = "291",
39367 remark = "This is the author's Ph.D. thesis.",
39368 }
39369
39370 @TechReport{Rice:1989:DIP,
39371 author = "James Rice",
39372 title = "The Design and Implementation of {Poligon} and a
39373 High-Performance Concurrent Blackboard System Shell",
39374 type = "Technical Report",
39375 number = "STAN-CS-89-1294",
39376 institution = inst-STAN-CS,
39377 address = inst-STAN-CS:adr,
39378 pages = "88",
39379 month = nov,
39380 year = "1989",
39381 bibdate = "Wed Nov 26 12:13:45 MST 2025",
39382 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
39383 URL = "",
39384 acknowledgement = ack-nhfb,
39385 }
39386
39387 @TechReport{Langlotz:1989:DTA,
39388 author = "Curtis Philip Langlotz",
39389 title = "A Decision-Theoretic Approach to Heuristic Planning",
39390 type = "Technical Report",
39391 number = "STAN-CS-89-1295",
39392 institution = inst-STAN-CS,
39393 address = inst-STAN-CS:adr,
39394 pages = "381",
39395 month = nov,
39396 year = "1989",
39397 bibdate = "Wed Nov 26 12:13:45 MST 2025",
39398 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
39399 URL = "",
39400 acknowledgement = ack-nhfb,
39401 remark = "This is the author's thesis.",
39402 }
39403
39404 @TechReport{Manna:1989:CTP,
39405 author = "Zohar Manna and Amir Pnueli",
39406 title = "Completing the Temporal Picture",
39407 type = "Technical Report",
39408 number = "STAN-CS-89-1296",
39409 institution = inst-STAN-CS,
39410 address = inst-STAN-CS:adr,
39411 pages = "28",
39412 month = dec,
39413 year = "1989",
39414 bibdate = "Thu Nov 20 12:11:36 MST 2025",
39415 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
39416 URL = "http://www-db.stanford.edu/TR/CS-TR-89-1296.html",
39417 abstract = "The paper presents a relatively complete proof system
39418 for proving the validity of temporal properties of
39419 reactive programs. The presented proof system improves
39420 all previous temporal systems, such as [MP83a] and
39421 [MP83b], in that it reduces the validity of program
39422 properties into pure assertional reasoning, not
39423 involving additional temporal reasoning. The proof
39424 system is based on the classification of temporal
39425 properties according to the Borel hierarchy, providing
39426 an appropriate proof rule for each of the main classes,
39427 such as safety, response, and progress properties.",
39428 acknowledgement = ack-nhfb,
39429 xxnumber = "CS-TR-89-1296",
39430 }
39431
39432 @TechReport{Casley:1989:TS,
39433 author = "Ross Casley and Roger F. Crew and Jos{\'e} Meseguer
39434 and Vaughan Pratt",
39435 title = "Temporal Structures",
39436 type = "Technical Report",
39437 number = "STAN-CS-89-1297",
39438 institution = inst-STAN-CS,
39439 address = inst-STAN-CS:adr,
39440 pages = "43",
39441 month = dec,
39442 year = "1989",
39443 bibdate = "Wed Nov 26 12:13:45 MST 2025",
39444 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
39445 URL = "http://boole.stanford.edu/pub/man.pdf",
39446 abstract = "We combine the principles of the
39447 Floyd--Warshall--Kleene algorithm, enriched categories,
39448 and Birkhoff arithmetic, to yield a useful class of
39449 algebras of transitive vertex-labeled spaces. The
39450 motivating application is a uniform theory of abstract
39451 or parametrized time in which to any given notion of
39452 time there corresponds an algebra of concurrent
39453 behaviors and their operations, always the same
39454 operations but interpreted automatically and
39455 appropriately for that notion of time. An interesting
39456 side application is a language for succinctly naming a
39457 wide range of datatypes",
39458 acknowledgement = ack-nhfb,
39459 pdfpages = "31",
39460 remark = "Published in \booktitle{Math. Structures in Comp.
39461 Sci.}, {\bf 1}(2) 179--213, July 1991. PDF file and
39462 abstract are from 9 January 2005 version: a revision of
39463 CTCS-89 paper.",
39464 }
39465
39466 @TechReport{Tuminaro:1989:MAP,
39467 author = "Ray Tuminaro",
39468 title = "Multigrid Algorithms on Parallel Processing Systems",
39469 type = "Technical Report",
39470 number = "STAN-CS-90-1299",
39471 institution = inst-STAN-CS,
39472 address = inst-STAN-CS:adr,
39473 pages = "143",
39474 month = dec,
39475 year = "1989",
39476 bibdate = "Wed Nov 26 12:13:45 MST 2025",
39477 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
39478 URL = "",
39479 acknowledgement = ack-nhfb,
39480 remark = "This is the author's thesis.",
39481 }
39482
39483 @TechReport{Pallas:1989:MSI,
39484 author = "Joseph I. Pallas",
39485 title = "Multiprocessor {Smalltalk}: Implementation,
39486 Performance, and Analysis",
39487 type = "Technical Report",
39488 number = "STAN-CS-90-1315",
39489 institution = inst-STAN-CS,
39490 address = inst-STAN-CS:adr,
39491 pages = "136",
39492 month = dec,
39493 year = "1989",
39494 bibdate = "Wed Nov 26 12:13:45 MST 2025",
39495 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
39496 URL = "",
39497 acknowledgement = ack-nhfb,
39498 remark = "This is the author's thesis.",
39499 }
39500
39501 @TechReport{Gray:1990:LEF,
39502 author = "Cary G. Gray and David R. Cheriton",
39503 title = "Leases: an efficient fault-tolerant mechanism for
39504 distributed file cache consistency",
39505 type = "Technical Report",
39506 number = "STAN-CS-90-1298",
39507 institution = inst-STAN-CS,
39508 address = inst-STAN-CS:adr,
39509 pages = "??",
39510 month = jan,
39511 year = "1990",
39512 bibdate = "Thu Nov 20 12:13:32 MST 2025",
39513 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
39514 URL = "http://www-db.stanford.edu/TR/CS-TR-90-1298.html",
39515 abstract = "Caching introduces the overhead and complexity of
39516 ensuring consistency, reducing some of its performance
39517 benefits. In a distributed system, caching must deal
39518 with the additional complications of communication and
39519 host failures. Leases are proposed as a time-based
39520 mechanism that provides efficient consistent access to
39521 cached data in distributed systems. Non-Byzantine
39522 failures affect performance, not correctness, with
39523 their effect minimized by short leases. An analytic
39524 model and an evaluation for file access in the V system
39525 show that leases of short duration provide good
39526 performance. The impact of leases on performance grows
39527 more significant in systems of larger scale and higher
39528 processor performance.",
39529 acknowledgement = ack-nhfb,
39530 xxnumber = "CS-TR-90-1298",
39531 }
39532
39533 @TechReport{Guibas:1990:RIC,
39534 author = "Leo Guibas and Donald E. Knuth and Micha Sharir",
39535 title = "Randomized Incremental Construction of {Delaunay} and
39536 {Voronoi} Diagrams",
39537 type = "Technical Report",
39538 number = "STAN-CS-90-1300",
39539 institution = inst-STAN-CS,
39540 address = inst-STAN-CS:adr,
39541 pages = "36",
39542 month = jan,
39543 year = "1990",
39544 DOI = "https://doi.org/10.1007/BF01758770",
39545 bibdate = "Wed Nov 26 12:13:45 MST 2025",
39546 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
39547 URL = "",
39548 acknowledgement = ack-nhfb,
39549 remark = "Published in \booktitle{Algorithmica} {\bf 7}(1--6)
39550 381--413, June 1992. doi:10.1007/BF01758770. Also
39551 published in \booktitle{Lecture Notes in Computer
39552 Science}, {\bf 443}.",
39553 }
39554
39555 @TechReport{Goldberg:1990:PEI,
39556 author = "Andrew Goldberg",
39557 title = "Processor-Efficient Implementation of a Maximum Flow
39558 Algorithm",
39559 type = "Technical Report",
39560 number = "STAN-CS-90-1301",
39561 institution = inst-STAN-CS,
39562 address = inst-STAN-CS:adr,
39563 pages = "11",
39564 month = jan,
39565 year = "1990",
39566 bibdate = "Wed Nov 26 12:13:45 MST 2025",
39567 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
39568 URL = "",
39569 acknowledgement = ack-nhfb,
39570 }
39571
39572 @TechReport{Larrabee:1990:EGT,
39573 author = "Tracy Larrabee",
39574 title = "Efficient Generation of Test Patterns Using {Boolean}
39575 Satisfiability",
39576 type = "Technical Report",
39577 number = "STAN-CS-90-1302",
39578 institution = inst-STAN-CS,
39579 address = inst-STAN-CS:adr,
39580 pages = "68",
39581 month = feb,
39582 year = "1990",
39583 DOI = "https://doi.org/10.5555/100195",
39584 bibdate = "Wed Nov 26 12:13:45 MST 2025",
39585 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
39586 URL = "https://dl.acm.org/doi/10.5555/100195;
39587 https://ieeexplore.ieee.org/document/82368",
39588 abstract = "A combinational circuit can be tested for the presence
39589 of a single stuck-at fault by applying a set of inputs
39590 that excite a verifiable output response in that
39591 circuit. If the fault is present, the output will be
39592 different than it would be if the fault were not
39593 present. Given a circuit, the goal of an automatic test
39594 pattern generating system is to generate a set of input
39595 sets that will detect every possible single stuck-at
39596 fault in the circuit. This dissertation describes a new
39597 method for generating test patterns: the Boolean
39598 satisfiability method. The new method generates test
39599 patterns in two steps: First, it constructs a formula
39600 expressing the Boolean difference between the unfaulted
39601 and faulted circuits. Second, it applies a Boolean
39602 satisfiability algorithm to the resulting formula. This
39603 approach differs from most programs now in use, which
39604 directly search the circuit data structure instead of
39605 constructing a formula from it. The new method is quite
39606 general and allows for the addition of any heuristic
39607 used by the structural search methods. The Boolean
39608 satisfiability method has produced excellent results on
39609 popular test pattern generation benchmarks.",
39610 acknowledgement = ack-nhfb,
39611 remark = "This is the author's thesis.",
39612 }
39613
39614 @TechReport{Wiederhold:1990:MAA,
39615 author = "Gio Wiederhold and Tore Risch and Peter Rathmann and
39616 Linda DeMichiel and Surajit Chaudhuri and Byung Suk Lee
39617 and Kincho H. Law and Thierry Barsalou and Dallan
39618 Quass",
39619 title = "A Mediator Architecture for Abstract Data Access",
39620 type = "Technical Report",
39621 number = "STAN-CS-90-1303",
39622 institution = inst-STAN-CS,
39623 address = inst-STAN-CS:adr,
39624 pages = "vii + 164",
39625 day = "23",
39626 month = feb,
39627 year = "1990",
39628 bibdate = "Wed Nov 26 12:13:45 MST 2025",
39629 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
39630 URL = "https://apps.dtic.mil/sti/tr/pdf/ADA227362.pdf",
39631 acknowledgement = ack-nhfb,
39632 pdfpages = "171",
39633 }
39634
39635 @TechReport{Matsushima:1990:MOI,
39636 author = "Toshiyuki Matsushima and Gio Wiederhold",
39637 title = "A Model of Object Identities and Values",
39638 type = "Technical Report",
39639 number = "STAN-CS-90-1304",
39640 institution = inst-STAN-CS,
39641 address = inst-STAN-CS:adr,
39642 pages = "ii + 64",
39643 day = "23",
39644 month = feb,
39645 year = "1990",
39646 bibdate = "Thu Nov 20 12:13:32 MST 2025",
39647 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
39648 URL = "http://i.stanford.edu/pub/cstr/reports/cs/tr/90/1304/CS-TR-90-1304.pdf;
39649 http://www-db.stanford.edu/TR/CS-TR-90-1304.html",
39650 abstract = "In this report, a formalization of the object-oriented
39651 data model is proposed, which integrates value-oriented
39652 models and object-oriented models by providing a simple
39653 semantics of object-identity.\par
39654
39655 The formalism reveals that the semantics of the
39656 object-oriented model consists of two portions. One is
39657 expressed by an algebraic construct, which has
39658 essentially a value-oriented semantics. The other is
39659 expressed by object-identities, which characterize the
39660 essential difference of the object-oriented model from
39661 value-oriented models, such as the relational model and
39662 the logical database model. The value-oriented portion
39663 represents the abstraction of the real world objects,
39664 while the object-oriented portion represents the
39665 existence of the real world objects. These two portions
39666 are integrated by a simple commutative diagram of
39667 modeling functions.\par
39668
39669 The formalism includes the expression of integrity
39670 constraints in its construct of classes. which provides
39671 the natural integration of the logical database model
39672 and the object-oriented database model. More
39673 specifically, we will show that a datalog program can
39674 be expressed as a collection of classes in our
39675 model.\par
39676
39677 As an application of the formalism, formal guidelines
39678 on database design are also discussed.",
39679 abstract-2 = "An algebraic formalization of the object-oriented data
39680 model is proposed. The formalism reveals that the
39681 semantics of the object-oriented model consists of two
39682 portions. One is expressed by an algebraic construct,
39683 which has essentially a value-oriented semantics. The
39684 other is expressed by object-identities, which
39685 characterize the essential difference of the
39686 object-oriented model and value-oriented models, such
39687 as the relational model and the logical database model.
39688 These two portions are integrated by a simple
39689 commutativity of modeling functions. The formalism
39690 includes the expression of integrity constraints in its
39691 construct, which provides the natural integration of
39692 the logical database model and the object-oriented
39693 database model.",
39694 acknowledgement = ack-nhfb,
39695 pdfpages = "66",
39696 xxnumber = "CS-TR-90-1304",
39697 }
39698
39699 @TechReport{Rothberg:1990:CEN,
39700 author = "Edward Rothberg and Anoop Gupta",
39701 title = "A comparative evaluation of nodal and supernodal
39702 parallel sparse matrix factorization: detailed
39703 simulation results",
39704 type = "Technical Report",
39705 number = "STAN-CS-90-1305",
39706 institution = inst-STAN-CS,
39707 address = inst-STAN-CS:adr,
39708 pages = "28",
39709 month = feb,
39710 year = "1990",
39711 bibdate = "Thu Nov 20 12:13:32 MST 2025",
39712 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
39713 URL = "http://www-db.stanford.edu/TR/CS-TR-90-1305.html",
39714 abstract = "In this paper we consider the problem of factoring a
39715 large sparse system of equations on a modestly parallel
39716 shared-memory multiprocessor with a non-trivial memory
39717 hierarchy. Using detailed multiprocessor simulation, we
39718 study the behavior of the parallel sparse factorization
39719 scheme developed at the Oak Ridge National Laboratory.
39720 We then extend the Oak Ridge scheme to incorporate the
39721 notion of supernodal elimination. We present detailed
39722 analyses of the sources of performance degradation for
39723 each of these schemes. We measure the impact of
39724 interprocessor communication costs, processor load
39725 imbalance, overheads introduced in order to distribute
39726 work, and cache behavior on overall parallel
39727 performance. For the three benchmark matrices which we
39728 study, we find that the supernodal scheme gives a
39729 factor of 1.7 to 2.7 performance advantage for 8
39730 processors and a factor of 0.9 to 1.6 for 32
39731 processors. The supemodal scheme exhibits higher
39732 performance due mainly to the fact that it executes
39733 many fewer memory operations and produces fewer cache
39734 misses. However, the natural task grain size for the
39735 supernodal scheme is much larger than that of the Oak
39736 Ridge scheme, making effective distribution of work
39737 more difficult, especially when the number of
39738 processors is large.",
39739 acknowledgement = ack-nhfb,
39740 xxnumber = "CS-TR-90-1305",
39741 }
39742
39743 @TechReport{Altman:1990:EMD,
39744 author = "Russ Biagio Altman",
39745 title = "Exclusion Methods for the Determination of Protein
39746 Structure from Experimental Data",
39747 type = "Technical Report",
39748 number = "STAN-CS-90-1306",
39749 institution = inst-STAN-CS,
39750 address = inst-STAN-CS:adr,
39751 pages = "205",
39752 month = mar,
39753 year = "1990",
39754 bibdate = "Wed Nov 26 12:13:45 MST 2025",
39755 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
39756 URL = "",
39757 acknowledgement = ack-nhfb,
39758 remark = "This is the author's thesis.",
39759 }
39760
39761 @TechReport{Alur:1990:RTL,
39762 author = "Rajeev Alur and Thomas A. Henzinger",
39763 title = "Real-Time Logics: Complexity and Expressiveness",
39764 type = "Technical Report",
39765 number = "STAN-CS-90-1307",
39766 institution = inst-STAN-CS,
39767 address = inst-STAN-CS:adr,
39768 pages = "35",
39769 month = mar,
39770 year = "1990",
39771 bibdate = "Thu Nov 20 12:13:32 MST 2025",
39772 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
39773 URL = "http://www-db.stanford.edu/TR/CS-TR-90-1307.html",
39774 abstract = "The theory of the natural numbers with linear order
39775 and monadic predicates underlies propositional linear
39776 temporal logic. To study temporal logics for real-time
39777 systems, we combine this classical theory of infinite
39778 state sequences with a theory of time, via a monotonic
39779 function that maps every state to its time. The
39780 resulting theory of timed state sequences is shown to
39781 be decidable, albeit nonelementary, and its expressive
39782 power is characterized by omega-regular sets. Several
39783 more expressive variants are proved to be highly
39784 undecidable. This framework allows us to classify a
39785 wide variety of real-time logics according to their
39786 complexity and expressiveness. In fact, it follows that
39787 most formalisms proposed in the literature cannot be
39788 decided. We are, however, able to identify two
39789 elementary real-time temporal logics as expressively
39790 complete fragments of the theory of timed state
39791 sequences, and give tableau-based decision procedures.
39792 Consequently, these two formalisms are well-suited for
39793 the specification and verification of real-time
39794 systems.",
39795 acknowledgement = ack-nhfb,
39796 xxnumber = "CS-TR-90-1307",
39797 }
39798
39799 @TechReport{Patashnik:1990:OCS,
39800 author = "Oren Patashnik",
39801 title = "Optimal Circuit Segmentation for Pseudo-Exhaustive
39802 Testing",
39803 type = "Technical Report",
39804 number = "STAN-CS-90-1308",
39805 institution = inst-STAN-CS,
39806 address = inst-STAN-CS:adr,
39807 pages = "110",
39808 month = mar,
39809 year = "1990",
39810 bibdate = "Wed Nov 26 12:13:45 MST 2025",
39811 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
39812 URL = "",
39813 acknowledgement = ack-nhfb,
39814 remark = "This is the author's thesis.",
39815 }
39816
39817 @TechReport{Pratt:1990:DAW,
39818 author = "Vaughan Pratt",
39819 title = "Dynamic Algebras as a well-behaved fragment of
39820 Relation Algebras",
39821 type = "Technical Report",
39822 number = "STAN-CS-90-1309",
39823 institution = inst-STAN-CS,
39824 address = inst-STAN-CS:adr,
39825 pages = "30",
39826 month = mar,
39827 year = "1990",
39828 bibdate = "Wed Nov 26 12:13:45 MST 2025",
39829 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
39830 URL = "",
39831 acknowledgement = ack-nhfb,
39832 }
39833
39834 @TechReport{Barsalou:1990:VOR,
39835 author = "Thierry Barsalou",
39836 title = "View Objects for Relational Databases",
39837 type = "Technical Report",
39838 number = "STAN-CS-90-1310",
39839 institution = inst-STAN-CS,
39840 address = inst-STAN-CS:adr,
39841 pages = "350",
39842 month = mar,
39843 year = "1990",
39844 bibdate = "Wed Nov 26 12:13:45 MST 2025",
39845 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
39846 URL = "",
39847 acknowledgement = ack-nhfb,
39848 remark = "This is the author's thesis.",
39849 }
39850
39851 @TechReport{Subramanian:1990:CCC,
39852 author = "Ashok Subramanian",
39853 title = "The Computational Complexity of the Circuit Value and
39854 Network Stability Problems",
39855 type = "Technical Report",
39856 number = "STAN-CS-90-1311",
39857 institution = inst-STAN-CS,
39858 address = inst-STAN-CS:adr,
39859 pages = "171",
39860 month = may,
39861 year = "1990",
39862 bibdate = "Wed Nov 26 12:13:45 MST 2025",
39863 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
39864 URL = "",
39865 acknowledgement = ack-nhfb,
39866 remark = "This is the author's thesis.",
39867 }
39868
39869 @TechReport{Kambhampati:1990:VSB,
39870 author = "Subbarao Kambhampati and James A. Hendler",
39871 title = "A validation structure based theory of plan
39872 modification and reuse",
39873 type = "Technical Report",
39874 number = "STAN-CS-90-1312",
39875 institution = inst-STAN-CS,
39876 address = inst-STAN-CS:adr,
39877 pages = "56",
39878 month = jun,
39879 year = "1990",
39880 bibdate = "Thu Nov 20 12:13:32 MST 2025",
39881 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
39882 URL = "http://www-db.stanford.edu/TR/CS-TR-90-1312.html",
39883 abstract = "A framework for the flexible and conservative
39884 modification of plans enables a planner to modify its
39885 plans in response to incremental changes in their
39886 specifications, to reuse its existing plans in new
39887 problem situations, and to efficiently replan in
39888 response to execution time failures. We present a
39889 theory of plan modification applicable to hierarchical
39890 nonlinear planning. Our theory utilizes the validation
39891 structure of stored plans to yield a flexible and
39892 conservative plan modification framework. The
39893 validation structure, which constitutes a hierarchical
39894 explanation of correctness of the plan with respect to
39895 the planner's own knowledge of the domain, is annotated
39896 on the plan as a by-product of initial planning. Plan
39897 modification is formalized as a process of removing
39898 inconsistencies in the validation structure of a plan
39899 when it is being reused in a new (changed) planning
39900 situation. The repair of these inconsistencies involves
39901 removing unnecessary parts of the plan and adding new
39902 non-primitive tasks to the plan to establish missing or
39903 failing validations. The resultant partially reduced
39904 plan (with a consistent validation structure) is sent
39905 to the planner for complete reduction. We discuss the
39906 development of this theory in the PRIAR system, present
39907 an empirical evaluation of this theory, and
39908 characterize its completeness, coverage, efficiency and
39909 limitations.",
39910 acknowledgement = ack-nhfb,
39911 xxnumber = "CS-TR-90-1312",
39912 }
39913
39914 @TechReport{Goldberg:1990:BRP,
39915 author = "Andrew V. Goldberg and Dan Gusfield",
39916 title = "Book review: {{\booktitle{Potokovye Algoritmy (Flow
39917 Algorithms)}} by G. M. Adel'son-Vel'ski, E. A. Dinic,
39918 and A. V. Karzanov}",
39919 type = "Technical Report",
39920 number = "STAN-CS-90-1313",
39921 institution = inst-STAN-CS,
39922 address = inst-STAN-CS:adr,
39923 pages = "ii + 14",
39924 month = jun,
39925 year = "1990",
39926 bibdate = "Thu Nov 20 12:13:32 MST 2025",
39927 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
39928 URL = "http://i.stanford.edu/pub/cstr/reports/cs/tr/90/1313/CS-TR-90-1313.pdf;
39929 http://www-db.stanford.edu/TR/CS-TR-90-1313.html",
39930 abstract = "This is a review of the book ``Flow Algorithms'' by
39931 Adel'son-Vel'ski, Dinic, and Karzanov, well-known
39932 researchers in the area of algorithm design and
39933 analysis. This remarkable book, published in 1975, is
39934 written in Russian and has never been translated into
39935 English. What is remarkable about the book is that it
39936 describes many major results obtained in the Soviet
39937 Union (and originally published in papers by 1976) that
39938 were independently discovered later (and in some cases
39939 much later) in the West. The book also contains some
39940 minor results that we believe are still unknown in the
39941 West. The book is well-written and a pleasure to read,
39942 at least for someone fluent in Russian. Although the
39943 book is fifteen years old and we believe that all the
39944 major results contained in it are known in the West by
39945 now, the book is still of great historical importance.
39946 Hence a complete review is in order. [from the
39947 Introduction]",
39948 acknowledgement = ack-nhfb,
39949 pdfpages = "16",
39950 xxnumber = "CS-TR-90-1313",
39951 }
39952
39953 @TechReport{Koza:1990:GPP,
39954 author = "John R. Koza",
39955 title = "Genetic programming: a paradigm for genetically
39956 breeding populations of computer programs to solve
39957 problems",
39958 type = "Technical Report",
39959 number = "STAN-CS-90-1314",
39960 institution = inst-STAN-CS,
39961 address = inst-STAN-CS:adr,
39962 pages = "130",
39963 month = jun,
39964 year = "1990",
39965 bibdate = "Thu Nov 20 12:13:32 MST 2025",
39966 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
39967 URL = "http://www-db.stanford.edu/TR/CS-TR-90-1314.html",
39968 abstract = "Many seemingly different problems in artificial
39969 intelligence, symbolic processing, and machine learning
39970 can be viewed as requiring discovery of a computer
39971 program that produces some desired output for
39972 particular inputs. When viewed in this way, the process
39973 of solving these problems becomes equivalent to
39974 searching a space of possible computer programs for a
39975 most fit individual computer program. The new ``genetic
39976 programming'' paradigm described herein provides a way
39977 to search for this most fit individual computer
39978 program. In this new ``genetic programming'' paradigm,
39979 populations of computer programs are genetically bred
39980 using the Darwinian principle of survival of the
39981 fittest and using a genetic crossover (recombination)
39982 operator appropriate for genetically mating computer
39983 programs. In this paper, the process of formulating and
39984 solving problems using this new paradigm is illustrated
39985 using examples from various areas. Examples come from
39986 the areas of machine learning of a function; planning;
39987 sequence induction; function identification (including
39988 symbolic regression, empirical discovery, ``data to
39989 function'' symbolic integration, ``data to function''
39990 symbolic differentiation); solving equations, including
39991 differential equations, integral equations, and
39992 functional equations; concept formation; automatic
39993 programming; pattern recognition, time-optimal control;
39994 playing differential pursuer-evader games; neural
39995 network design; and finding a game-playing strategy for
39996 a discrete game in extensive form.",
39997 acknowledgement = ack-nhfb,
39998 xxnumber = "CS-TR-90-1314",
39999 }
40000
40001 @TechReport{Heckerman:1990:PSN,
40002 author = "David Earl Heckerman",
40003 title = "Probabilistic Similarity Networks",
40004 type = "Technical Report",
40005 number = "STAN-CS-90-1316",
40006 institution = inst-STAN-CS,
40007 address = inst-STAN-CS:adr,
40008 pages = "285",
40009 month = jun,
40010 year = "1990",
40011 bibdate = "Wed Nov 26 12:13:45 MST 2025",
40012 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
40013 URL = "",
40014 acknowledgement = ack-nhfb,
40015 remark = "This is the author's thesis.",
40016 }
40017
40018 @TechReport{Barraquand:1990:CMR,
40019 author = "Jerome Barraquand and Jean-Claude Latombe",
40020 title = "Controllability of Mobile Robots with Kinematic
40021 Constraints",
40022 type = "Technical Report",
40023 number = "STAN-CS-90-1317",
40024 institution = inst-STAN-CS,
40025 address = inst-STAN-CS:adr,
40026 pages = "26",
40027 month = jun,
40028 year = "1990",
40029 bibdate = "Wed Nov 26 12:13:45 MST 2025",
40030 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
40031 URL = "",
40032 acknowledgement = ack-nhfb,
40033 }
40034
40035 @TechReport{Rothberg:1990:TIP,
40036 author = "Edward Rothberg and Anoop Gupta",
40037 title = "Techniques for improving the performance of sparse
40038 matrix factorization on multiprocessor workstations",
40039 type = "Technical Report",
40040 number = "STAN-CS-90-1318",
40041 institution = inst-STAN-CS,
40042 address = inst-STAN-CS:adr,
40043 pages = "14",
40044 month = jun,
40045 year = "1990",
40046 bibdate = "Thu Nov 20 12:13:32 MST 2025",
40047 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
40048 URL = "http://www-db.stanford.edu/TR/CS-TR-90-1318.html",
40049 abstract = "In this paper we look at the problem of factoring
40050 large sparse systems of equations on high-performance
40051 multiprocessor workstations. While these multiprocessor
40052 workstations are capable of very high peak floating
40053 point computation rates, most existing sparse
40054 factorization codes achieve only a small fraction of
40055 this potential. A major limiting factor is the cost of
40056 memory accesses performed during the factorization. ln
40057 this paper, we describe a parallel factorization code
40058 which utilizes the supernodal structure of the matrix
40059 to reduce the number of memory references. We also
40060 propose enhancements that significantly reduce the
40061 overall cache miss rate. The result is greatly
40062 increased factorization performance. We present
40063 experimental results from executions of our codes on
40064 the Silicon Graphics 4D/380 multiprocessor. Using eight
40065 processors, we find that the supernodal parallel code
40066 achieves a computation rate of approximately 40 MFLOPS
40067 when factoring a range of benchmark matrices. This is
40068 more than twice as fast as the parallel nodal code
40069 developed at the Oak Ridge National Laboratory running
40070 on the SGI 4D/380.",
40071 acknowledgement = ack-nhfb,
40072 xxnumber = "CS-TR-90-1318",
40073 }
40074
40075 @TechReport{Bellin:1990:MPT,
40076 author = "Gianluigi Bellin",
40077 title = "Mechanizing Proof Theory: Resource-Aware Logics and
40078 Proof Transformations to Extract Implicit Information",
40079 type = "Technical Report",
40080 number = "STAN-CS-90-1319",
40081 institution = inst-STAN-CS,
40082 address = inst-STAN-CS:adr,
40083 pages = "237",
40084 month = jun,
40085 year = "1990",
40086 bibdate = "Wed Nov 26 12:13:45 MST 2025",
40087 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
40088 URL = "",
40089 acknowledgement = ack-nhfb,
40090 remark = "This is the author's thesis.",
40091 }
40092
40093 @TechReport{Jimison:1990:RGI,
40094 author = "Holly Brugge Jimison",
40095 title = "A Representation for Gaining Insight into Clinical
40096 Decision Models",
40097 type = "Technical Report",
40098 number = "STAN-CS-90-1320",
40099 institution = inst-STAN-CS,
40100 address = inst-STAN-CS:adr,
40101 pages = "202",
40102 month = jun,
40103 year = "1990",
40104 bibdate = "Wed Nov 26 12:13:45 MST 2025",
40105 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
40106 URL = "",
40107 acknowledgement = ack-nhfb,
40108 remark = "This is the author's thesis.",
40109 }
40110
40111 @TechReport{Manna:1990:TRP,
40112 author = "Zohar Manna and Amir Pnueli",
40113 title = "Tools and Rules for the Practicing Verifier",
40114 type = "Technical Report",
40115 number = "STAN-CS-90-1321",
40116 institution = inst-STAN-CS,
40117 address = inst-STAN-CS:adr,
40118 pages = "35",
40119 month = jul,
40120 year = "1990",
40121 bibdate = "Thu Nov 20 12:13:32 MST 2025",
40122 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
40123 URL = "http://www-db.stanford.edu/TR/CS-TR-90-1321.html",
40124 abstract = "The paper presents a minimal proof theory which is
40125 adequate for proving the main important temporal
40126 properties of reactive programs. The properties we
40127 consider consist of the classes of invariance,
40128 response, and precedence properties. For each of these
40129 classes we present a small set of rules that is
40130 complete for verifying properties belonging to this
40131 class. We illustrate the application of these rules by
40132 analyzing and verifying the properties of a new
40133 algorithm for mutual exclusion.",
40134 acknowledgement = ack-nhfb,
40135 xxnumber = "CS-TR-90-1321",
40136 }
40137
40138 @TechReport{Shoham:1990:ESF,
40139 author = "Yoav Shoham and Fangzhen Lin",
40140 title = "Epistemic Semantics for Fixed-Point Nonmonotonic
40141 Logics",
40142 type = "Technical Report",
40143 number = "STAN-CS-90-1322",
40144 institution = inst-STAN-CS,
40145 address = inst-STAN-CS:adr,
40146 pages = "11",
40147 month = jul,
40148 year = "1990",
40149 bibdate = "Wed Nov 26 12:13:45 MST 2025",
40150 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
40151 URL = "",
40152 acknowledgement = ack-nhfb,
40153 }
40154
40155 @TechReport{Moses:1990:P,
40156 author = "Eyal Mozes and Yoav Shoham",
40157 title = "Protograms",
40158 type = "Technical Report",
40159 number = "STAN-CS-90-1323",
40160 institution = inst-STAN-CS,
40161 address = inst-STAN-CS:adr,
40162 pages = "i + 18",
40163 month = jul,
40164 year = "1990",
40165 bibdate = "Thu Nov 20 12:13:32 MST 2025",
40166 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
40167 URL = "http://i.stanford.edu/pub/cstr/reports/cs/tr/90/1323/CS-TR-90-1323.pdf;
40168 http://www-db.stanford.edu/TR/CS-TR-90-1323.html",
40169 abstract = "Motivated largely by tasks that require control of
40170 complex processes in a dynamic environment, we
40171 introduce a new computational construct called a
40172 protogram. A protogram is a program specifying an
40173 abstract course of action, a course that allows for a
40174 range of specific actions, from which a choice is made
40175 through interaction with other protograms. We discuss
40176 the intuition behind the notion, and then explore some
40177 of the details involved in implementing it.
40178 Specifically, we (a) describe a general scheme of
40179 protogram interaction, (b) describe a protogram
40180 interpreter that has been implemented, dealing with
40181 some special cases, (c) describe three applications of
40182 the protogram interpreter, one in data processing and
40183 two in robotics (both currently only implemented as
40184 simulations), (d) describe some more general possible
40185 implementations of a protogram interpreter, and (e)
40186 discuss how protograms can be useful for the Gofer
40187 project. We also briefly discuss the origins of
40188 protograms in psychology and linguistics, compare
40189 protograms to blackboard and subsumption architectures,
40190 and discuss directions for future research.",
40191 acknowledgement = ack-nhfb,
40192 pdfpages = "19",
40193 xxnumber = "CS-TR-90-1323",
40194 }
40195
40196 @TechReport{Guerreira:1990:CMIb,
40197 author = "Ramiro A. de T. Guerreira and Andrea S. Hemerly and
40198 Yoav Shoham",
40199 title = "On the complexity of monotonic inheritance with
40200 roles",
40201 type = "Technical Report",
40202 number = "STAN-CS-90-1324",
40203 institution = inst-STAN-CS,
40204 address = inst-STAN-CS:adr,
40205 pages = "ii + 6",
40206 month = jul,
40207 year = "1990",
40208 bibdate = "Thu Nov 20 12:13:32 MST 2025",
40209 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
40210 URL = "http://i.stanford.edu/pub/cstr/reports/cs/tr/90/1324/CS-TR-90-1324.pdf;
40211 http://www-db.stanford.edu/TR/CS-TR-90-1324.html",
40212 abstract = "We investigate the complexity of reasoning with
40213 monotonic inheritance hierarchies that contain, beside
40214 ISA edges, also ROLE (or FUNCTION) edges. A ROLE edge
40215 is an edge labelled with a name such as spouse of or
40216 brother of. We call such networks ISAR networks. Given
40217 a network with n vertices and m edges, we consider two
40218 problems: ($ P_1$) determining whether the network
40219 implies an isa relation between two particular nodes,
40220 and ($ P_2$) determining all isa relations implied by
40221 the network. As is well known, without ROLE edges the
40222 time complexity of $ P_1$, is O(m), and the time
40223 complexity of $ P_2$ is $ O(n^3) $. Unfortunately, the
40224 results do not extend naturally to ISAR networks,
40225 except in a very restricted case. For general ISAR
40226 network we first give an polynomial algorithm by an
40227 easy reduction to propositional Horn theory. As the
40228 degree of the polynomial is quite high ($ O(m n^4)$ for
40229 $ P_1$, $ O(m n^6)$ for $ P_2 $), we then develop a
40230 more direct algorithm. For both $ P_1 $ and $ P_2 $ its
40231 complexity is $ O(n^3 + m^2)$. Actually, a finer
40232 analysis of the algorithm reveals a complexity of $ O(n
40233 r(\log r) + n^2 r + n^3)$, where r is the number of
40234 different ROLE labels. One corollary is that if we fix
40235 the number of ROLE labels, the complexity of our
40236 algorithm drops back to $ O(n^3) $.",
40237 acknowledgement = ack-nhfb,
40238 pdfpages = "8",
40239 xxnumber = "CS-TR-90-1324",
40240 }
40241
40242 @TechReport{Lavignon:1990:TA,
40243 author = "Jean-Fran{\c{c}}ois Lavignon and Yoav Shoham",
40244 title = "Temporal Automata",
40245 type = "Technical Report",
40246 number = "STAN-CS-90-1325",
40247 institution = inst-STAN-CS,
40248 address = inst-STAN-CS:adr,
40249 pages = "41",
40250 month = jul,
40251 year = "1990",
40252 bibdate = "Wed Nov 26 12:13:45 MST 2025",
40253 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
40254 URL = "",
40255 acknowledgement = ack-nhfb,
40256 }
40257
40258 @TechReport{Kaelbling:1990:LES,
40259 author = "Leslie Pack Kaelbling",
40260 title = "Learning in Embedded Systems",
40261 type = "Technical Report",
40262 number = "STAN-CS-90-1326",
40263 institution = inst-STAN-CS,
40264 address = inst-STAN-CS:adr,
40265 pages = "199",
40266 month = jun,
40267 year = "1990",
40268 bibdate = "Wed Nov 26 12:13:45 MST 2025",
40269 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
40270 URL = "",
40271 acknowledgement = ack-nhfb,
40272 remark = "This is the author's thesis.",
40273 }
40274
40275 @TechReport{Plambeck:1990:STC,
40276 author = "Thane E. Plambeck",
40277 title = "Semigroups and Transitive Closure",
40278 type = "Technical Report",
40279 number = "STAN-CS-90-1327",
40280 institution = inst-STAN-CS,
40281 address = inst-STAN-CS:adr,
40282 pages = "123",
40283 month = aug,
40284 year = "1990",
40285 bibdate = "Wed Nov 26 12:13:45 MST 2025",
40286 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
40287 URL = "",
40288 acknowledgement = ack-nhfb,
40289 remark = "This is the author's thesis.",
40290 }
40291
40292 @TechReport{Radzik:1990:TBN,
40293 author = "Tomasz Radzik and Andrew V. Goldberg",
40294 title = "Tight Bounds on the Number of Minimum-Mean Cycle
40295 Cancellations",
40296 type = "Technical Report",
40297 number = "STAN-CS-90-1328",
40298 institution = inst-STAN-CS,
40299 address = inst-STAN-CS:adr,
40300 pages = "19",
40301 month = sep,
40302 year = "1990",
40303 bibdate = "Wed Nov 26 12:13:45 MST 2025",
40304 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
40305 URL = "",
40306 acknowledgement = ack-nhfb,
40307 }
40308
40309 @TechReport{Henzinger:1990:IMR,
40310 author = "Thomas A. Henzinger and Zohar Manna and Amir Pnueli",
40311 title = "An Interleaving Model for Real Time",
40312 type = "Technical Report",
40313 number = "STAN-CS-90-1329",
40314 institution = inst-STAN-CS,
40315 address = inst-STAN-CS:adr,
40316 pages = "36",
40317 month = sep,
40318 year = "1990",
40319 bibdate = "Thu Nov 20 12:13:32 MST 2025",
40320 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
40321 URL = "http://www-db.stanford.edu/TR/CS-TR-90-1329.html",
40322 abstract = "The interleaving model is both adequate and
40323 sufficiently abstract to allow for the practical
40324 specification and verification of many properties of
40325 concurrent systems. We incorporate real time into this
40326 model by defining the abstract notion of a real-time
40327 transition system as a conservative extension of
40328 traditional transition systems: qualitative fairness
40329 requirements are replaced (and superseded) by
40330 quantitative lower-bound and upper-bound real-time
40331 requirements for transitions. We present proof rules to
40332 establish lower and upper real-time bounds for response
40333 properties of real-time transition systems. This proof
40334 system can be used to verify bounded-invariance and
40335 bounded-response properties, such as timely termination
40336 of shared-variables multi-process systems, whose
40337 semantics is defined in terms of real-time transition
40338 systems.",
40339 acknowledgement = ack-nhfb,
40340 xxnumber = "CS-TR-90-1329",
40341 }
40342
40343 @TechReport{Rothberg:1990:PIH,
40344 author = "Edward Rothberg and Anoop Gupta",
40345 title = "Parallel {ICCG} on a Hierarchical Memory
40346 Multiprocessor --- Addressing the Triangular Solve
40347 Bottleneck",
40348 type = "Technical Report",
40349 number = "STAN-CS-90-1330",
40350 institution = inst-STAN-CS,
40351 address = inst-STAN-CS:adr,
40352 pages = "i + 20",
40353 month = oct,
40354 year = "1990",
40355 bibdate = "Thu Nov 20 12:13:32 MST 2025",
40356 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
40357 URL = "http://www-db.stanford.edu/TR/CS-TR-90-1330.html",
40358 abstract = "The incomplete Cholesky conjugate gradient (ICCG)
40359 algorithm is a commonly used iterative method for
40360 solving large sparse systems of equations. In this
40361 paper, we study the parallel solution of sparse
40362 triangular systems of equations, the most difficult
40363 aspect of implementing the ICCG method on a
40364 multiprocessor. We focus on shared-memory
40365 multiprocessor architectures with deep memory
40366 hierarchies. On such architectures we find that
40367 previously proposed parallelization approaches result
40368 in little or no speedup. The reason is that these
40369 approaches cause significant increases in the amount of
40370 memory system traffic as compared to a sequential
40371 approach. Increases of as much as a factor of 10 on
40372 four processors were observed. In this paper we propose
40373 new techniques for limiting these increases, including
40374 data remappings to increase spatial locality, new
40375 processor synchronization techniques to decrease the
40376 use of auxiliary data structures, and data partitioning
40377 techniques to reduce the amount of interprocessor
40378 communication. With these techniques, memory system
40379 traffic is reduced to as little as one sixth of its
40380 previous volume. The resulting speedups are greatly
40381 improved as well, although they are still much less
40382 than linear. We discuss the factors that limit further
40383 speedups. We present both simulation results and
40384 results of experiments on an SGI 4D/340
40385 multiprocessor.",
40386 acknowledgement = ack-nhfb,
40387 keywords = "incomplete Cholesky conjugate gradient (ICCG)
40388 algorithm",
40389 pdfpages = "21",
40390 xxnumber = "CS-TR-90-1330",
40391 }
40392
40393 @TechReport{Snoeyink:1990:TAC,
40394 author = "Jack Scott Snoeyink",
40395 title = "Topological Approaches in Computational Geometry",
40396 type = "Technical Report",
40397 number = "STAN-CS-90-1331",
40398 institution = inst-STAN-CS,
40399 address = inst-STAN-CS:adr,
40400 pages = "104",
40401 month = nov,
40402 year = "1990",
40403 bibdate = "Wed Nov 26 12:13:45 MST 2025",
40404 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
40405 URL = "",
40406 acknowledgement = ack-nhfb,
40407 }
40408
40409 @TechReport{Schoen:1990:IAD,
40410 author = "Eric Jonathan Schoen",
40411 title = "Intelligent Assistance for the Design of
40412 Knowledge-Based Systems",
40413 type = "Technical Report",
40414 number = "STAN-CS-90-1332",
40415 institution = inst-STAN-CS,
40416 address = inst-STAN-CS:adr,
40417 pages = "258",
40418 month = oct,
40419 year = "1990",
40420 bibdate = "Wed Nov 26 12:13:45 MST 2025",
40421 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
40422 URL = "",
40423 acknowledgement = ack-nhfb,
40424 }
40425
40426 @TechReport{Spreitzer:1990:CSD,
40427 author = "Michael J. Spreitzer",
40428 title = "Comparing Structurally Different Views of a {VLSI}
40429 Design",
40430 type = "Technical Report",
40431 number = "STAN-CS-90-1333",
40432 institution = inst-STAN-CS,
40433 address = inst-STAN-CS:adr,
40434 pages = "161",
40435 month = oct,
40436 year = "1990",
40437 bibdate = "Wed Nov 26 12:13:45 MST 2025",
40438 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
40439 URL = "",
40440 acknowledgement = ack-nhfb,
40441 }
40442
40443 @TechReport{Blatt:1990:SCW,
40444 author = "Miriam Greta Blatt",
40445 title = "Soft Configurable Wafer Scale Integration Design,
40446 Implementation, and Yield Analysis",
40447 type = "Technical Report",
40448 number = "STAN-CS-90-1334",
40449 institution = inst-STAN-CS,
40450 address = inst-STAN-CS:adr,
40451 pages = "vii + 116",
40452 month = oct,
40453 year = "1990",
40454 bibdate = "Wed Nov 26 12:13:45 MST 2025",
40455 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
40456 URL = "https://apps.dtic.mil/sti/tr/pdf/ADA326034.pdf",
40457 abstract = "Soft-Configurable Wafer Scale Integration uses
40458 software controlled switches to connect up the
40459 fault-free parts of a wafer. Compared to hard
40460 configuration, the soft configurable approach has the
40461 advantages of providing low-cost connections and
40462 runtime fault tolerance. The dissertation describes how
40463 to achieve soft configuration with high performance,
40464 presenting a pipelined memory system implemented using
40465 this approach. The yield of the prototype is evaluated
40466 in two phases. Fault simulation applies measured defect
40467 statistics to the layout to predict the yield of each
40468 circuit unit. These unit yields are combined to produce
40469 wafer yields using redundancy models appropriate to
40470 wafer scale integration. The redundancy models
40471 constrain wafer yield by system requirements such as
40472 the minimum number of working circuit units, and
40473 whether these working units are distributed evenly
40474 around the wafer. Choice of redundancy model
40475 significantly affects the resulting wafer yield.",
40476 acknowledgement = ack-nhfb,
40477 pdfpages = "125",
40478 }
40479
40480 @TechReport{Shoham:1990:AOP,
40481 author = "Yoav Shoham",
40482 title = "Agent-Oriented Programming",
40483 type = "Technical Report",
40484 number = "STAN-CS-90-1335",
40485 institution = inst-STAN-CS,
40486 address = inst-STAN-CS:adr,
40487 pages = "52",
40488 month = oct,
40489 year = "1990",
40490 bibdate = "Wed Nov 26 12:13:45 MST 2025",
40491 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
40492 URL = "",
40493 acknowledgement = ack-nhfb,
40494 }
40495
40496 @TechReport{Knuth:1990:CUM,
40497 author = "Donald E. Knuth",
40498 title = "{CWEB} User Manual: The {CWEB} System of Structured
40499 Documentation",
40500 type = "Technical Report",
40501 number = "STAN-CS-90-1336",
40502 institution = inst-STAN-CS,
40503 address = inst-STAN-CS:adr,
40504 pages = "214",
40505 month = oct,
40506 year = "1990",
40507 bibdate = "Wed Nov 26 12:13:45 MST 2025",
40508 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
40509 URL = "",
40510 acknowledgement = ack-nhfb,
40511 remark = "A related document by DEK and Silvio Levy is in annual
40512 TeX Live distribution trees, such as
40513 https://tug.ctan.org/web/cweb/cwebman.pdf.",
40514 }
40515
40516 @TechReport{Galbiati:1990:SUL,
40517 author = "Louis Galbiati and Carolyn Talcott",
40518 title = "A Simplifier for Untyped Lambda Expressions",
40519 type = "Technical Report",
40520 number = "STAN-CS-90-1337",
40521 institution = inst-STAN-CS,
40522 address = inst-STAN-CS:adr,
40523 pages = "ii + 26",
40524 month = oct,
40525 year = "1990",
40526 bibdate = "Thu Nov 20 12:13:32 MST 2025",
40527 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
40528 URL = "http://www-db.stanford.edu/TR/CS-TR-90-1337.html",
40529 abstract = "Many applicative programming languages are based on
40530 the call-by-value lambda calculus. For these languages
40531 tools such as compilers, partial evaluators, and other
40532 transformation systems often make use of rewriting
40533 systems that incorporate some form of beta reduction.
40534 For purposes of automatic rewriting it is important to
40535 develop extensions of beta-value reduction and to
40536 develop methods for guaranteeing termination. This
40537 paper describes an extension of beta-value reduction
40538 and a method based on abstract interpretation for
40539 controlling rewriting to guarantee termination. The
40540 main innovations are (1) the use of rearrangement rules
40541 in combination with beta-value reduction to increase
40542 the power of the rewriting system and (2) the
40543 definition of a non-standard interpretation of
40544 expressions, the generates relation, as a basis for
40545 designing terminating strategies for rewriting.",
40546 acknowledgement = ack-nhfb,
40547 pdfpages = "29",
40548 xxnumber = "CS-TR-90-1337",
40549 }
40550
40551 @TechReport{Haddad:1990:TTP,
40552 author = "Ramsey W. Haddad",
40553 title = "Triangularization: a Two-Processor Schedule Problem",
40554 type = "Technical Report",
40555 number = "STAN-CS-90-1338",
40556 institution = inst-STAN-CS,
40557 address = inst-STAN-CS:adr,
40558 pages = "126",
40559 month = nov,
40560 year = "1990",
40561 bibdate = "Wed Nov 26 12:13:45 MST 2025",
40562 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
40563 URL = "",
40564 acknowledgement = ack-nhfb,
40565 }
40566
40567 @TechReport{Nazarian:1990:BDC,
40568 author = "Taleen Nazarian",
40569 title = "Bibliography, {Department of Computer Science}
40570 Technical Reports, 1963--1990",
40571 type = "Technical Report",
40572 number = "STAN-CS-90-1339",
40573 institution = inst-STAN-CS,
40574 address = inst-STAN-CS:adr,
40575 pages = "86",
40576 month = dec,
40577 year = "1990",
40578 bibdate = "Wed Nov 26 12:13:45 MST 2025",
40579 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
40580 URL = "",
40581 acknowledgement = ack-nhfb,
40582 }
40583
40584 @TechReport{Mason:1990:PQ,
40585 author = "Ian A. Mason and Joseph D. Pehoushek and Carolyn L.
40586 Talcott and Joseph S. Weening",
40587 title = "Programming in {QLisp}",
40588 type = "Technical Report",
40589 number = "STAN-CS-90-1340",
40590 institution = inst-STAN-CS,
40591 address = inst-STAN-CS:adr,
40592 pages = "iv + 56",
40593 day = "24",
40594 month = oct,
40595 year = "1990",
40596 bibdate = "Thu Nov 20 12:13:32 MST 2025",
40597 bibsource = "http://www.math.utah.edu/pub/tex/bib/common-lisp.bib;
40598 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
40599 URL = "http://www-db.stanford.edu/TR/CS-TR-90-1340.html",
40600 abstract = "Qlisp is an extension of Common Lisp, to support
40601 parallel programming. It was initially designed by John
40602 McCarthy and Richard Gabriel in 1984. Since then it has
40603 been under development both at Stanford University and
40604 Lucid, Inc. and has been implemented on several
40605 commercial shared-memory parallel computers. Qlisp is a
40606 queue-based, shared-memory, multi-processing language.
40607 This report is a tutorial introduction to the Stanford
40608 dialect of Qlisp.",
40609 acknowledgement = ack-nhfb,
40610 pdfpages = "60",
40611 subject-dates = "John McCarthy (4 September 1927--24 October 2011)",
40612 xxnumber = "CS-TR-90-1340",
40613 }
40614
40615 @TechReport{Wiederhold:1990:TM,
40616 author = "G. Wiederhold and P. Wagner and Stefano Ceri",
40617 title = "Towards Megaprogramming",
40618 type = "Technical Report",
40619 number = "STAN-CS-90-1341",
40620 institution = inst-STAN-CS,
40621 address = inst-STAN-CS:adr,
40622 pages = "45",
40623 month = nov,
40624 year = "1990",
40625 bibdate = "Wed Nov 26 12:13:45 MST 2025",
40626 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
40627 URL = "",
40628 acknowledgement = ack-nhfb,
40629 }
40630
40631 @TechReport{Pratt:1990:MCG,
40632 author = "Vaughan Pratt",
40633 title = "Modeling Concurrency with Geometry",
40634 type = "Technical Report",
40635 number = "STAN-CS-90-1342",
40636 institution = inst-STAN-CS,
40637 address = inst-STAN-CS:adr,
40638 pages = "13",
40639 month = nov,
40640 year = "1990",
40641 bibdate = "Thu Nov 20 12:13:32 MST 2025",
40642 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
40643 URL = "http://www-db.stanford.edu/TR/CS-TR-90-1342.html",
40644 abstract = "The phenomena of branching time and true or
40645 noninterleaving concurrency find their respective homes
40646 in automata and schedules. But these two models of
40647 computation are formally equivalent via Birkhoff
40648 duality, an equivalence we expound on here in tutorial
40649 detail. So why should these phenomena prefer one over
40650 the other? We identify dimension as the culprit:
40651 1-dimensional automata are skeletons permitting only
40652 interleaving concurrency, whereas true n-fold
40653 concurrency resides in transitions of dimension n. The
40654 truly concurrent automaton dual to a schedule is not a
40655 skeletal distributive lattice but a solid one! We
40656 introduce true nondeterminism and define it as monoidal
40657 homotopy; from this perspective nondeterminism in
40658 ordinary automata arises from forking and joining
40659 creating nontrivial homotopy. The automaton dual to a
40660 poset schedule is simply connected whereas that dual to
40661 an event structure schedule need not be, according to
40662 monoidal homotopy though not to group homotopy. We
40663 conclude with a formal definition of higher dimensional
40664 automaton as an n-complex or n-category, whose two
40665 essential axioms are associativity of concatenation
40666 within dimension and an interchange principle between
40667 dimensions.",
40668 acknowledgement = ack-nhfb,
40669 xxnumber = "CS-TR-90-1342",
40670 }
40671
40672 @TechReport{Pratt:1990:ALP,
40673 author = "Vaughan Pratt",
40674 title = "Action Logic and Pure Induction",
40675 type = "Technical Report",
40676 number = "STAN-CS-90-1343",
40677 institution = inst-STAN-CS,
40678 address = inst-STAN-CS:adr,
40679 pages = "23",
40680 month = nov,
40681 year = "1990",
40682 bibdate = "Thu Nov 20 12:13:32 MST 2025",
40683 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib;
40684 https://www.math.utah.edu/pub/tex/bib/string-matching.bib",
40685 URL = "http://www-db.stanford.edu/TR/CS-TR-90-1343.html",
40686 abstract = "In Floyd--Hoare logic, programs are dynamic while
40687 assertions are static (hold at states). In action logic
40688 the two notions become one, with programs viewed as
40689 on-the-fly assertions whose truth is evaluated along
40690 intervals instead of at states. Action logic is an
40691 equational theory ACT conservatively extending the
40692 equational theory REG of regular expressions with
40693 operations preimplication $ a \to b $ (had $ a \# $
40694 then $b$) and postimplication $ b \leftarrow a$ ($b$
40695 if-ever $a$). Unlike REG, ACT is finitely based, makes
40696 $ a^* $ reflexive transitive closure, and has an
40697 equivalent Hilbert system. The crucial axiom is that of
40698 pure induction, $ {(a \to a)}^* = a \to a$.",
40699 acknowledgement = ack-nhfb,
40700 xxnumber = "CS-TR-90-1343",
40701 }
40702
40703 @TechReport{Cheriton:1990:PHS,
40704 author = "David R. Cheriton and Hendrik A. Goosen and Patrick D.
40705 Boyle",
40706 title = "{ParaDiGM}: a highly scalable shared-memory
40707 multi-computer architecture",
40708 type = "Technical Report",
40709 number = "STAN-CS-90-1344",
40710 institution = inst-STAN-CS,
40711 address = inst-STAN-CS:adr,
40712 pages = "19",
40713 month = nov,
40714 year = "1990",
40715 bibdate = "Thu Nov 20 12:13:32 MST 2025",
40716 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
40717 URL = "http://www-db.stanford.edu/TR/CS-TR-90-1344.html",
40718 abstract = "ParaDiGM is a highly scalable shared-memory
40719 multi-computer architecture. It is being developed to
40720 demonstrate the feasibility of building a relatively
40721 low-cost shared-memory parallel computer that scales to
40722 large configurations, and yet provides sequential
40723 programs with performance comparable to a high-end
40724 microprocessor. A key problem is building a scalable
40725 memory hierarchy. In this paper we describe the
40726 ParaDiGM architecture, highlighting the innovations of
40727 our approach and presenting results of our evaluation
40728 of the design. We envision that scalable shared-memory
40729 multiprocessors like ParaDiGM will soon become the
40730 dominant form of parallel processing, even for very
40731 large-scale computation, providing a uniform platform
40732 for parallel programming systems and applications.",
40733 acknowledgement = ack-nhfb,
40734 xxnumber = "CS-TR-90-1344",
40735 }
40736
40737 @TechReport{Laumond:1990:NMP,
40738 author = "Jean-Paul Laumond",
40739 title = "Nonholonomic Motion Planning versus Controllability
40740 via the Multibody Car System Example",
40741 type = "Technical Report",
40742 number = "STAN-CS-90-1345",
40743 institution = inst-STAN-CS,
40744 address = inst-STAN-CS:adr,
40745 pages = "i + 52",
40746 month = dec,
40747 year = "1990",
40748 bibdate = "Thu Nov 20 12:13:32 MST 2025",
40749 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
40750 URL = "http://www-db.stanford.edu/TR/CS-TR-90-1345.html",
40751 abstract = "A multibody car system is a non-nilpotent,
40752 non-regular, triangularizable and well-controllable
40753 system. One goal of the current paper is to prove this
40754 obscure assertion. But its main goal is to explain and
40755 enlighten what it means. Motion planning is an already
40756 old and classical problem in Robotics. A few years ago
40757 a new instance of this problem has appeared in the
40758 literature: motion planning for nonholonomic systems.
40759 While useful tools in motion planning come from
40760 Computer Science and Mathematics (Computational
40761 Geometry, Real Algebraic Geometry), nonholonomic motion
40762 planning needs some Control Theory and more Mathematics
40763 (Differential Geometry). First of all, this paper tries
40764 to give a computational reading of the tools from
40765 Differential Geometric Control Theory required by
40766 planning. Then it shows that the presence of obstacles
40767 in the real world of a real robot challenges
40768 Mathematics with some difficult questions which are
40769 topological in nature, and have been solved only
40770 recently, within the framework of Sub-Riemannian
40771 Geometry. This presentation is based upon a reading of
40772 works recently developed by (1) Murray and Sastry, (2)
40773 Lafferiere and Sussmann, and (3) Bellaiche, Jacobs and
40774 Laumond.",
40775 acknowledgement = ack-nhfb,
40776 pdfpages = "53",
40777 xxnumber = "CS-TR-90-1345",
40778 }
40779
40780 @TechReport{Lee:1990:EIO,
40781 author = "Byung S. Lee",
40782 title = "Efficiency in Instantiating Objects from Relational
40783 Databases Through Views",
40784 type = "Technical Report",
40785 number = "STAN-CS-90-1346",
40786 institution = inst-STAN-CS,
40787 address = inst-STAN-CS:adr,
40788 pages = "147",
40789 month = dec,
40790 year = "1990",
40791 bibdate = "Wed Nov 26 12:13:45 MST 2025",
40792 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
40793 URL = "",
40794 acknowledgement = ack-nhfb,
40795 }
40796
40797 @TechReport{Merchant:1990:STB,
40798 author = "Arif Merchant",
40799 title = "Settling Time Bounds for {M|G|1} Queues",
40800 type = "Technical Report",
40801 number = "STAN-CS-91-1349",
40802 institution = inst-STAN-CS,
40803 address = inst-STAN-CS:adr,
40804 pages = "6",
40805 month = dec,
40806 year = "1990",
40807 bibdate = "Wed Nov 26 12:13:45 MST 2025",
40808 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
40809 URL = "",
40810 acknowledgement = ack-nhfb,
40811 }
40812
40813 @TechReport{Horvitz:1990:CAU,
40814 author = "Eric Horvitz",
40815 title = "Computation and Action Under Bounded Resources",
40816 type = "Technical Report",
40817 number = "STAN-CS-92-1430 (KSL-90-76)",
40818 institution = inst-STAN-CS,
40819 address = inst-STAN-CS:adr,
40820 pages = "320",
40821 month = dec,
40822 year = "1990",
40823 bibdate = "Wed Nov 26 12:13:45 MST 2025",
40824 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
40825 URL = "",
40826 acknowledgement = ack-nhfb,
40827 remark = "This is the author's thesis.",
40828 }
40829
40830 @TechReport{Merchant:1991:AMP,
40831 author = "Arif Merchant",
40832 title = "Analytical Models for the Performance Analysis of
40833 Banyan Networks",
40834 type = "Technical Report",
40835 number = "STAN-CS-91-1347",
40836 institution = inst-STAN-CS,
40837 address = inst-STAN-CS:adr,
40838 pages = "120",
40839 month = jan,
40840 year = "1991",
40841 bibdate = "Wed Nov 26 12:13:45 MST 2025",
40842 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
40843 URL = "",
40844 acknowledgement = ack-nhfb,
40845 }
40846
40847 @TechReport{Merchant:1991:MCA,
40848 author = "Arif Merchant",
40849 title = "A {Markov} Chain Approximation for the Analysis of
40850 {Banyan} Networks",
40851 type = "Technical Report",
40852 number = "STAN-CS-91-1348",
40853 institution = inst-STAN-CS,
40854 address = inst-STAN-CS:adr,
40855 pages = "16",
40856 month = jan,
40857 year = "1991",
40858 bibdate = "Wed Nov 26 12:13:45 MST 2025",
40859 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
40860 URL = "",
40861 acknowledgement = ack-nhfb,
40862 }
40863
40864 @TechReport{Chang:1991:PPS,
40865 author = "Edward Chang and Steven J. Phillips and Jeffrey D.
40866 Ullman",
40867 title = "A Programming and Problem Solving Seminar",
40868 type = "Technical Report",
40869 number = "STAN-CS-91-1350",
40870 institution = inst-STAN-CS,
40871 address = inst-STAN-CS:adr,
40872 pages = "99",
40873 month = feb,
40874 year = "1991",
40875 bibdate = "Thu Nov 20 12:13:32 MST 2025",
40876 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
40877 URL = "http://www-db.stanford.edu/TR/CS-TR-91-1350.html",
40878 abstract = "This report contains transcripts of the classroom
40879 discussions of Stanford's Computer Science problem
40880 solving course for Ph.D. students, CS304, during Winter
40881 quarter 1990, and the first CS204 class for
40882 undergraduates, in the Spring of 1990. The problems,
40883 and the solutions offered by the classes, span a large
40884 range of ideas in computer science. Since they
40885 constitute a study both of programming and research
40886 paradigms, and of the problem solving process, these
40887 notes may be of interest to students of computer
40888 science, as well as computer science educators.\par
40889
40890 The present report is the ninth in a series of such
40891 transcripts, continuing the tradition established in
40892 STAN-CS-77-606 (Michael J. Clancy, 1977),
40893 STAN-CS-79-707 (Chris Van Wyk, 1979), STAN-CS-81-863
40894 (Allan A. Miller, 1981), STAN-CS-83-989 (Joseph S.
40895 Weening, 1983), STAN-CS-83-990 (John D. Hobby, 1983),
40896 STAN-CS-85-1055 (Ramsey W. Haddad, 1985),
40897 STAN-CS-87-1154 (Tomas G. Rokicki, 1987), and
40898 STAN-CS-89-1269 (Kenneth A. Ross, 1989).",
40899 acknowledgement = ack-nhfb,
40900 xxnumber = "CS-TR-91-1350",
40901 }
40902
40903 @TechReport{Zhu:1991:SVP,
40904 author = "Liping Zhu and Arthur M. Keller and Gio Wiederhold",
40905 title = "Sequence vs. pipeline parallel multiple joins in
40906 {Paradata}",
40907 type = "Technical Report",
40908 number = "STAN-CS-91-1351",
40909 institution = inst-STAN-CS,
40910 address = inst-STAN-CS:adr,
40911 pages = "79",
40912 month = feb,
40913 year = "1991",
40914 bibdate = "Thu Nov 20 12:13:32 MST 2025",
40915 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
40916 URL = "http://www-db.stanford.edu/TR/CS-TR-91-1351.html",
40917 abstract = "In this report we analyze and compare hash-join based
40918 parallel multi-join algorithms for sequenced and
40919 pipelined processing. The BBN Butterfly machine serves
40920 as the host for the performance analysis. The sequenced
40921 algorithm handles the multiple join operations in a
40922 conventional sequenced manner, except that it
40923 distributes the work load of each operation among all
40924 processors. The pipelined algorithms handle the
40925 different join operations in parallel, by dividing the
40926 processors into several groups, with the data flowing
40927 through these groups. The detailed timing tests
40928 revealed the bus/memory contention that grows linearly
40929 with the number of processors. The existence of such a
40930 contention leads to an optimal region for the number of
40931 processors, given the join operands fixed. We present
40932 the analytical and experimental formulae for both
40933 algorithms, which incorporate this contention. We
40934 discuss the way of finding an optimal point, and give
40935 the heuristics for choosing the best processor's
40936 partition in pipelined processing. The study shows that
40937 the pipelined algorithms produce the first joined
40938 result sooner than the sequenced algorithm and need
40939 less memory to store the intermediate result. The
40940 sequenced algorithm, on the other hand, takes less time
40941 to finish the whole join operations.",
40942 acknowledgement = ack-nhfb,
40943 xxnumber = "CS-TR-91-1351",
40944 }
40945
40946 @TechReport{Chavez:1991:AAA,
40947 author = "R. Martin Chavez",
40948 title = "Architectures and Approximation Algorithms for
40949 Probabilistic Systems",
40950 type = "Technical Report",
40951 number = "STAN-CS-91-1352",
40952 institution = inst-STAN-CS,
40953 address = inst-STAN-CS:adr,
40954 pages = "214",
40955 month = feb,
40956 year = "1991",
40957 bibdate = "Wed Nov 26 12:13:45 MST 2025",
40958 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
40959 URL = "",
40960 acknowledgement = ack-nhfb,
40961 }
40962
40963 @TechReport{Phipps:1991:GMV,
40964 author = "Geoffrey Phipps",
40965 title = "{Glue} Manual: Version 1.0",
40966 type = "Technical Report",
40967 number = "STAN-CS-91-1353",
40968 institution = inst-STAN-CS,
40969 address = inst-STAN-CS:adr,
40970 pages = "32",
40971 month = mar,
40972 year = "1991",
40973 bibdate = "Wed Nov 26 12:13:45 MST 2025",
40974 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
40975 URL = "",
40976 acknowledgement = ack-nhfb,
40977 }
40978
40979 @TechReport{Winograd:1991:IPP,
40980 author = "Terry Winograd",
40981 title = "Introduction to the {Project on People, Computers, and
40982 Design}",
40983 type = "Technical Report",
40984 number = "STAN-CS-91-1354 (CSLI-91-150, PCD-1)",
40985 institution = inst-STAN-CS,
40986 address = inst-STAN-CS:adr,
40987 pages = "31",
40988 month = apr,
40989 year = "1991",
40990 bibdate = "Wed Nov 26 12:13:45 MST 2025",
40991 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
40992 URL = "",
40993 acknowledgement = ack-nhfb,
40994 }
40995
40996 @TechReport{Casley:1991:SCS,
40997 author = "Ross Casley",
40998 title = "On the Specification of Concurrent Systems",
40999 type = "Technical Report",
41000 number = "STAN-CS-91-1355",
41001 institution = inst-STAN-CS,
41002 address = inst-STAN-CS:adr,
41003 pages = "101",
41004 month = feb,
41005 year = "1991",
41006 bibdate = "Wed Nov 26 12:13:45 MST 2025",
41007 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
41008 URL = "",
41009 acknowledgement = ack-nhfb,
41010 remark = "This is the author's thesis.",
41011 }
41012
41013 @TechReport{Saraiya:1991:SEA,
41014 author = "Yatin Saraiya",
41015 title = "Subtree Elimination Algorithms in Deductive
41016 Databases",
41017 type = "Technical Report",
41018 number = "STAN-CS-91-1356",
41019 institution = inst-STAN-CS,
41020 address = inst-STAN-CS:adr,
41021 pages = "159",
41022 month = jan,
41023 year = "1991",
41024 bibdate = "Wed Nov 26 12:13:45 MST 2025",
41025 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
41026 URL = "",
41027 acknowledgement = ack-nhfb,
41028 remark = "This is the author's thesis.",
41029 }
41030
41031 @TechReport{Christensen:1991:AAP,
41032 author = "Jens Christensen",
41033 title = "Automatic Abstraction Planning",
41034 type = "Technical Report",
41035 number = "STAN-CS-91-1357",
41036 institution = inst-STAN-CS,
41037 address = inst-STAN-CS:adr,
41038 pages = "140",
41039 month = mar,
41040 year = "1991",
41041 bibdate = "Wed Nov 26 12:13:45 MST 2025",
41042 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
41043 URL = "",
41044 acknowledgement = ack-nhfb,
41045 remark = "This is the author's thesis.",
41046 }
41047
41048 @TechReport{Goldberg:1991:COL,
41049 author = "Andrew V. Goldberg",
41050 title = "Combinatorial Optimization Lecture Notes for
41051 {CS363\slash OR349} Winter 1991",
41052 type = "Technical Report",
41053 number = "STAN-CS-91-1358",
41054 institution = inst-STAN-CS,
41055 address = inst-STAN-CS:adr,
41056 pages = "78",
41057 month = mar,
41058 year = "1991",
41059 bibdate = "Wed Nov 26 12:13:45 MST 2025",
41060 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
41061 URL = "",
41062 acknowledgement = ack-nhfb,
41063 }
41064
41065 @TechReport{Alur:1991:BRP,
41066 author = "Rajeev Alur and Tomas Feder and Thomas A. Henzinger",
41067 title = "The Benefits of Relaxing Punctuality",
41068 type = "Technical Report",
41069 number = "STAN-CS-91-1359",
41070 institution = inst-STAN-CS,
41071 address = inst-STAN-CS:adr,
41072 pages = "38",
41073 month = may,
41074 year = "1991",
41075 bibdate = "Thu Nov 20 12:13:32 MST 2025",
41076 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
41077 URL = "http://www-db.stanford.edu/TR/CS-TR-91-1359.html",
41078 abstract = "The most natural, compositional way of modeling
41079 real-time systems uses a dense domain for time. The
41080 satisfiability of real-time constraints that are
41081 capable of expressing punctuality in this model is,
41082 however, known to be undecidable. We introduce a
41083 temporal language that can constrain the time
41084 difference between events only with finite (yet
41085 arbitrary) precision and show the resulting logic to be
41086 EXPSPACE-complete. This result allows us to develop an
41087 algorithm for the verification of timing properties of
41088 real-time systems with a dense semantics.",
41089 acknowledgement = ack-nhfb,
41090 xxnumber = "CS-TR-91-1359",
41091 }
41092
41093 @TechReport{Henzinger:1991:SST,
41094 author = "Thomas A. Henzinger",
41095 title = "Sooner is Safer Than Later",
41096 type = "Technical Report",
41097 number = "STAN-CS-91-1360",
41098 institution = inst-STAN-CS,
41099 address = inst-STAN-CS:adr,
41100 pages = "9",
41101 month = may,
41102 year = "1991",
41103 bibdate = "Thu Nov 20 12:13:32 MST 2025",
41104 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
41105 URL = "http://www-db.stanford.edu/TR/CS-TR-91-1360.html",
41106 abstract = "It has been repeatedly observed that the standard
41107 safety-liveness classification of properties of
41108 reactive systems does not fit for real-time properties.
41109 This is because the implicit ``liveness'' of time
41110 shifts the spectrum towards the safety side. While, for
41111 example, response--that ``something good'' will happen,
41112 eventually--is a classical liveness property, bounded
41113 response--that ``something good'' will happen soon,
41114 within a certain amount of time--has many
41115 characteristics of safety. We account for this
41116 phenomenon formally by defining safety and liveness
41117 relative to a given condition, such as the progress of
41118 time.",
41119 acknowledgement = ack-nhfb,
41120 xxnumber = "CS-TR-91-1360",
41121 }
41122
41123 @TechReport{Gangolli:1991:CBM,
41124 author = "Anil Ramesh Gangolli",
41125 title = "Convergence Bounds for {Markov} Chains and
41126 Applications to Sampling",
41127 type = "Technical Report",
41128 number = "STAN-CS-91-1361",
41129 institution = inst-STAN-CS,
41130 address = inst-STAN-CS:adr,
41131 pages = "153",
41132 month = may,
41133 year = "1991",
41134 bibdate = "Wed Nov 26 12:13:45 MST 2025",
41135 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
41136 URL = "",
41137 acknowledgement = ack-nhfb,
41138 remark = "This is the author's thesis.",
41139 }
41140
41141 @TechReport{Feder:1991:SNP,
41142 author = "Tomas Feder",
41143 title = "Stable Networks and Product Graphs",
41144 type = "Technical Report",
41145 number = "STAN-CS-91-1362",
41146 institution = inst-STAN-CS,
41147 address = inst-STAN-CS:adr,
41148 pages = "220",
41149 month = may,
41150 year = "1991",
41151 bibdate = "Wed Nov 26 12:13:45 MST 2025",
41152 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
41153 URL = "",
41154 acknowledgement = ack-nhfb,
41155 remark = "This is the author's thesis.",
41156 }
41157
41158 @TechReport{Gray:1991:PFT,
41159 author = "Cary G. Gray",
41160 title = "Performance and Fault-Tolerance in a Cache for
41161 Distributed File Service",
41162 type = "Technical Report",
41163 number = "STAN-CS-91-1363",
41164 institution = inst-STAN-CS,
41165 address = inst-STAN-CS:adr,
41166 pages = "140",
41167 month = may,
41168 year = "1991",
41169 bibdate = "Wed Nov 26 12:13:45 MST 2025",
41170 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
41171 URL = "",
41172 acknowledgement = ack-nhfb,
41173 remark = "This is the author's thesis.",
41174 }
41175
41176 @TechReport{Winograd:1991:LAA,
41177 author = "Terry Winograd and Finn Kensing",
41178 title = "The Language\slash Action Approach to the Design of
41179 Computer-Support for Cooperative Work: a Preliminary
41180 Study in Work Mapping",
41181 type = "Technical Report",
41182 number = "STAN-CS-91-1364 (CSLI-91-152, PCD-2)",
41183 institution = inst-STAN-CS,
41184 address = inst-STAN-CS:adr,
41185 pages = "31",
41186 month = apr,
41187 year = "1991",
41188 bibdate = "Wed Nov 26 12:13:45 MST 2025",
41189 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
41190 URL = "",
41191 acknowledgement = ack-nhfb,
41192 }
41193
41194 @TechReport{Paek:1991:JBT,
41195 author = "Eunok Paek",
41196 title = "A Justification-based Theory of Explanation",
41197 type = "Technical Report",
41198 number = "STAN-CS-91-1365",
41199 institution = inst-STAN-CS,
41200 address = inst-STAN-CS:adr,
41201 pages = "103",
41202 month = may,
41203 year = "1991",
41204 bibdate = "Wed Nov 26 12:13:45 MST 2025",
41205 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
41206 URL = "",
41207 acknowledgement = ack-nhfb,
41208 remark = "This is the author's thesis.",
41209 }
41210
41211 @TechReport{Cohen:1991:CAO,
41212 author = "Edith Cohen",
41213 title = "Combinatorial Algorithms for Optimization Problems",
41214 type = "Technical Report",
41215 number = "STAN-CS-91-1366",
41216 institution = inst-STAN-CS,
41217 address = inst-STAN-CS:adr,
41218 pages = "168",
41219 month = jun,
41220 year = "1991",
41221 bibdate = "Wed Nov 26 12:13:45 MST 2025",
41222 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
41223 URL = "",
41224 acknowledgement = ack-nhfb,
41225 remark = "This is the author's thesis.",
41226 }
41227
41228 @TechReport{Herskovits:1991:CBP,
41229 author = "Edward Herskovits",
41230 title = "Computer-Based Probabilistic-Network Construction",
41231 type = "Technical Report",
41232 number = "STAN-CS-91-1367",
41233 institution = inst-STAN-CS,
41234 address = inst-STAN-CS:adr,
41235 pages = "215",
41236 month = jun,
41237 year = "1991",
41238 bibdate = "Wed Nov 26 12:13:45 MST 2025",
41239 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
41240 URL = "",
41241 acknowledgement = ack-nhfb,
41242 remark = "This is the author's thesis.",
41243 }
41244
41245 @TechReport{Friedman:1991:CAC,
41246 author = "Joseph Friedman",
41247 title = "Computational Aspects of Compliant Motion Planning",
41248 type = "Technical Report",
41249 number = "STAN-CS-91-1368",
41250 institution = inst-STAN-CS,
41251 address = inst-STAN-CS:adr,
41252 pages = "122",
41253 month = jun,
41254 year = "1991",
41255 bibdate = "Wed Nov 26 12:13:45 MST 2025",
41256 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
41257 URL = "",
41258 acknowledgement = ack-nhfb,
41259 remark = "This is the author's thesis.",
41260 }
41261
41262 @TechReport{Fischer:1991:AMP,
41263 author = "Ted Fischer and Andrew V. Goldberg and Serge Plotkin",
41264 title = "Approximating Matchings in Parallel",
41265 type = "Technical Report",
41266 number = "STAN-CS-91-1369",
41267 institution = inst-STAN-CS,
41268 address = inst-STAN-CS:adr,
41269 pages = "5",
41270 month = jun,
41271 year = "1991",
41272 bibdate = "Thu Nov 20 12:13:32 MST 2025",
41273 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
41274 URL = "http://www-db.stanford.edu/TR/CS-TR-91-1369.html",
41275 abstract = "We show that for any constant k &gt; O, a matching
41276 with cardinality at least 1 --- 1/(k+1) times the
41277 maximum can be computed in NC.",
41278 acknowledgement = ack-nhfb,
41279 xxnumber = "CS-TR-91-1369",
41280 }
41281
41282 @TechReport{Nagayama:1991:NME,
41283 author = "Misao Nagayama and Carolyn Talcott",
41284 title = "An {NQTHM} mechanization of ``{{\booktitle{An Exercise
41285 in the Verification of Multi-Process Programs}}}''",
41286 type = "Technical Report",
41287 number = "STAN-CS-91-1370",
41288 institution = inst-STAN-CS,
41289 address = inst-STAN-CS:adr,
41290 pages = "ii + 84",
41291 month = jun,
41292 year = "1991",
41293 bibdate = "Thu Nov 20 12:13:32 MST 2025",
41294 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib;
41295 https://www.math.utah.edu/pub/tex/bib/string-matching.bib",
41296 URL = "http://i.stanford.edu/pub/cstr/reports/cs/tr/91/1370/CS-TR-91-1370.pdf;
41297 http://www-db.stanford.edu/TR/CS-TR-91-1370.html",
41298 abstract = "This report presents a formal verification of the
41299 local correctness of a mutex algorithm using the
41300 Boyer-Moore theorem prover. The formalization follows
41301 closely an informal proof of Manna and Pnuelli. The
41302 proof method of Manna and Pnueli is to first extract
41303 from the program a set of states and induced transition
41304 system. One then proves suitable invariants. There are
41305 two variants of the proof. In the first (atomic)
41306 variant, compound tests involving quantification over a
41307 finite set are viewed as atomic operations. In the
41308 second (molecular) variant, this assumption is removed,
41309 making the details of the transitions and proof
41310 somewhat more complicated. The original Manna-Pnueli
41311 proof was formulated in terms of finite sets. This led
41312 to concise and elegant informal proof, however one that
41313 is not easy to mechanize in the Boyer-Moore logic. In
41314 the mechanized version we use a dual isomorphic
41315 representation of program states based on finite
41316 sequences. Our approach was to outline the formal proof
41317 of each invariant, making explicit the case analyses,
41318 assumptions and properties of operations used. The
41319 outline served as our guide in developing the formal
41320 proof. The resulting sequence of events follows the
41321 informal plan quite closely. The main difficulties
41322 encountered were in discovering the precise form of the
41323 lemmas and hints necessary to guide the theorem
41324 prover.",
41325 acknowledgement = ack-nhfb,
41326 pdfpages = "86",
41327 xxnumber = "CS-TR-91-1370",
41328 }
41329
41330 @TechReport{Rathmann:1991:NSP,
41331 author = "Peter Rathmann",
41332 title = "Nonmonotonic Semantics for Partitioned Knowledge
41333 Bases",
41334 type = "Technical Report",
41335 number = "STAN-CS-91-1371",
41336 institution = inst-STAN-CS,
41337 address = inst-STAN-CS:adr,
41338 pages = "116",
41339 month = jul,
41340 year = "1991",
41341 bibdate = "Wed Nov 26 12:13:45 MST 2025",
41342 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
41343 URL = "",
41344 acknowledgement = ack-nhfb,
41345 remark = "This is the author's thesis.",
41346 }
41347
41348 @TechReport{Goldberg:1991:NRS,
41349 author = "A. V. Goldberg",
41350 title = "A Natural Randomization Strategy for Multicommodity
41351 Flow and Related Algorithms",
41352 type = "Technical Report",
41353 number = "STAN-CS-91-1372",
41354 institution = inst-STAN-CS,
41355 address = inst-STAN-CS:adr,
41356 pages = "11",
41357 month = jul,
41358 year = "1991",
41359 bibdate = "Wed Nov 26 12:13:45 MST 2025",
41360 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
41361 URL = "",
41362 acknowledgement = ack-nhfb,
41363 }
41364
41365 @TechReport{Kanakia:1991:HPH,
41366 author = "Hemant Ratubhai Kanakia",
41367 title = "High-Performance Host Interfacing for Packet-Switched
41368 Networks",
41369 type = "Technical Report",
41370 number = "STAN-CS-91-1373",
41371 institution = inst-STAN-CS,
41372 address = inst-STAN-CS:adr,
41373 pages = "53",
41374 month = jul,
41375 year = "1991",
41376 bibdate = "Wed Nov 26 12:13:45 MST 2025",
41377 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
41378 URL = "",
41379 acknowledgement = ack-nhfb,
41380 remark = "This is the author's thesis.",
41381 }
41382
41383 @TechReport{Orlin:1991:PDN,
41384 author = "James B. Orlin and Serge A. Plotkin and Eva Tardos",
41385 title = "Polynomial Dual Network Simplex Algorithms",
41386 type = "Technical Report",
41387 number = "STAN-CS-91-1374 (AD-A254340)",
41388 institution = inst-STAN-CS,
41389 address = inst-STAN-CS:adr,
41390 pages = "28",
41391 month = aug,
41392 year = "1991",
41393 bibdate = "Thu Nov 20 12:13:32 MST 2025",
41394 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
41395 URL = "http://www-db.stanford.edu/TR/CS-TR-91-1374.html;
41396 https://apps.dtic.mil/sti/tr/pdf/ADA254340.pdf",
41397 abstract = "We show how to use polynomial and strongly polynomial
41398 capacity scaling algorithms for the transshipment
41399 problem to design a polynomial dual network simplex
41400 pivot rule. Our best pivoting strategy leads to an $
41401 O(m^2 \log n) $ bound on the number of pivots, where
41402 $n$ and $m$ denotes the number of nodes and arcs in the
41403 input network. If the demands are integral and at most
41404 $B$, we also give an $ O(m(m + n \log n) \min (\log n
41405 B, m \log n))$-time implementation of a strategy that
41406 requires somewhat more pivots.",
41407 acknowledgement = ack-nhfb,
41408 xxnumber = "CS-TR-91-1374",
41409 }
41410
41411 @TechReport{Leighton:1991:FAA,
41412 author = "Tom Leighton and Fillia Makedon and Serge Plotkin and
41413 Clifford Stein and Eva Tardos and Spyros Tragoudas",
41414 title = "Fast approximation algorithms for multicommodity flow
41415 problems",
41416 type = "Technical Report",
41417 number = "STAN-CS-91-1375",
41418 institution = inst-STAN-CS,
41419 address = inst-STAN-CS:adr,
41420 pages = "25",
41421 month = aug,
41422 year = "1991",
41423 bibdate = "Thu Nov 20 12:13:32 MST 2025",
41424 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
41425 URL = "http://www-db.stanford.edu/TR/CS-TR-91-1375.html",
41426 abstract = "In this paper, we describe the first polynomial-time
41427 combinatorial algorithms for approximately solving the
41428 multicommodity flow problem. Our algorithms are
41429 significantly faster than the best previously known
41430 algorithms, that were based on linear programming. For
41431 a k-commodity multicommodity flow problem, the running
41432 time of our randomized algorithm is (up to log factors)
41433 the same as the time needed to solve k single-commodity
41434 flow problems, thus giving the surprising result that
41435 approximately computing a k-commodity maximum-flow is
41436 not much harder than computing about k single-commodity
41437 maximum-flows in isolation. Given any multicommodity
41438 flow problem as input, our algorithm is guaranteed to
41439 provide a feasible solution to a modified flow problem
41440 in which all capacities are increased by a (1 +
41441 epsilon)-factor, or to provide a proof that there is no
41442 feasible solution to the original problem. We also
41443 describe faster approximation algorithms for
41444 multicommodity flow problems with a special structure,
41445 such as those that arise in the ``sparsest cut''
41446 problems and the uniform concurrent flow problems if k
41447 &lt;= the square root of m.",
41448 acknowledgement = ack-nhfb,
41449 xxnumber = "CS-TR-91-1375",
41450 }
41451
41452 @TechReport{Strat:1991:NOR,
41453 author = "Thomas M. Strat",
41454 title = "Natural Object Recognition",
41455 type = "Technical Report",
41456 number = "STAN-CS-91-1376",
41457 institution = inst-STAN-CS,
41458 address = inst-STAN-CS:adr,
41459 pages = "xv + 156",
41460 month = aug,
41461 year = "1991",
41462 bibdate = "Wed Nov 26 12:13:45 MST 2025",
41463 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
41464 URL = "https://apps.dtic.mil/sti/tr/pdf/ADA325974.pdf",
41465 abstract = "An autonomous vehicle that is to operate outdoors must
41466 be able to recognize features of the natural world as
41467 they appear in ground-level imagery. Geometric
41468 reconstruction alone is insufficient for an agent to
41469 plan its actions intelligently --- objects in the world
41470 must be recognized, and not just located.\par
41471
41472 Most work in visual recognition by computer has focused
41473 on recognizing objects by their geometric shape, or by
41474 the presence or absence of some prespecified collection
41475 of locally measurable attributes (e.g., spectral
41476 reflectance, texture, or distinguished markings). On
41477 the other hand, most entities in the natural world defy
41478 compact description of their shapes, and have no
41479 characteristic features with discriminatory power. As a
41480 result, image-understanding research has achieved
41481 little success towards recognizing natural
41482 scenes.\par
41483
41484 In this thesis we offer a new approach to visual
41485 recognition that avoids these limitations and has been
41486 used to recognize trees, bushes, grass, and trails in
41487 ground-level scenes of a natural environment. Reliable
41488 recognition is achieved by employing an architecture
41489 with a number of innovative aspects. These include:
41490 context-controlled generation of hypotheses instead of
41491 universal partitioning; a hypothesis comparison scheme
41492 that allows a linear growth in computational complexity
41493 as the recognition vocabulary is increased; recognition
41494 at the level of complete contexts instead of individual
41495 objects; and provisions for contextual information to
41496 guide processing at all levels.\par
41497
41498 Recognition results are added to a persistent, labeled,
41499 three-dimensional model of the environment which is
41500 used as context for interpreting subsequent imagery. In
41501 this way, the system constructs a description of the
41502 objects it sees, and, at the same time, improves its
41503 recognition abilities by exploiting the context
41504 provided by what it has previously recognized.",
41505 acknowledgement = ack-nhfb,
41506 pdfpages = "172",
41507 remark = "This is the author's Ph.D. thesis, dated December
41508 1990, but report dated August 1991.",
41509 }
41510
41511 @TechReport{Rothberg:1991:ELL,
41512 author = "Edward Rothberg and Anoop Gupta",
41513 title = "An Evaluation of Left-Looking, Right-Looking and
41514 Multifrontal Approaches to Sparse {Cholesky}
41515 Factorization and Hierarchical-Memory Machines",
41516 type = "Technical Report",
41517 number = "STAN-CS-91-1377 (CSL-TR-91-487)",
41518 institution = inst-STAN-CS,
41519 address = inst-STAN-CS:adr,
41520 pages = "ii + 47",
41521 month = aug,
41522 year = "1991",
41523 bibdate = "Thu Nov 20 12:13:32 MST 2025",
41524 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
41525 URL = "http://www-db.stanford.edu/TR/CS-TR-91-1377.html",
41526 abstract = "In this paper we present a comprehensive analysis of
41527 the performance of a variety of sparse Cholesky
41528 factorization methods on hierarchical-memory machines.
41529 We investigate methods that vary along two different
41530 axes. Along the first axis, we consider three different
41531 high-level approaches to sparse factorization:
41532 left-looking, right-looking, and multifrontal. Along
41533 the second axis, we consider the implementation of each
41534 of these high-level approaches using different sets of
41535 primitives. The primitives vary based on the structures
41536 they manipulate. One important structure in sparse
41537 Cholesky factorization is a single column of the
41538 matrix. We first consider primitives that manipulate
41539 single columns. These are the most commonly used
41540 primitives for expressing the sparse Cholesky
41541 computation. Another important structure is the
41542 supernode, a set of columns with identical non-zero
41543 structures. We consider sets of primitives that exploit
41544 the supemodal structure of the matrix to varying
41545 degrees. We find that primitives that manipulate larger
41546 structures greatly increase the amount of exploitable
41547 data reuse, thus leading to dramatically higher
41548 performance on hierarchical-memory machines. We observe
41549 performance increases of two to three times when
41550 comparing methods based on primitives that make
41551 extensive use of the supernodal structure to methods
41552 based on primitives that manipulate columns. We also
41553 find that the overall approach (left-looking,
41554 right-looking, or multifrontal) is less important for
41555 performance than the particular set of primitives used
41556 to implement the approach.",
41557 acknowledgement = ack-nhfb,
41558 pdfpages = "49",
41559 xxnumber = "CS-TR-91-1377",
41560 }
41561
41562 @TechReport{Alur:1991:TAV,
41563 author = "Rajeev Alur",
41564 title = "Techniques for Automatic Verification of Real-Time
41565 Systems",
41566 type = "Technical Report",
41567 number = "STAN-CS-91-1378",
41568 institution = inst-STAN-CS,
41569 address = inst-STAN-CS:adr,
41570 pages = "188",
41571 month = aug,
41572 year = "1991",
41573 bibdate = "Wed Nov 26 12:13:45 MST 2025",
41574 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
41575 URL = "",
41576 acknowledgement = ack-nhfb,
41577 remark = "This is the author's thesis.",
41578 }
41579
41580 @TechReport{Hall:1991:FCM,
41581 author = "Keith Hall",
41582 title = "A Framework for Change Management in a Design
41583 Database",
41584 type = "Technical Report",
41585 number = "STAN-CS-91-1379",
41586 institution = inst-STAN-CS,
41587 address = inst-STAN-CS:adr,
41588 pages = "185",
41589 month = aug,
41590 year = "1991",
41591 bibdate = "Wed Nov 26 12:13:45 MST 2025",
41592 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
41593 URL = "",
41594 acknowledgement = ack-nhfb,
41595 remark = "This is the author's thesis.",
41596 }
41597
41598 @TechReport{Henzinger:1991:TSV,
41599 author = "Thomas Henzinger",
41600 title = "The Temporal Specification and Verification of
41601 Real-Time Systems",
41602 type = "Technical Report",
41603 number = "STAN-CS-91-1380",
41604 institution = inst-STAN-CS,
41605 address = inst-STAN-CS:adr,
41606 pages = "300",
41607 month = aug,
41608 year = "1991",
41609 bibdate = "Wed Nov 26 12:13:45 MST 2025",
41610 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
41611 URL = "",
41612 acknowledgement = ack-nhfb,
41613 remark = "This is the author's thesis.",
41614 }
41615
41616 @TechReport{Hara:1991:IHD,
41617 author = "Yoshinori Hara and Arthur M. Keller and Peter K.
41618 Rathmann and Gio Wiederhold",
41619 title = "Implementing hypertext database relationships through
41620 aggregations and exceptions",
41621 type = "Technical Report",
41622 number = "STAN-CS-91-1381",
41623 institution = inst-STAN-CS,
41624 address = inst-STAN-CS:adr,
41625 pages = "36",
41626 month = sep,
41627 year = "1991",
41628 bibdate = "Thu Nov 20 12:13:32 MST 2025",
41629 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
41630 URL = "http://www-db.stanford.edu/TR/CS-TR-91-1381.html",
41631 abstract = "In order to combine hypertext with database
41632 facilities, we show how to extract an effective storage
41633 structure from given instance relationships. The schema
41634 of the structure recognizes clusters and exceptions.
41635 Extracting high-level structures is useful for
41636 providing a high performance browsing environment as
41637 well as efficient physical database design, especially
41638 when handling large amounts of data. This paper focuses
41639 on a clustering method, ACE, which generates
41640 aggregations and exceptions from the original graph
41641 structure in order to capture high level relationships.
41642 The problem of minimizing the cost function is
41643 NP-complete. We use a heuristic approach based on an
41644 extended Kernighan-Lin algorithm. We demonstrate our
41645 method on a hypertext application and on a standard
41646 random graph, compared with its analytical model. The
41647 storage reductions of input database size in main
41648 memory were 77.2\% and 12.3\%, respectively. It was
41649 also useful for secondary storage organization for
41650 efficient retrieval.",
41651 acknowledgement = ack-nhfb,
41652 xxnumber = "CS-TR-91-1381",
41653 }
41654
41655 @TechReport{Morris:1991:SOQ,
41656 author = "Katherine A. Morris",
41657 title = "Subgoal Order for Query Optimization in Logic
41658 Databases",
41659 type = "Technical Report",
41660 number = "STAN-CS-91-1382",
41661 institution = inst-STAN-CS,
41662 address = inst-STAN-CS:adr,
41663 pages = "116",
41664 month = jun,
41665 year = "1991",
41666 bibdate = "Wed Nov 26 12:13:45 MST 2025",
41667 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
41668 URL = "",
41669 acknowledgement = ack-nhfb,
41670 remark = "This is the author's thesis.",
41671 }
41672
41673 @TechReport{Henzinger:1991:TPM,
41674 author = "Thomas A. Henzinger and Zohar Manna and Amir Pnueli",
41675 title = "Temporal Proof Methodologies for Real-Time Systems",
41676 type = "Technical Report",
41677 number = "STAN-CS-91-1383",
41678 institution = inst-STAN-CS,
41679 address = inst-STAN-CS:adr,
41680 pages = "49",
41681 month = sep,
41682 year = "1991",
41683 bibdate = "Thu Nov 20 12:13:32 MST 2025",
41684 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
41685 URL = "http://www-db.stanford.edu/TR/CS-TR-91-1383.html",
41686 abstract = "We extend the specification language of temporal
41687 logic, the corresponding verification framework, and
41688 the underlying computational model to deal with
41689 real-time properties of reactive systems. The abstract
41690 notion of timed transition systems generalizes
41691 traditional transition systems conservatively:
41692 qualitative fairness requirements are replaced (and
41693 superseded) by quantitative lower-bound and upper-bound
41694 timing constraints on transitions. This framework can
41695 model real-time systems that communicate either through
41696 shared variables or by message passing and real-time
41697 issues such as time-outs, process priorities
41698 (interrupts), and process scheduling. We exhibit two
41699 styles for the specification of real-time systems.
41700 While the first approach uses bounded versions of
41701 temporal operators, the second approach allows explicit
41702 references to time through a special clock variable.
41703 Corresponding to the two styles of specification, we
41704 present and compare two fundamentally different proof
41705 methodologies for the verification of timing
41706 requirements that are expressed in these styles. For
41707 the bounded-operator style, we provide a set of proof
41708 rules for establishing bounded-invariance and
41709 bounded-response properties of timed transition
41710 systems. This approach generalizes the standard
41711 temporal proof rules for verifying invariance and
41712 response properties conservatively. For the
41713 explicit-clock style, we exploit the observation that
41714 every time-bounded property is a safety property and
41715 use the standard temporal proof rules for establishing
41716 safety properties.",
41717 acknowledgement = ack-nhfb,
41718 xxnumber = "CS-TR-91-1383",
41719 }
41720
41721 @TechReport{Myers:1991:UAI,
41722 author = "Karen L. Myers",
41723 title = "Universal Attachment: an Integration Method for Logic
41724 Hybrids",
41725 type = "Technical Report",
41726 number = "STAN-CS-91-1384",
41727 institution = inst-STAN-CS,
41728 address = inst-STAN-CS:adr,
41729 pages = "188",
41730 month = sep,
41731 year = "1991",
41732 bibdate = "Wed Nov 26 12:13:45 MST 2025",
41733 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
41734 URL = "",
41735 acknowledgement = ack-nhfb,
41736 remark = "This is the author's thesis.",
41737 }
41738
41739 @TechReport{Lin:1991:SNR,
41740 author = "Fangzhen Lin",
41741 title = "A Study of Nonmonotonic Reasoning",
41742 type = "Technical Report",
41743 number = "STAN-CS-91-1385",
41744 institution = inst-STAN-CS,
41745 address = inst-STAN-CS:adr,
41746 pages = "106",
41747 month = aug,
41748 year = "1991",
41749 bibdate = "Wed Nov 26 12:13:45 MST 2025",
41750 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
41751 URL = "",
41752 acknowledgement = ack-nhfb,
41753 remark = "This is the author's thesis.",
41754 }
41755
41756 @TechReport{Ross:1991:SDD,
41757 author = "Kenneth A. Ross",
41758 title = "The Semantics of Deductive Databases",
41759 type = "Technical Report",
41760 number = "STAN-CS-91-1386",
41761 institution = inst-STAN-CS,
41762 address = inst-STAN-CS:adr,
41763 pages = "168",
41764 month = aug,
41765 year = "1991",
41766 bibdate = "Wed Nov 26 12:13:45 MST 2025",
41767 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
41768 URL = "",
41769 acknowledgement = ack-nhfb,
41770 remark = "This is the author's thesis.",
41771 }
41772
41773 @TechReport{Wilson:1991:APS,
41774 author = "Randall Wilson and Achim Schweikard",
41775 title = "Assembling Polyhedra with Single Translations",
41776 type = "Technical Report",
41777 number = "STAN-CS-91-1387",
41778 institution = inst-STAN-CS,
41779 address = inst-STAN-CS:adr,
41780 pages = "16",
41781 month = oct,
41782 year = "1991",
41783 bibdate = "Thu Nov 20 12:13:32 MST 2025",
41784 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
41785 URL = "http://www-db.stanford.edu/TR/CS-TR-91-1387.html",
41786 abstract = "The problem of partitioning an assembly of polyhedral
41787 objects into two subassemblies that can be separated
41788 arises in assembly planning. We describe an algorithm
41789 to compute the set of all translations separating two
41790 polyhedra with n vertices in O(n4) steps and show that
41791 this is optimal. Given an assembly of k polyhedra with
41792 a total of n vertices, an extension of this algorithm
41793 identifies a valid translation and removable
41794 subassembly in O(k2 n4) steps if one exists. Based on
41795 the second algorithm a polynomial time method for
41796 finding a complete assembly sequence consisting of
41797 single translations is derived. An implementation
41798 incorporates several changes to achieve better
41799 average-case performance; experimental results obtained
41800 for composite objects consisting of isothetic polyhedra
41801 are described.",
41802 acknowledgement = ack-nhfb,
41803 xxnumber = "CS-TR-91-1387",
41804 }
41805
41806 @TechReport{Whang:1991:DMD,
41807 author = "Kyu-Young Whang and Sang-Wook Kim and Gio Wiederhold",
41808 title = "Dynamic Maintenance of Data Distribution for
41809 Selectivity Estimation",
41810 type = "Technical Report",
41811 number = "STAN-CS-91-1388",
41812 institution = inst-STAN-CS,
41813 address = inst-STAN-CS:adr,
41814 pages = "30",
41815 month = sep,
41816 year = "1991",
41817 bibdate = "Wed Nov 26 12:13:45 MST 2025",
41818 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
41819 URL = "",
41820 acknowledgement = ack-nhfb,
41821 }
41822
41823 @TechReport{Torrance:1991:AM,
41824 author = "Mark C. Torrance and Paul A. Viola",
41825 title = "The {AGENT0} Manual",
41826 type = "Technical Report",
41827 number = "STAN-CS-91-1389",
41828 institution = inst-STAN-CS,
41829 address = inst-STAN-CS:adr,
41830 pages = "ii + 8",
41831 day = "9",
41832 month = apr,
41833 year = "1991",
41834 bibdate = "Thu Nov 20 12:13:32 MST 2025",
41835 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
41836 URL = "http://www-db.stanford.edu/TR/CS-TR-91-1389.html",
41837 abstract = "This document describes an implementation of AOP, an
41838 interpreter for programs written in a language called
41839 AGENTO. AGENTO is a first stab at a programming
41840 language for the paradigm of Agent-Oriented
41841 Programming. It is currently under development at
41842 Stanford under the direction of Yoav Shoham. This
41843 implementation is the work of Paul A. Viola of MIT and
41844 Mark C. Torrance of Stanford.",
41845 acknowledgement = ack-nhfb,
41846 pdfpages = "10",
41847 xxnumber = "CS-TR-91-1389",
41848 }
41849
41850 @TechReport{Shoham:1991:VC,
41851 author = "Yoav Shoham",
41852 title = "Varieties of Context",
41853 type = "Technical Report",
41854 number = "STAN-CS-91-1390",
41855 institution = inst-STAN-CS,
41856 address = inst-STAN-CS:adr,
41857 pages = "15",
41858 month = oct,
41859 year = "1991",
41860 bibdate = "Wed Nov 26 12:13:45 MST 2025",
41861 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
41862 URL = "",
41863 acknowledgement = ack-nhfb,
41864 }
41865
41866 @TechReport{Shoham:1991:LPB,
41867 author = "Yoav Shoham and Alvaro del Val",
41868 title = "A Logic for Perception and Belief",
41869 type = "Technical Report",
41870 number = "STAN-CS-91-1391",
41871 institution = inst-STAN-CS,
41872 address = inst-STAN-CS:adr,
41873 pages = "ii + 23",
41874 day = "24",
41875 month = sep,
41876 year = "1991",
41877 bibdate = "Thu Nov 20 12:13:32 MST 2025",
41878 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
41879 URL = "http://www-db.stanford.edu/TR/CS-TR-91-1391.html",
41880 abstract = "We present a modal logic for reasoning about
41881 perception and belief, captured respectively by the
41882 operators P and B. The B operator is the standard
41883 belief operator used in recent years, and the P
41884 operator is similarly defined. The contribution of the
41885 paper is twofold. First, in terms of P we provide a
41886 definition of perceptual indistinguishability, such as
41887 arises out of limited visual acuity. The definition is
41888 concise, intuitive (we find), and avoids traditional
41889 paradoxes. Second, we explore the bimodal B--P system.
41890 We argue that the relationship between the two
41891 modalities varies among settings: The agent may or may
41892 not have confidence in its perception, may or may not
41893 be accurate in it, and so on. We therefore define a
41894 number of agent types corresponding to these various
41895 assumptions, and for each such agent type we provide a
41896 sound and complete axiomatization of the B--P system.",
41897 acknowledgement = ack-nhfb,
41898 pdfpages = "25",
41899 xxnumber = "CS-TR-91-1391",
41900 }
41901
41902 @TechReport{Ceri:1991:CUM,
41903 author = "Stefano Ceri and Maurice A. W. Houtsma and Arthur M.
41904 Keller and Pierangela Samarati",
41905 title = "A classification of update methods for replicated
41906 databases",
41907 type = "Technical Report",
41908 number = "STAN-CS-91-1392",
41909 institution = inst-STAN-CS,
41910 address = inst-STAN-CS:adr,
41911 pages = "17",
41912 month = oct,
41913 year = "1991",
41914 bibdate = "Thu Nov 20 12:13:32 MST 2025",
41915 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
41916 URL = "http://www-db.stanford.edu/TR/CS-TR-91-1392.html",
41917 abstract = "In this paper we present a classification of the
41918 methods for updating replicated databases. The main
41919 contribution of this paper is to present the various
41920 methods in the context of a structured taxonomy, which
41921 accommodates very heterogeneous methods. Classes of
41922 update methods are presented through their general
41923 properties, such as the invariants that hold for them.
41924 Methods are reviewed both in their normal and abnormal
41925 behaviour (e.g., after a network partition). We show
41926 that several methods presented in the literature,
41927 sometimes in independent papers with no
41928 cross-reference, are indeed very much related, for
41929 instance because they share the same basic technique.
41930 We also show in what sense they diverge from the basic
41931 technique. This classification can serve as a basis for
41932 choosing the method that is most suitable to a specific
41933 application. It can also be used as a guideline to
41934 researchers who aim at developing new mechanisms.",
41935 acknowledgement = ack-nhfb,
41936 xxnumber = "CS-TR-91-1392",
41937 }
41938
41939 @TechReport{Goosen:1991:SMC,
41940 author = "Hendrik A. Goosen",
41941 title = "Shared Multilevel Caches for Scalable
41942 Multiprocessors",
41943 type = "Technical Report",
41944 number = "STAN-CS-91-1393",
41945 institution = inst-STAN-CS,
41946 address = inst-STAN-CS:adr,
41947 pages = "76",
41948 month = oct,
41949 year = "1991",
41950 bibdate = "Wed Nov 26 12:13:45 MST 2025",
41951 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
41952 URL = "",
41953 acknowledgement = ack-nhfb,
41954 remark = "This is the author's thesis.",
41955 }
41956
41957 @TechReport{Harty:1991:ACP,
41958 author = "Kieran Harty and David R. Cheriton",
41959 title = "Application-controlled physical memory using external
41960 page-cache management",
41961 type = "Technical Report",
41962 number = "STAN-CS-91-1394",
41963 institution = inst-STAN-CS,
41964 address = inst-STAN-CS:adr,
41965 pages = "16",
41966 month = oct,
41967 year = "1991",
41968 bibdate = "Thu Nov 20 12:13:32 MST 2025",
41969 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
41970 URL = "http://www-db.stanford.edu/TR/CS-TR-91-1394.html",
41971 abstract = "Next generation computer systems will have gigabytes
41972 of physical memory and processors in the 100 MIPS range
41973 or higher. Contrary to some conjectures, this trend
41974 requires more sophisticated memory management support
41975 for memory-bound computations such as scientific
41976 simulations and systems such as large-scale database
41977 systems, even though memory management for most
41978 programs will be less of a concern. We describe the
41979 design, implementation and evaluation of a virtual
41980 memory system that provides application control of
41981 physical memory using external page-cache management.
41982 In this approach, a sophisticated application is able
41983 to monitor and control the amount of physical memory it
41984 has available for execution, the exact contents of this
41985 memory, and the scheduling and nature of page-in and
41986 page-out using the abstraction of a physical page cache
41987 provided by the kernel. We claim that this approach can
41988 significantly improve performance for many memory-bound
41989 applications while reducing kernel complexity, yet does
41990 not complicate other applications or reduce their
41991 performance.",
41992 acknowledgement = ack-nhfb,
41993 xxnumber = "CS-TR-91-1394",
41994 }
41995
41996 @TechReport{Hartfield:1991:LHD,
41997 author = "Brad Hartfield and Terry Winograd and John Bennett",
41998 title = "Learning {HCI} Design: Mentoring Project Groups in a
41999 Course on Human--Computer Interaction",
42000 type = "Technical Report",
42001 number = "STAN-CS-91-1395 (CSLI-91-161, PCD-3)",
42002 institution = inst-STAN-CS,
42003 address = inst-STAN-CS:adr,
42004 pages = "20",
42005 month = dec,
42006 year = "1991",
42007 bibdate = "Wed Nov 26 12:13:45 MST 2025",
42008 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
42009 URL = "",
42010 acknowledgement = ack-nhfb,
42011 }
42012
42013 @TechReport{Scales:1991:POM,
42014 author = "Daniel J. Scales",
42015 title = "Parallelizing the {OPS5} Matching Algorithm in
42016 {Qlisp}",
42017 type = "Technical Report",
42018 number = "STAN-CS-91-1396 (AD-A323588PB96-148556)",
42019 institution = inst-STAN-CS,
42020 address = inst-STAN-CS:adr,
42021 pages = "iii + 20",
42022 month = oct,
42023 year = "1991",
42024 bibdate = "Wed Nov 26 12:13:45 MST 2025",
42025 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
42026 URL = "https://apps.dtic.mil/sti/tr/pdf/ADA323588.pdf",
42027 abstract = "In recent years, production systems have become a
42028 popular framework within which to implement large-scale
42029 expert systems. Unfortunately, production systems are
42030 often characterized by slow running times, because of
42031 the large amount of matching that must be done during
42032 their execution. For the production system language
42033 OPS5, there is a highly efficient matching algorithm
42034 known as the Rete algorithm which gives a large speedup
42035 over a naive implementation of production systems. In
42036 this paper, we describe our attempts to speed up OPS5
42037 even further by parallelizing the Rete algorithm in
42038 Qlisp, a parallel Lisp language. We give details on the
42039 Qlisp constructs we used to parallelize the Rete
42040 algorithm and provide actual timing results on various
42041 OPS5 rule sets,",
42042 acknowledgement = ack-nhfb,
42043 pdfpages = "24",
42044 }
42045
42046 @TechReport{Roy:1991:AMP,
42047 author = "Shaibal Roy",
42048 title = "Adaptive Methods in Parallel Databases",
42049 type = "Technical Report",
42050 number = "STAN-CS-91-1397",
42051 institution = inst-STAN-CS,
42052 address = inst-STAN-CS:adr,
42053 pages = "160",
42054 month = aug,
42055 year = "1991",
42056 bibdate = "Wed Nov 26 12:13:45 MST 2025",
42057 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
42058 URL = "",
42059 acknowledgement = ack-nhfb,
42060 remark = "This is the author's thesis.",
42061 }
42062
42063 @TechReport{Salesin:1991:EGB,
42064 author = "David Salesin",
42065 title = "Epsilon Geometry: Building Robust Algorithms From
42066 Imprecise Computations",
42067 type = "Technical Report",
42068 number = "STAN-CS-91-1398",
42069 institution = inst-STAN-CS,
42070 address = inst-STAN-CS:adr,
42071 pages = "130",
42072 month = mar,
42073 year = "1991",
42074 bibdate = "Wed Nov 26 12:13:45 MST 2025",
42075 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
42076 URL = "",
42077 acknowledgement = ack-nhfb,
42078 remark = "This is the author's thesis.",
42079 }
42080
42081 @TechReport{Guha:1991:CFS,
42082 author = "Ramanathan V. Guha",
42083 title = "Contexts: a Formalization and Some Applications",
42084 type = "Technical Report",
42085 number = "STAN-CS-91-1399 (KSL-91-74)",
42086 institution = inst-STAN-CS,
42087 address = inst-STAN-CS:adr,
42088 pages = "xiv + 263",
42089 month = dec,
42090 year = "1991",
42091 bibdate = "Wed Nov 26 12:13:45 MST 2025",
42092 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
42093 URL = "https://www.proquest.com/pqdtglobal/docview/304029864/",
42094 acknowledgement = ack-nhfb,
42095 advisor = "John McCarthy",
42096 remark = "This is the author's Ph.D. thesis.",
42097 }
42098
42099 @TechReport{Mumick:1991:QOD,
42100 author = "Inderpal Mumick",
42101 title = "Query Optimization in Deductive and Relational
42102 Databases",
42103 type = "Technical Report",
42104 number = "STAN-CS-91-1400",
42105 institution = inst-STAN-CS,
42106 address = inst-STAN-CS:adr,
42107 pages = "190",
42108 month = dec,
42109 year = "1991",
42110 bibdate = "Wed Nov 26 12:13:45 MST 2025",
42111 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
42112 URL = "",
42113 acknowledgement = ack-nhfb,
42114 remark = "This is the author's thesis.",
42115 }
42116
42117 @TechReport{Lehmann:1991:BCB,
42118 author = "Harold P. Lehmann",
42119 title = "A {Bayesian} Computer-Based Approach to the
42120 Physician's Use of the Clinical Research Literature",
42121 type = "Technical Report",
42122 number = "STAN-CS-92-1402 (KSL-91-76)",
42123 institution = inst-STAN-CS,
42124 address = inst-STAN-CS:adr,
42125 pages = "xxii + 277",
42126 month = dec,
42127 year = "1991",
42128 bibdate = "Wed Nov 26 12:13:45 MST 2025",
42129 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
42130 URL = "",
42131 abstract = "Physicians need to understand the clinical research
42132 literature if they are to make informed clinical
42133 decisions; yet the techniques required for using the
42134 literature in this way are difficult for many
42135 clinicians to acquire and to use. I call this dilemma
42136 of needing information yet being unable to extract it
42137 the literature problem. To date, automated statistical
42138 methods used to solve the literature problem have been
42139 limited in the degree to which they can represent
42140 methodological and domain concepts that are crucial to
42141 the physician who must take clinical action. In this
42142 dissertation, I consider the thesis that Bayesian
42143 decision theory can provide the foundation for a
42144 computer-based environment that helps physicians to use
42145 the research literature.\par
42146
42147 As a basis for evaluating approaches to solving the
42148 literature problem, I develop a knowledge-level
42149 analysis of the problem. On the basis of this analysis,
42150 I argue for the use of Bayesian statistics over
42151 classical statistics. The shift to Bayesian statistics
42152 requires a change in the paradigm within which research
42153 data are evaluated.\par
42154
42155 To show that the new paradigm can be implemented in a
42156 functioning computer system, I have developed a
42157 prototype system, called THOMAS, that gives the
42158 physician reader a number of capabilities: (1) to
42159 analyze a study in a structured way, (2) to examine a
42160 study in multiple ways, (3) to incorporate domain
42161 knowledge and prior belief into an analysis, (4) to
42162 incorporate methodological knowledge into an analysis,
42163 (5) to determine the optimal therapy, (6) to examine
42164 the change in belief in any parameter of the underlying
42165 statistical model, (7) to compare the beliefs in any
42166 two parameters, and (8) to examine the sensitivity of
42167 any posterior belief or decision to different prior
42168 beliefs. THOMAS operates in the domain of randomized
42169 clinical trials that compare the effects of different
42170 drugs on a patients survival.\par
42171
42172 To incorporate any methodological concern, THOMAS (1)
42173 requires a statistical sub mode! for the concern, and
42174 (2) requires a visual metaphor though which the
42175 physician can communicate the particular concern.
42176 THOMAS contains submodels for the methodological
42177 concerns of loss to followup, withdrawal,
42178 noncompliance, crossing-over, and measurement
42179 unreliability. The system uses the visual metaphor of
42180 the patient-flow diagram for physician input.\par
42181
42182 In the course of each consultation, the user implicitly
42183 constructs a statistical model appropriate to the study
42184 and to the user s reading of that study. The
42185 construction process is based on representing the
42186 statistical models as hierarchical, typed influence
42187 diagrams, a structure that limits the interactions
42188 among parameters in a statistical model. Prespecified
42189 construction steps dictate how the primitive
42190 methodological submodels are pieced together. A
42191 metadata-state diagram, containing basic methodological
42192 knowledge assessed from a statistical expert and from
42193 the methodological literature, limits the sequence of
42194 construction steps the user is allowed.\par
42195
42196 The system has been evaluated positively by a small
42197 number of its intended users. The representational
42198 framework can be extended to deal with methodological
42199 concerns beyond THOMAS s current abilities.\par
42200
42201 This dissertation extends the Confidence Profile Method
42202 of Eddy, Hasselblad, and Shachter (1991) by automating
42203 its use. In addition, this dissertation puts on the
42204 medical-informatics agenda the question of how
42205 physicians should act on the basis of research data,
42206 and suggests novel methods for storing, using, and
42207 retrieving the contents of the biomedical research
42208 literature.",
42209 acknowledgement = ack-nhfb,
42210 advisor = "Edward H. Shortliffe",
42211 pdfpages = "304",
42212 remark = "This is the author's Ph.D. thesis.",
42213 }
42214
42215 @TechReport{Golding:1991:PNC,
42216 author = "Andrew Golding",
42217 title = "Pronouncing Names by a Combination of Rule-Based and
42218 Case-Based Reasoning",
42219 type = "Technical Report",
42220 number = "STAN-CS-92-1403",
42221 institution = inst-STAN-CS,
42222 address = inst-STAN-CS:adr,
42223 pages = "380",
42224 month = oct,
42225 year = "1991",
42226 bibdate = "Wed Nov 26 12:13:45 MST 2025",
42227 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
42228 URL = "",
42229 acknowledgement = ack-nhfb,
42230 remark = "This is the author's thesis.",
42231 }
42232
42233 @TechReport{Cha:1991:KMB,
42234 author = "Sang Kyun Cha",
42235 title = "Kaleidoscope: a Model-Based Grammar-Driven Menu
42236 Interface for Databases",
42237 type = "Technical Report",
42238 number = "STAN-CS-92-1405",
42239 institution = inst-STAN-CS,
42240 address = inst-STAN-CS:adr,
42241 pages = "141",
42242 month = jul,
42243 year = "1991",
42244 bibdate = "Wed Nov 26 12:13:45 MST 2025",
42245 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
42246 URL = "",
42247 acknowledgement = ack-nhfb,
42248 remark = "This is the author's thesis.",
42249 }
42250
42251 @TechReport{Williamson:1991:MRT,
42252 author = "Carey Lee Williamson",
42253 title = "Minimizing Round-Trip Times for High-Performance
42254 Transport Communication",
42255 type = "Technical Report",
42256 number = "STAN-CS-92-1409",
42257 institution = inst-STAN-CS,
42258 address = inst-STAN-CS:adr,
42259 pages = "129",
42260 month = oct,
42261 year = "1991",
42262 bibdate = "Wed Nov 26 12:13:45 MST 2025",
42263 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
42264 URL = "",
42265 acknowledgement = ack-nhfb,
42266 remark = "This is the author's thesis.",
42267 }
42268
42269 @TechReport{Deering:1991:MRD,
42270 author = "Stephen Deering",
42271 title = "Multicast Routing in a Datagram Internetwork",
42272 type = "Technical Report",
42273 number = "STAN-CS-92-1415",
42274 institution = inst-STAN-CS,
42275 address = inst-STAN-CS:adr,
42276 pages = "141",
42277 month = dec,
42278 year = "1991",
42279 bibdate = "Wed Nov 26 12:13:45 MST 2025",
42280 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
42281 URL = "",
42282 acknowledgement = ack-nhfb,
42283 remark = "This is the author's thesis.",
42284 }
42285
42286 @TechReport{Rothberg:1992:PID,
42287 author = "Edward Rothberg and Anoop Gupta",
42288 title = "The performance impact of data reuse in parallel dense
42289 {Cholesky} factorization",
42290 type = "Technical Report",
42291 number = "STAN-CS-92-1401 (CSL-TR-92-503)",
42292 institution = inst-STAN-CS,
42293 address = inst-STAN-CS:adr,
42294 pages = "30",
42295 month = jan,
42296 year = "1992",
42297 bibdate = "Thu Nov 20 12:13:32 MST 2025",
42298 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
42299 URL = "http://www-db.stanford.edu/TR/CS-TR-92-1401.html",
42300 abstract = "This paper explores performance issues for several
42301 prominent approaches to parallel dense Cholesky
42302 factorization. The primary focus is on issues that
42303 arise when blocking techniques are integrated into
42304 parallel factorization approaches to improve data reuse
42305 in the memory hierarchy. We first consider
42306 panel-oriented approaches, where sets of contiguous
42307 columns are manipulated as single units. These methods
42308 represent natural extensions of the column-oriented
42309 methods that have been widely used previously. On
42310 machines with memory hierarchies, panel-oriented
42311 methods significantly increase the achieved performance
42312 over column-oriented methods. However, we find that
42313 panel- oriented methods do not expose enough
42314 concurrency for problems that one might reasonably
42315 expect to solve on moderately parallel machines, thus
42316 significantly limiting their performance. We then
42317 explore block-oriented approaches, where square
42318 submatrices are manipulated instead of sets of columns.
42319 These methods greatly increase the amount of available
42320 concurrency, thus alleviating the problems encountered
42321 with panel-oriented methods. However, a number of
42322 issues, including scheduling choices and block-
42323 placement issues, complicate their implementation. We
42324 discuss these issues and consider approaches that solve
42325 the resulting problems. The resulting block-oriented
42326 implementation yields high processor utilization levels
42327 over a wide range of problem sizes.",
42328 acknowledgement = ack-nhfb,
42329 remark = "No PDF in NTRL archive.",
42330 xxnumber = "CS-TR-92-1401",
42331 }
42332
42333 @TechReport{Manna:1992:FDP,
42334 author = "Zohar Manna and Richard Waldinger",
42335 title = "Fundamentals of Deductive Program Synthesis",
42336 type = "Technical Report",
42337 number = "STAN-CS-92-1404",
42338 institution = inst-STAN-CS,
42339 address = inst-STAN-CS:adr,
42340 pages = "62",
42341 month = jan,
42342 year = "1992",
42343 bibdate = "Wed Nov 26 12:13:45 MST 2025",
42344 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
42345 URL = "",
42346 acknowledgement = ack-nhfb,
42347 }
42348
42349 @TechReport{Radzik:1992:NMF,
42350 author = "Tomasz Radzik",
42351 title = "{Newton}'s Method for Fractional Combinatorial
42352 Optimization",
42353 type = "Technical Report",
42354 number = "STAN-CS-92-1406",
42355 institution = inst-STAN-CS,
42356 address = inst-STAN-CS:adr,
42357 pages = "22",
42358 month = jan,
42359 year = "1992",
42360 bibdate = "Wed Nov 26 12:13:45 MST 2025",
42361 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
42362 URL = "",
42363 acknowledgement = ack-nhfb,
42364 }
42365
42366 @TechReport{Maler:1992:THS,
42367 author = "Oded Maler and Zohar Manna and Amir Pnueli",
42368 title = "From Timed to Hybrid Systems",
42369 type = "Technical Report",
42370 number = "STAN-CS-92-1407",
42371 institution = inst-STAN-CS,
42372 address = inst-STAN-CS:adr,
42373 pages = "38",
42374 month = jan,
42375 year = "1992",
42376 bibdate = "Wed Nov 26 12:13:45 MST 2025",
42377 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
42378 URL = "",
42379 acknowledgement = ack-nhfb,
42380 }
42381
42382 @TechReport{Chang:1992:SPC,
42383 author = "Edward Chang and Zohar Manna and Amir Pnueli",
42384 title = "The Safety-Progress Classification",
42385 type = "Technical Report",
42386 number = "STAN-CS-92-1408",
42387 institution = inst-STAN-CS,
42388 address = inst-STAN-CS:adr,
42389 pages = "60",
42390 month = feb,
42391 year = "1992",
42392 bibdate = "Wed Nov 26 12:13:45 MST 2025",
42393 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
42394 URL = "",
42395 acknowledgement = ack-nhfb,
42396 }
42397
42398 @TechReport{Alizadeh:1992:IPR,
42399 author = "Farid Alizadeh and Andrew Goldberg",
42400 title = "Implementing the Push-Relabel Method for the Maximum
42401 Flow Problem on the Connection Machine",
42402 type = "Technical Report",
42403 number = "STAN-CS-92-1410",
42404 institution = inst-STAN-CS,
42405 address = inst-STAN-CS:adr,
42406 pages = "17",
42407 month = feb,
42408 year = "1992",
42409 bibdate = "Wed Nov 26 12:13:45 MST 2025",
42410 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
42411 URL = "",
42412 acknowledgement = ack-nhfb,
42413 }
42414
42415 @TechReport{Wong-Toi:1992:CDR,
42416 author = "Howard Wong-Toi and Gerard Hoffmann",
42417 title = "The Control of Dense Real-Time Discrete Event
42418 Systems",
42419 type = "Technical Report",
42420 number = "STAN-CS-92-1411",
42421 institution = inst-STAN-CS,
42422 address = inst-STAN-CS:adr,
42423 pages = "50",
42424 month = mar,
42425 year = "1992",
42426 bibdate = "Wed Nov 26 12:13:45 MST 2025",
42427 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
42428 URL = "",
42429 acknowledgement = ack-nhfb,
42430 }
42431
42432 @TechReport{Nilsson:1992:TAP,
42433 author = "Nils J. Nilsson",
42434 title = "Toward Agent Programs with Circuit Semantics",
42435 type = "Technical Report",
42436 number = "STAN-CS-92-1412",
42437 institution = inst-STAN-CS,
42438 address = inst-STAN-CS:adr,
42439 pages = "33",
42440 month = jan,
42441 year = "1992",
42442 bibdate = "Thu Nov 20 12:13:32 MST 2025",
42443 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
42444 URL = "http://www-db.stanford.edu/TR/CS-TR-92-1412.html",
42445 abstract = "New ideas are presented for computing and organizing
42446 actions for autonomous agents in dynamic environments
42447 --- environments in which the agent's current situation
42448 cannot always be accurately discerned and in which the
42449 effects of actions cannot always be reliably predicted.
42450 The notion of ``circuit semantics'' for programs based
42451 on ``teleo-reactive trees'' is introduced. Program
42452 execution builds a combinational circuit which receives
42453 sensory inputs and controls actions. These formalisms
42454 embody a high degree of inherent conditionality and
42455 thus yield programs that are suitably reactive to their
42456 environments. At the same time, the actions computed by
42457 the programs are guided by the overall goals of the
42458 agent. The paper also speculates about how programs
42459 using these ideas could be automatically generated by
42460 artificial intelligence planning systems and adapted by
42461 learning methods.",
42462 acknowledgement = ack-nhfb,
42463 xxnumber = "CS-TR-92-1412",
42464 }
42465
42466 @TechReport{Zhu:1992:EIG,
42467 author = "David Zhu",
42468 title = "Exploring the Interaction of Geometry and Search in
42469 Path Planning",
42470 type = "Technical Report",
42471 number = "STAN-CS-92-1413",
42472 institution = inst-STAN-CS,
42473 address = inst-STAN-CS:adr,
42474 pages = "203",
42475 month = feb,
42476 year = "1992",
42477 bibdate = "Wed Nov 26 12:13:45 MST 2025",
42478 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
42479 URL = "",
42480 acknowledgement = ack-nhfb,
42481 remark = "This is the author's thesis.",
42482 }
42483
42484 @TechReport{Miller:1992:PTF,
42485 author = "Robert Miller",
42486 title = "Proceedings From the {Twenty-Fourth Annual Meeting of
42487 the Stanford Computer Forum}",
42488 type = "Technical Report",
42489 number = "STAN-CS-92-1414",
42490 institution = inst-STAN-CS,
42491 address = inst-STAN-CS:adr,
42492 pages = "186",
42493 month = feb,
42494 year = "1992",
42495 bibdate = "Wed Nov 26 12:13:45 MST 2025",
42496 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
42497 URL = "",
42498 acknowledgement = ack-nhfb,
42499 }
42500
42501 @TechReport{Wilson:1992:GAP,
42502 author = "Randall Wilson",
42503 title = "On Geometric Assembly Planning",
42504 type = "Technical Report",
42505 number = "STAN-CS-92-1416",
42506 institution = inst-STAN-CS,
42507 address = inst-STAN-CS:adr,
42508 pages = "154",
42509 month = mar,
42510 year = "1992",
42511 bibdate = "Wed Nov 26 12:13:45 MST 2025",
42512 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
42513 URL = "",
42514 acknowledgement = ack-nhfb,
42515 remark = "This is the author's thesis.",
42516 }
42517
42518 @TechReport{Suermondt:1992:EBB,
42519 author = "Henri Jacques Suermondt",
42520 title = "Explanation in {Bayesian} Belief Networks",
42521 type = "Technical Report",
42522 number = "STAN-CS-92-1417",
42523 institution = inst-STAN-CS,
42524 address = inst-STAN-CS:adr,
42525 pages = "263",
42526 month = mar,
42527 year = "1992",
42528 bibdate = "Wed Nov 26 12:13:45 MST 2025",
42529 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
42530 URL = "",
42531 acknowledgement = ack-nhfb,
42532 remark = "This is the author's thesis.",
42533 }
42534
42535 @TechReport{Goldberg:1992:ISP,
42536 author = "Andrew Goldberg and Michael Kharitonov",
42537 title = "On Implementing Scaling Push--Relabel Algorithms for
42538 the Minimum Cost Flow Problems",
42539 type = "Technical Report",
42540 number = "STAN-CS-92-1418",
42541 institution = inst-STAN-CS,
42542 address = inst-STAN-CS:adr,
42543 pages = "37",
42544 month = mar,
42545 year = "1992",
42546 bibdate = "Wed Nov 26 12:13:45 MST 2025",
42547 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
42548 URL = "",
42549 acknowledgement = ack-nhfb,
42550 }
42551
42552 @TechReport{Plotkin:1992:FAA,
42553 author = "Serge A. Plotkin and David B. Shmoys and {\'E}va
42554 Tardos",
42555 title = "Fast Approximation Algorithms for Fractional Packing
42556 and Covering Problems",
42557 type = "Technical Report",
42558 number = "STAN-CS-92-1419",
42559 institution = inst-STAN-CS,
42560 address = inst-STAN-CS:adr,
42561 pages = "ii + 52",
42562 month = feb,
42563 year = "1992",
42564 bibdate = "Thu Nov 20 12:13:32 MST 2025",
42565 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
42566 URL = "http://www-db.stanford.edu/TR/CS-TR-92-1419.html",
42567 abstract = "This paper presents fast algorithms that find
42568 approximate solutions for a general class of problems,
42569 which we call fractional packing and covering problems.
42570 The only previously known algorithms for solving these
42571 problems are based on general linear programming
42572 techniques. The techniques developed in this paper
42573 greatly outperform the general methods in many
42574 applications, and are extensions of a method previously
42575 applied to find approximate solutions to multicommodity
42576 flow problems. Our algorithm is a Lagrangean relaxation
42577 technique; an important aspect of our results is that
42578 we obtain a theoretical analysis of the running time of
42579 a Lagrangean relaxation-based algorithm.\par
42580
42581 We give several applications of our algorithms. The new
42582 approach yields several orders of magnitude of
42583 improvement over the best previously known running
42584 times for the scheduling of unrelated parallel machines
42585 in both the preemptive and the non-preemptive models,
42586 for the job shop problem, for the cutting-stock
42587 problem, and for the minimum cost multicommodity flow
42588 problem.",
42589 acknowledgement = ack-nhfb,
42590 pdfpages = "54",
42591 xxnumber = "CS-TR-92-1419",
42592 }
42593
42594 @TechReport{Chambers:1992:DIS,
42595 author = "Craig Chambers",
42596 title = "The Design and Implementation of the Self Compiler, an
42597 Optimizing Compiler for Object-Oriented Programming
42598 Languages",
42599 type = "Technical Report",
42600 number = "STAN-CS-92-1420",
42601 institution = inst-STAN-CS,
42602 address = inst-STAN-CS:adr,
42603 pages = "246",
42604 month = mar,
42605 year = "1992",
42606 bibdate = "Wed Nov 26 12:13:45 MST 2025",
42607 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
42608 URL = "",
42609 acknowledgement = ack-nhfb,
42610 remark = "This is the author's thesis.",
42611 }
42612
42613 @TechReport{Wang:1992:FTC,
42614 author = "Alexander Wang",
42615 title = "Fault-Tolerant Computation on Hypercubes",
42616 type = "Technical Report",
42617 number = "STAN-CS-92-1421",
42618 institution = inst-STAN-CS,
42619 address = inst-STAN-CS:adr,
42620 pages = "148",
42621 month = mar,
42622 year = "1992",
42623 bibdate = "Wed Nov 26 12:13:45 MST 2025",
42624 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
42625 URL = "",
42626 acknowledgement = ack-nhfb,
42627 remark = "This is the author's thesis.",
42628 }
42629
42630 @TechReport{Walker:1992:PEC,
42631 author = "Michael Walker",
42632 title = "Probability Estimation for Classification Trees and
42633 {DNA} Sequence Analysis",
42634 type = "Technical Report",
42635 number = "STAN-CS-92-1422 (KSL-92-27)",
42636 institution = inst-STAN-CS,
42637 address = inst-STAN-CS:adr,
42638 pages = "213",
42639 month = mar,
42640 year = "1992",
42641 bibdate = "Wed Nov 26 12:13:45 MST 2025",
42642 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
42643 URL = "",
42644 acknowledgement = ack-nhfb,
42645 remark = "This is the author's thesis.",
42646 }
42647
42648 @TechReport{Dwork:1992:TLS,
42649 author = "Cynthia Dwork and Maurice Herlihy and Serge A. Plotkin
42650 and Orli Waarts",
42651 title = "Time-Lapse Snapshots",
42652 type = "Technical Report",
42653 number = "STAN-CS-92-1423",
42654 institution = inst-STAN-CS,
42655 address = inst-STAN-CS:adr,
42656 pages = "ii + 19",
42657 month = apr,
42658 year = "1992",
42659 bibdate = "Thu Nov 20 12:13:32 MST 2025",
42660 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
42661 URL = "http://i.stanford.edu/pub/cstr/reports/cs/tr/92/1423/CS-TR-92-1423.pdf;
42662 http://www-db.stanford.edu/TR/CS-TR-92-1423.html",
42663 abstract = "A snapshot scan algorithm takes an ``instantaneous''
42664 picture of a region of shared memory that may he
42665 updated by concurrent processes. Many complex shared
42666 memory algorithms can be greatly simplified by
42667 structuring them around the snapshot scan abstraction.
42668 Unfortunately, the substantial decrease in conceptual
42669 complexity is quite often counterbalanced by an
42670 increase in computational complexity.\par
42671
42672 In this paper, we introduce the notion of a weak
42673 snapshot scan, a slightly weaker primitive that has a
42674 more efficient implementation. We propose the following
42675 methodology for using this abstraction: first, design
42676 and verify an algorithm using the more powerful
42677 snapshot scan, and second, replace the more powerful
42678 but less efficient snapshot with the weaker but more
42679 efficient snapshot, and show that the weaker
42680 abstraction nevertheless suffices to ensure the
42681 correctness of the enclosing algorithm.\par
42682
42683 We give two examples of algorithms whose performance
42684 can be enhanced while retaining a simple modular
42685 structure: bounded concurrent timestamping, and bounded
42686 randomized consensus. The resulting timestamping
42687 protocol is the fastest known bounded concurrent
42688 timestamping protocol. The resulting randomized
42689 consensus protocol matches the computational complexity
42690 of the best known protocol that uses only bounded
42691 values.",
42692 acknowledgement = ack-nhfb,
42693 pdfpages = "22",
42694 xxnumber = "CS-TR-92-1423",
42695 }
42696
42697 @TechReport{Takeda:1992:PMM,
42698 author = "Haruo Takeda and Jean-Claude Latombe",
42699 title = "Planning the Motions of a Mobile Robot in a Sensory
42700 Uncertainty Field",
42701 type = "Technical Report",
42702 number = "STAN-CS-92-1424",
42703 institution = inst-STAN-CS,
42704 address = inst-STAN-CS:adr,
42705 pages = "31",
42706 month = apr,
42707 year = "1992",
42708 bibdate = "Wed Nov 26 12:13:45 MST 2025",
42709 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
42710 URL = "",
42711 acknowledgement = ack-nhfb,
42712 }
42713
42714 @TechReport{Kavraki:1992:CCS,
42715 author = "Lydia Kavraki",
42716 title = "Computation of Configuration-Space Obstacles Using the
42717 {Fast Fourier Transform}",
42718 type = "Technical Report",
42719 number = "STAN-CS-92-1425",
42720 institution = inst-STAN-CS,
42721 address = inst-STAN-CS:adr,
42722 pages = "21",
42723 month = apr,
42724 year = "1992",
42725 bibdate = "Wed Nov 26 12:13:45 MST 2025",
42726 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
42727 URL = "",
42728 acknowledgement = ack-nhfb,
42729 }
42730
42731 @TechReport{Danvy:1992:PAS,
42732 author = "Olivier Danvy and Carolyn Talcott",
42733 title = "Proceedings of the {ACM SIGPLAN Workshop on
42734 Continuations CW92}",
42735 type = "Technical Report",
42736 number = "STAN-CS-92-1426",
42737 institution = inst-STAN-CS,
42738 address = inst-STAN-CS:adr,
42739 pages = "ii + 103",
42740 day = "21",
42741 month = jun,
42742 year = "1992",
42743 bibdate = "Thu Nov 20 12:13:32 MST 2025",
42744 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
42745 URL = "http://i.stanford.edu/pub/cstr/reports/cs/tr/92/1426/CS-TR-92-1426.pdf;
42746 http://www-db.stanford.edu/TR/CS-TR-92-1426.html",
42747 abstract = "The notion of continuation is ubiquitous in many
42748 different areas of computer science, including logic,
42749 constructive mathematics, programming languages, and
42750 programming. This workshop aims at providing a forum
42751 for discussion of: new results and work in progress;
42752 work aimed at a better understanding of the nature of
42753 continuations; applications of continuations, and the
42754 relation of continuations to other areas of logic and
42755 computer science. This technical report serves as
42756 informal proceedings for CW92. It consists of submitted
42757 manuscripts bound together according to the program
42758 order.",
42759 acknowledgement = ack-nhfb,
42760 pdfpages = "105",
42761 xxnumber = "CS-TR-92-1426",
42762 }
42763
42764 @TechReport{Goldberg:1992:PAR,
42765 author = "Andrew Goldberg and Bruce Maggs and Serge Plotkin",
42766 title = "A Parallel Algorithm for Reconfiguring a
42767 Multibutterfly Network with Faulty Switches",
42768 type = "Technical Report",
42769 number = "STAN-CS-92-1427",
42770 institution = inst-STAN-CS,
42771 address = inst-STAN-CS:adr,
42772 pages = "15",
42773 month = apr,
42774 year = "1992",
42775 bibdate = "Wed Nov 26 12:13:45 MST 2025",
42776 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
42777 URL = "",
42778 acknowledgement = ack-nhfb,
42779 }
42780
42781 @TechReport{Lazanas:1992:LBR,
42782 author = "Anthony Lazanas and Jean-Claude Latombe",
42783 title = "Landmark-Based Robot Navigation",
42784 type = "Technical Report",
42785 number = "STAN-CS-92-1428",
42786 institution = inst-STAN-CS,
42787 address = inst-STAN-CS:adr,
42788 pages = "54",
42789 month = may,
42790 year = "1992",
42791 bibdate = "Wed Nov 26 12:13:45 MST 2025",
42792 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
42793 URL = "",
42794 acknowledgement = ack-nhfb,
42795 }
42796
42797 @TechReport{Goldberg:1992:SAS,
42798 author = "Andrew Goldberg",
42799 title = "Scaling Algorithms for the Shortest Paths Problem",
42800 type = "Technical Report",
42801 number = "STAN-CS-92-1429",
42802 institution = inst-STAN-CS,
42803 address = inst-STAN-CS:adr,
42804 pages = "11",
42805 month = may,
42806 year = "1992",
42807 bibdate = "Wed Nov 26 12:13:45 MST 2025",
42808 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
42809 URL = "",
42810 acknowledgement = ack-nhfb,
42811 }
42812
42813 @TechReport{Garcia-Molina:1992:ATR,
42814 author = "Hector Garcia-Molina and Ben Kao and Daniel
42815 Barbar{\'a}",
42816 title = "Aggressive Transmissions Over Redundant Paths for Time
42817 Critical Messages",
42818 type = "Technical Report",
42819 number = "STAN-CS-92-1431",
42820 institution = inst-STAN-CS,
42821 address = inst-STAN-CS:adr,
42822 pages = "ii + 43",
42823 month = may,
42824 year = "1992",
42825 bibdate = "Thu Nov 20 12:13:32 MST 2025",
42826 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
42827 URL = "http://i.stanford.edu/pub/cstr/reports/cs/tr/92/1431/CS-TR-92-1431.pdf;
42828 http://www-db.stanford.edu/TR/CS-TR-92-1431.html",
42829 abstract = "Fault tolerant computer systems have redundant paths
42830 connecting their components. Given these paths, it is
42831 possible to use aggressive techniques to reduce the
42832 average value and variability of the response time for
42833 critical messages. One technique is to send a copy of a
42834 packet over an alternate path before it is known if the
42835 first copy failed or was delayed. A second technique is
42836 to split a single stream of packets over multiple
42837 paths. We analyze both approaches and show that they
42838 can provide significant improvements over conventional,
42839 conservative mechanisms.",
42840 acknowledgement = ack-nhfb,
42841 pdfpages = "45",
42842 remark = "PDF file contains no publication date; the STAN-CS
42843 bibliographies give this as May 1992 and October 1993,
42844 and have an incorrect author order.",
42845 xxnumber = "CS-TR-92-1431",
42846 }
42847
42848 @TechReport{Chaudhuri:1992:DRT,
42849 author = "Surajit Chaudhuri",
42850 title = "Detecting Redundant Tuples During Query Evaluation",
42851 type = "Technical Report",
42852 number = "STAN-CS-92-1433",
42853 institution = inst-STAN-CS,
42854 address = inst-STAN-CS:adr,
42855 pages = "230",
42856 month = jun,
42857 year = "1992",
42858 bibdate = "Wed Nov 26 12:13:45 MST 2025",
42859 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
42860 URL = "",
42861 acknowledgement = ack-nhfb,
42862 remark = "This is the author's thesis.",
42863 }
42864
42865 @TechReport{Tomasic:1992:PII,
42866 author = "Anthony Tomasic and Hector Garcia-Molina",
42867 title = "Performance of Inverted Indices in Distributed Text
42868 Document Retrieval Systems",
42869 type = "Technical Report",
42870 number = "STAN-CS-92-1434",
42871 institution = inst-STAN-CS,
42872 address = inst-STAN-CS:adr,
42873 pages = "25",
42874 month = jun,
42875 year = "1992",
42876 bibdate = "Wed Nov 26 12:13:45 MST 2025",
42877 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
42878 URL = "",
42879 acknowledgement = ack-nhfb,
42880 }
42881
42882 @TechReport{Motwani:1993:LNA,
42883 author = "Rajeev Motwani",
42884 title = "Lecture Notes on Approximation Algorithms --- {Volume
42885 I}",
42886 type = "Technical Report",
42887 number = "STAN-CS-92-1435",
42888 institution = inst-STAN-CS,
42889 address = inst-STAN-CS:adr,
42890 pages = "ii + 132",
42891 month = jun,
42892 year = "1992",
42893 bibdate = "Thu Nov 20 12:13:32 MST 2025",
42894 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
42895 URL = "http://www-db.stanford.edu/TR/CS-TR-92-1435.html",
42896 abstract = "These lecture notes are based on the course CS351
42897 (Dept. of Computer Science, Stanford University)
42898 offered during the academic year 1991-92. The notes
42899 below correspond to the first half of the course. The
42900 second half consists of topics such as AL4X SNP.
42901 cliques, and colorings, as well as more specialized
42902 material covering topics such as geometric problems,
42903 Steiner trees and multicommodity flows. The second half
42904 is being revised to incorporate the implications of
42905 recent results in approximation algorithms and the
42906 complexity of approximation problems. Please let me
42907 know if you would like to be on the mailing list for
42908 the second half. Comments, criticisms and corrections
42909 are welcome, please send them by electronic mail to
42910 [email protected].",
42911 acknowledgement = ack-nhfb,
42912 pdfpages = "134",
42913 remark = "No publication date in PDF file. Stanford
42914 bibliographies record this is as June 1992 and October
42915 1993.",
42916 xxnumber = "CS-TR-92-1435",
42917 }
42918
42919 @TechReport{Winograd:1992:CES,
42920 author = "Terry Winograd",
42921 title = "Computers, Ethics, and Social Responsibility",
42922 type = "Technical Report",
42923 number = "STAN-CS-92-1436",
42924 institution = inst-STAN-CS,
42925 address = inst-STAN-CS:adr,
42926 pages = "30",
42927 month = jul,
42928 year = "1992",
42929 bibdate = "Wed Nov 26 12:13:45 MST 2025",
42930 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
42931 URL = "",
42932 acknowledgement = ack-nhfb,
42933 }
42934
42935 @TechReport{Phipps:1992:GDD,
42936 author = "Geoffrey Phipps",
42937 title = "Glue: a Deductive Database Programming Language",
42938 type = "Technical Report",
42939 number = "STAN-CS-92-1437",
42940 institution = inst-STAN-CS,
42941 address = inst-STAN-CS:adr,
42942 pages = "139",
42943 month = jul,
42944 year = "1992",
42945 bibdate = "Wed Nov 26 12:13:45 MST 2025",
42946 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
42947 URL = "",
42948 acknowledgement = ack-nhfb,
42949 remark = "This is the author's thesis.",
42950 }
42951
42952 @TechReport{Rothberg:1992:EBO,
42953 author = "Edward Rothberg and Anoop Gupta",
42954 title = "An Efficient Block-Oriented Approach to Parallel
42955 Sparse {Cholesky} Factorization",
42956 type = "Technical Report",
42957 number = "STAN-CS-92-1438 (CSL-TR-92-533, PB96-151543)",
42958 institution = inst-STAN-CS,
42959 address = inst-STAN-CS:adr,
42960 pages = "iv + 25",
42961 day = "13",
42962 month = jul,
42963 year = "1992",
42964 bibdate = "Wed Nov 26 12:13:45 MST 2025",
42965 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
42966 URL = "",
42967 abstract = "This paper explores the use of a sub-block
42968 decomposition strategy for parallel sparse Cholesky
42969 factorization, in which the sparse matrix is decomposed
42970 into rectangular blocks. Such a strategy has enormous
42971 theoretical scalability advantages over a more
42972 traditional column-oriented decomposition for large
42973 parallel machines. However, little progress has been
42974 made in producing a practical sub-block method. This
42975 paper describes and evaluates an approach that is both
42976 simple and efficient",
42977 acknowledgement = ack-nhfb,
42978 pdfpages = "29",
42979 }
42980
42981 @TechReport{Goldberg:1992:EIS,
42982 author = "Andrew Goldberg",
42983 title = "An Efficient Implementation of a Scaling {MinimumCost}
42984 Flow Algorithm",
42985 type = "Technical Report",
42986 number = "STAN-CS-92-1439",
42987 institution = inst-STAN-CS,
42988 address = inst-STAN-CS:adr,
42989 pages = "21",
42990 month = aug,
42991 year = "1992",
42992 bibdate = "Wed Nov 26 12:13:45 MST 2025",
42993 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
42994 URL = "",
42995 acknowledgement = ack-nhfb,
42996 }
42997
42998 @TechReport{Woodfill:1992:MVT,
42999 author = "John Woodfill",
43000 title = "Motion Vision and Tracking for Robots in Dynamic,
43001 Unstructured Environments",
43002 type = "Technical Report",
43003 number = "STAN-CS-92-1440",
43004 institution = inst-STAN-CS,
43005 address = inst-STAN-CS:adr,
43006 pages = "163",
43007 month = aug,
43008 year = "1992",
43009 bibdate = "Wed Nov 26 12:13:45 MST 2025",
43010 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
43011 URL = "",
43012 acknowledgement = ack-nhfb,
43013 remark = "This is the author's thesis.",
43014 }
43015
43016 @TechReport{Schweikard:1992:MPS,
43017 author = "Achim Schweikard and John R. Adler and Jean-Claude
43018 Latombe",
43019 title = "Motion Planning in Stereotaxic Radiosurgery",
43020 type = "Technical Report",
43021 number = "STAN-CS-92-1441",
43022 institution = inst-STAN-CS,
43023 address = inst-STAN-CS:adr,
43024 pages = "20",
43025 month = sep,
43026 year = "1992",
43027 bibdate = "Thu Nov 20 12:13:32 MST 2025",
43028 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
43029 URL = "http://www-db.stanford.edu/TR/CS-TR-92-1441.html",
43030 abstract = "Stereotaxic radiosurgery is a procedure which uses a
43031 beam of radiation as an ablative surgical instrument to
43032 destroy brain tumors. The beam is produced by a linear
43033 accelerator which is moved by a jointed mechanism.
43034 Radiation is concentrated by crossfiring at the tumor
43035 from multiple directions and the amount of energy
43036 deposited in normal brain tissues is reduced. Because
43037 access to the tumor is obstructed along some directions
43038 by critical regions (e.g., brainstem, optic nerves) and
43039 most tumors are not shaped like spheres, planning the
43040 path of the beam is often difficult and time-consuming.
43041 This paper describes a computer-based planner developed
43042 to assist the surgeon generate a satisfactory path,
43043 given the spatial distribution of the brain tissues
43044 obtained with medical imaging. Experimental results
43045 with the implemented planner are presented, including a
43046 comparison with manually generated paths. According to
43047 these results, automatic planning significantly
43048 improves energy deposition. It can also shorten the
43049 overall treatment, hence reducing the patient's pain
43050 and allowing the radiosurgery equipment to be used for
43051 more patients. Stereotaxic radiosurgery is an example
43052 of so-called ``bloodless surgery''. Computer-based
43053 planning techniques are expected to facilitate further
43054 development of this safer, less painful, and more cost
43055 effective type of surgery.",
43056 acknowledgement = ack-nhfb,
43057 xxnumber = "CS-TR-92-1441",
43058 }
43059
43060 @TechReport{Wilson:1992:RAM,
43061 author = "Randall H. Wilson and Jean-Claude Latombe",
43062 title = "Reasoning About Mechanical Assembly",
43063 type = "Technical Report",
43064 number = "STAN-CS-92-1442",
43065 institution = inst-STAN-CS,
43066 address = inst-STAN-CS:adr,
43067 pages = "31",
43068 month = sep,
43069 year = "1992",
43070 bibdate = "Wed Nov 26 12:13:45 MST 2025",
43071 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
43072 URL = "",
43073 acknowledgement = ack-nhfb,
43074 }
43075
43076 @TechReport{Nayak:1992:AMP,
43077 author = "P. Pandurang Nayak",
43078 title = "Automated Modeling of Physical Systems",
43079 type = "Technical Report",
43080 number = "STAN-CS-92-1443 (KSL-92-69, AD-A263755)",
43081 institution = inst-STAN-CS,
43082 address = inst-STAN-CS:adr,
43083 pages = "xix + 295",
43084 month = sep,
43085 year = "1992",
43086 bibdate = "Wed Nov 26 12:13:45 MST 2025",
43087 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
43088 URL = "https://apps.dtic.mil/sti/citations/ADA263755;
43089 https://apps.dtic.mil/sti/pdfs/ADA263755.pdf",
43090 abstract = "Effective reasoning about complex physical systems
43091 requires the use of models that are adequate for the
43092 task. Constructing such adequate models is often
43093 difficult. In this dissertation, we address this
43094 difficulty by developing efficient techniques for
43095 automatically selecting adequate models of physical
43096 systems. We focus on the important task of generating
43097 parsimonious causal explanations for phenomena of
43098 interest. Formally, we propose answers to the
43099 following: (a) what is a model and what is the space of
43100 possible models; (b) what is an adequate model; and (c)
43101 how do we find adequate models.\par
43102
43103 We define a model as a set of {\em model fragments},
43104 where a model fragment is a set of independent
43105 equations that partially describes some physical
43106 phenomenon. The space of possible models is defined
43107 implicitly by the set of applicable model fragments
43108 different subsets of this set correspond to different
43109 models. An adequate model is defined as a simplest
43110 model that can explain the phenomenon of interest, and
43111 that satisfies any domain-independent and
43112 domain-dependent constraints on the structure and
43113 behavior of the physical system.\par
43114
43115 We show that, in general, finding an adequate model is
43116 intractable NP-hard. We address this intractability, by
43117 introducing a set of restrictions, and use these
43118 restrictions to develop an efficient algorithm for
43119 finding adequate models. The most significant
43120 restriction is that all the approximation relations
43121 between model fragments are required to be {\em causal
43122 approximations}. In practice this is not a serious
43123 restriction because most commonly used approximations
43124 are causal approximations.\par
43125
43126 We also develop a novel {\em order of magnitude\/}
43127 reasoning technique, which strikes a balance between
43128 purely qualitative and purely quantitative methods. The
43129 order of magnitude of a parameter is defined on a
43130 logarithmic scale, and a set of rules propagate orders
43131 of magnitudes through equations. A novel feature of
43132 these rules is that they effectively handle non-linear
43133 simultaneous equations, using linear programming in
43134 conjunction with backtracking.\par
43135
43136 The techniques described in this dissertation have been
43137 implemented and have been tested on a variety of
43138 electromechanical devices. These tests provide
43139 empirical evidence for the theoretical claims of the
43140 dissertation.",
43141 acknowledgement = ack-nhfb,
43142 advisor = "Ed Feigenbaum",
43143 pdfpages = "315",
43144 remark = "This is the author's thesis. No PDF in NTRL archive.
43145 Found in DTIC archive.",
43146 }
43147
43148 @TechReport{Goldberg:1992:MPD,
43149 author = "Aaron J. Goldberg",
43150 title = "Multiprocessor Performance Debugging and Memory
43151 Bottlenecks",
43152 type = "Technical Report",
43153 number = "STAN-CS-92-1444 (CSL-TR-92-542, AD-A268387)",
43154 institution = inst-STAN-CS,
43155 address = inst-STAN-CS:adr,
43156 pages = "xi + 124",
43157 month = may,
43158 year = "1992",
43159 bibdate = "Wed Nov 26 12:13:45 MST 2025",
43160 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
43161 URL = "https://apps.dtic.mil/sti/tr/pdf/ADA268387.pdf",
43162 abstract = "Driven by the computational demands of scientists and
43163 engineers, computer architects are building
43164 increasingly complex multiprocessor systems. However,
43165 while the peak Gigaflop rating of such systems is often
43166 impressive, the actual performance of initial
43167 implementations of applications can be disappointing.
43168 To make the task of performance debugging manageable,
43169 tools are needed that can analyze program behavior and
43170 report sources of performance loss. This dissertation
43171 describes techniques for building such tools for shared
43172 memory multiprocessors.\par
43173
43174 Previous efforts to build performance debugging systems
43175 for shared memory multiprocessors had two shortcomings.
43176 First, though memory hierarchy performance is often
43177 critical to program performance, most tools cannot
43178 distinguish the time the CPU is computing from the time
43179 when it is stalled waiting on the memory hierarchy.
43180 Second, many tools significantly perturb a program's
43181 execution adding 50\% or more overhead, making it
43182 difficult to measure the behavior of the original
43183 uninstrumented code. This dissertation addresses both
43184 of these problems. Our software instrumentation system,
43185 Mtool, typically increases program execution time by
43186 less than 10\% while collecting a detailed profile of
43187 where processors are doing work, waiting for work, or
43188 stalled waiting on the memory hierarchy. The overhead
43189 of the instrumentation is kept to less than 10\% (on
43190 average) by exploiting a basic block count profile to
43191 guide Mtool in selecting the best instrumentation
43192 points for each program. A window-based user interface
43193 allows the user to interpret the profile, viewing
43194 compute, memory, and synchronization bottlenecks at
43195 increasing levels of detail, from a whole program level
43196 down to the level of individual procedures, loops, and
43197 synchronization objects.\par
43198
43199 Current multiprocessors often have features like
43200 per-processor multi-level caches, buffers, complex
43201 interconnection networks, and banked memories that
43202 dynamically interact to determine memory system
43203 performance. Mtool uses a memory overhead detection
43204 technique that is independent of this complexity. By
43205 comparing an ideal CPU time profile based on basic
43206 block count information against an actual execution
43207 time profile, Mtool can isolate memory system effects
43208 in just over the time to execute the original code
43209 twice. This technique represents a significant
43210 improvement over previous simulation-based methods that
43211 take 10-1000 times longer to run than the programmer's
43212 actual code.\par
43213
43214 Mtool is in active use by several groups of parallel
43215 programmers at Stanford. We summarize their experiences
43216 with the tool, exploring which attention focusing
43217 mechanisms are most important, describing actual
43218 techniques by which memory and synchronization behavior
43219 were improved, and providing real data on the
43220 importance of memory and synchronization overheads in
43221 several multiprocessor applications.",
43222 acknowledgement = ack-nhfb,
43223 advisor = "John Hennessy",
43224 pdfpages = "137",
43225 remark = "This is the author's thesis. No PDF in NTRL archive.
43226 Found in DTIC archive.",
43227 }
43228
43229 @TechReport{Kharitonov:1992:CHD,
43230 author = "Michael Kharitonov",
43231 title = "Cryptographic Hardness of Distribution-Specific
43232 Learning",
43233 type = "Technical Report",
43234 number = "STAN-CS-92-1445",
43235 institution = inst-STAN-CS,
43236 address = inst-STAN-CS:adr,
43237 pages = "24",
43238 month = sep,
43239 year = "1992",
43240 DOI = "https://doi.org/10.1145/167088.167197",
43241 bibdate = "Wed Nov 26 12:13:45 MST 2025",
43242 bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography.bib;
43243 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
43244 URL = "https://www.cis.upenn.edu/~mkearns/teaching/Crypto/kharitonov.pdf",
43245 acknowledgement = ack-nhfb,
43246 remark = "Published in \booktitle{Proceedings of the
43247 twenty-fifth annual ACM symposium on Theory of
43248 computing --- STOC '93}, pp. 372--381, 1993.
43249 doi:10.1145/167088.167197.",
43250 }
43251
43252 @TechReport{Ceri:1992:IUI,
43253 author = "Stefano Ceri and Maurice A. W. Houtsma and Arthur M.
43254 Keller and Pierangela Samarati",
43255 title = "Independent updates and incremental agreement in
43256 replicated databases",
43257 type = "Technical Report",
43258 number = "STAN-CS-92-1446",
43259 institution = inst-STAN-CS,
43260 address = inst-STAN-CS:adr,
43261 pages = "13",
43262 month = oct,
43263 year = "1992",
43264 bibdate = "Thu Nov 20 12:13:32 MST 2025",
43265 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
43266 URL = "http://www-db.stanford.edu/TR/CS-TR-92-1446.html",
43267 abstract = "Update propagation and transaction atomicity are major
43268 obstacles to the development of replicated databases.
43269 Many practical applications, such as automated teller
43270 machine (ATM) networks, flight reservation, and part
43271 inventory control, do not really require these
43272 properties. In this paper we present an approach for
43273 incrementally updating a distributed, replicated
43274 database without requiring multi-site atomic commit
43275 protocols. We prove that the mechanism is correct, as
43276 it asymptotically performs all the updates on all the
43277 copies. Our approach has two important characteristics:
43278 it is progressive, and non-blocking. Progressive means
43279 that the transaction's coordinator always commits,
43280 possibly together with a group of other sites. The
43281 update is later propagated asynchronously to the
43282 remaining sites. Non-blocking means that each site can
43283 take unilateral decisions at each step of the
43284 algorithm. Sites which cannot commit updates are
43285 brought to the same final state by means of a
43286 reconciliation mechanism. This mechanism uses the
43287 history logs, which are stored locally at each site, to
43288 bring sites to agreement. It requires a small auxiliary
43289 data structure, called reception vector, to keep track
43290 of the time until which the other sites are guaranteed
43291 to be up-to-date. Several optimizations to the basic
43292 mechanism are also discussed.",
43293 acknowledgement = ack-nhfb,
43294 xxnumber = "CS-TR-92-1446",
43295 }
43296
43297 @TechReport{Goldberg:1992:LNT,
43298 author = "Andrew V. Goldberg and Serge Plotkin",
43299 title = "Lecture Notes: Topics in Combinatorial Optimization",
43300 type = "Technical Report",
43301 number = "STAN-CS-92-1447",
43302 institution = inst-STAN-CS,
43303 address = inst-STAN-CS:adr,
43304 pages = "85",
43305 month = oct,
43306 year = "1992",
43307 bibdate = "Wed Nov 26 12:13:45 MST 2025",
43308 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
43309 URL = "",
43310 acknowledgement = ack-nhfb,
43311 }
43312
43313 @TechReport{Crew:1992:MPM,
43314 author = "Roger F. Crew",
43315 title = "Metric Process Models",
43316 type = "Technical Report",
43317 number = "STAN-CS-92-1448",
43318 institution = inst-STAN-CS,
43319 address = inst-STAN-CS:adr,
43320 pages = "87",
43321 month = oct,
43322 year = "1992",
43323 bibdate = "Wed Nov 26 12:13:45 MST 2025",
43324 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
43325 URL = "",
43326 acknowledgement = ack-nhfb,
43327 remark = "This is the author's thesis.",
43328 }
43329
43330 @TechReport{Maydan:1992:AAA,
43331 author = "Dror Eliezer Maydan",
43332 title = "Accurate Analysis of Array References",
43333 type = "Technical Report",
43334 number = "STAN-CS-92-1449 (CSL-TR-92-547, AD-A268069)",
43335 institution = inst-STAN-CS,
43336 address = inst-STAN-CS:adr,
43337 pages = "viii + 134",
43338 month = sep,
43339 year = "1992",
43340 bibdate = "Wed Nov 26 12:13:45 MST 2025",
43341 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
43342 URL = "https://apps.dtic.mil/sti/pdfs/ADA268069.pdf",
43343 abstract = "Modern computer systems are increasingly relying on
43344 parallelism to improve performance. Automatic
43345 parallelization techniques offer the hope that users
43346 can simply and portably exploit parallelism. This
43347 thesis addresses the problem of data dependence
43348 analysis, the base step in detecting loop level
43349 parallelism in scientific programs. Exploiting
43350 parallelism can change the order of memory operations.
43351 Data dependence analysis involves analyzing the dynamic
43352 memory reference behavior of array operations so that
43353 compilers will only parallelize loops in the cases
43354 where any resultant reordering of memory references
43355 does not change the sequential semantics of the
43356 program.\par
43357
43358 In general, data dependence analysis is undecidable,
43359 and compilers must conservatively approximate array
43360 reference behavior, thus sequentializing parallel
43361 loops. Traditional data dependence analysis research
43362 has concentrated on the simpler problem of affine
43363 memory disambiguation. Many algorithms have been
43364 developed that conservatively approximate even this
43365 simpler problem. By using a series of algorithms, each
43366 one guaranteed to be exact for a certain class of
43367 input, we are able to devise a new method that in
43368 practice solves exactly and efficiently the affine
43369 memory disambiguation problem. Because our affine
43370 memory disambiguator is exact in practice, we can
43371 devise an experiment to test the effectiveness of
43372 affine memory disambiguation at approximating the full
43373 data dependence problem. We discover that the lack of
43374 data-flow information on array elements is the key
43375 limitation of affine memory disambiguators. We develop
43376 a new representation and algorithm to efficiently
43377 calculate these data-flow dependences. Finally, we
43378 address the problem of interprocedural data dependence
43379 analysis. By using an array summary representation that
43380 is guaranteed to be exact when applicable, we can
43381 combine summary information with inlining to exactly
43382 and efficiently analyze affine array references across
43383 procedure boundaries. Taken together, our algorithms
43384 generate the more accurate information that will be
43385 needed to exploit parallelism in the future.",
43386 acknowledgement = ack-nhfb,
43387 advisor = "John Hennessy",
43388 pdfpages = "144",
43389 remark = "This is the author's thesis. No PDF in NTRL archive.
43390 Found in DTIC archive.",
43391 }
43392
43393 @TechReport{Waarts:1992:NAP,
43394 author = "Orli Waarts",
43395 title = "New Algorithms and Primitives for Multi Processor
43396 Coordination",
43397 type = "Technical Report",
43398 number = "STAN-CS-92-1450",
43399 institution = inst-STAN-CS,
43400 address = inst-STAN-CS:adr,
43401 pages = "165",
43402 month = aug,
43403 year = "1992",
43404 bibdate = "Wed Nov 26 12:13:45 MST 2025",
43405 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
43406 URL = "",
43407 acknowledgement = ack-nhfb,
43408 remark = "This is the author's thesis.",
43409 }
43410
43411 @TechReport{Radzik:1992:ASL,
43412 author = "Tomasz Radzik",
43413 title = "Algorithms for Some Linear and Fractional
43414 Combinatorial Optimization Problems",
43415 type = "Technical Report",
43416 number = "STAN-CS-92-1451",
43417 institution = inst-STAN-CS,
43418 address = inst-STAN-CS:adr,
43419 pages = "100",
43420 month = aug,
43421 year = "1992",
43422 bibdate = "Wed Nov 26 12:13:45 MST 2025",
43423 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
43424 URL = "",
43425 acknowledgement = ack-nhfb,
43426 remark = "This is the author's thesis.",
43427 }
43428
43429 @TechReport{Kao:1992:DAD,
43430 author = "Ben Kao and Hector Garcia-Molina",
43431 title = "Deadline assignment in a distributed soft real-time
43432 system",
43433 type = "Technical Report",
43434 number = "STAN-CS-92-1452",
43435 institution = inst-STAN-CS,
43436 address = inst-STAN-CS:adr,
43437 pages = "25",
43438 month = oct,
43439 year = "1992",
43440 bibdate = "Thu Nov 20 12:13:32 MST 2025",
43441 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
43442 URL = "http://www-db.stanford.edu/TR/CS-TR-92-1452.html",
43443 abstract = "In a distributed environment, tasks often have
43444 processing demands on multiple different sites. A
43445 distributed task is usually divided up into several
43446 subtasks, each one to be executed at some site in
43447 order. In a real-time system, an overall deadline is
43448 usually specified by an application designer indicating
43449 when a distributed task is to be finished. However, the
43450 problem of how a global deadline is automatically
43451 translated to the deadline of each individual subtask
43452 has not been well studied. This paper examines (through
43453 simulations) four strategies for subtask deadline
43454 assignment in a distributed soft real-time
43455 environment.",
43456 acknowledgement = ack-nhfb,
43457 xxnumber = "CS-TR-92-1452",
43458 }
43459
43460 @TechReport{Kao:1992:RTC,
43461 author = "Ben Kao and Hector Garcia-Molina",
43462 title = "Real-Time Communication Over Multiple Standard
43463 Networks",
43464 type = "Technical Report",
43465 number = "STAN-CS-92-1453",
43466 institution = inst-STAN-CS,
43467 address = inst-STAN-CS:adr,
43468 pages = "23",
43469 month = nov,
43470 year = "1992",
43471 bibdate = "Wed Nov 26 12:13:45 MST 2025",
43472 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
43473 URL = "",
43474 acknowledgement = ack-nhfb,
43475 }
43476
43477 @TechReport{Yan:1992:ISS,
43478 author = "Tak W. Yan and Hector Garcia-Molina",
43479 title = "Index Structures for Selective Dissemination of
43480 Information",
43481 type = "Technical Report",
43482 number = "STAN-CS-92-1454",
43483 institution = inst-STAN-CS,
43484 address = inst-STAN-CS:adr,
43485 pages = "48",
43486 month = dec,
43487 year = "1992",
43488 bibdate = "Wed Nov 26 12:13:45 MST 2025",
43489 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
43490 URL = "",
43491 acknowledgement = ack-nhfb,
43492 }
43493
43494 @TechReport{Howard:1992:FPE,
43495 author = "Brian Howard",
43496 title = "Fixed Points and Extensionality in Typed Functional
43497 Programming Languages",
43498 type = "Technical Report",
43499 number = "STAN-CS-92-1455",
43500 institution = inst-STAN-CS,
43501 address = inst-STAN-CS:adr,
43502 pages = "66",
43503 month = "????",
43504 year = "1992",
43505 bibdate = "Wed Nov 26 12:13:45 MST 2025",
43506 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
43507 URL = "",
43508 acknowledgement = ack-nhfb,
43509 remark = "This is the author's thesis.",
43510 }
43511
43512 @TechReport{Tomasic:1992:CDS,
43513 author = "Anthony Tomasic and Hector Garcia-Molina",
43514 title = "Caching and Database Scaling in Distributed
43515 Shared-Nothing Information Retrieval Systems",
43516 type = "Technical Report",
43517 number = "STAN-CS-92-1456",
43518 institution = inst-STAN-CS,
43519 address = inst-STAN-CS:adr,
43520 pages = "21",
43521 month = dec,
43522 year = "1992",
43523 bibdate = "Wed Nov 26 12:13:45 MST 2025",
43524 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
43525 URL = "",
43526 acknowledgement = ack-nhfb,
43527 }
43528
43529 @TechReport{Khatib:1992:IPR,
43530 author = "Oussama Khatib",
43531 title = "Inertial Properties in Robotics Manipulation",
43532 type = "Technical Report",
43533 number = "STAN-CS-92-1457",
43534 institution = inst-STAN-CS,
43535 address = inst-STAN-CS:adr,
43536 pages = "34",
43537 month = dec,
43538 year = "1992",
43539 bibdate = "Wed Nov 26 12:13:45 MST 2025",
43540 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
43541 URL = "",
43542 acknowledgement = ack-nhfb,
43543 }
43544
43545 @TechReport{Wilson:1992:CPA,
43546 author = "Randall Wilson and Jean-Claude Latombe and Tomas
43547 Lozano-Perez",
43548 title = "On the Complexity of Partitioning an Assembly",
43549 type = "Technical Report",
43550 number = "STAN-CS-92-1458",
43551 institution = inst-STAN-CS,
43552 address = inst-STAN-CS:adr,
43553 pages = "14",
43554 month = dec,
43555 year = "1992",
43556 bibdate = "Wed Nov 26 12:13:45 MST 2025",
43557 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
43558 URL = "",
43559 acknowledgement = ack-nhfb,
43560 }
43561
43562 @TechReport{Rothberg:1992:EMH,
43563 author = "Edward Rothberg",
43564 title = "Exploiting the Memory Hierarchy in Sequential and
43565 Parallel Sparse {Cholesky} Factorization",
43566 type = "Technical Report",
43567 number = "STAN-CS-92-1459 (AD-A262849CSL-TR-92-555)",
43568 institution = inst-STAN-CS,
43569 address = inst-STAN-CS:adr,
43570 pages = "xii + 154",
43571 month = nov,
43572 year = "1992",
43573 bibdate = "Wed Nov 26 12:13:45 MST 2025",
43574 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
43575 URL = "https://apps.dtic.mil/sti/tr/pdf/ADA262849.pdf",
43576 abstract = "Cholesky factorization of large sparse positive
43577 definite matrices is an extremely important
43578 computation, arising in a wide range of domains
43579 including linear programming, finite element analysis,
43580 and circuit simulation. This thesis focuses on crucial
43581 issues for obtaining high performance for this
43582 computation on sequential and parallel machines with
43583 hierarchical memory systems. Hierarchical memory
43584 machines offer the potential to perform this
43585 computation both quickly and cost-effectively. By
43586 structuring memory in the form of a hierarchy, with a
43587 small, high-speed cache near the processor and larger
43588 but slower levels further away, these machines allow
43589 appropriately-structured computations to behave as if
43590 all their data were stored in very fast memory. The
43591 thesis investigates how well sequential and parallel
43592 Cholesky factorization algorithms can make use of a
43593 hierarchical memory organization.\par
43594
43595 The thesis begins by providing the first thorough
43596 analysis of the interaction between sequential sparse
43597 Cholesky factorization methods and memory hierarchies.
43598 We look at popular existing methods and find that they
43599 produce relatively poor memory hierarchy performance.
43600 The methods are extended, using blocking techniques, to
43601 reuse data in the fast levels of the memory hierarchy.
43602 This increased reuse is shown to provide roughly a
43603 factor of three increase in performance on modem
43604 workstation-class machines. The primary contribution of
43605 this work is its investigation and quantification of
43606 the specific factors that affect sparse Cholesky
43607 performance on hierarchical memory machines. This work
43608 also presents and compares a disparate set of
43609 factorization methods within a consistent framework,
43610 thus isolating and identifying the important
43611 similarities and differences between the methods and
43612 unifying a large body of previously uncomparable
43613 work.\par
43614
43615 The thesis then studies the use of blocking techniques
43616 for parallel sparse Cholesky factorization. The
43617 sequential methods are quite easily extended to
43618 small-scale multiprocessors (2--16 processors),
43619 producing parallel methods that make excellent use of
43620 memory hierarchies. Data reuse is achieved by working
43621 with sets of contiguous columns, or panels. However,
43622 important scalability questions arise concerning the
43623 use of panel-oriented methods on larger parallel
43624 machines. At issue is whether panels can be made large
43625 enough to provide significant data reuse while at the
43626 same time providing enough concurrency to allow a large
43627 number of processors to be used effectively. The thesis
43628 uses a parallel performance model to understand the
43629 performance of these methods and to show that such
43630 methods are in fact inappropriate for larger
43631 hierarchical memory multiprocessors.\par
43632
43633 The thesis then proposes an alternative parallel
43634 factorization approach that manipulates rectangular
43635 sub-blocks of the matrix. This block-oriented approach
43636 is found to overcome the scalability limitations of the
43637 panel-oriented methods. However, several issues
43638 complicate its implementation. Primary among these are
43639 issues of choosing blocks in a sparse matrix that can
43640 be manipulated efficiently and structuring a parallel
43641 computation in terms of these blocks. The thesis
43642 presents solutions to these problems and investigates
43643 the parallel performance of the resulting methods. The
43644 contributions of this work come both from its
43645 theoretical foundation for understanding the factors
43646 that limit the scalability of panel- and block-oriented
43647 methods on hierarchical memory multiprocessors, and
43648 from its investigation of practical issues related to
43649 the implementation of efficient parallel factorization
43650 methods.",
43651 acknowledgement = ack-nhfb,
43652 advisor = "Anoop Gupta",
43653 keywords = "parallel; processing; sparse Cholesky factorization;
43654 sparse matrices. Hierarchical-memory machines",
43655 pdfpages = "168",
43656 remark = "This is the author's thesis.",
43657 }
43658
43659 @TechReport{Derr:1992:AOD,
43660 author = "Marcia A. Derr",
43661 title = "Adaptive Optimization in a Database Programming
43662 Language",
43663 type = "Technical Report",
43664 number = "STAN-CS-92-1460",
43665 institution = inst-STAN-CS,
43666 address = inst-STAN-CS:adr,
43667 pages = "143",
43668 month = dec,
43669 year = "1992",
43670 bibdate = "Wed Nov 26 12:13:45 MST 2025",
43671 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
43672 URL = "",
43673 acknowledgement = ack-nhfb,
43674 remark = "This is the author's thesis.",
43675 }
43676
43677 @TechReport{Breitbart:1992:OMT,
43678 author = "Yuri Breitbart and Hector Garcia-Molina and Avi
43679 Silberschatz",
43680 title = "Overview of Multidatabase Transaction Management",
43681 type = "Technical Report",
43682 number = "STAN-CS-92-1432",
43683 institution = inst-STAN-CS,
43684 address = inst-STAN-CS:adr,
43685 pages = "38",
43686 month = may,
43687 year = "1992",
43688 DOI = "https://doi.org/10.1145/1925805.1925811",
43689 bibdate = "Thu Nov 20 12:13:32 MST 2025",
43690 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
43691 URL = "http://i.stanford.edu/pub/cstr/reports/cs/tr/92/1432/CS-TR-92-1432.pdf;
43692 http://www-db.stanford.edu/TR/CS-TR-92-1432.html",
43693 abstract = "A multidatabase system (MDBS) is a facility that
43694 allows users access to data located in multiple
43695 autonomous database management systems (DBMSs). In such
43696 a system, global transactions are executed under the
43697 control of the MDBS. Independently, local transactions
43698 are executed under the control of the local DBMSs. Each
43699 local DBMS integrated by the MDBS may employ a
43700 different transaction management scheme. In addition,
43701 each local DBMS has complete control over all
43702 transactions (global and local) executing at its site,
43703 including the ability to abort at any point any of the
43704 transactions executing at its site. Typically, no
43705 design or internal DBMS structure changes are allowed
43706 in order to accommodate the MDBS. Furthermore, the
43707 local DBMSs may not be aware of each other, and, as a
43708 consequence, cannot coordinate their actions. Thus,
43709 traditional techniques for ensuring transaction
43710 atomicity and consistency in homogeneous distributed
43711 database systems may not be appropriate for an MDBS
43712 environment. The objective of this paper is to provide
43713 a brief review of the most current work in the area of
43714 multidatabase transaction management. We first define
43715 the problem and argue that the multidatabase research
43716 will become increasingly important in the coming years.
43717 We then outline basic research issues in multidatabase
43718 transaction management and review recent results in the
43719 area. We conclude the paper with a discussion of open
43720 problems and practical implications of this research.",
43721 acknowledgement = ack-nhfb,
43722 remark = "Published at recorded DOI in CASCON'10 conference
43723 proceedings, pp. 93--126; no PDF file available at
43724 Stanford link. Stanford bibliographies record this as
43725 May 1992 and October 1993.",
43726 xxnumber = "CS-TR-92-1432",
43727 }
43728
43729 @TechReport{Manna:1993:MR,
43730 author = "Zohar Manna and Amir Pnueli",
43731 title = "Models for Reactivity",
43732 type = "Technical Report",
43733 number = "STAN-CS-93-1461",
43734 institution = inst-STAN-CS,
43735 address = inst-STAN-CS:adr,
43736 pages = "73",
43737 month = jan,
43738 year = "1993",
43739 bibdate = "Wed Nov 26 12:13:45 MST 2025",
43740 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
43741 URL = "",
43742 acknowledgement = ack-nhfb,
43743 }
43744
43745 @TechReport{Gunawardena:1993:PBT,
43746 author = "Jeremy Gunawardena",
43747 title = "Periodic Behaviour in Timed Systems With {{\{And\slash
43748 OR\}}} Causality. {Part I}: Systems of Dimension 1 and
43749 2",
43750 type = "Technical Report",
43751 number = "STAN-CS-93-1462",
43752 institution = inst-STAN-CS,
43753 address = inst-STAN-CS:adr,
43754 pages = "25",
43755 month = feb,
43756 year = "1993",
43757 bibdate = "Wed Nov 26 12:13:45 MST 2025",
43758 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
43759 URL = "",
43760 acknowledgement = ack-nhfb,
43761 }
43762
43763 @TechReport{Manna:1993:TPM,
43764 author = "Zohar Manna and Amir Pnueli",
43765 title = "A Temporal {PROOF} Methodology for Reactive Systems",
43766 type = "Technical Report",
43767 number = "STAN-CS-93-1463",
43768 institution = inst-STAN-CS,
43769 address = inst-STAN-CS:adr,
43770 pages = "37",
43771 month = feb,
43772 year = "1993",
43773 bibdate = "Wed Nov 26 12:13:45 MST 2025",
43774 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
43775 URL = "",
43776 acknowledgement = ack-nhfb,
43777 }
43778
43779 @TechReport{Kharitonov:1993:CHM,
43780 author = "Michael Kharitonov",
43781 title = "Cryptographic Hardness of Machine Learning",
43782 type = "Technical Report",
43783 number = "STAN-CS-93-1464",
43784 institution = inst-STAN-CS,
43785 address = inst-STAN-CS:adr,
43786 pages = "131",
43787 month = may,
43788 year = "1993",
43789 DOI = "https://doi.org/10.5555/164350",
43790 bibdate = "Wed Nov 26 12:13:45 MST 2025",
43791 bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography.bib;
43792 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
43793 URL = "https://books.google.com/books?id=QvREAQAAIAAJ;
43794 https://dl.acm.org/doi/book/10.5555/164350",
43795 abstract = "This thesis investigates the use of cryptographic
43796 assumptions to obtain strong lower bounds on the
43797 ability of Probably Approximately Correct (PAC)
43798 algorithms to learn various concept classes over the
43799 Boolean domain. We show that under realistic
43800 cryptographic assumptions there is no polynomial time
43801 prediction algorithm with membership queries for
43802 Boolean formulas, constant depth threshold circuits,
43803 and many other natural concept classes. Also, we show
43804 that if there exist non-uniform one-way functions, then
43805 membership queries won't help with predicting CNF or
43806 DNF formulas.\par
43807
43808 We investigate cryptographic lower bounds on the
43809 learnability of Boolean formulas, Boolean circuits, and
43810 constant depth threshold circuits on the uniform
43811 distribution and other specific distributions. We first
43812 show that weakly learning these classes on the uniform
43813 distribution is as hard as factoring Blum integers. We
43814 formalize the notion of a trivially learnable
43815 distribution and extend these hardness results to all
43816 non-trivial distributions. Furthermore, we show that a
43817 sub-exponential lower bound for factoring implies a
43818 lower bound for learning constant depth Boolean
43819 circuits on the uniform distribution which is almost
43820 tight.\par
43821
43822 We also show that a realistic assumption not rooted in
43823 number theory, namely the intractability of solving the
43824 subset sum problem of certain dimensions, can be used
43825 to show that Boolean circuits of low depth are not
43826 learnable on the uniform and other specific
43827 distributions. We observe that, under cryptographic
43828 assumptions, all our bounds can be used to establish
43829 tradeoffs between the running time and the number of
43830 samples necessary to learn.",
43831 acknowledgement = ack-nhfb,
43832 remark = "This is the author's thesis.",
43833 }
43834
43835 @TechReport{Gupta:1993:IPA,
43836 author = "Ashish Gupta and Inderpal Singh Mumick",
43837 title = "Improvement to the {PF} Algorithm",
43838 type = "Technical Report",
43839 number = "STAN-CS-93-1473",
43840 institution = inst-STAN-CS,
43841 address = inst-STAN-CS:adr,
43842 pages = "4",
43843 month = may,
43844 year = "1993",
43845 bibdate = "Wed Nov 26 12:13:45 MST 2025",
43846 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
43847 URL = "",
43848 acknowledgement = ack-nhfb,
43849 }
43850
43851 @TechReport{Gunawardena:1993:MMF,
43852 author = "Jeremy Gunawardena",
43853 title = "Min-Max Functions",
43854 type = "Technical Report",
43855 number = "STAN-CS-93-1474",
43856 institution = inst-STAN-CS,
43857 address = inst-STAN-CS:adr,
43858 pages = "25",
43859 month = jun,
43860 year = "1993",
43861 bibdate = "Wed Nov 26 12:13:45 MST 2025",
43862 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
43863 URL = "",
43864 acknowledgement = ack-nhfb,
43865 }
43866
43867 @TechReport{Pieper:1993:PCI,
43868 author = "Karen Pieper",
43869 title = "Parallelizing Compilers: Implementation and
43870 Effectiveness",
43871 type = "Technical Report",
43872 number = "STAN-CS-93-1475",
43873 institution = inst-STAN-CS,
43874 address = inst-STAN-CS:adr,
43875 pages = "151",
43876 month = jun,
43877 year = "1993",
43878 bibdate = "Wed Nov 26 12:13:45 MST 2025",
43879 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
43880 URL = "",
43881 acknowledgement = ack-nhfb,
43882 remark = "This is the author's thesis.",
43883 }
43884
43885 @TechReport{Goldberg:1993:TFE,
43886 author = "Andrew Goldberg and Alexander Karzanov",
43887 title = "Transitive Fork Environments and Minimum Cost Flows",
43888 type = "Technical Report",
43889 number = "STAN-CS-93-1476",
43890 institution = inst-STAN-CS,
43891 address = inst-STAN-CS:adr,
43892 pages = "44",
43893 month = jun,
43894 year = "1993",
43895 bibdate = "Wed Nov 26 12:13:45 MST 2025",
43896 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
43897 URL = "",
43898 acknowledgement = ack-nhfb,
43899 }
43900
43901 @TechReport{Choi:1993:CTR,
43902 author = "Wonyun Choi",
43903 title = "Contingency-Tolerant Robot Motion Planning and
43904 Control",
43905 type = "Technical Report",
43906 number = "STAN-CS-93-1477",
43907 institution = inst-STAN-CS,
43908 address = inst-STAN-CS:adr,
43909 pages = "130",
43910 month = jun,
43911 year = "1993",
43912 bibdate = "Wed Nov 26 12:13:45 MST 2025",
43913 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
43914 URL = "",
43915 acknowledgement = ack-nhfb,
43916 remark = "This is the author's thesis.",
43917 }
43918
43919 @TechReport{Wilson:1993:THA,
43920 author = "Randall Wilson and Lydia Kavraki and Tomas
43921 Lozano-Perez and Jean-Claude Latombe",
43922 title = "Two-Handed Assembly Sequencing",
43923 type = "Technical Report",
43924 number = "STAN-CS-93-1478",
43925 institution = inst-STAN-CS,
43926 address = inst-STAN-CS:adr,
43927 pages = "26",
43928 month = jun,
43929 year = "1993",
43930 bibdate = "Wed Nov 26 12:13:45 MST 2025",
43931 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
43932 URL = "",
43933 acknowledgement = ack-nhfb,
43934 }
43935
43936 @TechReport{Shekhar:1993:CUF,
43937 author = "Shashank Shekhar",
43938 title = "Control Uncertainty in Fine Motion Planning",
43939 type = "Technical Report",
43940 number = "STAN-CS-93-1479",
43941 institution = inst-STAN-CS,
43942 address = inst-STAN-CS:adr,
43943 pages = "110",
43944 month = jun,
43945 year = "1993",
43946 bibdate = "Wed Nov 26 12:13:45 MST 2025",
43947 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
43948 URL = "",
43949 acknowledgement = ack-nhfb,
43950 }
43951
43952 @TechReport{Cherkassky:1993:SPA,
43953 author = "Boris Cherkassky and Andrew Goldberg and Tomas
43954 Radzik",
43955 title = "Shortest Paths Algorithms: Theory and Experimental
43956 Evaluation",
43957 type = "Technical Report",
43958 number = "STAN-CS-93-1480",
43959 institution = inst-STAN-CS,
43960 address = inst-STAN-CS:adr,
43961 pages = "46",
43962 month = jul,
43963 year = "1993",
43964 bibdate = "Wed Nov 26 12:13:45 MST 2025",
43965 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
43966 URL = "",
43967 acknowledgement = ack-nhfb,
43968 }
43969
43970 @TechReport{Goldberg:1993:ECS,
43971 author = "Andrew V. Goldberg and Robert Kennedy",
43972 title = "Efficient Cost Scaling Algorithm for the Assignment
43973 Problem",
43974 type = "Technical Report",
43975 number = "STAN-CS-93-1481",
43976 institution = inst-STAN-CS,
43977 address = inst-STAN-CS:adr,
43978 pages = "24",
43979 month = jul,
43980 year = "1993",
43981 bibdate = "Wed Nov 26 12:13:45 MST 2025",
43982 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
43983 URL = "",
43984 acknowledgement = ack-nhfb,
43985 }
43986
43987 @TechReport{Levy:1993:IRK,
43988 author = "Alon Levy",
43989 title = "Irrelevance Reasoning in Knowledge Based Systems",
43990 type = "Technical Report",
43991 number = "STAN-CS-93-1482",
43992 institution = inst-STAN-CS,
43993 address = inst-STAN-CS:adr,
43994 pages = "201",
43995 month = jul,
43996 year = "1993",
43997 bibdate = "Wed Nov 26 12:13:45 MST 2025",
43998 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
43999 URL = "",
44000 acknowledgement = ack-nhfb,
44001 remark = "This is the author's thesis.",
44002 }
44003
44004 @TechReport{Avrahami:1993:IAC,
44005 author = "Gideon Avrahami",
44006 title = "Identification and Analysis of Curves in Digital
44007 Images",
44008 type = "Technical Report",
44009 number = "STAN-CS-93-1483",
44010 institution = inst-STAN-CS,
44011 address = inst-STAN-CS:adr,
44012 pages = "??",
44013 month = "????",
44014 year = "1993",
44015 bibdate = "Wed Nov 26 12:13:45 MST 2025",
44016 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
44017 URL = "",
44018 acknowledgement = ack-nhfb,
44019 remark = "This is the author's thesis.",
44020 }
44021
44022 @TechReport{Phillips:1993:TAO,
44023 author = "Steven J. Phillips",
44024 title = "Theory and Applications of Online Algorithms",
44025 type = "Technical Report",
44026 number = "STAN-CS-93-1484",
44027 institution = inst-STAN-CS,
44028 address = inst-STAN-CS:adr,
44029 pages = "93",
44030 month = aug,
44031 year = "1993",
44032 bibdate = "Wed Nov 26 12:13:45 MST 2025",
44033 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
44034 URL = "",
44035 acknowledgement = ack-nhfb,
44036 remark = "This is the author's thesis.",
44037 }
44038
44039 @TechReport{Cheriton:1993:ULC,
44040 author = "David Cheriton and Dale Skeen",
44041 title = "Understanding the Limitations of Causally and Totally
44042 Ordered Communication",
44043 type = "Technical Report",
44044 number = "STAN-CS-93-1485",
44045 institution = inst-STAN-CS,
44046 address = inst-STAN-CS:adr,
44047 pages = "15",
44048 month = aug,
44049 year = "1993",
44050 bibdate = "Wed Nov 26 12:13:45 MST 2025",
44051 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
44052 URL = "",
44053 acknowledgement = ack-nhfb,
44054 }
44055
44056 @TechReport{vanGlabbeek:1993:WBT,
44057 author = "Robert van Glabbeek",
44058 title = "What is Branching Time Semantics and Why To Use It",
44059 type = "Technical Report",
44060 number = "STAN-CS-93-1486",
44061 institution = inst-STAN-CS,
44062 address = inst-STAN-CS:adr,
44063 pages = "8",
44064 month = aug,
44065 year = "1993",
44066 bibdate = "Wed Nov 26 12:13:45 MST 2025",
44067 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
44068 URL = "",
44069 acknowledgement = ack-nhfb,
44070 }
44071
44072 @TechReport{Thomas:1993:PAO,
44073 author = "Sarah Rebecca Thomas",
44074 title = "{PLACA}: An Agent Oriented Programming Language",
44075 type = "Technical Report",
44076 number = "STAN-CS-93-1487",
44077 institution = inst-STAN-CS,
44078 address = inst-STAN-CS:adr,
44079 pages = "157",
44080 month = sep,
44081 year = "1993",
44082 bibdate = "Wed Nov 26 12:13:45 MST 2025",
44083 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
44084 URL = "",
44085 acknowledgement = ack-nhfb,
44086 remark = "This is the author's thesis.",
44087 }
44088
44089 @TechReport{Takeda:1993:PMM,
44090 author = "Haruo Takeda and Cladio Facchinetti and Jean-Claude
44091 Latombe",
44092 title = "Planning the Motions of a Mobile Robot in a Sensory
44093 Uncertainty Field",
44094 type = "Technical Report",
44095 number = "STAN-CS-93-1488",
44096 institution = inst-STAN-CS,
44097 address = inst-STAN-CS:adr,
44098 pages = "42",
44099 month = sep,
44100 year = "1993",
44101 bibdate = "Wed Nov 26 12:13:45 MST 2025",
44102 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
44103 URL = "",
44104 acknowledgement = ack-nhfb,
44105 }
44106
44107 @TechReport{Goldberg:1993:PPS,
44108 author = "Andrew V. Goldberg and Alexander V. Karzanov",
44109 title = "Path Problems in Skew-Symmetric Graphs",
44110 type = "Technical Report",
44111 number = "STAN-CS-93-1489",
44112 institution = inst-STAN-CS,
44113 address = inst-STAN-CS:adr,
44114 pages = "i + 31",
44115 month = oct,
44116 year = "1993",
44117 DOI = "https://doi.org/10.1007/BF01261321",
44118 bibdate = "Wed Nov 26 12:13:45 MST 2025",
44119 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
44120 URL = "https://alexander-karzanov.net/Publications/93_path_probl_skew.pdf",
44121 abstract = "We study path problems in skew-symmetric graphs. These
44122 problems generalize the standard graph reachability and
44123 shortest paths problems. We develop duality theory for
44124 the skew-symmetric problems and use it to design
44125 efficient algorithms for the problems. The algorithms
44126 presented are competitive with the fastest algorithms
44127 for the standard problems.",
44128 acknowledgement = ack-nhfb,
44129 pdfpages = "32",
44130 remark = "Published in \booktitle{Combinatorica} {\bf 16}(3)
44131 353--382, September 1996.",
44132 }
44133
44134 @TechReport{Kavraki:1993:RPC,
44135 author = "Lydia Kavraki and Jean-Claude Latombe",
44136 title = "Randomized Preprocessing of Configuration",
44137 type = "Technical Report",
44138 number = "STAN-CS-93-1490",
44139 institution = inst-STAN-CS,
44140 address = inst-STAN-CS:adr,
44141 pages = "18",
44142 month = sep,
44143 year = "1993",
44144 bibdate = "Wed Nov 26 12:13:45 MST 2025",
44145 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
44146 URL = "",
44147 acknowledgement = ack-nhfb,
44148 }
44149
44150 @TechReport{Kao:1993:SDA,
44151 author = "Ben Kao and Hector Garcia-Molina",
44152 title = "Subtask Deadline Assignment for Complex Distributed
44153 Soft Real-Time Tasks",
44154 type = "Technical Report",
44155 number = "STAN-CS-93-1491",
44156 institution = inst-STAN-CS,
44157 address = inst-STAN-CS:adr,
44158 pages = "25",
44159 month = oct,
44160 year = "1993",
44161 bibdate = "Thu Nov 20 12:13:32 MST 2025",
44162 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
44163 URL = "http://www-db.stanford.edu/TR/CS-TR-93-1491.html",
44164 abstract = "Complex distributed tasks often involve parallel
44165 execution of subtasks at different nodes. To meet the
44166 deadline of a global task, all of its parallel subtasks
44167 have to be finished on time. Comparing to a local task
44168 (which involves execution at only one node), a global
44169 task may have a much harder time making its deadline
44170 because it is fairly likely that at least one of its
44171 subtasks run into an overloaded node. Another problem
44172 with complex distributed tasks occurs when a global
44173 task consists of a number of serially executing
44174 subtasks. In this case, we have the problem of dividing
44175 up the end-to-end deadline of the global task and
44176 assigning them to the intermediate subtasks. In this
44177 paper, we study both of these problems. Different
44178 algorithms for assigning deadlines to subtasks are
44179 presented and evaluated.",
44180 acknowledgement = ack-nhfb,
44181 pdfpages = "25",
44182 xxnumber = "CS-TR-93-1491",
44183 }
44184
44185 @TechReport{Jakobsson:1993:TBT,
44186 author = "Hakan Jakobsson",
44187 title = "Tree-Based Techniques for Query Evaluation",
44188 type = "Technical Report",
44189 number = "STAN-CS-93-1492",
44190 institution = inst-STAN-CS,
44191 address = inst-STAN-CS:adr,
44192 pages = "59",
44193 month = oct,
44194 year = "1993",
44195 bibdate = "Wed Nov 26 12:13:45 MST 2025",
44196 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
44197 URL = "",
44198 acknowledgement = ack-nhfb,
44199 remark = "This is the author's thesis.",
44200 }
44201
44202 @TechReport{Davis:1993:MSA,
44203 author = "Helen Davis",
44204 title = "Multiprocessor Simulation: Achieving Accuracy,
44205 Efficiency and Flexibility",
44206 type = "Technical Report",
44207 number = "STAN-CS-93-1493",
44208 institution = inst-STAN-CS,
44209 address = inst-STAN-CS:adr,
44210 pages = "175",
44211 month = nov,
44212 year = "1993",
44213 bibdate = "Wed Nov 26 12:13:45 MST 2025",
44214 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
44215 URL = "",
44216 acknowledgement = ack-nhfb,
44217 }
44218
44219 @TechReport{Yan:1993:ISI,
44220 author = "Tak W. Yan and Hector Garcia-Molina",
44221 title = "Index Structures for Information Filtering Under the
44222 Vector Space Model",
44223 type = "Technical Report",
44224 number = "STAN-CS-93-1494",
44225 institution = inst-STAN-CS,
44226 address = inst-STAN-CS:adr,
44227 pages = "i + 33",
44228 month = nov,
44229 year = "1993",
44230 bibdate = "Thu Nov 20 12:13:32 MST 2025",
44231 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
44232 URL = "http://www-db.stanford.edu/TR/CS-TR-93-1494.html",
44233 abstract = "With the ever increasing volumes of information
44234 generation, users of information systems are facing an
44235 information overload. It is desirable to support
44236 information filtering as a complement to traditional
44237 retrieval mechanism. The number of users, and thus
44238 profiles (representing users' long-term interests),
44239 handled by an information filtering system is
44240 potentially huge, and the system has to process a
44241 constant stream of incoming information in a timely
44242 fashion. The efficiency of the filtering process is
44243 thus an important issue. In this paper, we study what
44244 data structures and algorithms can be used to
44245 efficiently perform large-scale information filtering
44246 under the vector space model, a retrieval model
44247 established as being effective. We apply the idea of
44248 the standard inverted index to index user profiles. We
44249 devise an alternative to the standard inverted index,
44250 in which we, instead of indexing every term in a
44251 profile, select only the significant ones to index. We
44252 evaluate their performance and show that the indexing
44253 methods require orders of magnitude fewer I/Os to
44254 process a document than when no index is used. We also
44255 show that the proposed alternative performs better in
44256 terms of I/O and CPU processing time in many cases.",
44257 acknowledgement = ack-nhfb,
44258 pdfpages = "34",
44259 xxnumber = "CS-TR-93-1494",
44260 }
44261
44262 @TechReport{Baralis:1993:UDR,
44263 author = "Elena Baralis and Jennifer Widom",
44264 title = "Using Delta Relations to Optimize Condition Evaluation
44265 In Active Databases",
44266 type = "Technical Report",
44267 number = "STAN-CS-93-1495",
44268 institution = inst-STAN-CS,
44269 address = inst-STAN-CS:adr,
44270 pages = "25",
44271 month = nov,
44272 year = "1993",
44273 bibdate = "Wed Nov 26 12:13:45 MST 2025",
44274 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
44275 URL = "",
44276 acknowledgement = ack-nhfb,
44277 }
44278
44279 @TechReport{Hayes-Roth:1993:AAI,
44280 author = "Barbara Hayes-Roth",
44281 title = "An Architecture for Adaptive Intelligent Systems",
44282 type = "Technical Report",
44283 number = "STAN-CS-93-1496",
44284 institution = inst-STAN-CS,
44285 address = inst-STAN-CS:adr,
44286 pages = "51",
44287 month = dec,
44288 year = "1993",
44289 bibdate = "Wed Nov 26 12:13:45 MST 2025",
44290 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
44291 URL = "",
44292 acknowledgement = ack-nhfb,
44293 }
44294
44295 @TechReport{Kutter:1993:OMB,
44296 author = "Robert A. Kutter",
44297 title = "Optimizing Memory-Based Messaging for Scalable
44298 Shared-Memory Multiprocessor",
44299 type = "Technical Report",
44300 number = "STAN-CS-93-1497",
44301 institution = inst-STAN-CS,
44302 address = inst-STAN-CS:adr,
44303 pages = "82",
44304 month = dec,
44305 year = "1993",
44306 bibdate = "Wed Nov 26 12:13:45 MST 2025",
44307 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
44308 URL = "",
44309 acknowledgement = ack-nhfb,
44310 remark = "This is the author's thesis.",
44311 }
44312
44313 @TechReport{Ash:1993:DUA,
44314 author = "David Ash",
44315 title = "Diagnosis Using Action-Based Hierarchies for Optimal
44316 Real-Time Performance",
44317 type = "Technical Report",
44318 number = "STAN-CS-93-1498",
44319 institution = inst-STAN-CS,
44320 address = inst-STAN-CS:adr,
44321 pages = "150",
44322 month = dec,
44323 year = "1993",
44324 bibdate = "Wed Nov 26 12:13:45 MST 2025",
44325 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
44326 URL = "",
44327 acknowledgement = ack-nhfb,
44328 remark = "This is the author's thesis.",
44329 }
44330
44331 @TechReport{Knuth:1993:ST,
44332 author = "Donald E. Knuth",
44333 title = "The {Sandwich Theorem}",
44334 type = "Technical Report",
44335 number = "STAN-CS-93-1499",
44336 institution = inst-STAN-CS,
44337 address = inst-STAN-CS:adr,
44338 pages = "ii + 49",
44339 day = "6",
44340 month = dec,
44341 year = "1993",
44342 bibdate = "Fri Apr 18 05:25:51 2003",
44343 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
44344 URL = "http://i.stanford.edu/pub/cstr/reports/cs/tr/93/1499/CS-TR-93-1499.pdf;
44345 http://www-db.stanford.edu/TR/CS-TR-93-1499.html;
44346 http://www.ncstrl.org:8900/ncstrl/servlet/search?formname=detail&id=oai%3Ancstrlh%3Astan%3ASTAN%2F%2FCS-TR-93-1499",
44347 abstract = "This report contains expository notes about a function
44348 $ \vartheta (G) $ that is popularly known as the
44349 Lov{\'a}sz number of a graph $G$. There are many ways
44350 to define $ \vartheta (G)$, and the surprising variety
44351 of different characterizations indicates in itself that
44352 $ \vartheta (G)$ should be interesting. But the most
44353 interesting property of $ \vartheta (G)$ is probably
44354 the fact that it can be computed efficiently, although
44355 it lies ``sandwiched'' between other classic graph
44356 numbers whose computation is NP-hard. I have tried to
44357 make these notes self-contained so that they might
44358 serve as an elementary introduction to the growing
44359 literature on Lov{\'a}sz's fascinating function.",
44360 acknowledgement = ack-nhfb,
44361 documentid = "oai:ncstrlh:stan:STAN//CS-TR-93-1499",
44362 pdfpages = "51",
44363 xxnumber = "CS-TR-93-1499",
44364 }
44365
44366 @TechReport{Chang:1993:CVR,
44367 author = "Edward Chang",
44368 title = "Compositional Verification of Reactive and Real-time
44369 Systems",
44370 type = "Technical Report",
44371 number = "STAN-CS-94-1522",
44372 institution = inst-STAN-CS,
44373 address = inst-STAN-CS:adr,
44374 pages = "??",
44375 month = dec,
44376 year = "1993",
44377 bibdate = "Thu Nov 20 12:13:32 MST 2025",
44378 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
44379 URL = "http://www-db.stanford.edu/TR/CS-TR-94-1522.html",
44380 abstract = "This thesis presents a compositional methodology for
44381 the verification of reactive and real-time systems. The
44382 correctness of a given system is established from the
44383 correctness of the system's components, each of which
44384 may be treated as a system itself and further reduced.
44385 When no further reduction is possible or desirable,
44386 global techniques for verification may be used to
44387 verify the bottom-level components. Transition modules
44388 are introduced as a suitable compositional model of
44389 computation. Various composition operations are defined
44390 on transition modules, including parallel composition,
44391 sequential composition, and iteration. A restricted
44392 assumption-guarantee style of specification is
44393 advocated, wherein the environment assumption is stated
44394 as a restriction on the environment's next-state
44395 relation. Compositional proof rules are provided in
44396 accordance with the safety-progress hierarchy of
44397 temporal properties. The compositional framework is
44398 then extended naturally to real-time transition modules
44399 and discrete-time metric temporal logic.",
44400 acknowledgement = ack-nhfb,
44401 xxnumber = "CS-TR-94-1522",
44402 }
44403
44404 @TechReport{Siroker:1994:PSS,
44405 author = "Marianne Siroker",
44406 title = "1993 Publications Summary for the {Stanford Database
44407 Group}",
44408 type = "Technical Report",
44409 number = "STAN-CS-94-1500",
44410 institution = inst-STAN-CS,
44411 address = inst-STAN-CS:adr,
44412 pages = "??",
44413 month = jan,
44414 year = "1994",
44415 bibdate = "Thu Nov 20 12:13:32 MST 2025",
44416 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
44417 URL = "http://www-db.stanford.edu/TR/CS-TR-94-1500.html",
44418 abstract = "This Technical Report contains the first page of
44419 papers written by members of the Stanford Database
44420 Group during 1993. Readers interested in the full
44421 papers can fetch electronic copies via FTP.",
44422 acknowledgement = ack-nhfb,
44423 xxnumber = "CS-TR-94-1500",
44424 }
44425
44426 @TechReport{delVal:1994:DPB,
44427 author = "Alvaro del Val and Yoav Shoham",
44428 title = "Deriving Properties of Belief Update from Theories of
44429 Action",
44430 type = "Technical Report",
44431 number = "STAN-CS-94-1501",
44432 institution = inst-STAN-CS,
44433 address = inst-STAN-CS:adr,
44434 pages = "??",
44435 month = feb,
44436 year = "1994",
44437 bibdate = "Thu Nov 20 12:13:32 MST 2025",
44438 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
44439 URL = "http://www-db.stanford.edu/TR/CS-TR-94-1501.html",
44440 abstract = "We present an approach to database update as a form of
44441 non monotonic temporal reasoning, the main idea of
44442 which is the (circumscriptive) minimization of changes
44443 with respect to a set of facts declared ``persistent by
44444 default.'' The focus of the paper is on the relation
44445 between this approach and the update semantics recently
44446 proposed by Katsuno and Mendelzon. Our contribution in
44447 this regard is twofold: --- We prove a representation
44448 theorem for KM semantics in terms of a restricted
44449 subfamily of the operators defined by our construction.
44450 --- We show how the KM semantics can be generalized by
44451 relaxing our construction in a number of ways, each
44452 justified in certain intuitive circumstances and each
44453 corresponding to one specific postulate. It follows
44454 that there are reasonable update operators outside the
44455 KM family. Our approach is not dependent for its
44456 plausibility on this connection with KM semantics.
44457 Rather, it provides a relatively rich and flexible
44458 framework in which the frame and ramification problems
44459 can be solved in a systematic way by reasoning about
44460 default persistence of facts.",
44461 acknowledgement = ack-nhfb,
44462 xxnumber = "CS-TR-94-1501",
44463 }
44464
44465 @TechReport{Magerman:1994:NLP,
44466 author = "David M. Magerman",
44467 title = "Natural Language Parsing as Statistical Pattern
44468 Recognition",
44469 type = "Technical Report",
44470 number = "STAN-CS-94-1502",
44471 institution = inst-STAN-CS,
44472 address = inst-STAN-CS:adr,
44473 pages = "161",
44474 month = feb,
44475 year = "1994",
44476 bibdate = "Thu Nov 20 12:13:32 MST 2025",
44477 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
44478 URL = "http://www-db.stanford.edu/TR/CS-TR-94-1502.html",
44479 abstract = "Traditional natural language parsers are based on
44480 rewrite rule systems developed in an arduous,
44481 time-consuming manner by grammarians. A majority of the
44482 grammarian's efforts are devoted to the disambiguation
44483 process, first hypothesizing rules which dictate
44484 constituent categories and relationships among words in
44485 ambiguous sentences, and then seeking exceptions and
44486 corrections to these rules. In this work, I propose an
44487 automatic method for acquiring a statistical parser
44488 from a set of parsed sentences which takes advantage of
44489 some initial linguistic input, but avoids the pitfalls
44490 of the iterative and seemingly endless grammar
44491 development process. Based on distributionally-derived
44492 and linguistically-based features of language, this
44493 parser acquires a set of statistical decision trees
44494 which assign a probability distribution on the space of
44495 parse trees given the input sentence. By basing the
44496 disambiguation criteria selection on entropy reduction
44497 rather than human intuition, this parser development
44498 method is able to consider more sentences than a human
44499 grammarian can when making individual disambiguation
44500 rules. In experiments, the decision tree parser
44501 significantly outperforms a grammarian's rule-based
44502 parser, achieving an accuracy rate of 78\% compared to
44503 the rule-based parser's 69\%.",
44504 acknowledgement = ack-nhfb,
44505 xxnumber = "CS-TR-94-1502",
44506 }
44507
44508 @TechReport{Dabija:1994:DWP,
44509 author = "Vlad G. Dabija",
44510 title = "Deciding whether to plan to react",
44511 type = "Technical Report",
44512 number = "STAN-CS-94-1503",
44513 institution = inst-STAN-CS,
44514 address = inst-STAN-CS:adr,
44515 pages = "??",
44516 month = feb,
44517 year = "1994",
44518 bibdate = "Thu Nov 20 12:13:32 MST 2025",
44519 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
44520 URL = "http://www-db.stanford.edu/TR/CS-TR-94-1503.html",
44521 abstract = "Intelligent agents that operate in real-world
44522 real-time environments have limited resources. An agent
44523 must take these limitations into account when deciding
44524 which of two control modes --- planning versus reaction
44525 --- should control its behavior in a given situation.
44526 The main goal of this thesis is to develop a framework
44527 that allows a resource-bounded agent to decide at
44528 planning time which control mode to adopt for
44529 anticipated possible run-time contingencies. Using our
44530 framework, the agent: (a) analyzes a complete
44531 (conditional) plan for achieving a particular goal; (b)
44532 decides which of the anticipated contingencies require
44533 and allow for preparation of reactive responses at
44534 planning time; and (c) enhances the plan with prepared
44535 reactions for critical contingencies, while maintaining
44536 the size of the plan, the planning and response times,
44537 and the use of all other critical resources of the
44538 agent within task-specific limits. For a given
44539 contingency, the decision to plan or react is based on
44540 the characteristics of the contingency, the associated
44541 reactive response, and the situation itself.
44542 Contingencies that may occur in the same situation
44543 compete for reactive response preparation because of
44544 the agent's limited resources. The thesis also proposes
44545 a knowledge representation formalism to facilitate the
44546 acquisition and maintenance of knowledge involved in
44547 this decision process. We also show how the proposed
44548 framework can be adapted for the problem of deciding,
44549 for a given contingency, whether to prepare a special
44550 branch in the conditional plan under development or to
44551 leave the contingency for opportunistic treatment at
44552 execution time. We make a theoretical analysis of the
44553 properties of our framework and then demonstrate them
44554 experimentally. We also show experimentally that this
44555 framework can simulate several different styles of
44556 human reactive behaviors described in the literature
44557 and, therefore, can be useful as a basis for describing
44558 and contrasting such behaviors. Finally we demonstrate
44559 that the framework can be applied in a challenging real
44560 domain. That is: (a) the knowledge and data needed for
44561 the decision making within our framework exist and can
44562 be acquired from experts, and (b) the behavior of an
44563 agent that uses our framework improves according to
44564 response time, reliability and resource utilization
44565 criteria.",
44566 acknowledgement = ack-nhfb,
44567 xxnumber = "CS-TR-94-1503",
44568 }
44569
44570 @TechReport{Baralis:1994:AAR,
44571 author = "Elena Baralis and Jennifer Widom",
44572 title = "An Algebraic Approach to Rule Analysis in Expert
44573 Database Systems",
44574 type = "Technical Report",
44575 number = "STAN-CS-94-1504",
44576 institution = inst-STAN-CS,
44577 address = inst-STAN-CS:adr,
44578 pages = "??",
44579 month = feb,
44580 year = "1994",
44581 bibdate = "Thu Nov 20 12:13:32 MST 2025",
44582 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
44583 URL = "http://www-db.stanford.edu/TR/CS-TR-94-1504.html",
44584 abstract = "Expert database systems extend the functionality of
44585 conventional database systems by providing a facility
44586 for creating and automatically executing
44587 Condition-Action rules. While Condition-Action rules in
44588 database systems are very powerful, they also can be
44589 very difficult to program, due to the unstructured and
44590 unpredictable nature of rule processing. We provide
44591 methods for static analysis of Condition-Action rules;
44592 our methods determine whether a given rule set is
44593 guaranteed to terminate, and whether rule execution is
44594 confluent (has a guaranteed unique final state). Our
44595 methods are based on previous methods for analyzing
44596 rules in active database systems. We improve
44597 considerably on the previous methods by providing
44598 analysis criteria that are much less conservative: our
44599 methods often determine that a rule set will terminate
44600 or is confluent when previous methods could not. Our
44601 improved analysis is based on a ``propagation''
44602 algorithm, which uses a formal approach based on an
44603 extended relational algebra to accurately determine
44604 when the action of one rule can affect the condition of
44605 another. Our algebraic approach yields methods that are
44606 applicable to a broad class of expert database rule
44607 languages.",
44608 acknowledgement = ack-nhfb,
44609 xxnumber = "CS-TR-94-1504",
44610 }
44611
44612 @TechReport{Singhal:1994:UPH,
44613 author = "Sandeep K. Singhal and David R. Cheriton",
44614 title = "Using a Position History-Based Protocol for
44615 Distributed Object Visualization",
44616 type = "Technical Report",
44617 number = "STAN-CS-94-1505",
44618 institution = inst-STAN-CS,
44619 address = inst-STAN-CS:adr,
44620 pages = "27",
44621 month = feb,
44622 year = "1994",
44623 bibdate = "Thu Nov 20 12:13:32 MST 2025",
44624 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
44625 URL = "http://www-db.stanford.edu/TR/CS-TR-94-1505.html",
44626 abstract = "Users of distributed virtual reality applications
44627 interact with users located across the network.
44628 Similarly, distributed object visualization systems
44629 store dynamic data at one host and render it in
44630 real-time at other hosts. Because data in both systems
44631 is animated and exhibits unpredictable behavior,
44632 providing up-to-date information about remote objects
44633 is expensive. Remote hosts must instead apply
44634 extrapolation between successive update packets to
44635 render the object's true animated behavior. This paper
44636 describes and analyzes a ``position history-based''
44637 protocol in which hosts apply several recent position
44638 updates to track the position of remote objects. The
44639 history-based approach offers smooth, accurate
44640 visualizations of remote objects while providing a
44641 scalable solution.",
44642 acknowledgement = ack-nhfb,
44643 xxnumber = "CS-TR-94-1505",
44644 }
44645
44646 @TechReport{Cheriton:1994:OMB,
44647 author = "David R. Cheriton and Robert A. Kutter",
44648 title = "Optimized Memory-Based Messaging: Leveraging the
44649 Memory System for High-Performance Communication",
44650 type = "Technical Report",
44651 number = "STAN-CS-94-1506",
44652 institution = inst-STAN-CS,
44653 address = inst-STAN-CS:adr,
44654 pages = "26",
44655 month = feb,
44656 year = "1994",
44657 bibdate = "Thu Nov 20 12:13:32 MST 2025",
44658 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
44659 URL = "http://www-db.stanford.edu/TR/CS-TR-94-1506.html",
44660 abstract = "Memory-based messaging, passing messages between
44661 programs using shared memory, is a recognized technique
44662 for efficient communication that takes advantage of
44663 memory system performance. However, the conventional
44664 operating system support for this approach is
44665 inefficient, especially for large-scale multiprocessor
44666 interconnects, and is too complex to effectively
44667 support in hardware. This paper describes hardware and
44668 software optimizations for memory-based messaging that
44669 efficiently exploit the mechanisms of the memory system
44670 to provide superior communication performance. We
44671 describe the overall model of optimized memory-based
44672 messaging, its implementation in an operating system
44673 kernel and hardware support for this approach in a
44674 scalable multiprocessor architecture. The optimizations
44675 include address-valued signals, message-oriented memory
44676 consistency and automatic signaling on write.
44677 Performance evaluations show these extensions provide a
44678 three-to-five-fold improvement in communication
44679 performance over a comparable software-only
44680 implementation.",
44681 acknowledgement = ack-nhfb,
44682 xxnumber = "CS-TR-94-1506",
44683 }
44684
44685 @TechReport{Mashack:1994:BDC,
44686 author = "Thea Mashack",
44687 title = "Bibliography {Department of Computer Science}
44688 Technical Reports, 1963--1993",
44689 type = "Technical Report",
44690 number = "STAN-CS-94-1507",
44691 institution = inst-STAN-CS,
44692 address = inst-STAN-CS:adr,
44693 pages = "??",
44694 month = mar,
44695 year = "1994",
44696 bibdate = "Thu Nov 20 12:13:32 MST 2025",
44697 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
44698 URL = "http://www-db.stanford.edu/TR/CS-TR-94-1507.html",
44699 abstract = "This report lists, in chronological order, all reports
44700 published by the Stanford Computer Science Department
44701 (CSD) since 1963. Each report is identified by CSD
44702 number, author's name, title, number of pages, and
44703 date. If a given report is available from the
44704 department at the time of this Bibliography's printing,
44705 price is also listed. For convenience, an author index
44706 is included in the back of the text. This report
44707 supersedes all previous editions. Some reports are
44708 noted with a National Technical Information Service
44709 (NTIS) retrieval number (i.e., AD-XXXXXX), if available
44710 from the NTIS. Other reports are noted with Knowledge
44711 Systems Laboratory (KSL) or Computer Systems Laboratory
44712 (CSL) numbers (KSL-XXXX; CSL-TR-XX-XX), and may be
44713 requested from KSL or CSL, respectively.",
44714 acknowledgement = ack-nhfb,
44715 xxabstract = "This Bibliography lists all the reports published by
44716 the Department of Computer Science from 1963 through
44717 1993",
44718 xxnumber = "CS-TR-94-1507",
44719 }
44720
44721 @TechReport{Kondo:1994:IKH,
44722 author = "Koichi Kondo",
44723 title = "Inverse Kinematics of a Human Arm",
44724 type = "Technical Report",
44725 number = "STAN-CS-94-1508",
44726 institution = inst-STAN-CS,
44727 address = inst-STAN-CS:adr,
44728 pages = "??",
44729 month = mar,
44730 year = "1994",
44731 bibdate = "Thu Nov 20 12:13:32 MST 2025",
44732 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
44733 URL = "http://www-db.stanford.edu/TR/CS-TR-94-1508.html",
44734 abstract = "This paper describes a new inverse kinematics
44735 algorithm for a human arm. Potential applications of
44736 this algorithm include computer-aided design and
44737 concurrent engineering from the viewpoint of human
44738 factors. For example, it may be used to evaluate a new
44739 design in terms of its usability and to automatically
44740 generate instruction videos. The inverse kinematics
44741 algorithm is based on a sensorimotor transformation
44742 model developed in recent neurophysiological
44743 experiments. This method can be applied to both static
44744 arm postures and human manipulation motions.",
44745 acknowledgement = ack-nhfb,
44746 xxnumber = "CS-TR-94-1508",
44747 }
44748
44749 @TechReport{Goldberg:1994:GPU,
44750 author = "Andrew V. Goldberg and Robert Kennedy",
44751 title = "Global Price Updates Help",
44752 type = "Technical Report",
44753 number = "STAN-CS-94-1509",
44754 institution = inst-STAN-CS,
44755 address = inst-STAN-CS:adr,
44756 pages = "20",
44757 month = mar,
44758 year = "1994",
44759 bibdate = "Thu Nov 20 12:13:32 MST 2025",
44760 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
44761 URL = "http://www-db.stanford.edu/TR/CS-TR-94-1509.html",
44762 abstract = "Periodic global updates of dual variables have been
44763 shown to yield a substantial speed advantage in
44764 implementations of push-relabel algorithms for the
44765 maximum flow and minimum cost flow problems. In this
44766 paper, we show that in the context of the bipartite
44767 matching and assignment problems, global updates yield
44768 a theoretical improvement as well. For bipartite
44769 matching, a push-relabel algorithm that matches the
44770 best bound when global updates are used achieves a
44771 bound that is worse by a square root of n factor
44772 without the updates. A similar result holds for the
44773 assignment problem.",
44774 acknowledgement = ack-nhfb,
44775 xxnumber = "CS-TR-94-1509",
44776 }
44777
44778 @TechReport{Hayes:1994:KOG,
44779 author = "Barry Hayes",
44780 title = "Key Objects in Garbage Collection",
44781 type = "Technical Report",
44782 number = "STAN-CS-94-1510",
44783 institution = inst-STAN-CS,
44784 address = inst-STAN-CS:adr,
44785 pages = "??",
44786 month = mar,
44787 year = "1994",
44788 bibdate = "Thu Nov 20 12:13:32 MST 2025",
44789 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
44790 URL = "http://www-db.stanford.edu/TR/CS-TR-94-1510.html",
44791 abstract = "When the cost of global garbage collection in a system
44792 grows large, the system can be redesigned to use
44793 generational collection. The newly-created objects
44794 usually have a much shorter half-life than average, and
44795 by concentrating the collector's efforts on them a
44796 large fraction of the garbage can be collected at a
44797 tiny fraction of the cost. The objects that survive
44798 generational collection may still become garbage, and
44799 the current practice is to perform occasional global
44800 garbage collections to purge these objects from the
44801 system, and again, the cost of doing these collections
44802 may become prohibitive when the volume of memory
44803 increases. Previous research has noted that the objects
44804 that survive generational collection often are born,
44805 promoted, and collected in large clusters. In this
44806 dissertation I show that carefully selected
44807 semantically or structurally important key objects can
44808 be drawn from the clusters and collected separately;
44809 when a key object becomes unreachable, the collector
44810 can take this as a hint to collect the cluster from
44811 which the key was drawn. To gauge the effectiveness of
44812 key objects, their use was simulated in ParcPlace's
44813 Objectworks\Smalltalk system. The objects selected as
44814 keys were those that, as young objects, had pointers to
44815 them stored into old objects. The collector attempts to
44816 create a cluster for each key by gathering together all
44817 of the objects reachable from that key and &gt;From no
44818 previous key. Using this simple heuristic for key
44819 objects, the collector finds between 41\% and 92\% of
44820 the clustered garbage in a suite of simple test
44821 programs. Except for one program in the suite, about
44822 95\% of the time these key objects direct the collector
44823 to a cluster that is garbage. The exception should be
44824 heeded in improving the heuristics. In a replay of an
44825 interactive session, key object collection finds 59\%
44826 of the clustered garbage and 66\% of suggested targets
44827 are indeed garbage.",
44828 acknowledgement = ack-nhfb,
44829 xxnumber = "CS-TR-94-1510",
44830 }
44831
44832 @TechReport{Shoham:1994:CLE,
44833 author = "Yoav Shoham and Moshe Tennenholtz",
44834 title = "Co-Learning and the Evolution of Social Activity",
44835 type = "Technical Report",
44836 number = "STAN-CS-94-1511",
44837 institution = inst-STAN-CS,
44838 address = inst-STAN-CS:adr,
44839 pages = "38",
44840 month = apr,
44841 year = "1994",
44842 bibdate = "Thu Nov 20 12:13:32 MST 2025",
44843 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
44844 URL = "http://www-db.stanford.edu/TR/CS-TR-94-1511.html",
44845 abstract = "We introduce the notion of co-learning, which refers
44846 to a process in which several agents simultaneously try
44847 to adapt to one another's behavior so as to produce
44848 desirable global system properties. Of particular
44849 interest are two specific co-learning settings, which
44850 relate to the emergence of conventions and the
44851 evolution of cooperation in societies, respectively. We
44852 define a basic co-learning rule, called Highest
44853 Cumulative Reward (HCR), and show that it gives rise to
44854 quite nontrivial system dynamics. In general, we are
44855 interested in the eventual convergence of the
44856 co-learning system to desirable states, as well as in
44857 the efficiency with which this convergence is attained.
44858 Our results on eventual convergence are analytic; the
44859 results on efficiency properties include analytic lower
44860 bounds as well as empirical upper bounds derived from
44861 rigorous computer simulations.",
44862 acknowledgement = ack-nhfb,
44863 xxnumber = "CS-TR-94-1511",
44864 }
44865
44866 @TechReport{Washington:1994:APR,
44867 author = "Richard Washington",
44868 title = "Abstraction Planning in Real Time",
44869 type = "Technical Report",
44870 number = "STAN-CS-94-1512",
44871 institution = inst-STAN-CS,
44872 address = inst-STAN-CS:adr,
44873 pages = "130",
44874 month = apr,
44875 year = "1994",
44876 bibdate = "Thu Nov 20 12:13:32 MST 2025",
44877 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
44878 URL = "http://www-db.stanford.edu/TR/CS-TR-94-1512.html",
44879 abstract = "When a planning agent works in a complex, real-world
44880 domain, it is unable to plan for and store all possible
44881 contingencies and problem situations ahead of time. The
44882 agent needs to be able to fall back on an ability to
44883 construct plans at run time under time constraints.
44884 This thesis presents a method for planning at run time
44885 that incrementally builds up plans at multiple levels
44886 of abstraction. The plans are continually updated by
44887 information from the world, allowing the planner to
44888 adjust its plan to a changing world during the planning
44889 process. All the information is represented over
44890 intervals of time, allowing the planner to reason about
44891 durations, deadlines, and delays within its plan. In
44892 addition to the method, the thesis presents a formal
44893 model of the planning process and uses the model to
44894 investigate planning strategies. The method has been
44895 implemented, and experiments have been run to validate
44896 the overall approach and the theoretical model.",
44897 acknowledgement = ack-nhfb,
44898 xxnumber = "CS-TR-94-1512",
44899 }
44900
44901 @TechReport{Egar:1994:CND,
44902 author = "John W. Egar",
44903 title = "Construction of Normative Decision Models Using
44904 Abstract Graph Grammars",
44905 type = "Technical Report",
44906 number = "STAN-CS-94-1513",
44907 institution = inst-STAN-CS,
44908 address = inst-STAN-CS:adr,
44909 pages = "247",
44910 month = may,
44911 year = "1994",
44912 bibdate = "Thu Nov 20 12:13:32 MST 2025",
44913 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
44914 URL = "http://www-db.stanford.edu/TR/CS-TR-94-1513.html",
44915 abstract = "This dissertation addresses automated assistance for
44916 decision analysis in medicine. In particular, I have
44917 investigated graph grammars as a representation for
44918 encoding how decision-theoretic models can be
44919 constructed from an unordered list of concerns. The
44920 modeling system that I have used requires a standard
44921 vocabulary to generate decision models; the models
44922 generated are qualitative, and require subsequent
44923 assessment of probabilities and utility values. This
44924 research has focused on the modeling of the qualitative
44925 structure of problems given a standard vocabulary and
44926 given that subsequent assessment of probabilities and
44927 utilities is possible. The usefulness of the
44928 graph-grammar representation depends on the
44929 graph-grammar formalism's ability to describe a broad
44930 spectrum of qualitative decision models, on its ability
44931 to maintain a high quality in the models it generates,
44932 and on its clarity in describing topological
44933 constraints to researchers who design and maintain the
44934 actual grammar. I have found that graph grammars can be
44935 used to generate automatically decision models that are
44936 comparable to those produced by decision analysts.",
44937 acknowledgement = ack-nhfb,
44938 xxnumber = "CS-TR-94-1513",
44939 }
44940
44941 @TechReport{Hailperin:1994:LBU,
44942 author = "Max Hailperin",
44943 title = "Load Balancing Using Time Series Analysis for Soft
44944 Real Time Systems with Statistically Periodic Loads",
44945 type = "Technical Report",
44946 number = "STAN-CS-94-1514",
44947 institution = inst-STAN-CS,
44948 address = inst-STAN-CS:adr,
44949 pages = "147",
44950 month = may,
44951 year = "1994",
44952 bibdate = "Thu Nov 20 12:13:32 MST 2025",
44953 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
44954 URL = "http://www-db.stanford.edu/TR/CS-TR-94-1514.html",
44955 abstract = "This thesis provides design and analysis of techniques
44956 for global load balancing on ensemble architectures
44957 running soft-real-time object-oriented applications
44958 with statistically periodic loads. It focuses on
44959 estimating the instantaneous average load over all the
44960 processing elements. The major contribution is the use
44961 of explicit stochastic process models for both the
44962 loading and the averaging itself. These models are
44963 exploited via statistical time-series analysis and
44964 Bayesian inference to provide improved average load
44965 estimates, and thus to facilitate global load
44966 balancing. This thesis explains the distributed
44967 algorithms used and provides some optimality results.
44968 It also describes the algorithms' implementation and
44969 gives performance results from simulation. These
44970 results show that our techniques allow more accurate
44971 estimation of the global system loading, resulting in
44972 fewer object migrations than local methods. Our method
44973 is shown to provide superior performance, relative not
44974 only to static load-balancing schemes but also to many
44975 adaptive load-balancing methods. Results from a
44976 preliminary analysis of another system and from
44977 simulation with a synthetic load provide some evidence
44978 of more general applicability.",
44979 acknowledgement = ack-nhfb,
44980 xxnumber = "CS-TR-94-1514",
44981 }
44982
44983 @TechReport{Wolverton:1994:RSD,
44984 author = "Michael Wolverton",
44985 title = "Retrieving Semantically Distant Analogies",
44986 type = "Technical Report",
44987 number = "STAN-CS-94-1515",
44988 institution = inst-STAN-CS,
44989 address = inst-STAN-CS:adr,
44990 pages = "??",
44991 month = jun,
44992 year = "1994",
44993 bibdate = "Thu Nov 20 12:13:32 MST 2025",
44994 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
44995 URL = "http://www-db.stanford.edu/TR/CS-TR-94-1515.html",
44996 abstract = "Techniques that have traditionally been useful for
44997 retrieving same-domain analogies from small single-use
44998 knowledge bases, such as spreading activation and
44999 indexing on selected features, are inadequate for
45000 retrieving cross-domain analogies from large multi-use
45001 knowledge bases. Blind or near-blind search techniques
45002 like spreading activation will be overwhelmed by
45003 combinatorial explosion as the search goes deeper into
45004 the KB. And indexing a large multi-use KB on salient
45005 features is impractical, largely because a feature that
45006 may be useful for retrieval in one task may be useless
45007 for another task. This thesis describes
45008 Knowledge-Directed Spreading Activation (KDSA), a
45009 method for retrieving analogies in a large semantic
45010 network. KDSA uses task-specific knowledge to guide a
45011 spreading activation search to a case or concept in
45012 memory that meets a desired similarity condition. The
45013 thesis also describes a specific instantiation of this
45014 method for the task of innovative design. KDSA has been
45015 validated in two ways. First, a theoretical model of
45016 knowledge base search demonstrates that KDSA is
45017 tractable for retrieving semantically distant analogies
45018 under a wide range of knowledge base configurations.
45019 Second, an implemented system that uses KDSA to find
45020 analogies for innovative design shows that the method
45021 is able to retrieve semantically distant analogies for
45022 a real task. Experiments with that system show trends
45023 as the knowledge base size grows that suggest the
45024 theoretical model's prediction of large knowledge base
45025 tractability is accurate.",
45026 acknowledgement = ack-nhfb,
45027 xxnumber = "CS-TR-94-1515",
45028 }
45029
45030 @TechReport{Goyal:1994:FRP,
45031 author = "Nita Goyal",
45032 title = "A Framework for Reasoning Precisely with Vague
45033 Concepts",
45034 type = "Technical Report",
45035 number = "STAN-CS-94-1516",
45036 institution = inst-STAN-CS,
45037 address = inst-STAN-CS:adr,
45038 pages = "??",
45039 month = may,
45040 year = "1994",
45041 bibdate = "Thu Nov 20 12:13:32 MST 2025",
45042 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
45043 URL = "http://www-db.stanford.edu/TR/CS-TR-94-1516.html",
45044 abstract = "Many knowledge-based systems need to represent vague
45045 concepts such as ``old'' and ``tall''. The practical
45046 approach of representing vague concepts as precise
45047 intervals over numbers (e.g., ``old'' as the interval
45048 [70,110]) is well-accepted in Artificial Intelligence.
45049 However, there have been no systematic procedures, but
45050 only ad hoc methods to delimit the boundaries of
45051 intervals representing the vague predicates. A key
45052 observation is that the vague concepts and their
45053 interval boundaries are constrained by the underlying
45054 domain knowledge. Therefore, any systematic approach to
45055 assigning interval boundaries must take the domain
45056 knowledge into account. Hence, in the dissertation, we
45057 present a framework to represent the domain knowledge
45058 and exploit it to reason about the interval boundaries
45059 via a query language. This framework is comprised of a
45060 constraint language to represent logical constraints on
45061 vague concepts, as well as numerical constraints on the
45062 interval boundaries; a query language to request
45063 information about the interval boundaries; and an
45064 algorithm to answer the queries. The algorithm
45065 preprocesses the constraints by extracting the
45066 numerical information from the logical constraints and
45067 combines them with the given numerical constraints. We
45068 have implemented the framework and applied it to
45069 medical domain to illustrate its usefulness.",
45070 acknowledgement = ack-nhfb,
45071 xxnumber = "CS-TR-94-1516",
45072 }
45073
45074 @TechReport{vanGlabbeek:1994:RGS,
45075 author = "Rob J. van Glabbeek and Scott A. Smolka and Bernhard
45076 Steffen",
45077 title = "Reactive, Generative and Stratified Models of
45078 Probabilistic Processes",
45079 type = "Technical Report",
45080 number = "STAN-CS-94-1517",
45081 institution = inst-STAN-CS,
45082 address = inst-STAN-CS:adr,
45083 pages = "39",
45084 month = jul,
45085 year = "1994",
45086 bibdate = "Thu Nov 20 12:13:32 MST 2025",
45087 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
45088 URL = "http://www-db.stanford.edu/TR/CS-TR-94-1517.html",
45089 abstract = "We introduce three models of probabilistic processes,
45090 namely, reactive, generative and stratified. These
45091 models are investigated within the context of PCCS, an
45092 extension of Milner's SCCS in which each summand of a
45093 process summation expression is guarded by a
45094 probability and the sum of these probabilities is 1.
45095 For each model we present a structural operational
45096 semantics of PCCS and a notion of bisimulation
45097 equivalence which we prove to be a congruence. We also
45098 show that the models form a hierarchy: the reactive
45099 model is derivable from the generative model by
45100 abstraction from the relative probabilities of
45101 different actions, and the generative model is
45102 derivable from the stratified model by abstraction from
45103 the purely probabilistic branching structure. Moreover
45104 the classical nonprobabilistic model is derivable from
45105 each of these models by abstraction from all
45106 probabilities.",
45107 acknowledgement = ack-nhfb,
45108 xxnumber = "CS-TR-94-1517",
45109 }
45110
45111 @TechReport{Manna:1994:SST,
45112 author = "Zohar Manna and Anuchit Anuchitanukul and Nikolaj
45113 Bjorner and Anca Browne and Edward Chang and Michael
45114 Colon and Luca de Alfaro and Harish Devarajan and Henny
45115 Sipma and Tomas Uribe",
45116 title = "{STeP}: The {Stanford Temporal Prover}",
45117 type = "Technical Report",
45118 number = "STAN-CS-94-1518",
45119 institution = inst-STAN-CS,
45120 address = inst-STAN-CS:adr,
45121 pages = "??",
45122 month = jun,
45123 year = "1994",
45124 bibdate = "Thu Nov 20 12:13:32 MST 2025",
45125 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
45126 URL = "http://www-db.stanford.edu/TR/CS-TR-94-1518.html",
45127 abstract = "We describe the Stanford Temporal Prover (STeP), a
45128 system being developed to support the computer-aided
45129 formal verification of concurrent and reactive systems
45130 based on temporal specifications. Unlike systems based
45131 on model-checking, STeP is not restricted to
45132 finite-state systems. It combines model checking and
45133 deductive methods to allow the verification of a broad
45134 class of systems, including programs with infinite data
45135 domains, N-process programs, and N-component circuit
45136 designs, for arbitrary N. In short, STeP has been
45137 designed with the objective of combining the
45138 expressiveness of deductive methods with the simplicity
45139 of model checking. The verification process is for the
45140 most part automatic. User interaction occurs mostly at
45141 the highest, most intuitive level, primarily through a
45142 graphical proof language of verification diagrams.
45143 Efficient simplification methods, decision procedures,
45144 and invariant generation techniques are then invoked
45145 automatically to prove resulting first-order
45146 verification conditions with minimal assistance. We
45147 describe the performance of the system when applied to
45148 several examples, including the N-process dining
45149 philosopher's program, Szymanski's N-process mutual
45150 exclusion algorithm, and a distributed N-way arbiter
45151 circuit.",
45152 acknowledgement = ack-nhfb,
45153 xxnumber = "CS-TR-94-1518",
45154 }
45155
45156 @TechReport{Kavraki:1994:PRP,
45157 author = "Lydia Kavraki and Petr Svestka and Jean-Claude Latombe
45158 and Mark Overmars",
45159 title = "Probabilistic Roadmaps for Path Planning in
45160 High-Dimensional Configuration Spaces",
45161 type = "Technical Report",
45162 number = "STAN-CS-94-1519",
45163 institution = inst-STAN-CS,
45164 address = inst-STAN-CS:adr,
45165 pages = "37",
45166 month = aug,
45167 year = "1994",
45168 bibdate = "Thu Nov 20 12:13:32 MST 2025",
45169 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
45170 URL = "http://www-db.stanford.edu/TR/CS-TR-94-1519.html",
45171 abstract = "A new motion planning method for robots in static
45172 workspaces is presented. This method proceeds according
45173 to two phases: a learning phase and a query phase. In
45174 the learning phase, a probabilistic roadmap is
45175 constructed and stored as a graph whose nodes
45176 correspond to collision-free configurations and edges
45177 to feasible paths between these configurations. These
45178 paths are computed using a simple and fast local
45179 planner. In the query phase, any given start and goal
45180 configurations of the robot are connected to two nodes
45181 of the roadmap; the roadmap is then searched for a path
45182 joining these two nodes. The method is general and easy
45183 to implement. It can be applied to virtually any type
45184 of holonomic robot. It requires selecting certain
45185 parameters (e.g., the duration of the learning phase)
45186 whose values depend on the considered scenes, that is
45187 the robots and their workspaces. But these values turn
45188 out to be relatively easy to choose. Increased
45189 efficiency can also be achieved by tailoring some
45190 components of the method (e.g., the local planner) to
45191 the considered robots. In this paper the method is
45192 applied to planar articulated robots with many degrees
45193 of freedom. Experimental results show that path
45194 planning can be done in a fraction of a second on a
45195 contemporary workstation (approximately 150 MIPS),
45196 after learning for relatively short periods of time (a
45197 few dozen seconds).",
45198 acknowledgement = ack-nhfb,
45199 xxnumber = "CS-TR-94-1519",
45200 }
45201
45202 @TechReport{Holzle:1994:AOS,
45203 author = "Urs Holzle",
45204 title = "Adaptive Optimization for {SELF}: Reconciling High
45205 Performance with Exploratory Programming",
45206 type = "Technical Report",
45207 number = "STAN-CS-94-1520",
45208 institution = inst-STAN-CS,
45209 address = inst-STAN-CS:adr,
45210 pages = "??",
45211 month = aug,
45212 year = "1994",
45213 bibdate = "Thu Nov 20 12:13:32 MST 2025",
45214 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
45215 URL = "http://www-db.stanford.edu/TR/CS-TR-94-1520.html",
45216 abstract = "Crossing abstraction boundaries often incurs a
45217 substantial run-time overhead in the form of frequent
45218 procedure calls. Thus, pervasive use of abstraction,
45219 while desirable from a design standpoint, may lead to
45220 very inefficient programs. Aggressively optimizing
45221 compilers can reduce this overhead but conflict with
45222 interactive programming environments because they
45223 introduce long compilation pauses and often preclude
45224 source-level debugging. Thus, programmers are caught on
45225 the horns of two dilemmas: they have to choose between
45226 abstraction and efficiency, and between responsive
45227 programming environments and efficiency. This
45228 dissertation shows how to reconcile these seemingly
45229 contradictory goals. Four new techniques work together
45230 to achieve this: --- Type feedback achieves high
45231 performance by allowing the compiler to inline message
45232 sends based on information extracted from the runtime
45233 system. --- Adaptive optimization achieves high
45234 responsiveness without sacrificing performance by using
45235 a fast compiler to generate initial code while
45236 automatically recompiling heavily used program parts
45237 with an optimizing compiler. --- Dynamic deoptimization
45238 allows source-level debugging of optimized code by
45239 transparently recreating non-optimized code as needed.
45240 --- Polymorphic inline caching speeds up message
45241 dispatch and, more significantly, collects concrete
45242 type information for the compiler. With better
45243 performance yet good interactive behavior, these
45244 techniques reconcile exploratory programming,
45245 ubiquitous abstraction, and high performance.",
45246 acknowledgement = ack-nhfb,
45247 xxnumber = "CS-TR-94-1520",
45248 }
45249
45250 @TechReport{Gupta:1994:CSM,
45251 author = "Vineet Gupta",
45252 title = "{Chu} Spaces: a Model for Concurrency",
45253 type = "Technical Report",
45254 number = "STAN-CS-94-1521",
45255 institution = inst-STAN-CS,
45256 address = inst-STAN-CS:adr,
45257 pages = "101",
45258 month = aug,
45259 year = "1994",
45260 bibdate = "Thu Nov 20 12:13:32 MST 2025",
45261 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
45262 URL = "http://www-db.stanford.edu/TR/CS-TR-94-1521.html",
45263 abstract = "A Chu space is a binary relation between two sets. In
45264 this thesis we show that Chu spaces form a
45265 non-interleaving model of concurrency which extends
45266 event structures while endowing them with an algebraic
45267 structure whose natural logic is linear logic. We
45268 provide several equivalent definitions of Chu spaces,
45269 including two pictorial representations. Chu spaces
45270 represent processes as automata or schedules, and Chu
45271 duality gives a simple way of converting between
45272 schedules and automata. We show that Chu spaces can
45273 represent various concurrency concepts like conflict,
45274 temporal precedence and internal and external choice,
45275 and they distinguish between causing and enabling
45276 events. We present a process algebra for Chu spaces
45277 including the standard combinators like parallel
45278 composition, sequential composition, choice,
45279 interaction, restriction, and show that the various
45280 operational identities between these hold for Chu
45281 spaces. The solution of recursive domain equations is
45282 possible for most of these operations, giving us an
45283 expressive specification and programming language. We
45284 define a history preserving equivalence between Chu
45285 spaces, and show that it preserves the causal structure
45286 of a process.",
45287 acknowledgement = ack-nhfb,
45288 xxnumber = "CS-TR-94-1521",
45289 }
45290
45291 @TechReport{Cherkassky:1994:IPR,
45292 author = "Boris V. Cherkassky and Andrew V. Goldberg",
45293 title = "On Implementing Push-Relabel Method for the Maximum
45294 Flow Problem",
45295 type = "Technical Report",
45296 number = "STAN-CS-94-1523",
45297 institution = inst-STAN-CS,
45298 address = inst-STAN-CS:adr,
45299 pages = "21",
45300 month = sep,
45301 year = "1994",
45302 bibdate = "Thu Nov 20 12:13:32 MST 2025",
45303 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
45304 URL = "http://www-db.stanford.edu/TR/CS-TR-94-1523.html",
45305 abstract = "We study efficient implementations of the push-relabel
45306 method for the maximum flow problem. The resulting
45307 codes are faster than the previous codes, and much
45308 faster on some problem families. The speedup is due to
45309 the combination of heuristics used in our
45310 implementation. We also exhibit a family of problems
45311 for which all known methods seem to have almost
45312 quadratic time growth rate.",
45313 acknowledgement = ack-nhfb,
45314 xxnumber = "CS-TR-94-1523",
45315 }
45316
45317 @TechReport{deAlfaro:1994:CVD,
45318 author = "Luca de Alfaro and Zohar Manna",
45319 title = "Continuous Verification by Discrete Reasoning",
45320 type = "Technical Report",
45321 number = "STAN-CS-94-1524",
45322 institution = inst-STAN-CS,
45323 address = inst-STAN-CS:adr,
45324 pages = "106",
45325 month = sep,
45326 year = "1994",
45327 bibdate = "Thu Nov 20 12:13:32 MST 2025",
45328 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
45329 URL = "http://www-db.stanford.edu/TR/CS-TR-94-1524.html",
45330 abstract = "Two semantics are commonly used for the behavior of
45331 real-time and hybrid systems: a discrete semantics, in
45332 which the temporal evolution is represented as a
45333 sequence of snapshots describing the state of the
45334 system at certain times, and a continuous semantics, in
45335 which the temporal evolution is represented by a series
45336 of time intervals, and therefore corresponds more
45337 closely to the physical reality. Powerful verification
45338 rules are known for temporal logic formulas based on
45339 the discrete semantics. This paper shows how to
45340 transfer the verification techniques of the discrete
45341 semantics to the continuous one. We show that if a
45342 temporal logic formula has the property of finite
45343 variability, its validity in the discrete semantics
45344 implies its validity in the continuous one. This leads
45345 to a verification method based on three components:
45346 verification rules for the discrete semantics, axioms
45347 about time, and some temporal reasoning to bring the
45348 results together. This approach enables the
45349 verification of properties of real-time and hybrid
45350 systems with respect to the continuous semantics.",
45351 acknowledgement = ack-nhfb,
45352 xxnumber = "CS-TR-94-1524",
45353 }
45354
45355 @TechReport{Anuchitanukul:1994:DB,
45356 author = "Anuchit Anuchitanukul and Zohar Manna",
45357 title = "Differential {BDDs}",
45358 type = "Technical Report",
45359 number = "STAN-CS-94-1525",
45360 institution = inst-STAN-CS,
45361 address = inst-STAN-CS:adr,
45362 pages = "12",
45363 month = sep,
45364 year = "1994",
45365 bibdate = "Thu Nov 20 12:13:32 MST 2025",
45366 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
45367 URL = "http://www-db.stanford.edu/TR/CS-TR-94-1525.html",
45368 abstract = "In this paper, we introduce a class of Binary Decision
45369 Diagrams (BDDs) which we call Differential BDDs
45370 (DBDDs), and two transformations over DBDDs, called
45371 Push-up and Delta transformations. In DBDDs and its
45372 derived classes such as Push-up DBDDs or Delta DBDDs,
45373 in addition to the ordinary node-sharing in the normal
45374 Ordered Binary Decision Diagrams (OBDDs), some
45375 isomorphic substructures are collapsed together forming
45376 an even more compact representation of boolean
45377 functions. The elimination of isomorphic substructures
45378 coincides with the repetitive occurrences of the same
45379 or similar small components in many applications of
45380 BDDs such as in the representation of hardware
45381 circuits. The reduction in the number of nodes, from
45382 OBDDs to DBDDs, is potentially exponential while
45383 boolean manipulations on DBDDs remain efficient.",
45384 acknowledgement = ack-nhfb,
45385 xxnumber = "CS-TR-94-1525",
45386 }
45387
45388 @TechReport{Mohammed:1994:CET,
45389 author = "John Llewelyn Mohammed",
45390 title = "Combining Experiential and Theoretical Knowledge in
45391 the Domain of Semiconductor Manufacturing",
45392 type = "Technical Report",
45393 number = "STAN-CS-94-1526",
45394 institution = inst-STAN-CS,
45395 address = inst-STAN-CS:adr,
45396 pages = "265",
45397 month = sep,
45398 year = "1994",
45399 bibdate = "Thu Nov 20 12:13:32 MST 2025",
45400 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
45401 URL = "http://www-db.stanford.edu/TR/CS-TR-94-1526.html",
45402 abstract = "Semiconductor Manufacturing is characterized by
45403 complexity and continual, rapid change. These
45404 characteristics reduce the effectiveness of traditional
45405 diagnostic expert systems: the knowledge represented
45406 cannot adapt to changes in the manufacturing plan
45407 because the dependence of the knowledge on the plan is
45408 not explicitly represented. It is impractical to
45409 manually encode all the dependencies in a complex plan.
45410 We address this problem in two ways. First, we employ
45411 model-based techniques to encode theoretical knowledge,
45412 so that symbolic simulation of a new manufacturing plan
45413 can automatically glean diagnostic information. Our
45414 representation is sufficiently detailed to capture the
45415 plan's inherent causal dependencies, yet sufficiently
45416 abstract to make symbolic simulation practical. This
45417 theoretical knowledge can adapt to changes in the
45418 manufacturing plan. However, the expressiveness and
45419 tractability of our representational machinery limit
45420 the range of phenomena that we can represent. Second,
45421 we describe Generic Rules, which combine the
45422 expressiveness of heuristic rules with the robustness
45423 of theoretical models. Generic Rules are general
45424 patterns for heuristic rules, associated with
45425 model-based restrictions on the situations in which the
45426 patterns can be instantiated to form rules for new
45427 contexts. In this way, theoretical knowledge is
45428 employed to encode the dependence of heuristic
45429 knowledge on the manufacturing plan.",
45430 acknowledgement = ack-nhfb,
45431 xxnumber = "CS-TR-94-1526",
45432 }
45433
45434 @TechReport{Koller:1994:KB,
45435 author = "Daphne Koller",
45436 title = "From Knowledge to Belief",
45437 type = "Technical Report",
45438 number = "STAN-CS-94-1527",
45439 institution = inst-STAN-CS,
45440 address = inst-STAN-CS:adr,
45441 pages = "219",
45442 month = oct,
45443 year = "1994",
45444 bibdate = "Thu Nov 20 12:13:32 MST 2025",
45445 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
45446 URL = "http://www-db.stanford.edu/TR/CS-TR-94-1527.html",
45447 abstract = "When acting in the real world, an intelligent agent
45448 must make decisions under uncertainty. The standard
45449 solution requires it to assign degrees of belief to the
45450 relevant assertions. These should be based on the
45451 agent's knowledge. For example, a doctor deciding on
45452 the treatment for a patient should use information
45453 about that patient, statistical correlations between
45454 symptoms and diseases, default rules, and more. The
45455 random-worlds method induces degrees of belief from
45456 very rich knowledge bases, expressed in a language that
45457 augments first-order logic with statistical statements
45458 and default rules (interpreted as qualitative
45459 statistics). The method is based on the principle of
45460 indifference, treating all possible worlds as equally
45461 likely. It naturally derives important patterns of
45462 reasoning such as specificity, inheritance,
45463 indifference to irrelevant information, and a default
45464 assumption of independence. Its expressive power and
45465 intuitive semantics allow it to deal well with examples
45466 that are too complex for most other reasoning systems.
45467 We use techniques from finite model theory to analyze
45468 the computational aspects of random worlds. The problem
45469 of computing degrees of belief is undecidable in
45470 general. However, for unary knowledge bases, a tight
45471 connection to the principle of maximum entropy often
45472 allows us to compute degrees of belief.",
45473 acknowledgement = ack-nhfb,
45474 xxnumber = "CS-TR-94-1527",
45475 }
45476
45477 @TechReport{Koza:1994:AAO,
45478 author = "John R. Koza",
45479 title = "Architecture-Altering Operations for Evolving the
45480 Architecture of a Multi-Part Program in Genetic
45481 Programming",
45482 type = "Technical Report",
45483 number = "STAN-CS-94-1528",
45484 institution = inst-STAN-CS,
45485 address = inst-STAN-CS:adr,
45486 pages = "??",
45487 month = oct,
45488 year = "1994",
45489 bibdate = "Thu Nov 20 12:13:32 MST 2025",
45490 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
45491 URL = "http://www-db.stanford.edu/TR/CS-TR-94-1528.html",
45492 abstract = "Previous work described a way to evolutionarily select
45493 the architecture of a multi-part computer program
45494 &gt;From among preexisting alternatives in the
45495 population while concurrently solving a problem during
45496 a run of genetic programming. This report describes six
45497 new architecture-altering operations that provide a way
45498 to evolve the architecture of a multi-part program in
45499 the sense of actually changing the architecture of
45500 programs dynamically during the run. The new
45501 architecture-altering operations are motivated by the
45502 naturally occurring operation of gene duplication as
45503 described in Susumu Ohno's provocative 1970 book
45504 Evolution by Means of Gene Duplication as well as the
45505 naturally occurring operation of gene deletion. The six
45506 new architecture-altering operations are branch
45507 duplication, argument duplication, branch creation,
45508 argument creation, branch deletion and argument
45509 deletion. A connection is made between genetic
45510 programming and other techniques of automated problem
45511 solving by interpreting the architecture-altering
45512 operations as providing an automated way to specialize
45513 and generalize programs. The report demonstrates that a
45514 hierarchical architecture can be evolved to solve an
45515 illustrative symbolic regression problem using the
45516 architecture- altering operations. Future work will
45517 study the amount of additional computational effort
45518 required to employ the architecture-altering
45519 operations.",
45520 acknowledgement = ack-nhfb,
45521 xxnumber = "CS-TR-94-1528",
45522 }
45523
45524 @TechReport{Shahar:1994:KBM,
45525 author = "Yuval Shahar",
45526 title = "A knowledge-based method for temporal abstraction of
45527 clinical data",
45528 type = "Technical Report",
45529 number = "STAN-CS-94-1529",
45530 institution = inst-STAN-CS,
45531 address = inst-STAN-CS:adr,
45532 pages = "330",
45533 month = oct,
45534 year = "1994",
45535 bibdate = "Thu Nov 20 12:13:32 MST 2025",
45536 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
45537 URL = "http://www-db.stanford.edu/TR/CS-TR-94-1529.html",
45538 abstract = "This dissertation describes a domain-independent
45539 method specific to the task of abstracting higher-level
45540 concepts from time-stamped data. The framework includes
45541 a model of time, parameters, events and contexts. I
45542 applied my framework to several domains of medicine. My
45543 goal is to create, from time-stamped patient data,
45544 interval-based temporal abstractions such as ``severe
45545 anemia for 3 weeks in the context of administering AZ
45546 T.'' The knowledge-based temporal-abstraction method
45547 decomposes the task of abstracting higher-level
45548 abstractions from input data into five subtasks. These
45549 subtasks are solved by five domain-independent
45550 temporal-abstraction mechanisms. The
45551 temporal-abstraction mechanisms depend on four
45552 domain-specific knowledge types. I implemented the
45553 knowledge-based temporal-abstraction method in the
45554 RESUME system. RESUME accepts input and returns output
45555 at all levels of abstraction; accepts input out of
45556 temporal order, modifying a view of the past or of the
45557 present, as necessary; generates context-sensitive,
45558 controlled output; and maintains several possible
45559 concurrent interpretations of the data. I evaluated
45560 RESUME in the domains of protocol-based care,
45561 monitoring of children's growth, and therapy of
45562 diabetes. A formal specification of a domain's
45563 temporal-abstraction knowledge supports acquisition,
45564 maintenance, reuse, and sharing of that knowledge.",
45565 acknowledgement = ack-nhfb,
45566 xxnumber = "CS-TR-94-1529",
45567 }
45568
45569 @TechReport{Koga:1994:CMA,
45570 author = "Yoshihito Koga",
45571 title = "On Computing Multi-Arm Manipulation Trajectories",
45572 type = "Technical Report",
45573 number = "STAN-CS-94-1530",
45574 institution = inst-STAN-CS,
45575 address = inst-STAN-CS:adr,
45576 pages = "143",
45577 month = oct,
45578 year = "1994",
45579 bibdate = "Thu Nov 20 12:13:32 MST 2025",
45580 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
45581 URL = "http://www-db.stanford.edu/TR/CS-TR-94-1530.html",
45582 abstract = "This dissertation considers the manipulation task
45583 planning problem of automatically generating the
45584 trajectories for several cooperating robot arms to
45585 manipulate a movable object to a goal location among
45586 obstacles. The planner must reason that the robots may
45587 need to change their grasp of the object to complete
45588 the task, for example, by passing it from one arm to
45589 another. Furthermore, the computed velocities and
45590 accelerations of the arms must satisfy the limits of
45591 the actuators. Past work strongly suggests that solving
45592 this problem in a rigorous fashion is intractable. We
45593 address this problem in a practical two-phase approach.
45594 In step one, using a heuristic we compute a
45595 collision-free path for the robots and the movable
45596 object. For the case of multiple robot arms with many
45597 degrees of freedom, this step may fail to find the
45598 desired path even though it exists. Despite this
45599 limitation, experimental results of the implemented
45600 planner (for solving step one) show that it is
45601 efficient and reliable; for example, the planner is
45602 able to find complex manipulation motions for a system
45603 with seventy eight degrees of freedom. In step two, we
45604 then find the time-parameterization of the path such
45605 that the dynamic constraints on the robot are
45606 satisfied. In fact, we find the time-optimal solution
45607 for the given path. We show simulation results for
45608 various complex examples.",
45609 acknowledgement = ack-nhfb,
45610 xxnumber = "CS-TR-94-1530",
45611 }
45612
45613 @TechReport{Li:1994:LMP,
45614 author = "Tsai-Yen Li and Jean-Claude Latombe",
45615 title = "On-Line Manipulation Planning for Two Robot Arms in a
45616 Dynamic Environment",
45617 type = "Technical Report",
45618 number = "STAN-CS-94-1531",
45619 institution = inst-STAN-CS,
45620 address = inst-STAN-CS:adr,
45621 pages = "34",
45622 month = dec,
45623 year = "1994",
45624 bibdate = "Thu Nov 20 12:13:32 MST 2025",
45625 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
45626 URL = "http://www-db.stanford.edu/TR/CS-TR-94-1531.html",
45627 abstract = "In a constantly changing and partially unpredictable
45628 environment, robot motion planning must be on-line. The
45629 planner receives a continuous flow of information about
45630 occurring events and generates new plans, while
45631 previously planned motions are being executed. This
45632 paper describes an on-line planner for two cooperating
45633 arms whose task is to grab parts of various types on a
45634 conveyor belt and transfer them to their respective
45635 goals while avoiding collision with obstacles. Parts
45636 arrive on the belt in random order, at any time. Both
45637 goals and obstacles may be dynamically changed. This
45638 scenario is typical of manufacturing cells serving
45639 machine-tools, assembling products, or packaging
45640 objects. The proposed approach breaks the overall
45641 planning problem into subproblems, each involving a
45642 low-dimensional configuration or configuration-time
45643 space, and orchestrates very fast primitives solving
45644 these subproblems. The resulting planner has been
45645 implemented and extensively tested in a simulated
45646 environment, as well as with a real dual-arm system.
45647 Its competitiveness has been evaluated against an
45648 oracle making (almost) the best decision at any one
45649 time; the results show that the planner compares
45650 extremely well.",
45651 acknowledgement = ack-nhfb,
45652 xxnumber = "CS-TR-94-1531",
45653 }
45654
45655 @TechReport{Banon:1994:PCF,
45656 author = "Jose Banon",
45657 title = "Planning the Collision-Free Paths of an Actively
45658 Flexible Manipulator",
45659 type = "Technical Report",
45660 number = "STAN-CS-94-1532",
45661 institution = inst-STAN-CS,
45662 address = inst-STAN-CS:adr,
45663 pages = "29",
45664 month = dec,
45665 year = "1994",
45666 bibdate = "Thu Nov 20 12:13:32 MST 2025",
45667 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
45668 URL = "http://www-db.stanford.edu/TR/CS-TR-94-1532.html",
45669 abstract = "Most robot manipulators consist of a small sequence of
45670 rigid links connected by articulated joints. However,
45671 robot dexterity is considerably enhanced when the
45672 number of joints is large or infinite. Additional
45673 joints make it possible to manipulate objects in
45674 cluttered environments where non-redundant robots are
45675 useless. In this paper we consider a simulated actively
45676 flexible manipulator (AFM), i.e. a manipulator whose
45677 flexibility can be directly controlled by its
45678 actuators. We propose an efficient method for planning
45679 the collision-free paths of an AFM in a
45680 three-dimensional workspace. We implemented this method
45681 on a graphic workstation and experimented with it on
45682 several examples.",
45683 acknowledgement = ack-nhfb,
45684 xxnumber = "CS-TR-94-1532",
45685 }
45686
45687 @TechReport{Raghavan:1994:RQP,
45688 author = "L. Raghavan and J-C. Kavraki and R. Latombe and P.
45689 Motwani",
45690 title = "Randomized Query Processing in Robot Motion Planning",
45691 type = "Technical Report",
45692 number = "STAN-CS-94-1533",
45693 institution = inst-STAN-CS,
45694 address = inst-STAN-CS:adr,
45695 pages = "18",
45696 month = dec,
45697 year = "1994",
45698 bibdate = "Thu Nov 20 12:13:32 MST 2025",
45699 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
45700 URL = "http://www-db.stanford.edu/TR/CS-TR-94-1533.html",
45701 abstract = "The subject of this paper is the analysis of a
45702 randomized preprocessing scheme that has been used for
45703 query processing in robot motion planning. The
45704 attractiveness of the scheme stems from its general
45705 applicability to virtually any motion-planning problem,
45706 and its empirically observed success. In this paper we
45707 initiate a theoretical basis for explaining this
45708 empirical success. Under a simple assumption about the
45709 configuration space, we show that it is possible to
45710 perform a preprocessing step following which queries
45711 can be answered quickly. En route, we pose and give
45712 solutions to related problems on graph connectivity in
45713 the evasiveness model, and art-gallery theorems.",
45714 acknowledgement = ack-nhfb,
45715 xxnumber = "CS-TR-94-1533",
45716 }
45717
45718 @TechReport{Lazanas:1994:RAU,
45719 author = "Anthony Lazanas",
45720 title = "Reasoning About Uncertainty in Robot Motion Planning",
45721 type = "Technical Report",
45722 number = "STAN-CS-95-1539",
45723 institution = inst-STAN-CS,
45724 address = inst-STAN-CS:adr,
45725 pages = "255",
45726 month = aug,
45727 year = "1994",
45728 bibdate = "Thu Nov 20 12:13:32 MST 2025",
45729 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
45730 URL = "http://www-db.stanford.edu/TR/CS-TR-95-1539.html",
45731 abstract = "In this thesis, we investigate the effects of
45732 uncertainty on the difficulty of robot motion planning,
45733 and we study the tradeoff between physical and
45734 computational complexity. We present a formulation of
45735 the general robot motion planning with uncertainty
45736 problem, so that a complete, correct, polynomial
45737 planner can be derived. The key idea is the existence
45738 of reduced uncertainty regions in the workspace
45739 (landmark regions). Planning is performed using the
45740 preimage backchaining method. We extend the standard
45741 definition of a ``nondirectional preimage'' to the case
45742 where a motion command depends on an arbitrary number
45743 of control parameters. The resulting multi-dimensional
45744 preimage can be represented with a polynomial number of
45745 2-D slices, each computed for a critical combination of
45746 values of the parameters. We present implemented
45747 algorithms for one parameter (the commanded direction
45748 of motion) and for two parameters (the commanded
45749 direction of motion and the directional uncertainty).
45750 Experimentation with the algorithm using a real mobile
45751 robot has been successful. By engineering the
45752 workspace, we have been able to satisfy all the
45753 assumptions of our planning model. As a result, the
45754 robot has been able to operate for long periods of time
45755 with no failures.",
45756 acknowledgement = ack-nhfb,
45757 xxnumber = "CS-TR-95-1539",
45758 }
45759
45760 @TechReport{Wong-Toi:1994:SAV,
45761 author = "Howard Wong-Toi",
45762 title = "Symbolic Approximations for Verifying Real-Time
45763 Systems",
45764 type = "Technical Report",
45765 number = "STAN-CS-95-1546",
45766 institution = inst-STAN-CS,
45767 address = inst-STAN-CS:adr,
45768 pages = "207",
45769 month = dec,
45770 year = "1994",
45771 bibdate = "Thu Nov 20 12:13:32 MST 2025",
45772 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
45773 URL = "http://www-db.stanford.edu/TR/CS-TR-95-1546.html",
45774 abstract = "Real-time systems are appearing in more and more
45775 applications where their proper operation is critical,
45776 e.g. transport controllers and medical equipment.
45777 However they are extremely difficult to design
45778 correctly. One approach to this problem is the use of
45779 formal description techniques and automatic
45780 verification. Unfortunately automatic verification
45781 suffers from the state-explosion problem even without
45782 considering timing information. This thesis proposes a
45783 state-based approximation scheme as a heuristic for
45784 efficient yet accurate verification. We first describe
45785 a generic iterative approximation algorithm for
45786 checking safety properties of a transition system.
45787 Successively more accurate approximations of the
45788 reachable states are generated until the specification
45789 is provably satisfied or not. The algorithm
45790 automatically decides where the analysis needs to be
45791 more exact, and uses state partitioning to force the
45792 approximations to converge towards a solution. The
45793 method is complete for finite-state systems. The
45794 algorithm is applied to systems with hard real-time
45795 bounds. State approximations are performed over both
45796 timing information and control information. We also
45797 approximate the system's transition structure. Case
45798 studies include some timing properties of the MAC
45799 sublayer of the Ethernet protocol, the tick-tock
45800 service protocol, and a timing-based communication
45801 protocol where the sender's and receiver's clocks
45802 advance at variable rates.",
45803 acknowledgement = ack-nhfb,
45804 xxnumber = "CS-TR-95-1546",
45805 }
45806
45807 @TechReport{Gupta:1995:PIB,
45808 author = "Ashish Gupta",
45809 title = "Partial Information Based Integrity Constraint
45810 Checking",
45811 type = "Technical Report",
45812 number = "STAN-CS-95-1534",
45813 institution = inst-STAN-CS,
45814 address = inst-STAN-CS:adr,
45815 pages = "??",
45816 month = jan,
45817 year = "1995",
45818 bibdate = "Thu Nov 20 12:13:32 MST 2025",
45819 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
45820 URL = "http://www-db.stanford.edu/TR/CS-TR-95-1534.html",
45821 abstract = "Integrity constraints are useful for specifying
45822 consistent states of a database, especially in
45823 distributed database systems where data may be under
45824 the control of multiple database managers. Constraints
45825 need to be checked when the underlying database is
45826 updated. Integrity constraint checking in a distributed
45827 environment may involve a distributed transaction and
45828 the expenses associated with it: two phase commit
45829 protocols, distributed concurrency control, network
45830 communication costs, and multiple interface layers if
45831 the databases are heterogeneous. The information used
45832 for constraint checking may include the contents of
45833 base relations, constraint specifications, updates to
45834 the databases, schema restrictions, stored aggregates
45835 etc. We propose using only a subset of the information
45836 potentially available for constraint checking. Thus,
45837 only data that is local to a site may be used for
45838 constraint checking thus avoiding distributed
45839 transactions. The approach is useful also in
45840 centralized systems because relatively inexpensively
45841 accessible subsets may be used for constraint checking.
45842 We discuss constraint checking for the following three
45843 subsets of the aforementioned information. 1.
45844 Constraint Subsumption: How to check one constraint C
45845 using a set of other constraint specifications $ \{ C0,
45846 \ldots {}, C n \} $ and no data, and the knowledge that
45847 the constraints in set $ \{ C0, \ldots {}, C n \} $
45848 hold in the database? 2. Irrelevant Updates. How to
45849 check a constraint C using the database update, a set
45850 of other constraints $ \{ C0, \ldots {}, C n \} $, and
45851 the knowledge that the constraints $ \{ C, C0, \ldots
45852 {}, C n \} $ all hold before the update? 3. Local
45853 Checking. How to check a constraint C using the
45854 database update, the contents of the updated relation,
45855 a set of other constraints $ \{ C0, \ldots {}, C n \}
45856 $, and the knowledge that the constraints $ \{ C, C0,
45857 \ldots {}, C n \} $ all hold before the update? Local
45858 checking is the main focus and the main contribution of
45859 this thesis.",
45860 acknowledgement = ack-nhfb,
45861 xxnumber = "CS-TR-95-1534",
45862 }
45863
45864 @TechReport{Kavraki:1995:RNC,
45865 author = "Lydia E. Kavraki",
45866 title = "Random Networks in Configuration Space for Fast Path
45867 Planning",
45868 type = "Technical Report",
45869 number = "STAN-CS-95-1535",
45870 institution = inst-STAN-CS,
45871 address = inst-STAN-CS:adr,
45872 pages = "150",
45873 month = jan,
45874 year = "1995",
45875 bibdate = "Thu Nov 20 12:13:32 MST 2025",
45876 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
45877 URL = "http://www-db.stanford.edu/TR/CS-TR-95-1535.html",
45878 abstract = "In the main part of this dissertation we present a new
45879 path planning method which computes collision-free
45880 paths for robots of virtually any type moving among
45881 stationary obstacles. This method proceeds according to
45882 two phases: a preprocessing phase and a query phase. In
45883 the preprocessing phase, a probabilistic network is
45884 constructed and stored as a graph whose nodes
45885 correspond to collision-free configurations and edges
45886 to feasible paths between these configurations. In the
45887 query phase, any given start and goal configurations of
45888 the robot are connected to two nodes of the network;
45889 the network is then searched for a path joining these
45890 two nodes. We apply our method to articulated robots
45891 with many degrees of freedom. Experimental results show
45892 that path planning can be done in a fraction of a
45893 second on a contemporary workstation ($ \approx $ 150
45894 MIPS), after relatively short preprocessing times (a
45895 few dozen to a few hundred seconds). In the second part
45896 of this dissertation, we present a new method that uses
45897 the Fast Fourier Transform to compute the obstacle map
45898 required by certain path planning algorithms. In the
45899 final part of this dissertation, we consider a problem
45900 from assembly planning. In assembly planning we are
45901 interested in generating feasible sequences of motions
45902 that construct a mechanical product from its individual
45903 parts. We prove that the monotone assembly partitioning
45904 problem in the plane is NP-complete.",
45905 acknowledgement = ack-nhfb,
45906 xxnumber = "CS-TR-95-1535",
45907 }
45908
45909 @TechReport{Yim:1995:LUM,
45910 author = "Mark Yim",
45911 title = "Locomotion With a Unit-Modular Reconfigurable Robot",
45912 type = "Technical Report",
45913 number = "STAN-CS-95-1536",
45914 institution = inst-STAN-CS,
45915 address = inst-STAN-CS:adr,
45916 pages = "??",
45917 month = jan,
45918 year = "1995",
45919 bibdate = "Thu Nov 20 12:13:32 MST 2025",
45920 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
45921 URL = "http://www-db.stanford.edu/TR/CS-TR-95-1536.html",
45922 abstract = "A unit-modular robot is a robot that is composed of
45923 modules that are all identical. Here we study the
45924 design and control of unit-modular dynamically
45925 reconfigurable robots. This is based upon the design
45926 and construction of a robot called Polypod. We further
45927 choose statically stable locomotion as the task domain
45928 to evaluate the design and control strategy. The result
45929 is the creation of many unique locomotion modes. To
45930 gain insight into the capabilities of robots like
45931 Polypod we examine locomotion in general by building a
45932 functional taxonomy of locomotion. We show that Polypod
45933 is capable of generating all classes of statically
45934 stable locomotion, a feature unique to Polypod. Next,
45935 we propose methods to evaluate vehicles under different
45936 operating conditions such as different terrain
45937 conditions. We then evaluate and compare each mode of
45938 locomotion on Polypod. This study leads to interesting
45939 insights into the general characteristics of the
45940 corresponding classes of locomotion. Finally, since
45941 more modules are expected to increase robot capability,
45942 it is important to examine the limit to the number of
45943 modules that can be put together in a useful form. We
45944 answer this question by investigating the issues of
45945 structural stability, actuator strength, computation
45946 and control requirements.",
45947 acknowledgement = ack-nhfb,
45948 xxnumber = "CS-TR-95-1536",
45949 }
45950
45951 @TechReport{Quinlan:1995:RTM,
45952 author = "Sean Quinlan",
45953 title = "Real-Time Modification of Collision-Free Paths",
45954 type = "Technical Report",
45955 number = "STAN-CS-95-1537",
45956 institution = inst-STAN-CS,
45957 address = inst-STAN-CS:adr,
45958 pages = "144",
45959 month = jan,
45960 year = "1995",
45961 bibdate = "Thu Nov 20 12:13:32 MST 2025",
45962 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
45963 URL = "http://www-db.stanford.edu/TR/CS-TR-95-1537.html",
45964 abstract = "The modification of collision-free paths is proposed
45965 as the basis for a new framework to close the gap
45966 between global path planning and real-time sensor-based
45967 robot control. A physically-based model of a flexible
45968 string-like object, called an elastic band, is used to
45969 determine the modification of a path. The initial shape
45970 of the elastic is the free path generated by a planner.
45971 Subjected to artificial forces, the elastic band
45972 deforms in real time to a short and smooth path that
45973 maintains clearance from the obstacles. The elastic
45974 continues to deform as changes in the environment are
45975 detected by sensors, enabling the robot to accommodate
45976 uncertainties and react to unexpected and moving
45977 obstacles. While providing a tight connection between
45978 the robot and its environment, the elastic band
45979 preserves the global nature of the planned path. The
45980 greater part of this thesis deals with the design and
45981 implementation of elastic bands, with emphasis on
45982 achieving real-time performance even for robots with
45983 many degrees of freedom. To achieve these goals, we
45984 propose the concept of bubbles of free-space---a region
45985 of free-space around a given configuration of the robot
45986 generated from distance information. We also develop a
45987 novel algorithm for efficiently computing the distance
45988 between non-convex objects and a real-time algorithm
45989 for calculating a discrete approximation to the
45990 time-optimal parameterization of a path. These various
45991 developments are combined in a system that demonstrates
45992 the elastic band framework for a Puma 560
45993 manipulator.",
45994 acknowledgement = ack-nhfb,
45995 xxnumber = "CS-TR-95-1537",
45996 }
45997
45998 @TechReport{Hammer:1995:PSS,
45999 author = "Joachim Hammer",
46000 title = "1994 Publications Summary of the {Stanford Database
46001 Group}",
46002 type = "Technical Report",
46003 number = "STAN-CS-95-1538",
46004 institution = inst-STAN-CS,
46005 address = inst-STAN-CS:adr,
46006 pages = "??",
46007 month = jan,
46008 year = "1995",
46009 bibdate = "Thu Nov 20 12:13:32 MST 2025",
46010 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
46011 URL = "http://www-db.stanford.edu/TR/CS-TR-95-1538.html",
46012 abstract = "This technical report contains the first four pages of
46013 papers written by members of the Stanford Database
46014 Group during 1994. We believe that the first four pages
46015 convey the main ideas behind each paper better than a
46016 simple title and abstract does.",
46017 acknowledgement = ack-nhfb,
46018 xxnumber = "CS-TR-95-1538",
46019 }
46020
46021 @TechReport{Murdock:1995:MMI,
46022 author = "Janet L. Murdock",
46023 title = "Model-Matching and Individuation for Model-Based
46024 Diagnosis",
46025 type = "Technical Report",
46026 number = "STAN-CS-95-1540",
46027 institution = inst-STAN-CS,
46028 address = inst-STAN-CS:adr,
46029 pages = "??",
46030 month = jan,
46031 year = "1995",
46032 bibdate = "Thu Nov 20 12:13:32 MST 2025",
46033 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
46034 URL = "http://www-db.stanford.edu/TR/CS-TR-95-1540.html",
46035 abstract = "In model-based systems that reason about the physical
46036 world, models are attached to portions of the physical
46037 system. To make model-based systems more extensible and
46038 re-usable, this thesis explores automating
46039 model-matching. Models address particular individuals,
46040 portions of the physical world identified as separate
46041 entities. If the set of models is not fixed, one cannot
46042 carve the physical system into a fixed set of
46043 individuals. Our goals are to develop methods for
46044 matching and individuating and identify characteristics
46045 of physical equipment and models required by those
46046 methods. Our approach is to identify a set of
46047 characteristics, build a system which used them, and
46048 test re-usability and extensibility. If the system
46049 correctly defines individuals and matches models, even
46050 when models calls for individuals not previously
46051 defined, then we can conclude that we have identified
46052 some subset of the characteristics required. The system
46053 matches models to a series of equipment descriptions,
46054 simulating re-use. We also add a number of models,
46055 extending the system, having it match the new models.
46056 Our investigation shows characteristics required are
46057 the 3-dimensional space and how the space is filled by
46058 functional components, phases, materials, and
46059 parameters.",
46060 acknowledgement = ack-nhfb,
46061 xxnumber = "CS-TR-95-1540",
46062 }
46063
46064 @TechReport{Karger:1995:RSG,
46065 author = "David R. Karger",
46066 title = "Random Sampling in Graph Optimization Problems",
46067 type = "Technical Report",
46068 number = "STAN-CS-95-1541",
46069 institution = inst-STAN-CS,
46070 address = inst-STAN-CS:adr,
46071 pages = "??",
46072 month = feb,
46073 year = "1995",
46074 bibdate = "Thu Nov 20 12:13:32 MST 2025",
46075 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
46076 URL = "http://www-db.stanford.edu/TR/CS-TR-95-1541.html",
46077 abstract = "The representative random sample is a central concept
46078 of statistics. It is often possible to gather a great
46079 deal of information about a large population by
46080 examining a small sample randomly drawn from it. This
46081 approach has obvious advantages in reducing the
46082 investigator's work, both in gathering and in analyzing
46083 the data. We apply the concept of a representative
46084 sample to combinatorial optimization. Our focus is
46085 optimization problems on undirected graphs. Highlights
46086 of our results include: The first (randomized) linear
46087 time minimum spanning tree algorithm; A (randomized)
46088 minimum cut algorithm with running time roughly $
46089 O(n^2) $ as compared to previous roughly $ O(n^3) $
46090 time bounds, as well as the first algorithm for finding
46091 all approximately minimal cuts and multiway cuts; An
46092 efficient parallelization of the minimum cut algorithm,
46093 providing the first parallel (RNC) algorithm for
46094 minimum cuts; A derandomization finding minimum cut in
46095 NC; Provably accurate approximations to network
46096 reliability; Very fast approximation algorithms for
46097 minimum cuts, s-t minimum cuts, and maximum flows;
46098 Significantly improved polynomial-time approximation
46099 bounds for network design problems; For coloring
46100 3-colorable graphs, improvements in the approximation
46101 bounds from $ O(n^{3 / 8}) $ to $ O(n^{1 / 4}) $; An
46102 analysis of random sampling in Matroids.",
46103 acknowledgement = ack-nhfb,
46104 xxnumber = "CS-TR-95-1541",
46105 }
46106
46107 @TechReport{Koza:1995:PGP,
46108 author = "John R. Koza and David Andre",
46109 title = "Parallel Genetic Programming on a Network of
46110 Transputers",
46111 type = "Technical Report",
46112 number = "STAN-CS-95-1542",
46113 institution = inst-STAN-CS,
46114 address = inst-STAN-CS:adr,
46115 pages = "??",
46116 month = jan,
46117 year = "1995",
46118 bibdate = "Thu Nov 20 12:13:32 MST 2025",
46119 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
46120 URL = "http://www-db.stanford.edu/TR/CS-TR-95-1542.html",
46121 abstract = "This report describes the parallel implementation of
46122 genetic programming in the C programming language using
46123 a PC 486 type computer (running Windows) acting as a
46124 host and a network of transputers acting as processing
46125 nodes. Using this approach, researchers of genetic
46126 algorithms and genetic programming can acquire
46127 computing power that is intermediate between the power
46128 of currently available workstations and that of
46129 supercomputers at a cost that is intermediate between
46130 the two. A comparison is made of the computational
46131 effort required to solve the problem of symbolic
46132 regression of the Boolean even-5-parity function with
46133 different migration rates. Genetic programming required
46134 the least computational effort with an 8\% migration
46135 rate. Moreover, this computational effort was less than
46136 that required for solving the problem with a serial
46137 computer and a panmictic population of the same size.
46138 That is, apart from the nearly linear speed-up in
46139 executing a fixed amount of code inherent in the
46140 parallel implementation of genetic programming,
46141 parallelization delivered more than linear speed-up in
46142 solving the problem using genetic programming.",
46143 acknowledgement = ack-nhfb,
46144 xxnumber = "CS-TR-95-1542",
46145 }
46146
46147 @TechReport{Tomasi:1995:SS,
46148 author = "Carlo Tomasi and Roberto Manduchi",
46149 title = "Stereo Without Search",
46150 type = "Technical Report",
46151 number = "STAN-CS-95-1543",
46152 institution = inst-STAN-CS,
46153 address = inst-STAN-CS:adr,
46154 pages = "27",
46155 month = feb,
46156 year = "1995",
46157 bibdate = "Thu Nov 20 12:13:32 MST 2025",
46158 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
46159 URL = "http://www-db.stanford.edu/TR/CS-TR-95-1543.html",
46160 abstract = "Search is not inherent in the correspondence problem.
46161 We propose a representation of images, called intrinsic
46162 curves, that combines the ideas of associative storage
46163 of images with connectedness of the representation:
46164 intrinsic curves are the paths that a set of local
46165 image descriptors trace as an image scanline is
46166 traversed from left to right. Curves become surfaces
46167 when full images are considered instead of scanlines.
46168 Because only the path in the space of descriptors is
46169 used for matching, intrinsic curves lose track of
46170 space, and are invariant with respect to disparity
46171 under ideal circumstances. Establishing stereo
46172 correspondences then becomes a trivial lookup problem.
46173 We also show how to use intrinsic curves to match real
46174 images in the presence of noise, brightness bias,
46175 contrast fluctuations, and moderate geometric
46176 distortion, and we show how intrinsic curves can be
46177 used to deal with image ambiguity and occlusions. We
46178 carry out experiments on single-scanline matching to
46179 prove the feasibility of the approach and illustrate
46180 its main features.",
46181 acknowledgement = ack-nhfb,
46182 xxnumber = "CS-TR-95-1543",
46183 }
46184
46185 @TechReport{Basch:1995:DVB,
46186 author = "Julien Basch and Sanjeev Khanna and Rajeev Motwani",
46187 title = "On Diameter Verification and {Boolean} Matrix
46188 Multiplication",
46189 type = "Technical Report",
46190 number = "STAN-CS-95-1544",
46191 institution = inst-STAN-CS,
46192 address = inst-STAN-CS:adr,
46193 pages = "5",
46194 month = feb,
46195 year = "1995",
46196 bibdate = "Thu Nov 20 12:13:32 MST 2025",
46197 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
46198 URL = "http://www-db.stanford.edu/TR/CS-TR-95-1544.html",
46199 abstract = "We present a practical algorithm that verifies whether
46200 a graph has diameter 2 in time $ O(n^3 / \log^2 n) $. A
46201 slight adaptation of this algorithm yields a boolean
46202 matrix multiplication algorithm which runs in the same
46203 time bound; thereby allowing us to compute transitive
46204 closure and verification of the diameter of a graph for
46205 any constant $d$ in $ O(n^3 / \log^2 n)$ time.",
46206 acknowledgement = ack-nhfb,
46207 xxnumber = "CS-TR-95-1544",
46208 }
46209
46210 @TechReport{Khanna:1995:AAL,
46211 author = "Sanjeev Khanna and Rajeev Motwani and Frances F. Yao",
46212 title = "Approximation Algorithms for the Largest Common
46213 Subtree Problem",
46214 type = "Technical Report",
46215 number = "STAN-CS-95-1545",
46216 institution = inst-STAN-CS,
46217 address = inst-STAN-CS:adr,
46218 pages = "8",
46219 month = feb,
46220 year = "1995",
46221 bibdate = "Thu Nov 20 12:13:32 MST 2025",
46222 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
46223 URL = "http://www-db.stanford.edu/TR/CS-TR-95-1545.html",
46224 abstract = "The largest common subtree problem is to find a
46225 largest subtree which occurs as a common subgraph in a
46226 given collection of trees. We show that in case of
46227 bounded degree trees, we can achieve an approximation
46228 ratio of $ O((n* \log \log n) / \log^2 n) $. In case of
46229 unbounded degree nodes, we give an algorithm with
46230 approximation ratio $ O((n*(\log \log n)^2) / \log^2 n)
46231 $ when the trees are unlabeled. An approximation ratio
46232 of $ O((n*(\log \log n)^2) / \log^2 n) $ is also
46233 achieved for the case of labeled unbounded degree trees
46234 provided the number of distinct labels is $
46235 O(\log^{O(1)} n) $.",
46236 acknowledgement = ack-nhfb,
46237 xxnumber = "CS-TR-95-1545",
46238 }
46239
46240 @TechReport{Roy:1995:SRP,
46241 author = "H. Scott Roy",
46242 title = "Sharp, Reliable Predictions using Supervised Mixture
46243 Models",
46244 type = "Technical Report",
46245 number = "STAN-CS-95-1547",
46246 institution = inst-STAN-CS,
46247 address = inst-STAN-CS:adr,
46248 pages = "??",
46249 month = mar,
46250 year = "1995",
46251 bibdate = "Thu Nov 20 12:13:32 MST 2025",
46252 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
46253 URL = "http://www-db.stanford.edu/TR/CS-TR-95-1547.html",
46254 abstract = "This dissertation develops a new way to make
46255 probabilistic predictions from a database of examples.
46256 The method looks for regions in the data where
46257 different predictions are appropriate, and it naturally
46258 extends clustering algorithms that have been used with
46259 great success in exploratory data analysis. In
46260 probabilistic terms, the new method looks at the same
46261 models as before, but it only evaluates them for the
46262 conditional probability they assign to a single feature
46263 rather than the joint probability they assign to all
46264 features. A good models is therefore forced to classify
46265 the data in a way that is useful for a single, desired
46266 prediction, rather than just identifying the strongest
46267 overall pattern in the data. The results of this
46268 dissertation extend the clean, Bayesian approach of the
46269 unsupervised AutoClass system to the supervised
46270 learning problems common in everyday practice.
46271 Highlights include clear probabilistic semantics,
46272 prediction and use of discrete, categorical, and
46273 continuous data, priors that avoid the overfitting
46274 problem, an explicit noise model to identify unreliable
46275 predictions, and the ability to handle missing data. A
46276 computer implementation, MultiClass, validates the
46277 ideas with performance that exceeds neural nets,
46278 decision trees, and other current supervised machine
46279 learning systems.",
46280 acknowledgement = ack-nhfb,
46281 xxnumber = "CS-TR-95-1547",
46282 }
46283
46284 @TechReport{Gawlick:1995:RAC,
46285 author = "Rainer Gawlick and Anil Kamath and Serge Plotkin and
46286 K. G. Ramakrishnan",
46287 title = "Routing and Admission Control in General Topology
46288 Networks",
46289 type = "Technical Report",
46290 number = "STAN-CS-95-1548",
46291 institution = inst-STAN-CS,
46292 address = inst-STAN-CS:adr,
46293 pages = "19",
46294 month = may,
46295 year = "1995",
46296 bibdate = "Thu Nov 20 12:13:32 MST 2025",
46297 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
46298 URL = "http://www-db.stanford.edu/TR/CS-TR-95-1548.html",
46299 abstract = "Emerging high speed Broadband Integrated Services
46300 Digital Networks (B-ISDN) will carry traffic for
46301 services such as video-on-demand and video
46302 teleconferencing --- that require resource reservation
46303 along the path on which the traffic is sent. As a
46304 result, such networks will need effective {\em
46305 admission control} algorithms. The simplest approach is
46306 to use greedy admission control; in other words, accept
46307 every resource request that can be physically
46308 accommodated. However, in the context of symmetric loss
46309 networks (networks with a complete graph topology),
46310 non-greedy admission control has been shown to be more
46311 effective than greedy admission control. This paper
46312 suggests a new {\em non-greedy} routing and admission
46313 control algorithm for {\em general topology} networks.
46314 In contrast to previous algorithms, our algorithm does
46315 not require advance knowledge of the traffic patterns.
46316 Our algorithm combines key ideas from a recently
46317 developed theoretical algorithm with a stochastic
46318 analysis developed in the context of reservation-based
46319 algorithms. We evaluate the performance of our
46320 algorithm using extensive simulations on an existing
46321 commercial network topology and on variants of that
46322 topology. The simulations show that our algorithm
46323 outperforms greedy admission control over a broad range
46324 of network environments. The simulations also
46325 illuminate some important characteristics of our
46326 algorithm. For example, we characterize the importance
46327 of the implicit routing effects of the admission
46328 control part of our algorithm.",
46329 acknowledgement = ack-nhfb,
46330 xxnumber = "CS-TR-95-1548",
46331 }
46332
46333 @TechReport{Rutledge:1995:DSM,
46334 author = "Geoffrey William Rutledge",
46335 title = "Dynamic Selection of Models",
46336 type = "Technical Report",
46337 number = "STAN-CS-95-1549",
46338 institution = inst-STAN-CS,
46339 address = inst-STAN-CS:adr,
46340 pages = "188",
46341 month = mar,
46342 year = "1995",
46343 bibdate = "Thu Nov 20 12:13:32 MST 2025",
46344 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
46345 URL = "http://www-db.stanford.edu/TR/CS-TR-95-1549.html",
46346 abstract = "This dissertation develops an approach to high-stakes,
46347 model-based decision making under scarce computation
46348 resources, bringing together concepts and techniques
46349 from the disciplines of decision analysis, statistics,
46350 artificial intelligence, and simulation. A method is
46351 developed and implemented to solve a time-critical
46352 decision problem in the domain of critical-care
46353 medicine. This method selects models that balance the
46354 prediction accuracy and the need for rapid action.
46355 Under a computation-time constraint, the optimal model
46356 for a model-based control application is a model that
46357 maximizes the tradeoff of model benefit (a measure of
46358 how accurately the model predicts the effects of
46359 alternative control settings) and model cost (a measure
46360 of the length of the model-induced computation delay).
46361 This work describes a real-time algorithm that selects,
46362 from a graph of models (GoM), a model that is accurate
46363 and that is computable within a time constraint. The
46364 DSM algorithm is a metalevel reasoning strategy that
46365 relies on a dynamic-selection-of-models (DSM) metric to
46366 guide the search through a GoM that is organized
46367 according to the simplifying assumptions of the models.
46368 The DSM metric balances an estimate of the probability
46369 that a model will achieve the required prediction
46370 accuracy and the cost of the expected model-induced
46371 computation delay. The DSM algorithm provides an
46372 approach to automated reasoning about complex systems
46373 that applies at any level of computation-resource or
46374 computation-time constraint. The DSM algorithm is
46375 implemented in Konan, a program that performs dynamic
46376 selection of patient-specific models from a GoM of
46377 quantitative physiologic models. Konan selects models
46378 that allow a model-based control application (a
46379 ventilator-management advisor) to make real-time
46380 decisions for the control settings of a mechanical
46381 ventilator.",
46382 acknowledgement = ack-nhfb,
46383 xxnumber = "CS-TR-95-1549",
46384 }
46385
46386 @TechReport{Drakopoulos:1995:TDH,
46387 author = "John A. Drakopoulos",
46388 title = "Theory and Design of a Hybrid Pattern Recognition
46389 System",
46390 type = "Technical Report",
46391 number = "STAN-CS-95-1550",
46392 institution = inst-STAN-CS,
46393 address = inst-STAN-CS:adr,
46394 pages = "109",
46395 month = may,
46396 year = "1995",
46397 bibdate = "Thu Nov 20 12:13:32 MST 2025",
46398 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
46399 URL = "http://www-db.stanford.edu/TR/CS-TR-95-1550.html",
46400 abstract = "Pattern recognition methods can be divided into four
46401 different categories: statistical or probabilistic,
46402 structural, possibilistic or fuzzy, and neural methods.
46403 A formal analysis shows that there is a computational
46404 complexity versus representational power trade-off
46405 between probabilistic and possibilistic or fuzzy set
46406 measures, in general. Furthermore, sigmoidal theory
46407 shows that fuzzy set membership can be represented
46408 effectively by sigmoidal functions. Those results and
46409 the formalization of sigmoidal functions and
46410 subsequently multi-sigmoidal functions and neural
46411 networks led to the development of a hybrid pattern
46412 recognition system called tFPR. tFPR is a hybrid fuzzy,
46413 neural, and structural pattern recognition system that
46414 uses fuzzy sets to represent multi-variate pattern
46415 classes that can be either static or dynamic depending
46416 on time or some other parameter space. The membership
46417 functions of the fuzzy sets that represent pattern
46418 classes are modeled in three different ways. Simple
46419 sigmoidal configurations are used for simple patterns,
46420 a structural pattern recognition method is used for
46421 dynamic patterns, and multi-sigmoidal neural networks
46422 are used for pattern classes for which is difficult to
46423 obtain a formal definition. Although efficiency is a
46424 very important consideration in tFPR, the main issues
46425 are knowledge acquisition and knowledge representation
46426 (in terms of pattern class descriptions).",
46427 acknowledgement = ack-nhfb,
46428 xxnumber = "CS-TR-95-1550",
46429 }
46430
46431 @TechReport{McGuire:1995:TMC,
46432 author = "Hugh W. McGuire",
46433 title = "Two Methods for Checking Formulas of Temporal Logic",
46434 type = "Technical Report",
46435 number = "STAN-CS-95-1551",
46436 institution = inst-STAN-CS,
46437 address = inst-STAN-CS:adr,
46438 pages = "145",
46439 month = jun,
46440 year = "1995",
46441 bibdate = "Thu Nov 20 12:13:32 MST 2025",
46442 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
46443 URL = "http://www-db.stanford.edu/TR/CS-TR-95-1551.html",
46444 abstract = "This dissertation presents two methods for determining
46445 satisfiability or validity of formulas of Discrete
46446 Metric Annotated Linear Temporal Logic. This logic is
46447 convenient for representing and verifying properties of
46448 reactive and concurrent systems, including software and
46449 electronic circuits. The first method presented here is
46450 an algorithm for automatically deciding whether any
46451 given propositional temporal formula is satisfiable.
46452 This new algorithm efficiently extends the classical
46453 `semantic tableau'-algorithm to formulas with temporal
46454 operators which refer to the past or are metric. Then,
46455 whereas classical proofs of correctness for such
46456 algorithms are existential, the proof here is
46457 constructive; it shows that for any given formula being
46458 checked, any model of the formula is embedded in the
46459 tableau. The second method presented in this
46460 dissertation is a deduction-calculus for determining
46461 the validity of predicate temporal formulas. This new
46462 deduction-calculus employs a refined, conservative
46463 version of classical approaches involving translation
46464 from temporal forms to first-order expressions with
46465 time reified. Here, quantifications are elided, and
46466 addition is used instead of classical complicated
46467 combinations of comparisons. This scheme facilitates
46468 integration of powerful techniques such as
46469 associative-commutative unification and a Presburger
46470 decision-algorithm.",
46471 acknowledgement = ack-nhfb,
46472 xxnumber = "CS-TR-95-1551",
46473 }
46474
46475 @TechReport{Brafman:1995:ETR,
46476 author = "Ronen I. Brafman and Moshe Tennenholtz",
46477 title = "Embedded Teaching of Reinforcement Learners",
46478 type = "Technical Report",
46479 number = "STAN-CS-95-1552",
46480 institution = inst-STAN-CS,
46481 address = inst-STAN-CS:adr,
46482 pages = "??",
46483 month = jun,
46484 year = "1995",
46485 bibdate = "Thu Nov 20 12:13:32 MST 2025",
46486 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
46487 URL = "http://www-db.stanford.edu/TR/CS-TR-95-1552.html",
46488 abstract = "Knowledge plays an important role in an agent's
46489 ability to perform well in its environment. Teaching
46490 can be used to improve an agent's performance by
46491 enhancing its knowledge. We propose a specific model of
46492 teaching, which we call embedded teaching. An embedded
46493 teacher is an agent situated with a less knowledgeable
46494 ``student'' in a common environment. The teacher's goal
46495 is to lead the student to adopt a particular desired
46496 behavior. The teacher's ability to teach is affected by
46497 the dynamics of the common environment and may be
46498 limited by a restricted repertoire of actions or
46499 uncertainty about the outcome of actions; we explicitly
46500 represent these limitations as part of our model. In
46501 this paper, we address a number of theoretical issues
46502 including the characterization of a challenging
46503 embedded teaching domain and the computation of optimal
46504 teaching policies. We then incorporate these ideas in a
46505 series of experiments designed to evaluate our ability
46506 to teach two types of reinforcement learners.",
46507 acknowledgement = ack-nhfb,
46508 xxnumber = "CS-TR-95-1552",
46509 }
46510
46511 @TechReport{Srinivas:1995:MTA,
46512 author = "Sampath Srinivas",
46513 title = "Modeling techniques and algorithms for probabilistic
46514 model-based diagnosis and repair",
46515 type = "Technical Report",
46516 number = "STAN-CS-95-1553",
46517 institution = inst-STAN-CS,
46518 address = inst-STAN-CS:adr,
46519 pages = "??",
46520 month = jul,
46521 year = "1995",
46522 bibdate = "Thu Nov 20 12:13:32 MST 2025",
46523 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
46524 URL = "http://www-db.stanford.edu/TR/CS-TR-95-1553.html",
46525 abstract = "Model-based diagnosis centers on the use of a
46526 behavioral model of a system to infer diagnoses of
46527 anomalous behavior. For model-based diagnosis
46528 techniques to become practical, some serious problems
46529 in the modeling of uncertainty and in the tractability
46530 of uncertainty management have to be addressed. These
46531 questions include: How can we tractably generate
46532 diagnoses in large systems? Where do the prior
46533 probabilities of component failure come from when
46534 modeling a system? How do we tractably compute low-cost
46535 repair strategies? How can we do diagnosis even if only
46536 partial descriptions of device operation are available?
46537 This dissertation seeks to bring model-based diagnosis
46538 closer to being a viable technology by addressing these
46539 problems. We develop a set of tractable algorithms and
46540 modeling techniques that address each of the problems
46541 introduced above. Our approach synthesizes the
46542 techniques used in model-based diagnosis and techniques
46543 from the field of Bayesian networks.",
46544 acknowledgement = ack-nhfb,
46545 xxnumber = "CS-TR-95-1553",
46546 }
46547
46548 @TechReport{Lasher:1995:CST,
46549 author = "Rebecca Lasher and Vicky Reich and Greg Anderson",
46550 title = "The {Computer Science Technical Report (CS-TR)
46551 Project}: Considerations from the Library Perspective",
46552 type = "Technical Report",
46553 number = "STAN-CS-95-1554",
46554 institution = inst-STAN-CS,
46555 address = inst-STAN-CS:adr,
46556 pages = "27",
46557 month = jul,
46558 year = "1995",
46559 bibdate = "Thu Nov 20 12:13:32 MST 2025",
46560 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
46561 URL = "http://www-db.stanford.edu/TR/CS-TR-95-1554.html",
46562 abstract = "In 1992 the Advanced Research Projects Agency (ARPA)
46563 funded a three year grant to investigate the questions
46564 related to large-scale, distributed, digital libraries.
46565 The award focused research on Computer Science
46566 Technical Reports (CS-TR) and was granted to the
46567 Corporation for National Research Initiatives (CNRI)
46568 and five research universities. The ensuing
46569 collaborative research has focused on a broad spectrum
46570 of technical, social, and legal issues, and has
46571 encompassed all aspects of a very large, heterogeneous
46572 distributed digital library environment: acquisition,
46573 storage, organization, search, retrieval, display, use
46574 and intellectual property. The initial corpus of this
46575 digital library is a coherent digital collection of
46576 CS-TRs created at the five participating universities:
46577 Carnegie Mellon, Cornell, MIT, Stanford, and the
46578 University of California at Berkeley. The Corporation
46579 for National Research Initiatives serves as a
46580 collaborator and agent for the project. This technical
46581 report summarizes the accomplishments and collaborative
46582 efforts of the CS-TR project from a librarian's
46583 perspective; to do this we address the following
46584 questions: 1. Why do librarians and computer scientists
46585 make good research partners? 2. What has been learned?
46586 3. What new questions have been articulated? 4. How can
46587 the accomplishments be moved into a service
46588 environment? 5. What actions and activities might
46589 follow from this effort?",
46590 acknowledgement = ack-nhfb,
46591 xxnumber = "CS-TR-95-1554",
46592 }
46593
46594 @TechReport{Kiriha:1995:RTD,
46595 author = "Yoshiaki Kiriha",
46596 title = "Real-time Database Experiences in Network Management
46597 Application",
46598 type = "Technical Report",
46599 number = "STAN-CS-95-1555",
46600 institution = inst-STAN-CS,
46601 address = inst-STAN-CS:adr,
46602 pages = "??",
46603 month = sep,
46604 year = "1995",
46605 bibdate = "Thu Nov 20 12:13:32 MST 2025",
46606 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
46607 URL = "http://www-db.stanford.edu/TR/CS-TR-95-1555.html",
46608 abstract = "This report discusses our experiences with real-time
46609 databases in the context of a network management
46610 system, in particular a MIB (Management Information
46611 Base) implementation. We propose an active and
46612 real-time MIB (ART-MIB) architecture that utilizes a
46613 real-time database system. The ART-MIB contains a
46614 variety of modules, such as transaction manager, task
46615 manager, and resource manager. Among the
46616 functionalities provided by ART-MIB, we focus on
46617 transaction scheduling within a memory based real-time
46618 database system. For the developed ART-MIB prototype,
46619 we have evaluated two typical real-time transaction
46620 scheduling algorithms: earliest deadline first (EDF)
46621 and highest value first (HVF). The main results of our
46622 performance comparison show that EDF outperforms HVF
46623 under a low load; however, HVF outperforms EDF in an
46624 overload situation. Furthermore, the fact that the
46625 performance crossover point closely depends on the
46626 magnitude of the scheduler queue, has been validated.",
46627 acknowledgement = ack-nhfb,
46628 xxnumber = "CS-TR-95-1555",
46629 }
46630
46631 @TechReport{Kennedy:1995:SUW,
46632 author = "J. Robert {Kennedy, Jr.}",
46633 title = "Solving Unweighted and Weighted Bipartite Matching
46634 Problems in Theory and Practice",
46635 type = "Technical Report",
46636 number = "STAN-CS-95-1556",
46637 institution = inst-STAN-CS,
46638 address = inst-STAN-CS:adr,
46639 pages = "??",
46640 month = aug,
46641 year = "1995",
46642 bibdate = "Thu Nov 20 12:13:32 MST 2025",
46643 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
46644 URL = "http://www-db.stanford.edu/TR/CS-TR-95-1556.html",
46645 abstract = "The push-relabel method has been shown to be efficient
46646 for solving maximum flow and minimum cost flow problems
46647 in practice, and periodic global updates of dual
46648 variables have played an important role in the best
46649 implementations. Nevertheless, global updates had not
46650 been known to yield any theoretical improvement in
46651 running time. In this work, we study techniques for
46652 implementing push-relabel algorithms to solve bipartite
46653 matching and assignment problems. We show that global
46654 updates yield a theoretical improvement in the
46655 bipartite matching and assignment contexts, and we
46656 develop a suite of efficient cost-scaling push-relabel
46657 implementations to solve assignment problems. For
46658 bipartite matching, we show that a push-relabel
46659 algorithm using global updates matches the best time
46660 bound known (roughly the number of edges times the
46661 square root of the number of nodes --- better for dense
46662 graphs) and performs worse by a factor of the square
46663 root of the number of nodes without the updates. We
46664 present a similar result for the assignment problem,
46665 for which an algorithm that assumes integer costs has
46666 running time asymptotically dominated by the number of
46667 edges times the number of nodes times a scaling factor
46668 logarithmic in the number of nodes and the largest
46669 magnitude of an edge cost in the problem. The bound we
46670 obtain matches the best cost-scaling bound known. We
46671 develop cost-scaling push-relabel implementations that
46672 take advantage of the assignment problem's special
46673 structure, and compare our codes against the best codes
46674 from the literature. The results show that the
46675 push-relabel method is very promising for practical
46676 use.",
46677 acknowledgement = ack-nhfb,
46678 xxnumber = "CS-TR-95-1556",
46679 }
46680
46681 @TechReport{Wolf:1995:HMS,
46682 author = "Elizabeth Susan Wolf",
46683 title = "Hierarchical Models of Synchronous Circuits for Formal
46684 Verification and Substitution",
46685 type = "Technical Report",
46686 number = "STAN-CS-95-1557",
46687 institution = inst-STAN-CS,
46688 address = inst-STAN-CS:adr,
46689 pages = "210",
46690 month = oct,
46691 year = "1995",
46692 bibdate = "Thu Nov 20 12:13:32 MST 2025",
46693 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
46694 URL = "http://www-db.stanford.edu/TR/CS-TR-95-1557.html",
46695 abstract = "We develop a mathematical model of synchronous
46696 sequential circuits that supports both formal
46697 hierarchical verification and substitution. We have
46698 implemented and proved the correctness of automatic
46699 decision procedures for both of these applications
46700 using these models. For hierarchical verification, we
46701 model synchronous circuit specifications and
46702 implementations uniformly. Each of these descriptions
46703 provides both a behavioral and a structural view of the
46704 circuit or specification being modeled. We compare the
46705 behavior of a circuit model to a requirements
46706 specification in order to determine whether the circuit
46707 is an acceptable implementation of the specification.
46708 Our structural view of a circuit provides the
46709 capability to plug in one circuit component in place of
46710 another. We derive a requirements specification for the
46711 acceptable replacement components, in terms of the
46712 desired behavior of the full circuit. We also support
46713 nondeterministic specifications, which capture the
46714 minimum requirements of a circuit. Previous formalisms
46715 have relied on syntactic methods for distinguishing
46716 apparent from actual unlatched feedback loops in
46717 hierarchical hardware designs. However, these methods
46718 are not applicable to nondeterministic models. Our
46719 model of the behavior of a synchronous circuit within a
46720 single clock cycle provides a semantic method to
46721 identify cyclic dependencies even in the presence of
46722 nondeterminism.",
46723 acknowledgement = ack-nhfb,
46724 xxnumber = "CS-TR-95-1557",
46725 }
46726
46727 @TechReport{Greenwald:1995:DAF,
46728 author = "Michael B. Greenwald and Sandeep K. Singhal and
46729 Jonathan R. Stone and David R. Cheriton",
46730 title = "Designing an Academic Firewall: Policy, Practice and
46731 Experience With {SURF}",
46732 type = "Technical Report",
46733 number = "STAN-CS-95-1558",
46734 institution = inst-STAN-CS,
46735 address = inst-STAN-CS:adr,
46736 pages = "??",
46737 month = dec,
46738 year = "1995",
46739 bibdate = "Thu Nov 20 12:13:32 MST 2025",
46740 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
46741 URL = "http://www-db.stanford.edu/TR/CS-TR-95-1558.html",
46742 abstract = "Corporate network firewalls are well-understood and
46743 are becoming commonplace. These firewalls establish a
46744 security perimeter that aims to block (or heavily
46745 restrict) both incoming and outgoing network
46746 communication. We argue that these firewalls are
46747 neither effective nor appropriate for academic or
46748 corporate research environments needing to maintain
46749 information security while still supporting the free
46750 exchange of ideas. In this paper, we present the
46751 Stanford University Research Firewall (SURF), a network
46752 firewall design that is suitable for a research
46753 environment. While still protecting information and
46754 computing resources behind the firewall, this firewall
46755 is less restrictive of outward information flow than
46756 the traditional model; can be easily deployed; and can
46757 give internal users the illusion of unrestricted
46758 e-mail, anonymous FTP, and WWW connectivity to the
46759 greater Internet. Our experience demonstrates that an
46760 adequate firewall for a research environment can be
46761 constructed for minimal cost using off-the-shelf
46762 software and hardware components.",
46763 acknowledgement = ack-nhfb,
46764 xxnumber = "CS-TR-95-1558",
46765 }
46766
46767 @TechReport{Kavraki:1995:NEP,
46768 author = "Lydia E. Kavraki",
46769 title = "On the number of equilibrium placements of mass
46770 distributions in elliptic potential fields",
46771 type = "Technical Report",
46772 number = "STAN-CS-95-1559",
46773 institution = inst-STAN-CS,
46774 address = inst-STAN-CS:adr,
46775 pages = "??",
46776 month = dec,
46777 year = "1995",
46778 bibdate = "Thu Nov 20 12:13:32 MST 2025",
46779 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
46780 URL = "http://www-db.stanford.edu/TR/CS-TR-95-1559.html",
46781 abstract = "Recent papers have demonstrated the use of force
46782 fields for mechanical part orientation. The force field
46783 is realized on a plane on which the part is placed. The
46784 forces exerted on the part's contact surface translate
46785 and rotate the part to an equilibrium orientation. Part
46786 manipulation by force fields is very attractive since
46787 it requires no sensing. We describe force fields that
46788 result from elliptic potentials and induce only 2
46789 stable equilibrium orientations for most parts. The
46790 proposed fields represent a considerable improvement
46791 over previously developed force fields which produced
46792 O(n) equilibria for polygonal parts with n vertices.
46793 The successful realization of these force fields could
46794 significantly affect part manipulation in industrial
46795 automation.",
46796 acknowledgement = ack-nhfb,
46797 xxnumber = "CS-TR-95-1559",
46798 }
46799
46800 @TechReport{Kohavi:1995:WPE,
46801 author = "Ron Kohavi",
46802 title = "Wrappers for Performance Enhancements and Oblivious
46803 Decision Graphs",
46804 type = "Technical Report",
46805 number = "STAN-CS-95-1560",
46806 institution = inst-STAN-CS,
46807 address = inst-STAN-CS:adr,
46808 pages = "??",
46809 month = sep,
46810 year = "1995",
46811 bibdate = "Thu Nov 20 12:13:32 MST 2025",
46812 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
46813 URL = "http://www-db.stanford.edu/TR/CS-TR-95-1560.html",
46814 abstract = "In this doctoral dissertation, we study three basic
46815 problems in machine learning and two new hypothesis
46816 spaces with corresponding learning algorithms. The
46817 problems we investigate are: accuracy estimation,
46818 feature subset selection, and parameter tuning. The
46819 latter two problems are related and are studied under
46820 the wrapper approach. The hypothesis spaces we
46821 investigate are: decision tables with a default
46822 majority rule (DTMs) and oblivious read-once decision
46823 graphs (OODGs). For accuracy estimation, we investigate
46824 cross-validation and the 0.632 bootstrap. We show
46825 examples where they fail and conduct a large scale
46826 study comparing them. We conclude that repeated runs of
46827 five-fold cross-validation give a good tradeoff between
46828 bias and variance for the problem of model selection
46829 used in later chapters. We define the wrapper approach
46830 and use it for feature subset selection and parameter
46831 tuning. We relate definitions of feature relevancy to
46832 the set of optimal features, which is defined with
46833 respect to both a concept and an induction algorithm.
46834 The wrapper approach requires a search space,
46835 operators, a search engine, and an evaluation function.
46836 We investigate all of them in detail and introduce
46837 compound operators for feature subset selection.
46838 Finally, we abstract the search problem into search
46839 with probabilistic estimates. We introduce decision
46840 tables with a default majority rule (DTMs) to test the
46841 conjecture that feature subset selection is a very
46842 powerful bias. The accuracy of induced DTMs is
46843 surprisingly powerful, and we concluded that this bias
46844 is extremely important for many real-world datasets. We
46845 show that the resulting decision tables are very small
46846 and can be succinctly displayed. We study properties of
46847 oblivious read-once decision graphs (OODGs) and show
46848 that they do not suffer from some inherent limitations
46849 of decision trees. We describe a general framework for
46850 constructing OODGs bottom-up and specialize it using
46851 the wrapper approach. We show that the graphs produced
46852 are use less features than C4.5, the state-of-the-art
46853 decision tree induction algorithm, and are usually
46854 easier for humans to comprehend.",
46855 acknowledgement = ack-nhfb,
46856 xxnumber = "CS-TR-95-1560",
46857 }
46858
46859 @TechReport{Hu:1995:TEF,
46860 author = "Alan John Hu",
46861 title = "Techniques for Efficient Formal Verification Using
46862 Binary Decision Diagrams",
46863 type = "Technical Report",
46864 number = "STAN-CS-95-1561",
46865 institution = inst-STAN-CS,
46866 address = inst-STAN-CS:adr,
46867 pages = "??",
46868 month = dec,
46869 year = "1995",
46870 bibdate = "Thu Nov 20 12:13:32 MST 2025",
46871 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
46872 URL = "http://www-db.stanford.edu/TR/CS-TR-95-1561.html",
46873 abstract = "The appeal of automatic formal verification is that
46874 it's automatic --- minimal human labor and expertise
46875 should be needed to get useful results and
46876 counterexamples. BDD(binary decision diagram)-based
46877 approaches have promised to allow automatic
46878 verification of complex, real systems. For large
46879 classes of problems, however, (including many
46880 distributed protocols, multiprocessor systems, and
46881 network architectures) this promise has yet to be
46882 fulfilled. Indeed, the few successes have required
46883 extensive time and effort from sophisticated
46884 researchers in the field. This thesis identifies
46885 several common obstacles to BDD-based automatic formal
46886 verification and proposes techniques to overcome them
46887 by avoiding building certain problematic BDDs needed in
46888 the standard approaches and by exploiting automatically
46889 generated and user-supplied don't-care information.
46890 Several examples illustrate the effectiveness of the
46891 new techniques in enlarging the envelope of problems
46892 that can routinely be verified automatically.",
46893 acknowledgement = ack-nhfb,
46894 xxnumber = "CS-TR-95-1561",
46895 }
46896
46897 @TechReport{Bjorner:1995:SST,
46898 author = "Nikolaj Bjorner and Anca Browne and Eddie Chang and
46899 Michael Colon and Arjun Kapur and Zohar Manna and Henny
46900 B. Sipma and Tomas E. Uribe",
46901 title = "{STeP}: The {Stanford Temporal Prover} (Educational
46902 Release) User's Manual",
46903 type = "Technical Report",
46904 number = "STAN-CS-95-1562",
46905 institution = inst-STAN-CS,
46906 address = inst-STAN-CS:adr,
46907 pages = "46",
46908 month = nov,
46909 year = "1995",
46910 bibdate = "Thu Nov 20 12:13:32 MST 2025",
46911 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
46912 URL = "http://www-db.stanford.edu/TR/CS-TR-95-1562.html",
46913 abstract = "The STeP (Stanford Temporal Prover) system supports
46914 the computer-aided verification of reactive and
46915 real-time systems. It combines deductive methods with
46916 algorithmic techniques to allow the verification of a
46917 broad class of systems, including infinite-state
46918 systems and parameterized N-process programs. STeP
46919 provides the visual language of verification diagrams
46920 that allow the user to construct proofs hierarchically,
46921 starting from a high-level proof sketch. The
46922 availability of automatically generated bottom-up and
46923 top-down invariants and an integrated suite of decision
46924 procedures allow most verification conditions to be
46925 checked without user intervention.",
46926 acknowledgement = ack-nhfb,
46927 xxnumber = "CS-TR-95-1562",
46928 }
46929
46930 @TechReport{Silberschatz:1996:DRA,
46931 author = "Avi Silberschatz and Michael Stonebraker and Jeffrey
46932 D. Ullman",
46933 title = "Database Research: Achievements and Opportunities into
46934 the 21st Century",
46935 type = "Technical Report",
46936 number = "STAN-CS-96-1563",
46937 institution = inst-STAN-CS,
46938 address = inst-STAN-CS:adr,
46939 pages = "??",
46940 month = feb,
46941 year = "1996",
46942 bibdate = "Thu Nov 20 12:13:32 MST 2025",
46943 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
46944 URL = "http://www-db.stanford.edu/TR/CS-TR-96-1563.html",
46945 abstract = "In May, 1995 an NSF workshop on the future of database
46946 management systems research was convened. This paper
46947 reports the conclusions of that meeting. Among the most
46948 important directions for future DBMS research
46949 recommended by the panel are: support for multimedia
46950 objects; managing distributed and loosely coupled
46951 information, as on the world-wide web; supporting new
46952 database applications such as data mining and
46953 warehousing; workflow and other complex
46954 transaction-management problems, and enhancing the
46955 ease-of-use of DBMS's for both users and system
46956 managers.",
46957 acknowledgement = ack-nhfb,
46958 xxnumber = "CS-TR-96-1563",
46959 }
46960
46961 @TechReport{Ohno-Machado:1996:MAN,
46962 author = "Lucila Ohno-Machado",
46963 title = "Medical Applications of Neural Networks: Connectionist
46964 Models of Survival",
46965 type = "Technical Report",
46966 number = "STAN-CS-96-1564",
46967 institution = inst-STAN-CS,
46968 address = inst-STAN-CS:adr,
46969 pages = "??",
46970 month = mar,
46971 year = "1996",
46972 bibdate = "Thu Nov 20 12:13:32 MST 2025",
46973 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
46974 URL = "http://www-db.stanford.edu/TR/CS-TR-96-1564.html",
46975 abstract = "Although neural networks have been applied to medical
46976 problems in recent years, their applicability has been
46977 limited for a variety of reasons. One of those barriers
46978 has been the problem of recognizing rare categories. In
46979 this dissertation, I demonstrate, and prove the utility
46980 of, a new method for tackling this problem. In
46981 particular, I have developed a method that allows the
46982 recognition of rare categories with high sensitivity
46983 and specificity, and will show that it is practical and
46984 robust. This method involves the construction of
46985 sequential neural networks. Rare categories occur and
46986 must be learned if practical application of
46987 neural-network technology is to be achieved. Survival
46988 analysis is one area in which this problem appears. In
46989 this work, I test the hypotheses that (1) sequential
46990 systems of neural networks produce results that are
46991 more accurate (in terms of calibration and resolution)
46992 than nonsequential neural networks; and (2) in certain
46993 circumstances, sequential neural networks produce more
46994 accurate estimates of survival time than Cox
46995 proportional hazards and logistic regression models. I
46996 use two sets of data to test the hypotheses: (1) a data
46997 set of HIV+ patients; and (2) a data set of patients
46998 followed prospectively for the development of cardiac
46999 conditions. I show that a neural network model can
47000 predict death due to AIDS more accurately than a Cox
47001 proportional hazards model. Furthermore, I show that a
47002 sequential neural network model is more accurate than a
47003 standard neural network model. I show that the
47004 predictions of logistic regression and neural networks
47005 are not significantly different, but that any of these
47006 models used sequentially is more accurate than its
47007 standard counterpart.",
47008 acknowledgement = ack-nhfb,
47009 xxnumber = "CS-TR-96-1564",
47010 }
47011
47012 @TechReport{Sujansky:1996:FMB,
47013 author = "Walter Sujansky",
47014 title = "A Formal Model for Bridging Heterogeneous Relational
47015 Databases in Clinical Medicine",
47016 type = "Technical Report",
47017 number = "STAN-CS-96-1565",
47018 institution = inst-STAN-CS,
47019 address = inst-STAN-CS:adr,
47020 pages = "??",
47021 month = apr,
47022 year = "1996",
47023 bibdate = "Thu Nov 20 12:13:32 MST 2025",
47024 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
47025 URL = "http://www-db.stanford.edu/TR/CS-TR-96-1565.html",
47026 abstract = "This document describes the results of my thesis
47027 research, which focused on developing a standard query
47028 interface to heterogeneous clinical databases. The
47029 high-level goal of this work was to *insulate* the
47030 developers of clinical computer applications from the
47031 implementation details of clinical databases, thereby
47032 facilitating the *sharing* of clinical computer
47033 applications across institutions with different
47034 database implementations. Most clinical databases store
47035 information about patients' diagnoses, laboratory
47036 results, medication orders, drug allergies, and
47037 demographic background. These data are valuable as the
47038 inputs to computer applications that provide real-time
47039 decision support, monitor the quality of care, and
47040 analyze data for research purposes. Clinical databases
47041 at different institutions, however, vary significantly
47042 in the way the databases model, represent, and retrieve
47043 clinical data. This database heterogeneity makes it
47044 impossible for a single computer application to
47045 retrieve data from the clinical databases of various
47046 institutions because the database queries included in
47047 the application must be formulated differently for each
47048 institution. Therefore, database heterogeneity makes it
47049 difficult to share computer applications across
47050 institutions with different database implementations.
47051 In my work, I have developed an *abstract* model of
47052 clinical data and an *abstract* query language that
47053 allow the developers of computer applications to
47054 formulate queries independently of the
47055 institution-specific features of clinical databases. I
47056 have also developed a database mapping language and a
47057 formal query-translation method that automatically
47058 translate the abstract queries that appear in
47059 applications into equivalent institution-specific
47060 queries. This framework ostensibly allows copies of a
47061 single computer application to be distributed to
47062 multiple institutions and to be customized
47063 automatically at each of the institutions such that the
47064 queries in each copy of the application can retrieve
47065 data from the local clinical database. This
47066 dissertation formally describes the abstract data
47067 model, the abstract query language, the mapping
47068 language, and the translation algorithm. It also
47069 presents the results of a formal evaluation that I
47070 performed to assess the feasibility and utility of this
47071 approach for sharing clinical computer applications.",
47072 acknowledgement = ack-nhfb,
47073 xxnumber = "CS-TR-96-1565",
47074 }
47075
47076 @TechReport{Manna:1996:CTS,
47077 author = "Zohar Manna and Amir Pnueli",
47078 title = "Clocked Transition Systems",
47079 type = "Technical Report",
47080 number = "STAN-CS-96-1566",
47081 institution = inst-STAN-CS,
47082 address = inst-STAN-CS:adr,
47083 pages = "??",
47084 month = apr,
47085 year = "1996",
47086 bibdate = "Thu Nov 20 12:13:32 MST 2025",
47087 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
47088 URL = "http://www-db.stanford.edu/TR/CS-TR-96-1566.html",
47089 abstract = "This paper presents a new computational model for
47090 real-time systems, called the clocked transition system
47091 model. The model is a development of our previous timed
47092 transition model, where some of the changes are
47093 inspired by the model of timed automata. The new model
47094 leads to a simpler style of temporal specification and
47095 verification, requiring no extension of the temporal
47096 language. For verifying safety properties, we present a
47097 run-preserving reduction from the new real-time model
47098 to the untimed model of fair transition systems. This
47099 reduction allows the (re)use of safety verification
47100 methods and tools, developed for untimed reactive
47101 systems, for proving safety properties of real-time
47102 systems.",
47103 acknowledgement = ack-nhfb,
47104 xxnumber = "CS-TR-96-1566",
47105 }
47106
47107 @TechReport{Anuchitanukul:1996:SRP,
47108 author = "Anuchit Anuchitanukul",
47109 title = "Synthesis of Reactive Programs",
47110 type = "Technical Report",
47111 number = "STAN-CS-96-1567",
47112 institution = inst-STAN-CS,
47113 address = inst-STAN-CS:adr,
47114 pages = "??",
47115 month = apr,
47116 year = "1996",
47117 bibdate = "Thu Nov 20 12:13:32 MST 2025",
47118 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
47119 URL = "http://www-db.stanford.edu/TR/CS-TR-96-1567.html",
47120 abstract = "We study various problems of synthesizing reactive
47121 programs. A reactive program is a program whose
47122 behaviors are not merely functional relationships
47123 between inputs and outputs, but sequences of actions as
47124 well as interactions between the program and its
47125 environment. The goal of program synthesis in general
47126 is to find an implementation of a program such that the
47127 behaviors of the implementation satisfy a given
47128 specification. The reactive behaviors that we study are
47129 omega-regular infinite sequences and regular finite
47130 sequences. The domain of the implementation is (finite)
47131 transition systems for closed system synthesis, and
47132 transition system modules for open system synthesis. We
47133 consider various solutions, e.g. basic, maximal,
47134 modular and exact, for any particular subclasses of the
47135 implementation language and investigate how
47136 characteristics of the program such as fairness, number
47137 of processes and composition operations, affect the
47138 synthesis algorithm. In addition to the
47139 automata-theoretic algorithms, we give a synthesis
47140 algorithm which synthesizes a program directly from the
47141 linear-time temporal logic ETL.",
47142 acknowledgement = ack-nhfb,
47143 xxnumber = "CS-TR-96-1567",
47144 }
47145
47146 @TechReport{Cazals:1996:ACI,
47147 author = "Frederic Cazals and G. D. S. Ramkumar",
47148 title = "Algorithms for computing intersection and union of
47149 toleranced polygons with applications",
47150 type = "Technical Report",
47151 number = "STAN-CS-96-1568",
47152 institution = inst-STAN-CS,
47153 address = inst-STAN-CS:adr,
47154 pages = "??",
47155 month = apr,
47156 year = "1996",
47157 bibdate = "Thu Nov 20 12:13:32 MST 2025",
47158 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
47159 URL = "http://www-db.stanford.edu/TR/CS-TR-96-1568.html",
47160 abstract = "Since mechanical operations are performed only up to a
47161 certain precision, the geometry of parts involved in
47162 real life products is never known precisely.
47163 Nevertheless, operations on toleranced objects have not
47164 been studied extensively. In this paper, we initiate a
47165 study of the analysis of the union and intersection of
47166 toleranced simple polygons. We provide a practical and
47167 efficient algorithm that stores in an implicit data
47168 structure the information necessary to answer a request
47169 for specific values of the tolerances without
47170 performing a computation from scratch. If the polygons
47171 are of sizes $m$ and $n$, and $s$ is the number of
47172 intersections between edges occurring for all the
47173 combinations of tolerance values, the pre-processed
47174 data structure takes $ O(s)$ space and the algorithm
47175 that computes a union/intersection from it takes $ O((n
47176 + m) \log (s) + k' + k \log (k))$ time where $k$ is the
47177 number of vertices of the union/intersection and $ k
47178 \leq k' \leq s$. Although the algorithm is not output
47179 sensitive, we show that the expectations of $k$ and $
47180 k'$ remain within a constant factor tau, a function of
47181 the input geometry. Finally, we list interesting
47182 applications of the algorithms related to feasibility
47183 of assembly and assembly sequencing of real
47184 assemblies.",
47185 acknowledgement = ack-nhfb,
47186 xxnumber = "CS-TR-96-1568",
47187 }
47188
47189 @TechReport{Unruh:1996:UAA,
47190 author = "Amy Unruh",
47191 title = "Using Automatic Abstraction for Problem-Solving and
47192 Learning",
47193 type = "Technical Report",
47194 number = "STAN-CS-96-1569",
47195 institution = inst-STAN-CS,
47196 address = inst-STAN-CS:adr,
47197 pages = "??",
47198 month = apr,
47199 year = "1996",
47200 bibdate = "Thu Nov 20 12:13:32 MST 2025",
47201 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
47202 URL = "http://www-db.stanford.edu/TR/CS-TR-96-1569.html",
47203 abstract = "Abstraction is a powerful tool for controlling search
47204 combinatorics. This research presents a framework for
47205 automatic abstraction planning, and a family of
47206 associated abstraction methods, called SPATULA. The
47207 framework provides a structure within which different
47208 parameterized methods for automatic abstraction can be
47209 instantiated to generate abstraction planning behavior,
47210 and provides an integrated environment for abstract
47211 problem-solving and learning. A core idea underlying
47212 the abstraction techniques is that abstraction can
47213 arise as an obviation response to impasses in planning.
47214 Abstraction is performed at problem-solving time with
47215 respect to impasses in the current problem context, and
47216 thus the planner generates abstractions in response to
47217 specific situations. This approach is used to reduce
47218 the cost of lookahead evaluation searches, by
47219 performing abstract search in problem spaces which are
47220 automatically abstracted from the ground spaces during
47221 search. New search control rules are learned during
47222 abstract search; they constitute an abstract plan used
47223 in future situations, and produce an emergent
47224 multi-level abstraction behavior. The abstraction
47225 method has been implemented and evaluated. It has been
47226 shown to: reduce planning time, while still yielding
47227 good solutions; reduce learning time; and increase the
47228 effectiveness of learned rules by enabling them to
47229 transfer more widely.",
47230 acknowledgement = ack-nhfb,
47231 xxnumber = "CS-TR-96-1569",
47232 }
47233
47234 @TechReport{Hasan:1996:OSQ,
47235 author = "Waqar Hasan",
47236 title = "Optimization of {SQL} Queries for Parallel Machines",
47237 type = "Technical Report",
47238 number = "STAN-CS-96-1570",
47239 institution = inst-STAN-CS,
47240 address = inst-STAN-CS:adr,
47241 pages = "??",
47242 month = may,
47243 year = "1996",
47244 bibdate = "Thu Nov 20 12:13:32 MST 2025",
47245 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
47246 URL = "http://www-db.stanford.edu/TR/CS-TR-96-1570.html",
47247 abstract = "Parallel execution offers a method for reducing the
47248 response time of queries against large databases. We
47249 address the problem of parallel query optimization:
47250 Given a declarative SQL query, find a procedural
47251 parallel plan that delivers the query result in minimal
47252 time. We develop optimization algorithms using models
47253 that incorporate both sources and obstacles to speedup.
47254 We address independent, pipelined and partitioned
47255 parallelism. We incorporate inherent constraints on
47256 available parallelism and the extra cost of parallel
47257 execution. Our models are motivated by experiments with
47258 NonStop SQL, a commercial parallel DBMS. We adopt a
47259 two-phase approach to parallel query optimization: JOQR
47260 (join ordering and query rewrite), followed by
47261 parallelization. JOQR minimizes total work. Then,
47262 parallelization spreads work among processors to
47263 minimize response time. For JOQR, we model
47264 communication costs and abstract physical
47265 characteristics of data as colors. We devise tree
47266 coloring and reordering algorithms that are efficient
47267 and optimal. We model parallelization as scheduling a
47268 tree whose nodes represent operators and edges
47269 represent parallel/precedence constraints.
47270 Computation/communication costs are represented as
47271 node/edge weights. We prove worst-case bounds on the
47272 performance ratios of our algorithms and measure
47273 average cases using simulation. Our results enable the
47274 construction of SQL compilers that effectively exploit
47275 parallel machines.",
47276 acknowledgement = ack-nhfb,
47277 xxnumber = "CS-TR-96-1570",
47278 }
47279
47280 @TechReport{DeAlfaro:1996:FVP,
47281 author = "Luca DeAlfaro",
47282 title = "Formal Verification of Performance and Reliability of
47283 Real-Time Systems",
47284 type = "Technical Report",
47285 number = "STAN-CS-96-1571",
47286 institution = inst-STAN-CS,
47287 address = inst-STAN-CS:adr,
47288 pages = "??",
47289 month = jun,
47290 year = "1996",
47291 bibdate = "Thu Nov 20 12:13:32 MST 2025",
47292 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
47293 URL = "http://www-db.stanford.edu/TR/CS-TR-96-1571.html",
47294 abstract = "In this paper we propose a methodology for the
47295 specification and verification of performance and
47296 reliability properties of real-time systems within the
47297 framework of temporal logic. The methodology is based
47298 on the system model of stochastic real-time systems
47299 (SRTSs), and on branching-time temporal logics that are
47300 extensions of the probabilistic logics pCTL and pCTL*.
47301 SRTSs are discrete-time transition systems that can
47302 model both probabilistic and nondeterministic behavior.
47303 The specification language extends the branching-time
47304 logics pCTL and pCTL* by introducing an operator to
47305 express bounds on the average time between events. We
47306 present model-checking algorithms for the algorithmic
47307 verification of system specifications, and we discuss
47308 their complexity.",
47309 acknowledgement = ack-nhfb,
47310 xxnumber = "CS-TR-96-1571",
47311 }
47312
47313 @TechReport{Geddis:1996:CNH,
47314 author = "Donald F. Geddis",
47315 title = "Caching and Non-{Horn} Inference in Model Elimination
47316 Theorem Provers",
47317 type = "Technical Report",
47318 number = "STAN-CS-96-1572",
47319 institution = inst-STAN-CS,
47320 address = inst-STAN-CS:adr,
47321 pages = "??",
47322 month = jun,
47323 year = "1996",
47324 bibdate = "Thu Nov 20 12:13:32 MST 2025",
47325 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
47326 URL = "http://www-db.stanford.edu/TR/CS-TR-96-1572.html",
47327 abstract = "Caching in an inference procedure holds the promise of
47328 replacing exponential search with constant-time lookup,
47329 at a cost of slightly-increased overhead for each node
47330 expansion. Caching will be useful if subgoals are
47331 repeated often enough during proofs. In experiments on
47332 solving queries using a backward chainer on Horn
47333 theories, caching appears to be very helpful on
47334 average. When trying to extend this success to
47335 first-order theories, however, intuition suggests that
47336 subgoal caches are no longer useful. The cause is that
47337 complete first-order backward chaining requires
47338 goal-goal resolutions in addition to resolutions with
47339 the database, and this introduces a context-sensitivity
47340 into the proofs for a subgoal. A cache is only feasible
47341 if the solutions are independent of context, so that
47342 they may be copied from one part of the space to
47343 another. It is shown here that a full exploration of a
47344 subgoal in one context actually provides complete
47345 information about the solutions to the same subgoal in
47346 all other contexts of the proof. In a straightforward
47347 way, individual solutions from one context may be
47348 copied over directly. More importantly, non-Horn
47349 failure caching is also feasible, so no additional
47350 solutions in the new context (that might affect the
47351 query) are possible and therefore there is no need to
47352 re-explore the space in the new context. Thus most Horn
47353 clause caching schemes may be used with minimal changes
47354 in a non-Horn setting. In addition, a new Horn clause
47355 caching scheme is proposed: postponement caching. This
47356 new scheme involves exploring the inference space as a
47357 graph instead of as a tree, so that a given literal
47358 will only occur once in the proof space. Despite the
47359 previous extension of failure caching to non-Horn
47360 theories, postponement caching is incomplete in the
47361 non-Horn case. A counterexample is presented, and
47362 possible enhancements to reclaim completeness are
47363 investigated.",
47364 acknowledgement = ack-nhfb,
47365 xxnumber = "CS-TR-96-1572",
47366 }
47367
47368 @TechReport{Birchfield:1996:DDP,
47369 author = "Stan Birchfield and Carlo Tomasi",
47370 title = "Depth Discontinuities by Pixel-To-Pixel Stereo",
47371 type = "Technical Report",
47372 number = "STAN-CS-96-1573",
47373 institution = inst-STAN-CS,
47374 address = inst-STAN-CS:adr,
47375 pages = "??",
47376 month = jul,
47377 year = "1996",
47378 bibdate = "Thu Nov 20 12:13:32 MST 2025",
47379 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
47380 URL = "http://www-db.stanford.edu/TR/CS-TR-96-1573.html",
47381 abstract = "This report describes a two-pass binocular stereo
47382 algorithm that is specifically geared towards the
47383 detection of depth discontinuities. In the first pass,
47384 introduced in part I of the report, stereo matching is
47385 performed independently on each epipolar pair for
47386 maximum efficiency. In the second pass, described in
47387 part II, disparity information is propagated between
47388 the scanlines. Part I. Our stereo algorithm explicitly
47389 matches the pixels in the two images, leaving occluded
47390 pixels unpaired. Matching is based upon intensity alone
47391 without utilizing windows. Since the algorithm prefers
47392 piecewise constant disparity maps, it sacrifices depth
47393 accuracy for the sake of crisp boundaries, leading to
47394 precise localization of the depth discontinuities.
47395 Three features of the algorithm are worth noting: (1)
47396 unlike most stereo algorithms, it does not require
47397 texture throughout the images, making it useful in
47398 unmodified indoor settings, (2) it uses a measure of
47399 pixel dissimilarity that is provably insensitive to
47400 sampling, and (3) it prunes bad nodes during the
47401 search, resulting in a running time that is faster than
47402 that of standard dynamic programming. Part II. After
47403 the scanlines are processed independently, the
47404 disparity map is postprocessed, leading to more
47405 accurate disparities and depth discontinuities. Both
47406 the algorithm and the postprocessor are fast, producing
47407 a dense disparity map in about 1.5 microseconds per
47408 pixel per disparity on a workstation. Results on five
47409 stereo pairs are given.",
47410 acknowledgement = ack-nhfb,
47411 xxnumber = "CS-TR-96-1573",
47412 }
47413
47414 @TechReport{Singhal:1996:ERM,
47415 author = "Sandeep K. Singhal",
47416 title = "Effective Remote Modeling in Large-Scale Distributed
47417 Simulation and Visualization Environments",
47418 type = "Technical Report",
47419 number = "STAN-CS-96-1574",
47420 institution = inst-STAN-CS,
47421 address = inst-STAN-CS:adr,
47422 pages = "??",
47423 month = sep,
47424 year = "1996",
47425 bibdate = "Thu Nov 20 12:13:32 MST 2025",
47426 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
47427 URL = "http://www-db.stanford.edu/TR/CS-TR-96-1574.html",
47428 abstract = "A Distributed Interactive Simulation provides the
47429 illusion of a single, coherent virtual world to a group
47430 of users located at different machines connected by a
47431 network. Networked virtual environments are used for
47432 multiplayer video games, military and industrial
47433 training, and collaborative engineering. Network
47434 bandwidth, network latency, and host processing power
47435 limit the achievable size and detail of future
47436 simulations. This thesis describes network protocols
47437 and algorithms to support ``remote modeling,'' allowing
47438 a host to model and render remote entities in
47439 large-scale distributed simulations. These techniques
47440 require fewer network resources and support more entity
47441 types than previous approaches. The Position
47442 History-Based Dead Reckoning (PHBDR) protocol provides
47443 accurate remote position modeling and minimizes
47444 dependencies on network performance and entity
47445 representation. PHBDR is a foundation for three
47446 protocols which model entity orientation, entity
47447 structural change, and entity groups. This thesis shows
47448 that a simple, efficient protocol can provide smooth,
47449 accurate remote position modeling and that it can be
47450 applied recursively to support entity orientation,
47451 structure, and aggregation at multiple levels of
47452 detail; these protocols offer performance and costs
47453 that are competitive with more complex and
47454 application-specific approaches, while providing
47455 simpler analyses of behavior by exploiting this
47456 recursive structure.",
47457 acknowledgement = ack-nhfb,
47458 xxnumber = "CS-TR-96-1574",
47459 }
47460
47461 @TechReport{Kamath:1996:RAC,
47462 author = "Anil Kamath and Omri Palmon and Serge Plotkin",
47463 title = "Routing and Admission Control in General Topology
47464 Networks with {Poisson} Arrivals",
47465 type = "Technical Report",
47466 number = "STAN-CS-96-1575",
47467 institution = inst-STAN-CS,
47468 address = inst-STAN-CS:adr,
47469 pages = "??",
47470 month = oct,
47471 year = "1996",
47472 bibdate = "Thu Nov 20 12:13:32 MST 2025",
47473 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
47474 URL = "http://www-db.stanford.edu/TR/CS-TR-96-1575.html",
47475 abstract = "Emerging high speed networks will carry traffic for
47476 services such as video-on-demand and video
47477 teleconferencing --- that require resource reservation
47478 along the path on which the traffic is sent. High
47479 bandwidth-delay product of these networks prevents
47480 circuit rerouting, i.e. once a circuit is routed on a
47481 certain path, the bandwidth taken by this circuit
47482 remains unavailable for the duration (holding time) of
47483 this circuit. As a result, such networks will need
47484 effective routing and admission control strategies.
47485 Recently developed online routing and admission control
47486 strategies have logarithmic competitive ratios with
47487 respect to the admission ratio (the fraction of
47488 admitted circuits). Such guarantees on performance are
47489 rather weak in the most interesting case where the
47490 rejection ratio of the optimum algorithm is very small
47491 or even 0. Unfortunately, these guarantees can not be
47492 improved in the context of the considered models,
47493 making it impossible to use these models to identify
47494 algorithms that are going to perform well in practice.
47495 In this paper we develop routing and admission control
47496 strategies for a more realistic model, where the
47497 requests for virtual circuits between any two points
47498 arrive according to a Poisson process and where the
47499 circuit holding times are exponentially distributed.
47500 Our model is close to the one that was developed to
47501 analyse and tune the (currently used) strategies for
47502 managing traffic in long-distance telephone networks.
47503 We strengthen this model by assuming that the rates of
47504 the Poisson processes (the ``traffic matrix'') are
47505 unknown to the algorithm and are chosen by the
47506 adversary. Our strategy is competitive with respect to
47507 the expected rejection ratio. More precisely, it
47508 achieves expected rejection ratio of at most R+epsilon,
47509 where R is the optimum expected rejection ratio. The
47510 expectations are taken over the distribution of the
47511 request sequences, and $ \epsilon = \sqrt {(r \log n)}
47512 $, where $r$ is the maximum fraction of an edge
47513 bandwidth that can be requested by a single circuit.",
47514 acknowledgement = ack-nhfb,
47515 xxnumber = "CS-TR-96-1575",
47516 }
47517
47518 @TechReport{Huyn:1996:QRU,
47519 author = "Nam Huyn",
47520 title = "Query Reformulation under Incomplete Mappings",
47521 type = "Technical Report",
47522 number = "STAN-CS-96-1576",
47523 institution = inst-STAN-CS,
47524 address = inst-STAN-CS:adr,
47525 pages = "??",
47526 month = dec,
47527 year = "1996",
47528 bibdate = "Thu Nov 20 12:13:32 MST 2025",
47529 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
47530 URL = "http://www-db.stanford.edu/TR/CS-TR-96-1576.html",
47531 abstract = "This paper focuses on some of the important new
47532 translatability issues that arise in the problem of
47533 interoperation between two database schemas when
47534 mappings between these schemas are inherently more
47535 complex than traditional views or pure Datalog programs
47536 can capture. In many cases, sources cannot be
47537 redesigned, and mappings among them exhibit some form
47538 of incompleteness under which the question of whether a
47539 query can be translated across different schemas is not
47540 immediately obvious. The notion of query we consider
47541 here is the traditional one, in which the answers to a
47542 query are required to be definite: answers cannot be
47543 disjunctive or conditional and must refer only to
47544 domain constants. In this paper, mappings are modeled
47545 by Horn programs that allow existential variables, and
47546 queries are modeled by pure Datalog programs. We then
47547 consider the problem of eliminating functional terms
47548 from the answers to a Horn query where function symbols
47549 are allowed. We identify a class of Horn queries called
47550 ``term-bounded'' that are equivalent to pure Datalog
47551 queries. We present an algorithm that rewrites a
47552 term-bounded query into an ``equivalent'' pure Datalog
47553 query. Equivalence is defined here as yielding the same
47554 function-free answer.",
47555 acknowledgement = ack-nhfb,
47556 xxnumber = "CS-TR-96-1576",
47557 }
47558
47559 @TechReport{Huyn:1996:MAU,
47560 author = "Nam Huyn",
47561 title = "A More Aggressive Use Of Views To Extract
47562 Information",
47563 type = "Technical Report",
47564 number = "STAN-CS-96-1577",
47565 institution = inst-STAN-CS,
47566 address = inst-STAN-CS:adr,
47567 pages = "??",
47568 month = dec,
47569 year = "1996",
47570 bibdate = "Thu Nov 20 12:13:32 MST 2025",
47571 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
47572 URL = "http://www-db.stanford.edu/TR/CS-TR-96-1577.html",
47573 abstract = "Much recent work has focussed on using views to
47574 evaluate queries. More specifically, queries are
47575 rewritten to refer to views instead of the base
47576 relations over which the queries were originally
47577 written. The motivation is that the views represent the
47578 only ways in which some information source may be
47579 accessed. Another use of views that has been overlooked
47580 becomes important especially when no equivalent
47581 rewriting of a query in terms of views is possible:
47582 even though we cannot use the views to get all the
47583 answers to the query, we can still use them to deduce
47584 as many answers as possible. In many global information
47585 applications, the notion of equivalence used is often
47586 too restrictive. We propose a notion of
47587 pseudo-equivalence that allows more queries to be
47588 rewritten usefully: we show that if a query has an
47589 equivalent rewriting, the query also has a
47590 pseudo-equivalent rewriting. The converse is not true
47591 in general. In particular, when the views are
47592 conjunctive, we show that all Datalog queries over the
47593 source do have a pseudo-equivalent Datalog query over
47594 the views. We reduce the problem of finding
47595 pseudo-equivalent queries to that of rewriting Horn
47596 queries with Skolem functions as Datalog queries. We
47597 present an algorithm for the class of term-bounded Horn
47598 queries. We discuss extending the problem to larger
47599 classes of Horn queries, other non-Horn queries that
47600 result from ``inverting'' Datalog views and adding
47601 functional dependencies. The theory and methods
47602 developed in our work have important uses in query
47603 mediation between heterogeneous sources, automatic join
47604 discovery and view updates.",
47605 acknowledgement = ack-nhfb,
47606 xxnumber = "CS-TR-96-1577",
47607 }
47608
47609 @TechReport{Ip:1996:SRM,
47610 author = "C. Norris Ip",
47611 title = "State Reduction Methods for Automatic Formal
47612 Verification",
47613 type = "Technical Report",
47614 number = "STAN-CS-96-1578",
47615 institution = inst-STAN-CS,
47616 address = inst-STAN-CS:adr,
47617 pages = "??",
47618 month = dec,
47619 year = "1996",
47620 bibdate = "Thu Nov 20 12:13:32 MST 2025",
47621 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
47622 URL = "http://www-db.stanford.edu/TR/CS-TR-96-1578.html",
47623 abstract = "Validation of industrial designs is becoming more
47624 challenging as technology advances. One of the most
47625 suitable debugging aids is automatic formal
47626 verification. This thesis presents several techniques
47627 for reducing the state explosion problem, that is,
47628 reducing the number of states that are examined. A
47629 major contribution of this thesis is the design of
47630 simple extensions to the Murphi description language,
47631 which enable us to convert two existing abstraction
47632 strategies into two fully automatic algorithms, making
47633 these strategies easy to use and safe to apply. These
47634 two algorithms rely on two facts about high-level
47635 designs: they frequently exhibit structural symmetry,
47636 and their behavior is often independent of the exact
47637 number of replicated components they contain. Another
47638 contribution is the design of a new state reduction
47639 algorithm, which relies on reversible rules
47640 (transitions that do not lose information) in a system
47641 description. This new reduction algorithm can be used
47642 simultaneously with the other two algorithms. These
47643 techniques, implemented in the Murphi verification
47644 system, have been applied to many applications, such as
47645 cache coherence protocols and distributed algorithms.
47646 In the cases of two important classes of infinite
47647 systems, infinite state graphs can be automatically
47648 converted to small finite state graphs.",
47649 acknowledgement = ack-nhfb,
47650 xxnumber = "CS-TR-96-1578",
47651 }
47652
47653 @TechReport{Tajnai:1997:VHD,
47654 author = "Carolyn Tajnai",
47655 title = "From the {Valley of Heart's Delight} to {Silicon
47656 Valley}: a Study of {Stanford University}'s Role in the
47657 Transformation",
47658 type = "Technical Report",
47659 number = "STAN-CS-97-1579",
47660 institution = inst-STAN-CS,
47661 address = inst-STAN-CS:adr,
47662 pages = "??",
47663 month = jan,
47664 year = "1997",
47665 bibdate = "Thu Nov 20 12:13:32 MST 2025",
47666 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
47667 URL = "http://www-db.stanford.edu/TR/CS-TR-97-1579.html",
47668 abstract = "This study examines the role of Stanford University in
47669 the transformation from the Valley of Heart's Delight
47670 to the Silicon Valley. At the dawn of the Twentieth
47671 Century, California's Santa Clara County was an
47672 agricultural paradise. Because of the benign climate
47673 and thousands of acres of fruit orchards, the area
47674 became known as the Valley of Heart's Delight. In the
47675 early 1890's, Leland and Jane Stanford donated land in
47676 the valley to build a university in memory of their
47677 son. Thus, Leland Stanford, Jr., University was
47678 founded. In the early 1930's, there were almost no jobs
47679 for young Stanford engineering graduates. This was
47680 about to change. Although there was no organized plan
47681 to help develop the economic base of the area around
47682 Stanford University, the concern about the lack of job
47683 opportunities for their graduates motivated Stanford
47684 faculty to begin the chain of events that led to the
47685 birth of Silicon Valley. Stanford University's role in
47686 the transformation of the Valley of Heart's Delight
47687 into Silicon Valley is history, but it is enduring
47688 history. Stanford continues to effect the local economy
47689 by spawning new and creative ideas, dreams, and
47690 ambitions.",
47691 acknowledgement = ack-nhfb,
47692 xxnumber = "CS-TR-97-1579",
47693 }
47694
47695 @TechReport{Gravano:1997:SSP,
47696 author = "Luis Gravano and Kevin Chang and Hector Garcia-Molina
47697 and Andreas Paepcke",
47698 title = "{STARTS}: {Stanford Protocol Proposal for Internet
47699 Retrieval and Search}",
47700 type = "Technical Report",
47701 number = "STAN-CS-97-1580",
47702 institution = inst-STAN-CS,
47703 address = inst-STAN-CS:adr,
47704 pages = "??",
47705 month = jan,
47706 year = "1997",
47707 bibdate = "Thu Nov 20 12:13:32 MST 2025",
47708 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
47709 URL = "http://www-db.stanford.edu/TR/CS-TR-97-1580.html",
47710 abstract = "Document databases are available everywhere, both
47711 within the internal networks of the organizations and
47712 on the Internet. The database contents are often
47713 ``hidden'' behind search interfaces. These interfaces
47714 vary from database to database. Also, the algorithms
47715 with which the associated search engines rank the
47716 documents in the query results are usually incompatible
47717 across databases. Even individual organizations use
47718 search engines from different vendors to index their
47719 internal document collections. These organizations
47720 could benefit from unified query interfaces to multiple
47721 search engines, for example, that would give users the
47722 illusion of a single big document database. Building
47723 such ``metasearchers'' is nowadays a hard task because
47724 different search engines are largely incompatible and
47725 do not allow for interoperability. To improve this
47726 situation, the Digital Library project at Stanford has
47727 coordinated among search-engine vendors and other key
47728 players to reach informal agreements for unifying basic
47729 interactions in these three areas. This is the final
47730 writeup of our informal ``standards'' effort. This
47731 draft is based on feedback from people from Excite,
47732 Fulcrum, GILS, Harvest, Hewlett-Packard Laboratories,
47733 Infoseek, Microsoft Network, Netscape, PLS, Verity, and
47734 WAIS, among others.",
47735 acknowledgement = ack-nhfb,
47736 xxnumber = "CS-TR-97-1580",
47737 }
47738
47739 @TechReport{Paepcke:1997:TID,
47740 author = "Andreas Paepcke and Steve B. Cousins and Hector
47741 Garcia-Molina and Scott W. Hassan and Steven K.
47742 Ketchpel and Martin Roscheisen and Terry Winograd",
47743 title = "Towards Interoperability in Digital Libraries:
47744 Overview and Selected Highlights of the {Stanford
47745 Digital Library Project}",
47746 type = "Technical Report",
47747 number = "STAN-CS-97-1581",
47748 institution = inst-STAN-CS,
47749 address = inst-STAN-CS:adr,
47750 pages = "??",
47751 month = jan,
47752 year = "1997",
47753 bibdate = "Thu Nov 20 12:13:32 MST 2025",
47754 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
47755 URL = "http://www-db.stanford.edu/TR/CS-TR-97-1581.html",
47756 abstract = "We outline the scope of the Stanford Digital Library
47757 Project which covers five areas: user interface work,
47758 technologies for locating information and library
47759 services, the emerging economic perspective of digital
47760 libraries, infrastructure technology and the use of
47761 agent technologies to support all of these aspects. We
47762 describe technical details for two specific efforts
47763 that have been realized in prototype implementations.
47764 First, we describe how we employ distributed object
47765 technology to move towards an implementation of our
47766 InfoBus vision. The InfoBus consists of translation
47767 services and wrappers around existing protocols to cope
47768 with the problem of interoperability and the
47769 distributed nature of emerging digital library
47770 services. We model autonomous, heterogeneous library
47771 services as CORBA proxy objects. This allows the
47772 construction of unified but extensible method-based
47773 interfaces for client programs to interact through. We
47774 describe how distributed objects enable the design of
47775 communication protocols that leave implementors a large
47776 degree of freedom. This is a benefit because the
47777 resulting implementations can allow users to choose
47778 among multiple performance profile tradeoffs while
47779 staying within the confines of the protocol. The second
47780 effort we cover describes InterPay which uses the
47781 object approach for an architecture that helps manage
47782 heterogeneity in payment mechanisms among autonomous
47783 services. The architecture is organized into three
47784 layers. The top layer contains elements involved in the
47785 task-level interaction with the services. The middle
47786 layer is responsible for enforcing user-specified
47787 payment policies. The lowest layer manages the
47788 mechanics of diverse online payment schemes.",
47789 acknowledgement = ack-nhfb,
47790 xxnumber = "CS-TR-97-1581",
47791 }
47792
47793 @TechReport{Roscheisen:1997:SWA,
47794 author = "Martin Roscheisen and Christian Mogensen and Terry
47795 Winograd",
47796 title = "Shared Web Annotations as a Platform for Third-Party
47797 Value-Added, Information Providers: Architecture,
47798 Protocols, and Usage Examples",
47799 type = "Technical Report",
47800 number = "STAN-CS-97-1582",
47801 institution = inst-STAN-CS,
47802 address = inst-STAN-CS:adr,
47803 pages = "??",
47804 month = jan,
47805 year = "1997",
47806 bibdate = "Thu Nov 20 12:13:32 MST 2025",
47807 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
47808 URL = "http://www-db.stanford.edu/TR/CS-TR-97-1582.html",
47809 abstract = "In this paper, we present an architecture, called
47810 ``ComMentor'', which provides a platform for
47811 third-party providers of lightweight super-structures
47812 to material provided by conventional content providers.
47813 It enables people to share structured in-place
47814 annotations about arbitrary on-line documents. The
47815 system is part of a general ``virtual document''
47816 architecture (''PCD BRIO'') in which--with the help of
47817 lightweight distributed meta information--documents are
47818 dynamically synthesized from distributed sources
47819 depending on the user context and the meta-information
47820 which has been attached to them. The meta-information
47821 is managed independently of the documents themselves on
47822 separate meta-information servers, both in terms of
47823 storage and authority. A wide range of useful scenarios
47824 can be readily realized on this platform. We give
47825 examples of how a more personalized content
47826 presentation can be achieved by leveraging the database
47827 storage of the uniform meta-information and generating
47828 documents dynamically for a particular user
47829 perspective. These include structured discussion about
47830 paper drafts, collaborative filtering, seals of
47831 approval, tours, shared ``hotlists'' with section-based
47832 visibility control, usage indicators, co-presence, and
47833 value-added trails. Our object model and request
47834 interface for the prototype implementation are defined
47835 in technical detail in the appendix.",
47836 acknowledgement = ack-nhfb,
47837 xxnumber = "CS-TR-97-1582",
47838 }
47839
47840 @TechReport{Chang:1997:BQM,
47841 author = "Kevin Chen-Chuan Chang and Hector Garcia-Molina and
47842 Andreas Paepcke",
47843 title = "{Boolean} Query Mapping Across Heterogeneous
47844 Information Sources (Extended Version)",
47845 type = "Technical Report",
47846 number = "STAN-CS-97-1583",
47847 institution = inst-STAN-CS,
47848 address = inst-STAN-CS:adr,
47849 pages = "??",
47850 month = jan,
47851 year = "1997",
47852 bibdate = "Thu Nov 20 12:13:32 MST 2025",
47853 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
47854 URL = "http://www-db.stanford.edu/TR/CS-TR-97-1583.html",
47855 abstract = "Searching over heterogeneous information sources is
47856 difficult because of the non-uniform query languages.
47857 Our approach is to allow a user to compose Boolean
47858 queries in one rich front-end language. For each user
47859 query and target source, we transform the user query
47860 into a subsuming query that can be supported by the
47861 source but that may return extra documents. The results
47862 are then processed by a filter query to yield the
47863 correct final result. In this paper we introduce the
47864 architecture and associated algorithms for generating
47865 the supported subsuming queries and filters. We show
47866 that generated subsuming queries return a minimal
47867 number of documents; we also discuss how minimal cost
47868 filters can be obtained. We have implemented prototype
47869 versions of these algorithms and demonstrated them on
47870 heterogeneous Boolean systems.",
47871 acknowledgement = ack-nhfb,
47872 xxnumber = "CS-TR-97-1583",
47873 }
47874
47875 @TechReport{Kamiya:1997:GSP,
47876 author = "Kenichi Kamiya and Martin Roscheisen and Terry
47877 Winograd",
47878 title = "{Grassroots}: a System Providing a Uniform Framework
47879 for Communicating, Structuring, Sharing Information,
47880 and Organizing People",
47881 type = "Technical Report",
47882 number = "STAN-CS-97-1584",
47883 institution = inst-STAN-CS,
47884 address = inst-STAN-CS:adr,
47885 pages = "??",
47886 month = jan,
47887 year = "1997",
47888 bibdate = "Thu Nov 20 12:13:32 MST 2025",
47889 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
47890 URL = "http://www-db.stanford.edu/TR/CS-TR-97-1584.html",
47891 abstract = "People keep pieces of information in diverse
47892 collections such as folders, hotlists, e-mail inboxes,
47893 newsgroups, and mailing lists. These collections
47894 mediate various types of collaborations including
47895 communicating, structuring, sharing information, and
47896 organizing people. Grassroots is a system that provides
47897 a uniform framework to support people's collaborative
47898 activities mediated by collections of information. The
47899 system seamlessly integrates functionalities currently
47900 found in such disparate systems as e-mail, newsgroups,
47901 shared hotlists, hierarchical indexes, hypermail, etc.
47902 Grassroots co-exists with these systems in that its
47903 users benefit from the uniform image provided by
47904 Grassroots, but other people can continue using other
47905 mechanisms, and Grassroots leverages from them. The
47906 current Grassroots prototype is based on an http-proxy
47907 implementation, and can be used with any Web browser.
47908 In the context of the design of a next-generation
47909 version of the Web, Grassroots demonstrates the utility
47910 of a uniform notification infrastructure.",
47911 acknowledgement = ack-nhfb,
47912 xxnumber = "CS-TR-97-1584",
47913 }
47914
47915 @TechReport{Baldonado:1997:TTM,
47916 author = "Michelle Q. Wang Baldonado and Terry Winograd",
47917 title = "Techniques and Tools for Making Sense out of
47918 Heterogeneous Search Service Results",
47919 type = "Technical Report",
47920 number = "STAN-CS-97-1585",
47921 institution = inst-STAN-CS,
47922 address = inst-STAN-CS:adr,
47923 pages = "??",
47924 month = jan,
47925 year = "1997",
47926 bibdate = "Thu Nov 20 12:13:32 MST 2025",
47927 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
47928 URL = "http://www-db.stanford.edu/TR/CS-TR-97-1585.html",
47929 abstract = "We describe a set of techniques that allows users to
47930 interact with results at a higher level than the
47931 citation level, even when those results come from a
47932 variety of heterogeneous on-line search services. We
47933 believe that interactive result analysis allows users
47934 to ``make sense'' out of the potentially many results
47935 that may match the constraints they have supplied to
47936 the search services. The inspiration for this approach
47937 comes from reference librarians, who do not respond to
47938 patrons' questions with lists of citations, but rather
47939 give high-level answers that are tailored to the
47940 patrons' needs. We outline here the details of the
47941 methods we employ in order to meet our goal of allowing
47942 for dynamic, user-directed abstraction over result
47943 sets, as well as the prototype tool (SenseMaker) we
47944 have built based upon these techniques. We also take a
47945 brief look at the more general theory that underlies
47946 the tool, and hypothesize that it is applicable to
47947 flexible duplicate detection as well.",
47948 acknowledgement = ack-nhfb,
47949 xxnumber = "CS-TR-97-1585",
47950 }
47951
47952 @TechReport{Pichumani:1997:CTD,
47953 author = "Ramani Pichumani",
47954 title = "Construction of a Three-dimensional Geometric Model
47955 for Segmentation and Visualization of Cervical Spine
47956 Images",
47957 type = "Technical Report",
47958 number = "STAN-CS-97-1586",
47959 institution = inst-STAN-CS,
47960 address = inst-STAN-CS:adr,
47961 pages = "??",
47962 month = feb,
47963 year = "1997",
47964 bibdate = "Thu Nov 20 12:13:32 MST 2025",
47965 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
47966 URL = "http://www-db.stanford.edu/TR/CS-TR-97-1586.html",
47967 abstract = "This report introduces a new technique for
47968 automatically extracting vertebral segments from
47969 three-dimensional computerized tomography (CT) and
47970 magnetic resonance (MR) images of the human cervical
47971 spine. An important motivation for this work is to
47972 provide accurate information for registration and for
47973 fusion of CT and MR images into a composite
47974 three-dimensional image. One of the major hurdles in
47975 performing image fusion is the difficulty of extracting
47976 and matching corresponding anatomical regions in an
47977 accurate, robust, and timely manner. The complementary
47978 properties of soft and bony tissues revealed in CT and
47979 MR imaging modalities makes it challenging to extract
47980 corresponding regions that can be correlated in an
47981 accurate and robust manner. Ambiguities in the images
47982 due to noise, distortion, limited resolution, and
47983 patient-specific structural variations also create
47984 additional challenges. Whereas fusion of CT and MR
47985 images of the cranium have already been performed, no
47986 one has yet developed an automated technique for fusing
47987 multimodality images of the spine. Unlike the head,
47988 which is relatively rigid, the spine is a complex,
47989 articulating object and is subject to structural
47990 deformation throughout the multimodal scanning
47991 process.",
47992 acknowledgement = ack-nhfb,
47993 xxnumber = "CS-TR-97-1586",
47994 }
47995
47996 @TechReport{Matan:1997:ESC,
47997 author = "Ofer Matan",
47998 title = "Ensembles for Supervised Classification Learning",
47999 type = "Technical Report",
48000 number = "STAN-CS-97-1587",
48001 institution = inst-STAN-CS,
48002 address = inst-STAN-CS:adr,
48003 pages = "??",
48004 month = mar,
48005 year = "1997",
48006 bibdate = "Thu Nov 20 12:13:32 MST 2025",
48007 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
48008 URL = "http://www-db.stanford.edu/TR/CS-TR-97-1587.html",
48009 abstract = "This dissertation studies the use of multiple
48010 classifiers (ensembles or committees) in learning
48011 tasks. Both theoretical and practical aspects of
48012 combining classifiers are studied. First we analyze the
48013 representational ability of voting ensembles. A voting
48014 ensemble may perform either better or worse than each
48015 of its individual members. We give tight upper and
48016 lower bounds on the classification performance of a
48017 voting ensemble as a function of the classification
48018 performances of its individual members. Boosting is a
48019 method of combining multiple ``weak'' classifiers to
48020 form a ``strong'' classifier. Several issues concerning
48021 boosting are studied in this thesis. We study SBA, a
48022 hierarchical boosting algorithm proposed by Schapire,
48023 in terms of its representation and its search. We
48024 present a rejection boosting algorithm that trades-off
48025 exploration and exploitation: It requires fewer pattern
48026 labels at the expense of lower boosting ability.
48027 Ensembles may be useful in gaining information. We
48028 study their use to minimize labeling costs of data and
48029 to enable improvements on performance over time. For
48030 that purpose a model for on-site learning is presented.
48031 The system learns by querying ``hard'' patterns while
48032 classifying ``easy'' ones.",
48033 acknowledgement = ack-nhfb,
48034 xxnumber = "CS-TR-97-1587",
48035 }
48036
48037 @TechReport{Cohen:1997:SBE,
48038 author = "Scott Cohen and Carlo Tomasi",
48039 title = "Systems of Bilinear Equations",
48040 type = "Technical Report",
48041 number = "STAN-CS-97-1588",
48042 institution = inst-STAN-CS,
48043 address = inst-STAN-CS:adr,
48044 pages = "??",
48045 month = apr,
48046 year = "1997",
48047 bibdate = "Thu Nov 20 12:13:32 MST 2025",
48048 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
48049 URL = "http://www-db.stanford.edu/TR/CS-TR-97-1588.html",
48050 abstract = "How hard is it to solve a system of bilinear
48051 equations? No solutions are presented in this report,
48052 but the problem is posed and some preliminary remarks
48053 are made. In particular, solving a system of bilinear
48054 equations is reduced by a suitable transformation of
48055 its columns to solving a homogeneous system of bilinear
48056 equations. In turn, the latter has a nontrivial
48057 solution if and only if there exist two invertible
48058 matrices that, when applied to the tensor of the
48059 coefficients of the system, zero its first column.
48060 Matlab code is given to manipulate three-dimensional
48061 tensors, including a procedure that finds one solution
48062 to a bilinear system often, but not always.",
48063 acknowledgement = ack-nhfb,
48064 xxnumber = "CS-TR-97-1588",
48065 }
48066
48067 @TechReport{Benson:1997:LAM,
48068 author = "Scott Sherwood Benson",
48069 title = "Learning Action Models for Reactive Autonomous
48070 Agents",
48071 type = "Technical Report",
48072 number = "STAN-CS-97-1589",
48073 institution = inst-STAN-CS,
48074 address = inst-STAN-CS:adr,
48075 pages = "??",
48076 month = apr,
48077 year = "1997",
48078 bibdate = "Thu Nov 20 12:13:32 MST 2025",
48079 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
48080 URL = "http://www-db.stanford.edu/TR/CS-TR-97-1589.html",
48081 abstract = "To be maximally effective, autonomous agents such as
48082 robots must be able both to react appropriately in
48083 dynamic environments and to plan new courses of action
48084 in novel situations. Reliable planning requires
48085 accurate models of the effects of actions---models
48086 which are often more appropriately learned through
48087 experience than designed. This thesis describes TRAIL
48088 (Teleo-Reactive Agent with Inductive Learning), an
48089 integrated agent architecture which learns models of
48090 actions based on experiences in the environment. These
48091 action models are then used to create plans that
48092 combine both goal-directed and reactive behaviors.
48093 Previous work on action-model learning has focused on
48094 domains that contain only deterministic, atomic action
48095 models that explicitly describe all changes that can
48096 occur in the environment. The thesis extends this
48097 previous work to cover domains that contain durative
48098 actions, continuous variables, nondeterministic action
48099 effects, and actions taken by other agents. Results
48100 have been demonstrated in several robot simulation
48101 environments and the Silicon Graphics, Inc. flight
48102 simulator. The main emphasis in this thesis is on the
48103 action-model learning process within TRAIL. The agent
48104 begins the learning process by recording experiences in
48105 its environment either by observing a trainer or by
48106 executing a plan. Second, the agent identifies
48107 instances of action success or failure during these
48108 experiences using a new analysis demonstrating nine
48109 possible causes of action failure. Finally, a variant
48110 of the Inductive Logic Programming algorithm DINUS is
48111 used to induce action models based on the action
48112 instances. As the action models are learned, they can
48113 be used for constructing plans whose execution
48114 contributes to additional learning experiences.
48115 Diminishing reliance on the teacher signals successful
48116 convergence of the learning process.",
48117 acknowledgement = ack-nhfb,
48118 xxnumber = "CS-TR-97-1589",
48119 }
48120
48121 @TechReport{Goldwasser:1997:CMA,
48122 author = "Michael Goldwasser",
48123 title = "Complexity Measures for Assembly Sequences",
48124 type = "Technical Report",
48125 number = "STAN-CS-97-1590",
48126 institution = inst-STAN-CS,
48127 address = inst-STAN-CS:adr,
48128 pages = "??",
48129 month = jun,
48130 year = "1997",
48131 bibdate = "Thu Nov 20 12:13:32 MST 2025",
48132 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
48133 URL = "http://www-db.stanford.edu/TR/CS-TR-97-1590.html",
48134 abstract = "Our work focuses on various complexity measures for
48135 two-handed assembly sequences. For many products, there
48136 exist an exponentially large set of valid sequences,
48137 and a natural goal is to use automated systems to
48138 select wisely from the choices. Although there has been
48139 a great deal of algorithmic success for finding
48140 feasible assembly sequences, there has been very little
48141 success towards optimizing the costs of sequences. We
48142 attempt to explain this lack of progress, by proving
48143 the inherent difficulty in finding optimal, or even
48144 near-optimal, assembly sequences. To begin, we define,
48145 ``virtual assembly sequencing'', a graph-theoretic
48146 problem that is a generalization of assembly
48147 sequencing, focusing on the combinatorial aspect of the
48148 family of feasible assembly sequences, while
48149 temporarily separating out the specific geometric
48150 assumptions inherent to assembly sequencing. We
48151 formally prove the hardness of finding even
48152 near-optimal sequences for most cost measures in our
48153 generalized framework. As a special case, we prove
48154 similar, strong inapproximability results for the
48155 problem of scheduling with AND/OR precedence
48156 constraints. Finally, we re-introduce the geometry, and
48157 continue by realizing several of these hardness results
48158 in rather simple geometric settings. We are able to
48159 show strong inapproximability results, for example
48160 using an assembly consisting solely of unit disks in
48161 the plane.",
48162 acknowledgement = ack-nhfb,
48163 xxnumber = "CS-TR-97-1590",
48164 }
48165
48166 @TechReport{Friedman:1997:MBD,
48167 author = "Nir Friedman",
48168 title = "Modeling beliefs in dynamic systems",
48169 type = "Technical Report",
48170 number = "STAN-CS-97-1591",
48171 institution = inst-STAN-CS,
48172 address = inst-STAN-CS:adr,
48173 month = jun,
48174 year = "1997",
48175 bibdate = "Thu Nov 27 18:35:50 2025",
48176 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
48177 acknowledgement = ack-nhfb,
48178 remark = "This is the author's Ph.D. thesis.",
48179 }
48180
48181 @TechReport{Goel:1997:OTC,
48182 author = "Ashish Goel and Monika R. Henzinger and Serge
48183 Plotkin",
48184 title = "Online Throughput-Competitive Algorithm for Multicast
48185 Routing and Admission Control",
48186 type = "Technical Report",
48187 number = "STAN-CS-97-1592",
48188 institution = inst-STAN-CS,
48189 address = inst-STAN-CS:adr,
48190 pages = "??",
48191 month = jul,
48192 year = "1997",
48193 bibdate = "Thu Nov 20 12:13:32 MST 2025",
48194 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
48195 URL = "http://www-db.stanford.edu/TR/CS-TR-97-1592.html",
48196 abstract = "We present the first polylog-competitive online
48197 algorithm for the general multicast problem in the
48198 throughput model. The ratio of the number of requests
48199 accepted by the optimum offline algorithm to the
48200 expected number of requests accepted by our algorithm
48201 is polylogarithmic in $M$ and $n$, where $M$ is the
48202 number of multicast groups and $n$ is the number of
48203 nodes in the graph. We show that this is close to
48204 optimum by presenting an $ \Omega (\log n \log M) $
48205 lower bound on this ratio for any randomized online
48206 algorithm against an oblivious adversary. We also show
48207 that it is impossible to be competitive against an
48208 adaptive online adversary. As in the previous online
48209 routing algorithms, our algorithm uses edge-costs when
48210 deciding on which is the best path to use. In contrast
48211 to the previous competitive algorithms in the
48212 throughput model, our cost is not a direct function of
48213 the edge load. The new cost definition allows us to
48214 decouple the effects of routing and admission decisions
48215 of different multicast groups.",
48216 acknowledgement = ack-nhfb,
48217 xxnumber = "CS-TR-97-1592",
48218 }
48219
48220 @TechReport{Nourbakhsh:1997:IPEa,
48221 author = "Illah Reza Nourbakhsh",
48222 title = "Interleaving Planning and Execution for Autonomous
48223 Robots",
48224 type = "Technical Report",
48225 number = "STAN-CS-97-1593",
48226 institution = inst-STAN-CS,
48227 address = inst-STAN-CS:adr,
48228 pages = "168",
48229 year = "1997",
48230 ISBN = "0-7923-9828-9",
48231 ISBN-13 = "978-0-7923-9828-8",
48232 bibdate = "Thu Nov 27 18:35:50 2025",
48233 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
48234 note = "Published as \cite{Nourbakhsh:1997:IPEb}.",
48235 acknowledgement = ack-nhfb,
48236 remark = "This is the author's thesis.",
48237 }
48238
48239 @TechReport{Kapur:1997:IPB,
48240 author = "Arjun Kapur",
48241 title = "Interval and Point-Based Approaches to Hybrid System
48242 Verification",
48243 type = "Technical Report",
48244 number = "STAN-CS-97-1594",
48245 institution = inst-STAN-CS,
48246 address = inst-STAN-CS:adr,
48247 pages = "??",
48248 month = sep,
48249 year = "1997",
48250 bibdate = "Thu Nov 20 12:13:32 MST 2025",
48251 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
48252 URL = "http://www-db.stanford.edu/TR/CS-TR-97-1594.html",
48253 abstract = "Hybrid systems are real-time systems consisting of
48254 both continuous and discrete components. This thesis
48255 presents deductive and diagrammatic methodologies for
48256 proving point-based and interval-based properties of
48257 hybrid systems, where the hybrid system is modeled in
48258 either a sampling semantics or a continuous semantics.
48259 Under a sampling semantics the behavior of the system
48260 consists of a discrete number of system snapshots,
48261 where each snapshot records the state of the system at
48262 a particular moment in time. Under a continuous
48263 semantics, the system behavior is given by a function
48264 mapping each point in time to a system state. Two
48265 continuous semantics are studied: a continuous interval
48266 semantics, where at any given point in time the system
48267 is in a unique state, and a super-dense semantics,
48268 where no such requirement is needed. We use Linear-time
48269 Temporal Logic for expressing properties under either a
48270 sampling semantics or a super-dense semantics, and we
48271 introduce Hybrid Temporal Logic for expressing
48272 properties under a continuous interval semantics.
48273 Linear-time Temporal Logic is useful for expressing
48274 point-based properties, whose validity is dependent on
48275 individual states, while Hybrid Temporal Logic is
48276 useful for expressing both interval-based properties,
48277 whose validity is dependent on intervals of time, and
48278 point-based properties. Finally, two different
48279 verification methodologies are presented: a
48280 diagrammatic approach for verifying properties
48281 specified in Linear-time Temporal Logic, and a
48282 deductive approach for verifying properties specified
48283 in Hybrid Temporal Logic.",
48284 acknowledgement = ack-nhfb,
48285 xxnumber = "CS-TR-97-1594",
48286 }
48287
48288 @TechReport{Huyn:1997:MDW,
48289 author = "Nam Huyn",
48290 title = "Maintaining data warehouses under limited source
48291 access",
48292 type = "Technical Report",
48293 number = "STAN-CS-97-1595",
48294 institution = inst-STAN-CS,
48295 address = inst-STAN-CS:adr,
48296 pages = "??",
48297 month = sep,
48298 year = "1997",
48299 bibdate = "Thu Nov 20 12:13:32 MST 2025",
48300 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
48301 URL = "http://www-db.stanford.edu/TR/CS-TR-97-1595.html",
48302 abstract = "A data warehouse stores views derived from data that
48303 may not reside at the warehouse. Using these
48304 materialized views, user queries can be answered
48305 quickly because querying the external sources where the
48306 base data reside is avoided. However, when the sources
48307 change, the views in the warehouse can become
48308 inconsistent with the base data and must be maintained.
48309 A variety of approaches have been proposed for
48310 maintaining these views incrementally. At the one end
48311 of the spectrum, the required view updates are computed
48312 without restricting which base relations can be used.
48313 View maintenance with this approach is simple but can
48314 be expensive, since it may involve querying the
48315 external data sources. At the other end of the
48316 spectrum, additional views are stored at the warehouse
48317 to make sure that there is enough information to
48318 maintain the views without ever having to query the
48319 data sources. While this approach saves on external
48320 source access, it may require a large amount of
48321 information to be stored and maintained at the
48322 warehouse. In this thesis, we propose an intermediate
48323 approach to warehouse maintenance based on what we call
48324 {\em Runtime View Self-Maintenance}, where the views
48325 are incrementally maintained without using all the base
48326 relations but without requiring additional views to
48327 facilitate maintenance. Under limited information,
48328 however, maintaining a view unambiguously may not
48329 always be possible. Thus, the main questions in runtime
48330 view self-maintenance are: --- View
48331 self-maintainability. Under what conditions (on the
48332 given information) can a view be maintained
48333 unambiguously with respect to a given update? --- View
48334 self-maintenance. If a view can be maintained
48335 unambiguously, how do we maintain it using only the
48336 given information? The information we consider using
48337 for maintaining a view includes: --- At least the
48338 contents of the view itself and the update instance ---
48339 Optionally, the contents of other views in the
48340 warehouse, functional dependencies the base relations
48341 are known to satisfy, a subset of the base relations,
48342 and partial contents of a base relation. Developing
48343 efficient complete solutions for the runtime
48344 self-maintenance of conjunctive-query views is the main
48345 focus and the main contribution of this thesis.",
48346 acknowledgement = ack-nhfb,
48347 xxnumber = "CS-TR-97-1595",
48348 }
48349
48350 @TechReport{Campbell:1997:DDL,
48351 author = "Keith Eugene Campbell",
48352 title = "Distributed Development of a Logic-Based Controlled
48353 Medical Terminology",
48354 type = "Technical Report",
48355 number = "STAN-CS-97-1596",
48356 institution = inst-STAN-CS,
48357 address = inst-STAN-CS:adr,
48358 pages = "??",
48359 month = oct,
48360 year = "1997",
48361 bibdate = "Thu Nov 20 12:13:32 MST 2025",
48362 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
48363 URL = "http://www-db.stanford.edu/TR/CS-TR-97-1596.html",
48364 abstract = "A controlled medical terminology (CMT) encodes
48365 clinical data: patient's physical signs, symptoms, and
48366 diagnoses. Application developers lack a robust CMT and
48367 the methodologies needed to coordinate terminology
48368 development within and between projects. In this
48369 dissertation, I argue that if a formal terminology
48370 model is adopted and integrated into a
48371 change-management process that supports dynamic CMTs,
48372 then CMTs can evolve from being an impediment to
48373 application development and data analysis to a valuable
48374 resource. My thesis states that such an evolutionary
48375 approach can be supported by using semantics-based
48376 methods for managing concurrent terminology
48377 development, thereby bypassing the disadvantages of
48378 traditional lock-based approaches common in database
48379 systems. By allowing developers to work concurrently on
48380 the terminology while relying on semantics-based
48381 methods to resolve the ``collisions'' that are
48382 inevitable in concurrent work, a scalable approach to
48383 terminology development can be supported. This
48384 dissertation discusses CMT development in terms of
48385 three research topics: 1. Representation of Clinical
48386 Data 2. Concurrency Control 3. Configuration
48387 Management",
48388 acknowledgement = ack-nhfb,
48389 xxnumber = "CS-TR-97-1596",
48390 }
48391
48392 @TechReport{Cohen:1997:EMD,
48393 author = "Scott Cohen and Leonidas Guibas",
48394 title = "The {Earth Mover's Distance}: Lower Bounds and
48395 Invariance under Translation",
48396 type = "Technical Report",
48397 number = "STAN-CS-97-1597",
48398 institution = inst-STAN-CS,
48399 address = inst-STAN-CS:adr,
48400 pages = "44",
48401 month = nov,
48402 year = "1997",
48403 bibdate = "Thu Nov 20 12:13:32 MST 2025",
48404 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
48405 URL = "http://www-db.stanford.edu/TR/CS-TR-97-1597.html",
48406 abstract = "The Earth Mover's Distance (EMD) between two finite
48407 distributions of weight is proportional to the minimum
48408 amount of work required to transform one distribution
48409 into the other. Current content-based retrieval work in
48410 the Stanford Vision Laboratory uses the EMD as a common
48411 framework for measuring image similarity with respect
48412 to color, texture, and shape content. In this report,
48413 we present some fast to compute lower bounds on the EMD
48414 which may allow a system to avoid exact, more expensive
48415 EMD computations during query processing. The
48416 effectiveness of the lower bounds is tested in a
48417 color-based retrieval system. In addition to the lower
48418 bound work, we also show how to compute the EMD under
48419 translation. In this problem, the points in one
48420 distribution are free to translate, and the goal is to
48421 find a translation that minimizes the EMD to the other
48422 distribution.",
48423 acknowledgement = ack-nhfb,
48424 xxnumber = "CS-TR-97-1597",
48425 }
48426
48427 @TechReport{Duschka:1997:QPO,
48428 author = "Oliver M. Duschka",
48429 title = "Query Planning and Optimization in Information
48430 Integration",
48431 type = "Technical Report",
48432 number = "STAN-CS-97-1598",
48433 institution = inst-STAN-CS,
48434 address = inst-STAN-CS:adr,
48435 pages = "??",
48436 month = dec,
48437 year = "1997",
48438 bibdate = "Thu Nov 20 12:13:32 MST 2025",
48439 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
48440 URL = "http://www-db.stanford.edu/TR/CS-TR-97-1598.html",
48441 abstract = "Information integration systems provide uniform user
48442 interfaces to varieties of different information
48443 sources. Our work focuses on query planning in such
48444 systems. Query planning is the task of transforming a
48445 user query, represented in the user's interface
48446 language and vocabulary, into queries that can be
48447 executed by the information sources. Every information
48448 source might require a different query language and
48449 might use different vocabularies. We show that query
48450 plans with a fixed number of database operations are
48451 insufficient to extract all information from the
48452 sources, if functional dependencies or limitations on
48453 binding patterns are present. Dependencies complicate
48454 query planning because they allow query plans that
48455 would otherwise be invalid. We present an algorithm
48456 that constructs query plans that are guaranteed to
48457 extract all available information in these more general
48458 cases. This algorithm is also able to handle datalog
48459 user queries. We examine further extensions of the
48460 languages allowed for user queries and for describing
48461 information sources: disjunction, recursion and
48462 negation in source descriptions, negation and
48463 inequality in user queries. For these more expressive
48464 cases, we determine the data complexity required of
48465 languages able to represent ``best possible'' query
48466 plans.",
48467 acknowledgement = ack-nhfb,
48468 xxnumber = "CS-TR-97-1598",
48469 }
48470
48471 @TechReport{Sim:1997:TBI,
48472 author = "Ida Sim",
48473 title = "Trial Banks: an Informatics Foundation for
48474 Evidence-Based Medicine",
48475 type = "Technical Report",
48476 number = "STAN-CS-97-1599",
48477 institution = inst-STAN-CS,
48478 address = inst-STAN-CS:adr,
48479 pages = "??",
48480 month = dec,
48481 year = "1997",
48482 bibdate = "Thu Nov 20 12:13:32 MST 2025",
48483 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
48484 URL = "http://www-db.stanford.edu/TR/CS-TR-97-1599.html",
48485 abstract = "Randomized clinical trials constitute one of our main
48486 sources of medical knowledge, yet trial reports are
48487 difficult to find, read, and apply to clinical care. I
48488 propose that authors report trials both as entries into
48489 electronic knowledge bases --- or trial banks --- and
48490 as text articles in traditional journals. Trial banks
48491 should be interoperable, and we thus require a shared
48492 ontology of clinical-trial concepts. My thesis work is
48493 the design, implementation, and evaluation of such an
48494 ontology. Using a new approach called competency
48495 decomposition, I show that my ontology design is
48496 reasonable, and that the ontology is competent for
48497 three of the four core tasks of clinical-trials
48498 interpretation for a broad range of trial types. Using
48499 this ontology, I implemented a frame-based trial bank
48500 that can be queried dynamically over the World Wide
48501 Web. Clinical researchers successfully used this system
48502 to critique trials in the trial bank. With the advent
48503 of digital publication, we have a window of opportunity
48504 to design our publication systems such that they
48505 support the transfer of evidence from the research
48506 world to the clinic. This dissertation presents
48507 foundational work for an interoperating trial-bank
48508 system that will help us achieve the day-to-day
48509 practice of evidence-based medicine.",
48510 acknowledgement = ack-nhfb,
48511 xxnumber = "CS-TR-97-1599",
48512 }
48513
48514 @TechReport{Goldberg:1997:ICA,
48515 author = "Andrew Goldberg and Jeffrey D. Oldham and Serge
48516 Plotkin and Cliff Stein",
48517 title = "An Implementation of a Combinatorial Approximation
48518 Algorithm for Minimum-Cost Multicommodity Flow",
48519 type = "Technical Report",
48520 number = "STAN-CS-97-1600",
48521 institution = inst-STAN-CS,
48522 address = inst-STAN-CS:adr,
48523 pages = "??",
48524 month = dec,
48525 year = "1997",
48526 bibdate = "Thu Nov 20 12:13:32 MST 2025",
48527 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
48528 URL = "http://www-db.stanford.edu/TR/CS-TR-97-1600.html",
48529 abstract = "The minimum-cost multicommodity flow problem involves
48530 simultaneously shipping multiple commodities through a
48531 single network so that the total flow obeys arc
48532 capacity constraints and has minimum cost.
48533 Multicommodity flow problems can be expressed as linear
48534 programs, and most theoretical and practical algorithms
48535 use linear-programming algorithms specialized for the
48536 problems' structures. Combinatorial approximation
48537 algorithms yield flows with costs slightly larger than
48538 the minimum cost and use capacities slightly larger
48539 than the given capacities. Theoretically, the running
48540 times of these algorithms are much less than that of
48541 linear-programming-based algorithms. We combine and
48542 modify the theoretical ideas in these approximation
48543 algorithms to yield a fast, practical implementation
48544 solving the minimum-cost multicommodity flow problem.
48545 Experimentally, the algorithm solved our problem
48546 instances (to 1\% accuracy) two to three orders of
48547 magnitude faster than the linear-programming package
48548 CPLEX and the linear-programming based multicommodity
48549 flow program PPRN.",
48550 acknowledgement = ack-nhfb,
48551 xxnumber = "CS-TR-97-1600",
48552 }
48553
48554 @TechReport{deAlfaro:1998:FVP,
48555 author = "Luca de Alfaro",
48556 title = "Formal Verification of Probabilistic Systems",
48557 type = "Technical Report",
48558 number = "STAN-CS-98-1601",
48559 institution = inst-STAN-CS,
48560 address = inst-STAN-CS:adr,
48561 pages = "??",
48562 month = jun,
48563 year = "1998",
48564 bibdate = "Thu Nov 20 12:13:32 MST 2025",
48565 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
48566 URL = "http://www-db.stanford.edu/TR/CS-TR-98-1601.html",
48567 abstract = "This dissertation presents methods for the formal
48568 modeling and specification of probabilistic systems,
48569 and algorithms for the automated verification of these
48570 systems. Our system models describe the behavior of a
48571 system in terms of probability, nondeterminism,
48572 fairness and time. The formal specification languages
48573 we consider are based on extensions of branching-time
48574 temporal logics, and enable the expression of
48575 single-event and long-run average system properties.
48576 This latter class of properties, not expressible with
48577 previous formal languages, includes most of the
48578 performance properties studied in the field of
48579 performance evaluation, such as system throughput and
48580 average response time. Our choice of system models and
48581 specification languages has been guided by the goal of
48582 providing efficient verification algorithms. The
48583 algorithms rely on the theory of Markov decision
48584 processes, and exploit a connection between the
48585 graph-theoretical and probabilistic properties of these
48586 processes. This connection also leads to new results
48587 about classical problems, such as an extension to the
48588 solvable cases of the stochastic shortest path problem,
48589 an improved algorithm for the computation of
48590 reachability probabilities, and new results on the
48591 average reward problem for semi-Markov decision
48592 processes.",
48593 acknowledgement = ack-nhfb,
48594 xxnumber = "CS-TR-98-1601",
48595 }
48596
48597 @TechReport{Fisher:1998:TSO,
48598 author = "Kathleen Fisher",
48599 title = "Type Systems for Object-Oriented Programming
48600 Languages",
48601 type = "Technical Report",
48602 number = "STAN-CS-98-1602",
48603 institution = inst-STAN-CS,
48604 address = inst-STAN-CS:adr,
48605 pages = "??",
48606 month = feb,
48607 year = "1998",
48608 bibdate = "Thu Nov 20 12:13:32 MST 2025",
48609 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
48610 URL = "http://www-db.stanford.edu/TR/CS-TR-98-1602.html",
48611 abstract = "Object-oriented programming languages (OOPL's) provide
48612 important support for today's large-scale software
48613 projects. Unfortunately, typed OOPL's have suffered
48614 from overly restrictive type systems that have forced
48615 programmers to use type-casts to achieve flexibility, a
48616 notorious source of hard-to-find bugs. One source of
48617 this inflexibility is the conflation of subtyping and
48618 inheritance, which reduces potential code reuse.
48619 Attempts to fix this rigidity have resulted in unsound
48620 type systems, most notably Eiffel's. This thesis
48621 develops a sound type system for a formal
48622 object-oriented language. It gains flexibility by
48623 separating subtyping and inheritance and by supporting
48624 method specialization, which allows the types of
48625 methods to be refined during inheritance. The lack of
48626 such a mechanism is a key source of type-casts in
48627 languages like C++. Abstraction primitives in this
48628 formal language support a class construct similar to
48629 the one found in C++ and Java, explaining the link
48630 between inheritance and subtyping: object types that
48631 include implementation information are a form of
48632 abstract type, and the only way to produce a subtype of
48633 an abstract type is via inheritance. Formally, the
48634 language is presented as an object calculus. The thesis
48635 proves type soundness with respect to an operational
48636 semantics via a subject reduction theorem.",
48637 acknowledgement = ack-nhfb,
48638 xxnumber = "CS-TR-98-1602",
48639 }
48640
48641 @TechReport{Herrod:1998:UCM,
48642 author = "Stephen Alan Herrod",
48643 title = "Using Complete Machine Simulation to Understand
48644 Computer System Behavior",
48645 type = "Technical Report",
48646 number = "STAN-CS-98-1603",
48647 institution = inst-STAN-CS,
48648 address = inst-STAN-CS:adr,
48649 pages = "??",
48650 month = mar,
48651 year = "1998",
48652 bibdate = "Thu Nov 20 12:13:32 MST 2025",
48653 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
48654 URL = "http://www-db.stanford.edu/TR/CS-TR-98-1603.html",
48655 abstract = "This dissertation describes complete machine
48656 simulation, a novel approach to understanding the
48657 behavior of modern computer systems. Complete machine
48658 simulation models all of the hardware found in modern
48659 computer systems, allowing it to investigate the
48660 behavior of highly configurable machines running
48661 commercial operating systems and important workloads
48662 such as database and web servers. Complete machine
48663 simulation extends the applicability of traditional
48664 machine simulation techniques by addressing speed and
48665 data organization challenges. To achieve the speed
48666 needed to investigate long-running workloads, complete
48667 machine simulation allows an investigator to
48668 dynamically adjust the characteristics of its hardware
48669 simulation. An investigator can select a high-speed,
48670 low-detail simulation setting to quickly pass through
48671 uninteresting portions of a workload's execution. Once
48672 the workload has reached a more interesting execution
48673 state, an investigator can switch to slower, more
48674 detailed simulation to obtain behavioral information.
48675 To efficiently organize low-level hardware simulation
48676 data into more useful information, complete machine
48677 simulation provides several mechanisms that incorporate
48678 higher-level workload knowledge into the data
48679 management process. These mechanisms are efficient and
48680 further improve simulation speed by customizing all
48681 data collection and reporting to the specific needs of
48682 an investigation.",
48683 acknowledgement = ack-nhfb,
48684 xxnumber = "CS-TR-98-1603",
48685 }
48686
48687 @TechReport{Teo:1998:TAS,
48688 author = "Patrick C. Teo",
48689 title = "Theory and Applications of Steerable Functions",
48690 type = "Technical Report",
48691 number = "STAN-CS-98-1604",
48692 institution = inst-STAN-CS,
48693 address = inst-STAN-CS:adr,
48694 pages = "??",
48695 month = mar,
48696 year = "1998",
48697 bibdate = "Thu Nov 20 12:13:32 MST 2025",
48698 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
48699 URL = "http://www-db.stanford.edu/TR/CS-TR-98-1604.html",
48700 abstract = "A function is called steerable if transformed versions
48701 of the function can be expressed using linear
48702 combinations of a fixed set of basis functions. In this
48703 dissertation, we propose a framework, based on Lie
48704 group theory, for studying and constructing functions
48705 steerable under any smooth transformation group.
48706 Existing analytical approaches to steerability are
48707 consistently explained within the framework. The design
48708 of a suitable set of basis functions given any
48709 arbitrary steerable function is one of the main
48710 problems concerning steerable functions. To this end,
48711 we have developed two different algorithms. The first
48712 algorithm is a symbolic method that derives the minimal
48713 set of basis functions automatically given an arbitrary
48714 steerable function. In practice, functions that need to
48715 be steered might not be steerable with a finite number
48716 of basis functions. Moreover, it is often the case that
48717 only a small subset of transformations within the group
48718 of transformations needs to be considered. In response
48719 to these two concerns, the second algorithm computes
48720 the optimal set of k basis functions to steer an
48721 arbitrary function under a subset of the group of
48722 transformations. Lastly, we demonstrate the usefulness
48723 of steerable functions in a variety of applications.",
48724 acknowledgement = ack-nhfb,
48725 xxnumber = "CS-TR-98-1604",
48726 }
48727
48728 @TechReport{Balabanovic:1998:LSM,
48729 author = "Marko Balabanovic",
48730 title = "Learning to Surf: Multiagent Systems for Adaptive Web
48731 Page Recommendation",
48732 type = "Technical Report",
48733 number = "STAN-CS-98-1605",
48734 institution = inst-STAN-CS,
48735 address = inst-STAN-CS:adr,
48736 pages = "??",
48737 month = mar,
48738 year = "1998",
48739 bibdate = "Thu Nov 20 12:13:32 MST 2025",
48740 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
48741 URL = "http://www-db.stanford.edu/TR/CS-TR-98-1605.html",
48742 abstract = "Imagine a newspaper personalized for your tastes.
48743 Instead of a selection of articles chosen for a general
48744 audience by a human editor, a software agent picks
48745 items just for you, covering your particular topics of
48746 interest. Since there are no journalists at its
48747 disposal, the agent searches the Web for appropriate
48748 articles. Over time, it uses your feedback on
48749 recommended articles to build a model of your
48750 interests. This thesis investigates the design of
48751 ``recommender systems'' which create such personalized
48752 newspapers. Two research issues motivate this work and
48753 distinguish it from approaches usually taken by
48754 information retrieval or machine learning researchers.
48755 First, a recommender system will have many users, with
48756 overlapping interests. How can this be exploited?
48757 Second, each edition of a personalized newspaper
48758 consists of a small set of articles. Techniques for
48759 deciding on the relevance of individual articles are
48760 well known, but how is the composition of the set
48761 determined? One of the primary contributions of this
48762 research is an implemented architecture linking
48763 populations of adaptive software agents. Common
48764 interests among its users are used both to increase
48765 efficiency and scalability, and to improve the quality
48766 of recommendations. A novel interface infers document
48767 preferences by monitoring user drag-and-drop actions,
48768 and affords control over the composition of sets of
48769 recommendations. Results are presented from a variety
48770 of experiments: user tests measuring learning
48771 performance, simulation studies isolating particular
48772 tradeoffs, and usability tests investigating
48773 interaction designs.",
48774 acknowledgement = ack-nhfb,
48775 xxnumber = "CS-TR-98-1605",
48776 }
48777
48778 @TechReport{Basu:1998:ACC,
48779 author = "Julie Basu",
48780 title = "Associative Caching in Client--Server Databases",
48781 type = "Technical Report",
48782 number = "STAN-CS-98-1606",
48783 institution = inst-STAN-CS,
48784 address = inst-STAN-CS:adr,
48785 pages = "??",
48786 month = may,
48787 year = "1998",
48788 bibdate = "Thu Nov 20 12:13:32 MST 2025",
48789 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
48790 URL = "http://www-db.stanford.edu/TR/CS-TR-98-1606.html",
48791 abstract = "Client-server configuration is a popular architecture
48792 for modern databases. A traditional assumption in such
48793 systems is that clients have limited resources, and
48794 query processing is always performed by the server. The
48795 server is thus a potential performance bottleneck. To
48796 improve the system performance and scalability, today's
48797 powerful clients can cache data locally. In this
48798 dissertation, we study a new scheme, A*Cache, for
48799 associative client-side caching. In contrast to
48800 navigational data access using object or page
48801 identifiers, A*Cache supports content-based associative
48802 access for better data reuse. Query results are stored
48803 locally along with their description, and
48804 predicate-based reasoning is used to examine and
48805 maintain the client cache. Clients execute queries
48806 locally if the data is cached, and use update
48807 notifications generated by the server for cache
48808 maintenance. We first describe the architecture of
48809 A*Cache and its transaction execution model. We then
48810 develop new optimization techniques for improving the
48811 performance of A*Cache. Next, A*Cache performance is
48812 investigated through detailed simulation of a
48813 client-server database under many different workloads,
48814 and compared with other types of caching systems. The
48815 simulation results clearly demonstrate the
48816 effectiveness of our associative caching scheme for
48817 read-only environments, and also for read-write
48818 scenarios with moderately high data update
48819 probabilities.",
48820 acknowledgement = ack-nhfb,
48821 xxnumber = "CS-TR-98-1606",
48822 }
48823
48824 @TechReport{Roscheisen:1998:NCD,
48825 author = "Martin Roscheisen",
48826 title = "A Network-Centric Design for Relationship-Based Rights
48827 Management",
48828 type = "Technical Report",
48829 number = "STAN-CS-98-1607",
48830 institution = inst-STAN-CS,
48831 address = inst-STAN-CS:adr,
48832 pages = "??",
48833 month = may,
48834 year = "1998",
48835 bibdate = "Thu Nov 20 12:13:32 MST 2025",
48836 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
48837 URL = "http://www-db.stanford.edu/TR/CS-TR-98-1607.html",
48838 abstract = "Networked environments such as the Internet provide a
48839 new platform for communication and information access.
48840 In this thesis, we address the question of how to
48841 articulate and enforce boundaries of control on top of
48842 this platform, while enabling collaboration and sharing
48843 in a peer-to-peer environment. We develop the concepts
48844 and technologies for a new Internet service layer,
48845 called FIRM, that enables structured
48846 rights/relationship management. Using a prototype
48847 implementation, RManage, we show how FIRM makes it
48848 possible to unify rights/relationship management from a
48849 user-centered perspective and to support full
48850 end-to-end integration of shared control state in
48851 network services and users' client applications. We
48852 present a network-centric architecture for managing
48853 control information, which generalizes previous,
48854 client/server-based models to a peer-to-peer
48855 environment. Principles and concepts from contract law
48856 are used to identify a generic way of representing the
48857 shared structure of different kinds of relationships.",
48858 acknowledgement = ack-nhfb,
48859 xxnumber = "CS-TR-98-1607",
48860 }
48861
48862 @TechReport{Katz:1998:NPP,
48863 author = "Morris J. Katz",
48864 title = "A New Perspective on Partial Evaluation and Use
48865 Analysis",
48866 type = "Technical Report",
48867 number = "STAN-CS-98-1608",
48868 institution = inst-STAN-CS,
48869 address = inst-STAN-CS:adr,
48870 pages = "??",
48871 month = jun,
48872 year = "1998",
48873 bibdate = "Thu Nov 20 12:13:32 MST 2025",
48874 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
48875 URL = "http://www-db.stanford.edu/TR/CS-TR-98-1608.html",
48876 abstract = "Partial evaluators are compile time optimizers
48877 achieving performance improvements through a program
48878 modification technique called specialization. Partial
48879 evaluators produce one or more copies, or
48880 specializations, of each procedure in a source program
48881 in the output program. Specializations are
48882 distinguished by being optimized for invocation from
48883 call sites with different characteristics, for example,
48884 placing certain constraints on argument values.
48885 Specializations are created by partially executing
48886 procedures, leaving only unexecutable portions as
48887 residual code. Symbolic execution can replace variable
48888 references by the referenced values, executed
48889 primitives by their computed results, and function
48890 applications by the bodies of the applied functions,
48891 yielding inlining. One core challenge of partial
48892 evaluation is selecting what specializations to create.
48893 Attempting to produce an infinite number of
48894 specializations results in divergence. The termination
48895 mechanism of a partial evaluator decides whether or not
48896 to symbolically execute a procedure in order to create
48897 a new specialization. Creating a termination mechanism
48898 that precludes divergence is not difficult. However,
48899 crafting a termination mechanism resulting in the
48900 production of a sufficient number of appropriate
48901 specializations to produce high quality residual code
48902 while still terminating all, or most, of the time is
48903 quite challenging. This dissertation presents a new
48904 type of analysis, called use analysis, forming the
48905 basis of a termination mechanism designed to yield a
48906 better combination of residual code quality and
48907 frequent termination than the current
48908 state-of-the-art.",
48909 acknowledgement = ack-nhfb,
48910 xxnumber = "CS-TR-98-1608",
48911 }
48912
48913 @TechReport{Sanders:1998:ACC,
48914 author = "Gillian D. Sanders",
48915 title = "Automated creation of clinical-practice guidelines
48916 from decision models",
48917 type = "Technical Report",
48918 number = "STAN-CS-98-1609",
48919 institution = inst-STAN-CS,
48920 address = inst-STAN-CS:adr,
48921 pages = "xxiv + 244",
48922 month = jul,
48923 year = "1998",
48924 bibdate = "Thu Nov 20 12:13:32 MST 2025",
48925 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
48926 URL = "http://www-db.stanford.edu/TR/CS-TR-98-1609.html",
48927 abstract = "I developed an approach that allows clinical-practice
48928 guideline (CPG) developers to create, disseminate, and
48929 tailor CPGs, using decision models (DMs). I propose
48930 that guideline developers can use computer-based DMs
48931 that reflect global and site-specific data to generate
48932 CPGs. Such CPGs are high quality, can be tailored to
48933 specific settings, and can be modified automatically as
48934 the DM or evidence evolves. I defined conceptual models
48935 for representing CPGs and DMs, and formalized a method
48936 for mapping between these two representations. I
48937 designed a DM annotation editor that queries the
48938 decision analyst for missing knowledge. I implemented
48939 the ALCHEMIST system that encompasses the conceptual
48940 models, mapping algorithm, and the resulting tailoring
48941 abilities. I evaluated the design of both conceptual
48942 models, and the accuracy of the mapping algorithm. To
48943 show that ALCHEMIST produces high-quality CPGs, I had
48944 users rate the quality of produced CPGs using a
48945 guideline-rating key, and evaluate ALCHEMIST's
48946 tailoring abilities. ALCHEMIST automates the DM-to-CPG
48947 process and distributes the CPG over the web to allow
48948 local developers to apply, tailor, and maintain a
48949 global CPG. I argue that my framework is a method for
48950 guideline developers to create and maintain automated
48951 CPGs, and it thus promotes high-quality and
48952 cost-effective health care.",
48953 acknowledgement = ack-nhfb,
48954 pdfpages = "262",
48955 remark = "This is the author's Ph.D. thesis.",
48956 xxnumber = "CS-TR-98-1609",
48957 }
48958
48959 @TechReport{Veach:1998:RMC,
48960 author = "Eric Veach",
48961 title = "Robust {Monte Carlo} methods for light transport
48962 simulation",
48963 type = "Technical Report",
48964 number = "STAN-CS-98-1610",
48965 institution = inst-STAN-CS,
48966 address = inst-STAN-CS:adr,
48967 pages = "xxv + 406",
48968 month = aug,
48969 year = "1998",
48970 bibdate = "Thu Nov 27 18:35:50 2025",
48971 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
48972 URL = "https://searchworks.stanford.edu/view/10386091",
48973 acknowledgement = ack-nhfb,
48974 remark = "This is the author's thesis.",
48975 }
48976
48977 @TechReport{Chekuri:1998:AAS,
48978 author = "Chandra Chekuri",
48979 title = "Approximation Algorithms for Scheduling Problems",
48980 type = "Technical Report",
48981 number = "STAN-CS-98-1611",
48982 institution = inst-STAN-CS,
48983 address = inst-STAN-CS:adr,
48984 pages = "??",
48985 month = sep,
48986 year = "1998",
48987 bibdate = "Thu Nov 20 12:13:32 MST 2025",
48988 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
48989 URL = "http://www-db.stanford.edu/TR/CS-TR-98-1611.html",
48990 abstract = "This thesis describes efficient approximation
48991 algorithms for some NP-Hard deterministic machine
48992 scheduling and related problems. We study the objective
48993 functions of minimizing makespan (the time to complete
48994 all jobs) and minimizing average completion time in a
48995 variety of settings described below. 1. Minimizing
48996 average completion time and its weighted generalization
48997 for single and parallel machine problems. We introduce
48998 new techniques that either improve earlier results
48999 and/or result in simple and efficient approximation
49000 algorithms. In addition to improved results for
49001 specific problems, we give a general algorithm that
49002 converts an $x$ approximate single machine schedule
49003 into a $ (2 x + 2) $ approximate parallel machine
49004 schedule. 2. Minimizing makespan on machines with
49005 different speeds when jobs have precedence constraints.
49006 We obtain an $ O(\log m)$ approximation ($m$ is the
49007 number of machines) in $ O(n^3)$ time. 3. We introduce
49008 a class of new scheduling problems that arise from
49009 query optimization in parallel databases. The novel
49010 aspect consists of modeling communication costs in
49011 query execution. We devise algorithms for pipelined
49012 operator scheduling. We obtain a PTAS and also simpler
49013 $ O(n \log n)$ time algorithms with ratios of 3.56 and
49014 2.58. 4. Multi-dimensional generalizations of three
49015 well known problems in combinatorial optimization:
49016 multi-processor scheduling, bin packing, and the
49017 knapsack problems. We obtain several approximability
49018 and inapproximability results.",
49019 acknowledgement = ack-nhfb,
49020 xxnumber = "CS-TR-98-1611",
49021 }
49022
49023 @TechReport{Iliano:1998:PPC,
49024 author = "Iliano Cervesato and John C. Mitchell",
49025 title = "{Pleiades Project}: Collected Work 1997--1998",
49026 type = "Technical Report",
49027 number = "STAN-CS-98-1612",
49028 institution = inst-STAN-CS,
49029 address = inst-STAN-CS:adr,
49030 pages = "??",
49031 month = oct,
49032 year = "1998",
49033 bibdate = "Thu Nov 20 12:13:32 MST 2025",
49034 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
49035 URL = "http://www-db.stanford.edu/TR/CS-TR-98-1612.html",
49036 abstract = "This report collects the papers that were written by
49037 the participants of the Pleiades Project and their
49038 collaborators from April 1997 to August 1998. Its
49039 intent is to give the reader an overview of our
49040 accomplishments during this initial phase of the
49041 project. Therefore, rather than including complete
49042 publications, we chose to reproduce only the first four
49043 pages of each paper. In order to satisfy the legitimate
49044 curiosity of readers interested in specific articles,
49045 each paper can be integrally retrieved from the
49046 World-Wide Web through the provided URL. A list of the
49047 current publications of the Pleiades Project is
49048 accessible at the URL
49049 http://theory.stanford.edu/muri/papers.html. Future
49050 articles will be posted there as they become
49051 available.",
49052 acknowledgement = ack-nhfb,
49053 xxnumber = "CS-TR-98-1612",
49054 }
49055
49056 @TechReport{Prabhakar:1998:SPP,
49057 author = "Balaji Prabhakar and Nicholas Bambos and Tom
49058 Mountford",
49059 title = "On the synchronization of {Poisson} processes and
49060 queueing networks with service and synchronization
49061 nodes",
49062 type = "Technical Report",
49063 number = "STAN-CS-98-1613",
49064 institution = inst-STAN-CS,
49065 address = inst-STAN-CS:adr,
49066 pages = "??",
49067 month = oct,
49068 year = "1998",
49069 bibdate = "Thu Nov 20 12:13:32 MST 2025",
49070 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
49071 URL = "http://www-db.stanford.edu/TR/CS-TR-98-1613.html",
49072 abstract = "This paper investigates the dynamics of a
49073 synchronization node in isolation, and of networks of
49074 service and synchronization nodes. A synchronization
49075 node consists of $M$ infinite capacity buffers, where
49076 tokens arriving on $M$ distinct random input flows are
49077 stored (there is one buffer for each flow). Tokens are
49078 held in the buffers until one is available from each
49079 flow. When this occurs, a token is drawn from each
49080 buffer to form a group-token, which is instantaneously
49081 released as a synchronized departure. Under independent
49082 Poisson inputs, the output of a synchronization node is
49083 shown to converge weakly (and in certain cases
49084 strongly) to a Poisson process with rate equal to the
49085 minimum rate of the input flows. Hence synchronization
49086 preserves the Poisson property, as do superposition,
49087 Bernoulli sampling and M/M/1 queueing operations. We
49088 then consider networks of synchronization and
49089 exponential server nodes with Bernoulli routing and
49090 exogenous Poisson arrivals, extending the standard
49091 Jackson Network model to include synchronization nodes.
49092 It is shown that if the synchronization skeleton of the
49093 network is acyclic (i.e. no token visits any
49094 synchronization node twice although it may visit a
49095 service node repeatedly), then the distribution of the
49096 joint queue-length process of only the service nodes is
49097 product form (under standard stability conditions) and
49098 easily computable. Moreover, the network output flows
49099 converge weakly to Poisson processes. Finally, certain
49100 results for networks with finite capacity buffers are
49101 presented, and the limiting behavior of such networks
49102 as the buffer capacities become large is studied.",
49103 acknowledgement = ack-nhfb,
49104 xxnumber = "CS-TR-98-1613",
49105 }
49106
49107 @TechReport{deAlfaro:1998:DTC,
49108 author = "Luca de Alfaro and Zohar Manna and Henny Sipma",
49109 title = "Decomposing, Transforming and Composing Diagrams: The
49110 Joys of Modular Verification",
49111 type = "Technical Report",
49112 number = "STAN-CS-98-1614",
49113 institution = inst-STAN-CS,
49114 address = inst-STAN-CS:adr,
49115 pages = "??",
49116 month = oct,
49117 year = "1998",
49118 bibdate = "Thu Nov 20 12:13:32 MST 2025",
49119 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
49120 URL = "http://www-db.stanford.edu/TR/CS-TR-98-1614.html",
49121 abstract = "The paper proposes a modular framework for the
49122 verification of temporal logic properties of systems
49123 based on the deductive transformation and composition
49124 of diagrams. The diagrams represent abstractions of the
49125 modules composing the system, together with information
49126 about the environment of the modules. The proof of a
49127 temporal specification is constructed with the help of
49128 diagram transformation and composition rules, which
49129 enable the gradual decomposition of the system into
49130 manageable modules, the study of the modules, and the
49131 final combination of the diagrams into a proof of the
49132 specification. We illustrate our methodology with the
49133 modular verification of a database demarcation
49134 protocol.",
49135 acknowledgement = ack-nhfb,
49136 xxnumber = "CS-TR-98-1614",
49137 }
49138
49139 @TechReport{Sahami:1998:UML,
49140 author = "Mehran Sahami",
49141 title = "Using Machine Learning to Improve Information Access",
49142 type = "Technical Report",
49143 number = "STAN-CS-98-1615",
49144 institution = inst-STAN-CS,
49145 address = inst-STAN-CS:adr,
49146 pages = "??",
49147 month = dec,
49148 year = "1998",
49149 bibdate = "Thu Nov 20 12:13:32 MST 2025",
49150 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
49151 URL = "http://www-db.stanford.edu/TR/CS-TR-98-1615.html",
49152 abstract = "We address the problem of topical information space
49153 navigation. Specifically, we combine query tools with
49154 methods for automatically creating topic taxonomies in
49155 order to organize text collections. Our system, named
49156 SONIA (Service for Organizing Networked Information
49157 Autonomously), is implemented in the Stanford Digital
49158 Libraries testbed. It employs several novel
49159 probabilistic Machine Learning methods that enable the
49160 automatic creation of dynamic topic hierarchies based
49161 on the full-text content of documents. First, to
49162 generate such topical hierarchies, we employ a novel
49163 clustering scheme that outperforms traditional methods
49164 used in both Information Retrieval and Probabilistic
49165 Reasoning. Furthermore, we develop methods for
49166 classifying new articles into such automatically
49167 generated, or existing manually generated, hierarchies.
49168 Our method explicitly uses the hierarchical
49169 relationships between topics to improve classification
49170 accuracy. Much of this improvement is derived from the
49171 fact that the classification decisions in such a
49172 hierarchy can be made by considering only the presence
49173 (or absence) of a small number of features (words) in
49174 each document. The choice of relevant words is made
49175 using a novel information theoretic algorithm for
49176 feature selection. The algorithms used in SONIA are
49177 also general enough to have been successfully applied
49178 to data mining problems in different domains than
49179 text.",
49180 acknowledgement = ack-nhfb,
49181 xxnumber = "CS-TR-98-1615",
49182 }
49183
49184 @TechReport{Bjorner:1998:DVR,
49185 author = "Nikolaj S. Bj{\o}rner and Zohar Manna and Henny B.
49186 Sipma and Tom{\'a}s E. Uribe",
49187 title = "Deductive verification of real-time systems using
49188 {STeP}",
49189 type = "Technical Report",
49190 number = "STAN-CS-98-1616",
49191 institution = inst-STAN-CS,
49192 address = inst-STAN-CS:adr,
49193 month = jan,
49194 year = "1998",
49195 bibdate = "Thu Nov 27 18:35:50 2025",
49196 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
49197 note = "Preliminary version appeared in 4th Intl. AMAST
49198 Workshop on Real-Time Systems, LNCS, Vol. 1231,
49199 Springer-Verlag, May 1997, pp. 484--498. Published in
49200 Published in \booktitle{Theoretical Computer Science}
49201 {\bf 253}(1) 27--60, 17 February 2001",
49202 acknowledgement = ack-nhfb,
49203 }
49204
49205 @TechReport{Shiffman:1999:SMI,
49206 author = "Smadar Shiffman",
49207 title = "Segmentation of Medical Image Volumes Using Intrinsic
49208 Shape Information",
49209 type = "Technical Report",
49210 number = "STAN-CS-99-1617",
49211 institution = inst-STAN-CS,
49212 address = inst-STAN-CS:adr,
49213 pages = "??",
49214 month = feb,
49215 year = "1999",
49216 bibdate = "Thu Nov 20 12:13:32 MST 2025",
49217 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
49218 URL = "http://www-db.stanford.edu/TR/CS-TR-99-1617.html",
49219 abstract = "I propose a novel approach to segmentation of image
49220 volumes that requires only a small amount of user
49221 intervention and that does not rely on prior global
49222 shape models. The approach, intrinsic shape for volume
49223 segmentation (IVSeg), comprises two methods. T he first
49224 method analyzes isolabel-contour maps to identify
49225 salient regions that correspond to major objects. The
49226 method detects transitions from within objects into the
49227 background by matching isolabel contours that form
49228 along the boundaries of objects as a result of
49229 multilevel thresholding with a fine partition of the
49230 intensity range. The second method searches in the
49231 entire sequence for regions that belong to an object
49232 that the user selects from one or a few sections. The
49233 method uses local overlap criteria to determine whether
49234 regions that overlap in a given direction (coronal,
49235 sagittal, or axial) belong to the same object. For
49236 extraction of blood vessels, the method derives the
49237 criteria dynamically by fitting cylinders to regions in
49238 consecutive sections and computing the expected overlap
49239 of slices of these cylinders. In a formal evaluation
49240 study with CTA data, I showed that IVSeg reduced user
49241 editing time by a factor of 5 without affecting the
49242 results in any significant way.",
49243 acknowledgement = ack-nhfb,
49244 xxnumber = "CS-TR-99-1617",
49245 }
49246
49247 @TechReport{Uribe:1999:ABD,
49248 author = "Tomas E. Uribe",
49249 title = "Abstraction-based Deductive-Algorithmic Verification
49250 of Reactive Systems",
49251 type = "Technical Report",
49252 number = "STAN-CS-99-1618",
49253 institution = inst-STAN-CS,
49254 address = inst-STAN-CS:adr,
49255 pages = "??",
49256 month = mar,
49257 year = "1999",
49258 bibdate = "Thu Nov 20 12:13:32 MST 2025",
49259 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
49260 URL = "http://www-db.stanford.edu/TR/CS-TR-99-1618.html",
49261 abstract = "This thesis presents a framework that combines
49262 deductive and algorithmic methods for verifying
49263 temporal properties of reactive systems, to allow more
49264 automatic verification of general infinite-state
49265 systems and the verification of larger finite-state
49266 ones. Underlying these methods is the theory of
49267 property-preserving assertion-based abstractions, where
49268 a finite-state abstraction of the system is deductively
49269 justified and algorithmically model checked. After
49270 presenting an abstraction framework that accounts for
49271 fairness, we describe a method to automatically
49272 generate finite-state abstractions. We then show how a
49273 number of other verification methods, including
49274 deductive rules, (Generalized) Verification Diagrams,
49275 and Deductive Model Checking, can also be understood as
49276 constructing finite-state abstractions that are model
49277 checked. Our analysis leads to a better classification
49278 and understanding of these verification methods.
49279 Furthermore, it shows how the different abstractions
49280 that they construct can be combined. For this, we
49281 present an algorithmic Extended Model Checking
49282 procedure, which uses all the information that these
49283 methods produce, in a finite-state format that can be
49284 easily and incrementally combined. Besides a standard
49285 safety component, the combined abstractions include
49286 extra bounds on fair transitions, well-founded orders,
49287 and constrained transition relations for the generation
49288 of counterexamples. Thus, our approach minimizes the
49289 need for user interaction and maximizes the impact of
49290 the available automated deduction and model checking
49291 tools. Once proved, verification conditions are re-used
49292 as much as possible, leaving the temporal and
49293 combinatorial reasoning to automatic tools.",
49294 acknowledgement = ack-nhfb,
49295 xxnumber = "CS-TR-99-1618",
49296 }
49297
49298 @TechReport{Huang:1999:IAA,
49299 author = "Cecil Huang",
49300 title = "Intelligent Alarms: Allocating Attention Among
49301 Concurrent Processes",
49302 type = "Technical Report",
49303 number = "STAN-CS-99-1619",
49304 institution = inst-STAN-CS,
49305 address = inst-STAN-CS:adr,
49306 pages = "??",
49307 month = apr,
49308 year = "1999",
49309 bibdate = "Thu Nov 20 12:13:32 MST 2025",
49310 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
49311 URL = "http://www-db.stanford.edu/TR/CS-TR-99-1619.html",
49312 abstract = "I have developed and evaluated a computable, normative
49313 framework for intelligent alarms: automated agents that
49314 allocate scarce attention resources to concurrent
49315 processes in a globally optimal manner. My approach is
49316 decision-theoretic, and relies on Markov decision
49317 processes to model time-varying, stochastic systems
49318 that respond to externally applied actions. Given a
49319 collection of continuing processes and a specified time
49320 horizon, my framework computes, for each process: (1)
49321 an attention allocation, which reflects how much
49322 attention the process is awarded, and (2) an activation
49323 price, which reflects the process's priority in
49324 receiving the allocated attention amount. I have
49325 developed a prototype, Simon, that computes these alarm
49326 signals for a simulated ICU. My validity experiments
49327 investigate whether sensible input results in sensible
49328 output. The results show that Simon produces alarm
49329 signals that are consistent with sound clinical
49330 judgment. To assess computability, I used Simon to
49331 generate alarm signals for an ICU that contained 144
49332 simulated patients; the entire computation took about 2
49333 seconds on a machine with only moderate processing
49334 capabilities. I thus conclude that my alarm framework
49335 is valid and computable, and therefore is potentially
49336 useful in a real-world ICU setting.",
49337 acknowledgement = ack-nhfb,
49338 xxnumber = "CS-TR-99-1619",
49339 }
49340
49341 @TechReport{Cohen:1999:FCS,
49342 author = "Scott Cohen",
49343 title = "Finding Color and Shape Patterns in Images",
49344 type = "Technical Report",
49345 number = "STAN-CS-99-1620",
49346 institution = inst-STAN-CS,
49347 address = inst-STAN-CS:adr,
49348 pages = "??",
49349 month = may,
49350 year = "1999",
49351 bibdate = "Thu Nov 20 12:13:32 MST 2025",
49352 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
49353 URL = "http://www-db.stanford.edu/TR/CS-TR-99-1620.html",
49354 abstract = "This thesis is devoted to the Earth Mover's Distance
49355 (EMD), an edit distance between distributions, and its
49356 use within content-based image retrieval (CBIR). The
49357 major CBIR problem discussed is the pattern problem:
49358 Given an image and a query pattern, determine if the
49359 image contains a region which is visually similar to
49360 the pattern; if so, find at least one such image
49361 region. An important problem that arises in applying
49362 the EMD to CBIR is the EMD under transformation
49363 (EMD\_G) problem: find a transformation of one
49364 distribution which minimizes its EMD to another, where
49365 the set of allowable transformations G is given. The
49366 problem of estimating the size/scale at which a pattern
49367 occurs in an image is phrased and efficiently solved as
49368 an EMD\_G problem. For a large class of transformation
49369 sets, we also present a monotonically convergent
49370 iteration to find at least a locally optimal
49371 transformation. Our pattern problem solution is the
49372 SEDL (Scale Estimation for Directed Location) image
49373 retrieval system. Three important contributions of SEDL
49374 are (1) a general framework for finding both color and
49375 shape patterns, (2) the previously mentioned scale
49376 estimation algorithm using the EMD, and (3) a directed
49377 (as opposed to exhaustive) search strategy.",
49378 acknowledgement = ack-nhfb,
49379 xxnumber = "CS-TR-99-1620",
49380 }
49381
49382 @TechReport{Rubner:1999:PMI,
49383 author = "Yossi Rubner",
49384 title = "Perceptual Metrics for Image Database Navigation",
49385 type = "Technical Report",
49386 number = "STAN-CS-99-1621",
49387 institution = inst-STAN-CS,
49388 address = inst-STAN-CS:adr,
49389 pages = "??",
49390 month = aug,
49391 year = "1999",
49392 bibdate = "Thu Nov 20 12:13:32 MST 2025",
49393 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
49394 URL = "http://www-db.stanford.edu/TR/CS-TR-99-1621.html",
49395 abstract = "The increasing amount of information available in
49396 today's world raises the need to retrieve relevant data
49397 efficiently. Unlike text-based retrieval, where
49398 keywords are successfully used to index into documents,
49399 content-based image retrieval poses up front the
49400 fundamental questions how to extract useful image
49401 features and how to use them for intuitive retrieval.
49402 We present a novel approach to the problem of
49403 navigating through a collection of images for the
49404 purpose of image retrieval, which leads to a new
49405 paradigm for image database search. We summarize the
49406 appearance of images by distributions of color or
49407 texture features, and we define a metric between any
49408 two such distributions. This metric, which we call the
49409 ``Earth Mover's Distance'' (EMD), represents the least
49410 amount of work that is needed to rearrange the mass is
49411 one distribution in order to obtain the other. We show
49412 that the EMD matches perceptual dissimilarity better
49413 than other dissimilarity measures, and argue that it
49414 has many desirable properties for image retrieval.
49415 Using this metric, we employ Multi-Dimensional Scaling
49416 techniques to embed a group of images as points in a
49417 two- or three-dimensional Euclidean space so that their
49418 distances reflect image dissimilarities as well as
49419 possible. Such geometric embeddings exhibit the
49420 structure in the image set at hand, allowing the user
49421 to understand better the result of a database query and
49422 to refine the query in a perceptually intuitive way. By
49423 iterating this process, the user can quickly zoom in to
49424 the portion of the image space of interest. We also
49425 apply these techniques to other modalities such as
49426 mug-shot retrieval.",
49427 acknowledgement = ack-nhfb,
49428 xxnumber = "CS-TR-99-1621",
49429 }
49430
49431 @TechReport{Oldham:1999:MGF,
49432 author = "Jeffrey David Oldham",
49433 title = "Multicommodity and Generalized Flow Algorithms: Theory
49434 and Practice",
49435 type = "Technical Report",
49436 number = "STAN-CS-99-1622",
49437 institution = inst-STAN-CS,
49438 address = inst-STAN-CS:adr,
49439 pages = "??",
49440 month = aug,
49441 year = "1999",
49442 bibdate = "Thu Nov 20 12:13:32 MST 2025",
49443 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
49444 URL = "http://www-db.stanford.edu/TR/CS-TR-99-1622.html",
49445 abstract = "We present several simple, practical, and fast
49446 algorithms for linear programs, concentrating on
49447 network flow problems. Since the late 1980s,
49448 researchers developed different combinatorial
49449 approximation algorithms for fractional packing
49450 problems, obtaining the fastest theoretical running
49451 times to solve multicommodity minimum-cost and
49452 concurrent flow problems. A direct implementation of
49453 these multicommodity flow algorithms was several orders
49454 of magnitude slower than solving these problems using a
49455 commercial linear programming solver. Through
49456 experimentation, we determined which theoretically
49457 equivalent constructs are experimentally efficient.
49458 Guided by theory, we designed and implemented practical
49459 improvements while maintaining the same worst-case
49460 complexity bounds. The resulting algorithms solve
49461 problems orders of magnitude faster than commercial
49462 linear programming solvers and problems an order of
49463 magnitude larger. We also present simple, combinatorial
49464 algorithms for generalized flow problems. These
49465 problems generalize ordinary network flow problems by
49466 specifying a flow multiplier \mu(a) for each arc a.
49467 Using multipliers permit a flow problem to model
49468 transforming one type into another, e.g., currency
49469 exchange, and modification of the amount of flow, e.g.,
49470 water evaporation from canals or accrual of interest in
49471 bank accounts. First, we show the generalized shortest
49472 paths problem can be solved using existing network flow
49473 ideas, i.e., by combining the Bellman-Ford-Moore
49474 shortest path framework and Megiddo's parametric
49475 search. Second, we combine this algorithm with
49476 fractional packing frameworks to yield the first
49477 polynomial-time combinatorial approximation algorithms
49478 for the generalized versions of the nonnegative-cost
49479 minimum-cost flow, concurrent flow, multicommodity
49480 maximum flow, and multicommodity nonnegative-cost
49481 minimum-cost flow problems. These algorithms show that
49482 generalized concurrent flow and multicommodity maximum
49483 flow have strongly polynomial approximation
49484 algorithms.",
49485 acknowledgement = ack-nhfb,
49486 xxnumber = "CS-TR-99-1622",
49487 }
49488
49489 @TechReport{Labio:1999:EMR,
49490 author = "Wilburt Juan Labio",
49491 title = "Efficient Maintenance and Recovery of Data
49492 Warehouses",
49493 type = "Technical Report",
49494 number = "STAN-CS-99-1623",
49495 institution = inst-STAN-CS,
49496 address = inst-STAN-CS:adr,
49497 pages = "??",
49498 month = aug,
49499 year = "1999",
49500 bibdate = "Thu Nov 20 12:13:32 MST 2025",
49501 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
49502 URL = "http://www-db.stanford.edu/TR/CS-TR-99-1623.html",
49503 abstract = "Data warehouses collect data from multiple remote
49504 sources and integrate the information as materialized
49505 views in a local database. The materialized views are
49506 used to answer queries that analyze the collected data
49507 for patterns, and trends. This type of query processing
49508 is often called on-line analytical processing (OLAP).
49509 The warehouse views must be updated when changes are
49510 made to the remote information sources. Otherwise, the
49511 answers to OLAP queries are based on stale data.
49512 Answering OLAP queries based on stale data is clearly a
49513 problem especially if OLAP queries are used to support
49514 critical decisions made by the organization that owns
49515 the data warehouse. Because the primary purpose of the
49516 data warehouse is to answer OLAP queries, only a
49517 limited amount of time and/or resources can be devoted
49518 to the warehouse update. Hence, we have developed new
49519 techniques to ensure that the warehouse update can be
49520 done efficiently. Also, the warehouse update is not
49521 devoid of failures. Since only a limited amount of time
49522 and/or resources are devoted to the warehouse update,
49523 it is most likely infeasible to restart the warehouse
49524 update from scratch. Thus, we have developed new
49525 techniques for resuming failed warehouse updates.
49526 Finally, warehouse updates typically transfer gigabytes
49527 of data into the warehouse. Although the price of disk
49528 storage is decreasing, there will be a point in the
49529 ``lifetime'' of a data warehouse when keeping and
49530 administering all of the collected is unreasonable.
49531 Thus, we have investigated techniques for reducing the
49532 storage cost of a data warehouse by selectively
49533 ``expiring'' information that is not needed.",
49534 acknowledgement = ack-nhfb,
49535 xxnumber = "CS-TR-99-1623",
49536 }
49537
49538 @TechReport{Greenwald:1999:NBS,
49539 author = "Michael Greenwald",
49540 title = "Non-blocking Synchronization and System Design",
49541 type = "Technical Report",
49542 number = "STAN-CS-99-1624",
49543 institution = inst-STAN-CS,
49544 address = inst-STAN-CS:adr,
49545 pages = "??",
49546 month = aug,
49547 year = "1999",
49548 bibdate = "Thu Nov 20 12:13:32 MST 2025",
49549 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
49550 URL = "http://www-db.stanford.edu/TR/CS-TR-99-1624.html",
49551 abstract = "Non-blocking synchronization (NBS) has significant
49552 advantages over blocking synchronization in areas of
49553 fault-tolerance, system structure, portability, and
49554 performance. These advantages gain importance with the
49555 increased use of parallelism and multiprocessors, and
49556 as delays increase relative to processor speed. This
49557 thesis demonstrates that non-blocking synchronization
49558 is practical as the sole co-ordination mechanism in
49559 systems by showing that careful OS design eases
49560 implementation of efficient NBS, by demonstrating that
49561 DCAS (Double-Compare-and-Swap) is the necessary and
49562 sufficient primitive for implementing NBS, and by
49563 demonstrating that efficient hardware DCAS is practical
49564 for RISC processors. This thesis presents
49565 high-performance non-blocking implementations of common
49566 data-structures sufficient to implement an operating
49567 system kernel. I also present more general algorithms:
49568 non-blocking implementations of \casn\ and software
49569 transactional memory. Both have overhead proportional
49570 to the number of writes, support multi\--objects, and
49571 use a DCAS-based contention-reduction technique that is
49572 fault-tolerant and OS-independent yet performs as well
49573 as the best previously published techniques. I
49574 demonstrate that proposed OS implementations of DCAS
49575 are inefficient, and propose a design for efficient
49576 hardware DCAS specific to the R4000 but generalizable
49577 to other RISC processors.",
49578 acknowledgement = ack-nhfb,
49579 xxnumber = "CS-TR-99-1624",
49580 }
49581
49582 @TechReport{Iliano:1999:PPC,
49583 author = "Iliano Cervesato and John C. Mitchell",
49584 title = "{Pleiades Project}: Collected Work 1998--1999",
49585 type = "Technical Report",
49586 number = "STAN-CS-99-1625",
49587 institution = inst-STAN-CS,
49588 address = inst-STAN-CS:adr,
49589 pages = "??",
49590 month = aug,
49591 year = "1999",
49592 bibdate = "Thu Nov 20 12:13:32 MST 2025",
49593 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
49594 URL = "http://www-db.stanford.edu/TR/CS-TR-99-1625.html",
49595 abstract = "This report collects the papers that were written by
49596 the participants of the Pleiades Project and their
49597 collaborators from September 1998 to August 1999. Its
49598 intent is to give the reader an overview of our
49599 accomplishments during this central phase of the
49600 project. Therefore, rather than including complete
49601 publications, we chose to reproduce only the first four
49602 pages of each paper. The papers can be integrally
49603 retrieved from the World-Wide Web through the provided
49604 URLs. A list of the current publications of the
49605 Pleiades Project is accessible at the URL
49606 http://theory.stanford.edu/muri/papers.html. Future
49607 articles will be posted there as they become
49608 available.",
49609 acknowledgement = ack-nhfb,
49610 xxnumber = "CS-TR-99-1625",
49611 }
49612
49613 %%% ====================================================================
49614 %%% [From the comment preamble of this file]: ``From the year 2000,
49615 %%% global sequential numbers are no longer supplied, and reports are
49616 %%% identified as CSTR YYYY-nn, where nn is reset at each year YYYY. In
49617 %%% addition, none of those reports carries a normal title page or a
49618 %%% STAN-CS report number: most appear to be conference proceedings
49619 %%% preprints.''
49620
49621 @TechReport{Guimbretiere:2000:FCC,
49622 author = "Fran{\c{c}}ois Guimbreti{\`e}re and Terry Winograd",
49623 title = "{FlowMenu}: Combining Command, Text, and Data Entry",
49624 type = "Technical Report",
49625 number = "CSTR 2000-01",
49626 institution = inst-STAN-CS,
49627 address = inst-STAN-CS:adr,
49628 pages = "4",
49629 month = "????",
49630 year = "2000",
49631 bibdate = "Fri Nov 21 07:40:47 MST 2025",
49632 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
49633 URL = "http://graphics.stanford.edu/papers/FlowMenu/flowmenu.pdf",
49634 abstract = "We present a new kind of marking menu that was
49635 developed for use with a pen device on display surfaces
49636 such as large, high resolution, wall-mounted displays.
49637 It integrates capabilities of previously separate
49638 mechanisms such as marking menus and Quikwriting, and
49639 facilitates the entry of multiple commands. While using
49640 this menu, the pen never has to leave the active
49641 surface so that consecutive menu selections, data entry
49642 (text and parameters) and direct manipulation tasks can
49643 be integrated fluidly.",
49644 acknowledgement = ack-nhfb,
49645 keywords = "Control Menu; Interactive surface; Marking menu;
49646 Quikwriting",
49647 pdfpages = "4",
49648 }
49649
49650 @TechReport{Johanson:2000:EHE,
49651 author = "Brad Johanson and Armando Fox and Pat Hanrahan and
49652 Terry Winograd",
49653 title = "The {Event Heap}: an Enabling Infrastructure for
49654 Interactive Workspaces",
49655 type = "Technical Report",
49656 number = "CSTR 2000-02",
49657 institution = inst-STAN-CS,
49658 address = inst-STAN-CS:adr,
49659 pages = "??",
49660 day = "",
49661 month = may,
49662 year = "2000",
49663 bibdate = "Fri Nov 21 07:40:47 MST 2025",
49664 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
49665 URL = "https://graphics.stanford.edu/papers/eheap/",
49666 abstract = "",
49667 acknowledgement = ack-nhfb,
49668 }
49669
49670 @TechReport{Johanson:2000:PSP,
49671 author = "Brad Johanson and Greg Hutchins and Terry Winograd",
49672 title = "{PointRight}: a System for Pointer\slash Keyboard
49673 Redirection Among, Multiple Displays and Machines",
49674 type = "Technical Report",
49675 number = "CSTR 2000-03",
49676 institution = inst-STAN-CS,
49677 address = inst-STAN-CS:adr,
49678 pages = "??",
49679 day = "",
49680 month = may,
49681 year = "2000",
49682 bibdate = "Fri Nov 21 07:40:47 MST 2025",
49683 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
49684 URL = "http://graphics.stanford.edu/papers/pointright/",
49685 abstract = "",
49686 acknowledgement = ack-nhfb,
49687 }
49688
49689 @TechReport{Ringel:2000:BIF,
49690 author = "Meredith Ringel and Henry Berg and Yuhui Jin and Terry
49691 Winograd",
49692 title = "{Barehands}: Implement-Free Interaction with a
49693 Wall-Mounted Display",
49694 type = "Technical Report",
49695 number = "CSTR 2000-04",
49696 institution = inst-STAN-CS,
49697 address = inst-STAN-CS:adr,
49698 pages = "7",
49699 month = may,
49700 year = "2000",
49701 bibdate = "Fri Nov 21 07:40:47 MST 2025",
49702 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
49703 URL = "https://hci.stanford.edu/cstr/reports/bhlong.pdf",
49704 abstract = "We describe Barehands, a free-handed interaction
49705 technique, in which the user can control the invocation
49706 of system commands and tools on a touch screen by
49707 touching it with distinct hand postures. Using
49708 behind-screen infrared (IR) illumination and a video
49709 camera with an IR filter, we enable a back-projected
49710 SMARTBoard (a commercially available, 61in $ \times $
49711 47in touch-sensing display) to identify and respond to
49712 several distinct hand postures. Barehands provides a
49713 natural, quick, implement-free method of interacting
49714 with large, wall-mounted interactive surfaces.",
49715 acknowledgement = ack-nhfb,
49716 pdfpages = "7",
49717 }
49718
49719 @TechReport{Guimbretiere:2000:GWE,
49720 author = "Fran{\c{c}}ois Guimbreti{\`e}re and Terry Winograd and
49721 Sha Xin Wei",
49722 title = "The {Geometer's Workbench}: an Experiment in
49723 Interacting with a Large, High Resolution Display",
49724 type = "Technical Report",
49725 number = "CSTR 2000-05",
49726 institution = inst-STAN-CS,
49727 address = inst-STAN-CS:adr,
49728 pages = "7",
49729 month = jun,
49730 year = "2000",
49731 bibdate = "Fri Nov 21 07:40:47 MST 2025",
49732 bibsource = "https://www.math.utah.edu/pub/tex/bib/mathematica.bib;
49733 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
49734 URL = "http://graphics.stanford.edu/%7Efrancois/Papers/UIST2000/geometerworkbench.pdf",
49735 abstract = "We describe the Geometer's Workbench, a graphical
49736 front end for Mathematica running on the Interactive
49737 Mural, a large high resolution display. Our system
49738 bridges the gap between casual whiteboard interaction
49739 and the more formal use of a tool like Mathematica. We
49740 anticipate that the experience gained from designing
49741 and testing such a tool can be generalized to a large
49742 class of technical and scientific applications that use
49743 large, high resolution displays.",
49744 acknowledgement = ack-nhfb,
49745 keywords = "Ebeam; geometry; Interactive display; Mathematica;
49746 whiteboard",
49747 pdfpages = "7",
49748 }
49749
49750 @TechReport{Chen:2000:LMU,
49751 author = "Xing Chen and James Davis",
49752 title = "{LumiPoint}: Multi-User Laser-Based Interaction on
49753 Large Tiled Displays",
49754 type = "Technical Report",
49755 number = "CSTR 2000-06",
49756 institution = inst-STAN-CS,
49757 address = inst-STAN-CS:adr,
49758 pages = "??",
49759 day = "",
49760 month = jun,
49761 year = "2000",
49762 bibdate = "Fri Nov 21 07:40:47 MST 2025",
49763 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
49764 URL = "http://graphics.stanford.edu/papers/multiuser",
49765 abstract = "",
49766 acknowledgement = ack-nhfb,
49767 }
49768
49769 @TechReport{Chen:2000:CPC,
49770 author = "Xing Chen and James Davis",
49771 title = "Camera Placement Considering Occlusion for Robust
49772 Motion Capture",
49773 type = "Technical Report",
49774 number = "CSTR 2000-07",
49775 institution = inst-STAN-CS,
49776 address = inst-STAN-CS:adr,
49777 pages = "??",
49778 day = "",
49779 month = dec,
49780 year = "2000",
49781 bibdate = "Fri Nov 21 07:40:47 MST 2025",
49782 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
49783 URL = "http://graphics.stanford.edu/papers/OcclusionMetric/",
49784 abstract = "",
49785 acknowledgement = ack-nhfb,
49786 }
49787
49788 @TechReport{Davis:2000:MSM,
49789 author = "James Davis and Xing Chen",
49790 title = "Mixed Scale Motion Recovery Using Guidable Cameras",
49791 type = "Technical Report",
49792 number = "CSTR 2000-08",
49793 institution = inst-STAN-CS,
49794 address = inst-STAN-CS:adr,
49795 pages = "??",
49796 day = "",
49797 month = dec,
49798 year = "2000",
49799 bibdate = "Fri Nov 21 07:40:47 MST 2025",
49800 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
49801 URL = "http://graphics.stanford.edu/papers/GuidableCameras/",
49802 abstract = "",
49803 acknowledgement = ack-nhfb,
49804 }
49805
49806 @TechReport{Johanson:2001:SSI,
49807 author = "Brad Johanson and Shankar Ponnekanti and Emre Kiciman
49808 and Caesar Sengupta and Armando Fox",
49809 title = "System Support for Interactive Workspaces",
49810 type = "Technical Report",
49811 number = "CSTR 2001-01",
49812 institution = inst-STAN-CS,
49813 address = inst-STAN-CS:adr,
49814 pages = "??",
49815 day = "",
49816 month = mar,
49817 year = "2001",
49818 bibdate = "Fri Nov 21 07:40:47 MST 2025",
49819 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
49820 URL = "http://graphics.stanford.edu/papers/iwork-sosp18/",
49821 abstract = "",
49822 acknowledgement = ack-nhfb,
49823 }
49824
49825 @TechReport{Marschner:2001:FHC,
49826 author = "Stephen R. Marschner and James Davis and Matt Garr and
49827 Marc Levoy",
49828 title = "Filling holes in complex surfaces using volumetric
49829 diffusion",
49830 type = "Technical Report",
49831 number = "CSTR 2001-07",
49832 institution = inst-STAN-CS,
49833 address = inst-STAN-CS:adr,
49834 pages = "??",
49835 day = "",
49836 month = jan,
49837 year = "2001",
49838 bibdate = "Fri Nov 21 07:40:47 MST 2025",
49839 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
49840 URL = "https://graphics.stanford.edu/papers/holefill-tr-2001-07/",
49841 abstract = "",
49842 acknowledgement = ack-nhfb,
49843 }
49844
49845 @TechReport{Davis:2001:FHC,
49846 author = "James Davis and Stephen R. Marschner and Matt Garr and
49847 Marc Levoy",
49848 title = "Filling holes in complex surfaces using volumetric
49849 diffusion",
49850 type = "Technical Report",
49851 number = "CSTR 2001-08",
49852 institution = inst-STAN-CS,
49853 address = inst-STAN-CS:adr,
49854 pages = "??",
49855 day = "",
49856 month = dec,
49857 year = "2001",
49858 bibdate = "Fri Nov 21 07:40:47 MST 2025",
49859 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
49860 URL = "https://graphics.stanford.edu/papers/holefill-tr-2001-08/",
49861 abstract = "",
49862 acknowledgement = ack-nhfb,
49863 }
49864
49865 @TechReport{Wei:2002:OIT,
49866 author = "Li-Yi Wei and Marc Levoy",
49867 title = "Order-Independent Texture Synthesis",
49868 type = "Technical Report",
49869 number = "CSTR 2002-01",
49870 institution = inst-STAN-CS,
49871 address = inst-STAN-CS:adr,
49872 pages = "??",
49873 day = "",
49874 month = jan,
49875 year = "2002",
49876 bibdate = "Fri Nov 21 07:40:47 MST 2025",
49877 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
49878 URL = "http://graphics.stanford.edu/papers/texture-synthesis-tr-2002-01/",
49879 abstract = "",
49880 acknowledgement = ack-nhfb,
49881 }
49882
49883 @TechReport{Chuang:2002:PDF,
49884 author = "Erica Chuang and Chris Bregler",
49885 title = "Performance Driven Facial Animation using Blendshape
49886 Interpolation",
49887 type = "Technical Report",
49888 number = "CSTR 2002-02",
49889 institution = inst-STAN-CS,
49890 address = inst-STAN-CS:adr,
49891 pages = "??",
49892 day = "",
49893 month = apr,
49894 year = "2002",
49895 bibdate = "Fri Nov 21 07:40:47 MST 2025",
49896 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
49897 URL = "http://graphics.stanford.edu/%7Eechuang/face",
49898 abstract = "",
49899 acknowledgement = ack-nhfb,
49900 }
49901
49902 @TechReport{Ionescu:2002:WCR,
49903 author = "Arna Ionescu and Maureen Stone and Terry Winograd",
49904 title = "{WorkspaceNavigator}: Capture, Recall and Reuse using
49905 Spatial Cues in an Interactive Workspace",
49906 type = "Technical Report",
49907 number = "CSTR 2002-04",
49908 institution = inst-STAN-CS,
49909 address = inst-STAN-CS:adr,
49910 pages = "16",
49911 month = may,
49912 year = "2002",
49913 bibdate = "Fri Nov 21 07:40:47 MST 2025",
49914 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
49915 URL = "http://hci.stanford.edu/research/wkspcNavTR.pdf",
49916 abstract = "This paper describes the WorkspaceNavigator, a suite
49917 of tools to support the capture, recall and reuse of
49918 material and ideas generated by a group working in an
49919 interactive workspace in an unstructured manner. Our
49920 focus is on the capture of digital information,
49921 including screenshots, files, and URLs. These are
49922 stored as a sequence of timeslices, integrated by an
49923 overview image of the physical space at the time of the
49924 capture. The overview image provides spatial cues for
49925 accessing the captured information. We conducted two
49926 user studies of the WorkspaceNavigator tools and
49927 present a number of observations on the design of the
49928 interaction and the ways in which users understood and
49929 adapted our tools. We show that capturing coordinated
49930 slices of digital information is useful for recall and
49931 summarization activities, and that coordinating access
49932 through the visual metaphor of the overview image is
49933 understandable and effective.",
49934 acknowledgement = ack-nhfb,
49935 pdfpages = "16",
49936 }
49937
49938 @TechReport{Ikemoto:2003:HMA,
49939 author = "Leslie Ikemoto",
49940 title = "A Hierarchical Method for Aligning Warped Meshes",
49941 type = "Technical Report",
49942 number = "CSTR 2003-01",
49943 institution = inst-STAN-CS,
49944 address = inst-STAN-CS:adr,
49945 pages = "23",
49946 month = jun,
49947 year = "2003",
49948 bibdate = "Fri Nov 21 07:40:47 MST 2025",
49949 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
49950 note = "Master's with Distinction in Research Report.",
49951 URL = "https://hci.stanford.edu/cstr/reports/2003-01.pdf",
49952 abstract = "Current alignment algorithms for registering range
49953 data captured from a 3D scanner assume that the range
49954 data depicts identical geometry taken from different
49955 views. However, in the presence of scanner calibration
49956 errors, the data will be slightly warped. These warps
49957 often cause current alignment algorithms to converge
49958 slowly, find the wrong alignment, or even diverge. In
49959 this research report, we present a method for aligning
49960 warped range data represented by polygon meshes. Our
49961 strategy can be characterized as a coarse-to-fine
49962 hierarchical approach, where we assume that since the
49963 warp is global, we can compensate for it by treating
49964 each mesh as a collection of smaller piecewise rigid
49965 sections, which can translate and rotate with respect
49966 to each other. We split the meshes subject to several
49967 constraints, in order to ensure that the resulting
49968 sections converge",
49969 acknowledgement = ack-nhfb,
49970 pdfpages = "23",
49971 }
49972
49973 @TechReport{Chang:2003:HE,
49974 author = "Erica Chang and Chris Bregler",
49975 title = "Head Emotion",
49976 type = "Technical Report",
49977 number = "CSTR 2003-02",
49978 institution = inst-STAN-CS,
49979 address = inst-STAN-CS:adr,
49980 pages = "??",
49981 day = "7",
49982 month = apr,
49983 year = "2003",
49984 bibdate = "Fri Nov 21 07:40:47 MST 2025",
49985 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
49986 URL = "http://graphics.stanford.edu/%7Eechuang/heademotion/index.html",
49987 abstract = "",
49988 acknowledgement = ack-nhfb,
49989 }
49990
49991 @TechReport{Buck:2003:DPC,
49992 author = "Ian Buck and Pat Hanrahan",
49993 title = "Data Parallel Computation on Graphics Hardware",
49994 type = "Technical Report",
49995 number = "CSTR 2003-03",
49996 institution = inst-STAN-CS,
49997 address = inst-STAN-CS:adr,
49998 pages = "??",
49999 day = "22",
50000 month = jan,
50001 year = "2003",
50002 bibdate = "Fri Nov 21 07:40:47 MST 2025",
50003 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
50004 URL = "https://hci.stanford.edu/cstr/abstracts/2003-03.html",
50005 abstract = "",
50006 acknowledgement = ack-nhfb,
50007 }
50008
50009 @TechReport{Abstract:2003:BSV,
50010 author = "Ian Buck",
50011 title = "{Brook} Specification v0.2",
50012 type = "Technical Report",
50013 number = "CSTR 2003-04",
50014 institution = inst-STAN-CS,
50015 address = inst-STAN-CS:adr,
50016 pages = "??",
50017 day = "31",
50018 month = oct,
50019 year = "2003",
50020 bibdate = "Fri Nov 21 07:40:47 MST 2025",
50021 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
50022 URL = "https://hci.stanford.edu/cstr/abstracts/2003-04.html",
50023 abstract = "",
50024 acknowledgement = ack-nhfb,
50025 }
50026
50027 @TechReport{Grant:2003:BSB,
50028 author = "Karen D. Grant and Adrian Graham and Tom Nguyen and
50029 Andreas Paepcke and Terry Winograd",
50030 title = "Beyond the Shoe Box: Foundations for Flexibly
50031 Organizing Photographs on a Computer",
50032 type = "Technical Report",
50033 number = "CSTR 2003-05",
50034 institution = inst-STAN-CS,
50035 address = inst-STAN-CS:adr,
50036 pages = "??",
50037 day = "15",
50038 month = jan,
50039 year = "2003",
50040 bibdate = "Fri Nov 21 07:40:47 MST 2025",
50041 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
50042 URL = "https://hci.stanford.edu/cstr/reports/2003-05.pdf",
50043 abstract = "As a foundation for designing computer-supported
50044 photograph management tools, we have been conducting
50045 focused experiments. Here, we describe our analysis of
50046 how people initially organize collections of familiar
50047 images. We asked 26 subjects in pairs to organize 50
50048 images on a common horizontal table. Each pair then
50049 organized a different 50-image set on a computer table
50050 of identical surface area. The bottom-projected
50051 computer tabletop displayed our interface to several
50052 online, pile-based affordances we wished to evaluate.
50053 Subjects used pens to interact with the system. We
50054 highlight aspects of the computer environment that were
50055 notably important to subjects and others that they
50056 cared about less than we had hypothesized. For example,
50057 a strong majority preferred computer-generated
50058 representations of piles to be grid-shaped over several
50059 alternatives, some of which mimicked the physical world
50060 closely and others that used transparency to save
50061 space.",
50062 acknowledgement = ack-nhfb,
50063 keywords = "clusters; collaboration; digital photographs;
50064 interaction design; personal digital library; pile
50065 manipulation; pile representations; piles interface;
50066 spatial organization system; tabletop display; user
50067 study",
50068 }
50069
50070 @TechReport{Song:2003:ISF,
50071 author = "Yee Jiun Song and Wendy Tobagus and Der Yao Leong and
50072 Brad Johanson and Armando Fox",
50073 title = "{iSecurity}: a Security Framework for Interactive
50074 Workspaces",
50075 type = "Technical Report",
50076 number = "CSTR 2004-03",
50077 institution = inst-STAN-CS,
50078 address = inst-STAN-CS:adr,
50079 pages = "??",
50080 day = "3",
50081 month = sep,
50082 year = "2003",
50083 bibdate = "Fri Nov 21 07:40:47 MST 2025",
50084 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
50085 URL = "https://hci.stanford.edu/cstr/abstracts/2004-03.html",
50086 abstract = "",
50087 acknowledgement = ack-nhfb,
50088 }
50089
50090 @TechReport{Wilburn:2004:SSI,
50091 author = "Bennett Wilburn and Neel Joshi and Katherine Chou and
50092 Marc Levoy and Mark Horowitz",
50093 title = "Spatiotemporal Sampling and Interpolation for Dense
50094 Camera Arrays",
50095 type = "Technical Report",
50096 number = "CSTR 2004-01",
50097 institution = inst-STAN-CS,
50098 address = inst-STAN-CS:adr,
50099 pages = "??",
50100 day = "21",
50101 month = jan,
50102 year = "2004",
50103 bibdate = "Fri Nov 21 07:40:47 MST 2025",
50104 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
50105 URL = "https://hci.stanford.edu/cstr/abstracts/2004-01.html",
50106 abstract = "",
50107 acknowledgement = ack-nhfb,
50108 }
50109
50110 @TechReport{and:2004:CCA,
50111 author = "Neel Joshi",
50112 title = "Color Calibration for Arrays of Inexpensive Image
50113 Sensors",
50114 type = "Technical Report",
50115 number = "CSTR 2004-02",
50116 institution = inst-STAN-CS,
50117 address = inst-STAN-CS:adr,
50118 pages = "iv + 26",
50119 day = "31",
50120 month = mar,
50121 year = "2004",
50122 bibdate = "Fri Nov 21 07:40:47 MST 2025",
50123 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
50124 note = "Master's with Distinction in Research Report.",
50125 URL = "https://hci.stanford.edu/cstr/reports/2004-02.pdf",
50126 abstract = "The recent emergence of inexpensive image sensors has
50127 enabled the construction of large arrays of cameras for
50128 computer graphics and computer vision applications.
50129 These inexpensive image sensors have inconsistent color
50130 responses. These inconsistencies can cause significant
50131 errors in color sensitive multi-camera applications. We
50132 present an automated, robust system for calibrating
50133 large arrays of image sensors to achieve significantly
50134 improved color consistency. We acquire images of a
50135 Macbeth color checker placed in the scene and perform
50136 gain and offset calibration on each individual sensor.
50137 This process combined with a global correction step
50138 maximizes the response range by maximizing contrast and
50139 minimizing the black level and ensures linear response
50140 that is white balanced for the scene. We present
50141 results with data acquired from 45, 52, and 95-camera
50142 arrays calibrated both indoors and outdoors for a
50143 variety of color-sensitive applications including
50144 high-speed video, matted synthetic aperture
50145 photography, and multi-camera optical flow.",
50146 acknowledgement = ack-nhfb,
50147 pdfpages = "30",
50148 }
50149
50150 @TechReport{Yeh:2004:FNF,
50151 author = "Ron B. Yeh and Scott Klemmer",
50152 title = "Field Notes on Field Notes: Informing Technology
50153 Support for Biologists",
50154 type = "Technical Report",
50155 number = "CSTR 2004-04",
50156 institution = inst-STAN-CS,
50157 address = inst-STAN-CS:adr,
50158 pages = "??",
50159 day = "13",
50160 month = dec,
50161 year = "2004",
50162 bibdate = "Fri Nov 21 07:40:47 MST 2025",
50163 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
50164 URL = "http://hci.stanford.edu/publications/techreports/CHI2005-Biology.pdf",
50165 acknowledgement = ack-nhfb,
50166 }
50167
50168 @TechReport{Johanson:2004:SIW,
50169 author = "Brad Johanson and Armando Fox and Terry Winograd",
50170 title = "The {Stanford Interactive Workspaces Project}",
50171 type = "Technical Report",
50172 number = "CSTR 2004-05",
50173 institution = inst-STAN-CS,
50174 address = inst-STAN-CS:adr,
50175 pages = "30",
50176 day = "9",
50177 month = aug,
50178 year = "2004",
50179 bibdate = "Fri Nov 21 07:40:47 MST 2025",
50180 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
50181 URL = "https://hci.stanford.edu/cstr/reports/2004-05.pdf",
50182 abstract = "The Stanford Interactive Workspaces Project has
50183 created and studied new technologies for integrated
50184 multi-person, multi-device collaborative work settings.
50185 In addition to our primary testbed, the iRoom, we have
50186 deployed a number of interactive workspaces at Stanford
50187 and at other institutions and evaluated their use in
50188 educational settings. The core technologies in these
50189 spaces are built around our software infrastructure,
50190 iROS, which provides a suite of tools for integration
50191 and interaction.",
50192 acknowledgement = ack-nhfb,
50193 pdfpages = "30",
50194 }
50195
50196 @TechReport{and:2005:SBX,
50197 author = "Jan Chong",
50198 title = "Social Behaviors on {XP} Teams and non-{XP} teams: a
50199 Comparative Study",
50200 type = "Technical Report",
50201 number = "CSTR 2005-01",
50202 institution = inst-STAN-CS,
50203 address = inst-STAN-CS:adr,
50204 pages = "10",
50205 day = "15",
50206 month = mar,
50207 year = "2005",
50208 bibdate = "Fri Nov 21 07:40:47 MST 2025",
50209 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
50210 URL = "https://hci.stanford.edu/cstr/reports/2005-01.pdf",
50211 abstract = "This is an ethnographic study of two software
50212 development teams within the same organization, one
50213 which utilizes the Extreme Programming (XP) methodology
50214 and one which does not. This study compares the work
50215 routines and work practices of the software developers
50216 on the XP team and the non-XP team. Observed behavior
50217 suggests that certain features of the XP methodology
50218 lead to greater uniformity in work routine and work
50219 practice across individual team members. The data also
50220 suggest that the XP methodology makes awareness
50221 development and maintenance less effortful on a
50222 software development team.",
50223 acknowledgement = ack-nhfb,
50224 pdfpages = "10",
50225 }
50226
50227 @TechReport{Ng:2005:LFP,
50228 author = "Ren Ng and Marc Levoy and Mathieu Br{\'e}dif and Gene
50229 Duval and Mark Horowitz and Pat Hanrahan",
50230 title = "Light Field Photography with a Hand-Held Plenoptic
50231 Camera",
50232 type = "Technical Report",
50233 number = "CSTR 2005-02",
50234 institution = inst-STAN-CS,
50235 address = inst-STAN-CS:adr,
50236 pages = "11",
50237 day = "20",
50238 month = apr,
50239 year = "2005",
50240 bibdate = "Fri Nov 21 07:40:47 MST 2025",
50241 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
50242 URL = "http://graphics.stanford.edu/papers/lfcamera/",
50243 abstract = "This paper presents a camera that samples the 4D light
50244 field on its sensor in a single photographic exposure.
50245 This is achieved by inserting a microlens array between
50246 the sensor and main lens, creating a plenoptic camera.
50247 Each microlens measures not just the total amount of
50248 light deposited at that location, but how much light
50249 arrives along each ray. By re-sorting the measured rays
50250 of light to where they would have terminated in
50251 slightly different, synthetic cameras, we can compute
50252 sharp photographs focused at different depths. We show
50253 that a linear increase in the resolution of images
50254 under each microlens results in a linear increase in
50255 the sharpness of the refocused photographs. This
50256 property allows us to extend the depth of field of the
50257 camera without reducing the aperture, enabling shorter
50258 exposures and lower image noise. Especially in the
50259 macrophotography regime, we demonstrate that we can
50260 also compute synthetic photographs from a range of
50261 different viewpoints. These capabilities argue for a
50262 different strategy in designing photographic imaging
50263 systems.\par
50264
50265 To the photographer, the plenoptic camera operates
50266 exactly like an ordinary hand-held camera. We have used
50267 our prototype to take hundreds of light field
50268 photographs, and we present examples of portraits,
50269 high-speed action and macro close-ups.",
50270 acknowledgement = ack-nhfb,
50271 keywords = "Digital photography; light field; microlens array;
50272 refocusing; synthetic photography",
50273 pdfpages = "11",
50274 }
50275
50276 @TechReport{Pauly:2005:EBS,
50277 author = "Mark Pauly and Niloy J. Mitra and Joachim Giesen and
50278 Leonidas Guibas and Markus Gross",
50279 title = "Example-Based {3D} Scan Completion",
50280 type = "Technical Report",
50281 number = "CSTR 2005-03",
50282 institution = inst-STAN-CS,
50283 address = inst-STAN-CS:adr,
50284 pages = "??",
50285 day = "29",
50286 month = apr,
50287 year = "2005",
50288 bibdate = "Fri Nov 21 07:40:47 MST 2025",
50289 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
50290 URL = "https://hci.stanford.edu/cstr/reports/2005-03.pdf",
50291 abstract = "Optical acquisition devices often produce noisy and
50292 incomplete data sets, due to occlusion, unfavorable
50293 surface reflectance properties, or geometric
50294 restrictions in the scanner setup. We present a novel
50295 approach for obtaining a complete and consistent 3D
50296 model representation from such incomplete surface
50297 scans, using a database of 3D shapes to provide
50298 geometric priors for regions of missing data. Our
50299 method retrieves suitable context models from the
50300 database, warps the retrieved models to conform with
50301 the input data, and consistently blends the warped
50302 models to obtain the final consolidated 3D shape. We
50303 define a shape matching penalty function and
50304 corresponding optimization scheme for computing the
50305 non-rigid alignment of the context models with the
50306 input data. This allows a quantitative evaluation and
50307 comparison of the quality of the shape extrapolation
50308 provided by each model. Our algorithms are explicitly
50309 designed to accommodate uncertain data and can thus be
50310 applied directly to raw scanner output. We show on a
50311 variety of real data sets how consistent models can be
50312 obtained from highly incomplete input. The information
50313 gained during the shape completion process can be
50314 utilized for future scans, thus continuously
50315 simplifying the creation of complex 3D models.",
50316 acknowledgement = ack-nhfb,
50317 keywords = "3D acquisition; hole filling; non-rigid alignment;
50318 shape completion; surface reconstruction",
50319 }
50320
50321 @TechReport{Cadar:2005:EGT,
50322 author = "Cristian Cadar and Dawson Engler",
50323 title = "Execution Generated Test Cases: How to Make Systems
50324 Code Crash Itself",
50325 type = "Technical Report",
50326 number = "CSTR 2005-04",
50327 institution = inst-STAN-CS,
50328 address = inst-STAN-CS:adr,
50329 pages = "14",
50330 day = "25",
50331 month = mar,
50332 year = "2005",
50333 bibdate = "Fri Nov 21 07:40:47 MST 2025",
50334 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
50335 URL = "https://hci.stanford.edu/cstr/reports/2005-04.pdf",
50336 abstract = "This paper presents a technique that uses code to
50337 automatically generate its own test cases at run-time
50338 by using a combination of symbolic and concrete (i.e.,
50339 regular) execution. The input values to a program (or
50340 software component) provide the standard interface of
50341 any testing framework with the program it is testing,
50342 and generating input values that will explore all the
50343 ``interesting'' behavior in the tested program remains
50344 an important open problem in software testing research.
50345 Our approach works by turning the problem on its head:
50346 we lazily generate, from within the program itself, the
50347 input values to the program (and values derived from
50348 input values) as needed. We applied the technique to
50349 real code and found numerous corner-case errors ranging
50350 from simple memory overflows and infinite loops to
50351 subtle issues in the interpretation of language
50352 standards.",
50353 acknowledgement = ack-nhfb,
50354 pdfpages = "14",
50355 }
50356
50357 @TechReport{Houston:2005:HFB,
50358 author = "Mike Houston and Arcot Preetham and Mark Segal",
50359 title = "A Hardware {F}-Buffer Implementation",
50360 type = "Technical Report",
50361 number = "CSTR 2005-05",
50362 institution = inst-STAN-CS,
50363 address = inst-STAN-CS:adr,
50364 pages = "6",
50365 day = "11",
50366 month = apr,
50367 year = "2005",
50368 bibdate = "Fri Nov 21 07:40:47 MST 2025",
50369 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
50370 URL = "https://hci.stanford.edu/cstr/reports/2005-05.pdf",
50371 abstract = "This paper describes the hardware F-Buffer
50372 implementation featured in the latest ATI graphics
50373 processors. We discuss the implementation choices made
50374 in each chip and the various implementation challenges
50375 faced like overflow handling. The F-Buffer was
50376 originally intended as a solution for multi-pass
50377 shading. We demonstrate this functionality, comparing
50378 it to traditional multi-pass rendering techniques, and
50379 show performance results. Given hardware F-Buffer
50380 support, we describe extended uses like order
50381 independent blending. We also show how a future
50382 F-Buffer implementation might be extended to allow more
50383 advanced operations like data filtering.",
50384 acknowledgement = ack-nhfb,
50385 pdfpages = "6",
50386 }
50387
50388 @TechReport{Hartmann:2005:DTI,
50389 author = "Bj{\"o}rn Hartmann and Scott R. Klemmer and Michael
50390 Bernstein",
50391 title = "{d.tools}: Integrated Prototyping for Physical
50392 Interaction Design",
50393 type = "Technical Report",
50394 number = "CSTR 2005-06",
50395 institution = inst-STAN-CS,
50396 address = inst-STAN-CS:adr,
50397 pages = "10",
50398 day = "22",
50399 month = sep,
50400 year = "2005",
50401 bibdate = "Fri Nov 21 07:40:47 MST 2025",
50402 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
50403 URL = "https://hci.stanford.edu/cstr/reports/2005-06.pdf",
50404 abstract = "Designers tasked with imagining future information
50405 appliances currently employ separate tools for rapidly
50406 prototyping the form (the atoms) and the interaction
50407 model (the bits) because integrated prototyping of bits
50408 and atoms requires resources and knowledge outside the
50409 reach of design generalists. Based on interviews with
50410 product designers, we created d.tools, a system
50411 enabling non-programmers to prototype the bits and the
50412 atoms of physical user interfaces in concert. d.tools
50413 lowers the threshold to prototyping functional physical
50414 interfaces through plug-and-play hardware that is
50415 closely coupled with a visual authoring environment. We
50416 evaluated the d.tools use threshold through a first-use
50417 study with thirteen participants; the study showed that
50418 the tool is accessible and encourages reflective design
50419 practice. We tested the d.tools range of design support
50420 by recreating existing research and commercial devices;
50421 this demonstrated that the visual language was
50422 sufficiently expressive for existing and emerging
50423 real-world designs.",
50424 acknowledgement = ack-nhfb,
50425 pdfpages = "10",
50426 }
50427
50428 @TechReport{Piper:2005:SCT,
50429 author = "Anne Marie Piper and Eileen O'Brien and Meredith
50430 {Ringel Morris} and Terry Winograd",
50431 title = "{SIDES}: a Cooperative Tabletop Computer Game for
50432 Social Skills Development",
50433 type = "Technical Report",
50434 number = "CSTR 2005-07",
50435 institution = inst-STAN-CS,
50436 address = inst-STAN-CS:adr,
50437 pages = "??",
50438 day = "22",
50439 month = sep,
50440 year = "2005",
50441 bibdate = "Fri Nov 21 07:40:47 MST 2025",
50442 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
50443 URL = "https://hci.stanford.edu/cstr/reports/2005-07.pdf",
50444 abstract = "This paper presents a design case study of SIDES:
50445 Shared Interfaces to Develop Effective Social Skills.
50446 SIDES is a tool designed to help adolescents in social
50447 group therapy, specifically individuals with Asperger's
50448 Syndrome, practice effective group work skills using a
50449 four-player cooperative computer game that runs on
50450 tabletop technology. We present the design process and
50451 evaluation of SIDES conducted over a period of six
50452 months with a middle school social group therapy class.
50453 Our findings indicate that tabletop computer games
50454 provide a motivating experience to help our target
50455 audience learn effective group work skills in a
50456 supportive environment.",
50457 acknowledgement = ack-nhfb,
50458 }
50459
50460 @TechReport{RingelMorris:2005:SCL,
50461 author = "Meredith {Ringel Morris} and Anne Marie Piper and
50462 Anthony Cassanego and Terry Winograd",
50463 title = "Supporting Cooperative Language Learning: Issues in
50464 Interface Design for an Interactive Table",
50465 type = "Technical Report",
50466 number = "CSTR 2005-08",
50467 institution = inst-STAN-CS,
50468 address = inst-STAN-CS:adr,
50469 pages = "9",
50470 day = "22",
50471 month = sep,
50472 year = "2005",
50473 bibdate = "Fri Nov 21 07:40:47 MST 2025",
50474 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
50475 URL = "https://hci.stanford.edu/cstr/reports/2005-08.pdf",
50476 abstract = "The recent introduction of computationally-enhanced
50477 tables that support simultaneous, multi-user input has
50478 important implications for co-located, face-to-face
50479 activity. Educational applications particularly stand
50480 to benefit from this new technology, which can combine
50481 the benefits of small group work with the enhancements
50482 offered by digital media. In this paper, we explore how
50483 the unique affordances of interactive tables provide a
50484 match for the needs of foreign language education, and
50485 how the design of tabletop software can be subtly
50486 altered to encourage desired educational outcomes. We
50487 present three prototype applications, and explore four
50488 design variations (feedback modality, feedback privacy,
50489 spatial configuration, and interaction visualizations)
50490 to assess their impact on student participation and
50491 self-assessment. We present observations of the use of
50492 our prototypes in two settings: (1) a controlled
50493 laboratory study and (2) authentic use by students as
50494 part of a language course at our university, and
50495 discuss our preliminary findings and avenues for future
50496 exploration.",
50497 acknowledgement = ack-nhfb,
50498 keywords = "co-located groupware; computer- supported cooperative
50499 learning; computer-supported cooperative work;
50500 Educational interfaces; tabletop interfaces",
50501 pdfpages = "9",
50502 }
50503
50504 @TechReport{Wang:2005:MUP,
50505 author = "QianYing Wang and Tony Hsieh and Meredith {Ringel
50506 Morris} and Andreas Paepcke",
50507 title = "Multi-User Piles Across Space",
50508 type = "Technical Report",
50509 number = "CSTR 2005-09",
50510 institution = inst-STAN-CS,
50511 address = inst-STAN-CS:adr,
50512 pages = "4",
50513 day = "22",
50514 month = sep,
50515 year = "2005",
50516 bibdate = "Fri Nov 21 07:40:47 MST 2025",
50517 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
50518 URL = "https://hci.stanford.edu/cstr/reports/2005-09.pdf",
50519 abstract = "We introduce Multi-User Piles Across Space, a
50520 technique that allows co-located individuals with PDAs
50521 to share and organize information items (e.g., photos,
50522 text, sound clips, etc.) by placing these items in
50523 shared, imaginary off-screen piles. This technique
50524 relies on human capacities to remember spatial layouts,
50525 and allows small co-located groups with limited screen
50526 real estate to collaboratively manage information. Each
50527 participant can use their PDA's stylus to flick
50528 information to shared off-screen piles and view their
50529 contents. Connections are implemented through ad hoc
50530 WiFi. Optimistic concurrency control provides long term
50531 data consistency. We also describe an extension that
50532 allows PDA owners to transfer information items and
50533 piles to and from a tabletop display",
50534 acknowledgement = ack-nhfb,
50535 keywords = "information management; information sharing; mobile
50536 computing; PDA; piles; screen real-estate",
50537 pdfpages = "5",
50538 }
50539
50540 @TechReport{Cadar:2006:ESA,
50541 author = "Cristian Cadar and Paul Twohey and Vijay Ganesh and
50542 Dawson Engler",
50543 title = "{EXE}: a System for Automatically Generating Inputs of
50544 Death Using Symbolic Execution",
50545 type = "Technical Report",
50546 number = "CSTR 2006-01",
50547 institution = inst-STAN-CS,
50548 address = inst-STAN-CS:adr,
50549 pages = "20",
50550 day = "1",
50551 month = feb,
50552 year = "2006",
50553 bibdate = "Fri Nov 21 07:40:47 MST 2025",
50554 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
50555 URL = "https://hci.stanford.edu/cstr/reports/2006-01.pdf",
50556 abstract = "Systems code defines an error-prone execution state
50557 space built from deeply nested conditionals and
50558 function call chains, massive amounts of code, and
50559 enthusiastic use of casting and pointer operations.
50560 Such code is hard to test and difficult to inspect, yet
50561 a single error can crash a machine or form the basis of
50562 a security breach.\par
50563
50564 This paper presents EXE, a system designed to
50565 automatically find bugs in such code using symbolic
50566 execution. At a high level, rather than running the
50567 code on manually-constructed concrete input, EXE
50568 instead runs it on symbolic input that is initially
50569 allowed to be ``anything.'' As input (and derived)
50570 values are observed through conditional statements and
50571 other checks, symbolic constraints are incrementally
50572 added to those values. EXE then generates concrete test
50573 cases by solving these symbolic constraints for
50574 concrete values with bit-level precision.\par
50575
50576 EXE has several novel features. First, it implements a
50577 complete, precise symbolic pointer theory that
50578 correctly handles both pointer arithmetic expressions
50579 and reads and writes to memory locations referenced by
50580 pointers with symbolic values. Second, it handles all
50581 of the C language with bit-level precision. Third, EXE
50582 greatly amplifies the effect of running a single code
50583 path since it uses a powerful constraint solver to
50584 reason about all possible values that the path could be
50585 run with, rather than a single set of concrete values
50586 from an individual test case.\par
50587
50588 EXE has been successfully applied to applications
50589 ranging from running the Linux kernel symbolically in
50590 order to find numerous security holes in the ext2,
50591 ext3, and JFS file systems [26] to detecting invalid
50592 memory reads and writes in a DHCPD server
50593 implementation to finding buffer overflow attacks in
50594 the BSD and Linux packet filter implementations.",
50595 acknowledgement = ack-nhfb,
50596 pdfpages = "20",
50597 }
50598
50599 @TechReport{Hartmann:2006:RPP,
50600 author = "Bj{\"o}rn Hartmann and Scott R. Klemmer and Michael
50601 Bernstein and Leith Abdulla and Brandon Burr and Avi
50602 Robinson-Mosher and Jennifer Gee",
50603 title = "Reflective physical prototyping through integrated
50604 design, test, and analysis",
50605 type = "Technical Report",
50606 number = "CSTR 2006-02",
50607 institution = inst-STAN-CS,
50608 address = inst-STAN-CS:adr,
50609 pages = "10",
50610 day = "7",
50611 month = apr,
50612 year = "2006",
50613 bibdate = "Fri Nov 21 07:40:47 MST 2025",
50614 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
50615 URL = "https://hci.stanford.edu/cstr/reports/2006-02.pdf",
50616 abstract = "Prototyping is the pivotal activity that structures
50617 innovation, collaboration, and creativity in design.
50618 Prototypes embody design hypotheses and enable
50619 designers to test them. Framing design as a
50620 thinking-by-doing activity foregrounds iteration as a
50621 central concern. This paper presents d.tools, a toolkit
50622 that embodies an iterative-design-centered approach to
50623 prototyping information appliances. This work offers
50624 contributions in three areas. First, d.tools introduces
50625 a statechart-based visual design tool that provides a
50626 low threshold for early-stage prototyping, extensible
50627 through code for higher-fidelity prototypes. Second,
50628 our research introduces three important types of
50629 hardware extensibility --- at the hardware-to-PC
50630 interface, the intra-hardware communication level, and
50631 the circuit level. Third, d.tools integrates design,
50632 test, and analysis of information appliances. We have
50633 evaluated d.tools through three studies: a laboratory
50634 study with thirteen participants; rebuilding prototypes
50635 of existing and emerging devices; and by observing
50636 seven student teams who built prototypes with
50637 d.tools.",
50638 acknowledgement = ack-nhfb,
50639 keywords = "design thinking; design tools; information appliances;
50640 integrating physical and digital; prototyping;
50641 Toolkits",
50642 pdfpages = "10",
50643 }
50644
50645 @TechReport{Yeh:2006:IGP,
50646 author = "Ron B. Yeh and Joel Brandt and Jonas Boli and Scott R.
50647 Klemmer",
50648 title = "Interactive Gigapixel Prints: Large, Paper-Based
50649 Interfaces for Visual Context and Collaboration",
50650 type = "Technical Report",
50651 number = "CSTR 2006-03",
50652 institution = inst-STAN-CS,
50653 address = inst-STAN-CS:adr,
50654 pages = "10",
50655 day = "7",
50656 month = apr,
50657 year = "2006",
50658 bibdate = "Fri Nov 21 07:40:47 MST 2025",
50659 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
50660 URL = "https://hci.stanford.edu/cstr/reports/2006-03.pdf",
50661 abstract = "For centuries, large paper information graphics such
50662 as maps have been important cognitive artifacts in
50663 navigation, architecture, design, engineering, and
50664 scientific work. Paper-based work practices leverage
50665 the high resolution, low cost, reliability, mobility,
50666 and flexibility of paper --- yet lack the interactivity
50667 afforded by digital technologies. This paper introduces
50668 Interactive Gigapixel Prints ( GIGA prints), computer
50669 controlled large-scale paper displays that afford
50670 direct pen-based input. These paper prints are
50671 augmented with digital displays, integrating the high
50672 spatial resolution but low temporal resolution of
50673 wide-format printing with the lower spatial resolution
50674 but higher temporal resolution of digital displays.
50675 Using large paper displays and digital devices together
50676 as an ensemble leverages the relative benefits of each
50677 medium; GIGA prints afford both ambient awareness and
50678 simultaneous viewing and input from multiple users. The
50679 pen-based interaction includes selection, progressive
50680 information disclosure, filtering, and annotation. This
50681 paper contributes a design space for integrated paper
50682 and digital interactions, an infrastructure for
50683 creating interactive ensembles of large paper displays
50684 and digital devices, and four applications built using
50685 our infrastructure, each illustrating points in the
50686 design space.",
50687 acknowledgement = ack-nhfb,
50688 keywords = "augmented paper; device ensembles; large displays",
50689 pdfpages = "10",
50690 }
50691
50692 @TechReport{Morris:2006:HRI,
50693 author = "Dan Morris and Neel Joshi",
50694 title = "Hybrid Rendering for Interactive Virtual Scenes",
50695 type = "Technical Report",
50696 number = "CSTR 2006-04",
50697 institution = inst-STAN-CS,
50698 address = inst-STAN-CS:adr,
50699 pages = "7",
50700 day = "23",
50701 month = may,
50702 year = "2006",
50703 bibdate = "Fri Nov 21 07:40:47 MST 2025",
50704 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
50705 URL = "https://hci.stanford.edu/cstr/reports/2006-04.pdf",
50706 abstract = "Interactive virtual environments used in conjunction
50707 with haptic displays are often static-viewpoint scenes
50708 that contain a mixture of static and dynamic virtual
50709 objects. The immersive realism of these environments is
50710 often limited by the graphical rendering system,
50711 typically OpenGL or Direct3D. In order to present more
50712 realistic scenes for haptic interaction without
50713 requiring additional modeling complexity, we have
50714 developed a technique for co-locating a pre-rendered,
50715 raytraced scene with objects rendered graphically and
50716 haptically in real-time. We describe the
50717 depth-buffering and perspective techniques that were
50718 necessary to achieve colocation among representations,
50719 and we demonstrate real-time haptic interaction with a
50720 scene rendered using photon-mapping.",
50721 acknowledgement = ack-nhfb,
50722 pdfpages = "7",
50723 }
50724
50725 @TechReport{RingelMorris:2006:SEI,
50726 author = "Meredith {Ringel Morris}",
50727 title = "Supporting Effective Interaction with Tabletop
50728 Groupware",
50729 type = "Technical Report",
50730 number = "CSTR 2006-05",
50731 institution = inst-STAN-CS,
50732 address = inst-STAN-CS:adr,
50733 pages = "xviii + 233",
50734 day = "7",
50735 month = apr,
50736 year = "2006",
50737 bibdate = "Fri Nov 21 07:40:47 MST 2025",
50738 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
50739 URL = "https://hci.stanford.edu/cstr/reports/2006-05.pdf",
50740 abstract = "We encounter tables in a variety of situations in our
50741 everyday lives --- at work, at school, at home, and in
50742 restaurants, libraries, and other public venues. The
50743 ubiquity of this furniture results from the utility of
50744 its affordances: tables' horizontal surfaces afford the
50745 placement of objects, and their large surface area
50746 affords the spreading, piling, and organization of
50747 these items; chairs afford sitting and relaxing, making
50748 work around tables leisurely and comfortable; and,
50749 perhaps most importantly, tables afford face-to-face
50750 collaboration amongst a small group of co-located
50751 individuals.\par
50752
50753 Enhancing traditional tables by adding computational
50754 functionality combines the collaborative and
50755 organizational benefits of horizontal surfaces, as well
50756 as their ability to hold tangible interaction objects,
50757 with the power and adaptability of digital technology,
50758 including the ability to archive, search, and share
50759 digital documents and the ability to quickly access
50760 related information. Combining the productivity
50761 benefits of computing with the social benefits of
50762 around-the-table interaction has value for many
50763 commonplace activities, such as business, education,
50764 and entertainment. The recent introduction of hardware
50765 that detects touch input from multiple, simultaneous
50766 users has made computationally-augmented tables, or
50767 ``interactive tables,'' practical.\par
50768
50769 This dissertation contributes a sequence of novel
50770 prototypes that explore the properties of group
50771 interaction with interactive tables. It presents the
50772 results of user experiments on the ways people share
50773 information and control in the unique setting of
50774 interactive face-to-face shared computer use. On the
50775 basis of these it proposes design principles that will
50776 produce tabletop groupware that better facilitates
50777 human-computer interaction and cooperative processes.
50778 These principles relate to appropriate uses for
50779 different regions of the table's surface, techniques
50780 for reducing visual clutter, the utility and visibility
50781 of access permissions for virtual objects, methods for
50782 influencing users' social interactions via tabletop
50783 interface design, consideration of how tabletop
50784 interface design influences and facilitates different
50785 work styles, and appropriate usability metrics for
50786 evaluating this class of software.\par
50787
50788 Considering tabletop design holistically, including
50789 both the human-computer and human-human interactions
50790 that take place during tabletop activities, can lead to
50791 the development of more usable and useful tabletop
50792 groupware.",
50793 acknowledgement = ack-nhfb,
50794 pdfpages = "251",
50795 remark = "This is the author's Ph.D. dissertation.",
50796 }
50797
50798 @TechReport{and:2006:ADS,
50799 author = "Dan Morris",
50800 title = "Algorithms and Data Structures for Haptic Rendering:
50801 Curve Constraints, Distance Maps, and Data Logging",
50802 type = "Technical Report",
50803 number = "CSTR 2006-06",
50804 institution = inst-STAN-CS,
50805 address = inst-STAN-CS:adr,
50806 pages = "12",
50807 day = "11",
50808 month = jun,
50809 year = "2006",
50810 bibdate = "Fri Nov 21 07:40:47 MST 2025",
50811 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
50812 URL = "https://hci.stanford.edu/cstr/reports/2006-06.pdf",
50813 abstract = "In this paper, we describe three novel data processing
50814 techniques used for haptic rendering and
50815 simulation:\par
50816
50817 * We present an approach to constraining a haptic
50818 device to travel along a discretely-sampled
50819 curve.\par
50820
50821 * We present an approach to generating distance maps
50822 from surface meshes using axis-aligned bounding box
50823 (AABB) trees. Our method exploits spatial coherence
50824 among neighboring points.\par
50825
50826 * We present a data structure that allows thread-safe,
50827 lock-free streaming of data from a high-priority haptic
50828 rendering thread to a lower-priority data-logging
50829 thread.\par
50830
50831 We provide performance metrics and example applications
50832 for each of these techniques. C++-style pseudocode is
50833 provided wherever possible and is used as the basis for
50834 presenting our approaches. Links to actual
50835 implementations are also provided for each section.",
50836 acknowledgement = ack-nhfb,
50837 keywords = "curve constraints; distance maps; flood-filling;
50838 haptic rendering; Haptics; kd-tree; synchronization;
50839 threads; virtual fixtures; voxelization",
50840 pdfpages = "12",
50841 }
50842
50843 @TechReport{and:2006:APC,
50844 author = "Dan Morris",
50845 title = "Automatic Preparation, Calibration, and Simulation of
50846 Deformable Objects",
50847 type = "Technical Report",
50848 number = "CSTR 2006-07",
50849 institution = inst-STAN-CS,
50850 address = inst-STAN-CS:adr,
50851 pages = "15",
50852 day = "24",
50853 month = jul,
50854 year = "2006",
50855 bibdate = "Fri Nov 21 07:40:47 MST 2025",
50856 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
50857 URL = "https://hci.stanford.edu/cstr/reports/2006-07.pdf",
50858 abstract = "Many simulation environments --- particularly those
50859 intended for medical simulation --- require solid
50860 objects to deform at interactive rates, with
50861 deformation properties that correspond to real
50862 materials. Furthermore, new objects may be created
50863 frequently (for example, each time a new patient's data
50864 is processed), prohibiting manual intervention in the
50865 model preparation process. This paper provides a
50866 pipeline for rapid preparation of deformable objects
50867 with no manual intervention, specifically focusing on
50868 mesh generation (preparing solid meshes from surface
50869 models), automated calibration of models to finite
50870 element reference analyses (including a novel approach
50871 to reducing the complexity of calibrating
50872 nonhomogeneous objects), and automated skinning of
50873 meshes for interactive simulation.",
50874 acknowledgement = ack-nhfb,
50875 pdfpages = "15",
50876 }
50877
50878 @TechReport{and:2006:RCE,
50879 author = "Manu Kumar",
50880 title = "Reducing the Cost of Eye Tracking Systems",
50881 type = "Technical Report",
50882 number = "CSTR 2006-08",
50883 institution = inst-STAN-CS,
50884 address = inst-STAN-CS:adr,
50885 pages = "4",
50886 day = "4",
50887 month = apr,
50888 year = "2006",
50889 bibdate = "Fri Nov 21 07:40:47 MST 2025",
50890 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
50891 URL = "https://hci.stanford.edu/cstr/reports/2006-08.pdf",
50892 abstract = "Tracking the user's eye-gaze information has been
50893 technologically possible for several decades. However,
50894 systems that track eye-gaze are still very expensive.
50895 The exorbitant price tag on commercial systems has
50896 resulted in limited use of eye-tracking technology. In
50897 this paper we examine the factors which contribute to
50898 the high costs of eye-tracking systems. We then propose
50899 several techniques and strategies which can be used to
50900 reduce the cost of these systems, ultimately resulting
50901 in more widespread use of the technology.",
50902 acknowledgement = ack-nhfb,
50903 keywords = "Corneal Reflection Eye Tracker; Eye Tracking; Low-Cost
50904 Eye-Tracking",
50905 pdfpages = "4",
50906 }
50907
50908 @TechReport{Lee:2006:EAI,
50909 author = "Brian Lee and Heidy Maldonado and Scott R. Klemmer",
50910 title = "Evaluating Augmented Idea Logs for Design Education",
50911 type = "Technical Report",
50912 number = "CSTR 2006-09",
50913 institution = inst-STAN-CS,
50914 address = inst-STAN-CS:adr,
50915 pages = "10",
50916 day = "28",
50917 month = may,
50918 year = "2006",
50919 bibdate = "Fri Nov 21 07:40:47 MST 2025",
50920 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
50921 URL = "https://hci.stanford.edu/cstr/reports/2006-09.pdf",
50922 abstract = "Design students use a variety of physical and digital
50923 content in the course of their studies. Augmented paper
50924 interactions promise to address this tension, yet there
50925 have been few real-world evaluations of these systems.
50926 In this paper, we present results from the first
50927 longitudinal study of augmented paper interactions for
50928 student design teams. We describe our experiences with
50929 developing and deploying the iDeas learning ecology, a
50930 system that integrates digital pens and cameras into
50931 design practice. Across two quarter-long studies,
50932 fifty-eight design students used iDeas, authoring over
50933 4,000 pages of content in the course of their
50934 classwork. We report on their design habits, the when,
50935 what and how of their notebook usage, and pinpoint
50936 further avenues of study, including device ensembles.
50937 Through observation and analysis, we discovered that
50938 integrated paper and digital interactions enable new
50939 practices, including the ability to instrument and
50940 study design activity itself. We then observe
50941 limitations of current form factor and maintenance that
50942 inhibit longitudinal use. We conclude by identifying
50943 guidelines for development and potential directions for
50944 future research into hybrid technology systems for
50945 creative work.",
50946 acknowledgement = ack-nhfb,
50947 pdfpages = "10",
50948 }
50949
50950 @TechReport{Lee:2006:AID,
50951 author = "Brian Lee and Scott R. Klemmer and Ronen Brafman",
50952 title = "Adaptive Interfaces for Declarative Presentation of
50953 Heterogeneous Content",
50954 type = "Technical Report",
50955 number = "CSTR 2006-10",
50956 institution = inst-STAN-CS,
50957 address = inst-STAN-CS:adr,
50958 pages = "10",
50959 day = "29",
50960 month = sep,
50961 year = "2006",
50962 bibdate = "Fri Nov 21 07:40:47 MST 2025",
50963 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
50964 URL = "https://hci.stanford.edu/cstr/reports/2006-10.pdf",
50965 abstract = "Visibility of work practice is important because it
50966 enables peripheral participation of and facilitates
50967 coordination between colleagues. Moving activities from
50968 the physical world onto the digital desktop has
50969 diminished visibility by consigning the artifacts of
50970 work practice to the computer screen; the serendipity
50971 of stumbling across physical artifacts is lost. One
50972 method of reintroducing visibility is the proactive
50973 display of colleagues' digital work artifacts. This
50974 paper introduces an adaptive content presentation
50975 technique designed to improve the visibility of content
50976 for both ambient awareness and interactive browsing. In
50977 this work, we define the information presentation
50978 problem to be dynamically focusing user attention to a
50979 maximally useful subset of available information. Our
50980 technique takes a decision-theoretic approach to
50981 interface generation, using content metadata as inputs
50982 to our algorithm. The data view is generated
50983 dynamically, based on high-level attributes of the
50984 current state and a declarative relationship between
50985 the user's input and the resulting view. We have
50986 evaluated the technical efficacy of this algorithm by
50987 implementing it in the context of the ButterflyNet
50988 browser",
50989 acknowledgement = ack-nhfb,
50990 keywords = "Adaptive interfaces; awareness; decision theory;
50991 model-based UIs",
50992 pdfpages = "10",
50993 }
50994
50995 @TechReport{Lee:2006:LSA,
50996 author = "Brian Lee and Heidy Maldonado and Scott R. Klemmer and
50997 Isabelle Kim and Paz Hilfinger-Pardo",
50998 title = "Longitudinal Studies of Augmented Notebook Usage
50999 Informing the Design of Sharing Mechanisms",
51000 type = "Technical Report",
51001 number = "CSTR 2006-11",
51002 institution = inst-STAN-CS,
51003 address = inst-STAN-CS:adr,
51004 pages = "11",
51005 day = "29",
51006 month = sep,
51007 year = "2006",
51008 bibdate = "Fri Nov 21 07:40:47 MST 2025",
51009 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
51010 URL = "https://hci.stanford.edu/cstr/reports/2006-11.pdf",
51011 abstract = "Designers today use a variety of artifacts --- both
51012 physical and digital --- in the course of documenting
51013 their work. A resulting tension is that physical and
51014 digital media have significantly different affordances
51015 and organizing metaphors. Augmented paper interactions
51016 promise to mitigate some of this tension, yet there
51017 have been few real-world evaluations of these systems.
51018 To investigate their potential value for de sign, we
51019 studied two longitudinal deployments of augmented paper
51020 interactions with student design teams. Across two
51021 ten-week-long studies, 56 design students used the
51022 system, authoring over 4,000 pages of content in the
51023 course of their class work; this paper reports on their
51024 design habits and adoption patterns. We discuss the
51025 salient benefits (integrated digital repository for
51026 sketches and photographs), shortcomings that led to
51027 research insights (support for sharing physical and
51028 digital content), and barriers that persisted across
51029 both studies (perceived and actual costs of adoption
51030 discourage use).",
51031 acknowledgement = ack-nhfb,
51032 keywords = "augmented paper; Design education; Idea Log",
51033 pdfpages = "11",
51034 }
51035
51036 @TechReport{Ju:2006:REI,
51037 author = "Wendy Ju and Brian Lee and Scott R. Klemmer",
51038 title = "{Range}: Exploring Implicit Interaction through
51039 Electronic Whiteboard Design",
51040 type = "Technical Report",
51041 number = "CSTR 2006-12",
51042 institution = inst-STAN-CS,
51043 address = inst-STAN-CS:adr,
51044 pages = "10",
51045 day = "29",
51046 month = sep,
51047 year = "2006",
51048 bibdate = "Fri Nov 21 07:40:47 MST 2025",
51049 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
51050 URL = "https://hci.stanford.edu/cstr/reports/2006-12.pdf",
51051 abstract = "An important challenge in designing ubiquitous
51052 computing experiences is negotiating the transition
51053 between explicit and implicit interaction, such as how
51054 and when to provide users with notifications. While the
51055 paradigm of implicit interaction has important
51056 benefits, it is also susceptible to difficulties with
51057 hidden modes, unexpected action, and misunderstood
51058 intent. To address these issues, this work presents a
51059 framework for implicit interaction and applies it to
51060 the design of an interactive whiteboard application
51061 called Range. Range is a public interactive whiteboard
51062 designed to support collocated, ad-hoc meetings. It
51063 employs proximity sensing capability to proactively
51064 transition between display and authoring modes, clear
51065 space for writing, and cluster ink strokes. We show how
51066 the implicit interaction techniques of user
51067 presentation (how users implicitly indicate what they
51068 are doing), system presentation (how systems indicate
51069 what they are doing), and override (how users can
51070 interrupt or stop a proactive system action) can
51071 prevent, mitigate, and correct errors in the
51072 whiteboard's proactive behaviors. These techniques can
51073 be generalized to improve the designs of a wide array
51074 of ubiquitous computing experiences.",
51075 acknowledgement = ack-nhfb,
51076 keywords = "ambient proactive; foreground\slash background;
51077 Implicit interaction",
51078 pdfpages = "10",
51079 }
51080
51081 @TechReport{Morris:2006:VSB,
51082 author = "Dan Morris and Christopher Sewell and Federico
51083 Barbagli and Nikolas Blevins and Sabine Girod and
51084 Kenneth Salisbury",
51085 title = "Visuohaptic Simulation of Bone Surgery",
51086 type = "Technical Report",
51087 number = "CSTR 2006-13",
51088 institution = inst-STAN-CS,
51089 address = inst-STAN-CS:adr,
51090 pages = "12",
51091 day = "7",
51092 month = nov,
51093 year = "2006",
51094 bibdate = "Fri Nov 21 07:40:47 MST 2025",
51095 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
51096 URL = "https://hci.stanford.edu/cstr/reports/2006-13.pdf",
51097 abstract = "We present techniques for the visual and haptic
51098 simulation of bone surgery, with a specific focus on
51099 procedures involving the temporal bone and the
51100 mandible. We discuss our approaches to graphic and
51101 haptic rendering and interactive modification of
51102 volumetric data, specifically focusing on generating
51103 force-feedback effects that are relevant to bone
51104 drilling. We then discuss how our rendering primitives
51105 and simulation architecture can be used to build
51106 surgical training techniques that are not available in
51107 traditional cadaver-based training labs, offering new
51108 possibilities for surgical education. In particular, we
51109 discuss the automatic computation of performance
51110 metrics that can provide real-time feedback about a
51111 trainee's performance in our simulator. We also present
51112 results from an experimental study evaluating the
51113 construct validity of our simulation and the validity
51114 of our performance metrics.",
51115 acknowledgement = ack-nhfb,
51116 keywords = "haptics; input devices; simulation; simulator
51117 evaluation, simulator validity; surgery; Virtual
51118 reality; volume visualization",
51119 pdfpages = "12",
51120 remark = "This technical report is a more detailed version of
51121 the following paper: Morris D, Sewell C, Barbagli F,
51122 Blevins N, Girod S, Salisbury K. Visuohaptic Simulation
51123 of Bone Surgery for Training and Evaluation. IEEE
51124 Computer Graphics and Applications, Vol. {\bf 26}, No.
51125 4, November 2006, p48--57.",
51126 }
51127
51128 @TechReport{Hartmann:2006:HMG,
51129 author = "Bj{\"o}rn Hartmann and Scott Doorley and Scott R.
51130 Klemmer",
51131 title = "Hacking, Mashing, Gluing: a Study of Opportunistic
51132 Design",
51133 type = "Technical Report",
51134 number = "CSTR 2006-14",
51135 institution = inst-STAN-CS,
51136 address = inst-STAN-CS:adr,
51137 pages = "10",
51138 day = "29",
51139 month = sep,
51140 year = "2006",
51141 bibdate = "Fri Nov 21 07:40:47 MST 2025",
51142 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
51143 URL = "https://hci.stanford.edu/cstr/reports/2006-14.pdf",
51144 abstract = "This paper is about opportunistic practices in
51145 interactive system design: about copying and pasting
51146 source code from public online forums into one's own
51147 scripts; about taking apart consumer electronics and
51148 reappropriating their components for design prototypes;
51149 about ``Frankensteining'' software and hardware
51150 artifacts together by joining them with physical and
51151 digital hot glue and duct tape. It is about the hacks
51152 and prototypes of lowbrow experimentation, as opposed
51153 to highbrow design and engineering from the ground up.
51154 We combine these opportunistic practices under the
51155 moniker of ``mash-up design.'' This paper presents
51156 results from an interview study with 14 professional
51157 and hobbyist ``mashers'' from three different design
51158 disciplines: Web 2.0 programmers, hardware hackers, and
51159 designers of interactive ubicomp systems. The paper
51160 analyzes commonalities and distills themes in
51161 opportunistic design through three lenses: first, the
51162 way mash-ups modify and combine pre-existing elements;
51163 second, the unique characteristics of opportunistic
51164 design as an activity; and third, looking at mash-ups
51165 as novel kinds of artifacts.",
51166 acknowledgement = ack-nhfb,
51167 pdfpages = "10",
51168 }
51169
51170 @TechReport{Brandt:2007:TLL,
51171 author = "Joel Brandt and Noah Weiss and Scott R. Klemmer",
51172 title = "{txt 4 l8r}: Lowering the Burden for Diary Studies
51173 Under Mobile Conditions",
51174 type = "Technical Report",
51175 number = "CSTR 2007-01",
51176 institution = inst-STAN-CS,
51177 address = inst-STAN-CS:adr,
51178 pages = "6",
51179 day = "12",
51180 month = jan,
51181 year = "2007",
51182 bibdate = "Fri Nov 21 07:40:47 MST 2025",
51183 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
51184 URL = "https://hci.stanford.edu/cstr/reports/2007-01.pdf",
51185 abstract = "We present and evaluate a new technique for performing
51186 diary studies under mobile or active conditions. Diary
51187 studies play an important role as a means for
51188 ecologically valid participant data capture.
51189 Unfortunately, when participants are asked to capture
51190 data while mobile or active, they are often unwilling
51191 or unable to invest time in thorough, reflective
51192 entries. Ultimately, this leads to lowered entry
51193 quality and quantity. The technique presented here
51194 suggests the capture of only small snippets of
51195 information in the field. These snippets then serve as
51196 prompts for participants when completing full diary
51197 entries at a convenient time. We describe how our
51198 system automates collection of snippets via SMS (text),
51199 MMS (picture) and voicemail messages and later presents
51200 these snippets for full entry elicitation. We then
51201 present results from a preliminary evaluation of this
51202 technique.",
51203 acknowledgement = ack-nhfb,
51204 keywords = "Diary study; field work; mobile computing; mobile data
51205 capture; text messaging",
51206 pdfpages = "6",
51207 }
51208
51209 @TechReport{Kumar:2007:ESA,
51210 author = "Manu Kumar and Andreas Paepcke and Terry Winograd",
51211 title = "{EyeExpos{\'e}}: Switching Applications with Your
51212 Eyes",
51213 type = "Technical Report",
51214 number = "CSTR 2007-02",
51215 institution = inst-STAN-CS,
51216 address = inst-STAN-CS:adr,
51217 pages = "7",
51218 day = "15",
51219 month = feb,
51220 year = "2007",
51221 bibdate = "Fri Nov 21 07:40:47 MST 2025",
51222 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
51223 URL = "https://hci.stanford.edu/cstr/reports/2007-02.pdf",
51224 abstract = "We present a technique for switching between active
51225 applications by using a combination of keyboard (or any
51226 other trigger) and eye gaze. In particular, our
51227 approach combines the use of a two-dimensional layout
51228 visualization for showing the user all open
51229 applications and the use of eye gaze tracking for
51230 selecting the desired window. Our studies show that
51231 this combination of gaze and the visual representation
51232 of active tasks allows users to switch between
51233 applications quickly and naturally. Users strongly
51234 preferred this technique of switching between
51235 applications compared to other alternatives.",
51236 acknowledgement = ack-nhfb,
51237 keywords = "application switching; eye tracking; gaze-enhanced
51238 user interface design; task switching",
51239 pdfpages = "7",
51240 }
51241
51242 @TechReport{and:2007:GSD,
51243 author = "Manu Kumar",
51244 title = "{GUIDe} Saccade Detection and Smoothing Algorithm",
51245 type = "Technical Report",
51246 number = "CSTR 2007-03",
51247 institution = inst-STAN-CS,
51248 address = inst-STAN-CS:adr,
51249 pages = "2",
51250 day = "15",
51251 month = feb,
51252 year = "2007",
51253 bibdate = "Fri Nov 21 07:40:47 MST 2025",
51254 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
51255 URL = "https://hci.stanford.edu/cstr/reports/2007-03.pdf",
51256 abstract = "Data from an eye tracker is noisy and includes jitter
51257 due to errors in tracking and because of the physiology
51258 of the eye. To smooth the data from the eye tracker, it
51259 is necessary to determine whether the most recent data
51260 point is the beginning of a saccade or whether it is an
51261 aberration relative to the current fixation. Before
51262 returning a data point, our algorithm looks at the
51263 subsequent data point to make decisions about whether
51264 the current data point was the beginning of a saccade
51265 or an aberration, in which case it is adjusted.",
51266 acknowledgement = ack-nhfb,
51267 pdfpages = "2",
51268 }
51269
51270 @TechReport{Ganesh:2007:CRM,
51271 author = "Vijay Ganesh and Sergey Berezin and Cesare Tinelli and
51272 David L. Dill",
51273 title = "Combination Results for Many-Sorted Theories with
51274 Overlapping Signatures",
51275 type = "Technical Report",
51276 number = "CSTR 2007-04",
51277 institution = inst-STAN-CS,
51278 address = inst-STAN-CS:adr,
51279 pages = "58",
51280 day = "12",
51281 month = mar,
51282 year = "2007",
51283 bibdate = "Fri Nov 21 07:40:47 MST 2025",
51284 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
51285 URL = "https://hci.stanford.edu/cstr/reports/2007-04.pdf",
51286 abstract = "We present a combination result for many-sorted
51287 first-order theories whose signatures may share common
51288 symbols (i.e. overlapping or non-disjoint signatures),
51289 extending the recent results by Ghilardi for the
51290 unsorted case. Furthermore, we give practical
51291 conditions un- der which the combination method becomes
51292 a semi-decision procedure, and additional sufficient
51293 conditions which turn it into a decision
51294 procedure.\par
51295
51296 Several theories which are practically useful in formal
51297 verification have overlapping signatures (e.g. linear
51298 arithmetic and bit-vectors). We demonstrate how their
51299 decision procedures can be combined using our results.
51300 In addition, we obtain a many-sorted version of the
51301 Nelson- Oppen method as a special case of our
51302 combination result.",
51303 acknowledgement = ack-nhfb,
51304 pdfpages = "58",
51305 remark = "Report is dated 21 April 2004 (not 2007!).",
51306 }
51307
51308 @TechReport{Kumar:2007:RSS,
51309 author = "Manu Kumar and Tal Garfinkel and Dan Boneh and Terry
51310 Winograd",
51311 title = "Reducing Shoulder-surfing by Using Gaze-based Password
51312 Entry",
51313 type = "Technical Report",
51314 number = "CSTR 2007-05",
51315 institution = inst-STAN-CS,
51316 address = inst-STAN-CS:adr,
51317 pages = "7",
51318 day = "19",
51319 month = mar,
51320 year = "2007",
51321 bibdate = "Fri Nov 21 07:40:47 MST 2025",
51322 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
51323 URL = "https://hci.stanford.edu/cstr/reports/2007-05.pdf",
51324 abstract = "Shoulder-surfing --- using direct observation
51325 techniques, such as looking over someone's shoulder, to
51326 get passwords, PINs and other sensitive personal
51327 information --- is a problem that has been difficult to
51328 overcome. When a user enters information using a
51329 keyboard, mouse, touch screen or any traditional input
51330 device, a malicious observer may be able to acquire the
51331 user's password credentials. We present EyePassword, a
51332 system that mitigates the issues of shoulder surfing
51333 via a novel approach to user input. With EyePassword, a
51334 user enters sensitive input (password, PIN, etc.) by
51335 selecting from an on-screen keyboard using only the
51336 orientation of their pupils (i.e. the position of their
51337 gaze on screen), making eavesdropping by a malicious
51338 observer largely impractical. We present a number of
51339 design choices and discuss their effect on usability
51340 and security. We conducted user studies to evaluate the
51341 speed, accuracy and user acceptance of our approach.
51342 Our results demonstrate that gaze-based password entry
51343 requires marginal additional time over using a
51344 keyboard, error rates are similar to those of using a
51345 keyboard and subjects preferred the gaze-based password
51346 entry approach over traditional methods.",
51347 acknowledgement = ack-nhfb,
51348 pdfpages = "7",
51349 }
51350
51351 @TechReport{Ganesh:2007:DPF,
51352 author = "Vijay Ganesh and Sergey Berezin and David L. Dill",
51353 title = "A Decision Procedure for Fixed-Width Bit-Vectors",
51354 type = "Technical Report",
51355 number = "CSTR 2007-06",
51356 institution = inst-STAN-CS,
51357 address = inst-STAN-CS:adr,
51358 pages = "27",
51359 day = "24",
51360 month = mar,
51361 year = "2007",
51362 bibdate = "Fri Nov 21 07:40:47 MST 2025",
51363 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
51364 URL = "https://hci.stanford.edu/cstr/reports/2007-06.pdf",
51365 abstract = "We report the design, implementation and performance
51366 of an efficient decision procedure for the equational
51367 theory of fixed-width bit-vectors. The input language
51368 supports word-level bit-vector operations
51369 (concatenation and extraction), bit-vector arithmetic
51370 operations (addition, subtraction and constant
51371 multiplication), bitwise boolean operations
51372 (conjunction, disjunction, negation, bitwise XOR,
51373 etc.), multiplexors (if-then-else operator) and
51374 predicates like comparators (``less than''). Other
51375 common functions such as right shift, sign/zero
51376 extension can be easily supported through suitable
51377 translation.\par
51378
51379 The decision procedure is implemented as part of the
51380 CVC Lite tool [IBB04], a theorem prover based on
51381 combination of decision procedures in the Nelson-Oppen
51382 style. The design is novel, the decision procedure
51383 complete, and the implementation is efficient for a
51384 large class of practical examples. Our implementation
51385 also supports concrete counterexample generation.",
51386 acknowledgement = ack-nhfb,
51387 pdfpages = "27",
51388 }
51389
51390 @TechReport{Berezin:2007:OPP,
51391 author = "Sergey Berezin and Vijay Ganesh and David L. Dill",
51392 title = "Online Proof-Producing Decision Procedure for
51393 Mixed-Integer Linear Arithmetic",
51394 type = "Technical Report",
51395 number = "CSTR 2007-07",
51396 institution = inst-STAN-CS,
51397 address = inst-STAN-CS:adr,
51398 pages = "16",
51399 day = "24",
51400 month = mar,
51401 year = "2007",
51402 bibdate = "Fri Nov 21 07:40:47 MST 2025",
51403 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
51404 URL = "https://hci.stanford.edu/cstr/reports/2007-07.pdf",
51405 abstract = "Efficient decision procedures for arithmetic play a
51406 very important role in formal verification. In
51407 practical examples, however, arithmetic constraints are
51408 often mixed with constraints from other theories like
51409 the theory of arrays, Boolean satisfiability (SAT),
51410 bit-vectors, etc. Therefore, decision procedures for
51411 arithmetic are especially useful in combination with
51412 other decision procedures. The framework for such a
51413 combination is implemented at Stanford in the tool
51414 called Cooperating Validity Checker (CVC)
51415 [SBD02].\par
51416
51417 This work augments CVC with a decision procedure for
51418 the theory of mixed integer linear arithmetic based on
51419 the Omega-test [Pug91] extended to be online and proof
51420 producing. These extensions are the most important and
51421 challenging part of the work, and are necessary to make
51422 the combination efficient in practice.",
51423 acknowledgement = ack-nhfb,
51424 pdfpages = "16",
51425 }
51426
51427 @TechReport{Ganesh:2007:SS,
51428 author = "Vijay Ganesh and Hassan Saidi and Natarajan Shankar",
51429 title = "Slicing {SAL}",
51430 type = "Technical Report",
51431 number = "CSTR 2007-08",
51432 institution = inst-STAN-CS,
51433 address = inst-STAN-CS:adr,
51434 pages = "16",
51435 day = "24",
51436 month = mar,
51437 year = "2007",
51438 bibdate = "Fri Nov 21 07:40:47 MST 2025",
51439 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
51440 note = "The report is dated 7 October 1999.",
51441 URL = "https://hci.stanford.edu/cstr/reports/2007-08.pdf",
51442 abstract = "Model checking has been successfully applied to verity
51443 finite-state systems albeit ones with small
51444 state-space. But most interesting systems have very
51445 large or infinite state-spaces. Automatic Abstraction
51446 techniques can help alleviate the state-space explosion
51447 problem to some extent. Another complementary approach
51448 is the use of program slicing to automatically remove
51449 portions of the input transition system irrelevant to
51450 the property being verified. This may result in
51451 state-space reduction. The reduced state system, if
51452 finite, may then be more amenable to model
51453 checking.\par
51454
51455 In this paper we discuss application of slicing to the
51456 SAL intermediate language. SAL intermediate language
51457 (or just SAL) is a concurrent language designed so that
51458 popular programming languages can be converted to SAL
51459 and whole set of Abstraction, Program Analysis, Theorem
51460 Proving and Model Checking tools/techniques can be
51461 combined and methodologies defined to verify large
51462 state systems. We describe a novel algorithm for
51463 slicing SAL and report on its implementation. It is one
51464 of the few slicing algorithms which deal with
51465 concurrency. We also discuss methodologies for
51466 combining slicing and other techniques to enable
51467 verification of larger state systems, use of theorem
51468 proving techniques to refine slicing, and techniques to
51469 convert temporal formulae into slicing criteria.",
51470 acknowledgement = ack-nhfb,
51471 pdfpages = "16",
51472 }
51473
51474 @TechReport{Hartmann:2007:PSR,
51475 author = "Bj{\"o}rn Hartmann and Leslie Wu and Kevin Collins and
51476 Scott R. Klemmer",
51477 title = "Programming by a Sample: Rapidly Prototyping Web
51478 Applications with {d.mix}",
51479 type = "Technical Report",
51480 number = "CSTR 2007-09",
51481 institution = inst-STAN-CS,
51482 address = inst-STAN-CS:adr,
51483 pages = "10",
51484 day = "30",
51485 month = mar,
51486 year = "2007",
51487 bibdate = "Fri Nov 21 07:40:47 MST 2025",
51488 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
51489 URL = "https://hci.stanford.edu/cstr/reports/2007-09.pdf",
51490 abstract = "As an increasing number of web sites provide APIs,
51491 significant latent value for supporting developers' use
51492 of these APIs lies in the site-service correspondence:
51493 the site and its API offer complementary
51494 representations of equivalent functionality. We
51495 introduce d.mix, a tool that realizes this latent
51496 value, lowering the threshold for creating web
51497 mash-ups. With d.mix, users browse annotated web sites
51498 and perform a parametric copy of elements of interest.
51499 While a traditional copy contains web page elements, a
51500 parametric copy performs proxy-based rewriting of pages
51501 to select the underlying programmatic calls that yield
51502 those elements. Developers can paste this code and
51503 edit, execute, and share scripts on d.mix's wiki-based
51504 authoring environment. This approach speeds the
51505 creation of web applications while preserving the
51506 flexibility and high ceiling of script-based
51507 programming. An initial study with eight participants
51508 found d.mix to enable rapid experimentation, and
51509 suggested avenues for improving its annotation
51510 mechanism.",
51511 acknowledgement = ack-nhfb,
51512 keywords = "mash-ups; programming by example modification;
51513 prototyping; web services",
51514 pdfpages = "10",
51515 }
51516
51517 @TechReport{Yeh:2007:IDP,
51518 author = "Ron B. Yeh and Scott R. Klemmer and Andreas Paepcke
51519 and Marcello Bast{\'e}a-Forte and Joel Brandt and Jonas
51520 Boli",
51521 title = "Iterative Design of a Paper + Digital Toolkit:
51522 Supporting Designing, Developing, and Debugging",
51523 type = "Technical Report",
51524 number = "CSTR 2007-10",
51525 institution = inst-STAN-CS,
51526 address = inst-STAN-CS:adr,
51527 pages = "10",
51528 day = "30",
51529 month = mar,
51530 year = "2007",
51531 bibdate = "Fri Nov 21 07:40:47 MST 2025",
51532 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
51533 URL = "https://hci.stanford.edu/cstr/reports/2007-10.pdf",
51534 abstract = "With advances in digital pens, there has been recent
51535 interest in supporting augmented paper in both research
51536 and commercial applications. This paper introduces the
51537 iterative design of a toolkit for event-driven
51538 programming of augmented paper applications. We
51539 evaluated the toolkit with 69 students (17 teams) in an
51540 external university class, gathering feedback through
51541 e-mail, in-person discussions, and analysis of 51,000
51542 lines of source code produced by the teams. This paper
51543 describes successes and challenges we discovered in
51544 providing an event-driven architecture as the
51545 programming model for paper interaction. Informed by
51546 this evaluation, we extended the toolkit with visual
51547 tools for designing, developing, and debugging, thereby
51548 lowering the threshold for exploring paper UI designs,
51549 providing informal techniques for specifying UI
51550 layouts, and introducing visualizations for event
51551 handlers and programming interfaces. These results have
51552 implications beyond paper applications --- R3 takes
51553 steps toward supporting programming by example
51554 modification, exploring APIs, and improved
51555 visualization of event flow.",
51556 acknowledgement = ack-nhfb,
51557 keywords = "augmented paper; design tools; device ensembles;
51558 toolkits",
51559 pdfpages = "10",
51560 }
51561
51562 @TechReport{Kumar:2007:GES,
51563 author = "Manu Kumar and Terry Winograd",
51564 title = "Gaze-enhanced Scrolling Techniques",
51565 type = "Technical Report",
51566 number = "CSTR 2007-11",
51567 institution = inst-STAN-CS,
51568 address = inst-STAN-CS:adr,
51569 pages = "4",
51570 day = "30",
51571 month = mar,
51572 year = "2007",
51573 bibdate = "Fri Nov 21 07:40:47 MST 2025",
51574 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
51575 URL = "https://hci.stanford.edu/cstr/reports/2007-11.pdf",
51576 abstract = "Scrolling is an inherent part of our everyday
51577 computing experience. Contemporary scrolling techniques
51578 rely on the explicit initiation of scrolling by the
51579 user. However, the act of scrolling is tightly coupled
51580 with the user's ability to absorb information via the
51581 visual channel. The use of eye gaze information is
51582 therefore a natural choice for enhancing scrolling
51583 techniques. We present several gaze-enhanced scrolling
51584 techniques for manual and automatic scrolling which use
51585 gaze information as a primary input or as an augmented
51586 input. We also introduce the use off-screen
51587 gaze-actuated buttons for document navigation and
51588 control.",
51589 acknowledgement = ack-nhfb,
51590 keywords = "Automatic Scrolling; Eye Tracking; Gaze-enhanced Page
51591 Down; Gaze-enhanced Scrolling; Off-screen Targets; Page
51592 Down; Scrolling",
51593 pdfpages = "4",
51594 }
51595
51596 @TechReport{Kumar:2007:IAG,
51597 author = "Manu Kumar and Jeff Klingner and Rohan Puranik and
51598 Terry Winograd and Andreas Paepcke",
51599 title = "Improving the Accuracy of Gaze Input",
51600 type = "Technical Report",
51601 number = "CSTR 2007-12",
51602 institution = inst-STAN-CS,
51603 address = inst-STAN-CS:adr,
51604 pages = "4",
51605 day = "30",
51606 month = mar,
51607 year = "2007",
51608 bibdate = "Fri Nov 21 07:40:47 MST 2025",
51609 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
51610 URL = "https://hci.stanford.edu/cstr/reports/2007-12.pdf",
51611 abstract = "Using gaze information as a form of input poses
51612 challenges based on the nature of eye movements and how
51613 we humans use our eyes in conjunction with other motor
51614 actions. In this paper, we present three techniques for
51615 improving the feasibility of using gaze as a form of
51616 input. We first present a saccade detection and
51617 smoothing algorithm that works on real-time streaming
51618 gaze information. We then present a study which
51619 explores some of the timing issues of using gaze in
51620 conjunction with a trigger (key press or other motor
51621 action) and propose a solution for resolving these
51622 issues. Finally, we present the concept of Focus
51623 Points, which makes it easier for users to focus their
51624 gaze when using gaze-based interaction techniques.
51625 Though these techniques were developed for improving
51626 the performance of gaze-based pointing, their use is
51627 applicable in general to using gaze as a practical form
51628 of input.",
51629 acknowledgement = ack-nhfb,
51630 keywords = "Eye Tracking; Eye-hand coordination; Fixation
51631 Smoothing; Focus Points.; Gaze Input; Gaze-enhanced
51632 User Interface Design; GUIDe",
51633 pdfpages = "4",
51634 }
51635
51636 @TechReport{Brandt:2007:DLA,
51637 author = "Joel Brandt and Noah Weiss and Scott R. Klemmer",
51638 title = "Designing for Limited Attention",
51639 type = "Technical Report",
51640 number = "CSTR 2007-13",
51641 institution = inst-STAN-CS,
51642 address = inst-STAN-CS:adr,
51643 pages = "8",
51644 day = "3",
51645 month = oct,
51646 year = "2007",
51647 bibdate = "Fri Nov 21 07:40:47 MST 2025",
51648 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
51649 URL = "https://hci.stanford.edu/cstr/reports/2007-13.pdf",
51650 abstract = "Not all time is created equal: in the course of a day,
51651 the resources at hand vary dramatically. Activities
51652 often span multiple differing use contexts --- riding a
51653 train, talking with a colleague, attending a meeting,
51654 engaging in focused work at the desktop --- and these
51655 different contexts imply different constraints on
51656 action. To work effectively within these constraints,
51657 people often divide tasks into multiple phases. For
51658 example, jotting a re- minder of a future task has
51659 little intrinsic value; it serves to distribute one's
51660 cognition in service of structuring future action.
51661 Similarly, the value of preparing a route map lies in
51662 its affordance for rapid consultation while traveling.
51663 This case study draws on interviews with developers and
51664 on our own research to present considerations for
51665 designing interactions spanning times of varying
51666 attention.",
51667 acknowledgement = ack-nhfb,
51668 keywords = "attention; distributed cognition; mobile computing",
51669 pdfpages = "8",
51670 }
51671
51672 @TechReport{and:2007:SVI,
51673 author = "Leslie Wu",
51674 title = "Social Values at the Interface: Toward {``Just''}
51675 Human-Computer Ranking Designs at Scale",
51676 type = "Technical Report",
51677 number = "CSTR 2007-14",
51678 institution = inst-STAN-CS,
51679 address = inst-STAN-CS:adr,
51680 pages = "3",
51681 day = "3",
51682 month = oct,
51683 year = "2007",
51684 bibdate = "Fri Nov 21 07:40:47 MST 2025",
51685 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
51686 URL = "https://hci.stanford.edu/cstr/reports/2007-14.pdf",
51687 abstract = "In the design of human-computer ranking systems for
51688 the adaptive display of information, designers often
51689 define a domain-specific scoring function which maps
51690 items such as people or information search results to
51691 numeric scores. Classic ranking systems typically
51692 display these items in a linear fashion, sorted by
51693 score. There are shortcomings to this approach: such
51694 ranking systems do not provide a diversity of results,
51695 and in aggregate the distribution of collective user
51696 attention is biased by the users' trust in the quality
51697 of these orderings. Furthermore, ranking systems based
51698 on sorted orders embody a property of chaotic systems,
51699 namely that small perturbations in the input --- the
51700 underlying scoring functions --- may have large effects
51701 in the output --- the distribution of collective user
51702 attention. Thus, we propose an alternative
51703 human-computer ranking system called donkey sort, which
51704 strikes a balance between complete order and uniform
51705 randomness, performing probability sampling of the
51706 display permutations found in a Latin square design",
51707 acknowledgement = ack-nhfb,
51708 keywords = "ranking; sorting; values",
51709 pdfpages = "3",
51710 }
51711
51712 @TechReport{Wu:2007:RWT,
51713 author = "Leslie Wu and Joel Brandt and Scott Klemmer",
51714 title = "Remixing the {Web}: Tailoring Applications using
51715 Programmable Proxies inside {Web} Browsers",
51716 type = "Technical Report",
51717 number = "CSTR 2007-15",
51718 institution = inst-STAN-CS,
51719 address = inst-STAN-CS:adr,
51720 pages = "4",
51721 day = "3",
51722 month = oct,
51723 year = "2007",
51724 bibdate = "Fri Nov 21 07:40:47 MST 2025",
51725 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
51726 URL = "https://hci.stanford.edu/cstr/reports/2007-15.pdf",
51727 abstract = "This note reports on the motivation for and design of
51728 an infrastructure for presenting tailored web
51729 applications as services. We conducted a diary study of
51730 mobile information needs, finding that a significant
51731 majority of participants' desired information was
51732 available on the web, just not in a mobile-friendly
51733 format. This suggests there is latent value in
51734 lightweight tools that tailor web applications for
51735 mobile use. Browser extensions have emerged as perhaps
51736 the most lightweight and intuitive method for enabling
51737 end-users to tailor web applications, likely because
51738 browser-side approaches work fluidly with the logged-in
51739 web and because it most effectively leverages a diverse
51740 ecology of existing web development tools. However,
51741 client-side extensions are, well, client-side ---
51742 inhibiting their portability, especially to the
51743 stripped-down browsers common to the mobile web. This
51744 note introduces re:mix, an architecture that delivers
51745 both the development benefits of browser-based
51746 application tailoring and the server-side benefits of
51747 proxy-based rewriting.",
51748 acknowledgement = ack-nhfb,
51749 keywords = "end-user programming; mobile web; Software tailoring",
51750 pdfpages = "4",
51751 }
51752
51753 @TechReport{Lee:2007:AIS,
51754 author = "Brian Lee and Scott R. Klemmer and Savil Srivastava
51755 and Ronen Brafman",
51756 title = "Adaptive Interfaces for Supporting Design by Example",
51757 type = "Technical Report",
51758 number = "CSTR 2007-16",
51759 institution = inst-STAN-CS,
51760 address = inst-STAN-CS:adr,
51761 pages = "10",
51762 day = "9",
51763 month = oct,
51764 year = "2007",
51765 bibdate = "Fri Nov 21 07:40:47 MST 2025",
51766 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
51767 URL = "https://hci.stanford.edu/cstr/reports/2007-16.pdf",
51768 abstract = "Analogy plays an important cognitive role in reasoning
51769 and problem solving. One illustration of analogical
51770 cognition can be found in design practice, where
51771 viewing examples is an established technique for
51772 inspiration and learning. While digital information
51773 technologies have made it easier for designers to
51774 access examples of other designers' work, significant
51775 opportunities exist for selecting and presenting
51776 examples in a proactive fashion. In this paper, we
51777 introduce techniques for dynamically deriving
51778 interfaces for example-based design tools using
51779 decision-theoretic selection, designer specification,
51780 and end-user preference as inputs. This paper describes
51781 a manifestation of these techniques in the Adaptive
51782 Ideas web page builder, an HTML-based display platform
51783 for web page designers that leverages content metadata
51784 to automatically generate displays of examples. We
51785 present an evaluation of these techniques through a
51786 first-use study.",
51787 acknowledgement = ack-nhfb,
51788 keywords = "Adaptive interfaces; decision theory; design by
51789 example; model-based UIs",
51790 pdfpages = "10",
51791 }
51792
51793 @TechReport{Lee:2007:CSA,
51794 author = "Brian Lee and Heidy Maldonado and Isabelle Kim and Paz
51795 Hilfinger-Pardo and Scott R. Klemmer",
51796 title = "Classroom Studies of Augmented Notebook Usage
51797 Informing the Design of Sharing Mechanisms",
51798 type = "Technical Report",
51799 number = "CSTR 2007-17",
51800 institution = inst-STAN-CS,
51801 address = inst-STAN-CS:adr,
51802 pages = "8",
51803 day = "9",
51804 month = oct,
51805 year = "2007",
51806 bibdate = "Fri Nov 21 07:40:47 MST 2025",
51807 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
51808 URL = "https://hci.stanford.edu/cstr/reports/2007-17.pdf",
51809 abstract = "Designers today use a variety of artifacts --- both
51810 physical and digital --- in the course of documenting
51811 their work. Physical and digital media have
51812 significantly different affordances and organizing
51813 metaphors: most notably, paper remains the preferable
51814 medium for sketching but lacks the sharing affordances
51815 of digital media. Augmented paper interactions promise
51816 to mitigate some of this difference, yet there have
51817 been few real-world evaluations of augmented paper
51818 systems. To investigate their potential value for
51819 design, we conducted two studies of augmented paper
51820 interactions with student design teams. Across two
51821 ten-week-long studies, 56 design students used the
51822 system, authoring over 4,000 pages of content in the
51823 course of their class work. We discuss the impacts of
51824 augmented paper technology on design practice,
51825 including salient benefits (ease of integrating
51826 physical media into digital practices), shortcomings
51827 (insufficiency of na{\"\i}ve sharing mechanisms,
51828 barriers to adoption), and other emergent behaviors
51829 (changes in how physical and digital content
51830 coexist).",
51831 acknowledgement = ack-nhfb,
51832 pdfpages = "8",
51833 }
51834
51835 @TechReport{Chen:2008:VCE,
51836 author = "Xing Chen and Lucas Pereira and Pat Hanrahan",
51837 title = "Viewing Complex Environments using Hierarchical Light
51838 Fields",
51839 type = "Technical Report",
51840 number = "CSTR 2002-03",
51841 institution = inst-STAN-CS,
51842 address = inst-STAN-CS:adr,
51843 pages = "",
51844 day = "",
51845 month = jan,
51846 year = "2008",
51847 bibdate = "Fri Nov 21 07:40:47 MST 2025",
51848 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
51849 URL = "http://graphics.stanford.edu/papers/hierarchical_lf/",
51850 abstract = "",
51851 acknowledgement = ack-nhfb,
51852 pdfpages = "",
51853 }
51854
51855 @TechReport{Talton:2008:CMP,
51856 author = "Jerry Talton and Daniel Gibson and Pat Hanrahan and
51857 Vladlen Koltun",
51858 title = "Collaborative Mapping of a Parametric Design Space",
51859 type = "Technical Report",
51860 number = "CSTR 2008-01",
51861 institution = inst-STAN-CS,
51862 address = inst-STAN-CS:adr,
51863 pages = "10",
51864 day = "28",
51865 month = jan,
51866 year = "2008",
51867 bibdate = "Fri Nov 21 07:40:47 MST 2025",
51868 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
51869 URL = "https://hci.stanford.edu/cstr/reports/2008-01.pdf",
51870 abstract = "We utilize a high-dimensional parametric design space
51871 to support a novel and intuitive method for 3D
51872 modeling. Users visually explore the design space and
51873 pick models using a continuous, map-like interface. We
51874 leverage models created by the user community to learn
51875 underlying structure in the space via kernel density
51876 estimation. This mapping of the space is maintained by
51877 a server that synchronizes all the deployed design
51878 tools. The tools leverage the mapping to allow users
51879 with no prior modeling experience to easily create
51880 unique designs by interpolating between and
51881 extrapolating from landmark models. The result is a
51882 self-reinforcing design system that becomes easier to
51883 use as more people participate.\par
51884
51885 Our prototype tree modeling tool was downloaded by over
51886 six thousand users from more than eighty countries in
51887 the month following its release. Over fifteen hundred
51888 trees were voluntarily picked from the roughly hundred
51889 dimensional tree space. We report on usage patterns
51890 gathered through this deployment and on subsequent user
51891 surveys.",
51892 acknowledgement = ack-nhfb,
51893 pdfpages = "10",
51894 }
51895
51896 @TechReport{Chaudhuri:2008:DRV,
51897 author = "Siddhartha Chaudhuri and Daniel Horn and Pat Hanrahan
51898 and Vladlen Koltun",
51899 title = "Distributed Rendering of Virtual Worlds",
51900 type = "Technical Report",
51901 number = "CSTR 2008-02",
51902 institution = inst-STAN-CS,
51903 address = inst-STAN-CS:adr,
51904 pages = "9",
51905 day = "28",
51906 month = jan,
51907 year = "2008",
51908 bibdate = "Fri Nov 21 07:40:47 MST 2025",
51909 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
51910 URL = "https://hci.stanford.edu/cstr/reports/2008-02.pdf",
51911 abstract = "We present a system for distributed rendering of large
51912 and detailed virtual worlds. A cluster of servers
51913 create and maintain a hierarchical representation of
51914 the world that can be propagated to an unlimited number
51915 of clients through a content-distribution network. The
51916 preprocessing is easy to parallelize and storage
51917 requirements are minimal. Using a small subset of the
51918 representation, a client can explore a large and
51919 detailed world in real time on consumer hardware over a
51920 commodity Internet connection. The required bandwidth
51921 is independent of the size of the world. We report
51922 extensive performance measurements with a 2,500 square
51923 kilometer world, densely populated with objects
51924 comprising 10 billion polygons.",
51925 acknowledgement = ack-nhfb,
51926 pdfpages = "9",
51927 }
51928
51929 @TechReport{Cadar:2008:KUA,
51930 author = "Cristian Cadar and Daniel Dunbar and Dawson Engler",
51931 title = "{KLEE}: Unassisted and Automatic Generation of
51932 High-Coverage Tests for Complex Systems Programs",
51933 type = "Technical Report",
51934 number = "CSTR 2008-03",
51935 institution = inst-STAN-CS,
51936 address = inst-STAN-CS:adr,
51937 pages = "14",
51938 day = "8",
51939 month = may,
51940 year = "2008",
51941 bibdate = "Fri Nov 21 07:40:47 MST 2025",
51942 bibsource = "https://www.math.utah.edu/pub/tex/bib/minix.bib;
51943 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
51944 URL = "https://hci.stanford.edu/cstr/reports/2008-03.pdf",
51945 abstract = "We present a new symbolic execution tool, KLEE,
51946 capable of automatically generating tests that achieve
51947 high coverage on a diverse set of complex and
51948 environmentally-intensive programs. We applied KLEE to
51949 all 90 programs in the GNU Coreutils utility suite,
51950 which form the core user-level environment installed on
51951 almost all Unix systems and, as such, represent some of
51952 the most heavily used and tested open-source programs
51953 in existence. For 84\% of these utilities, KLEE's
51954 automatically generated tests covered 80--100\% of
51955 executable statements and, in aggregate, significantly
51956 beat the coverage of the developers' own hand-written
51957 test suites. KLEE also found nine serious bugs
51958 (including three that had been missed for over 15
51959 years!) and produced concrete inputs that triggered the
51960 errors when run on the uninstrumented code. When
51961 applied to Minix's versions of a small selection of the
51962 same applications, KLEE achieved similar coverage
51963 (along with two bugs). In addition, we also used KLEE
51964 to automatically find numerous incorrect differences
51965 between several Minix and Coreutils tools. Finally, we
51966 checked the kernel of the HiStar operating system,
51967 generating tests that achieved 76.4\% (without paging
51968 enabled) and 67.1\% coverage (with paging) and found
51969 one important security bug.",
51970 acknowledgement = ack-nhfb,
51971 pdfpages = "14",
51972 }
51973
51974 @TechReport{and:2008:ULR,
51975 author = "Philip J. Guo",
51976 title = "Using logistic regression to predict developer
51977 responses to {Coverity Scan} bug reports",
51978 type = "Technical Report",
51979 number = "CSTR 2008-04",
51980 institution = inst-STAN-CS,
51981 address = inst-STAN-CS:adr,
51982 pages = "52",
51983 day = "6",
51984 month = jul,
51985 year = "2008",
51986 bibdate = "Fri Nov 21 07:40:47 MST 2025",
51987 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
51988 URL = "https://hci.stanford.edu/cstr/reports/2008-04.pdf",
51989 abstract = "This report presents the state of my ongoing work to
51990 create statistical models that can be used to make
51991 predictions about how developers will respond to bug
51992 reports issued by the Coverity tool in the Open Source
51993 Scan project. I present models that can predict the
51994 following probabilities for a given report based on
51995 properties of the report itself and especially on the
51996 development history of the file/module where the report
51997 indicates a possible bug: 1. Probability that a report
51998 is inspected (triaged); 2. Probability that an
51999 inspected report is actually resolved (bugfix patch
52000 submitted)",
52001 acknowledgement = ack-nhfb,
52002 pdfpages = "53",
52003 }
52004
52005 @TechReport{Brandt:2008:EIO,
52006 author = "Joel Brandt and Philip J. Guo and Joel Lewenstein and
52007 Mira Dontcheva and Scott R. Klemmer",
52008 title = "An Empirical Investigation of Opportunistic
52009 Programming: Interleaving Web Foraging, Learning, and
52010 Writing Code",
52011 type = "Technical Report",
52012 number = "CSTR 2008-05",
52013 institution = inst-STAN-CS,
52014 address = inst-STAN-CS:adr,
52015 pages = "10",
52016 day = "19>",
52017 month = sep,
52018 year = "2008",
52019 bibdate = "Fri Nov 21 07:40:47 MST 2025",
52020 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
52021 URL = "https://hci.stanford.edu/cstr/reports/2008-05.pdf",
52022 abstract = "This paper investigates the role of online resources
52023 in problem solving. We look specifically at how
52024 programmers --- an exemplar form of knowledge workers
52025 --- opportunistically interleave Web foraging,
52026 learning, and writing code. We describe two studies of
52027 how programmers use online resources. The first study,
52028 conducted in the lab, found that programmers leverage
52029 the Web with three distinct intentions: They engage in
52030 just-in-time learning of new skills and approaches,
52031 they extend their skills, and they strategically
52032 delegate their memory to online resources. The results
52033 also suggest that queries for different purposes have
52034 different styles and durations. Do query styles
52035 robustly vary with intent, or is this result an
52036 artifact of the particular lab setting? To address this
52037 question, we analyzed a month-long set of Web queries
52038 to a commercial programming framework's online
52039 information sources. In this dataset, query style also
52040 corresponded to intent. These results contribute to a
52041 theory of online resource usage in programming, and
52042 suggest opportunities for tools to facilitate
52043 opportunistic programming.",
52044 acknowledgement = ack-nhfb,
52045 pdfpages = "10",
52046 }
52047
52048 @TechReport{Brandt:2009:ECP,
52049 author = "Joel Brandt and Mira Dontcheva and Marcos Weskamp and
52050 Scott R. Klemmer",
52051 title = "Example-Centric Programming: Integrating Web Search
52052 into the Development Environment",
52053 type = "Technical Report",
52054 number = "CSTR 2009-01",
52055 institution = inst-STAN-CS,
52056 address = inst-STAN-CS:adr,
52057 pages = "9",
52058 day = "31",
52059 month = mar,
52060 year = "2009",
52061 bibdate = "Fri Nov 21 07:40:47 MST 2025",
52062 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
52063 URL = "https://hci.stanford.edu/cstr/reports/2009-01.pdf",
52064 abstract = "The ready availability of online source code examples
52065 has changed the cost structure of programming by
52066 example modification. However, current search tools are
52067 wholly separate from editing tools. What benefits might
52068 be realized by integrating them? This paper describes
52069 the design, implementation, and evaluation of
52070 Blueprint, a tool that integrates Web search into the
52071 Adobe Flex Builder development environment. Blueprint
52072 automatically augments queries with code context,
52073 presents an example-centric view of search results, and
52074 retains a link between copied code and its source. This
52075 paper introduces a technique for retrieving relevant
52076 example code, descriptions, and running examples for a
52077 user's query. A between-subjects study found that
52078 Blueprint enables participants to search for and select
52079 example code significantly faster than with a standard
52080 Web browser.",
52081 acknowledgement = ack-nhfb,
52082 keywords = "Example-centric development; opportunistic
52083 programming; prototyping; Web search",
52084 pdfpages = "9",
52085 }
52086
52087 @TechReport{Chaudhuri:2009:IBE,
52088 author = "Siddhartha Chaudhuri and Daniel Horn and Pat Hanrahan
52089 and Vladlen Koltun",
52090 key = "network graphics; image-based rendering; depth images;
52091 orthoviews; splatting; massive virtual environments",
52092 title = "Image-Based Exploration of Massive Online
52093 Environments",
52094 type = "Technical Report",
52095 number = "CSTR 2009-02",
52096 institution = inst-STAN-CS,
52097 address = inst-STAN-CS:adr,
52098 pages = "8",
52099 day = "15",
52100 month = dec,
52101 year = "2009",
52102 bibdate = "Fri Nov 21 07:40:47 MST 2025",
52103 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
52104 URL = "https://hci.stanford.edu/cstr/reports/2009-02.pdf",
52105 abstract = "This paper presents a system for interactive
52106 exploration of massive, detailed virtual environments
52107 over a broadband network. We build upon the
52108 hierarchical image-based framework pioneered by Shade
52109 et al. [1996] and Schaufler and St{\"u}rzlinger [1996],
52110 introducing key adaptations for scalability. A cluster
52111 of servers maintain a hierarchy of depth images of
52112 bounded regions of the scene. A client displays the
52113 scene using a logarithmic set of depth images that can
52114 be maintained under constant bandwidth independent of
52115 scene size. We report on techniques used to overcome
52116 the daunting visual quality issues encountered with
52117 image-based rendering of general unstructured scenes
52118 with billions of polygons on commodity hardware over a
52119 wide-area network. Experimental results are reported on
52120 scenes that exemplify the extreme demands of
52121 large-scale online worlds.",
52122 acknowledgement = ack-nhfb,
52123 pdfpages = "8",
52124 }
52125
52126 @TechReport{Dow:2009:EPP,
52127 author = "Steven P. Dow and Alana Glassco and Jonathan Kass and
52128 Melissa Schwarz and Scott R. Klemmer",
52129 title = "The Effect of Parallel Prototyping on Design
52130 Performance, Learning, and Self-Efficacy",
52131 type = "Technical Report",
52132 number = "CSTR 2009-03",
52133 institution = inst-STAN-CS,
52134 address = inst-STAN-CS:adr,
52135 pages = "",
52136 day = "16",
52137 month = dec,
52138 year = "2009",
52139 bibdate = "Fri Nov 21 07:40:47 MST 2025",
52140 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
52141 URL = "http://hci.stanford.edu/publications/2009/EffectOfParallelPrototyping.pdf",
52142 abstract = "",
52143 acknowledgement = ack-nhfb,
52144 pdfpages = "",
52145 }
52146
52147 @TechReport{Horn:2009:IBS,
52148 author = "Daniel Horn and Ewen Cheslack-Postava and Behram F. T.
52149 Mistree and Tahir Azim and Jeff Terrace and Michael J.
52150 Freedman and Philip Levis",
52151 title = "To Infinity and Not Beyond: Scaling Communication in
52152 Virtual Worlds with Meru",
52153 type = "Technical Report",
52154 number = "CSTR 2010-01",
52155 institution = inst-STAN-CS,
52156 address = inst-STAN-CS:adr,
52157 pages = "13",
52158 day = "11",
52159 month = may,
52160 year = "2009",
52161 bibdate = "Fri Nov 21 07:40:47 MST 2025",
52162 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
52163 URL = "https://hci.stanford.edu/cstr/reports/2010-01.pdf",
52164 abstract = "Virtual worlds seek to provide an online setting where
52165 users can interact in a shared environment. Popular
52166 virtual worlds such as Second Life and World of
52167 Warcraft, however, rely on share-nothing data and
52168 strict partitioning as much as possible. They translate
52169 a large world into many tiny worlds. This partitioning
52170 conflicts with the intended goal of a virtual world by
52171 greatly limiting interaction and reducing the shared
52172 experience.\par
52173
52174 We present Meru, an architecture for scalable,
52175 federated virtual worlds. Meru's key insight is that,
52176 compared to traditional distributed object systems,
52177 virtual world objects have the additional property of
52178 being embedded in a three-dimensional geometry. By
52179 leveraging this geometric information in messaging and
52180 caching, Meru can allow uncongested virtual world
52181 objects to pass messages with 800 times the throughput
52182 as Second Life while also gracefully scaling to handle
52183 the congestion of ten thousand active senders. Unlike
52184 virtual worlds today, Meru achieves this performance
52185 without any partitioning, maintaining a single,
52186 seamless world.",
52187 acknowledgement = ack-nhfb,
52188 pdfpages = "13",
52189 }
52190
52191 @TechReport{Roy:2010:EMM,
52192 author = "Arjun Roy and Stephen M. Rumble and Ryan Stutsman and
52193 Philip Levis and David Mazi{\`e}res and Nickolai
52194 Zeldovich",
52195 title = "Energy Management in Mobile Devices with the Cinder
52196 Operating System",
52197 type = "Technical Report",
52198 number = "CSTR 2010-02",
52199 institution = inst-STAN-CS,
52200 address = inst-STAN-CS:adr,
52201 pages = "15",
52202 day = "3",
52203 month = jun,
52204 year = "2010",
52205 bibdate = "Fri Nov 21 07:40:47 MST 2025",
52206 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
52207 URL = "https://hci.stanford.edu/cstr/reports/2010-02.pdf",
52208 abstract = "We present Cinder, an operating system for mobile
52209 phones and devices, which allows users and applications
52210 to control and manage limited device resources such as
52211 energy. Cinder introduces two new abstractions,
52212 reserves and taps. Unlike prior approaches, Cinder
52213 accurately tracks principals responsible for resource
52214 consumption even across interprocess communication, and
52215 allows applications to delegate their resources either
52216 in terms of rates or quantities. Rates can enforce
52217 system lifetime, while quantities can enforce dataplan
52218 or talk time limits. Proportional taps allow threads to
52219 prevent their descendants from hoarding unused energy.
52220 Cinder additionally institutes a global half-life to
52221 prevent malicious applications from starving the rest
52222 of the system.\par
52223
52224 We explore these abstractions, demonstrating their
52225 usefulness in a variety of applications running on the
52226 HTC Dream (a.k.a. Google G1). We show how Cinder
52227 maintains system lifetime in the presence of malicious
52228 applications, reserves energy for critical functions
52229 such as 911, supports energy-aware applications, easily
52230 augments existing Unix applications with energy
52231 polices, properly amortizes costs across multiple
52232 principals, and allows applications to sandbox
52233 untrusted subcomponents (such as browser plugins).",
52234 acknowledgement = ack-nhfb,
52235 pdfpages = "15",
52236 }
52237
52238 @TechReport{Kazandjieva:2010:IEW,
52239 author = "Maria Kazandjieva and Omprakash Gnawali and Brandon
52240 Heller and Philip Levis and Christos Kozyrakis",
52241 title = "Identifying Energy Waste through Dense Power Sensing
52242 and Utilization Monitoring",
52243 type = "Technical Report",
52244 number = "CSTR 2010-03",
52245 institution = inst-STAN-CS,
52246 address = inst-STAN-CS:adr,
52247 pages = "14",
52248 day = "25",
52249 month = aug,
52250 year = "2010",
52251 bibdate = "Fri Nov 21 07:40:47 MST 2025",
52252 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
52253 URL = "https://hci.stanford.edu/cstr/reports/2010-03.pdf",
52254 abstract = "PowerNet is a hybrid sensor network for monitoring the
52255 power and utilization of computing systems in a large
52256 academic building. PowerNet comprises approximately 140
52257 single-plug wired and wireless hardware power meters
52258 and 23 software sensors that monitor PCs, laptops,
52259 network switches, servers, LCD screens, and other
52260 office equipment. PowerNet has been operational for 14
52261 months, and the wireless meters for three
52262 months.\par
52263
52264 This dense, long-term monitoring allows us to
52265 extrapolate the energy consumption breakdown of the
52266 whole building. Using our measurements together with
52267 device inventory we find that approximately 56\% of the
52268 total building energy budget goes toward computing
52269 systems, at a cost of $ \approx $ \$22,000 per month.
52270 PowerNet's measurements of CPU activity and network
52271 traffic reveal that a large fraction of this power is
52272 wasted and shows where there are savings
52273 opportunities.\par
52274
52275 In addition to these sensor data results, we present
52276 our experiences designing, deploying, and maintaining
52277 PowerNet. We include a longterm characterization of
52278 CTP, the standard TinyOS collection protocol.\par
52279
52280 The paper concludes with a discussion of possible
52281 alternatives to computing system design that can save
52282 energy while satisfying user workloads.",
52283 acknowledgement = ack-nhfb,
52284 pdfpages = "14",
52285 }
52286
52287 @TechReport{Kumar:2010:BSP,
52288 author = "Ranjitha Kumar and Jerry O. Talton and Salman Ahmad
52289 and Scott R. Klemmer",
52290 title = "{Bricolage}: a Structured-Prediction Algorithm for
52291 Example-Based Web Design",
52292 type = "Technical Report",
52293 number = "CSTR 2010-04",
52294 institution = inst-STAN-CS,
52295 address = inst-STAN-CS:adr,
52296 pages = "9",
52297 day = "29",
52298 month = sep,
52299 year = "2010",
52300 bibdate = "Fri Nov 21 07:40:47 MST 2025",
52301 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
52302 URL = "https://hci.stanford.edu/cstr/reports/2010-04.pdf",
52303 abstract = "The Web today provides a corpus of design examples
52304 unparalleled in human history. However, leveraging
52305 existing designs to produce new pages is currently
52306 difficult. This paper introduces the Bricolage
52307 algorithm for automatically transferring design and
52308 content between Web pages. Bricolage introduces a novel
52309 structured prediction technique that learns to create
52310 coherent mappings between pages by training on
52311 human-generated exemplars. The produced mappings can
52312 then be used to automatically transfer the content from
52313 one page into the style and layout of another. We show
52314 that Bricolage can learn to accurately reproduce human
52315 page mappings, and that it provides a general,
52316 efficient, and automatic technique for retargeting
52317 content between a variety of real Web pages.",
52318 acknowledgement = ack-nhfb,
52319 pdfpages = "9",
52320 }
52321
52322 @TechReport{Brandt:2010:RHP,
52323 author = "Joel Brandt and Vignan Pattamatta and William Choi and
52324 Ben Hsieh and Scott R. Klemmer",
52325 title = "{Rehearse}: Helping Programmers Adapt Examples by
52326 Visualizing Execution and Highlighting Related Code",
52327 type = "Technical Report",
52328 number = "CSTR 2010-05",
52329 institution = inst-STAN-CS,
52330 address = inst-STAN-CS:adr,
52331 pages = "4",
52332 day = "7",
52333 month = oct,
52334 year = "2010",
52335 bibdate = "Fri Nov 21 07:40:47 MST 2025",
52336 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
52337 URL = "https://hci.stanford.edu/cstr/reports/2010-05.pdf",
52338 abstract = "Instructive example code is a central part of
52339 programming. Web search enables programmers to quickly
52340 locate relevant examples. However, existing code
52341 editors offer little support for helping users
52342 interactively explore examples. This paper proposes
52343 that effective use of examples hinges on the
52344 programmer's ability to quickly identify a small number
52345 of relevant lines interleaved among a larger body of
52346 boilerplate code. This insight is manifest in Rehearse,
52347 a code editing environment with two unique features:
52348 First, Rehearse links program execution to source code
52349 by highlighting each line of code as it is executed.
52350 This enables programmers to quickly determine which
52351 lines of code are involved in producing a particular
52352 interaction. Second, after a programmer has found a
52353 single line applicable to her task, Rehearse
52354 automatically identifies other lines that are also
52355 likely to be relevant. In a controlled experiment,
52356 participants using visualization and highlighting
52357 adapted example code significantly faster than those
52358 using an identical editor without these features.",
52359 acknowledgement = ack-nhfb,
52360 keywords = "Example-centric programming",
52361 pdfpages = "4",
52362 }
52363
52364 @TechReport{Guo:2011:CUS,
52365 author = "Philip J. Guo and Dawson Engler",
52366 title = "{CDE}: Using System Call Interposition to
52367 Automatically Create Portable Software Packages",
52368 type = "Technical Report",
52369 number = "CSTR 2011-01",
52370 institution = inst-STAN-CS,
52371 address = inst-STAN-CS:adr,
52372 pages = "15",
52373 day = "5",
52374 month = apr,
52375 year = "2011",
52376 bibdate = "Fri Nov 21 07:40:47 MST 2025",
52377 bibsource = "https://www.math.utah.edu/pub/tex/bib/linux.bib;
52378 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib;
52379 https://www.math.utah.edu/pub/tex/bib/unix.bib",
52380 URL = "https://hci.stanford.edu/cstr/reports/2011-01.pdf",
52381 abstract = "It can be painfully difficult to take software that
52382 runs on one person's machine and get it to run on
52383 another machine. Online forums and mailing lists are
52384 filled with discussions of users' troubles with
52385 compiling, installing, and configuring software and
52386 their myriad of dependencies. To eliminate this
52387 dependency problem, we created a system called CDE that
52388 uses system call interposition to monitor the execution
52389 of x86-Linux programs and package up the Code, Data,
52390 and Environment required to run them on other x86-Linux
52391 machines. The main benefits of CDE are that creating a
52392 package is completely automatic, and that running
52393 programs within a package requires no installation,
52394 configuration, or root permissions. Hundreds of people
52395 throughout both academia and industry have used CDE to
52396 distribute software, demo prototypes, make their
52397 scientific experiments reproducible, run software
52398 natively on older Linux distributions, and deploy
52399 experiments to compute clusters",
52400 acknowledgement = ack-nhfb,
52401 pdfpages = "15",
52402 }
52403
52404 @TechReport{Kazandjieva:2011:SHF,
52405 author = "Maria Kazandjieva and Brandon Heller and Omprakash
52406 Gnawali and Wanja Hofer and Philip Levis and Christos
52407 Kozyrakis",
52408 title = "Software or Hardware: The Future of Green Enterprise
52409 Computing",
52410 type = "Technical Report",
52411 number = "CSTR 2011-02",
52412 institution = inst-STAN-CS,
52413 address = inst-STAN-CS:adr,
52414 pages = "13",
52415 day = "7",
52416 month = jul,
52417 year = "2011",
52418 bibdate = "Fri Nov 21 07:40:47 MST 2025",
52419 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib;
52420 https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib",
52421 URL = "https://hci.stanford.edu/cstr/reports/2011-02.pdf",
52422 abstract = "Over the last few years, interest in ``green
52423 computing'' has motivated research into energy-saving
52424 techniques for enterprise systems, from network proxies
52425 and virtual machine migration to the return of thin
52426 clients. This paper tries to answer a possibly
52427 contentious question: would we be better served by the
52428 embarrassingly simple approach of replacing every
52429 desktop with a laptop? To answer this question, we use
52430 power and utilization data collected from more than 100
52431 devices over durations up to 15 months. We find that
52432 choosing the right computing systems --- laptops ---
52433 would save more energy than state-of-the-art power
52434 management software or thin clients. Furthermore, the
52435 marginal savings of applying software techniques on top
52436 of laptops is so small that it is probably not worth
52437 the trouble.\par
52438
52439 When selecting computers, there are many other
52440 considerations than just energy, such as computational
52441 resources, and price. We find that these factors
52442 generally do not reduce the attractiveness of a
52443 laptop-based enterprise. We discuss current trends in
52444 enterprises today, and how our conclusions might affect
52445 their directions, sketching a future of how a
52446 cost-efficient enterprise might become a hybrid system
52447 entwining laptops and tablets with a computing cloud.",
52448 acknowledgement = ack-nhfb,
52449 pdfpages = "13",
52450 }
52451
52452 @TechReport{Karpenko:2011:DVS,
52453 author = "Alexandre Karpenko and David Jacobs and Jongmin Baek
52454 and Marc Levoy",
52455 title = "Digital Video Stabilization and Rolling Shutter
52456 Correction using Gyroscopes",
52457 type = "Technical Report",
52458 number = "CSTR 2011-03",
52459 institution = inst-STAN-CS,
52460 address = inst-STAN-CS:adr,
52461 pages = "7",
52462 day = "1",
52463 month = oct,
52464 year = "2011",
52465 bibdate = "Fri Nov 21 07:40:47 MST 2025",
52466 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
52467 URL = "https://hci.stanford.edu/cstr/reports/2011-03.pdf",
52468 abstract = "In this paper we present a robust, real-time video
52469 stabilization and rolling shutter correction technique
52470 based on commodity gyroscopes. First, we develop a
52471 unified algorithm for modeling camera motion and
52472 rolling shutter warping. We then present a novel
52473 framework for automatically calibrating the gyroscope
52474 and camera outputs from a single video capture. This
52475 calibration allows us to use only gyroscope data to
52476 effectively correct rolling shutter warping and to
52477 stabilize the video. Using our algorithm, we show
52478 results for videos featuring large moving foreground
52479 objects, parallax, and low-illumination. We also
52480 compare our method with commercial image-based
52481 stabilization algorithms. We find that our solution is
52482 more robust and computationally inexpensive. Finally,
52483 we implement our algorithm directly on a mobile phone.
52484 We demonstrate that by using the phone's inbuilt
52485 gyroscope and GPU, we can remove camera shake and
52486 rolling shutter artifacts in real-time.",
52487 acknowledgement = ack-nhfb,
52488 pdfpages = "7",
52489 }
52490
52491 @TechReport{Kokkalis:2011:PAP,
52492 author = "Nicolas Kokkalis and Johannes Huebner and Moontae Lee
52493 and Steven Diamond and Michael Chang and Dominic Becker
52494 and Binna Kim and Scott Klemmer",
52495 title = "Providing action plans helps people complete tasks",
52496 type = "Technical Report",
52497 number = "CSTR 2011-09",
52498 institution = inst-STAN-CS,
52499 address = inst-STAN-CS:adr,
52500 pages = "1",
52501 day = "24",
52502 month = sep,
52503 year = "2011",
52504 bibdate = "Fri Nov 21 07:40:47 MST 2025",
52505 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
52506 URL = "https://hci.stanford.edu/cstr/reports/2011-04.pdf",
52507 abstract = "People complete tasks more quickly when they have
52508 concrete plans. However, task lists place the burden of
52509 developing plans on the user. This paper investigates
52510 the effects of providing people with action plans
52511 created by online crowds. A between-subjects experiment
52512 found that people who received action plans from the
52513 crowd completed more tasks than a control group that
52514 did not. This paper also introduces two techniques for
52515 scaling the provision of action plans. First, we
52516 created a social variant where participants both used
52517 the task lists and provided action plans for others. In
52518 a between-subjects experiment, participants using this
52519 social approach completed more tasks than those who
52520 maintained a conventional task list. Second, we
52521 developed a natural language processing technique that
52522 uses WordNet and synonym detection to group similar
52523 tasks and reuse action plans across them. Running this
52524 technique on a corpus of 2872 tasks with two human
52525 auditors of the results found that 69.4\% tasks had at
52526 least one match. This suggests automatically providing
52527 action plans is quite scalable. We have incorporated
52528 these principles into a system, the TaskGenies
52529 Community.",
52530 acknowledgement = ack-nhfb,
52531 pdfpages = "1",
52532 }
52533
52534 @TechReport{Kim:2012:AIE,
52535 author = "Young Min Kim and Niloy Mitra and Dongming Yan and
52536 Leonidas Guibas",
52537 title = "Acquisition of {3D} Indoor Environments with
52538 Variability and Repetition",
52539 type = "Technical Report",
52540 number = "CSTR 2012-01",
52541 institution = inst-STAN-CS,
52542 address = inst-STAN-CS:adr,
52543 pages = "8",
52544 day = "3",
52545 month = apr,
52546 year = "2012",
52547 bibdate = "Fri Nov 21 07:40:47 MST 2025",
52548 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
52549 URL = "https://hci.stanford.edu/cstr/reports/2012-01.pdf",
52550 abstract = "Large-scale acquisition of exterior urban environments
52551 is by now a well-established technology, supporting
52552 many applications in search, navigation, and commerce.
52553 The same is not true for indoor environments, however:
52554 access is often restricted and the spaces may be
52555 cluttered. In addition, such environments typically
52556 contain a high density of repeated objects (e.g.,
52557 tables, chairs, monitors, etc.) in regular or
52558 non-regular arrangements with significant pose
52559 variations and articulations. In this paper, we exploit
52560 the special structure of indoor environments to
52561 accelerate their 3D acquisition and recognition with a
52562 low-end handheld scanner. Our approach runs in two
52563 phases: (i) a learning phase, where we acquire 3D
52564 models of frequently occurring objects and capture
52565 their variability modes from only a few scans, and (ii)
52566 a recognition phase, where from a single scan of new
52567 areas, we identify previously seen objects, but in
52568 varying poses and locations. This greatly accelerates
52569 the capture process (average recognition time of
52570 200ms/model). We demonstrate our framework with the
52571 acquisition of typical areas of a university building
52572 including cubicle or desk areas, auditoriums, etc.,
52573 using a Microsoft Kinect sensor.",
52574 acknowledgement = ack-nhfb,
52575 pdfpages = "8",
52576 }
52577
52578 @TechReport{Handigol:2012:MPF,
52579 author = "Nikhil Handigol and Brandon Heller and Vimalkumar
52580 Jeyakumar and Bob Lantz and Nick McKeown",
52581 title = "{Mininet} Performance Fidelity Benchmarks",
52582 type = "Technical Report",
52583 number = "CSTR 2012-02",
52584 institution = inst-STAN-CS,
52585 address = inst-STAN-CS:adr,
52586 pages = "11",
52587 day = "21",
52588 month = oct,
52589 year = "2012",
52590 bibdate = "Fri Nov 21 07:40:47 MST 2025",
52591 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
52592 URL = "https://hci.stanford.edu/cstr/reports/2012-02.pdf",
52593 abstract = "This initial Mininet technical report evaluates the
52594 performance fidelity of the Mininet/Mininet-HiFi system
52595 by examining results from two classes of experiments:
52596 link tests (section 2) and microbenchmarks (section
52597 3.)",
52598 acknowledgement = ack-nhfb,
52599 pdfpages = "11",
52600 }
52601
52602 @TechReport{Lim:2012:LSS,
52603 author = "Maxine Lim and Ranjitha Kumar and Arvind Satyanarayan
52604 and Cesar Torres and Jerry O. Talton and Scott R.
52605 Klemmer",
52606 title = "Learning Structural Semantics for the {Web}",
52607 type = "Technical Report",
52608 number = "CSTR 2012-03",
52609 institution = inst-STAN-CS,
52610 address = inst-STAN-CS:adr,
52611 pages = "8",
52612 day = "15",
52613 month = nov,
52614 year = "2012",
52615 bibdate = "Fri Nov 21 07:40:47 MST 2025",
52616 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
52617 URL = "https://hci.stanford.edu/cstr/reports/2012-03.pdf",
52618 abstract = "Researchers have long envisioned a Semantic Web, where
52619 unstructured Web content is replaced by documents with
52620 rich semantic annotations. Unfortunately, this vision
52621 has been hampered by the difficulty of acquiring
52622 semantic metadata for Web pages. This paper introduces
52623 a method for automatically ``semantifying'' structural
52624 page elements: using machine learning to train
52625 classifiers that can be applied in a post-hoc fashion.
52626 We focus on one popular class of semantic identifiers:
52627 those concerned with the structure --- or information
52628 architecture --- of a page. To determine the set of
52629 structural semantics to learn and to collect training
52630 data for the learning, we gather a large corpus of
52631 labeled page elements from a set of online workers. We
52632 discuss the results from this collection and
52633 demonstrate that our classifiers learn structural
52634 semantics in a general way.",
52635 acknowledgement = ack-nhfb,
52636 pdfpages = "8",
52637 }
52638
52639 @TechReport{Kulkarni:2012:LDW,
52640 author = "Chinmay Kulkarni and Scott R. Klemmer",
52641 title = "Learning design wisdom by augmenting physical studio
52642 critique with online self-assessment",
52643 type = "Technical Report",
52644 number = "CSTR 2012-04",
52645 institution = inst-STAN-CS,
52646 address = inst-STAN-CS:adr,
52647 pages = "10",
52648 day = "2",
52649 month = jul,
52650 year = "2012",
52651 bibdate = "Fri Nov 21 07:40:47 MST 2025",
52652 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
52653 URL = "https://hci.stanford.edu/cstr/reports/2012-04.pdf",
52654 abstract = "Rich, large-scale user-generated virtual worlds have
52655 been imagined in the realm of fiction for decades. Such
52656 worlds, however, present significant technical
52657 challenges due to the limitations of available network
52658 and graphics resources. Since the world is
52659 user-generated, its content has to be stored in a
52660 shared, networked resource such as the cloud. Further,
52661 user-generated content is not optimized for efficient
52662 rendering, so additional processing is needed to
52663 display it efficiently in the presence of limited
52664 graphical resources.\par
52665
52666 This paper presents an approach to efficiently display
52667 a complete view of a user-generated world at scale. The
52668 key insight is that such worlds have a high degree of
52669 coherence, which enables us to deduplicate many 3D
52670 models. This greatly reduces the amount of data that
52671 needs to be transferred over the network to display the
52672 world. The deduplicated models also lend themselves to
52673 a new method of simplification, called instance-aware
52674 simplification, which efficiently simplifies 3D models
52675 consisting of many instances of the same geometry.",
52676 acknowledgement = ack-nhfb,
52677 pdfpages = "10",
52678 }
52679
52680 @TechReport{Azim:2013:DLU,
52681 author = "Tahir Azim and Ewen Cheslack-Postava and Philip
52682 Levis",
52683 title = "Displaying Large User-Generated Virtual Worlds from
52684 the Cloud",
52685 type = "Technical Report",
52686 number = "CSTR 2013-01",
52687 institution = inst-STAN-CS,
52688 address = inst-STAN-CS:adr,
52689 pages = "",
52690 day = "25",
52691 month = may,
52692 year = "2013",
52693 bibdate = "Fri Nov 21 07:40:47 MST 2025",
52694 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
52695 URL = "https://hci.stanford.edu/cstr/reports/2013-01.pdf",
52696 abstract = "",
52697 acknowledgement = ack-nhfb,
52698 pdfpages = "",
52699 }
52700
52701 @TechReport{Kim:2013:JNM,
52702 author = "Jae Young Kim and Omid Mashayekhi and Hang Qu and
52703 Maria Kazandjieva and Philip Levis",
52704 title = "{Janus}: a Novel {MAC} Protocol for Full Duplex
52705 Radio",
52706 type = "Technical Report",
52707 number = "CSTR 2013-02",
52708 institution = inst-STAN-CS,
52709 address = inst-STAN-CS:adr,
52710 pages = "12",
52711 day = "23",
52712 month = jul,
52713 year = "2013",
52714 bibdate = "Fri Nov 21 07:40:47 MST 2025",
52715 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
52716 URL = "https://hci.stanford.edu/cstr/reports/2013-02.pdf",
52717 abstract = "This paper presents Janus, a novel MAC protocol for
52718 full-duplex wireless networks. Unlike other full-duplex
52719 MACs, Janus allows partially interfering nodes to
52720 cooperate by finding the appropriate transmission rates
52721 based on interference levels, making better use of the
52722 channel. Computing the optimal schedule and
52723 transmission rates is NPComplete, so Janus uses a
52724 cheaper heuristic approach. Janus also ensures that
52725 channel access time is shared fairly between all nodes.
52726 Janus has lower per-packet overhead compared to
52727 CSMA\slash CA because it eliminates random back-off and
52728 lets nodes transmit multiple packets with a single set
52729 of control packets. We show that for a setup with one
52730 access point and three nodes, Janus achieves $ 2.5
52731 \times $ the throughput of half-duplex system based on
52732 CSMA\slash CA.",
52733 acknowledgement = ack-nhfb,
52734 pdfpages = "12",
52735 }
52736
52737 @TechReport{Wu:2013:SCR,
52738 author = "Leslie Wu and Jesse Cirimele and Kristen Leach and
52739 Stuart Card and Larry Chu and Kyle Harrison and Scott
52740 Klemmer",
52741 title = "Supporting Crisis Response with Dynamic Procedure
52742 Aids",
52743 type = "Technical Report",
52744 number = "CSTR 2013-03",
52745 institution = inst-STAN-CS,
52746 address = inst-STAN-CS:adr,
52747 pages = "29",
52748 day = "17",
52749 month = sep,
52750 year = "2013",
52751 bibdate = "Fri Nov 21 07:40:47 MST 2025",
52752 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
52753 URL = "https://hci.stanford.edu/cstr/reports/2013-03.pdf",
52754 abstract = "Checklist usage can increase performance in complex,
52755 perilous domains. While paper checklists are valuable,
52756 they are static, slow to access, and show both too much
52757 and too little information. In response, we introduce
52758 the Dynamic Procedure Aids approach. Dynamic Procedure
52759 Aids address four key problems in checklist usage:
52760 ready access to the aids, rapid assimilation of their
52761 content, professional acceptance of their use in
52762 medical procedures, and the limited attention available
52763 to their users. To understand the efficacy of Dynamic
52764 Procedure Aids for crisis response, we created dpAid, a
52765 software system for crisis medicine. dpAid's design was
52766 based on more than a year of observing medical teams
52767 responding to simulated crises. We assess our Dynamic
52768 Procedure Aids with narrative simulation. A study
52769 compared Dynamic Procedure Aids, paper, and no aid
52770 conditions, finding that participants with Dynamic
52771 Procedure Aids performed significantly better than with
52772 paper or no aid.",
52773 acknowledgement = ack-nhfb,
52774 pdfpages = "29",
52775 }
52776
52777 @TechReport{Mistree:2014:RAN,
52778 author = "Behram F. T. Mistree and Jay Thomason and Gabriel Kho
52779 and Harrison Ho and Edric Kyauk and Philip Levis",
52780 title = "Rethinking Application Networking as Transactional
52781 Scripting",
52782 type = "Technical Report",
52783 number = "CSTR 2014-01",
52784 institution = inst-STAN-CS,
52785 address = inst-STAN-CS:adr,
52786 pages = "14",
52787 day = "4",
52788 month = feb,
52789 year = "2014",
52790 bibdate = "Fri Nov 21 07:40:47 MST 2025",
52791 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
52792 URL = "https://hci.stanford.edu/cstr/reports/2014-01.pdf",
52793 abstract = "We describe Waldo, a scripting language for
52794 application networking. Waldo allows programmers to
52795 describe complex network interactions between many
52796 hosts as transactional operations with atomicity,
52797 consistency, and isolation. Waldo is able to provide
52798 these transactional semantics starvation-free without
52799 assuming global clocks, without centralized scheduling,
52800 and under arbitrary transaction conflicts. This allows
52801 programmers to write application networking as short
52802 transactional scripts that will never starve. Waldo
52803 achieves these results with a novel distributed
52804 transaction scheduling algorithm that combines the
52805 wound-wait algorithm and Lamport clocks with two
52806 transaction priority levels. Experimental results show
52807 that using the primary algorithm Waldo can perform up
52808 to 10,000 transactions per second between two endpoints
52809 connected across the wide area network.",
52810 acknowledgement = ack-nhfb,
52811 pdfpages = "14",
52812 }
52813
52814 @TechReport{Chang:2014:TDC,
52815 author = "Angel X. Chang and Christopher D. Manning",
52816 title = "{TokensRegex}: Defining cascaded regular expressions
52817 over tokens",
52818 type = "Technical Report",
52819 number = "CSTR 2014-02",
52820 institution = inst-STAN-CS,
52821 address = inst-STAN-CS:adr,
52822 pages = "4",
52823 day = "9",
52824 month = apr,
52825 year = "2014",
52826 bibdate = "Fri Nov 21 07:40:47 MST 2025",
52827 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib;
52828 https://www.math.utah.edu/pub/tex/bib/string-matching.bib",
52829 URL = "https://hci.stanford.edu/cstr/reports/2014-02.pdf",
52830 abstract = "We describe TokensRegex, a framework for defining
52831 cascaded regular expressions over token sequences.
52832 TokensRegex is available as part of the Stanford
52833 CoreNLP software package and can be used for various
52834 tasks which require reasoning over tokenized text. It
52835 has been used to build SUTime, a state-of-the-art
52836 temporal tagger, and can be helpful in a variety of
52837 scenarios such as named entity recognition (NER) and
52838 information extraction from tokens",
52839 acknowledgement = ack-nhfb,
52840 pdfpages = "",
52841 }
52842
52843 @TechReport{Chang:2014:LSK,
52844 author = "Angel X. Chang and Manolis Savva and Christopher D.
52845 Manning",
52846 title = "Learning Spatial Knowledge for Text to {3D} Scene
52847 Generation",
52848 type = "Technical Report",
52849 number = "CSTR 2014-03",
52850 institution = inst-STAN-CS,
52851 address = inst-STAN-CS:adr,
52852 pages = "11",
52853 day = "9",
52854 month = apr,
52855 year = "2014",
52856 bibdate = "Fri Nov 21 07:40:47 MST 2025",
52857 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
52858 URL = "https://hci.stanford.edu/cstr/reports/2014-03.pdf;
52859 https://nlp.stanford.edu/pubs/spatial-emnlp2014.pdf",
52860 abstract = "We address the grounding of natural language to
52861 concrete spatial constraints, and inference of implicit
52862 pragmatics in 3D environments. We apply our approach to
52863 the task of text-to-3D scene generation. We present a
52864 representation for common sense spatial knowledge and
52865 an approach to extract it from 3D scene data. In
52866 text-to-3D scene generation, a user provides as input
52867 natural language text from which we extract explicit
52868 constraints on the objects that should appear in the
52869 scene. The main innovation of this work is to show how
52870 to augment these explicit constraints with learned
52871 spatial knowledge to infer missing objects and likely
52872 layouts for the objects in the scene. We demonstrate
52873 that spatial knowledge is useful for interpreting
52874 natural language and show examples of learned knowledge
52875 and generated 3D scenes.",
52876 acknowledgement = ack-nhfb,
52877 pdfpages = "11",
52878 xxauthor = "Manolis Savva and Angel X. Chang and Christopher D.
52879 Manning",
52880 }
52881
52882 @TechReport{Nayak:2014:DNA,
52883 author = "Neha Nayak and Mark Kowarsky and Gabor Angeli and
52884 Christopher D. Manning",
52885 title = "A Dictionary of Nonsubsective Adjectives",
52886 type = "Technical Report",
52887 number = "CSTR 2014-04",
52888 institution = inst-STAN-CS,
52889 address = inst-STAN-CS:adr,
52890 pages = "7",
52891 day = "22",
52892 month = oct,
52893 year = "2014",
52894 bibdate = "Fri Nov 21 07:40:47 MST 2025",
52895 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
52896 URL = "https://hci.stanford.edu/cstr/reports/2014-04.pdf",
52897 abstract = "Computational approaches to inference and information
52898 extraction often assume that adjective--noun compounds
52899 maintain all the relevant properties of the unmodified
52900 noun. A significant portion of nonsubsective adjectives
52901 violate this assumption. We present preliminary work
52902 towards a classifier for these adjectives. We also
52903 compile a comprehensive list of 60 nonsubsective
52904 adjectives including those used for training and those
52905 found by the classifiers.",
52906 acknowledgement = ack-nhfb,
52907 pdfpages = "7",
52908 }
52909
52910 @TechReport{Mashayekhi:2015:DGS,
52911 author = "Omid Mashayekhi and Chinmayee Shah and Hang Qu and
52912 Andrew Lim and Philip Levis",
52913 title = "Distributed Graphical Simulation in the Cloud",
52914 type = "Technical Report",
52915 number = "CSTR 2015-01",
52916 institution = inst-STAN-CS,
52917 address = inst-STAN-CS:adr,
52918 pages = "7",
52919 day = "24",
52920 month = apr,
52921 year = "2015",
52922 bibdate = "Fri Nov 21 07:40:47 MST 2025",
52923 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
52924 URL = "https://hci.stanford.edu/cstr/reports/2015-01.pdf",
52925 abstract = "Graphical simulations are a cornerstone of modern
52926 media and films. But existing software packages are
52927 designed to run on HPC nodes, and perform poorly in the
52928 computing cloud. These simulations have complex data
52929 access patterns over complex data structures, and
52930 mutate data arbitrarily, and so are a poor fit for
52931 existing cloud computing systems. We describe a
52932 software architecture for running graphical simulations
52933 in the cloud that decouples control logic, computations
52934 and data exchanges. This allows a central controller to
52935 balance load by redistributing computations, and
52936 recover from failures. Evaluations show that the
52937 architecture can run existing, state-of-the-art
52938 simulations in the presence of stragglers and failures,
52939 thereby enabling this large class of applications to
52940 use the computing cloud for the first time.",
52941 acknowledgement = ack-nhfb,
52942 pdfpages = "7",
52943 }
52944
52945 @TechReport{Qu:2016:CSA,
52946 author = "Hang Qu and Omid Mashayekhi and David Terei and Philip
52947 Levis",
52948 title = "{Canary}: a Scheduling Architecture for High
52949 Performance Cloud Computing",
52950 type = "Technical Report",
52951 number = "CSTR 2016-01",
52952 institution = inst-STAN-CS,
52953 address = inst-STAN-CS:adr,
52954 pages = "13",
52955 day = "1",
52956 month = feb,
52957 year = "2016",
52958 bibdate = "Fri Nov 21 07:40:47 MST 2025",
52959 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
52960 URL = "https://hci.stanford.edu/cstr/reports/2016-01.pdf",
52961 abstract = "We present Canary, a scheduling architecture that
52962 allows high performance analytics workloads to scale
52963 out to run on thousands of cores. Canary is motivated
52964 by the observation that a central scheduler is a
52965 bottleneck for high performance codes: a handful of
52966 multicore workers can execute tasks faster than a
52967 controller can schedule them.\par
52968
52969 The key insight in Canary is to reverse the
52970 responsibilities between controllers and workers.
52971 Rather than dispatch tasks to workers, which then fetch
52972 data as necessary, in Canary the controller assigns
52973 data partitions to workers, which then spawn and
52974 schedule tasks locally.\par
52975
52976 We evaluate three benchmark applications in Canary on
52977 up to 64 servers and 1, 152 cores on Amazon EC2. Canary
52978 achieves up to 9--90$ \times $ speedup over Spark and
52979 up to 4$ \times $ speedup over GraphX, a highly
52980 optimized graph analytics engine. While current
52981 centralized schedulers can schedule 2,500 tasks/second,
52982 each Canary worker can schedule 136,000 tasks/second
52983 per core and experiments show this scales out linearly,
52984 with 64 workers scheduling over 120 million tasks per
52985 second, allowing Canary to support optimized jobs
52986 running on thousands of core",
52987 acknowledgement = ack-nhfb,
52988 pdfpages = "13",
52989 }
52990
52991 @TechReport{Mashayekhi:2016:SFC,
52992 author = "Omid Mashayekhi and Hang Qu and Chinmayee Shah and
52993 Philip Levis",
52994 title = "Scalable, Fast Cloud Computing with Execution
52995 Templates",
52996 type = "Technical Report",
52997 number = "CSTR 2016-02",
52998 institution = inst-STAN-CS,
52999 address = inst-STAN-CS:adr,
53000 pages = "14",
53001 day = "10",
53002 month = may,
53003 year = "2016",
53004 bibdate = "Fri Nov 21 07:40:47 MST 2025",
53005 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
53006 URL = "https://hci.stanford.edu/cstr/reports/2016-02.pdf",
53007 abstract = "Large scale cloud data analytics applications are
53008 often CPU bound. Most of these cycles are wasted:
53009 benchmarks written in C++ run 10--51 times faster than
53010 frameworks such as Naiad and Spark. However, calling
53011 faster implementations from those frameworks only sees
53012 moderate (3--5$ \times $) speedups because their
53013 control planes cannot schedule work fast
53014 enough.\par
53015
53016 This paper presents execution templates, a control
53017 plane abstraction for CPU-bound cloud applications,
53018 such as machine learning. Execution templates leverage
53019 highly repetitive control flow to cache scheduling
53020 decisions as templates. Rather than reschedule hundreds
53021 of thousands of tasks on every loop execution, nodes
53022 instantiate these templates. A controller's template
53023 specifies the execution across all worker nodes, which
53024 it partitions into per-worker templates. To ensure that
53025 templates execute correctly, controllers dynamically
53026 patch templates to match program control flow. We have
53027 implemented execution templates in Nimbus, a C++ cloud
53028 computing framework. Running in Nimbus, analytics
53029 benchmarks can run 16--43 times faster than in Naiad
53030 and Spark. Nimbus's control plane can scale out to run
53031 these faster benchmarks on up to 100 nodes (800
53032 cores).",
53033 acknowledgement = ack-nhfb,
53034 pdfpages = "14",
53035 }
53036
53037 @TechReport{Subhraveti:2017:ARA,
53038 author = "Dinesh Subhraveti and Sri Goli and Serge Hallyn and
53039 Ravi Chamarthy and Christos Kozyrakis",
53040 title = "{AppSwitch}: Resolving the Application Identity
53041 Crisis",
53042 type = "Technical Report",
53043 number = "CSTR 2017-07",
53044 institution = inst-STAN-CS,
53045 address = inst-STAN-CS:adr,
53046 pages = "7",
53047 day = "5",
53048 month = nov,
53049 year = "2017",
53050 bibdate = "Fri Nov 21 07:40:47 MST 2025",
53051 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
53052 URL = "https://hci.stanford.edu/cstr/reports/2017-01.pdf",
53053 abstract = "Networked applications traditionally derive their
53054 identity from the identity of the host on which they
53055 run. The default application identity acquired from the
53056 host results in subtle and substantial problems related
53057 to application deployment, discovery and access,
53058 especially for modern distributed applications. A
53059 number of mechanisms and workarounds, often quite
53060 elaborate, are used to address those problems but they
53061 only address them indirectly and incompletely.\par
53062
53063 This paper presents AppSwitch, a novel transport layer
53064 network element that decouples applications from
53065 underlying network at the system call layer and enables
53066 them to be identified independently of the network.
53067 Without requiring changes to existing applications or
53068 infrastructure, it removes the cost and complexity
53069 associated with operating distributed applications
53070 while offering a number of benefits including an
53071 efficient implementation of common network functions
53072 such as application firewall and load balancer.
53073 Experiments with our implementation show that AppSwitch
53074 model also effectively removes the performance penalty
53075 associated with unnecessary data path processing that
53076 is typical in those application environments",
53077 acknowledgement = ack-nhfb,
53078 pdfpages = "7",
53079 }
53080
53081 %%% ====================================================================
53082 %%% Cross-referenced entries must come last. Entries are sorted by
53083 %%% year and then by citation label.
53084
53085 @Article{Wilkinson:1968:ADM,
53086 author = "James H. Wilkinson",
53087 title = "Almost Diagonal Matrices with Multiple or Close
53088 Eigenvalues",
53089 journal = j-LINEAR-ALGEBRA-APPL,
53090 volume = "1",
53091 pages = "1--12",
53092 year = "1968",
53093 CODEN = "LAAPAW",
53094 ISSN = "0024-3795 (print), 1873-1856 (electronic)",
53095 ISSN-L = "0024-3795",
53096 MRclass = "15.25 (65.00)",
53097 MRnumber = "MR0225794 (37 \#1386)",
53098 MRreviewer = "John Todd",
53099 bibdate = "Fri Nov 21 09:13:48 2025",
53100 bibsource = "https://www.math.utah.edu/pub/bibnet/authors/w/wilkinson-james-hardy.bib;
53101 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
53102 author-dates = "James H. Wilkinson (27 September 1919--5 October
53103 1986)",
53104 fjournal = "Linear Algebra and its Applications",
53105 journal-URL = "http://www.sciencedirect.com/science/journal/00243795",
53106 }
53107
53108 @Article{Golub:1976:ICE,
53109 author = "Gene H. Golub and James H. Wilkinson",
53110 title = "Ill-Conditioned Eigensystems and the Computation of
53111 the {Jordan} Canonical Form",
53112 journal = j-SIAM-REVIEW,
53113 volume = "18",
53114 number = "4",
53115 pages = "578--619",
53116 month = "????",
53117 year = "1976",
53118 CODEN = "SIREAD",
53119 DOI = "https://doi.org/10.1137/1018113",
53120 ISSN = "0036-1445 (print), 1095-7200 (electronic)",
53121 ISSN-L = "0036-1445",
53122 MRclass = "65F15 (15A21)",
53123 MRnumber = "54 \#1570",
53124 MRreviewer = "Robert Todd Gregory",
53125 bibdate = "Fri Dec 20 17:05:12 1996",
53126 bibsource = "https://www.math.utah.edu/pub/bibnet/authors/g/golub-gene-h.bib;
53127 https://www.math.utah.edu/pub/tex/bib/gvl.bib;
53128 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
53129 note = "Reprinted in \cite{Chan:2007:MMC}.",
53130 acknowledgement = ack-nhfb,
53131 author-dates = "Gene Howard Golub (February 29, 1932--November 16,
53132 2007)",
53133 fjournal = "SIAM Review",
53134 journal-URL = "http://epubs.siam.org/sirev",
53135 keywords = "nla, eig, Jordan form, condition, pert,
53136 ill-conditioned problem",
53137 }
53138
53139 @Article{Symm:1980:REBb,
53140 author = "H. J. Symm and James H. Wilkinson",
53141 title = "Realistic error bounds for a simple eigenvalue and its
53142 associated eigenvector",
53143 journal = j-NUM-MATH,
53144 volume = "35",
53145 number = "2",
53146 pages = "113--126",
53147 month = jun,
53148 year = "1980",
53149 CODEN = "NUMMA7",
53150 DOI = "https://doi.org/10.1007/BF01396310",
53151 ISSN = "0029-599X (print), 0945-3245 (electronic)",
53152 ISSN-L = "0029-599X",
53153 MRclass = "65F15",
53154 MRnumber = "83b:65037",
53155 MRreviewer = "Alan L. Andrew",
53156 bibdate = "Mon May 26 11:49:34 MDT 1997",
53157 bibsource = "https://www.math.utah.edu/pub/bibnet/authors/w/wilkinson-james-hardy.bib;
53158 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib;
53159 Theory/Matrix.bib",
53160 acknowledgement = ack-nhfb,
53161 annote = "Cited in \cite{govl:89}.",
53162 author-dates = "James H. Wilkinson (27 September 1919--5 October
53163 1986)",
53164 classification = "C1100 (Mathematical techniques); C4110 (Error
53165 analysis in numerical methods)",
53166 corpsource = "Div. of Numerical Analysis and Computer Sci., Nat.
53167 Phys. Lab., Teddington, UK",
53168 fjournal = "Numerische Mathematik",
53169 journal-URL = "http://link.springer.com/journal/211",
53170 keywords = "eig; eigenvalue; eigenvalues and eigenfunctions;
53171 eigenvector; error analysis; error bounds; error
53172 estimates; la; pert",
53173 treatment = "T Theoretical or Mathematical",
53174 }
53175
53176 @Book{Nourbakhsh:1997:IPEb,
53177 author = "Illah Reza Nourbakhsh",
53178 title = "Interleaving Planning and Execution for Autonomous
53179 Robots",
53180 volume = "SECS 385",
53181 publisher = pub-KLUWER,
53182 address = pub-KLUWER:adr,
53183 pages = "xvi + 145",
53184 year = "1997",
53185 ISBN = "0-7923-9828-9",
53186 ISBN-13 = "978-0-7923-9828-8",
53187 LCCN = "TJ211.415 .N68 1997",
53188 bibdate = "Thu Nov 27 20:11:31 MST 2025",
53189 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib;
53190 z3950.loc.gov:7090/Voyager",
53191 series = "Kluwer international series in engineering and
53192 computer science; Robotics",
53193 acknowledgement = ack-nhfb,
53194 author-dates = "1970--",
53195 subject = "Autonomous robots; Robots; Control systems; Artificial
53196 intelligence; Uncertainty; Mathematical models",
53197 }
53198
53199 @Book{Chan:2007:MMC,
53200 editor = "Raymond H. Chan and Chen Greif and Dianne P. O'Leary",
53201 booktitle = "Milestones in Matrix Computation: the Selected Works
53202 of {Gene H. Golub} with Commentaries",
53203 title = "Milestones in Matrix Computation: the Selected Works
53204 of {Gene H. Golub} with Commentaries",
53205 publisher = pub-OXFORD,
53206 address = pub-OXFORD:adr,
53207 pages = "xi + 565 + 3",
53208 year = "2007",
53209 ISBN = "0-19-920681-3",
53210 ISBN-13 = "978-0-19-920681-0",
53211 LCCN = "QA188 .G67 2007",
53212 MRclass = "65-06 (01A75 65Fxx)",
53213 MRnumber = "MR2281939 (2008b:65004)",
53214 MRreviewer = "David Scott Watkins",
53215 bibdate = "Sat Apr 07 10:23:33 2007",
53216 bibsource = "https://www.math.utah.edu/pub/bibnet/authors/g/golub-gene-h.bib;
53217 https://www.math.utah.edu/pub/bibnet/authors/h/higham-nicholas-john.bib;
53218 https://www.math.utah.edu/pub/bibnet/authors/l/lanczos-cornelius.bib;
53219 https://www.math.utah.edu/pub/tex/bib/master.bib;
53220 https://www.math.utah.edu/pub/tex/bib/numana2000.bib;
53221 https://www.math.utah.edu/pub/tex/bib/siamjnumeranal.bib;
53222 https://www.math.utah.edu/pub/tex/bib/siamreview.bib;
53223 https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib;
53224 https://www.math.utah.edu/pub/tex/bib/technometrics1970.bib",
53225 URL = "http://www.loc.gov/catdir/enhancements/fy0737/2007276086-d.html",
53226 abstract = "The text presents and discusses some of the most
53227 influential papers in Matrix Computation authored by
53228 Gene H. Golub, one of the founding fathers of the
53229 field. The collection of 21 papers in divided into five
53230 main areas: iterative methods for linear systems,
53231 solution of least squares problems, matrix
53232 factorizations and applications, orthogonal polynomials
53233 and quadrature, and eigenvalue problems an commentaries
53234 for each area are provided by leading experts: Anne
53235 Greenbaum, {\AA}ke Bj{\"o}rck, Nicholas Higham, Walter
53236 Gautschi, and G. W. (Pete) Stewart. Comments on each
53237 paper are also provided by the original authors,
53238 providing the reader with historical information on how
53239 the paper came to be written and under what
53240 circumstances the collaboration was undertaken.
53241 Including a brief biography and facsimiles of the
53242 original papers, this text will be of great interest to
53243 students and researchers in numerical analysis and
53244 scientific computation.",
53245 acknowledgement = ack-nhfb,
53246 author-dates = "Gene Howard Golub (February 29, 1932--November 16,
53247 2007); Nicholas John Higham (25 December 1961--20
53248 January 2024); Christian H. Reinsch (?? ?? 1932--8
53249 October 2022); James H. Wilkinson (27 September 1919--5
53250 October 1986)",
53251 tableofcontents = "List of Plates / x \\
53252 I: Gene H. Golub \\
53253 1 Gene H. Golub Biography, by Chen Greif / 3 \\
53254 2 Publications of Gene H. Golub / 13 \\
53255 3 Major Awards / 30 \\
53256 4 Students of Gene H. Golub / 32 \\
53257 II: Iterative Methods for Linear Systems \\
53258 5 Commentary, by Anne Greenbaum / 35 \\
53259 References / 43 \\
53260 6 Chebyshev semi-iterative methods, successive
53261 over-relaxation iterative methods, and second-order
53262 Richardson iterative methods, Parts I and II (with R.
53263 S. Varga) / 45 \\
53264 7 A generalized conjugate gradient method for
53265 non-symmetric systems of linear equations (with Paul
53266 Concus) / 68 \\
53267 8 A generalized conjugate gradient method for the
53268 numerical solution of elliptic partial differential
53269 equations (with Paul Concus and Dianne P. O'Leary) / 79
53270 \\
53271 9 Hermitian and Skew-Hermitian Splitting Methods for
53272 Non-Hermitian Positive Definite Linear Systems (with
53273 Zhong-Zhi Bai and Michael K. Ng) / 102 \\
53274 III: Solution of Least Squares Problems \\
53275 10 Commentary, by {\AA}ke Bj{\"o}rck / 129 \\
53276 References / 141 \\
53277 11 Numerical methods for solving linear least squares
53278 problems / 148 \\
53279 12 Singular value decomposition and least squares
53280 solutions (with C. Reinsch) / 160 \\
53281 13 The differentiation of pseudo-inverses and
53282 non-linear least squares problems whose variables
53283 separate (with V. Pereyra) / 181 \\
53284 14 Generalized cross-validation as a method for
53285 choosing a good ridge parameter (with M. Heath and G.
53286 Wahba) / 202 \\
53287 15 An analysis of the total least squares problem (with
53288 C. Van Loan) / 213 \\
53289 IV: Matrix Factorizations and Applications \\
53290 16 Commentary, by Nicholas Higham / 227 \\
53291 References / 233 \\
53292 17 Calculating the singular values and pseudo-inverse
53293 of a matrix (with W. Kahan) / 236 \\
53294 18 The simplex method of linear programming using $ L U
53295 $ decomposition (with R. H. Bartels) / 257 \\
53296 19 On direct methods for solving Poisson's equation
53297 (with B. L. Buzbee and C. W. Nielson) / 261 \\
53298 20 Numerical methods for computing angles between
53299 linear subspaces (with {\AA}. Bj{\"o}rck) / 292 \\
53300 21 Methods for modifying matrix factorizations (with P.
53301 E. Gill, W. Murray and M. A. Saunders) / 309 \\
53302 V: Orthogonal Polynomials and Quadrature \\
53303 22 Commentary, by Walter Gautschi / 345 \\
53304 References / 354 \\
53305 23 Calculation of Gauss quadrature rules (with J. H.
53306 Welsch) / 359 \\
53307 24 Matrices, moments, and quadrature (with G{\'e}rard
53308 Meurant) / 380 \\
53309 25 Computation of Gauss--Kronrod Quadrature Rules (with
53310 D. Calvetti, W. B. Gragg and L. Reichel) / 434 \\
53311 VI: Eigenvalue Problems \\
53312 26 Commentary, by G. W. Stewart / 457 \\
53313 References / 465 \\
53314 27 Some modified matrix eigenvalue problems / 467 \\
53315 28 Ill-conditioned eigensystems and the computation of
53316 the Jordan canonical form (with James H. Wilkinson) /
53317 485 \\
53318 29 The block Lanczos method for computing eigenvalues
53319 (with R. Underwood) / 528 \\
53320 30 The numerically stable reconstruction of a Jacobi
53321 matrix from spectral data (with C. de Boor) / 546 \\
53322 Index / 563",
53323 }
53324
53325 @Book{Knuth:1979:TMN,
53326 author = "Donald E. Knuth",
53327 title = "{\TeX} and {\METAFONT}: New Directions in
53328 Typesetting",
53329 publisher = pub-DP # " and " # pub-AMS,
53330 address = pub-DP:adr # " and " # pub-AMS:adr,
53331 pages = "xi + 45 + 201 + 105",
53332 year = "1979",
53333 ISBN = "0-932376-02-9, 0-8218-0209-7",
53334 ISBN-13 = "978-0-932376-02-2, 978-0-8218-0209-0",
53335 LCCN = "Z253.3 .K58 1979",
53336 MRclass = "00A05",
53337 MRnumber = "80i:00002",
53338 bibdate = "Fri Mar 22 18:03:29 MST 2002",
53339 bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib;
53340 MathSciNet database",
53341 note = "Revised version of Stanford computer science report
53342 number STAN-CS-78-675, originally published in
53343 September, 1978 \cite{Knuth:1978:TEC}.",
53344 acknowledgement = ack-nhfb,
53345 keywords = "computerized typesetting",
53346 }