公开(公告)号：US20120238285A1

公开(公告)日：2012-09-20

申请号：US13049900

申请日：2011-03-17

申请人： Eran YARIV ,  Keren Master ,  Daniel Sitton ,  Roy Varshavsky ,  Yoram Yaacovi

发明人： Eran YARIV ,  Keren Master ,  Daniel Sitton ,  Roy Varshavsky ,  Yoram Yaacovi

IPC分类号： H04W4/08

CPC分类号： H04W4/08 ,  H04L67/306 ,  H04W4/06 ,  H04W4/21

摘要： A proximity matching system may use broadcast wireless identifiers transmitted by users' devices to match users with other nearby users. The identifiers may be collected by a plurality of agents, then the identifiers may be matched with pre-defined profiles to generate physically proximate users by a remote service. The group of proximate users may be provided to various applications and consumed with summarized properties or individual properties, depending on the approved privacy settings as selected by the users. In some embodiments, the broadcast wireless identifiers may be personal area network identifiers, local area network identifiers, cellular network identifiers, or other broadcast identifier. In some embodiments, the agents may not establish a peer to peer or other connection with the broadcasting device. The agents may be fixed or mobile agents, and the proximity of users may be generated through links between nearby agents in a meshed fashion.

摘要翻译： 接近匹配系统可以使用用户设备发送的广播无线标识符来与其他附近用户匹配用户。 标识符可以由多个代理收集，然后标识符可以与预定义的简档相匹配，以通过远程服务生成物理上最接近的用户。 根据由用户选择的认可的隐私设置，可以将近似用户组提供给各种应用并且消耗具有汇总的属性或单独的属性。 在一些实施例中，广播无线标识符可以是个人区域网络标识符，局域网标识符，蜂窝网络标识符或其他广播标识符。 在一些实施例中，代理可能不建立与广播设备的对等或其他连接。 代理可以是固定的或移动代理，并且可以通过以网格方式的附近代理之间的链接来生成用户的接近度。

公开(公告)号：US20090313558A1

公开(公告)日：2009-12-17

申请号：US12137157

申请日：2008-06-11

申请人： Eran Yariv ,  Ron Karidi ,  Roy Varshavsky ,  Daniel Sitton ,  Oded Elyada

发明人： Eran Yariv ,  Ron Karidi ,  Roy Varshavsky ,  Daniel Sitton ,  Oded Elyada

IPC分类号： G06F7/06 ,  G06F17/30 ,  G06F3/048

CPC分类号： G06F16/583 ,  G06F16/951

摘要： A service provides an image collection as a visual preview of content pages having a link in or otherwise related to a current page. A first content page is provided to a user and may have one or more links to additional content pages. Each of the related content pages may have one or more images. Selected images of the one or more content pages are provided in an image collection. The images may be positioned in rows, columns, or some other manner within the collection. The image collection is prepared dynamically from related content pages when the current page is loaded and does not require any software in the currently content page to be changed as the linked content pages change.

摘要翻译： 服务提供图像集合作为具有当前页面中的链接或以其他方式与当前页面相关的内容页面的可视预览。 向用户提供第一内容页面，并且可以具有到另外的内容页面的一个或多个链接。 每个相关内容页面可以具有一个或多个图像。 在图像集合中提供一个或多个内容页面的所选图像。 图像可以以集合中的行，列或某些其他方式定位。 当加载当前页面时，从相关内容页面动态准备图像集合，并且当链接的内容页面改变时不需要改变当前内容页面中的任何软件。

公开(公告)号：US20090313536A1

公开(公告)日：2009-12-17

申请号：US12136889

申请日：2008-06-11

申请人： Ron Karidi ,  Eran Yariv ,  Roy Varshavsky ,  Daniel Sitton ,  Oded Elyada ,  Noga Amit ,  Omer Ramote

发明人： Ron Karidi ,  Eran Yariv ,  Roy Varshavsky ,  Daniel Sitton ,  Oded Elyada ,  Noga Amit ,  Omer Ramote

