Patent application number | Description | Published |
20100144378 | REDUCING MESSAGING COSTS - Technology for enabling subscribers to reduce their messaging costs is described. The technology includes employing multiple messaging data messaging services and employing advertisement-based defrayal of messaging charges. A message may be entered or displayed as an SMS message even though a data communications service other than SMS is used to exchange the message between computing devices. When a sender of a message sends an SMS message, the sender may receive an advertisement from an advertiser who defrays the cost of sending the SMS message. The advertiser may also defray the receiving cost for a receiver of the SMS message. | 06-10-2010 |
20100251231 | DEVICE DEPENDENT ON-DEMAND COMPILING AND DEPLOYMENT OF MOBILE APPLICATIONS - 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. | 09-30-2010 |
20100318683 | EFFICIENT TRANSFORM FROM XML TO JAVASCRIPT OBJECTS - 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 | 12-16-2010 |
20100318745 | Dynamic Content Caching and Retrieval - This disclosure provides techniques for dynamic content caching and retrieval. For example, a computing device includes cache memory dedicated to temporarily caching data of one or more applications of the computing device. The computing device also includes storage memory to store data in response to requests by the applications. The storage memory may also temporarily cache data. Further, the computing device includes system software to represent to the applications of the computing device that the portions of the storage memory utilized to cache content are available to store data of the applications. In addition, the computing device includes application programming interfaces to provide content to a requesting application from a cache of the computing device and/or from a remote content source. | 12-16-2010 |
20100333066 | METHOD AND SYSTEM FOR MANAGING SOFTWARE ISSUES - A method of managing software issues includes receiving issue data from a remote host, where the issue data is related to an issue associated with a software application installed on the remote host. The method identifies a potential solution for the issue and sends solution data to the remote host, where the solution data is related to the identified potential solution. Feedback data may be received from the remote host, where the feedback data is indicative of a degree to which the identified potential solution was effective in resolving the issue. | 12-30-2010 |
20110131450 | USING SYNCHRONIZED EVENT TYPES FOR TESTING AN APPLICATION - Embodiments are described for using synchronized event types in testing an application configured to be executed on multiple types of networked devices. The method can include playing a macro containing recorded application events to be applied to the application for testing. The recorded application events can be stored in a macro queue during playback. Further, order independent events can be identified in the macro queue, which precede an order dependent event. This enables identified order independent events to be removed. In addition, an order dependent event in the macro queue can be removed after order independent events preceding the order dependent events are removed. Then the order dependent event from the macro queue can be played after the order dependent event has been removed from the macro queue. | 06-02-2011 |
20110307522 | Light Weight Transformation - A transformation engine and transformation processes may reduce computational resources used by a client or a server, such as during the consumption of a document. According to some implementations, a data stream is received in a first format over a network. A mapping template may be associated with the data stream. A forward-traversal of the mapping template may be performed without the accumulation of an intermediate state. Following the traversal of the mapping template, an output stream is emitted in a second format. | 12-15-2011 |
20110307630 | EFFICIENT TRANSFORM FROM XML TO JAVASCRIPT OBJECTS - 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 | 12-15-2011 |
20120072312 | Curated Application Store - A curated application store is a virtual storefront that includes applications provisioned from one or more application databases. For example, a curator may browse through an application database to find notable applications based on his or her expertise in a certain area and then provision the notable applications from the application database for inclusion in an application store curated by the curator. Accordingly, users browsing for applications pertaining to the area of expertise of the curator may shop for the applications from within a virtual application mall which includes a collection of curated application stores such as the application store curated by the curator. In return, the curator of the store may receive a revenue share from the purchases made within his or her application store. | 03-22-2012 |
20120116905 | APPLICATION STORE TASTEMAKER RECOMMENDATIONS - 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. | 05-10-2012 |
20120117558 | MOBILE APPLICATION MIGRATION SERVICE - A mobile application migration service is usable to receive recommendations for replacement and/or alternative mobile applications for potential mobile device upgrades. Additionally, the service may be usable to compare legacy mobile applications to potential target mobile applications and simulate operation of selected target applications on a new target device. Further, a service may be usable to provide one-click purchase of one or more target applications, one-click installation of the selected target applications, and/or one-click migration of associated user and/or application data from a legacy device to a new device. Such recommendations, comparisons, simulations, and one-click migrations may be used to facilitate migration from one mobile device to another, even when legacy devices are customized with highly useful and/or often used applications. | 05-10-2012 |
20120131470 | Integrated Application Feature Store - 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. | 05-24-2012 |
20120144053 | Light Weight Transformation for Media - 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. | 06-07-2012 |
20120276992 | MOST VALUABLE PLAYER GAMER STATUS AND APPLICATIONS - 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. | 11-01-2012 |
20120278154 | MARKETING INVENTORY BASED ON SPOILAGE - 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. | 11-01-2012 |
20130238592 | APPLICATION STORE TASTEMAKER RECOMMENDATIONS - 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. | 09-12-2013 |
20130246429 | MULTI-CENTER CANOPY CLUSTERING - 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. | 09-19-2013 |
20130346424 | COMPUTING TF-IDF VALUES FOR TERMS IN DOCUMENTS IN A LARGE DOCUMENT CORPUS - 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. | 12-26-2013 |
20130346466 | IDENTIFYING OUTLIERS IN A LARGE SET OF OBJECTS - 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. | 12-26-2013 |
20150039619 | GROUPING DOCUMENTS AND DATA OBJECTS VIA MULTI-CENTER CANOPY CLUSTERING - 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. | 02-05-2015 |
Patent application number | Description | Published |
20130253888 | ONE-PASS STATISTICAL COMPUTATIONS - Some embodiments of the invention employ algorithms enabling the calculation of one or more statistical moments in a single pass of a dataset. For example, some embodiments may apply algorithms for calculating statistical moments to a dataset using a map-reduce framework, whereby an input dataset is partitioned into multiple shards, a separate map process is used to apply an algorithm enabling calculation of one or more statistical moments in a single scan to each shard, and one or more reduce processes consolidate the results generated by the map processes to calculate the one or more statistical moments across the entire dataset. In other embodiments of the invention, a map-reduce framework may be employed to apply algorithms enabling calculation of a covariance between data elements expressed in a dataset, instead of or in addition to one or more statistical moments. | 09-26-2013 |
20130254280 | IDENTIFYING INFLUENTIAL USERS OF A SOCIAL NETWORKING SERVICE - Techniques for identifying influential users of a social networking service are provided. Influential users may be identified via an algorithm in which an influence score is assigned to each user based at least in part on other members of the community users having taken an affirmative step with respect to the user's communications. Iterative processing may be performed, with each user's influence score being determined by contributions from other users, and each contribution being determined by the contributor's influence score as of a prior iteration. A map-reduce framework may be employed, with data representing the community being partitioned into a plurality of discrete shards, a map process corresponding to each shard calculating an influence score for users represented in the shard, and reduce processes ranking users according to influence score across all shards. | 09-26-2013 |
20140189000 | SOCIAL MEDIA IMPACT ASSESSMENT - A system for identifying influential users of a social network platform. The system may compute a score for each of multiple users. Such a score may be topic-based, leading to a more accurate identification of influential users. Such a topic-based score may indicate authority and/or impact of a user with respect to a topic. The impact may be computed based on authority combined with other factors, such as power of the user. The authority score may be simply computed, in whole or in part, directly from a tweet log without, for example creating a retweet graph. As a result, the scores may be computed, using MapReduce primitives or other constructs that allow the computations to be distributed across multiple parallel processors. Such scores may be used to select users based on impact as part of social trend analysis, marketing or other functions. | 07-03-2014 |
20140189536 | SOCIAL MEDIA IMPACT ASSESSMENT - A system for identifying influential users of a social network platform. The system may compute a score for each of multiple users. Such a score may be topic-based, leading to a more accurate identification of influential users. Such a topic-based score may indicate authority and/or impact of a user with respect to a topic. The impact may be computed based on authority combined with other factors, such as power of the user. The authority score may be simply computed, in whole or in part, directly from a tweet log without, for example creating a retweet graph. As a result, the scores may be computed, using MapReduce primitives or other constructs that allow the computations to be distributed across multiple parallel processors. Such scores may be used to select users based on impact as part of social trend analysis, marketing or other functions. | 07-03-2014 |