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

1. 发明授权

US07895196B2 Computer system for identifying storylines that emerge from highly ranked web search results 失效
标题翻译：用于识别从高排名网页搜索结果中出现的故事情节的计算机系统
公开(公告)号：US07895196B2
公开(公告)日：2011-02-22
申请号：US10835983
申请日：2004-04-30
申请人： Uma Mahadevan , Shanmugasundaram Ravikumar , Dandapani Sivakumar
发明人： Uma Mahadevan , Shanmugasundaram Ravikumar , Dandapani Sivakumar
IPC分类号： G06F17/30
CPC分类号： G06F17/30864
摘要： This disclosure provides a method of and service for searching for locations (e.g., web sites) on a network (e.g., the internet). The method begins by inputting a query from a user and searching the internet based on the query to produce search results (comprising web sites) in an order of relevance, where more relevant results are ordered ahead of less relevant results. However, rather than directly reporting the search results to the user as conventional search methodologies do, the invention reorganizes the search results into storylines. More specifically, the invention identifies focused vocabularies from the search results, where each focused vocabulary forms a separate storyline. In addition, the invention maximizes the number of search results that are included in each storyline, minimizes the number of search results that are included in multiple storylines; and also minimizes the number of storylines. Then the invention reports the storylines to the user.
摘要翻译：本公开提供了用于搜索网络（例如，互联网）上的位置（例如，网站）的方法和服务。该方法通过从用户输入查询并基于查询搜索互联网，以相关性的顺序产生搜索结果（包括网站），其中在相关结果较少的情况下排序更相关的结果。然而，传统的搜索方法不是将搜索结果直接报告给用户，而是将搜索结果重新组织成故事情节。更具体地，本发明从搜索结果中识别重点词汇，其中每个聚焦词汇形成单独的故事情节。此外，本发明使包含在每个故事情节中的搜索结果的数量最大化，使包含在多个故事情节中的搜索结果的数量最小化; 并最大程度地减少故事情节的数量。然后，本发明向用户报告故事情节。

2. 发明申请

US20050246321A1 System for identifying storylines that emegre from highly ranked web search results 失效
标题翻译：用于识别从高排名网页搜索结果中发现的故事情节的系统
公开(公告)号：US20050246321A1
公开(公告)日：2005-11-03
申请号：US10835983
申请日：2004-04-30
申请人： Uma Mahadevan , Shanmugasundaram Ravikumar , Dandapani Sivakumar
发明人： Uma Mahadevan , Shanmugasundaram Ravikumar , Dandapani Sivakumar
IPC分类号： G06F7/00 , G06F17/30
CPC分类号： G06F17/30864
摘要： This disclosure provides a method of and service for searching for locations (e.g., web sites) on a network (e.g., the internet). The method begins by inputting a query from a user and searching the internet based on the query to produce search results (comprising web sites) in an order of relevance, where more relevant results are ordered ahead of less relevant results. However, rather than directly reporting the search results to the user as conventional search methodologies do, the invention reorganizes the search results into storylines. More specifically, the invention identifies focused vocabularies from the search results, where each focused vocabulary forms a separate storyline. In addition, the invention maximizes the number of search results that are included in each storyline, minimizes the number of search results that are included in multiple storylines; and also minimizes the number of storylines. Then the invention reports the storylines to the user.
摘要翻译：本公开提供了用于搜索网络（例如，互联网）上的位置（例如，网站）的方法和服务。该方法通过从用户输入查询并基于查询搜索互联网，以相关性的顺序产生搜索结果（包括网站），其中在相关结果较少的情况下排序更相关的结果。然而，传统的搜索方法不是将搜索结果直接报告给用户，而是将搜索结果重新组织成故事情节。更具体地，本发明从搜索结果中识别重点词汇，其中每个聚焦词汇形成单独的故事情节。此外，本发明使包含在每个故事情节中的搜索结果的数量最大化，使包含在多个故事情节中的搜索结果的数量最小化; 并最大程度地减少故事情节的数量。然后，本发明向用户报告故事情节。

3. 发明授权

