Abstract: Embodiments for identifying entities relevant to queries are provided. At least one query is received from a user. The at least one query is associated with at least one entity. Results of the at least one query are analyzed to identify related entities. The related entities are analyzed based on a relevancy score and an information enhancement score for each of the related entities to generate a ranking of the related entities. At least one of the related entities is provided to the user based on the ranking of the related entities.

Abstract: A method, a system, and a computer program product for executing synthetic backup processes and deduplication backup storage with landing zone. A synthetic backup of a data file is received. A partial re-synthesis of the synthetic backup of the data file is performed. A total size of the partial re-synthesized backup of the data file and the received synthetic backup is determined. A size of a complete re-synthesis of the synthetic backup of the data file is computed. The complete re-synthesis of the synthetic backup of the data file is performed when the determined total size exceeds the computed size of the complete re-synthesis of the synthetic backup of the data file.

Abstract: A history management method for managing history information of a vehicle using a blockchain is provided. The history management method performed by at least one processor includes generating a block for being connected to the blockchain from the history information collected in the vehicle, per block, setting a storage destination of a backup of the generated block from among nodes communicable with the vehicle, and sending the backup of the block to the node that is set as the storage destination.

Abstract: Transaction change data replication includes identifying changes being made to a source database as part of an ongoing transaction at a source. The identifying is performed as the changes are made to the source database and as the transaction remains ongoing prior to commit or rollback thereof at the source. The source and a target are in a replication relationship in which data of the source database at the source is replicated to destinations in a target database at the target. The indications of the changes being made to the source are forwarded, to the target, as the transaction remains ongoing prior to commit or rollback thereof, and based on ending the transaction at the source, an indication of the transaction end is sent to the target.

Abstract: Embodiments of the disclosure provide a method and an apparatus for talent-post matching, a device and a medium, which relates to the field of information matching and recruitment. The method includes: determining a resume feature representing a resume to be predicted according to a post submitted and the resume to be predicted; and predicting a matching degree between the resume to be predicted and the post by using a pre-trained predictive model according to a post feature of the post and the resume feature. With the method and the apparatus for talent-post matching, the device and the medium provided in embodiments of the present disclosure, the resume and the post may be matched automatically.

Abstract: An overlay optimizer can enhance the functionality of a write filter using an auxiliary overlay. An overlay optimizer can be loaded above a write filter. Based on the configuration of the write filter's overlay, the overlay optimizer can be configured to implement a volatile or persistent auxiliary overlay and then use the auxiliary overlay to selectively cache artifacts. To minimize the likelihood that the consumption of the write filter's overlay will exceed a critical threshold, the overly optimizer can be provided a list of monitored artifacts. The overlay optimizer can employ the list to selectively move monitored artifacts from the write filter's overlay to the auxiliary overlay when the overlay's consumption reaches a threshold. The overlay optimizer may also selectively allow I/O requests generated by particular applications while redirecting I/O requests generated by other applications.

Abstract: Disclosed herein are systems and method for building content for a de-duplication engine. In one aspect, an exemplary method comprises periodically receiving instructions for cycling through a coalescing phase and a sedimentation phase of the de-duplication engine, during a first coalescing phase, selecting a set of seed blocks that are similar to each other, when an instruction for proceeding to a next sedimentation phase is received, entering the sedimentation phase during which newly received blocks are processed to be stored near similar seed blocks, and when an instruction to proceed to a next coalescing phase is received, entering the coalescing phase to update the set of seed blocks.

Abstract: A non-transitory computer-readable recording medium recording an indexed data generation program causing a computer to execute processing of generating ledger sheet output format data from ledger sheet data including a ledger sheet having a plurality of columns; generating index information for words, characters, or numerical values, the index information including positional information capable of specifying attributes of the plurality of columns and a positional relationship in the ledger sheet data between pieces of data corresponding to the plurality of columns included in the ledger sheet output format data; and outputting an output file including the index information and the ledger sheet output format data.

Abstract: A method, computer program product, and a system to globally serialize transactions where a processor(s) establishes a communications connection a (serialization) resource and a resource manager for a distributed computing system. The processor(s) obtains a first request from an application executing on the resource for access to a global resource managed by the resource manager, for executing a transaction. The processor(s) implements a lock for the global resource in an object store of the resource manager over the communications connection. The processor(s) communicates the lock to the application, which executes the transaction and the processor(s) updates a memory with a record comprising attributes of the lock. The processor(s) obtains a second request from the application to terminate the lock, obtains, identifies the lock for the transaction, in the object store, and updates the object store to delete the lock.

Abstract: Various aspects of the subject technology relate to systems, methods, and machine-readable media for relevance feedback with faceted search interface. A system provides a first search query to an image search engine for initiating an image search, where the first search query indicates a first search term. The system obtains image metadata from an image collection, and obtains a listing of query refinement terms associated with the first search query from the query refinement data structure. The system determines a listing of search results containing images with one or more facets associated with the listing of query refinement terms. The system then receives user input indicating selection of at least one of the one or more facets of an image in the listing of search results. The system provides a second search query using the first search term and a second search term indicating the selected one or more facets.

