Case 1:20-cv-00034-ADA Document 45-26 Filed 03/20/20 Page 1 of 6
`Case 1:20-cv-00034-ADA Document 45-26 Filed 03/20/20 Page 1 of 6
`
`
`
`EXHIBIT 24
`
`EXHIBIT 24
`
`
`
`
`
`
`
`

`

`Case 1:20-cv-00034-ADA Document 45-26 Filed 03/20/20 Page 2 of 6
`
`COMPUTING
`
`1m to
`
`I".
`
`xx
`
`-
`
`OXFORD
`
`{q 3‘
`V
`
`3'!
`
`.
`
`:---
`l
`
`p
`
`.
`
`DEFS_ANCORA00002131
`
`

`

`Case 1:20-cv-00034-ADA Document 45-26 Filed 03/20/20 Page 3 of 6
`Case 1:20-cv-00034-ADA Document 45-26 Filed 03/20/20 Page 3 of 6
`
`Dictionary of
`Computing
`
`Fourth Edition
`
`Oxford New York Tokyo
`
`OXFORD UNIVERSITY PRESS
`
`1996
`
`STiFii—iititz
`
`
`
`
`COU “GIL
`LlBRARiES
`
`
`
`
`DEFS_ANCORA00002132
`
`

`

`Case 1:20-cv-00034-ADA D0cumen99§£k§l5 Ffia‘HtM/ZOIZO Page 4 of 6
`Case 1:20-cv-00034-ADA Document 45-26 Filed 03/20/20 Page 4 of 6
`
`Oxford University Press. Walton Street. 0.x:tord OX2 ()DP
`
`Oxford New York
`Athens Auckland Bangkok Bogota Bombay
`BuenosAt'res Caicutto Cape Town Dot'es Salaam
`Deihi Fiarence Hong Kong istanhui Karachi
`KttaioLutttpur Modras Madrid Meiitourne
`Me.\'icoC'ity Nairobi Paris Singapore
`Taipei Tokyo Toronto
`
`and associated companies in
`Bert'in ihadan
`
`Oxford is a trade mark of Oxford University Press
`
`Pubiished in the United States
`
`h,1-'0.\jord University Press the. New York
`
`C”) Market House Books. i983. t936. 1990, t996
`
`Fit's! pubiished 1993
`Reprinted 1983, ”84. 1985
`Second Edition i 986
`Third Edition 1' 990
`
`Reprinted tOOU, 1'99} {twice t. i 993
`Fourth Edition i996
`
`Ah‘ rights reserved. No part of this publication may be
`reproduced. stored in o retriet-‘ai system. or transmitted. in any
`jornt or by any means. without the prior permission in n-‘riting 010.13”:er
`University Press. Within the UK. exceptions are oiiowcd itt respect at'atty
`fair deaiingfor the purpose of research or private study. or criticism or
`review. as permitted under the Copyright. Designs and Potents Act. i 988. or
`in the case ofreprogrophic reproduction in accordance with the terms of
`iicences issued by the Copyright Licensing Agency. Enquiries concerning
`reproduction outside those terms and iii other countries shotdd he sent to
`the Rights Department. Osford University Press. at the address above.
`
`This book is said subject to the condition that it shaii not.
`by way oftrade or otherwise. he tent. re-soid. hired out. or otherwise
`circuiated without the puhiisher 's prior consent in ("U-"fut?” of hinding
`or cover other than that in u-‘hich it is pahiis'hed and without a sintihtr
`condition including this condition heing imposed
`on the subsequent purchaser.
`
`A ct'ttatogae recot'djor this hook is ovaiiabieflrom the British Library
`
`Lihrory of Congress Cataioging in Puhiication Date
`{ Data ttl’aiiahie J
`
`[SEN 0—) 91953855—3
`
`Text prepared by Market House Books Ltd. A‘s-'ieshury
`Printed in Great Britain by
`Biddies Ltd. Guiiojrord & King's Lynn
`
`Cot-69L
`
`in"
`-.t
`
`'
`tL
`
`DEFSHANCORAOOOO2133
`
`

`

