Abstract: Taking action based on a physical graph. The taking of actions occurs with the use of an agent that interprets command(s) (such as natural language commands) from a user. The agent responds to the command(s) by formulating at least one query against a physical graph that represents state of one or more physical entities within a physical space and observed by a plurality of sensors. The agent then uses the query or queries against the physical graph. In response to the responses thereto, the agent identifies actions to take. Such actions could include actions such as presenting information to the user, and sending communications out to others. However, the actions could even include physical actions. For instance, the agent might include a physical action engine that performs physical actions (such as via a robot or drone).

Abstract: The managing of sensed signals used to sense features of physical entities over time. A computer-navigable graph of sensed features is generated. For each sensed feature, a signal segment that was used to sense that feature is computer-associated with the sensed feature. Later, the graph of sensed features may be navigated to that features. The resulting signal segment(s) may then be access allowing for rendering of the signal evidence that resulted in the sensed feature. Accordingly, the principles described herein allow for sophisticated and organized navigation to sensed features of physical entities in the physical world, and allow for rapid rendering of the signals that evidence that sensed features.

Abstract: Facilitating navigation of a computer-navigable graph of sensed features that were gathered by recognition or estimation of one or more features of physical entities that were sensed over time by sensor(s) within a physical space. The computer-navigable graph includes multiple nodes including multiple signal segment nodes and multiple feature nodes. Each of at least some of the signal segment nodes evidence feature(s) represented in feature node(s). Navigation is facilitated by, for each of multiple signal segment nodes, identifying relationship(s) between the corresponding signal segment node and other node(s) of the graph. At navigation time, when a user navigates to the corresponding signal segment nodes, a visualization of any detected relationship may be rendered to the user. When the user interacts with the rendering in such a way as to select the relationship, the user is navigated to the other node.

Abstract: The tracking of physical entities within a space such that computer-implemented computations (or ambient computing) may be performed on the features and/or activity of physical entities within that physical space. A space-time data structure corresponding to the physical space is set up. For at least one physical entity within that physical space, physical feature(s) of the physical entity is sensed at different instances in time. That sensed feature is stored in an entity data structure that is associated with the space-time data structure. This may be done for multiple physical entities within the location using multiple entity data structures that are each associated with the space-time data structure. A computing system may navigate such a space-time data structure to perform computation on physical entities, physical features and physical activity within that physical space.

Abstract: The automatic formulation of a plan for concurrent movement of physical entities within a physical space. A physical graph is used to formulate such a plan. The physical graph represents multiple physical entities that have been sensed in a physical space over time. A plan is then formulated based on an evaluation of that physical graph. Such plans are enabled by the semantic understanding of the physical space and its contents that the physical graph provides. The plan honors physical constraints of the physical space, and physical constraints of the physical entities that are moving within that physical space. The plan may be further orchestrated by communicating with the physical entities to provide instructions for movement. Then, movement is monitored to determine if the plan is being complied with. If the plan is not being complied with, further communications are made and/or an alternative plan is automatically constructed.

Abstract: Automatically identifying a route for a physical entity to take within a physical space in order to go to an event endpoint where an event happened, is happening, or is predicted to happen. Thus, instead of static routing in which routing is made to a fixed endpoint, dynamic routing is achieved relating to event(s). The identified endpoint may be an activity, a mobile physical entity or a group of mobile physical entities, or the like. A route is formulated that moves a particular physical entity from a current location to a location of the identified event within the physical space. The route formulation may occur via reference to a physical graph representing physical entities that are monitored within the physical space over time. Furthermore, the route formulation may occur in coordination with a planning component that orchestrates movements of physical entities within the physical space.

Abstract: The controlling of access to information represented in a computer-navigable graph of sensed features. The sensed features were gathered by recognition or estimation of one or more features of physical entities that were sensed over time by sensor(s) within a physical space. Computer-navigation may occur over the graph in response to a query or computation. Thus, computations and queries may be performed over physical space, thereby extending computing to the ambient physical environment. However, creation of nodes within the computer-navigable graph may be restricted to the satisfaction of certain criteria. Alternatively or in addition, access of nodes within the computer-navigable graph may be restricted to satisfaction of corresponding criteria.

Abstract: The controlling of the size and quality of a computer-navigable graph of sensed features. The sensed features were gathered by recognition or estimation of one or more features of physical entities that were sensed over time by sensor(s) within a physical space. Computer-navigation may occur over the graph in response to a query or computation. Thus, computations and queries may be performed over physical space, thereby extending computing to the ambient physical environment. To keep the size of the computer-navigable graph at a manageable levels nodes of the computer-navigable graph are removed or cleansed.

Abstract: The present invention extends to methods, systems, and computer program products for using cinematic techniques to present data. Embodiments of the invention can be used to infer and generate cinematic techniques or combinations thereof based on a model and user action. Cinematic techniques can be used to meet the data exploration and analysis requirements of a user. As such, embodiments of the invention permit users (including non-programmers) to employ cinematic techniques (possibly in combination with other techniques) to gain insights into their data and also convey appropriate emotional messages.

Abstract: A business intelligence (BI) document preserves references to identities and formats of remote data sources and allows a local computing device to offload analytical operations to remote data sources. The BI document specifies a graph of entities connected by directed edges from the output of one entity to an input of another entity. An entity, for example, can represent without limitation a data structure, an external data source, a control element, an external event source, a visualization, or an update service. The entities of a BI document at a local computing device can reference data at an original data source—rather than extracting data from the original data source to a preferred local datastore. An entity of the BI document can direct a remote data source to execute transformations on the remote data before returning a solution to the local computing device.

