Abstract: Techniques and solutions are provided for defining and executing a process controller representation of a business process model. The business process model has a plurality of objects arranged in a hierarchy. Objects at multiple levels of the hierarchy are used to generate one or more of a service, a strategy, or a method of a process controller representation. A method of the process controller representation calls another process controller service or another process controller strategy. The business process model can be associated with multiple process controller representations, which can be associated with multiple, different computing systems.

Abstract: Techniques and solutions are disclosed for managing subprocess versions and their associated components in a computing system. These techniques enable dynamic adaptation and traceability through version control. A subprocess definition is received and updated to reflect modifications to its components, configurations, or execution sequence. Changes are identified and propagated using unique version identifiers and events. Iterative refinement is supported through actions such as validating updated subprocesses, reprocessing data, or maintaining provenance chains. The disclosed solutions provide efficient and structured management of subprocesses.

Abstract: Systems and methods are provided for dynamic data masking for graphical and textual content in robotic process automation (RPA). Textual and/or graphical content to be obfuscated in an RPA project is indicated. Textual and graphical elements of RPA artifacts and other RPA content of the RPA project corresponding to the indicated textual and/or graphical content are identified and obfuscated. The RPA project is then updated with the obfuscated content and stored. The provided systems and methods for dynamic data masking of graphical and textual content are highly customizable and reduce the possibility of errors. Further, once data obfuscation is established, sensitive data in projects and artifacts are automatically masked as the projects and artifacts are updated or edited.

Abstract: A method for exposing artificial intelligence content as a cloud service may include onboarding, by a service broker of a core platform hosting an artificial intelligence (AI) resource, a service provider tenant providing the artificial intelligence resource. The onboarding of the first service provider tenant includes creating, at the core platform, a function specific service broker associated with the artificial intelligence resource. The function specific service broker may then onboard one or more service consumer tenants for accessing the artificial intelligence resource associated with the first provider tenant. Moreover, in response to the one or more service consumer tenants accessing the artificial intelligence resource, the function specific service broker may authenticate the one or more service consumer tenants and meter a usage of the artificial intelligence resource by the one or more service consumer tenants. Related methods and computer program products are also disclosed.

Abstract: A computer-implemented method and system including generating a representation of an object associated with an equipment in an equipment management network, the object having an object type and being generated for a first user of the equipment management network; receiving, from the first user, an indication of whether a first other user is authorized to reshare the object via the equipment management network with a second other user of the equipment management network; receiving, from the first other user, an indication to reshare the object with the second other user; determining, based on a value of the indication of whether the first other user is authorized to reshare the object with the second other user, that the first other user is authorized to reshare the object with the second other user; and automatically resharing the object with the second other user without requesting approval from the first user.

Abstract: A computer implemented method can receive n training samples including sample values corresponding to m attributes and respective target values (n and m are positive integers), duplicate the sample values corresponding to the m attributes, pack the sample values into ciphertexts based on a batching option, and train a regression tree using the ciphertexts. The training is configured to encrypt the regression tree through homomorphic operations on the ciphertexts.

Abstract: A transaction which targets an object store employing an open table format (OTF) may be detected by a database execution engine. Next, the database execution engine performs a determination step to determine which OTF enhancement levels to apply to the detected transaction. Then, the database execution engine applies one or more OTF enhancement levels to the transaction based on the determination step. Next, the database execution engine causes the transaction to be processed with the applied one or more OTF enhancement levels. Then, the database execution engine returns a result of the transaction processing to a computing device.

Abstract: In an example embodiment, additional metadata is attached to a delta tables, via delta shares, in the form of a common schema notation (CSN) entity. When a request is received from a client for a share of a range of delta tables where the range comprises the delta table to which the additional metadata is attached, the most recent CSN entity for each of the delta tables in the range are aggregated and returned to the client.

Abstract: An agent task scheduler may include a local timer to generate a current local timer value. An agent task scheduler, independent of other agent task schedulers, may arrange to periodically perform a task scheduling process. The agent task scheduler may obtain a current Domain Name System (“DNS”) text record that includes a next timer value indicating when a task should next be executed and a prior timer value indicating when the task was last executed. If the current local timer value is greater than the next timer value in the DNS text record, the scheduler may update the next timer value in the DNS text record to the current local timer value plus a value associated with periodic performance of the task scheduling process. The scheduler may also update the prior timer value in the DNS text record to the current local timer value and perform the task.

Abstract: Techniques and solutions are disclosed for managing subprocess versions and their associated components in a computing system. These techniques enable dynamic adaptation and traceability through version control. A subprocess definition is received and updated to reflect modifications to its components, configurations, or execution sequence. Changes are identified and propagated using unique version identifiers and events. Iterative refinement is supported through actions such as validating updated subprocesses, reprocessing data, or maintaining provenance chains. The disclosed solutions provide efficient and structured management of subprocesses.

Abstract: A computer implemented method receives a query to perform a join operation that joins a first table with a second table based on matching values in a selected column of the first table with values in a selected column of the second table, obtains a first dictionary for the selected column of the first table and a second dictionary for the selected column of the second table, and determines an output size of the join operation based on the first dictionary and the second dictionary. A dictionary for a given column includes a plurality of unique values in the given column and corresponding range indices. A count of a given unique value in the given column is mapped to a range associated with a range index corresponding to the given unique value. Related systems and software for implementing the method are also disclosed.

