To ensure the safety of coal mine drilling operation and reduce losses caused by accidents, this study proposes a fuzzy-reasoning-based early prediction method for in-hole accidents during underground coal mine drilling processes. First, the mechanism of in-hole accidents during underground drilling in coal mines was analyzed, and the changes in different accident-related parameters were summarized. Second, based on the suddenness of different accidents, they were distinguished into sudden-change and slow-change accidents, and the corresponding features were extracted from short- and long-timescale information, respectively. Subsequently, a rule base was constructed based on the analysis of field data and manual experience, and different accident occurrence probabilities were determined using fuzzy reasoning to realize the early prediction of in-hole accidents in the coal mine drilling process. Finally, WinCC was used to design the upper computer interface for in-hole accident prediction in underground drilling processes in coal mines. It displays the results of three types of in-hole accident prediction: drill bit failure, stuck pipe, and bit drop.

As music data storage becomes increasingly diverse in the era of big data, ensuring alignment of music works with the same semantics for online music education is crucial. To achieve this, a multi-modal music score alignment algorithm model based on deep learning was developed and optimized. Experimental results demonstrated that Note + DCO feature combination yielded the best MIDI input characteristics (mean value: 13.27 ms), whereas CQT feature comparison produced the best results for audio input (average: 12.85 ms). The ResNet-34 network was noted to have the most effective music score alignment effect with alignment errors averaging less than one frame. Compared with other algorithms, the proposed algorithm had the lowest average value of 9.28 ms, median value of 5.85 ms, and standard deviation of 20.17 ms. Actual music retrieval showed a Top-1 retrieval accuracy of 10.93% that was close to 11%. Overall, the proposed algorithm is significant for score alignment and music retrieval recognition in online music education.

This paper proposes a system for converting face photos into portraits with specific charcoal sketch-like style. NPR (non-photorealistic rendering) for converting real photo images into anime-style images have been studied. Its promising application is the creation of users’ portraits on social networks for preventing leaks of personal information. An image-to-image transformation using GAN (Generative Adversarial Network), such as CycleGAN or Pix2Pix, is expected to be used for this goal. However, it is difficult to generate portraits with specific comic styles that satisfy two conditions at the same time: preserving photorealistic features and reproducing the comic styles. For example, replacing too many photorealistic features on the face with comic style will destroy users’ identity, such as eyes shape. To solve this problem, the proposed system combines CycleGAN and Pix2Pix. CycleGAN is used to generate paired examples for Pix2Pix and Pix2Pix learns photo-to-comic transformation. To further emphasize a comic style, this paper also proposes two extensions, which divides face images into several parts such as hair and eye parts. The quality of generated images are evaluated with questionnaire by 50 answerers. The results show that the images generated by the proposed system are highly evaluated than the images generated by CycleGAN in terms of preserving the features in a photo and reproducing a comic style. Although the segmentation tend to collapse the generated images, it can reproduce a comic style effectively, especially on facial parts.

Electroencephalography (EEG) is a physiological signal directly generated by the central nervous system. Brain rhythm is closely related to a person’s emotional state and is widely used for EEG emotion recognition. In previous studies, the rhythm specificity between different brain channels was seldom explored. In this paper, the rhythm specificity of brain channels is studied to improve the accuracy of EEG emotion recognition. Variational mode decomposition is used to decompose rhythm signals and enhance features, and two kinds of information entropy, i.e., differential entropy (DE) and dispersion entropy (DispEn) are extracted. The rhythm being used to get the best result of single channel emotion recognition is selected as the representative rhythm, and the remove one method is employed to obtain rhythm information entropy feature. In the experiment, the DEAP database was used for EEG emotion recognition in valence-arousal space. The results showed that the best result of rhythm DE feature classification in the valence dimension is 77.04%, and the best result of rhythm DispEn feature classification in the arousal dimension is 79.25%.