IPC分类号： G06F17/00

CPC分类号： G06F16/972

摘要： A requested content page is provided with additional relevant content that is dynamically generated. A page originally requested by a browser application is generated and examined to determine key words, address information, and other information for which relevant content may be retrieved. The other information may not be part of the original page content, but it can be the relation between the content page and other pages. The relevant content is determined based on the results of the content page examination. After retrieving the relevant content, the retrieved content is embedded into the requested content page and provided to the requesting user. The retrieved relevant content may be provided with the requested content page in a designated portion within the requested content page, near related content in the page, and/or displayed in response to user input as a pop-up window or in a preview pane. Relevant content can be determined, retrieved and embedded in a content page by a relevant content engine implemented as a server application, client application or browser application plug-in.

摘要翻译： 请求的内容页面提供动态生成的其他相关内容。 生成并检查由浏览器应用程序最初请求的页面以确定可以检索相关内容的关键字，地址信息和其他信息。 其他信息可能不是原始页面内容的一部分，但它可以是内容页面和其他页面之间的关系。 相关内容是根据内容页面检查的结果确定的。 在检索相关内容之后，检索到的内容被嵌入到所请求的内容页面中并提供给请求用户。 所检索的相关内容可以被提供在所请求的内容页面内的指定部分中，在页面中的相关内容附近，和/或响应于用户输入显示为弹出窗口或在预览窗格中。 相关内容可以由实现为服务器应用程序，客户端应用程序或浏览器应用程序插件的相关内容引擎确定，检索和嵌入到内容页面中。

公开(公告)号：US20110010366A1

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

申请号：US12500657

申请日：2009-07-10

申请人： Roy Varshavsky ,  Moshe Tennenholtz ,  Ron Karidi

发明人： Roy Varshavsky ,  Moshe Tennenholtz ,  Ron Karidi

IPC分类号： G06F17/30

CPC分类号： G06F17/30864 ,  G06Q30/02

摘要： A recommendation system may use a network of relationships between many different entities to find search results and establish a relevance value for the search results. The relevance value may be calculated by analyzing trust and similarity components of each relationship between the search user and the entity providing the search results. The entities may be, for example, persons associated within express or implied social networks, or corporations or other organizations with a historical or other reputation. The relationships may be created through many different contact mechanisms and may be unidirectional, asymmetric bidirectional, or symmetric bidirectional relationships. The relationships may be different based on topic or other factors.

摘要翻译： 推荐系统可以使用许多不同实体之间的关系网络来查找搜索结果并建立搜索结果的相关性值。 可以通过分析搜索用户和提供搜索结果的实体之间的每个关系的信任和相似性分量来计算相关性值。 实体可以是例如在明示或暗示的社交网络内的人，或具有历史或其他声誉的公司或其他组织。 可以通过许多不同的接触机制来创建关系，并且可以是单向的，不对称的双向的或对称的双向关系。 基于主题或其他因素，关系可能不同。

公开(公告)号：US10223702B2

公开(公告)日：2019-03-05

申请号：US12967394

申请日：2010-12-14

申请人： Ron J. Karidi ,  Moshe Tennenholtz ,  Roy Varshavsky

发明人： Ron J. Karidi ,  Moshe Tennenholtz ,  Roy Varshavsky

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

摘要： Systems, methods, and computer media for integrating requests for reserved allocations of advertisement impressions and requests for dynamic allocations of advertisement impressions are provided. A request is received from a first advertiser to purchase a reserved allocation of advertisement impressions. The request specifies a requested number of impressions that each have one or more requested attributes. One or more bids to dynamically purchase one or more impressions through a real-time bidding process are received from an external bidding agent. An internal bidding agent bids, on behalf of the first advertiser, to dynamically purchase one or more impressions through the real-time bidding process until the request from the first advertiser to purchase the reserved allocation of impressions is satisfied.

公开(公告)号：US08341496B2

公开(公告)日：2012-12-25

