Abstract: The invention relates to a method for generating data, wherein the method is implemented by computer. The method includes implementing a 3D engine to produce metadata relating to a reference scene generated using the 3D engine, wherein the reference scene is representative of a predetermined target situation. The method also includes providing, as input to a control model coupled to a generative model, at least part of the metadata produced by the 3D engine; calculating, using the generative model, at least one synthetic image representative of the target situation, from an output of the control model and descriptive data relating to the target situation; and storing, in a data set, at least one calculated synthetic image.

Abstract: The invention concerns a method for performing privacy-preserving federated learning. The method includes training an object detection model based on a central training dataset to obtain a preliminary model; for each of N local nodes, training a respective copy of the preliminary model based on a respective private training dataset, thereby obtaining a local model; and computing an average model as an average of N intermediate models, each depending on a respective local model. The method also includes generating a central model based on the preliminary model and on an average output of the average model based on a predetermined public dataset as input; or based on the average model and a local output of each local model based on the public dataset as input.

Abstract: Techniques for selecting a learning model defined in particular by parameters and hyperparameters from among a plurality of learning models, implemented by a computing device and provided. A computing device may be provided includes a model selection module and a model repository including a plurality of series of instructions each corresponding to a learning model and each including hyperparameter values. The method may be provided that includes a step of selecting a model when the prediction performance value and the classification value are greater than a predetermined second threshold and the hyperparameter value is greater than a predefined threshold value.

Abstract: The invention relates to a management system for managing digital battery passports, the management system including a plurality of manufacturer modules and a distribution module. Each manufacturer module is connected to the distribution module via a manufacturer module communication link, wherein each manufacturer module includes a creation submodule that allows a battery manufacturer to create a digital battery passport for each type of electrical energy storage physical battery. The digital battery passport includes a set of information data related to the electrical energy storage physical battery, and the set of information data includes information about the manufacturer of the battery, about the composition of the battery and about the sustainability of the battery.

Abstract: The invention relates to a manufacturer module for managing digital battery passports in a management system, The manufacturer module communicates with at least one battery manufacturer on a manufacturer communication link. The manufacturer module includes a creation submodule that allows a battery manufacturer to create, via the manufacturer communication link, a digital battery passport for each type of electrical energy storage physical battery. The digital battery passport includes a set of information data related to the electrical energy storage physical battery, and the set of information data includes information about a manufacturer of the battery, about a composition of the battery and about a sustainability of the battery. The manufacturer module also includes a manufacturer database said that stores the created digital battery passport.

Abstract: The invention relates to a distribution module for managing digital battery passports in a management system. The management system includes a plurality of manufacturer modules, each manufacturer module being connected to the distribution module via a manufacturer module communication link. The distribution module includes a user access submodule configured to receive a passport code sent by a user, to retrieve from the manufacturer database of one of the manufacturer modules, on the corresponding manufacturer module communication link, using the passport code, a subset of data of the digital battery passport related to the passport code that is received and to transmit the subset of data that is retrieved to the user.

Abstract: The invention relates to a supervision module for managing digital battery passports in a management system. The management system includes a plurality of manufacturer modules and a distribution module, where each manufacturer module is connected to the distribution module via a manufacturer module communication link. The supervision module includes a performance submodule that generates performance evaluations on information data of the digital battery passports stored in its manufacturer database.

Abstract: The invention relates to a clamp tool for inserting a circuit board into a socket. The clamp tool includes a hollow casing and a clamp mechanism. The hollow casing includes a handle and a base.

Abstract: The invention relates to a method (100) for evaluating the robustness of a neural network (102) used for image processing against a group of at least two different disturbances that can be found in images. The method comprises determining a robustness score (SRIi), called individual robustness score, of said neural network (102) for each disturbance (Pi) in said group; determining at least one similarity score (SSIi,j), called individual similarity score, for the similarity between two disturbances in said group; and calculating a robustness score (SRG), called overall robustness score, of said neural network (102) against said group of disturbances as a function of: the individual robustness scores (SRIi) for all the disturbances (P), and at least one individual similarity score (SSIi,j) for the similarity between two disturbances. The invention also relates to a computer program and a device implementing such a method.

Abstract: A computer-implemented method for processing, on a non-quantum computer, quantum data that represent one or more tensor products of a Pauli operator basis n of size n?, wherein comprises all the possible tensor products of n matrices of the set S={I, X, Y, Z}, wherein I is a 2×2 identity matrix, and X, Y, Z are the following Pauli matrices: X = [ 0 1 1 0 ] , Y = [ 0 - i i 0 ] , and ? Z = [ 1 0 0 - 1 ] , is proposed, which comprises: generating a data tree as a data structure that represents the one or more tensor products of the Pauli operator basis n, wherein the one or more tensor products respectively correspond to one or more paths of the data tree each running from a root node of the data tree to a leaf of the data tree, and determining the one or more tensor products of the Pauli operator basis n by performing a tree exploration of the generated data tree.

