专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明授权

US07013286B1 Generation, distribution, storage, redemption, validation and clearing of electronic coupons 失效
标题翻译：电子优惠券的生成，分发，存储，赎回，验证和清算
公开(公告)号：US07013286B1
公开(公告)日：2006-03-14
申请号：US09475217
申请日：1999-12-30
申请人： Alok Aggarwal , Rahul Garg , Parul Alok Mittal , Natwar Modani
发明人： Alok Aggarwal , Rahul Garg , Parul Alok Mittal , Natwar Modani
IPC分类号： G06F17/60
CPC分类号： G07F17/42 , G06Q20/045 , G06Q20/387 , G06Q30/02 , G06Q30/0225
摘要： 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.
摘要翻译：方法和系统生成，分销，存储，赎回，验证和清除电子制造商优惠券和电子商店优惠券。优惠券薄荷产生不可阻挡的空白数位优惠券。报价的推动者随后将空白优惠券的条款和条件以及报价的其他细节写入定制。这些定制优惠券由促销者数字签名并分发给潜在客户。客户可以以电子方式将这些优惠券呈现给在线商店，或者打印这些优惠券并将其呈现给传统的离线商店。商店可以通过验证数字签名来检查优惠券的真实性，还可以通过联系验证中心来验证优惠券是否更早被使用。商店收集所有兑换的优惠券，并将其发送给制造商清算。验证中心验证优惠券是否可信，以前尚未使用。

2. 发明授权

US06571216B1 Differential rewards with dynamic user profiling 有权
标题翻译：差异奖励与动态用户分析
公开(公告)号：US06571216B1
公开(公告)日：2003-05-27
申请号：US09483603
申请日：2000-01-14
申请人： Rahul Garg , Parul Alok Mittal , Natwar Modani
发明人： Rahul Garg , Parul Alok Mittal , Natwar Modani
IPC分类号： G06F1760
CPC分类号： G06Q30/02 , G06Q30/0224 , G06Q30/0239
摘要： A methodology and system allows a plurality of reward scheme owners to give differential rewards, through a plurality of reward distribution agents, to various users based on the user profile. The reward scheme owner may be a seller, a manufacturer, a sales promotion agent or even an intermediary. Similarly, the reward distribution agent may be an on-line or a physical retailer, a broker, a seller or an intermediary. Also the users may be consumers, businesses, brokers or other intermediaries. In one specific case, a reward scheme owner defines a plurality of reward schemes, including at least one differential reward scheme giving different rewards to different users. The reward scheme owner communicates these to a central reward scheme database server. The reward scheme owners may or may not advertise these schemes. The user visits an online or a physical store. The store acting as a reward distribution agent dynamically profiles the user, queries the central reward scheme database server if the user profile meets the criterion for one or more rewards and offers the applicable rewards to the user. The store later receives reimbursement for the rewards offered to various users, from the reward scheme owners. This methodology and system may be used for offering targeted or differential discounts on different products and services, offering different promotional schemes on different combination of products, giving loyalty points, electronically distributing prizes, free samples, product warranties, tie-in promotions, cross selling, up selling, premiums, memberships, card discounts, organizing contests, sweepstakes, games and offering other similar rewards.
摘要翻译：一种方法和系统允许多个奖励计划所有者通过多个奖励分发代理根据用户简档给予各种用户不同的奖励。奖励计划所有者可以是卖家，制造商，促销代理或甚至中介。类似地，奖励分发代理可以是在线或实体零售商，经纪人，卖方或中介。用户也可能是消费者，企业，经纪人或其他中间商。在一个具体情况下，奖励计划所有者定义了多个奖励方案，包括给予不同用户不同奖励的至少一个差别奖赏方案。奖励计划所有者将其传达给中央奖励计划数据库服务器。奖励计划所有人可能会也可能不会宣传这些计划。用户访问在线或实体店。作为奖励分发代理的商店动态地描述用户，如果用户简档满足一个或多个奖励的标准并向用户提供适用的奖励，则查询中央奖励方案数据库服务器。该商店随后从奖励计划所有者收到向各种用户提供的奖励的报销。该方法和系统可用于为不同的产品和服务提供有针对性的或差异化的折扣，为不同的产品组合提供不同的促销方案，提供积分，电子分发奖品，免费样品，产品保证，促销活动，交叉销售，销售，保费，会员卡，卡片折扣，组织比赛，抽奖，游戏，并提供其他类似的奖励。

3. 发明授权

