Abstract: Semantic consolidation of data is disclosed. One example is a system including a data processor, a semantic relations module, and a consolidation module. The data processor identifies at least two data objects, each data object including a plurality of data elements. The semantic relations module identifies, via a processor, semantically similar data elements of the plurality of data elements. The consolidation module merges the identified semantically similar data elements via the processor, and generates a consolidated data object based on the merged data elements.

Abstract: Methods, systems, and devices for split and duplicate ripple circuits are described. A ripple circuit may be divided into stages, which may operate in parallel. For example, a first stage may have a finite number of possibilities for an output that is relevant for a second stage, and the second stages may be replicated according to the finite number of possibilities. The replicated second stages thus may operate concurrently with each other and the first stage, with each of the replicated second stages assuming a different possible output from the first stage. Once operation of the first stage is complete, the true output of the first stage may be used to select one of the second stages as corresponding to the correct assumed output, and the output of the selected second stage may be or may be included in a set of output signals for the circuit.

Abstract: Digital approximate squarer (aSQR)s utilizing apparatuses, circuits, and methods are described in this disclosure. The disclosed aSQR methods can operate asynchronously and or synchronously. For applications where low precisions is acceptable, fewer interpolations can yield less precise square approximation, which can be computed faster and with lower power consumption. Conversely, for applications where higher precision are required, more interpolations steps can generate more precise square approximation. By utilizing the disclosed aSQR method, precision objectives of a squarer approximation function can be programmed real-time and on the fly, which enables optimizing for power consumption and speed of squaring, in addition to optimize for the approximate squarer's die size and cost.

Abstract: Disclosed is a true random number generator and a method for generating a true random number. The true random number generator includes a sampling circuit and a random number generating circuit. The sampling circuit is configured to sample N voltage(s) of N capacitors according to a clock signal and thereby generate N sample value(s), in which the N is a positive integer. The random number generating circuit is configured to generate a random number according to at least a part of the N sample value(s).

Abstract: A mechanism for provisioning a composite web application using secure parameter transfer is disclosed. The composite web application includes a component that resides on a virtual machine (VM). A request is received from the component for a configuration parameter that is to enable periodic reconfiguration of the VM. An access condition is identified for accessing the configuration parameter and responsive to determining the access condition is satisfied, the requested configuration parameter is provided to the component. The VM is reconfigured using the requested configuration parameter.

Abstract: Quantum entanglement protection is disclosed. An entanglement checker receives, from a requestor, a request associated with a first qubit. In response to receiving the request, the entanglement checker accesses qubit entanglement information that identifies an entanglement status of the first qubit. The entanglement checker determines, based on the qubit entanglement information, the entanglement status of the first qubit, and sends a response to the requestor based on the entanglement status.

Abstract: Implementations for verifying validity of a literate programming document are described. An example method may include accessing a first module of a plurality of modules of a literate programming document, wherein the plurality of modules are organized as a directed graph, identifying a first contract associated with the first module, wherein the first contract specifies a first set of input criteria to be satisfied by one or more first input provided to the first module and a first set of output criteria to be satisfied by one or more first output generated by the first module, and determining whether the one or more first output satisfies the first set of output criteria when the one or more first input satisfies the first set of input criteria.

Abstract: A system and method for implementing a dynamic payments catalog is described. A set of processors that satisfy a set of requirements is identified. Required fields for each of the set of processors are further identified. Valid values for each of the required fields identified are determined. A dynamic payments catalog is built based on the identified required fields and valid values. Access to the dynamic payments catalog is then provided to clients.

Abstract: Embodiments disclose systems and methods for generating source code. One or more application specific inputs and one or more external inputs are received. Using a machine learning model, source code is automatically generated based on the one or more application specific inputs and the one or more external inputs. The source code can embody the one or more application specific inputs and the one or more external inputs. One or more revisions to the automatically generated source code may be made, and a difference determined between the generated source code and the revised source code. The machine learning model may be further trained to generate a future source code based on the differences it determines.

