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

1. 发明授权

US08812947B1 Ranking graphical visualizations of a data set according to data attributes 有权
标题翻译：根据数据属性排列数据集的图形可视化
公开(公告)号：US08812947B1
公开(公告)日：2014-08-19
申请号：US13314780
申请日：2011-12-08
申请人： Hillel Maoz , Daniel Libicki , Michael Fink , Ronald Ho , Dennis Julian Lee , Yossi Matias , Amit Weinstein , Yoah Bar David , Itai Raz
发明人： Hillel Maoz , Daniel Libicki , Michael Fink , Ronald Ho , Dennis Julian Lee , Yossi Matias , Amit Weinstein , Yoah Bar David , Itai Raz
IPC分类号： G06F17/24 , G06F17/30
CPC分类号： G06F17/246
摘要： A computer-implemented system, method and computer readable medium to generate graphical visualizations corresponding to a data set populated in a web-based document, such as a spreadsheet. The spreadsheet is accessible in an interne or cloud-based system, and enables users to automatically create graphical visualizations or representations based on recommendations by a spreadsheet application. The graphical visualizations may be automatically ranked such that the system provides the recommendations to the user for display. Automatic ranking is accomplished, for example, by determining data types from identifying column type, differentiating column types, and extracting data sets having attributes corresponding to various graphical visualizations.
摘要翻译：计算机实现的系统，方法和计算机可读介质，用于生成对应于填充在诸如电子表格的基于web的文档中的数据集的图形可视化。电子表格可以在基于互联网或基于云的系统中访问，并使用户能够根据电子表格应用程序的建议自动创建图形可视化或表示。图形可视化可以被自动排序，使得系统向用户提供建议以供显示。例如，通过从识别列类型，区分列类型和提取具有与各种图形可视化对应的属性的数据集来确定数据类型来实现自动排序。

2. 发明申请

US20090327217A1 METHOD AND SYSTEM FOR CREATION AND DYNAMIC UPDATING OF BEST DATA ARRANGEMENT IN DIGITAL DATA STORE SYSTEM 有权
标题翻译：用于数字数据存储系统中最佳数据安排的创建和动态更新的方法和系统
公开(公告)号：US20090327217A1
公开(公告)日：2009-12-31
申请号：US12490981
申请日：2009-06-24
申请人： Yossi Matias , Guy Shaked , Vladimir Braverman , Victor Belyaev , Shahar Golan , Marina Sadetsky
发明人： Yossi Matias , Guy Shaked , Vladimir Braverman , Victor Belyaev , Shahar Golan , Marina Sadetsky
IPC分类号： G06F17/30
CPC分类号： G06F17/30424
摘要： The current invention is a method and a system for analyzing templates of queries, with different levels of precision. When the system of the current invention takes a decision to arrange data, these templates are used, and a single data arrangement object (HRBlob) is designed which may serve a single template or several templates and not just a single query. This approach has an important impact on data arrangement performance and on queries performance, since this approach may help many more queries to be handled using less data arrangement objects.
摘要翻译：本发明是用于分析不同级别精度的查询模板的方法和系统。当本发明的系统决定排列数据时，使用这些模板，并且设计单个数据排列对象（HRBlob），其可以提供单个模板或多个模板，而不仅仅是单个查询。这种方法对数据排列性能和查询性能有重要的影响，因为这种方法可以帮助使用较少的数据排列对象来处理更多的查询。

3. 发明授权