Abstract: A business intelligence document provides functionality for testing a hypothesis on aggregated data in a business intelligence document (e.g., a spreadsheet-like document), wherein one or more of the input data values and transformation properties are designated as constrained (e.g., invariant or constrained within a range, set, enumeration, or domain). The hypothesis, which is articulated as a data mining assertion, is input through the user interface of the business intelligence document (e.g., via an expression interface or properties of a row, column, or cell) and solved over the aggregated data. The solution is then presented through the user interface of the spreadsheet-like document, such as in a table, graph, histogram, etc.

Abstract: Mechanism for two portions of an application to communicate so as to facilitate a transition from synchronous to asynchronous communication. In order to prepare for a possible transition, data flow is monitored between the two portions of the application, each portion interacting with a different hardware entity. The data flow between the first portion and the second portion of the application is recorded. If the second hardware entity is not available at the time, the recorded data flow from the first portion may be replayed by the second portion of the application for the benefit of the second hardware entity. If the second portion of the application is to be reassigned to another hardware entity, the target hardware entity may be sent the second portion of the application, as well as the recorded information. This allows the target hardware entity to replay what has happened thus far for context.

Abstract: A graphical manipulation tool to create and/or make modifications to a graphical object suitable for visually representing data. The graphical manipulation tool analyzes the graphical object to determine parameters of visual characteristics of the graphical object that can be used to visually represent data. A computing system, through the graphical manipulation tool, may generate metadata that defines a capacity for visual characteristics to represent data. In some cases, a preview is displayed on a user interface indicating to a user how the metadata, if incorporated with the graphical object, may result in the visual characteristics of the graphical object being used to visually represent data. If incorporating the metadata with the graphical object is desirable, the user may provide to include the additional metadata with the graphical object.

Abstract: A pattern of visual interactivity may be automatically proposed for processing a data set that exhibits dimensions of variability. A visual display component may be analyzed to assess whether it is capable of receiving user input representing changes that correspond to types of changes of the identified dimensions of the data set. A suitable visual display component may be provided as a suggestion on a user interface for potentially using the visual display component to allow a user to interact with the data. In some embodiments, a visual display component includes a number of visual objects and/or visually interactive components for use within a graphical user interface. A visual display component may include one or more analytic patterns having at least one of an equation, rule, constraint, expression or combination thereof that represents the analytic pattern. Alternatively, a visual display component may involve a visual display representation of data through visual characteristics of a graphical object.

Abstract: Techniques for representing and publishing an interactive document useful for analyzing data. The document may be represented as a directed acyclic graph of entities interconnected by edges. The entities may be of multiple types. Yet, a broad range of interactive documents may be represented by a limited number of types of entities and the capabilities to interconnect entities of different types and to share a data schema across entities of different types. A tool may enable a user to author such documents. The tool may also facilitate publishing of the document. For publishing, the document may be converted to an executable form. Prior to such a conversion, the graph may be modified for more efficient processing. The graph may also be partitioned such that portions of the graph, when distributed across tiers of a computing system, such as a cloud-based platform, execute on computing devices that provide efficient operation.

Abstract: Mechanisms for a presentation module to perform distributed interfacing with an application across a plurality of hardware entities. The module identifies the hardware entities that are available to interface with endpoints of an application. The presentation module performs distribution of assignment of hardware entities to interact with the endpoints by, for each of at least some of the hardware entities, determining a subset of endpoints with which the corresponding hardware entities is to interface. Furthermore, the application is operated in that state to thereby detect interaction of at least some of the hardware entities with the application via at least some of the endpoints. Thus, distributed interfacing of hardware entities with an application is facilitated.

Abstract: A user interface for an information presentation system that displays information of interest to the user identified by the information presentation system based on selecting tasks that may be relevant to the user given the user's current context. The user interface displays options for the user to select from among relevant tasks and/or goals of completing the task. For each selected task and goal, the system may generate one or more sets of items that are relevant to completing the task. The user interface may present the user with the option to select from among the sets of items or to navigate among the sets of items. The user interface may be an easy-to-use interface on a portable computing device to support shopping applications.

Abstract: A compound application that is operated across multiple devices using constituent transformation chains associated with multiple devices. Dependencies are identified between different transformation chain classes. Devices are also identified along with their associated instance of a transformation chain class. Upon determining that the transformation chain instances associated with different devices are to be joined, data is permitted to flow between the various devices in accordance with the identified dependences between their respective classes of the associated transformation chain instances, and in accordance with dependency state between the instances. Thus, a compound transformation chain is formed. As devices exit the environment, the associated transformation chain instances may be removed from the compound transformation chain. Thus, rather than devices having interoperating applications, the devices become mutually engaged with the same compound application.

Abstract: Sharing an application in response to detecting one or more environmental events (such as user input). The mechanism operates multiple applications, and maintains a registry of endpoint interface entities. The endpoint interface entities may include hardware entities or hardware entities in association with environmental criteria. For each of at least some of the applications, the mechanism identifies at least one endpoint interface entity that is to interface with the endpoints at least a portion of the application. The selected endpoint interface entity is then allowed to interface with the application (or the portion). In some embodiments, the application is a transformation chain having endpoints.

Abstract: The incremental formulating an application in response to detecting events (such as user input) in an environment. Upon detecting one or more events, it is determined from this use input that an instance of a first transformation chain class is to be joined with an instance of a second transformation chain class. In response, the instance of the first transformation class is joined with the instance of the second transformation class along one or more data flow dependencies to formulate an aggregated instance. The aggregated instance may then be operated. This process may be repeated in response to different user input to thereby increase the size of the aggregated instance as more and more transformation chain instances join into the aggregated instance at appropriate chains of dependency.