Search

In recent years, people have paid more and more attention to cloud data. However, because users do not have absolute control over the data stored on the cloud server, it is necessary for the cloud storage server to provide evidence that the data are completely saved to maintain their control over the data. Give users all management rights, users can independently install operating systems and applications and can choose self-service platforms and various remote management tools to manage and control the host according to personal habits. This paper mainly introduces the cloud data integrity verification algorithm of sustainable computing accounting informatization and studies the advantages and disadvantages of the existing data integrity proof mechanism and the new requirements under the cloud storage environment. In this paper, an LBT-based big data integrity proof mechanism is proposed, which introduces a multibranch path tree as the data structure used in the data integrity proof mechanism and proposes a multibranch path structure with rank and data integrity detection algorithm. In this paper, the proposed data integrity verification algorithm and two other integrity verification algorithms are used for simulation experiments. The experimental results show that the proposed scheme is about 10% better than scheme 1 and about 5% better than scheme 2 in computing time of 500 data blocks; in the change of operation data block time, the execution time of scheme 1 and scheme 2 increases with the increase of data blocks. The execution time of the proposed scheme remains unchanged, and the computational cost of the proposed scheme is also better than that of scheme 1 and scheme 2. The scheme in this paper not only can verify the integrity of cloud storage data but also has certain verification advantages, which has a certain significance in the application of big data integrity verification. [ABSTRACT FROM AUTHOR]

In order to improve the machining quality and efficiency and optimize NC machining programming, based on the existing cutting force models for ball-end, a cutting force prediction model of free-form surface for ball-end was established. By analyzing the force of the system during the cutting process, we obtained the expression equation of the instantaneous undeformed chip thickness during the milling process and then determined the rule of the influence of the lead angle and the tilt angle on the instantaneous undeformed chip thickness. It was judged whether the cutter edge microelement is involved in cutting, and the algorithm flow chart is given. After that, the cutting force prediction model of free-form surface for ball-end and pseudocodes for cutting force prediction were given. MATLAB was used to simulate the prediction force model. Finally, through the comparative analysis experiment of the measured cutting force and the simulated cutting force, the experimental results are basically consistent with the theoretical prediction results, which proves that the model established in this paper can accurately predict the change of the cutting force of the ball-end cutter in the process of milling free-form surface, and the error of the cutting force prediction model established in this paper is reduced by 15% compared with the traditional cutting force prediction model. [ABSTRACT FROM AUTHOR]

In order to solve the declining influence of traditional cultural symbols, the research on traditional cultural symbols has become more meaningful. This article aims to study the application of traditional cultural symbols in art design under the background of artificial intelligence. In this paper, a fractal model with self-combined nonlinear function changes is constructed. By combining nonlinear transformations and multiparameter adjustments, various types of fractal models can be automatically rendered. The convolutional neural network algorithm is used to extract the characteristics of the style picture, and it is compared with the trained picture many times to avoid the problem of excessive tendency of the image with improper weight. The improved L-BFGS algorithm is also used to optimize the loss of the traditional L-BFGS, which improves the quality of the generated pictures and reduces the noise of the chessboard. The experimental results in this paper show that the improved L-BFGS algorithm has the least loss and the shortest time in the time used for more than 500 s. Compared with the traditional AdaGrad method, its loss is reduced by about 62%; compared with the traditional AdaDelta method, its loss is reduced by 46%. Its loss is reduced by about 8% compared with the newly optimized Adam method, which is a great improvement. [ABSTRACT FROM AUTHOR]

Image recognition tasks involve an increasingly high amount of symmetric positive definite (SPD) matrices data. SPD manifolds exhibit nonlinear geometry, and Euclidean machine learning methods cannot be directly applied to SPD manifolds. The kernel trick of SPD manifolds is based on the concept of projecting data onto a reproducing kernel Hilbert space. Unfortunately, existing kernel methods do not consider the connection of SPD matrices and linear projections. Thus, a framework that uses the correlation between SPD matrices and projections to model the kernel map is proposed herein. To realize this, this paper formulates a Hilbert–Schmidt independence criterion (HSIC) regularization framework based on the kernel trick, where HSIC is usually used to express the interconnectedness of two datasets. The proposed framework allows us to extend the existing kernel methods to new HSIC regularization kernel methods. Additionally, this paper proposes an algorithm called HSIC regularized graph discriminant analysis (HRGDA) for SPD manifolds based on the HSIC regularization framework. The proposed HSIC regularization framework and HRGDA are highly accurate and valid based on experimental results on several classification tasks. [ABSTRACT FROM AUTHOR]

Many clustering algorithms are in favour of node-based methods, but a link between nodes has one single feature, so link-based clustering is sometimes easier than node-based methods. Being dependent on the characteristics of links, a detection algorithm for a non-overlapping link community is put forward in this paper. The method proposed also distinguishes the differences between nodes with a high degree of accuracy and detects communities with a minimal number of overlapping nodes. On the basis of three different datasets, experiments were conducted to compare the proposed algorithm with different non-overlapping and overlapping clustering algorithms, and the results show that our algorithm generates the least number of overlapping nodes and achieves a good community partition. [ABSTRACT FROM AUTHOR]

For the complex system modeling of operating underwater robots, various modules are built in Simulink to simulate the interaction of various forces and torques inside the underwater vehicle. According to the characteristics of the ROV itself, the ROV dynamics model is reasonably designed. In view of the problems of the position tracking delay, underwater environment interference, and unstable operation of the ROV, the fuzzy fractional PID control algorithm is adopted in the controller in this paper, and the control effect of the fuzzy PID and PID algorithm is compared and analyzed. [ABSTRACT FROM AUTHOR]

As a highly dense area for passengers, the airport departure hall is particularly characterized by the easy gathering of passengers, irregularity, and difficulty in command, which has become a high incidence of emergencies. For the evacuation problem in case of emergencies, the vast majority of passengers randomly choose the shortest path from the exit to escape, which will lead to congestion at some nodes and prolonging of the evacuation time. Therefore, this study proposes a better evacuation method considering the dynamic change in the spatiotemporal congestion of passengers. First, this paper constructs an evacuation network diagram for the departure hall of the Shenzhen Bao'an International Airport terminal building, simplifies the evacuation process into point-to-point evacuation, and proposes a time-varying network algorithm to optimize the emergency evacuation of the airport. Second, on the premise of obtaining the number and dynamic distribution of passengers in each area in real time, a linear programming model with the shortest evacuation time as the optimization objective is established, and the current optimal evacuation path of passengers is dynamically calculated. Finally, the two evacuation methods, random evacuation and evacuation, based on a time-varying network algorithm are simulated and analyzed by AnyLogic software. The results show that the evacuation scheme based on the time-varying network algorithm can effectively relieve the passenger congestion of some evacuation paths and safety exits. The evacuation time is reduced by 74 s, the evacuation efficiency is improved by 14%, passenger congestion at some evacuation routes and safety exits can be effectively relieved, and the global optimization of the emergency evacuation of passengers is achieved. [ABSTRACT FROM AUTHOR]

