(cid:2)(cid:9)(cid:3)(cid:6)(cid:10)
`(cid:3)(cid:1)(cid:2)(cid:2)(cid:2)(cid:4)
`(cid:1)(cid:5)(cid:8)(cid:6)(cid:4)(cid:3)(cid:7)(cid:10)
`
`Snap's Exhibit No. 1014
`001
`
`

`

`PUBLISHED BY
`Microsoft Press
`
`A Division of Microsoft Corporation
`One Microsoft Way
`Redmond, Washington 98052-6399
`
`Copyright © 1999 by Microsoft Corporation
`
`All rights reserved. No part of the contents of this book may be reproduced or transmitted in any form
`or by any means without the written permission of the publisher.
`
`Library of Congress Cataloging-in-Publication Data
`Microsoft Computer Dictionary. —— 4th ed.
`p. cm.
`
`Previous eds. published under title: Microsoft Press computer
`dictionary
`ISBN 0—7394-0880-1
`
`2. Microcomputers Dictionaries.
`1. Computers Dictionaries.
`1. Microsoft Press computer dictionary.
`QA76.15.M538
`1999
`
`004'.03--dc21
`
`99—20168
`CIP
`
`Printed and bound in the United States of America.
`
`23456789 MLML 432109
`
`Distributed in Canada by Penguin Books Canada Limited.
`
`A CIP catalogue record for this book is available from the British Library.
`
`Microsoft Press books are available through booksellers and distributors worldwide. For further information
`about international editions, contact your local Microsoft Corporation office or contact Microsoft Press
`International directly at fax (425) 9363329. Visit our Web site at mspressmjcrosoftcont
`
`Macintosh, Power Macintosh, QuickTime, and TrueType fonts are registered trademarks of Apple Computer,
`Inc. Kodak is a registered trademark of the Eastman Kodak Compan . Intel is a registered trademark and Indeo
`is a trademark of Intel Corporation. Active Desktop, Active Directory, ActiveMovie, Active Platform, ActiveX,
`Authenticode, BackOffice, Directlnput, DirectX, Microsoft, Microsoft Press, MS—DOS, MSN, NetMeeting,
`NetShow, Visual Basic, Visual C++, Visual J++, WebTV, WebTV Network, Win32. Win32s, Windows,
`Windows NT, and XENIX are either registered trademarks or trademarks of Microsoft Corporation in the
`United States and/or other countries. PANTONE is a registered trademark of Pantone, Inc. Other product and
`company names mentioned herein may be the trademarks of their respective owners.
`
`The example companies, organizations, products, people, and events depicted herein are fictitious. No associa—
`tion with any real company, organization, product, person, or event is intended or should be inferred.
`
`Acquisitions Editor: Christey Bahn
`Project Editor: Kim Fryer
`
`Facebook's Exhibit No .1014
`
`002
`
`Snap's Exhibit No. 1014
`002
`
`

