Abstract: Aspects of the present disclosure may involve a computer implemented method of disambiguating a string from an article involving an electronic device including one or more hardware processing units, and accessing a disambiguation database comprising a plurality of string-entity combinations and associated metrics for each of the plurality of string-entity combinations. The associated metrics may include a metric associated with an arrival probability of linking at a web page for a particular entity after a specified number of links from a starting page. The method may involve generating a clique graph for each candidate entity of the article, and generating a probability that a particular candidate entity matches a particular string associated with the particular candidate entity as a function of score attributes generated from the clique graph and the arrival probability of linking at the page for the particular entity after the specified number of links.

Abstract: Techniques provided herein allow for a plurality of weighted samplings without replacement to be performed in O(n) time. According to some embodiments, the weighted sampling without replacement may be performed on a data set X of data elements {x1, x2, x3, . . . , xn}, where each data element xi of the data set X has an associated weight wi. The data set X may comprise data generated by a social networking system. Each data element xi in the data set X may be assigned with a random score si based on the weight wi associated with the data element xi. The random score si can be used to perform weighted sampling without replacement.

Abstract: A method for identifying a desired document is provided to include calculating a Prior probability score for each document of a candidate list including a portion of documents of an embedding space, the Prior probability score indicating a preliminary probability, for each document of the candidate list, that the document is the desired document, and identifying an initial (i=0) collection of N0>1 candidate documents from the candidate list in dependence on the calculated Prior probability scores, the initial collection of candidate documents having fewer documents than the candidate list. The method further includes, for each i'th iteration in a plurality of iterations, beginning with a first iteration (i=1) and in response to user selection of an i'th selected document from the (i?1)'th collection of candidate documents, identifying an i'th collection of Ni>1 candidate documents from the candidate list in dependence on Posterior probability scores.

Abstract: Search systems and methods for searching structured data and enhancing the relevancy of search results provided to a requesting user or application. Enhanced search results are provided by searching a cache of a user's most recently used items to eliminate or reduce search indexing latency. Also, more relevant search results are provided by re-ranking results based on use history, data security models and/or hierarchical user role models. Further, enhanced search results are provided by including user information in the search index.

Abstract: Methods and arrangements for discovering entity types for a set of records. A set of records is input, with each record comprising attributes with associated attribute values. The records are grouped into candidate entity types in view of at least one of: the attribute values of the records, at least one domain ontology and at least one dimension hierarchy. An interestingness measure of each candidate entity type is calculated, via estimating interestingness based on at least one factor selected from the group consisting of: a correlation between attribute values of records, a number of attributes, a log of queries issued to a server, and an average group size for candidate entity types. At least one candidate entity type is validated based on the calculated interestingness measures. Other variants and embodiments are broadly contemplated herein.

Abstract: The present document relates to a system and method for searching a document using one or more search terms. In particular, the present document relates to a resource efficient method for searching a document within a database of documents. A method for determining an inverse index on an electronic device including a database is described. The inverse index is configured to map a plurality of text data entities from the database to a search term. The method includes determining a plurality of relevance vectors for a plurality of text data entities from the database. Determining a relevance vector for a text data entity from the database includes: selecting N terms which are descriptive of the text data entity; and determining the relevance vector from the selected N terms. Furthermore, the method includes determining the inverse index comprising a plurality of records.

Abstract: Computer systems and methods allow users to annotate content items found in a corpus such as the World Wide Web Annotations, which can include any descriptive and/or evaluative metadata related to a document, are collected from a user and stored in association with that user. Users are able to annotate and view their annotations for any document they encounter while interacting with the corpus, including hits returned in a search of the corpus. Users are also able to search their annotations or to limit searches to documents they have annotated. Metadata from annotations can also be aggregated across users and aggregated metadata applied in generating search results.

Abstract: A method (and concomitant apparatus and computer-readable medium comprising software) for providing personalized advertising to users of internet web pages comprising providing an index server maintaining a dynamic index to internet web pages and employing a hierarchical plurality of topic categories whose contents are maintained and updated by the index server, permitting a user to specify any subset of the plurality of topic categories, and serving to the user an advertisement based upon the subset specified by the user.

Abstract: Technologies are generally described for systems and methods effective to provide a seamless backup and recovery of applications using metadata. In an example, metadata can be defined to map data associated with an application and provide the relationship of the data to the application. From the metadata, a backup system can create a capsule containing application data, and a payload containing application related data. The capsule can contain not just the application data, but also configuration information, and access parameters. The capsule and payload can be associated together and saved by the backup system. In another example, to recover an application, a capsule and a payload can be retrieved, and using the metadata, the capsule can be unpacked to reinstall the application to the same state it was in when backed up, and the application related data can be restored from the payload.

Abstract: A system for accessing a database of a plurality of image data sets includes an acquisition unit which acquires a query for searching the database for an image data set or an image data subset comprised in an image data set. The query includes at least one medically relevant term which defines a search criteria. A determining unit determines the image data set or the image data subset included in the image data set based on the strength of semantic matches between the at least one medically relevant term and (a) corresponding medical annotation(s) describing the image data set. A retrieving unit retrieves the determined image data set or image data subset from the database.

