{"id":61,"date":"2011-10-23T01:01:34","date_gmt":"2011-10-23T01:01:34","guid":{"rendered":"http:\/\/minkhollow.ca\/books\/?page_id=61"},"modified":"2014-07-21T17:27:45","modified_gmt":"2014-07-21T17:27:45","slug":"glossary","status":"publish","type":"page","link":"http:\/\/minkhollow.ca\/books\/?page_id=61","title":{"rendered":"Glossary"},"content":{"rendered":"

This glossary defines how various terms are used in this book. Although their use here does not deviate dramatically from commonly accepted meanings, we have encountered sufficient opposition and argument over many of these terms to warrant defining them for our purposes. Further, there are frequent discussions and debates about terminology among various simulation and game scholar communities so that a clarification of how terms are used in this volume is reasonable while at the same time acknowledging that the ‘debates’ are far from definitive.<\/p>\n

<\/p>

\r\n

Quick Links<\/h2>\r\n

A* Algorithm<\/a><\/p>\n

ADDIE<\/a><\/p>\n

Algorithm<\/a><\/p>\n

Analog Simulation<\/a><\/p>\n

Animation Timeline<\/a><\/p>\n

Argument<\/a><\/p>\n

Arrival Rate<\/a><\/p>\n

Asset<\/a><\/p>\n

Avatar<\/a><\/p>\n

Back-to-back testing<\/a><\/p>\n

Balking<\/a><\/p>\n

Base Model<\/a><\/p>\n

Black box testing<\/a><\/p>\n

Boundary condition<\/a><\/p>\n

Breakpoint<\/a><\/p>\n

Client<\/a><\/p>\n

Comparison testing<\/a><\/p>\n

Compliance Training<\/a><\/p>\n

Computer Game<\/a><\/p>\n

Computer-Mediated Game<\/a><\/p>\n

Conceptual Model<\/a><\/p>\n

Conditional Statement<\/a><\/p>\n

Continuous Simulation<\/a><\/p>\n

Cosplay<\/a><\/p>\n

Cross-Sectional Survey<\/a><\/p>\n

Crowdsourcing<\/a><\/p>\n

Data<\/a><\/p>\n

Debugger<\/a><\/p>\n

Decorative Media Principle<\/a><\/p>\n

Decorative Media Trap<\/a><\/p>\n

Degenerate Tests<\/a><\/p>\n

Digital Simulation<\/a><\/p>\n

Discrete Simulation<\/a><\/p>\n

Distributed Simulation<\/a><\/p>\n

Distribution function<\/a><\/p>\n

Edutainment<\/a><\/p>\n

Estimated State<\/a><\/p>\n

Event<\/a><\/p>\n

Event Validity<\/a><\/p>\n

Exponential distribution<\/a><\/p>\n

Extreme Condition<\/a><\/p>\n

Face Validity<\/a><\/p>\n

FCFS<\/a><\/p>\n

FIFO<\/a><\/p>\n

Finite State Machine (FSM)<\/a><\/p>\n

First Person Shooter (FPS)<\/a><\/p>\n

First playable<\/a><\/p>\n

Flow of Control<\/a><\/p>\n

Flowchart<\/a><\/p>\n

Frame<\/a><\/p>\n

Frame rate<\/a><\/p>\n

Frequency histogram<\/a><\/p>\n

FSA (Finite State Automaton)<\/a><\/p>\n

Game<\/a><\/p>\n

Game Design Document<\/a><\/p>\n

Game Engine<\/a><\/p>\n

Game Goal<\/a><\/p>\n

Game Mechanics<\/a><\/p>\n

Game Objective<\/a><\/p>\n

Gameplay<\/a><\/p>\n

Game Premise<\/a><\/p>\n

Gamification<\/a><\/p>\n

Gestalt<\/a><\/p>\n

Haptics<\/a><\/p>\n

Historical Validation<\/a><\/p>\n

Idle<\/a><\/p>\n

Informed Search Algorithms<\/a><\/p>\n

Instructional Design<\/a><\/p>\n

Instructional Strategy<\/a><\/p>\n

Instructional System Design (ISD)<\/a><\/p>\n

Instrumentation<\/a><\/p>\n

Interarrival Time<\/a><\/p>\n

Internal Validity<\/a><\/p>\n

Iteration<\/a><\/p>\n

Jockeying<\/a><\/p>\n

Level of Abstraction<\/a><\/p>\n

Linear Congruential Generator<\/a><\/p>\n

Logarithm<\/a><\/p>\n

Logarithmic Scale<\/a><\/p>\n

Logistic equation<\/a><\/p>\n

Longitudinal Survey<\/a><\/p>\n

Loop<\/a><\/p>\n

Measured State<\/a><\/p>\n

Mesh<\/a><\/p>\n

Message Design<\/a><\/p>\n

Microsimulation<\/a><\/p>\n

Model<\/a><\/p>\n

Module<\/a><\/p>\n

M\/M\/1 Queuing System<\/a><\/p>\n

Next Event Paradigm<\/a><\/p>\n

Normal distribution<\/a><\/p>\n

Object Oriented Progemming (OOP)<\/a><\/p>\n

Observable Elements<\/a><\/p>\n

Observer Mode<\/a><\/p>\n

Open Source<\/a><\/p>\n

Operational Model<\/a><\/p>\n

Original System<\/a><\/p>\n

Orthographic transformation<\/a><\/p>\n

Parameter<\/a><\/p>\n

Performance Gap<\/a><\/p>\n

Period:<\/a><\/p>\n

Perspective transformation<\/a><\/p>\n

Physics Engine<\/a><\/p>\n

Point and Click<\/a><\/p>\n

Point of View (POV)<\/a><\/p>\n

Polygonalization<\/a><\/p>\n

Post Mortem<\/a><\/p>\n

Play Testing<\/a><\/p>\n

Playable<\/a><\/p>\n

Pixel<\/a><\/p>\n

Predictive Validation<\/a><\/p>\n

Presence<\/a><\/p>\n

Pretest-Posttest Control Group Design<\/a><\/p>\n

Prim<\/a><\/p>\n

Process<\/a><\/p>\n

Process Flow Diagram (PFD)<\/a><\/p>\n

Priority Queue<\/a><\/p>\n

Pseudocode<\/a><\/p>\n

Pseudorandom Number<\/a><\/p>\n

Queue<\/a><\/p>\n

Queuing Model<\/a><\/p>\n

Randomized Controlled trial<\/a><\/p>\n

Raster<\/a><\/p>\n

Reneging<\/a><\/p>\n

Runs Test<\/a><\/p>\n

Seed:<\/a><\/p>\n

Sensitivity Analysis<\/a><\/p>\n

Serious Game<\/a><\/p>\n

Server<\/a><\/p>\n

Service Time<\/a><\/p>\n

Sequencing Set<\/a><\/p>\n

Short Form Game<\/a><\/p>\n

Simulation<\/a><\/p>\n

Simulation Game<\/a><\/p>\n

Simulation Model<\/a><\/p>\n

Simulation Object (element)<\/a><\/p>\n

Simulator<\/a><\/p>\n

Single Server Queuing System<\/a><\/p>\n

Software Development Kit – SDK<\/a><\/p>\n

Sprite<\/a><\/p>\n

SQS<\/a><\/p>\n

Standard Deviation<\/a><\/p>\n

State<\/a><\/p>\n

Stochastic Simulation<\/a><\/p>\n

Storyboard<\/a><\/p>\n

System<\/a><\/p>\n

System Time<\/a><\/p>\n

Tandem Queue<\/a><\/p>\n

Task Analysis<\/a><\/p>\n

Teleoperation<\/a><\/p>\n

Tessellation<\/a><\/p>\n

Triage<\/a><\/p>\n

True random numbers:<\/a><\/p>\n

Unified Modeling Language (UML)<\/a><\/p>\n

Uniform Distribution<\/a><\/p>\n

Validation<\/a><\/p>\n

Variable<\/a><\/p>\n

Verification<\/a><\/p>\n

Virtual Reality<\/a><\/p>\n

Walkthrough<\/a><\/p>\n

Waypoint Navigation<\/a><\/p>\n

Z-buffer algorithm<\/a><\/p>\n

References<\/a><\/p>\n\r\n<\/div>

<\/div>

<\/p>\n

A* Algorithm<\/h3>\n

An algorithm commonly used by video games for finding a path or route between two points. It begins at a specified set of starting coordinates and iteratively creates a list of intermediate locations which it tests for being possible next steps. It scores these according to various schemes. The final set of locations ending at the goal and having the lowest score is the best route.<\/p>\n

First Described in Chapter 13 <\/em><\/p>\n

ADDIE<\/h3>\n

ADDIE is a popular, but fairly high-level process model for instructional design. It stands for: Assessment, Design, Development, Implementation, and Evaluation. It is intended to provide a framework for the design of training and instruction.<\/p>\n

First Described in Chapter 10 <\/em><\/p>\n

Algorithm<\/h3>\n

A precise set of instructions that adequately and unambiguously specifies behaviour (must be finite and step by step). An algorithm manipulates data not information.<\/p>\n

First Described in Chapter 2 <\/em><\/p>\n

Analog Simulation<\/h3>\n
    \n
  1. A simulation implemented and enacted on paper or with only live \u201cactors\u201d (as opposed to a computer simulation).<\/li>\n
  2. Simulations, normally continuous ones that are run on analog computers.<\/li>\n<\/ol>\n

    See Also: Simulation<\/em><\/p>\n

    First Described in Chapter 3 <\/em><\/p>\n

    Animation Timeline<\/h3>\n

    A timeline of events that runs parallel to the sequencing set<\/em>. This is a conceptual rather than an actual timeline and serves to illustrate how the visual display (animation) of the simulation relates to the events of the simulation. These events are typically very regular in their occurrence.<\/p>\n

    First Described in Chapter 5 <\/em><\/p>\n

    Argument<\/h3>\n

    A specific value used as a parameter<\/em>, often to some sort of sub-program. Technically, a parameter is a declared item that represents an input, and an argument is one specific input. \u00a0The number of copies in a print request is an argument, and \u201cnumber-of-copies\u201d would be the parameter to the print program. See Also: Parameter<\/em><\/p>\n

    First Described in Chapter 2 <\/em><\/p>\n

    Arrival Rate<\/h3>\n

    Is the number of arrivals into the system in a given time period. It is usually calculated by counting the number of arrivals in a given time (like 24 hours), and then dividing by some unit (like 24) to get a number of arrivals per time unit (eg. Hour).<\/p>\n

    First Described in Chapter 12 <\/em><\/p>\n

    Asset<\/h3>\n

    An artifact or item of importance to the implementation of a game or simulation; can be art (models, animations, textures) music, sound effects, or even computer code.<\/p>\n

    First Described in Chapter 11 <\/em><\/p>\n

    Avatar<\/h3>\n

    An avatar is a graphical representation, which can be a photo, animation or other graphic that represents the user within some virtual space. In spaces like Second Life<\/em>, the avatar may appear to be three dimensional and can be controlled by the user. In other social spaces like Facebook<\/em>, an avatar may simply be a .gif (image) that is associated with items published by that user.<\/p>\n

    First described in Chapter 11<\/em><\/p>\n

    Back-to-back testing<\/h3>\n

    A form of verification that involves checking a simulation against another simulated or analytical result of the same system.<\/p>\n

    First described in Chapter 9<\/em><\/p>\n

    Balking<\/h3>\n

    Balking happens when a client leaves the system without ever entering a queue. In other words, the \u2018entry\u2019 is generated, but never actually goes into the queue.<\/p>\n

    First Described in Chapter 12 <\/em><\/p>\n

    Base Model<\/h3>\n

    Another word for conceptual model<\/em>. This is the description of the model that includes all those elements of interest to our application. See also conceptual model.<\/p>\n

    First Described in Chapter 5 <\/em><\/p>\n

    Black box testing<\/h3>\n

    The testing of a computer program (or in general, any device) by examining its function from the outside only. Access to the internals (EG variables, source code) is not allowed. In software testing it provides the kind of access to a program or system like that which most users would have.<\/p>\n

    First described in Chapter 9<\/em><\/p>\n

    Boundary condition<\/h3>\n

    The situations that prevail at the extreme limits of a function, system, model, or program. If, for example you have a program that does something to a list of records, and that program was designed to handle anywhere from 1 to 10,000 records, then the boundary condition would test it for an empty list (size = 0), a list consisting of a single item (size = 1), as well as lists of size 10,000 and 10,001 to make sure the program still functioned correctly under each of those conditions.<\/p>\n

    First described in Chapter 9<\/em><\/p>\n

    Breakpoint<\/h3>\n

    When using a debugger<\/em>, a breakpoint is a place in a computer program where execution is to stop. This allows the developer to effectively pause a running program at pre-determined points and then examine the value of variables. This also allows the developer to provide various kinds of input and then look at the effect on the program at various places along the execution. Most debugging utilities also provide ways to continue execution after it is paused.<\/p>\n

    First described in Chapter 9<\/em><\/p>\n

    Client<\/h3>\n

    A person or thing that requires some action (service) from another. A bank customer, for example, wants service from a teller. A Java program can also be a client when it requests computing service from another computer program. The virtual space called Second Life<\/em> requires that users install the SL client on their computers, which handles the user\u2019s display and communication with the servers.<\/p>\n

    First Described in Chapter 6<\/em><\/p>\n

    Comparison testing<\/h3>\n

    See: back to back testing<\/em><\/p>\n

    First described in Chapter 9<\/em><\/p>\n

    Compliance Training<\/h3>\n

    Compliance training focuses on helping employees understand various rules and regulations that are relevant to their jobs or the companies for which they work. It is a necessary part of many jobs but can be perceived as tedious and is rarely welcome.<\/p>\n

    First described in Chapter 14<\/em><\/p>\n

    Computer Game<\/h3>\n

    A game that requires the computer in order to play it. In other words this game can not be played without a computer. There are some games that only exist as computer games: Tetris<\/em>, Mario<\/em>, Katamari Damacy<\/em>, while others are merely digital versions of traditional games, such as Solitaire and chess.<\/p>\n

    First Described in Chapter 3 <\/em><\/p>\n

    Computer-Mediated Game<\/h3>\n

    A game that exists in analog form that has been implemented on the computer. These comprise the group of games that are little more than computer simulations<\/em> of their analog counterparts. Computer chess and Solitaire fall into this category, as do most of the educational drill-games like Tic-Tac-Toe<\/em>, Jeopardy!<\/em> and Hollywood<\/em> Squares<\/em>.<\/p>\n

    First Described in Chapter 3 <\/em><\/p>\n

    Conceptual Model<\/h3>\n

    The conceptual model is the description of the original system<\/em> that includes all of the observable elements<\/em> along with the collected data. It also includes the descriptions of the events that will form the core of the activity in the simulation.<\/p>\n

    First Described in Chapter 5 <\/em><\/p>\n

    Conditional Statement<\/h3>\n

    A logical question presented as a simple or complex expression in which the answer can only be ‘yes’ or ‘no’. Many programming languages also provide a construct that allows the flow of control to go to one of several choices, depending upon some value.<\/p>\n

    First Described in Chapter 2 <\/em><\/p>\n

    Continuous Simulation<\/h3>\n

    A simulation that allows the system state to be evaluated at any moment in time. It is usually based on systems of differential equations that can be solved for any given value of t<\/strong>. When simulations like this are run, some regular time interval is typically chosen and then the equation is evaluated once for each time interval over the course of the simulation (eg. Every second for 10 hours).<\/p>\n

    First Described in Chapter 2 <\/em><\/p>\n

    Cosplay<\/h3>\n

    Cosplay is short for costume play and is a form of live action play that includes dressing up, often as some known comic, anime, or other character. The play typically unfolds in public spaces. It rarely requires the knowing participation of people not directly involved in the play but sometimes makes use of the fact they are there.<\/p>\n

    First Described in Chapter 3 <\/em><\/p>\n

    Cross-Sectional Survey<\/h3>\n

    A study involving subjects in which the data are gathered about the members of a population at a particular point in time or for a specific (usually short) period. Most political polls conducted during election campaigns are of this sort.<\/p>\n

    First Described in Chapter 13 <\/em><\/p>\n

    Crowdsourcing<\/h3>\n

    Sending a problem out to a large, generally unknown, group of people for a solution. This has been practical for only a relatively short time (since the Internet reached maturity). FoldIt<\/em> makes use of croudsourcing.<\/p>\n

    First Described in Chapter 1 <\/em><\/p>\n

    Data<\/h3>\n

    A set of values, usually having been explicitly measured, that represent properties of an object or set of objects.<\/p>\n

    First Described in Chapter 2 <\/em><\/p>\n

    Debugger<\/h3>\n

    A computer program that allows a developer to step through a computer program one statement or a few statements at a time so as to better locate and correct errors.<\/p>\n

    First described in Chapter 9<\/em><\/p>\n

    Decorative Media Principle<\/h3>\n

    The Decorative Media Principle involves creating a visually pleasing background and other decorations for a worksheet, website, etc. that is thematically connected with the instruction or other purpose. For example, in the work the author does with the \u201cDucks in the Classroom\u201d project, vocabulary and word games are created on a pleasing background \u2013 possibly a nest, words enclosed in images of eggs, duck footprints, etc. The principle, although unproven is that the decoration helps to increase interest and may also increase the conceptual coherence of the learning object. (Becker 2006)<\/p>\n

    First Described in Chapter 10<\/em><\/p>\n

    Decorative Media Trap<\/h3>\n

    This is the mistaken belief that a pleasing, pleasant, or impressive appearance implies that the artifact is well designed. Many educational objects fall into this trap. From the design perspective, people fall into this trap when they believe that appearances are either sufficient or, even worse, that they can compensate for a poor or mediocre design.<\/p>\n

    First Described in Chapter 10<\/em><\/p>\n

    Degenerate Tests<\/h3>\n

    The use of parameter values identified as the ones that lie at the extreme ends of the range of possible values. For example, a queue where no-one leaves, or one that has no or only one single arrival. The output values in such conditions are often simple to predict and so can be compared against the behavior of the system as a test. (see also extreme condition<\/em>)<\/p>\n

    First described in Chapter 9<\/em><\/p>\n

    Digital Simulation<\/h3>\n

    A simulation that runs on a computer. See: Simulation<\/em><\/p>\n

    First Described in Chapter 2 <\/em><\/p>\n

    Discrete Simulation<\/h3>\n

    A simulation that is structured around the use of discrete time increments between the evaluation of system states. Such a simulation usually focuses on specific events<\/em> that occur, such as a customer arriving or leaving. When run as straight simulations (i.e. not as games or animations) the flow of time in the simulation can step from event to event rather than progressing in same-sized time increments. If the simulation is being presented as a game or if the simulation is being displayed using animation it will usually be necessary to advance time in same-sized steps, even though nothing may be happening during some of those time periods.<\/p>\n

    First Described in Chapter 2 <\/em><\/p>\n

    Distributed Simulation<\/h3>\n

    A simulation that is executed on multiple processors (or CPUs) which may or may not be physically close to each other.<\/p>\n

    First Described in Chapter 2<\/em><\/p>\n

    Distribution function<\/h3>\n

    More correctly called the density function, this is a mathematical function that defines the likelihood (probability) of a random value to occur at every point.<\/p>\n

    First Described in Chapter 7 <\/em><\/p>\n

    Edutainment<\/h3>\n

    Edutainment is (erroneously) used by many educators to refer to any form of educational computer game. It is sometimes used more broadly to refer to all popular media that has an educational component.<\/p>\n

    Edutainment is the term used by game developers to refer to poorly designed educational software. The term first became known during the 1980\u2019s when the use of computer games for education first became popular.<\/p>\n

    First Described in Chapter 3<\/em><\/p>\n

    Estimated State<\/h3>\n

    This is a value that is calculated rather than observed and is based on what we would expect, given we know the parameters of the simulation.<\/p>\n

    First Described in Chapter 7<\/em><\/p>\n

    Event<\/h3>\n

    Something that happens. An activity that has an effect on the state or parameters of a model that is relevant to the outcome.<\/p>\n

    First described in Chapter 5 <\/em><\/p>\n

    Event Validity<\/h3>\n

    The events that take place in a system must be reproduced accurately by any useful model of that system. Event validity testing involves comparing the number and interval times of events in the simulation against the known values of the real system.<\/p>\n

    First described in Chapter 9<\/em><\/p>\n

    Exponential distribution<\/h3>\n

    A statistical distribution that follows a logarithmic curve. The likelihood of a small value is much higher than that of a large one.<\/p>\n

    First described in Chapter 7.<\/em><\/p>\n

    Extreme Condition<\/h3>\n

    The use of parameter values identified as the ones that lie at the extreme ends of the range of possible values. For example, a queue where no-one leaves, or one that has no or only one single arrival. The output values in such conditions are often simple to predict and so can be compared against the behavior of the system as a test. (see also Degenerate Tests<\/em>)<\/p>\n

    First described in Chapter 9<\/em><\/p>\n

    Face Validity<\/h3>\n

    Face Validity has to do with whether or not the model seems right. It requires a group of experts to review the results of a simulation and judge how well this reflects on the accuracy of the underlying model.<\/p>\n

    First described in Chapter 9<\/em><\/p>\n

    FCFS<\/h3>\n

    An acronym for First-Come-First-Served, a protocol for adding things to a queue in which the early arrivals are placed into the queue before later ones. This is the typical protocol for human line ups.<\/p>\n

    First described in chapter 7.<\/em><\/p>\n

    FIFO<\/h3>\n

    An acronym for First-In-First-Out. The same as FCFS.<\/p>\n

    First described in chapter 7.<\/em><\/p>\n

    Finite State Machine (FSM)<\/h3>\n

    A model or system consisting of a set of states and transitions between those states. Transitions from one state to another can be performed when a particular symbol is received or a particular set of conditions is met. The symbol or condition determines which state will be the next one.<\/p>\n

    First Described in Chapter 13 <\/em><\/p>\n

    First Person Shooter (FPS)<\/h3>\n

    A first person shooter is a video game genre where the main objective is achieved by shooting at things. These things could include NPC\u2019s or the avatars of other players. What makes it \u201cfirst person\u201d is that the perspective, or Point of View (POV)<\/em> is that of the player. The player sees what they would see if they were actually inside the game.<\/p>\n

    First described in chapter 11.<\/em><\/p>\n

    First playable<\/h3>\n

    The first version of a computer game that can actually be played.<\/p>\n

    First described in Chapter 9<\/em><\/p>\n

    Flow of Control<\/h3>\n

    The path through a program during execution. Usually, the flow of control is sequential and steps get executed one after the other, but there are various things that can change this, such as loops and decisions. These will change the flow of control depending on the answers to the questions or how the loop is controlled.<\/p>\n

    First Described in Chapter 2 <\/em><\/p>\n

    Flowchart<\/h3>\n

    A flowchart visualizes the flow of control of an algorithm or program. It consists of discrete steps (the shapes) that get executed according to the order specified by directional arrows.<\/p>\n

    First Described in Chapter 2 <\/em><\/p>\n

    Frame<\/h3>\n

    A single image that is part of an animation. Standard film usually has a display rate of 24 frames per second, while video and many videogames produce 30 frames per second. Each frame is a still image, but when displayed with all the others in fairly rapid succession, we see it as moving.<\/p>\n

    First Described in Chapter 8 <\/em><\/p>\n

     <\/p>\n

    Frame rate<\/h3>\n

    The number of images or frames that an animation, video, or film displays each second.<\/p>\n

    First Described in Chapter 8 <\/em><\/p>\n

    Frequency histogram<\/h3>\n

    A type of graph in which the frequency of occurrence of some measurement is counted over specific ranges. Counts are stored in \u2018bins\u2019, each of which can hold one number. Measuring heights of people, for instance, can be done in one inch increments, and so a measurement of 60 inches would accumulate in the bin corresponding to the range between 60 and 61 inches. Example: the graph of numerical grades achieved by students in a class.<\/p>\n

    First described in Chapter 7.<\/em><\/p>\n

    FSA (Finite State Automaton)<\/h3>\n

    See: Finite state machine<\/em>.<\/p>\n

    First Described in Chapter 13 <\/em><\/p>\n

    Game<\/h3>\n

    An activity with identifiable rules and a distinct ending that includes some set of quantifiable measures of progress and\/or success. It usually involves some sort of challenge as well.<\/p>\n

    First Described in Chapter 3 <\/em><\/p>\n

    Game Design Document<\/h3>\n

    A formal document that could be hundreds of pages long that specifies a video or computer game in considerable detail. This is the document that acts as the \u2018bible\u2019 for the development team.<\/p>\n

    First Described in Chapter 10 <\/em><\/p>\n

    Game Engine<\/h3>\n

    A game engine is a unified collection of code that provides the foundation for a video game. It contains:<\/p>\n

      \n
    • \u00a0a renderer \u2013 a program that draws 3D objects onto a 2D image or screen<\/li>\n
    • some collision detection,<\/li>\n
    • physics software,<\/li>\n
    • audio display code, and<\/li>\n
    • a database for keeping track of resources and objects.<\/li>\n<\/ul>\n

      First Described in Chapter 11 <\/em><\/p>\n

      Game Goal<\/h3>\n

      In videogame design, goal<\/em> normally refers to the object of the game, in other words, what the player must do to get to the end or win.<\/p>\n

      First Described in Chapter 10 <\/em><\/p>\n

      Game Mechanics<\/h3>\n

      Game mechanics are the mechanisms by which the player achieves the goals of the game. They include the actions that the player can perform like: turn-taking, shooting, collecting, aiming, moving, choosing, and buying. Game mechanics usually translate into bits of code or programs that implement the action in a fairly straight-forward way.<\/p>\n

      First Described in Chapter 10<\/em><\/p>\n

      Game Objective<\/h3>\n

      Every game must have a clearly defined purpose for being, in other words the objective or message. What is the game about? Why are the players playing? What is the take-away?<\/p>\n

      First Described in Chapter 10 <\/em><\/p>\n

      Gameplay<\/h3>\n

      Gameplay includes aspects of the game mechanics but is viewed and described at a higher level of abstraction. Gameplay could include terms like cooperative, leveled, or 2D platform. It often describes what the player does, but in general terms. Gameplay includes all player experiences during the interaction with the game.<\/p>\n

      First Described in Chapter 10<\/em><\/p>\n

      Game Premise<\/h3>\n

      A game premise is the means of expressing the objective and may be chosen separately from the objective or they may be interconnected and thus choosing them together is appropriate. The premise is what \u201cestablishes the action of the game within a setting or metaphor\u201d (Fullerton, Swain, & Hoffman, 2008, p. 93).<\/p>\n

      First Described in Chapter 10<\/em><\/p>\n

      Gamification<\/h3>\n

      Gamification happens when you use design ideas and technologies from digital games and incorporate them into the designs of other things.<\/p>\n

      First Described in Chapter 10<\/em><\/p>\n

      Gestalt<\/h3>\n

      An object that is more than simply the sum of its parts.<\/p>\n

      First Described in Chapter 14<\/em><\/p>\n

      Haptics<\/h3>\n

      Computer interfaces that make use of the sense of touch, such as a mouse that vibrates when the player in a videogame hits a solid object.<\/p>\n

      First Described in Chapter 1 <\/em><\/p>\n

      Historical Validation<\/h3>\n

      Collected data is used to formulate the parameters of a simulation, but it can also be used to compare it against the simulated output as a form of calibration. With sufficient data, half can be used to design the model and half can be used for comparison.<\/p>\n

      First Described in Chapter 9<\/em><\/p>\n

      Idle<\/h3>\n

      When a server is not working on a job (IE when a single server queuing system has zero clients) it is said to be idle.<\/p>\n

      First described in Chapter 7.<\/em><\/p>\n

      Informed Search Algorithms<\/h3>\n

      A search algorithm that first searches the routes that appear<\/em> to be most likely to lead towards the goal. A*<\/em> is an example of such an algorithm.<\/p>\n

      First Described in Chapter 13 <\/em><\/p>\n

      Instructional Design<\/h3>\n

      Instructional design is the process of creating instruction through the analysis of learning needs and the systematic development of learning materials.<\/p>\n

      First described in Chapter 10.<\/em><\/p>\n

      Instructional Strategy<\/h3>\n

      The instructional strategy is the plan for what will happen during the course or lesson. It includes such approaches as question and answers, play-acting, group discussion, and so on.<\/p>\n

      First Described in Chapter 10 <\/em><\/p>\n

      Instructional System Design (ISD)<\/h3>\n

      An approach to the design of instruction that attempts to be systematic. Design and development typically follow a prescribed formula with respect to project management, but also often with respect to the format that the instructional intervention will take and even its delivery.<\/p>\n

      First Described in Chapter 10 <\/em><\/p>\n

      Instrumentation<\/h3>\n

      The act of placing statements in a computer program that print out the value of variables and program state as it executes.<\/p>\n

      First described in Chapter 9<\/em><\/p>\n

      Interarrival Time<\/h3>\n

      The time between two consecutive clients arriving at a system. The mean interarrival time is the average of many such times over a long period of time.<\/p>\n

      First Described in Chapter 6<\/em><\/p>\n

      Internal Validity<\/h3>\n

      Internal validity testing involves testing the simulation by running it many times, using different sequences of random numbers to ensure that the results are consistent.<\/p>\n

      First described in Chapter 9<\/em><\/p>\n

      Iteration<\/h3>\n

      Iteration is the process of stepping through a loop.<\/p>\n

      First Described in Chapter 2 <\/em><\/p>\n

      Jockeying<\/h3>\n

      In queuing systems, jockeying happens when clients move between queues, usually in an effort to reduce their own waiting times.<\/p>\n

      First Described in Chapter 12 <\/em><\/p>\n

      Level of Abstraction<\/h3>\n

      Every system can be examined and described at various levels of detail or abstraction. The lowest levels are typically the most concrete. Each successive level can use objects and entities described at a lower level as though they are distinct units.<\/p>\n

      First Described in Chapter 4<\/em><\/p>\n

      Linear Congruential Generator<\/h3>\n

      A pseudorandom number generation algorithm that is based on a simple linear equation such as (a*x + b) mod m<\/em>.<\/p>\n

      First Described in Chapter 6<\/em><\/p>\n

      Logarithm<\/h3>\n

      An exponent. For example, since 1000 = 103<\/sup>, log(1000) = 3.<\/p>\n

      First Described in Chapter 8 <\/em><\/p>\n

      Logarithmic Scale<\/h3>\n

      (Also Logarithmic axis) A scale of data or axis for a graph that uses the logarithm of the value instead of the value itself. Because a logarithm is an exponent, this means that a huge range of data can be plotted, and that the scale is not the typical linear one. Some measures are fundamentally logarithmic, such as decibels (sound), the Richter scale (earthquakes), and photographic f-stops.<\/p>\n

      Logistic equation<\/h3>\n

      An equation that describes population growth over time where the birth rate is balanced off by a limiting factor causing death.<\/p>\n

      dN\/dt = r * N – u * N2<\/sup><\/p>\n

      First Described in Chapter 11<\/em><\/p>\n

      Longitudinal Survey<\/h3>\n

      A longitudinal survey<\/em> collects data for a long period, perhaps a human lifetime or many lifetimes.<\/p>\n

      First Described in Chapter 13 <\/em><\/p>\n

      Loop<\/h3>\n

      A loop is a structure that allows one or more statements to be performed repetitively. Loops require ways to mark the start and end and ways to control how often we go through the loop. There are conditional loops and counted loops.<\/p>\n

      First Described in Chapter 2 <\/em><\/p>\n

      Measured State<\/h3>\n

      This is an \u2018observed\u2019 value, based on information gathered during a data collection event.<\/p>\n

      First Described in Chapter 7<\/p>\n

      Mesh<\/h3>\n

      An interconnected collection of polygons, usually triangles that form a graphical model of a 3D object.<\/p>\n

      First Described in Chapter 8 <\/em><\/p>\n

      Message Design<\/h3>\n

      Used in entertainment media, journalism, and instructional design to denote the signs and symbols that will be used to deliver the intended message. It is not typically seen as a distinct phase of the design process, but rather an approach that helps to focus the design efforts.<\/p>\n

      First Described in Chapter 10 <\/em><\/p>\n

      Microsimulation<\/h3>\n

      Short for microanalytic simulation, this kind of simulation models and simulates a large number of interacting units, like people, companies, homes, or vehicles. These large numbers of independent units can behave like a single system when seen from a distance.<\/p>\n

      First Described in Chapter 1 <\/em><\/p>\n

      Model<\/h3>\n

      A representation and set of transformational rules which can be used to predict the behavior and relationships between the set of entities comprising the system. (Franta, 1977)<\/p>\n

      A precise internal representation of a system that includes its variables, behaviours, and their interrelationships. The way we describe the model and the kinds of values and relationships we include will determine what we can do with this model, so it is important to know where we are going with this model right from the start. A model can be used to describe a concept, an entity, or a process. In computer simulation, our models often have something to do with a process.<\/p>\n

      First Described in Chapter 2 <\/em><\/p>\n

      Module<\/h3>\n

      A module is a mechanism for grouping statements and data together so they can be used at a higher level of abstraction. Also known as a sub-program.<\/p>\n

      First Described in Chapter 2 <\/em><\/p>\n

      M\/M\/1 Queuing System<\/h3>\n

      A single server queuing system having typical properties. It\u2019s called M\/M\/1 because exponential arrivals are called Markov processes, named after a Russian statistician, and the M is for Markov: Markov arrivals, Markov departures, 1 queue shortens to M\/M\/1.<\/p>\n

      Next Event Paradigm<\/h3>\n

      An approach to the implementation of a discrete event simulation that involves maintaining a single event list and advancing time in steps according to the schedule of the events in that list.<\/p>\n

      Normal distribution<\/h3>\n

      A statistical distribution often obtained by sampling real world physical measurements, such as height or length. It has a recognizable bell shape, and is sometimes called a bell curve.<\/p>\n

      First described in chapter 7.<\/em><\/p>\n

      Object Oriented Progemming (OOP)<\/h3>\n

      OOP is an approach to the design of programs that attempts to define all program elements as objects which have defined attributes and behaviors. The program then proceeds by invoking various behaviors by the necessary objects. There are many programming languages that support this design approach, but it is not necessary to use an object-oriented programming language in order to implement and object oriented program.<\/p>\n

      First Described in Chapter 11 <\/em><\/p>\n

      Observable Elements<\/h3>\n

      Based in part on Zeigler’s notion of experimental frames (1976), observable elements are identifiable elements from the original system. They are often noun words like rainfall, vehicle, obstacle, or patient. They may contain sub-parts, but they can be described as a unit and the associated data come from the subset, rather than its individual parts.<\/p>\n

      First Described in Chapter 5 <\/em><\/p>\n

      Observer Mode<\/h3>\n

      A mode in a digital game in which one person can \u2018tune in\u2019 to others at will, listening to them and helping them as they interact with the game. Observer mode allows an instructor to use their computer to watch and hear a student playing a game on their own machine. The teacher can see progress, note errors, and coach the students through hard parts. Taking notes during this process, or simply recording it for future analysis, allows the game to be assessed along with the students.<\/p>\n

      First Described in Chapter 9 <\/em><\/p>\n

      Open Source<\/h3>\n

      The term comes from \u201cfree and open source software\u201d, and includes applications and other kinds of software where one has access to the original source code. The intent is to encourage others to enhance the programs to make them better.<\/p>\n

      First Described in Chapter 11 <\/em><\/p>\n

      Operational Model<\/h3>\n

      This is the model of the system that is implementable. It contains all of the necessary details and omits those that are not of interest. This is the experimenter\u2019s image of the original system, and the term comes from lumping together components and simplifying accordingly.<\/p>\n

      First Described in Chapter 5<\/em><\/p>\n

      Original System<\/h3>\n

      The system, real or hypothetical, that encompasses the model being simulated.<\/p>\n

      First Described in Chapter 5 <\/em><\/p>\n

      Orthographic transformation<\/h3>\n

      A mathematical technique for converting 3D points and polygons into 2D so that they can be displayed. Parallel lengths at all points in an orthographic projection are of the same scale regardless of distance from the virtual viewer.<\/p>\n

      First Described in Chapter 8 <\/em><\/p>\n

      Parameter<\/h3>\n

      Also sometimes (incorrectly) called an \u201cArgument\u201d. A placeholder for an element (often just a value – which is the argument) that can be passed into a module from some other part of the program, or from the outside world to the program. When writing programs, it allows us to make a more generic module that can handle a greater variety of situations. \u00a0Technically, an argument is a specific value passed to a parameter.<\/p>\n

      First Described in Chapter 2 <\/em><\/p>\n

      Performance Gap<\/h3>\n

      Simply put, this is the difference between the actual or present performance and the desired or ideal performance of some individual or group. In instructional design, it is what should come out of a needs analysis.<\/p>\n

      First Described in Chapter 10<\/em><\/p>\n

      Period:<\/h3>\n

      The number of pseudorandom numbers that can be generated by an algorithm before it starts to repeat. All pseudorandom generators start over again after a large number of pseudorandom numbers have been calculated. In general, a period is the amount of time that passes before a sequence starts to repeat.<\/p>\n

      First Described in Chapter 6<\/em><\/p>\n

      Perspective transformation<\/h3>\n

      A mathematical technique for converting 3D points and polygons into 2D so that they can be displayed. Includes a foreshortening of distant objects.<\/p>\n

      First Described in Chapter 8 <\/em><\/p>\n

       <\/p>\n

      Physics Engine<\/h3>\n

      A term given to software that is comprised of a set of code libraries that implement the movement of objects in a game or simulation. They may be highly customizable and usually include such things as how gravity and other forces act upon objects, how collisions between two objects behave, and so on.<\/p>\n

      First Described in Chapter 11 <\/em><\/p>\n

       <\/p>\n

      Point and Click<\/h3>\n

      Refers to typical operations that use a computer mouse. A system with a point-and-click interface needs no typing. It uses the mouse to click, grab, and drag objects and text around a window to achieve the user\u2019s goals.<\/p>\n

      First Described in Chapter 11 <\/em><\/p>\n

      Point of View (POV)<\/h3>\n

      In videogames, the POV is the perspective from which the player views the game world. First person means viewed from from the perspective of the player\u2019s character; third-person is from some distance away; top-down provides a bird\u2019s-eye view, and so on.<\/p>\n

      First Described in Chapter 11 <\/em><\/p>\n

      Polygonalization<\/h3>\n

      The conversion of a three dimensional object or surface into a collection of 3D polygons.<\/p>\n

      First Described in Chapter 8 <\/em><\/p>\n

      Post Mortem<\/h3>\n

      The process of critically examining the development process of a game or simulation after it has been built in order to learn from it. A post mortem usually includes analyses of what went right, what went wrong, what was learned, and what would be done differently if it were to be done again. It also includes a brief description of the game, the development team, and the tools used.<\/p>\n

      First Described in Chapter 10 <\/em><\/p>\n

      Play Testing<\/h3>\n

      The process of observing typical players of a game to ensure that it offers the right features and degree of entertainment.<\/p>\n

      First Described in Chapter 9<\/em><\/p>\n

      Playable<\/h3>\n

      A running, albeit possibly incomplete version of a digital game.\u00a0 It typically lacks subtlety and finesse, but has the basic shape and structure, allows user inputs, possesses the goals of the final game, and has the potential for fun. In game development it is essential that a playable version be produced as early on in the process as possible in order to reveal design problems when they are still relatively easy to correct.<\/p>\n

      First Described in Chapter 9<\/em><\/p>\n

      Pixel<\/h3>\n

      A picture element; a single spot on an image or screen that represents a small area of a picture or image. It is represented on a computer as a number (grey) or three numbers (red, green, and blue components) that give the color.<\/p>\n

      First Described in Chapter 8 <\/em><\/p>\n

      Predictive Validation<\/h3>\n

      Collected data is used to formulate the parameters of a simulation, but it can also be used to compare it against the simulated output as a form of calibration. In this case we use the data to predict what will happen and then observe the actual system to see that they match.<\/p>\n

      First Described in Chapter 9<\/em><\/p>\n

      Presence<\/h3>\n

      The sense of being in a particular place or environment. The feeling that a situation is real and natural even though it is controlled and monitored.<\/p>\n

      First Described in Chapter 11 <\/em><\/p>\n

      Pretest-Posttest Control Group Design<\/h3>\n

      A form of survey research that uses two or more groups of subjects formed by random assignment. One group is a control (i.e. does not get any treatment), while every other group gets a distinct treatment. All groups are administered two tests: one that is given before the treatment and one that is given after the treatment. Pretest scores should indicate that all groups were similar before the treatment, while the posttest is intended to uncover the effect of the different treatments (one of which may include no intervention at all).<\/p>\n

      First Described in Chapter 9<\/em><\/p>\n

      Prim<\/h3>\n

      Short for \u201cprimitive object\u201d. This is the name given to the basic building blocks in Second Life<\/em>. They are three dimensional and include spheres, blocks, and cones which can be resized and reshaped, and then covered in a texture to make them look like whatever objects you need.<\/p>\n

      First Described in Chapter 11 <\/em><\/p>\n

      Process<\/h3>\n

      A course of action intended to achieve a particular result. Examples: serving customers at a bank; the re-growth of a forest after a fire; landing an airplane; the action of a particular drug.<\/p>\n

      First Described in Chapter 2 <\/em><\/p>\n

      Process Flow Diagram (PFD)<\/h3>\n

      A specific type of visualization of a system that shows major operators\/facilities and omits details.\u00a0 Shows the path taken by material through a factory or other installation, or the path of data through a processing scheme.<\/p>\n

      First Described in Chapter 14<\/em><\/p>\n

      Priority Queue<\/h3>\n

      A priority queue can be thought of as a queue where the high priority clients move to the front immediately, ahead of all lower priority clients. In practice, it is often implemented as two separate queues.<\/p>\n

      First Described in Chapter 12<\/em><\/p>\n

      Pseudocode<\/h3>\n

      An informal description of an algorithm that is to be implemented on a computer. It is typically written in a programming-language like style.<\/p>\n

      First described in Chapter 7<\/em><\/p>\n

      Pseudorandom Number<\/h3>\n

      A number from a sequence that appears to be random. A pseudorandom sequence is one that satisfies standard tests of randomness.<\/p>\n

      First Described in Chapter 6<\/em><\/p>\n

      Queue<\/h3>\n

      A linear structure within which customers or clients await service. In a bank, for example, a queue is a line of customers, one behind another, where the one in front is being served. When the first client is done and leaves, then the second becomes first and so on.<\/p>\n

      First described in chapter 7.<\/p>\n

      Queuing Model<\/h3>\n

      A sub-category of discrete event simulation where the main structure is that of one or more line-ups, or queues.<\/p>\n

      First Described in Chapter 5.<\/em><\/p>\n

      Randomized Controlled trial<\/h3>\n

      A scientific experiment involving an intervention on a group of subjects in which the original group is broken into a control group, which receives no intervention, and a second group that does receive it. The assignment to groups is done at random so as to eliminate allocation bias.<\/p>\n

      First Described in Chapter 9<\/em><\/p>\n

      Raster<\/h3>\n

      A graphical technique in which images consist of 2D arrays of pixels. Most of the images we are familiar with are raster images. Raster image formats include .gif, .jpg, .png, and .bmp. The other primary way of representing images is using vectors which essentially describe an image by defining the line segments that would be used to draw it. This form of image is often used for maps.<\/p>\n

      First Described in Chapter 8 <\/em><\/p>\n

      Reneging<\/h3>\n

      When a client enters a queue and leaves again without being served.<\/p>\n

      First Described in Chapter 7<\/em><\/p>\n

      Runs Test<\/h3>\n

      A test of whether a random number generator produces random numbers that is based on the predicted occurrence of consecutive 1s or 0s in a randomly generated sequence. Variations between the generated sequence and the predicted sequence indicate non-randomness.<\/p>\n

      First Described in Chapter 6<\/em><\/p>\n

      Seed:<\/h3>\n

      The initial value of a pseudorandom number generator, from which all of the other numbers in the sequence are generated.<\/p>\n

      First Described in Chapter 6<\/em><\/p>\n

      Sensitivity Analysis<\/h3>\n

      A method of simulation validation that checks to make sure that those aspects (variables<\/em>) of the original system to which it is most sensitive have a similar effect within the simulation.<\/p>\n

      First Described in Chapter 9<\/em><\/p>\n

      Serious Game<\/h3>\n

      A game that has a designed task in addition to entertainment.<\/p>\n

      First described in Chapter 1.<\/em><\/p>\n

      Server<\/h3>\n

      The portion of a queuing system that is responsible for processing work requests from arrivals. In a bank simulation, a server could be a teller.<\/p>\n

      First described in Chapter 7.<\/p>\n

      Service Time<\/h3>\n

      The time required to handle a service request; the time needed to handle a bank customer, or make a serve a hot dog would be examples.<\/p>\n

      First described in Chapter 7.<\/em><\/p>\n

      Sequencing Set<\/h3>\n

      The list of events that are scheduled to occur in a simulation, sorted according to the time they are due. Events will typically be added to the set as the simulation runs, often as a result of some other event being handled. New events are inserted into the list at the appropriate place based on when they are due to occur. Also called a pending event list<\/em>.<\/p>\n

      First Described in Chapter7<\/em><\/p>\n

      Short Form Game<\/h3>\n

      A game having only a few minutes of actual playing time and limited goals. Often a casual game, needing little commitment and playable in small snippets of spare time.<\/p>\n

      First described in Chapter 1.<\/em><\/p>\n

      Simulation<\/h3>\n

      A computer programmed implementation of an abstract model. Sivasailam Thiagarajan, (1998) the noted performance training designer said that a simulation is \u201ca representation of the features and behaviors of one system through the use of another\u201d (p.35).<\/p>\n

      First Described in Chapter 2 <\/em><\/p>\n

      Simulation Game<\/h3>\n

      A game that exposes the simulation that underlies it as a component of play. Civilization<\/em> is a simulation game because the object is to manipulate the simulation parameters directly, rather than by using indirect mechanics. The Tycoon<\/em> games (EG. Roller Coaster Tycoon<\/em>) are also popular simulation games.<\/p>\n

      First described in Chapter 1.<\/em><\/p>\n

      Simulation Model<\/h3>\n

      A representation, either mathematical, graphical, verbal, or otherwise, of some system of interest, upon which a simulation will be based.<\/p>\n

      First Described in Chapter 5 <\/em><\/p>\n

      Simulation Object (element)<\/h3>\n

      A simulation object (element) is a collection of properties that characterizes an entity that participates in the simulation; objects have names by which we identify them.<\/p>\n

      First Described in Chapter 9<\/em><\/p>\n

      Simulator<\/h3>\n

      A device that is used to simulate a situation, often for training purposes. EG the lunar module simulator or the Link trainer.<\/p>\n

      First Described in Chapter 1<\/em><\/p>\n

      Single Server Queuing System<\/h3>\n

      A queuing system that has one queue and one server.<\/p>\n

      First described in Chapter 7.<\/em><\/p>\n

      Software Development Kit – SDK<\/h3>\n

      SDK stands for Software Development Kit. It is a tool or set of tools designed to facilitate the creation of application programs for a specific framework, application package, or system in general. It usually includes some form of editor and a way to test programs by running them from within the SDK.<\/p>\n

      First Described in Chapter 11<\/em><\/p>\n

      Sprite<\/h3>\n

      A (usually) two dimensional image used to represent an object in a scene in a computer game.<\/p>\n

      First described in Chapter 11.<\/em><\/p>\n

      SQS<\/h3>\n

      See Sequencing Set<\/em><\/p>\n

      First described in Chapter 7.<\/em><\/p>\n

      Standard Deviation<\/h3>\n

      A measure of the variation within a set of numbers. It represents the normalized average amount that a measurement is expected to differ from the average.<\/p>\n

      First described in Chapter 7.<\/em><\/p>\n

      State<\/h3>\n

      In a queuing system, the state is the number of customers in the system at any given time.<\/p>\n

      First described in Chapter 5 <\/em><\/p>\n

      Stochastic Simulation<\/h3>\n

      A simulation that makes use of random numbers to approximate unknown underlying processes in a model. It is also used to simulate events that actually occur at random in real life.<\/p>\n

      First Described in Chapter 2 <\/em><\/p>\n

      Storyboard<\/h3>\n

      A process for walking through a scene from a game or animation using a sequence of drawings. The designer steps through the pictures and explains the action to a small audience of development team members. Developed at Walt Disney studios.<\/p>\n

      First Described in Chapter 10 <\/em><\/p>\n

      System<\/h3>\n

      \u201cA collection of interdependent elements which act together in a collective effort to achieve some goal.\u201d (Mihram, 1972) A system constitutes a ‘Gestalt’, where the whole is greater than the sum of the parts. Examples: a game of tag, a vampire, a car engine, the solar system, grammar rules for English, a wetland, the human circulatory system, etc.<\/p>\n

      First Described in Chapter 2 <\/em><\/p>\n

      System Time<\/h3>\n

      System time is the specific time that a client spent in the system.<\/p>\n

      First Described in Chapter 12 <\/em><\/p>\n

      Tandem Queue<\/h3>\n

      In a tandem queuing model, a client departing from a server enters another single server system and waits for another, different server.<\/p>\n

      First Described in Chapter 12 <\/em><\/p>\n

      Task Analysis<\/h3>\n

      Although the term can be used in various ways, for our purposes, task analysis is a structured way to finding out what people do when they are performing a particular function or job. It often involves following one or more people as they perform their jobs and effectively logging what they do.<\/p>\n

      First Described in Chapter 14 <\/em><\/p>\n

      Teleoperation<\/h3>\n

      The operation of a device from a distance. Can involve sensory feedback from the device to the operator (visual, auditory, haptic).<\/p>\n

      First Described in Chapter 1 <\/em><\/p>\n

      Tessellation<\/h3>\n

      See\u00a0: polygonalization<\/em>. A tiling of a plane or other surface by a collection of plane figures, such as polygons.<\/p>\n

      First Described in Chapter 8 <\/em><\/p>\n

      Triage<\/h3>\n

      A process first used in field situations during wars, where those injured were assessed quickly and assigned a priority based on the severity of their injuries. The most severely injured were given the highest priorities. The same system is used in hospital emergency departments to determine who can wait their turn, and who must be placed at the front of the queue.<\/p>\n

      First Described in Chapter 12 <\/em><\/p>\n

      True random numbers:<\/h3>\n

      Sets of numbers that are obtained by sampling values taken from real-life events that are actually random, such as static noise.<\/p>\n

      First Described in Chapter 6<\/em><\/p>\n

      Unified Modeling Language (UML)<\/h3>\n

      A set of graphic notation symbols and associated methods that allow the creation of a visual representation of a simulation or model.<\/p>\n

      First described in Chapter 9<\/em><\/p>\n

      Uniform Distribution<\/h3>\n

      A statistical distribution in which the probability of any value is the same as any other.<\/p>\n

      First described in Chapter 7.<\/em><\/p>\n

      Validation<\/h3>\n

      The process of determining the degree to which a model is an accurate representation of the real world from the perspective of the intended use of the simulation. Validation ensures that the assumptions, values, and data are valid and correct.<\/p>\n

      First described in Chapter 9<\/em><\/p>\n

      Variable<\/h3>\n

      An element whose value can be changed to different things, depending on various conditions.<\/p>\n

      First Described in Chapter 2<\/em><\/p>\n

      Verification<\/h3>\n

      The process of determining that a simulation implementation and its associated data accurately represent the underlying model that was selected. This process checks to make sure that the code is working properly and that it has been implemented to correctly reflect the model.<\/p>\n

      First described in Chapter 9<\/em><\/p>\n

      Virtual Reality<\/h3>\n

      A computer simulated environment in which graphical objects drawn by the computer are used to represent real ones. It is a simulation of real 3D space, and a user can be immersed in this environment by virtue of the fact that the computer can present a view from any point in space. (The term was coined by writer and dramaturge AntoninArtaud in the 1930\u2019s with respect to theatre)<\/em><\/p>\n

      First Described in Chapter 1 <\/em><\/p>\n

      Walkthrough<\/h3>\n

      A formal, comprehensive review of a program. Includes inspection of the algorithms and code. A method for locating errors and inconsistencies in a computer simulation or model that involves a systematic review of code and documentation before a group of experts.<\/p>\n

      First described in Chapter 9<\/em><\/p>\n

      Waypoint Navigation<\/h3>\n

      Navigating through a virtual space by using fixed points as interim targets. The path to the next waypoint can be a simple one, a line for example. Waypoints are placed by human designers, thus eliminating the need for complex autonomous navigation methods.<\/p>\n

      First Described in Chapter 13 <\/em><\/p>\n

      Z-buffer algorithm<\/h3>\n

      In computer graphics, this is a method of hiding distant surfaces behind nearer ones that tests the Z coordinate (distance) against that the pixel currently on the screen at that point. The nearer pixel is the only one drawn.<\/p>\n

      First Described in Chapter 8 <\/em><\/p>\n

      \u00a0<\/em><\/p>\n

       <\/p>\n

      \n

      References<\/h2>\n<\/div>\n

      Becker, K. (2006). Classifying Learning Objectives in Commercial Video Games<\/strong>. Paper presented at the Summer 2006 Institute – Linking Research to Professional Practice.<\/p>\n

      Franta, W. R. (1977). The process view of simulation.<\/strong> New York: North-Holland.<\/p>\n

      Fullerton, T., Swain, C., & Hoffman, S. (2008). Game design workshop : a playcentric approach to creating innovative games<\/em> (2nd ed.). Boston: Elsevier Morgan Kaufmann.<\/p>\n

      Mihram, G. A. 1972. Simulation: statistical foundations and methodology<\/strong>, New York,, Academic Press.<\/p>\n

      Thiagarajan, S. (1998). The Myths and Realities of Simulations in Performance Technology<\/strong>. Educational Technology, 35-41.<\/p>\n

      Zeigler, B. P. (1976). Theory of modelling and simulation<\/em>. New York: Wiley.<\/p>\n

       <\/p>\n

       <\/p>\n","protected":false},"excerpt":{"rendered":"

      This glossary defines how various terms are used in this book. Although their use here does not deviate dramatically from commonly accepted meanings, we have encountered sufficient opposition and argument over many of these terms to warrant defining them for our purposes. Further, there are frequent discussions and debates about terminology among various simulation and […]<\/p>\n","protected":false},"author":1,"featured_media":82,"parent":0,"menu_order":0,"comment_status":"open","ping_status":"open","template":"","meta":{"_genesis_hide_title":false,"_genesis_hide_breadcrumbs":false,"_genesis_hide_singular_image":false,"_genesis_hide_footer_widgets":false,"_genesis_custom_body_class":"","_genesis_custom_post_class":"","_genesis_layout":"","jetpack_post_was_ever_published":false,"footnotes":""},"class_list":{"0":"post-61","1":"page","2":"type-page","3":"status-publish","4":"has-post-thumbnail","6":"entry"},"jetpack_shortlink":"https:\/\/wp.me\/P4QGQz-Z","jetpack_sharing_enabled":true,"_links":{"self":[{"href":"http:\/\/minkhollow.ca\/books\/index.php?rest_route=\/wp\/v2\/pages\/61","targetHints":{"allow":["GET"]}}],"collection":[{"href":"http:\/\/minkhollow.ca\/books\/index.php?rest_route=\/wp\/v2\/pages"}],"about":[{"href":"http:\/\/minkhollow.ca\/books\/index.php?rest_route=\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"http:\/\/minkhollow.ca\/books\/index.php?rest_route=\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"http:\/\/minkhollow.ca\/books\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=61"}],"version-history":[{"count":10,"href":"http:\/\/minkhollow.ca\/books\/index.php?rest_route=\/wp\/v2\/pages\/61\/revisions"}],"predecessor-version":[{"id":494,"href":"http:\/\/minkhollow.ca\/books\/index.php?rest_route=\/wp\/v2\/pages\/61\/revisions\/494"}],"wp:featuredmedia":[{"embeddable":true,"href":"http:\/\/minkhollow.ca\/books\/index.php?rest_route=\/wp\/v2\/media\/82"}],"wp:attachment":[{"href":"http:\/\/minkhollow.ca\/books\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=61"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}