19 results about "Deterministic function" patented technology

A method for execution by a storage network begins by receiving a data object for storage, segmenting the data according to a data segmenting protocol to generate a set of data segments and executing a deterministic function on the set of data segments to generate scoring information for respective data segments of the set of data segments. The method continues by comparing the scoring information for a respective data segment to scoring information for previously stored data segments in the storage network and based on the comparison, facilitating storage of a first portion of the set of data segments and not storing a second portion of the set of data segments.

A pipeline for data ingestion to a database comprises an index-generating component based on a deterministic function, and a comparison component adapted to determine if an index generated by said index-generating component already exists in said database.

A method and apparatus implemented by a computer for storing data corresponding to secret data represented by a plurality of shares are disclosed, each of the plurality of shares having a first number of bits. A plurality of random keys are generated, each random key having a second number of bits less than the first number of bits, and the plurality of random keys being one less than the plurality of shares. For each random key, the generated random key is used as a seed value for a deterministic function that outputs corresponding intermediate data having the first number of bits. A plurality of modulo addition operations are performed to generate working data corresponding to either a modulo addition of the values of the shares having the first number of bits and a modulo addition or inverse modulo addition of the values of the intermediate data corresponding to each of the random keys. Next, the working data and the plurality of random keys are stored. In this way, the data corresponding to the secret data is stored in a compressed format as compared to storing the plurality of shares representing the secret data.

A method for analyzing uncertainty in a multi-scale interpretation of a medical image includes inputting the medical image into a trained segmentation network. The method includes outputting via the trained segmentation network a segmentation output mask for each pixel of the medical image or a region of interest of the medical image. The method includes utilizing a deterministic function to aggregate segmentation output masks for all pixels of the medical image or the region of interest and to output a first classification prediction of the aggregated segmentation output masks. The method includes inputting the medical image into a trained classification network. The method includes outputting a second classification prediction of the medical image or the region of interest. The method includes determining an uncertainty between the first classification prediction and the second classification prediction via comparison of the first classification prediction to the second classification prediction.

The invention provides a power distribution network single-phase high-resistance grounding fault detection method based on full phasor measurement, and the method comprises the steps: deducing a deterministic function relation among phase voltage, phase current and unbalanced current through line state space analysis, and constructing a monitoring quantity calculation method which is approximately equal to fault current; according to the present invention, the coefficient is solved based on the measurement data during the fault-free operation of the system, and the current monitoring amount is calculated by using the solved coefficient, such that the fault detection and the line selection are achieved, the method is suitable for the point-to-point direct supply special line, the early detection capability of the high resistance grounding fault is significantly improved, and the new technical means is provided for ensuring the important load power supply reliability.

A method of model checking a PLC algorithm inscribed in a graphical programming language and a method for automatic test case generation and model-based testing of the PLC implementing these PLC algorithms are provided. The model checking method includes converting the functional block diagram algorithm into a functionally-equivalent formalized functional block diagram algorithm. The method includes model checking the functionally-equivalent formalized functional block diagram algorithm. The verified PLC algorithm is a functional block diagram algorithm including discrete-time deterministic function blocks. The verified PLC algorithm can be then downloaded into a target PLC and periodically executed. The test case generation method includes predefined testable behaviors (unit tests) of each function block and combination of compatible unit tests to valid test cases according the assume-guarantee principle. The resulting test scenarios and test cases are used for model-based grey-box testing in MIL, SIL and HIL testing of the PLC implementing these PLC algorithms.

A method of testing a signature verification system including a computing device and a memory device, may include: generating a seed and a signature including first type codes and a leaf node index, wherein the first type codes include height information of a hash chain and height information of a Merkle tree; generating first intermediate values ​​of the hash chain, a first hash function seed, and first node values ​​of the Merkle tree using a deterministic function, based on the seed; generating a message; performing, by the computing device, a hash operation on the message; and generating a value of a first leaf node by performing hash chain operations, wherein the hash chain operations take the first intermediate values ​​and the first hash function seed as inputs.

