60 results about "Recursive functions" patented technology

A system, method, and computer program product provide automated reconciliation of transactions. A transaction in a first list is reconciled with a combination of two or more transactions in a second list. A function, which may be implemented as a recursive function, successively searches for combinations of transactions in the second list in order to obtain a match for a transaction in the first list.

The use of a configuration-based execution model in conjunction with a content addressable memory (CAM) architecture provides a mechanism that enables performance of a number of computing concepts, including conditional execution, (e.g., If-Then statements and while loops), function calls and recursion. If-then and while loops are implemented by using a CAM feature that emits only complete operand sets from the CAM for processing; different seed operands are generated for different conditional evaluation results, and that seed operand is matched with computed data to for an if-then branch or upon exiting a while loop. As a result, downstream operators retrieve only completed operands. Function calls and recursion are handled by using a return tag as an operand along with function parameter data into the input tag space of a function. A recursive function is split into two halves, a pre-recursive half and a post-recursive half that executes after pre-recursive calls.

An Extensible Markup Language (XML) Application Server for storing, processing, communicating, and displaying dynamic semi-structured information. It comprises a declarative specification language, a transactional indexed XML data store, and an XML application server engine. An integrated architecture (a) provides for optimization, indexing, and backtracking search in a business logic layer, (b) provides for general-purpose programming idioms including recursive function definitions, iteration, and dynamic dispatch in data layer queries and updates, and (c) eliminates processing overhead and maintenance issues caused by transforming between relational, object-oriented, and semi-structured data paradigms.

The invention discloses a scanning radar angular super-resolution imaging method which comprises the following specific steps: defining an autocorrelation matrix and carrying out initialization, constructing a recursive function, finding an inverse matrix of the autocorrelation matrix, estimating azimuth parameters, calculating echo autocorrelation matrix, and judging whether iterate to a convergence state and outputting super-resolution results meeting the convergence state. According to the method in the invention, the autocorrelation matrix of azimuth signals is obtained by utilizing the convolution operation; the block tridiagonal features of the autocorrelation matrix is utilized and a divide-and-conquer algorithm, that is, the D&C algorithm, is adopted to realize quick inversion finding of the autocorrelation matrix; and finally, the weighted least square estimation is carried out on a target in an iteration manner. Compared with the prior art, the method can be suitable for relatively-low signal to noise ratio, and robust super-resolution imaging results can be obtained by utilizing single scanning data; and meanwhile, time complexity is greatly reduced, and the method is suitable for real-time signal processing.

The invention discloses a computer-based method and device for analyzing natural language syntactic structures. According to the method and device, the natural language syntactic structures are analyzed by building a matrix model and a linear model and constructing a recursive function through the mathematical thought of a composite function according to mathematical principles of subjects including the abstract algebra, the set theory, the combinatorial mathematics, the computability theory, the computational linguistics and the like and corresponding computer technologies; meanwhile, methods such as the mathematical induction are comprehensively applied to proving important conclusions. By means of the method and device, one set of brand new mathematic models are built for sentences of the natural language, and the thought is basically different from that of a conventional traditional method; the two overall plug-in methods including the single-side same-direction order preserving method and the single-side same-direction non-order-preserving method are creatively provided, and a parallel syntactic constituent generating and processing method of a set family is creatively applied; the rules of the mathematic subjects and the computer subjects are sufficiently used, and the method is high in accuracy and large in operation amount, and has certain technological difficulty.

The present invention is a method of eliminating loops from a computer program by receiving the program, graphing its function and control, identifying its entry point, and identifying groups of loops connected to its entry point. Stop if there are no such groups. Otherwise, selecting a group of loops. Then, identifying the selected group's entry point. If the selected group includes no group of loops having a different entry point then replacing it with a recursive or non-recursive function, reconfiguring each connection entering and exiting the selected group to preserve their functionality, and returning to the fifth step. Otherwise, identifying groups of loops in the selected group connected to, but having different entry points and returning to the loop selection step.

The present invention is a minimum cut set calculation system for calculating minimum cut sets of a fault tree with binary decision diagram (BDD), comprising: subtracting means for, from one of two sub-BDDs of an input BDD, removing redundant paths included in the other sub-BDD using a recursive function comprised of a recursive case and a base case, wherein said subtracting means comprises equivalence removing means for, when said two sub-BDDs are equivalent, outputting a terminal node 0 in said base case.

