perm filename OLDTRS[LIB,DOC]19 blob [1]sn#772352 filedate 1984-10-22 generic text, type C, neo UTF8 COMMENT āŠ— VALID 00040 PAGES C REC PAGE DESCRIPTION C00001 00001 C00004 00002 VOL. 3, NO. 1, 1/15/81 C00030 00003 VOL. 3, NO. 6, 06/01/81 C00060 00004 C00063 00005 C00066 00006 VOL. 4, NO. 3 03/15/82 C00089 00007 VOL. 4, NO. 4 04/23/82 C00125 00008 VOL. 4, NO. 5 05/15/82 C00150 00009 VOL. 4, NO. 6 06/01/82 C00175 00010 VOL. 4, NO. 7 06/23/82 C00199 00011 VOL. 4, NO. 8 07/15/82 C00225 00012 VOL. 4, NO. 9 09/01/82 C00253 00013 VOL. 4, NO. 10 09/28/82 C00278 00014 VOL. 4, NO. 11 10/15/82 C00310 00015 VOL. 4, NO. 12 11/15/82 C00340 00016 VOL. 4, NO. 13 1/15/83 C00367 00017 VOL. 5, NO. 1 02/01/83 C00390 00018 VOL. 5, NO. 2 03/01/83 C00414 00019 VOL. 5, NO. 3 04/01/83 C00444 00020 VOL. 5, NO. 4 04/22/83 C00472 00021 VOL. 5, NO. 5 05/09/83 C00501 00022 VOL. 5, NO. 6 05/25/83 C00531 00023 VOL. 5, NO. 7 06/08/83 C00562 00024 VOL. 5, NO. 8 07/25/83 C00592 00025 VOL. 5, NO. 9 08/10/83 C00636 00026 VOL. 5, NO. 10 08/22/83 C00671 00027 VOL. 5, NO. 11 10/22/83 C00710 00028 VOL. 5, NO. 12 11/15/83 C00750 00029 VOL. 5, NO. 13 12/22/83 C00775 00030 VOL. 6, NO. 1 02/01/84 C00804 00031 VOL. 6, NO. 2 03/01/84 C00833 00032 VOL. 6, NO. 3 03/19/84 C00873 00033 VOL. 6, NO. 4 04/26/84 C00908 00034 VOL. 6, NO. 5 05/14/84 C00945 00035 VOL. 6, NO. 6 05/28/84 C00989 00036 VOL. 6, NO. 7 06/11/84 C01027 00037 VOL. 6, NO. 8 08/06/84 C01056 00038 VOL. 6, NO. 9 08/20/84 C01083 00039 VOL. 6, NO. 10 09/20/84 C01121 00040 VOL. 6, NO. 11 10/22/84 C01168 ENDMK CāŠ—; VOL. 3, NO. 1, 1/15/81 014437 ADDISON, C.A.*NUMERICAL METHODS FOR A CLASS OF SECOND ORDER ODE'S ARISING IN STRUCTURAL DYNAMICS.* TORONTO U. COMP.SCI.DEPT.*TECH.RPT. 147.*1980. 014438 ALKHATEEB, D. KAWASAKI, S. MUROGA, S.*AN IMPROVEMENT OF A BRANCH AND BOUND ALGORITHM FOR DESIGNING NOR OPTIMAL NETWORKS.* ILLINOIS U. COMP.SCI.DEPT.*UIUCDCS-R-80-1033.* 1980. 014439 ALMES, G.T.* GARBAGE COLLECTION IN AN OBJECT ORIENTED SYSTEM.* CARNEGIE MELLON U. COMP.SCI.DEPT.*CMU-CS-80-128, PH.D. THESIS. ALMES, G.T.*1980. 014440 AMAREL, S.*INITIAL THOUGHTS ON CHARACTERIZATION OF EXPERT SYSTEMS.* RUTGERS U. COMP.SCI.RES.LAB.*CBM-TM-088.*1980. * 014441 BANERJI, R.B. MITCHELL, T.M.* DESCRIPTION LANGUAGES AND LEARNING ALGORITHMS: A PARADIGM FOR COMPARISON.* RUTGERS U. COMP.SCI.RES.LAB.*CBM-TR-107.*1980. 014442 BEITRAEGE ZUR GEOMETRIE UND ALGEBRA, NR. 6: EIN BEWEIS DES BERUEHRSATZES IN SYMMETRISCHEN HYPERBELSTRUKTUREN, VON H.-J. SAMAGA; EXAMPLES OF PLANAR NEAR RINGS ON NON ABELIAN GROUPS, BY J.R. CLAY; TACTICAL CONFIGURATIONS HAVING P AFFINE PLANES SHARING A PENCIL OF LINES, BY J.R. CLAY; UEBER EIN PROBLEM VON H. KARZEL, VON H. KUEHLBRANDT; EINE BECKMAN QUARLES CHARAKTERISIERUNG DER LORENTZTRANSFORMATIONEN DES R SUPERSCRIPT N, VON W. BENZ; UEBER EINE VERALLGEMEINERUNG DES FUNDAMENTALSATZES IN DESARGUESSCHEN AFFINEN EBENEN, VON H. SCHAEFFER; ZUR INZIDENZSTRUKTUR KINEMATISCHER RAEUME UND ABSOLUTER EBENEN, VON H. KARZEL UND H.-J. KROLL.* TECHNISCHE UNIVERSITAET MUENCHEN. INSTITUT FUER MATHEMATIK.* TUM-M8010.*1980. * 014443 BRINCH HANSEN, P.*THE DESIGN OF EDISON.* SOUTHERN CAL U. COMP.SCI.DEPT.*1980. ** 014444 BRINCH HANSEN, P.* EDISON: A MULTIPROCESSOR LANGUAGE.* SOUTHERN CAL U. COMP.SCI.DEPT.*1980. * 014445 BRINCH HANSEN, P.* EDISON PROGRAMS.* SOUTHERN CAL U. COMP.SCI.DEPT.*1980. * 014446 BRISTOW, G.*THE STATIC DETECTION OF SYNCHRONIZATION ANOMALIES IN HAL/S PROGRAMS.* COLORADO U. COMP.SCI.DEPT.* CU-CS-165-79.*1979. * 014447 BRISTOW, G.*TOOLS TO AID THE SPECIFICATION AND DESIGN OF FLIGHT SOFTWARE.* COLORADO U. COMP.SCI.DEPT.* CU-CS-168-80.*1980. 014448 BRODY, D.A.*THE POST MACOMBER CASES IN A TAXMAN II FRAMEWORK: A PRELIMINARY ANALYSIS.* RUTGERS U. COMP.SCI.RES.LAB.*LRP-TR-005.*1980. ** 014449 BURSTALL, R.M. MACQUEEN, D.B. SANNELLA, D.T.* HOPE: AN EXPERIMENTAL APPLICATIVE LANGUAGE.* EDINBURGH U. COMP.SCI.DEPT.*CSR-62-80.*1980. * 014450 BURSTALL, R.M. GOGUEN, J.A.*THE SEMANTICS OF CLEAR, A SPECIFICATION LANGUAGE.* EDINBURGH U. COMP.SCI.DEPT.* CSR-65-80.*1980. * 014451 CHENG, W.Y. RAY, S. KOLSTAD, R. LUHUKAY, J. CAMPBELL, R. LIU, J.W.-S.* ILLINET -- A 32 MBITS/SEC. LOCAL AREA NETWORK.* ILLINOIS U. COMP.SCI.DEPT.*UIUCDCS-R-80-1035.* 1980. 014452 CHOW, C.Y.-F.*A VARIABLE PRECISION PROCESSOR MODULE.* ILLINOIS U. COMP.SCI.DEPT.*UIUCDCS-R-80-1032, PH.D. THESIS. CHOW, C.Y.-F.*1980. 014453 CIESIELSKI, V.*A METHODOLOGY FOR THE CONSTRUCTION OF NATURAL LANGUAGE FRONT ENDS FOR MEDICAL CONSULTATION SYSTEMS.* RUTGERS U. COMP.SCI.RES.LAB.*CBM-TR-112, PH.D. THESIS. CIESIELSKI, V.*1980. 014454 CLEMM, G.M.* CLEMSW USER'S MANUAL.* COLORADO U. COMP.SCI.DEPT.*CS-CU-167-79.*1979. 014455 CLEMM, G.M.* FSCANN REPORT AND USER'S MANUAL.* COLORADO U. COMP.SCI.DEPT.*CU-CS-166-79.*1979. 014456 COX, M.G.* DIRECT VERSUS ITERATIVE METHODS FOR MULTIVARIATE SPLINE FITTING PROBLEMS.* U.K. NATIONAL PHYSICAL LAB. NUM.ANAL. & COMP.SCI.DIV.*DNACS 37/80.*1980. 014457 DENNIS, J.E. SCHNABEL, R.B.*A NEW DERIVATION OF SYMMETRIC POSITIVE DEFINITE SECANT UPDATES.* COLORADO U. COMP.SCI.DEPT.*CU-CS-185-80.*1980. 014458 EDWARDS, B.*FUNCTIONAL SPECIFICATIONS OF THE ANNULAR SUSPENSION POINTING SYSTEM.* COLORADO U. COMP.SCI.DEPT.* CU-CS-171-80.*1980. * 014459 EHRENFEUCHT, A. ROZENBERG, G. VERRAEDT, R.*BASIC FORMULAS AND LANGUAGES. PART I. THE THEORY.* COLORADO U. COMP.SCI.DEPT.*CU-CS-191-80.*1980. * 014460 EHRENFEUCHT, A. ROZENBERG, G. VERRAEDT, R.*BASIC FORMULAS AND LANGUAGES. PART II. APPLICATIONS TO EOL SYSTEMS AND FORMS.* COLORADO U. COMP.SCI.DEPT.*CU-CS-192-80.*1980. * 014461 EHRENFEUCHT, A. ENGELFRIET, J. ROZENBERG, G.* CONTEXT FREE NORMAL SYSTEMS AND ETOL SYSTEMS.* COLORADO U. COMP.SCI.DEPT.*CU-CS-194-80.*1980. * 014462 EHRENFEUCHT, A. MAURER, H. ROZENBERG, G.* CONTINUOUS GRAMMARS.* COLORADO U. COMP.SCI.DEPT.*CU-CS-162-79.* 1979. * 014463 EHRENFEUCHT, A. ROZENBERG, G.* DOS SYSTEMS AND LANGUAGES.* COLORADO U. COMP.SCI.DEPT.*CU-CS-160-79.*1979. * 014464 EHRENFEUCHT, A. ROZENBERG, G.* FPOL SYSTEMS GENERATING COUNTING LANGUAGES.* COLORADO U. COMP.SCI.DEPT.* CU-CS-156-79.*1979. * 014465 EHRENFEUCHT, A. ROZENBERG, G. RUOHONEN, K.*A MORPHIC REPRESENTATION OF COMPLEMENTS OF RECURSIVELY ENUMERABLE SETS.* COLORADO U. COMP.SCI.DEPT.*CU-CS-193-80.*1980. * 014466 EHRENFEUCHT, A. ROZENBERG, G.*ON A BOUND FOR THE DOL SEQUENCE EQUIVALENCE PROBLEM.* COLORADO U. COMP.SCI.DEPT.* CU-CS-163-79.*1979. * 014467 EHRENFEUCHT, A. ROZENBERG, G.*ON AMBIGUITY IN EOL SYSTEMS.* COLORADO U. COMP.SCI.DEPT.*CU-CS-158-79.*1979. * 014468 EHRENFEUCHT, A. ROZENBERG, G.*ON THE EMPTINESS OF THE INTERSECTION OF TWO DOS LANGUAGES PROBLEM.* COLORADO U. COMP.SCI.DEPT.*CU-CS-159-79.*1979. * 014469 EHRENFEUCHT, A. ROZENBERG, G.*ON THE SEPARATING POWER OF EOL SYSTEMS.* COLORADO U. COMP.SCI.DEPT.*CU-CS-186-80.* 1980. * 014470 EHRENFEUCHT, A. ROZENBERG, G.*ON THE SUBWORD COMPLEXITY OF SQUARE FREE DOL LANGUAGES.* COLORADO U. COMP.SCI.DEPT.* CU-CS-174-80.*1980. * 014471 EHRENFEUCHT, A. PARIKH, R. ROZENBERG, G.* PUMPING LEMMAS FOR REGULAR SETS.* COLORADO U. COMP.SCI.DEPT.* CU-CS-155-79.*1979. * 014472 EHRENFEUCHT, A. ROZENBERG, G.*REPRESENTATION THEOREMS USING DOS LANGUAGES.* COLORADO U. COMP.SCI.DEPT.*CU-CS-161-79.* 1979. * 014473 EHRENFEUCHT, A. ROZENBERG, G.*THE SEQUENCE EQUIVALENCE PROBLEM IS DECIDABLE FOR OS SYSTEMS.* COLORADO U. COMP.SCI.DEPT.*CU-CS-157-79.*1979. 014474 FAHLMAN, S.E.*THE HASHNET INTERCONNECTION SCHEME.* CARNEGIE MELLON U. COMP.SCI.DEPT.*CMU-CS-80-125.*1980. * 014475 FEILER, P.H. MEDINA-MORA, R.*AN INCREMENTAL PROGRAMMING ENVIRONMENT.* CARNEGIE-MELLON U. COMP.SCI.DEPT.* CMU-CS-80-126.*1980. * 014476 FISCHER, M.J. MEYER, A.R. PATERSON, M.S.*OMEGA (N LOG N) LOWER BOUNDS ON LENGTH OF BOOLEAN FORMULAS.* M.I.T. LAB. FOR COMP.SCI.*TM-187.*1980. 014477 FOSDICK, L.D.*A STUDY OF ERRORS CAUSED BY TRANSCRIPTION MISTAKES IN FORTRAN PROGRAMS.* COLORADO U. COMP.SCI.DEPT.*CU-CS-146-79.*1979. * 014479 GABOW, H.N.*AN ALMOST-LINEAR ALGORITHM FOR TWO PROCESSOR SCHEDULING.* COLORADO U. COMP.SCI.DEPT.*CU-CS-196-80.* 1980. ** 014480 GABOW, H.N.*A LINEAR-TIME RECOGNITION ALGORITHM FOR INTERVAL DAGS.* COLORADO U. COMP.SCI.DEPT.*CU-CS-180-80.* 1980. * 014481 GAJSKI, D.D.* RECURRENCE SEMIGROUPS AND THEIR RELATION TO DATA STORAGE IN FAST RECURRENCE SOLVERS ON PARALLEL MACHINES.* ILLINOIS U. COMP.SCI.DEPT.*UIUCDCS-R-80-1037.* 1980. 014482 GALIL, Z. SEIFERAS, J.* TIME SPACE OPTIMAL STRING MATCHING (EXTENDED ABSTRACT).*NO ISSUING AGENCY INDICATED (AUTHORS' ADDRESSES: Z. GALIL - DEPARTMENT OF MATHEMATICAL SCIENCES/TEL-AVIV UNIVERSITY/TEL-AVIV/ISRAEL; J.I. SEIFERAS - DEPARTMENT OF COMPUTER SCIENCE/UNIVERSITY OF ROCHESTER/ROCHESTER, NEW YORK 14627).*1980. 014483 GARY, J.*THE MULTIGRID ITERATION APPLIED TO THE COLLOCATION METHOD.* COLORADO U. COMP.SCI.DEPT.*CU-CS-164-79.*1979. 014484 GERASOULIS, A.*ON THE EXISTENCE OF APPROXIMATE SOLUTIONS FOR SINGULAR INTEGRAL EQUATIONS OF CAUCHY TYPE DISCRETIZED BY GAUSS CHEBYSHEV QUADRATURE FORMULAE.* RUTGERS U. COMP.SCI.DEPT.*DCS-TR-094.*1980. 014485 GOLDBERG, R.N. WEISS, S.M.*AN EXPERIMENTAL TRANSFORMATION OF A LARGE EXPERT KNOWLEDGE BASE.* RUTGERS U. COMP.SCI.RES.LAB.*CBM-TR-110.*1980. 014486 GOLDBERG, R.N.* SOFTWARE DESIGN ISSUES IN THE ARCHITECTURE AND IMPLEMENTATION OF DISTRIBUTED TEXT EDITORS. DISSERTATION PROPOSAL.* RUTGERS U. COMP.SCI.DEPT.* DCS-TM-014.*1980. 014487 GOLDBERG, R.N.*USING BRIGHT FOR MAINTAINING CLASS ROSTERS AND GRADES.* RUTGERS U. COMP.SCI.RES.LAB.*LCSR-TM-001.* 1980. 014488 GOLDMAN, N.M. WILE, D.S.*A DATABASE FOUNDATION FOR PROCESS SPECIFICATIONS.* SOUTHERN CAL U. INFO.SCI.INST.* ISI/RR-80-84.*1980. 014489 GOODSON, J.L.*A PROCESS FOR EVALUATING TREE CONSISTENCY.* RUTGERS U. COMP.SCI.RES.LAB.*CBM-TR-111.*1980. 014490 GORIN, R.E.*INTRODUCTION TO DECSYSTEM-20 ASSEMBLY LANGUAGE PROGRAMMING. (STANFORD UNIVERSITY, COMPUTER SCIENCE DEPARTMENT: CS109B, WINTER 1981).* ST. U. COMP.SCI.DEPT.* 1980. 014491 HAMMARLING, S. WILKINSON, J.H.*ON LINEAR SYSTEMS ARISING FROM FINITE DIFFERENCE APPROXIMATIONS TO ELLIPTIC DIFFERENTIAL EQUATIONS.* U.K. NATIONAL PHYSICAL LAB. NUM.ANAL. & COMP.SCI.DIV.*DNACS 34/80.*1980. * 014492 HAUSSLER, D.* MODEL COMPLETENESS OF AN ALGEBRA OF LANGUAGES.* COLORADO U. COMP.SCI.DEPT.*CU-CS-178-80.* 1980. * 014493 HAUSSLER, D. ZEIGER, H.P.*VERY SPECIAL LANGUAGES AND REPRESENTATIONS OF RECURSIVELY ENUMERABLE LANGUAGES VIA COMPUTATION HISTORIES.* COLORADO U. COMP.SCI.DEPT.* CU-CS-177-80.*1980. ** 014494 HOEY, D. LEISERSON, C.E.*A LAYOUT FOR THE SHUFFLE EXCHAGE NETWORK.* CARNEGIE MELLON U. COMP.SCI.DEPT.* CMU-CS-80-139.*1980. 014497 KUNG, H.-T. PAPADIMITRIOU, C.H.*AN OPTIMALITY THEORY OF CONCURRENCY CONTROL FOR DATABASES.* M.I.T. LAB. FOR COMP.SCI.*TM-185.*1980. 014498 LESZCZYLOWSKI, J.*THEORY OF FP SYSTEMS IN EDINBURGH LCF.* EDINBURGH U. COMP.SCI.DEPT.*CSR-61-80.*1980. 014500 LIBES, D.*A GUIDE TO APPLYING TO GRADUATE SCHOOL (IN COMPUTER SCIENCE).* RUTGERS U. COMP.SCI.DEPT.*DCS-TM-013.* 1980. 014501 MCCARTY, L.T. SRIDHARAN, N.S.*THE REPRESENTATION OF AN EVOLVING SYSTEM OF LEGAL CONCEPTS: I. LOGICAL TEMPLATES.* RUTGERS U. COMP.SCI.RES.LAB.*LRP-TR-007.*1980. 014502 MCCARTY, L.T. SRIDHARAN, N.S.*THE REPRESENTATION OF CONCEPTUAL STRUCTURES IN TAXMAN II.* RUTGERS U. COMP.SCI.RES.LAB.*LRP-TR-004.*1980. 014503 MCCARTY, L.T.*SOME NOTES ON THE MAP FORMALISM OF TAXMAN II, WITH APPLICATIONS TO EISNER V. MACOMBER.* RUTGERS U. COMP.SCI.RES.LAB.*LRP-TR-006.*1980. 014504 MCCARTY, L.T.*SOME REQUIREMENTS FOR A COMPUTER-BASED LEGAL CONSULTANT. * RUTGERS U. COMP.SCI.RES.LAB.*LRP-TR-008.* 1980. 014505 MITCHELL, T.M. UTGOFF, P.E. BANERJI, R.B.* LEARNING PROBLEM SOLVING HEURISTICS BY EXPERIMENTATION.* RUTGERS U. COMP.SCI.RES.LAB.*CBM-TR-114.*1980. * 014506 MOORE, R.C.* REASONING ABOUT KNOWLEDGE AND ACTION.* SRI INTERNATIONAL. A.I. CENTER.*TECH. NOTE 191, PH.D. THESIS. MOORE, R.C. (M.I.T.).*1980. 014507 MYERS, E.W. OSTERWEIL, L.J.* FLAT: A FORTRAN LANGUAGE AUGMENTATION TOOL.* COLORADO U. COMP.SCI.DEPT.* CU-CS-179-80.*1980. * 014508 MYERS, E.W.*A PRECISE AND EFFICIENT ALGORITHM FOR DETERMINISTIC EXISTENTIAL SUMMARY DATA FLOW INFORMATION.* COLORADO U. COMP.SCI.DEPT.*CU-CS-175-80.*1980. 014509 NAGEL, D.*SOME CONSIDERATIONS ON EXTRACTING DEFINITIONAL INFORMATION ABOUT RELATIONS.* RUTGERS U. COMP.SCI.DEPT.* CBM-TM-085.*1980, REVISED. 014510 NATIONAL SCIENCE FOUNDATION. MATH. & PHYSICAL SCIENCES DIRECTORATE. MATH. & COMP. SCIENCES DIV. COMP.SCI. SECTION.*COMPUTER SCIENCE SECTION: SUMMARY OF AWARDS. FISCAL YEAR 1980.* 014511 NEALE, P.T.*THE DEMOS MULTICOMPUTER RING: THE RING CLOSER.* U.K. NATIONAL PHYSICAL LAB. NUM.ANAL. & COMP.SCI.DIV.* DNACS 36/80.*1980. 014512 OSTERWEIL, L.J.* SOFTWARE ENVIRONMENT RESEARCH: DIRECTIONS FOR THE NEXT FIVE YEARS.* COLORADO U. COMP.SCI.DEPT.* CU-CS-195-80.*1980. 014513 OSTERWEIL, L.J.*A SOFTWARE LIFECYCLE METHODOLOGY AND TOOL SUPPORT.* COLORADO U. COMP.SCI.DEPT.*CU-CS-154-79.*1979. * 014514 OSTERWEIL, L.J.*A STRATEGY FOR EFFECTIVE INTEGRATION OF VERIFICATION AND TESTING TECHNIQUES.* COLORADO U. COMP.SCI.DEPT.*CU-CS-181-80.*1980. 014515 PAIGE, R. KOENIG, S.* FINITE DIFFERENCING OF COMPUTABLE EXPRESSIONS.* RUTGERS U. COMP.SCI.RES.LAB.*LCSR-TR-008.* 1980. 014516 RIDDLE, W.E.* SOFTWARE DEVELOPMENT ENVIRONMENTS.* COLORADO U. COMP.SCI.DEPT.*CU-CS-182-80.*1980. 014517 RIDDLE, W.E.* SOFTWARE DEVELOPMENT ENVIRONMENTS: A BIBLIOGRAPHY.* COLORADO U. COMP.SCI.DEPT.*CU-CS-184-80.* 1980. 014518 RIDDLE, W.E.* SOFTWARE DEVELOPMENT ENVIRONMENTS: PRESENT AND FUTURE.* COLORADO U. COMP.SCI.DEPT.*CU-CS-170-80.* 1980. 014519 RIDDLE, W.E.* SOFTWARE DEVELOPMENT TOOLS: A BIBLIOGRAPHY.* COLORADO U. COMP.SCI.DEPT.*CU-CS-183-80.*1980. 014520 RUSCHITZKA, M.* POLICY FUNCTION SCHEDULING.* RUTGERS U. COMP.SCI.DEPT.*DCS-TR-091.*1980. 014521 SCHMIDT, C.F.* PLAN RECOGNITION AND REVISION: UNDERSTANDING THE OBSERVED ACTIONS OF ANOTHER ACTOR.* RUTGERS U. COMP.SCI.RES.LAB.*CBM-TR-115.*1980. 014522 SCHMIDT, C.F.*THE ROLE OF OBJECT KNOWLEDGE IN HUMAN PLANNING.* RUTGERS U. COMP.SCI.DEPT.*CBM-TM-087.*1980. 014523 SCHNABEL, R.B.*DETERMINING FEASIBILITY OF A SET OF NONLINEAR INEQUALITY CONSTRAINTS.* COLORADO U. COMP.SCI.DEPT.*CU-CS-172-80.*1980. 014524 SMITH, L.D.*THE ELEMENTARY STRUCTURAL DESCRIPTION LANGUAGE.* EDINBURGH U. COMP.SCI.DEPT.*CSR-53-80.*1980. 014528 SRIDHARAN, N.S.*REPRESENTATIONAL FACILITIES OF AIMDS: A SAMPLING.* RUTGERS U. COMP.SCI.RES.LAB.*CBM-TM-086.*1980. 014529 SRIDHARAN, N.S. SCHMIDT, C.F. GOODSON, J.L.*THE ROLE OF WORLD KNOWLEDGE IN PLANNING.* RUTGERS U. COMP.SCI.RES.LAB.*CBM-TR-109.*1980. 014530 SRINIVASAN, C.V.* KNOWLEDGE BASED LEARNING, AN EXAMPLE.* RUTGERS U. COMP.SCI.DEPT.*DCS-TR-090.*1980. 014531 SRINIVASAN, C.V.* KNOWLEDGE BASED LEARNING SYSTEMS. PART 1: A PROPOSAL FOR RESEARCH, BY CHITOOR V. SRINIVASAN AND DAVID M. SANDFORD. PART II: AN INTRODUCTION TO THE META-THEORY, BY CHITOOR V. SRINIVASAN; PART III: LOGICAL FOUNDATION, BY CHITOOR V. SRINIVASAN.* RUTGERS U. COMP.SCI.DEPT.*DCS-TR-089.*1980. 014532 SYMM, G.T.*THE ROBIN PROBLEM FOR LAPLACE'S EQUATION.* U.K. NATIONAL PHYSICAL LAB. NUM.ANAL. & COMP.SCI.DIV.*DNACS 32/80.*1980. 014533 SZOLOVITS, P. MARTIN, W.A.* BRAND X MANUAL.* M.I.T. LAB. FOR COMP.SCI.*TM-186.*1980. * 014534 TRAUB, J.F. BIRNBAUM, J.S. HARTMANIS, J. REDDY, D.R. TAYLOR, R.W. VYSSOTSKY, V.A.*QUO VADIMUS: COMPUTER SCIENCE IN A DECADE. PANEL ORGANIZER AND MODERATOR: J.F. TRAUB; PANELISTS: J.S. BIRNBAUM, J. HARTMANIS, D.R. REDDY, R.W. TAYLOR, V.A. VYSSOTSKY.* CARNEGIE MELLON U. COMP.SCI.DEPT.*CMU-CS-80-127.*1980. * 014536 VALIANT, L.G.* UNIVERSALITY CONSIDERATIONS IN VLSI CIRCUITS.* EDINBURGH U. COMP.SCI.DEPT.*CSR-54-80.*1980. 014537 YASUHARA, A. HAWRUSIK, F. VENKATARAMAN, K.N.* COMPUTABILITY ON BINARY TREES - AN EXTENDED ABSTRACT.* RUTGERS U. COMP.SCI.RES.LAB.*CTA-TR-002.*1980. 014538 YASUHARA, A.* COMPUTABILITY ON TERM ALGEBRAS. PART II - MULTISUCCESSOR: THE REPRESENTABILITY OF COMPUTABILITY ON STRINGS.* RUTGERS U. COMP.SCI.RES.LAB.*CTA-TR-001.*1980. VOL. 3, NO. 6, 06/01/81 014956 ABBOTT, V. BLACK, J.B.*THE REPRESENTATION OF SCRIPTS IN MEMORY.* YALE U. COGNITIVE SCIENCE PROGRAM.*TECH.RPT. 005.*1980. 014957 ABELSON, R.P.*DIFFERENCES BETWEEN BELIEF AND KNOWLEDGE SYSTEMS.* YALE U. COGNITIVE SCIENCE PROGRAM.*TECH.RPT. 001.*1980. 014958 ABELSON, R.P.*IN DEFENSE OF COMMON SENSE REPRESENTATIONS OF KNOWLEDGE.* YALE U. COGNITIVE SCIENCE PROGRAM.*TECH.RPT. 006.*1980. 014959 ABELSON, R.P.*THE PSYCHOLOGICAL STATUS OF THE SCRIPT CONCEPT.* YALE U. COGNITIVE SCIENCE PROGRAM.*TECH.RPT. 002.*1980. 014960 ALELIUNAS, R. ROSENBERG, A.L.*ON EMBEDDING RECTANGULAR GRIDS IN SQUARE GRIDS.* IBM WATSON RES. CENTER.*RC 8404.* 1980. 014961 BARNES, E.R. HOFFMAN, A.J.*ON BOUNDS FOR EIGENVALUES OF REAL SYMMETRIC MATRICES.* IBM WATSON RES. CENTER.*RC 8441.*1980. * 014962 BARSTOW, D.R.*THE ROLES OF KNOWLEDGE AND DEDUCTION IN ALGORITHM CREATION.* YALE U. COMP.SCI.DEPT.*RES.RPT. 178.* 1980. * 014963 BARZILAI, Z. SAVIR, J. MARKOWSKY, G. SMITH, M.G.*THE WEIGHTED SYNDROME SUMS APPROACH TO VLSI TESTING.* IBM WATSON RES. CENTER.*RC 8475.*1980. 014964 BELADY, L.A.* MODIFIABILITY OF LARGE SOFTWARE SYSTEMS.* IBM WATSON RES. CENTER.*RC 8525.*1980. 014965 BHAT, K.V.S.*A GRAPH THEORETIC APPROACH TO SWITCHING FUNCTION MINIMIZATION.* IOWA U. COMP.SCI.DEPT.*TECH.RPT. 81-02.*1981. 014966 BLACK, J.B. BERN, H.* CAUSAL COHERENCE AND MEMORY FOR EVENTS IN NARRATIVES.* YALE U. COGNITIVE SCIENCE PROGRAM.*TECH.RPT. 003.*1980. 014967 BLACK, J.B.*THE EFFECTS OF READING PURPOSE ON MEMORY FOR TEXT.* YALE U. COGNITIVE SCIENCE PROGRAM.*TECH.RPT. 007.* 1980. 014968 BLACK, J.B.* PSYCHOLINGUISTIC PROCESSES IN WRITING.* YALE U. COGNITIVE SCIENCE PROGRAM.*TECH.RPT. 004.*1980. 014969 BONGIOVANNI, G. TANG, D.T. WONG, C.K.*A GENERAL MULTIBEAM SWITCHING ALGORITHM.* IBM WATSON RES. CENTER.*RC 8541.* 1980. 014970 BRINCH HANSEN, P.*THE PROGRAMMING LANGUAGE EDISON.* SOUTHERN CAL U. COMP.SCI.DEPT.*1980. 014971 BRUIJN, H.G. DE*A SURVEY OF THE PROJECT AUTOMATH.* NO ISSUING AGENCY INDICATED (AUTHOR'S ADDRESS: DEPARTMENT OF MATHEMATICS/EINDHOVEN UNIVERSITY OF TECHNOLOGY/P.O. BOX 513/5600MB EINDHOVEN/THE NETHERLANDS).*N.D. 014972 BURKS, A.W.*THE ENIAC: FIRST GENERAL-PURPOSE ELECTRONIC COMPUTER.* MICHIGAN U. LOGIC OF COMPUTERS GROUP.* TECH.RPT. 236.*1981. 014973 CHAITIN, G.J. AUSLANDER, M.A. CHANDRA, A.K. COCKE, J. HOPKINS, M.E. MARKSTEIN, P.W.* REGISTER ALLOCATION VIA COLORING.* IBM WATSON RES. CENTER.*RC 8395.*1980. 014974 CHANDRA, A.K. HAREL, D.*STRUCTURE AND COMPLEXITY OF RELATIONAL QUERIES.* IBM WATSON RES. CENTER.*RC 8418.* 1980. 014975 CHATELIN, F. MIRANKER, W.L.* ACCELERATION BY AGGREGATION OF SUCCESSIVE APPROXIMATION METHODS.* IBM WATSON RES. CENTER.*RC 8508.*1980. 014976 CHAZELLE, B.M.* COMPUTATIONAL GEOMETRY AND CONVEXITY. CARNEGIE MELLON U. COMP.SCI.DEPT.*CMU-CS-80-150, PH.D. THESIS. CHAZELLE, B.M.*1980. 014977 CIEPIELEWSKI, A. JUNGEFELDT, T. LINNELL, J.*CONNECTING A MINICOMPUTER TO AN X.25 NETWORK - A CASE STUDY.* ROYAL INST. OF TECH., STOCKHOLM. TELECOMM. & COMP. SYSTEMS DEPT.*TRITA-CS-8101.*1981. 014978 COLBOURN, C.J.*THE CONSTRUCTION OF DISJOINT CYCLIC STEINER TRIPLE SYSTEMS (TWO PAPERS): DISJOINT CYCLIC STEINER TRIPLE SYSTEMS.* SASKATCHEWAN U. COMPUTATIONAL SCI.DEPT.* RPT. 81-04.*1981. 014979 COLLIER, W.W.*PRINCIPLES OF ARCHITECTURE FOR SYSTEMS OF PARALLEL PROCESSES.* IBM. POUGHKEEPSIE LAB.*TR 00.3100.* 1981. 014980 DAHLQUIST, G.G. LINIGER, W. NEVANLINNA, O.* STABILITY OF TWO-STEP METHODS FOR VARIABLE INTEGRATION STEPS.* IBM WATSON RES. CENTER.*RC 8494.*1980. 014981 DAHMEN, W.* APPROXIMATION BY LINEAR COMBINATIONS OF MULTIVARIATE B SPLINES.* IBM WATSON RES. CENTER.*RC 8405.* 1980. 014982 DAHMEN, W. MICCHELLI, C.A.*ON LIMITS OF MULTIVARIATE B SPLINES.* IBM WATSON RES. CENTER.*RC 8495.*1980. 014983 DANTZIG, G.B.*EXPECTED NUMBER OF STEPS OF THE SIMPLEX METHOD FOR A LINEAR PROGRAM WITH A CONVEXITY CONSTRAINT.* ST. U. O.R. DEPT. SYSTEMS OPTIMIZATION LAB.*SOL 80-03R.* 1980, REVISED. 014984 DAVENPORT, J.H. JENKS, R.D.* MODLISP.* IBM WATSON RES. CENTER.*RC 8537.*1980. 014985 DE JONG, S.P. BYRD, R.J.*INTELLIGENT FORMS CREATION IN THE SYSTEM FOR BUSINESS AUTOMATION ( SBA).* IBM WATSON RES. CENTER.*RC 8529.*1980. 024846 DOLEV, D.*THE BYZANTINE GENERALS STRIKE AGAIN.* ST. U. COMP.SCI.DEPT.*T.R.-C.S. 846.*1981. 014986 DUERINCKX, A.J.* MATCHED GAUSSIAN APODIZATION OF PULSED ACOUSTIC PHASED ARRAYS.* IBM WATSON RES. CENTER.*RC 8463.*1980. 014987 DYER, M.G. LEHNERT, W.G.* MEMORY ORGANIZATION AND SEARCH PROCESSES FOR NARRATIVES.* YALE U. COMP.SCI.DEPT.* RES.RPT. 175.*1980. 014988 ENOMOTO, H.*A GENERALIZATION OF ORE'S CONDITION FOR A GRAPH TO BE HAMILTON CONNECTED.* TOKYO U. INFO.SCI.DEPT.* TECH.RPT. 80-07.*1980. 014989 ENOMOTO, H.*LONG PATHS AND LARGE CYCLES IN FINITE GRAPHS.* TOKYO U. INFO.SCI.DEPT.*TECH.RPT. 80-15.*1980. 014990 ENOMOTO, H. USAMI, Y.*MINIMUM NUMBER OF EDGES IN PATH CONNECTED GRAPHS. I.* TOKYO U. INFO.SCI.DEPT.*TECH.RPT. 80-02.*1980. 014991 FARIS, S.M.* JOSEPHSON LSI CIRCUITS.* IBM WATSON RES. CENTER.*RC 8467.*1980. 014992 FORD, R.F.*DESIGN OF ABSTRACT DATA STRUCTURES TO FACILITATE STORAGE STRUCTURE SELECTION.* IOWA U. COMP.SCI.DEPT.* TECH.RPT. 81-01, PH.D. THESIS. FORD, R.F. (UNIVERSITY OF PITTSBURGH).*1981. 014993 FORTUNE, S. LEIVANT, D. O'DONNELL, M.*THE EXPRESSIVENESS OF SIMPLE AND SECOND ORDER TYPE STRUCTURES.* IBM WATSON RES. CENTER.*RC 8542.*1980. 014994 GOLDSTEIN, B.C.* AMBLE: A MULTI-PROGRAMMING LANGUAGE EXTENSION.* IBM WATSON RES. CENTER.*RC 8417.*1980. 014995 GOODMAN, J.R. SEQUIN, C.H.* HYPERTREE, A MULTIPROCESSOR INTERCONNECTION TOPOLOGY.* WISCONSIN U. COMP.SCI.DEPT.* TECH.RPT. 427.*1981. 014996 GOTO, E.*INTEGRATION OF MULTIVARIATE RATIONALS IN POLYHEDRA BY NUMERICAL ANALYTIC CONTINUATION.* TOKYO U. INFO.SCI.DEPT.*TECH.RPT. 80-17.*1980. 014997 GOULD, J.D.* COMPOSING LETTERS WITH COMPUTER-BASED TEXT EDITORS.* IBM WATSON RES. CENTER.*RC 8446.*1980. 014998 GROBMAN, W.D.*STATUS OF X-RAY LITHOGRAPHY.* IBM WATSON RES. CENTER.*RC 8480.*1980. 014999 GUZMAN, M.E.*A QUEUEING MODEL FOR BUFFER ANALYSIS OF AUTOMATIC REPEAT REQUEST CONCENTRATORS.* ROYAL INST. OF TECH., STOCKHOLM. TELECOMM. & COMP. SYSTEMS DEPT.* TRITA-CS-8101.*1980. 015000 HANSSON, A. HARIDI, S. TAERNLUND, S.-A.*A PROGRAMMING LANGUAGE BASED ON A NATURAL DEDUCTION SYSTEM.* ROYAL INST. OF TECH., STOCKHOLM. TELECOMM. & COMP. SYSTEMS DEPT.*TRITA-CS-8005.*1980. 015001 HARADA, M. KUNII, T.L. KITAGAWA, H. KAIHARA, S. OHBO, N.*A GRAPHICAL DESIGN SPECIFICATION LANGUAGE FOR A HOSPITAL ADMINISTRATION SYSTEM GDSL/HA - WITH THE APPLICATION TO DESIGN CONSISTENCY VERIFICATION.* TOKYO U. INFO.SCI.DEPT.*TECH.RPT. 80-04.*1980. 015002 HARBISON, S.P.*A COMPUTER ARCHITECTURE FOR THE DYNAMIC OPTIMIZATION OF HIGH-LEVEL LANGUAGE PROGRAMS.* CARNEGIE MELLON U. COMP.SCI.DEPT.*CMU-CS-80-143, PH.D. THESIS. HARBISON, S.P.*1980. 015003 HIKITA, T. KAWAI, S.*PARALLEL SIEVE METHODS FOR GENERATING PRIME NUMBERS.* TOKYO U. INFO.SCI.DEPT.*TECH.RPT. 80-06.* 1980. 015004 HIRAGA, Y. ONO, Y. YAMADA, H.*AN ANALYSIS OF THE STANDARD ENGLISH KEYBOARD.* TOKYO U. INFO.SCI.DEPT.*TECH.RPT. 80-11.*1980. 015005 HIRAGA, Y. ONO, Y. YAMADA, H.*AN ASSIGNMENT OF KEY-CODES FOR A JAPANESE CHARACTER KEYBOARD.* TOKYO U. INFO.SCI.DEPT.*TECH.RPT. 80-12.*1980. 015006 HONG, J.-W. ROSENBERG, A.L.*GRAPHS THAT ARE SIMILAR TO BINARY TREES.* IBM WATSON RES. CENTER.*RC 8402.*1980. 015007 HU, J.K.-C.* LOGIC DESIGN METHODS FOR IRREDUNDANT MOS NETWORKS.* ILLINOIS U. COMP.SCI.DEPT.*UIUCDCS-R-80-1053, PH.D. THESIS. HU, J.K.-C.*1980. 015008 INGEMARSSON, I.* KNAPSACKS WHICH ARE NOT PARTLY SOLVABLE AFTER MULTIPLICATION MODULO Q.* IBM WATSON RES. CENTER.* RC 8515.*1980. 015009 INTERNATIONAL CONFERENCE ON RESEARCH AND TRENDS IN DOCUMENT PREPARATION SYSTEMS, LAUSANNE, SWITZERLAND, 1981.* ABSTRACTS OF THE PRESENTED PAPERS: INTERNATIONAL CONFERENCE..., FEBRUARY 27-28, 1981. J.D. NICOUD, PROGRAM CHAIRMAN. ORGANIZED BY THE SWISS INSTITUTES OF TECHNOLOGY (LAUSANNE & ZURICH). 015010 JAFFE, J.M. MOSS, F.H.*A RESPONSIVE DISTRIBUTED ROUTING ALGORITHM FOR COMPUTER NETWORKS.* IBM WATSON RES. CENTER.*RC 8479.*1980. 015011 JEGADO, M.* RECOVERABILITY ASPECTS OF A DISTRIBUTED FILE SYSTEM.* NEWCASTLE UPON TYNE U. COMPUTING LAB.*NO. 160.* 1981. 015012 JIMENEZ, A. RUDD, D.F. MEYER, R.R.*A STUDY OF THE DEVELOPMENT OF A MEXICAN PETROCHEMICAL INDUSTRY USING MIXED INTEGER PROGRAMMING.* WISCONSIN U. COMP.SCI.DEPT.* TECH.RPT. 420.*1981. 015013 JINN-KE, J. YAMADA, H.*A CODING SYSTEM OF CHINESE CHARACTERS FOR TOUCH TYPING (A SUMMARY VERSION).* TOKYO U. INFO.SCI.DEPT.*TECH.RPT. 80-14.*1980. 015014 JINN-KE, J. YAMADA, H.*A CODING SYSTEM OF CHINESE CHARACTERS FOR TOUCH TYPING.* TOKYO U. INFO.SCI.DEPT.* TECH.RPT. 80-09.*1980. 015015 JOHNSON, E.L. PADBERG, M.W.*A NOTE ON THE KNAPSACK PROBLEM WITH SPECIAL ORDERED SETS.* IBM WATSON RES. CENTER.*RC 8396.*1980. 015016 JOHNSON, O. RAMANATHAN, J.*RECENT DIRECTIONS IN CONCURRENT PROGRAMMING LANGUAGES.* IBM WATSON RES. CENTER.*RC 8378.*1980. 015017 JOHNSON, R. SHORE, J.* MINIMUM CROSS ENTROPY SPECTRAL ANALYSIS OF MULTIPLE SIGNALS.* U.S. NAVAL RES.LAB.*NRL MEMO.RPT. 4492.*1981. 015018 KAMEL, M.S.*IMPROVING THE EFFICIENCY OF STIFF ODE SOLVERS BY PARTITIONING.* TORONTO U. COMP.SCI.DEPT.*TECH.RPT. 149, PH.D. THESIS. KAMEL, M.S.*1981. 015019 KEAST, P. FAIRWEATHER, G. DIAZ, J.C.*A COMPARATIVE STUDY OF FINITE ELEMENT METHODS FOR THE SOLUTION OF SECOND ORDER LINEAR TWO POINT BOUNDARY VALUE PROBLEMS.* TORONTO U. COMP.SCI.DEPT.*TECH.RPT. 150.*1981. 020255 KENT, S.T.* PROTECTING EXTERNALLY SUPPLIED SOFTWARE IN SMALL COMPUTERS.* M.I.T. LAB. FOR COMP.SCI.*TR-255, PH.D. THESIS. KENT, S.T.*1980. 015020 KERMANI, P.*A CONGESTION CONTROL SCHEME FOR WINDOW FLOW CONTROLLED COMPUTER NETWORKS.* IBM WATSON RES. CENTER.* RC 8401.*1980. 015021 KITAGAWA, H. KUNII, T.L. HARADA, M. KAIHARA, S. OHBO, N.*A LANGUAGE FOR OFFICE FORM PROCESSING ( OFP) - WITH APPLICATION TO MEDICAL FORMS.* TOKYO U. INFO.SCI.DEPT.* TECH.RPT. 80-03.*1980. 015022 KITAGAWA, H. KUNII, T.L. AZUMA, M. MIZUNO, Y.*USER- AND ADMINISTRATOR- FRIENDLY ARCHITECTURE FOR INTERACTIVE SOFTWARE DEVELOPMENT.* TOKYO U. INFO.SCI.DEPT.*TECH.RPT. 80-25.*1980. 024841 KNUTH, D.E.* HUFFMAN'S ALGORITHM VIA ALGEBRA.* ST. U. COMP.SCI.DEPT.*T.R.-C.S. 841.*1981. 015023 KOLODNER, J.L.*RETRIEVAL AND ORGANIZATIONAL STRATEGIES IN CONCEPTUAL MEMORY: A COMPUTER MODEL.* YALE U. COMP.SCI.DEPT.*RES.RPT. 187, PH.D. THESIS. KOLODNER, J.L.* 1980. 015024 KONHEIM, A.G. MEILIJSON, I.* GREED IS GOOD.* IBM WATSON RES. CENTER.*RC 8505.*1980. 015025 KONHEIM, A.G. MEILIJSON, I. MELKMAN, A.*PROCESSOR-SHARING OF TWO PARALLEL LINES.* IBM WATSON RES. CENTER.*RC 8452.* 1980. 024847 KORTH, H.F.*THE OPTIMAL LOCKING PROBLEM IN A DIRECTED ACYCLIC GRAPH.* ST. U. COMP.SCI.DEPT.*T.R.-C.S. 847.* 1981. 015026 KOZEN, D.*ON INDUCTION VS. *-CONTINUITY.* IBM WATSON RES. CENTER.*RC 8468.*1980. 015027 KUNG, H.T. PAPADIMITRIOU, C.H.*AN OPTIMALITY THEORY OF CONCURRENCY CONTROL FOR DATABASES.* CARNEGIE MELLON U. COMP.SCI.DEPT.*CMU-CS-80-147.*1979. 015028 LAVENBERG, S.S.* CLOSED MULTICHAIN PRODUCT FORM QUEUEING NETWORKS WITH LARGE POPULATION SIZES.* IBM WATSON RES. CENTER.*RC 8496.*1980. 015029 LEAVENWORTH, B.*AN INTEGRATED DATABASE PROGRAMMING LANGUAGE.* IBM WATSON RES. CENTER.*RC 8462.*1980. 015030 LEBOWITZ, M.* GENERALIZATION AND MEMORY OF AN INTEGRATED UNDERSTANDING SYSTEM.* YALE U. COMP.SCI.DEPT.*RES.RPT. 186, PH.D. THESIS. LEBOWITZ, M.*1980. 015031 LEE, D.T. CHANG, H. WONG, C.K.*AN ON-CHIP COMPARE/STEER BUBBLE SORTER.* IBM WATSON RES. CENTER.*RC 8414.*1980. 015032 LEHNERT, W.G. BAIN, W.M.* VEGE: VARIABLE PROCESSING IN A NATURAL LANGUAGE QUERY SYSTEM.* YALE U. COMP.SCI.DEPT.* RES.RPT. 183.*1980. 015033 MCDERMOTT, D.*NON-MONOTONIC LOGIC II: NON-MONOTONIC MODAL THEORIES.* YALE U. COMP.SCI.DEPT.*RES.RPT. 174.*1980. 015034 MCDERMOTT, D.* SPATIAL INFERENCES WITH GROUND, METRIC FORMULAS ON SIMPLE OBJECTS.* YALE U. COMP.SCI.DEPT.* RES.RPT. 173.*1980. 015035 MAEKAWA, M.*EVALUATION AND COMPARISON OF PROCESS COORDINATION MECHANISMS.* TOKYO U. INFO.SCI.DEPT.* TECH.RPT. 80-23.*1980. 015036 MALHOTRA, A. MARKOWITZ, H.M. PAZEL, D.P.* EAS-E: AN INTEGRATED APPROACH TO APPLICATION DEVELOPMENT.* IBM WATSON RES. CENTER.*RC 8457.*1980. 015037 MARKOWSKY, G.*BEST HUFFMAN TREES.* IBM WATSON RES. CENTER.* RC 8526.*1980. 015038 MARKSTEIN, V. COCKE, J. MARKSTEIN, P.*OPTIMIZATION OF RANGE CHECKING.* IBM WATSON RES. CENTER.*RC 8456.*1980. 015039 MARUYAMA, K. TANG, D.T.*ON THE SELECTION OF OPTIMAL PATHS WHICH SATISFY ADDITIONAL CONSTRAINTS.* IBM WATSON RES. CENTER.*RC 8458.*1980. 015040 MEKETON, M.S. HEIDELBERGER, P.* BIAS REDUCTION IN REGENERATIVE SIMULATIONS.* IBM WATSON RES. CENTER.*RC 8397.*1980. 015041 MIKELSONS, M. WEGMAN, M.N.* PDE1L: THE PL1L PROGRAM DEVELOPMENT ENVIRONMENT. PRINCIPLES OF OPERATION.* IBM WATSON RES. CENTER.*RC 8513.*1980. 015042 NELSON, T.H.* LITERACY MACHINES: THE REPORT ON, AND OF, PROJECT XANADU CONCERNING WORD PROCESSING, ELECTRONIC PUBLISHING, HYPERTEXT, THINKERTOYS, TOMORROW'S INTELLECTUAL REVOLUTION, AND CERTAIN OTHER TOPICS INCLUDING KNOWLEDGE, EDUCATION AND FREEDOM.*TED NELSON, PUBLISHER (P.O. BOX 128/SWARTHMORE, PA. 19081).*1981. 015043 NEWELL, A.* DUNCKER ON THINKING: AN INQUIRY INTO PROGRESS IN COGNITION.* CARNEGIE MELLON U. COMP.SCI.DEPT.* CMU-CS-80-151.*1981. 015044 NEWELL, A. ROSENBLOOM, P.S.*MECHANISMS OF SKILL ACQUISITION AND THE LAW OF PRACTICE.* CARNEGIE MELLON U. COMP.SCI.DEPT.*CMU-CS-80-145.*1980. 015045 NEWMAN, D.J. RIVLIN, T.J.*OPTIMAL RECOVERY AMONG THE POLYNOMIALS.* IBM WATSON RES. CENTER.*RC 8433.*1980. 024849 NISHIGAKI, T.*EXPERIMENTS ON THE KNEE CRITERION IN A MULTIPROGRAMMED COMPUTER SYSTEM.* ST. U. COMP.SCI.DEPT.* T.R.-C.S. 849.*1981. 015046 ONO, K. SUZUKI, M. GOTO, E.*COMPILE TIME IMPROVEMENT OF GARBAGE COLLECTION.* TOKYO U. INFO.SCI.DEPT.*TECH.RPT. 80-08.*1980. 015047 PAN, V.Y.*APPROXIMATION TO THE SOLUTION OF A SYSTEM OF LINEAR EQUATIONS VIA APPROXIMATION TO A BISECTOR.* IBM WATSON RES. CENTER.*RC 8492.*1980. 015048 PAN, V.Y.* PROJECTIONS O APPROXIMATIONS IN LINEAR ALGEBRA (IN DETERMINISTIC AND PROBABILISTIC APPROACHES).* IBM WATSON RES. CENTER.*RC 8491.*1980. 015049 PENEDO, M.H.*THE USE OF A MODULE INTERFACE DESCRIPTION IN THE SYNTHESIS OF RELIABLE SOFTWARE SYSTEMS.* CAL U., L.A. ENG. & APPL.SCI.SCH. COMP.SCI.DEPT.*UCLA-ENG-8091; CSD-810115, PH.D. THESIS. PENEDO, M.H.*1981. 015050 REID, L.G.* CONTROL AND COMMUNICATION IN PROGRAMMED SYSTEMS.* CARNEGIE MELLON U. COMP.SCI.DEPT.* CMU-CS-80-142, PH.D. THESIS. REID, L.G.*1980. 015051 ROHLF, F.J. SOKAL, R.R.*COMPARING NUMERICAL TAXONOMIC STUDIES.* IBM WATSON RES. CENTER.*RC 8535.*1980. 015052 ROSEN, B.K.*A LUBRICANT FOR DATA FLOW ANALYSIS.* IBM WATSON RES. CENTER.*RC 8481.*1980. 015053 ROSENBERG, A.L.* BANDWIDTH AND PEBBLING.* IBM WATSON RES. CENTER.*RC 8477.*1980. 015054 ROSENBERG, A.L.*ISSUES IN THE STUDY OF GRAPH EMBEDDINGS.* IBM WATSON RES. CENTER.*RC 8403.*1980. 015055 ROSENBERG, A.L. SNYDER, L.*PERFECT STORAGE REPRESENTATIONS FOR FAMILIES OF DATA STRUCTURES.* IBM WATSON RES. CENTER.*RC 8518.*1980. * 015056 ROTH, J.P.* RELIABLE VLSI SYSTEMS: DESIGN AND VALIDATION.* IBM WATSON RES. CENTER.*RC 8524.*1980. 015057 ROTH, M.G.* DIFFERENCE METHODS FOR STIFF DELAY DIFFERENTIAL EQUATIONS.* ILLINOIS U. COMP.SCI.DEPT.* UIUCDCS-R-80-1012, PH.D. THESIS. ROTH, M.G.*1980. 015058 RUBINSTEIN, R.*GENERATING RANDOM VECTORS UNIFORMLY DISTRIBUTED INSIDE AND ON THE SURFACE OF DIFFERENT REGIONS.* IBM WATSON RES. CENTER.*RC 8409.*1980. 024839 SAMUEL, A.L.* SHORT WAITS.* ST. U. COMP.SCI.DEPT.*T.R.-C.S. 839.*1981. 015059 SATO, M.*THEORY OF SYMBOLIC EXPRESSIONS.* TOKYO U. INFO.SCI.DEPT.*TECH.RPT. 80-16.*1980. 015060 SCHANK, R.C.*LEBOWITZ, M.*DOES A HIPPIE OWN A HAIRDRIER?* YALE U. COMP.SCI.DEPT.*RES.RPT. 144.*1979. 015061 SCHANK, R.C. BIRNBAUM, L.*MEMORY, MEANING, AND SYNTAX.* YALE U. COMP.SCI.DEPT.*RES.RPT. 189.*1980. 015062 SCHANK, R.C.* REMINDING AND MEMORY ORGANIZATION: AN INTRODUCTION TO MOPS.* YALE U. COMP.SCI.DEPT.*RES.RPT. 170.*1979. 015063 SCHILD, W. POWER, L.R. KARNAUGH, M.* PICTUREWORLD: A CONCEPT FOR FUTURE OFFICE SYSTEMS.* IBM WATSON RES. CENTER.*RC 8384.*1980. 015064 SCHWARTZ, M.* PERFORMANCE ANALYSIS OF THE SNA VIRTUAL ROUTE PACING CONTROL.* IBM WATSON RES. CENTER.*RC 8490.*1980. 015065 SELFRIDGE, M.G.R.*A PROCESS MODEL OF LANGUAGE ACQUISITION.* YALE U. COMP.SCI.DEPT.*RES.RPT. 172, PH.D. THESIS. SELFRIDGE, M.G.R.*1980. 015066 SNODGRASS, R.*AN OBJECT ORIENTED COMMAND LANGUAGE.* CARNEGIE MELLON U. COMP.SCI.DEPT.*CMU-CS-80-146.*1980. 015067 SUNSHINE, C.A.*FORMAL MODELING OF COMMUNICATION PROTOCOLS.* SOUTHERN CAL U. INFO.SCI.INST.*ISI/RR-81-89.*1981. 015068 SUZUKI, M. ONO, K. GOTO, E.*A PRIMITIVE FOR NON-RECURSIVE LIST PROCESSING.* TOKYO U. INFO.SCI.DEPT.*TECH.RPT. 80-26.*1980. 024848 TANG, C.-S.*ON THE PROBLEM OF INPUTTING CHINESE CHARACTERS.* ST. U. COMP.SCI.DEPT.*T.R.-C.S. 848.*1981. 015069 TANG, D.T. MARUYAMA, K.*ON CRITERIA AND GENERATION OF OPTIMAL PATHS.* IBM WATSON RES. CENTER.*RC 8411.*1980. 015070 THORELLI, L.-E. CIEPIELEWSKI, A.*A COURSE IN SYSTEMS PROGRAMMING.* ROYAL INST. OF TECH., STOCKHOLM. TELECOMM. & COMP. SYSTEMS DEPT.*TRITA-CS-80058.*1980. 015071 TOUEG, S.*A MINIMUM HOP PATH FAILSAFE AND LOOP-FREE DISTRIBUTED ALGORITHM.* IBM WATSON RES. CENTER.*RC 8530.* 1980. 015072 TREDENNICK, N.*HOW TO DO FLOWCHARTS FOR A CONTROLLER.* IBM WATSON RES. CENTER.*RC 8426.*1980. 015073 UHR, L.* NETWORK AND ARRAY ARCHITECTURES FOR REAL-TIME PERCEPTION.* WISCONSIN U. COMP.SCI.DEPT.*TECH.RPT. 424.* 1981. 015074 WHITEBREAD, K.*THE RELATION BETWEEN CONVENTIONAL INFERENCE AND SOME APPROACHES TO DEFAULT REASONING.* WISCONSIN U. COMP.SCI.DEPT.*TECH.RPT. 422.*1981. 015075 WHITFIELD, H.*THE CHALLENGE OF THE CHIP.* NEWCASTLE UPON TYNE U. COMPUTING LAB.*NO. 159.*1981. 015076 WULF, W.A.* PQCC: A MACHINE RELATIVE COMPILER TECHNOLOGY.* CARNEGIE MELLON U. COMP.SCI.DEPT.*CMU-CS-80-144.*1980. 015077 YAMAGUCHI, K. OHBO, N. KUNII, T.L. KITAGAWA, H.*HARADA, M.* ELF: EXTENDED RELATIONAL MODEL FOR LARGE, FLEXIBLE PICTURE DATABASES.* TOKYO U. INFO.SCI.DEPT.*TECH.RPT. 80-10.*1980. 015078 YEMINI, S.*THE REPLACEMENT MODEL FOR MODULAR, VERIFIABLE EXCEPTION HANDLING.* CAL U., L.A. ENG. & APPL.SCI.SCH. COMP.SCI.DEPT.*UCLA-ENG-8200; CSD-810204, PH.D. THESIS. YEMINI, S.*1981. 015079 YU, P.S. LIN, S.*AN EFFICIENT SELECTIVE-REPEAT ARQ SCHEME FOR SATELLITE CHANNELS AND ITS THROUGHPUT ANALYSIS.* IBM WATSON RES. CENTER.*RC 8399.*1980. 015871 HOFRI, M.*ON THE NUMBER OF BINS REQUIRED TO PACK N PIECES USING THE NEXT-FIT ALGORITHM.* TECHNION - ISRAEL INST. OF TECH. COMP.SCI.DEPT.*TECH.RPT. 203.*1981, REVISED. 015881 MACEWEN, G.H.*THE DESIGN FOR A SECURE SYSTEM BASED ON PROGRAM ANALYSIS.* QUEEN'S U. COMPUTING & INFO.SCI.DEPT.* TECH.RPT. 81-118.*1981. 015883 MARINOV, V.* RESOLUTION THEOREM PROVER IN A PROGRAM VERIFICATION ENVIRONMENT.* OSLO U. INFORMATICS INST.* RES.RPT. 055.*1981. 041603 MINSKY, M.* JOKES AND THE LOGIC OF THE COGNITIVE UNCONSCIOUS.* M.I.T. A.I. LAB.*MEMO 603.*1980. 015888 OVERMAN, W.T.* VERIFICATION OF CONCURRENT SYSTEMS: FUNCTION AND TIMING.* CAL U., L.A. ENG. & APPL.SCI.SCH.* UCLA-ENG-8120; CAL U., L.A. COMP.SCI.DEPT.*CSD-810814, PH.D. THESIS. OVERMAN, W.T.*1981. 015889 RISHE, N.*ON FORMAL SEMANTICS OF DATA BASES.* TECHNION - ISRAEL INST. OF TECH. COMP.SCI.DEPT.*TECH.RPT. 198.*1981. 015895 SEROUSSI, G. LEMPEL, A.*ON SYMMETRIC REPRESENTATIONS OF FINITE FIELDS.* TECHNION - ISRAEL INST. OF TECH. COMP.SCI.DEPT.*TECH.RPT 206.*1981. 015896 SHILOACH, Y. VISHKIN, U.*AN EFFICIENT PARALLEL MAX FLOW ALGORITHM.* TECHNION - ISRAEL INST. OF TECH. COMP.SCI.DEPT.*TECH.RPT. 196.*1981. 015898 SOUNDARARAJAN, N.* AXIOMATIC SEMANTICS OF COMMUNICATING SEQUENTIAL PROCESSES.* OSLO U. INFORMATICS INST.*RES.RPT. 056.*1981. 015899 SOUNDARARAJAN, N.* CONSISTENCY AND COMPLETENESS OF A PROOF SYSTEM FOR CSP.* OSLO U. INFORMATICS INST.*RES.RPT. 058.* 1981. 015901 SOUNDARARAJAN, N.* PROOFS OF CORRECTNESS OF CSP PROGRAMS.* OSLO U. INFORMATICS INST.*RES.RPT. 059.*1981. 015908 WINKOWSKI, J.*TOWARDS AN ALGEBRAIC DESCRIPTION OF DISCRETE PROCESSES AND SYSTEMS.* POLISH ACADEMY OF SCIENCES. INST. OF COMP.SCI.*ICS PAS RPT. NO. 408.*1980. 015912 ARVIND. THOMAS, R.E.* I-STRUCTURES: AN EFFICIENT DATA TYPE FOR FUNCTIONAL LANGUAGES.* M.I.T. LAB. FOR COMP.SCI.* TM-210.*1981, REVISED. 015915 BAWDEN, A. BURKE, G.S. HOFFMAN, C.W.* MACLISP EXTENSIONS.* M.I.T. LAB. FOR COMP.SCI.*TM-203.*1981. 015925 COSMADAKIS, S.S. PAPADIMITRIOU, C.H.*THE TRAVELING SALESMAN PROBLEM WITH MANY VISITS TO FEW CITIES.* M.I.T. LAB. FOR COMP.SCI.*TM-208.*1981. 015930 FREDKIN, E. TOFFOLI, T.* CONSERVATIVE LOGIC.* M.I.T. LAB. FOR COMP.SCI.*TM-197.*1981. 015938 HALPERN, J.Y.*ON THE EXPRESSIVE POWER OF DYNAMIC LOGIC, II.* M.I.T. LAB. FOR COMP.SCI.*TM-204.*1981. 015939 HALPERN, J.Y. REIF, J.H.*THE PROPOSITIONAL DYNAMIC LOGIC OF DETERMINISTIC, WELL-STRUCTURED PROGRAMS.* M.I.T. LAB. FOR COMP.SCI.*TM-198.*1981. 015943 JOHNSON, D. PAPADIMITRIOU, C.*COMPUTATIONAL COMPLEXITY AND THE TRAVELING SALESMAN PROBLEM.* M.I.T. LAB. FOR COMP.SCI.*TM-209.*1981. 015964 MINTZER, F. DAVIES, K. PELED, A. RIS, F.*THE REAL TIME SIGNAL PROCESSOR.* IBM WATSON RES. CENTER.*RC 9081.*1981. 015969 OPPEN, D.C. DALAL, V.K.*THE CLEARINGHOUSE: A DECENTRALIZED AGENT FOR LOCATING NAMED OBJECTS IN A DISTRIBUTED ENVIRONMENT.* XEROX. PALO ALTO RES. CENTER. OFFICE PRODUCTS DIV.*OPD-T8103.*1981. 015979 SALTZER, J.H.* COMMUNICATION RING INITIALIZATION WITHOUT CENTRAL CONTROL.* M.I.T. LAB. FOR COMP.SCI.*TM-202.* 1981. 020263 STREETT, R.S.* PROPOSITIONAL DYNAMIC LOGIC OF LOOPING AND CONVERSE.* M.I.T. LAB. FOR COMP.SCI.*TR-263, PH.D. THESIS. STREETT, R.S.*1981. 020265 THOMAS, R.E.*A DATAFLOW ARCHITECTURE WITH IMPROVED ASYMPTOTIC PERFORMANCE.* M.I.T. LAB. FOR COMP.SCI.* TR-265, PH.D. THESIS. THOMAS, R.E.*1981. 020262 TODD, K.W.*HIGH LEVEL VAL CONSTRUCTS IN A STATIC DATA FLOW MACHINE.* M.I.T. LAB. FOR COMP.SCI.*TR-262.*1981. VOL. 4, NO. 3 03/15/82 015996 ALELIUNAS, R. ROSENBERG, A.L.*ON EMBEDDING RECTANGULAR GRIDS IN SQUARE GRIDS.* DUKE U. COMP.SCI.DEPT.* CS-1981-11.*1981. 015997 AULICK, C.M.*A GENERALIZED APPROACH TO REGULARIZATION.* DUKE U. COMP.SCI.DEPT.*CS-1981-05.*1981. 015998 AULICK, C.M.*ISOLATING ERROR EFFECTS IN SOLVING ILL POSED PROBLEMS.* DUKE U. COMP.SCI.DEPT.*CS-1981-06.*1981. 015999 DANIEL, S. GEIST, S.* V-SCAN: AN ADAPTIVE DISK SCHEDULING ALGORITHM.* DUKE U. COMP.SCI.DEPT.*CS-1981-07.*1981. 016000 FINK, P.K.* CONDITIONALS IN A NATURAL LANGUAGE SYSTEM.* DUKE U. COMP.SCI.DEPT.*CS-1981-12.*1981. 016001 ROSENBERG, A.L.* ROUTING WITH PERMUTERS: TOWARD RECONFIGURABLE AND FAULT-TOLERANT NETWORKS.* DUKE U. COMP.SCI.DEPT.*CS-1981-13.*1981. 016002 SMITH, C.U.*A METHODOLOGY FOR PREDICTING THE MEMORY MANAGEMENT OVERHEAD OF NEW SOFTWARE SYSTEMS.* DUKE U. COMP.SCI.DEPT.*CS-1981-04.*1981. 016003 WAGNER, R.A.*THE ARCHITECTURE OF A BOOLEAN VECTOR MACHINE.* DUKE U. COMP.SCI.DEPT.*CS-1981-10.*1981. 016004 WAGNER, R.A.*COMPUTING POWERS OF PRIMITIVE NTH ROOTS OF UNITY.* DUKE U. COMP.SCI.DEPT.*CS-1981-09.*1981. 016005 WAGNER, R.A.*A PROGRAMMER'S VIEW OF THE BOOLEAN VECTOR MACHINE, MODEL-2.* DUKE U. COMP.SCI.DEPT.*CS-1981-08.* 1981. 016006 ANDLER, S. DING, I. ESWARAN, K. HAUSER, C. KIM, W. MEHL, J. WILLIAMS, R.* SYSTEM D: A DISTRIBUTED SYSTEM FOR AVAILABILITY.* IBM WATSON RES. CENTER.*RJ 3313.*1981. 016007 CHAITIN, G.J.* REGISTER ALLOCATION & SPILLING VIA COLORING.* IBM WATSON RES. CENTER.*RC 9124.*1981. 016008 CHING, W.-M.*A DESIGN FOR DATA FLOW ANALYSIS IN AN APL COMPILER.* IBM WATSON RES. CENTER.*RC 9151.*1981. 016009 DERVEER, E.J. VAN.* JOSEPHSON INTEGRATED CIRCUITS.* IBM WATSON RES. CENTER.*RZ 1111.*1981. 016010 GOULD, J.D. CONTI, J. HOVANYECZ, T.* COMPOSING LETTERS WITH A SIMULATED LISTENING TYPEWRITER.* IBM WATSON RES. CENTER.*RC 9119.*1981. 016011 HAILPERN, B. OWICKI, S.* MODULAR VERIFICATION OF CONCURRENT PROGRAMS.* IBM WATSON RES. CENTER.*RC 9130.*1981. 016012 HASKIN, R.L. LORIE, R.A.*ON EXTENDING THE FUNCTIONS OF A RELATIONAL DATABASE SYSTEM.* IBM WATSON RES. CENTER.*RJ 3182.*1981. 016013 ORTH, D.L.*A COMPARISON OF THE IPSA AND STSC IMPLEMENTATIONS OF OPERATORS AND GENERAL ARRAYS EXTENSIONS OF APL.* IBM WATSON RES. CENTER.*RC 9135.* 1981. 016014 RICHARDS, J.T.*THE IBM RESEARCH SPEECH FILING SYSTEM: ANALYSIS OF THE SYSTEM 7/S 370 PROTOTYPE.* IBM WATSON RES. CENTER.*RC 9114.*1981. 016015 ABRAMS, M. CHU, Y.*EVALUATION OF NEBULA ARCHITECTURE FOR JOVIAL CONTROL CONSTRUCTS.* MARYLAND U. COMP.SCI. CENTER.* TR-1052.*1981. 016016 ABRAMS, M. CHU, Y.*READER IN ADA PROGRAMS: 1.* MARYLAND U. COMP.SCI. CENTER.*TR-1062.*1981. 016017 BASILI, V.R. HUTCHENS, D.H.*ANALYZING A SYNTACTIC FAMILY OF COMPLEXITY METRICS.* MARYLAND U. COMP.SCI. CENTER.* TR-1053.*1981. 016018 DIIENNO, T. CHU, Y.*EVALUATION OF NEBULA ARCHITECTURE FOR JOVIAL DATA CONSTRUCTS.* MARYLAND U. COMP.SCI. CENTER.* TR-1051.*1981. 016019 GORDON, K.D.*ON THE CONSTRUCTION OF REPRESENTATIVE TEST WORKLOADS.* MARYLAND U. COMP.SCI. CENTER.*TR-1054, PH.D. THESIS. GORDON, K.D.*1981. 016020 GOUGH, K.J.*CONCEPTUAL DESIGN OF THE DATA PROCESSOR OF A PASCAL DIRECT EXECUTION COMPUTER.* MARYLAND U. COMP.SCI. CENTER.*TR-1060.*1981. 016021 JACOBS, B.E. JACOBS, T.E.*ON THE FUNCTIONAL REQUIREMENTS OF A GLOBAL DATA MANAGER FOR A SET OF DISTRIBUTED HETEROGENEOUS DATABASES I.* MARYLAND U. COMP.SCI. CENTER.*TR-1068.*N.D. 016022 KANAL, L.N. KUMAR, V.*BRANCH & BOUND FORMULATION FOR SEQUENTIAL AND PARALLEL GAME TREE SEARCHING: PRELIMINARY RESULTS.* MARYLAND U. COMP.SCI. CENTER.*TR-1063.*1981. 016023 KANAL, L.N.*PARALLEL IMPLEMENTATION OF A STRUCTURAL ANALYSIS ALGORITHM.* MARYLAND U. COMP.SCI. CENTER.* TR-1064.*1981. 016024 LARSEN, R.L.*CONTROL OF MULTIPLE EXPONENTIAL SERVERS WITH APPLICATION TO COMPUTER SYSTEMS.* MARYLAND U. COMP.SCI. CENTER.*TR-1041, PH.D. THESIS. LARSEN, R.L.*1981. 016025 LOR, K.-W.E.*DESIGN OF EXECUTION SNAPSHOTS FOR DIRECT EXECUTION.* MARYLAND U. COMP.SCI. CENTER.*TR-1044.*1981. 016026 MORELL, L.J. HAMLET, R.G.* ERROR PROPAGATION AND ELIMINATION IN COMPUTER PROGRAMS.* MARYLAND U. COMP.SCI. CENTER.*TR-1065.*1981. 016027 RIEGER, C.* ZMOB: HARDWARE FROM A USER'S VIEWPOINT.* MARYLAND U. COMP.SCI. CENTER.*TR-1042.*1981. 016028 ROUSSOPOULOS, N.* VIEW INDEXING IN RELATIONAL DATABASES.* MARYLAND U. COMP.SCI. CENTER.*TR-1046.*1981. 016029 SAWYERS, S. RADELAT, C.*A LIST OF PUBLICATIONS ON JOVIAL DIRECT EXECUTION COMPUTER ARCHITECTURE, EDITED BY SUSAN SAWYERS AND CARMEN RADELAT.* MARYLAND U. COMP.SCI. CENTER.*TR-1066.*1981. 016030 SMALL, S. RIEGER, C.* PARSING AND COMPREHENDING WITH WORD EXPERTS (A THEORY AND ITS REALIZATION).* MARYLAND U. COMP.SCI. CENTER.*TR-1039.*1981. 016031 STANFILL, C.* PARTITIONED CONSTRAINT NETWORKS: A PRESCRIPTION FOR REPRESENTING MACHINES.* MARYLAND U. COMP.SCI. CENTER.*TR-1037.*1981. MICROFICHE. 110601 ANTONISSE, H.J.* IMAGE SEGMENTATION IN PYRAMIDS.* MARYLAND U. COMP.SCI. CENTER.*TR-1045.*1981. MICROFICHE. 110602 BECK, J. PRAZDNY, K.* HIGHLIGHTS AND THE PERCEPTION OF GLOSSINESS.* MARYLAND U. COMP.SCI. CENTER.*TR-1047.*1981. MICROFICHE. 110603 CHELLAPPA, R.*ON AN ESTIMATION SCHEME FOR GAUSS MARKOV RANDOM FIELD MODELS.* MARYLAND U. COMP.SCI. CENTER.* TR-1040.*1981. MICROFICHE. 110604 DUNN, S.M.*GENERALIZED BLOMQVIST CORRELATION.* MARYLAND U. COMP.SCI. CENTER.*TR-1043.*1981. MICROFICHE. 110605 KIM, C.E.*DIGITAL CONVEXITY, STRAIGHTNESS AND CONVEX POLYGONS.* MARYLAND U. COMP.SCI. CENTER.*TR-1055.*1981. MICROFICHE. 110606 KRISHNAMURTHY, E.V. NARAYANAN, K.A.*A RELAXATION PROCEDURE FOR AUTOMATIC SPELLING CORRECTION IN ENGLISH.* MARYLAND U. COMP.SCI. CENTER.*TR-1059.*1981. MICROFICHE. 110607 NARAYANAN, K.A. ROSENFELD, A.*APPROXIMATION OF WAVEFORMS AND CONTOURS BY ONE-DIMENSIONAL PYRAMID LINKING.* MARYLAND U. COMP.SCI. CENTER.*TR-1057.*1981. MICROFICHE. 110608 NARAYANAN, K.A. O'LEARY, D.P. ROSENFELD, A.* IMAGE SMOOTHING AND SEGMENTATION BY COST MINIMIZATION.* MARYLAND U. COMP.SCI. CENTER.*TR-1049.*1981. MICROFICHE. 110609 NARAYANAN, K.A. O'LEARY, D.P. ROSENFELD, A.* MULTI-RESOLUTION RELAXATION.* MARYLAND U. COMP.SCI. CENTER.*TR-1070.*1981. MICROFICHE. 110610 PIETIKAEINEN, M. ROSENFELD, A.* EDGE BASED TEXTURE MEASURES.* MARYLAND U. COMP.SCI. CENTER.*TR-1050.*1981. MICROFICHE. 110611 PIETIKAEINEN, M. ROSENFELD, A.* GRAY LEVEL PYRAMID LINKING AS AN AID IN TEXTURE ANALYSIS.* MARYLAND U. COMP.SCI. CENTER.*TR-1061.*1981. MICROFICHE. 110612 ROSENFELD, A.* CELLULAR ARCHITECTURES: FROM AUTOMATA TO HARDWARE.* MARYLAND U. COMP.SCI. CENTER.*TR-1048.*1981. MICROFICHE. 110613 ROSENFELD, A.* PARALLEL STRING PARSING USING LATTICE GRAPHS.* MARYLAND U. COMP.SCI. CENTER.*TR-1036.*1981. MICROFICHE. 110614 ROSENFELD, A.* QUADTREE GRAMMARS FOR PICTURE LANGUAGES.* MARYLAND U. COMP.SCI. CENTER.*TR-1058.*1981. MICROFICHE. 110615 RUTKOWSKI, W.S.* SHAPE SEGMENTATION USING RELAXATION.* MARYLAND U. COMP.SCI. CENTER.*TR-1038.*1981. MICROFICHE. 110616 STEWART, G.W.* RANK DEGENERACY.* MARYLAND U. COMP.SCI. CENTER.*TR-1056.*1980. MICROFICHE. 040623 BRUSS, A.R.*THE IMAGE IRRADIANCE EQUATION: ITS SOLUTION AND APPLICATION.* M.I.T. A.I. LAB.*TR-623, PH.D. THESIS. BRUSS, A.R.*1981. 041624 DAVIS, R. SMITH, R.G.*NEGOTIATION AS A METAPHOR FOR DISTRIBUTED PROBLEM SOLVING.* M.I.T. A.I. LAB.*MEMO 624.* 1981. 041592 HOFFMAN, D.D.*INFERRING SHAPE FROM MOTION FIELDS.* M.I.T. A.I. LAB.*MEMO 592.*1980. 041614 RICHARDS, W.A. RUBIN, J.M. HOFFMAN, D.D.* EQUATION COUNTING AND THE INTERPRETATION OF SENSORY DATA.* M.I.T. A.I. LAB.*MEMO 614.*1981. 041631 RUBIN, J.M. RICHARDS, W.A.* COLOR VISION AND IMAGE INTENSITIES: WHEN ARE CHANGES MATERIAL?* M.I.T. A.I. LAB.* MEMO 631.*1981. 040619 WHITE, B.Y.*DESIGNING COMPUTER GAMES TO FACILITATE LEARNING.* M.I.T. A.I. LAB.*TR-619, PH.D. THESIS. WHITE, B.Y.*1981. 040589 WITKIN, A.P.* SHAPE FROM CONTOUR. M.I.T. A.I. LAB.*TR-589, PH.D. THESIS. WITKIN, A.P.*1980. 016032 JAEGERMANN, M. MAREK, W.*ON DEPENDENCIES OF ATTRIBUTES IN INFORMATION SYSTEMS.* POLISH ACADEMY OF SCIENCES. INST. OF COMP.SCI.*ICS PAS RPT. NO. 428.*1981. 016033 KONIKOWSKA, B. MEZYNSKA, E. SENDOVA, E.*A THEORY OF INFORMATION SYSTEMS.* POLISH ACADEMY OF SCIENCES. INST. OF COMP.SCI.*ICS PAS RPT. NO. 421.*1980. 016034 KONRAD, E. ORLOWSKA, E. PAWLAK, Z.* KNOWLEDGE REPRESENTATION SYSTEMS: DEFINABILITY OF INFORMATIONS.* POLISH ACADEMY OF SCIENCES. INST. OF COMP.SCI.*ICS PAS RPT. NO. 433.*1981. 016035 LIPSKI, W.*BIBLIOGRAPHY ON INFORMATION SYSTEMS, CONSECUTIVE RETRIEVAL PROPERTY, INTERVAL GRAPHS AND RELATED TOPICS.* POLISH ACADEMY OF OF SCIENCES. INST. OF COMP.SCI.*ICS PAS RPT. NO. 427.*1981. 016036 MICHALEWICZ, Z.*A COIN WEIGHING PROBLEM AND ITS CONNECTION WITH THE SECURITY OF STATISTICAL DATABASE.* POLISH ACADEMY OF SCIENCES. INST. OF COMP.SCI.*ICS PAS RPT. NO. 426.*1980. 016037 ORLOWSKA, E.* DEPENDENCY OF ATTRITUTES IN INFORMATION SYSTEMS.* POLISH ACADEMY OF SCIENCES. INST. OF COMP.SCI.* ICS PAS RPT. NO. 425.*1980. 016038 ORLOWSKA, E.* DYNAMIC INFORMATION SYSTEMS.* POLISH ACADEMY OF SCIENCES. INST. OF COMP.SCI.*ICS PAS RPT. NO. 434.* 1981. 016039 ORLOWSKA, E. PAWLAK, Z.* EXPRESSIVE POWER OF KNOWLEDGE REPRESENTATION SYSTEMS.* POLISH ACADEMY OF SCIENCES. INST. OF COMP.SCI.*ICS PAS RPT. NO. 432.*1981. 016040 ORLOWSKA, E.* LOGIC APPROACH TO INFORMATION SYSTEMS.* POLISH ACADEMY OF SCIENCES. INST. OF COMP.SCI.*ICS PAS RPT. NO. 437.*1981. 016041 ORLOWSKA, E.* PROGRAM LOGIC WITH QUANTIFIABLE PROPOSITIONAL VARIABLES.* POLISH ACADEMY OF SCIENCES. INST. OF COMP.SCI.*ICS PAS RPT. NO. 422.*1980. 016042 PAWLAK, Z.* CLASSIFICATION OF OBJECTS BY MEANS OF ATTRIBUTES: AN APPROACH TO INDUCTIVE INFERENCE.* POLISH ACADEMY OF SCIENCES. INST. OF COMP.SCI.*ICS PAS RPT. NO. 429.*1981. 016043 PAWLAK, Z.* ROUGH RELATIONS.* POLISH ACADEMY OF SCIENCES. INST. OF COMP.SCI.*ICS PAS RPT. NO. 435.*1981. 016044 PAWLAK, Z.* ROUGH SETS: BASIC NOTIONS.* POLISH ACADEMY OF SCIENCES. INST. OF COMP.SCI.*ICS PAS RPT. NO. 431.*1981. 016045 STANCZAK, W.* MINIMAL SETS: THEORY AND APPLICATIONS.* POLISH ACADEMY OF SCIENCES. INST. OF COMP.SCI.*ICS PAS RPT. NO. 430.*1981. 016046 ZIELONKA, W.*PROVING ASSERTIONS ABOUT PARALLEL PROGRAMS BY MEANS OF TRACES.* POLISH ACADEMY OF SCIENCES. INST. OF COMP.SCI.*ICS PAS RPT. NO. 424.*1980. 016047 DRASTAL, G.A. KULIKOWSKI, C.A.* KNOWLEDGE BASED ACQUISITION OF RULES FOR MEDICAL DIAGNOSIS.* RUTGERS U. COMP.SCI.RES.LAB.*CBM-TM-092.*1981. 016048 EASTMAN, C.M. LAFUE, G.M.E.* SEMANTIC INTEGRITY TRANSACTIONS IN DESIGN DATABASES.* RUTGERS U. COMP.SCI.RES.LAB.*LCSR-TR-020.*1981. 016049 GERASOULIS, A.* SINGULAR INTEGRAL EQUATIONS - THE CONVERGENCE OF THE NYSTROEM INTERPOLANT OF THE GAUSS CHEBYCHEV METHOD.* RUTGERS U. COMP.SCI.DEPT.*DCS-TR-108.* 1981. 016050 GOLDBERG, R.N.* MEDIT USER MANUAL. A MACHINE INDEPENDENT TEXT EDITOR.* RUTGERS U. COMP.SCI.DEPT.*DCS-TR-105.* 1981, FIRST EDITION - DRAFT OF SEPTEMBER 17, 1981. 016051 KING, R.*A FILE ORGANIZATION BASED ON EXTENSIBLE HASHING.* RUTGERS U. COMP.SCI.RES.LAB.*LCSR-TR-022.*1981. 016052 KOENIG, S.*A TRANSFORMATIONAL FRAMEWORK FOR AUTOMATIC DERIVED DATA CONTROL AND ITS APPLICATIONS IN AN ENTITY RELATIONSHIP DATA MODEL.* RUTGERS U. COMP.SCI.RES.LAB.* LCSR-TR-023, PH.D. THESIS. KOENIG, S.*1981. 016053 NUDEL, B.*IMPROVED CONSTRAINT SATISFACTION ALGORITHMS USING INTER-VARIABLE COMPATIBILITIES.* RUTGERS U. COMP.SCI.DEPT.*DCS-TR-109.*1981. 016054 SANDHU, R.S.*THE CASE FOR A SETL BASED QUERY LANGUAGE.* RUTGERS U. COMP.SCI.RES.LAB.*LCSR-TR-024.*1981. 016055 SCHWANKE, B.* COMMON VIRTUAL ARRAYS IN PDP 11 FORTRAN: AN EXERCISE IN SOFTWARE ENGINEERING.* RUTGERS U. COMP.SCI.RES.LAB.*CBM-TR-124.*1981. 016056 SRIDHARAN, N.S.*REPRESENTING KNOWLEDGE IN AIMDS: INTRODUCTION USING TAXMAN EXAMPLES.* RUTGERS U. COMP.SCI.RES.LAB.*CBM-TR-125; RUTGERS U. COMP.SCI.RES.LAB.*LRP-TR-012.*1981. 016057 SRINIVASAN, C.V.* KNOWLEDGE REPRESENTATION AND PROBLEM SOLVING IN MDS.* RUTGERS U. COMP.SCI.DEPT.*DCS-TR-106.* 1981. 016058 SRINIVASAN, C.V.*NOTE ON LEARNING IN MDS BASED ON PREDICATE SIGNATURES.* RUTGERS U. COMP.SCI.RES.LAB.*DCS-TR-107.* 1981. 016059 VICHNEVETSKY, R. SCIUBBA, E. PAK, Y.*NUMERICAL UPSTREAM BOUNDARY CONDITIONS THAT REDUCE SPURIOUS REFLECTION.* RUTGERS U. COMP.SCI.DEPT.*DCS-TR-103.*1981. 016060 CORDY, J.R. HOLT, R.C.*SPECIFICATION OF CONCURRENT EUCLID (VERSION 1).* TORONTO U. COMP. SYSTEMS RES. GROUP.* CSRG-133.*1981. 016061 EAGER, D.L.*ROBUST CONCURRENCY CONTROL IN DISTRIBUTED DATABASES.* TORONTO U. COMP. SYSTEMS RES. GROUP.* CSRG-135.*1981. 016062 HEHNER, E.C.R. HOARE, C.A.R.*ANOTHER LOOK AT COMMUNICATING PROCESSES.* TORONTO U. COMP. SYSTEMS RES. GROUP.* CSRG-134.*1981. 016063 HO-TAE, S.A.*A PROTOTYPE KNOWLEDGE BASED SYSTEM FOR COMPUTER-ASSISTED MEDICAL DIAGNOSIS.* TORONTO U. COMP. SYSTEMS RES. GROUP.*CSRG-132.*1981. 016064 BURKHART, H. NIEVERGELT, J.* STRUCTURE ORIENTED EDITORS.* EIDGENOESSISCHE TECHNISCHE HOCHSCHULE ZURICH. INSTITUT FUER INFORMATIK.*BERICHT 38.*1980. 016065 BURRAGE, K.* ITERATION SCHEMES FOR SINGLY-IMPLICIT RUNGE KUTTA METHODS.* AUCKLAND U. COMP.SCI.DEPT.*RPT. 024.* 1981. 016066 BUTCHER, J.C.* AN STABILITY IS NOT EQUIVALENT TO ALGEBRAIC STABILITY.* AUCKLAND U. COMP.SCI.DEPT.*RPT. 026.*1981. 016067 DEKKER, K.* ALGEBRAIC STABILITY OF GENERAL LINEAR METHODS.* AUCKLAND U. COMP.SCI.DEPT.*RPT. 025.*1981. 016068 HAYNES, S.M. JAIN, R.*DETECTION OF MOVING EDGES.* WAYNE STATE U. COMP.SCI.DEPT.*CSC-82-004.*1981. 016069 JAIN, R.*DIRECT COMPUTATION OF THE FOCUS OF EXPANSION.* WAYNE STATE U. COMP.SCI.DEPT.*CSC-82-005.*1982. 016070 LUNE, J. VAN DE. TE RIELE, H.J.J. WINTER, D.T.*RIGOROUS HIGH SPEED SEPARATION OF ZEROS OF RIEMANN'S ZETA FUNCTION.* MATHEMATISCH CENTRUM.*NW 113/81.*1981. 016071 PEACHEY, J.B.*THE BRADFORD ZIPF DISTRIBUTION AND PROGRAM BEHAVIOUR.* SASKATCHEWAN U. COMPUTATIONAL SCI.DEPT.*RPT. 82-01.*1982. 016072 SHAMIR, E.*A SHARP THRESHOLD FOR HAMILTONIAN PATHS IN RANDOM GRAPHS.*NO ISSUING AGENCY INDICATED (AUTHOR'S ADDRESS: MATHEMATICS INSTITUTE/THE HEBREW UNIVERSITY/JERUSALEM).*1981. 016073 SHOCH, J.F. DALAL, Y.K. CRANE, R.C. REDELL, D.D.*EVOLUTION OF THE ETHERNET LOCAL COMPUTER NETWORK.* XEROX. PALO ALTO RES. CENTER. OFFICE PRODUCTS DIV.*OPD-T8102.*1981. VOL. 4, NO. 4 04/23/82 016074 ANDREWS, G.R.*THE DESIGN AND IMPLEMENTATION OF SR.* ARIZONA U. COMP.SCI.DEPT.*TR 81-15.*1981. 016075 ANDREWS, G.R.* SR: A LANGUAGE FOR DISTRIBUTED PROGRAMMING.* ARIZONA U. COMP.SCI.DEPT.*TR 81-14.*1981. 016076 BUDD, T.A.*AN APL COMPILER.* ARIZONA U. COMP.SCI.DEPT.*TR 81-17.*1981. 016077 CHIMENTI, D.S. FRASER, C.W. HANSON, D.R.*THE S PROGRAMMING LANGUAGE.* ARIZONA U. COMP.SCI.DEPT.*TR 81-13.*1981. 016078 DAVIDSON, J.W.*SIMPLIFYING CODE GENERATION THROUGH PEEPHOLE OPTIMIZATION.* ARIZONA U. COMP.SCI.DEPT.*TR 81-19.*1981. 016079 MILLER, W.*TOOLS FOR NUMERICAL PROGRAMMING.* ARIZONA U. COMP.SCI.DEPT.*TR 81-16.*1981. 016080 WAMPLER, S.B.* CONTROL MECHANISMS FOR GENERATORS IN ICON.* ARIZONA U. COMP.SCI.DEPT.*TR 81-18.*1981. 016081 AKIN, O. RAO, D.R.*WORKING PAPERS IN USER-COMPUTER INTERFACE.* CARNEGIE MELLON U. COMP.SCI.DEPT.* CMU-CS-81-140.*1981. CONTENTS: (WORKING PAPER: 1): AKIN, O.*EFFICIENT COMPUTER USER INTERFACE IN ELECTRONIC MAIL SYSTEMS; (WORKING PAPER: 2): RAO, D.R. AKIN, O.*SUMMARY OF USER ERRORS AT THE TERMINAL. 016082 BATES, J.*ON INTENSIONALITY AND REFERENTIAL TRANSPARENCY.* CARNEGIE MELLON U. COMP.SCI.DEPT.*CMU-CS-81-144.*1981. 016083 CHAZELLE, B. MONIER, L.* OPTIMALITY IN VLSI.* CARNEGIE MELLON U. COMP.SCI.DEPT.*CMU-CS-81-141.*1981. 016084 CHAZELLE, B. MONIER, L.*UNBOUNDED HARDWARE IS EQUIVALENT TO DETERMINISTIC TURING MACHINES.* CARNEGIE MELLON U. COMP.SCI.DEPT.*CMU-CS-81-143.*1981. 016085 MEDINA-MORA, R. NOTKIN, D.S.* ALOE USERS' AND IMPLEMENTORS' GUIDE.* CARNEGIE MELLON U. COMP.SCI.DEPT.*CMU-CS-81-145.* 1981. 016086 NELSON, B.J.* REMOTE PROCEDURE CALL.* CARNEGIE MELLON U. COMP.SCI.DEPT.*CMU-CS-81-119, PH.D. THESIS. NELSON, B.J.* 1981. 016087 NESTOR, J.R. WULF, W.A. LAMB, D.A.* IDL - INTERFACE DESCRIPTION LANGUAGE: FORMAL DESCRIPTION.* CARNEGIE MELLON U. COMP.SCI.DEPT.*CMU-CS-81-139.*1981. 016088 BROWN, W.W.* NONLINEAR CLASSIFICATION OF TRANSLATIONAL INITIATION SITES.* COLORADO U. COMP.SCI.DEPT.* CU-CS-211-91.*1981. 016089 EHRENFEUCHT, A. ROZENBERG, G.*ON THE SUBWORD COMPLEXITY OF DOL LANGUAGES WITH A CONSTANT DISTRIBUTION.* COLORADO U. COMP.SCI.DEPT.*CU-CS-206-81.*1981. 016090 EHRENFEUCHT, A. ROZENBERG, G. KARHUMAKI, J.*THE (GENERALIZED) POST CORRESPONDENCE PROBLEM WITH LISTS CONSISTING OF TWO WORDS IS DECIDABLE.* COLORADO U. COMP.SCI.DEPT.*CU-CS-204-81.*1981. 016091 FEIBER, J.D. TAYLOR, R.N. OSTERWEIL, L.* NEWTON -- A DYNAMIC PROGRAM ANALYSIS TOOL CAPABILITIES SPECIFICATION.* COLORADO U. COMP.SCI.DEPT.*CU-CS-200-81.*1981. 016092 FOSDICK, L.D.* POLISH-X TRANSFORMATIONS.* COLORADO U. COMP.SCI.DEPT.*CU-CS-203-81.*1981. 016093 GABOW, H.N.*AN ALMOST-LINEAR ALGORITHM FOR TWO PROCESSOR SCHEDULING.* COLORADO U. COMP.SCI.DEPT.*CU-CS-212-81.* 1981 (REVISED VERSION OF CU-CS-169-80). 016094 GALLUCCI, M.A.* SAM/SAL REPORT AND USER MANUAL.* COLORADO U. COMP.SCI.DEPT.*CU-CS-198-81.*1981. 016095 HAUSSLER, D.*SOME RESULTS ON SYMMETRIC DGSMS AND DGSM EQUIVALENCE.* COLORADO U. COMP.SCI.DEPT.*CU-CS-199-79.* 1979. 016096 HAVENS, B.P.* NUMERICAL OPTIMIZERS FOR USE IN FLOATING POINT DATA GENERATION.* COLORADO U. COMP.SCI.DEPT.* CU-CS-197-80.*1980. 016097 ROZENBERG, G.*ON SUBWORDS OF FORMAL LANGUAGES.* COLORADO U. COMP.SCI.DEPT.*CU-CS-205-81.*1981. 016098 ABU-SUFAH, W. LEE, R. MALKAWI, M. YEW, P.-C.*EMPIRICAL RESULTS ON THE BEHAVIOR OF NUMERICAL PROGRAMS IN VIRTUAL MEMORY SYSTEMS.* ILLINOIS U. COMP.SCI.DEPT.* UIUCDCS-R-81-1076.*1981. 016099 CHENG, W.K.* PERFORMANCE ANALYSIS OF UPDATE SYNCHRONIZATION ALGORITHMS IN DISTRIBUTED DATABASES.* ILLINOIS U. COMP.SCI.DEPT.*UIUCDCS-R-81-1068, PH.D. THESIS. CHENG, W.K.*1981. 016100 CHENG, W.-Y.* PERFORMANCE EVALUATION OF TOKEN CONTROL NETWORKS.* ILLINOIS U. COMP.SCI.DEPT.*UIUCDCS-R-82-1079, PH.D. THESIS. CHENG, W.-Y.*1982. 016101 GRCAR, J.F.*ANALYSES OF THE LANCZOS ALGORITHM AND OF THE APPROXIMATION PROBLEM IN RICHARDSON'S METHOD.* ILLINOIS U. COMP.SCI.DEPT.*UIUCDCS-R-81-1074, PH.D. THESIS. GRCAR, J.F.*1981. 016102 AUMANN, G.*KEGELIGE HYPERREGELFLAECHEN.* TECHNISCHE UNIVERSITAET MUENCHEN. INSTITUT FUER MATHEMATIK.* TUM-M8105.*1981. 016103 BAYER, R. ELHARDT, K. HEIGERT, J. REISER, A.*DYNAMIC TIMESTAMP ALLOCATION AND ITS APPLICATIONS TO THE BEHR METHOD.* TECHNISCHE UNIVERSITAET MUENCHEN. INSTITUT FUER INFORMATIK.*TUM-I8107.*1981. 016104 CASTRIGIANO, D.P.L.* POSITION OPERATORS AS INTEGRALS WITH RESPECT TO EUCLIDEAN SYSTEMS OF COVARIANCE.* TECHNISCHE UNIVERSITAET MUENCHEN. INSTITUT FUER MATHEMATIK.* TUM-M8109.*1981. 016105 GANZINGER, H.*PARAMETERIZED SPECIFICATIONS: PARAMETER PASSING AND OPTIMIZING IMPLEMENTATION.* TECHNISCHE UNIVERSITAET MUENCHEN. INSTITUT FUER INFORMATIK.* TUM-I8110.*1981. 016106 GIEGERICH, R.*AUTOMATISCHE ERZEUGUNG VON MASCHINENCODE-OPTIMIERERN.* TECHNISCHE UNIVERSITAET MUENCHEN. INSTITUT FUER INFORMATIK.*TUM-I8112.*1981. 016107 JAKUBOWICZ, A.*UEBER DEN HOMOMORPHISMUS, DER DURCH EINE DERIVATION IM ANTISYMMETRISCHEN TENSORRAUM VOM TYP (0,2) INDUZIERT IST.* TECHNISCHE UNIVERSITAET MUENCHEN. INSTITUT FUER MATHEMATIK.*TUM-M8111.*1981. 016108 JOCHUM, G.*AUTOMATISCHE KONSTRUKTION UND EINHEITLICHE DARSTELLUNG VON ATTRIBUTAUSWERTUNGSALGORITHMEN.* TECHNISCHE UNIVERSITAET MUENCHEN. INSTITUT FUER INFORMATIK.*TUM-I8113.*1981. 016109 KREDLER, C.*SCHRITTWEISE VERFAHREN FUER MULTINOMIALE UND VERWANDTE REGRESSIONSMODELLE.* TECHNISCHE UNIVERSITAET MUENCHEN. INSTITUT FUER MATHEMATIK.*TUM-M8107.*1981. 016110 MEIXNER, W.* DUALITY OF VECTOR VALUED (AL)-NORMS AND (AM)-NORMS ON ORDERED VECTOR SPACES.* TECHNISCHE UNIVERSITAET MUENCHEN. INSTITUT FUER INFORMATIK.* TUM-I8105.*1981. 016111 NAEGELE, R. SCHLICHTER, J.*BETRIEBSSYSTEMKERN EINES MEHRPROZESSORSYSTEMS.* TECHNISCHE UNIVERSITAET MUENCHEN. INSTITUT FUER INFORMATIK.*TUM-I8111.*1981. 016112 PARTSCH, H. STEINBRUEGGEN, R.*A COMPREHENSIVE SURVEY ON PROGRAM TRANSFORMATION SYSTEMS.* TECHNISCHE UNIVERSITAET MUENCHEN. INSTITUT FUER INFORMATIK.*TUM-I8108.*1981. 016113 REINSCH, K.-D.*NUMERISCHE BERECHNUNG VON BIEGELINIEN IN DER EBENE.* TECHNISCHE UNIVERSITAET MUENCHEN. INSTITUT FUER MATHEMATIK.*TUM-M8108.*1981. 016114 RIEDEL, N.*ON UNIQUELY ERGODIC C* DYNAMICAL SYSTEMS AND THE DIXMIER PROPERTY.* TECHNISCHE UNIVERSITAET MUENCHEN. INSTITUT FUER MATHEMATIK.*TUM-M8106.*1981. 016115 WENDEL, H.*BERECHNUNG DER SCHALTKOMBINATIONEN IN EINER SAMMELSCHIENENSCHALTSTATION BEI BERUECKSICHTIGUNG VON NEBENBEDINGUNGEN DER BETRIEBSFUEHRUNG.* TECHNISCHE UNIVERSITAET MUENCHEN. INSTITUT FUER INFORMATIK.* TUM-I8109.*1981. 024873 CARR, R.W.* VIRTUAL MEMORY MANAGEMENT.* STANFORD U. COMP.SCI.DEPT.*STAN-CS-81-873; STANFORD U. SLAC.* SLAC-244, PH.D. THESIS. CARR, R.W.*1981. 024884 CERI, S. NAVATHE, S. WIEDERHOLD, G.*OPTIMAL DESIGN OF DISTRIBUTED DATABASES.* STANFORD U. COMP.SCI.DEPT.* STAN-CS-81-884.*1981. 024896 CLANCEY, W.J.*THE EPISTEMOLOGY OF A RULE BASED EXPERT SYSTEM: A FRAMEWORK FOR EXPLANATION.* STANFORD U. COMP.SCI.DEPT.*STAN-CS-81-896; STANFORD U. COMP.SCI.DEPT. HEURISTIC PROGRAMMING PROJECT.*HPP-81-017.*1981. 024894 CLANCEY, W.J.*METHODOLOGY FOR BUILDING AN INTELLIGENT TUTORING SYSTEM.* STANFORD U. COMP.SCI.DEPT.* STAN-CS-81-894; STANFORD U. COMP.SCI.DEPT. HEURISTIC PROGRAMMING PROJECT.*HPP-81-018.*1981. 024891 DIETTERICH, T.G. BUCHANAN, B.G.*THE ROLE OF THE CRITIC IN LEARNING SYSTEMS.* STANFORD U. COMP.SCI.DEPT.* STAN-CS-81-891; STANFORD U. COMP.SCI.DEPT. HEURISTIC PROGRAMMING PROJECT.*HPP-81-019.*1981. 024897 GOAD, C.*AUTOMATIC CONSTRUCTION OF SPECIAL PURPOSE PROGRAMS.* STANFORD U. COMP.SCI.DEPT.*STAN-CS-82-897; STANFORD U. COMP.SCI.DEPT. A.I. LAB.*AIM-344.*1982. 024819 GOAD, C.*COMPUTATIONAL USES OF THE MANIPULATION OF FORMAL PROOFS.* STANFORD U. COMP.SCI.DEPT.*STAN-CS-80-819, PH.D. THESIS. GOAD, C.*1980. 024887 GRAHAM, R.L. YAO, F.F.*FINDING THE CONVEX HULL OF A SIMPLE POLYGON.* STANFORD U. COMP.SCI.DEPT.*STAN-CS-81-887.* 1981. 024890 HIGDON, R.L.* BOUNDARY CONDITIONS FOR HYPERBOLIC SYSTEMS OF PARTIAL DIFFERENTIAL EQUATIONS HAVING MULTIPLE TIME SCALES.* STANFORD U. COMP.SCI.DEPT.* STAN-CS-81-890, PH.D. THESIS. HIGDON, R.L.*1981. 024875 HU, T.C. SHING, M.T.*COMPUTATION OF MATRIX CHAIN PRODUCTS, PART I, PART II.* STANFORD U. COMP.SCI.DEPT.* STAN-CS-81-875.*1981. 024886 KNUTH, D.E.*THE CONCEPT OF A META-FONT.* STANFORD U. COMP.SCI.DEPT.*STAN-CS-81-886.*1981. 024892 KUPER, G.M.*AN ALGORITHM FOR REDUCING ACYCLIC HYPERGRAPHS.* STANFORD U. COMP.SCI.DEPT.*STAN-CS-82-892.*1982. 024880 MAYR, E.W.* WELL STRUCTURED PARALLEL PROGRAMS ARE NOT EASIER TO SCHEDULE.* STANFORD U. COMP.SCI.DEPT.* STAN-CS-81-880.*1981. 024889 MUJTABA, S. GOLDMAN, R.* AL USERS' MANUAL.* STANFORD U. COMP.SCI.DEPT.*STAN-CS-81-889; STANFORD U. COMP.SCI.DEPT. A.I. LAB.*AIM-344.*1981. 024895 NOVAK, G.S. JR.* GLISP USERS' MANUAL.* STANFORD U. COMP.SCI.DEPT.*STAN-CS-82-895; STANFORD U. COMP.SCI.DEPT. HEURISTIC PROGRAMMING PROJECT.*HPP-82-001.*1982. 024882 PAN, V.*FAST MATRIX MULTIPLICATION WITHOUT APA-ALGORITHMS.* STANFORD U. COMP.SCI.DEPT.*STAN-CS-81-882.*1981. 024893 PAULSON, L.*A COMPILER GENERATOR FOR SEMANTIC GRAMMARS.* STANFORD U. COMP.SCI.DEPT.*STAN-CS-81-893, PH.D. THESIS. PAULSON, L.*1981. 024883 PEPPER, P.*ON PROGRAM TRANSFORMATIONS FOR ABSTRACT DATA TYPES AND CONCURRENCY.* STANFORD U. COMP.SCI.DEPT.* STAN-CS-81-883.*1981. 024881 ULLMAN, J.D.*THE U. R. STRIKES BACK.* STANFORD U. COMP.SCI.DEPT.*STAN-CS-81-881.*1981. 024885 VAN MELLE, W. SCOTT, A.C. BENNETT, J.S. PEAIRS, M.*THE EMYCIN MANUAL.* STANFORD U. COMP.SCI.DEPT.* STAN-CS-81-885; STANFORD U. COMP.SCI.DEPT. HEURISTIC PROGRAMMING PROJECT.*HPP-81-016.*1981. 024898 WHANG, K. WIEDERHOLD, G. SAGALOWICZ, D.* SEPARABILITY AS A PHYSICAL DATABASE DESIGN METHODOLOGY.* STANFORD U. COMP.SCI.DEPT.*STAN-CS-81-898; STANFORD U. SEL. COMP. SYSTEMS LAB.*TECH.RPT. 222.*1981. 025211 BUTNER, S.E.* TRIPLE TIME REDUNDANCY, FAULT MASKING IN BYTE SLICED SYSTEMS. STANFORD U. SEL. COMP. SYSTEMS LAB.* TECH.RPT. 211; STANFORD U. SEL. COMP. SYSTEMS LAB. CENTER FOR RELIABLE COMPUTING.*RPT. 81-02.*1981. 025218 BUTNER, S.E.*A UNIVERSAL SLICE ELEMENT FOR TRIPLE TIME REDUNDANT SYSTEMS.* STANFORD U. SEL. COMP. SYSTEMS LAB.* TECH.RPT. 218; STANFORD U. SEL. COMP. SYSTEMS LAB. CENTER FOR RELIABLE COMPUTING.*RPT. 81-09.*1981. 025221 CLARK, J.H.* PARAMETRIC CURVES, SURFACES AND VOLUMES IN COMPUTER GRAPHICS AND COMPUTER AIDED GEOMETRIC DESIGN.* STANFORD U. SEL. COMP. SYSTEMS LAB.*TECH.RPT. 221.*1981. 038193 DONG, H. MCCLUSKEY, E.J.*DESIGN OF FULLY TESTABLE PROGRAMMABLE LOGIC ARRAYS.* STANFORD U. SEL. COMP. SYSTEMS LAB.*TECH. NOTE 193; STANFORD U. SEL. COMP. SYSTEMS LAB. CENTER. FOR RELIABLE COMPUTING.*RPT. 81-20.* 1981. 038186 DONG, H. MCCLUSKEY, E.J.* MATRIX REPRESENTATION OF PLA'S AND AN APPLICATION TO CHARACTERIZING ERRORS.* STANFORD U. SEL. COMP. SYSTEMS LAB.*TECH. NOTE 186; STANFORD U. SEL. COMP. SYSTEMS LAB. CENTER FOR RELIABLE COMPUTING.* RPT. 81-11.*1981. 038189 DONG, H.* MODIFIED BERGER CODES FOR DETECTION OF UNIDIRECTIONAL ERRORS.* STANFORD U. SEL. COMP. SYSTEMS LAB.*TECH. NOTE 189; STANFORD U. SEL. COMP. SYSTEMS LAB. CENTER FOR RELIABLE COMPUTING.*RPT. 81-16.*1981. 038194 FLYNN, M. HUCK, J. WAKEFIELD, S.* ARCHITECTURE AND LANGUAGE EMULATION RESEARCH.* STANFORD U. SEL. COMP. SYSTEMS LAB.* TECH. NOTE 194.*1982. 025219 FU, P.L.* CONSISTENCY IN INTERPROCESSOR COMMUNICATIONS FOR FAULT TOLERANT MULTIPROCESSORS.* STANFORD U. SEL. COMP. SYSTEMS LAB.*TECH.RPT. 219; STANFORD U. SEL. COMP. SYSTEMS LAB. CENTER FOR RELIABLE COMPUTING.*RPT. 81-10.* 1981. 025225 GANAPATHI, M. FISCHER, C.N. HENNESSY, J.L.*AUTOMATIC COMPILER CODE GENERATION.* STANFORD U. SEL. COMP. SYSTEMS LAB.*TECH.RPT. 225.*1981. 025213 GONZALEZ-CAWLEY, N. TOBAGI, F.A.*SIMULATION OF MESSAGE BASED PRIORITY FUNCTIONS IN CARRIER SENSE MULTIACCESS/BROADCAST SYSTEMS.* STANFORD U. SEL. COMP. SYSTEMS LAB.*TECH.RPT. 213.*1981. 025224 HENNESSY, J. GROSS, T.* CODE GENERATION AND REORGANIZATION IN THE PRESENCE OF PILELINE CONSTRAINTS.* STANFORD U. SEL. COMP. SYSTEMS LAB.*TECH.RPT. 224.*1981. 025223 HENNESSY, J. JOUPPI, N. BASKETT, F. GILL, J.* MIPS: A VLSI PROCESSOR ARCHITECTURE.* STANFORD U. SEL. COMP. SYSTEMS LAB.*TECH.RPT. 223.*1981. 038191 IYER, R.K. ROSSETTI, D.J.*A STATISTICAL LOAD DEPENDENCY MODEL FOR CPU ERRORS AT SLAC.* STANFORD U. SEL. COMP. SYSTEMS LAB.*TECH. NOTE 191; STANFORD U. SEL. COMP. SYSTEMS LAB. CENTER FOR RELIABLE COMPUTING.*RPT. 81-19.* 1981. 038187 KHAKBAZ, J.*A NOVEL TOTALLY SELF CHECKING 1-OUT-OF-N CHECKER.* STANFORD U. SEL. COMP. SYSTEMS LAB.*TECH. NOTE 187; STANFORD U. SEL. COMP. SYSTEMS LAB. CENTER FOR RELIABLE COMPUTING.*RPT. 81-12.*1981. 038188 KHAKBAZ, J. MCCLUSKEY, E.J.*CONCURRENT ERROR DETECTION AND TESTING FOR LARGE PLA'S.* STANFORD U. SEL. COMP. SYSTEMS LAB.*TECH. NOTE 188; STANFORD U. SEL. COMP. SYSTEMS LAB. CENTER FOR RELIABLE COMPUTING.*RPT. 81-14.*1981. 025214 IYER, R.K. BUTNER, S.E. MCCLUSKEY, E.J.*AN EXPONENTIAL FAILURE/LOAD RELATIONSHIP: RESULTS OF A MULTI-COMPUTER STATISTICAL STUDY.* STANFORD U. SEL. COMP. SYSTEMS LAB.* TECH.RPT. 214; STANFORD U. SEL. COMP. SYSTEMS LAB. CENTER FOR RELIABLE COMPUTING.*RPT. 81-06.*1981. 025212 LU, D.J.* WATCHDOG PROCESSORS AND STRUCTURAL INTEGRITY CHECKING.* STANFORD U. SEL. COMP. SYSTEMS LAB.*TECH.RPT. 212; STANFORD U. SEL. COMP. SYSTEMS LAB. CENTER FOR RELIABLE COMPUTING.*RPT. 81-05.*1981. 038185 MCCLUSKEY, E.J.* TESTING VHSIC DEVICES.* STANFORD U. SEL. COMP. SYSTEMS LAB.*TECH. NOTE 185; STANFORD U. SEL. COMP. SYSTEMS LAB. CENTER FOR RELIABLE COMPUTING.*RPT. 81-03.* 1981. 038190 NAMJOO, M. MCCLUSKEY, E.J.* WATCHDOG PROCESSORS AND DETECTION OF MALFUNCTIONS AT THE SYSTEM LEVEL.* STANFORD U. SEL. COMP. SYSTEMS LAB.*TECH. NOTE 190; STANFORD U. SEL. COMP. SYSTEMS LAB. CENTER FOR RELIABLE COMPUTING.* RPT. 81-17.*1981. 038195 ROSSETTI, D.J. IYER, R.K.*A SOFTWARE SYSTEM FOR RELIABILITY AND WORKLOAD ANALYSIS.* STANFORD U. SEL. COMP. SYSTEMS LAB.*TECH. NOTE 195; STANFORD U. SEL. COMP. SYSTEMS LAB. CENTER FOR RELIABLE COMPUTING.*RPT. 81-18.*1981. 025220 TOBAGI, F.A. BORGONOVO, F. FRATTA, L.*THE EXPRESS-NET: A LOCAL AREA COMMUNICATION NETWORK INTEGRATING VOICE AND DATA.* STANFORD U. SEL. COMP. SYSTEMS LAB.*TECH.RPT. 220.*1980. 038192 XU, X.*A MODULARIZED TEST GENERATION METHOD USING MATRICES.* STANFORD U. SEL. COMP. SYSTEMS LAB.*TECH. NOTE 192; STANFORD U. SEL. COMP. SYSTEMS LAB. CENTER FOR RELIABLE COMPUTING.*RPT. 81-15.*1981. 016116 DIVITO, B.L.*A MECHANICAL VERIFICATION OF THE ALTERNATING BIT PROTOCOL.* TEXAS U. COMPUTING SCI. AND COMP.APPL.INST. CERTIFIABLE MINICOMPUTER PROJECT.* ICSCA-CMP-021.*1981. 016117 DIVITO, B.L.*TRANSCRIPTS FOR THE PROOF OF THE ALTERNATING BIT PROTOCOL.* TEXAS U. COMPUTING SCI. AND COMP.APPL.INST. CERTIFIABLE MINICOMPUTER PROJECT.* ICSCA-CMP-022.*1981. 016118 HARE, D.F.*A STRUCTURE PROGRAM EDITOR FOR THE GYPSY VERIFICATION ENVIRONMENT.* TEXAS U. COMPUTING SCI. AND COMP.APPL.INST. CERTIFIABLE MINICOMPUTER PROJECT.* ICSCA-CMP-016.*1979. 016119 HUNTER, L.W.*THE FIRST GENERATION GYPSY COMPILER.* TEXAS U. COMPUTING SCI. AND COMP.APPL.INST. CERTIFIABLE MINICOMPUTER PROJECT.*ICSCA-CMP-023.*1981. 016120 SMITH, L.M.* COMPILING FROM THE GYPSY VERIFICATION ENVIRONMENT.* TEXAS U. COMPUTING SCI. AND COMP.APPL.INST. CERTIFIABLE MINICOMPUTER PROJECT.*ICSCA-CMP-020.*1980. 110620 RALL, L.B.*A THEORY OF INTERVAL ITERATION.* WISCONSIN U. MATH.RES. CENTER.*MRC TECH.SUM.RPT. 2196.*1981. MICROFICHE. 110621 RITTER, K.*ON PARAMETRIC LINEAR AND QUADRATIC PROGRAMMING PROBLEMS.* WISCONSIN U. MATH.RES. CENTER.*MRC TECH.SUM.RPT. 2197.*1981. MICROFICHE. 110623 MARKOVICH, P.A. WEISS, R.* NONLINEAR EIGENVALUE PROBLEMS ON INFINITE INTERVALS.* WISCONSIN U. MATH.RES. CENTER.*MRC TECH.SUM.RPT. 2199.*1981. MICROFICHE. 110628 SAFF, E.B. SHARMA, A. VARGA, R.S.*AN EXTENSION TO RATIONAL FUNCTIONS OF A THEOREM OF J.L. WALSH ON DIFFERENCES OF INTERPOLATING POLYNOMIALS.* WISCONSIN U. MATH.RES. CENTER.*MRC TECH.SUM.RPT. 2204.*1981. MICROFICHE. 110629 MARKOVICH, P.A. RINGHOFER, C.A.*THE NUMERICAL SOLUTION OF BOUNDARY VALUE PROBLEMS ON 'LONG' INTERVALS.* WISCONSIN U. MATH.RES. CENTER.*MRC TECH.SUM.RPT. 2205.*1981. MICROFICHE. 110637 MARKOVICH, P.A. RENARDY, M.*A NONLINEAR VOLTERRA INTEGRO DIFFERENTIAL EQUATION DESCRIBING THE STRETCHING OF POLYMERIC LIQUIDS.* WISCONSIN U. MATH.RES. CENTER.*MRC TECH.SUM.RPT. 2213.*1981. MICROFICHE. 110639 DE BOOR, C. HOELLIG, R.* RECURRENCE RELATIONS FOR MULTIVARIATE B-SPLINES.* WISCONSIN U. MATH.RES. CENTER.* MRC TECH.SUM.RPT. 2215.*1981. MICROFICHE. 110640 ROGERS, J.C.W.*NUMERICAL SOLUTION OF A GASIFICATION PROBLEM.* WISCONSIN U. MATH.RES. CENTER.*MRC TECH.SUM.RPT. 2216.*1981. MICROFICHE. 110641 FENG, Y.Y. QI, D.X.*A SEQUENCE OF PIECEWISE ORTHOGONAL POLYNOMIALS. (I). (LINEAR CASE).* WISCONSIN U. MATH.RES. CENTER.*MRC TECH.SUM.RPT. 2217.*1981. MICROFICHE. 110651 DYN, N. WONG, W.H.*ON THE SOLUTION OF A CONSTRAINED MINIMIZATION PROBLEM IN H'(OMEGA) RELATED TO DENSITY ESTIMATION.* WISCONSIN U. MATH.RES. CENTER.*MRC TECH.SUM.RPT. 2227.*1981. MICROFICHE. 110653 FENG, Y.Y. QI, D.X.*A SEQUENCE OF PIECEWISE ORTHOGONAL POLYNOMIALS.* WISCONSIN U. MATH.RES. CENTER.*MRC TECH.SUM.RPT. 2229.*1981. MICROFICHE. 110655 MANGASARIAN, O.L.*A CONDITION NUMBER FOR LINEAR INEQUALITIES AND LINEAR PROGRAMS.* WISCONSIN U. MATH.RES. CENTER.*MRC TECH.SUM.RPT. 2231.*1981. MICROFICHE. 110656 RUSSELL, D.L.*OPTIMAL ORBITAL REGULATION IN DYNAMICAL SYSTEMS SUBJECT TO HOPF BIFURCATION.* WISCONSIN U. MATH.RES. CENTER.*MRC TECH.SUM.RPT. 2232.*1981. MICROFICHE. 110658 SCHOENBERG, I.J.*INTERPOLATING SPLINES AS LIMITS OF POLYNOMIALS.* WISCONSIN U. MATH.RES. CENTER.*MRC TECH.SUM.RPT. 2234.*1981. MICROFICHE. 110659 FENG, Y.Y. QI, D.X.*ON THE HAAR AND WALSH SYSTEMS ON A TRIANGLE.* WISCONSIN U. MATH.RES. CENTER.*MRC TECH.SUM.RPT. 2235.*1981. MICROFICHE. 110662 QI, D.X.*A CLASS OF LOCAL EXPLICIT MANY KNOT SPLINE INTERPOLATION SCHEMES.* WISCONSIN U. MATH.RES. CENTER.* MRC TECH.SUM.RPT. 2238.*1981. MICROFICHE. 110665 FUJIWARA, O.* DUALITY IN NONCONCAVE PROGRAMS USING TRANSFORMATIONS.* WISCONSIN U. MATH.RES. CENTER.*MRC TECH.SUM.RPT. 2241.*1981. MICROFICHE. 110666 QI, D.X.*A NEW WAY FOR CONSTRUCTING HIGHER ORDER ACCURACY SPLINE SMOOTHING FORMULAS.* WISCONSIN U. MATH.RES. CENTER.*MRC TECH.SUM.RPT. 2242.*1981. MICROFICHE. 110681 HAN, S.-P. MANGASARIAN, O.L.*A DUAL DIFFERENTIABLE EXACT PENALTY FUNCTION.* WISCONSIN U. MATH.RES. CENTER.*MRC TECH.SUM.RPT. 2257.*1981. MICROFICHE. 110684 MANGASARIAN, O.L.*SPARSITY-PRESERVING SOR ALGORITHMS FOR SEPARABLE QUADRATIC AND LINEAR PROGRAMMING.* WISCONSIN U. MATH.RES. CENTER.*MRC TECH.SUM.RPT. 2260.*1981. MICROFICHE. 110686 GREVILLE, T.N.E. VAUGHAN, H.*SMOOTHEST LOCAL INTERPOLATION FORMULAS FOR EQUALLY SPACED DATA.* WISCONSIN U. MATH.RES. CENTER.*MRC TECH.SUM.RPT. 2262.*1981. MICROFICHE. 110692 RALL, L.B.*INTERVAL ANALYSIS: A TOOL FOR APPLIED MATHEMATICS.* WISCONSIN U. MATH.RES. CENTER.*MRC TECH.SUM.RPT. 2268.*1981. MICROFICHE. 110693 DEVORE, R.A. SCOTT, L.R.*ERROR ESTIMATES FOR GAUSSIAN QUADRATURE AND WEIGHTED L SUPERSCRIPT 1 POLYNOMIAL APPROXIMATION.* WISCONSIN U. MATH.RES. CENTER.*MRC TECH.SUM.RPT. 2269.*1981. MICROFICHE. 110695 RALL, L.B.*SOLUTION OF FINITE SYSTEMS OF EQUATIONS OF INTERVAL ITERATION.* WISCONSIN U. MATH.RES. CENTER.*MRC TECH.SUM.RPT. 2271.*1981. MICROFICHE. 110698 CRYER, C.W. ZHOU, S.Z.*NUMERICAL SOLUTION OF DEGENERATE VARIATIONAL INEQUALITY ARISING IN THE FLUID FLOW THROUGH POROUS FLOW.* WISCONSIN U. MATH.RES. CENTER.*MRC TECH.SUM.RPT. 2274.*1981. MICROFICHE. 110709 MARKOVICH, P.A. RINGHOFER, C.A.* SINGULAR PERTURBATION PROBLEMS WITH A SINGULARITY OF THE SECOND KIND.* WISCONSIN U. MATH.RES. CENTER.*MRC TECH.SUM.RPT. 2285.* 1981. MICROFICHE. 110710 RALL, L.B.* MEAN VALUE AND TAYLOR FORMS IN INTERVAL ANALYSIS.* WISCONSIN U. MATH.RES. CENTER.*MRC TECH.SUM.RPT. 2286.*1981. MICROFICHE. 110714 STRIKWERDA, J.C.*A GENERALIZED CONJUGATE GRADIENT METHOD FOR NONSYMMETRIC SYSTEMS OF LINEAR EQUATIONS.* WISCONSIN U. MATH.RES. CENTER.*MRC TECH.SUM.RPT. 2290.*1981. MICROFICHE. 110716 ZHONG, X.-C.*NUMERICAL METHODS FOR SOLVING A PREMIXED LAMINAR FLAME.* WISCONSIN U. MATH.RES. CENTER.*MRC TECH.SUM.RPT. 2292.*1981. MICROFICHE. 110720 GOODMAN, T.N.T. SCHOENBERG, I.J. SHARMA, A.*HIGH ORDER CONTINUITY IMPLIES GOOD APPROXIMATIONS TO SOLUTIONS OF CERTAIN FUNCTIONAL EQUATIONS.* WISCONSIN U. MATH.RES. CENTER.*MRC TECH.SUM.RPT. 2296.*1981. MICROFICHE. 110723 SCHOENBERG, I.J.*A NEW APPROACH TO EULER SPLINES. I.* WISCONSIN U. MATH.RES. CENTER.*MRC TECH.SUM.RPT. 2299.* 1981. MICROFICHE. 016122 BARLOW, R.E.*ASSESSMENT OF SUBJECTIVE PROBABILITY.* CAL U., BERKELEY. O.R. CENTER.*ORC 81-23.*1981. 016123 BARLOW, R.E.*SET THEORETIC SIGNED DOMINATION FOR COHERENT SYSTEMS.* CAL U., BERKELEY. O.R. CENTER.*ORC 81-01.* 1982. 016124 BUNT, R.B. HARBUS, R.S. PLUMB, S.J.*THE EFFECTIVE MANAGEMENT OF PAGING STORAGE HIERARCHIES.* SASKATCHEWAN U. COMPUTATIONAL SCI.DEPT.*RPT. 82-03.*1982. 016125 JEWELL, W.S.*TWO PAPERS ON BAYESIAN DATA TRIMMING.* CAL U., BERKELEY. O.R. CENTER.*ORC 81-24.*1981. 016126 LAMPSON, B.W. HORNING, J.J. LONDON, R.L. MITCHELL, J.G. POPEK, G.J.*REPORT ON THE PROGRAMMING LANGUAGE EUCLID.* XEROX. PALO ALTO RES. CENTER.*CSL-81-12.*1981. 016127 LUSKIN, M. TEMPLE, B.*THE EXISTENCE OF A GLOBAL WEAK SOLUTION TO THE NONLINEAR WATERHAMMER PROGRAM.* NEW YORK U. COURANT MATH. AND COMPUTING LAB.*DOE/ER/03077-174.* 1981. 016128 PEACHEY, J.B.*SOME EMPIRICAL OBSERVATIONS ON PROGRAM BEHAVIOUR WITH APPLICATIONS TO PROGRAM RESTRUCTURING.* SASKATCHEWAN U. COMPUTATIONAL SCI.DEPT.*RPT. 82-04.*1982. 016129 PEACHEY, J.B.*TOWARDS A MEASURE OF PROGRAM LOCALITY.* SASKATCHEWAN U. COMPUTATIONAL SCI.DEPT.*RPT. 82-02.*1982. 016131 ROLAND, R.J.*AN INTERACTIVE DECISION SUPPORT SYSTEM FOR TECHNOLOGY TRANSFER PERTAINING TO ORGANIZATION AND MANAGEMENT.* U.S. NAVAL POSTGRADUATE SCH.*NPS52-80-009.* 1980. VOL. 4, NO. 5 05/15/82 016132 Berliner, H.J.* Search vs. knowledge: an analysis from the domain of games.* Carnegie Mellon U. Comp.Sci.Dept.* CMU-CS-82-104.*1981. 016133 Hilfinger, P.N.* Abstraction mechanisms and language design.* Carnegie Mellon U. Comp.Sci.Dept.*CMU-CS-81-147, Ph.D. Thesis. Hilfinger, P.N.*1981. 016134 Kung, H.T.*Why systolic architectures?* Carnegie Mellon U. Comp.Sci.Dept.*CMU-CS-81-148.*1981. 016135 Lai, K.-W.* Functional testing of digital systems.* Carnegie Mellon U. Comp.Sci.Dept.*CMU-CS-81-148, Ph.D. Thesis. Lai, K.-W.*1981. 016136 Leiserson, C.E. Saxe, J.B.*Optimizing synchronous systems.* Carnegie Mellon U. Comp.Sci.Dept.*CMU-CS-82-101.*1982. 016137 Shafer, S.A. Kanade, T.*Using shadows in finding surface orientations.* Carnegie Mellon U. Comp.Sci.Dept.* CMU-CS-82-100.*1982. 016138 Casey, R.G. Nagy, G.* Decision tree design using a probabilistic model.* IBM Watson Res. Center.*RJ 3358.* 1981. 016139 Chow, W.-M.*Allocation of computational elements in multiprocessor systems.* IBM Watson Res. Center.*RC 9152.*1981. 016140 Codd, E.F.* Relational database: a practical foundation for productivity.* IBM Watson Res. Center.*RJ 3339.*1981. 016141 Conrads, D. Kermani, P.*A feasibility study of using store-and-forward data communication networks to transmit digitized speech.* IBM Watson Res. Center.*RC 9157.*1981. 016142 Dolev, D. Strong, H.R.* Polynomial algorithms for multiple processor agreement.* IBM Watson Res. Center.*RJ 3342.* 1981. 016143 Fagin, R.*Types of acyclicity for hypergraphs and relational database schemes.* IBM Watson Res. Center.*RJ 3330.*1981. 016144 Heidelberger, P. Trivedi, K.S.*Analytic queueing models for programs with internal concurrency.* IBM Watson Res. Center.*RC 9194.*1982. 016145 Heidelberger, P. Trivedi, K.S.* Queueing network models for parallel processing with asynchronous tasks.* IBM Watson Res. Center.*RC 9102.*1981. 016146 Hofri, M. Konheim, A.G.* Padded lists revisited.* IBM Watson Res. Center.*RC 9161.*1981. 016147 Itai, A. Konheim, A.G. Rodeh, M.*A sparse table implementation of sorted lists.* IBM Watson Res. Center.* RC 9146.*1981. 016148 Kim, J.*Register to register move generation in register assignment of optimizing compilers.* IBM Watson Res. Center.*RC 9110.*1981. 016149 Konheim, A.G.*A one-way sequence for transaction verification.* IBM Watson Res. Center.*RC 9147.*1981. 016150 Langdon, G.G.*A note on the Ziv Lempel model for compressing individual sequences.* IBM Watson Res. Center.*RJ 3318.*1981. 016151 Mueller, H.R. Keller, H.*Transmission in a synchronous token ring.* IBM Watson Res. Center.*RZ 1122.*1981. 016152 Ni, L.M. Wong, K.Y. Lee, D.T.*A multiple microprocessor system for office image processing.* IBM Watson Res. Center.*RJ 3357.*1981. 016153 Ortiz, E.L. Rivlin, T.J.*Another look at the Chebyshev polynomials.* IBM Watson Res. Center.*RC 9107.*1981. 016154 Radin, G.*The 801 minicomputer.* IBM Watson Res. Center.* RC 9125.*1981. 016155 Sacco, G.M. Schkolnick, M.*A mechanism for managing the buffer pool in a relational database system using the hot set model.* IBM Watson Res. Center.*RJ 3354.*1981. 016156 Sauer, C.H. MacNair, E.A. Kurose, J.F.*The research queueing package: past, present and future.* IBM Watson Res. Center.*RC 9123.*1981. 016157 Savir, J. Roth, J.P.*Testing for, and distinguishing between failures.* IBM Watson Res. Center.*RC 9164.*1981. 016158 Stockmeyer, L.J. Vazirani, V.V.* NP-completeness of some generalizations of the maximum matching problem.* IBM Watson Res. Center.*RC 9160.*1981. 016159 Vishkin, U.*An optimal parallel connectivity algorithm.* IBM Watson Res. Center.*RC 9149.*1981. 016160 Wagner, E.G.*Lecture notes on the algebraic specification of data types (delivered at the Seventh National School for Young Scientists, held in Varna, Bulgaria, September 7-13, 1981).* IBM Watson Res. Center.*RC 9203.*1981. 016161 Wahl, F.M. Wong, K.Y. Casey, R.G.*Block segmentation and text extraction in mixed text/image documents.* IBM Watson Res. Center.*RJ 3356.*1981. 016162 Baccelli, F. Gelenbe, E. Plateau, B.*An end to end approach to the resequencing problem.* INRIA.*Rapport de Recherche 097.*1981. 016163 Gelenbe, E. Mitrani, I.* Control policies in CSMA local area networks: Ethernet controls.* INRIA.*Rapport de Recherche 106.*1981. 016164 Gelenbe, E. Gardy, D.*On the size of projections: I.* INRIA.*Rapport de Recherche 105.*1981. 016165 Herskovits, J.*A two-stage feasible direction algorithm for nonlinearly constrained optimization.* INRIA.*Rapport de Recherche 103.*1981. 016166 Melese, B.* MENTOR: l'environnement PASCAL.* INRIA.*Rapport Technique 005.*1981. 016167 Miranda, S.M.*Aspects of data security in general-purpose data base management systems.* INRIA.*Rapport de Recherche 100.*1981. 016168 Miranda, S.M.*Formalization of DLP (a Decentralized Locking Protocol) using abstract data types.* INRIA.*Rapport de Recherche 099.*1981. 041642 Attardi, G. Simi, M.* Semantics of inheritance and attributions in the description system Omega.* M.I.T. A.I. Lab.*Memo 642.*1981. 041653 Brady, M.*Computational approaches to image understanding.* M.I.T. A.I. Lab.*Memo 653.*1981. 041654 Brady, M. Horn, B.K.P.* Rotationally symmetric operators for surface interpolation.* M.I.T. A.I. Lab.*Memo 654.* 1981. 041662 Bruss, A.R. Horn, B.K.P.* Passive navigation.* M.I.T. A.I. Lab.*Memo 662.*1981. 041651 Chapman, D.*A program testing assistant.* M.I.T. A.I. Lab.* Memo 651.*1981. 040633 Clinger, W.D.*Foundations of actor semantics.* M.I.T. A.I. Lab.*TR-633, Ph.D. Thesis. Clinger, W.D.*1981. 041646 Hillis, W.D.*The connection machine (computer architecture for the new wave).* M.I.T. A.I. Lab.*Memo 646.*1981. 041635 Hollerbach, J.M. Flash, T.* Dynamic interactions between limb segments during planar arm movement.* M.I.T. A.I. Lab.*Memo 635.*1981. 041641 Kornfeld, W.A. Hewitt, C.*The scientific community metaphor.* M.I.T. A.I. Lab.*Memo 641.*1981. 041627 Kornfeld, W.A.*The use of parallelism to implement a heuristic search.* M.I.T. A.I. Lab.*Memo 627.*1981. 041640 Miller, L.*Natural learning.* M.I.T. A.I. Lab.*Memo 640; M.I.T. A.I. Lab.*Logo Memo 61.*1981. 041647 Minsky, M.* Nature abhors an empty vacuum.* M.I.T. A.I. Lab.*Memo 647.*1981. 041628 Moon, D.A.* Chaosnet.* M.I.T. A.I. Lab.*Memo 628.*1981. 041650 Poggio, T. Koch, C. Torre, V.* Microelectronics in nerve cells: dendritic morphology and information processing.* M.I.T. A.I. Lab.*Memo 650.*1981. 040604 Rich, C.* Inspection methods in programming.* M.I.T. A.I. Lab.*TR-604, Ph.D. Thesis. Rich, C.*1981. 041648 Richards, W.A.*A lightness scale from image intensity distributions.* M.I.T. A.I. Lab.*Memo 648.*1981. 040649 Riley, M.D.*The representation of image texture.* M.I.T. A.I. Lab.*TR-649.*1981. 040636 Steele, B.S.K.*An accountable source-to-source transformation system.* M.I.T. A.I. Lab.*TR-636.*1981. 041611 Waters, R.C.* GPRINT: a LISP pretty printer providing extensive user format-control mechanisms.* M.I.T. A.I. Lab.*Memo 611.*1981. 016169 Bechtolsheim, A. Baskett, F. Pratt, V.*The SUN Workstation architecture.* Stanford U. Comp.Sci.Dept.*January 15, 1982 (copyright 1982 - Stanford University). 016170 Pratt, V.R.*The SUN Workstation.* Preprint of a paper delivered at the Office Automation Conference, San Francisco, April 5-7, 1982. 016171 Bechtolsheim, A.* SUN graphics board.* No issuing agency indicated (copies available from: SUN Microsystems Inc./2310 Walsh/Santa Clara, Calif.).*1982 (copyright - VLSI Systems Inc.). 016172 Bechtolsheim, A.* SUN 68000 board.* No issuing agency indicated (copies available from: SUN Microsystems Inc./2310 Walsh/Santa Clara, Calif.).*n.d. 016173 Bechtolsheim, A.* SUN 3 MBit Ethernet board.* No issuing agency indicated (copies available from: SUN Microsystems Inc./2310 Walsh/Santa Clara, Calif.).*1982 (copyright - VLSI Systems Inc.). 016174 Babaoglu, OE.* Virtual storage management in the absence of reference bits.* Cal U., Berkeley. Electronics Res.Lab.* Memo. No. UCB/ERL-M81/92; Cal U., Berkeley. Electronics Res.Lab. PROGRES Group.*Rpt. 81.8, Ph.D. Thesis. Babaoglu, OE.*1981. 016175 Cabrera, L.F. Paris, J.-F.*Comparing user response times on paged and swapped UNIX.* Cal U., Berkeley. Electronics Res.Lab.*Memo. No. UCB/ERL-M81/39; Stanford U. Electronics Res.Lab. PROGRES Group.*Rpt. 81.4.*1981. 016176 Cabrera, L.F.* First order logic syntax and the dynamic behavior of programs.* Cal U., Berkeley. Electronics Res.Lab.*Memo. No. UCB/ERL-M81/48; Cal U., Berkeley. Electronics Res.Lab. PROGRES Group.*Rpt. 81.6.*1981. 016177 Faller, N.*Design and analysis of program behavior models for the reproduction of working set characteristics.* Cal U., Berkeley. Electronics Res.Lab.*Memo. No. UCB/ERL-M81/59; Cal U., Berkeley. Electronics Res.Lab. PROGRES Group.*Rpt. 81.7, Ph.D. Thesis. Faller, N.*1981. 016178 Ferrari, D.*Characterization and reproduction of the referencing dynamics of programs.* Cal U., Berkeley. Electronics Res.Lab.*Memo. No. UCB/ERL-M81/22; Cal U., Berkeley. Electronics Res.Lab. PROGRES Group.*Rpt. 81.1.* 1981. 016179 Lau, E.J. Ferrari, D.* Program restructuring in a multilevel virtual memory.* Cal U., Berkeley. Electronics Res.Lab.*Memo. No. UCB/ERL-M81/26; Cal U., Berkeley. Electronics Res.Lab. PROGRES Group.*Rpt. 81.2.* 1981. 016180 Paris, J.-F.*Application of restructuring techniques to the optimization of program behavior in virtual memory systems.* Cal U., Berkeley. Electronics Res.Lab.*Memo. No. UCB/ERL-M81/44; Cal U., Berkeley. Electronics Res.Lab. PROGRES Group.*Rpt. 81.5, Ph.D. Thesis. Paris, J.-F.*1981. 016181 Arbib, M.A.*Modelling neural mechanisms of visuomotor coordination in frog and toad.* Massachusetts U. Comp. & Info.Sci.Dept.*COINS Tech.Rpt. 82-01.*1982. 016182 McDonald, D.D.* Language production: the source of the dictionary.* Massachusetts U. Comp. & Info.Sci.Dept.* COINS Tech.Rpt. 82-07.*1982. 016183 McDonald, D.D.* Natural language generation as a computational problem: an introduction.* Massachusetts U. Comp. & Info.Sci.Dept.*COINS Tech.Rpt. 81-33.*1981. 016184 Overton, K.J. Arbib, M.A.*The extended branch arrow model of the formation of retino-tectal connections.* Massachusetts U. Comp. & Info.Sci.Dept.*COINS Tech.Rpt. 82-08.*1982 (revised version of COINS Technical Report 81-14). 016185 Bochmann, G.V. Cerny, E. Gagne, M. Jard, C. Leveille, A. Lacaille, C. Maksud, M. Raghunathan, K.S. Sarikaya, B.* Some experience with the use of formal specifications.* Montreal U. Dept. d'Info. et de Recherche Operationnelle.* Publ. 433.*n.d. 016186 Bochmann, G.V. Raynal, M.* Structured specification of communicating systems.* Montreal U. Dept. d'Info. et de Recherche Operationnelle.*Publ. 428.*1982. 016187 Ferland, J.A. Lemaire, B.* Quadratic programming with one constraint and bounded variables.* Montreal U. Dept. d'Info. et de Recherche Operationnelle.*Publ. 429.*1981. 016188 Gecsei, J.* Montreal Keyword System.* Montreal U. Dept. d'Info. et de Recherche Operationnelle.*Publ. 431.*1981. 016189 Jard, C. Bochmann, G.V.*An approach to testing specifications.* Montreal U. Dept. d'Info. et de Recherche Operationnelle.*Publ. 430.*1981. 016190 Stewart, N.F.*Implementation of fixed-route based virtual circuits for large networks.* Montreal U. Dept. d'Info. et de Recherche Operationnelle.*Publ. 432.*1981. 016191 Gregory, R.T.*A Method for and application of error free computation.* Tennessee U. Comp.Sci.Dept.*CS-81-52.* 1981. 016192 Gregory, R.T.*On residue arithmetic with rational operands.* Tennessee U. Comp.Sci.Dept.*CS-80-47.*1980. 016193 Hughes, C.E. Selkow, S.M.*the finite power property for context free languages.* Tennessee U. Comp.Sci.Dept.* CS-80-48.*1980. 016194 O'Kennon, M.R.*A functional language and a theoretical model for implementation.* Tennessee U. Comp.Sci.Dept.* CS-81-51.*1981. 016195 Rao, T.M. Gregory, R.T.*The conversion of Hensel codes to rational numbers.* Tennessee U. Comp.Sci.Dept.*CS-81-49.* 1981. 016196 Rao, T.M.*The problems of conversion, sign detection and maximal set for p-adic number systems.* Tennessee U. Comp.Sci.Dept,.*CS-81-50.*1981. 016197 Christodoulakis, S.*Estimating selectivities in data bases.* Toronto U. Comp. Systems Res. Group.*CSRG-136, Ph.D. Thesis. Christodoulakis, S.*1981. 016198 Graham, M.H.*Satisfying database states.* Toronto U. Comp. Systems Res. Group.*CSRG-137.*1981. 016199 Levesque, H.J.*A formal treatment of incomplete knowledge bases.* Toronto U. Comp. Systems Res. Group.*CSRG-139, Ph.D. Thesis. Levesque, H.J.*1982. 016200 Magalhaes, G.C.*Improving the performance of data base systems.* Toronto U. Comp. Systems Res. Group.*CSRG-138, Ph.D. Thesis. Magalhaes, G.C.*1981. 016201 Agrawal, R. DeWitt, D.J.*Further optimism in optimistic methods of concurrency control.* Wisconsin U. Comp.Sci.Dept.*Tech.Rpt. 470.*1982. 016202 Boral, H. DeWitt, D.J. Bates, D.*A framework for research in database management for statistical analysis.* Wisconsin U. Comp.Sci.Dept.*Tech.Rpt. 465.*1982. 016203 Desautels, E.*Producing Braille with a computer; a guide for people who fear computers.* Wisconsin U. Comp.Sci.Dept.*Tech.Rpt. 469.*1982. 016204 Fujiwara, O. Han, S.-P. Mangasarian, O.L.* Local duality of nonlinear programs.* Wisconsin U. Comp.Sci.Dept.* Tech.Rpt. 463.*1982. 016205 Johnson, D.S. Klug, A.*Optimizing conjunctive queries that contain untyped variables.* Wisconsin U. Comp.Sci.Dept.* Tech.Rpt. 467.*1982. 016206 Kreiss, H.-O. Parter, S.V.*On the swirling flow between rotating coaxial disks: existence and nonuniqueness.* Wisconsin U. Comp.Sci.Dept.*Tech.Rpt. 466.*1982. 016207 Bhat, K.V.S.*Algorithms for finding diagnosability level and t-diagnosis in a network of processors.* Iowa U. Comp.Sci.Dept.*Tech.Rpt. 82-01.*1982. 016208 Geoffroy, A. Norman, D.A.*Ease of tapping the fingers in a sequence depends on the mental encoding.* Cal U., San Diego. Human Info.Proces. Center.*Rpt. 8203.*1982. 016209 Grudin, J.T.*Central control of timing in skilled typing.* Cal U., San Diego. Human Info.Proces. Center.*Rpt. 8202.* 1982. 016210 Grudin, J.T. Larochelle, S.* Digraph frequency effects in skilled typing.* Cal U., San Diego. Human Info.Proces. Center.*CHIP 110.*1982. 016211 Hille, G.*Methoden und Modelle in der Bildsegmentation Eine Uebersicht.* Hamburg U. Fachbereich Informatik.*Bericht nr. 080.*1981. 016212 Jarke, M. Schmidt, J.W.*Evaluation of first-order relational expressions.* Hamburg U. Fachbereich Informatik.*Bericht nr. 078.*1981. 016213 Rieger, N.*Implementation und Vergleich approximativer Verfahren zur Analyse von geschlossenen Wartenetzen.* Hamburg U. Fachbereich Informatik.*Bericht nr. 082.*1981. 016214 Shultz, R.K. Zingg, R.J.*A performance analysis of database computers.* Iowa U. Comp.Sci.Dept.*Tech.Rpt. 82-02.*1982. 016215 Technical Database Corp.*Report on industrial robots in japan, including coverage of the 1981 International Industrial Robot Exhibition and factory tour in Tokyo.*No issuing agency indicated (copies available from: Technical Database Corp./P.O. Box 725/La Canada, California 91011).*1982. VOL. 4, NO. 6 06/01/82 016216 Coughran, W.M. Herriot, J.G.*An algorithm to construct complete interpolating splines.* Bell Labs.* Comp.Sci.Tech.Rpt. 101.*1981. 016217 Holbrook, B.D. Brown, W.S.*A history of computing research at Bell Laboratories (1937-75).* Bell Labs.* Comp.Sci.Tech.Rpt. 099.*1982, 2nd printing. 016218 Johnson, S.C. Ritchie, D.M.*The C language calling sequence.* Bell Labs.*Comp.Sci.Tech.Rpt. 102.*1981. 016219 Kernighan, B.W.*A typesetter independent TROFF.* Bell Labs.*Comp.Sci.Tech.Rpt. 097.*n.d. 016220 Kernighan, B.W.*Why Pascal is not my favorite programming language.* Bell Labs.*Comp.Sci.Tech.Rpt. 100.*1981. 016221 Pavlidis, T.* Contour filling in raster graphics.* Bell Labs.*Comp.Sci.Tech.Rpt. 096.*1981. 016222 Sethi, R.* Control flow aspects of semantics directed compiling.* Bell Labs.*Comp.Sci.Tech.Rpt. 098.*1981. 016223 Van Wyk, C.J.* IDEAL user's manual.* Bell Labs.* Comp.Sci.Tech.Rpt. 103.*1981. 016224 Archer, J. Conway, R.* COPE: a cooperative programming environment.* Cornell U. Comp.Sci.Dept.*Tech.Rpt. 81-459.*1981. 016225 Borodin, A. Von zur Gathen, J. Hopcroft, J.* Fast parallel matrix and GCD computations.* Cornell U. Comp.Sci.Dept.* Tech.Rpt. 82-487.*1982. 016226 Cline, A.K. Conn, A.R. Van Loan, C.*Generalizing the LINPACK condition estimator.* Cornell U. Comp.Sci.Dept.* Tech.Rpt. 81-462.*1981. 016227 Constable, R.L. Zlatin, D.R.*Report on the type theory (V3) of the programming logic PL/CV3.* Cornell U. Comp.Sci.Dept.*Tech.Rpt. 81-454.*1981. 016228 Gries, D. Mills, H.* Swapping sections.* Cornell U. Comp.Sci.Dept.*Tech.Rpt. 81-452.*1981. 016229 Krafft, D.B. Demers, A.J.*Determining logical dependency in a decision procedure for equality.* Cornell U. Comp.Sci.Dept.*Tech.Rpt. 81-458.*1981. 016230 Krol, J.S.*Simple error recovery scheme for optimized LR parsers.* Cornell U. Comp.Sci.Dept.*Tech.rpt. 81-456.* 1981. 016231 Leivant, D.*The optimality of induction as an axiomatization of arithmetic.* Cornell U. Comp.Sci.Dept.* Tech.Rpt. 80-450.*1981. 016232 Lermen, C.W. Schneider, F.B.*Detecting distributed termination when processors can fail.* Cornell U. Comp.Sci.Dept.*Tech.Rpt. 80-449.*1980. 016233 Melville, R.C.* Asymptotic complexity of iterative computations.* Cornell U. Comp.Sci.Dept.*Tech.Rpt. 81-451, Ph.D. Thesis. Melville, R.C.*1981. 016234 Reps, T.*Optimal-time incremental semantic analysis for syntax directed editors.* Cornell U. Comp.Sci.Dept.* Tech.Rpt. 81-453.*1981, revised. 016235 Wu, H. Salton, G.*A comparison of search term weighting: term relevance vs. inverse document frequency.* Cornell U. Comp.Sci.Dept.*Tech.Rpt. 81-457.*1981. 016236 Appel, A. Chess, D.M.* PC by example.* IBM Watson Res. Center.*RA 133.*1981. 016237 Auslander, L. Feig, E. Winograd, S.* Abelian semi-simple algebras and algorithms for the discrete fourier transform.* IBM Watson Res. Center.*RC 9234.*1982. 016238 Bhattacharya, A.K.*The IBM Selective Sequence Electronics Calculator.* IBM Watson Res. Center.*RC 9225.*1982. 016239 Bloom, S.L.* Elgot's analysis of monadic computation.* IBM Watson Res. Center.*RC 9248.*1982. 016240 Bloom, S.L. Thatcher, J.W. Wagner, E.G. Wright, J.B.* Recursion and iteration in continuous theories: the "M-construction".* IBM Watson Res. Center.*RC 9184.* 1981. 016241 Brieger, L. Miranker, W.L.*Three applications of ultra-arithmetic.* IBM Watson Res. Center.*RC 9235.*1982. 016242 Burge, W.H.* ISWIM programming manual.* IBM Watson Res. Center.*RA 129.*1981. 016243 Burkhardt, H. Barbosa, L.C.*Contributions to the application of the Viterbi algorithm.* IBM Watson Res. Center.*RJ 3377.*1982. 016244 Burstein, M.* Partitioning of VLSI networks.* IBM Watson Res. Center.*RC 9180.*1981. 016245 Bux, W. Closs, F. Janson, P.A. Kuemmerle, K. Mueller, H.R. Rothauser, E.H.*A local area communication network based on a reliable token ring system.* IBM Watson Res. Center.* RZ 1117.*1981. 016246 Byrd, R.J. Smith, S.E. de Jong, S.P.*An actor based programming system.* IBM Watson Res. Center.*RC 9204.* 1982. 016247 Carlson, E.D. Rhyne, J.R. Weller, D.L.*A design for a family of display management systems.* IBM Watson Res. Center.*RJ 3372.*1982. 016248 Cullum, J. Willoughby, R.A. Lake, M.*A Lanczos algorithm for computing singular values and vectors of large matrices.* IBM Watson Res. Center.*RC 9166.*1981. 016249 Dolev, D. Trickley, H.*Embedding a tree on a line.* IBM Watson Res. Center.*RJ 3368.*1982. 016250 Ekanadham, K. Nigam, A.*On serializability.* IBM Watson Res. Center.*RC 9257.*1981. 016251 Ercolano, J.L. Rosenthal, S.E.* Graphics compatibility system ( GCS) primer: graphics by example.* IBM Watson Res. Center.*RA 134.*1981. 016252 Ercolano, J.L. Rosenthal, S.E.* RGRAFGA primer: graphics by example.* IBM Watson Res. Center.*RA 135.*1981. 016253 Ferrante, J.* High level language debugging with a compiler.* IBM Watson Res. Center.*RC 9210.*1982. 016254 Fratta, L.*An improved access protocol for data communication bus networks with control wire.* IBM Watson Res. Center.*RJ 3401.*1982. 016255 Gazis, D.C. Mosco, V.* Videotex, the frontier of the information explosion.* IBM Watson Res. Center.*RC 9170.* 1981. 016256 Geihs, K. Kobayashi, H.*Bounds on buffer overflow probabilities in communication systems.* IBM Watson Res. Center.*RC 9275.*1982. 016257 Gupta, U.I. Lee, D.T. Wong, C.K.* Ranking and unranking of b-trees.* IBM Watson Res. Center.*RC 9252.*1982. 016258 Jaffe, J.M.* Distributed multi-destination routing: the constraints of local information.* IBM Watson Res. Center.*RC 9243.*1982. 016259 Jenny, C.J.*On the allocation of computational objects in distributed systems.* IBM Watson Res. Center.*RZ 1123, Ph.D. Thesis. Jenny, C.J. (Zurich University. Institut fuer Informatik).*1982. 016260 Kobayashi, H.*Communication network design and control algorithms - a survey.* IBM Watson Res. Center.*RC 9233.* 1982. 016261 Kroll, Y. Levy, H. Markowitz, H.M.* Mean variance versus direct utility maximization.* IBM Watson Res. Center.*RC 9176.*1981. 016262 Kuemmerle, K.* Local area communication networks - an overview.* IBM Watson Res. Center.*RZ 1127.*1982. 016263 Lewis, C.*Using the "thinking-aloud" method in cognitive interface design.* IBM Watson Res. Center.*RC 9265.* 1982. 016264 Lomet, D.B. Carter, W.C. Ellozy, H. Fortune, S. Kosinski, P.R. Markstein, P.*A study of provably secure operating systems.* IBM Watson Res. Center.*RC 9239.*1982. 016265 Lum, V.Y. Choy, D.M. Shu, N.C.* OPAS: an office procedure automation system.* IBM Watson Res. Center.*RJ 3394.* 1982. 016266 Nigel, G. Martin, N. Langdon, G.G. Jr. Todd, S.J.P.* Arithmetic codes for constrained channels.* IBM Watson Res. Center.*RJ 3381.*1982. 016267 Paul, G.*Studies in vector architecture.* IBM Watson Res. Center.*RC 9245.*1982. 016268 Raimondi, D.L. Alger, E.A. Martin, R.W. Swalen, J.D.*The automation of laboratory operations using a distributed computing environment.* IBM Watson Res. Center.*RJ 3387.* 1982. 016269 Rivlin, T.J.*On Walsh equiconvergence.* IBM Watson Res. Center.*RC 9260.*1982. 016270 Roth, J.P.*An application of the D-algorithm to minimization.,* IBM Watson Res. Center.*RC 9219.*1982. 016271 Roth, J.P. Tsai, M.Y. Woo, L.S.* Pass transistor circuit failure analysis.* IBM Watson Res. Center.*RC 9249.*1982. 016272 Rudin, H.* Validation of a token ring protocol.* IBM Watson Res. Center.*RZ 1119.*1981. 016273 Rudin, H. West, C.H.*A validation technique for tightly-coupled protocols.* IBM Watson Res. Center.*RZ 1114.*1981. 016274 Schkolnick, M. Tiberio, P.*A note on estimating the maintenance cost in a relational database.* IBM Watson Res. Center.*RJ 3327.*1981. 016275 Simons, B. Sipser, M.*On scheduling unit time jobs with multiple release time/deadline intervals.* IBM Watson Res. Center.*RJ 3236.*1981. 016276 Sporer, A.H.*The impact of digital storage on micrographic storage.* IBM Watson Res. Center.*RJ 3383.*1982. 016277 Todd, S.J.P. Langdon, G.G. Jr. Martin, G.N.N.*A general fixed-rate arithmetic coding method for constrained channels.* IBM Watson Res. Center.*RJ 3382.*1982. 016278 Visvanathan, V. Hachtel, G.D.*An optimization based approach to model simplification.* IBM Watson Res. Center.*RC 9175.*1981. 016279 Wahl, F.M.*A new distance mapping and its use for shape measurement on binary patterns.* IBM Watson Res. Center.* RJ 3361.*1982. 016280 Wegman, M. Alberga, C.N.* Parsing for a structural editor (part ii).* IBM Watson Res. Center.*RC 9197.*1982. 016281 Wong, W.W. Wong, C.K.* Minimum k-hamiltonian graphs.* IBM Watson Res. Center.*RC 9254.*1982. 016282 Yu, P.S.* Interconnection structures of backend storage networks.* IBM Watson Res. Center.*RC 9165.*1981. 016283 MacEwen, G.H.* Specification prototyping.* Queen's U. Computing & Info.Sci.Dept.*Tech.Rpt. 82-135.*1982. 016284 Meijer, H.*An exponential lower bound on the complexity of the cryptographic knapsack problem.* Queen's U. Computing & Info.Sci.Dept.*Tech.Rpt. 82-137.*1982. 016285 Pennycook, B.W.*Computer music at Queen's University.* Queen's U. Computing & Info.Sci.Dept.*Tech.Rpt. 82-136.* 1982. 016286 Amarel, S.*Expert behavior and problem representations.* Rutgers U. Comp.Sci.Res.Lab.*CBM-TR-126.*1982. 016287 Bresina, J.L.*An interactive planner that creates a structured, annotated trace of its operation.* Rutgers U. Comp.Sci.Res.Lab.*CBM-TR-123.*1981. 016288 Gerasoulis, A.* Nystrom's interpolation formula in the solution of singular integral equations discretized by the Gauss Jacobi quadrature.* Rutgers U. Comp.Sci.Dept.* DCS-TR-111.*1982. 016289 Goldberg, R.N.* Software design issues in the architecture and implementation of distributed text editors.* Rutgers U. Comp.Sci.Dept.*DCS-TR-110, Ph.D. Thesis. Goldberg, R.N.*1982. 016290 Hall, J.S.*System design and programming methodology for a CAM based general purpose computer.* Rutgers U. Comp.Sci.Res.Lab.*LCSR-TR-016.*1981. 016291 Lafue, G.M.E.* Semantic integrity dependencies and delayed integrity checking.* Rutgers U. Comp.Sci.Res.Lab.* LCSR-TR-026.*1982. 016292 Lockman, A. Klappholz, D.*The control of inferencing in natural language understanding.* Rutgers U. Comp.Sci.Dept.*DCS-TR-114.*1982. 016293 McCarty, L.T. Sridharan, N.S.*A computational theory of legal argument.* Rutgers U. Comp.Sci.Res.Lab.*LRP-TR-013.* 1982. 016294 Mitchell, T.M.* AI research at Rutgers.* Rutgers U. Comp.Sci.Res.Lab.*LCSR-TR-025.*1982. 016295 Mitchell, T.M.*Toward combining empirical and analytical methods for inferring heuristics.* Rutgers U. Comp.Sci.Res.Lab.*LCSR-TR-027.*1982. 016296 Paige, R. Koenig, S.* Finite differencing of computable expressions.* Rutgers U. Comp.Sci.Res.Lab.*LCSR-TR-008.* 1981, revised. 016297 Politakis, P. Weiss, S.M.*Designing consistent knowledge bases: an approach to expert knowledge acquisition (working paper).* Rutgers U. Comp.Sci.Res.Lab.* CBM-TR-113.*1980. 016298 Sridharan, N.S.* AIMDS: applications and performance enhancements.* Rutgers U. Comp.Sci.Res.Lab.*CBM-TM-093.* 1982. 016299 Sridharan, N.S. Bresina, J.L.* Plan formation in large, realistic domains.* Rutgers U. Comp.Sci.Res.Lab.* CBM-TR-127.*1982. 016300 Cox, M.G.*Practical spline approximation.* U.K. National Physical Lab. Info. Technology and Computing Div.*DITC 1/82.*1982. 016301 Ferriss, D.H.*Numerical determination of the configuration of an underwater umbilical subjected to steady hydrodynamic loading.* U.K. National Physical Lab. Info. Technology and Computing Div.*DITC 2/82.*1982. 016302 Symm, G.T.*A critical evaluation of various methods for the solution of Laplace's equation.* U.K. National Physical Lab. Num.Anal. & Comp.Sci.Div.*DNACS 54/81.*1981. 016303 Lai, H.C. Muroga, S.* Logic networks of carry-save adders.* Illinois U. Comp.Sci.Dept.*UIUCDCS-R-82-1080.*1982. 016304 McKendry, M.S.*Language mechanisms for context switching and protection in level structured operating systems.* Illinois U. Comp.Sci.Dept.*UIUCDCS-R-81-1078, Ph.D. Thesis. McKendry, M.S.*1981. 016305 Smolarski, D.C.*Optimum semi-iterative methods for the solution of any linear algebraic system with a square matrix.* Illinois U. Comp.Sci.Dept.*UIUCDCS-R-81-1077, Ph.D. Thesis. Smolarski, D.C.*1981. 016306 Cristian, F.* Exception handling and software fault tolerance.* Newcastle upon Tyne U. Computing Lab.*No. 173.*1982. 016307 Shrivastava, S.K. Panzieri, F.*The design of a reliable remote procedure call mechanism.* Newcastle upon Tyne U. Computing Lab.*No. 171.*1981. 016308 Treleaven, P.C.* VLSI processor architectures.* Newcastle upon Tyne U. Computing Lab.*No. 172.*1982. 016309 Bieger, G.R. Glock, M.D.*The information content of picture text assembly instructions.* Cornell U. Education Dept.* Tech.Rpt. 05.*1982. 024900 Blum, R.L.*Discovery and representation of causal relationships from a large time-oriented clinical database: the RX Project.* Stanford U. Comp.Sci.Dept.* STAN-CS-82-900, Ph.D. Thesis. Blum, R.L.*1982. 016310 Clifford, J. Warren, D.S.* Formal semantics for time in databases.* SUNY, Stony Brook. Comp.Sci.Dept.*Tech.Rpt. 81/025.*1981, revised. 016311 Culik, K.*Proving optimal relative utilization of resources and other properties of parallel programs.* Wayne State U. Comp.Sci.Dept.*CSC-82-010.*1982. 016312 Dahlquist, G.*On the local and global errors of one-leg methods.* Royal Inst. of Tech., Stockholm. Num.Anal. & Computing Sci.Dept.*TRITA-NA-8110.*1981. 016313 Gifford, D.K.* Information storage in a decentralized computer system.* Xerox. Palo Alto Res. Center.* CSL-81-08, Ph.D. Thesis. Gifford, D.K.*1982, revised. 016314 Hu, Y.-S.* Global estimation of the Lebesque constant for polynomial interpolation on an equidistant grid.* Royal Inst. of Tech., Stockholm. Num.Anal. & Computing Sci.Dept.*TRITA-NA-8203.*1982. 016315 Jayaramamurthy, S.N. Jain, R.*An approach for the segmentation of textured dynamic scenes.* Wayne State U. Comp.Sci.Dept.*CSC-82-009.*1982. 016316 Kambayashi, Y.*Proceedings of the Conference on Consecutive Retrieval Property: Theory and Applications, Warsaw, August 18-20, 1981. Parts 1-2. Edited by Yahiko Kambayashi.* Polish Academy of Sciences. Inst. of Comp.Sci.*ICS PAS Rpt. No. 438.*1981. 2 volumes. 024903 McCarthy, J.* Coloring maps and the Kowalski doctrine.* Stanford U. Comp.Sci.Dept.*STAN-CS-82-903; Stanford U. Comp.Sci.Dept. A.I. Lab.*AIM-346.*1982. 016318 McCreight, E.M.* Priority search trees.* Xerox. Palo Alto Res. Center.*CSL-81-05.*1982. 016319 Mann, W.C. Bates, M. Grosz, B.J. McDonald D.D. McKeown, K.R. Swartout, W.R.* Text generation: the state of the art and the literature.* Southern Cal U. Info.Sci.Inst.* ISI/RR-81-101.*1981. 024902 Manna, Z. Waldinger, R.*Special relations in program-synthetic deduction.* Stanford U. Comp.Sci.Dept.* STAN-CS-82-902; Stanford U. Comp.Sci.Dept. A.I. Lab.* AIM-345.*1982. 016322 Sakarovitch, J. Nishida, T. Kobuchi, Y.* Recurrent words for substitution.* Kyoto U. Res.Inst.Math.Sci.*RIMS-396.* 1982. VOL. 4, NO. 7 06/23/82 016323 Bergstra, J.A. Klop, J.W.* Initial algebra specifications for parametrized data types.* Mathematisch Centrum.*IW 186/81.*1981. 016324 Brent, R.P. Lune, J. van de. Te Riele, H.J.J. Winter, D.T.* On the zero of the Riemann zeta function.* Mathematisch Centrum.*NW 121/82.*1982. 016325 Brunner, H. Te Riele, H.J.J.*Volterra-type integral equations of the second kind with non-smooth solutions: high-order methods based on collocation techniques.* Mathematisch Centrum.*NW 118/82.*1982. 016326 Hemker, P.W.*Mixed defect correction iteration for the accurate solution of the convection diffusion equation.* Mathematisch Centrum.*NW 122/82.*1982. 016327 Hemker, P.W.*An accurate method without directional bias for the numerical solution of a 2-D elliptic singular perturbation problem.* Mathematisch Centrum.*NW 117/81.* 1981. 016328 Lenstra, A.K.* Lattices and factorization of polynomials.* Mathematisch Centrum.*IW 190/81.*1981. 016329 Meertens, L.G.L.T.*Definition of an abstract ALGOL 68 machine.* Mathematisch Centrum.*IW 188/81.*1981. 016330 Meertens, L.G.L.T.*Draft proposal for the B programming language.* Mathematisch Centrum.*1981. 016331 Meertens, L.G.L.T. Vliet, J.C. van.*On the MC ALGOL 68 compiler.* Mathematisch Centrum.*IW 189/81.*1981. 016332 Noot, H.* Structured text formatting.* Mathematisch Centrum.*IW 191/82.*1982. 016333 Sint, H.J.* MIDL - a microinstruction description language.* Mathematisch Centrum.*IW 187/81.*1981. 016334 Vries, H.B. de.*Two-step splitting methods for semi-discrete second order hyperbolic partial differential equations.* Mathematisch Centrum.*NW 120/82.*1982. 016335 Wolff, H.* Multiple grid method for the calculation of potential flow around 3-D bodies.* Mathematisch Centrum.* NW 119/82.*1982. 016336 Cottle, R.W.*Application of a block successive overrelaxation method to a class of constrained matrix problems.* Stanford U. O.R. Dept. Systems Optimization Lab.*SOL 81-20.*1981. 016337 Friedman, J.H. Wright, M.H.*An adaptive importance sampling procedure.* Stanford U. O.R. Dept. Systems Optimization Lab.*SOL 81-23.*1981. 016338 Gill, P.E. Murray, W. Saunders, M.A. Wright, M.H.*A procedure for computing forward-difference intervals for numerical optimization.* Stanford U. O.R. Dept. Systems Optimization Lab.*SOL 81-25.*1981. 016339 Hu, T.C. Shing, M.T.*Multi-terminal flows in outerplanar networks.* Stanford U. O.R. Dept. Systems Optimization Lab.*SOL 81-19.*1981. 016340 McCormick, S.T.*Optimal approximation of sparse Hessians and its equivalence to a graph coloring problem.* Stanford U. O.R. Dept. Systems Optimization Lab.*SOL 81-22.*1981. 016341 Tovey, C.A.*Polynomial local improvement algorithms in combinatorial optimization.* Stanford U. O.R. Dept. Systems Optimization Lab.*SOL 81-21.*1981. 016342 Findler, N.V. Brown, J.E. Lo, R. Han, Y.Y.*A module to estimate numerical values of hidden variables for expert systems.* SUNY, Buffalo. Comp.Sci.Dept.*Tech.Rpt. 190; SUNY, Buffalo. Comp.Sci.Dept. Comp. Studies of Strategies Group.*Tech.Rpt. 004.*1981. 016343 Findler, N.V. Morgado, E.* Morph fitting -- an effective technique of approximation.* SUNY, Buffalo. Comp.Sci.Dept.*Tech.Rpt. 188; SUNY, Buffalo. Comp.Sci.Dept. Comp. Studies of Strategies Group.* Tech.Rpt. 002.*1981. 016344 Findler, N.V. Mazur, N. McCall, B.*A note on computing the asymptotic form of a limited sequence of decision trees.* SUNY, Buffalo. Comp.Sci.Dept.*Tech.Rpt. 189; SUNY, Buffalo. Comp.Sci.Dept. Comp. Studies of Strategies Group.*Tech.Rpt. 003.*1981. 016345 Findler, N.V.*An overview of the quasi-optimizer system.* SUNY, Buffalo. Comp.Sci.Dept.*Tech.Rpt. 196; SUNY, Buffalo. Comp.Sci.Dept. Comp. Studies of Strategies Group.*Tech.Rpt. 007.*1982. 016346 Findler, N.V.*A preliminary report on a multi-level learning technique using production systems.* SUNY, Buffalo. Comp.Sci.Dept.*Tech.Rpt. 187; SUNY, Buffalo. Comp.Sci.Dept. Comp. Studies of Strategies Group.* Tech.Rpt. 001.*1981. 016347 Findler, N.V.*Toward a theory of strategies.* SUNY, Buffalo. Comp.Sci.Dept.*Tech.Rpt. 194; SUNY, Buffalo. Comp.Sci.Dept. Comp. Studies of Strategies Group.* Tech.Rpt. 006.*1981. 016348 Moriya, S.*An algebraic structure theory of rule sets I: a formalization of both production systems and decision tables.* SUNY, Buffalo. Comp.Sci.Dept.*Tech.Rpt. 195.* 1982. 016349 Shubin, H.* Inference and control in multiprocessing environments.* SUNY, Buffalo. Comp.Sci.Dept.*Tech.Rpt. 186.*1981. 016350 Sicherman, G.L.*The advice-taker/inquirer.* SUNY, Buffalo. Comp.Sci.Dept.*Tech.Rpt. 193; SUNY, Buffalo. Comp.Sci.Dept. Comp. Studies of Strategies Group.* Tech.Rpt. 005.*1981. 016351 Srihari, R.K.*Combining path-based and node-based inference in SNEPS.* SUNY, Buffalo. Comp.Sci.Dept.*Tech.Rpt. 183.* 1981. 016352 Srihari, S.N. Hull, J.J. Choudhari, R.*An algorithm for integrating diverse knowledge sources in text recognition.* SUNY, Buffalo. Comp.Sci.Dept.*Tech.Rpt. 192.*1981. 016353 Srihari, S.N. Hull, J.*Experiments in text recognition with binary n-gram and viterbi algorithms.* SUNY, Buffalo. Comp.Sci.Dept.*Tech.Rpt. 184.*1981. 016354 Srihari, S.N. Yau, M.-M.*A hierarchical data structure for multidimensional digital images.* SUNY, Buffalo. Comp.Sci.Dept.*Tech.Rpt. 185.*1981. 016355 Srihari, S.N. Bozinovic, R.*A string correction algorithm for cursive script recognition.* SUNY, Buffalo. Comp.Sci.Dept.*Tech.Rpt. 181.*1981. 016356 Broy, M. Pepper, P. Wirsing, M.*On the algebraic definition of programming languages.* Technische Universitaet Muenchen. Institut fuer Informatik.*TUM-I8204.*1982. 016357 Castrigiano, D.P.L.* Causal transformations of Wightman localizations.* Technische Universitaet Muenchen. Institut fuer Mathematik.*TUM-M8112.*1981. 016358 Eichholz, S.*Zur Verteilung von nichtsequentiellen Programmen auf Rechnernetze unter Beruecksichtigung der Realisierbarkeit.* Technische Universitaet Muenchen. Institut fuer Informatik.*TUM-I8205.*1982. 016359 Friede, D.* Partitioned context free grammars.* Technische Universitaet Muenchen. Institut fuer Informatik.* TUM-I8115.*1981. 016360 Groeger, D.* Beitraege zur Geometrie und Algebra, Nr. 7: Ueber Angeordnete Fastkoerper, von D. Groeger.* Technische Universitaet Muenchen. Institut fuer Mathematik.*TUM-M8201.*1982. 016361 Lasser, R.* Orthogonal polynomials and hypergroups: contributions to analysis and probability theory.* Technische Universitaet Muenchen. Institut fuer Mathematik.*TUM-M8110.*1981. 016362 Laut, A.*Von abstrakter Syntax zu verketteten Baeumen - Entwicklung einer Datenstruktur fuer die Programm-Manipulation.* Technische Universitaet Muenchen. Institut fuer Informatik.*TUM-I8114.*1981. 016363 Riedel, N.*An example on strong shift equivalence of positive integral matrices.* Technische Universitaet Muenchen. Institut fuer Mathematik.*TUM-M8203.*1982. 016364 Tempelmeier, T.*Antwortzeitverhalten eines Echtzeit-Rechensystems bei Auslagerung des Betriebssystemkerns auf einen eigenen Prozessor. Teil 2: Messergebnisse.* Technische Universitaet Muenchen. Institut fuer Informatik.*TUM-I8201.*1982. 016365 Vogel, H.*A term calculus of deterministic data flow nets.* Technische Universitaet Muenchen. Institut fuer Informatik.*TUM-I8203.*1982. 016366 Wildgruber, R.*ROMEO: ein Mehrrechner-Echtzeit-Betriebssystem.* Technische Universitaet Muenchen. Institut fuer Informatik.* TUM-I8116.*1981. 016371 Guttman, A. Stonebraker, M.*Using a relational database management system for computer aided design data.* Cal U., Berkeley. Electronics Res.Labs.*Memo. no. UCB/ERL-M82/37.*1982. 016372 Hawthorne, P. Stonebraker, M.*The use of technological advances to enhance data management system performance.* Cal U., Berkeley. Electronics Res.Lab.*Memo. no. UCB/ERL-M79/03.*1979. 016375 Rowe, L.A. Shoens, K.A.*A form application development system.* Cal U., Berkeley. Electronics Res.Lab.*Memo. no. UCB/ERL-M82/38.*1982. 016376 Skeen, D.*A decentralized termination protocol.* Cal U., Berkeley. Electronics Res.Lab.*Memo. no. UCB/ERL-M81/50.* 1981. 016378 Skeen, D.* Nonblocking commit protocols.* Cal U., Berkeley. Electronics Res.Lab.*Memo. no. UCB/ERL-M81/11.* 1981. 016379 Stonebraker, M.*Application of artificial intelligence techniques to database systems.* Cal U., Berkeley. Electronics Res.Lab.*Memo. no. UCB/ERL-M82/31.*1982. 016380 Stonebraker, M. Stettner, H. Kalash, J. Guttman, A. Lynn, N.* Document processing in a relational data base system.* Cal U., Berkeley. Electronics Res.Lab.*Memo. no. UCB/ERL-M82/32.*1982. 016384 Stonebraker, M. Woodfill, J. Ranstrom, J. Murphy, M. Meyer, M. Allman, E.*Performance enhancements to a relational data base system.* Cal U., Berkeley. Electronics Res.Lab.*Memo. no. UCB/ERL-M81/62.*1982, revised. 016386 Stonebraker, M. Kalash, J.* TIMBER: a sophisticated relational browser.* Cal U., Berkeley. Electronics Res.Lab.*Memo. no. UCB/ERL-M81/94.*1982, revised. 016388 Woodfill, J. Siegal, P. Ranstrom, J. Meyer, M. Allman, E.* INGRES version 7 reference manual.* Cal U., Berkeley. Electronics Res.Lab.*Memo. no. UCB/ERL-M81/61.*1981. 016389 Davis, L.S. Kunii, T.L.* Pattern databases.* Tokyo U. Info.Sci.Dept.*Tech.Rpt. 81-05.*1981. 016390 Enomoto, H. Yoshizawa, M.*On block-schematic Steiner systems.* Tokyo U. Info.Sci.Dept.*Tech.Rpt. 81-06.*1981. 016391 Enomoto, H.*The linear arboricity of 5-regular graphs.* Tokyo U. Info.Sci.Dept.*Tech.Rpt. 81-19.*1981. 016392 Imori, M. Yamada, H.*A noninjective mapping of periodic sequences by cellular automata.* Tokyo U. Info.Sci.Dept.* Tech.Rpt. 81-11.*1981. 016393 Ishikawa, C. Sakamura, K. Maekawa, M.* Adaptation and personalization of vlsi-based computer architecture.* Tokyo U. Info.Sci.Dept.*Tech.Rpt. 81-22.*1981. 016394 Kawai, S.*On topology preservation property of local parallel operations.* Tokyo U. Info.Sci.Dept.*Tech.Rpt. 81-16.*1981. 016395 Kawai, S.*A proof method with program and data structure transformation.* Tokyo U. Info.Sci.Dept.*Tech.Rpt. 81-03.*1981. 016396 Kitagawa, H. Kunii, T.L.* APAD: application adaptable database system - its architecture and design.* Tokyo U. Info.Sci.Dept.*Tech.Rpt. 81-04.*1981. 016397 Kotoh, K. Yamada, H.*An incompleteness problem on a tessellation automaton with injective functions.* Tokyo U. Info.Sci.Dept.*Tech.Rpt. 81-10.*1981. 016398 Sasaki, T. Murao, H.*Efficient Gaussian elimination method for symbolic determinants and linear systems.* Tokyo U. Info.Sci.Dept.*Tech.Rpt. 81-09.*1981. 016399 Sato, M.*Theory of symbolic expressions, I.* Tokyo U. Info.Sci.Dept.*Tech.Rpt. 81-13.*1981. 110781 de Boor, C. deVore, T.*Approximation by smooth multivariate splines.* Wisconsin U. Math.Res. Center.*MRC Tech.Sum.Rpt. 2319.*1982. Microfiche. 110782 de Boor, C. Hoellig, K.*B-splines from parallelepipeds.* Wisconsin U. Math.Res. Center.*MRC Tech.Sum.Rpt. 2320.* 1982. Microfiche. 110783 de Boor, C. Jia, R.-Q. Pinkus, A.*Structure of invertible (bi)infinite totally positive matrices.* Wisconsin U. Math.Res. Center.*MRC Tech.Sum.Rpt. 2311.*1981. Microfiche. 110787 Dyn, N.*A new class of Hermite Birkhoff quadrature formulas of Gaussian type.* Wisconsin U. Math.Res. Center.*MRC Tech.Sum.Rpt. 2314.*1981. Microfiche. 110788 Dyn, N. Ferguson, W.E.*The numerical solution of a class of constrained minimization problems.* Wisconsin U. Math.Res. Center.*MRC Tech.Sum.Rpt. 2340.*1982. Microfiche. 110791 Fujiwara, O. Han, S.-P. Mangasarian, O.L.*Local duality of nonlinear programs.* Wisconsin U. Math.Res. Center.*MRC Tech.Sum.Rpt. 2329.*1982. Microfiche. 110794 Jia, R.-Q.*L subscript infinity upper bound of L subscript 2 projections onto splines at a geometric mesh.* Wisconsin U. Math.Res. Center.*MRC Tech.Sum.Rpt. 2335.* 1982. Microfiche. 110795 Jia, R.-Q.*On a conjecture of C.A. Micchelli concerning cubic spline interpolation at a biinfinite knot sequence.* Wisconsin U. Math.Res. Center.*MRC Tech.Sum.Rpt. 2334.* 1982. Microfiche. 110811 Markowich, P.* Difference methods for parabolic history value problems.* Wisconsin U. Math.Res. Center.*MRC Tech.Sum.Rpt. 2346.*1982. Microfiche. 110818 Schoenberg, I.J.*A new approach to Euler splines II.* Wisconsin U. Math.Res. Center.*MRC Tech.Sum.Rpt. 2313.* 1981. Microfiche. 016400 Chinosi, C. Della Croce, L. Marini, L.D. Sacchi, G. Scapolla, T.* PIRE: a library of programs for plate bending problems - users manual.* Consiglio Nazionale delle Ricerche, Pavia, Italy. Istituto de Analisi Numerica.*Pubblicazioni n. 306.*1981. 016401 Gazzaniga, G. Ironi, L.*LANFIT: un package grafico interattivo per l'approxximazione de dati sperimentali.* Consiglio Nazionale delle Ricerche, Pavia, Italy. Istituto de Analisi Numerica.*Pubblicazioni n. 262.*1980. 016402 Gifford, D.K.* Cryptographic sealing for information secrecy and authentication.* Xerox. Palo Alto Res. Center.*CSL-82-01.*1982. 024888 Gropp, W.D.*Numerical solution of transport equations.* Stanford U. Comp.Sci.Dept.*STAN-CS-81-888, Ph.D. Thesis. Gropp, W.D.*1981. 104 pages. 016403 Gueting, R.H.*An optimal contour algorithm for iso-oriented rectangles.* McMaster U. Comp.Sci. Unit.*Comp.Sci. Tech.Rpt. no. 82-CS-03.*1982. 016404 Han, S.-P. Mangasarian, O.L.*Conjugate cone characterization of positive definite and semidefinite matrices.* Wisconsin U. Comp.Sci.Dept.*Tech.Rpt. 471.* 1982. 016405 Iwasaki, N.* Cauchy problems for effectively hyperbolic equations (a special case).* Kyoto U. Res.Inst.Math.Sci.* RIMS-398.*1982. 016406 Jones, D.W.* Machine independent SMAL: a symbolic macro assembly language.* Iowa U. Comp.Sci.Dept.*Tech.Rpt. 82-03.*1982. 016407 Klug, A.* ABE: a query language for constructing aggregates-by-example.* Wisconsin U. Comp.Sci.Dept.* Tech.Rpt. 475.*1982. 016408 Klug, A.* Access paths in the "ABE" statistical query facility.* Wisconsin U. Comp.Sci.Dept.*Tech.Rpt. 474.* 1982. 016409 Lursinsap, C.*Automatic layout generation for if and case structures.* Illinois U. Comp.Sci.Dept.* UIUCDCS-R-82-1082.*1982. 016410 Niezgodka, M. Pawlow, I. Visintin, A.*On multi-phase Stefan type problems with nonlinear flux at the boundary in several space variables.* Consiglio Nazionale delle Ricerche, Pavia, Italy. Istituto di Analisi Numerica.* Pubblicazioni n. 293.*1981. 016412 Vilnrotter, F.M.D.* Structural analysis of natural textures.* Southern Cal U. E.E. Dept. & Comp.Sci.Dept. Intelligent Systems Group.* USCISG 100; USCIPI 1040, Ph.D. Thesis. Vilnrotter, F.M.D.*1981. 016413 Yokomori, T. Wood, D.*Some representation theorems in terms of L languages.* McMaster U. Comp.Sci. Unit.*Comp.Sci. Tech.Rpt. no. 82-CS-02.*1982. VOL. 4, NO. 8 07/15/82 016414 Chazelle, B.*The bottom-left bin-packing heuristic.* Carnegie Mellon U. Comp.Sci.Dept.*CMU-CS-82-104.*1981. 016415 Chazelle, B.*An improved algorithm for fixed-radius neighbor problem.* Carnegie Mellon U. Comp.Sci.Dept.* CMU-CS-82-109.*1982. 016416 Chazelle, B.*The polygon containment problem.* Carnegie Mellon U. Comp.Sci.Dept.*CMU-CS-82-106.*1981. 016417 Leiserson, C.E.*Area-efficient VLSI computation.* Carnegie Mellon U. Comp.Sci.Dept.*CMU-CS-82-108, Ph.D. Thesis. Leiserson, C.E.*1981. 016418 McDonald, D.B.*Understanding noun compounds.* Carnegie Mellon U. Comp.Sci.Dept.*CMU-CS-82-102, Ph.D. Thesis. McDonald, D.B.*1982. 016419 Sproull, R.F. Sutherland, I.E. Thompson, A. Gupta, S. Minter, C.*The 8 by 8 display.* Carnegie Mellon U. Comp.Sci.Dept.*CMU-CS-82-105.*1981. 016420 Berestycki, H. Fernandez Cara, E. Glowinski, R.*A numerical study of some questions in vortex rings theory.* INRIA.* Rapport de Recherche 116.*1982. 016421 Bernadou, M. Ducatel, Y.* Approximation of general arch problems by straight beam elements.* INRIA.*Rapport de Recherche 120.*1982. 016422 Boudol, G. Kott, L.* Recursion induction principle revisited.* INRIA.*Rapport de Recherche 115.*1982. 016423 Gardarin, G. Melkanoff, M.* Concurrency control principles in distributed and centralized databases.* INRIA.* Rapport de Recherche 113.*1982. 016424 Gardarin, G. Valduriez, P.* Join and semi-join algorithms for a multiprocessor database machine.* INRIA.*Rapport Technique 011.*1982. 016425 Gelenbe, E. Gardy, D.*On the size of projections: II. The case of a single functional dependency.* INRIA.*Rapport de Recherche 117.*1982. 016426 Herskovits, J.*A two-stage feasible direction algorithm including variable metric techniques for nonlinear optimization problems.* INRIA.*Rapport de Recherche 118.* 1982. 016427 Janet, E.*Analyse du langage employe dans les communications d'un systeme de controle.* INRIA.*Rapport Technique 012.*1982. * 016428 Katai, O.* Completeness and the expressive power of nexttime temporal logical system by semantic tableau method.* INRIA.*Rapport de Recherche 109.*1981. 016429 Lichnewsky, A.*Sur la resolution de systemes lineaires issus de la methode des elements finis par une machine "multiprocesseur".* INRIA.*Rapport de Recherche 119.* 1982. 016430 Samson, C.* Stability analysis of adaptively controlled not-necessarily minimum phase systems with disturbances.* INRIA.*Rapport de Recherche 110.*1982. 016431 Schroeder, A.*Outils de mesures de programmes PASCAL: manuel d'utilisation.* INRIA.*Rapport Technique 010.* 1982. 016432 Church, K. Patil, R.*Coping with syntactic ambiguity or how to put the block in the box on the table.* M.I.T. Lab. for Comp.Sci.*TM-216.*1982. 016433 Elias, P.* Minimax optimal universal codeword sets.* M.I.T. Lab. for Comp.Sci.*TM-212.*1982. 016434 Greif, I.*Cooperative office work, teleconferencing and calendar management: a collection of papers (presented at conferences).* M.I.T. Lab. for Comp.Sci.*TM-218.*1982. 016435 Grief, I.* PCAL: a personal calendar.* M.I.T. Lab. for Comp.Sci.*TM-213.*1982. 016436 Leiserson, C.E. Saxe, J.B.*Optimizing synchronous systems.* M.I.T. Lab. for Comp.Sci.*TM-215.*1982. 016437 Meyer, A.R. Mitchell, J.C.* Termination assertions for recursive programs: completeness and axiomatic definability.* M.I.T. Lab. for Comp.Sci.*TM-214.*1982. 016492 Wright, K.D.*A file transfer program for a personal computer.* M.I.T. Lab. for Comp.Sci.*TM-217.*1982. 020259 Bryant, R.E.*A switch-level simulation model for integrated logic circuits.* M.I.T. Lab. for Comp.Sci.*TR-259, Ph.D. Thesis. Bryant, R.E.*1981. 020257 Cesari, C.A.*Application of data flow architecture to computer music synthesis.* M.I.T. Lab. for Comp.Sci.* TR-257.*1981. 020273 Estrin, D.L.* Data communications via cable television networks: technical and policy considerations.* M.I.T. Lab. for Comp.Sci.*TR-273.*1982. 020256 Faust, G.G.*Semiautomatic translation of COBOL to HIBOL.* M.I.T. Lab. for Comp.Sci.*TR-256.*1981. 020268 Guttag, J.V. Kapur, D. Musser, D.R.* Derived pairs, overlap closures, and rewrite dominoes: new tools for analyzing term rewriting systems.* M.I.T. Lab. for Comp.Sci.* TR-268.*n.d. 020269 Kanellakis, P.C.*The complexity of concurrency control for distributed databases.* M.I.T. Lab. for Comp.Sci.* TR-269, Ph.D. Thesis. Kanellakis, P.C.*1981. 020254 Ruth, G. Alter, S. Martin, W.*A very high level language for business data processing.* M.I.T. Lab. for Comp.Sci.* TR-254.*n.d. 020271 Rutherford, C.J. Davies, B. Barnett, A.I. Desforges, J.F.*A computer system for decision analysis in Hodgkins disease.* M.I.T. Lab. for Comp.Sci.*TR-271.*1981. 020258 Singh, N.P.*A design methodology for self-timed systems.* M.I.T. Lab. for Comp.Sci.*TR-258.*1981. 020270 Singh, V.*The design of a routing service for campus-wide internet transport.* M.I.T. Lab. for Comp.Sci.*TR-270.* 1981. 020272 Smith, B.C.* Reflection and semantics in a procedural language.* M.I.T. Lab. for Comp.Sci.*TR-272, Ph.D. Thesis. Smith, B.C.*1982. 016438 Bassein, R.*The influence of program dynamics on performance.* Cal U., Berkeley. Electronics Res.Lab.* Memo. No. UCB/ERL-M82/33; Cal U., Berkeley. Electronics Res.Lab. PROGRES Group.*Rpt. 82.5.*1982. 016439 Dutt, C.R. Ferrari, D.*Characterizing and reproducing program referencing dynamics.* Cal U., Berkeley. Electronics Res.Lab.*Memo. No. UCB/ERL-M82/20; Cal U., Berkeley. Electronics Res.Lab. PROGRES Group.*Rpt. 82.4.* 1982. 016440 Ferrari, D. Yih, Y.-Y.* VSWS: the variable-interval sampled working set policy.* Cal U., Berkeley. Electronics Res.Lab.*Memo. No. UCB/ERL-M82/16; Cal U., Berkeley. Electronics Res.Lab. PROGRES Group.*Rpt. 82.3.*1982. 016441 Hagmann, R. Fabry, R.* Program page reference patterns.* Cal U., Berkeley. Electronics Res.Lab.*Memo. No. UCB/ERL-M82/15; Cal U., Berkeley. Electronics Res.Lab. PROGRES Group.*Rpt. 82.2.*1982. 016442 Paris, J.-F. Ferrari, D.*An analytical study of strategy-oriented restructuring algorithms.* Cal U., Berkeley. E.E. & Comp.Sci.Dept.*CSD-TR-395; Cal U., Berkeley. Electronics Res.Lab. PROGRES Group.*Rpt. 82.1.* 1982. 016443 Abrams, M. Chu, Y.* Ada program reader 2: an I/O system.* Maryland U. Comp.Sci. Center.*TR-1089.*1981. 016444 Abrams, M. Chu, Y.* Ada program reader 3: an output spooling system.* Maryland U. Comp.Sci. Center.*TR-1094.* 1981. 016445 Abrams, M. Chu, Y.* Direct execution of JOVIAL subroutines.* Maryland U. Comp.Sci. Center.*TR-1102.*1981. 016446 Abrams, M. Chu, Y.* Program representation in direct execution computers.* Maryland U. Comp.Sci. Center.* TR-1110.*1981. 016447 Abrams, M. DiIenno, T. Chu, Y.*Proposed enhancement of Nebula instruction set.* Maryland U. Comp.Sci. Center.* TR-1074.*1981. 016448 Agre, J.R.*Approximate solutions to queueing networks with state dependent parameters.* Maryland U. Comp.Sci. Center.*TR-1092, Ph.D. Thesis. Agre, J.R.*1981. 016449 Allen, E.M.* ISFL: the I-space frame language.* Maryland U. Comp.Sci. Center.*TR-1100.*1981. 016450 Chu, Y. Abrams, M.*Low-level and high-level computer architectures.* Maryland U. Comp.Sci. Center.*TR-1101.* 1981. 016451 Dunn, S. Janos, L. Rosenfeld, A.* Bimean clustering.* Maryland U. Comp.Sci. Center.*TR-1106.*1981. 016452 Hartley, R.L. Kitchen, L.J. Wang, C.-Y. Rosenfeld, A.*A comparative study of segmentation algorithms for FLIR images.* Maryland U. Comp.Sci. Center.*TR-1104.*1981. 016453 Itano, K.* CDL design of a pipelined lexical scanner.* Maryland U. Comp.Sci. Center.*TR-1093.*1981. 016454 Lor, K.-W.E. Chu, Y.*Design of a PASCAL interactive direct execution computer.* Maryland U. Comp.Sci. Center.* TR-1088.*1981. 016455 Minker, J.*On indefinite databases and the closed world assumption.* Maryland U. Comp.Sci. Center.*TR-1076.* 1981. 016456 Narayanan, K.A. O'Leary, D.P. Rosenfeld, A.*An optimization approach to edge reinforcement.* Maryland U. Comp.Sci. Center.*TR-1109.*1981. 016457 O'Leary, D.P. Peleg, S.*Digital image compression by outer product expansion.* Maryland U. Comp.Sci. Center.* TR-1108.*1981. 016458 Pietikaeinen, M. Rosenfeld, A. Davis, L.S.* Texture classification using averages of local pattern matches.* Maryland U. Comp.Sci. Center.*TR-1098.*1981. 016459 Prazdny, K.*Computing motions of (locally) planar surfaces from spatio-temporal changes in image brightness: a note.* Maryland U. Comp.Sci. Center.*TR-1090.*1981. 016460 Rieger, C.J.*From office automation to personal automation: an AI perspective.* Maryland U. Comp.Sci. Center.* TR-1085.*1981. 016461 Rieger, C. Bane, R. Stanfill, C. Trigg, R. Weiser, M.*Three ZMOB papers for the CAPAIDM Hot Springs Conference.* Maryland U. Comp.Sci. Center.*TR-1099.*1981. CONTENTS: ZMOB: doing it in parallel!, by Chuck Rieger; Operating system strategy on ZMOB, by Robert Bane, Craig Stanfill, and Mark Weiser; Software on ZMOB: an object oriented approach, by Randy Trigg. 016462 Sun, H.* Image registration by combining feature matching and gray level correlation.* Maryland U. Comp.Sci. Center.*TR-1091.*1981. 016463 Tang, C.-S.*Expressing the formal semantics of CSP and CP or ADA tasking with the temporal logic language XYZ/E.* Maryland U. Comp.Sci. Center.*TR-1107.*n.d. 016464 Thareja, A.K. Agrawala, A.K.*On the design of optimal policy for sharing finite buffers.* Maryland U. Comp.Sci. Center.*TR-1081.*1981. 016465 Thareja, A.K. Tripathi, S.K. Upton, R.A.*On updating buffer allocation.* Maryland U. Comp.Sci. Center.*TR-1103.*1981. 016466 Thrift, P.R. Dunn, S.M.*Approximating point set images by line segments using a variation of the Hough transform.* Maryland U. Comp.Sci. Center.*TR-1105.*1981. 016467 Wang, C.-Y. Rosenfeld, A.* Elevation texture.* Maryland U. Comp.Sci. Center.*TR-1086.*1981. 016468 Wang, C.-Y. Sun, H. Yada, S. Rosenfeld, A.*Some experiments in relaxation image matching using corner features.* Maryland U. Comp.Sci. Center.*TR-1071.*1981. 016469 Wu, Z.-Q. Rosenfeld, A.*Filtered projections as an aid in corner detection.* Maryland U. Comp.Sci. Center.* TR-1078.*1981. 110825 Beck, J. Prazdny, S. Rosenfeld, A.*A theory of textural segmentation.* Maryland U. Comp.Sci. Center.*TR-1083.* 1981. Microfiche. 110826 Chellappa, R.*Synthesis of textures using simultaneous autoregressive models.* Maryland U. Comp.Sci. Center.* TR-1084.*1981. Microfiche. 110827 Dowdy, L.W. Gordon, K.D.*Algorithms for nonintegral degrees of multiprogramming in closed queueing networks.* Maryland U. Comp.Sci. Center.*TR-1075.*1981. Microfiche. 110828 Dunn, S.M.* Texture classification with change point statistics.* Maryland U. Comp.Sci. Center.*TR-1082.* 1981. Microfiche. 110829 Grant, J.* Normalization of relational database theories by adequate decomposition.* Maryland U. Comp.Sci. Center.* TR-1001.*1981. Microfiche. 110830 Kasif, S. Rosenfeld, A.* Pyramid linking as a special case of ISODATA.* Maryland U. Comp.Sci. Center.*TR-1096.* 1981. Microfiche. 110831 Kim, C.E.* Three dimnesional digital line segments.* Maryland U. Comp.Sci. Center.*TR-1087.*1981. Microfiche. 110832 Kitchen, L. Krishnamurthy, E.V.*Fast, parallel, relaxation screening for chemical patent data base search.* Maryland U. Comp.Sci. Center.*TR-1095.*1981. Microfiche. 110833 Krishnamurthy, E.V.*Fast parallel exact computation of the generalized inverse and rank of a matrix.* Maryland U. Comp.Sci. Center.*TR-1079.*1981. Microfiche. 110834 Mittermeir, R.T. Yeh, R.T.*Modelling control structures using semantic nets.* Maryland U. Comp.Sci. Center.* TR-1077.*1981. Microfiche. 110835 Rosenfeld, A. Kim, C.E.*How a digital computer can tell that a straight line is straight.* Maryland U. Comp.Sci. Center.*TR-1072.*1981. Microfiche. 110836 Rosenfeld, A.*On connectivity properties of grayscale pictures.* Maryland U. Comp.Sci. Center.*TR-1097.*1981. Microfiche. 110837 Shneier, M.*Models and strategies for matching in industrial vision.* Maryland U. Comp.Sci. Center.* TR-1073.*1981. Microfiche. 016470 Allen, J.F.*A general model of action and time.* Rochester U. Comp.Sci.Dept.*Tech.Rpt. 097.*1981. 016471 Allen, J.F.*Maintaining knowledge about temporal intervals.* Rochester U. Comp.Sci.Dept.*Tech.Rpt. 086.*1981. 016472 Ballard, D.H. Sabbah, D.*On shapes.* Rochester U. Comp.Sci.Dept.*Tech.Rpt. 092.*1982. 016473 Feldman, J.A.* Memory and change in connection networks.* Rochester U. Comp.Sci.Dept.*Tech.Rpt. 096.*1981. 016474 Fleisch, B.D. Burke, E.J. Parker, C.W.* Amps: an environment for personal computers.* Rochester U. Comp.Sci.Dept.*Tech.Rpt. 094.*1981. 016475 Gacs, P. Levin, L.A.* Causal nets or what is a deterministic computation?* Rochester U. Comp.Sci.Dept.* Tech.Rpt. 088.*1981. 016476 Gacs, P.* Memory allocation games arising in algorithmic information theory.* Rochester U. Comp.Sci.Dept.* Tech.Rpt. 089.*1981. 016477 Galil, Z. Seiferas, J.*Time-space-optimal string matching (preliminary report).* Rochester U. Comp.Sci.Dept.* Tech.Rpt. 087.*1981. 016478 Kedem, G.* Distributed control architecture for wafer scale integration.* Rochester U. Comp.Sci.Dept.*Tech.Rpt. 098.* 1981. 016479 Kedem, G.*A first in, first out and a priority queue.* Rochester U. Comp.Sci.Dept.*Tech.Rpt. 090.*1981. 016480 Kedem, G.*The quad-CIF tree: a data structure for hierarhical on-line algorithms.* Rochester U. Comp.Sci.Dept.*Tech.Rpt. 091.*1981. 016481 Small, S.* Parsing as cooperative distributed inference: understanding through memory interactions.* Rochester U. Comp.Sci.Dept.*Tech.Rpt. 093.*1981, revised. 016482 Watanabe, H.* VLSI implementation of odd-even sorter using a uniform ladder.* Rochester U. Comp.Sci.Dept.*Tech.Rpt. 085.*1981. 016483 Chorley, B.J. Parkin, G.I.*A revised definition of a secure communication protocol and its implementation.* U.K. National Physical Lab. Info. Technology and Computing Div.*DITC 05/82.*1982. 016484 Ehrman, J.R. Hamilton, H.*The thrill of programming, the agony of debugging.* Stanford U. SLAC.*SLAC-PUB-2806.* 1981. 016485 Friesen, A. Wig, E. Tremblay, J.P. Sorenson, P.G.* SPSL/ SPSA primer (version 1.1).* Saskatchewan U. Computational Sci.Dept.*Rpt. 82-05.*1982. 016486 Gonsalves, T.A.* Packet voice communication on an Ethernet local computer network: an experimental study.* Xerox. Palo Alto Res. Center.*CSL-82-05.*1982. 016487 Guerra, J. Gustafsson, B.*A semi-implicit method for hyperbolic problems with different time-scales.* Uppsala U. Comp.Sci.Dept.*Rpt. 90.*1982. 016488 Harten, A.*High resolution schemes for hyperbolic conservation laws.* New York U. Inst. of Math. Sci.* DOE/ER/03077-175.*1982. 016489 Koskimies, K.*An experience on language implementation using attribute grammars.* Helsinki U. Comp.Sci.Dept.* Rpt. A-1982-02.*1982. 016490 Norman, D.A.*Five papers on human machine interaction.* Cal U., San Diego. Human Info.Proces. Center.*CHIP 112.*1982. CONTENTS: Some observations on mental models, by D.A. Norman; A psychologist views human processing; human errors and other phenomena suggest processing mechanisms, by D.A. Norman; Steps toward a cognitive engineering: design rules based on analysis of human error, by D.A. Norman; The trouble with UNIX, by D.A. Norman; The trouble with networks, by D.A. Norman. 016491 Saltzman, J.*A variational method for generating multidimensional adaptive grids.* New York U. Inst. of Math. Sci.*DOE/ER/03077-174, Ph.D. Thesis. Saltzman, J.* 1982. 016493 Satyanarayana, A. Wood, R.K.*Polygon-to-chain reductions and network reliability.* Cal U., Berkeley. O.R. Center.* ORC 82-04.*1982. 016494 Seydel, R.*Numerical computation of periodic orbits that bifurcate from stationary solutions of ordinary differential equations.* Technische Universitaet Muenchen. Institut fuer Mathematik.*TUM-M8112.*1981. VOL. 4, NO. 9 09/01/82 016495 Blaustein, B.T.*Enforcing database assertions: techniques and applications.* Harvard U. Comp.Tech.Res. Center.* TR-21-81, Ph.D. Thesis. Blaustein, B.T.*1981. 016496 Bush, W.R.* User server communication in MSG: an example of abstraction and refinement.* Harvard U. Comp.Tech.Res. Center.*TR-27-81.*1982. 016497 Clarke, E.M.*Research directions in programming language semantics and formal program verfication.* Harvard U. Comp.Tech.Res. Center.*TR-22-81.*1981. 016498 Emerson, E.A.*Alternative semantics for temporal logics.* Harvard U. Comp.Tech.Res. Center.*TR-26-81.*1981. 016499 German, S.M.* Verifying the absence of common runtime errors in computer programs.* Harvard U. Comp.Tech.Res. Center.*TR-02-82, Ph.D. Thesis. German, S.M.*1981. 016500 Goodman, N. Shmueli, O.* NP-complete problems simplified on tree schemas.* Harvard U. Comp.Tech.Res. Center.* TR-03-82.*1981. 016501 Gurevich, Y. Lewis, H.R.*The inference problem for template dependencies.* Harvard U. Comp.Tech.Res. Center.* TR-01-82.*1982. 016502 Gurevich, Y. Lewis, H.R.*The word problem for cancellation semigroups with zero.* Harvard U. Comp.Tech.Res. Center.* TR-08-82.*1982. 016503 Karp, R.M. Rabin, M.O.*Efficient randomized pattern matching algorithms.* Harvard U. Comp.Tech.Res. Center.* TR-31-81.*1981. 016504 Konchan, T.E. Klausner, A.* DBS a relational data base system.* Harvard U. Comp.Tech.Res. Center.*TR-18-81.* 1981. 016505 Lewis, H.R. Denenberg, L.*A hard problem for NTIME (n superscript d).* Harvard U. Comp.Tech.Res. Center.* TR-23-81.*1981. 016506 Lewis, H.R. Statman, R.*Unifiability is complete for co-NLog space.* Harvard U. Comp.Tech.Res. Center.* TR-09-82.*1982. 016507 Newsam, G.N. Ramsdell, J.D.* Estimation of sparse Jacobian matrices.* Harvard U. Comp.Tech.Res. Center.*TR-17-81.* 1981. 016508 Nikolaou, C.N. Clarke, E.M. Schuman, S.A.*A proof methodology for verifying request processing protocols.* Harvard U. Comp.Tech.Res. Center.*TR-04-82.*1982. 016509 Rabin, M.O.* Transaction protection by beacons.* Harvard U. Comp.Tech.Res. Center.*TR-29-81.*1981. 016510 Reif, J.H.*The complexity of two player games of incomplete information.* Harvard U. Comp.Tech.Res. Center.* TR-35-81.*1981. 016511 Reif, J.H. Peterson, G.* Decision algorithms for multiplayer games of incomplete information.* Harvard U. Comp.Tech.Res. Center.*TR-34-81.*1981. 016512 Reif, J.H. Spirakis, P.G.* K-connectivity in random undirected graphs.* Harvard U. Comp.Tech.Res. Center.* TR-19-81.*1981. 016513 Reif, J.H.*On the power of probabilistic choice in synchronous parallel computations.* Harvard U. Comp.Tech.Res. Center.*TR-30-81.*1982. 016514 Reif, J.H.* Parallel interpolation search.* Harvard U. Comp.Tech.Res. Center.*TR-07-82.*1982. 016515 Reif, J.H. Spirakis, P.G.* Probabilistic analysis of random extension rotation algorithms.* Harvard U. Comp.Tech.Res. Center.*TR-28-81.*1981. 016516 Reif, J.H. Spirakis, P.G.* Random independence systems. Harvard U. Comp.Tech.Res. Center.*TR-32-81.*1981. 016517 Reif, J.H. Spirakis, P.G.* Real time resouce allocation in a distributed system.* Harvard U. Comp.Tech.Res. Center.* TR-06-82.*1982. 016518 Sattley, J.Z. Sattley, K. Schaffner, S.C. Schuman, S.C. Clarke, E.M.* ADAPT: ada distributed application prototyping technique.* Harvard U. Comp.Tech.Res. Center.* TR-20-81.*1981. 016519 Shmueli, O.*The fundamental role of tree schemas in relational query processing.* Harvard U. Comp.Tech.Res. Center.*TR-16-81, Ph.D Thesis. Shmueli, O.*1981. 016520 Sistla, A.P. Clarke, E.M.*The complexity of propositional temporal logics.* Harvard U. Comp.Tech.Res. Center.* TR-05-82.*1982. 016521 Spirakis, P.G.* Probabilistic algorithms, algorithms with random inputs and random combinatorial structures.* Harvard U. Comp.Tech.Res. Center.*TR-33-81, Ph.D. Thesis. Spirakis, P.G.*1981. 016522 Spirakis, P.G. Reif, J.H.* Strong K-connectivity in digraphs and random digraphs.* Harvard U. Comp.Tech.Res. Center.*TR-25-81.*1981. 016523 Townley, J.A.*The use of transformation to implement an algorithm.* Harvard U. Comp.Tech.Res. Center.*TR-24-81.* 1981. 016524 Bennett, J.L.*Managing to meet usability goals in the development of office systems.* IBM Watson Res. Center.* RJ 3412.*1982. 016525 Bullen, C.V.*A case study of office workstation use.* IBM Watson Res. Center.*RJ 3405.*1982. 016526 Bux, W.*An approximate method for the performance analysis of buffer insertion rings.* IBM Watson Res. Center.*RZ 1129.*1982. 016527 Casanova, M.A.* Inclusion dependencies and their interaction with functional dependencies.* IBM Watson Res. Center.*RJ 3380.*1982. 016528 Chang, C.L.* Decision support in an imperfect world.* IBM Watson Res. Center.*RJ 3421.*1982. 016529 Dahmen, W.*Some remarks on multivariate B-splines.* IBM Watson Res. Center.*RC 9296.*1982. 016530 Daniels, D.* Query compilation in a distributed database system.* IBM Watson Res. Center.*RJ 3423.*1982. 016531 Dolev, D.* Authenticated algorithms for Byzantine agreement. IBM Watson Res. Center.*RJ 3416.*1982. 016532 Dolev, D. Strong, R.* Distributed commit with bounded waiting.* IBM Watson Res. Center.*RJ 3417.*1982. 016533 Dolev, D.*An efficient Byzantine agreement without authentication. IBM Watson Res. Center.*RJ 3428.*1982. 016534 Dolev, D. Strong, R.*Requirements for agreement in distributed systems.* IBM Watson Res. Center.*RJ 3418.* 1982. 016535 Dolev, D.* Scheduling flat graphs.* IBM Watson Res. Center.*RJ 3398.*1982. 016536 Dolev, D.* Scheduling precedence graphs of bounded height.* IBM Watson Res. Center.*RJ 3399.*1982. 016537 Farrell, E.J.* Image3D (version 2).* IBM Watson Res. Center.*RC 9303.*1982. 016538 Fisher, S.D.* Optimal sampling for holomorphic functions.* IBM Watson Res. Center.*RC 9297.*1982. 016539 Franaszek, P.A.*On address independent routing in local networks.* IBM Watson Res. Center.*RC 9324.*1982. 016540 Gelenbe, E.* Stationary deterministic flows: the single server queue.* IBM Watson Res. Center.*RZ 1136.*1982. 016541 Gladney, H.M.* Concise language reference manual.* IBM Watson Res. Center.*RJ 3408.*1982. 016542 Gladney, H.M.* Generic operators in concise programs.* IBM Watson Res. Center.*RJ 3441.*1982. 016543 Gladney, H.M.*How to print with style.* IBM Watson Res. Center.*RJ 3409.*1982. 016544 Hagouel, J. Schwartz, M.*A distributed failsafe route table update algorithm.* IBM Watson Res. Center.*RC 9294.*1982. 016545 Iglehart, D.L.*Comparison of regenerative simulation methods for networks of queues with general service times.* IBM Watson Res. Center.*RJ 3415.*1982. 016546 Jensen, K.*New tools for old tasks: an introductory course in computational linguistics.* IBM Watson Res. Center.*RC 9314.*1982. 016547 Liniger, W.* Contractivity of multistep and one leg methods with variable steps.* IBM Watson Res. Center.*RC 9306.* 1982. 016548 Liniger, W.* A-contractivity of second-order multistep formulas with variable steps.* IBM Watson Res. Center.* RC 9281.*1982. 016549 Markowitz, H.M.*A classification of job shop simulation models.* IBM Watson Res. Center.*RC 9301.*1982. 016550 Miranker, W.L.*An overview of the highly oscillatory initial value problem.* IBM Watson Res. Center.*RC 9282.* 1982. 016551 Myers, R.A.*Trends in office automation technology.* IBM Watson Res. Center.*RC 9321.*1982. 016552 Nair, R. Hong, S.J. Liles, S. Villani, R.*Global wiring on a wire routing machine.* IBM Watson Res. Center.*RC 9328.* 1982. 016553 Nelson, R.A. Haibt, L.M. Sheridan, P.B.* Specification, design, and implementation via annotated petri nets.* IBM Watson Res. Center.*RC 9317.*1982. 016554 Nix, D.H.* LINKS: a teaching approach to developmental progress in children's reading comprehension and meta-comprehension.* IBM Watson Res. Center.*RC 9286.* 1982. 016555 Otten, R.H.J.M.* Eigensolutions in top down layout design.* IBM Watson Res. Center.*RC 9334.*1982. 016556 Reischuk, R.*A lower time-bound for parallel random access machines without simultaneous writes.* IBM Watson Res. Center.*RJ 3431.*1982. 016557 Robinson, J.T.*Separating policy from correctness in concurrency control design.* IBM Watson Res. Center.*RC 9308.*1982. 016558 Roth, J.P. Tsai, M.Y.* Testing and failure in static pass transistor logic.* IBM Watson Res. Center.*RC 9313.*1982. 016559 Selinger, R.D. Patlach, A.M. Carlson, E.D.*The 925 family of office workstations.* IBM Watson Res. Center.*RJ 3406.* 1982. 016560 Tetzlaff, W. Beretvas, T.*A new approach to VM performance analysis.* IBM Watson Res. Center.*RC 9299.*1982. 016561 Wagner, E.G.*Functorial hierarchies of functional languages.* IBM Watson Res. Center.*RC 9327.*1982. 016562 Wahl, F.M. Wong, K.Y.*An efficient method for running a constrained run length algorithm (CRLA) in vertical and horizontal direction on binary image data.* IBM Watson Res. Center.*RJ 3438.*1982. 016563 Asselt, E.J. Van*The multi-grid method and artificial viscosity.* Mathematisch Centrum.*NW 123/82.*1982. 016564 Bakker, J.W. de. Meyer, J.-J.Ch. Zucker, J.I.*On infinite computations in denotational semantics.* Mathematisch Centrum.*IW 196/82.*1982. 016565 Bergstra, J.A. Klop, J.W.* Formal proof systems for program equivalence.* Mathematisch Centrum.*IW 194/82.*1982. 016566 Bohm, A.P.W. Bruin, A. de.*Dynamic networks of parallel processes.* Mathematisch Centrum.*IW 192/82.*1982. 016567 Lenstra, A.K. Lenstra, H.W. Lovasz, L.* Factoring polynomials with rational coefficients.* Mathematisch Centrum.*IW 195/82.*1982. 016568 Te Riele, H.J.J.*Rules for constructing hyperperfect numbers.* Mathematisch Centrum.*NW 127/82.*1982. 016569 Verwer, J.G. Scholz, S. Blom, J.G. Louter-Noll, M.*A class of Runge Kutta Rosenbrock methods for solving stiff differential equations.* Mathematisch Centrum.*NW 125/82.*1982. 016570 Verwer, J.G.* Contractivity of locally one-dimensional splitting methods.* Mathematisch Centrum.*NW 124/82.* 1982. 016571 Vitanyi, P.M.B.*Efficient simulations of multicounter machines (preliminary version).* Mathematisch Centrum.* IW 197/82.*1982. 016572 Vitanyi, P.M.B.* Real time simulation of multicounters by oblivious one tape turing machines (preliminary draft).* Mathematisch Centrum.*IW 193/82.*1982. 016573 Bar-Yehuda, R. Even, S.*On approximating a vertex cover for planar graphs.* Technion - Israel Inst. of Tech. Comp.Sci.Dept.*Tech.Rpt. 221.*1981. 016574 Etzion, T. Yoeli, M.*The hierarchy of labeled super-nets.* Technion - Israel Inst. of Tech. Comp.Sci.Dept.*Tech.Rpt. 226.*1981. 016575 Etzion, T. Yoeli, M.* Super-nets and their hierarchy.* Technion - Israel Inst. of Tech. Comp.Sci.Dept.*Tech.Rpt. 218.*1981. 016576 Even, S. Goldreich, O.*Des-like functions can generate the alternating group.* Technion - Israel Inst. of Tech. Comp.Sci.Dept.*Tech.Rpt. 207.*1981. 016577 Even, S. Yacobi, Y.* NP-comleteness and conventional cryptosystems.* Technion - Israel Inst. of Tech. Comp.Sci.Dept.*Tech.Rpt. 212.*1981. 016578 Even, S. Yacobi, Y.*On the complexity of problems with few solutions.* Technion - Israel Inst. of Tech. Comp.Sci.Dept.*Tech.Rpt. 213.*1981. 016579 Even, S. Goldreich, O. Tong, P.*On the NP-completeness of certain network testing problems.* Technion - Israel Inst. of Tech. Comp.Sci.Dept.*Tech.Rpt. 230.*1981. 016580 Itai, A.*On the complexity of contractions.* Technion - Israel Inst. of Tech. Comp.Sci.Dept.*Tech.Rpt. 211.*1981. 016581 Lempel, A. Seroussi, G. Winograd, S.*On the complexity of multiplication in finite fields.* Technion - Israel Inst. of Tech. Comp.Sci.Dept.*Tech.Rpt. 214.*1981. 016582 Porat, S. Yoeli, M.*Towards a hierarchy of nets.* Technion - Israel Inst. of Tech. Comp.Sci.Dept.*Tech.Rpt. 224.* 1981. 016583 Selman, A.L. Yacobi, Y.*The complexity of promise problems.* Technion - Israel Inst. of Tech. Comp.Sci.Dept.* Tech.Rpt. 222.*1981. 016584 Tomer, A. Yoeli, M.*On the application of extended petri nets to the verification of protocols.* Technion - Israel Inst. of Tech. Comp.Sci.Dept.*Tech.Rpt. 228.*1981. 016585 Zaks, S.*A new algorithm for generation of permutations.* Technion - Israel Inst. of Tech. Comp.Sci.Dept.*Tech.Rpt. 220.*1981. 016586 Bank, R.E.*Analysis of a multi level inverse iteration procedure for Eigenvalue problems.* Yale U. Comp.Sci.Dept.*Res.Rpt. 199.*1980. 016587 Bank, R.E. Rose, D.J.*Analysis of a multilevel iterative method for nonlinear finite element equations.* Yale U. Comp.Sci.Dept.*Res.Rpt. 202.*1981. 016588 Chan, T.F. Golub, G.H. LeVeque, R.J.*Algorithms for computing the sample variance: analysis and recommendations.* Yale U. Comp.Sci.Dept.*Res.Rpt. 222.* 1981. 016589 Chan, T.F. Jackson, K.R. Zhu, B.*Alternating direction incomplete factorizations.* Yale U. Comp.Sci.Dept.* Res.Rpt. 208.*1981. 016590 Chan, T.F. Keller, H.B.*Arc-length continuations and multi-grid techniques for nonlinear elliptic eigenvalue problems.* Yale U. Comp.Sci.Dept.*Res.Rpt. 197.*1981. 016591 Chan, T.F.* Deflated decomposition of solutions of nearly singular systems.* Yale U. Comp.Sci.Dept.*Res.Rpt. 225.* 1982. 016592 Chan, T.F.* Deflation techniques and block elimination algorithms for solving bordered singular systems.* Yale U. Comp.Sci.Dept.*Res.Rpt. 226.*1982. 016593 Chan, T.F.*Numerical computation of large amplitude internal solitary waves.* Yale U. Comp.Sci.Dept.* Res.Rpt. 198.*1981. 016594 Chan, T.F.*On the existence and computation of Lu factorizations with small pivots.* Yale U. Comp.Sci.Dept.* Res.Rpt. 227.*1982. 016595 Davis, E.*Organizing spatial knowledge.* Yale U. Comp.Sci.Dept.*Res.Rpt. 193.*1981. 016596 Douglas, C.C.*Multi-grid algorithms for elliptic boundary-value problems.* Yale U. Comp.Sci.Dept.* Res.Rpt. 223.* Ph.D. Thesis. Douglas, C.C.*1982. 016597 Eisenstat, S.C. Schultz, M.H.*On some trends in elliptic problem solvers.* Yale U. Comp.Sci.Dept.*Res.Rpt. 194.* 1981. 016598 Eisenstat, S.C. Lewis, J.W. Schultz, M.H.*Optimal block diagonal scaling of block 2-cyclic matrices.* Yale U. Comp.Sci.Dept.*Res.Rpt. 204.*1981. 016599 Eisenstat, S.C. Jackson, K.R. Lewis, J.W.*The order of monotone piecewise cubic interpolation.* Yale U. Comp.Sci.Dept.*Res.Rpt. 207.*1981. 016600 Eisenstat, S.C. Elman, H.C. Schultz, M.H.* Variational iterative methods for nonsymmetric systems of linear equations.* Yale U. Comp.Sci.Dept.*Res.Rpt. 209.*1981. 016601 Ellis, J.R. Mishkin, N. Nix, R.P. Wood, S.R.*A BLISS programming environment.* Yale U. Comp.Sci.Dept.*Res.Rpt. 231.*1982. 016602 Ellis, J.R.* Multiple context shells.* Yale U. Comp.Sci.Dept.*Res.Rpt. 191.*1981. 016603 Ellis, J.R. Mishkin, N. Leunen, M.-C. van. Wood, S.R.* Tools: an environment for timeshared computing and programming.* Yale U. Comp.Sci.Dept.*Res.Rpt. 232.*1982. 016604 Elman, H.C.* Preconditioned conjugate gradient methods for nonsymmetric systems of linear equations.* Yale U. Comp.Sci.Dept.*Res.Rpt. 203.*1981. 016605 Fisher, J.A.*Computer systems architecture at Yale. The enormous longword instruction ( ELI) machine progress and research plans.* Yale U. Comp.Sci.Dept.*Res.Rpt. 241.* 1982. 016606 McDermott, D.*Finding objects with given spatial properties.* Yale U. Comp.Sci.Dept.*Res.Rpt. 195.*1981. 016607 McDermott, D.*A temporal logic for reasoning about processes and plans.* Yale U. Comp.Sci.Dept.*Res.Rpt. 196.*1981. 016608 Perry, J.R.* Secondary storage methods for solving symmetric, positive definite, banded linear systems.* Yale U. Comp.Sci.Dept.*Res.Rpt. 201, Ph.D. Thesis. Perry, J.R.*1981. 016609 Saad, Y.* Iterative solution of indefinite symmetric systems by methods using orthogonal polynomials over two disjoint intervals.* Yale U. Comp.Sci.Dept.*Res.Rpt. 212.* 1981. 016610 Saad, Y.*Practical use of some Krylov subspace methods for solving indefinite and unsymmetric linear systems.* Yale U. Comp.Sci.Dept.*Res.Rpt. 214.*1982. 016611 Sayward, F.G. Lipton, R.J.*Steps towards efficiently implementing program mutation systems: the high level design of a distributed mutation system.* Yale U. Comp.Sci.Dept.*Res.Rpt. 200.*n.d. 016612 Schank, R. Kolodner, J. DeJong, G.* Conceptual information retrieval.* Yale U. Comp.Sci.Dept.*Res.Rpt. 190.*1980. 016613 Shapiro, E.Y.* Algorithmic program debugging.* Yale U. Comp.Sci.Dept.*Res.Rpt. 237, Ph.D. Thesis. Shapiro, E.Y.* 1982. 016614 Weiser, A.* Local mesh, local order, adaptive finite element methods with a posteriori error estimators for elliptic partial differential equations.* Yale U. Comp.Sci.Dept.*Res.Rpt. 213, Ph.D. Thesis. Weiser, A.* 1981. 016615 Zhu, B.*The positive solution of a certain nonlinear parabolic system and it's computation I.* Yale U. Comp.Sci.Dept.*Res.Rpt. 210.*1981. 016616 Zhu, B.* Stability of high order difference equations and its algebraic survey.* Yale U. Comp.Sci.Dept.*Res.Rpt. 211.*1981. VOL. 4, NO. 10 09/28/82 016627 Ballard, B.W.*A "domain class" approach to transportable natural language processing.* Duke U. Comp.Sci.Dept.* CS-1982-11.*1982. 016628 Ballard, B.W.* Pronominal processing in a computational domain.* Duke U. Comp.Sci.Dept.*CS-1982-01.*1982. 016629 Ballard, B.W.*A search procedure for perfect information games of chance.* Duke U. Comp.Sci.Dept.*CS-1982-08.* 1982. 016630 Biermann, A.W.* Natural language programming.* Duke U. Comp.Sci.Dept.*CS-1982-02.*1982. 016631 Freeman, R.W.*Automated design specification system.* Duke U. Comp.Sci.Dept.*CS-1982-10.*1982. 016632 Geist, R. Fink, P. Kraines, D.* Natural language computing in a linear algebra course.* Duke U. Comp.Sci.Dept.* CS-1982-09.*1982. 016633 Loveland, D.W.*Performance bounds for binary testing with arbitrary weights.* Duke U. Comp.Sci.Dept.*CS-1982-04.* 1982. 016634 Rosenberg, A.L.* Bandwidth and pebbling.* Duke U. Comp.Sci.Dept.*CS-1982-03.*1982. 016635 Rosenberg, A.L.*The diogenes approach to testable fault tolerant networks of processors.* Duke U. Comp.Sci.Dept.* CS-1982-06.1.*1982. 016636 Rosenberg, A.L.* Three dimensional VLSI: a case study.* Duke U. Comp.Sci.Dept.*CS-1981-15.*1981. 016637 Smith, C.U. Loendorf, D.D.* Performance analysis of software for an MIMD computer.* Duke U. Comp.Sci.Dept.* CS-1982-07.*1982. 016638 Smith, C.U. Browne, J.C.* Performance engineering of software systems: a case study.* Duke U. Comp.Sci.Dept.* CS-1981-14.*1981. 016639 Trivedi, K.S. Bannister, J.A.*An algorithm with applications to two problems in the design and operation of fault tolerant distributed systems.* Duke U. Comp.Sci.Dept.*CS-1982-05.*1982. 016640 Lauchli, P.*PG - ein interaktives System fur die Manipulation von FigurenGder projektiven Geometrie.* Eidgenossische Technische Hochschule Zurich. Institut fuer Informatik.*Bericht 48.*1982. 016641 Meier, A.*A graph grammar approach to geographic data bases.* Eidgenossische Technische Hochschule Zurich. Institut fuer Informatik.*Bericht 49.*1982. 016642 Nievergelt, J. Hinterberger, H. Sevcik, K.C.*The grid file: an adaptable, symmetric multi-key file structure.* Eidgenossische Technische Hochschule Zurich. Institut fuer Informatik.*Bericht 46.*1981. 016643 Reimer, M. Schmidt, J.W.* Transaction procedures with relational parameter.* Eidgenossische Technische Hochschule Zurich. Institut fuer Informatik.Bericht 45.* 1981. 024918 Appelt, D.E.* Planning natural-language utterances to satisfy multiple goals.* Stanford U. Comp.Sci.Dept.* STAN-CS-82-918; SRI International. A.I. Center.*Tech. note 259, Ph.D. Thesis. Appelt, D.E.*1981. 177p. 024916 Bent, S.W.* Dynamic weighted data structures.* Stanford U. Comp.Sci.Dept.*STAN-CS-82-916, Ph.D. Thesis. Bent, S.W.* 1982. 75p. 024899 Bolstad, J.H.*An adaptive finite difference method for hyperbolic systems in one space dimension.* Stanford U. Comp.Sci.Dept.*STAN-CS-82-899; Cal U., Berkeley. Lawrence Berkeley Lab.*LBL-13287, Ph.D. Thesis. Bolstad, J.H.* 1982. 210p. 024910 Clancey, W.J. Buchanan, B.*Exploration of teaching and problem-solving strategies, 1979-1982. (Final Report for Contract N-00014-79-C-0302, covering the period of 15 March 1979 through 14 March 1982).* Stanford U. Comp.Sci.Dept.*STAN-CS-82-910; Stanford U. Comp.Sci.Dept. Heuristic Programming Project.*HPP-82-008.*1982. 13p. 024908 Clancey, W.J.*Letsinger, R.* Neomycin: reconfiguring a rule-based expert system for application to teaching.* Stanford U. Comp.Sci.Dept.*STAN-CS-82-908; Stanford U. Comp.Sci.Dept. Heuristic Programming Project.*HPP-81-002.* 1982. 8p. 024901 Fuchs, D.R. Knuth, D.E.*Optimal font caching.* Stanford U. Comp.Sci.Dept.*STAN-CS-82-901.*1982. 19p. 024914 Guoan, G. Hobby, J.*Using string matching to compress Chinese characters.* Stanford U. Comp.Sci.Dept.* STAN-CS-82-914.*1982. 15p. 024904 LeVeque, R.J.*Time-split methods for partial differential equations.* Stanford U. Comp.Sci.Dept.*STAN-CS-82-904, Ph.D. Thesis. LeVeque, R.J.*1982. 99p. 024909 London, B. Clancey, W.J.* Plan recognition strategies in student modeling: prediction and description.* Stanford U. Comp.Sci.Dept.*STAN-CS-82-909; Stanford U. Comp.Sci.Dept. Heuristic Programming Project.*HPP-82-007.* 1982. 9p. 024915 Manna, Z. Pnueli, A.* Verification of concurrent programs: proving eventualities by well-founded ranking.* Stanford U. Comp.Sci.Dept.*STAN-CS-82-915.*1982. 25p. 024907 Mayr, E.W.* Combinatorial algorithms I. (Edited collection of the class notes prepared for Computer Science 253A, Winter Quarter 1982).* Stanford U. Comp.Sci.Dept.* STAN-CS-82-907.*1982. 79p. 024906 Nash, S.G.*Truncated-Newton methods.* Stanford U. Comp.Sci.Dept.*STAN-CS-82-906, Ph.D. Thesis. Nash, S.G.* 1982. 114p. 024920 Roberts, T.L.*Evaluation of computer text editors.* Stanford U. Comp.Sci.Dept.*STAN-CS-82-920; Xerox. Palo Alto Res. Center.*SSL-79-09, Ph.D. Thesis. Roberts, T.L.* 1979. 184p. 024905 Trefethen, L.N.* Wave propagation and stability for finite difference schemes.* Stanford U. Comp.Sci.Dept.* STAN-CS-82-905, Ph.D. Thesis. Trefethen, L.N.*1982. 197p. (reduced and printed 2 pages to 1 so that there are only 98 physical pages). 024912 Varde, M.Y.*The implication and finite implication problems for typed template dependencies.* Stanford U. Comp.Sci.Dept.*STAN-CS-82-912.*1982. 34p. 016644 Brassard, G. Monet, S. Zuffellato, D.*Schonhage-Strassen? Mais c'est enfantin....* Montreal U. Dept. d'info. et de recherche operationnelle.*Publ. 402.*1981. 016645 Chapleau, S. Lapalme, G.*Athena: un programme joueur de scrabble duplicate.* Montreal U. Dept. d'info. et de recherche operationnelle.*Publ. 443.*1982. 016646 Maculan, N.*Relaxation Lagrangienne: le probleme du knapsack 0-1.* Montreal U. Dept. d'info. et de recherche operationnelle.*Publ. 435.*1982. 016647 Magnenat-Thalmann, N. Thalmann, D. Bergeron, P.*A computer graphical tool for analyzing user reaction to videotex systems.* Montreal U. Dept. d'info. et de recherche operationnelle.*Publ. 439.*1982. 016648 Magnenat-Thalmann, N. Thalmann, D.*La conception de cartes geographiques assistee par ordinateur.* Montreal U. Dept. d'info. et de recherche operationnelle.*Publ. 441.*1982. 016649 Magnenat-Thalmann, N. Thalmann, D.*Some unusual primitives in the MIRA graphical extension of PASCAL.* Montreal U. Dept. d'info. et de recherche operationnelle.*Publ. 440.* 1982. 016650 Thalmann, D. Ouimet, D. Roy, C.*Drawing bridges by computer.* Montreal U. Dept. d'info. et de recherche operationnelle.*Publ. 437.*1982. 016651 Zahar, R.V.M.*The computation of subdominant solutions of linear difference systems.* Montreal U. Dept. d'info. et de recherche operationnelle.*Publ. 434.*1982. 016652 Deering, M. Faletti, J. Wilensky, R.*Using the PEARL AI package ( package for efficient access to representation in Lisp).* Cal U., Berkeley. Electronics Res.Lab.*Memo. No. UCB/ERL-M82/19.*1982. 016653 Henry, R.R.*The code generator generators' work station: reimplementation and experimentation with th Graham Glanville machine independent algorithms for code generation.* Cal U., Berkeley. Electronics Res.Lab.*Memo. No. UCB/ERL-M81/47.*1981. 016654 Horton, M.R.*Design of a multi-language editor with static error detection capabilities.* Cal U., Berkeley. Electronics Res.Lab.*Memo. No. UCB/ERL-M81/53.*1981. 016655 Wilensky, R.*A model for planning in complex situations.* Cal U., Berkeley. Electronics Res.Lab.*Memo. No. UCB/ERL-M81/49.*1981. 016656 Wilensky, R. Morgan, M.*One analyzer for three languages.* Cal U., Berkeley. Electronics Res.Lab.*Memo. No. UCB/ERL-M81/67.*1981. 016657 Wilensky, R. Arens, Y.* PHRAN: a knowledge-based approach to natural language analysis.* Cal U., Berkeley. Electronics Res.Lab.*Memo. No. UCB/ERL-M80/34.*1980. 016658 Wilensky, R.* Points: a theory of story content.* Cal U., Berkeley. Electronics Res.Lab.*Memo. No. UCB/ERL-M80/17.* 1980. 016659 Agre, J.R. Tripathi, S.K.*Approximate solutions to queueing networks with state dependent parameters.* Maryland U. Comp.Sci. Center.*TR-1139.*1981. 016660 Davis, L.S. Wang, C.-Y. Xie, H.-C.*Some experiments in multi-spectral, multi-temporal crop classification using relaxation techniques.* Maryland U. Comp.Sci. Center.* TR-1131.*1981. 016661 Dunlop, D.D. Basili, V.R.*Generalizing specifications for uniformly implemented loops.* Maryland U. Comp.Sci. Center.*TR-1116.*1981. 016662 Dunlop, D.D. Basili, V.R.*A heuristic for deriving loop functions.* Maryland U. Comp.Sci. functions; BU Center.* TR-1115.*1981. 016663 Dunlop, D.D.*An investigation of functional correctness issues.* Maryland U. Comp.Sci. Center.*TR-1135, Ph.D. Thesis. Dunlop, D.D.*1982. 016664 Dunlop, D.D. Basili, V.R.*A new verification strategy for iterative programs.* Maryland U. Comp.Sci. Center.* TR-1114.*1981. 016665 Dunn, S.M.* Generalized Blomqvist correlation: a new U statistic and some examples.* Maryland U. Comp.Sci. Center.*TR-1125.*1981. 016666 Eisinger, N. Kasif, S. Minker, J.* Logic programming: a parallel approach.* Maryland U. Comp.Sci. Center.* TR-1124.*1981. 016667 Harbitter, A. Tripathi, S.K.*A model of transport level flow control.* Maryland U. Comp.Sci. Center.*TR-1140.* 1982. 016668 Itano, K.*High-speed character string interface for the direct execution computer.* Maryland U. Comp.Sci. Center.* TR-1128.*1981. 016669 Kedem, B.*Qualitative texture discrimination.* Maryland U. Comp.Sci. Center.*TR-1117.*1981. 016670 Peleg, S.* Classification by discrete optimization.* Maryland U. Comp.Sci. Center.*TR-1112.*1981. 016671 Pietikainen, M. Rosenfeld, A.* Multispectral image smoothing by local use of global information.* Maryland U. Comp.Sci. Center.*TR-1113.*1981. 016672 Reggia, J.A. Perricone, B.T.* KMS manual.* Maryland U. Comp.Sci. Center.*TR-1136.*1982. 016673 Reggia, J.A.* Knowledge based decision support systems: development through KMS.* Maryland U. Comp.Sci. Center.* TR-1121, Ph.D. Thesis. Reggia, J.A.*1981. 016674 Rosenfeld, A.* Image analysis.* Maryland U. Comp.Sci. Center.*TR-1129.*1981. 016675 Rosenfeld, A.*The state of the art in image analysis.* Maryland U. Comp.Sci. Center.*TR-1127.*1981. 016676 Roussopoulos, N.*The logical access path schema of a database.* Maryland U. Comp.Sci. Center.*TR-1138.*1982. 016677 Thrift, P. Lee, C.-H.*Using highlights to constrain object size and location.* Maryland U. Comp.Sci. Center.* TR-1122.*1981. 016678 Weiss, D.M.*Evaluating software development by analysis of change data.* Maryland U. Comp.Sci. Center.*TR-1120, Ph.D. Thesis. Weiss, D.M.*1981. 016679 Wong, R.W.H. Rosenfeld, A.*Some experiments in waveform approximation.* Maryland U. Comp.Sci. Center.*TR-1111.* 1981. 016680 Yan, C.*Design of the control processor of a Pascal direct execution computer.* Maryland U. Comp.Sci. Center.* TR-1126.*1981. 016681 Henningsen, I. Liestol, K.*The behaviour of a nerve cell model with strong inhibitory postsynaptic potentials.* Oslo U. Informatics Inst.*Res.Rpt. 062.*1981. 016682 Kirkerud, B.R.*The semantics of programming languages. Volumes I-II.* Oslo U. Informatics Inst.*Res.Rpt. 061.* 1981. 2 volumes. 016684 Koch, P.E.* Collocation by L splines at Gaussian points.* Oslo U. Informatics Inst.*Res.Rpt. 068, Ph.D. Thesis. Koch, P.E.*1982. 016685 Nossum, R.* Algebraic simplification in the prover system.* Oslo U. Informatics Inst.*Res.Rpt. 067.*1982. 016686 Owe, O.*A note on quantifier removal.* Oslo U. Informatics Inst.*Res.Rpt. 065.*1981. 016687 Soundararajan, N. Dahl, O.-J.* Partial correctness semantics of communicating sequential processes.* Oslo U. Informatics Inst.*Res.Rpt. 066.*1982. 016688 Wang, A.* Denotational and axiomatic semantics for non deterministic goto programs. Part 1: Denotational semantics.* Oslo U. Informatics Ins.*Res.Rpt. 060.*1981. 016689 Bank, R.E. Dupont, T.F.*Analysis of a two-level scheme for solving finite element equations.* Texas U. Numerical Analysis Center.*CNA-159.*1980. 016690 Bank, R.E. Dupont, T.F.*An optimal order process for solving finite element equations.* Texas U. Numerical Analysis Center.*CNA-158.*1980. 016691 Bank, R.E. Sherman, A.H.*A refinement algorithm and dynamic data structure for finite element meshes.* Texas U. Comp.Sci.Dept.*TR-159;* Texas U. Numerical Analysis Center.*CNA-166.*1980. 016692 Cline, A.K.*Reproducing positivity, monotonicity, and convexity in curves with splines under tension.* Texas U. Numerical Analysis Center.*CNA-169.*1980. 016693 Cline, A.K.* Smoothing by splines under tension.* Texas U. Numerical Analysis Center.*CNA-168.*1981. 016694 Cline, A.K.* Surface smoothing with splines under tension.* Texas U. Numerical Analysis Center.*CNA-170.*1981. 016695 Franchetti, C. Cheney, E.W.*Simultaneous approximation and restricted Chebyshev centers in function spaces.* Texas U. Numerical Analysis Center.*CNA-157.*1980. 016696 Grimes, R.G. Kincaid, D.R. Young, D.M.* ITPACK 2A: a Fortran implementation of adaptive accelerated iterative methods for solving large sparse linear systems.* Texas U. Numerical Analysis Center.*CNA-164.*1980. 016697 Jea, K.C.* Generalized conjugate gradient acceleration of iterative methods.* Texas U. Numerical Analysis Center.* CNA-176, Ph.D. Thesis. Jea, K.C.*1982. 016698 Kincaid, D.R.* Acceleration parameters for a symmetric successive overrelaxation conjugate gradient method for nonsymmetric systems.* Texas U. Numerical Analysis Center.*CNA-171.*1981. 016699 Kincaid, D.R. Young, D.M.*Adapting iterative algorithms developed for symmetric systems to nonsymmetric systems.* Texas U. Numerical Analysis Center.*CNA-161.*1980. 016700 Kincaid, D.R. Grimes, R.G. Respess, J.R. Young, D.M.* ITPACK 2B: a Fortran package for solving large sparse linear systems by adaptive accelerated iterative methods.* Texas U. Numerical Analysis Center.*CNA-173; Texas U. Comp. Center.*CCSN-44.*1981. 016701 Light, W.A. Cheney, E.W.*The characterization of best approximations in tensor product spaces.* Texas U. Numerical Analysis Center.*CNA-175.*1981. 016702 Light, W.A. Cheney, E.W.*Some proximinality theorems in tensor product spaces.* Texas U. Numerical Analysis Center.*CNA-165.*1980. 016703 Respess, J.R. Jr. Cheney, E.W.*Best approximation problems in tensor product spaces.* Texas U. Numerical Analysis Center.*CNA-167.*1981. 016704 Respess, J.R. Cheney, E.W.*On Lipschitzian proximity maps.* Texas U. Numerical Analysis Center.*CNA-174.*1981. 016705 von Golitschek, M. Cheney, E.W.*Failure of the alternating direction algorithm for best approximation of multivariate functions.* Texas U. Numerical Analysis Center.*CNA-172.*1981. 016706 White, A.B. Jr.*On the numerical solution of initial boundary value problems in one space solution.* Texas U. Numerical Analysis Center.*CNA-156.*1980. 016707 Young, D.M. Hayes, L.J. Jea, K.C.* Generalized conjugate gradient acceleration of iterative methods. Part I: The symmetrizable case.* Texas U. Numerical Analysis Center.* CNA-162.*1980. 016708 Young, D.M. Jea, K.C.* Generalized conjugate gradient acceleration of iterative methods. Part II: The nonsymmetrizable case.* Texas U. Numerical Analysis Center.*CNA-163.*1980. 016709 Young, D.M. Kincaid, D.R.*The ITPACK package for large sparse linear systems.* Texas U. Numerical Analysis Center.*CNA-160.*1980. VOL. 4, NO. 11 10/15/82 016710 Adler, R.L. Coppersmith, D. Hassner, M.*Algorithms for sliding block codes (an application of symbolic dynamics to information theory).* IBM Watson Res. Center.*RJ 3480.* 1982. 016711 Bhattacharya, A.K.*The IBM selective sequence electronic calculator.* IBM Watson Res. Center.*RC 9225.*1982. 016712 Bloom, S.L. Wright, J.B.* P-varieties: (a signature independent characterization of varieties of ordered algebras).* IBM Watson Res. Center.*RC 9399.*1982. 016713 Brand, D.* Redundancy and don't cares in logic synthesis.* IBM Watson Res. Center.*RC 9386.*1982. 016714 Burge, W.H.* Combinatorial interpretations of some identities of the Rogers Ramanujan type.* IBM Watson Res. Center.*RC 9329.*1982. 016715 Carroll, J.M.*The adventure of getting to know a computer: travels in an exploratory environment.* IBM Watson Res. Center.*RC 9449.*1982. 016716 Carroll, J.M.*The name game: creative and practical names for a building.* IBM Watson Res. Center.*RC 9450.*1982. 016717 Carroll, J.M.*Structure in visual communication.* IBM Watson Res. Center.*RC 9451.*1982. * 016718 Chaitim, G.J.* Godel's theorem and information.* IBM Watson Res. Center.*RC 9370.*1982. 016719 Chamberlain, S.G. Husain, A.*The need for three-dimensional simulations for VLSI Mosfet's CCD imagers and CCD SPS memories.* IBM Watson Res. Center.*RC 9410.*1982. 016720 Chow, W.-M.*An approximation method for nonstationary exponential queueing networks.* IBM Watson Res. Center.* RC 9372.*1982. * 016721 Coppersmith, D. Vishkin, U.*Solving NP-hard problems in " almost trees": vertex cover.* IBM Watson Res. Center.*RC 9404.*1982. 016722 Daniels, D. Selinger, P. Haas, L. Lindsay, B. Mohan, C. Walker, A. Wilms, P.*An introduction to distributed query compilation in R.* IBM Watson Res. Center.*RJ 3497.*1982. 016723 Denneau, M.M.*The Yorktown Simulation Engine.* IBM Watson Res. Center.*RC 9347.*1981. * 016724 Fagin, R. Williams, J.H.*A fair carpool scheduling algorithm.* IBM Watson Res. Center.*RJ 3535.*1982. 016725 Falkoff, A.D.*Semicolon-bracket notation: a hidden resource in APL.* IBM Watson Res. Center.*RC 9360.*1982. 016726 Fournier, A. Wesley, M.A.* Bending polyhedral objects.* IBM Watson Res. Center.*RC 9369.*1982. 016727 Frei, A.H.*Limits of carrier sense multiple access ( CSMA-CD) with collision detect protocols.* IBM Watson Res. Center.*RZ 1144.*1982. 016728 Gladney, H.M.*An effective approach to information presentation.* IBM Watson Res. Center.*RJ 3476.*1982. 016729 Gladney, H.M.*An introdution to the concise programming language.* IBM Watson Res. Center.*RJ 3455.*1982. 016730 Gladney, H.M.*Towards modular programs - a concise overview.* IBM Watson Res. Center.*RJ 3477.*1982. * 016731 Gurevich, Y. Stockmeyer, L. Vishkin, U.*Sovling NP-hard problems on graphs that are almost trees and an application to facility location problems.* IBM Watson Res. Center.*RC 9348.*1982. 016732 Hailpern, B.*An introduction to PASCAL/VS input/output under CMS.* IBM Watson Res. Center.*RC 9354.*1982. 016733 Heidelberger, P. Welch, P.D.* Simulation run length control in the presence of an initial transient.* IBM Watson Res. Center.*RC 9393.*1982. 016734 Hong, S.J. Nair, R.* Wire routing machines - new tools for VLSI physical design.* IBM Watson Res. Center.*RC 9374.* 1982. 016735 Ibe, O.C.*An approximate analysis of a multi server queueing system with a fixed order of access.* IBM Watson Res. Center.*RC 9346.*1982. 016736 Jenny, C.*Methodologies for placing files and processes in systems with decentralized intelligence.* IBM Watson Res. Center.*RZ 1139.*1982. 016737 Johnson, E.L. Kostreva, M.M. Suhl, U.*Solving 0-1 integer programming problems arising from large scale planning models.* IBM Watson Res. Center.*RC 9349.*1982. 016738 Kienzle, M.G. Hadsell, R.W. Milliken, K.R.*The hybrid monitor system.* IBM Watson Res. Center.*RC 9339.*1982. 016739 Kirkpatrick, S. Gelatt, C.D. Jr. Vecchi, M.P.* Optimization by simulated annealing.* IBM Watson Res. Center.*RC 9355.*1982. 016740 Kitchens, B.* Linear algebra and subshifts of finite type.* IBM Watson Res. Center.*RJ 3468.*1982. 016741 Langdon, G.G. Jr. Rissanen, J.J.*An adaptive file compression algorithm.* IBM Watson Res. Center.*RJ 3460.* 1982. 016742 Lavin, M.A. Lieberman, L.I.* AML/V: an industrial machine vision programming system.* IBM Watson Res. Center.*RC 9390.*1982. * 016743 Matula, D.W. Dolev, D.* Path regular graphs.* IBM Watson Res. Center.*RJ 3486.*1982. 016744 Micchelli, C.A. Sharma, A.*On a problem of Turan: multiple node Gaussian quadrature.* IBM Watson Res. Center.*RC 9439.*1982. 016745 Miller, L.A.*" Natural language text are not necessarily grammatical and unambiguous. Or even complete".* IBM Watson Res. Center.*RC 9441.*1982. 016746 Misek-Falkoff, L.D.*The new field of software linguistics: an early-bird view.* IBM Watson Res. Center.*RC 9421.* 1982. 016747 Misek-Falkoff, L.D.* Software science and natural language: a unification of Halstead's counting rules for programs and English text, and a claim space approach to extensions.* IBM Watson Res. Center.*RC 9420.*1982. 016748 Matick, R.E.* Hybrid memory: application of VLSI to virtual memory design. Part II: Systems considerations.* IBM Watson Res. Center.*RC 9437.*1982. 016749 Nikolaou, C.N.* Reliability issues in distributed systems.* IBM Watson Res. Center.*RC 9335, Ph.D. Thesis. Nikolaov, C.N. (Harvard University).*1982. 016750 Obermarck, R.L. Treiber R.K.*Practical uses of hashing for main storage searching.* IBM Watson Res. Center.*RJ 3483.* 1982. 016751 Perl, Y. Vishkin U.* Junction tree structure with application to a shifting algorithm.* IBM Watson Res. Center.*RC 9405.*1982. * 016752 Pippenger, N.*Advances in pebbling.* IBM Watson Res. Center.*RJ 3466.*1982. 016753 Rabenhorst, D.A.* APL event/ response programming.* IBM Watson Res. Center.*RC 9357.*1982. 016754 Rudin, H.*Automated protocol validation: some practical examples.* IBM Watson Res. Center.*RZ 1150.*1982. 016755 Sauer, C.H. MacNair, E.A. Kurose, J.F.*The Research Queueing Package version 2: CMS users guide.* IBM Watson Res. Center.*RA 0139.*1982. 016756 Sauer, C.H. MacNair, E.A. Kurose, J.F.*The Research Queueing Package version 2: introduction and examples.* IBM Watson Res. Center.*RA 0138.*1982. 016757 Sauer, C.H. MacNair, E.A. Kurose, J.F.*The Research Queueing Package version 2: TSO users guide.* IBM Watson Res. Center.*RA 0140.*1982. 016758 Savir, J.*A new empirical test for the goodness of random integer generators.* IBM Watson Res. Center.*RC 9446.* 1982. 016759 Stockmeyer, L. Vishkin, U.* Simulation of parallel random access machines by circuits.* IBM Watson Res. Center.*RC 9362.*1982. 016760 Tang, D.T. Woo, L.S.*Exhaustive test pattern generation with constant weight vectors.* IBM Watson Res. Center.*RC 9442.*1982. 016761 Taylor, R.H. Summers, P.D. Meyer, J.M.* AML: a manufacturing language.* IBM Watson Res. Center.*RC 9389.* 1982. 016762 Tcha, D.-W. Maruyama, K.*On the selection of primary paths for a communication network.* IBM Watson Res. Center.*RC 9418.*1982. 016763 Traiger, I.L.* Virtual memory management for database systems.* IBM Watson Res. Center.*RJ 3489.*1982. 016764 Tsai, R.Y.*Multiframe image point matching and 3-D surface reconstruction.* IBM Watson Res. Center.*RC 9398.*1982. 016765 Tucci, S. MacNair, E.A.*Implementation of mean value analysis for open, closed and mixed queueing networks.* IBM Watson Res. Center.*RC 9392.*1982. 016766 Tucci, S. Sauer, C.H.*The tree MVA algorithm.* IBM Watson Res. Center.*RC 9338.*1982. 016767 Walker, A.*Automatic generation of explanations of results from knowledge bases.* IBM Watson Res. Center.*RJ 3481.* 1982. 016768 Wegman, M.*Summarizing graphs by regular expressions.* IBM Watson Res. Center.*RC 9364.*1982. 016769 Gueting, R.H. Wood, D.*Finding rectangle intersections by divide-and-conquer.* McMaster U. Comp.Sci. Unit.* Comp.Sci. Tech.Rpt. No. 82-CS-04.*1982. 016770 Gueting, R.H.* Stabbing C-oriented polygons.* McMaster U. Comp.Sci. Unit.*Comp.Sci. Tech.Rpt. No. 82-CS-06.*1982. 016771 Lange, K.-J. Welzl, E.* Recurrent words and simultaneous growth in TOL systems.* McMaster U. Comp.Sci. Unit.* Comp.Sci. Tech.Rpt. No. 82-CS-05.*1982. 016772 Dien, N. van.* Classifications in CR organizations.* Polish Academy of Sciences. Inst. of Comp.Sci.*ICS PAS Rpt. No. 454.*1981. 016773 Dien, N. van.*Some remarks on CR organizations.* Polish Academy of Sciences. Inst. of Comp.Sci.*ICS PAS Rpt. No. 452.*1981. 016774 Imielinski, T. Lipski, W. Jr.*A systematic approach to relational database theory.* Polish Academy of Sciences. Inst. of Comp.Sci.*ICS PAS Rpt. No. 457.*1982. 016775 Imielinski, T. Lipski, W. Jr.*A technique for translating states between database schemata.* Polish Academy of Sciences. Inst. of Comp.Sci.*ICS PAS Rpt. No. 458.*1982. 016776 Marczynski, R.W. Milewski, J.*A microprogrammed processor for a data flow computer.* Polish Academy of Sciences. Inst. of Comp.Sci.*ICS PAS Rpt. No. 463.*1982. 016777 Marczynski, R. Bakowski, P. Michalski, A. Pulczyn, W.* PINLAN: language for digital integrated circuit description.* Polish Academy of Sciences. Inst. of Comp.Sci.*ICS PAS Rpt. No. 453.*1981. 016778 Orlowska, E. Pawlak, Z.*Representation of nondeterministic information.* Polish Academy of Sciences. Inst. of Comp.Sci.*ICS PAS Rpt. No. 450.*1981. 016779 Pawlak, Z.*About conflicts.* Polish Academy of Sciences. Inst. of Comp.Sci.*ICS PAS Rpt. No. 451.*1981. 016780 Marczynski, R.W.*Some extension of the Flynn taxonomy of computers.* Polish Academy of Sciences. Inst. of Comp.Sci.*ICS PAS Rpt. No. 460.*1982. 016781 Castrigiano, D.P.L. Mutze, M.*A covariant description of particle position.* Technische Universitaet Muenchen. Institut fuer Mathematik.*TUM-M8209.*1982. 016782 Elhardt, K.*Das Datenbank-Cache: Entwurfsprinzipien, Algorithmen, Eigenschaften.* Technische Universitaet Muenchen. Institut fuer Informatik.*TUM-I8208.*1982. 016783 Hayes, S.* Maximal simultaneous continuations in complex analysis.* Technische Universitaet Muenchen. Institut fuer Mathematik.*TUM-M8207.*1982. 016784 Hilgert, J.*Foundations of K-theory for C*-algebras.* Technische Universitaet Muenchen. Institut fuer Mathematik.*TUM-M8208.*1982. 016785 Hilgert, J.*The Mayer vietoris and the Puppe sequence in K-theory for C*-algebras.* Technische Universitaet Muenchen. Institut fuer Mathematik.*TUM-M8206.*1982. 016786 Lasser, R.* Bochner theorems for hypergroups and their applications to orthogonal polynomial expansions.* Technische Universitaet Muenchen. Institut fuer Mathematik.*TUM-M8204.*1982. 016787 Schrott, G. Tempelmeier, T.*Messungen in einem Prozessrechnersystem mit einem eigenen Messrechner.* Technische Universitaet Muenchen. Institut fuer Informatik.*TUM-I8002.*1982. 016788 Stratila, S.* Injective factors (an exposition).* Technische Universitaet Muenchen. Institut fuer Mathematik.*TUM-M8205.*1982. 016789 Franke, C.*Analyse der Last in einem Vielbenutzersystem.* Hamburg U. Fachbereich Informatik.*Bericht nr. 85.*1982. 016790 Olnhoff, Th.*Funktionale Semantikbeschreibung von Anfrageoperationen in einem drei-schichtigen relationalen Datenbanksystem.* Hamburg U. Fachbereich Informatik.* Bericht nr. 84.*1982. 016791 Schoett, O.*Ein Modulkonzept in der Theorie Abstrakter Datentypen.* Hamburg U. Fachbereich Informatik.*Bericht nr. 81.*1981. 016792 Abrahamson, K.*The complexity of regular expressions with GOTO and BOOLEAN variables.* British Columbia U. Comp.Sci.Dept.*Tech.Rpt. 82-03.*1982. 016793 Ascher, U. Weiss, R.* Collocation for singular perturbation problems II: linear first order systems without turning points.* British Columbia U. Comp.Sci.Dept.*Tech.Rpt. 82-04.*1982. 016794 Chanson, S.T. Sinha, P.S.*Optimal macro scheduling.* British Columbia U. Comp.Sci.Dept.*Tech.Rpt. 81-11.*1981. 016795 Chanson, S.T. Law, B.*Strategy-independent program restructuring on bounded locality intervals.* British Columbia U. Comp.Sci.Dept.*Tech.Rpt. 81-09.*1981. 016796 Edelsbrunner, H. Kirkpatrick, D.G. Seidel, R.*On the shape of the plane.* British Columbia U. Comp.Sci.Dept.* Tech.Rpt. 81-15.*1981. 016797 Gilmore, P.C.*Solvable cases of the travelling salesman problem.* British Columbia U. Comp.Sci.Dept.*Tech.Rpt. 81-08.*1981. 016798 Kirkpatrick, D.G. Hell, P.*On the complexity of general graph factor problems.* British Columbia U. Comp.Sci.Dept.*Tech.Rpt. 81-07.*1981. 016799 Kirkpatrick, D.* Optimal search in planar subdivisions.* British Columbia U. Comp.Sci.Dept.*Tech.Rpt. 81-13.*1981. 016800 Kirkpatrick, D. Reisch, S.*Upper bounds for sorting integers on random access machines.* British Columbia U. Comp.Sci.Dept.*Tech.Rpt. 81-12.*1981. 016801 Mercer, R.E. Reiter, R.*The representation of presuppositions using defaults.* British Columbia U. Comp.Sci.Dept.*Tech.Rpt. 82-01.*1982. 016802 Rosenberg, R.S.*The computer and the state.* British Columbia U. Comp.Sci.Dept.*Tech.Rpt. 81-06.*1981. 016803 Seidel, R.*A convex hull algorithm for point sets in even dimensions.* British Columbia U. Comp.Sci.Dept.*Tech.Rpt. 81-14.*1981. 016804 Varah, J.M.*On fitting exponentials by nonlinear least squares.* British Columbia U. Comp.Sci.Dept.*Tech.Rpt. 82-02.*1982. 016805 Varah, J.M.*Pitfalls in the numerical solution of linear ill posed problems.* British Columbia U. Comp.Sci.Dept.* Tech.Rpt. 81-10.*1981. 016806 Chen, P.-Y.* Multiprocessor systems: interconnection networks, memory hierarchy, modeling and simulations.* Illinois U. Comp.Sci.Dept.*UIUCDCS-R-82-1083, Ph.D. Thesis. Chen, P.-Y.*1982. 016807 Gear, C.W. Petzold, L.R.*Differential/algebraic systems and matrix pencils.* Illinois U. Comp.Sci.Dept.* UIUCDCS-R-82-1086.*1982. 016808 McNabb, D.A. Beshers, G.M. Campbell, R.H.* Tcode: an intermediate code for the path PASCAL compiler.* Illinois U. Comp.Sci.Dept.*UIUCDCS-R-82-1060.*1982. 016809 Anderson, T. Lee, P.A.* Fault tolerance terminology proposals.* Newcastle Upon Tyne U. Computing Lab.*No. 174.*1982. 016810 Panzieri, F. Shrivastava, S.K.* Reliable remote calls for distributed UNIX: an implementation study.* Newcastle upon Tyne U. Computing Lab.*No. 177.*1982. * 016811 Treleaven, P.C. Gouveia Lima, I.*Japan's fifth generation computer systems.* Newcastle upon Tyne U. Computing Lab.* No. 176.*1982. 016812 Han, S.-P. Mangasarian, O.L.*Characterization of positive definite and semidefinite matrices via quadratic programming duality.* Wisconsin U. Comp.Sci.Dept.* Tech.Rpt. 473.*1982. 016813 Han, S.-P. Mangasarian, O.L.*A conjugate decomposition of the Euclidean space.* Wisconsin U. Comp.Sci.Dept.* Tech.Rpt. 480.*1982. 016814 Katz, R.H. Lehman, T.J.*Storage structures for versions and alternatives.* Wisconsin U. Comp.Sci.Dept.*Tech.Rpt. 479.*1982. 016815 Klug, A.*On conjunctive queries containing inequalities.* Wisconsin U. Comp.Sci.Dept.*Tech.Rpt. 477.*1982. 016816 Leland, W.E.*Density and reliability of interconnection topologies for multicomputers.* Wisconsin U. Comp.Sci.Dept.*Tech.Rpt. 478, Ph.D. Thesis. Leland, W.E.* 1982. 016817 Qi, L.*Some simple estimates for singular values of a real matrix.* Wisconsin U. Comp.Sci.Dept.*Tech.Rpt. 472.* 1982. 016818 Uhr, L. Schmitt, L.*The several steps from ICON to SYMBOL, using structured cone/pyramids.* Wisconsin U. Comp.Sci.Dept.*Tech.Rpt. 481.*1982. 016819 Birrell, A.D. Levin, R. Needham, R.M. Schroeder, M.D.* Grapevine: an exercise in distributed computing.* Xerox. Palo Alto Res. Center.*CSL-82-04.*1982. * 016820 Guttag, J. Horning, J. Wing, J.*Some notes on putting formal specifications to productive use.* Xerox. Palo Alto Res. Center.*CSL-82-03.*1982. 016821 McDaniel, G.*An analysis of a Mesa instruction set.* Xerox. Palo Alto Res. Center.*CSL-82-02.*1982. 016822 Black, J.B. Wilkes-Gibbs, D. Gibbs, R.W. Jr.*What writers need to know that they don't know they need to know.* Yale U. Cognitive Science Program.*Tech.Rpt. 08.*1981. 016823 Schank, R.C.*Representing meaning: an artificial intelligence perspective.* Yale U. Cognitive Science Program.*Tech.Rpt. 11.*1981. 016824 Shwartz, S.P.*The search for pronominal referents.* Yale U. Cognitive Science Program.*Tech.Rpt. 10.*1981. 016825 Shwartz, S.P.*Three-dimensional mental rotation revisited: picture plane rotation is really faster than depth rotation.* Yale U. Cognitive Science Program.*Tech.Rpt. 09.*1981. 016826 Johnson, P.N. Robertson, S.P.* MAGPIE: a goal based model of conversation.* Yale U. Comp.Sci.Dept.*Res.Rpt. 206.* 1981. 016827 Lehnert, W.G.* Affect units and narrative summarization.* Yale U. Comp.Sci.Dept.*Res.Rpt. 179.*1980. 016828 Lehnert, W. Dyer, M.G. Johnson, P.N. Yang, C.J. Harley, S.* BORIS: an experiment in in-depth understanding of narratives.* Yale U. Comp.Sci.Dept.*Res.Rpt. 188.*1981. 016829 Schank, R.C. Collins, G.C. Davis, E. Johnson, P.N. Lytinen, S. Reiser, B.J.*What's the point?* Yale U. Comp.Sci.Dept.*Res.Rpt. 205.*1981. 016830 Shapiro, E.Y.* Alternation and the computational complexity of logic programs.* Yale U. Comp.Sci.Dept.*Res.Rpt. 239.* 1982. * 016831 Borodin, A. von zur Gathen, J. Hopcroft, J.*Fast parallel matrix and GCD computations.* Toronto U. Comp.Sci.Dept.* Tech.Rpt. 156.*1982. * 099024 Computer science research review: 1980/1981. An annual report published by the Department of Computer Science, Carnegie-Mellon University. 016832 Duncan, R.P.*A Runge Kutta method using variable stepsizes for Volterra integral equations of the 2nd kind.* Toronto U. Comp.Sci.Dept.*Tech.Rpt. 157.*1982. 016833 Huff, K.E. Lesser, V.R.* Knowledge based command understanding: an example for the software development environment.* Massachusetts U. Comp. & Info.Sci.Dept.* COINS Tech.Rpt. 82-06.*1982. 016834 Lesser, V. Corkill, D. Pavlin, J. Lefkowitz, L. Hudlicka, E. Brooks, R. Reed, S.*A high-level simulation testbed for cooperative distributed problem solving.* Massachusetts U. Comp. & Info.Sci.Dept.*COINS Tech.Rpt. 81-16.*1981. 016835 Lindberg, B.* Pointwise error estimation for finite element discretizations, II.* Royal Inst. of Tech., Stockholm. Num.Anal. & Computing Sci.Dept.*TRITA-NA-8208.*1982. 016836 Mandai, T.*A necessary and sufficient condition of the well posedness of some weakly hyperbolic Cauchy problems.* Kyoto U. Res.Inst.Math.Sci.*RIMS-404.*1982. 016837 Miyake, N.*Constructive interaction.* Cal. U. San Diego. Human Info.Proces. Center.*CHIP 113.*1982. 016838 Price, W.L.*A fifth annotated bibliography of recent publications on data security & cryptography.* U.K. National Physical Lab. Info. Technology & Comp.Div.*DITC 04/82.*1982. 016839 Wald, J.A. Colbourn, C.J.* Steiner trees in probabilistic networks.* Saskatchewan U. Computational Sci.Dept.*Rpt. 82-07.*1982. 016840 Wald, J.A. Colbourn, C.J.* Steiner trees, partial 2-trees, and minimum IFI networks.* Saskatchewan U. Computational Sci.Dept.*Rpt. 82-06.*1982. 016841 Watson, G.S.*Large sample theory of the Fisher Von Mises distribution.* Princeton U. Stat.Dept.*Series 2. Tech.Rpt. 203.*1981. 016842 Wichmann, B.A.*Latest results from the procedure calling test, Ackermann's function.* U.K. National Physical Lab. Info. Technology & Comp.Div.*DITC 03/82.*1982. 016843 Ying-Sheng, H.*Estimation of the Lebesgue constant for polynomial interpolation on an approximately equidistant grid.* Royal Inst. of Tech., Stockholm. Num.Anal. & Computing Sci.Dept.*TRITA-NA-8207.*1982. VOL. 4, NO. 12 11/15/82 016844 Dannenberg, R.B.* AMPL: design, implementation, and evaluation of a multiprocessing language.* Carnegie Mellon U. Comp.Sci.Dept.*1981. 016845 Medina-Mora, R.* Syntax directed editing: towards integrated programming environments.* Carnegie Mellon U. Comp.Sci.Dept.* Ph.D. Thesis. Medina-Mora, R.*1982. 016846 Robinson, J.T.*Design of concurrency controls for transaction processing systems.* Carnegie Mellon U. Comp.Sci.Dept.*CMU-CS-82-114, Ph.D. Thesis. Robinson, J.T.*1982. 016847 Rychener, M.D.*Approaches to knowledge acquisition: the instructable production system project.* Carnegie Mellon U. Comp.Sci.Dept.*1981. 016848 Corson, Y.*Aspects psychologiques lies a l'interrogation d'une base de donnees.* INRIA.*Rapport de Recherche 126.* 1982. 016849 Gayolle, G. Flajolet, P. Hofri, M.*On a functional equation arising in the analysis of a protocol for a multi access broadcast channel.* INRIA.*Rapport de Recherche 131.* 1982. 016850 Madelaine, E.*Le systeme perluette et les preuves de representation de types abstraits.* INRIA.*Rapport de Recherche 133.*1982. 016851 Michard, A.*A new database query language for non-professional users: design principles and ergonomic evaluation.* INRIA.*Rapport de Recherche 127.*1982. 016852 Jomier, G.*An overview of systems modelling and evaluation tendencies.* INRIA.*Rapport de Recherche 134.*1982. 016853 Senach, B.*Aide a la resolution de probleme par presentation graphique des informations.* INRIA.*Rapport de Recherche 013.*1982. 016854 Jurkiewicz, E.* Stability of compromise solution in multicriteria decision making problem.* Polish Academy of Sciences. Inst. of Comp.Sci.*ICS PAS rpt. no. 455.*1981. 016855 Konikowska, B.* Information systems: on queries containing k-ary descriptors.* Polish Academy of Sciences. Inst. of Comp.Sci.*ICS PAS rpt. no. 466.*1982. 016856 Orlowska, E.*Logic of vague concepts: applications of rough sets.* Polish Academy of Sciences. Inst. of Comp.Sci.*ICS PAS rpt. no. 474.*1982. 016857 Orlowska, E.*Semantics of vague concepts: application of rough sets.* Polish Academy of Sciences. Inst. of Comp.Sci.*ICS PAS rpt. no. 469.*1982. 016858 Pawlak, Z.* Rough functions.* Polish Academy of Sciences. Inst. of Comp.Sci.*ICS PAS rpt. no. 467.*1981. 016859 Pawlak, Z.* Rough sets: power set hierarchy.* Polish Academy of Sciences. Inst. of Comp.Sci.*ICS PAS rpt. no. 470.*1982. 016860 Pawlak, Z.*Some remarks about rough sets.* Polish Academy of Sciences. Inst. of Comp.Sci.*ICS PAS rpt. no. 456.* 1982. 016861 Subieta, K.* Navigational facilities for relational data base.* Polish Academy of Sciences. Inst. of Comp.Sci.*ICS PAS rpt. no. 468.*1982. 016862 Winkowski, J.*An algebraic description of system behaviours.* Polish Academy of Sciences. Inst. of Comp.Sci.*ICS PAS rpt. no. 471.*1982. 016863 Adams, W.S.*Plain programming in NIAL.* Queen's U. Computing & Info.Sci.Dept.*Tech.Rpt. 82-138.*1982. * 016864 Akl, S.G.* Cryptographic solution to a multilevel security problem.* Queen's U. Computing & Info.Sci.Dept.* Tech.Rpt. 82-142.*1982. 016865 Crawford, R.G. Soong, L.P.*Survey of relational implementations prior to 1977.* Queen's U. Computing & Info.Sci.Dept.*Tech.Rpt. 82-140.*1982. 016866 Seppola, J.E.*The ISOTOL package.* Queen's U. Computing & Info.Sci.Dept.*Tech.Rpt. 82-139.*1982. 016867 Seppola, J.E.*Systems operations in Nial.* Queen's U. Computing & Info.Sci.Dept.*Tech.Rpt. 82-141.*1982. 016868 Keller, R.M.*A survey of research in strategy acquisition.* Rutgers U. Comp.Sci.Dept.*DCS-TR-115.*1982. 016869 Vichnevetsky, R.* Group velocity and reflection phenomena in numerical approximations of hyperbolic equations: a survey.* Rutgers U. Comp.Sci.Dept.*DCS-TR-116.*1982. * 016870 Paige, R.* Transformational programming--applications to algorithms and systems: summary paper.* Rutgers U. Comp.Sci.Dept.*DCS-TR-118.*1982. 016871 Ryder, B.G.* Incremental data flow analysis based on a unified model of elimination algorithms.* Rutgers U. Comp.Sci.Dept.*DCS-TR-117, Ph.D. Thesis. Ryder, B.G.* 1982. 016872 Steiger, W.L. Beuss, P.M.*Fast minimal distance enumeration of small combinations.* Rutgers U. Comp.Sci.Dept.* DCS-TR-119.*1982. 016873 Kelly, V.E. Steinberg, L.I.*The Critter system: analyzing digital circuits by propagating behaviors and specifications.* Rutgers U. Comp.Sci.Res.Lab.* LCSR-TR-030.*1982. 016874 Minsky, N.H.* Localization of power in software systems.* Rutgers U. Comp.Sci.Res.Lab.*LCSR-TR-029.*1982. 016875 Lafue, G.M.E. Mitchell, T.M.* Data base management systems and expert systems for CAD.* Rutgers U. Comp.Sci.Res.Lab.*LCSR-TR-028.*1982. 016876 Sridharan, N.S.*A flexible structure for knowledge: examples of legal concepts.* Rutgers U. Comp.Sci.Res.Lab.* LRP-TR-014.*1982. 016877 Venkataraman, K.N.* Decidability of the purely existential fragment of the theory of term algebras.* Rutgers U. Comp.Sci.Res.Lab.*CTA-TR-004, Ph.D. Thesis. Venkataraman, K.N.*1981. 024931 Aikins, J.S. Kunz, J.C. Shortliffe, E.H. Fallat, R.J.* PUFF: an expert system for interpretation of pulmonary function data.* Stanford U. Comp.Sci.Dept.* STAN-CS-82-931; Stanford U. Comp.Sci.Dept. Heuristic Programming Project.*HPP-82-013.*1982. 21p. 024924 Berger, M.J.* Adaptive mesh refinement for hyperbolic partial differential equations.* Stanford U. Comp.Sci.Dept.*STAN-CS-82-924, Ph.D. Thesis. Berger, M.J.* 1982. 118p. 024926 Buchanan, B.G. Duda, R.O.*Principles of rule based expert systems.* Stanford U. Comp.Sci.Dept.*STAN-CS-82-926; Stanford U. Comp.Sci.Dept. Heuristic Programming Project.* HPP-82-014.*1982. 55p. 024939 Cohen, P.R.* Planning and problem solving.* Stanford U. Comp.Sci.Dept.*STAN-CS-82-939; Stanford U. Comp.Sci.Dept. Heuristic Programming Project.*HPP-82-021.*1982. 61p. 024913 Dietterich, T.G. London, B. Clarkson, K. Dromey, G.* Learning and inductive inference (a section of the Handbook of Artificial Intelligence, edited by Paul R. Cohen and Edward A. Feigenbaum).* Stanford U. Comp.Sci.Dept.*STAN-CS-82-913; Stanford U. Comp.Sci.Dept. Heuristic Programming Project.*HPP-82-010.*1982. 215p. 024938 Kanade, T.* Vision. By Takeo Kanade. Assistant Editor: Steven A. Shafer. Contributors: David A. Bourne, Rodney Brooks, Nancy H. Cornelius, James L. Crowley, Hiromichi Fujisawa, Martin Herman, Fuminobu Komura, Bruce D. Lucas, Steven A. Shafer, David R. Smith, Steven L. Tanimoto, Charles E. Thorpe.* Stanford U. Comp.Sci.Dept.* STAN-CS-82-938; Stanford U. Comp.Sci.Dept. Heuristic Programming Project.*HPP-82-020.*1982. 220p. 024933 Klein, S.T. Shamir, E.*An algorithmic method for studying percolation clusters.* Stanford U. Comp.Sci.Dept.* STAN-CS-82-933.*1982. 12p. 024928 Kuhn, I.M. Wiederhold, G. Rodnick, J.E. Ramsey-Klee, D.M. Benett, S. Beck, D.D.*Automated ambulatory medical record systems in the U.S.* Stanford U. Comp.Sci.Dept.* STAN-CS-82-928.*1982. 66p. 024929 Maier, D. Ullman, J.D.* Fragments of relations.* Stanford U. Comp.Sci.Dept.*STAN-CS-82-929.*1982. 11p. 024941 Martin, P.A.*Integrating local information to understand dialog.* Stanford U. Comp.Sci.Dept.*STAN-CS-82-941; Stanford U. Comp.Sci.Dept. A.I. Lab.*AIM-348, Ph.D. Thesis. Martin, P.A.*1982. 125p. 024917 Mujtaba, M.S.* Motion sequencing of manipulators.* Stanford U. Comp.Sci.Dept.*STAN-CS-82-917, Ph.D. Thesis. Mujtaba, M.S. (Department of Industrial Engineering and Engineering Management).*1982. 291p. 024911 Roberts, B.J. Marashian, I.* Bibliography of Stanford computer science reports, 1963-1982.* Stanford U. Comp.Sci.Dept.*STAN-CS-82-911.*1982. 59p. 024921 Salisbury, J.K. Jr.* Kinematic and force analysis of articulated hands.* Stanford U. Comp.Sci.Dept.* STAN-CS-82-921, Ph.D. Thesis. Salisbury, J.K. (Department of Mechanical Engineering).*1982. 97p. 024932 Shortliffe, E.H. Fagan, L.M.* Expert systems research: modeling the medical decision meking process.* Stanford U. Comp.Sci.Dept.*STAN-CS-82-932; Stanford U. Comp.Sci.Dept. Heuristic Programming Project.*HPP-82-003.* 1982. 23p. 024922 Suwa, M. Scott, A.C. Shortliffe, E.H.*An approach to verifying completeness and consistency in a rule based expert system.* Stanford U. Comp.Sci.Dept.* STAN-CS-82-922.*1982. 19p. 024927 Ullman, J.D.*Combining state machines and regular expressions for automatic synthesis of VLSI circuits.* Stanford U. Comp.Sci.Dept.*STAN-CS-82-927.*1982. 14p. 024919 Wall, D.W.*Mechanisms for broadcast and selective broadcast.* Stanford U. Comp.Sci.Dept.*STAN-CS-82-919; Stanford U. SEL. Comp. Systems Lab.*Tech.rpt. 190, Ph.D. Thesis. Wall, D.W.*1980. 112p. 024923 Wallis, J.W. Shortliffe, E.H.* Explanatory power for medical expert systems: studies in the representation of causal relationships for clinical consultation.* Stanford U. Comp.Sci.Dept.*STAN-CS-82-923.*1982. 37p. 024925 Wolper, P.L.*Synthesis of communicating processes from temporal logic specifications.* Stanford U. Comp.Sci.Dept.*STAN-CS-82-925, Ph.D. Thesis. Wolper, P.L.* 1982. 111p. 038208 Dong, H. McCluskey, E.J.* Concurrent testing of programmable logic arrays.* Stanford U. SEL. Comp. Systems Lab.*Tech. note 208; Stanford U. SEL. Comp. Systems Lab. Center for Reliable Computing.*Rpt. 82-11.* 1982. 20p. 038203 Hassan, S.Z.*Algebraic analysis of parallel signature analyzers.* Stanford U. SEL. Comp. Systems Lab.*Tech. note 203; Stanford U. SEL. Comp. Systems Lab. Center for Reliable Computing.*Rpt. 82-05.*1982. 22p. 038206 Hassan, S.Z.* Testing PLAs using multiple parallel signature analyzers.* Stanford U. SEL. Comp. Systems Lab.*Tech. note 206; Stanford U. SEL. Comp. Systems Lab. Center for Reliable Computing.*Rpt. 82-09.*1982. 21p. 038210 Hirose, F. Singh, V.* McDDP, a program for partitioning verfication testing matrices.* Stanford U. SEL. Comp. Systems Lab.*Tech. note 210; Stanford U. SEL. Comp. Systems Lab. Center for Reliable Computing.*Rpt. 82-13.* 1982. 25p. 038201 Hughes, J.L.A.*A high-level representation for implementing control flow structures in dataflow programs.* Stanford U. SEL. Comp. Systems Lab.*Tech. note 201; Stanford U. SEL. Comp. Systems Lab. Center for Reliable Computing.* Rpt. 82-04.*1982 22p. 038205 Ichikawa, M.* Constant weight code generators.* Stanford U. SEL. Comp. Systems Lab.*Tech. note 205; Stanford U. SEL. Comp. Systems Lab. Center for Reliable Computing.* Rpt. 82-07.*1982. 57p. 038202 Johnson, J.D.* DEL formats for recursive languages.* Stanford U. SEL. Comp. Systems Lab.*Tech. note 202.*1982. 12p. * 038196 Kanuma, A.*A high level language construct to avoid global loop bottleneck.* Stanford U. SEL. Comp. Systems Lab.* Tech. note 196.*1982. 36p. 038207 Khakbaz, J. McCluskey, E.J.*Self-testing embedded parity checkers -- exhaustive XOR gate testing.* Stanford U. SEL. Comp. Systems Lab.*Tech. note 207; Stanford U. SEL. Comp. Systems Lab. Center for Reliable Computing.*Rpt. 82-10.*1982. 31p. 038211 McCluskey, E.J.*Built-in verification test.* Stanford U. SEL. Comp. Systems Lab.*Tech. note 211; Stanford U. SEL. Comp. Systems Lab. Center for Reliable Computing.*Rpt. 82-12.*1982. 8p. 038198 McCluskey, E.J.*A discussion of multiple valued logic circuits.* Stanford U. SEL. Comp. Systems Lab.*Tech. note 198; Stanford U. SEL. Comp. Systems Lab. Center for Reliable Computing.*Rpt. 82-02.*1982. 7p. 038199 McCluskey, E.J.* Fault tolerant systems.* Stanford U. SEL. Comp. Systems Lab.*Tech. note 199; Stanford U. SEL. Comp. Systems Lab. Center for Reliable Computing.*Rpt. 82-01. 23p. 038197 McCluskey, E.J.* Verification testing.* Stanford U. SEL. Comp. Systems Lab.*Tech. note 197; Stanford U. SEL. Comp. Systems Lab. Center for Reliable Computing.*Rpt. 82-07.* 1982. 6p. 038204 Namjoo, M.*Design of concurrently testable microprogrammed control units.* Stanford U. SEL. Comp. Systems Lab.* Tech. note 204; Stanford U. SEL. Comp. Systems Lab. Center for Reliable Computing.*Rpt. 82-06.*1982. 30p. 038213 Namjoo, M.*Design of concurrently testable microprogrammed control units.* Stanford U. SEL. Comp. Systems Lab.* Tech. note 213; Stanford U. SEL. Comp. Systems Lab. Center for Reliable Computing.*Rpt. 82-14.*1982. 8p. Preprint of a paper to be published in the Proceedings of the MICRO-15 Workshop, Palo Alto, California, October 4-7, 1982. 038212 Namjoo, M.*Techniques for concurrent testing of VLSI processor operation.* Stanford U. SEL. Comp. Systems Lab.*Tech. note 212; Stanford U. SEL. Comp. Systems Lab. Center for Reliable Computing.*Rpt. 82-13.*1982. 8p. 038209 Rossetti, D.J. Iyer, R.K.* Software related failures on the IBM 3081: a relationship with system utilization.* Stanford U. SEL. Comp. Systems Lab.*Tech. note 209; Stanford U. SEL. Comp. Systems Lab. Center for Reliable Computing.*Rpt. 82-08.*1982. 46p. 038200 Stanford U. SEL. Comp. Systems Lab. Center for Reliable Computing.*1982 International Symposium on Fault Tolerant Computing ( FTCS-12) Preprints.* Stanford U. SEL. Comp. Systems Lab.*Tech. note 200; Stanford U. SEL. Comp. Systems Lab. Center for Reliable Computing.*Rpt. 82-03.* 1982. 32p. Contents: McCluskey, E.J.*Test question, keynote address; Dong, H.*Modified Berger codes for detection of unidirectional errors; Iyer, R.K. Rossetti, D.J.*A statistical load dependency model for CPU errors at SLAC; Khakbaz, J.*Self-testing embedded parity trees; Namjoo, M. McCluskey, E.J.*Watchdog processors and capability checking; Wang, L.-T.*Autonomous linear feedback shift register with on-line fault-detection capability. * 025229 Bechtolsheim, A. Baskett, F. Pratt, V.*The SUN workstation architecture.* Stanford U. SEL. Comp. Systems Lab.* Tech.rpt. 229.*1982. 15p. 025230 Gonsalves, T.A.* Packet voice communication on an ethernet local computer network: an experimental study.* Stanford U. SEL. Comp. Systems Lab.*Tech.rpt. 230.*1982. 19p. 016878 Agar, E.M. Brewster, J. Friedlander, C.* Speech producing communication enhancement device user's manual.* Wayne State U. Comp.Sci.Dept.*CSC-82-014.*1982. 016879 Barlow, R.E. Hsiung, J.H.*Expected information from a life test experiment.* Cal U., Berkeley. O.R. Center.*ORC 82-05.*1982. 016880 Chang, D.Y.-C. Lawrie, D.*Performance of multiprocessor systems with space and access contention.* Illinois U. Comp.Sci.Dept.*UIUCDCS-R-82-1085.*1982. 016881 Corneil, D. Goldberg, M.*A non-factorial algorithm for canonical numbering of a graph.* Toronto U. Comp.Sci.Dept.*Tech.rpt. 160.*1982. * 016882 Culik, K.*On formal and informal proofs for program correctness.* Wayne State U. Comp.Sci.Dept.*CSC-82-013.* 1982. * 016883 DeWitt, D.J. Friedland, D.B. Hsiao, D.K. Menon, J.*A taxonomy of parallel sorting algorithms.* Wisconsin U. Comp.Sci.Dept.*Tech.rpt 482.*1982. 016884 Eklundh, J.-O.* Knowledge based image analysis: some aspects of images using other types of information.* Royal Inst. of Tech., Stockholm. Num.Anal. & Computing Sci.Dept.*TRITA-NA-8206.*1982. 016885 Fairweather, G. Keast, P.* ROWCOL - a package for solving almost block diagonal linear systems arising in H (superscript -1) Galerkin and collocation H (superscript -1)-Galerkin methods.* Toronto U. Comp.Sci.Dept.* Tech.rpt. 158.*1982. 016887 Hammarling, S.J.*Some notes on the use of orthogonal similarity transformations in control.* U.K. National Physical Lab. Info. Technology and Computing Div.*DITC 08/82.*1982. 016888 Hardie, P.A.* Process migration for resource allocation in distributed operating systems.* Saskatchewan U. Computational Sci.Dept.*Rpt. 82-09.*1982. 016889 Haynes, C.T.*A theory of data type representation independence.* Iowa U. Comp.Sci.Dept.*Tech.rpt. 82-04, Ph.D. Thesis. Haynes, C.T.*1982. * 016890 Israel, D.J.*On interpreting semantic network formalisms.* Bolt, Beranek and Newman, Inc.*BBN rpt. 5117.*1982. 016891 Katz, R.H. Moran, J. Ramschandran, U. Schuh, D.*Experiences in porting and extending CAD software.* Wisconsin U. Comp.Sci.Dept.*Tech.rpt. 484.*1982. 016892 Langmyhr, D.F.*A general assembler for microprocessors.* Oslo U. Informatics Inst.*Res.rpt. 069.*1982. 016893 Lansner, A.* Information processing in a network of model neurons: a computer simulation study.* Royal Inst. of Tech., Stockholm. Num.Anal. & Computing Sci.Dept.* TRITA-NA-8211.*1982. 016894 Lytle, R.J.* Site characterization using knowledge engineering -- an approach for improving future performance.* Cal U. Lawrence Livermore Lab.*UCID-19560.* 1982. 016895 Maluszynski, J.* Two level grammars - an equational approach.* Hamburg U. Institut fuer Informatik.*Bericht nr. 086.*1982. 016896 McLean, J.*A formal foundation for the trace method of software specification.* U.S. Naval Res.Lab.*NRL Memo.Rpt. 4874.*1982. 016897 Ross, S.M. Schiechner, Z.*Some reliability applications of the variability ordering.* Cal U., Berkeley. O.R. Center.*ORC 82-06.*1982. 016898 Schiel, U.*The temporal hierarchic data model ( THM).* Stuttgart. Universitaet. Institut fuer Informatik.* Bericht 10/82.*1982. 016899 Schmidt, J.W. Lamersdorf, W.* Relational data model: a definition and its formalization.* Hamburg U. Institut fuer Informatik.*Bericht nr. 088.*1982. 016900 Sidner, C.L.* Protocols of users manipulating visually presented information with natural language.* Bolt, Beranek and Newman, Inc.*BBN rpt. 5128.*1982. 016902 U.K. National Physical Lab. Protocol Standards Group. Rayner, D.*A system for testing protocol implementations, by the NPL Protocol Standards Group. Edited by D. Rayner.* U.K. National Physical Lab. Info. Technology and Computing Div.*DITC 09/82.*1982. 016903 Wand, A.*Coroutine sequencing in SIMULA. Part I: What is wrong with the QPS definition? Part II: Some alternatives for redefinition of QPS. Part III: Proofs from part II.* Oslo U. Informatics Inst.*Res.rpt. 070.*1982. 3 volumes. 016904 Yesha, Y.* Time space tradeoffs for matrix multiplication and the discrete Fourier transform on any general sequential random-access computer.* Toronto U. Comp.Sci.Dept.*Tech.rpt. 159.*1982. 016905 Zahar, R.V.M.*The computation of subdominant solutions of linear difference systems.* Auckland U. Comp.Sci.Dept.* Rpt. 027.*1982. 016906 Zu-fan, M.* Partitioning a stiff ordinary differential system by a scaling technique.* Royal Inst. of Tech., Stockholm. Num.Anal. & Computing Sci.Dept.*TRITA-NA-8211.* 1982. VOL. 4, NO. 13 1/15/83 016907 Carbonell, J.G.* Learning by analogy: formulating and generalizing plans from past experience.* Carnegie Mellon U. Comp.Sci.Dept.*CMU-CS-82-126.*1982. 016908 Carbonell, J.G.* Meta-language utterances in purposive discourse.* Carnegie Mellon U. Comp.Sci.Dept.* CMU-CS-82-125.*1982. 016909 Ericson, L.W.* DPL-82: a language for distributed processing.* Carnegie Mellon U. Comp.Sci.Dept.* CMU-CS-82-129.*1982. 016910 Leverett, B.W.*Topics in code generation and register allocation.* Carnegie Mellon U. Comp.Sci.Dept.* CMU-CS-82-130.*1982. 016911 Schwanke, R.W.* Execution environments in programming languages and operating systems.* Carnegie Mellon U. Comp.Sci.Dept.*CMU-CS-82-124. Ph.D. Thesis. Schwanke, R.W.*1982. 016912 Tomita, M.* Learning of construction of finite automata from examples using hill climbing. RR: regular set recognizer.* Carnegie Mellon U. Comp.Sci.Dept.* CMU-CS-82-127.*1982. 016913 Archer, J.E. Jr.*The design and implementation of a cooperative program development environment.* Cornell U. Comp.Sci.Dept.*Tech.rpt. 81-468, Ph.D. Thesis. Archer, J.E. Jr.*1982. 016914 Archer, J. Jr.* Display condensation of program test.* Cornell U. Comp.Sci.Dept.*Tech.rpt. 81-463.*1981. 016915 Borodin, A. Hopcroft, J.E.* Merging on parallel models of computation.* Cornell U. Comp.Sci.Dept.*Tech.rpt. 80-472.*1981. 016916 Constable, R.L. Zlatin, D.R.*The type theory of PL/CV3.* Cornell U. Comp.Sci.Dept.*Tech.rpt. 81-464.*1981. 016917 Helle, O.*On the use of abstract data types to specify the modules of a system.* Cornell U. Comp.Sci.Dept.*Tech.rpt. 81-469.*1981. 016918 Kadin, J.*A note on the complexity of Goedel numberings and isomorphisms.* Cornell U. Comp.Sci.Dept.*Tech.rpt. 81-466.*1981. 016919 Krafft, D.B.* AVID: a system for the interactive development of verifiably correct programs.* Cornell U. Comp.Sci.Dept.*Tech.rpt. 81-467.*1981. 016920 Luk, F.T.*On the Minres method of factor analysis.* Cornell U. Comp.Sci.Dept.*Tech.rpt. 81-465.*1981. 016921 Luk, F.T.* Orthodonal rotation to a partially specified target.* Cornell U. Comp.Sci.Dept.*Tech.rpt. 81-470.* 1981. 016922 Pevsner, C.D.* Rendezvous primitives for operating system design.* Cornell U. Comp.Sci.Dept.*Tech.rpt. 81-471.* 1982. 016923 Pritchard, P.*Fast compact prime number sieves (among others).* Cornell U. Comp.Sci.Dept.*Tech.rpt. 81-473.* 1981. 016924 Barnes, E.R.*An algorithm for separating patterns by ellipsoids.* IBM Watson Res. Center.*RC 9500.*1982. 016925 Blum, A. MacNair, E.A. Sauer, C.H.*The research queueing Package: graphics developments.* IBM Watson Res. Center.* RC 9513.*1982. 016926 Burstein, M. Hong, S.J. Nair, R.*Spatial distribution of wires in master slice VLSI.* IBM Watson Res. Center.*RC 9477.*1982. 016927 Bux, W. Truong, H.L.* Mean delay qpproximation for cyclic service queueing systems.* IBM Watson Res. Center.*RZ 1162.*1982. 016928 Carroll, J.M. Mack, R.L.*Actively learning to use a word processor.* IBM Watson Res. Center.*RC 9482.*1982. 016929 Carroll, J.M. Mack, R.L.* Learning to use a word processor: by doing, by thinking, and by knowing.* IBM Watson Res. Center.*RC 9481.*1982. 016930 Carroll, J.M.*Learning, using, and designing filenames and command paradigms.* IBM Watson Res. Center.*RC 9488.* 1982. 016931 Engbersen, A.P.J.* TOPPSY: a time overlapped parallel processing system.* IBM Watson Res. Center.*RZ 1164.* 1982. 016932 Fagin, R. Vardi, M.Y.* Armstrong databases for functional and inclusion dependencies.* IBM Watson Res. Center.*RJ 3500.*1982. 016933 Gladney, H.M.*A note on enumerations.* IBM Watson Res. Center.*RJ 3573.*1982. 016934 Goodman, T.N.T. Micchelli, C.A.*Limits of spline functions with period knots.* IBM Watson Res. Center.*RC 9478.* 1982. 016935 Guido, A.A. Mainey, D.T. Penney, B.H.* Centralized computer operations.* IBM Watson Res. Center.*RC 9485.*1982. 016936 Kirkpatrick, D.G. Klawe, M.M.* Alphabetic minimax trees.* IBM Watson Res. Center.*RJ 3543.*1982. 016937 Klawe, M.*Limitations on explicit constructions of expanding graphs.* IBM Watson Res. Center.*RJ 3544.*1982. 016938 Koenig, W. Etienne, R.* Hierarchical decomposition and parameterization in a VLSI layout editor.* IBM Watson Res. Center.*RJ 3549.*1982. 016939 Ladner, R.E. Lipton, R.J. Stockmeyer, L.J.* Alternating pushdown and stack automata.* IBM Watson Res. Center.*RC 9415.*1982. 016940 Lew, J.S. Quarles, D.A. Jr.* Nonnegative solutions of a nonlinear recurrence.* IBM Watson Res. Center.*RC 9427.* 1982. 016941 Lewis, C. Mack, R.*The role of abduction in learning to use a computer system.* IBM Watson Res. Center.*RC 9433.* 1982. 016942 Liniger, W. Odeh, F.*Accurate multistep methods for`smooth stiff problems.* IBM Watson Res. Center.*RC 9473.*1982. 016943 Liu, C.N. Fatemi, M. Waag, R.C.*Digital processing for improvement of ultrasonic abdominal images.* IBM Watson Res. Center.*RC 9499.*1982. 016944 Malhotra, A. Markowitz, H.M. Pazel, D.P.*The EAS-E programming language.* IBM Watson Res. Center.*RC 8935.* 1981, revised. 016945 Morgan, S.P.* Formal specification of static semantics with an affix grammar translator generator.* IBM Watson Res. Center.*RC 9456.*1982. 016946 Roth, J.P. Levy, L.S.*Equivalence of hardware and software.* IBM Watson Res. Center.*RC 9464.*1982. 016947 Roth, J.P.* VLSI verification and correction: 16th IBM Computer Science Symposium, Tokyo, October 1-4, 1982.* IBM Watson Res. Center.*RC 9525.*1982. 016948 Savir, J.*Good controllability and observability do not guarantee good testability.* IBM Watson Res. Center.*RC 9432.*1982. 016949 Stone, H.S.*Data base applications of the FETCH-AND-ADD instruction.* IBM Watson Res. Center.*RC 9467.*1982. 016950 Tcha, D.-W. Lee, B.-I.*A branch and bound algorithm for the multi-level uncapacitated facility location problem.* IBM Watson Res. Center.*RC 9533.*1982. 016951 Tsai, R.Y. Huang, T.S.*Analysis of 3-D time varying scene.* IBM Watson Res. Center.*RC 9479.*1982. 016952 Weller, D.L.* Device independence using dynamic generic operator selection.* IBM Watson Res. Center.*RJ 3518.* 1982. 016953 Weller, D.L.*A relational representation of an abstract type system.* IBM Watson Res. Center.*RJ 3503.*1982. 016954 Wolfe, P.*Checking the calculation of gradients.* IBM Watson Res. Center.*RC 9459.*1982. 016955 Ziv, A. Toupin, R.A.*An iterative method for the computation of eigenvalues of a matrix.* IBM Watson Res. Center.*RC 9491.*1982. 016956 Bernadou, M. Ciarlet, P.G. Hu, J.*On the convergence of incremental methods in finite elasticity.* INRIA.*Rapport de Recherche 135.*1982. 016957 Chavent, G.*Local stability of the output least square: parameter estimation technique.* INRIA.*Rapport de Recherche 136.*1982. 016958 Darondeau, P.*An enlarged definition and complete axiomatization of observational congruence of finite processes.* INRIA.*Rapport de Recherche 140.*1982. 016959 Glowinski, R. Keller, H. Reinhart, L.* Continuation conjugate gradient methods for the least square solution of nonlinear boundary value problems.* INRIA.*Rapport de Recherche 141.*1982. 016960 Magazine, M.*An approximation to the optimum checkpoint interval using integer programming.* INRIA.*Rapport de Recherche 139.*1982. 016961 Melese, B.* Metal, un langage de specification pour le systeme mentor.* INRIA.*Rapport de Recherche 142.*1982. 016962 Barber, G. Hewitt, C.*Foundations for office semantics.* M.I.T. Lab. for Comp.Sci.*TM-225.*1982. 016963 Barber, G.*Supporting organizational problem solving with a workstation.* M.I.T. Lab. for Comp.Sci.*TM-224.*1982. 016964 Bergstra, J. Chmielinska, A. Tiuryn, J.*" Hoare's logic is not complete when it could be".* M.I.T. Lab. for Comp.Sci.*TM-226.*1982. 016965 Chu, T.-A.* Circuit analysis of self timed elements for NMOS VLSI systems.* M.I.T. Lab. for Comp.Sci.*TM-220.* 1982. 016966 Cosmadakis, S.S.*The complexity of evaluation relational queries.* M.I.T. Lab. for Comp.Sci.*TM-229.*1982. 016967 diSessa, A.A.*A principled design for an integrated computational environment.* M.I.T. Lab. for Comp.Sci.* TM-223.*1982. 016968 Jouannaud, J.-P. Lescanne, P. Reinig, F.* Recursive decomposition ordering and multiset orderings.* M.I.T. Lab. for Comp.Sci.*TM-219.*1982. 016969 Kleitman, D. Leighton, F.T. Lepley, M. Miller, G.L.*An asymptotically optimal layout for the shuffle exchange graph.* M.I.T. Lab. for Comp.Sci.*TM-231.*1982. 016970 Leighton, F.T. Lepley, M. Miller, G.L.* Layouts for the shuffle exchange graph based on the complex plane diagram.* M.I.T. Lab. for Comp.Sci.*TM-221.*1982. 016971 Leighton, F.T.*New lower bound techniques for VLSI.* M.I.T. Lab. for Comp.Sci.*TM-227.*1982. 016972 Papadimitriou, C.H. Zachos, S.K.*Two remarks on the power of counting.* M.I.T. Lab. for Comp.Sci.*TM-228.*1982. 016973 Shamir, A.*Embedding cryptographic trapdoors in arbitrary knapsack systems.* M.I.T. Lab. for Comp.Sci.*TM-230.* 1982. 016974 Sieker, F.M. zu*A telex gateway for the internet.* M.I.T. Lab. for Comp.Sci.*TM-222.*1982. 020279 Anderson, T.L.*The design of a multiprocessor development system.* M.I.T. Lab for Comp.Sci.*TR-279.*1982. 020277 Johnson, M.G.*Efficient modeling for short channel MOS circuit simulation.* M.I.T. Lab for Comp.Sci.*TR-277.* 1982. 020275 Kunin, J.S.*Analysis and specification of office procedures.* M.I.T. Lab for Comp.Sci.*TR-275, Ph.D. Thesis. Kunin, J.S. (This report is a minor revision of a thesis of the same title submitted to the Department of Electrical Engineering and Computer Science in January 1982).*1982. 020274 Leighton, F.T.* Layouts for the shuffle exchange graph and lower bound techniques for VLSI.* M.I.T. Lab for Comp.Sci.*TR-274, Ph.D. Thesis. Leighton, F.T.*1982. 020278 Rosenstein, L.S.* Display management in an integrated office workstation.* M.I.T. Lab for Comp.Sci.*TR-278.* 1982. 020276 Srivas, M.K.*Automatic synthesis of implementations for abstract data types from algebraic specifications.* M.I.T. Lab for Comp.Sci.*TR-276, Ph.D. Thesis. Srivas, M.K. (This report is a minor revision of a thesis of the same title submitted to the Department of Electrical Engineering and Computer Science in December 1981).*1982. 016975 Hemker, P.W.*Numerical aspects of singular perturbation problems.* Mathematisch Centrum.*NW 133/82.*1982. 016976 Houwen, P.J. van der Sommeijer, B.P.*Improved absolute stability of predictor corrector methods for retarded differential equations.* Mathematisch Centrum.*NW 135/82.* 1982. 016977 Houwen, P.J. van der Te Riele, H.J.J.* Linear multistep methods for Volterra integral equations of the second kind.* Mathematisch Centrum.*NW 134/82.*1982. 016978 Vries, H.B. de*The two-level algorithm in the solution of the initial value problem for partial differential equations.* Mathematisch Centrum.*NW 136/82.*1982. 016979 Hemker, P.W. Zeeuw, P.M. de* Defect correction for the solution of a singular perturbation problem.* Mathematisch Centrum.*NW 132/82.*1982. 016980 Bakker, J.W. de Zucker, J.I.* Processes and the denotational semantics of concurrency.* Mathematisch Centrum.*IW 209/82.*1982. 016981 Bergstra, J.A. Klop, J.W.* Fixed point semantics in process algebras.* Mathematisch Centrum.*IW 206/82.*1982. 016982 Bergstra, J.A. Tucker, J.V.* Hoare's logic for programming languages with two data types.* Mathematisch Centrum.*IW 207/82.*1982. 016983 Rosenthal, D.S.H.*Managing graphical resources.* Mathematisch Centrum.*IW 205/82.*1982. 016984 Rosenthal, D.S.H. Ten Hagen, P.J.W.* GKS in C.* Mathematisch Centrum.*IW 204/82.*1982. 024937 Ballantyne, M. Bledsoe, W.W. Doyle, J. Moore, R.C. Pattis, R. Rosenschein, S.J.* Automatic deduction (Chapter XII of Volume III of the Handbook of Artificial Intelligence, edited by Paul R. Cohen and Edward A. Feigenbaum).* Stanford U. Comp.Sci.Dept.*STAN-CS-82-937; Stanford U. Comp.Sci.Dept. Heuristic Programming Project.*HPP-82-019.* 1982. 64p. 024934 Barr, A. Cohen, P.R. Fagan, L.*Understanding spoken language (Chapter V of Volume I of the Handbook of Artificial Intelligence, edited by Avron Barr and Edward A. Feigenbaum).* Stanford U. Comp.Sci.Dept.* STAN-CS-82-934; Stanford U. Comp.Sci.Dept. Heuristic Programming Project.*HPP-82-016.*1982. 52p. 024936 Cohen, P.R.*Models of cognition (Chapter XI of Volume III of the Handbook of Artificial Intelligence, edited by Paul R. Cohen and Edward A. Feigenbaum).* Stanford U. Comp.Sci.Dept.*STAN-CS-82-936; Stanford U. Comp.Sci.Dept. Heuristic Programming Project.*HPP-82-018.*1982. 87p. 024935 Tappel, S. Westfold, S. Barr, A.* Programming languages for AI research (Chapter VI of Volume II of the Handbook of Artificial Intelligence, edited by Avron Barr and Edward A. Feigenbaum).* Stanford U. Comp.Sci.Dept.* STAN-CS-82-935; Stanford U. Comp.Sci.Dept. Heuristic Programming Project.*HPP-82-017.*1982. 90p. 024943 Woods, D.R.*Drawing planar graphs.* Stanford U. Comp.Sci.Dept.*STAN-CS-82-943, Ph.D. Thesis. Woods, D.R.* 1981. 016985 Kautz, H.A.*A first-order dynamic logic for planning.* Toronto U. Comp. Systems Res. Group.*CSRG-144.*1982. 016986 Lengauer, C.*A methodology for programming with concurrency.* Toronto U. Comp. Systems Res. Group.* CSRG-142, Ph.D. Thesis. Lengauer, C.*1982. 016987 Lochovsky, F.H.* Alpha beta, edited by F.H. Lochovsky.* Toronto U. Comp. Systems Res. Group.*CSRG-143.*1982. Contents: (1) Lochovsky, F.H. Tsichritzis, D.C.* Interactive query language for external data bases; (2) Mendelzon, A.O.*A database editor; (3) Lee, D.L.*A voice response system for an office information system; (4) Gibbs, S.J.* Office information models and the representation of 'office objects'; (5) Martin, P.* Tsichritzis, D.C.*A message management model; (6) Nierstrasz, O.*Tsichritzis, D.C.* Message flow modeling; (7) Tsichritzis, D.C. Christodoulakis, S. Faloutsos, C.* Design considerations for a message file server. 016988 Chen, T.Y.*On the fixpoints of nondeterministic recursive definitions.* Hong Kong U. Comp. Studies and Appl. Centre.*TR-C4-82.*1982. 016989 Culik, K. Natour, I.A.* Ambiguity types of formal grammars.* Wayne State U. Comp.Sci.Dept.*CSC-82-014.*1982. 016990 Dellarosa, D. Bourne, L.E. Jr.*Text-based decisions: changes in the availability of facts due to instructions and the passage of time.* Colorado U. Cognitive Sci.Inst.* Tech.rpt. 115-ONR.*1982. 016991 Gallopoulos, E. McEwan, S. Visek, D.* MPP simulator manual.* Illinois U. Comp.Sci.Dept.*UIUCDCS-R-82-1075.*1982. 016992 Gevarter, W.B.*An overview of computer vision.* U.S. National Bureau of Standards.*NBSIR 82-2582.*1982. 016993 Gustafson, S.-A.* Complementarity and weak duality in semi infinite programming.* Royal Inst. of Tech., Stockholm. Num.Anal. & Computing Sci.Dept.*TRITA-NA-8217.*1982. 016994 Hu, Y.-S.* Lebesque's constant for natural cubic splines.* Royal Inst. of Tech., Stockholm. Num.Anal. & Computing Sci.Dept.*TRITA-NA-8201.*1982. 016995 Imielinski, T. Lipski, W. Jr.*A systematic approach to relational database theory.* Polish Academy of Sciences. Inst. of Comp.Sci.*ICS PAS rpt. no. 457.*1982. 016996 Imielinski, T. Lipski, W. Jr.*A technique for translating states between database schemata.* Polish Academy of Sciences. Inst. of Comp.Sci.*ICS PAS rpt. no. 458.*1982. 016997 Lotstedt, P.*Numerical simulation of time dependent contact and friction problems in rigid body mechanics.* Royal Inst. of Tech., Stockholm. Num.Anal. & Computing Sci.Dept.*TRITA-NA-8214.*1982. 016998 Marczynski, R.W. Milewski, J.*A microprogrammed processor for a data flow computer.* Polish Academy of Sciences. Inst. of Comp.Sci.*ICS PAS rpt. no. 463.*1982. 016999 Munro, A. Cody, J.A. Towne, D.M.*Instruction mode and instruction intrusiveness in dynamic skill training.* Southern Cal U. Psych.Dept. Behavioral Tech.Labs.* Tech.rpt. ONR-099.*1982. 017000 Nelson, R.* Channel access protocols for multi hop broadcast packet radio networks.* Cal U., L.A. Eng. & Appl.Sci.Sch. Comp.Sci.Dept.*UCLA-ENG-8259; Cal U., L.A. Comp.Sci.Dept.*CSD-820731, Ph.D. Thesis. Nelson, R.*1982. 017001 Siefkes, K.D.* Automatic synthesis of MOS networks with cell complexity constraints.* Illinois U. Comp.Sci.Dept.* UIUCDCS-R-82-1087.*1982. 017002 Tiago de Oliveira, J.* Statistical choice of univariate extreme models. Computer continuation.* Royal Inst. of Tech., Stockholm. Num.Anal. & Computing Sci.Dept.* TRITA-NA-8216.*1982. 017003 Tse, T.H. Pong, L.*A review of system development systems.* Hong Kong U. Comp. Studies and Appl. Centre.*TR-84-82.* 1982. VOL. 5, NO. 1 02/01/83 017004 Archer, J.E. Jr. Conway, R. Schneider, F.B.*User recovery and reversal in interactive systems.* Cornell U. Comp.Sci.Dept.*Tech.Rpt. 81-476.*1981. 017005 Babaoglu, O. Joy, W.*Converting a SWAP based system to do paging in an architecture lacking page-referenced bits.* Cornell U. Comp.Sci.Dept.*Tech.Rpt. 81-474.*1981. 017006 Babaoglu, O. Efficient generation of memory reference strings based on the LRU stack model of program behaviour.* Cornell U. Comp.Sci.Dept.*Tech.Rpt. 81-475.* 1981. 017007 Boehm, H.-J.*A logic for expressions with side-effects.* Cornell U. Comp.Sci.Dept.*Tech.Rpt. 81-478.*1981. 017008 Borodin, A. Hopcroft, J.E.* Routing in networks.* Cornell U. Comp.Sci.Dept.*Tech.Rpt. 80-477.*1981. 017009 Hartmanis, J.*On Goedel speed-up and succinctness of language representation.* Cornell U. Comp.Sci.Dept.* Tech.Rpt. 82-485.*1982. 017010 Hartmanis, J.*On the structure of feasible computations.* Cornell U. Comp.Sci.Dept.*Tech.Rpt. 82-484.*1982. 017011 Hopcroft, J.E. Joseph, D.A. Whitesides, S.H.*On the movement of robot arms in 2-dimensional bounded regions.* Cornell U. Comp.Sci.Dept.*Tech.Rpt. 82-486.*1982. 017012 Luk, F.T.* Oblique procrustes rotations in factor analysis.* Cornell U. Comp.Sci.Dept.*Tech.Rpt. 82-481.*1982. 017013 Schlichting, R.D.* Axiomatic verification to enhance software reliability.* Cornell U. Comp.Sci.Dept.* Tech.Rpt. 82-480.*1982. 017014 Schlichting, R.D. Schneider, F.B.* Fail stop processors: an approach to designing fault tolerant computing systems.* Cornell U. Comp.Sci.Dept.*Tech.Rpt. 81-479.*1981. 017015 Skeen, D.*A quorum based commit protocol.* Cornell U. Comp.Sci.Dept.*Tech.Rpt. 82-483.*1982. 041666 Brady, M. Grimson, W.E.L.*The perception of subjective surfaces.* M.I.T. A.I. Lab.*Memo 666.*1981. 041674 Brooks, R.A.*Solving the find path problem by representing free space as generalized cones.* M.I.T. A.I. Lab.*Memo 674.*1982. 041665 Davis, R.* Expert systems: Where are we? And where do we go from here?* M.I.T. A.I. Lab.*Memo 665.*1982. 041664 Forbus, K.D.* Qualitative process theory.* M.I.T. A.I. Lab.*Memo 664.*1982. 041663 Grimson, W.E.L.*The implicit constraints of the primal sketch.* M.I.T. A.I. Lab.*Memo 663.*1981. 041661 Hollerbach, J.M.*Workshop on the design and control of dexterous hands (held at the MIT Artificial Intelligence Laboratory on November 5-6, 1981).* M.I.T. A.I. Lab.*Memo 661.*1982. 041657 Poggio, T. Koch, C.*Nonlinear interactions in a dendritic tree: localization, timing, and role in information processing.* M.I.T. A.I. Lab.*Memo 657.*1981. 041677 Katz, B. Winston, P.H.* Parsing and generating English using commutative transformations.* M.I.T. A.I. Lab.* Memo 677.*1982. 041652 Lawler, R.*Some powerful ideas.* M.I.T. A.I. Lab.*Memo 652.*1981. 041656 Lieberman, H.*Seeing what your programs are doing.* M.I.T. A.I. Lab.*Memo 656.*1982. 041667 McAllester, D.A.* Reasoning utility package. User's manual. Version one.* M.I.T. A.I. Lab.*Memo 667.*1982. 041675 Poggio, T. Nishihara, H.K. Nielsen, K.R.K.* Zero crossings and spatiotemporal interpolation in vision: aliasing and electrical coupling between sensors.* M.I.T. A.I. Lab.* Memo 675.*1982. 041643 Stallman, R.M.*A local front end for remote editing.* M.I.T. A.I. Lab.*Memo 643.*1982. 041671 Terzopoulos, D.*Multi-level reconstruction of visual surfaces: variational principles and finite element representations.* M.I.T. A.I. Lab.*Memo 671.*1982. 041672 Theriault, D.*A primer for the Act-1 language.* M.I.T. A.I. Lab.*Memo 672.*1982. 041678 Winston, P.H.* Learning by augmenting rules and accumulating censors.* M.I.T. A.I. Lab.*Memo 678.*1982. 017032 Elrad, T. Francez, N.*A weakest precondition semantics for communicating processes.* Technion - Israel Inst. of Tech. Comp.Sci.Dept.*Tech.Rpt. 244.*1982. 017033 Even, S.*A protocol for signing contracts.* Technion - Israel Inst. of Tech. Comp.Sci.Dept.*Tech.Rpt. 231.*1982. 017034 Even, S. Goldreich, O. Lempel, A.*A randomized protocol for signing contracts.* Technion - Israel Inst. of Tech. Comp.Sci.Dept.*Tech.Rpt. 233.*1982. 017035 Dershowitz, N. Zaks, S.*The cycle lemma and some applications.* Technion - Israel Inst. of Tech. Comp.Sci.Dept.*Tech.Rpt. 238.*1982. 017036 Goldreich, O.*A protocol for sending certified mail.* Technion - Israel Inst. of Tech. Comp.Sci.Dept.*Tech.Rpt. 239.*1982. 017037 Hofri, M.*Analysis of interleaved storage via a constant service queueing system with "Markon chain driven" input.* Technion - Israel Inst. of Tech. Comp.Sci.Dept.* Tech.Rpt. 247.*1980. 017038 Hofri, M.*BIN packing: an analysis of the next fit algorithm.* Technion - Israel Inst. of Tech. Comp.Sci.Dept.*Tech.Rpt. 242.*1982. 017039 Itai, A. Makowsky, J.*On the complexity of Herbrand's theorem.* Technion - Israel Inst. of Tech. Comp.Sci.Dept.*Tech.Rpt. 243.*1982. 017040 Mahr, B. Makowsky, J.A.*Characterizing specification languages which admit initial semantics.* Technion - Israel Inst. of Tech. Comp.Sci.Dept.*Tech.Rpt. 232.*1982. 017041 Makowsky, J.A. Tiomkin, M.L.*An array assignment for propositional dynamic logic.* Technion - Israel Inst. of Tech. Comp.Sci.Dept.*Tech.Rpt. 234.*1982. 017042 Moran, S.*On the densest packing of circles in convex figures.* Technion - Israel Inst. of Tech. Comp.Sci.Dept.* Tech.Rpt. 241.*1982. 017043 Tomer, A. Yoeli, M.*On the application of extended Petri nets to the verification of protocols.* Technion - Israel Inst. of Tech. Comp.Sci.Dept.*Tech.Rpt. 248.*1982. 017044 Andrews, G.R. Schneider, F.B.*Concepts and notations for concurrent programming.* Arizona U. Comp.Sci.Dept.*TR 82-12.*1982. 017045 Budd, T.A.*An APL compiler for a vector processor.* Arizona U. Comp.Sci.Dept.*TR 82-06.*1982. 017046 Budd, T.A. Levin, G.M.*A UNIX bibliographic database facility.* Arizona U. Comp.Sci.Dept.*TR 82-01.*1982. 017047 Fraser, C.W.*A generalization of two code ordering optimizations.* Arizona U. Comp.Sci.Dept.*TR 82-11.*1982. 017048 Fraser, C.W. Hanson, D.R.*The machine independent linker link.* Arizona U. Comp.Sci.Dept.*TR 82-10.*1982. 017049 Griswold, R.E. Novak, M.* Programmer defined control operations in Icon.* Arizona U. Comp.Sci.Dept.*TR 82-08.* 1982. 017050 Levin, G.M.*The hoarding banker.* Arizona U. Comp.Sci.Dept.*TR 82-02.*1982. 017051 Myers, E.W.* AVL dags.* Arizona U. Comp.Sci.Dept.*TR 82-09.* 1982. 017052 Myers, E.W.*An O(ElogE+I) expected time algorithm for the planar segment intersection problem.* Arizona U. Comp.Sci.Dept.*TR 82-03.*1982. 017053 Schlichting, R.D. Schneider, F.B.*Using message passing for distributed programming: proof rules and disciplines.* Arizona U. Comp.Sci.Dept.*TR 82-05.*1982. 017054 Treat, J.M. Budd, T.A.*Extensions to grid selector composition and compilation in APL.* Arizona U. Comp.Sci.Dept.*TR 82-07.*1982. 017055 Afshari, P.V. Bruell, S.C. Kain, R.Y.*The computation of the effective service time of a mixed, multiple class, load dependent station in a BCMP network.* Minnesota U. Comp.Sci.Dept.*Tech.Rpt. 82-19.*1982. 017056 Afshari, P.V. Bruell, S.C. Kain, R.Y.* Mean value analysis of mixed, multiple class BCMP networks with load dependent service stations.* Minnesota U. Comp.Sci.Dept.* Tech.Rpt. 82-18.*1982. 017057 Afshari, P.V. Bruell, S.C. Kain, R.Y.*On a multiple class, multiple queue, multiple server system.* Minnesota U. Comp.Sci.Dept.*Tech.Rpt. 82-13.*1982. 017058 Balbo, G. Bruell, S.C.*Computational aspects of aggregation in multiple class queueing networks.* Minnesota U. Comp.Sci.Dept.*Tech.Rpt. 82-01.*1982. 017059 Barker, J.E. Franta, W.R. Kain, R.Y.*A dual estimator approach to determining simulation stability, point estimate accuracy and stopping point.* Minnesota U. Comp.Sci.Dept.*Tech.Rpt. 82-08.*1982. 017060 Boley, D. Golub, G.H.*A modified method for reconstructing periodic Jacobi matrices.* Minnesota U. Comp.Sci.Dept.* Tech.Rpt. 82-21.*1982. 017061 Cohoon, J. Sahni, S.*Exact algorithms for special cases of the board permutation problem.* Minnesota U. Comp.Sci.Dept.*Tech.Rpt. 82-15.*1982. 017062 Cohoon, J. Sahni, S.* Heuristics for the board permutation problem.* Minnesota U. Comp.Sci.Dept.*Tech.Rpt. 82-16.* 1982. 017063 Du, H.C. Sobolewski, J.S.* Disk allocation for Cartesian product files on multiple disk systems.* Minnesota U. Comp.Sci.Dept.*Tech.Rpt. 82-04.*1982. 017064 Du, H.C.*A heuristic disk allocation method for binary Cartesian product files.* Minnesota U. Comp.Sci.Dept.* Tech.Rpt. 82-14.*1982. 017065 Du, H.C. Baer, J.L.*On the performance of interleaved memories with non-uniform access probabilities.* Minnesota U. Comp.Sci.Dept.*Tech.Rpt. 82-06.*1982. 017066 Franta, W.R. Heath, J.R.*Performance of HYPERchannel networks: parameters, measurements, models and analysis.* Minnesota U. Comp.Sci.Dept.*Tech.Rpt. 82-03.*1982. 017067 Franta, W.R. Heath, J.R.*A simple model of the HYPERchannel local network channel selection procedure in multi channel networks.* Minnesota U. Comp.Sci.Dept.*Tech.Rpt. 82-20.*1982. 017068 Gold, Y.I. Franta, W.R.*An efficient collision free protocol for prioritized access control of cable or radio channels with arbitrary spatial node-configurations. Part III: Protocol for network with "hidden" nodes.* Minnesota U. Comp.Sci.Dept.*Tech.Rpt. 82-02.*1982. 017069 Hoyme, K.P. Bruell, S.C. Afshari, P.V. Kain, R.Y.*A tree structured MVA algorithm.* Minnesota U. Comp.Sci.Dept.* Tech.Rpt. 82-17.*1982. 017070 Ibarra, O.H. Rosier, L.E.*Some comments concerning the analysis of simple programs over different sets of primitives.* Minnesota U. Comp.Sci.Dept.*Tech.Rpt. 82-10.*1982. 017071 Kalantari, B. Rosen, J.B.*Construction of global minimum quadratic test problems.* Minnesota U. Comp.Sci.Dept.* Tech.Rpt. 82-07.*1982. 017072 Lai, T.-H. Sahni, S.* Nearly on line scheduling of multiprocessor systems with memories.* Minnesota U. Comp.Sci.Dept.*Tech.Rpt. 82-11.*1982. 017073 Lai, T.-H. Sahni, S.* Preemptive scheduling of uniform processors with memory.* Minnesota U. Comp.Sci.Dept.* Tech.Rpt. 82-05.*1982. 017074 McCall, E.H.* Large scale mixed integer programming experiments with Sperry Univac's series 1100 FMPS.* Minnesota U. Comp.Sci.Dept.*Tech.Rpt. 82-09.*1982. 017075 Zhang, X.S. Rosen, J.B.* Global concave minimization.* Minnesota U. Comp.Sci.Dept.*Tech.Rpt. 82-12.*1982. 017076 Boyer, R.S. Moore, J.S.* MJRTY - a fast majority vote algorithm.* Texas U. Computing Sci.Inst.*TR-032.*1981. 017077 Boyer, R.S. Moore, J.S.*A mechanical proof of the unsolvability of the halting problem.* Texas U. Computing Sci. and Comp.Appl.Inst. Certifiable Minicomputer Project.*ICSCA-CMP-28.*1982. 017078 Boyer, R.S. Moore, J.S.* Proof checking the RSA public key encryption algorithm.* Texas U. Computing Sci. and Comp.Appl.Inst. Certifiable Minicomputer Project.* ICSCA-CMP-33.*1982. 017079 Boyer, R.S. Green, M.W. Moore, J.S.*The use of a formal simulator to verify a simple real time control program.* Texas U. Computing Sci. and Comp.Appl.Inst. Certifiable Minicomputer Project.*ICSCA-CMP-29.*1982. 017080 DiVito, B.L.*Integrated methods for protocol specification and verification.* Texas U. Computing Sci.Inst.*TR-024.* 1982. 017081 DiVito, B.L.* Verification of communications protocols and abstract process models.* Texas U. Computing Sci.Inst.* TR-025,* Ph.D. Thesis. DiVito, B.L.*1982. 017082 DiVito, B.L.* Verification of TCP-like data transport functions.* Texas U. Computing Sci.Inst.*TR-027.*1982. 017083 DiVito, B.L.* Verification of the Stenning protocol.* Texas U. Computing Sci.Inst.*TR-026.*1982. 017084 Good, D.I.*The proof of a distributed system in GYPSY.* Texas U. Computing Sci.Inst.*TR-030.*1982. 017085 Good, D.I.* Reusable problem domain theories.* Texas U. Computing Sci.Inst.*TR-031.*1982. 017086 Cytron, R.G.*Improved compilation methods for multiprocessors.* Illinois U. Comp.Sci.Dept.* UIUCDCS-R-82-1088.*1982. 017087 Gentner, D.R. Grudin, J. Larochelle, S. Norman, D.A. Rumelhart, D.E.*Studies of typing from the LNR Typing Research Group: the role of context, differences in skill level, errors, hand movements, and a computer simulation.* Cal U., San Diego. Human Info.Proces. Center.*CHIP 111.* 1982. 017088 Kampfner, R.R. Conrad, M.*Sequential behavior and stability properties of enzymatic neuron networks.* Wayne State U. Comp.Sci.Dept.*CSC-82-011.*1982. 017089 Katz, R.H. Weiss, S.* CHIP assemblers: concepts and capabilities.* Wisconsin U. Comp.Sci.Dept.*Tech.Rpt. 486.* 1982. 017090 Katz, R.H. Weiss, S.*A standard design frame for VLSI circuit prototyping.* Wisconsin U. Comp.Sci.Dept.* Tech.Rpt. 485.*1982. 017091 Lilienkamp, J.E.* Single stage networks in a multiprocessor environment.* Illinois U. Comp.Sci.Dept.*UIUCDCS-R-1092.* 1982. 017092 Lofgren, M. Magnusson, B.*Evaluation of implementation of access mechanisms in block structured languages.* Lund U. Comp.Sci.Dept.*1982. 017093 Mann, W.C.*The anatomy of a systemic choice.* Southern Cal U. Info.Sci.Inst.*ISI/RR-82-104.*1982. 017094 Mann, W.C. Matthiessen, C.M.I.M.*Two discourse generators, by William C. Mann; A grammar and a lexicon for a text production system, by Christian M.I.M. Matthiessen.* Southern Cal U. Info.Sci.Inst.*ISI/RR-82-102.*1982. 017095 Nissen, J.C.D. Wichmann, B.A.* ADA Europe guidelines for ADA compiler specification and selection, by J.C.D. Nissen, B.A. Wichmann, and others.* U.K. National Physical Lab. Info. Technology and Computing Div.*DITC 10/82.*1982. 017096 Parkin, G.I.*Enhancement of the CCITT teletex recommendations to incorporate encipherment and signatures.* U.K. National Physical Lab. Info. Technology and Computing Div.*DITC 11/82.*1982. 017097 Slotnick, D.L.* Time constrained computation.* Illinois U. Comp.Sci.Dept.*UIUCDCS-R-82-1090.*1982. 017098 Wile, D.S.*Program developments: formal explanations of implementation.* Southern Cal U. Info.Sci.Inst.* ISI/RR-82-099.*1982. VOL. 5, NO. 2 03/01/83 017099 Azrou, F.*Confidentialite et autorisation d'acces dans les systemes de bases de donnees.* Grenoble. Universite Scientifique et Medicale. Laboratoire d'Informatique et de Mathematiques Appliquees de Grenoble.*R.R. no. 318.* 1982 017100 Baille, G. Courtois, B. Laurent, J.*Analyse de defaillances de VLSI par microscopie electronique.* Grenoble. Universite Scientifique et Medicale. Laboratoire d'Informatique et de Mathematiques Appliquees de Grenoble.*R.R. no.304.*1982. 017101 Burlet, M. Fonlupt, J.*Polynomial algorithm to recognize a Meyniel graph.* Grenoble. Universite Scientifique et Medicale. Laboratoire d'Informatique et de Mathematiques Appliquees de Grenoble.*R.R. no. 303.*1982. 017102 Courtois, B.*Debugging VLSI using SEM.* Grenoble. Universite Scientifique et Medicale. Laboratoire d'Informatique et de Mathematiques Appliquees de Grenoble.*R.R. no. 310.*1982. 017103 Courtois, B.*Ordering the procedures of a periodic test.* Grenoble. Universite Scientifique et Medicale. Laboratoire d'Informatique et de Mathematiques Appliquees de Grenoble.*R.R. no. 312.*1982. 017104 Decitre, P. Khider, A. Sergeant, G. Vandome, G. Vatton, I.* Un protocole de diffusion fiable sur le reseau local "DANUBE".* Grenoble. Universite Scientifique et Medicale. Laboratoire d'Informatique et de Mathematiques Appliquees de Grenoble.*R.R. no. 314.*1982. 017105 Maupetit, G.*Conception descendante d'un circuit: etude de cas (extracteur de racine carree).* Grenoble. Universite Scientifique et Medicale. Laboratoire d'Informatique et de Mathematiques Appliquees de Grenoble.*R.R. no.302.* 1982. 017106 Postigo, C. Courtois, B.*Mutual and internal consistency of multiple copies taking into account a detection latency.* Grenoble. Universite Scientifique et Medicale. Laboratoire d'Informatique et de Mathematiques Appliquees de Grenoble.*R.R. no. 311.*1982. 017107 Quint, V.*TITUS: un systeme pour l'edition interactive des formules mathematiques.* Grenoble. Universite Scientifique et Medicale. Laboratoire d'Informatique et de Mathematiques Appliquees de Grenoble.*R.R. no. 306.* 1982. 017108 Ahues, M. Chatelin, F.*The use of defect correction to refine the eigenelements of compact integral operators.* IBM Watson Res. Center.*RC 9620.*1982. 017109 Bohlender, G. Bohm, H. Gruner, K. Kaucher, E. Klatte, R. Kramer, W. Kulisch, U.W. Miranker, W.L. Rump, S.M. Ullrich, Ch. Wolff v. Gudenberg, J.* Matrix PASCAL.* IBM Watson Res. Center.*RC 9577.*1982. 017110 Cavaretta, A.S. Jr. Goodman, T.N.T. Micchelli, C.A. Sharma, A.* Multivariate interpolation and the Radon transform. Part III: Lagrange representation.* IBM Watson Res. Center.*RC 9600.*1982. 017111 Chandra, A.K.* Constant depth reducibility.* IBM Watson Res. Center.*RC 9548.*1982. 017112 Chatelin, F. Miranker, W.L.* Aggregation/disaggregation for eigenvalue problems.* IBM Watson Res. Center.*RC 9574.* 1982. 017113 Coppersmith, D. Gopal, I. Wong, C.K.*Distribution of the minimum channel width in VLSI wiring.* IBM Watson Res. Center.*RC 9622.*1982. 017114 Cullum, J. Willoughby, R.A.*Computing the small singular values of large matrices.* IBM Watson Res. Center.*RC 9550.*1982. 017115 Dahmen, W. Micchelli, C.A.* Multivariate splines - a new constructive approach.* IBM Watson Res. Center.*RC 9567.* 1982. 017116 Dolev, D.*Bounds on information exchange for byzantine agreement.* IBM Watson Res. Center.*RJ 3587.*1982. 017117 Dolev, D. Strong, R.*Requirements for agreement in a distributed system.* IBM Watson Res. Center.*RJ 3418.* 1982. 017118 Dongarra, J.J. Gustavson, F.G. Karp, A.*Implementing linear algebra algorithms for dense matrices on a vector pipeline machine.* IBM Watson Res. Center.*RC 9560.*1982. 017119 Durbeck, R.C.* Optical storage.* IBM Watson Res. Center.*RJ 3607.*1982. 017120 Gavish, B. Hantler, S.L.*An algorithm for optimal route selection in SNA networks.* IBM Watson Res. Center.*RC 9549.*1982. 017121 Gopal, I.S. Coppersmith, D. Wong, C.K.*Optimal wiring of movable terminals.* IBM Watson Res. Center.*RC 9627.* 1982. 017122 Gupta, S. Lucas, B.*High quality text for multi level displays.* IBM Watson Res. Center.*RC 9514.*1982. 017123 Hagouel, J.* Source routing and a distributed algorithm to implement it.* IBM Watson Res. Center.*RC 9553.*1982. 017124 Hailpern, B.* Concurrent processing.* IBM Watson Res. Center.*RC 9582.*1982. 017125 Hauser, R.F.*Localization of information on finite random functions.* IBM Watson Res. Center.*RZ 1170.*1982. 017126 Lucas, P. Risch, T.*Representation of factual information by equations and their evaluation.* IBM Watson Res. Center.*RJ 3362.*1982. 017127 Maruyama, K.*Dynamic route selection algorithms for session based communication networks.* IBM Watson Res. Center.*RC 9552.*1982. 017128 Meyr, H. Popken, L. Keller, H. Muller, H.R.* Synchronization failures in a chain of repeaters.* IBM Watson Res. Center.*RZ 1176.*1982. 017129 Nadas, A.*A decision theoretic formulation of a training problem in speech recognition and a comparison of training by unconditional versus conditional maximum likelihood.* IBM Watson Res. Center.*RC 9617.*1982. 017130 Ng, P.* Distributed compilation and recompilation of database queries.* IBM Watson Res. Center.*RJ 3375.*1982. 017131 Parr, F.N. Strom, R.E.* NIL: a programming language for software architecture.* IBM Watson Res. Center.*RC 9227.* 1982. 017132 Paul, G.* VECTRAN and the proposed vector/ array extensions to ANSI FORTRAN for scientific and engineering computation.* IBM Watson Res. Center.*RC 9223.*1982. 017133 Reiser, M.* Queueing and delay analysis of a buffer pool with resume level.* IBM Watson Res. Center.*RZ 1182.* 1982. 017134 Risch, T.*An interpreter for functional rules.* IBM Watson Res. Center.*RJ 3360.*1982. 017135 Roth, J.P.* Dynamic partitioning.* IBM Watson Res. Center.* RC 9518.*1982. 017136 Rudin, H.*An introduction to automated protocol validation.* IBM Watson Res. Center.*RZ 1174.*1982. 017137 Ruehli, A.E. Ditlow, G.S.* Circuit analysis, logic simulation and design verification for VLSI.* IBM Watson Res. Center.*RC 9540.*1982. 017138 Sheridan, P.B.*A note on independent fireability in petri nets.* IBM Watson Res. Center.*RC 9569.*1982. 017139 Tcha, D.-w. Ibe, O.C.*An algorithm for mapping logical routes into physical routes in communication networks.* IBM Watson Res. Center.*RC 9602.*1982. 017140 Vecchi, M.P. Kirkpatrick, S.*Global wiring by simulated annealing.* IBM Watson Res. Center.*RC 9555.*1982. 017141 Vishkin, U.*A parallel design space distributed implementation space ( PDDI) general purpose computer.* IBM Watson Res. Center.*RC 9541.*1982. 017142 Agrawal, S.C. Buzen, J.P.*The aggregate server method for analyzing serialization delays in computer systems.* Purdue U. Comp.Sci.Dept.*CSD TR 384.*n.d. 017143 Arthur, J.D. Comer, D.* RESTRUCT: a specification driven file transformation tool.* Purdue U. Comp.Sci.Dept.*CSD TR 386.*n.d. 017144 Berman, F. Leighton, F.T. Snyder, L.*Optimal tile salvage.* Purdue U. Comp.Sci.Dept.*n.d. 017145 Brumfield, J.A. Denning, P.J.* Error analysis of homogeneous mean queue and response time estimators.* Purdue U. Comp.Sci.Dept.*CSD TR 393.*1982. 017146 Buzen, J.P. Bondi, A.B.*The response times of priority classes under preemptive resume in M/M/m queues.* Purdue U. Comp.Sci.Dept.*CSD TR 387.*n.d. 017147 Dittert, E. O'Donnell, M.J.*Some results on perfect, static-key hashing.* Purdue U. Comp.Sci.Dept.*CSD TR 390.* n.d. 017148 O'Donnell, M.J. Smith, C.H.*A combinatorial problem concerning processor interconnection networks.* Purdue U. Comp.Sci.Dept.*CSD TR 352.*n.d. 017149 Paris, J.-F. Ferrari, D.*An analytical study of strategy-oriented restructuring algorithms.* Purdue U. Comp.Sci.Dept.*CSD TR 395 (also Report 82.1, PROGRES Group, Electronics Research Laboratory, University of California at Berkeley).*1982. 017150 Paris, J.-F.*Improving virtual memory performance by off-line page clustering.* Purdue U. Comp.Sci.Dept.*CSD TR 399.*n.d. 017151 Reed, D.A. Schwetman, H.D.*Cost-performance bounds for multi microcomputer networks.* Purdue U. Comp.Sci.Dept.* CSD TR 382.*1981. 017152 Rice, J.R.* Array facilities in programming languages.* Purdue U. Comp.Sci.Dept.*CSD TR 380.*1981. 017154 Rice, J.R.*Machine and compiler effects on the performance of elliptic PDE software.* Purdue U. Comp.Sci.Dept.*CSD TR 359.*1981. 017155 Snyder, L.* Theft and conspiracy in the take grant protection model.* Purdue U. Comp.Sci.Dept.*CSD TR 361.* n.d. 017156 Tichy, W.F.*Design, implementation, and evaluation of a revision control system.* Purdue U. Comp.Sci.Dept.*CSD TR 397.*1982. 017157 Denning, P.J. Kowalk, W.* Error analysis of the mean busy period of queue.* Purdue U. Comp.Sci.Dept.*CSD TR 398.* 1982. 017158 Tichy, W.F.*A model for representing families of programmed systems.* Purdue U. Comp.Sci.Dept.*CSD TR 356.*n.d. 017159 Cottle, R.W. Duvall, S.G.*A Lagrangean relaxation algorithm for the constrained matrix problem.* Stanford U. O.R. Dept. Systems Optimization Lab.*SOL 82-10.*1982. 017160 Dantzig, G.B.* Mathematical programming and decision making in a technological society.* Stanford U. O.R. Dept. Systems Optimization Lab.*SOL 82-11.*1982. 017161 Gill, P.E. Murray, W. Saunders, M.A. Wright, M.H.* Procedures for optimization problems with a mixture of bounds and general linear constraints.* Stanford U. O.R. Dept. Systems Optimization Lab.*SOL 82-06.*1982. 017162 Gill, P.E. Murray, W. Saunders, M.A. Wright, M.H.*User's guide for SOL/QPSOL: a Fortran package for quadratic programming.* Stanford U. O.R. Dept. Systems Optimization Lab.*SOL 82-07.*1982. 017163 Hillier, F.S.* Heuristics: a gambler's roll.* Stanford U. O.R. Dept. Systems Optimization Lab.*SOL 82-12.*1982. 017164 Hoffman, A.J. McCormick S.T.*A fast algorithm that makes matrices optimally sparset.* Stanford U. O.R. Dept. Systems Optimization Lab.*SOL 82-13.*1982. 017165 Schittkowski, K.*On the convergence of a sequential quadratic programming method with an augmented Lagrangian line search functions.* Stanford U. O.R. Dept. Systems Optimization Lab.*SOL 82-14.*1982. 017166 Thapa, M.N.* Optimization of unconstrained functions with sparse Hessian matrices-- Newton type methods.* Stanford U. O.R. Dept. Systems Optimization Lab.*SOL 82-08.*1982. 017167 Abdallah, M.A.N.* Data types as algorithms.* Waterloo U. Comp.Sci.Dept.*Res.Rpt. CS-82-10.*1982. 017168 Brzozowski, J.A. Fich, F.E.*On generalized locally testable languages.* Waterloo U. Comp.Sci.Dept.*Res.Rpt. CS-82-05.*1982. 017169 Culik, K. Salomaa, A.* Ambiguity and decision problems concerning number systems.* Waterloo U. Comp.Sci.Dept.* 1982. 017170 Culik, K. II Pachl, J.*Folding and unrolling systolic arrays.* Waterloo U. Comp.Sci.Dept.*Res.Rpt. CS-82-11.* 1982. 017171 Culik, K. II Gruska, J. Salomaa, A.* Systolic automata for VLSI on balanced trees.* Waterloo U. Comp.Sci.Dept.* Res.Rpt. CS-82-01.*1982. 017172 Culik, K. II Gruska, J. Salomaa, A.* Systolic trellis automata: stability, decidability and complexity.* Waterloo U. Comp.Sci.Dept.*Res.Rpt. CS-82-04.*1982. 017173 Gentleman, W.M.*Implementing nested dissection.* Waterloo U. Comp.Sci.Dept.*Res.Rpt. CS-82-03.*1982. 017174 Gonnet, G.H. Munro, J.I.*The analysis of linear probing sort by the use of a new mathematical transform.* Waterloo U. Comp.Sci.Dept.*Res.Rpt. CS-82-06.*1982. 017175 Gonnet, G.H.* Balancing binary trees by internal path reduction.* Waterloo U. Comp.Sci.Dept.*Res.Rpt. CS-82-07.*1982. 017176 Gonnet, G.H.* Unstructured data bases.* Waterloo U. Comp.Sci.Dept.*Res.Rpt. CS-82-09.*1982. 017177 Mavaddat, F.* WATSON/I: WATerloo's SONically guided robot.* Waterloo U. Comp.Sci.Dept.*Res.Rpt. CS-82-16.*1982. 017178 Nait-Abdallah, A.*Faisceaux et Semantique des Programmes.* Waterloo U. Comp.Sci.Dept.*Res.Rpt. CS-82-08, Ph.D. Thesis. Nait-Abdallah, A.*1982. 017179 Pachl, J.K.* Reachability problems for communicating finite state machines.* Waterloo U. Comp.Sci.Dept.*Res.Rpt. CS-82-12.*1982. 017180 Taylor, D.J. Black, J.P.*A tool for investigating empirical data structure robustness.* Waterloo U. Comp.Sci.Dept.* Res.Rpt. CS-82-02.*1982. 017181 Ziviani, N.*The fringe analysis of search trees.* Waterloo U. Comp.Sci.Dept.*Res.Rpt. CS-82-15, Ph.D. Thesis. Ziviani, N.*1982. 017182 Agrawal, A. Satyanarayana, A.*On O(/E/) time algorithm for computing the reliability of a class of directed networks.* Cal. U., Berkeley. O.R. Center.*ORC 82-07.* 1982. 024930 Baker, H.H.* Depth from edge and intensity based stereo.* Stanford U. Comp.Sci.Dept.*STAN-CS-82-930; Stanford U. Comp.Sci.Dept. A.I. Lab.*AIM-347, Ph.D. Thesis. Baker, H.H. (Report based on a Ph.D. thesis submitted to the University of Illinois at Urbana-Champaign in September of 1981).*1982. 90p. 017184 Barlow, R.E.*System reliability analysis: foundations.* Cal. U., Berkeley. O.R. Center.*ORC 82-08.*1982. 017185 Barton, R.R.*Simulation of file migration.* Illinois U. Comp.Sci.Dept.*UIUCDCS-R-1096.*1982. 017186 Bokhari, S.H.*Finding maximum on an array processor with a global bus.* Institute for Comp.Appl. in Sci. and Eng. ( ICASE), NASA Langeley Res. Center, Hampton, VA.*Rpt. 82-27.*1982. 024949 Broder, A.Z.*The r-Stirling numbers.* Stanford U. Comp.Sci.Dept.*STAN-CS-82-949.*1982. 22p. 017187 Dahlquist, G.*On matrix majorants and minorants, with applications to differential equations.* Royal Inst. of Tech., Stockholm. Num.Anal. & Computing Sci.Dept.* TRITA-NA-8212.*1982. 017188 Dreschler, L.*Ermittlung markanter Punkte auf den Bildern bewegter Opjekte und Berechnung einer 3D-Beschreibung auf dieser Grundlage.* Hamburg U. Fachbereich Informatik.* Bericht Nr. 83.*1981. 017189 Grosky, W.I.*Towards a data model for integrated pictorial databases.* Wayne State U. Comp.Sci.Dept.*CSC-82-012.* 1982. 017190 Hammarling, S.S.* Newton's method for solving the algebraic Riccati equation.* U.K. National Physical Lab. Info. Technology & Comp.Div.*DITC 12/82.*1982. 017191 Jantzen, M.* Semi Thue systems and generalized Church Rosser properties.* Hamburg U. Fachbereich Informatik.* Bericht Nr. 92.*1982. 017192 Jobmann, M.*ILMAOS - Eine Sprache zur Formulierung von Rechensystemmodellen.* Hamburg U. Fachbereich Informatik.* Bericht Nr. 91.*1982. 017193 Leachman, R.C. Boysen, J.* Aggregate network model of ship overhaul.* Cal. U., Berkeley. O.R. Center.*ORC 82-02.* 1982. 017194 Radig, B.*Symbolische Beschreibung von Bildfolgen I: Relationengebilde und Morphismen.* Hamburg U. Fachbereich Informatik.*Bericht Nr. 90.*1982. 017195 Schachter, R.D.*An incentive approach to eliciting probabilities.* Cal. U., Berkeley. O.R. Center.*ORC 82-09.*1982. 017196 Tsai, W.-C.*Distributed deadlock detection in distributed database systems.* Illinois U. Comp.Sci.Dept.* UIUCDCS-R-82-1089, Ph.D. Thesis. Tsai, W.-C.*1982. VOL. 5, NO. 3 04/01/83 017197 Firdman, H.E.*Toward a theory of cognizing systems: the search for an integrated theory of AI.* Hewlett Packard Co. Comp.Sci.Lab.*CSL-82-007; Hewlett Packard Co. Comp.Res. Center.*CRC-TR-82-002.*1982. 017198 Gawron, J.M. King, J.J. Lamping, J. Loebner, J.J. Paulson, E.A. Pullum, G.K. Sag, I.A. Wasow, T.A.*Processing English with a generalized phrase structure grammar.* Hewlett Packard Co. Comp.Sci.Lab.*CSL-82-005.*1982. 017199 King, J.J.* Artificial intelligence techniques for device troubleshooting.* Hewlett Packard Co. Comp.Sci.Lab.* CSL-82-009; Hewlett Packard Co. Comp.Res. Center.* CRC-TR-82-004.*1982. 017200 King, J.J.*An investigation of expert systems technology for automated troubleshooting of scientific instrumentation.* Hewlett Packard Co. Comp.Sci.Lab.* CSL-82-012; Hewlett Packard Co. Comp.Res. Center.* CRC-TR-82-002.*1982. 017201 Lamping, J. King, J.J.* IZZI--a translator from Interlisp to Zetalisp.* Hewlett Packard Co. Comp.Sci.Lab.* CSL-82-010; Hewlett Packard Co. Comp.Res. Center.* CRC-TR-82-005.*1982. 017202 Lamping, J. King, J.J.* LM/GPSG--a prototype workstation for linguists.* Hewlett Packard Co. Comp.Sci.Lab.* CSL-82-011; Hewlett Packard Co. Comp.Res. Center.* CRC-Tr-82-006.*1982. 017203 Bonuccelli, M.A. Maruyama, K.*An algorithm to enforce treeness in a set of optimal paths.* IBM Watson Res. Center.*RC 8998.*1981. 017204 Chow, W.-M.* Approximations for large scale closed queueing networks.* IBM Watson Res. Center.*RC 8995.*1981. 017205 Dolev, D. Reischuk, R. Strong, H.R.*'Eventual' is earlier than 'immediate'.* IBM Watson Res. Center.*RJ 3632.*1982. 017206 Haas, L.M. Selinger, P.G. Bertino, E. Daniels, D. Lindsay, B. Lohman, G. Masunaga, Y. Mogan, C. Ng, P. Wilms, P. Yost, R.* R*: a research project on distributed relational DBMS.* IBM Watson Res. Center.*RJ 3653.*1982. 017207 Lee, C.W.* Triangulating the d-cube.* IBM Watson Res. Center.*RC 3963.*1981. 017208 Lee, C.W.*Two combinatorial properties of a class of simplicial polytopes.* IBM Watson Res. Center.*RC 8957.* 1981. 017209 Rivlin, T.J.*The optimal recovery of functions.* IBM Watson Res. Center.*RC 8977.*1981. 017210 Baccelli, F. Coffman, E.G. Jr.*Analysis of replication in distributed data bases.* INRIA.*Rapport de Recherche 150.*1982. 017211 Baccelli, F. Fayolle, G.*Definition and analysis of a two dimensional diffusion process with boundary and jumps.* INRIA.*Rapport de Recherche 160.*1982. 017212 Banatre, J.-P. Frison, P. Quinton, P.*Un algorithme systolique pour la reconnaissance de mots connectes.* INRIA.*Rapport de Recherche 148.*1982. 017213 Bancilhon, F. Richard, P.* TQL, a textual query language.* INRIA.*Rapport de Recherche 145.*1982. 017214 Bernadou, M. Boisserie, J.-M.* Free vibration of a thin shell application to an arch dam.* INRIA.*Rapport de Recherche 161.*1982. 017215 Camion, P.*Improving an algorithm for factorizing polynomials over a finite field and constructing large irreductible polynomials.* INRIA.*Rapport de Recherche 152.*1982. 017216 Despeyroux-Savonitto, J.*Une semantique formelle du P-code basee sur les types abstraits algebriques.* INRIA.* Rapport de Recherche 158.*1982. 017217 Eyries, F.*Synthese d'images de scenes composees de spheres.* INRIA.*Rapport de Recherche 163.*1982. 017218 Flajolet, P.*On approximate counting.* INRIA.*Rapport de Recherche 153.*1982. 017219 Flajolet, P. Saheb, N.*The complexity of generating an exponentially distributed variate.* INRIA.*Rapport de Recherche 159.*1982. 017220 Glowinske, R. Periaux, J. Dinh, Q.V.* Domain decomposition methods for nonlinear problems in fluid dynamics.* INRIA.*Rapport de Recherche 147.*1982. 017221 Gonzalez, R. Rofman, E.*On deterministic control problem: an approximation procedure for the optimal cost.* INRIA.* Rapport de Recherche 151.*1982. 017222 Katai, O.* Optimal control of discharge from a reservoir based on Kushner's finite Markov chain approximation of river flow diffusion process.* INRIA.*Rapport de Recherche 156.*1982. 017223 Kott, L.*Unfold/fold program transformation.* INRIA.* Rapport de Recherche 155.*1982. 017224 Rannou, R.*Tris pour machines synchrones.* INRIA.*Rapport de Recherche 154.*1982. 017225 Apte, C.* Expert knowledge management for multi-level modelling.* Rutgers U. Comp.Sci.Res.Lab.*LCSR-TR-41.* 1982. 017226 Dowd, M.* Forcing and the P hierarchy.* Rutgers U. Comp.Sci.Res.Lab.*LCSR-TR-35.*1982. 017227 Dowd, M.* Gaussian elimination runs in polynomial time.* Rutgers U. Comp.Sci.Res.Lab.*LCSR-TM-03.*1982. 017228 Dowd, M.* Isomorphism of complete sets.* Rutgers U. Comp.Sci.Res.Lab.*LCSR-TR-34.*1982. 017229 Dowd, M.*Some new sequencings of groups.* Rutgers U. Comp.Sci.Res.Lab.*LCSR-TR-33.*1982. 017230 Drastal, G.A. Kulikowski, C.A.* Knowledge based acquisition of rules for medical diagnosis.* Rutgers U. Comp.Sci.Res.Lab.*CBM-TM-97.*1982. 017231 Kastner, J.K. Weiss, S.M. Kulikowske, C.A.* Treatment selection and explanation in expert medical consultation: application to a model of ocular herpes simplex.* Rutgers U. Comp.Sci.Res.Lab.*CBM-TR-132.*1982. 017232 Lafue, G.M.E.* Semantic integrity management of databases: a survey.* Rutgers U. Comp.Sci.Res.Lab.*LCSR-TR-32.*1982. 017233 Lantz, B.*The AIMDS interactive command parser.* Rutgers U. Comp.Sci.Res.Lab.*CBM-TM-94.*1982. 017234 Lantz, B.*The AIMDS on-line documentation facility.* Rutgers U. Comp.Sci.Res.Lab.*CBM-TM-95.*1982. 017235 Mitchell, T.M. Utgoff, P.E. Banerji, R.* Learning by experimentation: acquiring and modifying problem solving heuristics.* Rutgers U. Comp.Sci.Res.Lab.*LCSR-TR-31.* 1982. 017236 Nudel, B.* Consistent labeling problems and their algorithms: part II.* Rutgers U. Comp.Sci.Dept.* DCS-TR-113.*1982. 017237 Politakis, P.G.*Using empirical analysis to refine expert system knowledge bases.* Rutgers U. Comp.Sci.Res.Lab.* CBM-TR-130, Ph.D. Thesis. Politakis, P.G.*1982. 017238 Ryder, B.G.*Incremental data flow analysis.* Rutgers U. Comp.Sci.Dept.*DCS-TR-120.*1982. 017239 Smith, D.E.* FOCUSER: a strategic interaction paradigm for language acquisition.* Rutgers U. Comp.Sci.Res.Lab.* LCSR-TR-36, Ph.D. Thesis. Smith, D.E.*1982. 017240 Srinivasan, C.V.*Notes on object centered associative memory organization.* Rutgers U. Comp.Sci.Res.Lab.* LCSR-TR-19.*1981. 017241 Utgoff, P.E.*Acquisition of appropriate bias for inductive concept learning.* Rutgers U. Comp.Sci.Res.Lab.* LCSR-TM-02.*1982. 017242 Weiss, S. Kulikowske, C. Apte, C. Uschold, M.*Building expert systems for controlling complex programs.* Rutgers U. Comp.Sci.Res.Lab.*LCSR-TR-40.*1982. 017243 Yuchuan, Y. Kulikowske, C.A.*Multiple strategies of reasoning for expert systems.* Rutgers U. Comp.Sci.Res.Lab.*CBM-TR-131.*1982. 017244 Stanford U. Comp.Sci.Dept.* Computer Science at Stanford: 1981-1982. Prepared for the President's Advisory Committee on Computer Science, by Paul Armer and Jonathan Abbis.*Nov. 1, 1982. 024956 Barr, A.* Artificial intelligence: cognition as computation.* Stanford U. Comp.Sci.Dept.*STAN-CS-82-956; Stanford U. Comp.Sci.Dept. Heuristic Programming Project.* HPP-82-29.*1982. 28p. 048301 Chan, T.F.* Stability analysis of finite difference schemes for the advection diffusion equation.* Stanford U. Comp.Sci.Dept. Numerical Analysis Project.*Manuscript NA-83-01.*1983. 18p. 024955 Goldman, R.*Design of an interactive manipulator programming environment.* Stanford U. Comp.Sci.Dept.* STAN-CS-82-955; Stanford U. Comp.Sci.Dept. A.I. Lab.* AIM-350, Ph.D. Thesis. Goldman, R.*1982. 145p. 024954 Manna, Z. Pneuli, A.*How to cook a temporal proof system for your pet language.* Stanford U. Comp.Sci.Dept.* STAN-CS-82-954.*1982. 14p. 024957 Navathe, S. Ceri, S. Wiederhold, G. Dou, J.* Vertical partitioning for physical and distribution design of databases.* Stanford U. Comp.Sci.Dept.*STAN-CS-83-957 (STAN-CS-82-957).*1983. 32p. 024951 Pratt, V.*Five paradigm shifts in programming language design and their realization in Viron, a dataflow programming environment.* Stanford U. Comp.Sci.Dept.* STAN-CS-82-951.*1982. 9p. 024953 Buchanan, B.G.*Partial bibliography of work on expert systems.* Stanford U. Comp.Sci.Dept.*STAN-CS-82-953; Stanford U. Comp.Sci.Dept. Heuristic Programming Project.* HPP-82-30.*1982. 13p. 017245 Amit, Y.*Review of conceptual dependency theory.* Edinburgh U. A.I. Dept.*Occasional Paper 008.*1977. 017246 Bowen, D.L. (ed.)* DECsystem-10 Prolog user's manual.* Edinburgh U. A.I. Dept.*Occasional Paper 027.*1982. 017247 Bundy, A. Howe, J. Boulay, B. du Ross, P.* AI1 exam question booklet.* Edinburgh U. A.I. Dept.*Occasional Paper 013.*1980. 017248 Bundy, A. Welham, B.*Utility procedures in Prolog.* Edinburgh U. A.I. Dept.*Occasional Paper 009.*1977. 017249 Byrd, L. (ed.)*User's guide to EMAS Prolog.* Edinburgh U. A.I. Dept.*Occasional Paper 026.*1981. 017250 Luger, G.F.*Some artificial intelligence techniques for describing problem solving behaviour.* Edinburgh U. A.I. Dept.*Occasional Paper 007.*1977. 017251 Ross, P.M.* TERAK LOGO user's manual (for version 1 - 0).* Edinburgh U. A.I. Dept.*Occasional Paper 021.*1980. 017252 Ambler, A.P. Popplestone, R.J. Kempf, K.G.*An experiment in the offline programming of robots.* Edinburgh U. A.I. Dept.*Res. Paper 170.*1982. 017253 Ambler, A.P.* RAPT: an object level robot programming language.* Edinburgh U. A.I. Dept.*Res. Paper 172.*1982. 017254 Beattie, R.J.* Edge detection for semantically based early visual processing.* Edinburgh U. A.I. Dept.*Res. Paper 174.*1982. 017255 Boulay, J.B.H. du Howe, J.A.M. Johnson, K.*Making programs vs running programs: microcomputers in the mathematical education of teachers.* Edinburgh U. A.I. Dept.*Res. Paper 167.*1982. 017256 Bundy, A. Silver, B.*A critical survey of rule learning programs.* Edinburgh U. A.I. Dept.*Res. Paper 169.*1982. 017257 Featherstone, R.* Position and velocity transformations between robot end effector coordinates and joint angles.* Edinburgh U. A.I. Dept.*Res. Paper 176.*1982. 017258 Fisher, R.B.*A structured pattern matching approach to intermediate level vision.* Edinburgh U. A.I. Dept.*Res. Paper 177.*1982. 017259 Howe, J.*The microelectronics revolution: a challenge to education.* Edinburgh U. A.I. Dept.*Res. Paper 173.*1982. 017260 Howe, J. Boulay, B. du Johnston, K.*Re-learning mathematics through LOGO.* Edinburgh U. A.I. Dept.*Res. Paper 178.* 1982. 017261 Silver, B.*The application of homogenization to simultaneous equations.* Edinburgh U. A.I. Dept.*Res. Paper 166.*1982. 017262 Sterling, L. Bundy, A.* Meta level inference and program verification.* Edinburgh U. A.I. Dept.*Res. Paper 168.* 1982. 017263 Sterling, L. Bundy, A. Byrd, L. O'Keefe, R. Silver, B.* Solving symbolic equations with PRESS.* Edinburgh U. A.I. Dept.*Res. Paper 171.*1982. 017264 Thompson, H.*Handling metarules in a parser for GPSG. Edinburgh U. A.I. Dept.*Res. Paper 175.*1982. 017265 Athukorala, A.*Some hardware for computer vision.* Edinburgh U. A.I. Dept.*Working Paper 102.*1981. 017266 Cameron, S.* Body models for every body.* Edinburgh U. A.I. Dept.*Working Paper 107.*1982. 017267 Koutsou, A.*A survey of model bases robot programming languages.* Edinburgh U. A.I. Dept.*Working Paper 108.* 1981. 017268 Popplestone, R.J.*Discussion document on body modelling for robot languages.* Edinburgh U. A.I. Dept.*Working Paper 110.*1982. 017269 Yin, B.*A proposal for studying how to use vision within a robot language which reasons about spatial relationships.* Edinburgh U. A.I. Dept.*Working Paper 109.*1982. 017270 Braga, L.P.V.* Mapping techniques using universal kriging.* Montreal U. Dept. d'Info. et de Recherche Operationnelle.*Publ. 453.*1982. 017271 Brassard, G. Monet, S.*L'indecidabilite sans larmes (ni diagonalisation). Undecidability without tears (nor diagonalization).* Montreal U. Dept. d'Info. et de Recherche Operationnelle.*Publ. 445.*1982. 017272 Brassard, G.*Indecidable...bien sur!* Montreal U. Dept. d'Info. et de Recherche Operationnelle.*Publ. 444.*1982. 017273 Gecsei, J.*Towards distributed processing in videotex.* Montreal U. Dept. d'Info. et de Recherche Operationnelle.* Publ. 447.*1982. 017274 Horspool, R.N. Bochmann, G.v. Saunders, G.E.* Memory structures for videotex systems.* Montreal U. Dept. d'Info. et de Recherche Operationnelle.*Publ. 454.*1982. 017275 Lachapelle, P. Magnenat-Thalmann, N. Thalmann, D.* GRAFEDIT 3.0 un editeur interactif a deux dimensions.* Montreal U. Dept. d'Info. et de Recherche Operationnelle.*Publ. 370A.* 1982. 017276 Maculan, N.*Flot maximum: l'algorithme de Dinic-Karzanov.* Montreal U. Dept. d'Info. et de Recherche Operationnelle.* Publ. 455.*1982. 017277 Thalmann, N. Bergeron, P. Thalmann, D.* Dream flight: a fictional film produced by 3D computer animation.* Montreal U. Dept. d'Info. et de Recherche Operationnelle.* Publ. 456.*1982. 017278 Magnenet-Thalman, N. Choquette, A. Thalmann, D.*A macro-program for a micro-machine.* Montreal U. Dept. d'Info. et de Recherche Operationnelle.*Publ. 458.*1982. 017279 Magnenat-Thalmann, N. Thalmann, D.*Le langage graphique MIRA-2D.* Montreal U. Dept. d'Info. et de Recherche Operationnelle.*Publ. 335.*1981. 017280 Magnenat-Thalmann, N. Thalmann, D.*Le langage graphique MIRA-3D.* Montreal U. Dept. d'Info. et de Recherche Operationnelle.*Publ. 380.*1982. 017281 Demopoulos, W. Friedman, M.*The concept of structure in early twentieth century philosophy of science.* Western Ontario U. Cognitive Science Centre.*COGMEM 09.*1982. 017282 Demopoulos, W.*The rejection of truth conditional semantics by Putnam and Dummett.* Western Ontario U. Cognitive Science Centre.*COGMEM 06.*1982. 017283 Denny, J.P.* Whorf's Algonquian: old evidence and new ideas concerning linguistic relativity.* Western Ontario U. Cognitive Science Centre.*COGMEM 11.*1982. 017284 Mather, J.A.* Saccadic eye movements to seen and unseen targets: preprogramming and sensory input in motor control.* Western Ontario U. Cognitive Science Centre.* COGMEM 10.*1982. 017285 Stabler, E.P. Jr.* Database and theorem prover designs for question answering systems.* Western Ontario U. Cognitive Science Centre.*COGMEM 12.*1982. 017286 Stabler, E.P. Jr.*In defense of naturalized epistemology: a response to Rorty and Putnam.* Western Ontario U. Cognitive Science Centre.*COGMEM 08.*1982. 017287 Stabler, E.P. Jr.* Programs, rule governed behavior and grammars in theories of language acquisition and use.* Western Ontario U. Cognitive Science Centre.*COGMEM 07.* 1982. 017288 Anderson, J.R. Farrell, R. Sauers, R.* Learning to plan in LISP.* Carnegie Mellon U. Psych.Dept.*1982. 017289 Boyer, R.S. Moore, J.S.* Proof checking the RSA public key encryption algorithm.* Texas U. Computing Sci. and Comp.Appl.Inst. Certifiable Minicomputer Project.* ICSCA-CMP-033.*1982. 017290 Bratley, P., Fox, B.L. Schrage, L.E.*A guide to simulation.*1982, draft of a book. 017291 Culik, K.*Computer programming as constructive mathematical proving.* Wayne State U. Comp.Sci.Dept.*CSC-82-015.*1982. 017292 Friesen, A.W. Tremblay, J.P. Sorenson, P.G.*A metasystem to generate computer aided systems analysis and design packages for applications on small computer systems.* Saskatchewan U. Computational Sci.Dept.*Rpt. 82-10.*1982. 017293 Gentner, D.R.*The development of typewriting skill.* Cal U., San Diego. Human Info.Proces. Center.*CHIP 114.*1982. 017294 Good, D.I.* Reusable problem domain theories.* Texas U. Computing Sci.Inst.*TR-031.*1982. 017295 Hagino, T. Honda, M. Koga, A. Makajima, R. Shibayama, E. Yuasa, T.* IOTA on DECsystem 20-- KWIC example.* Kyoto U. Res.Inst.Math.Sci.*RIMS-419.*1982. 017296 LeBlanc, T.J.*The design and performance of high level language primitives for distributed programming.* Wisconsin U. Comp.Sci.Dept.*Tech.Rpt. 492, Ph.D. Thesis. LeBlanc, T.J.*1982. 017297 Lee, T.-Y.P.*Experimental design of a generative model based on working set size characterizations.* Cal U., Berkeley. Electronic Res.Lab.*Memo. no. UCB/ERL-M82/56; Cal U., Berkeley. E.E. & Comp.Sci.Dept. Comp.Sci.Div.* PROGRES rpt. 82.07.*1982. 017298 Lilienkamp, J.E. Lawrie, D.H. Yew, P.-C.*A fault tolerant interconnection network using error correcting codes.* Illinois U. Comp.Sci.Dept.*UIUCDCS-R-82-1094.*1982. 017299 Manber, U.* Concurrent maintenance of a dynamic search structure.* Wisconsin U. Comp.Sci.Dept.*Tech.Rpt. 488.* 1982. 017300 Mangasarian, O.L.*A condition number for differentiable convex inequalities.* Wisconsin U. Comp.Sci.Dept.* Tech.Rpt. 491.*1982. 017301 Marcal, M.* Magnetic and drift surfaces in toroidal plasma equilibria.* New York U. Inst. of Math. Sci.* DOE/ER/3077-178.*1982. 017302 Ni, L.M.*A dynamic job migrating strategy for homogeneous local computer networks.* Michigan State U. Comp.Sci.Dept.* 82-025.*1982. 017303 Ni, L.M.* Load balancing design considerations for distributed systems.* Michigan State U. Comp.Sci.Dept.* 82-024.*1982. 017304 Olken, F.*Efficient methods for calculating the success function of fixed space replacement policies.* Cal U. Lawrence Berkeley Lab.*LBL-12370; Cal U., Berkeley. E.E. & Comp.Sci.Dept. Comp.Sci.Div.*PROGRES rpt. 82.11.*1982. 017305 Porcar, J.M.* File migration in distributed computer systems.* Cal U. Lawrence Berkeley Lab.*LBL-14763; Cal U., Berkeley. E.E. & Comp.Sci.Dept. Comp.Sci.Div.*PROGRES rpt. 82.06, Ph.D. Thesis. Porcar, J.M.*1982. 017306 Wald, J.A. Colbourn, C.J.*Algorithm prototype for partial 2 trees.* Saskatchewan U. Computational Sci.Dept.*Rpt. 83-01.*1982. 017307 Wells, D.R.* Multirate linear multistep methods for the solution for systems of ordinary differential equations.* Illinois U. Comp.Sci.Dept.*UIUCDCS-R-82-1093.*1982. 017308 Yamagami, S.* Modular cohomology class of foliation and Yakesaki's duality.* Kyoto U. Res.Inst.Math.Sci.* RIMS-417.*1982. 017309 Yuen, C.K.*The programmer as navigator: a discourse on program structure.* Hong Kong U. Comp. Studies and Appl. Centre.*TR-21-82.*1982. 017310 Yuen, C.K.*Some practical fast Walsh transform algorithms.* Hong Kong U. Comp. Studies and Appl. Centre.*TR-11-82.* 1982. 017311 Yuen, C.K.*On the Walsh transform of a shifted vector.* Hong Kong U. Comp. Studies and Appl Centre.*TR-10-82.* 1982. VOL. 5, NO. 4 04/22/83 017312 Apt, K.R. Plotkin, G.D.*A cook's tour of countable nondeterminism.* Aarhus U. Comp.Sci.Dept.*DAIMI PB-133.* 1981. 017313 Harel, D. Kozen, D.C.*A programming language for the inductive sets, and applications.* Aarhus U. Comp.Sci.Dept.*DAIMI PB-143.*1982. 017314 Jones, N.D. Christiansen, H.* Control flow treatment in a simple semantics directed compiler generator.* Aarhus U. Comp.Sci.Dept.*DAIMI PB-137.*1981. 017315 Kornerup, P. Matula, D.W.*An integrated rational arithmetic unit.* Aarhus U. Comp.Sci.Dept.*DAIMI PB-134.*1981. 017316 Kozen, D.C.*Results on the propositional mu-calculus.* Aarhus U. Comp.Sci.Dept.*DAIMI PB-146.*1982. 017317 Moller-Nielsen, P. Staunstrup, J.*Early experience from a multiprocessor project.* Aarhus U. Comp.Sci.Dept.*DAIMI PB-142.*1982. 017318 Mosses, P.* Abstract semantic algebras!* Aarhus U. Comp.Sci.Dept.*DAIMI PB-145.*1982. 017319 Mosses, P.*A semantic algebra for binding constructs.* Aarhus U. Comp.Sci.Dept.*DAIMI PB-132.*1981. 017320 Naur, T.* Integer factorization.* Aarhus U. Comp.Sci.Dept.* DAIMI PB-144.*1982. 017321 Nielson, F.*A denotational framework for data flow analysis.* Aarhus U. Comp.Sci.Dept.*DAIMI PB-135.*1981. 017322 Nielson, F.* Program transformations in a denotational setting.* Aarhus U. Comp.Sci.Dept.*DAIMI PB-140.*1981. 017323 Nielson, H.R.* Computation sequences: a way to characterize subclasses of attribute grammars.* Aarhus U. Comp.Sci.Dept.*DAIMI PB-138.*1981. 017324 Nielson, H.R.*Using computation sequences to define evaluators for attribute grammars.* Aarhus U. Comp.Sci.Dept.*DAIMI PB-139.*1981. 017325 Sorensen, I.H.* Specification and design of distributed systems.* Aarhus U. Comp.Sci.Dept.*DAIMI PB-141, Ph.D. Thesis. Sorensen, I.H. (University of Oxford).*1981. 017326 Cohen, H. Lenstra, H.W. Jr.* Primality testing and Jacobi sums.* Amsterdam U. Math.Dept.*Rpt. 82-18.*1982. 017327 Cuppen, J.J.M.*The singular value decomposition in product form.* Amsterdam U. Math.Dept.*Rpt. 81-06.*1981. 017328 Dekker, T.J.* Program correctness and machine arithmetic.* Amsterdam U. Math.Dept.*Rpt. 81-07.*1981. 017329 Emde Boas, P. van*Another NP-complete partition problem and the complexity of computing short vectors in a lattice.* Amsterdam U. Math.Dept.*Rpt. 81-04.*1981. 017330 Emde Boas, P. van* Dominoes are forever.* Amsterdam U. Math.Dept.*Rpt. 83-04.*1983. 017331 Jager, E.M. de Wilders, P.*The Korteweg de Vries equation as a singular perturbation problem.* Amsterdam U. Math.Dept.*Rpt. 82-07.*1982. 017332 Lenstra, A.K. Lenstra, H.W. Jr. Lovasz, L.* Factoring polynomials with rational coefficients.* Amsterdam U. Math.Dept.*Rpt. 82-05.*1982. 017333 Mak, R.H.* Simultaneous inverse iteration for real symmetric bandmatrices.* Amsterdam U. Math.Dept.*Rpt. 82-20.*1982. 017334 Zeinstra, R.* Spanning sets of complex exponentials on curves.* Amsterdam U. Math.Dept.*Rpt. 82-09.*1982. 017335 Gay, D.M.*On convergence testing in model/trust-region algorithms for unconstrained optimization.* Bell Labs.* Comp.Sci. Tech.Rpt. 104.*1982. 017336 Kaufman, L.*A package of subroutines for solving systems of linear equations.* Bell Labs.*Comp.Sci. Tech.Rpt. 106.* 1981. 017337 Kaufman, L.*Usage of the sparse matrix programs in the PORT library.* Bell Labs.*Comp.Sci. Tech.Rpt. 105.*n.d. 017338 Bertero, M.*Problemi lineari non ben posti e metodi di regolarizzazione.* Consiglio Nazionale delle Ricerche, Pavia, Italy. Istituto di Analisi Globale e Applicazioni.* Serie "Problemi non ben pasti ed inversi" No. 04.*1982. 017339 Campi, S.*On the reconstruction of a star shaped body from its "half-volumes".* Consiglio Nazionale delle Ricerche, Pavia, Italy. Istituto di Analisi Globale e Applicazioni.* Serie "Problemi non ben pasti ed inversi" No. 02.*1982. 017340 Frosali, G.P. Pucci, C.*A not well posed problem for the wave equation.* Consiglio Nazionale delle Ricerche, Pavia, Italy. Istituto di Analisi Globale e Applicazioni.* Serie "Problemi non ben pasti ed inversi" No. 01.*1982. 017341 Pagani, C.D.*Determining a coefficient of a parabolic equation.* Consiglio Nazionale delle Ricerche, Pavia, Italy. Istituto di Analisi Globale e Applicazioni.*Serie "Problemi non ben pasti ed inversi" No. 03.*1982. 017342 Pagani, C.D.* Stability of a surface determined from measures of potential.* Consiglio Nazionale delle Ricerche, Pavia, Italy. Istituto di Analisi Globale e Applicazioni.*Serie "Problemi non ben pasti ed inversi" No. 05.*1982. 017343 Pucci, C.*Problemi non ben posti per l'equazione delle onde.* Consiglio Nazionale delle Ricerche, Pavia, Italy. Istituto di Analisi Globale e Applicazioni.*Serie "Problemi non ben pasti ed inversi" No. 06.*1982. 017344 Bakker, J.W. de Bergstra, J.A. Klop, J.W. Meyer, J.-J.CH.* Linear time and branching time semantics for recursion with merge.* Mathematisch Centrum.*IW 211/82.*1982. 017345 Bakker, J.W. de Zucker, J.I.*Processes and a fair semantics for the ADA rendez-vous.* Mathematisch Centrum.*IW 212/82.*1982. 017346 Dekker, K.*On the iteration error in algebraically stable Runge Kutta methods.* Mathematisch Centrum.*NW 138/82.* 1982. 017347 Geurts, L.J.M.*An overview of the B programming language or B without tears.* Mathematisch Centrum.*IW 208/82.*1982. 017348 Hemker, P.W.*The use of defect correction for the solution of a singularly perturbed O.D.E.* Mathematisch Centrum.* NW 139/82.*1982. 017349 Houwen, P.J. van der Sommeijer, B.P.* Predictor corrector methods with improved absolute stability regions.* Mathematisch Centrum.*NW 137/82.*1982. 017350 Lenstra, A.K.* Factoring polynomials over algebraic number fields.* Mathematisch Centrum.*IW 213/82.*1982. 017351 Meertens, L.G.L.T.*Incremental polymorphic type checking in B.* Mathematisch Centrum.*IW 214/82.*1982. 017352 Te Riele, H.J.J.*On generating new amicable pairs from given amicable pairs.* Mathematisch Centrum.*NW 140/82.* 1982. 017353 Ten Hagen, P.J.W.*The review of GKS version 7.0, the finishing touch.* Mathematisch Centrum.*IW 210/82.*1982. 017354 Vries, H.B. de*A survey of one-step splitting methods for semi-discrete first order hyperbolic partial differential equations.* Mathematisch Centrum.*NW 141/82.*1982. 017355 Castilho, J.M.V. Casanova, M.A. Furtado, A.L.*A temporal framework for database specifications.* Pontificia U., Rio de Janeiro. Info.Dept.*No. 04/82.*1982. 017356 Furtado, A.L. Furtado, A.A.B. Messeder, F.A.*Instructional graphics packages to be used with a line printer.* Pontificia U., Rio de Janeiro. Info.Dept.*No. 06/82.* 1982. 017357 Moura, C.M.O. Casanova, M.A.* Design by example (preliminary report).* Pontificia U., Rio de Janeiro. Info.Dept.*No. 05/82.*1982. 017358 Nakanishi, T. Menasce, D.A.* Correctness and performance valuation of a two-phase commit based protocol for DDBs.* Pontificia U., Rio de Janeiro. Info.Dept.*No. 10/81.* 1981. 017359 Brass, B. Erhard, F. Horsch, A. Riethmayer, H.-O. Steinbruggen, R.* CIP-S: an instrument for program transformation and rule generation.* Technische Universitat Munchen. Institut fuer Informatik.*TUM I8211.* 1982. 017360 Friede, D.*On partitioned van Wijngaarden grammars (a first attempt).* Technische Universitat Munchen. Institut fuer Informatik.*TUM I8207.*1982. 017361 Moller, B.*Unendliche objekte und geflechte.* Technische Universitat Munchen. Institut fuer Informatik.*TUM I8213.* 1982. 017362 Reiser, A.*Korrektheitsnachweis eines Synchronisations-Protokolls fur verteilte Datenbandsysteme.* Technische Universitat Munchen. Institut fuer Informatik.*TUM I8210.*1982. 017363 Castrigiano, D.P.L. Submann, G.* Galilean inertial structure.* Technische Universitat Munchen. Institut fuer Informatik.*TUM M8211.*1982. 017364 Castrigiano, D.P.L. Submann, G.* Inertial structure.* Technische Universitat Munchen. Institut fuer Informatik.* TUM M8210.*1982. 017365 Castrigiano, D.P.L.* Metrical geometry of Galilean inertial structure.* Technische Universitat Munchen. Institut fuer Informatik.*TUM M8212.*1982. 017366 Holodniok, M. Kubicek, M.* Stable and unstable periodic solutions in the Lorenz model.* Technische Universitat Munchen. Institut fuer Informatik.*TUM M8217.*1982. 017367 Lasser, R.* Lacunarity with respect to orthogonal polynomial sequences.* Technische Universitat Munchen. Institut fuer Informatik.*TUM M8218.*1982. 017368 Groger, D. Kroll, H.-J. Sorensen, K.* Beitrage zur geometrie und algebra, Nr. 8.* Technische Universitat Munchen. Institut fuer Informatik.*TUM M8213.*1982. 017369 Maier, M.R.*Numerische losung singular gestorter Randwertprobleme mit anwendung auf halbleitermodelle.* Technische Universitat Munchen. Institut fuer Informatik.* TUM M8216.*1982. 017370 Seydel, R.*Neue methoden zur numerischen berechnung abzweigender losungen bei randwertproblemen gewohnlicher differentialgleichungen.* Technische Universitat Munchen. Institut fuer Informatik.*TUM M8215.*1982. 017371 Lindinger, H.*Der full-information-maximum-likelihood-Schatzwert des linearen okonometrischen modells.* Technische Universitat Munchen. Institut fuer Informatik.*TUM ISU8202.*1982. 017372 Black, J.B. Galambos, J.A. Reiser, B.J.*Coordinating discovery and verification research.* Yale U. Cognitive Science Program.*Tech.Rpt. 013.*1982. 017373 Black, J.B. Seifert, C.M.*The psychological study of story understanding.* Yale U. Cognitive Science Program.* Tech.Rpt. 018.*1982. 017374 Black, J.B. Galambos, J.A. Read, S.* Story comprehension.* Yale U. Cognitive Science Program.*Tech.Rpt. 017.*1982. 017375 Galambos, J.A.*Normative studies of six characteristics of our knowledge of common activities.* Yale U. Cognitive Science Program.*Tech.Rpt. 014.*1982. 017376 Reiser, B.J. Black, J.B. Lehnert, W.G.* Thematic knowledge structures in the understanding and generation of narratives.* Yale U. Cognitive Science Program.* Tech.Rpt. 016.*1982. 017377 Seifert, C.M. Robertson, S.P.*On-line processing of pragmatic inferences.* Yale U. Cognitive Science Program.*Tech.Rpt. 015.*1982. 017378 Bonar, J. Soloway, E.*Uncovering principles of novice programming.* Yale U. Comp.Sci.Dept.*Res.Rpt. 240.*1982. 017379 Dyer, M.G.*In-depth understanding: a computer model of integrated processing for narrative comprehension.* Yale U. Comp.Sci.Dept.*Res.Rpt. 219, Ph.D. Thesis. Dyer, M.G.* 1982. 017380 Ehrlich, K. Soloway, E.*An empirical investigation of the tacit plan knowledge in programming.* Yale U. Comp.Sci.Dept.*Res.Rpt. 236.*1982. 017381 Lytinen, S.L. Schank, R.C.* Representation and translation.* Yale U. Comp.Sci.Dept.*Res.Rpt. 234.*1982. 017382 Schank, R.C. Burstein, M.*Modeling memory for language understanding.* Yale U. Comp.Sci.Dept.*Res.Rpt. 220.* 1982. 017383 Soloway, E. Bonar, J. Ehrlich, K.* Cognitive strategies and looping constructs: an empirical study.* Yale U. Comp.Sci.Dept.*Res.Rpt. 242.*1982. 017384 Soloway, E. Ehrlich, K. Bonar, J. Greenspan, J.*What do novices know about programming?* Yale U. Comp.Sci.Dept.* Res.Rpt. 218.*1982. 017385 Carey, M.J. Thompson, C.D.*An efficient implementation of search trees on 0(log N) processors.* California U., Berkeley. Comp.Sci.Div.*UCB/CSD 82/101.*1982. 017386 Carey, M.J. Hansen, P.M. Thompson, C.D.* RESST: a VLSI implementation of a record sorting stack.* California U., Berkeley. Comp.Sci.Div.*UCB/CSD 82/102.*1982. 017387 Despain, A. Sequin, C. Thompson, C. Wold, E. Lioupis, D.* VLSI implementation of digital Fourier transforms.* California U., Berkeley. Comp.Sci.Div.*UCB/CSD 82/111.* 1982. 017388 Ferrari, D.*On the foundations of artificial workload design.* California U., Berkeley. Comp.Sci.Div.*UCB/CSD 82/110.*1982. 017389 Ferrari, D.* Working set size string.* California U., Berkeley. Comp.Sci.Div.*UCB/CSD 82/109.*1982. 017390 Karmarker, N. Karp, R.M.*The differencing method of set partitioning.* California U., Berkeley. Comp.Sci.Div.* UCB/CSD 82/113.*1982. 017391 Karp, R.M. Luby, M.G.*A new Monte Carlo method for estimating the failure probability of an n-component system.* California U., Berkeley. Comp.Sci.Div.*UCB/CSD 83/117.*1983. 017392 Lee, T.P.*The properties and limiting behavior of working set size strings and`flat faults.* California U., Berkeley. Comp.Sci.Div.*UCB/CSD 82/108.*1982. 017393 Ousterhout, J.K.* Corner stitching: a data structuring technique for VLSI layout tools.* California U., Berkeley. Comp.Sci.Div.*UCB/CSD 82/114.*1982. 017394 Ousterhout, J.K.* Crystal: a timing analyzer for nMOS VLSI circuits.* California U., Berkeley. Comp.Sci.Div.*UCB/CSD 83/115.*1983. 017395 Paz, A.*A simplified version of H.W. Lenstra's integer programming algorithm and some applications.* California U., Berkeley. Comp.Sci.Div.*UCB/CSD 83/116.*1983. 017396 Sequin, C.H. Patterson, D.A.*Design and implementation of RISC I.* California U., Berkeley. Comp.Sci.Div.*UCB/CSD 82/106.*1982. 017397 Sequin, C.H. Fujimoto, R.M.* X-tree and Y-components.* California U., Berkeley. Comp.Sci.Div.*UCB/CSD 82/107.* 1982. 017398 Thompson, C.D.* Fourier transforms in VLSI.* California U., Berkeley. Comp.Sci.Div.*UCB/CSD 82/105.*1982. 017399 Tong, P. Lawler, E.L. Vazirani, V.V.*Solving the weighted parity problem for gammoids by reduction to graphic matching.* California U., Berkeley. Comp.Sci.Div.* UCB/CSD 82/103.*1982. 017400 Wilensky, R.*Talking to UNIX in English: an overview of an on-line consultant.* California U., Berkeley. Comp.Sci.Div.*UCB/CSD 82/104.*1982. 017401 Barth, J.S.*An extensible disk operating system for 8080/ Z80 microcomputers. Volume I: Project report.* Illinois U. Comp.Sci.Dept.*UIUCDCS-R-82-1097.*1982. 017402 Barth, J.S.*An extensible disk operating system for 8080/ Z80 microcomputers. Volume II: User's manual.* Illinois U. Comp.Sci.Dept.*UIUCDCS-R-82-1098.*1982. 017403 Beame, P.* Random routing in constant degree networks.* Toronto U. Comp.Sci.Dept.*Tech.Rpt. 161.*1982. 017404 Bianchini, R. Bianchini, R. Jr.* Wireability of an ultracomputer.* New York U. Courant Math. & Computing Lab.*DOE/ER/03077-177.*1982. 017405 Bilgory, A.* Compilation of register transfer language descriptions.* Illinois U. Comp.Sci.Dept.* UIUCDCS-R-82-1091,*Ph.D. Thesis. Bilgory, A.*1982. 017406 Chakravarty, I.*The use of characteristic views as a basis for recognition of three-dimensional objects.* Rensselaer Polytechnic Inst. Image Processing Lab.* IPL-TR-034.*1982. 017407 Concepcion, A.I. Zeigler, B.P.* Distributed simulation of distributed system models.* Wayne State U. Comp.Sci.Dept.*CSC-82-016.*1982. 017408 Digital Equipment Corp. Intel Corp. Xerox Corp.*The Ethernet: a local area network. Data link layer and physical layer specifications. Version 2.0.*Nov. 1982. 017409 Eklundh, J.O. Kjelldahl, L. Lansner, A. Ronberger, S. Sundblad, Y.* Integrated Text, Image and Graphics Laboratory. Proposal for a research laboratory at the Department for Numerical Analysis and Computing Science (NADA) at the Royal Institute of Technology (RIT) in Stockholm within the STV Programme for Knowledge Development in Information Processing.* Royal Inst. of Tech., Stockholm Num.Anal. & Computing Sci.Dept.* TRITA-NA-8204; Royal Inst. of Tech., Stockholm. Num.Anal. & Computing Sci.Dept. Integral Project.*INTEGRAL-001.* 1982. 017410 Haikala, I.J. Kutvonen, P.H.*Design and implementation of the Mopo minicomputer system.* Helsinki U. Comp.Sci.Dept.* Rpt. A-1982-05.*1982. 017411 Harms, J.J. Colbourn, C.J.*An optimal algorithm for directing triple systems using Eulerian circuits.* Saskatchewan U. Computational Sci.Dept.*Rpt. 83-02.*1983. 017412 Harten, A.*On a class of high resolution total-variation-stable finite difference schemes.* New York U. Courant Math. & Computing Lab.*DOE/ER/03077-176.* 1982. 017413 Lacos, C.A. McDermott, T.S.*Interfacing with the user of a syntax directed editor.* Tasmania U. Info.Sci.Dept.*No. R82-03.*1982. 017414 Lax, P.D. Levermore, C.D.*The small dispersion limit of the Korteweg deVries equations.* New York U. Courant Math. & Computing Lab.*DOE/ER/02077-172.*1982. 099077 Rochester U. Comp.Sci.Dept.*1982-83 Computer Science and computer engineering research review, Computer Science Department, The University of Rochester. 017415 Ross, S.M.*A model in which component failure rates depend on the working set.* Cal. U., Berkeley. O.R. Center.*ORC 82-11.*1982. 017416 Sand, J.*On contractive one leg methods.* Royal Inst. of Tech., Stockholm. Num.Anal. & Computing Sci.Dept.* TRITA-NA-8218.*n.d. 017417 Sand, J.* Stability and boundedness results for variable step variable formula methods.* Royal Inst. of Tech., Stockholm. Num.Anal. & Computing Sci.Dept.*TRITA-NA-8219.* 1982. 017418 Sethi, I.K. Jain, R.*Determining three dimensional structure of rotating objects.* Wayne State U. Comp.Sci.Dept.*CSC-83-001.*1983. 017419 Symm, G.T. Wichmann, B. Kok, J. Winter, D.T.*Guidelines for the design of large modular scientific libraries in Ada* - interim report.* U.K. National Physical Lab. Info. Technology and Computing Div.*DITC 14/82.*1982. 017420 Tarhio, J.* Attribute evaluation during LR parsing.* Helsinki U. Comp.Sci.Dept.*Rpt. A-1982-04.*1982. 017421 Wood, R.K.* Polygon to chain reductions and extensions for reliability evaluation of undirected networks.* Cal U., Berkeley. O.R. Center.*ORC 82-12.*1982. VOL. 5, NO. 5 05/09/83 017422 Findler, N.V. Cromp, R.F.*An artificial intelligence technique to generate self-optimizing experimental designs.* Arizona State U. Comp.Sci.Dept.*TR-83-001.* 1983. 017423 Findler, N.V.*An expert subsystem based on generalized production rules.* Arizona State U. Comp.Sci.Dept.* TR-82-003.*1982. 017424 Findler, N.V. Lo, R.*A note on the functional estimation of values of hidden variables--an extended module for expert systems.* Arizona State U. Comp.Sci.Dept.*TR-82-004.* 1982. 017425 Olsen, D.R. Jr. Badler, N.*An expression model for graphical command languages.* Arizona State U. Comp.Sci.Dept.*TR-82-001.*1982. 017426 Ozkarahan, E.A. Can, F.*Integration of fact document retrieval systems within a database machine.* Arizona State U. Comp.Sci.Dept.*TR-82-002.*1982. 017427 Bisiani, R. Foster, M.J. Kung, H.T. Oflazer, K.* MISE: Machine for In-System Evaluation of custom VLSI chips.* Carnegie Mellon U. Comp.Sci.Dept.*CMU-CS-82-132.*1982. 017428 Chansler, R.J. Jr.* Coupling in systems with many processors.* Carnegie Mellon U. Comp.Sci.Dept.* CMU-CS-82-131, Ph.D. Thesis. Chansler, R.J. Jr.*1982. 017429 Mohan, J.*A study in parallel computation--the traveling salesman problem.* Carnegie Mellon U. Comp.Sci.Dept.* CMU-CS-82-136.*1982. 017430 Schwarz, P.M. Spector, A.Z.* Synchronizing shared abstract types.* Carnegie Mellon U. Comp.Sci.Dept.*CMU-CS-82-128.* 1982. 017431 Van Wyk, C.J. Bentley, J.L. Weinberger, P.J.* Efficiency considerations for C programs.* Carnegie Mellon U. Comp.Sci.Dept.*CMU-CS-82-134.*1982. 017432 Barzilai, Z. Carter, J.L. Chandra, A.K. Rosen, B.K.* Diagnosis based on signature testing.* IBM Watson Res. Center.*RC 9682.*1982. 017433 Barzilai, Z. Silberman, G. Tang, D. Woo, L.*Simulating pass transistor circuits using logic simulation machines.* IBM Watson Res. Center.*RC 9693.*1982. 017434 Brand, D.*PLAs versus random logic.* IBM Watson Res. Center.*RC 9505.*1982. 017435 Brantley, W.C. Weiss, J.* FOM: a Fortran optimized machine - a high performance, high level language machine.* IBM Watson Res. Center.*RC 9640.*1982. 017436 Brantley, W.C. Weiss, J.*Organization and architecture trade-offs in FOM.* IBM Watson Res. Center.*RC 9700.* 1982. 017437 Burger, W.F.* MLD: a language and data base for modeling.* IBM Watson Res. Center.*RC 9639.*1982. 017438 Burstein, M. Pelavin, R.* Hierarchical channel router.* IBM Watson Res. Center.*RC 9715.*1982. 017439 Carroll, J.M. Mack, R.L.* Metaphor, computing systems, and active learning.* IBM Watson Res. Center.*RC 9636.*1982. 017440 Cesar, C.L. Chu, K.-C. Flurry, G.A. Hailpern, B.T. Jensen, E.P. King, R.P. Korth, H.F. Martin, M.A. Reich, D.L. Reubenstein, H.B. Rosenfeld, J.L. Shedletsky, J.J. Theimer, M.M. Willner, B.E. Wolf, P.P.*An integrated office system.* IBM Watson Res. Center.*RC 9659.*1982. 017441 Dahmen, W. Micchelli, C.A.* Translates of multivariate splines.* IBM Watson Res. Center.*RC 9618.*1982. 017442 Ferrante, J. Ottenstein, K.J.*A program form based on data dependency in predicate regions.* IBM Watson Res. Center.*RC 9685.*1982. 017443 Georgiou, C.J. Wood, R.C.*Single chip multiprocessor interconnection architecture.* IBM Watson Res. Center.* RC 9635.*1982. 017444 Ghosh, S.P.*Some advances in data base access techniques.* IBM Watson Res. Center.*RJ 3665.*1982. 017445 Gopal, I.S. Jaffe, J.M.* Point to multipoint link control protocols for satellites.* IBM Watson Res. Center.*RC 9671.*1982. 017446 Gopal, I. Bonucelli, M. Wong, C.K.* Scheduling in multibeam satellites with interfering zones.* IBM Watson Res. Center.*RC 9663.*1982. 017447 Grumberg, O. Francez, N.*A complete proof rule for (weak) equifair termination.* IBM Watson Res. Center.*RC 9634.* 1982. 017448 Haerder, T.*Observations on optimistic concurrency control schemes.* IBM Watson Res. Center.*RJ 3645.*1982. 017449 Hailpern, B.T. Korth, H.F.*An experimental distributed database system.* IBM Watson Res. Center.*RC 9678.*1982. 017450 Halim, N. Pershing J.*A new language for writing portable and secure systems.* IBM Watson Res. Center.*RC 9650.* 1982. 017451 Hou, J.C.*A fully associative cache memory controller.* IBM Watson Res. Center.*RC 9684.*1982. 017452 Jensen, K. Heidorn, G.E.*The fitted parse: 100% parsing capability in a syntactic grammar of English.* IBM Watson Res. Center.*RC 9729.*1982. 017453 Kerner, D.V.*Generating requirements from enterprise analysis.* IBM Watson Res. Center.*RC 9694.*1982. 017454 King, R.P. Korth, H.F. Willner, B.E.*Design of a document filing and retrieval service.* IBM Watson Res. Center.* RC 9696.*1982. 017455 Leavenworth, B.* ADAPT: a tool for the design of reusable software.* IBM Watson Res. Center.*RC 9728.*1982. 017456 Lomet, D.B.*A high performance, universal, key associative access method.* IBM Watson Res. Center.*RC 9638.*1982. 017457 Lucas, B.D.*Drawing lines and curves on raster devices using strokes: two examples.* IBM Watson Res. Center.*RC 9648.*1982. 017458 Mack, R. Lewis, C. Carroll, J.* Learning to use word processors: problem and prospects.* IBM Watson Res. Center.*RC 9712.*1982. 017459 Malhotra, A. Markowitz, H.M. Pazel, D.P.* Consistent copy: a new database facility.* IBM Watson Res. Center.*RC 9630.*1982. 017460 Micchelli, C.A.* Orthogonal projections are optimal algorithms.* IBM Watson Res. Center.*RC 9641.*1982. 017461 Miller, L.A.*How to write: a barely annotated bibliography.* IBM Watson Res. Center.*RC 9687.*1982. 017462 Nackman, L.R.*Two-dimensional critical point configuration graphs.* IBM Watson Res. Center.*RC 9642.*1982. 017463 Nadas, A.*A decision theoretic formulation of a training problem in speech recognition and a comparison of training by uncondition versus conditional maximum likelihood.* IBM Watson Res. Center.*RC 9617.*1982. 017464 O'Hara, R.P.*An interactive display environment of knitting sheep's clothing for a wolf.* IBM Watson Res. Center.*RC 9691.*1982. 017465 Porat, S. Francez, N. Moran, S. Zaks, S.* Fair derivations in context free grammars.* IBM Watson Res. Center.*RC 9664.*1982. 017466 Robinson, J.T.*Experiments with transaction processing on a multi-microprocessor.* IBM Watson Res. Center.*RC 9725.* 1982. 017467 Sauer, C.H. MacNair, E.A. Kurose, J.F.* Queueing network simulations of computer communication.* IBM Watson Res. Center.*RC 9727.*1982. 017468 Savir, J. Ditlow, G. Bardell, P.H.* Random pattern testability.* IBM Watson Res. Center.*RC 9643.*1982. 017469 Sholtz, P.N.*Making high-quality colored images on raster displays.* IBM Watson Res. Center.*RC 9632.*1982. 017470 Stone, H.S.* Parallel memory allocation using the FETCH-AND-ADD instruction.* IBM Watson Res. Center.*RC 9674.*1982. 017471 Tang, D.T. Chen, C.L.* Logic test pattern generation using linear codes.* IBM Watson Res. Center.*RC 9722.*1982. 041681 Barber, G.*Supporting organizational problem solving with a workstation.* M.I.T. A.I. Lab.*Memo 681.*1982. 041692 Barter, C.J.* Policy protocol interaction in composite processes.* M.I.T. A.I. Lab.*Memo 692.*1982. 041684 Brooks, R.A. Lozano-Perez, T.*A subdivision algorithm in configuration space for findpath with rotation.* M.I.T. A.I. Lab.*Memo 684.*1982. 041685 Brooks, R.A.*Symbolic error analysis and robot planning.* M.I.T. A.I. Lab.*Memo 685.*1982. 041691 Hewitt, C. Jong, P. de* Open systems.* M.I.T. A.I. Lab.* Memo 691.*1982. 041699 Hildreth, E.C. Ullman, S.*The measurement of visual motion.* M.I.T. A.I. Lab.*Memo 699.*1982. 041686 Hollerbach, J.M.*Computers, brains, and the control of movement.* M.I.T. A.I. Lab.*Memo 686.*1982. 041700 Hollerbach, J.M.*Dynamic scaling of manipulator trajectories.* M.I.T. A.I. Lab.*Memo 700.*1982. 041698 Lozano-Perez, T.* Robot programming.* M.I.T. A.I. Lab.*Memo 698.*1982. 041683 Poggio, T.* Visual algorithms.* M.I.T. A.I. Lab.*Memo 683.* 1982. 041668 Richards, W. Nishihara, H.K. Dawson, B.* CARTOON: a biologically motivated edge detection algorithm.* M.I.T. A.I. Lab.*Memo 668.*1982. 041676 Stevens, K.A.*Implementation of a theory for inferring surface shape from contours.* M.I.T. A.I. Lab.*Memo 676.* 1982. 041680 Waters, R.C.* LetS: an expressional loop notation.* M.I.T. A.I. Lab.*Memo 680a.*1983. 041679 Winston, P.H. Binford, T.O. Katz, B. Lowry, M.* Learning physical descriptions from functional definitions, examples, and precedents.* M.I.T. A.I. Lab.*Memo 679.* 1982. 040690 Mason, M.T.* Manipulator grasping and pushing operations.* M.I.T. A.I. Lab.*TR-690, Ph.D. Thesis. Mason, M.T.*1982. 040688 Sjoberg, R.W.* Atmospheric effects in satellite imaging of mountainous terrain.* M.I.T. A.I. Lab.*TR-688.*1982. 017472 Andrews, G.R. Schneider, F.B.*Concepts and notations for concurrent programming.* Arizona U. Comp.Sci.Dept.*TR 82-12.*1982. 017473 Andrews, G.R.* Distributed programming languages.* Arizona U. Comp.Sci.Dept.*TR 82-13.*1982. 017474 Bruno, J.L.*Probabilistic bounds on the performance of list scheduling.* Arizona U. Comp.Sci.Dept.*TR 82-19.*1982. 017475 Budd, T.A. Miller, W.C.*Detecting typographical errors in numerical programs.* Arizona U. Comp.Sci.Dept.*TR 82-14.* 1982. 017476 Downey, P.J. Griswold, R.E.*On a family of nested recurrences.* Arizona U. Comp.Sci.Dept.*TR 82-18.*1982. 017477 Downey, P.J.*Stochastic analysis of concurrency.* Arizona U. Comp.Sci.Dept.*TR 82-15.*1982. 017478 Griswold, R.E.*The control of searching and backtracking in string pattern matching.* Arizona U. Comp.Sci.Dept.*TR 82-20.*1982. 017479 Hanson, D.R.*Low-cost, high-yield code optimization.* Arizona U. Comp.Sci.Dept.*TR 82-17.*1982. 017480 Novak, M. Griswold, R.E.* Programmer defined evaluation regimes.* Arizona U. Comp.Sci.Dept.*TR 82-16.*1982. 017481 Agrawal, R. Carey, M. DeWitt, D.* Deadlock detection is cheap.* Cal. U., Berkeley. Electronics Res.Lab.*Memo No. UCB/ERL M83/05.*1983. Comp.Sci.Dept.*TR M83/05.*1983. 017482 Allman, E. Stonebraker, M.*Observations on the evolution of a software system.* Cal. U., Berkeley. Electronics Res.Lab.*Memo. No. UCB/ERL M82/59.*1982. 017483 Carey, M.J.*An abstract model of database concurrency control algorithms.* Cal. U., Berkeley. Electronics Res.Lab.*Memo. No. UCB/ERL M83/06.*1983. 017484 Carey, M.J.* Granularity hierarchies in concurrency control.* Cal. U., Berkeley. Electronics Res.Lab.*Memo. No. UCB/ERL M83/01.*1983. 017485 Stonebraker, M. Rubenstein, B. Guttman, A.*Application of abstract data types and abstract indices to CAD data bases.* Cal. U., Berkeley. Electronics Res.Lab.*Memo. No. UCB/ERL M83/03.*1983. 017486 Stonebraker, M. Rowe, L.A.* Database portals: a new application program interface.* Cal. U., Berkeley. Electronics Res.Lab.*Memo. No. UCB/ERL M82/80.*1982. 017487 Stonebraker, M. Woodfill, J. Ranstrom, J. Murphy, M. Kalash, J. Carey, M. Arnold, K.* Performance analysis of distributed data base systems.* Cal. U., Berkeley. Electronics Res.Lab.*Memo. No. UCB/ERL M82/85.*1982. 017488 Woodfill, J. Stonebraker, M.*An implementation of hypothetical relation.* Cal. U., Berkeley. Electronics Res.Lab.*Memo. No. UCB/ERL M83/02.*1983. 017489 Byrd, R.H. Shultz, G.A.*A practical class of globally convergent active set strategies for linearly constrained optimization.* Colorado U. Comp.Sci.Dept.*CU-CS-238-82.* 1982. 017490 Clinkenbeard, D.J.*A quite general text analysis method.* Colorado U. Comp.Sci.Dept.*CU-CS-237-82.*1982. 017491 Ehrenfeucht, A. Rozenberg, G. Haussler, D.*Conditions enforcing regularity of context free languages.* Colorado U. Comp.Sci.Dept.*CU-CS-223-82.*1982. 017492 Ehrenfeucht, A. Rozenberg, G.* Strong iterative pairs and the regularity of context free languages.* Colorado U. Comp.Sci.Dept.*CU-CS-208-81.*1981. 017493 Ehrenfeucht, A. Rozenberg, G. Karhumaki, J.*The (generalized) post correspondence problem with lists consisting of two words is decidable.* Colorado U. Comp.Sci.Dept.*CU-CS-204-81.*1981. 017494 Gabow, H.N.*An almost-linear algorithm for two processor scheduling.* Colorado U. Comp.Sci.Dept.*CU-CS-212-81.* 1981, (revised). 017495 Gabow, H.N. Tarjan, R.E.*Efficient algorithms for a family of matroid intersection problems.* Colorado U. Comp.Sci.Dept.*CU-CS-214-82.*1982. 017496 Gabow, H.N.*Exact and approximate algorithms for scheduling UET systems on two uniform processors.* Colorado U. Comp.Sci.Dept.*CU-CS-225-82.*1982. 017497 Gabow, H.N.*Priming the pump for lower bounds on Chomsky form.* Colorado U. Comp.Sci.Dept.*CU-CS-239-82.*1982. 017498 Haussler, D.*Some results on symmetric DGSMS and DGSM equivalence.* Colorado U. Comp.Sci.Dept.*CU-CS-199-79.* 1979. 017499 Osterweil, L.J.*The toolpack mathematical software development environment.* Colorado U. Comp.Sci.Dept.* CU-CS-226-82.*1982. 017500 Rozenberg, G.*On subwords of formal languages.* Colorado U. Comp.Sci.Dept.*CU-CS-205-81.*1981. 017501 Schnabel, R.B.* Conic methods for unconstrained minimization and tensor methods for nonlinear equations.* Colorado U. Comp.Sci.Dept.*CU-CS-227-82.*1982. 017502 Shultz, G.A. Schnabel, R.B. Byrd, R.H.*A family of trust region based algorithms for unconstrained minimization with strong global convergence properties.* Colorado U. Comp.Sci.Dept.*CU-CS-216-82.*1982. 017503 Warmuth, M.K. Haussler, D.*On the complexity of iterated shuffle.* Colorado U. Comp.Sci.Dept.*CU-CS-201-81.*1981. 017504 Wilson, C. Osterweil, L.J.* Omega--a data flow analysis tool for the C programming language.* Colorado U. Comp.Sci.Dept.*CU-CS-217-82.*1982. 017505 Alterman, R.E.*A system of seven coherence relations for hierarchically organizing event concepts in text.* Texas U. Comp.Sci.Dept.*TR-209.*1982. 017506 Bitner, J.R.*An exact calculation of the capacity of hyperboxes.* Texas U. Comp.Sci.Dept.*TR-194.*1982. 017507 Bitner, J.R.*On the efficiency of algorithm SELECT by Floyd and Rivest.* Texas U. Comp.Sci.Dept.*TR-183.*1981. 017508 Bitner, J.R.*Storing matrices on disk for efficient row and column retrieval.* Texas U. Comp.Sci.Dept.*TR-195.*1982. 017509 Bitner, J.R.*Two results on self organizing data structures.* Texas U. Comp.Sci.Dept.*TR-189.*1982. 017510 Boney, J.F.*Analysis of the M6809 instruction set.* Texas U. Comp.Sci.Dept.*TR-206.*1981. 017511 Burger, W.F.*A modeling system for mathematical programming.* Texas U. Comp.Sci.Dept.*TR-177, Ph.D. Thesis. Burger, W.F.*1981. 017512 Emerson, E.A. Clarke, E.M.*Using branching time temporal logic to synthesize synchronization skeletons.* Texas U. Comp.Sci.Dept.*TR-208.*1982. 017513 Gouda, M.G. Chu, W.*A finite state model for protocol processes and services.* Texas U. Comp.Sci.Dept.*TR-198.* 1982. 017514 Gouda, M.G.* Closed covers: to verify progress for communicating finite state machines.* Texas U. Comp.Sci.Dept.*TR-191.*1982. 017515 Gouda, M.G.*Proving termination for distributed computations on DAGs.* Texas U. Comp.Sci.Dept.*TR-197.* 1982. 017516 Peterson, J.L.* Webster's seventh new collegiate dictionary: a computer-readable file format.* Texas U. Comp.Sci.Dept.*TR-196.*1982. 017517 Gouda, M.G.*Systems of communicating machines without deadlocks.* Texas U. Comp.Sci.Dept.*TR-199.*1982. 017518 Kapur, R.N.*On the synthesis and analysis of reconfigurable computer programs.* Texas U. Comp.Sci.Dept.*TR-205.* 1982. 017519 Lam, S.S. Shankar, A.U.* Protocol verification via projections.* Texas U. Comp.Sci.Dept.*TR-207.*1982. 017520 Maekawa, M. Sakamura, K. Ishikawa, C.* Firmware structure and architectural support for monitors, vertical migration and user microprogramming.* Texas U. Comp.Sci.Dept.*TR-203.*1982. 017521 Ramakrishnan, I.V. Fussell, D.S. Silberschatz, A.*A linear array matrix multiplication algorithm.* Texas U. Comp.Sci.Dept.*TR-210.*1982. 017522 Ramakrishnan, I.V. Fussell, D.S. Silberschatz, A.*Towards a characterization of programs for a model of VLSI array processors.* Texas U. Comp.Sci.Dept.*TR-202.*1982. 017523 Sejnowski, M.C.* Packet support in the Texas reconfigurable array computer.* Texas U. Comp.Sci.Dept.*TR-204.*1981. 017524 Springen, N.L.*A source to source translator from Pascal to C.* Texas U. Comp.Sci.Dept.*TR-190.*1982. 017525 Usui, T.*An experimental grammar for translating English to Japanese.* Texas U. Comp.Sci.Dept.*TR-201.*1982. 017526 Yu, Y.-T. Gouda, M.G.* Deadlock detection for a class of communicating finite state machines.* Texas U. Comp.Sci.Dept.*TR-193.*1982. 017527 Enomoto, H. Usami, Y.*Minimum number of edges in graphs with given diameter and connectivity, I.* Tokyo U. Info.Sci.Dept.*Tech.Rpt. 82-02.*1982. 017528 Hagiya, M.*A proof description language and its reduction system.* Tokyo U. Info.Sci.Dept.*Tech.Rpt. 82-03.*1982. 017529 Kanasaki, K. Yamaguchi, K. Kunii, T.L.*A software development system supported by a database of structures and operations.* Tokyo U. Info.Sci.Dept.*Tech.Rpt. 82-15.*1982. 017530 Goto, E. Soma, T. Inada, N. Ida, T. Idesawa, M. Hiraki, K. Suzuki, M. Shimizu, K. Philipov, B.*Design of a Lisp machine - FLATS.* Tokyo U. Info.Sci.Dept.*Tech.Rpt. 82-09.*1982. 017531 Saito, A. Kano, M.*Some results on factors.* Tokyo U. Info.Sci.Dept.*Tech.Rpt. 82-10.*1982. 017532 Kawai, S.* Topology quasi-preservation by local parallel operations.* Tokyo U. Info.Sci.Dept.*Tech.Rpt. 82-13.* 1982. 017533 Sakamura, K. Ishikawa, C.* High level machine design by dynamic tuning.* Tokyo U. Info.Sci.Dept.*Tech.Rpt. 82-07.*1982. 017534 Sakamura, K. Ishikawa, C.*The impact of VLSI technology on computer architecture (VLSI...). (in Japanese).* Tokyo U. Info.Sci.Dept.*Tech.Rpt. 82-08.*1982. 017535 Sato, M.*Algebraic structure of symbolic expressions.* Tokyo U. Info.Sci.Dept.*Tech.Rpt. 82-05.*1982. 017536 Yamada-Hisao.*Certain problems associated with the design of input keyboards for Japanese writing.* Tokyo U. Info.Sci.Dept.*Tech.Rpt. 82-14.*1982. 017537 Yamada-Hisao. Imori, M.*One step transformation of periodic sequences by cellular automata.* Tokyo U. Info.Sci.Dept.* Tech.Rpt. 82-06.*1982. VOL. 5, NO. 6 05/25/83 017538 Aghili, H. Kim, W. McPherson, J. Schkolnick, M. Strong, R.* A highly available database system.* IBM Watson Res. Center.*RJ 3725.*1982. 017539 Barzilai, Z. Rosen, B.K.*Software support for VLSI testing methods.* IBM Watson Res. Center.*RC 9781.*1983. 017540 Bharath-Kumar, K. Kermani, P.* Performance evaluation tool ( PET): an analysis tool for computer communication networks.* IBM Watson Res. Center.*RC 9766.*1982. 017541 Burger, W.F. Halim, N. Pershing, J.A. Parr, F.N. Strom, R.E. Yemini, S.*Draft NIL reference manual.* IBM Watson Res. Center.*RC 9732.*1982. 017542 Bux, W. Truong, H.L.* Token ring performance: mean delay approximation.* IBM Watson Res. Center.*RZ 1199.*1982. 017543 Dahmen, W. Micchelli, C.A.*On the approximation order from certain multivariate spline spaces.* IBM Watson Res. Center.*RC 9796.*1983. 017544 Das, S.K.*Some dimensionality reduction studies in continuous speech recognition.* IBM Watson Res. Center.* RC 9797.*1983. 017545 Elrad, T. Francez, N.* Decomposition of distributed programs into communication closed layers.* IBM Watson Res. Center.*RC 9760.*1982. 017546 Elrad, T. Francez, N.*A weakest precondition semantics for communicating processes.* IBM Watson Res. Center.*RC 9773.*1982. 017547 Fich, F.E.*Two problems in concrete complexity: cycle detection and parallel prefix computation.* IBM Watson Res. Center.*RJ 3651, Ph.D. Thesis. Fich, F.E. (University of California at Berkeley).*1982. 017548 Galil, Z. Paul, W. Reischuk, R.*On tapes versus pushdowns.* IBM Watson Res. Center.*RJ 3703.*1982. 017549 Gopal, I. Wong, C.K.*Minimizing the number of switchings in an SS/TDMA system.* IBM Watson Res. Center.*RC 9738.* 1982. 017550 Gopal, I.S. Kermani, P.*The performance of stop and wait protocols over high delay links.* IBM Watson Res. Center.* RC 9741.*1982. 017551 Greene, B.R. Fujisake, T.*A probabilistic approach for dealing with ambiguous syntactic structures.* IBM Watson Res. Center.*RC 9764.*1982. 017552 Hoffman, A.J. Wolfe, P.* Minimizing a univodal function of two integer variables.* IBM Watson Res. Center.*RC 9755.* 1982. 017553 Jaffe, A.B. Mills, R.N.* Color hard copy for computer systems.* IBM Watson Res. Center.*RJ 3690.*1982. 017554 Klawe, M. Yao, A.*Equal justice for unequal shares of the cake.* IBM Watson Res. Center.*RJ 3688.*1982. 017555 Krzesinski, A.* Multiclass queueing networks with state dependent routing.* IBM Watson Res. Center.*RC 9761.* 1982. 017556 Krzesinski, A.* Subnetwork aggregation using mean value analysis.* IBM Watson Res. Center.*RC 9791.*1983. 017557 Lewis, C.* Composition of productions.* IBM Watson Res. Center.*RC 9730.*1982. 017558 Lorie, R. Plouffe, W.* Complex objects and their use in design transactions.* IBM Watson Res. Center.*RJ 3706.* 1982. 017559 MacNair, E.A. Sauer, C.H.*The research queueing package: a primer.* IBM Watson Res. Center.*RC 9784.*1983. 017560 Miranker, W.L. Winkler, A.*Spacetime representations of systolic computational structures.* IBM Watson Res. Center.*RC 9775.*1982. 017561 Newman, D.J. Rivlin, T.J.*Optimal universally stable interpolation.* IBM Watson Res. Center.*RC 9751.*1982. 017562 Nicholl, T.M. Lee, D.T. Liao, Y.Z. Wong, C.K.*Constructing the X-Y convex hull of a set of X-Y polygons.* IBM Watson Res. Center.*RC 9737.*1982. 017563 Parr, F.N. Strom, R.E.* NIL: a high level language for distributed systems programming.* IBM Watson Res. Center.*RC 9750.*1982. 017564 Reischuk, R.*A solution for the Byzantine generals problem.* IBM Watson Res. Center.*RJ 3673.*1982. 017565 Reisner, P.* Formal grammar as a tool for analyzing ease of use: some fundamental concepts.* IBM Watson Res. Center.* RJ 3726.*1982. 017566 Sacca, D.* Closure of database hypergraphs.* IBM Watson Res. Center.*RJ 3723.*1982. 017567 Schiag, M. Liao, Y.Z. Wong, C.K.*An algorithm for optimal two-dimensional compaction of VLSI layouts.* IBM Watson Res. Center.*RC 9739.*1982. 017568 Seroussi, G. Ma, F.*On the arithmetic complexity of matrix Kronexker powers.* IBM Watson Res. Center.*RC 9778.*1982. 017569 Siegel, P.H.* Witt spaces: a geometric cycle theory for ko-homology at odd primes.* IBM Watson Res. Center.*RJ 3729.*1982. 017570 Simons, B.B.*Minimizing maximum lateness for unit length jobs with release times and deadlines.* IBM Watson Res. Center.*RJ 3237.*1982. 017571 Stockmeyer, L.J.*Optimal orientations of cells in slicing floorplan designs.* IBM Watson Res. Center.*RJ 3731.* 1982. 017572 Strom, R.E.*Mechanisms for compile time enforcement of security.* IBM Watson Res. Center.*RC 9749.*1982. 017573 Strong, H.R. Dolev, D.* Byzantine agreement.* IBM Watson Res. Center.*RJ 3714.*1982. 017574 Svobodova, L.* File servers for network based distributed systems.* IBM Watson Res. Center.*RZ 1186.*1982. 017575 Trivedi, K.S. Yu, P.* Reliability and performance analysis of a ringnet.* IBM Watson Res. Center.*RC 9792.*1983. 017576 Tsai, R.Y.*Estimating 3-D motion parameters and object surface structures from the image motion of conic arcs, I: theoretical basis.* IBM Watson Res. Center.*RC 9787.* 1983. 017577 Unger, S.H. Tan, C.J.* Clocking schemes for high speed digital systems.* IBM Watson Res. Center.*RC 9754.*1982. (revised). 017578 Yao, A.C.*On optimal arrangements of keys with double hashing.* IBM Watson Res. Center.*RJ 3730.*1982. 017579 Zilles, S.N.* Types, algebras and modeling.* IBM Watson Res. Center.*RJ 3022.*1980. (revised, 1982). 017580 Bossi, A. Ghezzi, C.*Using FP as a query language for relational data-bases.* Milan. Politecnico. Dipartimento di Elettronica. Lab. di Calcolatori.*Rapporto Interno N. 82-11.*1982. 017581 Bracchi, G. Pernici, B.*Modelling control structures in office systems.* Milan. Politecnico. Dipartimento di Elettronica. Lab. di Calcolatori.*Rapporto Interno N. 82-19.*1982. 017582 Bussolati, U. Fugini, M. Martella, G.* ACTEN: an action entity model for conceptual modeling of security information.* Milan. Politecnico. Dipartimento di Elettronica. Lab. di Calcolatori.*Rapporto Interno N. 82-21.*1982. 017583 Ceri, S. Negri, M. Pelagatti, G.*Problems in horizontal data partitioning.* Milan. Politecnico. Dipartimento di Elettronica. Lab. di Calcolatori.*Rapporto Interno N. 82-05.*1982. 017584 Ceri, S. Negri, M. Oldano, G. Paolini, P. Pelagatti, G.*The run time control machine of the Hermes/1 distributed database system.* Milan. Politecnico. Dipartimento di Elettronica. Lab. di Calcolatori.*Rapporto Interno N. 82-06.*1982. 017585 Negri, M. Zicari, R.*A storage structure definition language for CODASYL data bases.* Milan. Politecnico. Dipartimento di Elettronica. Lab. di Calcolatori.* Rapporto Interno N. 82-20.*1982. 017586 Dahlquist, G.*On one leg multistep methods.* Royal Inst. of Tech., Stockholm. Num.Anal. & Computing Sci.Dept.* TRITA-NA-8301.*1983. 017587 Kjelldahl, L. Romberger, S.*Requirements for interactive editing of diagrams.* Royal Inst. of Tech., Stockholm. Num.Anal. & Computing Sci.Dept.*TRITA-NA-8303.*1983. 017588 Persson, M.*Tools and methods for describing and evaluating firmware and hardware architecture.* Royal Inst. of Tech., Stockholm. Num.Anal. & Computing Sci.Dept.* TRITA-NA-8307.*1983. 017589 Royal Inst. of Tech., Stockholm. Num.Anal. & Computing Sci.Dept.*The INTEGRAL project: Progress report, 1982.* 017590 Tiden, E.*The Algan simulation system.* Royal Inst. of Tech., Stockholm. Num.Anal. & Computing Sci.Dept.* TRITA-NA-8306.*1983. 017591 Abadir, M.S. Reghbati, H.K.*Functional testing of semiconductor random access memories.* Simon Fraser U. Computing Sci.Dept.*TR 82-10.*1982. 017592 Abadir, M.S. Reghbati, H.K.* Testability consideration in hardware description techniques.* Simon Fraser U. Computing Sci.Dept.*TR 82-09.*1982. 017593 Graham, R.L. Hell, P.*On the history of the minimum spanning tree problem.* Simon Fraser U. Computing Sci.Dept.*TR 82-05.*1982. 017594 Liestman, A.L. Richards, D.*Toward optimal gossiping schemes with conference calls.* Simon Fraser U. Computing Sci.Dept.*TR 82-07.*1982. 017595 Luk, W.S.*Performing set intersections and/or unions in a broadcast network.* Simon Fraser U. Computing Sci.Dept.* TR 82-08.*1982. 017596 Ibaraki, T. Kameda, T.*On the optimal nesting order for computing N-relational joins.* Simon Fraser U. Computing Sci.Dept.*TR 82-15.*1982. 017597 Cooke, M.P.*A speech controlled information retrieval system.* U.K. National Physical Lab. Info. Technology and Computing Div.*DITC 15/83.*1983. 017598 Curtis, P.E.M. Cox, M.G.*Reliable computation of the aberration function representing and interference pattern of a lens.* U.K. National Physical Lab. Info. Technology and Computing Div.*DITC 07/82.*1982. 017599 Davies, D.W. Clayden, D.O.*A message authenticator algorithm suitable for a main frame computer.* U.K. National Physical Lab. Info. Technology and Computing Div.*DITC 17/83.*1983. 017600 Ferriss, D.H. Hammarling, S.J. Martin, D.W. Warham, A.G.P.* Numerical solution of equations describing electromagnetic propagation in dielectric tube waveguides.* U.K. National Physical Lab. Info. Technology and Computing Div.*DITC 16/83.*1983. 017601 Scowen, R.S.*An introduction and handbook for the standard syntactic metalanguage.* U.K. National Physical Lab. Info. Technology and Computing Div.*DITC 19/83.*1983. 017602 Wichmann, B.A.*A note on the accuracy of two microprocessors.* U.K. National Physical Lab. Info. Technology and Computing Div.*DITC 18/83.*1983. 017603 Abu-Sufah, W.*Identifying program localities at the source level.* Illinois U. Comp.Sci.Dept.*UIUCDCS-R-82-1108.* 1982. 017604 Campbell, R.H.*A definition of open path expressions.* Illinois U. Comp.Sci.Dept.*UIUCDCS-R-82-1102.*1982. 017605 Deckert, J.A.*The UNIX system on the VAX computer.* Illinois U. Comp.Sci.Dept.*UIUCDCS-R-83-1117.*1983. 017606 Essick, R.B. IV Kolstad, R.*Notesfile reference manual.* Illinois U. Comp.Sci.Dept.*UIUCDCS-R-82-1081.*1982. 017607 Fiduccia, N.S.* Logic design of MOS networks under complexity restrictions.* Illinois U. Comp.Sci.Dept.* UIUCDCS-R-82-1100.*1982. 017608 Gear, C.W.*Efficient stepsize control for output and discontinuities.* Illinois U. Comp.Sci.Dept.* UIUCDCS-R-82-1111.*1982. 017609 Gear, C.W. Petzold, L.R.*ODE methods for the solution of differential/algebraic systems.* Illinois U. Comp.Sci.Dept.*UIUCDCS-R-82-1103.*1982. 017610 Gear, C.W.* Root finding in simulation and ODE solution.* Illinois U. Comp.Sci.Dept.*UIUCDCS-R-82-1116.*1982. 017611 Gear, C.W. Petzold, L.R.* Singular implicit ordinary differential equations and constraints.* Illinois U. Comp.Sci.Dept.*UIUCDCS-R-82-1110.*1982. 017612 Gear, C.W.* Stiff software: what do we have and what do we need?* Illinois U. Comp.Sci.Dept.*UIUCDCS-R-82-1109.* 1982. 017613 Lee, R.L.*The paging behavior of numerical programs.* Illinois U. Comp.Sci.Dept.*UIUCDCS-R-82-1101.*1982. 017614 Purtilo, J.*A general purpose PDP 11 interface processor.* Illinois U. Comp.Sci.Dept.*UIUCDCS-R-82-1107.*1982. 017615 Robertson, J.E.*Conditions for the distributivity of multiplication with respect to set addition and their effect on the design of array multipliers.* Illinois U. Comp.Sci.Dept.*UIUCDCS-R-82-1115.*1982. 017616 Agrawal, R. DeWitt, D.J.*Integrated concurrency control and recovery mechanisms: design and performance evaluation.* Wisconsin U. Comp.Sci.Dept.*Tech.Rpt. 497.*1983. 017617 Hanrahan, P.*Procedures for parallel array processing on a pipelined display terminal.* Wisconsin U. Comp.Sci.Dept.* Tech.Rpt. 490.*1982. 017618 Kamesam, P.V. Meyer, R.R.* Multipoint methods for nonlinear networks.* Wisconsin U. Comp.Sci.Dept.*Tech.Rpt. 468.* 1982. 017619 Katz, R.H. Weiss, S.* Transaction management for design databases.* Wisconsin U. Comp.Sci.Dept.*Tech.Rpt. 496.* 1983. 017620 Mangasarian, O.L.* Normal solutions of linear programs.* Wisconsin U. Comp.Sci.Dept.*Tech.Rpt. 498.*1983. 017621 Stacchetti, E.*Analysis of a dynamic, decentralized economic model.* Wisconsin U. Comp.Sci.Dept.*Tech.Rpt. 494, Ph.D. Thesis. Stacchetti, E.*1983. 017622 Bobrow, D.G. Stefik, M.*The LOOPS manual (preliminary version).* Xerox. Palo Alto Res. Center.*Memo KB-VLSI-81-13.*1981, (working paper). 017623 Conway, L.*The MPC adventures: experiences with the generation of VLSI design and implementation methodologies.* Xerox. Palo Alto Res. Center.*VLSI-81-02.* 1981. 017624 Hon, R.W. Sequin, C.H.*A guide to LSI implementation (second edition).* Xerox. Palo Alto Res. Center.*SSL-79-07.*1980. 017625 Lyon, R.F.*The optical mouse, and an architectural methodology for smart digital sensors.* Xerox. Palo Alto Res. Center.*VLSI-81-01.*1981. 017626 Maxwell, J.T. III Ornstein, S.M.* Mockingbird: a composer's amanuensis.* Xerox. Palo Alto Res. Center.*CSL-83-02.* 1983. 017627 Schmidt, E.E.*Controlling large software development in a distributed environment.* Xerox. Palo Alto Res. Center.*CSL-82-07, Ph.D. Thesis. Schmidt, E.E. (University of California at Berkeley).*1982. 017628 Stamos, J.W.*A large object oriented virtual memory: grouping strategies, measurements, and performance.* Xerox. Palo Alto Res. Center.*SCG-82-02.*1982. 017629 Stefik, M. Aikins, J. Balzer, R. Benoit, J. Birnbaum, L. Hayes-Roth, F. Sacerdoti, E.*The organization of expert systems: a prescriptive tutorial.* Xerox. Palo Alto Res. Center.*VLSI-82-01.*1982. 017630 Stefik, M. Bobrow, D. Bell, A. Brown, H. Conway, L. Tong, C.*The partitioning of concerns in digital system design.* Xerox. Palo Alto Res. Center.*VLSI-81-03.*1981. 017631 Stefik, M. Bell, A.G. Bobrow, D.G.* Rule oriented programming in LOOPS.* Xerox. Palo Alto Res. Center.*Memo KB-VLSI-82-22.*1982. (working paper). 017632 Weyer, S.A.* Searching for information in a dynamic book.* Xerox. Palo Alto Res. Center.*SCG-82-01, Ph.D. Thesis. Weyer, S.A. (Stanford University).*1982. 017633 Best, E.* Relational semantics of concurrent programs (with some applications).* Newcastle Upon Tyne U. Computing Lab.*No. 180.*1982. 017634 Bunt, R.B. Murphy, J.M.*The measurement of locality and the behaviour of programs.* Saskatchewan U. Computational Sci.Dept.*Rpt. 83-03.*1983. 017635 Shrivastava, S.K.*A dependency, commitment and rocovery model for atomic actions.* Newcastle Upon Tyne U. Computing Lab.*No. 178.*1982. 017636 Carstensen, H.*FairneB bei Petrinetzen mit unendlichem Verhalten.* Hamburg U. Fachbereich Informatik.*Bericht Nr. 93.*1982. 017637 Conrad, M.* Microscopic macroscopic interface in biological information processing.* Wayne State U. Comp.Sci.Dept.* CSC-83-003.*1983. 017638 Cram, D.L. Freytag, J.C. Hampton, I. Mall, M. Schmidt, J.W. Schwinghammer, T.*The evaluation of acoustics survey data from the first BIOMASS experiment report on an interdisciplinary data management project.* Hamburg U. Fachbereich Informatik.*Bericht Nr. 87.*1982. 017639 Culik, K. Rizki, M.M.* Mathematical constructive proofs as computer programs.* Wayne State U. Comp.Sci.Dept.* CSC-83-004.*1983. 017640 Ericsson, K.A. Chase, W.G.* Exceptional memory.* Carnegie Mellon U. Psych.Dept.*Tech.Rpt. 08.*1982. 017641 Frederiksen, J.R. Weaver, P.A. Warren, B.M. Gilotte, H.P. Rosebery, A.S. Freeman, B. Goodman, L.*A componential approach to training reading skills (final report).* Bolt, Beranek and Newman, Inc.*BBN rpt. 5295.*1983. 017642 Galler, B.I.* Concurrency control performance issues.* Toronto U. Comp. Systems Res. Group.*CSRG-147.*1982. 017643 Gyllstrom, P.G.* Fault tolerant synchronization in distributed computer systems.* Iowa U. Comp.Sci.Dept.* Tech.Rpt. 82-05, Ph.D. Thesis. Gyllstrom, P.G.*1982. 017644 Hagino, T.* Verification of communicating sequential processes - a transformation approach.* Kyoto U. Res.Inst.Math.Sci.*RIMS-431.*1983. 017645 Iwasaki, N.* Cauchy problems for effectively hyperbolic equations (a special case).* Kyoto U. Res.Inst.Math.Sci.* RIMS-432.*1983. 017646 Iwasaki, N.* Cauchy problems for effectively hyperbolic equations (a standard type).* Kyoto U. Res.Inst.Math.Sci.* RIMS-433.*1983. 017647 Liu, C.-C.*A generalized network flow model with applications to power supply-demand problems.* Cal. U., Berkeley. O.R. Center.*ORC 82-10.*1982. 017648 M.I.T. Lab. for Comp.Sci. Female Graduate Students and Staff. M.I.T. A.I. Lab. Female Graduate Students and Staff.*Barriers to equality in academia: Women in computer science at MIT. Prepared by female graduate students and research staff in the Laboratory for Computer Science and the Artificial Intelligence Laboratory at MIT.* Feb. 1983. 017649 Molle, M.L.* Asynchronous multiple access tree algorithms.* Toronto U. Comp. Systems Res. Group.*CSRG-145.*1982. 017650 Montuno, D. Fournier, A.*Detecting intersection among star polygons.* Toronto U. Comp. Systems Res. Group.* CSRG-146.*1982. 017651 Parlett, B.N. Taylor, D.*A look ahead Lanczos algorithm for unsymmetric matrices.* Cal. U., Berkeley. Pure & Appl.Math. Center.*1981. 017652 Perlman, G.* Natural artificial languages: low-level processes.* Cal. U., San Diego. Human Info. Proces. Center.*Rpt. 8208.*1982. 017653 Ramalhoto, M.F.* Identifiability and estimation in random translations of marked point processes.* Cal. U., Berkeley. O.R. Center.*ORC 82-13.*1982. 017654 Reiser, B.J. Black, J.B.*Processing and structural models of comprehension.* Yale U. Cognitive Science Program.* Tech.Rpt. 012.*1982. 017655 Schecher, H. Anlauff, H. Fehn, J.*Entwurf einer Mikrokontrolleinheit mit dreistufiger Pipeline.* Technische Universitat Munchen. Institut fuer Mathematik.* TUM-I8209.*1982. 017656 Sethi, I.K. Jain, R.*Determining three dimensional structure of rotating objects.* Wayne State U. Comp.Sci.Dept.*CSC-83-001.*1983. 017657 Sidner, C.L. Bates, M.*Requirements for natural language understanding in a system with graphic displays.* Bolt, Beranek and Newman, Inc.*BBN rpt. 5242.*1983. 017658 Srihari, S.N.* Pyramid representations for solids.* SUNY, Buffalo. Comp.Sci.Dept.*Tech.Rpt. 200.*1983. 017659 Wald, J.A. Sorenson, P.G.*Resolving the query inference problem using Steiner trees.* Saskatchewan U. Computational Sci.Dept.*Rpt.83-04.*1983. 017660 Woods, W.A. Bates, M. Bobrow, R.J. Goodman, B. Israel, D. Schmolze, J. Schudy, R. Sidner, C.L. Vilain, M.*Research in knowledge representation for natural language understanding. Annual report: 1 September 1981 to 31 August 1982.* Bolt, Beranek and Newman, Inc.*BBN rpt. 5188.*1982. 017661 Yau, M.-M.*Generating quadtrees of cross-sections from octrees.* SUNY, Buffalo. Comp.Sci.Dept.*Tech.Rpt. 199.* 1982. VOL. 5, NO. 7 06/08/83 017662 Byrant, R.E. Dennis, J.B.* Concurrent programming.* California Inst. of Tech. Comp.Sci.Dept.*No. 5027:TM:82.* 1982. 017663 Bryant, R.E.*A switch level model and simulator for MOS digital systems.* California Inst. of Tech. Comp.Sci.Dept.*No. 5065:TR:83.*1983. 017664 Bryant, R.E.* Switch level modeling of MOS digital circuits.* California Inst. of Tech. Comp.Sci.Dept.*No. 5012:TM:82.*1982. 017665 Carroll, C.R.* Hybrid processing.* California Inst. of Tech. Comp.Sci.Dept.*No. 5034:TR:82, Ph.D. Thesis. Carroll, C.R.*1982. 017666 Chan, W.S.*A new channel routing algorithm.* California Inst. of Tech. Comp.Sci.Dept.*No. 5038:TM:82.*1982. 017667 Chen, M.C. Mead, C.A.* Formal specification of concurrent systems.* California Inst. of Tech. Comp.Sci.Dept.*No. 5042:TR:82.*1982. Contents: Mead, C.A.* VLSI, signal processing, and formal semantics; Chen, M.C. Mead, C.A.* Concurrent algorithms as space time recursion equations. 017668 Chen, M.C. Mead, C.A.*A hierarchical simulator based on formal semantics.* California Inst. of Tech. Comp.Sci.Dept.*No. 5068:TM:83.*1983. 017669 Choo, Y.-I.* Hierarchical nets: a structured petri net approach to concurrency.* California Inst. of Tech. Comp.Sci.Dept.*No. 5044:TR:82.*1982. 017670 Johannsen, D.L.* Silicon compilation.* California Inst. of Tech. Comp.Sci.Dept.*No. 4530:TR:81, Ph.D. Thesis. Johannsen, D.L.*1981. 017671 Kingsley, C.* Earl: an integrated circuit design language.* California Inst. of Tech. Comp.Sci.Dept.*No. 4710:TM:82.* 1982. 017672 Lang, C.R. Jr.*The extension of object oriented languages to a homogeneous, concurrent architecture.* California Inst. of Tech. Comp.Sci.Dept.*No. 5014:TR:82, Ph.D. Thesis. Lang, C.R. Jr.*1982. 017673 Ng, C.H.* FIFO buffering transceiver: a communication chip set for multiprocessor systems.* California Inst. of Tech. Comp.Sci.Dept.*No. 5055:TR:82.*1982. 017674 Trimberger, S. Kingsley, C.* Chip assembly tools.* California Inst. of Tech. Comp.Sci.Dept.*No. 5055:TM:82.* 1982. 017675 Trimberger, S.*A comparison of MOS PLAs.* California Inst. of Tech. Comp.Sci.Dept.*No. 5059:TM:82.*1982. 017676 Whelan, D.S.*A rectangular area filling display system architecture.* California Inst. of Tech. Comp.Sci.Dept.* No. 4716:TM:82.*1982. 017677 Herman, M. Kanade, T. Kuroe, S.* Incremental acquisition of a three-dimensional scene model from images.* Carnegie Mellon U. Comp.Sci.Dept.*CMU-CS-82-139.*1982. 017678 Kaiser, G.E. Kant, E.* Incremental expression parsing for syntax directed editors.* Carnegie Mellon U. Comp.Sci.Dept.*CMU-CS-82-141.*1982. 017679 Newell, A.*Intellectual issues in the history of artificial intelligence.* Carnegie Mellon U. Comp.Sci.Dept.* CMU-CS-82-142.*1982. 017680 Rudnicky, A.I. Waibel, A.H. Krishnan, N.*Adding a zero crossing count to spectral information in template based speech recognition.* Carnegie Mellon U. Comp.Sci.Dept.* CMU-CS-82-140.*1982. 017681 Schwans, K.* Tailoring software for multiple processor systems.* Carnegie Mellon U. Comp.Sci.Dept.* CMU-CS-82-137, Ph.D. Thesis. Schwans, K.*1982. 017682 Wulf, Wm.A. Nori, K.V.* Delayed binding in PQCC generated compilers.* Carnegie Mellon U. Comp.Sci.Dept.* CMU-CS-82-138.*1982. 017683 Baker, B.S. Bhatt, S.N. Leighton, F.T.*An approximation algorithm for Manhattan routing.* M.I.T. Lab. for Comp.Sci.*TM-238.*1983. 017684 Bawden, A. Burke, G.S. Hoffman, C.W.* Maclisp extensions.* M.I.T. Lab. for Comp.Sci.*TM-203.*1981. 017685 Dolev, D. Leighton, F.T. Trickey, H.* Planar embedding of planar graphs.* M.I.T. Lab. for Comp.Sci.*TM-237.*1983. 017686 Konopelski, L.J.*Implementing internet remote login on a personal computer.* M.I.T. Lab. for Comp.Sci.*TM-233.* 1982. 017687 Leighton, F.T. Leiserson, C.E.* Wafer scale integration of systolic arrays.* M.I.T. Lab. for Comp.Sci.*TM-236.* 1983. 017688 Mitchell, J.C.*The implication problem for functional and inclusion dependencies.* M.I.T. Lab. for Comp.Sci.* TM-235.*1983. 017689 Rivest, R.L. Sherman, A.T.* Randomized encryption techniques.* M.I.T. Lab. for Comp.Sci.*TM-234.*1983. 017690 Sutherland, J. Sirbu, M.*Evaluation of an office analysis methodology.* M.I.T. Lab. for Comp.Sci.*TM-239.*1983. 017691 Yeh, A* PLY: a system of plausibility inference with a probabilistic basis.* M.I.T. Lab. for Comp.Sci.*TM-232.* 1982. 020287 Bui, T.N.*On bisecting random graphs.* M.I.T. Lab. for Comp.Sci.*TR-287.*1983. 020284 Cosmadakis, S.S.*Translating updates of relational database views.* M.I.T. Lab. for Comp.Sci.*TR-284.*1983. 020282 Fischer, M.J. Lynch, N.A. Paterson, M.S.*Impossibility of distributed consensus with one faulty process.* M.I.T. Lab. for Comp.Sci.*TR-282.*1982. 020280 Gao, G.R.*An implementation scheme for array operations in static data flow computers.* M.I.T. Lab. for Comp.Sci.* TR-280.*1982. 020286 Goree, J.A. Jr.* Internal consistency of a distributed transaction system with orphan detection.* M.I.T. Lab. for Comp.Sci.*TR-286.*1983. 020288 Landau, S.E.*On computing Galois groups and its application to solvability by radicals.* M.I.T. Lab. for Comp.Sci.* TR-288, Ph.D. Thesis. Landau, S.E.*1983. 020285 Lynch, N.A.* Concurrency control for resilient nested transactions.* M.I.T. Lab. for Comp.Sci.*TR-285.*1983. 020281 Lynch, N.A.* Multilivel atomicity - a new correctness criterion for database concurrency control.* M.I.T. Lab. for Comp.Sci.*TR-281.*1982. 020283 Sherman, H.B.*A comparative study of computer-aided clinical diagnosis of birth defects.* M.I.T. Lab. for Comp.Sci.*TR-283.*1981. 017692 Bergstra, J.A. Klop, J.W.* Process algebra for communication and mutual exclusion.* Mathematisch Centrum.*IW 218/83.*1983. 017693 Harmelen, F.A.H. van*On the implementation of an editor for the B programming language.* Mathematisch Centrum.*IW 220/83.*1983. 017694 Krijnen, T. Meertens, L.G.L.T.*Making B trees work for B.* Mathematisch Centrum.*IW 219/83.*1983. 017695 Rosenthal, D.S.H.*The GKS input facilities and how to use them.* Mathematisch Centrum.*IW 217/82.*1982. 017696 Savitch, W.J. Vitanyi, P.M.B.*On the power of real time two-way multihead finite automata with jumps.* Mathematisch Centrum.*IW 215/82.*1982. 017697 Vitanyi, P.M.B.*An optimal simulation of counter machines.* Mathematisch Centrum.*IW 216/82.*1982. 017698 Houwen, P.J. van der*Algebraically equivalent linear multistep solution of Volterra integral equations and certain systems of odes.* Mathematisch Centrum.*NW 144/82.*1982. 017699 Lune, J. van de Te Riele, H.J.J.*On the zeros on the Riemann Zeta function in the critical strip, III.* Mathematisch Centrum.*NW 146/83.*1983. 017700 Sommeijer, B.P. Houwen, P.J. van der*Software with low storage requirements for two-dimensional nonlinear parabolic differential equations.* Mathematisch Centrum.* NW 145/83.*1983. 017701 Symm, G.T. Wichmann, B.A. Kok, J. Winter, D.T.*Guidelines for the design of large modular scientific libraries in ADA.* Mathematisch Centrum.*NW 143/82.*1982. 017702 Zeeuw, P.M. de Asselt, E.J. van*The convergence rate of multi level algorithms applied to the convection diffusion equation.* Mathematisch Centrum.*NW 142/82.* 1982. 017703 Imielinski, T. Lipski, W. Jr.* Incomplete information in relational data base.* Polish Academy of Sciences. Inst. of Comp.Sci.*ICS PAS Rpt. No. 475.*1982. 017704 Jurkiewicz, E.*The problem of routing in store and forward packet switching communication networks.* Polish Academy of Sciences. Inst. of Comp.Sci.*ICS PAS Rpt. No. 477.* 1982. 017705 Oriowska, E.*Languages of approximate information.* Polish Academy of Sciences. Inst. of Comp.Sci.*ICS PAS Rpt. No. 479.*1982. 017706 Oriowska, E.*Representation of temporal information.* Polish Academy of Sciences. Inst. of Comp.Sci.*ICS PAS Rpt. No. 484.*1982. 017707 Pawlak, Z.* Rough sets: algebraic and topological approach.* Polish Academy of Sciences. Inst. of Comp.Sci.*ICS PAS Rpt. No. 482.*1982. 017708 Stoklosa, J.* Linear automata, k-machines, difference equations: a systematic approach.* Polish Academy of Sciences. Inst. of Comp.Sci.*ICS PAS Rpt. No. 486.*1982. 017709 Tarlecki, A.*Notes on the implementability of formal languages by concurrent systems.* Polish Academy of Sciences. Inst. of Comp.Sci.*ICS PAS Rpt. No. 481.*1982. 017710 Wysocki, W.*Generalized angles and their measures.* Polish Academy of Sciences. Inst. of Comp.Sci.*ICS PAS Rpt. No. 485.*1982. 017711 Zabludowski, A.*A recursive method for reliability measures evaluation.* Polish Academy of Sciences. Inst. of Comp.Sci.*ICS PAS Rpt. No. 483.*1982. 017712 Zaionc, M.*Automated theorem proving in modal logic.* Polish Academy of Sciences. Inst. of Comp.Sci.*ICS PAS Rpt. No. 478.*1982. 024960 Zabala-Salelles, I.A.*Interacting with graphic objects.* Stanford U. Comp.Sci.Dept.*STAN-CS-82-960, Ph.D. Thesis. Zabala-Salelles, I.A.*1982. 139p. 024962 Berg, K.A.* Bibliography of Stanford Computer Science reports, 1963-1983.* Stanford U. Comp.Sci.Dept.* STAN-CS-83-962.*1983. 62p. 024946 Gilbert, E.J.* Algorithm partitioning tools for a high-performance multiprocessor.* Stanford U. Comp.Sci.Dept.*STAN-CS-83-946, Ph.D. Thesis. Gilbert, E.J.*1983. 123p. 024963 Halpern, J. Manna, Z. Moszkowski, B.*A hardware semantics based on temporal intervals.* Stanford U. Comp.Sci.Dept.* STAN-CS-83-963.*1983. 26p. 024959 Karplus, K.* CHISEL: an extension to the programming language C for VLSI layout.* Stanford U. Comp.Sci.Dept.* STAN-CS-83-959 (STAN-CS-82-959), Ph.D. Thesis. Karplus,K.* 1983. 132p. 024944 Korth, H.F. Kuper, G.M. Ullman, J.K.* System/U: a database system based on the universal relation assumption.* Stanford U. Comp.Sci.Dept.*STAN-CS-83-944 (STAN-CS-82-944).*1983. 17p. 024958 Lantz, K.A. Cheriton, D.R. Nowicki, W.I.* Third generation graphics for distributed systems.* Stanford U. Comp.Sci.Dept.*STAN-CS-83-958 (STAN-CS-82-958), Stanford U. SEL Comp. Systems Lab.*Tech.Rpt. 235.*1983. 36p. 024964 Manna, Z. Pnueli, A.*Proving precedence properties: the temporal way.* Stanford U. Comp.Sci.Dept.* STAN-CS-83-964.*1983. 38p. 024945 Zwaenepoel, W. Lantz, K.A.* Perseus: retrospective on a portable operating system.* Stanford U. Comp.Sci.Dept.* STAN-CS-83-945, Stanford U. Comp. Systems Lab.*Tech.Rpt. 206.*1983. 8p. 038217 Hassan, S.Z.* Signature testing of sequential machines.* Stanford U. SEL. Comp. Systems Lab. Center for Reliable Computing.*Rpt. 82-18.*1982. 7p. 038216 Khakbaz, J.*A testable PLA design with low overhead and high fault coverage.* Stanford U. SEL. Comp. Systems Lab. Center for Reliable Computing.*Rpt. 82-17.*1982. 36p. 038214 Lu, D.J.* Testing VHSIC devices.* Stanford U. SEL. Comp. Systems Lab. Center for Reliable Computing.*Rpt. 82-15.* 1982. 35p. 038218 Namjoo, M.* CERBERUS-16: an architecture for a general purpose watchdog processor.* Stanford U. SEL. Comp. Systems Lab. Center for Reliable Computing.*Rpt. 82-19.* 1982. 29p. 038215 Namjoo, M.* Concurrent testing using path signature analysis.* Stanford U. SEL. Comp. Systems Lab. Center for Reliable Computing.*Rpt. 82-16.*1982. 32p. 038219 Stanford U. SEL. Comp. Systems Lab. Center for Reliable Computing.* COMPCON Spring '83 preprints.* Stanford U. SEL. Comp. Systems Lab.*Tech. note 219; Stanford U. SEL. Comp. Systems Lab. Center for Reliable Computing.*Rpt. 82-20.*1982. 17p. Contents: Hassan, S.Z. Lu, D.J. McCluskey, E.J.* Parallel signature analyzers--detection capability and extensions; Khakbaz, J. McCluskey, E.J.* Self testing embedded code checkers; Wahner, K.D.*Design for testability in the Amdahl 580. 035231 Wedig, R.G.*Dynamic detection of concurrency in DEL instruction streams.* Stanford U. SEL. Comp. Systems Lab. Tech.Rpt. 231.*1982. 24p. 035238 Wedig, R.G.*Detection on concurrency in directly executed language instruction streams.* Stanford U. SEL. Comp. Systems Lab. Tech.Rpt. 238, Ph.D. Thesis. Wedig, R.G.* 1983. 179p. 035237 Wakefield, S.*Studies in execution architectures.* Stanford U. SEL. Comp. Systems Lab. Tech.Rpt. 237.*1983. 115p. 035234 Tobagi, F.A. Shur, D.H.*Simulation of busy tone multiple access modes in multihop packet radio networks.* Stanford U. SEL. Comp. Systems Lab. Tech.Rpt. 234.*1982. 42p. 035228 Hennessy, J. Jouppi, N. Baskett, F. Gross, T. Gill, J. Przybylski, S.* Hardware/ software tradeoffs for increased performance.* Stanford U. SEL. Comp. Systems Lab. Tech.Rpt. 228.*1983. 22p. 035233 Davis, T. Clark, J.* YALE user's guide: a SILT based VLSI layout editor.* Stanford U. SEL. Comp. Systems Lab. Tech.Rpt. 233.*1982. 40p. 035226 Davis, T. Clark, J.* SILT: a VLSI design language.* Stanford U. SEL. Comp. Systems Lab. Tech.Rpt. 226.*1982. 38p. 035201 Baskett, F. Clark, J. Hennessy, J. Owicki, S. Reid, B.* Research in VLSI systems design and architecture.* Stanford U. SEL. Comp. Systems Lab. Tech.Rpt. 201.*1981. 35p. 035232 Alpert, D.*Studies in microprocessor design.* Stanford U. SEL. Comp. Systems Lab. Tech.Rpt. 232.*1982. 31p. 017713 Barone, P.*On a predictive test for stability of multivariate autoregressive moving average models.* Montreal U. Dept. d'Info et de Recherche Operationnelle.* Publ. 457.*1983. 017714 Braga, L.P.V.* Mapping techniques using universal kriging.* Montreal U. Dept. d'Info et de Recherche Operationnelle.* Publ. 453.*1982. 017715 Campello, R.E. Maculan, N.*A lower bound to the set partitioning problem.* Montreal U. Dept. d'Info et de Recherche Operationnelle.*Publ. 468.*1983. 017716 Chapleau, S. Lapalme, G.* ATHENA: a program for playing championship level scrabble.* Montreal U. Dept. d'Info et de Recherche Operationnelle.*Publ. 464.*1983. 017717 Chapleau, S. Lapalme, G.*ATHENA: un programme joueur de scrabble duplat.* Montreal U. Dept. d'Info et de Recherche Operationnelle.*Publ. 443.*1983. (revised version). 017718 Magnenat-Thalmann, N. Thalmann, D.* CINEMIRA: a 3D computer animation language based on actor and camera data types.* Montreal U. Dept. d'Info et de Recherche Operationnelle.* Publ. 473.*1983. 017719 Magnenat-Thalmann, N. Chourot, N. Thalmann, D.* Color gradation, shading and texture using a limited terminal.* Montreal U. Dept. d'Info et de Recherche Operationnelle.* Publ. 467.*1983. 017720 Sarikaya, B. Bochemann, G.V.* Synchronization and specification issues in protocol testing.* Montreal U. Dept. d'Info et de Recherche Operationnelle.*Publ. 463.* 1982. 017721 Stewart, N.*Moving a robot between general convex objects.* Montreal U. Dept. d'Info et de Recherche Operationnelle.* Publ. 472.*1983. 017722 Mann, W.C. Matthiessen, C.M.I.M.* Nigel: a systemic grammar for text generation.* Southern Cal. U. Info.Sci.Inst.* ISI/RR-83-105.*1983. 017723 Mockapetris, P.V.* Communication environments for local networks.* Southern Cal. U. Info.Sci.Inst.* ISI/RR-82-103, Ph.D. Thesis. Mockapetris, P.V. (University of California, Irvine).*1982. 099034 Southern California U. Info.Sci.Inst.*1982 annual technical report: July 1981 - June 1982.* Southern Cal. U. Info.Sci.Inst.*ISI/SR-83-23.*1983. 017724 Buckley, G.N. Silberschatz, A.*A complete characterization of a multiversion database model with effective schedulers.* Texas U. Comp.Sci.Dept.*TR-217.*1983. 017725 Cline, A.K. Renka, R.J.*A storage-efficient method for construction of a Thiessen triangulation.* Texas U. Comp.Sci.Dept.*TR-213.*n.d. 017726 Gouda, M.G. Yu, Y.T.* Protocol validation by maximal progress state exploration.* Texas U. Comp.Sci.Dept.* TR-211.*1982. 017727 Gouda, M.G. Yu, Y.T.*Synthesis of communicating machines with guaranteed progress.* Texas U. Comp.Sci.Dept.* TR-179.*1981. 017728 Krishnamurthy, R. Dayal, U.*On the correct scheduling of transaction systems for highly parallel data base machines.* Texas U. Comp.Sci.Dept.*TR-170.*1981. 017729 Kunii, H.* Graph data language: a high level access path oriented language.* Texas U. Comp.Sci.Dept.*TR-216, Ph.D. Thesis. Kunii, H.*1983. 017730 Novak, G.S. Jr.* GIRL and GLISP: an efficient representation language.* Texas U. Comp.Sci.Dept.*TR-172.* 1981. 017731 Novak, G.S. Jr. Araya, A.A.* Physics problem solving using multiple views.* Texas U. Comp.Sci.Dept.*TR-173.*1981. 017732 Palem, K. Fussell, D.S. Welch, A.J.*High-level optimization in a silicon compiler.* Texas U. Comp.Sci.Dept.*TR-215.* 1982. 017733 Shankar, A.U. Lam, S.S.*An HDLC protocol specification and its verification using image protocols.* Texas U. Comp.Sci.Dept.*TR-212.*1982. 017734 Silberschatz, A. Buckley, G.N.*A family of multi version protocols with no rollbacks.* Texas U. Comp.Sci.Dept.* TR-218.*1983. 017735 Yu, Y.-T. Gouda, M.G.* Unboundedness detection for a class of communicating finite state machines.* Texas U. Comp.Sci.Dept.*TR-181.*1983. 017736 Baer, J.L.*Whither a taxonomy of computer systems.* Washington U. Comp.Sci.Dept.*Tech.Rpt. 82-10-01.*1982. 017737 Borning, A.H. Ingalls, D.H.H.* Multiple inheritance in smalltalk-80.* Washington U. Comp.Sci.Dept.*Tech.Rpt. 82-06-02.*1982. 017738 Garner, R.L.*Analysis of queueing networks using decomposition.* Washington U. Comp.Sci.Dept.*Tech.Rpt. 82-05-01, Ph.D. Thesis. Garner, R.L.*1982. 017739 Garner, R.L. Zahorjan, J.*Analysis of queueing networks using decomposition.* Washington U. Comp.Sci.Dept.* Tech.Rpt. 82-05-04.*1982. 017740 Greenberg, A.G.*On the time complexity of broadcast communication schemes.* Washington U. Comp.Sci.Dept.* Tech.Rpt. 82-04-02.*1982. 017741 Huddleston, C.S.* Robust balancing in B trees.* Washington U. Comp.Sci.Dept.*Tech.Rpt. 82-08-01, Ph.D. Thesis. Huddleston, C.S.*1981. 017742 Jacobson, P.A. Lazowska, E.D.*A reduction technique for evaluating queueing networks with serialization delays.* Washington U. Comp.Sci.Dept.*Tech.Rpt. 82-11-02.*1982. 017743 Jacobson, D.M.* Transactions on objects of arbitrary type.* Washington U. Comp.Sci.Dept.*Tech.Rpt. 82-05-02.*1982. 017744 Klee, V. Ladner, R. Manber, R.*Signsolvability revisited.* Washington U. Comp.Sci.Dept.*Tech.Rpt. 82-04-04.*1982. 017745 Rao, R.*A kernel for distributed and shared memory communication.* Washington U. Comp.Sci.Dept.*Tech.Rpt. 82-06-01, Ph.D. Thesis. Rao, R.*1982. 017746 Ritchie, R.W.* Northwest VLSI consortium: Semi-annual technical report no. 1, 1 November 1982. Contract number: MDA903-82-C-0424. Sponsored by Defense Advance Research Projects Agency (DOD), ARPA order no. 4563. Principal investigator: R.W. Ritchie.* Washington Comp.Sci.Dept.* Tech.Rpt. 82-11-01.*1982. 017747 Tanimoto, S.L.* Sorting, histogramming, and other statistical operations on a pyramid machine.* Washington U. Comp.Sci.Dept.*Tech.Rpt. 82-08-02.*1982. 017748 Zahorjan, J.*The distribution of network states during sojourn times in product form queueing networks.* Washington U. Comp.Sci.Dept.*Tech.Rpt. 82-05-03.*1982. VOL. 5, NO. 8 07/25/83 017749 Waibel, A.*Towards very large vocabulary word recognition.* Carnegie Mellon U. Comp.Sci.Dept.*CMU-CS-82-144.*1982. 017750 Kant, E. Newell, A.* Problem solving techniques for the design of algorithms.* Carnegie Mellon U. Comp.Sci.Dept.* CMU-CS-82-145.*1982. 017751 Eppinger, J.L.*An empirical study of insertion and deletion in binary search trees.* Carnegie Mellon U. Comp.Sci.Dept.*CMU-CS-82-146.*1982. 017752 Gupta, A. Hon, R.W.*Two papers on circuit extraction.* Carnegie Mellon U. Comp.Sci.Dept.*CMU-CS-82-147.*1982. Contents: Gupta, A.* ACE: a circuit extractor; Gupta, A. Hon, R.W.* HEXT: a hierarchical circuit extractor. 017753 Doyle, J.*The foundations of psychology: a logico-computational inquiry into the concept of mind.* Carnegie Mellon U. Comp.Sci.Dept.*CMU-CS-82-149.*1982. 017754 Pervin, E. Webb, J.A.* Quaternions in computer vision and robotics.* Carnegie Mellon U. Comp.Sci.Dept.* CMU-CS-82-150.*1982. 017755 Durham, I. Lamb, D.A. Saxe, J.B.* Spelling correction in user interfaces.* Carnegie Mellon U. Comp.Sci.Dept.* CMU-CS-82-151.*1982. 017756 Vegdahl, S.R.* Local code generation and compaction in optimizing microcode compilers.* Carnegie Mellon U. Comp.Sci.Dept.*CMU-CS-82-153, Ph.D. Thesis. Vegdahl, S.R.* 1982. 017757 Snodgrass, R.* Monitoring distributed systems: a relational approach.* Carnegie Mellon U. Comp.Sci.Dept.* CMU-CS-82-154, Ph.D. Thesis. Snodgrass, R.*1982. 017758 Rosenberg, A.L.*The diogenes approach to testable fault tolerant networks of processors.* Duke U. Comp.Sci.Dept.* CS-1982-06.1.*1982. 017759 Freeman, R.W.*Automated design specification system.* Duke U. Comp.Sci.Dept.*CS-1982-10.*1982. 017760 Ballard, B.W.*A "domain class" approach to transportable natural language processing.* Duke U. Comp.Sci.Dept.* CS-1982-11.*1982. 017761 Leuze, M.R.* Memory access patterns in vector machines with applications to problems in linear algebra.* Duke U. Comp.Sci.Dept.*CS-1982-12, Ph.D. Thesis. Leuze, M.R.* 1982. 017762 Wagner, R.A.* DRAW - an assembly level language.* Duke U. Comp.Sci.Dept.*CS-1982-13.*1982. 017763 Rosenberg, A.L.*On designing fault tolerant arrays of processors.* Duke U. Comp.Sci.Dept.*CS-1982-14.*1982. 017764 Wagner, R.A.*Towards a method of programming large SIMD arrays of computing elements.* Duke U. Comp.Sci.Dept.* CS-1982-15.*1982. 017765 Smith, C.U. Dallen, J.A.*Future directions for VLSI and software engineering.* Duke U. Comp.Sci.Dept.*CS-1982-16.* 1982. 017766 Ballard, B.W. Lusth, J.C.*An English-language processing system which 'learns' about new domains.* Duke U. Comp.Sci.Dept.*CS-1982-18.*1982. 017767 Wagner, R.A.*The Boolean Vector Machine (BVM).* Duke U. Comp.Sci.Dept.*CS-1982-19.*1982. 017768 Baccelli, F. Trivedi, K.S.*Analysis of M/G/2 - standby redundant system.* Duke U. Comp.Sci.Dept.*CS-1982-20.* 1982. 017769 Hong, J.W. Mehlhorn, K. Rosenberg, A.L.* Cost tradeoffs in graph embeddings, with applications.* Duke U. Comp.Sci.Dept.*CS-1982-21.*1982. 017770 Geist, R. Trivedi, K.* Ultra high reliability prediction for fault tolerant computer systems.* Duke U. Comp.Sci.Dept.*CS-1982-22.*1982. 017771 Loveland, D.W.*Finding critical sets.* Duke U. Comp.Sci.Dept.*CS-1982-23.*1982. 017772 Geist, R. Trivedi, K.S.*The integration of user perception in the heterogeneous M/M/2 queue.* Duke U. Comp.Sci.Dept.* CS-1982-24.*1982. 017773 Wagner, R.A.* Communication bandwidth in the Boolean vector machine.* Duke U. Comp.Sci.Dept.*CS-1982-26.*1982. 017774 Gould, J.D. Boies, S.J.* Human factors challenges in creating a principal support office system--the speech filing system approach.* IBM Watson Res. Center.*RC 9768.* 1982. 017775 Gould, J.D. Boies, S.J.* Speech filing--an office system for principals.* IBM Watson Res. Center.*RC 9769.*1982. 017776 Miranker, W.L. Winkler, A.*Spacetime representations of systolic computational structures.* IBM Watson Res. Center.*RC 9775.*1982. 017777 Kaucher, E. Miranker, W.L.* Numerics with guaranteed accuracy for function space problems.* IBM Watson Res. Center.*RC 9789.*1983. 017778 Rader, K. Ravn, A.P. Yue, P.C.*A reliable page store.* IBM Watson Res. Center.*RC 9798.*1983. 017779 Pfister, G.F.* Parallel processing, special purpose hardware, and design automation applications.* IBM Watson Res. Center.*9809.*1983. 017780 Tsai, R.Y.* 3-D inference from the motion parallax of a conic arc and a point in two perspective views.* IBM Watson Res. Center.*RC 9818.*1983. 017781 Tsai, R.Y.*Estimating 3-D motion parameters and object surface structures from the image motion of conic arcs.* IBM Watson Res. Center.*RC 9819.*1983. 017782 Ditlow, G. Donath, W. Ruehli, A.* Logic equations for Mosfet circuits.* IBM Watson Res. Center.*RC 9821.*1983. 017783 Taylor, R.H.*An integrated robot system architecture.* IBM Watson Res. Center.*RC 9824.*1983. 017784 Gopal, I.S. Stern, T.E.* Optimal call blocking policies in an integrated services environment.* IBM Watson Res. Center.*RC 9825.*1983. 017785 Kevorkian, A.K. Gustavson, F.G. Hachtel, G.D.*A new theory on permuting matrices to block triangular form.* IBM Watson Res. Center.*RC 9832.*1983. 017786 Lucassen, J.M.*Discovering phonemic base forms automatically: an information theoretic approach.* IBM Watson Res. Center.*RC 9833.*1983. 017787 Krzesinski, A.*The normalised convolution algorithm.* IBM Watson Res. Center.*RC 9834.*1983. 017788 Moussouris, J. Bruss, A.* TDL: a tabular design language for structured logic (version 1.0).* IBM Watson Res. Center.*RC 9835.*1983. 017789 Mueckstein, E.-M.M.* Parsing for collecting syntactic statistics.* IBM Watson Res. Center.*RC 9836.*1983. 017790 Mueckstein, E.M.M.* Q-Trans: query translation into English.* IBM Watson Res. Center.*RC 9841.*1983. 017791 McBride, D.J.* Directed graphs for VLSI high-level synthesis.* IBM Watson Res. Center.*RC 9842.*1983. 017792 Rivlin, T.J. Shaffer, D.B.* Optimal estimation of the derivative of bounded analytic functions.* IBM Watson Res. Center.*RC 9843.*1983. 017793 Zug, P. Hachtel, G. Scott, T.R.*A general purpose design optimization system (version 2.1). User's guide - volume I: nominal design and modeling.* IBM Watson Res. Center.* RC 9847.*1983. 017794 Gould, F.D. Grischkowsky, N.*Doing the same work with hardcopy and with cathode ray tube ( CRT) computer terminals, by John D. Gould and Nancy Grischkowsky. With the technical assistance of Lizette Alfaro and Jennifer Stolarz. 017795 Beetem, J. Nigam, A.* VLSI design using sheets and types.* IBM Watson Res. Center.*RC 9854.*1983. 017796 Berstein, M. Pelavin, R.* Hierarchical wire routing.* IBM Watson Res. Center.*RC 9861.*1983. 017797 Kozen, D.*A probabilistic PDL.* IBM Watson Res. Center.*RC 9874.*1983. 017798 Fagin, R. Ullman, J.D. Verdi, M.Y.*On the semantics of updates in databases: preliminary report.* IBM Watson Res. Center.*RJ 3700.*1983. 017799 Lindsay, B.G. Haas, L.M. Mohan, C. Wilms, P.F. Yost, R.A.* Computation and communication in R*: a distributed database manager.* IBM Watson Res. Center.*RJ 3740.*1983. 017800 Masunaga, Y.*A relational database view update translation mechanism.* IBM Watson Res. Center.*RJ 3742.*1983. 017801 Nakata, I. Sassa, M.* Programming with streams.* IBM Watson Res. Center.*RJ 3751.*1983. 017802 Yost, R.A. Lindsay, B.G.*A distributed terminal management facility.* IBM Watson Res. Center.*RJ 3752.*1983. 017803 Cristian, F.* Correct and robust programs.* IBM Watson Res. Center.*RJ 3753.*1983. 017804 Cristian, F.*A rigorous approach to fault tolerant system development.* IBM Watson Res. Center.*RJ 3754.*1983. 017805 Aghili, H. Astrahan, M. Finkelstein, S. Kim, W. McPherson, J. Schkolnick, M. Strong, R.*A prototype for a highly available database system.* IBM Watson Res. Center.*RJ 3755.*1983. 017806 Goresky, M. Siegel, P.*Linking pairings on singular spaces.* IBM Watson Res. Center.*RJ 3757.*1983. 017807 Gazis, L.*Calling PASCAL from APL.* IBM Watson Res. Center.* RJ 3758.*1983. 017808 McPherson, J.A. Kime, C.R.* Diagnosis theory for reconfigurable and distributed systems.* IBM Watson Res. Center.*RJ 3760.*1983. 017809 Haas, L.M. Mohan, C.*A distributed deadlock detection algorithm for a resource-based system.* IBM Watson Res. Center.*RJ 3765.*1983. 017810 Rissanen, J.* Probability estimation for symbols - observed or not.* IBM Watson Res. Center.*RJ 3768.*1983. 017811 Walker, A.* PROLOG/EX1: an inference engine which explains both yes and no answers.* IBM Watson Res. Center.*RJ 3771.*1983. 017812 Meier, A. Lorie, R.*Implicit hierarchical joins for complex objects.* IBM Watson Res. Center.*RJ 3775.*1983. 017813 Paul, W. Vishkin, U. Wagener, H.* Parallel computation on 2-3 trees.* IBM Watson Res. Center.*RJ 3786.*1983. 017814 Lohman, G.M. Stoltzfus, J.C. Benson, A.N. Martin, M.D. Cardenas, A.F.* Remotely sensed geophysical databases: experience and implications for generalized DBMS.* IBM Watson Res. Center.*RJ 3794.*1983. 017815 Fagin, R.* Acyclic database schemes (of various degrees): a painless introduction.* IBM Watson Res. Center.*RJ 3800.* 1983. 017816 Reisner, P.*Analytic tools for human factors of software.* IBM Watson Res. Center.*RJ 3808.*1983. 017817 Borodin, A. Dolev, D. Fich, F.E. Paul, W.* Bounds for width two branching programs.* IBM Watson Res. Center.*RJ 3812.* 1983. 017818 Hauser, R.F.*Some experiments with stochastic edge detection.* IBM Watson Res. Center.*RZ 1210.*1983. 017819 Havlicsek, B.L. Meyer, G.G.L.*A new system level approach to diagnosability.* Johns Hopkins U. E.E. & Comp.Sci.Dept.*Tech.Rpt. 82/06.*1982. 017820 Meyer, G.L.*Synthesis of optimization algorithms by concatenating deterministic and autonomous algorithm components.* Johns Hopkins U. E.E. & Comp.Sci.Dept.* Tech.Rpt. 82/07.*1982. 017821 Meyer, G.G.L. Weinert, H.L.* Parallel algorithms and computational structures for linear estimation problems.* Johns Hopkins U. E.E. & Comp.Sci.Dept.*Tech.Rpt. 82/08.* 1982. 017822 O'Rourke, J.*The signature of a curve and its applications to pattern recognition (preliminary version).* Johns Hopkins U. E.E. & Comp.Sci.Dept.*Tech.Rpt. 82/09.*1982. 017823 Kouta, M.M. O'Rourke, J.*Fast algorithms for polygon decomposition.* Johns Hopkins U. E.E. & Comp.Sci.Dept.* Tech.Rpt. 82/10.*1982. 017824 O'Rourke, J.* Galleries need fewer mobile guards: a variation on Chvatal's theorem.* Johns Hopkins U. E.E. & Comp.Sci.Dept.*Tech.Rpt. 82/11.*1982. 017825 Meyer, G.G.L.*One-step diagnosis algorithms for the BGM system level fault model.* Johns Hopkins U. E.E. & Comp.Sci.Dept.*Tech.Rpt. 82/14.*1982. 017826 O'Rourke, J.*An alternate proof of the rectilinear art gallery theorem.* Johns Hopkins U. E.E. & Comp.Sci.Dept.* Tech.Rpt. 82/15.*1982. 017827 Harbitter, A. Tripathi, S.K.*An analysis of two flow control techniques.* Maryland U. Comp.Sci. Center.* TR-1141.*1982. 017828 Kumar, V. Kanal, L.N.* Branch and bound formulations for sequential and parallel And/Or tree search and their applications to pattern analysis and game playing.* Maryland U. Comp.Sci. Center.*TR-1144.*1982. 017829 Grant, J.* Adequate database transformation.* Maryland U. Comp.Sci. Center.*TR-1145.*1982. 017830 Abrams, M. Chu, Y.*A comparison of five concurrent programming languages.* Maryland U. Comp.Sci. Center.* TR-1147.*1982. 017831 Chu, Y. Itano, K. Fukunaga, Y. Abrams, M.* Interactive direct execution programming and testing.* Maryland U. Comp.Sci. Center.*TR-1149.*1982, (revised). 017832 Shneiderman, B.*The future of interactive systems and the emergence of direct manipulation.* Maryland U. Comp.Sci. Center.*TR-1156.*1982. 017833 Rosenfeld, A.*Computer vision.* Maryland U. Comp.Sci. Center.*TR-1157.*1982. 017834 Israel, B.*Customizing a personal computing environment through object oriented programming.* Maryland U. Comp.Sci. Center.*TR-1158.*1982. 017835 Stewart, G.W.*Computing the CS decomposition of a partitioned orthonormal matrix.* Maryland U. Comp.Sci. Center.*TR-1159.*1982. 017836 Shneier, M.* Hierarchical sensory processes for 3-D robot vision.* Maryland U. Comp.Sci. Center.*TR-1165.*1982. 017837 Allen, E.M.*Acquiring linguistic knowledge for word experts.* Maryland U. Comp.Sci. Center.*TR-1166. 017838 Yeh, R.T. Schneck, P.B. Freitas, R.A. Jr. Carlson, P.A.* Computer science: key to a space program renaissance. Final report of the 1981 NASA/ASEE Summer Study on the use of Computer Science and Technology in NASA. Volume I: Institutional needs, status, plans and recommendations. Volume II: Appendices.* Maryland U. Comp.Sci. Center.* TR-1168.*1982. 2 volumes. 017839 Nau, D. Kumar, V. Kanal, L.*General branch and bound and its relation to A* and AO*.* Maryland U. Comp.Sci. Center.*TR-1170.*1982. 017840 Thareja, A.K.* Buffer allocation policies for message switching networks.* Maryland U. Comp.Sci. Center.* TR-1173, Ph.D. Thesis. Thareja, A.K.*1982. 017841 Wood, R.J.* Franz flavors: an implementation of abstract data types in an applicative language.* Maryland U. Comp.Sci. Center.*TR-1174.*1982. 017842 Weiser, M. Israel, B. Stanfill, C. Trigg, R. Wood, R.* Working papers in knowledge representation and acquisition.* Maryland U. Comp.Sci. Center.*TR-1175.* 1982. Contents: Israel, B. Weiser, M.*Towards a perceptual system for monitoring computer behavior; Stanfill, C.* Geometry to causality: a hierarchy of subdomains for machine world; Trigg, R.*Acquiring knowledge for an electronic textbook; Wood, R.J.*A model for interactive program synthesis. 017843 Grant, J. Jacobs, B.E.*On the simulation of view updates recreational databases.* Maryland U. Comp.Sci. Center.* TR-1182.*1982. 017844 Chu, Y. Abrams, M.* Columbia: a concurrent high level computer system organization.* Maryland U. Comp.Sci. Center.*TR-1183.*1982. 017845 Minker, J.*On deductive relational databases.* Maryland U. Comp.Sci. Center.*TR-1184.*1982. 017846 Nau, D.S.* Pathology on game trees revisited, and an alternative to minimaxing.* Maryland U. Comp.Sci. Center.*TR-1187.*1982. 017847 Rosenfeld, A.*Trends and perspectives in computer vision.* Maryland U. Comp.Sci. Center.*TR-1194.*1982. 017848 Chen, B.S.*Event based specification and verification of distribute systems.* Maryland U. Comp.Sci. Center.* TR-1196, Ph.D. Thesis. Chen, B.-S.*1982. 017849 Krishna, C.M. Shin, K.G.* Performance measures for multiprocessor controllers.* Michigan U. Computing Res.Lab.*CRL-TR-01-82.*1982. 017850 Shin, K.G. Lee, Y.-H.*Analysis of the impact of error detection on computer performance.* Michigan U. Computing Res.Lab.*CRL-TR-02-82.*1982. 017851 Makrucki, B.A. Mudge, T.N.*A stochastic model of parallel and concurrent program execution on multiprocessors.* Michigan U. Computing Res.Lab.*CRL-TR-03-82.*1982. 017852 Rajlich, V.* Determinism in parallel systems.* Michigan U. Computing Res.Lab.*CRL-TR-04-82.*1982. 017853 Chiang, W.P. Teorey, T.J.*A method for database record clustering.* Michigan U. Computing Res.Lab.* CRL-TR-05-82.*1982. 017854 Lee, Y.-G. Shin, K.G.*Design and evaluation of a fault tolerant multiprocessor using hardware recovery blocks.* Michigan U. Computing Res.Lab.*CRL-TR-06-82.*1982. 017855 Wu, L.T.*Models for evaluating the performability of degradable computing systems.* Michigan U. Computing Res.Lab.*CRL-TR-07-82, Ph.D. Thesis. Wu, L.T.*1982. 017856 McFarling, S. Turney, J. Mudge, T.* VLSI crossbar design version two.* Michigan U. Computing Res.Lab.* CRL-TR-08-82.*1982. 017857 Blass, A. Gurevich, Y.* Equivalence relations, invariants, and normal forms.* Michigan U. Computing Res.Lab.* CRL-TR-09-82.*1982. 017858 Blass, A. Gurevich, Y.*On the unique satisfiability problem.* Michigan U. Computing Res.Lab.*CRL-TR-01-83.* 1983. 017859 Liu, W.-T.*Techniques for estimation of the area of integrated digital circuits.* Michigan U. Computing Res.Lab.*CRL-TR-02-83, Ph.D. Thesis. Liu, W.-T.*1983. 017860 Golson, W.G. Rounds, W.C.*Connections between two theories of concurrency metric spaces and synchronization trees.* Michigan U. Computing Res.Lab.*CRL-TR-03-83.*1983. 017861 Chung, C.-W.*A query optimization in distributed database systems.* Michigan U. Computing Res.Lab.*CRL-TR-04-83.* 1983. 017862 Maletz, M.C.*On enhancing the idealized CPU-I/O and I/O-I/0 overlap models through the use of Markov processes.* Michigan U. Computing Res.Lab.*CRL-TR-07-83.*1983. 017863 Krishna, C.M. Shin, K.G.* Queueing analysis of a canonical model of real time multiprocessors.* Michigan U. Computing Res.Lab.*CRL-TR-08-83.*1983. 017864 Shin, K.G. Lee, Y.-H.*Analysis of backward error recovery for concurrent processes with recovery blocks.* Michigan U. Computing Res.Lab.*CRL-TR-09-83.*1983. 017865 Rutenbar, R.A. Mudge, T.N. Atkins, D.E.*A class of cellular architectures to support physical design automation.* Michigan U. Computing Res.Lab.*CRL-TR-10-83.*1983. 017866 Mudge, T.N. Rahman, T.A.*Efficiency of feature dependent algorithms for the parallel processing of images.* Michigan U. Computing Res.Lab.*CRL-TR-11-83.*1983. 017867 Maletz, M.C.*Computing system simulation using Markov processes.* Michigan U. Computing Res.Lab.*CRL-TR-12-83.* 1983. 017868 Rajlich, V.* Stepwise refinement revisited.* Michigan U. Computing Res.Lab.*CRL-TR-13-83.*1983. 017869 Delp, E.*The CRC plotting package.* Michigan U. Computing Res.Lab.*CRL-TR-14-83.*1983. 017870 Delp, E.* PDS users' manual: introduction.* Michigan U. Computing Res.Lab.*CRL-TR-15-83.*1983. 017871 Hadavi, K.*A definitional technique for specification and implementation of data types.* Michigan U. Computing Res.Lab.*CRL-TR-16-83.*1983. 017872 Qadah, G.Z.*A relational database machine analysis and design.* Michigan U. Computing Res.Lab.*CRL-TR-17-83.* 1983. 017873 Mudge, T.N. Buzzard, G.D. Verhaeghe, D.J. Hill, J. Winsor, D.C.* Object based computer architectures.* Michigan U. Computing Res.Lab.*CRL-TR-18-83.*1983. 017874 Arya, S.* Optimal instruction scheduling for a class of vector processors: an integer programming approach.* Michigan U. Computing Res.Lab.*CRL-TR-19-83, Ph.D. Thesis. Arya, S.*1983. 017875 Jenkins, J.M.* Symposium on computer applications to cardiology: introduction and automated electrocardiography and arrhythmia monitoring.* Michigan U. Computing Res.Lab.*CRL-TR-20-83.*1983. 017876 Gurevich, Y.* Algebras of feasible functions.* Michigan U. Computing Res.Lab.*CRL-TR-21-83.*1983. VOL. 5, NO. 9 08/10/83 017877 Constable, R.L.* Programs as proofs.* Cornell U. Comp.Sci.Dept.*Tech.Rpt. 82-532.*1982. 017878 Schneider, F.B.*Comparison of the fail stop processor and state machine approaches to fault tolerance.* Cornell U. Comp.Sci.Dept.*Tech.Rpt. 82-533.*1982. 017879 Demers, A. Donahue, J.*Making variables abstract: an equational theory for Russell.* Cornell U. Comp.Sci.Dept.* Tech.Rpt. 82-534.*1982. 017880 Coleman, T.F. More, J.J.*Estimation of sparse Hessian matrices and graph coloring problems.* Cornell U. Comp.Sci.Dept.*Tech.Rpt. 82-535.*1982. 017881 Conway, R. Worona, S.* COFE: a prototype memo and mail system for non-programmers.* Cornell U. Comp.Sci.Dept.* Tech.Rpt. 82-536.*1983. 017882 Dwork, C.*Bounds on oblivious, conservative matrix transposition networks.* Cornell U. Comp.Sci.Dept.* Tech.Rpt. 83-537.*1983. 017883 Dwork, C. Skeen, D.*The inherent cost of nonblocking commitment.* Cornell U. Comp.Sci.Dept.*Tech.Rpt. 82-538.* 1983. 017884 Salton, G. Fox, E.A. Buckley, C. Voorhees, E.* Boolean query formulation with relevance feedback.* Cornell U. Comp.Sci.Dept.*Tech.Rpt. 83-539.*1983. 017885 Murtagh, T.P.*A data abstraction language for concurrent programming.* Cornell U. Comp.Sci.Dept.*Tech.Rpt. 83-540, Ph.D. Thesis. Murtagh, T.P.*1983. 017886 Brent, R.P. Kung, H.T. Luk, F.T.*Some linear time algorithms for systolic arrays.* Cornell U. Comp.Sci.Dept.*Tech.Rpt. 83-541.*1983. 017887 Pritchard, P.*Some negative results concerning prime number generators.* Cornell U. Comp.Sci.Dept.*Tech.Rpt. 83-542.* 1983. 017888 Yu, C.T. Buckley, C. Lam, K. Salton, G.*A generalized term dependence model in information retrieval.* Cornell U. Comp.Sci.Dept.*Tech.Rpt. 83-543.*1983. 017889 Hartmanis, J. Sewelson, V. Immerman, N.* Sparse sets in NP-P: EXOTIME versus NEXPTIME.* Cornell U. Comp.Sci.Dept.*Tech.Rpt. 83-544.*1983. 017890 Aspvall, B. Gilbert, J.R.* Graph coloring using eigenvalue decomposition.* Cornell U. Comp.Sci.Dept.*Tech.Rpt. 83-845.*1983. 017891 Toueg, S. Babaoglu, O.*On the optimum checkpoint selection problem.* Cornell U. Comp.Sci.Dept.*Tech.Rpt. 83-546.* 1983. 017892 Wright, D.D. Skeen, D.* Merging partitioned databases.* Cornell U. Comp.Sci.Dept.*Tech.Rpt. 83-547.*1983. 017893 Hartmanis, J. Yesha, Y.* Computation times of NP sets of different densities.* Cornell U. Comp.Sci.Dept.* Tech.Rpt. 83-548.*1983. 017894 Constable, R.L.* Partial functions in constructive formal theories.* Cornell U. Comp.Sci.Dept.*Tech.Rpt. 83-549.* 1983. 017895 Guyot, A. Reis, R. Supriana, I.*FLOPE: un editeur graphique de plan de masse de circuits integres.* Grenoble. Universite Scientifique et Medicale. Laboratoire d'Informatique et de Mathematiques Appliquees de Grenoble.*R.R. No. 333.*1983. 017896 Sifakis, J.*A note on deadlocks in CA-systems.* Grenoble. Universite Scientifique et Medicale. Laboratoire d'Informatique et de Mathematiques Appliquees de Grenoble.*R.R. No. 334.*1982. 017897 Bert, D.* Refinements of generic specifications with algebraic tools.* Grenoble. Universite Scientifique et Medicale. Laboratoire d'Informatique et de Mathematiques Appliquees de Grenoble.*R.R. No. 335.*1982. 017898 Cosnard, M. Eberhard, A.*Calcul explicite des constantes de renormalisation pour des classes particulieres de fonctions unimodales.* Grenoble. Universite Scientifique et Medicale. Laboratoire d'Informatique et de Mathematiques Appliquees de Grenoble.*R.R. No. 337.*1982. 017899 Cosnard, M.*Etude de la classification topologiure des fonctions unimodales.* Grenoble. Universite Scientifique et Medicale. Laboratoire d'Informatique et de Mathematiques Appliquees de Grenoble.*R.R. No. 338.*1982. 017900 Sabbatel, G.B.*Nguyen, G.T.*Motivations et principes pour une machine base de donnees prolog.* Grenoble. Universite Scientifique et Medicale. Laboratoire d'Informatique et de Mathematiques Appliquees de Grenoble.*R.R. No. 339.* 1982. 017901 Foldes, S.*The tree structure of accounting control systems.* Grenoble. Universite Scientifique et Medicale. Laboratoire d'Informatique et de Mathematiques Appliquees de Grenoble.*R.R. No. 340.*1982. 017902 Robert, R. Witomski, P.*Sur une equation d'evolution integro-differentielle singuliere lineaire.* Grenoble. Universite Scientifique et Medicale. Laboratoire d'Informatique et de Mathematiques Appliquees de Grenoble.*R.R. No. 341.*1982. 017903 Blacher, R.*Influence sur la dependance des coefficient du developpement en serie de la densite de probabilite.* Grenoble. Universite Scientifique et Medicale. Laboratoire d'Informatique et de Mathematiques Appliquees de Grenoble.*R.R. No. 343.*1982. 017904 Robach, C.* CATA: a computer aided test analysis system; 1. System partition and modeling, 2.Description and software procedures.* Grenoble. Universite Scientifique et Medicale. Laboratoire d'Informatique et de Mathematiques Appliquees de Grenoble.*R.R. No. 344.*1983. 017905 Blacher, R.*Quelques proprietes des congruences lineaires considerees comme generateurs de nombres pseudo-aleatoires.* Grenoble. Universite Scientifique et Medicale. Laboratoire d'Informatique et de Mathematiques Appliquees de Grenoble.*R.R. No. 345.*1983. 017906 Anceau, F.*CAPRI: a design methodology and a silicon compiler for VLSI circuits specified by algorithms.* Grenoble. Universite Scientifique et Medicale. Laboratoire d'Informatique et de Mathematiques Appliquees de Grenoble.*R.R. No. 346.*1983. 017907 Decitre, P. Khider, A. Vandome, G.*Protocole de diffusion fiable pour reseaux locaux.* Grenoble. Universite Scientifique et Medicale. Laboratoire d'Informatique et de Mathematiques Appliquees de Grenoble.*R.R. No. 347.* 1983. 017908 Graf, S.*On Lanport's comparison between linear and branching time logic.* Grenoble. Universite Scientifique et Medicale. Laboratoire d'Informatique et de Mathematiques Appliquees de Grenoble.*R.R. No. 348.*1983. 017909 Adiba, M. Burnier, M. Delobel, C. Rialge, D.*Bases de donnees et nouvelles applications.* Grenoble. Universite Scientifique et Medicale. Laboratoire d'Informatique et de Mathematiques Appliquees de Grenoble.*R.R. No. 349.* 1983. 017910 Goles, E. Tchuente, M.* Dynamic behaviour of one-dimensional threshold automata.* Grenoble. Universite Scientifique et Medicale. Laboratoire d'Informatique et de Mathematiques Appliquees de Grenoble.*R.R. No. 350.* 1983. 017911 Baras, P.*Non-unicite des solutions d'une equation d'evolution non-lineaire.* Grenoble. Universite Scientifique et Medicale. Laboratoire d'Informatique et de Mathematiques Appliquees de Grenoble.*R.R. No. 351.* 1983. 017912 Reyss-Brion, J.F.*Architecture de circuits specialises de traitement du signal.* Grenoble. Universite Scientifique et Medicale. Laboratoire d'Informatique et de Mathematiques Appliquees de Grenoble.*R.R. No. 352.*1983. 017913 Nicolaidis, M. Courtois, B.*Design of self checking systems based on analytical fault hypotheses.* Grenoble. Universite Scientifique et Medicale. Laboratoire d'Informatique et de Mathematiques Appliquees de Grenoble.*R.R. No. 353.*1983. 017914 Borrione, D. Humbert, M. Le Faou, C.*Mecanismes de simulation mixte hierarchisee.* Grenoble. Universite Scientifique et Medicale. Laboratoire d'Informatique et de Mathematiques Appliquees de Grenoble.*R.R. No. 354.* 1983. 017915 Nachawati, H.A.*Classification et selection des parametres a l'aide de l'analyse de la variance a deux facteurs.* Grenoble. Universite Scientifique et Medicale. Laboratoire d'Informatique et de Mathematiques Appliquees de Grenoble.*R.R. No. 355.*1983. 017916 Marine, S. Anceau, F. Jahidi, K.*IRENE: un langage de description de circuits integres logiques.* Grenoble. Universite Scientifique et Medicale. Laboratoire d'Informatique et de Mathematiques Appliquees de Grenoble.*R.R. No. 356.*1983. 017917 Davenport, J.H.*VLSI et calcul formel.* Grenoble. Universite Scientifique et Medicale. Laboratoire d'Informatique et de Mathematiques Appliquees de Grenoble.*R.R. No. 357.*1983. 017918 Davenport, J.H. Robert, Y.*PGCD et VLSI.* Grenoble. Universite Scientifique et Medicale. Laboratoire d'Informatique et de Mathematiques Appliquees de Grenoble.*R.R. No. 358.*1983. 017919 Boulle, P.*Une nouvelle approche des problemes lies a la description de scenes tridimensionnelles.* Grenoble. Universite Scientifique et Medicale. Laboratoire d'Informatique et de Mathematiques Appliquees de Grenoble.*R.R. No. 359.*1983. 017920 Fargier, P.H. Fonlupt, J.*Affectation de trafic selon le principe de wardrop dans des reseaux avec capacites.* Grenoble. Universite Scientifique et Medicale. Laboratoire d'Informatique et de Mathematiques Appliquees de Grenoble.*R.R. No. 360.*1983. 017921 Marchal, P.*Test analytique de la partie operative du microprocesseur MC 68000.* Grenoble. Universite Scientifique et Medicale. Laboratoire d'Informatique et de Mathematiques Appliquees de Grenoble.*R.R. No. 361.* 1983. 017922 Madelaine, J.*Evaluation d'algorithmes de controle de concurrence.* INRIA. Rapport de Recherche 164.*1982. 017923 Merlet, J.-P.*Etude bidimensionnelle de l'insertion d'une cheville souple dans un ensemble rigide.* INRIA. Rapport de Recherche 166.*1982. 017925 Plateau, D.*Une structure compacte pour indexer un fichier ordonne et son evaluation.* INRIA. Rapport de Recherche 169.*1982. 017926 Hanatani, Y.*Graphtheoretical classification and generation of JD's by means of bases for MVD-structures.* INRIA. Rapport de Recherche 170.*1982. 017927 Plateau, D.*Compiling relational queries for a finite state automaton hardware filter.* INRIA. Rapport de Recherche 171.*1982. 017928 Le Coz, A. Le Goff, H. Ollivier, M.*Algorithme assurant l'insertion dynamique d'un processeur autour d'un reseau a diffusion et garantissant la coherence d'un systeme de numerotation des paquets global et reparti.* INRIA. Rapport de Recherche 173.*1982. 017929 Fernandez Cara, E.*A nonlinear diffusion problem arising in semiconductor process modelling with a singularity.* INRIA. Rapport de Recherche 174.*1982. 017930 Rolin, P.*Rapport sur la campagne de mesure de performance du prototype sirius-delta.* INRIA. Rapport de Recherche 175.*1982. 017931 Fernandez Cara, E.* Singular perturbations and finite elements for the numerical simulation of some problems in V.L.S.I.* INRIA. Rapport de Recherche 176.*1982. 017932 Laine, C. Reinhart, L.*Further numerical methods for the Falkner Skan equations: shooting and continuation techniques.* INRIA. Rapport de Recherche 177.*1983. 017933 Hanatani, Y.*Eliminating cycles in data base schemas.* INRIA. Rapport de Recherche 178.*1982. 017934 Lemarechal, C.*Basic theory in nondifferentiable optimization: a tutorial and algorithmic oriented approach.* INRIA. Rapport de Recherche 181.*1982. 017935 Samson, C.*Commande non lineaire robuste des robots manipulateurs.* INRIA. Rapport de Recherche 182.*1983. 017936 Vuillemin, J.*A very fast multiplication algorithm for VLSI implementation.* INRIA. Rapport de Recherche 183.*1983. 017937 Sermange, M. Temam, R.*Some mathematical questions related to the MHD equations.* INRIA. Rapport de Recherche 185.* 1983. 017938 Austry, D. Boudol, G.*Algebre de processus et synchronisation.* INRIA. Rapport de Recherche 187.*1983. 017939 Erhel, J.*Parallelisation d'un algorithme de gradient conjugue preconditionne.* INRIA. Rapport de Recherche 189.*1983. 017940 Nain, P.* Workload analysis of a two queue system by formulating a boundary value problem.* INRIA. Rapport de Recherche 190.*1983. 017941 Cohen, G. Dubois, D. Quadrat, J.-P. Viot, M.*Analyse du comportement periodique de systemes de production par la theorie des dioides.* INRIA. Rapport de Recherche 191.* 1983. 017942 Lucrece, L. Maurice, P. Vercoustre, A.-M.* MINERVE: manuel de reference.* INRIA. Rapports Techniques 017.*1982. 017943 Lozi, R.* Bifurcation and nonlinear eigenvalue problems: a tentative bibliography.* INRIA. Rapports Techniques 018.* 1982. 017944 Falzon, P.*Les communications verbales en situation de travail: analyse des restrictions du langage naturel.* INRIA. Rapports Techniques 019.*1982. 017945 Veloso, P.A.S. Maibaum, T.S.E.*Specifying abstract data types via series of rewriting systems.* Pontificia U., Rio de Janeiro. Info.Dept.*No. 07/82.*1982. 017946 Ruas, V.*On the solvability of asymmetric quasilinear finite element approximate problems in nonlinear incompressible elasticity.* Pontificia U., Rio de Janeiro. Info.Dept.*No. 08/82.*1982. 017947 Furtado, A.L.*A W-grammar approach to data bases.* Pontificia U., Rio de Janeiro. Info.Dept.*No. 09/82.* 1982. 017948 Ruas, V.* Quasilinear finite elements for the stokes problem in IR superscript 3.* Pontificia U., Rio de Janeiro. Info.Dept.*No. 10/82.*1982. 017949 Veloso, P.A.S.*Outlines of a mathematical theory of problems.* Pontificia U., Rio de Janeiro. Info.Dept.*No. 14/82.*1982. 017950 Veloso, P.A.S.* Problem solving via divide and conquer and abstract data types.* Pontificia U., Rio de Janeiro. Info.Dept.*No. 01/83.*1983. 017951 Veloso, P.A.S. Furtado, A.L.*On multi-step methods for stepwise construction of algebraic specifications for data base applications.* Pontificia U., Rio de Janeiro. Info.Dept.*No. 02/83.*1983. 017952 Veloso, P.A.S.*A methodology for the sound and complete specification of abstract data types.* Pontificia U., Rio de Janeiro. Info.Dept.*No. 03/83.*1983. 017953 Lucena, C.J. Martins, R.C.B. Veloso, P.A.S. Cowan, D.D.*The data transform propgramming method and file processing problems.* Pontificia U., Rio de Janeiro. Info.Dept.*No. 05/83.*1983. 017954 Ruas, V.*A convergent finite element method for solving dynamic problems with consistent diagonalized mass matrix.* Pontificia U., Rio de Janeiro. Info.Dept.*No. 06/83.*1983. 017955 Staa, A. von Rocha, A.R.C. da*Towards a model for evaluating specifications.* Pontificia U., Rio de Janeiro. Info.Dept.*No. 07/83.*1983. 017956 Veloso, P.A.S. Furtado, A.L.*On some view constructs for the specification and design of external schemas.* Pontificia U., Rio de Janeiro. Info.Dept.*No. 08/83.* 1983. 017957 Lindberg, B. Estimation of the parameters of a model with one nonlinear parameter.* Royal Inst. of Tech., Stockholm. Num.Anal. & Computing Sci.Dept.*TRITA-NA-8213.* 1982. 017958 Sjostrand-Eriksson, G.*Numerical evaluation of a concentration dependent diffusion coefficient.* Royal Inst. of Tech., Stockholm. Num.Anal. & Computing Sci.Dept.*TRITA-NA-8220.*1982. 017959 Eklundh, J.-O. Kjelldahl, L. Sundblad, Y.* Image analysis, computer graphics and text processing in USA. Report from a tour in April 1982.* Royal Inst. of Tech., Stockholm. Num.Anal. & Computing Sci.Dept.*TRITA-NA-8221; Royal Inst. of Tech., Stodkholm. Num.Anal. & Computing Sci.Dept. INTEGRAL Project.*INTEGRAL-4.*1982. 017960 Lansner, A. Ekeberg, O.*A program package implementing a system of interacting adaptive associate networks.* Royal Inst. of Tech., Stockholm. Num.Anal. & Computing Sci.Dept.*TRITA-NA-8302; Royal Inst. of Tech., Stockholm. Num.Anal. & Computing Sci.Dept. INTEGRAL Project.* INTEGRAL-6.*1983. 017961 Calmet, J. Cohen, I.*Synthesizing recurrence relations: I - Analysis of the problem.* Royal Inst. of Tech., Stockholm. Num.Anal. & Computing Sci.Dept.*TRITA-NA-8305.* 1983. 017962 Brannigan, M. Gustafson, S.-A.* H-sets, convex programming and constrained approximation.* Royal Inst. of Tech., Stockholm. Num.Anal. & Computing Sci.Dept.*TRITA-NA-8308.* 1983. 017963 Nudel, B.* Consistent labeling problems and their algorithms: Part II. Expected complexities and theory base heuristics.* Rutgers U. Comp.Sci.Dept.*DCS-TR-113.* 1983 (revised). 017964 Bercker, R.I. Peri, Y.*Finding the two core of a tree.* Rutgers U. Comp.Sci.Dept.*DCS-TR-121.*1982. 017965 Peri, Y. Snir, M.* Circuit partitioning with size and connection constraints.* Rutgers U. Comp.Sci.Dept.* DCS-TR-122.*1982. 017966 Peri, Y.*The bitonic and odd even networks are more than merging.* Rutgers U. Comp.Sci.Dept.*DCS-TR-123.*1983. 017967 Peri, Y. Vishkin, U.*Efficient implementation of shifting algorithm.* Rutgers U. Comp.Sci.Dept.*DCS-TR-124.*1983. 017968 Peri, Y.*Optimum split trees.* Rutgers U. Comp.Sci.Dept.* DCS-TR-125.*1983. 017969 Minsky, N. Lockman, A.*Principles for database authorization.* Rutgers U. Comp.Sci.Res.Lab.*LCSR-TR-42.* 1982. 017970 Feather, M. London, P.*Implementing specification freedoms.* Southern Cal U. Info.Sci.Inst.*ISI/RR-83-100.*1983. 017971 Merritt, I.H.*Providing telephone line access to a packet voice network.* Southern Cal U. Info.Sci.Inst.* ISI/RR-83-107.*1983. 017972 Kini, V. Martin, D.F. Stoughton, A.*Tools for testing denotational semantic definitions of programming languages.* Southern Cal U. Info.Sci.Inst.* ISI/RR-83-112.*1983. 017973 Mann, W.C.*An overview of the Penman text generation system.* Southern Cal U. Info.Sci.Inst.*ISI/RR-83-114.* 1983. 017975 Gill, P.E. Gould, N.I.M. Murray, W. Saunders, M.A. Wright, M.H.*A range space method for quadratic programming problems with bounds and general constraints.* Stanford U. O.R. Dept. Systems Optimization Lab.*SOL 82-15.*1982. 017974 Gill, P.E. Gould, N.I.M. Murray, W. Saunders, M.A. Wright, M.H.* Range space methods for convex quadratic programming.* Stanford U. O.R. Dept. Systems Optimization Lab.*SOL 82-14.*1982. 017976 Gill, P.E. Murray, W. Saunders, M.A. Wright, M.H.* Sparse matrix methods optimization.* Stanford U. O.R. Dept. Systems Optimization Lab.*SOL 82-17.*1982. 017977 Mathiesen, L.*Computational experience in solving equilibrium models by a sequence of linear complementarity problems.* Stanford U. O.R. Dept. Systems Optimization Lab.*SOL 83-01.*1983. 017978 Wittrock, R.J.*Advances in a nested decomposition algorithm for solving staircase linear programs.* Stanford U. O.R. Dept. Systems Optimization Lab.*SOL 83-02, Ph.D. Thesis. Wittrock, R.J.*1983. 017979 Streit, R.L.*Solution of systems of complex linear equations in the L subscript infinity norm with constraints on the unknowns.* Stanford U. O.R. Dept. Systems Optimization Lab.*SOL 83-03.*1983. 017980 Jones, H.M.*Non-linear data fitting for analysis of friction stress and recovery in metal alloys.* U.K. National Physical Lab. Info. Technology and Computing Div.*DITC 13/82.*1982. 017981 Schofield, D. Manning, D.R.*A theoretical model for the speech input device SID3. 1. Filters.* U.K. National Physical Lab. Info. Technology and Computing Div.*DITC 20/83.*1983. 017982 Schofield, D. Manning, D.R.*A theoretical model for the speech input device SID3. 2. Correlators.* U.K. National Physical Lab. Info. Technology and Computing Div.*DITC 21/83.*1983. 017983 Rengger, R.E. Manning, D.R.*A hardware preprocessor for use in speech recognition: speech input device SID3.* U.K. National Physical Lab. Info. Technology and Computing Div.*DITC 22/83.*1983. 017984 Singer, M.A. Hammerling, S.J.*The algebraic Riccati equation: a summary review of some available results.* U.K. National Physical Lab. Info. Technology and Computing Div.*DITC 23/83.*1983. 017985 Bundy, A.* Mental machines rule OK.* * Edinburgh U. A.I. Dept.*Occasional Paper 25.*1981. 017986 Bundy, A. Byrd, L. Mellish, C.*Special purpose, but domain independent, inference mechanisms.* Edinburgh U. A.I. Dept.*Research Paper 179.*1982. 017987 O'Keefe, R.A.* Prolog compared with LISP?* Edinburgh U. A.I. Dept.*Research Paper 180.*1982. 017988 Featherstone, R.*The calculation of robot dynamics using articulated body inertias.* Edinburgh U. A.I. Dept.* Research Paper 181.*1982. 017989 O'Keefe, R.*A smooth applicative merge sort.* Edinburgh U. A.I. Dept.*Research Paper 182.*1982. 017990 Thompson, H. Ritchie, G.*Techniques for parsing natural language: two examples.* Edinburgh U. A.I. Dept.*Research Paper 183.*1983. 017991 Silver, B.* Learning equation solving methods from examples.* Edinburgh U. A.I. Dept.*Research Paper 184.* 1983. 017992 Wallen, L.*Using proof plans to control deduction.* Edinburgh U. A.I. Dept.*Research Paper 185.*1983. 017993 Featherstone, R.* High speed velocity and force transformation for robots with three intersecting revolute joint axes at the wrist.* Edinburgh U. A.I. Dept.*Working Paper 115.*1982. 017994 Featherstone, R.*A program for simulating robot dynamics.* Edinburgh U. A.I. Dept.*Working Paper 116.*1982. 017995 Jenkins, L.E.*Compiling high(ish)-level chip discription into an intermediate representation.* Edinburgh U. A.I. Dept.*Working Paper 117.*1982. 017996 Howe, J. Ross, P. Johnson, K. Plane, F. Inglis, R.* Learning mathematics throgh LOGO programming: the transition from laboratory to classroom.* Edinburgh U. A.I. Dept.*Working Paper 118(b).*1982. 017997 Sterling, L.* IMPRESS - meta level concepts in theorem proving.* Edinburgh U. A.I. Dept.*Working Paper 119.* 1982. 017998 Burns, K.* Problem solving and LOGO.* Edinburgh U. A.I. Dept.*Working Paper 120.*1982. 017999 Feagans, F.A. Jr.* Organization of a robot society.* Illinois U. Comp.Sci.Dept.*UIUCDCS-R-81-1067.*1981. 018000 Suwa, I.*Topological design of segmented folded PLAs.* Illinois U. Comp.Sci.Dept.*UIUCDCS-R-82-1095.*1982. 018001 Kuck, S.M.*A design methodology for a universal relation scheme implementation via codasyl.* Illinois U. Comp.Sci.Dept.*UIUCDCS-R-82-1106, Ph.D. Thesis. Kuck, S.M.*1982. 018002 Hsiang, J.*Topics in automated theorem proving and program generation.* Illinois U. Comp.Sci.Dept.* UIUCDCS-R-82-1113, Ph.D. Thesis. Hsiang, J.*1982. 018003 Chen, H.-H. Kuck, S.M. Peterson, J. Sagiv, Y.*A user's manual for aurical: a universal relation implementation via CODASYL.* Illinois U. Comp.Sci.Dept.* UIUCDCS-R-82-1114.*1982. 018004 Clark, T.S.* S-K reduction engine for an applicative language.* Illinois U. Comp.Sci.Dept.*UIUCDCS-R-82-1119.* 1982. 018005 Purtilo, J.*Computing Runge Kutta starters symbolically.* Illinois U. Comp.Sci.Dept.*UIUCDCS-R-83-1120.*1983. 018006 Akl, S.G.* Digital signatures: a survey.* Queen's U. Computing & Info.Sci.Dept.*Tech.rpt. 82-145.*1982. 018007 Alanko, T.O.*Empirical studies of program behaviour in virtual memory.* Helsinki U. Comp.Sci.Dept.*Rpt. A-1983-03.*1983. 018008 Boley, H.* Artificial intelligence languages and machines.* Hamburg U. Fachbereich Informatik.*Bericht nr. 94.*1982. 018009 Borodin, A. Cook, S. Pippenger, N.* Parallel computation for well endowed rings and space bounded probabilistic machines.* Toronto U. Comp.Sci.Dept.*Tech.rpt. 162.*1983. 018010 Bunt, R.B. Murphy, J.M. Majumdar, S.*Applications of a measure of program locality.* Saskatchewan U. Computational Sci.Dept.*Rpt. 83-06.*1983. 018011 Cantone, R.R. Pipitone, F.J. Lander, W.B. Marrone, M.P.* Model based probabilistic reasoning for electronics troubleshooting.*No issuing agency indicated (authors' address: Navy Center for Applied Research in Artificial Intelligence/ U.S. Naval Research Laboratory - Code 7510/ Washington, DC 20375).*1983. 018012 Cattell, R.G.G.*Design and implementation of a relationship entity datum data model.* Xerox. Palo Alto Res. Center.* CSL-83-04.*1983. 018013 Cook, R. Finkel, R. DeWitt, D. Landweber, L. Vergilio, T.* The crystal nugget: Part I of the first report on the Crystal project.* Wisconsin U. Comp.Sci.Dept.*Tech.rpt. 499.*1983. 018014 Cook, R. Finkel, R. Gerber, B. DeWitt, D. Landweber, L.*The Crystal nuggetmaster: Part II of the first report on the Crystal project.* Wisconsin U. Comp.Sci.Dept.*Tech.rpt. 500.*1983. 018015 Denbaum, C.A.P.*A demand driven, coroutine based implementation of a nonprocedural language.* Iowa U. Comp.Sci.Dept.*Tech.rpt. 83-01, Ph.D. Thesis. Denbaum, C.A.P.*1983. 018016 Engquist, B. Gustafsson,B.* Steady state computations for wave propagation problems.* Uppsala U. Comp.Sci.Dept.* Rpt. 92.*1983. 018017 Finkel, R. Cook, R. DeWitt, D. Hall, N. Landweber, L.* Wisconsin Modula: Part III of the first report on the Crystal project.* Wisconsin U. Comp.Sci.Dept.*Tech.rpt. 501.*1983. 018018 Fleck, A.C.*A proposal for comparison of types in Pascal and associated semantic models.* Iowa U. Comp.Sci.Dept.* Tech.rpt. 83-02.*1983. 018019 Grosky, W.I. Jain, R.* Region matching in pyramids by dynamic scene analysis.* Wayne State U. Comp.Sci.Dept.* CSC-83-002.*1983. 018020 Ho, S.W.*Optimising conjunctive queries on a relational interface to CODASYL DBMS.* Hong Kong U. Comp. Studies and Appl. Centre.*TR-A1-83.*1983. 018021 Hussmann, M. Schefe, P.*The design of SWYSS, a dialogue system for scene analysis.* Hamburg U. Fachbereich Informatik.*Bericht nr. 95.*1983. 018022 Jantzen, M. Kudlek, M.* Homomorphic images of sentential form languages defined by semi Thue systems.* Hamburg U. Fachbereich Informatik.*Bericht nr. 89.*1983. 018023 Jardine, D.A.* Use and mention.* Queen's U. Computing & Info.Sci.Dept.*Tech.rpt. 82-143.*1982. 018024 Kampfner, R.R. Conrad, M.*Computational modeling of evolutionary learning processes in the brain.* Wayne State U. Comp.Sci.Dept.*CSC-82-008.*1982. 018025 Keil, J.M.* Decomposing polygons into simpler components.* Toronto U. Comp.Sci.Dept.*Tech.rpt. 163, Ph.D. Thesis. Keil, J.M.*1983. 018026 Magnusson, B.* SIMSALABIM: A package for dynamic memory management in Pascal.* Lund U. Comp.Sci.Dept.*1983. 018027 Mozer, M.C.* Letter migration in word perception.* Cal U., San Diego. Human Info.Proces. Center.*Rpt. 8301.*1983. 018028 Raiha, K.-J. Saarinen, M. Sarjakoski, M. Sippu, S. Soisalon-Soininen, E. Tienari, M.*Revised report on the compiler writing system HLP78.* Helsinki U. Comp.Sci.Dept.*Rpt. A-1983-01.*1983. 018029 Reif, J.H. Scherlis, W.L.*Deriving efficient graph algorithms.* Carnegie Mellon U. Comp.Sci.Dept.* CMU-CS-82-155.*1982. 018030 Rumelhart, D.E. Norman, D.A.* Representation in memory.* Cal U., San Diego. Human Info.Proces. Center.*CHIP 116.* 1983. 018031 Tennent, R.D.* Denotational semantics of Hoare classes.* Queen's U. Computing & Info.Sci.Dept.*Tech.rpt. 82-144.* 1982. 018032 Tranchell, L.M.*A SNePS implementation of KL-ONE.* SUNY, Buffalo. Comp.Sci.Dept.*Tech.Rpt. 198.*1982. 018033 Tse, T.H.*An input design for communication systems for non-vocal physically disabled users.* Hong Kong U. Comp. Studies and Appl. Centre.*TR-A2-83.*1983. 018034 Wald, J.A. Sorenson, P.G.* Productivity tools for a database management system.* Saskatchewan U. Computational Sci.Dept.*Rpt. 83-05.*1983. 018036 Yau, M.-M.J.*Hierarchical representation of three dimensional digital objects.* SUNY, Buffalo. Comp.Sci.Dept.*Tech.rpt. 201, Ph.D. Thesis. Yau, M.-M.J.* 1983. 018037 Yuen, C.K.*Some hardware implementations of the tree sort.* Hong Kong U. Comp. Studies and Appl. Centre.*TR-B1-83.* 1983. 018038 Yuen, C.K.*A stack based method for sorting.* Hong Kong U. Comp. Studies and Appl. Centre.*TR-A3-83.*1983. 018039 Zellweger, P.T.*An interactive high level debugger for control flow optimized programs.* Xerox. Palo Alto Res. Center.*CSL-83-01.*1983. VOL. 5, NO. 10 08/22/83 018040 Chansler, R.J. Jr.* Coupling in systems with many processors.* Carnegie Mellon U. Comp.Sci.Dept.* CMU-CS-82-131, Ph.D. Thesis. Chansler, R.J. Jr.*1982. 018041 Tsai, M.Y.* Pass transistor networks in MOS technology: Synthesis, performance, and testing.* IBM Watson Res. Center.*RC 9837.*1983. 018042 Francez, N.* Product properties and their direct verification.* IBM Watson Res. Center.*RC 9848.*1983. 018043 Kelley, J.F.*A human factors perspective on designing an integrated graphic I/O workstation.* IBM Watson Res. Center.*RC 9857.*1983. 018044 Rogowitz, B.E.*The human visual system: A guide for the display technologist.* IBM Watson Res. Center.*RC 9881.* 1983. 018045 King, R.P. Korth, H.F. Willner, B.E.*An optimal scheme for the distribution of a large database among small computers.* IBM Watson Res. Center.*RC 9884.*1983. 018046 Coppersmith, D. Seroussi, G.*On the minimum distance of some quadratic residue codes.* IBM Watson Res. Center.*RC 9894.*1983. 018047 Schlag, M. Luccio, F. Maestrini, P. Lee, D.T. Wong, C.K.*A visibility problem in VLSI layout compaction.* IBM Watson Res. Center.*RC 9896.*1983. 018048 Hagouel, J. Schwartz, M.* Hierarchical routing in computer networks.* IBM Watson Res. Center.*RC 9898.*1983. 018049 Leavenworth, B. Power, L.R.* Data modelling with data abstractions.* IBM Watson Res. Center.*RC 9899.*1983. 018050 Sasao, T.*A fast complementation algorithm for sum of products expressions of multiple valued input binary functions.* IBM Watson Res. Center.*RC 9903.*1983. 018051 Markowitz, H.M. Malhotra, A. Pazel, D.P.*The EAS-E application development system: Principles and language summary.* IBM Watson Res. Center.*RC 9910.*1983. 018052 Rivlin, T.J.*The best strong uniqueness constant for a multivariate Chebyshev polynomial.* IBM Watson Res. Center.*RC 9920.*1983. 018053 Huang, S.-H.S. Wong, C.K.*Optimal binary split trees.* IBM Watson Res. Center.*RC 9921.*1982. 018054 Liao, Y.Z. Wong, C.K.*An algorithm to compact a VLSI symbolic layout with mixed constraints.* IBM Watson Res. Center.*RC 9922.*1982. 018055 Francez, N.*Extended naming conventions for communicating processes.* IBM Watson Res. Center.*RC 9926.*1983. 018056 Krishnamurthy, R. Morgan, S.P. Zloof, M.M.*Query by example: Operations on piecewise continuous data.* IBM Watson Res. Center.*RC 9928.*1983. 018057 Segall, A. Jaffe, J.M.*A reliable distributed route set-up procedure.* IBM Watson Res. Center.*RC 9929.*1983. 018058 Francez, N.* Program transformations eliminating the distributed terminations convention of CSP.* IBM Watson Res. Center.*RC 9935.*1983. 018059 Nackman, L.R. Taylor, R.H.*An hierarchical exception handler binding mechanism.* IBM Watson Res. Center.*RC 9937.*1983. 018060 Towsley, D.*An application of the reflection principle to the transient analysis of the M/M/1 queue.* IBM Watson Res. Center.*RC 9940.*1983. 018061 Hagouel, J.*Issues in routing for large and dynamic networks.* IBM Watson Res. Center.*RC 9942, Ph.D. Thesis. Hagouel, J. (Columbia University).*1983. 018062 Chandra, A.K. Fortune, S. Lipton, R.* Unbounded fan-in circuits and associative functions.* IBM Watson Res. Center.*RC 9943.*1982. 018063 Chandra, A.K. Fortune, S. Lipton, R.*Lower bounds for constant depth circuits for prefix problems.* IBM Watson Res. Center.*RC 9944.*1982. 018064 Strom, R.E. Yemini, S.* NIL: An integrated language and system for distributed programming.* IBM Watson Res. Center.*RC 9949.*1983. 018065 Goyal, A.* Lookahead network.* IBM Watson Res. Center.*RC 9952.*1983. 018066 Landauer, R.*Fundamental physical limitations of the computational process.* IBM Watson Res. Center.*RC 9962.* 1983. 018067 Terry, D. Andler, S.*Experience with measuring performance of local network communications.* IBM Watson Res. Center.* RJ 3743.*1983. 018068 Traiger, I.L.*Trends in systems aspects of database management.* IBM Watson Res. Center.*RJ 3845.*1983. 018069 Iglehart, D.L. Shedler, G.S.* Simulation of nonMarkovian systems.* IBM Watson Res. Center.*RJ 3850.*1983. 018070 Bertino, E. Haas, L.M. Lindsay, B.G.* View management in distributed data base systems.* IBM Watson Res. Center.* RJ 3851.*1983. 018071 Kim, W.*Highly available database and database application systems.* IBM Watson Res. Center.*RJ 3852.*1983. 018072 Olumi, M. Wiederhold, G. Hauser, C. Lucas, P. Mehl, J.* Software project databases.* IBM Watson Res. Center.*RJ 3862.*1983. 018073 Etienne, R. Hallmark, G.*A VLSI layout editor based on a relational database system.* IBM Watson Res. Center.*RJ 3863.*1983. 018074 Walker, A.*Data bases, expert systems, and Prolog.* IBM Watson Res. Center.*RJ 3870.*1983. 018075 Janson, P. Svobodova, L. Maehle, E.* Filing and printing services on a local area network.* IBM Watson Res. Center.*RZ 1220.*1983. 018076 International Standards Organization.* Information Processing - Graphical Kernel System (GKS) - Functional description.* International Standards Organization.* ISO/TC 97/SC 5 N 728.*1982 (12-27-82). 041612 Horn, B.K.P.*The curve of least energy.* M.I.T. A.I. Lab.* Memo 612.*1981. 041660 Richards, W.*How to play twenty questions with nature and win.* M.I.T. A.I. Lab.*Memo 660.*1982. 041697 Grimson, W.E.L.* Binocular shading and visual surface reconstruction.* M.I.T. A.I. Lab.*Memo 697.*1982. 041701 Batali, J.* Computational introspection.* M.I.T. A.I. Lab.* Memo 701.*1983. 041705 Gaston, P.C. Lozano-Perez, T.* Tactile recognition and localization using object models: The case of polyhedra on a plane.* M.I.T. A.I. Lab.*Memo 705.*1983. 041717 Hollerbach, J.M. Sahar, G.* Wrist partitioned inverse kinematic accelerations and manipulator dynamics.* M.I.T. A.I. Lab.*Memo 717.*1983. 040703 Roylance, G.*A simple model of circuit design.* M.I.T. A.I. Lab.*Tech.Rpt. 703.*1983. 040715 Barton, G.E. Jr.*A multiple context equality based reasoning system.* M.I.T. A.I. Lab.*Tech.Rpt. 715.*1983. 018077 Lenstra, A.K.* Factoring multivariate polynomials over finite fields.* Mathematisch Centrum.*IW 221/83.*1983. 018078 Bergstra, J.A. Klop, J.W.*A process algebra for the operational semantics of static data flow networks.* Mathematisch Centrum.*IW 222/83.*1983. 018079 Bergstra, J.A. Tiuryn, J.* RC-compactness, a necessary condition for the existence of sound and complete logics of partial correctness.* Mathematisch Centrum.*IW 223/83.*1983. 018080 Bergstra, J.A. Cmielienska, A. Tiuryn, J.*Another incompleteness theorem for Hoare's logic.* Mathematisch Centrum.*IW 224/83.*1983. 018081 Vitanyi, P.M.B.*An optimal simulation of counter machines: The ACM case.* Mathematisch Centrum.*IW 225/83.*1983. 018082 Axelsson, A.O.H. Verwer, J.G.* Boundary value techniques for initial value problems in ordinary differential equations.* Mathematisch Centrum.*NW 147/83.*1983. 018083 Vries, H.B. de* The multi grid method in the solution of time dependent nonlinear partial differential equations.* Mathematisch Centrum.*NW 148/83.*1983. 018084 Houwen, P.J. van der* Stability results for discrete Volterra equations.* Mathematisch Centrum.*NW 149/83.* 1983. 018085 Verwer, J.G. Vries, H.B. de* Global extrapolation of a first order splitting method.* Mathematisch Centrum.*NW 150/83.*1983. 018086 Houwen, P.J. van der Riele, H.J.J. te* Linear multistep methods for Volterra integral and integro differential equations.* Mathematisch Centrum.*NW 151/83.*1983. 018087 Dembinski, P.* Microprogram transformations.* Polish Academy of Sciences. Inst. of Comp.Sci.*ICS PAS Rpt. No. 488.*1982. 018088 Novotny, M.* Sequences of information systems.* Polish Academy of Sciences. Inst. of Comp.Sci.*ICS PAS Rpt. No. 489.*1982. 018089 Bakowski, P.*A language for negative control design.* Polish Academy of Sciences. Inst. of Comp.Sci.*ICS PAS Rpt. No. 490.*1982. 018090 Miadowicz, Z.B.* Time varying automata: A survey.* Polish Academy of Sciences. Inst. of Comp.Sci.*ICS PAS Rpt. No. 491.*1982. 018091 Baczko, A.* Simulation controlled data transmission network.* Polish Academy of Sciences. Inst. of Comp.Sci.* ICS PAS Rpt. No. 493.*1982. 018092 Jankowski, A. Rauszer, C.*On logical foundation approach to users' domain restriction in data bases. I.* Polish Academy of Sciences. Inst. of Comp.Sci.*ICS PAS Rpt. No. 494.*1983. 018093 Lipski, W.*An NP-complete geometric problem related to three layer channel routing.* Polish Academy of Sciences. Inst. of Comp.Sci.*ICS PAS Rpt. No. 495.*1983. 018094 Pawlak, Z.* Rough probability and partial observability.* Polish Academy of Sciences. Inst. of Comp.Sci.*ICS PAS Rpt. No. 496.*1983. 018095 Hendrix, G.G.* KLAUS: a system for managing information and computational resources.* SRI International. A.I. Center.*Tech. Note 230.*1980. 018096 Konolige, K.*A first-order formalization of knowledge and action for a multiagent planning system.* SRI International. A.I. Center.*Tech. Note 232.*1980. 018097 Fischler, M.A.* Computational structures for machine perception.* SRI International. A.I. Center.*Tech. Note 233.*1981. 018098 Bolles, R.C.* Three dimensional locating of industrial parts.* SRI International. A.I. Center.*Tech. Note 234.* 1981. 018099 Hendrix, G.G. Sacerdoti, E.D.* Natural language processing Part One: The field in perspective.* SRI International. A.I. Center.*Tech. Note 237.*1981. 018100 Moore, R.C.* Automatic deduction for commonsense reasoning: An overview.* SRI International. A.I. Center.*Tech. Note 239.*1981. 018101 Moore, R.C.* Problems in logical form.* SRI International. A.I. Center.*Tech. Note 241.*1981. 018102 Bolles, R.C.*An overview of applications of image understanding to industrial automation.* SRI International. A.I. Center.*Tech. Note 242.*1981. 018103 Reboh, R.* Knowledge engineering techniques and tools in the prospector environment.* SRI International. A.I. Center.*Tech. Note 243, Ph.D. Thesis. Reboh, R. (Linkoeping University).*1981. 018104 Smith, G.B.*Detection of rivers in low resolution aerial imager.* SRI International. A.I. Center.*Tech. Note 244.* 1981. 018105 Wilkins, D.E. Robinson, A.E.*An interactive planning system.* SRI International. A.I. Center.*Tech. Note 245.* 1981. 018106 Manna, Z. Waldinger, R.* Deductive synthesis of the unification algorithm.* SRI International. A.I. Center.* Tech. Note 246.*1981. 018107 Wilkins, D.E. Robinson, A.E.*An interactive planning system.* SRI and meaning representation via PRUF.* SRI International. A.I. Center.*Tech. Note 247.*1981. 018108 Nilsson, N.J.* Artificial intelligence: Engineering, science, or slogan?* SRI International. A.I. Center.* Tech. Note 248.*1981. 018109 Bolles, R.C. Kremers, J.H. Cain, R.A.*A simple sensor to gather three dimensional data.* SRI International. A.I. Center.*Tech. Note 249.*1981. 018110 Moore, R.C.*Practical natural language processing by computer.* SRI International. A.I. Center.*Tech. Note 251.*1981. 018111 Haas, N. Hendrix, G.G.* Machine learning for information management.* SRI International. A.I. Center.*Tech. Note 252.*1981. 018112 Walker, D.E.*Computational strategies for analyzing the organization and use of information.* SRI International. A.I. Center.*Tech. Note 253.*1981. 018113 Archbold, A.A. Grosz, B. Sagalowicz, D.*A team user's guide.* SRI International. A.I. Center.*Tech. Note 254.* 1981. 018114 Konolige, K.*The database as model: A metatheoretic approach.* SRI International. A.I. Center.*Tech. Note 255.*1981. 018115 Farley, A.M.*A probabilistic model for uncertain problem solving.* SRI International. A.I. Center.*Tech. Note 256.* 1981. 018116 Grosz, B.J. (Ed.) Amsler, R. Appelt, D. Archbold, A. Grosz, B. Haas, N. Hoobs, J. Konolige, K. Martin, P. Moore, R. Robinson, J. Rosenschein, S. Sagalowica, D. Shieber, S. Stickel, M. Walker, D. Warren, D.*Research on natural language processing at SRI.* SRI International. A.I. Center.*Tech. Note 257.*1981. 018117 Wilkins, D.E.* Parallelism in planning and problem solving: reasoning about resources.* SRI International. A.I. Center.*Tech. Note 258.*1982. 018118 Appelt, D.E.* Planning natural language utterances to satisfy multiple goals.* SRI International. A.I. Center.* Tech. Note 259, Ph.D. Thesis. Appelt, D.E. (Stanford University).*1982. 018119 Manna, Z. Waldinger, R.*Special relations in program synthetic deduction.* SRI International. A.I. Center.* Tech. Note 260.*1982. 018120 Barnard, S.T. Fischler, M.A.*Computational stereo.* SRI International. A.I. Center.*Tech. Note 261.*1982. 018121 Grosz, B.* TEAM: A transportable natural language interface system.* SRI International. A.I. Center.*Tech. Note 263R.* 1982. 018122 Moore, R.C.*The role of logic in knowledge representation and commonsense reasoning.* SRI International. A.I. Center.*Tech. Note 264.*1982. 018123 Warren, D.H.D.*A view of the fifth generation and its impact.* SRI International. A.I. Center.*Tech. Note 265.* 1982. 018124 Wilkins, D.* Domain independent planning representation and plan generation.* SRI International. A.I. Center.*Tech. Note 266R.*1983. 018125 Fischler, M.A. Barnard, S.T. Bolles, R.C. Lowry, M. Wuam, L. Smith, G. Witkin, A.*Modeling and using physical constraints in scene analysis.* SRI International. A.I. Center.*Tech. Note 267.*1982. 018126 Stickel, M.E.*A nonclausal connection graph resolution theorem proving program.* SRI International. A.I. Center.* Tech. Note 268.*1982. 018127 Peterson, G.E. Stickel, M.E.* Complete systems of reductions using associative an/or commutative unification.* SRI International. A.I. Center.*Tech. Note 269.*1982. 018128 Grosz, B. Haas, N. Hendrix, G. Hobbs, J. Martin, P. Moore, R. Robinson, J. Rosenschein, S.* DIALOGIC: A core natural language processing system.* SRI International. A.I. Center.*Tech. Note 270.*1982. 018129 Barnard, S.T.*Interpreting perspective images.* SRI International. A.I. Center.*Tech. Note 271.*1982. 018130 Pentland, A.P.* Local shading analysis.* SRI International. A.I. Center.*Tech. Note 272.*1982. 018131 Smith, G.B.*From image irradiance to surface orientation.* SRI International. A.I. Center.*Tech. Note 273.*1982. 024940 Ullman, J.D. Vardi, M.Y. Maier, D.*The equivalence of universal relation definitions.* Stanford U. Comp.Sci.Dept.*STAN-CS-82-940.*1982. 27p. 024947 Rowe, N.C.*Modelling degrees of item interest for a general database query system.* Stanford U. Comp.Sci.Dept.* STAN-CS-82-947.*1982. 34p. 024948 Rowe, N.C.*Three papers on rule based estimation of statistics on databases.* Stanford U. Comp.Sci.Dept.* STAN-CS-82-948.*1982. Contents: Rowe, N.C.* Rule based statistical calculations on a "database abstract"; Rowe, N.C.*Inheritance of statistical properties; Rowe, N.C.* Diophantine compromise of a statistical database. 35p. 024950 Winston, P.H. Binford, T.O. Katz, B. Lowry, M.* Learning physical description from functional definitions, examples and precedents.* Stanford U. Comp.Sci.Dept.* STAN-CS-82-950.*1982. 22p. 024961 Arnold, R.D.*Automated stereo perception.* Stanford U. Comp.Sci.Dept.*STAN-CS-83-961, Stanford U. Comp.Sci.Dept. A.I. Lab.*AIM-351.*1983. 123p. 024965 Ghosh, P.K.*An approach to type design and text composition in Indian scripts.83-965.*1983. 144p. 024966 Ghosh, P.K. Bigelow, C.A.*A formal approach to lettershape description for type design.* Stanford U. Comp.Sci.Dept.* STAN-CS-83-966.*1983. 49p. 024967 Manna, Z. Pnueli, A.* Verification of concurrent programs: A temporal proof system.* Stanford U. Comp.Sci.Dept.* STAN-CS-83-967.*1983. 92p. 024968 Whang, K.-Y.*A physical database design methodology using the property of separability.* Stanford U. Comp.Sci.Dept.*STAN-CS-83-968, Ph.D. Thesis. Whang, K.-Y.* 1983. 258p. 024971 Ruggles, L.* Letterform design systems.* Stanford U. Comp.Sci.Dept.*STAN-CS-83-971.*1983. 24p. 018132 Kariv, O. Jeger, M.*Algorithms for P-center in a weighted tree.* TECHNION - Israel Inst. of Tech. Comp.Sci.Dept.* Tech.Rpt. 249.*1982. 018133 Itai, A. Zehavi, A.*Bounds on path connectivity.* TECHNION - Israel Inst. of Tech. Comp.Sci.Dept.*Tech.Rpt. 251.* 1982. 018134 Itai, A. Rodeh, M.*The Lord of the Ring or probabilistic methods for breaking symmetry in distributive networks.* TECHNION - Israel Inst. of Tech. Comp.Sci.Dept.*Tech.Rpt. 253.*1982. 018135 Lev, G. Valiant, L.G.*Size bounds for superconcentrators.* Edinburgh U. Comp.Sci.Dept.*CSR-95-81.*1981. 018136 Habasinski, Z. Karpinski, M.*On the Blum Sakoda 7 pebble searching algorithm.* Edinburgh U. Comp.Sci.Dept.* CSR-96-81.*1981. 018137 Skyum, S. Valiant, L.G.*A complexity theory based on boolean algebra.* Edinburgh U. Comp.Sci.Dept.*CSR-97-82.* 1982. 018138 Apt, K.R. Plotkin, G.D.* Countable nondeterminism and random assignment.* Edinburgh U. Comp.Sci.Dept.* CSR-98-82.*1982. 018139 Li, W.*An operational semantics of tasking and exception handling in Ada.* Edinburgh U. Comp.Sci.Dept.*CSR-99-82.* 1982. 018140 Burstall, R.M. Goguen, J.A.* Algebras, theories and freeness: An introduction for computer scientists.* Edinburgh U. Comp.Sci.Dept.*CSR-101-82.*1982. 018141 Smyth, M.B. Plotkin, G.D.*The category theoretic solution of recursive domain equations.* Edinburgh U. Comp.Sci.Dept.*CSR-102-82.*1982. 018142 Milner, R.* Calculi for synchrony and asynchrony.* Edinburgh U. Comp.Sci.Dept.*CSR-104-82.*1982. 018143 Atkinson, M.P. Chisholm, K.J. Cockshott, W.P.* CMS - a chunk management system.* Edinburgh U. Comp.Sci.Dept.* CSR-110-82.*1982. 018144 Milner, R.*A complete inference system for a class of regular behaviours.* Edinburgh U. Comp.Sci.Dept.* CSR-111-82.*1982. 018145 Schmidt, D.A.* Syntactic type checking using Scott retraction maps.* Edinburgh U. Comp.Sci.Dept.*CSR-112-82.* 1982. 018146 Plotkin, G.D.*An operational semantics for CSP.* Edinburgh U. Comp.Sci.Dept.*CSR-114-82.*1982. 018147 Cardelli, L.* Two dimensional syntax for functional languages.* Edinburgh U. Comp.Sci.Dept.*CSR-115-82.*1982. 018148 Milner, R.*A finite delay operator in synchronous CCS.* Edinburgh U. Comp.Sci.Dept.*CSR-116-82.*1982. 018149 Constable, R.L.* Intensional analysis of functions and types.* Edinburgh U. Comp.Sci.Dept.*CSR-118-82.*1982. 018150 Shields, M.W.* Concurrency, correctness, proof and undecidability in SDL like systems.* Edinburgh U. Comp.Sci.Dept.*CSR-119-82.*1982. 018151 Shields, M.W.* Non sequential behaviour: 1.* Edinburgh U. Comp.Sci.Dept.*CSR-120-82.*1982. 018152 Jerrum, M. Skyum, S.*Families of fixed degree graphs for processor interconnection.* Edinburgh U. Comp.Sci.Dept.* CSR-121-82.*1982. 018153 Milne, G.J.* CIRCAL: A calculus for circuit description.* Edinburgh U. Comp.Sci.Dept.*CSR-122-82.*1982. 018154 Hennessy, M.*Axiomatising finite delay operators.* Edinburgh U. Comp.Sci.Dept.*CSR-124-82.*1982. 018155 Brownbridge, D.R. Marshall, L.F. Randell, B.*The Newcastle connection or UNIXes of the world unite!* Newcastle Upon Tyne U. Computing Lab.*No. 175.*1982. 018156 Randell, B.*The structuring of distributed computing systems.* Newcastle Upon Tyne U. Computing Lab.*No. 181.* 1982. 018157 Cristian, F.* Correct and robust programs.* Newcastle Upon Tyne U. Computing Lab.*No. 183.*1983. 018158 Feldman, J.A.*Four frames suffice: A provisionary model of vision and space.* Rochester U. Comp.Sci.Dept.*Tech.Rpt. 99.*1982. 018159 Ellis, C.S. Feldman, J.A. Heliotis, J.E.* Language constructs and support systems for distributed computing.* Rochester U. Comp.Sci.Dept.*Tech.Rpt. 102.*1982. 018160 Frisch, A.M. Allen, J.F.* Knowledge representation and retrieval for natural language processing.* Rochester U. Comp.Sci.Dept.*Tech.Rpt. 104.*1982. 018161 Brown, C.M.*Bias and noise in the Hough transform I: theory.* Rochester U. Comp.Sci.Dept.*Tech.Rpt. 105.*1982. 018162 Brown, C.M.* Color vision and computer vision.* Rochester U. Comp.Sci.Dept.*Tech.Rpt. 108.*1982. 018163 Small, S.L. Shastri, L. Brucks, M.L. Kaufman, S.G. Cottrell, G.W. Addanki, S.* ISCON: A network construction aid and simulator for connectionist models.* Rochester U. Comp.Sci.Dept.*Tech.Rpt. 109.*1983. 018164 Ellis, C.S.* Extendible hashing for concurrent operations and distributed data.* Rochester U. Comp.Sci.Dept.* Tech.Rpt. 110.*1982. 018165 Peterson, G.L. Ying, Y.-H.*Trade-offs in VLSI for bus communication networks.* Rochester U. Comp.Sci.Dept.* Tech.Rpt. 111.*1982. 018166 Brown, C.M. Curtiss, M.B. Sher, D.B.*Advanced Hough transform implementations.* Rochester U. Comp.Sci.Dept.* Tech.Rpt. 113.*1983. 018167 Brown, C.M. Sher, D.B.* Hough transformation into cache accumulators: Considerations and simulations.* Rochester U. Comp.Sci.Dept.*Tech.Rpt. 114.*1982. 018168 Loui, R.P.* Optimal paths in graphs with stochastic or multidimensional weights.* Rochester U. Comp.Sci.Dept.* Tech.Rpt. 115.*1982. 018169 Stuth, B.H.* Local computation of motion.* Rochester U. Comp.Sci.Dept.*Tech.Rpt. 116.*1982. 018170 Kedem G. Watanabe, H.*Optimization techniques for IC layout and compaction.* Rochester U. Comp.Sci.Dept.*Tech.Rpt. 117.*1982. 018171 Montuno, D.Y. Fournier, A.*Finding x-y convex hull a set of x-y polygons.* Toronto U. Comp. Systems Res. Group.* CSRG-148.*1982. 018172 Tsichritzis, D.* Beta Gamma, edited by D. Tsichritzis.* Toronto U. Comp. Systems Res. Group.*CSRG-150.*1983. VOL. 5, NO. 11 10/22/83 018173 Spector, A.Z. Schwarz, P.M.* Transactions: a construct for reliable distributed computing.* Carnegie Mellon U. Comp.Sci.Dept.*CMU-CS-82-143.*1983. 018174 Shaw, M.(ed.)*Working papers on an undergraduate computer science curriculum.* Carnegie Mellon U. Comp.Sci.Dept.* CMU-CS-83-101.*1983. 018175 Hayes, P.J. Szekely, P.A.*Graceful interaction through the COUSIN command interface.* Carnegie Mellon U. Comp.Sci.Dept.*CMU-CS-83-102.*1983. 018176 Kung, H.T. Ruane, L.M. Yen, D.W.L.*A two-level pipelined systolic array multi dimensional convolution.* Carnegie Mellon U. Comp.Sci.Dept.*CMU-CS-83-103.*1983. 018177 Specker, P.*A post-processing algorithm for time domain pitch trackers.* Carnegie Mellon U. Comp.Sci.Dept.* CMU-CS-83-104.*1983. 018178 Doyle, J.*What is rational psychology? Toward a modern mental philosophy.* Carnegie Mellon U. Comp.Sci.Dept.* CMU-CS-83-106.*1983. 018179 Satyanarayanan, M.*A methodology for modelling storage systems.* Carnegie Mellon U. Comp.Sci.Dept.* CMU-CS-83-109, Ph.D. Thesis. Satyanarayanan, M.*1983. 018180 Carbonell, J.G. Minton, S.* Metaphor and common sense reasoning.* Carnegie Mellon U. Comp.Sci.Dept.* CMU-CS-83-110.*1983. 018181 Brookes, S.D.*On the relationship of CCS and CSP.* Carnegie Mellon U. Comp.Sci.Dept.*CMU-CS-83-111.*1983. 018182 Brookes, S.D. Rounds, W.C.*Behavioral equivalence relations induces by programming logics.* Carnegie Mellon U. Comp.Sci.Dept.*CMU-CS-83-112.*1983. 018183 Thorpe, C.E. Shafer, S.* Topological correspondence in line drawings of multiple views of objects.* Carnegie Mellon U. Comp.Sci.Dept.*CMU-CS-83-113.*1983. 018184 Doyle, J.*Methodological simplicity in expert system construction: The case of judgements and reasoned assumptions.* Carnegie Mellon U. Comp.Sci.Dept.* CMU-CS-83-114.*1983. 018185 Ackley, D.G. Berliner, H.J.*The QBKG system: Knowledge representation for producing and explaining judgements.* Carnegie Mellon U. Comp.Sci.Dept.*CMU-CS-83-116.*1983. 018186 Driscoll, J.R. Furst, M.L.*On the diameter of permutation groups.* Carnegie Mellon U.*Comp.Sci.Dept.*n.d. 018187 Wolfenstetter, St.* Weakly almost periodic functions on hypergroups.* Technische Universitaet Muenchen. Institut fuer Mathematik.*TUM-M8301.*1983. 018188 Roesler, F.*Die riemannsche vermutung als eigenwert-problem.* Technische Universitaet Muenchen. Institut fuer Mathematik.*TUM-M8302.*1983. 018189 Castrigiano, D.P.L. Kokiantonis, N.* Classical paths for a quadratic action with memory and exact evaluation of the path integral.* Technische Universitaet Muenchen. Institut fuer Mathematik.*TUM-M8303.*1983. 018190 Rentrop, P.*Partitionierte Runge-Kutta verfahren zur numerischen losung von Bichtsteifen un Steifen Anfangswertaufgaben.* Technische Universitaet Muenchen. Institut fuer Mathematik.*TUM-M8304.*1983. 018191 Gnatz, R.*Certification by program construction from specifications. (Problems of certification of graphics software).* Technische Universitaet Munchen. Institut fuer Informatik.*TUM-I8106.*1981. 018192 Steinbrueggen, R.* Program development using transformational expressions.* Technische Universitaet Munchen. Institut fuer Informatik.*TUM-I8206.*1982. 018193 Eichholz, S. Schneider, H.*BS subscript 0: Modellierung eines Betriebssystems mot Hilfe von ITS.* Technische Universitaet Munchen. Institut fuer Informatik.* TUM-I8301.*1983. 018194 Kiebling, W. Landherr, G.*A quantitative comparison of Locke protocols for centralized databases.* Technische Universitaet Munchen. Institut fuer Informatik.* TUM-I8302.*1983. 018195 Wirsing, M. Pepper, P. Partsch, H. Dosch, W. Broy, M.*On hierarchies of abstract data types.* Technische Universitaet Munchen. Institut fuer Informatik.* TUM-I8303.*1983. 018196 Geisberger, J. Reiser, A.*Sperrprotokolle fuer transaktionen mit prioritaeten.* Technische Universitaet Munchen. Institut fuer Informatik.*TUM-I8304.*1983. 018197 Griswold, R.E.*An overview of the Icon programming language.* Arizona U. Comp.Sci.Dept.*TR 83-03a.*1983. 018198 Anderson, A.J. Griswold, R.E.*Unifying list and string processing in Icon.* Arizona U. Comp.Sci.Dept.*TR 83-04.* 1983. 018199 Nielsen, T.* Throughput for communications networks with mobile users* Arizona U.. Comp.Sci.Dept.*TR 83-07.*1983. 018200 Myers, E.W.*An applicative random access stack.* Arizona U. Comp.Sci.Dept.*TR 83-09.*1983. 018201 Aviles, P.* Prescribing conformal complete metrics with given positive Gaussian curvature in two dimensional Euclidean space.* California U., Berkeley. Math. Sciences Res.Inst.*MSRI 049-83.*1983. 018202 Rao, J.N.K. Wu, C.F.J.* Inference from stratified samples: second order analysis of three methods for nonlinear statistics.* California U., Berkeley. Math. Sciences Res.Inst.*MSRI 050-83.*1983. 018203 Alexander, K.* Probability inequalities for empirical processes and a law of the iterated logarithm.* California U., Berkeley. Math. Sciences Res.Inst.*MSRI 051-83.*1983. 018205 Melrose, R.* Forward well posedness from hypoellipticity and approximability.* California U., Berkeley. Math. Sciences Res.Inst.*MSRI 052-83.*1983. 018206 Mulase, M.* Complete integrability of the Kadomtsev Petviashvili equation.* California U., Berkeley. Math. Sciences Res.Inst.*MSRI 053-83.*1983. 018207 Marvizi, S.* Fanning curve of Lagrangian manifolds and geodesic flow.* California U., Berkeley. Math. Sciences Res.Inst.*MSRI 054-83.*1983. 018208 Lalley, S.P.* Limit theorems for first passage times in linear and nonlinear renewal theory.* California U., Berkeley. Math. Sciences Res.Inst.*MSRI 055-83.*1983. 018209 Sylvester, J.*Some conditions equivalent to strong hyperbolicity for first order systems with constant coefficients.* California U., Berkeley. Math. Sciences Res.Inst.*MSRI 056-83.*1983. 018210 Sylvester, J.*On the dimension of spaces of linear transformation satisfying rank conditions.* California U., Berkeley. Math. Sciences Res.Inst.*MSRI 057-83.*1983. 018211 Gardner, R.B. Shadwick, W.F.*A simple characterization of the contact system on J superscript k (E) superscript *.* California U., Berkeley. Math. Sciences Res.Inst.*MSRI 058-83.*1983. 018212 Reilly, R.C.* Affine geometry and the form of the equation of a hypersurface.* California U., Berkeley. Math. Sciences Res.Inst.*MSRI 059-83.*1983. 018213 Kuiper, N.H.* Taut sets in three space are very special.* California U., Berkeley. Math. Sciences Res.Inst.*MSRI 060-83.*1983. 018214 Soloman, B.*On the Gauss map of an area minimizing hypersurface.* California U., Berkeley. Math. Sciences Res.Inst.*MSRI 061-83.*1983. 018215 Gasqui, J. Goldschmidt, H.* Infinitesimal rigidity of S superscript 1 x real projective n space.* California U., Berkeley. Math. Sciences Res.Inst.*MSRI 062-83.*1983. 018216 Johnstone, I.* Admissibility, difference equations and recurrence in estimating a Poisson mean.* California U., Berkeley. Math. Sciences Res.Inst.*MSRI 063-83.*1983. 018217 Kung-Ching, C.*Applications of homology theory to some problems in differential equations.* California U., Berkeley. Math. Sciences Res.Inst.*MSRI 064-83.*1983. 018218 Estabrook, F.B.* Invariant differential systems and intrinsic coordinates.* California U., Berkeley. Math. Sciences Res.Inst.*MSRI 065-83.*1983. 018219 Treibergs, A.* Existence and convexity for hyperspheres of prescribed mean curvature.* California U., Berkeley. Math. Sciences Res.Inst.*MSRI 066-83.*1983. 018220 Freedman, D.A. Peters, S.C.* Bootstrapping an econometric model: Some empirical results.* California U., Berkeley. Math. Sciences Res.Inst.*MSRI 067-83.*1983. 018221 Freedman, D.A. Peters, S.C.* Bootstrapping a regression equation: Some empirical results.* California U., Berkeley. Math. Sciences Res.Inst.*MSRI 068-83.*1983. 018222 Jewell, W.S.*A general framework for learning curve reliability growth models.* California U., Berkeley. O.R. Center.*ORC 79-11.*1979 (revised April, 1983). 018223 Jewell, W.S.* Enriched multinormal priors revisited.* California U., Berkeley. O.R. Center.*ORC 82-14.*1982. 018224 Ross, S.M. Schechner, Z.*Using simulation to estimate first passage distributions.* California U., Berkeley. O.R. Center.*ORC 83-01.*1983. 018225 Agrawal, A. Satyanarayana, A.* Source to K terminal reliability analysis of rooted communication networks.* California U., Berkeley. O.R. Center.*ORC 83-02.*1983. 018226 Derman, C. Lieberman, G.J. Ross, S.M.*On the use of replacements to extend system life.* California U., Berkeley. O.R. Center.*ORC 83-03.*1983. 018227 Wong, F.L.*Interactive cell editor: A symbolic editor for NMOS gate cells.* Illinois U. Comp.Sci.Dept.* UIUCDCS-R-82-1104.*1982. 018228 Huson, C.A.*An in-line subroutine expander for Parafrase.* Illinois U. Comp.Sci.Dept.*UIUCDCS-R-82-1118.*1982. 018229 Michalski, R.S.*A theory and methodology of inductive learning.* Illinois U. Comp.Sci.Dept.*UIUCDCS-R-83-1122.* 1983. 018230 Gajski, D. Kuck, D. Lawrie, D. Sameh, A.*Construction of a large scale multiprocessor.* Illinois U. Comp.Sci.Dept.* UIUCDCS-R-83-1123.*1983. 018231 Gallopoulos, E.* Numerical experiments with the massively parallel processor.* Illinois U. Comp.Sci.Dept.* UIUCDCS-R-83-1124.*1983. 018232 Cheng, R. Liu, J.W.S.* Reliable synchronization in computer networks.* Illinois U. Comp.Sci.Dept.*UIUCDCS-R-83-1126.* 1983. 018233 Healey, S.T.* IBL - a language for abstract and geometric VLSI layout.* Illinois U. Comp.Sci.Dept.* UIUCDCS-R-83-1127.*1983. 018234 Eisenbarth, B. Ziviani, N. Gonnet, G.H. Mehlhorn, K. Wood, D.*The theory of fringe analysis and its application to 2-3 trees and B trees.* Waterloo U. Comp.Sci.Dept.* Res.rpt. CS-82-17.*1982. 018235 Gonnet, G.H. Ziviani, N.*Expected behaviour analysis of AVL trees.* Waterloo U. Comp.Sci.Dept.*Res.rpt. CS-82-18.* 1982. 018236 Nait Abdallah, M.A.* Sort theory.* Waterloo U. Comp.Sci.Dept.*Res.rpt. CS-82-19.*1982. 018237 Pachl, J.K.*Finding pseudoperipheral nodes in graphs.* Waterloo U. Comp.Sci.Dept.*Res.rpt. CS-82-20.*1982. 018238 Munro, J.I. Poblete, P.V.*Lower bound for determining the median.* Waterloo U. Comp.Sci.Dept.*Res.rpt. CS-82-21.* 1982. 018239 Poblete, P.V. Munro, J.I.*The analysis of a fringe heuristic for binary search trees.* Waterloo U. Comp.Sci.Dept.*Res.rpt. CS-82-22.*1982. 018240 Poblete, P.V.*An alternative approach to the analysis of late binding trees.* Waterloo U. Comp.Sci.Dept.*Res.rpt. CS-82-23.*1982. 018241 Culik, K., II Juergensen, H.* Programmable finite automata for VLSI.* Waterloo U. Comp.Sci.Dept.*Res.rpt. CS-82-24.* 1982. 018242 Edelsbrunner, H. Overmars, M.H. Wood, D.* Graphics in flatland: A case study.* Waterloo U. Comp.Sci.Dept.* Res.rpt. CS-82-25.*1982. 018243 Soisalon-Soininen, E. Wood, D.*Optimal algorithms to compute the closure of a set of iso rectangles.* Waterloo U. Comp.Sci.Dept.*Res.rpt. CS-82-26.*1982. 018244 Gonnet, G.H. Munro, J.I. Wood, D.* Direct dynamic structures for some line segment problems.* Waterloo U. Comp.Sci.Dept.*Res.rpt. CS-82-27.*1982. 018245 Albert, J. Wood, D.* Checking sets, test sets, rich languages and commutatively closed languages.* Waterloo U. Comp.Sci.Dept.*Res.rpt. CS-82-28.*1982. 018246 Gonnet, G.H. Olivie, H.F. Wood, D.* Height ratio balances trees.* Waterloo U. Comp.Sci.Dept.*Res.rpt. CS-82-29.* 1982. 018247 Culik, K., II Wood, D.*A note on some trees similarity measures.* Waterloo U. Comp.Sci.Dept.*Res.rpt. CS-82-30.* 1982. 018248 Maurer, H.A. Salomaa, A. Welzl, E. Wood, D.* Dense intervals of linguistic families.* Waterloo U. Comp.Sci.Dept.*Res.rpt. CS-82-31.*1982. 018249 Corless, R.M.*A feasibility study of the use of COLSYS in the solution of systems of partial differential equations.* Waterloo U. Comp.Sci.Dept.*Res.rpt. CS-82-32.* 1982. 018250 Ottmann, T. Widmayer, P. Wood, D.*A worst-case effecient algorithm for hidden line elimination.* Waterloo U. Comp.Sci.Dept.*Res.rpt. CS-82-33.*1982. 018251 Mavaddat, F. Cheng, S.K.S.* Speech recognition using linear prediction residue and a reduced feature space.* Waterloo U. Comp.Sci.Dept.*Res.rpt. CS-82-34.*1982. 018252 Nait Abdallah, M.A.*The necessity of double bundle structure in sort theory.* Waterloo U. Comp.Sci.Dept.* Res.rpt. CS-82-36.*1982. 018253 Ottmann, T. Widmayer, P. Wood, D.*A fast algorithm for boolean mask operations.* Waterloo U. Comp.Sci.Dept.* Res.rpt. CS-82-37.*1982. 018254 Gonnet, G.H. Larson, P.-A.*External hashing with limited internal storage.* Waterloo U. Comp.Sci.Dept.*Res.rpt. CS-82-38.*1982. 018255 George, A. Ng, E.*Solution of sparse underdetermined systems of linear equations.* Waterloo U. Comp.Sci.Dept.* Res.rpt. CS-82-39.*1982. 018256 Geddes, K.O. Gonnet, G.H. Char, B.W.* MAPLE user's manual, second edition.* Waterloo U. Comp.Sci.Dept.*Res.rpt. CS-82-40.*1982. 018257 Singh, B. Beatty, J.C. Booth, K.S. Ryman, R.*A graphics editor for Benesh movement notation.* Waterloo U. Comp.Sci.Dept.*Res.rpt. CS-82-41.*1982. 018258 Kochanek, D.H.U. Bartels, R. Booth, K.S.*A computer system for smooth keyframe animation.* Waterloo U. Comp.Sci.Dept.*Res.rpt. CS-82-42.*1982. 018259 Breslin, P.H. Beatty, J.C.*A powerful interface to a high-performance Raster graphics system.* Waterloo U. Comp.Sci.Dept.*Res.rpt. CS-82-45.*1982. 018260 Plebon, D.A. Booth, K.S.* Interactive picture creation systems.* Waterloo U. Comp.Sci.Dept.*Res.rpt. CS-82-46.* 1982. 018261 Barsky, B.A. Beatty, J.C.*Varying the betas in beta splines.* Waterloo U. Comp.Sci.Dept.*Res.rpt. CS-82-49.* 1982. 018262 Vuong, S.T. Cowan, D.D.* UNISPEX - A unified model for protocol specification and verification.* Waterloo U. Comp.Sci.Dept.*Res.rpt. CS-82-52.*1982. 018263 Ottmann, T. Parker, D.S. Rosenberg, A.L. Six, H.W. Wood, D.* Minimal cost brother trees.* Waterloo U. Comp.Sci.Dept.* Res.rpt. CS-82-54.*1982. 018264 Ottmann, T. Wood, D.* Dynamical sets of points.* Waterloo U. Comp.Sci.Dept.*Res.rpt. CS-82-56.*1982. 018265 Ashcroft, E.A. Wadge, W.W.*A summary of Lucid for programmers.* Waterloo U. Comp.Sci.Dept.*Res.rpt. CS-82-57.*1982. 018266 Varah, J.M.*A computational approach to parameter estimation in ordinary differential equations.* Waterloo U. Comp.Sci.Dept.*Res.rpt. CS-82-58.*1982. 018267 Ng, E.G.-Y.* Row elimination in sparse matrices using rotations.* Waterloo U. Comp.Sci.Dept.*Res.rpt. CS-83-01, Ph.D. Thesis. Ng, E.G.-Y.*1983. 018268 Gueting, R.H. Wood, D.*Finding rectangle intersections by divide and conquer.* Waterloo U. Comp.Sci.Dept.*Res.rpt. CS-83-03.*1983. 018269 Larson, P.-A. Kajla, A.* File organization: Implementation of a method guaranteeing retrieval in one access.* Waterloo U. Comp.Sci.Dept.*Res.rpt. CS-83-04.*1983. 018270 Conn, A.R. O'Neill, P.F.* Nondifferentiable optimization and worse.* Waterloo U. Comp.Sci.Dept.*Res.rpt. CS-83-05.* 1983. 018271 Ottmann, T. Soisalon-Soininen, E. Wood, D.*On the definition and computation of rectilinear convex hulls.* Waterloo U. Comp.Sci.Dept.*Res.rpt. CS-83-07.*1983. 018272 Dymond, P.W. Tompa, M.* Speedup of deterministic machines by synchronous parallel machines.* Waterloo U. Comp.Sci.Dept.*Res.rpt. CS-83-08.*1983. 018273 Watt, S.*Arrays and tables in Maple: Supplement to the Maple user's manual.* Waterloo U. Comp.Sci.Dept.*Res.rpt. CS-83-10.*1983. 018274 Ottmann, T. Schrapp, M. Wood, D.*On 1-pass top-down update algorithms for stratified search trees.* Waterloo U. Comp.Sci.Dept.*Res.rpt. CS-83-11.*1983. 018275 Bartels, R.H. Mahdavi-AmiriN.* On generating test probles for nonlinear programming algorithms.* Waterloo U. Comp.Sci.Dept.*Res.rpt. CS-83-12.*1983. 018276 George, A. Liu, J. Ng, E.* Row ordering schemes for sparse givens transformations. I. Bipartite graph model.* Waterloo U. Comp.Sci.Dept.*Res.rpt. CS-83-13.*1983. 018277 George, A. Ng, E.*A partial pivoting implementation of Gaussian elimination for sparse systems.* Waterloo U. Comp.Sci.Dept.*Res.rpt. CS-83-15.*1983. 018278 Char, B.W. Geddes, K.O. Gonnet, G.H.*An introduction to Maple: Sample interactive session.* Waterloo U. Comp.Sci.Dept.*Res.rpt. CS-83-16.*1983. 018279 Edelsbrunner, H. Leeuwen, J. van Ottmann, T. Wood, D.* Computing the connected components of simple rectilinear geometrical objects in D-space.* Waterloo U. Comp.Sci.Dept.*Res.rpt. CS-83-17.*1983. 018280 Larson, P.-A.*Further analysis of external hashing with fixed length separators.* Waterloo U. Comp.Sci.Dept.* Res.rpt. CS-83-18.*1983. 018281 Ottmann, T. Soisalon-Soininen, E. Wood, D.* Rectilinear convex hull partitioning of sets of rectilinear polygons.* Waterloo U. Comp.Sci.Dept.*Res.rpt. CS-83-19.*1983. 018282 Wood, D.*The contour problem for rectilinear polygons.* Waterloo U. Comp.Sci.Dept.*Res.rpt. CS-83-20.*1983. 018283 Conn, A.R. Gould, N.I.M.*On the location of direction of infinite descent for non-linear programming algorithms.* Waterloo U. Comp.Sci.Dept.*Res.rpt. CS-83-21.*1983. 018284 Korach, E. Rotem, D. Santoro, N.* Distributed ranking.* Waterloo U. Comp.Sci.Dept.*Res.rpt. CS-83-22.*1983. 018285 Malcolm, M.A. Rogers, L.D. Spracklen, J.E.*An acknowledging contention algorithm suitable for local radio networks.* Waterloo U. Comp.Sci.Dept.*Res.rpt. CS-83-23.*1983. 018286 Boral, H. DeWitt, D.J.* Database machines: An idea whose time has passed? A critique of the future of database machines.* Wisconsin U. Comp.Sci.Dept.*Tech.rpt. 504.* 1983. 018287 Qi, L.* Base set strategy for solving linearly constrained convex programs.* Wisconsin U. Comp.Sci.Dept.*Tech.rpt. 505.*1983. 018288 Shiau, T.-H.* Iterative linear programming for linear complementarity and related problems.* Wisconsin U. Comp.Sci.Dept.*Tech.rpt. 507, Ph.D. Thesis. Shiau, T.-H.* 1983. 018289 Smith, J.E. Pleszkun, A.R. Katz, R.H. Goodman, J.R.* PIPE: A high performance VLSI architecture.* Wisconsin U. Comp.Sci.Dept.*Tech.rpt. 512.*1983. 018290 Schoof, R.* Elliptic curves over finite fields and the computation of square roots mod p.* Amsterdam U. Math Dept.*Rpt. 83-09.*1983. 018291 Torenvliet, L. Emde Boas, P. van*The reconstruction and optimization of Trie Hashing functions.* Amsterdam U. Math Dept.*Rpt. 83-19.*1983. 018292 Sinha, P.S.* Optimization techniques in computer system design and load control.* British Columbia U. Comp.Sci.Dept.*Tech.rpt. 81-16.*1981. 018293 Alagar, V.S.* Range response: An output modification technique and an analysis of its effectiveness for security of statistical databases.* Concordia U. Comp.Sci.Dept.*1983. 018294 Nicola, R. de Hennessy, M.C.B.*Testing equivalences for processes.* Edinburgh U. Comp.Sci.Dept.*CSR-123-82.*1983, revised. 018295 Feldman, J.S. Beech, D.*The integrated data model: A database perspective.* Hewlett Packard Co. Comp.Sci.Lab.* CSL-83-013; Hewlett Packard Co. Comp.Res. Center.* CRC-TR-83-003.*1983. 018296 Beech, D.*A reference model for command and response languages.* Hewlett Packard Co. Comp.Sci.Lab.*CSL-83-014; Hewlett Packard Co. Comp.Res. Center.*CRC-TR-83-004.* 1983. 018297 Beech, D.*Introducing the integrate data model.*Hewlett Packard Co.Co. Comp.Sci.Lab.*CSL-83-015, Hewlett Packard Co. Comp.Res. Center.*CRC-TR-83-005.*1983. 018298 Yang, S.*A string pattern matching algorithm for pattern equation systems with reversal.* Iowa U. Comp.Sci.Dept.* Tech.rpt. 83-03.*1983. 018299 Bhat, K.V.S.*An optimum reliable network architecture.* Iowa U. Comp.Sci.Dept.*Tech.rpt. 83-006.*1983. 018300 Chan, M.Y.* Query complexity for statistical database security.* Hong Kong U. Comp. Studies and Appl. Centre.* TR-A5-83.*1983. 018301 Yuen, C.K.* Dual stroke method for Chinese character input.* Hong Kong U. Comp. Studies and Appl. Centre.*TR-A6-83.* 1983. 018302 Bokhari, S.H. Raza, A.D.*Reducing the diameters of arrays.* Lahore. University of Engineering & Technology. E.E. Dept. Comp.Eng.Div.*Res.rpt. EECE-83-01.*1983. 018303 Igbal, M.A. Bokhari, S.H.*New heuristics for the mapping problem.* Lahore. University of Engineering & Technology. E.E. Dept. Comp.Eng.Div.*Res.rpt. EECE-83-02.*1983. 018304 Magnusson, B.* Code objects: A support for incremental compilation.* Lund U. Comp.Sci.Dept.*1983. 018305 Lee, C.S.G. Lee, B.H.* Resolved motion adaptive control for techanical manipulators.* Michigan U. Computing Res.Lab.* CRL-TR-22-83.*1983. 018306 Shin, K.G. Krishna, C.M. Lee, Y.H.*A unified method for evaluating real time computer controllers: A case study.* Michigan U. Computing Res.Lab.*CRL-TR-23-83.*1983. 018307 Rounds, W.C.*On the relationships between Scott domains, synchronization trees, and metric spaces.* Michigan U. Computing Res.Lab.*CRL-TR-25-83.*1983. 018308 Panzieri, F.*Software and hardware of high integrity systems project: Final report.* Newcastle upon Tyne U. Computing Lab.*No. 179.*1982. 018309 Cristian, F.*A rigorous approach to fault tolerant system development.* Newcastle upon Tyne U. Computing Lab.*No. 184.*1983. 018310 Le Chenadec, P.*Formes canoniques dans les algebres finiment prosentees (and annexe).* Paris-Sud. Universite. Centre d'Orsay.*No. d'ordre 3472, Ph.D. Thesis. Le Chenadec, P.*1983. 2 volumes. 018322 Le Tallec, P. Ruas, V.*On the convergence of the bilinear velocity constant pressure finite element method in viscous flow.* Pontificia U., Rio de Janeiro. Info.Dept.* No. 04/83.*1983. 018323 Tucherman, L. Furtado, A.L. Casanova, M.A.*A pragmatical approach to structured database design.* Pontificia U., Rio de Janeiro. Info.Dept.*No. 11/83.*1983. 018324 Albrecht, P.*Numerical treatment of ordinary differential equations: The theory of A-methods.* Pontificia U., Rio de Janeiro. Info.Dept.*No. 12/83.*1983. 018325 Allen, J.F.* ARGOT: A system overview.* Rochester U. Comp.Sci.Dept.*Tech.rpt. 101.*1982. 018326 Neufeld, E.M. Colbourn, C.J.*The most reliable series parallel networks.* Saskatchewan U. Computational Sci.Dept.*Rpt. 83-07.*1983. 018327 Collier, P.*The virtuous nature of variables.* Tasmania U. Info.Sci.Dept.*1983. 018328 Konstantas, D.* Virtual time CSMA: A study.* Toronto U. Comp. Systems Res. Group.*CSRG-149.*1983. 018329 Dawes, R.* Constructions of minimally K connected graphs.* Toronto U. Comp.Sci.Dept.*Tech.rpt. 165/83, Ph.D. Thesis. Dawes, R.*1983. 018330 Aleliunas, R.* Probabilistic parallel communication.* Toronto U. Comp.Sci.Dept.*Tech.rpt. 166/83, Ph.D. Thesis. Aleliunas, R.*1983. 018331 Symm, G.T. Wichmann, B. Kok, J. Winter, D.T.*Guidelines for the design of large modular scientific libraries in Ada* - Second interim report.* U.K. National Physical Lab. Info. Technology and Computing Div.*DITC 28/83.*1983. 018332 Lawrance, A.J. Lewis, P.A.W.*Simple dependent pairs of exponential and uniform random variables.* U.S. Naval Postgraduate Sch.*NPS55-82-011.*1982. 018333 Lewis, P.A.W. Lawrance, A.J.*Stationary exponential time series: Further model development and a residual analysis.* U.S. Naval Postgraduate Sch.*NPS55-83-008.* 1983. 018334 Johnson, R.W.*Algorithms for single signal and multisignal minimum cross entropy spectrum analysis.* U.S. Naval Res.Lab.*NRL rpt. 8667.*1983. 018335 Johnson, R. Shore, J.E.*Which is the better entropy expression for speech processing: -S log S or log S?* U.S. Naval Res.Lab.*NRL rpt. 8704.*1983. 018336 Shore, J.E.*On a relation between maximum likelihood classification and minimum cross entropy classification.* U.S. Naval Res.Lab.*NRL rpt. 8707.*1983. 018337 Johnson, R.W. Shore, J.* Multisignal minimum cross entropy spectrum analysis with weighted priors.* U.S. Naval Res.Lab.*NRL rpt. 8731.*1983. 018338 Nierergelt, J.* Errors in dialog design and how to avoid them.*No issuing agency indicated (author's address: Institut fuer Informatik/ETH/CH-8092 Zurich/Switzerland).* 1982. VOL. 5, NO. 12 11/15/83 018339 Doran, R.W.*Variations on the high speed adder.* Auckland U. Comp.Sci.Dept.*Rpt. 29.*1983. 018340 Burrage, K. Chipman, F.H.*The stability properties of singly implicit general linear methods.* Auckland U. Comp.Sci.Dept.*Rpt. 30.*1983. 018341 Hackman, S.T. Shephard, R.W.* Production networks: a dynamic model of production.* California U., Berkeley. O.R. Center.*ORC 83-04.*1983. 018342 Agrawal, A. Barlow, R.E.*A survey of network reliability.* California U., Berkeley. O.R. Center.*ORC 83-05.*1983. 018343 Oliver, R.M.* Forcasting seasonal demand.* California U., Berkeley. O.R. Center.*ORC 83-06.*1983. 018344 Demange, G. Gale, D.*A strategy proof allocation mechanism for two-sided matching markets.* California U., Berkeley. O.R. Center.*ORC 83-08.*1983. 018345 Jantzen, M. Kudlek, M.* Homomorphic images of sentential form languages defined by semi thue systems.* Hamburg U. Fachbereich Informatik.*Bericht Nr. 89.*1983. 018346 Marnitz, J.*Behandlung von Wartenetzen mit mehreren Subketten nach dem Verfahren der operationalen analyse.* Hamburg U. Fachbereich Informatik.*Bericht Nr. 96.*1983. 018347 Kozen, D. Parikh, R.*A decision procedure for the propositional mu-calculus.* IBM Watson Res. Center.*RC 09987.*1983. 018348 Walker, A.* SYLLOG: An approach to Prolog for nonprogrammers.* IBM Watson Res. Center.*RJ 3950.*1983. 018349 Hauser, C. Reitman, R.*Proving fairness of concurrent programs.* IBM Watson Res. Center.*RJ 3931.*1983. 018350 Bux, W. Closs, F. Kuemmerle, K. Keller, H. Mueller, H.R.* Architecture and design of a reliable token ring network.* IBM Watson Res. Center.*RZ 1224.*1983. 018251 Chang, C.L.*An experience of building an expert system with Prolog.* IBM Watson Res. Center.*RJ 3925.*1983. 018352 Tantawi, A.N. Ruschitzka, M.* Performance analysis of checkpointing strategies.* IBM Watson Res. Center.*RC 09999.*1983. 018353 Halpern, J. Manna, Z. Moszkowski, B.*A hardware semantics based on temporal intervals.* IBM Watson Res. Center.*RJ 3877.*1983. 018354 Kim, W. Lorie, R. McNabb, D. Plouffe, W.* Nested transactions for engineering design databases.* IBM Watson Res. Center.*RJ 3934.*1983. 018355 Bullen, C.V. Bennett, J.L.* Office workstation use by administrative managers and professionals.* IBM Watson Res. Center.*RJ 3890.*1983. 018356 Blum, A.M. Jaffe, E. MacNair, E.A. Kurose, J.F. Sauer, C.H.* The research queueing package: An introduction and update.* IBM Watson Res. Center.*RC 10016.*1983. 018357 Baratz, A.E. Segall, A.* Reliable link initialization procedures.* IBM Watson Res. Center.*RC 10032.*1983. 018358 Chandra, A.K. Vardi, M.Y.*The implication problem for functional and inclusion dependencies is undecidable.* IBM Watson Res. Center.*RC 09980.*1983. 018359 Strom, R. Halim, N.*A new programming methodology for long lived software systems.* IBM Watson Res. Center.*RC 09979.*1983. 018360 Gopal, I.S. Jaffe, J.M.*The auctioneer's problem.* IBM Watson Res. Center.*RC 09974.*1983. 018361 Towsley, D.*An approximate analysis of multiprocessor systems.* IBM Watson Res. Center.*RC 10020.*1983. 018362 Walker, A. Porto, A.* KBO1, a knowledge based garden store assistant.* IBM Watson Res. Center.*RJ 3928.*1983. 018363 Lomet, D.B.*Making pointers safe in system programming languages.* IBM Watson Res. Center.*RC 10030.*1983. 018364 Dolev, D. Reischuk, R. Strong, H.R.*Early stopping in Byzantine agreement.* IBM Watson Res. Center.*RJ 3915.* 1983. 018365 Lorie, R. Plouffe, W.* Relational databases for engineering data.* IBM Watson Res. Center.*RJ 3847.*1983. 018366 Wilms, P.F. Lindsay, B.G. Selinger, P.G.*"I wish I were over there": Distributed execution protocols for data definition in R*.* IBM Watson Res. Center.*RJ 3892.*1983. 018367 Coppersmith, D. Klawe, M.M. Pippenger, N.J.* Alphabetic minimax trees of degree at most t.* IBM Watson Res. Center.*RJ 3878.*1983. 018368 Goyal, A. Agerwala, T.*Design considerations in some shared memory systems.* IBM Watson Res. Center.*RC 10028.*1983. 018369 Bonanni, P.G.* High speed deadbeat control of a nonlinear hydraulic robot.* IBM Watson Res. Center.*RC 10023.*1983. 018370 Tsai, R.Y. Hauang, T.S.* Uniqueness and estimation of 3-D motion parameters and surface structures of rigid objects.* IBM Watson Res. Center.*RC 09986.*1983. 018371 Yemini, S. Berry, D.M.*A modular verifiable exception handling mechanism.* IBM Watson Res. Center.*RC 09993.* 1983. 018372 Sasao, T.* Input variable assignment and output phase optimization of PLA's.* IBM Watson Res. Center.*RC 10003.* 1983. 018373 Dahmen, W. Micchelli, C.A.*Recent progress in multivariate splines.* IBM Watson Res. Center.*RC 09969.*1983. 018374 Ditlow, G. Brown, A.*The Delta-I simultaneous switching problem.* IBM Watson Res. Center.*RC 10015.*1983. 018375 Selinger, R.D.*The design and evaluation of single and multiple processor office workstations.* IBM Watson Res. Center.*RJ 3895 & RJ 3896 (part 2: Appendixes), Ph.D. Thesis. Selinger, R.D. (University of California at Berkeley).*1983. 2 volumes. 018376 May, C.* LARQ: A study in the design and evaluation of a memory management algorithm.* IBM Watson Res. Center.*RC 10048, Ph.D. Thesis. May, C.(Yale University).*1983. 018377 Rissanen, J.*A universal data compression system.* IBM Watson Res. Center.*RJ 3936.*1983. 018378 Pickover, C.A. Dixon, N.R.* Spectrographic representation for speech synthesizer control functions.* IBM Watson Res. Center.*RC 10049.*1983. 018379 Keller, H. Mueller, H.R. Meyr, H.* Transmission design criteria for a synchronous token ring.* IBM Watson Res. Center.*RZ 1226.*1983. 018380 Fagin, R.* Armstrong databases.* IBM Watson Res. Center.*RJ 3440.*1982. 018381 Wahl, F. So, S. Wong, K.* Hybrid high precision surface inspection.* IBM Watson Res. Center.*RJ 3498.*1982. 018382 Koenig, W. Lorie, R.A.*Storage of VLSI physical designs in a relational database.* IBM Watson Res. Center.*RJ 3548.* 1982. 018383 Dolev, D. Warmuth, M.K.* Profile scheduling of opposing forests and level orders.* IBM Watson Res. Center.*RJ 3553.*1982. 018384 Jenny, C.J.* Placing files and processes in distributed systems: A general method considering resources with limited capacity.* IBM Watson Res. Center.*RZ 1157.*1982. 018385 Boudol, G.* Computational semantics of terms rewriting systems.* Inria.*Rapports de Recherche 192.*1983. 018386 Besnard, P. Quiniou, R. Quinton, P. Saint-Dizier, P. Siroux, J. Trilling, L.*Dialogue et representation des informations dans un systeme de messagerie intelligent.* Inria.*Rapports de Recherche 193.*1983. 018387 Chailloux, J. Hullot, J.-M. Levy, J.-J. Vuillemin, J.*Le systeme lucifer d'aide a la conception de circuits integres.* Inria.*Rapports de Recherche 196.*1983. 018388 Berry, G. Curien, P.L. Levy, J.-J.* Full abstraction for sequential languages: The state of the art.* Inria.* Rapports de Recherche 197.*1983. 018389 Labit, C.*Estimation de mouvement dans une sequence d'images de television en vue d'un codage avec compensation de mouvement.* Inria.*Rapports de Recherche 198.*1983. 018390 Abiteboul, S.* Algebraic analogues to fundamental notions of query and dependency theory.* Inria.*Rapports de Recherche 201.*1983. 018391 Richard, J.F.*Logique du fonctionnement et logique de l'utilisation.* Inria.*Rapports de Recherche 202.*1983. 018392 Gardarin, G. Valduriez, P. Viemont, Y.*Les arbres de predicats.* Inria.*Rapports de Recherche 203.*1983. 018393 Marie, R. Pellaumail, J.*Regime stationnaire pour une file M/H/1 avec impatience.* Inria.*Rapports de Recherche 205.* 1983. 018394 Parthasarathy, S.*On the representation of petri nets as state difference equations.* Inria.*Rapports de Recherche 208.*1983. 018395 Despeyroux, J.*An algebraic specification of a Pascal compiler.* Inria.*Rapports de Recherche 209.*1983. 018396 Hullot, J.-M.* CEYX, a multiformalism programming environment.* Inria.*Rapports de Recherche 210.*1983. 018397 Melese, B.*Mentor rapport: Manipulation de textes structures sous mentor.* Inria.*Rapports Techniques 023.* 1983. 018398 Kirkerud, B.* Completeness of Hoare calculi revisited.* Oslo U. Informatics Inst.*Res.Rpt. 71.*1982. 018399 Koch, P.E.* Jackson theorems for generalized polynomials with special applications to trigonometric and hyperbole functions.* Oslo U. Informatics Inst.*Res.Rpt. 72.*1982. 018400 Krogdahl, S.* Protection in Simula: A new proposal.* Oslo U. Informatics Inst.*Res.Rpt. 73.*1982. 018401 Kirkerud, B.* Undefinedness in assertion languages.* Oslo U. Informatics Inst.*Res.Rpt. 74.*1982. 018402 Koch, P.E.* Collocation by L splines at transformed Gaussian points.* Oslo U. Informatics Inst.*Res.Rpt. 75.* 1983. 018403 Nossum, R.*A proof technique based on simplication.* Oslo U. Informatics Inst.*Res.Rpt. 76.*1983. 018404 Ronen, D. Perl, Y.* Heuristics for finding a maximum number of disjoint bounded paths.* Rutgers U. Comp.Sci.Dept.* DCS-TR-126.*1983. 018405 Dowd, M. Saks, M. Rudolph, L.*The balanced sorting network.* Rutgers U. Comp.Sci.Dept.*DCS-TR-127.*1983. 018406 Nudel, B.*Solving the general consistent labeling (or constraint satisfaction) problem: Two algorithms and their expected complexities.* Rutgers U. Comp.Sci.Dept.* DCS-TR-128.*1983. 018407 Paull, M.C. Ryder, B.G.* Incremental data flow analysis algorithms.* Rutgers U. Comp.Sci.Dept.*DCS-TR-131.*1983. 018408 Vichnevetsky, R. Pariser, E.C.*High order numerical Sommerfeld boundary conditions: Theory and experiments.* Rutgers U. Comp.Sci.Dept.*DCS-TR-132.*1983. 018409 Sridharan, N.S. Bresina, J.L. Schmidt, C.F.*Evolution of a plan generation system.* Rutgers U. Comp.Sci.Res.Lab.* CBM-TR-128.*1983. 018410 Sridharan, N.S. Bresina, J.L.* Knowledge structures for modular planning system.* Rutgers U. Comp.Sci.Res.Lab.* CBM-TR-133.*1983. 018411 Sridharan, N.S. Bresina, J.L.*A mechanism for the management of partial and indefinite descriptions.* Rutgers U. Comp.Sci.Res.Lab.*CBM-TR-134.*1983. 018412 Keller, R.M.* Learning by reexpressing concepts for efficient recognition.* Rutgers U. Comp.Sci.Res.Lab.* LCSR-TR-44.*1983. 018413 Mitchell, T.M.* Learning and problem solving (1983 Computers and Thought Award lecture).* Rutgers U. Comp.Sci.Res.Lab.*LCSR-TR-45.*1983. 018414 Nagel, D.* Concept learning by building and applying transformations between object descriptions.* Rutgers U. Comp.Sci.Res.Lab.*LRP-TR-15.*1983. 018415 Judd, J.S. Letilley, C.J.* Memory and communication tradeoffs during screen editor sessions.* Saskatchewan U. Computational Sci.Dept.*Rpt. 83-08.*1983. 018416 Goforth, D.* LEPUS: An object oriented extension of turtle geometry.* Saskatchewan U. Computational Sci.Dept.*Rpt. 83-09.*1983. 018417 Peachey, D.R.*An architecture for plan based computer assisted instruction.* Saskatchewan U. Computational Sci.Dept.*Rpt. 83-11.*1983. 018418 Carbonell, J.G.*The role of user modelling in natural language interface design.* Carnegie Mellon U. Comp.Sci.Dept.*CMU-CS-83-115.*1983. 018419 Citrini, C. Crespi-Reghizzi, S. Mandrioli, D.*Chains of deterministic push down transducers.* Milan. Politecnico. Dipartimento di Elettronica. Lab. di Calcolatori.* Rapporto interno n. 83-13.*1983. 018420 Marlin, C.*A methodical approach to the design of programming languages and its application to the design of a corouting language.* Iowa U. Comp.Sci.Dept.* Tech.rpt. 83-05.*1983. 018421 Nissen, J.C.D. Wallis, P. Wichmann, B.A.* Ada Europe guidelines for the protability of Ada programs.* U.K. National Physical Lab. Info. Technology and Computing Div.*DITC 27/83.*1983. 018422 Olken, F.* HOPT: A myopic version of the STOCHOPT automatic file migration policy.* California U., Berkeley. Lawrence Berkeley Lab.*LBL-15554; California U., Berkeley. Electronics Res.Lab. PROGRES Group.*Rpt. 83.03.*1983. 018423 Pier, K.A.*A retrospective on the Dorado, a high-performance personal computer.* Xerox. Palo Alto Res. Center.*ISL-83-01.*1983. 018424 Takagi. H.*Analysis of throughput and delay for single and multi hop packet radio networks.* California U., L.A. Eng. & Appl.Sci.Sch.*UCLA-ENG-8326; California U., L.A. Comp.Sci.Dept.*CSD-830523, Ph.D. Thesis. Takagi, H.*1983. ********************************************************************** * * * NUMERICAL ANALYSIS * * * ********************************************************************** 018425 Brent, R.P. Kung, H.T. Luk, F.T.*Some linear time algorithms for systolic arrays.* Australian National U. Comp.Sci.Dept.*TR-CS-82-15.*1982. 018426 Brent, R.P. Luk, F.T.*A systolic array for the linear time solution of Toeplitz systems of equations.* Australian National U. Comp.Sci.Dept.*TR-CS-83-02.*1983. 018427 Aspvall, B. Gilbert, J.R.* Graph coloring using eigenvalue decomposition.* Cornell U. Comp.Sci.Dept.*Tech rpt. 83-545.*1983. 018428 Brent, R.P. Luk, F.T. van Loan, V.*Computation of the generalized singular value decomposition using mesh connected processors.* Cornell U. Comp.Sci.Dept.*Tech rpt. 83-563.*1983. 018429 Fletcher, R.* Semi definite matrix constraints in optimization.* Dundee U. Math.Dept.*Rpt. NA/061.*1982. 018430 Mitchell, A.R.* Curved elements.* Dundee U. Math.Dept.*Rpt. NA/062.*1983. 018431 Brannigan, M.* Splines and the Galerkin method for solving integral equations in scattering theory.* Georgia U. Stat. and Comp.Sci.Dept.*Tech.rpt. 138.*1982. 018432 Brannigan, M.*A geometric characterization of H-sets.* Georgia U. Stat. and Comp.Sci.Dept.*Tech.rpt. 139.*1983. 018433 Brannigan, M.* Consistency in best restricted discrete Chebyshev approximation.* Georgia U. Stat. and Comp.Sci.Dept.*Tech.rpt. 140.*1983. 018434 Brannigan, M.*Criteria for adaptive approximation.* Georgia U. Stat. and Comp.Sci.Dept.*Tech.rpt. 145.*1983. 018435 Brannigan, M.* H-sets, convex programming and constrained approximation.* Georgia U. Stat. and Comp.Sci.Dept.* Tech.rpt. 146.*1983. 018436 Cosnard, M. Eberhard, A.*Etude d'un operateur de renormalisation. Premiere partie: Construction de points fixes.* Grenoble. Universite Scientifique et Medicale. Laboratoire d'Informatique et de Mathematiques Appliquees de Grenoble.*R.R. no. 305.*1982. 018437 Cosnard, M. Eberhard, A.*Etude d'un operateur de renormalisation. Deuxieme partie: Comportement iteratif des solutions de l'equation de renormalisation.* Grenoble. Universite Scientifique et Medicale. Laboratoire d'Informatique et de Mathematiques Appliquees de Grenoble.*R.R. no. 329.*1982. 018438 Zang, T.A. Wong, Y.S. Hussaini, M.Y.* Spectral multigrid methods for elliptic equations II.* Institute for Comp.Appl. in Sci. and Eng. (ICASE), NASA Langley Res. Center, Hampton, Va.*Rpt. 83-12.*1983. 018439 Tadmor, E.*The large time behavior of the scalar, genuinely nonlinear Lax Friedrichs scheme.* Institute for Comp.Appl. in Sci. and Eng. (ICASE), NASA Langley Res. Center, Hampton, Va.*Rpt. 83-15.*1983. 018440 Tadmor, E.* Entropy functions for symmetric systems of conservation laws.* Institute for Comp.Appl. in Sci. and Eng. (ICASE), NASA Langley Res. Center, Hampton, Va.*Rpt. 83-16.*1983. 018441 Banks, H.T. Majda, G.*Modelling of flexible surfaces: A preliminary study.* Institute for Comp.Appl. in Sci. and Eng. (ICASE), NASA Langley Res. Center, Hampton, Va.*Rpt. 83-19.*1983. 018442 Tadmor, E.*Numerical viscosity and the entropy condition for conservative difference schemes.* Institute for Comp.Appl. in Sci. and Eng. (ICASE), NASA Langley Res. Center, Hampton, Va.*Rpt. 83-20.*1983. 018443 Adams, L.*An M-step preconditioned conjugate gradient method for parallel computation.* Institute for Comp.Appl. in Sci. and Eng. (ICASE), NASA Langley Res. Center, Hampton, Va.*Rpt. 83-23.*1983. 018444 Banks, H.T. Daniel, P.L. Armstrong, E.S.*A spline based parameter and state estimation technique for static models of elastic surfaces.* Institute for Comp.Appl. in Sci. and Eng. (ICASE), NASA Langley Res. Center, Hampton, Va.*Rpt. 83-25.*1983. 018445 Phillips, T.N.*A preconditioned formulation of the Caucy Riemann equations.* Institute for Comp.Appl. in Sci. and Eng. (ICASE), NASA Langley Res. Center, Hampton, Va.*Rpt. 83-27.*1983. 018446 Tadmor, E.*The unconditional instability of inflow dependent boundary conditions in difference approximations to hyperbolic systems.* Institute for Comp.Appl. in Sci. and Eng. (ICASE), NASA Langley Res. Center, Hampton, Va.*Rpt. 82-33.*1982. 018447 Harten, A.*On a large time step high resolution scheme.* Institute for Comp.Appl. in Sci. and Eng. (ICASE), NASA Langley Res. Center, Hampton, Va.*Rpt. 82-34.*1982. 018448 Gannon, D. van Rosendale, J.*Highly parallel multigrid solvers for elliptic PDEs: An experimental analysis.* Institute for Comp.Appl. in Sci. and Eng. (ICASE), NASA Langley Res. Center, Hampton, Va.*Rpt. 82-36.*1982. 018449 Friedland, S. Tadmor, E.* Optimality of the Lax Wendroff condition.* Institute for Comp.Appl. in Sci. and Eng. (ICASE), NASA Langley Res. Center, Hampton, Va.*Rpt. 82-37.*1982. 018450 van Leer, B.*Computational methods for ideal compressible flow.* Institute for Comp.Appl. in Sci. and Eng. (ICASE), NASA Langley Res. Center, Hampton, Va.*Rpt. 83-38.*1983. 018451 Daniel, P.L.*An approximation technique for estimating discontinuous coefficients in distributed systems.* Institute for Comp.Appl. in Sci. and Eng. (ICASE), NASA Langley Res. Center, Hampton, Va.*Rpt. 83-40.*1983. 018452 Geer, J.F. Strikwerda, J.C.* Vertical slender jets with surface tensions.* Institute for Comp.Appl. in Sci. and Eng. (ICASE), NASA Langley Res. Center, Hampton, Va.*Rpt. 82-41.*1982. 018453 Tadmor, E.* Skew Selfadjoint form for systems of conservation laws.* Institute for Comp.Appl. in Sci. and Eng. (ICASE), NASA Langley Res. Center, Hampton, Va.*Rpt. 82-42.*1982. 018454 Goldberg, M. Tadmor, E.*Convenient stability criteria for difference approximations of hyperbolic initial boundary value problems.* Institute for Comp.Appl. in Sci. and Eng. (ICASE), NASA Langley Res. Center, Hampton, Va.*Rpt. 83-50.*1983. 018455 Loetstedt, P.*Solving the minimal least squares problem subject to bounds on the variables.* Royal Inst. of Tech., Stockholm. Num.Anal. & Computing Sci.Dept.* TRITA-NA-8215.*1982. 018456 Betsis, D.* Explicit construction of contractivity matrices.* Royal Inst. of Tech., Stockholm. Num.Anal. 8309.*1983. 018457 Gustafson, S.-A.* Stability of functionals determined by moment conditions.* Royal Inst. of Tech., Stockholm. Num.Anal. & Computing Sci.Dept.*TRITA-NA-8310.*1983. 018458 Scott, D.S.*The complexity of interpolating given data in three space with a convex function of two variables.* Texas U. Comp.Sci.Dept.*TR-83-018.*1983. 018459 Kagstroem, B.* Bounds and perturbation bounds for the matrix exponential.* Umea University Info. Processing Dept.*Rpt. UMINF-55.76.*1976. 018460 Kagstroem, B.*Numerical computation of matrix functions.* Umea University Info. Processing Dept.*Rpt. UMINF-58.77.* 1977. 018461 Sun, J.* Semi linear difference schemes for singular perturbation problems in one dimension.* Yale U. Comp.Sci.Dept.*Res.rpt. 216.*1982. 018462 Eisenstat, S.C.*A note on the generalized conjugate gradient method.* Yale U. Comp.Sci.Dept.*Res.rpt. 228.* 1982. 018463 Eisenstat, S.C.*Some observations on the generalized conjugate gradient method.* Yale U. Comp.Sci.Dept.* Res.rpt. 244.*1982. 018464 Douglas, C.C.* Multi grid algorithms with applications to elliptic boundary value problems.* Yale U. Comp.Sci.Dept.* Res.rpt. 247.*1983. 018465 Saad, T.* Chebyshev acceleration techniques for solving nonsymmetric eigenvalue problems.* Yale U. Comp.Sci.Dept.* Res.rpt. 255.*1982. 018466 Bank, R.E. Douglas, C.C.*Sharp estimates for multigrid rates of convergence with general smoothing and acceleration.* Yale U. Comp.Sci.Dept.*Res.rpt. 277.*n.d. 018467 Ascher, U. Weiss, R.* Collocation for singular perturbation problems III: Nonlinear problems without turning points.* British Columbia U. Comp.Sci.Dept.*Tech.rpt. 82-09.*1982. 018468 Bhatia, R. Davis, C.*A bound for the spectral variation of a unitary operator.*No issuing agency indicated (authors' addresses: Rajendra Bhatia - University of Bombay and University of Toronto; Chandler Davis - University of Toronto).*n.d. 018469 Bjoerck, A. Hammarling, S.*A Schur method for the square root of a matrix.* Linkoeping U. Math.Dept.*Rpt. LiTH-MAT-R-82-25.*1982. 018470 Delahaye, J.-P.*Theorie des transformations de suites en analyse numerique. Applications.* Lille. Universite des sciences et techniques.* Ph.D. Thesis. Delahaye, J.-P.* 1982. 018471 Duff, I.S. Reid, J.K.* MA27 - A set of Fortran subroutines for solving sparse symmetric sets of linear equations.* U.K. Atomic Energy Res. Establishment.*AERE-R 10533.* 1982. 018472 Erisman, A. Reid, J.* Partitioning, matrix modification and tearing.*n.d. (Section 5B of an unidentified book). 018473 Gay, D.M.*A trust region approach to linear constrained optimization.*No issuing agency indicated (author's address: Bell Laboratories/Murray Hill, New Jersey 07974).*1983. 018474 George, A. Heath, M.T. Ng, E.*Solution of sparse underdetermined systems of linear equations.* Oak Ridge National Lab. Comp.Sci.Div.*ORNL/CSD-121.*1983. 018475 Grigoriadis, M.D. Hsu, T.*Numerical methods for basic solutions of generalized flow networks.* Rutgers U. Comp.Sci.Res.Lab.*LCSR-TR-043.*1983. 018476 Hyman, J.M. Manteuffel, T.A.* Dynamic acceleration of nonlinear iterations.* Los Alamos National Lab.* LA-UR-83-1201.*1983. 018477 Johnson, C. Naevert, U. Pickaeranta, J.* Finite element methods for linear hyperbolic problems.* Chalmers U. of Tech. Math.Dept.*No. 1983-04; Goeteborg U. Math.Dept.*No. 1983-04.*1983. 018478 Kaellstroem, C.*Computing exp(A) and the integral of exp(As) ds.* Lund Inst. of Tech. Automatic Control Div.* Rpt. 7309.*1973. 018479 Kaneko, I. Plemmons, R.J.* Minimum norm solutions to linear elastic analysis problems.*No issuing agency indicated (authors' addresses: I. Kaneko- Department of Industrial Engineering/University of Wisconsin-Madison, WI 53706; R.J. Plemmons - Department of Mathematics and Computer Science/North Carolina State University/Raleigh, N.C. 27650).*1982. 018480 Martensson, K.*New approaches to the numerical solution of optimal control problems.* Lund Inst. of Tech. Automatic Control Div.*Rpt. 7206, Ph.D. Thesis. Martensson, K.* 1972. 018481 More, J.J.*Recent developments in algorithms and software for trust region methods.* Argonne Nat.Lab. Mathematics and Comp.Sci.Div.*ANL/MCS-TM-002.*1982. 018482 Niethammer, W. de Pillis, J. Varga, R.S. Block iterative methods applied to sparse least squares problems.*No issuing agency indicated (authors' addresses: W. Niethammer - Institut fuer Praktische Mathematik/Universitaet Karlsruhe/D-7500 Karlsruhe/W. Germany; J. de Pillis - Department of Mathematics/University of California/Riverside, CA 92321; R.S. Varga - Institute for Computational Mathematics/Kent State University/Kent, Ohio 44242).*n.d. 018483 Nocedal, J. Overton, M.L.*Numerical methods for solving inverse eigenvalue problems.*No issuing agency indicated (authors' address: Courant Institute of Mathematical Sciences/New York University/New York, N.Y. 10012).*n.d. 018484 Pham Dinh Tao* Iterative methods for computing the bound norms of matrices.*No issuing agency indicated (author's address: Universite Scientifique et Medicale/Laboratoire IMAG/B.P. 53 X/38041 Grenoble cedex/France).*n.d. 018485 Plohr, B. Glimm, J. McBryan, O.*Application of tracking to two-dimentional gas dynamics calculations.*No issuing agency indicated (authors' address: Cournat Institute of Mathematical Sciences/ New York University/ New York, N.Y. 10012).*n.d. 018486 Rall, L.B.*Numerical inversion of Green's matrices.* Wisconsin U. Math.Res. Center.*MRC Tech.Sum.Rpt. 1149.* 1971. 018487 Reid, J.K.*Advances in the exploitation of sparsity.* U.K. Atomic Energy Res. Extablishment, Harwell. Comp.Sci. and Systems Div.*CSS 138.*1983. 018488 Samejima, F.*Final report: Efficient methods of estimating the operating characteristics of item response categories and challenge to a new model for the multiple choice item.* Tennessee U. Psych.Dept.*1981. 018489 Samejima, F. Livingston, P.* Method of moments as the least squares solution for fitting a polynomial.* Tennessee U. Psych.Dept.*Res.rpt. 79-02.*1979. 018490 Samejima, F. Livingston, P.S.* Method of moments as the least squares solution for fitting polynomials.*No issuing agency indicated (authors' addresses: Fumiko Samejima - University of Tennessee; Philip S. Livingston - Systems & Applied Science Corporation).*n.d. 018491 Weinberger, H.F.* Optimal numerical approximation of a linear operator.* Minnesota U. Inst. for Math. and its Applications.*IMA preprint series no. 008.*1983. VOL. 5, NO. 13 12/22/83 018492 van der Houwen, P.J. Sommeijer, B.P.* Stability in linear multistep methods for pure delay equations.* Mathematisch Centrum.*NW 152/83.*1983. 018493 Riele, H.J.J.te*New very large amicable pairs.* Mathematisch Centrum.*NW 153/83.*1983. 018494 Hemker, P.W. Wesseling, P. de Zeeuw, P.M.*A portable vector code for autonomous multigrid modules.* Mathematisch Centrum.*NW 154/83.*1983. 018495 Riele, H.J.J. te Schroevers, Ph.*A comparative survey of numerical methods for the linear generalized Abel integration equation.* Mathematisch Centrum.*NW 155/83.* 1983. 018496 de Vries, H.B.*A comparitive study of ADI splitting methods for parabolic equations in two space dimensions.* Mathematisch Centrum.*NW 156/83.*1983. 018497 Vitanyi, P.M.B.*On the simulation of many storage heads by a single one.* Mathematisch Centrum.*IW 226/83.*1983. 018498 Bergstra, J.A. Klop, J.W.*A proof rule for restoring logic circuits.* Mathematisch Centrum.*IW 227/83.*1983. 018499 Vitanyi, P.M.B.*On the simulation of many storage heads by one.* Mathematisch Centrum.*IW 228/83.*1983. 018500 Lenstra, A.K.* Factoring multivariate integral polynomials.* Mathematisch Centrum.*IW 229/83.*1983. 018501 Lenstra, A.K.* Factoring multivariate integral polynomials, II.* Mathematisch Centrum.*IW 230/83.*1983. 018502 Loetstedt, P.* Perturbation bounds for the linear least squares problem subject to linear inequality constraints.* Royal Inst. of Tech., Stockholm. Num.Anal. & Computing Sci.Dept.*TRITA-NA-8205.*1982. 018503 Eriksson, G.* Nonlinear inverse problems.* Royal Inst. of Tech., Stockholm. Num.Anal. & Computing Sci.Dept.* TRITA-NA-8209.*1982. 018504 Schreiber, R.*On the systolic arrays of Brent, Luk, and van Loan for the symmetric eigenvalue and singular value problems.* Royal Inst. of Tech., Stockholm. Num.Anal. & Computing Sci.Dept.*TRITA-NA-8311.*1983. 018505 Schreiber, R. Tang, W.-P.*On systolic arrays for updating the Cholesky factorization.* Royal Inst. of Tech., Stockholm. Num.Anal. & Computing Sci.Dept.*TRITA-NA-8313.* 1983. 018506 Tiden, E. Lisper, B. Schreiber, R.* Systolic arrays.* Royal Inst. of Tech., Stockholm. Num.Anal. & Computing Sci.Dept.*TRITA-NA-8315.*1983. 050001 Zick, A.A. Homsy, G.M.* Numerical simulation of complex non Newtonian flows using Oldroyd type constitutive equations. Part 1: Flow through periodically constricted tubes.* Stanford U. Center for Large Scale Scientific Computation. CLaSSiC Project.*Manuscript ClaSSiC-83-01.* 1983. 050002 Zick, A.A. Homsy, G.M.* Numerical simulation of complex non Newtonian flows using Oldroyd type constitutive equations. Part 2: Flow through a sudden concentration.* Stanford U. Center for Large Scale Scientific Computation. CLaSSiC Project.*Manuscript ClaSSiC-83-02.* 1983. 050003 Celoni, J.R., S.J. Hennessy, J.L.* Streams in a single assignment language.* Stanford U. Center for Large Scale Scientific Computation. CLaSSiC Project.*Manuscript ClaSSiC-83-03.*1983. 051001 Celoni, J.R., S.J. Hennessy, J.L.* SAL: A single assignment language for parallel algorithms.* Stanford U. Center for Large Scale Scientific Computation. CLaSSiC Project.* Rpt. ClaSSiC-83-01.*1983. 024969 Maszkowski, B. Manna, Z.* Reasoning in interval temporal logic.* Stanford U. Comp.Sci.Dept.*STAN-CS-83-969.*1983. 18p. 024970 Maszkowski, B.C.* Reasoning about digital computers.* Stanford U. Comp.Sci.Dept.*STAN-CS-83-970, Ph.D. Thesis. Moszkowski, B.C.*1983. 135p. 024972 Karlin, A.R. Trickey, H.W. Ullman, J.D.*Experience with a regular expression compiler.* Stanford U. Comp.Sci.Dept.* STAN-CS-83-972.*1983. 23p. 024973 Cheriton, D.R. Zwaenepoel, W.*The distributed V kernel and its performance for diskless workstations.* Stanford U. Comp.Sci.Dept.*STAN-CS-83-973.*1983. 12p. 024974 Hobby, J. Guoan, G.*A chinese Meta-font.* Stanford U. Comp.Sci.Dept.*STAN-CS-83-974.*1983. 22p. 024975 Rowe, N.C.* Rule based statistical calculations on a database abstract.* Stanford U. Comp.Sci.Dept.* STAN-CS-83-975, Ph.D. Thesis. Rowe, N.C.*1983. 151p. 024976 Beeri, C. Vardi, M.*On acyclic database decompositions.* Stanford U. Comp.Sci.Dept.*STAN-CS-83-976.*1983. 9p. 024977 Liang, F.M.*Word hy-phen-a-tion by com-put-er.* Stanford U. Comp.Sci.Dept.*STAN-CS-83-977, Ph.D. Thesis. Liang, F.M.* 1983. 85p. 024978 Knuth, D.E.*Lessons learned from METAFONT.* Stanford U. Comp.Sci.Dept.*STAN-CS-83-978.*1983. 22p. 024979 Graham, M.H. Mendelzon, A.O. Vardi, M.Y.*Notions of dependence satisfaction.* Stanford U. Comp.Sci.Dept.* STAN-CS-83-979.*1983. 35p. 018507 Abrahamson, P.G.*A nested decomposition approach for solving staircase linear programs.* Stanford U. O.R. Dept. Systems Optimization Lab.*SOL 83-04, Ph.D. Thesis. Abrahamson, P.G.*1983. 89p. 018508 McCormick, S.T.*A combinatorial approach to some sparse matrix problems.* Stanford U. O.R. Dept. Systems Optimization Lab.*SOL 83-05, Ph.D. Thesis. McCormick, S.T.*1983. 69p. 018509 Gill, P.E. Murray, W. Saunders, M.A. Wright, M.H.* Documentation for FDCALC and FDCORE.* Stanford U. O.R. Dept. Systems Optimization Lab.*SOL 83-06.*1983. 21p. 018510 Gill, P.E. Murray, W. Saunders, M.A. Wright, M.H.*User's guide for SOL/QPSOL: A Fortran package for quadratec programming.* Stanford U. O.R. Dept. Systems Optimization Lab.*SOL 83-07.*1983. 36p. 018511 Broadie, M.N.*Computational experience with the octahedral algorithm and related results.* Stanford U. O.R. Dept. Systems Optimization Lab.*SOL 83-08.*1983. 28p. 018512 Braodie, M.N.* Octasolv user's guide.* Stanford U. O.R. Dept. Systems Optimization Lab.*SOL 83-09.*1983. 26p. 018513 Rosenberg, A.N.*Numerical solution of systems of simultaneous polynomial equations.* Stanford U. O.R. Dept. Systems Optimization Lab.*SOL 83-10.*1983. 37p. 018514 Eaves, B.C.* Subdivisions from primal and dual cones and polytopes.* Stanford U. O.R. Dept. Systems Optimization Lab.*SOL 83-11.*1983. 14p. 018515 Gill, P.E. Murray, W. Saunders, M.A. Wright, M.H.*User's guide for SOL/NPSOL: A Fortran package for nonlinear programming.* Stanford U. O.R. Dept. Systems Optimization Lab.*SOL 83-12.*1983. 35p. 018516 Broadie, M.N. Cottle, R.W.*A note on triangulating the 5-cube.* Stanford U. O.R. Dept. Systems Optimization Lab.*SOL 83-13.*1983. 12p. 018517 Broadie, M.N.* Subdivisions and antiprisms for PL homotopy algorithms.* Stanford U. O.R. Dept. Systems Optimization Lab.*SOL 83-14, Ph.D. Thesis. Broadie, M.N.*1983. 123p. 018519 Anstreicher, K.M.*Generation of feasible descent directions in continuous time linear programming.* Stanford U. O.R. Dept. Systems Optimization Lab.*SOL 83-18, Ph.D. Thesis. Anstreicher, K.M.*1983. 101p. 018520 Arnold, M. Cmelik, B. Fitzpatrick, D. Foderaro, J. Homachi, G. Mayo, R. Ousterhout, J. Scott, W.S. Terman, C.*1983 VLSI tools: selected works by the original artists. Robert N. Mayo, John K. Ousterhout, and Walter S. Scott, editors.* California U., Berkeley. Comp.Sci.Div.*UCB/CSD 83/115.*1983. Contents: Caesar, by John Ousterhout; Cifplot, by Dan Fitzpatrick; Crystal, by John Ousterhout; Egntott, by Bob Cmelik; Esim, by Chris Terman (MIT); Lyra, by Michael Arnaol; Mextra, by Dan Fitzpatrick, Peg, by Gordan Hamachi; Quilt, by Robert Mayo; Slang, by John Foderaro; Tpack, by Robert Mayo; Tpla, by Robert Mayo; and others. 018521 Paz, A.*A simplified version of H.W. Lenstra's integer programming algorithm and some applications.* California U., Berkeley. Comp.Sci.Div.*UCB/CSD 83/116.*1983. 018522 Karp, R.M. Luby, M.G.*A new Monte Carlo method for estimating the failure probability of an n-component system.* California U., Berkeley. Comp.Sci.Div.*UCB/CSD 83/117.*1983. 018523 Barsky, B.A.*A study of the parametric uniform B spline curve and surface representations.* California U., Berkeley. Comp.Sci.Div.*UCB/CSD 83/118.*1983. 018524 Ousterhout, J.K.* Crystal: A timing analyzer for nMOS VLSI circuits.* California U., Berkeley. Comp.Sci.Div.*UCB/CSD 83/119.*1983. 018525 Smith, A.J.* Disk cache - Miss ratio analysis and design considerations.* California U., Berkeley. Comp.Sci.Div.* UCB/CSD 83/120.*1983. 018526 Lee, J.K.F. Smith, A.J.*Analysis of branch prediction strategies and branch target buffer design.* California U., Berkeley. Comp.Sci.Div.*UCB/CSD 83/121.*1983. 018527 Ponder, C.*"...but will RISC run LISP??" (a feasibility study).* California U., Berkeley. Comp.Sci.Div.*UCB/CSD 83/122.*1983. 018526 Larus, J.R.*On the performance of courier remote procedure calls under 4.1c BSD.* California U., Berkeley. Comp.Sci.Div.*UCB/CSD 83/123.*1983. 018529 Hagmann, R.B.* Performance analysis of several backend database architectures.* California U., Berkeley. Comp.Sci.Div.*UCB/CSD 83/124, Ph.D. Thesis. Hagmann, R.B.* 1983. 018530 Blau, R.* Paging on an object oriented personal computer for smalltalk.* California U., Berkeley. Comp.Sci.Div.* UCB/CSD 83/125.*1983. 018531 Demmel, J.W. Krueckeberg, F.*An interval algorithm for solving systems of linear equations to prespecified accuracy.* California U., Berkeley. Comp.Sci.Div.* UCB/CSD 83/126.*1983. 018532 Demmel, J.W.*The condition number of similarities that diagonalize matrices.* California U., Berkeley. Comp.Sci.Div.*UCB/CSD 83/127.*1983. 018533 Demmel, J.W.*Effects of underflow on solving linear systems.* California U., Berkeley. Comp.Sci.Div.*UCB/CSD 83/128.*1983. 018534 Wilhelm, R.* Inverse currying transformation on attribute grammars.* California U., Berkeley. Comp.Sci.Div.*UCB/CSD 83/129.*1983. 018535 Fitzpatrick, D.T.*Exploiting structure in the analysis of integrated circuit artwork.* California U., Berkeley. Comp.Sci.Div.*UCB/CSD 83/130.*1983. 018536 Ousterhout, J.K.*The user interface and implementation of Caesar.* California U., Berkeley. Comp.Sci.Div.*UCB/CSD 83/131.*1983. 018537 Powell, M.L. Miller, B.P.* Process migration in DEMOS/MP.* California U., Berkeley. Comp.Sci.Div.*UCB/CSD 83/132.* 1983. 018538 Powell, M.L. Presotto, D.L.* PUBLISHING: A reliable broadcast communication mechanism.* California U., Berkeley. Comp.Sci.Div.*UCB/CSD 83/133.*1983. 018539 Powell, M.L. Linton, M.A.* Database support for programming environments.* California U., Berkeley. Comp.Sci.Div.* UCB/CSD 83/134.*1983. 018540 Peek, J.B.*The VLSI circuitry of RISC I.* California U., Berkeley. Comp.Sci.Div.*UCB/CSD 83/135.*1983. 018541 Resende, M.G.C.*A computer program for reliability evaluation of large-scale polygog to chain reductions.* California U., Berkeley. O.R. Center.*ORC 83-10.*1983. 018542 Gale, D. Sotomayor, M.*Some remarks on the stable matching problem.* California U., Berkeley. O.R. Center.*ORC 83-12.*1983. 018543 Barlow, R.E.*A Bayesian explanation of an apparent failure rate paradox.* California U., Berkeley. O.R. Center.*ORC 83-13.*1983. 018544 Feo, T.A.*Program for the analysis of fault trees.* California U., Berkeley. O.R. Center.*ORC 83-14.*1983. 018545 Ramakrishnan, I.V.*On mapping cube graphs onto linear systolic arrays.* Texas, U. Comp.Sci.Dept.*TR-219.*1983. 018546 Varman, P.J. Ramakrishnan, I.V.* Robust systolic algorithms for relational database operations.* Texas, U. Comp.Sci.Dept.*TR-220.*1983. 018547 Varman, P.J. Ramakrishnan, I.V. Fussell, D.* Robust matrix multiplication algorithms for VLSI.* Texas, U. Comp.Sci.Dept.*TR-221.*1983. 018548 Silberschatz, A.*On the synchronization mechanism of the ADA language.* Texas, U. Comp.Sci.Dept.*TR-222.*1983. 018549 Gouda, M.G.*An example for constructing communicating machines by stepwise refinement.* Texas, U. Comp.Sci.Dept.*TR-223.*1983. 018550 Silberschatz, A.*A robust distributed concurrency control scheme.* Texas, U. Comp.Sci.Dept.*TR-224.*1983. 018551 Scott, D.S.*Computing a few eigenvalues and eigenvectors of a symmetric band matrix.* Texas, U. Comp.Sci.Dept.* TR-225.*1983. 018552 Buckley, G.N. Silberschatz, A.*Extending graph based locking protocols with edge locks.* Texas, U. Comp.Sci.Dept.*TR-226.*1983. 018553 Gouda, M.G. Shen, H.S.*Specification, programming and verification of CSP by channel observation sequences.* Texas, U. Comp.Sci.Dept.*TR-227.*1983. 018554 Ahuja, M.A.* Consistency management in distributed data bases: A selective analysis.* Texas, U. Comp.Sci.Dept.* TR-231.*1983. 018555 Ibarra, O.H. Rosier, L.E.*On simple programs with primitive conditional statements.* Texas, U. Comp.Sci.Dept.*TR-232.* 1983. 018556 Bartels, R.H. Beatty, J.C. Barsky, B.A.*An introduction to the use of splines in computer graphics.* Waterloo U. Comp.Sci.Dept.*Res.rpt. CS-83-09.*1983. 018557 Mavaddat, F.* High level approaches to VLSI design.* Waterloo U. Comp.Sci.Dept.*Res.rpt. CS-83-25.*1983. 018558 Choffrut, C. Culik, K. II*On extendibility of unavoidable sets.* Waterloo U. Comp.Sci.Dept.*Res.rpt. CS-83-26.* 1983. 018559 Bartels, R.H.* Splines in interactive computer graphics.* Waterloo U. Comp.Sci.Dept.*Res.rpt. CS-83-27.*1983. 018560 Mavaddat, F. Cutcliffe, N. Ellis, R.* Graphics in spritesland.* Waterloo U. Comp.Sci.Dept.*Res.rpt. CS-83-30.*1983. 018561 Craig, G.L. Goodman, J.R. Katz, R.H. Pleszkun, A.R. Ramachandran, K. Sayah, J. Smith, J.E.* PIPE: A high performance VLSI processor implementation.* Wisconsin U. Comp.Sci.Dept.*Tech.rpt. 513.*1983. 018562 Bent, S.W.*A note on enumerating t-ary trees.* Wisconsin U. Comp.Sci.Dept.*Tech.rpt. 514.*1983. 018563 Desautels, E.J.* Access problems with computer based services.* Wisconsin U. Comp.Sci.Dept.*Tech.rpt. 516.* 1983. 018564 Carey, M.J.* Multiple versions and the performance of optimistic concurrency control.* Wisconsin U. Comp.Sci.Dept.*Tech.rpt. 517.*1983. 018565 Uhr, L.*Feasible multi computer architectures, given 3-dimensional stacked wafers.* Wisconsin U. Comp.Sci.Dept.*Tech.rpt. 518.*1983. 018566 Savage, J.E.*Bounds on the performance on multilective VLSI algorithms.* Brown U. Comp.Sci.Dept.*Tech.rpt. CS-82-10.* 1982. 018570 Ostler, F.L.*An SMD disk dontroller for the LILITH computer.* Eidgenoessische Technische Hochschule Zurich. Institut fuer Informatik.*Bericht 52.*1983. 018571 Zehnder, C.A. (Ed.)* Database techniques for professional workstations.* Eidgenoessische Technische Hochschule Zurich. Institut fuer Informatik.*Bericht 55.*1983. 018572 Kim, W.* Auditor: A framework for high availability of DB/DC systems.* IBM Watson Res. Center.*RJ 3512.*1982. 018573 Hu, T.C. Shing, M.T.*A decomposition algorithm for multi terminal network flows.* California U., Santa Barbara. Comp.Sci.Dept.*TRCS83-01.*1983. 018574 Narayanan, A.*Ascribing mental predicated to computers.* Exeter U. Comp.Sci.Dept.*Res.rpt. R-102.*1981. 018575 Campbell, J.A. Green, H.S.* GO as a subject for game playing in artificial intelligence, by J.A. Campbell; Go and artificial intelligence, by H.S. Green.* Exeter U. Comp.Sci.Dept.*Res.rpt. R-108.*1982. 018576 Ford, R. Miller, K.*An abstract data type development and implementation methodology.* Iowa U. Comp.Sci.Dept.* Tech.rpt. 83-07.*1983. 018577 Culik, K.*On metapaths in metagraphs.* Wayne State U. Comp.Sci.Dept.*CSC-83-005.*1983. 018578 Sethi, I.K.*A general scheme for discontinuity detection.* Wayne State U. Comp.Sci.Dept.*CSC-83-006.*1983. VOL. 6, NO. 1 02/01/84 018579 McKeown, D.M. Jr.* Concept maps.* Carnegie Mellon U. CS Dept. *CMU-CS-83-117.*1983. 018580 Appel, A.W.*An efficient program for many body simulations (or, Cray performance from a VAX).* Carnegie Mellon U. CS Dept. *CMU-CS-83-118.*1983. 018591 Cornelius, N. Kanade, T.*Adapting optical flow to measure object moon in reflectance and x-ray image sequences.* Carnegie Mellon U. CS Dept. *CMU-CS-83-119.*1983. 018592 Carbonell, J.G. Larkin, J.H. Reif, F.*Towards a general scientific reasoning engine.* Carnegie Mellon U. CS Dept. *CMU-CS-83-120.*1983. 018593 Bentley, J.L. McGeoch, C.C.* Worst case analyses of self organizing sequential search heuristics.* Carnegie Mellon U. CS Dept. *CMU-CS-83-121.*1983. 018594 Berliner, H. Campbell, M.*Using chunking to solve chess pawn endgames.* Carnegie Mellon U. CS Dept. * CMU-CS-83-122.*1983. 018595 Daniels, D. Spector, A.Z.*An algorithm for replicated directories.* Carnegie Mellon U. CS Dept. * CMU-CS-83-123.*1983. 018596 Doyle, J.*Admissible state semantics for representational systems.* Carnegie Mellon U. CS Dept. * CMU-CS-83-124.*1983. 018597 Doyle, J.*Some theories of reasoned assumptions: An essay in rational psychology.* Carnegie Mellon U. CS Dept. *CMU-CS-83-125.*1983. 018598 Doyle, J.*The ins and outs of reason maintenance.* Carnegie Mellon U. CS Dept. *CMU-CS-83-126.*1983. 018599 Doyle, J.*A society of mind: Multiple perspectives, reasoned assumptions, and virtual copies.* Carnegie Mellon U. CS Dept. *CMU-CS-83-127.*1983. 018600 York, G. Siewiorek, D. Segall, Z.* Software voting in asynchronous NMR computer structures.* Carnegie Mellon U. CS Dept. *CMU-CS-83-128.*1983. 018601 Tsao, M.M.*Trend analysis and fault prediction.* Carnegie Mellon U. CS Dept. *CMU-CS-83-130, Ph.D. Thesis. Tsao, M.M.*1983. 018602 Shafer, S.A.* Shadow geometry and occluding contours of generalized cylinders.* Carnegie Mellon U. CS Dept. *CMU-CS-83-131, Ph.D. Thesis. Shafer, S.A.* 1983. 018603 Gosling, J.* Algebraic constraints.* Carnegie Mellon U. CS Dept. *CMU-CS-83-132, Ph.D. Thesis. Gosling, J.* 1983. 018604 Walker, H.*The control store and register file design of the programmable systolic chip.* Carnegie Mellon U. CS Dept. *CMU-CS-83-133.*1983. 018605 Brookes, S.D.*A semantics and proof system for communicating processes.* Carnegie Mellon U. CS Dept. *CMU-CS-83-134.*1983. 018606 Carbonell, J.G. Michalski, R.S. Mitchell, T.M.* Machine learning Part I: A historical and methodological analysis.* Carnegie Mellon U. CS Dept. * CMU-CS-83-135.*1983. 018607 McKeown, D.M. Jr.* MAPS: The organization of a spatial database system using imagery, terrain, and map data.* Carnegie Mellon U. CS Dept. *CMU-CS-83-136.*1983. 018608 Bruegge, B.*The CMU computer system qualifier 1976-1982.* Carnegie Mellon U. CS Dept. *CMU-CS-83-137.*1983. 018609 Kannan, R.*Solving systems of linear equations over polynomials.* Carnegie Mellon U. CS Dept. * CMU-CS-83-165.*1983. 018610 Kannan, R. Lipton, R.J.* Polynomial time algorithm for the orbit problem.* Carnegie Mellon U. CS Dept. * CMU-CS-83-168.*1983. 018611 Di Pillo, G. Grippo, L. Lampariello, F.*A Newton type computing technique for optimal control problems.* Consiglio Nazionale delle Ricerche. Istituto di Analisi dei Sistemi ed Informatica.*R. 33.*1982. 018612 Bertolazzi, P. Pirozzi, M.* Parallel algorithms for different classes of dynamic programming problems.* Consiglio Nazionale delle Ricerche. Istituto di Analisi dei Sistemi ed Informatica.*R. 38.*1982. 018613 Balsamini, A. Rafanelli, M. Ricci, F.L.* GRASS: A logical model for statistical databases.* Consiglio Nazionale delle Ricerche. Istituto di Analisi dei Sistemi ed Informatica.*R. 39.*1982. 018614 Blazewicz, J. Ecker, K.*A linear time algorithm for restricted bin packing and scheduling problems.* Consiglio Nazionale delle Ricerche. Istituto di Analisi dei Sistemi ed Informatica.*R. 40.*1982. 018615 Ausiello, G. D'Atra, A. Moscarini, M.* Minimal coverings of acyclic database schemata.* Consiglio Nazionale delle Ricerche. Istituto di Analisi dei Sistemi ed Informatica.* R. 41.*1982. 018616 De Leone, R. Gaudioso, M. Grippo, L.* Line search methods without derivatives.* Consiglio Nazionale delle Ricerche. Istituto di Analisi dei Sistemi ed Informatica.*R. 46.* 1982. 018617 Lucidi, S.*A Newton type algorithm for a class of distributed parameter optimal control problems.* Consiglio Nazionale delle Ricerche. Istituto di Analisi dei Sistemi ed Informatica.*R. 47.*1982. 018618 Di Pillo, G. Grippo, L.*A continuously differentiable exact penalty function for nonlinear programming problems with inequality constraints.* Consiglio Nazionale delle Ricerche. Istituto di Analisi dei Sistemi ed Informatica.* R. 48.*1982. 018619 Miola, A.*A unified view of approximate rational arithmetics and rational interpolation.* Consiglio Nazionale delle Ricerche. Istituto di Analisi dei Sistemi ed Informatica.*R. 49.*1982. 018620 Blazewicz, J. Bovet, D.P. Gambosi, G.* Deadlock resistant flow control procedures for store-and-forward networks.* Consiglio Nazionale delle Ricerche. Istituto di Analisi dei Sistemi ed Informatica.*R. 50.*1982. 018621 Cioni, G. Kreczmar, A.*Programmed deallocation without dangling reference.* Consiglio Nazionale delle Ricerche. Istituto di Analisi dei Sistemi ed Informatica.*R. 51.* 1982. 018622 Labella, A. Pettorossi, A.*Towards a categorical understanding of parallelism.* Consiglio Nazionale delle Ricerche. Istituto di Analisi dei Sistemi ed Informatica.* R. 54.*1983. 018623 Atzeni, P. Carboni, E.* INCOD (a system for interactive conceptual design) revisited after the implementation of a prototype.* Consiglio Nazionale delle Ricerche. Istituto di Analisi dei Sistemi ed Informatica.*R. 55.* 1983. 018624 Miola, A.* Algebraic approach to p-adic conversion of rational numbers.* Consiglio Nazionale delle Ricerche. Istituto di Analisi dei Sistemi ed Informatica.*R. 56.* 1983. 018625 Lucertini, M. Paletta, G.*A class of network design problems with multiple demand: Model formulation and an algorithmic approach.* Consiglio Nazionale delle Ricerche. Istituto di Analisi dei Sistemi ed Informatica.* R. 57.*1983. 018626 Di Pillo, G. Grippo, L. Lampariello, F.*A class of structured quasi Newton algorithms for optimal control problems.* Consiglio Nazionale delle Ricerche. Istituto di Analisi dei Sistemi ed Informatica.*R. 60.*1983. 018627 Germani, A. Piccioni, M.* Finite dimensional approximations of stochastic bilinear differential equations in Hilbert spaces.* Consiglio Nazionale delle Ricerche. Istituto di Analisi dei Sistemi ed Informatica.*R. 61.*1983. 018628 Rafanelli, M. Ricci, F.L.*A data definition language for a statistical data base.* Consiglio Nazionale delle Ricerche. Istituto di Analisi dei Sistemi ed Informatica.* R. 62.*1983. 018629 Mascari, G. Miola, A.*Computations on numerical and symbolic expressions: A semantic analysis.* Consiglio Nazionale delle Ricerche. Istituto di Analisi dei Sistemi ed Informatica.*R. 65.*1983. 018630 Miola, A.*Design specifications for manipulation of sums and series.* Consiglio Nazionale delle Ricerche. Istituto di Analisi dei Sistemi ed Informatica.*R. 66.*1983. 018631 Labella, A. Pettorossi, A.*Categories for handshaking communications.* Consiglio Nazionale delle Ricerche. Istituto di Analisi dei Sistemi ed Informatica.*R. 67.* 1983. 018632 Ceri, S. Crespi-Reghizzi, S.* Relational data bases in the design of program construction systems.* Milan. Politecnico. Dipartimento di Elettronica. Lab. di Calcolatori.*Rapporto interno n. 83-08.*1983. 018633 Ceri, S. Gottlob, G. Pelagatti. G.* Joining fragmented relations in distributed databases.* Milan. Politecnico. Dipartimento di Elettronica. Lab. di Calcolatori.* Rapporto interno n. 83-09.*1983. 018634 Citrini, C. Crespi-Reghizzi, S. Mandrioli, D.* Chains of deterministic push down transducers.* Milan. Politecnico. Dipartimento di Elettronica. Lab. di Calcolatori.* Rapporto interno n. 83-13.*1983. 018635 Dembinski, P.* Microprogram transformations.* Polish Academy of Sciences. Inst. of Comp.Sci.*ICS PAS Rpt. No. 488.*1982. 018636 Novotny, M.* Sequences of information systems.* Polish Academy of Sciences. Inst. of Comp.Sci.*ICS PAS Rpt. No. 489.*1982. 018637 Bakowski, P.*A language for negative control design.* Polish Academy of Sciences. Inst. of Comp.Sci.*ICS PAS Rpt. No. 490.*1982. 018638 Miadowicz, Z.B.* Time varying automata: A survey.* Polish Academy of Sciences. Inst. of Comp.Sci.*ICS PAS Rpt. No. 491.*1982. 018639 Baczko, A.* Simulation controlled data transmission network.* Polish Academy of Sciences. Inst. of Comp.Sci.* ICS PAS Rpt. No. 493.*1983. 018640 Jankowski. A. Rauszer, C.*On logical foundation approach to users' domain restriction in data bases. I.* Polish Academy of Sciences. Inst. of Comp.Sci.*ICS PAS Rpt. No. 494.*1983. 018641 Lipski. W.*An NP-complete geometric problem related to three layer channel routing.* Polish Academy of Sciences. Inst. of Comp.Sci.*ICS PAS Rpt. No. 495.*1983. 018642 Pawlak, Z.* Rough probability and partial observability.* Polish Academy of Sciences. Inst. of Comp.Sci.*ICS PAS Rpt. No. 496.*1983. 018643 Chmiel, K.* Cycles in the SC image of a nondeterministic finite automata.* Polish Academy of Sciences. Inst. of Comp.Sci.*ICS PAS Rpt. No. 498.*1983. 018644 Blikle, A. Tarlecki, A.* Naive denotational semantics.* Polish Academy of Sciences. Inst. of Comp.Sci.*ICS PAS Rpt. No. 500.*1983. 018645 Subieta, K.* High-level navigational facilities for network and relational databases.* Polish Academy of Sciences. Inst. of Comp.Sci.*ICS PAS Rpt. No. 501.*1983. 018646 Orlowska, E.* Representation of vague information.* Polish Academy of Sciences. Inst. of Comp.Sci.*ICS PAS Rpt. No. 503.*1983. 018647 Marek, W.*On the semantics of the relational model of data base. I.* Polish Academy of Sciences. Inst. of Comp.Sci.* ICS PAS Rpt. No. 505.*1983. 018648 Pawlak, Z.* Rough classification.* Polish Academy of Sciences. Inst. of Comp.Sci.*ICS PAS Rpt. No. 506.*1983. 018649 Francis, A.*Experimental implementation of partitioned statistical data bases.* Polish Academy of Sciences. Inst. of Comp.Sci.*ICS PAS Rpt. No. 507.*1983. 024980 Knuth, D.E.*The WEB system of structured documentation.* Stanford U. CS Dept. *STAN-CS-83-980.*1983 (version 2.3, September 1983). 206p. 024981 Knuth, D.E.* Literate programming.* Stanford U. CS Dept. *STAN-CS-83-981. 15p. 024982 Greene, D.H.* Labelled formal languages and their uses.* Stanford U. CS Dept. *STAN-CS-83-982, Ph.D. Thesis. Greene, D.H.*1983. 148p. 024983 Ullman, J.D.*A communication-time tradeoff.* Stanford U. CS Dept. *STAN-CS-83-983.*1983. 11p. 024984 Brown, H. Tong, C. Foyster, G.* Palladio: An exploratory environment for circuit design.* Stanford U. CS Dept. *STAN-CS-83-984, Stanford U. CS Dept. Heuristic Programming Project.*HPP-83-031.*1983. 47p. 024985 Samuel, A.L.* First grade TEX: A beginner's TEX manual.* Stanford U. CS Dept. *STAN-CS-83-985.*1983. 34p. 024986 Cohen, P.R.* Heuristic reasoning about uncertainty: An artificial intelligence approach.* Stanford U. CS Dept. *STAN-CS-83-986, Ph.D. Thesis. Cohen, P.R.* 1983. 190p. 024988 Mairson, H.G.*The program complexity of searching a table.* Stanford U. CS Dept. *STAN-CS-83-988, Ph.D. Thesis. Mairson, H.G.*1983. 75p. 018650 Carey, M.J.* Granularity hierarchies in concurrency control.* California U., Berkeley. Electronics Res.Lab.* Memo No. UCB/ERL M83/01.*1983. 018651 Woodfill, J. Stonebraker, M.*An implementation of hypothetical relations.* California U., Berkeley. Electronics Res.Lab.*Memo No. UCB/ERL M83/02.*1983. 018652 Stonebraker, M. Rubenstein, B. Guttman, A.*Application of abstract data types and abstract indices to CAD data bases.* California U., Berkeley. Electronics Res.Lab.* Memo No. UCB/ERL M83/03.*1983. 018653 Agrawal, R. Carey, M. DeWitt, D.* Deadlock detection is cheap.* California U., Berkeley. Electronics Res.Lab.* Memo No. UCB/ERL M83/05.*1983. 018654 Carey, M.J.*An abstract model of database concurrency control algorithms.* California U., Berkeley. Electronics Res.Lab.*Memo No. UCB/ERL M83/06.*1983. 018655 Youssefi, K.A.*A physical design tool for relational databases.* California U., Berkeley. Electronics Res.Lab.* Memo No. UCB/ERL M83/09.*1983. 018656 Carey, M.J.*Modeling and evaluation of database concurrency control algorithms.* California U., Berkeley. Electronics Res.Lab.*Memo No. UCB/ERL M83/56.*1983. 018657 Guttman, A. Stonebraker, M.*R-trees: A dynamic index structure for spatial searching.* California U., Berkeley. Electronics Res.Lab.*Memo No. UCB/ERL M83/64.* 1983. 018658 Lewandowski, J.L.* SS/TDMA time slot assignment with generalized switching modes.* Illinois U. CS Dept. * UIUCDCS-R-83-1112, Ph.D. Thesis. Lewandowski, J.L.*1983. 018659 Gallivan, K.A.*An algorithm for the detection and integration of highly oscillatory ordinary differential equations using a generalized unified modified divided difference representation.* Illinois U. CS Dept. * UIUCDCS-R-83-1121, Ph.D. Thesis. Gallivan, K.A.*1983. 018660 Lee, K.Y.* Interconnection networks and compiler algorithms for multiprocessors.* Illinois U. CS Dept. * UIUCDCS-R-83-1125, Ph.D. Thesis. Lee, K.Y.*1983. 018661 Vu, T.V.*Numerical methods for smooth solutions of ordinary differential equations.* Illinois U. CS Dept. * UIUCDCS-R-83-1130, Ph.D. Thesis. Vu, T.V.*1983. 018662 Shilling, J.*A comparison of the Nordsieck and modifies divided difference storage methods in the computer solution of odes.* Illinois U. CS Dept. * UIUCDCS-R-83-1131.*1983. 018663 Boulanger, A.G.*The expert system PLANT/cd: A case study in applying the general purpose inference system ADVISE to predicting black cutworm damage in corn.* Illinois U. CS Dept. *UIUCDCS-R-83-1134.*1983. 018664 Esakov, J.*Multi-level design automation supervisor.* Illinois U. CS Dept. *UIUCDCS-R-83-1137.*1983. 018665 Beckman-Davies, C.S.*Improving parallelism in Linpack.* Illinois U. CS Dept. *UIUCDCS-R-83-1138.*1983. 018666 Furchtgott, D.G. Meyer, J.F.* Performability evaluation of computing systems using reward models.* Michigan U. Computing Res.Lab.*CRL-TR-27-83.*1983. 018667 Makrucki, B.A. Mudge, T.N.*A queueing model of delta networks.* Michigan U. Computing Res.Lab.*CRL-TR-26-83.* 1983. 018668 Meyer, J.F.* Performability modeling of distributed real time systems.* Michigan U. Computing Res.Lab.* CRL-TR-28-83.*1983. 018669 Buzzard, G.D. Mudge, T.N.* Object based computer systems and the ADA programming language.* Michigan U. Computing Res.Lab.*CRL-TR-29-83.*1983. 018670 Diamond, M.D.*The graph labeling model and its application to the problem of edge linking.* Michigan U. Computing Res.Lab.*CRL-TR-30-83.*1983. 018671 Aref, M.*Automated concept discovery in data structure applications.* Saskatchewan U. Computational Sci.Dept.* Rpt. 83-10.*1983. 018672 Grassman, W.K.*Solving queueing equations using probability theory.* Saskatchewan U. Computational Sci.Dept.*Rpt. 83-12.*1983. 018673 Harms, D.D. Colbourn, C.J.*On bounds for the reliability of a network.* Saskatchewan U. Computational Sci.Dept.*Rpt. 83-13.*1983. 018674 Colbourn, C.J. Proskurowski, A.* Concurrent transmissions in broadcast networks.* Saskatchewan U. Computational Sci.Dept.*Rpt. 83-14.*1983. 018675 Kwan, C.Y.K. Sorenson, P.G.*A high level user interface prototype for office information systems.* Saskatchewan U. Computational Sci.Dept.*Rpt. 83-15.*1983. 018676 Mackay, S.A. Booth, K.S.*Techniques for frame buffer animation.* Waterloo U. CS Dept. *CS-82-43.*1982. 018677 Ottmann, T. Soisalon-Soininen,E. Wood, D.*On the definition and computation of rectilinear convex hulls.* Waterloo U. CS Dept. *CS-83-07.*1983 (revised). 018678 Wood, D.*the contour problem for rectilinear polygons.* Waterloo U. CS Dept. *CS-83-20.*1983. 018679 Johnson, J.H.*Formal models for string similarity.* Waterloo U. CS Dept. *CS-83-32, Ph.D. Thesis. Johnson, J.H.*1983. 018680 van Emden, M.H. Lloyd, J.W.*A logical reconstruction of Prolog II.* Waterloo U. CS Dept. *CS-83-35.*1983. 018681 Andreae, J.H.* Man machine studies: progress report UC-DSE/22 (1983) to the Defense Scientific Establishment. Editor: J.H. Andreae.* Canterbury U., Christchurch, N.Z. Electrical and Electronic Eng.Dept.*1983. 018682 Dantzig, G.B. Hoffman, A.J. Hu, T.C.*Triangulations (Tillings) and certain block triangular matrices.* Stanford U. O.R. Dept. Systems Optimization Lab.*SOL 83-17.*1983. 24p. 018683 Gevarter, W.B.*An overview of artificial intelligence and robotics. Volume 1 - Artificial intelligence, Part A - The core ingredients.* N.A.S.A.*NASA Tech.Memo. 85836.* 1983. 018684 Gevarter, W.B.*An overview of artificial intelligence and robotics. Volume II: Robotics.* U.S. National Bureau of Standards.*PB82-204439.*1982. 018685 Johnson, R.W.*Axiomatic characterization of a family of information measures that contains the directed divergences.* U.S. Naval Res.Lab.*NRL Memo.Rpt. 3646.* 1977. 018686 Knuth, D.E.*A test file for TEX.* Stanford U.*1983 (Version 0.999, July 1983). 139p. 018687 Knuth, D.E.* TEX82.* Stanford U.*1983 (Version 0.999, July 1983). 513p. 018688 Knuth, D.E.* TEXWARE.* Stanford U.*1983 (Version 2, July 1983). 144p. 018689 Symm, G.T. Wichmann, B.A. Kok, J. Winter, D.T.*Guidelines for the design of large modular scientific libaries in ADA.* Mathematisch Centrum.*NN 31/83.*1983. VOL. 6, NO. 2 03/01/84 018690 Hinrichs, K. Nievergelt, J.*The grid file: A data structure designed to support proximity queries on spatial objects.* Eidgenoessische Technische Hochschule Zuerich. Institut fuer Informatik.*Bericht 54.*1983. 018691 Gutknecht, J.* System programming in Modula-2: Mouse and bitmap display.* Eidgenoessische Technische Hochschule Zuerich. Institut fuer Informatik.*Bericht 56.*1983. 018692 Zehnder, C.A. (Ed.)* Database techniques for professional workstations.* Eidgenoessische Technische Hochschule Zuerich. Institut fuer Informatik.*Bericht 55.*1983. 018693 Carter, W.C.* Architectural considerations for detecting run time errors in programs.* IBM Watson Res. Center.*RC 09976.*1983. 018694 Tang, D.T. Chen, C.L.*Efficient exhaustive pattern generation for logic testing.* IBM Watson Res. Center.*RC 10064.*1983. 018695 Liniger, W.*A fast direct Poisson solver for general regions.* IBM Watson Res. Center.*RC 10067.*1983. 018696 Goldberg, M.K. Burstein, M.* Heuristic improvement technique for bisection of VLSI networks.* IBM Watson Res. Center.*RC 10069.*1983. 018697 Pickover, C.A.*The use of a vector graphics system in the presentation of alternate representations of synthetic speech data.* IBM Watson Res. Center.*RC 10084.*1983. 018698 Bloom, S.L. Wagner, E.G.* Many sorted theories and their algebras with some applications to data types.* IBM Watson Res. Center.*RC 10089.*1983. 018699 Francez, N. Kozen, D.* Generalized fair termination.* IBM Watson Res. Center.*RC 10092.*1983. 018700 Dahmen, W. Micchelli, C.A.*Some results on box splines.* IBM Watson Res. Center.*RC 10094.*1983. 018701 Buerger, W.F.*A front end development tool for the PC.* IBM Watson Res. Center.*RC 10098.*1983. 018702 Carroll, J.M. Carrithers, C.*Blocking user error states in a training system.* IBM Watson Res. Center.*RC 10100.* 1983. 018703 Nadas, A.* Parametric empirical Bayes estimation of probabilities in a Markovian linguistic component of the IBM speech recognition system.* IBM Watson Res. Center.* RC 10102.*1983. 018704 Tolaba, J.H.* On line surveys of user and employee satisfaction.* IBM Watson Res. Center.*RC 10106.*1983. 018705 Pickover, C.A.* Synthetic singing voices: A speech synthesizer generates an excerpt from Handel's Messiah.* IBM Watson Res. Center.*RC 10118.*1983. 018706 Marazas, G.A. Blum, A.M. MacNair, E.A.*A research queueing package ( RESQ) model of a transaction processing system with DASD cache.* IBM Watson Res. Center.*RC 10123.*1983. 018707 Kelley, J.F.*Validating an empirical methodology for writing user friendly natural language computer applications.* IBM Watson Res. Center.*RC 10127.*1983. 018708 Sheridan, P.B. Haibt, L.M. Nelson, R.A.*Casting Boolean Logic arrays into petri nets.* IBM Watson Res. Center.*RC 10130.*1983. 018709 Shasha, D.E. Pnueli, A. Ewald, W.* Temporal verification of carrier sense local area network protocols.* IBM Watson Res. Center.*RC 10132.*1983. 018710 de Souza e Silva, E. Lavenberg, S.S. Muntz, R.R.*A perspective on iterative methods for the approximate analysis of closed queueing networks.* IBM Watson Res. Center.*RC 10141.*1983. 018711 Mohan, C. Lindsay, B.*Efficient commit protocols for the tree of processes model of distributed transactions.* IBM Watson Res. Center.*RJ 3881.*1983. 018712 Mohan, C. Fussell, D. Kedem, Z.* Lock conversion in non two phase locking protocols.* IBM Watson Res. Center.*RJ 3947.*1983. 018713 Mohan, C. Fussell, D.* Compatibility and commutativity of lock modes.* IBM Watson Res. Center.*RJ 3948.*1983. 018714 Halpern, J.Y.* Deterministic process logic is elementary.* IBM Watson Res. Center.*RJ 3968.*1983. 018715 Karnin, E.D.*A parallel algorithm for the knapsack problem.* IBM Watson Res. Center.*RJ 3980.*1983. 018716 Chung, F.R.K. Tarjan, R.E. Paul, W.J.* Coding strings by pairs of strings.* IBM Watson Res. Center.*RJ 3989.*1983. 018717 Backus, J.*The coming revolution in computing.* IBM Watson Res. Center.*RJ 3994.*1983. 018718 Bux, W. Meister, B. Wong, J.W.* Bridges for interconnection of ring networks - a simulation study.* IBM Watson Res. Center.*RZ 1241.*1983. 018719 Bonnans, J.F.*Analysis and control of a non linear parabolic unstable system.* Inria.*Rapports de Recherche 220.*1983. 018720 Le Boudec, J.-Y.*Etude generale d'un reseau constitue de deux stations hyperexponentielles.* Inria.*Rapports de Recherche 221.*1983. 018721 Cochet, Y.*Langage de dyck et groupe symetrique.* Inria.* Rapports de Recherche 222.*1983. 018722 Bosc, P. Courant, M. Robin, S. Trilling, L.*Havane: Un systeme de mise en relation automatique de petites annonces.* Inria.*Rapports de Recherche 223.*1983. 018723 Gardarin, G. Bernadat, P. Temmerman, N. Valduriez, P. Viemont, Y.*Conception d'un systeme de bases de donnees relationnnel multiprocesseur.* Inria.*Rapports de Recherche 224.*1983. 018724 Berry, G. Curien, P.-L.*Theory and practice of sequential algorithms: The kernel of the applicative language CDS.* Inria.*Rapports de Recherche 225.*1983. 018725 Schroeder, A.* Integrated program measurement and documentation tools.* Inria.*Rapports de Recherche 227.* 1983. 018726 Vercoustre, A.-M.* Minerve: Un meta-editeur syntaxique.* Inria.*Rapports de Recherche 229.*1983. 018727 Marie, R.A. Stewart, W.J.*On exact and approximate iterative methods for general queueing networks.* Inria.* Rapports de Recherche 230.*1983. 018728 Wollman, S.* Existence and uniqueness theory of the Vlasov equation.* New York U. Inst. of Math.Sci.* DOE/ER/03077-181.*1982. 018729 Kerner, W. Weitzner, H.*Axisymmetric, non-ideal MHD states with steady flow.* New York U. Inst. of Math.Sci.* DOE/ER/03077-201.*1983. 018730 Berger, M.J. Jameson, A.*Automatic adaptive grid refinement for the Euler equations.* New York U. Inst. of Math.Sci.* DOE/ER/03077-202.*1983. 018731 Goodman, J.B. LeVeque, R.J.*On the accuracy of stable schemes for 2D scalar conservation laws.* New York U. Inst. of Math.Sci.*DOE/ER/03077-203.*1983. 018732 Lax, P.D.*Problems solved and unsolved concerning linear and nonlinear partial differential equations.* New York U. Inst. of Math.Sci.*DOE/ER/03077-204.*1983. 018733 Gottlieb, A.*Comparing the NYU ultracomputer with other large-scale parallel processors.* New York U. Inst. of Math.Sci.*DOE/ER/03077-205.*1983. 018734 Davidon, W.C. Nocedal, J.*Evaluation of step directions in optimization algorithms.* New York U. Inst. of Math.Sci.* DOE/ER/03077-206.*1983. 018735 Bevan, N.W.S. Watson, R.S.*The design and evaluation of the microtext authoring system for computer based training.* U.K. National Physical Lab. Info. Technology and Computing Div.*DITC 25/83.*1983. 018736 Warham, A.G.P.*The spatial variation of the electromagnetic field in a dielectric tube waveguide used as a standard field generator.* U.K. National Physical Lab. Info. Technology and Computing Div.*DITC 26/83.*1983. 018737 Curtis, A.R.*Numerical methods for solving stiff systems of ordinary differential equation of Is there life after gear?* U.K. National Physical Lab. Info. Technology and Computing Div.*DITC 29/83.*1983. 018738 Cox, M.G.* Topic libraries for mathematical computation.* U.K. National Physical Lab. Info. Technology and Computing Div.*DITC 30/83.*1983. 018739 Manning, D.R. Pay, B.E. Rengger, R.E. Schofield, D.* Research on automatic speech recognition at the National Physical Laboratory.* U.K. National Physical Lab. Info. Technology and Computing Div.*DITC 31/83.*1983. 018740 Oliver, P. (Ed.)*Implementation assessment of a network service: The test responder specification.* U.K. National Physical Lab. Info. Technology and Computing Div.*DITC 32/83.*1983. 018741 Hammarling, S.J. Long, E.M.R. Martin, D.W.*A generalized linear least squares algorithm for correlated observations, with special reference to degenerate data.* U.K. National Physical Lab. Info. Technology and Computing Div.*DITC 33/83.*1983. 018742 Maculan, N.*Relaxation lagrangienne: Le probleme du knapsack 0-1*.* Montreal U. Dept. d'Info. et de Recherche Operationnelle.*Publ. 435.*1982. 018743 Braga, L.P.V. Maculan, N.* Kriging theory and applications for automated cartography.* Montreal U. Dept. d'Info. et de Recherche Operationnelle.*Publ. 477.*1983. 018744 Cerny, E. Gecsei, J.* Functional description of connector switch attenuator networks.* Montreal U. Dept. d'Info. et de Recherche Operationnelle.*Publ. 479.*1983. 018745 Ferland, J.A. Potvin, J.-Y.* Generalized fractional programming: Algorithms, and numerical experimentation.* Montreal U. Dept. d'Info. et de Recherche Operationnelle.* Publ. 481.*1983. 018746 Aboulhamid, E.M. Cerny, E.* Built-in testing of unilateral iterative arrays.* Montreal U. Dept. d'Info. et de Recherche Operationnelle.*Publ. 482.*1983. 018747 Maculan, N.*Programmation lineaire en nombres entiers.* Montreal U. Dept. d'Info. et de Recherche Operationnelle.* Publ. 486.*1983. 018748 Helbling, J.-M.*Analyse discriminante et ellipsoides minimaux de couverture.* Montreal U. Dept. d'Info. et de Recherche Operationnelle.*Publ. 491.*1983. 018749 Hennessy, M.* Synchronous and asynchronous experiments of processes.* Edinburgh U. Comp.Sci.Dept.*CSR-125-82.*1982. 018750 Smyth, M.B.* Power domains and predicate transformers: A topological view.* Edinburgh U. Comp.Sci.Dept.* CSR-126-83.*1983. 018751 Milne, G.J.*The correctness of a simple silicon computer.* Edinburgh U. Comp.Sci.Dept.*CSR-127-83.*1983. 018752 Pettorossi, A. Skowron, A.* Complete modal theories for verifying communicating agents behaviour in recursive equations programs.* Edinburgh U. Comp.Sci.Dept.* CSR-128-83.*1983. 018753 Sannella, D.T. Burstall, R.M.* Structured theories in LCF.* Edinburgh U. Comp.Sci.Dept.*CSR-129-83.*1983. 018754 Backhouse, R.* Specification and proof of a regular language recogniser in synchronous CCS.* Edinburgh U. Comp.Sci.Dept.*CSR-130-83.*1983. 018755 Sanella, D. Wirsing, M.*A kernel language for algebraic specification and implementation.* Edinburgh U. Comp.Sci.Dept.*CSR-131-83.*1983. 018756 Stirling, C.*A proof theoretic characterization of observational equivalence.* Edinburgh U. Comp.Sci.Dept.* CSR-132-83.*1983. 018757 Henessy, M. Milner, R.* Algebraic laws for nondeterminism and concurrency.* Edinburgh U. Comp.Sci.Dept.*CSR-133-83.* 1983. 018758 Benson, D.B.* Counting paths: nondeterminism as linear algebra.* Edinburgh U. Comp.Sci.Dept.*CSR-134-83.*1983. 018759 Hennessy, M.*A model for nondeterministic machines.* Edinburgh U. Comp.Sci.Dept.*CSR-135-83.*1983. 018760 Sheilds, M.W. Wray, M.J.*A CCS specification of the OSI network service.* Edinburgh U. Comp.Sci.Dept.*CSR-136-83.* 1983. 018761 Costa, G. Stirling, C.*A fair calculus of communicating systems.* Edinburgh U. Comp.Sci.Dept.*CSR-137-83.*1983. 018762 Milne, G.J.*A formal basis for the analysis of circuit timing.* Edinburgh U. Comp.Sci.Dept.*CSR-138-83.*1983. 018763 Jerrum, M.*The complexity of finding minimum length generator sequeces.* Edinburgh U. Comp.Sci.Dept.* CSR-139-83.*1983. 018764 Sokolowski, S.*A note on tactics in LCF.* Edinburgh U. Comp.Sci.Dept.*CSR-140-83.*1983. 018765 Schmidt, D.*A programming notation for tactical reasoning.* Edinburgh U. Comp.Sci.Dept.*CSR-141-83.*1983. 018766 Schmidt, D.* Natural deduction theorem proving in set theory.* Edinburgh U. Comp.Sci.Dept.*CSR-142-83.*1983. 018767 Schmidt, D.*Detecting global variables in denotational specifications.* Edinburgh U. Comp.Sci.Dept.*CSR-143-83.* 1983. 018768 Mann, W.C.*An overview of the Nigel text generation grammar.* Southern California U. Info.Sci.Inst.* ISI/RR-83-113.*1983. 018769 Mann, W.C. Thompson, S.A.* Relational propositions in discourse.* Southern California U. Info.Sci.Inst.* ISI/RR-83-115.*1983. 018770 Kaczmarek, T. Mark, W. Wilczynski, D.*The CUE project.* Southern California U. Info.Sci.Inst.*ISI/RS-83-01.*1983. 018771 Swartout, W.R.* XPLAIN: A system for creating and explaining expert consulting programs.* Southern California U. Info.Sci.Inst.*ISI/RS-83-04.*1983. 018772 Casner, S.L. Cohen, D. Cole, E.R.*Issues in satellite packet video communication.* Southern California U. Info.Sci.Inst.*ISI/RS-83-05.*1983. 018773 Morgenstern, M.* Active databases as a paradigm for enhanced computing environments.* Southern California U. Info.Sci.Inst.*ISI/RS-83-07.*1983. 018774 Mann, W.C.* Inquiry semantics: A functional semantics of natural language grammar.* Southern California U. Info.Sci.Inst.*ISI/RS-83-08.*1983. 018775 Mann, W.C.*A linguistic overview of the Nigel text generation grammar.* Southern California U. Info.Sci.Inst.*ISI/RS-83-09.*1983. 018776 Finkel, R. Solomon, M. DeWitt, D. Landweber, L.*The Charlotte distributed operating system. Part IV of the First Report on the Crystal project.* Wisconsin U. Comp.Sci.Dept.*Tech.Rpt. 502.*1983. 018777 Qi, L.*An alternating method for stochastic linear programming with simple recourse.* Wisconsin U. Comp.Sci.Dept.*Tech.Rpt. 515.*1983. 018778 Mangasarian, O.L.*Simple computable bounds for solutions of linear complementarity problems and linear programs.* Wisconsin U. Comp.Sci.Dept.*Tech.Rpt. 519.*1983. 018779 Bent, S.W.* Stable transversals and stochastic functions in polyominoes.* Wisconsin U. Comp.Sci.Dept.*Tech.Rpt. 520.* 1983. 018780 Qi, L.* Forest iteration method for stochastic transportation problem.* Wisconsin U. Comp.Sci.Dept.* Tech.Rpt. 522.*1983. 018781 Uhr, L.*Pyramid multi-computers, and extensions and augmentations.* Wisconsin U. Comp.Sci.Dept.*Tech.Rpt. 523.*1983. 018782 Chou, H.-T. DeWitt, D.J. Katz, R.H. Klug, A.C.*Design and implementation of the Wisconsin storage system.* Wisconsin U. Comp.Sci.Dept.*Tech.Rpt. 524.*1983. 018783 Parter, S.V. Steuerwalt, M.* Iterative methods for discrete elliptic equations.* Wisconsin U. Comp.Sci.Dept.* Tech.Rpt. 525.*1983. 018784 Bitton, D. DeWitt, D.J. Turbyfill, C.* Benchmarking database systems a systematic approach.* Wisconsin U. Comp.Sci.Dept.*Tech.Rpt. 526.*1983. 018785 Kepecs, J. Solomon, M.* SODA: A simplified operating system for distributed applications.* Wisconsin U. Comp.Sci.Dept.*Tech.Rpt. 527, Ph.D. Thesis. Kepecs, J.* 1983. 018786 Byckling, E.* Coding of bilevel data at high resolution.* Helsinki U. of Tech.Dept. of Tech. Physics.*Report TKK-F-A517.*1983. 018787 Byckling, E.* Data flow in digital page production systems.* Helsinki U. of Tech.Dept. of Tech. Physics.*Report TKK-F-A518.*1983. 018788 Rushby, J.M.* Verification of secure systems.* Newcastle Upon Tyne U. Computing Lab.*No. 166.*1981. 018789 Rushby, J.M. Randell, B.*A distributed secure system.* Newcastle Upon Tyne U. Computing Lab.*No. 182.*1983. 018790 Zu-fan, M.* SCALE - A Fortran program for a scaling procedure.* Royal Inst. of Tech., Stockholm. Num.Anal. & Computing Sci.Dept.*TRITA-NA-8314.*1983. 018791 Pohl, P.* Pseudo random number generator MCV, a portable Fortran version.* Royal Inst. of Tech., Stockholm. Num.Anal. & Computing Sci.Dept.*TRITA-NA-8317.*1983. 018792 Sethi, I.K. Jayaramamurthy, S.N.* Surface classification using characteristic contours.* Wayne State U. Comp.Sci.Dept.*CSC-83-007.*1983. 018793 Zeigler, B.P. Oren, T.I.* Simulation education: Software augmented textbooks emphasizing modelling concepts.* Wayne State U. Comp.Sci.Dept.*CSC-83-008.*1983. 018794 Conrad, M. Kirby, K.G.*The enzymatic neuron as a reaction diffusion network of cyclic nucleotides.* Wayne State U. Comp.Sci.Dept.*CSC-83-009.*1983. 018795 Bank, R.E. Douglas, C.C.*Sharp estimates for multigrid rates of convergence with general smoothing and acceleration.* Yale U. Comp.Sci.Dept.*Res.Rpt. 277.*n.d. 018796 Boswell, I.J.*Improving the efficiency of heapsort.* Auckland U. Comp.Sci.Dept.*Rpt. 31.*1983. 018797 Guttman, A. Stonebraker, M.*R-trees: A dynamic index structure for spatial searching.* California U., Berkeley. Electronics Res.Lab.*Memo. No. UCB/ERL M83/64.* 1983. 018798 Stonebraker, M. Anderson, E. Hanson, E. Rubenstein, B.* Quel as a data type.* California U., Berkeley. Electronics Res.Lab.*Memo. No. UCB/ERL M83/73.*1983. 018799 Stonebraker, M.* Virtual memory transaction management.* California U., Berkeley. Electronics Res.Lab.*Memo. No. UCB/ERL M83/74.*1983. 018800 Oliver, R.M.*A forecasting column.* California U., Berkeley. O.R. Center.*ORC 83-07.*1983. 018801 Ross, S.M.*A random walk subject to a randomly changing environment.* California U., Berkeley. O.R. Center.*ORC 83-09.*1983. 018802 Jewell, W.S.*Approximating the distribution of a dynamic risk portfolio.* California U., Berkeley. O.R. Center.* ORC 83-15.*1983. 018803 Gale, D.* Ms. Machiavelli and the Gale Shapley algorithm.* California U., Berkeley. O.R. Center.*ORC 83-16.*1983. 018804 Ehrenfeucht, A. Haussler, D. Rozenberg, G.*On regularity of context free languages.* Colorado U. Comp.Sci.Dept.* CU-CS-235-82.*1982. 018805 Kolstad, R.B.* Distributed path Pascal: A language for programming coupled systems.* Illinois U. Comp.Sci.Dept.* UIUCDCS-R-83-1136, Ph.D. Thesis Kolstad, R.B.*1983. 018806 Orailoglu, A.* Software design issues in the implementation of hierarchical, display editors.* Illinois U. Comp.Sci.Dept.*UIUCDCS-R-83-1139, Ph.D. Thesis. Orailoglu, A.*1983. 018807 Yates, S.B.*A simulation study of learning algorithms applied to distributed processing communication networks.* Illinois U. Comp.Sci.Dept.*UIUCDCS-R-83-1140.*1983. 018808 Rus, T.* TICS system: A compiler generator.* Iowa U. Comp.Sci.Dept.*Tech.Rpt. 83-08.*1983. 018809 Eichmann, D.A.*A preprocessor approach to separate compilation in Ada.* Iowa U. Comp.Sci.Dept.*Tech.Rpt. 83-10.*1983. 018810 Shultz, R.K.* Simulation of multiprocessor computer architectures using ACL.* Iowa U. Comp.Sci.Dept.* Tech.Rpt. 83-11.*1983. VOL. 6, NO. 3 03/19/84 018811 Borodin, A. Gathen, J. von zur Hopcoft, J.*Fast parallel matrix and GCD computations.* Cornell U. CS Dept * Tech.Rpt. 82-487.*1982. 018812 Whitesides, S.H.*A method for solving certain graph recognition and optimization problems, with applications to perfect graphs.* Cornell U. CS Dept *Tech.Rpt. 82-488.*1982. 018813 Lamport, L. Schneider, F.B.*The " Hoare logic" of CSP, and all that.* Cornell U. CS Dept *Tech.Rpt. 82-490.* 1982. 018814 Schlichting, R.D. Schneider, F.B.*Using message passing for distributed programming: proof rules and disciplines.* Cornell U. CS Dept *Tech.Rpt. 82-491.*1982. 018815 Bates, J.L. Constable, R.L.*The definition of mu-prl.* Cornell U. CS Dept *Tech.Rpt. 82-492.*1981. 018816 Gries, D.*The 711 problem.* Cornell U. CS Dept * Tech.Rpt. 82-493.*1982. 018817 Van Loan, C.*A symplectic method for approximating all the eigenvalues of a Hamiltonian matrix.* Cornell U. CS Dept *Tech.Rpt. 82-494.*1982. 018818 Conway, R.W. Schneider, F.B. Skeen, D.* Northwest by southeast: database task batching and pipelining.* Cornell U. CS Dept *Tech.Rpt. 82-495.*1982. 018819 Skeen, D.*Determining the last process to fail.* Cornell U. CS Dept *Tech.Rpt. 82-496.*1983. 018820 Whitesides, S.H.*A classification of certain graphs with minimal imperfection properties.* Cornell U. CS Dept *Tech.Rpt. 82-497.*1982. 018821 Joseph, D.* Polynomial time computations in models of ET.* Cornell U. CS Dept *Tech.Rpt. 82-500.*1982. 018822 Joseph, D.A. Young, P.R.*A survey of some recent results on computational complexity in weak theories of arithmetic.* Cornell U. CS Dept *Tech.Rpt. 82-501.*1982. 018823 Coleman, T.F. More, J.J.*Software for estimating sparse Jacobian matrices.* Cornell U. CS Dept *Tech.Rpt. 82-502.*1982. 018824 Hood, R.*The efficient implementation of very high level programming language constructs.* Cornell U. CS Dept *Tech.Rpt. 82-503, Ph.D. Thesis. Hood, R.* 1982. 018825 Pritchard, P.*A case study of number theoretic computation: searching for primes in arithmetic progression.* Cornell U. CS Dept *Tech.Rpt. 82-504.*1982. 018826 Misra, J. Gries, D.*Finding repeated elements.* Cornell U. CS Dept *Tech.Rpt. 82-505.*1982. 018827 Gilbert, J.R. Hutchinson, J.P. Tarjan, R.E.*A separator theorem for graphs of bounded genus.* Cornell U. CS Dept *Tech.Rpt. 82-506.*1982. 018828 Haggard, G. Skeen, D.*Extensions of the reduction process in the Wong Youssefi strategy for query processing.* Cornell U. CS Dept *Tech.Rpt. 82-507.*1982. 018829 Hartmanis, J.*On sparse sets in NP-P.* Cornell U. CS Dept *Tech.Rpt. 82-508.*1982. 018830 Coleman, T.F. Conn, A.R.*On the local convergence of a quasi Newton method for the nonlinear programming problem.* Cornell U. CS Dept *Tech.Rpt. 82-509.* 1982. 018831 Coleman, T.F. Sorensen, D.C.*A note on the computation of an orthonormal basis for the null space of a matrix.* Cornell U. CS Dept *Tech.Rpt. 82-510.*1982. 018832 Salton, G. Fox, E. Wu, H.*Extended boolean information retrieval.* Cornell U. CS Dept *Tech.Rpt. 82-511.* 1982. 018833 Babaoglu, O. Ferrari, D.* Hierarchical replacement decisions in hierarchical stores.* Cornell U. CS Dept *Tech.Rpt. 82-512.*1982. 018834 Alpern, B. Schneider, F.B.* Key exchange using "keyless cryptography".* Cornell U. CS Dept *Tech.Rpt. 82-513.*1982. 018835 Reps, T.*Generating language based environments.* Cornell U. CS Dept *Tech.Rpt. 82-514, Ph.D. Thesis. Reps, T.*1982. 018836 Hopcraft, J.E. Joseph, D.A. Whitesides, S.H.* Movement problems for 2-dimensional linkages.* Cornell U. CS Dept *Tech.Rpt. 82-515.*1982. 018837 Hopcraft, J. Joseph, D. Whitesides, S.*Determining points of a circular region reachable by joints of a robot arm.* Cornell U. CS Dept *Tech.Rpt. 82-516.*1982. 018838 Cole, R.* Graph rigidity.* Cornell U. CS Dept * Tech.Rpt. 82-517.*1982. 018839 Brent, R.P. Luk, F.T.*Computing the Cholesky factorization using a systolic architecture.* Cornell U. CS Dept * Tech.Rpt. 82-521.*1982. 018840 Andrews, G.R. Schneider, F.B.*Concepts and notations for concurrent programming.* Cornell U. CS Dept * Tech.Rpt. 82-520.*1982. 018841 Brent, R.P. Luk, F.T.*A systolic architecture for the singular value decomposition.* Cornell U. CS Dept * Tech.Rpt. 82-522.*1982. 018842 Gilbert, J.R. Rose, D.J.*A separator theorem for chordal graphs.* Cornell U. CS Dept *Tech.Rpt. 82-523.* 1982. 018843 Salton, G. Buckley, C. Fox, E.A.* Automatic query formulations in information retrieval.* Cornell U. CS Dept *Tech.Rpt. 82-524.*1982. 018844 Brent, R.P. Luk, F.T.*A systolic architecture for almost linear time solution of the symmetric eigenvalue problem.* Cornell U. CS Dept *Tech.Rpt. 82-525.*1982. 018845 Brent, R.P. Luk, F.T.*A systolic array for the linear time solution of Toeplitz systems of equations.* Cornell U. CS Dept *Tech.Rpt. 82-526.*1982. 018846 Brent, R.P. Luk, F.T. Van Loan, C.*Computation of the singular value decomposition using mesh connected processors.* Cornell U. CS Dept *Tech.Rpt. 82-528.* 1982. 018847 Birman, K.P.*Using SEEK for multi channel pattern recognition.* Cornell U. CS Dept *Tech.Rpt. 82-529.* 1982. 018848 Bates, J.L. Constable, R.L.* Proofs as programs.* Cornell U. CS Dept *Tech.Rpt. 82-530.*1983. 018849 Gries, D.*A note on the standard strategy for developing loop invariants and loops.* Cornell U. CS Dept * Tech.Rpt. 82-531.*1982. 018850 Conway, R. Worona, S.* COFE: A prototype memo and mail system for nonprogrammers.* Cornell U. CS Dept * Tech.Rpt. 82-536.*1982. 018851 Constable, R.L.* Constructive mathematics as a programming logic I: Some principles of theory.* Cornell U. CS Dept *Tech.Rpt. 83-554.*1983. 018852 Raeuchle, T. Toueg, S.*Exposure to deadlock for communicating processes is hard to detect.* Cornell U. CS Dept *Tech.Rpt. 83-555.*1983. 018853 Wright, D.D. Schneider, R.B.*A distributed path algorithm and its correctness proof.* Cornell U. CS Dept * Tech.Rpt. 83-556.*1983. 018854 Bracha, G. Toueg, S.*A distributed algorithm for generalized deadlock detection.* Cornell U. CS Dept *Tech.Rpt. 83-558.*1983. 018855 Bracha, G. Toueg, S.* Asynchronous censensus and Byzantine protocols in faulty environments.* Cornell U. CS Dept *Tech.Rpt. 83-559.*1983. 018556 Fox, E.A.*Some considerations for implementing the SMART information retrieval system under UNIX.* Cornell U. CS Dept *Tech.Rpt. 83-560.*1983. 018857 Fox, E.A.*Characterization of two new experimental collections in computer and information science containing textual and bibliographic concepts.* Cornell U. CS Dept *Tech.Rpt. 83-561.*1983. 018858 Brent, R.P. Luk, F.T.*The solution of singular value and symmetric eigenvalue problems on multiprocessor arrays.* Cornell U. CS Dept *Tech.Rpt. 83-562.*1983. 018859 Brent, R.P. Luk, F.T. Van Loan, C.*Computation of the generalized singular value decomposition using mesh connected processors.* Cornell U. CS Dept * Tech.Rpt. 83-563.*1983. 018860 Salton, G. Fox, E.A. Voorhees, E.*A comparison of two methods for boolean query relevance feedback.* Cornell U. CS Dept *Tech.Rpt. 83-564.*1983. 018861 Constable, R.L.* Mathematics as programming.* Cornell U. CS Dept *Tech.Rpt. 83-565.*1983. 018862 Qian, J.*An assertional proof of a Byzantine agreement protocal.* Cornell U. CS Dept *Tech.Rpt. 83-566.* 1983. 018863 Bajaj, C. Li, M.*On the duality of intersections and closest points.* Cornell U. CS Dept *Tech.Rpt. 83-568.*1983. 018864 Schneider, F.B.* Byzantine generals in action: implementing fail stop processors.* Cornell U. CS Dept * Tech.Rpt. 83-569.*1983. 018865 Salton, G. Fox, E.A. Voorhees, E.*Advanced feedback methods in information retrieval.* Cornell U. CS Dept * Tech.Rpt. 83-570.*1983. 018866 Conway, R.*The case for PL/I as the language for instruction in programming.* Cornell U. CS Dept * Tech.Rpt. 83-571.*1983. 018867 Wright, D.D.*Managing distributed databases in partitioned networks.* Cornell U. CS Dept *Tech.Rpt. 83-572.* 1983. 018868 Hartmanis, J.* Generalized Kolmogorov complexity and the structure of feasible computations.* Cornell U. CS Dept *Tech.Rpt. 83-573.*1983. 018869 Pritchard, P. Gries, D.*The seven eleven problem.* Cornell U. CS Dept *Tech.Rpt. 83-574.*1983. 018870 Sewelson, V.*A study of the structure of NP.* Cornell U. CS Dept *Tech.Rpt. 83-575.*1983. 018871 Gottlieb, A. Kruskal, C.P.* Supersaturated ultracomputer algorithms.* New York U. Inst. of Math. Sci. CS Dept *Tech.Rpt. 024.*1980. 018872 Gottlieb, A.* WASHCLOTH - The logical successor to soapsuds.* New York U. Inst. of Math. Sci. CS Dept * Tech.Rpt. 029.*1980. 018873 Gottlieb, A. Schwartz, J.T.* Networks and algorithms for very large scale parallel computation.* New York U. Inst. of Math. Sci. CS Dept *Tech.Rpt. 030.*1981. 018874 Kruskal, C.P.* Supersaturated paracomputer algorithms.* New York U. Inst. of Math. Sci. CS Dept *Tech.Rpt. 031.* 1981. 018876 Lubachevsky, B.D.* Verification of several parallel coordination programs based on descriptions of their reachability sets.* New York U. Inst. of Math. Sci. CS Dept *Tech.Rpt. 036.*1981. 018877 Snir, M.*On parallel searching.* New York U. Inst. of Math. Sci. CS Dept *Tech.Rpt. 045.*1982. 018878 Kruskal, C.P. Snir, M.*Some results on multistage interconnection networks for multiprocessors.* New York U. Inst. of Math. Sci. CS Dept *Tech.Rpt. 051.* 1982. 018879 Lubachevsky, B.D.*An approach to automating the verification of compact parallel coordination programs.* New York U. Inst. of Math. Sci. CS Dept *Tech.Rpt. 060; New York U. Inst. of Math. Sci.*Ultracomputer Note 045.*1982. 018880 Vishkin, U.*On choice of a model of parallel computation.* New York U. Inst. of Math. Sci. CS Dept *Tech.Rpt. 061; New York U. Inst. of Math. Sci.*Ultracomputer Note 050.*1982. 018881 Lubachevsky, B.D.*An approach to automating the verification of compact parallel coordination programs. II.* New York U. Inst. of Math. Sci. CS Dept * Tech.Rpt. 064; New York U. Inst. of Math. Sci.* Ultracomputer Note 049.*1983. 018882 Meertens, L.* Bitonic sort on Ultracomputer.* New York U. Inst. of Math. Sci.*Ultracomputer Note 001.*1979. 018883 Meertens, L.*Recurrent ultracomputers are not log n-fast.* New York U. Inst. of Math. Sci.*Ultracomputer Note 002.* 1979. 018884 Schwartz, J.T.*Preliminary thoughts on ultracomputer programming style.* New York U. Inst. of Math. Sci.* Ultracomputer Note 003.*1979. 018885 Schwartz, J.*A remark on nearly planar embeddings of small ultracomputers.* New York U. Inst. of Math. Sci.* Ultracomputer Note 004.*1979. 018886 Schwartz, J.T.*The Burroughs FMP machine.* New York U. Inst. of Math. Sci.*Ultracomputer Note 005.*1980. 018887 Kruskal, C. Rudolph, L.*Observations concerning multidimensional ultracomputers.* New York U. Inst. of Math. Sci.*Ultracomputer Note 006.*1980. 018888 Gottlieb, A. Kruskal, C.*A data motion algorithm.* New York U. Inst. of Math. Sci.*Ultracomputer Note 007.*1980. 018889 Rudolph, L.*A remark on the planarity of the shuffle exchange network of sizes 16 and 32.* New York U. Inst. of Math. Sci.*Ultracomputer Note 008.*1980. 018890 Gottlieb, A.*Another remark on the planarity of the shuffle exchange network of sizes 16 and 32.* New York U. Inst. of Math. Sci.*Ultracomputer Note 009.*1980. 018891 Gottlieb, A.* PLUS: A PL/I based ultracomputer simulator, I.* New York U. Inst. of Math. Sci.*Ultracomputer Note 010.*1980. 018892 Gottlieb, A.* MOP--A (minimal) multiprocessor operating system extending WASHCLOTH.* New York U. Inst. of Math. Sci.*Ultracomputer Note 013.*1980. 018893 Gottlieb, A.* PLUS: A PL/I based ultracomputer simulator, II.* New York U. Inst. of Math. Sci.*Ultracomputer Note 014.*1980. 018894 Gottlieb, A. Kruskal, C.* MULT - A multitasking ultracomputer language with timing, I & II.* New York U. Inst. of Math. Sci.*Ultracomputer Note 015.*1980. 018895 Peskin, C.S. Widlund, O.B.*Remarks on efficient numerical algorithms for ultracomputers.* New York U. Inst. of Math. Sci.*Ultracomputer Note 018.*1981. 018896 Peskin, C.S.* Ultracomputer implementation of odd even reduction.* New York U. Inst. of Math. Sci.*Ultracomputer Note 019.*1981. 018897 Peskin, C.S.*A comparison of ultracomputer architecture and lattice architecture for problems on lattices.* New York U. Inst. of Math. Sci.*Ultracomputer Note 020.*1981. 018898 Gottlieb, A.* WASHCLOTH 81.* New York U. Inst. of Math. Sci.*Ultracomputer Note 021.*1981. 018899 Rushfield, N.* Atmospheric computations on highly parallel MIMD computers.* New York U. Inst. of Math. Sci.* Ultracomputer Note 022.*1981. 018900 Korn, D.*Converting scientific codes to run under the WASHCLOTH simulator.* New York U. Inst. of Math. Sci.* Ultracomputer Note 023.*1981. 018901 Korn, D.* Timing analysis for scientific codes run under WASHCLOTH simulation.* New York U. Inst. of Math. Sci.* Ultracomputer Note 024.*1981. 018903 Snir, M.*"Netsim" network simulator for the ultracomputer.* New York U. Inst. of Math. Sci.*Ultracomputer Note 028.* 1981. 018905 Korn, D.* Timing simulations for elliptic PDE's fun under WASHCLOTH.* New York U. Inst. of Math. Sci.*Ultracomputer Note 031.*1981. 018906 Gottlieb, A. Kruskal, C.P.* Coordinating parallel processors: A partial unification.* New York U. Inst. of Math. Sci.*Ultracomputer Note 034.*1981. 018907 Lubachevsky, B.D.*Review of Soviet publications on parallel data processing (1978-1980).* New York U. Inst. of Math. Sci.*Ultracomputer Note 035.*1981. 018908 Lubachevsky, B.D.*A parallel computer implementation of the ascend/descend types of vector algorithms.* New York U. Inst. of Math. Sci.*Ultracomputer Note 037.*1981. 018909 Snir, M.*Comments on lens and hypertrees - or the perfect shuffle again.* New York U. Inst. of Math. Sci.* Ultracomputer Note 038.*1981. 018910 Gottlieb, A.*A historical guide to the ultracomputer literature.* New York U. Inst. of Math. Sci.* Ultracomputer Note 036.*1981. 018911 Snir, M. Solworth, J.*The ultraswitch--A VLSI network node for parallel processing.* New York U. Inst. of Math. Sci.* Ultracomputer Note 039.*1982. 018812 Lubachevsky, B.D.* Parallelizing an algorithm of Charles S. Peskin for describing incompressible flow of a fluid coupled to an elastic membrane.* New York U. Inst. of Math. Sci.*Ultracomputer Note 042.*1982. 018813 Bianchini, R. Bianchini, R. Jr.* Wireability of an ultracomputer.* New York U. Inst. of Math. Sci.* Ultracomputer Note 043.*1982. 018914 Zhong, Y-Q. Kalos, M.H.* Monte Carlo transport calculations on an ultracomputer.* New York U. Inst. of Math. Sci.* Ultracomputer Note 046.*1982. 018915 Bernstein, H.J. Goldstein, M.* RINSE - What follows WASHCLOTH.* New York U. Inst. of Math. Sci.*Ultracomputer Note 047.*n.d. 018916 Kalos, M.H.*The NYU ultracomputer.* New York U. Inst. of Math. Sci.*Ultracomputer Note 048.*1983. 018917 Wieczorek, A.* Fixed points of multifunctions in general convexity spaces.* Polish Academy of Sciences. Inst. of Comp.Sci.*ICS PAS Rpt. No. 508.*1983. 018918 Orlowska, E.* Measurement and indiscernibility.* Polish Academy of Sciences. Inst. of Comp.Sci.*ICS PAS Rpt. No. 509.*1983. 018919 Leszcylowski, J. Rudnicki, P.*Computer assisted reasoning.* Polish Academy of Sciences. Inst. of Comp.Sci.*ICS PAS Rpt. No. 510.*1983. 018920 Danecki, R. Karpinski, M.* Binary L systems and generalized tree automata.* Polish Academy of Sciences. Inst. of Comp.Sci.*ICS PAS Rpt. No. 512.*1983. 018921 Kowalski, A.*Useful rules of reasoning.* Polish Academy of Sciences. Inst. of Comp.Sci.*ICS PAS Rpt. No. 515.*1983. 018922 Wieczorek, A.* Constrained and indefinite games and their applications.* Polish Academy of Sciences. Inst. of Comp.Sci.*ICS PAS Rpt. No. 517.*1983. 018923 Winkowski, J.*A distributed implementation of Petri nets.* Polish Academy of Sciences. Inst. of Comp.Sci.*ICS PAS Rpt. No. 518.*1983. 018924 Veloso, P.A.S.*On the logic of namable models.* Pontificia U., Rio de Janeiro. Info.Dept.*No. 14/83.*1983. 018925 Veloso, P.A.S. Maibaum, T.S.E.*A theory of abstract data types for program development: Bridging the gap?* Pontificia U., Rio de Janeiro. Info.Dept.*No. 15/83.* 1983. 018926 Ruas, V.*Automatic generation of tetrahedral meshes with application to finite element solution of Stefan problems.* Pontificia U., Rio de Janeiro. Info.Dept.*No. 18/83.*1983. 018927 Veloso, P.A.S. Martins, R.C.B.*On some notions of reduction among general problems.* Pontificia U., Rio de Janeiro. Info.Dept.*No. 19/83.*1983. 018928 Itai, A. Rosberg, Z.*A golden ratio control policy for a multiple access channel.* Technion - Israel Inst. of Tech. CS Dept *Tech.Rpt. 256.*1983. 018929 Even, S. Goldreich, O.* DES like functions can generate the alternating group.* Technion - Israel Inst. of Tech. CS Dept *Tech.Rpt. 258.*1983. 018931 Bar-Yehuda, R. Even, S.*A local ratio theorem for approximating the weighted vertex cover problem.* Technion - Israel Inst. of Tech. CS Dept *Tech.Rpt. 260.*1983. 018932 Markowitz, V.M. Raz, Y.* ERROL: An entity relationship, role oriented, query language.* Technion - Israel Inst. of Tech. CS Dept *Tech.Rpt. 262.*1983. 018933 Markowitz, V.M. Raz, Y.*Modifying the relational algebra for use in an entity relationship environment.* Technion - Israel Inst. of Tech. CS Dept *Tech.Rpt. 263.* 1983. 018934 Gordon, D. Koren, I. Silberman, G.M.* Embedding tree structures in fault tolerant VLSI hexagonal array.* Technion - Israel Inst. of Tech. CS Dept *Tech.Rpt. 265.*1983. 018935 Korach, E. Moran, S. Zaks, S.*0(n log n) lower and upper bounds for a class of distributed algorithms for a complete network of processors (extended abstract).* Technion - Israel Inst. of Tech. CS Dept *Tech.Rpt. 272.*1983. 018936 Chlamtac, I. Eisenger, M.*Voice/data integration on Ethernet: backoff and priority considerations.* Technion - Israel Inst. of Tech. CS Dept *Tech.Rpt. 273.* 1983. 018937 Chlamtac, I. Kutten, S.*On broadcasting and spatial reuse in radio networks - problem analysis and design of protocols with provable properties.* Technion - Israel Inst. of Tech. CS Dept *Tech.Rpt. 274.*1983. 018938 Markowitz, V.M. Raz, Y.* RRA: A reshaped relational algebra.* Technion - Israel Inst. of Tech. CS Dept * Tech.Rpt. 278.*1983. 018939 Awerbuch, B. Even, S.*A formal approach to communication network protocol; broadcast, as a case study.* Technion - Israel Inst. of Tech. CS Dept *Tech.Rpt. 284.*1983. 018940 Even, S. Goldreich, O.*On the security of multi party ping pong protocols.* Technion - Israel Inst. of Tech. CS Dept *Tech.Rpt. 285.*1983. 018941 Makowsky, J.A.* Abstract embedding relations.* Technion - Israel Inst. of Tech. CS Dept *Tech.Rpt. 286.*1983. 018942 Willmertinger, W.*Denotationelle beschreibung von Prozessoren und Prozessorsystemen zur generierung von simulatoren.* Technische Universitaet Muenchen. Institut fuer Informatik.*TUM-I8305.*1983. 018943 Ganzinger, H.*Increasing modularity and language independency in automatically generated compilers.* Technische Universitaet Muenchen. Institut fuer Informatik.*TUM-I8306.*1983. 018944 Kiessling, W.*Datenbanksysteme fuer rechenanlagen mit intelligenten subsystemen: architektur, algorithmen, optimierung.* Technische Universitaet Muenchen. Institut fuer Informatik.*TUM-I8307.*1983. 018945 Schreck, H.*Ueber ein diskretes optimierungsproblem mit baumstruktur aus der versorgungsplanung.* Technische Universitaet Muenchen. Institut fuer Mathematik.* TUM-M8306.*1983. 018946 Hayes, S.*The Gelfand topology for complex spaces.* Technische Universitaet Muenchen. Institut fuer Mathematik.*TUM-M8307.*1983. 018947 Jakubowicz, A.*Ueber den symmetrischen homomorphismus, der durch eine derivation im antisymmetrischen tensorraum vom typ (0,2) induziert ist.* Technische Universitaet Muenchen. Institut fuer Mathematik.*TUM-M8308.*1983. 018948 Kosin, E.*Ein homotopieverfahren zur numerischen berechnung von Loesungszweigen nichtlinearer gleichungssysteme mit spezieller anwendung auf die mehrzielmethode.* Technische Universitaet Muenchen. Institut fuer Mathematik.* TUM-M8309.*1983. 018949 Oberle, H.J.*Numerische berechnung optimaler steuerungen von Heizung und Kuehlung fuer ein realistisches sonnenhausmodell.* Technische Universitaet Muenchen. Institut fuer Mathematik.*TUM-M8310.*1983. 018950 Hauf, M.*Zur extrapolationsmethode bei gemischten hyperbolischen problemen.* Technische Universitaet Muenchen. Institut fuer Mathematik.*TUM-M8311.*1983. 018951 Gschrei, U.*Ueber ein ein - maschinen - reihenfolgeproblem mit umruest - und lagerhaltungskosten bei vorgeschriebenem bedarf.* Technische Universitaet Muenchen. Institut fuer Mathematik.*TUM-M8312.*1983. 018952 Marnitz, J.*Behandlung von Wartenetzen mit mehreren subketten mach dem verfahren der operationalen analyse.* Hamburg U. Fachbereich Informatik.*Bericht Nr. 96.*1983. 018953 Lange, K-J.*Kontextfrei kontrollierte ETOL systeme.* Hamburg U. Fachbereich Informatik.*Bericht Nr. 97.*1983. 018954 Vernon, M.K.* Performance oriented design of distributed systems.* California U., L.A. CS Dept *CSD-821217, Ph.D. Thesis. Vernon, M.K.*1982. 018955 Walker, B.J.*Issues of network transparency and file replication in the distributed filesystem component of LOCUS.* California U., L.A. CS Dept *CSD-830905, Ph.D. Thesis. Walker, B.J.*1983. 018956 Thiel, G.I.* Partitioned operation and distributed data base management system catalogs.* California U., L.A. CS Dept *CSD-830906, Ph.D. Thesis. Thiel, G.I.* 1983. 018957 Miller, L.H. Devillez, G. Vidal, J.*Adaptive user interfaces for distributed information management.* California U., L.A. CS Dept *CSD-831031.*1983. 018958 Rangel, R.A.P.*Evaluation and design of integrated packet switching and circuit switching computer networks.* California U., L.A. CS Dept *CSD-831212, Ph.D. Thesis. Rangel, R.A.P.*1983. 018959 Wolfe, M.J.*Optimizing supercompilers for supercomputers.* Illinois U. CS Dept *UIUCDCS-R-83-1105, Ph.D. Thesis. Wolfe, M.J.*1982. 018960 Sheikh, Q.M.*Systems of nonlinear algebraic equations arising in simulation of semiconductor devices.* Illinois U. CS Dept *UIUCDCS-R-83-1133, Ph.D. Thesis. Sheikh, Q.M.*1983. 018961 Emrath, P.A.* Page indexing for textual information retrieval systems.* Illinois U. CS Dept * UIUCDCS-R-83-1141, Ph.D. Thesis. Emrath, P.A.*1983. 018962 Mickunas, M.D. Jalote, P.*The delay/re-read protocol for concurrency control in databases.* Illinois U. CS Dept *UIUCDCS-R-83-1145.*1983. 018963 Cook, S.A.*The classification of problems which have fast parallel algorithms.* Toronto U. CS Dept *Tech.Rpt. 164/83.*1983. 018964 Enright, W.H. Pryce, J.D.*Two Fortran packages for assessing initial value methods.* Toronto U. CS Dept *Tech.Rpt. 167/83.*1983. 018965 Flajolet, P. Ottmann, T. Wood, D.* Search trees and bubble memories.* Waterloo U. CS Dept *CS-83-02.*1983. 018966 Larson, P-A.* Performance analysis of a single-file version of linear hashing.* Waterloo U. CS Dept *CS-83-28.* 1983. 018967 Char, B.W. Geddes, K.O. Gonnet, G.H. (Eds.)*Record of the first annual Maple workshop June 11-12, 1983 Wild Echo Lodge Port Stanton, Ontario.* Waterloo U. CS Dept * CS-83-31.*1983. 018968 Chazelle, B. Ottmann, T. Soisalon-Soininen, E. Wood, D.*The complexity and decidability of separation.* Waterloo U. CS Dept *CS-83-34.*1983. 018969 Geddes, K.O.*(Chapter) 6. Newton's iteration and the Hensel construction.* Waterloo U. CS Dept *CS-83-26.*1983. 018970 Ottmann, T. Rosenberg, A.L. Six, H-W. Wood, D.* Binary search trees with binary comparison cost.* Waterloo U. CS Dept *CS-83-37.*1983. 018971 Czapor, S.R. Geddes, K.O.*A comparison of algorithms for the symbolic computation of Pade approximants.* Waterloo U. CS Dept *CS-83-39.*1983. 018972 Geddes, K.O. Gonnet, G.H. Char, B.W.* MAPLE user's manual third edition.* Waterloo U. CS Dept *CS-83-41.* 1983. 018973 Cunto, W.* Average case selection.* Waterloo U. CS Dept *CS-84-02, Ph.D. Thesis. Cunto, W.*1984. 018974 Leighton, F.T. Rivest, R.L.*Estimating a probability using finite memory (Extended abstract).* 018975 Leighton, F.T. Rivest, R.L.*The Markov chain tree theorem.* No issuing agency indicated (authors' addresses: Frank Thomson Leighton - Mathematics Department, Massachusetts Institute of Technology, Cambridge, Mass. 02139; Ronald L. Rivest - Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, Mass. 02139).*1982, revised (December 1982). 018976 Braegger, R.P. Reimer, M.* Predicative scheduling: integration of locking and optimistic methods.* Eidgenoessische Technische Hochschule Zuerich. Institut fuer Informatik.*Bericht 53.*1983. VOL. 6, NO. 4 04/26/84 041644 Stallman, R.M.*The SUPDUP protocol.* M.I.T. A.I. Lab.*Memo 644.*1983. 041702 Simmons, R.G. Davis, R.* Representations for reasoning about change.* M.I.T. A.I. Lab.*Memo 702.*1983. 041706 Ullman, S.*Computational studies in the interpretation of structure and motion: Summary and extension.* M.I.T. A.I. Lab.*Memo 706.*1983. 041708 McAllester, D.A.*Solving uninterpreted equations with context free expression grammars.* 041710 McAllester, D.A.* Symmetric set theory: A general theory of isomorphism, abstraction, and representation.* M.I.T. A.I. Lab.*Memo 710.*1983. 041711 Brady, M. Yuille, A.*An extremum principle for shape from contour.* M.I.T. A.I. Lab.*Memo 711.*1983. 041712 Koch, C. Poggio, T.* Information processing in dendritic spines.* M.I.T. A.I. Lab.*Memo 712.*1983. 041713 Koch, C. Poggio, T.*A theoretical analysis of electrical properties of spines.* M.I.T. A.I. Lab.*Memo 713.*1983. 041714 Ikeuchi, K.*Determining attitude of object from needle map using extended Gaussian image.* M.I.T. A.I. Lab.*Memo 714.*1983. 041716 Tonfoni, G. Doyle, R.J.*Understanding text through summarization and analogy.* M.I.T. A.I. Lab.*Memo 716.* 1983. 041717 Hollerbach, J.M. Sahar, G.* Wrist partitioned inverse kinematic accelerations and manipulator dynamics.* M.I.T. A.I. Lab.*Memo 717.*1983. 041719 Barber, G. de Jong, P. Hewitt, C.* Semantic support for work in organizations.* M.I.T. A.I. Lab.*Memo 719.*1983. 041721 Ullman, S.*Maximizing rigidity: The incremental recovery of 3-D structure from rigid and rubbery motion.* M.I.T. A.I. Lab.*Memo 721.*1983. 041722 Yuille, A.L. Poggio, T.* Scaling theorems for zero crossings.* M.I.T. A.I. Lab.*Memo 722.*1983. 041723 Ullman, S.* Visual routines.* M.I.T. A.I. Lab.*Memo 723.* 1983. 041724 Yuille, A.L.*The smoothest velocity field and token matching schemes.* M.I.T. A.I. Lab.*Memo 724.*1983. 041725 Brooks, R.A.* Planning collision free motions for pick and place operations.* M.I.T. A.I. Lab.*Memo 725.*1983. 041726 Ikeuchi, K. Horn, B.K.P. Nagata, S. Callahan, T. Feingold, O.* Picking up an object from a pile of objects.* M.I.T. A.I. Lab.*Memo 726.*1983. 041727 Hewitt, C. de Jong, P.*Analyzing the roles of descriptions and actions in open systems.* M.I.T. A.I. Lab.*Memo 727.* 1983. 041730 Yuille, A.L. Poggio, T.* Fingerprints theorems for zero crossings.* M.I.T. A.I. Lab.*Memo 730.*1983. 041734 Hildreth, E.C.*The computation of the velocity field.* M.I.T. A.I. Lab.*Memo 734.*1983. 041736 Donald, B.R.*Hypothesizing channels through free-space in solving the findpath problem.* M.I.T. A.I. Lab.*Memo 736.*1983. 041737 Nishihara, H.K. Poggio, T.* Hidden cues in random line stereograms.* M.I.T. A.I. Lab.*Memo 737.*1983. 041738 Grimson, W.E.L. Lozano-Perez, T.* Model based recognition and localization from sparse range or tactile data.* M.I.T. A.I. Lab.*Memo 738.*1983. 041740 Horn, B.K.P.* Extended Gaussian images.* M.I.T. A.I. Lab.* Memo 740.*1983. 041743 Nielsen, K.R.K. Poggio, T.* Vertical image registration in stereopsis.* M.I.T. A.I. Lab.*Memo 743.*1983. 041744 Ikeuchi, K.*Constructing a depth map from images.* M.I.T. A.I. Lab.*Memo 744.*1983. 041750 Hewitt, C. Lieberman, H.*Design issues in parallel architectures for artificial intelligence.* M.I.T. A.I. Lab.*Memo 750.*1983. 040720 Canny, J.F.*Finding edges and lines in images.* M.I.T. A.I. Lab.*TR-720.*1983. 040707 Hamscher, W.*Using structural & functional information in diagnostic design.* M.I.T. A.I. Lab.*TR-707.*1983. 040728 Theriault, D.G.*Issues in the design and implementation of Act2.* M.I.T. A.I. Lab.*TR-728.*1983. 020302 Arvind. Dertouzos, M.L. Iannucci, R.A.*A multiprocessor emulation facility.* M.I.T. Lab. for Comp.Sci.*TR-302.* 1983. 020303 Bloom, T.* Dynamic module replacement in a distributed programming system.* M.I.T. Lab. for Comp.Sci.*TR-303, Ph.D. Thesis. Bloom, T.*1983. 020304 Terman, C.J.* Simulation tools for digital LSI design.* M.I.T. Lab. for Comp.Sci.*TR-304, Ph.D. Thesis. Terman, C.J.*1983. 020305 Bhatt, S.N. Leighton, F.T.*A framework for solving VLSI graph layout problems.* M.I.T. Lab. for Comp.Sci.* TR-305.*1983. 020306 Leung, C.K.C. Lim, W.Y-P.* PADL - A packet architecture description language: A preliminary reference manual.* M.I.T. Lab. for Comp.Sci.*TR-306.*1983.}1 020307 Guttag, J.V. Horning, J.J.*Preliminary report on the Larch shared language.* M.I.T. Lab. for Comp.Sci.*TR-307.*1983. 020308 Oki, B.M.* Reliable object storage to support atomic actions.* M.I.T. Lab. for Comp.Sci.*TR-308.*1983. 020309 Brock, J.D.*A formal model of non-determinate dataflow computation.* M.I.T. Lab. for Comp.Sci.*TR-309, Ph.D. Thesis. Brock, J.D.*1983. 020310 Granville, R.A.* Cohesion in computer text generation: Lexical substitution.* M.I.T. Lab. for Comp.Sci.*TR-310.* 1983. 038220 Hughes, J.L.A.* Error detection and correction techniques for dataflow systems.* Stanford U. SEL. Comp. Systems Lab.*Tech. Note 220; Stanford U. SEL. Comp. Systems Lab. Center for Reliable Computing.*Tech.Rpt. 83-01.*1983. 038221 Xu, X.* Test generation and fault diagnosis for multiple faults in combinational circuits.* Stanford U. SEL. Comp. Systems Lab.*Tech. Note 221; Stanford U. SEL. Comp. Systems Lab. Center for Reliable Computing.*Tech.Rpt. 83-02.*1983. 038222 Hassan, S.Z. Hughes, J.L.A. Khakbaz, J. Lu, D.J. McCluskey, E.J. Namjoo, M. Xu, X.*The thirteenth annual conference on fault tolerant computing ( FTCS-13) preprints.* Stanford U. SEL. Comp. Systems Lab.*Tech. Note 222; Stanford U. SEL. Comp. Systems Lab. Center for Reliable Computing.*Tech.Rpt. 83-03.*1983. Contents: Preprints of six papers accepted for presentation at The thirteenth annual international conference on fault tolerant computing (FTCS-13), Milan, Italy, June 28-30, 1983. 038223 Min, Y.*Generating a complete test set for programmable logic arrays (PLAs).* Stanford U. SEL. Comp. Systems Lab.*Tech. Note 223; Stanford U. SEL. Comp. Systems Lab. Center for Reliable Computing.*Tech.Rpt. 83-04.*1983. 038224 Min, Y.*A unified fault model for programmable logic arrays.* Stanford U. SEL. Comp. Systems Lab.*Tech. Note 224; Stanford U. SEL. Comp. Systems Lab. Center for Reliable Computing.*Tech.Rpt. 83-05.*1983. 038225 Iyer, R.K. Rossetti, D.J.*Hard CPU related failures and system activity: measurement and modelling.* Stanford U. SEL. Comp. Systems Lab.*Tech. Note 225; Stanford U. SEL. Comp. Systems Lab. Center for Reliable Computing.* Tech.Rpt. 83-06.*1983. 038226 Velardi, P. Iyer, R.K.*A study of software failures and recovery in the MVS operating system.* Stanford U. SEL. Comp. Systems Lab.*Tech. Note 226; Stanford U. SEL. Comp. Systems Lab. Center for Reliable Computing.*Tech.Rpt. 83-07.*1983. 038227 McCluskey, E.J.* Verification testing: A pseudo-exhaustive test technique.* Stanford U. SEL. Comp. Systems Lab.* Tech. Note 227; Stanford U. SEL. Comp. Systems Lab. Center for Reliable Computing.*Tech.Rpt. 83-08.*1983. 038228 Iyer, R.K. Amer, H.H.*Effect of uncertainty in failure rate on memory system reliability.* Stanford U. SEL. Comp. Systems Lab.*Tech. Note 228; Stanford U. SEL. Comp. Systems Lab. Center for Reliable Computing.*Tech.Rpt. 83-09.*1983. 038229 Preprints of the international test conference - Cherry Hill '83.* Stanford U. SEL. Comp. Systems Lab.*Tech. Note 229; Stanford U. SEL. Comp. Systems Lab. Center for Reliable Computing.*Tech.Rpt. 83-10.*1983. Contents: (1) Hassan, S.Z.* Signature testing of sequential machines; (2) Lu, D.J. McCluskey, E.J.* Recurrent test patterns; (3) Mahmood, A. McCluskey, E.J. Lu, D.J.* Concurrent fault detection using a watchdog processor and assertions; (4) McCluskey, E.J.* Teaching testing. 038230 A real time systems symposium preprint.* Stanford U. SEL. Comp. Systems Lab.*Tech. Note 230; Stanford U. SEL. Comp. Systems Lab. Center for Reliable Computing.*Tech.Rpt. 83-11.*1983. 12p. Contents: Iyer, R.K. Rossetti, D.J.* Permanent CPU errors and system activity: measurement and modelling. 038231 Iyer, R.K. Velardi, P.*A statistical study of hardware related software errors in MVS.* Stanford U. SEL. Comp. Systems Lab.*Tech. Note 231; Stanford U. SEL. Comp. Systems Lab. Center for Reliable Computing.*Tech.Rpt. 83-12.*1983. 038232 Hassan, S.Z. McCluskey, E.J.* Testing PLAs using multiple parallel signature analyzers.* Stanford U. SEL. Comp. Systems Lab.*Tech. Note 232; Stanford U. SEL. Comp. Systems Lab. Center for Reliable Computing.*Tech.Rpt. 83-13.*1983. 038233 Patashnik, O.* Circuit segmentation for pseudo exhaustive testing.* Stanford U. SEL. Comp. Systems Lab.*Tech. Note 233; Stanford U. SEL. Comp. Systems Lab. Center for Reliable Computing.*Tech.Rpt. 83-14.*1983. 038234 McCluskey, E.J.*Exhaustive and pseudo exhaustive test.* Stanford U. SEL. Comp. Systems Lab.*Tech. Note 234; Stanford U. SEL. Comp. Systems Lab. Center for Reliable Computing.*Tech.Rpt. 83-15.*1983. 038235 Mahmood, A. McCluskey, E.J. Lu, D.J.* Concurrent fault detection using a watchdog processor and assertions.* Stanford U. SEL. Comp. Systems Lab.*Tech. Note 235; Stanford U. SEL. Comp. Systems Lab. Center for Reliable Computing.*Tech.Rpt. 83-16.*1983. 038236 Gross, T. Gill, J.*A short guide to MIPS assembly instructions.* Stanford U. SEL. Comp. Systems Lab.*Tech. Note 83-236.*1983. 038239 Alpert, D.* Performance tradeoffs for microprocessor cache memories.* Stanford U. SEL. Comp. Systems Lab.*Tech. Note 83-239.*1983. 038240 Hughes, J.L.A. McCluskey, E.J. Lu, D.J.*Design of totally self checking comparators with an arbitrary number of inputs.* Stanford U. SEL. Comp. Systems Lab.*Tech. Note 240; Stanford U. SEL. Comp. Systems Lab. Center for Reliable Computing.*Tech.Rpt. 83-18.*1983. 038241 Khakbaz, J. McCluskey, E.J.* Self testing embedded checkers.* Stanford U. SEL. Comp. Systems Lab.*Tech. Note 241; Stanford U. SEL. Comp. Systems Lab. Center for Reliable Computing.*Tech.Rpt. 83-19.*1983. 038242 Archambeau, E.C. McCluskey, E.J.* Fault coverage of pseudo exhaustive testing.* Stanford U. SEL. Comp. Systems Lab.* Tech. Note 242; Stanford U. SEL. Comp. Systems Lab. Center for Reliable Computing.*Tech.Rpt. 83-20.*1983. 035236 Hennessy, J. Jouppi, N. Przybylski, S. Rowen, C. Gross, T.* Design of a high performance VLSI processor.* Stanford U. SEL. Comp. Systems Lab.*Tech.Rpt. 236.*1983. 035240 Luckham, D.C. von Henke, F.W. Larsen, H.J. Stevenson, D.R.* Adam: An Ada based language for multiprocessing.* Stanford U. SEL. Comp. Systems Lab.*Tech.Rpt. 240.*1983. 035241 Cory, W.E.* Verification of hardware design correctness: symbolic execution techniques and criteria for consistency.* Stanford U. SEL. Comp. Systems Lab.* Tech.Rpt. 83-241, Ph.D. Thesis. Cory, W.E.*1983. 035242 Ghosh, S. Vancleemput, W.* Fault simulation in ADLIB SABLE.* Stanford U. SEL. Comp. Systems Lab.*Tech.Rpt. 83-242.* 1983. 035243 Huck, J.C.* Comparative analysis of computer architectures.* Stanford U. SEL. Comp. Systems Lab.*Tech.Rpt. 83-243, Ph.D. Thesis. Huck, J.C.*1983. 035244 Demetrescu, S.*High speed image rasterization using a highly parallel smart bulk memory.* Stanford U. SEL. Comp. Systems Lab.*Tech.Rpt. 83-244.*1983. 035245 Finlayson, R.S.*EDT: A syntax based program editor. Reference manual.* Stanford U. SEL. Comp. Systems Lab.* Tech.Rpt. 83-245.*1983. 035247 Marzullo, K. Owicki, S.*Maintaining the time in a distributed system.* Stanford U. SEL. Comp. Systems Lab.* Tech.Rpt. 83-247.*1983. 035248 Ossher, H.L. Reid, B.K.* Fable: A programming language solution to IC process automation problems.* Stanford U. SEL. Comp. Systems Lab.*Tech.Rpt. 83-248.*1983. 035249 Helmbold, D. Luckham, D.C.* Runtime detection and description of deadness errors in Ada tasking.* Stanford U. SEL. Comp. Systems Lab.*Tech.Rpt. 83-249.*1983. 035250 Alpert, D.* Data buffers for execution architectures.* Stanford U. SEL. Comp. Systems Lab.*Tech.Rpt. 83-250.* 1983. 035251 Lansky, A.L. Owicki, S.S.* Gen: A tool for concurrency specification and verification.* Stanford U. SEL. Comp. Systems Lab.*Tech.Rpt. 83-251.*1983. 035252 Fine, M. Tobagi, F.A.* Performance of unidirectional broadcast local area networks: Express-net and Fasnet.* Stanford U. SEL. Comp. Systems Lab.*Tech.Rpt. 83-252.* 1983. 035253 Mitchell, C.L.*Evaluation of an interpreted architecture for Pascal on a personal computer.* Stanford U. SEL. Comp. Systems Lab.*Tech.Rpt. 83-253.*1983. 035254 Chow, F.C.*A portable machine-independent global optimizer - design and measurements.* Stanford U. SEL. Comp. Systems Lab.*Tech.Rpt. 83-254.*1983. 018977 Itai, A. Rodeh, M.* Scheduling transmissions in a network.* Technion - Israel Inst. of Tech. Comp.Sci.Dept.*Tech.Rpt. 261.*1983. 018978 Boral, H. DeWitt, D.J.* Database machines: an idea whose time has passed. A critique of the future of database machines.* Technion - Israel Inst. of Tech. Comp.Sci.Dept.*Tech.Rpt. 288.*1983. 018979 Goldin, L. Grunwald, A.J. Kantorowitz, E.*Inexpensive graphics for real time motion simulation.* Technion - Israel Inst. of Tech. Comp.Sci.Dept.*Tech.Rpt. 291.*1983. 018980 Korach, E. Moran, S. Zaks, S.*Finding a minimum spanning tree can be harder than finding a spanning tree in distributed networks.* Technion - Israel Inst. of Tech. Comp.Sci.Dept.*Tech.Rpt. 294.*1983. 018981 Itai, A. Zehavi, A.* Minimal path disconnected graphs.* Technion - Israel Inst. of Tech. Comp.Sci.Dept.*Tech.Rpt. 295.*1983. 018982 Gold, Y.I. Moran, S.* Distributed algorithms for computing all internode distances and for constructing a minimum weights spanning tree in a fully connected broadcast network.* Technion - Israel Inst. of Tech. Comp.Sci.Dept.* Tech.Rpt. 297.*1983. 018983 Korach, E. Moran, S. Zaks, S.*Tight lower and upper bounds for some distributed algorithms for a complete network of processors.* Technion - Israel Inst. of Tech. Comp.Sci.Dept.*Tech.Rpt. 298.*1983. 018984 Francez, N. Yemini, S.*A fully abstract and composable inter task communication construct.* Technion - Israel Inst. of Tech. Comp.Sci.Dept.*Tech.Rpt. 299.*1983. 018985 Erdoes, P. Moran, S. Zaks, S. Koren, I. Silberman, G.M.* Mapping data flow graphs on VLSI processing arrays.* Technion - Israel Inst. of Tech. Comp.Sci.Dept.*Tech.Rpt. 306.*1983. 018986 Bartels, R.H. Beatty, J.C. Barsky, B.A.*An introduction to the use of splines in computer graphics.* California U., Berkeley. Comp.Sci.Div.*UCB/CSD 83/136; Waterloo U. Comp.Sci.Dept.*Res.Rpt. CS-83-09.*1983. 018987 Fujimoto, R.M.* VLSI communication components for multicomputer networks.* California U., Berkeley. Comp.Sci.Div.*UCB/CSD 83/137, Ph.D. Thesis. Fujimoto, R.M.*1983. 018988 Thompson, C.D. Raghavan, P.*On estimating the performance of VLSI circuits.* California U., Berkeley. Comp.Sci.Div.*UCB/CSD 83/138.*1983. 018989 Lawler, E.L.* Scheduling a single machine to minimize the number of late jobs.* California U., Berkeley. Comp.Sci.Div.*UCB/CSD 83/139.*1983. 018990 Fujimoto, R.M.* SIMON: A simulator of multicomputer networks.* California U., Berkeley. Comp.Sci.Div.*UCB/CSD 83/140.*1983. 018991 Katevenis, M.G.H.* Reduced instruction set computer architectures for VLSI.* California U., Berkeley. Comp.Sci.Div.*UCB/CSD 83/141, Ph.D. Thesis. Katevenis, M.G.H.*1983. 018992 Ferrari, D. Lee, T-y.P.*Modeling file system organizations in a local area network environment.* California U., Berkeley. Comp.Sci.Div.*UCB/CSD 83/142; California U., Berkeley. Comp.Sci.Div. PROGRES Group.*Rpt. 83.07.*1983. 018993 Blomseth, R.A.*A big RISC.* California U., Berkeley. Comp.Sci.Div.*UCB/CSD 83/143.*1983. 018994 Stonebraker, M. Woodfill, J. Ranstrom, J. Kalash, J. Arnold, D. Andersen, E.* Performance analysis of distributed data base systems.* California U., Berkeley. Comp.Sci.Div.*UCB/CSD 83/144.*1983. 018995 Leffler, S.J. Fabry, R.S. Joy, W.N.*A 4.2bsd interprocess communication primer. Draft of July 27, 1983.* California U., Berkeley. Comp.Sci.Div.*UCB/CSD 83/145.* 1983. 018996 Leffler, S.J. Joy, W.N. Fabry, R.S.*4.2bsd networking implementation notes. Revised July, 1983.* California U., Berkeley. Comp.Sci.Div.*UCB/CSD 83/146.*1983. 018997 McKusich, M.K. Joy, W.N. Leffler, S.J. Fabry, R.S.*A fast file system for UNIX. Revised July 27, 1983.* California U., Berkeley. Comp.Sci.Div.*UCB/CSD 83/147.*1983. 018998 Woods, J.A.*Finding files fast.* California U., Berkeley. Comp.Sci.Div.*UCB/CSD 83/148.*1983. 018999 Stonebraker, M. Rowe, L.A.*Data base portals: A new application program interface.* California U., Berkeley. Comp.Sci.Div.*UCB/CSD 83/149.*1983. 019000 Woodfill, J. Stonebraker, M.*An implementation of hypothetical relations.* California U., Berkeley. Comp.Sci.Div.*UCB/CSD 83/150.*1983. 019001 Stonebraker, M. Woodfill, J. Andersen, E.*Implementation of rules in relational data base systems.* California U., Berkeley. Comp.Sci.Div.*UCB/CSD 83/151.*1983. 019002 Barsky, B.A. DeRose, T.D.*The Beta2 spline: A special case of the Beta-spline curve and surface representation.* California U., Berkeley. Comp.Sci.Div.*UCB/CSD 83/152.* 1983. 019003 Hac, A.*On the modeling of shared resources by queueing networks with serialization delays.* California U., Berkeley. Comp.Sci.Div.*UCB/CSD 83/153; California U., Berkeley. Comp.Sci.Div. PROGRES Group.*Rpt. 83.08.*1983. 019004 Ousterhout, J.K. Hamachi, G.T. Mayo, R.N. Scott, W.S. Taylor, G.S.*A collection of papers on Magic.* California U., Berkeley. Comp.Sci.Div.*UCB/CSD 83/154.* 1983. Contents: (1)Magic: a VLSI layout system, by John K. Ousterhout, Gordon T. Hamachi, Robert N. Mayo, Walter S. Scott, and George S. Taylor; (2) Magic's incremental design-rule checker, by George S. Taylor and John K. Ousterhout; (3) Plowing: interactive stretching and compaction in Magic, by Walter S. Scott and John K. Ousterhout; (4) A switchbox router with obstacle avoidance, by Gordon T. Hamachi and John K. Ousterhout. 019005 Ferrari, D.*The evolution of Berkeley UNIX.* California U., Berkeley. Comp.Sci.Div.*UCB/CSD 83/155; California U., Berkeley. Comp.Sci.Div. PROGRES Group.*Rpt. 83.09.*1983. 019006 Terry, D.B.*An analysis of naming convention for distributed computer systems.* California U., Berkeley. Comp.Sci.Div.*UCB/CSD 83/156; California U., Berkeley. Comp.Sci.Div. PROGRES Group.*Rpt. 83.10.*1983. 019007 Adler, I. Karp, R. Shamir, R.*A family of simplex variants solving for an m x d linear program in expected number of pivot steps depending on d only.* California U., Berkeley. Comp.Sci.Div.*UCB/CSD 83/157.*1983. 019008 Adler, I. Karp, R. Shamir, R.*A simplex variant solving an m x d linear program in O(min(m superscript 2, d superscript 2)) expected number of pivot steps.* California U., Berkeley. Comp.Sci.Div.*UCB/CSD 83/158.* 1983. 019009 Voge, B.A.*Implementation of network primitives for a network monitor/debugger.* California U., Berkeley. Comp.Sci.Div.*UCB/CSD 83/159; California U., Berkeley. Comp.Sci.Div. PROGRES Group.*Rpt. 83.11.*1983. 019010 Foderaro, J.K.*The design of a language for algebraic computation systems.* California U., Berkeley. Comp.Sci.Div.*UCB/CSD 83/160, Ph.D. Thesis. Foderaro, J.K.*1983. 019011 Sequin, C.H. Segal, M. Wensley, P.* UNIGRAFIX 2.0 user's manual and tutorial.* California U., Berkeley. Comp.Sci.Div.*UCB/CSD 83/161.*1983. 019012 Sequin, C.H. (ed.)*Creative geometric modeling with UNIGRAFIX.* California U., Berkeley. Comp.Sci.Div.* UCB/CSD 83/162.*1983. 019013 Gusella, R. Zatti, S.* TEMPO: a network time controller for a distributed Berkeley UNIX system.* California U., Berkeley. Comp.Sci.Div.*UCB/CSD 83/163; California U., Berkeley. Comp.Sci.Div. PROGRES Group.*Rpt. 83.12.*1983. Cover title: TEMPO: Time services for the Berkeley local network. 019014 Linton, M.A.* Queries and views of programs using a relational database system.* California U., Berkeley. Comp.Sci.Div.*UCB/CSD 83/164, Ph.D. Thesis. Linton, M.A.* 1983. 019015 Presotto, D.L.* PUBLISHING: A reliable broadcast communication mechanism.* California U., Berkeley. Comp.Sci.Div.*UCB/CSD 83/165, Ph.D. Thesis. Presotto, D.L.*1983. 019016 Khoshafian, S.N. Bates, D.M. DeWitt, D.J.* Parallel algorithms and secondary storage methods for X'X.* Wisconsin U. Comp.Sci.Dept.*Tech.Rpt. 528.*1984. 019017 DeWitt, D.J. Katz, R.H. Olken, F. Shapiro, L.D. Stonebraker, M.R. Wood, D.*Implementation techniques for main memory database systems.* Wisconsin U. Comp.Sci.Dept.*Tech.Rpt. 529.*1984. 019018 Carey, M.J.*The performance of concurrency control algorithms for database management systems.* Wisconsin U. Comp.Sci.Dept.*Tech.Rpt. 530.*1984. 019019 Agrawal, R. DeWitt, D.J.*Whither hundreds of processors in a database machine?* Wisconsin U. Comp.Sci.Dept.* Tech.Rpt. 531.*1984. 019020 Boral, H. DeWitt, D.J.*A methodology for database system performance evaluation.* Wisconsin U. Comp.Sci.Dept.* Tech.Rpt. 532.*1984. 019021 Joseph, D. Young, P.*Some remarks on witness function for non-polynomial and non-complete sets in NP.* Wisconsin U. Comp.Sci.Dept.*Tech.Rpt. 533.*1984. 019022 Manber, U.*On maintaining dynamic information in a concurrent environment.* Wisconsin U. Comp.Sci.Dept.* Tech.Rpt. 535.*1984. 019023 Vernon, M.K.* Performance simulation study of an applicative multiprocessor.* Wisconsin U. Comp.Sci.Dept.* Tech.Rpt. 536.*1984. 019024 Joseph, D. Young, P.*A survey of some recent results on computational complexity in weak theories of arithmetic.* Wisconsin U. Comp.Sci.Dept.*Tech.Rpt. 537.*1984. 019025 Dyer, C.R. Chin, R.T.* Model based industrial part recognition: systems and algorithms.* Wisconsin U. Comp.Sci.Dept.*Tech.Rpt. 538.*1984. VOL. 6, NO. 5 05/14/84 019026 Brown, M.H. Sedgewick, R.*Progress report: Brown University instructional computing laboratory.* Brown U. CS Dept *Tech.Rpt. 83-28.*1983. 019027 Brown, M.H. Sedgewick, R.*A system for algorithm animation.* Brown U. CS Dept *Tech.Rpt. 84-01.*1984. 019028 Brown, M.H. Sedgewick, R.*Techniques for algorithm animation.* Brown U. CS Dept *Tech.Rpt. 84-02.* 1984. 019029 Pato, J.N. Reiss, S.P. Brown, M.H.*The Brown workstation environment.* Brown U. CS Dept *Tech.Rpt. 84-03.* 1984. 019030 Reiss, S.P.* Graphical program development with PECAN program development system.* Brown U. CS Dept * Tech.Rpt. 84-04.*1984. 019031 Smolka, S.A.*Analysis of communicating finite state processes.* Brown U. CS Dept *Tech.Rpt. 84-05, Ph.D. Thesis. Smolka, S.A.*1984. 019032 Flajolet, P. Sedgewick, R.* Digital search trees revisited.* Brown U. CS Dept *Tech.Rpt. 84-07.*1984. 019033 Bergstra, J.A. Klop, J.W.*An abstraction mechanism for process algebras.* Mathematisch Centrum.*IW 231/83.* 1983. 019034 Bergstra, J.A. Klop, J.W.*An algebraic specification method for processes over a finite action set.* Mathematisch Centrum.*IW 232/83.*1983. 019035 Lenstra, A.K.* Factoring multivariate polynomials over algebraic number fields.* Mathematisch Centrum.*IW 233/83.*1983. 019036 Bergstra, J.A. Klop, J.W. Tucker, J.V.* Algebraic tools for system construction.* Mathematisch Centrum.*IW 234/83.* 1983. 019037 Bergstra, J.A. Klop, J.W.*The algebra of recursively defined processes and the algebra of regular processes.* Mathematisch Centrum.*IW 235/83.*1983. 019038 Bergstra, J.A. Tucker, J.V.*The axiomatic semantics of programs based on Hoare's logic.* Mathematisch Centrum.* IW 236/83.*1983. 019039 Bergstra, J.A. Meyer, J.-J.Ch.*On specifying sets of integers.* Mathematisch Centrum.*IW 237/83.*1983. 019040 De Bakker, J.W. Zucker, J.I.* Compactness in semantics for merge and fair merge.* Mathematisch Centrum.*IW 238/83.* 1983. 019041 Vitanyi, P.M.B. Meertens, L.G.L.T.* Big omega versus the wild functions.* Mathematisch Centrum.*IW 239/83.*1983. 019042 Klint, P.*A survey of three language independent programming environments.* Mathematisch Centrum.*IW 240/83.*1983. 019043 Bergstra, J.A. Tiuryn, J.* Process algebra semantics for queues.* Mathematisch Centrum.*IW 241/83.*1983. 019044 Lenstra, A.K.* Polynomial factorization by root approximation.* Mathematisch Centrum.*IW 242/83.*1983. 019045 Vitanyi, P.M.B.* Distributed elections in an Archimedean ring of processors (Preliminary version).* Mathematisch Centrum.*IW 243/83.*1983. 019046 Vitanyi, P.M.B.*The simple roots of real time computation hierarchies (Preliminary version).* Mathematisch Centrum.*IW 244/83.*1983. 019047 Vitanyi, P.M.B.*An N superscript 1.618 lower bound on the time to simulate one queue or two pushdown stores by one tape.* Mathematisch Centrum.*IW 245/83.*1983. 019048 Houwen, P.J. van der Sommeijer, B.P.* Linear multistep methods with minimized truncation error for periodic initial value problems.* Mathematisch Centrum.*NW 157/83.*1983. 019049 Hemker, P.W.* Multigrid methods for problems with a small parameter in the highest derivative.* Mathematisch Centrum.*NW 158/83.*1983. 019050 Asselt, E.J. van* Termination strategies for Newton iteration in full multigrid methods.* Mathematisch Centrum.*NW 159/83.*1983. 019051 Asselt, E.J. van*On M-functions and nonlinear relaxation methods.* Mathematisch Centrum.*NW 160/83.*1983. 019052 Gottlieb, A.*Comparing the NYU ultracomputer with other large scale parallel processors.* New York U. Inst. of Math. Sci.*DOE/ER/03077-205.*1983. 019053 Tarjan, R.E. Vishkin, U.*An efficient parallel biconnectivity algorithm.* New York U. Inst. of Math. Sci. CS Dept *Tech.Rpt.069; New York U. Inst. of Math. Sci.*Ultracomputer note 051.*1983. 019054 Paul, W. Vishkin, U. Wagener, H.* Parallel computation on 2-3 trees.* New York U. Inst. of Math. Sci. CS Dept *Tech.Rpt. 070; New York U. Inst. of Math. Sci.*Ultracomputer note 052.*1983. 019055 Vishkin, U.* Synchronous parallel computation.* New York U. Inst. of Math. Sci. CS Dept *Tech.Rpt. 071; New York U. Inst. of Math. Sci.*Ultracomputer note 053.*1983. 019056 Mehlhorn, K. Vishkin, U.* Granularity of parallel memories.* New York U. Inst. of Math. Sci. CS Dept *Tech.Rpt. 089; New York U. Inst. of Math. Sci.*Ultracomputer note 059.*1983. 019057 Bar-On, I. Vishkin, U.* Optimal parallel generation of a computation tree form.* New York U. Inst. of Math. Sci. CS Dept *Tech.Rpt. 090; New York U. Inst. of Math. Sci.*Ultracomputer note 061.*1983. 019058 Vishkin, U.*A parallel design distributed implementation ( PDDI) general purpose computer.* New York U. Inst. of Math. Sci. CS Dept *Tech.Rpt. 096; New York U. Inst. of Math. Sci.*Ultracomputer note 058.*1983. 019059 Vishkin, U.*An optimal parallel algorithm for selection.* New York U. Inst. of Math. Sci. Comp.Sci.Dep.*Tech.Rpt. 106; New York U. Inst. of Math. Sci.*Ultracomputer note 064.*1983. 019060 Vishkin, U.* Randomized speed-ups in parallel computation.* New York U. Inst. of Math. Sci. CS Dept *Tech.Rpt. 107; New York U. Inst. of Math. Sci.*Ultracomputer note 066.*1984. 019061 Vishkin, U. Wigderson, A.* Dynamic parallel memories.* New York U. Inst. of Math. Sci.*Ultracomputer note 054.*1983. 019062 Korn, D. Rushfield, N.* Washcloth simulation of three dimensional weather forcasting codes.* New York U. Inst. of Math. Sci.*Ultracomputer note 055.*1983. 019063 Vishkin, U. Wigderson, A.*Trade-offs between depth and width in parallel computation.* New York U. Inst. of Math. Sci.*Ultracomputer note 056.*1983. 019064 Harrison, M.C.*An ultracomputer switch design using circuit and packet switching.* New York U. Inst. of Math. Sci.* Ultracomputer note 057.*1983. 019065 Gottlieb, A.*Avoiding serial bottlenecks in ultraparallel MIMD computers.* New York U. Inst. of Math. Sci.* Ultracomputer note 062.*1983. 019066 Vishkin, U.* Lucid boxes vs. black boxes.* New York U. Inst. of Math. Sci.*Ultracomputer note 065.*1983. 019067 Vichnevetsky, R. Pariser, E.C.* High order numerical Sommerfeld boundary conditions: theory and experiments.* Rutgers U. CS Dept *DCS-TR-132.*1983. 019068 Gerasoulis, A.* Singular integral equations - the singular value decomposition of the Gauss Chebyshev and Lobatto Chebyshev matrices.* Rutgers U. CS Dept * DCS-TR-133.*1983. 019069 Epstein, S.L.* Knowledge representation in mathematics: a case study in graph theory.* Rutgers U. CS Dept * DCS-TR-134, Ph.D. Thesis. Epstein, S.L.*1983. 019070 Corneil, D.G. Peri, Y.* Clustering and domination in perfect graphs.* Rutgers U. CS Dept *DCS-TR-135.* 1983. 019071 Vichnevetsky, R.*The energy flow equation.* Rutgers U. CS Dept *DCS-TR-136.*1983. 019072 Vichnevetsky, R.* Invariance theorems concerning reflection at numerical boundaries.* Rutgers U. CS Dept * DCS-TR-137.*1983. 019073 Amarel, S.* Program synthesis as a theory formation task - problem representations and solution methods.* Rutgers U. Comp.Sci.Res.Lab.*CBM-TR-135.*1983. 019074 Goldberg, A. Paige, R.* Stream processing.* Rutgers U. Comp.Sci.Res.Lab.*LCSR-TR-046.*1983. 019075 Minsky, N. Borgida, A.*Controlling software evolution: an overview of Darwin.* Rutgers U. Comp.Sci.Res.Lab.* LCSR-TR-048.*1983. 019076 Minsky, N.* Power and its distribution in software systems.* Rutgers U. Comp.Sci.Res.Lab.*LCSR-TR-049.*1983. 019077 Borgida, A.*Features of languages for the development of information systems at the conceptual level.* Rutgers U. Comp.Sci.Res.Lab.*LCSR-TR-052.*1983. 019078 Luhukay, J.F.P.* Layout synthesis of NMOS gate cells.* Illinois U. CS Dept *UIUCDCS-R-83-1099, Ph.D. Thesis. Luhukay, J.F.P.*1983. 019079 Coletti, N.B.* Image processing on MPP like arrays.* Illinois U. CS Dept *UIUCDCS-R-83-1132, Ph.D. Thesis. Coletti, N.B.*1983. 019080 Ely, J. Liu, J.W.S.*A prototype binary image scaling facility.* Illinois U. CS Dept *UIUCDCS-R-84-1143.* 1984. 019081 Lo, V.M.* Task assignment in distributed systems.* Illinois U. CS Dept *UIUCDCS-R-84-1144, Ph.D. Thesis. Lo, V.M.*1984. 019082 Montoye, R.K.*Optimization and testing on nMOS arithmetic structures.* Illinois U. CS Dept * UIUCDCS-R-84-1146, Ph.D. Thesis. Montoye, R.K.*1983. 019083 Abu-Sufah, W. Lee, R.L.* Program behavior under VAX/VMS.* Illinois U. CS Dept *UIUCDCS-R-83-1147.*1983. 019084 Campbell, R.H.* Error recovery in asynchronous systems.* Illinois U. CS Dept *UIUCDCS-R-83-1148.*1983. 019085 Jalote, P. Campbell, R.H.* Fault tolerance using communicating sequential processes.* Illinois U. CS Dept *UIUCDCS-R-83-1149.*1983. 019086 Chen, B. Gao, C. Jacobson, W.* Illinet network interface driver.* Illinois U. CS Dept *UIUCDCS-R-83-1150.* 1983. 019087 Shilling, J.*The Fred user's manual.* Illinois U. CS Dept *UIUCDCS-R-84-1151.*1984. 019088 Husmann, H.E.*High-speed format conversion and parallel I/O in numerical programs.* Illinois U. CS Dept * UIUCDCS-R-84-1152.*1984. 019089 Campbell, R.H. Kirslis, P.A.*The SAGA project: a system for software development.* Illinois U. CS Dept * UIUCDCS-R-83-1153.*1983. 019090 Slamet, S.* Quasi Newton and multigrid methods for semiconductor device simulation.* Illinois U. CS Dept *UIUCDCS-R-84-1154.*1983. 019091 Shilling, J.J.*Improvements to a structured, screen oriented editor.* Illinois U. CS Dept * UIUCDCS-R-83-1155.*1983. 019092 Kamgnia, E.R.*A numerical conformal mapping method and the Poisson equation on irregular domains.* Illinois U. CS Dept *UIUCDCS-R-83-1157, Ph.D. Thesis. Kamgnia, E.R.*1983. 019093 Cheng, R.F.* Naming and addressing in interconnected computer networks.* Illinois U. CS Dept * UIUCDCS-R-84-1158, Ph.D. Thesis. Cheng, R.F.*1984. 019094 Yip, P.K.*Extraction and simulation of NMOS cells.* Illinois U. CS Dept *UIUCDCS-R-84-1159.*1984. 019095 Kim, J.K.* Deadlock detection algorithms in distributed database systems.* Illinois U. CS Dept * UIUCDCS-R-84-1162.*1984. 019096 Mickunas, M.D. Jalote, P. Campbell, R.H.*A new protocol for concurrency control using both preventive and corrective techniques.* Illinois U. CS Dept * UIUCDCS-R-84-1163.*1984. 019097 Horton, K.H.* Multicomputer interconnection using word parallel shift register ring networks.* Illinois U. CS Dept *UIUCDCS-R-84-1164, Ph.D. Thesis. Horton, K.H.*1984. 019098 Essick, R.B. IV* Notesfiles: a unix communications tool.* Illinois U. CS Dept *UIUCDCS-R-84-1165.*1984. 019099 Grosky, W.I. Jain, R.* Shape matching in pyramids.* Michigan U. Computing Res.Lab.*CRL-TR-02-84.*1984. 019100 Gurevich, Y.*Toward logic tailored for computational complexity.* Michigan U. Computing Res.Lab.*CRL-TR-03-84.* 1984. 019101 Delp, E.J. Knoll, T.F.* Adaptive gray scale mapping to remove registration noise in difference pictures.* Michigan U. Computing Res.Lab.*CRL-TR-05-84.*1984. 019102 Jain, R.* Dynamic scene analysis.* Michigan U. Computing Res.Lab.*CRL-TR-06-84.*1984. 019103 Delp, E.J. Ansari, N.*The use of the Deanza IP6400 image processor for local window operations.* Michigan U. Computing Res.Lab.*CRL-TR-07-84.*1984. 019104 Furchtgott, D.G.* Performability models and solutions.* Michigan U. Computing Res.Lab.*CRL-TR-08-84, Ph.D. Thesis. Furchtgott, D.G.*1984. 019105 Rajlich, V.*An efficient algorithm for containment problem.* Michigan U. Computing Res.Lab.*CRL-TR-09-84.*1984. 019106 Jain, R. Sethi, I.K.*Establishing correspondence of non-rigid objects using smoothness of motion.* Michigan U. Computing Res.Lab.*CRL-TR-10-84.*1984. 019107 O'Brien, N. Jain, R.* Axial motion stereo.* Michigan U. Computing Res.Lab.*CRL-TR-11-84.*1984. 019108 Chow, C.H. Gouda, M.G. Lam, S.S.*A discipline for constructing multi phase communication protocols.* Texas U. CS Dept *TR-233.*1983. 019109 Gouda, M.G. Rosier, L.E.* Priority networks of communicating finite state machines.* Texas U. CS Dept *TR-83-10.*1983. 019110 Gouda, M.G. Yu, Y.-T.*Synthesis of communicating finite state machines with guaranteed progress.* Texas U. CS Dept *TR-179.*1981 (revised 1982 and 1983). 019111 Brumfield, J.A.* Operational response time formulas and their sensitivity to error.* Texas U. CS Dept * TR-83-11.*1983. 019112 Emerson, E.A. Sistla, A.P.*Deciding branching time logic: a triple exponential decision procedure for CTL.* Texas U. CS Dept *TR-83-12.*1983. 019113 Brown, F.M.* Set theory and its symmetric logic.* Texas U. CS Dept *TR-83-13.*1983. 019114 Kumar, V. Kanal, L.* Parallel branch and bound formulations for and/or tree search.* Texas U. CS Dept * TR-83-14.*1983. 019115 Brown, F.M.*Automatic analysis of the complexity of recursive functions.* Texas U. CS Dept *TR-83-15.* 1983. 019116 Brown, F.M.* Experimental logic and the automatic analysis of algorithms.* Texas U. CS Dept *TR-83-16.*1983. 019117 Rosier, L.E.* Presburger arithmetic with array segments, permutation and equality.* Texas U. CS Dept * TR-83-17.*1983. 019118 Scott, D.S.*The complexity of interpolating given data in three space with a convex function of two variables.* Texas U. CS Dept *TR-83-18.*1983. 019119 Scott, D.S.*On the accuracy of the Gerschgorin circle theorem for bounding the spread of a symmetric matrix.* Texas U. CS Dept *TR-83-19.*1983. 019120 Lengauer, C.*On the mechanical transformation of program executions to derive concurrency.* Texas U. CS Dept *TR-83-20.*1983. (revised 1984). 019121 Batory, D.S.*Modeling the physical structures of commercial database systems.* Texas U. CS Dept *TR-83-21.* 1983. 019122 Rosier, L.E. Gouda, M.G.*Deciding progress for a class of communicating finite state machines.* Texas U. CS Dept *TR-83-22.*1983. 019123 Ibarra, O.H. Rosier, L.E.*The equivalence problem and correctness formulas for a simple class of programs.* Texas U. CS Dept *TR-83-23.*1983. 019124 Simmons, R.F.*A text knowledge base for the AI handbook.* Texas U. CS Dept *TR-83-24.*1983. 019125 Cline, A.K. Rich, E.*Building and evaluating abstract data types.* Texas U. CS Dept *TR-83-26.*1983. 019126 Fujimura, K. Toriya, H. Yamaguchi, K. Kunii, T.L.*An enhanced oct-tree data structure and operation for solid modeling.* Tokyo U. Info.Sci.Dept.*Tech.Rpt. 83-01.* 1983. 019127 Enomoto, H. Saito, A.* Weakly 4-lined graphs.* Tokyo U. Info.Sci.Dept.*Tech.Rpt. 83-02.*1983. 019128 Maekawa, M.*A square root of N algorithm for mutual exclusion in decentralized systems.* Tokyo U. Info.Sci.Dept.*Tech.Rpt. 83-03.*1983. 019129 Fujimura, K. Toriya, H. Yamaguchi, K. Kunii, T.L.* Oct-tree algorithms for solid modeling.* Tokyo U. Info.Sci.Dept.* Tech.Rpt. 83-04.*1983. 019130 Yamada, H.*An examination of typing process in terms of interference between simultaneously executed heterogeneous tasks (in Japanese).* Tokyo U. Info.Sci.Dept.*Tech.Rpt. 83-05.*1983. 019131 Yamada, H.*Some issues of basic research concerning Japanese input methods for professional typists (in Japanese).* Tokyo U. Info.Sci.Dept.*Tech.Rpt. 83-06.* 1983. 019132 Watanabe, H. Yamada, H. Ikeda, K. Saito, M.* Cognitive aspects of reflex code typing for Japanese text.* Tokyo U. Info.Sci.Dept.*Tech.Rpt. 83-07.*1983. 019133 Maekawa, M. Sakamura, K. Ishikawa, C. Shimizu, T.* Multimedia machine.* Tokyo U. Info.Sci.Dept.*Tech.Rpt. 83-08.*1983. 019134 Sato, M. Sakurai, T.* Qute: a Prolog/Lisp type language for logic programming.* Tokyo U. Info.Sci.Dept.*Tech.Rpt. 83-09.*1983. 019135 Sakurai, T.* Prolog and inductive definition.* Tokyo U. Info.Sci.Dept.*Tech.Rpt. 83-10.*1983. 019136 Maekawa, M.* Distributed deadlock detection algorithms without phantom deadlocks.* Tokyo U. Info.Sci.Dept.* Tech.Rpt. 83-11.*1983. 019137 Shimizu, T. Sakamura, K.* Mixer: an expert system for microprogramming.* Tokyo U. Info.Sci.Dept.*Tech.Rpt. 83-12.*1983. 019138 Okadome, T. Yamada, H. Ikeda, K. Saito, M.*Another brain wave study of cerbral hemisphericity in Japanese touch typing.* Tokyo U. Info.Sci.Dept.*Tech.Rpt. 83-13.*1983. 019139 Yamaguchi, K. Kunii, T.L. Fujimura, K. Toriya, H.* Octree related data structures and algorithms.* Tokyo U. Info.Sci.Dept.*Tech.Rpt. 83-14.*1983. 019140 Yamaguchi, K. Kunii, T.L.*A layered string data structure for an octree model.* Tokyo U. Info.Sci.Dept.*Tech.Rpt. 83-15.*1983. 019141 Yamaguchi, K. Rogers, D.F. Satterfield, S.G. Rodriguez, F.A. Kunii, T.L.* Computer integrated manufacturing of surfaces using octree encoding: a preliminary report.* Tokyo U. Info.Sci.Dept.*Tech.Rpt. 83-16.*1983. 019142 Iizawa, A. Kunii, T.L.* Graph based design specification of parallel computation.* Tokyo U. Info.Sci.Dept.*Tech.Rpt. 83-17.*1983. 019143 Booth, K.S. Schaeffer, J. Gentleman, W.M.* Anthropomorphic programming.* Waterloo U. CS Dept *CS-82-47.*1984. 019144 Bartels, R.H. Jezioranski, J.J.*On least squares fitting using orthogonal multinomials.* Waterloo U. CS Dept *CS-83-24.*1983. 019145 Abdallah, M.A.N.* Metric interpretation and greatest fixpoint semantics of logic programs.* Waterloo U. CS Dept *CS-83-29.*1983. 019146 Bartels, R.H. Beatty, J.C. Booth, K.S. Field, D.E.* Computer graphics laboratory Fall 1983 review.* Waterloo U. CS Dept *CS-83-33.*1983. 019147 Larson, P.-A.* Linear hashing with linear probing.* Waterloo U. CS Dept *CS-83-38.*1984. 019148 Wood, D.*An isothetic view of computational geometry.* Waterloo U. CS Dept *CS-84-10.*1984. 019149 Dulik, K. II Yu, S.* Iterative tree automata.* Waterloo U. CS Dept *CS-84-03.*1984. 019150 Char, B.W. Geddes, K.O. Gonnet, G.H.*An introduction to MAPLE: sample interactive session.* Waterloo U. CS Dept *CS-84-04.*1984. 019151 George, A. Ng, E.* Orthogonal reduction of sparse matrices to upper triangular form using Householder transformations.* Waterloo U. CS Dept *CS-84-05.* 1984. 019152 Karhumaeki, J. Wood, D.* Inverse morphic equivalence on languages.* Waterloo U. CS Dept *CS-84-06.*1984. 019153 Budd, T. Hess, R. Sayward, F.* Error programs and test data for life cycle experiments.* Yale U. CS Dept * Res.Rpt. 180.*1980. 019154 Sun, J. Jackson, K.* Nonlinear implicit one step schemes for solving initial value problems for ordinary differential equations with steep gradients.* Yale U. CS Dept *Res.Rpt. 215.*1982. 019155 Fischer, M.J. Michael, A.*Sacrificing serializability to attain high availability of data in an unreliable network.* Yale U. CS Dept *Res.Rpt. 221.*1982. 019156 Saad, Y.F.* Projection methods for solving large sparse eigenvalue problems.* Yale U. CS Dept *Res.Rpt. 224.*1982. 019157 Eisenstat, S.C.*A note on the generalized conjugate gradient method.* Yale U. CS Dept *Res.Rpt. 228.* 1982. 019158 Chan, T.F.* Newton like pseudo arclength methods for computing simple turning points.* Yale U. CS Dept * Res.Rpt. 233.*1982. 019159 Chan, T.F. Saad, Y.* Iterative methods for solving bordered systems with applications to continuation methods.* Yale U. CS Dept *Res.Rpt. 235.*1982. 019160 Fischer, M.J. Lynch, N.A. Paterson, M.S.*Impossibility of distributed consensus with one faulty process.* Yale U. CS Dept *Res.Rpt. 245.*1982. 019161 Douglas, C.C.*A multi grid optimal order solver for elliptic boundary value problems.* Yale U. CS Dept * Res.Rpt. 248.*1982. 019162 Fischer, M.J. Paterson, M.S.* Storage requirements for fair scheduling.* Yale U. CS Dept *Res.Rpt. 251.*1982. 019163 Fischer, M.J. Salzberg, S.L.*Finding a majority among N votes.* Yale U. CS Dept *Res.Rpt. 252.*1982. 019164 Fisher, J.A.* Very long instruction word architectures and the ELI-512.* Yale U. CS Dept *Res.Rpt. 253.*1983. 019165 Saad, Y. Schultz, M.H.* GMRES: a generalized minimal residual algorithm for solving nonsymmetric linear systems.* Yale U. CS Dept *Res.Rpt. 254.*1982. 019166 Lowney, P.G.* Carrier arrays: an extension to APL.* Yale U. CS Dept *Res.Rpt. 256, Ph.D. Thesis. Lowney, P.G.*1983. 019167 Ehrlich, K. Soloway, E. Abbott, V.* Transfer effects from programming to algebra word problems: a preliminary study.* Yale U. CS Dept *Res.Rpt. 257.*1982. 019168 Soloway, E. Rubin, E. Woolf, B. Bonor, J. Johnson, W.L.* MENO-II: an AI-based programming tutor.* Yale U. CS Dept *Res.Rpt. 258.*1982. 019169 Chan, T.F. Schreiber, R.* Parallel networks for multi grid algorithms: architecture and complexity.* Yale U. CS Dept *Res.Rpt. 262.*1983. 019170 Chan, T.F. Saied, F.*A comparison of elliptic solvers for general two dimensional regions.* Yale U. CS Dept * Res.Rpt. 263.*1983. 019171 Miller, D.* Scheduling heuristics for problem solvers.* Yale U. CS Dept *Res.Rpt. 264.*1983. 019172 Eisenstat, S.C. Elman, H.C. Schultz, M.H. Sherman, A.H.*The (new) Yale sparse matrix package.* Yale U. CS Dept * Res.Rpt. 265.*1983. 019173 Elman, H.C.* Iterative methods for non self adjoint elliptic problems.* Yale U. CS Dept *Res.Rpt. 266.* 1983. 019174 Baldwin, D. Kelsey, R. Ruttenberg, J. Fisher, J. Ellis, J.R.*Design and use of the Yale digital similator.* Yale U. CS Dept *Res.Rpt. 267.*1983. 019175 Hudak, P.* Distributed graph marking.* Yale U. CS Dept *Res.Rpt. 268.*1983. 019176 Dongarra, J.J. Eisenstat, S.C.*Squeezing the most out of an algorithm in Cray Fortran.* Yale U. CS Dept * Res.Rpt. 269.*1983. 019177 Riesbeck, C.K.* Knowledge reorganization and reasoning style.* Yale U. CS Dept *Res.Rpt. 270.*1983. 019178 Gelernter, D. Gelernter, J.* Expert systems and diagnostic monitors.* Yale U. CS Dept *Res.Rpt. 271.*1983. 019179 Schultz, M.H.*Solving elliptic problems on an array processor system.* Yale U. CS Dept *Res.Rpt. 272.* 1983. 019180 Fischer, M.J.*The consensus problem in unreliable distributed systems (a brief survey).* Yale U. CS Dept *Res.Rpt. 272.*1983. 019181 McDermott, D.*The NISP manual.* Yale U. CS Dept * Res.Rpt. 274.*1983. 019182 Douglas, C.C.*Abstract multi grid with applications to elliptic boundary value problems.* Yale U. CS Dept * Res.Rpt. 275.*1983. 019183 Saad, Y.* Least squares polynomials in the complex plane with applications to solving sparse nonsymmetric matrix problems.* Yale U. CS Dept *Res.Rpt. 276.*1983. 019184 Gropp, W.D.* Local uniform mesh refinement for elliptic partial differential equations.* Yale U. CS Dept * Res.Rpt. 278.*1983. 019185 St. Mary, D.F. Lee, D.*Analysis of an implicit finite difference solution to an underwater wave propagation problem.* Yale U. CS Dept *Res.Rpt. 279.*1983. 019186 Smith, F.T.* Large scale separation and wake closure/reattachment - the Cascade problem.* Yale U. CS Dept *Res.Rpt. 281.*1983. 019187 Saad, Y. Schultz, M.H.* Conjugate gradient like algorithms for solving nonsymmetric linear systems.* Yale U. CS Dept *Res.Rpt. 283.*1983. 019188 Johnson, W.L. Soloway, E.* PROUST: Knowledge based program understanding.* Yale U. CS Dept *Res.Rpt. 285.* 1983. 019189 Johnson, W.L. Soloway, E. Cutler, B. Draper, S.* Bug catalogue: I.* Yale U. CS Dept *Res.Rpt. 286.* 1983. 019190 Elman, H.C. Schultz, M.H.* Preconditioning by fast direct methods for non self adjoint nonseparable elliptic equations.* Yale U. CS Dept *Res.Rpt. 287.*1983. VOL. 6, NO. 6 05/28/84 019191 Martin, M.A.*A Pascal color graphics package for the IBM PC.* IBM Watson Res. Center.*RC 10009.*1983. 019192 Pickover, C.A.*The use of a vector graphics system in the generation of facial multivariate point representations for data series.* IBM Watson Res. Center.*RC 10156.*1983. 019193 Barnes, E.R. Hoffman, A.J.*On transportation problems with upper bounds on leading rectangles.* IBM Watson Res. Center.*RC 10158.*1983. 019194 Iyer, B.R. Sinclair, J.B.* Dynamic memory interconnections for rapid access.* IBM Watson Res. Center.*RC 10160.* 1983. 019195 Berger, L. MacNair, E.A.*The research queueing package: full screen model construction.* IBM Watson Res. Center.* RC 10161.*1983. 019196 Miyahara, G. Nishida, T. Takashima, K.* Distributed queueing network simulator with multi micro processors.* IBM Watson Res. Center.*RC 10162.*1983. 019197 Unger, S.H.*Assigning delay values to meet long and short path constraints.* IBM Watson Res. Center.*RC 10166.* 1983. 019198 Dahmen, W. Micchelli, C.A.*On the optimal approximation rates for criss cross finite element spaces.* IBM Watson Res. Center.*RC 10168.*1983. 019199 Gopal, I.S. Segall, A.* Dynamic address assignment protocols.* IBM Watson Res. Center.*RC 10173.*1983. 019200 Scranton, R.A. Thompson, D.A. Hunter, D.W.*The access time myth.* IBM Watson Res. Center.*RC 10197.*1983. 019201 Pickover, C.A.*Characterization of melody patterns using topographic spectral distribution functions.* IBM Watson Res. Center.*RC 10140.*1983. 019202 Carroll, J.M.* Presentation and form in user interface architecture.* IBM Watson Res. Center.*RC 10144.*1983. 019203 Nelson, R.F. Iyer, B.R.*Analysis of a replicated data base.* IBM Watson Res. Center.*RC 10148.*1983. 019204 Huang, S.-H.S. Wong, C.K.* Generalized binary split trees.* IBM Watson Res. Center.*RC 10150.*1983. 019205 Franaszek, P. Robinson, J.T.*Limitations of concurrency in transaction processing.* IBM Watson Res. Center.*RC 10151.*1983. 019206 Adams, E.N.*Optimizing preventive service of software.* IBM Watson Res. Center.*RC 10152.*1983. 019207 Wagner, E.G. Bloom, S.L. Thatcher, J.W.*Why algebraic theories?* IBM Watson Res. Center.*RC 10171.*1983. 019208 Coppersmith, D.*Fast evaluation of logarithms in fields of characteristic two.* IBM Watson Res. Center.*RC 10187.* 1983. 019209 Evangelisti, C.J. Goertzel, G.*The architecture of a decision support system.* IBM Watson Res. Center.*RC 10205.*1983. 019210 Ferrante, J. Ottenstein, K.J. Warren, J.D.*The program dependence graph and its use in optimization.* IBM Watson Res. Center.*RC 10208.*1983. 019211 Blum, A. Donatiello, L. Heidelberger, P. Lavenberg, S.S. MacNair, E.A.*Experiments with decomposition of extended queueing network models.* IBM Watson Res. Center.*RC 10213.*1983. 019212 Grossman, D.D.*Teaching robotics with a video game on the IBM PC.* IBM Watson Res. Center.*RC 10216.*1983. 019213 Kruskal, V.*Managing multi version programs with an editor.* IBM Watson Res. Center.*RC 10217.*1983. 019214 Chen, T.C. Schlag, M.D.F. Wong, C.K.*The hypercube connection network.* IBM Watson Res. Center.*RC 10219.* 1983. 019215 Nackman, L.R. Pizer, S.M.* Three dimensional shape description using the symmetric axis transform I: theory.* IBM Watson Res. Center.*RC 10223.*1983. 019216 Adler, R.L. Kitchens, B. Marcus, B.H.* Finite group actions on shifts of finite type.* IBM Watson Res. Center.*RC 10236.*1983. 019217 Haltsonen, S.*Improved dynamic time warping methods for discrete utterance.* IBM Watson Res. Center.*RC 10239.* 1983. 019218 Haltsonen, S.*Recognition of isolated word sentences from a large vocabulary using dynamic time warping methods.* IBM Watson Res. Center.*RC 10240.*1983. 019219 Grossman, B.M. Buturia, E.M. Cottrell, P.E.* Finite element solution of the semiconductor transport equations.* IBM Watson Res. Center.*RC 10241.*1983. 019220 Micchelli, C.A. Sharma, A.* Convergence of complete spline interpolation for holomorphic functions.* IBM Watson Res. Center.*RC 10245.*1983. 019221 Segall, A. Jaffe, J.M.*A distributed protocol for maintaining central network control.* IBM Watson Res. Center.*RC 10246.*1983. 019222 Miranker, W.L. Rump. S.M.*Case studies for ACRITH: I. Ill posed problems and II. Stiff differential systems.* IBM Watson Res. Center.*RC 10249.*1983. 019223 Jaffe, J.M. Segall, A.*Automatic update of replicated topology data bases.* IBM Watson Res. Center.*RC 10254.* 1983. 019224 Pickover, C.A.* Symmetrized random dot patterns.* IBM Watson Res. Center.*RC 10256.*1983. 019225 Kaucher, E. Miranker, W.L.* Iterative residual correction and self validating numerics in functoids.* IBM Watson Res. Center.*RC 10260.*1983. 019226 Cobham, A.* Stochastic automata with large state spaces and low rank.* IBM Watson Res. Center.*RC 10262.*1983. 019227 Suhl, U.H.*Solving large scale mixed integer programs with fixed charge variables.* IBM Watson Res. Center.*RC 10266.*1983. 019228 Roth, J.P.* Verification of change in VLSI computer design file: Vc.* IBM Watson Res. Center.*RC 10267.*1983. 019229 Cristian, F.*A rigorous approach to fault tolerant system development (extended abstract).* IBM Watson Res. Center.* RJ 4008.*1983. 019230 Fagin, R. Klawe, M.M. Pippenger, N.J. Stockmeyer, L.* Bounded depth polynomial size circuits for symmetric functions.* IBM Watson Res. Center.*RJ 4040.*1983. 019231 Ghosh, S.P.*An application ofstatistical databases in manufacturing testing.* IBM Watson Res. Center.*RJ 4055.* 1983. 019232 Dinstein, I. Merkle, F. Lam, T.D. Wong, K.Y.* Imaging system response linearization and shading correction.* IBM Watson Res. Center.*RJ 4044.*1983. 019233 Schubert, K.D.* Resource management in the VM environment - a short discussion.* IBM Watson Res. Center.*RJ 4049.* 1983. 019234 Harel, D. Paterson, M.S.* Undecidability of PDL with L = left-curly-bracket 2 superscript 2 superscript i / i greater-than-or-equal-to 0 right-curly bracket.* IBM Watson Res. Center.*RJ 4066.*1983. 019235 Stockmeyer, L.*On approximation algorithms for #P.* IBM Watson Res. Center.*RJ 4071.*1983. 019236 Klawe, M.M.*A tight bound for black and white pebbles on the pyramid.* IBM Watson Res. Center.*RJ 4072.*1983. 019237 Gladney, H.M.* CONCISE language reference manual. Version 2.* 019238 Sacca, D. Wiederhold, G.* Database partitioning in a cluster of processors.* IBM Watson Res. Center.*RJ 4076.* 1983. 019239 Allender, E. Klawe, M.*Improved lower bounds for the cycle detection problem.* IBM Watson Res. Center.*RJ 4078.* 1983. 019240 German, S.M. Halpern, J.Y.*On the power of the hypothesis of expressiveness.* IBM Watson Res. Center.*RJ 4079.* 1983. 019241 Jipson, V.B. Ahn, K.Y.*Materials for optimal storage.* IBM Watson Res. Center.*RJ 4112.*1983. 019242 Iglehart, D.L. Shedler, G.S.* Simulation output analysis for local area computer networks.* IBM Watson Res. Center.*RJ 4020.*1983. 019243 Iglehart, D.L. Shedler, G.S.* Simulation for passage times in non`Markovian networks of queues.* IBM Watson Res. Center.*RJ 4021.*1983. 019244 Lochovsky, F.H.*A knowledge based approach to supporting office work.* IBM Watson Res. Center.*RJ 4027.*1983. 019245 Gajski, D. Kim, W. Fushimi, S.*A parallel pipelined relational query processor: an architectural overview.* IBM Watson Res. Center.*RJ 4087.*1983. 019246 Rudin, H.*Some user of telecommunication needs: a summary.* IBM Watson Res. Center.*RZ 1251.*1983. 019247 Svobodova, L.* File servers for network based distributed systems: updated version of RZ 1186 (November 2, 1982).* IBM Watson Res. Center.*RZ 1258.*1983. 019248 Bux, W.* Performance issues in local area networks.* IBM Watson Res. Center.*RZ 1268.*1983. 019249 Persson, M.*Manual of the microprogram simulator generator of Micgen.* Royal Inst. of Tech., Stockholm. Num.Anal. & Computing Sci.Dept.*TRITA-NA-8312.*1983. 019250 Lisper, B.*Description and synthesis of systolic arrays.* Royal Inst. of Tech., Stockholm. Num.Anal. & Computing Sci.Dept.*TRITA-NA-8318.*1983. 019251 Hedetniemi, S.M. Proskurowski, A. Syslo, M.M.* Interior graphs of maximal outerplane graphs.* Royal Inst. of Tech., Stockholm. Num.Anal. & Computing Sci.Dept.* TRITA-NA-8401.*1984. 019252 Arnborg, S. Proskurowski, A.*Characterization and recognition of partial k trees.* Royal Inst. of Tech., Stockholm. Num.Anal. & Computing Sci.Dept.*TRITA-NA-8402.* 1984. 019253 Arnborg, S. Proskurowski, A.* Linear time algorithms for NP hard problems on graphs embedded in k trees.* Royal Inst. of Tech., Stockholm. Num.Anal. & Computing Sci.Dept.* TRITA-NA-8404.*1984. 019254 The integral projects: progress report, 1983.* Royal Inst. of Tech., Stockholm. Num.Anal. & Computing Sci.Dept.* TRITA-NA-8405, Royal Inst. of Tech., Stockholm. Num.Anal. & Computing Sci.Dept. INTEGRAL Project.*INTEGRAL-15.1984. 019255 Arnborg, S.* Design methods for microelectronics and software: progress report and research program.* Royal Inst. of Tech., Stockholm. Num.Anal. & Computing Sci.Dept.*TRITA-NA-8406.*1984. 019256 Haridi, S. Ciepielewski, A.*An or parallel token machine.* Royal Inst. of Tech., Stockholm. Telecomm. & Comp. Systems Dept.*TRITA-CS-8303.*1983. 019257 Haridi, S. Sahlin, D.*Evaluation of logic programs based on natural deduction.* Royal Inst. of Tech., Stockholm. Telecomm. & Comp. Systems Dept.*TRITA-CS-8305 B.*1983. 019258 CSALAB progress report.* Royal Inst. of Tech., Stockholm. Telecomm. & Comp. Systems Dept.*TRITA-CS-8306.*1983. 019259 Tenenbaum, J.M. Fischler, M.A. Barrow, H.G.* Scene modeling: a structural basis for image description.* SRI International. A.I. Center.*Tech.Note 221.*1980. 019260 Haas, N. Hendrix, G.G.*An approach to acquiring and applying knowledge.* SRI International. A.I. Center.* Tech.Note 227.*1980. 019261 Gendrix, G.G. Lewis, W.H.* Transportable natural language interfaces to databases.* SRI International. A.I. Center.* Tech.Note 228.*1981. 019262 Nilsson, N.J.*The interplay between experimental and theoretical methods in artificial intelligence.* SRI International. A.I. Center.*Tech.Note 229.*1980. 019263 Walker, D.E. Hobbs, J.R.* Natural language access to medical text.* SRI International. A.I. Center.*Tech.Note 240.*1981. 019264 Pereira, F.* Logic for natural language analysis.* SRI International. A.I. Center.*Tech.Note 275, Ph.D. Thesis. Pereira, F.*1983. (Slightly revised version of a thesis submitted to the Department of Artificial Intelligence, University of Edinburgh for the degree of Doctor of Philosophy). 019265 Fischler, M.A. Wolf, H.C.*A general approach to machine perception of linear structure in imaged data.* SRI International. A.I. Center.*Tech.Note 276.*1983. 019266 Hanson, A.J.*The DARPA/DMA image understanding testbed user's manual. Version 1.1.* SRI International. A.I. Center.*Tech.Note 277.*1984. 019267 Cheeseman, P.*A representation of time for planning.* SRI International. A.I. Center.*Tech.Note 278.*1983. 019268 Shieber, S.M.* Sentence disambiguation by a shift reduce parsing technique.* SRI International. A.I. Center.* Tech.Note 281.*1983. 019269 Pereira, F.C.N.*Can drawing be liberated from the von Neumann style?* SRI International. A.I. Center.*Tech.Note 282.*1983. 019270 Shieber, S.M. Stucky, S.U. Uszkoreit, H. Robinson, J.J.* Formal constraints on metarules.* SRI International. A.I. Center.*Tech.Note 283.*1983. 019271 Moore, R.C.* Semantical considerations on nonmonotonic logic.* SRI International. A.I. Center.*Tech.Note 284.* 1983. 019272 Uszkoreit, H.*A framework for processing partially free word order.* SRI International. A.I. Center.*Tech.Note 285.*1983. 019273 Stickel, M.E.* Theory resolution: building in nonequational theories.* SRI International. A.I. Center.*Tech.Note 286.* 1983. 019274 Smith, G.B.* Shape from shading: an assessment.* SRI International. A.I. Center.*Tech.Note 287.*1983. 019275 Laws, K.I.*The Ghough generalized Hough transform package: description and evaluation.* SRI International. A.I. Center.*Tech.Note 288.*1982. 019276 Laws, K.I.*The Phoenix image segmentation system: description and evalution.* SRI International. A.I. Center.*Tech.Note 289.*1982. 019277 Warren, D.H.D.* Applied logic - its use and implementation as a programming tool.* SRI International. A.I. Center.* Tech.Note 290, Ph.D. Thesis. Warren, D.H.D.*1983. (Verbatim copy of a thesis submitted to the Department of Artificial Intelligence, University of Edinburgh in 1977 for the degree of Doctor of Philosophy). 019278 Shieber, S.M.* Direct parsing of ID/LP grammars.* SRI International. A.I. Center.*Tech.Note 291R.*1983 (revised). 019279 Grosz, B.J. Joshi, A.K. Weinstein, S.*Providing a unified account of definite noun phrases in discourses.* SRI International. A.I. Center.*Tech.Note 292.*1983. 019280 Martin, P. Appelt, D. Pereira, F.* Transportability and generality in a natural language interface system.* SRI International. A.I. Center.*Tech.Note 293.*1983. 019281 Konolige, K.*A deductive model of belief.* SRI International. A.I. Center.*Tech.Note 294.*1983. 019292 Pereira, F.C.N. Warren, D.H.D.* Parsing as deduction.* SRI International. A.I. Center.*Tech.Note 295.*1983. 019283 Pereira, F.C.N.*A new characterization of attachment preferences.* SRI International. A.I. Center.*Tech.Note 296.*1983. 019284 Appelt, D.E.* Telegram: a grammar formalism for language planning.* SRI International. A.I. Center.*Tech.Note 297.* 1983. 019285 Laws, K.I.*The DARPA/DMA image understanding testbed: programmer's manual. Version 1.1.* SRI International. A.I. Center.*Tech.Note 298.*1984. 019286 Laws, K.I. Smith, G.B.*The RELAX image relaxation system: description and evaluation.* SRI International. A.I. Center.*Tech.Note 301.*1983. 019287 Stucky, S.U.* Metarules as meta node admissibility conditions.* SRI International. A.I. Center.*Tech.Note 304.*1983. 019288 Tick, E.*An overlapped Prolog processor.* SRI International. A.I. Center.*Tech.Note 308.*1983. 019289 Warren, D.H.D.*An abstract Prolog instruction set.* SRI International. A.I. Center.*Tech.Note 309.*1983. 019290 Appelt, D.* Planning English referring expressions.* SRI International. A.I. Center.*Tech.Note 312.*1983. 019291 Barnard, S.T.*Choosing a basis for perceptual space.* SRI International. A.I. Center.*Tech.Note 315.*1984. 019292 Nilsson, N.J.*The SRI artificial intelligence center: a brief history.* SRI International. A.I. Center.*Tech.Note 317.*1984. 019293 Moore, R.C.*A formal theory of knowledge and action.* SRI International. A.I. Center.*Tech.Note 320.*1984. 019294 Nilsson, N.J.* Probabilistic logic.* SRI International. A.I. Center.*Tech.Note 321.*1984. 019295 Nilsson, N.J.* Artificial intelligence, employment, and income.* SRI International. A.I. Center.*Tech.Note 322.* 1984. 019296 Matula, D.W. Dolev, D.* Path regular graphs.* Southern Methodist U. Comp.Sci. & Eng.Dept.*82-CSE-03.*1982. 019297 Korfhage, R.R.* Forest based sigma polynomials and hypergraph colorings.* Southern Methodist U. Comp.Sci. & Eng.Dept.*82-CSE-04.*1982. 019298 Johri, A. Matula, D.W.* Probabilistic bounds and heuristic algorithms.* Southern Methodist U. Comp.Sci. & Eng.Dept.* 82-CSE-06.*1982. 019299 Matula, D.W.* Cluster validity by concurrent chaining.* Southern Methodist U. Comp.Sci. & Eng.Dept.*82-CSE-09.* 1982. 019300 Korfhage, R.R.* Sigma polynomials for color weighted graphs, I.* Southern Methodist U. Comp.Sci. & Eng.Dept.* 82-CSE-13.*1982. 019301 Korfhage, R.R.* Sigma polynomials for color weighted graphs, II.* Southern Methodist U. Comp.Sci. & Eng.Dept.* 82-CSE-14.*1982. 019302 Yun, D.Y.Y.* Personal computers as knowledge base development environment.* Southern Methodist U. Comp.Sci. & Eng.Dept.*83-CSE-10.*1983. 019303 Matula, D.W. Kornerup, P.* Finite precision rational arithmetic: slash number systems.* Southern Methodist U. Comp.Sci. & Eng.Dept.*83-CSE-11.*1983. 019304 Biswas, P. Majumdar, A.K.*A supervised learning algorithm for hierarchical classification of fuzzy patterns.* Southern Methodist U. Comp.Sci. & Eng.Dept.*83-CSE-12.* 1983. 019305 Meandzija, B.*Dynamic protocol definition.* Southern Methodist U. Comp.Sci. & Eng.Dept.*83-CSE-13.*1983. 019306 Zhang, C-n. Yun, D.Y.Y.*An area time optimal systolic network for discrete Fourier transform.* Southern Methodist U. Comp.Sci. & Eng.Dept.*83-CSE-14.*1983. 019307 Eastman, C.M.*Experimental procedures in the evaluation of file organizations for multikey retrieval.* Southern Methodist U. Comp.Sci. & Eng.Dept.*83-CSE-15.*1983. 019308 Meandzija, B.*Automated generation of communication systems.* Southern Methodist U. Comp.Sci. & Eng.Dept.* 83-CSE-16.*1983. 019309 Korfhage, R.R.* Data structures and access.* Southern Methodist U. Comp.Sci. & Eng.Dept.*83-CSE-17.*1983. 019310 Boley, H.*From pattern directed to adapter driven computation via function applying matching.* Kaiserslautern U. Fachbereich Informatik.*Memo Seki-83-06.*1983. 019311 Boley, G.* Fit - Prolog: a functional relational language comparison.* Kaiserslautern U. Fachbereich Informatik.* Memo Seki-83-14.*1983. 019312 Nielsen, T.*Effect of cell geometry of throughput in a model with capture.* Arizona U. Comp.Sci.Dept.*TR 83-13.* 1983. 019313 Griswold, R.E.*Understanding pattern matching - a cinematic display of string scanning.* Arizona U. Comp.Sci.Dept.*TR 83-14.*1983. 019314 Griswold, R.E.*The description and manipulation of sequences.* Arizona U. Comp.Sci.Dept.*TR 83-15.*1983. 019315 Griswold, R.E.* Seque: an experimental language for manipulating sequences.* Arizona U. Comp.Sci.Dept.*TR 83-16.*1983. 019316 Gopal, A. Budd, T.* Program testing by specification mutation.* Arizona U. Comp.Sci.Dept.*TR 83-17.*1983. 019317 Budd, T.A. Miller, W.*Testing numerical software.* Arizona U. Comp.Sci.Dept.*TR 83-18.*1983. 019318 Griswold, R.E.*The construction of variant translators for Icon.* Arizona U. Comp.Sci.Dept.*TR 83-19.*1983. 019319 Griswold, R.E.*The implementation of an experimental language for manipulating sequences.* Arizona U. Comp.Sci.Dept.*TR 83-20.*1983. 019320 Davidson, J.W. Fraser, C.W.* Code selection through object code optimization.* Arizona U. Comp.Sci.Dept.*TR 83-21.* 1983. 019321 Davidson, J.W. Fraser, C.W.*Automatic generation of peephole optimizations.* Arizona U. Comp.Sci.Dept.*TR 83-22.*1983. 019322 Draper, S.W. Norman, D.A.* Software engineering for user interfaces.* California U., San Diego. Inst. for Cognitive Sci.*ICS Rpt. 8401.*1984. 019323 Smolensky, P.* Harmony theory: a mathematical framework for stochastic parallel processing.* California U., San Diego. Inst. for Cognitive Sci.*ICS Rpt. 8308.*1983. 019324 Ehrenfeucht, A. Rozenberg, G. Verraedt, R.*A combinatorial property of EOL languages.* Colorado U. Comp.Sci.Dept.* CU-CS-288-82.*1982. 019325 Schnabel, R.B. Koontz, J.E. Weiss, B.E.*A modular system of algorithms for unconstrained minimization.* Colorado U. Comp.Sci.Dept.*CU-CS-240-82.*1982. 019326 Perry, M.*Software aid for optimizing 0-1 matrices.* Colorado U. Comp.Sci.Dept.*CU-CS-242-82.*1982. 019327 Main, M.G. Lorentz, R.J.*An 0(n log n) algorithm for finding all repetitions in a string.* Colorado U. Comp.Sci.Dept.*CU-CS-241-82.*1982. 019328 Schnabel, R.B. Frank, P.D.* Tensor methods for nonlinear equations.* Colorado U. Comp.Sci.Dept.*CU-CS-243-83.* 1983. 019329 Perry, R.M.*Computer techniques for cluster analysis.* Colorado U. Comp.Sci.Dept.*CU-CS-244-83.*1983. 019330 Shultis, J.*A functional shell.* Colorado U. Comp.Sci.Dept.* CU-CS-245-83.*1983. 019331 Main, M. Benson, D.B.* Functional behavior of nondeterministic and concurrent programs.* Colorado U. Comp.Sci.Dept.*CU-CS-246-83.*1983. 019332 Schnabel, R.B.* Quasi Newton methods using multiple secant equations.* Colorado U. Comp.Sci.Dept.*CU-CS-247-83.* 1983. 019333 Clemm, G.M.* FSCAN-83 report and user's manual.* Colorado U. Comp.Sci.Dept.*CU-CS-248-83.*1983. 019334 Clemm, G.M.* TREGRM-83 report and user's manual.* Colorado U. Comp.Sci.Dept.*CU-CS-249-83.*1983. 019335 Baker, D.A.* EASE--an extensible abstract structure editor.* Colorado U. Comp.Sci.Dept.*CU-CS-250-83.*1983. 019336 Janssens, D. Rozenberg, G.* Graph grammars with node label controlled rewriting and embedding.* Colorado U. Comp.Sci.Dept.*CU-CS-251-83.*1983. 019337 Gabow, H.N.*An efficient reduction technique for degree constrained subgraph and bidirected network flow problems.* Colorado U. Comp.Sci.Dept.*CU-CS-252-82.*1982. 019338 Perry, R.M.*A number sequence relating to the closepacking of primes.* Colorado U. Comp.Sci.Dept.*CU-CS-253-83.* 1983. 019339 Gabow, H.N. Tarjan, R.E.*A linear time algorithm for a special case of disjoint set union.* Colorado U. Comp.Sci.Dept.*CU-CS-261-82.*1982. 019340 Helman, P. Rosenthal, A.*A decomposition scheme for combinational circuits.* New Mexico U. Comp.Sci.Dept.* Tech.Rpt. CS-83-01.*1983. 019341 Manthey, M.J.* Hierarchy in sequential and concurrent systems or What's in a reply.* New Mexico U. Comp.Sci.Dept.*Tech.Rpt. CS-83-02.*1983. 019342 Ingham, K.L. Ziegler, W.S. Luger, G.F.* HECTOR: a logic based parser, semantic interpreter, and planner.* New Mexico U. Comp.Sci.Dept.*Tech.Rpt. CS-83-04.*1983. 019343 Lander, R. Luger, G. Stibbard, P. Alverson, D.*A newborn intensive care monitoring system: providing medical personnel information handling capabilities at a reasonable cost.* New Mexico U. Comp.Sci.Dept.*Tech.Rpt. CS-83-05.*1983. 019344 Moret, B.M.E. Thomason, M.G.* Boolean differences techniques for time sequence & common cause analysis of fault trees.* New Mexico U. Comp.Sci.Dept.*Tech.Rpt. CS-83-06.*1983. 019345 Manthey, M.J.* Nondeterminism can be casual.* New Mexico U. Comp.Sci.Dept.*Tech.Rpt. CS-83-07.*1983. 019346 Neufeld, E.M.*Construction of reliable series parallel networks: a combinatorial approach.* Saskatchewan U. Computational Sci.Dept.*Rpt. 84-01.*1984. 019347 Peachey, D.R. Bunt, R.B. Williamson, C.L. Brecht, T.B.*An experimental investigation of scheduling strategies for UNIX.* Saskatchewan U. Computational Sci.Dept.*Rpt. 84-02.*1984. 019348 Harms, D.D.*An investigation into bounds on network reliability.* Saskatchewan U. Computational Sci.Dept.* Rpt. 84-03.*1984. 019349 El-Mallah, E.S.* Recursive graph structure and the optimum communication spanning tree problem.* Saskatchewan U. Computational Sci.Dept.*Rpt. 84-04.*1984. 019350 Wald, J.A. Sorenson, P.G.*The entity relationship involvement data model and minimum cost objects.* Saskatchewan U. Computational Sci.Dept.*Rpt. 84-05.*1984. 019351 Hamilton, H.J. Sorenson, P.G. Tremblay, J.P.*Survey of dynamic hashing techniques.* Saskatchewan U. Computational Sci.Dept.*Rpt. 84-06.*1984. 019352 Channen, E.W. Sorenson, P.G. Tremblay, J.P.* Structured systems analysis using SPSL/SPSA.* Saskatchewan U. Computational Sci.Dept.*Rpt. 84-07.*1984. 019353 Zeigler, B.P. Oren, T.I.* Simulation education: software-augmented textbooks emphasizing modelling concepts.* Wayne State U. 019354 Kampfner, R.*The analysis of an organization's systemic structure and the determination of its information requirements.* Wayne State U. Comp.Sci.Dept.*CSC-83-010.* 1983. requirements.010.*1983. 019355 Conrad, M.*Design principles for a molecular computer.* Wayne State U. Comp.Sci.Dept.*CSC-83-011.*1983. 019356 Grosky, W.I. Lu, Y.* Iconic indexing using generalized pattern matching techniques.* Wayne State U. Comp.Sci.Dept.*CSC-84-001.*1984. 019357 Boogs, D.R.* Internet broadcasting.* Xerox. Palo Alto Res. Center.*CSL-83-03, Ph.D. Thesis. Boggs, D.R.*1983. (This report reproduces a dissertation submitted to the Department of Electrical Engineering of Stanford University in partial fulfillment of the requirements for the degree of Doctor of Philosophy). 019358 Guttag, J.V. Horning, J.J.*Preliminary report on the Larch shared language.* Xerox. Palo Alto Res. Center.* CSL-83-06.*1983. 019359 Birrell, A.D. Nelson, B.J.*Implementing remote procedure calls.* Xerox. Palo Alto Res. Center.*CSL-83-07.*1983. 019360 Ranshaw, L.*Deftly replacing go to statements with exit's.* Xerox. Palo Alto Res. Center.*CSL-83-10.*1983. 019361 Birrell, A.D. Levin, R. Needham, R.M. Schroeder, M.D.* Grapevine: two papers and a report.* Xerox. Palo Alto Res. Center.*CSL-83-12.*1983. CONTENTS: (1) Birrell, A.D. Levin, R. Needham, R.M. Schroeder, M.D.* Grapevine: an exercise in distributed computing; (2) Schroeder, M.D. Birrell, A.D. Needham, R.M.*Experience with Grapevine: the growth of a distributed system; (3) Birrell, A.D.*The Grapevine interface. 019362 Barlow, R.E. Shor, S.W.W.*Informative stopping rules.* California U., Berkeley. O.R. Center.*ORC 84-01.*1984. 019363 Chistov, A.L. Grigoryev, D.Y.* Subexponential time solving systems of algebraic equations. I.* U.S.S.R. Academy of Sci. Steklov Math.Inst. Leningrad Dept.*LOMI Preprints E-09-83.*1983. 019364 Chistov, A.L. Grigoryev, D.Y.* Subexponential time solving systems of algebraic equations. II.* U.S.S.R. Academy of Sci. Steklov Math.Inst. Leningrad Dept.*LOMI Preprints E-10-83.*1983. 019365 Cohen, R.*A computational model for the analysis of arguments.* Toronto U. Comp. Systems Res. Group.* CSRG-151, Ph.D. Thesis. Cohen, R.*1983. 019366 Fermilab Industrial Affiliates Roundtable on Supercomputer developments in the Universities: Fermilab Industrial Affiliates Third Annual Meeting, May 19, 1983. Sponsored by Fermilab and the Fermilab Industrial Affiliates.* Fermi National Accelerator Laboratory, Batavia, Illinois.* 1983. 019367 Fischer, T.*On the weighted path length of multidimensional ternary search trees.* DDR. Akademie der Wissenschaften. Institut fuer Mathematik, Berlin.*P-Math-16/83.*1983. 019368 Koskimies, K.*Extensions of one-pass attribute grammars.* Helsinki U. Comp.Sci.Dept.*Rpt. A-1983-04.*1983. 019369 Lobb, R.J. Mugridge, W.B.* AUSCNET - a status report.* Auckland U. Comp.Sci.Dept.*Rpt. 032.*1983. 019370 Loefgren, M. Magnusson, B.*An execution environment for Simula on a small computer.* Lund U. Lund Inst. of Tech. Comp.Sci.Dept.*1984. 019371 Marshall, R.M. Buchanan, I.* SCALE: a language for VLSI design.* Edinburgh U. Comp.Sci.Dept.*CSR-158-84.*1984. 019372 Price, W.L.*A sixth annotated bibliography of recent publications on data security and cryptography.* U.K. National Physical Lab. Info. Technology and Computing Div.*DITC 35/83.*1983. 019373 Shilcrat, E. Panangaden, P. Henderson, T.*Implementing multi sensor systems in a functional language.* Utah U. Comp.Sci.Dept.*UUCS-84-001.*1984. 019374 Slagle, J.R. Gaynor, M.W. Hamburger, H.* Decision support system for fire support command and control.* U.S. Naval Res.Lab.*NRL Rpt. 8769.*1983. 019375 Thune, M.* IBSTAB - a software system for automatic stability analysis of difference methods for hyperbolic initial boundary value problems.* Uppsala U. Comp.Sci.Dept.*Rpt. 93.*1984. 019376 Ferm, L.*Numerical methods for inviscid flow with open boundaries.* Uppsala U. Comp.Sci.Dept.*Rpt. 95.*1984. CONTENTS: (1) Ferm, L. Gustafsson, B.*A downstream boundary prodedure for the Euler equation.*1982 (Reprint: Computer and Fluids, v.10, no.4, pp.261-276); (2) Ferm, L.* Open boundary procedures for stationary inviscid flow problems.* Uppsala U. Comp.Sci.Dept.*Rpt. 94.*1984. VOL. 6, NO. 7 06/11/84 019377 Gay, D.M. *On convergence testing in model trust region algorithms for unconstrained optimization. * Bell Labs. * CS Tech Rpt 104. *1982. 019378 Kaufman, L. *Usage of the sparse matrix programs in the PORT library. * Bell Labs. *CS Tech Rpt 105. *1981. 019379 Kaufman, L. *A package of subroutines for solving systems of linear equations. * Bell Labs. *CS Tech Rpt 106. * 1981. 019380 Cardelli, L. *The functional abstract machine. * Bell Labs. * CS Tech Rpt 107. *n.d. 019381 Stroustrup, B. *The C + + programming language - reference manual. * Bell Labs. *CS Tech Rpt 108. *1984. 019382 Stroustrup, B. * Data abstraction in C. * Bell Labs. * CS Tech Rpt 109. *1984. 019383 Pavlidis, T. * PED users manual. * Bell Labs. * CS Tech Rpt 110. *1984. 019384 Trimberger, S. *A comparison of MOS PLAs. * California Inst. of Tech. CS Dept. *No. 5059. *1982. 019385 Bryant, R.E. *A switch level model and simulator for MOS digital systems. * California Inst. of Tech. CS Dept. *No. 5065. *1983. 019386 Chen, M. Mead, C. *A hierarchical simulator based on formal semantics. * California Inst. of Tech. CS Dept. *No. 5068. *1983. 019387 Trimberger, S.M. *Automated performance optimization of custom integrated circuits. * California Inst. of Tech. CS Dept. *No. 5073, Ph.D. Thesis. Trimberger, S.M. * 1983. 019388 Trawick, D.J. * Robust sentence analysis and habitability. * California Inst. of Tech. CS Dept. *No. 5074, Ph.D. Thesis. Trawick, D.J. *1983. 019389 Martin, A.J. *A general proof rule for procedures in predicate transformer semantics. * California Inst. of Tech. CS Dept. *No. 5075. *1983. 019390 Submicron Systems Architecture: semiannual technical report. Reporting period: 16 October 1982 to 15 April 1982. * California Inst. of Tech. CS Dept. *No. 5078. * 1983. 019391 Johnsson, L. * Highly concurrent algorithms for solving linear systems of equations. * California Inst. of Tech. CS Dept. *No. 5079. *1983. 019392 Lam, J. * RTsim: a register transfer simulator. * California Inst. of Tech. CS Dept. *No. 5081. *1983. 019393 Neches, P.M. * Hardware support for advanced data management systems. * California Inst. of Tech. CS Dept. *No. 5082, Ph.D. Thesis. Neches, P.M. *1983. 019394 Li, P-y.P. Johnsson, L. *The tree machine: an evaluation of strategies for reducing program loading time. * California Inst. of Tech. CS Dept. *No. 5084. *1983. 019395 Athas, W.C., Jr. *A VLSI combinator reduction engine. * California Inst. of Tech. CS Dept. *No. 5086. *1983. 019396 Lin, T.-M. Mead, C.A. * Signal delay in general RC networks with application to timing simulation of digital integrated circuits. * California Inst. of Tech. CS Dept. *No. 5089. *1983. 019397 Chen, M.C-m. * Space time algorithms: semantics and methodology. * California Inst. of Tech. CS Dept. * No. 5090, Ph.D. Thesis. Chen, M.C-m. *1983. 019398 Bryant, R.E. * Race detection in MOS circuits by ternary simulation. * California Inst. of Tech. CS Dept. *No. 5091. *1983. 019399 Chiang, C.-L. Johnsson, L. * Residue arithmetic and VLSI. * California Inst. of Tech. CS Dept. *No. 5092. *1983. 019400 Lutz, C. Rabin, S. Seitz, C. Speck, D. *Design of the Mosaic element. * California Inst. of Tech. CS Dept. *No. 5093. *1983. 019401 Kajiya, J.T. *New techniques for ray tracing procedurally defined objects. * California Inst. of Tech. CS Dept. *No. 5098. *1983. 019402 Mead, C. * VLSI and the foundations of computation. * California Inst. of Tech. CS Dept. *No. 5099. *1983. 019403 Schuster, M.D. Bryant, R.E. * Concurrent fault simulation of MOS digital circuits. * California Inst. of Tech. CS Dept. *No. 5101. *1983. 019404 Submicron Systems Architecture: semiannual technical report. Reporting period: 16 April 1983 to 15 October 1983. Principal investigator: Charles L. Seitz. Faculty investigators: Randal E. Bryant, James T. Kajiya, Alain J. Martin, Robert J. McEliece, Martin Rem, Charles L. Seitz. * California Inst. of Tech. CS Dept. *No. 5013. *1983. 019405 Wawrzynek, J. * Memory management in the programming language ICL. * California Inst. of Tech. CS Dept. * No. 5105. *1983. 019406 Kajiya, J.T. * Ray tracing parametric patches. * California Inst. of Tech. CS Dept. *No. 5106. *1982. 019407 Ullner, M.K. * Parallel machines for computer graphics. * California Inst. of Tech. CS Dept. *No. 5112, Ph.D. Thesis. Ullner, M.K. *1983. 019408 Mead, C. *The WOLery. * California Inst. of Tech. CS Dept. *No. 5113. *1984. 019409 Thompson, B.H. Thompson, F.B. * ASK as window to the world. * California Inst. of Tech. CS Dept. *No. 5114. *1984. 019410 Segal, R.L. *An integrative approach to engineering data and automatic project coordination. * California Inst. of Tech. CS Dept. *No. 5119. *1983. 019411 Submicron Systems Architecture: semiannual technical report. Reporting period: 16 October 1983 to 15 March 1984. Principal investigator: Charles L. Seitz. Faculty investigators: Randal E. Bryant, James T. Kajiya, Alain J. Martin, Robert J. McEliece, Martin Rem, Charles L Seitz. * California Inst. of Tech. CS Dept. *No. 5122. *1984. 019412 Constable, R.L. Bates, J.L. *The nearly ultimate PEARL. * Cornell U. CS Dept. *Tech Rpt 83-551. *1984. 019413 Hartmanis, J. *On non-isomorphic NP complete sets. * Cornell U. CS Dept. *Tech Rpt 83-576. *1983. 019414 Kirkpatrick, D.G. Seidel, R. *The ultimate planar convex hull algorithm?* Cornell U. CS Dept. *Tech Rpt 83-577. *1983. 019415 Coleman, T.F. Edenbrandt, A. Gilbert, J.R. *Predicting fill for sparse orthogonal factorization. * Cornell U. CS Dept. *Tech Rpt 83-578. *1983. 019416 Li, M. Yesha, Y. * String matching cannot be done by a two head one way deterministic finite automaton. * Cornell U. CS Dept. *Tech Rpt 83-579. *1983. 019417 Pritchard, P. *Long arithmetic progressions of primes: some old some new. * Cornell U. CS Dept. *Tech Rpt 83-580. *1984. 019418 Skeen, D. Wright, D.D. *Increasing availability in partitioned database systems. * Cornell U. CS Dept. * Tech Rpt 83-581. *1983 (revised 1984). 019419 Dwork, C. *Bounds on fundamental problems in parallel and distributed computation. * Cornell U. CS Dept. * Tech Rpt 84-582, Ph.D. Thesis. Dwork, C. *1984. 019420 Salton, G. *Howard Aiken's children: the Harvard computation laboratory and its students. * Cornell U. CS Dept. * Tech Rpt 83-583. *1983. 019421 Babaoglu, O. Bussan, M. Drummond, R. Schneider, F.B. * Documentation for the CHIP computer system (Version 1.0). * Cornell U. CS Dept. *Tech Rpt 83-584. *1983. 019422 Babaoglu, O. Schneider, F.B. *The HOCA operating system specifications. * Cornell U. CS Dept. *Tech Rpt 83-585. *1983. 019423 McCurley, R. Schneider, F.B. *Derivation of a distributed algorithm for finding paths in directed networks. * Cornell U. CS Dept. *Tech Rpt 83-586. *1983. 019424 Toueg, S. * Randomized asynchronous Byzantine agreements. * Cornell U. CS Dept. *Tech Rpt 83-587. *1983 (revised 1984). 019425 Salton, G. *The use of extended boolean logic in information retrieval. * Cornell U. CS Dept. *Tech Rpt 84-588. * 1984. 019426 Bitton, D. Turbyfill, C. *Design and analysis of multi user benchmarks for database systems. * Cornell U. CS Dept. *Tech Rpt 84-589. *1984. 019427 Bracha, G. *An asynchronous [(n-1)/3]-resilient consensus protocol. * Cornell U. CS Dept. *Tech Rpt 84-590. * 1984. 019428 Li, M. *On one tape versus two stacks. * Cornell U. CS Dept. *Tech Rpt 84-591. *1984. 019429 Seidel, R. *A method for proving lower bounds for certain geometric problems. * Cornell U. CS Dept. *Tech Rpt 84-592. *1984. 019430 Boehm, H.-J. *A logic for the Russell programming language. * Cornell U. CS Dept. *Tech Rpt 84-593, Ph.D. Thesis. Boehm, H.-J. *1984. 019431 Akl, S.G. *An optimal algorithm for parallel selection. * Queen's U. Computing & Info.Sci.Dept. *Tech Rpt 83-146. * 1983. 019432 Glasgow, J.I. *Towards a more operational semantics for LUCID. * Queen's U. Computing & Info.Sci.Dept. *Tech Rpt 83-148. *1983. 019433 Crawford, R.G. Becker, H.S. Ogilvie, J.E. *A relational bibliographic database. * Queen's U. Computing & Info.Sci.Dept. *Tech Rpt 83-149. *1983. 019434 Crawford, R.G. Becker, H.S. Ogilvie, J.E. * Universal relation theory as applied to bibliographic data. * Queen's U. Computing & Info.Sci.Dept. *Tech Rpt 83-150. * 1983. 019435 Akl, S.G. *On the security of compressed encodings. * Queen's U. Computing & Info.Sci.Dept. *Tech Rpt 83-151. *1983. 019436 Akl, S.G. Schmeck, H. * Systolic sorting in a sequential input/output environment. * Queen's U. Computing & Info.Sci.Dept. *Tech Rpt 84-154. *1984. 019437 Jenkins, M.A. *The Q'NIAL reference manual. Release 1.0. * Queen's U. Computing & Info.Sci.Dept. *1983. 052001 Stanford U. Center for the Study of Language and Info. * Research program on situated language. * Stanford U. Center for the Study of Language and Info. *CLSI-84-01. * 1984. 11p. 052002 Barwise, J. *The situation in logic - 1. * Stanford U. Center for the Study of Language and Info. *CLSI-84-02. *1984. 052003 Sag, I.A. Gazdar, G. Wasow, T. Weisler, S. *Coordination and how to distinguish categories. * Stanford U. Center for the Study of Language and Info. *CLSI-84-03. *1984. 48p. 052004 Konolige, K. * Belief and incompleteness. * Stanford U. Center for the Study of Language and Info. *CLSI-84-04. * 1984. 67p. 052005 Goguen, J.A. Meseguer, J. * Equality, types, modules and generics for logic programming. * Stanford U. Center for the Study of Language and Info. *CLSI-84-05. *1984. 30p. 052007 Kanerva, P. *Self-propagating search: a unified theory of memory. * Stanford U. Center for the Study of Language and Info. *CLSI-84-07. *1984. 174p. 024987 Ullman, J.D. *Some thoughts about supercomputer organization. * Stanford U. CS Dept. * STAN-CS-83-987. *1983. 17p. 024989 Knuth, D.E. Weening, J.S. *A programming and problem-solving seminar. * Stanford U. CS Dept. *STAN-CS-83-989. * 1983. 91p. This report contains edited transcripts of the discussions held in Stanford's course CS204, Problem Seminar, during Autumn Quarter 1981. 024990 Hobby, J.D. Knuth, D.E. *A programming and problem-solving seminar. * Stanford U. CS Dept. *STAN-CS-83-990. * 1983. 61p. This report contains edited transcripts of the discussions held in Stanford's course CS204, Problem Seminar, during Autumn Quarter 1982. 024991 Morgensteren, M. Shamir, E. * Parallel algorithms for arithmetics, irreducibility and factoring of GFq-polynomials. * Stanford U. CS Dept. * STAN-CS-83-991. *1983. 10p. 024992 Ketonen, J. Weening, J.S. *The language of an interactive proof checker. * Stanford U. CS Dept. * STAN-CS-83-992. *1983. 34p. 024993 Lansky, A.L. * Specification and analysis of concurrency. * Stanford U. CS Dept. *STAN-CS-83-993, Ph.D. Thesis. Lansky, A.L. *1983. 282p. 024994 Chapiro, D.M. * Sorting by recursive partitioning. * Stanford U. CS Dept. *STAN-CS-83-994. *1983. 30p. 024995 Clancey, W.J. *The advances of abstract control knowledge in expert system design. * Stanford U. CS Dept. * STAN-CS-83-995; Stanford U. CS Dept. Heuristic Programming Project. *HPP-83-17. *1983. 14p. 024996 Hasling, D.W. Clancey, W.J. Rennels, G. * Strategic explanations for a diagnostic consultation system. * Stanford U. CS Dept. *STAN-CS-83-996; Stanford U. CS Dept. Heuristic Programming Project. *HPP-83-41. * 1983. 23p. 024997 Clancey, W.J. * GUIDON. * Stanford U. CS Dept. * STAN-CS-83-997; Stanford U. CS Dept. Heuristic Programming Project*HPP-83-42. *1983. 8p. 024998 Mulsant, B. Servan-Schreier, D. * Knowledge engineering: a daily activity on a hospital ward. * Stanford U. CS Dept. *STAN-CS-83-998; Stanford U. CS Dept. Heuristic Programming Project. *HPP-83-40. *1983. 41p. 024999 Dolev, D. Maier, D. Mairson, H. Ullman, J. *Correcting faults in write-once memory. * Stanford U. CS Dept. * STAN-CS-83-999. *1983. 5p. 025002 Van Gelder, A. *A satisfiability tester for non-clausal propositional calculus. * Stanford U. CS Dept. * STAN-CS-83-1002. *1984. 12p. 025003 Anderson, R. Mayr, E. * Parallelism and greedy algorithms. * Stanford U. CS Dept. *STAN-CS-83-1003. *1984. 16p. 019439 Zadeh, L.A. *A theory of commonsense knowledge. * California U., Berkeley. Electronics Res.Lab. *Memo No. UCB/ERL M83/26. *1983. 019440 Zadeh, L.A. * Test score semantics as a basis for a computational approach to the representation of meaning. * California U., Berkeley. Electronics Res.Lab. *Memo No. UCB/ERL M84/08. *1984. 019441 Page, T.W. Jr. * Distributed query processing in local network databases. * California U., L.A. CS Dept. * CSD-840222. *1983. 019442 Popek, G.J. * Secure reliable processing systems. Final technical report: 1 July 1977 - 31 March 1982. Gerald J. Popek, Principal investigator. * California U., L.A. CS Dept. *CSD-840228. *1984. 019443 Chu, W.W. Hellerstein, J. Lan, M.T. An, J.M. Leung, K.K. * Database management algorithms for advanced BMD applications. Final report for the period: February 1, 1983 to January 31, 1984. Wesley W. Chu, Principal investigator. Researchers: J. Hellerstein, M.T. Lan, J.M. An, and K.K. Leung. * California U., L.A. Eng. & Appl.Sci.Sch. *UCLA-ENG-8407; California U., L.A. Eng. & CS Dept. *CSD-840031. *1984. 019444 Bannon, L.J. Conway, E. Cypher, A. Draper, S.W. Greenspan, S.L. Monty, M.L. Norman, D.A. O'Malley, C. Owen, D. Riley, M.S. Smolensky, P. * User centered system design. Part II. Collected papers from the UCSD HM1 Project. * California U., San Diego. Inst. for Cognitive Sci. *ICS Rpt. 8402. *1984. 019445 Smolensky, P. Riley, M.S. * Harmony theory: problem solving, parallel cognitive models, and thermal physics. * California U., San Diego. Inst. for Cognitive Sci. *ICS Rpt. 8404. *1984. 019446 Belford, G.G. Liu, J.W.S. Cho, D. Cotten, P. England, S. Goldstein, J.D. Hwung, S.C. Kaufman, K.A. Kim, C.K. Leo, J. Manolas, A.P. Moon, A. Smet, A.D. Yan, Y.L. * Mutual consistency maintenance in a prototype data traffic management system. * Illinois U. CS Dept. * UIUCDCS-R-83-1142. *1983. 019447 Padmanabhan, K. * Fault tolerance and performance improvement in multiprocessor interconnection networks. * Illinois U. CS Dept. *UIUCDCS-R-84-1156, Ph.D. Thesis. Padmanabhan, K. *1984. 019448 Schwiesow, J.D. *Automatic layout generation of MOS fixed function cells. * Illinois U. CS Dept. * UIUCDCS-R-84-1161. *1984. 019449 Peterson, J.S. *Automatic file migration: reload queuing simulations and Markov models. * Illinois U. CS Dept. *UIUCDCS-R-84-1166, Ph.D. Thesis. Peterson, J.S. *1984. 019450 Franta, W.R. Heath, J.R. *Performance of HYPERchannel networks: parameters, measurements, models and analysis. Part II: Satellite connected HYPERchannel networks. * Minnesota U. CS Dept. *Tech Rpt 82-23. *1982. 019451 Cohoon, J. Sahni, S. * Heuristics for the circuit realization problem. * Minnesota U. CS Dept. * Tech Rpt 82-24. *1982. 019452 Lai, T.-H. Sahni, S. * Anomalies in parallel branch and bound algorithms. * Minnesota U. CS Dept. *Tech Rpt 82-25. *1982. 019453 Ibarra, O.H. Kim, S.M. Rosier, L.E. * Space and time efficient TM simulations and characterizations of some restricted classes of automata. * Minnesota U. CS Dept. *Tech Rpt 83-01. *1983. 019454 Ibarra, O.H. Kim, S.M. *Characterizations and computational complexity of systolic trellis automata. * Minnesota U. CS Dept. *Tech Rpt 83-02. *1983. 019455 Sahni, S. * Scheduling supercomputers. * Minnesota U. CS Dept. *Tech Rpt 83-03. *1983. 019456 Zhang, X.S. Rosen, J.B. * Global concave minimization. * Minnesota U. CS Dept. *Tech Rpt 83-04. *1983. 019457 Kalantari, B. Rosen, J.B. *Construction of large scale global minimum concave quadratic test problems. * Minnesota U. CS Dept. *Tech Rpt 83-05. *1983. 019458 Rosen, J.B. *Performance of approximate algorithms for global minimization. * Minnesota U. CS Dept. * Tech Rpt 83-06. *1983. 019459 Zhang, X.S. * Solution property of parametric linear programs. * Minnesota U. CS Dept. *Tech Rpt 83-07. * 1983. 019460 Han, S. Sahni, S. * Single row routing in narrow streets. * Minnesota U. CS Dept. *Tech Rpt 83-08. *1983. 019461 Du, H.C. * Distributing a database for parallel processing is NP-hard. * Minnesota U. CS Dept. *Tech Rpt 83-09. * 1983. 019462 Boley, D. *A perturbation result for linear control problems. * Minnesota U. CS Dept. *Tech Rpt 83-10. * 1983. 019463 Zhang, S.X. *On the convergence of Rosen's gradient projection method. * Minnesota U. CS Dept. *Tech Rpt 83-11. *1983. 019464 Gini, M. Gini, G. *From goals to manipulator programs. * Minnesota U. CS Dept. *Tech Rpt 83-12. *1983. 019465 Kane, R. Sahni, S. *A systolic design rule checker. * Minnesota U. CS Dept. *Tech Rpt 83-13. *1983. 019466 Berzins, V. *Estimating errors in Laplacian edge detectors. * Minnesota U. CS Dept. *Tech Rpt 83-14. *1983. 019467 Du, H.C. *On the file design problem for partial match retrieval. * Minnesota U. CS Dept. *Tech Rpt 83-15. * 1983. 019468 Borgwardt, P. * Parallel Prolog using stack segments on shared memory multiprocessors. * Minnesota U. CS Dept. *Tech Rpt 83-16. *1983. 019469 Ibarra, O.H. Kim, S.M. *A characterization of systolic binary tree automata and applications. * Minnesota U. CS Dept. *Tech Rpt 83-17. *1983. 019470 Ibarra, O.H. Kim, S.M. * Trellis automata: characterizations, speed-up, hierarchy, decision problems. * Minnesota U. CS Dept. *Tech Rpt 83-18. * 1983. 019471 Bruell, S.C. Balbo, G. Ghanta, S. Afshari, P.V. *A mean value analysis based package for the solution of product form queueing network models. * Minnesota U. CS Dept. *Tech Rpt 83-19. *1983. 019472 Ibarra, O.H. Kim, S.M. *Characterizations of linear iterative arrays. * Minnesota U. CS Dept. *Tech Rpt 83-20. *1983. 019473 Lauer, P.E. * Computer system dossiers. * Newcastle Upon Tyne U. Computing Lab. *No. 185. *1983. 019474 Campbell, R.H. Randell, B. * Error recovery in asynchronous systems. * Newcastle Upon Tyne U. Computing Lab. *No. 186. * 1983. 019475 Shrivastava, S.K. *On the treatment of orphans in a distributed system. * Newcastle Upon Tyne U. Computing Lab. *No. 188. *1983. 019476 Panzieri, F. Randell, B. *Interfacing UNIX to data communications networks. * Newcastle Upon Tyne U. Computing Lab. *No. 190. *1983. 019477 Hisdal, E. *A theory of logic based on probability. Part I, the tee model. * Oslo U. Informatics Inst. *Res Rpt 64. * 1984. 019478 Gjessing, S. * Verification of monitors based on a partial correctness semantics. * Oslo U. Informatics Inst. * Res Rpt 77. *1983. 019479 Koch, P.E. * Error bounds for interpolation by fourth order trigonometric splines. * Oslo U. Informatics Inst. * Res Rpt 78. *1983. 019480 Dahl, O.-J. * LIFO disciplined simplex algorithm. * Oslo U. Informatics Inst. *Res Rpt 79. *1984. 019481 Cohen, E. Lyche, T. Riesenfeld, R. * Discrete box splines and refinement algorithms. * Oslo U. Informatics Inst. * Res Rpt 80. *1983. 019482 Cohen, D. Postel, J. * Gateways, bridges and tunnels in computer mail. * Southern California U. Info.Sci.Inst. * ISI/RS-83-117. *1984. 019483 Cohen, D. * Real time packet video over satellite channels. * Southern California U. Info.Sci.Inst. *ISI/RS-83-118. * 1984. 019484 Moses, L. Coyazo, S. *Using Scribe to select fonts on the the Penguin. * Southern California U. Info.Sci.Inst. * ISI/TM-83-119. *1984. 019485 Matthiessen, C.M.I.M. *How to make grammatical choices in text generation. * Southern California U. Info.Sci.Inst. * ISI/RS-83-120. *1984. 019486 Matthiessen, C.M.I.M. * Systemic grammar in computation: the Nigel case. * Southern California U. Info.Sci.Inst. * ISI/RS-83-121. *1984. 019487 Robinson, J.J. *Extending grammars to new domains. * Southern California U. Info.Sci.Inst. *ISI/RR-83-123. * 1984. 019488 Mann, W.C. * Discourse structures for text generation. * Southern California U. Info.Sci.Inst. *ISI/RR-84-127. * 1984. 019489 Raymond, D.R. * Personal data structuring in videotex. * Waterloo U. CS Dept. *CS-84-07. *1984. 019490 Culberson, J.C. * Updating binary trees. * Waterloo U. CS Dept. *CS-84-08. *1984. 019491 Trickett, S.R. * Rational approximations to the exponential function or the numerical solution of the heat conduction problem. * Waterloo U. CS Dept. *CS-84-09. *1984. 019492 Mangasarian, O.L. McLinden, L. *Simple bounds for solutions of monotone complementarity problems and convex programs. * Wisconsin U. CS Dept. *Tech Rpt 534. *1984. 019493 Krueger, P. Finkel, R. *An adaptive load balancing algorithm for a multicomputer. * Wisconsin U. CS Dept. * Tech Rpt 539. *1984. 019494 Scott, M.L. Finkel, R.A. * Partitioning files for Huffman encoding. * Wisconsin U. CS Dept. *Tech Rpt 540. * 1984. 019495 Marzullo, K.A. *Maintaining the time in a distributed system: an example of a loosely coupled distributed service. * Xerox. Palo Alto Res. Center. Office Products Div. *OSD-T8401, Ph.D. Thesis. Marzullo, K.A. *1984. 019496 Dean, T. * Time map maintenance. * Yale U. CS Dept. * Res Rpt 289. *1983. 019497 Ipsen, I.C.F. * Singular value computations with systolic arrays. * Yale U. CS Dept. *Res Rpt 291. *1983. 019498 Davis, E. *Representing and acquiring geographic knowledge. * Yale U. CS Dept. *Res Rpt 292, Ph.D. Thesis. Davis, E. *1984. 019499 O'Donnell, S.T. Geiger, P. Schultz, M.H. *Solving the Poisson equation on the FPS-164. * Yale U. CS Dept. * Res Rpt 293. *1983. 019500 Gelernter, D. * Generative communication in Linda. * Yale U. CS Dept. *Res Rpt 294. *1983. 019501 Chan, T.F. Kerkhoven, T. * Fourier methods with extended stability intervals for the Korteweg de Vries equation. * Yale U. CS Dept. *Res Rpt 295. *1983. 019502 Letovsky, S. *Qualitative and quantitative temporal reasoning. * Yale U. CS Dept. *Res Rpt 296. *1983. 019503 Fisher, J.A. O'Donnell, J.J. * VLIW machines: multiprocessors we can actually program. * Yale U. CS Dept. *Res Rpt 298. *1984. 019504 Ipsen, I.C.F. *A parallel QR method using fast Givens' rotations. * Yale U. CS Dept. *Res Rpt 299. *1984. 019505 Elman, H.C. Saad, Y. Saylor, P.E. *A hybrid Chebyshev Krylov subspace algorithm for solving nonsymmetric systems of linear equations. * Yale U. CS Dept. *Res Rpt 301. * 1984. 019506 Dembo, R.S. Tulowitzki, U. *On the minimization of quadratic functions subject to box constraints. * Yale U. CS Dept. *Res Rpt 302. *1984. 019507 Dembo, R. Sahi, S. *A convergent framework for constrained nonlinear optimization. * Yale U. CS Dept. *Res Rpt 303. *1984. 019508 Dembo, R. *A primal truncated Newton algorithm with application to large scale nonlinear network optimization. * Yale U. CS Dept. *Res Rpt 304. *1983. 019509 Chan, T.F. Lee, D. Shen, L. * Stable explicit schemes for equations of the Schroedinger type. * Yale U. CS Dept. *Res Rpt 305. *1984. 019510 Schank, R.C. *The explanation game. * Yale U. CS Dept. * Res Rpt 307. *1984. 019511 Gusfield, D. Pitt, L. *Understanding approximations for node cover and other subset selection problems. * Yale U. CS Dept. *Res Rpt 308. *1984. 019512 Bramble, J.H. Pasciak, J.E. * Preconditioned iterative methods for nonselfadjoint or indefinite elliptic boundary value problems. * Yale U. CS Dept. *Res Rpt 309. *1984. VOL. 6, NO. 8 08/06/84 019513 Clarke, E.M. Emerson, E.A. Sistla, A.P.* Automatic verification of finite state concurrent systems using temporal logic specifications: a practical approach.* Carnegie Mellon U. CS Dept. *CMU-CS-83-152.*1983. 019514 Brookes, S.D. Hoare, C.A.R. Roscoe, A.W.*A theory of communicating sequential processes.* Carnegie Mellon U. CS Dept. *CMU-CS-83-153.*1983. 019515 Winskel, G.*A representation of completely distributive algebraic lattices.* Carnegie Mellon U. CS Dept. * CMU-CS-83-154.*1983. 019516 Mishra, B. Clarke, E.M.* Automatic and heirarchical verification of asynchronous circuits using temporal logic.* Carnegie Mellon U. CS Dept. *CMU-CS-83-155.* 1983. 019517 Hayes, P.J. Carbonell, J.G.*A tutorial on techniques and applications for natural language processing.* Carnegie Mellon U. CS Dept. *CMU-CS-83-158.*1983. 019518 Winskel, G.*A note on powerdomains and modality.* Carnegie Mellon U. CS Dept. *CMU-CS-83-159.*1983. 019519 Doyle, J.*What should AI want from the supercomputers?.* Carnegie Mellon U. CS Dept. *CMU-CS-83-160.*1983. 019520 Ohta, Y. Kanade, T.* Stereo by intra- and inter-scanline search using dynamic programming.* Carnegie Mellon U. CS Dept. *CMU-CS-83-162.*1983. 019521 Schwarz, P.M. Spector, A.Z.* Synchronizing shared abstract types.* Carnegie Mellon U. CS Dept. *CMU-CS-83-163.* 1983. 019522 Jones, A.K. Segall, Z. Sietz, C. Wilson, A.* Workshop on Multiprocessors for High Performance parallel Computation, Seven Springs, Champion, Pennsylvania, June 27-29, 1983. Sponsored by Carnegie-Mellon University and the National Science Foundation. Edited by Anita K. Jones, Zary Segall, Chuck Seitz, and Andrew Wilson.* Carnegie Mellon U. CS Dept. *CMU-CS-83-164.*1983. 019523 Kung, H.T. Lam, M.S.* Fault tolerance and two-level pipelining in VLSI systolic arrays.* Carnegie Mellon U. CS Dept. *CMU-CS-83-166.*1983. 019524 Gupta, A. Forgy, C.L.*Measurements on production systems.* Carnegie Mellon U. CS Dept. *CMU-CS-83-167.*1983. 019525 Winskel, G.* Nondeterministic recursive program schemes and powerdomains.* Carnegie Mellon U. CS Dept. * CMU-CS-83-169.*1983. 019526 Hon, R.W.*The hierarchical analysis of VLSI designs.* Carnegie Mellon U. CS Dept. *CMU-CS-83-170, Ph.D. Thesis. Hon, R.W.*1983. 099091 The Robotics Institute: annual research review.* Carnegie Mellon U. CS Dept. *1983- 019527 Cutkowski, M.R. Jourdain, J.M. Wright, P.K.*Testing and control of a compliant wrist.* Carnegie Mellon U. Robotics Inst.*CMU-RI-TR-84-04.*1984. 019528 Cutkowsky, M.R. Fussell, P.S. Milligan, R.* Precision flexible machining cells within a manufacturing system.* Carnegie Mellon U. Robotics Inst.*CMU-RI-TR-84-12.*1984. 019529 Reif, J.H. Lewis, H.R.*Efficient symbolic analysis of programs.* Harvard U. Comp.Tech.Res. Center.*TR-37-82.* 1982. 019530 Goodman, N. Suri, R. Tay, Y.C.*A simple analytic model for performance of exclusive locking in database systems.* Harvard U. Comp.Tech.Res. Center.*TR-01-83.*1983. 019531 Konchan, T.E.*Using the Musa model to quantify the reliability of embedded computer software.* Harvard U. Comp.Tech.Res. Center.*TR-03-83.*1983. 019532 Suri, R.*Characterization of monotonicity in closed queueing networks.* Harvard U. Comp.Tech.Res. Center.* TR-06-83.*1983. 019533 Tay, Y.C. Suri, R.*Sample statistics and error bounds for performance predictions in queueing networks.* Harvard U. Comp.Tech.Res. Center.*TR-07-83.*1983. 019534 Reif, J.* Probabilistic parallel prefix computation.* Harvard U. Comp.Tech.Res. Center.*TR-08-83.*1983. 019535 Komorowski, H.J.* Interactive and incremental programming environments: experience, foundations, and future.* Harvard U. Comp.Tech.Res. Center.*TR-09-83.*1983. 019536 Bernstein, P.A. Goodman, N. Hadzilacos, V.* Recovery algorithms for database systems.* Harvard U. Comp.Tech.Res. Center.*TR-10-83.*1983. 019537 Homer, S. Reif, J.* Arithmetic theories for computational complexity problems.* Harvard U. Comp.Tech.Res. Center.* TR-11-83.*1983. 019538 Reif, J.H.* Data flow analysis of distributed communicating processes.* Harvard U. Comp.Tech.Res. Center.*TR-12-83.* 1983. 019539 Reif, J.H.*The complexity of reachability and deadlock detection for distributed communicating processes.* Harvard U. Comp.Tech.Res. Center.*TR-13-83.*1983. 019540 Reif, J.* Parallel algorithms for graph isomorphism.* Harvard U. Comp.Tech.Res. Center.*TR-14-83.*1983. 019541 Gasarch, W.I. Homer, S.* Relativizations comparing NP and exponential time.* Harvard U. Comp.Tech.Res. Center.* TR-15-83.*1983. 019542 Tay, Y.C. Suri, R. Goodman, N.*A mean value performance model for locking in databases: the no waiting case.* Harvard U. Comp.Tech.Res. Center.*TR-16-82.*1983. 019543 Goodman, N. Tay, Y.C.*Synthesizing fourth normal form relations from multivalued dependencies.* Harvard U. Comp.Tech.Res. Center.*TR-17-83.*1983. 019544 Tay, Y.C.* Byzantine agreement is shortlived: reliability of k-resilient distributed protocols.* Harvard U. Comp.Tech.Res. Center.*TR-18-83.*1983. 019545 Hadzilacos, V.* Byzantine agreement under restricted types of failures.* Harvard U. Comp.Tech.Res. Center.*TR-19-83.* 1983. 019546 Bernstein, P.A. Goodman, N.* Concurrency control and recovery for replicated distributed databases.* Harvard U. Comp.Tech.Res. Center.*TR-20-83.*1983. 019547 Hadzilacos, V.*A lower bound for Byzantine agreement with fail stop processors.* Harvard U. Comp.Tech.Res. Center.* TR-21-83.*1983. 019548 Herrman, J.C.* Reference based protection.* Harvard U. Comp.Tech.Res. Center.*TR-22-83, Ph.D. Thesis. Herrmann, J.C.*1983. 019549 Kelley, J.F.*An iterative design methodology for user friendly natural language office information applications.* IBM Watson Res. Center.*RC 10276.*1983. 019550 Chess, D.M.*The IBM PC database and conferencing facility.* IBM Watson Res. Center.*RC 10277.*1983. 019551 Gilbert, R.S.*Performance comparison of contention and token protocols for a sample high latency ring network.* IBM Watson Res. Center.*RC 10278.*1983. 019552 Nair, R. Bruss, A. Reif, J.* Linear time algorithms for optimal CMOS layout.* IBM Watson Res. Center.*RC 10279.* 1983. 019553 Brand, D.*Detecting sneak paths in transistor networks.* IBM Watson Res. Center.*RC 10281.*1983. 019554 Stone, H.S.* Optimal decision chains.* IBM Watson Res. Center.*RC 10283.*1983. 019555 Hauge, P.S. Yoffa, E.J.* ACORN: a system for CVS macro design by tree placement and tree customization.* IBM Watson Res. Center.*RC 10298.*1983. 019556 Tetzlaff, L.S.* Videotex human factors.* IBM Watson Res. Center.*RC 10313.*1984. 019557 Perlman, A.* CRASH! Obstacle detection in robotic application simulation.* IBM Watson Res. Center.*RC 10319.*1984. 019558 Rosson, M.B.*Effects of experience on learning, using and evaluating a text editor.* IBM Watson Res. Center.*RC 10322.*1984. 019559 Rosson, M.B.*The interaction of pronunciation rules and lexical representations in reading aloud.* IBM Watson Res. Center.*RC 10323.*1984. 019560 Wesley, M.A. Markowsky, G.*Generation of solid models from two and three dimensional data.* IBM Watson Res. Center.* RC 10328.*1984. 019561 Arnold, R. Coppersmith, D.*An alternative to perfect hashing.* IBM Watson Res. Center.*RC 10332.*1984. 019562 Mack, R.*Understanding text editing: evidence from predictions and descriptions given by computer naive people.* IBM Watson Res. Center.*RC 10333.*1984. 019563 McCord, M.C.* Semantic interpretation for the EPISTLE system.* IBM Watson Res. Center.*RC 10334.*1984. 019564 Coppersmith, D. Silberger, A.*On the minimality of Eklundh type algorithms for computing the transposes of matrices.* IBM Watson Res. Center.*RC 10335.*1984. 019565 Hailpern, B.*A simple protocol whose proof isn't.* IBM Watson Res. Center.*RC 10336.*1984. 019566 Coppersmith, D.*Each four celled animal tiles the plane.* IBM Watson Res. Center.*RC 10337.*1984. 019567 Trevillyan, L. Joyner, W. Berman, L.* Global flow analysis in automatic logic design.* IBM Watson Res. Center.*RC 10340.*1984. 019568 Wittrock, R.J.* Dual nested decomposition of staircase linear programs.* IBM Watson Res. Center.*RC 10343.*1984. 019569 Wittrock, R.J.*A nested decomposition algorithm for solving staircase linear programs.* IBM Watson Res. Center.*RC 10344.*1984. 019570 Tantawi, A.N. Towsley, D.*Optimal load balancing in distributed computer systems.* IBM Watson Res. Center.*RC 10346.*1984. 019571 Ostapko, D.L.*A mapping and memory chip hardware which provides symmetric reading/writing of horizontal and vertical lines.* IBM Watson Res. Center.*RC 10348.*1984. 019572 Baratz, A.E. Jaffe, J.M.*Establishing virtual circuits in large computer networks.* IBM Watson Res. Center.*RC 10350.*1984. 019573 Schechtman, B.H. Bjorklund, G.C. Moerner, W.E.*A horse of a different color: frequency domain optical storage.* IBM Watson Res. Center.*RJ 4128.*1983. 019574 Cristian, F.*On exceptions, failures, faults, and errors.* IBM Watson Res. Center.*RJ 4130.*1983. 019575 Rissanen, J.* Minimum description length principle.* IBM Watson Res. Center.*RJ 4131.*1983. 019576 Ladner, R.E. Stockmeyer, L.J. Lipton, R.J.* Alternation bounded auxiliary pushdown automata.* IBM Watson Res. Center.*RJ 4144.*1983. 019577 Vardi, M.Y.*A note on lossless database decompositions.* IBM Watson Res. Center.*RJ 4145.*1983. 019578 Lorie, R. Kim, W. McNabb, D. Plouffe, W.* User interface and access techniques for engineering databases.* IBM Watson Res. Center.*RJ 4155.*1984. 019579 Kimoto, T. Casey, R.G.* Edge smoothing algorithms for horizontal and vertical line patterns in binary images.* IBM Watson Res. Center.*RJ 4156.*1984. 019580 Terry, D.B.*The COSIE name server.* IBM Watson Res. Center.* RJ 4161.*1984. 019581 Langdon, G.G.*On parsing versus mixed order model structures for data compression.* IBM Watson Res. Center.* RJ 4163.*1984. 019582 Deransart, P. Jourdan, M. Lorho, B.*Speeding up circularity tests for attribute grammars.* INRIA.*Rapport de Recherche 211.*1983. 019583 Camion, P. Courteau, B. Fournier, G. Kanetkar, S.V.* Weight distribution of translates of linear codes and generalized Pless identities.* INRIA.*Rapport de Recherche 213.*1983. 019584 Andre, F. Frison, P. Quinton, P.*Algorithmes systoliques: de la theorie a la pratique.* INRIA.*Rapport de Recherche 214.*1983. 019585 Frison, P.*Un processeur pour la reconnaissance de la parole.* INRIA.*Rapport de Recherche 215.*1983. 019586 Quinton, P.*The systematic design of systolic arrays.* INRIA.*Rapport de Recherche 216.*1983. 019587 Besnard, P.*Une procedure de decision en logique non-monotone.* INRIA.*Rapport de Recherche 217.*1983. 019588 Darondeau, P. Kott, L.*A formal proof system for infinitary rational expressions.* INRIA.*Rapport de Recherche 218.* 1983. 019589 Benveniste, A. Goursat, M.* Blind equalizers.* INRIA.* Rapport de Recherche 219.*1983. 019590 Jacquet, P.*Proprietes moyennes du protocole capetanakis a arrivees libres.* INRIA.*Rapport de Recherche 240.*1983. 019591 Flajolet, P. Peuch, C. Vuillemin, J.*The analysis of simple list structures.* INRIA.*Rapport de Recherche 241.*1983. 019592 Bonnans, J.F.*A variant of a projected variable metric method for bound constrained optimization problems.* INRIA.*Rapport de Recherche 242.*1983. 019593 Saint-Dizier, P.*On quantifier heirarchy and its paraphrase in a semantic representation of natural language sentences.* INRIA.*Rapport de Recherche 243.*1983. 019594 Marie, R. Rubino, G.*Sur l'existence et l'unicite du reseau homogene a un reseau ferme de files d'attente a lois generales.* INRIA.*Rapport de Recherche 244.*1983. 019595 Fayolle, G. Flajolet, P. Hofri, M. Jacquet, P.*The evaluation of packet transmission characteristics in a multi access channel with stack collision resolution protocol.* INRIA.*Rapport de Recherche 245.*1983. 019596 Le Lann, G.* Deterministic multiple access protocols for real time local area networks.* INRIA.*Rapport de Recherche 246.*1983. 019597 Nain, P.* Interdeparture times from a queueing system with preemptive resume priority.* INRIA.*Rapport de Recherche 248.*1983. 019598 Bancilhon, F. Richard, P.*A sound and complete axiomatization of embedded cross dependencies.* INRIA.* Rapport de Recherche 249.*1983. 019599 Angrand, F. Dervieux, A. Loth, L. Vijayasundaram, G.* Simulation of Euler transonic flows by means of explicit finite element type schemes.* INRIA.*Rapport de Recherche 250.*1983. 019600 Hamatsuka, T.*On spectral span and eigenvalue eigenvector assignment for a class of infinite dimensional control systems.* INRIA.*Rapport de Recherche 252.*1983. 019601 Bonnans, J.F.*On an algorithm for optimal control using Pontryagin's maximum principle.* INRIA.*Rapport de Recherche 254.*1983. 019602 Giboin, A. Michard, A.*Introducing novices to structured programming with a "tree" programming language and a "tree" editor.* INRIA.*Rapport de Recherche 255.*1983. 019603 Sebillotte, S.*Representation des actions de l'operateur.* INRIA.*Rapport de Recherche 256.*1983. 019604 Klint, P.*A survey of three language independent programming environments.* INRIA.*Rapport de Recherche v 257.*1983. 019605 Bouzeghoub, M.*Une synthese des methodes et des outils d'aide a la conception de systemes d'information.* INRIA.* Rapport de Recherche 258.*1983. 019606 Le Boudec, J.*Distribution des interentrees et intersorties pour des reseaux a forme produit.* INRIA.*Rapport de Recherche 261.*1983. 019607 Schroeder, A.*Une etude quantitative statique de programmes Pascal.* INRIA.*Rapport Technique 029.*1983. 019608 Sebillotte, S.*Etude preliminaire du travail de secretariat dans un service hospitalier specialise.* INRIA.*Rapport Technique 030.*1983. 019609 Serlet, B.*Le langage HELL de description de circuits integres.* INRIA.*Rapport Technique 031.*1983. 019610 Akkerhuis, J.N.* Typesetting and TROFF.* Mathematisch Centrum.*IW 247/83.*1983. 019611 Nienhaus, A.*On the design of an editor for the B programming language.* Mathematisch Centrum.*IW 248/83.* 1983. 019612 Vitanyi, P.M.B.*On two tape real time computation and queues.* Mathematisch Centrum.*IW 246/83.*1983. 019613 Bergstra, J.A. Tucker, J.V.* Top down design and the algebra of communicating processes.* Mathematisch Centrum. Centrum voor Wiskunde en Informatica.*Rpt. CS-R8401.*1984. 019614 Bergstra, J.A. Klop, J.W.* Algebra of communicating processes with abstraction.* Mathematisch Centrum. Centrum voor Wiskunde en Informatica.*Rpt. CS-R8403.* 1984. 019615 Symm, G.T. Wichman, B.A. Kok, J. Winter, D.T.*Guidelines for the design of large modular scientific libraries in ADA: final report for the Commission of the European Communities.* Mathematisch Centrum. Centrum voor Wiskunde en Informatica.*Note NM-N8401.*1984. 019616 Konolige, K.* Belief and incompleteness.* SRI International.*Tech. note 319.*1984. 019617 Wichmann, B.A.*Tutorial material on the real data types in Ada.* U.K. National Physical Lab. Info. Technology and Computing Div.*DITC 34/83.*1984. 019618 Vaswani, P.K.T.*The Demos multi-computer project: hardware aspects.* U.K. National Physical Lab. Info. Technology and Computing Div.*DITC 36/84.*1984. 019619 Wichmann, B.A. Meijerink, J.G.J.*Converting to ADA packages.* U.K. National Physical Lab. Info. Technology and Computing Div.*DITC 39/84.*1984. 019620 Bramhoff, H. Jantzen, M.*Durch Petrinetze definierte Klassen zahlentheoretischer Funktionen.* Hamburg U. Institut fuer Informatik.*Bericht nr. 098.*1983. 019621 Jantzen, M.*Extending regular expressions with iterated shuffle.* Hamburg U. Institut fuer Informatik.*Bericht nr. 099.*1984. 019622 Valk, R. Jantzen, M.*The residue of vector sets with applications to decidability problems in petri nets.* Hamburg U. Institut fuer Informatik.*Bericht nr. 101.* 1984. 019623 Muller, H.*An estimation of the statistic time complexity of hereditary graph properties with an application to the vertex coloring problem.* Karlsruhe Universitaet. Institut fuer Informatik.*Interner Bericht 01/83.*1983. 019624 Hoffman, W. Lehmann, A.*Leistungsfahigkeit eines Mehrprozessorsystems mit Kreuzschienenverteiler und lokalen Pufferspeichern.* Karlsruhe Universitaet. Institut fuer Informatik.*Interner Bericht 10/83.*1983. 019625 Ohlbach, H.J. Wrightson, G.*Solving a problem in relevance logic with an automated theorem prover.* Karlsruhe Universitaet. Institut fuer Informatik.*Interner Bericht 11/83.*1983. 019626 Adams, M. Ferkinghoff, B. Bender, K. Drobnik, O. Lockmann, P.C.*Datenhaltungssysteme in der Prozessdatenverarbeitung: ein Anforderungsprofil.* Karlsruhe Universitaet. Institut fuer Informatik.* Interner Bericht 16/83.*1983. 019627 Zadeh, L.A.*A computational theory of dispositions.* California U., Berkeley. Electronics Res.Lab.*n.d. 019628 Bozek, J.J.* Music: management and editing of functional designs.* Illinois U. CS Dept. *UIUCDCS-R-84-1160.* 1984. 019629 Markt, D.E.*Study of file migration strategies.* Illinois U. CS Dept. *UIUCDCS-R-84-1167.*1984. 019630 Whaley, A.D.* Higher layer protocols for a workstation architecture.* Illinois U. CS Dept. * UIUCDCS-R-84-1169, Ph.D. Thesis. Whaley, A.D.*1984. 019631 Dollas, A.* Spectrum sample transmission: a new concept in wavelength division multiplexing.* Illinois U. CS Dept. *UIUCDCS-R-84-1172.*1984. 019632 Goldstein, J.*Designing user interfaces.* Illinois U. CS Dept. *UIUCDCS-R-84-1173.*1984. 019633 Ray, S.R. Lee, W.D. Morgan, C.D. Airth-Kindree, W.* Sleep stage scoring of normal human subjects by computer: a preliminary algorithm based on the expert system approach.* Illinois U. CS Dept. *UIUCDCS-R-84-1174.* 1984. 019634 Augusteijn, M.F. Dyer, C.R.* Model based shape from contour and point patterns.* Wisconsin U. CS Dept. * Tech.rpt. 542.*1984. 019635 Khoshafian, S.N.*A building blocks approach to statistical databases.* Wisconsin U. CS Dept. *Tech.rpt. 543, Ph.D. Thesis. Khoshafian, S.N.*1984. VOL. 6, NO. 9 08/20/84 019636 Chazelle, B. Ottman, T. Soisalon-Soisinen, E. Wood, D.*The complexity and decidability of SEPARATION.* Brown U. CS Dept *CS-84-08.*1984. 019637 Reiss, S.P.*An approach to incremental compilation.* Brown U. CS Dept *CS-84-09.*1984. 019638 Wegner, P.*Perspectives on capital intensive software technology.* Brown U. CS Dept *CS-84-10.*1984. 019639 Schmidt, D.*A programming notation for tactical reasoning.* Edinburgh U. CS Dept *CSR-141-83.*1983. 019640 Schmidt, D.* Natural deduction theorem proving in set theory.* Edinburgh U. CS Dept *CSR-142-83.*1983. 019641 Schmidt, D.*Detecting global variables in denotational specifications.* Edinburgh U. CS Dept *CSR-143-83.* 1983. 019642 Shields, M.W.* Non sequential behaviours: 2.* Edinburgh U. CS Dept *CSR-144-83.*1983. 019643 Deas, A.R.*The UNIT silicon compiler.* Edinburgh U. CS Dept *CSR-145-83.*1983. 019644 Sokolowski, S.*An LCF proof of soundness of Hoare's logic - a paper without a happy ending.* Edinburgh U. CS Dept *CSR-146-83.*1983. 019645 McCaskill, G.A.* Interactive ILAP.* Edinburgh U. CS Dept *CSR-147-83.*1983. 019646 Tarlecki, A.*A language of specified programs.* Edinburgh U. CS Dept *CSR-148-83.*1983. 019647 Tarlecki, A.* Free constructions in algebraic institutions.* Edinburgh U. CS Dept *CSR-149-83.*1983. 019648 Marshall, R.M.*A compiler for large scale.* Edinburgh U. CS Dept *CSR-150-83.*1983. 019649 Salus, P.H.* Writing and technical writing: some notes and comments.* IBM Watson Res. Center.*RA 155.*1984. 019650 Falcigno, K.M. Guynup, P.E.*Toward the information environment of 1985.* IBM Watson Res. Center.*RA 151.* 1984. 019651 Orth, D.L.* Polygonal functions and their use in teaching calculus.* IBM Watson Res. Center.*RC 10451.*1984. 019652 Kumar, M. Jump, J.R.* Performance enhancement in buffered delta networks.* IBM Watson Res. Center.*RC 10450.*1984. 019653 Cobham, A.*Should a machine think? -- reflections on AI.* IBM Watson Res. Center.*RC 10447.*1984. 019654 Georgiou, C.J.* Fault tolerant crosspoint switching networks.* IBM Watson Res. Center.*RC 10446.*1984. 019655 Beetem, J.F. Debefve, P. Donath, W. Hsieh, H.Y. Odeh, F. Ruehli, A.E. White, J. Wolff, P.K. Sr.*A large scale MOSFET circuit analyzer based on waveform relaxation.* IBM Watson Res. Center.*RC 10443.*1983. 019656 Carroll, J.M. Mack, R.L. Lewis, C.H. Grichkowsky, N.L. Robertson, S.R.* Learning to use a word processor by guided exploration.* IBM Watson Res. Center.*RC 10428.* 1984. 019657 Micchelli, C.A. Smith, P.W. Ward, J.D.* Constrained L subscript P approximation.* IBM Watson Res. Center.*RC 10425.*1984. 019658 Crow, J.D.*Computer applications for fiber optics.* IBM Watson Res. Center.*RC 10423.*1984. 019659 Nunan, K.C.*Analysis of a porous cylindrical bearing.* IBM Watson Res. Center.*RC 10418.*1984. 019660 Damerau, F.J.*An interactive customization program for a natural language database query system.* IBM Watson Res. Center.*RC 10411.*1984. 019661 Weinberg, L. Ruehli, A.E.*Combined modified loop analysis, modified nodal analysis for large scale circuits.* IBM Watson Res. Center.*RC 10407.*1984. 019662 Nelson, R.* Stochastic catastrophe theory in computer performance modelling.* IBM Watson Res. Center.*RC 10406.* 1984. 019663 Dahmen, W. Micchelli, C.A.*On the solution of certain systems of partial difference equations and linear dependence of translates of box splines.* IBM Watson Res. Center.*RC 10395.*1984. 019664 Dahmen, W. Micchelli, C.A. Smith, P.W.*On factorization of biinfinite totally positive block Toeplitz matrices.* IBM Watson Res. Center.*RC 10394.*1984. 019665 Roth, J.P.* Embedding sans cyclic shorts.* IBM Watson Res. Center.*RC 10392.*1984. 019666 Weinberg, L. Ruehli, A.*An introduction to the principle partition and its applications.* IBM Watson Res. Center.* RC 10377.*1984. 019667 Dahmen, W. Micchelli, C.A.* Subdivision algorithms for the generation of box spline surfaces.* IBM Watson Res. Center.*RC 10372.*1984. 019668 Nadas, A.*Optimal solution of a training problem in speech recognition.* IBM Watson Res. Center.*RC 10373.*1984. 019669 Sauer, C.H. MacNair, E.A.*The evolution of the Research Queueing Package.* IBM Watson Res. Center.*RC 10376.* 1984. 019670 Tolimieri, R. Winograd, S.*Computing the ambiguity surface.* IBM Watson Res. Center.*RC 10390.*1984. 019671 Vardi, M.Y. Wolper, P.* Automata theoretic techniques for modal logics of programs.* IBM Watson Res. Center.*RJ 4232.*1984. 019672 Kirkpatrick, D.G. Klawe, M. Pippinger, N.*Some graph coloring theorems with applications to generalized connection networks.* IBM Watson Res. Center.*RJ 4222.* 1984. 019673 Van Vliet, J.C. Gladney, H.M.*An evaluation of tagging.* IBM Watson Res. Center.*RJ 4220.*1984. 019674 Dolev, D. Halpern, J. Strong, H.R.*On the possibility and impossibility of achieving clock synchronization.* IBM Watson Res. Center.*RJ 4218.*1984. 019675 Reuter, A. Haerder, T.*Principles of transaction oriented database recovery.* IBM Watson Res. Center.*RJ 4214.* 1984. 019676 Fong, A.C.*An optimal component labeling algorithm with label merging.* IBM Watson Res. Center.*RJ 4201.*1984. 019677 Emerson, E.A. Halpern, J.Y.*" Sometimes" and " not never" revisited: on branching vs. linear time.* IBM Watson Res. Center.*RJ 4197.*1984. 019678 Rissanen, J.* Universal coding, information, prediction, and estimation.* IBM Watson Res. Center.*RJ 4198.*1984. 019679 Kuper, G.M. Vardi, M.Y.*A new approach to database logic.* IBM Watson Res. Center.*RJ 4202.*1984. 019680 Kuper, G.M. Ullman, J.D. Vardi, M.Y.*On the equivalence of logical databases.* IBM Watson Res. Center.*RJ 4203.* 1984. 019681 Engberson, A.P.J.*On the optimization of 2D signal processing systems.* IBM Watson Res. Center.*RZ 1289.* 1984. 019682 Tudruj, M. Gajda, R.*On the implementation of compound microconstruction sequencing functions in microprogrammed control units.* Polish Academy of Sciences. Inst of Comp.Sci.*ICS PAS rpt. no. 523.*1983. 019683 Tudruj, M. Gajda, R.* HLL control statement implementation through extensive modular microprogramming.* Polish Academy of Sciences. Inst of Comp.Sci.*ICS PAS rpt. no. 524.*1983. 019684 Subieta, K.* Semantics of query language for network databases.* Polish Academy of Sciences. Inst of Comp.Sci.* ICS PAS rpt. no. 526.*1983. 019685 Subieta, K.*A simple method of data correction.* Polish Academy of Sciences. Inst of Comp.Sci.*ICS PAS rpt. no. 527.*1983. 019686 Prazmowski, K. Rudnicki, P.* MIZAR MSE primer.* Polish Academy of Sciences. Inst of Comp.Sci.*ICS PAS rpt. no. 529.*1983. 019687 Rudnicki, P. Drabent, W.*Proving properties of Pascal programs in MIZAR 2.* Polish Academy of Sciences. Inst of Comp.Sci.*ICS PAS rpt. no. 530.*1983. 019688 Kulikowski, J.L.*On some formal properties of tripartite graphs.* Polish Academy of Sciences. Inst of Comp.Sci.* ICS PAS rpt. no. 531.*1983. 019689 Pawlak, A.* MODLAN: A hardware module description language.* Polish Academy of Sciences. Inst of Comp.Sci.*ICS PAS rpt. no. 532.*1983. 019690 Hendren, L.J.* ISON: an introductory subset of Nial.* Queen's U. Computing & Info.Sci.Dept.*Tech.rpt. 84-156.* 1984. 019691 Ryder, B.G. Paull, M.C.*A unified model of elimination algorithms.* Rutgers U. CS Dept *DCS-TR-140.*1984. 019692 Israeli, A. Perl, Y.*On scheduling the construction of a treelike communication network.* Rutgers U. CS Dept *DCS-TR-141.*1984. 019693 Imielinski, T. Rozenshtein, D.*Towards a flexible user interface to relational database systems: processing simple second order queries.* Rutgers U. CS Dept * DCS-TR-142.*1984. 019694 Vichnevetsky, R.* Propogation and reflection in discrete space discrete time structures.* Rutgers U. CS Dept *DCS-TR-143.*1984. 019695 Kastner, J.K.* Strategies for expert consultation in therapy planning.* Rutgers U. Comp.Sci.Res.Lab.* CBM-TR-136, Ph.D. Thesis. Kastner, J.K.*1983. 019696 Hawrusik, F.M.*An extension of the pebble game for LISP like programs.* Rutgers U. Comp.Sci.Res.Lab.*CTA-TR-006, Ph.D. Thesis. Hawrusik, F.M.*1983. 019697 Minsky, N.H.*Selective and locally controlled transport of privileges.* Rutgers U. Comp.Sci.Res.Lab.*LCSR-TR-017.* 1981, revised. 019698 Steinberg, L.I. Mitchell, T.M.*A knowledge based approach to VLSI CAD.* Rutgers U. Comp.Sci.Res.Lab.*LCSR-TR-047.* 1983. 019699 Sridharan, N.S. Bresina, J.L.*Exploration of problem reformulation and strategy acquisition - a proposal.* Rutgers U. Comp.Sci.Res.Lab.*LCSR-TR-053; Rutgers U. Comp.Sci.Res.Lab.*CBM-TR-137.*1984. 019700 Sridharan, N.S.*Evolving systems of knowledge.* Rutgers U. Comp.Sci.Res.Lab.*LRP-TR-016.*1984. 019701 Warren, D.S.*Using lambda calculus to represent meanings in logic grammars.* SUNY, Stony Brook. CS Dept * Tech.rpt. 83/044.*1983. 019702 Jones, M.A.* Activation based parsing.* SUNY, Stony Brook. CS Dept *Tech.rpt. 83/045.*1983. 019703 Gelernter, H.*Realization of a large expert problem solving system. SYNCHEM2: A case study.* SUNY, Stony Brook. CS Dept *Tech.rpt. 83/046.*1983. 019704 Dasgupta, P. Kedem, Z.M.*A non two phase locking protocol for concurrency control in general databases.* SUNY, Stony Brook. CS Dept *Tech.rpt. 83/047.*1983. 019705 Maier, D. Rozenshtein, D. Maier, J.*Representing roles in universal scheme interfaces.* SUNY, Stony Brook. CS Dept *Tech.rpt. 83/048.*1983. 019706 Bernstein, A.J.*A loosely coupled distributed system for reliably storing data.* SUNY, Stony Brook. CS Dept *Tech.rpt. 83/049.*1983. 019707 Ahamad, M. Bernstein, A.J.*An application of name based addressing to low level distributed algorithms.* SUNY, Stony Brook. CS Dept *Tech.rpt. 83/050.*1983. 019708 Warren, D.S.* Runtime environment for a PROLOG compiler.* SUNY, Stony Brook. CS Dept *Tech.rpt. 83/052.*1983. 019709 Warren, D.S.*Efficient PROLOG memory management for flexible control strategies.* SUNY, Stony Brook. CS Dept *Tech.rpt. 83/053.*1983. 019710 Warren, D.S. Ahamad, M. Debray, S.K. Kale, L.V.*Executing distributed PROLOG programs on a broadcast network.* SUNY, Stony Brook. CS Dept *Tech.rpt. 83/054.*1983. 019711 Curtis, R. Wittie, L.*Tools for debugging distributed real time systems.* SUNY, Stony Brook. CS Dept * Tech.rpt. 83/055.*1983. 019712 Curtis, R. Wittie, L.* Naming in distributed language systems.* SUNY, Stony Brook. CS Dept *Tech.rpt. 83/056.*1983. 019713 Frank, A.J. Wittie, L.D. Bernstein, A.J.* Group communications on netcomputers.* SUNY, Stony Brook. CS Dept *Tech.rpt. 83/057.*1983. 019714 Kedem, Z.M. Zorat, A.*On the computation of transitive functions in an unrestricted VLSI model.* SUNY, Stony Brook. CS Dept *Tech.rpt. 83/058.*1983. 019715 Siddappa, M. Zorat, A.*Designing a fault tolerant PLA for testability.* SUNY, Stony Brook. CS Dept *Tech.rpt. 83/059.*1983. 019716 Silberschatz, A. Kieburtz, R.B. Bernstein, A.*Extending concurrent Pascal to allow dynamic resource management.* SUNY, Stony Brook. CS Dept *Tech.rpt. 83/060.*1983. 019717 Gupta, V. Zorat, A.*On constructing a grid of processors for wafer scale integration.* SUNY, Stony Brook. CS Dept *Tech.rpt. 83/061.*1983. 019718 Choi, H.M. Wittie, L.D.*An implementation of a Pascal to Modula-2 translator.* SUNY, Stony Brook. CS Dept * Tech.rpt. 83/062.*1983. 019719 Bernstein, A.J.*The semantics of timeout.* SUNY, Stony Brook. CS Dept *Tech.rpt. 83/065.*1983. 019720 Wittie, L.D. Frank, A.J.*A portable Modula-2 operating system: SAM2S.* SUNY, Stony Brook. CS Dept * Tech.rpt. 84/068.*1984. 019721 Smith, D.R.* SUSB3 micron CMOS library.* SUNY, Stony Brook. CS Dept *Tech.rpt. 84/070.*1984. 019722 Smolka, S.A. Frank, A.J. Debray, S.K.*Testing protocol robustness the CCS way.* SUNY, Stony Brook. CS Dept *Tech.rpt. 84/071.*1984. 019723 Debray, S.K. Frank, A.J. Smolka, S.A.*On the existence and construction of robust communication protocols for unreliable channels.* SUNY, Stony Brook. CS Dept * Tech.rpt. 84/072.*1984. 019724 Warren, D.S.* Database updates in pure PROLOG.* SUNY, Stony Brook. CS Dept *Tech.rpt. 84/073.*1984. 019725 Hsiang, J. Srivas, M.*A PROLOG environment for developing and reasoning about data types.* SUNY, Stony Brook. CS Dept *Tech.rpt. 84/074.*1984. 019726 Hsiang, J. Srivas, M.*On proving first order inductive properties in Horn clauses.* SUNY, Stony Brook. CS Dept *Tech.rpt. 84/075.*1984. 019727 Potvin, J.Y.*Observations concerning a parametric problem in generalized linear fractional programming.* Montreal U. Dept. d'Info. et de Recherche Operationnelle.*Publ. 489.*1983. 019728 Potvin, J.Y.*Nouvelles approches de resolution en programmation lineaire fractionnaire generalisee.* Montreal U. Dept. d'Info. et de Recherche Operationnelle.* Publ. 480.*1983. 019729 Cerny, E. Bochmann, G.V. Maksud, M. Leveille, A. Serre, J.M. Sarikaya, B.*Experiments in testing communication protocol implementations.* Montreal U. Dept. d'Info. et de Recherche Operationnelle.*Publ. 492.*1983. 019730 Bochmann, G.V.* Formal description techniques for OSI: an example.* Montreal U. Dept. d'Info. et de Recherche Operationnelle.*Publ. 493.*1983. 019731 Bochmann, G.V.*Some comments on "transition-oriented" vs. "structured" specification of distributed algorithms and protocols.* Montreal U. Dept. d'Info. et de Recherche Operationnelle.*Publ. 495.*1984. 019732 Braga, L.P.V. Maculan, N.*Une methodologie pour la realisation de cartes geologiques.* Montreal U. Dept. d'Info. et de Recherche Operationnelle.*Publ. 496.*1984. 019733 Frasson, C.*Bases de donnees sur micro-ordinateurs.* Montreal U. Dept. d'Info. et de Recherche Operationnelle.* Publ. 498.*1984. 019734 Barchanski, J. Bochmann, G.V. Desjardins, P. Gecsei, J. Landry, J.L.* Access protocol to external videotex databases.* Montreal U. Dept. d'Info. et de Recherche Operationnelle.*Publ. 500.*1984. 019735 Magnenat-Thalmann, N. Fortin, M. Langlois, L. Thalmann, D.* MIRA-SHADING: a structured language for the synthesis and the animation of realistic languages.* Montreal U. Dept. d'Info. et de Recherche Operationnelle.*Publ. 503.*1984. 019736 Magnenat-Thalmann, N. Thalmann, D. Ratib, O. Righetti, A.* Modeled computer animation of the heart.* Montreal U. Dept. d'Info. et de Recherche Operationnelle.*Publ. 504.* 1984. 019737 Gecsei, J.* User interactive teletext.* Montreal U. Dept. d'Info. et de Recherche Operationnelle.*Publ. 506.*1984. 019738 Silva, E.S. Gerla, M.* Load balancing in distributed systems with multiple classes and site constraints.* California U., L.A. CS Dept *CSD-840033.*1984. 019739 Betser, J. Gerla, M. Popek, G.J.*A dual priority MVA model for a a large distributed system: LOCUS.* California U., L.A. CS Dept *CSD-840036.*1984. 019740 Rus, T. Herr, F.B.*An algebraic directed compiler generator.* Iowa U. CS Dept *Tech.rpt. 84-02.* 1984. 019741 Wagner, M.E.* Performance evaluation of abstract data type language implementations.* Iowa U. CS Dept * Tech.rpt. 84-03.*1984. 019742 Emerson, E.A. Sistla, A.P.*Deciding branching time logic.* Texas U. CS Dept *TR-83-12.*1984, revised. 019743 Emerson, E.A. Halpern, J.Y.*"Sometimes and "not never" revisited: on branching versus linear time.* Texas U. CS Dept *TR-84-01.*1984. 019744 Rich, E. Temin, A.*Representing programs for reasoning.* Texas U. CS Dept *TR-84-02.*1984. 019745 Rich, E.*The gradual encroachment of artificial intelligence.* Texas U. CS Dept *TR-84-05.*1984. 019746 Gouda, M.G. Chang, C.K.*Proving liveness for networks of communicating finite state machines.* Texas U. CS Dept *TR-84-04.*1984. 019747 Lengauer, C.*A short note on" predicative programming": global and local chaos.* Texas U. CS Dept * TR-84-06.*1984. 019748 Tseng, S.H.H.* Questioning English text with clausal logic case studies of three texts.* Texas U. CS Dept * TR-84-08.*1984. 019749 Rathi, B.D.*The design and performance analysis of a self managing secondary memory.* Texas U. CS Dept * TR-84-09, Ph.D. Thesis. Rathi, B.D.*1984. 019750 Gouda, M.G. Chow, C.H. Lam, S.S.* Livelock detection in networks of communicating finite state machines.* Texas U. CS Dept *TR-84-10.*1984. 019751 Rosier, L.E. Yen, H.C.* Boundedness, empty channel detection and synchronization for communicating finite automata.* Texas U. CS Dept *TR-84-13.*1984. VOL. 6, NO. 10 09/20/84 019752 Lamb, D.A.*Sharing intermediate representations: the interface description language.* Carnegie Mellon U. Comp.Sci.Dept.*CMU-CS-83-129, Ph.D. Thesis.*1983. 019753 Korf, R.E.* Learning to solve problems by searching for macro operators.* Carnegie Mellon U. Comp.Sci.Dept.* CMU-CS-83-138, Ph.D. Thesis.*1983. 019754 Winskel, G.* Synchronisation trees. Carnegie Mellon U. Comp.Sci.Dept.*CMU-CS-83-139.*1983. 019755 Walker, H.*A 4-kbit four-transistor dynamic ram.* Carnegie Mellon U. Comp.Sci.Dept.*CMU-CS-83-140.*1983. 019756 Laird, J. Newell, A.*A universal weak method.* Carnegie Mellon U. Comp.Sci.Dept.*CMU-CS-83-141.*1983. 019757 Scherlis, W.L. Scott, D.S.*First steps towards inferential programming.* Carnegie Mellon U. Comp.Sci.Dept.* CMU-CS-83-142.*1983. 019758 Carbonell, J.G. Boggs, W.M. Maudlin, M.L. Anick, P.G.* XCALIBUR project report 1: first steps towards and integrated natural language interface.* Carnegie Mellon U. Comp.Sci.Dept.*CMU-CS-83-143.*1983. 019759 Maudlin, M. Jacobson, G. Appel, A Hamey, L.* ROG-O-MATIC: a belligerent expert system.* Carnegie Mellon U. Comp.Sci.Dept.*CMU-CS-83-144.*1983. 019760 Palay, A.J.* Searching with probabilities.* Carnegie Mellon U. Comp.Sci.Dept.*CMU-CS-83-145, Ph.D. Thesis. Palay, A.J.*1983. 019761 Sistla, A.P.*Theoretical issues in the design and verification of distributed systems.* Carnegie Mellon U. Comp.Sci.Dept.*CMU-CS-83-146, Ph.D. Thesis. Sistla, A.P.* 1983. Thesis submitted to Harvard University in partial fulfillment of the requirements for the degree of Doctor of Philosophy. 019762 Sherman, M.S.* Paragon: a language using type heirarchies for the specification, implementation, and selection of abstract data types.* Carnegie Mellon U. Comp.Sci.Dept.* CMU-CS-83-147, Ph.D. Thesis. Sherman, M.S.*1983. 019763 Rosenbloom, P.S.*The Chunking of goal hierarchies: a model of practice and stimulus response compatability.* Carnegie Mellon U. Comp.Sci.Dept.*CMU-CS-83-148, Ph.D. Thesis. Rosenbloom, P.S.*1983. 019764 Brookes, S.D.*A model for communicating sequential processes.* Carnegie Mellon U. Comp.Sci.Dept.* CMU-CS-83ā†149, Ph.D. Thesis. Brookes, S.D..*1983. Thesis submitted for degree of Doctor of Philosophy, University College, Oxford University, January 1983. 019765 Rosenburg, J.*Generating compact code for generic subprograms.* Carnegie Mellon U. Comp.Sci.Dept.* CMU-CS-83-150, Ph.D. Thesis. Rosenberg, J.*1983. 019766 Kung, H.T. Lin, W.T.*An algebra for VLSI algorithm design.* Carnegie Mellon U. Comp.Sci.Dept.*CMU-CS-83-100.*1983. 019767 Annaratone, M.*Let's design CMOS circuits! part one.* Carnegie Mellon U. Comp.Sci.Dept.*CMU-CS-84-101.*1984. 019768 Herman, M. Kanade, T.*The 3D MOSAIC scene understanding system: incremental reconstruction of 3D scenes from complex images.* Carnegie Mellon U. Comp.Sci.Dept.* CMU-CS-84-102.*1984. 019769 Notkin, D.* Interactive structure oriented computing.* Carnegie Mellon U. Comp.Sci.Dept.*CMU-CS-84-103, Ph.D. Thesis. Notkin, D.*1984. 019770 Rudolph, L.*A robust sorting network.* Carnegie Mellon U. Comp.Sci.Dept.*CMU-CS-84-104.*1984. 019771 Zong, Y.X.*Implementation of dynamic process communication on Intel432.* Carnegie Mellon U. Comp.Sci.Dept.* CMU-CS-84-105.*1984. 019772 Carbonell, J.G. Hayes, P.J.* Recovery strategies for parsing extragrammatical language.* Carnegie Mellon U. Comp.Sci.Dept.*CMU-CS-84-107.*1984. 019773 Langley, P. Coarbonell, J.G.*Approaches to machine learning.* Carnegie Mellon U. Comp.Sci.Dept.* CMU-CS-84-108.*1984. 019774 Clarke, E.M.*The characterization problem for Hoare logics. Carnegie Mellon U. Comp.Sci.Dept.*CMU-CS-84-109.*1984. 019775 Hayes, P.J.* Executable interface definitions using form based interface abstractions.* Carnegie Mellon U. Comp.Sci.Dept.*CMU-CS-84-110.*1984. 019776 Kannan, R. Lenstra, A.K. Lovasz, L.* Polynomial factorization and nonrandomness of bits of algebraic and some transcendental numbers.* Carnegie Mellon U. Comp.Sci.Dept.*CMU-CS-84-111.*1984. 019777 Bachem, A. Kannan, R.* Lattices and the basis reduction algorithm.* Carnegie Mellon U. Comp.Sci.Dept.* CMU-CS-84-112.*1984. 019778 McCracken, D.L. Akscyn, R.M.*Experience with the ZOG human computer interface system.* Carnegie Mellon U. Comp.Sci.Dept.*CMU-CS-84-113.*1984. 019779 Bloch, J.J. Daniels, D.S. Spector, A.Z.* Weighted voting for directories: a comprehencive study.* Carnegie Mellon U. Comp.Sci.Dept.*CMU-CS-84-114.*1984. 019780 Gupta, A.*Implementing OPS5 producition systems on DADO.* Carnegie Mellon U. Comp.Sci.Dept.*CMU-CS-84-115.*1984. 019781 Doyle, J.* Expert systems without computers or theory and trust in artificial intelligence.* Carnegie Mellon U. Comp.Sci.Dept.*CMU-CS-84-116.*1984. 019782 McKeown, D.M. Dellinger, J.L.* Map guided feature extraction from aerial imagery.* Carnegie Mellon U. Comp.Sci.Dept.*CMU-CS-84-117.*1984. 019783 Hinton, G.F. Sejnowski, T.J. Ackley, D.H.* Boltzmann machines: constraint satisfaction networks that learn.* Carnegie Mellon U. Comp.Sci.Dept.*CMU-CS-84-119.*1984. 019784 Donner, M.D.* Control of walking local control and real time systems.* Carnegie Mellon U. Comp.Sci.Dept.* CMU-CS-84-121, Ph.D. Thesis. Donner, M.D.*1984. 019785 Gumpertz, R.H.* Error detection with memory tags.* Carnegie Mellon U. Comp.Sci.Dept.*CMU-CS-84-122, Ph.D. Thesis. Gumpertz, R.H.*1984. 019786 Siewiorek, D.P.*A summary of fault tolerant computing research.* Carnegie Mellon U. Comp.Sci.Dept.* CMU-CS-84-123.*1984. 019787 Coutaz, J.*A paradigm for user interface architecture.* Carnegie Mellon U. Comp.Sci.Dept.*CMU-CS-84-124.*1984. 019788 Sindhu, P.S.*Distribution and reliability in a multiprocessor operating system.* Carnegie Mellon U. Comp.Sci.Dept.*CMU-CS-84-125, Ph.D. Thesis. Sindhu, P.S.* 1984. 019789 Mulmuley, K.* Lattice based algorithms.* Carnegie Mellon U. Comp.Sci.Dept.*CMU-CS-84-126.*1984. 019790 Akscyn, R.M. McCracken, D.L.*The ZOG approach to database management.* Carnegie Mellon U. Comp.Sci.Dept.* CMU-CS-84-128.*1984. 019791 Laird, J.E.* Universal subgoaling.* Carnegie Mellon U. Comp.Sci.Dept.*CMU-CS-84-129, Ph.D. Thesis. Laird, J.E.* 1984. 019792 Clune, E. Segall, Z. Siewiorek, D.*Validation of fault free behavior of a reliable multiprocessor system FTMP: A case study.* Carnegie Mellon U. Comp.Sci.Dept.*CMU-CS-84-130.* 1984. 019793 McCarty, D.C.* Realizability and recursive mathematics.* Carnegie Mellon U. Comp.Sci.Dept.*CMU-CS-84-131, Ph.D. Thesis. McCarty, D.C.*1984. 019794 Forgy, C.L.*The OPS83 Report.* Carnegie Mellon U. Comp.Sci.Dept.*CMU-CS-84-133.*1984. 019795 Mulmuley, K.*A semantic characterization of full abstraction. 019796 Touretzky, D.S.*The mathematics of inheritance systems.* Carnegie Mellon U. Comp.Sci.Dept.*CMU-CS-84-135, Ph.D. Thesis. Touretzky, D.S.*1984. 019797 Langley, P. Simon, H.A. Bradshaw, G.L.* Heuristics for empirical discovery.* Carnegie Mellon U. Robotics Inst.* CMU-RI-TR-84-14.*1984. 019798 Foster, N.J. Sanderson, A.C.*Determining object orientation from a single image using multiple information sources.* Carnegie Mellon U. Robotics Inst.*CMU-RI-TR-84-15.*1984. 019799 Weiss, L.E.* Dynamic visual servo control of robots: an adaptive image based approach.* Carnegie Mellon U. Robotics Inst.*CMU-RI-TR-84-16, Ph.D. Thesis. Weiss, L.E.* 1984. 019800 Vepsalainen, A.P.J.* State dependent priority rules for scheduling.* Carnegie Mellon U. Robotics Inst.* CMU-RI-TR-84-19.*1984. 019801 Germani, A. Piccioni, M.*A Galerkin approximation for the Zakai equation.* Consiglio Nazionale delle Ricerche. Instituto di Analiso dei Sistemi ed Informatica.*R. 68.* 1983. 019802 Bertolazzi, P. Sudborough, I.H.*The grid embedding problem is NP-complete even for edge length 2.* Consiglio Nazionale delle Ricerche. Instituto di Analiso dei Sistemi ed Informatica.*R. 69.*1983. 019803 Bertolazzi, P. De Stefanis, D. Terranova, M.*On optimal file allcation in database machines.* Consiglio Nazionale delle Ricerche. Instituto di Analiso dei Sistemi ed Informatica.*R. 70.*1983. 019804 Germani, A. Piccioni, M.* Nonlinear filtering for Markov processes: an L superscript 2 approach.* Consiglio Nazionale delle Ricerche. Instituto di Analiso dei Sistemi ed Informatica.*R. 71.*1983. 019805 Bielli, M. Calicchio, G. Cini, M. Magliozzi, L. Oddone, M.* Network models in planning the new generation of submarine communication systems.* Consiglio Nazionale delle Ricerche. Instituto di Analiso dei Sistemi ed Informatica.*R. 72.*1983. 019806 Gandolfi, A. Gerardi, A. Marchetti, F.* Association rates of diffusion controlled reactions in two dimensions.* Consiglio Nazionale delle Ricerche. Instituto di Analiso dei Sistemi ed Informatica.*R. 73.*1983. 019807 Di Pillo, G. Grippo, L.*A class of continuously differentiable exact penalty function algorithms for nonlinear programming problems.* Consiglio Nazionale delle Ricerche. Instituto di Analiso dei Sistemi ed Informatica.*R. 74.*1983. 019808 Bertolazzi, P. Missikoff, M. Terranova, M.* CID: A VLSI device for lists intersection.* Consiglio Nazionale delle Ricerche. Instituto di Analiso dei Sistemi ed Informatica.*R. 75.*1983. 019809 Bovet, D.P. Gambosi, G. Menasche, D.A.*Detection and removal of deadlocks in store and forward communication networks.* Consiglio Nazionale delle Ricerche. Instituto di Analiso dei Sistemi ed Informatica.*R. 76.*1983. 019810 Atzeni, P. Morfuni, N.M.* Functional dependencies and existence constraints in database relations with null values.* Consiglio Nazionale delle Ricerche. Instituto di Analiso dei Sistemi ed Informatica.*R. 77.*1983. 019811 D'atri, A. Moscarini, M.*Recognition and design of acyclic databases.* Consiglio Nazionale delle Ricerche. Instituto di Analiso dei Sistemi ed Informatica.*R. 78.* 1983. 019812 Salza, S. Bonelli, G.* Directory management of a distributed file system: a performance analysis.* Consiglio Nazionale delle Ricerche. Instituto di Analiso dei Sistemi ed Informatica.*R. 79.*1983. 019813 Bertolazzi, P. Bongiovanni, G.*A VLSI structure for the deadlock avoidance problem.* Consiglio Nazionale delle Ricerche. Instituto di Analiso dei Sistemi ed Informatica.*R. 80.*1983. 019814 Protasi, M. Talamo, M.*A new probabilistic model for the study of algorithmic properties of random graph problems.* Consiglio Nazionale delle Ricerche. Instituto di Analiso dei Sistemi ed Informatica.*R. 81.*1983. 019815 Pettorossi, A.* Towers of Hanoi problems: deriving the iterative solutions using the program transformation technique.* Consiglio Nazionale delle Ricerche. Instituto di Analiso dei Sistemi ed Informatica.*R. 82.* 1984. 019816 Pettorossi, A.*A note on Cohen's paper: eliminating redundant recursive calls.* Consiglio Nazionale delle Ricerche. Instituto di Analiso dei Sistemi ed Informatica.*R. 83.*1984. 019817 Monaco, S. Normand-cyrot, D.* Input output approximation of a nonlinear discrete time system from an equilibrium point.* Consiglio Nazionale delle Ricerche. Instituto di Analiso dei Sistemi ed Informatica.*R. 84.*1984. 019818 Padberg, M. Sassano, A.* Matching with bonds: 1.* Consiglio Nazionale delle Ricerche. Instituto di Analiso dei Sistemi ed Informatica.*R. 85.*1984. 019819 Stelovsky, J.* XS-2: The user interface of an interactive system.* Eidenoessische Technische Hochschule Zurich. Institut fuer Informatik.*Diss. ETH no. 7425, Ph.D. Thesis. Stelovsky, J.*1984. A dissertation submitted to the Swiss Federal Institute of Technology Zurich for the degree of Doctor of Technical Sciences. 019820 Peter, P.*Contribution de la classification automatique pour l'organisation et l'interrogation d'un corpus de "petit annonces".* INRIA.*Rapport de Recherche 276.*1984. 019821 Chu, W.Z.*A microcomputer implementation of an interactive functional programming system.* INRIA.*Rapport de Recherche 277.*1984. 019822 Ecault, C.*Une approache a la validation des protocoles d'enchere par la methode des tests de specification.* INRIA.*Rapport de Recherche 279.*1984. 019823 Bekkers, Y. Canet, B. Ridoux, O.` Ungaro, L.*Presentation simplifiee d'une machine de gestion de memoire pour les interpreteurs PROLOG.* INRIA.*Rapport de Recherche 280.* 1984. 019824 Flajolet, P. Odlyzko, A.M.* Limit distributions for coefficients of iterates of polynomials with applications to combinatorial enumerations.* INRIA.*Rapport de Recherche 282.*1984. 019825 Bekkers, Y. Canet, B. Ridoux, O. Ungaro, L.*Specification d'une machine de gestion memoire pour les interpretuers des langages logiques.* INRIA.*Rapport de Recherche 283.* 1984. 041731 Richards, W.* Structure from stereo and motion.* M.I.T. A.I. Lab.*Memo 731.*1983. 041732 Hoffman, D.D. Richards, W.* Parts of recognition.* M.I.T. A.I. Lab.*Memo 732.*1984. 041746 Horn, B.K.P. Ikeuchi, K.*Picking parts out of a bin.* M.I.T. A.I. Lab.*Memo 746.*1983. 041747 Mansour, H.*A structural approach to analogy.* M.I.T. A.I. Lab.*Memo 747.*1983. 041755 Hofstadter, D.R.*The copycat project: An experiment in nondeterminism and creative analogies.* M.I.T. A.I. Lab.* Memo 755.*1984. 041756 Brady, M.* Artificial intelligence and robotics.* M.I.T. A.I. Lab.*Memo 756.*1984. 041757 Brady, M. Asada, H.* Smoothed local symmetries and their implementation.* M.I.T. A.I. Lab.*Memo 757.*1984. 041758 Asada, H. Brady, M.*The curvature primal sketch.* M.I.T. A.I. Lab.*Memo 758.*1984. 041759 Lozano-Perez, T. Mason, M.T. Taylor, R.H.* Automatic synthesis of fine motion strategies for robots.* M.I.T. A.I. Lab.*Memo 759.*1983. 041760 Nguyen, V.D.*The find-path problem in the plane.* M.I.T. A.I. Lab.*Memo 760.*1984. 041761 Hildreth, E.C.*Computations underlying the measurement of visual motion.* M.I.T. A.I. Lab.*Memo 761.*1984. 041762 Grimson, W.E.L.*Computational experiments with a feature based stereo algorithm.* M.I.T. A.I. Lab.*Memo 762.*1983. 041780 Nishihara, H.K.* PRISM: A practical real-time imaging stereo matcher.* M.I.T. A.I. Lab.*Memo 780.*1984. 040704 Brotsky, D.C.*An algorithm for parsing flow graphs.* M.I.T. A.I. Lab.*AI-TR-704.*1984. 040749 Simmons, R.G.*Representing and reasoning about change in geologic interpretation.* M.I.T. A.I. Lab.*AI-TR-749.* 1983. 040754 Lathrop, R.H.* Parallelism in manipulator dynamics.* M.I.T. A.I. Lab.*AI-TR-754.*1984. 019827 Sharir, M. Ariel-Sheffi, E.*On the piano movers' problem. IV. various decomposable two-dimensional motion planning problems.* New York U. Inst. of Math. Sci. Comp.Sci.Dept.* Tech.rpt. 58; Robotics rpt. 6.*1983. 019828 Hopcroft, J.E. Schwartz, J.T. Sharir, M.*Efficient detection of intersections among spheres.* New York U. Inst. of Math. Sci. Comp.Sci.Dept.*Tech.rpt. 59; Robotics rpt. 7.*1983. 019829 Bleich, C. Overton, M.L.*A linear time algorithm for the weighted median problem.* New York U. Inst. of Math. Sci. Comp.Sci.Dept.*Tech.rpt. 75.*1983. 019830 Spirakis, P. Yap, C.*On the combinatorial complexity of motion coordination.* New York U. Inst. of Math. Sci. Comp.Sci.Dept.*Tech.rpt. 76; Robotics rpt. 12.*1983. 019831 Bernstein, H.J.*An accelerated bisection method for the calculation of eigenvalues of a symmetric tridiagonal matrix.* New York U. Inst. of Math. Sci. Comp.Sci.Dept.* Tech.rpt. 79.*1983. 019832 Vishkin, U.* Lucid-boxes vs. black-boxes.* New York U. Inst. of Math. Sci. Comp.Sci.Dept.*Tech.rpt. 81.*1983. 019833 Reif, J.H. Spirakis, P.*On the depth of a random graph.* New York U. Inst. of Math. Sci. Comp.Sci.Dept.*Tech.rpt. 82.*1983. 019834 Schwartz, J.T. Sharir, M.*On the piano movers' problem: V. the case of a rod moving in three dimensional space amidst polyhedral obstacles.* New York U. Inst. of Math. Sci. Comp.Sci.Dept.*Tech.rpt. 83.*1983. 019835 Cole, R. Yap, C.K.* Geometric retrieval problems.* New York U. Inst. of Math. Sci. Comp.Sci.Dept.*Tech.rpt. 87.*1983. 019836 Cole, R.* Searching and storing similar lists.* New York U. Inst. of Math. Sci. Comp.Sci.Dept.*Tech.rpt. 88.*1983. 019837 Reif, J. Spirakis, P.*Expected parallel time and sequential space complexity of graph and digraph problems.* New York U. Inst. of Math. Sci. Comp.Sci.Dept.*Tech.rpt. 91.*1983. 019838 Spirakis, P. Yap, C.K.*Strong NP hardness of moving many discs.* New York U. Inst. of Math. Sci. Comp.Sci.Dept.* Tech.rpt. 92; Robotics rpt. 20.*1983. 019839 Spirakis, P.G.*Moving many pebbles in a graph is polynomial time.* New York U. Inst. of Math. Sci. Comp.Sci.Dept.* Tech.rpt. 93; Robotics rpt. 21.*1983. 019840 Spirakis, P.* Buffered versus unbuffered tree networks for accessing a critical resource.* New York U. Inst. of Math. Sci. Comp.Sci.Dept.*Tech.rpt. 94.*1983. 019841 Trefethen, L.N.* Stability of hyperbolic finite difference models with one or two boundaries.* New York U. Inst. of Math. Sci. Comp.Sci.Dept.*Tech.rpt. 97.*1983. 019842 Spirakis, P.G.*Very fast algorithms for the area of the union of many circles.* New York U. Inst. of Math. Sci. Comp.Sci.Dept.*Tech.rpt. 98; Robotics rpt. 22.*1983. 019843 Weyuker, E.J.*Axiomatizing software test data adequacy.* New York U. Inst. of Math. Sci. Comp.Sci.Dept.*Tech.rpt. 99.*1984. 019844 Overton, M.L.*Numerical solution of a model problem from collapse load analysis.* New York U. Inst. of Math. Sci. Comp.Sci.Dept.*Tech.rpt. 100.*1984. 019845 Widlund, O.B.* Iterative methods for elliptic problems on regions partitioned into substructures and the biharmonic Dirichlet problem.* New York U. Inst. of Math. Sci. Comp.Sci.Dept.*Tech.rpt. 101.*1984. 019846 Spirakis, P. Reif, J.* Probabilistic techniques for two phase locking in database systems.* New York U. Inst. of Math. Sci. Comp.Sci.Dept.*Tech.rpt. 102.1983. 019847 Hopcroft, J.E. Schwartz, J.T. Sharir, M.*On the complexity of motion planning for multiple independent objects; pspace hardness of the " warehouseman's problem".* New York U. Inst. of Math. Sci. Comp.Sci.Dept.*Tech.rpt. 103; Robotics rpt. 14.*1984. 019848 Cole, R. Yap, C.K.* Shape form probing.* New York U. Inst. of Math. Sci. Comp.Sci.Dept.*Tech.rpt. 104; Robotics rpt. 15.*1983. 019849 Yap, C.K.*Coordinating the motion of several discs.* New York U. Inst. of Math. Sci. Comp.Sci.Dept.*Tech.rpt. 105; Robotics rpt. 16.*1984. 019850 Cole, R. Sharir, M. Yap, C.K.*On k-hulls and related problems.* New York U. Inst. of Math. Sci. Comp.Sci.Dept.*Tech.rpt. 108.; Robotics rpt. 17.*1984. 019851 Vishkin, U.*An efficient parallel strong orientation.* New York U. Inst. of Math. Sci. Comp.Sci.Dept.*Tech.rpt. 109; Ultracomputer note 67.*1984. 019852 Trefethen, L.N.* Square blocks, and equioscillation in the Pade, Walsh, and CF tables.* New York U. Inst. of Math. Sci. Comp.Sci.Dept.*Tech.rpt. 110.*1983. 019853 Hummel, R.A. Gidas, B.C.* Zero crossings and the heat equation.* New York U. Inst. of Math. Sci. Comp.Sci.Dept.* Tech.rpt. 111; Robotics rpt. 18.*1984. 019854 Trefethen, L.N.*Analysis and design of polygonal resistors by conformal mapping.* New York U. Inst. of Math. Sci. Comp.Sci.Dept.*Tech.rpt. 112.*1984. 019855 Spirakis, P.G.* Queuing delay modeling multistage interconnection multiprocessor networks.* New York U. Inst. of Math. Sci. Comp.Sci.Dept.*Tech.rpt. 114; Ultracomputer note 68.*1984. 019856 Hummel, R. Kimia, B.* Deblurring Gaussian blur.* New York U. Inst. of Math. Sci. Comp.Sci.Dept.*Tech.rpt. 115; Robotics rpt. 23.*1984. 019857 Trefethen, L.N.*On l superscript p and oscillation at discontinuities in finite difference schemes.* New York U. Inst. of Math. Sci. Comp.Sci.Dept.*Tech.rpt. 116.* 1984. 019858 Cole, R.*Slowing down sorting networks to obtain faster sorting algorithms.* New York U. Inst. of Math. Sci. Comp.Sci.Dept.*Tech.rpt. 117.*1984. 019859 Reif, J. Spirakis, P.* Probabilistic bidding gives optimal distributed resource allocation.* New York U. Inst. of Math. Sci. Comp.Sci.Dept.*Tech.rpt. 118; Robotics rpt. 24.*1983. 019860 Schwartz, J.T. Sharir, M.*Some remarks on robot vision.* New York U. Inst. of Math. Sci. Comp.Sci.Dept.*Tech.rpt. 119; Robotics rpt. 25.*1984. 019861 Bernstein, H.J. Lowney, P.G. Schwartz, J.T.* SERVOL: preliminary proposal for a programming language for real time servo control.* New York U. Inst. of Math. Sci. Comp.Sci.Dept.*Tech.rpt. 120; Robotics rpt. 26.*1984. 019862 Neale, P.T.* Elastic buffers for digital rings.* U.K. National Physical Lab. Info. Technology and Computing Div.*DITC 38/84.*1984. 019863 DeWitt, D.J. Katz, R.H. Olken, F. Shapiro, L.D. Stonebraker, M.R. Wood, D.* California U., Berkeley. Electronics Res.Lab.*Memo. no. UCB/ERL 84/5.*1984. 019864 Murphy, M.* Performance estimates for distributed query processing.* California U., Berkeley. Electronics Res.Lab.*Memo. no. UCB/ERL 84/30.*1984. 019865 Politof, T. Satyanarayana, A.*An O(/v/ squared) algorithm for a class of planar graphs to compute the probability that the graph is connected.* California U., Berkeley. O.R. Center.*ORC 84-4.*1984. 019866 Oliver, R.M.* Exponential smoothing--I.* California U., Berkeley. O.R. Center.*ORC 84-5.*1984. 019867 Gentner, D.R.* Expertise in typewriting.* California U., San Diego. Human Info.Proces. Center.*CHIP 121.*1984. 019868 Mozer, M.C.* Inductive information retrieval using parallel distributed computation.* California U., San Diego. Inst. for Cognitive Sci.*ICS rpt. 8406.*1984. 019869 Randell, B.* Fault tolerance & system structuring.* Newcastle upon Tyne U. Computing Lab.*No. 189.*1983. 019870 Peters, J.G.* Time accuracy trade-offs for hard maximization problems.* Toronto U. Comp.Sci.Dept.*Tech rpt. 169/83, Ph.D. Thesis. Peters, J.G.*1983. 019871 Mendell, M.P.*Structure of a portable operating system.* Toronto U. Comp. Systems Res. Group.*CSRG-152.*1983. 019872 Holt, R.C. Cordy, J.R.*The Turing language report.* Toronto U. Comp. Systems Res. Group.*CSRG-153.*1983. 019873 Gibbs, S.J.*An object oriented office data model.* Toronto U. Comp. Systems Res. Group.*CSRG-154, Ph.D. Thesis. Gibbs, S.J.*1984. 019874 Norsett, S.P. Thomsen, P.G.*Local error in SDIRK-methods.* Waterloo U. Comp.Sci.Dept.*Res.rpt. CS-84-10.*1984. 019875 Culik, K. II. Fris, I.*Topological transformations as a tool in the design of systolic networks.* Waterloo U. Comp.Sci.Dept.*Res.rpt. CS-84-11.*1984. 019876 Poole, D.L.*The logical definition of deduction systems.* Waterloo U. Comp.Sci.Dept.*Res.rpt. CS-84-12.*1984. 019877 van Emden, M.*Towards a western fifth generation computer system project.* Waterloo U. Comp.Sci.Dept.*Res.rpt. CS-84-14.*1984. 019878 Joe, B.* Delaunay triangular meshes in convex polygons.* Waterloo U. Comp.Sci.Dept.*Res.rpt. CS-84-15.*1984. 019879 Courier: The remote procedure call protocol.* Xerox.*XSIS 038112.*1981. 019880 Donahue, J. Demers, A.* Data types are values.* Xerox. Palo Alto Res. Center.*CSL-83-5.*1984. 019881 Swinehart, D.C. Stewart, L.C. Ornstein, S.M.*Adding voice to an office computer network.* Xerox. Palo Alto Res. Center.*CSL-83-8.*1984. 019882 Cartwright, R. Donahue, J.*The semantics of lazy (and industrious) evaluation.* Xerox. Palo Alto Res. Center.* CSL-83-9.*1984. VOL. 6, NO. 11 10/22/84 019883 Verwer, J.G. Dekker, K.*Step-by-step stability in the numerical solution of partial differential equations.* Mathematisch Centrum.*NW 161/83.*1983. 019884 Hemker, P.W.* Mixed defect correction iteration for the solution of a singular perturbation problem.* Mathematisch Centrum.*NW 162/83.*1983. 019885 Bergstra, J.A. Klop, J.W.* Verification of an alternating bit protocol by means of process algebra.* Mathematisch Centrum. Centrum voor Wiskunde en Informatica.*CS-R8404.* 1984. 019886 Bergstra. J.A. Klop, J.W.* Fair FIFO queues satisfy an algebraic criterion for protocol correctness.* Mathematisch Centrum. Centrum voor Wiskunde en Informatica.*CS-R8405.*1984. 019887 Vitanyi, P.M.B*One queue or two pushdown stores take square time on a one head tape unit.* Mathematisch Centrum. Centrum voor Wiskunde en Informatica.*CS-R8406.*1984. 019888 Baeten, J.C.M. Bergstra, J.A. Klop, J.W.* Mathematisch Centrum. Centrum voor Wiskunde en Informatica.*CS-R8407.* 1984. 019889 Van de Graaf, J.A.M.*Towards a specification of the B programming environment.* Mathematisch Centrum. Centrum voor Wiskunde en Informatica.*CS-R8408.*1984. 019890 Bergstra, J.A. Klop, J.W.* Process algebra for communication and mutual exclusion.* Mathematisch Centrum. Centrum voor Wiskunde en Informatica.*CS-R8409.* 1984. 019891 Hemker, P.W. De Zeeuw, P.M.*Some implementations of multigrid linear system solvers.* Mathematisch Centrum. Centrum voor Wiskunde en Informatica.*NM-R8401.*1984. 019892 Van der Houwen, P.J. Sommeijer, B.P. De Vries, H.B.* Generalized predictor corrector methods of high order for the time integration of parabolic differential equations.* Mathematisch Centrum. Centrum voor Wiskunde en Informatica.*NM-R8402.*1984. 019893 Sanz-Senrna, J.M. Verwer, J.G.*A study of the recursion y subscript (n + 1) = y subscript (n) + t((y subscript (n)) exp (m)).* Mathematisch Centrum. Centrum voor Wiskunde en Informatica.*NM-R8403.*1984. 019894 Verwer, J.G. Sanz-Serna, J.M.*Convergence of method of lines approximations to partial differential equations.* Mathematisch Centrum. Centrum voor Wiskunde en Informatica.*NM-R8404.*1984. 019895 Sanz-Serna, J.M. Verwer, J.G.* Conservative and nonconservative schemes for the solution of the nonlinear Schroedinger equation.* Mathematisch Centrum. Centrum voor Wiskunde en Informatica.*NM-R8405.*1984. 019896 Hendren, L.J.* RIPO - An automated prototyping tool based on nested arrays.* Queen's U. Computing & Info.Sci.Dept.* Tech.rpt. 84-155.*1984. 019897 Glasgow, J.I.* Logic programming in NIAL.* Queen's U. Computing & Info.Sci.Dept.*Tech.rpt. 84-158.*1984. 025000 Ullman, J.D.*Implementation of logical query languages for databases. Stanford U. Comp.Sci.Dept.*STAN-CS-84-1000.* 1984. 41p. 025001 Brinkley, J.F.* Ultrasonic three-dimensional organ modelling.* Stanford U. Comp.Sci.Dept.*STAN-CS-84-1001, Ph.D. Thesis. Brinkley, J.F.*1984. 141p. A dissertation submitted to the Committee on Graduate Studies of Stanford University in partial fulfillment of the requirements for the degree of Doctor of Philosophy in Medical Computer Engineering. 025004 Goldschlager, L.M.*A computational theory of higher brain function.* Stanford U. Comp.Sci.Dept.*STAN-CS-84-1004.* 1984. 29p. 025005 Manna, Z. Pnueli, A.*Adequate proof principles for invariance and liveliness properties of concurrent programs.* Stanford U. Comp.Sci.Dept.*STAN-CS-84-1005.* 1984. 35p. 025006 Ketonen, J. Weening, J.S.* EKL - An interactive proof checker user's reference manual.* Stanford U. Comp.Sci.Dept.*STAN-CS-84-1006.*1984. 55p. 025007 Gabriel, R.P. McCarthy, J.*Queue-based multi-processing LISP.* Stanford U. Comp.Sci.Dept.*STAN-CS-84-1007.*1984. 35p. 019898 Marsland, T.A.*A quantitative study of refinements to the alpha beta algorithm.* Alberta U. Computing Sci.Dept.* TR82-06.*1984. 019899 Chin, F. Wang, C.A.*Optimal algorithms for the intersection and the minimum distance problems between planar polygons.* Alberta U. Computing Sci.Dept.*TR82-08.*1982. 019900 Chin, F. Ramarao, K.V.S.*Optimal termination protocols for network partitioning.* Alberta U. Computing Sci.Dept.* TR82-9.*1982. 019901 Davis, W.A. Lee, D.L.*A very fast associative memory algorithm.* Alberta U. Computing Sci.Dept.*TR82-10.* 1982. 019902 Schubert, L.K. Papalaskaris, M.A. Taugher, J.*Special inference methods in a semantic net: lattices of types, parts, colours and times.* Alberta U. Computing Sci.Dept.* TR83-03.*1983. 019903 Marsland, T.A. Popowich, F.*A multiprocessor tree searching system design.* Alberta U. Computing Sci.Dept.*TR83-06.* 1983. 019904 Popowich, F. Marsland, T.A.* Parabelle: experience with a parallel chess program.* Alberta U. Computing Sci.Dept.* TR83-07.*1983. 019905 Jagannathan, D. Marsland, T.A.*An architecture model for distributed databases.* Alberta U. Computing Sci.Dept.* TR83-08.*1983. 019906 Cabay, S. Kao, T.T.C.*The diagonal Pade table and the triangular decomposition of Hankel matrices.* Alberta U. Computing Sci.Dept.*TR83-10.*1983. 019907 Ward, D. Wang, X. Davis, W.A.*A graphics package for constructing Chinese characters.* Alberta U. Computing Sci.Dept.*TR84-01.*1984. 019908 Cabay, S. Choi, D.K.* Algebraic computations of scaled Pade fractions.* Alberta U. Computing Sci.Dept.*TR84-02.* 1984. 019909 Ward, D.B. Heuft, R. Tartar, J.* AHF - A graphics language for VLSI design.* Alberta U. Computing Sci.Dept.*TR84-03.* 1984. 054166 Mayo, R.N.*Combining graphics and procedures in a VLSI layout tool: The Tpack system.* California U., Berkeley. Comp.Sci.Div.*UCB/CSD 84/166.*1984. 054167 Baden, S.B.*High performance storage reclamation in an object-based memory system.* California U., Berkeley. Comp.Sci.Div.*UCB/CSD 84/167.*1984. 054168 Luby, M.G.*Monte-Carlo methods for estimating system reliability.* California U., Berkeley. Comp.Sci.Div.* UCB/CSD 84/168, Ph.D. Thesis. Luby, M.G.*1984. 054169 De Smedt, P.*Discrete characterization of program referencing dynamics.* California U., Berkeley. Comp.Sci.Div.*UCB/CSD 84/169; California U., Berkeley. Comp.Sci.Div. PROGRES Group.*Rpt. 84.01.*1984. 054170 Harrison, M.A.*Theoretical issues concerning protection in operating systems.* California U., Berkeley. Comp.Sci.Div.*UCB/CSD 84/170.*1984. 054171 Goldberg, A.V.*Finding a maximum density subgraph.* California U., Berkeley. Comp.Sci.Div.*UCB/CSD 84/171.* 1984. 054172 Wensley, P.* Hidden feature elimination and visible polygon return in UNIGRAFIX 2.* California U., Berkeley. Comp.Sci.Div.*UCB/CSD 84/172.*1984. 054173 Sherburne, R.W. Jr.* Processor design tradeoffs in VLSI.* California U., Berkeley. Comp.Sci.Div.*UCB/CSD 84/173, Ph.D. Thesis. Sherburne, R.W. Jr.*1984. 054174 Riggle, D.W.*A name server database.* California U., Berkeley. Comp.Sci.Div.*UCB/CSD 84/174; California U., Berkeley. Comp.Sci.Div. PROGRES Group.*Rpt. 84.02.*1984. 054175 Hill, M.D. Smith, A.J.*Experimental evaluation of on-chip microprocessor cache memories.* California U., Berkeley. Comp.Sci.Div.*UCB/CSD 84/175; California U., Berkeley. Comp.Sci.Div. PROGRES Group.*Rpt. 84.03.*1984. 054176 Painter, M.*The design and implementation of a "domain names" resolver.* California U., Berkeley. Comp.Sci.Div.* UCB/CSD 84/176; California U., Berkeley. Comp.Sci.Div. PROGRES Group.*Rpt. 84.04.*1984. 054177 Zhou, S.*The design and implementation of the Berkeley Internet Name Domain ( BIND) servers.* California U., Berkeley. Comp.Sci.Div.*UCB/CSD 84/177; California U., Berkeley. Comp.Sci.Div. PROGRES Group.*Rpt. 84.05.*1984. 054178 Cohen, S.*Multi-version structures in PROLOG.* California U., Berkeley. Comp.Sci.Div.*UCB/CSD 84/178.*1984. 054179 Cohen, S.*The APPLOG language: PROLOG vs. LISP - if you can't fight them join them.* California U., Berkeley. Comp.Sci.Div.*UCB/CSD 84/179.*1984. 054180 Hac, A.*A decomposition solution to a queueing network model of a distributed file system with dynamic locking.* California U., Berkeley. Comp.Sci.Div.*UCB/CSD 84/180; California U., Berkeley. Comp.Sci.Div. PROGRES Group.* Rpt. 84.06.*1984. 054181 Wallace, D.*A comparison of tile-based wire representations for interactive IC layout tools.* California U., Berkeley. Comp.Sci.Div.*UCB/CSD 84/181.*1984. 054182 Terry, D.B. Painter, M. Riggle, D.W. Zhou, S.*The Berkeley internet name domain server.* California U., Berkeley. Comp.Sci.Div.*UCB/CSD 84/182; California U., Berkeley. Comp.Sci.Div. PROGRES Group.*Rpt. 84.07.*1984. 054183 Lee, T.P.*Configuring local network-based distributed systems.* California U., Berkeley. Comp.Sci.Div.*UCB/CSD 84/183; California U., Berkeley. Comp.Sci.Div. PROGRES Group.*Rpt. 84.08, Ph.D. Thesis. Lee, T.-Y.P.*1984. 054184 Henry, R.R.*Graham-Glanville code generators.* California U., Berkeley. Comp.Sci.Div.*UCB/CSD 84/184, Ph.D. Thesis. Henry, R.R.*1984. 054185 Ramamoorthy, C.V. Nishiguchi, O. Tsai, W.-T.* Simulation of hierarchical routing algorithms.* California U., Berkeley. Comp.Sci.Div.*UCB/CSD 84/185.*1984. 054186 Bach, E.* Discrete logarithms and factoring.* California U., Berkeley. Comp.Sci.Div.*UCB/CSD 84/186.*1984. 054187 Bach, E.*Matching modulo divisors, and a simple N superscript 1/4 factoring algorithm.* California U., Berkeley. Comp.Sci.Div.*UCB/CSD 84/187.*1984. 054190 Berger, R. Karloff, H.J. Shmoys, D.B.*The cryptographic security of the sum of bits.* California U., Berkeley. Comp.Sci.Div.*UCB/CSD 84/190.*1984. 054191 Sechrest, S.*Tutorial examples of interprocess communication in Berkeley UNIX 4.2 BSD.* California U., Berkeley. Comp.Sci.Div.*UCB/CSD 84/191; California U., Berkeley. Comp.Sci.Div. PROGRES Group.*Rpt. 84.09.*1984. 054192 Foster, G.* User interface considerations for algebraic manipulation systems.* California U., Berkeley. Comp.Sci.Div.*UCB/CSD 84/192.*1984. 054193 Foster, G.* Dreams: Display representation for algebraic manipulation systems.* California U., Berkeley. Comp.Sci.Div.*UCB/CSD 84/193.*1984. 019910 Nau, D.S.* Expert computer systems: a tutorial.* Maryland U. Comp.Sci. Center.*TR-1201.*1982. 019911 Chu, Y. Abrams, M.* Columbia Ada: A concurrent Ada computer system organization.* Maryland U. Comp.Sci. Center.* TR-1203.*1982. 019912 David, N.A. Stewart, G.W.* Significance testing in a functional model.* Maryland U. Comp.Sci. Center.*TR-1204.* 1982. 019913 Cao, D.*The intensional database in the ZMOB parallel problem solving system.* Maryland U. Comp.Sci. Center.* TR-1205.*1982. 019914 Stewart, G.W.*A note on complex division.* Maryland U. Comp.Sci. Center.*TR-1206.*1982. 019915 Samet, H.* Hierarchical data structures for representing geographical information.* Maryland U. Comp.Sci. Center.* TR-1208.*1982. 019916 Samet, H.* Data structures for quadtree approximation and compression.* Maryland U. Comp.Sci. Center.*TR-1209.* 1982. 019917 Reed, G.M. Rosenfeld, A.*Recognition of surfaces in three dimensional digital images.* Maryland U. Comp.Sci. Center.*TR-1210.*1982. 019918 Stewart, G.W. Stewart, W.J.*An iterative method for the solution of nearly decomposable Markov chains.* Maryland U. Comp.Sci. Center.*TR-1213.*1982. 019919 Reed, G.M.*On the characterization of simple closed surfaces in three dimensional digital images.* Maryland U. Comp.Sci. Center.*TR-1214.*1982. 019920 Chu, Y. Abrams, M.* Kernel processor of Columbia Ada concurrent architecture.* Maryland U. Comp.Sci. Center.* TR-1215.*1982. 019921 Kim, C.E.*Digital disks.* Maryland U. Comp.Sci. Center.* TR-1216.*1982. 019922 Rosenfeld, A.*Some notes on digital triangles.* Maryland U. Comp.Sci. Center.*TR-1217.*1982. 019923 Rosenfeld, A.*A note on "geometric transforms" of digital sets.* Maryland U. Comp.Sci. Center.*TR-1218.*1982. 019924 Wood, R.J.* Computer aided program synthesis.* Maryland U. Comp.Sci. Center.*TR-1219, Ph.D. Thesis. Wood, R.J.*1982. 019925 Hsu, Y.-C.*A brush pen Chinese character output system.* Maryland U. Comp.Sci. Center.*TR-1220.*1982. 019926 Phillips, T.-Y. Davis, L.S. Rosenfeld, A.*Automatic segmentation of electron micrographs of berea sandstone cross-sections.* Maryland U. Comp.Sci. Center.*TR-1221.* 1982. 019927 Samet, H.*Reconstruction of quadtrees from quadtree medical axis transforms.* Maryland U. Comp.Sci. Center.*TR-1224.* 1982. 019928 Rosenfeld, A.* Image processing in remote sensing data analysis: the state of the art.* Maryland U. Comp.Sci. Center.*TR-1225.*1982. 019929 Agrawala, A.K. Lakshman, T.V. Ramakrishnan, K.K. Singhal, M. Tripathi, S.K.* Interconnection architecture.* Maryland U. Comp.Sci. Center.*TR-1227.*1982. 019930 Krishnamurthy, E.V.*Error-free parallel high-order convergent iterative matrix inversion based on p-adic approximation.* Maryland U. Comp.Sci. Center.*TR-1229.* 1982. 019931 Rosenfeld, A.* Diameter time cellular warping.* Maryland U. Comp.Sci. Center.*TR-1230.*1982. 019932 Krishnamurthy, E.V.*High-order tensor product approximation for 2D and 3D image blocks with application to multi resolution image representation.* Maryland U. Comp.Sci. Center.*TR-1231.*1982. 019933 Samet, H.* Quadtree related research.* Maryland U. Comp.Sci. Center.*TR-1233.*1982. 019934 O'Leary, D.P.*Solving sparse matrix problems on parallel computers.* Maryland U. Comp.Sci. Center.*TR-1234.*1982. 019935 Samet, H.*A top-down quadtree traversal algorithm.* Maryland U. Comp.Sci. Center.*TR-1237.*1982. 019936 Hamlet, R. Mills, H.* Functional semantics.* Maryland U. Comp.Sci. Center.*TR-1238.*1983. 019937 Rosenfeld, A.* Picture processing: 1982.* Maryland U. Comp.Sci. Center.*TR-1239.*1983. 019938 Beck, J. Prazdny, K.*The perception of transparency with achromatic colors.* Maryland U. Comp.Sci. Center.* TR-1240.*1983. 019939 Stewart, G.W.*A second order perturbation expansion for small singular values.* Maryland U. Comp.Sci. Center.* TR-1241.*1983. 019940 Kasif, S. Kohli, M. Minker, J.* PRISM: A parallel inference system for problem solving.* Maryland U. Comp.Sci. Center.*TR-1243.*1983. 019941 Shneiderman, B.* Human factors of interactive software.* Maryland U. Comp.Sci. Center.*TR-1244.*1983. 019942 Shneiderman, B.* Direct manipulation: a step beyond programming languages.* Maryland U. Comp.Sci. Center.* TR-1245.*1983. 019943 Brodd, S.S.* Automason: A robot construction planning scheme.* Maryland U. Comp.Sci. Center.*TR-1247.*1983. 019944 Kasif, S. Kitchen, L. Rosenfeld, A.*A Hough transform technique for subgraph isomorphism.* Maryland U. Comp.Sci. Center.*TR-1248.*1983. 019945 Minker, J.*On theories of definite and indefinite databases.* Maryland U. Comp.Sci. Center.*TR-1250.*1983. 019946 Agrawala, A.K. Woo, N.S.*Properties and an operation rule for the stream generating CONS function in the data driven computation.* Maryland U. Comp.Sci. Center.* TR-1251.*1983. 019947 Agrawala, A.K. Woo, N.S.*The generic data/control flow schema and the DC1 flow schema with the data/control-driven evaluation.* Maryland U. Comp.Sci. Center.*TR-1252.*1983. 019948 Chu, Y. Abrams, M.* Instruction set processor of Columbia Ada concurrent architecture.* Maryland U. Comp.Sci. Center.*TR-1253.*1983. 019949 Kasif, S. Rosenfeld, A.*The fixed points of images and scenes.* Maryland U. Comp.Sci. Center.*TR-1254.*1983. 019950 Klette, R.*The m-dimensional grid point space.* Maryland U. Comp.Sci. Center.*TR-1256.*1983. 019951 Klette, R.*Analysis of data flow for SIMD systems.* Maryland U. Comp.Sci. Center.*TR-1257.*1983. 019952 Klette, R.*On the approximation of convex hulls of finite grid point sets.* Maryland U. Comp.Sci. Center.*TR-1258.* 1983. 019953 Matsuyama, T. Hao, L.V. Nagao, M.*A file organization for geographic information systems based on spatial proximity.* Maryland U. Comp.Sci. Center.*TR-1260.*1983. 019954 Matsuyama, T. Phillips, T.Y.*Extracting the medial axis from the Voronoi diagram of boundary segments: an alternative method for closed boundary detection.* Maryland U. Comp.Sci. Center.*TR-1261.*1983. 019955 Stewart, G.W.*A nonlinear version of Gauss's minimum variance theorem with applications to an errors-in-the-variables model.* Maryland U. Comp.Sci. Center.*TR-1263.*1983. 019956 Roussopoulos, N.* Intensional semantics of a self documenting relational model.* Maryland U. Comp.Sci. Center.*TR-1264.*1983. 019957 Mark, L. Roussopoulos, N.*Integration of data, schema and meta-schema in the context of self-documenting data models.* Maryland U. Comp.Sci. Center.*TR-1265.*1983. 019958 Coolahan, J.E. Roussopoulos, N.* Timing requirements for time driven systems using augmented Petri nets.* Maryland U. Comp.Sci. Center.*TR-1266.*1983. 019959 Kasif, S.*A note on translating flowchart and recursive schemas to PROLOG schemas.* Maryland U. Comp.Sci. Center.* TR-1273.*1983. 019960 Xiem H.-C. Wohn, K. Davis, L.S. Rosenfeld, A.* Optical flow field smoothing by local use of global information.* Maryland U. Comp.Sci. Center.*TR-1274.*1983. 019961 Representation and processing of spatial knowledge.* Maryland U. Comp.Sci. Center.*TR-1275.*1983. This is the "proceedings" of an informal workshop on representing and processing spatial knowledge; it includes seven complimentary papers. 019962 Lee, C.-H. Rosenfeld, A.*Improved methods of estimating shape from shading using the light source coordinate system.* Maryland U. Comp.Sci. Center.*TR-1277.*1983. 019963 Phillips, T. Matsuyama, T.*The labeled discrete Voronoi diagram.* Maryland U. Comp.Sci. Center.*TR-1278.*1983. 019964 Dunn, S. Harwood, D. Davis, L.S.* Local estimation of the uniform error threshold.* Maryland U. Comp.Sci. Center.* TR-1279.*1983. 019965 Rosenfeld, A.*Why computers can't see (yet).* Maryland U. Comp.Sci. Center.*TR-1280.*1983. 019966 Klette, R.* M-dimensional cellular spaces.* Maryland U. Comp.Sci. Center.*TR-1281.*1983. 019967 Hao, K.*An axiomatic proof system for communicating sequential processes.* Maryland U. Comp.Sci. Center.* TR-1282.*1983. 019968 Wallace, R.S.* PiL ( Prolog in Lisp) introduction, implementation, documentation.* Maryland U. Comp.Sci. Center.*TR-1284.*1983. 019969 Eastman, R.D.* Reliability in cellular arrays through data sharing.* Maryland U. Comp.Sci. Center.*TR-1285.*1983. 019970 Rosenfeld, A. Haber, S.*The perimeter of a fuzzy set.* Maryland U. Comp.Sci. Center.*TR-1286.*1983. 019971 Samet, H.*Using quadtrees to represent spatial data.* Maryland U. Comp.Sci. Center.*TR-1287.*1983. 019972 Protsko, L.B. Sorenson, P.G. Tremblay, J.-P.*A system for the automatic generation of data flow diagrams.* Saskatchewan U. Computational Sci.Dept.*Rpt. 84-08.*1984. 019973 Kalita, J.K.*Generating summary responses to natural langauge database queries.* Saskatchewan U. Computational Sci.Dept.*Rpt. 84-09.*1984. 019974 Dandamudi, S.P. Sorenson, P.G.*Performance of a modified k-d tree.* Saskatchewan U. Computational Sci.Dept.*Rpt. 84-10.*1984. 019975 Dandamudi, S.P. Sorenson, P.G.*Algorithms for the BD tree structure.* Saskatchewan U. Computational Sci.Dept.*Rpt. 84-11.*1984. 019976 Dandamudi, S.P. Bunt, R.B.*Refined models of program behaviour for improved memory management.* Saskatchewan U. Computational Sci.Dept.*Rpt. 84-12.*1984. 019977 Dandamudi, S.P. Sorenson, P.G.*An empirical performance comparison of some variations of the k-d tree and BD tree.* Saskatchewan U. Computational Sci.Dept.*Rpt. 84-13.*1984. 019978 Feather, M.S.* Specification and transformation: automated implementation.* Southern California U. Info.Sci.Inst.* ISI/RR-83-124.*1984. 019979 Feather, M.S.* Reuse in the context of a transformation based methodology.* Southern California U. Info.Sci.Inst.*ISI/RR-83-125.*1984. 019980 Kaczmarek, T. Mark, W. Sondheimer, N.*The Consul/ Cue interface: An integrated interactive environment.* Southern California U. Info.Sci.Inst.*ISI/RR-83-126.* 1984. 019981 Bates, R.L. Dyer, D. Koomen, J.A.G.M.*Implementation of Interlisp on the VAX.* Southern California U. Info.Sci.Inst.*ISI/RR-83-129.*1984. 019982 The MOSIS system.* Southern California U. Info.Sci.Inst.* ISI/RR-83-128.*1984. 019983 Batory, D.S.*Modeling the storage architectures of commercial database systems.* Texas U. Comp.Sci.Dept.* TR-83-21.*1984. 019984 Batory, D.S.*Progress toward automating the development of database system software.* Texas U. Comp.Sci.Dept.* TR-84-03.*1984. 019985 Batory, D.S. Buchmann, A.P.* Molecular objects, abstract data types, and data models: a framework.* Texas U. Comp.Sci.Dept.*TR-84-07.*1984. 019986 Boyer, R.S. Moore, J.S.* Proof checking, theorem proving, and program verification.* Texas U. Computing Sci.Inst.* TR-035.*1983. 019988 Russinoff, D.M.*An experiment with the Boyer Moore program verification system: a proof of Wilson's theorem.* Texas U. Computing Sci.Inst.*TR-038.*1983. 019989 Akers, R.L.*A gypsy to Ada program compiler.* Texas U. Computing Sci.Inst.*TR-039.*1983. 019990 McHugh, J.*Towards the generation of efficient code from verified programs.* Texas U. Computing Sci.Inst.*TR-040, Ph.D. Thesis. McHugh, J.*1984. 019991 Good, D.I.*Mechanical proofs about computer programs.* Texas U. Computing Sci.Inst.*TR-041.*1984. 019992 Siebert, A.E. Good, D.I.*General message flow modulator.* Texas U. Computing Sci.Inst.*TR-042.*1984. 019987 Boyer, R.S. Moore, J.S.*A mechanical proof of the Turing completeness of Pure LISP.* Texas U. Computing Sci. and Comp.Appl.Inst. Certifiable Minicomputer Project.* ICSCA-CMP-37.*1983. 019993 Scott, M.L. Finkel, R.A.*A simple mechanism for type security across compilation units.* Wisconsin U. Comp.Sci.Dept.*Tech.Rpt. 541.*1984. 019994 Mangasarian, O.L.*Some applications of penalty functions in mathematical programming.* Wisconsin U. Comp.Sci.Dept.* Tech.Rpt. 544.*1984. 019995 Kamowitz, D. Parter, S.V.*A study of some multi grid ideas.* Wisconsin U. Comp.Sci.Dept.*Tech.Rpt. 545.*1984. 019996 Bent, S.W. Manber, U.*On non intersecting Eulerian circuits.* Wisconsin U. Comp.Sci.Dept.*Tech.Rpt. 546.* 1984. 019997 Johnson, G.F.*An approach to incremental semantics.* Wisconsin U. Comp.Sci.Dept.*Tech.Rpt. 547, Ph.D. Thesis. Johnson, G.F.*1984. 019998 Parter, S.V.* Iterative methods for elliptic problems and the discovery of "q".* Wisconsin U. Comp.Sci.Dept.* Tech.Rpt. 548.*1984. 019999 Smith, J.E. Goodman, J.R.* Instruction cache replacement policies and organizations.* Wisconsin U. Comp.Sci.Dept.* Tech.Rpt. 549.*1984. References 1. https://www.saildart.org/OLDTRS[LIB,DOC]19_blob