An annoted bibliography on computational probability · 2017-02-11 · An annoted bibliography on...

An annoted bibliography on computational probability PART 1 BIBLIOGRAPHY 006

M. F. Neuts (*)

ABSTRACT

This is the first part of a bibliography on computational probability. It lists over five hundred references to published papers, technical reports and theses, which deal with algorithmic solutions to probability problems or which contain useful information on the computational aspects of such probhms.

1. INTRODUCTION

Since 1950 there has been an impressive development of the theory of stochastic models for such phenomenon as waiting lines, epidemics, dams, computer systems, inventories and the reliability of composite systems. The most accessible information about such models is given by simple explicit formulas and tractable qualitative features such as growth rates and relaxa- tion time parameters. As the models grow increasingly complex and more detailed information about them becomes desirable, the available explicit results tend to be inadequate or intractable. There is also an undue emphasis on analytic results, even ff these involve integral transforms which may not be readily invertible or otherwise il.l. uminating. This emphasis may be large- ly a holdover from the pre-computer era, when large scale numerical computations involved a prohibitive amount of human effort. In recent years the computer has enabled the applied probabilist to obtain far more refined information on complex models and also to develop models for substantially more involved phenomena than was previously possible. In disciplines such as statistics or mathematical programming, there is already a well- established tradition of algorithmic solution, but in stochastic modelling the investigation of exact computational methods is of much more recent date. The availability of computer simulation has made it a panacea used by the practitioner, who often feels that the only alternative offered by the theoretician is an involved and unilluminating treatment in terms of multiple integral transforms or difficult singular integral equations. What ought to be a solution method of last resort, is often applied to models, whose algorithmic solution can easily be caned out at a small fraction of the cost and with far greater precision. As any computationally experienced mathematician knows, it is hazardous to attempt any non-trivial computation without a detailed analysis of the structure

of the problem. In fact the development of a good algorithm is as challenging as the analytic investigation, and it uses substantially the same mathematical ideas and techniques. Even in papers which include some numerical results, there is still a wide-spread practice to omit all discussion of the algorithm or to limit it to

• a few terse comments. The practitioner who wishes to extend the range of the numerical results or to solve a related problem, is then required to start the work anew. Much useful algorithmic information remains buried in unpublished theses or technical reports and already there is also much duplication of effort in the existing papers on computational probability. The latter observation prompted the author to compile a bibliography on computational probability to make it available to interested research workers in this field and also to serve as an aid to his own efforts in this area. A large number of probabilists were contacted by letter or by the kind assistance of several journals and an unaided one-man examination of several periodicals over the recent volumes was carried out. The response was encouraging and several individuals, who will be acknowledged below, sent much information on work other than their own. In order to keep the size of the bibliography manageable, it was planned to issue Part I when five hundred references had been accumulated. This goal was attained late in 1975 and by including a few latecomers, the present number was reached. It is the author's intention to make this a continuing project. Authors are solicited to supply reprints or preprints of articles to be listed in a second part of the bibliography, which will be issued as soon as a sufficient number of additional references become available. Only titles which come under the general heading of computational probability will be inchded and the Final decision on whether the material is germane will be made by the compiler. Corrections and updated information on unpublished material in Part I will also be given in the subsequent issues.

i*) M. F. Neuts, Department of Statistics and Computer Science, University of Delaware, Newark DE 19711, USA

Journal of Computational and Applied Mathematics, volume 3, no 1, 1977. 53

Correspondence on this bibliography should be ad- dressed to the author.

2. SCOPE OF THE BIBLIOGRAPHY

It has been the intention to make the scope of the bibliography as wide as possible and to include as much germane and informative matezial as possible. There are some areas which are already so extensively developed that a systematic search for all references would have been prohibitive. These include the very extensive literature on computational methods in statistics and the vast area of random number generation. Generally adequate and extensive bibliographies on these are available. The compiler has therefore included only those papers in these areas which were directly brought to his attention by the authors or others, or which appeared to have a wider algorithmic interest and were of a recent date. Some rehted bibliographies to be consulted are listed in the next section.

3. RELATED BIBLIOGRAPHIES

The following is a brief and by no means exhaustive list of recent bibliographies, containing references which may be useful in probabilistic modelling or in its algorithmic aspects.

ANDERSON, T. W., DAS GUPTA, S. and STYAN, G. P. H. : "A bibliography of multivariate statistical analysis", John Wiley and Sons, New York, 1972, 642 PC.

TEUGEI~S, J.L. "Bibliography on Semi-Markov processes" J. of Comp. and Appl. Math., Vol. 2 (1976), no. 2, p. 125- 144.

NANCE, R. E. and OVERSTREET, C. Jr. : "A bibliography on random number generation", Computing Reviews, October 1975, p. 495-508.

PIESSENS, K. : "A bibliography on the numerical inversion of the Laplace Transform", J. of Comp. and Appl. Math., Vol. 1 (1975), no. 2, p. 115-128 and Vol. 2 (1976), no. 3, p. 225-228.

SAATY, T . L . : "Seven more years of queues - A lament and a bibliography', Naval Research Logistics Quarterly, 13, p. 447-476, 1966.

STANCU-MINASIAN, I. M. : "A selected bibliography of works related to stochastia programming", Academy of Economic S~adies, Bucharest, Komania, Sept. 1974.

WOLD, H. : "Bibliography on time series and stochastic process", M.I.T. Press, Cambridge MA, 1965, 516 pp.

4. ACKNOWLEDGEMENTS

The following persons contributed references to papers by other authors : J. Beckman, R. Butterworth, J. Buzen, E. L. Crow, W. D'Avanzo, P. Erdi, W. K. Grassmann, H. O. Harthy, J. Liittschwager, P. Schweitzer, M. Starr, C. A. Steeh Jr., J. T6th, S. Zacks.

The Editors of the following Journals have kindly printed announcements of this bibliographic project : SIAM News, MS/OR Today, Journal of Applied Probability and Bulhtin of the I.M.S.

To all these individuals the author expresses deep appreciation for their cooperation. The research was sponsored by the Air Force office of Scientific Research, Air Force Systems Command, USAF, under Grant no. AFOSR-72-2350B.


ALPHABETIC AUTHOR INDEX.

18 A. ABAKUKS AN OPYlMAL ISOLATION POLICY FOR AN EP|OEMIC JOURN. APPLIEO PROBAE~ ~Yt lo t 247-264, 1973

SOME COMPUTATIONAL RESULTS ON THE POLICIES OBTAINED

2e A. ABAKUKS A NOTE ON SUPERGRITICAL CARRIER-BORNE EPIDEMICS 6IOMETRIKAt 61, 271-275, 1974

38 A. ABAKUKS oPTIMAL IMMUNISATION POLICIES FOR EPIDEMICS ADVANCES IN APPLIED PROBABILITY, 6, ~9~-511t 1974

SOME COMMENTS ON AND RESULTS OF COMPUTATIONS

6* L. ADANOPOULOS SOME COUNTING AND INTERVAL PROPERTIES OF THE

MUTUALLY-EXCITING PROCESSES JOURN. APPLIED PROBABIL ITVt 12, TB-Ebt 1975

EXTENSIVE NUMERICAL EXAMPLE RELATED TO EARTHQUAKE DATA

68 h AOIRI, N. HQFRI AND N, YADIN A MULTIPROGRAHIIING QUEUE JOURN. OF THE AoC.Mt 20, 589-603t 1973

NUMERICAL SOLUTION OF THE STEADY STATE OF A SIMPLE COMPUTER MODEL

$8 S,-R. ADKE THE MAXIMUM POPULATION SIZE IN THE FIRST

GENERATIONS OF A BRANCHING PROCESS B~METRICS, 2Or 649-651t 1966

7e K, K. AGGARMALt J, So GUPTA AND Ko B. NISRA A MEN METHOD FOR SYSTEM RELIABILITY EVALUATION MICROELECTRONICS AND RELIAB|L~Y, 12t 43S-440, 1973

SEE ALSO UNDER K. B. MISRA

60 J, H. AHRENS AND U. DIETER COMPUTER METHODS FOR SAMPLING FROM THE EXPONENTIAL

AND NORHAL OISTRIBUTIONS COHNUNICATIONS OF THE AeCeN, 15, 813-B821 1972

A SURVEY OF METHODS FOR GENERATING EXPONENTIAL AND NORMAL RANDOM VARIABLES

98 d. J, AHRENS AND U, DIETER EXTENSIONS OF FORSYI"HE|S METHOD FOR RANDOM SAMPLING

FROM THE NORMAL DISTRIBUTION MATHEMATICS OF COMPUTATION, 27e 927-937, 1973

REFINEMENTS OF FORSYTHE'S GENERALIZATION OF VON NEUHANN ° S METHOD FOR GENERATING EXPONENT IAL VARIATES

138 J. H* AHRENS AND Uo DIETER COMPUTER METHODS FOR SAMPLING FROM GAMMA, BETA,

POISSON AND BINOMIAL DISTRIBUTIONS COMPUT ~G, 12, 223-246, 1974

11" B. ALLEN, R. S, ANDERSSEN AND E. SENETA NUMERICAL INVESTIGATION OF INFINITE STOCHASTIC MATRICES

TECM, REPT. NOD 48t COMPUTER CENTRE, AUSTRAL|AN NATIONAL UNIVERSITY, CANBERRAt AUSTRALIAt 60 PP

EXTENSIVE DISCUSSION OF THE VARIOUS NUMERICAL METHODS FOR THE COMPUTATION OF TME STATIONARY MEASURE OF AN INFINITE STOCHASTIC HATRIXe COMPARISONS OF THE COMPUTATIONAL COMPLEXITY AND THE ACCURACY OF THE VARIOUS METHODS

12e R. ALTER AND B. P, LZENTZ APPLICATIONS OF A GENERALIZED COMBINATORIAL PROBLEM OF SMIRNOV

NAVAL RESEARCH LOGISTES QUARTERLYtI6tS63-567, 1969 CONSIDERS THE NUMBER OF STRINGS MITHOUT MATCHING

NEIGHBORS AMONG THE STRINGS COMPOSED OF ITEMS OF M KINDS OF SYMBOLS

138 Re So ANDERSSEM AND E, SENETA ON SMOOTHING TECHNIQUES FOR THE REMOVAL OF PERIODIC

NOISE OF KNONN PERIOD MATHEMAT~AL GEOLOGY, 3~ 15T-ITO, 1971

14. R. S. ANDERSSEN, F. Re DE HOOGt ANO Re NEISS ON THE NUMERICAL SOLUTION OF BROMN|AN HOTION

PRSCESSES JOURN. APPLIED PRSBABILITY, 10, 609"618t 19T3

NUMERICAL SOLUTION OF THE INTEGRAL EQUATIONS ARISING IN BOUNDARY GROSSING PROBLEMS

15~ R. S, ANDERSSEN AND A. J . JAKEMAN COMPUTATIONAL METHODS FOR THE SOLUTION OF ABEL'S

INTEGRAL EQUATION OF STEREOLOGY TE~M, RIPe ANU-CC-T3 PREPR ~T RSA NO. 3p COMPUTER

CENTRE. AUSTRALIAN NATIONAL UNIVERSITY. CANBERRA. AUSTRALIA, 19T3~ 51PP

SEE ALSO UNDER A.J. JAKEMAN

