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

1. 发明专利

JP2006216027A Mechanism for transferring raw data from one data structure to another representing the same item 有权
标题翻译：将原始数据从一个数据结构传输到另一个表示相同项目的机制
公开(公告)号：JP2006216027A
公开(公告)日：2006-08-17
申请号：JP2006010230
申请日：2006-01-18
申请人： Microsoft Corp , マイクロソフトコーポレーション
发明人： BOX DONALD F , PURDY DOUGLAS M , KAKIVAYA GOPALA KRISHNA R , JETHANANDANI NATASHA H , SRINIVASAN SOWMY K , PHARIES STEFAN H
IPC分类号： G06F12/00
CPC分类号： G06F17/30569 , Y10S707/99952 , Y10S707/99953
摘要： PROBLEM TO BE SOLVED: To transfer raw data from a source data structure to a target data structure that represents the same item. SOLUTION: During the data transfer, if there is a given field in the target data structure that does not correspond to a field supplied by the source data structure, the transfer mechanism determines whether or not it is mandatory that the source data structure supply the field. If it is mandatory, the transfer fails. Otherwise, the transfer continues. If there is field of the source data structure that does not correspond to a field of the target data structure, the transfer mechanism determines whether or not it is mandatory that the target data structure have the field. If it is mandatory, the transfer fails. Otherwise, the corresponding data may be provided to a residual field of the target data structure dedicated for unknown data. COPYRIGHT: (C)2006,JPO&NCIPI
摘要翻译：要解决的问题：将原始数据从源数据结构传输到表示相同项目的目标数据结构。解决方案：在数据传输过程中，如果目标数据结构中的给定字段与源数据结构提供的字段不对应，则传输机制确定是否强制源数据结构供应领域。如果是强制性的，转移失败。否则，转移继续。如果源数据结构的字段与目标数据结构的字段不对应，则传送机制确定目标数据结构是否具有该字段是强制性的。如果是强制性的，转移失败。否则，可以将相应的数据提供给专用于未知数据的目标数据结构的残留字段。版权所有（C）2006，JPO＆NCIPI

2. 发明专利

JP2006252536A Dynamic service generation for legacy component 有权
标题翻译： LEGACY组件的动态服务生成
公开(公告)号：JP2006252536A
公开(公告)日：2006-09-21
申请号：JP2006031113
申请日：2006-02-08
申请人： Microsoft Corp , マイクロソフトコーポレーション
发明人： MILLIGAN ANDREW D , BOX DONALD F , SYED HARRIS , FEINGOLD MAX ATTAR , ABRAHAM SAJI
IPC分类号： G06F15/00
CPC分类号： G06F9/547 , G06F8/30 , Y10S707/99939
摘要： PROBLEM TO BE SOLVED: To provide a mechanism that allows an administrative event to trigger or cause the generation of a dynamic web service during initialization of legacy application components.
SOLUTION: Similar to other types of static tooling approaches, the dynamic approach of the present invention uses available metadata describing an interface for communicating with legacy components. Rather than generating and manifesting the web service via tooling on a one time or occasional bases, however, example embodiments provide for the generation of the web service by the supporting infrastructure as a standard part of application initialization. Upon stopping the application, a termination sequence is provided that stops the corresponding dynamic web service and deletes the web service description used to generate the dynamic web service. Accordingly, every time the application is started, the available metadata will need to be consulted and a consistent service will be built immediately.
COPYRIGHT: (C)2006,JPO&NCIPI
摘要翻译：要解决的问题：提供一种机制，允许管理事件触发或导致在传统应用程序组件的初始化期间生成动态Web服务。解决方案：与其他类型的静态工具方法类似，本发明的动态方法使用描述用于与传统组件通信的接口的可用元数据。然而，示例实施例不是通过一次或偶尔的基础通过工具生成和呈现web服务，而是通过支持基础设施来生成作为应用程序初始化的标准部分的web服务。在停止应用程序时，提供终止序列，停止相应的动态Web服务并删除用于生成动态Web服务的Web服务描述。因此，每次启动应用程序时，都需要查询可用的元数据，并立即建立一致的服务。版权所有（C）2006，JPO＆NCIPI

3. 发明专利

