Patents by Inventor Nimrod Megiddo
Nimrod Megiddo has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).
-
Patent number: 7689978Abstract: Disclosed is a system and method for instructing a computer program to self-optimize comprising inputting commands into the computer program and allowing a learning protocol in the computer program to determine an approximately optimal policy of operation of the computer program based on the commands. The commands comprise operational choices for the computer program to select from including an approximately optimal choice for optimizing the operation of the program. The commands comprise a selection command for selecting any function in a list of instructions inputted into the program, wherein the function provides a basis of making an approximately optimal choice. Additionally, the commands comprise a rule command for instructing the computer program of how to make an approximately optimal choice. Moreover, the commands comprise a reward command for instructing the program which of the operational choices results in an approximately optimal choice for optimizing the operation of the computer program.Type: GrantFiled: November 25, 2003Date of Patent: March 30, 2010Assignee: International Business Machines CorporationInventor: Nimrod Megiddo
-
Patent number: 7673657Abstract: 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.Type: GrantFiled: March 26, 2008Date of Patent: March 9, 2010Assignee: International Business Machines CorporationInventor: Nimrod Megiddo
-
Patent number: 7661446Abstract: 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.Type: GrantFiled: June 26, 2007Date of Patent: February 16, 2010Assignee: International Business Machines CorporationInventor: Nimrod Megiddo
-
Publication number: 20090319227Abstract: 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.Type: ApplicationFiled: June 20, 2008Publication date: December 24, 2009Applicant: International Business Machines CorporationInventors: Hongxia Jin, Jeffrey Bruce Lotspiech, Nimrod Megiddo, Michael Joseph Nelson
-
Publication number: 20090293062Abstract: 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.Type: ApplicationFiled: May 20, 2008Publication date: November 26, 2009Applicant: International Business Machines CorporationInventors: Arnon Amir, Nimrod Megiddo
-
Publication number: 20090240772Abstract: 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.Type: ApplicationFiled: March 19, 2008Publication date: September 24, 2009Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventor: NIMROD MEGIDDO
-
Patent number: 7587621Abstract: 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 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.Type: GrantFiled: November 8, 2006Date of Patent: September 8, 2009Assignee: International Business Machines CorporationInventors: Robert Krauthgamer, Nimrod Megiddo
-
Patent number: 7562090Abstract: 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.Type: GrantFiled: December 19, 2002Date of Patent: July 14, 2009Assignee: International Business Machines CorporationInventors: Guy Maring Lohman, Nimrod Megiddo, Jun Rao, Chun Zhang
-
Patent number: 7539295Abstract: A method for creating and maintaining threads of communications comprises accepting an electronic-communication call from a caller, determining if the caller is a new or previous caller by determining if a prior-caller user identification is contained within a call-receiving system, responsive to determining that the caller is a new caller assigning a new-caller user identification to the new caller and assigning a unique thread identification for communications related to a new issue, and responsive to determining that the caller is a known previous caller verifying a known-caller user identification and determining whether the known previous caller is calling about a new issue. Responsive to determining that the known previous caller is calling about a new issue, the method further includes assigning a unique thread identification to the new issue.Type: GrantFiled: August 21, 2008Date of Patent: May 26, 2009Assignee: International Business Machines CorporationInventors: Arnon Amir, Nimrod Megiddo
-
Publication number: 20090106244Abstract: 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.Type: ApplicationFiled: August 29, 2008Publication date: April 23, 2009Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Debabrata Dash, Guy M. Lohman, Nimrod Megiddo, Jun Rao
-
Patent number: 7512574Abstract: A novel method is employed for collecting optimizer statistics for optimizing database queries by gathering feedback from the query execution engine about the observed cardinality of predicates and constructing and maintaining multidimensional histograms. This makes use of the correlation between data columns without employing an inefficient data scan. The maximum entropy principle is used to approximate the true data distribution by a histogram distribution that is as “simple” as possible while being consistent with the observed predicate cardinalities. Changes in the underlying data are readily adapted to, automatically detecting and eliminating inconsistent feedback information in an efficient manner. The size of the histogram is controlled by retaining only the most “important” feedback.Type: GrantFiled: September 30, 2005Date of Patent: March 31, 2009Assignee: International Business Machines CorporationInventors: Peter Jay Haas, Volker Gerhard Markl, Nimrod Megiddo, Utkarsh Srivastava
-
Patent number: 7512629Abstract: The present invention provides a method of selectivity estimation in which preprocessing steps improve the feasibility and efficiency of the estimation. The preprocessing steps are partitioning (to make iterative scaling estimation terminate in a reasonable time for even large sets of predicates), forced partitioning (to enable partitioning in case there are no “natural” partitions, by finding the subsets of predicates to create partitions that least impact the overall solution); inconsistency resolution (in order to ensure that there always is a correct and feasible solution), and implied zero elimination (to ensure convergence of the iterative scaling computation under all circumstances). All of these preprocessing steps make a maximum entropy method of selectivity estimation produce a correct cardinality model, for any kind of query with conjuncts of predicates. In addition, the preprocessing steps can also be used in conjunction with prior art methods for building a cardinality model.Type: GrantFiled: July 13, 2006Date of Patent: March 31, 2009Assignee: International Business Machines CorporationInventors: Peter Jay Haas, Marcel Kutsch, Volker Gerhard Markl, Nimrod Megiddo
-
Patent number: 7493319Abstract: 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.Type: GrantFiled: May 9, 2008Date of Patent: February 17, 2009Assignee: International Business Machines CorporationInventors: Debabrata Dash, Guy M. Lohman, Nimrod Megiddo, Jun Rao
-
Patent number: 7480621Abstract: A system, method and program product for commerce management, especially for managing contingency agreements or contracts. An agreement is entered into the system, logging conditions for the agreement and identifying potential responses to satisfy each condition. A location may also be identified for each identified potential response, e.g. a HTML link to an internet web site. Milestones are set to determine when to check whether conditions have been satisfied. As each milestone is encountered information is retrieved from the locations or provided manually. The retrieved information is checked to determine whether the agreement is determinate, i.e., all of the conditions have been satisfied or, the agreement has failed because one condition will not be satisfied. If more conditions remain unsatisfied and are identified with subsequent milestones, the most recent milestone is recorded. The contracting parties are notified regarding status of the agreement and of passing any milestone.Type: GrantFiled: March 22, 2000Date of Patent: January 20, 2009Assignee: International Business Machines CorporationInventor: Nimrod Megiddo
-
Publication number: 20090000691Abstract: 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.Type: ApplicationFiled: June 26, 2007Publication date: January 1, 2009Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventor: Nimrod Megiddo
-
Publication number: 20090005902Abstract: 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.Type: ApplicationFiled: March 26, 2008Publication date: January 1, 2009Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventor: Nimrod Megiddo
-
Publication number: 20080306891Abstract: 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.Type: ApplicationFiled: June 5, 2008Publication date: December 11, 2008Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Elad Eliezer Hazan, Nimrod Megiddo
-
Publication number: 20080306887Abstract: 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.Type: ApplicationFiled: June 7, 2007Publication date: December 11, 2008Inventors: Elad Eliezer Hazan, Nimrod Megiddo
-
Publication number: 20080263001Abstract: 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.Type: ApplicationFiled: April 28, 2008Publication date: October 23, 2008Inventors: GUY MARING LOHMAN, Nimrod Megiddo, Jun Rao, Chun Zhang
-
Publication number: 20080229126Abstract: 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.Type: ApplicationFiled: May 29, 2008Publication date: September 18, 2008Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Robert Krauthgamer, Nimrod Megiddo