会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 3. 发明申请
    • PROVIDING AND MANAGING PRIVACY SCORES
    • 提供和管理隐私条款
    • US20110029566A1
    • 2011-02-03
    • US12533694
    • 2009-07-31
    • Tyrone W.A. GrandisonSherry GuoKun LiuMichael MaximilienDwayne L. RichardsonTony Sun
    • Tyrone W.A. GrandisonSherry GuoKun LiuMichael MaximilienDwayne L. RichardsonTony Sun
    • G06F17/30
    • G06Q50/01G06Q10/10
    • Methods for providing a privacy setting for a target user in a social network utilizing an electronic computing device are presented, the method including: causing the electronic computing device to retrieve a current privacy setting for a common profile item, where the common profile item corresponds with the target user and each of a number of users, and where the common profile item is one of a number of common profile items; causing the electronic computing device to calculate a common profile item sensitivity value for the common profile item based on the current privacy setting; causing the electronic computing device to calculate a common profile item visibility value for the common profile item based on the a current privacy setting and the sensitivity value for the common profile item; and causing the electronic computing device to calculate the privacy score of the target user.
    • 提出了利用电子计算设备在社交网络中为目标用户提供隐私设置的方法,所述方法包括:使得所述电子计算设备检索用于共同简档项的当前隐私设置,其中所述公用简档项与 目标用户和多个用户中的每一个,以及共同简档项是多个公共简档项中的一个; 使得所述电子计算设备基于所述当前隐私设置来计算所述公用配置文件项目的公用配置项目灵敏度值; 使得所述电子计算设备基于所述共同简档项目的当前隐私设置和灵敏度值来计算所述公用简档项目的公共简档项目可见性值; 并使电子计算设备计算目标用户的隐私分数。
    • 7. 发明授权
    • 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.
    • 个性化电子医疗管理系统及其计算机实现方法。 该系统包括被配置为接收由用户输入的与用户相关联的用户简档信息的用户界面以及与该用户接口相连接的服务器。 服务器从至少一个外部源检索保健信息,并在用户界面向用户提供检索到的保健信息。 保健信息可以根据用户的需要进行个性化。 服务器还从至少一个主机站点检索社交服务节目信息,将所检索到的社交服务节目信息提供给用户,并且在需要时使用用户简档信息应用于至少一个主机站点的至少一个社交服务节目 并且在用户界面处检索要呈现给用户的交互信息。
    • 9. 发明申请
    • 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度匿名图。 设计简单有效的算法来解决这个问题,其中这些算法基于与度数序列的可实现性相关的原理。