Search

This paper proposes a blockchain-based identity authentication (BA) scheme for IoT devices to solve the authentication security problem of IoT devices. The BA scheme uses hashing and digital signature algorithms to achieve integrity and nonrepudiation of authentication messages. Blockchain technology is used to achieve decentralised and distributed storage and management of authentication data. Besides, the BA scheme uses the idea of trust domains and trust credentials to establish a master-slave connection between IoT devices. The BA scheme is then compared with the existing four schemes and analysed from six perspectives to show that the BA scheme has better security. Also, the results show that the BA scheme has reasonable computational and storage overhead. Finally, the advantages of the BA scheme over traditional centralised and existing blockchain-based authentication schemes are compared and analysed. The results show that it can perfectly solve the problem of overreliance on trusted third parties in traditional authentication schemes. [ABSTRACT FROM AUTHOR]

This paper is concerned with two generalized inverse eigenvalue problems for a kind of pseudo‐Jacobi matrix. From a non‐Hermite matrix, an r × r Jacobi matrix, two distinct real eigenvalues, and part of the corresponding eigenvectors, an n × n pseudo‐Jacobi matrix is constructed. Furthermore, an n × n pseudo‐Jacobi matrix can be made by two different eigenpairs and a positive definite diagonal matrix. It is shown that a unique pseudo‐Jacobi matrix can be recovered from partial eigenpairs and certain special mixed eigendata. Two algorithms are provided for the reconstruction of such a pseudo‐Jacobi matrix, and illustrative numerical examples are presented to verify the proposed algorithms. [ABSTRACT FROM AUTHOR]

While facing complex surroundings, robots need to identify the same intention which is expressed in different ways. In order to solve the problem of assisting robots to get a better intention understanding, a self-tuning multimodal fusion algorithm is put forward in this paper, which is not restricted by the expressions of interacting participants and environment. The multimodal fusion algorithm can be transferred to different application platforms. Robots can own the understanding competence and adapt new tasks by changing the content of the robot knowledge base. Compared with other multimodal fusion algorithms, this paper attempts to transfer the basic structure of feed-forward neural networks on discrete sets, which has strengthened the consistency and perfect the complementary relations between multiple mode, and has realized the simultaneous operation of fusion operator's self-tuning and intention search. There are three kinds of modes selected in the paper: speech, gesture, and scene objects, where the single modal classifiers are trained separately. This method conducted a human-computer interaction experiment on the bionic robot Pepper platform, which proved that the method can effectively improve the accuracy and robustness of robots in aspects of understanding human intentions, and reduce the uncertainty about intention judgment in a single modal interaction. [ABSTRACT FROM AUTHOR]

With the development of urban economic construction and urban planning, higher requirements are put forward for the government community in the corresponding community management, community service, and other related things. As an important technical means to assist the government and community in management, video recognition technology plays an important role in the accurate management and service of the government and community. Traditional algorithms based on partial differential equations will destroy image edges and image details in video recognition. Based on this, this paper improves the traditional partial differential equation algorithm of image recognition, selects the GAC model based on image segmentation in the main function, and innovatively optimizes the stop function of its equation function, so as to improve the effect of community case image segmentation. In the image smoothing layer, this paper innovatively selects the second derivative based on image processing as the inherent feature of image recognition, so as to solve the rough problem of image edge and improve the processing efficiency of the algorithm. In order to further maintain the details of the relevant images of community cases, this paper integrates the Gaussian curvature driving function on the improved partial differential equation algorithm, so as to protect the details of the smooth region of the relevant recognition video and solve the disadvantages of the traditional algorithm. The experimental results show that the improved partial differential equation algorithm proposed in this paper improves the accuracy of video recognition by about 5% compared with the traditional algorithm. At the same time, the new algorithm can well ensure the detail integrity of the recognized video. [ABSTRACT FROM AUTHOR]

In the foggy environment, the images collected outdoors are prone to problems, such as low contrast and loss of details. In order to solve this problem, this paper proposes an algorithm based on multiscale parallel-depth separable convolutional neural network (MSP-DSCNN) to remove fog from foggy images and improve image quality. The multiscale feature extraction module extracts texture feature details from fog images at different scales and extracts high-dimensional and low-dimensional features from fog images by using parallel depth and shallow channels. In order to further optimize the network model, a split convolution method is proposed, which can split the feature graph into two categories, one is the main feature and the other is the secondary feature. The key information is extracted from the main features with high complexity, and the compensation information is extracted from the minor features with low complexity. Experiments show that compared with other algorithms, the model constructed in this paper has obvious advantages in defogging effect, natural color of restored images, good detail retention, and dominant indicators. It effectively solves the problems of incomplete haze, color offset, and poor visibility of detail maintenance in the current image. [ABSTRACT FROM AUTHOR]

Nowadays, blockchain is known as a new generation of secure information technologies for realizing business and industrial sustainability, and consensus algorithm is the key technology of blockchain. In order to solve the problem of "oligarchy" nodes and excessive punishment for nodes in existing credit consensus algorithms, a novel semifragile consensus algorithm based on the credit space for consortium blockchain is proposed in this paper. Firstly, the accounting node selection mechanism based on credit space is proposed. The credit value of the node is calculated according to a novel credit evaluation model, and then the credit space of the node is allocated according to the size of the credit value. Afterward, a random algorithm is used to select the accounting node in the credit space. This mechanism effectively inhibits the generation of "oligarchy" nodes and maintains the enthusiasm of nodes. Secondly, this paper proposes a semifragile hierarchical punishment mechanism, which punishes the malicious nodes with severe measures and gives the nonmalicious nodes the opportunity to continue participating in the consensus. So, this semifragile punishment mechanism solves the problem of excessive punishment of nodes. Experimental simulation results demonstrate that the proposed consensus algorithm has randomness while maintaining the credit incentive among nodes. In addition, the node's punishment mechanism is more reasonable. This algorithm has better security and can be well applied to consortium blockchain scenarios. [ABSTRACT FROM AUTHOR]

