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.

A method for determining a voltage based or current based state of charge (SOC) and state of health (SOH) of a battery system is provided. The method includes: providing a model of the battery system including an equivalent circuit having both low frequency and high frequency elements; establishing a plurality of functional relationships comprising relationship of the equivalent circuit with SOC; reducing at least part of the plurality of functional relationships into a set of time segmented recursive functional relationships, wherein a state at a first time t can be modeled by a functional presentation of a state at a second time t−Δt that occurred before the first time t; and computing a set of data points based upon the set of time segmented recursive functional relationships using a matrix for operation in matrix algebra.

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 automated method is described for searching through sets of software patches to select a recommended set for installation into any given system. Each patch is assigned a ranking based upon how thoroughly it has been tested. Patches that modify the same filesets are organized within a database into tree structures, with the newest patches closest to the tree's root. A recursive function examines all the patches in all the trees relevant to a given system and returns a set of patches recommended for installation.

The invention provides a method for evaluating the reliability of an electric force communication network, which comprises: based on a route track arithmetic, searching all paths between network topology source nodes and target nodes in a pre-established network topology, and defining the reliability degree of system network as union set of reliability degree of each path; defining the number of reliability expressions of recursive function calculation path set, and establishing a reliability expression array for the path set according to the number of the reliability expressions, wherein the path set is a collection of all paths, the recursive function is f(n)=f(n-1)*2+1, n is the number of path set. The reliability degree of the path set is calculated according to the reliability expression array and the reliability parameter of the pre-set network node. The reliability of an electric power communication net is estimated according to the reliability degree. Through the invention the reliability of the electric power communication net is effectively estimated.

In one embodiment, a receiver of the invention has a detector coupled to a digital processor. The detector is adapted to mix the received PSK signal with a local oscillator (LO) signal having a time-varying phase offset with respect to the carrier frequency of the PSK signal to produce a digital measure of the PSK signal. The digital processor is adapted to: (i) estimate a frequency offset between the carrier frequency of the PSK signal and the LO signal; (ii) remove from an angular component of the digital measure a component corresponding to the frequency offset to generate a frequency-offset-adjusted signal; (iii) for each time slot of the PSK signal, estimate the phase of a respective PSK constellation symbol based on an angular component of the frequency-offset-adjusted signal and an angular component of a recursive function; (iv) estimate a phase differential for a PSK-symbol transition based on two consecutive phase estimates; (v) map each estimated phase differential onto a phase increment corresponding to a symbol transition in the PSK constellation; and (vi) recover a data sequence encoded in the PSK signal based on the mapping results.

In one embodiment, a receiver of the invention has a detector coupled to a digital processor. The detector is adapted to mix the received PSK signal with a local oscillator (LO) signal having a time-varying phase offset with respect to the carrier frequency of the PSK signal to produce a digital measure of the PSK signal. The digital processor is adapted to: (i) estimate a frequency offset between the carrier frequency of the PSK signal and the LO signal; (ii) remove from an angular component of the digital measure a component corresponding to the frequency offset to generate a frequency-offset-adjusted signal; (iii) for each time slot of the PSK signal, estimate the phase of a respective PSK constellation symbol based on an angular component of the frequency-offset-adjusted signal and an angular component of a recursive function; (iv) estimate a phase differential for a PSK-symbol transition based on two consecutive phase estimates; (v) map each estimated phase differential onto a phase increment corresponding to a symbol transition in the PSK constellation; and (vi) recover a data sequence encoded in the PSK signal based on the mapping results.

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.

Feature values, which may be multi-dimensional, collected over successive time slices, are efficiently processed for use, for example, in known adaptive learning functions and event detection. A Markov chain in a recursive function to calculate imputed values for data points by use of a “nearest neighbor” matrix. Only data for the time slices currently required to perform computations must be stored. Earlier data need not be retained. A data selector, referred to herein for convenience as a window driver, selects successive cells of appropriate adjacent values in one or more dimensions to comprise an estimation set. The window driver effectively indexes tables of data to efficiently deliver input data to the matrix. In one form, feature inputs are divided into subgroups for parallel, pipelined processing.

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.

Method for analysing the frequency in real-time of a non-stationary signal and corresponding analysis circuit.According to the invention, the signal is sampled, it is digitised, it is broken up into sub-bands. In each sub-band, the signal is modelled by an auto-regressive filter the transfer function of which is of the form 1 / A(z). By an adaptive method that is recursive in time and in order, all the polynomials A(z) that have a degree between 1 and a maximum value are calculated. The order of the model is estimated and the polynomial that has this order is retained. The roots of this polynomial are calculated and the components are monitored. The frequency and the amplitude of the sinusoidal components of the signal are thus obtained.Application in aeronautics, electromagnetic, mechanics, seismic prospecting, zoology, etc.

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).

A monitoring system may include a display module, an input module, and a processing module. The display module may be operable to display a plurality of sub-windows. The input module may be operable to receive an input signal inputted by a user and generate a control signal according to the input signal. The processing module may be operable to receive the control signal to control any one of the sub-windows of the display module according to the control signal. When the coverage of any one of the sub-windows is modified by the user, the processing module will execute a first recursive function to detect whether the modified sub-window overlaps any one of the other sub-windows; if the modified sub-window overlaps any one of the other sub-windows, the processing module pushes the sub-window overlapping the modified sub-window to a residual space of the display module.

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.