There is disclosed a computer-implemented method and apparatus for storing data corresponding to secret data represented by a plurality of shares, each of the plurality of shares having a first number of bits. A plurality of random keys are generated, each random key having a second number of bits that is fewer than the first number of bits, wherein the plurality of random keys is one fewer than the plurality of shares. For each random key, the generated random key is used as a seed value for a deterministic function that outputs corresponding intermediate data having the first number of bits. A plurality of modulo addition operations are performed to generate working data having the first number of bits and corresponding to modulo addition of the values of the shares and either a modulo addition or an inverse modulo addition of the values of the intermediate data corresponding to each of the random keys. The working data and the plurality of random keys are then stored. In this way, data corresponding to the secret data is stored in a compressed format in comparison to storing the plurality of shares representing the secret data.

Methods and apparatus for identifying resources of a storage network for data retrieval. In an example method, a determination is made to retrieve a data from the storage network, the data having an associated asset identifier. The method further includes converting the asset identifier into a range identifier and performing a deterministic function (e.g., a hashing function) on the range identifier to produce a lookup value. The range identifier may include a smaller number of bits than the asset identifier in an example. The method further includes retrieving storage location information for the data based on the lookup value.

The invention discloses a method for testing a signature verification system, the signature verification system and a computing device. The signature verification system comprises the computing device and a memory device. The method may include: generating a seed and a signature including a first type code and a leaf node index, the first type code including height information of a hash chain and height information of a Merkel tree; generating a first intermediate value of a hash chain, a first hash function seed, and a first node value of a Merkel tree using a deterministic function based on the seed; generating a message; performing, by the computing device, a hash operation on the message; and generating a value of the first leaf node by performing a hash chain operation with the first intermediate value and the first hash function seed as inputs.

There is disclosed herein a computing apparatus having a hardware platform, including a processor circuit and a memory; a web-enabled application; and stored instructions within the memory to instruct the processor circuit to: determine that an input field of the web-enabled application has requested a password or personal data from a user; receive an input value; apply a deterministic function to the input value to create an obfuscated value; and provide the obfuscated value as an input to the input field.

A method and system for managing device association and access is disclosed. Some embodiments may include receiving, from a user device, a request to access a network device. The request may include a public key of the user device. The request may include a digital certificate, wherein the digital certificate may include the public key of the user device. A distributed database address of the user device may be determined by applying a deterministic function to the public key of the user device. A distributed database entry may include the address of the user device. A distributed database entry may be generated. The distributed database entry may include the address of the user device. Based on the address of the user device, access to the network device may be granted to the user device.

A computer implemented method for deriving a metric from a data resource. A data resource query is received from a user device and mapped to one or more data resources. Identifiers associated with mapped data resources are communicated to the user device. A mapping validation is received from the user device, representing a user validation of the mapping of data resources to the data resource query. A metric query is received from the user device and is similarly mapped to metrics with the mapping being validated by the user device. The validated mapped data resource and data defining how to compute the validated mapped metric are retrieved. A composite query including the metric definition data and the retrieved data resource and an instruction for an AI model to generate an instruction set for a deterministic function that applies the metric computation to the data resource are retrieved.

The invention relates to a method for operating a network (10) by means of an electronic computing device (12), the method comprising the following steps: providing a first deterministic communication connection (18) between a deterministic function unit (20) and a terminal device (14) of the electronic computing device (12); providing a third communication connection (22) between a radio access network (16) of the electronic computing device (12) and the terminal device (14) by means of the electronic computing device (12); providing a second deterministic communication connection (24) between the radio access network (16) and a deterministic network (26) by means of the electronic computing device (12); and transmitting a data packet from the deterministic function unit (20) to the deterministic network (26), or vice versa, by means of the electronic computing device (12). The invention also relates to a computer program product, to a computer-readable storage medium, and to an electronic computing device (12).

