RULE-BASED LAYOUT OF CHANGING INFORMATION

Abstract

Displaying application output in a manner that is not predetermined by the application, nor by the display. The computing system associated with the display accesses a set of information output by an application and to be displayed on a display. However, rather than explicit instructions on how to display being received from the application itself, the computing system instead accesses a set of one or more display rules that are associated with the set of information. The computing system then uses the set of one or more display rules to determine how to layout the set of information on the display. If the set of information were to change, the rules may be reevaluated to determine how the new information should be laid out. If the associated set of display rules were to also changed, the reevaluation would occur thereby resulting in a potentially different layout on the display.

Description

BACKGROUND

Computing technology has revolutionized the way we work, play, and communicate. Computing functional is obtained by a device or system executing software or firmware. The typical paradigm for application preparation is that the application is drafted well in advance of its use, and the functionality of the patent application is relatively predetermined.

There are some exceptions to the predetermined functionality. For instance, patches may be made to software application in order to provide repair of previously unknown bugs in the software. Furthermore, updates to software applications may be provided in order to add new functionality to the software application. In some cases, software may be configured and customized for a particular user. However, the application itself defines how far it can be customized. Users can also affect applications by providing commercial feedback on software performance. However, it can take years before user feedback is properly incorporated into an application.

The subject matter claimed herein is not limited to embodiments that solve any disadvantages or that operate only in environments such as those described above. Rather, this background is only provided to illustrate one exemplary technology area where some embodiments described herein may be practiced.

BRIEF SUMMARY

At least some embodiments described herein related to a mechanism for displaying a set of application output in a manner that is not predetermined by the application, nor by the display. The computing system associated with the display accesses a set of information output by an application and to be displayed on a display. However, rather than explicit instructions on how to display being received from the application itself, the computing system instead accesses a set of one or more display rules that are associated with the set of information. The computing system then uses the set of one or more display rules to determine how to layout the set of information on the display. If the set of information were to change, the rules may be reevaluated to determine how the new information should be laid out. If the associated set of display rules were also to change, the reevaluation would occur thereby resulting in a potentially different layout on the display.

This Summary is not intended to identify key features or essential features of the claimed subject matter, nor is it intended to be used as an aid in determining the scope of the claimed subject matter.

BRIEF DESCRIPTION OF THE DRAWINGS

In order to describe the manner in which the above-recited and other advantages and features can be obtained, a more particular description of various embodiments will be rendered by reference to the appended drawings. Understanding that these drawings depict only sample embodiments and are not therefore to be considered to be limiting of the scope of the invention, the embodiments will be described and explained with additional specificity and detail through the use of the accompanying drawings in which:

FIG. 1 symbolically illustrates a simple transformation chain in which there is but a single link coupling a single data source and a single data target and in which a transformation represented by the link is automatically performed using a value in the data source as input to generate a value in the data target;

FIG. 2 symbolically illustrates another simple example transformation chain in which a transformation is performed using input values from three data sources in order to generate output values in two data targets;

FIG. 3 illustrates a transformation chain in the form of a combination of the transformation chain of FIG. 1 and the transformation chain of FIG. 2;

FIG. 4A through 4D each illustrate example transformation chains (arrows through which data does not flow absent joining with another transformation chain are illustrated with an “X”, and dependency elements that are not nodes in the transformation chain itself are illustrated with dashed lined borders);

FIG. 5A illustrates an augmented transformation chain representing the joining of the transformation chains of FIGS. 4A and 4B;

FIG. 5B illustrates an augmented transformation chain representing the joining of the transformation chains of FIGS. 4A and 4C;

FIG. 5C illustrates an augmented transformation chain representing the joining of the transformation chains of FIGS. 4B and 4C;

FIG. 5D illustrates an augmented transformation chain representing the joining of the transformation chains of FIGS. 4A and 4D;

FIG. 6A illustrates an augmented transformation chain representing the joining of the transformation chains of FIGS. 4A, 4B and 4C;

FIG. 6B illustrates an augmented transformation chain representing the joining of the transformation chains of FIGS. 4A, 4B and 4D;

FIG. 6C illustrates an augmented transformation chain representing the joining of the transformation chains of FIGS. 4A, 4C and 4D;

FIG. 7 illustrates an augmented transformation chain representing the joining of the transformation chains of FIGS. 4A, 4B, 4C and 4D;

FIG. 8 illustrates a node of a transformation chain along with numerous associated input endpoints and output endpoints;

FIG. 9 illustrates a runtime architecture in which transformation chains may be implemented, and which includes a canvas referred to herein as a universal canvas;

FIG. 10 illustrates a flowchart of a method for formulating an application in response to detecting events in an environment, which represents a simple case in which an instance of a transformation chain is created and operated within the universal canvas of FIG. 9

FIG. 11 illustrates a flowchart of a method for responding to detecting events in the environment by combining transformation chain instances;

FIG. 12A illustrates a flowchart of a method for formulating an integrated instance of two transformation chain classes by first instantiating instances of each class, and then joining the instances;

FIG. 12B illustrates a flowchart of a method for formulating an integrated instance of two transformation chain classes by first combining the two transformation chain classes, and then instantiating from the combined transformation chain class;

FIG. 13A illustrates a transformation chain instance that is preparing to be split;

FIG. 13B illustrates a transformation chain instance that is split from the transformation chain instance of FIG. 13A;

FIG. 14 illustrates a flowchart of a method for formulating a split application;

FIGS. 15A through 15D illustrates various possible configurations for the split transformation chain instance of FIG. 13B;

FIG. 16 illustrates an architecture in which a larger transformation chain instance that is assigned to a first endpoint interface securely interfaces with a portion transformation chain instance that is assigned to a second endpoint interface via a proxy service;

FIGS. 17A through 17C illustrate a sequence of user interfaces associated with the splitting of an application and redacting in order to perform the same;

FIG. 18 illustrates a flowchart of a method for sharing an application in response to detecting one or more events at a first endpoint interface entity;

FIG. 19 illustrates a flowchart of a method for distributed interfacing with an application across a plurality of hardware entities;

FIG. 20 illustrates a flowchart of method for displaying information on a display in accordance with the principles described herein.

FIG. 21 illustrates a flowchart of a method for a first portion of an application to communicate with a second portion of an application in a manner that prepares for transitioning from synchronous to asynchronous;

FIG. 22 illustrates a flowchart of a method for transitioning to asynchronous communications in the context of synchronous communications being recorded;

FIG. 23 illustrates a flowchart of a method for reassigning the split portion of an application to another endpoint interface entity;

FIG. 24 illustrates an environment in which the reassignment of FIG. 22 may be made;

FIG. 25 illustrates a flowchart of a method for facilitating layout on a display that receives output from an application that redefines during use; and

FIG. 26 symbolically illustrates a computing system in which some embodiments described herein may be employed.

DETAILED DESCRIPTION

At least some embodiments described herein related to a mechanism for displaying a set of application output in a manner that is not predetermined by the application, nor by the display. The computing system associated with the display accesses a set of information output by an application and to be displayed on a display. However, rather than explicit instructions on how to display being received from the application itself, the computing system instead accesses a set of one or more display rules that are associated with the set of information. The computing system then uses the set of one or more display rules to determine how to layout the set of information on the display. If the set of information were to change, the rules may be reevaluated to determine how the new information should be laid out. If the associated set of display rules were also to change, the reevaluation would occur thereby resulting in a potentially different layout on the display.

Although the principles described herein are not limited to any particular type of application, the principles are particularly useful in the context in which an application has a set of information that is to be displayed that is not predefined. One type of application that has this characteristic is referred to herein as a transformation chain. Accordingly, to describe at least one example application type that has this characteristic, a transformation chain will be described. Further, as a transformation chain application represents a paradigm shift in application architecture, the concept of a transformation chain will be described now in some detail.

First, the concept of transformation chains will be described with respect to FIGS. 1 through 8. Then, an architecture for supporting a universe of transformation chains and their operation will be described with respect to FIG. 9. Thereafter, an example operation of transformation chains will be described with respect to FIGS. 10 through 25. Because transformation chain-based applications represent a paradigm shift, this description will go into significant detail on potential operations of the transformation chain-based applications. Thereafter, an example computing system that may support aspects described herein will be described with respect to FIG. 26.

The Transformation Chain Application

The principles described herein operate using a transformation chain. A transformation chain is an interconnected set of nodes that each may represent data sources and/or data targets. There are links between the nodes, each link representing a transformation. For any given link, the associated transformation receives copies of values of one or more data sources situated at an input end to the link, and generates and provides resulting values at one or more data targets located at the output end of the link. For any given transformation, when a value at one or more of the data sources at its input end changes, the transformation is automatically reevaluated, potentially resulting in changes in value(s) of one or more data targets at the output end of the transformation.

In one embodiment, regardless of how complex the transformation chain is, the transformations may be constructed from declarative statements expressing equations, rules, constraints, simulations, or any other transformation type that may receive one or more values as input and provide resulting one or more values as output. An example of a transformation chain is a spreadsheet program, where any of the cells can be a data source or a data target. An equation (i.e., a transformation) may be associated with any cell to cause that cell to be a data target where results of the equation are placed.

As an example only, FIG. 1 illustrates a simple transformation chain 100 in which there is but a single link 120. In the drawing notation used throughout this description, a link will be illustrated as an arrow, with the input end being represented as the tail of the arrow, and the output end being represented as the head of the arrow. In cases in which there are multiple data sources at the input end of the link, the arrow will be represented with multiple tails. Copies of the values of the data source(s) at the tail(s) of the arrow represent input to the transformation. In cases in which there are multiple data targets affected by resulting value(s) of the transformation, the arrow will be represented with multiple heads. The values of the data target(s) at the head(s) of the arrow represent output from the transformation.

For instance, FIG. 1 illustrates a simple transformation chain 100 that includes a data source 101, a data target 102, and a single link 120. The link 120 represents a transformation performed on a copy of the value 111 at the data source 101 in order to generate a value 112 at the data target 102. Should the value 111 change, the transformation represented by link 120 is automatically reevaluated potentially resulting in a change in the value 112 in the data target 102.

FIG. 2 illustrates another simple example transformation chain 200 that includes three data sources 201, 202 and 203; two data targets 204 and 205, and a single link 220. The link 220 represents a transformation performed on copies of the values within the data sources 201, 202 and 203, in order to generate the values in the data targets 204 and 205. Should any of the values within the data sources 201, 202 or 203 change, the transformation link 220 is automatically reevaluated potentially resulting in a change in the values within any one or more of the data targets 204 and 205.

