会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 5. 发明授权
    • Personalized electronic healthcare management
    • 个性化电子医疗管理
    • US08494872B2
    • 2013-07-23
    • US12700339
    • 2010-02-04
    • Varun BhagwanTyrone W. A. GrandisonChristan E. GrantBryan J. HickersonKun LiuEvimaria TerziTarun Thakur
    • Varun BhagwanTyrone W. A. GrandisonChristan E. GrantBryan J. HickersonKun LiuEvimaria TerziTarun Thakur
    • G06Q50/00
    • G06Q50/22G06F19/00
    • A personalized electronic healthcare management system and computer-implemented method thereof. The system includes a user interface configured to receive user profile information associated with a user as input by the user, and a server interfacing with the user interface. The server retrieves healthcare information from at least one external source, and provides the retrieved healthcare information to the user at the user interface. The healthcare information may be personalized to the user's needs. The server further retrieves social service program information from at least one host site, provides the retrieved social service program information to the user, and applies to at least one social service program of the at least one host site using the user profile information, when desired by the user, and retrieves interactive information to be presented to the user at the user interface.
    • 个性化电子医疗管理系统及其计算机实现方法。 该系统包括被配置为接收由用户输入的与用户相关联的用户简档信息的用户界面以及与该用户接口相连接的服务器。 服务器从至少一个外部源检索保健信息,并在用户界面向用户提供检索到的保健信息。 保健信息可以根据用户的需要进行个性化。 服务器还从至少一个主机站点检索社交服务节目信息,将所检索到的社交服务节目信息提供给用户,并且在需要时使用用户简档信息应用于至少一个主机站点的至少一个社交服务节目 并且在用户界面处检索要呈现给用户的交互信息。
    • 7. 发明申请
    • ALGORITHMS FOR IDENTITY ANONYMIZATION ON GRAPHS
    • 身份识别遗传算法的算法
    • US20090303237A1
    • 2009-12-10
    • US12134279
    • 2008-06-06
    • Kun LiuEvimaria Terzi
    • Kun LiuEvimaria Terzi
    • G06T11/20
    • H04L63/0414
    • The proliferation of network data in various application domains has raised privacy concerns for the individuals involved. Recent studies show that simply removing the identities of the nodes before publishing the graph/social network data does not guarantee privacy. The structure of the graph itself, and in is basic form the degree of the nodes, can be revealing the identities of individuals. To address this issue, a specific graph-anonymization framework is proposed. A graph is called k-degree anonymous if for every node v, there exist at least k−1 other nodes in the graph with the same degree as v. This definition of anonymity prevents the re-identification of individuals by adversaries with a priori knowledge of the degree of certain nodes. Given a graph G, the proposed graph-anonymization problem asks for the k-degree anonymous graph that stems from G with the minimum number of graph-modification operations. Simple and efficient algorithms are devised for solving this problem, wherein these algorithms are based on principles related to the realizability of degree sequences.
    • 网络数据在各种应用领域的激增已经引起了个人的隐私问题。 最近的研究表明,在发布图形/社交网络数据之前,简单地删除节点的身份不能保证隐私。 图形本身的结构,并且是基本形成节点的程度,可以揭示个体的身份。 为了解决这个问题,提出了一个特定的图形匿名框架。 一个图被称为k度匿名,如果对于每个节点v,图中至少存在k-1个其他节点与v相同的程度。匿名的定义防止具有先验知识的对手重新识别个体 的某些节点的程度。 给定图G,所提出的图形匿名化问题要求由具有最小数目的图形修改操作的G产生的k度匿名图。 设计简单有效的算法来解决这个问题,其中这些算法基于与度数序列的可实现性相关的原理。
    • 8. 发明授权
    • Constructing a comprehensive summary of an event sequence
    • 构建事件序列的综合摘要
    • US08027949B2
    • 2011-09-27
    • US12174407
    • 2008-07-16
    • Gerald G. KiernanEvimaria Terzi
    • Gerald G. KiernanEvimaria Terzi
    • G06F17/00G06F11/00G06N7/00G06N7/08
    • G06Q10/10
    • The present invention provides a method and system for constructing one or more a comprehensive summaries of event sequence(s). The present invention approaches the problem of finding the shortest yet most comprehensive summary of an event sequence by transforming this summarization problem into a concrete optimization problem and provides a computer-implementing technique for solving this optimization problem to construct and/or form the basis for constructing the summaries. The summaries describe an entire event sequence while at the same time reveal local associations between events of that sequence. In certain embodiments, the segmentation of the event sequence produced in accordance with the present invention is itself a summary of the event sequence. In other embodiments, the segmentation produced forms a basis for one or more summaries.
    • 本发明提供一种用于构建一个或多个事件序列的综合概要的方法和系统。 本发明通过将该汇总问题转化为具体的优化问题来解决事件序列最短但最全面的概述的问题,并提供了一种用于解决这一优化问题的计算机实现技术,以构建和/或形成构建基础 总结。 总结描述整个事件序列,同时显示该序列事件之间的局部关联。 在某些实施例中,根据本发明产生的事件序列的分段本身是事件序列的概要。 在其他实施例中,产生的分割形成一个或多个摘要的基础。
    • 10. 发明申请
    • DETERMINING COMPREHENSIVE SUBSETS OF REVIEWS
    • 确定综合综合评估报告
    • US20130060760A1
    • 2013-03-07
    • US13224350
    • 2011-09-02
    • Panayiotis TsaparasAlexandros NtoulasEvimaria Terzi
    • Panayiotis TsaparasAlexandros NtoulasEvimaria Terzi
    • G06F17/30
    • G06F16/355
    • Techniques are provided for selecting a limited but comprehensive set of high-quality users reviews covering several different aspects or attributes of a reviewed item. For several implementations, selection methodologies approach the challenge as a maximum coverage problem and provide a generic formalism to model the different variants of the review-set selection. Variations to such implementation may also employ different algorithms in consideration of different variants and weightings of those variants. Select implementations employ methodologies that collectively consider attributes of the item discussed in the reviews, the quality of the reviews themselves, and the viewpoint of the reviews (e.g., positive or negative) as input values in order to provide outputs that cover as many attributes of the item as possible, comprising high quality reviews representing different viewpoints.
    • 提供技术用于选择覆盖所审查项目的几个不同方面或属性的有限但全面的高质量用户评论。 对于多个实施方案,选择方法将挑战视为最大覆盖问题,并提供通用的形式主义以对审查集选择的不同变体进行建模。 考虑到这些变型的不同变体和权重,这种实现的变化也可以采用不同的算法。 选择实施采用集体考虑审查中讨论的项目的属性,评论本身的质量以及评论的观点(例如,正或负))作为输入值的方法,以提供涵盖尽可能多的属性的输出 该项目可能包括代表不同观点的高质量评论。