利索-全球专利检索

  1. 登录
  2. 注册

搜索结果

86 条记录 (耗时 0.03 秒)

    Selecting nodes close to another node in a network using location information for the nodes
    5.
    发明申请
    Selecting nodes close to another node in a network using location information for the nodes 有权
    使用节点的位置信息选择靠近网络中另一个节点的节点

    公开(公告)号：US20050198286A1

    公开(公告)日：2005-09-08

    申请号：US10767285

    申请日：2004-01-30

    申请人： Zhichen Xu ,  Sujata Banerjee ,  Sung-Ju Lee

    发明人： Zhichen Xu ,  Sujata Banerjee ,  Sung-Ju Lee

    IPC分类号： H04L12/56 ,  G06F15/173

    CPC分类号： H04L45/02 ,  H04L45/126 ,  H04L45/46 ,  H04L45/54

    摘要： A network includes a plurality of nodes. A set of candidate nodes from the plurality of nodes is selected based on location information for the candidate nodes and a first node also in the network. A clustering algorithm is applied to the location information for the candidate nodes and the first node, and a subset of the set of candidate nodes closest to the first node is identified based on the results of applying the clustering algorithm.

    摘要翻译： 网络包括多个节点。 基于候选节点的位置信息和网络中的第一节点来选择来自多个节点的一组候选节点。 聚类算法应用于候选节点和第一节点的位置信息，并且基于应用聚类算法的结果来识别最接近第一节点的候选节点集合的子集。

    Selecting nodes close to another node in a network using location information for the nodes
    7.
    发明授权
    Selecting nodes close to another node in a network using location information for the nodes 有权
    使用节点的位置信息选择靠近网络中另一个节点的节点

    公开(公告)号：US07827279B2

    公开(公告)日：2010-11-02

    申请号：US10767285

    申请日：2004-01-30

    申请人： Zhichen Xu ,  Sujata Banerjee ,  Sung-Ju Lee

    发明人： Zhichen Xu ,  Sujata Banerjee ,  Sung-Ju Lee

    IPC分类号： G06F15/173

    CPC分类号： H04L45/02 ,  H04L45/126 ,  H04L45/46 ,  H04L45/54

    摘要： A network includes a plurality of nodes. A set of candidate nodes from the plurality of nodes is selected based on location information for the candidate nodes and a first node also in the network. A clustering algorithm is applied to the location information for the candidate nodes and the first node, and a subset of the set of candidate nodes closest to the first node is identified based on the results of applying the clustering algorithm.

    摘要翻译： 网络包括多个节点。 基于候选节点的位置信息和网络中的第一节点来选择来自多个节点的一组候选节点。 聚类算法应用于候选节点和第一节点的位置信息，并且基于应用聚类算法的结果来识别最接近第一节点的候选节点集合的子集。

    Efficient lexical trending topic detection over streams of data using a modified sequitur algorithm
    9.
    发明授权
    Efficient lexical trending topic detection over streams of data using a modified sequitur algorithm 有权
    使用修改的Sequitur算法对数据流进行有效的词汇趋势主题检测

    公开(公告)号：US08838599B2

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

    申请号：US12780850

    申请日：2010-05-14

    申请人： Zhichen Xu ,  Yun Fu ,  Neal Sample

    发明人： Zhichen Xu ,  Yun Fu ,  Neal Sample

    IPC分类号： G06F17/30

    CPC分类号： G06F17/30616

    摘要： 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.

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

    Push pull caching for social network information
    10.
    发明授权
    Push pull caching for social network information 有权
    推拉缓存用于社交网络信息

    公开(公告)号：US08655842B2

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

    申请号：US12542144

    申请日：2009-08-17

    申请人： Zhichen Xu

    发明人： Zhichen Xu

    IPC分类号： G06F17/30

    CPC分类号： H04L67/32 ,  G06F12/0868 ,  G06F2015/765 ,  G06Q50/01 ,  H04L67/26 ,  H04L67/2842 ,  H04L67/306 ,  H04L67/325

    摘要： 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.

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