US07016860B2 Honoring of electronic coupons 失效
公开(公告)号：US07016860B2
公开(公告)日：2006-03-21
申请号：US09782934
申请日：2001-02-13
申请人： Natwar Modani , Parul A. Mittal , Rahul Garg , Alok Aggarwal
发明人： Natwar Modani , Parul A. Mittal , Rahul Garg , Alok Aggarwal
IPC分类号： G06F17/60
CPC分类号： G06Q20/367 , G06Q20/3674 , G06Q30/018 , G06Q30/02 , G06Q30/0222 , G06Q30/0225 , G06Q30/0239 , G06Q30/0641
摘要： 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.

4. 发明授权

US08874651B2 Federating open social networks for analyses 有权
标题翻译：联合开放的社交网络进行分析
公开(公告)号：US08874651B2
公开(公告)日：2014-10-28
申请号：US13596613
申请日：2012-08-28
申请人： Kuntal Dey , Ruta Mehta , Natwar Modani , Seema Nagar , Amit Anil Nanavati
发明人： Kuntal Dey , Ruta Mehta , Natwar Modani , Seema Nagar , Amit Anil Nanavati
IPC分类号： G06F15/16 , G06Q10/10
CPC分类号： G06Q10/10 , G06Q50/01
摘要： 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.
摘要翻译：联合社会网络建设与分析方法与安排。定义具有第一多个帐户的第一社交网络，以及具有第二多个帐户的第二社交网络，所述第二社交网络与第二社交网络无关。第一和第二社交网络被联合以确定第一和第二社交网络的联合以及第一和第二社交网络的交集，以及第一个多个帐户中的一个或多个帐户与一个或多个确定第二个多个帐户，二次连接包括在第一和第二社交网络的交叉点之外并且在第一和第二社交网络的联合之内的连接。

5. 发明授权

US08868652B2 Systems and methods for federating open social networks for analyses 有权
标题翻译：联合开放社交网络进行分析的系统和方法
公开(公告)号：US08868652B2
公开(公告)日：2014-10-21
申请号：US12944918
申请日：2010-11-12
申请人： Kuntal Dey , Ruta Mehta , Natwar Modani , Seema Nagar , Amit Anil Nanavati
发明人： Kuntal Dey , Ruta Mehta , Natwar Modani , Seema Nagar , Amit Anil Nanavati
IPC分类号： G06F15/16 , G06Q10/10
CPC分类号： G06Q10/10 , G06Q50/01
摘要： 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.
摘要翻译：联合社会网络建设与分析方法与安排。定义具有第一多个帐户的第一社交网络，以及具有第二多个帐户的第二社交网络，所述第二社交网络与第二社交网络无关。第一和第二社交网络被联合以确定第一和第二社交网络的联合以及第一和第二社交网络的交集，以及第一个多个帐户中的一个或多个帐户与一个或多个确定第二个多个帐户，二次连接包括在第一和第二社交网络的交叉点之外并且在第一和第二社交网络的联合之内的连接。

6. 发明授权

US08271320B2 Method and system for enabling unregistered users to manage electronic items across sessions 有权
标题翻译：允许未注册用户跨会话管理电子商品的方法和系统
公开(公告)号：US08271320B2
公开(公告)日：2012-09-18
申请号：US10317354
申请日：2002-12-12
申请人： Aseem Agrawal , Natwar Modani , Parul A Mittal , Rajendra Sureka
发明人： Aseem Agrawal , Natwar Modani , Parul A Mittal , Rajendra Sureka
IPC分类号： G06Q30/00
CPC分类号： G06Q30/02 , G06Q30/0222 , G06Q30/0236 , G06Q30/0601
摘要： 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.
摘要翻译：本发明提供了一种用于使电子商务网站能够在多个浏览会话中持续电子商品（例如电子优惠券，礼券等）的方法和系统。用户在浏览会话期间通过通信网络提供电子商品。如果用户希望保存用于稍后浏览会话的项目，则他/她被提示输入电子邮件地址。与所选项目相关的详细信息将与电子邮件地址进行映射。此后，将电子邮件发送给用户，其中包含一个具有嵌入其中的用户的电子邮件地址的URL。或者，对应于在会话期间选择的项目的整个细节被嵌入在URL中，并且在这种情况下，它们不需要被映射到电子邮件地址。

7. 发明授权

US08234146B2 Method and system for conducting online marketing research in a controlled manner 有权
标题翻译：以受控方式进行在线营销研究的方法和制度
公开(公告)号：US08234146B2
公开(公告)日：2012-07-31
申请号：US12043245
申请日：2008-03-06
申请人： Parul A. Mittal , Vivek Jain , Natwar Modani , Ravi Kothari , Aseem Agrawal
发明人： Parul A. Mittal , Vivek Jain , Natwar Modani , Ravi Kothari , Aseem Agrawal
IPC分类号： G06Q10/00
CPC分类号： G06Q30/02 , G06Q30/0201 , G06Q30/0203 , G06Q30/0204 , G06Q30/0219
摘要： 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.
摘要翻译：本发明描述了考虑到实验的具体预算进行在线营销研究的方法和系统。本发明描述了通过使用有效的采样和用户分组来有效地数据收集和优化利用预算的方法。

