39results about How to "Shrink state space" patented technology

The invention relates to a parallelization security hole detecting method based on a function call graph, which is characterized in that a function set to be detected is determined by analyzing the function call relation in a C language module, instrumentation and assert analysis are performed for the function set by means of the preprocessing technology, and then security holes of a program are detected by the aid of model checking and the parallelization technology. The method mainly includes the steps: generating the function relation call graph, and determining C function information to be detected by analyzing the function relation call graph; extracting attribute information of a buffer area related to C program source codes by the aid of the constraint analysis technology, and inserting corresponding ASSERT statement information in a variable declaration, an assignment and a function call point by means of the attribute information of the buffer area; and performing accessibility judgment for the instrumented codes, and analyzing whether a dangerous point in the program includes an accessible path to discover the security holes in the source codes or not. The method detects the security holes such as buffer area overflow and the like by combining the constraint analysis static detecting technology, model checking and the parallelization technology, and the detecting precision of the method is higher than that of the general static detecting technology.

The invention discloses a multi-stage dynamic vehicle routing optimization method for fresh agricultural products in different regions, which comprises the following steps of: data obtaining; regionaldivision; time division; design of a freshness attenuation function and establishment of a mathematical model of minimum total distribution cost; algorithm design of a mathematical model for minimumtotal distribution cost; solution of a mathematical model of minimum total distribution cost. The invention effectively improves the distribution efficiency and reduces the total distribution cost, and has high practical significance.

The invention belongs to the technical field of unmanned driving, and discloses an intelligent unmanned vehicle quantitative evaluation system. The intelligent unmanned vehicle quantitative evaluationsystem comprises a program detecting module, an electric equipment detecting module, a speed detecting module, a fault detecting module, a power consumption detecting module, a data processing module, a cloud service module, a quantitative evaluation module, a display module and a recorder module. Due to the cloud service module, the data analysis processing speed can be greatly increased, and the quantitative evaluation efficiency can be improved; meanwhile, due to the quantitative evaluation module, unmanned vehicles can be quantitatively evaluated more scientifically and accurately, the improvement direction can be found, rapid development for the unmanned vehicle technology is promoted, and therefore it is ensured that the unmanned vehicle can be safely driven under the real traffic environment.

The present invention belongs to the technical field of geometric modeling, and discloses a method and a system for constructing an interpolation curve or a curved surface based on a B-spline. The system comprises: a function deployment module, a telescopic translation module, a curve generation module, a central processing module, a curve smoothing module, a curve fitting module, a data storage module, and a display module. According to the technical scheme of the present invention, by using the curve smoothing module, a smoothing operation is performed on the curve in the image, the unsmoothcurve segment in the image can be effectively smoothed, and the curve after being subjected to the smoothing operation has substantially no defect with respect to the original curve, does not deviatemuch from the actual curve, and can adjust the degree of smoothness of the curve by adjusting the interval size by itself; and at the same time, by using the curve fitting module, the mapping reconstruction of the rotary part along the direction of the rotation axis can be realized, the data processing process can be simplified in a facilitated manner, and the consumption of computer resources can be reduced.

A method for model checking path reduction based on interpolation comprises: reading a C program, performing grammatical and semantic analysis on the C program, and extracting CFG from an abstract syntax tree; adding safety (S) interpolation and error (E) interpolation to the CFG and extending the CFG; in a process of generating ARG according to the CFG, determining, in each state, whether the safety interpolation and the error interpolation are implied by current path formula. The method improves the verification efficiency by computing the S interpolation and the E interpolation, which makes the algorithm of the model checking a better use in large-scale programs. The S interpolation can be used to avoid the unnecessary traversal, greatly reducing the number of ARG state. The E interpolation can be used to quickly determine whether there is a true counterexample in the program, accelerating the program's verification and improving the efficiency.

The invention comprises a core algorithm to use language regularity in large collections of human created textual documents, as well as optimization techniques to make the algorithm tractable. The core algorithm includes receiving tuples of text units that may be grammatically linked and processing a stream of such tuples to discover language regularities. After this learning is completed, the algorithm's output is used to evaluate the perceived likelihood that different interpretations of novel sentences would have been intended by a speaker of the language.

The invention relates to a multi-Agent stalking-foraging behavior control method comprising the following steps: 1) dividing a state space formed by multiple agents and the current position of prey; 2) designing a reward function; 3) performing reinforced learning according to the state space divided in the step 1) and the reward function in the step 2), controlling the Agents to perform corresponding atomic actions to stalk the prey, and stopping when a stalking success condition is satisfied so as to achieve a foraging effect. Compared with the prior art, the method has high stalking efficiency.

