Abstract: A method for providing content relevant images for an input question to a deep question answering system is disclosed. The method can include formulating, in response to receiving the input question, an answer to the input question. The method can also include identifying, based on the answer to the input question, a set of candidate images from a corpus of information. The set of candidate images may relate to the answer. The method can also include determining, based on a confidence value of the set of candidate images and a designated display specification, a first subset of the set of candidate images to provide in a display area. The method can also include selecting the first subset to be provided in the display area.

Abstract: Embodiments include methods, systems and computer program products for offloading multiple processing operations to an accelerator. Aspects include receiving a database query from an application, performing an analysis on the query, and identifying a plurality of available accelerators. Aspects further include retrieving cost information for one or more templates available on each of the plurality of available accelerators, determining a query execution plan based on the cost information and the analysis on the query, and offloading one or more query operations to at least one of the plurality of accelerators based on the query execution plan.

Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media, for evaluating substitute terms. One of the methods includes receiving a query having an original term and determining one or more substitution contexts for the original term, wherein a substitution context includes one or more context terms and an indication of a position in the query of the original term and the one or more context terms. The substitution contexts are classified into a first category or a second category based on a respective score of each substitution context. The original term is associated with one or more substitution contexts in the first category.

Abstract: When multiple regional data clusters are used to store data in a system, maintaining cache consistency across different regions is important for providing a desirable user experience. In one embodiment, there is a master data cluster where all data writes are performed, and the writes are replicated to each of the slave data clusters in the other regions. Appended to the replication statements are invalidations for cache values for the keys whose values have been changed in the master data cluster. An apparatus in the master data cluster logs replication statements sent to the slave databases. When a slave database fails, the apparatus extracts the invalidations intended for the failed database and publishes the invalidations to a subscriber in the region of the failed database. The subscriber sends the invalidations to the local caches to cause stale data for those keys to be deleted from the caches.

Abstract: A method for providing content relevant images for an input question to a deep question answering system is disclosed. The method can include formulating, in response to receiving the input question, an answer to the input question. The method can also include identifying, based on the answer to the input question, a set of candidate images from a corpus of information. The set of candidate images may relate to the answer. The method can also include determining, based on a confidence value of the set of candidate images and a designated display specification, a first subset of the set of candidate images to provide in a display area. The method can also include selecting the first subset to be provided in the display area.

Abstract: Methods include receiving a request to access an integrated macro module, wherein the integrated macro module is integrated into an application. Methods include presenting an option to search for a macro. When the option to search for the macro is selected, methods include transmitting a message, wherein the message asks for one or more search terms corresponding to the macro. Methods include receiving the one or more search terms. Methods include identifying a macro associated with at least one of the one or more search terms that is stored in an accessible repository. Methods include presenting the identified macro. Methods include recording a macro. Methods include presenting an option to share a macro. When the option to share the macro is selected, methods include storing the macro in a public repository. When the option to share the macro is not selected, methods include storing the macro in a local repository.

Abstract: A method of producing search results is disclosed. The method comprises, at a computerized search engine system distinct from a client system: receiving a search request associated with a user from the client system, the search request having one or more search terms; obtaining a user profile corresponding to the user, where the user profile is generated based in part on the user's prior computing activities, comprising one or more of browsing, searching, and messaging; obtaining search results for the search request; generating a personalized snippet for at least one of the search results in accordance with the obtained user profile, the snippet comprising a text portion of the search result chosen based on at least one or more search terms and one or more terms of the obtained user profile; and transmitting the search results and personalized snippet to the client system for display.

Abstract: A method and an apparatus request web pages and content rating information thereof have been disclosed. In one embodiment, the method includes receiving a request from a user for a web page, retrieving content rating of the web page in response to the request, and fetching the web page substantially simultaneously with the retrieving of the content rating in response to the request. Other embodiments have been claimed and described.

Abstract: A method, software and/or computer system for representing a set of SPARQL queries. The set of SPARQL queries are converting into an RDF representation of the set of SPARQL queries (that is, a SPARQL RDF graph). The SPARQL RDF graph is applied to a target RDF graph to yield a transformed target representing the responses to the set of queries, as an ontology or as text.

Abstract: This disclosure addresses the need for pre-caching of database query results which in general is the caching of the results of query evaluation before they are needed. In certain embodiments of query evaluation, the computing time required to evaluate a query is dominated by the reverse query, the evaluation of which determines the available remaining selectors and the number of items associated with each. The time to compute this reverse query is on average approximately proportional to the number of matching items. This result is used as a very convenient method of determining, before evaluation, which conjunctive queries will take the most time to evaluate—the long queries. These long queries can then be pre-cached, making them available for faster responses when they are needed. Methods of using cached conjunctive query results to more quickly evaluate certain queries comprising the disjunctive Boolean operators are also described.