This paper proposes a multiview collaborative visual analysis system of network security based on a DPCA (clustering by fast search and find of density peaks) clustering algorithm called DPCANETVis, with network security analysis requirements for multisource heterogeneous data. Firstly, the system proposes an improved DPCA clustering algorithm based on the hierarchical relationship of mail sending and receiving to achieve the purpose of accurate classification. Secondly, a three-layer visual layout is designed to display relevant information such as data hierarchy, node relationship, behavior model, and other relevant information, by mixing a variety of interactive visual analysis methods such as tree diagram, word cloud, line diagram, subject river, and parallel coordinate. Lastly, based on the exploration of events, all suspicious nodes and their abnormal behaviors can be displayed in the system. Finally, the prototype system is used to analyze the network security log data set provided by the ChinaVis 2018, and the feasibility of the multilevel interactive visual analysis method for network security is verified through many experiments and discussions. [ABSTRACT FROM AUTHOR]

The dynamic time warping algorithm (DTW) has problems such as high computational complexity and "ill-conditioned matching." Aiming at the above two main problems, this paper proposes an improved DTW algorithm for the final wave recording of the primary and secondary deep fusion equipment detection platform. The terminal recorded waveform and the waveform with non-Gaussian noise added as the research object, the two sets of waveforms are divided into frames and windowed, and the short-term energy entropy ratio of the two sets of waveforms is input into the DTW as the test vector. Using the optimal matching paths and distances of the two input vectors, the common substring lengths of the two sets of short-term energy entropy ratio sequences are calculated. Then, we define the optimal matching coefficient and correct the waveform similarity. The experimental data show that the improved DTW algorithm can accurately quantify the similarity between terminal waveforms, which can provide effective data support for the health status assessment of power distribution terminals. [ABSTRACT FROM AUTHOR]

To improve learners' performance in online learning, a teacher needs to understand the difficulty of knowledge points learners of different cognitive encounter levels in the learning process. This paper proposes a difficulty-based knowledge point clustering algorithm based on collaborative analysis of multi-interactive behaviors. Firstly, combining the group-directed learning path network, forgetting factors and the degree of student-system interaction, we propose a measurement model to calculate the similarity of the difficulty between knowledge points on student-system interactive behavior. Secondly, to solve the data sparsity problem of interaction, we propose an improved similarity model to calculate the similarity of the difficulty between knowledge points on student-teacher and student-student interactive behavior. Finally, the knowledge point difficulty similarity matrix is obtained by integrating the difficulty similarity of knowledge points obtained from student-system interactive behavior, student-teacher interactive behavior, and student-student interactive behavior. The spectral clustering algorithm is used to achieve knowledge point difficulty classification based on the obtained similarity matrix. The experiments on real datasets show that the proposed method has better knowledge point difficulty classification results than the existing methods. [ABSTRACT FROM AUTHOR]

Most of the current algorithms for solving distributed online optimization problems are based on the first-order method, which are simple in computation but slow in convergence. Newton's algorithm with fast convergence speed needs to calculate the Hessian matrix and its inverse, leading to computationally complex. A distributed online optimization algorithm based on Newton's step is proposed in this paper, which constructs a positive definite matrix by using the first-order information of the objective function to replace the inverse of the Hessian matrix in Newton's method. The convergence of the algorithm is proved theoretically and the regret bound of the algorithm is obtained. Finally, numerical experiments are used to verify the feasibility and efficiency of the proposed algorithm. The experimental results show that the proposed algorithm has an efficient performance on practical problems, compared to several existing gradient descent algorithms. [ABSTRACT FROM AUTHOR]

Cloud services are accessed from different geographical locations where client migration or switching from one server to another based on the loads is a common phenomenon. One of the most critical challenges the cloud data centers face is managing the loads over geographically dispersed data centers and their virtual machines (VMs). VMs need to be balanced with the varied loads or dynamics of traffic. There are possibilities of the highest loads to be tolerated by the VMs over the cloud servers without crashing. Load balancing issues are managed by load balancing algorithms. Load balancing algorithms have varied issues of efficiency due to certain parameters like the capability of the lowest resource utilization, response time, higher overhead while checking the idle or normal nodes, and many others. Throttled load balancing algorithm manages loads of the virtual machines by dividing the virtual machines into two segments, that is, "available" and "free." To do this, the throttled algorithm uses a single component to assign the virtual machines and other tasks. The throttled algorithm utilizes only the first VMs available, the next, and so on. These strategic issues most often degrade the performance of the applied load balancing algorithm. Such issues create a curiosity to enhance this algorithm's performance for efficiently managing the dynamic loads of the cloud VMs. This research paper proposes a component-based throttled load balancing algorithm with VM reader, free VM holder, and free VM manager components. The VM reader component reads all available VMs. The free VM component holds free VMs temporarily until they are moved to the free VM manager component. For the performance test, the cloud analyst simulation tool was used. Based on the comparative analysis with the other five popularly used load balancing algorithms, the component-based algorithm's performance is significantly enhanced. The proposed algorithm resulted in 325.30-microsecond response time and 27.12-microsecond processing time by the closest data center service broker policy. The newly proposed "component-based throttled load balancing algorithm" is found to be better than the existing throttled algorithm and the other five selected algorithms in terms of response time, processing time, and resource utilization. [ABSTRACT FROM AUTHOR]

This paper examined the three-dimensional steady thin film flow of tangent hyperbolic fluid with nonlinear mixed convection flow and entropy generation past a stretching surface under the influence of magnetic field. For the flow problem, the Cattaneo–Christov heat and mass diffusion model was employed to examine heat and mass transfer characteristics and impacts of the normally directed magnetic field. To transform nonlinear PDEs into ODEs, the variable transformation technique was used. The bvp4c algorithm was implemented to solve these ODEs. The behavior of every leading parameter on the velocities, temperature, concentration profile, entropy generation, and Bejan number was reported with tabular and figurative form. The results show that as the values of Br increase, the entropy generation enhances, but the Bejan number decreases. Moreover, as the values of B increase, the opposite characteristics are observed in entropy generation and Bejan number graphs. Furthermore, the skin friction coefficient number, local Nusselt number, and Sherwood number are graphically discussed for the active involved parameters. The best agreement is recorded when we compare this paper with the previous literature for various values of M. [ABSTRACT FROM AUTHOR]

