CA1337132C - Reception system for an interactive computer network and method of operation - Google Patents

Abstract

A method for operating a computer network that provides a very large number of simultaneous users access to large numbers of applications having text and graphic information, the network including one or more host computers, a plurality of distribution computers connected in groups of one of more to each of the host computers, and a plurality of reception system computers each having a display screen, the reception system being connected in groups of one or more to each of the distribution computers, the method comprising the steps of: organizing the application information into objects; distributing selected objects in accordance with a predetermined plan to the host computers, the distribution computers and the reception system computers; and supplying objects to a reception system computer requesting an application so that the requesting reception system computer can selectively combine the objects which make up a requested application by collecting objects as required from the host computers, the distribution computers, and the requesting reception system computer so that the requested application may be displayed at the reception system computer display screen based on the objects collected.

Description

~ ~3~7132 ,: , RECEPTION SYSTEM FOR AN INTERACTIVE COMPUTER NE~WOR~
AND METHOD OF OPERATION

_ BACXGROUND OF T~E INVENTION
This invention relates generally to a distributed processing, interactive computer network intended to provide very large numbers of simultaneous users; e.g. millionJ, with access to a large number; e.g., thousands, of applications which include pre-created, interactive text/graphic sessions; and more particularly, to a computer network in which the interactive text/graphic sessions are comprised of pre-created blocks of data and program instructions which may be distributed downwardly in the network for use at a ~oftware enhanced user computer terminal that reduce~
processing demand on the higher-level network elements, thus permitting the higher-level elements to function primarily as data supply and maintenance resource, and, thereby, reduce network complexity, cost and response time.
Interactive computer networks are not new. Traditionally they have included conventional, hierarchical architectures wherein a central, host computer responds to the information requests of multiple users. An illustrative example would be a time-sharing network in which multiple users, each at a remote terminal, log onto a host computer having data and software resource that sequentially receives the user's data processing reque~ts, executes them and supplie~ responses back to the users.
While such networks have made the processing power of large computers available to many user~, problems have existed with them. Particularly, in such networks, the host has been required to satisfy all the user data processing requests. As a result, processing bottle-necks ari~e at the host that tax the host resources cau~ing slowdown~ in network re~ponse time and requiring expansion in computing power; i.e., bigger and more complex computer -facilities, where acceptable response times are ~ought to be maintained in the face of increases in the number of users to be served.
The size and complexity of the network host, however, is particularly critical in the case of commercial interactive computer network recently introduced to offer large number of the general public text and graphics information that enable not only at home shopping and financial management such as banking and bill paying, but also the providing of information relating to entertainment, business and personal matters.
As can be appreciated, in such state of the art information and ~hopping networks, the network must be able to provide the information and Rhopping ~ervices with a minimal amount of network re~ources in order to maintain the capital investment in the network at a le-~el that renders the services economical to use. Unlike military and governmental networks where, because of the nature of the service provided, capital investment is a secondary concern, in commercial information and shopping services, the capital investment in the network resources mu~t be kept low in order to make the network affordable both to the users and tho~e who would rely on the network as a channel of distribution for their good~ and/or services.
Further, in addition, to maintaining capital investment at a m;ni~.lm, it is also desirable to maintain network response time at a mini m in order to not only capture and hold the user's attention, but also quickly free the network to satisfy the requests of other users. As noted, this ability to ~atisfy _`~ 1 337 1 32 requests with minimal network resources lS required to enable the network to serve large numbers of users and, thereby, render the network economical.
While conventional, previously known time-sharing network designs have attempted to alleviate host complexity and response time problems by providing some processing at the user site; i.e., "smart terminals", still the storage of the principal data and software resources needed for processing at the host continues to create a burden on network complexity and response time which renders the conventional approach unsuited for the large numbers of users required for a commercially viable computer based information and shopping network.

SUMMARY OF INVENTION
Accordingly, it is an object of an aspect of this invention to provide method and apparatus which permit a very large number of users to obtain access to a large number of applications which include interactive text/graphic sessions that have been created to enable the users to obtain information and transactional services.
It is a further object of an aspect of this invention to provide method and apparatus which permit the data and programs necessary to support applications including interactive text/graphic sessions to be distributed over a computer network.
It is a still further object of an aspect of this invention to provide software that will enable a conventional personal computer to be coupled to a computer network to establish a reception system suitable for supporting applications which include interactive text/graphic sessions created to enable the user to obtain information and conduct shopping events.
It is yet another object of an aspect of this invention to provide method and apparatus that would permit information and transactional services to be provided to users based upon predetermined parameters such as user demographics and/or locale.
It is yet another object of an aspect of the invention to provide method and apparatus capable of collecting data regarding usage of the network and to condition the applications and the included text,/graphics sessions based upon the reactions to the applications by the users.
Briefly, to achieve the above and other objects and features, the invention includes method and apparatus for providing interactive applications containing text and graphics at the monitor of a personal computer, that has been configured as a reception system by the inclusion and running of reception system software that enables the reception system so formed to be electronically connected to a network specially adapted to create, maintain and supply databases and portions thereof containing the applications. In accordance with its method aspects, the invention includes procedures for formulating objects that have been specially structured to include display data, control data and program instructions for supporting the applications at the network reception systems, the objects being pre-created, parcelled units of information that may be distributed and stored at lower levels in the network;
e.g., at the reception system, so as to reduce processing demand on the network higher element, and thereby permit the higher elements to function primarily as elements for maintaining and supplying the database information.
Further, in preferred form, the method aspect of the invention, features use, of specially structured messages that harmonize and facilitate communications between the different elements of the network and computing elements external to the network that may be called upon to supply information to support the applications.
Also in preferred form, the method aspect of the invention features specially prepared program instructions within the objects that permit the objects to be executed at the reception system in conjunction with the application software.

~.,~ ., Also in preferred form, the invention includes procedures in the form of application software that contain modules that individually and in combination facilitate the execution of objects and the handling of messages at the reception system so that the interactive sessions may be supported at the reception system.
Still further in its apparatus, aspects the invention includes a reception system comprised of one of a plurality of brands of personal computers combined with the application software for use in the interactive network for displaying information and providing transactional services to a user. In preferred form, the reception system further comprises input means for receiving user inputs; storage means for storing objects containing data or interpretively executable programs, the objects comprising a plurality of partitioned applications; and object processing means, responsive to the input means, for selectively retrieving objects from the storage means and interpreting and executing the partitioned applications.
Accordingly, various aspects of the invention are as follows:
A reception system provided in an interactive computer network, the reception system for presenting partitioned applications that include informational and transactional services to a user, the reception system comprising:
input means for receiving user inputs;
storage means for storing objects, the objects collectively including data and executable programs used in generating the partitioned applications;
object processing means, responsive to the input means for selectively retrieving and interpreting objects to extract data and programs required for composing and generating the partitioned applications; and communication means for sending object requests arising within the reception system to and receiving objects from the interactive network when objects required for generating the partitioned applications are unavailable at the storage means.
-3a--A reception system provided in an interactive computer network, the reception system for presenting partitioned applications including informational and transactional services to a user, the reception system comprising:
storage means for storing objects used for generating the partitioned applications;
input means for receiving user input signals;
communications means for passing messages and object requests to and receiving objects and messages from the interactive network;
collection means, in communication with the input means and the communication means for compiling object use data and passing the compiled object use data to the interactive network; and object processing means, responsive to the input means, for selectively retrieving and interpreting objects and interpreting objects to extract data and programs required for composing and generating the partitioned applications.
A method for operating a computer network that provides a very large number of simultaneous users access to large numbers of applications having text and graphic information, the network including one or more host computers, a plurality of distribution computers connected in groups of one of more to each of the host computers, and a plurality of reception system computers each having a display screen, the reception system being connected in groups of one or more to each of the distribution computers, the method comprising the steps of:
a. organizing the application information into objects;
b. distributing selected objects in accordance with a predetermined plan to the host computers, the distribution computers and the reception system computers;
and c. supplying objects to a reception system computer requesting an application so that the requesting reception system computer can selectively combine the objects which -3b-_ make up a requested application by collecting objects as required from the host computers, the distribution computers, and the requesting reception system computer so that the requested application may be displayed at the reception system computer display screen based on the objects collected.
A method of searching for applications, the applications being made up of objects containing text and graphic data and program instructions for presenting the applications, the applications being stored on a computer network, the network including a plurality of distribution computers connected in groups of one of more to each of the host computers, and a plurality of reception system computers each having a display screen at which the applications may be presented, the reception system computers being connected in groups of one or more to each of the distribution computers, the method comprising:
a. preparing a plurality of tables each having various applications referenced to respective keywords so that each table represents a predetermined subset of the applications stored on the network;
b. providing each table with a unique coding;
c. generating a code identifier in response to a query for an application entered at the reception system;
d. comparing the code identifier generated with the table coding to select a table suited to the query;
e. transmitting the table to the reception system at which the query was entered; and f. processing the table identified applications at the reception system that made the query.
Software for use in a personal computer to configure the personal computer as a reception system for presenting partitioned applications, the partitioned applications being made up of objects that collectively include text and graphic data and program instructions, the reception system being connected in a computer network, the network including one or more host computers, a plurality of distribution computers connected in groups of one or more -3c-to each of the host computers, and a plurality of reception systems, the reception systems being connected in groups of one or more to each of the distribution computers, the-software comprising:
a. machine readable medium;
b. first plurality of program instructions provided in the machine readable medium for establishing means for generating requests for partitioned applications;
c. second plurality of program instructions provided in the machine readable medium for establishing means for interpreting the objects to extract data and program instructions required for composing and generating the requested partitioned applications;
d. third plurality of program instructions provided in the machine readable medium for establishing means for executing the program instructions included within the objects;
e. fourth plurality of program instructions provided in the machine readable medium for establishing means for storing objects at the reception system;
f. fifth plurality of program instructions provided in the machine readable medium for establishing means for communicating with the network for the obtaining of objects;
g. sixth plurality of program instructions provided in the machine readable medium for establishing means for causing the interpreted object data to be presented at the reception system;
wherein, the first, second, third, fourth, fifth and sixth plurality of program instructions are related such that when the machine readable medium is used in the personal computer and a requested partitioned application is to be executed at the reception system, the means for interpreting the objects determines what objects are required for execution of the partitioned application, the means for storing objects determines which of the required objects are available at the reception system, and the means for communicating with the network secures from the -3d-network those required objects not available at the storage means so that the means for interpreting the objects can supply the text and graphic data that make up the partitioned application to the means for causing the partitioned application to be presented.
Method for operating a personal computer as a reception system for presenting partitioned applications, the partitioned applications being made up of objects that collectively include text and graphic data and program instructions, the reception system being connected in a computer network, the network including one or more host computers, a plurality of distribution computers connected in groups of one or more to each of the host computers, and a plurality of reception systems, the reception systems being connected in groups of one or more to each of the distribution computers, the method comprising the steps of:
a. establishing and managing means within the personal computer for generating requests for partitioned applications.
b. establishing and managing means within the personal computer for interpreting objects to extract data and program instructions required for composing and generating the requested partitioned applications;
c. establishing and managing means within the personal computer for executing program instructions that may be included within the objects from which the requested partitioned applications can be generated;
d. establishing and managing means within the personal computer for storing objects from which the requested partitioned applications can be generated;
e. establishing and managing means within the personal computer for communicating with the network to obtain objects from which the requested partitioned applications can be generated that are not available at the object storage means;
f. establishing and managing means within the personal computer for causing the interpreted object data to be presented at the reception system;
-3e-1 337~ 32 -wherein, when a partitioned application is requested, the reception system determines the objects required to be executed for generating the partitioned application by using the means for interpreting objects; determines whether the required objects are available at the reception system by using the means for storing objects; secures required objects not available at the storage means from the network by using the means for communicating with the network; and interprets the required objects to obtain the text and graphic data and program instructions required for composing and presenting the partitioned application, and presents the partitioned application by supplying the necessary text and graphic data to the means for causing the partitioned application to be presented.

DESCRIPTION OF THE DRAWINGS
The above and further objects, features and advantages of the invention will become clear from the following more detailed description when read with reference to the accompanying drawings in which:
FIG. 1 is a block diagram of the interactive computer network in accordance with the invention;
FIG. 2 is a schematic diagram of the network illustrated in FIG. l;
FIGS. 3a and 3b are plan views of a display screen presented to a user in accordance with the invention;
FIGS. 4a, 4b, 4c and 4d are schematic drawings that illustrate the structure of objects, and object segments utilized within the interactive network in accordance with the invention;
FIG. 5a is a schematic diagram that illustrates the configuration of the page template object in accordance with the invention;
FIG. 5b is a schematic diagram that illustrates page composition in accordance with the invention;
FIG. 6 is a schematic diagram that illustrates the protocol used by the reception system to support user applications in accordance with the invention;
-3f-i ~
~ i FIG. 7 is a schematic diagram that illustrates major layers of the reception system in accordance with the invention;
FIG. 8 is a block diagram that illustrates native code modules of the reception system in accordance with the invention;

-3g-'~

L~ 1 3371 32 FIG. 9 is a schematic diagram that, illustrates an example of a partitioned application to be processed by the reception system in accordance with the invention;
FIG. 10 illustrates generation of a page with a page processing table in accordance with the invention; and FIG. 11 is a flow diagram for the application navigation method in accordance with the invention.

