Abstract: Systems and methods for generating and customizing remediation scripts. Generative artificial intelligence (AI) models can analyze existing scripts and tailor scripts according to specific incidents and environmental parameters, thereby creating a faster, more consistent, and error-free incident response process compared to existing solutions.

Abstract: A method for compiling an application is executed by one or more processors, and includes acquiring profiling information of a system on which an application is to be executed, generating a cost model based on the profiling information, acquiring an intermediate representation of at least a portion of the application, applying compiler passes to the intermediate representation and generating a compiled graph, and using the cost model, determining an expected execution time for the compiled graph.

Abstract: Disclosed are systems and methods for dynamic architecture mapping. In some embodiments, one or more processing circuits identify an architecture parameter of an application based on an architecture framework. The processing circuits generate an application profile of the application based on the architecture parameter and further map, based on the application profile, the architecture parameter to the architecture component by verifying an integration of the architecture component in the application satisfies the architecture parameter. In an example, the processing circuits output a mapped architecture component corresponding to one or more selectable actions provided to a graphical user interface (GUI) for configuring an architecture of the application and generate an architecture index of the application.

Abstract: A method of testing software executing on computer systems. The method comprises executing a plurality of test instructions associated with a test job by a testing application on the computer system on which the software executes; capturing information about a container associated with the software by the testing application, wherein the information comprises a memory allocation associated with the container, a memory consumed by the container, a central processing unit (CPU) utilization allocation, a CPU allocation consumed, an internet protocol (IP) addresses assigned to the container; determining a score by a test validation application based on the information about the container, on test results, and on a scoring policy defined by a test case suite, wherein the scoring policy defines scoring based in part on a type of the container; based on the scores, and taking action by the action engine in the computer system on which the software executes.

Abstract: Systems, methods, and computer-readable media for intercepting telemetry events obtained during operation of an application and analyzing the telemetry events are provided. The analysis can generate vulnerability reports that are supplemented with contextual data to assist a user in remediation efforts.

Abstract: An industrial integrated development environment (IDE) supports open or extensible application programming interfaces (APIs) that enable end users (e.g., plant asset owners, original equipment manufacturers (OEM), system integrators, etc.) to build upon the IDE's development platform to create custom views or to code custom functionality. This can include, for example, defining a control programming syntax supported by the industrial IDE, customizing a development environment view afforded by the IDE's interface, modifying or creating project editing functions, defining customized programming guardrails designed to guide compliance with in-house programming standards, or other such IDE customizations.

Abstract: An apparatus, method, and system comprising: a quantum computer that is configured to execute a parametric quantum circuit a plurality of times, the parametric quantum circuit comprising: a qubit with an unknown quantum state at an initial cycle of the parametric quantum circuit, an ansatz parametric circuit for receiving the unknown quantum state and outputting a processed quantum state, and a detection sub-circuit for indicating a distance measure of the processed quantum state from a target state, wherein said quantum computer implements a Variational Quantum Algorithm (VQA) scheme to iteratively set parameter values of the ansatz parametric circuit until obtaining a parameter value that causes the parametric quantum circuit to output an approximation of zero; and an output module for outputting the ansatz parametric circuit.

Abstract: A method for testing a computer program. The method includes executing the computer program until a memory enable command is called for a memory region previously allocated by a memory allocation command of the computer program; skipping the memory enable command, and setting, for each of one or more memory locations of the memory region that is to be enabled by the memory enable command, a relevant watchpoint to the memory location of the memory region; and displaying, for each set watchpoint, that the computer program has a bug if the set watchpoint is triggered.

Abstract: Systems or techniques are provided for facilitating desktop-to-cloud application migration. In various embodiments, a system can access a desktop application. In various aspects, the system can deploy the desktop application in a cloud computing environment, based on generating a nested model-view-presenter software architecture that treats the desktop application as an outer data model. In various instances, the cloud computing environment can comprise a server device and a client device, wherein the server device can host the desktop application and a portion of an outer presenter, and wherein the client device can host another portion of the outer presenter and an outer view. In various cases, the outer view can comprise an inner view, an inner presenter, and a lite version of the desktop application.

Abstract: A method for determining a binary function entry includes distinguishing a text section and an exception handling section by parsing a binary code, disassembling the text section to determine an address of an end branch instruction, an address of a direct call target, and an address of a direct jump target, determining an indirect return function call address from the addresses of the end branch instructions, determining an exception handling block address from the addresses of the end branch instructions, excluding the indirect return function call address and the exception handling block address from the addresses of the end branch instructions and determining a tail call corresponding to the binary function entry from the addresses of the direct jump targets.

