公开(公告)号：US09171311B2

公开(公告)日：2015-10-27

申请号：US12872950

申请日：2010-08-31

申请人： Ehr-Chun Yeh ,  Sijian Zhang ,  Shaoyu Zhou ,  Lei Jin ,  Fei Cao

发明人： Ehr-Chun Yeh ,  Sijian Zhang ,  Shaoyu Zhou ,  Lei Jin ,  Fei Cao

IPC分类号： G06Q30/00 ,  G06Q30/02

CPC分类号： G06Q30/02 ,  G06Q30/0241 ,  G06Q30/0251 ,  G06Q30/0255 ,  G06Q30/0269

摘要： Systems, methods, and computer storage media having computer-executable instructions embodied thereon that maintain a targetable user inventory for digital advertising. In embodiments, a request is made for user data associated with a user identification. If the user data or user identification is not available, a list of alternative user identifications is ranked according to various criteria based on identification signals. A match is selected from the list of alternative user identifications and user data associated with the alternative user identification is communicated in response to the request.

摘要翻译： 系统，方法和计算机存储介质具有在其上体现的计算机可执行指令，其维护用于数字广告的可定位的用户库存。 在实施例中，对与用户标识相关联的用户数据进行请求。 如果用户数据或用户标识不可用，则可以根据识别信号根据各种标准来排列替代用户标识的列表。 从替代用户标识的列表中选择匹配，并且响应于该请求传送与替代用户标识相关联的用户数据。

公开(公告)号：US08572239B2

公开(公告)日：2013-10-29

申请号：US12885897

申请日：2010-09-20

申请人： Fei Cao ,  Shaoyu Zhou ,  Zhuoqing Wu, Jr. ,  Sijian Zhang ,  Siddhartha Roy ,  Michael A. Elizarov

发明人： Fei Cao ,  Shaoyu Zhou ,  Zhuoqing Wu, Jr. ,  Sijian Zhang ,  Siddhartha Roy ,  Michael A. Elizarov

IPC分类号： G06F15/177 ,  G06F15/16

CPC分类号： G06Q30/02 ,  G06Q30/0201

摘要： Large sets of unorganized data may provide little value in identifying useful observations from such data. For example, an online merchant may maintain a database of millions of user IDs (e.g., a cookie ID, a login ID, a device ID, a network ID, etc.) along with content viewed and/or actions taken with the user IDs, where minimal associations are known between user IDs. It may be advantageous to link together user IDs of respective users to capture a comprehensive view of respective users' activities. Accordingly, one or more systems and/or techniques for identifying a cluster of nodes based upon transforming a set of node pairings (e.g., pairings of related nodes) one or more times are disclosed herein. Iterative transformations may be performed until respective nodes are paired with merely their smallest neighboring node and are paired with no other node. In this way, node clusters may be identifiable.

摘要翻译： 大量无组织数据可能无法从这些数据中识别有用的观察结果。 例如，在线商家可以维护数百万用户ID的数据库（例如，Cookie ID，登录ID，设备ID，网络ID等）以及与用户ID一起观看的内容和/或所采取的动作 其中用户ID之间的最小关联是已知的。 链接各个用户的用户ID可能是有利的，以捕获各个用户的活动的综合视图。 因此，本文公开了一种或多种用于基于将一组节点配对（例如，相关节点的配对）一次或多次来识别节点簇的一个或多个系统和/或技术。 可以执行迭代变换，直到各个节点仅与其最小的相邻节点配对并且与没有其他节点配对。 以这种方式，节点集群可以是可识别的。

公开(公告)号：US08839384B2

公开(公告)日：2014-09-16

申请号：US12873394

申请日：2010-09-01

申请人： Siddhartha Roy ,  Sijian Zhang ,  Michael Elizarov ,  Shaoyu Zhou ,  Fei Cao

发明人： Siddhartha Roy ,  Sijian Zhang ,  Michael Elizarov ,  Shaoyu Zhou ,  Fei Cao

IPC分类号： G06F7/04 ,  G06F21/62 ,  G06F21/60 ,  H04L29/06

CPC分类号： G06F21/6245 ,  G06F21/604 ,  G06F21/6209 ,  H04L63/102