Abstract: A modeling system may generate a function model and a corresponding functional complexity score (FCS) for display on a graphical user interface (GUI). The FCS may be calculated by looping through each level of the function model and determining a score based on both hierarchical relationships and functional relationships within the function model at each level. The modeling system may constantly monitor for additional inputs representative of an additional function or changes to current functions and automatically update the FCS displayed on the GUI based on the additional inputs.

Abstract: A computer-implemented method (and corresponding system) is provided that enables or facilitates the execution of a portion of source code, written in a high-level language (HLL), on a blockchain platform. The method and system can include a blockchain compiler, arranged to convert a portion of high-level source code into a form that can be used with a blockchain platform. This may be the Bitcoin blockchain or an alternative. The method can include: receiving the portion of source code as input; and generating an output script comprising a plurality of op codes. The op codes are a subset of op codes that are native to a functionally-restricted, blockchain scripting language. The outputted script is arranged and/or generated such that, when executed, the script provides, at least in part, the functionality specified in the source code.

Abstract: A method for executing program components on a control unit includes receiving a first program unit and a second program unit; producing a first proxy definition and a second proxy definition, wherein a proxy definition stipulates access to at least one function and/or a memory area of a program unit, wherein the first proxy definition is associated with the first program unit and the second proxy definition is associated with the second program unit; compiling the first program unit and the second program unit to produce a first program component, a second program component, a first proxy component and a second proxy component; and executing the first program component and the second program component on a control unit, wherein the first program component calls and/or uses at least one function of the second program component by using the first proxy component and the second proxy component.

Abstract: A quantum computing system includes a quantum processor having a plurality of qubits, a classical memory, and a classical processor.

Abstract: Analyzing or debugging applications is provided. The system identifies an action for an application provided by a developer. The system determines a first classification score based on historical execution of the action. The system generates a machine generated action for the application based on metadata associated with the application. The system determines a second classification score based on a comparison of the action with the machine generated action. The system selects, via a matching program, a second application that matches the application. The system determines a third classification score based on a comparison of an action approved for the second application with the action provided by the application developer. The system updates a delivery control parameter based on the first classification score, the second classification score and the third classification score. The system controls delivery of the application based on the delivery control parameter.

Abstract: Mapping applications or smart contracts to a data confidence fabric. A smart contract is deployed and executed in a data confidence fabric based on trust requirements of the smart contract. The trust requirements are mapped to the nodes of the data confidence fabric. A ledger is created on the identified nodes and the application is deployed to and run on the identified nodes.

Abstract: The present disclosure relates generally to systems and methods for providing sets of compatible firmware versions (e.g., cross-compatibility solution) for flashing (e.g., programming or re-programming) different devices of a network of devices (e.g., an industrial automation system) when using a flashing application. Providing the compatible firmware versions of such network of devices may facilitate flashing the devices with compatible firmware, based on a topology of the network of devices, to prevent functional errors in the network of devices. The present systems and methods may also be applicable to determining and providing cross-compatibility solution between different firmware, as well as software, used by different devices of a network of devices.

Abstract: In some examples, a method includes downloading, from an application provider, a patch to be applied to a first application element and a stripped version of the application that does not include one or more application elements to be reused during installation of the application, decompressing the first application element to generate a decompressed version of the first application element, and decompressing the patch to generate a decompressed version of the patch. The method may also include applying the decompressed version of the patch to the decompressed version of the first application element to generate a patched application element, compressing the patched application element to generate a compressed patched application element, and installing the application using the compressed patched application element, the stripped version of the application, and the one or more application elements other than the first application element.

Abstract: Embodiments of systems and methods for verification of software packages prior to deployment on an Information Handling System (IHS) are described. In an illustrative, non-limiting embodiment, an IHS may include a Baseboard Management Controller (BMC) having computer-executable instructions for creating a partition having a unique name in response to a request from the IHS. The BMC then transmits the unique name to the IHS, and exposes the created partition to the IHS in which a software upgrade package image is copied to the partition when the exposed partition becomes available to the IHS. The BMC may then deploy the software package on the BMC, wherein the software package comprises executable instructions for operating the BMC.

