Abstract: An improved method and system for storage of geographic data on physical storage media. The geographic data are stored in a manner that facilitates and enhances use and access of the data by various navigation application functions in navigation systems that use the data. The geographic data includes a parcelization that separates the geographic data into parcels having less than or equal to a maximum parcel size but having at least a desired fill percentage. The parcelization method also provides for a division arrangement that facilitates addressing and identification of the parcels. According to a further aspect, the geographic data includes special nodal entities that are used to collapse complex intersections, such as roundabouts, cloverleaves, and divided highways, into simpler data representations. The special nodal entities are associated with road segment data entities and used in a route calculation program in place of regular node entities.

Abstract: An apparatus and method of a computer software program for generating a series of connected nodes that form a path in an open hierarchical data structure is disclosed. The paths in the open hierarchical data structure provide the basis for an end-user menu system known as a content menu. The present invention discloses the means to use a programming language or code to relate one or more sets of data, stored in an external file or in a database, to the open hierarchical data structure. The software means of the present invention decodes this input to generate a series of connected nodes in the structure, and thereby create new menu data and menu paths that lead to information objects.

Abstract: A method of monitoring logical connections in a computer network is described. All packets exchanged via the network are intercepted and analyzed. Upon receipt of a packet, a connection management engine determines whether packet is part of an existing logical connection. If it is not, a new record is created and stored in a connection record database. Otherwise, the existing record for the logical connection in the connection record database is updated. Also described is a method of monitoring file transfers in a computer network. File transfers are monitored using an file transfer record database, which allows each packet of the file transfer to be placed in proper context. Upon interception of a packet, an application management engine (AME) first determines whether the packet is part of a file transfer. If it is not, the AME ignores the packet.

Abstract: Entering and evaluating group(s) of similar dependence hypotheses, such as time dependence hypotheses, and forecasting values of a variable based on the group(s) of similar dependence hypotheses. The group(s) of similar dependence hypotheses may be used to forecast requests for an Internet resource or Internet resources having one or more particular attributes. The entered group(s) of similar dependence hypotheses may be evaluated based on known data, such as past requests for Internet resources or Internet resources of a particular type.

Abstract: A Year 2000 compliant computer system comprises a master data base maintained in local time without conversion, a processor for running stored programs on the basis of a zone time different to local time, and at least one time change interface which will convert the date data obtained from the master data base from local time to zone time and vice versa in order to maintain the master data base in local time.

Abstract: A method, system and program product are described which allow a dynamically constructed desktop to be optimized for the capabilities of the browser in the target device. This enables a server to manage the distribution of applets to clients matching the capabilities of the browser, the Java runtime environment (JRE), the screen resolution, color depth, sound capabilities, link speed, communications links and any other items which can be differentiated that are supported by the client requesting use of the applet.

Abstract: A technique for automatically identifying clusters of data from a set of data samples, by employing multiple morphological operations of a grid of data cells representative of the data samples. The data samples are stored (12) in the data cell grid (56) as binary quantities of which the position in the grid represents each multivariate data point. Potential cluster regions are identified by first performing a series of dilation steps (22) on the data grid, to expand contiguous regions covered by the data points until smaller regions merge into larger ones that are identified as the potential cluster regions. Then a series of erosion operations (26) is performed, shrinking the contiguous regions until smaller isolated regions are completely eliminated and thin linkages between other potential cluster regions are removed. Next, a further series of dilation operations (30) expands the contiguous regions again, to reconnect any potential cluster regions that were fragmented in the erosion operations.

Abstract: A linked data structure verification system to verify the integrity of at least one linked data structure simultaneously by way of a verification setup phase and an integrity verification phase. Individual nodes are retrieved from a memory device and examined seriatim in optimal memory device location order. Nodes are retrieved and examined in optimal memory device location order for maximum memory device retrieval performance. Expected and/or actual node information about nodes in a given linked data structure are temporarily stored as records in an integrity verification table for only as much time as is necessary to verify any part of the node information prior to excising one or more unnecessary records from the integrity verification table.

Abstract: An index set for a databse is specified by analyzing a sample (718) of SQL statements applied to the database (701). Indexes (707) are identified that could assist in the execution of the analyzed statements and levels of improved operation are evaluated for each of said indexes. The evaluated levels are then processed (708) to specify an index set for inclusion on the database. The database may not include sufficient storage (702) for all of the specified indexes to be included, therefore the available storage space is allocated and indexes are selected on a prioritized basis.

Abstract: Method and apparatus for storing, retrieving, and processing customer-oriented data sets in which relatively large sets of customers and their transactions or the like may be quickly and efficiently analyzed. A multi-dimensional access structure is utilized in which each cell representing one dimension element or a combination of dimension elements may include a list of customers who have made purchases or other transactions associated with that cell. Each customer record in a list may summarize predetermined information pertaining to that customer's behavior in the cell. Such records may be sorted by customer number to enable efficient combining of multiple lists. In applications wherein the number of such cells is prohibitively large, only a portion of these cells may actually include materialized lists.

