Microsoft Technology Licensing, LLC

Pedram Faghihi Rezaei

Patrick John Baumgartner

Amir Netz

Robert Lovejoy Goodwin

Dragos Barac

Christopher Alan Hays

Karthik Pattabiraman

Janaina Barreiro Gambaro Bueno

Sitaramaswamy V Lanka

Adam Donald Wilson

Matthew J Longley

Javier Garcia Flynn

Cristian Petculescu

Bongshin Lee

Stephen James Millet

Bradford H Lovering

Eran Megiddo

Shahar Prish

Brad Olenick

Haroon Ahmed

Greg R Smith

William Emeric Aitken

Amy Nicole Forstrom

Diego M Oppenheimer

Noaa Avital

Simon David Kent

Sachin Patney

Quetzal Bradley

Abhinav Jain

Allison Tran

Krystian Krzysztof Walec

Greg Smith

Matt J Longley

This document relates to compilation of source code into services. One example method involves receiving input source code, identifying data dependencies in the input source code, and identifying immutability points in the input source code based at least on the data dependencies. The example method also involves converting at least some of the input source code occurring after the immutability points to one or more service modules.

Compilation and execution of source code as services

This document relates to orchestration and scheduling of services. One example method involves obtaining dependency information for an application. The dependency information can represent data dependencies between individual services of the application. The example method can also involve identifying runtime characteristics of the individual services and performing automated orchestration of the individual services into one or more application processes based at least on the dependency information and the runtime characteristics.

Orchestration and scheduling of services

A technique is described herein that intelligently deploys resources in a data center for a new program. The new program has, at least in part, unknown runtime characteristics. The technique involves collecting plural input factors that provide evidence of an expected runtime behavior of the new program. It does so by identifying at least one related program that differs from the new program, but has a specified degree of relatedness to the new program. The collecting operation then obtains information that describes an amount of resources that the related program(s) consume when run. Based on at least some of the plural input factors, the technique generates an estimated amount of resources that the new program is expected to consume when it is run. The technique then determines and deploys a configuration of resources in the data center that will provide the estimated amount of resources.

Estimating an amount of resources that a program is expected to consume in a data center

A technique is described herein for updating a running application that includes a plurality of program modules (e.g., services). The technique performs its updating operation without having to suspend the execution of the running application, and without reloading all of the program modules in the running application. The technique leverages a mapping component to map a calling program module's call to a function to a called program module that implements the function. A current application manifest provides mapping logic for use by the mapping component. In some examples, the technique also transforms data passed by the calling program module to conform to a data format expected by the called program module. This is appropriate when the calling program module and the called program module use different schemas to define the data.

Modifying program modules in running applications

The modifying of a natural language interpretation model for interpreting natural language queries. The system discovers modifications that one or more queriers made to one or more original query results of one or more natural language queries to generate one or more modified query results. The system then uses the discoveries to identify one or more changes to a natural language interpretation model that would result (given the same natural language queries) in one or more query results that more accurately reflect the one or more modified query results. The system the causes the natural language interpretation model to be modified with at least one of the one or more identified changes. Accordingly, over time, the natural language interpretation model may learn from observations of its own performance.

Observation-based query interpretation model modification

Presenting data from different data providers in a correlated fashion. A first query is performed on a first data set controlled by a first entity to capture a first set of data results. Then a second query is performed on a second data set controlled by a second entity to capture a second set of data results. A relationship ontology that correlates data stored in different data stores controlled by different entities is then consulted to identify one or more relationships between data in the selected results set and the second data set.

Cross-model filtering

Mechanisms to help a computing system respond to a request for information within a data model. After determining that there is insufficient information within the data model to respond to the request, the computing system identifies one or more additional data sources that are external to the data model and that contain information suitable to respond to the request. The computing system then automatically supplements the data model with at least one of such additional data sources. The computing system then responds to the request using the supplemented data model. In some embodiments, the supplementation is performed in advance of the request by analyzing the characteristics of the data model and/or by anticipating possible future requests. Thus, a data model grows automatically in response to particular usage of that data model to satisfy requests.

Automated supplementation of data model

Presenting data from different data providers in a correlated fashion. The method includes performing a first query on a first data set controlled by a first entity to capture a first set of data results. The method further includes performing a second query on a second data set controlled by a second entity to capture a second set of data results. The method includes receiving a selection of one or more results from the first data set. The method further includes using the one or more selected results, consulting a relationship ontology that correlates data stored in different data stores controlled by different entities, to identify one or more relationships between data in the selected results set and the second data set.

The description relates to an interactive digital display. One example includes a display device configured to receive user input and recognize commands relative to data visualizations. The system also includes a graphical user interface configured to be presented on the display device that allows users to interact with the data visualizations via the user commands.

Interactive digital displays

The techniques described herein determine configurations for data visualizations based on characteristics interpreted from input data. Input data including a plurality of images may be obtained. For instance, the input data may include one or more files containing images associated with an entity. The techniques disclosed herein may determine a characteristic, such as a primary color, based on the input data. The techniques disclosed herein may determine an individual entity or subject to be associated with the characteristic. Techniques disclosed herein also involve the generation of output data defining a visualization based on the characteristic. A rendering of the output data provides an indication of the individual entity or subject. In some configurations, a rendering of the output data provides a graphical association between data in a dataset and the individual entity or subject.

Intelligent configuration of data visualizations

Changes are managed in a multi-user database application environment. Proposed changes are collected, including changes to data, schema, and/or application descriptions. A user may specify foreign key relationships between items belonging to one or more of these categories. A view is produced showing the impact proposed changes would have on the environment if successfully committed. The user's proposed changes are ordered according to their dependencies, and submitted for committal together in a single transaction, subject to optimistic concurrency and consistency checks. For example, a proposed change to a data value may be inconsistent with a change which removed a data element containing the data value. The commitment operation may return identifiers and other return values, in addition to indicating whether the commitment was successful.

Unified concurrent changes to data, schema, and application

Growing community of inventors

Seattle, WA, United States of America

Pedram Faghihi Rezaei