会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 5. 发明授权
    • Multidimensional indexing structure for use with linear optimization queries
    • 用于线性优化查询的多维索引结构
    • US06408300B1
    • 2002-06-18
    • US09360366
    • 1999-07-23
    • Lawrence David BergmanVittorio CastelliYuan-Chi ChangChung-Sheng LiJohn Richard Smith
    • Lawrence David BergmanVittorio CastelliYuan-Chi ChangChung-Sheng LiJohn Richard Smith
    • G06F1730
    • G06F17/30333Y10S707/99934Y10S707/99942Y10S707/99945Y10S707/99948
    • Linear optimization queries, which usually arise in various decision support and resource planning applications, are queries that retrieve top N data records (where N is an integer greater than zero) which satisfy a specific optimization criterion. The optimization criterion is to either maximize or minimize a linear equation. The coefficients of the linear equation are given at query time. Methods and apparatus are disclosed for constructing, maintaining and utilizing a multidimensional indexing structure of database records to improve the execution speed of linear optimization queries. Database records with numerical attributes are organized into a number of layers and each layer represents a geometric structure called convex hull. Such linear optimization queries are processed by searching from the outer-most layer of this multi-layer indexing structure inwards. At least one record per layer will satisfy the query criterion and the number of layers needed to be searched depends on the spatial distribution of records, the query-issued linear coefficients, and N, the number of records to be returned. When N is small compared to the total size of the database, answering the query typically requires searching only a small fraction of all relevant records, resulting in a tremendous speedup as compared to linearly scanning the entire dataset.
    • 通常在各种决策支持和资源规划应用中出现的线性优化查询是检索满足特定优化标准的前N个数据记录(其中N是大于零的整数)的查询。 优化标准是最大化或最小化线性方程。 查询时给出线性方程的系数。 公开了用于构建,维护和利用数据库记录的多维索引结构以提高线性优化查询的执行速度的方法和装置。 具有数值属性的数据库记录被分为多个层,每个层表示一个称为凸包的几何结构。 通过从该多层索引结构的最外层向内搜索来处理这样的线性优化查询。 每层至少一个记录将满足查询条件,需要搜索的层数取决于记录的空间分布,查询发出的线性系数,N,要返回的记录数。 当N与数据库的总大小相比较小时,回答查询通常只需要搜索所有相关记录的一小部分,与线性扫描整个数据集相比,导致了巨大的加速。
    • 7. 发明授权
    • Apparatus and methods for auctioning time and desktop space to product and service suppliers
    • 为产品和服务供应商拍摄时间和桌面空间的设备和方法
    • US07870053B1
    • 2011-01-11
    • US09670446
    • 2000-09-26
    • Lawrence BergmanYuan-Chi ChangRichard HanChung-Sheng LiJohn R. Smith
    • Lawrence BergmanYuan-Chi ChangRichard HanChung-Sheng LiJohn R. Smith
    • G06Q40/00
    • G06Q30/08G06Q30/02G06Q40/04
    • Apparatus and methods for auctioning time and desktop space to product and service suppliers are provided. The apparatus and methods obtain bids from various product and service suppliers and determine which of the bids are the highest ranking bids. The particular product and service suppliers from which bids are obtained may be determined based on user preferences stored in a user profile, for example. Based on the ranking of the bids, commercial information from the product and/or service suppliers is presented to the user. Higher ranking bids are provided with larger display space on a user's client device display and are provided with a longer display time before cycling to the next lower ranking bid. In addition, multiple displays of commercial information may be provided at a same time with the size and duration of the displays being determined based on the ranking of the associated bid from the product/service supplier.
    • 提供了向产品和服务供应商拍卖时间和桌面空间的设备和方法。 设备和方法从各种产品和服务供应商获得投标,并确定哪些出价是最高的出价。 例如,可以基于存储在用户简档中的用户偏好来确定获得投标的特定产品和服务供应商。 基于出价的排名,向用户呈现来自产品和/或服务供应商的商业信息。 更高排名的出价在用户的客户端设备显示器上具有更大的显示空间,并且在循环到下一个较低排名出价之前被提供较长的显示时间。 此外,可以同时提供商业信息的多个显示器,其中显示器的尺寸和持续时间是基于来自产品/服务供应商的相关联的投标的等级来确定的。
    • 9. 发明授权
    • Method and apparatus for opportunistic decision support from intermittent interconnected sensors and data archives
    • 来自间歇性互连传感器和数据档案的机会性决策支持的方法和装置
    • US06915239B2
    • 2005-07-05
    • US10047854
    • 2002-01-16
    • Lawrence D. BergmanYuan-Chi ChangMatthew Leon HillChung-Sheng LiJohn R. Smith
    • Lawrence D. BergmanYuan-Chi ChangMatthew Leon HillChung-Sheng LiJohn R. Smith
    • G01S7/00G06F17/30H04L29/08H04Q9/00
    • H04L67/10G01S7/003H04L67/12H04L67/125H04L69/329
    • Described is a method and apparatus for obtaining accurate, timely information for event detection and prediction based on autonomous opportunism. The objective is to make the best possible use of all available resources at the time of acquisition, including historical data, multiple sensors, and multiresolution acquisition capabilities, under a given set of processing and communication bandwidth constraints. This method (and the corresponding apparatus) fuses multiple adaptively acquired data sources to prepare information for use by decision support models. The onboard data acquisition schedule is constructed to maximize the prediction accuracy of the decision models, which are designed to operate progressively, utilizing data representations consisting of multiple abstraction levels and multiple resolutions. Due to the progressive nature of these models, they can be executed onboard even with the use of substantially summarized (or compressed) datasets delivered from the ground or from other satellite platforms. Models are formulated to accept data with less than complete certainty, thus allowing real-time decisions to be made on locations where additional data is to be acquired based on predicted likelihood of the event of interest and uncertainties. Multi-abstraction-level multi-resolution data is expressed using standard-compliant representations, and progressively transmitted to the ground or other platforms. More detailed calculations can then be performed on the ground using all of the available real time and historical data.
    • 描述了一种用于基于自主机会主义获得准确,及时的事件检测和预测信息的方法和装置。 目标是在给定的一组处理和通信带宽约束下,在获取时尽可能最好地利用所有可用资源,包括历史数据,多个传感器和多分辨率获取功能。 该方法(和相应的装置)融合多个自适应采集的数据源,以准备供决策支持模型使用的信息。 构建车载数据采集计划,以最大化决策模型的预测精度,其被设计为逐步运行,利用由多个抽象级别和多个分辨率组成的数据表示。 由于这些模型的渐进性,即使使用从地面或其他卫星平台传送的基本总结(或压缩)数据集,它们也可以在船上执行。 模型被制定为接受不完全确定性的数据,从而允许根据预期的兴趣事件和不确定性的可能性来获取附加数据的位置进行实时决策。 多抽象级多分辨率数据使用符合标准的表示法表示,并逐渐传输到地面或其他平台。 然后可以使用所有可用的实时和历史数据在地面上执行更详细的计算。
    • 10. 发明授权
    • Methods and apparatus for processing ranked fuzzy cartesian queries
    • 用于处理排名模糊笛卡尔查询的方法和装置
    • US06778946B1
    • 2004-08-17
    • US09690378
    • 2000-10-17
    • Yuan-Chi ChangChung-Sheng Li
    • Yuan-Chi ChangChung-Sheng Li
    • G06F1727
    • G06F17/30259
    • Ranked fuzzy cartesian queries request top-K composite objects in a multimedia database. These composite objects, comprising multiple simple objects with their relations specified, are ranked by a fuzzy AND score of individual object properties and their fuzzy relations. Ranked fuzzy cartesian queries appeared in many different applications but were not fully exploited because of high computational complexity. In accordance with the present invention, methods and apparatus are provided for preprocessing a ranked fuzzy cartesian query to prune candidates which will not appear in the final top-K composite objects. Algorithms for processing queries against two simple objects and against three or more simple objects are separately described. These algorithms use a bound-and-prune technique to determine the candidates which can be removed from the search space. Disclosed methods are guaranteed to have no false dismissal.
    • 排序的模糊笛卡尔查询请求多媒体数据库中的顶部K个复合对象。 这些复合对象包括具有指定关系的多个简单对象,通过各个对象属性的模糊AND分数及其模糊关系进行排序。 排序的模糊笛卡尔查询出现在许多不同的应用程序中,但由于计算复杂度高,没有被充分利用。 根据本发明,提供了用于预处理排序的模糊笛卡尔查询以修剪将不出现在最后的顶部K个复合对象中的候选者的方法和装置。 单独描述用于处理针对两个简单对象和针对三个或更多简单对象的查询的算法。 这些算法使用绑定和剪枝技术来确定可以从搜索空间中删除的候选。 披露的方法保证不会被错误的解雇。