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

6 results about "Complex algorithm" patented technology

An algorithm is a procedure or formula for solving a problem. A complex algorithm is defined as an algorithm that embodies mathematical or logical methods and requires at least one thousand (1000) lines of the C/C tt programming language to implement.

Method and device for integrating measurements in a land vehicle navigation system

A method and device for integrating measurements in a land vehicle navigation system with an increased frequency of inertial sensor data readings differ from the prior art by virtue of an increase in the frequency of rough accuracy IMU measurements and the subsequent cascade processing thereof. Furthermore, the computational complexity of the algorithms in each cascade increases while the frequency of incoming data to be processed decreases: high-frequency IMU measurements are processed using simple algorithms, the processing results are transmitted to the next cascade with a decrease in data frequency, and in the next cascade, less frequent data are processed using more complex algorithms. As a result of this solution, algorithms for combining navigational measurements can be executed on cheaper and more widely available microprocessors having a lower clock frequency and a lower capacity for representing floating point numbers. By analyzing the mathematical principles of navigation algorithms, the claimed invention makes it possible to achieve a significant increase in the frequency of IMU measurements without impacting the frequency with which a navigation solution is updated and without increasing the required computing power. In addition, the claimed invention makes it possible to reduce the frequency of a navigation solution and the power of the computing device while maintaining the frequency of IMU measurements and a set accuracy of the navigation solution.
Owner:VEITSEL ANDREY VLADIMIROVICH +1

Heuristic teaching system construction method based on large language model and knowledge graph

The invention discloses a heuristic teaching system construction method based on a large language model and a knowledge graph, and the method comprises the steps: constructing a course knowledge graph covering course core knowledge points and a student knowledge state model under a cognitive heuristic closed-loop framework, carrying out the heuristic instruction fine tuning of a large language model, and carrying out the recognition of the knowledge graph. And a progressive problem chain generation mechanism composed of starting, exploration, verification, migration and reflection stages is designed. According to the method, a complete teaching closed loop covering'knowledge representation-problem generation-learning feedback-difficulty regulation and control-learning condition monitoring 'is formed, the illusion risk of large language model generation content can be reduced, the interactivity and individuation level of the system can be improved, deep understanding of students on abstract concepts and complex algorithms can be effectively promoted, and the teaching experience of the students can be improved. The method can be popularized and applied to multiple computer courses and other science and engineering teaching scenes, and provides technical support for large-scale personalized intelligent education.
Owner:BEIJING UNIV OF CHEM TECH

Multi-agent code generation method and system, storage medium and equipment

The invention discloses a multi-agent code generation method and system, a storage medium and equipment, and belongs to the field of automatic code generation, and the method comprises the steps that an initial agent generates an initial meta strategy through deep problem understanding, and constructs a meta experience pool and a candidate strategy pool; iterative optimization of the meta-strategy is realized through multi-agent cooperation, and a final meta-strategy is obtained; converting the final meta-strategy into an executable code and a test case, verifying the executable code and the test case, if verification succeeds, outputting a final code, and if verification fails, entering reflection; closed-loop optimization of the meta-strategy is realized through causal analysis, experience is updated to the meta-experience pool, and the strategy is updated to the candidate strategy pool. According to the method, a four-stage closed-loop evolution framework including meta-strategy initialization, meta-strategy evolution, meta-strategy implementation and meta-strategy causal reflection is constructed, the autonomous evolution ability of the strategy from the primary level to the advanced level is achieved, and the method is particularly suitable for automatic solving of complex algorithm problems and competition-level programming challenges.
Owner:UNIV OF ELECTRONICS SCI & TECH OF CHINA

A reverse reconstruction method to solve the FPGA control bit occupancy problem

This invention discloses a reverse engineering method to solve the problem of FPGA control bit occupancy, belonging to the field of hardware security. This method addresses the issue that control bit occupancy prevents the correct reconstruction of the corresponding logic function of logic units during reverse engineering. Compared to existing technologies, this method does not rely on complex algorithms or manual intervention, is applicable to various FPGA reverse engineering scenarios, and allows researchers to achieve efficient and accurate circuit function reconstruction under simple experimental conditions, thus providing effective support for FPGA bitstream file resource analysis and security assessment.
Owner:UNIV OF ELECTRONICS SCI & TECH OF CHINA

Modulation force generation method for double-roller cast rolling and rolling

The invention relates to the technical field of double-roller cast rolling and rolling, discloses a modulation force generation method for double-roller cast rolling and rolling, and aims to solve the problems that in the prior art, motion synchronization depends on complex control logic, errors are prone to being generated, and robustness is insufficient. The method is applied to a system comprising a roller system and a constraint, and the roller system is composed of a first roller body and a second roller body which are oppositely arranged; the overall movement of the roller system relative to the fixed reference is defined as first movement, and the relative movement between the two roller bodies is defined as second movement. The geometric inevitability coupling relation of the two types of motions is constructed by presetting a constraint structure: when any motion is actively controlled, the other motion is inevitably and passively generated under the action of constraint forcing. According to the coupling relation, synchronous deviation is eliminated from the structural level, motion synchronization can be achieved without a complex algorithm, the equipment structure is simplified, the control difficulty is reduced, the system robustness and synchronization precision are enhanced, roller body stress can be optimized, the process stability and the blank quality are improved, and the coupling relation is suitable for double-roller cast rolling and rolling scenes.
Owner:SHANDONG UNIV OF TECH

A method, apparatus, and storage medium for recursively parsing and executing functions

ActiveCN114594960BTotal factory controlCompiler constructionCall stackRecursive functions
The present invention discloses a method, apparatus, and storage medium for recursively parsing and executing functions. The method includes: defining an instruction set for function parsing; identifying recursive functions and non-recursive functions in ST structured text language and outputting an interpreted instruction sequence; obtaining a function instruction sequence by parsing the interpreted instruction sequence through a parser, where the function instruction sequence includes recursive function instructions and non-recursive function instructions; executing the recursive function instructions and non-recursive function instructions in the order of the function instruction sequence; wherein, when executing the recursive function instructions, a call stack of a frame stack type data structure is established based on the data frame of the recursive function instructions; and the processing functions of the recursive function instructions are sequentially called from the recursive function instruction set based on the order of the call stack for execution until the call stack is empty. The present invention makes up for the deficiency that the structured text language of the IEC61131-3 standard does not support recursive calls, improves the flexibility of the program, and meets the usage requirements of complex algorithms.
Owner:NR ELECTRIC CO LTD +1