Abstract: A method for predicting the behavior of an electronic social network (ESN) includes identifying one user's connections with other users and creating a data structure in a memory that represents the users and their connections in the ESN. A plurality of data sources for electronic communications between users are analyzed and assigned a relative importance value. A weight is also assigned to each of the connections between the users. The weight is an encoded value computed based on a link structure of the connections where the link structure includes metadata indicating a category and a status of the respective connection. The probability that one user will communicate with one of the other users is calculated based on the analyzed plurality of data sources calculating, and the user's connections with respect to other users are ranked based on the calculated probabilities.

Abstract: A method, computer system, and a computer program product for computing a product drag effect is provided. The present invention may include receiving a plurality of transaction record data. The present invention may then include tuning a plurality of parameters based on the received transaction record data. The present invention may further include determining a product drag frequency based on the authorized parameter tuning and received transaction record data. The present invention may then include calculating a drag probability based on the determined product drag frequency. The present invention may then include deriving an observation from the calculated drag probability. The present invention may lastly include outputting the derived observation to a user.

Abstract: A method for predicting the behavior of an electronic social network (ESN) includes identifying one user's connections with other users and creating a data structure in a memory that represents the users and their connections in the ESN. A plurality of data sources for electronic communications between users are analyzed and assigned a relative importance value. A weight is also assigned to each of the connections between the users. The weight is an encoded value computed based on a link structure of the connections where the link structure includes metadata indicating a category and a status of the respective connection. The probability that one user will communicate with one of the other users is calculated based on the analyzed plurality of data sources calculating, and the user's connections with respect to other users are ranked based on the calculated probabilities.

Abstract: A method for predicting the behavior of an electronic social network (ESN) includes identifying one user's connections with other users and creating a data structure in a memory that represents the users and their connections in the ESN. A plurality of data sources for electronic communications between users are analyzed and assigned a relative importance value. A weight is also assigned to each of the connections between the users. The weight is an encoded value computed based on a link structure of the connections where the link structure includes metadata indicating a category and a status of the respective connection. The probability that one user will communicate with one of the other users is calculated based on the analyzed plurality of data sources calculating, and the user's connections with respect to other users are ranked based on the calculated probabilities.

Abstract: Methods may rank one user's connections in an electronic social network. The method may include identifying, by electronic apparatus, one user's connections with other users in an electronic social network. The method may additionally include analyzing, by electronic apparatus, a plurality of data sources for electronic communications between the one user and the other users. The method may further include calculating, by electronic apparatus, for each of the other users the probability that the one user will communicate with that other user based on the analyzed plurality of data sources. The method may additionally include ranking, by electronic apparatus, the one user's connections with the other users based on the calculated probabilities. In some embodiments, the method may include removing from a graph, by electronic apparatus, one or more of the one user's connections with the other users based on the ranked one user's connections.

Abstract: Methods and arrangements for conducting a search using query logs. A query log is consulted and query rewrite rules are learned automatically based on data in the query log. The learning includes obtaining click-through data present in the query log.

Abstract: Methods and arrangements for conducting a search using query logs. A query log is consulted and query rewrite rules are learned automatically based on data in the query log. The learning includes obtaining click-through data present in the query log.

Abstract: Techniques for dynamically compiling a list of one or more solution documents are provided. The techniques include receiving one or more questions, forming one or more of the one or more questions into one or more lists, wherein forming one or more questions into one or more lists comprises expressing each question in a compressed manner using one or more sets of one or more keywords, receiving input from a solution database, and using the one or more lists and input from a solution database to dynamically compile a list of one or more solution documents in connection with the one or more questions.

Abstract: Systems and computer program products may rank one user's connections in an electronic social network. The computer system may include a processor and a memory. The computer system may additionally include a program comprising a plurality of instructions stored in memory that are executed by the processor to identify one user's connections with other users in an electronic social network, and analyze a plurality of data sources for electronic communications between the one user and the other users. The program may additionally include a plurality of instructions stored in memory that are executed by the processor to calculate for each of the other users the probability that the one user will communicate with that other user based on the analyzed plurality of data sources, and rank the one user's connections with the other users based on the calculated probabilities.