In the field of art, color matching is widely used in various art designs, such as images, posters, clothing, and interior home design. Among them, harmonious color matching is the decisive factor in whether a design is popular or not. To solve the problem of estimating color harmony, this study analyzes from the perspective of color pairs and uses the two-layer maximum likelihood estimation method to make preliminary predictions of color harmony by statistically modeling paired color preferences in existing datasets. After obtaining the preliminary estimation of color harmony, multiple linear regression is selected for denoising processing. Subsequently, the preliminary prediction results were refined using a backpropagation neural network, extracting various color features in different color spaces, and ultimately obtaining accurate harmony estimates. The results indicate that, compared with existing methods, the proposed method can simulate the aesthetic cognition of different users towards different color themes. Under the same statistical method, the model can maintain good harmony estimation and experimental results. This method can promote the development of related research fields, such as quickly evaluating the color harmony of an image, and one click color changing in scenes such as clothing, home, 3D models, etc. according to different user needs.

Multi-criteria decision making process has been one of the fastest growing areas during the last decades depending on the change in the business sector. Multi-criteria decision making is the most important branch of operation research by which people make complex decision daily life. The major steps in the decision- making approach are selecting the most preferred alternative for the decision-maker, ranking alternatives in order of importance for selection problems, and screening alternatives for the final decision. Employees are an important element of a company that determines its progress. Conventional (manual) recruitment methods are vulnerable to non-technical factors, such as frequent duplication or invalid data. In this study, simple additive weighting and profile matching are proposed to solve the employee selection problem. This study was conducted at the (UPT) Career Development and Entrepreneurship Universitas Brawijaya Malang using data collected from written test selection in 2019. The effectiveness of both methods was analyzed using confusion matrix. The SAW method provides an accuracy rate of 94.7%, a precision rate of 87.5%, Recall rate of 91.3% and F-measure rate of 89.4%. On the other hand, profile matching method obtained the Accuracy rate of 90.4%, Precision rate of 81.4%, Recall rate of 81.4% and F-measure rate of 81.4%. Thus, it can be concluded that both methods have high accuracy values accompanied by high precision values when used for the selection process. This system can also effectively reduce the bias rate of the same data very well, as can be seen from the high recall and F-measure rates.

As artificial intelligence (AI) technology advances, its application in the field of psychology has witnessed significant advancements. In this paper, with the assistance of AI, 80 university students with depression and 80 university students with normal psychology were selected as the subjects. The facial expression feature data were extracted through OpenFace, and the action feature data were extracted based on a Kinect camera. Then, the convolutional neural network-long short-term memory (CNN-LSTM) and temporal convolutional neural network (TCN) approaches were designed for recognition. Finally, a weighted fusion recognition method was proposed. The results showed that compared with the support vector machine, back-propagation neural network, and other approaches, the CNN-LSTM and TCN methods showed better performance in the recognition of single feature data, and the accuracy reached 0.781 and 0.769, respectively. After weighted fusion, the accuracy reached the highest at 0.875. The results verify that the methods designed in this paper are effective in identifying depressive emotions through facial expressions and actions among university students and have the potential for practical application.

University-teaching quality evaluations are crucial for assessing teachers’ effectiveness and enhancing students’ learning in classrooms. To improve the evaluation efficiency, this study suggests a creative classroom evaluation approach by using machine vision and pentapartitioned neutrosophic cubic set (PNCS). First, this study uses machine vision technology to establish a PNCS to capture the students’ states in classrooms. Second, it proposes four entropy functions to determine the attribute weights. Third, it combines the improved entropy weight functions with the PNCS to evaluate the teaching effectiveness. This study’s practical price is to introduce big data theories into teaching evaluation fields. Last, an example is provided to confirm the efficacy and applicability of the evaluation approach suggested in this study.