The invention relates to a non-recursive SC decoding likelihood ratio determining method and device, and aims at solving the defects that the number of times of calling a recursive function by the existing recursive SC decoding algorithm is too much, and the space complexity is relatively high. The non-recursive SC decoding likelihood ratio determining method provided by the invention comprises the following steps of sequentially computing f2, f4 to fN when (formula) is computed; and sequentially computing (formula) when (formula) is computed, wherein fj represents that a likelihood ratio of the jth layer is computed by using a formula f, and gj represents that the likelihood ratio of the jth layer is computed by using a formula g. The non-recursive SC decoding likelihood ratio determiningdevice comprises a first computing module and a second computing module, wherein the first computing module is used for sequentially computing f2, f4 to fN when i is equal to 1, namely (formula) needs to be computed; the second computing module is used for sequentially computing (formula) when i is not less than 2 and not greater than N, namely (formula) needs to be computed. According to the method and the device, an SC decoding algorithm is realized by adopting a non-recursive mode, the number of times of calling the recursive function is reduced to zero, and the coding rate is improved. Inaddition, by adopting a time division multiplexing storage mode for the likelihood ratio, the space complexity of the algorithm is reduced to 0(N).

The present invention provides a method and system for quantifying a bug preventability measure of a bug prediction technique. In accordance with a disclosed embodiment, the method may include applying a weighted recursive function, on an actual bug count of each version of an application, for computing a golden bug count of the each version. Further, the method shall include deriving a set of source code parameters of the application and applying a linear regression model, on the set of source code parameters of the each version of the application in order to calculate a predicted bug count for the each version. A bug deviation ratio, which shall be indicative the bug preventability measure, can be defined as a ratio of the weighted aggregated deviation and the weighted quadratic aggregation.

The invention discloses a parallel implementation method of a real-time Gaussian white noise hardware generator. By the parallel implementation method, the Gaussian white noise hardware generator can generate high-speed and parallel high-quality Gaussian white noise in real time, at high speed and in parallel. According to the parallel implementation method, first, through high-speed parallel FPGA (field programmable gate array) implementation of uniform white noise based on a cellular automata theory, a method for calculating N-th initial vectors required by parallel implementation as well as a recursive function relationship of a cellular automata parallel generation algorithm are given; then, a low-complexity approach method based on a Box_Muller algorithm is given, the Box_Muller algorithm is simplified into simple multiplication and addition and CORDIC operation, and during FPGA implementation, a small number of multipliers and a small quantity of logical resources are needed, so that in case of relatively low consumption of the FPGA resources, long-cycle, large-bandwidth and good-quality Gaussian white noise can be generated in real time and at high speed.

The invention discloses a method for generating a reality simulated ontology document, wherein, the ontology document establishes a description subexpression through a plurality of OWL language substructures; the plurality of OWL language substructures comprise class-related substructure sets, attribute-related substructure sets and limitation-related substructure sets. The method comprises the following steps: step 1, characteristic parameters of the ontology document required to be generated are inputted; step 2, classes are generated; step 2.1, the number of the generated classes, the number of Subclassof of the classes and the length of class expressions are determined according to the inputted characteristic parameters; step 2.2, the classes are generated by call of a recursive function f(depth)=GenerateOWLConcept(depth), wherein, depth is equal to length-1; step 3, attributes and individuals are generated according to the attribute number, the object attribute number, the data type attribute number, the sub-attribute correlation number and the individual number which are inputted. The analysis result obtained by the method is more persuasive; the analysis process is more formalized and controllable; the performance analysis of an inference machine is more comprehensive and effective.

An authentication apparatus transmits code and challenge to a target, receives a response, and authenticates the target based on the response. The target receives the code and the challenge, generates a password for comparison by executing n times of repetitive computation by a recurrence relation or a recursive function using the code as an initial input, executes password authentication using a pre-stored password and the password for comparison. If the password authentication has succeeded, the target reads out an authentication seed corresponding to the number n that is the number of times of execution of the repetitive computation with which the password for comparison that matches a password has been obtained, and generates the response using the read-out authentication seed and the challenge received from the authentication apparatus, and transmits the response.

The invention discloses a freight flight gate allocation method, device and equipment and a storage medium. The freight flight gate allocation method comprises the steps of determining input information of a recursive model according to freight flight information and gate information; according to the input information, the recursion model outputs the corresponding relation between the flights meeting the constraint condition and the gate positions with the recursion frequency equal to the number of the flights needing to be allocated with the gate positions as the end condition; and allocating flight gate positions according to the corresponding relationship. According to the technical scheme provided by the embodiment of the invention, the problem of airport gate position allocation canbe solved through a recursive function-based backtracking algorithm.