Aiming at the problem that the dark channel prior algorithm is not ideal in removing fog at the distant view and the sudden change of depth, this paper proposes an adaptive bright and dark channel combined with defogging algorithm based on the depth of field. The algorithm divides the image into a distant area and a near area based on the depth of field. The near area uses the dark channel to remove the fog, and the distant area uses the bright channel to remove the fog, combined with the use of adaptive superpixel segmentation to give the content-based local area division and defogging control factor based on depth of field. It better solves the problem of large transmittance deviation and defogging distortion under content changes and sudden depth of field changes. From the subjective and objective indicators, the algorithm in this paper has achieved a good defogging effect, and the main indicators and comprehensive defogging quality are better than common algorithms. [ABSTRACT FROM AUTHOR]

Detection and recognition of traffic signs are the keys to creating advanced driving assistance systems. Making highly precise maps also requires the identification and extraction of such road elements as traffic signs. Traditional detection and recognition methods no longer meet today's needs, and object recognition algorithms based on deep learning have become the mainstream solution. However, current algorithms have limitations. The recognition speed of one-stage strategy algorithms is fast, but recognition accuracy is not satisfactory especially for small objects. The accuracy of two-stage algorithms is higher, but the recognition speed is extremely slow. This paper solves these problems with a proposed parallel attention convolution module, a channel attention pyramid network, and a loss function diagonal and center point IoU based on the YOLOv3 algorithm. The improved models in this paper are compared with SSD, YOLOv3, and Faster RCNN. Experimental results show that the proposed models have some improvement over the above models: the mAP of the models with PACM, CAFPN, and DCPIoU was 76.02%, compared with SSD300, SSD500, Faster RCNN, and YOLOv3, which had improvements of 9.27%, 6.93%, 2.94, and 5.3%, respectively. And the FPS of the improved model is basically the same as the original YOLOv3, without reducing the real-time performance. [ABSTRACT FROM AUTHOR]

In this paper, a novel UAV path planning algorithm based on improved cellular ant colony algorithm and dynamic window algorithm (ICACO-IDWA) is proposed to solve the problem of dynamically changing threat during actual flight. The main innovations of this paper are as follows. (a) The hexagon grid method is proposed to model the UAV flight space, which solves the problem of inconsistent simulation time step. (b) A novel ICACO-IDWA algorithm is proposed. In the first stage, the optimal path is obtained by the improved cellular ant colony algorithm (ICACO). In the second stage, the improved dynamic window algorithm (IDWA) is used to optimize the optimal path considering dynamic threat. Through the algorithm, the UAV path planning with dynamic threat change is realized. Finally, simulation results verify the effectiveness of the proposed model and algorithm. [ABSTRACT FROM AUTHOR]

Web page classification is critical for information retrieval. Most web page classification methods have the following two faults: (1) need to analyze based on the overall web page and (2) do not pay enough attention to the existence of noise information inside the web page, which will thus decrease the efficiency and classification performance, especially when classifying the contaminated web page. To solve these problems, this paper proposes a denoising disposal algorithm. We choose the top-down method for hierarchical classification to improve the prediction efficiency. The experimental results demonstrate that our method is about 7 times faster than the full-page method and achieves good classification results in most categories. The precision of 7 parent categories is all above 88% and is 24% higher than the other meta tag-based method on average. [ABSTRACT FROM AUTHOR]

This paper presents an indepth analysis and research on the quantitative design of fine art images through artificial intelligence algorithms. A CycleGAN-based network model for automatic generation of sketches of fine art images is constructed to extract the edge and contour features of fine art images. The network uses 512 × 1024 high-resolution art images as input and Pitchman as a discriminator. To further enhance the sketch generation effect, a bilateral filtering algorithm is added to the generator model for noise reduction, and then a K -means algorithm is used for color quantization to solve the problem of cluttered lines in the generated sketches. The experimental results show that the network model can effectively realize the automatic generation of art image sketches and can retain the detailed part of the costume information well. A rendering platform is built to realize the application of art image generation algorithms and coloring algorithms. The platform integrates the functions of image preprocessing, sketch generation, and sketch coloring, demonstrates the results of the main research content of this paper, and finally increases the interest of the system through the rendering function of the art image grid, which further improves the practicality of the platform. [ABSTRACT FROM AUTHOR]

Human action recognition is an important part for computers to understand the behavior of people in pictures or videos. In a single image, there is no context information for recognition, so its accuracy still needs to be greatly improved. In this paper, a single-image human action recognition method based on improved ResNet and skeletal keypoints is proposed, and the accuracy is improved by several methods. We improved the backbone network ResNet-50 and CPN to a certain extent and constructed a multitask network to suit the human action recognition task, which not only improves the accuracy but also balances the total number of parameters and solves the problem of large network and slow operation. In this paper, the improvement methods of ResNet-50, CPN, and whole network are tested, respectively. The results show that the single-image human action recognition based on improved ResNet and skeletal keypoints can accurately identify human action in the case of different human movements, different background light, and occlusion. Compared with the original network and the main human action recognition algorithms, the accuracy of our method has its certain advantages. [ABSTRACT FROM AUTHOR]

The signal corresponding to English speech contains a lot of redundant information and environmental interference information, which will produce a lot of distortion in the process of English speech translation signal recognition. Based on this, a large number of studies focus on encoding and processing English speech, so as to achieve high-precision speech recognition. The traditional wavelet denoising algorithm plays an obvious role in the recognition of English speech translation signals, which mainly depends on the excellent local time-frequency domain characteristics of the wavelet signal algorithm, but the traditional wavelet signal algorithm is still difficult to select the recognition threshold, and the recognition accuracy is easy to be affected. Based on this, this paper will improve the traditional wavelet denoising algorithm, abandon the single-threshold judgment of the original traditional algorithm, innovatively adopt the combination of soft threshold and hard threshold, further solve the distortion problem of the denoising algorithm in the process of English speech translation signal recognition, improve the signal-to-noise ratio of English speech recognition, and further reduce the root mean square error of the signal. Good noise reduction effect is realized, and the accuracy of speech recognition is improved. In the experiment, the algorithm is compared with the traditional algorithm based on MATLAB simulation software. The simulation results are consistent with the actual theoretical results. At the same time, the algorithm proposed in this paper has obvious advantages in the recognition accuracy of English speech translation signals, which reflects the superiority and practical value of the algorithm. [ABSTRACT FROM AUTHOR]