Abstract: Systems and methods which provide an absent allocation technique with respect to absent data of a data structure for which data migration in a time-displaced data migration operation has not completed are disclosed. Through use of absent allocated data block states of an absent allocation technique of embodiments, dependency between source and destination data stores may be broken. An absent allocated data block state of embodiments stored within the data structure provides a suggestive indication that data of a data block of a data structure is absent from the data structure. A corresponding absent allocated data block state of embodiments stored external to the data structure provides a determinative indication that the data of the data block of the data structure is absent from the data structure. The absent data block determinative indictor of embodiments is updated as data continues to be migrated.

Abstract: Disclosed are various embodiments for a catalog mapping tool application. The application is executable in at least one computing device and comprises logic that identifies a system catalog of an item and a user catalog of the item. The system catalog may include a system acceptable format for a value of an attribute associated with the item, and the user catalog may include a user defined format for the value of the attribute associated with the item. The application further comprises logic that receives a selection of one of a plurality of recommended metadata maps for translation from a client device associated with the seller. In addition, the application comprises logic that facilitates translating the user catalog to the system catalog based at least in part on the one of the plurality of recommended metadata maps.

Abstract: The present invention provides a transaction processing method, which is applied to a node presenting a coordinator, where the coordinator is communicatively connected to nodes presenting participants. The method includes: sending, by the coordinator, a query message to each participant; drawing, by the coordinator, a conclusion according to response messages, executing, by the coordinator, the conclusion, and sending the conclusion to the participants, where the conclusion can be determined by a transaction ID, a object ID and a change information.

Abstract: A method, software and/or computer system for representing a set of SPARQL queries. The set of SPARQL queries are converting into an RDF representation of the set of SPARQL queries (that is, a SPARQL RDF graph). The SPARQL RDF graph is applied to a target RDF graph to yield a transformed target representing the responses to the set of queries, as an ontology or as text.

Abstract: A system, method and device for the internet search based on the peer-to-peer network are provided. A search terminal is set up in each search peer to form a peer-to-peer network. The search request is sent from an original search peer to other search peers progressively via the broadcast/back-propagation mechanism of the peer-to-peer network. Each search peer responds the search request separately, and searches its local index library. The search results of all search peers are gathered in the original search peer, and the original search peer aggregates and sorts the search results. Such search system structure and method have made a complete breakthrough from the architecture of existing search systems, and have provided novelty architecture of the search system, which thoroughly solves the high workload of the search engine server in existing technologies.

Abstract: A determination is made that each of at least two social network contacts involved in a social messaging interaction initiate a separate web search associated with the social messaging interaction. A separate set of web search results returned to each of the at least two social network contacts is captured in association with each initiated separate web search. A combined live search results view that includes each captured separate set of web search results is provided to each of the at least two social network contacts. The combined live search results view provides navigation to web content returned to other social network contacts.

Abstract: Embodiments of the present invention address deficiencies of the art in respect to data backup and archival tools and provide a method, system and computer program product for the dispersal and retrieval of fragments in a peer-to-peer data backup and archival network. In an embodiment of the invention, a method for the dispersal and retrieval of fragments in a peer-to-peer data backup and archival network can include partitioning a file into multiple, different fragments for storage in a peer-to-peer data backup and archival network, selecting different peer hosts in the peer-to-peer data backup and archival network to store different ones of the fragments, and storing each of the fragments in at least one of the selected different peer hosts. Optionally, the fragments can be encrypted before storage in the different peer hosts.

Abstract: A determination is made that each of at least two social network contacts involved in a social messaging interaction initiate a separate web search associated with the social messaging interaction. A separate set of web search results returned to each of the at least two social network contacts is captured in association with each initiated separate web search. A combined live search results view that includes each captured separate set of web search results is provided to each of the at least two social network contacts. The combined live search results view provides navigation to web content returned to other social network contacts.

Abstract: Techniques for performing database operations using vectorized instructions are provided. In one technique, an aggregation operation involves executing vectorized instructions to update a data value that corresponds to a particular key. The aggregation operation may be one of count, sum, minimum, maximum, or average.

Abstract: A hypertext transfer protocol (HTTP) request that includes embedded scripted code that specifies requested data search, search result data manipulation, and manipulated search result data visualization processing is received at a server. The received embedded scripted code that specifies the requested data search, search result data manipulation, and manipulated search result data visualization processing is executed. Visualized manipulated search results are generated as output of the execution of the received embedded scripted code. The visualized manipulated search results are returned in response to receiving the HTTP request that includes the embedded scripted code.