In order to maximize the benefit of building supply chain, the topology optimization method of building digital supply chain based on genetic neural network is studied. According to the overall structural characteristics of the building digital supply chain, customer demand data, supplier sales data, manufacturer production management data, and environmental policy exception data are collected to form a building digital supply chain data set. As input data, a building digital supply chain demand prediction model based on improved genetic LSTM neural network is constructed. Capture the needs of the building digital supply chain; according to the demand of suppliers, manufacturers and customers in building digital supply chain, a nonlinear 0–1 mixed integer programming model based on the newsboy model is established. According to the various information provided by the supplier, the ant colony algorithm is used to calculate the optimal supplier. After all suppliers are identified, the topology of the digital supply chain is constructed. So far, the optimization of the supply chain has been completed. The experimental data show that this method can accurately predict the demand of construction projects, the maximum error is less than 1.5%, and can obtain the best supplier selection results. Compared with before optimization, the profit of the structural digital supply chain after topology optimization increases the most.

In the field of collaborative visual simultaneous localization and mapping (CVSLAM), efficient data communication poses a significant challenge, particularly in environments with limited bandwidth. To address this issue, we introduce a method aimed at reducing communication consumption. Our approach starts with a strategic culling of map points, aiming at maximizing pose-visibility and expanding spatial diversity to effectively eliminate redundant data in CVSLAM. We achieve this by formulating the problem of maximizing pose-visibility and spatial diversity as a minimum-cost maximum-flow graph optimization problem. Subsequently, we apply finite state entropy encoding for the compression of visual information, further alleviating bandwidth constraints. To verify the proposed method, we implement it within a centralized collaborative monocular simultaneous localization and mapping (SLAM) system. Our approach has been tested on publicly available datasets and in real-world scene. The results show a prominent reduction in bandwidth usage by 49% while maintaining mapping accuracy and without introducing additional latency, confirming its effectiveness in a multi-agent system setting.

Error checking of verb forms in English articles is beneficial for learning English and improving the fluency of English texts. In this study, long shortterm memory (LSTM) was used to recognize the types of errors in verb forms. To maximize the utilization of textual context information, a bidirectional LSTM algorithm was employed. Simulation experiments were then conducted, and the algorithm was evaluated against the support vector machine (SVM) algorithm and the grammar rules-based algorithm. The bidirectional LSTM method demonstrated higher accuracy in recognizing the parts of speech of words and the types of verb form errors in the text. Additionally, the accuracy was more stable when faced with different types of verb form errors.

As the complexity of modern library management tasks increases, it is difficult for traditional mobile robots to meet the task of moving and classifying books. In order to design a mobile robot that can autonomously classify and transport books, the study realizes the tasks of book classification and transportation in libraries by fusing the differential speed algorithm and the robot motion model algorithm. First, the robot operating system is utilized to scan the books, classify the books, and obtain the category information of the books. Then, the differential speed algorithm is used to control the motion of the robot to ensure that the robot can accurately transport the books to the designated location. At the same time, combined with the robot motion model algorithm, the motion trajectory of the robot is planned to ensure that the robot can avoid obstacles and stably complete the book transportation task. Finally, the deep reinforcement learning algorithm is used to train the decision-making model of the robot to improve the intelligence level of the robot. The results of simulation experiments show that the research method has the highest accuracy, with an average accuracy of 99.98%, and the robot is able to accurately categorize the books and quickly avoid obstacles with strong stability. The results of the application experiments show that the research method has the shortest moving distance, with an average moving distance of 132 m and an average completion time of 34 seconds, which are lower than the remaining three types of robots. The research robot showed high accuracy in the task of returning books in four time periods within 10 days in the library, with an average accuracy of 99.58%. The experimental results validate the superiority of the research methodology and show that the robots are capable of accurately recognizing and classifying books and can autonomously perform transportation tasks in libraries. The research results help to improve the automation level and management efficiency of libraries and have important application value.

