Abstract: Systems, methods, and non-transitory computer readable media are configured to provide a first element in an interface presentable to a user through which a plurality of ephemeral media content items are accessible by the user for a selected period of time. A second element in the interface through which a plurality of non-ephemeral media content items are accessible by the user is provided.

Abstract: The present disclosure relates to dynamically merging database tables according to user specified parameters. A user may specify a threshold confidence level that relates to a likelihood that two database records represent the same real-world entity. In addition, a user may specify a merge rule such as desired fields or a manner for consolidating the variations of the information in desired fields from the related records. The original database tables are preserved so that users can iteratively create new dynamically merged database tables by varying the parameters.

Abstract: Transparent file processing is supported in Unix-like operating systems by emulating the desired file processing through a number of recipes that accommodate different contexts. Recipes are provided, for example, for local folders in user space, for whole devices (e.g., flash drives or network drives), and for folders synchronized to cloud data. By detecting the path type for a file operation and selecting and applying the appropriate recipe, file processing can be performed in a manner transparent to the user.

Abstract: A method and apparatus for a data analysis system for analyzing data object collections is provided. The data analysis system includes one or more graphical user interfaces comprising various interface elements that enable users to create visual queries. A visual query is constructed as a graph representing a pattern of interest in a collection of data objects. A visual query may include one or more graph elements and property information associated with the specified graph elements. After a user has constructed a visual query, the system may transform the visual query into a query template. A query engine may then execute the query template to search a data object collection for data object results corresponding to the specified pattern. The search for instances of a specified pattern in a collection of data objects is referred herein to as a “search around.

Abstract: To reduce the overall computation time of a batch of queries, multiple query optimization in SQL-on-Hadoop systems groups multiple MapReduce jobs converted from queries into a single one, thus avoiding redundant computations by taking sharing opportunities of data scan, map function and map output. SQL-on-Hadoop converts a query into a DAG of MapReduce jobs and each map function is a part of query plan composed of a sequence of relational operators. As each map function is a part of query plan which is usually complex and heavy, disclosed method creates a cost model to simulate the computation time which takes both I/O cost for reading/writing input file and intermediate data and CPU cost for the computation of map function into consideration. A heuristic algorithm is disclosed to find near-optimal integrated query plan for each group based on an observation that each query plan is locally optimal.

Abstract: A method of data recovery of a remaining set of original data from a partial set of the original data. The original data is organized by a geometry having a locality function. Each original datum occupies a point of the geometry and has a corresponding distance to each other point of the geometry as defined by the locality function. The original datum further has corresponding values. The method includes, for each remaining datum of the remaining set: identifying a family of points of the geometry corresponding to members of the partial set local to the remaining datum by using the locality function; estimating the corresponding values of the remaining datum by using a peridynamic differential operator on the corresponding values of each of the members of the partial set in the family of points; and storing the estimated values of the remaining datum on a nonvolatile storage device.

Abstract: A method, non-transitory computer readable medium, and pharmaceutical assessment computing device that effectively reformulates and repositions pharmaceutical molecule data. With this technology, therapeutic area data comprising a medical condition and pharmaceutical molecule data corresponding to the medical condition is obtained. The pharmaceutical molecule data comprises pharmaceutical molecule identifiers and usage data parameters with corresponding usage data values for each of the pharmaceutical molecule identifiers. Each of the usage data values is compared to a corresponding usage threshold value. Reformulation opportunities are determined for each of the pharmaceutical molecule identifiers comprising a usage data value that exceeds the corresponding usage threshold value.

Abstract: Some aspects of this disclosure include systems, methods, and/or computer programs that may be used to filter measurements of affective response collected using sensors that measure physiological signals and/or behavioral cues of users. A bias may be tendency, attitude, and/or inclination, which may influence the affective response a user has to an experience. Some embodiments described herein involve learning a model of biases of the user from measurements of affective response of the user and descriptions of events to which the measurements correspond. The model may be used to filter measurements of the user, which may be provided to other entities, if the model indicates that the measurements are likely to contain a certain level and/or type of bias (e.g., bias to certain factors). Such a filtration process can help make results generated based on the measurements more accurate and also may help protect the privacy of the user.

Abstract: The technology described herein allows applications to access user-interest information generated by a plurality of applications. User-interest data can be generated by applications when a user interacts with an application. The technology described herein allows an application to submit user interests to a system that makes the user interests available to other applications. The technology allows each application to subscribe to user interests that are consumable by the application. In this way, each application can control what user-interest information is received.

