DeltaPatents B.V

Some embodiments are directed to controlling task execution in a hyperscaler. An estimated future success metric for a task may be compared to a minimum acceptable success threshold and in response to determining that the likelihood of successful completion is below the minimum acceptable success threshold, the task is be queued for deferred execution, or otherwise passed to a scheduling mechanism of the hyperscaler for execution.

A surgical robotic system for intraocular procedures is provided. The system comprises a surgical arm having a movable arm part, wherein the movable arm part comprises an end effector configured to hold a surgical instrument, the surgical instrument comprising a needle 121 for subretinal injection of a substance below a retinal surface 220. The system further comprises an actuator subsystem configured to actuate the movable arm part and a processor subsystem configured to control the actuator subsystem to control a longitudinal positioning of the surgical instrument during the intraocular procedure. The processor subsystem is configured to control the actuator subsystem to perform at least part of a subretinal injection procedure by indenting the retinal surface 220 with a tip 122 of the needle 121 and, from the indented state of the retinal surface 220, performing a piercing movement by advancing the needle 121 longitudinally to penetrate the retinal surface 220 and reach a target depth 123 below the retinal surface 220. A corresponding computer-implemented method for controlling such a surgical robotic system is also provided.

Some embodiments are directed scheduling maintenance in a computer system. This may include calculating for future time frame, a risk factor indicative of a likelihood of violation of one or more predefined system performance requirements, the risk factor being based on a predicted quantitative compliance metric and on an estimated impact of the proposed maintenance activity.

Some embodiments are directed to a computer-implemented, cryptographic method (600) for computing a blind rotation modulo. The method includes obtaining a target polynomial to be rotated, partitioning (620) a sequence of integers into values zero modulo an integer µ, and values non-zero modulo µ, processing the blind rotation for a part of the partition corresponding to the values non-zero modulo µ, splitting (640) the target polynomial into multiple part polynomials having monomials with exponents zero modulo the integer µ, and exponents non-zero modulo µ, processing (650) the blind rotation for parts of the partition corresponding to the values zero modulo µ, wherein the processing iteratively updates the multiple part polynomials, skipping the part polynomials corresponding to monomials having exponents in non-zero equivalency classes.

Methods and devices are provided for unidirectional transfer of data from a sender device to a receiver device. At the sender device, respective parts of the data are encoded to generate respective 2D barcodes, and the 2D barcodes are sequentially displayed on a display. At the receiver device, an image sensor is used to capture the sequentially displayed 2D barcodes to obtain a received version of the transmitted data. Values of information density parameters, which determine a data transfer rate of the unidirectional transfer of the data to the receiver device, are selected based on an estimate of a capability of the receiver device to successfully capture and decode the 2D barcodes generated using the one or more selected parameters. The selected parameters are used to generate and display the 2D barcodes.

Some embodiments are directed to processing of technical operational message processing in a computing platform. The method may include comparing a received technical operational messages to sets of representative technical operational messages using Retrieval Augmented Generation (RAG), and classifying a received technical operational message with the cluster associated with a matching set of representative technical operational messages, thus obtaining a sequence of cluster classifications corresponding to the received technical operational messages.

A homomorphic processing unit (HPU) 200 may accelerate homomorphic processing operations governed by a homomorphic encryption scheme. The HPU may access encrypted operands from memory, wherein an encrypted operand represents an encryption of unencrypted data by the homomorphic encryption scheme, wherein the encrypted operand is represented by a set of ciphertext words. The HPU may include a controller 205 to access instructions for operations to be performed on encrypted operands and convert them into micro-instructions for operations to be performed on ciphertext words. The HPU may further comprise a register memory 209 and multiple execution units that may be invoked in parallel by executing micro-instructions. The execution units may include a load/store unit 207 for transferring ciphertext words, an arithmetic logic unit 210 for performing arithmetic operations, and at least one ciphertext transformation unit 211, 212 configured to modify ciphertext words in compliance with the homomorphic encryption scheme.

Some embodiments are directed to a light modulator having a first substrate and a second substrate, the first and second substrates being arranged with inner sides opposite to each other, at least one electrode being applied to the inner side of the first substrate, an optical layer between the first and second substrates. The optical layer contains a fluid ink comprising pigment particles and a structuring agent, wherein the pigment particles are electrically charged or chargeable. Upon application of an electric potential, to generate an electric field in the optical layer providing electrophoretic or dielectrophoretic movement of the pigment particles causing modulation of optical properties of the light modulator. The structuring agent limits the diffusion of the pigment particles in the ink in at least part of the optical layer and at least when the optical layer is in a particular optical state.

Some embodiments are directed to a cryptographic method that includes - obtaining (310) a first plaintext encrypted according to a main encryption, and a second plaintext encrypted according to a further auxiliary encryption, the first plaintext and the second plaintext being encrypted according to the same key (sk), and - applying (320) a further external product to the first plaintext encrypted according to the main encryption and to the second plaintext encrypted according to the further auxiliary encryption to obtain an encryption of the product of a morphism applied to the first plaintext and of the second plaintext according to the same key (sk).

The present disclosure provides techniques and solutions for determining the completeness of a collection of datatype instances. Completeness can reflect the degree to which instances include values for instance properties. A first collection of instances is received, each including one or more instance types and stored as one or more data types in a data structure. The instance types define properties of the instances, and some instances lack values for certain properties while having values for others. A first completeness metric for a first instance type is determined by analyzing the presence or absence of property values and comparing unfilled properties to a defined set. If the first completeness metric does not meet a threshold, actions are taken, such as adjusting a computing process to access a second collection of instances or receiving values for missing properties.