| Patent application number | Description | Published |
|---|
| 20080222093 | AUTOMATICALLY AND ADAPTIVELY DETERMINING EXECUTION PLANS FOR QUERIES WITH PARAMETER MARKERS - A method and system for automatically and adaptively determining query execution plans for parametric queries. A first classifier trained by an initial set of training points is generated. A query workload and/or database statistics are dynamically updated. A new set of training points is collected off-line. Using the new set of training points, the first classifier is modified into a second classifier. A database query is received at a runtime subsequent to the off-line phase. The query includes predicates having parameter markers bound to actual values. The predicates are associated with selectivities. A mapping of the selectivities into a plan determines the query execution plan. The determined query execution plan is included in an augmented set of training points, where the augmented set includes the initial set and the new set. | 09-11-2008 |
| 20080229126 | COMPUTER SYSTEM MANAGEMENT AND THROUGHPUT MAXIMIZATION IN THE PRESENCE OF POWER CONSTRAINTS - Methods are provided for maximizing the throughput of a computer system in the presence of one or more power constraints. Throughput is maximized by repeatedly or continuously or periodically optimizing task scheduling and assignment for each of a plurality of components of a computer system. The components include a plurality of central processing units (CPUs) each operating at a corresponding operating frequency. The components also include a plurality of disk drives. The corresponding operating frequencies of one or more CPUs of the plurality of CPUs are adjusted to maximize computer system throughput under one or more power constraints. Optimizing task scheduling and assignment, as well as adjusting the corresponding operating frequencies of one or more CPUs, are performed by solving a mathematical optimization problem using a first methodology over a first time interval and a second methodology over a second time interval longer than the first time interval. The first methodology comprises a short term heuristic solver for adapting to computer system changes that occur on a short time scale, and the second methodology comprises a long term solver having greater accuracy and greater computational complexity than the first methodology. | 09-18-2008 |
| 20080263001 | SYSTEM AND METHOD FOR AUTOMATING DATA PARTITIONING IN A PARALLEL DATABASE - A system for automating data partitioning in a parallel database includes plural nodes connected in parallel. Each node includes a database server and two databases connected thereto. Each database server includes a query optimizer. Moreover, a partitioning advisor communicates with the database server and the query optimizer. The query optimizer and the partitioning advisor include a program for recommending and evaluating data table partitions that are useful for processing a workload of query statements. The data table partitions are recommended and evaluated without requiring the data tables to be physically repartitioned. | 10-23-2008 |
| 20080306887 | METHOD FOR MACHINE LEARNING WITH STATE INFORMATION - Methods, systems, and computer program products are provided for the online convex optimization problem, in which the decision maker has knowledge of the all past states and resulting cost functions for his previous choices and attempts to make a new choice that results in minimum regret. The method does not rely upon the structure of the cost function or the characterization of the states and takes advantage of the similarity between successive states to enable the method to converge to a reasonably optimal result. | 12-11-2008 |
| 20080306891 | METHOD FOR MACHINE LEARNING WITH STATE INFORMATION - Methods, systems, and computer program products are provided for the online convex optimization problem, in which the decision maker has knowledge of the all past states and resulting cost functions for his previous choices and attempts to make a new choice that results in minimum regret. The method does not rely upon the structure of the cost function or the characterization of the states and takes advantage of the similarity between successive states to enable the method to converge to a reasonably optimal result. | 12-11-2008 |
| 20090000691 | METHOD FOR OPERATING AND MANAGING A RE-FUELING BUSINESS - Disclosed is a method for operating and managing a re-fueling business. The method includes contracting with a customer to fuel a fuel consuming vehicle for the customer, providing a locking device with a fuel tank of the vehicle, the locking device being unlockable by the re-fueling business and the customer, and transporting a fuel containing structure from the re-fueling business to various locations of the customer's vehicle whenever a fueling of the vehicle is desirable to the business and the customer, the locations being remote of the business, unlocking the locking device of the fuel tank upon arrival at the locations, filling the fuel tank with an amount of fuel from the fuel containing structure upon the transporting of the fuel container to the locations, and re-locking the locking device after filling the fuel tank with the amount of fuel. | 01-01-2009 |
| 20090005902 | METHOD FOR OPERATING AND MANAGING A RE-FUELING BUSINESS - Disclosed is a method for operating and managing a re-fueling business. The method includes contracting with a customer to fuel a fuel consuming vehicle for the customer, providing a locking device with a fuel tank of the vehicle, the locking device being unlockable by the re-fueling business and the customer, and transporting a fuel containing structure from the re-fueling business to various locations of the customer's vehicle whenever a fueling of the vehicle is desirable to the business and the customer, the locations being remote of the business, unlocking the locking device of the fuel tank upon arrival at the locations, filling the fuel tank with an amount of fuel from the fuel containing structure upon the transporting of the fuel container to the locations, and re-locking the locking device after filling the fuel tank with the amount of fuel. | 01-01-2009 |
| 20090106244 | DISCOVERING INTERESTINGNESS IN FACETED SEARCH - Exemplary embodiments of the present invention relate to enhanced faceted search support for OLAP queries over unstructured text as well as structured dimensions by the dynamic and automatic discovery of dimensions that are determined to be most “interesting” to a user based upon the data. Within the exemplary embodiments “interestingness” is defined as how surprising a summary along some dimensions is from a user's expectation. Further, multi-attribute facets are determined and a user is optionally permitted to specify the distribution of values that she expects, and/or the distance metric by which actual and expected distributions are to be compared. | 04-23-2009 |
| 20090240772 | METHOD AND APPARATUS FOR COLLABORATIVE SELECTION OF PROPOSALS - A method and apparatus for selecting a subset of proposals from a set of proposals submitted via a web site, including defining proposal attributes for the selecting, formulating selection requirements for the subset, establishing metrics for comparing proposals according to the proposal attributes and the selection requirements, evaluating each of the set of proposals according the established metrics, distributing the results of evaluating each of the set of proposals to the submitter of each proposal, formulating an optimization problem for determining the subset of proposals, determining the subset of proposals by solving the optimization problem, and accepting feedback about the determining including changing the optimization problem based on the feedback. | 09-24-2009 |
| 20090293062 | Method for Dynamically Freeing Computer Resources - A method dynamically frees computer resources in a multitasking and windowing environment by activating a GUI widget to initiate pausing of an application, pausing CPU processing of the application code, maintaining data of the application in main memory, storing state information for the application code and a process of the application in mass storage, removing the application code from main memory to mass storage, when another application requires additional memory, activating another GUI widget to resume running of the application, restoring the state information for the code and the process to main memory before the application resumes running, and resuming the CPU processing of the application. | 11-26-2009 |
| 20090319227 | ADAPTIVE TRAITOR TRACING - One embodiment of the present invention includes a method for traitor tracing that selects a probability distribution for the assignment of file-segment variations in a digital file. This probability distribution is selected to improve traceability for a particular size of a coalition of attackers. At least one symbol for each file-segment variation is then distributed based on the selected probability distribution. | 12-24-2009 |
| 20110026699 | METHOD AND SYSTEM FOR AUTHENTICATING TELEPHONE CALLERS AND AVOIDING UNWANTED CALLS - A service that handles incoming telephone calls without bothering the telephone subscriber is disclosed. The service permits a call to go through to a subscriber if the service determines that the call is not unwanted and the caller has been unauthenticated. The authentication is based on challenging the caller to prove its identity rather than relying on caller ID displays. Prospective callers pre-register with the service providing caller account information. When a caller is issued a challenge, the caller may prove its authenticity by supplying the challenge back to the service along with its registered information. | 02-03-2011 |
| 20120005142 | FAST ADAPTATION IN REAL-TIME SYSTEMS - According to one embodiment of the present invention, a method for online convex optimization is provided. The method includes performing a step that relies on the selection of x at a time t (x | 01-05-2012 |
| 20140244658 | OPTIMIZING USER SELECTION FOR PERFORMING TASKS IN SOCIAL NETWORKS - Embodiments of the invention relate to optimizing user response rate in social media. One embodiment includes generating a statistical model for modeling a likelihood of social media user response from data collected from social media using a set of available features. The social media users are ranked in an estimation set based on the statistical model. The ranked social media users are placed in a rank ordered list. A sub-interval on the rank ordered list is selected for maximizing the response rate. | 08-28-2014 |