US06591291B1 System and method for providing anonymous remailing and filtering of electronic mail 失效
标题翻译：提供电子邮件匿名退款和过滤的系统和方法
公开(公告)号：US06591291B1
公开(公告)日：2003-07-08
申请号：US09041209
申请日：1998-03-12
申请人： Eran Gabber , Phillip B. Gibbons , David Morris Kristol , Yossi Matias , Alain J. Mayer
发明人： Eran Gabber , Phillip B. Gibbons , David Morris Kristol , Yossi Matias , Alain J. Mayer
IPC分类号： G06F1338
CPC分类号： H04L51/28 , G06Q10/107 , H04L29/06 , H04L29/12009 , H04L29/12594 , H04L51/12 , H04L51/14 , H04L61/3065 , H04L63/0407 , H04L63/0435 , H04L69/04
摘要： A system for, and method of, generating an alias source address for an electronic mail (“e-mail”) message having a real source address and a destination address and a computer network, such as the Internet, including the system or the method. In one embodiment, the system includes an alias source address generator that employs the destination address to generate the alias source address. The system further includes an alias source address substitutor that substitutes the alias source address for the real source address. This removes the real source address from the e-mail message and thereby renders the sender, located at the real source address, anonymous. Further-described are systems and methods for forwarding reply e-mail and filtering reply e-mail based on alias source address.
摘要翻译：用于生成具有真实源地址和目的地地址的电子邮件（“电子邮件”）消息的别名源地址的系统和方法以及诸如因特网的计算机网络，包括系统或方法。在一个实施例中，系统包括使用目的地地址来生成别名源地址的别名源地址生成器。该系统还包括将别名源地址替换为实际源地址的别名源地址替换器。这将从电子邮件消息中删除真实的源地址，从而使位于真实源地址的发件人匿名。进一步描述了基于别名源地址转发回复电子邮件和过滤回复电子邮件的系统和方法。

4. 发明授权

US06434590B1 Methods and apparatus for scheduling parallel processors 失效
标题翻译：调度并行处理器的方法和装置
公开(公告)号：US06434590B1
公开(公告)日：2002-08-13
申请号：US09053873
申请日：1998-04-01
申请人： Guy E. Blelloch , Phillip B. Gibbons , Yossi Matias , Girija J. Narlikar
发明人： Guy E. Blelloch , Phillip B. Gibbons , Yossi Matias , Girija J. Narlikar
IPC分类号： G06F900
CPC分类号： G06F9/5066 , G06F2209/5021
摘要： A parallel processing method involves the steps of determining a sequential ordering of tasks for processing, assigning priorities to available tasks on the basis of the earliest and then later in the sequential ordering, selecting a number of tasks greater than a total number of available parallel processing elements from all available tasks having the highest priorities, partitioning the selected tasks into a number of groups equal to the available number of parallel processing elements, and executing the tasks in the groups in the parallel processing elements. The determining step establishes an ordering with a specific predetermined sequential schedule that is independent of the parallel execution, and the assigning step assigns priorities for parallel execution on the basis of the sequential schedule that is independent of the parallel execution.
摘要翻译：并行处理方法包括以下步骤：确定用于处理的任务的顺序排序，基于顺序排序中的最早然后稍后的顺序为可用任务分配优先级，选择大于总数的可用并行处理来自具有最高优先级的所有可用任务的元素，将所选择的任务划分成等于可用数量的并行处理元素的多个组，以及在并行处理元素中执行组中的任务。确定步骤建立具有独立于并行执行的特定预定顺序调度的排序，并且分配步骤基于独立于并行执行的顺序调度分配用于并行执行的优先级。

5. 发明授权

US06269363B1 Method of accessing data using approximate data structures by relaxing the operations that define same 失效
标题翻译：使用近似数据结构访问数据的方法是放松定义相同的操作
公开(公告)号：US06269363B1
公开(公告)日：2001-07-31
申请号：US08710900
申请日：1996-09-24
申请人： Yossi Matias
发明人： Yossi Matias
IPC分类号： B06F1730
CPC分类号： G06F17/30 , Y10S707/99933 , Y10S707/99935 , Y10S707/99942 , Y10S707/99945
摘要： A method for constructing approximate data structures is disclosed in which the operations that define the data structure are relaxed. The operations are specified such that error of approximation in the results of the operations may be traded for speed in executing the operations.
摘要翻译：公开了一种用于构造近似数据结构的方法，其中定义数据结构的操作被放宽。指定操作，以便在执行操作时可以对运行结果中的近似误差进行交易。

6. 发明授权