Abstract: An approach is provided that analyzes electronic document sets, each of the sets written by a different author. The analysis includes performing a normalized sentiment analysis of the documents which results in normalized sentiment scores that pertain to each of the authors. The normalize sentiment scores are stored in a data store that is accessible from a question answering (QA) system. The question answering system then receives a sentiment-based question. Responsively, the QA system generates a qualitative set of candidate answers, with the candidate answers based at least in part on the normalized sentiment scores retrieved from the data store.

Abstract: Disclosed is a method, system, and computer program product for semantically analyzing the content within an internal social network. Using the results of the analysis, the executives can gain a better understanding of, and insight into, the organization and its employees. A dashboard tool may be used in some embodiments of the invention to visualize the results of the semantic analysis.

Abstract: A quality management platform for home devices is implemented on a computer system and comprises a knowledge repository and a query engine. The knowledge repository includes a knowledge graph of nodes connected by edges. The nodes represent concepts relating to home devices and their operation and faults, and the edges represent relations between the concepts. The query engine receives requests relating to home devices, queries the knowledge graph based on the requests, and returns responses based on the query results.

Abstract: Systems, methods, and non-transitory computer readable media are configured to provide a first element in an interface presentable to a user through which a plurality of ephemeral media content items are accessible by the user for a selected period of time. A second element in the interface through which a plurality of non-ephemeral media content items are accessible by the user is provided.

Abstract: A quality management platform for home devices is implemented on a computer system and comprises a knowledge repository and a query engine. The knowledge repository includes a knowledge graph of nodes connected by edges. The nodes represent concepts relating to home devices and their operation and faults, and the edges represent relations between the concepts. The query engine receives requests relating to home devices, queries the knowledge graph based on the requests, and returns responses based on the query results.

Abstract: In one embodiment, a computer-implemented method for server migration includes the step of providing an onsite system that comprises a server. A storage appliance is provided. The storage appliance is coupled with the onsite system. A bootable server image is created. The bootable server image is stored on the storage appliance. The bootable server image is migrated to a cloud-computing environment using the storage appliance. A version of the bootable server image is generated in the cloud-computing environment.

Abstract: The present disclosure relates to evaluating whether two data records reflect the same entity using a classifier in the absence of ground truth. Without ground truth, it is difficult to determine the precision or recall of a classifier. The present disclosure generates output data comprising a list of unique signatures generated from a set of records that are compared with each other. The output data may also comprise corresponding record pairs limited to a predetermined sample size for each unique feature signature.

Abstract: The present disclosure relates to optimizing one or more database tables that may include one or more redundant records. Records are clustered and assigned stable identifiers. In this manner, the underlying records within a cluster are not removed or deleted. As updates to the database are made, new clustering analyses are performed using the underlying records and any updates made. Newly identified clusters are reassigned stable identifiers.

Abstract: Systems and methods of a gain adjustment component for content selection infrastructure are provided. The system can receive a selection of multiple topics identified by a semantic analysis technique, and identify one or more keywords. The system can determine relevance scores between each of the keywords and the multiple topics. The system can generate an aggregated relevance score for each keyword based on the relevance score for the keyword and each of the multiple topics. The system can determine a threshold based on a metric associated with the multiple topics. The system can determine to input or exclude each of the one or more keywords based on a comparison of the corresponding aggregated relevance score with the threshold.

Abstract: Systems, methods and program instructions are described for calling a database function with a URL. Many databases have functions, also referred to as logical elements, built into the database that can be called to retrieve data. A web URL can be used to call such a programming function by formatting the URL in a specific manner. After the URL is received, it can be parsed to determine the resource path and parameters, if any exist. The database function specified in the URL is called using the specified parameters, if any exist. The results can be interpreted and an appropriate response can be streamed.

Abstract: Data records are joined using a computer. Data records in a first plurality of data records and a second plurality of data records are hashed. The data records in the first and second pluralities are respectively assigned to first and second groupings based on the hashes. Associated pairs of groupings from the first and second groupings are provided to a thread executing on a computer processor, and different pairs are provided to different threads. The threads operate on the pairs of groupings in parallel to determine whether to join the records in the groupings. A thread joins two data records under consideration if the hashes associated with the data records match. The joined data records are output.