Patents
Literature
Patsnap Eureka AI that helps you search prior art, draft patents, and assess FTO risks, powered by patent and scientific literature data.

5 results about "Iteration loop" patented technology

For example, in a computer program, one form of iteration is a loop. A loop repeats code until a certain condition is met. Each time the computer runs through a loop, it is referred to as an iteration. Many computer programs and programming languages use iterations to perform specific tasks, solve problems, and present solutions.

Method of detecting OTFS SCMA signals and receiver implementing the method

A method of detecting superimposed SCMA signals from multiple user equipment in a receiver of an OTFS communication system includes initializing an executing an iteration loop, in which a mean of all a posteriori estimates of the transmitted signal determined so far is calculated, which a posteriori estimates are based on the OTFS-demodulated received signal, the corresponding channel matrix, and the mean vectors and variances determined for each UE. The mean of all a posteriori estimates determined so far is used for determining vectors and variances for each UE, further using the probabilities of the non-zero elements of the respective UEs codebooks. The iteration is repeated until a termination criterion is met.
Owner:CONTINENTAL AUTOMOTIVE TECHNOLOGIES GMBH +1

Soft clustering and dynamic constraint based edge computing task offloading method and system

ActiveCN122111689BPareto rankingEdge computing
The application discloses an edge computing task offloading method and system based on soft clustering and dynamic constraints, and relates to the technical field of edge computing. The method comprises the following steps: clustering robots, constructing a membership matrix, and mapping the cluster center back to the individual decision space of the robot; an evolutionary iteration cycle is performed, in which, during the cycle, a dynamic constraint relaxation factor is determined according to the real-time proportion of feasible solutions, the dynamic constraint relaxation factor is set to 0 for safety level constraints and deadline constraints, a constraint violation degree vector is calculated for the candidate solution, and the candidate solution is screened according to the feasibility boundary box; the candidate solution is Pareto sorted; a safety level index is calculated, and when a preset safety threshold is met, a Pareto optimal solution set is extracted; and a task offloading scheme represented by the Pareto optimal solution set is executed. The application solves the problem that the traditional method is completely ineffective when the feasible solution density is less than 10 ‑15 , ensures 100% safety compliance rate, improves search efficiency, and solves the dimension disaster problem.
Owner:XIAN UNIV OF POSTS & TELECOMM

Sampling method and apparatus for responding to side-channel attacks

The present invention relates to a sampling apparatus and method robust against side-channel attacks, the method comprising the steps of: (a) receiving a random bit; (b) setting an iteration loop index i to 0 and determining whether the random bit is greater than or equal to NRCDT[i]; (c) if the random bit is greater than or equal to NRCDT[i], an adjustment value in an i-th iteration loop is set to 1, and if the random bit is smaller than NRCDT[i], the adjustment value in the iteration loop is set to 0; (d) updating a random integer by subtracting the adjustment value from 18; and (e) repeating steps (b) to (d) while increasing i by 1 until i reaches 17, thereby obtaining a finally updated random integer, wherein NRCDT[i] has a value obtained by bit-inverting RCDT[i] of a base sampler.
Owner:INDUSTRY UNIVERSITY COOPERATION FOUNDATION HANYANG UNIVERSITY

Soft clustering and dynamic constraint based edge computing task offloading method and system

The application discloses an edge computing task offloading method and system based on soft clustering and dynamic constraints, and relates to the technical field of edge computing. The method comprises the following steps: clustering robots, constructing a membership matrix, and mapping the cluster center back to the individual decision space of the robot; an evolutionary iteration cycle is performed, in which, during the cycle, a dynamic constraint relaxation factor is determined according to the real-time proportion of feasible solutions, the dynamic constraint relaxation factor is set to 0 for safety level constraints and deadline constraints, a constraint violation degree vector is calculated for the candidate solution, and the candidate solution is screened according to the feasibility boundary box; the candidate solution is Pareto sorted; a safety level index is calculated, and when a preset safety threshold is met, a Pareto optimal solution set is extracted; and a task offloading scheme represented by the Pareto optimal solution set is executed. The application solves the problem that the traditional method is completely ineffective when the feasible solution density is less than 10 ‑15 , ensures 100% safety compliance rate, improves search efficiency, and solves the dimension disaster problem.
Owner:XIAN UNIV OF POSTS & TELECOMM

A method for generating causal consistency test cases based on graph reasoning and execution feedback

This invention belongs to the field of artificial intelligence and software engineering technology, specifically disclosing a method for generating causal consistency test cases based on graph reasoning and execution feedback. The method includes: constructing a code knowledge graph; parsing natural language problem reports to obtain structured information; performing a hybrid search on the code knowledge graph to obtain a list of candidate code nodes related to the natural language problem report; starting with high-scoring nodes in the candidate code node list, performing graph exploration on the code knowledge graph to obtain a complete context code set; based on the structured information and the complete context code set, executing an iterative loop of "planning-generation-execution-critique" to obtain "causally correct" failed test cases; generating candidate code patches to repair the target code; and applying the failed test cases to the repaired code for testing. This invention solves the problems of semantic gaps and understanding difficulties, context focusing and localization difficulties, and causal reproduction difficulties in existing technologies.
Owner:BEIJING UNIV OF POSTS & TELECOMM +1