Abstract: In accordance with an embodiment, described herein is a system and method for managed server independence for deployment (MSI-D) of software applications and libraries, for use in a cloud computing, application server, or other environment. Software applications or libraries can be prepared for deployment as multi-version format application(s) or library(s). A deployment configuration tool enables use of an input file which specifies one or more deployment configuration overrides data that provide additional pieces of information for each MSI-D/multi-version format application and library. A managed server can independently poll for changes to the deployment configuration overrides, for example to update one or more of its deployed applications or libraries, from a first version to a second version. The system can be used to provide eventual consistency of the deployed application and library versions within a plurality of managed servers.

Abstract: Embodiments of the present disclosure include systems and methods for efficient over-the-air updating of firmware having compressed and uncompressed segments. The method includes receiving a first update to the firmware via a radio, wherein the first update includes a first uncompressed segment and a first compressed segment, receiving a second update to the firmware, wherein the second update corresponds to the first compressed segment, compressing the second update to generate a compressed second update, applying the first update to the firmware, and applying the compressed second update to the firmware to generate an updated firmware.

Abstract: A control apparatus includes a switching unit configured to switch a state of a first and a second on-vehicle power supply to a power or a non-power supplying state, an acquisition unit configured to acquire operation information indicating whether the control device is in an operating or non-operating state, and a control unit configured to execute, in a case where a combination of the first and the second power supply is changed from a first to a second pattern, start-up control to determine a state in the second pattern, of an on-vehicle control device suppliable with power from the first power supply, based on the operation information in the first pattern. The first pattern is the first power supply in the power supplying state and the second power supply in the non-power supplying state. The second pattern in the first and second power supplies are in the power supplying state.

Abstract: An interaction method and an interaction apparatus are provided. The first terminal device transmits the interface information to the second terminal device in response to the message confirming that the first terminal device is connected with the second terminal device. The interface information is used for generating the interaction interface by the second terminal device. The first terminal device acquires the operation instruction from the second terminal device, and executes the operation instruction to obtain the operation result. The operation instruction is the instruction for operating the interaction interface. The first terminal device generates the update instruction based on the operation result and transmits the update instruction to the second terminal device. The update instruction is used for updating the interaction interface by the second terminal device.

Abstract: In one embodiment, one or more computing systems executes a computer program defining (1) a bound value that references a bound variable and (2) a terminating bound value that references computation instructions for deriving a runtime value from at least the bound value of the bound variable. A computation orchestration layer of a programming framework initializes, according to the computer program, a subscription tracker that tracks subscription relationships between the bound variable and the terminating bound value. The computation orchestration layer uses, in response to receiving an indication of an update to the bound value of the bound variable, the subscription tracker to determine that the terminating bound value subscribes to updates to the bound value of the bound variable. The computation orchestration layer sends an update stream associated with the update to a callback function associated with the terminating bound value.

Abstract: A fire and security system includes a control panel and one or more connected device. The control panel is in signal communication with a data control loop. The connected device is in signal communication with the at least one control panel via the at least one data control loop. The connected device includes a memory unit having a free memory area that stores first data and an active memory area that stores second data different from the first data. In response to operating the connected device according to the second data, the at least one connected device receives updated data delivered by the at least one of the control panel over the data control loop, and replaces the first data stored in the free memory data with the updated data.

Abstract: A method and a device for processing a software update for at least one vehicle device, in particular for a head unit in the vehicle. The software update is stored by a control device in a second memory area which is different from a first memory area that has a software currently used by the vehicle device. The control device controls the access of the vehicle device to a single data memory, the data memory including at least the first and second memory areas.

Abstract: Disclosed embodiments relate to adjusting vehicle Electronic Control Unit (ECU) software versions. Operations may include receiving a prompt to adjust an ECU of a vehicle from executing a first version of ECU software to a second version of ECU software; configuring, in response to the prompt and based on a delta file corresponding to the second version of ECU software, the second version of ECU software on the ECU in the vehicle for execution; and configuring, in response to the prompt, the first version of ECU software on the ECU in the vehicle to become non-executable.

