Abstract: Systems and methods for selecting items of interest for an organization from a set of feeds, based on the interests that users have demonstrated through their interactions with existing content, are described herein. In some embodiments, the system is part of a content management service that allows users to add and organize files, media, links, and other information. The content can be uploaded from a computer, imported from cloud file systems, added via links, or pulled from various kinds of feeds.

Abstract: The disclosed technology provides systems and methods for filtering information based on a set of properties. The information consists of a set of items that the user is interacting with, such as documents, presentations, audio and video files, and the like. The properties can be specified by the user (by, for example, putting a set of items in lists and folders), based on actions taken by users in the system (such as commenting on, or liking, or viewing an item), or can represent a variety of other characteristics. Related properties can also be grouped together. Furthermore, the disclosed techniques provide mechanisms for automatically identifying useful properties and providing an indication of those useful properties to a user to use in narrowing results.

Abstract: A common infrastructure for management and one way message routing can accommodate a set of related but conceptually different message delivery protocols. Junctions can be simultaneously created and configured at a location within a namespace. As a result, messaging related functionality can be more efficiently and uniformly added to a namespace. Additionally, embodiments include junctions that indicate roles and store behaviors and constraints for roles locally. Thus, computer systems desiring to utilize messaging related functionality can access the junction and utilize messaging related functionality provided at the junction without having to refer to other locations in a namespace (e.g., to perform lookups). Thus, resource and network bandwidth consumption associated with adding and utilizing messaging related functionality to a network infrastructure is reduced.

Abstract: Techniques for identifying and viewing information items within an organization comprising a plurality of users each having one or more roles within the organization is disclosed. The disclosed techniques provide systems and methods for implementing and using a “skim preview” technique for previewing information items. This technique can be applied to a wide variety of information, such as presentations, documents, video, images, and so on and can be used for a variety of applications, including browsing, searching, discovery, and so on. The system can compute sequences that represent interesting visual aspects of the item being viewed. This can be applied to items that do not have a natural set of preview images, or it might be used as an alternative to the natural previews. The preview images may be sequenced chronologically, by importance, or based on any other metric.

Abstract: A system and method for providing services to multiple tenants. A system provides a gateway that acts as an intermediary between the tenants and multiple subsystems that provide resources. A management gateway handles requests to manage resources. A runtime gateway handles requests to perform operations related to the resources. A set of protocol handlers isolates the subsystems from protocols used by the tenants. A pipeline of components provides processing, such as authorization, of requests from tenants. Identification of resources is performed using a mechanism that enables multiple namespaces, which may be designated by tenants.

Abstract: Techniques for organizing information, such as documents, presentations, web sites and web pages, audiovisual media streams, and the like are describe. This disclosed techniques include creating and using an interest graph to support the sharing of information via search, browsing, and discovery, etc. and measuring consumption, engagement, and/or influence based on that information. An interest graph expresses the affinity between people and information—the likelihood that a particular piece of information is of interest to a particular person. The interest graph is based on an understanding of relationships, monitoring of user behavior, and analysis of each piece of information. The interest graph represents many kinds of relationships, including: between users and other users, users and items, and users and collections. The interest graph can be computed using data both from a set of items and from user behavior.

Abstract: Techniques for organizing information, such as documents, presentations, web sites and web pages, audiovisual media streams, and the like are describe. This disclosed techniques include creating and using an interest graph to assist in a user's browsing of information. An interest graph expresses the affinity between people and information—the likelihood that a particular piece of information is of interest to a particular person. The interest graph is based on an understanding of relationships, monitoring of user behavior, and analysis of each piece of information. The interest graph represents many kinds of relationships, including: between users and other users, users and items, and users and collections. The interest graph can be computed using data both from a set of items and from user behavior.

Abstract: Techniques for organizing information, such as documents, presentations, web sites and web pages, audiovisual media streams, and the like are describe. This disclosed techniques include creating and using an interest graph to support the distribution of information to a user via a feed containing information items likely to be of interest to the user. An interest graph expresses the affinity between people and information—the likelihood that a particular piece of information is of interest to a particular person. The interest graph is based on an understanding of relationships, monitoring of user behavior, and analysis of each piece of information. The interest graph represents many kinds of relationships, including: between users and other users, users and items, and users and collections. The interest graph can be computed using data both from a set of items and from user behavior.

Abstract: A method, which identifies information of interest within an organization, determines use data that characterizes relationships among information items within the organization, where the information items include user data and collections of information items. The method generates interest data indicating affinities among the information items based on the determined use data. After receiving a query for data regarding the information items, the method responds to the query by providing one or more results based on the generated interest data. More details are provided herein.