When the strapdown inertial navigation system does not perform coarse alignment, the misalignment angle is generally a large angle, and a nonlinear error model and a nonlinear filtering method are required. For large azimuth misalignment, the initial alignment technology with a large azimuth misalignment angle is researched in this paper. The initial alignment technology with a large azimuth misalignment angle is researched in this paper. First, the SINS/GPS nonlinear error model is established. Secondly, in the view of observation gross errors and inaccurate noise statistical characteristics, an adaptive robust CKF algorithm is proposed. Finally, according to the simulation analysis and experiment, the adaptive robust CKF algorithm can augment the stability and improve the filter estimation precision and convergence rate. [ABSTRACT FROM AUTHOR]

In this paper, a fault-tolerant control system based on back-stepping integral sliding mode controller (BISMC) is designed and analyzed for both nonlinear translational and rotational subsystems of the quadrotor unmanned aerial vehicles (UAVs). The novelty of this paper is about combination of a classic controller with a repetitive algorithm to reduce the response time to actuator faults and have better tracking performance. The actuator fault is defined based on the loss of effectiveness and bias fault. Next, the iterative learning control algorithm (ILCA) is used to compensate for the unknown fault input according to previous recorded experiences. In the normal condition (without actuators fault), BISMC can force the actual trajectories toward the desired commands and reduce chattering about control signals, and in the presence of the actuators fault or external disturbances, the mentioned learning algorithm can incline the accuracy of the tracking performance and compensate for the occurred error. The Lyapunov theory illustrates that the proposed control strategy can stabilize the system despite the actuators' fault and external disturbances. The simulation results show the effectiveness of the proposed scheme in comparison with another method. [ABSTRACT FROM AUTHOR]

The characteristics of military equipment maintenance work are analyzed. According to the actual needs of the army, the optimization objective is designed, and a multiobjective flexible maintenance process optimization model is built based on the maintenance business organization process. Combining the advantages of NSGA-II algorithm and the simulated annealing algorithm, this paper proposes a novel improved HNSGSA algorithm, of which algorithm flow is detailed. In accordance with the requirements of the optimization model, this paper also specifically designs the coding methods of the process sequence, the equipment selection and the process scheduling, and the corresponding cross mutation method. The feasibility of the built model is verified by the actual data of maintenance business. And, the superiority, accuracy, and effectiveness of the proposed algorithm are further validated by the comparison with the NSGA-II algorithm and the simulated annealing algorithm, providing a scientific reference for the army to carry out equipment maintenance. [ABSTRACT FROM AUTHOR]

Aiming at the optimal path and planning efficiency of global path planning for intelligent driving, this paper proposes a global dynamic path planning method based on improved A ∗ algorithm. First, this method improves the heuristic function of the traditional A ∗ algorithm to improve the efficiency of global path planning. Second, this method uses a path optimization strategy to make the global path smoother. Third, this method is combined with the dynamic window method to improve the real-time performance of the dynamic obstacle avoidance of the intelligent vehicle. Finally, the global dynamic path planning method of the proposed improved A ∗ algorithm is verified through simulation experiments and real vehicle tests. In the simulation analysis, compared with the modified A ∗ algorithm and the traditional A ∗ algorithm, the method in this paper shortens the path distance by 2.5%∼3.0%, increases the efficiency by 10.3%∼13.6% and generates a smoother path. In the actual vehicle test, the vehicle can avoid dynamic obstacles in real time. Therefore, the method proposed in this paper can be applied on the intelligent vehicle platform. The path planning efficiency is high, and the dynamic obstacle avoidance is good in real time. [ABSTRACT FROM AUTHOR]

Diffusion equations with Riemann–Liouville fractional derivatives are Volterra integro-partial differential equations with weakly singular kernels and present fundamental challenges for numerical computation. In this paper, we make a convergence analysis of the Schwarz waveform relaxation (SWR) algorithms with Robin transmission conditions (TCs) for these problems. We focus on deriving good choice of the parameter involved in the Robin TCs, at the continuous and fully discretized level. Particularly, at the space-time continuous level, we show that the derived Robin parameter is much better than the one predicted by the well-understood equioscillation principle. At the fully discretized level, the problem of determining a good Robin parameter is studied in the convolution quadrature framework, which permits us to precisely capture the effects of different temporal discretization methods on the convergence rate of the SWR algorithms. The results obtained in this paper will be preliminary preparations for our further study of the SWR algorithms for integro-partial differential equations. [ABSTRACT FROM AUTHOR]

When the outbreak of COVID-19 began, people could not go out. It was not allowed to provide agricultural machinery services in different places across regions to reduce the flow and gathering of people. Improvement of utilization efficiency of agricultural machinery resources is required through scientific scheduling of agricultural machinery. With seizing the farming season and stabilizing production as the goal, this paper studied the scientific scheduling of tractors within the scope of town and established agricultural machinery operation scheduling model with the minimization of total scheduling cost as the optimization objective. Factors such as farmland area, agricultural machinery, and farmland location information and operating time window are considered in this model to improve the accuracy of the agricultural machinery operation scheduling model. The characteristics of multiple scheduling algorithms are analyzed comprehensively. The scheduling requirements of agricultural machinery operation to ensure spring ploughing are combined to design the agricultural machinery scheduling algorithm based on the SA algorithm. With Hushu Street, Jiangning District, Nanjing City, as an example, a comparative experiment is conducted on the simulated annealing algorithm (SA) designed in this paper and the empirical algorithm and genetic algorithm (GA). The results suggest that the total cost of the scheduling scheme generated by the SA algorithm is 19,042.07 yuan lower than that by the empirical scheduling algorithm and 779.19 yuan lower than that by the genetic algorithm on average. Compared with the GA algorithm, the transfer distance, waiting cost, and delay cost of the SA algorithm are reduced by 11.6%, 100%, and 98.1% on average, indicating that the transfer distance of agricultural machinery in the scheduling scheme generated by the SA algorithm is shorter, so is the waiting and delay time. Meanwhile, it can effectively obtain the near-optimal solution that meets the time window constraint, with good convergence, stability, and adaptability. [ABSTRACT FROM AUTHOR]

In recent years, the Internet of Things technology can effectively innovate applications and services. The Internet of Things technology has become more and more popular. It provides an effective and direct bridge between the physical world and virtual objects in cyberspace. With the increase in the intensity of dragon boat training and the increasingly fierce competition, the possibility of injury is increasing. Dragon boat racing is a noncontact team sport based on strength and technology. The purpose of this paper is to solve the problem of people's lack of understanding of the sports injuries and causes of dragon boat athletes. We used the data fusion algorithm and cluster maintenance optimization algorithm to study the application of Internet of Things technology in the cause of dragon boat sports injury. In order to save energy, extend the network life cycle, shorten service interruption time, and increase data packet transmission, the cluster maintenance optimization algorithm in this paper mainly improves and optimizes the startup time of cluster maintenance, which depends on the maintenance cost. The experiment result shows that the etiological detection system proposed in this paper matches the actual sports injury results well. The experiment result shows that the research on the cause of injury in dragon boat sports based on Internet of Things technology can detect the damage law well and can have a more comprehensive understanding for the cause of injury, which helps to prevent injuries better and take effective treatments. In the analysis part, it can be concluded that the detection system is very accurate in detecting the cause, and the accuracy rate is basically 100%. [ABSTRACT FROM AUTHOR]

