IPR2021-01406
`
`ll wh Crea
`
`—_—
`
`aa -
`
`a, .
`a
`
`ie
`
`Roku v. Ancora
`
`Roku EX1038
`Roku v. Ancora
`IPR2021-01406
`
`

`

`Dictionary of
`Computing
`
`Fourth Edition
`
`Oxford New York Tokyo
`OXFORD UNIVERSITY PRESS
`
`1996
`
` LIBRARIES
`
`

`

`00505 6101
`
`Oxford University Press, Walton Street, Oxford OX2 6DP
`Oxford NewYark
`Athens Auckland Bangkok Bogota Bombay
`Buenos Aires Calcutta Cape Town Dar es Salaam
`Dethi Florence Hong Kong Istanbul Karachi
`Kuala Laanpur Madras Madrid Melbourne
`Mexico City Nairebi Paris Singapore
`Taipei Tokyo Terenio
`and associated companies in
`Berlin Ibadan
`
`Oxfordis a trade mark of Oxford University Press
`
`Published in the United States
`hy Oxford University Press Inc., New York
`
`© Market House Books, 1983, 1986, 1990, 1996
`
`First published 1993
`Reprinted 1983, 1984, 1985
`Second Edition 1986
`Third Edition 1990
`Reprinted 1990, 1991 (twice), 1992
`Fourth Edition 1996
`
`All rights reserved. No part ofthis publication may be
`reproduced, stored in a retrieval system, or transmitted. in any
`Jornor by any means, without the prior permission in writing of Oxford
`University Press. Within the UK, exceptions are allowedin respect ofany
`fair dealingfor the purpose of research or private study, or criticism or
`review, as permitted under the Copyright, Designs and Patents Act, 1988, or
`in the case ofreprographic reproduction in accordance with the terms of
`licences issued by the Copyright Licensing Agency. Enquiries concerning
`reproduction outside thase terms andin ather countries should be sent to
`the Rights Department, Oxford University Press, at the address above.
`
`This bookis sald subject to the condition that it shall not,
`by wayoftrade or otherwise, be lent, re-sold, hired aut, ar otherwise
`circulated without the publisher's prier consent in anyformof binding
`or coverother than that in whichit ts published and without a similar
`conditionincluding this condition being imposed
`on the subsequent purchaser,
`
`A catalogue recordfor this book ts availablefrom the British Library
`
`Library of Congress Cataloging in Publication Data
`( Data available )
`
`ISBN 0-19-S853855-3
`
`Text prepared by Market House Books Ltd, Ayleshury
`Printed in Great Britain by
`Biddles Ltd, Guildford & King's Lynn
`
`Jo/-¢¢
`
`iC
`
`0 |
`
`

`

`| Trestmatnna vay be pentectteby Copymgitiaw (Tele LP (ksi Codey
`
`it
`
`ture, which in turn represents a “graph. Ifa
`is the adjacency matrix corresponding to a
`given graph G, then
`a= l
`if there is an edge from vertex/ to vertex / in
`G: otherwise
`
`a,=0
`If Gisa directed *graph then
`4.= ]
`if there is an edge directed from vertex ito
`vertex /; otherwise
`
`ae 0)
`If the vertices of the graph are numbered
`1,2,...m, the adjacency matrix is of a type
`mm. IF
`AXAx,..XA (p terms, pS)
`is evaluated,
`the nonzero entries indicate
`those vertices that are joined by a *path of
`length p; indeed the value ofthe (i,/)th entry
`of A’ gives the numberof pathsof length p
`from the vertex / to vertex j. By examining
`the set of such matrices,
`p= 1,2,..., m-l
`it can be determined whethertwovertices are
`connected,
`It is also possible for adjacency matrices to
`be formed from *Boolean matrices.
`adjacency structure (adjacency list) A
`means of representing a *graph, ‘The adja-
`cency structure corresponding to a *path G
`is the set
`{Adj(v) | visa vertex in G}
`If Gis an undirected graph, then a vertex iis
`in Adj(z) if and only if there is an edge in G
`between v and m,; if G is a directed graph,
`then mis in Adj(v) if and only if there is an
`edge in G directed from @to m.
`ADP Abbrev. for automatic data processing, See
`data processing.
`affine mapping (affine transformation) A
`mapping from one coordinate system to
`another under which parallel
`lines remain
`parallel and ratios of collinear points are pre-
`served. An affine mapping can be decom-
`posed into linear transformations (rotation,
`scaling, and shear) and translation.
`AFIPS American Federation of Information
`Processing Societies, founded in 196] to pro-
`vide a structure for professional societies
`with a primaryinterest in information pro-
`
`ALARP PRINCIPLE
`
`cessing to join together in order to advance
`the state of the art. AFIPS was dissolved in
`1990, In 1991 its two principal members, the
`*ACMand the *IEEE Computer Society,
`formed a joint committee known as FOCUS
`(Focus on Computing in the US), which rep-
`resents the US in *IFIP.
`
`AFL Abbrev. far abstract family oflanguages,
`agenda mechanism A control scheme often
`used in *knowledge-based systems and
`*blackboard systemsto 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 of items.
`agent An autonomous system that receives
`information from its environment, processes
`it, and performs actions on that environ-
`ment. Agents mayhave 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 personalassis-
`tant agents that enhance and customizefacil-
`ities for computer users, and *data mining
`agents that search for interesting patterns in
`large databases. In a *distributed system, the
`agent for a *remote procedurecall is in a dif-
`ferent computerfromthecaller; its enyiron-
`mentis the network and the procedure body.
`A robot (see robotics) is an example of an
`agentthat perceivesits physical environment
`throughsensors and acts througheffectors.
`AGV Abbrev. for autonomous guided vehicle.
`Al Abbrev. forartificial intelligence,
`Aitken’s A? process A method to convert
`any convergent sequence {1,} into a more
`rapidly convergent sequence {1,"}. For lin-
`early converging sequencesthe formulais:
`xy =e 41 7 XYAXa2 — 2¥41 + x,)
`AIX An IBM version of *UNIX,
`
`ALARPprinciple A principle thatis associat-
`ed with the design and developmentofsafety
`systems, and captures the notion thatthe risk
`to individuals, society, and the environment
`should be As Low As Reasonably Possible.
`See also safety-critical system, safety-related
`system.
`
`