Abstract: This invention introduces a new concept called virtual construct intervals (VCI), where each predicate interval is decomposed into one or more of these construct intervals. These VCIs strictly cover the predicate interval. Namely, every attribute value covered by the predicate interval is also covered by at least one of the decomposed VCIs, and vice versa. Each construct interval has a unique ID or interval coordinate and a set of endpoints. A construct interval is considered activated when a predicate interval using it in its decomposition is added to the system. The predicate ID is then inserted into the ID lists associated with the decomposed VCIs. To facilitate fast search, a bitmap vector is used to indicate the activation of VCIs that cover an event value. The challenge is to find an appropriate set of construct intervals to make predicate decomposition simple and, more importantly, to build efficient bitmap indexes.

Abstract: Systems and methods for providing e-business services based on security SLAs (service level agreements) in a hosted computing environment. More specifically, the systems and methods enable efficient enforcement of individualized security SLAs, wherein individualized SLA agreements are specified, mapped into security rules and continually monitored against system events via an efficient rule index to determine security violations and trigger proper actions.

Abstract: A method and system for personalizing an interactive voice response (IVR) system to reduce a number of key sequences to reach a desired source of information, includes storing a caller profile, and retrieving the caller's profile to construct a personalized IVR dialogue menu and play out the personalized menu.

Abstract: An arrangement for providing gracefully degraded services on the Internet under overloaded conditions, involving tagging user request to indicate the status of said request and providing appropriate level of degraded services gracefully responsive to said tagging information.

Abstract: Systems and methods for providing e-business services based on security SLAs (service level agreements) in a hosted computing environment. More specifically, the systems and methods enable efficient enforcement of individualized security SLAs, wherein individualized SLA agreements are specified, mapped into security rules and continually monitored against system events via an efficient rule index to determine security violations and trigger proper actions.

Abstract: A data communications network includes network servers, clusters of network servers, as well as content providers and service providers, such as ISPs and ASPs, and further includes at least one data processor that operates under control of a stored program resident on a memory media. The stored program directs operation of the data processor to provide users with differentiated services by defining, for individual ones of the plurality of content providers, a plurality of levels of services for users, and for responding to service level tables received from individual ones of the plurality of content providers, where individual ones of users are assigned to one of the plurality of levels of service. There is also at least one resource requirement table for defining at least a minimum set of resources required for realizing individual ones of said plurality of service levels.

Abstract: An arrangement for providing gracefully degraded services on the Internet under overloaded conditions, involving tagging user request to indicate the status of said request and providing appropriate level of degraded services gracefully responsive to said tagging information.

Abstract: A system and method for billing one or more participating parties for client access to the internet is disclosed including the steps of identifying at least one of the one or more participating parties as being responsible for the billing, allocating a share of the billing to each responsible participating party based on a predetermined function and computing a billing amount for each of the responsible participating parties based on a function of the share and a client bandwidth usage.

Abstract: A method for computing n-dimensional decomposable image transformation using the 1D approach with constrained transpose memory provides a minimized rounding/truncation error. The method minimizes transpose memory size required to fulfill a defined accuracy requirement for n-dimensional image transformation. A set of input data elements are stored. Then, a first transform, of the multiple dimension transform, is performed on the set of input data elements so as to form an array of transformed data elements, each of the transformed data elements having a larger number of bits than the input data elements. A common range of the transformed data elements is determined, and a minimum number of bits required to represent the common range without loss of information is then determined. The memory word size available for storage of the transformed data elements is compared with a minimum number of bits so as to determine an excess number of bits.