公开(公告)号：US20120197922A1

公开(公告)日：2012-08-02

申请号：US13443758

申请日：2012-04-10

Applicant: Hao Xu ,  Zhichen Xu

Inventor： Hao Xu ,  Zhichen Xu

IPC: G06F17/30 ,  G06F15/16

CPC classification number: G06F17/30899 ,  G06Q10/10

Abstract: Techniques are described for identifying one or more “interest twins” of a user. An interest twin of a user in another user that has demonstrated interests in items that are the same as or similar to the items in which the user has demonstrated an interest. Various techniques are described for reducing the overhead in interest twin determination operations. Once the interest twins for a user have been identified, the knowledge of the interest twins may be used in a variety of ways to enhance to experience of the user. For example, a mechanism may be provided which allows the user to see a list of items in which the user's interest twins have indicated an interest.

Abstract translation: 描述用于识别用户的一个或多个“兴趣双胞胎”的技术。 用户在其他用户中表现出与用户已经表现出兴趣的项目相同或类似的项目的兴趣的兴趣双胞胎。 描述了各种技术以减少感兴趣的双重确定操作的开销。 一旦已经识别出用户的兴趣双胞胎，感兴趣双胞胎的知识可以以各种方式用于增强用户的体验。 例如，可以提供允许用户查看用户兴趣双胞胎已经表示感兴趣的项目的列表的机制。

公开(公告)号：US09342614B2

公开(公告)日：2016-05-17

申请号：US13443758

申请日：2012-04-10

Applicant: Hao Xu ,  Zhichen Xu

Inventor： Hao Xu ,  Zhichen Xu

IPC: G06F17/30 ,  G06Q10/10

CPC classification number: G06F17/30899 ,  G06Q10/10

Abstract: Techniques are described for identifying one or more “interest twins” of a user. An interest twin of a user in another user that has demonstrated interests in items that are the same as or similar to the items in which the user has demonstrated an interest. Various techniques are described for reducing the overhead in interest twin determination operations. Once the interest twins for a user have been identified, the knowledge of the interest twins may be used in a variety of ways to enhance to experience of the user. For example, a mechanism may be provided which allows the user to see a list of items in which the user's interest twins have indicated an interest.

Abstract translation: 描述用于识别用户的一个或多个“兴趣双胞胎”的技术。 用户在其他用户中表现出与用户已经表现出兴趣的项目相同或类似的项目的兴趣的兴趣双胞胎。 描述了各种技术以减少感兴趣的双重确定操作的开销。 一旦已经识别出用户的兴趣双胞胎，感兴趣双胞胎的知识可以以各种方式用于增强用户的体验。 例如，可以提供允许用户查看用户兴趣双胞胎已经表示感兴趣的项目的列表的机制。

公开(公告)号：US08166058B2

公开(公告)日：2012-04-24

申请号：US11647938

申请日：2006-12-28

Applicant: Hao Xu ,  Zhichen Xu

Inventor： Hao Xu ,  Zhichen Xu

IPC: G06F7/00 ,  G06F17/30

CPC classification number: G06F17/30899 ,  G06Q10/10

Abstract: Techniques are described for identifying one or more “interest twins” of a user. An interest twin of a user in another user that has demonstrated interests in items that are the same as or similar to the items in which the user has demonstrated an interest. Various techniques are described for reducing the overhead in interest twin determination operations. Once the interest twins for a user have been identified, the knowledge of the interest twins may be used in a variety of ways to enhance to experience of the user. For example, a mechanism may be provided which allows the user to see a list of items in which the user's interest twins have indicated an interest.

Abstract translation: 描述用于识别用户的一个或多个“兴趣双胞胎”的技术。 用户在其他用户中表现出与用户已经表现出兴趣的项目相同或类似的项目的兴趣的兴趣双胞胎。 描述了各种技术以减少感兴趣的双重确定操作的开销。 一旦已经识别出用户的兴趣双胞胎，感兴趣双胞胎的知识可以以各种方式用于增强用户的体验。 例如，可以提供允许用户查看用户兴趣双胞胎已经表示感兴趣的项目的列表的机制。

公开(公告)号：US20080162431A1

公开(公告)日：2008-07-03

申请号：US11647938

申请日：2006-12-28

Applicant: Hao Xu ,  Zhichen Xu

Inventor： Hao Xu ,  Zhichen Xu

IPC: G06F17/30

CPC classification number: G06F17/30899 ,  G06Q10/10

Abstract: Techniques are described for identifying one or more “interest twins” of a user. An interest twin of a user in another user that has demonstrated interests in items that are the same as or similar to the items in which the user has demonstrated an interest. Various techniques are described for reducing the overhead in interest twin determination operations. Once the interest twins for a user have been identified, the knowledge of the interest twins may be used in a variety of ways to enhance to experience of the user. For example, a mechanism may be provided which allows the user to see a list of items in which the user's interest twins have indicated an interest.