US5703581A Method and apparatus for data compression and decompression 失效
标题翻译：用于数据压缩和解压缩的方法和装置
公开(公告)号：US5703581A
公开(公告)日：1997-12-30
申请号：US665188
申请日：1996-06-14
申请人： Yossi Matias , Suleyman Cenk Sahinalp
发明人： Yossi Matias , Suleyman Cenk Sahinalp
IPC分类号： H03M7/42 , G06T9/00 , H03M7/30 , H03M7/40 , H03M7/46
CPC分类号： H03M7/3088 , G06T9/005 , H03M7/40
摘要： A data compression technique for encoding a data stream of symbols processes a current sequence of symbols in the stream using an adaptive look-up table containing strings of different lengths by identifying whether a match of a longest string from the table or a shorter string would produce a lower compression ratio by "looking ahead" and identifying a match between a next sequence in the data stream and strings in the table. The compression technique identifies those situations where it is advantageous to use a compressed code identifier for a current sequence that is shorter than the longest matching sequence. Such situations exist when the compression ratio achieved for compressing the current sequence in combination with the next sequence in the stream is greater when other than the longest match is employed for the first sequence. A corresponding decompression technique to decode data encoded using a similar "look ahead" technique is also disclosed.
摘要翻译：用于编码符号的数据流的数据压缩技术使用包含不同长度字符串的自适应查找表来处理流中的当前符号序列，通过识别来自表或较短字符串的最长字符串的匹配是否会产生通过“向前看”并且识别数据流中的下一个序列和表中的字符串之间的匹配来降低压缩比。压缩技术识别那些使用比最长匹配序列短的当前序列的压缩代码标识符是有利的情况。当对于第一序列采用除最长匹配之外的当压缩当前序列与流中的下一个序列相结合的压缩比时，存在这种情况。还公开了对使用类似的“前瞻性”技术编码的数据进行解码的对应的解压缩技术。

7. 发明授权

US09159364B1 Aggregation of related media content 有权
标题翻译：相关媒体内容的汇总
公开(公告)号：US09159364B1
公开(公告)日：2015-10-13
申请号：US13361778
申请日：2012-01-30
申请人： Yossi Matias , Matthew Sharifi , Thomas Bugnon , Dominik Roblek , Annie Chen
发明人： Yossi Matias , Matthew Sharifi , Thomas Bugnon , Dominik Roblek , Annie Chen
IPC分类号： G11B27/00 , G11B27/034 , H04N5/04
CPC分类号： G11B27/034 , G11B27/10 , G11B27/28 , H04N5/04
摘要： Systems and methods for media aggregation are disclosed herein. The system includes a media system that can transform media items into one aggregated media item. A synchronization component synchronizes media items with respect to time. The synchronized media items can be analyzed and transformed into an aggregated media item for storage and/or display. In one implementation, the aggregated media item is capable of being displayed in multiple ways to create an enhanced and customizable viewing and/or listening experience.
摘要翻译：本文公开了用于介质聚集的系统和方法。该系统包括可将媒体项目转换为一个聚合媒体项目的媒体系统。同步组件相对于时间同步媒体项目。可以将同步的媒体项目分析并转换成用于存储和/或显示的聚合媒体项目。在一个实现中，聚合媒体项目能够以多种方式显示以创建增强的和可定制的观看和/或听觉体验。

8. 发明授权

US08364697B2 Method and system for creation and dynamic updating of best data arrangement in digital data store system 有权
标题翻译：数字数据存储系统中最佳数据排列的创建和动态更新的方法和系统
公开(公告)号：US08364697B2
公开(公告)日：2013-01-29
申请号：US12490981
申请日：2009-06-24
申请人： Yossi Matias , Guy Shaked , Vladimir Braverman , Victor Belyaev , Shahar Golan , Marina Sadetsky
发明人： Yossi Matias , Guy Shaked , Vladimir Braverman , Victor Belyaev , Shahar Golan , Marina Sadetsky
IPC分类号： G06F17/30
CPC分类号： G06F17/30424
摘要： The current invention is a method and a system for analyzing templates of queries, with different levels of precision. When the system of the current invention takes a decision to arrange data, these templates are used, and a single data arrangement object (HRBlob) is designed which may serve a single template or several templates and not just a single query. This approach has an important impact on data arrangement performance and on queries performance, since this approach may help many more queries to be handled using less data arrangement objects.
摘要翻译：本发明是用于分析不同级别精度的查询模板的方法和系统。当本发明的系统决定排列数据时，使用这些模板，并且设计单个数据排列对象（HRBlob），其可以提供单个模板或多个模板，而不仅仅是单个查询。这种方法对数据排列性能和查询性能有重要的影响，因为这种方法可以帮助使用较少的数据排列对象来处理更多的查询。