申请号：US12367071

申请日：2009-02-06

申请人： Vadim Mesonzhnik ,  Roy Varshavsky

发明人： Vadim Mesonzhnik ,  Roy Varshavsky

IPC分类号： G11C29/00

CPC分类号： G11B20/1803 ,  G06F11/1048 ,  G06F11/2084 ,  G11B20/1258 ,  G11B20/1833 ,  G11B2020/1843 ,  G11B2220/2537

摘要： A data storage medium may have data stored on one physical portion of the medium and error correction and recovery data stored on a second physical portion of the medium. In one embodiment, a write once, read many medium may be written with data and the remaining capacity of the medium may be filled with error correction and recovery data. If a portion of the main data is corrupted, the error correction and recovery data may be used to recreate the corrupted data. The error correction and recovery data may be created to fill the unused capacity of the medium by prioritizing and selectively backing up the data when the data use more than half of the medium's capacity, or may create one or more redundant copies of the data if the data consume less than half of the medium's capacity, for example.

摘要翻译： 数据存储介质可以具有存储在介质的一个物理部分上的数据和存储在介质的第二物理部分上的纠错和恢复数据。 在一个实施例中，可以用数据写入一次读取的许多介质，并且可以用纠错和恢复数据填充介质的剩余容量。 如果主数据的一部分被破坏，则可以使用纠错和恢复数据来重建损坏的数据。 可以创建错误校正和恢复数据，以便当数据使用超过媒体容量的一半以上时优先排序并选择性地备份数据，以填补媒体的未使用容量，或者如果数据使用超过一半的数据的冗余副本，则可以创建数据的一个或多个冗余副本 例如，数据的消耗量不到媒体的一半。

公开(公告)号：US20120210240A1

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

申请号：US13034719

申请日：2011-02-25

申请人： Eugene(John) Neystadt ,  Avigad Oron ,  Ron Karidi ,  Roy Varshavsky ,  Ron Dar Ziv

发明人： Eugene(John) Neystadt ,  Avigad Oron ,  Ron Karidi ,  Roy Varshavsky ,  Ron Dar Ziv

IPC分类号： G06F3/048 ,  G06F17/30

CPC分类号： G06Q30/0282 ,  G06F16/437 ,  G06Q10/00 ,  G06Q30/02 ,  G06Q50/01

摘要： A ranked set of users may be calculated from an expertise categorization for each user and a person's trust in the users for specific categories. The ranked set of users may be used for presenting search results, recommendations, social marketing, or other uses. A person's expertise may be determined through various online activities. A person's trust in another person may be related to their proximity and activity in one or more social networks.

摘要翻译： 可以根据每个用户的专业知识分类以及个人对特定类别的用户的信任来计算一组排名的用户。 用户排名可能用于呈现搜索结果，建议，社交营销或其他用途。 一个人的专业知识可以通过各种在线活动来确定。 一个人对另一个人的信任可能与一个或多个社交网络中的邻近度和活动有关。

公开(公告)号：US20120150656A1

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

申请号：US12967394

申请日：2010-12-14

申请人： Ron J. Karidi ,  Moshe Tennenholtz ,  Roy Varshavsky

发明人： Ron J. Karidi ,  Moshe Tennenholtz ,  Roy Varshavsky

IPC分类号： G06Q30/00

CPC分类号： G06Q30/02 ,  G06Q30/0269 ,  G06Q30/0275

摘要： Systems, methods, and computer media for integrating requests for reserved allocations of advertisement impressions and requests for dynamic allocations of advertisement impressions are provided. A request is received from a first advertiser to purchase a reserved allocation of advertisement impressions. The request specifies a requested number of impressions that each have one or more requested attributes. One or more bids to dynamically purchase one or more impressions through a real-time bidding process are received from an external bidding agent. An internal bidding agent bids, on behalf of the first advertiser, to dynamically purchase one or more impressions through the real-time bidding process until the request from the first advertiser to purchase the reserved allocation of impressions is satisfied.