The advancement in technology is taking place with an accelerating pace across the globe. With the increasing expansion and technological advancement, a vast volume of text data are generated everyday, in the form of social media platform, websites, company data, healthcare data, and news. Indeed, it is a difficult task to extract intriguing patterns from the text data, such as opinions, summaries, and facts, having varying length. Because of the problems of the length of text data and the difficulty of feature value extraction in news, this paper proposes a news text classification method based on the combination of deep learning (DL) algorithms. In order to classify the text data, the earlier approaches use a single word vector to express text information and only the information of the relationship between words were considered, but the relationship between words and categories was ignored which indeed is an important factor for the classification of news text. This paper follows the idea of a customized algorithm which is the combination of DL algorithms such as CNN, LSTM, and MLP and proposes a customized DCLSTM-MLP model for the classification of news text data. The proposed model is expressed in parallel with word vector and word dispersion. The relationship among words is represented by the word vector as an input of the CNN module, and the relationship between words and categories is represented by a discrete vector as an input of the MLP module in order to realize comprehensive learning of spatial feature information, time-series feature information, and relationship between words and categories of news text. To check the stability and performance of the proposed method, multiple experiments were performed. The experimental results showed that the proposed method solves the problems of text length, difficulty of feature extraction in the news text, and classification of news text in an effective way and attained better accuracy, recall rate, and comprehensive value as compared to the other models. [ABSTRACT FROM AUTHOR]

In order to effectively solve the problem of relatively large errors in individual positioning strategies in indoor environments, this paper applies the genetic optimization neural network algorithm to indoor location based on multi-source information fusion. The range of the geomagnetic fitness is constrained based on the results obtained by using the wireless WiFi positioning for combination and matching, which can reduce the value of the matching error effectively. Subsequently, the global optimal value of the indoor network is calculated based on the genetic algorithm, which can optimize the initial value and threshold of the neural network after genetic optimization so as to improve the accuracy of the network to the greatest extent possible while accelerating the convergence speed at the same time. After the optimization processing is completed, fusion training can be performed on the coordinates of the actual positions based on the obtained combination positioning situation and the predicted positioning result in the indoor network. Finally, the optimal positioning result can be obtained accordingly. Through the analysis of practical cases, it can be known that the mean square error predicted based on the genetic optimization neural network calculated by using the genetic algorithm can be effectively reduced by 76%, and the accuracy of the fusion positioning can be increased by 48% on average compared with the accuracy of a single positioning strategy. Hence, the method put forward in this paper has effectively improved the positioning accuracy, which suggests that its positioning performance is superior. [ABSTRACT FROM AUTHOR]

In recent years, solar photovoltaic (PV) energy, as a clean energy source, has received widespread attention and experienced rapid growth worldwide. However, the rapid growth of PV power deployment also brings important challenges to the maintenance of PV panels, and in order to solve this problem, this paper proposes an innovative algorithm based on PA-YOLO. First, we propose to use PA-YOLO's asymptotic feature pyramid network (AFPN) instead of YOLOv7's backbone network to support direct interactions of nonadjacent layers and avoid large semantic gaps between nonadjacent layers. For the occlusion problem of dense targets in the dataset, we introduce a repulsive loss function, which successfully reduces the occurrence of false detection situations. Finally, we propose a customized convolutional block equipped with an EMA mechanism to enhance the perceptual and expressive capabilities of the model. Experimental results on the dataset show that our proposed model achieves excellent performance with an average accuracy (mAP) of 94.5%, which is 6.8% higher than YOLOv7. In addition, our algorithm also succeeds in drastically reducing the model size from 71.3 MB to 48.4 MB, which well demonstrates the effectiveness of the model. [ABSTRACT FROM AUTHOR]

The research on artistic psychological intervention to judge emotional fluctuations by extracting emotional features from interactive vocal signals has become a research topic with great potential for development. Based on the interactive vocal music instruction theory of emotion recognition, this paper studies the design of artistic psychological intervention system. This paper uses the vocal music emotion recognition algorithm to first train the interactive recognition network, in which the input is a row vector composed of different vocal music characteristics, and finally recognizes the vocal music of different emotional categories, which solves the problem of low data coupling in the artistic psychological intervention system. Among them, the vocal music emotion recognition experiment based on the interactive recognition network is mainly carried out from six aspects: the number of iterative training, the vocal music instruction rate, the number of emotion recognition signal nodes in the artistic psychological intervention layer, the number of sample sets, different feature combinations, and the number of emotion types. The input data of the system is a training class learning video, and actions and expressions need to be recognized before scoring. In the simulation process, before the completion of the sample indicators is unbalanced, the R language statistical analysis tool is used to balance the existing unbalanced data based on the artificial data synthesis method, and 279 uniformly classified samples are obtained. The 279 ∗ 7 dataset was used for statistical identification of the participants. The experimental results show that under the guidance of four different interactive vocal music, the vocal emotion recognition rate is between 65.85%-91.00%, which promotes the intervention of music therapy on artistic psychological intervention. [ABSTRACT FROM AUTHOR]

At present, blockchain technology is more and more widely used in the field of food traceability, and good results have been achieved. However, many of the current blockchain technologies and algorithms are not developed for the specific situation of food traceability, resulting in resource waste and low computational efficiency. In view of these problems, this paper analyzes and summarizes the classic distributed consensus mechanism in blockchain technology, focusing on the PBFT (practical Byzantine fault tolerance) consensus mechanism and the existing problems related to the improvement scheme. In order to solve the problem of low efficiency of a consensus algorithm in a food traceability scenario, this paper proposes a blockchain consensus algorithm suitable for the food traceability scenario based on clustering and food credit. In addition, the differences between the improved algorithm and the classical Byzantine consensus algorithm in consensus algorithm time and communication times are analyzed through experiments and simulations. The consensus efficiency of the improved algorithm in this paper is significantly improved, which can greatly reduce the application difficulty of blockchain in food traceability. [ABSTRACT FROM AUTHOR]