L6* R. S. ANDERSSEN AND A, J . JAKENAN ON COMPUTATIONAL STEREOLOGY 6-TH AUTRALIAN NATIONAL COMPUTER CONFERENCE1 SYDNEY : lgT41 PROCEED(NOSe VQL 2t 353")62t 1974

t [ T t g. S. ANOERSSEN AND P. BLOOMFIELD NUMERICAL DIFFERENTIATION PROCEDURES FOR NON-EXACT DATA

NUNER ISCHE ~THEMATIKv 22e IB7-182t 1974 DETAILED PAPER ON TIME SERIES METHODS IN NUMERICAL DIFFERENTIATION. EXTENSIVE BIBLIOGRAPHY

18" R. $. ANDERSSEN AND P, BLQOHFIELD A TIME SERIES APPROACH TO NUHERICAL DIFFERENTIATION TECHNOMETRICS, 16t 69-75t 1976

NUMERICAL DIFFERENTIATION OF FUNCTIONS MHOSE EVALUATION IS SUBJECT TO RANDOM ERRORS

19e R. S. ANDERSSEN9 P, BLOOMFIELD AND 0. R, MCNEIL SPLINE FUNCTIONS IN DATA ANALYSIS TECH, RIPe NO, bgt SERIES 2, DEPT. OF STATISTICS,

PRINCETON UNIV, PRINCETON NJt 1974 SMOOTH APPROXIMATION BY SPLINE FUNCTIONS. APL

PROGRAMS LISTED AS HELL AS EXAMPLES

2 ~ S. ASH~JR AND Re De JHA NUMERICAL TRANSIENT-STATE SOLUTIONS OF QUEUEING

SYSTEMS SIMULATION, 21~117-122, 1973

MARKOVIAN QUEUES BY RUNGE-KUTTA AND HAMMING METHODS

21" T. P, BAGCHI CONTRIBUTIONS TO THE THEORY OF BULK QUEUES PHeD, THESIS, DEPT, OF INDUS, ENG, UNIV, OF TORONTO, TORONTO ON, CANADA, 172 PPt 1972

SEE CONMENTS UNDER T.P, EAGCHI AND J,G.C. TEMPLETONt 1972

22* T. P. 6AGCH; AND J, G, Co TENPLETON NUMERICAL METHODS IN MARKOV CHAINS AND BULK QUEUES

(BOOK) LECTURE NOTES IN ECONOMICS AND MATHEHATICAL

SYSTEMS, NO. 72, SPRINGER VERLAG9 BgPPt 1972 DISCUSSES A NUMBER OF ALGQRITItNS FOR THE

TRANSIENT AND STATIONARY BEHAVIOR OF QUEUES. EXTENSIVE BIBLIOGRAPHY, SEVERAL COMPUTER PROGRAMS LISTED

238 A. D. BARBOUR THE PRINCIPLE OF YHE DIFFUSION OF ARBITRAY

CONSTANTS JDURN, APPLIED PROBABILITY, 91 519-541, 19?2

GENERAL TECHNIQUE OF APPROXIMATE SOLUTION OF MULTIVARIATE NARKOV LATTICE PROCESSES

268 D. R. BARR AND N. L, SLEZAK A COMPARISON OF MULTIVARIATE NORMAL GENERATORS COMMUNICATIONS OF THE AcCeNt 1Be 1043-1069~ 19T2

DISCUSSES THREE METHODS FOR GENERATING OBSERVATIONS FROM A NULT|VARIATE NORMAL DISTRIBUTION

2S* N. A. 6ARRICELLI NUMERICAL TESTED OF ~VQLUTION THEORIES JOURN. STATISTICAL COMPUTATION AND SIMULATION, 1, 97-127, 1972

DETAILED DISCUSSION OF COMPUTER TESTING OF A H mE VARIETY OF EVOLUTIONARY PROCESSES

268 D, E, BARTON AND F. N, DAVID MULTIPLE RUNS B~METRIKAt 44, 168-178w 195T

DISTRIBUTION OF THE NUMBER OF RUNS IN STRINGS OF ITEMS OF K DIFFERENT KINDS

278 N. BE[KER VACCINATION PROGRAMMES FOR RARE INFECTIOUS DISEASES BIOMETR|KA, 59t 443-453, 1972

A MODEL FOR BALANCING THE RISK OF VACCINATION AGAINST THAT OF CONTRACT)NO THE DISEASE, EXTENSIVE COMMENTS ON NUMERICAL MORK

268 J, EEEKMAN TNO STO:HASTIC PROCESSES (BOOK) ALMQVIST AND WIKSELL INTERNATIOHAL, STOCKHOLMt SHEDEN, 1974,

ALSO JOHN NILEY, MEN YORKo MANY APPROXINAT|ONS AND COMMENTS ON NUMERICAL

MORK RELATED TO BRQNNIAN NOTION, THE ORNSTEIN-UHLENBECK PROCESS ANO MODELS ARISING IN INSURANCE PROELEMS

298 J, BEEKMAN ASYMPTOTIC DISTRIBUTIONS FOR THE ORNSTEIN-UHLENBECK

PROCESS JOURN. APPLIED PROBABILITY, 12t l O T - l i A r 1975

SEVERAL COMPUTATIONS RELATED TO FIRST PASSAGE TIMES


33* B, BELKIN FIRST PASSAGE TO A GENERAL THRESHOLD FOR A PROCESS

CORRESPONDING TO SAMPLING AT PO|SSON TIMES JOURN, APPLIED PROBABILITY, B! $73-$88t 1971

THE GENERAL THRESHOLD IS APPROXIMATED BY A STEP FUNCT ION

315 C. Eo BELL CHARACTERIZATION AND COMPUTATION OF OPTIMAL

POL ~ IES FOR OPERATING AN MIG/I QUEUING SYSTEM NITH REHOVABLE SERVER

OPERATIONS RESEARCH~ 19t 208-218, 1971 STUDIES AN M/G/1 QUEUE IN NHICH THE SERVER MAY BE

TURNED ON AT ANY ARRIVAL EPOCH OR SHUT OFF AFTER ANY SERVICE COMPLETION. ALGORITFB4 FOR THE OPTIMAL POLICY 1S DISCUSSED

32e E. BErG ON A COMPUTER-ORIENTED APPROACH TO ACTUARIAL CALCULATIONS

SKANDIHAVISK AKTUARIETIDSKR|FTt E31 20-281 1970 SOME EXAMPLES OF ACTUARIAL COMPUTATIONS

33~ G, BERGER INTEGRATION OF THE NORMAL PONER APPROXIMATION ASTIN BULLETIN, T~ 90-9S, 1972

RELATED TO THE NP METHOD SEE ALSO UNDER PESONEN

3 ~ G, D. BERGLAND THE FAST ~OURIER TRANSFORM RECURSIVE EQUATIONS FOR

ARBITRARY LENGTH RECORDS MATHEMATICS OF COMPUTATION, 21, 23b-238~ 1967

D LSCUSS]ON OF THE FAST FOURIER TRANSFORM FOR SEQUENCES OF ARBITRARY LENGTH

35~ G. D. BERGLAND A FAST FOURIER TRANSFORM ALGORITHNFOR REAL-VALUED

SERIES COMMUNICATIONS OF THE AeC,M~ 1 | . 703-7101 1968

DISCUSSION OF AN IMPROVED VERSION OF THE FAST FOURIER TRANSFORM FOR REAL-VALUED SEQUENCES

36m J, BERNERT ANNENDUNG DER THEORIE OER MARKOFFSCHEN KITTEN ZUR

MODELLIERUNG E~NES PUFFERLAGERGESTEUERTEN FERTIGUNGSPROZESSES

FERTIGUNGSTECHNIK UND BETRIEBI 26t 664-46Tt 1976 ELEMENTARY ANALYSIS BY NARKOV CHAINS OF AN

ASSEMBLY L~NE NITH A BUFFER. DISCUSSION OF COMPUTATIONS

37~ U. N. DHAT AND 1. SAHIN TRANSIENT BEHAVIOR OF THE DUEUEING SYSTENS N/D/11

M/EK/ l tD /H/1 , AND EK/M/I - GRAPHS AND TABLES TECHNICAL MEMORANDUM NO 1351DEPT~ OF O o R . - CASE

NESTERN RESERVE UNIVERSITY, CLEVELAND OH~ 1969 NUMERICAL INVEST IGAT ION OF THE EMBEDDED NARKOV

CHAINS FOR THE QUEUEING MODELS MENTIONED IN THE TITLE

38~ J. ~. BHAT AND S. N. RAJU A STATE SPACE TRUNCATION PROCEDURE FOR QUEUEING

SYSTEMS TEGH. REPT. CP 750051 GS-OR DEFT1 SOUTHERN

METHODIST UNIV, DALLAS TX, 1975. 24 PP

39~ U. N. BHAT AND Re E* NANCE AN EVALUATION OF CPU EFFICIENCY,UNDER DYNAMIC QUANTUM ALLOCATION

TECH. REPT. CSTSO~9-R. CeS, DEPT. V ZRGINZA POLYTECHNIC INSTITUTE, BLACKSBURG VAe 19751 23 PP

CONNENTS QN THE COMPUTATIONAL ASPECTS OF THE QUEUEING MODEL INVOLVED.

SEE ALSO UNDER MANGE AND BHAT.

63* C, G* BHATTACHARYA A SIMPLE METHOD OF RESOLUTION OF A DISTRIBUTION

INTO GAUSSIAN CONPONENTS (FRENCH SUMMARY| EIOMETR|CS9 23. 115-135~ 1967

ON FITTING MIXTURES OF NORMAL DISTRIBUTIONS. FOR ANOTHER METHOD SEE UNDER J. GREGOR

61" E. BIGLIERI RECUR~IVE METHOD FOR COMPUTING THE COEFFICIENTS OF THE GRAN-CHARLZER SERIES

PROCEEDINGS IEEEI 61, 251-2S2~ 1973

62~ Vo F. BILJUBA AND V. P. SAVELEV AN INVESTIGATION OF THE OPTIMAL SCHEDULING IN A GERTA~i QUEUE i NO PROBLEM NITH PRIORITIES

RADIOPHYS. AND QUANTUM ELECTRONICS,IS,BIT-BEE1 1976 ENGLISH TRANSLATION OF A RUSSIAN PAPER, AN

ALGORITHM FOR OPTIMAL SCHEOULING IN PRIORITY QUEUES

63* Z. ~. BIRNBAUN AND H. J . FRIEDMAN NUMERICAL TABULATION FOR A STATISTIC SIMILAR TO

STUDENT*S T (SUMMARIES IN GERMAN. ENGLISH. FRENCH A~D RUSSIANI

STATISTISCHE HEFTE, le t 163'-L56, lq76 A STATISTIC BASED ON DEVIATIONS FROM THE MEDIAN.

TABLES FOR THE CASE OF NORMALLY DISTRIBUTED 3BSERVAT IONS

Journal of ComputationM ~nd Applied Mathematics, volume 3, no 1, 1977.

~618 J. BISHIR MAXIMdN POPULATIOq SIZE IN A BRANCHING PROCESS BIOMETRICS, 18. 396-603, 1962

COMMENTS ON THE COMPUTATION DF THE DISTRIBUTION OF THE MAXIMUM POPULATION SIZE BEFORE EXTINCTION

651 M. BJORKLUND AND A. ELLDIN A PRACTICAL METHOD OF CALCULATION FOR CERTAIN TYPES

OF COMPLEX COMMON CONTROL NETWORKS ERICSSON TECHNICS, 2Or 3-TS~ 1966

66 ' J. R. BLACK AND J. C. EVEN COMPUTER SOLUTION OF QUEUEING MODELS SIMULATION, I l l 1~$-116t 1973

ADVOCATES THE USE DE-ANALOG COMP-U.TEIL~D~3JdE STUDY OF THE TRANSIENT BEHAVIOR OF QUEUES

67* H. BDNMAN APPROXIMATE FOURIER ANALYSIS OF DISTRIBUTION

FUNCTIONS ARKIV FOR MATHEMATIK~ 6t 99-157t 1960

A DETAILED ANALYSIS OF APPROXIMATE INVERSION FORMULAS HITH NUMERICAL EXAMPLES

6B* H. BONMAN TO COMPUTE THE DISTRIBUTION Ft)NGTION MHEN THE

CHARACTERXSTIC FUNCTION IS KNQHN SKAHDINAV|SK AKTUARIET|OSKRIFTt 66t 61-4P61 1963

MULTIPLICATION BY A SUITABLE FUNCTION TO OBTAIN A BOUNDED DOMAIN OF INTEGRATION

69* H, BONMAN HHAT 1S THE REASON THAT ESSCHEReS METHOD OF

APPROXIMATION IS AS GOOD AS IT IS SKAND~AVISK AKTUAR ~TIDSKRIFTe 46t BT-96t 1963

DISCUSSION OF A PAPER BY F. ESSCHERI SAME JOURNAL1 &bt T8-86. 1963

5~* He BOHMAN AND F* ESSCHER STUDIES IN RISK THEORY NITH NUMERICAL ILLUSTRATIONS

CONCERNING DISTRIBUTION FUNCTIONS AND STOP LOSS PREMIUMS - PART I

SKAND ~AVISK AKTUAR IET]OSKRIFTt 669 IT3-.22Et 1g63 VARIUUS COMPUTATIONS OF DISTRIBUTIONS IN RISK THEORY

51 ' Hi BOHNAN AND F. ESSCHER STUDIES IN RISK THEORY HZTH NUMERICAL ILLUSTRATIONS CONCERNING DISTRIBUTION FUNCTIONS AND STOP LOSS PREMIUMS - PART | i

SKANOINAVISK AKTUARIETIDSKRIFT, 67, 1-601 1966 TABLES OF RESULTS

52S N. RDNNAN THE NUMERICAL INTEGRATION OF THE FOURIER I~VERS|ON

FORMULA FOR DISTRIBUTION FUNCTIONS SKANDINAVISK AKTUARIETIDSKRIFTISUPPLI~SZ~SZ-62tlg69

AN IMPORTANT NUMERICAL INVERSION PROCEDURE BASED ON A FORMULA OF POISSON FOR TRIGONOMETR ~ SERIES

53" N, BONMAN A NETHOD TO CALCULATE THE DISTRIBUTION FUNCTION

NHEN THE CHARACTERISTIC FUNCTION ~ KNONN BITI l o t 237-262, 1970

S~* H, BDHMAN ON THE RAXINUN DEVIATION IN RANDOM MALKS BlT~ 11t 133-L3Bw 1971

NUMERICAL COMPUTATION OF THE DISTRIBUTION OF THE MAXIMUM OF THE FIRST N PARTIAL SUNS. USES THE FAST FOURIER TRANSFORM

5S~ H, BO'tMAN RUIM PR3BABILITIES SKANDINAVISK AKTUARIETIDSKRIFTt $6~ ISq--163. 19T1

METHOD BASEO ON THE FAST FOURIER TRANSFORM. PROGRAMS LISTED

5 6 ~ N. BDtMAN FROM THE CHARACTER IST~ FUNCTION TO DISTRIBUTION

FUNCTION VIA FOURIER ANALYSIS BIT, 12, 2?9-Z83~ 19?2

57* N. EOHNAN FURRIER INVERSIO~ - DISTRIBUTION FUNCTIONS - LONG

TAILS SCANDINAVIAN ACTUARIAL JOURNt 6~F"BSt 1976

APPROX INATE INVERSION METHOD FOR THE TA ~ OF THE DISTRIBUTION

58" He BDNMAN NUMERICAL INVERS ~N OF CHARACTER IST ~ FUNCTIONS SCANDINAVIAN ACTUARIAL JOURNt 121-126. 19T5

A SURVEY AND COMPARISONS OF VARIOUS METHODS

5~* R. ~3¢RER A MULTIVARIATE T PRDBABILITY I~TEGRAL BINMETRIKA~ 60, 667-6S6~ 1973

56

63" S" p. BDICOURT THE PREDICTION OF FAILURES IN C.R.T. SYSTEMS PROCEEDINGS OF THE FIFTH SYHPOS|UM ON ENGINEERING PROBLEMS OF FUSION RESEARCHw PRINCETON NJt NOVEMBER 1973, IEEE PUBLICATION NO. 73CHO863-3-NPSt 308-313, lq73

61~ G* P* BDICOURT FITNEI8 - A PROGRAM TO FIT FAILURE DATA T~ NE ~ULL

PROBABILITY PARAMETERS REPORT NO. LA-553Bt LOS ALAMOS SCIENTIFIC LABORATORY, LOS ALAMOS NM, 1974, 18 PP.

FORTRAN PROGRAM LISTED

62* LeBOLSHEV, V.2DLOTAREVI EeKEDROVA, N°RYBINSKAYA TABLES OF CUMULATIVE FUNCTIONS OF ONE-SIDED STABLE DISTRIBUTIONS

THEORY OF PROBABILITY AND APPLt 15t 299-309, 1968

63* L* l * BONEVA, De G, KENDALL AND I , STEFANDV SPLINE TRANSFORMATIONS - THREE NEH DIAGNOSTIC AIDS FOR THE STATISTICAL DATA ANALYST

JOURN. ROYAL STATISTICAL SOCt BS3t 1-70~ 1971

b~* L. I . 60NEVA~ De G* KENDALL AND J . A. LAMBERT THE STATSPLINE PROGRAMS TECH. REPe CC-TAOlt COMPUTER CENTRE, UNIV.

NEWCASTLE, NEV SOUTH HALE$g AUSTRALIA

65" H, BOUVER AND R* E. BARGMANN ON THE EXACT DISTRIBUTION OF CONVOLUTIONS OF A

TRUNCATED GAMMA DISTRIBUTION THEN|S REPT. NO. 21t STAT. REPT. NO 88t DEPT. OF

STAT AND COMP. SCt UNIV. OF GEORGIA, ATHENS, GAy 1972t 210 PP ANALYSIS OF THE ALGORITHM, VERY EXTENSIVE

COMPUTER PROGRAMS TABLES AND GRAPHS

6S* H, BOUVER CURVE FITTING BY THE METHOD OF MOMENTS THEMIS REPT, NO 29, TECH. REPT. NO lOB, DEPT. OF STAT AND COMP SC, U N ~ . OF GEORGIA, ATHENS GA, 1973t 63 PP USE OF THE PEARSON SYSTEM

67" H, BOUVER AND R. E. BARGNANN TABLES OF THE STANDARDIZED PERCENTAGE POINTS OF THE

PEARSON SYSTEM OF CURVES IN TERMS OF BETAI AND BETA2

TNEMIS REPT. NO 32t TECH. REPT. NO lOT, DEPT. OF STAT AND CONP SCt UNIV. OF GEORGIA, ATHENS GA, 197~, 184 PP

68~ G. E. BOX AND M. E. MULLER A NOTE ON THE GENERATION OF RANDOM NORMAL DEVIATES ANNALS MATH. STAT, 29t 610-611t 1958

69* ~. BRAUN POLYNON [AL BOUNDS FOR PROBAB |L ITY GENERATING FUNCTIONS

JOURN. APPLIED PRDBABILITYt l i t 50T-516, 19TS USEFUL IN VARIOUS APPROXIMATIONS AND BOUNDS FOR

COMPUTAT IONS IN BRANCH ~G PROCESSES

TOe R. P. ERENT A GAUSSIAN PSEUDO-RANDOM NUMBER GENERATOR COMMUNICATIONS OF THE A.C.N, ALGORITHM 4B8, IT,

704-TOSt 1976

71e P. J. BROCKNELL AN ASYNPTOTIC EXPAMS ION FOR THE TA L OF A B [NON IAL

DISTRIBUTION AND ITS APPLICATION IN QUEUEING THEORY

JOURN. APPLIED PRODABILITYt 1, 163-169, 1964 INCLUDES AN APPLICATION TO THE M/M/l QUEUE WITH BATCH ARRIVALS APPROXIMATES THE PROBABILITY THAT THE N-TH CARRIVAL DOE5 NOT HAVE TO MAIT

72* J. D. BROFF~T AND N. T. DENT ASYNPTOTIC APPROX|NAT|ONS FOR DISTRIBUTIONS OF RATIOS OF LINEAR FUNCTIONS OF RANDOM VARIABLES

JOURN. ROYAL STATISTICAL SOCt BSTt 38-48t 1975

73" J. Re 6RYA ALGORITNNS FOR SOLVING UNDISCDUNTED

INFINItE-HORIZON MARKOV GAMES PH° D. THEE ~ , SOUTHERN METHODIST ON IV, DALLAS TX, MAY 1974

74* R. M. BUTTERNDRTN ON CONGESTION IN OUTPATIENT HALK-IN CL ~ ICS TECH. REPT. NPSSBBDTSO61t NAVAL POSTGRADUATE

SCHOOL, MONTEREY CAt 1975t ~ PP DISCUSSION OF NUMERICAL METHODS FOR TRANSIENT

BEHAVIOR

75* J° P. BUZEN QUEUEING NETNORK MODELS OF MULTIPROGRAMMING PH* D* THESIS* C.S* DEPTt HARVARD UNIV, CAMBRIOGE

HA, ISSUED AS TECHNICAL REPORT ESD.-TR-7L-345t DEPUTY FOR COMMAND AND MANAGEMENT SYSTEMS, HQ ELECTRONIC SYSTEMS DiVe (AFSC), L.G. HANSCOM FIELD, BEDFORD MA 02730, 19T|t 235 PP

7S* J. P. 8UZEN AND P. Se GOLDBERG GUIDELINES FOR THE USE OF INFINITE QUEUEING MODELS

IN THE ANALYSIS OF COMPUTER SYSTEM PERFORMANCE PROCEEDINGS OF THE NATIONAL COMPUTER CONFERENCE

1974t 371-374, 1976 NUMERICAL COMPARISON OF MEAN HALTING TIMES IN THE

M/G/I /N AND A CORRESPOND ~G H/G/ I QUEUE FOR VARIOUS VALUES OF N

77" J. P, BUZEN COMPUTATIONAL ALGORITHMS FOR CLOSED gUEUEING

NETNORKS WITH EXPONENTIAL SERVERS COMMUNICATIONS OF THE A.CeHt 16, 527-531, 1973

COMPUTATION OF THE EQUILIBRIUM DISTRIBUTION OF CUSTOMERS IN CLOSED NETNDRKS WITH EXPONENTIAL SERVERS

76" J. CANOSA ON A NONLINEAR DIFFUSION EQUATION DESCRIBING

POPULATION GRONTH I .E.N. JOURN, OF RESEARCH AND DEVELOPMENT, 17, 3~7-313,1973

79* To Ao CARPENITO AND Jo Ao WHITE THE ALLOCATION OF NON-IDENTICAL MACHINES AMONG NON-IDENTICAL SERVERS

REPRINT NO 7405, VIRGINIA POLYTECHNIC INSTITUTEr IcE. AND OeR. 6LACKSBURG VAt 1976 DISCUSSES AN ALGORITHM BASED ON HARKOVIAN

ASSUMPTIONS IN STEADY STATE FOR THE OPTIMIZATION PROBLEM GIVEN IN THE TITLE

8~* C* C* CARSON COHPUTATIONAL HETHODS FOR SINGLE SERVER QUEUES MITH

INTERARRIVAL AND SERVICE TIMES DISTRIBUTIONS OF PHASE TYPE

PH, D. THESIS, DEPT. OF STATISTICS, PURDUE UNIVERSITY, NEST LAFAYETTE IN, MAY 1975 COMPUTATION OF VARIOUS STATIONARY DISTRIBUTIONSt

FORTRAN PROGRAMS L ~TED

81 ' C. C, CARSON AN ALGORITHM FOR COMPUTING VULNERABILITY REDUCTION THROUGH REDUNDANT COMPONENTS

MANUSCRIPT, SANDIA CORPORATION, ALBUQUERQUE NNtlgTS COMPUTATION OF A SURVIVAL PROBABILITYe FORTRAN PROGRAM LISTED

8Z* B. D* CARTER ON THE PROBABILITY DISTRIBUTION OF RATIONAL

FUNCTIONS OF INDEPENDENT H-FUNCTION VANIATES . PH.D. THESIS, UNW. OF ARKANSAS, FAYETTEVILLE ARt

1972~ 188 PP SEVERAL CLASSICAL DISTRIBUTIONS ARE PARTICULAR

CASES OF THE H-FUNCTION DISTRIBUTION. PROPERTIES AND ALGORITHMS TO COMPUTE THE D1STR~UTION OF A RATIONAL FUNCTION OF AN H-FUNCTION DISTRIBUTED RANDOM VARIABLE ARE DISCUSSED. THE DISTRIBUTION IS COMPUTED APPROXIMATELY FROM A SET OF ITS MOMENTS

83* G. He CARTER AND R. B. COOPER QUEUES NITH SERVICE IN RANDOM ORDER OPERAT ~NS RESEARCH, ZO, Big-AOSt 1972

DISCUSSES APPROXIMATIONS TO THE STEADY-STATE MAITING TIME DISTRIBUTIONS UNDER SERVICE IN RANDOM ORDER FOR THE N / G / l , N/N/K, AND GI/HIK DUE UE S

84* G. M. CARTERt J . Me CHAIKEN AND E. IGNALL RESPONSE AREAS FOR TNO EMERGENCY UNITS OPERATIONS RESEARCH, 20* ETl-B94, 1972

DETERMINATION OF THE RESPONSE AREAS FOR TMO EMERGENCY FACILITIES SO AS TO MINIMi2E MEAN RESPONSE TIME

85* K, Ho CHANDY THE ANALYSIS AND SOLUTIONS FOR GENERAL QUEUEING NETNORKS

IN PROCEEDINGS SIXTH ANNUAL PRINCETON CONFERENCE ON INFORMATION SCIENCES AND SYSTENStPRINCETON NJt1972

B6* K, N, CHANDY, U, HERZOG AND L. HO0 PARAMETRIC ANALYSIS OF OUEUEING NETWORK MODELS l.B.M. JOURN, OF RESEARCH AND DEVELOPMENT, 19t 36-42, 1975,

87" g. M. CHANDY, U. MERZOG AND L. MOO APPROXIMATE ANALYSIS OF GENERAL QUEUEING NETNORKS hBeH. JOURNeRESEARCH AND DEVELOPNENT, Igt43--49t 1975

AN APPROXIMATE ITERATIVE TECHNIQUE FOR THE ANALYSIS OF NETNORKS H|TH GENERAL SERV~E TINES

88* W. CHANG COMPUTER INTERFERENCE ANALYSIS I . 6 . M , JOURNeRESEARCH AND DEVELOPMENT,IT,IS-IS, 1973

SOME DETAILED NUMERICAL*EXAMPLES INVOLVING HALTING TIMES FOR QUEUES HITH ERLANG SERVICE TIMES


89, M. L. CHAUDRY A~D J. G. C. TEMPLETDN BOUNDS FOR THE LEAST POSITIVE ROOT OF A CHARACTERISTIC EQUATION IN THE THEORY OF QUEUES

INFOR, 11t 177-1T9t 1973 SEE ALSO UNDER Io SAHIN~ 1970

93* W. J. CHU AND A. G. KOMHEIN ON THE ANALYSIS AND MODELING OF A CLASS OF COMPUTER

COMNUN|CAT ION SYSTEMS IEEE TRANSACTIONS DN COMMUNICATIONS, COM-20. 645-660, 1972

A DETAILED OVERVIEN OF LOOP SYSTEMS FOR TERMINAL TO PROCESSOR NETNORKS.

SEE ALSO UNDER A.G.KONHEIM

91, Vo CHVATAL AND D. SANKOFF LONGEST COMMON SUBSEQUENCES OF TNO RAND3M SEQUENCES JOURN. APPLIED PROBABILITY, 12, 3Gb-SISt 1ITS

STUOY OF THE EXPECTED LENGTH OF THE LONGEST COMMON SUBSEQUENCE OF TMO RANDOM K-ARY SEQUENCES OF LENGTH N. EXACT AND SIMULATION RESULTS. BOUNDS

9Re R, 0. COLEMAN USE OF A GATE TO REDUCE THE VARLtNCE OF DELAYS IN

QUEUES NITH RANDOM SERVICE BELL SYSTEM TECHNICAL JOURN. $2, 1403-16Z2, 1973

COMPUTATIONS OF DELAY FEATURES IN AN H/M/N QUEUE N ITH A GATE

9 ) * J. W. COOLEY AND J* W* TU~EY AN ALGORITHM FOR THE MACHINE CALCULATION OF FOURIER SERIES

MATHEMATICS OF COMPUTATION, 19, 297-301. 1965 A FUNDAMENTAL AND SEMINAL PAPER ON THE FAST FOURIER TRANSFORM ALGORITHM

9~* D. R* COX A USE DF COMPLEX PROBABILITIES IN THE THEORY OF

STOCHASTIC PROCESSES PRDCe CANE. PHIL. SOC, SIt 313-319t 195S

DISCUSSES USEFUL PHASE REPRESENTATIONS FOR PROBABILITY DISTRIBUTIONS ON (O,INF) NHICM HAVE A RATIONAL LAPLACE-STIELTJENS TRANSFORH

9Se N , ~ CRANE AND 0. L. IGLEHART SIMULATING STABLE STOCNAST|C SYSTEMS I - GENERAL MULTI-SERVER QUEUES JOURN. OF THE A.C.M, 21, 103-11)* 1976

9S* M.A. CRANE AND De Le IGLEHART SIMULATING STABLE STOCHAST|C SYSTEMS ] I - MARKOV CHAINS JOURN. OF THE AeC*Mt 21t 114-12S* 1976

97* M. At CRANE AND D. L. IGLEHART SIHULATING STABLE STOCHASTIC SYSTEMS I l l - REGENERATIVE PROCESSES AND DISCRETE EVENT SIIqJLATION

OPERATIONS RESEARCHI 23. 33-65. 197S

gee N, A, CRANE AND D* L. IGLEHART SIMULATING STABLE STOCHASTIC SYSTEMS IV - APPROXIMATION TECHNIQUES MANAGEMENT SCIENCE, 21~ 1215-1226, 2975

SEE ALSO UNDER D, L. IGLENART

99* N. V* CROMIE MEASURES OF EFFICIENCY FOR THE 'BULK SERVICE QUEUE

M/M(XIIC/INF AND THE BULK ARRIVAL QUEUE N(xI /M/CI [NF NITH COMPUTING ALOORITHMS, TABLES AND CHARTS - AND STEADY-STATE PROBABILITY EQUATIONS FOR SPECIAL CASES OF THE QUEUE NITH BULK-ARRIVAL AND BULK-SERVICE MIX) IMIYI ICI INF (DJ TNO VOLUMESI

N.S. THESIS, DEPTe OF MATHEMATICS, ROYAL MILITARY COLLEGE OF CANADA, KINGSTON ON, CANADA, 1976

13)e N, J. CROSS TABLES OF FINITE-MEAN NONSYMHETRIC STABLE DISTRIBUTIONS AS CDMPUT~i) FRO#I THEIR CONVERGENT AND ASYMPTDTIC SERIES

JOURN, STATISTICAL COMPUTATION AND SIMULATION, 3, 1-27, 1974

lO le B. Be CULMER A SIMULATION MODEL FOR NULTI-CHANNEL,

TINE-DEPENOENT QUEUEING SYSTEMS AND AN APPLICATION TO TEST AND EVALUATE AN ANALYTICAL MODEL OF THE U.S* ARMY ACUTE MINOR ILLNESS CLINIC

M.SC, THESIS, NAVAL POSTGRADUATE SCHOOL, MONTEREY CAr 197B~ 93 PP

A CASE STUDY, RELATED TO THE THESIS BY VANASDLEN AND UAHLIG

13 le D. J. DALEY NONTE CARLU ESTIMATION OF THE MEAN QUEUE SIZE IN A STATIONARY GI/M/I QUEUE

OPERATIONS RESEARCH. 16~ lOOZ-lOOSt 1968 STUDIES THE EFFECT DF SERIAL CORRELATION ON THE

REQUIRED SAMPLE SIZE

[:J3e H. E..DANIELS THE. MAX IMUM SIZE OF A CLOSED EPIDEMIC ADvANcES IN APPLIED PROBABILITY, 6t 607-621t 1974

AN APPROXIMATION NITH MANY CONME.NTS ON COMPUTAT ; ON

lO4* F. No DAVID AND D. Ee BARTON COMBINATORIAL CHANCE (60OK) GH. GRIFFIN AND CO. LONDON. 1962. 3S6PP.

DETAILED ANALYS IS OF A LARGE NUMBER OF COMBINATORIAL PROBLEMS NITH MUCH UBEPJUL INFORMATION ON COMPUTATIONAL ASPECTS AND RECURRENCE RELATIONS

105" ~1. A. DAVID RANKING THE PLAYERS IN A ROUND ROBIN TOURNAHI~NT REVIEW INTERNAT. STAT. INSTITUTE. 39t 13T-167o 1971

SOME COMPUTAT IOMAL RESULTS ON T IE-BREAK JIG RULES '

106" L. E. DAVIES AVERAGE CUMULATIVE PROBABILITY OF DETECTION VERSUS TARGET RADIAL VELOCITY

TECN. NOTE AD-TSZ166. STANFORD RESEARCH INST|T. MENLO PARK CA, 1969 COMPUTATION OF DETECTION PROBABILITIES FOR RADAR

107" R, B, DAVIES NUMERICAL INVERSION OF A CHARACTERISTIC FUNCTION BIOMETRIKA, 60, 415-61T, 1973

APPLICATION TO THE DISTRIBUTION OF QUADRATE FORMS IN INDEPENDENT NORMAL RANOOM VARIABLES

lOB* J. Se DE CANT MAXIMUM LIKELIHOOD PAIRED COMPARISON RANKING BY

L INEAR PROGRAMM ~/G B IOMETRIKA, S6t S37-SASt 1969

109" J . S. DE CANI A BRANCH AND BOUND ALGORITHM FOR MAXIMUM LIKELDtO00

PAIRED COMPARISON RANKING BIOMETR|KAw SIt 131-135, 1972

AN IMPROVED COMFOTATIONAL METHOD FOR THE PROBLEM DISCUSSED Dq J.S. DE CANit 1969

113" H. Pe OECELL JR* AND Pe Le ODELL ON THE FIXED POINT PROBABILITY VECTOR OF REGULAR

AND ERGOD IC TRAIqS IT ION NATR ICES JOURN. AMERe STATe ASSOC, 6Z, 600-602, 1967

RELATES THE STATIONARY PROBABILITY VECTOR OF REGULAR DR ERGODIC STOCHASTIC MATRICES TO THE NOORE-PENROSE GENERAL IZED JIVERSEe

SEE ALSO UNDER PeLeODELL* 1967

I l l * L. E. N. DELBROIJCK THE LAN OF AVERAGES AS A COMPUTING TOOL NAVAL RESEARCH LOGISTICS QUARTERLY, 19, 169-1SJ,

1972 A MIXED SIMULATION-COMPUTATION METHOD TO EVALUATE

VAR IOUS L IN I1" D ISTR IBUT IONS OF THE NA IT gig T INE IN N/G/1 QUEUES UNDER SEVERAL QUEUE DISCIPLINES

112" G. DE LEVI AND FIe C. TIJMS A GENERAL MARKOV DEC IS ION METHOD u ITH APPL iCATIONS TO CONTROLLED QUEUEING SYSTEMS

MATHEMATISCH CENTRUN PUBL, EN 26/74t AMSTERDAM, PPw 1976

DISCUSSES AMONG OTHER TOPICS AN ALGORITHM FOR THE SNITCH-OVER PUL|CY CONTROLLIND THE QUEUE SIZE IN THE M/OIl QUEUE NITH TNO SERVICE TYPES AND SNI TCH-OVER COSTS

113" A. DESCLOUX VARIANCE OF LOAD MEASUREMENTS |N HA~_nv. IAM .SULV~J~E

SYSTEMS BELL SYSTEM TECHN EAL JOURN, 56, 1ZTT-IBO0, 1975

THE NUMBER OF BUSY SERVERS IS OBSERVED AT REGULARLY SPACED TIME POINTS. THE SAMPLE MEAN OF THESE OBSERVATIONS IS AN UNBIASED ESTIMATE OF THE LOAD. FORMULAS FOR THE VARIANCE OF THIS ESTIMATE ARE DERIVED AND EXTENSIVE COMNENTS ARE GIVEN ON ALGORITHMS FOR ITS COMPUTATION

11~I :Jo DIETER AND J, No AHRENS A COMBINATORIAL METHOD FOR THE GENERATION OF

NORMALLY DISTRIBUTED RANDOM NUMBERS COMPUTING. 11. 137-166. 1973

115e U. DIETER AND J. He AHRENS ACCEPTANCE-REJECTION TECHNIQUES FOR SAMPLING PROM

THE GAMMA AND BETA DISTRIBUTIONS TECH. RIPe NO 83, DEPT* OF STATIST ICS, STANFORD

UNIV~ STANFORD CA, 1976

l i b * J. DONELSON I I I OUANE'S REL lABILITY GRONTH MODEL AS A

NON-HOMOGENEOUS POISSON PROCESS MANUSCRIPTp INSTITUTE FOR DEFENSE ANALYSES, MCLEAN

VAt lOG) .PP* 1975 EXTENSIVE DISCUSSION DF APPROXIMATIONS AND

ALGORITHMS

Journal of Compu~tion~J and Applied Mathematics, volume 3, no 1, 1977. 58

117" T. G. DDNNELLY BIVAR1ATE NORMAL DISTRIBUTION, ALGORITHM 662 COMMUNICATIONS OF THE AcCeNt 16t 638+ 1973

AN ALGORITHM FOR THE EVALUATION OF THE BIVARIATE NORMAL DISTRIBUTION

118~ E. J. DUDENICZ AND S. R. DALAL ON APPROXIMATIONS TO THE T-DISTRIBUTION JDURNo QUALITY TECHNOLOGY, 6t lqB"-198t 19T2 +

FORTRAN PROGRAN LISTED

l l g e J. E. DUNN AND H. A. HOUSTOH AUTSMATED DECOOING OF AN ARBITRARY PROBABILITY

DISTRIBUTION FROM ITS GENERATING FUNCTION PROCe EIGHT ANNUAL SYNPOSIUN ON THE INTERFACE, LOS ANGELES CAt 7?-E~, 1975

DISTRIBUTION EVALUATED BY SUCCESSIVE FORMAL DIFFERENTIATIONS THE GENERATING FUNCTION NUST BE GIVEN IN ANALYTIC FORM A COMPUTER GRAPHICAL DISPLAY IS PRODUCED

123" T. So DURRANI AND J. N. NIGHTINGALE PROBABILITY DISTRIBUTIONS FOR DISCRETE FOURIER

SPECTRA PROCeINSTeELECTReENG*ILONDON|* 120t 299-311, 1973

ANALYSIS OF PDUER SPECTRA OBTAINED BY THE FAST FOURIER TRANSFORM

121" J. DURBIN THE PROBABILITY THAT THE SAMPLE DISTRIBUTION

FUNCTION LIES BETNEEN THO PARALLEL LINES ANNALS RATHe STAT, Z, 398-611. 1966

l iES J. DJRBIN BOUNDARY-CROSSING PROBABILITIES FOR THE BRONNIAN

MOTION AND PO ~SON PROCESSES AND TECHM~UES FOR COMPUTING THE POHER OP THE KOLMOGOROV-SNIRNOV TEST

JOJRN. APPLIED PRCLILABIL~TYe ~, 431-6B)t 1971 CURVED BOUNDARIES ARE REPLACED BY PIECENISE

LINEAR BOUNDARIES

12)* J. DURBXN AND Me KNOTT COMPONENTS OF CRANER-VON NISES STATISTICS I JOURN. ROYe STATe SOC, B36t 290-30Te 1972

INCLUDES THE NUMERICAL INVERSION OF A CHARACTERISTIC FUNCTION INVOLVING BESSEL FUNCTIONS

126" d. DUREZN KOLMOGOROV-SMIRNOV TESTS NHEN PAPAMETER5 ARE

