Modeling and Simulation Examination Review

0.0(0)
Studied by 0 people
call kaiCall Kai
learnLearn
examPractice Test
spaced repetitionSpaced Repetition
heart puzzleMatch
flashcardsFlashcards
GameKnowt Play
Card Sorting

1/39

flashcard set

Earn XP

Description and Tags

Vocabulary practice flashcards covering fundamental concepts in computer simulation and modeling, including discrete-event architectures, random number generation techniques, queueing system metrics, and model verification/validation methodologies.

40 Terms

1
New cards

System Detailing (Specification)

The formal identification and mutual agreement of system factors, states, and parameters based on the study's research goals, established between the system manager and the model project authors.

2
New cards

Simulation Model Classification Dimensions

The three primary classification aspects of simulation models: static versus dynamic, deterministic versus stochastic, and continuous versus discrete.

3
New cards

Synchronization Routine (Clock Routine)

A simulation subprogram that searches the event list for the next scheduled event and advances the simulation clock to the occurrence time of that event.

4
New cards

Event Handler Routine

A simulation subprogram responsible for updating the state variables of the system and modifying system and statistical counters when a specific event occurs.

5
New cards

Initialization Routine

A simulation subprogram that resets and prepares the simulation model by placing state variables and clocks into their initial, zero baseline state at time zero.

6
New cards

Library Routine

A collection of utility subprograms used to generate pseudo-random numbers and random variates from specific probability distributions for use in the simulation model.

7
New cards

Report Generator

A subprogram that computes estimates of performance measures from statistical counters and formats the final output summary report upon model termination.

8
New cards

Statistical Counters

Simulation variables designated to collect, accumulate, and store numerical data regarding performance characteristics throughout the execution of a model run.

9
New cards

Event List

A scheduled data structure that maintains the impending event notices, specifically recording the future execution time for each scheduled type of event.

10
New cards

Simulation Clock (MDS)

A system variable tracking current model time that advances instantaneously from the current moment to the execution epoch of the next imminent event.

11
New cards

Next-Event Time Progression

A time advancement approach in simulation where the clock jumps directly from one event time to the next nearest event time, bypassing inactive periods.

12
New cards

Fixed-Increment Time Progression

A simulation timing approach where the model time advances in uniform, discrete time intervals of constant duration Δt\Delta t.

13
New cards

Linear Congruential Generator (LCG)

A pseudo-random number generator defined by the recurrence zi=(a⋅zi−1+c)(modm)z_i = (a \cdot z_{i-1} + c) \pmod m, subject to parameter constraints m>0m > 0, 0≤a<m0 \le a < m, 0≤c<m0 \le c < m, and seed 0≤z0<m0 \le z_0 < m.

14
New cards

Multiplicative Congruential Generator

A special class of linear congruential generator in which the additive constant c=0c = 0, restricting the maximum possible period to at most m−1m - 1.

15
New cards

Mixed (Shifted) Congruential Generator

A linear congruential generator where the additive constant c≠0c \neq 0, enabling the generation of a full sequence period equal to the modulus mm.

16
New cards

Full Period in an LCG

The condition achieved when a linear congruential generator cycles through all mm possible states before repeating any value.

17
New cards

Tausworthe Generator

A linear feedback shift-register random bit generator defined by the recurrence bi=(bi−r+bi−q)(mod2)b_i = (b_{i-r} + b_{i-q}) \pmod 2, frequently utilized in cryptographic applications.

18
New cards

L'Ecuyer Combined Generator

A random number generation algorithm that combines independent congruential generators to achieve vastly increased period length, formulated as zi=(z1,i+z2,i)(modm)z_i = (z_{1,i} + z_{2,i}) \pmod m.

19
New cards

Marsa and Roberts Multiplicative Generator

A multiplicative generator utilizing a modulus of the form m=2b−qm = 2^b - q (such as m=231−1m = 2^{31} - 1 with multiplier a=16807a = 16807), enabling fast division via bit shifts.

20
New cards

Blum-Blum-Shub Generator

A cryptographically secure pseudorandom bit generator widely deployed in cryptographic security protocols.

21
New cards

Inverse Transform Method

An algorithm that converts a standard uniform variate g∼U(0,1)g \sim U(0,1) into a variate of an arbitrary continuous distribution using the inverse cumulative distribution function, such as X=−1λln⁡(1−g)X = -\frac{1}{\lambda} \ln(1 - g) for exponential distributions.

22
New cards

Convolution Method

A variate generation technique where a target random variable is generated by taking the sum of mm independent random variables: X=Y1+Y2+⋯+YmX = Y_1 + Y_2 + \dots + Y_m.

23
New cards

Composition Method

A random variate generation algorithm applied when a target cumulative distribution function is represented as a weighted convex combination of sub-distributions: F(x)=∑j=1Npj⋅Fj(x)F(x) = \sum_{j=1}^N p_j \cdot F_j(x).

