Abstract: Three-phase asynchronous motor, comprising a housing and a stator assembly, which is fixedly arranged in the housing and is wound with coil, and further comprising a rotating shaft and a plurality of rotor punches, the shape and size of some of the rotor punches are the same, the rotor punches are sleeved and fixed on the rotating shaft, and located in holes of the stator assembly, a plurality of rotor slots are opened on the rotor punches, and shape and size of the all the rotor slots are the same. The rotor slot comprises a first, a second and a third slot portion. The first and the third slot portion are respectively located at both ends of the second slot portion. The first s and the third slot portion are semicircular; the second slot portion is in the shape of an isosceles trapezoid. The application discloses a speed-regulated water pump.

Abstract: A matching algorithm and device for data with different scales based on global road network features are provided. The method includes: loading data of different maps, constructing crossroad groups in each map, and extracting information on attributes of the crossroad groups; allocating, according to the importance degree of the attribute information, weights for each attribute of the crossroad groups, and comprehensively evaluating confidence values of matching between two crossroad groups in different maps; and constructing, according to the confidence values, matched road networks, calculating total confidence values of the matched road networks, and selecting a road network with the highest total confidence value as an optimal matching solution, namely a matching result.

Abstract: The embodiments of the application provide an underground garage parking space extraction method and system for high-definition map making.

Abstract: A matching algorithm and device for data with different scales based on global road network features are provided. The method includes: loading data of different maps, constructing crossroad groups in each map, and extracting information on attributes of the crossroad groups; allocating, according to the importance degree of the attribute information, weights for each attribute of the crossroad groups, and comprehensively evaluating confidence values of matching between two crossroad groups in different maps; and constructing, according to the confidence values, matched road networks, calculating total confidence values of the matched road networks, and selecting a road network with the highest total confidence value as an optimal matching solution, namely a matching result.