Abstract: Systems and techniques that facilitate automated recommendation of microservice decomposition strategies for monolithic applications are provided. In various embodiments, a community detection component can detect a disjoint code cluster in a monolithic application based on a code property graph characterizing the monolithic application. In various aspects, the code property graph can be based on a temporal code evolution of the monolithic application. In various embodiments, a topic modeling component can identify a functional purpose of the disjoint code cluster based on a business document corpus corresponding to the monolithic application. In various embodiments, a microservices component can recommend a microservice to replace the disjoint code cluster based on the functional purpose.

Abstract: Methods and systems are presented for automatically detecting positions of various webpage elements within a webpage when the webpage is rendered, based on analyzing the programming code of the webpage using graph-based and NLP-based techniques. A position detection system obtains the programming code of the webpage and generates a DOM tree based on the programming code. A group of leaf tags may be identified based on traversing the DOM tree. The position detection system may use two different, but coordinated, prediction models to make the classification prediction for the leaf tags, where the first prediction model focuses on recall by identifying as many positive leaf tags as possible at the cost of low precision and the second prediction model refines the results from the first prediction model by improving the precision of the classification.

Abstract: Aspects of the subject disclosure may include, for example, a method in which a processing system loads a software program into compilers associated with different programming languages to identify a language of the software program, determines whether the software program is executable in the identified language, and compiles the software program to generate executable code. The system retrieves executable programs in the identified language from a program database, analyzes a syntax of the executable code and the executable programs, compares attributes of the executable code and the executable programs, and determines similarity ratings for the executable programs with respect to the executable code. The system also generates a code module comprising the executable code and at least a portion of the executable programs, based at least in part on the similarity ratings. Other embodiments are disclosed.

Abstract: An information processing apparatus (1) includes a storage unit (11) that stores knowledge information (111) containing a relationship regarding the correspondence between a plurality of types of element information (1111 to 111n) to be used for referring to a specified element value and conceptual information (1110) indicating a concept of the element value, an adding unit (12) that adds, to each of a plurality of graphs representing a processing structure in each of a plurality of source codes where any one of the element information (1111 to 111n) is described, the conceptual information (1110) identified from the element information corresponding to each node in the graph based on the knowledge information (111) as attribute information related to the node, and an extraction unit (13) that extracts a subgraph common to the graphs after the adding based on the conceptual information (1110).

Abstract: Software application data management. A data stream generated via a software application is received. A user profile is determined for a developer of the software application. One or more complications in a data model of the software application are predicted. Data of the data stream received is managed based on the one or more complications in the data model.

Abstract: An apparatus and method for compressing floating-point values.

Abstract: Techniques described herein may be utilized to serialise and de-serialise arithmetic circuits that are utilized in the execution of computer programs. The arithmetic circuit may be utilized to build a Quadratic Arithmetic Problem (QAP) that is compiled into a set of cryptographic routines for a client and a prover. The client and prover may utilize a protocol to delegate execution of a program to the prover in a manner that allows the client to efficiently verify the prover correctly executed the program. The arithmetic circuit may comprise a set of symbols (e.g., arithmetic gates and values) that is compressed to produce a serialised circuit comprising a set of codes, wherein the set of symbols is derivable from the set of codes in a lossless manner. Serialisation and de-serialisation techniques may be utilized by nodes of a blockchain network.

Abstract: In some embodiments, a programmable circuit configured to store a shift setting for a mode register parameter, and a shift circuit is configured to receive a first value of a mode register parameter. In response to the shift setting signal having a first value, the shift circuit is configured to adjust the first value of the mode register parameter to provide the mode register parameter having a second value. In response to the shift setting signal having a second value, the shift circuit is further configured to provide the first value of the mode register parameter as the second value of the mode register parameter. Circuitry coupled to an input/output terminal is configured to set a configuration based on the second value of the mode register parameter. The mode register parameter includes an on-die termination (ODT) parameter and the circuitry includes an ODT circuit, in some examples.

Abstract: A data processing system utilizes non-volatile storage to store constant values. An instruction decoder decodes program instructions to generate control signals to control processing circuitry to perform processing operations which may include processing operations corresponding to constant-using program instructions. Such constant-using program instructions may include one or more operation specifying fields and one or more argument specifying fields which control the processing circuitry to generate an output value equal to that given by reading one or more constant values from the non-volatile storage, optionally modifying such a value, and then performing the processing operation upon the value, or the modified value, to generate an output value.