FIG. 3 illustrates another example transformation chain 300, and illustrates the principle that transformation chains may build on each other in which a data source to one link may be a data target in other link, in order to create even more complicated transformation chains. For instance, the transformation chain 300 includes an instance 301 of the transformation chain 100, and an instance of 302 of the transformation chain 200. In this case, the data target 102 of the link 120 is also a data source 201 of the link 220. Should the value with the data source 101 change, the transformation represented by link 120 is reevaluated potentially resulting in a change in the value in the data target 102, which is likewise a data source 201 for the next link 220. Likewise, a change in a value of data source 201 would result in the transformation link 220 being reevaluated potentially resulting in a change in the values within any one or more of the data targets 204 and 205. Thus, a change in the value at data source 101 has the potential, through transformation reevaluation, to affect value(s) at node 102 (201) and at nodes 204 and 205. Data targets 204 and 205 might likewise represent data sources for yet other links. Accordingly, in complex transformation chains, a value change might cause propagated value changes through multiple nodes in a transformation chain through proper automated reevaluation of transformations within the transformation chain.

While the example transformation chain 300 includes just two links, transformation chains may be quite complex and involve enumerable nodes and associated links connecting those enumerable nodes. The principles described herein may operate regardless of the complexity of the transformation chains.

FIG. 4A through 4D illustrates example transformation chains instances or classes 400A through 400D. The instances will have the same structure as the classes, and so the illustrated forms may be considered to represent transformation classes as well as transformation instances. Instances will, however, have particular instance state associated with each of one or more of the nodes of the transformation chain. Accordingly, elements 400A through 400D may be referred to as transformation chain classes or transformation chain instances. The term “transformation chain” will be used to generally refer to both transformation chain classes and their associated transformation chain instances.

The example transformation chains 400A through 400D are relatively simple in order to avoid obscuring the broader principles described herein with an overly complex example. That said, the principles described herein apply regardless of how complex the transformation chain, and regardless of the number of transformation chains and associated devices that are within the environment and forming the compound application.

In the notation of FIGS. 4A through 4D, the nodes that belong to the transformation class 400N (where N ranges from A through D) are represented using the suffix N. For instance, in FIG. 4A, the transformation chain 400A includes nodes 401A, 402A, 403A, and 404A. The remaining elements 401B, 401C and 401D do not end with the “A” suffix, and thus are not nodes within the transformation chain 400A. Instead, the elements 401B, 401C and 401D represent dependencies with other transformation chains.

Throughout FIGS. 4A through 4D, 5A through 5D, 6A through 6C, and 7, to emphasize those elements that are dependency elements, rather than nodes in the transformation chain itself, dependency elements are represented with dashed-lined boundaries. Data does not flow from a node to a dependency element unless the transformation chain is joined with another transformation chain that includes a node represented by the dependency element. The fact that data cannot flow along a particular transformation is represented throughout the figures by the link being marked with an “X”.

For instance, element 401B in transformation chain 400A represents a dependency with node 401B in the transformation chain 400B. The dependency element 401B is bordered with dashed lines, and all links leading to or from that dependency element 401B are marked with an “X” since at this stage, the transformation chain 400A is not joined with the transformation chain 400B. Element 401C in transformation chain 400A represents a dependency with node 401C in transformation chain 400C. Element 401D in transformation chain 400A represents a dependency with node 401D in transformation chain class 400D.

On its own, the transformation chain instance 400A can function as an application. For example, a copy of a value or copies of values from data source 401A may be used to form a transformed result as a value or values of data target 404A. Furthermore, a copy of a value or copies of values from data sources 401A and 402A may be transformed to result in a value or values of data target 403A. If the transformation chain instance 400A is on its own, the transformations leading to and from the elements 401B, 401C and 401D are not evaluated.

The transformation chain 400B includes three nodes 401B, 402B and 403B. However, the transformation chain 400B also includes dependency elements 401A, 402A, 401C and 403C that reference a node in a different transformation chain. Again, the transformation chain instance 400B may operate independently as a single application. For example, a copy of a value or copies of values from data source 401B may be provided through a transformation to generate a resulting value or values for data target 402B. A copy of a value or copies of values from the data source 402B may be provided through a transformation to generate a resulting value or values for data target 403B.

Though the transformation chain instances 400A and 400B may operate independently, FIG. 5A illustrates a joined transformation chain 500A that includes transformation chain 400A joined with transformation chain 400B. Where appropriate, dependency elements in each of the transformation chains are now replaced with the actual node referred to. For example, dependency element 401B of FIG. 4A is now node 401B in FIG. 5A, and dependency elements 401A and 402A of FIG. 4B are now nodes 401A and 402A, respectively, in FIG. 5A. Thus, all of the nodes that have the suffix A or B are nodes within the transformation chain 500A, and only those nodes that have suffixes C or D are dependency elements. For example, nodes 401A, 402A, 403A, 404A, 401B, 402B and 403B are nodes within the augmented transformation chain 500A, and the functionality of the compound application becomes somewhat better, more complete, or at least different than the sum of the functionality of the individual transformation chains 400A and 400B on their own.

The transformation chain 400C includes three nodes 401C, 402C and 403C. However, the transformation chain 400C also includes dependency elements 403A, 401B and 403B that reference a node in a different transformation chain. Again, the transformation chain instance 400C may operate independently as a single application. For example, a copy of a value or copies of values from data source 401C may be provided through a transformation to generate a resulting value or values for data target 402C. Likewise, a copy of a value or copies of values from the data source 401C may also be provided through a transformation to generate a resulting value or values for data target 403C.

Though transformation chain instances 400A and 400C may operate independently, FIG. 5B illustrates a joined transformation chain 500B that includes transformation chain 400A joined with transformation chain 400C. Dependency elements in each of the transformation chains are now replaced with the actual node referred to the extent that the dependency element refers to a node within any of transformation chains 400A or 400C. Now all of the nodes that have the suffix A or C are nodes within the transformation chain, and only those nodes that have suffixes B or D are dependency elements. For example, nodes 401A, 402A, 403A, 404A, 401C, 402C and 403C are nodes within the augmented transformation chain 500B. The functionality of the compound application becomes better, more complex, or at least different than the sum of the functionalities of the individual transformation chain instances 400A and 400C.

FIG. 5C illustrates a joined transformation chain 500C that includes transformation chain class 400B joined with transformation chain class 400C. Dependency elements in each of the transformation chains are replaced with the actual node referred to the extent that the dependency element refers to a node within any of transformation chains 400B or 400C. Now all of the nodes that have the suffix B or C are nodes within the transformation chain, and only those nodes that have suffixes A or D are dependency elements. For instance, nodes 401B, 402B, 403B, 401C, 402C and 403C are nodes within the augmented transformation chain 500C, and the functionality of the compound application becomes better, more complex, or at least different than the sum of the functionalities of the individual transformation chain instances 400B and 400C.

FIG. 6A illustrates a joined transformation chain 600A that includes transformation chains 400A, 400B and 400C also being joined. Dependency elements in each of the transformation chains are replaced with the actual node referred to to the extent that the dependency element refers to a node within any of transformation chains 400A, 400B or 400C. Note that all of the illustrated nodes are actually nodes in the transformation chain, except for dependency element 401D. The functionality of the compound application becomes better, more complex, or at least different than the sum of the functionality of the individual transformation chains 400A, 400B and 400C; the sum of the functionality of the individual transformation chains 500A and 400C; or the sum of the functionality of the individual transformation chains 400A and 500B.

The transformation chain 400D includes two nodes 401D and 402D. However, the transformation chain 400D also includes a single dependency element 403A referencing a node in a different transformation chain class 400A. Again, instances of the transformation chain class 400D may operate independently as a single application. For instance, a copy of a value or copies of values from data source 401D may be provided through a transformation to generate a resulting value or values for data target 402D.

Though transformation chain instances 400A and 400D may operate independently, FIG. 5D illustrates a joined transformation chain 500D that includes transformation chain 400A joined with transformation chain 400D. Dependency elements in each of the transformation chains are now replaced with the actual node referred to the extent that the dependency element refers to a node within any of transformation chains 400A or 400D. Now all of the nodes that have the suffix A or D are nodes within the transformation chain, and only those nodes that have suffixes B or C are dependency elements. For instance, nodes 401A, 402A, 403A, 404A, 401D and 402D are nodes within the augmented transformation chain 500D, and the functionality of the compound application becomes somewhat better than the sum of the functionality of the individual transformation chain 400A and 400D.

Note that FIGS. 5A through 5D illustrate all of the possible permutations involving two and only two of the transformation chains 400A, 400B, 400C and 400D. The transformation chains 400B and 400D are not joined directly in a two transformation chain combination, since neither transformation chain has a dependency element referring to a node in the other transformation chain. Furthermore, transformation 400C and 400D are not joined directly in a two transformation chain combination, since neither has a dependency reference to the other.

FIG. 6A illustrates one of three possible combinations of three and only three transformation chains 400A, 400B, 400C and 400D. In particular, FIG. 6A illustrates an augmented transformation chain 600A that combines transformation chains 400A, 400B and 400C. FIG. 6B illustrates an augmented transformation chain 600B that combines transformation chains 400A, 400B and 400D (in which all nodes are part of the transformation chain except dependency elements 401C and 403C). FIG. 6C illustrates an augmented transformation chain 600C that combines transformation chains 400A, 400C and 400D (in which all nodes are part of the transformation chain except dependency elements 401B and 403B). Note that there is no combination of transformation chains 400B, 400C, and 400D illustrated since the transformation chain 400D includes no dependency references to transformation chain 400B (or vice versa), or to transformation chain 400C (or vice versa). FIG. 7 illustrates a combined transformation chain 700 that includes all of the transformation chains 400A, 400B, 400C and 400D combined.

Accordingly, given the transformation chains 400A, 400B, 400C and 400D in the environment, there are 8 possible compound applications that may be formed (corresponding to the transformation chains of FIGS. 5A through 5D, FIGS. 6A through 6C, and FIG. 7). Thus, as the transformation chains of various devices are joined into and decoupled from the environment, the very transformation chain itself changes, and the structure of the compound application thereby changes. For instance, a change in the value of data source 401A might have a very different impact on the transformation chain as the effects of that change are automatically propagated through one or more transformations, depending on whether that data source 401A is within transformation chain 400A alone, within transformation chain 500A, within transformation chain 500B, within transformation chain 500D, within transformation chain 600A, within transformation chain 600B, within transformation chain 600C, or within transformation chain 700.

