摘要:
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.
摘要:
A sync proxy or sync server logic, process and apparatus employing sync logic and/or transformation codes distributed in the network to increase the scalability and improve the manageability of synchronization between a client such as: an Internet appliance; a handheld or palmtop device; a smart phone or intelligent pager; and their remote replica sources. An example of an adaptive sync server for synchronizing data between a client and a remote host replica, which stores a replica of data on the client includes sync acceptor logic for identifying a replica host and a sync logic which is application specific to a data type associated with the client and the remote host; wherein the sync logic can be located anywhere on a network remote to the sync server and the remote host, in response to a sync request; and sync handler logic, coupled to the sync acceptor logic, for retrieving remote sync logic from the network, connecting to the remote host, and synchronizing the data between the client and the remote host using the retrieved sync logic. The sync request could explicitly (or by default) identify the replica host and the sync logic or could include an address of a directory service storing information for identifying the replica host and the sync logic. The sync request could also or alternatively include information for identifying a (local or remote) device specific transformation code for converting data between the client and the remote host during synchronization; and means for retrieving the transformation code based on the information and converting the data between the client and the remote host based on the device specific transformation code.
摘要:
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.
摘要:
An apparatus and a method for constructing a multidimensional index tree which minimizes the time to access data objects and is resilient to the skewness of the data. This is achieved through successive partitioning of all given data objects by considering one level at a time starting with one partition and using a top-down approach until each final partition can fit within a leaf node. Subdividing the data objects is via a global optimization approach to minimize the area overlap and perimeter of the minimum bounding rectangles covered by each node. The current invention divides the index construction problem into two subproblems: the first one addresses the tightness of the packing (in terms of area, overlap and perimeter) using a small fan out at each index node and the other one handles the fan out issue to improve index page utilization. These two stages are referred to as binarization and compression. The binarization stage constructs a binary tree such that the entries in the leaf nodes correspond to the spatial data objects. The compression stage converts the binary tree into a tree for which all but the leaf nodes and the parent nodes of all leaf nodes have branch factors of M. In the binarization stage, a weighting or skew factor is used to achieve flexibility in determining the number of data objects to be included in each of the partitions to obtain a tree structure with desirable query performance. Thus the index tree constructed is not required to be height balanced. This provides a means to trade-off imbalance in the index tree in order to reduce the number of pages which need to be accessed in a query.
摘要:
There are provided a method, a computer program product, and a system for maintaining a materialized view defined on a relation of a relational database. The method includes the step of performing content-based filtering on the relation to identify an update to the relation as being irrelevant with respect to the materialized view.
摘要:
The present invention relates to the problem of scheduling work for employees and/or other resources in a help desk or similar environment. The employees have different levels of training and availabilities. The jobs, which occur as a result of dynamically occurring events, consist of multiple tasks ordered by chain precedence. Each job and/or task carries with it a penalty which is a step function of the time taken to complete it, the deadlines and penalties having been negotiated as part of one or more service level agreement contracts. The goal is to minimize the total amount of penalties paid. The invention consists of a pair of heuristic schemes for this difficult scheduling problem, one greedy and one randomized. The greedy scheme is used to provide a quick initial solution, while the greedy and randomized schemes are combined in order to think more deeply about particular problem instances. The invention also includes a scheme for determining how much time to allocate to thinking about each of several potential problem instance variants.
摘要:
Techniques for classifying structural data with skewed distribution are disclosed. By way of example, a method classifying structural input data comprises a computer system performing the following steps. Multiple classifiers are constructed, wherein each classifier is constructed on a subset of training data, using one or more selected composite features from the subset of training data. A consensus among the multiple classifiers is computed in accordance with a voting scheme such that at least a portion of the structural input data is assigned to a particular class in accordance with the computed consensus. Such techniques for structured data classification are capable of handling skewed class distribution and partial feature coverage issues.
摘要:
A method and structure for monitoring continual queries over moving objects, including identifying a query region in a digital format. Each query region is strictly covered by at least one shingle such that each query region is completely covered by the at least one shingle and no section of any of the at least one shingle falls outside the query region.
摘要:
There are provided methods, computer program products, and systems for indexing a data stream. A method for indexing a data stream having attribute values includes the steps of parsing the data stream, and forming an index of tuples for a subset of attribute values of the data stream. The index is configured for retrieving the top-K tuples that optimize linearly weighted sums of at least some of the attribute values in the subset.
摘要:
A system and method for using continuous failure predictions for proactive failure management in distributed cluster systems includes a sampling subsystem configured to continuously monitor and collect operation states of different system components. An analysis subsystem is configured to build classification models to perform on-line failure predictions. A failure prevention subsystem is configured to take preventive actions on failing components based on failure warnings generated by the analysis subsystem.