This paper is concerned with the quantized identification of rational systems, where the systems' output is quantized by a logarithmic quantizer. Under the assumption that the systems' input is periodic, the identification procedure is categorized into two steps. The first step is to identify the noise-free output of systems based on the quantized data. The second is to identify the unknown parameter based on the input and the estimation of the noise-free output. The identification algorithm is also summarized. Asymptotic convergence of the estimators is analyzed in detail, which shows that the estimators are convergent almost everywhere. A numerical example is given to illustrate the results obtained in this paper. [ABSTRACT FROM AUTHOR]

In this paper, a switched finite-time source-seeking strategy is proposed for underactuated ships with a signal sensor. In practical application, for sensors in some complex environment, due to the lack of the ability to perceive the location of the source or its own position, we use the nonmodel gradient estimation of extremum seeking algorithm. This paper presents a three-step switching control method for the first time. In the first step, we prove that the closed-loop system of the underactuated ship is stable in a finite time with a constant yaw angular acceleration. In the second step, under the yaw angle acceleration controller, one of the position coordinates of the underactuated ship sensor is realized to be close to the center of the signal source through the average method. The third step is to drive the other position coordinates of the underactuated ship sensor to the center of the signal source under the action of the surge line speed controller. Simulation results show the effectiveness of the proposed strategy. [ABSTRACT FROM AUTHOR]

Joint angle and frequency estimation, one of the key technologies in wireless communication and radar science, has been extensively studied by scholars. For linear arrays, this paper proposes a joint angle and frequency estimation method based on covariance reconstruction and the estimation of signal parameters via rotational invariance techniques (CR-ESPRIT). We first use the received conjugate signal to reconstruct a covariance matrix. Then, we use the least squares-ESPRIT (LS-ESPRIT) algorithm to estimate the desired frequencies. Finally, we estimate the angles according to the reconstructed matrix. The proposed method can estimate signal parameters via automatic pairing and without an additional parameter pairing process under the condition of a uniform or a nonuniform array. Moreover, this method has high estimation accuracy, excellent and stable anti-noise performance, and strong algorithmic robustness. Through a computer simulation analysis, we can confirm the reliability and validity of the proposed parameter estimation method. A comparison with other methods further proves the performance advantages of the developed method. The method in this paper can be easily applied to many signal processing contexts, such as electronic reconnaissance and wireless communication. [ABSTRACT FROM AUTHOR]

Convolution neural network has become a hot research topic in the field of computer vision because of its superior performance in image classification. Based on the above background, the purpose of this paper is to analyze sports sequence images based on convolutional neural network. In view of the low detection rate of single-frame and the complexity of multiframe detection algorithms, this paper proposes a new algorithm combining single-frame detection and multiframe detection, so as to improve the detection rate of small targets and reduce the detection time. Based on the traditional residual network, an improved, multiscale, residual network is proposed in this paper. The network structure enables the convolution layer to "observe" data from different scales and obtain more abundant input features. Moreover, the depth of the network is reduced, the gradient vanishing problem is effectively suppressed, and the training difficulty is reduced. Finally, the ensemble learning method of relative majority voting is used to reduce the classification error rate of the network to 3.99% on CIFAR-10, and the error rate is reduced by 3% compared with the original residual neural network. [ABSTRACT FROM AUTHOR]

Microscope vision analysis is applied in many fields. The traditional way is to use the human eye to observe and manually focus to obtain the image of the observed object. However, with the observation object becoming more and more subtle, the magnification of the microscope is required to be larger and larger. The method of manual focusing cannot guarantee the best focusing position of the microscope in use. Therefore, in this paper, we are studying the existing autofocusing technology and the autofocusing method of microscope based on image processing, which is different from the traditional manual focusing method. The autofocusing method of microscope based on image processing does not need the information such as the target position and the focal length of optical system, to directly focus the collected image. First of all, in order to solve the problem of large computation and difficult real time of traditional wavelet based image sharpness evaluation algorithm, this paper proposes an improved wavelet based image sharpness evaluation algorithm; secondly, in view of the situation that the window selected by traditional focusing window selection method is fixed, this paper adopts an adaptive focusing window selection method to increase the focusing window. Finally, this paper studies the extremum search strategy. In order to avoid the interference of the local extremum in the focusing curve, this paper proposes an improved hill-climbing algorithm to achieve the accuracy of focusing search. The simulation results show that the improved wavelet transform image definition evaluation algorithm can improve the definition evaluation performance, and the improved mountain climbing algorithm can reduce the impact of local extremum and improve the accuracy of the search algorithm. All in all, it can be concluded that the method based on image processing proposed in this paper has a good focusing effect, which can meet the needs of anti-interference and extreme value search of microscope autofocus. [ABSTRACT FROM AUTHOR]

In this paper, an improved bidirectional RRT ∗ vehicle path planning method for smart vehicle is proposed. In this method, the resultant force of the artificial potential field is used to determine the search direction to improve the search efficiency. Different kinds of constraints are considered in the method, including the vehicle constraints and the vehicle driving environment constraints. The collision detection based on separating axis theorem is used to detect the collision between the vehicle and the obstacles to improve the planning efficiency. The cubic B-spline curve is used to optimize the path to make the path's curvature continuous. Both simulation and experiment are implemented to verify the proposed improved bidirectional RRT ∗ method. In the simulation analysis, this paper's method can generate the smoothest path and takes the shortest time compared with the other two methods and it can be adaptive to the complicated environment. In the real vehicle experiment, we can see from the test results that this paper's method can be applied in practice on the smart electric vehicle platform; compared with others' algorithm, this paper's algorithm can generate shortest and smoothest path. [ABSTRACT FROM AUTHOR]

With the continuous development of the MOOCS model in college physical education, the corresponding teaching evaluation has also been widely concerned by the community. The development of a traditional education mode in college physical education cannot meet the current teaching requirements. In order to solve the problem of narrow application and insufficient accuracy in traditional education, on the basis of the Kohonen fuzzy decision tree algorithm and the MOOCS fuzzy decision tree algorithm, a fuzzy evaluation model of P.E. teaching is proposed. The results show that the fuzzy ID3 algorithm can achieve high accuracy in the four databases, and the classification accuracy of the A-D database is 75.9%, 62.9%, 76.6%, and 95.1%, respectively. Except for database C, the classification accuracy of the minimum classification uncertainty algorithm is lower than the other two clear decision tree algorithms. Compared with the minimum classification uncertainty algorithm, the fuzzy ID3 algorithm has obvious advantages in classification rules. The classification rules of A-D database are 18, 12, 16, and 10, respectively. When the authenticity threshold is about 0.8, the fuzzy ID3 algorithm has the highest classification accuracy. The proposed MOOCS model for college physical education based on the fuzzy decision tree algorithm has strong practicability and high accuracy. This paper studies the MOOCS model of college physical education and introduces the fuzzy decision tree algorithm to evaluate the MOOCS model of college physical education. It solves the problem that traditional sports cannot satisfy the needs of "Internet plus education" at all. Compared with the traditional sports model, it has better applicability and higher accuracy. [ABSTRACT FROM AUTHOR]

