Abstract: The present disclosure relates to a short-lived throwaway index structure for generating an index from scratch in a short period of time rather than updating an index with every location change of moving objects. Rapid index construction results from the generation of Voronoi diagrams in parallel using multiple cloud servers simultaneously.

Abstract: The instant disclosure describes techniques and devices for facilitating migration of files between a source system and a target system. A system for facilitating migration of files between a source system and a target system includes an extraction component and an injection component. The extraction component includes at least one extraction handler and a profile engine operative to parse a profile specification, execute the at least one extraction handler, and provide a batch specification. The injection component includes a batch handler for obtaining pulled data from a source system, and a batch engine is operative to parse a batch specification and to create at least one file structure in the target system based on extracted structure information in the batch specification. Methods and GUIs for facilitating migration of files are also described.

Abstract: Method, mobile device, computer program product and apparatus for performing a search are disclosed. The method of performing a search comprises receiving one or more images of an environment in view of a mobile device, generating a simultaneous localization and mapping of the environment using the one or more images, wherein the simultaneous localization and mapping of the environment comprises a plurality of map points representing a plurality of surfaces in a three dimensional coordinate system of the environment, sending a set of the plurality of map points as a search query to a server, receiving a query response from the server, and identifying an object in the environment based at least in part on the query response.

Abstract: Aspects of the disclosure provide a system and method for prerendering of search result pages. A search engine may process search queries received from a client. The search engine may determine one or more search results in response to the search query. One or more of the search results may be associated with prerender instructions, such that when the search results are received by the client, the client prerenders the search results associated with the prerender instructions. Prerender instructions may be associated with the search results in various manners, including ranking the search results based on relevance, or ranking the search results based on the likelihood of selection. Metrics and analytical data may be collected from the client to improve the search result prerendering process.

Abstract: Method of and system for ranking elements of a first network resource for a first user, first network resource being hosted by a first server, method comprising, at a second server in communication with first server via a communications network: receiving an indication of elements from first server; receiving an indication of first user; based on at least one received indication, retrieving context information from a first database in communication with second server, context information being at least partially indicative of a relative relevance of elements to first user, context information including information about a past interaction of at least one of first user and a second user with a second network resource, second network resource being distinct from first network resource; and based at least in part on context information, determining at least one of a ranking of elements by relevance to first user and a most relevant element.

Abstract: An approach is provided for querying media based on media characteristics. A media platform processes and/or facilitates a processing of one or more images, one or more videos, or a combination thereof to determine one or more latent vectors associated with the one or more images, the one or more videos, or the combination thereof. The media platform further causes, at least in part, a comparison of the one or more latent vectors to one or more models. The media platform also causes, at least in part, an indexing of the one or more images, the one or more videos, or the combination thereof based, at least in part, on the one or more latent vectors, the one or more models, or a combination thereof.

Abstract: Functionality is described herein for transforming first and second symbolic linguistic items into respective first and second continuous-valued concept vectors, using a deep learning model, such as a convolutional latent semantic model. The model is designed to capture both the local and global linguistic contexts of the linguistic items. The functionality then compares the first concept vector with the second concept vector to produce a similarity measure. More specifically, the similarity measure expresses the closeness between the first and second linguistic items in a high-level semantic space. In one case, the first linguistic item corresponds to a query, and the second linguistic item may correspond to a phrase, or a document, or a keyword, or an ad, etc. In one implementation, the convolutional latent semantic model is produced in a training phase based on click-through data.

Abstract: Systems and methods are provided for determining continuous scoring models that describe one or more features regarding a geographic area. The scoring models can be fit to incorporate information from both point sources as well as area information. Based on the scoring models, a user can obtain feature values for the one or more features at any desired location or for a desired geographic area. Because the features are represented by a continuous function, comparisons of feature values for arbitrary geographic areas and/or combinations of features to form secondary values can also be performed.

Abstract: Systems and methods for optimizing a query, and more particularly, systems and methods for finding optimal plans for graph queries by casting the task of finding the optimal plan as an integer programming (ILP) problem. A method for optimizing a query, comprises building a data structure for a query, the data structure including a plurality of components, wherein each of the plurality of components corresponds to at least one graph pattern, determining a plurality of flows of query variables between the plurality of components, and determining a combination of the plurality of flows between the plurality of components that results in a minimum cost to execute the query.

Abstract: Systems and methods for optimizing a query, and more particularly, systems and methods for finding optimal plans for graph queries by casting the task of finding the optimal plan as an integer programming (ILP) problem. A method for optimizing a query, comprises building a data structure for a query, the data structure including a plurality of components, wherein each of the plurality of components corresponds to at least one graph pattern, determining a plurality of flows of query variables between the plurality of components, and determining a combination of the plurality of flows between the plurality of components that results in a minimum cost to execute the query.