JP2006004415A Flexible context management for enumerating session using context replacement 有权
标题翻译：使用上下文替换进行会话的灵活的上下文管理
公开(公告)号：JP2006004415A
公开(公告)日：2006-01-05
申请号：JP2005145601
申请日：2005-05-18
申请人： Microsoft Corp , マイクロソフトコーポレーション
发明人： GELLER ALAN S , BOX DONALD F , CABRERA LUIS F , MCCOLLUM RAYMOND W
IPC分类号： G06F13/00 , G06F3/05 , G06F17/30 , H04L12/16 , H04L29/06 , H04L29/08
CPC分类号： H04L67/06 , H04L67/02 , H04L69/329
摘要： PROBLEM TO BE SOLVED: To provide a mechanism for supplying data item required in an enumerating session of request-drive holding a control for an amount of context information between messages which a data provider holds. SOLUTION: The data provider identifies a part of data item which should be supplied in a first response as well as context information which reflects that a first part of information has been supplied. The data provider decides the amount of context which should be supplied for a system of a data receiver to supply an adequate context information for the data receiver. The data provider supplies a response including the first part of data item. The data receiver enables continuity of data transfer session by including the first supplied context information into a second requirement for the next part of the data item. COPYRIGHT: (C)2006,JPO&NCIPI
摘要翻译：要解决的问题：提供一种用于提供在数据提供者保持的消息之间持有对上下文信息量的控制的请求驱动的枚举会话中所需的数据项的机制。解决方案：数据提供者识别应该在第一响应中提供的数据项的一部分以及反映已经提供了第一部分信息的上下文信息。数据提供者决定为数据接收机的系统提供的上下文的数量，为数据接收机提供足够的上下文信息。数据提供者提供包括数据项的第一部分的响应。数据接收器通过将第一提供的上下文信息包括在数据项的下一部分的第二要求中来实现数据传输会话的连续性。版权所有（C）2006，JPO＆NCIPI

4. 发明专利

AT405086T 未知
公开(公告)号：AT405086T
公开(公告)日：2008-08-15
申请号：AT05104859
申请日：2005-06-03
申请人： MICROSOFT CORP
发明人： GELLER ALAN S , BOX DONALD F , CABRERA LUIS FELIPE , MCCOLLUM RAYMOND W
IPC分类号： H04L29/08 , G06F3/05 , G06F17/30 , H04L12/16 , H04L29/06
摘要： Mechanisms for providing requested date items in a request-driven enumeration session while retaining to control over how much inter-message context information is retained by the data provider. Upon receiving a request for the data items, the data provider identifies a portion of the data items to be provided in the first response along with context information that reflects that the first portion of information has been provided. The data provider then makes a determination of how much of the context is to be provided to the data receiver system, and then provides that appropriate context information to the data receiver. Furthermore, the data provider provides a response that includes the first portion of the data items. The data receiver includes this first provided context information in the second request for the next portion of the data items, allowing continuity in the data transfer session.

5. 发明申请

WO2009055757A3 DATA SCOPING AND DATA FLOW IN A CONTINUATION BASED RUNTIME 审中-公开
标题翻译：基于连续运行时的数据范围和数据流
公开(公告)号：WO2009055757A3
公开(公告)日：2009-09-17
申请号：PCT/US2008081237
申请日：2008-10-26
申请人： MICROSOFT CORP
发明人： WOLF KENNETH DAVID , PINTO EDMUND S V , SCHMIDT ROBERT B , TALBERT NATHAN C , MILLET STEPHEN J , BOX DONALD F
IPC分类号： G06F9/06 , G06F5/00 , G06F17/21
CPC分类号： G06F9/5038
摘要： Described is a data model used in a continuation based runtime that executes activities. The data model provides for declaring parameters to define data flow direction (in, out or both in and out) with respect to activities. The model further allows for the declaring of variables to provide for data storing and sharing between activities that are in scope, based on a tree relationship between activities. In one aspect, an activity tree includes a topmost parent composite activity and at least one child activity of that topmost parent composite activity. Variables are associated with one or more composite activities of the tree, and the ancestral relationships between composite activities and (non-composite) child activities determine the in-scope access to variables. Arguments such as binding expressions may bind variables to an activity's parameters.
摘要翻译：描述的是在基于延续的运行时中执行活动的数据模型。该数据模型提供了声明参数以定义关于活动的数据流方向（进，出或同时进出）。该模型还允许根据活动之间的树状关系声明变量以提供范围内活动之间的数据存储和共享。在一个方面，活动树包括最上面的父组合活动和该最上面的父组合活动的至少一个子活动。变量与树的一个或多个复合活动相关联，复合活动与（非复合）子活动之间的祖先关系决定了对变量的范围内访问。绑定表达式等参数可能会将变量绑定到活动的参数。

