Abstract: A system and method provides information to a user about other users who have shown an interest in the user or in whom the user shows an interest, or other users in whom the user has shown disinterest or other users who have shown disinterest in the user, as indicated by actions performed with respect to a website or other Internet-accessible repository of data.

Abstract: Systems and methods are provided for tracking and enforcing relationships between items. A relationship interface may be provided that conveys the relationship (or link) between items, and through which a user may define the link between two or more items. Identifying a link between two items may establish a set of one or more rules to be enforced with respect to the use of one or both of the items (e.g., when the items are stored, when the items are used to create other items, when other items are associated with the items). In various embodiments, violations of one or more rules may be identified and provided via the user interface. In some embodiments, new items that conflict with one or more rules may be prevented from being committed.

Abstract: Systems, computer program products, and methods are described herein for synchronizing dataflow migration between technical environments. The present invention is configured to identify one or more resources in a source environment for migration from the source environment to a target environment; capture, using a resource assessment engine, one or more dependencies associated with the one or more resources; generate a migration load based on at least the one or more resources identified in the source environment and the one or more dependencies associated with the one or more resources; generate a snapshot of the source environment based on at least the migration load, wherein the snapshot comprises at least the one or more resources and the one or more dependencies; and store the snapshot of the source environment in a snapshot database repository.

Abstract: Disclosed are techniques for defragmentation in deduplication storage systems. Machine language determines using deduplication metadata that at least some of an incoming input/output stream is a duplicate of at least part of a source volume whose physical locations of its stored data are fragmented in backend storage. Subsequently, defragmentation is carried out on the stored data by using the incoming input/output stream to write the data into sequential chunks at new physical locations in the backend storage and updating the source volume location mappings to the new physical locations.

Abstract: Disclosed are a system and method for processing HL7 messages. A method includes receiving, an HL7 message; storing the HL7 message in a memory; creating a data structure representation of the stored HL7 message in the memory that stores a start index and an end index of the stored HL7 message, wherein the start index indicates a beginning of the stored HL7 message and the end index indicates an end of the stored HL7 message; hierarchically creating, from the data structure representation of the stored HL7 message, one or more data structure representations in the memory that store at least one start index and at least one end index corresponding to one or more fragments in the stored HL7 message; and, modifying the stored HL7 message according to the at least one start index and a corresponding end index of the fragments in the HL7 message.

Abstract: In an example, an article may be analyzed to identify entity terms. Entity term relevance scores associated with the entity terms may be determined based upon the article and the entity terms. One or more first entity terms may be selected based upon the entity term relevance scores. One or more sets of reference position information associated with the one or more first entity terms may be determined. A first set of reference position information is based upon one or more positions, in the article, of one or more references to a first entity term. One or more second entity terms of the one or more first entity terms may be selected based upon the one or more sets of reference position information. A set of one or more salient entity tags associated with the article may be generated based upon the one or more second entity terms.

Abstract: One or more computing devices, systems, and/or methods for constructing and implementing a network management plan are provided. Baseline classifications are assigned to a set of locations. Sub-locations at the set of locations are evaluated to determine whether to override any of the baseline classifications. A model is used to evaluate images depicting the set of locations to generate predicted classifications for the set of locations. Classifications are assigned to the set of locations by implementing conflict resolution rules to selectively retain or replace baseline classifications with predicted classifications. The classifications are used to construct and/or implement a network management plan.

Abstract: The present disclosure discloses a method, a related apparatus and storage medium for distributed transaction processing. The method includes: obtaining, by a distributed transaction processing device, a distributed transaction processing request; writing, by the distributed transaction processing device, a commit log corresponding to the distributed transaction processing request to a second object database set in the target database cluster, the commit log comprising a commit indication result; obtaining, by the distributed transaction processing device after the distributed transaction processing device resumes distributed transaction processing, the commit log from the second object database set; and performing, by the distributed transaction processing device when the commit indication result in the commit log instructs to commit the processing operation on the account data in the N accounts, the processing operation on the account data in the N accounts.

Abstract: Technologies for generating relevance-independent position effects estimates for a set of ranked digital items are described. Embodiments include creating an input data set that includes request tracking data and associated activity tracking data. A relevance-independent position effects estimator generates an output data set. An item of the output data set includes user interface position data associated with a pair of adjacently positioned items of the input data set. The user interface position data indicates that a change in user interface activity probability data relating to a change in position between the items of the pair is greater than a change in the user interface activity probability data relating to a difference in the relevance score between the items of the pair. The output data set is stored in a searchable data store. Data from the searchable data store is provided to a downstream service.

Abstract: Embodiments of the present disclosure relate to a method, a device, and a computer program product for managing scheduling of a backup task. A method for managing scheduling of a backup task is provided, including: acquiring a scheduling setting for a target backup task, the scheduling setting specifying at least a start time of executing the target backup task in a backup system; acquiring execution information associated with execution of the target backup task according to the scheduling setting; and determining a score for the scheduling setting based on the execution information, the score indicating a degree of impact of the execution of the target backup task according to the scheduling setting on the performance of the backup system. With the embodiments of the present disclosure, the scheduling setting can be evaluated, thereby optimizing the scheduling of a backup task and improving the performance of a backup system.

Abstract: Database log writing is based on log pipeline contention. A determination is made as to whether contention in writing data to a log pipeline, which is used in writing data from memory to storage, is at a prespecified level. Based on determining that the contention in writing the data to the log pipeline is at the prespecified level, a split operation is automatically performed to create a new log pipeline.