摘要： Methods and systems for maintaining user privacy preferences based on one or more user identifications across a plurality of applications are provided. Two or more user identifications are received with associated user privacy preferences. The received user identification is compared against other user identifications to determine if the user identifications relate to the same user. It may be determined that two user identifications are related if they have at least one browser property in common. A consolidated data stream of the user privacy preferences for the related user identifications is created. The consolidated data stream is communicated to one or more applications and propagated to maintain the user privacy preferences across the applications relating to the user identification.

摘要翻译： 提供了用于基于多个应用程序中的一个或多个用户标识来维护用户隐私偏好的方法和系统。 接收到具有相关联的用户隐私偏好的两个或多个用户标识。 将接收的用户标识与其他用户标识进行比较，以确定用户标识是否与同一用户相关。 如果它们具有至少一个共同的浏览器属性，则可以确定两个用户标识相关。 创建用于相关用户标识的用户隐私偏好的统一数据流。 整合的数据流被传送到一个或多个应用，并被传播以保持与用户标识有关的应用的用户隐私偏好。

公开(公告)号：US20120072554A1

公开(公告)日：2012-03-22

申请号：US12885897

申请日：2010-09-20

申请人： Fei Cao ,  Shaoyu Zhou ,  Zhuoqing Wu ,  Sijian Zhang ,  Siddhartha Roy ,  Michael A. Elizarov

发明人： Fei Cao ,  Shaoyu Zhou ,  Zhuoqing Wu ,  Sijian Zhang ,  Siddhartha Roy ,  Michael A. Elizarov

IPC分类号： G06F15/177 ,  G06F15/16

CPC分类号： G06Q30/02 ,  G06Q30/0201

摘要： Large sets of unorganized data may provide little value in identifying useful observations from such data. For example, an online merchant may maintain a database of millions of user IDs (e.g., a cookie ID, a login ID, a device ID, a network ID, etc.) along with content viewed and/or actions taken with the user IDs, where minimal associations are known between user IDs. It may be advantageous to link together user IDs of respective users to capture a comprehensive view of respective users' activities. Accordingly, one or more systems and/or techniques for identifying a cluster of nodes based upon transforming a set of node pairings (e.g., pairings of related nodes) one or more times are disclosed herein. Iterative transformations may be performed until respective nodes are paired with merely their smallest neighboring node and are paired with no other node. In this way, node clusters may be identifiable.

摘要翻译： 大量无组织数据可能无法从这些数据中识别有用的观察结果。 例如，在线商家可以维护数百万用户ID的数据库（例如，Cookie ID，登录ID，设备ID，网络ID等）以及与用户ID一起观看的内容和/或所采取的动作 其中用户ID之间的最小关联是已知的。 链接各个用户的用户ID可能是有利的，以捕获各个用户的活动的综合视图。 因此，本文公开了一种或多种用于基于将一组节点配对（例如，相关节点的配对）一次或多次来识别节点簇的一个或多个系统和/或技术。 可以执行迭代变换，直到各个节点仅与其最小的相邻节点配对并且与没有其他节点配对。 以这种方式，节点集群可以是可识别的。

公开(公告)号：US08843394B2

公开(公告)日：2014-09-23

申请号：US12818349

申请日：2010-06-18

申请人： Fei Cao ,  Shaoyu Zhou ,  Siddhartha Roy ,  Michael Elizarov ,  Zhuoqing Wu ,  James Zhang

发明人： Fei Cao ,  Shaoyu Zhou ,  Siddhartha Roy ,  Michael Elizarov ,  Zhuoqing Wu ,  James Zhang

IPC分类号： G06Q30/00 ,  G06Q30/02

CPC分类号： G06Q30/02 ,  G06Q30/0241 ,  G06Q30/0244 ,  G06Q30/0255

摘要： Systems and methods for mapping identifiers are provided. Activity logs illustrate activities and/or events associated with a plurality of identifiers. The identifiers may be registered identifiers, unregistered identifiers, or a combination thereof. When at least two identifiers share a linking attribute, the at least two identifiers may be mapped to one another, along with information associated therewith (if any) such as a user profile. Each subsequent line of an activity line may also be mapped to the identifiers of the initial single line when a linking attribute or an overlapping identifier is present. A number of identifiers associated with each other may be increased by mapping identifiers and, thus, a targeted audience for a customized advertisement may, in turn, be increased.