Abstract: A method for managing message delivery in a computing infrastructure. For each message to be delivered, the message is sent simultaneously by a transmitting component, to each server of a plurality of receiving servers. For each server that received the sent message, the server computes a signature specific to the message received, which is identical for each server, and the server sends the computed signature to a synchronization component. The sent signature is received by the synchronization component. If a first condition according to which the received signature is not stored in a signature database is met, the received signature is stored in the signature database and an instruction is sent to store or transmit the received message to the server by the synchronization component. Otherwise, the synchronization component sends an instruction to the server to delete the received message and the computed signature.

Abstract: One aspect of the invention relates to a high-performance computer comprising a plurality of clusters (21, 22) by an IP network (2), each cluster (21, 22) comprising: At least one Ethernet gateway (215, 225) configured to transmit data between the cluster (21, 22) and the IP network (2) storing at least one first routing table comprising at least, for each other cluster of the plurality of clusters (21, 22), an association of a gateway address (215, 225) with a destination IP address comprised in the cluster (21, 22) comprising the gateway (215, 225).

Abstract: A computer implemented method for prefetching data related to an application executed by a node of a High-Performance Computing system while said node is running an application. The prefetching is carried out based on a call-stack and corresponding Input/Output request predicted by using a graph.

Abstract: The invention relates to a method, implemented by a computer, of generating a source code that is read by a master data management application. The method includes converting a master data set into a formatted data set according to a set of conversion rules, and transcribing, according to a set of transcription rules, the formatted data set into the source code that is read by the master data management application.

Abstract: The disclosure refers to method for converting an input quantum circuit comprising gates into an output quantum circuit compliant with execution constraints, comprising: determining if a front layer comprises single-qubit gates, and updating the front layer; reiterating the determining step as long as the front layer comprises single-qubit gates; identifying in the front layer a quantum gate that does not satisfy execution constraints; determining a pattern such that the gate satisfies the execution constraints when applying the adjoint pattern to the gate; adding the pattern to the output quantum circuit, and applying the a joint pattern to the gate; and reiterating these steps until each quantum gate in the input quantum circuit satisfies the execution constraints; wherein each pattern is determined in such a way that a number of CNOT-gates comprised by at least one pattern is minimized.

Abstract: The invention relates to a computer implemented method for designing a firmware including writing the firmware version, and providing the firmware version with a version data identifying the firmware version. The method also includes providing the firmware version with a second data, called rollback data, the second data provided to be compared to the version data of other versions of the firmware, and authorizing, and indicating a limit for, older firmware versions to which the firmware may be downgraded. The invention further relates to a firmware obtained by such a method and a method for modifying the version of a firmware installed on a platform and designed by such a method.

Abstract: Method for controlling data quality assurance after a migration between a source repository, which includes source data associated with a source data structure, and a target repository, which includes target data associated with a target data structure, according to migration rules. The target data is organized as a set of elements. The method includes simulating the migration by applying migration rules to source data so as to output simulated data according to the target data structure, where the simulated data is organized as a set of elements. The method includes merging the simulated data and the target data by excluding identical elements, to form an input vector for a machine learning algorithm. The method includes applying the machine learning algorithm for pairing elements of the input vector according to a similarity score and determining a discrepancies indicator according to the similarity score for each element of the input vector.

Abstract: The invention relates to a data management system including a storing unit and a processing unit. The storing unit includes a dataset memory that stores at least one dataset; a metadata memory that stores, for each dataset stored in the dataset memory, respective metadata; and an annotation memory that stores at least one predetermined annotation value. The processing unit, upon storing of an additional dataset in the dataset memory, determines whether the additional dataset includes dataset annotations descriptive of the data comprised in said additional dataset; performs a mapping of each dataset annotation onto the at least one predetermined annotation value; and writes, in the metadata memory, in relation to the additional dataset, metadata representative of a result of the mapping.

Abstract: The invention relates to a method for automatically evaluating a candidate using a set of questions implemented by an automatic evaluation system, including a control module, a database, a user interface and a language model module. The method includes a first phase being iterative and includes, at each iteration, selecting a question, sending the selected question to the user interface, receiving a candidate's answer, requesting the language model module for an accuracy score reflecting the accuracy of the candidate's answer relatively to a model answer, and receiving the requested accuracy score. The iterative first phase is carried out until an accuracy score has been received. The method also includes a second phase that includes computing an evaluation score of the candidate using the received accuracy scores.

Abstract: A method for anomaly detection within a dataset X of N data points is implemented on a quantum annealing device including a plurality M of qubits, with M?N. A cost function to be minimized is defined as: q ? ( x , ? ) = - ? ? ? i = 0 N - 1 d i ? x i ± ( 1 - ? ) ? ? i , j = 0 , i ? j N - 1 d i , j ? x i ? x j where di is a distance between a point xi?X and a centroid of the dataset distribution, di,j is a distance between two data points xi, xj?X with i?j, ?? is a weighting parameter, and xi, xj={0, 1}. If a qubit can interact with a maximum determined number of different qubits, applying the cost function q(x, ?) to the plurality of qubits comprises limiting a number of quadratic terms for each variable xi to a value k smaller than or equal to the maximum determined number of interactions between qubits within the quantum annealing device.