ESTIMATED MITH APPLICATIONS TO TESTS OF EXPONENT IALITY AND TESTS ON SPACINGS

BIOMETRIKAt 62t 5-21t 1975 INCLUDES THE COMPUTATION OF TABLES OF PERCENTAGE

POINTS OF VARIOUS KOLNOGOROV-SNIRNOV STATISTICS

125s J° E. DUTT ON COMPUTING THE PROBABILITY INTEGUL OF A GENERAL

MULTIVARIATE T BIDMETRIKAt 62, 2DI-235, 19TS

12b* S. EHRENFELD SOME NOMERICAL ASPECTS OF THE USE OF TRANSFORMS IN STATISTICS

JOURN. AHEM* STAr. ASSOC, 63, 679-893J 1963

1ITS G. EHRLICH LOOPLESS ALGORITHMS FOR GENERATING PERNUTATIDWS~

COMBINATIONS AND OTHER COMBINATORIAL CONFIGURATIONS

JOURN. OF THE AeC.M*ZOt 500-513, 1973 DISCUSSES A NUMBER OF USEFUL COMB INATOR ZAL

ALGORITHMS

128" H. EISENPRESS AND J. OREENSTADT THE ESTIMATION OF NONLINEAR ECONOMETRIC SYSTEMS ECONOHETR ICA, 36t 851-861t 1966

DESCRIBES THE ESTIMATION OF PARAMETERS OF A REGRESSZON EQUATION OR SYSTEM THAT IS NONLINEAR IN THE PARAMETERS OR THE DEPENDENT VARIABLES. USES A GRADIENT METHOD MHICH IS A STABLE VARIATION OF MENTOR e S METHOD

1291 L. ELSNER VERFAHREN ZUR BERECHNUNG DES SPEKTRALRADIUS

NICHT-NEGATIVER IRREDUZIBLER MATRIZEN COMPUTING+ 8, 32-39* 1971

COMPUTATION OF THE PERRDN E IGENVALUE AND THE CORRESPONDING EIGENVECTOR OF AN IRREDUCIBLE NONNEGATIVE MATRIX

133" L° ELSNER VERFAHREN ZUR 8ERECHNUNG DES SPEXTRALRADIUS

NICHT-NEGATIVER IRREDUZIELER MA~RIZEN I I CONPUTING, 9o 69-73, lgTz

1 3 1 " Y, ESCOUFIERv Pe ROBERT AND J. CAMBDN CONSTRUCTION OF A VECTOR EQUIVALENT TO A GIVEN

VECTOR FROM THE POINT OF VIEM OF THE ANALYSIS DF PRINCIPAL COMPONENTS

MANUSCRIPT+ CENTRE DE RECHERCHE EN INFORRATIQUE ET GESTION, MONTPELLIERt FRANCE. PRESENTED AT COMPSTAT CONFERENCE* VIENNA* 19T6°

13Z* F. ESSCHER ON APPROXIMATE COMPUTATION OF DISTRIBUTION

FUNCTIONS NHEN THE CORRESPONDING CHARACTERISTIC FUNCT IONS ARE KNOMN

SKANDINAV|SK AKTUARIETIDSKRIFT. 66, 78-86t 1963

133s R. V, EVANS NUMERICAL METHODS FOR QUEUES N ~ H COMPLEX SERVICE

RATES TECH. REPTo NO. 82t MANAGEMENT SCIENCES RESEARCH

PROJECT+ UNIV. OF CALt LOS ANGELES CAt 1963 FOR RELATED WORK SEE ALSO UNDER Ve WALLACE

1361 R. Ve EVANS THE STRUCTURE DF SOME TNO-DIMENSIONAL GUEUEING

SYSTEMS TECH. REPT. N3. 8Sm MANAGEMENT SCIENCES RESEARCH

PROJECT+ UNIV. OF CALt LOS ANGELES CAt 1963

13S* R° V° EVANS GEDNETRIC DISTRIBUTION IN SOME TNO-DINENSIONAL

QUEUEING SYSTEMS OPERATIONS RESEARCHI 15, 830-846. 1967

136. R° V° EVANS PROGRAMMING PROBLEMS AND CHANGES IN THE STABLE BEHAVIOR OF A CLASS OF MARKOV CHAINS

JDURN. APPLIED PROBABILITY. 8+ 5A3-SBO+ l qT l AN OPT IMIZAT|ON PROBLEM INVOLVING THE STATIONARY

PROBABILITY VECTOR OF A FINITE NARKQV CHAIN

137" J. L. EVERETT STATE PROBAB|L~S IN CONGESTION PROELEMS

CHARACTERIZED BY CONSTANT HOLDING TINES JOURN. OPERe RES* SOC. AMERICA. I t 279-285, 1953

HEURISTIC ITERATIVE METHOD FOR THE STEAOY-STATE QUEUE LENGTH D ISTR IBUT ION ~N CONTINUOUS T IRE FOR THE M/D/R QUEUE

133* E. Ne.ENENS NUMERICAL RESULTS AND DIFFUSION APPROXIMATIONS IN A

GENETIC PROCESS BIOMETRIKA 50, 261-269, 1963

139" d. J. EHENS THE PSEUDO-TRANSIENT DISTRIBUTION AND ITS USES IN

GENETICS JOURN. APPLIED PROBABILITY, 1, 161-1B6, 1966

VARIOUS COMPUTATIONAL RESULTS ON D ~FUSZON APPROXIMATIONS

163" No J+ FADDY OPTIMAL CONTROL OF FINITE DAMS - CONTINUOUS OUTPUT

PROCEDURE ADVANCES IN APPLIED PROBABILITY, 6t 689-710t 1976

INCLUDES COMPUTATIONAL COMPARISON OF POLICIES

161" N. E. FAKHR EL DIN AND L. PEIRAM CALCULATION OF THE TRAFFIC CAPACITY OF A PRIVATE

DATA NETHORK ERICSSON TECHNICS, 30. ES-1081 1976

INCLUDES A COMPARISON OF SIMULATION AND ANALYTIC RESULTS

162" A. J. FEDERONICZ AND He MAZUflDAR USE OF GEOMETRIC PROGRAMMING TO MAX IMUE

RELIABILITY ACHIEVED BY REOUNOANCY OPERATIONS RESEARCHp 16, 948"954t 1968

1 6 3 " R. K. F INK AND He MOSKON~Z A RECURSIVE ALGORITHM FOR A SUMMED MULTINONIAL

DENSITY FUNCTION PAPER NO. 510, KRANNERT GRADe SCHOOL INDUST. AOMINt PURDUE LINW, N. LAFAYETTE ]Nt 1975

166* ~. S. FISHHAN VARIANCE REDUCTION IN SIMULATION STUDIES JOUI~ STATISTICAL CONPUTATIQN AND SINULATIONt I t

17B-182, 1972 USE OF ANTITHETIC VARIABLES AND STRATIFIED

SANPLING TO REDUCE THE VARIANCE, APPLIED TO A QUEUE ING MODEL.

SEE ALSO ERRATUM IBID, I t P39Bw 1972

1~5" G. S. FISHMAN VARIANCE REDUCTION FOR NORNAL VAR ~TES IN MONTE

CARLO STUDIES JOURN. STATISTICAL COMPUTATION AND SIMULATION9 Z* 365-376, 1973

16b* G. S. FISHMAH STATISTICAL ANALYSIS FOR QUEUEING SIMULATIONS MANAGEMENT SCIENCE, 2Or 363-369, 1973

167" 5° S. FISHMAN ESTIMATION IN NULTISERVER QUEUING SIMULATIONS OPERATIONS RESEARCH+ 22, T2-TBt 1974

168' ~. Ee FDRSYTHE VUN NEUMANNtS CONPARISON METHO0 FOR RANDOM SAMPLING FROM THE NORMAL AND OTHER D ~TR ~UT~NS

MATHEMATICS OF CONPUTATIONt 26, 817-826, 1972


2690 8. L. FOX AND De M. LANUI AM ALGORITM FOR IDENTIFYING THE ERGODIC SUBCHA~S AND TRANSIENT STATES OF A STOCHASTIC MATRIX

COMMUNICATIONS OF THE AeCeM, 11~ 6|9-621t 1968 A GRAPH THEORETIC ALGORITHM FOR THE

CLASSIFICATION OF THE STATES OF A FINITE MARKOV CHAIN

153~ B. L. FOX NUMERICAL COMPUTATION - TRANSIENT BEHAVIOR OF

MARKOV RENEMAL PROCESSES TECH. PEP. NO. 119, DEPT, INFORMATIQUE~ UNIV. DE

MONTREAL, 1973t 26 PP. MITH APPENDICES k PROCEDURE OF GAUSS-SEIDEL TYPE FOR THE

NUPERICAL COMPUTATION OF THE TRANSIENT BEHAVIOR OF NARKOV RENENAL PROCESSES

1510 P, R, FREEMAN A NUMERICAL COMPARISON BETMEEM SEQUENTIAL TAGGING

AND SEQUENTIAL RECAPTURE BIOMETRIKA, 60, 699-508t l i T3

152s W, FREIBERGER AND U, GRENANDER A SHORT COURSE IN COMPUTATIONAL PROBABILITY AND

STATISTICS (BOOK) SPRINGER VERLAG, BERLIN AND NEH YORK, 1971, 15S PP.

DISCUSSES A NUMBER OF EXAMPLES OF VARYING LEVELS OF DIFFICULTY OF PRO8LEHS IN COMPUTATIONAL PROBA8ILITY. PROGRAMS IN THE APL LANGUAGE ARE GIVEN. NO EXERCISES.

1SOS W. FREIBERGER AND U. GRENANOER COMPUTATIONAL PROBABILITY AND STATISTICS INTERNAT. STAT. REVt 40t 67-72t 1972

A REVXEN OF THE AUTHORS PROJECT DI CO/4PUTATIONAL PROBABILITY

15&e S, FUHRMANM CONTROL OF AN EP|DEM IC ~IVOLV~G A MULTISTAGE

DISEASE PH, D, THESIS, DEPT. OF STATISTICS, PURDUE

UNIVERSITY, NEST LAFAYETTE IN, AUGUST 1975t 181 PP COMPUTATION AND APPROX mAT lnN OF A NUMBER OF

PROBABILITIES RELATEO TD A CONTROLLED NULTI-TVPE BRANCHING PROCESS

1SS~ ~* SALLO AND R, M, STARK COMPUTATIONAL ASPECTS OF POLYNOMIALS OF INDEPENDENT

RANDOM VARIABLES MANUSCRIPT, OEPT, OF STATISTICS AND COMPUTER

SCENCEv UNIV. OF OELANAREt REMARK OLt 197S CONFUTATION BY MEANS OF THE NUMERICAL INVERSION

OF MELLIN TRANSFORMS

156" J. GANI AND D. JERHOOD MARXDV CHAIN PETHOOS IN CHAIN BINOMIAL EPIDEMIC

MODELS (FRENCH SUMMARY I BIOMETRICS, 27, 591-603, 1971

SOME COMPUTATII~IAL ASPECTS OF THE EP~)ENIC MODEL DESCRIBED IN THE TITLE ARE DISCUSSED

157o D, P, GAVER AND Ge S. SHEDLER APPROXIMATE MODELS FOR PROCESSOR UTILIZATION IN

NULTIPROGRARMED COMPUTER SYSTEMS SIAM JOURN. ON COMPUTING, 2, 183-192t 1g73

158~ D. P. DRYER AND G. S. SHEOLER PROCESSOR UTILIZATION IN HULTIPROGRAMNING SYSTEMS

VIA DIFFUSION APPROXIMATIONS OPERATIONS RESEARCH, 21, 569-$76, 1973

1S9e D. P* GAVERt J. P. LEHOCZKYt AND N. PERLAS SERVICE SYSTEMS MITH TRANSITORY DEMAND TO APPEAR IN MANAGEMENT SCIENCE, 197~

DIFFUSION APPROXIMATIONS SU~ABLE FOR COMPUTATION FOR QUEUES OF A CLEARANCE TYPE

1630 J, GAZDAG AND J, CANDSA NUMERICAL SOLUTION OF F~HER'S EDUAT|ON JOURN. APPLIED PROBABILITY, 11, A65-.~S7, 1976

TH IS EQUATION DESCRIBES THE RATE OF ADVANCE OF A NEN ADVANTAGEOUS GENE. THE ACCURATE SPACE DERIVATIVE METHOD IS IHPLEMENTED

161o D. GEBHARDT EIN VERFAHREN FUR DIE BERECHNUNQ DER

ZUVERLAS,SlGKEIT YON VIELKONPONENTSYSTENEM NIT UNABHANGIGEN ELEMENTEN

ANGENANOTE INFONqATIK, 11~ 505 FF, 19T2 RELIABILITY CO~PUTATIONS [N SYSTEMS HITH MANY

INDEPENDENT COMPONENTS

162, #. M. GENTLEMAN AND G. SANDE FAST FOURIER TRANSFORMS FOR FUN AND PROFIT FALL JOINT COMPUTER CONFERENCE PROCEEDINGS, 29. 563-578, 1966

AN EXP~ITQRY PAPER ON VARIOUS ASPECTS AND EXAMPLES OF THE FAST FOURIER TRANSFORM

JournM of Compucational and Applied ~thenu~dcs, volume 3, no 1, 1977.

Ib30 E. GELENBE, J. LENFANT AND D. POTIER ANALYSE DIUN ALGORITHME DE GESTION SIHULTANEE -

MEMOIRE £ENTRALE - DISQUE DE PAG~ATmH ([N FRENCH, NITH ENGLISH SUI~IARYI

ACTA INFORMATICA, 3, 321-34St 1974 DETAILED ANALYSIS OF STORAGE POLICIES FOR A

CENTRAL MEMORY AND PAGED D ~K STORAGE SYSTEM. NUMERICAL RESULTS GIVEN

1b~o S. B. GHANEM OPTIMAL ALLOCATION OF PRIOR ~ IES THROUGH A PR ~ ING

SCHEME 1,6,M, RESEARCH REPT. RC 5292, T. J. NATSON RESEARCH CENTER, YORKTOWN HEIGHTS NY, 197S

INCLUDES AN ITERAT WE ALGOR ~l~q TO COHPUTE THE OPTIMAL POLICY

165" V. M, GHARE AND R. E. TAYLOR OPTIHAL REDUNDANCY FOR RELIABILITY ~ SERIES

SYSTENS OPERATIONS RESEARCH 17t 838.-847~ 1969

SEE O.No MCLEAVEYt OPERATIONS RESEMCHv 21, 1315-1318t 197~t FOR A CR ~ ICAL EVALUATION

166o D, C, GILLES AND P* A. M. LEWlS THE SPECTRUM OF INTERVALS OF A GEOMETRIC BRANCHING

PROCESS JOURN. APPL lED PROeABILi'rYt At 2OZ-20St 1967

A SUMMATION FORMULA FOR CONFUTING THE SPECTRUM OF INTERVALS IN A CERTAIN BRANCHING PROCESS

167o D. C. GILL ILAND AND E. Re HANSEN A NOTE 3N SOME SERIES REPRESENTATIONS OF THE

INTEGRAL OF A BIVARIATE NORMAL DISTRIBUTION OVER AM OFFSET CIRCLE

NAVAL RESARCH LOGISTICS QUARTERLY, Z l ,ZOT-Z l l t 1976 COMPUTATIONS BY MEANS OF RAPIDLY CONVERGING

SERIES DISCUSSED

168e L. P. C. GDHEEN OPT[HAL OPERATING POLICY FOR THE MACHINE REPAIR

PROBLEM TECN. AEP. NO, 163, DEFT. OF STATISTICS, STANFORD UNIVt STANFORD CAt 1976

DISCUSSION OF THE ASSIQNNENT OF FAILED MACHINES TO REPA|R FACILITIES. SOLUTION INVOLVES LINEAR PROGRAMMING

169" G. H. GOLUB AND E. SENETA COMPUTATION OF THE STATIONARY DISTRIBUTION OF AN

INFINITE MARKDV CHAIN TECH. REP* SUSZ6P30/STAN-'CS-7~-33S, CORP. SC, DEFT,

STANFORD UNIV, STANFORD CA, 1973

173" G. H, GOLUB AND E* SENETA COMPUTATION OF THE STATIONARY D~TRmUTmN DF AN

INFINITE MARKOV CHAIN BULL. AUSTRALIAN MATH. SOCj 8t 333-361, 1973

171e G. H. GDLUB AND E* SENETA COMPUTATION OF THE STATIONARY'DISTRIBUTION OF AN

INFINITE STOCHASTIC MATRIX OF SPECIAL FORM BULL. AUSTRALIAN MATH. SOC, lOt 255-Zblt 1976

COMPUTATION OF THE STATIONARY DISTRIBtrrloN ~ THE MATRIX IS OF UPPER HESSENBERG FORM OR A GENERALIZED RENEMAL MATRIX

17Z* L, A, GOODMAN THE ANALYSIS OF POPULATION GRONTH HHEN THE BIRTH

AND DEATH RATES DEPEND UPON SEVERAL FACTORS (FRENCH SUMMARY)

BIOMETRICS, 25t 659-681, 1969 SEVERAL DIFFERENCE EQUATION MODELS NITH DETAILED

COMMENTS ON COMPUTATION

173, A. D. GORDON A SEQUENCE-COMPARISON STATISTIC AND ALGORITHM BIOMETRIKA, 60, 197-200t 1973

174" J. GRANDELL AND S* NIDAEus THE ESSCHER APPROXIMATION METHOD SKANDINAVISK AKTUARIETIDSKRIFTI SUPPLIt~tSB-SOtlOb9

DISCUSSION OF ESSCHEReS APPROXIMATION METHO0 FOR INVERSION OF CHARACTERISTIC FUNCTIONS.

SEE ALSO UNDER FoESSCHER AND HeBONNAN

175o J. GRANDELL AND C. O. SEGERDAHL A COMPARISON OF SOME APPROXIMATIONS OF RUIN

PROBABILIT]ES SKANDINAVISK AKTUARIETIDSKRIFTt 56, 163-258, 1971

1768 W. K. GRASSMANN THE STEADY STATE BEHAVIOR OF THE M/E(KI/1 QUEUE

~ITH STATE DEPENDENT ARRIVAL RATES IHFORe l i p 163-173, 1976

COMPUTATION OF THE STEADY STATE PROBABILITIES AND THE MALTING TIME DISTRIBUTION FOR THE QUEUE DESCRIBED IN THE TITLE

177" M* K. GRASSMANN TRANSIENT SOLUTIONS ~ S ~PLE gUEUES T[£He REP, NO* 7¢-R-2, C.S. DEPT. UNIV. OF

SASKATCHEUAN SASKATOON,CANADAv IB PP. 1976 ALGORITHMS FOR SIMPLE NARKOVIAN QUEUES

1 1 I

60

1T8S ~* K, GRASSMAN~ A~D T. K* NGAI PROGRAM DESCRIPTION FOR STRANSZENT SOLUTIONS IN CONTINUOUS NARKOV CHAINS~

TECH. RIPe C,S, DEPT. UNIV. OF SASKATCHEWAN, SASKATOON, CANADA, 20 PPt 1974 A PROGRAMMED ALGORITHM FOR THE TRANSIENT SOLUTION

OF CDNT|NUOUS PARAMETER NARKOV CHAINS NITH A SPARSE (NFIN~ESIMAL GENERATOR

179m N. K. GRASSMANN COMPARISON OF THE THREE FORMULAE RELATING TO THE

M/EK/I QUEUE TECH. RIPe C.Se DEPT. UNIV. OF SASKATCHENAN,

SASKATOONe CANADA. 9 PP. 1976 COMPARES THE EXPLICIT FORMULA OF Te SAATY TO THE

COMPLEX VARIABLE METHOD PROPOSED BY No U. PRAOHU AND TO THE RECURSIVE COMPUTATION

183~ d. K. GRASSMAN~ COMPUTER PROGRAM TO F ~D TRANSIENT SOLUTIONS FOR

PARALLEL QUEUES SEQUENTIAL QUEUES AND QUEUEING NETNORKS

MANUSCRIPT. OEPToOF COMPUTATIONAL SCIENC.E~ UNIVeOF SASKATCHEHAN* SASKATOON,SASKATCHEMANtCANADAt 1975

SURVEY PAPER MITH EXAMPLES

181e We Te GRASSMANN AND Re T. CHURCHMAN USERS GUIDE FOR *TRANSIENT SOLUTIONS FOR QUEUE ~G NETNORKS8

TECH. REPT. COMPUTATIONAL SCIENCE DEPT. UNIV. OF SASKATCHENAN SASKATODN, SASKATCHEWAN, CANADA, 1975

182S K. GRAU AND Je K, BYERS AN ANALYSIS OF A NETNORK OF FINITE-QUEUE.

MULTIPLE-SERVER FACILITIES TECHe REPT. DEPT. OF Ce S* UNIV, OF MISSOURI, ROLLA MOt 1975

A UNIFIED NOTATION SIMILAR TO THOSE DEVELOPED BY V. MALLACE ANO ALSO BY Ne GAASSMANN TO NANDLE THE COMPUTATION OF THE STEADY-STATE PROBABILITIES OF NARKOVIAN SYSTEMS OF QUEUES

183~ le GREENBERG DISTRIBUTION-FREE ANALYSIS OF THE M/G/I AND G/M/I QUEUES

OPERATIONS RESEARCH, 21, 629-635, 1973 THE EMPIRICAL DISTRIBUTIONS OF THE SERVICE TIMES

IN THE FIRST CASE AND THE INTERARRIVAL TINES IN THE SECOND CASE ARE USED TO COMPUTE THE STATIONARY DISTR|BUTIONS

186~ Je OREGON AN ALGORTrHM FOR THE DECOMPOSITION OF A

DISTRIBUTION INTO GAUSSIAN COMPONENTS (FRENCH SUMMARY)

BIOMETRICS. 25, Tg-93t 1969 A METHOD FOR FITTING MIXTURES OF NORMAL

DISTRIBUTIONS BASED ON FOURIER ANALYSIS

185~ U, GRENANDER AqD Re F* TSAO COMPUTATIONAL PROBAB • ITY TECHe REP* 320-2019, CAMBRIDGE SC. ~ENTERt **B. He DATA PROCe DiVe 1968t 18 PP

TJTDRIAL MATERIAL

lOSe U, GRENANDER COMPUTATIONAL PROBABILITY Z - RANDOMNESS TECN, REP. 320-2039, CAMBRIDGE SC. CENTER, leBeN,

DATA PROC. OIV~ 1968t 65 PP TUTORIAL MATERIAL

1ST* U. GRENANDER COMPUTATIONAL PROBABILITY 3 - SINULAT~ON TECHe PEP. 3 S O - ~ t CAMBRIDGE SCe CENTER, |eBeMe

DATA PRO~e DIVe 1968, 4T PP TUTORIAL MATERIAL

188~ U, GRENANDER AND R° A. VITALE COMPUTATIONAL PROBABILITY 6 - REGRESSION IN TIME

SERIES TECH. RE P. 320-2040. GAMBRIDGE SC. CENTER, leBeN*

DATA PROD. OZV, 2969, 61 PP TUTORIAL NATERIAL

189e U. GRENANDER COMPUTATIONAL PROBABILITY AND STATISTICS SIAM REVIEN, 15, 136-192. |973

A LONG REVIEM PAPER NITN SEVERAL DETAILED EXAMPLES

193e Ue GRENANDER COMPUTATIONAL PROBABILITY AND STATISTICS PROC. SYMPOSIA IN APPLIED MATHt AMER, MATH. SOC, 20t 31-46, 1974

A SURVEY NITH EXAMPLES FROM TIME SERIES AND RANDOM TRANSFORMATIONS

191e T. N. E, GREVILLE AND N, KEYFITZ BACKMARD POPULATION PROJECTION BY A GENERALIZED

INVERSE THEORETICAL POPULATION BIOLOGY, 6, 135-142, 1974

CONSTRUCT ION OF GENERALIZED INVERSES OF THE LESLIE MATRIX SUITABLE FOR BACKNARD PROJECTION

192x I . I . GRINGgRTE~ ESTIMATING FINITE-TIME MAXIMA AND MINIMA OF A

STATIONARY ORNSTEIN"UHLENBECK PROCESS 6Y MONTE-CARLO SIMULATION

JOURN. AMER. STAT. ASSOCt 63, 1517-1S21t 196B

193~ H, Ae GUESS THE EFFECT OF FRAME LOAD AND BALANCE ON DIAL-TONE

DELAY IN NO. 5 CROSSBAR BELL SYSTEM TECHNICAL JOURN, 54, 175S-IT93, 1975

DISCUSSES COMPUTATIONAL ASPECTS OF A QUEUEING MODEL ARISING IN A TELEPHONE ENGINEERING PROBLEMe

SEE ALSO UNDER S. HALF

Lq4s L. S, GURZN OPTIMIZATION IN STOCHASTIC MODELS INTERN. JOURN. CDMPUTER MATH, 1, 221-226, 1964

TRANSLATION OF A RUSSIAN PAPER IN JOURNe OF COMPUTING MATH. 6t 36T-BTO, 1964. A STOCHASTIC GRADIENT METHOD

195" S. HALFIN AN APPROXIMATE METHOD FOR CALCULATING DELAYS FOR A FAMILY OF CYCLIC-TYPE QUEUES

BELL SYSTEM TECHN~AL JOURN. 54. 1TBB-1754t SgTS SEE ALSO THE PAPER BY N. Ae GUESS

196e G, A, HALL AND T. A. PORSCHING COMPUTIqG THE HAXIMAL E|GENVALUE AND E IGENVECTOR OF

A NONNEGATIVE MATRIX SIAM JOURN. ON NUMERICAL ANALYSIS, S* 269"274t 1968

1970 C, A. HALL AND T. A. PORSCHING COMPUTING THE MAXIMAL E]OENVALUE AND EIGENVECTOR OF

A NONNEGATZVE MATRIX SIAM JOURN, OF NUMERICAL ANALYSIS, St ATO-4T4, 1968

19B~ J, M, HAMMERSLEV AND O. C, HANDSCDHB MONTE CARLO METHODS (BOOK) NETHUEN SERIES, LONDON, 1964. |TO PP

AN INTRODUCTORY TEXT NITH A RICH VARIETY OF EXAMPLES FROM MANY AREAS OF APPLICATION

199e J. M, HAMMERSLEY SOME SPECULATIONS ON A SENSE OF NICELY CALCULATEO CHANCES

SIAM REVIEH. 16~ 237-255, 1976 A REVIEN PAPER CONTAINING A DISCUSSION DF THE

BEHAVIOR OF THE SOLUTIONS OF A NONLINEAR DIFFERENCE EQUATION

233e E. HANSLER A FAST RECURSIVE ALGORITHM TO CALCULATE THE

REL lAB |L ITY OF A COMMUN ICAT ION NETNORK IEEE TRANSACTIONS ON COMMUNICATIONS, COM-2O. 637-66Dt 1972

2~1~ E, HANSLER, G. K. MCAULIFFE. AND R, Se N ILKDV OPTIMIZING THE RELIABILITY IN CENTRALIZED COMPUTER NETNORKS

IEEE TRANSACTIONS ON COMMUNICATIONS, COM-ZOt 663-6~6t 1972

20Z~ E* HANSLER USING APL FOR NETNORK RELIABILITY CALCULATIONS PROCeAPL CONGRESS 1973.223-229. COPENHAGEN, DENMARK

203e E. HANSLERt Ge K. MCAULIFFE AND Re Se HILROV EXACT CALCULATION OF COMPUTER NETNORK RELIABILITY NETMORKS. 4, 9S-1~2, 1974

GRAPH THEORETIC METHODS

20~e E, HAqSLER A NOTE ON • A FAST RECURSIVE ALGORITHM TO CALCULATE

THE RELIABILITY OF A COMNUN|CATION NETtlORK • MANUSCRIPT. TO APPEAR IN IEEE TRANSACTIONS ON COMMUNICATIONS

2~S~ R. J, HANSO~ STABLY UPDATING MEAN AND STANDARD DEVIATION OF DATA COMMUNICATIONS OF THE AeCeM* 18. ST-~B, 1975

2DSe H, De HARTLEY THE RANGE IN RANDOM SAMPLES BIONETRIKA, 32, 336-368, 1942

237m H, 0* HARTLEY A~D S. He KHAN IS A NUMERICAL SOLUTION OF THE PROBLEM OF MOMENTS BIOMETRIKA* 36, 340-351, 1967

DETERMINING A DISTRIBUTION FROM ITS MOMENTS

2~8 s H. 0* HARTLEY AND D* L* HARRIS MONTE CARLO COMPUTATIONS IN NORMAL CORRELATION PRBBLEflS

JOURN, 3F THE A.C.M. I0, 302-306, 1963 HIGHLY EFFICIENT SIMULATION OF THE SAMPLE

VARIANCES AND THE SAMPLE COVARIANCE FOR 8IVARIATE NORMAL POPULATIONS


209m H. 00 HARTLEY AND R. PFAFFENBERGER STATISTICAL CONTROL OF OPTIMIZATION APPEARED IN OPTIMIZATION METI~BDS IN STAT|STICS~

ACADEMIC PRESSw NEW YORK, 2 G I - 3 ~ 1971 A STATISTICAL SEARCH FOR GLOBAL MAXIMA OF

FUNCTIONS WITHOUT CONVEXITY REQUIREMENTS

213s H. 0. HARTLEY AND J. E° GENTLE DATA MONITORING CRITERIA FOR LINEAR MODELS IN

STATISTICAL DESIGN AND LINEAR MODELS EDo BY JeN.SRZVASTAVA. ELSEVIER. AMSTERDAM. l I T 6

DETAILED D]SCUSSIOH INCLUDED OF THE COMPUTATION OF THE DISTRIBUTION OF AN INTERNALLY STUDENTIZED STATISTIC FROM NORMAL VARIATES, INVERSION OF A HELLIN TRANSFORM BY USE OF JACOB] POLYNOMIALS

211" R~ O° HASKELL SEMI-MARKOV GENERATED POINT PROCESSES AN{) THE

SLIPERPOS|TION OF FINITE NUMBERS OF INDEPENDENT AND HYPEREXPOIqENTIAL RENEWAL PROCESSES

PH.O. THES IS, NAVAL POSTGRADUATE SCHOOLm MONTEREY CA, 31B PP~ JUNE 1974

EXTENSIVE INFORMATION ON THE COMPUTATION OF VARIOUS SPECTRA AND RELATED ITEMS. FORTRAN PROGRAMS LISTED

212* q. A, J. HASTINGS SOME NOTES ON DYNAMIC PROGRANM ~G AND REPLACEMENT OPER, RES, QUARTt l g l 455-464~ 1968

213" N. A, J. HASTINGS THE REPA/R LIMIT REPLACEMENT METHOD OPER. RES° QUARTI 2Or 33T-349~ 196g

21¢s N. A. J. HASTINGS OPTIMISATION OF DISCOUNTED MARKOV DEC~ION PROBLEMS OPER. RES. QUARTm 2Or 499-500t 1969

215* N. A, J° HASTINGS EQUIPMENT REPLACEMENT AND THE REPAIR LIMIT METHOD

11/ OPERATIONAL RESEARCH IN MAINTENANCE A.K.SeJARDINE (EOel MANCHESTER UNIV. PRESS AND BARNES AND NOBLE, NEW YORK. 1970

21&* N* A. J° HASTINGS BOUNDS ON THE GAIN OF A MARKOV DECISION PROCESS OPERATIONS RESEARCH, 19~ 260-244t 1971

217* N. A, J, HASTINGS DYNAMIC PROGRAMMING MITH MANAGEMENT APPLICATIONS

(BOOKI BUTTERIiORTHS~LONDON AND CRANE-RUSSAK~NEN YORK.' 1973

218, N. A.' J. HASTINGS SUe-OPTIMALITY TESTS IN DISCOUNTED NARKOV PROGRAMMING

MANAGEMEHT SCIENCE~ lg~ 1019-1022~ 1973

219~ M. A° J. HASTINGS DYNACODE DYNAMIC PROGRAMMING SYSTEM HANOBOOK UNIVe OF BRADFORD, MANAGEHENT CENTRE~ 1974

(AUTHOR) THIS SYSTEM |NCLUDES CONPREHENS|VE ROUTINES FOR MARKOV DECISION PROBLEMS AND IS COMMERCIALLY AVA ]LADLE ~ EUROPE AND THE UeSeA.

2ZD* N. A. J. HASTINGS A TEST FOR NONOPTIHAL ACTIONS IN UNOZSCOU~ITED HARKOV PROGRAHMING

MANUSCRIPT. TO APPEAR IN MANAGEMENT SCIENCE. Ig75

221~ M. K. HASTINGS MONTE CARLO SAMPLING METHODS USING MARKOV CHAINS

AND THE ~ APPL ~ATZONS 81OMETRIKA, 57~ q7-1ogt 1970

222. J, C, HEFFER STEADY-STATE SOLUTION OF THE M/EKIC(INFINITEtFIFO)

QUEUEIHG SYSTEM JQURN. CANAD, OPER. RES. SOG~ T~ 16-30~ 1969

SOLUTION OF THE STEADY STATE EQUATIONS BY MEANS OF A PARTICULARLY APPROPRIATE STATE SPACE

223* H, HEFFES ANALYSIS OF THE FIRST-COME~ FIRST-SERVED QUEUEING

SYSTEMS W~H PEAKED INPUTS BELL SYSTEM TECHNICAL JOURNt 52~ 1215-1EEBt IgT3

22~* H. HEFFES AND J. He HOLTZMAN PEAKEDNESS OF TRAFFIC CARR ~D BY A F ~ ITE TRUNK

GROUP NITH RENEWAL INPUT BELL SYSTEM TECHHICAL JOURNt 52t 161T-1642~ 1973

225' D. HEIMANN AND N. F. NEUTS THE SIDLE SERVER QUEUE IN DISCRETE TIHE NUMERICAL ANALYSIS IV NAVAL RESEARCH LOGISTICS QUARTERLY, 20~TS3-T66,IgT3

COMPUTATION OF THE DISTRIBUTION OF THE BUSY PERIOD FOR THE SINGLE SERVER QUEUE IN DISCRETE TIME

2 2 ~ D. HEIHANN COMPUTATIONAL ASPECTS OF THE BUSY PERIOD 3F THE

SINGLE SERVER QUEUE IN DISCRETE TIME PH.D. THES|S~ DEFT. OF COMP. SC. PURDUE LJHIVv M.

LAFAYETTE lNv UeS.At OCTOBER l i T 6 VARIOUS COMPUTATIONAL METHODS FOR THE

DISTRIBUTION OF THE BUSY PERIOD IN MIG/1 TYPE QUEUES IN DISCRETE TIME

227s J. HEINHOLD DIE ANHENDUNG DES ANALOGRECHNERS IN DER

UNTERNEHHENSFORSCHUNG (IN GERMAN. WITH ENGLISH SUMMARY)

COHPUT ]NGt 1, l i T - E l 3 , 1966 USE OF THE ANALOG COMPUTER IN ERLANGmS METHOD OF

PHASES, IN LINEARB NONLINEAR AND DYNAMIC PROGRAHH ~G

22Sm C. HERIN AN ALGORITHM FOR MAXIMIZING RELIABILITY THRO~H

SYSTEM REDUNDANCY MANAGEMENT SCIENCE RESEARCH REFTe NO 216t GRAD.

SCHOOL INDUST. ADNINI CARNEGIE-MELLON UNIVo PITTSBURGH PAl 1970 30 PP

229* C, HEqIN DOUBLE FAILURE AND RELATED PROBLEMS IN STANDBY

REDUNDANCY %EEE TRANSACTmNS ON RELMB~]TYm R2It 35-60e 1972

A BRANCH AND BOUHO ALGORITHM FOR PARALLEL STANDBY REDUNDANCY HHEREIN CONPONENTS ARE SUBJECT TO BOTH OPEN AND SHORT C|RCIJZT FAILURES

23)* C, HERIN COMPUTATIONAL TECHNIQUES FOR OPTIMIZING SYSTEMS

