Abstract: Web crawling configuration includes: obtaining a webpage comprising a plurality of receiving a user selection of a node in the webpage; presenting a set of web crawling configuration options pertaining to a web crawling action to be performed with respect to the node, the set of web crawling configuration options depending at least in part on a type of an element included in the node and comprising: a first option to perform a first web crawling action in the event that the node include a first type of the element; and a second option to perform a second web crawling action in the event that the node includes a second type of the element; receiving a user input specifying the web crawling configuration option; and storing user specified web crawling configuration option, performing the web crawling action on the node according to the user input, or both.

Abstract: [Problem] To provide a file management system and file management method that are able to perform a backup process efficiently by means of a configuration that uses a virtual file system metadatabase from a backup process side also. [Solution] The file management system is provided with a virtual drive controller (110) that controls a virtual drive (5), a metadatabase (210) that contains information for associating a virtual file and a physical file that is saved in a storage device (6), a backup controller (120) that manages the backup process of a file, and a backup status management database (220) used in backup process management. The virtual drive controller (110) registers updated file information in the backup status management database (220). The backup controller (120) references the backup status management database (220) and the metadatabase (210), and backs up the file.

Abstract: A data partitioning method and apparatus. The method includes: determining tuple relationship information according to received mixed loads and structure information of a database; determining tuple split cost information according to the tuple relationship information and a feature about whether the mixed loads are executable in parallel; obtaining multiple partitioning schemes according to the tuple split cost information, and determining, from the partitioning schemes, a partitioning scheme with a minimum total cost value as an optimum partitioning scheme to perform partitioning processing on data stored in the database. In the data partitioning method and apparatus, optimum partitioning is performed on data associated with the mixed loads in a database, after partitioning, data has features of a transaction load and an analytical load in the mixed loads, thereby improving working performance of the database system oriented to the mixed loads.

Abstract: A real-time messaging platform and method are disclosed which can be used to promote content in the messaging platform. In one embodiment, the promotion system is disclosed which performs initial candidate selection so as to narrow down the set of candidate promotions before applying more expensive processing. The candidate selection takes advantage of the connection graph information associated with accounts in the messaging platform to identify targeted accounts. In another embodiment, the promotion system uses a prediction model to predict a user's engagement with the promotion and utilizes the prediction to assist in ranking the candidate promotions. Promotions can be assigned metrics based, for example, on a weighted combination of user engagement rates, decayed with time to reflect an intuition that recent interactions by one or more users with the promotion will have a greater impact than older interactions with the promotion.

Abstract: An apparatus for managing data exchange between tools for multiple products in a product line is provided. The apparatus includes an application launcher configured to create a workspace to support a plurality of applications. The apparatus also includes an application manager configured to execute as a web service and load a first data and a second data associated with a first application and a second application, respectively, into the workspace. The apparatus also includes a concurrent engineering data service configured to capture data types associated with the first data and the second data and resolve differences in the data types wherein the data types comprise at least strings, doubles, and integers. The apparatus also includes a data storage and retrieval service configured to enforce integrity of and access rules associated with the first data and the second data.

Abstract: Methods, apparatus and systems, including computer program products, for creating subject matter synonyms from definitions extracted from a subject matter glossary. Confidence scores, each representing a likelihood that two terms defined in the subject matter glossary are synonyms, are determined by applying natural language processing (e.g., passage term matching, lexical matching, and syntactic matching) to the extracted definitions. A subject matter thesaurus is built based on the confidence scores. In one embodiment, a statement containing a first term is created based on an extracted definition of the first term, a modified statement is created by substituting a second term in the statement in lieu of the first term, a corpus is searched, and a confidence score is determined based on evidence in the corpus that the modified statement is accurate. The first and second terms are marked as synonyms if the confidence score is greater than a threshold.

Abstract: A system tracks a user's search related behavior and constructs a probability model, from the user's search related behavior, to estimate a probability that the user will select a certain type of search result. The system searches sources of information based on a search query received from the user to determine a set of search results and uses the estimated probabilities to select one or more search results from the set of search results.

Abstract: Methods and arrangements for handling queries for a discussion thread. A contemplated method includes: receiving a query; automatically classifying the query as subjective, objective or neither; and upon classifying the query as subjective or objective: calculating, for discussion threads of the query, at least one of: a subjectivity score and an objectivity score; determining a degree of relevance to the query of at least one of: the discussion threads, and at least one post in the at least one discussion thread; and ranking the discussion threads based on said calculating and determining. Other variants and embodiments are broadly contemplated herein.