Abstract: A method switches file server from old file server to new file server which are coupled via a backend network and provides data synchronization. The old file server and new file server are coupled with one or more host computers via a frontend network to direct input/output (I/O) requests from the one or more host computers. The method comprises creating stub files in the new file server, the stub files including stub information indicating location of data in the old file server; switching I/O requests directed to old file server to I/O requests directed to the new file server; checking whether the new file server has any stub files; and, if the new file server has one or more stub files, recalling data corresponding to the one or more stub files from the old file server according to the stub information to replace the one or more stub files.

Abstract: A real-time messaging platform allows advertiser accounts to pay to insert candidate messages into the message streams requested by account holders. To accommodate multiple advertisers, the messaging platform controls an auction process that determines which candidate messages are selected for inclusion in a requested account holder's message stream. Selection is based on a bid for the candidate message, the message stream that is requested, and a variety of other factors that vary depending upon the implementation. The process for selection of candidate messages generally includes the following steps, though any given step may be omitted or combined into another step in a different implementation: targeting, filtering, prediction, ranking, and selection.

Abstract: Example apparatus and methods transform a non-metric latent space produced by a matrix factorization process to a higher dimension metric space by applying an order preserving transformation to the latent space. The transformation preserves the order of the results of an inner product operation defined for the latent space. The higher dimension metric space may be queried for the results to different requests. Example apparatus and methods may assign every user i a vector ui in a latent space, and may assign every item j a vector vj in the latent space. The dot product ui·vj represents the score between the user i and the item j. The score represents the strength of the relationship between the user i and the item j. Example apparatus and methods may then apply ranking methodologies (e.g., LSH, K-D trees) to problems including recommendation, targeting, matchmaking, or item to item.

Abstract: In an example implementation, a global educational hub provides academic users with collaboration tools to exchange and build on the accumulated knowledge of subjects of interest. Users are provided with a central location to collect, categorize, and rank resources, and store notes and comments related to a particular section of an electronic textbook being studied. Users also can refer to online resources, such as web services, multimedia, website pages, newsgroups, search engine results, RSS, any other current and future external resources, and other user's notes.

Abstract: Techniques for estimating, in real time, the likelihood that any particular member of a social network service is a third degree connection of another member are described. Consistent with some embodiments, various member profile attributes of a member are used as a sort of proxy for determining the likelihood or probability that the member is a third degree connection of another member. For example, in some instances, the number of first-degree connections a member has is used to derive a probability score indicating the likelihood that the member is a third-degree connection of another member, such as a person performing a people-search. Once derived, the probability score for each member may be used in various applications, such as a people-search engine, to boost or increase a ranking score assigned to each search result and used to order the search results when presented to the user who has performed the search.

Abstract: A method includes receiving, by a data processing apparatus, a plurality of file operation requests, each file operation request including a priority, a deadline, and an operation type and representing a request to perform an operation on at least one file maintained in a distributed file system; identifying, by the data processing apparatus, a group of file operation requests to be executed together from the plurality of file operation requests, the identification based at least in part on at least one of: the file operations in the group of file operations being directed to a same storage system, or file operations in the group of file operations sharing a common operation type; and sending a request to execute the group of file operation requests to a system configured to perform the group of file operation requests.

Abstract: Methods, system, and devices for improving pre-modeling processing of data for use in predictive modeling. A computing device may be configured to perform operations for processing client data using metadata describing various client-specific parameters. Received client data may be loaded within stage tables based on the client-specific parameters, such flat file locations. The computing device may perform various validation checks on the loaded data, such as checks to identify duplication data records associated with client data received at different times, duplication data records occurring within an overlap period, and deleted records. In an embodiment, the computing device may perform additional checks to validate data records that include changing status information, such as marital status data of an employee. The computing device may use processed client data to generate weekly aggregated tables based on custom aggregation timeframes.

Abstract: A method and apparatus are disclosed of identifying a virtual machine usage of enterprise network resources, such as memory storage usage. One example method of operation may include transmitting a storage request to a database to determine an amount of physical memory storage available in the enterprise network. The method may also include receiving an alert message indicating a virtual machine currently operating has exceeded a predetermined memory storage threshold value. The method may also include creating a new virtual hard disk (VHD) to accommodate the exceeded predetermined memory storage threshold value.

Abstract: According to one aspect of the present disclosure, a computer-implemented method is provided for processing a query for points of interest (POIs) using a hierarchical grid structure representing a geographic area. The method includes receiving a query for POIs; defining a query footprint for the query based on a location corresponding to the query, wherein the query footprint comprises query spatial identifiers for a plurality of levels of the hierarchical grid structure; matching the query spatial identifiers with one or more POI spatial identifiers organized into a plurality of indexes, wherein each one of the plurality of indexes comprises an index of the POI spatial identifiers for one of the plurality of levels; and providing an output specifying one or more POIs corresponding to the matched POI spatial identifiers.

Abstract: Embodiments of methods and/or systems of manipulating tree expressions are disclosed.