in this work, one and two-dimensional lattices are studied theoretically by a statistical mechanical approach. the nearest and next-nearest neighbor interactions are both taken into account, and the approximate thermodynamic properties of the lattices are calculated. the results of our calculations show that: (1) even though the next-nearest neighbor interaction may have an insignificant effect...

Among the shortcomings of A* algorithm, for example, there are many search nodes in path planning, and calculation time is long. This article proposes a three-neighbor algorithm combined with artificial potential fields to optimize planning problem mobile robots. The integrates improves partial field address irregular obstacles forward direction. guides robot move quickly. method performs accur...

Any connected plane nearest neighbor graph has diameter Ω(n). This bound generalizes to Ω(n) in any dimension d. For any set of n points in the plane, we define the nearest neighbor graph by selecting a unique nearest neighbor for each point, and adding an edge between each point and its neighbor. This is a directed graph with outdegree one; thus it is a pseudo-forest. Each component of the pse...

Neighbor-joining is one of the most widely used methods for constructing evolutionary trees. This approach from phylogenetics is often employed in population genetics, where distance matrices obtained from allele frequencies are used to produce a representation of population relationships in the form of a tree. In phylogenetics, the utility of neighbor-joining derives partly from a result that ...

In recent years, the study of social networks and analysis these in various fields have grown significantly. One most widely used is issue link prediction, which has recently been very popular among researchers. A a network means communication between members network, can include friendships, cooperation, writing joint article or even membership common place such as company club. The main purpo...

Based on the fact that Faddeev’s algorithm can be easily mapped into the Systolic array for implementing. An FPGA implementation of Kalman Filter using Modified Faddeev [1] is proposed The Modified Faddeev uses Neighbor pivoting for triangularization substituting the Gaussian elimination.Gaussion elimination may cause the overflow of the datas, and Neighbor pivoting can guarantee the stability ...

In the original paper [1], there are two errors on page 5. The rules in algorithm not sufficient since we omitted one rule during publication. following should be added to paper. Rule 3: If P1 = (u, v) and P2 (x, y) maximal leaf-paths both with vertices T, where u x leaves T (v, ∈ E(G), remove (y′, then add y′ is non-leaf neighbor of y T. expression Algorithm 2 accurate. It modified as follows....