A fast recursive algorithm has been developed to solve for the scattering solution of a large 2-D inhomogeneous body for TM waves. The inhomogeneous body is first divided into N subscattereres. The algorithm uses an a...
详细信息
A fast recursive algorithm has been developed to solve for the scattering solution of a large 2-D inhomogeneous body for TM waves. The inhomogeneous body is first divided into N subscattereres. The algorithm uses an aggregate TBAR matrix and translation formulas to solve for the solution of n + 1 subscatterers from the solution for n subscatterers. The computational complexity of the algorithm is of O(NMP2), where NM is the number of unknowns and P is the number of harmonies required in the translation formulas. The memory requirement is proportional to the number of unknowns. The algorithm has been used to solve for the scattering solution of a 10-lambda-diameter two-dimensional scatter with about 12,000 unknowns, taking about 30 s on a CRAY-2 supercomputer.
Presents an effective recursive algorithm for computing multiplicative inverses in GF(2m), where m=2k, employing normal bases. The proposed algorithm requires m-1 cyclic shifts and two multiplications in GF (2m) and i...
详细信息
Presents an effective recursive algorithm for computing multiplicative inverses in GF(2m), where m=2k, employing normal bases. The proposed algorithm requires m-1 cyclic shifts and two multiplications in GF (2m) and in each subfield of GF(2m): GF(2m/2), GF(2m/4),. . ., GF (28) and GF(24)
The two-dimensional (2-D) maximum Tsallis entropy method often gets ideal segmentation results, because it not only takes advantage of the spatial neighbor information with using the 2-D histogram of the image, but al...
详细信息
The two-dimensional (2-D) maximum Tsallis entropy method often gets ideal segmentation results, because it not only takes advantage of the spatial neighbor information with using the 2-D histogram of the image, but also has some flexibility with a parameter. However, its time-consuming computation is often an obstacle in real time application systems. In this paper, a fast image thresholding method based on chaos optimization and recursive algorithm for 2-D Tsallis entropy is presented. Firstly, improve the traditional chaos optimization algorithm(COA) so that it can get global solution with lower computation load, then propose a recursive algorithm with the stored matrix variables, finally combine the improved COA and the recursive algorithm to reduce much computational cost in the process of solving the 2-D maximum Tsallis entropy problem. Experimental results show the proposed approach can get better segmentation performance and has much faster speed.
In this paper a constraint shortest common supersequence problem, i.e. the string including constraint shortest common supersequence problem was considered. Shortest common supersequence is known as classical problem ...
详细信息
In this paper a constraint shortest common supersequence problem, i.e. the string including constraint shortest common supersequence problem was considered. Shortest common supersequence is known as classical problem in the area of strings and it is classified as NP-hard problem. For two input DNA sequences X and Y of length m and n respectively and the constraint DNA sequence P of length r, and the problem was to compute the shortest common supersequence of string X and Y including P as substring and the length of SCS must be minimum. Chen and Chao (J Comb Optim 21: 383-392, 2011) proposed the same problem but with constraint as longest common subsequence and its solution in 2011. A recursive procedure for STR-IC-SCS problem was proposed.
Existing representative research achievement of attribute reduction mainly focused on two aspects. One is how to improve the efficiency of attribute reduction algorithms for all attributes including the added properti...
详细信息
Existing representative research achievement of attribute reduction mainly focused on two aspects. One is how to improve the efficiency of attribute reduction algorithms for all attributes including the added properties. Such as the recursive algorithm to change conjunctive normal form into disjunctive normal form based on the Boolean matrix and algorithm based on radix sorting for computing core and reductions of a given information system, etc. On the other hand focus on objects recursive algorithms. The drawback is that these methods have not fully use knowledge gained when some attributes was added to a discussion on domain. Therefore, in this paper, the regularity of core and reduction's changes under adding new attributes into a given information system were discussed. Moreover, the new incremental recursive reduction algorithms from an information system were proposed based on Granular computing. Experiments show that these algorithms can quickly and exactly calculate new core and reduction of new information system by taking advantage of knowledge of previous information system.
A recursive algorithm to calculate inbreeding coefficients was modified to account for nonzero inbreeding of unknown parents. The modification was done by changing one part of a recursive formula in which the inbreedi...
详细信息
A recursive algorithm to calculate inbreeding coefficients was modified to account for nonzero inbreeding of unknown parents. The modification was done by changing one part of a recursive formula in which the inbreeding of an animal with at least one unknown parent is not zero and replacing it by the mean inbreeding of all animals born the same year. The algorithm is iterative. Testing involved 17 million US Holsteins. Convergence was reached in 6 rounds. The computing time per round was 4 min, twice as fast as the VanRaden algorithm based on the tabular method. The recursive algorithm is very simple;however, it requires that the recursion takes into account the order of animals. After a simple modification, the algorithm provides a very good approximation of inbreeding when the pedigree is unordered.
Background: A recursive algorithm to calculate the fifteen detailed coefficients of identity is introduced. Previous recursive procedures based on the generalized coefficients of kinship provided the detailed coeffici...
详细信息
Background: A recursive algorithm to calculate the fifteen detailed coefficients of identity is introduced. Previous recursive procedures based on the generalized coefficients of kinship provided the detailed coefficients of identity under the assumption that the two individuals were not an ancestor of each other. Findings: By using gametic relationships to include three, four or two pairs of gametes, we can obtain these coefficients for any pair of individuals. We have developed a novel linear transformation that allows for the calculation of pairwise detailed identity coefficients for any pedigree given the gametic relationships. We illustrate the procedure using the well-known pedigree of Julio and Mencha, which contains 20 Jicaque Indians of Honduras, to calculate their detailed coefficients. Conclusions: The proposed algorithm can be used to calculate the detailed identity coefficients of two or more individuals with any pedigree relationship.
A new method for establishing the equations of motion of multibody mechanisms based on canonical momenta is introduced in this paper. In absence of constraints, the proposed forward dynamics formulation results in a H...
详细信息
A new method for establishing the equations of motion of multibody mechanisms based on canonical momenta is introduced in this paper. In absence of constraints, the proposed forward dynamics formulation results in a Hamiltonian set of 2n first order ODEs in the generalized coordinates q and the canonical momenta p. These Hamiltonian equations are derived from a recursive Newton Euler formulation. As an example, it is shown how, in the case of a serial structure with rotational joints, an O(n) formulation is obtained. The amount of arithmetical operations is considerably less than acceleration based O(n) formulations.
The paper proposes a new recursive approach for the analysis of singular system using Taylor series. Firstly, theoretical foundation of the recursive algorithm using both first and second orders Taylor series has been...
详细信息
ISBN:
(纸本)9781479917693
The paper proposes a new recursive approach for the analysis of singular system using Taylor series. Firstly, theoretical foundation of the recursive algorithm using both first and second orders Taylor series has been established in a lucid manner. Numerical examples have been treated along with relevant tables and curves in support of effectiveness of the method. Further, mean integral square error (MISE) has been estimated for both first and second order Taylor series approaches and found to be within tolerable limits. Thus, the method proves to be attractive and efficient as well.
Multi-dimension linked lists is a new data structure,which has powerful function and well visiting performance. It can be applied in scientific computing analysis,image processing,database index and so on. With the de...
详细信息
ISBN:
(纸本)9787811240559
Multi-dimension linked lists is a new data structure,which has powerful function and well visiting performance. It can be applied in scientific computing analysis,image processing,database index and so on. With the development of computer science, multi-dimension linked lists may be applied in other rectangular coordinate system's spatial expression and multi-dimension linked lists recursive algorithm will give us very large significance. By the research of multi-dimension linked lists in this paper, it would be given out of the mathematical model and recursive algorithm of multi-dimension linked lists.
暂无评论