Advanced Materials Research
Vol. 545
Vol. 545
Advanced Materials Research
Vol. 544
Vol. 544
Advanced Materials Research
Vols. 542-543
Vols. 542-543
Advanced Materials Research
Vols. 538-541
Vols. 538-541
Advanced Materials Research
Vols. 535-537
Vols. 535-537
Advanced Materials Research
Vol. 534
Vol. 534
Advanced Materials Research
Vols. 532-533
Vols. 532-533
Advanced Materials Research
Vol. 531
Vol. 531
Advanced Materials Research
Vol. 530
Vol. 530
Advanced Materials Research
Vol. 529
Vol. 529
Advanced Materials Research
Vol. 528
Vol. 528
Advanced Materials Research
Vols. 524-527
Vols. 524-527
Advanced Materials Research
Vols. 518-523
Vols. 518-523
Advanced Materials Research Vols. 532-533
Paper Title Page
Abstract: In this paper, multiple blind watermark algorithm based on wavelet packet transform (WPT) and two-dimensional chaos image scramble is put forward. In the sub-images of WPT, multiple watermarks are embedded and distilled blindly. Meantime, the image contrast enhancement to hidden information before hand can improve its robustness effectively. In order to improve the security, two-dimensional chaos image scramble algorithm is designed. Experimental results show that the multiple blind watermark algorithm has good invisibleness, security and robustness to common image processing and noise attack.
1846
Abstract: Cellular mobile communication system divides the service area into several adjacent cells; each cell sets up a base station. In the traditional cellular representation, we always use regular hexagon to represent the cell. In the practical engineering applications and wireless network planning simulation systems, as the programming environment is complex and diverse, using the regular hexagon to represent the cellular network has limitation. This paper used Thiessen polygon and spatial analysis method to describe the cell service area with a polygon. This method intuitively displayed the relationship between the scope of service and its place with each other in space. For the Pre-construction and later optimization of wireless network planning it has a positive role.
1851
Abstract: The paper establishes the polynomial converge-nce of a new class of path-following methods for semide- finite linear complementarity problems (SDLCP) whos-se search directions belong to the class of directions introduced by Monteiro [7]. Namely, we show that the polynomial iteration complexity bounds of the well known algori-thm for linear programming, namely the short-step path-following algorithm of Kojima et al. and Monteiro and Alder, carry over to the context of SDLCP
1857
Abstract: The Sweden method of slices is used as the data model for slope stability analysis and a new searching method for slope stability analysis is presented. This method, named SAA_IAFSA in this paper uses the artificial fish-swarm algorithm based on simulated annealing algorithm to search the critical failure surface and minimum safety factor. This method can overcome the disadvantages of traditional optimization method such as easy to fall into local extreme points with high accuracy, applicability, and can get a more accurate global optimal solution. Finally, the feasibility and effectiveness of the new approach is verified by practical problem. The experimental results show that the proposed algorithm is significantly superior to original AFSA, with wide application.
1861
Abstract: This A new path planning algorithm of agro-machinery based on the virtual ridges is proposed in this paper. A virtual ridge is determined by the width of a real ridge and the operating width of the agro-machinery to make the agro-machinery operate effectively. First, the algorithm divides a rectangular plot into some basic units, and makes a complete and exclusive path plan in the basic unit. Then, the path planning algorithm in the basic unit is extended to the entire rectangular plot. The algorithm is proved to be effective in path planning and convenient for the agro-machinery headland turning.
1867
Abstract: In the paper, a novel and simple color face segmentation algorithm using multi-features is presented. The regions are completely segmented in the basis of the edge image which is derived from the difference between the dilated image and the eroded image. The candidate face regions are selected by the skin-color and twice shape features, and make the selected regions convex using the convex hull of the set composed by the discrete points in the region. The true face regions are determined by the Euler number of the convex regions finally. The results show that the algorithm is very simple and fast, it is robust to the expression, pose and illumination.
1872