US09002725B1 System and method for targeting information based on message content 有权
标题翻译：基于消息内容定位信息的系统和方法
公开(公告)号：US09002725B1
公开(公告)日：2015-04-07
申请号：US11215543
申请日：2005-08-29
申请人： Alexander Paul Carobus , Niniane Wang , Jared Jacobs , Keith Coleman , Uma Mahadevan
发明人： Alexander Paul Carobus , Niniane Wang , Jared Jacobs , Keith Coleman , Uma Mahadevan
IPC分类号： G06Q30/02
CPC分类号： G06Q30/0256 , G06Q10/107 , G06Q30/0241 , G06Q30/0251 , G06Q30/0253 , G06Q30/0255 , G06Q30/0269
摘要： A method of serving an electronic document in response to a client request includes identifying an electronic document requested by a client. At least one information entity matching at least one predetermined information entity type is extracted from the electronic document. One or more links are then generated for each extracted information entity and are served to the requesting client in connection with other information corresponding to the at least one information entity and the electronic document. In some embodiments the electronic document is an email message, SMS message, transcribed voice message, or a combination of such messages. In some embodiments the extracted information entity is a physical address, an email address, a phone number, an object identification number, a product name, a company name, a stock symbol, a movie title, a book title, a calendar entry, an individual's name, a city name, a URL, or event information.
摘要翻译：响应于客户端请求服务于电子文档的方法包括识别客户请求的电子文档。从电子文档提取至少一个与至少一个预定信息实体类型相匹配的信息实体。然后针对每个提取的信息实体生成一个或多个链接，并且将其与与至少一个信息实体和电子文档相对应的其他信息提供给请求客户端。在一些实施例中，电子文档是电子邮件消息，SMS消息，转录语音消息或这种消息的组合。在一些实施例中，所提取的信息实体是物理地址，电子邮件地址，电话号码，对象标识号，商品名称，公司名称，股票符号，电影标题，书名称，日历条目，个人姓名，城市名称，URL或事件信息。

4. 发明申请

US20210073877A1 SYSTEM AND METHOD TO SIMPLIFY MEDICAL BILLING FOR HOSPITALISTS 有权
公开(公告)号：US20210073877A1
公开(公告)日：2021-03-11
申请号：US16567168
申请日：2019-09-11
申请人： Uma Mahadevan
发明人： Uma Mahadevan
IPC分类号： G06Q30/04 , G06Q10/10 , G16H10/60 , G16H40/20
摘要： A method for automated medical billing includes retrieving details of one or more encounters between a patient and a medical provider from a hospital software. A user input is obtained via a user interface on a medical provider computing device, wherein the user interface enables the medical provider to initiate automated billing of the patient after each encounter. Thereafter, a geo-location of the medical provider, a micro-location of the patient in hospital, a time associated with an encounter, and an identity of the patient and the medical provider are automatically sensed, and a bed number of the patient, a current time, a geo-location, an identification number of the medical provider, and a charge associated with the encounter is sent to the billing server. Finally, a claim form is automatically filled by the billing server, based on the received information; and the filled claim form is transmitted to a payment entity.

5. 外观设计

USD856352S1 Display screen with a graphical user interface 有权
公开(公告)号：USD856352S1
公开(公告)日：2019-08-13
申请号：US29609779
申请日：2017-07-05
申请人： Uma Mahadevan , Gnani Palanikumar
设计人： Uma Mahadevan , Gnani Palanikumar
摘要： FIG. 1 is a front view of an embodiment of a display screen with a graphical user interface, showing our new design;
FIG. 2 is a front view of a second embodiment thereof; and,
FIG. 3 is a front view of a third embodiment thereof.
The display and subject matter shown in broken lines, including all text, forms no part of the claimed design. The broken line text showing in FIGS. 1-3 is for illustrative purposes only and forms no part of the claimed design. The outermost broken line perimeter shown in FIGS. 1-3 is included for the purpose of showing a portion of a display screen and forms no part of the claimed design.

6. 发明授权

US11288718B2 System and method to simplify medical billing for hospitalists 有权
公开(公告)号：US11288718B2
公开(公告)日：2022-03-29
申请号：US16567168
申请日：2019-09-11
申请人： Uma Mahadevan
发明人： Uma Mahadevan
IPC分类号： G06Q30/04 , G06Q10/10 , G16H40/20 , G16H10/60 , G16H15/00 , G06Q40/08
摘要： A method for automated medical billing includes retrieving details of one or more encounters between a patient and a medical provider from a hospital software. A user input is obtained via a user interface on a medical provider computing device, wherein the user interface enables the medical provider to initiate automated billing of the patient after each encounter. Thereafter, a geo-location of the medical provider, a micro-location of the patient in hospital, a time associated with an encounter, and an identity of the patient and the medical provider are automatically sensed, and a bed number of the patient, a current time, a geo-location, an identification number of the medical provider, and a charge associated with the encounter is sent to the billing server. Finally, a claim form is automatically filled by the billing server, based on the received information; and the filled claim form is transmitted to a payment entity.