DESCRIPTION OF THE PREFERRED EMBODIMENT
GENERAL SYSTEM DESCRIPTION
With reference to FIGS. 1, 2, the invention includes a plurality of reception units within reception layer 401 of interactive computer network 10 for displaying information and providing transactional services. In this arrangement, many users each accesses network 10 with a conventional personal computer; i.e., one of the IBMTM or IBM-compatible type, which has been provided with applications software in accordance with a preferred form of the invention to constitute a reception system ~RS) 400.
As shown in FIG. 1, interactive network 10 uses a layered structure that includes an information layer l00, a switch/file server layer 200, and cache/concentrator layer 300 as well as reception layer 401. This structure maintains active application databases and delivers requested parts of the databases on demand to the plurality of RS 400's, shown in FIG. 2. As seen in FIG. 2, cache/concentrator layer 300 includes a plurality of cache/concentrator units 302, each or which serve a plurality of RS 400 units over lines 301. Additionally, switch/file server layer 200 is seen to include a server unit 205 connected to multiple cache/concentrator units 302 over lines 201. Still further, server unit 205 is seen to be connected to information layer 100 and its various elements, which act as means for producing, supplying and maintaining the network databases and other information necessary to support network 10.
Continuing, switch/filer layer 200 is also seen to include gateway systems 210 connected to server 205. Gateways 210 couple layer 200 to other sources of information and data; e.g., other computer systems. As will be appreciated by those skilled in the art, layer 200, like layers 401 and 300 could also include multiple servers, gateways and information layers in the event even larger numbers of users were ~ought to be served.
Continuing with reference to FIG. 2, each RS 400 is seen to include a personal computer 405 having a CPU 410 including a microprocessor (as for example the type made by INTELTM Corporation in its X'86 family of microprocessors)~ companion RAM and ROM memory and other associated elements, monitor 412 with screen 414 and a keyboard 424. Further, personal computer 405 may also include one or two floppy disk drives 416 for receiving diskettes 426 containing application software in accordance with this invention for supporting the interactive sessions with network 10 and diskettes 428 containing operating systems software; i.e., MS-DOS, suitable for the personal computer 405 being used. Personal computer 405 may also include a hard-disk drive 420 for storing the application software and operating system software which may be transferred from diskettes 426 and 428 respectfully.

~, i,, Once so configured, each RS 400 provides: a common interface to other elements of interactive computer network 10; a common environment for appllcation processing; and a common protocol for user application conversation which is independent of the personal computer brand used. RS
400 thus constitutes a universal terminal for which only one version of all applications on network 10 need be prepared, thereby rendering the applications interpretable by a variety of brands of personal computers of the IBM or IBM-compatible type.
RS 400 formulated in this fashion is capable of communication with the host system to receive information containing either of two types of data, namely objects and message~. Objects have a uniform, self-defining format known to RS 400, and include data types, such as interpretable program~ and presentation data for display at monitor screen 414 of the user's personal computer. Applications presented at RS 400 are partitioned into objects which represent the minimal units available from the higher level~ of interactive network 10 or RS 400. In this arrangement, each application partition typically represents one screen or a partial screen of information, including fields filled with data used in transactions with network 10. Each such screen, commonly called a page, is represented by its parts and is described in a page template object, discussed below.
Applications, having been partitioned into minimal units, are available from higher elements of network 10 or RS 400, and are retrieved on demand by RS 400 for interpretive execution. Thus, not all partitions of a partitioned application need be resident at RS 400 to process a selected partition, thereby raising the storage efficiency of the user's RS 400 and minimizing response time. Each application partition is an independent, self-contained unit and can operate correctly by itself. Each partition may refer to other partitions either statically or dynamically. Static references are built into the partitioned application, while dynamic references are created from the execution of program logic using a set of parameters, such as user demographic~ or locale. Partitiona may be chosen as part of the RS
processing in response to user created events, or by selecting a key word of the partitioned application (e.g., "JUMP" or "INDEX," discussed below), which provides random access to all services represented by partitioned applications having key words.
objects provide a means of packaging and distributing partitioned applications. As noted, objects make up one or more partitioned applications, and are retrieved on demand by a user's RS 400 for interpretive execution and selective storage. All objects are interpreted by RS 400, thereby enabling applications to be developed independently of the personal computer brand used.
Objects may be nested with one another or referenced by an object identifier (object-id) from within their data structure. References to objects permit the size of objects to be minimized. Further, the time required to display a page is minimized when referenced objects are stored locally at RS 400 (which storage is determined by prior usage meeting certain retention criteria), or have been pre-fetched, or in fact, are already used for the current page.
Objects carry application programs and information for display at monitor screen 414 of RS 400. Application program objects, called pre-processor and post-processors, set up the environment for the user's interaction with network 10 and respond to events created when the user inputs information at keyboard 424 of RS 400. Such events typically trigger a program object to be processed, causing one of the following: sending of transactional information to the coapplications in one layer of the network 10; the receiving of information for use in programs or for presentation in application-dep~ndent fields on monitor screen 414; or the requesting of a new objects to be processed by RS 400. Such objects may be part of the same application or a completely new application.
The RS 400 supports a protocol by which the user and the partitioned applications communicate. All partitioned application~ are designed knowing that this protocol will be supported in RS 400. Hence, replication of the protocol in each partitioned application iq avoided, thereby minimizing the size of the partitioned application.
RS 400 includes a means to communicate with network 10 to retrieve objects in response to events occurring at RS 400 and to send and receive mesqages.
RS 400 includes a means to selectively store objects according to a predetermined storage criterion, thus enabling frequently used object!s to be stored locally at the RS, and causing infrequently used objects to forfeit their local storage location. The currency of objects stored locally at the RS 400 is verified before use according to the object's storage control parameters and the storage criterion in use for version checking.
Selective storage tailors the contents of the RS 400 memory to contain objects representing all or significant parts of partitioned applications favored by the user. Because selective storage of objects is local, response time is reduced for those partitioned applications that the u~er accesses most frequently.
Since much of the application processing formerly done by a host computer in previously known time-sharing networks is now performed at the user's RS 400, the higher elements of network 10, particularly layer 200 has as its primary functions the routing of messages, serving of objects, and line concentration. The narrowed functional load of the higher network 3S elements permits many more users to be serviced within the same bounds of computer power and I/0 capability of convencional host-centered architectures.
Network 10 provides information on a wide variety of topics, including, but not limited to news, industry, financial needs, hobbies and cultural interests. Network 10 thus eliminates the need to consult multiple information sources, giving users an efficient and timesaving overview of subjectq that interest them.
The transactional features of interactive network 10 saves the user time, money, and fruqtration by reducing time spent traveling, standing in line, and communicating with sales personnel. The user may, through RS 400, bank, send and receive messages, review advertisements, place orders for merchandiqe, and perform other transactions.
In the preferred embodiment, network 10 provideq information and transaction processing service~ for a large number of users simultaneously accessing the ~ 3371~Z
~ . ~
network via the public switched telephone network (PSTN), broadca~t, and/or other media with their RS 400 units. Services available to the user include display of information such as movie reviews, the latest news, airlines reservations, the purchase of items such as retail merchandise and groceries, and quotes and buy/sell orders for stocks and bonds. Network 10 provides an environment in which a user, via RS 400 establishes a session with the network and accesses a large number of services. These services are qpecifically constructed applications which as noted are partitioned 90 they may be distributed without undo transmission time, and may be processed and selectively stored on a user's RS 400 unit.

SYSTEM CONFIGURATION
As qhown in FIG.l, in preferred form interactive computer network 10 includes four includes layers: information layer 100, qwitch and file server layer 200, concentrator layer 300, and reception layer 401.
Information layer 100 handles: (1) the production, storage and dissemination of data and (2) the collection and off-line proce~ing of such data from each RS session with the network 10 90 as to permit the targeting of information to be presented to users and for traditional business ~upport.
Switch and file server layer 200 and cache/concentrator layer 300 together constitute a delivery ~ystem 20 which delivers requested data to the RS 400'9 of reception layer 401 and routes data entered by the user or collected at RS 400'9 to the proper application in network 10. With reference to FIG.2, the information used in a RS 400 either resides locally at the RS 400, or is available on demand from the cache/concentrator 300 or the file server 205, vLa the gateway 210, which may be coupled to external providers, or is available the from information layer 100.
There are two types of information in the network 10 which are utilized by the RS 400: objects and messages.
Objects include the information requested and utilized by the RS 400 to permit a user to select specific parts of applicationR, control the flow of information relating to the applications, and to supply information to the network. Objects are self-describing structures organized in accordance with a specific data object architecture, described below. Object3 are used to package presentation data and program instructions re~ulred to support the partitioned applications of a RS 400. Objects are di~tributed on demand throughout interactive network 10. Objects may contain: control information;
program instruction to set up an application processing environment and to process uqer or network created events; information about what is to be displayed and how it is to be displayed; references to programs to be interpretively executed; and references to other objects, which may be called based upon certain conditions or the occurrence of certain events at the uqer's personal computer, resulting in the selection and retrieval of other partitioned applications packaged as objects.
Messages are information provided by the user or the network and are u~ed in fields defined within the constructs of an object, and are seen on the user's RS monitor 412, or are used for data processing at RS 400.
Additionally, and as more fully described hereafter, messages are the primary means for communication within and without the network. The format of messageq is application dependent. If the message is input by the user, it is formatted by the partitioned application currently being processed on RS
400. Likewise, and with reference to FIG.2, if the data are provided from a co-application database residing in delivery system 20, or accessed via gateway 210 or high function syqtem 110 within the information layer 100, the partitioned application currently being processed on RS 400 causes the message data to be displayed in fields on the u~er' 8 display monitor as defined by the particular partitioned application.
All active objects reside in file server 205. Inactive objects or objects in preparation reqide in producer system 120. Objects recently introduced into delivery syqtem 20 from the producer system 120 will be available from file server 205, but may not be available on cache/concentrator 302 to which the user's RS 400 has dialed. If such objectq are reque~ted by the RS 400, the cache/concentrator 302 automatically requests the object from file server 205. The requested object is routed back to the requeqting cache/concentrator 302, which automatically routes it to the communications line on which the request was originally made, from which it i9 received by the RS 400.
The RS 400 i9 the point of application session control becauqe it has the ability to select and randomly access objects representing all or part of partitioned applications and their data. RS 400 processeq objects according to information contained therein and events created by the user on perqonal computer 405 Applications on network 10 act in concert with the distributed partitioned applications running on RS 400. Partitioned applicationq conqtructed as groups of object3 are distributed on demand to a user' 3 RS
400. Partitioned applicationq represent the mi n; amount of information and program logic needed to present a page or window, i.e. portion of a page presented to the user, perform transactions with the interactive network 10, and perform traditional data processing operations, as required, including qelecting another partitioned application to be processed upon a user generated completion event for the current partitioned application.
Objects representing all or part of partitioned applications may be stored in a user's RS 400 if the objects meet certain criteria, such as being non-volatile, non-critical to network integrity, or if they are critical to ensuring reasonable response time. Such objects are either provided on diskettes 426 together with RS 400 system software used during the inatallation procedure or they are automatically requested by RS 400 when the user makes selections requiring objects not present in RS 400. In the latter case, RS 400 requests from cache/concentrator layer 300 only the objects necesqary to execute the desired partitioned application.
Reception system application software 426 in preferred form i~ provided for I3M and IBM-compatible brands of personal computers 405, and all partitioned applicationq are conqtructed according to a single architecture which each such RS 400 support~. With reference to FIG 2, to acceqs network 10, a user preferably has a personal computer 405 with at least 512K RA~ and a single disk drive 416. The u~er typically acces~es network 10 uqing a 1,200 or 2,400 bps modem (not shown~. To initiate a session with network 10, objects representing the logon application are retrieved from the user's 1337~3Z
~ . , _ personal di3kette, including the R.S. application software, which was previously set up during a standard installation enrollment procedure with network 10. Once communication between RS 400 and cache/concentrator layer 300 has been established, the user begins a standard logon procedure by inputting a personal entry code. Once the logon procedure i8 complete, the user can begin to access various desired services (i.e., partitioned applications) which provide display of requested information and/or transaction operations.

Applications, i.e. information events, are composed of a sequence of one or more pages opened at screen 414 of monitor 412. This is better seen with reference to FIG 3a and 3b were a page 255 is illustrated as might appear at screen 414 of monitor 412. With reference to FIG 3a, each page 255 is formatted into page partitions 250, 260, 280, and 290 (not to be confused with applications partitions). Window page partitions 275, well known in the art, are also available and are opened and closed conditionally on page 255 upon the occurrence of an event specified in the application ~ being run. Each page partition 250-290 and window 275 is made up of a page element which define the content of the partition or window.
Each page 255 includes: a header page partition 250, which has a page element associated with it and which typically conveys information on the page's topic or sponsor; one or more body page partitions 260 and window page partitions 275, each of which is associated with a page element which as noted gives the informational and transactional content of the page. For example, a page element may contain presentation data selected as a menu option in the previous page, and/or may contain prompts to which a user responds in pre-defined fields to execute transactions. As illustrated in FIG. 3b, the page element associated with body page partition 260 includes display fields 270, 271, 272. A window page partition 275 seen in FIG. 3a represents the same informational and transactional capability as a body partition, except greater flexibility is provided for its location and size.
Continuing with reference to FIG. 3b, advertisements 280 provided over network 10, like page elements, also include information for display on page 255, and may be included in any partition of a page. Advertisements 280 may be presented to the user on an individual basis from queues of advertisements that are constructed off-line by business system 130, and sent to file server 205 where they are accessible to each RS 400.
Individual queues of advertisements are constructed based upon data collected on the partitioned applications that were accessed by a user, and upon events the user generated in response to applications. The data are collected and reported by RS 400 to a data collection co-application in file server 205 for later transmission to business system 130. In addition to application access and use characteristics, a variety of other parameters, such as user demographics or postal ZIP code, may be used as targeting criteria. From such data, queues of advertisements are constructed and targeted to either individual users or to sets of users who fall into certain groups according such parameters.
Also with reference to FIG. 3b, a user interface 285 is displayed on ~ 1 33 ~

the page which enables the user to interact with the network RS 400 and other elements of network 10, so as to cause such operations as navigating from page to page, performing a transaction, or obtaining more information about other applicationq. As shown in FIG 3b, user interface 285 includeq a -command bar 290 having a number of commands 291-295 which the user can execute. The functions of commands 291-298 are discussed in greater detail below.

NETWORX OBJECTS
As noted above, in conventional time-sharing computer networks, the data and program instructions necessary to support user sessions are maintained at a central host computer. However, that approach haq been found to create processing bottlenecks as greater numbers of users are connected to the network; bottle-necks which require increases in processing power and complexity; e.g., multiple hosts of greater computing capability, if the network is to meet demand. Further, such bottlenecks have been found to alqo slow response time as more users are connected to the network and seek to have their requests for data processing answered.
The consequences of the host processing bottlenecking is to either compel capital expenditures to expand host processing capability, or accept longer response times; i.e., a slower network, and risk user dissatisfaction.
However, even in the case where additional computing power is added, and where response time is allowed to increase, eventually the host becomes user saturated as more and more users are sought to be served by the network.
The method and apparatus of this invention are directed at alleviating the effects of host-centered limitations, and extending the network saturation point. In accordance with the invention, this is achieved by reducing the demand on the host for processing resources by structuring the network so that the higher network levels act primarily to maintain and supply data and programs to the lower levels of the network, particularly RS
400, which acts to manage and sustain the user screen dlsplays.
More particularly, the method aspect of the invention features procedure~ for parsing the network data and program instruction~ required to support the interactive user sessions into packets, referred to as objects, and distributing them into the network where they can be processed at lower levels, particularly, reception system 400.
In accordance with the invention, the screens presented at the user's monitor are each divided into addressable partitions shown in FIG. 3a, and the display text and graphics necessary to make up the partitions, as well as the program instructions and control data necessary to deliver and sustain the screens and partitions are formulated from pre-created objects. Further, the objectA are structured in accordance with an architecture that permits the displayed data to be relocatable on the screen, and to be reusable to make up other screens and other sessions, either as pre-created and stored sessions or interactive sessions, dynamically created in response to the user's requests.
In accordance with the method aspect of the invention and as shown in FIG.4c, the network objects are organized as a family of objects each of which perform a specific function in support of the interactive session.

c~ 1337~32 More particularly, the network objeot family is seen to include 6 members:
page format objects 502, page element object 504, window objects 506, program objects 508, advertisement objects 510 and page template objects 500.
Within this family, page format objects 502 are designed to define the partitioning 250 to 290 of the monitor screen shown in FIG. 3a. The page format objects 502 provide a mean~ for pre-defining screen partitions and for ensuring a uniform look to the page pre~ented on the reception system monitor. They provide the origin; i.e., drawing points, and dimensions of each page partition and different values for presentation commands such as palette and background color.
Page format objects 502 are referenced whenever non-window data is to be displayed and as noted ensure a consistent presentation of the page. In addition, page format objects 502 assures proper tessellation or "tiling" of the displayed partition9.
Page element objects 504, on the other hand, are structured to contain the display data; i.e., text and graphic, to be displayed which is mapped within screen partitions 250 to 290, and to further provide the associated control data and programs. More ~pecifically, the display data is described within the objeot a~ NAPLPS data, and includes, PDI, ASCII, Incremental Point and other di~play encoding schemes. Page element objects al~o control the functionality within the screen partition by means of field definition segments 516 and program call segments 532, as further described in connection with the description of such segments hereafter. Page element objects 504 are relocatable and may be reused by many pages. To enable the displayable data to be relocated, display data must be created by producers in the NAPLPS relative mode.
Continuing with reference to FIG.4c, window objects 508 include the display and control data necessary to support window partitions 275 best seen in FIG.3a. Windows contain display data which overlays the base page and control data which supersede the base page control data for the underlying screen during the duration of the window. Window objects 506 contain data which is to be displayed or otherwise presented to the viewer which is relatively independent from the rest of the page. Display data within windows overlays the base page until the window is closed. Logic associated with the window supersedes base page logic for the duration of the window.
When a window i~ opened, the bitmap of the area covered by window is saved and most logic functions for the overlaid page are deactivated. When the window is closed, the qaved bit map is swapped onto the screen, the logic functions associated with the window are disabled, and prior logic functions are reactivated.
Windows are opened by user or program control. They do not form part of the base page. Windows would typically be opened as a result of the completion of events specified in program call segments 532.
Window objects 506 are very similar in structure to page element objects 504. The oritical difference is that window objects 506 specify their own size and absolute screen location by means of a partition definition segment 528.
Program object 508 contain program instructions written in a high-level language called TRINTEX Basic Object Language, i.e., TBOL, described in ~:: I337~3~
greater detail hereafter, which may be executed on reception system 400 to support the application. More particularly, program objects 508 includes interpretable program code, executable machine code and parameters to be acted upon in conjunction with the presentation of text and graphics to the reception system monitors.
Program objects 508 may be called for execution by means of program call segments 532, which specify when a program is to be executed (event~, what program to execute (program pointer), and how programs should run (parameters).
Programs are treated as objects to conform to the open-ended design philosophy of the data object architecture ~DOA), allowing the dissemination of newly developed programs to be easily and economically performed. As noted above, it is desirable to have as many of these program objects staged for execution at or a~ close to RS 400 as possible.
Still further, advertising objects 510 include the text and graphics that may be presented at ad partition 280 presented on the monitor screen as shown in FIG.3b.
Finally, the object family includes page template objects 500. Page template objects 500 are designed to define the components of the full ~creen presented to the viewer. Particularly, page template objects 500 include the entry point to a screen, the name of the page format objects which specify the various partitions a screen will have and the page element object that contain the display data and partitioning parameters for the page.
Additionally, page template object 500 includes the specific program calls required to execute the screens associated with the application being presented to the user, and may serve as the means for the user to selectively move through; i.e., navigate the pages of interest which are associated with various applications. Thus; in effect, page template objects 500 constitute the "recipe" for making up the collection of text and graphic information required to make the screens to be presented to the user.
Also in accordance with the invention, object 500 to 510 shown in FIG.4c are themselves made up of further sub-blocks of information that may be selectively collected to define the objects and resulting pages that ultimately constitute the application presented to the user in an interactive text and graphic session.
More specifically and as shown schematically in FIG.4a, object~ 500 to 510 are predefined, variable length records consisting of a fixed length header 551 and one or more self-defining record segments 552 a list of which is presented in FIG.4c as segment types 512 to 541.
In accordance with the invention, and as shown in FIG. 4b, object header 551 in preferred form is 18 bytes in length and contains a prescribed sequence of information which provides data regarding the object's identification, its anticipated use, association to other objects, its length and its version and currency.
More particularly, each of the 18 bytes of object header 551 are conventional hexadecimal, 8 bit bytes and are arranged in a fix pattern to facilitate interpretation by network 10. Particularly, and as shown in FIG.4b, the first byte of header 551; i.e., byte 1, identifies the length of the object ID in hexadecimal. The next six bytes; i.e., bytes 2 to 7, are ~; 133~1~Z
....
_ allocated for identifying access control to the object so as to allow creation of closed user groups to whom the object (9) is to be provided. As will be appreciated by those skilled in the art, the ability to earmark objects in anticipation of user requests enables the network anticipate re~uests and pre-collect objects from large numbers of them maintained to render the network more efficient and reduce response time. The following 4 bytes of header 551; bytes 8 to 11, are used to identify the set of objects to which the ~ubject object belongs. In this regard, it will be appreciated that, again, for speed of access and efficiency of selection, the objects are arranged in groups or sets which are likely to be pre~ented to user sequentially in presenting the page sets; i.e., screens that go to make up a se~sion.
Following identification of the object set, the next byte in header 551; i.e., byte 12, gives the location of the subject object in the set. As will be appreciated here also the identification is provided to facilitates ease of object location and access among the many thousands of objects that are maintained to, thereby, render their selection and presentation more efficient and speedy.
Thereafter, the following bytes of header 551; i.e., byte 13, designates the object type; e.g., page format, page template, page element, etc. Following identification of the object type, two bytes; i.e., bytes 14, 15, are allocated to define the length of the object, which may be of what ever length is necessary to supply the data necessary, and thereby provides great flexibility for creation of the screens. Thereafter, a single byte;
i.e., byte 16, is allocated to identify the storage characteristic for the object; i.e., the criterion which establishes at what level in network 10 the object will be stored, and the basis upon which it will be updated. At least a portion of this byte; i.e, the higher order nibble (first 4 bits reading from left to right) is associated with the last byte; i.e., byte 18, in the header which identifies the version of the object, a control used in determi ning how often in a predetermined period of time the object will be updated by the network.
Following qtorage characteristic byte 16, header 551 includes a byte;
i.e., 17, which identifies the number of objects in the set to which the subject object belongs. Finally, and as noted above, header 551 includes a byte; i.e., 18, which identifies the version of the object. Particularly the object version i~ a number to establish the control for the update of the object that are resident at reception sy3tem 400.
As shown in FIG.4a, and as noted above, in addition to header 551, the object includes one more of the various segment types shown in FIG.4c.
Segments 512 to 541 are the basic building blocks of the objects. And, as in the case of the object, the segments are also self-defining. As will be appreciated by those skilled in the art, by making the segments self-defining, change~ in the objects and their use in the network can be made without changing pre-existing objects.
As in the case of objects, the segments have also been provided with a specific structure. Particularly, and as shown in FIG. 4a, segments 552 consists of a designation of segment type 553, identification of segment length 554, followed by the information necessary to implement the segment .i , . .

1~ 1 3371 32 and its associated object 555; e.g. either, control data, display data or program code.
In this structure, segment type 553 is identified with a one-byte h~yadecimal code which describes the general function of the segment.
Thereafter, segment length 554 ia identified as a fixed two-byte long field which carries the se --t length as a h~Yadecimal number in INTEL
format; i.e., least significant byte first. Finally, data within se~ - ts may be identified either by position or keyword, depending on the specific requirements of the segment.
In accordance with the invention, the specific structure for the objects and segments shown in FIG. 4c would be as described below. In that description the following notation convention is used:
< ~ - mandatory item ( ) - optional item ... - item may be repeated I item I I item I
< > ( ) - items in a column indicate either/or liteml I item I
The structure for objects is:
PAGE TEMPLATE OBJECT, [<header> (compression descriptor) <page format call> (page element call) ... (program call) (page element selector) (system table call) ...
external reference) (keyword/navigation) ...];
As noted above, page format objects 502 are designed to define the partitioning 250 to 290 of monitor screen 414 shown in FIG. 3a.
PAGE FORMAT OBJECT, [<header> (compression descriptor) (page defaults) <partition definition>];
PAGE ELEMENT OBJECT, 30 [<header> (compression descriptor) (presentation data) (program call) ... (custom cursor) ... (custom text) ... (field definition) ... (field-level program call) ... (custom cursor type 2) ... (custom graphic) ...
(field definition type 2) ... (array definition) ... (inventory control)];
Page element objects, as explained, are structured to contain the display data; i.e., text and graphics, to be presented at screen partitions 250 to 290.
WINDOW OBJECT, [<header> (compression description) <partition definition> (page element call) (presentation data) ... (program call) ... (custom cursor) (custom text) (custom cursor type 2) ... (CUSTOM graphic) ... (field definition) ... (field level program call) ... (field definition type 2) ... (array definition) ... (inventory control];
As noted, window objects include display and control data necessary to support window partition at screen 414.
PROGRAM OBJECTS, [<header> (compression descriptor) <program data> ...].
Program objects, on the other hand, contain program instructions written in higher-level language which may be executed at RS 400 to support `~ 1 337 1 3~
the application.
ADVERTISEMENT OBJECT, [<header> (compression descriptor) (presentation data) ... (program call) ... (cuAtom cur~or~ ... (custom text) ... (field definition) ... (field-5 level program call) .......(custom cursor type 2)..... (custom graphic) (field definition type 2).....(array definition) ..... (inventory control)];
As can be seen, advertisement objects are substantially the same as page element objectq, with the difference being that, as their name implies, their subject matter iq selected to concern advertising.
Continuing, in accordance with the invention, the structure for the object segments is as described hereafter.
PROGRAM CALL SEGMENT
Program call segments 532 are used to invoke programs. Program eventswill be specified in logical terms and will be mapped by the reception system native software 420 to specific physical triggers (e.g., the "logical" event end of page may map to the physical <ENTER> key). The logical event to be completed to initiate the program is specified in a one-byte token within the segment. The structure of program call segment 532 is as follows:
Iprgm obj. idl 20 [<st> <sl> <event> <prefix> < > (parm) ................ ];
I displacement I

where "st" is type; "sl" length: "event" is a one-byte token of the logical event to be completed to initiate the program: "prefix" is a one-byte prefix to an object id or displacement; "object id" is id of the program object 506;
"displacement" iq a pointer to an imbedded program ca~l segment 532; and "parm~ is the parameters specific to the program.

. FIELD LEVEL PROGRAM CALL SEGMENTS
Some programs, such as edits, must be triggered at the field level.
Field-level program call segments 518 relate program calls to specified field definition segments 516. The structure of field-level program call segments i9 as follows:

Iprgm.obj-idl [<st> <sl> <event> <field id> <prefix>< > (parm) ...];
Idisplacmentl where "st" is type; "sl" length; "event" is a one-byte token of the logical event to be completed to initiate the program; "field id" is the one-byte name of the field specified in a field definition segment 516 with which this call segment is associated; "prefix" is a one-byte prefix to an object id or displacement; "object id" is id of the program object 506; "displacement" is a pointer to an imbedded program call segment 532; and "parm" is the parameters specific to the program.
PROGRAM DATA SEG~ENT
Program data segments 536 contain the actual program data to be processed by RS 400. Program data may include either source code, compiled machine code, macros, storage maps, and/or parameters. The structure of 1 337 1 3~
program data segments 536 is as follows -[<~t> <91> <type> <program data>];

where "st" is type; "91" length; "type" refers to the type of program data contained; i.e., (1=TBOL, 2-table data); and "program data" is the actual program to be executed.

COMPRESSION DESCRIPTOR SEGMENT
Compression deqcriptor segment contains information need for the decompression of objects compressed in interactive network 10. The segment is a formalization of parameters to be used by a decompression routine residing at the RS 400, using; for example, Huffman encoding well known the art. The structure of compression descriptor segment 538 is:
[<3t> <91> <tabie number> <length 1> (length 2)];

where "st" is type; "91" length; "table number" is a one-byte number corresponding to the "class" indicator in the table structure segment of the appropriate decompression system table object; "length 1~ is a two-byte indicator of the length of the ~egment after compres3ion ~not including object header and length of compression de~criptor); and "length 2" is a two-byte indicator of the length of the segment before compression (not including object header and length of compression descriptor).
PAGE DEFAULT SEGMENTS
Page default segments 540 specify defaults for the entire page using NAPLPS commands. The structure of page default segment 540 is:

[<st> <91> cNAPLPS>];

where "st" is type; "91" length; and "NAPLPS" are the commands that may be u~ed to specify default characteristics of the page.

PARTITION DEFINITION SEGMENT
Partition definition ~egment 528 describe~ display screen areas into which data may be mapped. The 3tructure of partition definition segment 528 is:

[<~t> <91> <partition id> <origin> <~ize> (NAPLPS)];

where "st" is type; ~'sl" length; ~partition id~ a one-byte partition id unique within the current page format object 502; "origin" is the partition origin point, a three-byte NAPLPS point set (absolute, invisible) operand contained the absolute coordinates of the lower left corner of the partition;
and "~ize" refer~ to partition size, a three-byte NAPLPS point ~et (absolute, invisible) operand containing the absolute coordinates of the upper right corner of the partition.

13~7~3~

PAGE FORMAT CALL SEGMENT
Page format call segment 526 is used by the page template object 500 to specify the particular page format object 502 to be used as the "blueprint" of the page. Page format call segment 526 qtructure is as follows:

[<st> <91> <prefix> <object id>];

where "st" is type; "91" length; "prefix" is a one-byte prefix to an object id or displacement; and "object id" is the object id of the page format object 502.

PAGE ELEMENT CALL SEGMENT
Page element call segment 522 specifieq which data is to be pre3ent on the base page and in which page partition the data is to appear. The structure of page element call segment is as followq:

I object id I
~<~t> <sl> <partition id> <priority> <prefix> < > ];
Idisplacementl where ~t~ is type; "91" length; "partition id" is the partition id, as specified in the page format object 502 upon which this object will act:
"priority" is a one-byte binary flag indicating priority (from 0-15 with 0 indicating no priority [FIFOI) of object interpretation (high-order nibble) and of painting (low-order nibble); "prefix" is a one-byte object id or displacement; "object id" is the id of the page element object 522; and "displacement" is a pointer to an imbedded page element object 522.

PAGE ELEMENT SELECTOR SEGMENT
Page element selector segment 524 provides a mechanism by which page elements may be dynamically selected for presentation within a partition.
The structure of page element qelector segment 524 is:

I pgm.obj.id [<st> <sl> <part.id> <priority> <prefix> < > (parm) ...]
Idisplacementl where "st" is type; "91" length; "part. id" i3 the partition id as specified within the page format object 502 upon which the object will act; "priority"
is a one-byte binary flag indicating priority (from 0-15 with 0 indicating no priority [FIFO~) of object interpretation (high-order nibble) and of painting (low-order nibble); "prefix" iq a one-byte object id or displacement; "pgm.obj.id" is the object id of the program object 508 used to dynamically select an element object; "displacement" is a pointer to an imbedded program object 508, and "parm" i3 parameters which are used by the program object 508.

SYSTEM TABLE CALL SEGMENT

~ 1 337 1 32 , .
System table call segments 542 call system table segments for use by ~ the RS 400. Each table entry in a system table segment contains an index-addressable segment (e.g., a set of custom text segments 514). System table call segments operate in a "locked-shift" mode, meaning that each system table of a particular class will remain operative until a new table is requested for that class of table. System table call segment 542 structure is aq follows:

I object id I
[<st> <91> <prefix> < > ];
Idisplacementl where "st" is type; "sl" length; "prefix" is a one-byte prefix to an object id or displacement; "object id" is the id of a system table segment; and "displacement" i3 a pointer to an imbedded system table segment.

TABLE STRUCTURE SEGMENT
Table structure segments 554 describe the basic class and composition of system table objects. The structure of table structure segment 554 is:
[<st> ~sl> <class> <number of entries> <m~i entry length>];

where "st" is type; "sl" length; "class" is a one-byte identifier indicating the class of the current table (as follows:
x'00' 3 custom text table x'01' - custom cursor table x'02' = custom graphic table x'03' ~ cu~tom curqor type 2 table x'30' thru x'39' ~ decompression table);
I'number of entrie~ is a two-byte field specifying the total number of entries contained in the current table; and ~ imllm entry length" is a two-byte field specifying the length of the largest entry in the current table.

TABLE ENTRY SEGMENT
Table entry segment 556 contains the actual data that has been placed in tabular form. The meaning of the data is derived from the class indicator in the table structure segment 554. They will be treated as functional equivalent of certain other segments such as custom text segment 514 or custom cursor segment 512. Table entry segment structure is:
gO
[<st> <sl> <data>];

where "st" is type; "91" length; and "data" is the data contained in the entry (text character attributes if table belongs to the custom text class;
NAPLPS if the table belongs to the custom cursor class).

EXTERNAL REFERENCE SEGMENT
External reference segment 544 is provided to improve run-time performance by providing the RS 400 with a list of objects that are ~ 1337~3~

candidate~ for pre-fetching. External reference segments 544 contain a list of object-ids which are used within the current page. Each object indicated within this list is called explicitly from the current frame. Object ids specified within the external reference segment 544 will take advantage of the notion of "inheritance." If multiple object ids are contained within the segment, they may inherit high-order bytes from previously specifièd ids, thu~ avoiding repetition of information that is inherited (e.g. to specify objects ABC12, ABC22, and ABC37 in this segment, one encodes them as ABC12, 22, 37). External reference segments 544 operate in a "locked-shift" mode, meaning that each external reference list will be active until the next external reference list i~ encountered. In the best mode, there should be no more than one external reference qegment per page. External reference -' segment structure is as follows: -~

[<st> <81> <# of ids> <priority> <prefix> <object id>];

where "st" is type; "91" length; "# of ids" is a one-byte field specifying the total number of object ids contained in the current segment; "priority"
is a one-byte priority value specifying priority of pre-fetch (prioritieq may be duplicated, in which case they will be processed from left to right);
"prefix" is a one-byte prefix to an object id or dis~l~cement; and "object id" is the id of an extern~lly referenced object.

KEYWORD/NAVIGATION SEGMENT
Keyword/navigation Aegments 520 may contain two types of information:
(1) references to other page template objects 500 that are either logically higher than the current page template (e.g., a "parent" menu) or references to page template object~ 500 outside the current "world" (a logically cohesive group of pages having a single entry point, such as a general map of the interactive service); or (2) a character string to be associated with the current page template object 500, which may be displayed to the user to indicate an alternative path or keyword which could be used to access the current page template. The structure of keyword/navigation segment i9 as follows:
[<st> <91> <#ids> (<prefix> <object id>)...(character string)];

where "st" is type; "91" length; ~'#ids" is the number of object ids in thi~
segment; "pre-fix" is a one-byte object id prefix; "object id" is an object id associate with the current page aq either an upward hierarchical reference or a non-hierarchical referencei and "character string" is the character string to be associated with the current page. (See also, diqcussion of Jump word navigation, below).

P~ESENTATION DATA SEGMENT
Presentation data segments 530 contain the actual contain the actual data to be displayed or otherwise presented to the user. Presentation data may contain NAPLPS codes, ASCII, and other codes for visual diYplay.
Presentation data may in the future contain codes for the presentation of audio signals. The structure of presentation data segment is:

~<st> <91> <type> <size> <presentation data>];

where "st" is type; "sl" length; "type" is the type of presentation data included in this segment (1=NAPLPS, 2=ASCII); "size" i~ a NAPLPS operand that defines the upper right portion of the display data; and "presentation data"
is the actual data to be presented to the user.

FIELD DEFINITION SEGMENT
Field definition segments 516 define the location of a field, name the field, and specify how data will be acted on within the named field. Field definition segment 516 structure is as follows:

[<st> <91> <attributes> <origin> <size> <name> <text id> (cursor id) (cursor origin)~;

where "st" is type; "91" length; and the structure is defined as below.
"Attributes" of a field define ways in which the user interacts with RS 400 at a rudimentary level. Three basic field type~ are supported: (1) unprotected fields into which users may enter data; (2) protected fields into which user~ may position the cursor, function and enter keys, but may not enter data; and (3~ skip fields which are inaccessible to the user keyboard.
Additional attributes which may be specified for a field include: numeric input only (unprotected); alphabetic input only (unprotected); foreground color; and background color. Attributes are encoded in two bytes. The first nibble of the fir~t byte is a hexadecimal number (O - F) that represents the foreground color selection from the in-use palette. The second nibble of the fir~t byte i~ a h~Yadec1~1 number (O - F) that represents the background color selection from the in-use palette. The first nibble of the second byte consists of a set of bit flags which, from left to right, indicate:
bit O if '1' : protect on;
bit 1 if '1' : automatic skip on;
bit 2 if '1' : numeric input only; and bit 3 if '1' : alphabetic input only.
The second nibble of the second byte is reserved to accommodate for expansion of network 10.
Continuing, "Origin" is a three-byte NAPLPS point set (relative, invisible) operand that defines the lower left corner of the field; "Size"
is a three-byte NAPLPS point set (relative, invisible) operand that defines the upper right corner of the field; "Name" is a one-byte name assigned to the field 90 that it may be accessible to programs; "Text id" is a one-byte id of the text characteri~tics to be associated with the field (e.g., size, gapping, proportional spacing, etc.); "Cursor id" is a one-byte id of the cursor type to be associated with the field; "Cursor origin" is a three-byte NAPLPS operand specifying relative draw point to the cursor, if this operand is not present, the cursor origin point will be assumed to be the same as the field origin point.

~ 1337132 Field definition type 2 segments 548 are provided to enhance run-time flexibility of fields. Field definition type 2 segment structure i9 a9 follows:

~<st> <sl> <attributes> <origin> <size> <name> <text id> <cc 11> ~<cursor id>
(cursor origin)) <# hot spots> (<hs 11> <hssize> (hsorigin)) ... (<cg 11>
<cgraphic id> <cgmode> (cgorigin)) ...]:

where structure is defined below. As with the other segments, "st" describes segment type, and "91" segment length. Further, "Attributes" describe how the user and RS 400 interact at a rudimentary level. Attributes for field definition type 2 segments 548 are contained in four bytes:

Pyte 1 Field type bit O T~OL interpreter indicator:
no fire; or fire bits 1-7 Interaction type input (unprotected);
action (protected);
display (askip); and hidden (dark) Byte 2 Text Attributes (bit flag~) bits 0-7 left justify;
right justify; and word wrap 3yte 3 Data Type:
bits 0-7 alphabetic;
numeric;
password;
~yte 4 Color:
bits 0-3 foreground color;
bits 4-7 background color.
"Origin" is a three-byte NAPLPS point set (relative, invisible) operand that defines the lower left corner of the field. "Size" is a three-byte NAPLPS point set (relative, invisible) operand that defines the upper right corner of the field. "Name" is a one-byte name a~signed to the field so that it maybe accessible to the program. "Text id" is a one-byte id of the text characteristics to be aqsociated with the field, such as size, gapping, proportional, etc. "cc 11" is the cursor length; a one-byte field describing the combined length of the cursor id field and the Cur~or origin field. If the length contains a 1, then the cursor origin operand is not present, in which case, the curSor origin defaults to the field origin point. "Cursor id" is a one-byte id of the cursor type to be associated with the field.
"Cursor origin" iq a three-byte NAPLPS operand specifying the relative draw point of the curqor. If this operand is not present, the cursor origin point will be assumed to be the same as the field origin point. "# hot spots" is ~ 13S11~2 ~ , the number of hot spots used by this field. "Hot spots" refers to a set of coordinates that will be selectable by a pointing device, such as a mouse If the contents of this field are zero, the hot spot for the field will be assumed to be the coordinates that are covered by the custom cursor. "Hot spot sets" facilitate assigning a variable number of hot spots to a field.
Each hot spot is described by a set of operand consisting of hot spot length, origin, and size. Each set of such operand describes one hot spot. When using multiple hot spots, multiple sets of operand must be present. "hs 11"
or hot spot length is a one-byte binary field describing the length of the hot spot coordinates for a hot spot "instance." If this byte contains zero, the hot spot origin and size default to the coordinates described by the custom cursor. If this byte contains 3, then the hot spot origin point will not follow, but will default to the custom cursor origin point. If this byte contains 6, then both the hot spot origin and size are present. "Hot spot size" is a three-byte NAPLPS x,y coordinate describing the top right corner of the hot spot. "Hot spot origin" is a three-byte NAPLPS x,y coordinate describing the lower left corner of the hot spot. If th^ hot spot length is equal to 3, this field is not present. In that case, the hot spot origin point defaults to the origin point of the custom cursor (which may have also defaulted to the field origin point). If the hot spot length is equal to 6, then thi~ field is present. A custom graphic operand set contains four operand each of which is given in the Field Definition Segment as shown.
Particularly: "cg 11" is the custom graphic set length, which, if 2, then no custom graphic origin is present. In that case,the origin point of the custom graphic defaults to the field origin point; ~cg id" is the custom graphic id, a one-byte identifier of a custom graphic string; "cgmode" is the custom graphic mode, which is one byte used to describe variable conditions that apply to the graphic. Defined values include: x'Ol : blink; x'02 dynamic; x'03 : permanent; and "cgorigin" is the custom graphic origin, a three-byte NAPLPS x,y coordinate indicating the lower left corner of the custom graphic. If this operand is not present, the lower left corner will default to the field origin point.

ARRAY DEFINITION SEGMENT
Array definition segments 548 define the names and relative locations of field~ in a row that makes up an array or table. The first row of fields must have been defined using field definition segments 516. The array definition provides a short hand for specifying the replication of selected fields from the initial page. The structure of the array definition segment 548 is as follows:

[<st> <91> <#occurrences> <vertical gap> <field name> ...];

where "st" is type, "91" length; ~'#occurrences" is a one-byte field describing the number of rows to be generated to create the array (the first row is assumed to be generated from field definition segments 516); "vertical gap" is a NAPLPS point set operand (relative, invisible) containing the DY
of inter-row spacing; and "field name" is a one-byte name (from the field definition) of the fields in a row of the array.

133713~
~ CUSTOM GRAPHICS SEGMENT
Custom graphics segment 550 provides a means to package graphics commands. These graphics commands may be related to a field and initiated based on run-time conditions. The structure of custom graphics segment 550 is as follows:

[<st> <sl> <id> <size> <NAPLPS>];

where "st" is type; "91" length; "id" iY a one-byte identifier for this custom graphic; "size" is a three-byte NAPLPS operand specifying upper right corner of the graphic area in a relative mode; and "NAPLPS" are NAPLPS
commands to paint the custom image.

CUSTOM CURSOR SEGMENT
Custom cursor segment 512 allows fancy graphics to be associated with cursor positioning in a field. Using this segment, cursor may be defined to any size or shape and may be placed at any desired location relative to their associated fields. The structure of custom cursor segment 512 is as follows~

t<9t> <sl> <id> <size> <NAPLPS>];

where "st" is type; "91" length; "id" is a one-byte identifier for this custom cursor; "size" is a three-byte NAPLPS operand specifying upper right corner of the cursor area in a relative mode; and "NAPLPS" are NAPLPS
commands to paint the custom image.

Custom cursor type 2 segment 552 allows cursor to be defined to any size or shape and may be placed at any desired location relative to their associated fields. The structure of custom cursor type 2 segment 552 is as follows:

[<st> <91> <id> <size> (<11> <NAPLPS>) ..... ];

where "st" is type: "sl" length; "id" is a one-byte identifier for this custom cursor; "size" is a three-byte NAPLPS operand specifying upper right corner of the cursor area in a relative mode; "11" is the length of the following NAPLPS data; and "NAPLPS" are NAPLPS command~ to paint the custom image.

CUSTOM TEXT S~GMENT
Custom text segments 514 allow the definition of custom display of text within a field when non-standard character field size is used (20 x 40 display characters is standard) or custom spacing, movement, or rotation of characters is desired. The structure of custom text segments 514 i~ as follows:

r -~ ~ 337 1 3~
.~ , <st> <ql> <id> <NAPLPS>];
-where "st" i9 type; "~1" length; "id" iA a one-byte identifier for this TXT
command; and "NAPLPS" are NAPLPS commands specifying character field size, rotation, movement, inter-row and inter-character text gaps.

INVENTORY CONTROL SEGMENT
Inventory control segment is provided to facilitate management of objectq. The inventory qegment is structured:
[<st> <sl> <type> <inventory number> (sub-number)];

where "st" is type; "91" length; "type" is a one-byte indicator qhowing object usage as follows: 0 5 no defined use; 1 = leader ad; 2 = ad campaign completion; 3 = leader ad completion; 4 - 255 = reserved for future uqe);
"inventory number" iq a unique two-byte number to be used for inventory control and statiqtics; and "sub-number iq the same as inventory number.

NETWORR MESSAGES
In addition to the network objects, and the diqplay data, control data, and the program inqtructions they contain as previously described, network 10 also exchanges information regarding the support of uqer seqsions and the maintenance of the network as "messenger". Specifically, mes3ages typically relate to the exchange of information associated with initial logon of a reception system 400 to network 10, dialogue between RS 400 and other elements and communications by the other network elementq amongst themselveq.
In accordance with the i~vention, to facilitate meqsage exchange internally, and through gateway 210 to entities externally to network 10, a protocol termed the "Data Interchange Architecture" (DIA~ is used to support the transport and interpretation of information. More particularly, DIA
enables: communications between RS 400 units, separation of functions between network layers 100, 200, 300 and 401; consistent parsing of data; an "open"
architecture for network 10; downward compatibility within the network;
compatibility with standard industry protocols such as the I8M System Network Architecture; Open Systems Interconnections standard; support of network utility qeqqions; and standardization of common network and application return codes.
Thus DIA binds the various components of network 10 into a coherent entity by providing a common data stream for communications management purpoqeq. DIA provide~ the ability to route me~qageq between applicationq based in IBM Syqtem Network Architecture (SNA), (well known in the art, and more fully described in Data and ComPuter Communications, by W. Stallings, Chapter 12, McMillian Publishing, Inc. (1985)) and non-SNA reception system applications; e.g. home computer applications. Further, DIA provides common data structure between applications run at RS 400 units and applications that may be run on external computer networks; e.g. Dow Jones Services, accessed through gateway 210. As well, DIA provideq support for utility sessions between backbone applications run within network 10 aq deqcribed hereafter.
In make up, DIA is a blend of SNA and non-SNA based modes, and thus 1 3 3 7 ~ 3 ~

provides a means for combining the differences between these modes within network 10. Accordingly, the action of DIA differs depending on whether DIA
is operating within an SNA portion of network lO or whether it is operating within the non-SNA portion of the network. More specifically, within the SNA
portion of network lO, DIA and its supporting programs may be considered "applications" facilities. In this context, DIA resides at the transaction services level of SNA, also known as the Specific Application level of Open Systems Interconnections ~OSI, also discussed in chapter 12 of Data and Computer Communications by W. Stallings above noted). However, in either case, it is a level 7 facility.
Within non-SNA portions of network 10, DIA and its supporting programs provide routing, transport, sessions, and some transaction facilities. Thus DIA provides a comprehensive network architecture providing OSI level 3, 4, 5 and 7 services.
In accordance with the invention, DIA facilitates "utility se~sion"
within network lO. Utility sessions allow partner applications to communicate by means of the single session established between two logical units of the SNA type. In order to reduce the number of re~ources which must be defined to the network support programs, many user messages may be passed to many different application destinations through logical unit to logical unit (LU-LU~ "pipes".
Applications exist on either side of the LU-LU pipe which act to concentrate outbound messages en route to applications resident on the other side of the LU-LU pipe; distribute inbound messages to local applications;
and maintain and manage application task boundaries. Users may enter into a conversation with a set of transactions, refined to tasks, which are hereafter noted as "user sessions", and the boundaries of these user sessions (tasks) are indicated by begin session/end session flags.
Another application function supported by DIA is the routing of messages between nodes of network lO. Particularly, a switching application will route messages to the appropriate LU-LU session for transmission to another mode by eYAmining and resolving the DIA destination IDs hereafter described.
In accordance with the invention messages conforming to DIA are composed of two functional parts: message headers and message text. Message Headers are transparent to most applications, but are the primary vehicle for pasling information for session layer to session layer or transport layer to transport layer communications. Further, Message Text which is processed by end users, and is transparent to session and transport mechanisms.
In order to reduce program complexity and facilitate maintenance and enhancements, DIA has been structured in a layered fashion. In this regard, the DIA-defined data which flows through network lO consists of a set a headers preface the end-user to end-user me~sage text. Further, as in the case of objects, me~sages are organized in a family of types based on the specific form of its header. Particularly, there are "FMO" headers which contain routing and control information; FM2 headers which contain transport level information; FM4 headers which contain gateway information; FM8 headers which obtain information for secondary routing; i.e. messages passed through from node to node; FM9 headers which contain network management information;

3i 132 and FM64 headers which contain application-to-application management information, where, for example, applications running at RS 400 need be rendered compatible with applications running on an external computer connected to network 10 through a gateway 210.
In order to provide SNA compatibility, the first two bytes of all DIA
FM headers are formatted such that byte 1 defines the length of header in hexadecimal; and byte 2, bit 0, identifies whether co;.catenation is provided or not; e.g. if bit 1 - 0 no other headers follow, but if bit 1 5 1~ then the current header is followed by a concatenated header; while bits 1 - 7 identify the header type in hexadecimal value.
As will be appreciated to those skilled in the art, this layout is the same as that of SNA Function Management Headers. In an SNA LU0 implementation the DIA FM headers may be treated as SNA Function Management Headers (FMHs). Alternatively, the DIA FMs may be treated as pure data within the SNA Request Unit (RU).
With regard to destination routing, the basic premise of DIA is that each message flowing through network 10 carries a DIA header (FM0) that identifies its source and destination idA. Accordingly, switching applications exist which map destination ids to resources and route messages appropriately. In accordance with the invention, in order to send a reply, the recipient application simply swaps the content of the destination and source id fields and return message.
In the context of DIA the totality of ports, devices, and programs which are managed by a particular Switch and defined as destinations, are referred to as "regions~. In this regard, each Switch; i.e. server 205 or cache/concentrator 302 shown in FIG. 2, need only be aware of the destination ids of resources within its own region and of the destination ids of switches resident in immediately adjacent nodes. Since server 205 is the central hub within the network 10 for application message routing, messages destined for end-users unknown to a switch are routed toward server 205 for eventual resolution. Destination id naming conventions then enable server 205 to determine the appropriate switch to which the message should be forwarded.
Particularly, "destination id" fields ~regions" and "unit" are used for this purpose.
Concerning switch responsibility, a switching application has three primary responsibilities. It must forward messages to adjacent switches.
It must collect messages from, and distribute messages to resources within its own region. And, it must maintain and manage application task boundaries. Users may enter into a conversation with a set of transactions.
This set of transactions is referred to as a "task". These tasks are called user sessions. Further, the boundaries of these tasks are indicated by begin session/end session flags.
In order to fulfill these functions, a resource definition facility must exist for each switch to map each addressable resource to a destination id. In some cases, particularly on the RS 400, it may be desireable for an - application to dynamically define subordinate resources to the switch and to interact with the switch to generate unique destination ids for these subordinate resources. It may also be necessary for the switch to either communicate with, or act within an application subsystem. An example of an , . , ~ 1337132 application subsystem is the Customer Information Control System, ~CICS) ~ event, where CICS is a commercially available transaction proce~s controller of the I3M Company, well known in the art. CICS, although subordinate to the operating system, is responsible for initiatinq and managing application "transaction" programs. Routing to specific transactions under the control of an application subsystem may be accomplished by a ~econdary address. In this case, the subsystem is defined as the primary destination. The transaction is defined as the qecondary destination. A switch must only route incoming messages to the subsystem. The subsystem in turn posts to, or initiates the desired transaction.
The use of secondary addressing provides several advantages Particularly, switch resource tables are not affected by the coming and going of "transaction" applications. Further, since the DIA headers are SNA
compatible, Type 1 application such as CICS need ha~e no special message routing functions. A switch configured in accordance with the I~M standard VTAM could route incoming messages to CICS. Still further, tran~actions need not go into "receive loops". It is possible for the subsystem to poll on behalf of many transaction programs. In accordance with DIA, secondary addressing is implemented within the application data stream. For instance, CICS transaction ids are, by convention, to be found in the first four byte~
of application text.
With regard to the standards for DIA, it will be recalled that DIA
messages have a header followed by the message information. In the preferred embodiment, the DIA headers may be concatenated to one another. Further, the presence of concatenated headers is indicated by the setting of the first bit (bit O) of the Header Type field.
However, there are two restriction~ on the use of concatenated headers.
Particularly, concatenated headers are required to be sequenced in ascending order left to right by header type number~ and secondary message text prefaced by concatenated headers (such as FM64 architecture message text) are not permitted to span across message block.
The basic structure of all DIA headers is presented below. As presented, "<>" indicate mandatory elements, "()" indicate optional elements an "..." indicate repeat allowed. Further, the "FMX" designations refer to the message header types previously identified and "TTX denotes TRINTEX, the former name of the network developer.
The basic DIA header structure is:

[<Length> <Concatenation flag> <Type> (FM defined data)].
For TTX application-to-application messages, the structure is:
[(<FMO> (FM2) (FM8) (<FM64> (64text)~ ... (Appl. Text))].

For TTX application-to-gateway application messages, the structure is:
[(<FMO> (FM2) (FM4) (FM8) (<FM64> (64text))..... (Appl. Text))].

For TTX me~sage to TTX network management, the structure is:

[(<FMO> FM9> (9text)>... )].

s Finally, for internal TTX Switch to Switch messages, the header structure is:

[(<FM0> (Appl. Text))], where the FM0 function code i9 2x or Cx.
Continuing, the general rules of implementation for DIA messages in the preferred embodiment are a~ follows. All inter-messages are prefaced by a single FM0. Further, other header types can be optionally concatenated to the FM0. Also, headers should occur in ascending order by header type; i.e.
FM0, FM2, FM4, FM8, FM9, FM64. Header and text length values are carried as binary values. Numeric fields contained within DIA headers are carried with the most significant values in the left-most byte~s).
Further, long gateway messages (greater than lK bytes including headers) are sliced up into blocks. This segmentation is indicated by the presence of the FM2 Header. In the preferred embodimen~, the current block number of the FM2 must be correctly set because it acts as a sequence number and provides a means to guarantee me~sage integrity. In this regard, the total number of blocks field must be set correctly when sending the last block of a logical message. Receiving programs can determine end of message by testing block number = total number blocks. If the sender cannot pre-determine the total number of blocks in a beginning or middle of message block, the sender must place binary zeros in the total number of blocks field.
Still further, in the preferred embodiment, FM9 archltected text may not span message blocks and may not be longer than 255 bytes. Additionally, FM64 architected text may not span message blocks and may not be longer than 512 bytes long. Yet further, only a single instance of FM2 and/or FM4 can be present in a message block. And, messages using FM9 or FM64 headers must be less than lK bytes, and these messages should not be segmented into blocks.
Continuing with the DIA implementation rules, FM0 and FM2 must be present in each block of a multi-block message when being transported within the network system. Normal application message flow consists of a request/response pair. In normal processing, reception system applications send requests to host applications. Host applications return respon~es to these requests. The Reception System application initiates this dialogue.
Sending nodes are responsible for inserting the proper "source id" (SID) and "destination id" (DID) into the FM0. Additionally, the co~munications manager (CM) of the reception syYtem further described hereafter, acts on behalf of reception system transaction programs. Messages destined to the CM should be considered systems messages (FM0 FUNCTION = Cn). Messages destined to subordinate transactions on reception system 400 should be considered applications message (FM0 Function=On). Receiving nodes are respon~ible for swapping SID and DID contents when returning a response.
Still further, intermediate nodes (with the exception of CICS switches and Gateways) need only be aware of FM0 and FM2 headers when routing messages to other destinations. CICS switches must be cognizant of all header layouts so that they can find the displacement to the transaction id which is ~ ` 1 SS7 1 S~
~

contained within the first four bytes of application text. And server qwitch 205 provideq a facility which allows responses to requests to be deliverable for at least a min~ m period after the reque~t wa~ qent, e.g., one minute.
Finally, the preferred embodiment, CICS switcheq pass all DIA FM
headerq on to their qubordinate applications. The applicationq are then reqponsible for returning the headerq (with the SID/DID swap) back to the qwitch for responqeq. Both fixed length and variable length meqqage headers are supported by the DIA. It must be noted that variable length headers are designed qo that only the laRt field within the header is variable in length.
With regard to mode of conversation under utility sessions, the!qerver switch 205 may engage in multiple ses~ions with an external CICS. Messages originating from network users may be routed through any of these seqqions.
Userq are not forced to use the same utility sesqion pipe for each message outbound to CICS. Pipes may be qelected dynamically based on loading factors. In a switch-driven environment CICS tranqactions may typically be initiated by meanq of qtart commandq from the switch. In this arrangement, CICS transactions will paqq outbound data back to the switch through a queue.
In accordance with DIA, the potentially dynamic nature of converqation routing dictateA that CICS transaction programq not be written in a converqational mode. Rather, the transaction programq are preferably either pqeudo-conversational or non-conversational. In this regard it should be noted that conversational transactionq send a message and wait for a reply, and non-conversational tranqactions send a message and expect no reply. In the case of pseudo-conversational tran~actions, a meqsage is sent, but no reply iq expected. However, such meqsages are coded so as to be able to accept user input in various stages of comple~ion, thuq mimicking conversational tranqactions.
As will be appreciated by thoqe skilled in the art, communications may arise within network 10 that do not require the standards applied to DIA
messages. However, non-DIA messages are allowed in the DIA structure.
Particularly, non-DIA mesqageq are designated by setting the length portion of the header (i.e., the first byte) to binary zero.
Considering header layout, and with input first to FMO headerq, it should be noted that the FM0 header provides routing information to both intermediate and boundary qwitcheq. In addition the FM0 contain~ control fields which allow the sending application (which may be a switch) to communicate information to the switch which "owns" the destination application. When an originating application wisheq to converse with an application resident on the other side of an utility seqsion it must initially paqs an FM0 header with a function code representing an "begin session" to itq controlling switch. The begin seqqion code requests the as~iqtance of any intervening switches in the establishment of an application session between the requestor and the destination application specified in the DID.
When either application sesqion partner wishes to terminate its converqation the qession partner must pass an FM0 header to its switch, specifying either a function code representing an "end session", or "end session abnormal", or "request terminate". These function codeq requeqt the assistance of any intervening switches in the termination of the application 133i~3~
session between the requestor and the destination application specified in the DID. In this arrangement an end session function code is unconditional and does not require an acknowledgment. An end session abnormal function code is unconditional and does not require an acknowledgment. And, a request terminate function code i9 conditional and requires a positive acknowledgement. The positive acknowledgement to a request terminate is an end aession. The negative acknowledgement to a request terminate is a function code representing "status Message".
Further, "status/return" function codes "system up", "system down", "echo", "system message" are used by corresponding applications in different regions of network 10 to determine application availability and user session status. Function codes are also used to designate end-to-end user message classes of service. These classes of service refer to a delivery requirement classification and are distinguished from SNA COS. Network class of service allows application~ to specify whether or not responses to requests can be delivered after the ~tandard timeout of server 205 has occurred.
In accordance with the invention, the DIA headers are arranged in a predetermined form base on their function. More particularly, FM0 headers, also known as Type "0" headers are required for every message within the network. Header Type 0 provides information necessary for routing and message correlation. Its fields include:

Header Length - Length of header data including length field.
Header Type - Bit 0 is header concatenation flag.
Bits 1 - 7 indicate current header type.
Function Code - Contains message function.
Data Mode - Indicates attributes of message data.
The "response expected" bit should be turned off if no respon~e is expected, for instance, when sending the response to a request.
Source Id - Identification of end-user sending current message.
Logon Sequence - number which in conjunction with source id Number provides unique identification of source when source is reception system 400.
Message - used to correlate requests and responses.
Sequence Number Destination Id - Identification of message destination.
All messages are routed by destination id.
When responses to messages are sent back to original so~rce, the source id and destination id fields must be swapped.
Text Length - length of all remaining data in the message to the right of this fields. (Includes length of concatenated headers if any are present~.
The layout for the Type 0 header is as follows:
Header Type 0 layout:
Byte 0 Header Length (hexadecimal~
Byte 1 Header Type S`~ 133713~
bit 0 no other headerq pre~ent; or concatenated header pre~ent bit.q 1-7 current header type Byte 2 Function Code; i e.
Application meqsage ~Claqq of Service) Statuq/Return Code meqsage Begin Seqqion End Se~qion (normal~
End Session (error~
Clear Request (reque~t terminate~
Syqtem up Syqtem Down Echo System Message Prepare to bring System Down 3yte 3 Data Mode (bit flags~
bits 0-7 Compaction;
Encription;
Reqpon~e Expected;
Reqpon~e;
Un~olicited Meqsage;
Logging required:
Timeout Mes~age Required;
Reqerved;
Byte~ 4-7 Source ID
bits 0-7 Region ID (hexadecimal~
bits 8-19 xxxx xxxx xxxx Unit: Source application id if in Application mode xxxx xxxx xxxx Unit: Source Concentrator unit if in Reception Syqtem mode bitq 20-23 xxxx Id Mode e.g.
Reception mode Reception mode Server 205 Application mode Server 205 Application mode Cache 302 Application mode Reserved bits 24-31 xxxx xxxx Sub-unit ID (hexadecimal~
Byte 8 Logon Sequence Number (hexadecimal) Byte 9 Meqqage Sequence Number (hexadecimal) 3yteq 10-13 De~tination ID
bits 0-7 Region ID (hexadecimal~
bitq 8-19 xxxx xxxx xxxx Unit: Destination application ID
if in Application mode xxxx xxxx xxxx Unit: De~tination Concentrator 33713~
if in Reception System mode bits 20-23 xxxx Id Mode; e.g., Reception mode Reception mode Server 205 Application mode Server 205 Application mode Cache 302 Application mode Reserved bits 24-31 xxxx xxxx Sub-unit ID (hexadecimal) Bytes 14-15 Text Length.
With regard to FM2 or Type 2 messages, when an application is transmitting a large message, the sending application or its controlling switch can slice up the message into a num~ber of smaller messages. The FM2 message header is used to indicate how these smaller messages can be reassem.~bled into a single logical message by the receiving application or its controlling switch.
In preferred form, the r~xl logical message size is 64K. The r~l message blook size is lK including all headers. Block sequence numbers in the FM2 range from 1 to a r~l lm of 2S5. And a single block message will be sequenced as block 1 of 1 in the FM2.
When network objects are large (greater than lK bytes) they are sliced up into smaller blocks. Each object block is prefaced by an "object block header". Object block headers are found in the application text portion of a message. Object block headers provide sequencing information to cache/concentrator 302. The presence of an object block header does not obviate the requirement for an FM2 DIA header, except in the case of messages from the cache/concentrator down to RS 400. Both an object block header and a FM2 may be present in a message. Sequence num~bering within object block headers ranges from 0 to 255. A single block Object will be sequenced as block 0 of 0.
Messages larger than lK are subdivided into lR blocks when being transmitted between the server switch 205, cache/concentrators 302, and reception systems 400.
Header Type 2 (FM2) message header contain information about this dividing of large messages and is useful when re-constructing large messages.
The fields for an FM2 message header are as follows:
Header Length - length of header data including length field.
Header Type - Bit 0 is header concatenation flas.
Bits 1 - 7 indicate current header type.
Number of - total number of blocks used to transmit the Blocks logical message. If the total number of blocks cannot be determined at the time the first or middle blocks of a message are being sent, this field may be set to zero.
The last block of a message must contain the correct total number of blocks.
Block Number - number of the current mes~age block being transmitted.

337 ~ 32 The layout for a Type 2 header is as follows:
Byte 0 Header Length (hexadecimal) Byte 1 Header Type bit 0 no other headers present; or concatenated header present bit~ 1-7 current header type Byte 2 Number of Blocks (hexadecimal) Byte 3 Current Block Number (h~a~eci~
With regard to FM4 type header~, also referred to as Type "4", these headerA have been designed for communication~ between network gateway interface applications and external computer system~. For Type 4 Headerq, the fields are as follows:
Header Length - length of header data including length field. ---Header Type - Bit 0 iA header concatenation flag.
Bitq 1 - 7 indicate current header type.
Network User - a seven byte field containing the internal ID of the network user on whose behalf a conversation is being held with the external computer system.
External Data - Reserved Mode Correlation Id - a field reserved for use by the external computer syqtem. The contents of this field will initially be set to zero when a conversation iA initiated across a gateway.
The external system may then set the contents of thiq field to any value desired.
Sub~equent messages originating from TTX
within he bounds of a virtual subscriber to external host session will echo the contents of the Correlation Id field back to the external system.
The layout for a Type 4 header is aq follows:
Byte 0 Header Length (hexadecimal) --Byte 1 Header Type bit 0 no other headers present; or concatenated header present bits 1-7 current header type Byteq 2-8 Network Uqer Id (ASCII) Byte 9 External Data Mode 0000 0000 ReAerved Bytes 10-n Correlation Id (binary, max length=8 bytes).
Next are FM8 or Type 8 headers. Type 8 headers have been deqigned to provide secondary routing destinations. Their fields are as follows:
Header Length - length of header data including length field.
Header Type - Bit O.is header concatenation flag.
Bits 1 - 7 indicate current header type.
Secondary - a symbolic name representing the ultimate Destination - deqtination,for the message.
The layout for Type 8 header is:

~-' 1337l32 ayte 0 Header Length (hexadecimal) Byte 1 Header Type bit 0 no other headers present; or concatenated header present bits 1-7 current header type Bytes 2-9 Symbolic Destination Name For FM9 or Type 9 headers, the header has been designed to communicate to a VTAM application which provides variouq network management support functions. More specifically, the VTAM application has been developed in order to provide a general network management interface which both supportq the network (by means of the DIA) and qimplifies its maintenance.
Additionally, VTAM application provides data transfer and remote command functions, the ability to write to, and read from, a centrally located and maintained database in order to archive statisticq and other inter-network messages, and formatting of binary data into Hexadecimal Display.
In the case of Type 9 headers, the fieldq are:
Header Length - length of header data including length field.
Header Type - Bit 0 is header concatenation flag.
Bits 1 - 7 indicate current header type.
Function Code - indicates general message type.
Reason Code - indicates message content.
Flags - indicates application action to be performed.
Text Length - indicates length of subsequent text message.
(Not including possible concatenated headers) The layout for type 9 headers is:
Byte 0 Header Length (hexadecimal) Byte 1 Header Type bit 0 no other headers present; or concatenated header present bits 1-7 current header type Byte 2 Function Code; e.g.
Command Statistics 3S Alert Control Byte 3 Reason Code Backbone Alerts Message Reception-originated Alerts Message Byte 4 Flags bits 0-3 Store by Key - 8 char. name follows;
Retrieve by Key - 8 char. name follows;
Data i~ Binary;
Data is ASCII;
Data is EBCDIC
bits 4-7 Reserved Byte 5 Text Length if Flags = 1... or .1.. then chars 0 - 7 should be the storage key. It is 1 3371 3~

recommended that record storage keys initially be the same as the Resource Name to which the data pertains.) In the case of FM64 or Type 69 headers, the headers are used to transmit error and status messages between applications. Intermediate nodes need not examine the contents of the FM64 headers except in the case of the CICS switch which must obtain the displacement to the application text. If applications subordinate to an application subsystem are not available, the subsystem would strip the application text from the message, concatenate an FM64 message to any other headers which are present in the inbound message, and return the message to its original source.
Header Type 64 has been designed for the communication of status information between users, and prefaces architected message text. The fields for Type 9 headers are:
Header Length - length of header data including length field.
Header Type - Bit 0 is header concatenation flag.
Bit~ 1 - 7 indicate current header type.
Status Type - indicates type of status communicated such as status request or error.
Data Mode - indicates whether message text is ASCII or EBCDIC
Text Length - Length of subsequent message text (Not including possible concatenated headers).
The header Type 64 layout is:
Byte 0 Header Length (hexadecimal) Byte 1 Header Type bit 0 no other headers present; or concatenated header present bits 1-7 current header type Byte 2 Status Type Information Status Request Error Terminate Byte 3 Data Mode; e.g., EBCDIC
ASCII
Binary Bytes 4-5 Text Length In accordance with the invention, it has been determined that in some cases it is desirable to pre-define certain application level message formats so that they may be consistently used and interpreted. The following discussion is devoted to architected message text formats which are processed at the application level. For FM9 me~sage text, in order to accommodate "Reliability Serviceability Availability" (RSA) functions within network 10, a fixed format for "alerts" is defined in the preferred embodiment.
Particularly if it is defined as message text following an FM9 header. The FM9 Function Code Alerts Message would be as follows:
Byte 0 Reserved value 1337~3~

Byte 1 Syqtem Origin Byte 2 Internal/External flag Byte 3-5 Me~qage Originator Byte 6-9 Me~qage Number Byte 10 Severity indicatori e.g.
~rror Information Severe Error Recovery Succe~qful Warning Byte 11 Reqerved value Byte 12-14 Error Threshold.
For FM64 meqqage text, the application meqsage text i~ alwayq prefaced by the appropriate header which indicate~ whether meq~age text iq ASCII or EBCDIC.
The FM64 me~Aage text fieldq are aq follow~:
Action Field - indicate~ type of operator or application action to be performed Module Name - Sending application Id Format of thiq field i~ SSSTnnnn where SSS ~ ~ender initial~
T ~ type O = Network standard for all gatewayq 1 - non-itandard, gateway specific nnnn - Sender Site number Reference - Number as~igned by ~ender for reference Number This number iR used to indicate specific error code~ if the meq~age iq an error mes~age (FM64 qtat type 8).
Thi~ number i~ uqed to indicate ~pecific commandq if the me~qage i~ a qtatui reque~t (FM64 qtat type 4).
Text - Alphanumeric (Printable) text.
The FM64 Meqqage Text layout is:
Byte 0 Action Field (alphanumeric), e.g., Action Deci~ion Information Wait Byteq 1-8 Module Name (alphanumeric) Byte~ 9-12 Reference Number (display numeric) Default request uqer ~tatu~
uqer active u~er inactive u~er inactive - retry after interval store in u~er mailbox cache to ~erver link failure requeqt appl statuq ~ 133~ ~2 ~, server to host failure appl active appl inactive ' appl inactive - retry after interval message was undeliverable response was timed out syncpoint checkpoint delay appl. error codes Bytes 13-n Text (alphanumeric).
Turning next to co called "Backbone States", as will be described below, application sessions may be used as pipes for user transaction traffic. In this regard, it is desirable to establish a set of protocols to be used between originating users and destination users. Further it is important for intermediate nodes to be aware of the status of connectivity with adjacent nodes and specifies some actions to take when messages are known to be undeliverable.
In this context, it is to be noted that the "system up" message is used to signal the start of application traffic between the switch applications.
The originating application transmits an FMO with a system up function code and response expected. The receiving application swaps the SID/DID, sets the Response bit on, and returns the message. If the receiving application is not available no response wiIl be returned and the message will time out.
In the case of "system down" messages, the message is used to prepare the termination of the session between switch applications. The originating application transmits an FMO with a session down function code and response expected. The originating application sends an FM64 with "status type~terminate", and data mode=E8CDIC. FM64 text follows the header with "action field"=A (Action), "module name"=SSSxOnnnn, "reference number"=O, Text-( (timestamp=HHMMSS), Number of current users = NNNNN). The intended result is that the originating application will not accept any messages inbound to the utility session. The responding application will then have the opportunity to return out-standing responses across the utility session.
The responding application then returns an FMO with System Down back to the originating application.
For each "echo" messages, the echo message may be used to determine whether a major application is still available. Specifically, the originating application sends an application message to its gatewayed partner using a FMO with an echo function. The destination application swaps the SID/DID, set the response bit on and returns the message otherwise untouched, thus effecting echo.
For "APPL status request messages, the message is used to determine the status of a major application between nodes.
Continuing, for "unsolicited application status posting" messages these messages are u~ed for transmission of application status messages by unsolicited application (No response expected) across a nodes. For the message, the originating application wishes to post an application status to its partner in another node. This message may be on the behalf of the ~ ~ ~3~13~ -originating application itself or on behalf of another application.
Turning next to user to internal APPL messages, and with regard to "session beginning", it is to be noted these messages n~rmally arise at the start of conversation between a user and an internal application. For them the network user sends an FMO with a "begin session" function code and ~response expected". The responding application swaps the SID/DID, supplies a "correlation Id", and returns both the FMO with the response bit set.
In the case of rejection of a conversation initiation requests, the originating application transmits an FMO with a "begin session" function code and "response expected". The responding application swaps the SID/DID, and returns the FMO with the response bit set as well a~ a function code of "abend" session.
For "applications" messages, these messages normally arise at the middle of conversation between a network user and an internal application.
In this case, the originating user transmits an FMO with an "application"
message function code, and "response expected". The responding application 3waps the SID/DID, sets the response bit on and returns the respon~e.
"End session" messages typically arise in connection with unconditional termination of user/internal application sessions. The originating transmits an FMO with an "end sessions" function code. Here however, no response is expected from the corresponding application.
For an "end session abnormal" message, the message unconditionally terminates an application conversation "abend"
Continuing, "request terminate" messages cause conditional termination of session with an internal application.
For messages concerning "rejection of a request due to link failure", in the case of server 205 to ho~t link, the originating application transmits and FMO with "response expected". The message is intercepted by server 20S which recognizes it as undeliverable. A server 205 application returns the message with an FM64 message after stripping the application text.
For messages concerning rejection of request due to link failure, in the case of communication between the cache/concentrator 302 and server 20S, the originating application transmits an FMO with Response Expected. The message i9 intercepted by the cache/concentrator 302 which recognizes it as 3S undeliverable. A cache/conçentrator application returns the message with an FM64 message after stripping the application text.
For messages concerning "conditional terminate rejected", the me~age i~ issued where a conditional termination of application conversation is not accepted by partner application.
For "user continuity posting" messages, the message is used where the originating application wishes to post the status of a user to its partner application across the gateway 210.
Continuing, for "user continuity requests", the mesqage is used where an external application requests logon status of a particular network user.
4S In the case of "application error" messages, the messages is used where transmission of application error message by responding application is required.
Still further, for "timeout Acenarios", and specifically, "timeout scenario with timeout response required", the 1 337~3 ~

originating user sends an application message to an internal appllcation with "data mode" - "response expected" and "timeout response" required. The originating switch sets a timer for each "response expected" outbound message. If a response is not received before the switch timeout value is reached the switch 205 sends a message with an FM64 header having a "timeout reference~ code to the originating application.
For "response occurs after timeout" messages, the originating user sends an application message to an internal application with "res~onse expected". The originating switch sets a timer for each "response expected" outbound io message. If a response is received after the timeout value is exceeded, server 205 switch routes the message to a server 205 application which may log the message as non-deliverable, ship the message to the user, or drop it ~pen~i ng on the FMO class of service option specified on the original request message.
In the case of "~ m resources scenario" messages, the originating user tran~mits a message to a destined internal application. The destination switch determines that no resources are currently available to support the transmission, and returns the message to the originator, after inserting an FM64 with a "status~error and FM64 text with an "action3wait. The originating user may then retry or take other action.
Finally, the following graphic example illustrates normal message flow.

User Origin Destination APPL
Switch Switch - ---- -________________________ -------------------------------------->I
I I System Up l < _ ______ 1 I System Up RSP l I

________ ____ __ ---- >l I Begin Session (User ~ ) l l C
1 1 I Response User ~ I

-- -- > I
I Begin Session ~User 2) < __________________ l_________________ l 1 1 I Response User 2 1 _____________ _____------ --_-- >
I Application Message User 1 l < >
I Response User 1 ___ __________________________________________________________l I____________________________________________ __________I

~ 1 337 J3~
.. ,~

, l I End Session (User 1) __________________________________________ l ________--_-- >l I Request Terminate (User 2) < ---------- --_______________________ I I I Response User 2 1 --_--____------___------_>l 1 I System Down <----------------__________ I I System Down RSP

Turning next to messages passed over gateways 210, the normal exchange of messages between the network and external parties occurs between two applications; i.e., the server 205 network message handler (NMH). The server Switch 205 ia an application which is written and maintained by network 10 and resides on it. The message handler reside~ on the other side of gateway 210 from network 10 and may be written and maintained by the external party;
i.e., suppliers of information to network 10 such as Dow Jones.
The ~ession between the two applications is used as a pipe for the communications between many network users and a variety of applications external to the network. In this design, the switch server 205 has three primary responsibilities. It must pass network originated messages across the gateway to the network message handler. It must distribute messages returning across gateway 210 to the appropriate network applications or users, i.e. RS 400. Additionally, it must manage the continuity of a network user session with the external service provider. Typically, users enter into a conversation with a set of transactions. This set of transactions is referred to as a task. These tasks are called user sessions.
The boundaries of these tasks are indicated by begin session/end se~sion flag~.
The network message handler also has several responsibilities. It must pass externally originated messages across gateway 210 to the switch server 205 at network 10. It must distributed messages returning across gateway 210 to the appropriate external applications. And, it must be able to communicate the availability of external applications to network switch server 205.
With regard to gateway messages, in the case of "application to application" messages, and for "system up" messages, the system up message is used to signal the start of application traffic between ~witch 205 and the network message handler. The originating application transmits an FMO with function code "sy~tem up", and "re~ponse expected". The receiving application swaps the SID/DID, sets the response bit on, and returns the message. If the receiving application is not available no response will be returned and the me~sage will time out.
Continuing for gateway "system down" messages, the system down message is used to prepare the termination of the session between the switch 205 and the NMH. The originating application transmits an FMO with function code . 40 ~. 133713~
~ ..~, "sesqion down" and "reqponse expected. The originating application sendq an FM64 with "~tatus type"="terminate","data mode"="EBCDIC". FM64 Text follows the header with "action field"s"A" (Action), "module name"3"SSSxOnnnn", "reference number"-"0", "text"~((timeqtamp=HHMMSS), number of current u~erA
- NNNNN). The intended result is that the originating application will not accept any messages inbound to the utility seqsion. The responding application will then have the opportunity to return outstanding respon~es acroqs the utility session. The responding application then returns an FMO
with qyqtem down back to the originating application.
Further, for "prepare to bring sy~tem down" messages, the meqsage is used to prepare the termination of the session between the Switch 205 and the NMH. The originating application transits an FM0 with function code "prepare system down". The reqponding application transmits an FM0 with function code "sesqion down" and "response expected". The responding application sendq an FM64 with "statuA type"~"terminate", "data mode"-"EBCDIC". FM64 Text followq the header with "action field"="A" ~action), "module Name''-''SSSxOnnnn~ "reference number"="0", "text"=((Timestamp=HHMMSS), number of current users - NNNNN). The intended result i9 that the re~ponding application will not accept any meqsageq inbound to the utility qe~qion. The originating application will then have the opportunity to return out~tanding re~ponseq acro~s the utility qesqion. The originating application then returns an FM0 with "~ystem down" back to the responding application.
For "echo" meqqageq, the message may be used to determine whether a major application is still available. The originating application sends an application message to its gatewayed partner using a FM0 with function echo.
The de~tination application swap~ the SID/DID, set the reqponse bit on and returnq the me~qage otherwise untouched.
In the case of "APPL status requeqt", the request is used to determine the qtatus of a major application acro~q the gateway.
Continuing, for "unsolicited application status posting messages, the message iq used for transmisqion of application status meAsages by unqolicited applicationq no responqe expected acros~ a gateway. In this case the originating application wishe~ to post an application qtatu~ to itq partner acroqq the gateway. This message may be on the behalf of the ~-~
originating application itself or on behalf of another application. -~-For network to use "external APPL" mes~ageq, within the ca~e of "begin seosion" me~sages, the message i9 used for normal start of conver~ation between a and an external application. The user, i.e. RS 400 sendq an FM0 with function "begin session" and ~'response expected", aq well aq an FM4 with null value in the "correlation id". The responding application swapq the SID/DID, supplieq a Correlation ID, and returns both the FM0 with the response bit set and the FM4.
For rejection of a conversation initiation request, the originating application resident application, transmits an FM0 with function Begin Session and Response Expected as' well as an FM4 with NULL value in the Correlation ID. The re~ponding application swaps the SID/DID, and returns the FM0 with the response bit set as well as a function code of ABEND
se~qion. The responding application also returns the FM4.
Further, for "applications" mesqage, the message is used for normal r I ~ 3 1 1 ~ 2 _ middle of conversation between a network user and an external application.
The originating user transmits an FM0 with function code "application"
message, and ~'response expected". It also supplies the TTXUID and the correlation id received on the begin session response back to the correspondinq application across the gateway. The responding application swaps the SID/DID, sets the response bit on and returns the FM0 and FM4.
For "end session" message, the message is used for unconditional termination of user/external application sessions. The originating user transmits an FM0 with function code "end session", no "response expected". Additionally it sends an FM4 containing the TTXUID and the echoed "correlation id" in an FM4.
No response is expected from the corresponding application.
For "end session abnormal" messages, the message is used for unconditional termination ABEND of gatewayed application conversation.
In the case of "request terminate", the message is used for conditional termination of user session with an external application.
For "conditional terminate rejected" messages, the message is used for a conditional termination of application conversation not accepted by partner application across a gateway.
For "user continuity posting" messages, the message is used where the originating application wishes to post the status of a user to its partner application acro~s the gateway.
In the case of "user continuity" request, external application requests logon status of a particular user, i.e. ~S 400.
For "application error" messages, the message is used for transmission of application an error message by responding application across a gateway.
In the case of "delayed response" messages, the originating application sends an application message to its gatewayed partner using the mln;~-lly a FM0 and a FM4 FM64 may be present. The destination switch signals an application on the originating side that the response may be slow by sending a FM0 with function code "status/return", the response bit is not set. The FM4 is returned, and an FM64 "status", FM64 text "Action"="Information" is also sent. Slow response may be due to a num~ber of factors such as function shipping requirements or many I/Os. In parallel, the gateway partner application processes the message according to normal flow.
For "timeout scenario", the originating user sends an application message to an external application with "response expected". The switch server sets a timer for each "response expected" outbound message. If a response is received after the timeout value is exceeded, the TPF switch routes the message to a TPF application which may log the mes~age as non-deliverable, ship the message to the user, or drop it depending on the FM0 class of service option specified on the original request message.
For the llm~ m resources scenario" me~qage~, the originating user transmits a message to a destined external application. The network message handler determines that no resources are currently available to support this transmission. The network message handler returns the message to the originator, after inserting an FM64 with a "Status"="Error" and FM64 text with an "action=wait". The originating user may then retry or take other action.

~337132 Finally, an example illustrates normal message flow. NETWOR~
Bxternal I User SERVER 205 TMH APPL

_____--_------------------>l l I ' I System Up I l <----------------_______ l l I I System Up RSP

_________________--_--_---- >l I Begin Session (User 1) ~_____________________________________ l _____________________ l l l I Response User 1 ________________---------- >l j Begin Ses~ion (User 2) l l < _____________ I _____________________ l I I Re~ponse User 2 _______ ------------ ---- >
Application Message User 1 < >
I Response User 1 1 1 .
___ ____________ _______________ __________ ___ ______ ____________________________ _________ ________________________________ l _______----_-------- -- >l I End Se~sion (U~er 1) _________________ ______________ l _______-------- >l I Request Terminate (User 2) l l <----------------------____________________ 1 1 I Response User 2 ______------------------>l I I System Down <--------------_______ 40 1¦ System Down RSP I

And, the following i9 an example that illustrates premature 109~ of user connectivity due to the loss of connection between the network ~witCh server 205 and a cache/concentrator 302. In this case, an application peripheral to ~witch 205 posts the user status inactive to the NMH using an FM64 Ref=0008 user inactive. External application reaction to thi~ po~ting is implementation dependent. In this example, the external application returns outstanding respon~es using the FM6q "ref"="mailbox option".
Network External . 1 33~3Z
~. , .._ Server Appl Server Switch TMH APPL
____________________________________________________________________ 1 >I
I User Continuity Posting ___________________ >

1 < ----______________________________ I
I Outstanding Appl RSP with Mailbox option , OBJECT LANGUAGE
In accordance with the invention, in order to enable the manipulation of the network object~, the application programs necessary to support the interactive text/graphic qessions are written in a high-level language referred to as "TBOL", (TRINTEX Basic Object Language, "TRINTEX" being the former company name of one of the assignees of this invention). TBOL is specifically adapted for writing the application programs so that the programs may be compiled into a compact data stream that can be interpreted by the application ~oftware operating in the user personal computer, the application software being designed to establish the network Reception System 400 previously noted and de~cribed in more detail hereafter.
In accordance with the invention, the Reception System application software supports an interactive text/graphics sessions by managing objects.
As explained above, objects specify the format and provide the content; i.e., the text and graphics, di~played on the user' 9 screen ~o as to make up the pageq that constitute the application. As also explained, pages are divided into separate areas called "partitions" by certain objects, while certain other objects describe windows which can be opened on the pageq. Further, still other objects contain TBOL application programs which facilitate the data proces~ing necessary to present the pages and their associated text and graphics.
As noted, the object architecture allows logical events to be specified in the object definitions. An example of a logical event is the completion of data entry on a screen; i.e., an application page. Logical events are mapped to physical events such as the user pressing the <ENTER> key on the keyboard. Other logical events might be the initial di~play of a screen page or the completion of data entry in a field. Logical events specified in page and window object definitions can be associated with the call of TBOL program objects.
Reception Systems 400 is aware of the occurrence of all physical events during the interactive text/graphic sessions. When a physical event such as depression of the forward tab key corresponds to a logical event such as completion of data entry in a field, the appropriate TBOL program is executed '~5S' I 337~3~
if specified in the object definition. Accordingly, the TBOL programs can be thought of as routines which are given control to perform initialization and post-processing application logic associated with the fields, partitions and screens at the text/graphic sessions.
Reception System 400 run time environment uses the TBOL programs and their high-level c: 'n~9 called verbs to provide all the system services needed to support a text/graphic session, particularly, display management, user input, local and remote data access.
In accordance with the invention, the TBOL programs have a structure 10 that includes three sections: a header section in which the program name is specified; a data section in which the data ~tructure the program will use are defined; and a code section in which the program logic is provided composed of one or more procedures. More specifically, the code section procedures are composed of procedure statements, each of which begins with 15 a TBOL key word called a verb.
In accordance with the invention, the name of a procedure can also be used as the verb in a procedure statement exactly as if it were a TBOL key word verb. This feature enables a programer to extend the language vocabulary to include a customized application-oriented verb commands.
Continuing, TBOL programs have a program syntax that includes a series of "identifiers" which are the names and labels assigned to programs, procedures, and data structures.
An identifier may be up to 31 characters long; contain only uppercase or lowercase letters A through Z, digits 0 through 9, and/or the special 25 character underscore (_); and must begin with a letter. Included among the system identifiers are: "header section identifiers" used in the header section for the program name; "data section identifiers" used in the data section for data structure names, field names and array names; and finally, "code section identifiers" used in the code section for identification of 30 procedure names and statement labels.
The TBOL statement syntax adheres to the following conventionq. Words in uppercase letters are key words and must be entered exactly as shown in an actual statement. When operand are allowed, descriptive operand names and lowercase letters follow the key word. In this arrangement, operand names 35 or laterals are entered in an actual statement. Operand names enclosed in square brackets ~[ ]~ are optional and are not required in an actual ~tatement. Operand names separated by a bar (1) mean that one, and only one, of the separated operand can be included in an actual statement. Operand names followed by an ellipsis (...) can be entered 1 or more times in an actual statement. Model statement words not separated by punctuation must be separated by at least one blank (or space character) in actual statements.
Model qtatement punctuation such as comma (,), semicolon (;), less than sign (<), equal sign (=), greater-- than (>), and parentheses ((~) mu~t be included where shown in actual statements. Square brackets ([]), bars (1), and ellipses (... ) should not be included in actual ~tatements.
An example of a model statement would be as follows:
GOTO DEPENDING ON index,label (.label...).
This model says that a valid GOTO DEPENDING_ON statement must begin with the word "GOTO_DEPENDING_ON" followed by at least one blank.

~'f-'- 133713~
Thereafter, an "index" and a "label" separated by a comma must be included.
The index and at least one label are required. Additional labels may also be used, provided each is preceded by a comma. Further, the statement must have a semicolon as the last character.
Comments can be included in a TBOL program on a statement line after the terminating semicolon character or on a separate comment line. Comment text is enclosed in braces ((}). For example: ~comments are enclosed in braces]. Comments can be placed anywhere in the source code stream since, in accordance with the invention they are ignored by the TBOL compiler.
Additionally, blanks (or space characters) are ignored in TBOL statement lines except where they function as field separators.
As noted, TBOL programs have a structure that includes a header section, data section and code section. More particularly, every TBOL
program must have a header section. The header section contains a PROGRAM
statement. The PROGRAM statement contains the key word PROGRAM followed by the name of the program. For example:
PROGRAM program_name;
where ~program_name" is an identifier; i.e., the name of the program.
Accordingly, the header section for a TBOL program called LOGON would look like as follows:
PROGRAM LOGON: (User logon program~
The data section in a TBOL program begins with the key word DATA which is followed by data structure statements. The structure statements contain the data structure definitions used by the program. If the data structure does not have to be defined for the program it can be omitted. However, if a TBOL program does not include a data section, it must use a more restricted structure, more fully explained hereafter. As an example, the data syntax would be:
DATA structure [structure...];
where "structure" is a data structure statement. The data structure statement contains a definition, which consists of the data structure name followed by an equal sign and then the names of one or more variables. For example:
structure name=variable_name [,variable_name...];
where "structure_name" is an identifier; i.e., the name of the data structure; and "variable_name" is an identifier for the variable; i.e., the name of a variable.
All of the variables in the data structures are defined as string (or character) variables. TBOL string variables are of two kinds, fields and arrays. In the case of filed definitions, a variable field is defined with and identifier; i.e., the name of the field. No data type of length specification is required. An individual field is referenced by using the field name. Further, subsequent fields can be referenced by using a field name followed by a numeric subscript enclosed in parentheses (()). The subscript however, must be an integer number.
A field name followed by a subscript refers to a following field in the data section of a TBOL program. The subscript base is l. For example, if a field CUST_NBR were defined, then CUST NBR refers to the field CUST_NBR, CUST_NBR(l~ also refers to the field CUST_NBR and CUST_NBR(2) refers to the ~ 1337)32 field following CUST NBR.
In the case of array definitions, the TBOL array is a one-dimensional table (or list) of variable fields, which can be referenced with a single name. Each field in the array is called an element.
An array can be defined with an identifier, particularly, the name of the array, followed by the array's dimension enclosed in parentheses ~()).
The dimension specifies the number of elements in the array. By way of illustration, if an array is definéd with a dimension of 12, it will have 12 element~. An individual element in an array is referenced by using the array name followed by a numeric subscript enclosed in parentheses ~()). The subscript indicates the position of the element in the array. The first element in an array is referenced with a subscript of 1. The subscript can be specified as either an integer number or an integer register as described, hereafter.
With regards to variable data, data contained in variables is always left-adjusted. Arithmetic operations can be formed on character string~ in variab1es if they are numbers. A number is a character string that may contain only numeric characterY 0 through 9, an optional decimal point, an optional minus sign in the left-most position, commas and the dollar sign ($)-When you perform an arithmetic operation on a character string, leading and trailing zeros are trimmed and fractions are truncatod after 13 decimal places. Integer results do not contain a decimal point. Negative results contain a minus sign (-) in the left-most position.
Each field and each array element has a length attribute which is initialized to zero by the Reception System at program start-up. The LENGTH
verb, to be described more fully hereafter, can be used to set the current length of a field or array element during program execution. The ~-length of a field or an array element is 65,535.
Further, the r~; number of variables that can be defined in the data section of a TBOL program is 222. This number includes fields and array elements.
The following example data section contains five data structure statements, each defining a data structure. Each structure statement begins with the name of the data structure followed by an equal sign.
Next, are the names of the variables which make up the structure. The variable names are separated by commas. The last variable name in each structure statement is followed by a ~emicolon which terminates the statement.
The third data ~tructure given, i.e. SALES_TABLE, contains two arrays.
The others contain fields. The last structure statement, i.e. WK_AREA is and example of a single line.
DATA ~Key word DATA begins data sectioni BILL_ADDR- {data structure BILL_ADDR}
BILL_NAME, {fieldl BILL_NAME}
BILL_ADDR1, {field2 BILL_ADDR1}
BILL_ADDR2, ~field3 BILL_ADDR2}
BILL_ADDR3, ffield 4 BILL_ADDR3}
SHIP_ADDR,- (data structure SHIP_ADDR}) ~.- 1 33713~
SHIP NAME, {fieldl SHIP NAME) SHIP ADDRl, (field2 SHIP ADDR1}
SHIP ADDR2, ~field3 SHIP ADDR1}
SHIP ADDR3, Ifield4 SHIP ADDR1}
SALES TABLE= idata structure SALES_TABLE}
MONTH QUOTA(12~, ~arrayl MONTH QUOTA}
MONTH SALES(12), larray2 MONTH_SALES}
MISC DATA- Idata structure MISC_DATA}
SALESPERS NAME, ~fieldl SALESPERS NAME}
CUST TELNBR; ~field2 CUST_TELNBR}
WK AREA- {data structure WK_AREA} --TEMP1, TEMP1;
Continuing, TBOL contains a number of predefined data structures which can be used in a TBOL program even though they are not defined in the program s data section. There are two kinds of TBOL-defined data structures, these are system registers and external data structures .
In the case of systems registers, tree different types exist. The first type are termed integer register~ ,and are used primarily for integer arithmetic. However, the9e regi~ter9 are also useful for field or array subscripts. The second type are termed decimal regis ers , and are used for decimal arithmetic. The third type are called, parameter registers and are used to pa~s the data contained in procedure ~tatement operand when the name of a procedure is uqed aq the verb in the statement rather than a TBOL
keyword.
The variable-q defined in the data section of a program are string (or character) variables, and the data in them is kept in string format. In most cases there is no need to convert this data to another format, since TBOL
allows substantially any kind of operation (including arithmetic) on the data in string form. As will be appreciated by those skilled in the act, this eliminates the clerical chore of keeping track of data types and data ~ --conversion. --There are some cases where it is desireable to maintain numeric data in binary integer or internal decimal format. For example, an application involving a great deal of computation will execute more efficiently if the arithmetic is done in binary integer or internal decimal format data rather than string data. In these ca/es, data conversion can be performed by simple moving the numeric data to the appropriate register. When data is moved from a register to a variable, it is converted to string format.
Integer registers are special-purpose fields for storing and operating on integer numeric data in binary format. The integer register~ are named I1 through I8. Numeric data moved to an integer register is converted to an integer number in binary format. Further, an attempt to move non-numeric data to an integer register will cause an error. The largest negative number an integer register can hold is -32,7767, while the largest positive number than can be held is 32,767. An noted arithmetic operations in integer registers will execute more efficiently than arithmetic operation~ in string variables. - --Decimal registers are special-purpose fields for storing and operating , 48 ~.,~"7" ~3713~
- on numeric data in internal decimal format. The declmal registers are named Dl through D8. Numeric data moved to a decimal register is converted to a decimal number in internal decimal format. An attempt to move non-numeric data to a decimal register will cause an error. The largest negative!number a decimal register can hold is -9999999999999.9999999999999, while the largest positive number a decimal register can hold i9 9999999999999.9999999999999. Additionally, decimal registers can not be used as field or array ~ubscripts. And, again, arithmetic operations in decimal registers will perform better than arithmetic operations in string variables.
As pointed out above, the code section of a TBOL program contains the program logic, which itself is composed of one or more procedures. In the logic, the procedures are expressed as procedure statements. Each procedure statement begins with a TBOL keyword called a verb which is followed by operand, or parameters containing the data on which the verb is to operate.
15 The name of a procedure can be used as the verb in a procedure statement exactly as if it were a TBOL keyword verb. As noted this enables the creator of a T30L program; i.e. the party creating the text/graphic session, to extend the language vocabulary to include his own application-oriented verb commands .
When a procedure is used as the verb in a procedure statement, TBOL
saves the current parameter register values, and the parameter data in the verb operand is moved into the parameter registers where it is available to the "called" procedure. When the "called" procedure returns, TBOL restores the saved parameter register values.
Parameter registers are special-purpose fields for passing parameter data to "called" procedures. The parameter registers are named PO through P8. When a procedure is "called" by using its name as the verb in a procedure statement, the current contents of PO through P8 are saved.
Further, data from the first operand in the procedure statement is placed in 30 Pl; data from the second operand is placed in P2; and so on, up to eight operand. If no operand, or less than eight operand are specified, the parameter registers corresponding to the missing operand are set to null.
In accordance with this arrangement, the number of operand is placed in PO, and the "called" procedure is given control.
When control returns to the "calling" procedure from the "called"
procedure, the previous contents of PO through P8 are restored. Following execution of the "called" procedure, execution of the "calling" procedure continues.
The "calling" procedure can pass along its own parameters to the 40 "called" procedure by naming parameter registers as operand. The TBOL
internal stack can be used to pass additional data to the "called" procedure, or to pass data back to the "calling" procedure.
There are two kind of TBOL-defined external data structures; they are partition structures and global structures. With regard to partition 45 external data structures, as noted above the screens displayed during a test/graphic session are calied pages. As also noted, pages may be divided into separate areas called "partitions". Each page partition has its own predefined partition external data structure. Each partition external data structure can contain up to 256 variables for data pertaining to that ~ ~ 1 3371i 3~
, partition. A T30L program associated with a particular partition has access to the partition's external data structure and the variable~ it contains.
However, the program cannot access another partition's external data structure.
The variable in a partition external data ~tructure are character string variables like those defined in the data section of a program, The variables within each partition external data structure are named &1 through 6256. The DFFINE compiler directive enableR the program to use meaningful names for these variables in the program source code.
Partition external variables are u~ed to hold screen field data, program flow data and applications data. In the case of screen field data, when page and window objects are defined, the fields in the screen partitions are assigned to partition external variables. The TBOL Object Linker resolve~ these references and at program execution time the Reception System transfers data between the screen fields and their associated partition external variables. The TBOL program has acce~s to the variableq, which contain the data entered in the screen fields by the user, and the user has access to the screen field~ of which contain the data placed in the variables by the program.
For program flow data, partition external variables are used to hold the object identifiers needed by a TBOL program for transferring control.
The~e may be page object identifiers for transfer to another text/graphic screen page, or window object identifierq needed to open a window on the current page. As in the case of screen field data, flow data values are placed in partition external variable by the TBOL Object Linker.
Finally, for application data, partition external variables can be used to hold partition-specific application data such as tables of information needed by the program to proce~s the expected screen field input.
With regard to the global external data structure, the predefined global external data structure can contain up to 32,000 variables for TBOL
system data. All TBOL programs have access to the global external data structure and the variables it contains. The variables in a global external data structure are character string variables like the ones one defines in the data section of a program. The global external variable~ are named #l through #32,000. These variables are assigned and controlled by the TBOL
database administrator which maintains a file of DEFINE compiler directive statements which as~ign meaningful names to the global external variables in use. In the preferred embodiment, the MS-DOS file specification for this file can, for example be TBOLLIB\TBOL.SYS. In this regard, the COPY compiler directive i9 used to copy TBOL.SYS into a source code input stream.
Subsequent statements in the program source code can reference the global external system variables by using the meaningful names assigned by the DEFINE statements in this file.
Examples of global external variables are: SUS_RETURN CODE, which is assigned a return code value after the execution of certain TBOL program verb statements; SYS_DATE, which contain~ the current system date; and SYS TIME, which contains the current system time.
With regard to the TBOL program code section, as noted above, every TBOL program must have a code section. The code section contains the program . ~

1133~ l32 ~. .~
- logic which is composed of one or more procedures. In accordance with this arrangement, a procedure begins with the keyword eRcc followed by an equal sign (~ and then the name of the procedure. The body of the procedure is composed of procedure statements, ending with the END PROC statement. For example:
PROC=proc name statement [statement...] END_PROC;
where "proc_name" i9 an identifier; i.e. the name of the procedure, and "statement" is a T80L procedure statement as described below.
In accordance with the invention, at program execution time, control is given to the first procedure in the program. This is the mainline procedure. From then on, the flow of procedure execution is controlled by the logic contained in the procedures themselves.
Each procedure statement begins with a TBOL keyword called a verb.
However, as noted above, the name of a procedure can also act as the verb in a procedure statement, exactly as if it were a TBOL verb. In such case, the data in any statement operand is moved into parameter registers and control is passed to the other procedure. No special linkage or parameter passing conventions are needed. As will be appreciated by those skilled in the art, this is a powerful feature which enables the application programmer to extend the language vocabulary to include his own library of application-oriented verb commands and commonly used procedures.
When control is transferred to another procedure, as noted, the "called" procedure returns control to the "calling" procedure with a RETURN
or END PROC statement, where RETURN and END PROC are TBOL verbs described more fully hereafter. Upon returnr the "calling" procedure's parameter data, if any, i9 restored in the parameter registers, and program execution resumes with the next statement. Recursive logic is possible by using the name of the current procedure as the verb in a procedure statement, thus causing the procedure to "call" itself.
In accordance with the design of T80L, any procedure statement may be preceded with one or more identifying labels. A label consists of an Identifier followed by a colon (:). For example:
(stmt_label:...) statement where "stmt_label" is an Identifier, for the statement, and "statement" is a T80L procedure statement.
Procedure statement labels are used for transferring control to another statement within the same procedure using a GOTO or GOTO DFPENDING_ON
statement (T80L verbs described more fully hereafter). -GOTO and or GOTO DEPENDING ON statement can also be used to transfer control to another procedure. Transfer to another procedure is done by using the target procedure name as the verb in a statement.
Also in accordance with the design of TBOL, all procedural logic is constructed from statements designed to execute in three basic patterns:
sequential, conditional, or repetitive. In the case of a sequential pattern, the sequential program logic consists of one or more procedure statements.
In the case of a conditional pattern, the conditional program logic is constructed using IF...THEN...ELSE and GOTO DEpENDING ON key words, described more fully hereafter. Finally, in the case of a repetitive pattern, the repetitive program logic is constructed using WHILE...THEN key words or ~ ~ 1 33~
-- IF.. THEN.. ELSE and GOTO key words also described more fully hereafter.
In accordance with the TBOL design, a procedure statement may contain operand following the verb. In the case of procedure statements, there are five types of procedure statement operand; data names; group data names;
system registers, label identifiers, and laterals. In this arrangement,, data names are the names of variables, and data name operand can be either field names; field numbers with subscript~ or array names with subscripts. In the case of filed nameq, a field name is the identifier used as the name of a variable in a data structure in the data section of the program, or the name of T30L-defined variable in an external data structure.
For field names with subscripts, a field name followed by a subscript enclosed in parenthese9 (()) refers to a following field. The subscript must be an integer number expressed as a literal or contained in a variable field.
The subscript base is 1. For example: CUST_NAME(1) refers to the field CUST NAME, and CUST_NAME(2) refers to the field following CUST NAME. ---For array names with sub~cripts, an array name is the identifier used as the name of an array in a data structure in the data section of the program. An array name followed by a subscript enclosed in parentheses (()), refers to an individual element in the array. The subscript must be an integer number expressed as a literal or contained in a variable field. The subscript base in 1, 90 the first element in an array is referenced w_th a subscript of 1.
In the case of procedure statement group data name operand, the group data names are the names of data structures or arrays. Group data names are used in statements where the verb allows data structures or arrays to be treated as a single unit. For example, the TBOL MOVE verb allows the use of group data name operand. If the names of two arrays as group data operand are used, the contents of each element in the source array is moved to the corresponding element in the destination array. Here the array names are specified without subscripts. However, if the names of two data structures as group data operand are used, the contents of each variable in the source data structure is moved to the corresponding variable in the destination data structure.
With regard to system register operand, they can be either integer registers I1 through I8, or decimal registers D1 through D8, or parameter registers P1 through P8.
In the case of label identifiers, the label identifiers are the identifiers used as procedure statement labels described above.
Continuing, literal operand can be either, integer numbers, decimal numbers or character strings. Where the literal operand are integer numbers, the integer is composed of the digits 0 through 9. Where a negative integer is to be represented, a minus sign (-) is allowed in the left-most position.
However, a decimal point is not allowed. Accordingly, the minlmllm value that can be represented-is -32,767, and the ~ value is 32,767. Where the literal operand is a decimal number, the decimal number is composed of the digits 0 through 9 with a decimal point (.) where desired. A minus sign ( -) is allowed in the left-most position. Thus the minimum Illowable value is -9999999999999.99999999999999, and the r-~i value is 9999999999999.9999999999999.
Further, where the literal operand is a character string, the character 1337~3~
~~ string is composed of any printable character~ or control character~.
Character strings are enclosed in single quotes ('). To include a single quote character in a character string, it must be preceded with the backslash character (\). For example: \'. To include a new line character in a character string, the control character \n is used. For example; 'this causes a new line: \n'. To include binary data in a character string, the hex representation of the binary data is preceded with the backslash character (\). For example; 'this is binary 01110111:\77'.
The syntax of a complete TBO~ program is illustrated in the following example program.
HEADER SECTION PROGRAM program_name;
DATA SECTION DATA
: data structure_name~ 1st data structure~

: variable name_1, variable names : variable_name_n;
data structures : data_structure_name_ns (nth data strctre) variable_name_1, : variable names followed by commas : variable_name_n;
CODE SECTION PROC proc_name_1= lmainline procedurej : procedure 3tatements : IF x = x THEN EXIT: (if done,ret to:RS Sys~
: procedure 3tatements : END_PROC; (end of mainline procedure~

: procedures : PROC proc name_n= (nth procedures) : procedure 3tatements : IF x = x THEN RETURN; (if done,ret to:
"calling"proc~
: procedure statements : END-PROC; (end of nth procedure~
(end of program) 133~113~ - `
~ ,"
~ In accordance with the invention, the TBOL compiler enables portability of TBOL programs. Specifically, the TBOL compiler is capable of generating compact data streams from the TBOL source code that can be interpreted by any reception system configured in accordance with the invention, i.e., a personal computer running the reception system application software. For thi~ arrangement, the compiler input file containing the TBOL source code may have any name. For example, the extension .SRC can be u~ed.
During the compilation, three files are generated. Their names are the same aq the source code file: their extensions identify their contents. For example, when the file name~ INPUT.SRC is compiled the following file~ are generated by the compiler: INPUT.SYM which contains a symTBOL directory; IN-PUT.COD which contains the compiled code; and INPUT.LST which contains the listing.
In order to resolve an undefined procedure, the T80L compiler automatically search the local MS-DOS directory TBOLLIB for a file named procname.LIB, where procname i~ the name of the unresolved procedure. IF
procname.LIB is found, the compiler will automatically copy it into the source code stream after the program source text has ended.
In addition to the undefined procedures facility above noted, the TBOL
compiler also may be caused to substitute one text string for another. This accomplished by a DEFINE directive.
Wherever the text pattern specified in operand 1 is found in the source code stream, it is replaced by the compiler with the text pattern specified in operand 2. The syntax for the procedure is:
DEFINE source_pattern,replacement_pattern;
where "source pattern" is the text in the source code which the compiler is to replace, and "replacement_pattern" is the text the compiler will use to replace ~ource pattern.
If source pattern or replacement pattern contain any blank (space~
characters, the text must be enclosed in single quotes ('~. Further, the compiler can be made to eliminate certain text from the input source stream by using a null text string for the replacement pattern ('').
It is to be noted that while DEFINE directives are normally placed in the data section, they can also be placed anywhere in the source code stream.
For example, if the name CUST_NUMBER has been used in a TBOL application program to refer to a partition external variable named &6. The DEFINE
~tatement DEFINE CUST NUMBER,.&6 would cause the compiler to sub~titute &6 whenever it encounters CUST NUMBER in qubsequent statement~.
As a further illustration , if the wordq MAX and MIN are defined with numeric values, DEFINE MAX,1279; and DEFINE MIN,500; MAX and MIN can be used throughout the program source code rather than the actual numeric values.
If the values of MAX and MIN change in the future, only the DEFINE statements will need to be changed.
Still further, the compiler can also be caused to copy source code from some other file into the compiler input source code stream. This can be accomplished with a directive entitled COPY. With the use of the COPY
directive, the source code contained in the file specified in operand 1 is copied into the source code stream at the point where the COPY statement is read by the compiler. For example, the syntax would be: COPY

~ 1 337 1 32 ~ 'file name'; where "file name" is the name of the file containing source code to be inserted in the source code steam at the point of the COPY statement.
In this arrangement, file_name must be enclosed in single quotes ('), and file_name must conform to the operating system file naming rules (in the current preferred embodiment, those of MS-DOS). Further, the file referenced in a COPY statement must reside in the TBOLLIB directory on the compilation machine. In accordance with the invention the COPY statement can be placed anywhere in the source code stream.
By way of illustration, the CoPY Ytatement CoPY 'TBOL.SYS'; causes the compiler to insert source text from the file TBOL.SYS. This file is maintained by the TBOL Database Administrator, and contains DEFINE statements which assign meaningful names to the TBOL system variables in the global external data structure.
As shown in Table 2, 25 verbs are associated with data processing; 15 with program flow; 5 with communications; 6 with file management, 5 with screen management; 1 with object management and 2 with program structure for a total of 59. Following is a alphabetical listing of the TBOL verbs, together with a description of its function and illustration of its syntax.
ADD
The ADD verb adds two numbers. Specifically, the number in operand l is added to the number in operand 2. Thus, the number in operand 1 is unchanged, while the number in operand 2 is replaced by the sum of the two numbers. The syntax for ADD is:
ADD nu~berl,number2;, where numberl contains the number to be added to number2. In this arrangement, numberl can be a data name; system register or literal number. As is apparent, number2 contains the second number, and is overlaid with the resulting sum. Number2 can be a data name or system register.
TBOL will automatically perform data conversion when numberl is not the same data type as number2. Sometimes this will result in number2 having a different data type after the add operation. In accordance with this embodiment, fractions will be truncated after 13 decimal places, and whole numbers will not contain a decimal point. Negative results contain a minus sign (-) in the left-most position.
AND
The AND verb performs a logical AND function on the bits of two data fields. The logical product (AND) of the bits of operand 1 and operand 2 is placed in operand 2. Moving from left to right, the AND is applied to the corresponding bits of each field, bit by bit, ending with the last bit of the shorter field. If the corresponding bits are 1 and 1, then the result bit is 1. If the corresponding bits are 1 and 0, or 0 and 1, or 0 and 0, then the result bit is 0. In this arrangement, the data in operand l is left unchanged, and the data in operand 2 is replaced by the result.
The AND syntax is:
AND fieldl,field2;
where "fieldl" contains the first data field, which can be a data name, system register, I1 - I8 or P1 - P8 only, or a literal. Continuing, "field2~' contains the second data fields, and the contents of field2 are overlaid by ::: 133713~

~ the result of the AND operation. Field2 can be a data name, a system register~ I8 or Pl - P8 only.
As will be appreciated, the AND verb can be used to set a bit to 0.
CLEAR
The CLEAR verb sets one or more variables to null. The CLEAR statement may have either one or two operand. If only one operand is specified, it may contain the name of a field, an array or a data structure. If the operand contains a field name, then that field is set to null. If the operand contains an array name, then all elements of the array Are set to null. If the operand contains the name of a data structure, then all fields and array elements in the data structure are set to null. ;c two operand are specified, then each operand must contain the name of a field. In this case, all fields, beginning with the field in operand 1 and ending with the field in operand 2, are set to null.
The syntax for CLEAR is:
CLEAR namel [,name2];
where "namel" contains the name of a field, array, or data structure to be set to null. If "name2" is specified, namel must contain a field name.
Namel can be a data name, group data name, or system register P1 - P8 only.
Further, name2 contains the last field name of a range of fields to be set to null, and can be a data name, group data name, or system register P1 - P8 only.
CLOSE
The CLOSE verb is used to clo e a reception system file after file proce~sing has been completed. By using CLOSE, the file named in operand 1 is closed. If no operand is specified, then all open files are closed. The CLOSE syntax is:
CLOSE [filename];
where, "filename" contains the name of the reception system file to be closed. The file name "PRINTER" specifies the system printer. Otherwise, the name of the file must be a valid MS-DOS file specification; e.g., [drive:][\path\]name~.extension] File name can be a data name, or system register P1 - P8 only. When file processing is complete, the file must be closed.
CLOSE WINDOW
The CLOSE WINDOW verb is used to close the open window on the base screen and, optionally, open a new window by appending the partial operator OPEN to the middle of the verb tas shown below). Specifically, by using CLOSE WINDOW, the open window on the base screen is closed. If no operand is specified, program execution continues with the next statement in the program which last performed an OPEN WINDOW. If operand 1 is specified, the window whose object ID is contained in operand 1 is opened, and program execution continues with the first statement of the program associated with the newly opened window object.
The CLOSE WINDOW syntax is:
CLOSE WINDOW twindow-id];
where, "window-id" contains the object ID of a new window to be opened after closing the currently open window~. A window-id can be a data name, system register P1 - P8 only, or a literal. The CLOSE WINDOW verb can only be ~ 1337132 ...... .

`- performed by a window program; i.e., a program associated with a window object. CLOSE WINDOW iq the method by which a window program relinquishes control. A window program can also close itself by performing one of the following verbs: NAVIGATE, TRIGGER_FUNCTION. Although a window program cannot perform a OPEN_WINDOW operation, it can use CLOSE_WINDOW to close itself and open another window. This process can continue through several windows. Finally, when a window program performs a CLOSE_WINDOW without opening a new window, program control does not work its way back through all the window program~. Instead, control returns to the non-window program which opened the first window. Program execution contirles in that program with the statement following the OPEN WINDOW statement.
CONNECT
The CONNECT verb dial~ a telephone number. The telephone number contained in operand l is dialed. The telephone line status is returned in the system variable SYS CONNECT_STATUS.
The syntax for CONNECT is: --CONNECT phone number;
where "phone number" contains the telephone number to be dialed.
Phone_number can be a data name, system register Pl - P8 only, or a literal.
DEFINE_FIELD
The DEFINE_FIELD verb is used to define a screen field at program execution time. From five to seven operand specify a single-line or multiple-line field within the currently active screen partition; i.e. the partition associated with the running program. The field is dynamically defined on the current screen partition.
The syntax for DEFINE FIELD is:
DEFINE FIELD name,row,coln,width,height [,object_id ~,state]];
where "name" is the field to receive the name of a partition external variable. When this statement is performed, a screen field is defined and it is assigned to a partition external variable. The partition external variable name is placed in the name operand. Name may be a data name, or system register Pl -P8 only.
Continuing "row" in the DEFINE FIELD syntax contains the row number where the field starts. The top row on the screen iq row number 1. Row can be a data name, system register Pl - P8, or a literal. "Column" contain~ the column number where the field starts. The left-most column on the 9creen i9 column number 1. Column can be a data name, system register Pl - P8 only, or a literal. In the DEFINE FIELD syntax, "width" contains a number specifying how many characters each line the field will hold. Width can be a data name, system register Pl - P8 only, or a literal. Further, "height"
contains a number specifying how many lines the field will have. For multiple-line fields, each field line will begin in the column number specified in the column operand. Height can be a data name, system register Pl - P8 only, or a literal.
Yet further, in the DEFINE FIELD syntax, "object id" contains the object ID of a field post processor program that is to be associated with this field. Object_id can be a data name, system register Pl - P8 only, or a literal. Finally, for the DEFINE_FIELD syntax "state" contains a character string which is to be placed in parameter register Pl when the program --~ 1337~32 specified in the object id operand is given control. State can be a data name, system register P1 - P8 only, or a literal.
In the case of the DEFINE_FIELD verb, if the ob~ect-id operand is specified, then the post processor program object is obtained only on a "commit" event; avoiding the need for a synchronous ~ETCH Since DEFINE FIELD defines a field only in the screen partition associated with the running program, a program can not define a field in some other screen partition with which it is not associated. Additionally, page-level proceqsor programs which are not associated with a particular screen partition can not use this verb, DELETE
DELETE is used to delete a reception system file for file processing.
the file named in operand l is deleted. The syntax for DELETE is:
DELETE [filename~;
where "filename" contain~ the name of the reception system file to be deleted. Filename can be a data name or ~ystem register Pl - P8. Filename must be a valid operating specification.
DISCONNECT
The DISCONNECT verb "hangs up the telephone", thus, terminating the telephone connection. The syntax for DISCONNECT is simply:
DISCONNECT .
DIVIDE
The DIVIDE verb divides one number by another. The number in operand 2 i9 divided by the number in operand 1. The number in operand 1 is unchanged, however, the number in operand 2 iY replaced by the quotient, If operand 3 i8 specified, the remainder is placed in operand 3. The syntax for DIVIDE i9.
DIVIDE numberl,number2 [, L~ ~in~er~;
where "number1" contain~ the divisor, i.e. the number to be divided into number2. Numberl can be a data name, system register, or literal number.
Continuing, "number2" contains the dividend; i.e., the number to be divided by numberl. The content~ of number2 are overlaid by the resulting quotient.
Number2 can be a data name, or a system register. And, "L~--;nder" is a variable or system register designated to hold the remainder of the divide operation. Rer~ in~er can be a data name, or a system register.
TBOL will automatically perform data conversion when numberl is not the same data type as number2. Sometimes this will result in number2 having a different data type after the divide operation. Fractions will be truncated after 13 decimal places, while whole number will not contain a decimal point.
Negative results will contain a minus sign (-) in the left-most poqition.
DO...END
The keyword DO specifies the beginning of a block of statements; the keyword END specifies the end of the block. A block of statements, bracketed by DO and END can be used as a clause in an IF or WHILE statement. In an IF
statement, either the THEN clause or an optional ELSE clause can be executed, based upon the evaluation of a boolean expression. In a WHILE statement, the THEN clause is executed repetitively until a boolean expression is false.
The syntax for DO...END is:
DO...block.. END;

~ 1 3371 3~
-where "Block" is any number of TBOL statements. As shown, the keyword DO is not followed by a semicolon, and the END statement requires a terminating semicolon.
EDIT
The EDIT verb gathers and edits data from multiple sources, then joins it together and places it in the specified destination field. Data from one to six sources, beginning with operand 3, is edited in accordance with the mask contained in operand 2. The edited data, joined together as a single character string i9 place~ in the output destination field specified in operand 1.
The EDIT syntax i~ EDIT output,mask,source [,source...];, where "output" contains the name of the destination field for the edited data.
After performance of the EDIT statement, the destination field will contain "sub-fields" of data; one for each source operand. Output can be a data name, or a register P1 - P8 only.
Continuing, "mask" contains a character string consisting of one edit specification for each source operand. Edit specifications are in the form:
%~-~[min.max]x, where "%" indicates the beginning of an edit specification;
"-" indicate~ left-adjustment of the source data in the destination sub-field, and "min.max" are two numbers, separated by a decimal point, which specify the mlnl and ~-Y-m~m width of the edited data in the destination sub-field, and "x" is an alpha character which controls the retrieval of data from the corresponding source operand. Further, "x" can be a "d" to indicate a digit, characters retrieved from the corresponding source operand are converted to integer format; or "x" can be an "f" to indicate floating point, characters retrieved from the corresponding source operand are converted to a decimal format; or an "x" can be an "s" to indicate a string, characters retrieved from the corresponding source operand are converted to character format; or an "x" can be a "c" to indicate a character, only one character i9 retrieved from the corresponding source operand, and is converted to character format.
Characters in mask which are not part of edit specifications are placed in output as laterals. Mask can be a data name, or system register P1 - P8 only.
Continuous source contains the source data to be edited. The EDIT
statement may contain up to six source operand. Mask must contain an edit specification for each source operand specified. Source can be a data name, a system register, or a literal.
END_PROC
The END_PROC verb identifies the last physical statement in a procedure definition. Control returns to the "calling" procedure and program execution continues with the statement following the "call" statement. The syntax for END_PROC is;
END PROC;
An END_PROC statement is required as the last physical statement in every procedure. Accordingly, a procedure may contain only one END_PROC
statement.
An END_PROC statement in a "called" procedure is equivalent to a RETURN
statement. Further, an END_PROC statement in the highest level procedure of ~337~3Z
.~

~~ a program is equivalent to an EXIT statement.
ERROR
The ERROR verb causes the Reception System to reset. Processing resumes with a new page template object. Execution of the currently running program i9 terminated and control returns to the Reception System. The reception System resets itself. Program execution then resumes with the first statement in the program associated with the page template object ~pecified in operand 1.
The ERROR ~yntax is:
ERROR object id;
where "object id" contains the object ID of a page template object. After the Reception System reset, control is tran~ferred to the program associated with the page template object. Object_id can be a data name, a system register P1 - P8 only, or a literal.
The ERROR verb is used to continue a text/graphic session when the currently running program encounters a condition which can only be resolved by a reset of the Reception System.
EXIT
The EXIT verb is used to transfer program control to the Reception System. When EXIT executes, the currently running program is ended. The data in operand 1 is moved to SYS_RETURN_CODE, and control is returned to the Reception System. The syntax for EXIT is:
EXIT return code;
where "return-code" contains data to be moved to SYS_RETURN_CODE prior to transfer of control to the Reception System. A value of O indicates a normal return. A non-zero value indicates an error condition. Return_code can be a data name, system register, or a literal.
The EXIT verb iQ the normal way to end processing in a TBOL program.
In the highest level procedure of a program a RETURN or an END_PROC is equivalent to an EXIT.
FETCH
The FETCH verb i~ used to retrieve an object from a ho~t system or from the Reception System storage device stage. The object specified in operand 1 is retrieved from its present location and made available in the Reception System. If operand 2 i~ specified, the object's data segment is placed in the operand 2 field.
The syntax for FETCH i9:
FETCH object_id [,field];
where "object_id" contains the object ID of the object to be located and retrieved. Object id can be a data name, system register P1 - P8 only, or a literal.
In the FETCH syntax "field" contains the name of a field to hold the retrieved object's data segment. Field can be a data name, or a system register P1 - P8 only.
When an object might be required for subsequent processing, the field operand should not be specified in the FETCH statement. In that case, the FETCH will be an asynchronous task and the program will not experience a wait. The object i~ placed in the Reception System ready for use. The!field _ operand is specified when an object is required to immediate use. Here, the FETCH i9 a synchronous task and the program may experience a wait. When the FETCH is completed, the program has access to the FETCHed object's data segment in the field operand.
FILL
The FILL verb iq used to duplicate a string of characters repeatedly within a field. The character string pattern contained in operand 2 is duplicated repeatedly in operand 1 until the length of operand 1 is e~ual to the number specified in operand 3. The syntax for FILL is:
FILL output,pattern,length;
where "output" is the name of the field to be filled with the character string specified in "pattern". Output can be a data name or a system register P1 - P8 only, or a literal. Finally, "length" contains an integer number specifying the final length of output. Length can be a data name, system register or a literal.
FORMAT
The FORMAT verb is used to transfer a qtring of character data into variables defined in the DATA section of the program. The ~tring of character data contained in operand 1 is transferred to DATA section variables uing de9tination and length specification in the format map contained in operand 2. The FORMAT syntax is:
FORMAT source,map;
where "source" contains a string of character data to be transferred to DATA
section variables, and can be a data name or system register P1 - P~ only.
Continuing, "map", on the other hand, contains a format map consisting of a destination/length specification for each field of data to be transferred. Map iY created with the MAKE_FORMAT verb prior to execution of the statement.
GOTO --The GOTO verb transfers control to another statement within the currently running procedure. Program execution continues at the statement with the label identifier specified as operand 1. The syntax for GOTO is:
GOTO label id;
where "label id" is a label identifier directly preceding a statement within the currently running procedure. A GOTO statement can be used to transfer control to another procedure. Transfer to another procedure is accomplished by using the target procedure name as the verb in a statement.
GOTO DEPENDING ON
The GOT DEPENDING ON verb transfers control to one of several other statements within the currently running procedure. Operand 1 containa a number, and is used as an index to select one of the label identifiers beginning with operand 2 in the ~tatement. Program execution continues at the statement with the selected label identifier.
The syntax for GOTO DEPENDING_ON is:
GOTO DEPENDING_ON index,label id [,label_id... ];
where "index" i9 an intege~ number used to select one of the label identifiers in the statement as the point where program execution will continue. If index contains a 1, then program execution continue~ at the statement with the label identifier specified as operand 2. If index r~ 1 337 i 3~
,. --, `_.
contains a 2, then program execution continues at the statement with the label identifier specified as operand 3. And so on. If there is no label_id operand corresponding to the value in index, then program execution continues with the statement following the GOTO_DEPENDING ON statement. Index can be a data name or system register. Continuing, "label_id" is a label identifier directly preceding a statement within the currently running procedure. Up to 147 label_id operand may be specified in a GOTO_DEPENDING_ON statement.
A GOTO_DEPENDING_ON statement, however, cannot be used to transfer control to another procedure. Transfer to another procedure is done by using the target procedure name as the verb in a statement.
IF...THEN...ELSE
In this verb, the keyword IF directs the flow of program execution to one of two possible paths depending upon the evaluation of a boolean expression. The keyword IF is followed by a boolean expression. The boolean expression is always followed by a THEN clause. The THEN clau~e may be followed by an ELSE clause. The boolean expression i9 evaluated to determine whether it i~ "true" or "false". If the expres~ion i9 true, program execution continues with the THEN clause; the ELSE clause, if pre~ent, i9 skipped. If the expression is false, the THEN clau~e is skipped; program execution continues with the statement following the clause or clauses.
The syntax for IF...THEN...ELSE is:
IF boolean THEN clause tELSE clause];
where "boolean" i9 a boolean expression. Boolean can be a single relational expression or two or more relational expressions ~eparated by the key wordq AND and OR. These relational expres~ion~ can be enclosed with parentheses, and then treated as a single relational expression separated from others with AND or OR. They are evaluated from left to right.
In the syntax, "clause" can be: a single statement, or a block of statements. Where clause is a block of statements, the block begins with the keyword DO and ends with the END verb. Further, Clause is always preceded by the keyword THEN or ELSE.
INSTR
The INSTR verb searches a character string to determine if a specific substring of characters i9 contained within it. The character ~tring in operand 1 is searched for the first occurrence of the character string in operand 2. If a matching string is found in operand 1, an integer number specifying itq ~tarting position ia placed in operand 3. If a matching string is not found, 0 is placed in operand 3.
The syntax for INSTR is: INSTR string,pattern,strt_pos;
INSTR string, pattern, ~trt_pos;
where "string" contains the character string to be searched. String can be a data name, system register P1 - P8 only, or a literal.
Continuing, "pattern" contains the character string pattern which may occur within the string operand, and can be a data name, system register P1 -P8 only, or a literal.
Finally, "strt_pos" is the name of the variable where the starting position (or o) i9 to be stored. Strt_pos can be a data name, or!system register P1 - P8 only.
LENGTH

f~- 133713Z

The LEWGTH verb i3 used to determine the length of a specified variable. An integer number specifying the number of characters in operand 1 i9 placed in operand 2. The syntax for LENGTH i9:
LENGTH field,length;
S where "field" contain3 the data whose length is to be determined. Field can be a data name, 3y3tem register P1 - P8 only, or a literal.
Continuing, on the other hand, "length" is the name of the variable which i3 to contains the length of the field operand, and can be a data name, or a ~ystem register P1 - P8 only.
LINK
The LINK verb transfers control to another TBOL program. Program execution continues at the first statement in the program whose object ID i3 contained in operand 1. Up to eight parameters may be passed to the "called"
program in operand 2 - 9. Control returns to the statement following the LINK statement when the "called" program performs an EXIT.
The 3yntax for LINR is:
LINK object_id [,parameter...];
where "object id" contain3 the object ID of a TBOL program, and can be data name, 3ystem register Pl - P8, only or a literal. Further, "parameter"
contains parameter data for the program whose object ID i3 contained in operand 1. The content3 of the parameter operand 2 through 9, if present, are placed in parameter regi3ters Pl through P8. The number of parameter operand i3 placed in P0. P0 through P8 are accessible to the "called"
program. Parameter can be a data name, system register, or a literal.
LOOKUP
The LOOKUP verb i33ued to search for an entry in a table of data contained in a character string. Operand 2 contains a single character string consi3ting of a number of logical records of equal length. Each record consist3 of a fixed-length key field and a fixed-length data field. Operand 3 contains the record length.
Operand 1 contains a search key equal in length to the length of the key field. OPerand 2 in searched for a record with a key field equal to operand 1. If a record with a matching key is found, an integer number specifying its starting position i3 placed in operand 4. If a matching record is not found, 0 i3 placed in operand 4.
The syntax for LOOKUP is:
LOOKUP schkey,table,rcd_lth,re3ult;
where "schkey" contain3 the key data of the desired record and can be a data name, system regi~ter or a litera. Further, ~table~ contains a character string consisting of a number of equal length logical records, and be a data name or system register P1 - P8 only. Yet further, "rcd)lth" contains an integer number equal to the length of a record in a table, and can be a data name, system register, or a literal. Finally, "reqult" is the name of the field to receive the result of the search. Result can be a data name, or a system register.
MAKE_FORMAT
The MAKE_FOR~AT verb is used to create a format map for use with the FORMAT verb. From l to 255 destination/length 3pecifications contained in operand (beginning in operand 2) are used to create a format map which is 1 33/ 1 ~
-stored in operand 1. Operand 1 can then be specified as the map operand in a FORMAT statement.
The MAKE FORMAT syntax i8:
MAKE FORMAT map,format[,format...];
where "map" is the name of the variable which is to contain the format map created with this statement. Map will be specified a~ an operand in a subsequent FORMAT statement to control the transfer of a string of character data to variables. Map can be either a data name or system register P1 - P8 only. Continuing, "format" contains a destination/length specification for one logical field of a qtring of character data. From 1 to 255 format operand can be specified in this statement to create a format map. Each format operand controls the transfer of one logical field of data from a character string when the format map created in this statement is used in a sub~equent FORMAT statement. In this arrangement, format can be a data name or a system register P1 - P8 only.
A destination/length specification in a format operand always contains a destination field name. The field name is followed by either one or two integer numbers controlling the length of the designation field data. The field name and numbers are separated by the colon character, e.g., destination:fix_lth:imbed_lth, or destination:fix 1th, or a~
destination::imbed 1th.
For this approach, "destination is a variable field name which will contain the logical field of data from the character string after the subsequent performance of the FORMAT verb. And, "fix lth" is an integer number between 1 and 33767 specifying a fixed field length for destination.
If fix 1th is not specified then 2 colon characters are used to separate destination from imbed 1th, showing that fix_lth has been omitted. In this case, the destination field length i9 controlled entirely by imbed 1th, which must be specified. If fix 1th is specified and imbed_lth is not, then fix 1th characters will be transferred to destination during the sub~equent performance of the FORMAT verb. Finally, if fix 1th iq specified with imbed 1th, then destination will have a length of fix_lth after the transfer of data by the FORMAT verb.
Continuing, "imbed 1th" is an integer number, either 1 or 2 which specifies length of an imbedded length field that immediately precedes the logical field of data in the character string. The imbedded length field contains the length of the logical field of data immediately following. For example, 1 specifie~ a 1-character length field and 2 specified a 2-character length field.
If imbed_lth i8 not specified then the designation field length is controlled entirely by fix_lth, which must be specified. If imbed 1th is specified and fix 1th is not, then the number of characters transferred to destination from the character string is controlled by the number in the one or two-character length field which precedes the logical field of data. If imbed 1th is specified with fix 1th, then the number of characters tran~ferred to destination from the character string is controlled by the number in the one or two-character length field which precedes the logical field of data. After the transfer of data, if the length of destination is not equal to fix 1th, then it is either truncated, or extended with blank 133713~

characte~S as necessary.
MOVE
The move verb copie3 data from one or more sourCe field9 into an equal number of destination fields. ~he data contained in the operand 1 data structure field tor field9) replace9 the content9 of the operand 2 data structure field (or fields). Operand 1 data remain9 unchanged. Normally, the moved data is converted to the data type of the de9tination. If the key word ABS is included as operand 3, then data conver9ion does not take place.
The syntax for MOVE i9:
~OVE source,destination[, ABS];
where "source" is the name of the data structure containing the data to be moved, and can be a data name, or a group data name, or system reqister, or a literal. Further "destination" i9 the name of the data structure field (or fields) to receive the source data, and can be a data name, or group data name, or a system register. Finally, "ABS" is a keyword specifying an absolute move; i.e., no data conversion takes place. ~owever, data residing in an integer register will always be in binary integer; and data residing in a decimal register will always be in internal decimal format.
If the source operand is a group data name, then the destination operand must be a group data name. Further, data in all of the fields contained in the source data structure or array are moved to the corresponding fields in the destination data structure or array.
MULTIPLY
The MULTIPLY verb multiplies two numbers. The number in o~erand 2 is multiplied by the number in operand 1. The number in operand 1 is unchanged.
~:~ The number in operand 2 is replaced with the product of the two numbers. The syntax for MULTIPLY is:
MULTIPLY numberl,number2;
where "numberl" contains the first number factor for the multiply operation, and can be a data name, system register or literal; and "number2" contains the second number factor for the multiply operation. Following execution, the contents of number2 are overlaid with the regulting of the product.
Number2 can be a data name, or a system register.
TBOL will automatically perform data conversion when numberl is not the same data type as number2. Sometimes this will result in number2 having a different data type after the add operation. Fractions will be truncated after 13 decimal places, and whole numbers will not contain a decimal point.
Negative results will contain a minus sign (-) in the left-most position.
NAVIGATE
The NAVIGATE verb is used to transfer control to the TBOL program logic associated with different page template objectg. The external effect is the display of a new screen page. Operand 1 containg either a page template object ID, or a keyword representing a navigation target page. Control is returned to the Reception System where the necessary objectg are acquired and made ready to continue the videotext session at the specified new page.
The syntax for NAVIGATE is:
NRVIGATE object_id;
where "object_id" contains the object ID of a target page template object, and can be a data name, register P1 - P8 only, or a literal.

1337~3~
NOTE
The NOTE verb returns the current position of the file pointer in a reception system flle. Operand l contains the name of a file. An integer number specifying the current position of the file's pointer is returned in operand 2. The NOTE syntax is:
NOTE filename,position;
where "filename" contains the name of a reception system file. The name of the file must be a valid MS-DOS file qpecification; e.g., [drive:][~path\~name[.extension]. Filename can be a data name, or a system register P1 - P8 only. Continuing, "position" is the name of the field to receive the current position of the file pointer for the file specified in filename, Thiq will be an integer number equal to the numeric offset from the beginning of the file; a 10 in position means the file pointer is positioned at the 10th character position in the file. Position can be a data name, or system register.
CPEN
The OPEN verb iq used to open a reception system file for file processing. The file named in operand 1 is opened for processing in the mode specified an operand 2. The syntax for OPEN is:
OPEN filename, INPUT:OUTPUT:I/O:APPEND:BINARY; where "filename" containq the name of the reception system file to be opened. As will be appreciated with thiq convention, the file name PRINTER specified the system printer. Otherwise, the name of the file must be a valid MS-DOS file specification; e.g.[drive:][\path\]name[.extension]. Filename can be a data name, or system register P1 - P8 only.
Further, "INPUT" is a keyword qpecifying that the file is to be opened for reading only; "OUTPUT" is a keyword specifying that the file iq to be opened for writing only; "I/O" is a key word specifying that the file is to be opened for both reading and writing; "APPEND" is a keyword specifying that the file is to be opened for writing, where new data is appended to existing data; and "3INARY" is a keyword specifying that the file i3 to be opened for both reading and writing. Where all file data is in binary format.
OPEN WINDOW
The OPEN WINDOW verb iq used to open a window on the base screen. The window whose object ID i9 contained in operand 1 is opened. Program execution continues with the first statement of the program associated with the newly opened window object. The syntax for OPEN_WINDOW i3:
OPEN WINDOW window id;
where "window id" contains the object ID of the window to be opened on the base screen, and can be a data name, or system register Pl - P8 only or a literal After performance of the OPEN wINDcn statement, program execution continueq with the firqt statement of the window program; i.e., the program associated with the newly opened window object. A window program relinquishes control by performing a CLOSE_WINDOW. Although a window program cannot perform an OPEN_WINDOW, it can use CLOSE_WINDOW to close itself and open another window. This process can continue through several windows.
Finally, when a window program performs a CLOSE_WINDOW without opening a new window, program control doeq not work its way back through all the window ~337132 _ programq. Instead, control return~ to the non-window program which opened the firqt window. Program execution continue~ in that program with the statement following the OPEN WINDOW qtatement. A window program can alqo cloqe itqelf by performing one of the following verbq: NAVIGATE; or TRIGGER FUNCTION. In ~uch cases, control doe~ not ~eturn to the program which opened the window.
OR
The OR verb performs a logical OR function on the bitq of two data field~. The logical ~um (OR) of the bits of operand 1 and operand 2 iq placed in operand 2. Moving from left to right, the OR is applied to the corresponding bit~ of each field, bit by bit, ending with the last bit of the shorter field.
If the correjponding bits are 1 and 1, then the result bit iq 1. If the corresponding bit~ are 1 and 0, or 0 and 1, then the re~ult bit iq 1.
If the correqponding bit~ are 0 and 0, then the reqult bit i9 O.
The data in operand 1 is left unchanged. The data in operand 2 i~
replaced by the reqult.
The ~yntax for OR iY
OR fieldl,field2;
where "fieldl" contain~ the first data field, and can be a data name, or qy~tem regiAter I1 - I8 or P1 - P8 only, or a literal. Further, "field2~
contains the qecond data field. The contents of field2 are overlaid by the re~ult of the OR operation. Field2 can be a data name, or ~ystem regi~ter I1 - I8 or P1 - P8 only. As will be appreciated by tho~e ~killed in the art, the OR verb can be u~ed to qet a bit to 1.
POINT
The POINT verb i~ used to ~et the file pointer to a specified poqition in a reception qyqtem file. Operand 1 contain~ the name of a file. The file'q pointer i9 set to the po~ition specified by the integer number in operand 2. The POINT qyntax i~:
POINT filename,poqition;
where "filename" contain~ the name of a reception syqtem file. The name of the file muqt be a valid MS-DOS file qpecification; e.g.
[drive:][\path\]name[.exten~ion]. File name can be a data name, or ~ystem regiqter P1 - P8 only. Further, "poqition" contains an integer number equal to the deqired poaition of the file pointer for the file ~pecified in filename. A 10 in poqition mean~ the file pointer will be positioned at the 10th character poqition in the file. Po~ition can be a data name, or qy~tem register or literal.
PoP
The POP verb tran~fer~ data from the top of the 3y3tem qtack to a variable field. The contentq of operand 1 are replaced with data removed from the top of the qyqtem qtack. The POP syntax i~:
POP field;
where "field" iq the name of the variable field to receive data from the stack, and can be a data name, or a system register.
PUSH
The PUSH verb tranqfer~ data from a variable field to the top of the syqtem qtack. The data contained in operand 1 i~ placed on the top of the . "

~ 1 337 1~ ~~ Y'' _ system stack, "pushing down" the current contents of the stack. The contents of operand 1 remain unchanged. The PUSH syntax is:
PUSH field;
where "field" is the name of the variable field containing data to be ~pushed~' on the stack, and can be a data name, or a system register, or a literal.
READ
The READ verb is used to read data from a reception system file into a variable field. Operand 1 contains the name of a file. Data is read from the file, beginning with the character position specified by the current contents of the file's pointer. Data read from the file replaces the contents of operand 2. Operand 3 may be present, containing an integer number specifying the number of characters to be read. For ASCII files, data is read from the file until the first end-of-line character (ASCII 13) is encountered. Or, if operand 3 i9 present, until the number of characters specified in operand 3 is read. For binary files, operand 3 is required to specify the length of the data to be read from the file.
The syntax for READ is:
READ filename,input [,length];
where "filename" contains the name of a reception system file, which must be a valid MS-DOS file specification, e.g.
[drive:][\path\]name[.extension]. Filename can be a data name, or system register Pl - P8 only. Continuing, "input" is the name of the variable field to receive data read from the file, and can be a data name, or a system register Pl - P8 only. Finally, "length" contains an integer number. For ASCII files, length specifies the ~-xi~lm number of characters to be read.
For binary files, length specifies the length of the data to be read.
As will be appreciated by those skilled in the ar', in order to perform a READ operation, a file must first be opened as INPUT or I/O before the READ
operation can take place.
RECEIVE
The RECEIVE verb is used to access the expected reply to a message sent previously to a host system. Operand 1 contains the message ID of a message sent previously to a host system. The message reply from the host replaces the contents of operand 2. The RECEIVE syntax is:
RECEIVE msg_is,message;
where "msg_id" contains the ;message ID of a mesSage sent previously to a host system, and can be a data name, or a system register Pl - P8 only.
Further, "message" is the name of the variable field to receive the incoming message reply, and can be a data name, or a system register Pl - P8 only.
RELEASE
The RELEASE verb reclaims memory space in the reception system by deleting a block of data saved previously with the SAVE verb. The block of data named in operand 1 is deleted from memory.
The syntax for RELEASE is:
RELEASE block name;
where "block name" contains a block name used in some previously performed SAVE statement,and can be a literal.
REFRESH

~ ~33,~3Z
~,. ..
.

-- The REFRESH verb causes the current screen fields to receive the contents of the associated partition external variables. The contents of all fields on the current screen~ are replaced with the contents of their corresponding partition external variables. The REFRESH syntax is:
REFRESH.
The REFRESH operation occurs automatically whenever all programs for a given event ~for example, commit; field end; or initial display) have finished execution. Therefore, a program should only perform a REFRESH statement if fields are updated during an event.
RBSTORE
The RESTORE verb is used to restore the previouYly saved contents of a block of variables. The block of data named in operand 1 replaces the contents of a block of variables, beginning with the variable named in operand 2. The RESTORE syntax is:
RESTORE block name,fieldl;
where "block name" contains a block name used in some previously performed SAYE statement, and can be a literal. Further, "fieldl" is the name of the first field or a data structure to receive data from the block specified in block name. Fieldl can be a data name, or a group data name.
RETURN
The RETURN verb is used to return control to the procedure which "called" the currently running procedure. Execution of the currently running procedure i~ ended. The data in operand 1 is moved to SYS_RETURN CODE, and control is returned to the procedure which "called" the currently running procedure.
The RETURN syntax is:
RETURN return-code;
where "return-code" contains data to be moved to SYS_RETURN_CODE prior to transfer of control to the "calling" procedure, and can be a data name, or system register, or a literal. It should be noted that in the highest level procedure of a program, a RETURN or an END_PROC is equivalent to an EXIT.
SAVE
The SAVE verb is used to save the contents of a block of variables.
Operand 1 contains a name to be assigned to the block of saved data. This name will be used later to restore the data. If operand 2 is specified without operand 3, then operand 2 may contain the name of a field, an array, or a data structure. In this case, the contents of the field; or the contents of all the elements in the array; or the contents of all the fields in the data structure are saved under the name specified in operand 1. If operand 2 and operand 3 are specified, then they both must contain a field name. In this case, the contents of all the fields, beginning with the field in operand 1 and ending with the field in operand 2, are saved under the name specified in operand 1.
~5 The syntax for SAVE is:
SAVE block_name,namel ~,name2];
where "block_name" contains a block name to be assigned to the saved data, and will be used subsequently to restore the saved contents of the fields.
Block name can be a data name, system register Pl - P8 only, or a literal.

~ ~33~3~

Continuing, "namel" contain9 the name of a field, array, or data structure to be saved. If name2 is specified, namel muqt conta n a field name. Namel can be a data name. Further, "name2" contains the la9t field name of a range of fields to be saved, and it can be a data name.
SEND
The SEND verb i9 used to transmit a message to a host ~ystem. The message text contained in operand 2 is transmitted from the reception system using a message header constructed from the data contained in operand 2.
Operand 3, if present, indicates that an incoming response to the message is expected. The syntax for SEND is:
SEND message [,RESPONSE:TIMEOUT~;
where "message" contains the outgoing message text (the header data for which has been placed in GEVs before SEND), and can be a data name, or a system register, or a literal. "RESPONSE" i9 a keyword indicating that a response to the message is expected. "TIMEOUT" is a parameter that sets the number of seconds for message time-out.
After performance of the SEND ~tatement, the global external system variable SYS LAST MSG ID contains a message ID number assigned to the outgoing message by the Reception System. This message ID number can be used later in a RECEIVE statement.
SET ATTRIBUTE
The SET ATTRIBUTE verb i9 used to set or change the color and input format attributes of a screen field. The characteristics of the screen field expressed as operand 1 are.set or changed according to the specifications contained in operand 2. The syntax for SET ATTRIBUTE ig:
SET ATTRIBUTE name, attr list;
where "name" expresses the name o the field whose characteristics are to be set or changed. This is a partition external variable name, and if the name is expressed as a literal; e.g., "SET ATTRIBUTE 1,...", then this is taken to mean that the attributes of the partition external variable &1 containg the name of the partition external variable whose attributes are to be set by this statement.
Further, "attr list" is a literal character string containing a list of key words and values describing the desired attributes to be assigned to the field expressed in operand 1.
When SET ATTRIBUTE is performed, existing field attributes remain in effect unless superseded by the attribute list contained in operand 2.
The attribute 11st operand literal is in the form:
keyword[(values)][,keyword[(values~]...].
It should also be noted that where key words and their associated values are: "DISPLAY", not user input data can be entered in a field with this attribute; "INPUT", a field with this attribute can receive user input data; "ALPHABETIC", an INPUT field with this attribute can receive any alphabetic character: A through A, and blank; "ALPHANUMERIC", an "INPUT", field with this attribute can receive any displayable character; "NUMERIC", an INPUT field with this attribute can receive any numeric character: O
through 9, ( 5 ), ( , ), ( . ), and ~ "PASSWORD", an INPUT field with this attribute is intended for use as a password field. Any character entered by the user is displayed in the field as an asteri~k ~ * ); "ACTION", 133713~

_ a field with this attribute is a T80L "action" field; "COLOR-(fg,bg)", where fg and bg are numeric values specifying the foreground and background colors of the field; "FORM(pattern)", where pattern specifies the ~nput data format for this field. Pattern may contain "A", an alphabetic character of A
through Z, which must be in this position; "a", an alphabetic character of A through Z, or a blank, which must be in this position; "N" a number character of O through 9, or ( S ), ( , ), ( . ), or ( - ) which must be in this position; "n", a numeric character of O through 9, or ( S ), ( , ), ( . ), ( - ), or a blank may occupy this position; "X", any displayable character which must be in this position; and "x", any displayable character or a blank which must be in this position.
Any other character in the pattern is displayed in the field as a literal, and acts as an autoskip character at user input time. To include any of the pattern characters as laterals in the pattern, they must be preceded by the back91ash character. For example, to include the character "A: as a literal in a pattern it would code as "\A". To include the backslash character as a litera, it would code as "\\"
SET_CURSOR
The SET_CURSOR verb moves the cursor to the field specified as operand 1, itself specified as a field number. The syntax for the SET_CURSOR verb is:
SET_CURSOR [field number]
SET_FUNCTION
The SET FUNCTION verb changes and/or filters a "logical function"
process program. The syntax for SET_FUNCTION is: SET_FUNCTION function_id, status[,program_object_id [,state]]; where "function_id_ is the logical function" identifier; "status" is one of the following key words: "DISABLE";
"FILTER"; or "ENABLE". DISABLE is used to deactivate "logical function".
FILTER is used to execute the logic contained in program_object_id prior to executing the normal "logical function" process. It the logic contained in program object_id returns a non-zero SYS_RETURN_CODE< the normal "logical function" process will not execute, otherwise, it begins. ENABLE is used to set "logical function" to normal default process.
Continuing, in the SET_FUNCTION syntax, "program_object_id" is the 13 byte object_id of the TBOL program, tconditional); and "state" is data to be passed to the "logical function" program. The data will reside in the P1 register when logic is executed, (optional).
SORT
The SORT verb i9 used to sort a range of variable fields into the sequence of the key contained in each field. Each variable field contains a record consisting of a fixed-length key field followed by a data field.
The key field is the same length is each record. Operand 1 contains the name of the first field in the range of fields to be sorted; operand 2 contains the name of the last field. Operand 3 contains an integer number specifying the length of the key field contained in the beginning of each field. The fields in the range specified by operand 1 and operand 2 are sorted into the sequence of the key field.
The syntax for SORT is:
SORT fieldl,field2,key_lath;

~ 133i7) 32 _ where "fieldl" contains the fir~t field name of the range of fields to be qorter, and can be a data name, or ~yqtem register Pl - P8 only; "field2"
contains the la~t field name of the range of fields to be sorted and can be a data name; or system register P1 - P8 only; and "key_lath" contain~ an integer number equal to the length of the key field contained in each field in the range. Key_lath can be a data name, or system register P1 - P8 only or a literal.
SOUND
The SOUND verb is used to produce a sound through the reception system speaker. A sound is produced of the pitch specified by operand 1, for the duration specified by operand 2, If operand 1 and operand 2 are not present, values from the most recently performed SOUND statement are u~ed. The SOUND
syntax i~:
SOUND [pitch,duration];
where "pitch" is a numeric value in the range of 0 to 20,000 specifying the desired pitch of the sound. Pitch can be a data name, system register P1 -P8, or a literal; and "duration" i~ a numeric value in the range of 0 to 65,535 specifying the desired duration of the sound in increment~ of .1 seconds. Duration can be a data name, or ~y~tem register P1 - P8 only or literal.
STRING
The STRING verb join~ multiple character string~ together with into one character string. Up to eight character strings, beginning with the character string contained in operand 1, are joined together qequentially. The resulting new character string replaces the contents of operand 1. The STRING syntax i~
STRING stringl, [,~tring...];
where "~tringl" iq empty, or contain~ the character string which will become the left-most portion of the new character string, and a data name, or a ~y~tem regi~ter P1 - P8 only; "~tring" i9 empty, or contain~ the character string to be joined behind the character strings in preceding operand, and can be a data name, or ~ystem register P1 - P8 only or a literal.

