International Business Machines Corporation

Nuance Communications, Inc.

Natwar Modani

Parul Alok Mittal

Amit Anil Nanavati

Kuntal Dey

Seema Nagar

Ravi Kothari

Rahul Garg

Alok Aggarwal

Aseem Agrawal

Rajeev Gupta

Vivek Jain

Ruta Mehta

Subramanya Kabbinahithlu Narayana Prasad

Manish Satyapal Gupta

Guy Maring Lohman

Manoj N Kumar

Nitendra Rajput

Biplav Srivastava

Arun Kumar

Krishna Kummamuru

Mark Francis Wilding

Anupam Jain

Rema Ananthanarayanan

Laurent Sebastien Mignet

Vipul Bansal

Tanveer Fathima Mahmood

Rajendra Sureka

Zheng Zhu

Sreerama K Murthy

Satuloori Sridhar

Rema Ananthanaratanan

Atrayee Roychowdhury

Parul A Mittal

Techniques for assigning a spoken tag in a telecom web platform are provided. The techniques include receiving a spoken tag, comparing the spoken tag to a set of one or more template tags, if the spoken tag is a match to a template tag, assigning the spoken tag and updating frequency of the tag in the set of one or more template tags, and if the spoken tag is not a match to a template tag, assigning the spoken tag and registering the spoken tag as a new tag in the set of one or more template tags.

Spoken tags for telecom web platforms in a social network

Methods and arrangements for constructing and analyzing federated social networks. A first social network with a first plurality of accounts is defined, as well as a second social network with a second plurality of accounts, the second social network being unaffiliated with the second social network. The first and second social networks are federated to determine a union of the first and second social networks and an intersection of the first and second social networks, and second-order connections between one or more of the first plurality of accounts and one or more of the second plurality of accounts are ascertained, the second-order connections including connections outside of the intersection of the first and second social networks and within the union of the first and second social networks.

Federating open social networks for analyses

Systems and methods for federating open social networks for analyses

Techniques for enumerating at least one maximal clique are provided. The techniques include obtaining data, wherein the data comprises a graph, obtaining a user-specified minimum size restriction on at least one maximal clique of interest, filtering the data using the user-specified minimum size restriction to reduce graph size, and enumerating at least one maximal clique from the graph provided that at least one maximal clique exists above the user-specified minimum size restriction.

Method for enumerating cliques

A monitoring method and system. The method retrieving by a computer, first data associated with a marketing plan associated with social networks and second data associated with marketing plan objectives. The computer processor identifies social network effects associated with the marketing plan objectives, business key performance indicators (KPIs) associated with the marketing plan objectives, and social network KPIs associated with the associated social network effects. The computer processor represents a marketing plan measurement model comprising a mathematical relationship between the business KPIs and the social network KPIs. The computer processor monitors changes associated with the business KPIs and the social network KPIs and generates and stores a report indicating the changes.

Social network marketing plan monitoring method and system

A comparison method and system including retrieving by a computer, first data associated with first interactions between users associated with social networks. The computing system generates a first graph illustrating the first interactions. The computing system identifies targeted users associated with a marketing plan for the users. The computing system enables the marketing plan and retrieves second data associated with second interactions between the users. The computing system generates a second graph illustrating the second interactions, compares the second graph to the first graph, and generates a third graph illustrating first order differences between the first interactions and the second interactions.

Social network marketing plan comparison method and system

The present invention provides a method and system for enabling an e-commerce website to persist electronic items, such as electronic coupons, gift certificates etc., across multiple browsing sessions. Users are offered electronic items over a communications network during a browsing session. In case the user wishes to save the items for a later browsing session, he/she is prompted for an email address. Details pertaining to the selected items are mapped against the email address. Thereafter, e-mail is sent to the user, containing a URL with the email address of the user embedded in it. Alternatively, entire details corresponding to the items selected during a session are embedded in the URL and in this case they need not be mapped against the email address.

Method and system for enabling unregistered users to manage electronic items across sessions