9. 发明申请

US20100103953A1 METHOD, APPARATUS AND COMPUTER-READABLE CODE FOR DATA COMPRESSION OF NETWORK PACKETS 有权
标题翻译：网络包数据压缩的方法，装置和计算机可读代码
公开(公告)号：US20100103953A1
公开(公告)日：2010-04-29
申请号：US12624441
申请日：2009-11-24
申请人： Yossi Matias , Raanan Refua
发明人： Yossi Matias , Raanan Refua
IPC分类号： H04J3/18
CPC分类号： H04L29/06027 , H04L65/607 , H04L69/04 , Y10S707/99942
摘要： Methods, apparatus and computer readable code for compression, encoding and decoding of units of data such as packets are disclosed. In some embodiments, methods, apparatus and computer readable code for transmitting and/or receiving the data packets (for example, transmitting from a sending location to a receiving location where packets are received) are provided. For at least some packets, a dictionary is determined from a respective group of packets, including a first set of historical packets and excluding a second set of historical packet. Each target packet is encoded and/or compressed and/or decoded using the respective dictionary. Optionally, the respective group of packet includes the actual target packet to be encoded and/or compressed and/or decoded. In some embodiments, respective group of packets from which the dictionary is determined includes packets that have not been acknowledged from the receiving location at the time of encoding, though embodiments where packets have been acknowledged are also disclosed.
摘要翻译：公开了用于诸如分组的数据单元的压缩，编码和解码的方法，装置和计算机可读代码。在一些实施例中，提供了用于发送和/或接收数据分组（例如，从发送位置发送到接收分组的接收位置）的方法，装置和计算机可读代码。对于至少一些分组，从包括第一组历史分组并且排除第二组历史分组的分组组确定字典。使用各自的字典对每个目标分组进行编码和/或压缩和/或解码。可选地，相应的分组组包括要编码和/或压缩和/或解码的实际目标分组。在一些实施例中，确定字典的相应组的分组包括在编码时从接收位置未被确认的分组，尽管也公开了分组被确认的实施例。

10. 发明授权

US06519593B1 Efficient bundle sorting 失效
标题翻译：有效的捆绑排序
公开(公告)号：US06519593B1
公开(公告)日：2003-02-11
申请号：US09461286
申请日：1999-12-15
申请人： Yossi Matias , Eran Segal
发明人： Yossi Matias , Eran Segal
IPC分类号： G06F1730
CPC分类号： G06F7/24 , G06F2207/224 , Y10S707/99937
摘要： Many data sets to be sorted consist of a limited number of distinct keys. Sorting such data sets can be thought of as bundling together identical keys and having the bundles placed in order; we therefore denote this as bundle sorting. We describe an efficient algorithm for bundle sorting in external memory that requires at most c(N/B)logM/Bk disk accesses, where N is the number of keys, M is the size of internal memory, k is the number of distinct keys, B is the transfer block size, and 2
摘要翻译：要排序的许多数据集由有限数量的不同键组成。将这样的数据集排序可以被认为是将相同的密钥捆绑在一起并使捆绑放置顺序; 因此，我们将其表示为捆绑排序。我们描述了外部存储器中捆绑排序的有效算法，最多需要c（N / B）logM / Bk磁盘访问，其中N是密钥数量，M是内部存储器的大小，k是不同密钥的数量 B为传输块大小，2

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式