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

1. 发明授权

US07801999B2 Binding heterogeneous transports to a message contract 有权
标题翻译：将异构传输绑定到消息合同
公开(公告)号：US07801999B2
公开(公告)日：2010-09-21
申请号：US11010999
申请日：2004-12-13
申请人： Jeffrey C. Schlimmer , David E. Langworthy
发明人： Jeffrey C. Schlimmer , David E. Langworthy
IPC分类号： G06F15/16 , G06F17/00
CPC分类号： H04L67/322 , H04L67/02 , H04L69/03 , H04L69/18
摘要： Example embodiments provide for a new set of binding extensions that allow individual messages within a contract of a Network Protocol Description Language data structure (e.g., a portType of a WSDL document or file) to flow over different transports and to different network transport addresses. Further, example embodiments provide for a concise expression of protocol choices through the use of a default element for specifying one of a plurality of binding mechanisms. Moreover, the present invention also provides for not only defining services within a document or data structure through standard URLs, but also for allowing the addressing of a service using an endpoint reference as defined by, e.g., WS-Addressing. This allows for a more robust way to address a service in a document by providing a lightweight, extensible, self-contained description of the service.
摘要翻译：示例性实施例提供允许网络协议描述语言数据结构（例如，WSDL文档或文件的端口类型）的合同内的各个消息流过不同传输和不同网络传输地址的新的绑定扩展集合。此外，示例性实施例通过使用用于指定多个绑定机制中的一个的默认元素来提供协议选择的简明表达。此外，本发明还提供不仅通过标准URL定义文档或数据结构内的服务，而且还允许使用例如由WS-Addressing定义的端点参考来对服务进行寻址。这允许通过提供轻量级的，可扩展的，自包含的服务描述来更有效地解决文档中的服务。

2. 发明授权

US07761584B2 Generalized protocol mapping 失效
标题翻译：广义协议映射
公开(公告)号：US07761584B2
公开(公告)日：2010-07-20
申请号：US10956849
申请日：2004-10-01
申请人： David E. Langworthy , Satish R. Thatte
发明人： David E. Langworthy , Satish R. Thatte
IPC分类号： G06F15/16
CPC分类号： H04L67/2823 , H04L67/02 , H04L67/28
摘要： Signals are mapped from one protocol to another protocol. A first protocol is received, and a mapping interface is generated to a second protocol. The first protocol is then mapped to the second protocol in accordance with the mapping interface. The mapping interface may comprise a coordination map. Moreover, a state diagram may be generated that is based on the first protocol, prior to mapping the first protocol to the second protocol. The first protocol may be an abstract protocol or a web services business activity protocol, for example, and the second protocol may be another abstract protocol, a concrete interface, a web services interface, a common language runtime interface, or a business process execution language for web services, for example.
摘要翻译：信号从一个协议映射到另一个协议。接收到第一协议，并且生成到第二协议的映射接口。然后根据映射界面将第一协议映射到第二协议。映射界面可以包括协调图。此外，在将第一协议映射到第二协议之前，可以生成基于第一协议的状态图。例如，第一协议可以是抽象协议或Web服务业务活动协议，并且第二协议可以是另一抽象协议，具体接口，Web服务接口，公共语言运行时接口或业务流程执行语言例如用于Web服务。

3. 发明申请

US20100088686A1 PROGRAMMING LANGUAGE WITH EXTENSIBLE SYNTAX 审中-公开
标题翻译：具有可扩展语言的编程语言
公开(公告)号：US20100088686A1
公开(公告)日：2010-04-08
申请号：US12325753
申请日：2008-12-01
申请人： David E. Langworthy , Bradford H. Lovering , Donald F. Box , Joshua Williams , Giovanni M. Della-Libera
发明人： David E. Langworthy , Bradford H. Lovering , Donald F. Box , Joshua Williams , Giovanni M. Della-Libera
IPC分类号： G06F9/45
CPC分类号： G06F8/41
摘要： The subject disclosure relates to an extensible syntax for a scripting language that allows data intensive applications to be written in a compact, human friendly, textual format, and also according to self-defined syntax within the data intensive applications so that a single compilation unit of a program can support multiple syntaxes. An extensible syntax is provided for M that allows alternate syntaxes to be defined in line and then used in the program so as to accommodate user-defined syntaxes and other pre-existing domain specific languages. In one embodiment, the alternate syntaxes can be defined at pre-designated functional points in the program.
摘要翻译：主题公开涉及用于脚本语言的可扩展语法，其允许以紧凑，人性化的文本格式写入数据密集型应用程序，并且还根据数据密集型应用程序中的自定义语法编写单个编译单元程序可以支持多种语法。为M提供了一种可扩展的语法，允许替代语法在行中定义，然后在程序中使用，以适应用户定义的语法和其他预先存在的特定于域的语言。在一个实施例中，可以在程序中的预先指定的功能点处定义替代语法。