摘要翻译： 提供了映射标识符的系统和方法。 活动日志示出与多个标识符相关联的活动和/或事件。 标识符可以是注册标识符，未注册标识符或其组合。 当至少两个标识符共享链接属性时，可以将至少两个标识符与其相关联的信息（如果有的话）诸如用户简档映射到彼此。 当存在链接属性或重叠标识符时，活动行的每个后续行也可以映射到初始单行的标识符。 可以通过映射标识符来增加彼此关联的多个标识符，从而可以增加定制广告的目标受众。

公开(公告)号：US20110313847A1

公开(公告)日：2011-12-22

申请号：US12818349

申请日：2010-06-18

申请人： Fei Cao ,  Shaoyu Zhou ,  Siddhartha Roy ,  Michael Elizarov ,  Zhuoqing Wu ,  James Zhang

发明人： Fei Cao ,  Shaoyu Zhou ,  Siddhartha Roy ,  Michael Elizarov ,  Zhuoqing Wu ,  James Zhang

IPC分类号： G06Q30/00

CPC分类号： G06Q30/02 ,  G06Q30/0241 ,  G06Q30/0244 ,  G06Q30/0255

摘要： Systems and methods for mapping identifiers are provided. Activity logs illustrate activities and/or events associated with a plurality of identifiers. The identifiers may be registered identifiers, unregistered identifiers, or a combination thereof. When at least two identifiers share a linking attribute, the at least two identifiers may be mapped to one another, along with information associated therewith (if any) such as a user profile. Each subsequent line of an activity line may also be mapped to the identifiers of the initial single line when a linking attribute or an overlapping identifier is present. A number of identifiers associated with each other may be increased by mapping identifiers and, thus, a targeted audience for a customized advertisement may, in turn, be increased.

摘要翻译： 提供了映射标识符的系统和方法。 活动日志示出与多个标识符相关联的活动和/或事件。 标识符可以是注册标识符，未注册标识符或其组合。 当至少两个标识符共享链接属性时，可以将至少两个标识符与其相关联的信息（如果有的话）诸如用户简档映射到彼此。 当存在链接属性或重叠标识符时，活动行的每个后续行也可以映射到初始单行的标识符。 可以通过映射标识符来增加彼此关联的多个标识符，从而可以增加定制广告的目标受众。

公开(公告)号：US07216133B2

公开(公告)日：2007-05-08

申请号：US10629254

申请日：2003-07-29

申请人： Yunxin Wu ,  Shaoyu Zhou ,  Lev Novik ,  Irena Hudis ,  Ashish B. Shah

发明人： Yunxin Wu ,  Shaoyu Zhou ,  Lev Novik ,  Irena Hudis ,  Ashish B. Shah

IPC分类号： G06F17/30

CPC分类号： G06Q10/10 ,  G06F17/30575 ,  Y10S707/959 ,  Y10S707/99943 ,  Y10S707/99952 ,  Y10S707/99954

摘要： Systems, methods, and computer program products for synchronizing items at replicas within a topology is disclosed. Items are stored in physical tables at the replicas. The physical table layouts at each replica can differ but are mapped to a common logical view. When a replica receives an indication that synchronization should be performed, the replica determines if changes have been made at the replica that should be mapped to the logical views. Replicas can facilitate this by comparing local change enumerations for changes made in physical tables to synchronization local change enumerations for changes in the logical views. Any changes that need to be synchronized are sent through the logical views to other replicas in the topology.

摘要翻译： 公开了用于在拓扑内的副本同步项目的系统，方法和计算机程序产品。 项目存储在副本的物理表中。 每个副本的物理表布局可能不同，但映射到公共逻辑视图。 当副本接收到应该执行同步的指示时，副本将确定在应该映射到逻辑视图的副本上是否进行了更改。 副本可以通过将对物理表所做的更改的本地更改枚举与逻辑视图中的更改的同步本地更改枚举进行比较来实现。 需要同步的任何更改将通过逻辑视图发送到拓扑中的其他副本。

公开(公告)号：US07778963B2

公开(公告)日：2010-08-17

申请号：US11114519

申请日：2005-04-26

申请人： Lev Novik ,  Muhunthan Sivapragasam ,  Shaoyu Zhou ,  Vivek Jawahir Jhaveri