Any of the nodes of a transformation chain may have zero or more input endpoints where inputs are received from an endpoint interface entity, and zero or more output endpoints where outputs are provided to an endpoint interface entity. In this description and in the claims, an “endpoint interface entity” is defined as a hardware entity and zero of more environmental criteria. In the case of there being zero environmental criteria associated with an endpoint interface entity, the endpoint interface is simply a hardware entity ((such as a device or computing system). In the description and in the claims, “a hardware entity” refers to any single or combination of physical items that have the capability to potentially interface with an endpoint. For instance, a hardware entity that provides input or receives input might be a data store, or a location in a data store, a user device, a microphone or microphone array, a camera or camera array, three-dimensional sensors, image recognizers, or the like. If the hardware entity and corresponding one or more environmental criteria together define an endpoint interface entity, then the hardware entity is indeed the endpoint interface entity so long as the environmental criteria are satisfied. However, if the environmental criteria cease to be satisfied, then the hardware entity would lose its status as an endpoint interface entity.

In this description, the terms “endpoint interface entity” and “hardware entity” may frequently be used interchangeably on the assumption that if the endpoint interface entity does have environmental criteria, that those criteria remain satisfied in that case. Furthermore, when the term “environmental criteria” is mentioned with respect to a hardware entity or an endpoint interface entity, the environmental criteria for the hardware entity becoming the endpoint interface entity may be different than the environment criteria for the hardware entity ceasing to be the endpoint interface entity. Thus, there may be some hysteresis built into the environmental criteria to avoid rapid changes in whether or not a particular hardware entity qualifies as a particular endpoint interface entity.

Examples of environmental criteria will now be provided with the understanding that the principles described herein are not limited to any particular environment criteria. One environmental criterion might be that the hardware entity has an associated identified user or identified group of users. For instance, if a given user or group of users is using a hardware entity, then the hardware entity may become an endpoint interface entity. If another user or group of users is using the hardware entity, then perhaps the hardware entity does not act as an endpoint interface entity. Other examples of environmental criteria might include the position, vantage point, or orientation of a user or group of users within an environment and/or with respect to a hardware entity, the position of an audio source in the environment, background noise levels, whether an audio signature is present, whether a security zone surrounding the environment has been violated, whether an individual has fallen in the environment, the temperature of the environment, the available network connections in the environment, a lighting level and/or configuration, a time of day or week or month or year, and so on for any imaginable environmental criteria.

As an example, a mounted flat panel display having multiple viewers oriented to be able to see the flat panel display might be an appropriate endpoint interface device, but if there is but a single viewer, and the node has input endpoints, perhaps a touchscreen device in the hands of the single viewer might be the better endpoint interface device for a given endpoint. As a second example, suppose that there was output was being displayed on a television, and a security system is activated, the activation of the security system might be an environmental criteria that causes some or all of the information displayed on the television to be obscured, or perhaps even cause the television to stop being an endpoint interface entity, and thus disconnect from the application.

FIG. 8 illustrates a node 800 of a transformation chain that includes input endpoints 810 and output endpoints 820. The input endpoints 810 are illustrated as including endpoints 811 through 814, are represented as triangles, with the ellipses 815 representing that the node 800 may have any number of input endpoints. The output endpoints 820 are illustrated as including endpoints 821 through 823, are represented as squares, with the ellipses 824 representing that the node 800 may have any number of output endpoints. The number and type of input and output endpoints may be defined by the transformation chain class(es) that include the node, or the class may provide flexibility in how many input and/or output endpoints are included with each instance of node 800 in its respective instances of those transformation chain class(es). The endpoints themselves may be considered to be trivial nodes of a transformation class as all they do is provide output to, or receive input from a respective endpoint interface entity. The endpoints are generally not illustrated in FIGS. 1 through 7. The endpoint are however, the mechanism by which the transformation chains interact with the physical world through storage, display, input, actuation, audio, text, or the like.

The general concept of the transformation chains has been described with respect to FIGS. 1 through 8 with respect to specific examples of transformation chains that have particular nodes and particular dependency elements. However, the principles described herein apply to any transformation chain having any number of nodes and any number of dependency elements, regardless of the function of the node and identity of the dependency element. Accordingly, the principles described herein may be applied to a limitless variety of transformation chains performing a limitless variety of functions. One or more endpoint interface entities have credentials to interface with the endpoints of a transformation chain instance or portions thereof. Such credentials may include credentials to provide input to some or all of the endpoints of one or more or all nodes of a transformation chain instance, credentials to receive output from some or all of the endpoints of one or more or all nodes of a transformation chain instance, or even the power to delegate credentialed power to one or more delegate endpoint interface entities.

Transformation Chain Supporting Architecture

In accordance with the principles described herein, an architecture is described in which transformation chains may be combined incrementally forming dynamically changing functions at runtime, thereby changing the concept of what an application is. With the benefit of reading this description, transformation chains are like molecules floating within an environment, and with the proper impetus, such molecules combine resulting in a compound that operates differently from its constituent parts. For instance, given the right impetus, two hydrogen molecules may combine with an oxygen atom to formulate a molecule of water. While liquid hydrogen and liquid oxygen cannot be consumed by humans, liquid water can and must be consumed by human beings. Thus, the principles described herein allow molecules of transformation chains to be joined dynamically and incrementally to formulate customized applications that provide customized functionality that is suitable to the impetus experienced. Such applications may be so customized that there may be times that a particular application is only constructed once.

The principles described herein also allow a delegator endpoint interface entity to delegate power to another delegate endpoint interface entity to interface with certain endpoints, without the delegator endpoint interface entity giving up control of how the delegate endpoint interface affects the transformation chain instance. Accordingly, the principles described herein also allow a transformation chain to be safely split.

Through atomic and molecular composition, a seemingly infinite variety of animate and inanimate objects, and entire worlds, have formed. Currently, there are only 115 known elements in the periodic table of the elements from which an infinite variety of animate and inanimate objects throughout the universe are composed. Using only a limited number of transformation chains, that may be combined in certain ways, there is a substantially limitless variety of applications of a substantially limitless variety of functions that may be generated in a universe of possible applications. Accordingly, the principles described herein describe a new organic paradigm in incrementally building application and sharing split applications to suit the very present circumstances. Furthermore, the principles described herein allow for the careful tracking of credentials of which endpoint interface entity may interact with which endpoint of which nodes of which transformation chains, and allows for temporary, or even permanent delegation of such credentials to other endpoint interface entities. Accordingly, a wide variety of collaboration scenarios are enabled in such an organic application environment.

FIG. 9 illustrates a runtime architecture 900 in which this new paradigm in applications may be implemented. The runtime architecture 900 includes a universal canvas 910. The universal canvas 910 represents the universe in which transformation chain instances are formed, combined, operated, and extinguished. As an example, the universal canvas 910 is illustrated as operating eight transformation chains 911 through 918 of varying complexity. However, the ellipses 919 represent that the universal canvas 910 may run many transformation chain instances. Given sufficient resources, the universal canvas 910 may even run millions or billions of application chain instances.

The runtime architecture also includes a supporting architecture 920 that includes modules and components that operate outside of the observable universal canvas 910, to ensure the appropriate formation, combination, sharing, operation, and extinguishing of the transformation chain instances. The supporting architecture 920 itself can receive input and provide output at represented by bi-directional arrow 921. The supporting architecture 920 may also provide access to services as represented by bi-directional arrow 922. The supporting architecture 920 also interacts with the universal canvas 910 as represented by the bi-directional arrow 923 for purposes of instantiating transformation chains, combining transformation chain instances, altering transformation chain instances, enforcing credentialed use of the transformation chain instances by appropriate endpoint interface entities, extinguishing transformation chain instances, and the like.

The precise physical platform on which the universal canvas 910 is run is not critical. In fact, there can be great flexibility and dynamic change in the physical platform on which the universal canvas 910 is operated. Some nodes of some transformation chains may be operated by one physical platform (such as a device, endpoint interface entity, system, or cloud, while other nodes operate another physical platform). In one embodiment, the universal canvas 910 operates in a cloud computing environment, such as a private cloud, a hybrid cloud, or a public cloud. As an example, the universal campus may be within a local network, in a peer-to-peer computing network, in a cloud computing environment, in any other network configuration, or in any combination of the above. Even so, as previously mentioned, the universal canvas interfaces with the physical world through the endpoints of the various nodes of the transformation chain instances.

Likewise, the supporting architecture 920 may be operated in any computing environment, in peer-to-peer computing network, in a local network, any other network configuration, or in any combination of these. In the case where the transformation chain instances within the universal campus 910 operate fully or primarily, or even party in a cloud computing environment, it may be this same cloud computing environment that operates the supporting architecture.

In this description and the following claims, “cloud computing” is defined as a model for enabling on-demand network access to a shared pool of configurable computing resources (e.g., networks, servers, storage, applications, and services). The definition of “cloud computing” is not limited to any of the other numerous advantages that can be obtained from such a model when properly deployed.

For instance, cloud computing is currently employed in the marketplace so as to offer ubiquitous and convenient on-demand access to the shared pool of configurable computing resources. Furthermore, the shared pool of configurable computing resources can be rapidly provisioned via virtualization and released with low management effort or service provider interaction, and then scaled accordingly.

A cloud computing model can be composed of various characteristics such as on-demand self-service, broad network access, resource pooling, rapid elasticity, measured service, and so forth. A cloud computing model may also come in the form of various service models such as, for example, Software as a Service (“SaaS”), Platform as a Service (“PaaS”), and Infrastructure as a Service (“IaaS”). The cloud computing model may also be deployed using different deployment models such as private cloud, community cloud, public cloud, hybrid cloud, and so forth. In this description and in the claims, a “cloud computing environment” is an environment in which cloud computing is employed.

The supporting environment 920 includes a number of modules 930. One of the modules 930 is a summoning module 931 that interprets input and in response determines that a class of a transformation chain is to be instantiated. For instance, the input may be received directly from input (from arrow 921) to the supporting environment 920 or via input from a transformation chain instance running in the universal canvas 910 itself. Input that may be received from either source will be referred to herein as “general input”. Summoning criteria are used for recognizing that certain general input is to result in a transformation chain instance being created. Summoning criteria may be also any environmental criteria at all. For instance, the summoning criteria may take into account not just verbal conversations, or explicit user input directed at a hardware entity, but may also take into consideration other environmental factors. For instance, whether a particular user is sitting down, moving away, looking somewhere, being near a device with a touch screen, and so forth, may also be environmental criteria used as summoning criteria for summoning an instance of a transformation chain class to be created within the universal canvas 910.

The modules 930 also includes a chain class module 932 that instantiates transformation chain instances in response to determinations made by the summoning module 931 and/or in response to general input.

The modules 930 also includes a chain class maintenance module 933 that maintains a copy of each transformation chain class. The chain class maintenance module 933 may add to the library of available transformation chain classes in response to a determination made by the summonsing module 931 and/or in response to general input. Thus, the chain class maintenance module may maintain a registry of transformation chain classes. For instance, the chain class maintenance module 933 might merge classes along their appropriate points of dependency, or perhaps create a transformation chain class that represents a redacted or truncated version of a pre-existing transformation chain class. Some transformation chain classes may be created temporarily, whilst others may have more lasting persistence. Furthermore, authentication and authorization may be imposed so as to restrict which entities may instantiate transformation chains of certain classes.

A merging module 934 merges instances of transformation chains to be operated in the universal canvas 910 in an appropriate way given the dependencies of the transformation chains. Such merging occurs in response to determinations made by the summoning module 931 and/or in response to other general input. The merging criteria may also be any general environment criteria. Again, the merging criteria may take into account not just verbal conversations, or explicit user input directed at a hardware entity, but may also take into consideration other environmental factors that are deemed appropriate for the merging to occur.

An endpoint interface entity registry module 935 maintains a registry of all possible endpoint interface entities (hardware entities and potentially associated user criteria), as well as which endpoint interface entities are presently active and available given a particular instantiated transformation chain operating within the universal canvas 910.

An environmental module 936 detects when endpoint interface entities become active or inactive for a given instantiated transformation chain operating within the universal canvas 910. For instance, the environmental module 936 might detect when an initiating set of environment criteria for a hardware entity of a particular endpoint interface entity begin to be met resulting in the endpoint interface entity being available for the application (for interacting with the endpoints of the application). Likewise, the environment module 936 might detect when a terminating set of one or more environmental criteria for the hardware entity of the particular entity is met resulting in the endpoint interface entity no longer being available for the application.

An endpoint matching module 937 determines which active endpoint interface entities for an instantiated transformation chain are capable of and credentialed to provide input for each input endpoint of that transformation chain that is capable of receiving input from the physical world, and determining a proper form of the input given that endpoint interface entity. The endpoint matching module 937 also determines which active endpoint interface entities for an instantiated transformation chain are capable of and credentialed to receive output for each output endpoint of the transformation chain that is capable of presenting output into the physical world.

The modules 930 includes a presentation module 938 that, when there are multiple eligible endpoint interface entities that are capable of providing input into an input endpoint, decides which endpoint interface entity is to provide that input, and potentially decides that multiple endpoint interface entities are capable of providing input into that input endpoint. Furthermore, when there are multiple eligible endpoint interface entities that are capable of rendering output from an output endpoint, the presentation module 938 decides which endpoint interface entity is to provide that input, and potentially decides which of multiple endpoint interface entities are to render the output received from the output endpoint.

The presentation module 938 also decides whether any restrictions are to be imposed when a particular endpoint interface module provides input to an input endpoint of a transformation chain. The presentation module 938 may also decide whether there are any restrictions that are to be imposed when a particular endpoint interface module renders output from an output endpoint of a transformation chain. When that output is visualizations, the presentation module 938 may decide how visualized information is to be formatted and/or laid out on the display of the endpoint interface entity. Alternatively or in addition, the presentation module 938 may provide the output restrictions to the output endpoint interface module so that the output interface module can determine an appropriate formatting of information assigned to that output interface module.

The modules 930 also includes a delegation module 939 that allows and facilitates credentialed endpoint interface entity to delegate power to a delegee endpoint interface entity with respect to receiving output from or providing input to particular endpoints of a transformation chain instance. As such, delegation module 939 facilitates splitting of transformation chain application, thereby allowing dynamic movement into and out of collaborative scenarios. There may be other modules within the modules 930 as represented by the ellipses 940.

Transformation Chain Operation

Having now described transformation chain applications, and an architecture that facilitates operation of transformation chain applications with respect to FIGS. 1 through 9, example operations of the transformation chains and the supporting architecture will now be described with respect to FIGS. 10 through 25. First, the dynamic building of transformation chain instances will be described.

The dynamic building of transformation chain instances will now be described. In accordance with the principles described herein, transformation chains may be combined incrementally and with ease of effort forming dynamically changing functions at runtime. Transformation chains are like molecules floating within an environment, and with the proper impetus, such molecules combine resulting in a compound that operates differently from its constituent parts. Thus, the principles described herein allow instances of transformation chains to be joined dynamically and incrementally to formulate customized applications that provide customized functionality that is suitable to the impetus experienced.

As a concrete example, suppose that there is a transformation chain that extracts received orders from a database. A verbal command to “show me my orders” by a sales representative might instantiate that transformation chain class, filter by the user that stated the verbal command, and visualize the filtered list or orders. A subsequent join instruction might be “Fetch me my customers”, which might then cause another transformation chain to automatically join with the prior transformation chain to match customers with orders, and visualize the orders by customers. The user might then state “add order exceptions for customers” causing perhaps yet another transformation chain to join the existing transformation chain aggregation, and/or cause input to be made to an existing node of the current aggregation of transformation chains. At each stage, the user may determine based on the current state of the aggregated transformation chain what is lacking, and state or input further joining instructions, from which yet other transformation chains may be join in the growing customized application chain. In essence, the application is built as the user thinks and expresses intuitively what he or she wants, and the application is built in a manner that is sensitive to the environment.

FIG. 10 illustrates a flowchart of a method 1000 for formulating an application in response to detecting one or more environment events, which represents a simple case in which an instance of a transformation chain is created and operated within the universal canvas 910. First, a set of one or more environmental events (e.g., the presence of a user) is detected (act 1001). For instance, the summoning module 931 might detect one or more environmental events that are to trigger instantiation of a particular transformation chain class. An environment event amounts to the satisfaction of one or more environmental criteria.

Responsive to the detected environment event(s), the transformation class corresponding to the input is selected (act 1002). For instance, the summoning module 931 or the chain class module 932 may select which of the available transformation chain classes (maintained by the chain class maintenance module 923) corresponds to the detected environmental event(s).

An instance of the transformation chain class is then created (act 1003). For instance, the chain class module 932 might instantiate an instance of the identified transformation chain class. When instantiating the transformation chain class, the endpoint interface entity matching module 937 may provide appropriate credentials to one or more appropriate endpoint interface entities so that such entities are credentialed to receive output from and/or provide input to one or more endpoints of the transformation chain instance.

Optionally, the instance may then be operated (act 1004). For instance, in FIG. 9, the instance of the transformation chain class may be deployed and operated within the universal canvas 910.

As part of this operation (act 1004), the environmental module 936 detects which of the registered endpoint interface entities are active for the given instantiated transformation chain. Furthermore, the endpoint interface entity matching module 937 determines which active endpoint interface entity endpoints for the instantiated transformation chain should provide input for each endpoint of each node of the transformation chain that is capable of receiving input from the physical world, and what forms of input are acceptable. Furthermore, the endpoint interface entity matching module 937 determines which active endpoint interface entities for the instantiated transformation chain should receive output for each output endpoint of each node of the transformation chain that is capable of realizing (e.g., visualizing, rendering, sounding, storing, actuating, and the like) output into the physical world, and what forms of output are acceptable.

Joining Applications

At some point, further environmental event(s) are detected (such as user input) which directs that an instance of another transformation chain class is to be combined with an existing transformation chain instance. Accordingly, FIG. 11 illustrates a flowchart of a method 1100 for responding to further detected environment event(s) to thereby combine transformation chain instances. The method 1100 is initiated by detecting further environmental event(s) (act 1101) that is constituent with combination of two instances of transformation classes.

As an example, a transformation chain instance may be combined with the instance created in method 1000, or perhaps may be combined with an instance of a transformation chain created by a previous performance of the method 1100 of FIG. 11. Although not required, the instance to which the transformation chain instance is to be joined may have previously operated as an application already. Thus, the method 1100 may be repeatedly performed in order to build a sophisticated and customized transformation chain in response to various detected environmental events.

The detected environment events of act 1101 may be an expressed instruction to join. For instance, the user might have a user interface that allows explicit selection of a desired application chain class to be instantiated. Alternatively, the detected environment events of act 1101 may simply be an implicit indication that two transformation chain instances should be joined. For instance, the detected environment events might be any activity, such as particular speech, that is consistent with the joining of two instances of different transformation chain classes. Such input could include gestures, requests, and the like. For instance, as previously mentioned, a sales representative might state “fetch me my customers” in the context of the representatives corresponding orders already being visualized. The system may even guess at what transformation chain the user might want based on history and current context. In that case, the user establishing the current context could be the environmental event(s) that cause the new transformation chain to be instantiated that the system guesses may be desired at some future point. For instance, perhaps the system knows that when in a particular conversation the users keep talking about a particular order, the system might join transformation chain instances used to acquire that order in anticipation of showing that order. Whatever form the joining environment event(s) takes, the summoning module 931 of FIG. 9 detects appropriate environmental event(s) that corresponds to the instantiation of a transformation chain class (as described with respect to FIG. 10) or the joining of two transformation instances (as will be described with respect to FIG. 11).

The method 1100 then includes determining, from the further detected environmental event(s), that an instance of one transformation chain class is to be joined with an instance of another transformation chain class (act 1102). For instance, as described above, there are class-level restrictions in which the transformation chain class author expressly makes it possible, at least under some conditions, for instances of two transformation chain classes to be joined. For instance, the dependency elements of FIGS. 4A through 6C are an example of such class-level restrictions and authorizations.

However, there may also be instance-level authorization. As an example, the act 1002 may involve consulting a set of one or more rules defining one or more conditions for joining an instance of the first transformation chain class and the second transformation chain class. This set of rules may be dynamic and change over time. For instance, the joining logic may learn over time that certain gestures or other user activity is, or is not, indicative of a user intent or anticipated future user intent to combine such instances. Accordingly, the supporting architecture may observe a history associated with each of multiple users in order to, over time, more accurately predict user intention, depending on a history of a particular user, or group of users, and thereby formulate an appropriate set of summoning and merging criteria. The act 1102 may be performed by, for instance, by the chain class module 932 with reference to the transformation chain classes known to the class maintenance module 933. The endpoint interface entity matching module 937 may reevaluate which endpoint interface entities have credentials to interface with which endpoints of the composite aggregated transformation chain instance.

The author of a transformation chain class might also express restrictions at the granularity of a single dependency. For instance, in the dependence element 401B of transformation chain class 400A, the author might express that joining is authorized on that dependency element only if the transformation chain into which it is joined does not include an identified transformation chain class authored by a competitor. The author might also control data that is flowed out of the transformation chain to another joined transformation chain by writing restrictions or conditions into the transformation that would bridge the dependency itself (e.g., between nodes 401A and dependency element 401B).

However, even though transformation chain classes may interoperate, that does not mean that the user wants their particular instance of that transformation chain class to join with other instances of other transformation chain classes. After all, the data itself (e.g., the instance state) might be sensitive to the user. Accordingly, the method also may include determining that instances of different transformation chain classes are to be joined.

The joining criteria for authorizing two instance of different transformation chain classes to join may include one or more of the following: whether or not the user is on a meeting attendee list, a relationship (e.g., family, social network friend, or the like) of users of the various devices, a communication capability (e.g., near field) between the devices, a proximity of the respective devices (e.g., in the same conference room), the request of the users, of the like. For instance, the joining criteria might include some business criteria such as the associated users of the instances are on the same team. As another example, one device might be a kiosk in a retail space or hotel, where a customer uses the kiosk and a shop assistant or concierge can automatically use their device to join their transformation chain with that of the kiosk to thereby interact with the customer using the compound application. Conditions may be applied to the joining criteria. For instance, a bellhop's device might be able to join a customer's application if the concierge is not around (perhaps detected by the concierge not actively using the pairable application to join with that of customers, or being off network).

In some embodiments, the first transformation chain class used to instantiate the first of the two instances to be joined may be derived from an existing transformation chain class. As an example, the first transformation chain class may be the same as the first transformation chain class, except with one or more nodes of the transformation chain removed.

In response to the act of determining that the two instances are to be joined (act 1102), the two instances are joined (act 1103), so as to establish connections across one or more flow dependencies of the instance, thereby creating new avenues for data flow, and new application functionality. For instance, this joining may be accomplished by the merging module 934. The joined instance may thereafter be operated (act 1104).

In one embodiment, the instances themselves are directed joined without defining any new combined transformation chain classes. For instance, FIG. 12A illustrates a flowchart of a method 1200A for joining two instances and represents an example of the act 1103 of FIG. 11. The first instance of the first transformation chain class is instantiated (act 1201A) and perhaps operated (act 1211). Furthermore, the second instance of the second transformation chain class is instantiated (act 1202A) and perhaps operated (act 1221). Thereafter, the two instances are joined (act 1203A).

In other embodiments, the transformation chain classes themselves are aggregated to define a new combined class, and an instance of that aggregated class is instantiated to thereby accomplish act 1103. The combined instance may exist temporarily, may be kept for the benefit of a limited number of one or more users, or may even be added to the library of transformation chain classes that are available for more widespread use. For instance, FIG. 12B illustrates a flowchart of a method 1200B that represents another example of the act 1103 of FIG. 11. The first transformation chain class is accessed (act 1201B) and the second transformation chain class is accessed (act 1202B). The two classes are then combined (act 1203B). An instance is then created from the combined transformation chain class (act 1204).

As an example only, perhaps method 1000 or act 1201A of method 1200A might be employed to create an instance of a transformation chain of FIG. 4A. Now suppose that environmental event(s) are detected that suggest combination of instances of transformation chains of FIGS. 4A and 4B. Method 1100 may then be performed to create the instance of the transformation chain of FIG. 5A. In that case, act 1201A of method 1200 would instantiate from the transformation chain class of FIG. 4A, and act 1202A of method 1200 would instantiate from the transformation chain class of FIG. 4B. The result may be thought of as an instantiation of the aggregated class of the classes of FIGS. 4A and 4B (which is represented in FIG. 5A).

Now suppose that environmental event(s) are detected that suggest combination of instances of transformation chains of FIGS. 5A and 4C. The method 1100 may then be performed to create the instance of the transformation chain of FIG. 5A. In that case, act 1201A of method 1200A would be used to instantiate (in which the result from the prior performance of the method to create the transformation chain instance of FIG. 5A could be viewed as instantiating from the aggregated classes of FIGS. 4A and 4B) an instance of FIG. 5A. Furthermore, act 1201B of method 1200 would be used instantiate from the transformation chain class of FIG. 4C. The result may be thought of as an instantiation of the aggregated class of the classes of FIGS. 5A and 4C (which is represented in FIG. 6A).

Now suppose that environmental events are detected that suggests combination of instances of transformation chains of FIGS. 6A and 4D. The method 1100 may then be performed to create the instance of the transformation chain of FIG. 6A. In that case, act 1201A of method 1200A would be used to instantiate an instance of FIG. 6A. Furthermore, act 1201B of method 1200 would be used instantiate from the transformation chain class of FIG. 4D. The result may be thought of as an instantiation of the aggregated class of the classes of FIGS. 6A and 4D (which is represented in FIG. 7).

Delegation

Having now described the general principles of transformation chains, the environment in which they may operate, and their principles of aggregation, this description will now address how a delegator endpoint interface entity having credentials on a transformation chain instance may delegate power to a delegee endpoint interface entity to receive output from particular endpoint(s) and/or provided input to particular endpoint(s). Accordingly, application splitting and sharing is made possible in this organic universal canvas of transformation chain instances.

FIG. 13A illustrates an example transformation chain 1300 in a state 1300A in which it is about to be split. FIG. 14 illustrates a flowchart of a method 1400 for formulating a split application. As the method 1400 may be performed in the context of the example transformation chains 1300A and 1300B of FIGS. 13A and 13B, respectively, the method 1400 of FIG. 14 will be described with frequent reference to the example transformation chains 1300A and 1300B.

As illustrated in FIG. 13A, the example transformation chain 1300A includes six nodes 1301 through 1306. Each of the nodes may have zero or more input endpoints and zero or more output endpoints. However, to keep the diagram cleaner, the endpoints are not illustrated for the example transformation chain 1300A of FIG. 13A. Likewise, the endpoints are not illustrated for the example transformation chain 1300B in FIG. 13B.

In the initial state 1300A of FIG. 13A, a particular endpoint interface entity (referred to herein as a “first endpoint interface entity”) is credentialed to provide input to and receive output from endpoints of transformation chain 1300A. The scope of this credential is represented by the dashed lined boundary 1310.

Now suppose that the application represented by the transformation chain 1300A is to be split. That is, suppose that the first endpoint interface entity provides interaction or input suggesting that a transformation chain instance representing a portion of the larger transformation chain instance 1300A is to be created. There may be several reasons for performing such a split. One reason might be simply because the first endpoint interface entity is to use another instance of just that portion of the larger transformation chain class. Another reason might be to delegate input and/or output privileges associated with one, some, or all of the endpoints of those nodes that are part of the portion to another endpoint interface entity. In other words, the first endpoint interface entity assigns the portion of the transformation chain, at least temporarily, to the second endpoint interface entity. A redaction and share gesture may be used to express this intent to delegate. For instance, a user might cross over a certain portion of the user interface (indicating that the target endpoint interface entity is not to have the ability to view or input into those fields), and then indicate a share gesture.

In any case, interaction and/or environmental event(s) are detected that are representative of splitting an instance of a smaller class off of the larger transformation chain class (act 1401), thereby initiating the method 1400 of FIG. 14. Based on the detected environment event(s), the system determines that a portion transformation chain class is to be created (act 1402) that represents a portion of the larger transformation chain class. This determination might be made by, for instance, the delegation module 939 of FIG. 9. For instance, referring to FIG. 13A, suppose that a portion transformation chain class is to be created that is represented only by nodes 1305 and 1306. In response, an instance of the portion transformation chain class is instantiated (act 1403) and operated (act 1404). For instance, the second endpoint interface entity may be instructed (by the first endpoint interface entity and/or by the delegation module 939) to interact with the endpoints of the instantiated portion transformation chain class. The instantiated portion transformation chain class may be sent to the second endpoint interface entity.

FIG. 13B represents the portion resulting transformation chain 1300B that includes just the node 1305 and the node 1306. A dotted lined border 1320 is illustrated to represent that a particular endpoint interface entity may have credentials to interface with some or all of the endpoints of the nodes 1305 and 1306. In one embodiment, the splitting is not made for purposes of delegation, and the first endpoint interface entity also has credentials to interface with the endpoints of nodes 1305 and 1306 in the new portion transformation chain 1300B. However, a very useful scenario is that the first endpoint interface entity has delegated privileges to a second endpoint interface entity to interface with at least some endpoints of the nodes 1305 and 1306 of the portion transformation chain 1300B.

FIG. 15A through 15D illustrate several possible embodiments of how such delegation might occur from the perspective of the portion transformation chain 1300B. In the symbolism of FIGS. 15A through 15D, a node represented by dashed lined borders represents a node of which only some of the endpoints of the original node are available for interfacing with the second endpoint interface entity.

In the embodiment 1500A of FIG. 15A, the node 1305 is illustrated with as a solid circle, representing that all endpoints of the node 1305 have been instantiated and made available to the second endpoint interface entity. Meanwhile, the node 1306 is illustrated with a dashed-lined circle, representing that only a portion of the endpoints of the node 1306 have been instantiated and made available to the second endpoint interface entity.

In the embodiment 1500B of FIG. 15B, the node 1306 is illustrated with as a solid circle, representing that all endpoints of the node 1306 have been instantiated and made available to the second endpoint interface entity. Meanwhile, the node 1305 is illustrated with a dashed-lined circle, representing that only a portion of the endpoints of the node 1305 have been instantiated and made available to the second endpoint interface entity.

In the embodiment 1500C of FIG. 15C, the nodes 1305 and 1306 are both illustrated with a dashed-lined circle, representing that only a portion of the endpoints of each of the nodes 1305 and 1306 have been instantiated and made available to the second endpoint interface entity.

In the embodiment 1500D of FIG. 15D, the nodes 1305 and 1306 are both illustrated as a solid circuit, representing that all of the endpoints of each of the nodes 1305 and 1306 have been instantiated and made available to the second endpoint interface entity.

Note that there need be no change to the instance of the transformation chain 1300 that is in state 1300A from the perspective of the first endpoint interface entity. In that case, whatever endpoints are created for nodes 1305 and 1306 for the second endpoint interface entity may simply be cloned endpoints. During operation, if a cloned input endpoint received inconsistent input from both the first endpoint interface entity and the second interface entity, merging criteria may resolve the inconsistency. For instance, perhaps inconsistencies are resolved in favor of the delegating endpoint interface entity. Merging operations may be provided by, for instance, the delegation module 939 of FIG. 9.

In an alternative embodiment, a remainder instance may be created that represents a logical remainder when the portion instance 1300B is subtracted from the larger instance 1300A, and thus no endpoint are cloned at all. For instance, in the case of FIG. 15D, in which the second endpoint interface entity is given access to all endpoints of the nodes 1305 and 1305, a remainder instance may be created with just the nodes 1301 through 1304. In the case of FIG. 15A, the remainder instance might include nodes 1301 through 1304 and a limited form of node and 1306 with only the endpoints that were not included with the node 1306 of the remainder instance being included in the portion instance 1500A. In the case of FIG. 15B, the remainder instance might include nodes 1301 through 1304, and a limited form of node 1305 with only the endpoints that were not included with the node 1305 of the remainder instance being included within the portion instance 1500B. In the case of FIG. 15C, the remainder instance might include nodes 1301 through 1304, and a limited form of node 1305 and 1306 with only the endpoints that were not included with the nodes 1305 and 1306 of the remainder instance being included within the portion instance 1500B.

In operation, the delegation module 939 may allow the first endpoint interface entity to maintain control or supervision over the actions of the second endpoint interface entity in interacting with the portion 1300B of the transformation chain 1300A. For instance, the second endpoint interface entity may be credentialed through the first endpoint interface with respect to the portion 1300B such that data flows to and from the instance of the portion transformation class 1300B are approved by and/or channeled through the remainder of the transformation chain 1300A controlled by the first endpoint interface entity. Furthermore, the access of the second endpoint interface entity to data (such as a data service) is strictly controlled. Data for nodes that are not within the portion transformation chain class are provided via the approval of the first endpoint interface entity.

FIG. 16 illustrates an architecture 1600 in which the larger transformation chain instance 1601A that is assigned to a first endpoint interface 1621A securely interfaces with apportion transformation chain instance 1601B that is assigned to a second endpoint interface 1621B via a proxy service 1610.

The larger transformation chain instance 1601A is similar to the transformation chain 1300A of FIG. 13A, except that the first endpoint interface entity 1621A may access only a portion of the endpoints of the node 1305 (now referred to as node 1305A since it now has more limited interfacing capability with the first endpoint interface entity 1621A) and node 1306 (now referred to as node 1306A since it now has more limited interface capability with the first endpoint interface entity 1621A). The ability of the first endpoint interface entity 1621A to interface with the larger transformation chain instance 1601A is represented by bi-directional arrow 1622A.

The portion transformation chain instance 1601B is similar to the portion transformation chain 1300B of FIG. 13B, except that (similar to the case of FIG. 15C) the second endpoint interface entity 1621B may access only a portion of the endpoints of the node 1305 (now referred to as node 1305B since it now has more limited interfacing capability with the second endpoint interface entity 1621B) and node 1306 (now referred to as node 1306B since it now has more limited interface capability with the second endpoint interface entity 1621B). The ability of the second endpoint interface entity 1621B to interface with the portion transformation chain instance 1601B is represented by bi-directional arrow 1622B.

The proxy service 1610 provides a point of abstraction whereby the second endpoint interface entity 1621B may not see or interact with the nodes 1301 through 1304 of the larger transformation chain instance 1601A, nor may the second endpoint interface entity 1621B interface with any of the endpoints of the nodes 1305 and 1306 that are assigned to the first endpoint interface entity 1621A. As an example, the proxy service 1610 may be established by the delegation module 939 of FIG. 9 at the time that a portion of transformation chain instance is assigned to another endpoint interface instances.

The proxy service 1610 keeps track of which endpoints on node 1305 are assigned to each node 1305A and 1305B, and which endpoints on node 1306 are assigned to each node 1306A and 1306B. When the proxy service 1610 receives input transformations from the larger transformation chain (e.g., node 1301), the proxy service 1610 directs the transformation to each of the nodes 1305A and 1305B as appropriate, depending on which values are affected by the input transformations. Furthermore, when output transformations are provided by the nodes 1305A and 1305B to the node 1301, the proxy service 1610 merges the outputs and provides the merged transformations to the node 1301. For the perspective of the node 1301, it is as though the node 1301 is interacting with node 1305, just as the node 1301 did prior to application splitting. Accordingly, performance and function are preserved, while enabling secure application splitting, by maintaining appropriate information separation between the first and second endpoint interface entities 1621A and 1621B. Such merging of output transformations and splitting of input transformations are performed by component 1611 of the proxy service 1610.

The proxy service 1610 may also include a recording module 1620 that evaluates inputs and outputs made to endpoints in each of the nodes 1305A, 1305B, 1306A and 1306B, and records such inputs and outputs. The recording module 1612 also may record the resulting transformations made between nodes. Such recordings are made into a store 1613. A replay module 1613 allows the actions to be replayed. That may be particular useful if the portion transformation chain is assigned to another (i.e., a third) endpoint interface entity later on and a user of that third endpoint interface entity wants to see what was done. That third endpoint interface may come up to speed with what happened during the tenure of the second endpoint interface entity with the portion transformation chain. Another reason to replay might be to check, and approve, commit, or ratify some action. For instance, imagine an order editing scenario where a number of users are seeking to postpone or move back some deliveries. A first user might ask a second user to help with this. However, the first user does not want the second user to edit the order in a way that causes permanent side effects (e.g., some shipping slot gets released and some now slot gets booked due to a service call). The first user might want to replay what the second user did, and if the first user like was she sees, then accept and commit the actions taken. Here, the replay mechanism additionally simulates the side effecting service calls for the second users. Then, on replay, the first user may cause those service calls to be bound to the actual services. The proxy service 1610 further ensures that the limited credentials of the second endpoint interface entity are enforced. For instance, endpoints on the nodes 1305B and 1306B may not receive proprietary data owned by the first endpoint interface entity from a service, and likewise may not change such proprietary data, at least not without the consent of the first endpoint interface entity.

The splitting of transformation chain instances as described herein allows for a wide variety of scenarios. For instance, by only allowing output endpoints to be cloned in the portion transformation chain provided to the second endpoint interface entity, and retaining input and output endpoints with the first endpoint interface entity, the second endpoint interface entity may have a shared view on what the first endpoint interface entity is doing. Of course, the first endpoint interface entity may restrict which output endpoints are provided in the portion transformation chain, and thus such view sharing can even be restricted. Furthermore, collaborative and co-use scenarios are enabled by dividing input endpoints between the first and second endpoint interface entities. Several instances and versions of a portion transformation chain may be split off of the main transformation chain to allow such scenarios across more than two endpoint interface entities. Each split may have an associated proxy service that maintains proper information separation and functioning of the transformation chain.

FIGS. 17A through 17C illustrate a specific example of the progress of a user interface 1700 through respective states 1700A through 1700C respectively, and shows how application splitting, delegation, and redaction can occur in one of an infinite variety of scenarios enabled by the broader principles described herein. The user interface state 1700A shows an object 1710 being displayed. The object is an “orders object” and represents only a portion of the total user interface that the underlying application (e.g., a transformation chain) is able to provide. The order object 1710 includes an enumeration of four order fields 1711 through 1714. Each order field includes a name of the order, a picture of the item ordered, and a purchase order number. The user may interact (and example of an environmental event) with the object 1710 by selecting one of the orders, causing properties of the order to appear in a details field 1715. In FIG. 17A, the field 1711 is selected (as represented by the think vertical bar 1716), representing that the details field 1715 includes details about that order. In this example, the order object may correspond to a node in a transformation chain, with visualizations of the order object being output endpoints of that node, and points of input capability being input endpoints of that node.

Now suppose that the user provides a selection user interaction with respect to the user interface 1700, or more specifically provides a selection user interaction with respect to the orders object 1710. Such selection user interaction might include a gesture. For instance, in the state 1700A, the user has circled (with gesture 1720) the orders object 1710. This results in selection of the orders object.

In FIG. 17B, a subsequent state 1700B is shown in which the user has provided a redaction user interaction with respect to the user interface, or more specifically with respect to a subportion of the selected portion. In this example, the user has redacted field 1712, by entering a cross-out gesture with respect to the user interface corresponding to that subportion (i.e., by crossing-out field 1712).

In FIG. 17C, a subsequent state 1700C is shown in which the user has selected a target for sharing the selecting portion (minus the redacted subportion), and has initiated sharing with that target portion. In particular, the user has interacted with element 1740, causing sharing to occur of the order object 1710 with the field 1712 redacted. Such is an example of one of an enumerable variety of sharing that may be accomplished using the principles described herein.

FIG. 18 illustrates a flowchart of a method 1800 for sharing an application in response to user input or other environmental event(s) at a first endpoint interface entity. The method is performed in the context of there being multiple applications operating (act 1801). For instance, in FIG. 9, there are multiple applications in the form of transformation chains operating within the universal canvas 910. Furthermore, a registry of multiple endpoint interface entities is kept (act 1802). In FIG. 9, for example, this registry may be maintained by the endpoint interface entity registry module 935. Recall that an endpoint interface entity may be a hardware entity and perhaps include associated user criteria defining a user status with respect to that hardware entity. Perhaps a single user may satisfy the user criteria with respect to multiple of the registered endpoint interface entities

For each of the applications, the content of box 1810 is performed. Specifically, at least one endpoint interface entity selected from the endpoint interface registry is identified (act 1811) as to interface with the application (or a portion thereof). This selection may include determining that the identified endpoint interface entity is credentialed to interface (or correspond) with the application (or the portion thereof). As part of this identification, it is determined that the environmental event(s) (if any) are satisfied with respect to the endpoint interface entity (act 1821). For instance, in FIG. 9, this identification may be made by the endpoint matching module 937.

The identified endpoint interface entity is then allowed (act 1812) to interface with the application (or the portion thereof). In other words, within the scope of the application (or the portion thereof), the identified endpoint interface entity is permitted to interface with the corresponding application endpoints within that scope. In the case of a split application, in which different endpoint interface entities are to interface with different portions of the application, the delegation module 939 operates as described above.

In the event that there are multiple endpoint interface entities that are available for a given application, the identification of an appropriate endpoint interface entity (act 1811) might also include determining that 1) an output endpoint for rendering at the hardware entity of the identified endpoint interface entity is efficiently perceivable to at least one (a plurality of) user that satisfies(y) the user criteria of the identified endpoint interface entity, or has some specific characteristic helpful or required to complete a portion of a user's task intent or delivery the appropriate action in response to some implicit event in the environment, and 2) does not conflict with at least one other output endpoint rendered at the hardware entity so as to adversely affect perception of at least one user that satisfies the user criteria. Similarly, the identification of an appropriate endpoint interface entity (act 1811) might also include determining that 1) an input endpoint for inputting at the hardware entity of the identified endpoint interface entity is capable of receiving input from at least one (a plurality of) active endpoint interface entities, or has some specific characteristic helpful or required to complete a portion of a user's task intent or delivery the appropriate action in response to some implicit event in the environment; and 2) an input endpoint for inputting at the hardware entity of the identified endpoint interface entity does not conflict with at least one other input endpoint rendered at the hardware entity so as to adversely affect ability to input of at least one user that interfaces with another endpoint interface entity. Through these determinations with respect to all input and output endpoints of the application, an appropriate distribution of interfacing may be determined.