Abstract: The present invention provides a method for modifying the Home Location Register (HLR) system database for digital wireless mobile communication. The method modifies or revises the database of the HLR system that is used to manage mobile subscribers by maintaining all the wireless communication system subscribers' information such as electronic serial number, directory number, international mobile station identification, user profile and current location, etc. The method includes extracting subscriber information from the database which resides in a main memory device and is being used at the present time; migrating the extracted information to a new database; and saving the migrated information onto a disk. In addition, the present method automatically generates the structure and contents of the database to be modified, regardless of each database version and structure, and without requiring the modification and testing of the source code by an operator.

Abstract: The present invention is intended to allow a user to easily and precisely extract related terms through use of mutual information without requiring morphological analysis or syntax analysis, by constituting a related term extraction apparatus from preceding-and-subsequent term extraction means for extracting a preceding term occurring prior to a specified term or a subsequent term occurring subsequent to the same in text data; a frequency calculation means for calculating the occurrence frequencies of the specified term, the preceding terms, and the subsequent terms; probability-of-occurrence calculation means for calculating the occurrence probabilities of the preceding and subsequent terms together with the occurrence probability of the specified term; probability-of-concurrence calculation means for calculating the probabilities of the preceding and subsequent terms cooccurring with the specified term; order-dependent degree-of-association calculation means for calculating an order-dependent degrees of the

Abstract: An object-relational mapping tool that can process views is provided. In processing views, the object-relational mapping tool identifies the dependency relationship between the various views and tables and allows the programmer to customize the mapping that will occur by selectively determining which tables and views get mapped. This customization allows the mapping tool to map an individual table or view or to map (1) all tables and views, (2) all tables only, and (3) tables and views for which there are no dependencies. Also, the mapping tool allows the programmer to view and set the updatability of a particular view or table.

Abstract: An ISP 10 provides enhanced features compatible with non-AIN switches to allow service providers to provide customers with features such as voice prompting, DTMF number collection, fax on demand and similar features. In one embodiment, the ISP can also be configured as an IP. Enhanced features can be accomplished using the ISP, such as advanced routing of long distance calls based on ANI, authorization codes, type of call, time of day, origination of call and destination of call.

Abstract: Routing asynchronous state changes in a multi-processing system having an end user system, a central application server system and an endpoint system, includes detecting a state change with a service object on the endpoint system, sending a notification to an associated service proxy object on the central application server system notifying the associated service proxy object of the state change, sending a notification to an associated distributed service object which is an owner of the service proxy notifying the associated distributed service object of the state change, sending a notification to an associated distributed service proxy object on the end user system notifying the associated distributed service proxy object of the state change, and posting an event to an associated owner window of the distributed service proxy object using a window identifier including sending a notification to the associated owner window notifying the associated owner window of the state change.

Abstract: An online voting system provides a standardized database architecture that integrates editorial and production processes. The voting system has a survey database to store multiple surveys and a server to serve the surveys over a network (e.g., the Internet) to readers. Each survey consists of one or more questions and multiple answer options per question. The voting system includes an authoring tool to permit an editor to construct the surveys. The surveys are stored in a predefined survey index tables. A display handler checks reader requests for pages that contain surveys, to determine whether the reader should receive a voting form or survey results. A vote handler processes votes cast by the readers in response to the surveys. Unique identifiers of voters who respond to the surveys are collected in a votes table. This table is checked when each vote is received to prevent readers from voting multiple times for a single survey.

Abstract: A network accelerator for TCP/IP includes programmable logic for performing network protocol processing at network signaling rates. The programmable logic is configured in a parallel pipelined architecture controlled by state machines and implements processing for predictable patterns of the majority of transmissions. Incoming packets are compared with patterns corresponding to classes of transmissions which are stored in a content addressable memory, and are simultaneously stored in a dual port, dual bank application memory. The patterns are used to determine sessions to which an incoming IP datagram belongs, and data packets stored in the application memory are processed by the programmable logic. Processing of packet headers is performed in parallel and during memory transfers without the necessity of conventional store and forward techniques resulting in a substantial reduction in latency. Packets which constitute exceptions or which have checksum or other errors are processed in software.

Abstract: A method of using at least one natural language query to retrieve information from one or more data resources and further performing a requested action using the retrieved information is disclosed. At least one natural language query directed to retrieving particular information is received. At least one object from the natural language query is extracted. The relationship between each of the at least one extracted objects is determined. A semantic representation is created from the at least one extracted objects. The semantic representation is compared to a knowledge structure. The knowledge structure is comprised of one or more grammars which are extracted from a plurality of data resources. The semantic representations are matched to the grammar. A database query is generated based on the matched objects. The query is applied to one or more of the data resources and information is retrieved. The requested action is then performed using the retrieved information.

Abstract: Ranked database is generated for referring to images. The database contains references or key text to images, and the references are ranked for predetermined degrees of relevance to the images.

Abstract: The retrieval of data from a computerized database is optimized through the use of a join index. A denormalized base table is converted into a plurality of normalized tables and the join index for the normalized tables is created by combining one or more commonly-used columns of the normalized tables. Outer joins are used to generate the join index, instead of inner joins, so that the join index satisfies queries with fewer join conditions than the ones used to generate the join index. Each row of the join index comprises a fixed part and a repeated part. The fixed part is stored only once in each row, but the repeated part is comprised of recursive levels within each row, so that each row may contain as many repeated parts as needed. In addition, each of the repeated parts comprises a fixed part and a repeated part.