`

`a1iél'dééifeét"transient
`
`.
`
`_
`
`_ ”file fragmentation
`
`First-Name, Address, City, State, Zip—Code, Hire-
`Date, Current—Salary, Title, Department, and so on.
`Individual fields are characterized by their maximum
`length and the type of data (for example, alphabetic,
`numeric, or financial) that can be placed in them. The
`facility for creating these specifications usually is con-
`tained in the data definition language {DDL}. In rela-
`tional database management systems, fields are called
`columns. 2. A space in an on-screen form Where the
`user can enter a specific item of information.
`field-effect transistor :1. See FET.
`
`field-programmable logic array n. An integrated
`circuit containing an array of logic circuits in which
`the connections between the individual circuits, and
`thus the logic functions of the array, can be pro-
`grammed after manufacture, typically at the time of
`installation in the field. Programming can be per-
`formed only once, typically by passing high current
`through fusible links on the chip. Acronym: FPLA.
`Also called PLA, programmable logic array.
`
`field separator a. Any character that separates one
`field of data from another. See also delimiter, field
`(definition 1).
`
`FIFO \fi’fo\ rt. See first in, first out.
`
`fifth-generation computer a. See computer.
`fifth normal form a. Abbreviated SNF. See normal
`form (definition 1).
`
`file a. A complete, named collection of information,
`such as a program, a set of data used by a program, or a
`user-created document. A file is the basic unit of storage
`that enables a computer to distinguish one set of infor—
`mation from another. A file is the “glue" that binds a
`conglomeration of instructions, numbers, words, or
`images into a coherent unit that a user can retrieve,
`change, delete, save, or Send to an output device.
`file allocation table a. A table or list maintained by
`some operating systems to manage disk space used
`for file storage. Files on a disk are stored, as space
`allows, in fixed-size groups of bytes (characters)
`rather than from beginning to end as contiguous
`strings of text or numbers. A single file can thus be
`scattered in pieces over many separate storage areas.
`A file allocation table maps available disk storage
`space so that it can mark flawed segments that should
`not be used and can find and link the pieces of a file.
`In MS-DOS, the file allocation table is conunonly
`known as the FAT. See also FAT file system.
`
`file attribute a. A restrictive label attached to a file
`
`that describes and regulates its use—for example,
`hidden, system, read-only, archive, and so forth. In
`MS—DOS, this information is stored as part of the
`file’s directory entry.
`
`file backup in. Sec backup.
`
`file compression n. The process of reducing the size
`of a file for transmission or storage. See also data
`compression.
`
`file control block a. A small block of memory tempo-
`rarily assigned by a computer‘s operating system to
`hold information about an opened file. A file control
`block typically contains such information as the file‘s
`identification, its location on disk, and a pointer that
`marks the user’s current (or last) position in the file.
`Acronym: FCB.
`
`file conversion n. The process of transforming the
`data in a file from one format to another without al-
`
`tering the data—«for example, converting a file from
`' a word processor’s format to its ASCII equivalent. In
`some cases, information about the data, such as for-
`matting, may be lost. Another, more detailed, type
`of file conversion involves changing character cod-
`ing from one standard to another, as in converting
`EBCDIC characters (which are used primarily with
`mainframe computers) to ASCII characters. See also
`ASCII, EBCDIC.
`
`file extension in. See extension (definition 1).
`file extent a. See extent.
`
`file format a. The structure of a file that defines the
`
`way it is stored and laid out on the screen or in print.
`The format can be fairly simple and common, as are
`files stored as “plain” ASCII text, or it can be quite
`complex and include various types of control instruc-
`tions and codes used by programs, printers, and other
`devices. Examples include RTF (Rich Text Format),
`DCA (Document Content Architecture), PICT, DIF
`{Data Interchange Format), DXF, TIFF (Tagged Im-
`age File Format), and EPSF (Encapsulated PostScript
`Format).
`
`file fragmentation n. l. The breaking apart of files as
`they are stored by the operating system into small,
`separate segments on disk. The condition is a natural
`consequence of enlarging files and saving them on a
`crowded disk that no longer contains contiguous
`blocks of free space large enough to hold them. File
`fragmentation is not an integrity problem, although it
`
`183
`
`Facebook's Exhibit No. 1014
`
`003
`
`Snap's Exhibit No. 1014
`003
`
`

`

`ln'crem e‘rit
`
`in‘d'dtitdfi'
`
`increment1 n. A scalar or unit amount by which the
`value of an object such as a number, a pointer within
`an array, or a screen position designation is in-
`creased. Compare decrement'.
`
`incrementl vb. To increase a number by a given
`amount. For example, if a variable has the value 10
`and is incremented successively by 2, it takes the val-
`ues 12, l4, 16, 18, and so on. Compare decrement}.
`
`incumbent local exchange carrier it. See ILEC.
`
`indent1 n, 1. Displacement of the left or right edge of
`a block of text in relation to the margin or to other
`blocks of text. 2. Displacement of the beginning of
`the first line of a paragraph relative to the other lines
`in the paragraph. Compare hanging indent.
`
`indent2 vb. To displace the left or right edge of a text
`item, such as a block or a line, relative to the margin
`or to another text item.
`
`Indeo rt. A codec technology developed by Intel for
`compressing digital video files. See also codcc. Com—
`pare MPEG.
`
`independent content provider rt. A business or orga-
`nization that supplies information to an online infor-
`mation service, such as America Online, for resale to
`the information service’s customers. See also online
`information service.
`
`independent software vendor rt. A third-party soft—
`ware developer; an individual or an organization
`that independently creates computer software. Acro-
`nym: ISV.
`
`index1 n. 1. A listing of keywords and associated data
`that point to the location of more comprehensive infor-
`mation, such as files and records on a disk or record
`keys in a database. 2. In programming, a scalar value
`that allows direct access into a multi-element data
`
`structure such as an array without the need for a se—
`quential search through the collection of elements. See
`also array, element {definition 1), hash, list.
`
`indexz vb. 1. In data storage and retrieval, to create
`and use a list or table that contains reference infor—
`
`mation pointing to stored data. 2. In a database, to
`find data by using keys such as words or field names
`to locate records. 3. In indexed file storage, to find
`files stored on disk by using an index of file locations
`(addresses). 4. In programming and information pro—
`cessing, to locate information stored in a table by
`adding an offset amount, called the index, to the base
`address of the table.
`
`indexed address n. The location in memory of a par-
`ticular item of data within a collection of items, such
`as an entry in a table. An indexed address is calcu—
`lated by starting with a base address and adding to it
`a value stored in a register called an index register.
`indexed search it. A search for an item of data that
`
`uses an index to reduce the amount of time required.
`
`indexed sequential access method n. A scheme for
`decreasing the time necessary to locate a data record
`within a large database, given a key value that identi-
`ties the record. A smaller index file is used to store
`
`the keys along with pointers that locate the cone
`spending records in the large main database file.
`Given a key, first the index file is searched for the
`key and then the associated pointer is used to access
`the remaining data of the record in the main file. Ac~
`ronym: ISAM.
`
`index hole rt. The small round hole near the large
`round spindle opening at the center of a 5.25-inch
`floppy disk. The index hole marks the location of the
`first data sector, enabling a computer to synchronize
`its readlwrite operations with the disk‘s rotation.
`
`index mark it. 1. A magnetic indicator signal placed
`on a soft—sectored disk during formatting to mark the
`logical start of each track. 2. A visual information
`locator, such as a line, on a microfiche.
`
`indicator n. A dial or light that displays information
`about the status of a device, such as a light con-
`nected to a disk drive that glows when the disk is
`being accessed.
`indirect address a. See relative address.
`
`inductance n. The ability to store energy in the form
`of a magnetic field. Any length of wire has some in-
`ductance, and coiling the wire, especially around a
`ferromagnetic core, increases the inductance. The
`unit of inductance is the henry. Compare capacitance,
`induction.
`
`induction rt The creation of a voltage or current in a
`material by means of electric or magnetic fields, as in
`the secondary winding of a transformer when ex-
`posed to the changing magnetic field caused by an
`alternating current in the primary winding. See also
`impedance. Compare inductance.
`
`inductor n. A component designed to have a specific
`amount of inductance. An inductor passes direct cur~
`rent but impedes alternating current to a degree depen—
`dent on its frequency. An inductor usually consists of a
`
`232
`
`Facebook's Exhibit No. 1014
`
`004
`
`Snap's Exhibit No. 1014
`004
`
`

`