Abstract: A device may receive information for an attribute to include in a shared attribute library. The information may include an attribute identifier, data variables needed to compute a value of the attribute, and source code for computing the value of the attribute. The source code may be written in a first programming language. The device may receive a first request to compute the value of the attribute based on a first set of data variables from a first type of data application and a second request to compute the value of the attribute based on a second set of data variables from a second type of data application that is different than the first type of data application. The device may select a computing server, which may execute the first programming language, to compute the value of the attribute based on the first and second sets of data variables.

Abstract: A method comprising retrieving a plurality of invalid user first commands and a plurality of user responses stored in a memory, wherein each of plurality of invalid user verbal commands are commands to a smart hub requesting a first smart device perform an action, wherein each of the plurality of invalid commands includes at least a first name for the first smart device, wherein the first name is not a valid name for the first smart device. Determining a trend within the retrieved plurality of invalid user verbal commands and a plurality of user responses, wherein the trend identifies the first name as being used a plurality of times and identifies the first smart device the user was referring to when the user used the first name. Automatically updating a namespace database to include the first name as an alias for a setup name for the first smart device.

Abstract: A program product comprising a non-transitory processor readable medium having software stored thereon. The software, when executed by one or more processing devices, is configured to merge a first distributed ledger with a second distributed ledger to form a merged ledger. The first ledger consists of a first beginning subset of blocks followed by a first end subset of blocks. The second ledger consists of a second beginning subset of blocks followed by a second end subset of blocks. The first beginning subset of blocks is identical to the second beginning subset of blocks and the first end subset of blocks is different than the second end subset of blocks. The merged ledger includes the first beginning subset of blocks followed by blocks corresponding to the first end subset of blocks and the second end subset of blocks.

Abstract: A journal of operations persistently stores a collection of user and machine interactions with documents, concepts within documents, and relationships/mentions among such documents and concepts. A knowledge graph or other visual expression can be used to provide an interactive format for user interactions with this information, and to visually display the accumulated information in the journal of operations on user's device of choice. Such accumulations are often called aggregations or aggregates. Both human users and computer users such as automated recommendation engines, machine learning algorithms, and the like can interact with the journal of operations to facilitate computer-assisted discovery and organization of data around a topic of interest to the human user. The resulting journal of operations and aggregations of those operations such as a knowledge graph or other visual expression(s) also provides a useful medium for sharing knowledge with other users and collaborating on investigation of a topic.

Abstract: Embodiments of the present disclosure provide methods, apparatus, systems, computing devices, and computing entities for generating a comparison data value for each attribute of interest for one or more attributes of interest associated with a dataset. In one embodiment, a method is provided comprising: importing the dataset into a database environment; executing a SQL procedure to aggregate records in the dataset into attribute data items, wherein each item comprises an aggregate data value for each attribute of interest; and for each item: executing the SQL procedure to (1) generate a standardized data value for each attribute of interest based on the aggregate data value; (2) identify a cohort; (3) generate a statistical data value for each attribute of interest with respect to the cohort; and (4) generate the comparison data value for each attribute of interest based on a comparison between the standardized data value and the statistical data value.

Abstract: Aspects of the disclosure relate to a data wrapper engine. A computing platform may receive a query comprising a request for data stored as a CLOB. The computing platform may obtain, from a data storage system, the data stored as a CLOB. The computing platform may generate a file wrapper for the data, wherein generating the file wrapper comprises converting the CLOB to a VARCHAR object and storing the VARCHAR object in the file wrapper. The computing platform may generate, using the VARCHAR object stored in the file wrapper, a SQL response to the query. The computing platform may execute the dynamic SQL response to generate a response to the query. The computing platform may send, to a user device, the response to the query and commands directing the user device to display the response to the query, which may cause the user device to display the response.

Abstract: A method, a system, and a computer program product for placement or storage of data structures in memory/storage locations. A type of a data structure for storing data and a type of data access to the data structure are determined. The type of data access includes a first and a second type of data access. A frequency of each type of access to each type of data structure accessed by a query is determined. Using the determined frequency, a number of first type of data accesses to the data structure is compared to a number of second type of accesses to the data structure. The numbers of first and second types of data access are compared to a predetermined threshold percentage of a total number of data accesses to the data structure. Based on the comparisons, a physical memory location for storing data is determined.

Abstract: A method, system and computer program product is disclosed for fuzzy searching. The method, which may be performed by one or more processors, may comprise providing a first prefix tree data structure representing a first data set comprising a first plurality of strings, and providing a second prefix tree data structure representing a second data set comprising a second plurality of strings. The first and second prefix tree data structures may each comprise nodes representing each character and edges connecting prefix nodes to one or more suffix nodes to represent each subsequent character in the string. A search may be performed to identify all matches between the first and second plurality of strings and also approximate matches between the first and second plurality of strings within a maximum distance k, wherein the search comprises traversing the first prefix tree data structure using a depth-first search algorithm to identify matches and approximate matches in the second prefix tree data structure.

Abstract: An apparatus comprises at least one processing device configured to, in a monitoring system in which at any given time at least one monitoring node has a primary monitoring role responsible for monitoring operation of system nodes of a distributed system and other monitoring nodes have a secondary monitoring role responsible for monitoring operation of the at least one monitoring node having the primary monitoring role, identify a first monitoring node having the primary monitoring role at a current time. The processing device is also configured to determine, based at least in part on a time-based ranking of the monitoring nodes, a second monitoring node having the secondary monitoring role at the current time to transition to the primary monitoring role, and to transition the second monitoring node to the primary monitoring role at a subsequent time.