@BOOK{Beck68:Elementary,
AUTHOR="Petr Beckmann",
TITLE="Elementary Queuing Theory and Telephone Traffic",
PUBLISHER="Golem Press",
YEAR=1968,
KEYWORDS="queueing theory",
}

@BOOK{Fell68:Probability,
AUTHOR="William Feller",
TITLE="An Introduction to Probability Theory and its Applications,
Volume 1",
EDITION="third",
PUBLISHER="John Wiley and Sons",
ADDRESS="New York, New York",
VOLUME=1,
YEAR=1968,
KEYWORDS="probability theory",
}

@BOOK{Gall68:Information,
AUTHOR="Robert Gallager",
TITLE="Information Theory and Reliable Communication",
PUBLISHER="John Wiley and Sons",
ADDRESS="New York, New York",
YEAR=1968,
ABSTRACT="Chernoff bounds (p. 126f)",
}

@BOOK{Lee68:Applied,
AUTHOR="Andrew Lee",
TITLE="Applied Queueing Theory",
PUBLISHER="Macmillan",
ADDRESS="London",
YEAR=1968,
KEYWORDS="queueing theory",
ABSTRACT="Applications of queueing theory to airline-related problems.",
}

@BOOK{Mora68:Probability,
AUTHOR="P. A. P. Moran",
TITLE="An Introduction to Probability Theory",
PUBLISHER="Clarendon Press",
ADDRESS="Oxford, Great Britain",
YEAR=1968,
KEYWORDS="probability theory; stochastic processes; random walk",
}

@BOOK{Sves68:Problems,
TITLE="Problems in Probability Theory, Mathematical Statistics and
Theory of Random Functions",
EDITOR="A. A. Sveshnikow",
PUBLISHER="W. B. Saunders",
ADDRESS="Philadelphia",
YEAR=1968,
KEYWORDS="probability theory; random function; statistics",
}

@BOOK{Rior68:Combinatorial,
AUTHOR="J. Riordan",
TITLE="Combinatorial Identities",
PUBLISHER="John Wiley",
ADDRESS="New York",
YEAR=1968,
KEYWORDS="combinatorics; binomial coefficients",
}

@ARTICLE{Sibl68:Engineering,
AUTHOR="E. H. Sibley",
TITLE="The engineering assistant: design of a symbol manipulation
system",
JOURNAL="Interactive systems for experimental applied mathematics",
ADDRESS="New York, New York",
PAGES="138-154",
YEAR=1968,
REFERENCES=7,
KEYWORDS="Mathematical method; design; formula interpretation",
ABSTRACT="This article is intended to describe the design of a working
interactive symbol manipulation system, but the reasons for a given
action and the implications of it are common to the design of other
languages. This introduction therefore formulates the questions that
must be asked in the design of such a system, discusses possible
alternatives, and suggests the effects of the alternatives.",
}

@ARTICLE{Taka68:Two,
AUTHOR="L. Takacs",
TITLE="Two queues attended by a single server",
JOURNAL=or,
VOLUME=16,
NUMBER=1,
PAGES="639-650",
YEAR=1968,
REFERENCES=2,
KEYWORDS="M/g/1; parallel queue; waiting time",
ABSTRACT="It is supposed that customers of type 1 and of type 2 arrive
at a service system in accordance with a Poisson process. There are two
counters in the system. Customers of type 1 receive service at counter 1
and customers of type 2, at counter 2. The customers are served by a
single server who attends the two counters alternately. At each counter
the the service times have a general distribution. This paper is
concerned with the determination of",
}

@ARTICLE{Tamb68:Property,
AUTHOR="D. G. Tambouratzis",
TITLE="On a property of the variance of the waiting time of a queue",
JOURNAL=jap,
VOLUME=5,
PAGES="702-703",
YEAR=1968,
REFERENCES=1,
KEYWORDS="Waiting time; variance; queueing system",
ABSTRACT={We consider a queueing system under any discipline which does
not affect the distribution of the number of customers in the queue at
any time. We shall show that the variance of the waiting time is a
maximum when the queue discipline is "last come, first served".},
}

@ARTICLE{Walk68:Hardware,
AUTHOR="M. J. Walker",
TITLE="A hardware simulator for multi-acces computer systems",
JOURNAL="IEE conference publications",
VOLUME=55,
PAGES=87,
YEAR=1968,
KEYWORDS="Hardware simulator",
ABSTRACT="Gebunden mit Walker: Design of a special purpose",
}

@TECHREPORT{Walk68:Special,
AUTHOR="M. J. Walker",
TITLE="The design of a special purpose digital machine",
INSTITUTION="University of Manchester",
ADDRESS="Manchester, England",
YEAR=1968,
KEYWORDS="Hardware simulator",
ABSTRACT="Gebunden mit Walker, Hunter: A hardware simulator",
}

@ARTICLE{Whit68:Comparison,
AUTHOR="J. R. B. Whittlesey",
TITLE="A comparison of the correlational behavior of random number
generators for the {IBM} 360",
JOURNAL=cacm,
VOLUME=11,
PAGES="641-644",
YEAR=1968,
REFERENCES=21,
KEYWORDS="Tausworthe generator; random number generation; test;
comparison",
ABSTRACT={Hutchinson states that the "new" (prime modulo) multiplicative
congruential pseudorandom generator, attributed to d. H. Lehmer, has
passed the usual statistical tests for random number generators. It is
here empirically shown that generators of this type can produce
sequences whose autocorrelation functions up to lag 50 exhibit evidence
of non-randomness for many multiplicative cons tants. An alternative
generator proposed by tausworthe, which us},
}

@ARTICLE{Zier68:Primitive,
AUTHOR="N. Zierler and J. Brillhart",
TITLE="On primitive trinomials (mod 2) I",
JOURNAL="Informatics Control",
VOLUME=13,
PAGES="541-554",
YEAR=1968,
REFERENCES=4,
KEYWORDS="Shift register sequences; Tausworthe generator",
ABSTRACT="We give the complete list of irreducible trinomials for
$2<=n<=1000$.",
}

@ARTICLE{Chaz68:Note,
AUTHOR="D. Chazan and A. G. Konheim and B. Weiss",
TITLE="A Note on Time-Sharing",
JOURNAL="Journal of Combinatorial Theory",
VOLUME=5,
PAGES="344-369",
YEAR=1968,
REFERENCES=1,
KEYWORDS="Time sharing; scheduling; optimization; waiting time",
ABSTRACT={The setting of the problem discussed here is a service
facility which is to be "timeshared" by two customers. A precise notion
of a processing schedule is introduced. Associated with each schedule is
the expected total waiting time of the two customers. The schedules
which minimize this time are called optimum schedules and are determined
here. A number of examples and extensionsare given which indicate the
scope of the methods used.},
}

@ARTICLE{Coff68:Feedback,
AUTHOR="E. G. Coffman and L. Kleinrock",
TITLE="Feedback Queueing Models for Time-Shared Systems",
JOURNAL=jacm,
VOLUME=15,
NUMBER=4,
PAGES="549-576",
YEAR=1968,
REFERENCES=9,
KEYWORDS="Feedback queue; model; analysis; priority; round robin",
ABSTRACT="Time-shared processing systems are studied by considering
priority disciplines operating in a stochastic environment. Results are
obtained for the average time spent in the system, conditioned on the
length of required service. Two distinct feedback models with a single
quantum-controlled service are considered. The first is a round-robin
(RR) system and the second is a feedback (FBn) system with N queues.",
}

@ARTICLE{Coff68:Two,
AUTHOR="E. G. Coffman",
TITLE="Analysis of Two Time-Sharing Algorithms Designed for Limited
Swapping",
JOURNAL=jacm,
VOLUME=15,
NUMBER=3,
PAGES="341-353",
YEAR=1968,
REFERENCES=11,
KEYWORDS="Analysis; time sharing; algorithm; queueing system; model",
ABSTRACT="Time-sharing algorithms are discussed which are designed
primarily for the reduction of swapping without intolerable changes in
the waiting time distributions. A particular class of such algorithms in
which conventional procedures input activity is a given a more detailed
treatment. Queueing models corresponding to these algorithms are devised
and then analyzed for obtaining the waiting time.",
}

