Location-based services (LBS) have become an integral part of daily life and work for the general public. However, achieving widespread and accurate positioning in typical indoor environments remains a significant challenge, particularly in multi-floor indoor parking lots where radio frequency signals like WiFi are often unavailable. Indoor magnetic matching presents a viable solution, but it requires reducing mapping costs through the use of crowdsourced data. To tackle this issue, we propose an innovative method for constructing magnetic maps using crowdsourced vehicle data. Our approach introduces a multi-user joint vehicle dead reckoning technique based on graph optimization, which provides consistent directional estimates of crowdsourced vehicle trajectories. Subsequently, we establish associations between different vehicle trajectories using multi-attribute features of the magnetic field. Building on this foundation, we propose a global trajectory optimization with inequality and equality constraints to achieve precise estimation of crowdsourced vehicle trajectories. Testing with simulated data from two three-floor underground parking lots demonstrates that the proposed method, utilizing only on-board smartphone sensor data, achieves plane and elevation errors of less than 2.75 meters (95%) and 0.59 meters (95%), respectively. Additionally, the magnetic matching positioning error based on crowdsourced magnetic sequence maps is less than 2.29 meters (95%).

Population-based evolutionary algorithms usually manage a large number of individuals to maintain the diversity of the search, which is complex and time-consuming. In this paper, we propose an evolutionary algorithm using only two individuals, called master-apprentice evolutionary algorithm (MAE), for solving the flexible job shop scheduling problem (FJSP). To ensure the diversity and the quality of the evolution, MAE integrates a tabu search procedure, a recombination operator based on path relinking using a novel distance definition, and an effective individual updating strategy, taking into account the multiple complex constraints of FJSP. Experiments on 313 widely-used public instances show that MAE improves the previous best known results for 47 instances and matches the best known results on all except 3 of the remaining instances while consuming the same computational time as current state-of-the-art metaheuristics. MAE additionally establishes solution quality records for 10 hard instances whose previous best values were established by a well-known industrial solver and a state-of-the-art exact method.

The extraction of patent subject words is the principal task in the patent analysis. In this paper, we apply the technology of information mining to the patent literature, and propose a new method for the automatic extraction of patent subject words. According to the characteristics of patent theme, a method which combined the reverse combinational words and Mutual Information is adopted to extract the candidate words, and then the candidate words are filtered, finally according to the number of lexical units, the frequency and the position in the title, it puts forward a computing method of the theme degree and treats the biggest value as the subject word. The extraction method is tested on the patent data set in the domain of new energy automobile, and the precision rate is 85.65%, the recall rate is 82.4%. Experimental results show that it has a better effect, and has positive significance for the patent mining, the analysis and prediction of the patent technology.