The invention relates to a task decomposition method for a heterogeneous multi-robot system based on a recursive algorithm. Resources involved are formally represented, a triplet is used to formally represent tasks that a robot can accomplish, a task decomposition algorithm based on a recursive function is called, and a task execution flow is restored according to a stack call trace of a function.The defects that an existing task decomposition method has poor generality, robots mostly are heterogeneous robots, a set of tasks can not be obtained and different allocation schemes and execution sequences of sub tasks have a large economic benefit gap are overcome. The unified and shareable formal representation of system environment resources and tasks is carried out, the method has good adaptability, robots with different abilities can be expressed in the same representation, a heterogeneous robot system is supported, a recursive algorithm is employed, the traversal search can be carriedout for any possible decomposition method in a robot ability space, and all decomposition schemes can be obtained.

The invention relates to a non-recursive SC decoding partial sum determination method and device. The method is proposed for solving the defect that the existing recursive SC decoding algorithm is frequent in recursive function calling and high in space complexity. The non-recursive SC decoding partial sum determination method comprises the following steps: outputting partial sum of a M0 node corresponding to the formula as shown in description, wherein the M0 node represents a leaf node of a sub-tree taking the formula as shown in description as a root node, and ki is the maximum recursive depth of the likelihood ratio computation when estimating the formula as shown in description; executing the following operations for 2k-1 times so as to compute the partial sum of the node Mk: formulaas shown in description, wherein i is not less than 0 and less than 2k-1; upwardly computing along the rightmost side until the node as shown in description finally outputs the value of the formula asshown in description. The SC decoding algorithm is realized by using the non-recursive way, the calling frequency of the recursive function is reduced to zero, and the decoding rate is improved. Furthermore, the algorithm space complexity is reduced to O(N) by adopting the time-division multiplexing storage way for the likelihood ratio and the partial sum.

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 binary file analysis method, which relates to the technical field of embedded software development. The invention is used for solving the problem of complicated binary valueconversion of the existing equipment, and comprises the following steps of: obtaining an analysis rule description file, and calling a recursive function to construct a structural body tree structureaccording to the analysis rule description file; receiving a binary file, and converting the binary file into a plurality of binary structure bodies; and sequentially recursively calling the structurebody tree structure through the plurality of binary structure bodies to obtain an analysis text of the binary file. The invention further discloses a binary file analysis device, electronic equipmentand a computer storage medium. According to the method, a tree structure is constructed through a recursive calling method, and then the binary file is analyzed by taking the tree structure as an analysis rule of a recursive function.

The invention discloses a residual life prediction method of a cold standby system based on sampling, includes n components, wherein the lifetime of each component obeying the probability density function, according to the technical scheme, a set of sample size n component life performing sampling; calculating the lifetime of the k-out-of-n cold standby system according to the recursive function;obtaining a sample of k cold standby system lifetime; the difference being the residual life sample; if the sample size for generating the residual life of the cold standby system is N, steps 1 and 2being repeated N times, taking N samples of k cold standby system from n, the predicted value of the residual life after the time of the k-out-of-n cold standby system. The scheme solves the problem of predicting the residual life of the cold standby system when the probability density function of the component life is more complex. The calculation process is simple and the calculation efficiencyis very high, which can provide technical support for the operation of the cold standby system.

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.

A computer-implemented method of executing an instruction sequence with a recursive function call of a plurality of threads within a thread group in a Single-Instruction-Multiple-Threads (SIMT) system is provided. Each thread is provided with a function call counter (FCC), an active mask, an execution mask and a per-thread program counter (PTPC). The instruction sequence with the recursive function call is executed by the threads in the thread group according to a program counter (PC) indicating a target. Upon executing the recursive function call, for each thread, the active mask is set according to the PTPC and the target indicated by the PC, the FCC is determined when entering or returning from the recursive function call, the execution mask is determined according to the FCC and the active mask. It is determined whether an execution result of the recursive function call takes effects according to the execution mask.

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 relates to an equivalent time-domain model establishing method considering interaction of soil and fan system power. The equivalent time-domain model establishing method comprises the following steps of S1, standardizing the vibration impedance of the interaction of soil and fan basic power, and expressing into dynamic compliance; S2, utilizing a Chebyshev complex polynomial to fit the dynamic compliance, expressing into a recursive function type, establishing a recursive physical model for expressing the interaction of soil and fan basic power, and determining to-be-determined coefficients of springs and dampers in the recursive physical model; S3, establishing the equivalent time-domain model considering the interaction of soil and fan system power. The equivalent time-domain model establishing method has the advantages that when the response of a fan system considering the interaction of soil and basic power under the horizontal excitation is calculated, because the recursive physical model does not contain mass elements, the correction of inputted basic horizontal power load is not needed, and the model is more directly and conveniently applied in actual engineering; by utilizing the recursive property, a motion control equation of the fan system has regularity, and the solving procedure is well universal.

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.