License plate recognition is currently used in various situations, such as parking lot vehicle management and the tracking of wanted vehicles. These applications require recognition from all possible camera angles. Therefore, we propose a method for license plate recognition in images captured from various camera angles. First, the license plate area is detected from the input image using the YOLOv5 object detection method. The subsequent process can be performed in two manners: by rotating the license plate to the front using projective transformation and trapezoidal correction, or by using graph matching. The first method performs Hough transforms or linear approximations as preprocessing, and then calculates the rectangle surrounding the license plate from the YOLOv5 output. After performing trapezoidal correction, the maximally stable extremal regions (MSER) are used to detect character candidates, and characters are recognized using 3D rotated character recognition. The second method performs character candidate detection and recognition without trapezoidal correction, followed by graph matching. These methods are versatile because they do not depend on the layout of license plates, which varies among countries and regions. Two types of datasets were used: a set of images containing Japanese license plates collected by ourselves, and a set of publicly available images containing Taiwanese license plates. Two recognition rates were evaluated: the license plate character recognition rate and license plate recognition rate in which all characters in one plate are recognized. The license plate character recognition rates using graph matching were 91.9% for the Japanese license plates and 89.3% for the Taiwanese license plates. The license plate recognition rates were 84.0% and 84.5%, respectively.

This paper presents an innovative method to tackle the predictive-control challenges associated with large-scale fuzzy polynomial systems comprising interconnected polynomial fuzzy systems. This study models large-scale nonlinear fuzzy systems in a polynomial framework, which can reduce the number of fuzzy rules. We derive the conditions for controller synthesis in the main theorem using the Lyapunov theory and sum-of-squares technique. Simulation results confirm the validity and efficiency of this approach.

In this study, we focus on the path-planning problem of unmanned aerial vehicles (UAVs) deployed for inspection missions at target points. The goal is to visit each target point, provide revisits to important target points, and ultimately meet the monitoring requirements with regular and stable monitoring frequencies. Herein, we present MTSP-R, a novel variant of the multiple traveling salesmen problem (MTSP), in which revisits to important target points are allowed. We address the path-planning problem of multi-UAV in two stages. First, we propose a nearest insertion algorithm with revisits (NIA-R) to determine the number of required UAVs and initial inspection paths. We then propose an improved genetic algorithm (IGA) with two-part chromosome encoding to further optimize the inspection paths of the UAVs. The simulation results demonstrate that the IGA can effectively overcome the shortcomings of the original genetic algorithm, providing shorter paths for multiple UAVs and more stable monitoring frequencies for the target points.

Accurate prediction of borrowing volume of library books is conducive to the decision-making of the managers. This study briefly introduces the backpropagation neural network (BPNN) algorithm used to predict the borrowing volume of university libraries. The factor analysis method and genetic algorithm were employed to optimize the BPNN algorithm to improve its prediction performance. The book borrowing records of 2022 from Handan College Library were considered the subject of simulation experiments. The designed algorithm was compared with the extreme gradient boosting and traditional BPNN algorithms in the experiments. The results showed that average borrowing time, book lending ratio, book return ratio, and average grade of borrowers could be used as the input features of BPNN. The improved BPNN algorithm demonstrated faster convergence and a smaller error during training. The borrowing volume predicted by the improved BPNN algorithm closely matched the actual volume, and the increase in prediction time did not lead to a significant change in the prediction error.

In online shopping, user perspectives transit dynamically from abstract categories to concrete subcategories within a short period. We propose a perspective-estimation system that estimates the dynamic, short-term perspectives of users by inferring a hierarchy of categories based on their actions. The proposed system analyzes the wish list rankings of users and their operational histories to extract the categories emphasized at that moment. It then employs formal concept analysis to infer the hierarchical structure of categories, thereby visualizing the dynamic short-term perspective. In experiments involving 57 participants, the proposed method rates its match with user perspectives on a seven-point scale, achieving an average score of 4.84, outperforming the feature estimation method using latent Dirichlet allocation (LDA), which scored 4.36. The statistical significance was confirmed through the Wilcoxon rank-sum test with a statistic W=4.80 and a p-value of 1.56×10^-6. Compared with LDA, the proposed system is statistically significant in terms of the degree of agreement with the perspectives.