8. 发明申请

US20090112837A1 Proactive Content Dissemination to Users 审中-公开
标题翻译：主动向内容传播给用户
公开(公告)号：US20090112837A1
公开(公告)日：2009-04-30
申请号：US11923100
申请日：2007-10-24
申请人： Natwar Modani , Anupam Saronwala , Sougata Mukerjea , Gyana Ranjan Parija
发明人： Natwar Modani , Anupam Saronwala , Sougata Mukerjea , Gyana Ranjan Parija
IPC分类号： G06F17/30
CPC分类号： G06F16/35 , G06F16/951
摘要： A content repository of a system stores items of content to be disseminated to users. The content repository generates a content profile for each item of content as the item of content is received. The content profile for each item of content includes information regarding the item of content. A user repository of the system generates and stores a user profile for each user. The user profiles are generated from one or more information sources. The user profile for each user includes information regarding the user. A recommendation engine of the system determines which items of content should be delivered to each user based on the content profiles of the items of content and on the user profile of each user, to yield relevant items of content for each user. The recommendation engine then delivers the relevant items of content to each user.
摘要翻译：系统的内容存储库存储要传播给用户的内容。当收到内容项时，内容存储库生成每个内容项目的内容配置文件。每个内容项目的内容配置文件包括关于内容项目的信息。系统的用户存储库生成并存储每个用户的用户配置文件。用户简档是从一个或多个信息源生成的。每个用户的用户简档包括关于用户的信息。该系统的推荐引擎基于内容项的内容简档和每个用户的用户简档来确定哪些内容应该被传送给每个用户，以产生每个用户的相关内容项目。然后，推荐引擎将相关的内容项目传递给每个用户。

9. 发明申请

US20080154707A1 Method and System for Conducting Online Marketing Research in a Controlled Manner 有权
标题翻译：以控制方式进行在线营销研究的方法与系统
公开(公告)号：US20080154707A1
公开(公告)日：2008-06-26
申请号：US12043245
申请日：2008-03-06
申请人： Parul A. Mittal , Vivek Jain , Natwar Modani , Ravi Kothari , Aseem Agrawal
发明人： Parul A. Mittal , Vivek Jain , Natwar Modani , Ravi Kothari , Aseem Agrawal
IPC分类号： G06Q10/00
CPC分类号： G06Q30/02 , G06Q30/0201 , G06Q30/0203 , G06Q30/0204 , G06Q30/0219
摘要： 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 utilisation of budget through the use of efficient sampling and grouping of users.
摘要翻译：本发明描述了考虑到实验的具体预算进行在线营销研究的方法和系统。本发明描述了通过使用有效的采样和用户分组来有效地数据收集和优化利用预算的方法。

10. 发明申请

US20070283338A1 SYSTEM AND METHOD FOR MATCHING A PLURALITY OF ORDERED SEQUENCES WITH APPLICATIONS TO CALL STACK ANALYSIS TO IDENTIFY KNOWN SOFTWARE PROBLEMS 有权
标题翻译：用于匹配订购序列的多项式的系统和方法，用于对标识分析进行识别的已知软件问题
公开(公告)号：US20070283338A1
公开(公告)日：2007-12-06
申请号：US11422023
申请日：2006-06-02
申请人： Rajeev Gupta , Guy Maring Lohman , Tanveer Fathima Mahmood , Laurent Sebastien Mignet , Natwar Modani , Mark Francis Wilding
发明人： Rajeev Gupta , Guy Maring Lohman , Tanveer Fathima Mahmood , Laurent Sebastien Mignet , Natwar Modani , Mark Francis Wilding
IPC分类号： G06F9/45
CPC分类号： G06F11/36
摘要： 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.
摘要翻译：本发明以有序序列找到匹配，例如程序函数从异常软件程序执行调用堆栈，以发现相关或相同的软件缺陷和可能的已知解决方案。删除递归和不知情的子模式后，调用堆栈匹配。常见错误处理例程的名称，以查看它们是否由于相同的可能已知问题而生成。统计上不太可能匹配的序列从搜索中删除。序列中较早发现的匹配可以不同地加权，例如，在调用堆栈中比其他匹配更重要。序列被索引，使得与查询相关的序列自动识别，而无需详细的详尽搜索。通过基于加权序列相似性优化成本函数来找到最大匹配。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式