Applied Mechanics and Materials Vol. 686

Abstract: A fuzzy clustering analysis model based on the quotient space is proposed. Firstly, the conversion from coarse to fine granularity and the hierarchical structure are used to reduce the multidimensional samples. Secondly, the fuzzy compatibility relation matrix of the model is converted into fuzzy equivalence relation matrix. Finally, the diagram of clustering genealogy is generated according to the fuzzy equivalence relation matrix, which enables the dynamic selection of different thresholds to effectively solve the problem of cluster analysis of the samples with multi-dimensional attributes.

Abstract: Data link communication requires data communication process must have reliability, availability, confidentiality, availability, integrity, non-repudiation, controllability. This has a great effect to ensure the normal communication functions. In this paper the author on the basis of many years of work experience, first discussed the establishment of a risk assessment system data link, then focused on the problem of index weight assessment. To data communication security, this research article will provide some references.

Abstract: This paper study continuous wave radar data processing algorithm for low altitude detection, it is applied to continuous wave low altitude search radar data terminal, it can realize real-time correlation and track processing for the data of target echo and false alarm false alarm filtering, to get the real targets of track parameters. Finally, through the realization of FPGA, the experimental results achieve the precision of the system.

Abstract: The paper analyze and improve the SIFT optimized algorithm, and proposes an image matching method for SIFT algorithm based on quasi Euclidean distance and KD-tree. Experiments show that this algorithm has matching more points, high matching accuracy, no repeated points and higher advantage of matching efficiency based on keeping the basic characteristics of SIFT algorithm unchanged, and provides precise matching point to generate precise image stitching and other related fields of the follow-up product. At the same time, this method was applied to the layout optimization and achieved good results.

Abstract: This paper puts forward adaptive anti collision algorithm based on two fork tree decomposition. New search algorithm built on the basis of binary-tree algorithm, using the uniqueness of the label EPC, to estimate the distribution of label by slot allocation, the huge and complicated two fork tree is decomposed into several simple binary-tree by search the collision slots for binary-tree, so, it can simplifies the search process. The algorithm fully considers4 important performance parameters of the reader paging times, transmission delay, energy consumption and throughput label, the simulation results show that, the improved anti-collision algorithm is obviously improved performance than other two fork tree algorithm, it is more suitable for RFID anti-collision protocols.

Abstract: At present, the ballistic Target tracking has a higher demand in convergence rate and tracking precision of filter algorithm. In the paper, a filter algorithm was improved based on particle filter. The algorithm was carried out from the aspects such as particle degradation and particle diversity lack. A novel ballistic coefficient parameter model was built, and was expanded to the state vector for filtering. Finally, the improved algorithm was simulated by MATLAB software. The simulation results show that the algorithm can obtain better convergence speed and tracking precision.

Abstract: Minimum variance distortionless response (MVDR) beamformer is a better target detection method, which provided high-resolution and anti-interference abilities. But the nice features will be degraded significantly for a fast bearing-rate target. Because the eigenvalue of longtime integral correlation matrix will spread, the signal and interference are no longer clearly identified by the eigenvectors. A beam domain MVDR and motion compensation arithmetic is given in this paper. The motion effect can be compensated by tracking the signal bearing change using real time estimated beam domain covariance matrix. The detection ability of moving target can be improved.

Abstract: The use of TDR for a single test to analyze the state of communication lines is not accurate to fault location, It also can cause the confusion of fault type and other drawbacks. This paper proposes a analysis algorithm. It can comprehensive analysis TDR test circuit fault pattern and low-frequency circuit parameters of tested line, then it determines the type and position of faults. During a time period, It tests the circuit impedance with 5-element DC model, records the values of line impedance at different times. Combining Curves of the line impedance and TDR waveforms, It accurately determines fault type of the line through the TDR test and Position of fault. By the trying It can increase the accuracy of judging failure , reduce time of repairing.

Abstract: This paper introduces the general process of the search algorithm Structure through the knight problem. According to the characteristics of the problem, we detailed discuss the DFS(Depth First Search) algorithm and BFS(Breadth First Search) algorithm, and combine the two algorithms together to solve the knights coverage problem. This article has a good reference for the mixed-use scenarios which requires a variety of search algorithms.Algorithms is always the core of Computer programming modeling. Computer algorithm algorithms describes in detail how a computer will enter into the process of output required step by step, or, is a detailed description of the calculation process executing on a computer. The algorithm components include: the accuracy of algorithm, the specific steps of practical algorithm, the execution order of correct, fast and effective algorithm, there is no infinite loop, no matter how complex the algorithm is. The Following will analyze and study BFS, taking Knight Covering as examples.

Abstract: Replacement and substitution encryption are two basic types of encryption historically. The classical encryption algorithm has been compromised now, but they still can play special role for modern cryptology. For example, in digital image encryption system, substitution can disrupt the original order of the images and eliminate the correlation of image information which not only can realize security of images, but also can resist intentional attack and destruction of clipping and noise. And transposition transformation is introduced into the design of block ciphers. The substitution has the feature of high efficiency and resistance, which makes it meet the specific requirements of encryption. So substitution cypher can be applied to modern encryption system.