With the continuous deepening of the application of educational OA, massive educational data has been produced. Hence, the application of teaching big data (TBD) has a certain theoretical basis, practical methods, and research methods in the field of education. How to fully play the leading role of education on TBD in professional education, guide and recommend students to carry out personalized learning, change the teaching mode, enrich the teaching evaluation, then further improve the quality of talent training is a current issue, which has yet to be solved. Based on the analysis and mining of big data, this paper uses the spectral clustering algorithm to construct the curriculum association classification model and realizes the clustering of core courses. Then, through the analysis of the academic achievements of previous professional core courses, we can master the current situation of students' learning, construct the model as the portrait of students' individual, curriculum, and professional characteristics through deep learning, so as to realize the precise referral of personalized learning courses, provide students with targeted academic guidance, and further dynamically adjust the teaching syllabus, including the teaching methods and teaching means. Vice versa, we can improve the core courses clustering to further feedback on the curriculum association classification model by analyzing the job position technical requirements. Experiments show that the proposed model using a spectrum clustering algorithm could be better provided strong technical support for the decision-making of precision education in colleges and universities. [ABSTRACT FROM AUTHOR]

In recent years, an increasing number of population-based metaheuristic algorithms have been proposed to solve the flexible job-shop scheduling problem (FJSP) according to its practicality and complexity. Most of these algorithms are single-population-based and hence are very susceptible to becoming trapped in local optimal values. Thus, multipopulation methods are widely used to improve these algorithms, resulting in multipopulation algorithms. These multipopulation algorithms have been widely studied in the context of single-layer complex networks recently. However, coupled networks used to control two (or more) algorithms simultaneously to get a better algorithm are always ignored in literature. Therefore, in this paper, using coupled scale-free networks (with different scaling exponents) to control the genetic algorithm (GA) and the invasive weed optimization (IWO) simultaneously, a multipopulation GA/IWO with coupled scale-free networks (MPGAIWO-SF) is proposed to solve FJSP. Then, we study how some parameters (e.g., subpopulation size, subpopulation number, and scaling exponent) of MPGAIWO-SF affect its performance, which is also ignored in literature. The simulation results illustrate that (1) the performance of MPGAIWO-SF is significantly improved compared with that of GA and IWO; (2) as the subpopulation size increases, the performance of MPGAIWO-SF first becomes better and then remains almost unchanged; (3) as the subpopulation number increases, the performance of MPGAIWO-SF first becomes better and then decreases rapidly; and (4) the performance of MPGAIWO-SF becomes worse slightly as the scaling exponent decreases. Finally, solving more FJSP instances, the MPGAIWO-SF with optimized parameters is compared with other related algorithms to verify its effectiveness. [ABSTRACT FROM AUTHOR]

Various attitude estimation methods are based on an optimization problem posed in 1965 by Grace Wahba, which is called Wahba's problem in the field of attitude estimation. As a key for attitude determination, many different algorithms for minimizing Wahba's loss function have been proposed in the past 60 years. Among the most representative are Quaternion Estimator (QUEST), Singular Value Decomposition (SVD), and Fast Optimal Attitude Matrix (FOAM), which are briefly introduced in this research paper, and new algorithms proposed in recent years such as Fast Linear Quaternion Attitude Estimator (FLAE), are also included. The calculation principle and derivation process are given in the article, and simulation under high noise conditions for algorithms mentioned has been completed. Finally, several practical engineering applications related to Wahba's problem are introduced and the future development trend of attitude estimation is discussed. [ABSTRACT FROM AUTHOR]

Lack of trust, lack of standards, and low efficiency are the three biggest problems in China's trade financing at present. With the development and application of new generation technologies such as big data, cloud computing, artificial intelligence, and blockchain technology, China is in the stage of financial technology 3.0 under the deep integration of finance and technology. In the field of financial technology, the most concerned is the application of blockchain technology in trade finance business. With the successive construction of various blockchain platforms and the acceleration of the internationalization process, the international trade credit risk behind it is also increasing. Among many financial services, trade finance is the most closely integrated field with blockchain technology. In this context, preventing the risks in the business process of international trade enterprises, so as to reduce the cost of financial transactions, improve the effectiveness of financial services, and better serve the real economy is not only the internal development needs of enterprises, but also the national financial strategy needs. In view of the above problems, this paper analyzes the risk factors faced by multinational trading enterprises in the transaction process through the transaction data of some multinational enterprises on mobile phones, and constructs a credit evaluation system of international trading enterprises based on blockchain, in order to enhance the trade risk resistance ability of international trading companies. [ABSTRACT FROM AUTHOR]

Attitude measurement is an important core technology of vehicle flight. It is of great significance to ensure the vehicle's accurate orbit entry and orbit change, high-performance flight, reliable ground communication, high-precision ground observation, and successful completion of various space missions. Star sensor is the core component to realize an autonomous attitude measurement of the vehicle. Autonomous star map recognition is a key technology in star sensor technology, and it is also the focus and difficulty of research. When the star sensor enters the initial attitude acquisition mode, according to the algorithm, the star sensor can quickly obtain the initial attitude and enter the normal working mode. This paper proposes a star pattern recognition algorithm based on the radial companion-circumferential feature with a noise compensation code to address the low recognition rate caused by position noise in the process of constructing star patterns in the traditional star pattern recognition algorithm based on the radial feature. In order to solve the problem of slow matching search speed, a maximum matching number algorithm has been innovatively adopted, which can improve the search efficiency in the process of star pattern recognition. Thus, the capacity of the star pattern recognition feature library is effectively reduced, and the stability and recognition rate of the improved star pattern recognition algorithm are further improved. The improved star pattern recognition algorithm first establishes radial and circumferential feature vectors based on the bit vector, then adds the noise compensation code according to the companion star position error, then modifies the radial and circumferential feature vectors, and finally calculates the minimum similarity difference between the feature vector of the star pattern observed by the star sensor and the feature vector of the navigation star in the feature library to obtain the unique star pattern recognition result. The identification star database adopts the maximum matching number algorithm, which can improve the search efficiency, reduce the amount of redundant matching, and shorten the matching time. The simulation results show that even in the presence of star position and magnitude noise, the improved star pattern recognition algorithm with radial companion-circumferential feature maintains a high recognition rate of more than 97 percent, demonstrating that the algorithm's robustness is superior to other algorithms. The revised method described in this work outperforms the classic triangle algorithm and the radial feature star pattern recognition algorithm without compensation code in terms of algorithm robustness, recognition success rate, and recognition time. [ABSTRACT FROM AUTHOR]

