Abstract: A computer-implemented method for generating a proposed bid includes receiving an input generated by a first content provider as part of a bidding process where content providers bid for opportunities to provide content for publication. The input indicates (i) a resource for publishing first content from the first content provider and (ii) a campaign characteristic associated with the first content. The method includes determining a proposed bid for the first content provider based on the input and on historical data from the bidding process associated with the resource. The method includes presenting the proposed bid to the first content provider.

Abstract: A computer-implemented method for generating a proposed bid includes receiving an input generated by a first content provider as part of a bidding process where content providers bid for opportunities to provide content for publication. The input indicates (i) a resource for publishing first content from the first content provider and (ii) a campaign characteristic associated with the first content. The method includes determining a proposed bid for the first content provider based on the input and on historical data from the bidding process associated with the resource. The method includes presenting the proposed bid to the first content provider.

Abstract: A computer-implemented method for generating a proposed bid includes receiving an input generated by a first content provider as part of a bidding process where content providers bid for opportunities to provide content for publication. The input indicates (i) a resource for publishing first content from the first content provider and (ii) a campaign characteristic associated with the first content. The method includes determining a proposed bid for the first content provider based on the input and on historical data from the bidding process associated with the resource. The method includes presenting the proposed bid to the first content provider.

Abstract: A facility for scalably decoupled development and merging of equity trading strategies and trading execution plans is disclosed. The facility provides a service by which a user may discover correlations between a sequence of event times and upticks of traded equities, such as stocks. The facility can also confirm a suspected correlation between event times and equity upticks. If the event sequence continues into the future at predictable times, and the correlation between the events and equity upticks continues into the future, then the correlation may be profitably acted upon by buying and selling the equity around the times of the projected equity upticks. The facility provides a utility by which many such correlations may be discovered, confirmed, ranked, and merged into a complex trading sequence across many equities, that were identified from many such discovered correlations.

Abstract: A computer-implemented method for generating a proposed bid includes receiving an input generated by a first content provider as part of a bidding process where content providers bid for opportunities to provide content for publication. The input indicates (i) a resource for publishing first content from the first content provider and (ii) a campaign characteristic associated with the first content. The method includes determining a proposed bid for the first content provider based on the input and on historical data from the bidding process associated with the resource. The method includes presenting the proposed bid to the first content provider.

Abstract: A facility providing systems and methods for targeting advertisements based on a polling system is disclosed. The facility provides techniques for interleaving advertisements within a stream of “split queries.” The ads are themselves split queries and are inserted sparsely into the split stream. An ad campaign may include “branch” nodes, with decision logic over the targeting variables representative of a program, complete with dynamic variables and flow control (branching logic). Via this paradigm, the ad campaign can direct highly specific users toward specialized content and offers. In addition to their value as ad impressions, splits may have associated with them custom advertiser-defined targeting variables and actions for how user responses update those variables. These variables may then be used as targeting variables.

Abstract: The technology provides a hybrid local/remote hosted MapReduce framework and infrastructure comprising systems and methods for improving setup, configuration, controllability, debuggability, and integration of a compute job and systems and methods for increasing programmer productivity. The system applies an interpreted programming language for the programmer's custom Map and Reduce algorithms, such that those algorithms can execute identically on both the hosted service as well as locally (e.g., on the programmer's local computing system or device) for development and debugging purposes. Furthermore, the system delivers this service—a hosted MapReduce infrastructure—in a simple and transparent web service.

Abstract: A computer-implemented method for generating a proposed bid includes receiving an input generated by a first content provider as part of a bidding process where content providers bid for opportunities to provide content for publication. The input indicates (i) a resource for publishing first content from the first content provider and (ii) a campaign characteristic associated with the first content. The method includes determining a proposed bid for the first content provider based on the input and on historical data from the bidding process associated with the resource. The method includes presenting the proposed bid to the first content provider.

Abstract: The disclosed technology provides a hybrid local/remote hosted MapReduce framework and infrastructure comprising systems and methods for improving setup, configuration, controllability, debuggability, and integration of a compute job and systems and methods for increasing programmer productivity. The system applies an interpreted programming language for the programmer's custom Map and Reduce algorithms, such that those algorithms can execute identically on both the hosted service as well as locally (e.g., on the programmer's local computing system or device) for development and debugging purposes. Furthermore, the disclosed system delivers this service—a hosted MapReduce infrastructure—in a simple and transparent web service.

