Patent application number | Description | Published |
20160077989 | METHODS AND APPARATUS FOR AGGREGATING PACKET TRANSFER OVER A VIRTUAL BUS INTERFACE - Methods and apparatus for data aggregation and multiplexing of one or more virtual bus interfaces via a physical bus interface. Various disclosed embodiments are configured to: (i) multiplex multiple logical interfaces over a single physical interface, (ii) exchange session management and logical interface control, (iii) manage flow control, (iv) provide “hints” about the data (e.g., metadata), and/or (v) pad data packets. In one particular implementation, the methods and apparatus are configured for use within a wirless-enabled portable electronic device, such as for example a cellular-enabled smartphone, and make use of one or more features of a high-speed serialized physical bus interface. | 03-17-2016 |
20160103480 | METHODS AND APPARATUS FOR MANAGING POWER WITH AN INTER-PROCESSOR COMMUNICATION LINK BETWEEN INDEPENDENTLY OPERABLE PROCESSORS - Methods and apparatus for an inter-processor communication (IPC) link between two (or more) independently operable processors. In one aspect, the IPC protocol is based on a “shared” memory interface for run-time processing (i.e., the independently operable processors each share (either virtually or physically) a common memory interface). In another aspect, the IPC communication link is configured to support a host driven boot protocol used during a boot sequence to establish a basic communication path between the peripheral and the host processors. Various other embodiments described herein include sleep procedures (as defined separately for the host and peripheral processors), and error handling. | 04-14-2016 |
20160103689 | METHODS AND APPARATUS FOR RUNNING AND BOOTING AN INTER-PROCESSOR COMMUNICATION LINK BETWEEN INDEPENDENTLY OPERABLE PROCESSORS - Methods and apparatus for an inter-processor communication (IPC) link between two (or more) independently operable processors. In one aspect, the IPC protocol is based on a “shared” memory interface for run-time processing (i.e., the independently operable processors each share (either virtually or physically) a common memory interface). In another aspect, the IPC communication link is configured to support a host driven boot protocol used during a boot sequence to establish a basic communication path between the peripheral and the host processors. Various other embodiments described herein include sleep procedures (as defined separately for the host and peripheral processors), and error handling. | 04-14-2016 |
20160103743 | METHODS AND APPARATUS FOR RECOVERING ERRORS WITH AN INTER-PROCESSOR COMMUNICATION LINK BETWEEN INDEPENDENTLY OPERABLE PROCESSORS - Methods and apparatus for an inter-processor communication (IPC) link between two (or more) independently operable processors. In one aspect, the IPC protocol is based on a “shared” memory interface for run-time processing (i.e., the independently operable processors each share (either virtually or physically) a common memory interface). In another aspect, the IPC communication link is configured to support a host driven boot protocol used during a boot sequence to establish a basic communication path between the peripheral and the host processors. Various other embodiments described herein include sleep procedures (as defined separately for the host and peripheral processors), and error handling. | 04-14-2016 |
Patent application number | Description | Published |
20100191558 | LINEAR-PROGRAM FORMULATION FOR OPTIMIZING INVENTORY ALLOCATION - Computer-readable media for determining whether to accept a candidate order from a content provider, or advertiser, to display a particular number of advertisements within a specified time segment are provided. Initially, the content provider may include placement criteria that, among other things, identify a leaf node at which impressions of the advertisement are expected to be rendered. Generally, the leaf node refers to a location within a topic graph that describes inventory that is permissible to allocate to satisfy the candidate order. To perform the determination, the inventory of impressions available for accommodating the candidate order and a log of booked orders scheduled to be placed within the time segment are identified. Linear programs are then utilized to determine whether the estimated inventory that satisfies the placement criteria is available by predictively placing the booked orders at the estimated inventory. If estimated inventory remains available, the candidate order is accepted. | 07-29-2010 |
20100318418 | ADVERTISING INVENTORY PREDICTION FOR FREQUENCY-CAPPED LINES - Computer-readable media, computer systems, and computing devices for responding to advertising inventory queries that specify frequency caps limiting the number of impressions that are shown to a unique user. Impression logs are retrieved from logging servers and processed to generate a unique user distribution that provides information regarding the numbers of unique users that receive ad impressions at a specified location and during a specified time period. Estimates of frequency-capped capacity to fulfill a booking request and estimates of frequency-capped availability of inventory are computed using the unique user distribution. | 12-16-2010 |
20110246312 | ADVERTISEMENT INVENTORY MATCHING - Various embodiments provide techniques for advertisement inventory. In at least some embodiments, a scaled number of impressions can be matched to orders that have scaled impression goals. Impressions can be randomly selected from an offline traffic model and allocated to orders according to a matching algorithm until a number of impression defined by a scale factor is reached. This can occur by sampling the traffic model directly using the scale factor and/or by creating a scaled data set to which the matching algorithm can be applied. The matching algorithm can be configured to identify an order that is farthest away from being complete and then match the randomly selected impression to the identified order. If the scaled orders in the data set can be fulfilled using the scaled number of impressions, a conclusion is made that the original set of orders can be fulfilled using the original impressions. | 10-06-2011 |
20130238448 | Guaranteeing Delivery of Ad Impressions - Various embodiments pertain to techniques for forecasting and providing guaranteed delivery of ad impression opportunities using real-time bidded platform inventories. In various embodiments, bid landscape data, such as information regarding a number of impression requests by a particular supply unit, a time of the impression requests, and an amount of a winning bid for the impression requests, is recorded for use in forecasting an available impression volume as a function of cost. The forecasted available impression volume represents a number of ad impression requests likely to be obtained through real-time bidding channels. In various embodiments, an advertiser can place an order for a number of ad impressions at a particular price, and the ad impressions ordered can be specifically allocated for that advertiser. The number of ad impressions ordered by an advertiser that are guaranteed vary depending on the price and the available volume forecasted at that price. | 09-12-2013 |