Abstract: Methods, systems, and computer storage media for providing a multi-tenant system that executes graph language requests using graph operations of a graph language. A graph language request—that configures tenant data for tenants in a multi-tenant system—is executed using a graph operations engine. The graph operations engine receives and parses a graph language request that includes a list of tenants and a definition of data operations. The set of data operations of the definition are executed on a tree of data operation nodes comprising a plurality of leaf nodes and a root node. Executing the data operations is based on graph language actions (e.g., composition, transformation, and aggregation) that support asynchronously returning results data associated with configuring the Tenant data. Executing the data operations of the definition causes generation of results data (e.g., root node results or leaf node results) configuration of the tenant data in the multi-tenant system.

Abstract: Methods, systems, and computer storage media for providing a multi-tenant system that executes graph language requests using graph operations of a graph language. A graph language request—that configures tenant data for tenants in a multi-tenant system—is executed using a graph operations engine. The graph operations engine receives and parses a graph language request that includes a list of tenants and a definition of data operations. The set of data operations of the definition are executed on a tree of data operation nodes comprising a plurality of leaf nodes and a root node. Executing the data operations is based on graph language actions (e.g., composition, transformation, and aggregation) that support asynchronously returning results data associated with configuring the Tenant data. Executing the data operations of the definition causes generation of results data (e.g., root node results or leaf node results) configuration of the tenant data in the multi-tenant system.

Abstract: Methods, systems, and computer storage media for providing a multi-tenant system that executes graph language requests using graph operations of a graph language. A graph language request—that configures tenant data for tenants in a multi-tenant system—is executed using a graph operations engine. The graph operations engine receives and parses a graph language request that includes a list of tenants and a definition of data operations. The set of data operations of the definition are executed on a tree of data operation nodes comprising a plurality of leaf nodes and a root node. Executing the data operations is based on graph language actions (e.g., composition, transformation, and aggregation) that support asynchronously returning results data associated with configuring the Tenant data. Executing the data operations of the definition causes generation of results data (e.g., root node results or leaf node results) configuration of the tenant data in the multi-tenant system.

Abstract: A client tracking mechanism has a log file analysis routine that may generate two tables, one having a licensable entity designator and last logged off time, and the other having a current session designator. The first table may be aggregated by a server that may collect data from multiple client tracking mechanisms to determine a licensable entity's sessions across multiple servers. The client tracking mechanism may save and resume analysis from the last analyzed log file entry, and may be able to track sessions that are both shorter and longer than the time between each analysis. In many embodiments, a licensable entity may be a user or a device, when a license arrangement is configured in a per-user or per-device basis.

Abstract: Processing a notification intended for delivery to multiple recipients associated with a broadcast list. Software executes within an alerts service environment to receive a notification addressed to a broadcast alias, determine a list of recipients associated with the broadcast alias to receive the notification, and broadcast the received notification to each recipient in the determined list.

Abstract: A secondary output of a user interface created using a presentation framework may be created by making a clone of the user interface, then modifying the cloned user interface by expanding various components. The cloned user interface may also be configured to the output characteristics of the secondary output, which may be a printer or other hardcopy device. The user interface may be created with callbacks or other actions that may be executed when the cloned user interface is configured. The callbacks may cause certain user interface components to be changed on the cloned version of the user interface.

Abstract: A user interface mechanism may be defined by a story from which a wizard engine may create a user interface. The engine may present the story using various user interface containers that define a layout and general functions of a user interface, along with styles that may define the ‘look and feel’ of the user interface. The story may define an action performed once data are collected from the user. The story may also define data passed to the action, as well as the data collected from a user. The story may further define translation routines or other actions that may be launched in response to receiving user action and used to generate data that may be passed to the action.

Abstract: A user interface mechanism may be defined by a story from which a wizard engine may create a user interface. The engine may present the story using various user interface containers that define a layout and general functions of a user interface, along with styles that may define the ‘look and feel’ of the user interface. The story may define an action performed once data are collected from the user. The story may also define data passed to the action, as well as the data collected from a user. The story may further define translation routines or other actions that may be launched in response to receiving user action and used to generate data that may be passed to the action.

Abstract: A secondary output of a user interface created using a presentation framework may be created by making a clone of the user interface, then modifying the cloned user interface by expanding various components. The cloned user interface may also be configured to the output characteristics of the secondary output, which may be a printer or other hardcopy device. The user interface may be created with callbacks or other actions that may be executed when the cloned user interface is configured. The callbacks may cause certain user interface components to be changed on the cloned version of the user interface.

Abstract: Described is a technology by which logged events such as in a security event log (e.g., within a defined timeframe) are processed to determine logon times and logoff times, which are then used to determine system usage. Logoff times may correspond to an actual logoff event, a shutdown event, or another login. In one example, logon and logoff times determine the combined times that each user of the system was logged on, e.g., a total session time for each user. Multiple users' times may be combined into a total usage time of all users. Each user's combined session time may be evaluated against the total usage time to determine whether any user is a primary user, e.g., by being logged on more than a threshold percentage of the total usage time. A primary user may be identified, or the system determined to be a shared system without a primary user.