`relational algebra
`
`relative movement
`
`relational algebra n. A collection of rules and opera-
`tors that permit relations (tables) to be manipulated.
`Relational algebra is usually described as having the
`following operators: SELECT, PROJECT. PROD-
`UCT, UNION, INTERSECT, DFFBRENCE, JOIN
`{or lNNER JOIN), and DIVIDE. In a relational data-
`base, relational algebra is used to develop procedures
`to build new relations based on the existing relations.
`
`relational calculus n. In database management, a
`nonprocedural method for manipulating relations
`(tables). There are two families of relational calcu—
`lus: domain calculus and tuple calculus. The two
`families of relational calculus are mathematically
`equivalent to each other and to relational algebra.
`Using either family, one can formulate a description
`of a desired relation, based on the existing relations
`in the database.
`
`relational database it. A database or database man-
`
`agement system that stores information in tables—
`rows and columns of data—and conducts searches by
`using data in specified columns of one table to fmd
`additional data in another table. In a relational data-
`
`base, the rows of a table represent records [collec-
`tions of information about separate items) and the
`columns represent fields (particular attributes of a
`record). In conducting searches, a relational database
`matches information from a field in one table with
`
`information in a corresponding field of another table
`to produce a third table that combines requested data
`from both tables. For example, if one table contains
`the fields EMPLOYEE-1D, LAST-NAME, FIRST-
`NAME, and HIRE-DATE, and another contains the
`fields DEPT, EWLOYEE—ID, and SALARY, a rela~
`tional database can match the EMPLOYEE—D) fields
`in the two tables to find such information as the names
`
`of all employees earning a certain salary or the de—
`paitrnents of all employees hired after a certain date.
`In other words, a relational database uses matching
`values in two tables to relate information in one to
`
`information in the other. Microcomputer database
`products typically are relational databases. Compare
`flat-file database, inverted-list database.
`
`relational database management system it. See rela-
`tional database.
`
`relational expression :1. An expression that uses a
`relational Operator such as “less than” or “greater
`than” to compare two or more expressions. A rela-
`tional expression resolves to a Boolean (truelfalse)
`value. See also Boolean, relational operator.
`
`380
`
`relational model it. A data model in which the data is
`organized in relations (tables). This is the model
`implemented in most modern database management
`systems.
`
`relational operator in. An operator that allows the
`programmer to compare two (or more) values or ex—
`pressions. Typical relational operators are greater
`than (3»), equal to (=), less than (<}, not equal to (es),
`greater than or equal to (>=), and less than or equal
`to (<=). See also relational expression.
`
`relational structure it. The record organization used
`in the implementation of a relational model.
`
`relative address it. A location, as in a computer’s
`memory, that is specified in terms of its distance
`(displacement or offset) from a starting point (base
`address). A relative address is typically computed
`by adding an offset to the base. In everyday terms,
`this is similar to creating the address 2001 Main
`Street, in which the base is the 2000 block of Main
`Street and the offset is I, which specifies the first
`house from the beginning of the block. Also salted
`indirect address.
`
`relative coordinates it. Coordinates that are defined
`
`in terms of their distance from a given starting point,
`rather than from the origin {intersection of two axes).
`For example, from a starting point on the screen, a
`square defined by relative coordinates can be drawn
`as a series of lines, each representing a displacement
`in distance and direction from the end of the preced-
`ing point. The entire square can be redrawn at another
`location simply by changing the coordinates of the
`starting point rather than by recalculating the coordi—
`nates of each corner with reference to the origin. See
`the illustration. Compare absolute coordinates.
`
`Point at relative
`coordinate (2,3)
`/ from the point
`below
`
`.
`
`
`
`x-axis
`
`. — Reference point
`
`\ .
`—/ \y-axis
`Relative coordinates.
`
`
`
` Origin
`
`relative movement
`
`it. 1. Motion whose distance and
`
`direction are relative to a starting point. For example,
`
`Facebook's Exhibit No. 1014
`
`005
`
`Snap's Exhibit No. 1014
`005
`
`

