Hewlett-packard Development Company, L.p.

Google Inc.

Robert J Stets, Jr

Kourosh Gharachorloo

Mosur Kumaraswamy Ravishankar

Luiz Andre Barroso

Andreas Georg Nowatzyk

Gaurav Bhaya

Parthasarathy Ranganathan

Daniel J Scales

Robert Nelson Mayo

Deborah Anne Wallach

Monika Hildegard Henzinger

Gregory Joseph Badros

Hyung-Jin Kim

Lucy Congyun Zhang

Dipchand Nishar

Zhe Qian

Arash Baratloo

Michelangelo Diligenti

Keith H Randall

Mark Andrew Paskin

Wilburt Labio

Ming-Yee Iu

Luiz Andr&eacute; Barroso

Routing packetized actions in a voice activated data packet based computer network environment is provided. A system can receive audio signals detected by a microphone of a device. The system can parse the audio signal to identify trigger keyword and request, and generate an action data structure. The system can transmit the action data structure to a third party provider device. The system can receive an indication from the third party provider device that a communication session was established with the device.

Audio-based data structure generation

A feedback control system for data transmissions in voice activated data packet based computer network environment is provided. A system can receive audio signals detected by a microphone of a device. The system can parse the audio signal to identify trigger keyword and request. The system can select a content item using the trigger keyword or request. The content item can be configured to establish a communication session between the device and a third party device. The system can monitor the communication session to measure a characteristic of the communication session. The system can generate a quality signal based on the measured characteristic.

Feedback controller for data transmissions

Identifier dependent operation processing of packet based data communication is provided. A natural language processor component can parse an input audio signal to identify a request and a trigger keyword. A content selector component can select, based on the request or trigger keyword, a content item. A link generation component can determine whether the client computing device has an account or a record in a database associated with the service provider device. In the absence of the record or account, the link generation device generates and sends a virtual identifier to the service provider device with instructions to generate an account in the database using the virtual identifier. Once the account is created, the service provider device can communicate with the client computing device.

Device identifier dependent operation processing of packet based data communication

Systems and methods to combine multiple voice activated audio input data packets that indicate sequence dependent operations are provided. A natural language processor component can receive first and second input audio signal from a client computing device, and can identify respective requests and corresponding trigger keywords. A direct action application programming interface ('API') can generate respective action data structures, and can construct respective data transmissions including the respective action data structures. A thread optimization component can obtain data packets of the first data transmission, and can obtain data packets of the second data transmission. The thread optimization component can determine, based on a heuristic technique applied to the data packets of the respective data transmissions a sequence dependency parameter. The thread optimization component can merge, based on a comparison of the sequence dependency parameter with a threshold, the first and second data transmissions into a single thread.

Sequence dependent data message consolidation in a voice activated computer network environment

Systems, methods and computer program products for generalizing a user-submitted query by forming one or more variants of the user-submitted query to generate one or more other queries, each of the one or more other queries being different from the user-submitted query. A generalized quality of result statistic is derived for a first document from respective data associated with each of the other queries, each respective data being indicative of user behavior relative to the first document as a search result for the associated other query. The generalized quality of result statistic is provided as the quality of result statistic input to a document ranking process for the first document and the user-submitted query.

Search result inputs using variant generalized queries

In general, the subject matter described in this specification can be embodied in a method that includes: obtaining user feedback associated with quality of an electronic document; adjusting a measure of relevance for the electronic document based on a temporal element of the user feedback; and outputting the measure of relevance to a ranking engine for ranking of search results, including the electronic document, for a search for which the electronic document is returned. Obtaining the user feedback can include receiving user selections of documents presented by a document search service, the method can include evaluating the user selections in accordance with an implicit user feedback model to determine the measure of relevance, and adjusting the measure of relevance can include adjusting the measure of relevance in accordance with the implicit user feedback model.

Modifying search result ranking based on a temporal element of user feedback

An advertiser may be provided with fast and accurate estimates of the future cost and/or performance information for one or more actual or hypothetical ads (generally referred to as 'proto-ads'). Past auction information may be used to simulate auctions that the proto-ad would have competed in. The proto-ad may then participate in a 'replay' of such past auctions.

Estimating cost and/or performance information for an advertisement in an advertising system