Distributed Interfacing

FIG. 19 illustrates a flowchart of a method 1900 for distributed interfacing with an application across a plurality of hardware entities. The method 1900 is an example of the act 1812 of FIG. 18 in the context of there being multiple endpoint interface entities that interface with a particular application. The method includes identifying that multiple hardware entities are available to interface with an application having multiple endpoints (act 1901). The method 1900 then includes performing of distribution of assignments (act 1902) of the hardware entities to interact with the endpoints. This assignment includes assigning which application endpoints each hardware entity may interface with. This assignment may be rules-based.

When the application is thereafter operated (act 1903), various interaction is performed at the endpoints. The presentation module 938 tailors the interaction (act 1904) of the hardware entities with the endpoints by, for each endpoint, restricting the interaction capability of the endpoint perhaps according to the input and output hardware capabilities of the hardware entities. For instance, if an object is to be displayed on a large display that has no touch input, a prompt to “touch here” to perform some function may be removed, whereas if the object is being displayed on a touch screen, that prompt may be present. If information is being displayed via a particular output endpoint on a high fidelity display, perhaps more detail may be displayed on the high fidelity display as compared to, for instance, a watch having a smaller display. Thus, the interaction capability of an endpoint may be restricted. In other words, the input to an endpoint may be restricted according to capabilities of the hardware entity, and output from an endpoint may be restricted according to capabilities of the hardware entity.

