Abstract: A method for simulating the drilling performance of a roller cone bit drilling an earth formation may be used to generate a visual representation of drilling, to design roller cone drill bits, and to optimize the drilling performance of a roller cone bit. The method for generating a visual representation of a roller cone bit drilling earth formations includes selecting bit design parameters, selecting drilling parameters, and selecting an earth formation to be drilled. The method further includes calculating, from the bit design parameters, drilling parameters and earth formation, parameters of a crater formed when one of a plurality of cutting elements contacts the earth formation. The method further includes calculating a bottomhole geometry, wherein the crater is removed from a bottomhole surface.

Abstract: The nuclear receptor for the steroid hormone 1&agr;,25-dihydroxyvitamin D3, its ligand binding domain, three-dimensional model thereof and a method for selection of suitable vitamin D3 binding to the 1&agr;,25-dihydroxyvitamin D3 receptor. A three-dimensional model for residues 142-427 of the ligand binding domain of the human nuclear receptor for 1&agr;,25-dihydroxyvitamin D3 used to identify the interaction of the conformationally flexible natural hormone 1&agr;,25(OH)2D3 and a number of related analogs with the receptor ligand binding domain. A method for identification and generation of new potential analog drug forms of dihydroxyvitamin D3.

Abstract: In a data processing system implementing Dynamic Object Code Translation (DOCT) for emulating Target system instructions on a Host system, each Target system instruction has an associated index/offset field and an associated code tag that identifies whether the Target instruction has been translated into Host code, and if already translated, whether it is an entry point, middle, or last instruction in a block of code. When an emulator encounters a code tag indicating an entry point into a block of code, execution control is transferred to the corresponding Host code. Upon completion of the Host code block, execution control is returned to the emulator, with an indication of the next Target system instruction to execute. One code tag value is utilized to identify self-modified code. Another code tag value is utilized to indicate how often untranslated Target instructions have been interpreted in order to determine when to perform DOCT.

Abstract: If a context process range extending unit cannot obtain context information required by a context processing unit, from a range to be translated, it extends the context process range. Then, the context processing unit performs a context process, and passes extracted context information to a translation processing unit in order to perform translation, based on the extended context process range.

Abstract: Data is transmitted using multiple description vector quantization by first quantizing the source vector at a lattice vector quantizer. After quantization, a labeling function is applied to the quantized source vector, creating a plurality of data streams. Each data stream is encoded and transmitted over a separate channel. Furthermore, the encoded data is decoded by first retrieving a representation of a sublattice point from a set of sublattice points from the data stream and then, determining a single data code word being associated with the retrieved representation of the sublattice point.

Abstract: The reception terminal receives a code series from the communication path. The separator separates the code series into a speech code series and text information. The speech code series is decoded into a pitch period, a LSP coefficient, and code numerals by the synthesizer to reproduce the speech sound in the CELP system. Also, the text information is converted into pronunciation and accent information by the language analyzer and added to prosody information, such as phoneme time length and pitch pattern by the prosody generator. The LSP coefficient, and code numerals suitable for the phoneme are read from the segment database and the pitch frequency from the prosody information is inputted to the synthesizer and synthesized into speech sound.

Abstract: A method, system and product for modifying the dynamic range of an encoded audio signal. The method includes receiving the encoded audio signal, the encoded audio signal having a first set of scale factors associated with a first dynamic range, and identifying a playback destination for the encoded audio signal, the playback destination having a second dynamic range. The method also includes mapping the first set of scale factors to a second set of scale factors associated with the second dynamic range, and replacing the first set of scale factors in the encoded audio signal with the second set of scale factors to create a modified encoded audio signal for decoding and reassembly at the playback destination. The system includes control logic for performing the method. The product includes a storage medium having computer readable programmed instructions for performing the method.

Abstract: A method for establishing certifiable patient informed consent for a medical procedure, where, in one embodiment, the patient interacts with a video training system until mastery of all required information is successfully achieved. Training techniques which permit elicitation of measurable behaviors from a patient as a guide to discerning the level of knowledge of the patient are utilized. Certification is only granted when the measurable behavior approximately coincide with the legal and medical standards for establishing informed consent. The system is capable of adapting to various medical procedures, as well as various patient attitudes and knowledge bases, while still maintaining a level of consistency throughout. In one embodiment, a minimum probability of understanding may be preset, and the training procedure will continue until the actual statistical probability of understanding is at least equal to the preset minimum.