4. 发明授权

US07693952B2 Availability and scalability in a messaging system in a manner transparent to the application 失效
标题翻译：消息系统中的可用性和可扩展性以对应用程序透明的方式
公开(公告)号：US07693952B2
公开(公告)日：2010-04-06
申请号：US10402052
申请日：2003-03-27
申请人： Rodney T. Limprecht , Richard D. Hill , David E. Langworthy , Hany Essam Ramadan , Shy Cohen
发明人： Rodney T. Limprecht , Richard D. Hill , David E. Langworthy , Hany Essam Ramadan , Shy Cohen
IPC分类号： G06F15/16
CPC分类号： H04L47/2433 , G06F9/546 , H04L47/10 , H04L47/125 , H04L47/30 , H04L67/14 , H04L67/325 , H04L69/329
摘要： Methods, systems, and computer program products that provide for a runtime messaging infrastructure, which abstracts send and receive operations for exchanging messages with partner endpoint. The messaging infrastructure improves availability and scalability of a message application by improving on the availability and scalability of the underlying message transports. In particular, availability and scalability are improved by linking the message application at runtime with any number of the message transports, without the message application specifying a transport at development time. The message infrastructure receives instructions from the message application specifying end-to-end delivery assurances. The infrastructure uses transports in order to fulfill the specified delivery assurance, and creates a link between the message application and transports for use in exchanging messages. Session state storage can be maintained in a pluggable store, which could be, for example, a durable database store or an application memory store.
摘要翻译：提供运行时消息传递基础设施的方法，系统和计算机程序产品，其提取与伙伴端点交换消息的发送和接收操作。消息传递基础设施通过改进底层消息传输的可用性和可扩展性来提高消息应用程序的可用性和可扩展性。特别地，通过将运行时的消息应用与任何数量的消息传输相关联而不需要在开发时指定传输的消息应用来改进可用性和可扩展性。消息基础设施从消息应用程序接收指定端到端传递保证的指令。基础设施使用传输来实现指定的传送保证，并在消息应用程序和传输之间创建链接以用于交换消息。会话状态存储可以维护在可插拔存储中，例如可以是耐用数据库存储或应用存储器存储。

5. 发明申请

US20080071801A1 TRANSFORMATION OF MODULAR FINITE STATE TRANSDUCERS 有权
标题翻译：模块化有限状态转换器的转换
公开(公告)号：US20080071801A1
公开(公告)日：2008-03-20
申请号：US11532349
申请日：2006-09-15
申请人： Steven E. Lucco , David E. Langworthy , Giovanni M. Della-Libera
发明人： Steven E. Lucco , David E. Langworthy , Giovanni M. Della-Libera
IPC分类号： G06F7/00
CPC分类号： G06F17/30961
摘要： A Q Framework, or QFX for short, is provided for performing efficient tree transformation in a generalized manner that achieves preservation of action semantics for FSTs that support action information in their representations across a diverse set of types of representations for FSTs. Among other features, the QFX also enables the preservation of ordered and unordered nest information while performing tree transformation, supports the transformation of non-deterministic data structures to a deterministic data structure and enables intersection operations on machines having action semantics.
摘要翻译：提供Q框架（简称QFX），用于以广义的方式执行高效的树型转换，从而实现了FST的动作语义的保留，从而支持FST的各种表示形式的支持动作信息。在其他功能中，QFX还能够在执行树型转换时保持有序和无序的嵌套信息，支持将非确定性数据结构转换为确定性数据结构，并在具有动作语义的机器上实现交叉操作。

6. 发明授权

