Abstract: A program generation unit that generates voltage value information for making an LSI run on an operating voltage value based on a voltage context, wherein the program generation unit is provided with: a first compiler configured to compile a source program and that generate an object including a command sequence; a second compiler configured to generate the voltage value information based on a command density in the command sequence; and a linker configured to link the object with the voltage value information and that generates a user program.

Abstract: An approach is provided for optimizing a just-in-time (JIT) compilation process. A source pod in a container orchestrated execution environment is determined to be saturated. Profile data from a JIT compiler, a virtual machine state, and a native-compiled code state are collected. The profile data, virtual machine state, and native-compiled code state are stored in a data structure in a persistent data repository. In response to a restart or a redeployment of the source pod and an application running on the source pod, the stored profile data, virtual machine state, and native-compiled code state are reused in a new target pod, without requiring a monitoring and an identification of hot code areas in the application after the source pod becomes saturated.

Abstract: Attestation of operations by tool chains is described. An example of a storage medium includes instructions for receiving source code for processing of a secure workload of a tenant; selecting at least a first compute node to provide computation for the workload; processing the source code by an attestable tool chain to generate machine code for the first compute node, including performing one or more conversions of the source code by one or more convertors to generate converted code and generating an attestation associated with each code conversion, and receiving machine code for the first compute node and generating an attestation associated with the first compute node; and providing each of the attestations from the first stage and the second stage for verification.

Abstract: Various embodiments of the present technology generally relate to the characterization and improvement of software applications. More specifically, some embodiments relate to systems and methods for modeling code behavior and generating new versions of the code based on the code behavior models. In some embodiments, a method of improving a codebase includes recording a run of the existing code, characterizing the code behavior via one or more models, prototyping new code according to a target language and target environment, deploying the new code to the target environment, and comparing the behavior of the new code to the behavior of the existing code. In some implementations, generating new code based on the behavior models includes using one or more machine learning techniques for code generation based on the target language and environment.

Abstract: A method includes in response to a user selection of a command of a coding language, causing display of a set of argument blocks in a text input region based on syntax of the command Each argument block allows the user to input a value of an argument of the command to the argument block. In response to a user selection to modify the set of argument blocks, an argument block is added to the set of argument blocks displayed in the text input region based on the syntax of the command. In response to receiving from the user the input of the value of the argument to the added argument block, the command is caused to be coded in the text input region with at least the argument having the value from the input to the added argument block.

Abstract: A dataflow graph has operation units that are configured to be producer operation units to produce tensors for execution of the application, and to be consumer operation units to consume the tensors for execution of the application. Compile time logic is configured to process the dataflow graph to determine, for the tensors, expected producer memory layouts, expected consumer memory layouts, and current memory layouts. The expected producer memory layouts specify memory layouts required by the producer operation units that produce the tensors. The expected consumer memory layouts specify the memory layouts required by the consumer operation units that consume the tensors. The current memory layouts specify the memory layouts of the tensors. Each of the memory layouts includes a vector dimension and at least one of a vector ordering and a data alignment.

Abstract: A computer-implemented method, computer system, and computer program product for introspection of classes within source code. A computing device receives access to object-oriented source code. The computing device parses the source code to determine one or more objects contained in the source code. The computing device determines one or more classes associated with the one or more objects. The computing device generates a class table including one or more class data points associated with the one or more determined classes. The computing device generates one or more source code methods to perform a class-level introspection based upon the generated class table.

Abstract: Various embodiments are provided for providing intelligent library management in a computing environment by a processor. Application compatibility may be learned from a plurality of projects, repositories, application libraries, data sources, or a combination thereof. A list of recommended application libraries, ordered according to the application compatibility, may be automatically provided for implementation, integration, or replacements of one or more sections of an application library.

Abstract: In one embodiment, a service receives software version data regarding versions of software executed by devices in a network. The service detects a version change in the version of software executed by one or more of the devices, based on the received software version data. The service makes a determination that a drop in data quality of input data for a machine learning model used to monitor the network is associated with the detected version change. The service reverts the one or more devices to a prior version of software, based on the determination that the drop in quality of the input data for the machine learning model used to monitor the network is associated with the detected version change.

Abstract: Rules can be generated for migrating dependencies of a software application. For example, a computing device can receive a source version of a dependency of a software application and a target version of the dependency of the software application. The computing device can compare the source version to the target version to determine a difference between the source version and the target version. The computing device can receive a template for a rule indicating a location in the source version to be modified for the software application to support the target version. The template can include a fillable section. The computing device can populate the fillable section of the template with a value based on the difference between the source version and the target version.

Abstract: The technology disclosed relates to a self-service customization protocol for a single page website that implements a support component add-in to a CRM website. The protocol may be configured to customize support component add-in code for the CRM website, in some embodiments, at least by customization instructions applicable to the at least one page element of the support component add-in to the CRM website. In some embodiments, the at least one page element may be configured to search at least one support article hosted by the CRM website, display a visual representation of at least one featured category of articles available within the CRM website, and contact support for the CRM website, for example.