Abstract: A data processing system includes an instruction pipeline containing instruction queue circuitry, fusion circuitry and decoder circuitry. The fusion circuitry serves to identify fusible groups of program instructions within a Y-wide window of program instructions and supply a stream of program instructions including such replacement fused program instructions to a X-wide decoder circuitry which decodes X program instructions in parallel using parallel decoders.

Abstract: A processor includes two or more branch target buffer (BTB) tables for branch prediction, each BTB table storing entries of a different target size or width or storing entries of a different branch type. Each BTB entry includes at least a tag and a target address. For certain branch types that only require a few target address bits, the respective BTB tables are narrower thereby allowing for more BTB entries in the processor separated into respective BTB tables by branch instruction type. An increased number of available BTB entries are stored in a same or a less space in the processor thereby increasing a speed of instruction processing. BTB tables can be defined that do not store any target address and rely on a decode unit to provide it. High value BTB entries have dedicated storage and are therefore less likely to be evicted than low value BTB entries.

Abstract: Systems, apparatuses, and methods for implementing zero cycle load bypass operations are described. A system includes a processor with at least a decode unit, control logic, mapper, and free list. When a load operation is detected, the control logic determines if the load operation qualifies to be converted to a zero cycle load bypass operation. Conditions for qualifying include the load operation being in the same decode group as an older store operation to the same address. Qualifying load operations are converted to zero cycle load bypass operations. A lookup of the free list is prevented for a zero cycle load bypass operation and a destination operand of the load is renamed with a same physical register identifier used for a source operand of the store. Also, the data of the store is bypassed to the load.

Abstract: An instruction execution method suitable for being executed by a processor is provided. The first processor comprises a register alias table (RAT) and a reservation station. The instruction execution method includes: a register alias table receives a first micro-instruction and a second micro-instruction and issues the first micro-instruction and the second micro-instruction to the reservation station; and the reservation station assigns one of a plurality of execution units to execute the first micro-instruction, according to the first specific message of the first micro-instruction; and the reservation station assigns one of the execution units to execute the second micro-instruction, according to the second specific message of the second micro-instruction.

Abstract: A set of entries in a branch prediction structure for a set of second blocks are accessed based on a first address of a first block. The set of second blocks correspond to outcomes of one or more first branch instructions in the first block. Speculative prediction of outcomes of second branch instructions in the second blocks is initiated based on the entries in the branch prediction structure. State associated with the speculative prediction is selectively flushed based on types of the branch instructions. In some cases, the branch predictor can be accessed using an address of a previous block or a current block. State associated with the speculative prediction is selectively flushed from the ahead branch prediction, and prediction of outcomes of branch instructions in one of the second blocks is selectively initiated using non-ahead accessing, based on the types of the one or more branch instructions.

Abstract: Branch prediction in an instruction using a tag orientation predictor (TOP) is described. When a branch instruction is hotly mis-predicted by a hybrid branch predictor, the branch is tracked over a longer time period using the TOP. Once the TOP has collected enough data to confidently predict a branch prediction, the TOP is used to override a branch prediction from the hybrid predictor when the TOP branch prediction.

Abstract: A method for debugging a processor which is executing vertices of a software application is described. Each vertex is assigned to a programming thread of the processor. The processor has debug hardware for raising exceptions in certain break conditions. The method comprises inspecting a vertex identifier, comparing the vertex identifier and raising an instruction exception event for the programming thread if the vertex identifier assigned to the thread matches the vertex break identifier in the debug hardware. Exceptions are raised based on identified vertices, rather than just individual instructions or instruction addresses.

Abstract: Disclosed herein are system, method, and computer program product embodiments for utilizing look-ahead-staging (LAS) to guarantee the ability to rollback and reconstruct a package while minimizing locking duration and enabling multiple packages to be processed in a data pipeline simultaneously. An embodiment operates by receiving a package from a source system for processing through a data pipeline. The embodiment stores the package in a persistent storage together with a respective package status. The embodiment transmits the package to the data pipeline in response to the storing. The embodiment receives a commit notification for the package from a target system in response to the transmitting. The embodiment then removes the package from the persistent storage in response to receiving the commit notification for the package.