An apparatus receives a plurality of physical downlink control channels (PDCCHs), each corresponding to a physical downlink shared channel (PDSCH). Each PDCCH conveys a downlink control information (DCI) scheduling one PDSCH. Each PDSCH is associated with an actual redundancy version value of a set of redundancy version values. If the DCI omits the actual redundancy version value, the apparatus obtains the actual redundancy version value based on a predetermined deterministic function. If the DCI includes an indicated redundancy version value, the apparatus maps the indicated redundancy version value to the actual redundancy version value using a predetermined sequence. If the DCI includes a redundancy version pattern indicator value, the apparatus identifies one of at least two sequences of the actual redundancy version value based on the redundancy version pattern indicator value. The apparatus decodes a DCI from a soft combination of the PDCCH associated with the redundancy values.

The present application for a patent of invention relates to a deterministic consensus method for distributed computer networks, for application in the technical fields of information technology and computer networks. The present method aims to deterministically organize the network using the identifier of the previous block. When generating a new block, each participant individually calculates the organization of the network using the identifier of the last block and the identifiers of the participants, thereby determining the order in which the participants will act. The participants are grouped and selected as representatives through cryptographic values and deterministic functions, ensuring an ordered structure. The transactions are signed within each group, preserving the integrity and order of the data. The last signature of the final group is used to calculate the new block identifier, which reorganizes the network for the next cycle. The method ensures that any modification to the data results in a different block identifier, enabling the detection and correction of conflicting transactions.

A method of determining an indication of an intersection between a first dataset and a second dataset which hold data entries relating to respective real-world entities. A deterministic function is applied to the data entries of the first and second datasets to generate respective first and second location information. The data entries of the first and second datasets are encoded onto respective first and second binary structures by writing values at positions in the binary structures corresponding the respective location information. A comparison stage compares the binary structures to determine the indication of the intersection between the first dataset and second dataset.

The application discloses a kind of based on cryptography primitive generation perception pilot integrated sensing algorithm integration deterministic perception method and system, belong to 6G integrated sensing algorithm integration technical field.The application makes both sides of communication based on shared cryptography material and time-varying synchronization parameter, same perception pilot is independently generated by cryptography deterministic function, and multi-node zero signaling cooperative perception is realized.Synchronization parameter can use physical layer broadcast timing, the logical state of protocol security state machine output or unified anchor point time T_anchor;Wherein rule D directly uses T_anchor As state value, can generate various communication and perception parameters.The application provides three kinds of implementation paths: path A is compatible with 5G traditional architecture, path B introduces DSF and PSSM, path C uses LPC+PAN decoupling architecture, and introduces two layers of decoupling and centralized clock bias management, and physical layer uncertainty is transparent to node.Through two-step deterministic arbitration and downlink implicit authorization mechanism, multi-node resource conflict is solved in order.The application completely eliminates pilot signaling overhead, reduces external synchronization dependence, tolerates the inconsistency between nodes Physical parameters, applicable to ground network, non-ground network and hybrid networking scene, provides end-to-end deterministic guarantee for integrated sensing algorithm integration.

A method comprising: obtaining (102) a dataset consisting of respective unique identifiers of signaling instances present in a system at a first time; obtaining (104) a unique identifier of a peer of a peer-to-peer network; selecting (106) a first signaling instance among the signaling instances, by applying a deterministic function (F) to input data comprising the unique identifier and the dataset; establishing (108) a communication channel comprising a subchannel between a load balancer (L) and the peer and a subchannel between the load balancer (L) and the first signaling instance; obtaining (102) an updated dataset consisting of respective unique identifiers of signaling instances present in the system (1) at a second time; selecting (106) a second signaling instance among the signaling instances, by applying the deterministic function (F) to updated input data, wherein the updated input data comprises the unique identifier and the updated dataset; if the second signaling instance differs from the first signaling instance, updating (109) the communication channel by closing the subchannel between the load balancer (L) and the first signaling instance and opening a subchannel between the load balancer (L) and the second signaling instance.