There are few studies for the classification detection and dynamic multitarget detection of the targets in front of vehicles. In order to solve this problem, a dynamic multitarget detection algorithm is proposed. First, a dynamic multitarget detection with displacement at any time is suggested; secondly, a multitarget detection algorithm based on improved You Only Look Once version 3 (YOLOv3) is proposed for the detection of multitarget high probability risk events in front of the vehicle. The YOLOv3 algorithm model is a lightweight backbone network that uses embedded real-time detection technologies. In this paper, we use a lightweight Mobilenetv2 to replace Darknet-53 for feature extraction. Moreover, an optimizer is used for multiobjective feature extraction, group normalization, and multiobjective feature extraction. The results show that in comparison with the original YOLOv3 algorithm, the detection leakage rate of the improved YOLOv3 multitarget detection algorithm is less than 5%, and the amount of model parameters in this paper is reduced by 95% as compared to the traditional data and CPU intertime is reduced to 78%. [ABSTRACT FROM AUTHOR]

With the continuous progress of society, dance art has gradually entered the lives of ordinary people, and people's appreciation level and artistic attention have gradually improved. How to improve the level of dance art has become an urgent problem to be resolved. In order to solve the problems encountered in dance tumbling pose recognition, this paper proposes a dance tumbling pose recognition model based on multifeature fusion algorithm. According to the characteristics of dance movements, an effective feature extraction method is studied. By combining the key information of bones, the fusion features of the relative position of human joints, the angle of joints, and the ratio of limb length are selected to classify the movements in the dance scene. Through the residual block automatic motion detection method, a multifeature fusion module is used to fuse multiple features, so as to improve the estimation of complex pose by the algorithm and finally complete the dance action identify. The test and analysis results on the data set show that the algorithm can identify the dance somersault pose and can effectively improve the accuracy of dance movement recognition, with strong recognition performance. It is convenient for people to recognize dance tumble posture in the video, thereby realizing the action correction function for dancers. [ABSTRACT FROM AUTHOR]

Traditional ice and snow path planning methods still have internal environmental problems in intelligent path planning, such as weak innovation ability, imperfect management, long planning path, unreasonable security structure, and low degree of specialization. Therefore, more and more ice and snow sports lovers are eager to solve this problem. This paper designs a path planning method based on three-dimensional ice and snow model. The path planning method of moving snow and ice based on MNN (Multiclass Neural Networks) algorithm is studied from many aspects. MNN algorithm is used for comprehensive analysis and evaluation. The mobile phone provides data information on key nodes, air resistance, momentum change, ice and snow movement track, and so on. The results show that the ice and snow path planning system based on MNN algorithm designed in this paper has the advantages of high feasibility, high data accuracy, and good prediction effect and can effectively improve the efficiency of ice and snow path planning. [ABSTRACT FROM AUTHOR]

With the rapid development of computer science, a large number of images and an explosive amount of information make it difficult to filter and effectively extract information. This article focuses on the inability of effective detection and recognition of English text content to conduct research, which is useful for improving the application of intelligent analysis significance. This paper studies how to improve the neural network model to improve the efficiency of image text detection and recognition under complex background. The main research work is as follows: (1) An improved CTPN multidirectional text detection algorithm is proposed, and the algorithm is applied to the multidirectional text detection and recognition system. It uses the multiangle rotation of the image to be detected, then fuses the candidate text boxes detected by the CTPN network, and uses the fusion strategy to find the best area of the text. This algorithm solves the problem that the CTPN network can only detect the text in the approximate horizontal direction. (2) An improved CRNN text recognition algorithm is proposed. The algorithm is based on CRNN and combines traditional text features and depth features at the same time, making it possible to recognize occluded text. The algorithm was tested on the IC13 and SVT data sets. Compared with the CRNN algorithm, the recognition accuracy has been improved, and the detection and recognition accuracy has increased by 0.065. This paper verifies the effectiveness of the improved algorithm model on multiple data sets, which can effectively detect various English texts, and greatly improves the detection and recognition performance of the original algorithm. [ABSTRACT FROM AUTHOR]

In order to explore the economic development trend in the postepidemic era, this paper improves the traditional clustering algorithm and constructs a postepidemic economic development trend analysis model based on intelligent algorithms. In order to solve the clustering problem of large-scale nonuniform density data sets, this paper proposes an adaptive nonuniform density clustering algorithm based on balanced iterative reduction and uses the algorithm to further cluster the compressed data sets. For large-scale data sets, the clustering results can accurately reflect the class characteristics of the data set as a whole. Moreover, the algorithm greatly improves the time efficiency of clustering. From the research results, we can see that the improved clustering algorithm has a certain effect on the analysis of economic development trends in the postepidemic era and can continue to play a role in subsequent economic analysis. [ABSTRACT FROM AUTHOR]

Basic services for power business were provided by the power multimodel network providers. However, because the power multimodal network is usually complex and changeable, the service of power business is often unstable. This problem can be solved by a suitable network resource optimization method. Therefore, how to design a network resource optimization method that seeks a compromise between multiple performance indicators that achieve the normal operation of power multimode networks is still extremely challenging. An optimal allocation method of power multimodal network resources based on NSGA-II was proposed by this paper. Firstly, the power multimodal network-resource model is established, and the problems existing in the resource optimization process are analyzed. Secondly, preprocessing technology and indirect coding technology are applied to NSGA-II, which solves the coding problem and convergence problem of the application of genetic algorithm to the optimization of network resource allocation. Finally, the simulation results show that, compared with the control algorithm, this method has further optimized the various indicators of the resource allocation of the power multimodal network, and the performance has been improved by more than 6%. [ABSTRACT FROM AUTHOR]

This paper investigates the control problem of the buoyancy regulation system for autonomous underwater vehicle (AUV). There are some problems to be considered in the oil-water conversion-based buoyancy regulation system, including the external seawater pressure, the pressure fluctuations, and the slow switching speed of the ball valve. The control accuracy of the buoyancy regulation under the traditional PID controller cannot meet the requirements of the project. In this paper, a fuzzy sliding mode control scheme is developed for the buoyancy regulation system to solve the abovementioned problems. At first, a mathematical model of the buoyancy regulation system is established, and the stability of the system is analyzed. Then, the sliding mode control algorithm is combined with the fuzzy system to improve the control accuracy. Finally, the pool-experiment results on a prototype show that the developed control scheme can meet the requirements of the control accuracy for the buoyancy regulation system. [ABSTRACT FROM AUTHOR]

