会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 2. 发明申请
    • Methodology For Charging Of Discrete Resource Reservation Based Services
    • 基于离散资源预留服务的收费方法
    • US20130018764A1
    • 2013-01-17
    • US13180048
    • 2011-07-11
    • Yu DengThao N. NguyenChang-Shing PerngRandy A. RendahlAnca SailerGrzegorz M. Swirszcz
    • Yu DengThao N. NguyenChang-Shing PerngRandy A. RendahlAnca SailerGrzegorz M. Swirszcz
    • G06Q30/00
    • G06Q30/04
    • Methods, apparatus, and articles of manufacture are disclosed. These perform the following: accessing records of previous usage within a billing period of service units for customers, wherein the service units are discrete sizes of services for resource types, wherein each usage of an individual one of the service units has start and stop events, and wherein each resource type has a price fixed as of a date of the previous usage; dividing the billing period into time periods determined using the start and stop events for the usage of all of the service units; using the accessed records and the time periods and based on one or more criteria, assigning resource types to the previous usage in the time periods of the service units by the customers; and determining total charge for a selected customer based on the assignments of the resource types and corresponding prices for the selected customer.
    • 公开了方法,装置和制品。 这些执行以下操作:访问用于客户的服务单元的计费周期内的先前使用的记录,其中服务单元是用于资源类型的服务的离散大小,其中服务单元中的每个服务单元的每个使用具有开始和停止事件, 并且其中每个资源类型具有从先前使用的日期固定的价格; 将计费周期划分为使用所有服务单元的使用的开始和结束事件确定的时间段; 使用访问的记录和时间段并且基于一个或多个标准,在客户的服务单元的时间段内将资源类型分配给先前的使用; 以及基于所选择的客户的资源类型和对应价格的分配来确定所选客户的总费用。
    • 5. 发明申请
    • Query integrity assurance in database outsourcing
    • 查询数据库外包的完整性保证
    • US20080183656A1
    • 2008-07-31
    • US11626847
    • 2007-01-25
    • Chang-Shing PerngHaixun WangJian YinPhilip S. Yu
    • Chang-Shing PerngHaixun WangJian YinPhilip S. Yu
    • G06F17/30
    • G06F21/64G06F17/30286G06F21/6245G06F2221/2115
    • A method, system and computer program product for confirming the validity of data returned from a data store. A data store contains a primary data set encrypted using a first encryption and a secondary data set using a second encryption. The secondary data set is a subset of the primary data set. A client issues a substantive query against the data store to retrieve a primary data result belonging to the primary data set. A query interface issues at least one validating query against the data store. Each validating query returns a secondary data result belonging to the secondary data set. The query interface receives the secondary data result and provides a data invalid notification if data satisfying the substantive query included in an unencrypted form of the secondary data result is not contained in an unencrypted form of the primary data result.
    • 一种用于确认从数据存储返回的数据的有效性的方法,系统和计算机程序产品。 数据存储包含使用第一加密加密的主数据集和使用第二加密的辅数据集。 辅助数据集是主数据集的子集。 客户端对数据存储器发出实质性查询以检索属于主数据集的主数据结果。 查询界面对数据存储区发出至少一个验证查询。 每个验证查询返回属于辅助数据集的辅助数据结果。 如果满足辅助数据结果的未加密形式的实质性查询的数据未包含在主数据结果的未加密形式中,则查询接口接收辅助数据结果并提供数据无效通知。
    • 6. 发明申请
    • METHOD FOR FAST RELEVANCE DISCOVERY IN TIME SERIES
    • 时间序列中快速相关发现的方法
    • US20080177813A1
    • 2008-07-24
    • US11563900
    • 2006-11-28
    • Haixun WangChang-Shing Perng
    • Haixun WangChang-Shing Perng
    • G06F17/15
    • G06K9/00536
    • A method for measuring time series relevance using state transition points, including inputting time series data and relevance threshold data. Then convert all time series values to ranks within [0,1] interval. Calculate the valid range of the transition point in [0,1]. Afterwards, a verification occurs that a time series Z exists for each pair of time series Z and Y, such that the relevances between X and Z, and between Y and Z are known. Then deduce the relevance of X and Y. The relevance of X and Y must be at least one of, (i) higher, and (ii) lower than, the given threshold. Provided Z is found terminate all remaining calculations for X and Y. Otherwise, segment the time series if no Z time series exists, use the segmented time series to estimate the relevance. Apply a hill climbing algorithm in the valid range to find the true relevance.
    • 一种使用状态转换点来测量时间序列相关性的方法,包括输入时间序列数据和相关阈值数据。 然后将所有时间序列值转换为[0,1]间隔内的等级。 计算[0,1]中转换点的有效范围。 之后,对于每对时间序列Z和Y存在时间序列Z的验证,使得X和Z之间,以及Y和Z之间的相关性是已知的。 然后推导X和Y的相关性.X和Y的相关性必须至少为(i)较高和(ii)低于给定阈值中的一个。 如果Z被找到终止X和Y的所有剩余计算。否则,如果没有Z时间序列,则分段时间序列,使用分段时间序列来估计相关性。 在有效范围内应用爬山算法来找到真正的相关性。