The SU3STR verb i9 used to copy a substring of cha~acters from a character string into a de~ignated variable field. The character ~tring containing the ~ubstring is in operand 1. Operand 3 contains an integer number equal to the position of the first character to be copied. Operand 4 contains an integer number equal to the number of characters to be copied.
The specified substring is copied from the character string in operand 1 and replaces the contents of operand 2.
The syntax for SUBSTR i~:
SU3STR ~tring,de~tination,strt_po~,length;
where "string" containa a character string, and can be a data name or system regi~ter P1 - P8 only, or a literal; "destination" is the name of the variable field to receive the substring copied from the ~tring operand, and can be a data name, or ~ystem regi~ter P1 - P8 only, "strt,pos" contains an integer number specifying the po~ition of the first character to be copied into the de~tination operand, and can be a data name, or system register or a literal; and "length" contains an integer number specifying the number of ~ : 1 33 7~32 t :,~,,f character~ to be copied into the destination operand, and can be a data name, or system register or a literal.
In accordance with this arrangement, the SUBSTR operation does not take place if: if the length operand i~ 0, or if the strt_pos operand is greater than the length of the string operand.
SUBTRACT
The SUBTRACT verb subtracts one number from another. The number in operand 1 i9 subtracted from the number in operand 2. The number in operand 1 i9 unchanged. The number in operand 2 is replaced by the arithmetic difference between the two numbers. The syntax for SUBTRACT is:
SU3TRACT numberl,number2;
where "numberl" contains the number to be subtracted from number2, and can be a data name, or ~ystem register, or a literal; "number2" contain~ the second number. As noted, the contents of number2 are overlaid with the resulting difference. Number2 can be a data name, or system regiqter.
TBOL will automatically perform data conversion when numberl is not the same data type as number2. Sometimes this will result in number2 having a different data type after the subtract operation. Fractions will be truncated after 13 decimal place~, and whole numbers will not contain a decimal point. Further, negative results will contain a minus sign (-) in the left-most position.
TRANSFER
The TRANSFER verb transfers control to another TBOL program. Control however, does not return to the original program. Rather, program execution continues at the firqt statement in the program whose object ID i9 contained in operand 1. Up to eight parameter~ may be passed to the "called" program in operand 2 - 9. Control i~ transferred to the Reception Sy~tem when the "called" program performs an EXIT.
The syntax for TRANSFER is:
TRANSFER object id [,parameter... ];
where "object id" contains the object ID of a TBOL program, and can be a data name, or system register P1 - P8 only, or a literal; "parameter" contains parameter data for the program whose object ID i9 contained in operand 1.
The contents of the parameter operand 2 through 9, if present, are placed in parameter registers P1 through P8. The number of parameter operand is placed in P0. P0 through P8 are accessible to the "called" program. Parameter can be a data name, or system regi~ter, or a literal.
TRIGGER_FUNCTION
The TRIGG8R FUNCTION verb is designed to execute a "logical function".
Its syntax is:
TRIGGER FUNCTION function id;
where "function id" is the logical function" identifier. In accordance with the design of TRIGGER.FUNCTION, control may or may not be returned ~epending on the function requested.
UPPERCASE
The UPPERCASE verb convert3 lowerca~e alphabetic character~ to uppercase alphabetic characters. Lowercase alphabetic characters (a - z) in the character string contained in operand 1 are converted to upperca~e alphabetic characters (A - Z). The syntax for UPPERCASE is:

