Abstract: Example aspects of the present disclosure provide for an example computer-implemented method for generating alternative network paths, the example method including obtaining a network graph; determining flows respectively for edges of the network graph by: resolving a linear system of weights associated with the edges, the linear system resolved over a reduced network graph, and propagating a solution of the linear system into a respective partition of a plurality of partitions of the network graph to determine at least one of the flows within the respective partition; and determining a plurality of alternative paths across the network graph.

Abstract: Methods and systems for conditioning graph neural networks on affinity features. One of the methods includes obtaining graph data representing an input graph that comprises a set of nodes and a set of edges that each connect a respective pair of nodes, the graph data comprising respective node features for each of the nodes, edge features for each of the edges, and a respective weight for each of the edges; generating one or more affinity features, each affinity feature representing a property of one or more random walks through the graph guided by the respective weights for the edges; and processing the graph data using a graph neural network that is conditioned on the one or more affinity features to generate a task prediction for a machine learning task for the input graph.

Abstract: To navigate an electric vehicle from a starting location to a destination, a system identifies multiple charging stations between the starting location and the destination and determining a navigation route that requires a least amount of time for the electric vehicle to travel from the starting location to the destination via one or more of the charging stations, including determining a non-linear relationship between an amount of time and an amount of charge the EV receives during the amount of time.

Abstract: Implementations generally relate to hashtags. In some implementations, a method includes providing one or more location-based contextual hashtags to a user by receiving, from a first user device associated with a first user, information indicative of a physical location of the first user device. The method further includes identifying, with one or more processors, a place of interest based on the information indicative of the physical location of the first user device. The method further includes determining a category associated with the place of interest. The method further includes retrieving one or more hashtags from one or more databases based on the place of interest or the category associated with the place of interest. The method further includes providing the one or more hashtags and information about the place of interest to the first user device.

Abstract: While a document, such as an e-book, is read by a user on a computing device such as an e-reader, concept phrases are extracted from the document. The extracted concept phrases may be words or phrases that match known concept phrases such as headings. Based on a universal concept phrase graph that includes nodes for each known concept phrase, core concept phrases are determined for the document. These core concept phrases are associated with nodes of the universal concept phrase graph that are located within a predetermined distance of nodes that represent the concept phrases extracted from the document. Each core concept phrase is combined with one or more of the concept phrases to generate multiple queries. These queries are submitted to search engines, and indicators of documents from the corresponding search results are presented to the user with the original document that is being read.

Abstract: Systems, methods, and computer storage media are provided for generating rich navigational study aids for electronic books. For a particular section of interest in a document, one or more related sections for providing additional context to the particular section are determined. The related sections are ranked based on a score indicating significance to the particular section. Based on a user's information processing preference, a set of ranked navigational links to each related section is presented to the user for additional context related to the particular section.

Abstract: Techniques determine a quantity of rows to fetch based on memory available on a client computer and the fetch state of cursors. The techniques are used to determine a quantity of rows for “pre-fetching”. Under pre-fetching, rows in addition to those requested by an application are fetched from a database instance and stored in a “pre-fetch buffer”. The pre-fetch quantities are based on an amount of memory that is deemed available for pre-fetch buffers on a client computer and the number of cursors in the fetch state for a session at a given moment. Pre-fetching is used to hasten session migration. By fetching a quantity of rows that is larger than would be fetched if only the application-specified quantity were fetched, the fetch phase of a cursor is completed sooner. An earlier completion of the fetch phase of a session's cursors allows migration of the session to be completed sooner.

Abstract: Search history data such as browse trails are collected over time. The browse trails, including associated queries and domains, are processed to identify free tokens of the queries that are also modifiers. Attribute value pairs of a structured data source that correspond to the modifiers are determined based on the search history data and a frequency of the attribute value pairs in the structured data source. When a subsequent query is received, modifiers in the query are identified and replaced with the determined combinations of attribute value pairs that correspond to the modifiers in a structured query that is generated from the received query. The structured query is used to identify items and/or services in the structured data source that are responsive to the received query.

Abstract: While a document, such as an e-book, is read by a user on a computing device such as an e-reader, concept phrases are extracted from the document. The extracted concept phrases may be words or phrases that match known concept phrases such as headings. Based on a universal concept phrase graph that includes nodes for each known concept phrase, core concept phrases are determined for the document. These core concept phrases are associated with nodes of the universal concept phrase graph that are located within a predetermined distance of nodes that represent the concept phrases extracted from the document. Each core concept phrase is combined with one or more of the concept phrases to generate multiple queries. These queries are submitted to search engines, and indicators of documents from the corresponding search results are presented to the user with the original document that is being read.

Abstract: Systems, methods, and computer storage media are provided for generating rich navigational study aids for electronic books. For a particular section of interest in a document, one or more related sections for providing additional context to the particular section are determined. The related sections are ranked based on a score indicating significance to the particular section. Based on a user's information processing preference, a set of ranked navigational links to each related section is presented to the user for additional context related to the particular section.