Abstract: A user interface mechanism may be defined by a story from which a wizard engine may create a user interface. The engine may present the story using various user interface containers that define a layout and general functions of a user interface, along with styles that may define the ‘look and feel’ of the user interface. The story may define an action performed once data are collected from the user. The story may also define data passed to the action, as well as the data collected from a user. The story may further define translation routines or other actions that may be launched in response to receiving user action and used to generate data that may be passed to the action.

Abstract: A secondary output of a user interface created using a presentation framework may be created by making a clone of the user interface, then modifying the cloned user interface by expanding various components. The cloned user interface may also be configured to the output characteristics of the secondary output, which may be a printer or other hardcopy device. The user interface may be created with callbacks or other actions that may be executed when the cloned user interface is configured. The callbacks may cause certain user interface components to be changed on the cloned version of the user interface.

Abstract: A set of structured data may be stored using a format file and a data file. The format file may contain a hierarchical structure in the form of classes and relationships, while the data file may store the instances of the data in a serialized form. The format file may include projection types as well as repeating or nested types. The data file may contain instances of the structured data in the form of rows, with commas or other delimiters separating the data items. The structure of the data file may be created by traversing the format file to create a fully populated list of data items representing the structured data. An application may read the format file and data file to import complex data types and populate instances of those data types.

Abstract: A user interface may be selected for a system with hierarchical data types by traversing an inheritance tree to find a pre-defined user interface, or by automatically generating a user interface based on the type definition. The automatically generated user interface may include tabs or groupings for components of the data type that may be inherited from other data types. In some embodiments, portions of the automatically generated user interface may be obtained from other data types.

Abstract: Described is a technology by which directly ascertainable properties of a processor are collected, and used as a key to access other information about the processor, such as age-related information maintained in a separate lookup table. If a matching entry is not found, the property information may be added to an unknown list and/or used to dynamically update the lookup table. A data structure such as a record comprises a set of fields including fields containing data representative of properties of a processor, a key value determined from the data in at least some of the fields and an identifier that identifies the processor relative to other processors of other computing devices. The fields may include manufacturer data, brand identifier data, cache information, normalized processor speed data, mobile chip information and/or CPU model data.

Abstract: A schema-based service for Internet access to per-user services data, wherein access to data is based on each user's identity. The service includes a schema that defines rules and a structure for each user's data, and also includes methods that provide access to the data in a defined way. The services schema thus corresponds to a logical document containing the data for each user. The user manipulates (e.g., reads or writes) data in the logical document by data access requests through defined methods. In one implementation, the services schemas are arranged as XML documents, and the services provide methods that control access to the data based on the requesting user's identification, defined role and scope for that role. In this way, data can be accessed by its owner, and shared to an extent determined by the owner.

Abstract: Described is a technology by which directly ascertainable properties of a processor are collected, and used as a key to access other information about the processor, such as age-related information maintained in a separate lookup table. If a matching entry is not found, the property information may be added to an unknown list and/or used to dynamically update the lookup table. A data structure such as a record comprises a set of fields including fields containing data representative of properties of a processor, a key value determined from the data in at least some of the fields and an identifier that identifies the processor relative to other processors of other computing devices. The fields may include manufacturer data, brand identifier data, cache information, normalized processor speed data, mobile chip information and/or CPU model data.

Abstract: Described is a technology by which logged events such as in a security event log (e.g., within a defined timeframe) are processed to determine logon times and logoff times, which are then used to determine system usage. Logoff times may correspond to an actual logoff event, a shutdown event, or another login. In one example, logon and logoff times determine the combined times that each user of the system was logged on, e.g., a total session time for each user. Multiple users' times may be combined into a total usage time of all users. Each user's combined session time may be evaluated against the total usage time to determine whether any user is a primary user, e.g., by being logged on more than a threshold percentage of the total usage time. A primary user may be identified, or the system determined to be a shared system without a primary user.

Abstract: A client tracking mechanism has a log file analysis routine that may generate two tables, one having a licensable entity designator and last logged off time, and the other having a current session designator. The first table may be aggregated by a server that may collect data from multiple client tracking mechanisms to determine a licensable entity's sessions across multiple servers. The client tracking mechanism may save and resume analysis from the last analyzed log file entry, and may be able to track sessions that are both shorter and longer than the time between each analysis. In many embodiments, a licensable entity may be a user or a device, when a license arrangement is configured in a per-user or per-device basis.

Abstract: A schema-based service for Internet access to per-user services data, wherein access to data is based on each user's identity. The service includes a schema that defines rules and a structure for each user's data, and also includes methods that provide access to the data in a defined way. The services schema thus corresponds to a logical document containing the data for each user. The user manipulates (e.g., reads or writes) data in the logical document by data access requests through defined methods. In one implementation, the services schemas are arranged as XML documents, and the services provide methods that control access to the data based on the requesting user's identification, defined role and scope for that role. In this way, data can be accessed by its owner, and shared to an extent determined by the owner.