1 3 3 7 1 3 ~

_ UPPERCASE string;
where "string" contains a character string, and can be a data name, or a system register P1 - P8 only.
WAIT
The WAIT verb causes program control to be given to the REception System for the number of seconds defined in the parameter head. Control is given to the Reception System for one "time slice" and then returned to the currently running program.
The WAIT syntax is simply:
WAIT;seconds WHILE ..THEN
The key word WHEN causes a qingle statement or a block of 9tatements to be executed repetitively while a specified boolean expression i9 true.
The key word WHILE is followed by a boolean expression. The boolean expression is always followed by a THEN clause. The boolean expression i9 evaluated to determine whether it is "true" or "false". If the expression is true, the THEN clause is executed and the expression is evaluated again.
If the expression is false, program execution continues with the statement following the THEN clause.
20The syntax for WHILE..... THEN is:
WHILE boolean THEN clau3e;
where "boolean is a boolean expression, which can be a single relational expression, where a relational expression consists of two operand separated by a relational operator such as (=), (<>), (~), (>), (<=), or (=>), or two or more relational expressions separated by the key words AND or OR. These relational expressions can be enclosed with parentheses, and then treated as a single relational expression separated from others with and or OR.
Further, they are evaluated from left to right. Continuing, with the syntax for WHILE...THEN, "clause" can be either a single statement, a block of statements, where the block begins with the key word GO and ends with the END
verb.
When character strings of unequal length are compared lexicographically, the longer string is truncated to the length of the shorter string before the comparison. If the shorter string compares "high", then the longer string is "lower". For example: When comparing "GG" to "H", "GG" is valued as less than"H". If the shorter string compares "low" or "equal", then the longer string is "high". For example: When comparing "TO"
to "TOO", "TO" is less than "TOO".
In this regard, truncation is done outside of the operand, which the operand remaining the same length after the evaluation.
WRITE
WRITE is the verb used to write records to a file. The syntax for WRITE is:
WRITE filename , output_area [, key];
where "filename" is the name of the file that the record is to be written to, and can be a field_id, array id(subscript), partition external id, global_external_id, or a literal; "output_area" is the name of the area from which the record will be created, and can be a field_id, array_id(subscript), partition_external_id or a global_external_id; and "length" specifies either the maximum number of characters to be read from an ASCII file, or the length ~- 1337/~

