会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明申请
    • EXECUTION OF SEMANTIC QUERIES USING RULE EXPANSION
    • 使用规则扩展的语义查询的执行
    • US20100250576A1
    • 2010-09-30
    • US12416103
    • 2009-03-31
    • Stuart M. BowersChris Demetrios KarkaniasDavid B. Wecker
    • Stuart M. BowersChris Demetrios KarkaniasDavid B. Wecker
    • G06F17/30G06F7/00
    • G06F17/30427G06F17/30407
    • A semantic query may refer to a logical rule, where the rule is defined in terms of constituent expressions. In order to execute the semantic query efficiently, occurrences of the rule may be expanded by replacing the rule with its constituent expressions. Expansion may be performed repeatedly, until only grounded expressions remain. Expressions are grounded when they refer to tables or views that are represented in an underlying database. Once the rule has been reduced to grounded expressions, the semantic query processor may formulate a relational query in terms of the grounded expressions. If the relational query takes into account the various grounded expressions to which the rule reduces, then the portion of the semantic query that refers to the rule may be processed without an excessive number of round trips to the relational database.
    • 语义查询可以指逻辑规则,其中规则是根据组成表达式定义的。 为了有效执行语义查询,可以通过用其组成表达式替换规则来扩展规则的出现。 可以重复执行扩展,直到只剩下接地的表达。 当表达式引用在基础数据库中表示的表或视图时,表达式是基础的。 一旦将规则减少到接地表达式,语义查询处理器可以根据接地表达式制定关系查询。 如果关系查询考虑了规则减少的各种接地表达式,则可以处理引用规则的语义查询的部分,而不会对关系数据库进行过多的往返次数。
    • 2. 发明授权
    • Execution of semantic queries using rule expansion
    • 使用规则扩展执行语义查询
    • US08032525B2
    • 2011-10-04
    • US12416103
    • 2009-03-31
    • Stuart M. BowersChris Demetrios KarkaniasDavid B. Wecker
    • Stuart M. BowersChris Demetrios KarkaniasDavid B. Wecker
    • G06F17/30
    • G06F17/30427G06F17/30407
    • A semantic query may refer to a logical rule, where the rule is defined in terms of constituent expressions. In order to execute the semantic query efficiently, occurrences of the rule may be expanded by replacing the rule with its constituent expressions. Expansion may be performed repeatedly, until only grounded expressions remain. Expressions are grounded when they refer to tables or views that are represented in an underlying database. Once the rule has been reduced to grounded expressions, the semantic query processor may formulate a relational query in terms of the grounded expressions. If the relational query takes into account the various grounded expressions to which the rule reduces, then the portion of the semantic query that refers to the rule may be processed without an excessive number of round trips to the relational database.
    • 语义查询可以指逻辑规则,其中规则是根据组成表达式定义的。 为了有效执行语义查询,可以通过用其组成表达式替换规则来扩展规则的出现。 可以重复执行扩展,直到只剩下接地的表达。 当表达式引用在基础数据库中表示的表或视图时,表达式是基础的。 一旦将规则减少到接地表达式,语义查询处理器可以根据接地表达式制定关系查询。 如果关系查询考虑了规则减少的各种接地表达式,则可以处理引用规则的语义查询的部分,而不会对关系数据库进行过多的往返次数。
    • 3. 发明申请
    • OPTIMIZING QUANTUM SIMULATIONS BY INTELLIGENT PERMUTATION
    • 通过智能化优化优化量子模拟
    • US20140039866A1
    • 2014-02-06
    • US13567311
    • 2012-08-06
    • David B. Wecker
    • David B. Wecker
    • G06F9/44
    • G06N99/00G06F9/455G06F19/701G06N99/002
    • A state (i.e., ket) of a set of qubits may be simulated via a classical computer. Ordering characteristics of the ket (i.e., the “current” permutation associated with the state) may be determined. An operator (which may be associated with a certain operation to perform on the ket) may be defined and simulated. Ordering characteristics of the operator (i.e., the “current” permutation associated with operator) may be determined. If the current permutations of the state and operator match, then the operation may be performed to generate a new ket. Alternatively, the operator may be permuted to match the permutation of the current state. Or the state may be permuted to match the current operator permutation. The operation may then be performed, and the state and permutation remembered for the next operation. The process may be repeated for each operation in the series.
    • 一组量子位集合的状态(即,ket)可以经由古典计算机模拟。 可以确定ket的排序特征(即,与状态相关联的“当前”排列)。 可以定义和模拟操作者(其可以与在ket上执行的某个操作相关联)。 可以确定操作者的排序特征(即,与操作者相关联的“当前”排列)。 如果状态和操作符的当前排列匹配,则可以执行操作以产生新的消息。 或者,操作者可以被置换以匹配当前状态的置换。 或者可以将状态置换以匹配当前的运算符排列。 然后可以执行操作,并记住下一个操作的状态和置换。 该系列中的每个操作可以重复该过程。
    • 4. 发明授权
    • Method for automatically and intelligently scrolling handwritten input
    • 自动和智能滚动手写输入的方法
    • US06256009B1
    • 2001-07-03
    • US09256525
    • 1999-02-24
    • Charlton E. LuiDan W. AltmanDavid B. Wecker
    • Charlton E. LuiDan W. AltmanDavid B. Wecker
    • G09G534
    • G06F3/04883G06F3/0485
    • A method for automatically and intelligently scrolling handwritten ink entered into a computer device. The method detects when the user is on the last available line for writing, and starts a timer on each pen-up event or resets the timer on a pen-down event. An automatic scroll is performed after the writing on the last line has halted for more than a threshold amount of time. The threshold time may be variable based on criteria, such as the x-coordinate of the last writing, the writing speed of the user, the last character that was written, and the current zoom percentage of the display. The zoom percentage may also be used to determine the number of lines to scroll. New ink written after the automatic scrolling operation may be moved up to the scrolled ink, if the method determines that the user intended to write the new ink directly after the scrolled ink.
    • 用于自动和智能地滚动输入计算机设备的手写墨水的方法。 该方法检测用户何时在最后一个可用行上进行写入,并在每个笔记事件上启动一个计时器,或者在一个笔直的事件中复位定时器。 在最后一行的写入停止超过阈值时间后执行自动滚动。 阈值时间可以基于诸如最后写入的x坐标,用户的写入速度,写入的最后一个字符以及显示器的当前缩放百分比等标准来变化。 缩放百分比也可用于确定要滚动的行数。 如果方法确定用户打算在滚动墨水之后直接写入新墨水,则可以将自动滚动操作之后写入的新墨水移动到滚动墨水。
    • 5. 发明申请
    • QUANTUM GATE OPTIMIZATIONS
    • 量子优化
    • US20140040849A1
    • 2014-02-06
    • US13567330
    • 2012-08-06
    • David B. Wecker
    • David B. Wecker
    • G06F17/50
    • G06F17/5022G06F17/5036G06F17/5045G06F17/5068G06F17/5077G06N99/002
    • Disclosed are systems and methods for improving quantum computation simulation execution time by “growing” sets of small quantum gates into larger ones. Two approaches are described. In the first approach, sub-strings may be replaced by a single representative that may be used multiple times throughout the quantum circuit. In the second approach, nearby gates may be coalesced in an iterative fashion, to thereby build larger and larger gates. Results may be cached for re-use. Both of these approaches have proven effective and have gained typical simulation speed-ups of 1-2 orders of magnitude.
    • 公开的是通过将小量子门组“增长”成较大的量子来提高量子计算模拟执行时间的系统和方法。 描述两种方法。 在第一种方法中,子串可以由可以在整个量子电路中多次使用的单个代表代替。 在第二种方法中,附近的门可以以迭代方式合并,从而构建更大和更大的门。 结果可能被缓存以供重新使用。 这两种方法已被证明是有效的,并且已经获得了1-2个数量级的典型的模拟加速。
    • 6. 发明授权
    • Personal communications server
    • 个人通信服务器
    • US08311517B2
    • 2012-11-13
    • US11949238
    • 2007-12-03
    • Richard I. BrassDavid B. Wecker
    • Richard I. BrassDavid B. Wecker
    • H04M3/42H04B7/00H04M1/00B60R25/04B60R25/10
    • B60R25/24B60R2325/101H04L67/02H04L69/329
    • An improved system and method for a personal communications server is provided. The system and method may provide seamless multi-functional wireless communications for different integrated applications desired by a user. To this end, a computing device with a telecommunications interface is provided for coupling to a mobile phone network. The computing device may be without an attached audio input and output device, but may include a network interface for coupling with an external audio input and output device to receive audio from the mobile phone network and/or to send audio to the mobile network. A computer with a network interface may also be coupled with the computing device to receive data from a mobile phone network and/or to send data to the mobile network.
    • 提供了一种用于个人通信服务器的改进的系统和方法。 该系统和方法可以为用户期望的不同集成应用提供无缝的多功能无线通信。 为此,提供具有电信接口的计算设备用于耦合到移动电话网络。 计算设备可以没有附加的音频输入和输出设备,但是可以包括用于与外部音频输入和输出设备耦合以从移动电话网络接收音频和/或向移动网络发送音频的网络接口。 具有网络接口的计算机还可以与计算设备耦合以从移动电话网络接收数据和/或向移动网络发送数据。
    • 8. 发明申请
    • LANGUAGE INTEGRATION VIA FUNCTION REDIRECTION
    • 语言集成通过功能重定向
    • US20140053132A1
    • 2014-02-20
    • US13589719
    • 2012-08-20
    • David B. Wecker
    • David B. Wecker
    • G06F9/44
    • G06F9/443G06F9/449
    • Systems and methods for language integration via function redirection are disclosed herein in connection with simulation of quantum computations on classical computers. A base class that all of the functions of a group will instantiate in their context may be defined. The functions may take arguments that may be passed to a member of the base class for dispatch. A dispatcher may be provided to analyze the current context. The dispatcher may perform any of a number of operations as a result, including, but not limited to, passing the arguments to the class instance for execution, returning the class instance directly or via a context holder, returning a new representation of the function for future execution via a context holder, or any other return type that may be desired.
    • 本文结合经典计算机上的量子计算的模拟来公开通过功能重定向进行语言集成的系统和方法。 可以定义组的所有功能在其上下文中实例化的基类。 函数可能会引用可以传递给基类的成员进行调度的参数。 可以提供调度器来分析当前上下文。 调度员可以执行多个操作中的任何一个操作,包括但不限于将参数传递给类实例以执行,直接返回类实例或通过上下文持有者返回该类函数的新表示, 通过上下文持有者的未来执行,或可能需要的任何其他返回类型。
    • 10. 发明授权
    • Language integration via function redirection
    • 通过功能重定向进行语言集成
    • US09292304B2
    • 2016-03-22
    • US13589719
    • 2012-08-20
    • David B. Wecker
    • David B. Wecker
    • G06F9/45G06F9/44
    • G06F9/443G06F9/449
    • Systems and methods for language integration via function redirection are disclosed herein in connection with simulation of quantum computations on classical computers. A base class that all of the functions of a group will instantiate in their context may be defined. The functions may take arguments that may be passed to a member of the base class for dispatch. A dispatcher may be provided to analyze the current context. The dispatcher may perform any of a number of operations as a result, including, but not limited to, passing the arguments to the class instance for execution, returning the class instance directly or via a context holder, returning a new representation of the function for future execution via a context holder, or any other return type that may be desired.
    • 本文结合经典计算机上的量子计算的模拟来公开通过功能重定向进行语言集成的系统和方法。 可以定义组的所有功能在其上下文中实例化的基类。 函数可能会引用可以传递给基类的成员进行调度的参数。 可以提供调度器来分析当前上下文。 调度员可以执行多个操作中的任何一个操作,包括但不限于将参数传递给类实例以执行,直接返回类实例或通过上下文持有者返回该类函数的新表示, 通过上下文持有者的未来执行,或可能需要的任何其他返回类型。