Abstract: The invention provides an apparatus, system and method for the comparison between songs to analyse how similar each song is to the next using a new system of classification. A new and improved method and apparatus for the weighting of these comparable variables between songs in order to find the best objective criteria for finding a likeness between songs is disclosed. The time complexity associated with the computation of the optimal path for smoothing a playlist of songs is substantially reduced using the system of classification.

Abstract: One example method includes registering with a long poll cloud service, receiving a notification from the cloud long poll service, and the notification includes information about a restore command, acknowledging receipt of the notification, downloading a restore description to a cloud restore service, performing the restore command, receiving file information in response to performance of the restore command, creating a restore job using the file information, and signaling that the restore command is complete.

Abstract: In one example, a method includes receiving, by a cloud service, a register call for authorization to access one or more other cloud services, and the register call is received from a backup client agent and includes a registration code, and registering, by the cloud service, the backup client agent. The cloud services implements an authentication process that includes evaluating the registration code, and when the backup client agent is not authenticated, access by the backup client agent to one or more of the other cloud services is prevented, and when the backup client agent is authenticated, a token is transmitted to the backup client agent.

Abstract: This disclosure relates to streaming real-time messages over time to client applications according to query subscriptions that match content from a large stream of messages exchanged on a messaging platform in a manner that increases the speed of message delivery, effectively controls the management of computer resources to handle the fluctuation of the number of active query subscriptions, and/or increases the security of matching the query subscriptions against messages generated from the perspective of the authors while delivering those messages in real-time from the perspective of the users that initiated the query subscriptions.

Abstract: An information management system provides a data deduplication system that uses a primary table, a deduplication chunk table, and a chunk integrity table to ensure that a referenced deduplicated data block is only verified once during the data verification of a backup or other replication operation. The data deduplication system may reduce the computational and storage overhead associated with traditional data verification processes. The primary table, the deduplication chunk table, and the chunk integrity table, all of which may be stored in a deduplication database, can also ensure synchronization between the deduplication database and secondary storage devices.

Abstract: Searching and locating an event on a calendar with a timeline is provided. An application such as a calendar application detects a search on the calendar or the timeline. One or more events are located on the calendar or on the timeline that match a search term of the search. The search term on the one or more events is highlighted. The one or more events with the search term that is highlighted are displayed on the calendar or the timeline.

Abstract: A method is performed at a server system. The method includes, while streaming a playlist at a first electronic device associated with a host listener, the playlist including media content items: automatically receiving an identity of a guest listener having a second electronic device, without explicit input from the guest listener after the second electronic device comes within range of the first electronic device; selecting an additional media content item based at least in part on the identity of the guest listener; and incorporating the additional media content item into the selected playlist.

Abstract: A hierarchical cluster analyzer identifies clusters in a big data set by identifying topological structure without distance-based metrics. The hierarchical cluster analyzer stochastically partitions the big data set to create pseudo-partitions of the big data set. The stochastic partitioning may be implemented with a random forest classifier that uses ensemble techniques to reduce variance and prevent overfitting. The hierarchical cluster analyzer implements random intersection leaves (RIL), a data mining technique that grows an intersection tree by intersecting candidate sets generated from the pseudo-partitions. The hierarchical cluster analyzer updates an association matrix according to co-occurrences of data points within each leaf node of the intersection tree. These co-occurring data points exhibit a high degree of similarity, which is recorded in the association matrix. A hierarchy of clusters may then be formed by finding community structure in the association matrix.

Abstract: Technology is disclosed for selecting at least one people highlight, with respect to a person of interest, to be shown on one or more user devices. The user device is monitored to determine a user interest in a person of interest. A set of possible people highlights, with respect to the person of interest is determined. A determination is made as to whether any of the possible people highlights should be suppressed and not presented to the user on the user device. Any people highlights that were determined to be people highlights that should be suppressed and not presented are removed to create a remaining set of possible people highlights. At least one of the remaining set of possible people highlights are presented on the user device.

Abstract: The present disclosure is related to a method of geo-clustering of data for de-identification of a dataset. The method includes generating a plurality of geoclusters based on a plurality of geocodes. The geocodes may include ZIP codes or postal codes. The method further includes identifying the geoclusters having the smallest population. The geocluster having the smallest population is iteratively merged with the nearest geocluster until a minimum population threshold is met. Once the smallest geocluster meets the minimum population threshold, the plurality of geoclusters can be used to cluster the geocodes within a dataset to be de-identified.