With the rapid development of neural network technology, we have widely used this technology in various fields. In the field of language translation, the research on automatic detection technology of English verb grammatical errors is in a hot stage. The traditional manual detection cannot be applied to the current environment. Therefore, this paper proposes an automatic detection technology of English verb grammatical errors based on recurrent neural network (RNN) algorithm to solve this problem. Firstly, the accuracy and feedback speed of traditional manual detection and recurrent neural network RNN algorithm are compared. Secondly, a detection model which can be calculated according to grammatical order combined with context is designed. Finally, when the output verb result is inconsistent with the original text, it can automatically mark the error detection effect. The experimental results show that the algorithm model studied in this paper can effectively improve the detection accuracy and feedback efficiency and is more applicable and effective than the traditional manual detection method. [ABSTRACT FROM AUTHOR]

In conventional sports training, coaches record and observe athletes' sports data and judge whether it is reasonable based on their own experience. This qualitative analysis method is highly subjective, has large errors, and is susceptible to interference. To solve the above problems, the design of the sports training system under the wireless sensor network and the research of movement monitoring and recognition become very important. This article aims to study the design of sports training system and the monitoring and recognition of actions under the wireless sensor network technology. This paper simulates the implementation of the proposed data collection protocol and the two basic protocols, the direct transfer algorithm and the flooding algorithm, and compares the protocol proposed in this paper with the other two algorithms in terms of average information transmission success rate and average network overhead. Among them, the average information transmission success rate represents the ratio of the number of messages successfully arriving at the base station to the total amount of information generated by all nodes, and the average network overhead represents the average number of messages sent by each node. Experimental results show that the data collection protocol proposed in this paper can dynamically provide different transmission qualities for information of different importance levels, effectively reducing network overhead, and the reduced overhead is 11% of the original. [ABSTRACT FROM AUTHOR]

With the development of deep learning, target detection from vision sensor has achieved high accuracy and efficiency. However, small target detection remains a challenge due to inadequate use of semantic information and detailed texture information of underlying features. To solve the above problems, this paper proposes a small target detection algorithm based on Mask R-CNN model which integrates transfer learning and deep separable network. Firstly, the feature pyramid fusion structure is introduced to enhance the learning effect of low-level and high-level features, especially to strengthen the information channel of low-level feature and meanwhile optimize the feature information of small target. Secondly, the ELU function is used as the activation function to solve the problem that the original activation function disappears in the negative half axis gradient. Finally, a new loss function F-Softmax combined with Focal Loss was adopted to solve the imbalance of positive and negative sample proportions. In this paper, self-made data set is used to carry out experiments, and the experimental results show that the proposed algorithm makes the detection accuracy of small targets reach 66.5%. [ABSTRACT FROM AUTHOR]

This article analyzes the method of reading data from inertial sensors. We introduce how to create a 3D scene and a 3D human body model and use inertial sensors to drive the 3D human body model. We capture the movement of the lower limbs of the human body when a small number of inertial sensor nodes are used. This paper introduces the idea of residual error into the deep LSTM network to solve the problem of gradient disappearance and gradient explosion. The main problem to be solved by wearable inertial sensor continuous human motion recognition is the modeling of time series. This paper chooses the LSTM network which can handle time series as well as the main frame. In order to reduce the gradient disappearance and gradient explosion problems in the deep LSTM network, the structure of the deep LSTM network is adjusted based on the residual learning idea. In this paper, a data acquisition method using a single inertial sensor fixed on the bottom of a badminton racket is proposed, and a window segmentation method based on the combination of sliding window and action window in real-time motion data stream is proposed. We performed feature extraction on the intercepted motion data and performed dimensionality reduction. An improved Deep Residual LSTM model is designed to identify six common swing movements. The first-level recognition algorithm uses the C4.5 decision tree algorithm to recognize the athlete's gripping style, and the second-level recognition algorithm uses the random forest algorithm to recognize the swing movement. Simulation experiments confirmed that the proposed improved Deep Residual LSTM algorithm has an accuracy of over 90.0% for the recognition of six common swing movements. [ABSTRACT FROM AUTHOR]

In this paper, we propose an improved algorithm based on the active contour model Mumford-Shah model for CT images, which is the subject of this study. After analyzing the classical Mumford-Shah model and related improvement algorithms, we found that most of the improvement algorithms start from the initialization strategy of the model and the minimum value solution of the energy generalization function, so we will also improve the classical Mumford-Shah model from these two perspectives. For the initialization strategy of the Mumford-Shah model, we propose to first reduce the dimensionality of the image data by the PCA principal component analysis method, and for the reduced image feature vector, we use K -means, a general clustering method, as the initial position algorithm of the segmentation curve. For the image data that have completed the above two preprocessing processes, we then use the Mumford-Shah model for image segmentation. The Mumford-Shah curve evolution model solves the image segmentation by finding the minimum of the energy generalization of its model to obtain the optimal result of image segmentation, so for solving the minimum of the Mumford-Shah model, we first optimize the discrete problem of the energy generalization of the model by the convex relaxation technique and then use the Chambolle-Pock pairwise algorithm We then use the Chambolle-Pock dual algorithm to solve the optimization problem of the model after convex relaxation and finally obtain the image segmentation results. Finally, a comparison with the existing model through many numerical experiments shows that the model proposed in this paper calculates the texture image segmentation with high accuracy and good edge retention. Although the work in this paper is aimed at two-phase image segmentation, it can be easily extended to multiphase segmentation problems. [ABSTRACT FROM AUTHOR]