Abstract: Methods may rank one user's connections in an electronic social network. The method may include identifying, by electronic apparatus, one user's connections with other users in an electronic social network. The method may additionally include analyzing, by electronic apparatus, a plurality of data sources for electronic communications between the one user and the other users. The method may further include calculating, by electronic apparatus, for each of the other users the probability that the one user will communicate with that other user based on the analyzed plurality of data sources. The method may additionally include ranking, by electronic apparatus, the one user's connections with the other users based on the calculated probabilities. In some embodiments, the method may include removing from a graph, by electronic apparatus, one or more of the one user's connections with the other users based on the ranked one user's connections.

Abstract: A system, method and product for distribution-based incentives relating to resource consumption. The system comprising: a receiver configured to obtain from one or more monitoring devices monitoring information relating to resource consumption by a consumer over a space, wherein the space is partitioned into slots, wherein based on the monitoring information a consumption tuple of a consumer can be determined; a distribution obtaining module for obtaining a predetermined distribution of consumption of the resource, which is associated with the consumer; and a price computation module configured to compute a price of consumption by the consumer based on the consumption tuple, wherein the price is computed using a pricing function which is based on the predetermined distribution, whereby a price associated with resource consumption in a slot depends upon resource consumption in other slots.

Abstract: Methods and arrangements for establishing financial transfer limits. A customer reputation score for mobile money transfer is determined. A mobile money transfer limit is established based on the customer reputation score, and the customer reputation score is updated in response to predetermined parameters.

Abstract: Methods and arrangements for establishing financial transfer limits. A customer reputation score for mobile money transfer is determined. A mobile money transfer limit is established based on the customer reputation score, and the customer reputation score is updated in response to predetermined parameters.

Abstract: Methods and arrangements for conducting a search using query logs. A query log is consulted and query rewrite rules are learned automatically based on data in the query log. The learning includes obtaining click-through data present in the query log.

Abstract: Methods and arrangements for conducting a search using query logs. A query log is consulted and query rewrite rules are learned automatically based on data in the query log. The learning includes obtaining click-through data present in the query log.

Abstract: A method, an apparatus and an article of manufacture for detecting a fraudulent mobile money transaction. The method includes determining a reputation score for at least one customer based on historical data, determining multiple patterns related to fraudulent mobile money transaction activities by using the reputation score and the historical data, automatically detecting at least one of the patterns in mobile money transactions incoming from at least one other customer, and classifying the at least one detected pattern as a fraudulent mobile money transaction or a genuine mobile money transaction.

Abstract: Techniques for scheduling one or more services are provided. The techniques include obtaining customer information, obtaining one or more service characteristics for each of the one or more services, and using the customer information and the one or more service characteristics to schedule the one or more services.

Abstract: The present invention provides methods and systems for use in association with an online advertising auction. Advertiser bid information may be obtained, including a maximum amount per impression and a target click through rate (“CTR”). Following serving, if a delivered CTR is equal to or greater than the target CTR, then pricing per impression is at the maximum amount. If, however, the delivered CTR is less than the target CTR, then pricing per impression is at an amount equal to the maximum amount per impression multiplied by the ratio of the delivered CTR to the target CTR.

Abstract: Systems and methods of marketing to mobile devices are provided. Other methods, apparatus, and computer readable media are also provided.

Abstract: Techniques for dynamically compiling a list of one or more solution documents are provided. The techniques include receiving one or more questions, forming one or more of the one or more questions into one or more lists, wherein forming one or more questions into one or more lists comprises expressing each question in a compressed manner using one or more sets of one or more keywords, receiving input from a solution database, and using the one or more lists and input from a solution database to dynamically compile a list of one or more solution documents in connection with the one or more questions.