The invention discloses a temporal dynamic push-down network converting method used for describing real-time concurrent recursive modeling including recursive and dynamic thread creation. The converting method includes the steps that a global clock for describing continuous time and real number clocks capable of describing global variables and stack character ages related to time are introduced in DPN, so that asynchronous communication is achieved based on shared memories, and a real-time concurrent system with dynamic thread creation is modeled; for a clock equivalence technology based on integer division, an optimization technology based on a clock key point is given, a clock interval is reduced, and therefore state space obtained after conversion is reduced. As temporal dynamic push-down networks are abstract models of one kind of real-time concurrent recursive programs, the models are converted into the dynamic push-down networks by the clock equivalence optimization technology based on the key point, in this way, it is detected that the models are errors or bugs in the corresponding concurrent recursive program by verifying whether execution of the dynamic push-down networks operates into an error state or not.

The invention belongs to the field of internet searching and discloses an internet people searching information integration analysis control method. According to the method, a webpage information collection module is utilized to integrate fragmentary information searched by a webpage searching module, classification is conducted by an information classification and extraction module, the searchinginformation is classified into identity information, account information and the like, and after the information is compared by an information comparison module, unknown information is stored into aninformation storage module or known information in the information storage module is read. By means of the method, internet searching information can be integrated, information can be stored into theinformation storage module for use later, and integration of scattered information on the internet is facilitated; moreover, searching is more efficient, and careless omission in manual searching canbe avoided.

The invention discloses a path planning method of an improved A* algorithm based on graph preprocessing. Due to problems of complexity of map modeling and the like, path-finding efficiency is greatly reduced (as shown in Figure 1) due to large calculation amount and high redundancy of a traditional A* algorithm, and a large amount of performance consumption is caused. Due to the limitation of neighborhood search in a grid map, the traditional A * algorithm cannot actually realize the optimal path in the global sense. In order to solve the problems, firstly, an improved Maklink graph method is used for decomposing a free space on a map into a plurality of convex polygon areas, then all the areas are coded into feature nodes, finally, an optimal area channel is solved based on the principle of an A * algorithm, and a globally optimal path solution is obtained in the channel. The problems that a traditional A * algorithm is low in neighborhood search efficiency, the planned path is not optimal and the like are solved, and compared with other common algorithms, the proposed algorithm has remarkable advantages in the aspects of planning speed, path length, stability, completeness and the like.

The invention discloses a self-adaptive heuristic global path planning method and system for a robot. The method comprises the following steps: traversing an input environment map to obtain an initial state space, and carrying out collision point detection to obtain sampling points; aiming at the obtained sampling points, carrying out reverse search by starting from a target point to generate a reverse search point set, connecting the sampling points into edges and sorting the edges, and then constructing an adaptive heuristic function by utilizing child nodes of the ordered edges and the reverse search point set; and performing cost optimization based on an adaptive heuristic function, extending an ordered edge queue from a starting point to generate a forward search tree, extending the forward search tree to a target point to obtain a planned path, and repeating the steps for multiple times to obtain a final planned path. According to the method, rapid and accurate path planning can be realized, a relatively shortest path can be planned, and the planning success rate and the effectiveness on a complex obstacle map are improved.

Teachings presented herein offer reduced computational complexity for symbol sequence estimation, and also provide for the generation of soft bit values representing the reliability of that estimation. A demodulator is configured to generate these soft bit values by identifying a candidate value for each symbol in the sequence which is more likely than at least one other in a defined set of candidate values. Based on the candidate value identified for each symbol, the demodulator forms a reduced set of candidate values for the symbol by selecting as many additional candidate values from the defined set as are needed to have complementary bit values for each bit value in that identified candidate value. The demodulator calculates soft bit values for the symbol sequence based on a sequence estimation process whose state space for each symbol is constrained to the corresponding reduced set.

The invention discloses a static conversion method for a time multi-stack push-down network. Firstly, to describe a concurrent recursive mechanism in a real-time system and interaction between threads, a clock is introduced on the basis of MPDN; a TMPDN model is provided; grammars and operational semantics of the TMPDN model are given; and secondly, the continuous-time TMPDN model is converted into a discrete MPDN model through the static conversion method by utilizing a clock domain equivalent optimization technology. According to the invention, description of the real-time performance and the concurrency of a real-time concurrent system can be realized simultaneously; and guarantee can be provided for formal verification of a real-time concurrent program.

Belonging to the technical field of materials, the invention discloses a preparation method of inorganic and organic coated rutile titanium dioxide. The preparation system includes: a temperature detection module, a timing module, an operation module, a central control module, a raw material weighing module, a grinding module, a calcination module, a crushing module and a coating module. The composite titanium dioxide prepared by the method provided by the invention simplifies the production process and saves production cost, and moreover, the composite titanium dioxide has uniform particle size distribution and superior performance. According to the invention, the coating module adopts orthosiliconic acid as the silicon source, employs low alkalinity sodium metaaluminate, or employs low alkalinity sodium metaaluminate and aluminum sulfate as the aluminum coating raw materials for compact silicon-aluminum coating of titanium dioxide, thus providing a new way for coating of titanium dioxide. The method provided by the invention has the characteristics of simple operation, low production process labor intensity and low cost, and is worth popularizing and applying.