`

`seed?
`
`'-
`
`
`
`'
`
`5
`
`.I
`
`'softnesstries-fins..3
`
`seed is. A starting value used in generating a sequence
`of random or pseudorandom numbers. See also ran-
`dom number generation.
`
`seek it. The process of moving the readlwrite head in
`a disk drive to the proper site, typically for a read or
`write operation.
`
`seek time n. The time required to move a disk drive’s
`readlwrite head to a specific location on a disk. See
`also access time (definition 2).
`
`segment in. A section of a program that, when com-
`piled, occupies a contiguous address space and that is
`usually position independent; that is, it can be loaded
`anywhere in memory. With Intel—based microcomput-
`ers, a native-mode segment is a logical reference to a
`64-KB contiguous portion of RAM in which the indi—
`vidual bytes are accessed by means of an offset value.
`Collectively, the segment:offset values reference a
`single physical location in RAM. See also overlayl
`{definition 1), real mode, segmentation.
`
`segmentation n. The act of breaking up a program
`into several sections. or segments. See also segment.
`
`segmented addressing architecture n. A memory-
`access technique typified by Intel 80x86 processors.
`Memory is divided into fad—KB segments in this at-
`chitecture for addressing locations under the 16-bit
`address scheme; 32-bit schemes can address memory
`in segments as large as 4 GB. Also called segmented
`instruction addressing, segmented memory architec-
`ture. Compare linear addressing architecture.
`
`segmented address space 3:. An address Space that is
`logically divided into chunks called segments. To
`address a given location, a program must specify
`both a segment and an offset within that segment.
`(The offset is a value that references a specific point
`within the segment, based on the beginning of the
`segment.) Because segments may overlap, addresses
`are not unique; there are many logical ways to access
`a given physical location. The Intel 80x86 real-mode
`architecture is segmented; most other microprocessor
`architectures are flat. See also segment. Compare flat
`address space.
`
`segmented instruction addressing :1. See segmented
`addressing architecture.
`
`segmented memory architecture :1. See segmented
`addressing architecture
`
`select vb. 1. In general computer use, to specify a
`block of data or text on screen by highlighting it or
`
`otherwise marking it with the intent of performing
`some operation on it. 2. In database management, to
`choose records according to a specified set of crite-
`ria. See also sort. 3. In information processing, to
`choose from a number of options or alternatives,
`such as subroutines or inputloutput channels.
`selected cell it. See active cell.
`
`selection :1. 1. In applications, the highlighted portion
`of an on-screen document. 2. In communications, the
`initial contact made between a computer and a remote
`station receiving a message. 3. In programming, a con—
`ditional branch. See also conditional branch.
`
`selective calling it. The capability of a station on a
`communications line to designate the station that is
`to receive a transmission.
`
`selector channel it. An inputloutput data transfer line
`used by one high—speed device at a time.
`
`selector pen in. See light pen.
`
`self—adapting adj. The ability of systems, devices, or
`processes to adjust their operational behavior to envi-
`ronmental conditions.
`
`self-checking digit n. A digit, appended to a number
`during its encoding, whose function is to confirm
`the accuracy of the encoding. See also checksum,
`parity bit.
`
`self-clocking n. A process in which timing signals are
`inserted into a data stream rather than being provided
`by an external source, such as in phase encoding.
`
`self-documenting code :1. Program source code that,
`through its use of a high-level language and descrip—
`tive identifiers, can be understood by other program—
`mers without the need for additional comments.
`
`self-extracting archive it. See self-extracting file.
`
`self-extracting file n. An executable program file that
`contains one or more compressed text or data files.
`When a user runs the program, it uncompresses the
`compressed files and stores them on the user’s hard
`drive. See the illustration.
`
`self-modifying code :1. Program code, usually object
`code generated by a compiler or assembler, that
`modifies itself during instruction by writing new op-
`eration codes, addresses, or data values over existing
`instructions. See also pure procedure.
`
`self-monitoring analysis and reporting technology
`system it. See SMART system.
`
`self-organizing map n. See SOM (definition 2).
`
`401
`
`Facebook's Exhibit No. 1014
`
`006
`
`Snap's Exhibit No. 1014
`006
`
`