According to the current situation of knowledge popularization, students simply rely on the knowledge learned in the classroom that is far from adapting to the development of modern society; so, every student needs to have the consciousness and ability of independent learning. The research of the English self-help learning system based on partial differential equation method comes into being with information network technology as the foundation for survival and development. The existing partial differential equation recognition models based on average curvature motion are all edge-based and need to use the external force defined by the image gradient to attract the zero level set (evolution curve) to move to the target edge and finally stay on the target edge. Therefore, it is difficult to obtain ideal results when extracting fuzzy or discrete boundaries (perceptual boundaries), and it is very sensitive to the selection of initial contour and noise. To solve this problem, this paper proposes a new recognition model of partial differential equations based on mean curvature motion. This overcomes some defects of existing edge models because it is region-based and does not require image gradient as a condition to stop evolution. The proposed model can avoid manual initial curve selection and allow stopping conditions to be set in the algorithm. In addition, in the numerical solution of partial differential equations, the existing model uses upwind difference scheme, and the semi-implicit additive operator separation method is adopted in this paper. Some other layers are added, and some hyperparameters are adjusted when the convolutional neural networks of inception PDEs are constructed by stacking the structure of inception PDEs. In the contrast experiment with the prototype, the software and hardware environment are the same, and the input is exactly the same. For the handwritten English alphabet data set, the variant structure can obtain more than 90% of the training accuracy and verification accuracy, which is better than the experimental accuracy of the prototype. In addition, because the inception PDE structure contains fewer parameters than the prototype, it is more computationally efficient and takes less training time per batch than the prototype. [ABSTRACT FROM AUTHOR]

In this paper, we consider the problem of motion intention recognition for cluster targets with splitting behaviour and lack of motion prior information. This is a challenge to the classical Bayesian inference based intention recognition algorithms because they rely heavily on a priori knowledge. In order to solve these problems, a joint algorithm of deep echo state network optimized by adaptive genetic algorithm (AGADESN) and DBSCAN clustering algorithm is proposed in this paper. We use improved Olfati-Saber model with direction noise to generate cluster motion and use the cluster motion data to drive AGADESN algorithm to predict cluster destination, which achieves higher destination prediction accuracy than DESN algorithm. We innovatively design the motion similarity distance (MSD) and take the destination prediction output as one of the distance inputs, alleviating the lack of differentiation among different cluster targets caused by only relying on speed and position distance at the early stage of cluster motion. Based on the MSD, DBSCAN clustering algorithm is used to identify clusters in the field of view to determine whether splitting behaviour occurs. Simulation results demonstrate the effectiveness of the proposed algorithm in cluster target motion intention recognition and its superiority over DESN algorithm and DBSCAN algorithm only based on speed and position distance. [ABSTRACT FROM AUTHOR]

In mmWave massive MIMO systems, traditional digital precoding is difficult to be implemented because of the high cost and energy consumption of RF chains. Fortunately, the hybrid precoding which combines digital precoding and analog precoding not only solves this problem successfully, but also improves the performance of the system effectively. However, due to the constant mode constraint introduced by the phase shifter in the analog domain, it is difficult to solve the hybrid precoding directly. There is a solution which divides the total optimization problem into two stages to solve, that is, first fix the digital precoding matrix, solve the analog precoding matrix, and then optimize the digital precoding matrix according to the obtained analog precoding matrix. In this paper, a high energy-efficient hybrid precoding scheme is proposed for the subconnection structure. In the first stage, the optimization problem can be decomposed into a series of subproblems by means of the independent submatrix structure of the analog precoding matrix. When the optimized analog precoding matrix is obtained, the digital precoding matrix can be solved by the minimum mean error (MMSE). Finally, the digital precoding matrix is normalized to satisfy the constraint conditions. The simulation results demonstrate that the performance of the proposed algorithm is close to that of fully digital precoding based on subconnection structure and better than that of the existing algorithms. In addition, this paper presents the simulation analysis of the algorithm performance under imperfect channel state information. Simulation results show that when the estimation accuracy of channel state information is 0.8, the spectral efficiency of the proposed algorithm can already be maintained at a good level. [ABSTRACT FROM AUTHOR]

Abnormal behavior detection of social security funds is a method to analyze large-scale data and find abnormal behavior. Although many methods based on spectral clustering have achieved many good results in the practical application of clustering, the research on the spectral clustering algorithm is still in the early stage of development. Many existing algorithms are very sensitive to clustering parameters, especially scale parameters, and need to manually input the number of clustering. Therefore, a density-sensitive similarity measure is introduced in this paper, which is obtained by introducing new parameters to transform the Gaussian function. Under this metric, the distance between data points belonging to different classes will be effectively amplified, while the distance between data points belonging to the same class will be reduced, and finally, the distribution of data will be effectively clustered. At the same time, the idea of Eigen gap is introduced into the spectral clustering algorithm, and the verified gap sequence is constructed on the basis of Laplace matrix, so as to solve the problem of the number of initial clustering. The strong global search ability of artificial bee colony algorithm is used to make up for the shortcoming of spectral clustering algorithm that is easy to fall into local optimal. The experimental results show that the adaptive spectral clustering algorithm can better identify the initial clustering center, perform more effective clustering, and detect abnormal behavior more accurately. [ABSTRACT FROM AUTHOR]

The original target tracking algorithm based on a single model has long been unable to meet the complex and changeable characteristics of the target, and then there are problems such as poor tracking accuracy, target loss, and model mismatch. The interactive multimodel algorithm uses multiple motion models to track the target, obtains the degree of adaptation between the actual motion state of the target and each model according to the calculated likelihood function, and then combines the updated weight values of each filter to obtain a weighted sum. Therefore, the interactive multimodel algorithm can achieve better performance. This paper proposes an improved interactive multimodel algorithm that can achieve player tracking and trajectory feature matching. First, this paper proposes an improved Kalman filtering (IKF) algorithm. This method is developed from the unbiased conversion measurement Kalman filter, which can obtain more accurate target state and covariance estimation. Secondly, using the parallel processing mode of the IMM algorithm to efficiently solve the data association between multiple filters, the IMM-IKF model is proposed. Finally, in order to solve the problem of low computational efficiency and high mismatch rate in image feature point matching, a method of introducing a minimum spanning tree in two-view matching is proposed. Experimental results show that the improved IMM-IKF algorithm can quickly respond to changes in the target state and can find the matching path with the lowest matching cost. In the case of ensuring the matching accuracy, the real-time performance of image matching is ensured. [ABSTRACT FROM AUTHOR]