WITH STANDBY REDUNDANCY NAVAL RESEARCH LOGISTICS QU&RTERLYtI9t293-3OBt 1972

DISCUSSION OF A BRANCH-AND-BOUNO ALGORITHM TO MAXIMIZE A LINEAR COST FUNCTION OF THE REL|AB|L]TY OF A SERIES SYSTEM MITH STANDBY

231" C. HENIN OPTIMAL ALLOCATION OF UNRELIABLE CONPONENTS FOR

MAXIMIZING EXPECTED PROFIT OVER TIME NAVAL RESEARCH LOGISTICS QUARTERLYtZOt39~F-40Bt 1973

232" K. M. J. HEUTS AN EFFICIENT ALGORITHM TO CALCULATE THE LEAST

SQUARES ESTIMATES OF THE PARAMETERS D¢ THE LOGISTIC GROWTH FUNCTION AND THE APPLICATION OF DEALERS MEASURES OF NONLINEARITY FOR THIS HODEL (GERMAN, EIql;LZSHt FRENCH AND RUSS LAN SUMMARIES|

STATISTISCHE HEFTEt 15~ ZBA-ESS~ 1974

233t G. W. HILL AND A. W. DAVIS NORMAL DEV]ATE, ALGORITHM 442 COMMUNICATIONS OF THE AeCaHt lb t 51-SZI IqT3

AN ALGORITHM FOR THE EVALUATION OF THE INVERSE FUNCTION OF THE NORMAL DISTRIBUTION

236S W. G. HILL ON THE THEORY OF ARTIFICIAL SELECTION IN FINITE

POPULATIONS GENETICS RESEARCHm CAMBRIDGE, 13~ 16~l--[bBt 1969

EXTENSIVE COMPUTATIONAL COMMENTS

2358 F. S. HILLIER AND R° Wo.BOLING FINITE QUEUES IN SERIES NITH EXPONENTIAL OR ERLAHG

SERVICE TIMES - A NUMERICAL APPROACH OPERATIONS RESEARCH, IS, 28b-303t 1971

EXTENSIVE DISCUSSION OF THE STATIONARY NEAN OUTPUT RATE AND THE MEAN NUMBERS OF CUSTOMERS EACH UNIT OF THE SYSTEM. ALL INTERMEDIATE WAITING SPACES ARE ASSUMED TO BE FINITE

236* F. S. HILLIER AND F. De LO TABLES FOR MULTIPLE-SERVER QUEUEING SYSTEHS

INVOLVING ERLANG DISTRIBUTIONS TECH. REP. NO. 31~ DEPT. OF O.R! STANFORD UNIV.

STAHFDRD CA, lgTlm 176 PP. EXTENSIVE COMPUTATIONAL RESULTS ON THE EM/EN/C

MODEL. ALGORITHMS AND TABLES

237* K. G. HILSON NUMERICAL COMPUTATION OF THE CHARACTERISTICS OF TWO

DISCRETE TIME QUEUEING SYSTEMS ORS STAFF NOTE NO, 22/T2t DIRECTORATE OF MATH AND

STAT~ OEPT, OF DEFENSE, OTTAWA ON CANADA, 1972 RECURS]VE SOLUTION OF THE TRANSIENT BEHAVIOR OF

DISCRETE VERSIONS OF THE GI /G/ I QUEUE AND OF THE N/G/1 QUEUE

238* K. 3. HILSDN A DIORITE TIME QUEUE WITH CORRELATED ARRIVALS AND

A GENERAL SERVICE TIME DISTRIBUTION DMS STAFF NOTE NO. 12/TBt DIRECTORATE OF MATH AND

STAT~ DEFT. OF DEFENSE, OTTAWA ON CANADA. 1973 RECURSIVE SOLUTION OF THE TRANSIENT BEHAV|OR OF A

QUEUEING MODEL IN WHICH THERE IS SOME DEPENDENCE BETNEEN ARRIVALS. NUMERICAL ~VERS ION OF PRUBAB]LITY GENERATING FUNCTIONS IS ALSO USED


239" K. HIRASAHA NUMERICAL SOLUTIONS OF BULK QUEUES VIA IMBEDDED

MARKOV CHAIN ELECTRICAL ENGINEERING IN JAPAN, 91t 127-136t 1971

2~Do D. R. HOLT AND E. L. CROM TABLES AND GRAPHS OF THE STABLE PROBABILITY DENSITY

FuNCTiONS JOURN. OF RESEARCH NATLe BUR.STANOt 77B,143-198, 1973

EXTENSIVE DISCUSSION OF THE COMPUTATION OF THE STABLE DENSITIES° REVIEM OF PROPERTIES° DETAILED BIBLIOGRAPHY

2418 J. H. HOLTZNAN ANALYSIS OF DEPENDENCE EFFECTS IN TELEPHONE

TRUNKiNG NETNORKS BELL SYSTEM TECHNICAL JOURN, 50~ 2647-2662, 197l

PROPOSES USEFUL APPROXIMATIONS TO HANDLE DEPENDENCE IN THE COMPUTATIONAL ANALYSIS OF LARGE TELEPHONE TRUNKING NETMORKS

26Zs J° HOPFNER BEHANOLUNG VON PROBLENEN DER ERNEUERUNGSTHEDR|E

MITTELS STOGHASTISCHER SIMULATION OER HOOELLE INAUGURAL-OISSERTATIOM UNIV. HALLEt HALLE A.D.

SAALE, 1971 SIMULATION STUDIES OF RENENAL PROBLEMS

243s A. HORD1JK, 0. L. IGLEHART AND R. SCHASSBERGER DISCRETE TIME METHODS FOR SIMULATING CONTINUOUS

TIME MARKOV CHAINS TECH° REPT° NO 35, OEPT° OF OPERATIONS RESEARCH, STANFORD UNIV° STANFORD CA~ 1975

2 4 ~ D* A. HSU QUEUING TIME FORECASTING NANUSCRIPT~ DEPT. OF ELECTRICAL ENGINEERING,

PRINCETON UNIV. PRINCETON NJt 1975, 3S PP INVESTIGATES A METHOD BASEO ON S ~ULATION AND TIME SERIES TO FORECAST THE QUEUEING TIME OF THE N-TH C~STOMEk AHEAD, GIVEN THE LAST OBSERVEO OUEUEING TIME FOR THE M/M/1 QUEUE

2~5s J . HUg ON THE ~UN~RICAL DETERMINATION OF THE STATE

DISTRIBU11~N IN THE SYSTEM M/M/1 ( iN POLISH NITH RUSSIAN AND ENGLISH SUNMARIES)

ZASTOSONANIA MATEMATYKIt 11t 623-43Te 1970 DISCUSSES THE TIME DEPENDENT BEHAVIOR OF THE

M/M/ I QUEUE BY USING THE EXPLICIT SOLUTION AND ALSO BY NUMERICAL SOLUTION OF THE 81RTH-AND-DEATH EQUATIONS

24be D, HUqTER BOUNDS FOR THE PR~BAB|LITY OF A UNION TECH. REPT* NO. 73~ SER 2 , DEPT° OF STATISTICSo

PRINCETON UNIV° PRINCETON NJ. 1974. TO APPEAR IN JOURN° OF APPLIED PROBABILITY

A GRAPH THEORETIC ALGORITHM IS USED TO COMPUTE THE UPPER BOUND

2~/m D, HU~TER SIMULTANEOUS T-TESTS IN NORMAL MODELS TECH° REPT. NO. BTt SERZo DEPT. OF STATISTICS.

PRINCETON UNIV. PRINCETON NJ, 1976

2¢$ j D, HUqTER BOUNOS FOR THE PROBABILITY OF A UNION OF RANDOM

EVENTS AND APPLICATIONS PH. 0° THESIS9 DEPT. OF STATISTICS, PRINCETON UNZV~

PRINCETON NJ, 1975

Z69m Do HUNTER APPROXIMATING PERCENTAGE POINTS OF STATISTICS

EXPRESSIBLE AS MAXIMA TECH. REPTe NO. 88t SER 2t DEPT= OF STATISTICS,

PRINCETON UNIV. PRINCETON NJt 1975 COMPUTATION OF BOUNDS ON THE DISTRIBUTION OF THE

MAXIMUM OF DEPENDENT RANDOM VAR ~BLES

2508 Do HUNTER AN UPPER BOUND FOR THE PROBABILITY OF A UNION TECH. REPT. RJ 1666, I . B . N . RESEARCH, YORKTONN

H~IGHTS MY, 1975, 1 1 P P , TO APPEAR IN JOURN° OF APPLIaO PROBABILITY, 1976,

REVISED VERSION OF PRINCETON TECH.REPTeNO73t1974

2~18 K. ~UTCHESON ANO L . R. SHENTON SOME MOMENTS OF AN ESTIMATE OF SHANNON~S MEASURE OF

INFORMATION COHHUNICATIONS IN STATISTICS, 3~ 89-94 , 1974

COMPUTER ALGORITHM. SEE ALSO UNDER M.N.SUGG AND K°HUTCHESON

252~ F. K. HNANG AND S° L IN ON 3ENERATING A RANDOH SEQUENCE JOURN. APPLIED PROBABILITY, Bt 366-372~ 1971

K KINDS OF BALLS. A SEQUENCE OF A CERTAIN LENGTH IS ACCEPTABLE IF NO TMO BALLS OF THE SAME KIND ARE ADJACENT. THE OBJECTIVE IS TO GENERATE AN ACCEPTABLE SEQUENCE AT RANDOM.

SEE ALSO UNDER VeR.R° UPPULURI

253S K. H~ANG CYCLIC DECOMPOSITIONS OF FINITE STOCHASTIC SYSTEMS JOURNoOF COMPUTER AND SYSTEM SCIENCES, 9 , 5 6 - 6 B , 1 9 7 6

TECHNIQUES FOR FINDING CYCLIC SUBCLASSES iN FINITE MARKOV CHAINS AND RELATED STRUCTURES

256* b, L. IGLEHART S IUULATING STABLE STOCHAST ~ SYSTEMS V - CDMPARISION OF RATIO ESTIMATORS TO APPEAR IN NAVAL RESEARCH LOGISTICS OUARTERLY,

1975 '

255s D. L* IGLEHART SIMULATING STABLE STOCHASTIC SYSTEHS VI - gUANTZLE ESTIMATION TECH° REPTe NO 86-15t CONTROL ANALYSIS CORPORATION.

PALO ALTO CAt 19TAw 3A PPe TO APPEAR IN JOURNe OF THE AeCoM.

SEE ALSO UNDER H. A. CRANE

25S~ D. L. IGLEHART SIMULATING STABLE STOCHASTIC 5YSTEHS VI I - SELECTING BEST SYSTEM MANUSCRIPT, DEPT. OF OPERATIONS RESEARCH, STANFORD

UNIV. STANFORD CA, 1975, 25 PP PROCEDURES FROM THE THEORY OF SELECTION AND

RANKING ARE APPL|EO TO THE PROBLEM OF SELECTING THE BEST FROM AMONG K SIMULATED SYSTEMS

2STs E° IGNALL AND P. KOLESAR OPTIMAL DISPATCHING OF AN iNFINITE CAPACITY

SHUTTLE: CONTROL AT A SINGLE TERMINAL OPERATIONS RESEARCH, 22, 100~-1026, 1976

ALGORITHMIC ANALYSIS OF OPERATING RULES FOR AN INFIN,TE CAPACITY SHUTTLE BETMEEN TMO STATIONS

258* K° B, IRANI AND V. L . NALLACE ON NETMORK LiNGUiSTICS AND THE CONVERSATIONAL

DESIGN OF OUEUEING NETNORKS JOURN. OF THE A.CeM, 18, 616-629, 1971

SEE ALSO UNDER V. L- NALLACE

259* D. ISAACSON AND V. SPOSITO ANALYZING A MARKOV CHAIN ON A COMPUTER MANUSCRIPT, COMPUTATION CENTER. IOMA STATE ON|V, AMES IA , 1973

AN ALGORITHM FOR THE CLASSIFICATION OF STATES, COMPARE NITH THE BeL. FOX AND D.H. LANOi ALGORITHM

263~ D. ISAACSON AND V. SPOSITO GAUR REFERENCE MANUAL - A COMPUTATIONAL PROCEDURE

TD ANALYZE A MARKOV CHAIN 5TAT LAB, IOWA STATE UNIV, AMES IAt NO 15, 1973

2b le A. J. JAKEMAN A~O R. S. ANDERSSEN A NOTE ON NUMERICAL METHODS FOR THE THIN SECTION

MODEL EIGHT INTERNAT. CONGRESS ON ELECTRON MICROSCOPY,

CANBERRA, 1974, VOL 11, 4 -5 , 1974 DiSCUSSiON OF A PROBLEM ~ STEREOLOGY. FOR

SEVERAL RELATED PAPERS SEE UNDER R.S.ANDERSSEN

262s R.VeJANC,N.T.THONOPDULOSoB.MARKStPeNeTNOI~POUI.OS A QUEUEING MODEL FOR RADIO NETS PART I - METHODOLOGY IEEE TRANSACTIONS ON COMMUNICATIONS, COM-219 6 -13 , 1973

A GUEUEING SYSTEM ARISING IN RADIO NETNORK ENGINEERING EXTENSIVE DISCUSSION OF THE COMPUTATIONAL METHODS USED, WITH INTERPRETATION OF THE RESULTS.

SEE PART Zl UNDER NeT.THOMOPOULOS SEE PART I i I UNOER B. hMARKS

263e U, Lo JAQUETTE APPROXINATZONS TO THE RENEMAL FUNCTION OPERATIONS RESEARCH, 20, 722-727, 1972

2 6 ~ A, JENSEN AND D. G. KENDALL DENUMERABLE MARKOV PROCESSES NITH BOUNDED

GENERATORS - A ROUTINE FOR CALCULATING P I IwJv lNF IN ITY)

JOURN. APPL lED PR3BAB ~ ITY, B, 423-427, 1971 A METHOD BASED ON TAKING SUCCESSIVE SQUARES OF AN

ASSOCIATED STOCHASTIC MATRIX

265e L. JE~SEN A~D E* POLLAK RANDOM SELECTIVE ADVANTAGES OF A GENE IN A FiNiTE

POPULATION JDURN, APPLIED PRO6ABILITY, 6, 19-37, 1969

EXTENSIVE DISCUSSION OF THE NUNER ~AL SOLUTION OF A PARTIAL DIFFERENTIAL EQUATION ARISING IN GENETICS

Journal of Computational and Applied Mathematics, volume 3, no I, 1977. 63

26Se L. JE~SEN SOLVING A SINGULAR DIFFUSION EQUATION OCCURRING IH

POPULATION GENETICS JOURN. APPLIED PROBABILITY 11t X- lEt 1976

CONSIDERS THE EG~JAT mN (PoDoEe) FOR THE CHANGE IN GENE FREQUENCY IN THE PRESENCE OF SELECTION AND RANDOM DRIFT, TNO PARTICULAR CASES ARE SOLVED NUMERICALLY BY USING GEGENBAUER POLYNOMIAL EXPANSIONS° COMPAR ~ONS NITH RESULTS OF MARKOV CHAIN COMPUTATIONS ARE GIVEN

267" P, A° JENSEN AND M, BELLNDRE AN ALGORITHM TO DETERM~E THE R E L I A B ~ Y OF A