Tourism has become the main force driving urban economic development. However, there are problems such as low utilization rate of tourism resources and inconsistency of tourism information. The new smart tourism management model can sense tourism resources, tourist information, tourism development, and other information in a timely manner through terminal devices such as the Internet. The core of smart tourism management is to obtain travel information of travelers through cloud service technology, organize travel information, and recommend personalized travel plans for travelers. Apply cloud services to smart tourism management, and use the weighted average algorithm to make regression predictions on passenger information. This paper compares and analyzes the application of cloud service based on the algorithm for calculating the weighted average and the application of ordinary cloud service in smart tourism management through experiments. The experimental results show that the cloud service by adding weights can improve the forecast of the traveler's information by 36% and 22%, respectively, compared with the cloud service of the ordinary average algorithm. Also, the effect of tourists' travel experience is 72.2% and 56.3%, respectively. In the forecast of tourism information in tourism resources, tourism economy, and tourism activities, cloud services by adding weights maintain stable economic growth and improve tourists' tourism experience. The cloud service in the smart tourism management of the weighted average algorithm can formulate corresponding tourism marketing strategies through the integration and prediction of tourism information, enhance the growth of the tourism economy, and improve the tourism experience of tourists. [ABSTRACT FROM AUTHOR]

In this paper, we investigate the direction of arrival (DOA) estimation problem with unfolded coprime linear array (UCLA) and propose a low computational complexity signal-subspace fitting (SF) algorithm. SF algorithm is able to achieve excellent DOA estimation performance while it requires global angular search (GAS). Especially in the several source signals situation, expensive complexity cost causes. To decrease computational complexity, we propose an initialized based SF (ISF) algorithm, which involves the several one dimensional (1D) partial angular search (PAS) instead of the multidimensional GAS. Consequently, the complexity is significantly decreased. Due to the full utilization of the array aperture, the proposed method in UCLA can attain better performance than general CLA (GCLA). In addition, as the SF is attractive in practical application, the proposed ISF algorithm lowers the computational cost, while achieving almost approximate estimation performance as traditional SF and noise subspace fitting (NF). Moreover, numerical simulations are provided and verify the effectiveness and the superiority of the proposed algorithm for the UCLA. [ABSTRACT FROM AUTHOR]

In recent years, with the development and extensive application of Internet technology and computer technology, and under the role of the continuous expansion and enrollment expansion of colleges and universities, how to effectively solve the Internet problems faced by teachers and students in colleges and universities has gradually become an important problem that the university information management department should solve in time. In order to continuously improve the efficiency of Internet access in universities, the Internet authentication and billing system for universities proposed in this paper take J2EE as the development platform and combines RADIUS protocol and PPPoE protocol to provide users with diversified Internet billing methods and strategies. At the same time, based on the Fourier fast transform algorithm, the development environment for the Internet authentication and billing system for colleges and universities is deployed, and after the Internet authentication and billing system is implemented, from the functional point of view of the system, the main functional modules are designed and implemented, including the authentication management function. module, billing management function module. The experimental results have shown that the throughput of PPPoE access server in the campus network using the Fourier rapid transform algorithm for traffic load balancing delay is small and stable between 200 ms and 300 ms after the optimization, which provides a feasible solution to promote the healthy and harmonious development of the university campus network. [ABSTRACT FROM AUTHOR]

In the era of "Internet +," the world economy is increasingly globalized and informatized, the development of China's B2C e-commerce is facing unprecedented opportunities, but it is also constrained by consumption risks. Consumption risk will make consumers have a crisis of trust in e-commerce, which brings uncertainty to the development of B2C. Therefore, it is very necessary to predict and prevent consumption risks in B2C e-commerce and take corresponding legal countermeasures. It is well known that neural networks (NNs) have strong predictive ability, but there are also problems such as lack of stability. As a result, in order to improve the prediction ability of neural network, principal component analysis and particle swarm technology are proposed in this paper as well as its stability and prediction error. The risk prediction accuracy of the BP NN (BPNN) technique was the lowest at 60% and the maximum at 70%, according to the experimental results of this research. The GA-BP technique has the lowest risk prediction accuracy of 80 percent. The risk prediction accuracy of the PSO-BP method is the lowest with 90% and the highest with 100%. Although the NN before the improvement can effectively predict the consumption risk, the risk prediction ability of the improved NN combined with principal component analysis and particle swarm algorithm is higher. Therefore, in life, the relevant personnel can apply the GA-BP and PSO-BP methods to the consumption risk prediction in B2C e-commerce to reduce the risk and make the e-commerce develop better. [ABSTRACT FROM AUTHOR]

The shape optimization of developable surfaces is a key and difficult technology in CAD/CAM. This paper studies the shape optimization of generalized developable Bézier-like surfaces using the improved salp swarm algorithm. First, aiming at the problems of slow convergence speed and low calculation accuracy, quickly falling into the optimal local solution for the salp swarm algorithm, and by adjusting the control parameters, the added Morlet wavelet mutation strategy to the individual position updates operation. An improved salp swarm algorithm is proposed, called FMSSA for short. Numerical results show that FMSSA performed the best among 18 (78%) comparisons with other improved SSAs in the CEC2005 test set. In addition, FMSSA serves the best among 16 (69%) comparisons with other algorithms. Therefore, the convergence speed and computational accuracy of FMSSA are improved, and the computational results are significantly better than other intelligent algorithms. Second, according to the duality principle of point and plane, the shape optimization problem of generalized developable Bézier-like surface is transformed into the minimization problem of arc length, energy, and curvature change rate of the dual curve, and three shape optimization models of the developable surface are established. Finally, shape optimization of expandable surfaces is mathematically an optimization problem that the swarm intelligence algorithm can efficiently handle, so FMSSA is used to solve these three optimization models. Numerical experiments show that FMSSA obtains optimal generalized developable Bézier-like surfaces in solving these three optimization models, demonstrating the superiority of the proposed FMSSA in effectively solving the shape optimization models in terms of precision and robustness. [ABSTRACT FROM AUTHOR]

