Abstract: A computer implemented method of and apparatus for printing values in a fixed number of column spaces using Java is described. A value desired to be formatted to a predetermined length string and an indexed lookup table having predetermined formatted string entries are used. An index based on the number of characters needed to represent the value is calculated and then used to locate a desired length formatted string entry in the lookup table. The desired length formatted string entry is then combined with a string representation of the value to form a predetermined length string.

Abstract: Compressed data objects are stored in a remote data store and are accessible to end users for data retrieval and processing. Descriptive information about data objects and processing logic is displayed and made available for viewing and access by end users having a client application which manipulates the descriptive information to create a customized data retrieval and processing request. The request can be submitted to several data stores in succession for automated data retrieval and processing without jeopardizing request security. The final request is submitted to the appropriate data store(s) and/or vendor(s) for automated processing in accordance with the customized instructions, and the data result set is returned in a format specified by the end user. Householding capability and security features are available. End users can customize their householding parameters, including end user specifications to improve flexibility, speed, and efficiency of the householding process.

Abstract: Relational databases are browsed in a manner that mirrors the interactive browsing of world wide web pages. A schema-based navigational layer is used on top of conventional physical, logical and conceptual database schema layers, to dynamically map data stored in a relational database onto web pages. The navigational schema or schema base is an independent abstraction from the underlying conceptual database schema. The schema base is constructed from relationships and information models. The schema base can be reused or derived from the database design process or produced specifically for navigation through the database. An object-role schema base is used to demonstrate the traversal of relational information in a regenerative, propagative manner. Navigating a database via the presented-schema extends the conventional database concept of the logical view to an interactive model of logical view-transitions.

Abstract: An access communication system provides access between a user system and a plurality of communication networks. The plurality of communication networks provide services to a user in the user system. An access communication system includes a local database system and an access server that is connected to the user system and the plurality of communication networks. The local database system receives a user logon. The local database system then processes the user logon to determine if the user is allowed access to the access communication system based on a local database system. The local database system then provides access to the access communication system to the user in response to the determination that the user is allowed access based on the local database system. The local database system then generates an authorization query for a second database system external to the local database system in response to the determination that the user is not allowed access based on the local database system.

Abstract: Systems and methods for retrieving table entries within a network management system are provided. A method includes receiving a request for table entries which are identified by an object identifier having a plurality of elements. The request includes at least one table entry object identifier and an index identifying at least one element of the object identifier. The method further includes varying the index element in the table entry object identifier and sending a response to the management station. The response includes the table entries obtained by varying the index element.

Abstract: A method of organizing information into a concept network, to facilitate the creation and sharing of knowledge, includes the steps of: categorizing ideas and thoughts into concepts; creating links between concepts; categorizing information into objects; categorizing objects into concepts; creating links between objects; and locating information relevant to any object by evaluating direct object links between that object and directly linked objects, and indirect object links and concept links affecting that object. The method is useful for guiding people and the ways in which they think, communicate and work together, aligning and integrating diverse processes and systems and organizing large quantities of data stored on computer systems, and using the new ways of organizing thinking, communication, systems and data to achieve improved quality of knowledge, knowledge sharing, decision making and timely, effective action.

Abstract: At least one of pre-planting information, planting information, growing information, harvesting information, chemical information, weather information, adjacent crop information, processing information, manufacturing information and retail information is stored in data storage. The stored information is arranged to provide a data profile associated with a particular crop for a defined geographic area. A storage identifier is associated with the arranged data profile for the particular crop. The storage identifier identifies at least one of a container and segregated storage bin for holding a particular crop for a tracked (e.g., an assigned) time duration.

Abstract: A method for indexing and managing a searchable community of non-HTML information. The method utilizes an electronic search engine which indexes data files used by sites created by website generation software. The indexing process of the search engine indexes HTML and non-HTML information from websites enrolled in an electronic community. The non-HTML data includes a database from which enrolled websites operate. This information is downloaded over HTTP, parsed, and indexed with unique parameters into a database running on the search engine. The search portion of the search engine process operates like standard search engines. A user submits a request over HTTP to the search engine. The search engine processes the search request and presents the results to the user in a dynamically created HTML page.

Abstract: A method, apparatus, and article of manufacture for performing data mining applications in a relational database management system. At least one analytic algorithm (110) is performed by a computer directly against a relational database (116), wherein the analytic algorithm includes SQL statements performed by the relational database management system (114) and optional programmatic iteration, and the analytic algorithm creates at least one analytic model within an analytic logical data model from data residing in the relational database.

Abstract: A method for generating a database of data resident on a primary storage device of a computer system for use in a backup system associated with the computer system includes generating a database having information associated with data resident on the primary storage device of the computer system. A graphical user interface is then generated to display the information in the database. The displayed information is preferably configured to be selected by a user to define a backup set of data that is available to be copied from the primary storage device of the computer system to a secondary storage device connected to the computer system. The method may further include the operations of setting a flag to designate selected portions of the database, and writing the selected portions of the database to the primary storage device of the computer system.

