23-Ind-A6 Systems Simulation · December 2017
Nivaar worked solution (AI-drafted; not reviewed by a licensed engineer)
National Exams — December 2017 — 98-Ind-A6 Systems Simulation. Three-hour, closed-book exam; one of two permitted calculators (Sharp or Casio), two 8.5″×11.0″ aid sheets (both sides). Format: eight questions of equal value (10 marks each); candidates complete SIX of the EIGHT (only the first six as they appear in the answer book are marked). All eight questions are solved below for completeness (the paper's own Q6 is printed with an orphan leading "6." followed by "2. Consider an M/M/1 system…" and is answered as the paper's sixth question). Common Discrete/Continuous Distribution tables, Student-t and Chi-square tables were supplied with the exam; the values below are the same table values obtained by direct computation.
Reference texts: Banks, Carson, Nelson & Nicol, Discrete-Event System Simulation (5th ed., Pearson) — random-number/random-variate generation, input data analysis, output analysis (replications), comparing alternative systems, queueing simulation, and the simulation study life cycle.
Question text not reproduced: the examination questions are © Engineers and Geoscientists BC. Open the official past paper (linked at the top of this page) to read the question, then follow the worked solution below.
Given. Five days of observed counts:
| Period | Day 1 | Day 2 | Day 3 | Day 4 | Day 5 |
|---|---|---|---|---|---|
| 8–9 | 3.3 | 3.5 | 3.1 | 3.7 | 3.5 |
| 9–10 | 3.4 | 4.1 | 3.3 | 3.9 | 3.4 |
| 10–11 | 3.9 | 3.8 | 4.1 | 3.7 | 3.8 |
Find. (a) two Poisson(3) variates via inverse transform; (b) whether the mean arrival rate is unchanged (stationary) from 9–10 vs. 10–11; (c) why the "change $\lambda$ on the fly" heuristic is wrong for a non-homogeneous Poisson process (NHPP).
Approach. (a) inverse-transform the discrete Poisson CDF; (b) since the same 5 days are measured in both hours, use a paired $t$-test on the day-by-day differences; (c) reason from the definition of an NHPP's cumulative-rate function.
| Quantity | Result |
|---|---|
| (a) Poisson(3) variate at $u=0.02$ | $X=0$ |
| (a) Poisson(3) variate at $u=0.30$ | $X=2$ |
| (b) paired $t$ (9-10 vs 10-11) | $t=-1.136$, $t_{crit}=2.776$ — stationary (fail to reject) |
(c) Why "changing $\lambda$ on the fly" is wrong. The naive recipe generates the next interarrival time as $-\ln(U)/\lambda(\text{now})$, i.e. it treats the process as freshly homogeneous, with the CURRENT instantaneous rate, at every draw. A true NHPP is defined by its cumulative rate function $\Lambda(t)=\int_0^t\lambda(s)\,ds$, not by memoryless behaviour local to the current clock time — an arrival "due" under the real $\lambda(t)$ trajectory can be systematically delayed or advanced whenever $\lambda$ changes mid-interarrival, and the count of arrivals in any interval straddling a rate change is not correctly Poisson-distributed with the right expectation under the naive method. The two textbook-correct techniques are: (1) inverse-transform on $\Lambda(t)$ — generate a unit-rate homogeneous Poisson process and map its arrival times through $\Lambda^{-1}$; or (2) thinning (Lewis–Shedler) — generate candidate arrivals as a homogeneous Poisson process at the maximum rate $\lambda^*=\max_t\lambda(t)$ over the horizon, then accept each candidate at time $t$ with probability $\lambda(t)/\lambda^*$. Both respect the entire $\lambda(t)$ trajectory rather than only its value at the instant of each draw.