Due to the limitation of sports movement, the current simulation technology of sports entities is prone to deficiencies in capturing dynamic motion figures and is prone to lack of accuracy. It is also affected by external noise and brightness. To solve these problems, this paper proposes a sports entity simulation based on the fish swarm algorithm and compares the figure effectiveness, figure segmentation, core point, and noise reduction effect of the two in the shooting figure. Through the comparison, it is found that the figure is more appropriate to the real moving figure, the motion capture is more accurate, and the number of core points is related to the accuracy of motion capture. The more core points, the more accurate the motion capture, and the noise reduction effect is also increased by 20.3%, which reduces the impact of brightness on the motion simulation. The difference in the effect of the traditional simulation technology (particle swarm algorithm) and the entity simulation based on the fish swarm algorithm was also compared. The combination with the artificial fish swarm algorithm is to simulate the moving entity and learn from some reference data. By comparing the data between the two after the experiment, it is concluded that the fish swarm algorithm is more effective in the simulation of sports entities. [ABSTRACT FROM AUTHOR]

In order to solve the problem of low accuracy of pedestrian detection of real traffic cameras and high missed detection rate of small target pedestrians, this paper combines autoencoding neural network and AdaBoost to construct a fast pedestrian detection algorithm. Aiming at the problem that a single high-level output feature map has insufficient ability to express pedestrian features and existing methods cannot effectively select appropriate multilevel features, this paper improves the traditional AdaBoost algorithm structure, that is, the sample weight update formula and the strong classifier output formula are reset, and the two-input AdaBoost-DBN classification algorithm is proposed. Moreover, in view of the problem that the fusion video is not smoothly played, this paper considers the motion information of the video object, performs pixel interpolation by motion compensation, and restores the frame rate of the original video by reconstructing the dropped interframe image. Through experimental research, we can see that the algorithm constructed in this paper has a certain effect. [ABSTRACT FROM AUTHOR]

The combination of Spark distributed platform and High-Utility Itemset Mining can solve the problem of long running time issue of High-Utility Itemset Mining. In the experiment, we conclude that Spark-based parallel D2HUP and EFIM algorithms have a greater improvement in running time efficiency than serial algorithms. The existing research has shown that the EFIM and D2HUP algorithms are the two best algorithms for High-Utility Itemset Mining. This paper generates 118 datasets by generating and collecting the running time of the two algorithms in the real and simulated datasets, taking into account the characteristics of each dataset's length, sparse degree, and dataset size as characteristics with running time as the prediction target and then establishing a model. The accuracy of the prediction was evaluated through experiments, and a set of rules based on decision trees was generated. According to the rules, the fastest algorithm between EFIM and D2HUP can be predicted very well. [ABSTRACT FROM AUTHOR]

In order to effectively solve the problem that the radar detection system is difficult to detect the "low, small, slow" UAV, the high-performance computing early warning neural network is used to recognize the air UAV in real time and extract the target category and image space location information; the PSO algorithm is used to optimize the parameters of the anti-UAV to ensure that the anti-UAV not only relies on factors but also fully combines the dependence of the visual field factor to quickly obtain the optimal solution through analyzing the high-performance computing early warning neural network in this paper. This algorithm is used to initialize the anti-UAV resources and improve the global optimization capability of the algorithm proposed in this paper. Finally, the experimental results show that the proposed PSO algorithm has better high-performance computing early warning performance to meet the actual needs of network high-performance computing early-warning neural networks. [ABSTRACT FROM AUTHOR]

Mean Shift is a kind of clustering algorithm, which is mostly used for target tracking, image segmentation, etc. In order to solve the problem that image information is not effectively utilized because of unclear traffic video images and random jitter between image sequences, this paper has studied how to achieve stability of traffic video images and proposed an improved Mean Shift algorithm about how to conduct object centroid registration in compensation for the deviations in space localization and, on this basis, how to select kernel window width to eliminate the errors in scale positioning. This algorithm gets the tracking effect and computation analysis of improved Mean Shift from the perspective of applications, removes or relieves the impact motion has on imaging, improves the quality of the video image information obtained, automatically adjusts the size of window according to the scale changes of moving object in the image, and effectively enhances the stability and real time of object tracking. Besides, in the postprocessing stage, the superpixel based on the Mean Shift algorithm is applied to further optimize the segmentation result; it is a popular mode-seeking clustering algorithm, which makes Mean Shift method ideal on low-dimensional applications such as image segmentation. Finally, we show promising results for remote sensing image segmentation. [ABSTRACT FROM AUTHOR]

After the occurrence of major sudden disasters, the dispatching and distribution of disaster relief materials are particularly important, but in the process of distribution, there may be excessive distribution of similar emergency materials, unbalanced distribution volume of relief materials in different disaster-affected points, high distribution cost, and low effective distribution rate. In order to solve the above problems, based on the application of big data, this paper proposes a three-level network postdisaster material scheduling and distribution model and an improved NSGA-II algorithm. The model takes the loss degree of the disaster area and the dynamic change rate of the demand for postdisaster relief materials as the constraints, takes the demand prediction of postdisaster relief materials, the optimization of distribution path, distribution nodes, and the satisfaction of victims as the objectives, and designs the sample average approximation method and the improved NSGA-II algorithm. In order to verify the effectiveness of the proposed model and strategy, through the comparative experiment of NSGA and PSO, it can be seen from the experimental results that the three-level network allocation model and the improved NSGA-II algorithm (nondominated sorting genetic algorithm II) proposed in this paper can not only solve the existing postdisaster relief material allocation and scheduling problem but also reduce the space-time complexity of the problem. [ABSTRACT FROM AUTHOR]

The platform inertial-stellar composite guidance is a composite guidance method supplemented by stellar correction on the basis of inertial navigation, which can effectively improve the accuracy of responsive launch vehicles. In order to solve the problem of rapid determining the optimal navigation star in the system, this paper proposes an algorithm based on the equivalent information compression theory. At first, this paper explains why the single-star scheme can achieve the same accuracy as the dual-star scheme. At the same time, the analytical expression of the optimal navigation star with significant initial error is derived. In addition, the available optimal navigation star determination strategy is also designed according to the arrow-borne navigation star database. The proposed algorithm is evaluated by two representative responsive launch vehicle trajectory simulations. The simulation results demonstrate that the proposed algorithm can determine the optimal navigation star quickly, which greatly shorten the preparation time before the rapid launch of vehicles and improve the composite guidance accuracy. [ABSTRACT FROM AUTHOR]

