Week 1 Flashcards

1
Q

What is a Random Number Generator (RNG)?

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

What are the requirements for a RNG?

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

What is the period length of a RNG?

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

What is a LCG?

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

What is a MRG

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

What is a LFSRG?

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

What is the Inverse Transform method?

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

What is the accept-reject method?

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

How do you find the most efficient implementation of the acceptence rejectance method?

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

What is the Strong Law of Large Numbers?

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

What is the Central Limit Theorem?

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

What is the estimator for the sample average?

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

How to create a confidence interval of the sample average?

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

How to compute the sample variance? How to compute the standard error?

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

What are some properties of the sample variance?

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

What is the Monte Carlo algorithm?

A
17
Q

What do we need to verify after a Monte Carlo simulation?

A
18
Q

What are the components of a DES simulation?

A
  • X is the set of all states
  • E is the set of all events
  • L : X → 2E is the active event function, aka event list
  • φ : X × E is the transition function
  • V = {Vn(e) : e ∈ E,n = 1,2,…} are the event life times
  • P = {p(x, e, ·) : x ∈ X , e ∈ L(x)} are the transition probability distributions
  • x0 is the initial state
19
Q

How to describe an (example) queing system?

A

Also describe:

L(x) is the list of active events in state x, called event list.
􏰉 These are the events that are currently scheduled to occur. 􏰉 Arrivals can always occur, thus α1 , α2 ∈ L(x) for all states x. 􏰉 A few event lists are

L(1, 0) = {α1, α2, β11}
L(1, 2) = {α1, α2, β11, β21, β22}
L(2, 1) = {α1, α2, β11, β12, β21}
L(2, 3) = {α1, α2, β11, β12, β21, β22} L(8, 5) = {α1, α2, β11, β12, β13, β21, β22}

and

State transition φ(x, e) = x′ means that when event e ∈ L(x) in state x occurs, the next state will be x′.

Examples

φ((1,0),α1) = (2,0)

φ((1,0),α2) = (1,1) φ((1,0),β11) = (0,1) φ((8,6),α1) = (9,6) φ((8,6),α2) = (8,7) φ((8,6),β13) = (7,7) φ((8,6),β21) = (8,5)

20
Q

What are the old and new events in DES?

A
21
Q

What is the clock structure of a DES model?

A
22
Q

How to find estimators of performance measures?

A
23
Q

What is Common Random Numbers (CRN)?

A
24
Q

What is the Paired t-test?

A
25
Q

What is a two-sample t-test?

A
26
Q

What is the difference between the Paired and two sample t-test?

A

The paired is when you have CRN.

27
Q

What is the two sample Welch-test?

A
28
Q

What is the Bonferri-equality?

A
29
Q

What is ANOVA? (Very long answer)

A
30
Q

What is post-hoc analysis?

A