Abstract: A method for evaluating a build of a computer-implemented game is disclosed. An evaluation request is received. The evaluation. request includes an identification of the build, data describing one or more behaviors for the build, and data describing one or more tests. One or more simulations of playing of the build are performed using the one or more behaviors. One or more metrics ate extracted from the simulations. Each of the one or more metrics measures an aspect of the computer-implemented game. One or more tests are applied to the one or more metrics to evaluate an adherence of the build to the one or more tests. A display of the evaluation is caused to be displayed in a user interface of a client device.

Abstract: An application feature store may be integrated with an application. The feature store may be accessed by a user through a feature storefront hosted within the application. The user may search the feature store for additional desired features available for the augmentation of the productivity application.

Abstract: An application store tastemaker recommendation service determines experts within a user's social network(s), receives recommendations from the experts, filters and/or ranks mobile application query results based at least in part on the recommendations. Additionally, the service may further determine the experts based on data compiled about previous actions, reviews, comments, etc., of the experts. Further, the service may provide recommendations to the user to aid in selecting mobile applications for purchase, and may provide an avenue for completing such purchases.

Abstract: A canopy clustering process merges at least one set of multiple single-center canopies together into a merged multi-center canopy. Multi-center canopies, as well as the single-center canopies, can then be used to partition data objects in a dataset. The multi-center canopies allow a canopy assignment condition constraint to be relaxed without risk of leaving any data objects in a dataset outside of all canopies. Approximate distance calculations can be used as similarity metrics to define and merge canopies and to assign data objects to canopies. In one implementation, a distance between a data object and a canopy is represented as the minimum of the distances between the data object and each center of a canopy (whether merged or unmerged), and the distance between two canopies is represented as the minimum of the distances for each pairing of the center(s) in one canopy and the center(s) in the other canopy.

Abstract: Technologies pertaining to computing a metric that is indicative of whether an n-gram in a large corpus of text is a collocation are described herein. The metric is computed in connection with a distributed computing framework, wherein n-grams of varying lengths can be analyzed in a single input data pass, and wherein secondary sorting functionality of the distributed computing framework need not be invoked.

Abstract: A canopy clustering process merges at least one set of multiple single-center canopies together into a merged multi-center canopy. Multi-center canopies, as well as the single-center canopies, can then be used to partition data objects in a dataset. The multi-center canopies allow a canopy assignment condition constraint to be relaxed without risk of leaving any data objects in a dataset outside of all canopies. Approximate distance calculations can be used as similarity metrics to define and merge canopies and to assign data objects to canopies. In one implementation, a distance between a data object and a canopy is represented as the minimum of the distances between the data object and each center of a canopy (whether merged or unmerged), and the distance between two canopies is represented as the minimum of the distances for each pairing of the center(s) in one canopy and the center(s) in the other canopy.

Abstract: A canopy clustering process merges at least one set of multiple single-center canopies together into a merged multi-center canopy. Multi-center canopies, as well as the single-center canopies, can then be used to partition data objects in a dataset. The multi-center canopies allow a canopy assignment condition constraint to be relaxed without risk of leaving any data objects in a dataset outside of all canopies. Approximate distance calculations can be used as similarity metrics to define and merge canopies and to assign data objects to canopies. In one implementation, a distance between a data object and a canopy is represented as the minimum of the distances between the data object and each center of a canopy (whether merged or unmerged), and the distance between two canopies is represented as the minimum of the distances for each pairing of the center(s) in one canopy and the center(s) in the other canopy.

Abstract: To accommodate different types and versions of execution environments on mobile devices, requests for applications from a programmable device, such as a smart phone or other mobile device include status data about the characteristics of the device. Information about the display, memory, storage, and/or script engine may be forwarded with a request. At a fulfillment server, the information is evaluated so that an appropriately versioned and configured application can be custom built, or selected from a pre-built inventory of applications. This allows a user to postpone an upgrade and still receive appropriate versions of executable, optimized to the particular mobile device.

Abstract: Technologies pertaining to computing a respective TF-IDF value for each term in each document of a relative large document corpus are described herein. TF-IDF values are computed with respect to terms in documents of a large document corpus by in a single pass over the document corpus. Secondary sorting functionality of a distributed computing framework is exploited to compute TF-IDF values efficiently.

Abstract: Described herein are various technologies pertaining to identifying global outlier candidates from a relatively large collection of computer-readable objects in a distributed computing environment. The collection of computer-readable objects is partitioned into a plurality of sets of objects, and local outlier candidates are identified from each set of objects in the plurality of sets of objects. The local outlier candidates are updated through a hierarchical pairwise similarity analysis until global outlier candidates are identified. Thereafter, a pairwise similarity analysis is undertaken with respect to the global outlier candidates and the sets of objects in the plurality of sets of objects to identify true global outliers.