摘要翻译： 提供了用于集成广告印象的预留分配请求和用于动态分配广告印象的请求的系统，方法和计算机媒体。 从第一个广告客户接收到一个请求，以购买广告印象的预留分配。 请求指定每个请求的一个或多个请求的属性的请求数量的展示。 从外部投标代理接收一个或多个通过实时出价过程动态购买一次或多次展示的出价。 内部出价代理人代表第一个广告客户，通过实时出价过程动态购买一次或多次展示，直到满足第一个广告客户购买保留的展示次数分配的请求为止。

公开(公告)号：US08869277B2

公开(公告)日：2014-10-21

申请号：US12894185

申请日：2010-09-30

申请人： Kira Radinsky ,  Roy Varshavsky ,  Jack W. Stokes ,  Vladimir Holostov ,  Edward Schaefer

发明人： Kira Radinsky ,  Roy Varshavsky ,  Jack W. Stokes ,  Vladimir Holostov ,  Edward Schaefer

IPC分类号： G06F21/00 ,  G06Q30/00 ,  G06F21/56

CPC分类号： G06F21/563 ,  G06F21/56 ,  G06Q10/06 ,  G06Q30/00

摘要： Architecture that selects a classification engine based on the expertise of the engine to process a given entity (e.g., a file). Selection of an engine is based on a probability that the engine will detect an unknown entity classification using properties of the entity. One or more of the highest ranked engines are activated in order to achieve the desired performance. A statistical, performance-light module is employed to skip or select several performance-demanding processes. Methods and algorithms are utilized for learning based on matching the best classification engine(s) to detect the entity class based on the entity properties. A user selection option is provided for specifying a maximum number of ranked, classification engines to consider for each state of the machine. A user can also select the minimum probability of detection for a specific entity (e.g., unknown file). The best classifications are re-evaluated over time as the classification engines are updated.

摘要翻译： 基于引擎的专长来选择分类引擎以处理给定实体（例如，文件）的架构。 引擎的选择是基于引擎将使用实体的属性来检测未知实体分类的概率。 一个或多个最高排名的引擎被激活以实现期望的性能。 采用统计的性能灯模块来跳过或选择若干性能要求高的过程。 基于匹配最佳分类引擎的方法和算法用于学习，以根据实体属性检测实体类。 提供用户选择选项，用于指定针对机器的每个状态考虑的排名最大的分类引擎。 用户还可以选择特定实体（例如，未知文件）的最小检测概率。 随着分类引擎的更新，最好的分类会随着时间的推移重新评估。

公开(公告)号：US08661050B2

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

申请号：US12500657

申请日：2009-07-10

申请人： Roy Varshavsky ,  Moshe Tennenholtz ,  Ron Karidi

发明人： Roy Varshavsky ,  Moshe Tennenholtz ,  Ron Karidi

IPC分类号： G06F17/30

CPC分类号： G06F17/30864 ,  G06Q30/02

摘要： A recommendation system may use a network of relationships between many different entities to find search results and establish a relevance value for the search results. The relevance value may be calculated by analyzing trust and similarity components of each relationship between the search user and the entity providing the search results. The entities may be, for example, persons associated within express or implied social networks, or corporations or other organizations with a historical or other reputation. The relationships may be created through many different contact mechanisms and may be unidirectional, asymmetric bidirectional, or symmetric bidirectional relationships. The relationships may be different based on topic or other factors.

摘要翻译： 推荐系统可以使用许多不同实体之间的关系网络来查找搜索结果并建立搜索结果的相关性值。 可以通过分析搜索用户和提供搜索结果的实体之间的每个关系的信任和相似性分量来计算相关性值。 实体可以是例如在明示或暗示的社交网络内的人，或具有历史或其他声誉的公司或其他组织。 可以通过许多不同的接触机制来创建关系，并且可以是单向的，不对称的双向的或对称的双向关系。 基于主题或其他因素，关系可能不同。