of data to be read from a binary f~le. The file must have been previously opened as OUTPUT, APPEND, or I/O.
XOR
The XOR verb performs a logical XOR function on the bits of two data fields. The modulo-two sum (exclusive OR) or the bits of operand 1 and operand 2 i9 placed in operand 2. Moving from left to right, the XOR is applied to the corresponding bits of each field, bit by bit, ending with the last bit of the shorter field. If the corresponding bits are 1 and 0, or 0 and 1, then the result bit i9 1. If the corresponding bits are 1 and 1, or 0 and 0, then the result bit is 0. The data in operand 1 is left unchanged.
The data in operand 2 is replaced by the result.
The syntax for XOR is:
XOR fieldl,field2;
where "fieldl" contains the first data field, and can be a data name, a system register Il - I8 or Pl - P8 only, or a literal; and "field2" contains the second data field. AQ in other logic operation3, the contents of field2 are overlaid by the result of the XOR operation. Field2 can be a data name, ~ystem regi3ter Il - I8 or Pl - P8 only.
As will be appreciated by those skilled in the art, the XOR verb can be used to invert a bit. Further, any field XOR'ed with itself becomes all zeros, and, the sequence: XOR A.B; XOR B.A; XOR A.B; causes the contents of A and B to be exchanged.
GLOBAL EXTERNAL SYSTEM VARIABLES
In accordance with the design of TBOL, names have been a~igned to the TBOL system variables in the global external variable (GEV) data structure.
The names of GEVs are assigned in DEFINE statements as described above and in the file TBOL.SYS. There are a total of 32,000 GEVs. The first 256 GEVs are reserved for the system, and the re~~;n;ng 31,744 are assigned as application variables, and are application specific. Since system variables referenced by TBOL interpreter as global variables and are ASCII strings, a system variable table is constructed so that reception system native code can access them as binary integer. An adaptation of thiC~ table from the source code file "\rs\rsk~c\sysvar.c", presented in more detail hereafter, is shown in Table 1.