@ARTICLE{Dubn68:Numerical,
AUTHOR="H. Dubner and J. Abate",
TITLE="Numerical Inversion of Laplace Transforms by Relating Them to the
Finite Fourier Cosine Transform",
JOURNAL=jacm,
VOLUME=15,
NUMBER=1,
PAGES="115-123",
YEAR=1968,
REFERENCES=10,
KEYWORDS="Laplace transform; numerical method",
ABSTRACT="In this paper the problem of readily determining the inverse
La-place transform numerically is discussed. Because the resultant
inverse function is given as a Fourier cosine series, the procedure
requires only about ten FORTRAN statements and uses only cosines and
exponentials. The basis of the method hinges on the fact that in
evaluating the inverse Laplace transform integral there exists a freedom
in choosing the contour of integration.",
}

@ARTICLE{Gave68:Diffusion,
AUTHOR="D. P. Gaver",
TITLE="Diffusion approximations and models for certain congestion
problems",
JOURNAL=jap,
VOLUME=5,
PAGES="607-623",
YEAR=1968,
REFERENCES=12,
KEYWORDS="Congestion; M/G/1; diffusion approximation; model; Laplace",
ABSTRACT="This paper studies how a simple diffusion approximates the
wait-ing time in the M/G/1 queue. The probability interpretation of
Laplace transform is reviewed. Numerical comparisons are made between
the diffusion approximation and the classical approach (Takacs). A table
for constructing the diffusion approximation to the mean wait is given.
A model for a nonstationary situation isconstructed and approximations
are supplied for this model.",
}

@ARTICLE{Posn68:Closed,
AUTHOR="M Posner and B. Bernholtz",
TITLE="Closed finite queuing networks with time lags",
JOURNAL=or,
VOLUME=16,
PAGES="962-976",
YEAR=1968,
REFERENCES=11,
KEYWORDS="Closed queueing network; finite queue; approximation",
ABSTRACT="Closed finite queueing system: m units move among n stations.
Some time distributions are given. The integro-differential equations
for the state variables are derived, and the steady state solution is
determined. Some time and probability distributions are found or
approximated.",
}

@ARTICLE{Whit68:Equilibrium,
AUTHOR="P. Whittle",
TITLE="Equilibrium distributions for an open migration process",
JOURNAL=jap,
VOLUME=5,
PAGES="567-571",
YEAR=1968,
REFERENCES=2,
KEYWORDS="Open system; distribution; statistics; Whittle's formula",
ABSTRACT="A system of colonies is considered in which migration,
immigration and emigration take place according to a fairly-general
rule. Necessary and sufficient conditions for equilibrium are given in
the theorem of Section(3). The equilibrium distributionof colony numbers
is determined by Equations (7) and (9); the colony sizes are thus
statistically independent in equilibrium. Also changes in equilibrium
character are considered.",
}

@BOOK{Bhat68:Queueing,
AUTHOR="U. Narayan Bhat",
TITLE="Queueing Systems {M/G/1} and {GI/M/1}",
PUBLISHER="Springer-Verlag",
ADDRESS="Berlin, Germany",
YEAR=1968,
KEYWORDS="Queueing system; M/G/1; GI/M/1",
ABSTRACT="1. The queue M/G/1 with group arrivals 2. The queue GI/M/1
with group service 3. Queueing systems in discrete time",
}

@ARTICLE{Suth68:Futures,
AUTHOR="I. E. Sutherland",
TITLE="A futures market in computer time",
JOURNAL=cacm,
VOLUME=11,
NUMBER=6,
PAGES="449-451",
YEAR=1968,
}

@ARTICLE{Allt68:Algebraic,
AUTHOR="W. O. Alltop and U. Pratt",
TITLE="Algebraic theory of flip-flop sequence generators",
JOURNAL="Information and control",
VOLUME=12,
PAGES="193-",
YEAR=1968,
KEYWORDS="Shift register sequences",
}

@ARTICLE{Anso68:Appreciation,
AUTHOR="H. I. Ansoff and D. P. Slevin",
TITLE="An appreciation of industrial dynamics",
JOURNAL=ms,
VOLUME=14,
PAGES="383-415",
YEAR=1968,
REFERENCES=13,
KEYWORDS="Continuous simulation",
ABSTRACT="Simulator DYNAMO, mit Anmerkungen von Forrester",
}

@INPROCEEDINGS{Batc68:Sorting,
AUTHOR="K. E. Batcher",
TITLE="Sorting Networks and their Applications",
BOOKTITLE="AFIPS Spring Joint Computer Conference",
PAGES="307-314",
YEAR=1968,
REFERENCES=3,
KEYWORDS="Sorting network; architecture; implementation",
}

@ARTICLE{Brig68:Proposed,
AUTHOR="H. S. Bright",
TITLE="A proposed numerical accuracy control system interactive systems
for experimental applied",
JOURNAL="Mathematics",
ADDRESS="New York, London",
PAGES="315-330",
YEAR=1968,
REFERENCES=3,
KEYWORDS="Method; floating point; numerical method; numerical
evaluation; numerical software",
ABSTRACT="A scheme is proposed for permitting a user of conventional
procedural programming languages (initally, standard FORTRAN) to test
actual error propagation in numerical calculations. The process is to be
fully mechanistic so that, with no human resequencing required or
permitted, a ``numerical procedure dedugging'' tool is made available.
Other goals include a quantification of the order-of-precision decision
for specified accuracy, provision of a",
}

@ARTICLE{Chan68:Queues,
AUTHOR="W. Chang",
TITLE="Queues with feedback for time-sharing computer system analysis",
JOURNAL=or,
VOLUME=16,
PAGES="613-627",
YEAR=1968,
REFERENCES=14,
KEYWORDS="Time sharing; M/G/1; feedback",
ABSTRACT="A time-sharing computer system brings the man with a problem
much closer to the computer power he needs. The priority processing
problems associated with time-sharing computer system are described. A
mathematical model was developed based on queues with feedback. The
queue size and its variability within the computer can be determined
with the enclosed formulation. Other important system design parameters
such as the system response time, etc.",
}

@ARTICLE{Cinl68:Superposition,
AUTHOR="E. Cinlar",
TITLE="On the superposition of m-dimensional point processes",
JOURNAL=jap,
VOLUME=5,
PAGES="169-176",
YEAR=1968,
REFERENCES=9,
KEYWORDS="method; renewal process; Poisson distribution; point process;
Markov process",
ABSTRACT="Consider n independent vector valued point processes.
Superposition is defined component by component as a natural extension
of the definition for the one-dimensional case. Under proper conditions
as $n$ goes to infinity, it is shown that the superposed process is a
many-dimensional Poisson process with independent components. The
results are applied to the superposition of Markov renewal processes.",
}

@ARTICLE{Coff68:Computer,
AUTHOR="E. G. Coffman",
TITLE="An analysis of computer operations under running time priority
disciplines",
JOURNAL="Interactive systems for experimental applied mathematics",
ADDRESS="New York, London",
PAGES="257-270",
YEAR=1968,
REFERENCES=10,
KEYWORDS="Numerical method; mathematical method; queueing system; round
robin; time in system; evaluation; math. programming technique",
ABSTRACT="Running-time priority disciplines for sequencing computer
operations are those which discriminate among programs on the basis of
the amount of service (running-time) they require. Discrimination is
explicit in the models analyzed by kesten and runnenburg and miller and
schrage in which the priority rule is shortest-job-first. However, in
the models of particular interest in this paper, the discrimination is
necessarily implicit since it is assu",
}

