Advanced Materials Research
Vol. 773
Vol. 773
Advanced Materials Research
Vol. 772
Vol. 772
Advanced Materials Research
Vol. 771
Vol. 771
Advanced Materials Research
Vol. 770
Vol. 770
Advanced Materials Research
Vol. 769
Vol. 769
Advanced Materials Research
Vol. 768
Vol. 768
Advanced Materials Research
Vols. 765-767
Vols. 765-767
Advanced Materials Research
Vol. 764
Vol. 764
Advanced Materials Research
Vol. 763
Vol. 763
Advanced Materials Research
Vols. 760-762
Vols. 760-762
Advanced Materials Research
Vols. 756-759
Vols. 756-759
Advanced Materials Research
Vols. 753-755
Vols. 753-755
Advanced Materials Research
Vols. 750-752
Vols. 750-752
Advanced Materials Research Vols. 765-767
Paper Title Page
Abstract: For DTM extraction of road linear project from LiDAR data, this paper proposes a robust ground filtering algorithm. Firstly, a pyramidal hierarchical structure of ground candidate points is formed. Secondly, in each level, the Thin Plate Spline (TPS) surface interpolation is iteratively used to produces smooth surfaces, and based on the points residuals from the surface the ground candidate points are inspected. The experiments show that this method correctly determines DTM even in those cases of heavy vegetation, and achieve a better result for the road.
639
Abstract: We considered the regularization method for a kind of complete singular integral equation with Hilbert kernel on open arcs lying in a period strip. And based on this, we obtained the solvable Noether theorem for this kind of complete singular integral equations.
643
Abstract: In Cognitive Radio Network (CRN), where Primary User (PU) and multiple Secondary Users (SUs) wish to communicate with their corresponding receivers simultaneously over fading channels, spectrum utilization and efficient resource allocation are both significant points for CRN. Interference between PU and SUs should be eliminated in order to realize spectrum sharing. Multi-user resource allocation with the target of maximizing the spectral efficiency of SUs and satisfying the proportional rate constraint between SUs are proposed under the conditions of total SU interference constraint. An adaptive low-complexity suboptimal algorithm for subcarrier and power joint allocation is presented based on Rate Adaptive (RA) criterion, where adaptive subcarrier allocation is performed by assuming equal power distribution, while each subcarrier is assigned in accordance with subcarrier efficiency function. Moreover, linear water-filling algorithm for power allocation is applied within each subcarrier. Simulation results indicate that, with the proposed adaptive subcarrier allocation, spectral efficiency of multiple SUs is superior to traditional subcarrier power joint allocation algorithm. Low computational complexity and adaptive features make it available for implementation.
647
Abstract: The key impact indicators of battlefield damage equipment repair order are transformed into one-dimensional projection values with the method of projection pursuit. The repair order of battlefield damage equipment is got and weights of all key performance indicators are clear. The example is applied to explain application effect of this method. The experiment shows that the method is easy to decision-making, strong objectivity, applicability and operability, has great significance to enhance the combat effectiveness of troops.
653
Abstract: To overcome the limitation of precocity and stagnation in classical ant colony algorithm, this article presents a Parallel Ant System Based on OpenMP. The ant colony is divided into three children ant colonies according to the characteristics of natural ant colony multi-group and pheromone updating features of ant colony algorithm. By Open Multi-Processing parallel programming idea, the parallel and cooperating optimization of children ant colonies was obtained. It organically combines local search and global search, makes full use of computing power of multi-core CPU, and improves the efficiency significantly. Contrastive experiments show that the algorithm has a better capability of global optimization than traditional ant colony algorithm.
658
Abstract: This paper focuses on improving the efficiency of the genetic algorithm, analysis the shortages of the algorithm at coding method and mutation operator and selected a TSP problem to simulate. First of all, the initial population was taken by order coding to speed up the algorithm convergence. In addition, the inversion operation and migration operation had been added into the mutation process. The experimental results show that without sacrificing convergence speed and the scale of population the improved algorithm has an extraordinary increase on optimal solutions and efficiency.
662
Abstract: This paper is concerned with Jordan canonical form theorem of algebraic formulae giving all the solutions of the matrix equation Xm= A where n is a positive integer greater than 2 and A is a 2 × 2 matrix with real or complex elements. If A is a 2 × 2 non-singular matrix, the equation Xm = A has infinitely many solutions and we obtain explicit formulae giving all the solutions. If A is a 2 × 2 singular matrix, and we obtained necessary and sufficient condition of square root . This leads to very simple formulae for all the solutions when A is either a singular matrix or a non-singular matrix with two coincident eigenvalues. We also determine the precise number of solutions in various cases.
667
Abstract: Fuzzy C-means (FCM) clustering algorithm is one of the widely applied algorithms in non-supervision of pattern recognition. However, FCM algorithm in the iterative process requires a lot of calculations, especially when feature vectors has high-dimensional, Use clustering algorithm to sub-heap, not only inefficient, but also may lead to "the curse of dimensionality." For the problem, This paper analyzes the fuzzy C-means clustering algorithm in high dimensional feature of the process, the problem of cluster center is an np-hard problem, In order to improve the effectiveness and Real-time of fuzzy C-means clustering algorithm in high dimensional feature analysis, Combination of landmark isometric (L-ISOMAP) algorithm, Proposed improved algorithm FCM-LI. Preliminary analysis of the samples, Use clustering results and the correlation of sample data, using landmark isometric (L-ISOMAP) algorithm to reduce the dimension, further analysis on the basis, obtained the final results. Finally, experimental results show that the effectiveness and Real-time of FCM-LI algorithm in high dimensional feature analysis.
670
Abstract: According to case description, it offers a formal representation as to the elements such as battlefield barriers and obviating units entity through the establishment of obviating system package. Dynamic modeling mechanism based on UML for building cooperating operational model and obviating operational model is formed to achieve the operational use cases of each battle behavior entity. Analysis is also made on the operation activities at obviating course and suffering sneak attack through the erection of corresponding obviating activity diagram. This model implements interaction relation and message delivering, and reflects inside logic in obviating operation mission, entity, function, interaction and activity.
674
Abstract: Generalized emfactor is an important sort of matrix, if we can ulteriorly study its characters and application, there will optimize the procedure of finding its answer. So the relevant properties discussed more and more.
678