80 results about "Enumerated type" patented technology

The invention provides improved methods and apparatus for workflow editing. Such methods and apparatus permit, for example, user-defined and / or other tasks to be combined in any combination or combinations to specify a workflow. The tasks can be linked for direct, serial processing and / or for conditional processing that includes branching and / or looping. The invention also improved methods and apparatus of workflow definition and processing with extensible actions. The invention provides, further, improved methods and apparatus for workflow definition and processing which utilize workflow variables for communication of data and control information among tasks within a workflow. The invention provides, still further, improved methods and apparatus of workflow definition and processing with enhanced messaging. The invention provides, still yet further, improved methods and apparatus for workflow definition and processing which permit definition of hierarchically enumerated data types and for for definition of “plans” to collect, e.g., for storage, data such as the aforementioned hierarchical data types.

An enumerator employs “indexing volumes” as the add-on values used to compute indexes for n-item ordered sets such as symbol sequences. Each indexing volume is associated with a different class into which the allowed ordered sets are partitioned. The indexing volumes all equal or exceed the number of ordered sets that belong to their respective classes. Additionally, the indexing volume Vi associated with a given class of i-item equals or exceeds the sum of the indexing volumes associated with the classes that contain the (i−1)-item prefixes of the ordered sets that belong to the given class. The indexing volumes are quantized such that each volume V=wrs, where r is an integer greater than unity, s is a non-negative integer, w is a positive integer less than rm, m is some positive integer less than h, and, for some allowed ordered set whose size is less than n, h is the number of radix-r digits in the smallest quotient that results from evenly dividing by a positive-integer power of r the set count of the class to which that allowed ordered set belongs. As a result, the addition operations used to compute the indexes can be performed with limited precision, and storage requirements for the add-on values can be relatively modest.

In many reference resolution problems there are many candidate referents, and the overhead of enumerating them can be considerable. The overhead is reduced by stopping enumeration before all candidate referents have been enumerated, utilizing the properties of ordered and semi-ordered enumerators. Converting semi-ordered enumerators into ordered enumerators and combining several ordered enumerators into a single using dynamic weightings for handling determiner interpretations are disclosed.

An enumerator employs “indexing volumes” as the add-on values used to compute indexes for n-item ordered sets such as symbol sequences. Each indexing volume is associated with a different class into which the allowed ordered sets are partitioned. The indexing volumes all equal or exceed the number of ordered sets that belong to their respective classes. Additionally, the indexing volume Vi associated with a given class of i-item equals or exceeds the sum of the indexing volumes associated with the classes that contain the (i−1)-item prefixes of the ordered sets that belong to the given class. The indexing volumes are quantized such that each volume V=wrs, where r is an integer greater than unity, s is a non-negative integer, w is a positive integer less than rm, m is some positive integer less than h, and, for some allowed ordered set whose size is less than n, h is the number of radix-r digits in the smallest quotient that results from evenly dividing by a positive-integer power of r the set count of the class to which that allowed ordered set belongs. As a result, the addition operations used to compute the indexes can be performed with limited precision, and storage requirements for the add-on values can be relatively modest.

Consistency between the components used to generate and query a full-text index is determined and if a mismatch is detected, an error may be surfaced. A structure including information associated with each component used to build an index is programmatically compared with currently available components. The structure may be interrogated to enumerate the resources bound to a particular index. The enumeration of bound resources facilitates determination of what indexes (if any) must be regenerated for consistency as a result of a component upgrade or a move to another system.