Abstract: An Order Based Materials Management (OBMM) method using forecasts of actual customer orders to determine component stocking levels. There may be several types of orders and several types of customer demand forecasts for them. Each order type is specified by a variable Bill Of Materials called an “order profile”—a multivariate probability distribution with each random variable representing the uncertain number of units of a component or subassembly that may be needed to build a customer order of that type. The profile of an order type is represented by a multivariate probability distribution of all components/subassemblies that may be needed for an order of that type, including the correlation between the numbers of units of different components needed for an order in the analysis.

Abstract: A method for customer promotion includes sequentially receiving signals indicative of respective bar codes of a plurality of items in a customer order. The price of each item is accumulated. A marginal discount associated with each item processed is generated. This marginal discount is generated in response to a signal that indicates the accumulated price exceeds a predetermined threshold. Unapplied marginal discounts are accumulated for application to the customer order. A discount is applied to the customer order in response to a signal that is generated that indicates the accumulated discounts exceeds a predetermined minimum.

Abstract: A method is disclosed for providing management of taxable events. The disclosed method includes determining a proceeds and tax consequence that would result from trading each of various combinations of a plurality of assets/liabilities. The disclosed method further includes displaying the proceeds and tax consequence from each potential trade in a computer-generated graph of at least two dimensions.

Abstract: At least one storage unit is used for storing software which is divided into a plurality of software components. At least one CPU controls hardware components of an image processing apparatus by running the plurality of software components cooperatively. Each software component of the plurality of software components has a charging function such that a charge for the software component is cumulatively increased each time the software component is run.

Abstract: Inferring statistical models for performing code compression is disclosed. The system reads a set of training data comprising representative code. Tokens from the training data along with context data known when the token is read is saved to a predictor table. The context data comprises potential predictors for the token. When all training data has been read, a decision tree is created which partitions input code into streams that can be compressed based on the frequency distributions present in the decision tree. The decision tree can be used by a modeler component of a code compression system.

Abstract: Model checking for message sequence charts (MSCs), message sequence chart graphs and hierarchical message sequence chart graphs (HMSCs) is provided. To verify the behavior of a given MSC, MSC graph and HMSC, a specification automaton is constructed. This specification automaton specifies the undesirable executions of the model under analysis. From the model under analysis, linearizations are defined from the model and a finite test automaton is constructed from the linearizations. The test automaton and the specification automaton are combined and it is determined whether there is an execution in the intersection. Where no state in the specification automaton is reachable from the test automaton, the model is verified.

Abstract: A multi-dimensional Gaussian distribution generating portion obtains one vector from a multi-dimensional Gaussian probability distribution and outputs it as an initial momentum. An approximated energy function differential generating portion generates a gradient of an approximated energy function. A Hamilton equation integral portion integrates a Hamilton equation using a gradient of an approximated energy function for a predetermined integral period with initial conditions of an initial state and an initial momentum. The result of the integration as the state of the next alternative is output from a next alternative generating apparatus. The state is used with a high probability corresponding to the difference of approximated energy calculated by an approximated energy difference calculating portion and the difference between a value of an original energy in the present state and that in the next state.

Abstract: A method and apparatus is provided for producing a general data extraction procedure capable of extracting data from data sources on a network regardless of data format. The general data extraction procedure is determined from a plurality of pairs of data from the network, each pair including a data source and a program which accurately extracts data from the data source. The pairs of data are processed by a learning system to learn a general program for extracting data from new data sources.

Abstract: A method of evolving a neural network that includes a plurality of processing elements interconnected by a plurality of weighted connections includes the step of obtaining a definition for the neural network by evolving a plurality of weights for the plurality of weighted connections, and evolving a plurality of activation function parameters associated with the plurality of processing elements. Another step of the method includes determining whether the definition for the neural network may be simplified based upon at least one activation function parameter of the plurality of activation function parameters. Yet another step of the method includes updating the definition for the neural network in response to determining that the definition for the neural network may be simplified. The method utilizes particle swarm optimization techniques to evolve the plurality of weights and the plurality of activation parameters.

