Disclosed are an information flow-based decision-making and scheduling customization method and apparatus. The method includes: instantiating a pipeline and modules customized by a developer in the pipeline; mounting the modules on the pipeline in a module sequence customized by the developer; inputting a data stream into an entry of the pipeline; and acquiring a decision result for the data stream from an exit of the pipeline. The solution reduces the coupling between modules. The modules are independent from each other and can be developed collaboratively by many developers. In case the overall design remains unchanged, the modification of the modules has less impact on the global situation. The configurability of scheduling and decision-making is improved. Since the modules are dynamically mounted on the pipeline, this provides extremely high configurability for large-scale customization, and module instances can be dynamically generated by reading configuration information at runtime.

A computation graph is accessed. In the computation graph, operations to be performed are represented as interior nodes, inputs to the operations are represented as leaf nodes, and a result of the operations is represented as a root. Selected sets of the operations are combined to form respective kernels of operations. Code is generated execute the kernels of operations. The code is executed to determine the result.

Specifications are input, comprising: a plurality of lanes in an environment for a controlled system; a plurality of lane maneuvers associated with the plurality of lanes; a plurality of lane subconditions associated with the controlled system; and a rule set comprising a plurality of rules, wherein a rule in the rule set specifies a rule condition and a rule action to take when the rule condition is satisfied, wherein the rule condition comprises a corresponding set of lane subconditions, and wherein the rule action comprises a corresponding lane maneuver. The controlled system is automatically navigated dynamically, at least in part by: monitoring the plurality of lane subconditions; evaluating rule conditions associated with the plurality of rules in the rule set to determine one or more rules whose corresponding rule conditions has been met; and executing one or more lane maneuvers that correspond to the one or more determined rules.

Processing logic may determine that an application is to produce one or more records to an event streaming platform. Processing logic may determine a data structure to contain content to be stored to the event streaming platform. Processing logic may automatically generate a serializer in view of the data structure during development of the application. During runtime, the application may use the serializer to serialize the content contained in the data structure and store the content to the one or more records of the event streaming platform.

A computer-implemented method comprises: provisioning a plurality of data streams, each of the plurality of data streams being assigned an individual classifier; provisioning a list including a plurality of possible working steps; applying the plurality of individual classifiers to the plurality of data streams, wherein for each working step, based on the assigned data stream, a probability is determined; determining a current or next working step as a function of the probabilities; and provisioning the control signal.

A pipeline task verification method and system is disclosed, and may use one or more processors. The method may comprise providing a data processing pipeline specification, wherein the data processing pipeline specification defines a plurality of data elements of a data processing pipeline. The method may further comprise identifying from the data processing pipeline specification one or more tasks defining a relationship between a first data element and a second data element. The method may further comprise receiving for a given task one or more data processing elements intended to receive the first data element and to produce the second data element. The method may further comprise verifying that the received one or more data processing elements receive the first data element and produce the second data element according to the defined relationship.

Apparatuses, systems, and techniques to modify one or more portions of incomplete graph code. In at least one embodiment, one or more portions of incomplete graph code are modified based on, for example, CUDA or other parallel computing platform code.

A system and method for automatically routing datasets based on input and output requirements of information is disclosed. The example method includes obtaining a list of modules executing on one or more processing devices, each module to generate an output dataset of a respective output requirement based on an input dataset of a respective input requirement. The method also includes establishing connections between the modules based on the input requirements and output requirements, including a first connection between a first module and a third module and a second connection between a second module and the third module. The method also includes receiving a first output dataset from the first module and receiving a second output dataset from the second module and, responsive to determining that the first module reported an error, routing the second output dataset to the third module without routing the first output dataset to the third module.

Systems, devices, computer-implemented methods, and/or computer program products that facilitate dynamic control of ZZ interactions for quantum computing devices. In one example, a quantum device can comprise a biasing component that is operatively coupled to first and second qubits via respective first and second drive lines. The biasing component can facilitate dynamic control of ZZ interactions between the first and second qubits using continuous wave (CW) tones applied via the respective first and second drive lines.

A method includes processing event data to detect a status of a network function. The event data is processed based on two or more conditions defined by a correlation policy. The correlation policy includes a non-deterministic finite automata tree (NFAT) structure correlation policy having a policy type and a logic-gate. The method additionally includes determining the policy type of the NFAT structure correlation policy. The method also includes determining whether a first value of the two or more conditions is indicative of whether a first condition is satisfied. The method further includes determining whether a second value of the two or more conditions is indicative of whether the second condition is satisfied. The method additionally includes determining whether the NFAT structure correlation policy is satisfied based on the first value, the second value, the logic-gate and the policy type.