Abstract: A document is received for segmentation. The document includes multiple atomic textual units in a sequence. These units may correspond to sentences, phrases, paragraphs, concept phrases, chapters, etc. A distance function is selected that determines a distance between one set of atomic textual units and another set of atomic textual units. The distance between the sets is large for sets that are dissimilar, and small for sets that are similar. The distance function is applied to the atomic textual units to separate each of the atomic textual units into multiple segments, while maintaining the sequence of the atomic textual units.

Abstract: The present invention is directed to a method and mechanism for reducing the expense of data transmissions between a client and a server. According to an aspect of data prefetching is utilized to predictably retrieve information between the client and server. Another aspect pertains to data redundancy management for reducing the expense of transmitting and storing redundant data between the client and server. Another aspect relates to moved data structures for tracking and managing data at a client in conjunction with data redundancy management.

Abstract: A session established for an application is suspended from an instance and later resumed on the server or a different server. When a session is suspended, its state is captured and persistently stored as a session image in a data repository, and the session is terminated. When the session is resumed, a new session is established on an instance, the session image of the session to resume is retrieved from the repository and restored to the newly established session. The suspension and resumption of a session may be initiated by an application, which may request the suspension and resumption of a session.

Abstract: A set of queries, such as a search log, is divided into commercial queries and non-commercial queries. A first set of query communities is determined from the non-commercial queries and a second set is determined from the commercial queries. The query communities are correlated based on the users who submitted the queries and instances where a query from the first set of query communities was followed by a query from the second set to generate a mapping between the first set of query communities and the second set. Later, a non-commercial query is received from a user, and the mapping is used to predict one or more commercial queries that the user is likely to submit in the future based on the non-commercial query. One or more of the commercial queries are presented to the user according to the mapping with search results responsive to the non-commercial query.

Abstract: A structured query may specify attribute values for attributes. An estimate of the number of items that will match the structured query if it is applied to a structured database is determined. If the estimated number of items is below a threshold, the structured query may be relaxed to form new candidate structured queries. The number of candidate queries may be determined based on a desired running time. Each of the candidate structured queries may be determined by changing one or more attribute values of the attributes of the structured query. Estimates of the number of items each of the candidate structured queries will match is determined, and the candidate structured query that has the highest matching estimation is used to query the database. The matching results may be output.

Abstract: An achievement system tracks users' offline activities and awards achievements to users for participation in particular offline activities. The achievements that are awarded for particular activities and/or to particular users may be sponsored by merchants, who may compensate an achievement system provider for the opportunity to sponsor the achievements. To award users achievements, the users' offline activities are tracked. When a user participates in an offline activity for which achievements are available, the user is awarded an achievement. The achievement may be stored in an achievement profile for the user. In some embodiments, achievements earned by users may be converted into other benefits and alternative awards.

Abstract: A query is received and processed to determine one or more specified and unspecified attributes in the query. The specified and unspecified attributes may correspond to attributes of one or more items. A graph is generated for the items and includes a node for each item and an edge between each unique pair of nodes. Each node is assigned a cost based on a distance between the specified attributes of the query and the attributes of the item associated with the node. Each edge is assigned a weight based on a distance between the unspecified attributes associated with the nodes of the node pair corresponding to the edge. A set of nodes from the graph is selected by minimizing a total cost of the nodes while maximizing a dispersion of the nodes based on the edge weights.

Abstract: The present invention is directed to a method and mechanism for reducing the expense of data transmissions between a client and a server. According to an aspect of data prefetching is utilized to predictably retrieve information between the client and server. Another aspect pertains to data redundancy management for reducing the expense of transmitting and storing redundant data between the client and server. Another aspect relates to moved data structures for tracking and managing data at a client in conjunction with data redundancy management.

Abstract: Various technologies described herein pertain to allocating requests based on revenue targets of providers for an online service. Information that indicates revenue budgets of providers for the online service and revenue targets of the providers for the online service can be received. The revenue budgets set maximums for total revenues from the providers and the revenue targets set minimums for the total revenues from the providers. Moreover, a request allocable to one of the providers having a total revenue generated thereby constrained by a corresponding revenue budget can be received. Further, bid values of the providers corresponding to the request can be received. An output of an algorithm can be computed based at least in part upon the bid values of the providers and the revenue targets of the providers. The request can be allocated to a selected provider from the providers based upon the output of the algorithm.

Abstract: Search history data such as browse trails are collected over time. The browse trails, including associated queries and domains, are processed to identify free tokens of the queries that are also modifiers. Attribute value pairs of a structured data source that correspond to the modifiers are determined based on the search history data and a frequency of the attribute value pairs in the structured data source. When a subsequent query is received, modifiers in the query are identified and replaced with the determined combinations of attribute value pairs that correspond to the modifiers in a structured query that is generated from the received query. The structured query is used to identify items and/or services in the structured data source that are responsive to the received query.