6. 发明申请

WO2007018774A3 LAMBDA EXPRESSIONS 审中-公开
标题翻译：林肯表达
公开(公告)号：WO2007018774A3
公开(公告)日：2007-05-24
申请号：PCT/US2006024567
申请日：2006-06-23
申请人： MICROSOFT CORP
发明人： MEIJER HENRICUS JOHANNES MARIA , HEJLSBERG ANDERS , BOX DONALD F , WARREN MATTHEW J , BOLOGNESE LUCA , KATZENBERGER GARY S , HALLAM PETER A , KULKARNI DINESH C
IPC分类号： G06F9/45
CPC分类号： G06F8/437 , G06F8/311 , G06F8/312
摘要： The subject disclosure pertains to lambda expressions and the employment of such expressions in imperative and/or object-oriented computer programming languages. Lambda expressions can be employed in conjunction with methods (e.g., arguments, assignment ) to provide a more concise and functional manner of code specification. Further, lambda expressions can participate in type inference and checking as well as overload resolution, among other things.
摘要翻译：主题公开涉及lambda表达式以及在命令式和/或面向对象的计算机编程语言中使用这种表达式。 Lambda表达式可以与方法（例如，参数，分配）一起使用，以提供更简洁和功能性的代码规范方式。此外，lambda表达式可以参与类型推断和检查以及重载分辨率等等。

7. 发明专利

IN2433CHN2014A DEVICE LINKING 未知
公开(公告)号：IN2433CHN2014A
公开(公告)日：2015-06-19
申请号：IN2433CHN2014
申请日：2014-03-31
申请人： MICROSOFT CORP
发明人： LIU MIN , DISCOLO ANTHONY V , LUI EDMUND HON SUM , LIM KEAN EE , ELGRAM RYAN B , BOX DONALD F , GUDGIN MARTIN J , XU ZHANGWEI , MANION TODD R , GARDNER GRANT , DEWEY JEREMY L , CUPALA SHIRAZ J , STEEB CURT A
IPC分类号： H04L12/12 , H04L12/16
摘要： Device linking is described. In one or more implementations data is maintained at a network service that describes characteristics of a plurality of devices that are associated with a user account of the network service. A communication is formed to be received by one of the plurality of devices that includes a portion of the data that pertains to another one of the plurality of devices and that is suitable by the receiving device to discover the other one of the plurality of devices to initiate a local network connection between the devices.

8. 发明申请

WO2010042372A3 PROGRAMMING LANGUAGE WITH EXTENSIBLE SYNTAX 审中-公开
标题翻译：使用可扩展语法编程语言
公开(公告)号：WO2010042372A3
公开(公告)日：2010-07-08
申请号：PCT/US2009059121
申请日：2009-09-30
申请人： MICROSOFT CORP
发明人： LANGWORTHY DAVID E , LOVERING BRADFORD H , BOX DONALD F , WILLIAMS JOSHUA , DELLA-LIBERA GIOVANNI M
IPC分类号： G06F9/45 , G06F9/04
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提供了一种可扩展的语法，允许按行定义替代语法，然后在程序中使用，以适应用户定义的语法和其他预先存在的领域特定语言。在一个实施例中，可以在程序中的预先指定的功能点处定义替代语法。

9. 发明申请

WO2010039893A3 TREE-BASED DIRECTED GRAPH PROGRAMMING STRUCTURES FOR A DECLARATIVE PROGRAMMING LANGUAGE 审中-公开
标题翻译：基于树的指导性图形编程结构用于声明编程语言
公开(公告)号：WO2010039893A3
公开(公告)日：2010-07-01
申请号：PCT/US2009059112
申请日：2009-09-30
申请人： MICROSOFT CORP
发明人： LANGWORTHY DAVID E , HAMBY JOHN L , LOVERING BRADFORD H , BOX DONALD F
IPC分类号： G06F17/00 , 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. 发明公开

EP2350867A4 TREE-BASED DIRECTED GRAPH PROGRAMMING STRUCTURES FOR A DECLARATIVE PROGRAMMING LANGUAGE 有权转让
标题翻译：树形编程结构，用于向图的编程声明式
公开(公告)号：EP2350867A4
公开(公告)日：2012-12-12
申请号：EP09818475
申请日：2009-09-30
申请人： MICROSOFT CORP
发明人： LANGWORTHY DAVID E , HAMBY JOHN L , LOVERING BRADFORD H , BOX DONALD F
IPC分类号： G06F17/00 , 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.

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式