Abstract: A method and apparatus are provided for managing changes to a directory of electronic documents. A custom directory is created and stored based on the contents of a master directory. The master directory comprises a taxonomy of categories. A plurality of electronic documents are classified in one or more of the categories. One or more mappings defines how the documents of categories of the master directory map to categories of the custom directory. Mappings may express merges or splits of categories. One or more judgements may be created and stored in the custom directory in association with documents in the categories of the custom directory. Each judgement expresses whether a document is in or not in a category, or locked out of all categories. Modifications to the master directory are automatically propagated to the custom directory, according to the mapping, but without overriding the judgements in the custom directory.

Abstract: A method and system of tracing an agricultural product relates to recording of at least one of planting information, growing information, harvesting information, chemical information, and weather information (e.g., electronically recorded) concerning a crop to form a data profile for a corresponding crop. Once harvested, the crop is segregated from intermixing with other harvested crops by placing the crop in one or more containers, each having a corresponding identifier. The data profile is associated with the container profile for later referencing of the data profile.

Abstract: An invention for monitoring user choices and selections on a search result web page and providing alternative query expressions to further narrow and enhance the user's search. Monitoring and recording user choices and selections is achieved by a query manager. Query strings are then standardized. The search is performed on an Internet search engine, and each search result item in the result output set is then associated with a list of alternative standardized queries by an alternate query matching manager. Each search result item in the result output set that is associated with the alternate queries is then flagged. The resulting flagged list of alternative queries is displayed to the user by a page presentation manager using a graphical user interface for subsequent user selection. Upon selection of the graphical user interface for alternate query expressions, an alternate query selection manager retrieves and displays each alternate query to the user.

Abstract: A method for facilitating the navigation of application specific data on a data page, i.e. web page, during use of a data browser, i.e. Netscape™, MS Explorer™, etc. Included on the data page are a plurality of links each corresponding to data. In use, the data may be retrieved upon selection of the corresponding link. To facilitate the navigation of the data, the links are displayed each as a component of an indicia such as a pointer or chevron to imply a relationship between the data.

Abstract: A method for effectively collecting and disseminating information. In use, data is retrieved from multiple users in a plurality of categories. To disseminate the information, access is provided to the data via an interface which lists the data categories. By selecting a category in the interface, the user can subscribe to a data category and access the data therein.

Abstract: The present invention is directed to providing a higher degree of association between nodes and links in a graph by creating data structures (spiders) that provide views into graphs that transcend the relatively static association of a conventional graph. A spider's variables bind to any number of nodes and links in the graph, enabling all of the bound nodes and links by addressing the spider. By adding constraints on the extent or degree of binding in a spider to a graph, a subset of the graph is identified. The spider can then used to address the subset of the graph as constrained by the spider. A spider can bind to a link in order to identify a parent/child structural subset of the graph. More specifically a spider is a collection of variables that create a template or pattern and bind to the nodes and links in the graph. A spider traverses a graph by binding its variables to various nodes and links in the graph.

Abstract: A method for searching for a query word in a database of automatically recognized text generated, for example by an optical character recognition (OCR) system or a speech recognition (SR) system finds entries that most closely match the query word. The database is indexed into a trie data structure, which represents all possible words in the database. The trie data structure has a plurality of branch nodes, each representing a letter of at least one word, and a plurality of leaf nodes, each representing a respective word. The trie data structure is searched for each query word by selecting the first letter of the query word and also selecting a root node in the trie data structure as the current node. All possible child nodes of the current node are identified. Respective estimated probability values for matching respective letters of the query word with the letters associated with the nodes in the path taken through the trie data structure are calculated for each identified child node.

Abstract: A garbage collection method that distinguishes between local objects and managed objects, and between an ordinary pointer to an object, an owning pointer to an object, and a non-owning pointer to an object is presented. Ordinary pointers point only to local objects, and owning and non-owning pointers point only to managed objects. Managed objects have attributes including a count of the number of owning pointers referring to them, and a linked list of non-owning pointers referring to them. Managed objects only possess non-owning pointers. Only an invocation of a subroutine within a thread can possess an owning pointer. Using this method, when an invocation exits, its exit code gives up ownership of all objects it owned. When an object is no longer reachable from any owning pointer, either directly, or indirectly through non-owning pointers, the object is immediately de-allocated.

Abstract: A server computer updates client computers' copies of subscription files stored on a network. The server computer retrieves a database record from a subscription database. The database record includes at least client computer and subscription file information. The server computer checks the subscription file stored on the network for any changes which may have occurred to the file since the previous checking of the subscription file preferably by comparing the last save time stamp to a time stamp on the subscription file stored on the network. If changes have occurred, the server computer creates an update file for the client computer and transmits the update file to the client computer, preferably by electronic mail. Each database record may further contain a check interval indicating the periodicity of the checking of the subscription file for changes. The database record may further contain a time last checked field which is updated each time the subscription file is checked for changes.

Abstract: The invention provides a method, system, and computer program product for determining accessor entitlement to a resource in response to an accessor request for access to the resource. The invention associates a resource with an entitlement expression that includes a reference to at least one membership map having membership information regarding the accessor and associates with the accessor a unique identifier that acts as an index into each membership map. The entitlement expression is evaluated for the resource to determine the entitlement of the requesting accessor to the resource. The evaluation includes looking up the accessor's membership information in at least one membership map using the accessor's unique identifier. The invention may further include at least one accessor group having a name, zero or more accessors that are members of the group, and a membership map for determining whether a particular accessor is a member of the group.