Co CRC PRESS
`
`COMPUTER
`SCIENCE
`aaa
`ano TECHNOLOGY
`
`een@NNae
`aEE
`
`EDITOR-IN-CHIEF
`Phillip A. Laplante
`
`HPE, Exh. 1019, p. 1
`
`

`

`DICTIONARY
`OF
`
`COMPUTER
`SCIENCE,
`ENGINEERING,
`ano TECHNOLOGY
`
`EDITOR-IN-CHIEF
`Phillip A. Laplante
`
`CRC Press
`Boca Raton London New York Washington, D.C.
`
`HPE, Exh. 1019, p. 2
`
`HPE, Exh. 1019, p. 2
`
`

`

`Library of Congress Cataloging-in-Publication Data Dictonary of computer science, engineering, and technology/ edited by Phillip Laplante.
`
`cm.
`p.
`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 been 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, microfilming, 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
`clients, may be granted by CRC Press LLC,providedthat $.50 per page photocopied is paid directly to Copyright Clearance
`Center, 222 Rosewood Drive, Danvers, MA 01923 USA The fee code for users of the Transactional 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 license 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.
`
`Directall inquiries to CRC Press LLC, 2000 N.W. Corporate Blvd., Boca Raton, Florida 33431.
`
`Trademark 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.crcepress.com
`
`© 2001 by CRC Press LLC
`
`Noclaim to original U.S. Government works
`International Standard Book Number 0-8493-2591-5
`Library of Congress Card Number 00-052882
`234567890
`
`HPE, Exh. 1019, p. 3
`
`HPE, Exh. 1019, p. 3
`
`

`

`
`
` This material may be protected by Copyright law (Title 17 U.S. Code)
`
`static
`
`(1) in an automaton,represents a com-
`state
`putational stage of the process of processing an
`input stream.
`(2) in any computation,the currentsetof val-
`ues being operated upon.
`
`state automaton
`
`See finite state machine.
`
`mean “a computation returning a value which
`can be used in an expression, and which has no
`side effects”. Often implemented by compilers
`as inline functions.
`
`a model based on state
`state-oriented model
`machines or their extensions.
`
`statediagram (1) a form ofdiagram showing
`state space conditional code—_an approach
`the conditions (states) that can exist in a logic
`where the number of codes is much less than
`system and whatsignals are required to go from
`with conditional coding. The previous N ~— 1
`onestate to anotherstate.
`pixels are used to determine the state s;. Then
`(2) a simple diagram representing the input-
`the j-th variable word-length is used to code the
`output relationship and all possible states of a
`value.
`convolutional encoder together with the possi-
`ble transitions from one state to another. Dis-
`tance properties and error rate performance can
`be derived from the state diagram.
`
`a representation for an
`state-space operator
`individual action that maps each state into the
`state resulting from executing the action in the
`previousstate.
`
`a software or hardware struc-
`state machine
`ture which can be in one of a finite collection
`state transition_in a state machine, the event
`of states. Used to control a process by stepping
`related to a change of state. Generally the tran-
`from state to state as a function of its inputs. See
`sition is performed whena certain condition be-
`also finite state machine.
`comes true while staying in the departing state
`ofthe transition.
`
`The transfer of control from one state to an-
`other (possibly the same) state is affected by a
`production rule, which is a mapping from the
`current input symbol, the current state, and the
`values in the store (usually a pushdownstack),
`to the newstate. A state transition usually im-
`plies reading one symbol from the inputstring.
`See also lambda.
`
`in most programming languages,
`statement
`the basic unit of sequential computation. The
`exact definition of what constitutes a statement
`is language-dependent, but in traditional pro-
`gramming languages an elementary computa-
`tion that produces a result or modifies the flow
`of controlof the program is a statement(as dis-
`tinguished from an expression or a declaration).
`Statements are usually basic objects of program
`sequencing, and often are part of the specifi-
`cation of evaluation order (“all computations
`of one statement shall be completed before the
`next statement begins computations”is a typical
`specification).
`
`a diagram
`state transition diagram (STD)
`consisting of circles to represent states and di-
`rected arcs to representtransitions between the
`states. One or more actions (outputs) may be
`associated with each transition. The diagram
`represents a finite state machine.
`statement coverage_selecting and executing
`a series of test cases to ensure that every state-
`ment in the code is tested at least once.
`
`a construct in the FOR-
`statement function
`TRAN language (which has equivalents in some
`other languages) which allows a programmer
`to declare a single-line (‘‘statement” in FOR-
`TRAN)definition of a function.
`In this case,
`the word “function”is interpreted in the partic-
`ular semantics of the FORTRAN language to
`
`a function that
`State-translation function
`maps eachstate and action deterministically to a
`resulting state. In the stochastic case, this func-
`tion is replaced by a conditional probability dis-
`tribution.
`
`(1) pertaining to an event or process
`static
`that occurs before the execution of a computer
`program.
`
`467
`
`HPE, Exh. 1019, p. 4
`
`HPE, Exh. 1019, p. 4
`
`