throbber
Samsung Exhibit 1029
`Samsung v. Affinity
`IPR2014-01181
`Page 00001
`
`

`
`
`
`A Dictionary of
`
`Computing
`
`FOURTH EDITION
`
`Oxford New York
`
`OXFORD UNIVERSITY PRESS
`
`1 9 9 7
`
`Page 00002
`
`Page 00002
`
`

`
`Oxford University Press. Great Clarendon Street, Cbcford one nor
`Dxford Ne‘.-vYorl<
`.-iithens Auckland Bangkok Bogota Bombay Euenos Aires
`Calcutta CapeTown Dares Salaam Delhi Florence Hongiiong
`Istanbul Karachi Kuala Lurripar Madras Madrid Melbourne
`Mexico City Nairobi Paris Singapore Taipei Tokyo Toronto Warsaw
`and associated companies in
`Berlin Ibadan
`
`Oxford is a trade rnaric of Dxford University Press
`
`© Marlcetflotise Books Ltd. 1983, I935, 199:‘), 1996
`
`First published 1983
`Second edition 1935
`Third edition I990
`Fourth edition 1996
`
`First issued fiiiith corrections] as an Diiford University Press paperback 1997
`
`All rights reserved. No part of this publication may be reproduced.
`stored in a retrieval systern, ortransniitted. in anyfonn or by any means,
`without the prior permission in writing o_|"-Oxford University Press.
`Within thexUK. exceptions are allowed in respect of anyfair dealing for the
`purpose of research or private study, or criticisni or review. as permitted
`under the Copyright Designs and Patents Act, 1983, 01' 1'11 the case of
`reprographic reproduction in accordance with the terms of the licences
`issued by the Copyright Licensing Agency. Enquiries concerning
`reproduction outside these terms and in other countries should be
`sent to the Rights Department, Oxford University Press.
`at the address above
`
`This book is said subject to the condition that it shall not. by way
`of trade or otherwise. be lent. resold. hired out or otherwis-E circulated
`without the publisher's prior consent in any-forrn of binding or cover
`other than that in which it is published and without a similar condition
`including this condition being imposed on the subsequent purchaser
`
`British Library Cataloguing in Publication Data
`Data available
`
`Library of Congress Cataloging in Publication Data
`Data available
`ISBN 0-19-230046-9
`
`1 3 5 7 '9 10 B E 4 2
`
`Printed in Great B‘rii.'airt by
`Eidizlles Ltd
`
`Guildford and King's Lynn
`
`Page 00003
`
`Page 00003
`
`

`
`377
`
`POSITION-INDEPENDENT CODE
`
`ed, it immediately becomes the destination of
`the merge operations from the nonexhausted
`and previous-destination files When there is
`only one file left the process stops. The
`repeated merging is referred to as polyplme
`merging.
`
`PON Ablmv. /or passive optical network.
`
`pooling block An area of memory used to
`contain many short records that are to be
`transferred to or from a device for which the
`
`access time is long compared with the actual
`transfer time. See also buffer.
`
`pop See stack.
`
`POP /lrmnym for point of presence. An access
`point to the Internet, either the geographical
`location or, as a technical term, the equip-
`ment that supports the Internet access hard-
`ware and software.
`
`POP Acronym fiir post office protocol. The
`protocol
`that defines the communication
`between a utility that can accept electronic
`mail on behalf of a user, holding it until such
`time as the user wishes to recover the mes-
`
`sages. Sec message store.
`
`POP-2 A programming language developed by
`the University of Edinburgh (UK)
`for
`research in ‘artificial
`intelligence. POP-2
`provided the facility to manipulate the linked
`data structures characteristic of ‘LISP, but
`retained a more familiar procedural struc-
`ture, and was thus more accessible to pro-
`grammers raised in the Algol environment of
`the time. ‘POP-ll is a modern version of
`POP—2.
`
`POP-11 A programming language for artificial
`intelligence that claims to combine ‘LISP
`and ‘POP-2.
`
`display when the user changes the state of a
`‘button or makes a selection from a *menu
`
`bar. The menu item is selected by pointing to
`the desired entry before changing the button
`state back to the original state.
`
`pop-up progrfln A program that is perma-
`ncntly resident in memory and “pops up"
`onto the screen at the touch of a key. The
`concept has been largely superseded by the
`advent of *graphical user interfaces, where
`any program can be made to “pop up".
`
`port I. (I/O port) A connection point with
`associated control circuitry that allows I/O
`devices to be connected to the internal bus of
`
`a microprocessor. See also parallel port, serial
`port, communication port.
`2. A point through which data can enter or
`leave a ‘network, either on the network or
`the *D'I‘E (computer) interface.
`3. To move software from one type of com-
`puter system to another, making any neces-
`sary changes en route. In a simple case little
`more than recompilation may be required,
`while in extreme cases the software might
`have to be entirely rewritten.
`
`portable 1. Another word for machine-
`independent.
`Z. A word applied to software that can readily
`be transferred to other machines, although
`not actually *machine-independent.
`3. A computer that can be simply carried
`from one place to another by one person.
`They cannot necessarily be used in transit.
`Examples include ‘laptop and ‘notebook
`computers.
`
`P03 Alzbrev. fin point of sale See point-of-sale
`system.
`
`P operation (down operation) 3:: sema-
`phore.
`
`posot Short _/or partially ordered set. 3:: par-
`tial ordering.
`
`POPI. Acronym fiir Principles of Programming
`Languages. Title of an annual conference
`organized by the *ACM at which the results
`of much research in programming languages
`are announced.
`
`POPLOG A programming environment com-
`bining *POP—ll and *Prolog.
`
`population See sampling.
`
`pop-up menu A *menu that appears on the
`
`P08 expression Short for product of sums
`expression.
`
`positional system 3:: number system.
`
`position-Independent code Program code
`that can be placed anywhere in memory, since
`all memory references are made relative to
`the ‘program counter. Position-independent
`code can be moved at any time, unlike ‘relo-
`catable code, which can be loaded anywhere
`
`Page 00004
`
`Page 00004

