Abstract: In an event-driven architecture, at design time a central catalog allows event consumer(s) to reconstruct an event structure for later processing during runtime. The central event catalog receives from a publisher (of an event producer), an event description document specifying an event identifier, source code of an event class extracted from an event, and an annotation. This event description document is stored by the catalog as a central instance in a database. Upon receiving a query from an event consumer regarding the event, the event description document is returned as a query result. A code generator (of the event consumer) creates the event structure from the event description document, allowing processing of the event. Embodiments are particularly suited to centrally locate a single, up-to-date instance of an event description document, for reference in allowing multiple consumers of an event to accurately reproduce the latest version the structure of that event.

Abstract: A system to replicate user interaction with a building management system (BMS), the system including a processing circuit including a processor and memory, the memory having instructions stored thereon that, when executed by the processor, cause the processing circuit to receive first BMS data describing a BMS event having a first category, receive second BMS data describing a user response to the BMS event, generate a model, based on the first and second BMS data, describing response patterns associated with the user response, wherein the response patterns include actions to replicate the user response, and generate, in response to receiving third BMS data having the first category, one or more control signals based the actions in the model to control the BMS to replicate the user response.

Abstract: A code converter uses machine learning to determine conflicts and redundancies in software code. Generally, the code converter uses machine learning to convert software code into vectors that represent the code. These vectors may then be compared with other vectors to determine similarities between code. The similarities may be used to detect conflicts and/or redundancies created during the development process (e.g., when a developer attempts to change the code).

Abstract: An information processing apparatus includes a processing portion configured to perform information processing. The processing portion is configured to obtain definition information in which a first mnemonic and a second mnemonic different from the first mnemonic are associated with each other.

Abstract: Systems and methods provide a new paradigm of Advanced Process Control that includes building and deploying APC seed models. Embodiments provide automated data cleansing and selection in model identification and adaption in multivariable process control (MPC) techniques. Rather than plant pre-testing onsite for building APC seed models, the embodiments help APC engineers to build APC seed models from existing plant historical data with self-learning automation and pattern recognition, AI techniques. Embodiments further provide “growing” and “calibrating” the APC seed models online with non-invasive closed loop step testing techniques. PID loops and associated SP, PV, and OPs are searched and identified. Only “informative moves” data is screened, identified, and selected among a long history of process variables for seed model development and MPC application.

Abstract: A method for supplying cutting oil which is able to attain the above object by adopting the following processes in a machine tool for cutting work pieces. a. setting of individual cutting times to each work piece and selection of cutting oil to be used, b. setting of a quantity of the cutting oil supplied per unit time to a cutting area where the cutting oil selected by the process a is used, c. supplying the cutting oil to a cutting-oil tank, with a state kept that the cutting oil remains in the cutting-oil tank, and d. supplying the cutting oil to the cutting area on cutting each of the work pieces by setting a quantity of the cutting oil as a quantity obtained by multiplying individual cutting times according to the process a with a cutting quantity per individual unit times according to the process b.

Abstract: A method of operating a biological interface is disclosed. The method may include obtaining an input physiological or neural signal from a subject, acquiring an input set of values from the input signal, obtaining a predictive signal from the subject or the environment, acquiring a predictive set of values from the predictive signal, training a decoder function in response to data from the predictive set of values, performing at least one calculation on the input set of values using the decoder function to produce an output set of values, and operating a device with the output set of values. A biological interface system is also disclosed. The biological interface system may contain an input signal sensor, an input signal processor, a predictive signal processor, a memory device storing data, and a system processor coupled to the memory device and configured to execute a decoder function.

Abstract: Deterministic memory allocation for real-time applications. In an embodiment, bitcode is scanned to detect calls by a memory allocation function to a dummy function. Each call uses parameters comprising an identifier of a memory pool and a size of a data type to be stored in the memory pool. For each detected call, an allocation record, comprising the parameters, is generated. Then, a header file is generated based on the allocation records. The header file may comprise a definition of bucket(s) and a definition of memory pools. Each definition of a memory pool may identify at least one bucket.

Abstract: A method of controlling a matrix converter system is provided. The method includes receiving an operating condition and consulting a trained Q-data structure for reward values associated with respective switching states of the switching matrix for an operating state that corresponds to the operating condition. The Q-data structure is trained using Q-learning to map a reward value predicted for respective switching states to respective discrete operating states. The method further includes sorting the reward values predicted for the respective switching states mapped to the operating state that corresponds to the operating condition, selecting a subset of the set of the mappings as a function of a result of sorting the reward values associated with the switching states of the operating state, evaluating each switching state included in the subset, and selecting an optimal switching state for the operating condition based on a result of evaluating the switching states of the subset.

Abstract: A privacy-related consent extension and data processing system may be configured to automatically extend one or more privacy-related consents for a user of a first computing device to a second computing device. In various embodiments, the system is configured to provide a computer-readable indicium(indicia) on a previously unknown computing device upon initiation of a transaction between a user and an entity collecting and processing privacy data. In response to a user using a known computing device to scan the computer-readable indicium, in various embodiments, the system may provide the ability to share user consent data provided by the first known device to the second unknown device, allowing the user to provide consent without manually re-entering privacy and consent preferences.