Ads are reviewed manually once they have reached a certain expected revenue threshold (instead of attempting to review manually all incoming ads as was done in the past). This review process considers the fact that the many advertisers submit hundreds or even thousands of ads with each individually returning relatively little revenue. Such a review process should greatly reduce the number of ads, or at least to prioritize the order of ads, pending manual approval. The threshold may be set to the approximate cost of manually approving an ad, thereby reducing ad reviews pending manual review significantly. A classification of the ad (e.g., forbidden, suspicious, unchecked, an ad category, etc.), which may be determined by automated means for example, may also be used when prioritizing the order of ads pending manual approval. Revenue-based scores may also be used to control a review of an advertisement. For example, such scores may be used to select one of a plurality of review protocols.

Prioritizing ad review, by using expected revenue for example, in an advertising system

An advertisement for use with an online ad serving system may be automatically checked for compliance with one or more policies of the online ad serving system. If the advertisement is approved, then it is allowed by be served by the ad serving system. Follow up checks of the advertisement may be scheduled. One follow up check may be to test a landing page of the advertisement for compliance with policies. If the advertisement is not approved, hints for making the ad comply with one or more violated policies may be provided to an advertiser associated with the ad, and/or an ad serving system customer service representative. Determining whether or not to approve the advertisement may include determining violations of one or more policies by the advertisement, and, for each of the violations, determining whether or not to exempt the violation.

Advertisement approval

An information system that includes mechanisms for assigning incoming access transactions to individual access subsystems based on an analysis of the incoming access transactions. The analysis and assignment of the incoming access transactions may be used to minimize loss of cached data during power reduction in an information system.

Priority analysis of access transactions in an information system

A data center is disclosed with power-aware adaptation that minimizes the performance impact of reducing the power consumption of individual nodes in the data center. A data center according to the present techniques includes a request redirector that obtains an access request for data stored on a set of storage devices and that distributes the access request to one of a set of access nodes in response to a priority of the access request and a rank of each access node. A data center according to the present techniques also includes a power manager that performs a power adaptation in the data center by selecting access nodes for power reduction based on the ranks of the access nodes. The judicious distribution of access requests to appropriately ranked nodes and the judicious selection of access nodes for power reduction enhances the likelihood that higher priority cached data is not lost during power adaptation.

Power-aware adaptation in a data center

A protocol engine is for use in each node of a computer system having a plurality of nodes. Each node includes an interface to a local memory subsystem that stores memory lines of information, a directory, and a memory cache. The directory includes an entry associated with a memory line of information stored in the local memory subsystem. The directory entry includes an identification field for identifying sharer nodes that potentially cache the memory line of information. The identification field has a plurality of bits at associated positions within the identification field. Each respective bit of the identification field is associated with one or more nodes. The protocol engine furthermore sets each bit in the identification field for which the memory line is cached in at least one of the associated nodes. In response to a request for exclusive ownership of a memory line, the protocol engine sends an initial invalidation request to no more than a first predefined number of the nodes associated with set bits in the identification field of the directory entry associated with the memory line.

System and method for limited fanout daisy chaining of cache invalidation requests in a shared-memory multiprocessor system

An information server with power-aware adaptation that enables power reduction while minimizing the performance impact of power reduction. An information server according to the present techniques includes a transaction prioritizer that determines which of a set of memory subsystems in the information server is to cache a set of data associated with each incoming information access transaction and further includes a power manager that performs a power adaptation in the information server in response to a set of ranks assigned to the memory subsystems. An association of priorities of the incoming information access transactions to appropriately ranked memory subsystems and the judicious selection of memory subsystems for power adaptation enhances the likelihood that higher priority cached data is not lost during power adaptation.

Power-aware adaptation in an information server

A computer system has a plurality of processor nodes and a plurality of input/output nodes. Each processor node includes a multiplicity of processor cores, an interface to a local memory system and a protocol engine implementing a predefined cache coherence protocol. Each processor core has an associated memory cache for caching memory lines of information. Each input/output node includes no processor cores, an input/output interface for interfacing to an input/output bus or input/output device, a memory cache for caching memory lines of information and an interface to a local memory subsystem. The local memory subsystem of each processor node and input/output node stores a multiplicity of memory lines of information. The protocol engine of each processor node and input/output node implements the same predefined cache coherence protocol.

Growing community of inventors

Palo Alto, CA, United States of America

Robert J Stets, Jr