Abstract: The present invention extends to methods, systems, and computer program products for optimizing access to federation infrastructure-based resources. Various different layers within a federation infrastructure can signal location change events indicating the hosting location and/or access location for a resource is to be optimized. In response to a location change event, redirection information for accessing the resource is updated within the federation infrastructure. The redirection information is used to redirect resource access requests to appropriately optimized locations within the federation infrastructure. Redirecting resource access requests reduces communication within the federation infrastructure.

Abstract: The present invention extends to methods, systems, and computer program products for implementing a tenant provisioning system in a multi-tenancy architecture using a single provisioning master in the architecture, and a data center provisioner in each data center in the architecture. The provisioning master receives user requests to provision a tenant of a service and routes such requests to an appropriate data center provisioner. Each service in the multi-tenancy architecture implements a common interface by which the corresponding data center provisioner can obtain a common indication of load from each different service deployed in the data center thus facilitating the selection of a scale unit on which a tenant is provisioned. The common interface also enables a service to dynamically register (i.e. without redeploying the tenant provisioning system) with the provisioning master as a multi-tenancy service by registering an endpoint address with the provisioning master.

Abstract: An application may be modeled as a collection of resource usage. The model allows the application to be elastic so that additional resource usage can be added when needed. Items may be added to and/or removed from applications at any time without regard to the state of the application. Existing items in the application may also be altered at any time regardless of the application state. A set of interfaces are used to manage the resources. The interface allow for the provisioning, configuration, deployment, monitoring and diagnostics of resources in a consistent way.

Abstract: The present invention extends to using Simple Object Access Protocol (“SOAP”) to exchange typed objects, such as, for example, parameters for invoking methods. A computer system accesses typed object parameters corresponding to a typed object. The typed object is annotated with one or more message contract attributes of a message contract model defining a mapping between typed object parameters and corresponding SOAP elements. The computer system utilizes the message contract attributes to map the typed object parameters into a SOAP element and inserts the SOAP element into a SOAP envelope. A receiving computer system accessing the SOAP element and utilizes the message contract attributes to map the SOAP element back into the typed object parameters.

Abstract: A system and method for providing services to multiple tenants. A system provides a gateway that acts as an intermediary between the tenants and multiple subsystems that provide resources. A management gateway handles requests to manage resources. A runtime gateway handles requests to perform operations related to the resources. A set of protocol handlers isolates the subsystems from protocols used by the tenants. A pipeline of components provides processing, such as authorization, of requests from tenants. Identification of resources is performed using a mechanism that enables multiple namespaces, which may be designated by tenants.

Abstract: The present invention extends to methods, systems, and computer program products for using distributed queues in an overlay network. Embodiments of the invention can be used to replicate queue state (e.g., inserted and/or deleted messages) within an overlay network and can be used to continue a process at a different node within the overlay network based on replicated queue state. Accordingly, embodiments of the invention can be used to increase the availability of queue state, compensate for node failures within an overlay network, and promote replication of consistent queue state between nodes within an overlay network.

Abstract: The present invention extends to methods, systems, and computer program products for using distributed queues in an overlay network. Embodiments of the invention can be used to replicate queue state (e.g., inserted and/or deleted messages) within an overlay network and can be used to continue a process at a different node within the overlay network based on replicated queue state. Accordingly, embodiments of the invention can be used to increase the availability of queue state, compensate for node failures within an overlay network, and promote replication of consistent queue state between nodes within an overlay network.

Abstract: The present invention extends to methods, systems, and computer program products for using distributed timers in an overlay network. Embodiments of the invention can be used to replicate timers within an overlay network and can be used to make progress towards completing a portion of work within the overlay network based on a replicated timer. Accordingly, embodiments of the invention can be used to increase the availability of timer data as well as compensate for node failures within an overlay network.

Abstract: The present invention extends to methods, systems, and computer program products for using distributed queues in an overlay network. Embodiments of the invention can be used to replicate queue state (e.g., inserted and/or deleted messages) within an overlay network and can be used to continue a process at a different node within the overlay network based on replicated queue state. Accordingly, embodiments of the invention can be used to increase the availability of queue state, compensate for node failures within an overlay network, and promote replication of consistent queue state between nodes within an overlay network.

Abstract: The present invention extends to methods, systems, and computer program products for using distributed queues in an overlay network. Embodiments of the invention can be used to replicate queue state (e.g., inserted and/or deleted messages) within an overlay network and can be used to continue a process at a different node within the overlay network based on replicated queue state. Accordingly, embodiments of the invention can be used to increase the availability of queue state, compensate for node failures within an overlay network, and promote replication of consistent queue state between nodes within an overlay network.

Abstract: The present invention extends to methods, systems, and computer program products for using distributed queues in an overlay network. Embodiments of the invention can be used to replicate queue state (e.g., inserted and/or deleted messages) within an overlay network and can be used to continue a process at a different node within the overlay network based on replicated queue state. Accordingly, embodiments of the invention can be used to increase the availability of queue state, compensate for node failures within an overlay network, and promote replication of consistent queue state between nodes within an overlay network.