COMPLEX SYSTEM IEEE TRANSACTIONS ON RELIABILITYt RIBpZ69-174, 1969

EbBS N. L. JOHNSON AND S, KOTZ DISTRIBUTIONS IN STATISTICS (BOOR) IVQL. I ) DISCRETE DISTRIBUTIONS (VOL. I l l CONTINUOUS UNIVARIATE DISTRIBUTIONS 1 IVOL. l l l ) CONTINUOUS UNIVARIATE OISTR~UTIONS I I IV,L. IVI CONTINUOUS MULTIVARIATE DISTRIBUTIONS J. NILEY AND COt NBN YORKt 1969 1972

A FOUR-VOLUME REFERENCE MOAK ON SPECIAL PROBABILITY D|STRIBUTIONS~ GIVING MANY USEFUL RECURRENCE RELATIONS, ASYMPTOTIC FORMULASt TABLESv GRAPHS AND REFERENCES

2691 R, KALLHAN THREE ALGORITHMS FOR COMPUTING KOLMOGOROV-SMIRNOV

PROBABILITIES NITH ARBITRARY BOUNDARIES AND A CERTIFICATION OF ALGORITHM 68T

MANUSCRIPT, BALL STATE UNIV, MUNCIE INt 1975 FOR ALGORITHM 6BTt SEE UNDER J, POMERANZ

273e U. Re K. KASHYAP AND H. M. SRIVASTAVA ON DISTRIBUTION-FREE ANALYSIS OF M/G/I AND G/M/I QUEUES

NORKING PAPER SERIES HOe 9t INDIAN INSTITUTE OF MAMAGENENTI CALCULTTAt INOIAt 19TS A PERT-LIKE APPROACH TO THE QUEUES GIVEN IN THE

TITLE. SEE ALSO UNDER le GREENBERG

2Tie R, We KATZ COMPUT ~G PROBAB~ ~ ~S ASSOCIATED NITH THE KtRKOV

CHAIN MODEL FOR PRECIPITATION JOURN° APPLIED METEOROLOGY, 1St q53-9S6, 1976

RECURRENCE RELATIONS FOR THE NUMBER OF VISITS TO A STATE

272e S, KATE AND A* G. KONHEIM PRIORITY DISCIPLINES IN A LOOP SYSTEM JOURN. OF THE AeCeM, 21t 360-369~ 1976

FOR RELATED PAPERS ON LOOP SYSTEMS SEE UNDER A,G.KONHEIM

273e L. KAUPPI AND P. OJANTAKANEN APPROXgiAT]ONS TO THE GENERALIZED POISSON FUNCTION ASTIN BULLBTINt St ZlB-226t 1969

STUDY OF THE TOTAL CLAIM DISTRIBUTION OF RISK THEORY

216~ D, G. KENDALL INCIDENCE MATRICESt INTERVAL GRAPHS AND SERIATION

IN ARCHEOLOGY PAC~IC JOURN. OF MATHt ZBt 565-STOt 1969

DESCRIBES A CLASSIFICATION ALGORITHM FOR RELATIVE DATING IN ARCHEOLOGY

ITS* 0, G, KENDALL A§UNOANCE MATRZCES AND SERIATION IN ARCHEOLOGY ZEITSCHRIFT FUR MAHRSCMEINLICHKEITSTHEORIEt ITt

10~-112, 1971 SERIAT ION BY ABUNDANCE RATHER THAN BY ~CIDENCE

OF TYPES

2The Do G* KENDALL SERIATION FROM ABUNDANCE HATREDS IN MATHEMATICS IN THE ARCHEOLOGICAL AND HISTORICAL

SCIENCESt 2IS-EDit EDINBURGH UNIV. PRESSt EUINBURGH, 1971 A TECHNIQUE FOR THE RELAT WE OAT ~G OF

ARCHEOLOGICAL FINDS FROM DIFFERENT SITES IN THE SAME REGION

277* D, G, KENDALL HUNT|~G QUANTA PHILOSOPHo TRANSACTIONS ROYAL SOCIETYt LONDONt A2TB, 231-266, 1976

27B* D. KERRIDGE A NUMERICAL METHOD FOR THE SOLUTION OF QUEUEING

PROBLEMS NEN JDURNo ON STATIST, OPERATIONAL RESEARCHt 2,

3-13, 1966

279* Y, H, KIN, g. E, CAS E~ AND P. M, GHARE A METHOD FOR COMPUTING COMPLEX SYSTEM RELIABILITY IEEE TRANSACTIONS ON RELIAB)LITY~ R21~215-2|9~ 1972

283* J. P, C. KLEIJNEN A~TITHETHIC VARIATES, COMMON RANDOM NUMBERS AND

UPT IMAL COMPUTER TIME ALLOCATION IN SIMULATION MANAGEMENT SCIENCEw 2 | t 1176-118St 1975

Zb l * J. P. C. KLEIJNEN DES IGN AND ANALYSIS OF S ~ULATION - PRACTICAL

STATISTICAL TECHNIQUES TECH. REPT. NO. 7S.OOTt KATHOLIEKE HQGESCHOOL,

TILBURGt THE NETHERLANDSt 1975

282* E. N. KL|MKO AND Me F. NEUTS THE SINGLE SERVER QUEUE IN DISCRETE TIME -

NUMERICAL ANALYSIS I I NAVAL RESEARCH LOGISTICS QUARTERLY,ZOpBOS-B19, 1973

COMPUTAT|ON OF THE MOMENTS OF THE BUSY PERIOD FOR QUEUES OF M/G/I TYPE

283e H. KOBAYASHI SOME RECENT PROGRESS IN ANALYTIC STUOIES OF SYSTEM

PERFORMANCE FIRST USA-JAPAN COMPUTER CONFERENCE, IBO"lBGm 1972

28¢* H, K36AYASHI APPLICATION OF THE DIFFUSION APPROXIMATION TO

QUEUEING NETWORKS I - EQUILIBRIUM QUEUE DISTRIBUTIONS JOURN. OF THE A. CoM, 21, 316-32Bt 1976

GENERAL METHODOLOGY AND SEVERAL NUMERICAL EXAMPLES

2BS~ H. KOBAYASHI APPLICATION OF THE DIFFUSION APPROXIMATION TO

QUEUEING NETNORKS I I - NONEQUILIBRIUM DISTRIBUTIONS AND APPLICATIONS TO COMPUTER MOOELING

JOURN. OF THE A.C.M, 21, 659-669t 1976

286e H. KOBAYASH! AND Me REISER ON GENERAL IZATmN OF JOB ROOTING BEHAVIOR IN

QUEUE|NG NETNORK MODEL IeBeMeRESEARCH REPT. RC $252, I,B.MeTHONAS JeMATSON

RESEARCH CENTERI YORKTONN HEIGHTS NYt 19TSt 20 PP JOB ROUTING MAY BE GOVERNED BY A NARKOV CHAIN OF

ARBITRARY ORDER

28T8 W, E. KOHLER AND do E. BOYCE A NUMERICAL ANALYSIS OF SOHE FIRST ORDER STOCHASTIC

INITIAL VALUE PROBLEMS SIAM JQURN, OF APPLIED HATH! 2Tt |6T-XTDt lqT6

288* A, G° KONHEIM A~D B° MELTER NAITING LINES IN MULTIPLE LOOP SYSTEMS JOURN° OF MATH. ANALYSIS AND APPLt 39, SET-SBOt 19'/2

289~ A. G° KONHEIM SCRVICE EPOCHS IN A LOOP SYSTEM SYMPOSIUM ON COMPUTER COMMUNICATIONS NETNORKS AND

TELE-TRAFFIC, POLYTECHNIC INSTITUTE OF BROOKLYNt 1972

290* A. G. KGNHEIM A~D B. MEISTER SERVICE IN A LOOP SYSTEM JOJRN, 3F THE A,G, Mt 19t 92-108t 19T2

BASIC PAPER ON LOOP SYSTEMS FOR COMMUNICATION NETMORKS CONSISTING OF A PROCESSOR AND N TERMINALS

29IS A.G, KONHEIfl AND 8. ME|STEM DISTRIBUTIONS OF QUEUE LENGTHS ANO NAITING TIMES IN

A LOOP NITH TNO-NAY TRAFFIC JOURN. COHPUTER AND SYSTEM SCIENCES, TmSOB"-SEgt |9?3

EXPLICIT RESULTS ON LOOP SYSTEMS NITH SUBSTANTIAL DISCUSSION OF COMPUTATIONAL TECHNIQUES

292* A, G, KONMEIM A~D B, flEISTER NAITIN5 LINES AND TIMES IN A SYSTEM MITH POLLING JGURN. OF THE AcCeNt 21,670-690t 1976

EXTENSIVE ANALYSIS OF A LOOP SYSTEM IN NHICH TERMINALS ARE SEQUENTIALLY POLLED BY THE PROCESSOR° SOME COMMENTS ON COMPUTATIONAL METHODS

293" A. G. KONHEIM A~D B. NEISTER TMU-NAY TRAFFIC IN LOOP SYSTEMS NETNORKS, | , 2 9 | - ) 0 1 , l i t 2

296" A° G° KONHEIM [HA ININ$ IN A LOBP SYSTEM MANUSCRIPT~ hBeMo THOMAS J° NATSON RESEARCH

CENTER, YORKTONN HEIGHTS NYt 1976 FURTHER RESULTS ON LOOP SYSTEMS. AN APPROXIMATE

ALGORITHMIC HETHO0 |5 GIVEN

~VS* A. G° KONHEIM AND Me REISER A UUEUEING MODEL WITH FINITE ~AITINGRQOM AND

ULUCK|qG MANUS~RIPTf /cOoN° THOMAS J, WATSON RESEARCH

CENTERt YORKTONN HEIGHTS NYt 1976 COMPUTATIONAL ANALYSIS OF A TMO-STAGE QUEUE]NG

MOUEL WIIH A FIN|TE INTERMEDIATE NAITINGROON UNUER MARKOVIAN ASSUMPTIONS


ZqSe L, xosTEN STOCHASTIC THEORY OF A MULTI-ENTRY BUFFER ( I ) DELFT PROGRESS REPORT, SERIES F, MATH. ENGINEERING,

MATHEMATICS AND INFORMATION SCIENCES, 1 ,10 -18 ,1976 EXTENSIVE DISCUSSION OF MODELS AND ALGOR~HMS

RELATED TO BUFFER DESIGN PROBLEMS

297~ L. xOSTEN STOCHASTIC THEORY OF A MULTI-ENTRY BUFFER ( I I ) DELFT PROGRESS REPORT, SERIES F, MATH. ENGINEERING,

MATHEMATICS ANO INFORMATION SCIENCES, 1 ,66 -50 ,1976 EXTENSIVE DISCUSSION OF NOOELS AND ALGORITHMS

RELATED TO BUFFER DESIGN PROBLEMS