Abstract translation: 描述用于识别用户的一个或多个“兴趣双胞胎”的技术。 用户在其他用户中表现出与用户已经表现出兴趣的项目相同或类似的项目的兴趣的兴趣双胞胎。 描述了各种技术以减少感兴趣的双重确定操作的开销。 一旦已经识别出用户的兴趣双胞胎，感兴趣双胞胎的知识可以以各种方式用于增强用户的体验。 例如，可以提供允许用户查看用户兴趣双胞胎已经表示感兴趣的项目的列表的机制。

公开(公告)号：US08838599B2

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

申请号：US12780850

申请日：2010-05-14

Applicant: Zhichen Xu ,  Yun Fu ,  Neal Sample

Inventor： Zhichen Xu ,  Yun Fu ,  Neal Sample

IPC: G06F17/30

CPC classification number: G06F17/30616

Abstract: Embodiments are directed towards a Modified Sequitur algorithm (MSA) using pipelining and indexed arrays to identify trending topics within a plurality of documents having user generated content (UGC). The documents are parallelized and distributed across a plurality of network devices, which place at least some of the received documents into a buffer for which the MSA may then be applied to the documents within the buffer to identify n-grams or phrases within the documents' contents. The identified phrases are further analyzed to remove extraneous co-occurrences of phrases, and/or words based on a part of speech analysis. A weighting of the remaining phrases is used to identify trending topic phrases. Links to content in the plurality of UGC documents that is associated with the trending topic phrases may then be displayed to a client device.

Abstract translation: 实施例针对使用流水线和索引数组来修改具有用户生成内容（UGC）的多个文档内的趋势主题的修改的序列算法（MSA）。 这些文档被并行化并且分布在多个网络设备上，这些网络设备将至少一些接收到的文档放置在缓冲器中，然后可以将MSA应用于缓冲器中的文档，以识别文档中的n个或多个短语， 内容。 进一步分析识别的短语，以消除基于词性分析的短语和/或单词的无关共存。 使用剩余短语的加权来识别趋势主题短语。 然后可以将与趋势主题短语相关联的多个UGC文档中的内容的链接显示给客户端设备。

公开(公告)号：US08655842B2

公开(公告)日：2014-02-18

申请号：US12542144

申请日：2009-08-17

Applicant: Zhichen Xu

Inventor： Zhichen Xu

IPC: G06F17/30

CPC classification number: H04L67/32 ,  G06F12/0868 ,  G06F2015/765 ,  G06Q50/01 ,  H04L67/26 ,  H04L67/2842 ,  H04L67/306 ,  H04L67/325

Abstract: Embodiments are directed towards modifying a distribution of writers as either a push writer or a pull writer based on a cost model that decides for a given content reader whether it is more effective for the writer to be a pull writer or a push writer. A cache is maintained for each content reader for caching content items pushed by a push writer in the content writer's push list of writers when the content is generated. At query time, content items are pulled by the content reader based on writers a content reader's pull list. One embodiment of the cost model employs data about a previous number of requests for content items for a given writer for a number of previous blended display results of content items. When a writer is determined to be popular, mechanisms are proposed for pushing content items to a plurality of content readers.

Abstract translation: 实施例旨在基于决定给定内容读取器的成本模型来将作者的分布修改为推送写入器或拉写入器，以使作者是更有效的作为拉写入器还是推动写入器。 为每个内容读取器维护高速缓存，用于在生成内容时缓存内容写入者的推送列表中的推送写入器推送的内容项目。 在查询时，内容读取器根据写入者提取内容读取器的列表。 成本模型的一个实施例使用关于给定写入器的先前数量的内容项的请求的数据用于多个内容项的先前混合显示结果。 当作者被确定为流行时，提出将内容项推送到多个内容阅读器的机制。

公开(公告)号：US08117215B2

公开(公告)日：2012-02-14

申请号：US12889740

申请日：2010-09-24

Applicant: George H. Forman ,  Zhichen Xu

Inventor： George H. Forman ,  Zhichen Xu

IPC: G06F7/00 ,  G06F17/30

CPC classification number: G06F17/30864

Abstract: A query-centric system and process for distributing reverse indices for a distributed content system. Relevance ranking techniques in organizing distributed system indices. Query-centric configuration subprocesses (1) analyze query data, partitioning terms for reverse index server(s) (RIS), (2) distribute each partitioned data set by generally localizing search terms for the RIS that have some query-centric correlation, and (3) generate and maintain a map for the partitioned reverse index system terms by mapping the terms for the reverse index to a plurality of different index server nodes. Indexing subprocess element builds distributed reverse indices from content host indices. Routines of the query execution use the map derived in the configuration to more efficiently return more relevant search results to the searcher.

