专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明申请

US20180203917A1 DISCOVERING DATA SIMILARITY GROUPS IN LINEAR TIME FOR DATA SCIENCE APPLICATIONS 审中-公开
公开(公告)号：US20180203917A1
公开(公告)日：2018-07-19
申请号：US15410226
申请日：2017-01-19
申请人： Acquire Media Ventures Inc.
发明人： Jonathan A. Marshall , Lawrence C. Rafsky
IPC分类号： G06F17/30
CPC分类号： G06F16/285 , G06F16/217
摘要： A method for a processing device to group data items of a list of data items is disclosed. The processing device may identify a signature of a data item, the signature including a set of elements. The processing device may select a subset of the elements of the identified signature to form one or more partial signatures. The processing device may combine the selected subset of elements to form one or more tokens. The processing device may determine whether the one or more tokens is marked with one or more markers in a memory, the memory configured to contain an existing set of markers for tokens. The processing device may assign the data item to at least one group when one or more tokens is marked with the one or more markers in the memory.

2. 发明申请

US20160239495A1 RATING THE RELEVANCE OF NEWS STORIES FOR RECIPIENTS OF A NEWS FEED 审中-公开
标题翻译：评估新闻稿收件人新闻故事的相关性
公开(公告)号：US20160239495A1
公开(公告)日：2016-08-18
申请号：US14793831
申请日：2015-07-08
申请人： ACQUIRE MEDIA VENTURES INC.
发明人： Lawrence C. Rafsky , Jonathan Alan Marshall , Raymond Sun
IPC分类号： G06F17/30 , H04L29/06 , H04L29/08
CPC分类号： G06F16/9535 , G06F16/951 , H04L67/02 , H04L67/10 , H04L67/26
摘要： A server may receive a new story. The server may calculate a base score for the new story. The server may identify a set of stories received prior to the new story with which the new story overlaps. For each story in the set of stories, the server may compute a current score that the story in the set of stories would receive if the story in the set of stories were received at the same time as the new story. The server may identify a lower bound story in the set of stories having an original score and having a current score nearest to and lower than the base score for the new story and an upper bound story in the set of stories having an original score and having a current score nearest to and higher than the base score for the new story. The server may assign a score to the new story based on the original score of the lower bound story and the original score of the upper bound story.
摘要翻译：服务器可能会收到一个新的故事。服务器可以计算新故事的基本分数。服务器可能会识别新故事重叠之前的故事集。对于故事集中的每个故事，服务器可以计算一组故事中的故事将如何收到新故事的同一时间故事中的故事的当前分数。服务器可以识别具有原始分数并且具有最接近和低于新故事的基本分数的当前得分的故事集中的下限故事，并且该故事集中的上限故事具有原始得分并且具有最近和高于新故事的基本分数的当前得分。服务器可以根据下界故事的原始分数和上限故事的原始分数为新故事分配一个分数。

3. 发明授权

US09313149B2 Method and system tracking and determining public sentiment relating to social media 有权
标题翻译：方法和系统跟踪和确定与社交媒体有关的公众情绪
公开(公告)号：US09313149B2
公开(公告)日：2016-04-12
申请号：US13939671
申请日：2013-07-11
申请人： Acquire Media Ventures Inc.
发明人： Lawrence C. Rafsky , Robert E. Ungar , Thomas B. Donchez , Jonathan A. Marshall , Carolina Tejada
IPC分类号： H04L29/04 , H04L12/58 , G06Q50/00 , G06Q10/10
CPC分类号： H04L51/00 , G06Q10/10 , G06Q50/01
摘要： A method for determining influential broadcast messages in which a processing device identifies a plurality of re-posts of a post, wherein each re-post comprises a time stamp, determines whether the time stamp of the re-post is within a first time interval or a second time interval, increments a first count associated with the first time interval when the time stamp is within the first time interval or a second count associated with the second time interval when the time stamp is within the second time interval, and determines a public sentiment attribute associated with the post in view of a comparison between the first count and the second count.
摘要翻译：一种用于确定有影响力的广播消息的方法，其中处理装置识别帖子的多个重新帖子，其中每个重新包括时间戳，确定重新发布的时间戳是否在第一时间间隔内，或者第二时间间隔，当时间戳在第一时间间隔内时，增加与第一时间间隔相关联的第一计数，或者当时间戳在第二时间间隔内与第二时间间隔相关联的第二计数，并且确定公共鉴于第一计数和第二计数之间的比较，与职位相关联的情绪属性。