Abstract: A small-footprint relational database system providing a deterministic join enumeration methodology for left-deep processing trees is described. By providing a deterministic branch-and-bound join enumeration method for left-deep processing trees, the invention is able to efficiently optimize complex queries with high join degree by employing a novel approach to cost-based pruning of the search space. For each subquery, plan generation involves the following four distinct steps. First, the system adjusts predicate selectivities to account for disjuncts, Between predicates, and user estimates of selectivities. Next, the system constructs a join graph for the query that models inner and outer equijoin predicates, sargable single-variable predicates on single quantifiers, and Cartesian products. The system then enumerates join strategies and prune the search space using a branch-and-bound heuristic. Finally, the system recalls the cheapest strategy and constructs the detailed access plan for that strategy.

Abstract: This invention pertains to a method for finding a web page based on telephone numbers with a feature of utilizing the finding method to build traffic to view advertisements. Pursuant to the method, there is established a web page server; a directory database comprised of registrant telephone numbers, registrant criteria and registrant web site pages and an advertising database comprised of advertiser criteria and advertising objects. An Internet user specifies a telephone number and is shown a registrant web site page and an advertising object for an advertiser whose criteria correlates with the criteria for the registrant whose page is being sent to the Internet user.

Abstract: A computer program product is provided as a system for use with a search engine and a search engine repository to dynamically associate keywords within a search result set encountered in an abstract of a search result item with a domain-specific query. In the system, a local query database stores the domain-specific query, and a synchronization unit synchronizes the search engine repository and the local query database. A query builder builds a search query from a query template using the search engine repository. A summary marker incorporates the search query with the keyword in the abstract of the search result item. A keyword detector generates a list of keywords included in a domain-specific dictionary. A search result calibration manager calibrates the number of the query result items. A search result item buffer receives a request for processing an abstract metadata item from the synchronization unit.

Abstract: A method optimizes a system. Performances of a plurality of design parameters of an objective function modeling the system are represented in a search space. A set of vertices are positioned in the search space, and each vertex has an associated performance. The model also includes a plurality of constraints. The constraints and the objective function are grouped according to a plurality of unique hierarchical levels. The group including the objective function has a highest level. The performance of a particular vertex is evaluated, in a low to high order of the levels, according to the groupings of the constraints and the objective function. The evaluated performance and the associated level is assigned to the particular vertex as soon as the evaluated performance is negative, unless the associated level is the highest level, in which case the assigned performance is evaluated from the objective function to partition the search space into a plurality of partitions according to the levels.

Abstract: An information synchronization method and apparatus stores a change log having an associated change counter at a first database, updates the change counter at the first database in response to a database update command from a second database, and returns the updated change counter to the second database in response to a processing condition resulting from the database update command at the first database. The information synchronization protocol ensures that the second database maintains the most current change counter for use in a subsequent synchronization procedure and in the event that an interruption or error occurs, thereby increasing the efficiency of information synchronization by enabling the second database to process only those changes of the first database occurring after the updated change counter.

Abstract: A method for controlling access to information, which includes a plurality of data objects, on a computer system being accessible to a plurality of users is provided which generally comprises providing an access right for each relationship between a user and a data object, wherein each user can have a plurality of relationships to each data object, determining each relationship between the user and the data object when a user requests information about a data object, determining the security classification for each relationship between the user and the data object, and then granting the user access to the data object if one of the security classifications for all the relationships is equal to or greater than the security classification of the data object, and denying the user access to the data object if the security classifications for all the relationships is less than the security classification of the data object.

Abstract: The present invention discloses a centralized certificate management system for thin client devices in data networks and has particular applications to systems having a large number of the thin clients serviced by a proxy server through which the thin clients communicate with a plurality of secure server computers over a data network. According to one aspect, the present invention comprises a certificate management module that causes the server device to manage digital certificates for each of the thin client devices. To minimize the latency of obtaining certificates for each of the thin client devices, the certificate management module reserves a fixed number of free certificates signed by a certificate authority and their respective private keys in a certificate database and frequently updates the free certificate according to a certificate updating message.

Abstract: One embodiment of the present invention provides a system that facilitates compartmentalized user management in a database system. This database system is compartmentalized into a plurality of domains that are insulated from each other, so that a given user who has access to data within an associated domain does not have access to data in other domains. Upon receiving a request from a database administrator to perform an operation on a user within the database system, the system identifies a domain that the user is associated with in the database system. Next, the system determines whether the database administrator is authorized to modify users associated with the domain. If so, the system performs the operation by modifying an entry for the user within a user table in the database system that contains an entry for each user of the database system.

