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

1. 发明申请

US20150212715A1 TRANSFORMATION OF TABULAR DATA ACROSS MULTIPLE BROWSER VIEWPORTS 有权
标题翻译：通过多个浏览器浏览器来转换数据
公开(公告)号：US20150212715A1
公开(公告)日：2015-07-30
申请号：US14164174
申请日：2014-01-25
申请人： Microsoft Corporation
发明人： Rohan Singhal , Joel Schweitzer , Annice Jumani , Carolina Hernandez , Panuruj Khambanonda
IPC分类号： G06F3/0484 , G06F17/24
CPC分类号： G06F3/04847 , G06F3/1454 , G06F17/245
摘要： Systems and methods are disclosed regarding the reformatting tabular data in a browser on a client device received from a server. The browser on the client device is capable of being resized in a number of potential sizes—e.g., desktop browser viewport, laptop browser viewport, tablet browser viewport and mobile browser viewport. Tabular data may comprise main data, row data and associated column data. Depending on the browser viewport, one embodiment may dynamically position the tabular data so that the associated column data is displayed near its associated row data.
摘要翻译：公开了关于在从服务器接收的客户端设备上的浏览器中重新格式化表格数据的系统和方法。客户端设备上的浏览器能够以许多潜在的大小调整大小，例如桌面浏览器视口，笔记本电脑浏览器视口，平板电脑浏览器视口和移动浏览器视口。表格数据可以包括主数据，行数据和相关联的列数据。根据浏览器视口，一个实施例可以动态地定位表格数据，使得相关联的列数据显示在其关联的行数据附近。

2. 发明授权

US08667010B2 Database table partitioning allowing overlaps used in full text query 有权
标题翻译：数据库表分区，允许在全文查询中使用重叠
公开(公告)号：US08667010B2
公开(公告)日：2014-03-04
申请号：US13360052
申请日：2012-01-27
申请人： Enyuan Wu , Alan K. Michael , Wootaek Seo , Beom Seok Oh
发明人： Enyuan Wu , Alan K. Michael , Wootaek Seo , Beom Seok Oh
IPC分类号： G06F7/00
CPC分类号： G06F17/30584
摘要： Various embodiments provide a set of algorithms and scripts, e.g., SQL scripts, to perform automatic horizontal table and index partitioning that allows overlapping of data records, used in full-text search queries. In at least some embodiments, table creation and populating script is utilized to create a set of smaller tables partitioned by one column. In at least some embodiments, SELECT query modification script is provided to generate a query that works on the partitioned tables to achieve better performance. In at least some other embodiments, other query creation script is provided to modify the INSERT/UPDATE/DELETE queries for the original large table to automatically keep these queries synchronized with partitioned tables.
摘要翻译：各种实施例提供一组算法和脚本，例如SQL脚本，以执行允许在全文搜索查询中使用的数据记录的重叠的自动水平表和索引分割。在至少一些实施例中，使用表创建和填充脚本来创建由一列分割的一组较小的表。在至少一些实施例中，提供了SELECT查询修改脚本以生成在分区表上工作的查询以实现更好的性能。在至少一些其他实施例中，提供了其他查询创建脚本来修改原始大表的INSERT / UPDATE / DELETE查询以自动保持这些查询与分区表同步。

3. 发明授权