@ARTICLE{Cull68:Mathematical,
AUTHOR="G. S. Culler",
TITLE="Mathematical laboratories: a new power for the physical science",
JOURNAL="Interactive systems for experimental applied mathematics",
ADDRESS="New York",
PAGES="355-383",
YEAR=1968,
REFERENCES=12,
KEYWORDS="mathematical method; interactive mode; information system;
command language; numerical method; graphics; evaluation; symbolic
algebraic computation; mathematical programming technique",
ABSTRACT={The concept of a mathematical laboratory has been developing
throughout the lifetime of computers. The capabilities made available in
systems supporting these laboratories range from symbolic integration,
differentiation, and polynomial and power series manipulation, through
mathematical simulation, to direct control experimental systems. About
1961 two trends, one toward what has become known as "on-line"
computation, the other toward "time-sh},
}

@ARTICLE{Davi68:Probability,
AUTHOR="A. C. Davies",
TITLE="Probability distributions of noiselike waveforms generated by a
digital technique",
JOURNAL=elet,
VOLUME=4,
PAGES="421-422",
YEAR=1968,
KEYWORDS="Shift register sequences",
}

@ARTICLE{Enge68:Language,
AUTHOR="M. E. Engeli",
TITLE="A language and list structure for an algebraic manipulation
system",
JOURNAL="Symbol Manipulation Languages, Techniques",
PUBLISHER="North-Holland",
PAGES="103-115",
YEAR=1968,
REFERENCES=15,
KEYWORDS="Programming language; design; symbolic algebraic computation",
ABSTRACT={The "algebraic processor" is a general purpose algebraic
manipulation system, implemented on the CDC 1604-a at the Swiss Federal
Institute of Technology in Zurich.},
}

@ARTICLE{Gall68:Learning,
AUTHOR="L. J. Gallaher and I. E. Perlin",
TITLE="A learning program for the integration of systems of ordinary
differential equations",
JOURNAL="Interactive systems for experimental applied mathematics",
ADDRESS="New York, London",
PAGES="335-340",
YEAR=1968,
REFERENCES=8,
KEYWORDS="mathematical method; realization; numerical method; integral
calculus; differential calculus; mathematical programming technique",
ABSTRACT="In our previous work, an effort was made to determine which of
the many methods and orders available for the numerical integration of
ordinary differential equations was best. While it was possible to show
that, under certain circumstances, some methods and orders outperformed
others, no one method was clearly superior under all circumstances.",
}

@ARTICLE{Ghar68:Multichannel,
AUTHOR="P. M. Ghare",
TITLE="Multichannel queueing system with bulk service",
JOURNAL=or,
VOLUME=16,
PAGES="182-192",
YEAR=1968,
REFERENCES=10,
KEYWORDS="M/MX/N; Laplace transform",
ABSTRACT="A multichannel queueing system with unlimited Poisson input
and exponential service is considered under a bulk-service discipline.
Earlier results by Arora for the two-channel case have been generalized
to C (C>2) channels by using standard generating functions and Laplace
transform methods. The transient state probabilities are obtained as
Laplace transform and the steady probabilities are obtained as their
limits.",
}

@ARTICLE{Harr68:Pareto,
AUTHOR="C. R. Harris",
TITLE="The pareto distribution as a queue service discipline",
JOURNAL=or,
VOLUME=16,
PAGES="307-313",
YEAR=1968,
REFERENCES=11,
KEYWORDS="Queueing system; service time; conditional distribution; gamma
distribution",
ABSTRACT="A queueing system is described in which service times are
conditioned upon a random parameter my, such that the conditional
service distribution is exponential and my has a gamma density. It is
shown that the resultant unconditional distribution of service times is
paretian. Several measures of effectiveness are discussed and the
question of statistical estimation of service parameters is also
explored.",
}

@ARTICLE{Heym68:Optimal,
AUTHOR="D. P. Heyman",
TITLE="Optimal operating policies for {M/G/1} queueing systems",
JOURNAL=or,
VOLUME=16,
PAGES="362-382",
YEAR=1968,
REFERENCES=18,
KEYWORDS="M/G/1; cost; optimization",
ABSTRACT="We consider the economic behavior of a m/g/1 queueing system
operating with the following cost structure: a server start-up cost, a
server shut-down cost, a cost per unit time when the server is turned
on, and a holding cost per unit time spent in the system for each
customer. We prove that for the single server queue there is a
stationary optimal policy of the form: turn the server on when n
customers are present, and turn it off when the syst",
}

@ARTICLE{Hild68:Capacity,
AUTHOR="D. K. Hildebrand",
TITLE="On the capacity of tandem server, finite queue, service systems",
JOURNAL=or,
VOLUME=16,
PAGES="72-82",
YEAR=1968,
REFERENCES=7,
KEYWORDS="Queueing system; tandem queue",
ABSTRACT="A queueing model incorporating major features of
'assembly-line' systems is developed. Some simple algebraic consequences
of the structural properties of the model are set forth. The intuitive
construction of the capacity of the system is given, and the capacity is
calculated for some relatively simple exponential-service cases. A
general method for exponential-service is outlined, and completed in
some simple cases.",
}

@ARTICLE{Hill68:Reckoner,
AUTHOR="P. B. Hill and A. N. Stowe",
TITLE="Implementation of a reckoner facility on the Lincoln Laboratory
{IBM} 360/67",
JOURNAL="Interactive systems for experimental applied mathematics",
ADDRESS="New York",
PAGES="385-459",
YEAR=1968,
REFERENCES=23,
KEYWORDS="mathematical method; realization; information system; formula
interpretation; numerical method; interactive mode; numerical
evaluation; formula translation; mathematical programming technique",
ABSTRACT={Another paper in this volume has presented the concept of
coherent programming as it is embodied in the lincoln reckoner. The term
"coherent" implies a set of programs which may be independently
developed, perhaps written in different languages, but which
nevertheless operate on each other's results and call each other. This
concept is being used to build a reckoner facility on the ibm system 360
model 67 at lincoln laboratory.},
}

@BOOK{Hunt68:Construction,
AUTHOR="T. J. Hunter",
TITLE="Construction and control of a multi-access simulator",
PUBLISHER="Manchester university",
ADDRESS="Manchester",
YEAR=1968,
KEYWORDS="Simulation; hardware simulator",
}

@BOOK{Jais68:Priority,
AUTHOR="N. K. Jaiswal",
TITLE="Priority queues",
PUBLISHER="Academic Press",
ADDRESS="New York",
PAGES=240,
YEAR=1968,
REFERENCES=111,
KEYWORDS="Queueing system; priority; SURVEY",
ABSTRACT="Chapter i and ii summarize the results of the basic
infinite-source and finite-source queueing models. Chapter iii-iv are
devoted to the study of priority processes under exogenous priority
disciplines, i.e., head-of-the-line, preemptive-resume and
preemptive-repeat, and discretionary disciplines. Chapter vii reviews
some of the recent work on alternating priorities, round-robin
priorities, dynamic priorities, cutoff priorities, etc. The last",
}

@ARTICLE{Jett68:AMTRAN,
AUTHOR="A. V. Jett",
TITLE="{AMTRAN:} implications of an interactive computer system for an
educational institution",
JOURNAL="Interactive systems for experimental applied mathematics",
PAGES="215-221",
YEAR=1968,
REFERENCES=2,
KEYWORDS="Application; human factors; interactive mode; graphics;
formula interpretation; math. Programming technique",
ABSTRACT="The advent of computing in a remote-terminal time-sharing
conte xt permits the user to interact more directly with the computer in
attacking his problem. Moreover, certain standard problems of numerical
analysis (e.g., least-squares approximations, locating zeroes of
functions, etc.) arise in science and engineering with sufficient
frequency to suggest, in view of remote-terminal capability, the
development of interactive computer systems to",
}

@ARTICLE{Kaba68:Stopping,
AUTHOR="I. W. Kabak",
TITLE="Stopping rules for queueing simulations",
JOURNAL=or,
VOLUME=16,
NUMBER=1,
PAGES="431-437",
YEAR=1968,
REFERENCES=7,
KEYWORDS="Queueing system; simulation; estimation; expectation;
variance; research problem",
ABSTRACT="In queueing simulations when service times and/or
inter-arrival times are exponentially distributed it is possible to
obtain independent estimates of the quantities of interest, such as the
probability of a request being served immediately or the proportion of
requests that are delayed more than (say) T time units. It is shown a
weighted average of estimates of the probability of being served
immediately is asymptotically unbiased for two simpl",
}

@BOOK{Krey68:Statistische,
AUTHOR="E. Kreyszig",
TITLE="Statistische Methoden und ihre Anwendungen",
PUBLISHER="Vandenhoek und Ruprecht",
ADDRESS="Göttingen",
PAGES=422,
YEAR=1968,
LANGUAGE="German",
KEYWORDS="Statistics; statistical test",
}

@ARTICLE{Laza68:MANIAC,
AUTHOR="R. Lazarus and M. Wells and J. Wooten",
TITLE="The {MANIAC} {II} system",
JOURNAL="Interactive System for Experimental Applied Mathematics",
PAGES="38-43",
YEAR=1968,
REFERENCES=2,
KEYWORDS="design; application; numerical method; command language;
formula interpretation; interactive mode",
ABSTRACT="The operating system to be described in this paper serves the
maniac ii computer and about 40 users. Maniac ii is a research computer
and undergoes more or less continual modification and improvement. In
its eleven-year life, it has grown in speed from 10,000 instructions per
second to 100,000, in vacubulary from 80 instructions to about 300, and
in memory size from 12,000 words to 80,000 (changing from half-to
full-word instructions in the pro",
}

@ARTICLE{Matt68:VENUS,
AUTHOR="H. F. Matthews",
TITLE="{VENUS:} a small interactive nonprocedural language",
JOURNAL="Interactive systems for experimental applied mathematics",
ADDRESS="New York",
PAGES="97-105",
YEAR=1968,
KEYWORDS="interactive mode; model; information system; mathematical
method; command language; mathematical programming technique",
ABSTRACT="The guidelines used in the development of venus were chosen to
give the scientifically oriented nonprogrammer a tool which cou ld be
quickly learned and easily used. The syntax was designed for incremental
learning, so that what the user did not know would not hurt him.",
}

@ARTICLE{Meve68:Priority,
AUTHOR="P. Mevert",
TITLE="A priority system with setup times",
JOURNAL=or,
VOLUME=16,
PAGES="602-612",
YEAR=1968,
REFERENCES=12,
KEYWORDS="M/GI/1; PREHOL priority; Laplace transform; expectation;
waiting time",
ABSTRACT="A single server system is considered with 2 classes of
customers. Customers of class 1 have preemptive priority over customers
of class 2 but the order of service within each class is first-come,
first-served. Whenever service is changed from one class to the other an
orientation or change-over time is incurred. Arrivals are Poisson,
service and orientation times are independent and arbitrarily
distributed. Laplace transforms and expected values",
}

@ARTICLE{Mill68:CHARYBDIS,
AUTHOR="J. K. Millen",
TITLE="{CHARYBDIS:} a {LISP} to display mathematical expressions on
typewriter-like devices",
JOURNAL="Interactive systems for experimental applied mathematics",
ADDRESS="New York",
PAGES="155-163",
YEAR=1968,
REFERENCES=8,
KEYWORDS="Mathematical method; formula interpretation; symbolic
algebraic computation; symbolic algebraic language; ext processing;
math. programming technique",
ABSTRACT="Charybdis (from character-composed symbolic display) is a lisp
program to display mathematical expressions on typewriter-like devices
such as line printers, teletypes, and scopes which display lines of
characters, as well as typewriters. It was written as part of the output
interface for mathlab.",
}

@INPROCEEDINGS{Mill68:Response,
AUTHOR="Russ Miller",
TITLE="Response time in man-computer conversational transactions",
BOOKTITLE="Fall Joint Computer Conference",
PAGES="267-277",
YEAR=1968,
REFERENCES=5,
KEYWORDS="Man-machine interaction; response time; classification",
ABSTRACT={The literature concerning man-computer transactions abounds in
controversy about the limits of "system response time" to a user's
command or inquiry at a terminal. This paper attempts a rather
exhaustive listing and definition of different classes of human action
and purpose at terminals of various kinds.},
}

@ARTICLE{Mitr68:Queue,
AUTHOR="I. L. Mitrany and B. Avi-Itzhak",
TITLE="A many-server queue with service interruptions",
JOURNAL=or,
VOLUME=16,
PAGES="628-638",
YEAR=1968,
REFERENCES=8,
KEYWORDS="M/M/N; Z-transform; queue length; service interruption",
ABSTRACT="A steady-state m/m/n queueing system where each server is
subject to random breakdowns of exponentially distributed duration is
studied and analyzed. The moment generating function of the queue size
is obtained in explicit form for $n<2, n=2$. For larger values of n a
numerical method is suggested.",
}

@ARTICLE{Mura68:Additional,
AUTHOR="K. Murari",
TITLE="An additional special channel, limited space queueing problem
with service in batches of variable size",
JOURNAL=or,
VOLUME=16,
PAGES="83-90",
YEAR=1968,
REFERENCES=6,
KEYWORDS="M/M/N/S; FIFO; Laplace transform",
ABSTRACT="This paper studies the transient behavior of a
first-come-first-served queueing problem with service in batches of
variable size, Poisson input, and exponential service time distribution.
Further, when the queue length increases to N, a fixed pre-assigned
positive number, a special service channel capable of serving a group of
N units and possessing exponential service time distribution is made
available and is canceled at the termination of se",
}

@ARTICLE{Nels68:Dual,
AUTHOR="R. T. Nelson",
TITLE="Dual-resource constrained series service systems",
JOURNAL=or,
VOLUME=16,
PAGES="324-341",
YEAR=1968,
REFERENCES=10,
KEYWORDS="M/M/N; tandem queue; labour limited system",
ABSTRACT="A Poisson arrival exponential service queueing system
consisting of two service stages in series is the subject of this study.
The distinguishing characteristic is that the system has only one
laborer. The labor and machine limited system is compared to its
ordinary machine limited counterpart by means of a comparison of
simulation results and theoretical results. Implications of the
experiments are discussed with respect to various facets of",
}

@ARTICLE{Neut68:Two,
AUTHOR="M. F. Neuts",
TITLE="Two queues in series with a finite, intermediate waitingroom",
JOURNAL=jap,
PAGES="123-142",
YEAR=1968,
KEYWORDS="Poisson distribution; semi Markov process; queueing system;
imbedded Markov chain; discrete random variable; arrival process",
ABSTRACT="A service unit i, with Poisson input and general service times
is in series with a unit ii, with negative-exponential service times.
The intermediate waitingroom can accomodate at most $k$ persons and a
customer cannot leave unit i when the waitingroom is full. The paper
shows that this system of queues can be studied in terms of an imbedded
semi-Markov process. Equations for the time dependent distributions are
given, but the main emphasis of the",
}

@ARTICLE{Raje68:Priority,
AUTHOR="A. R. Rajeswari",
TITLE="Non-preemptive priority queue with binomial input",
JOURNAL=or,
VOLUME=16,
PAGES="416-421",
YEAR=1968,
REFERENCES=4,
KEYWORDS="priority; expectation; waiting time; binomial distribution;
FIFO; comparison",
ABSTRACT="In our queue model of nonpreemptive priority discipline, we
assume that arrivals occur at discrete time points, follow binomial
distribution, and have a discrete time service distribution. In the
limit, it is shown that all the parameters of the resulting queue, with
the above arrival and service pattern, agree with those derived already
by various authors, except for different notations used for service and
arrival rates. At the end of this pa",
}

@ARTICLE{Reyn68:Stationary,
AUTHOR="J. F. Reynolds",
TITLE="The stationary solution of a multiserver queueing model with
discouragement",
JOURNAL=or,
VOLUME=16,
PAGES="64-71",
YEAR=1968,
REFERENCES=8,
KEYWORDS="M/M/N/S; waiting time; expectation; characteristic function",
ABSTRACT="Several authors, including Morse Ancker and Gafarian, and Cox
and Smith have studied single-server queueing models in which the
arrival rate is a decreasing function of queue length. This paper
analyzes a multiserver generalization of the model given by Cox and
Smith. A generating function is derived for the equilibrium distribution
of queue length, and from it are derived expressions for the probability
of finding all servers busy on arrival",
}

@ARTICLE{Reyn68:Results,
AUTHOR="J. F. Reynolds",
TITLE="Some results for the bulk-arrival infinite server Poisson queue",
JOURNAL=or,
VOLUME=16,
PAGES="186-189",
YEAR=1968,
REFERENCES=4,
KEYWORDS="MX/M/oo; queue length; Z-transform; autocorrelation",
ABSTRACT="An infinite server queue is considered in which an arrival is
actually a group (of random size) of customers. A generating function
for the time-dependent queue length is obtained, and used to show that
the limiting distribution is compound Poisson. It is also shown that the
regression of queue length at time T on the initial length is linear,
and from this an expression for the autocorrelation function is
deduced.",
}

@ARTICLE{Saka68:Round,
AUTHOR="M. Sakata and S. Noguchi and J. Oizumi",
TITLE="On the round-robin procedure for time-sharing systems",
JOURNAL="Electronics communication",
VOLUME="51-C",
PAGES="124-132",
YEAR=1968,
REFERENCES=10,
KEYWORDS="M/G/1; feedback; processor sharing; time sharing; overhead
time; M/Ek/1; M/Hk/1",
ABSTRACT="A theoretical analysis is presented for the round-robin
process ing technique based on the M/G/1 waiting-matrix model, in order
to solve the problem of the time-sharing system-scheduling algorithm.
Special attention is given to service time distributions of the Erlang
and hyperexponential type.",
}

@ARTICLE{Schm68:Eingebettete,
AUTHOR="W. Schmidt",
TITLE="Die eingebettete Markoffkette im Wartesystem mit einer
Bedienungsstelle",
JOURNAL=ntz,
VOLUME=21,
PAGES="695-",
YEAR=1968,
LANGUAGE="German",
KEYWORDS="Queueing system",
}

@ARTICLE{Schr68:Proof,
AUTHOR="L. Schrage",
TITLE="A proof of the optimality of the shortest remaining processing
time discipline",
JOURNAL=or,
VOLUME=16,
PAGES="687-690",
YEAR=1968,
REFERENCES=2,
KEYWORDS="G/G/1; number of elements in system; comparison; SRPT;
shortest remaining processing time",
}

@ARTICLE{Seit68:AMTRAN,
AUTHOR="R. N. Seitz and L. H. Wood and C. A. Ley",
TITLE="{AMTRAN:} automatic mathematical translation",
JOURNAL="Interactive systems for experimental applied mathematics",
ADDRESS="New York",
PAGES="44-65",
YEAR=1968,
REFERENCES=3,
KEYWORDS="Application; human factors; differential calculus; integral
calculus; numerical method; FORTRAN; formula interpretation; formula
translation; numerical evaluation; graphics; time sharing; interactive
mode; math. programming technique",
ABSTRACT={Amtran is a time-sharing remote-terminal computer system
ultimately intended to permit scientists and engineers to "converse"
directly with a computer in a "natural" mathematical language. Its
current objectives entail attainment of the following goals: a.
"automatic" mathematical problem-solving, b. High-speed, on-line,
scientific programming, c. A macro-compiler and operating system, and d.
The development of low-cost, 5,000 - 15,000 dollars},
}

@TECHREPORT{Wagn68:Kombiniertes,
AUTHOR="W. Wagner",
TITLE="Über ein kombiniertes Warte-Verlust-System mit Prioritäten",
TYPE="Bericht über verkehrstheoretische Arbeiten",
INSTITUTION="Universität Stuttgart",
ADDRESS="Stuttgart, Germany",
YEAR=1968,
LANGUAGE="German",
KEYWORDS="Queueing system; delay loss model; priority",
}

@ARTICLE{Buza68:Prediction,
AUTHOR="J. A. Buzacott",
TITLE="Prediction of the efficiency of production systems without
internal storage",
JOURNAL="The International Journal Of Production Research",
VOLUME=6,
NUMBER=3,
PAGES="173-187",
YEAR=1968,
REFERENCES=13,
KEYWORDS="Effectiveness; production system; no internal storage",
ABSTRACT="The efficiency of production systems consisting of a number of
interconnected stations can be predicted from the characteristicsof
stations when there is no internal storage. Formulae are developed the
efficiency of the basic connection, without and with rit is shown how
the efficiency of more complex systems can be predicted using the basic
formulae. It is shown that usually thesplitting type of redundancy is
best.",
}

@ARTICLE{Dais68:Zur,
AUTHOR="G. Daisenberger",
TITLE="Zur Korrelation zwischen den Belegungszuständen benachbarter
Koppelabschnitte in Koppelanordnungen",
JOURNAL=aeu,
VOLUME=22,
NUMBER=7,
YEAR=1968,
LANGUAGE="German",
KEYWORDS="Link system",
}

@ARTICLE{Dais68:Verlustberechnung,
AUTHOR="G. Daisenberger",
TITLE="Verlustberechnung mit Verzweigungskorrektur bei
Zwischenleitungsanordnungen",
JOURNAL=ntz,
VOLUME=21,
PAGES="28-31",
YEAR=1968,
LANGUAGE="German",
KEYWORDS="Link system",
}

@ARTICLE{Dart68:Verkehrsschwankungen,
AUTHOR="J. P. Dartois and A. Rodriguez",
TITLE="Verkehrsschwankungen in kleinen Teilnehmergruppen",
JOURNAL="Elektrisches Nachrichtenwesen",
VOLUME=43,
NUMBER=1,
YEAR=1968,
LANGUAGE="German",
KEYWORDS="Loss system",
}

@ARTICLE{Hage68:Gruppierung,
AUTHOR="L. Hagenhaus and J. Reger",
TITLE="Gruppierung der Teilnehmerwahlstufe im System {ESK} 10 000 E",
JOURNAL="Information Fernsprech-Vermittlungstechnik Siemens AG",
ADDRESS="München",
VOLUME=4,
NUMBER=2,
PAGES="71-75",
YEAR=1968,
LANGUAGE="German",
KEYWORDS="Link system",
}

@ARTICLE{Hala68:Zwischenleitungsanordnungen,
AUTHOR="E. Halama",
TITLE="Zwischenleitungsanordnungen in Fernsprech-Nebenstellenanlagen",
JOURNAL=fernmeldepraxis,
VOLUME=45,
NUMBER=6,
YEAR=1968,
LANGUAGE="German",
KEYWORDS="Link system",
}

@ARTICLE{Hein68:Vereinfachte,
AUTHOR="G. Heinrich and K. Trautmann",
TITLE="Vereinfachte Normmischungen hinter einstufigen Koppelanordnungen
in der Vermittlungstechnik",
JOURNAL=ntz,
VOLUME=3,
YEAR=1968,
LANGUAGE="German",
KEYWORDS="Grading",
}

@TECHREPORT{Herz68:Bemessung,
AUTHOR="U. Herzog",
TITLE="Die Bemessung ein- und mehrstufiger Koppelanordnungen der
Vermittlungstechnik für angebotenen Überlaufverkehr",
INSTITUTION="5. Bericht über verkehrstheoret. Arbeiten, Institut f.
Nachrichtenverm. und Datenverkehr, Uni. Stuttgart",
ADDRESS="Stuttgart",
VOLUME=5,
YEAR=1968,
LANGUAGE="German",
KEYWORDS="Overload control; flow control; communication network",
}

@TECHREPORT{Hube68:Verlustwahrscheinlichkeit,
AUTHOR="M. Huber",
TITLE="Die Verlustwahrscheinlichkeit zweistufiger
Zeitmultiplex-Koppelanordnungen mit Spiegelanschlüssen",
INSTITUTION="Universität Stuttgart",
ADDRESS="Stuttgart",
YEAR=1968,
LANGUAGE="German",
KEYWORDS="TDM; time division multiplex",
}

@ARTICLE{Joel68:Permutation,
AUTHOR="A. E. Joel",
TITLE="On Permutation Switching Networks",
JOURNAL=bstj,
VOLUME=46,
NUMBER=5,
YEAR=1968,
KEYWORDS="Link system",
}

@ARTICLE{Kibb68:Determination,
AUTHOR="W. F. Kibble",
TITLE="The determination of telephone-Traffic blocking in groups of
trunk circuits",
JOURNAL="CEC-AEI Telecommunications",
VOLUME=37,
YEAR=1968,
KEYWORDS="Overload control; flow control; communication network",
}

@ARTICLE{Krui68:Warteprobleme,
AUTHOR="H. Kruithof",
TITLE="Warteprobleme in Koppelanordnungen mit nur einer Abnehmerleitung
konstanter Belegungszahl je Stunde und konstanter Belegungsdauer",
JOURNAL="Elektrisches Nachrichtenwesen",
VOLUME=43,
NUMBER=1,
YEAR=1968,
LANGUAGE="German",
KEYWORDS="Delay system",
}

@ARTICLE{Levy68:Berechnung,
AUTHOR="G. Lévy-Soussan",
TITLE="Berechnung der Erlang-Funktion mit Hilfe einer
Kettenbruchentwicklung",
JOURNAL=en,
VOLUME=43,
NUMBER=2,
PAGES="167-172",
YEAR=1968,
LANGUAGE="German",
KEYWORDS="Loss system",
}

@ARTICLE{Miya68:Statistical,
AUTHOR="M. Miyazaki and M. Yokoi and G. Nakamura and Y. Murao",
TITLE="On Statistical Forecasting of Telephone Demands in Small Areas",
JOURNAL=recl,
VOLUME=16,
NUMBER="7-8",
YEAR=1968,
KEYWORDS="Gos",
}

@ARTICLE{Mohr68:Verkehrsmessungen,
AUTHOR="E. Mohr",
TITLE="Verkehrsmessungen nach dem Verkehrsgrößen-Abtastverfahren",
JOURNAL=fernmeldepraxis,
VOLUME=45,
NUMBER=20,
YEAR=1968,
LANGUAGE="German",
KEYWORDS="Measurement",
}

@ARTICLE{Ott68:Berechnung,
AUTHOR="K.-W. Ott and F. de los",
TITLE="Berechnung von städtischen Fernsprechnetzen mit Leitweglenkung
und Überlaufwegen durch Computer",
JOURNAL="Elektrisches Nachrichtenwesen",
VOLUME=43,
NUMBER=2,
YEAR=1968,
LANGUAGE="German",
KEYWORDS="Overload control; flow control; communication network",
}

@ARTICLE{Schm68:System,
AUTHOR="M. Schmöller and G. Wegmann",
TITLE="System {ESK} 10 000 {E;} Gruppierung der
Teilnehmer-Richtungswahlstufefür kleine Ämter",
JOURNAL="Information Fernsprechvermittlungstechnik Siemens AG",
VOLUME=4,
NUMBER=4,
YEAR=1968,
LANGUAGE="German",
KEYWORDS="Link system",
}

@TECHREPORT{Thie68:Wartesystem,
AUTHOR="M. H. Thierer",
TITLE="Wartesystem-Tafeln für unvollkommene und vollkommene
Erreichbarkeit nach der Interconnects-Warteformel {(IDF)}",
INSTITUTION="Institut für Nachrichtenvermittlung und Datenverarbeitung
der TH Stuttgart",
ADDRESS="Stuttgart, Germany",
NUMBER="7. Bericht über ver",
YEAR=1968,
LANGUAGE="German",
KEYWORDS="Delay system",
}

@ARTICLE{Evan68:Comments,
AUTHOR="R. V. Evans",
TITLE="Comments on ``Some inequalities in queuing'' by {K.} {T.}
Marshall",
JOURNAL=or,
VOLUME=16,
NUMBER=3,
PAGES="666-668",
YEAR=1968,
}

@ARTICLE{Greg68:Generalization,
AUTHOR="G. Gregory and K. Sharpe",
TITLE="A generalization of the rejection procedure for the generation of
random variables",
JOURNAL="The Australian Computer Journal",
VOLUME=1,
NUMBER=3,
PAGES="169-172",
YEAR=1968,
KEYWORDS="random number generation",
}

@ARTICLE{Harr68:Correction,
AUTHOR="C. R. Harris",
TITLE={Correction to "Queues with state-dependent stochastic service
rates"},
JOURNAL=or,
VOLUME=16,
NUMBER=4,
PAGES="885-886",
YEAR=1968,
}

@MISC{Lavy68:Numerical,
AUTHOR="G. Lavy-Soussan",
TITLE="Numerical evaluation of the {Erlang} function through a continued
fraction algorithm",
YEAR=1968,
KEYWORDS="Queueing theory; numerical evaluation",
}

@ARTICLE{Ott68:Cumputation,
AUTHOR="K.-W. Ott and F. de los",
TITLE="Cumputation of urban trunking networks with alternative routing
by computers",
JOURNAL=ec,
ADDRESS="Paris",
VOLUME=43,
NUMBER=2,
PAGES="161-166",
YEAR=1968,
}

@ARTICLE{Sibu68:Generating,
AUTHOR="M. Sibuya",
TITLE="Generating doubly exponential random numbers",
JOURNAL="Annals of the Institute of Statistical Mathematics, Supplement
5",
PAGES="1-7",
YEAR=1968,
KEYWORDS="random number generation",
}

@INPROCEEDINGS{Davi68:Principles,
AUTHOR="Donald W. Davies",
TITLE="The principles of a data communication network for computers and
remote peripherals",
BOOKTITLE="Information Processing",
PUBLISHER="North-Holland",
ADDRESS="Edinburgh, Scotland",
PAGES="709-715",
NOTE="See also \cite[p. 152--157]{Chu74:Advances}",
YEAR=1968,
REFERENCES=4,
KEYWORDS="Design; data network; communication network; computer",
ABSTRACT="In this paper, the design of a data network for computers and
terminals is outlined. Further details of parts of the system are given
in companion papers. The new design seems, on the evidence available, to
be economic and adeptable to future changes both in users requirements
and in the technologies of transmission, logic and storage.",
}

@INCOLLECTION{Aben68:Compound,
AUTHOR="K Abend",
TITLE="Compound descision procedures for unknown distributions and for
dependent states of nature",
BOOKTITLE="pattern",
EDITOR="L Kanal",
PUBLISHER="Thompson",
ADDRESS="Washington",
PAGES="207-249",
YEAR=1968,
}

@ARTICLE{Alek68:Microcircuit,
AUTHOR="I Aleksander and E H Mamdani",
TITLE="Microcircuit learning nets: improved recognition by means of
pattern feedback",
JOURNAL=elet,
VOLUME=4,
NUMBER=20,
PAGES="425-426",
YEAR=1968,
ABSTRACT="Pattern feedback is a new concept in learning networks of
adaptive microcircuits. The net is trained to produce a model output
pattern. During use, the output patterns are fed back to the input.
Recognition of an input pattern takes place if a stable model output
pattern is generated.",
}

@BOOK{Fu68:Sequential,
AUTHOR="K S Fu",
TITLE="Sequential methods in pattern recognition and machine learning",
PUBLISHER="New York Academic Press",
YEAR=1968,
}

@ARTICLE{Peas68:Adaptation,
AUTHOR="M C Pease",
TITLE="An adaptation of the fast fourier transform for parallel
processing",
JOURNAL=jacm,
VOLUME=15,
PAGES="252-264",
YEAR=1968,
}

@ARTICLE{Lync6806:Reliable,
AUTHOR="W. C. Lynch",
TITLE="Reliable full duplex file transmission over half-duplex telephone
lines",
JOURNAL=cacm,
VOLUME=11,
NUMBER=6,
PAGES="407-410",
YEAR=1968,
}

@BOOK{Kupf68:Hrung,
AUTHOR="K. Küpfmüller",
TITLE="Einführung in die theoretische Elektrotechnik",
PUBLISHER="Springer-Verlag 9. Auflage",
ADDRESS="Berlin, Germany",
PAGES=561,
YEAR=1968,
LANGUAGE="German",
REFERENCES=100,
KEYWORDS="Maxwell theory",
}

@ARTICLE{Lind68:Pseudo,
AUTHOR="J. H. Lindholm",
TITLE="An analysis of the pseudo-random properties of subsequences of
long m-sequences",
JOURNAL=ieeeit,
VOLUME="IT-14",
PAGES="569-",
YEAR=1968,
KEYWORDS="Shift register sequences",
}

@ARTICLE{Mars68:Inequalities,
AUTHOR="K. T. Marshall",
TITLE="Some inequalities in queueing",
JOURNAL=or,
VOLUME=16,
PAGES="651-668",
YEAR=1968,
REFERENCES=8,
KEYWORDS="GI/G/1; D/G/1; performance evaluation; comparison; inequality;
performance measure; queueing system",
ABSTRACT="Bounds are found various measures of performance in certain
classes of the gi/g/1 queue.  First, the mean wait in queue is found in
terms of the mean and variance of the interarrival, service, and idle
distributions.  Bounds on the idle time moments lead to bounds on the
mean wait and number in queue.  The interarrival time distribution is
then assumed to have mean residual life bounded above by 1/lambda
(lambda= arrival rate)",
}

@PHDTHESIS{Wagn68:Über,
AUTHOR="W. Wagner",
TITLE="Über ein kombiniertes Warte-Verlust-System mit Prioritäten",
SERIES="Bericht über verkehrstheoretische Arbeiten",
SCHOOL="Universität Stuttgart, IND",
ADDRESS="Stuttgart, Germany",
YEAR=1968,
LANGUAGE="German",
KEYWORDS="Queueing system; delay loss model; priority",
}

@ARTICLE{Akim6805:Derivatives,
AUTHOR="H. Akimaru and T. Nishimura",
TITLE="Derivatives of Trunk Functions for full Availability Systems",
JOURNAL=recl,
ADDRESS="Japan",
VOLUME=16,
NUMBER="5-6",
PAGES="350-356",
YEAR=1968,
REFERENCES=11,
KEYWORDS="Loss system",
}

@ARTICLE{Allm6801:Hrung,
AUTHOR="D. Allmendinger",
TITLE="Einführung in die Verkehrstheorie",
JOURNAL=fernmeldepraxis,
ADDRESS="Germany",
VOLUME=45,
NUMBER=1,
PAGES="1-29",
YEAR=1968,
LANGUAGE="German",
KEYWORDS="Loss system",
}

@ARTICLE{Behl6803:Suchwahlanordnungen,
AUTHOR="E. Behlendorf and W. Eberhardt and L. Hagenhaus",
TITLE="Suchwahlanordnungen-Prinzipien und ihre Ausf hrung {ESK} 10 000
E",
JOURNAL="Informationen Fernsprechvermittlungs-Technik S+H",
ADDRESS="Germany",
VOLUME=4,
NUMBER=3,
YEAR=1968,
KEYWORDS="Link system",
}

@ARTICLE{Bern6804:Teilnehmerkoppelnetze,
AUTHOR="R. Bernard and M. Gruszecki and J. R. De los Mozos",
TITLE="Teilnehmerkoppelnetze in Pentaconta {PC} 1000 C
Ortsvermittlungsstellen",
JOURNAL="Elektrisches Nachrichtenwesen",
ADDRESS="Germany",
VOLUME=43,
NUMBER=4,
YEAR=1968,
LANGUAGE="German",
KEYWORDS="Link system",
}

@ARTICLE{Arhn68:Unders,
AUTHOR="J. Arhnung",
TITLE="Unders gelse af Graderingers Effektivitet ved Simulation",
JOURNAL="Teleteknik",
ADDRESS="Sweden",
PAGES="58-64",
YEAR=1968,
LANGUAGE="Swedish",
KEYWORDS="Simulation",
}

@ARTICLE{Bori6802:Verkehrsgrössen,
AUTHOR="W. Borissoff and R. Rodrian",
TITLE="Verkehrsgrössen-Abtasteinrichtung {VGA} 68",
JOURNAL="Informationen Fernsprech-Vermittlungstechnik",
ADDRESS="Germany",
VOLUME=4,
NUMBER=2,
PAGES="80-85",
YEAR=1968,
LANGUAGE="German",
KEYWORDS="traffic measurement",
}

@TECHREPORT{Forc68:Moe,
AUTHOR="N. Forchhammer",
TITLE={Moe's Princip Anvendt på {DTHL's} {AKD} 791, som "Human
Engineering"},
INSTITUTION="L M Ericsson A/S",
ADDRESS="Copenhagen, Denmark",
PAGES=3,
YEAR=1968,
LANGUAGE="Danish",
KEYWORDS="Optimization; Traffic Theory; Switching System",
}

@TECHREPORT{Höhn68:Influence,
AUTHOR="H. D. Höhne",
TITLE="Influence of Long Transmission Delays and Reverberation on the
Telephone Conversations of Testpersons",
INSTITUTION="Heinrich Hertz Institut für Schwingungsforschung. Berlin",
ADDRESS="Berlin, Germany",
PAGES=28,
YEAR=1968,
KEYWORDS="Traffic measurement; end-to-end delay",
ABSTRACT="Subscriber behaviour",
}

@ARTICLE{Joys68:Engsets,
AUTHOR="L. A. Joys",
TITLE="Engsets formel for sannsynlighetstetthet og dens
rekursjonsformler",
JOURNAL="Teletronikk",
ADDRESS="Norway",
VOLUME="1-2",
PAGES="54-63",
YEAR=1968,
LANGUAGE="Norwegian",
KEYWORDS="Engset formula",
}

@ARTICLE{Mejz68:Generalisation,
AUTHOR="D. Mejzler",
TITLE="A Generalisation of Erlang's Formulas in Queueing Theory",
JOURNAL=jap,
VOLUME=5,
PAGES="143-157",
YEAR=1968,
KEYWORDS="Queueing theory; Erlang B formula; Erlang C formula",
}

@ARTICLE{Oliv68:Table,
AUTHOR="R. M. Oliver",
TITLE="Table of the Waiting Time Distribution for the Constant Service
Queue {(M/D/1)}",
JOURNAL="International Journal of Computer Mathematics",
VOLUME=2,
PAGES="35-56",
YEAR=1968,
KEYWORDS="M/D/1; waiting time",
}

@ARTICLE{Howa6807:Practicality,
AUTHOR="Ronald A. Howard",
TITLE="The Practicality Gap",
JOURNAL=ms,
VOLUME=14,
NUMBER=7,
PAGES="503-507",
YEAR=1968,
}

@TECHREPORT{Rahk68:Further,
AUTHOR="K. Rahko",
TITLE="Further Motivations to the New Question {B/XIII} Based on Traffic
Measurements Made in Finland on Local, Long-Distance, and International
Routes",
INSTITUTION="Research Institute of the Helsinki Telephone Company",
ADDRESS="Helsinki, Finland",
NUMBER=49,
PAGES=29,
YEAR=1968,
KEYWORDS="Traffic measurement",
}

@TECHREPORT{Rahk68:Phenomena,
AUTHOR="K. Rahko",
TITLE="Phenomena in Telephone Traffic Caused by Subscriber Reactions",
INSTITUTION="Research Institute of the Helsinki Telephone Company",
ADDRESS="Helsinki, Finland",
NUMBER=50,
PAGES=32,
YEAR=1968,
KEYWORDS="Traffic source model",
}

@ARTICLE{Rahk68:Relationship,
AUTHOR="K. Rahko",
TITLE="Relationship Between Traffic Theory and Information Theory",
JOURNAL="Ylipainos Sähkö-lehdestä",
ADDRESS="Finland",
NUMBER=9,
PAGES=2,
YEAR=1968,
KEYWORDS="Traffic engineering",
}

@TECHREPORT{Rahk68:Control,
AUTHOR="K. Rahko",
TITLE="Control System for the Loading of Traffic Routes",
INSTITUTION="Helsingfors Telefonförenings Forskningsanstalt",
ADDRESS="Helsinki, Finland",
NUMBER=48,
PAGES=8,
YEAR=1968,
KEYWORDS="Routing",
}

@TECHREPORT{Schm68:Failure,
AUTHOR="K. Schmidt",
TITLE="Evaluation of Failure Risk for Dikes Exposed to Sturm Surges",
INSTITUTION="IMSOR, Technical University of Denmark",
ADDRESS="Lyngby, Denmark",
PAGES=25,
YEAR=1968,
KEYWORDS="Reliability",
}

@ARTICLE{Schm68:Operationsanalytiske,
AUTHOR="K. Schmidt",
TITLE="Operationsanalytiske Metoders Anvendelse på Lagerstyring",
JOURNAL="Dansk Ingenirforening",
ADDRESS="Denmark",
PAGES=46,
YEAR=1968,
LANGUAGE="Danish",
KEYWORDS="Manufacturing system",
}

@TECHREPORT{Schr68:Planlægning,
AUTHOR="J. Schröder",
TITLE="Planlægning ved anvendelse af enmmatematisk model, belyst ved et
praktisk eksempel til Investeringsplanlægning i en erhvervsvirksomhed",
INSTITUTION="IMSOR, Danmarks tekniske Hojskole",
ADDRESS="Lyngby, Denmark",
PAGES=33,
YEAR=1968,
LANGUAGE="Danish",
KEYWORDS="Network planning",
}

@INCOLLECTION{Hube68:Simulation,
AUTHOR="M. Huber and W. Wagner",
TITLE="Simulation von Nachrichtenvermittlungssystemen",
BOOKTITLE="Nicht-numerische Informationsverarbeitung",
EDITOR="R. Gunzenhäuser",
PUBLISHER="Springer-Verlag",
ADDRESS="Berlin, Germany",
PAGES="147-171",
YEAR=1968,
LANGUAGE="German",
KEYWORDS="Switching system; simulation",
}

@ARTICLE{Zang6807:Minimum,
AUTHOR="W. I. Zangwill",
TITLE="Minimum Concave Cost flows in Certain Networks",
JOURNAL=ms,
VOLUME=14,
NUMBER=7,
PAGES="429-450",
YEAR=1968,
KEYWORDS="Network planning; cost function",
}

@INPROCEEDINGS{Davi68:Communication,
AUTHOR="Donald W. Davies",
TITLE="Communication networks to serve rapid-response computers",
BOOKTITLE="Information Processing",
PUBLISHER="North-Holland",
ADDRESS="Amsterdam, Holland",
PAGES="650-658",
YEAR=1968,
REFERENCES=4,
KEYWORDS="Communication network; real time; store-and-forward",
ABSTRACT="Requirements of real time systems on communication networks
are considered. A part of a discussion and a commentary is given.",
}

@BOOK{Fell68:Probability,
AUTHOR="W. Feller",
TITLE="An Introduction to Probability Theory and its Applications",
EDITION="third",
PUBLISHER="John Wiley and Sons",
ADDRESS="New York, New York",
VOLUME=1,
YEAR=1968,
KEYWORDS="probability theory",
}

@ARTICLE{Chow68:Approximating,
AUTHOR="C. H. Chow and Changdong Liu",
TITLE="Approximating discrete probability distributions with dependence
trees",
JOURNAL=ieeeit,
VOLUME=14,
NUMBER=3,
PAGES="462-467",
YEAR=1968,
LANGUAGE="English",
}

@ARTICLE{Brad6801:Statistical,
AUTHOR="Paul T. Brady",
TITLE="A Statistical Analysis of On-Off Patterns in 16 Conversations",
JOURNAL=bstj,
VOLUME=47,
NUMBER=1,
PAGES="73-91",
MONTH=jan,
YEAR=1968,
KEYWORDS="packet voice; voice source model",
}

@TECHREPORT{Salt6802:Search,
AUTHOR="Gerard Salton",
TITLE="Search and Retrieval Experiments in Real-Time Information
Retrieval",
INSTITUTION="Cornell University, Computer Science Department",
NUMBER="TR68-8",
PAGES=16,
MONTH=feb,
YEAR=1968,
ABSTRACT="Future operating document retrieval systems may be based on
fully-automatic information analysis methods instead of manual indexing,
and on real-time search procedures which allow the user to interact with
the system during the search process. Performance characteristics are
first given for fully-automatic information retrieval systems, and
comparisons are made with presently operating partly-manual systems.
Thereafter, various user-controlled search strategies are described, and
the potential of these strategies in improving systems performance is
discussed. The evaluation results for the real-time retrieval procedures
are used to derive design criteria for future automatic information
systems.",
}

@PHDTHESIS{Thie6803:Wartesysteme,
AUTHOR="M. H. Thierer",
TITLE="Wartesysteme mit unvollkommener Erreichbarkeit",
SCHOOL="Universität Stuttgart",
ADDRESS="Stuttgart",
MONTH=mar,
YEAR=1968,
LANGUAGE="German",
KEYWORDS="Queueing system",
}

@ARTICLE{Reek6803:Dealing,
AUTHOR="A. van Reeken",
TITLE="Dealing with Neely's algorithms",
JOURNAL=cacm,
VOLUME=11,
NUMBER=3,
PAGES="149-150",
MONTH=mar,
YEAR=1968,
KEYWORDS="Simulation; statistics; numeric calculation",
}

@ARTICLE{Dijk6803:Go,
AUTHOR="Edsger W. Dijkstra",
TITLE="Go To Statement Considered Harmful",
JOURNAL=cacm,
VOLUME=11,
NUMBER=3,
PAGES="147-148",
MONTH=mar,
YEAR=1968,
LANGUAGE="English",
REFERENCES=2,
KEYWORDS="go to statement; goto; jump instruction; branch instruction;
conditional clause; alternative clause; repetitive clause; program
intelligibility; program sequencing",
ABSTRACT={For a number of years I have been familiar with the
observation that the quality of programmers is a decreasing function of
the density of go to statements in the programs they produce. More
recently I discovered why the use of the go to statement has such
disastrous effects, and I became convinced that the go to statement
should be abolished from all "higher level" programming languages (i.e.
everything except, perhaps, plain machine code). At that time I did not
attach too much importance to this discovery; I now submit my
considerations for publication because in very recent discussions in
which the subject turned up, I have been urged to do so.},
URL="http://www.acm.org/classics/oct95/",
}

@ARTICLE{Kube6804:Perspective,
AUTHOR="B. Kubert and J. Szabo and S. Giuleri",
TITLE="The perspective representation of functions of two variables",
JOURNAL=jacm,
VOLUME=15,
NUMBER=2,
PAGES="193-204",
MONTH=apr,
YEAR=1968,
KEYWORDS="perspective; perspective representation; perspective plotting;
illustrations; graphics; computer graphics",
ABSTRACT="A perspective transformation is developed whereby an object in
space as viewed from an arbitrary point can be projected into a plane
and plotted. Families of curves which can be used to define such an
object are discusses and examples are given. An algorithm which
eliminates the plotting of hidden portions of the object is discussed.",
}

@ARTICLE{Dijk6805:Structure,
AUTHOR="E. W. Dijkstra",
TITLE="The Structure of the {THE} Multiprogramming System",
JOURNAL=cacm,
VOLUME=11,
NUMBER=5,
PAGES="341-346",
MONTH=may,
YEAR=1968,
KEYWORDS="layering",
}

@ARTICLE{Bell6807:Algorithm,
AUTHOR="J. R. Bell",
TITLE="Algorithm 334: Normal random deviates {[G5]}",
JOURNAL=cacm,
VOLUME=11,
NUMBER=7,
PAGES=498,
MONTH=jul,
YEAR=1968,
KEYWORDS="random number generation",
}

@ARTICLE{Burk6808:Output,
AUTHOR="P. J. Burke",
TITLE="The Output Process of a Stationary $M/M/s$ Queueing System",
JOURNAL=ams,
VOLUME=39,
NUMBER=4,
PAGES="1144-1152",
MONTH=aug,
YEAR=1968,
KEYWORDS="queueing theory; output process; M/M/1",
ABSTRACT="shows that output process is Poisson",
}

@TECHREPORT{Thie6809:Wartesysteme,
AUTHOR="M. H. Thierer",
TITLE="Wartesysteme mit unvollkommener Erreichbarkeit und konstanter
Belegungsdauer",
INSTITUTION="Universität Stuttgart, Germany",
ADDRESS="Stuttgart, Germany",
MONTH=sep,
YEAR=1968,
LANGUAGE="German",
KEYWORDS="Queueing system",
}

@INPROCEEDINGS{Bech6809:Traffic,
AUTHOR="M. J. Bechmann",
TITLE="Traffic Flows and networks",
BOOKTITLE="European Meeting on Statistics, Econometrics and Management
Science",
PAGES=25,
MONTH=sep,
YEAR=1968,
KEYWORDS="Traffic engineering; traffic density; traffic flow analysis;
network",
}

@MISC{Burk6809:Notes,
AUTHOR="P. J. Burke",
TITLE={Notes for "Output Processes and Tandem Queues"},
ADDRESS="Lyngby, Denmark",
PAGES=3,
NOTE="Foredrag på IMSOR",
MONTH=sep,
YEAR=1968,
KEYWORDS="Output process; tandem queue",
}

@INPROCEEDINGS{Chri6809:Stochastic,
AUTHOR="H. D. Christiansen",
TITLE="Stochastic Diffusion Processes with Partial Absorption. Theory
and a Fall-out Example",
BOOKTITLE="European Meeting of IMS, TIMS, ES, IASPS",
ADDRESS="Amsterdam",
PAGES=24,
DAYS=2,
MONTH=sep,
YEAR=1968,
KEYWORDS="Diffusion Approximation",
}

@TECHREPORT{Elld6811:Tasks,
AUTHOR="A. Elldin",
TITLE="Tasks and Trends for Telephone Traffic Research and Engineering",
INSTITUTION="Telefonaktiebolaget L M Ericsson",
ADDRESS="Stockholm, Sweden",
NUMBER="DtG 50944-1",
PAGES=30,
DAYS=25,
MONTH=nov,
YEAR=1968,
KEYWORDS="Telephony; traffic analysis; traffic engineering",
}

@INPROCEEDINGS{Feld6812:GPSS,
AUTHOR="H. Felder",
TITLE="The {GPSS/360} random number generator",
BOOKTITLE="2nd conference of applications of simulation",
ADDRESS="New York",
MONTH=dec,
YEAR=1968,
KEYWORDS="Simulation; random number generation; GPSS",
}

@ARTICLE{Snow6812:Algorithm,
AUTHOR="R. H. Snow",
TITLE="Algorithm 342: Generator of random numbers satisfying the Poisson
distribution {[G5]}",
JOURNAL=cacm,
VOLUME=11,
NUMBER=12,
PAGES="819-820",
MONTH=dec,
YEAR=1968,
KEYWORDS="random number generation",
}