Accurate identification of lithology is the basis and key process of fine logging interpretation and evaluation. However, reservoirs formed by different sedimentary environments and tectonic movements generally have the characteristics of complex and diverse lithology and strong heterogeneity, which brings great difficulty to the identification of reservoir lithology. This paper proposes an automatic identification technology for lithology logging based on the GWO-SVM algorithm model. The technology is actually applied, and the results are compared with the results of the support vector machine cross-validation optimization model, PNN (probabilistic neural network) model, and ELM (extreme learning machine) model. The results show that the GWO-SVM lithology logging recognition model can efficiently solve the lithology recognition and classification problems in complex reservoir analysis and has strong adaptability and higher recognition accuracy. [ABSTRACT FROM AUTHOR]

A vehicle's oscillation can be improved by using an active suspension system to replace the conventional passive suspension system. The active suspension system operates on the control signal from the controller. This paper introduces the Fuzzy-PI integrated control algorithm to control the system's efficiency. The Fuzzy algorithm adjusts the KP and KI parameters of the controller. This response depends on the oscillation state of the vehicle. A quarter model with a hydraulic actuator was used in this research. The simulation process takes place in the MATLAB-Simulink environment. In the first case, the maximum and average values of displacement and acceleration of the sprung mass when the vehicle uses the Fuzzy-PI algorithm are only 2.68%, 1.34%, and 1.65%, 0.66%, respectively, compared to the situation of vehicles using the passive suspension system. For the second case, these values are 3.33%, 1.69%, and 2.01%, 0.73%, respectively. As a result, the vehicle's stability and comfort are greatly enhanced when the integrated controller is used. Besides, the change of KP and KI parameters is also completely suitable for the vehicle's driving conditions. This research only leads to calculations and simulations; the experimental process is expected to occur soon. [ABSTRACT FROM AUTHOR]

In the Internet of Things (IoT) ecosystem, localization is critical for tracking and monitoring targets via nodes. The distance vector-hop (DV-Hop) technique is a good choice for localizing neighborhood in IoT networks. The conventional DV-Hop algorithm is a distributed localization approach that does not consider the distribution of the nodes into full deliberation when calculating the hop count from the source to destined nodes. The transfer distance and node positions thus do not attain higher efficiency while ascertaining the distance between sources and destined nodes. The study aims to resolve the pitfalls in the traditional algorithm by making enhancements in controlling the original DV-Hop algorithm's hop count and transfer distance method by utilizing the particle swarm to estimate the node positions. Error rate in the distance between beacon nodes and unseen nodes is effectively reduced with the proposed technique that calculate error factors with corrections in a reversed fashion to revise hop counts. An escape factor is introduced to take control of updating particles' velocity in the system, and the inertia weight is defined by a piecewise function to enlarge search space. This mechanism increases the diversity of the particle populations and mitigates the tendency of estimations on node positions to be trapped into local optima under stationary state. Also, the improved DV-Hop algorithm described in the paper has a better convergence speed due to the presence of random inertia weight logarithmic method. Finally, the problem of premature convergence is also tackled as a variation factor is adopted in collaboration with a fitness function that affects the particles' movement range and assists in global convergence. The overall performance of improved DV-Hop is evaluated by statistical metrics and also compared with the traditional DV-Hop algorithm under simulated environment with the data collected from real-world scenarios. Industry 4.0 is fully dependent upon IoT and the count of hops is very important for deciding the routing from the source to destination for speedy transmission of data. The improved DV-hop algorithm can achieve better results and has reduced error rate by more than 30%. The DV-Hop algorithm plays an important role in IoT-enabled environment especially in Industry 4.0. [ABSTRACT FROM AUTHOR]

Under the influence of the low-carbon economy, the electric vehicles have been vigorously promoted. As the main place for charging, charging stations are classified as unstable loads in the power grid because of the large fluctuation of electricity demand. If a large number of charging stations in the system are not regulated and dispatched, the stability of the system will be greatly affected, so it is vital to further study the scheduling strategy of the cars. In this paper, a scheduling model based on the multiobjective algorithm is established, in which the PSO algorithm is used in the model. And the experimental analysis shows that the model can reduce the average charging time and improve the utilization rate of charging piles. [ABSTRACT FROM AUTHOR]

The preprocessing of images is required for many applications based on industry, social, and academic requirements. Researchers have developed a number of techniques to improve the visual effect of images and appropriately interpret visual effects. The accuracy of visuals is important in cyber security, military organization, police organizations, and forensics to detect the true story from the pictures. They search for evidence by digging deep into the network in search of evidence. If visuals are not clear, preprocessing of images is not done correctly, then it may lead to wrong interpretations. This paper proposes an image local defogging technique based on multiobjective optimization to improve the visual effect of the image as well as the information entropy. The multiobjective function is selected to establish the image reconstruction model based on multiple objectives. The model is utilized to reconstruct a single image to moderate the impact of noise and other interference factors in the original image. The color constancy model and effective detail intensity model are also devised for image enhancement to get the visual details. The atmospheric light value and transmittance are evaluated using a physical model of atmospheric scattering, and the guided filter is used to maximize the transmittance of a single image and improve the efficiency of image defogging. The dark channel priority method is used to realize the local defogging of a single image and to design the local defogging algorithm. Experiments verify the optimization effect of the proposed algorithm in terms of information entropy and container network interface (CNI) value. The tone restoration degree is good, and it improves the overall image quality. The image defogging effect of the proposed algorithm is verified with respect to subjective and objective levels to check the efficacy of the proposed multiobjective model. [ABSTRACT FROM AUTHOR]

With the gradual implementation of the strategic goal of strengthening the country in education, people's attention to students' learning is also increasing day by day. At the same time, the teaching effect of individual teachers depends to a large extent on the identity of teachers themselves, so it is necessary to improve the construction of teachers' identity. Most of the research on teachers' identity construction starts from the theory of identity, which does not play a significant role in the critical application in practical teaching activities. In response to these problems, this paper will use the ReliefF algorithm and the Spark algorithm in the feature selection algorithm to scientifically process the identity construction, and implement the application of the improved ReliefF feature selection algorithm and the feature selection application steps based on the Spark algorithm respectively. The experimental results show that the improved ReliefF algorithm has better feature selection accuracy when the feature range is 30% to 40%. It shows that the construction of teacher identity based on feature selection algorithm can provide an objective basis for the realization of teacher identity. [ABSTRACT FROM AUTHOR]

College students are the main group of Internet users. With the development of electronic technology and mobile communication technology in China, most college students can easily use computers to access the Internet, and almost all college students use mobile phones, and using mobile phones to access the Internet has become very common in Colleges and universities. The effect is more obvious, and it is easier for ideological and political educators to understand the real situation. In order to further improve the performance of the interest point recommendation algorithm, this paper proposes a time feature-oriented interest point recommendation algorithm. The basic methods of user-based collaborative filtering are given, the functions of spatio-temporal features are described, respectively, the corresponding model representation is given to fuse spatio-temporal features, and a joint recommendation algorithm is proposed. Experiments show that compared with other related algorithms, this algorithm has higher accuracy and recall and is more suitable for the recommendation service of points of interest. [ABSTRACT FROM AUTHOR]