Abstract: A computer-implemented method for calling a party using a hosted calling service is disclosed. The method includes receiving at a calling module, using a standardized interface, a call request from a remote client, the standardized interface enabling interoperability between the calling module and heterogeneous remote clients, generating a call to a party specified by the call request, and transmitting a response received from the party to the remote client for client-specific processing.

Abstract: A computer-implemented method for generating a proposed bid includes receiving an input generated by a first content provider as part of a bidding process where content providers bid for opportunities to provide content for publication. The input indicates (i) a resource for publishing first content from the first content provider and (ii) a campaign characteristic associated with the first content. The method includes determining a proposed bid for the first content provider based on the input and on historical data from the bidding process associated with the resource. The method includes presenting the proposed bid to the first content provider.

Abstract: A computer-implemented method for proposing a value to a user includes mapping a plurality of factual cost values for an item type according to amount, each of the factual cost values reflecting an amount that won a bidding process for an item of the item type. The method includes identifying an inflection point in the mapping that represents a first factual cost value. The method includes outputting a proposed value for the bidding process to a user, the proposed value generated using the first factual cost value. The method can be implemented using a computer program product.

Abstract: The present invention utilizes pageable pool memory to provide, via a data verifier component, data verification information for storage mediums. By allowing the utilization of pageable pool memory, overflow from the pageable pool memory is paged and stored in a virtual memory space on a storage medium. Recently accessed verification information is stored in non-pageable memory, permitting low latency access. One instance of the present invention synchronously verifies data when verification information is accessible in physical system memory while deferring processing of data verification when verification information is stored in paged memory. Another instance of the present invention allows access to paged verification information in order to permit synchronous verification of data.

Abstract: The present invention utilizes pageable pool memory to provide, via a data verifier component, data verification information for storage mediums. By allowing the utilization of pageable pool memory, overflow from the pageable pool memory is paged and stored in a virtual memory space on a storage medium. Recently accessed verification information is stored in non-pageable memory, permitting low latency access. One instance of the present invention synchronously verifies data when verification information is accessible in physical system memory while deferring processing of data verification when verification information is stored in paged memory. Another instance of the present invention allows access to paged verification information in order to permit synchronous verification of data.

Abstract: The present invention utilizes pageable pool memory to provide, via a data verifier component, data verification information for storage mediums. By allowing the utilization of pageable pool memory, overflow from the pageable pool memory is paged and stored in a virtual memory space on a storage medium. Recently accessed verification information is stored in non-pageable memory, permitting low latency access. One instance of the present invention synchronously verifies data when verification information is accessible in physical system memory while deferring processing of data verification when verification information is stored in paged memory. Another instance of the present invention allows access to paged verification information in order to permit synchronous verification of data.

Abstract: A computer peripheral has a processor, non-volatile memory, and a plurality of controls. The non-volatile memory holds control mappings corresponding to a plurality of application program genres. The control mappings indicate actions to be performed in application programs of particular genres in response to actuation of particular controls. The control mappings indicate controls by unique string indexes that are also used in HID control descriptors associated with the computer peripheral.

Abstract: The present invention provides a method and computer program product for providing, over a RF link conforming to the Bluetooth specification, a network message protocol which is bus-independent and was originally designed for bus-attached networking devices. One such network message protocol is the NDIS device management protocol. In such a manner, many computer software products designed to operate over a hard-wired (or bus-attached) network can also be used over a Bluetooth wireless network.

Abstract: The present invention utilizes pageable pool memory to provide, via a data verifier component, data verification information for storage mediums. By allowing the utilization of pageable pool memory, overflow from the pageable pool memory is paged and stored in a virtual memory space on a storage medium. Recently accessed verification information is stored in non-pageable memory, permitting low latency access. One instance of the present invention synchronously verifies data when verification information is accessible in physical system memory while deferring processing of data verification when verification information is stored in paged memory. Another instance of the present invention allows access to paged verification information in order to permit synchronous verification of data.