`Case 1:20-cv-00034-ADA Document 45-26 Filed 03/20/20 Page 5 of 6
`I':-'_“'-"'easerfc'fi'EFCifiGUOM-ADA Document 45-26 Filed 03/20/20 Page50f6
`ALARP PRINCIPLE
`
`lI
`
`tutc, which in turn represents a *graph. Ill-‘1
`is the adjacency matrix corresponding to ,1
`given graph G, thenri'
`-—
`I
`,
`'
`U
`if there is an edge from vertex i to vertex; in
`G; otherwise
`
`to : 0
`If G is a directed *giatih then
`in: l
`o
`if there is an edge directed from vertex i to
`vertex j; otherwise
`ay- 5 U
`If the vertices of the graph are numbered
`1,2,...m, the adjacency matrix is of a type
`tin-(iii. if
`
`.o‘XxIX, . .XA (1) terms, {Sin}
`is evaluated,
`the nonzero entries indicate
`those vcrtices that are joined by a *path of
`lgngth p; indeed the value of the (ifith entry
`of AP gives the number of paths of length ,0
`from the vertex i to vertex 3’. By examining
`the set ot‘such matrices,
`in = 1,2,..., m——I
`it can be determined whether two vertices are
`connected.
`It is also possible for adjacency matrices to
`he formed from *Boolean matrices.
`adjacency structure {adjacency list) A
`means of representing :1 *graph. The adja—
`cency structure corresponding to a *path G
`is the set
`{Adj(v) | c is a vertex in C}
`”'0‘ is an undirected graph, then a vertex H’ is
`in Adfiy) if and only if there is an edge in G
`betWecn c and IF; if G is a directed graph,
`then It? is in Adflc) if and only if there is an
`edge in G directed from c to at.
`ADP Arman-ti. fiJr automatic data processing. Sec
`data processing.
`affine mapping (affine transformation) A
`mapping from one coordinate system to
`another under which parallel
`lines remain
`parallel and ratios ofcollinear points are pre-
`served. An afline mapping can be decom-
`posed into linear transformations (rotation,
`scaling, and shear) and translation.
`AFIPS American Federation of Information
`Processing Societies, founded in 1%] to pro-
`vide a structure for professional societies
`with a primary interest in information prm
`
`ccssing to join together in order to advance
`the state of the art. AFIPS was dissolved in
`
`1990. In 1991 its two principal members, the
`*ACM and the ”REF. Computer Society,
`formed a joint committee known as FOCUS
`{Focus on Computing in the US). which rep—
`resents the US in *IFIP.
`
`AFL AiriErrttjhr abstract family of languages.
`
`agenda mechanism A control scheme often
`used in *knnwledge—hased systems and
`*biackhoard systems to order the sequence of
`action execution. While the system is run—
`ning, inference processes may examine the
`agenda and manipulate it by the dynamic
`addition, removal, and reordering oFitems.
`
`agent An autonomous system that receives
`information from its environment, processes
`it, and performs actions on that environ—
`ment. Agents may have different degrees of
`intelligence or rationality, and may be soft-
`ware, hardware, or both.
`Software agents operate in symbolic envi—
`ronments, and perceive and act upon strings
`of symbols; examples include personal assis-
`tant agents that enhance and customize i'aciln
`ities for computer users, and *data mining
`agents that search for interesting patterns in
`large databases. In a *distrihuted system, the
`agent for a *rcmote procedure call is in a dif-
`ferent computer from the caller; its environ—
`ment is the network and the procedure body.
`A robot (sec robotics) is an example of an
`agent that perceives its physical environment
`through sensors and acts through effectors.
`
`AGV .-*lM)J‘t’I‘. for autonomous guided vehicle.
`
`AI .-‘Hiiirct‘-. for artificial intelligence.
`
`Altken’s A2 process A method to convert
`any convergent sequence {tn} into a more
`rapidly convergent sequence {.rfl’}. For lin_
`early converging sequences the formula is:
`‘Yn’ : "In _ ("IIIWI — "Irr)2/('rn+l _ 2Itfll + I")
`AIX An IBM version of * UNIX.
`
`ALARP principle A principle that is associat-
`ed with the design and development oi'safety
`systems, and captures the notion that the risk
`to individuals, society, and the environment
`should he sis Low As Reasonably Possible.
`See aisu safetyrci'itical system, satiety-related
`system.
`
`DEFS_ANCORADOOO2134
`
`

`