发明人： Lev Novik ,  Muhunthan Sivapragasam ,  Shaoyu Zhou ,  Vivek Jawahir Jhaveri

IPC分类号： G06F7/00

CPC分类号： G06F17/30215

摘要： The subject invention pertains to data synchronization across replicas. Disclosed are systems and methods of detecting and handling constraint-based conflicts that occur during a synchronization session. In accordance with one particular aspect of the invention, name-constraint violations can be detected. These violations can be resolved by generating a single merged identity that can be utilized to refer to data units, for example on different replicas that had the same name. A property of the merged identity can be merge history, which specifies the identifiers subsumed by the merge.

摘要翻译： 本发明涉及跨复制品的数据同步。 公开了检测和处理在同步会话期间发生的基于约束的冲突的系统和方法。 根据本发明的一个特定方面，可以检测到名称约束违反。 可以通过生成可以用于引用数据单元的单个合并身份来解决这些违规行为，例如在具有相同名称的不同副本上。 合并身份的属性可以是合并历史，其指定合并所包含的标识。

公开(公告)号：US07577691B2

公开(公告)日：2009-08-18

申请号：US11498594

申请日：2006-08-02

申请人： Lev Novik ,  Douglas B. Terry ,  Irena Hudis ,  Jeremie E. Sartor ,  Shaoyu Zhou ,  Tomas Talius ,  Yunxin Wu ,  Jin He ,  Mark Scurrell

发明人： Lev Novik ,  Douglas B. Terry ,  Irena Hudis ,  Jeremie E. Sartor ,  Shaoyu Zhou ,  Tomas Talius ,  Yunxin Wu ,  Jin He ,  Mark Scurrell

IPC分类号： G06F17/30

CPC分类号： G06F17/30176 ,  Y10S707/99934 ,  Y10S707/99938 ,  Y10S707/99952 ,  Y10S707/99953 ,  Y10S707/99955

摘要： Extending hierarchical synchronization (sync) scopes to non-hierarchical scenarios may involve a method for synchronizing differently organized data stores comprising mapping different physical organizations to similar logical organizations and utilizing an organization-based synchronization algorithm to synchronize the differently organized stores. Also, the uniqueness constraints of the organizations may be preserved as well as the parent-child ordering constraints of the organizations.

摘要翻译： 将分级同步（同步）范围扩展到非分层场景可能涉及用于同步不同组织的数据存储的方法，包括将不同的物理组织映射到类似的逻辑组织，并利用基于组织的同步算法来同步不同组织的存储。 此外，组织的唯一性限制也可能受到组织的父母子女排序限制的限制。

公开(公告)号：US07653664B2

公开(公告)日：2010-01-26

申请号：US11592588

申请日：2006-11-03

申请人： Sudarshan A. Chitre ,  Rafik Robeal ,  Shaoyu Zhou

发明人： Sudarshan A. Chitre ,  Rafik Robeal ,  Shaoyu Zhou

IPC分类号： G06F12/00 ,  G06F17/30

CPC分类号： G06F17/30575

摘要： Described is a technology in which an anchor value is determined, for example to synchronize a destination database or data store with modifications made to a source database. The new anchor value is determined in a manner that excludes modifications corresponding to any uncommitted transactions. The new anchor value may be based on a counter value or a date and time value stored with each modification. The new anchor value may be determined by comparing a first set of committed modifications that do not include uncommitted modifications against a second set of modifications that includes committed modifications and uncommitted modifications. Alternatively, the new anchor value may be determined from the earliest start date and time among the modifications that are part of any uncommitted transactions. The anchor may be used (e.g., via queries) to enumerate modifications for synchronization, and also for detecting conflicts between the source and destination databases.

摘要翻译： 描述了一种技术，其中确定锚值，例如使目标数据库或数据存储与对源数据库的修改同步。 新的锚点值以排除与任何未提交交易相对应的修改的方式确定。 新的锚值可以基于每个修改存储的计数器值或日期和时间值。 可以通过将不包括未提交的修改的第一组提交的修改与包括已提交的修改和未提交的修改的第二组修改进行比较来确定新的锚值。 或者，可以从作为任何未提交事务的一部分的修改中的最早开始日期和时间来确定新的锚点值。 可以使用锚点（例如，经由查询）来枚举用于同步的修改，并且还用于检测源数据库和目的地数据库之间的冲突。