Abstract: Described is a method in a cloud-based system for implementing changes to flow engine software that executes user-specific flows for a plurality of users. The method includes: receiving a request to load and execute a user-specific flow; identifying an API version identifier for the user-specific flow; loading the user-specific flow; determining whether a software change to the flow engine software should be applied when executing the user-specific flow based on the API version identifier; and executing the user-specific flow using the flow engine software with the software change when it is determined, based on the API version identifier, that the software change to the flow engine software should be applied.

Abstract: Provided is a process of modeling methods organized in racks of a machine learning pipeline to facilitate optimization of performance using modelling methods for implementation of machine learning design in an object-oriented modeling (OOM) framework, the process including: writing classes using object-oriented modelling of optimization methods, modelling methods, and modelling racks; writing parameters and hyper-parameters of the modeling methods as attributes as the modeling methods; scanning modelling racks classes to determine first class definition information; selecting a collection of rack and selecting modeling method objects; scanning modelling method classes to determine second class definition information; assigning racks and locations within the racks to modeling method objects; and invoking the class definition information to produce object manipulation functions that allow access the methods and attributes of at least some of the modeling method objects, the manipulation functions being configur

Abstract: A programming language framework may be enhanced to provide for dynamic validation. Dynamic validation allows the validator function for any variable to be selected at runtime rather than statically declared at programming-time. Instead of annotating a variable with an annotation that refers to a specific validator function or constraint type, programmers can annotate a variable with an annotation that indicates that the validator function will be selected dynamically at runtime. When a runtime instance of the variable is created, the programming language framework may identify the dynamic validation annotation on the variable, and then use the runtime values in the variable to determine which validator function(s) should be used.

Abstract: A computer system, designed according to a particular architecture, compiles and execute a general quantum program. Computer systems designed in accordance with the architecture are suitable for use with a variety of programming languages and a variety of hardware backends. The architecture includes a classical computer and a quantum device (which may be remote from the local computer) which includes both classical execution units and a quantum processing unit (QPU).

Abstract: Techniques for accessing a migrated method include: identifying a request to invoke a method defined by a type, the request including one or more arguments associated with respective argument types; identifying, in the type, an older version of the method associated with (a) a method name and (b) a first set of one or more parameter types, and a current version of the method associated with (a) the method name and (b) a second set of one or more parameter types; determining that the argument type(s) match(es) the first set of one or more parameter types; responsive to determining that the argument type(s) match(es) the first set of one or more parameter types: applying one or more conversion functions to convert the argument(s) to the second set of one or more parameter types; executing the current version of the method using the converted argument(s).

Abstract: Implementing a design for a heterogeneous device can include mapping, using computer hardware, a plurality of applications of a design for a device to a plurality of domains of the device, wherein each domain includes a different compute unit, performing, using the computer hardware, validity checking on the plurality of applications, detecting, using the computer hardware, a conflict between two or more of the plurality of applications from the validity checking, and, in response to the detecting, generating a notification of the conflict using the computer hardware. Operations such as automatically generating a boot image, debugging, and/or performing system level performance analysis may also be performed.

Abstract: A multi-chip compatible compiling method includes: extracting common characteristic information of Makefiles; configuring variable attribute information of the Makefiles; obtaining a universal Makefile template for multiple chips according to the common characteristic information and the variable attribute information of the Makefiles; traversing a project to be compiled in the universal Makefile template by a compilation module, recording path information of a dependency file of the project to be compiled, replacing a variable value in the universal Makefile template, and determining automation configuration information of the universal Makefile template; invoking an incremental compilation mechanism of a Make tool according to the automation configuration information of the universal Makefile template to obtain a target Makefile of the project to be compiled; and processing the target Makefile by rule information and pseudo-target tag information in the Makefiles to obtain an executable file generated by co

Abstract: Methods, systems, and apparatus, including computer programs encoded on computer-storage media, for integration of containers with external elements. In some implementations, a server environment is provided using one or more containers. The one or more containers include a first container that is an instance of a software image for an application or service. The first container is run such that the first container performs various operations. For example, access to one or more external elements that reside outside of the software image is initiated. Based on the one or more external elements, a configuration of the first container is changed from what is provided by the software image.

Abstract: A technique implements a dataflow graph, taking a number of streams of data inputs and transforms these inputs into a number of streams of outputs. The dataflow graph can perform pattern matching. The technique implements reactions via the composition of pattern matching across joined streams of input data. A completeness of matching an input sequence to a particular input pattern can be characterized as having at least three different degrees, such as cold (not yet matched), warm (e.g., minimally matched), and hot (e.g., maximally matched). The input pattern to be matched can have a variable length, including zero length or unlimited or arbitrarily large length. Data flows can be on a push basis or pull basis, or a combination, and may change depending on the state.