24
New cards

Box-Muller Polar Method

An exact algorithm for producing two independent standard normal random variates via X1=h1YX_1 = h_1 Y and X2=h2YX_2 = h_2 Y, where Y=−2ln⁡(s)sY = \sqrt{\frac{-2 \ln(s)}{s}}, s=h12+h22s = h_1^2 + h_2^2, and hi=2gi−1h_i = 2g_i - 1.

25
New cards

Central Limit Theorem Normal Approximation

An approximate method for generating standard normal random variables using the summation of 12 uniform variates: x=∑i=112gi−6x = \sum_{i=1}^{12} g_i - 6, where gi∼U(0,1)g_i \sim U(0,1).

26
New cards

Poisson Variate Generation Formula

The algorithm for generating a discrete Poisson random variate with parameter λ\lambda: X=min⁡{i:∏j=1igj<e−λ}X = \min\left\{ i : \prod_{j=1}^i g_j < e^{-\lambda} \right\}, where gj∼U(0,1)g_j \sim U(0,1).

27
New cards

Poisson Process Interarrival Time Formula

The recursive expression generating event arrival times in a stationary Poisson process: ti=ti−1−1λln⁡(1−g)t_i = t_{i-1} - \frac{1}{\lambda} \ln(1 - g), leveraging exponentially distributed interarrival gaps.

28
New cards

Serial Test for Uniformity

A statistical test verifying the multidimensional uniformity of generated random sequences by computing χ2(d)=kdn∑j1=1k⋯∑jd=1kfj1…jd2−n\chi^2(d) = \frac{k^d}{n} \sum_{j_1=1}^k \dots \sum_{j_d=1}^k f^2_{j_1 \dots j_d} - n.

29
New cards

Runs Up Test

A statistical test for independence of pseudorandom numbers based on the frequency of increasing sequences, evaluated via the statistic R=1n∑i=16∑j=16aij(ri−n⋅bi)(rj−n⋅bj)R = \frac{1}{n} \sum_{i=1}^6 \sum_{j=1}^6 a_{ij} (r_i - n \cdot b_i)(r_j - n \cdot b_j).

30
New cards

Discrete-Event Simulation (DES)

A simulation modeling paradigm where the system state changes instantaneously at separated, discrete points in time upon the occurrence of individual events.

31
New cards

Single-Server Queueing System (M/M/1)

A standard discrete-event queueing model consisting of one service node where both customer interarrival intervals and service durations follow exponential distributions.

32
New cards

Queue Waiting Time Dependence

The property that sequential customer queue delays (D1,D2,…,DnD_1, D_2, \dots, D_n) in an M/M/1 system constitute dependent, autocorrelated random variables rather than independent observations.

33
New cards

Expected Average Delay in Queue (d^(n)\hat{d}(n))

An M/M/1 queue performance measure estimating average waiting time before service: d^(n)=1n∑i=1nDi\hat{d}(n) = \frac{1}{n} \sum_{i=1}^n D_i.

34
New cards

Time-Average Number in Queue (q^(n)\hat{q}(n))

An M/M/1 system metric tracking the time-integrated queue length, estimated as q^(n)=1T(n)∫0T(n)Q(t) dt\hat{q}(n) = \frac{1}{T(n)} \int_0^{T(n)} Q(t)\,dt or discretely as q^(n)=1T(n)∑i=0∞i⋅Ti(n)\hat{q}(n) = \frac{1}{T(n)} \sum_{i=0}^\infty i \cdot T_i(n).

35
New cards

Server Utilization Factor (u^(n)\hat{u}(n))

The estimated proportion of total simulation time that a server remains occupied, given by u^(n)=1T(n)∫0T(n)B(t) dt\hat{u}(n) = \frac{1}{T(n)} \int_0^{T(n)} B(t)\,dt, where B(t)∈{0,1}B(t) \in \{0, 1\}.

36
New cards

Model Verification

The rigorous process of determining whether the conceptual simulation model has been correctly and accurately transformed into an executable computer program.

37
New cards

Model Validation

The evaluative process of establishing whether the simulation model represents an adequately accurate depiction of the actual real-world system under study.

38
New cards

Model Credibility

The formal trust and acceptance of model accuracy and correctness by system managers and decision-makers, leading to the actual practical utilization of the model's outputs.

39
New cards

VV&A (Verification, Validation, and Accreditation)

A formal three-tier assurance standard, adopted by institutions such as the U.S. Department of Defense, used to certify simulation models for mission-critical operations.

40
New cards

Universal vs. Domain-Oriented Simulation Packages

The two primary classifications of simulation software packages: general-purpose languages/libraries suitable across disciplines versus application-specific environments tailored to particular domains.