4. 发明授权

US09753964B1 Similarity clustering in linear time with error-free retrieval using signature overlap with signature size matching 有权
公开(公告)号：US09753964B1
公开(公告)日：2017-09-05
申请号：US15410126
申请日：2017-01-19
申请人： Acquire Media Ventures Inc.
发明人： Jonathan A. Marshall , Lawrence C. Rafsky
IPC分类号： G06F17/30
CPC分类号： G06F17/30339 , G06F17/30377 , G06K9/00496 , G06K9/6218 , G06K9/6272
摘要： A method for a processing device to determine whether to assign a data item to at least one cluster of data items is disclosed. The processing device may identify a signature of the data item, the signature including a set of elements. The processing device derive a first size value of the number of elements of the identified signature based on a set of size values of signatures that includes a maximum size value representing the largest number of elements in a signature. The processing device may derive a second size value of the number of elements of a second signature that is similar to the identified signature based on the set of size values of signatures. The processing device may select a subset of the set of elements of the identified signature to form at least one partial signature of the identified signature wherein the number of elements in the partial signature represents the number of elements in common between a signature having the first size value and a second similar signature having the second size value. The processing device may combine the selected subset of elements into at least one token. The processing device may determine whether the at least one token is present in a memory, the memory configured to contain an existing set of tokens. The processing device may determine whether to assign the data item to at least one cluster based on whether the at least one token is present in the memory.

5. 发明授权

US09009336B2 Method and system for pacing, acking, timing, and handicapping (path) for simultaneous receipt of documents 有权
标题翻译：用于同步接收文件的起搏，测试，定时和障碍（路径）的方法和系统
公开(公告)号：US09009336B2
公开(公告)日：2015-04-14
申请号：US14514862
申请日：2014-10-15
申请人： Acquire Media Ventures, Inc.
发明人： Lawrence C. Rafsky , Robert E. Ungar , Thomas B. Donchez , Lonne F. Katz , Christopher W. Lea
IPC分类号： G06F15/16 , H04L29/08 , G06Q10/10 , G06Q40/06 , H04L12/825 , G06F17/30 , H04L29/06 , H04L12/801 , H04L12/823
CPC分类号： H04L67/1097 , G06F17/30581 , G06Q10/10 , G06Q40/06 , H04L29/06095 , H04L47/10 , H04L47/263 , H04L47/32 , H04L67/06 , H04L67/26
摘要： A computing device determines impactful content in transmittable content. The computing device assigns the impactful content in the transmittable content to one or more impactful block units. Each impactful block unit comprises a determined numbers of characters. The computing device extracts the one or more impactful block units from the transmittable content. The computing device places the one or more impactful block units at the end of the transmittable content. The computing device transmits the transmittable content to a plurality of intended recipients. Each character, or a small packet set of sequential characters, of the determined number of characters of the one or more impactful block units is transmitted using a time delay for a particular intended recipient and a pacing method. The one or more impactful block units are to be received substantially simultaneously by the plurality of intended recipients.
摘要翻译：计算设备确定可发送内容中的有害内容。计算设备将可发送内容中的有影响的内容分配给一个或多个有影响力的块单元。每个有影响的块单元包括确定数量的字符。计算设备从可发送内容中提取一个或多个有影响的块单元。计算设备将一个或多个有影响的块单元放置在可传输内容的末尾。计算设备将可发送内容发送到多个预期接收者。使用针对特定预期接收者的时间延迟和起搏方法来发送确定的一个或多个有影响的块单元的字符数的每个字符或一小串连续字符的小包。一个或多个有影响的块单元将被多个预期接收者基本上同时接收。

6. 发明申请