29B* L. KOSTEN AND O. VRIEZE STOCHASTIC THEORY OF A MULTI-ENTRY BUFFER ( l / I # DELFT PROGRESS REPORT, SERIES F~ MATH, ENGINEERING,

MATHEMATICS AND INFORMATION S C I E N C E S o l , I 0 3 - I I S , 1975

EXTENSIVE DISCUSSION OF MODELS AND ALGORITHMS RELATED TO BUFFER DESIGN PROBLENG

2g9" E, V. KRISHNAMURTHY AND G. KONISSAR COMPUTER-AIOED RELIABILITY ANALYSIS OF COMPLICATEO

NETNORK$ IEEE TRANSACTIONS ON REL lAB IL ITY , R21t B6-Bq, lg72

A COMPUTER PROGRAM USING NODULAR OECONPOSITION IN RELIABILITY COMPUTATION

3~3" R. J° KRYSC ~3 AqO N. C° SEVERO SOME PROPERTIES OF AM EXTENDED SIMPLE STOCHASTIC

EPIDEMIC MODEL INVOLVING TNO ADDITIONAL PARAMETERS MATHEMATICAL BIOSClENCES, 5, 1 -8 , 1969

3~ le R. J . KRYSGIO AND N. C. SEVERU COMPUTATIONAL ANO ESTIMATION PROCEDURES IN

MULTIDIMENSIONAL RIGHT-SHIFT PROCESSES AND SOME APPLICATIONS

ADVANCES IN APPLIED PROBABILITY, T, 3~g-382, 1975 A TRIANGULARIZATION OF A SYSTEM OF KOLMOGOROV

DIFFERENTIAL EQUATIONS FOR A LARGE CLASS OF MARKOV CHAINS

30~* S* M, KNEREL BOUNDS ON THE PROBABILITY OF THE UNION AND

INTERSECTION OF M EVENTS ADVANCES IN APPLIED PROBABILITY, 7~ 631-648 t 1975

BOUNOS AND ALSO AN ALGORITHM FOR THE COMPUTATION OF THE MOST STRINGENT BOUNOS

333e S, M° KWEREL MOST STRINGENT BOUNDS ON THE PROBABILITY OF THE

UNION AND INTERSECTION OF N EVENTS FOR SYSTENS PARTIALLY SPECIFIED BY S I~S2~ . , e tSK , 2 <- K <= M

JOURN° APPLIED PROBABILITY9 12~ 612-619~ 1975

3 0 ~ M. I * LANIN CALCULAT IN(; THE PROBABILITY OF INFORMATION LOSS IN

CENTRALIZED SUPERVISORY SYSTEMS INTERN, JOURN, COMPUTER NATH~ 1. 73 -87 , 1966

TRANSLATION OF A RUSSIAN PAPER IN AUTOMATION AND REMOTE CONTROL~ 23, 321 FF~ 1962

305* G° No LAUER AND C* P* HAN JOINT DISTRIBUTION FUNCTION OF CERTAIN RATIOS OF

CHI-SQUARE VAR~TES JOURN, STATISTICAL COMPUTATION AND SIMULAT|ON~ 1,

255 -260 , 1972 DISTRIBUTION EXPRESSED IN A CONPUTAT ZONALLY

USEFUL FORM

30S~ S. S, LAVENBERG EFFICIENT ESTIMATION VIA SIMULATION OF NORK-RATES

IN CLOSED ~tJEUE~HO NETWORKS COMPSTAT lgT&~ PROCEEDINGS IN COMPUTATIONAL

STATISTICS, PHYSIGA VERLAGe WIEN~ 3E3-362, 1976

337* S, S. LAVENBERG THE STEADY-STATE QUEUEING TIME DISTRIBUTION FOR THE

N/G/1 FINITE CAPACITY QUEUE MANAGEMENT SCIENCE~ 21~ 501-506, lgTS

COMPUTATION OF MOMENTS USING RECURRENCE RELATIONS FOR THE LAPLACE TRANSFORNS

30BO S, S. LAVENBERG AND G, S. SHEDLER DERIVATION OF CONFIDENCE INTERVALS FOR WORK-RATE

ESTIMATORS IN A CLOSED QUEUEING NETNORK TO APPEAR IN SIAM JOURN. ON COMPUTING~ 6~ 19?5

3 3 ~ S, S° LAVENBERG AND D. Re SLUTZ INTRODUCTION TU REGENERATIVE SIMULATION I . B , N , JOURN, OF RESEARCH AND DEVELOPMENT, 19, 458 -462 , l gT5

SIMULATION METHODS FOR REGENERATIVE PROCESSES

313" E, L. LEESE NUMERICAL METHODS OF DETERMINING THE TRANSIENT

BEHAVIOUR OF QUEUES WITH VARIABLE ARRIVAL RATE IN QUEUEING THEORY, THE ENGL|SH UNIVERSITIES PRESS, LONDON 1964

~ l l s E, Lo LEESE A~D D. W. BOYD NUMERICAL METHODS OF DETERMINING THE TRANSIENT

BEHAVIOR OF QUEUES N|TH VARIABLE ARRIVAL RATES JOURN. CANAD. OPER. RES. SOOt &t 1-13, 1966

CRITICALLY EXAMINES SEVERAL METHODS FOR THE NUNERICAL SOLUTION OF THE TRANSIENT BEHAVIOR OF AN M/N/% QUEUE NITM TIME DEPENDENT ARRIVAL AND SERVICE RATES

~12" P, Ho LESLIE A STOCHASTIC MODEL FOR STUDYING THE PROPERTIES OF

CERTAIN BIOLOGICAL SYSTEMS BY NUMERICAL METHODS BIUMETRIKAf 45t [ 6 - 3 1 t 1958

313" P. H. LESLIE ANO J , C. GONER THE PROPERTIES OF A STOCHASTIC NOBEL FOR TWO

COMPETING SPECIES B1OMETRIKA, 65t 316-3~0t 1958

A SIMULATION STUDY

31~* R. T° LESLIE RECJRRENT COMPOSITE EVENTS JOURN, APPLIEO PROBABILITY9 6t 3~-61 t 1967

RECURSIVE COMPUTATION OF VARIOUS PROBABILITIES FOR RECURRENT EVENTS

315s P, A, W. LEWIS AND G. S, SHEDLER A CYCLIC-QUEUE MODEL OF A SYSTEM OVERHEAD IN

MULT1PROGRANMEO COMPUTER SYSTEMS JOURNo OF THE AeCeN, 18t 19g-220t 1971

SOME DISCUSSION OF NUMERICAL METHODS

316" J . M. LIITTSCHWAGER NATHEHATICAL MODELS FOR PUBLIC UTILITY RATE

REVISIONS MANAGEMENT SCIENCEI 17, B33q'-B353, 1971

317* J , M, L IITTSCHWAGER AND W. F, AMES ON TRANSIENT QUEUES - PRACTICE ANO PEDAGOGY PROC. EIGHT ANNUAL SYMPOSIUM ON THE INTERFACE, LOS

ANGELES CAt ZO6-EI3t 1975 NUMERICAL SOLUTION OF THE DIFFERENTIAL EQUATIONS

FOR THE TRANSIENT CASE

31S* Po LINDBLAD AND H, DEGN A COMPILER FOR OIGITAL COMPUTATION ~ CHEMICAL

KZNETICS AND ITS APPLICATIONN TO OSCILLATORY REACTIONN SCHEMES

ACTA CHEMICA SCANOINAVICA, 21t 791-800, 1967

319" A. LI~DQUIST ON FREDHOLM INTEGRAL EQUATIONS, TOEPLITZ EQUATIONS

AND KALMAN-BUCY FILTERING TO APPEAR IN APPL IED MATH. AND OPTIMIZATIOn, 7 ,1976

320* A° LINDQUEST LINEAR LEAST SQUARES ESTIMATION OF DISCRETE-TIME

STATIONARY PROCESSES BY MEANS OF BACKNARO INNOVATIONS

TO APPEAR IN PROC, INTERNAT. SYMPOSIUM ON CONTROL THEORY9 NUMERICAL METHODS ANO COMPUTER SYSTEMS MODELLING~ RDCQUANCOURTI FRANCE, 19TA~ SPRDqGER VERLAGt 1976

321" A° LIqDQUIST A ~EW ALGORITHM FOR OPTIMAL FILTER ~G OF

DISCRETE-TIME STATIONARY PROCESSES SIAM JOURN° ON CONTROLo 12, 736-TA6t 197A

ALGORITHM FOR COMPUTING THE GAIN MATRICES OF THE KALMAN FILTER

32Zs A, LINDQUIST OPTIMAL FILTERING OF CONTINUOUS-TIME STATIONARY

PROCESSES BY MEANS OF THE BACKNARD INNOVATION PROCESS

SIAM JOURN° ON CONTROL, 12t T4T-T56t lgTA

323* M, O. LOCKS THE MAXIMUM ERROR IN SYSTEM RELIABILITY

~ALCULATIONS BY USING A SUBSET OF THE MINIMAL STATES

[BEE TRANSACTIONS ON RELIABILITY! R21 t231-234 , 1972

324" L. LOMBARDI A DIRECT METHOD FOR THE COMPUTATION OF MAITENG

TIMES NAVAL RESEARCH LOGISTICS QUARTERLY, E t l q 3 - 1 9 T t 1961

AN EFFICIENT ALGORITHM TO COMPUTE THE VALUES OF THE WAITING TIMES OF THE FIRST N CUSTOMERS IN A SYSTEM WITH S PARALLEL SERVERS IF THE VALUES OF THE ARRIVAL TIMES AND SERV ~ E TIMES ARE KNOWN. USEFUL IN SIMULATION OF S-SERVER QUEUES

325* ~, x° LOw OPTIMAL DYNAMR 3PIRATING POLICIES FOR AN M/N/S

QUEUE NITH VARIABLE ARRIVAL RATE PH.O,THESIStUNIV*OF CALIFORNIA,LOS ANGELES CAt 1971

32b* D, W° LOW OPTIMAL PRICING FOR AN UNBOUNDED QUEUE IBM JOURN° OF RESEARCH AND DEVELOPMENT, IRe

2gB-BO2t 1976 STUDY OF A DYNAMICALLY CHANG ~G PR ~ ~G POL ICY

FOR AN H/M/S QUEUE WITH UNLIMITED CAPACITY, ALGORITHM GIVEN


327* D. d. LOk OPTIMAL DYNAMIC PRICING POLICIES FOR AN M/M/S QUEUE OPERATIONS RESEARCH, 22t 545-561e 1975

INCLUDES AN ALGORITHM NHICH MAXIMIZES LONG-RANGE AVERAGE EXPECTED RENARD PER UNIT OF TIME IN A QUEUEING-REHA~D SYSTEN

32B~ L. LUKASZEMSKA AND Ee PLESZCZYNSKA GENERATING A POISSON PROCESS NITH'A TIME DEPENDING

INTENSITY ( IN POLISHt NITH ENGLISH SUI~tARY| ALGORYTMYt T~ 69 -60 , 196T

UISCUSSES SIMULATION PROCEDURES FOR THE PROCESS GIVEN IN THE TITLE

3295 W, LUNON ON THE GENERATION OF RANDOM NUMBERS BI~H AT CHOICE

DISTRIBUTION CONFUTING, 13, 21 -31 t 1974

REARRANGEMENT OF PHYSICALLY GENERATED RANDOM NUMBERS

3 3 ~ D, LUR IE AND He De HARTLEY MACHINE GENERATION OF ORDER STATISTICS FOR

HONTE-CARLO SINULATIDN THE AMERICAN STATISTICIAN. 26~ 26-27 , 1972

331" De LURIE AND Re L. MASON EMPIRICAL INVESTIGATION OF SEVERAL TECHNIQUES FOR

COMPUTER GENERATION OF ORDER STATISTICS COMMUNICATIONS ~ STATISTICS, 2t 363-3T1, 1973

332" ~e MA~K THE PITFALL IN ASSUMING EXPONENTIAL SERVICE TIME IN

QUEUES NEW JOURN. ON STATIST. OPERATIONAL RESEARCH~ 3,

17-21~ 1967

333* M. D. MACLAREN, Ge NARSAGLIA, AND Te BRAY A FAST PROCEDURE FOR GENERATING NORMAL RANDOM

VARIABLES CONHUNICATIONS DF THE A°CeNt 7t 6-10~ 196&

334~ Se NA&HSODDLDD ECCENTRICITIES FOR ~HICH ELLIPSOIDAL PROBABILITIES

ARE GOOD APPROXIMATIONS TO SPHERICAL PROBABILITIES JOURN. STATISTICAL COMPUTATION AND SIMULATION, 3~

369-378~ 197S

335* Be MANDELBROT AND F* ZARNFALLER FIVE PLACE TABLES OF CERTAIN STABLE DISTRIBUTIONS leBeN.RESEARCH REPTeRC 421~YORKTONN HEIGHTS~NY,IqS9

336* De L. MARCH EXACT PROBABILITIES FOR R X C CONTINGENCY TABLES~

ALGORITHM 434 COMNUNICATIONS OF THE AeC,M~ 15t 9q l -ggz~ 1972

EVALUATES THE PROBABILITY OF A GIVEN OBSERVATION 1N R X C CONTINGENCY TABLES

337" De G° NARITSAS A HIGH SPEED AND ACCURACY.DIGITAL GAUSSIAN

GENERATOR OF PSEUDORANOQN NU~ERS IEEE TRANSACT IONS ON COMPUTERS~ C22t 629-636 , 1973

338* He G. MARcHAL, De GROSS AND Ce M. HARRIS APPROXIMATION IN QUEUING MANUSCRIPT, DEPT. DF OPERATIONS ANALYSIS~ UN~Vo OF

TOLEDO~ TOLEDO OH~ 1975, 6 1 P P EXTENSIVE NUMERICAL COMPARISONS OF EXPECTED QUEUE

LENGTHS AND HALTING TIMES NZTH VARIOUS APPROXIMATIONS FOR SEVERAL DF THE CLASSICAL GUEUEING MODELS

339~ B. I ° MARKS STATE PROBABILITIES OF N/M/ I PR~RITY QUEUES OPERATIONS RESEARCHt 21t 9T&-987t 1973

COMPUTATION OF THE STEADY STATE PROBABILITIES OF A PREEMPTIVE AND A NONPREEMPTIVE PRIORITY QUEUE OF M/M/I TYPE

340* Be 1* MARKS* R, Ve JANC~ Ne T* THOMDPDULDS A DUEUEING MODEL FOR RADIO NETS PART I I I - VALIDATION AND REF ~ENENT IEEE TRANSACTIONS ON COMMUNICATIONS, COM-22t

106-123~ 1974 SEE ~ART [ UNDER RaV°JANC~ 1973 SEE PART I1 UNDER NeTeTHONOPOULDS

3&1" G* I * MARKS. R* V. JANC, N* T* THONDPDULDS A PREEMPTIVE PRIORITY RADIO NET QUEUING MODEL TO APPEAR IN IEEE TRANSACTIONS ON CONMUN~ATIONS~

1975 STEADY STATE ANALYSIS OF A TND-LEVEL PREEMPTIVE

PRIORITY RADIO NET UNDER MARKDVIAN ASSUMPTIONS

342* $, MA~SAGLIA DE,BRAT|NO A VARIABLE FROM THE TAIL OF THE NORMAL

DISTRIBUTION TECNNDMETRICS, 6~ 101-102~ 1964

343" J . O, NAYHUGH AND Re E. NCCORNICK STEADY-STATE SOLUTION OF THE QUEUE N/EK/R MANAGEMENT SCIENCEp 14. 692-712, 1968

EXTENS~E DISCUSSION OF THE SOLUTmN OF THE STEADY-STATE EQUATIONS FOR THE N/EK/R QUEUE

34¢* J. 0. NAYHUGH A ~3TE 3N THE Q~EJE M/EK/R MANAGEMENT SCIENCE, | 8 , 512-B13, 1970

345* D. N. N~LEAVEY OPTIMIZING R E L I A B ~ Y N ~ H BACKUP COMPONENTS DOCTORAL THESIS, |NDIANA UNIVt GRADUATE SCHOOL OF

BUSINESSI BLOOMINGTON INt 1973p 64 PPe ALGORITHflS OF NONLINEAR PROGRAMMING APPLIED TO

PROBLEMS OF OPTIMAL REOUNDANCY ALLOCATmN

346* D. ~. HCLEAVEY ON AN ALGORITHM OF GHARE AND TAYLOR OPERATIONS RESEARCHt 21~ 1315-1318t 1973 • CRITICAL COMMENTS ON AN ALGORITHM FOR DETERMINING

THE OPTIMAL REDUNDANCY ALLOCATION IN RELIABILITY THEORY

347* D. W. MCLEAVEY NUMERICAL INVESTIGATION OF OPTIMAL REDUNDANCY IN

SERIES SYSTEMS OPERATIONS RESEARCH, 22 , 1110-11~7, 1976

CRIT ~AL EXAMINATION OF VARIOUS ALGORITHNS FOR THE OPTIMAL REOUNDANCY ALLOCATION |N RELIABILITY THEORY

348* De ~e MCLEAVEY AND Je A. MCLEAVEY PARALLEL OPTIMIZATION METHODS IN STANDBY

RELIABILITY WORKING PAPER HOe 2, SCHOOL DF BUSINESS

ADMINISTRATION, UNZV. OF CONNECTICUT, STORRS CTt 23 PPt 197S

349* Ro C. MILTON AND Je Aa NELDER STAT~T|CAL COMPUTATION (BOOK) ACADEMIC PRESS, MEN YORK, 1969t 462 PP.

PROCEEDINGS OF A CONFERENCEe UNIV* OF NISCONSINe NADISONt N i t 1969e CONTAINS A NU~WBER OF PAPERS ON DATA ANALYSIS, EDUCATION AND ALGORITHMS

353* K, Be MISRA AND Te Se Me RAO RELIABILITY ANALYSIS OF REOUNDANT NETNURKS USING

FLDN GRAPHS |BEE TRANSACTIONS ON RELIABILITYt Rlge 19 -26 t 1970

THE FOLLQNING PAPERS BY Ke B. MISRA AND COAUTHORS DISCUSS MANY ALGORITHMIC ASPECTS OF RELIABILITY EVALUAT ION AND OF THE OPTIMAL REDUNDANCY ALLOCATION PROBLEM, NITH AND NITHOUT LINEAR CONSTRAINTS

351" K, E. MISRA AN ALGORITHM FOR THE RELIABILITY EVALUATION OF

REDUNDANT NETNORKS IEEE TRANSACTIONS ON RELIABIL |TYt R | g t I N b " I B l t 1970

FORTRAN PROGRAM LISTED

352* K. B. MISRA A METHOD OF SOLVING REDUNDANCY OPTIMIZATION

PROBLEMS IEEE TRANSACTIONS ON RELIABILITY, RZOl l lT -12@t 1971

353" K. B. MISRA DYNAMIC PROGRAMNING FORMULATION OF THE REDUNDANCY

ALLOCATTION PROBLEM INTERNAT. JOURN, MATH. EDUCATION IN SCIENCE AND

TECHNOLOGY, 2, 207 -215 , 1971

35~* K. S. MISRA A SIMPLE APPROACH FOR CONSTRAINED REDUNDANCY

nPTIMZATION PROBLEN IEEE TRANSACTIONS ON RELIABILITY, R21, 30-34~ 1972

355~ K, E. MISRA RELIABILITY OPTIMIZATION OF A SERIES-PARALLEL

SYSTEM IEEE TRA~ACTIONS Oq R E L M B L I T Y , R21 ,230 -238 t 1972

356* K. B. MISRA AND C* E° CARTER REDUNDANCY ALLOCATION ;~ SYSTEMS ;A rH MANY STAGES NICROELECTRONICS AND R E L M B I L ~ Y t 12t 223"22Eo 1973

357* K. B. NISRA AND Me D. LJUBDJEVIC OPTIMAL RELIARILITY DESIGN OF A SYSTEM - ANEN LOOK IEEE TRANSACTIONS ON RELIABILITYt R22,ZS~"25Bt 1973

35d* K. B* MISRA AND J . SHARMA RELIAHILITY OPTIMIZATION WITH INTEGER CONSTRAINT

COEFFICIENTS NICROELECTRONICS AND RELIAEILITYt 12t 631-433~ 1973

REDUNDANCY ALLOCATION ~ITH LINEAR CONSTRAINTS

~59" K. B° MISRA AND J . SHARMA RCL ~ O I L | T Y OPTIMIZATION DF A SYSTEM BY ZERO-ONE

PROGRAMMING MICROELECTRONICS AND RELIABILITY. 12~ 229-233t 1973

Journal of Compu~tional and Applied Mathematics, volume 3, no 1, 1977. 66

36~* g. B, MISRA AND J . SHARMA ANEN GEOMETRIC PROGRAMMING FORMULATION FOR A

RELIABILITY PROBLEM INTERNAT, JOURN. ON CONTROL, 18, 4g7-503 , 1973

REOUNDANCY ALLOCATION PROBLEM AS A GEOMETRIC PROGRAMMING PROBLEM

361S K. B. MISRA LEAST SQUARE APPROACH FOR SYSTEM RELIABILITY

OPTIMIZATION INTERNAT. JOURN. ON CONTROL, 17t 199-2U7~ 1973

AN APPROXIMATE SOLUTION BY MEANS OF A LEAST SQUARE PROBLEM

)b2* Ko B. MISRA RELIAB|LITY OPTIMIZATION THROUGH SEQUENTIAL SIMPLEX

SEARCH INTERNATe JOURN. ON CONTROL, 18, 173-183o 1973

363~ K. B. MISRA AND J . SHARMA RELIABILITY OPTIMIZATION OF A SERIES SYSTEM WITH

ACTIVE AND STANDBY REDUNDANCY INTERNAT. JOURN. SYSTEMS SCIENCE, 5 ,1131 -1162 , 1974

366~ K, B. M1SRA OPTIMUM REL IABIL ~Y DESIGN OF A SYSTEM CONTAINING

MIXED REDUNDANCIES TO APPEAR IN IEEE TRANSACTIONS OF THE POMER

ENGINEERING SOCIETY, 1975

365~ g. B. MISRA RELIABILITY DESIGN OF A MAINTAINED SYSTEM MICROELECTRONIGS AND RELIABIL ITY, 13t 495-500 . 1975

36S* T, D. MITSOPOULDS CALCULATION OF SKEWED FREQUENCY DISTRIBUTIONS I IN

GREEK, NITH ENGLISH SUMMARY) PRAKT. AKAO. ATHENON, 679 111-129 , 1972

367* K, MIZUKAMZ OPTIMAL REDUNDANCY FOR MAXIMUM SYSTEM RELIABILITY

BY THE METHOD OF CONVEX AND INTEGER PROGRAMMING OPERATIONS RESEARCH, 16t 392-606 , 1968

368* Fo R, MOORE COMPUTATIONAL MOOEL OF A CLOSED GUEUEING NETMORK

NITH EXPONENTIAL SERVERS IeBeM e JOURN. OF RESEARCH ANO DEVELOPMENT, 16,

567-522m 1972

369* S, C, MOORE APPROXIMATE TECHNIOUES FOR NONSTATIONARY QUEUES PH.D. THESIS, SOUTHERN METHODIST UNIVERSITY, DALLAS

TX, 1972

370* So C. MOORE APPROXIMATING THE BEHAVIOR OF NONSTATIONARY SINGLE

SERVER QUEUES MANUSCRIPT, OEPT, OF I . E , UNIV. OF MISSOURI,

COLUMBIA NO, 1974 ALGOR|THNS FOR SINGLE SERVER QUEUES NITH TIME

VARYING ARRIVAL AND SERVICE PROCESSES. DETAILED COMPARISONS NITH SIMULATION RESULTS

371" H. MOSKONITZ AND R. K. FINK A BAYESIAN ALGORITHM INCORPORATING INSPECTOR ERRORS

FOR QUALITY CONTROL AND AUOITING NANUSCRIPTo SCHOOL OF INDUSTRIAL ADMINISTRATION,

PURDUE UNIVo NEST LAFAYETTE IN. AUGUST 1975, 33PP.

372S R. MADOT AND G. VAYSSE APPARENTEMENT ET IDENTITE -ALGORITHME DU CALCUL

DES COEFFICIENTS O'IDENTITE t I N FRENCH WITH E~GLISN SUMMARYI

B IUNETRICSo 29, 347 -359 t 1973 AN ALGORITHM TO COMPUTE FIFTEEN COEFFICIENTS

WHICH DESCRIBE THE ANCESTRY COMMON TO TNO INDIVIDUALS

373~ R, E. NANCEt U. N. 8HAT, AND Be Ge CLAYBROOK BUSY PERIOD ANALYSIS OF A TIME-SHARING SYSTEM -

TRANSFORM INVERSION JOURN, OF THE A.C.N, 19, 6S3"6639 1972

COMPUTATION OF THE BUSY PERIOD DISTRIBUTION FOR A FINITE M/G/ I QUEUE BY NUMERICAL INVERSION OF A LAPLACE TRANSFORM

374a R, E, NANCE AND U, ~, BHAT A PRO~ESSOR UTILIZATIOON MODEL FOR A MULTIPROCESSDR

COMPUTER SYSTEM TEL l , REPT, CS 75016-R, C,S, DEPT, VZRGINIA

POLYTECHNIC INSTITUTE9 BLAGKSBURG VA, 1975t 28 PP ANALYSIS NITH ALGORITHM OF A QUEUEING MODEL. SEE ALSO UNDER BHAT AND NANCE

3759 A, C. NELSON, d. Re BATTS AND R. L* BEADLES A COMPUTER PROGRAM FOR APPROXIMATING SYSTEM

RELIABILITY IEEE TRANSACTIONS ON RELIABIL ITY, R lg t 6 1 - 6 5 , I9?O

37b~ N, F. NEUTS THE SINGLE SERVER QUEJE IN DISCRETE TIME -

NUMERICAL ANALYSIS 1 NAVAL RESEARCH LOGISTICS QUARTERLY,20,297-306, 1973

TRANSIENT BEHAVIOR OF A BOUNDED DISCRETE VERSION OF AN M(X) /G/1 QUEUE

377s M, F, NEUTS SETTING THE HANDICAP IN BILLIARDS - A NUMERICAL

I~VESTIGATION MATHEMATICS MAGAZ ~ E , 66 , 119-127, 1973

A CLASSROOM EXAMPLE

378* M. F. NEUT$ AND E. ~. KLIMKO THE SINGLE SERVER QUEUE IN OISGRETE T ~E NUMERICAL ANALYSIS I l l NAVAL RESEARCH LOGISTICS GUARTERLYt2OtSST-56Tt 1973

ALGORITHMIC ANALYSIS OF THE STATIONARY DISTRIBUTIONS FOR THE D~CRETE M(XI /G/1 QUEUE

379* M. F. NEUTS SOME PROBLEMS IN COMPUTATIONAL PROBABILITY PROG. SYMPOSIA IN APPLIEO MATH, AMER. MATH. SOL,

2U, 145-151, 1976 A SURVEY PAPER

383* M. F. NEUTS COMPUTATIONAL USES OF THE METHOD OF PHASES IN THE

THEORY OF QUEUES COMPUTERS AND HATH. NITH APPL, 1, 151-166, 19T5

~UEUES OF M/G/1 TYPE IN WHICH THE SERVICE TIME DISTRIBUTION IS OF PHASE TYPE

381~ M. F. NEUTS AND C. C° CARSON SOME COMPUTATIONAL PROBLEMS RELATED TO MULTINOMIAL

TR IALS TU APPEAR IN CANAD. JOURN. OF STATISTICS

COMPUTATION OF SEVERAL DISTRIBUTIONS RELATED TO MALTING TIMES AND SELECTION AND RANKING PROBLEMS FOR NULTINOMIAL TRIALS

382* M, F. NEUTS PROBABILITY DISTRIBUTIONS OF PHASE TYPE APPEARED 1N LIBER AMICORUM PROF. OR, H. FLORIN,

LEUVEN, BELGIUM 173-206, 1975 A COMPUTATIONALLY USEFUL CLASS OF OISTRIBUTIONS

FOR NON-NEGATIVE RANOOM VARIABLES

3B3 ' M, F, NEUTS A SURVEY OF EXACT COMPUTATIONAL METHODS FOR QUEUES PROC. EIGHT ANNUAL SYMPOSIUM ON THE INTERFACE, LOS

ANGELES CA, 201-205

38~* M, F, NEUTS COMPUTATIONAL PROBLEMS RELATED TO THE 'GALTO~-NATSON

PROCESS TECH, REP, NO, 402, PURDUE MIMED SERIES, DEPT. OF

STATISTICS PURDUE UNIV,NEST LAFAYETTE INelqTSo53PP COMPUTATION OF THE SUCCESSIVE GENERATION SIZES

AND OF THE MAXIMUM GENERATION SIZE, APPLIED TO A PROBLEM RELATED TO THE H/G/1 QUEUE, PROGRAM LISTINGS AND EXAMPLES GIVEN IN APPENDIX

3USe N. F. NEUTS ALGORITHMS FOR THE NAITING TIME DISTRIBUTIONS UNDER

VARIOUS QUEUE DISCIPLINES IN THE M/G/ I QUEUE MITH SERVICE TIME DISTRIBUTIONS OF PHASE TYPE

TECH. REPT. NO. 420m PURDUE MINED SERIES, DEPT. OF STAT, PURDUE UNIV, N. LAFAYETTE IN, 19TB

CONSIDERS THE LCFS, FGFS, SIRO DISCIPLINES AND THE BUSY PERIOD. TRUNCATED INFINITE SYSTEMS OF LINEAR DIFFERENTIAL EQUATIONS MITH CONSTANT COEFFICIENTS ARE SOLVED AND THE DISTRIBUTIONS OF THE WAITING TIMES ARE EXPRESSED IN TERMS OF THE SOLUTIONS FORTRAN PROGRAM AND EXAMPLES DF OUTPUT GIVEN IN APPENDIX

38b* M, ~, NEUTS MOMENT FORMULAS FOR THE MARKOV RENENAL BRANCHING

PROCESS TECH, REPT. N~. 4 3 4 , PURDUE MIMEO SERIES, DEPT. OF

STATISTICS, PUROUE UNIV, N. LAFAYETTE IN, 1975 DISCUSSES ALGORITHMS FOR THE MOMENT MATRICES OF

THE TIME TILL EXTINCT)OF ON THE MARKOV RENEHAL BRANCHING MODEL. BASIC TO THE STUDY OF THE BUSY PERIDD AND THE STEADY-STATE DISTRIBUTIONS OF A LARGE NUMBER OF QUEUEING MODELS

387* M, F. NEUTS THE EFFECT OF CHANGE-OVER TIMES ON THE M/G/ I OUEUE

WITH SEVERAL TYPES OF CUSTOMERS TECH. RE PT. NO. 461t PURDUE MIMEO SERIES, OEPT. OF

STATISTICS, PURDUE UNIV, W, LAFAYETTE IN, 1976 CONTAINS A LARGE NUMBER OF COMPUTATIONALLY

EXPLICIT RESULTS ON THE M/G/ I QUEUE NITH SEVERAL TYPES OF CUSTOMERS, IN WHICH THERE IS A CHANGE-OVER TIME WHENEVER A CUSTOMER OF A DIFFERENT TYPE BEGINS A SERVICE. THE SUCCESSIVE CUSTOMER TYPES MAY FORM A MARKOV CHA ~0 FORTRAN PROGRAM LISTED,

Journal of Computational and Applied lVhthematics, volume 3, no 1, 1977. 67

3BB* J* E. NORMAN AND L. E. CANNON A COMPUTER PROGRAM FOR THE GENERATION OF RANDOM VAN IABLES FROM ANY DISCRETE DISTRIBUTION

JOURN. STATISTICAL COHPUTATION AND SIMULATIONt 1~ 331-368t 1972

389* S, A. NOZAK I AND S. M, RUSS APPROXIMATIONS IN MULTI-SERVER POISSON QUEUES MANUSGRI PTv OPERATIONS RESEARCH CENTERt UNIV. OF CALIFORNIAv RERKELEY CA~ 19?5t 19 PP. NUMERICAL INVESTIGATION OF AN APPROXIMATION TO

THE HEAR NAIT|NG TIME IN THE N/G/K QUEUE

393* A. ~. NUTTALL NUMERICAL EVALUATION DF CUMULATIVE PRUBABILITY

DISTRIBUTION FUNCTIONS DIRECTLY FROM CHARACTERISTIC FUNCTIONS

NUSL REPT. NO 1032t NAVY UNDERNATER SOUND LAB~ NEN LONDON CTt 1969

391" A. Ho NUTTALL ALTERNATE FORMS AND COMPUTATIONAL CONSIDERATIONS

FOR NUMERICAL EVALUATION OF CUMULATIVE PROBABILITY DISTRIBUTIONS FROM CHARACTERISTIC FUNCTIONS

NUSC REPT. NO NL-3012, NAVAL UNOERNATER SYSTEMS CENTER~ NEN LONDON ~T~ 1970 FORMS SUITABLE FOR USE OF THE FAST FOURIER

TRANSFORM

392e R. Eo OOEH THE DISTRIBUTION OF THE NAX~UN SUM OF RANKS TECHNOMETRICS 9~ ETl-ZTBt 1967

CONSIDERS A SLIPPAGE TEST FOR C SAMPLES RASED ON THE MAXIMUM SUM OF RANKS. EACH 3AMPLE IS OF SIZE N. DISCUSSES THE COMPUTATION OF THE DISTRIBUTION OF THE TEST STATISTIC.

393~ R. E. ODEH DIRECT COMPUTATION OF THE UPPER TA ~S OF THE DISTRIBUTION OF THE MAXIMUM RANK SUN

PRO£o CONF. NUMERICAL HATHt UNIV. OF NANITOBAx ~INNIPEGt ~ 3 - ~ 3 ~ 1971 CDHPUTATION OF THE TAIL OF THE EXACT DISTRIBUTION

DF THE MAX[NUN RANK SUM FOR C SAMPLES OF SIZE N FROM A POPULATION ~ITH A CONTINUOUS DISTRIBUTION

396* P. Lo OOELL AND H~ P. OECELL JR. ON COMPUTING THE FIXED-POINT PROBABILITY VECTOR OF

ERGODIC TRANSITION MATRICES JOURN, OF THE A.CeH~ 16~ 765-?68~ 1967

395" R. M. OLIVER TABLE OF THE NAITING TIRE DISTRIBUTION FOR THE CONSTANT SERVICE QUEUE (M/O/ i ) INTER~iAT. JOURN. OF COMPUTER MATH~ 2t 3~-56t 1968

COMPUTES THE STATIONARYDISTRIEUTION OF THE NAITING TIME FOR THE N/D/I QUEUE BY USING AN INVERTED EXPRESSION DERIVED FROM THE POLLACZEK-KH INCH|N FORMULAo EXTENSIVE TABLES

39~e S. ~. OLSON THE NUNE RXGAL SOLUTION OF TRANSIENT QUEUEING

PROBLEMS TECHe REPT. PAA-TRZ-7Et SYSTEMS ANALYSIS DIV* PLANS

AND ANALYSIS DIR~ U,S. ARHY NEAPONS CORNAND~ ROCK ISLAND IL 1972~ B7 PP VARIOUS MARKOV~N QUEUES SOLVED~BY RUNGE-KUTTA

AND OTHER METHUDS. FORTRAN PROGRAMS LISTED

39T~ R. K. OTNES AND L. ENiX;HSON DIGITAL TIME SERIES ANALYS~ IBOOKI JOHN NILEYt NEN YORK NYt 1972~ 667 PP

EXTENSIVE DZSCUSS|ON OF COMPUTATIONAL METHODS

39B* £. L. OVERSTREET JR THE QUADRATIC CONGRUENTIAL METHOD OF RANO3N NUMBER GENERATION

PH, DeTHESIS~ SOUTHERN METHODIST UNIVeDALLAS Ti t1973

399e E. S. PAGE ON HONTE CARLO METHODS IN CONGESTION PROBLEMS I - SEARCHING FOR AN OPT[NUN IN DISCRETE SITUATIONS OPERATIONS RESEARCHt 13~ 291-299t 1965

603* E~ So PAGE ON MONTE CARLO NETHDOS IN CONGESTION PROBLERS I I - SIMULATION OF QUEUE|NG SYSTEMS OPERATIONS RESEARCH, 13~ 300-305~ 1965

USE OF ANTITHETIC VARIATES TO REDUCE THE VARIANCE IN ESTIMATION OF QUEUES

601e B, PASUREK AND Ce g. NOQDS IOE A RECURS|VE ALGORITHM FOR COMPUTING SERIAL AUTOCONRELATIONS OF TINES IN AN M/G/I QUEUE

MANUSCRIPT~ DEPT. OF SYSTEMS ENGINEER[NG~ CARLETON UNIV, OTTANA ON~ CANADA~ 19759 29 PP

THE AUTUGORRELATION FUNCTION OF THE TINES IN SYSTEM OF THE FIRST N CUSTOMERS ARE RECURSIVELY COMPUTED, AN EMPIRICAL FORMULA FOR THE HEAVY TRAFFIC APPROXIMATION IS DEN IVED ON THE BASIS OF THE COMPUTATIONAL RESULTS

602~ C, C, PRICE. GQ P. H. STYAN AND P. Go WACHTER COHPUTAT ]ON OF THE STATIONARY D ISTR IBUTION OFA

MARKOV CHAIN TECH. REPT. NO, 128v INST. MATH. STUDIES IN SOCIAL

$CZENCESt STANFORD UNIVt STANFORU CAt 1976 TO APPEAR IN JOURN.OF STATZST|CAL COMPUTATION AND

~IMULATION COMPARISON OF EIGHT D]FFERENT ALGORITHMS

¢J)8 J. A, PARSONS SURVlYAL PRORABILITXES ASSUCIATED WITH CROSSING

F1ELbS CUNTAINING ABSORPTION POINTS NAVAL RESEARCH LOGISTICS QUARTERLYt 21t 61 -5 [ t 1976

~ISCUSSE$ A CONPUTAT IONALLY CONVENIENT APPROACH TU THC HODEL TREATED BY SeZACK$ AND D.GOLDFARBp IN THE SANE JOURNALt 13t 35-68t 1966

636e 5. PERRAK[S AND C. HEN IN THE EVALUATION OF RISKY INVESTMENTS ~ITH RANDOM TIMING OF GASH RETURNS

MANAGEMENT SCIENCEt 21v T9-B6t 1976 A COMPUTATIONAL TECHNIQUE FOR THE EVALUATION OF

THE DISTRIBUTION OF THE NET PRESENT VALUE OF AN INVESTMENT CASH INFLOWS OCCUR AT RANDOM TIME POINTS

6d5. Pe H~ PESKUN OPTIRUM MONTE-CARLO SAMPLING USING MARKOV CHAINS BIOMETRIKAt 60t 607-612t 1973

CONSTRUCTION OF A FIN ~E MARKOV CHA~ NH ~H IS USEFUL IN A SIHULATION METHOD

6~be E, PESONEN COMPUTATION OF THE POISSON PROCESS 8Y MEANS OF

DIVERGENT SERIES SKANDINAVISK AKTUARIETIDSKRIFT(SUPPL) BEtZ~P.-33e1969

PDISSON MIXTURES OF SUCCESSIVE CONVOLUTIONS OF A DISTRIBUTION. REVIEW OF SEVERAL METHODS

6U7. E. PESONEN NP-APPROXIMATION 3F RISK PROCESSES SKANOINAVISK AKTUARIETIDSKRIFT(SUPPL) 52163-B3wlOb9

IHVERS ION OF EDGENORTH EXPANSIONS

60B* Ue T, PHILLIPS AND C. S. BE|GHTLER PROCEDURES FOR GENERATING GAMMA VARIATES NITH NON-INTEGER PARAMETER SET

JOURN, STATISTICAL COMPUTATION AND SIMULATIONt I t 197-208t 19?2

~09" E. POLLAK BOUNDS FOR CERTAIN BRANCHING PROCESSES JOURN. APPLIEO PROBABILITYt 6t 201-206t 1969

COMPUTATION OF A CONSTANT ARISING IN BOUNDS ON THE ABSORPTION PROBABILITIES

613S E. POLLAK ON SURVI.VAL PROBABILITIES AND EXTINCTION TIMES FOR

SOME BRANCHING PROCESSES JOURN, APPLIED PROBABILITY~ E, 633-656t 1971

COflPUTATIONS OF UPPER AND LONER BOUNDS FOR A NUMBER OF NUMERICAL FEATURES OF THE GALTON-MATSON PROCESS

61 l * E, PDLLAK SURVIVAL PROBABILITIES ANO EXTINCTION TIMES FOR

SOME MULTITYPE BRANCHING PROCESSES ADVANCES APPLIED PROBAEILITYt 6t 66&"462m 19?6

COMPUTATION OF BOUNDS FOR ABSORPTION PROBABILITIES

612" S. M. POLLOCK A MODEL FOR EVALUATING GOLF HANDICAPPING OPERATIONS RESEARCHp 22t 1060-1050t 1976

NUMERICAL INVESTIGATION OF VARIOUS HANDICAPPING RULES FOR GOLF

¢13" J* POqERANZ EXACT CUMULATIVE DISTRIBUTION OF THE

KOLNOGUROV-SMIRNOV STATIST~ FOR SMALL SAMPLES COMMUNICATIONS OF THE AeCeM~ ALGORITHM 6BTt 179 733-706t 1974

FORTRAN PROGRAq LISTED

616" J. PO~STEIN THEORY AND NUMERICAL SOLUTION OF A DISCRETE

QUEUEING PROBLEM STATISTICA NEERLANDICA~ 20t 139-152. 1976

COMPUTATION OF THE STATIONARY MALTING TIME DISTRIBUTION FOR A DISCRETE GX/G/I QUEUE NITH FINITE ZNTERARRIVAL AND SERVICE TIMES

6~5" S. H. PRESTONt ~o KEYFITZ AND R. SCHDEN CAUSE-OF-DEATH LIFE TABLES - APPLICATION OF ANEN

TECHNIQUE TO NORLONIDE DATA TRAMS, SOCIETY ACTUARIESt ZSt 83-1U9~ 1973

TECHNIQUE TO HANDLE THE COMPUTATION OF L1F~ TABLES FOR INCREASING POPULATIONS

616* Mo P, UUIHE BOJNDS FUR THE EXTINCTION PROBABILITY OF A SIMPLE BRANCHING PROCESS

MANUSCRIPT~ TO APPEAR IN JOURN. APPLIED P~OBABILITYt 1975

Journal of Compuracion~l and Applied Mathematics, volume 3, no 1, 1977. 68

417" B. RABINOVITCH THE MONr~ CARLO METHOD - PLOTTING THE COURSE OF COMPLEX REACT IONS

JOUflN. CHEMICAL EDUCATION* 46, 262-26B, 1969 SEVERAL PEDAGOGICAL EXAMPLES IN THE KINETICS OF

CHEMICAL REACTIONS

418e R. RAJAGOPAL QUEUEING NITH BALKING AND RENEGING M.S, THESIS, DEPT. I . E . AND MANAG. ENG, UNIV. OF

BONA* 1973. 79 PP ANALYTIC AND ALGORITHMIC SOLUTIONS* FORTRAN

PROGRAMS LISTED

419~ S* No RAJU AND iJ. N. BHAT AN IMBEDDED NARKOV CHAIN ANALYSIS FOR FINITE GUEUES - AN ANALYTICAL APPROACH TO NURERICAL RESULTS TECH. REPTe NO, IEOR TSOOB* DEPT* OF b e e AND OeR*

SOUTHERN METHODIST UNIV, DALLAS TX, L975, 26 PP ELEMENTARY PROPERTIES OF NEARLY TRIANGULAR

TRANSITION PROBABILITY MATRICES

4ZOs J, S. Rf BERG AMD 8. M. SCHMEISER AN APPROXIMATE METHOD FOR GENERATING SYMMETRIC RANDOM VARIABLES

COMMUNICATIONS OF THE AeC.M, 15, 967-990, 1972

4Zle J* S. RAMBERG AND B. N. SCHNE ISER AN APPROXIMATE NETHOD FOR GENERATING ASYMMETRIC

RANDOM VARIABLES CONWJNICATIONS OF TNE AcCeNt ].Tt 78-B2, 1974

422~' P* H, RAN/G THE GALrON-NATSON BRANCHING PROCESS PHeDo THESIS, DEPT. OF MATH AND STAT, CASE HESTERN

RESERVE UN IV. CLEVELAND OH, 19T4 NUMERICAL ANALYSES OF THE SUCCESSIVE GENERATIUN

SIZE DISTRIBUTIONS CORRESPONDING TO VARIOUS OFFSPRING DI~TRIBUT IONs. COMPUTATION OF MOMENTS AND DLSCUSSL~N OF THE DISTR|BUT/ON OF THE LIMIT RANDON VARIABLE Me

4Z3* N. J . RAO* D. RAMKRISHNA AND Je De BORNANKER NONLINEAR STQCHAST 1C S II~LAT ION OF ST IRRED TANK

RE ACT 10NS CHEMICAL ENGI24EERING SCIENCE, 29, 1193-1204, 1974

SIMULATION APPROACH TO A NONLINEAR STOCHASTIC DIFFERENTIAL EQUATION

4Z~e R, R. READ ON THE OUTPUT OF pARALLEL EXPONENTIAL SERVICE CHANNELS

NAVAL RESEARCH LOG IST ICS DUARTERLY,16,555-STZ, 196g STUDIES THE OUTPUT OF A LARGE NUMBER OF

EXPONENTIAL SERVICE UNITS PROCESSrNG A FIXED BACKLOG OF CUSTOMERS. EXTENSIVE DISCUSSION OF NURER ICAL SOLUT IONS AND APPROX |NATIONS

425~ F. C. REED OPTIMAL CONTROL OF A QUEUEING SYSTEM NITH VARIABLE

SERVICE RATES, UNCERTA IN CUSTOMER SAT ISFACTION AND FINITE MALTING ROOM

TECH. REP. NO. 166t DEPTSe OF OoR. AND STATI STANFORD UNIV. STANFORD CA, IS PP* 1974

COMPUTAT ION OF THE VALUES OF A DEC|S 10N PARAMETER

426~ N, REISER AND H. KOBAYASHi RECURSIVE ALGORITHMS FOR GENERAL QUEUEING NETWORKS

NITH EXPONENT IAL SERVERS TECHNICAL REPORT, |eBeH* RESEARCH RC 4254* 1973t Z5

427S R, REISER AND H. KOBAYASNI NUMERICAL SDLUT ION OF SENICLOSED EXPONENTIAL SERVER

QUEUE|NG NETNURKS PROCEEDINGS OF THE 7-TH ASELONAR CONFERENCE ON

CIRCUITS AND SYSTEMS, ASILONAR, 1973

628~ N. REISER AND H. KOBAYASHI QUEUEING NETNORKS NITH SEVERAL CLOSED SUBCHAINS -

THEORY AND COMPUTATIONAL ALGORITHMS leBeN* RESEARCH KEPT. RC 4919. xgTAe TO APPEAR IN I.BeHo JOURN. RESEARCH AND DEVELOPMENT, 1975

~29~ M. REISER AND N* KOBAYASHZ NUMERICAL METHODS IN GUEUEING METMDRKS PROC. EIGHT ANNUAL SYMPOSIUM OM THE INTERFACE, LOS ANGELES CA, 196-200, 1975

VARIOUS EXTENSIONS OF THE ALGORITHMS FOR JACKSON NETNORKS

430e N. REISER AND He KOBAYASHI HORNER-S RULE FOR THE EVALUATION OF GENERAL CLOSED

QUEUE ING NETWORKS I. BeN. RESEARCH REPT. RC 5219, Te J* NATSON RESEARCH CENTER YORKTONN HEIGHTS, 1975. TO APPEAR IN CO~qUNICATIONS OF THE AeCeNe EFFICIENT ALGORITHM FOR THE EVALUATION OF THE

STATIONARY PRO8ABILITIES IN JACKSON NETWORKS

4 3 1 . G. RDSSA DIE ANALYSE VON ENPIRISCH VERTE KTEN ZUFALLSGROSSEN

AUF DER ANALOGRECHNER I IN GERMAN, NITH POLISH SLNtNARV )

ZASTOSOHMIA HATEMATYKIt 12, I S S - I S | I 1971 VISUAL F/TT/PIG OF GENERAL lIED ERLANG DISTR IOUTION

BY MEANS OF THE ANALOG COMPUTER

432e H. RUDIN JR PERFORMANCE OF S|NPLE HULTIPLEXER-CONCENTRATORS FOR

DATA CONNUN ICATION IEEE TRANSACTIONS ON COPNUNICATIONS, CON-19, 178-187, 1971

EXTENSIVE COMMENTS ON COMPUTATIONAL ASPECTS OF THE HOOEL

433* H. RUDIN JR AN APPROXIMATE MODEL AND ANALYSIS FOR A QUEUE NITH

HIGHLY CLUSTERED ARRIVALS SEVENTH INTERNATe TELETRAFFIC CONGRESS, STOCIUiOLH

1973, ITC T, 325/1-4t lg?3

43ko I. SAqiN ON THE LEAST POSITIVE ROOT OF THE EQUATION g t g l Z )

IN QUEUEING THEORY JQURN. CANADo OPER® RES. SOC, 8, 109t | gT0

SOLUTION BY flEANS OF THE FALSE POSITION RETHO0. APPLIED TO THE GI/M/1 QUEUE

435~ R. SCHASSBERGER E iN NARTESYSTEM R iT ZNE ! PARALLELEN NARTESCHLANGEN

(ENGLISH SUMMARY) COMPUTING, 3~ 110-124t 196B

CONSIDERS TNO PARALLEL QUEUES NITN PDISSON ARRIVALS AND EXPONENTIAL SERV ICE T INESe CUSTOMERS JOINS THE SHORTEST QUEUE UFON THEIR ARRIVAL

43S~ R. SCHRSSB~RGER A SERVICE SYSTEM NITH TNO PARALLEL QUEUESe IGERNAN

SUMMARY ) COMPUTI~IGt 4, Z**-Z9t 1969

DISCUSSES THE NUMERICAL SOLUTION OF THE QUEUE STUDIED IN THE PRECEDING REFERENCE

437* P. SCHETTLER A COMPUTER PROBLEM IN 'STAT |STICAL THERNOOYNANICS JOURN. CHEMICAL EDUCATION, S1, 2S0-2S1, 1174

A COMPUTER SIMULATION OF THE 80LTZNANN DISTRIBUTION PRESENTED AS A PEDAGOGICAL EX&IPLE

438s E. SCHINCKE AND J . HOPFNER ERZEUGUNG VON PSEUOOZUFALLSZAHLENFOLGEN NIT

STUCKNEISE POLYG~ALER VERTEILUNG COMPUTING, 9, 63-6B, 1972

GENERATING RANDOM VARIABLES NITH A PIECE-RISE LINEAR PROBABILITY DISTRIBUTION

~39e E. SCHiNCKE AND He qEUBERT S II~iLAT IONSNODELLE FUR LANGFRISTIGE

LAGERHALTUNGSSYSTENE NANUSCRI PT, M3JtT I N LUTHER UN IV, HALL E-N I TTENBERG, 1975

S IRULATZON OF INVENTORY PROBLEMS INVOLVING LONG DELAYS

• 43* G, SCHLENKER NUMERICAL METNDDS iN RENENAL THEORY TECH. REPT. OR-be-2, MEAPONS OPERATIONS RESEARCH,

U.S. ARMY tlEAPONS CONNANO, ROCK ISLAND ARSENAL, ROCK ISLANC IL, 296B, 126 PP

EXANINES VAR |QUS METHODS OF COMPUTAI~ION FOR THE RENENAL FUNCTION. FORTRAN PROGRAMS LISTED

~ 1 ~ Be SCNDRR ON THE CHOICE OF THE CLASS INTERVALS IN THE

APPLICATION OF THE *HI-SQUARE TEST NATHeOPERATIONSFORSCHeUND ~;TRTISTIK, S, SS7-)TT, | l i r l4

EXAMINES THE CHOICE OF THE CLASS INTERVALS FOR THE CHI-SQUARE TEST. ALGORITHMS D I S H E D &NO TABLES OF RESULTS GIVEN

442'~ B. SCHORR PRgGRAMS FOR THE LANDAU AND THE VAV/LOV

DISTRIBUTIONS AND THE CORRESPONDING RANDOM NUltERS COMPUTER PNYS;CS CONHUNICATIONS, 7, 21S-ZEA, 19"/4

4~3~ B. SCqORR NUMERICAL INVERSION OF A CLASS OF CHARACTERISTIC

FUNCTIONS BIT, 15, 94p-lO2, 1975

~ k e ~. R. SCHUCAMY 'ORDER STATISTICS IN SIMULATION

JOURN. STATISTICAL COMPUTATION AND SIMULATION, 1, 281-286~ 19T2

445~ H. Le SEAL SIMULATION DP THE RUIN POTENTIAL OF NDNL|FE

INSURANCE COMPANIES TRAMS* SOCIETY OF ArTUARIES, 21, 563-SBS, 1969


646 s H. L, SEAL PROBABILITY DISTRIBUTIONS OF AGGREGATE SICKNESS

DURATIONS SKAND)NAVISK AKTUARIETIDSKR/FT, 53, 193-206, 1970