US07058224B2 Detecting multiple objects in digital image data 失效
标题翻译：检测数字图像数据中的多个对象
公开(公告)号：US07058224B2
公开(公告)日：2006-06-06
申请号：US11085412
申请日：2005-03-21
申请人： Cormac E. Herley
发明人： Cormac E. Herley
IPC分类号： G06K9/00
CPC分类号： H04N1/00766 , G06T7/12 , G06T2207/10008 , G06T2207/20061 , H04N1/00681 , H04N1/00689 , H04N1/00702 , H04N1/00737 , H04N1/00753
摘要： Apparatus and methods for detecting multiple images in digital image data are described. In one aspect, an edge map is generated from image data. The edge map is analyzed to determine a set of boundaries of the one or more objects by. This analysis is accomplished by: (a) determining a set of transitions between the set of boundaries and a background color; (b) identifying a set of characteristics from the set of transitions, wherein the set of characteristics are used to indicate whether the image data comprises a single object or whether the image data comprises a plurality of objects; and (c) if the image data corresponds to a plurality of objects, assigning particular ones of the set of boundaries to particular ones of the plurality of objects based on a set of rules. The one or more objects are segmented based on the set of boundaries.
摘要翻译：描述了用于检测数字图像数据中的多个图像的装置和方法。在一个方面，从图像数据生成边缘图。分析边缘图以确定一个或多个对象的一组边界。该分析是通过以下方式实现的：（a）确定一组边界与背景颜色之间的一组过渡; （b）从所述一组转换中识别一组特征，其中所述特征集用于指示所述图像数据是包括单个对象还是所述图像数据是否包括多个对象; 以及（c）如果所述图像数据对应于多个对象，则基于一组规则将所述一组边界的特定特征分配给所述多个对象中的特定对象。一个或多个对象基于边界集分割。

4. 发明授权

US6041053A Technique for efficiently classifying packets using a trie-indexed hierarchy forest that accommodates wildcards 失效
标题翻译：使用适合通配符的特里索引索引层次结构林来有效分类数据包的技术
公开(公告)号：US6041053A
公开(公告)日：2000-03-21
申请号：US933476
申请日：1997-09-18
申请人： John R. Douceur , Ofer Bar , Yoram Bernet
发明人： John R. Douceur , Ofer Bar , Yoram Bernet
IPC分类号： H04L12/56 , H04L12/28 , G06F15/16 , G06F17/30
CPC分类号： H04L47/2441 , H04L45/00 , H04L45/742 , H04L47/2408 , Y10S707/99933
摘要： A technique, specifically apparatus and accompanying methods, which utilizes a trie-indexed hierarchy forest ("rhizome") that accommodates wildcards for retrieving, given a specific input key, a pattern stored in the forest that is identical to or subsumes the key. The rhizome contains a binary search trie and a hierarchy forest. The search trie provides an indexed path to each unique, most specific, pattern stored in a lowest level of the hierarchy forest and also possibly to increasingly general patterns at higher levels in the pattern hierarchy. The hierarchy forest organizes the patterns into nodal hierarchies of strictly increasing generality. For use as a packet classifier, the rhizome stores wildcard-based packet classification patterns at separate corresponding pattern nodes, along with, corresponding "reference" fields associated therewith. Operationally, as each different queue is established or removed, a corresponding classification pattern is either inserted into or removed from the rhizome. A search key is formed for each packet, typically by concatenating classification fields, e.g. source and destination addresses and source and destination port designations, appearing in a header of the packet. The search key is then applied to the rhizome to determine whether that key exists therein, by virtue of either matching an identical classification pattern or being completely subsumed within a more general pattern stored therein. When such a classification is found, the classifier returns the contents of the associated reference field, which for scheduling, is a designation of a transmission queue to which the packet is to be directed.
摘要翻译：一种技术，具体是装置和伴随的方法，其利用特定索引层级林（“根茎”），其适应通配符，以在给定特定输入密钥的情况下检索与森林中存储的模式相同或包含密钥。根茎含有二分搜索特技和层级森林。搜索特技提供了存储在层次结构林的最低级别中的每个独特的，最具体的模式的索引路径，并且还可能在模式层次结构中的较高级别的日益普遍的模式。层次结构林将模式组织成具有严格增加的普遍性的节点等级。为了用作分组分类器，根茎在单独的相应模式节点上存储基于通配符的分组分类模式，以及与其相关联的相应“参考”字段。在操作上，随着每个不同的队列被建立或删除，相应的分类模式被插入或从根茎去除。通常通过连接分类字段来为每个分组形成搜索关键字，例如，源和目标地址以及出现在数据包标题中的源和目标端口名称。然后将搜索关键字应用于根茎，以通过匹配相同的分类模式或完全包含在其中存储的更一般的模式中来确定该密钥是否存在于其中。当发现这样的分类时，分类器返回相关联的参考字段的内容，其用于调度，是分组要被引导到的传输队列的指定。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式