Abstract: Embodiments improve the ability of users of a social networking system to search for information that is likely to be relevant to them by learning and/or applying a search context associated with selector components used to search for objects of the social networking system. The search context is specific to the use of an individual selector and thus need not be as general as the context of an entire page or set of pages in which selectors can be embedded. The social networking system may learn the context of a selector by monitoring user selections from prior search results performed using the selector.

Abstract: A system and method for organizing and retrieving conditioned data is disclosed. The data retrieval application includes a criteria determination engine, an optimization engine and a retrieval engine. The criteria determination engine determines criteria set for a list of data elements. The optimization engine organizes the list of data elements into a directed acyclic graph embodying a skip list data structure and optimizes the constructed directed acyclic graph. The retrieval engine receives a query, determines the features of the query, queries the directed acyclic graph using the features and retrieves a node representing a user interface data based on the criteria set matching the features.

Abstract: A population formation method is disclosed. Keywords are extracted from public information of providers included as elements in a first provider group. Each element is calculated based on a predetermined attribute value. A first attribute is for the providers of the public information. The attribute value is changed with time. Each of rules set for duplicate keywords is to determine one of the attributes by using one of the duplicate keywords. Provider groups are formed for new public information based on the duplicate keywords and the rules. A provider group having a similar relationship with a first provider group is specified by a distribution of the attribute value of a different attribute from the first attribute. A new provider group corresponding to the first provider group is formed by the providers, for whom the attribute value of the first attribute corresponds to the predetermined attribute value.

Abstract: A system and method are presented for optimization of audio fingerprint search. In an embodiment, the audio fingerprints are organized into a recursive tree with different branches containing fingerprint sets that are dissimilar to each other. The tree is constructed using a clustering algorithm based on a similarity measure. The similarity measure may comprise a Hamming distance for a binary fingerprint or a Euclidean distance for continuous valued fingerprints. In another embodiment, each fingerprint is stored at a plurality of resolutions and clustering is performed hierarchically. The recognition of an incoming fingerprint begins from the root of the tree and proceeds down its branches until a match or mismatch is declared. In yet another embodiment, a fingerprint definition is generalized to include more detailed audio information than in the previous definition.

Abstract: Examples relate to providing data backup for a multi-tenant application. One example enables determination that a first data set for a first tenant from the application should be backed up and determination, independently from determining the first data set should be backed up, that a second data set for a second tenant from the application should be backed up. Responsive to determining the first data set should be backed up, a first portion of the first data set stored at a first data resource of a first type may be accessed via a first adaptor for the first type of data resource, and a second portion of the first data set stored at a second data resource of a second type may be accessed via a second adaptor for the second type of data resource. The accessed portions of the first data set may be stored.

Abstract: An index handler determines, with respect to a key to be inserted into an index, that a candidate destination node of the index meets a split criterion. The index handler generates and embeds a deferred split descriptor comprising an identifier of a new node within the destination node. Before an insert-completed indication is provided, the destination node is written to a back-end data store without acquiring a lock and without writing out the new node to the back-end data store. During the traversal of the index, the index handler identifies another deferred split descriptor indicating a second new node. After providing the indication that the key was successfully inserted, the index handler writes the second new node to the back-end data store.

Abstract: For accessing and displaying private user information, a privacy-preserving overlay platform determines a request, from at least one application, for user data. The privacy-preserving overlay platform processes and/or facilitates a processing of the data to generate at least one index value of the data. Further, the privacy-preserving overlay platform causes, at least in part, a return of the at least one index value to the at least one application in response to the request.

Abstract: To provide more contextually and temporally relevant information to its users, a social networking system may surface relevant information about a target user with whom an recipient user is likely to interact. The social networking system predicts whether the recipient user is likely to be in contact with a target user, either currently or in the near future. If contact is predicted, the system determines information about the target user that that the recipient user may find of interest for their interaction. To determine what information may be of interest, the system determines a relevance score for information items about that target user. The system can then use the relevance scores to decide whether and which information items to surface to the recipient user, e.g., in the form of notifications.

Abstract: Performing an extract, transform, and load (ETL) process. Column data is received by a stage of the ETL process. The size of the received column data is ascertained by the stage. In response to determining that the size of the column data exceeds a predefined threshold, the stage saves the column data and creates a data locator associated with the column data. The created data locator advances through successive downstream stages of the ETL process as a replacement for the column data.

Abstract: Systems and methods for refining search query results are provided. A first user input is received. A plurality of search categories for the first input are determined. The plurality of search categories are then associated with different segments of a first slider. The first slider allows a user to generate a search query for the first user input among the plurality of associated categories. The search query returns a set of search query results. A plurality of sub categories may be determined for each search category. The plurality of sub-categories are associated with different segments of a second slider. Movement of a slider button of a second slider to a first segment of the second slider may be detected. The search query results may be filtered based on the first segment of the second slider. The filtering adjusts a level of detail of the set of search query results.