Furthermore, restrictions may be made depending on detection of environmental event(s) associated with a hardware entity. For instance, if most users are further away from the display, less detail might be displayed in favor of enlargement of visualizations. The rules for determining how to restrict an endpoint may be based on at least in part on 1) the interaction capabilities of the hardware entities, 2) anticipated interference in the capabilities of the hardware entities 3) a position of one or more users with respect to at least one or more of the hardware entities; and 4) a control of one or more users with respect to one or more of the hardware entities.

In some embodiments, rather than the presentation module 938 deciding how each display is to display given information assigned to that display, the computing system associated with each display may be given flexibility in how it displays such assigned information. Such flexibility may be constrained (or at least informed) by presentation rules provided by the presentation module 938. Accordingly, for any given display, the application itself does not predefine what information is to be displayed on the display, nor even how such information would be displayed. Rather, the presentation module 938 may assign information to each display and also provide display rules, and each computing system associated with a display interprets those rules and provides an appropriate layout. Such rule based formatting is quite helpful in an environment in which the information to be displayed changed quite dynamically, and even the application itself is often redefined. This may be especially true in a dynamic environment in which a variety of input and output devices are available, and user move into and out of and through the multi-device environment.

FIG. 20 illustrates a flowchart of method 2000 for displaying information on a display in accordance with the principles described herein. The method 2000 includes accessing a set of information output by an application (act 2001), which set of information is to be at least partially rendered on a display. For instance, such set of information may be provided by the presentation module 938 upon performing method 1900 of FIG. 19. As previously mentioned, however, the layout of the set of information is not predetermined by the application given the display. The method 2000 also includes accessing (act 2002) a set of one or more display rules that are associated with the set of information. The display rules may also be provided by the presentation module 938.