Abstract translation: 以分布式内容系统分发反向索引的以查询为中心的系统和流程。 组织分布式系统指标的相关性排名技术。 以查询为中心的配置子过程（1）分析查询数据，反向索引服务器（RIS）的划分术语，（2）通过对具有一些以查询为中心的相关性的RIS的搜索项进行一般定位，分配每个分区数据集; （3）通过将反向索引的术语映射到多个不同的索引服务器节点来生成并维护分区反向索引系统术语的映射。 索引子进程元素从内容主机索引构建分布式反向索引。 查询执行的例程使用在配置中导出的映射更有效地将更相关的搜索结果返回给搜索者。

公开(公告)号：US08010532B2

公开(公告)日：2011-08-30

申请号：US11624072

申请日：2007-01-17

Applicant: Liang-Yu Chi ,  Dmitry Yurievich Pavlov ,  Yun Fu ,  Eren Manavoglu ,  Paul Heymann ,  Zhichen Xu

Inventor： Liang-Yu Chi ,  Dmitry Yurievich Pavlov ,  Yun Fu ,  Eren Manavoglu ,  Paul Heymann ,  Zhichen Xu

IPC: G06F17/30 ,  G06F7/00

CPC classification number: G06F17/30884

Abstract: The present invention is directed towards systems and method for organization of bookmarks. The method according to one embodiment comprises retrieving one or more bookmarks associated with one or more content items, a given bookmark generated by a user of a client device and identifying one or more tags associated with one or uniform resource locators corresponding to the or more bookmarks. A bookmark folder hierarchy is created through use of a clustering algorithm on the basis of the one or more tags associated with the one or more uniform resource locators corresponding to the one or more bookmarks.

Abstract translation: 本发明涉及用于组织书签的系统和方法。 根据一个实施例的方法包括检索与一个或多个内容项目相关联的一个或多个书签，由客户端设备的用户生成的给定书签，以及识别与一个或多个与该书签相对应的一个或多个统一资源定位符相关联的一个或多个标签 。 基于与一个或多个书签相对应的一个或多个统一资源定位符相关联的一个或多个标签，通过使用聚类算法来创建书签文件夹层次结构。

公开(公告)号：US07865715B2

公开(公告)日：2011-01-04

申请号：US10084499

申请日：2002-02-28

Applicant: Zhichen Xu ,  Li Xiao

Inventor： Zhichen Xu ,  Li Xiao

IPC: H04L9/00

CPC classification number: H04L63/0407 ,  H04L63/0442

Abstract: In a method for increasing peer privacy, a path for information is formed from a provider to a requestor through a plurality of peers in response to a received request for the information. Each peer of the plurality of peers receives a respective set-up message comprising of a predetermined label and an identity of a next peer for the information. The information is transferred over the path in a message, where the message comprises a message label configured to determine a next peer according to the path in response to the message label matching the previously received predetermined label.

Abstract translation: 在增加对等体隐私的方法中，响应于接收到的信息请求，通过多个对等体从提供者到请求者形成信息路径。 多个对等体的每个对等体接收相应的建立消息，其包括预定标签和信息的下一个对等体的标识。 信息通过消息中的路径传送，其中消息包括被配置为响应于与先前接收到的预定标签匹配的消息标签的路径来确定下一对等体的消息标签。

公开(公告)号：US20100256974A1

公开(公告)日：2010-10-07

申请号：US12417773

申请日：2009-04-03

Applicant: Zhichen Xu ,  Yun Fu ,  Peter Yen ,  Ning Song

Inventor： Zhichen Xu ,  Yun Fu ,  Peter Yen ,  Ning Song

IPC: G06F17/27

CPC classification number: G06F17/248 ,  G06F17/2715

Abstract: A method and a computer-readable medium are provided which perform screen scraping via grammar induction. The computer-readable medium stores instructions of the method, the instructions directing a computer processor to intercept display information transmitted to a computer-implemented display device representing information stored in a data source; induce a grammar via statistical analysis of the intercepted display information; provide the grammar to a parser-generator to generate a parser corresponding to the induced grammar; and perform screen scraping using the generated parser.

Abstract translation: 提供了一种通过语法感应来执行屏幕刮擦的方法和计算机可读介质。 所述计算机可读介质存储所述方法的指令，所述指令指示计算机处理器拦截发送到计算机实现的显示设备的显示信息，所述显示信息表示存储在数据源中的信息; 通过对截取的显示信息的统计分析来引发语法; 为解析器生成器提供语法以产生对应于引导语法的解析器; 并使用生成的解析器执行屏幕抓取。