Abstract: Systems and techniques are disclosed relating to management of a database. A method may include maintaining, by a computer system, a multi-tenant database operable to store a plurality of objects. Each object may be capable of including up to a maximum potential number of definable fields. Each field may have an associated index number that has been assigned sequentially. The method may include receiving user-defined data values for a subset of the maximum potential number of fields of a particular object, and storing, for the particular object, a boundary value indicating a range of index values that have been defined for the particular object. The method may further include, in response to determining that the particular object has been accessed, selectively processing a number of fields of the particular object. The number of fields may be determined based on the stored boundary value for the particular object.

Abstract: In one embodiment, a computer-implemented method comprises receiving, from a second computing device at a first computing device that is communicatively coupled to the second computing device, a request to store a first entity data object, the first entity data object including a first property key-value pair; using the first computing device, storing the first entity data object in one or more digital data repositories in response to the request; receiving, from the second computing device at the first computing device, a delete command that specifies the first property key-value pair to delete by; in response to the delete command that specifies the first property key-value pair to delete by, deleting the first entity data object in the one or more digital data repositories.

Abstract: Exemplary embodiments of the present disclosure provide for identifying similar trademarks from one or more repositories and providing an interactive graphical user interface in which selectable graphical segments corresponding to the trademarks in a graphical user interface are grouped based on similarity measures associated with one or more characters of the trademarks and arranged radially and circumferentially in the graphical user interface about a central circle representing the trademark input string of an electronic search order. Retrieval of the trademarks in the set can include a subset of possible trademarks available for retrieval that would satisfy one or more of the similarity measures and a color of each of the selectable graphical segments depends on whether the trademarks retrieved corresponding to the selectable graphical segments represent a complete set of the possible trademarks available, a subset of the possible trademarks available, or a null set of the possible trademarks available.

Abstract: Implementations of the present disclosure relate to methods, systems, and computer program products for multimedia object management. In one implementation, a computer-implemented method is disclosed and the method may be implemented by one or more processors in a computer. In the method, a graphic pattern indicating a request for searching in a repository for at least one target object may be received. A search condition may be obtained from the received graphic pattern by a graphical analysis. Based on an association model indicating associations between the search condition and at least one feature of one or more objects in the repository, at least one target object may be found according to the obtained search condition. In other implementations, a computer-implemented system and a computer program product for searching for at least one target object is disclosed.

Abstract: Disclosed is a search method and apparatus. A search service generates extend keywords highly related to a query input by a user, and provides a search result optimized to each extend keyword.

Abstract: Method and apparatus for monitoring collaboration parameters and maintaining user profiles using cognitive computing techniques are provided. The method includes receiving a domain for a first collaborative session, and retrieving a plurality of trait profiles associated with potential participants. The method further includes determining a subset of trait profiles based in part on comparing each respective trait profile with the rest of the trait profiles, and providing the subset of trait profiles. Additionally, the method includes receiving an indication that the subset of trait profiles is acceptable, and a request to initiate the first collaborative session with participants corresponding to the subset of trait profiles.

Abstract: Multi-dimensional aggregation using user interface workflow composition is described. A determination is made whether aggregation is complete for each level of a multi-dimension aggregation. Data is retrieved for a level of aggregation in response to a determination that aggregation is not complete for each level of the multi-dimension aggregation. The data is aggregating based on the level of aggregation. The aggregated data is stored for a next level of aggregation. The data for a final level of aggregation is output to a user interface in response to a determination that aggregation is complete for each level of the multi-dimension aggregation.

Abstract: Multi-dimensional aggregation using user interface workflow composition is described. A determination is made whether aggregation is complete for each level of a multi-dimension aggregation. Data is retrieved for a level of aggregation in response to a determination that aggregation is not complete for each level of the multi-dimension aggregation. The data is aggregating based on the level of aggregation. The aggregated data is stored for a next level of aggregation. The data for a final level of aggregation is output to a user interface in response to a determination that aggregation is complete for each level of the multi-dimension aggregation.

Abstract: An event is registered in at least one node server in a directed data structure, which comprises a computationally linked series of nodes such that each node encodes information included in at least one preceding node. Within at least selected nodes of the directed data structure after at least one initial node, a representation of at least one history data structure is included and has a highest-level value computed based on inputs of lowest level input values, at least one said lowest level input value encoding node-specific information of at least one preceding node. In a verification phase, a purportedly valid lowest level input value is verified by recomputing the corresponding highest-level value from the representation of the history data structure included in the corresponding node.

Abstract: A method is described that includes providing a snapshot counter for a storage system implemented with multiple distributed consistent database instances. The method further includes recognizing the taking of a snapshot of the storage system by incrementing the snapshot counter from a first snapshot counter value to a second snapshot counter value. The method further includes, in response to a first change for one of the distributed consistent databases subsequent to the taking of the snapshot, performing the following: saving state information of the distributed consistent database as the state information existed prior to the change and associating the first snapshot counter value to the state information. Associating the second snapshot counter's value with the distributed consistent database having the first change. Another method for the taking of a snapshot of a distributed consistent database is also described.