In this article, a novel methodology has been created based on optimized fuzzy PI controller using position control optimization (PCO). This proposed PCO algorithm ensures better control of brushless direct current motor (BLDCM) in order to reduce steady-state error and oscillation as well as improve the system response by optimizing the speed and position of rotor. The suitability of this technique has been simulated in different stages, so as to infer the optimization in results. The main motivation of this paper is to get better efficiency and optimum response from BLDCM, by comparing its performance characteristics with existing methods. The detailed investigation research through simulation is carried out using MATLAB/Simulink. However, in order to obtain well-defined results, the PCO technique was applied and the performance obtained was highly optimized than previously applied techniques. Through the simulations, the proposed approach can outperform the existing approaches such as PSO and moth-flame algorithm (MFA). [ABSTRACT FROM AUTHOR]

Falls cause great harm to people, and the current, more mature fall detection algorithms cannot be well-migrated to the embedded platform because of the huge amount of calculation. Hence, they do not have a good application. A lightweight fall detection algorithm based on the AlphaPose optimization model and ST-GCN was proposed. Firstly, based on YOLOv4, the structure of GhostNet is used to replace the DSPDarknet53 backbone network of the YOLOv4 network structure, the path convergence network is converted into BiFPN (bidirectional feature pyramid network), and DSC (deep separable convolution) is used to replace the standard volume of spatial pyramid pool, BiFPN, and YOLO head network product. Then, the TensorRt acceleration engine is used to accelerate the improved and optimized YOLO algorithm. In addition, a new type of Mosaic data enhancement algorithm is used to enhance the pedestrian detection algorithm, improving the effect of training. Secondly, use the TensorRt acceleration engine to optimize attitude estimation AlphaPose model, speeding up the inference speed of the attitude joint points. Finally, the spatiotemporal graph convolution (ST-GCN) is applied to detect and recognize actions such as falls, which meets the effective fall in different scenarios. The experimental results show that, on the embedded platform Jeston nano, when the image resolution is 416 × 416, the detection frame rate of this method is stable at about 8.33. At the same time, the accuracy of the algorithm in this paper on the UR dataset and the Le2i dataset has reached 97.28% and 96.86%, respectively. The proposed method has good real-time performance and reliable accuracy. It can be applied in the embedded platform to detect the fall state of people in real time. [ABSTRACT FROM AUTHOR]

The Internet is a popular form of information technology development in the new century, and it organizes and analyzes big data by taking effective measures to find useful information. With manpower, it is obviously not enough to be in such a huge information system, so the emergence of sustainable computing and artificial intelligence has become the core of large-scale data processing at this stage. This paper studies the application of the combined algorithm based on sustainable computing and artificial intelligence. In this paper, a new combined intelligent search algorithm is proposed by combining sustainable computing with artificial intelligence. The combination algorithm firstly analyzes the value from the aspects of ecological environment and economic benefits and studies the overall evaluation of sustainable development ability. Secondly, the energy analysis method is used to establish a reasonable comprehensive ecosystem and evaluate its impact on the sustainable development of environment and economy. Finally, the impact of resource consumption, wind speed detection, waste discharge, and utilization of renewable resources in a certain area is analyzed by simulation. Through the experimental results, on the one hand, it is proved that the data obtained by the combined algorithm are more accurate than the single algorithm; on the other hand, the combined algorithm can be further sublimated and widely used for other data detection. The combination algorithm proposed in this paper can effectively detect the required data and has high applicability. [ABSTRACT FROM AUTHOR]

With the rapid development and maturity of unconnected communication technology, effector technology, embedded computing technology, and distributed information processing technology, as well as the rapid advancement of digital processing and computing capabilities, unconnected effector Internet has received more and more attention. It is a new type of self-organizing unconnected multihop Internet. With the development and progress of technology and society, the development of unconnected effector Internet is also advancing by leaps and bounds, and it has a wide range of applications in many fields such as military, civil, environmental, medical, and industrial. At present, the research on unconnected effector Internet mainly focuses on the communication protocol, but there is almost no research on input review of unconnected effector Internet. Due to the limited energy of the effector and the limitation of the transmission signal bandwidth, the use of limited resources for input review research in effector Internet is of great significance to the development of unconnected effector Internet. Therefore, this paper studies the input review of unconnected effector Internet based on the L-A model on the on-chip embedded tune system. Because the classic low-power adaptive cluster layering protocol (LEACH) has the problems of unbalanced energy consumption and short node life cycle, this paper uses the embedded tune technology based on the L-A model and analyzes the remaining energy and location of the unconnected effector Internet node. Parameters are tested and studied. Through the research on the input review of unconnected effector Internet, the simulation results obtained show that the research in this paper is feasible and reasonable. [ABSTRACT FROM AUTHOR]

The evaluation method of tennis students' ability has an important influence on optimizing the selection and training of high-level tennis students. Based on the random matrix model theory, this paper constructs an evaluation algorithm for high-level tennis students in colleges and universities. Based on the literature and expert opinions, the model selects professional technical ability, knowledge learning ability, comprehensive development ability, and sustainable development ability as weighting factors and constructs the ability evaluation index system for high-level tennis students in colleges and universities. During the simulation process, the visualization system uses springboot, mybatis, and shiro as the back-end development framework to realize the modules of matrix management, role management, resource management, grade management, course management, student management, model management, etc. It adopts the MATLAB software platform to construct that the tennis learning evaluation includes 6 first-level indicators and 24 second-level indicators. The experimental results show that the final weights of the first-level indicators of tennis learning evaluation are as follows: tennis specific quality is 0.15, tennis sports skill is 0.3, tennis theoretical knowledge is 0.1, progress score is 0.15, attitude to learning tennis is 0.2, emotional performance and the spirit of cooperation is 0.1, and the results are visualized, which effectively improves the effectiveness of the random matrix algorithm in the field of selection evaluation. [ABSTRACT FROM AUTHOR]

As the global pandemic rapidly spreads, distance learning is emerging as a new method of instruction. Particularly, traditional courses that must be taught in-person, such as vocal singing instruction, require immediate adaptation to the COVID-19 and the new distance learning model. However, in the process of distance learning, it is frequently impossible to tailor and personalize instruction, particularly for vocal singing courses. Educational researchers are confronted with the pressing issue of how to extract useful and personalized patterns from a large volume of learner data in order to customize and individualize instruction. In this paper, we propose applying the decision tree method from data mining technology to a vocal singing education system by categorizing students according to the model. Once the characteristics of various learners have been stored in the corresponding user database, teachers can access timely information regarding the learners' most recent learning situation. This can be used as the basis for differentiating instructional strategies for various learners. This allows the instructor to designate individualized teaching and learning strategies for each student. [ABSTRACT FROM AUTHOR]