`Case 1:20-cv-00034-ADA Document 45-26 Filed 03/20/20 Page 6 of 6
`Case 1:20-cv-00034-ADA Document 45-26 Filed 03/20/20 Page 6 of 6
`
`tot
`
`FIRST NORMAL FORM
`
`ny'crzoig stairs, and let .7“ be some member of
`Q (referred to as the star! state). The language
`recognizer! by the FSA is the set of all JP such
`that
`
`finia‘fu)
`is an accepting state, i.e. the set of all strings
`that take the start state to an accepting state.
`For example, in the FSA shown in the figure
`let g" be 1 and let 4 be the only accepting
`state; the language recognized is then the set
`of all strings over
`la,b,r} that somewhere
`contain all: as a substring. A language recog—
`nized by an FSA is known as a '* regular lan»
`guage.
`A generalization is to allow more than one
`state to which the FSA can move, for a given
`input symbol and current state. This gives a
`nwith-terminittir FSA. The input string is
`then accepted if there is some sequence of
`choices of moves leading to an accepting
`state. Such a machine can always be convert—
`ed to a deterministic one recognizing the
`
`same language.
`See also sequential machine, minimal
`machine.
`
`FIPS .--irrmt_1oa for Federal Information Pro-
`cessing Standards. Standards that
`the US
`government uses in its procurement efforts
`and that are adopted (rarely created) and
`maintained by the US National Institute of
`Standards and Technology, NIST (formerly
`the National Bureau of Standards).
`
`Fire codes A family of *polynomial *block
`codes designed to correct *burst errors.
`
`firewall A sysrem designed to control the pas—
`sage of information from one network into a
`second network. Typically a firewall will be
`used as a means of reducing the risk of
`unwanted access to sensitive systems, where
`one carefully regulated network contains the
`sensitive systems and is connected to a larger
`less-regulated network. A firewall can be
`effective if access to the firewall itself is care-
`
`fully regulated.
`
`firing rule Sec Petri net.
`
`firmware System software that is held in read
`only memory (*ROM).
`
`FIRST .-irrmnon for Forum of Incident and
`Response Teams. An international group
`
`bringing together those working on the pro-
`vision of protection against computer mis-
`use. See also computer emergency response
`[BRIT].
`
`first—class type in the design of a program-
`ming language. A *type whose *obiccts can
`take part in the full range of'operations avail-
`able within the language (such as declaration
`ol‘constants and variables oflhe type in ques—
`tion, assignment of values, employment as
`fields of records and as elements of arrays,
`
`occurrence as parameters and return values
`of functions). The objects ofa first-class type
`arcfirsi-rlun objrds. 1"or example, functions
`are first-class in Algol 68 but not in Algol an,
`Pascal or Ada.
`
`first fit A method of selecting a contiguous
`area of memory that is to be allocated for a
`segment. The *frce—space list is scanned in
`order of starting address, and the allocation
`made from the first
`free area whose size
`
`exceeds that of the request. Despite its
`apparent simplicity this algorithm has a
`number of desirable properties in terms of
`
`performance.
`
`first generation of computers. The Series of
`calculating and computing machines whose
`designs were started between 1940 (approxi—
`mately) and 1955. These machines are char-
`acterized by electronic tube (valve) circuitry,
`and delay line,
`rotating, or electrostatic
`(Williams tube) memory. The majority of
`them embodied the stored program concept.
`For the most part, first—generation machines
`used as input/output punched paper tape,
`punched card, magnetic wire, magnetic tape,
`and printers. Despite these seeming handi—
`caps,
`impressive computations in weather
`forecasting, atomic energy calculations, and
`similar scientific applications were routinely
`performed on them.
`Important
`first—generation development
`machines include the *Manchester Mark I,
`*EDSAC, *EDVAC, *SEAC, *Whirlwind.
`*IAS, and *ENIAC while the earliest com-
`mercially available computers include.
`the
`*Fert‘anti Mark I,
`*UNIVAC I,
`and
`*I.E0 I.
`
`first in first out See FIFO.
`
`first normal form .S'er normal forms.
`
`DEFS_ANCORADOOO2135
`
`