7. 发明授权

US08601004B1 System and method for targeting information items based on popularities of the information items 有权
标题翻译：基于信息项的流行度定位信息项的系统和方法
公开(公告)号：US08601004B1
公开(公告)日：2013-12-03
申请号：US11295748
申请日：2005-12-06
申请人： Uma Mahadevan , Jacob Samuels Burnim
发明人： Uma Mahadevan , Jacob Samuels Burnim
IPC分类号： G06F17/30
CPC分类号： G06Q30/0261
摘要： A method of selecting information items in connection with an electronic message includes selecting a plurality of information items satisfying a predefined popularity condition and identifying any one from the selected information items whose associated keyword is found in the electronic message. A set of candidate items are selected periodically based on their respective popularity metrics. The popularity metric of an information item may be its click-through rate during a predefined time period. Each candidate information item has one or more keywords and the number of the keywords found in the electronic message determines the item's relevancy to a user accessing the message. In some embodiments, the method selects a subset of the information items using user geographical information associated with a user accessing the electronic message from a client and at least one of the selected information items is set to target users at a location corresponding to the user geographical information.
摘要翻译：选择与电子消息相关的信息项的方法包括：从所选择的信息项中选择满足预定流行度条件的多个信息项，并从所选择的信息项中识别出相关联的关键字在电子消息中。基于它们各自的流行度量度周期性地选择一组候选项目。信息项目的流行度量可以是在预定时间段内的点击率。每个候选信息项具有一个或多个关键词，并且在电子消息中发现的关键字的数量确定该项与访问消息的用户的相关性。在一些实施例中，该方法使用与从客户端接入电子消息的用户相关联的用户地理信息来选择信息项的子集，并且所选择的信息项中的至少一个被设置为在与用户地理对应的位置处的目标用户信息。

8. 发明授权

US08515968B1 Tie breaking rules for content item matching 有权
公开(公告)号：US08515968B1
公开(公告)日：2013-08-20
申请号：US13208540
申请日：2011-08-12
申请人： Roberto J. Bayardo , Uma Mahadevan , Giao Nguyen , Shivakumar Venkataraman , Adam I. Juda
发明人： Roberto J. Bayardo , Uma Mahadevan , Giao Nguyen , Shivakumar Venkataraman , Adam I. Juda
IPC分类号： G06F7/00 , G06F17/30 , G06Q30/00
CPC分类号： G06Q30/0256 , G06F17/3053 , G06F17/30663 , G06F17/30684 , G06F17/30864 , G06F17/602 , G06Q30/00 , G06Q30/0273
摘要： Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for selecting controlling keywords. In one aspect, a method includes determining that two or more targeting keywords for a same content item source are matched by one or more terms in a content item request, where a first targeting keyword matches the one or more terms with a more specific type of match than the second targeting keyword. If the bid associated with the second targeting keyword does not exceed the bid associated with the first targeting keyword, the first targeting keyword and the second targeting keyword are ranked based on selection scores. The targeting keywords are ranked based at least in part on the quality scores when the bid associated with the second targeting keyword does exceed the bid associated with the first targeting keyword.

9. 发明授权

US5797013A Intelligent loop unrolling 失效
标题翻译：智能循环展开
公开(公告)号：US5797013A
公开(公告)日：1998-08-18
申请号：US564514
申请日：1995-11-29
申请人： Uma Mahadevan , Lacky Shah
发明人： Uma Mahadevan , Lacky Shah
IPC分类号： G06F9/45
CPC分类号： G06F8/443
摘要： A compiler facilitates efficient unrolling of loops and enables the elimination of extra branches from the loops, including the elimination of conditional branches from unrolled loops with early exits. Unrolling also enhances other optimizations, such as prefetch, scalar replacement, and instruction scheduling. The unroll factor is calculated to determine the amount of loop expansion and the optimum location to place compensation code to complete the original loop count, i.e. before or after the unrolled loop. The compiler is applicable, for example, to modern RISC architectures, where the latency of memory references and branches is higher than that of integer and floating point arithmetic instructions.
摘要翻译：编译器有助于循环的有效展开，并能够从循环中消除额外的分支，包括从早期退出的非滚动循环中消除条件分支。展开还可以增强其他优化，如预取，标量替换和指令调度。计算展开因子以确定循环展开量和放置补偿代码以完成原始循环计数的最佳位置，即在展开循环之前或之后。编译器适用于例如现代RISC架构，其中存储器引用和分支的延迟高于整数和浮点运算指令的延迟。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式