Abstract: A management system for software data in a system in which software data that is transmitted from a management center through a predetermined transmitting system can be used at a terminal. The management center transmits the software data and regulation data to regulate a use style of the software data. The terminal regulates the use of the software data on the basis of the regulation data.

Abstract: A device for parallel processing of subtrees within a binary tree for searching for the tree leaf matching a search key. The search is performed at each node by applying a recursive function associated with each node and whose parameters depend on the node for determining which branch, left or right, is to be taken in accordance with the search key. The device includes subtree register blocks for storing the recursive functions, processors for processing the recursive functions, a control unit that assigns one processor to the processing of the recursive functions contained in a block that sent the request to the control unit, and means for selecting subtrees included in the sequence of branches between the root and the leaf defined in accordance with the search key in response to the processing of blocks.

Abstract: A memory for access by a program being executed by a programmable control device includes a data access structure stored in the memory, the data access structure including a first and a second index structure (each having a plurality of entries) together forming a tiered index. At least one entry in the first structure indicates an entry in the second structure. The number of entries in the second structure being dynamically changeable. A method for building a tiered index structure includes building a first-level index structure having a predetermined number of entries, building a second-level index structure having a dynamic number of entries, and establishing a link between an entry in the first-level index structure and an entry in the second-level index structure.

Abstract: A method for use with a processor which automatically creates hyperlinks between references to records in a record set which appear in a second record and the records in the record set, the method for eliminating ambiguity when record references overlap and including steps whereby resolution rules are applied which recognize references to a subset of records which are referenced by overlapping references and also a method for recognizing specific record information as a particular type and inserting tags which can be used by certain applications to identify the specific information within the record.

Abstract: A methodology is provided for encoding mobile process calculi in XML. Mobile process calculi (e.g., &pgr;-calculus, Join Calculus, Blue Calculus) are often employed in modeling business processes. The present method provides for encoding a mobile process algebra in XML by providing a mobile process algebra, reducing the process algebra to infix notation, transforming the mobile process algebra from infix notation to prefix notation, and then transforming the prefix notation to a set of tags via structural induction. Annotating tags can then be provided around the basic process algebra constructors. The set of tags represent an XML schema. The XML schema can then be reduced to a programming language. An example of reducing a specific algebra (combinators—a derivative of &pgr;-calculus) to an XML schema is provided. The XML schema is reduced to a programming language ideal for business workflow processes.

Abstract: A telecom karaoke system is configured by linking a musical data receiving terminal for receiving from a host base station necessary data for musical performance and a WWW page access terminal for accessing a page or a document on WWW via a WWW server. In this configuration, the musical data receiving terminal sequentially transmits to the WWW page access terminal the addresses of pages on WWW, superposed on the musical data. Further, the WWW page access terminal, when a musical number is selected, notifies the information on music selection to the data receiving terminal and, at the same time, updates data related to the musical number (a list of the number of accesses and the like) on the WWW server.

Abstract: A method and a system for providing remote access to scanner utilization or diagnostic imaging reports generated by a computer system having access to a database of collected scanner operational data. Preferably, the reports are delivered over a wide-area network, e.g. the Internet, in response to requests for access from customers. In particular, the system includes a graphical user interface which allows the user to specify all of the report content parameters and display the report on a single screen. The report content parameters section of the screen allows the user to identify the facility, organization area (i.e., department), equipment, time dimension, time frame, metrics and data slices that the user wants included in the report. The report produced will contain the information currently in the database, which information is updated daily.

Abstract: An improved system, method and database program is provided for automatically creating a replica of data distributed throughout a database onto a replica server. The method identifies an action to be performed on the data and/or a subset of objects of the data for receiving the action. A scope of the distributed database is determined, including a root of the database for accessing all of the data. With this information, a vector is created and provided to the root. As a result, the root can recursively inherit the vector down the distributed database to one or more branches until all of the data is accessed, so that the action can be performed on all the data.

Abstract: An improved system and method of automating the integration of different Energy Management Systems (EMS) electrical power grid databases into a single power grid database. This method imports proprietary EMS raw data from various vendors' formats into a Common Information Model (CIM) with specific connectivity extensions and produces an electrically connected power systems database that can be viewed or edited. Direct network topology conversion from one EMS vendor data format to another is also supported. Two generated databases can then be selectively integrated and maintained to produce a fully populated network topology without disclosing EMS vendor specific proprietary information. The new, possibly larger, database can then be added to yet another database that is similarly processed.

