Abstract: A decompilation apparatus includes a matcher that divides captured first program code for a processor of a first processor architecture into a sequence of code sections based on a predetermined set of at least partially parameterized code patterns, wherein the first program code implements a program logic and has been generated by compiling a computer program defined in a high-level language by a compiler, and the matcher captures for each code section specific parameter values for each parameter of a corresponding parameterized code pattern and assigns to each code section a terminal symbol of an intermediate language; and a parser that reduces a sequence of terminal symbols assigned to the sequence of code sections to non-terminal symbols of the intermediate language, wherein a totality of the non-terminal symbols generated by the parser by reduction describes the program logic of the computer program in the intermediate language.

Abstract: A method of analyzing a product includes performing an anomaly detection on a received image using an autoencoder, wherein the autoencoder includes at least one first neural network trained based on a first set of training images, and the first set of training images includes a plurality of training images each showing a corresponding defect-free product; determining, using a binary classifier, whether or not a defect is present based on a result of the anomaly detection; performing defect detection on the received image using a defect detector, wherein the defect detector includes a third neural network trained based on a one third set of training images, and the third set of training images includes a plurality of training images each showing a corresponding defective product; and evaluating a result based on a weighting of the results of the anomaly detection, the defect detection, and the binary classifier.

Abstract: A computer-implemented method of optimizing a usage distribution in a communications network uses a quantum concept processor. A set of traffic demands for a transfer of determined data volumes between origin nodes and destination nodes among the plurality of communication nodes is captured. The traffic demands are split into sub-demands. A set of optional communication paths for an individual routing of each sub-demand is specified. The edges within the set of optional communication paths are assigned a respective usage capacity limit. Fractional capacity usages of the edges are calculated based on the respective usage capacity limit. The calculated fractional capacity usages are formulated as terms of a quadratic stress function. An optimized routing is determined by using a quantum concept processor, thereby selecting for each sub-demand one communication path from the set of optional communication paths such that the quadratic stress function is minimized.

Abstract: A computer-implemented method optimizes a routing of data traffic in a communications network by using a quantum concept processor. A set of potential short communication paths among possible communication paths between respective origin nodes and respective destination nodes of captured traffic demands is specified. The edges within the set of potential short communication paths are assigned a respective usage capacity limit. Fractional capacity usages of the edges are calculated based on respective usage capacity limits of the edges. The calculated fractional capacity usages are formulated as terms of a quadratic stress function. An optimized routing is determined by using a quantum concept processor, thereby selecting for each traffic demand one short communication path from the set of potential short communication paths such that the quadratic stress function is minimized.

Abstract: A computer-implemented method of optimizing a usage distribution in a communications network uses a quantum concept processor. A set of traffic demands for a transfer of determined data volumes between origin nodes and destination nodes among the plurality of communication nodes is captured. The traffic demands are split into sub-demands. A set of optional communication paths for an individual routing of each sub-demand is specified. The edges within the set of optional communication paths are assigned a respective usage capacity limit. Fractional capacity usages of the edges are calculated based on the respective usage capacity limit. The calculated fractional capacity usages are formulated as terms of a quadratic stress function. An optimized routing is determined by using a quantum concept processor, thereby selecting for each sub-demand one communication path from the set of optional communication paths such that the quadratic stress function is minimized.

Abstract: A computer-implemented method optimizes a routing of data traffic in a communications network by using a quantum concept processor. A set of potential short communication paths among possible communication paths between respective origin nodes and respective destination nodes of captured traffic demands is specified. The edges within the set of potential short communication paths are assigned a respective usage capacity limit. Fractional capacity usages of the edges are calculated based on respective usage capacity limits of the edges. The calculated fractional capacity usages are formulated as terms of a quadratic stress function. An optimized routing is determined by using a quantum concept processor, thereby selecting for each traffic demand one short communication path from the set of potential short communication paths such that the quadratic stress function is minimized.

Abstract: A method of controlling a traffic system having a plurality of intersections with switchable traffic lights and road sections located between the intersections includes detecting traffic loads of multiple relevant road sections, determining a local stress function for each relevant road section depending on the detected traffic load of the respective relevant road section, determining a global stress function for the entire traffic system based on the local stress functions, determining, using a quantum concept processor, improved switching times for the traffic lights of the intersections adjacent to the relevant road sections, wherein the improved switching times are determined such that the global stress function reaches a smallest detectable value, and switching the traffic lights according to a switching model based on the improved switching times.

Abstract: A method of generating a representation of a program logic includes: capturing first program code in a low-level programming language, the program code having been generated by compiling program logic defined in a high-level language; dividing the captured first program code into a sequence of code sections based on a predetermined set of at least partially parameterized code patterns, wherein specific parameter values are captured for each code section and a terminal symbol of an intermediate language is assigned to each code section; assigning the assigned terminal symbols to non-terminal symbols of the intermediate language based on a context-free grammar, wherein a totality of the assigned non-terminal symbols describes the program logic of the first program code in the intermediate language; and generating a representation of the program logic independent of the first processor architecture based on the associated non-terminal symbols of the intermediate language and the detected parameter values.