US20160239574A1 DETERMINING AND MAINTAINING A LIST OF TOP NEWS STORIES FROM NEWS FEEDS 审中-公开
标题翻译：确定和维护新闻报导的新闻故事列表
公开(公告)号：US20160239574A1
公开(公告)日：2016-08-18
申请号：US14742135
申请日：2015-06-17
申请人： ACQUIRE MEDIA VENTURES INC.
发明人： Lawrence C. Rafsky , Jonathan Alan Marshall , Raymond Sun
IPC分类号： G06F17/30 , H04L29/06
CPC分类号： G06F16/9535 , G06F16/951 , H04L67/02 , H04L67/10 , H04L67/26
摘要： Responsive to a server determining that at least one term of a story signature of a first news story matches at least one term of the story signature of a second news story of a list of top news stories derived from a set of first news feeds, the server may replace the second news story in the list with the first news story. The server may transmit to a client a set of top news stories from a set of second news feeds having stories which match one or more topics of the stories in the list of top news stories derived from the set of first news feeds.
摘要翻译：响应于服务器，其确定第一新闻故事的故事签名的至少一个术语与来自一组第一新闻馈送的顶级新闻故事列表的第二新闻故事的故事签名的至少一个术语相匹配，服务器可能会用第一个新闻故事替代列表中的第二个新闻故事。服务器可以向来自客户端的一组新闻报道传送一组新闻报道，这些新闻报道具有与来自该组第一新闻提要的顶级新闻故事列表中的故事的一个或多个主题相匹配的故事。

7. 发明申请

US20140317231A1 METHOD AND SYSTEM FOR PACING, ACKING, TIMING, AND HANDICAPPING (PATH) FOR SIMULTANEOUS RECEIPT OF DOCUMENTS HAVING TRADER MARKUPS 有权
标题翻译：用于同时收到交易员标记的文件的打包，确认，定时和手动（路径）的方法和系统
公开(公告)号：US20140317231A1
公开(公告)日：2014-10-23
申请号：US14322406
申请日：2014-07-02
申请人： ACQUIRE MEDIA VENTURES, INC.
发明人： Lawrence C. Rafsky , Robert E. Ungar , Thomas B. Donchez , Lonne F. Katz , Christopher W. Lea
IPC分类号： H04L29/08
CPC分类号： H04L67/1097 , G06F17/30581 , G06Q10/10 , G06Q40/06 , H04L29/06095 , H04L47/10 , H04L47/263 , H04L47/32 , H04L67/06 , H04L67/26
摘要： A computing device determines impactful content in transmittable content. The computing device assigns the impactful content to one or more impactful block units. Each impactful block unit comprises a determined numbers of characters and an impactful block of characters comprises one or more impactful block units. The computing device inserts an identifier associated with the impactful content into the transmittable content proximal to the impactful block of characters. The identifier causes a message concerning a financial-related action to be communicated to a plurality of intended recipients when one or more conditions are met. The computing device transmits the one or more impactful block units and the identifier to the plurality of intended recipients using a time delay for a particular intended recipient and a pacing method such that the impactful block units are received substantially simultaneously by the plurality of intended recipients.
摘要翻译：计算设备确定可发送内容中的有害内容。计算设备将有影响的内容分配给一个或多个有影响力的块单元。每个有影响的块单元包括确定数量的字符，并且有影响的字符块包括一个或多个有影响的块单元。计算设备将与有影响的内容相关联的标识符插入到靠近有影响力的字符块的可发送内容中。当满足一个或多个条件时，标识符导致关于财务相关动作的消息被传送到多个预期接收者。计算设备使用针对特定预期接收者的时间延迟和起搏方法将一个或多个有影响的块单元和标识符发送到多个预期接收者，使得多个预期接收者基本上同时接收有影响的块单元。

8. 发明申请

US20140019548A1 METHOD AND SYSTEM TRACKING AND DETERMINING PUBLIC SENTIMENT RELATING TO SOCIAL MEDIA 有权
标题翻译：方法和系统跟踪和确定与社会媒体相关的公共宣传
公开(公告)号：US20140019548A1
公开(公告)日：2014-01-16
申请号：US13939671
申请日：2013-07-11
申请人： Acquire Media Ventures Inc.
发明人： Lawrence C. Rafsky , Robert E. Ungar , Thomas B. Donchez , Jonathan A. Marshall , Carolina Tejada
IPC分类号： H04L12/58
CPC分类号： H04L51/00 , G06Q10/10 , G06Q50/01
摘要： A method for determining influential broadcast messages in which a processing device identifies a plurality of re-posts of a post, wherein each re-post comprises a time stamp, determines whether the time stamp of the re-post is within a first time interval or a second time interval, increments a first count associated with the first time interval when the time stamp is within the first time interval or a second count associated with the second time interval when the time stamp is within the second time interval, and determines a public sentiment attribute associated with the post in view of a comparison between the first count and the second count.
摘要翻译：一种用于确定有影响力的广播消息的方法，其中处理装置识别帖子的多个重新帖子，其中每个重新包括时间戳，确定重新发布的时间戳是否在第一时间间隔内，或第二时间间隔，当时间戳在第一时间间隔内时，增加与第一时间间隔相关联的第一计数，或者当时间戳在第二时间间隔内与第二时间间隔相关联的第二计数，并且确定公共鉴于第一计数和第二计数之间的比较，与职位相关联的情绪属性。