Abstract: A method for improving performance of at least one hardware processor solving a top-k planning problem includes obtaining, in a memory coupled to the at least one processor, a specification of the planning problem in a planning language; obtaining, in a first iteration carried out by the at least one processor, at least one solution to the planning problem; and modifying the planning problem, in the first iteration carried out by the at least one processor, to forbid the at least one solution. The method further includes repeating, by the at least one processor, the obtaining of the at least one solution and the modifying to forbid the at least one solution, for a plurality of additional iterations, after the first iteration, until a desired number, k, of solutions to the planning problem are found or until no further solutions exist, whichever comes first.

Abstract: A compiler configured to configure memory nodes with a ready-to-read credit counter and a write credit counter. The ready-to-read credit counter of a particular upstream memory node initialized with as many read credits as a buffer depth of a corresponding downstream memory node. The ready-to-read credit counter configured to decrement when a buffer data unit is written by the particular upstream memory node into the corresponding downstream memory node, and to increment when the particular upstream memory node receives from the corresponding downstream memory node a read ready token. The write credit counter of the particular upstream memory node initialized with one or more write credits and configured to decrement when the particular upstream memory node begins writing the buffer data unit into the corresponding downstream memory node, and to increment when the particular upstream memory node receives from the corresponding downstream memory node a write done token.

Abstract: Load testing a service having a plurality of different states is provided. A multitude of simulated users accessing the service are divided into a plurality of cohorts. Simulated users within a given cohort share a similar personality type. A load test of the service is performed by applying a set of service requests from each respective cohort to the service. In response to a percentage of simulated users of each cohort encountering a particular state in the service, a user response is determined for the percentage of simulated users within each cohort at that particular state based on a probabilistic user behavior model corresponding to a personality type of each cohort such that user responses at that particular state are distributed in accordance with the probabilistic user behavior model. Distributed user responses at that particular state are applied to the load test in accordance with the probabilistic user behavior model.

Abstract: A technique includes receiving, by a computer, user input representing creation of a first programmatic description of a first test object of source code to be tested. The technique includes, in response to receiving the user input, determining, by the computer, based on other programmatic descriptions of other test objects, a recommendation of a parameter to be used in the first programmatic description to identify the first test object. The technique includes causing, by the computer, a display of the recommendation.

Abstract: The system and method described herein may upgrade kernels in cloud images deployed in cloud computing environments without having to rebuild a machine image that contains a root file system for the cloud image. For example, the cloud image may include a ramdisk that compares the kernel booted in the cloud image to the root file system to verify whether the machine image contains a directory hierarchy matching an operating system release for the kernel. In response to the machine image containing the matching directory hierarchy, the root file system may be mounted for execution in the cloud computing environment. Alternatively, in response to the machine image lacking the matching directory hierarchy, the ramdisk may dynamically create the matching directory hierarchy and inject modules that support the kernel into the root file system prior to mounting and delivering control to the root file system.

Abstract: A technique for efficient calling of functions on a processor generates an executable program having a function call by analysing an interface for the function that defines an argument expression and an internal value used solely within the function, and an argument declaration defining an argument value to be provided to the function when the program is run. A data structure is generated including the internal value and a resolved argument value derived from the argument expression and the argument value. A single instruction is encoded in the program to utilise the data structure. When the program is executed on a processor, the single instruction causes the processor to load the argument value and internal value from the data structure into registers in the processor, prior to evaluating the function. The function can then be executed without further register loads being performed.

Abstract: A consent receipt management and data processing system may be configured to provide a centralized repository of consent receipt preferences for a plurality of data subjects. In various embodiments, the system is configured to provide an interface to the plurality of data subjects for modifying consent preferences and capture consent preference changes. The system may provide the ability to track the consent status of pending and confirmed consents. In other embodiments, the system may provide a centralized repository of consent receipts that a third-party system may reference when taking one or more actions related to a processing activity.

Abstract: Disclosed herein are techniques for analyzing software delta changes based on functional line-of-code behavior and relation models. Techniques include identifying a prompt to change a first version of code on a controller to a second version of code; constructing, based on the identified prompt, a line-of-code behavior and relation model representing execution of functions of the controller based on the second version of code; performing a signature operation on the generated line-of-code behavior and relation model to produce a signature value; and sending the signature value to the controller; wherein the controller is configured to compare the signature value to a computed signature value that the controller is configured to compute based on the second version of code and determine, based on the comparison, whether to validate the second version of code.

Abstract: Systems, methods, and computer-executable instructions for synthesizing programs using a prefix of an output. A specification of a task to synthesize a program in a domain specific language (DSL) is received. The specification includes an input and a corresponding prefix of the output. Programs for the task are synthesized. The synthesizing includes generating sub-goals based on the specification. Each of the synthesized programs include a solved subset of sub-goals and each sub-goal includes a symbol in the DSL. The symbol is transformed based on the DSL. The sub-goals are solved based on the transforming of the symbol using the input and the corresponding prefix of the output to generate the synthesized programs. The prefix of the output matches a prefix of an output from each of the plurality of synthesized programs.

Abstract: A system and method for function summarization. In some embodiments, the method includes: identifying a basic function called by a first function, the first function having a signature; determining a first type, the first type being a type of an argument of the basic function or a type of a return value of the basic function; and propagating the first type, to determine a first portion of the signature of the first function.