`

`
`" {71' {Sfisssdbét iihdéhfifiilloduié' "as?
`
`structured query language a. A database sublanguage
`used in querying, updating, and managing relational
`databases—the de facto standard for database prod-
`ucts. Acronym: SQL.
`
`structured walkthrough n. 1. A meeting of program»
`mers working on different aspects of a software de—
`velopment project, in which the programmers
`attempt to coordinate the various segments of the
`overall project. The goals, requirements, and compo—
`nents of the project are systematically reviewed in
`order to minimize the error rate of the software under
`
`development. 2. A method for examining a computer
`system, including its design and implementation, in a
`systematic fashion.
`
`S'I‘T it. See Secure Transaction Technology.
`stub n. A routine that contains no executable code and
`
`that generally consists of comments describing what
`will eventually be there; it is used as a placeholder
`for a routine to be written later. Also called dummy
`routine. See also top-down programming.
`
`Stufflt n. A file compression program originally writ-
`ten for the Macintosh, used for storing a file on one
`or more disks. Originally shareware, Stufflt is now a
`commercial product for Macs and PCs that supports
`multiple compression techniques and allows file
`viewing. Stufi'lt files can be uncompressed using a
`freeware program, Stuffit Expander.
`
`style sheet n. 1. A file of instructions used to apply
`character, paragraph, and page layout formats in
`word processing and desktop publishing. 2. A text
`file containing code to apply semantics such as page
`layout specifications to an HTML document. See
`also HTML document, semantics (definition 1).
`
`stylus n. A pointing device used with a graphics tab-
`let, usually attached to the tablet with a cord. Also
`called pen. See also graphics tablet, puck.
`
`subclass n. A class in object—oriented programming
`that is derived from, and inherits its attributes and
`methods from, another class known as a superclass.
`Compare superclass.
`subcommand n. A command in a submenu (a menu
`that appears when a user selects an option in a
`higher-level menu).
`'
`
`subdirectory o. A directory (logical grouping of re-
`lated files) within another directory.
`
`subdomain n. A domain, often representing an ad-
`ministrative or other organizational subgroup within
`a second—level domain. See also domain.
`
`subject drift is. See topic drift.
`
`subject tree :1. A type of World Wide Web index that
`is organized by subject categories, many of which are
`broken down into subcategories, or “branches." The
`lowest level of the tree consists of links to specific
`Web pages. An example of a World Wide Web sub-
`ject tree is Yahoo! See also YahooL
`
`submarining n. A phenomenon that occurs when
`some part of a screen display moves more quickly
`than the screen can show. The object (such as the
`mouse pointer) disappears from the screen and reap-
`pears where it comes to rest, just as a submarine re-
`surfaces after a dive. Submarining is especially a
`problem with the slowly responding passive—matrix
`LCD displays on many laptop computers.
`
`submenu n. A menu that appears as the result of the
`selection of an item on another, higher-level menu.
`
`subnet n. 1. In general, a network that forms part of a
`larger network. 2. In terms of the ISOIOSI reference
`model, the subnet comprises the layers below the
`transport layer—that is, the network, data link, and
`physical layers.
`subnet mask a. See address mask.
`
`subnetwork n. A network that is part of another,
`larger network.
`
`subnotehook computer it. A portable computer that
`is smaller and lighter than a conventional laptop
`computer.
`
`subportable It. See suhnotebook computer.
`
`subprogram o. A term used in some languages for
`routine (procedure or function) because the structure
`and syntax of a subprogram closely model those of a
`program. See also program, routine.
`
`subroutine n. A common term for routine, likely to be
`used in reference to shorter, general, frequently
`called routines. See also procedure, routine.
`subschema rt. The definition of a user view of the
`
`database (in CODASYLIDBTG systems only},
`roughly equivalent to the external schema of an
`ANSUXZ’JSPARC database management system or to
`a view in a relational database management system.
`See also schema.
`
`subscribe vb. 1. To add a newsgroup to the list of
`such groups from which a user receives all new ar—
`ticles. 2. To add a name to a LISTSERV distribution
`list. See also LISTSERV.
`
`Subscriber Indentity Module card a. See SIM card.
`
`426
`
`Facebook's Exhibit No. 1014
`
`007
`
`Snap's Exhibit No. 1014
`007
`
`