SYSTEM GLOBAL EXTERNAL VARIABLES

System Variable Name GEV# Description Sys rtn code; 0001 API instr. return code.
Sys_api_event; 0002 API event: post,pre,init or sel Sys logical_key; 0003 Current logical key.
Sys last msg id; 0004 LaYt mes9age id.
Sys tone pulse; 0005 Phone type pulse/tone.
Sys_line statu~; 0006 Line connection status.
Sys keyword; . 0007 Keyword flag.
Sys automatic uppercase; 0008 Auto uppercase.
Sys scroll increment; 0009 Scroll increment.

1 3 3 7 1 ~ ~`

- Sys_current_field; 0010 Current field.
Sys_date; 0011 system date.
Sys_time; 0012 system time.
Sys_current_page; 0013 current page.
Sys_selected_obj_id; 0014 sel object id.
Sys_navigate_obj_id; 0015 nav object id.
Sys_cursor_row; 0016 cursor row position.
Sys_cursor_coli 0017 cursor col position.
Sys_path; 0018.u~er personal path table.
Sys_ttx_phone; 0019 dial trintex phone #.
Sys_total pages; 0020 total pages in page set.
Sys_page_number; 0021 curr. page of of n pages.
Sys_base_obj_id; 0022 curr. base page object-id.
Sys window_id; 0023 curr. window object-id.
Sys_path_ptr; 0024 curr. path location.
Sys_keywords; 0025 keyword list.
Sys_current_cursor_pos; 0026 curr. cursor position.
Sys_current_background_color;0027 curr background color.
Sys_current foreground_color;0028 curr foreground color.
Sys hardware_status; 0029 nature of hard error.
Sys_nocomm; 0030 send:don't send to S1.
Sys_um_dia header; 0031 header unsolicited msg.
Sys um_message text; 0032 text unsolicited msg.
Sys_ca_error_track_info; 0033 error tracking data. --25 Sys_assisant_current_info; 0034 curr. context info. --Sys_screen_data_table; 0035 data table copy & file.
Sys ad_list; 0036 pointer to AD list.
Sys_current keyword; 0037 pointer to cur. keyword.
Sys_previous_keyword; 0038 pointer to prev. keyword.
30 Sys_guide; 0039 guide.
Sys_previous_menu; 0040 prev menu object-id.
Sys_previous_seen_menu; 0041 prev seen menu obj-id.
Sys_scan_list; 0042 pointer to scan list.
Sys_scan_list_pointer; 0043 user scan list pointer.
35 Sys_path_name; 0044 Pointer to path name.
Sys_navigate_keyword; 0045 Navigate to keyword.
Sys_keyword_table; 0046 Sys_keyword_disp; 0047 Sys_keyword_table_entry_length;0048 Sys_keyword_length; 0049 Sys_ext_table; 0050 Sys_data_collect; 0051 Indicate~ Tracking status.
Sy8 fmO txhdr; 0052 DIA message header Sys_fmO_txdid; 0053 Sys fmO txrid- 0054 _ Sys_fm4_txhdr; 0055 Sys_fm4_txuseid; 0056 Sys_fm4_txcorid; 0057 Sys_fm64_txhdr; 0058 ~ 33 7 ~ 3 ~
~ Sys_fm64 txdata; 0059 Syq fmO rxhdr; 0060 Syq fm4 rxhdr; 0061 Sys fm4 rxuqeid; 0062 Syq fm4 rxcorid; 0063 Sys fm64 rxhdr; 0064 Sys fm64 rxdata; 0065 Sys ~urrogate; 0066 md Sys leave; 0067 md Sys return; 0068 md Sys int regs; 0069 md,area for int ~ave stack Sys ttx help id; 0070 md,id of syq help window/
Syq elector data; 0071 md Syq qelector path; 0072 md Sys logical event; 0073 am Sys user id; 0074 mg/
Syq help appl; 0075 md/
Sys help hub appl pto; 0076 md/
Sys acce~s key obj id; 0077 lw,bi/
Syq word wrap-1; 0078 Syq meqsaging status; 0079 Sys version; 0080 Syq leader ad id; 0031 _ Sys baud rate; 0082 -~~
2 5 Sy9 com port; 0083 Syq obj header; 0084 Sy9 Aeqsion status; 0085 Syqtbl sys var table [] - NA Define system var table.
6Sys rtn code, INTLEN, SYS INT TYPE, &Sys api event, INTLEN, SYS INT TYPE, &Sys logical key, INTLEN, SYS INT TYPE, &Sys last mqg id, INTLEN, SYS INT TYPE, &Sy~ tone pulAe, INTL,EN, SYS INT TYPE, &Sys line ~tatus, INTLEN, SYS INT TYPE, &Sy~ keyword, - INTLEN, SYS INT TYPE, &Syq automatic uppercase, INTLEN, SYS INT TYPE, &Sys scroll increment, INTLEN, SYS INT TYPE, &Sys current field, INTLEN, SYS INT TYPE, &(unqigned int) Sy9 date, O, SYS STR_TYPE, 6(unqigned int)Sya time, O, SYS STR_TYPE, &Sys current_page, O, SYS INT_TYPE, &(unsigned int)Sys selected_obj id, O, SYS STR TYPE, &(unsigned int)Sys navigate_obj id, O, SYS STR_TYPE, &Sy~ cursor row, O, SYS INT_TYPE, &Syq_cursor col, O, SYS INT_TYPE, &(unsigned int)Sy~_path, O, SYS STR_TYPE, &(unsigned int)Sys ttx phone,O, SYS STR TYPE, &Syq total pages, INTLEN, SYS INT TYPE, &Syq page number, INTLEN, SYS INT TYPE, 337i32 &tunsigned int)Sys base obj_id, O, SYS STR_TYPE, &(unsigned int)Sys window id, O, SYS_STR TYPE, &Sys path ptr, INTLEN, SYS INT_TYPE, &(unsigned int)Sys keywords, O, SYS STR TYPE, &Sys current cursor_pos, INTLEN, SYS_INT_TYPE, &Sys current background color,INTLEN,SYS INT TYPE, &Sys current_foreground color~INTLEN~sys-INT-TypE~
6Sys hardware status, INTLEN, SYS_INT_TYPE, &Sys nocomm, INTLEN, SYS_INT_TYPE, &(unsigned int)Sys um dia header,O, SYS STR TYPE, &(unsigned int)Sys um message text,O,SYS STR TYPE, &(unsigned int)Sys ca error track info,O,SYS STR TYPE, &(unsigned int)Sys assisant current infoO,SYS STR_TYPE, &(unslgned int)Sys screen data_table,O,SYS STR TYPE, &(unsigned int)Sys ad list, O, SYS_STR TYPE, &(unsigned int)Sys current keyword,O,SYS_STR TYPE, &(unsigned int)Sys previous_keyword,O,SYS STR TYPE, ~-&(unsigned int)Sys guide, O, SYS STR_TYPE, &(unsigned int)Sys_previous menu,O, SYS STR TYPE, &(unsigned int)Sys_previous seen menu, O, SYS STR TYPE, &(unsigned int)Sys scan list,O, SYS STR TYPE, &(unsigned int)Sys scan list pointer, O, SYS_STR_TYPE, &(unsigned int)Sys_path_name, O, SYS_STR TYPE, &(unsigned int)Sys_navigate_keyword,O,SYS_STR_TYPE, &(unsigned int)Sys keyword_table, O, SYS STR_TYPE, &Sys keyword_disp, INTLEN, SYS INT TYPE, &Sys keyword table entry length, INTLEN, SYS INT TYPE, &Sys keyword_length, INTLEN, SYS INT TYPE, &(unsigned int)Sys ext table,O, SYS STR TYPE, &()Sys data collect, &(unsigned int) Sys fmO txhdr,O, SYS STR_TYPE, &(unsigned int) Sys fmO_txdid,O, SYS STR_TYPE, &(unsigned int) Sys fmO_txrid,O, SYS STR_TYPE, &(unsigned int) Sys fm4_txhdr,0, SYS STR TYPE, &(unsigned int) Sys fm4 txu9eid,0, SYS STR TYPE, &(unsigned int) Sys fm4 txcorid,O, SYS STR TYPE, &(unsigned int) Sys fm64 txhdr, O, SYS STR TYPE, &(unsigned int) Sys fm64 txdata,O, SYS STR TYPE, &(unsigned int) Sys fmO rxhdr, O, SYS_STR_TYPE, &(unsigned int) Sys fm4_rxhdr, O, SYS_STR_TYPE, &(unsigned int) Sys fm4_rxuseid,0, SYS STR_TYPE, &(unsigned int~ Sys fm4 rxcorid,O, SYS STR_TYPE, &(unsigned int) Sys fm64 rxhdr, O, SYS STR TYPE, &(unsigned int) Sys fm64 rxdata,O, SYS STR TYPE, &Sys surrogate, INTLEN, SYS INT TYPE, &(unsigned int) Sys leave, O, SYS STR_TYPE, &(unsigned int) Sys return, O, SYS_STR_TYPE, &(un~igned int) Sys int regs,O, SYS STR TYPE, &(unsigned int) Sys ttx help id, O, SYS STR TYPE, ~...~r, ~ 1337)32 ~ &(unsigned int) Sys selector data,O, SYS STR_TYPE, &(unsigned int) Sys selector_path,O, SYS_STR_TYPE, &Sys logical event, INTLEN, SYS INT_TYPE, &(unsigned int) Sys_user id, O, SYS STR TYPE, &Sys help_appl, INTLEN, SYS INT TYPE, &(unsigned int) Sys help hub appl pto, O, SYS_STR_TYPE, &(unsigned int) Sys access key_obj_id, O, SYS_STR_TYPE, &Sys word wrap, 1, SYS_ INT_ TYPE, &(unsigned int)Sys messaging_status, O,SYS_STR_TYPE, &(unsigned int) Sys version, O, SYS_STR_TYPE, &(unsigned int) Sy9 leader ad id,O, SYS STR_TYPE, &Sys baud_rate, INTLEN, SYS INT_TYPE, &Sys com port, INTLEN, SYS INT TYPE, &Sys obj header, C, SYS STR TYPE,/RDC
&Sys ~ession status, INTLEN, SYS INT TYPE, Table 2 DATA PROCESSING
ADD LOOKUP SAVE
AND MAKE FORMAT SORT
CLEAR MOVE STRING
DIVIDE MULTIPLY SUaSTR
EDIT OR SUBTRACT
FILL POP UPPERCASE
FORMAT PUSH XOR
INSTR RELEASE
LENGTH RESTORE
PROGRAM FLOW
CLOSE WINDOW LINK TRANSFER
EXIT NAVIGATE TRIGGER FUNCTION
GOTO OPEN WINDOW WAIT
GOTO DEPENDING ON RETURN WHILE... THEN
IF... THEN... ELSE SET FUNCTION SYNC RELEASE

COMMUNICATIONS
CONNECT RECEIVE
DELETE SEND
DISCONNECT

FILE MANAGEMENT
CLOSE OPEN READ
NOTE POINT WRITE

SCREEN MANAGEMENT
DEFINE_FIELD SOUND
SET ATTRIaUTE REFRESH

1 337 1 3~
- SET_CURSOR

FETCH
PROGRAM STRUCTURE
DO... END END_PROC

RS 400 of computer system network 10 uses software called native code modules (to be described below~ to enable the user to select options and functions presented on the monitor of personal computer 405, to execute partitioned applications and to proce~ user created events, enabling the partitioned application to interact with interactive system 10. Through this interaction, the user iq able to input data into fields provided aq part of the display, or may individually select choices causing a standard or personalized page to be built (as explained below) for display on the monitor of personal computer 405. Such inputs will cause RS 400 to interpret events and trigger pre-processors or post-processors, retrieve specified objects, communicate with system components, control user options, cause the display of adverti3ements on a page, open or close window partitions to provide additional navigation possibilitieq, and collect and report data about events, including certain types of objectq proceq~ed. For example, the user may select a particular option, such as opening or closing window partition 275, which is present on the monitor and follow the qelection with a completion key stroke, such as ENTER. ~hen the completion keystroke is made, the selection is translated into a logical event that triggers the execution of a post-processor, (i.e., a partitioned application program object) to process the contents of the field.
Functions supporting the user-partitioned application interface can be performed using the command bar 290, or its equivalent using pull down windows or an overlapping cascade of windows. These functions can be implemented as part of the RS native functions or can be treated as another partition(s) defined for every page for which an appropriate set of supporting objects exist and remain resident at RS 400. If the functions are part of RS 400, they can be altered or extended by verbs defined'in the RS virtual machine that permit the execution of program objects to be triggered when certain functions are called, providing ~ximllm flexibility.
To explain the functions the use of a command bar is assumed. Command bar 290 is shown in Figures 3(a) and 3~b) and includes a NEXT command 291, a BACR command 292, a PATH command 293, a MENU command 294, and ACTION
command 295, a JUMP command 296, a HELP command 297, and an EXIT command 298.
NEXT command 291 causes the next page in the current pageset to be built. If the last page of a pageset has already been reached, NEXT command 291 is disabled by RS 400, avoiding the presentation of an invalid option.
BACK command 292 causes the previous page of the current pageset to be built. If the present page is the first in the pageset, BACK command 292 is disabled, since it i~ not a valid option.
A filter program can be attached to both the NEXT or BACK functions to ~''' 1337132 modify their implicit sequential nature based upon the value of the occurrence in the object set id.
PATH command 293 causes the next page to be built and displayed from a list of pages that the user has entered, starting from the fist entry for every new session.
MENU command 294 causes the page presenting the previous set of choices to be rebuilt.
ACTION command 295 initiates an application dependent operation such as causing a new application partition to be interpreted, a window partition 275 to be opened and enables the user to input any information required which may result in a transaction or selection of another window or page.
JUMP command 296 causes window partition 275 to be opened, allowing the user to input a keyword or to specify one from an index that may be selected for display.
HELP command 297 causes a new application partition to be interpreted such as a HELP window pertaining to where the cursor is positioned to be displayed in order to assist the user regarding the present page, a particular partition, or a field in a page element.
EXIT command 298 causes a LOGOFF page template object PTO to be built, and a page logoff sequence to be presented at RS 400 monitor screen 414.

NAVIGATION INTERFACE
Continuing, as a further feature, the method aspect of the invention includes an improved procedure for searching and retrieving applications from the store of applications distributed throughout network 10; e.g., server 205, cache/concentrator 302 and RS 400. More specifically, the procedure features use of pre-created search tables which represent subsets of the information on the network arranged with reference to the page template objects (PTO) and object-ids of the available applications so that in accordance with the procedure, the relevant tables and associated objects can be provided to and searched at the requesting RS 400 without need to search the entire store of applications,on the network. As will be appreciated, this reduces the demand on the server 205 for locating and retrieving applications for display at monitor 412.
In conventional time-sharing networks that support large conventional databases, the host receives user requests for data records; locates them;
and transmits them back to the users. Accordingly, the host is obliged to undertake the data processing necessary to isolate and Yupply the requested information. And, as noted earlier, where large numbers of users are to be served, the many user requests can bottleneck at the host, taxing resources and leading to response slowdown.
Further, users have experienced difficulty in searching data bases maintained on conventional time-sharing networks. For example, difficulties have resulted from the complex and varied way previously known database suppliers have organized and presented their information. Particularly, some database providers require searching be done only in selected fields of the data base, thus requiring the user to be fully familiar with the record structure. Others have organized their databases on hierarchial structure~
which require the user understand the way the records are grouped. Still Y ~33?1 3~
~, , further, yet other database suppliers rely upon keyword indices to facilitate searching of their records, thus requiring the user to be knowledgeable regarding the particular keywords used by the database provider.
The method aspect of the present invention, however, serves to avoid such difficulties. In the preferred embodiment, the invention includes procedures for creating preliminary searches which represent subsets of the network applications uaers are believed likely to investigate. Particularly, in accordance with the~e procedures, for the active applicationa available on network 10, a library of tables is prepared, and maintained within each of which a plurality of ao called "keywords~' are provided that are correlated with page template objects and object-ids of the entry screen (typically the first screen) for the respective application. In the preferred embodiment, approximately 1,000 tablea are used, each having approximately 10 to 20 keywords arranged in alphabetical order to abstract the applications on the network. Further, the object-id for each table is asjociated with a code in the form of a character 9tring mnemonic which is arranged in a set of alphabetically sequenced mnemonics termed the sequence set so that on entry of a character string at an RS 400, the object-id for the relevant keyword table can be obtained from the sequence set. Once the table object-id is identified, the keyword table corresponding to the desired subset of the objects and associated applicationa can then be obtained from network 10.
Subsequently the table can be presented to the user's RS 400, where the RS
400 can provide the data processing required to present the potentially relevant keywords, objects and associated applications to the user for further review and determination as to whether more searching is required.
As will be appreciated, this procedure reduces demand on server 205 and thereby permits it to be less complex and costly, and further, reduces the l;kellhood of host overtaxing that may cause network response slowdown.
As a further feature of thia procedure, the library of keywords and their associated PTOa and objects may be generated by a plurality of operation which appear at the uaer'a screen as different search techniques.
This permits the user to select a search technique he is most comfortable with, thus expediting his inquiry.
More particularly, in accordance with the invention, the user is allowed to invoke the procedure by calling up a variety of operation. The various operationa have different names and seemingly present different search strategies. Specifically, the user may invoke the procedure by initiating a "Jump" command at RS 400. Thereafter, in connection with the Jump operation, the user, when prompted, may enter a word of the user's choosing at monitor acreen 414 relating to the matter he is interested in locating; i.e., a subject matter search of the network applications.
Additionally, the users my invoke the procedure by alternatively calling up an operation termed "Index" with selection of the Index command. When selec-ed, the Index command presents the user with an alphabetical listing of keywords from the tables noted above which the user can select from; i.e., an alphabetical search of the network applications. Further, the user may evoke the procedure by initiating an operation termed "Guide." By selecting the Guide command, the user is provided with a series of graphic displays that presents a physical description of the network applications; e.g., ~3~7~3~

_ department floor plan for a store the user may be electronically shopping in.
Still further, the user may invoke the procedures by initiating an operation termed "Directory." 3y selecting the Directory command, the user is presented with the applications available on the net..ork as a series of hierarchial menus which present the content of the network information in commonly understood categories. Finally, the user may invoke the procedure by selecting the "Path" command, which accesses a list of keywords the user has previously selected; i.e., a personally tailored form of the Index command described above. As described hereafter, Path further includes a Viewpath operation which permits the user to visually access and manage the Path list of keywords. In preferred form, where the user has not selected a list of personalized keywords, a default set is provided which includes a predetermined list and associated applications deemed by network 10 as likely to be of interest to the user.
In accordance with the invention, this ability to convert these apparently different search strategies in a single procedure for accessing pre-created library tables is accomplished by translating the procedural elements of the different search techniques into a single set of procedures that will produce a mnemonic which can first be searched at the sequence set, described above to identify the object-id for the appropriate library table and, thereafter, enable access of the appropriate table to permit selection of the desired keyword and associated PT0 and object-ids. Thus, while the search techniques may appear different to the user, and in fact accommodate the user's preferences and sophistication level, they nonetheless invoke the same efficient procedure of relying upon pre-created searches which identify related application PTOs and object ids so that the table and objects may be collected and presented at the user's RS 400 where they can be processed, thereby relieving server 205.
In preferred form, however, in order to enhance presentation speed the Guide operation is specially configured. Rather than relating the keyword mnemonic to a sequence set to identify the table object-id and range of keywords corresponding to the entry PT0 and associated object-ids, the Guide operation presents a series of overlapping windows that physically describe the "store" in which shopping is being conducted or the "building" from which information is being provided. The successive windows increase in degree of detail, with the final window presenting a listing of relevant keywords.
Further, the PTo and object-ids for the application entry screen are directly related to the graphic presentation of the keywords. This eliminates the need to provide variable fields in the windows for each of the keywords and enables the entry screen to be correlated directly with the window graphic.
As will be appreciated, this reduces the number of objects that would otherwise be required to be staged at RS 400 to support pretention of the keyword listing at monitor screen 414, and thus speeds network response.
. A more detailed understanding of the procedure may be had upon a reading of the following description and review of accompanying FIGS. 2a, 3a and particularly FIG. ll which presents a flow diagram of the search procedure. -To select a particular parti'tioned application from among thousands of such applications residing either at the RS 400 or within delivery system 20, - 1 337 ~ 32 _ the present invention avoids the need for a user to know or understand, prior to a search, the organization of such partitioned applications and the query techniques necessary to access them. This is accomplished using a collection of related c~ -n~q, as described below.
The Jump command 296 as seen in FIG. 3a, can be selected, by the user from command bar 290. When Jump command 296 is selected, a window partition 275 is opened. In window 275, the user i9 presented and may select from a variety of displayed options that include among others, the Directory command, the Index command, and the Guide command, which when selected, have the effect noted above. Additionally, the user can select a command termed Viewpath which will presents the keywords that currently make up the list of keywords associated with the user's Path command, and from which list the user can select a desired keyword. Alternatively, the user may also enter a keyword at display field 270 within window partition 275 as a "best guess"
of the mnemonic character string that is a~signed to a partitioned application the user desires (e.g., the user may input such english words as ~news," "pet food," "games," etcetera). Where the user enters a character string it is displayed in field 270, and then searched by RS 400 native code (discussed below) against the sequence sets above noted to identify the object-id for the appropriate table of keywords (not shown) that RS 400 may request from host 205. While as note above, a table may include 10 to 20 keywords, in the preferred embodiment, for the sake of speed and convenience, a the typical keyword table includes approximately 12 keywords.
If the string entered by the user matches a keyword existing on one of the keyword tables, and is thus associated with a specific eTO~ RS 400 fetches and displays associated objects of the partitioned applications and builds the entry page in accordance with the page composition dictated by the target PTO.
If the string entered by the user does not match a specific keyword, RS 400 presents the user with the option of displaying the table of keywords approximating the specific keyword. The approximate keywords are presented as initialized, cursorable selector fields of the type provided in connection with a Index command. The user may then move the cursor to the nearest approximation of the mnemonic he originally selected, and trigger navigation to the PTO associated with that keyword, navigation being as described hereafter in connection with the RS native code.
If, in~tead of selecting the Jump command, the user selects the Index command, RS 400 will retrieve the keyword table residing at RS 400, and will again build a page with initialized, cursorable fields of keywords. The table fetched upon invoking the Index command will be comprised of alphabetic keywords that occur within the range of the keywords associated with the page template object (PTO) from which the user invoked the Index command. As discussed above, the user may select to navigate to any of this range of PTOs by selecting the relevant keyword from the display. Alternatively, the user can, thereafter, select another range of alphabetical keywords by entering an appropriate character string in a screen field provided or move forward or backward in the coilection by selecting corresponding option.
By selecting the 3irectory command, RS 400 can be caused to fetch a table of keywords, grouped by categories, to which the PTO of the current '`''''-'' 1~37l3~
_ partitioned application (as specified by the object 9et field 630 of the current PEO~ belongs. Particularly, by selecting the Directory command, RS
400, is causes to displays a series of screens each of which contains alphabetically arranged general subject categories from which the user may select. Following selection of a category, a series of keywords associated with the specified category are displayed in further screens together with descriptive statements about the application associated with the keywordq.
Thereafter, the user can, in the manner previously discussed with regard to the Index command, select from and navigate to the PTOs of keywords which are related to the present pageset by subject.
The Guide command provides a navigation method related to a hierarchical organization of applications provided on network 10, and are described by a series of sequentially presented overlaying windows of a type known in the art, each of which presents an increasing degree of detail for a particular subject area, terminating in a final window that giveq keyword~
associated with the relevant applications. The Guide command makes use of the keyword segment which describes the location of the PTO in a hierarchy (referred to, in the preferred embodiment, as the "BFD," or Building-Floor-Department) as well as an associated keyword character string.
The BFD describes the set of menu~ that are to be displayed on the screen as the sequence of pop-up windows. The Guide command may be invoked by requesting it from the Jump window described above, or by selecting the Menu command on Command Bar 290. As noted above, in the case of the Guide command, the PTO and object-ids for the application entry screen are directly associated with the graphic of the keyword presented in the final pop-up window. This enables direct access of the application entry screen without need to access the sequence set and keyword table, and thus, reduces response time by reducing the number of objects that must be processed at RS 400.
Activation of the Path command accesses the user's list of pre-selected keywords without their display, and permits the user to step through the list viewing the respective applications by repeatedly invoking the Path command.
As will be appreciated, the user can set a priority for selecting keywords and viewing their associated applications by virtue of where on the list the user places the keywords. More specifically, if the user has several application of particular interest; e.g., news, weather, etc., the user can place them at the top of the list, and quickly step through them with the Path command. Alternatively, the user can view and randomly access the keywords of his list with the Viewpath operation noted above. On activation of Viewpath, the user's Path keywords are displayed and the user can cursor through them in a conventional manner to select a desired one. Further, the user can amend the list as desired by ~hAnglng the keywords on the list and/or adjusting their relative position. This is readily accomplished by entering the A~n~' ntq to the list presented at the Ycreen 414 with a ~eries of AmPn~ nt options presented in a conventional fashion with the list. As noted, the list may be personally selected by the user in the manner described, or created as a default by network 10.
Collectively, the Jump command, Index command, Directory command, Guide command, and Path command as described enable the user to quickly and easily ascertain the "location" of either the partitioned application presently ~ . ,7.
337 13~
~_ displayed or the "location" of a desired partitioned application.
"Location," as used in reference to the preferred embodiment of the invention, means the specific relation9hip9 that a particular partitioned application bears to other such applications, and the method for selecting particular partitioned applications from such relationships The techniques for querying a databa9e of objects, embodied in the present invention, is an advance over the prior art, insofar as no foreknowledge of either database structure or query technique or Yyntax is necessary, the structure and search technique9 being made manifest to the u9er in the course of use of the commands.

RS APPLICATION PROTOCOL
RS protocol defines the way the RS supports user application conver9ation (input and output) and the way RS 400 proces9es a partitioned application. Partitioned applications are constructed knowing that this protocol will be supported unless dified by the application. The protocol is illustrated FIG. 6. The boxes in FIG. 6 identify processing stateY that the RS 400 pa99e9 through and the arrows indicate the transitions permitted between the various states and are annotated with the reason for the transition.
The various states are: (A) Initialize RS, (B) Process Objects, (C) Interpretively Execute Pre-processors, (D) Wait for Event, (E) Process Event, and (F) Interpretively Execute Function Extension and/or Post-processors.
The transitions between states are: (la) Logon PTO-id, (lb) Object-id, (2) Trigger PDO-id & return, (3) PPT or Window Stack Processing complete, (4) Event occurrence, and (5) Trigger PDO-id and return.
Transition (la) from Initialize RS (A) to Process Objects (B) occurs when an initialization routine passes the object-id of the logon PTO to object interpreter 435, when the service is first invoked. Transition (lb) from Process Event (E) to Process Objects (B) occurs whenever a navigation class event causes a new PTO object-id to be passed to object interpreter 435; or when a open window event (verb or function key) occurs passing a window Object-id to the object interpreter 435; or a close window event (verb or function key) occurs causing the current top-most window to be closed.
While in the process object state, object interpreter 435 will request any objects that are identified by external references in call segments.
Objects are processed by parsing and interpreting the object and its segments according to the specific object architecture. As object interpreter 435 processes objects, it builds a linked list structure called a Page Processing Table (PPT), shown in FIG. 10, to reflect the structure of the page, each page partition, PEOs required, Program Data Objects (PDOs) required and each window object that could be called. Object interpreter 435 requests a}l objects required to build a page except objects that could be called as the result of some event, such as a HELP window object.
Transition (2) from Process Objects (B) to Interpretively Execute Pre-processors (C) occurs when the object interpreter 435 determines that a pre-processor is to be triggered. Object processor 458 then passes the object-id of the (PDO) to the TBOL interpreter 438. TBOL interpreter 438 uses the RS virtual machine to interpretively execute the PDO. The PDO can 7 1 3~
represent either a selector or an initializer. When execution is complete, a transition automatically occurs back to Process Objects (B).
Selectors are used to dynamically link and load other objects such as PEOs or other PDOs ba9ed upon parameter9 that they are passed when they are called. Such parameters are ~pecified in call 9egments or selector 3egments.
This feature enables RS 400 to conditionally deliver information to the user base upon predetermined parameters, such as hls personal demographics or locale. For example, the parameters specified may be the transaction~ code~
required to retrieve the user's age, sex, and personal interest codes from records contained in user profiles stored at the switch/file gerver layer 200.
Initializers are used to set up the application processing environment for a partitioned application and determine what events RS 400 may respond to and what the action will be.
Transition (3) from Process Objects (B) to Wait for Event (D) occur3 when object interpreter 435 is finished processing objects associated with the page currently being built or opening or closing a window on a page. In the Wait for Event state (D), input manager accepts u9er inputs. All keystrokeg are mapped from their physical codes to logical keystrokes by the Keyboard Manager 434, repre3enting key~troke~ recognized by the RS virtual machine.
When the cursor is located in a field of a page element, keystrokes are mapped to the field and the PEV specified in the PEO fiel~ definition 3egment by the cooperative action of input manager 452 and display manager 461.
Certain input9, ~uch as RETURN or mou9e clicks in particular fields, are mapped to logical events by keyboard manager 434, which are called completion (or commit) events. Completion events ~ignify the completion of some 9election or specification process associated with the partitioned application and trigger a partition level and/or page level po~t-processor to process the "action" parameters associated with the user's selection and commit event.
Such parameters are associated with each possible choice or input, and are set up by the earlier interpretive execution of an initializer pre-processor in state (C). Parameters usually specify action~ to perform a calculation such as the balance due on an order of several items with various prices using 3ales tax for the user's location, navigate to PTO-id, open window WO-id or close window. Actions parameters that involve the specification of a page or window object will result in tran~ition (lb) to the Process Object9 (B) state after the po~t-processor is invoked as explained below.
Function keys are used to specify one or more functions which are called when the user strikes the~e keys. Function keys can include the occurrence of logical events, as explained above. Additionally, certain functions may be "filtered"; that is, extended or altered by S~T_FUNCTION or TRIGGER_FUNCTION verbs recognized by the RS virtual machine. Function keys cause the PDO specified as a parameter of the verb to be interpretively executed whenever that function i9 called. Application~ use this technique to modify or extend the function~ provided by the RS.
Transition (5t from Process Event (E) to Interpretively Execute Pre-1~37~3~
processors (F) occurs when Process Event State determines that a post-proce~sor or function exteniion PDO is to be triggered. The object id of the PDO is then passed to the id of the Program Data Object ~PDO) to the TBOL
interpreter 438. The TBOL intérpreter 438 uses the RS virtual machine to interpretively execute the PDO. When execution is complete a transition automatically occurq back to Procesi Event (E).

RECEPTION SYSTEM SOFTWARE
The reception ~ystem 400 software is the interface between the u~er of personal computer 405 and interactive network 10. The object of reception system software is to minimize mainframe proce~sing, minimize transmission acros~ the network, and support application extendibility and portability.
RS 400 software is composed of several layers, aY shown in FIG. 7. It includes external software 451, which is composed of elements well known to the art such as device driver~, the native operating systems; i.e., MS-DOS, machine-specific as~embler function~ (in the preferred embodiment; e.g., CRC
error checking), and "C" runtime library functions; native software 420; and partitioned applications 410.
Again with reference to FIG. 7, native software 420 is compiled from the "C" language into a target machine-specific executable, and i~ compoaed of two components: the service software 430 and the operating environment 450. Operating environment 450 is comprised of the Logical Operating System 432, or LOS; and a multita~ker 433. Service software 430 provides functions specific to providing interaction between the user and interactive network 10, while the operating environment 450 provideq p~eudo multitasking and access to local physical resources in support of service software 430. Both layers of native ~oftware 420 contain kernel, or device independent function~
430 and 432, and machine-specific or device dependent functions 433. All device dependencies are in code resident at RS 400, and are limited to implementing only tho e functions that are not common across m~chine types, to enable interactive network 10 to provide a single data stream ;o all makes of personal computer which are of the IBM or IBM compatible type. Source code for the native software in given below, and provides a detailed description of the software features for the reception sy~tem.
Service software 430 is comprised of modules, which are device-independent ~oftware components that together obtain, interpret and store partitioned applications exi~ting a~ a collection of objects. The functions performed by, and the relationship between, the service ~oftware 430 module is shown in FIG. 8 and diacus~ed further below.
Through facilities provided by LOS 432 and multitasker 433, here called collectively operating environment 450, provides device-independent multitasking and access to local machine resources, such as multitasking, timers, buffer management, dynamic memory management, file storage and accesY, keyboard and mouse input, and printer output. The operating environment 450 manage~ communication and ~ynchronization of service software 430, by supporting a reque~t/response protocol and managing the interface between the native software 420 and external software 437.
Applicationq software layer 410 consists of programs and data written in an interpretive language, "TRINTEX Basic Object Language" or "TBOL,"

- l~3713Z

_ described above, which was written specifically for use in RS 400 and interactive network 10 to facilitate videotext-specific command9 and achieve machine-independent compiling. TBOL is constructed aa objects, which in interaction with one another compri~e partitioned applications.
RS native software provides a virtual machine interface for partitioned applications, such that all objects comprising partitioned applications "see"
the same machine. RS native software provides support for the following functions: ~1) keyboard and mouse input; ~2) text and graphics display; (3) application interpretation; (4) application database management; (5) local application storage; (6) network and link level communications; (7) user activity data collection; and (8) advertisement management.
With reference to FIG. 8, service software 430 is comprised of the following modules: start-up (not shown); keyboard manger 434; object interpreter 435; TBOL interpreter 438; object storage facility 439; display manager 461; data collection manager 466; ad manager 432;
object/communications manager interface 433; link communications manager 444;
and fatal error manager 469. Each of these modules has responsibility for managing a different aspect of RS 400.
Start-up reads RS 400 customization options into RAM, including modem, device driver and telephone number options, from the file CONEIG.S~. Start-up invokes all RS 400 component start-up functions, including navigation to the first page, a logon screen di3play containing fields initialized to accept the user's id and password. Since Start-up is invoked only at initialization, for simplicity, it has not been shown in FIG. 3.
The principal function of keyboard manger 434 i9 to translate pergonal computer dependent physical input into a consistent set of logical keys and to invoke processors associated with these keys. Depending on the LOS key, and the associated function attached to it, navigation, opening of windows, and initiation of filter or post-proce9sor TBOL programs may occur as the result input events handled by the keyboard manger 434. In addition, keyboard manger 434 determines inter and intra field cursor movement, and coordinates the display of field text and cursor entered by the user with display manager 461j and sends information regarding such inputs to data collection manager 466.
Object interpreter 435 is responsible for building and recursively processing a table called the "Page Processing Table," or PPT. Object interpreter 435 also manages the opening and closing of windows at the current page. Object interpreter 435 is implemented as two sub-components:
the object processor 436 and object scanner 437.
Object processor 436 provideY an interface to keyboard manger 434 for navigation to new pages, and for opening and closing windows in the current page. Object processor 436 makes a request to Object storage facility 439 for a page template object (PTO) or window element object (WEO), as requested by keyboard manger 434, and for objects and their segments which comprise the PTO or WEO returned by Object storage facility 439 to object processor 436.
Based on the particular segmentg compri9ing the object (3) making up the new PTO or WEO, object processor 436 builds or adds to the PPT, which is an internal, linkedligt, global data 9tructure reflecting the structure of the page or PFO, each page partition or PEO, and Program Data Objects (PDOs) , ;- 1337132 _ required and each window object that could be called. Objects are processed by par9ing and interpreting each object and its segment (3) according to their particular structure a9 formalized in the data object architecture (DOAt.
While in the proces~ object 9tate, object processor 436 will request any objects specified by the PTO that are identified by external references in call segments (e.g. field level program call 518, page element selector call 524, page format call 526 program call 532, page element call 522 segments) of ~uch objects, and will, through a request to TBOL interpreter 438, fire initializers and selectors contained in program data segment~ of all PTO
constituent program objects, at the page, element, and field levels. Object processor 435 requests all objects required to build a page, except objects that could only be called as the result of some event external to the current partitioned application, such as a HELP window object. When in the course of building or adding to the PPT and opening/closing WEOs, object processor encounters a call to an object with object id "ADSLOT," it fetches the next advertisement object 510 from ad manager 442, and sends to display manager 461 for display to the user presentation data segments 530 contained in the objects constituent of the PTO, WEO and advertisement object. Object processor also passes to data collection manager 466 all object-ids that were reque9ted and object id9 that were viewed. Upon completion of page or window processing, object proces~or 436 enters the wait for event state, and control is returned to keyboard manger 434.
The second component of object interpreter 435, object scanner 437, provides a file-like interface, shared with object storage facility 439, to objects currently in use at RS 400, to enable object processor 436 to maintain and update the PPT. Through facilities provided by object scanner 437, object processor recursively constructs a page or window in the requested or current partitioned application, respectively.
Object storage facility 439 provides an interface through which object interpreter 435 and TBOL interpreter 438 either synchronously request (using the TBOL verb operator "GET") objects without which processing in either module cannot continue, or asynchronously request (using the TBOL verb operator "FETCH"~ objects in anticipation of later use. Object storage facility 439 returns the requested objects to the requesting module once retrieved from either local store 440 or interactive network 10. Through control structures 9hared with the object scanner 437, object atorage facility determines whether the requested object resides locally, and if not, makes an attempt to obtain it from interactive network 10 through interaction with link communications manager 444 via object/communications manager interface 443.
When objects are reque~ted from object storage facility 439, only the latest version of the object will be provided to guarantee currency of information to the user. Object storage facility 439 assures currency by requesting version verification from network 10 for those objects which are available locally and by requesting objects which are not locally available from delivery system 20 where currency is maintained.
Version verification increases response time. Therefore, not all objects locally available are version checked each time they are requested.
Typically, objects are checked only the first time they are reque~ted during a u~er ~es~ion. However, there are occasion3, as for example in the case of objects relating to news applications, where currency is always checked to assure integrity of the information.
The frequency with which the currency of object~ is checked depends on factors such as the frequency of updating of the objects. For example, objects that are designated as ultrastable in a storage control parameter in the header of the object are never ver9ion checked unless a special verqion control object sent to the RS a9 part of logon indicates that all such objects mu~t be version checked. Object storage facility 439 marks all object entries with such a stability category in all directories indicating that they must be version checked the next time they are requested.
Object storage facility 439 manages objects locally in local 9tore 440, comprised of a cache (segmented between available RAM and a fixed size disk file), and stage (fixed size disk file). Ram and disk cached object~ are retained only during user sessions, while objects stored in the stage file are retained between se~ions. The storage control field, located in the header portion of an object, de9cribed more fully hereafter as the object "storage candidacy", indicates whether the object is stageable, cacheable or trashable.
Stageable objects must not be subject to frequent change or update.
They are retained between user sessions on the system, provided storage space is available and the object has not discarded by a least-recently-used ~LRU) algorithm of a conventional type; e.g., see Operatinq System Theory, by Coffman, Jr. and Denning, Prentice Hall Publishers, New York, 1973, which in, accordance with the invention, operates in combination with the storage candidacy value to determine the object storage priority, thus rendering the stage self-configuring as described more fully hereafter. Over time, the self-configuring stage will have the effect of retaining within local disk storage those objects which the user has accessed most often. The objects retained locally are thus optimized to each individual user's usage of the applications in the system. Response time to such objects is optimized since they need not be retrieved from the interactive computer system.
Cacheable objects can be retained during the current user session, but cannot be retained between ses~ions. These objects u3ually have a moderate update frequency. Object storage facility 439 retain objects in the cache according to the LRU storage retention algorithm. Object storage facility 439 uses the 1RU algorithm to ensure that objects that are least frequently used forfeit their storage to objects that are more frequently used.
Trashable objects can be retained only while the user is in the context of the partitioned application in which the object was requested. Trashable objects usually have a very high update frequency and must not be retained to ensure that the user has access to the most current data.
More particularly and, a~ noted above, in order to render a public informational and transactional network of the type considered here attractive, the network must be bo,th economical to use and fast. That is to say, the network mu~t supply information and transactional support to the user at minimal cost~ and with a minimal response time. In accordance with the present invention, the~e objectives are sought to be achieved by locating as many information and transactional aupport object~ which the u~er is 133713~
_ likely to request, as close to the user as possible; i.e., primarily at theuser'~ RS 400 and secondarily at delivery system 20. In this way, the user will be able to access objects required to support a desired application with minimal intervention of delivery system 20, thus reducing the cost of the session and speeding the response time.
However, the number of objects that can be maintained at RS 400 is restricted by at least two factors: the RS 400 storage capacity; i.e., RAM
and disk sizes, and the need to maintain the stored objects current.
In accordance with the method aspect of the invention, in order to optimize the effectiveness of the limited storage space at RS 400, the collection of objects is restricted to those likely to be requested by the user; i.e., tailored to the user's tastes - and to those least likely to be time sensitive; i.e., object9 which are 9table. To accomplish this, objects are coded for storage candidacy to identify when they will be permitted at RS 400, and subject to the LRU algorithm to maintain presence at RS 400.
Additionally, to assure currency of the information and transaction support provided at RS 400, objects are further coded for version identification and checking in accordance with a system of priorities that are reflected in the storage candidacy coded.
Specifically, to effect object storage management, objects are provided with a coded version id made up of the storage control byte and version control bytes identified above as elements of the object header, specifically, bytes 16 and 18 shown in FIG. 4b. In preferred form, the version id is comprised of bytes 16 and la to define two fields, a first 13 bit field to identify the object version and a second three bite field to identify the object storage candidacy.
In this arrangement, the storage candidacy value of the object is addressed to not only the question of storage preference but also object currency. Specifically, the storage candidacy value establishes the basis upon which the object will be maintained at RS 400 and also identifies the susceptibility of the object to becoming stale by dictating when the object will be version checked to determine currency.
The version value of the object on the other hand, provides a parameter that can be checked against predetermined values available from delivery system 20 to determine whether an object stored at RS 400 is sufficiently current to permit its continued use, or whether the object has become stale and needs to be replaced with a current object from delivery system 20.
Still further, in accordance with the invention, object storage management procedure further includes use of the LRU algorithm, for combination with the storage and version coding to enable discarding of objects which are not sufficiently used to warrant retention, thus personalizing the store of objects at RS 400 to the user's tastes.
Particularly, object storage facility 439, in accordance with the LRU
algorithm maintains a usage list for objects. As objects are called to support the user's applications requests, the objects are moved to the top of a usage list. As other objects are called, they push previously called objects down in the list. If an object i3 pushed to the bottom of the list before being recalled, it will be forfeited from the list if necessary to make room for the next called object. As will be appreciated, should a ~r --- I 331 13~
- previously called object be again called before it is displaced from the list, it will be promoted to the top of the list, and once more be subject to depression in the li9t and possible forfeiture as other objects are called.
As pointed out above, in the course of building the screens presented to the user, objects will reside at various locations in RS 400. For example, objects may reside in the RS 400 RAM where the object is supporting a particular application screen then running or in a cache maintained at disk 424 where the object is being staged for an executing application or in the fixed size file on disk 424 noted above where the object is being held for use in application likely to be called by the user in the future.
In operation, the LRU algorithm is applied to all these regions and serves to move an object from RAM to disk cache to disk file, and potentially off RS 400 depending on object usage.
With regard to the 9torage candidacy value, in this arrangement, the objects stored at RS 400 include a limited set of permanent objects; e.g., those ~upporting logon and logoff, and other non-permanent objects which are subject to the LRU algorithm to determine whether the objects should be forfeited from RS 400 as other obiects are added. Thus, in time, and based on the operation of the LRU algorithm and the storage candidacy value, the collection of objects at RS 400 will be tailored to the usage characteristics of the subscriber; i.e., self-configuring.
More particularly, the 3-bit field of the version id that contains the storage candidacy parameter can have 8 different values. A first candidacy value is applied where the object is very sensitive to time; e.g., news items, volatile pricing information such as might apply to stock quotes, etc.
In accordance with this first value, the object will not be permitted to be stored on RS 400, and RS 400 will have to request such objects from delivery system 20 each time it is accessed, thus, assuring currency. A second value is applied where the object is sensitive to time but less so thar. the first case; e.g., the price of apples in a grocery shopping application. Here, while the price might change from day to day, it is unlikely to change during a session. Accordingly the object will be permitted to persist in RAM or at the disk cache during a session, but wiil not be permitted to be maintained at RS 400 between sessions.
Continuing down the hierarchy of time sensitivity, where the object concerns information sufficiently stable to be maintained between sessions, a third storage candidacy value is set to permit the object to be stored at RS 400 between sessions, on condition that the object will be version check the first time it is accessed in a subsequent session. As will be appreciated, during a session, and under the effect of the LRU algorithm, lack of use at RS 400 of the object may result in it being forfeited entirely to accommodate new objects called for execution at RS 400.
Still further, a fourth value of storage candidacy is applied where the object is considered sufficiently stable as not to require version checking between sessions; e.g., objects concerning page layouts not anticipated to change. In this case, the storage candidacy value may be encoded to permit the object to be retained from session to session without version checki ng. Here again, however, the LRU algorithm may cause the : 1331132 object to forfeit its storage for lack of use.
Where the object i9 of a type required to be stored at RS 400, as for example, objects needed to support standard screens, it is coded for storage between ses3ions and not subject to the LRU algorithm forfeiture. However, where such objects are likely to change in the future they may be required to be version checked the first time they are accessed in a seasion and thug be given a fifth storage candidacy value. If, on the other hand, the required stored object is considered likely to be stable and not require even version checking; e.g., logon screens, it will be coded with a sixth storage candidacy value for storage without version checking so as to create a substantially permanent object.
Continuing, where a RS 400 includes a large amount of combined RAM and disk capacity, it would permit more objects to be stored. However, if object9 were simply coded in anticipation of the larger capacity, the objects would potentially experience difficulty, as for example, undesired forfeiture due to capacity limitations if such objects were supplied to RS 400 units having smaller RAM and disk sizes. Accordingly, to take advantage of the increased capacity of certain RS 400 units without creating difficulty in lower capacity units, objects suitable for storage in large capacity units can be so coded for retention between sessions with a seventh and eighth storage candidacy value depending upon whether the stored large capacity object requires version checking or not. Here, however, the coding will be interpreted by smaller capacity units to permit only cacheable storage to avoid undesirable forfeiture that might result from over filling the smaller capacity units.
Where an object is coded for no version checking need may nonetheless arise for a version check at some point. To permit version checking of such objects, a control object is provided at RS 400 that may be version checked on receipt of a special communication from delivery system 20. If the control object fails version check, then a one shot version checking attribute is associated with all existing objects i~ RS 400 that have no version checking attributes. Thereafter, the respective objects are version checked, the one shot check attribute is removed and the object is caused to either revert to its previous state if considered current or be replaced if stale.
Still further, objects required to be stored at RS 400 which are not version checked either because of lack of requirement or because of no version check without a control object, as described above, can accumulate in RS 400 as dead objects. To eliminate such accumulation, all object having required storage are version checked over time. Particularly, the least recently used required object i.Y version checked during a session thus promoting the object to the top of the usage list if it is still to be retained at RS 400. Accordingly, one such object will be checked per session and over time, all required objects will be version checked thereby eliminating the accumulation of dead objects.
However, in order to work efficiently, the version check attribute of the object should be ignored, so that even required object can be version checked. Yet, in certain circumstances, e.g., during deployment of new versions of the reception system software containing new objects not yet 133713z supported on delivery sy9tem 20 which may be transferred to the fixed storage file of RS 400 when the new version is loaded, unconditional version checking may prematurely dèlete3 the object from the RS 400 as not found on delivery system 20. To avoid thi9 problem, a sweeper control segment in the control object noted above can be used to act as a switch to turn the sweep of dead objects on and off.
With respect to version checking for currency, where an object stored at RS 400 is initially fetched or accessed during a session, a request to delivery system 20 is made for the object by specifying the version id of the object stored at RS 400.
In response, delivery system 20 will advise the reception system 400 either that the version id of the stored object matches the currency value;
i.e., the stored object is acceptable, or deliver a current object that will replace the stored object shown to be stale. Alternatively, the response may be that the object was not found. If the version of the stored object is current,-the stored object will be used until verified again in accordance with itY storage candidacy. If the stored object is stale, the new object delivered will replace the old one and support the desired screen. If the response is object not found, the stored obiect will be deleted.
Therefore, based on the above description, the method aspect of the invention is seen to include steps for execution at storage facility 439 which enables object reception, update and deletion by means of a combination of operation of the LRU algorithm and interpretation of the storage candidacy and version control values. In turn, these procedures cooperate to assure a competent supply of objects at RS 400 so as to reduce the need for intervention of delivery system 20, thus reducing cost of information supply and transactional support so as to speed the response to user requests.
TBOL interpreter 438 provides the means for executing program objects, which have been written using an interpretive language, TBOL described above.
TBOL interpreter 438 interprets operators and operand contained in program object 508, manages TBOL variables and data, maintains buffer and stack facilities, and provides a runtime library of TBOL verbs.
TBOL verbs provide support for data processing, program flow control, file management, object management, communications, text display, command bar control, open/close window, page navigation and sound. TBOL interpreter also interacts with other native modules through commands contained in TBOL verbs.
For example: the verb "navigate" will cause TBOL interpreter 438 to request object interpreter 435 to build a PPT based on the PTO id contained in the operand of the NAVIGATE verb; "fetch" or "GET" will cause TsOL interpreter 438 to request an object from object storage facility 439; "SET_FUNCTION"
will assign a filter to events occurring at the keyboard manger 434; and "FORMAT," "SEND," and "RECEIVE" will cause TBOL interpreter 438 to send application level requests to ob~ect/communications manager interface 433.

Data areas managed by TBOL interpreter 438 and available to TBOL
programs are Global External Variables (GEVs~, Partition External Variables (PEVs), and Runtime Data Arrays (RDAs).
GEV~ contain giobal and system data, and are accessible to all program objects as they are executed. GEVs provide a means by which program objects ,. . . ~ . . . ...

:
1 337 ~3Z
~ may communicate with other program objects or with the RS native code, if declared in the program object. GEVs are character string variable~ that take the size of the variables they contain. GEVs may preferably contain a mA~;m--m of 32,000 variables and are typically used to store such information as program return code, system date and time, or user sex or age. TBOL
interpreter 438 stores such information in GEVs when requested by the program which initiated a transaction to obtain these records from the RS or user's profile stored in the interactive system.
Partition external variables (PEVs) have a scope restricted to the page partition on which they are defined. PEVs are used to hold screen field data such that when PEOs and window objects are defined, the fields in the page partition~ with which these objects are to be associated are each assigned to a PEV. When application9 are executed, TBOL interpreter 438 transfers data between screen fields and their associated PEV. When the contents of a PEV are modified by user action or by program direction, TBOL interpreter 428 makes a reque3t to display manager 461 to update the screen field to reflect the change. PEVs are also used to hold partition specific application data, such as table~ of information needed by a program to process an expected screen input.
Because the ~cope of PEVs is restricted to program objects associated with the page partition in which they are defined, data that is to be shared between page partition~ or is to be available to a page-level processor must be placed in GEVs or RDAs.
RDAs are internal stack and save buffer~ used a3 general program work areas. RDAs are dynamically defined at program object "runtime" and are used for communication and transfer of data between program~ when the data to be passed is not amenable to the other techniques available. Both GEVs and RDAs include, in the preferred embodiment, 8 integer registers and 8 decimal registers. Preferably, there also 9 parameter registe.s limited in scope to the current proceoure of a program object.
All variables may be specified as operand of verbs used by the virtual machine. The integer and decimal registers may be specified as operand for traditional data processing. The parameter registers are used for passing parameters to "called" procedures. The contents of these registers are saved on an internal program stack when a procedure is called, and are re~tored when control returns to the "calling" procedure from the "called" procedure.
TBOL interpreter 438, keyboard manger 434, object interpreter 435, and object storage facility 439, together with device control provided by operating environment 450, have principal responsibility for the management and execution of partitioned applications at the RS 400. The remaining native code module~ function in support and ancillary roles to provide RS 400 with the ability display partitioned applicationA to the user (display manager 461), di3play advertisements (ad manager 442), to collect usage data for distribution to interactive network 10 for purposes of targeting such advertisement~ (data collection manager 441), and prepare for ~ending, and send, objects and me~sages to interactive network 10 (object/communications manager interface 443 and link communications manager 444) Finally, the fatal error manager exist~ for one purpose: to inform the uAer of RS 400 and transmit to interactive network 10 the inability of RS 400 to recover from 33713~
_ a system error.
Display manager 461 interfaces with a decoder using the North American Presentation Level Protocol Syntax (NAPLPS), a standard for encoding graphics data, or text code, suCh as ASCII, which are displayed on monitor 412 of the user's personal computer 405 as pictorial codes. Codes for other presentation media, such as audio, can be specified by using the appropriate type code in the presentation data segments. Display manager 461 supports the following functions: send NAPLPS strings to the decoder; echo text from a PEV; move the cursor within and between fields; destructive or non-destructive input field character deletion; "ghost" and "unghost" fields (a ghosted field is considered unavailable, unghosted available); turn off or on the current field cursor; open, close, save and restore bit maps for a graphics window; update all current screen fields by displaying the contents of their PEVs, reset the NAPLPS decoder to a known state; and erase an area of the screen by generating and sending NAPLPS to draw a rectangle over that area. Display manager 461 also provides a function tO generate a beep through an interface with a machine-depondPnt sound driver.
Ad manager 442 is invoked by object interpreter 435 to return the object-id of the next of the next available advertisement to be displayed.
Ad manager 442 maintains a queue of advertisement object id's targeted to the specific user currently accessing interactive network 10. Advertisement objects are pre-fetched from interactive system 10 from a personalized queue of advertisements that is constructed using data previously collected from user generated events and/or reports of objects used in the building of pages or windows, compiled by data collection manager 466 and transmitted to interactive system 10.
Advertisement objects 510 are PEOs that, through user invocation of a "LOOK" command, cause navigation to partitioned applications that may themselves support, for example, ordering and purchasing of merchandise.
An advertisement list, or "ad queue," is requested in a transaction message to delivery system 20 by ad manager 442 immediately after the initial logon response. The logon application at RS 400 places the advertisement list in a specific RS global storage area called a SYS GEV (system global external variable), which is accessible to all applications as well as to the native RS code). The Logon application also passes the first two ad object id's to object storage facility 439 to be requested. At logon, no advertisement objects will be available RS local storage facilities 440, so they must be requested from interactive network 10.
In a preferred embodiment, the following parametric values are establi~hed for ad manager 442: advertisement queue capacity, replenishment threshold for advertisement object id's and replenishment threshold for number of outstanding pre-fetched advertisement objects. These parameters are set up in GEVs of the RS virtual machine by the logon application program object from the logon response from high function system 110. The parameters are then also accessible to the ad manager 432. Preferred values are an advertisement queue capacity of 15, replenishment value of 10 empty queue positions and a prefetched advertisement threshold of 3.
Ad manager 442 pre-fetches advertisement object by passing advertisement object id's from the advertisement queue to object storage ; :~ 1337)3Z
facility 439 which then retrieves the object from the interactive system if the object i9 not available locally. Advertisements are pre-fetched, so they are available in RS local store 440 when requested by object id by object interpreter 435 while it is building a page. The Ad manager 432 pre-fetches additional advertisement objects whenever the number of pre-fetched advertisements, not used by object interpreter 435 falls below the pre-fetch advertisement threshold.
Whenever the advertisement queue has more empty positions than replenishment threshold, a transaction is made to the advertisement queue application in high function system 110 shown in FIG. 2, via object/communications manager interface 433 for a number of advertisement object id's equal to the threshold. A response mesqage includes a liqt of advertisement object id's, which ad manager 442 enqueues.
Object interpreter 435 requests the object id of the next advertisement from ad manager 442 when object interpreter 435 is building a page and encounters an object call for a partition and the specified object-id equal~
the code word, "ADS~OT." If this is the first request for an advertisement object id that ad manager 442 has received during this user's session, ad manager 442 moves the advertisement list from the GFV into its own qtorage area, which it uses as an advertisement queue and sets up its queue management pointers, knowing that the first two advertisement objects have been pre-fetched.
Ad manager 442 then queries object storage facility 439, irrespective of whether it waq the first request of the session. The query asks if the specified advertisement object id pre-fetch has been completed, i.e., is the object available locally at the RS. If the object is available locally, the object-id is passed to object interpreter 435, which requests it from object storage facility 439. If the advertisement object is not available in local store 440, ad manager 442 attempts to recover by asking about the next ad that was pre-fetched. This is accomplished by swapping the top and second entry in the advertisement queue and making a query to object storage facility 439 about the new top advertisement object id. If that object is not yet available, the top position is swapped with the third position and a query is made about the new top position.
Beqides its ability to provide advertisements that have been targeted to each individual user, two very important response time problems have been solved by ad manager 442 of the present invention. The first is to eliminate from the new page response time the time it takes to retrieve an advertisement object from the host system. This is accomplished by using the aforementioned pre-fetching mechanism.
The second problem is caused by pre-fetching, which results in asynchronous concurrent activities involving the retrieval of objects from interactive system 10. If an advertisement is prefetched at the qame time as other objects required for a page requested, the transmission of the advertisement object packets could delay the transmission of the other objects required to complete the current page by the amount of time required to transmit the advertisement object(s). This problem is solved by the structuring the requests from object interpreter 435 to the ad manager 432 ~-in the following way: -1 337~3~
1. Return next object-id of pre-fetched advertisement object &
pre-fetch another;
2. Return next advertisement object-id only; and 3. Pre-fetch next advertisement object only.
By separating the function request ~1) into its two components, ~2) and (3), object interpreter 435 is now able to determine when to request advertisement object-id' 9 and from its knowledge of the page build process, is able to best determine when another advertisement object can be pre-fetched, thus causing the least impact on the page response time. For example, by ~Yamin~ng the PPT, object interpreter 435 may determine whether any object requests are outstanding. If there are outstanding requests, advertisement request type would be used. When all requested objects are retrieved, object interpreter 435 then issues an advertisement request type 3. Alternatively, if there are no outstanding requests, object interpreter 435 issues an advertisement request type 1. This typically corresponds to the user'3 "think time" while ~mlnlng the information presented and when RS 400 is in the Wait for Event state (D).
Data collection manager 441 is invoked by object interpreter 435 and keyboard manger 434 to keep records about what objects a user has obtained (and, if a presentation data segment 530 is present, seen) and what actions users have taken (e.g. "NEXT," "BACK," "LOOK," etc.) The data collection events that are to be reported during the user's session are sensitized during the logon process. The logon response message carries a data collection indicator with bit flags set to "on~ for the events to be reported. These bit flags are enabled (on) or disabled (off) for each user based on information contained in the user's profile stored and sent from high function host 110. A user's data collection indicator is valid for the duration of his session. The type of events to be reported can be changed at will in the host data collection application. ~owever, such changes will affect only users who logon after the change.
Data collection manager 441 gathers information concerning a user's individual system usage characteristics. The types of informational services accessed, transactions processed, time information between various events, and the like are collected by data collection manager 441, which compiles the information into message packets (not shown). The message packets are sent to network 10 via object/communication manager interface 443 and link communications manager 444. Message packets are then stored by high function host 110 and sent to an offline processing facility for processing. The characteristics of users are ultimately used as a means to select or target various display objects, such a~ advertisement objects, to be sent to particular users based on consumer marketing strategies, or the like, and for system optimization.
Object/communications manager interface 443 is responsible for sending and receiving DIA (Data Interchange Architecture described above) formatted messages to or from interactive network 10. Object/communications manager 443 also handles the receipt of objects, builds a DIA header for messages being sent and removes the header from received DIA messages or objects, correlates requests and responses, and guarantees proper block sequencing.
Object/communications manager interface 443 interacts with other native code 13~713z modules as follows: object/communications manager 443 (1) receives all RS 400 object requests from object storage facility 439, and forwards objects received from network 10 via link communications manager 444 directly to the requesting modules; ~2) receives ad list requests from ad manager 442, which thereafter periodically calls object/communications manager 443 to receive ad list responses; (3) receives data collection messages and send requests from data collection manager 441; (4) receives application-level requests from T50L interpreter 438, which al~o periodically calls object/communications manager interface 443 to receive responses (if required); and (5) receives and sends DIA formatted objects and messages from and to link communications manager 444.
Object/communications manager interface 443 sends and receives DIA
formatted messages on behalf of TLOL interpreter 438 and sends object requests and receives objects on behalf of object storage facility 439.
Communication packets received containing partq of requested objects are passed to object storage facility 439 which asqembles the packet~ into the object before storing it. If the object was requested by object interpreter 435, all packets received by object storage facility 439 are also pa~sed to object interpreter 435 avoiding the delay required to receive an entire object before proce~sing the object. Objects which are pre-fetched are stored by object storage facility 439.
Messages sent to interactive network 10 are directed via DIA to application~ in network 10. Messages may include transaction requests for records or additional processing of records or may include records from a partitioned application program object or data collection manager 441.
Meqsages to be received from network 10 usually comprise records reque~ted in a previous me~sage sent to network 10. Requests received from object storage facility 439 include requests for objects from storage in interactive system 10. Responses to object requests contain either the requested object or an error code indicating an error condition.
Object/communications manager 443 is normally the exclusive native code module to interface with link communications manager 444 texcept in the rare instance of a fatal error). Link communications manager 444 controls the connecting and disconnecting of the telephone line, telephone dialing, and communications link data protocol. Link communication~ manager 444 acces~es network 10 by meanA of a communications medium ~not shown) link communications manager 444, which is responqible for a dial-up link on the public switched telephone network ~esTN)~ Alternatively, other communications means, such as cable television or broadcaqt media, may be used. ~ink communications manager 444 interfaces with TDOL interpreter for connect and disconnect, and with interactive.network 10 for send and receive.
Link communications manager 444 is subdivided into modem control and protocol handler unitq. Modem control ~a software function well known to the art) hand~ the modem specific h~n~haklng that occurs during connect and disconnect. Protocol handler i9 responsible for transmission and receipt of data packets using the TCS (TRINTEX Communications Subsystem) protocol (which is a variety of OSI link level protocol, also well known to the art).
Fatal error manager 469 is` invoked by all reception system components upon the occurrence of any condition which precludes recovery. Fatal error manager 469 diqplayq a qcreen to the user with a textual meqqage and an error code through display manager 461. Fatal error manager 469 sends an error report meqsage through the link communicationq manager 444 to a subsystem of interactive network 10.
The source code for RS 400 is provided as part of this specification.
Nomenclature for the various service qoftware 430 modules may differ, but the functions de~cribed herein are implemented in the source code. Some functions described herein are implemented across modules in ~ource code.
The following is a concordance of the terms used in this 3ection of the disclo~ure and the terms used in the source code:
Specification Source Code Keyboard Manager = Input Manager/Event Processor Object Interpreter = Object Processor TBOL Interpreter = API or Logic Interpreter (the above 3 modules are referred to as the Service Manager) Object Storage Facility - Object Manager Object/Communications Manager = Mes~age Manager and Communications Manager Ad Manager ~ Ad Manager Display Manager = Display Manager Data Collection Manager = Data Collection Manager Link Communications Manager = Communications Manager The qource code for the reception system 400 software is provided in the accompanying volumes 1 to 5, wherein the volume pages are consecutively numbered in accordance with the respective directories and ~ubdirectorieq for source code files which are as follows:
Volume Directory Subdirectory Subdirectory Number 1 rs api inc applib asm Number 2 c inc cm asm inc esp asm Number 3 c inc los csm inc oversutl c inc , .. , . ... ~,. - -1 ~7 1 ~

Volume Directory Subdirectory Subdirectory -Number 3 (continued) rs rsk asm Number 4 c inc Number 5 a sm icnc storeutl inc tmk ver_esp c inc ver_over inc ver sm Cinc ,, ~~
ver_stor inc SAMPLE APPLICATION
The page illustrated in FIG. 3(b) corresponds to a partitioned application that permit's a personal computer user to purchase apple~. It shows how the monitor screen 414 of personal computer 405 might appear to the user. The di~played page includes a number of page partitions and corresponding page elements.
The PTO 500 representing this page 280 is illustrated in FIG. 9. PTO
500 defines the composition of the page, including header 250, body 260, display fields 270, 271, 272, advertisement 280, and command bar 290. PEOs 504 are associated with page partitions numbered; e.g., 250, 260, 280. They respectively, present information in the header 250, identifying the page topic as ABC APPLES; in the body 260, identifying the cost of apples; and prompt the user to input into fields within body 260 the desired number of apples to be ordered. In advertisement 280, presentation data and a field representing a post-processor that will cause the user to navigate to a targetable advertisement, is presented.
In FIG. 9, the structure of the PTO 500 can be traced. PTO 500 contains a page format call segment 526, which call~ PFO 502. PFO 502 describes the location and size of partitions on the page and numbers assigned to each partition. The partition number is used in page element call segments 522 90 that an association i~ established between a called PEO
504 and the page partition where it i9 to be displayed. Programs attached to this PEO can be executed only when the cur~or is in the page partition designated within the PEO.

133~13~
the PEOs 504 for partitions 250 and 260. Each PEO 504 defines the contents _ of the partition. The header in partition 250 has only a presentation data segment(s) 530 in its PEO 504. No input, action, or display fields are associated with that partition.
The PEO 504 for partition 260 contains a presentation data segment 530 and field definition segments 516 for the three fields that are defined in that partition. Two of the fields will be used for display only. One field will be used for input of user supplied data.
In the example application, the PEO 504 for body partition 260 specifies that two program objects 508 are part of the body partition. The first program, shown in Display field 270, 271, 272, is called an initializer and is invoked unconditionally by TBOL interpreter 438 concurrently with the display of presentation data for the partition. In this application, the function of the initializer is represented by the following pseudo-code:
1. Move default values to input and display fields;
2. "SEND" a transaction to the apple application that is resident on interactive system 10;
3. "RECEIVE" the result from interactive system 10; i.e. the current price of an apple;
4. Move the price of an apple to PEV 271 so that it will be displayed;

5. Position the cursor on the input field; and 6. Terminate execution of this logic.
The second program object 508 is a field post-processor. It will be invoked conditionally, depending upon the user keystroke input. In this example, it will be invoked if the user changes the input field contents by entering a~ number. The pseudo code for this post-processor is as follows:
1. Use the value in PEV 270 (the value associated with the data entered by the user into the second input data field 270) to be the number of apples ordered.
2. Multiply the number of apples ordered times the cost per apple previously obtained by the initializer;
3. Construct a string that contains the message "THE COST OF T~E
APPLES YOU ORDERED IS 545.34;";
4. Move the string into PEV 272 90 that the result will be displayed for the user; and 5. Terminate execution of this logic.
The process by which the "APPLES" application is displayed, initialized, and run is as follow~.
The "APPLES" application i9 initiated when the user navigates from the previous partitioned application, with the navigation target being the object id of the "APPLES" PTO 500 (that is, object id ABC1). This event causes keyboard manager 434 to pass the PTO object id, ABC1 (which may, for example, have been called by the keyword navigation segment 520 within a PEO 504 of the previous partitioned application), to object interpreter 435. With reference to the RS application protocol depicted in FIG. 6, when the partitioned application is initiated, RS 400 enters the Process Object state (B) using transition (1). Object interpreter 435 then sends a synchronous request for the PTO 500 specified in the navigation event to object storage .-- 13371~2 ~, .

_ facility 439. Object storage facility 439 attempts to acquire the requested object from local store 440 or from delivery system 20 by means of object/communication manager 443, and returns an error code if the object cannot be acquired.
Once the PTO 500 is acquired by object/communications manager 443, object interpreter 435 begins to build PPT by parsing PTO 500 into its constituent segment calls to pages and page elements, as shown in FIG. 4d and interpreting such segments. PFO and PEO call segments 526 and 522 require the acquisition of the corresponding objects with object id's <ABCF>, <ABCX>
and <A3CY>. Parsing and interpretation of object ABCY requires the further acquisition of program objects <ABCI> and <A8CJ>.
During the interpretation of the PEOs 504 for partitions 250 and 260, other RS 400 events are triggered. This corresponds to transition (2) to interpret pre-processors state (C) in FIG. 6. Presentation data 530 is sent to display manager 461 for display using a NAPLPS decoder within display manager 461, and, as the PEO <ABCY> for partition 260 i9 parsed and interpreted by object ~nterpreter 435, parameters in program call segment 532 identify the program object <ABCI> as an initializer. Object interpreter 435 obtains the program object from object storage facility 439, and makes a request to TBOL interpreter 438 to execute the initializer program object 508 <ABCI>. The initializer performs the operations specified above using facilities of the RS virtual machine. TBOL interpreter 438, using operating environment 450, executes initializer program object 506 <ABCI>, and may, if a further program object 508 is required in the execution of the initializer, make a synchronous application level object request to object storage facility 439. When the initializer terminates, control is returned to object interpreter 435, shown as the return path in transition (2) in FIG. 6.
Having returned to the process object state (B), object processor 435 continues processing the objects associated with PTO <ABCl>. Object interpreter continues to construct the PPT, providing RS 400 with an environment for subsequent processing of the PTO <ABC1> by pre-processors and post-processors at the page, partition, and field levels. When the PPT has been constructed and the initializer executed, control is returned to keyboard manager 434, and the RS enters the wait for event (E) State, via transition (4), as shown in FIG. 6.
In the wait for event state, the partitioned application waits for the user to create an event. In any partitioned application, the user has many options. For example, the user may move the cursor to the "JUMP" field 296 on the command bar 290, which is outside the current application, and thus cause subsequent navigation to another application. For purposes of this example, it is assumed that the user enters the number of apples he wishes to order by entering a digit in display field 271.
Keyboard manager 434 translates the input from the user's keyboard to a logical representation independent of any type of personal computer.
Keyboard manager 434 saves the data entered by the user in a buffer associated with the current field defined by the location of the cursor. The buffer is indexed by its PEV number, which is the same as the field number assigned to it during the formation of the page element. Keyboard manager 434 determines for each keystroke whether the keystroke corresponds to an .~

input event or to an action or completion event. Input events are logical keystrokes and are sent by keyboard manager to display manager 461, which displays the data at the input field location. Display manager 461 also has access to the field buffer as indexed by its PEV number.
The input data are available to TBOL interpreter 438 for subsequent processing. When the curqor iq in a partition, only the PEVq for that partition are accessible to the RS virtual machine. After the input from the user is complete (as indicated by a user action such as pressing the RETURN
key or entry of data into a field with an action attribute), RS 400 enters the Process Event state (E) via transition t4).
For purposes of thiq example, let us assume that the user enters the digit "5" in input field 270. A transition is made to the process event state (E). Keyboard manager 434 and display manager 437 perform a number of actions, such as the display of the keystroke on the screen, the collection of the keystroke for input, and optionally, the validation of the keystroke, i.e. numeric input only in numeric fields. When the keystroke is processed, a return is made to the wait for event state (D). Edit attributeq are specified in the field definition segment.
Suppose the user inputs a "6" next. A transition occurs to the PE
state and after the "6" i3 processed, the Wait for Event (D) qtate is reentered. If the user hits the "completion" key (e.g.,ENTER) the Process Event (E) state will be entered. The action attribute~ asqociated with field 272 identify this as a system event to trigger post-processor program object <ABCJ>. When the interpretive execution of program object <ABCJ> is complete, the wait for event state (D) will again be entered. The user is then free to enter another value in the input field, or select a command bar function and exit the apples application.
While this invention has been described in its preferred form, it will be appreciated that changes may be made in the form, construction, procedure and arrangement of its various elements and steps without departing from its spirit or scope.

1~5

Claims (119)

THE EMBODIMENTS OF THE INVENTION IN WHICH AN EXCLUSIVE
PROPERTY OR PRIVILEGE IS CLAIMED ARE DEFINED AS FOLLOWS:

1. A reception system provided in an interactive computer network, the reception system for presenting partitioned applications that include informational and transactional services to a user, the reception system comprising:
input means for receiving user inputs;
storage means for storing objects, the objects collectively including data and executable programs used in generating the partitioned applications;
object processing means, responsive to the input means for selectively retrieving and interpreting objects to extract data and programs required for composing and generating the partitioned applications; and communication means for sending object requests arising within the reception system to and receiving objects from the interactive network when objects required for generating the partitioned applications are unavailable at the storage means.

2. The reception system according to claim 1, wherein the partitioned applications and user inputs are processed according to a protocol provided by the reception system.

3. The reception system according to claim 1, wherein the object processing means includes elements for interpreting objects having a prescribed structure that includes one or more embedded objects.

4. The reception system according to claim 1, wherein the object processing means includes elements for interpreting objects having a prescribed structure that includes one or more embedded calls to other objects.

5. The reception system according to claim 1, wherein the object processing means includes elements for interpreting objects having a prescribed structure that includes one or more embedded objects and one or more embedded calls to other objects.

6. The reception system in according to claim 1, wherein the object processing means includes elements for interpreting objects having a prescribed structure that includes no embedded objects and no embedded calls to other objects.

7. The reception system according to claims 3, 4, 5 or 6, wherein the object processing means includes elements for interpreting an object structure including a header and one or more segments wherein each segment has a prescribed structure.

8. The reception system according to claim 7, wherein the header is extendable.

9. The reception system according to claim 7, wherein the object processing means includes elements for interpreting an object structure in which the segment structure identifies segment length and type.

10. The reception system according to claim 7, wherein the object processing means includes elements for interpreting and object structure in which the header includes an object identifier.

11. The reception system according to claim 7, wherein the object processing means includes elements for interpreting an object structure in which the header includes means for indicating the length of the object.

12. The reception system according to claim 7, wherein the object storage means includes elements for interpreting an object structure including a header having control attributes for indicating the permanency and currency of the object.

13. The reception system according to claim 1, wherein the communication means is adapted for sending messages to and receiving messages from the interactive network.

14. The reception system according to claim 13, wherein the data storage means communicates with the communication means, for requesting a desired object from the interactive network if the desired object is not present in the storage means.

15. The reception system according to claim 1, wherein the input means includes input management means for translating the user inputs into a personal computer independent format.

16. A reception system according to claim 11, wherein the storage means includes elements for selectively storing objects between user sessions according to the control attributes of the respective objects.

17. The reception system according to claim 11, wherein the storage means includes elements for selectively storing objects between user sessions according to the control attributes of the respective objects.

18. The reception system according to claim 11, wherein the storage means includes elements for selectively storing objects during user sessions according to the control attributes of the respective objects.

19. The reception system according to claim 1, further including collection means for collecting and storing data concerning object usage at the reception system.

20. The reception system according to claim 1, wherein the object processing means includes elements for identifying objects for interpretation that are obtained from the interactive network in response to predetermined initial parameters.

21. The reception system according to claim 19, wherein advertisements are selectively displayed at the reception system in response to the object usage data assembled by the collection means.

22. The reception system according to claim 9, wherein the object processing means includes elements for interpreting an object identifier that includes an object space identifier for designating an object address space.

23. The reception system according to claim 9, wherein the object processing means includes elements for interpreting an object identifier that includes a set identifier for designating an object set within an object address space.

24. the reception system according to claim 9, wherein the object processing means includes elements for interpreting an object identifier that includes an occurrence field for designating an object within an object set.

25. The reception system according to claim 9, wherein the object processing means includes elements for interpreting an object identifier that includes a type field for designating the use of the object and the structure of the object identifier.

26. The reception system according to claim 1, wherein the storage means includes a random access memory.

27. The reception system according to claim 1, wherein the storage means includes a diskette or other magnetic media.

28. The reception system according to claim 1, wherein the storage means includes optical medium.

29. The reception system according to claim 1, wherein the storage means includes a broadcast medium.

30. A reception system provided in an interactive computer network, the reception system for presenting partitioned applications including informational and transactional services to a user, the reception system comprising:
storage means for storing objects used for generating the partitioned applications;
input means for receiving user input signals;
communications means for passing messages and object requests to and receiving objects and messages from the interactive network;
collection means, in communication with the input means and the communication means for compiling object use data and passing the compiled object use data to the interactive network; and object processing means, responsive to the input means, for selectively retrieving and interpreting objects and interpreting objects to extract data and programs required for composing and generating the partitioned applications.

31. The reception system according to claim 30, wherein the compiled object use data is processed by the interactive network.

32. The reception system according to claim 30, further including advertisement management means for pre-fetching advertisement objects from the interactive network, each of which advertisement objects includes an object identifier, and controlling presentation of advertisement associated with the advertisement objects in response to the compiled object use data.

33. The reception system according to claim 32, wherein the advertisement management means includes an advertisement queue for storing the object identifiers of the advertisement objects for the purpose of pre-fetching the advertisement objects.

34. The reception system according to claim 33, wherein the advertisement queue can store a variable number of the object identifiers based on predetermined parameters.

35. A method for operating a computer network that provides a very large number of simultaneous users access to large numbers of applications having text and graphic information, the network including one or more host computers, a plurality of distribution computers connected in groups of one of more to each of the host computers, and a plurality of reception system computers each having a display screen, the reception system being connected in groups of one or more to each of the distribution computers, the method comprising the steps of:
a. organizing the application information into objects;
b. distributing selected objects in accordance with a predetermined plan to the host computers, the distribution computers and the reception system computers;
and c. supplying objects to a reception system computer requesting an application so that the requesting reception system computer can selectively combine the objects which make up a requested application by collecting objects as required from the host computers, the distribution computers, and the requesting reception system computer so that the requested application may be displayed at the reception system computer display screen based on the objects collected.

36. The method of claim 35 wherein the organizing of the applications into objects includes providing the objects with display data and program instructions necessary to execute the requested applications.

37. The method of claim 36 wherein the combining of the objects at the requesting reception system computer includes the utilization of application software operating at the requesting reception system computer which is capable of interpreting the program instructing included in the objects.

38. The method of claim 37 wherein the organization of the applications into objects includes structuring the objects to include a first section having information for processing the object and a second section including one or more subunits of information including the display data and program instructions for executing the object.

39. The method of claim 38 wherein in combining objects for displaying the requested applications, the reception system application software determines if the requested application can be constituted from objects stored at the requesting reception system and to the extent it is determined that objects not stored at the requesting reception system are required, requesting the required objects from the network.

40. The method of claim 39 wherein the organizing of the applications into objects includes providing the program instructions necessary to execute the requested application in a high-level language having verbs adapted to be interpreted by the application software maintained a the requesting reception system computer.

41. The method of claim 40 wherein the supplying of objects to the application requesting reception system includes the supply of information other than objects and wherein such other information other that objects is formulated as messages.

42. The method of claim 41 wherein the supplying of messages includes structuring the messages to have a first section including information for processing of the message, and at least a second section including information representing the message.

43. The method of claim 42 wherein distributing the objects within the network includes placing objects depending upon the likelihood that its associated application will be requested so that objects most likely to be required for a requested application will be placed at the requesting reception system computer and the objects least likely to be required for the requesting application will be placed at the host computers.

44. The method of claim 43 wherein distributing the objects within the network includes placing objects depending in part upon preferences of the user of the requesting reception system computers.

45. The method of claim 44 wherein distributing objects within the network depends in part upon user preference determined by a history of user application requests.

46. The method of claim 38 wherein organizing the application information into objects includes formulating the objects so that they can be used in one or more applications.

47. The method of claim 46 wherein formulating the objects includes formulating the object subunits as elements that maybe used in one or more objects.

48. The method of claim 47 wherein the organizing of applications into objects includes collecting the objects in sets which include the information necessary to present a display to the user at the requesting reception system monitor, and wherein one or more screens are used to make up an application.

49. The method of claim 47 wherein supplying objects to the requesting reception system computer includes downloading objects from the network to the requesting reception system when it logs onto the network so as to maintain the store of objects at the requesting reception system computer current.

50. A method of searching for applications, the applications being made up of objects containing text and graphic data and program instructions for presenting the applications, the applications being stored on a computer network, the network including a plurality of distribution computers connected in groups of one of more to each of the host computers, and a plurality of reception system computers each having a display screen at which the applications may be presented, the reception system computers being connected in groups of one or more to each of the distribution computers, the method comprising:
a. preparing a plurality of tables each having various applications referenced to respective keywords so that each table represents a predetermined subset of the applications stored on the network;
b. providing each table with a unique coding;
c. generating a code identifier in response to a query for an application entered at the reception system;
d. comparing the code identifier generated with the table coding to select a table suited to the query;
e. transmitting the table to the reception system at which the query was entered; and f. processing the table identified applications at the reception system that made the query.

51. The method of claim 50 wherein preparing the tables includes representing the applications thereon by referring to the objects that make up the respective applications, and wherein the coding of the tables includes supplying one or more letters in combination to the table to uniquely identify each table.

52. The method of claim 51 wherein the generating of the code identifiers includes receiving the query for applications in one of a plurality of different procedures and translating each of the different procedures into a single common procedure for generating the code identifier, the code identifier including one or more letters in combination to uniquely identify an application table.

53. The method of claim 52 wherein the generating of the code identifiers includes receiving a query from the user for an application with a procedure selected for the group of procedures consisting of selection by character string, alphabetical listing, physical analogy and menu listing.

54. The method of claim 52 wherein the processing of table identified applications includes collecting at the reception system the objects which make up the application associated with the identified table, and executing the objects so as to present the corresponding text and graphic data for review.

55. Software for use in a personal computer to configure the personal computer as a reception system for presenting partitioned applications, the partitioned applications being made up of objects that collectively include text and graphic data and program instructions, the reception system being connected in a computer network, the network including one or more host computers, a plurality of distribution computers connected in groups of one or more to each of the host computers, and a plurality of reception systems, the reception systems being connected in groups of one or more to each of the distribution computers, the-software comprising:
a. machine readable medium;
b. first plurality of program instructions provided in the machine readable medium for establishing means for generating requests for partitioned applications;
c. second plurality of program instructions provided in the machine readable medium for establishing means for interpreting the objects to extract data and program instructions required for composing and generating the requested partitioned applications;
d. third plurality of program instructions provided in the machine readable medium for establishing means for executing the program instructions included within the objects;
e. fourth plurality of program instructions provided in the machine readable medium for establishing means for storing objects at the reception system;
f. fifth plurality of program instructions provided in the machine readable medium for establishing means for communicating with the network for the obtaining of objects;
g. sixth plurality of program instructions provided in the machine readable medium for establishing means for causing the interpreted object data to be presented at the reception system;
wherein, the first, second, third, fourth, fifth and sixth plurality of program instructions are related such that when the machine readable medium is used in the personal computer and a requested partitioned application is to be executed at the reception system, the means for interpreting the objects determines what objects are required for execution of the partitioned application, the means for storing objects determines which of the required objects are available at the reception system, and the means for communicating with the network secures from the network those required objects not available at the storage means so that the means for interpreting the objects can supply the text and graphic data that make up the partitioned application to the means for causing the partitioned application to be presented.

56. The software of claim 55 wherein the first plurality of program instructions for establishing means for requesting partitioned applications includes means for transforming physical requests for partitioned applications entered at the reception system computer input to logical events which are supplied to the means for interpreting objects so that required objects for the application can be identified and organized.

57. The software of claim 56 wherein the second group of program instructions for establishing the means for interpreting the objects includes instructions for creating a page processing table to control collection of objects to be executed for presenting the requested application.

58. The software of claim 57 wherein the fourth group of program instructions for establishing the means for storing the objects include instructions for assuring that the most current version of the objects requested for the partitioned application are provided.

59. The software of claim 58 further including a seventh plurality of program instructions for establishing means for collecting data regarding the frequency of use of various objects required for the partitioned applications requested.

60. The software of claim 59 further including an eighth plurality of program instructions for establishing means for providing advertisement objects to the reception system for presentation display.

61. The software of claim 55 where the fifth group of program instructions for establishing means for providing communication with the network includes instructions for communicating both objects and messages.

62. The software of claim 55 wherein the third group of instructions for establishing means for executing program instructions includes instructions for executing object programs prior to execution of the objects containing display data in order to effect the collection of objects for display, and further, includes instructions for executing object programs following the presentation of display data to undertake action in response to display data.

63. The software of claim 55 including program instructions which enable the software to undertake multitasking of reception events in cooperation with the operating system running at the reception system computer.

64. The software of claim 55 wherein the second group of instructions for establishing means for interpreting objects includes instructions for interpreting the objects by parsing the objects into segments according to a prescribed structure for the objects.

65. A reception system according to claim 20, wherein said header comprises said object id.

66. A reception system according to claim 20, wherein each of said one or more segments comprises means for indicating the size of said segment.

67. Method for operating a personal computer as a reception system for presenting partitioned applications, the partitioned applications being made up of objects that collectively include text and graphic data and program instructions, the reception system being connected in a computer network, the network including one or more host computers, a plurality of distribution computers connected in groups of one or more to each of the host computers, and a plurality of reception systems, the reception systems being connected in groups of one or more to each of the distribution computers, the method comprising the steps of:
a. establishing and managing means within the personal computer for generating requests for partitioned applications.
b. establishing and managing means within the personal computer for interpreting objects to extract data and program instructions required for composing and generating the requested partitioned applications;
c. establishing and managing means within the personal computer for executing program instructions that may be included within the objects from which the requested partitioned applications can be generated;
d. establishing and managing means within the personal computer for storing objects from which the requested partitioned applications can be generated;
e. establishing and managing means within the personal computer for communicating with the network to obtain objects from which the requested partitioned applications can be generated that are not available at the object storage means;
f. establishing and managing means within the personal computer for causing the interpreted object data to be presented at the reception system;
wherein, when a partitioned application is requested, the reception system determines the objects required to be executed for generating the partitioned application by using the means for interpreting objects; determines whether the required objects are available at the reception system by using the means for storing objects; secures required objects not available at the storage means from the network by using the means for communicating with the network; and interprets the required objects to obtain the text and graphic data and program instructions required for composing and presenting the partitioned application, and presents the partitioned application by supplying the necessary text and graphic data to the means for causing the partitioned application to be presented.

68. The method of claim 67 wherein the steps for establishing and managing the means for requesting partitioned applications includes transforming the physical requests for partitioned applications entered at the reception system computer input to logical events which are supplied to the means for interpreting objects so that required objects for the application can be identified and organized.

69. The method of claim 68 wherein the steps for establishing and managing the means for interpreting the objects includes creating a page processing table to control collection of objects required to be executed for presenting the requested application.

70. The method of claim 69 wherein the steps for establishing and managing the means for storing the objects includes monitoring objects required for a partitioned application to assure that the most current version of the objects are provided for application presentation.

71. The method of claim 70 further including steps for establishing and managing means for collecting data regarding the frequency of use of various objects required for the partitioned applications requested.

72. The method of claim 71 further including steps for establishing and managing means for providing advertisement objects to the reception system for presentation advertisements as part of a partitioned application.

73. The method of claim 67 where the steps for establishing and managing means for providing communication with the network includes communicating both objects and messages.

74. The method of claim 67 wherein the steps for establishing and managing means for executing program instructions includes executing object programs prior to execution of the objects containing display data in order to effect the collection of objects for display, and further, includes executing object programs following the presentation of display data to undertake action in response to screen display data.

75. The method of claim 67 wherein the reception system undertake multitasking of events relating to presentation of partitioned applications in cooperation with the operating system running at the personal computer.

76. The method of claim 67 wherein the steps for establishing and managing the means for interpreting objects includes interpreting the objects by parsing the objects into segments according to a prescribed structure for the objects.

77. A reception system provided in an interactive computer network, the reception system for presenting partitioned applications that informational and transactional services to a user, the reception system comprising:
input means for receiving user inputs, at least some of which include requests for partitioned applications;
storage means for storing objects, the objects collectively including data and executable program instructions used in generating the partitioned applications, and the storage means further retaining objects between requests for partitioned applications, object processing means responsive to the input means for selectively retrieving and interpreting objects to extract data and program instructions required for composing and generating the partitioned applications; and communication means for sending object requests arising within the object processing means to and receiving objects from the interactive network when objects required for generating the partitioned applications are unavailable at the storage means.

78. The reception system according to claim 77 wherein the partitioned applications and user inputs are processed according to a protocol provided by the reception system.

79. The reception system according to claim 77, wherein the object processing means includes elements interpreting objects having a prescribed structure that includes one or more embedded objects.

80. The reception system according to claim 77, wherein the object processing means includes elements for interpreting objects having a prescribed structure that includes one or more embedded calls to other objects.

81. The reception system according to claim 77, wherein the object processing means includes elements for interpreting objects having a prescribed structure that includes one or more embedded objects and one or more embedded calls to other objects.

82. The reception system in according to claim 77, wherein the object processing means includes elements for interpreting objects having a prescribed structure that includes no embedded objects and no embedded calls to other objects.

83. The reception system according to claims 3, 4, 5 or 6, wherein the object processing means includes elements for interpreting an object structure including a header and one or more segments wherein each segment has a prescribed structure.

84. The reception system according to claim83, wherein the header is extendable.

85. The reception system according to claim83, wherein the object processing means includes elements for interpreting an object structure in which the segment structure identifies segment length and type.

86. The reception system according to claim83,wherein the object processing means includes elements for interpreting an object structure in which the header includes an object identifier.

87. The reception system according to claim83,wherein the object processing means includes elements for interpreting an object structure in which the header includes means for indicating the length of the object.

88. The reception system according to claim83 wherein the object storage means includes elements for interpreting an object structure including a header having control attributes for indicating the permanency and currency of the object.

89. The reception system according to claim77, wherein the communication means is adapted for sending messages to and receiving messages from the interactive network.

90. The reception system according to claim 89, wherein the data storage means communicates with the communication means, for requesting a desired object from the interactive network if the desired object is not present in the storage means.

91. The reception system according to claim77,wherein the input means includes input management means for translating the user inputs into a personal computer independent format.

92. The reception system according to claim 88, wherein the storage means includes elements for selectively storing objects between user sessions according to the control attributes of the respective objects.

93. The reception system according to claim 88,wherein the storage means includes elements for selectively storing objects during user session according to the control attributes of the respective objects.

94. The reception system according to claim77 ,further including collection means for collecting and storing data concerning object usage at the reception system.

95. The reception system accordingly to claim77,wherein the object processing means includes elements for identifying objects for interpretation that are obtained from the interactive network in response to predetermined initial parameters.

96. The reception system according to claim 94, wherein the reception system includes a display and wherein advertisements are selectively exhibited at the display in response to the object usage data assembled by the collection means.

97. The reception system according to claim 86, wherein the object processing means includes elements for interpreting an object identifier that includes an object space identifier for designating an object address space.

98. The reception system according to claim 85, wherein the object processing means includes elements for interpreting an object identifier that includes a set identifier for designating an object set within an object address space.

99. The reception system according to claim 86, wherein the object processing means includes elements for interpreting an object identifier that includes an occurrence field for designating an object within an object set.

100. The reception system according to claim 86, wherein the object processing means includes elements for interpreting an object identifier that includes a type field for designating the use of the object and the structure of the object identifier.

101. The reception system according to clain 77,wherein the storage means includes a random access memory.

102. The reception system according to claim 77,wherein the storage means includes a diskette or other magnetic media.

103. The reception system according to clain77,wherein the storage means includes optical medium.

104. The reception system according to claim 97, wherein the storage means includes a broadcast medium.

105. A reception system provided in an interactive computer network, the reception system for presenting partitioned applications including informational and transactional services to a user, the reception system comprising:
input means for receiving user inputs, at least some of which may include requests for partitioned applications, and at least some of which may include messages;
storage means for storing objects, the objects collectively including data and executable program instructions used in generating the partitioned applications, and the storage means further retaining objects between requests for partitioned applications;
object processing means responsive to the input means for selectively retrieving and interpreting objects to extract data and program instructions required for composing and generating the partitioned applications;
communication means for passing messages arising at the input means and object requests arising at the object processing means to and receiving objects and messages from the interactive network;
collection means in communication with the input means and the communication means for compiling object use data and passing the compiled object use data to the interactive network.

106. The reception system according to claim 105, wherein the compiled object use data is processed by the interactive network.

107. The reception system according to claim 105, further including advertisement management means for pre-fetching advertisement objects from the interactive network, each of which advertisement objects includes an object identifier, and controlling presentation of advertisements associated with the advertisement objects in response to the compiled object use data.

108. The reception system according to claim 108, wherein the advertisement management means includes an advertisement queue for storing the object identifiers of the advertisement objects for the purpose of pre-fetching the advertisement objects.

109. The reception system according to claim 108, wherein the advertisement queue can store a variable number of the object identifiers based on predetermined parameters.

110. Method for operating a computer as a reception system for presenting partitioned applications to a user, the partitioned applications being made up of objects that collectively include data and program instructions, the method comprising the steps of:
a. receiving requests for partitioned applications at the reception system;
b. interpreting objects to extract data and program instructions required for composing and generating the requested partitioned applications;

c. executing program instructions that may be included within the objects for which the requested partitioned applications can be generated;
d. storing objects from which the requested partitioned applications can be generated and retaining objects between requests for partitioned applications;
e. communicating with the network to obtain objects from which the requested partitioned applications can be generated that are not available at the reception system;
f. causing the interpreted object data to be presented at the reception system;
wherein, when a partitioned application is requested, the reception system determines the objects required to be executed for generating the partitioned application; determines whether the required objects are available at the reception system; secures required objects not available at the reception system from the network; and interprets the required objects to obtain the data and program instructions required for composing and presenting the partitioned application, and presents the application by supplying the necessary data for presentation.

111. The method of claim 110 wherein the receiving of requests for partitioned applications includes transforming requests for partitioned applications entered at the reception system computer into logical events which are interpreted so that required objects for the application can be identified and organized.

112. The method of claim 111 wherein interpreting the objects includes creating a page processing table to control collection of objects required to be executed for presenting the requested application.

113. The method of claim112 wherein storing and retaining the objects includes monitoring objects required for a partitioned application to assure that the most current version for each of the objects is provided for application presentation.

114. The method of claim 113 further including collecting data regarding the frequency of use of various objects required for the partitioned applications requested.

115. The method of claim 114 further including providing advertisement objects to the reception system for presenting advertisements as part of a partitioned application.

116. The method of claim 110 wherein communication with the network includes communicating objects and messages.

117. The method of claim 110 wherein executing program instructions includes executing object program instructions prior to execution of the objects containing data in order to effect the collection of objects for presentation and further includes executing object program instructions following the presentation of data to undertake action in response to the presented data.

118. The method of claim 110 wherein the reception system undertake multitasking of events relating to presentation of partitioned applications in cooperation with the operating system running at the computer.

119. The method of claim 110 wherein interpreting objects includes interpreting the objects by parsing the objects into segments according to a prescribed structure for the objects.