In the process of addressing, when people use words to express indistinctly, they often draw simple sketches to assist expression, which helps people to form a simple spatial scene in the brain and correspond to the actual scene one by one, and finally locate and find the target address. How to establish an one-to-one mapping relationship between the spatial objects in the hand-drawn sketch and in the vector map is the key to the realization of map addressing and location, and this process is also the process of map matching. This paper aims to address difficult problems associated with the features of hand-drawn sketches and vector map matching in order to improve the use of all potential matching points designed for application in hand-drawn sketches and spatial relation matrix structures of vector maps. To accomplish this, we use the N-queen problem solving process and improve the tabu search algorithm. In the matching process under the constraint of a single spatial relationship, and the hierarchical matching process under the constraint of multiple spatial relations, this study verifies the quality of the spatial relationship and the feasibility and effectiveness of the matching method of hand-drawn sketches and vector maps using the improved tabu search algorithm.

No abstract

The determination of the relation between a number and a numerical interval is one of the core problems in the scientific calculation of privacy protection. The calculation of the relationship between two numbers and a numerical interval to protect privacy is also the basic problem of collaborative computing. It is widely used in data queries, location search and other fields. At present, most of the solutions are still fundamentally limited to the integer level, and there are few solutions at the real number level. To solve these problems, this paper first uses Bernoulli inequality generalization and a monotonic function property to extend the solution to the real number level and designs two new protocols based on the homomorphic encryption scheme, which can not only protect the data privacy of both parties involved in the calculation, but also extend the number domain to real numbers. In addition, this paper designs a solution to the confidential cooperative determination problem between real numbers by using the sign function and homomorphism multiplication. Theoretical analysis shows that the proposed solution is safe and efficient. Finally, some extension applications based on this protocol are given.

No abstract