Abstract: Embodiments provide an automated knowledge management service. A method includes receiving, at a computer processor that implements the knowledge management service, a request for information from a requesting entity. The method also includes generating, by the computer processor, a search query to search for the information across multiple compartmentalized data sources that are non-local to the automated knowledge management service, searching the multiple compartmentalized data sources for the information, and retrieving the information from one of the multiple compartmentalized data sources. The method further includes determining an access channel for transmitting the information, formatting the information to correspond to a format recognized by the access channel, and transmitting formatted information to the requesting entity.

Abstract: One or more techniques and/or systems are provided for populating an information interface based upon social media data. For example, users may post, share, and/or discuss various information through social media sources. Accordingly, social media data may be obtained from such social media sources. The social media data may be grouped into sets of social media data based upon temporal information. Within the sets of social media data, social media entries may be clustered into topic clusters (e.g., a royal wedding topic cluster, a plane crash topic cluster, etc.). Event summaries may be generated for respective topic clusters. The event summaries may be used to populate timeslots of an information interface, such as a calendar or timeline, to create annotated timeslots. In this way, the information interface may provide users with an interactive view of events over a time period, such as a year-in-review, based upon social media data.

Abstract: A real-time messaging platform and method is disclosed which classifies messages in accordance with a combination of user engagement events as modified to reflect the temporal structure of the user engagement events. A message can be assigned a metric based, for example, on a weighted combination of user engagement rates, decayed with time to reflect an intuition that recent interactions by one or more users with the message will have a greater impact than older interactions with the message. Different types of interaction by one or more users with the message can be assigned different weights when the different engagement events are combined and, also, can be assigned different temporal characteristics.

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: 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: A remote browsing process is directed to the generation and management of a remote browse session at a network computing provider. A client computing device requests a remote browse session instance at a network computing provider. The network computing and storage provider processes the requested content for display, and provides a processed representation of the requested content to the client computing device for display. The network computing provider further provides a historical content representation corresponding to the requested content to a historical browse storage component for storage. The network computing provider may further provide historical content representations to the historical browse storage component for content directly or indirectly referenced by the requested content. The client computing device may subsequently search for content not previously displayed by the client computing device.

Abstract: A method for modeling a test space is provided. The method comprises defining a coverage model including one or more attributes, wherein respective values for the attributes are assigned, one or more definitions of value properties for said attributes with assigned values, and one or more requirements that limit combination of attribute values that are legal for the model, wherein at least one of said requirements is defined using at least one value property.

Abstract: The present disclosure includes systems and techniques relating to ranking search results of a search query. In general, the subject matter described in this specification can be embodied in a computer-implemented method that includes determining a measure of relevance for a document result within a context of a search query for which the document result is returned, the determining being based on a first number in relation to a second number, the first number corresponding to longer views of the document result, and the second number corresponding to at least shorter views of the document result; and outputting the measure of relevance to a ranking engine for ranking of search results, including the document result, for a new search corresponding to the search query. The subject matter described in this specification can also be embodied in various corresponding computer program products, apparatus and systems.

Abstract: A set of context profiles containing profile content rules for filtering which content within a set of personal productivity applications (such as e-mail, chat, calendar, and contacts applications) is accessible by a user. Content rules support filtering content by, for example, content originator, and/or subject matter. The context profiles are centrally maintained for control of integrated, non-integrated, and/or independently administered personal productivity applications.

Abstract: A set of context profiles containing profile content rules for filtering which content within a set of personal productivity applications (such as e-mail, chat, calendar, and contacts applications) is accessible by a user. Content rules support filtering content by, for example, content originator, and/or subject matter. The context profiles are centrally maintained for control of integrated, non-integrated, and/or independently administered personal productivity applications.

Abstract: A method for processing a search query according to one embodiment includes receiving a search query containing terms; combining at least some consecutive terms in the search query to create biwords; looking up at least some of the terms and biwords in a search index for identifying sections of documents containing the at least some of the terms and/or biwords; generating a content score for each of the identified sections based at least in part on a number of the terms and biwords found in the sections of each document, wherein the biwords are given a higher priority than matched terms, wherein the priority affects the content score; and selecting and outputting an indicator of at least one of the sections, or portion thereof, based at least in part on the content score.

Abstract: An information processing apparatus determines a threshold value of the number of times of use of a keyword on the basis of the number of times of use of the keyword in each unit period included in a cycle period. Next, the information processing apparatus identifies a period in which the numbers of times of use exceeds the threshold value in the cycle period as a candidate of a popularity period of the keyword. Next, the information processing apparatus excludes the identified period from the popularity period if a situation in which the numbers of times of use in the identified period exceed the threshold value is different from a situation based on a periodic popularity of the keyword. When the identified candidate period is not excluded from the popularity period, the information processing apparatus determines the identified period to be the popularity period.