Abstract: A system can be provided for to evaluating artificial intelligence (AI) generated structure language files. For example, the system can receive a first structured language file generated by a large language model (LLM). The first structured language file can include generated keys and generated values for a resource. The system can also receive a second structured language file, which can include test keys and test values for the resource. The system can further extract, using a schema for the resource, resource keys. The system can determine, based on a comparison of the generated keys and the resource keys, a valid key total. Similarly, the system can determine, based on a comparison of the generated values and the test values, a valid value total. The system can then generate performance metrics for the LLM. Each performance metric can depend on the valid key total or the valid value total.

Abstract: Robotic process automation (RPA) bot flows may be modified in the event the RPA bot flows fail to successfully complete. The RPA bot flows may be modified based on user inputs, or the RPA bot flows may be modified based on similarities to other RPA bot flows that may include similar operations. In some embodiments determinations as to similarities to other RPA bot flows are made using a neural network. In some embodiments determinations as to similarities to other RPA bot flows are made using image analysis.

Abstract: Disclosed is an automated method and system for upgrading an automation function controlling an actuator via a PLC (programmable logic controller), including: providing a first container and a first sidecar container, whereby the first container contains a first automation function, the first automation function is controlling the actuator via the PLC, providing a second container and a second sidecar container, whereby the second container contains a second automation function, the second automation function is receiving data from the actuator but is not controlling the actuator, based on the received data pre-activation tests for the second automation function are executed in the second sidecar container by the second test unit, if the pre-activation tests are successfully finished, the time when the control of the actuator is handed over is determined, and the control of the actuator is handed over from the first automation function to the second automation function.

Abstract: A method and system are disclosed for testing functionality of a software program based on at least one modification to a software code of the software program. In one embodiment, the method includes: receiving software code of software program from one or more sources; identifying functions within the software code of the software program affected by the modification of software code; simulating the identified functions of the software program using digital twin; determining workflows of the software program based on the simulation of digital twin; identifying at least one impacted workflow from determined workflows based on one or more requirements of software program; and executing at least one impacted workflow critical to the functionality of the software program for testing the functionality of software program.

Abstract: Provided are a compiling device, a compiling method, and a compiling program with which the speed of a program can be increased when a loop in a program includes an access to adjacent data. The compiling device includes: a loop analysis unit for determining whether vectorization of a loop in a source program is possible when an access to adjacent data is included in the loop; and a vectorization execution unit for generating an instruction for reading elements required for computation from a memory to a vector register when access to the adjacent data is included and the vectorization of the loop is possible.

Abstract: Techniques for program code management are disclosed. For example, a method obtains resource utilization data from a computing network comprising a plurality of computing devices. The method then utilizes a multi-variate time series model representing at least a portion of the resource utilization data to automatically compute at least one time window in which to perform a program code update on at least a subset of the plurality of computing devices.

Abstract: The technologies described herein provide a system having nonvolatile firmware memory that is configured on the same integrated circuit as a BMC SoC. This design provides the ability to store the system firmware within the SoC to minimize or eliminate the use of complex components or specialized silicon, while minimizing the number of attack points. The disclosed techniques also improve the performance of a system by eliminating the need for a system to perform a validation of contents stored on an external memory device for each boot. Further, the disclosed techniques can allow a storage device that is internal to the SoC to use a local bus of the SoC, and mitigate or eliminate the need for an SPI bus, which is much slower than the local bus of the BMC SoC.

Abstract: An apparatus to facilitate data parallel programming task graph optimization through device telemetry is disclosed. The apparatus includes a processor to: receive, from a compiler, compiled code generated from source code of an application, the compiled code to support a workload of the application; generate a task graph of the application using the compiled code, the task graph to represent at least one of a relationship or dependency of the compiled code; receive runtime telemetry data corresponding to execution of the compiled code on the one or more accelerator devices; identify one or more scheduling optimizations for the one or more accelerator devices based on the task graph and the received telemetry data; and provide a scheduling command to cause the one or more scheduling optimizations to be implemented in the one or more accelerator devices.

Abstract: A method includes: acquiring a hook point and a virtual program counter by analyzing a virtual machine of a script engine; acquiring a branch virtual machine instruction by analyzing an instruction set architecture; and providing an analysis function to the script engine based on the acquired virtual program counter and the acquired branch virtual machine instruction, wherein the analysis function is provided by applying a hook to the acquired hook point and wherein the hook includes processing of, in response to an occurrence of an exception, changing a pointing destination of a virtual stack pointer to a return destination of a function immediately before a part where the exception has occurred.

Abstract: In one embodiment, a method includes receiving information associated with a plurality of devices. The information includes a manufacturer, a model name, and a current version of software for each of the plurality of devices. The method also includes generating a plurality of classifications. Each of the plurality of classifications is associated with a particular manufacturer and a particular model name. The method further includes determining a number of the plurality of devices in a first classification of the plurality of classifications, categorizing the number of the plurality of devices in the first classification into a plurality of categories by the current version of software, and determining, independent of any type of device identifier, a latest available version of software for the first classification.