Abstract: 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.

Abstract: 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.

Abstract: A system, method and search engine for searching images for data contained therein. Training images are provided and image attributes are extracted from the training images. Attributes extracted from training images include image features characteristic of a particular numerically generated image type, such as horizontal lines, vertical lines, percentage white area, circular arcs and text. Then, the training images are classified according to extracted attributes and a particular classifier is selected for each group of training images. Classifiers can include classification trees, discriminant functions, regression trees, support vector machines, neural nets and hidden Markov models. Available images are collected from remotely connected computers, e.g., over the Internet. Collected images are indexed and provided for interrogation by users. As a user enters queries, indexed images are identified and returned to the user. The user may provide additional data as supplemental data to the extracted image data.

Abstract: 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.

Abstract: A system, program storage device, and method of buffering an electronic document received from a host computer, wherein the method comprises determining whether an original source code of the electronic document includes executable coding which when executed by a client computer, causes the client computer to perform undesired operations, and producing an alternate source code of the electronic document, which eliminates the coding, wherein the undesired operations are characterized as undesirable based on predetermined settings established by the client computer. The electronic document comprises any of a web page, electronic mail message, an electronic mail attachment, a note in a hypertext format, a text document, a text file, and an application-specific electronic document. Each of the original source code and the alternate source code comprises a hypertext transfer protocol (HTTP) source code.

Abstract: A barcode recovery system, including: an image processor configured to determine a binary vector corresponding to a blurry barcode image by: maximizing an objective function that models the system using splines. Optimizing the objective function may be efficiently accomplished by constraining a search on each bit in the barcode image to a nearby range of influence of other bits in the barcode image. Further efficiency may be gained by enumerating the local groups of bits in graycode order and by adding or subtracting values from a precomputed inner product matrix to state variables to compute the complete objective function.

Abstract: 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 (xt), where x is a variable involved with the step. A resulting cost (ƒt(xt)) is calculated that results from selecting xt when performing the step, where ƒt is a cost function. A minimum possible cost (ƒt(x*t)) associated with the selection of x* is then found and the difference between the resulting cost (ƒt(xt)) and the minimum possible cost (ƒt(x*t)) is determined. A direction of movement from xt to xt+1 is selected and a subsequent step that relies on the section of xt+1 is then performed.

Abstract: 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.

Abstract: 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.

Abstract: A barcode recovery system, including: an image processor configured to determine a binary vector corresponding to a blurry barcode image by: maximizing an objective function that models the system using splines. Optimizing the objective function may be efficiently accomplished by constraining a search on each bit in the barcode image to a nearby range of influence of other bits in the barcode image. Further efficiency may be gained by enumerating the local groups of bits in graycode order and by adding or subtracting values from a precomputed inner product matrix to state variables to compute the complete objective function.

Abstract: A method for consistent selectivity estimation based on the principle of maximum entropy (ME) is provided. The method efficiently exploits all available information and avoids the bias problem. In the absence of detailed knowledge, the ME approach reduces to standard uniformity and independence assumptions. The disclosed method, based on the principle of ME, is used to improve the optimizer's cardinality estimates by orders of magnitude, resulting in better plan quality and significantly reduced query execution times.

Abstract: 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.

Abstract: 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 (xt), where x is a variable involved with the step. A resulting cost (ƒt(xt)) is calculated that results from selecting xt when performing the step, where ƒt is a cost function. A minimum possible cost (ƒt(x*t)) associated with the selection of x* is then found and the difference between the resulting cost (ƒt(xt)) and the minimum possible cost (ƒt(x*t)) is determined. A direction of movement from xt to xt+1 is selected and a subsequent step that relies on the section of xt+1 is then performed.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: A system and method enhance a buyer's performance by gathering information, presenting to sellers sophisticated buyers who do not pay more than the minimum and indicating to sellers when they are competitive, influencing them to lower prices. The system operates through a web site and creates a major web portal where a consumer obtains advice about prices of just about anything and initiates transactions using various services provided by the system. Fictitious user names are generated and used by the system to work with different sellers to generate and store specific quotes. This information is later used to purchase goods on behalf of buyers who do not want to reveal their identities. I addition, the system can also uncover hidden fee structures associated with sellers and businesses.

Abstract: 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.