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: One basic requirement of image registration is the high precision of point matching. In this paper, we present a simple and robust method to get more accurate matching points by using the structural information of divided triangles. The method initially construct triangles using Delaunay Triangulation which considering rough matched points as vertices, and then iteratively removes outliers until obtain the consensus topology structure. An algorithm called K-Nearest Neighbor Dis-ratio is also presented to avoiding mismatches. Compared with RANSAC and GTM, Our proposed method acquires more inliers and demonstrates higher matching accuracy.
726
Abstract: In this paper we propose a numerical method based on the splitting strategy to solve the Cheeger cut model. In order to improve the classification results, we propose a new self-tuning strategy to choose a robust scaling parameter. Some numerical examples are arranged to illustrate the efficiency of our proposed method.
730
Abstract: This article improves the algorithm of term weighting in automated text classification. The traditional TFIDF algorithm is a common method that is used to measure term weighting in text classification.However, the algorithm does not take the distribution of terms in inter-class. In order to solve the problem, variance which describes the distribution of terms in inter-class and intra-class is used to revise TFIDF algorithm. This article mainly researched about the construction of LFHW term sets and new approaches to term weighting, These new approaches are also applied to the hierarchical classification system.Compared with traditional TFIDF algorithm ,the results of simulation experiment have demonstrated that the improved TFIDF algorithm can get better classification results.
735
Abstract: In this paper, by applying the fountain theorems, we study the existence of infinitely many high energy solutions for the nonlinear kirchhoff nonlocal equations under the Ambrosetti-Rabinowitz type growth conditions or no Ambrosetti-Rabinowitz type growth conditions, infinitely many high energy solutions are obtained.
739
Abstract: In this paper, we consider the density estimation problem from independent and identically distributed (i.i.d.) biased observations. We study the lower bound of convergence rates of density estimation over Sobolev spaces WrN(NN+) under the Lp risk by using Fanos lemma.
744
Abstract: On the basis of fluid-structure-interaction of the liquefaction soil, pipeline and the conveying fluid, in this paper, the differential vibration equations of the buried pipeline are deduced. The differential quadrature method (DQM) was tried to use to analyze the natural frequency of buried pipeline in liquefaction soil under the effect of flow velocity, fluid density, pressure in pipe, viscosity of pipe, axial force, elastic coefficient of the soil. Some preliminary conclusions concerning with the natural frequency of buried pipeline are also obtained. The theoretical research of the seismic effect on the pipeline in the liquefaction soil is presented.
749
Abstract: Roundness error evaluation software is developed based on two-dimensional circle fitting with least-squares method based on nonlinear optimization with constraints. The local derivative-free optimization algorithms of NLopt can solve nonlinear constraint problems by combining with augmented Lagrangian algorithm. The fitting precision and convergence time of each algorithm are analyzed by calculating the fitting results with same test data to find its advantages and disadvantages. It is shown that each algorithm has different behaviors from others on performance and stability. This work provides a good basis for choosing the appropriate algorithm for roundness error evaluation.
755
Abstract: This paper reviews two major models (Small Displacement Torsor, Deviation and Clearance Domain) for 3D functional tolerance analysis and compares them. The underlying mathematical representation of geometric tolerances can be classified as inequalities and multi-variate region. The corresponding algebraic or geometric tolerance propagation mechanism of each model is briefly introduced for worst-case and statistical tolerancing. Through a comprehensive comparison of these models, this paper gives some suggestions for choosing the appropriate method for a given tolerancing problem.
759
Abstract: Due to existing indoor intelligent lighting system lack of the movement path predictionand the boundary of the space detection,thispaperpresents an idea to predict the location and distinguish the boundary of the space based on the historical data of someone's motion path; Indoor positioningisappliedtointelligent lighting system, according to the existing indoor localization algorithm, combined with the historical data of motion path, design an suitable algorithm for indoor intelligent lighting system, which can predict location and distinguish the boundary of the space.
763
Abstract: The LZW is an effective and adaptive data compression algorithm, but during the encoding process, the entries in the dictionary would store characters that have been stored leading to waste memory resources, so this paper presents a improved algorithm for LZW compression algorithm. On the one hand, the content of the source file is transformed into 01 character string; on the other hand, adopting binary tree structure to store the entries of the dictionary. There are some simulation experiments for different sizes files, the results show that the improved LZW algorithm overcomes effectively the shortcoming in dictionary storage structure of the original algorithm.
768