The computing system associated with the display then uses the set of one or more display rules to determine (act 2003) how to layout the set of information on the display. The computing system then displays at least some of the set of information in accordance with the determined layout (act 2004). The method 2000 may be performed each time the presentation module 938 changes that assignment of the set of information to be at least partially displayed by the display, and each time the presentation module 938 changes the rules for display. For instance, the set of information to be displayed may change when an application is augmented (as described with respect to FIG. 11), or split (as described with respect to FIG. 14), or when the presentation module 938 simply changes the allocation of output amongst displays and output devices in response to environmental events. The method 2000 may also be independently performed on each computing system with respect to its own display and given its different set of information and display rules.

As examples only, the display rules may include indications of which a portion of the set of information is mergable with another portion of the set of information. Alternatively or in addition, the display rules may include a relationship between portions of the set of information, such as a particular role (e.g., primary, master, higher priority) that one portion of information has with respect to another (e.g., secondary, slave, lower priority). Alternatively or in addition, the display rules may indicate whether a portion of the set of information is already being displayed on another display, or whether a portion of the set of information should not be overseen by other users. Accordingly, a flexible mechanism for displaying dynamically changing content on a display has been described.

Synchronous to Asynchronous Transition

One benefit of the split application configuration described with respect to FIG. 16 is that data flows and interactions of the portion of the application assigned to a delegee endpoint interface entity are recorded. Thus, data flows to that portion that are synchronous in nature may be converted into asynchronous communications by recording of the same. This allows the recordings to be replayed or transferred to another hardware entity. Thus, the principles described herein allow smooth transitioning of communications from synchronous to asynchronous.