Abstract: A system, method, and processor readable medium containing code for causing a processor to synchronize a secondary database system, such as one stored on a palmtop electronic device, with a distributed database system, comprising a main database and at least one replica database. The system further comprises a modification module that contains entries for modifications that have been made to the secondary database since a previous synchronization between the secondary database and the distributed database system and a synchronization module that synchronizes the secondary database with one of the databases of the distributed database system using the modification module. Each database in the distributed database system stores an identification mapping database having an assigned version number.

Abstract: A digitized document circulating system includes a unit provided in a transmission source of a digitized document and for sending the digitized document, a unit for delivering the digitized document to a transmission destination to thereby circulate the digitized document, a unit provided in the transmission destination and for receiving the digitized document, a unit operated by the delivery unit and for obtaining a circulation history containing delivery time, an identifier of the digitized document, the transmission source and the transmission destination, a unit for reading the circulation history and transferring the circulation history to a requester in response to a request for the circulation history issued from the requester, and a unit for displaying the circulation history received.

Abstract: A method, system, signal, and software program for handling search through the use of a page index. Searches are performed across a plurality of content information sources and content types. For every search that returns unique search results, the page index is updated to include links to those pages. Accessing the same page multiple times does not cause multiple entries in the page index, and no search results nor page index entries are deleted as a result of additional searches performed.

Abstract: Counting the number of set bits in an n-bit data word in a data processing system. The process involves generating at least p1 intermediate n-bit words, where 1<p1<n, by masking and shifting the data word such that each intermediate word has n/p1p1-bit fields and n of the fields of the intermediate words represent the values of respective bits of the data word. The intermediate words are then summed to generate an n-bit derivative word having n/p1p1-bit fields whereby each field of the derivative word represents the sum of a respective group of bits of the data word. The fields of the derivative word can then be summed in various ways by performing shift, add and mask operations on the derivative word. The resulting sum value represents the number of set bits in the data word.

Abstract: A microprocessor and digital signal processor (DSP) are provided. In one embodiment, the microprocessor includes a cache memory and an arithmetic and logic unit that contains at least one of an adder and a multiplier. In another embodiment, the DSP includes a signal input, a signal output and a signal transformation unit containing at least one of an adder and a multiplier. In each embodiment, the at least one includes: (1) a circuit for deriving a carry out bit from a carry in bit and first and second addend and augend bits that includes first, second and third threshold logic gates that generate intermediate bits based on threshold comparisons of concatenations of said carry in bit and said first and second addend and augend bits, and (2) combinatorial boolean logic that generates said carry out bit from said intermediate bits.

Abstract: The floating point number data processing means is for use in microprocessor systems and finds application in AC motor drive technology. The format used includes a sign bit, a seven bit signed exponent and an eight bit mantissa. The mathematical functions are performed in a gate array using registers which are mapped into a memory of the microprocessor system, the particular mathematical function being dependent upon a particular choice of registers. An unsigned integer comparison of floating point numbers is used to give a correct result.

Abstract: A sticky bit value of the product of mantissas X and Y is predicted by a circuit that comprises a bit pattern generation circuit 25A that generates a bit pattern B, based on a trailing zero bit pattern of the multiplier Y, having all values of the sticky bit S corresponding to any number C of the trailing 0s of the multiplicand X; a priority encoder 21 for providing the number C depending on X; and a sticky bit selection circuit 26A for selecting one bit in the bit pattern B as a value of the sticky bit S depending on the value C.

Abstract: In the circuit arrangement, combinatorial blocks are arranged between an input register (RG1) and an output register (RG2). The output of the input register (before the combinatorial blocks (KBL)) is connected to an analysis unit (ANA) that analyzes the value (EW) of the output of the input register (RG1) and send an enable signal (EN) to the output register (RG2) (after the combinatorial blocks) when the output value (AW) of the combinatorial blocks (KBL) must be present after the value (EW) of the output of the input register (RG1). The transit time required for an operation in the circuit arrangement can thus be shortened given certain value combinations.