Abstract: Systems and methods of the present disclosure facilitate managing information technology (IT) infrastructure. The system can include a server configured to retrieve data records for first and second IT assets, each asset comprising at least one of a computing device, a software application, an end user, a business unit, a piece of networking hardware, or an agreement for an IT service. The server can select a template comprising a relationship between the first and second data records. The system can include a link generator configured to generate a different relationship, absent from the template, between the first and second data records. The system can include a search engine configured to identify third and fourth IT assets that satisfy the second relationship, determine an indices of completeness for the third and fourth IT assets, and rank the third and fourth IT assets based on the indices to generate an ordered list.

Abstract: A method and associated systems for backing up a target computer application that comprises identifying and backing up databases and other information repositories upon which the target application depends. The target application is identified and related to a backup requirement that specifies a minimum application-backup frequency. The application's “dependencies” are automatically identified from sources that include configuration files, where each dependency identifies one or more databases or other information repositories that store information upon which the application directly or indirectly depends. If any of these databases or repositories is associated with a backup frequency less than the application's minimum backup frequency, the database or repository is flagged. Each flagged entity's backup schedule is then revised so that the flagged entity's backup frequency is equal to or greater than the application's minimum backup frequency.

Abstract: Cluster file systems are provided having a FUSE interface. A cluster file system comprises a FUSE object storage device that communicates with at least one object storage server of the cluster file system; and provides an interface between the cluster file system and at least one additional file system having a FUSE implementation. The additional file system optionally includes a burst buffer appliance. The burst buffer appliance can be configured, for example, to control the movement of data between first and second storage tiers. The burst buffer appliance can optionally communicate with a plurality of clients over the network and process requests from the clients. The FUSE object storage device provides an interface to, for example, a parallel log-structured file system and/or a Lustre clustered file system.

Abstract: A method for disseminating content over an overlay network having a plurality of routers in communication with providers and consumers of content is disclosed. A router in the overlay network receives a content descriptor corresponding to a query for content from a node, and generates a subscriber interface list based on the query for the content. The subscriber interface list is transmitted to a plurality of subsequent routers in the overlay network, wherein a content identified by the subsequent routers that correspond to the query will be routed to the router based on the subscriber interface list. The router receives first and second documents corresponding to the query for the content from the node. If the second document is the duplicate, the router deletes the second document and transmits the first document to the node or if not the router transmits both the first and second documents to the node.

Abstract: Techniques for enabling fault tolerant distributed query processing are provided. In one embodiment, a first processing node in a plurality of processing nodes can execute an instance of a query operator, where the query operator is part of a query plan for a database query that is processed in a distributed manner by the plurality of processing nodes. The first processing node can further generate a snapshot of the instance of the query operator, where the snapshot includes state information usable for moving execution of the query operator from the first processing node to another processing node after a failure of the first processing node. The first processing node can then save the snapshot to a distributed data store.

Abstract: A system for matching nearest contacts in a logical contact hierarchy can include a logical contact hierarchy disposed in a database; and, a hierarchical query processor coupled to the logical contact hierarchy. The hierarchical query processor can be configured to produce a closest matching contact from among contacts in the logical contact hierarchy based upon a specified anchor contact in the logical contact hierarchy. A boolean operator further can be programmed to select a closest matching contact based upon a boolean expression operating upon multiple closest matching contacts produced by the hierarchical query processor.

Abstract: Techniques provided herein allow for management of data. In various embodiments, systems and methods prune and retain data being managed by a data management system, where the managed data can include log data aggregated from one or more servers for analysis purposes. According to some embodiments, pruning can be triggered according to one or more constraints, such as the age of managed data (e.g., retain only 30 days of managed data) or the memory space required to store the managed data (e.g., retain only 100 GB worth of managed data). The constraints that trigger data pruning can be based on a data retention policy. When triggered, pruning can be performed on a fraction of the managed data stored based on the data retention policy (e.g., 3 days of full managed data, 27 days of pruned managed data). The pruning may be performed by sampling, at a desired rate, the managed data.

Abstract: An apparatus, and an associated method, facilitates synchronization of a group of data objects. Batches of data objects are iteratively processed. When a synchronization response indicates that the data of the request is unsynchronizable, data associated with the synchronization request is marked. A retry procedure is subsequently utilized to attempt synchronization of the marked data objects and to determine the individual data objects that cannot be synchronized.

Abstract: A user behavior analysis (UBA) method, and a related device and system are provided. The method is applied to a UBA system including at least one UBA cloud server. The method includes: receiving, by a UBA cloud server, a network content identifier reported by a first UBA subnode, where the network content identifier cannot be identified by the first UBA subnode; acquiring network content corresponding to the network content identifier; extracting a keyword from the network content; updating a behavior knowledge base by using the extracted keyword; and delivering, by the UBA cloud server, the updated behavior knowledge base or updated content of the behavior knowledge base to a UBA subnode set, where the UBA subnode set at least includes the first UBA subnode and a second UBA subnode. The UBA cloud server and the UBA subnodes are associated with a telecommunication network.

Abstract: Described are computer-based methods and apparatuses, including computer program products, comprising the steps of, or structure for, storing a plurality of expert profiles in a database, each of the plurality of expert profiles comprising information associated with a person having knowledge in a particular category, subject or topic; receiving search criteria over a network from a query source; selecting at least one of the plurality of expert profiles comprising information that satisfy the search criteria; and transmitting expert profile data for each of the selected expert profiles to the remote search engine, the expert profile data comprising data that defines a displayable representation of a corresponding expert profile, the expert profile data further comprising data that facilitates a client-initiated, real-time communication session over the network with a person associated with the corresponding expert profile.