This document is available on Docket Alarm but you must sign up to view it.


Or .

Accessing this document will incur an additional charge of $.

After purchase, you can access this document again without charge.

Accept $ Charge
throbber

Still Working On It

This document is taking longer than usual to download. This can happen if we need to contact the court directly to obtain the document and their servers are running slowly.

Give it another minute or two to complete, and then try the refresh button.

throbber

A few More Minutes ... Still Working

It can take up to 5 minutes for us to download a document if the court servers are running slowly.

Thank you for your continued patience.

This document could not be displayed.

We could not find this document within its docket. Please go back to the docket page and check the link. If that does not work, go back to the docket and refresh it to pull the newest information.

Your account does not support viewing this document.

You need a Paid Account to view this document. Click here to change your account type.

Your account does not support viewing this document.

Set your membership status to view this document.

With a Docket Alarm membership, you'll get a whole lot more, including:

  • Up-to-date information for this case.
  • Email alerts whenever there is an update.
  • Full text search for other cases.
  • Get email alerts whenever a new case matches your search.

Become a Member

One Moment Please

The filing “” is large (MB) and is being downloaded.

Please refresh this page in a few minutes to see if the filing has been downloaded. The filing will also be emailed to you when the download completes.

Your document is on its way!

If you do not receive the document in five minutes, contact support at support@docketalarm.com.

Sealed Document

We are unable to display this document, it may be under a court ordered seal.

If you have proper credentials to access the file, you may proceed directly to the court's system using your government issued username and password.


Access Government Site

We are redirecting you
to a mobile optimized page.





Document Unreadable or Corrupt

Refresh this Document
Go to the Docket

We are unable to display this document.

Refresh this Document
Go to the Docket