US08135794B2 Availability and scalability in a messaging system in a manner transparent to the application 有权
标题翻译：消息系统中的可用性和可扩展性以对应用程序透明的方式
公开(公告)号：US08135794B2
公开(公告)日：2012-03-13
申请号：US12751627
申请日：2010-03-31
申请人： Rodney T. Limprecht , Richard D. Hill , David E. Langworthy , Hany Essam Ramadan , Shy Cohen
发明人： Rodney T. Limprecht , Richard D. Hill , David E. Langworthy , Hany Essam Ramadan , Shy Cohen
IPC分类号： G06F15/16
CPC分类号： H04L47/2433 , G06F9/546 , H04L47/10 , H04L47/125 , H04L47/30 , H04L67/14 , H04L67/325 , H04L69/329
摘要： Methods, systems, and computer program products that provide for a runtime messaging infrastructure, which abstracts send and receive operations for exchanging messages with partner endpoint. The messaging infrastructure improves availability and scalability of a message application by improving on the availability and scalability of the underlying message transports. In particular, availability and scalability are improved by linking the message application at runtime with any number of the message transports, without the message application specifying a transport at development time. The message infrastructure receives instructions from the message application specifying end-to-end delivery assurances. The infrastructure uses transports in order to fulfill the specified delivery assurance, and creates a link between the message application and transports for use in exchanging messages. Session state storage can be maintained in a pluggable store, which could be, for example, a durable database store or an application memory store.
摘要翻译：提供运行时消息传递基础设施的方法，系统和计算机程序产品，其提取与伙伴端点交换消息的发送和接收操作。消息传递基础设施通过改进底层消息传输的可用性和可扩展性来提高消息应用程序的可用性和可扩展性。特别地，通过将运行时的消息应用与任何数量的消息传输相关联而不需要在开发时指定传输的消息应用来改进可用性和可扩展性。消息基础设施从消息应用程序接收指定端到端传递保证的指令。基础设施使用传输来实现指定的传送保证，并在消息应用程序和传输之间创建链接以用于交换消息。会话状态存储可以维护在可插拔存储中，例如可以是耐久数据库存储或应用存储器存储。

7. 发明申请

US20100192129A1 SEMANTIC SUBTYPING FOR DECLARATIVE DATA SCRIPTING LANGUAGE BY CALLING A PROVER 有权
标题翻译：通过电子邮件提交声明数据描述语言的语义分类
公开(公告)号：US20100192129A1
公开(公告)日：2010-07-29
申请号：US12244988
申请日：2008-10-03
申请人： David E. Langworthy , Gavin Bierman , Andrew D. Gordon , Donald F. Box , Bradford H. Lovering , Jeffrey C. Schlimmer , John D. Doty
发明人： David E. Langworthy , Gavin Bierman , Andrew D. Gordon , Donald F. Box , Bradford H. Lovering , Jeffrey C. Schlimmer , John D. Doty
IPC分类号： G06F9/44
CPC分类号： G06F8/437
摘要： An efficient, logical and expressive type system supports the combination of refinement types and type membership expressions, as well as a top type that encompasses all valid values as members. Various embodiments verify the validity of subtyping relationships by translating to first-order logic, and invoking a general-purpose theorem prover with the first-order logic as input. In contrast to treating formulas as types, types are translated into formulas of standard first-order logic. Moreover, to represent data structures of the programming language as first-order logic, universal and existential quantifiers of first-order logic, and function symbols in terms, are exploited. Data intensive applications can be generated, verified, and deployed with greater speed and scale.
摘要翻译：一种高效，逻辑和表达型的系统支持细化类型和类型成员关系表达式的组合，以及包含所有有效值作为成员的顶级类型。各种实施例通过转换为一阶逻辑来验证子类型关系的有效性，并且以一阶逻辑作为输入来调用通用定理证明器。与将处理公式作为类型相反，类型被转换为标准一阶逻辑的公式。此外，为了将编程语言的数据结构表示为一阶逻辑，利用一阶逻辑的通用和存在量词，以及术语中的函数符号。可以以更快的速度和规模生成，验证和部署数据密集型应用程序。

8. 发明申请

