Case 1:14-cv-02396-PGG-MHD Document 153-17 Filed 06/28/19 Page 1 of 4
`Case 1:14-cv-02396—PGG-MHD Document 153-17 Filed 06/28/19 Page 1 of 4
`
`EXHIBIT P
`
`EXHIBIT P
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`

`

`Case 1:14-cv-02396-PGG-MHD Document 153-17 Filed 06/28/19 Page 2 of 4
`
`DICTIONARY
`
`AMD TECHNOLOGY
`
`EDITOR-IN-CHIEF
`Phillip A. Laplante
`
`

`

`Case 1:14-cv-02396-PGG-MHD Document 153-17 Filed 06/28/19 Page 3 of 4
`
`Dictonary of computer science, engineering, and technology / edited by Phillip Laplante.
`p. cm.
`Includes bibliographical references and index.
`ISBN 0-8493-2691-5 (alk. paper)
`1. Computer science—Dictionaries. 2. Engineering—Dictionaries. 3.
`Technology—Dictionaries. I. Laplante, Phillip A.
`QA76.15.D5258 2000
`004'.03-dc21
`
`00-052882
`
`This book contains information obtained from authentic and highly regarded sources. Reprinted material is quoted with
`permission, and sources are indicated. A wide variety of references are listed. Reasonable efforts have bwn made to publish
`reliable data and information, but the authors and the publisher cannot assume responsibility for the validity of all materials
`or for the consequences of their use.
`Neither this book nor any part may be reproduced or transmitted in any form or by any means, electronic or mechanical,
`including photocopying, microfaming, and recording, or by any information storage or retrieval system, without prior
`permission in writing from the publisher.
`All rights reserved. Authorization to photocopy items for internal or personal use, or the personal or internal use of specific
`cUents, may be granted by CRC Press LLC, provided that $.50 per page photocopied is paid directly to Copyright Clearance
`Center, 222 Rosewood Drive, Danvers, MA 01923 USA The fee code for ubms of the Tnittsuclional Reporting Service is
`ISBN 0-8493-2691-5/01/$0.00+$.50. The fee is subject to change without notice. For organizations that have been granted
`a photocopy Ucense by the CCC, a separate system of payment has been arranged.
`The consent of CRC Press LLC does not extend to copying for general distribution, for promotion, for creating new works,
`or for resale. Specific permission must be obtained in writing from CRC Press LLC for such copying.
`Direct aU inquiries to CRC Press LLC, 2000 N.W. Corporate Blvd., Boca Raton, Florida 33431.
`Ikademark Notice: Product or corporate names may be trademarks or registered trademarks, and are used only for
`identification and explanation, without intent to infringe.
`Visit the CRC Press Web site at www.crcpress.coin
`
`© 2001 by CRC Press LLC
`No claim to original U.S. Government works
`International Standard Book Number 0-8493-2591-5
`Library of Congress Card Number 00-052882
`234567890
`
`

`

`Case 1:14-cv-02396-PGG-MHD Document 153-17 Filed 06/28/19 Page 4 of 4
`
`execution trace
`
`cessor time consumed, number of instructions
`executed, etc.
`(2) time during which an instruction or a pro­
`gram is executed. The portion of one machine
`cycle needed by a CPU’s supervisory-control
`unit to execute an instruction.
`
`trace a record reporting informa­
`tion about the execution of a program. It may
`include details about the execution of each sin­
`gle instruction as well as only some details about
`specific aspects.
`
`execution unit in modem CPU implemen­
`tations, the module in which actual instruction
`execution takes place. There may be a num­
`ber of execution units of different types within a
`single CPU, including integer processing units,
`floating point processing units, load/store units,
`and branch processing units.
`
`executive a computer program, usually part
`of an operating system, that controls the execu­
`tion of other programs and regulates work flow.
`
`exhaustive search a search strategy that
`systematically examines every possible path
`through a decision tree or network. For example,
`for the maximum-likelihood (exhaustive search)
`detection of a sequence of k bits, all 2* possible
`bit sequences are considered and the one with
`the largest likelihood is selected. Also called
`brute force search.
`
`quantification a first order logic
`operator used to quantify a variable over a finite
`or infinite set. It is used to state that a formula
`is true for one or more values of a variable. It is
`usually represented with 3. See universal quan­
`tification.
`
`exit (1) a construct in a language which trans­
`fers control from the current context to some
`enclosing context. Sometimes this is the equiv­
`alent of a return from a function. More often, it
`is a specification to terminate a loop under con­
`ditions other than those specified by the loop
`construct, or to leave a block of code by tr^s-
`ferring control to the end of the block (a limited
`form of goto).
`
`170
`
`(2) an operation in a program, whether p4
`of the language specification or provided
`library call, that terminates execution of the
`gram
`
`exoskeletal master master controller that
`user in some way wears around the limbs qjI
`body, or which is fastened to the body rathe|
`than simply grasped.
`
`expandability See extensibility.
`
`I
`
`expanded memory a term pertaining to oldej
`PC-based systems. Expanded memory specific
`cation, EMS, was developed for adding mem-
`ory to PCs (the so called LIM-EMS). PCs were
`limited in memory to 640 Kbytes even if th®
`8088/8086 CPU’s limit is 1 Mbyte. Thus, in oiw
`der to overcome this limit, the additional mem-
`ory was added by using a paging mechanism;
`up to four windows of 16 Kbytes of memory
`included into the 640 Kbytes to see up to 8^
`Mbytes of memory divided into pages of 16^
`Kbytes. To this end, special memory boards
`were built. Currently, the MS-DOS is still liiiK
`ited to 640 Kbytes, but the new microprocessors
`can address even several gigabytes over the first
`megabyte. Thus, to maintain the compatibility
`with the previous version and the adoption of the
`MS-DOS, the presence of expanded memory is
`simulated by means of specific drivers.
`
`expanding phase See growing phase.
`
`expected value of a random variable en­
`semble average value of a random variable that
`is given by integrating the random variable af­
`ter scaling by its probability density function
`(weighted average) over the entire range.
`
`expert system a computer program that con­
`tains a knowledge base and a set of algorithm®
`or rules that infer new facts from knowledge ano
`from incoming data. An expert system is an arti­
`ficial intelligence application that uses a know
`edge base of human expertise to aid in solv«^
`problems. The degree of problem solving^
`based on the quality of the data and rules o
`tained from the human expert. Expert system ^
`are designed to perform at a human expert lev®
`
`