Abstract: An information processing device executes a process includes determining whether or not encoding target data is in an inflective form of a word when the encoding target data included in target sentence data is encoded; and registering the encoding target data and a code assigned to the encoding target data in a dynamic dictionary in association with each other, in a case where the encoding target data is in the inflective form of the word.

Abstract: In an embodiment, the disclosed technologies are capable of creating and storing a digital repository capable of storing digital work items; receiving a query; determining historical alpha values and historical beta values for each of at least two candidate search algorithms; for each of the at least two candidate search algorithms, generating a beta distribution using the historical alpha values and the historical beta values as parameters; for each of the at least two candidate search algorithms, computing, using values sampled from the beta distribution, a score that indicates a likelihood of the candidate search algorithm producing a search result that satisfies a relevance criterion; selecting, from the at least two candidate search algorithms, an algorithm that has a score that satisfies a selection criterion; and executing the query using the selected algorithm.

Abstract: Systems and methods for calculating a patent claim scope rating are disclosed. In an example embodiment, a method of calculating a patent claim scope rating includes identifying patent references cited in examination of a subject patent and storing the identified patent references as an applied art list, identifying first backward references for the patent references in the applied art list and storing the first backward references as a first backward list, identifying second backward references for the first backward references in the first backward list and storing the second backward references as a second backward list, identifying forward references for the patent references in the applied art list and storing the forward references as a forward list. A patent claim scope rating is based on a calculation including at least a partial combination listing of the applied art list, the first and second backward lists, and the forward list.

Abstract: A system for sharing a metadata store between a relational database and an unstructured data source is disclosed. The unstructured data source may comprise a Hadoop system with a Hadoop Distributed Files System.

Abstract: This invention discloses a novel system and method for displaying electronic documents on remote devices and enabling collaborative editing where the system upon a request by a user to access a document, automatically determines the latest version of a document that the person had accessed and also whether a newer version had been created. The invention also merges parallel changes that have not been viewed by the user into the comparison result. The invention also includes running a comparison on the two versions and presenting the result to the user.

Abstract: Content masking within a storage system includes: responsive to receiving a first request to access a portion of a stored snapshot, creating a transformed snapshot portion by applying a transformation specified in an access policy to one or more data objects contained within the portion of the stored snapshot; and presenting the transformed snapshot portion.

Abstract: A process receives, via a processor, a plurality of rules corresponding to a plurality of virtual indicium attributes that are displayed in conjunction with a virtual indicium. Each of the plurality of rules associates a data object with at least one of the plurality of virtual indicium attributes. Further, each of the plurality of virtual indicium attributes corresponds to a time-based metric. Moreover, the process retrieves, from a web portal database, one or more pre-generated web portal features corresponding to at least one of the plurality of rules. The process also generates, via the processor, a web portal based on the plurality of rules by composing the pre-generated web portal features with remaining web portal features to diminish redundancy of computing resources. Additionally, the process receives, via the processor, a user input via the virtual indicium corresponding to the time-based metric.

Abstract: Embodiments relate to personalized low latency communications. A method may include receiving a description of content of a message, receiving recipient data corresponding to at least two possible recipients within a population of possible recipients, and selecting a relevant subpopulation of the population. The selecting may include, for each of the at least two possible recipients, ranking a strength of an indirect relationship between the description and the recipient data. The indirect relationship may be based on the description, the recipient data and at least one additional data source. The selecting may also include, for each of the at least two possible recipients, adding a possible recipient to the relevant subpopulation based on the ranking of the indirect relationship associated with the possible recipient. The method may further include initiating a two-way communication channel between a sender of the message and the relevant subpopulation.

Abstract: A method for processing data relationships on electronic media sites includes: receiving a first data string and a second data string corresponding to a first account and at least one submission on the electronic media site; determining a content identifier of the at least one submission; correlating the determined content identifier with a database of identified content; determining a value of the at least one indicator to the data relationship between first and second accounts based on: content, context, frequency, recency, and volume of the indicator; receiving a third data string corresponding to the second account; processing the first and third data strings to determine identities of the first and second accounts; assigning a relationship designation between the first and second accounts; and receiving a fourth data string selected from a plurality of data strings according to a priority determined by a plurality of relationship designations.

Abstract: For a given cross-data-store transaction request at a storage service, a coordinator transmits respective voting transition requests to a plurality of log-based transaction managers (LTMs) configured for the respective data stores to which writes are directed in the transaction. The LTMs transmit responses to the coordinator based on data-store-specific conflict detection performed using contents of the voting transition requests and respective data-store-specific state transition logs. The coordinator determines a termination status of the cross-data-store transaction based on the LTMs' responses, and provides an indication of the termination status to the LTMs.