Abstract: Embodiments of the present invention provide systems and methods for the discovery of facets. A search query over sets of data (e.g., a set of documents) leads to search results. The search results are organized by facets. Responsive to receiving new queries, facets are dynamically extracted from the search results. Furthermore, user profiles are dynamically updated. The order of presentation of facets, as displayed in a graphical user interface, can be modified based on the extracted facets.

Abstract: A system and method is provided for reconstructing one or more collections of objects across platforms. More particularly, Java Annotations are used to assist a Web Services Description Language (WSDL) wizard in reconstructing a collection of objects. In implementation, the system and method parses the object types such that a wizard can recreate or reconstruct the collection of objects for use by a receiving service. The method includes reconstructing a collection using one or more annotations that document a base object of the collection.

Abstract: User activity in a communication network is monitored to obtain social graph data for each user. This social graph data is used to cluster the users into groups of users that interact with each other regularly. The groups are analyzed to generate a profile for each group with respect to a set of relevant data points. The profiles can be based on identifying group social graph data that is related to a data point (e.g., user activity level) that is being used to provision network server resources. The profile for each group is then compared to corresponding data associated with a plurality of servers providing network services to the users. Each group is then assigned to one or more of the servers that best matches the profile of the group. Servers may be added to the network by comparing data regarding a proposed new server to existing group profiles.

Abstract: Biometric computer systems are systems which use one or biometric identifiers to enroll, verify or identify a person. This disclosure concerns the automatic enrolment of people into biometric systems. Aspects include methods, computer systems, software and biometric systems. A first biometric identifier (i.e. face) and a second biometric identifier (e.g. iris) is captured (201). The first biometric identifier (e.g. face) is compared (206) to the biometric identifiers associated with records in the datastore (i.e. employment records 121) to identify a candidate matching record. An association of the second biometric identifier with the candidate record to be stored (209) in memory.

Abstract: A method, computer program product, and computer system for identifying, by a computing device, a change to at least one record of a plurality of records in a multi-record update. At least one problem condition associated with the change to the at least one record is determined, wherein the at least one problem condition is determined via at least one problem definition object before the change is saved. The at least one problem condition is organized on a display. An action is executed on the at least one problem condition displayed.

Abstract: In one embodiment, a system comprising a processor and a memory storing instructions executable by the processor creates an index for a nucleic acid sequence. The index comprises a plurality of elements. Each element corresponds to a permutation of a nucleic acid sequence. Data representing a nucleic acid sequence is received. A subsequence of the nucleic acid sequence is identified in the data at a first position of the nucleic acid sequence. A hash of the subsequence is computed to determine a corresponding element of the index. Position data reflecting the first position is stored in the corresponding element of the index.

Abstract: There is provided a non-transitory computer-readable medium storing a program causing a computer to execute a process. The process includes: accepting a search keyword; retrieving, from information items posted by users, a posted information item including the accepted search keyword, each of the posted information items including at least either of a text information item and an image information item, and acquiring posted information items which are within a predetermined chronological range with respect to the posted information item including the search keyword; and classifying, as image information items related to the search keyword, some of image information items included in the posted information items that have been acquired, and performing first determination of, for each of the classified image information items, whether or not a user who posted an information item including the classified image information item took an action related to the search keyword.

Abstract: A method for extracting user features based on user behaviors. The method uses webpage clickstream data of a current user to compute a path correlation between the current user and other users, selects a number of other users whose path correlation with the current user ranks among the highest, and then configures weights in connection to preset tags of websites visited by the selected other users, and computes a user correlation between the current user and the selected other users based on the preset tags and the weights. The method constructs weighted-directed graphs of webpage click paths based on click stream data, and converts computing user correlation to computing a similarity of weighted-directed graphs. The method further combines computing correlation of webpage tags to discover the user's clicking habits and personal preferences, and improve the accuracy and efficiency of user clustering.

Abstract: In a process for migrating a virtual machine's storage from a source disk to a destination disk, during a steady state (i.e., wherein the contents of the virtual machine stored on the source disk and the destination disk are equal), a virtual machine monitor receives a set of write requests from a guest operating system (“guest”) of the virtual machine, provides confirmation of the completion of the set of writes to the source disk, and asynchronously replicates the set of write requests to the destination disk. Upon receipt of a flush request from the guest, the virtual machine monitor confirms completion of the flushing of the destination disk following replication of the write requests to the destination disk. Upon receipt of a switch request from a virtual machine manager, the virtual machine monitor switches the virtual machine to the destination disk and issues subsequent write requests to the destination disk.

Abstract: A method and system for the distribution of electronic media content to employees where the subscriber is presented with a media content library that is key word searchable such that the subscriber can quickly and easily identify media content associated with certain key words. The subscriber's key word searches may also be saved and the subscriber notified when additional media content is available associated with the previously searched key word.