647* H, L. SEAL NUMERICAL CALCULATION OF THE BOHNAN-ES$CHER FAMILY

OF COFNOLUTION'NiKEO NEGATIVE BINOMIAL DISTRIBUTION FUNCTIONS

MITTEILUNGEN VEREIN. SCHNEIZ, VERSICHERUNGSMATHEMATIKER, T l t 71-96 t 1971

66B~ He Le SEAL NUMERICAL CALCULATION OF THE PRDBABILITY 3F RUIN IN

THE POISSON/EXPONENTIAL CASE N ITTE|LUNGEN VERE~. SCItWEIZ.

VERSICHERUNGSNATHENATIKERt 72, 77-100, 1972

6698 H. L. SEAL THE NUMERICAL CALCULATION OF U(MtT) , THE

PROBABILITY OF NON-RUIN IN AN INTERVAL )OtT) SCANDINAVIAN ACTUARIAL JQURN, ,121 -139 , 1976

6B3S ~, L. SEAL APPROXIMATIONS TO RISK THEORY'S F IX ,T ) BY MEANS OF

THE GAMMA DISTRiBUTiON MANUSCRIPT t ECOLE POLYTECHNIQUE FEDERALE DE

LAUSANNE, SMITZERLAND~ 1974, 6 PP CRITICAL COMMENTS AND NUMERICAL COMPARISONS OF

THE NORMAL PONER METHODS AND THE GAMMA APPROXiMATiON FOR THE TOTAL CLAIM DiSTRIBUTiON

6 5 1 . D. ~, R. SEELEY THE SPANNING TREE STRUCTURE OF STATIONARY MARKOV

CHAINS REVUE BELGE DE STATISTIQUE, D'INFORMATIOUE ET DE

RECHERCHE OPERATIONNELLEt 13t 23-611 lOT4 GRAPH THEORETIC APPROACH TO THE STATIONARY

PROBABILITIES

65Z~ q, SEGAL A MEN COMPUTATIONAL PROCEDURE FOR THE EQUIVALENT

RANDOM METHOD NANUSCRg PTt BELL TELEPHONE LABS, HOLMDEL NJe 1976

433" N, C. SEVERO AND No ZELEN NORMAL APPROXINAT|DN TO THE~HI-SGUARE AND

NON-CENTRAL F PROBABILITY FUNCTIONS BIONETRIKAw 47, 411-416t l g60

656~ N. G. SEVERD TMO THEORENS ON DIFFERENTIAL DIFFERENCE EQUATIONS

AND APPLICATIONS TO EPIDEMIC THEORY JOURN. APPL lED PROBAB IL ITY, At 271-280, 1967

DISCUSSION OF AN ITERATIVE SOLUTION METHOD

655" N. C. SEVERO A RECURSION THEOREM ON SOLV~G

DIFFERENTIAL-DiFFERENCE EQUATIONS AND APPLICATIONS TO SOME STOCHASTIC PROCESSES

JDURN. APPLIED PROBABIL iTYt 6, 673-681, 1969

• 5 6 * N, C, SEVERO GENERALIZATIONS OF SOME STOCHASTIC EPIDEMIC MODELS MATHEMATICAL BIOSCIENCE$~ 6, 395-40Zt 1969

FURTHER APPLICATIONS OF THE RECURSIVE METHODS DEVELOPED BY THIS AUTHOR

457~ J . SHARMA AND K, V. VENKATESNARAN A DIRECT METHO0 FOR MAXIMIZING SYSTEM REL IAB IL~Y IEEE TRANSACTIONS ON RELIABILITY, RZOtZSA-ESOt 1971

65B* G. S. SHEDLER A OUEUEING MODEL OF A MULTIPROGRAMNED COMPUTER NITH

A TND-LEVEL STORAGE SYSTEM COMMUNICATIONS OF THE AeC=N~ 16, 3-10, 1973

COMPUTATION OF STEADY STATE PROBABILITIES

6sg~ A. N. SHOGAN CONFUTATION OF THE RELIABILITY OF A STOCHASTIC

NETNORK TECH. REP. NO. 1 b i t DEPT. OF STATISTICS, STANFORD

UNIV. STANFORD CAt 1976

463J T, SZPOSw J . TDTH AND P. ERDI STOCHASTIC SIMULATION OF CHEMICAL REACTIONS BY

DIG ~AL COMPUTER 1 - THE MODEL REACTION KINETICS AND CATALYSIS LETTERS, I t

113-117, 1976

~6IS T. SIPOS, J, TOTH AND P. ERDI STOCHASTIC SiHULATION OF CHEMICAL REACTIONS BY

DIGITAL COMPUTER I I - APPLICATIONS REACTION KINETICS ANC CATALYSIS LETTERS, 1,

209-213 , 1976

662" C. E. SKINNER A NUMERICAL INVERSION OF THE POLLACZEK-KHINTCHINE

FORMULA MANUSCRIPT, 1 .8 .M, CORP, POUGHKEEPSIE, MY, 1968

NUMERICAL INVERSION BY MEANS OF A SUITABLE DISCRETIZATION ABOVE AND BELON

¢63" ~. S. SMITH A NOTE ON BOUNDARY-CROSSING PROBABILITIES FOR

BRONNIAN MOTION JOURN. APPLIED PROBABILITY, g, 857-B61t 1972

RELATED TO THE PARER BY ~ . DURB[Nt ;BlO-~ 1971.

66&* W. C. SMITH AND C. P. HAN INTEGRATION OF BIVARIATE PROBABILITY DENSITY

FUNCTIONS OVER NONRECTANGULAR REGZONS PROD. EIGHT ANNUAL SYMPOSIUM ON THE INTERFACE, LOS

ANGELES CAt 268-2S1, 1975

465* J. L. SNELL INTRODUCTION TO PROBABILITY THEORY WITH COMPUTING

(BOOK) PRENTICE-HALL, ENGLEMOOD CLIFFS NJt 1975

INTRODUCTORY TEXT NITH SOME DISCUSSION OF COMPUTATIONAL AND NUMERICAL ASPECTS. THE LANGUAGE BASIC IS USED.

465* M, SDLC AND I . HORSAK SIMULATION OF FIRST-ORDER CHEMICAL REACTION AS A

STOCHASTIC PROCESS ON A DJG~AL COMPUTER COLLECTION OF CZECHOSLOVAK CHEMICAL PAPERS, 3Tt

2996-3D00, 1972

467* q. SOLC STOCHASTIC MODEL OF REVERSIBLE FIRST-ORDER REACTION

- FLUCTUATIONS NEAR TO THE EQUILIBRIUM ZEITSCHRIFT F. PHYSIKALISGHE CHEMIEt NEUE FOLGE

)FRANKFURT) 79, 2TS-2STe 1972 DISCUSSION OF A BIRTH-AND-DEATH MODEL

&68" R, M. SOL AND A RENENAL THEORETIC APPROACH TO THE ESTg4ATION OF

FUTURE DEMAND FOR REPLACEMENT PARTS OPERATIONS RESEARCH, 16, 3b-51, 1968

669* R. N, SOL AND REqEMAL FUNCT IONS FOR THE GAMMA AND HEIBULL

DiSTRiBUTIONS NITH INCREASING HAZARD RATE TECH. REP. NO. RAC-TP-329, RESEARCH ANALYSIS CORPt

MCLEAN VA, 196B [ONPUTATION OF RENEWAL FUNCTIONS

473" R. N, SOL AND AVAILABILITY OF RENEMAL FUNCTIONS FOR GAMMA AND

NEIBULL DISTRIBUTIONS NITH INCREASING HAZARD RATE OPERATIONS RESEARCH, I T , S36-BA3t 1969

COMPUTATION OF RENEMAL FUNCTIONS

471* J . J . SOLBERG A GRAPH THEORETIC FORMULA FOR THE STEADY STATE

DISTRIBUTION OF FINITE MARKOV PROCESSES MANAGEMENT SCIENCE, 21, I060"106St 197S

672" J . J . SOLBERG A METHDD FOR HAND COMPUTATION OF APPROXINATE

SOLUTIONS TO NARKOV EQUATIONS MANUSCRIPT, SCHOOL OF | .E , PURDUE UNIV, 1974

673e J . J . SDLBERG A SIMPLE FLOMGRAPN METHOD FOR NARKOV PROCESSES MANUSCRIPT, SCHOOL OF J. Et PURDUE UNIV, 1976

GRAPH THEORETIC METHOD FOR THE COMPUTATION OF STATIONARY PROBABILITIES

474* H, SPATH ZUR GLATTUNG EMPIRISCHER HAUFIGKEITSVERTEILUNGEN CONPUTINGt lOt 353-357, 1972

SPLINE SMOOTHING OF EMPIRICAL DISTRIBUTIONS

675" K. SPREMANN AND P. GESSNER BENERTETE NARKOVPROZESSE IN STATIONAREN ZUSTAND -

EIN NEUER ALGORITHNUS HIT BEISPIEL COMPUTING, 13, 1?3 -1S i t 1976

AN ALGORITHM FOR HARKDV CHAINS NITH RENAROSt BASED ON POLICY ITERATION

475" N, E, STARZAK COMPUTER EXAN INAT~N UF SOME BAS~ PROBABILITY

MODELS • JOJRH. CHEMICAL EDUCATION, S i t 717"722e 1976

MODELS RELATED TO THE KINETICS OF CHEMICAL REACTIONS, STUDIED BY COMPUTER SIMULATION

677" D. STOYAN BIN ITERATIONSVERFAHREN ZUR NUNERISCHEN AUFLDSUNG

VON GLE ~HUNGSSYSTEMEN DER BEDIENUNGS- LIND ZUVERLASSIGKEITS THEORIE ( IN GERMAN, NITH ENGLISH AND RUSSIAN SUMMARIES)

ZEITSCHRIFT ANGENANDTE MATH. UND MECHANIK, 49 , 77 -82 , 1969

ITERATIVE SOLUTION OF STEADY STATE EQUATIONS

675s M. N. SUGG AND K. HUTCHESON COMPUTATIONAL ALGOR ~HM FOR HIGHER ORDER M3MENTS OF

NJLTINOHIAL TYPE DISTRIBUTIONS JOURN. STATISTICAL COMPUTATION AND SIMULATION, 1,

149-155, 1972


479* P* R. TADIKAMALLA AND J , S. RAMBERG AN APPROXIMATE METHOD FOR GENERATING GAMMA AND OTHER VAR|ATES

JOURN. STATIST 1CAL COMPUTATION AND S ~ULATIONt 3t ~T4"2B~, 197~

480" Ce G. THOMAS AND Re E. BARGMANN COMPARISON OF NONCENTRAL BETA D ~TRIBUTION PROGRAMS TEGHe REPTe NO 62t DEPT. OF STATt UNIV. OF GEORGIA,

ATHENS GA 1971t 77 PP ALGORITHMS AND DETAILED CONPUTER PROGRAMS FOR THE

NONCENTRAL BETA DISTRIBUTION

681" No Ue THOMAS SOME MEAN FIRST-PASSAGE TIME APPROXIMATIONS FOR THE

DRNSTEIH-UHLENBECK PROCESS JOURNo APPLIED PROBABILITYt 12, 600-606. |qTS

A SIMPLE BUT ACCURATE APPROXIMATION FORMULA TO THE MEAN FIRST-PASSAGE TIME

482" NeTeTqOMOP(]JLOStPeM. MCNANAMONtR~VeJANCtB.hMARKS A QUEUEING MODEL FOR RADIO NETS PART I I - RESULTS tEEE TRANSACTIONS ON CO~MUNICATIONSt CON-IX, 16-22t

1973 SEE COMMENTS ON PART I UNDER R.V. JANCt 1973

483* 0, THORIN ANALYTIGAL STEPS TOWARDS A NUMERICAL CALCULATION OF

THE RUIN PROBABILITY FOR A FINITE PERIOD HHEN THE RISK PROCESS IS OF THE PDISSON TYPE OR OF THE MORE GENERAL TYPE STUDIED BY SPARRE ANDERSEN

ASTIN BULLETINt 6t $6-65, 1971

48~* 0, THORIN AND N. WIKSTAD NUMERICAL EVALUATION OF RUIN PROBABILITIES FOR A FIN~E PERIOD

ASTIN BULLETIN, Tt 13T-153t 1973

686" F, A, TILLNAN AND J. Me LIITTSCH~AGER INTEGER PROGRAMMING FORMULATION OF CONSTRAINED RELIABILITY PROBLEM

MANAGEMENT SCIENCEt 13p 8BT-eg9t 1967

686" K. P. TOGNETT I AND A. MAZANOV A TWO-STAGE POPULATION MODEL MATH. BIOSG|ENCESt 8y 3TI-OTBJ 1970

DISCUSSES SOME NUMERICAL ASPECTS OF A DIFFERENCE-DIFFERENT IAL EQUATION ARISING IN A BIOLOGICAL MODEL INVOLVING A SPECIES HITH TWO LIFE STAGES

687* K, TOGNETTI ON THE GRAPHICAL REPRESENTATION OF A QUEUE AUSTRALIAN COMPUTER Jr 6~ 30"33t 1976

DISCUSSES A METHOD OF GRAPHICAL DISPLAY~ USEFUL IN THE SIMULATION AND CONTROL OF PRACTICAL QUEUESe DISCRETE TIME QUEUES ARE CONSIDERED.

68Be W. F. TRENCH AN ALGORITHM FOR THE INVERSION OF F ~ ITE TOEPL ~Z NATR~ES

JOURN~ SOCe INOUSTe APPLe MATH, |2 t 515-$22, 1966 APPLICATIONS IN DISCRETE TIME SERIES

489* ~. F. TRENCH AN ALGORITHM FOR THE INVERSION OF FINITE HANKEL WATRIGES

JOURN. SOC. INDUST. APPLo NATHt 13t |102-1107t 1966 RELATED TO POLYNOMIAL REGRESS|ON AND THE MOMENT

PROBLEM

693. ~. F. TRENCH WEIGHT|NG COEFFIC~NTS FOR THE PREDATION OF

STATIONARY TIME SERIES FRON THE FINITE PAST SIAM JOURN. APPL, MATHt 15, ISO2-1510t 1967

491" W. F. TRENCH INVERSION OF TOEPLITZ BAND MATRICES MATHEMATICS OF CDMPUTATIONt 2St 1089-1#96~ 1g76

692* Go TRYBUS CALCULATION OF MEASURES OF STOCHASTICAL DEPENDENCE - ALGORITHM 35 - ( IN ENGLISHt POLISH SUMMARY)

ZASTOSOWANIA MATEMATYKI, IS~ 671-676t 1976 COMPUTATION OF THE MEASURES OF DEPENDENCE

INTRODUCED BY Z~ HELLWIG AND Z. CZERWINSKIe ALGOL PROGRAM GIVEN

493* y, TUMURA ON THE EQUILIBRIUM PROBABILITIES UF GILD/1 JDURN. OPER. RESe SOC. JAPANt lOt 93-107t Z96B

A RECURSIVE ALGDR|THM SUITABLE FOR LOW TRAFFIC INTENSITIES

49¢* Ro L. TWEEDIE THE CALCULATION OF LIMIT PROBABILITIES FOR

DENUMERABLE MARKOV PROCESSES FROM ~F ~ITESINAL PROPERTIES

J(]JRN. APPLIED PROBABILITY, 10~ 86-99t 1973 DISCUSSES PROBLEMS ASSOCIATED WITH FINITE

TRUNCATIONS OF INFIN ~ESIMAL GENERATORS

495s S. C. TZAFESTA$ ON BUFFER DESIGN FOR ERLANG ARRIVALS AND MULTIPLE

SYNCHRONOUS PERIODICALLY REGULAR OUTPUTS INTERNAT. JOURNe SYSTEMS SCIENCE, 2, 353-367t 1972

496w V. R. R. UPPULUR] AND J. A. CARPENTER A PROBLEM OF RESTRICTED PARTITIONS NAVAL RESEARCH LOGISTICS GUARTERLY,21tZO1-2OSt 1976