Abstract: A computer-implemented method can include generating a first knowledge graph from a first version of an application programming interface (API), generating a second knowledge graph from a second version of the API, identifying changes from the second knowledge graph to the first knowledge graph, and generating a difference graph based on the identified changes from the second knowledge graph to the first knowledge graph. The difference graph connects the second knowledge graph to the first knowledge graph via one or more revision edges, which represent the identified changes from the second knowledge graph to the first knowledge graph.

Abstract: A semantically-aware visual layout for a Failure Mode and Effects Analysis (FMEA) is generated based on semantic data for the FMEA and rendered for display via a user interface. A graph traversal is performed on the semantic data to create preliminary layout data, which is processed along with the semantic data to determine absolute positions for nodes and edges which take into account their semantic types and creation times. A visual representation of a layout for the FMEA is rendered based on the processed layout data, in which a focus FMEA group is centrally arranged, with superordinate and subordinate groups positioned to the left and right of the focus FMEA group at a downward offset. Within a given group, function nodes are centered below a system element node, and failure mode nodes are arranged in a cherry-on-tree formation below and to the right of a corresponding function node.

Abstract: Techniques and solutions are disclosed for annotating and processing data across schemas using a matching model. Data associated with a first source schema is received from a first source and submitted to the matching model. The model generates results identifying matches between instances in the first source schema and a second source schema, where the schemas may be the same or different. Based on these results, annotations are added to the first source schema to reflect relationships with data in the second source schema. Annotations may include derivation relationships and schema mappings, such as those implemented in knowledge graphs. Annotated data may be used to train or refine the matching model iteratively. Additionally, previously ingested data may be reprocessed with updated models, and version information of the matching model associated with annotated data to track updates and provide traceability.

Abstract: A combined change-point analyzer automatically detects change points in time series data by sequentially applying a Bayesian model and a Pruned Exact Linear Time (PELT) model. After a pre-processing stage, the Bayesian model identifies potential change points in the time series data by determining respective Bayes factors for positions in the time series data and outputs the potential change points to the PELT model. The PELT model determines respective costs of the pre-change points using a penalized cost function and minimizes the penalized cost function over the time series data to determine final change points from among the potential change points. A feedback loop system can be implemented in which the respective final change points are manually verified as confirmed, modified, or pending change points or removed. User input received during the manual verification process can be stored and used for model parameter optimization to enhance accuracy and efficiency.

Abstract: Arrangements for partition handling for multi table scan semi join operations are provided. Partition information of a first logical relation may be determined. Partition information of a first physical operator may be determined based on the partition information of the first logical relation. The partition information of the first physical operator may be stored in a data structure which includes partition information of a fact table and of each reducer in a predefined sequence. Partition information of a second logical relation may be determined. The partition information of a second physical operator may be determined based on the partition information of the second logical relation and the partition information of the first physical operator. The partition information of the second physical operator may be stored in the data structure. Execution of the second physical operator may be performed using the stored partition information, skipping mappings between pairs of partitions.

Abstract: A computer-implemented method for generic tenant data replication for disaster recovery, includes regularly checking, by a primary replication agent on a primary site, for changes to a primary change log on the primary site. Based on an insert of a new change record in a secondary change log on a secondary site, triggering a stored procedure from secondary stored procedures on the secondary site, that extracts a change operation and data from the secondary change log and performs the changed operation on a secondary tenant table on the secondary site. By a secondary replication agent on the secondary site and from the primary replication agent, receiving a call not containing a sequence id for a change record marked as completed in the secondary change log, and deleting the change record. Using a replication agents control plane, providing central monitoring for the primary replication agent and the secondary replication agent.

Abstract: Systems and methods include creation of data associated with an instance of an entity, requesting, in response to creating the data, of execution of a partial anomaly check of stored data associated with the instance of the entity, detection of a log entry associated with the partial anomaly check, identification, based on the log entry, of the instance of the entity, determination that the instance of the entity is a critical instance, determination, in response to determining that the instance of the entity is a critical instance, to perform a full anomaly check based on the instance of the entity, and requesting, in response to determining to perform the full anomaly check, of execution of a full anomaly check of stored data associated with the instance of the entity.

Abstract: Systems and methods described herein relate to semantic feature extraction for auto-labeling of defects. An image is processed to obtain structured text data describing a target defect of an item appearing in the image. The structured text data is processed to convert the structured text data into a target embedding associated with the target defect. The target embedding is automatically compared with a plurality of reference embeddings to obtain a comparison result. The plurality of reference embeddings is stored in a reference data structure that associates each reference embedding with a respective defect label. Based on the comparison result, the reference data structure is updated and assignment of a target defect label to the image is initiated. Such operations may be performed for each of a plurality of images in an unlabeled dataset.

Abstract: A computer-implemented method receives a request to explain a configuration key which represents a set of rules for controlling a process flow of an entity of an enterprise resource planning (ERP) system, the set of rules defining a data operation scheme based on a plurality of tables stored in a database of the ERP system. The method generates a data object from the plurality of tables, the data object including a group of key-value pairs which collectively define the set of rules, preserving the hierarchy of the involved tables. The method generates a prompt based on the data object generated from the plurality of tables, prompts a large language model using the prompt, receives a response from the large language model, and based on the response, outputs an explanation of the configuration key summarizing the set of rules in natural language. Related computing system and software are also disclosed.