US20100088672A1 COMPACT SYNTAX FOR DATA SCRIPTING LANGUAGE 有权
标题翻译：数据脚本语言的紧凑语法
公开(公告)号：US20100088672A1
公开(公告)日：2010-04-08
申请号：US12244949
申请日：2008-10-03
申请人： David E. Langworthy , Bradford H. Lovering , Donald F. Box , Douglas A. Walter , Giovanni M. Della-Libera , Jeffrey S. Pinkston , John D. Doty , John L. Hamby
发明人： David E. Langworthy , Bradford H. Lovering , Donald F. Box , Douglas A. Walter , Giovanni M. Della-Libera , Jeffrey S. Pinkston , John D. Doty , John L. Hamby
IPC分类号： G06F9/44
CPC分类号： G06F8/51 , G06F8/31
摘要： The subject disclosure relates to a syntax for a scripting language that allows data intensive applications to be written in a compact, human friendly, textual format. The scripting language can be a declarative programming language, such as the “D” programming language, which is well suited to the authoring of data intensive programs. A compact query syntax is provided for D that simplifies the expression of complex and data intensive programs. In another non-limiting aspect, conventional operator precedence is modified to accommodate the compact syntax and other unique features of a general purpose declarative programming language.
摘要翻译：主题公开涉及一种脚本语言的语法，其允许以紧凑，人性化的文本格式写入数据密集型应用。脚本语言可以是一种声明式编程语言，例如“D”编程语言，非常适合于编写数据密集型程序。为D提供了紧凑的查询语法，简化了复杂和数据密集型程序的表达。在另一个非限制性方面，修改常规运算符优先级以适应通用声明式编程语言的紧凑语法和其他独特特征。

9. 发明申请

US20100088665A1 TREE-BASED DIRECTED GRAPH PROGRAMMING STRUCTURES FOR A DECLARATIVE PROGRAMMING LANGUAGE 有权
标题翻译：基于树的指导性图形编程结构用于声明编程语言
公开(公告)号：US20100088665A1
公开(公告)日：2010-04-08
申请号：US12244959
申请日：2008-10-03
申请人： David E. Langworthy , John L. Hamby , Bradford H. Lovering , Donald F. Box
发明人： David E. Langworthy , John L. Hamby , Bradford H. Lovering , Donald F. Box
IPC分类号： G06F9/44
CPC分类号： G06F8/43 , G06F8/75
摘要： Embodiments of tree-based directed graph programming structures for a declarative programming language are provided. In various embodiments, complex graph structured data, referred to as “DGraphs” herein in one non-limiting implementation, is authored using a compact, human friendly syntax without the use of explicit identifiers. In one non-limiting aspect, the syntax includes support for conformance relationships, also referred to as factored relationships. In another non-limiting aspect, the semistructured graph data is a tree-based representation and the syntax includes lexical resolution of references or lexical scoping, and/or non local initialization.
摘要翻译：提供了一种用于声明式编程语言的基于树的有向图编程结构的实施例。在各种实施例中，在一个非限制性实现中，本文中称为“DGraph”的复杂图形结构化数据是使用紧凑的，人性化的语法而不使用显式标识符来创作的。在一个非限制性方面，语法包括对一致性关系的支持，也称为因子关系。在另一个非限制性方面，半结构图数据是基于树的表示，并且语法包括引用或词法作用域的词法解析和/或非本地初始化。

10. 发明授权

US07664723B2 Symbolic computation using an inverted match 失效
标题翻译：符号计算使用反向匹配
公开(公告)号：US07664723B2
公开(公告)日：2010-02-16
申请号：US11225307
申请日：2005-09-12
申请人： David E. Langworthy
发明人： David E. Langworthy
IPC分类号： G06F15/18 , G06F15/00 , G06N7/00 , G06N7/08
CPC分类号： G06F17/10
摘要： The transformation of a symbolic representation using an inverted match that represents an inverted form of a specific kind of non-linear match. The match is inverted around a particular reaction variable and merged on that variable after determining that the match represents a specific kind of non-linear identity that has at least one associative commutative operator, and in which each variable has one instance, except for the reaction variable, which has multiple instances in the match, at least one of the instances not being a direct argument of an associative commutative operator. The inverted match may then be applied to the symbolic expression to thereby transform the symbolic expression.
摘要翻译：使用表示特定类型的非线性匹配的反向形式的反向匹配来转换符号表示。在确定匹配表示具有至少一个关联交换算子的特定类型的非线性身份之后，该匹配在特定反应变量周围反转并合并在该变量上，并且其中每个变量具有一个实例，除了反应变量，其在匹配中具有多个实例，至少一个实例不是关联交换运算符的直接参数。然后可以将反转匹配应用于符号表达式，从而转换符号表达式。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式