(Nltee,NM) IS AN ADMISSIBLE PARTITION OF N IF AND ONLY IT IS POSSIBLE TO WRITE N1 SYMBOLS OF A FIRST KINOt. .e NM SYMBOLS OF AN M-TH KIND, SO THAT NO ADJACENT SYMBOLS ARE THE SANE. THIS PAPER COMPUTES THE NUMBER OF SUCH PARTITIOMS

697* l . A. USHAKOV APPROXIMATE ALGORITHM FOR CONSTRUCTING OF OPTINAL

RELIABLE SYSTEM WITH ARBITRARY STRUCTURE JOURN. OPERATIONS RESEARCH SOCIETY JAPANt 9t BO-Bgt 1967

69B~ D. L. VANASOLEN AND L. Go WAHL|G A NUMERICAL SOLUTION FOR TIME DEPENDENT

MULTI-CHANNEL QUEUES AND AN APPLICATION TO THE ACUTE MINOR ILLNESS CLINICt SILAS B. HAYS HDSPITALt FORD ORDt CALIFORNIA

M. SC. THESISt NAVAL POSTGRADUATE SCHOOLt MONTEREY CA, 1976t 39 PP

A CASE STUDY BY MEANS OF AN EXACT RECURSIVE ALGORITHM.

SEE ALSO THE THESIS BY B. 8. CULNER

699* P, WACHTER SOLVING CERTAIN SYSTENS OF HOMOGENEOUS EQUATIONS

WITH SPECIAL REFERENCE TO MARKOV CHA|NS fl. SC. THESIS, DEPT. OF MATH, flGGILL UNIV~ MONTREAL t

CANADAt MARCH 1973, 7T PAGES W |TH APPEND~ES SURVEY AND COMPARISON OF METHODS FOR THE COMPUTATION OF THE STATIONARY DISTRIBUTION OF A FINITE MARKOV CHAIN

503* V. L. WALLACE AND Re S. ROSEqBERG MARKOVIAN MODELS AND NUMERICAL ANALYSIS OF COMPUTER

SYSTEM BEHAVIOR PROC. AFIPS SPRING JOINT COMPUTER CONF, 28.

141-168, 1966

SOl* V. L. WALLACE THE SOLUTION OF QUASI BIRTH AND DEATH PROCESSES

ARISING FROM HULTIPLE ACCESS COMPUTER SYSTEMS PH.D. THESISt SYSTEMS ENGINEERING LASt UM|V. OF

MICHIGAN ANN ARBOR Ni t IS:UED AS TECHe REPe OTT62-6-Tt 1969t 98 PP

STEADY STATE SOLUT ION OF LARGE MARKOVIAN SYSTENS OF QUEUES

$02" V. L, WALLACE TOWARD AN ALGEBRAIC THEORY OF MARKOVIAN NETWORKS SYMPOSIUM CONPUTER CONMUNIGAT|ONS NETWORKS AND TELETRAFFICt POLYTECHNIC |NSTITUTEt BROOKLYN NYt 397-4DTt 1972

UNIFIED NOTATIONAL SYSTEM FOR NARKOVIA~ ~ETNORKS

503* V. L. WALLACE ALGEBRAIC TECHNIQUES FOR NUMERICAL SQLUT ION OF

QUEUEING NETWORKS IN LECTURE NOTES IN ECONOMICS AND MATH. SYSTEMS NO.98t SPRINGER VERLAGt BERLINt 295-305v 1976

A SURVEY OF REPRESENTATIONS OF NARKOV~N NETNORKSt WHICH ARE SUITABLE FOR NUHERICAL COMPUTATION OF STEADY STATE PROBABILITIES

50¢* H. I . WEISBERG BAYESIAN COMPARISON OF TWO ORDERED NULTINOMZAL

POPULATIONS BIOqETRICSt 28t 8S9-B67t 1972

COMPUTATION OF A POSTERIOR I PROBABILITIES RELATED TO A BAYESIAN COMPARISON PROBLEM FOR CERTAIN MULTINOMIAL POPULATIONS

505* D. J. WHEELER AN APPROXINAT ION FOR SIMULATION OF GAMMA DISTRIBUTIONS

JOURN. STATISTICAL COMPUTATION AND SINULATZONt 3t 225-232, 1976

THE APPROX ~AT DN IS BASED ON THE BURR DISTRIBUTIONS

5O6m J. S. WHITE WEIBULL RENEWAL A~ALYSIS IN AEROSPACE RELIABILITY AND MAINTAINABILITY CONFt WASHINGTON OCt 1966

COMPUTATION OF RENEWAL FUNCTIONS

5~7" J. S* WHITLDCX MODELING COMPUTER SYSTEMS WITH TIME-VARYING NARKOV CHAI~S

Pit, D, THES ~ t C* Se DEPTt UN|V, OF He CAROL]NAt CHAP[L HILL NC, 1973, 20B PP PLUS APPEND|CESe

SOME QUEUES WITH TIME-VARYING ARRIVAL AND SERVICE RATES ARE ANALYZED BY THE NUMERICAL SOLUTION OF THE GHAPMAN-KOLMOGOROV DIFFERENTIAL EQUATIONS OF CERTAIN ASSOCIATED MARKOV CHAINS, EXTENSIVE

• EXAMPLES AND VAL|DATION BY THE ANALYSIS OF OBSERVATIONAL DATA

Journal of Compuutional and Applied Mathematics, volume 3, no 1, 1977. 71

508* N. NIKSTAD EXENPLIFICATION OF RUIN PROBABILITIES ASTIN BULLETINt 6t l~T- ISZt 1971

509~ J, WINKOHSKI ON CERTAIN BIRTH AND DEATH PROCESSES AND THEIR

SIMULATION ALGORYTNYt Tt 61-76t 1967

A GENERAL DISCUSSION OF THE ORGANIZATION OF SIMULATIONS FOR BIRTH AND DEATH PROCESSES

51~e R, L. HOOD A PRODUCT FLOM ANALYSIS NITH TIME-DEPENDENCE TECH. REPT. NO 99t THENIS REPT. NO 2Tt DEPT.OF

STATISTICS UNIVeOF GEORGIAt ATLANTA GAp E~BPPtlgT3 EXTENSIVE COMPUTER PROGRAM FOR THE STUDY OF A

NUMBER OF MULTI-SERVER HARKOVIAN QUEUES IN SERIES. THERE IS AN UNLIMITED SUPPLY OF CUSTOMERS IN FRONT OF ThE FIRST UNIT.

511f 3. F. TED A FINITE DAM MITH VARIABLE RELEASE RATE JOURN. APPLIED PROBABILITYt 12o 205"211o 1975

COMPUTATION OF CERTAIN MOMENTS

512~ 0. S* YU ON THE STEADY-STATE SOLUTION OF THE GI/EK/R QUEUE

NITH HETEROGENEOUS SERVERS TECH. REP. NO. SB! DEFT. OF O.R~ STANFORD UNIV,

STANFORD CAt 1972t TgPP. DETAILED ANALYTIC AND ALGORITHMIC RESULTS ON THE

STEADY-STATE FEATURES OF THE QUEUEING MODEL GIVEN IN THE TWLE

513S S. ZACKS AND J. FENNELL • BAYES ADAPTIVE CONTROL OF TWO-ECHELON INVENTORY

SYSTEMS I - DEVELOPMENT FOR A SPECIAL CASE OF ONE-STATION

LONER ECHELON AND MONTE-CARLO EVALUATION NAVAL RESEARCH LOGISTICS QUARTERLYt 19e 15-28t lgT2

SI~S S* ZACKS liND J. FENMELL DISTRIBUTION OF ADJUSTED STOCK LEVELS UNDER

STATISTICAL ADAPTIVE CONTROL PROCEDURES OF INVENTORY SYSTEMS

JOURN, AMER, STATe ASSOCI 68e B8-91, 1973 COMPARISON OF EXACT AND SIMULATED DISTRIEUTIONS

OF THE ADJUSTED STOCK LEVELS

515e S. ZACKS AND ~Jo FENNELL BAYES ADAPTIVE CONTROL OF TNO-ECHELON INVENTORY SYSTEm

l I - THE HULTI-STATIO~ CASE TECH. REP. TR-BS609o INST. OF MANAGEMENT SCIENCE

ANO ENGINEERING: GEORGE MASHINGTON UNXV, MASHINGTON DC, 1973. TD APPEAR IN NAVAL RESEARCH LOGISTICS QUARTERLY

51S* S* ZACKS THE PROPORTIONAL CLOSENESS AND THE EXPECTED SAMPLE

SIZE OF SEQUENTIAL PROCEDURES FOR ESTIMATING TA PROBABILITIES IN EXPONENTIAL DISTRIBUTIONS

CONNUNICATIONS IN STATISTICSt 3o 105-120, 1974 EXTENSIVE NUHERICAL INVESTIGATION OF THE

SEQUENTIAL ESTIMATION PROBLEM IN THE T~LE. NIENER PROCESS APPROXIMATIONS INCLUDEDe PROGRAMS LISTED

i ,,,,


5 . C L A S S I F I C A T I O N B Y S U B J E C T A R E A

Actuarial Mathematics 0 2 8 - 0 3 2 - 0 3 3 - 0 4 9 - 0 5 0 - 0 5 1 - 0 5 5 - 1 3 2 - 1 7 4 -

1 7 5 - 2 7 3 - 4 0 6 - 4 0 7 - 4 1 5 - 4 4 5 - 4 4 6 - 4 4 7 - 4 4 8 -

4 4 9 - 4 5 0 - 4 8 3 - 4 8 4 - 5 0 8

Bounds (Computation o~ 0 6 9 - 0 8 9 - 2 4 6 - 2 4 7 - 2 4 8 - 2 4 9 - 2 5 0 - 3 0 2 - 3 0 3 -

4 0 9 - 4 1 0 - 4 1 1 - 4 1 6

BranchingProcesses 0 0 6 - 0 4 4 - 0 6 9 - 1 5 4 - 3 8 4 - 4 0 9 - 4 1 0 - 4 1 1 - 4 1 6 -

4 2 2

Broum~nMotionand Rela~dProcesses 0 1 4 - 0 2 8 - 0 2 9 - 1 2 1 - 1 2 2 - 1 9 2 - 4 6 3 - 4 8 1

Chemical Kineti~ 3 1 8 - 4 1 7 - 4 2 3 - 4 3 7 - 4 6 0 - 4 6 1 - 4 6 6 - 4 6 7 - 4 7 6

Gombinato~cs 0 1 2 - 0 2 6 - 0 9 1 - 1 0 4 - 1 2 7 - 1 4 9 - 1 7 3 - 2 5 2 - 2 5 3 -

2 5 9 - 2 6 0 - 3 9 2 - 3 9 3 - 4 5 1 - 4 9 6

Compu~rSystems 0 0 5 - 0 3 9 - 0 7 5 - 0 7 6 - 0 7 7 - 0 8 5 - 0 8 6 - 0 8 7 - 0 8 8 -

0 9 0 - 1 5 7 - 1 5 8 - 1 6 3 - 2 0 3 - 2 7 2 - 2 8 3 - 2 8 4 - 2 8 5 -

2 8 6 - 2 8 8 - 2 8 9 - 2 9 0 - 2 9 1 - 2 9 2 - 2 9 3 - 2 9 4 - 2 9 5 -

2 9 6 - 2 9 7 - 2 9 8 - 3 0 6 - 3 0 8 - 3 1 5 - 3 7 3 - 3 7 4 - 4 2 6 -

4 2 7 - 4 2 8 - 4 2 9 - 4 3 0 - 4 3 2 - 4 3 3 - 4 5 8 - 4 9 5 - 5 0 0 -

5 0 1 - 5 0 2 - 5 0 3 - 5 0 7

Con~olandOptim~ationofStochasticModeh 0 0 1 - 0 0 2 - 0 0 3 - 0 3 1 - 0 4 2 - 0 4 5 - 0 7 3 - 0 7 9 - 1 1 2 -

1 3 6 - 1 4 0 - 1 4 2 - 1 5 4 - 1 6 4 - 1 6 8 - 1 9 4 - 2 0 1 - 2 0 9 -

2 1 2 - 2 1 3 - 2 1 4 - 2 1 5 - 2 1 6 - 2 1 7 - 2 1 8 - 2 1 9 - 2 2 0 -

2 2 8 - 2 2 9 - 2 3 0 - 2 3 1 - 2 5 7 - 3 2 5 - 3 2 6 - 3 2 7 - 3 4 5 -

3 4 6 - 3 4 7 - 3 4 8 - 3 5 3 - 3 5 4 - 3 5 5 - 3 5 6 - 3 5 7 - 3 5 8 -

3 5 9 - 3 6 0 - 3 6 1 - 3 6 2 - 3 6 3 - 3 6 4 - 3 6 5 - 3 6 7 - 4 2 5 -

4 5 7 - 4 7 5

EducationaIMa~riaIand Rev~wpape~ 1 5 3 - 1 8 5 - 1 8 6 - 1 8 7 - 1 8 8 - 1 8 9 - 1 9 0 - 1 9 9 - 3 4 9 -

3 7 7 - 3 7 9 - 3 8 3 - 4 1 7 - 4 3 7 - 4 6 5

EpidemicModeh, G~net~sandPopulaaonGrowth 0 0 1 - 0 0 2 - 0 0 3 - 0 2 7 - 0 7 8 - 1 0 3 - 1 3 8 - 1 3 9 - 1 5 1 -

1 5 4 - 1 5 6 - 1 6 0 - 1 7 2 - 1 9 1 - 2 3 4 - 2 6 5 - 2 6 6 - 3 0 0 -

3 0 1 - 3 1 2 - 3 1 3 - 3 7 2 - 4 5 4 - 4 5 5 - 4 5 6 - 4 8 6

FourierAnalyt~Methods 0 3 4 - 0 3 5 - 0 4 7 - 0 4 8 - 0 4 9 - 0 5 2 - 0 5 3 - 0 5 4 - 0 5 5 -

0 5 6 - 0 5 7 - 0 5 8 - 0 9 3 - 1 0 7 - 1 2 0 - 1 2 3 - 1 2 6 - 1 3 2 -

1 6 2 - 1 7 4 - 1 7 5 - 3 9 0 - 3 9 1 - 4 4 2 - 4 4 3

Inventory Mode~ 4 3 9 - 5 1 1 - 5 1 3 - 5 1 4 - 5 1 5

MarkovChmns(General) 0 1 1 - 0 2 3 - 0 9 6 - 1 1 0 - 1 2 9 - 1 3 0 - 1 3 6 - 1 4 9 - 1 6 9 -

1 7 0 - 1 7 1 - 1 9 6 - 1 9 7 - 2 4 3 - 2 5 9 - 2 6 0 - 2 6 4 - 3 9 4 -

4 0 2 - 4 5 1 - 4 7 1 - 4 7 2 - 4 7 3 - 4 9 4 - 4 9 9

PointProcesses- Renewal Theory 0 0 4 - 0 3 0 - 0 5 4 - 0 9 7 - 1 1 6 - 1 5 0 - 1 6 6 - 2 1 1 - 2 4 2 -

2 6 3 - 3 1 4 - 4 4 0 - 4 6 8 - 4 6 9 - 5 0 6

QueuemgMode~ 0 0 5 - 0 2 0 - 0 2 1 - 0 2 2

0 4 2 - 0 4 6 - 0 7 1 - 0 7 4

0 8 3 - 0 8 4 - 0 8 5 - 0 8 6

0 9 5 - 0 9 6 - 0 9 9 - 1 0 1

1 3 4 - 1 3 5 - 1 3 7 - 1 4 1

1 6 8 - 1 7 6 - 1 7 7 - 1 7 8

1 9 3 - 1 9 5 - 2 2 2 - 2 2 3

2 3 7 - 2 3 8 - 2 3 9 - 2 4 4

2 7 8 - 2 8 2 - 2 8 4 - 2 8 5

2 9 2 - 2 9 3 - 2 9 4 - 2 9 5

3 0 8 - 3 1 0 - 3 1 1 - 3 1 5

3 3 8 - 3 3 9 - 3 4 0 - 3 4 1

- 0 3 1 - 0 3 6 - 0 3 7 - 0 3 8 - 0 3 9 -

- 0 7 5 - 0 7 6 - 0 7 7 - 0 7 9 - 0 8 0 -

- 0 8 7 - 0 8 8 - 0 8 9 - 0 9 0 - 0 9 2 -

- 1 0 2 - 1 1 1 - 1 1 2 - 1 1 3 - 1 3 3 -

- 1 4 6 - 1 4 7 - 1 5 7 - 1 5 8 - 1 5 9 -

- 1 7 9 - 1 8 0 - 1 8 1 - 1 8 2 - 1 8 3 -

- 2 2 4 - 2 2 5 - 2 2 6 - 2 3 5 - 2 3 6 -

- 2 4 5 - 2 5 8 - 2 6 2 - 2 7 0 - 2 7 2 -

- 2 8 6 - 2 8 8 - 2 8 9 - 2 9 0 - 2 9 1 -

- 2 9 6 - 2 9 7 - 2 9 8 - 3 0 6 - 3 0 7 -

- 3 1 7 - 3 2 5 - 3 2 6 - 3 2 7 - 3 3 2 -

- 3 4 3 - 3 6 8 - 3 6 9 - 3 7 0 - 3 7 3 -

3 7 4 - 3 7 6 - 3 7 8 - 3 8 0 - 3 8 2 - 3 8 3 - 3 8 4 - 3 8 5 - 3 8 6 -

3 8 7 - 3 8 9 - 3 9 5 - 3 9 6 - 4 0 1 - 4 1 4 - 4 1 8 - 4 1 9 - 4 2 4 -

4 2 5 - 4 2 6 - 4 2 7 - 4 2 8 - 4 2 9 - 4 3 0 - 4 3 4 - 4 3 5 - 4 3 6 -

4 5 2 - 4 5 8 - 4 6 2 - 4 7 7 - 4 8 2 - 4 8 7 - 4 9 3 - 4 9 5 - 4 9 8 -

5 0 0 - 5 0 1 - 5 0 2 - 5 0 3 - 5 0 7 - 5 1 0 - 5 1 2

Reliability Theory 0 0 7 - 0 6 0 - 0 6 1 - 0 8 1 - 1 4 2 - 1 6 1 - 1 6 5 - 2 0 0 - 2 0 1 -

2 0 2 - 2 0 3 - 2 0 4 - 2 1 2 - 2 1 3 - 2 1 5 - 2 2 8 - 2 2 9 - 2 3 0 -

2 3 1 - 2 6 7 - 2 7 9 - 2 9 9 - 3 0 4 - 3 2 3 - 3 4 5 " 3 4 6 - 3 4 7 -

3 4 8 - 3 5 0 - 3 5 1 - 3 5 2 - 3 5 3 - 3 5 4 - 3 5 5 - 3 5 6 - 3 5 7 -

3 5 8 - 3 5 9 - 3 6 0 - 3 6 1 - 3 6 2 - 3 6 3 - 3 6 4 - 3 6 5 - 3 6 7 -

3 7 5 - 4 5 7 - 4 5 9 - 4 7 7 - 4 8 5 - 4 9 7

Simulation Techniques 0 0 8 - 0 0 9 - 0 1 0 - 0 2 4 - 0 2 5 - 0 6 8 - 0 7 0 - 0 9 5 - 0 9 6 -

0 9 7 - 0 9 8 - 1 0 1 - 1 0 2 - 1 1 1 - 1 1 4 - 1 1 5 - 1 4 4 - 1 4 5 -

1 4 6 - 1 4 7 - 1 4 8 - 1 9 2 - 1 9 8 - 2 0 8 - 2 2 1 - 2 4 2 - 2 4 3 -

2 5 2 - 2 5 4 - 2 5 5 - 2 5 6 - 2 8 0 - 2 8 1 - 3 0 6 - 3 0 9 - 3 2 4 -

3 2 8 - 3 2 9 - 3 3 0 - 3 3 1 - 3 3 3 - 3 3 7 - 3 4 2 - 3 8 8 - 3 9 8 -

3 9 9 - 4 0 0 - 4 0 5 - 4 0 8 - 4 2 0 - 4 2 1 - 4 3 7 - 4 3 8 - 4 3 9 -

4 4 2 - 4 4 4 - 4 6 0 - 4 6 1 - 4 6 6 - 4 7 9 - 5 0 5 - 5 0 9

Special Probability Distributions 0 4 3 - 0 5 9 - 0 6 2 - 0 6 5 - 0 6 7 - 0 7 2 - 0 8 2 - 0 9 4 - 1 0 0 -

1 1 7 - 1 1 8 - 1 2 3 - 1 2 4 - 1 2 5 - 1 4 3 - 1 5 5 - 1 6 7 - 2 0 6 -

2 1 0 - 2 3 3 - 2 4 0 - 2 4 1 - 2 5 1 - 2 6 8 - 2 6 9 - 3 0 5 - 3 3 4 -

3 3 5 - 3 6 6 - 3 8 1 - 3 8 2 - 3 9 2 - 3 9 3 - 4 1 3 - 4 4 1 - 4 4 2 -

4 5 3 - 4 6 4 - 4 7 8 - 4 8 0 - 4 9 2 - 5 0 5 - 5 1 6

Time Series 0 1 3 - 0 1 7 - 0 1 8 - 1 2 0 - 1 6 6 - 2 4 4 - 3 1 9 - 3 2 0 - 3 2 1 -

3 2 2 - 3 9 7 - 4 0 1 - 4 8 8 - 4 8 9 - 4 9 0 - 4 9 1

J o u r n a l o f C o m p u t a t i o n = ! a n d A p p l i e d M a t h e m a t i c s , v o l u m e 3 , n o 1 , 1 9 7 7 . 7 3

Miscellaneous Probability Models

archeology computer graphics contingency tables data analysis

economic models

274-275-276 119-227-431-487 336 019 -040-041-063- 064 -173-184-205- 232-277-474 128-316-404

Markov renewal processes 150 - 2 1 1 - 386 Mellin transforms 155 - 207 - 210

meteorology military applications multiple comparisons quality control sports stereology stochastic differential equations tournaments

271 106-403 108-109-504 371 412 015-016-261

287 105


An annoted bibliography on computational probability · 2017-02-11 · An annoted bibliography on...

Documents

Transcript of An annoted bibliography on computational probability · 2017-02-11 · An annoted bibliography on...