This paper proposes a scan-matching simultaneous localisation and mapping (SLAM)-based Iterative Closest Point algorithm using laser scan information and images in an indoor environment. The ICP algorithm, which is one of the scan-matching methods calculates the closest position iteratively by adjusting the motion vector and rotation matrix of the model. The matching process requires a great de...

Audio event detection has become a hot research due to its wide applications in many fields, such as multimedia retrieval etc., the detection needs large amounts of labeled samples to train the audio event models, but in real life, the labeled samples are expensive to obtain, the shortage of such labeled samples is a big obstacle. Active learning is an efficient way to deal with the problem of ...

Lattice-based cryptography has recently emerged as a prime candidate for efficient and secure post-quantum cryptography. The two main hard problems underlying its security are the shortest vector problem (SVP) and the closest vector problem (CVP). Various algorithms have been studied for solving these problems, and for SVP, lattice sieving currently dominates in terms of the asymptotic time com...

In this paper, we propose a post-quantum public-key encryption scheme whose security depends on a problem arising from a multivariate non-linear indeterminate equation. The security of lattice cryptosystems, which are considered to be the most promising candidate for a post-quantum cryptosystem, is based on the shortest vector problem or the closest vector problem in the discrete linear solutio...

The environment of ski resorts is usually complex and changeable, there are few characteristic objects in the background, which creates many difficulties for registration ski-resort point cloud datasets. However, traditional iterative closest (ICP) algorithm, two points need to have good initial positions, otherwise it easy get caught up local optimizations registration. Aiming at this problem,...

This paper deals with the replica placement problem on fully homogeneous tree networks known as the Replica Placement optimization problem. The client requests are known beforehand, while the number and location of the servers are to be determined. We investigate the latter problem using the Closest access policy when adding QoS and bandwidth constraints. We propose an optimal algorithm in two ...