9. 发明申请

US20180203916A1 DATA CLUSTERING WITH REDUCED PARTIAL SIGNATURE MATCHING USING KEY-VALUE STORAGE AND RETRIEVAL 审中-公开
公开(公告)号：US20180203916A1
公开(公告)日：2018-07-19
申请号：US15410152
申请日：2017-01-19
申请人： Acquire Media Ventures Inc.
发明人： Lawrence C. Rafsky , Jonathan A. Marshall
IPC分类号： G06F17/30
CPC分类号： G06F16/285 , G06F16/2455
摘要： A method and system for a processing device to assign a data item to at least one cluster of data items is disclosed. The processing device may identify a signature of the data item, the signature including a set of elements. The processing device may derive a first size value of the number of elements of the identified signature based on a set of size values of signatures that includes a maximum size value representing the largest number of elements in a signature. The processing device may derive a set of second size values of the number of elements of a second signature that is similar to the identified signature based on the set of size values of signatures. The processing device may generate a plurality of partial signatures from one or more combinations of elements of the identified signature. For each partial signature of the plurality of partial signatures, the processing device may combine the elements of the partial signature into one or more tokens. The processing device may use the first size value or a size value from the set of second size values to reduce a set of possible matches of the one or more tokens in a table in a memory. The processing device may determine which of the one or more tokens is marked as a key of a key-value pair in the table in the memory in view of the reduced set of possible matches. The processing device may assign the data item to at least one cluster based on the one or more tokens that are marked or a remainder of the tokens that are not marked.

10. 发明申请

US20160239494A1 DETERMINING AND MAINTAINING A LIST OF NEWS STORIES FROM NEWS FEEDS MOST RELEVANT TO A TOPIC 审中-公开
标题翻译：新闻稿的确定和维护新闻报导最有可能与主题相关
公开(公告)号：US20160239494A1
公开(公告)日：2016-08-18
申请号：US14730840
申请日：2015-06-04
申请人： ACQUIRE MEDIA VENTURES INC.
发明人： Lawrence C. Rafsky , Jonathan Alan Marshall , Raymond Sun
IPC分类号： G06F17/30 , H04L29/08
CPC分类号： G06F16/9535 , G06F16/951 , H04L67/02 , H04L67/10 , H04L67/26
摘要： A server may receive a request from a client for a list of stories pertaining to a topic or the server may initiate pushing to the client the list of stories pertaining to the topic. The server obtains a first list of stories pertaining to the topic belonging to a set of first news feeds. The server computes an initial story score for each story in the first list of stories from a set of key terms scores, wherein each key term score corresponds to the number of times that the key term appears in a second list of stories pertaining to the topic belonging to a set of second news feeds. The server outputs a set of top stories from the first list of stories based on a tradeoff between the amount of overlap in key terms among the stories in the first list of stories and a combination of the initial story scores of the stories in the first list of stories.
摘要翻译：服务器可以从客户端接收关于主题的故事列表的请求，或者服务器可以启动向客户推送与该主题相关的故事列表。服务器获得属于一组第一新闻馈送的属于该主题的故事的第一列表。服务器根据一组关键词分数计算第一故事列表中每个故事的初始故事得分，其中每个关键词分数对应于关键词出现在与主题相关的第二故事列表中的次数属于一组第二个新闻提要。服务器根据第一个故事列表中的故事中关键词的重叠量与第一个列表中故事的初始故事分数的组合之间的折衷，从第一个故事列表中输出一组顶级故事的故事。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式