Abstract: Technologies pertaining to computing a metric that is indicative of whether an n-gram in a large corpus of text is a collocation are described herein. The metric is computed in connection with a distributed computing framework, wherein n-grams of varying lengths can be analyzed in a single input data pass, and wherein secondary sorting functionality of the distributed computing framework need not be invoked.

Abstract: A canopy clustering process merges at least one set of multiple single-center canopies together into a merged multi-center canopy. Multi-center canopies, as well as the single-center canopies, can then be used to partition data objects in a dataset. The multi-center canopies allow a canopy assignment condition constraint to be relaxed without risk of leaving any data objects in a dataset outside of all canopies. Approximate distance calculations can be used as similarity metrics to define and merge canopies and to assign data objects to canopies. In one implementation, a distance between a data object and a canopy is represented as the minimum of the distances between the data object and each center of a canopy (whether merged or unmerged), and the distance between two canopies is represented as the minimum of the distances for each pairing of the center(s) in one canopy and the center(s) in the other canopy.

Abstract: An application store tastemaker recommendation service determines experts within a user's social network(s), receives recommendations from the experts, filters and/or ranks mobile application query results based at least in part on the recommendations. Additionally, the service may further determine the experts based on data compiled about previous actions, reviews, comments, etc., of the experts. Further, the service may provide recommendations to the user to aid in selecting mobile applications for purchase, and may provide an avenue for completing such purchases.

Abstract: An application store tastemaker recommendation service is usable to determine experts within a user's social network(s), receive recommendations from the experts, and filter and/or rank mobile application query results based at least in part on the recommendations. Additionally, the service may be usable to determine experts based on data compiled about previous actions, reviews, comments, etc., of the experts. Further, the service may be usable to provide recommendations to the user to aid in selecting mobile applications for purchase, and may provide an avenue for completing such purchases.

Abstract: In one aspect, a network system includes a user interface which allows a user to interact with the network system. An agent server is coupled to the user interface. The agent server manages the operation of the network system. Furthermore, the agent server in conjunction with the user interface is operable to create or modify an agent in response to interaction by the user. In another aspect, a network system includes an agent server which manages the operation of the network system. An agent is operable to utilize a service within the network system. A service wrapper, associated with the service, cooperates with the agent server to mediate interaction between the service and the agent.

Abstract: A gaming environment is provided by an MVP gaming system provider in which “most valuable player” (MVP) gamers may compete. MVP gamers may be identified using achievements, gamer scores, game play during sanctioned gaming events, or other indicia of game skills. The MVP gamers may be sponsored by advertisers, and the MVP gamers' avatars may be branded based on sponsorship during gaming events. The sponsorships may be brokered by the MVP gaming system provider. Some gaming events may be sanctioned gaming events that are coordinated by the MVP gaming system provider and “televised” to allow viewers to watch the gaming events. Tutorials from MVP gamers may also be provided to gamers for viewing to assist in their game play. Further, gamers may be able to rent the avatars of MVP gamers for use during their game play.

Abstract: An inventory marketing system operates to identify and market inventory items that are likely to spoil. Initially, inventory items that have a particular likelihood of spoilage may be identified. Customers to target with offers for the inventory items may be identified based on the customers' current location or expected location near a spoilage time for the inventory items. Offers for the inventory items may be provided to the targeted customers, and purchases of the inventory items by customers may be facilitated.

Abstract: A system and method for processing voice requests from a user for accessing information on a computerized network and delivering information from a script server and an audio server in the network in audio format. A voice user interface subsystem includes: a dialog engine that is operable to interpret requests from users from the user input, communicate the requests to the script server and the audio server, and receive information from the script server and the audio server; a media telephony services (MTS) server, wherein the MTS server is operable to receive user input via a telephony system, and to transfer the user input to the dialog engine; and a broker coupled between the dialog engine and the MTS server. The broker establishes a session between the MTS server and the dialog engine and controls telephony functions with the telephony system.

Abstract: This disclosure describes data conversion and techniques for sending and receiving data at a mobile device. In one implementation, a proxy server may receive data from a mobile device. The proxy server may convert the data and send the converted data to a network service. In another implementation, a mobile device may convert data and send that data to a network service. The network service may generate data in response and send that data to the mobile device directly.

Abstract: A transform engine and/or transformation process may reduce computational resources used by a client, such as during the consumption of a media stream. According to some implementations, a media stream is received over a network. A mapping template may be associated with the media stream. A traversal of the mapping template may be performed without the accumulation of an intermediate state. Following the traversal of the mapping template, a transformed media stream may be communicated to a client for presentation.