Abstract: An incrementer/decrementer architecture having a reduced internal block fanout which is achieved efficiently in terms of the silicon area needed to implement the incrementer/decrementer. The incrementer/decrementer of the present invention is characterized by a modified tree structure having operators located in such a manner that the maximum internal block fanout is equal to (incrementer/decrementer width)/8 for incrementer/decrementers having a width of at least 16 bits. For incrementer/decrementers having a width of less than 16 bits, the internal block fanout is 2. The routing complexity is increased in order to implement redundant overlapping operations which, in turn, decreases the internal block fanout. However, increases in routing complexity can be accomplished within the minimum X-by-Y area of each stage of the incrementer/decrementer. Therefore, the overall performance of the incrementer/decrementer of the present invention can be optimized while meeting minimum area requirements.

Abstract: A method, system, and computer program product code using a two-tiered cache for hierarchically structured data. The present invention significantly reduces the frequency of computationally intense processing used to retrieve hierarchically structured data and reduces the system cache storage requirements for maintaining coalesced images.

Abstract: A search engine utilizes a bottom-up approach to index the content of a network instead of relying on atop-down approach as used by conventional search engines. The network being indexed may be any network, including the global computer network, Internet, and the world wide web. Instead of using a central site including spidering software to recursively search all linked web pages and generate a search index of the Internet, independent distributed components or agents are located at each web site and report meta data about objects at the web site to the central server. A central catalog of object references is compiled on the central site from the meta data reported from each web site. One or more brochures file may also be created and stored on each web site to provide conceptual or non-keyword data about the site, such as demographics and categorization information.

Abstract: A technique for implementing in a networked client-server environment, e.g., the Internet, network-distributed advertising in which advertisements are downloaded, from an advertising server to a browser executing at a client computer, in a manner transparent to a user situated at the browser, subsequently displayed, by that browser and on an interstitial basis, in response to a click-stream generated by the user to move from one web page to the next. Specifically, an HTML advertising tag is embedded into a referring web page. This tag contains two components. One component effectively downloads, from an distribution web server and to an extent necessary, and then persistently instantiates an agent at the client browser. The other component is a reference, in terms of a web address, of the advertising management system. The ad management system selects the given advertisement that is to be downloaded, rather than having that selection or its content being embedded in the web content page.

Abstract: A high performance client/server editor and method for editing documents with improved performance. A server listening for editing requests from a client to edit a file located with the server spawns a thread for each editing request to handle that particular request. A client receiving input commands from a user for editing requests spawns a thread for each editing request received, enabling more than one editing request to be processed simultaneously. When an edit feature is invoked, the client sends a request to the server to download the file. While the file is downloading from the server to the client location, the client displays the first page of the file to the user to enable the user to start editing the file before the entire file is downloaded. The client handles the user's edit commands for portions of the file downloaded.

Abstract: An Internet-enabled subscription teaching service system has an Internet-connected lecture server executing a software suite, one or more teacher-author stations coupled to the Internet-connected lecture server, having input and display apparatus, and including lecture-authoring software, and one or more Internet-capable lecture client stations having lecture-participation software. Teacher-authors use the teacher-author stations to prepare lectures through the lecture-authoring software, the lecture server stores prepared lectures and provides lectures on a pre-determined schedule to lecture clients at the lecture client stations, and the lecture clients follow the provided lectures at the lecture client stations through the lecture-participation software. Some lectures are fully automatic, and some are directed by the teacher-authors in real time. In the real time case recipients are directed to WEB pages in unison, and annotation and commentary is provided by the teacher-author as pages are visited.

Abstract: A system for providing scheduled messages to a remote user in a batch oriented system. In a preferred embodiment of the present invention, a user creates and/or reads electronic mail locally. While the user creates the electronic mail, a message is displayed to the user on a portion of the local monitor, the message preferably changing in accordance with a local display schedule and stored on a local storage device. The message is preferably targeted to the particular user. When the user is ready to transmit the e-mail created and/or receive e-mail addressed to him, the user's local client establishes a connection via a modem with a remote e-mail server system. The remote e-mail server system not only receives the e-mail transmitted by the user and/or transmits e-mail addressed to the user, but also updates the user's local messages in accordance with a distribution schedule.

Abstract: A method and apparatus for extending the main memory of computer systems across network boundaries is provided. A memory server is allocated on a network server, or a separate machine connected to a network to enable client computers on the network to extend their main memory on demand for user applications. Through the utilization of the memory server, the client workstations can execute programs requiring more memory than is resident on the client without decreasing the efficiency of the network server.