An Adaptive Parallel Arithmetic Optimization Algorithm for Robot Path Planning

Path planning is one of the hotspots in the research of automotive engineering. Aiming at the issue of robot path planning with the goal of finding a collision-free optimal motion path in an environment with barriers, this study proposes an adaptive parallel arithmetic optimization algorithm (APAOA) with a novel parallel communication strategy. Comparisons with other popular algorithms on 18 benchmark functions are committed. Experimental results show that the proposed algorithm performs better in terms of solution accuracy and convergence speed, and the proposed strategy can prevent the algorithm from falling into a local optimal solution. Finally, we apply APAOA to solve the problem of robot path planning.

Implementing parallel arithmetic via acetylation and its application to chemical image processing

Chemical mixtures can be leveraged to store large amounts of data in a highly compact form and have the potential for massive scalability owing to the use of large-scale molecular libraries. With the parallelism that comes from having many species available, chemical-based memory can also provide the physical substrate for computation with increased throughput. Here, we represent non-binary matrices in chemical solutions and perform multiple matrix multiplications and additions, in parallel, using chemical reactions. As a case study, we demonstrate image processing, in which small greyscale images are encoded in chemical mixtures and kernel-based convolutions are performed using phenol acetylation reactions. In these experiments, we use the measured concentrations of reaction products (phenyl acetates) to reconstruct the output image. In addition, we establish the chemical criteria required to realize chemical image processing and validate reaction-based multiplication. Most importantly, this work shows that fundamental arithmetic operations can be reliably carried out with chemical reactions. Our approach could serve as a basis for developing more advanced chemical computing architectures.

Efficient implementation for QUAD stream cipher with GPUs

QUAD stream cipher uses multivariate polynomial systems. It has provable security based on the computational hardness assumption. More specifically, the security of QUAD depends on hardness of solving non-linear multivariate systems over a finite field, and it is known as an NP-complete problem. However, QUAD is slower than other stream ciphers, and an efficient implementation, which has a reduced computational cost, is required. In this paper, we propose an efficient implementation of computing multivariate polynomial systems for multivariate cryptography on GPU and evaluate efficiency of the proposal. GPU is considered to be a commodity parallel arithmetic unit. Moreover, we give an evaluation of our proposal. Our proposal parallelizes an algorithm of multivariate cryptography, and makes it efficient by optimizing the algorithm with GPU.

The Improvement of Newton Method and the Validation of Optimization Idea of Blind Walking Repeatedly

The existence of maximum point, oddity point and saddle point often leads to computation failure. The optimization idea is based on the reality that the optimum towards the local minimum related the initial point. After getting several optimal results with different initial point, the best result is taken as the final optimal result. The arithmetic improvement of multi-dimension Newton method is improved. The improvement is important for the optimization method with grads convergence rule or searching direction constructed by grads. A computational example with a saddle point, maximum point and oddity point is studied by multi-dimension Newton method, damped Newton method and Newton direction method. The importance of the idea of blind walking repeatedly is testified. Owing to the parallel arithmetic of modernistic optimization method, it does not need to study optimization problem with seriate feasible domain by modernistic optimization method.