FIG. 21 illustrates a flowchart of a method 2100 for a first portion of an application to communicate with a second portion of an application in a manner that prepares for such transitioning from synchronous to asynchronous. In the described context, the applications may be transformation chains. Throughout the method, data flow is monitored between the portions of the application (act 2101). This monitoring may also include monitoring of data flows amongst nodes within the second portion, and/or interaction of the second endpoint interface entity with endpoint nodes of the second application portion. For instance, in the context of FIG. 16, the recording module 1612 may perform the monitoring in the context of the first portion of the application being the portion 1601A, and the second portion of the application being the portion 1601B.

If, during this monitoring (act 2101), data flow is detected (“Yes” in decision block 2110), the data flow is recorded (act 2111), and the method returns to continue monitoring (act 2101). If, during this monitoring (act 2101), interactions between the second hardware entity and the second portion of the application are detected (“Yes” in decision block 2120), the interactions are recorded (act 2121), and the method returns to continue monitoring (act 2101). At times when there are no data flows detected (“No” in decision block 2110) and no interactions detected (“No” in decision block 2120), the monitoring simply continues as long as the application is split.

The recordings are made in a manner that they can be replayed (e.g., by the second hardware entity that is assigned to the second portion of the application) or reassigned (e.g., from the second hardware entity to a third hardware entity). FIG. 22 illustrates a flowchart of a method 2200 for transitioning to asynchronous communications in the context of synchronous communications being recorded. First, a request is received (or appropriate environment event(s) are detected suggesting that it would be helpful) to replay the recorded communications (act 2201), after which the requested replay is performed (act 2202). For instance, if the second endpoint interface entity was not readily prepared for the synchronous communication from the first endpoint interface entity, the second endpoint interface entity may simply replay the communications to come up to speed.

In another scenario, the first endpoint interface entity may reassign the split portion of the application from the second endpoint interface entity to a third endpoint interface entity, without the first endpoint interface entity having to redo the communication, and being able to take advantage of what input the second endpoint interface entity was able to provide. FIG. 23 illustrates a flowchart of a method 2300 for reassigning the split portion of an application to another endpoint interface entity. Specifically, a request is detected (or appropriate environment event(s) are detected suggesting that it would be helpful) to move the split portion of the application (act 2301). For instance, FIG. 24 illustrates an environment 2400 in which such a move request may be made. The first portion 2411 of an application had been communicating (as represented by arrow 2431) with a second portion 2421 of the application. A first hardware entity 2410 is interacting (as represented by arrow 2412) with endpoints of the first portion 2411 of the application. A second hardware entity 2420 at least has the capability of interacting (as represented by arrow 2422) with endpoints of the second portion 2421 of the application. During these communications, the recorded information 2423 (i.e., the recorded data flow represented by arrow 2431, and the recorded interactions represented by arrow 2422) is also maintained.

In response to the move request (act 2301), a third endpoint interface entity 2430 is permitted to interact with the second portion 2421 of the application (act 2302), and the recorded information 2423 is provided to the third endpoint interface entity 2430 (act 2303). This transfer of control and recorded information regarding the second portion of the application from the second endpoint interface entity to the third endpoint interface entity is represented by arrow 2440 in FIG. 24. Thereafter, the first portion of the application may communicate (as represented by arrow 2432) with the second portion of the application that has now been reassigned to the third endpoint interface entity 2430.

Formatting of displayed information becomes challenging in this environment due to the many degrees of freedom that could affect how information is formatted and laid out. For instance, the application itself may grow and be split, as previously described, and thus the application itself may change dynamically over even a short period of time. This affects the number and nature of the output endpoints that result in visualizations. Furthermore, there may be multiple hardware entities rendering visualizations of an application, each with varying capability to display. In addition, changing environmental conditions may change the availability of a hardware entity to render information. For instance, due to enforcement of user criteria, changing conditions may cause endpoint interface entities to dynamically become available and unavailable.

FIG. 25 illustrates a flowchart of a method 2500 for facilitating layout on a display that receives output from an application that redefines during use. The method 2500 may be performed with respect to each available display that renders information from output endpoints of the application. First, a layout of information is presented (act 2501). Then, however, due to any one of the degrees of freedom previously mentioned, a trigger is detected (act 2502) for changing the layout. In response, the layout for that display is altered (act 2503), and the altered layout is presented (act 2501). The process is repeated with each detected trigger, thereby changing the layout. The changed layout of information may represent a change in the information that is presented. For instance, perhaps more or less detail is displayed, or perhaps subject matter not previously displayed is brought into the display, or subject matter is moved away from the display. Computations may also be performed on the visualizations. For instance, information might be merged in a display.

Examples of triggers that might change the layout include, but are not limited to, 1) the first application changes to a second application due to growth or splitting of the application, 2) a change in allocation of output between multiple displays, 3) a change in users of the display, 4) a change in position of one or more users with respect to the display, 5) a change in control of one or more users with respect to the display, 6) a change in authorization of one or more users with respect to the display or the information displayed.