Abstract: Disclosed embodiments relate to systems and methods for implementing chained tile operations. In one example, a processor includes fetch circuitry to fetch one or more instructions until a plurality of instructions has been fetched, each instruction to specify source and destination tile operands, decode circuitry to decode the fetched instructions, and execution circuitry, responsive to the decoded instructions, to: identify first and second decoded instructions belonging to a chain of instructions, dynamically select and configure a SIMD path comprising first and second processing engines (PE) to execute the first and second decoded instructions, and set aside the specified destination of the first decoded instruction, and instead route a result of the first decoded instruction from the first PE to be used by the second PE to perform the second decoded instruction.

Abstract: Methods, systems and apparatuses for graph streaming processing are disclosed. One method includes loading, by a group load register, a subset of a an input tensor from a data cache, wherein the group load register provides the subset of the input tensor to all of a plurality of processors, loading, by a plurality of weight data registers, a plurality of weights of a weight tensor, wherein each of the weight data registers provide an weight to a single of the plurality of processors, and performing, by the plurality of processors, a SOMAC (Sum-Of-Multiply-Accumulate) instruction, including simultaneously determining, by each of the plurality of processors, an instruction size of the SOMAC instruction, wherein the instruction size indicates a number of iterations that the SOMAC instruction is to be executed and is equal to a number of outputs within a subset of a plurality of output tensors.

Abstract: A system for assigning a workload to compute resources includes an interface and a processor. The interface is configured to receive a workload. The processor is configured to break the workload into a set of subproblems; and for a subproblem of the set of subproblems: determine whether the subproblem benefits from intersheet parallelism; determine whether the subproblem benefits from intrasheet parallelism; determine whether the subproblem benefits from directed acyclic graph (DAG) partitioning; and assign the subproblem, wherein assigning the subproblem utilizes optimization when appropriate based at least in part on benefits from the intersheet parallelism, the intrasheet parallelism, and the DAG partitioning.

Abstract: A data storage device includes a memory device and a controller coupled to the memory device. During a boot operation, the controller is configured to determine whether the boot is a device boot or a host boot. The controller includes a boot optimization unit. The boot optimization unit or the controller is configured to collect statistics of the fetched data, predict the data to be fetched next, and speculatively fetch the data. The controller further includes a rearrangement unit. The controller or the rearrangement unit is configured to rearrange data in the memory device based on the collect statistics of the fetched data so that the next boot operation is more optimized than the current boot operation.

Abstract: A method, a system and a computer program product for performing software configuration alignment. An indication of a source configuration change of one or more source computing processes of a source computing system is received from the source computing system. A determination is made whether the source configuration change is applicable to one or more target computing processes of a target computing system. The target computing system is communicatively coupled to the source computing system. Using the source configuration change, a target configuration change for implementation in the target computing processes of the target computing system is generated. The generated target configuration change is transmitted to the target computing system. The generated target configuration change is implemented in the target computing processes of the target computing system.

Abstract: A method of tuning performance of a data storage system includes calculating an estimate of parallel fraction and speedup characteristic for a data storage application executed by the data storage system. The estimate is calculated using linear regression of values (1/N, 1/XN) that are generated from trial runs of the data storage application processing a workload using respective different numbers N of CPU cores to obtain corresponding performance values XN. The method further includes configuring the data storage system to execute the data storage application using a number of CPU cores based on the estimate of parallel fraction and speedup characteristic.

Abstract: The present invention extends to methods, systems, and computer program products for automating DevOps toolchains. A user registers with a platform provider through a user interface that provides a unified self-service portal. Subsequently, the user can login to a platform configuration system to access a user landing page and/or dashboard. The user can select DevOps platform tools to be installed and enter configuration information. When the user is satisfied with selected DevOps platform tools and entered configuration, the user can select a “confirm” user-interface control (e.g., a button). In response, the selected DevOps tools are installed (with a relatively high level of automation) as DevOps platform. The user can also change DevOps platforms through the user interface (also with a relatively high level of automation), including migrating, deleting, and upgrading DevOps tools.