In the order picking process of the warehouse center, considering the rapid increase in the volume of orders arriving at the picking center at the time of the promotional festival, a hybrid operation mode with multiple picking tables is used to meet the picking requirements of the huge number of real-time orders. Therefore, in this paper, a hybrid picking mode is proposed, taking into account both the idle degree of picking stations and their order item centers of gravity, and a new reinforcement learning algorithm embedding mechanism (PRL) with placeholder control is designed to solve the problem of a huge number of real-time item orders arriving at the picking center system on promotional holidays and in inconsistent quantities, and numerical simulations are performed for this algorithm. The experimental results show that the PRL algorithm in hybrid picking mode can handle a huge number of orders simultaneously and improve picking efficiency effectively. [ABSTRACT FROM AUTHOR]

In this paper, a single-vehicle static partial repositioning problem (SPRP) is investigated, which distinguishes the user dissatisfaction generated by different stations. The overall objective of the SPRP is to minimize the weighted sum of the total operational time and the total absolute deviation from the target number of bikes at all stations. An iterated local search is developed to solve this problem. A novel loading and unloading quantity adjustment operator is proposed to further improve the quality of the solution. Experiments are conducted on a set of instances from 30 to 300 stations to demonstrate the effectiveness of the proposed customized solution algorithm as well as the adjustment operator. Using a small example, this paper also reveals that the unit penalty cost has an effect on the repositioning strategies. [ABSTRACT FROM AUTHOR]

In order to effectively solve the problems of unreasonable design and low evaluation level in the process of fractal art pattern design and evaluation, a CAD fractal art pattern design and evaluation is proposed based on RBF network algorithm. Through the corresponding sequence sorting of RBF network algorithm, the image surface with the same CAD fractal art pattern design and evaluation attributes is divided into two parts. The main shape in the algorithm is mainly the node of feature tree. According to the later stage of image features, using high-level design basic knowledge and evaluation methods, RBF network algorithm is introduced into the process of original image design modification. Finally, the experimental results show that the algorithm used in this paper has certain advantages in CAD fractal art pattern design and evaluation. [ABSTRACT FROM AUTHOR]

Evaluating scientific articles has always been a challenging task, made even more difficult by the constantly evolving citation networks. Despite numerous attempts at solving this problem, most existing approaches fail to consider the link relationships within the citation network, which can often result in biased evaluation results. To overcome this limitation, we present an optimization ranking algorithm that leverages the P-Rank algorithm and weighted citation networks to provide a more accurate article ranking. The proposed approach employs two hyperbolic tangent functions to calculate the corresponding age of articles and the number of citations, while also updating the link relationships of each paper node in the citation network. We validate the effectiveness of the proposed approach using three evaluation indicators and conduct experiments on three public datasets. The obtained experimental results demonstrate that the optimization article ranking method can achieve competitive performance when compared to other unweighted ranking algorithms. In addition, we note that the optimal Spearman's rank correlation and robustness can all be achieved by using a combination of the following parameters: α = 10 , β = 5 , and γ = 2. [ABSTRACT FROM AUTHOR]

Mixed defects have become increasingly popular in defect detection and one of the hottest research areas in wafer maps. Postprocessing methods used to solve the overlapping problem in mass mixed defects have a poor detection speed, which is insufficient for rapid defect detection. In this paper, the fast-soft nonmaximum suppression (fs-NMS) method is proposed to solve this problem. The score of the detection box is updated by optimizing the penalty distribution function. Further, this paper analyzes the performance of the fs-NMS method in wafer defect detection. As a penalty, the logistic function is used, and experiments are conducted using single-stage and two-stage detectors. The final results show that, compared to the soft-NMS, the efficiency for the single-stage and two-stage detectors is increased on average by 9.63% and 21.72%, respectively. [ABSTRACT FROM AUTHOR]

It is difficult to accurately classify a service into specific service clusters for the multirelationships between services. To solve this problem, this paper proposes a service partition method based on particle swarm fuzzy clustering, which can effectively consider multirelationships between services by using a fuzzy clustering algorithm. Firstly, the algorithm for automatically determining the number of clusters is to determine the number of service clusters based on the density of the service core point. Secondly, the fuzzy c -means combined with particle swarm optimization algorithm to find the optimal cluster center of the service. Finally, the fuzzy clustering algorithm uses the improved Gram-cosine similarity to obtain the final results. Extensive experiments on real web service data show that our method is better than mainstream clustering algorithms in accuracy. [ABSTRACT FROM AUTHOR]

The existing automatic parking algorithms often neglect the unknown obstacles in the parking environment, which causes a hidden danger to the safety of the automatic parking system. Therefore, this paper proposes parking space detection and path planning based on the VIDAR method (vision-IMU-based detection and range method) to solve the problem. In the parking space detection stage, the generalized obstacles are detected based on VIDAR to determine the obstacle areas, and then parking lines are detected by the Hough transform to determine the empty parking space. Compared with the parking detection method based on YOLO v5, the experimental results demonstrate that the proposed method has higher accuracy in complex parking environments with unknown obstacles. In the path planning stage, the path optimization algorithm of the A ∗ algorithm combined with the Bezier curve is used to generate smooth curves, and the environmental information is updated in real time based on VIDAR. The simulation results show that the method can make the vehicle efficiently avoid the obstacles and generate a smooth path in a dynamic parking environment, which can well meet the safety and stationarity of the parking requirements. [ABSTRACT FROM AUTHOR]

With the advent of the era of big data and the rapid development of deep learning and other technologies, people can use complex neural network models to mine and extract key information in massive data with the support of powerful computing power. However, it also increases the complexity of heterogeneous network and greatly increases the difficulty of network maintenance and management. In order to solve the problem of network fault diagnosis, this paper first proposes an improved semisupervised inverse network fault diagnosis algorithm; the proposed algorithm effectively guarantees the convergence of generated against network model, makes full use of a large amount of trouble-free tag data, and obtains a good accuracy of fault diagnosis. Then, the diagnosis model is further optimized and the fault classification task is completed by the convolutional neural network, the discriminant function of the network is simplified, and the generation pair network is only responsible for generating fault samples. The simulation results also show that the fault diagnosis algorithm based on network generation and convolutional neural network achieves good fault diagnosis accuracy and saves the overhead of manually labeling a large number of data samples. [ABSTRACT FROM AUTHOR]