The invention describes a method and system for conducting online marketing research keeping in consideration the specified budget for the experiment. The invention describes a methodology for effective data collection and optimised utilization of budget through the use of efficient sampling and grouping of users.

Method and system for conducting online marketing research in a controlled manner

The invention finds matches in ordered sequences, e.g. program function call stacks from anomalous software program executions for discovering related or identical software flaws and possible known solutions. Call stacks are matched after removing recursive and uninformative subpatterns, e.g. names of common error handling routines, to see if they were generated due to the same possibly known problem. Sequences statistically unlikely to be matches are pruned from the search. Matches found earlier in the sequences may be weighted differently, e.g. to be more important in call stacks, than other matches. Sequences are indexed so that those relevant to a query are identified automatically without detailed exhaustive search. Maximum matches are found by optimizing a cost function based on weighted sequence similarity.

System and method for matching a plurality of ordered sequences with applications to call stack analysis to identify known software problems

Selecting one or more marketing messages for optimal display at marketing locations in a marketing environment is performed on the basis of information relating to a user to whom the messages are to be displayed, the marketing messages, and the marketing locations. Dynamic selection and display of marketing messages in this manner can be advantageously performed for online environments for which relevant information is readily accessed and used as a basis for selection and display of marketing messages.

Targeted online marketing

A method for identifying names of uninformative functions in call-stack traces is described. The method comprises the steps of obtaining a set of call-stacks and information indicative of which call-stack traces in the set match a particular call-stack trace; for each matching call-stack trace pair, incrementing a false negative counter for each function name above a first matching function name in a respective call-stack trace pair; for each non-matching call-stack trace pair, incrementing a false positive counter for each function name above a first non-matching function name in a respective call-stack pair; incrementing a frequency counter for each function name appearing in each of the call-stack traces; calculating an aggregate value for each of the function names as a function of respective ones of the false positive counter, the false negative counter and the frequency counter; and identifying uninformative ones of the function names based on the respective aggregate values. The method may be used to diagnose software problems based on known software problems and is useful in helpdesk and autonomic computing applications. A system and a computer program product for performing the method are also described.

Identification of uninformative function names in call-stack traces

A system and method determine the possibility of adverse effect arising from a code change in a computer program. The system and method comprise the steps of identifying important classes within a computer program and determining directly and indirectly dependent classes of the important classes. The important classes comprise superclasses of the directly and indirectly dependent classes. The method associates test cases with the important classes and with the directly and indirectly dependent classes. Additionally, for a given code change to first important class, the method runs all test cases associated with the first important class and associated with dependent classes of the first important class, and indicates the possibility of an adverse effect if any run test case fails.

System and method for determining the possibility of adverse effect arising from a code change in a computer program

An electronic coupon, an electronic commerce system, and a method for the honoring of electronic coupons utilizing computing equipment are disclosed. In the method, an issuing party issues an electronic coupon to a customer. The customer presents the coupon for redemption to a redemption party. The redemption party transmits the coupon to an authentication party for authentication. If authentic, the authentication party charges the redemption party a fee and passes that fee to the issuing party. The redemption party honors the coupon for the customer and seeking reimbursement of the fee from the issuing party. The electronic coupon has a plurality of data fields, including: a coupon identifier, x, a first one-way hash function field, f(x), and a secure signature field.

Honoring of electronic coupons

A method and system generates, distributes, stores, redeems, validates and clears electronic manufacturer coupons and electronic store coupons. A coupon mint generates unforgable blank digital coupons. The promoter of the offer then writes the terms and conditions and other details of the offer, on blank coupons to customize these. These customized coupons are digitally signed by the promoter and distributed to potential customers. A customer may either present these coupons electronically for redemption to an online store, or print these coupons and present them to a conventional offline store. The store may check the authenticity of a coupon by verifying the digital signature and also verifying if the coupon has not been used earlier by contacting a verification center. The store collects all redeemed coupons and sends these to manufacturer for clearing. The verification center verifies that the coupon is authentic and has not already been used before.

Growing community of inventors

New Delhi, India

Natwar Modani