Rather than simply applying to layout, the method 2500 of FIG. 25 could be applied to all forms of output and all forms of input. For instance, as for output, some parts of the output may be spoken. Some endpoint interface entities may light up or vibrate, or more to convey information (e.g., a screen swivels just a tad to suggest urgency, or an accompanying drone maneuvers in a certain noticeable way). Different parts of the output may be sequenced, rather than juxtaposed, perhaps by creating an animation on the same or multiple endpoint interface entities. For input, as an example, a particular input menu may be lit up on one display, rather than another. One microphone may be switched on, rather than another (with a light on the microphone indicating which microphone is active). Of course, these are just examples.

Accordingly, a robust and organic application model has been described on the basis of transformation chains. The concept of transformation chains was first described with respect to FIGS. 1 through 8. An example supporting architecture was then described with respect to FIG. 9. Thereafter, various operations of the transformation chains (including joining, splitting, delegation, endpoint restriction, formatting, and so forth) were described with respect to FIGS. 10 through 25. Of course, all of these functions are supported by computing technology. Accordingly, a general computing system will now be described for the sake of completeness with respect to FIG. 26.

Computing System Description

Computing systems are now increasingly taking a wide variety of forms. Computing systems may, for example, be handheld devices, appliances, laptop computers, desktop computers, mainframes, distributed computing systems, or even devices that have not conventionally been considered a computing system. In this description and in the claims, the term “computing system” is defined broadly as including any device or system (or combination thereof) that includes at least one physical and tangible processor, and a physical and tangible memory capable of having thereon computer-executable instructions that may be executed by the processor. The memory may take any form and may depend on the nature and form of the computing system. A computing system may be distributed over a network environment and may include multiple constituent computing systems.

As illustrated in FIG. 26, in its most basic configuration, a computing system 2600 typically includes at least one hardware processing unit 2602 and memory 2604. The memory 2604 may be physical system memory, which may be volatile, non-volatile, or some combination of the two. The term “memory” may also be used herein to refer to non-volatile mass storage such as physical storage media. If the computing system is distributed, the processing, memory and/or storage capability may be distributed as well. As used herein, the term “executable module” or “executable component” can refer to software objects, routings, or methods that may be executed on the computing system. The different components, modules, engines, and services described herein may be implemented as objects or processes that execute on the computing system (e.g., as separate threads).

In the description that follows, embodiments are described with reference to acts that are performed by one or more computing systems. If such acts are implemented in software, one or more processors of the associated computing system that performs the act direct the operation of the computing system in response to having executed computer-executable instructions. For example, such computer-executable instructions may be embodied on one or more computer-readable media that form a computer program product. An example of such an operation involves the manipulation of data. The computer-executable instructions (and the manipulated data) may be stored in the memory 2604 of the computing system 2600. Computing system 2600 may also contain communication channels 2608 that allow the computing system 2600 to communicate with other message processors over, for example, network 2610.

The computing system 2600 also may potentially include output rendering components, such as displays, speakers, lights, actuators, or the like. The computing system 2600 may also include input components, such as a keyboard, pointer device (such as a mouse or tracking pad), voice recognition devices, and possibly also physical sensors (e.g., thermometers, global positioning systems, light detectors, compasses, accelerometers, and so forth).

Embodiments described herein may comprise or utilize a special purpose or general purpose computer including computer hardware, such as, for example, one or more processors and system memory, as discussed in greater detail below. Embodiments described herein also include physical and other computer-readable media for carrying or storing computer-executable instructions and/or data structures. Such computer-readable media can be any available media that can be accessed by a general purpose or special purpose computer system. Computer-readable media that store computer-executable instructions are physical storage media. Computer-readable media that carry computer-executable instructions are transmission media. Thus, by way of example, and not limitation, embodiments of the invention can comprise at least two distinctly different kinds of computer-readable media: computer storage media and transmission media.

Computer storage media includes RAM, ROM, EEPROM, CD-ROM or other optical disk storage, magnetic disk storage or other magnetic storage devices, or any other storage medium which can be used to store desired program code means in the form of computer-executable instructions or data structures and which can be accessed by a general purpose or special purpose computer.

A “network” is defined as one or more data links that enable the transport of electronic data between computer systems and/or modules and/or other electronic devices. When information is transferred or provided over a network or another communications connection (either hardwired, wireless, or a combination of hardwired or wireless) to a computer, the computer properly views the connection as a transmission medium. Transmissions media can include a network and/or data links which can be used to carry desired program code means in the form of computer-executable instructions or data structures and which can be accessed by a general purpose or special purpose computer. Combinations of the above should also be included within the scope of computer-readable media.

Further, upon reaching various computer system components, program code means in the form of computer-executable instructions or data structures can be transferred automatically from transmission media to computer storage media (or vice versa). For example, computer-executable instructions or data structures received over a network or data link can be buffered in RAM within a network interface module (e.g., a “NIC”), and then eventually transferred to computer system RAM and/or to less volatile computer storage media at a computer system. Thus, it should be understood that computer storage media can be included in computer system components that also (or even primarily) utilize transmission media.

Computer-executable instructions comprise, for example, instructions and data which, when executed at a processor, cause a general purpose computer, special purpose computer, or special purpose processing device to perform a certain function or group of functions. The computer executable instructions may be, for example, binaries or even instructions that undergo some translation (such as compilation) before direct execution by the processors, such as intermediate format instructions such as assembly language, or even source code. Although the subject matter has been described in language specific to structural features and/or methodological acts, it is to be understood that the subject matter defined in the appended claims is not necessarily limited to the described features or acts described above. Rather, the described features and acts are disclosed as example forms of implementing the claims.

Those skilled in the art will appreciate that the invention may be practiced in network computing environments with many types of computer system configurations, including, personal computers, desktop computers, laptop computers, message processors, hand-held devices, multi-processor systems, microprocessor-based or programmable consumer electronics, network PCs, minicomputers, mainframe computers, mobile telephones, PDAs, pagers, routers, switches, and the like. The invention may also be practiced in distributed system environments where local and remote computer systems, which are linked (either by hardwired data links, wireless data links, or by a combination of hardwired and wireless data links) through a network, both perform tasks. In a distributed system environment, program modules may be located in both local and remote memory storage devices.

Accordingly, the principles described herein provide a new application paradigm in which compound and customized applications may be built dynamically as the need arises by the users themselves based on input from the user.

The present invention may be embodied in other specific forms without departing from its spirit or essential characteristics. The described embodiments are to be considered in all respects only as illustrative and not restrictive. The scope of the invention is, therefore, indicated by the appended claims rather than by the foregoing description. All changes which come within the meaning and range of equivalency of the claims are to be embraced within their scope.

Claims

1. A computing system comprising; one or more processors;one or more computer-readable storage media having thereon computer-executable instructions that are structured such that, when executed by the one or more processors, the computing system becomes configured to perform the following:an act of accessing a set of information output by an application and to be displayed on a display, wherein a layout of the set of information is not predetermined by the application given the display;an act of accessing a set of one or more display rules that are associated with the set of information; andan act of using the set of one or more display rules to determine how to layout the set of information on the display.

2. The computing system in accordance with claim 1, further comprising: the display, wherein the computing system further becoming configured to perform the following:an act of displaying at least some of the set of information in accordance with the determined layout.

3. The computing system in accordance with claim 1, the set of information being a first set of information and the set of one or more display rules being a first set of one or more display rules, the computing system further becoming configured to performing the following in response to accessing a second set of output by the application to be displayed on the display, and having a second set of one or more display rules: an act of using the second set of one or more display rules to determine how to layout the second set of information on the display.

4. The computing system in accordance with claim 3, further comprising: the display, wherein the computing system further becoming configured to perform the following:an act of displaying at least some of the second set of information in accordance with the determined layout of the second set of information.

5. The computing system in accordance with claim 3, the second set of information being to be displayed instead of the first set of information due to a change in the application.

6. The computing system in accordance with claim 5, the change in the application being an augmentation of the application.

7. The computing system in accordance with claim 5, the change in the application being a splitting of the application.

8. The computing system in accordance with claim 5, the change in the application being a change in allocation of output amongst multiple output devices.

9. The computing system in accordance with claim 1, the set of one or more display rules comprising whether a first portion of the set of information is mergable with a second portion of the set of information.

10. The computing system in accordance with claim 1, the set of one or more display rules comprising whether a first portion of the set of information has a particular role with respect to a second portion of the set of information.

11. The computing system in accordance with claim 1, the set of one or more display rules comprising whether a first portion of the set of information has a higher priority than a second portion of the set of information.

12. The computing system in accordance with claim 1, the set of one or more display rules comprising whether or not a portion of the set of information is already being displayed on another display.

13. The computing system in accordance with claim 1, the set of one or more display rules comprising whether or not a portion of the set of information is not to be overseen by another user.

14. The computing system in accordance with claim 1, the set of one or more display rules comprising a relationship between a first portion of the set of information and a second portion of the set of information.

15. A method for displaying at least a portion of a set of information output by an application on a display, the method comprising: an act of accessing a set of information output by an application and to be displayed on a display, wherein a layout of the set of information is not predetermined by the application given the display;an act of accessing a set of one or more display rules that are associated with the set of information; andan act of using the set of one or more display rules to determine how to layout the set of information on the display.

16. The method in accordance with claim 15, further comprising: an act of displaying at least some of the set of information in accordance with the determined layout.

17. The method in accordance with claim 15, the set of information being a first set of information and the set of one or more display rules being a first set of one or more display rules, the method further comprising: an act of accessing a second set of output by the application to be displayed on the display;an act of accessing a second set of one or more display rules associated with the second set of output;an act of using the second set of one or more display rules to determine how to layout the second set of information on the display; andan act of displaying at least some of the second set of information in accordance with the determined layout of the second set of information.

18. The method in accordance with claim 17, the second set of information being to be displayed instead of the first set of information due to a change in the application.

19. The method in accordance with claim 18, the change in the application being an augmentation of the application.

20. A computer program product comprising one or more computer-readable storage media having thereon computer-executable instructions that are structured such that, when executed by the one or more processors, the computing system becomes configured to perform the following: an act of accessing a set of information output by an application and to be displayed on a display, wherein a layout of the set of information is not predetermined by the application given the display;an act of accessing a set of one or more display rules that are associated with the set of information; andan act of using the set of one or more display rules to determine how to layout the set of information on the display.