Search

As the growth of social network scale, so do challenges to the existing anomaly detection algorithms. Therefore, this paper proposed an anomaly detection method based on graph modularity clustering（GMC＿AD）, which could be applied to solve the problem of low detection efficiency caused by network size and complexity. Based on analyzing the network topology structure, the GMC＿AD method improved the efficiency of events detection by weighting mechanism on abnormal nodes and modularity clustering algorithm. The GMC＿AD processes could be described as follow: a)Since designing a quantization strategy for node evolution in the network, GMC＿AD get the set of abnormal nodes by recognizing nodes with abnormal evolutionary behaviors. b)The method used a modularity clustering algorithm to reduce the network size. c)During the calculation of network fluctuation value, it introduced a weighting mechanism for taking the influence of abnormal nodes into consideration, after that, the GMC＿AD method detected the abnormality by the changes of network fluctuation value. On real social network datasets VAST, EU＿E-mail and ENRON, the GMC＿AD method accurately detected the abnormal periods. The event detection sensibility of GMC＿AD method was increased by 50%～82% meanwhile the run-time efficiency increased by 30%～70%. The GMC＿AD method enhances not only the accuracy and sensitivity but also the efficiency of anomaly detections. [ABSTRACT FROM AUTHOR]

Background: Readability metrics provide us with an objective and efficient way to assess the quality of educational texts. We can use the readability measures for finding assessment items that are difficult to read for a given grade level. Hard‐to‐read math word problems can put some students at a disadvantage if they are behind in their literacy learning. Despite their math abilities, these students can perform poorly on difficult‐to‐read word problems because of their poor reading skills. Less readable math tests can create equity issues for students who are relatively new to the language of assessment. Less readable test items can also affect the assessment's construct validity by partially measuring reading comprehension. Objectives: This study shows how large language models help us improve the readability of math assessment items. Methods: We analysed 250 test items from grades 3 to 5 of EngageNY, an open‐source curriculum. We used the GPT‐3 AI system to simplify the text of these math word problems. We used text prompts and the few‐shot learning method for the simplification task. Results and Conclusions: On average, GPT‐3 AI produced output passages that showed improvements in readability metrics, but the outputs had a large amount of noise and were often unrelated to the input. We used thresholds over text similarity metrics and changes in readability measures to filter out the noise. We found meaningful simplifications that can be given to item authors as suggestions for improvement. Takeaways: GPT‐3 AI is capable of simplifying hard‐to‐read math word problems. The model generates noisy simplifications using text prompts or few‐shot learning methods. The noise can be filtered using text similarity and readability measures. The meaningful simplifications AI produces are sound but not ready to be used as a direct replacement for the original items. To improve test quality, simplifications can be suggested to item authors at the time of digital question authoring. Lay Description: What is Known About the Subject: Difficult to read math assessment items cause measurement and equity issuesReadability of math word problems negatively correlated with outcomes What Our Paper Adds: GPT‐3 AI system is capable to simplify math word problemsPrompt‐based and few‐shot learning‐based approaches are able to create meaningful simplifications, but with a very low accuracy rateText similarity and readability measures can be used to filter out noisy outputs and discover interesting simplifications What are the Implications for Practitioners: GPT‐3 AI is capable of generating relevant math world problem simplificationsSimplified text can be used as suggestions to question authors during the digital item authoring process [ABSTRACT FROM AUTHOR]

Network virtualization is a technology proven to be a key enabling a family of strategies in different targets, such as energy efficiency, economic revenue, network usage, adaptability or failure protection. Network virtualization allows us to adapt the needs of a network to new circumstances, resulting in greater flexibility. The allocation decisions of the demands onto the physical network resources impact the costs and the benefits. Therefore it is one of the major current problems, called virtual network embedding (VNE). Many algorithms have been proposed recently in the literature to solve the VNE problem for different targets. Due to the current successful rise of artificial intelligence, it has been widely used recently to solve technological problems. In this context, this paper investigates the requirements and analyses the use of the Q-learning algorithm for energy-efficient VNE. The results achieved validate the strategy and show clear improvements in terms of cost/revenue and energy savings, compared to traditional algorithms. [ABSTRACT FROM AUTHOR]

Fault diagnosis of interconnection networks is vital to ensuring the reliability and maintenance of multiprocessor systems. Based on graph theory, diagnostic algorithms for solving the problem of fault diagnosis in interconnection networks have been widely studied. As the number of processors in multiprocessor systems has increased in recent years, fault diagnosis algorithms based on graph theory cannot meet the current diagnosis requirements of some interconnection networks, such as t-diagnosable systems. In this paper, we use the evolution diagnosis approach to study fault diagnosis in t-diagnosable systems under the PMC model. First, for a t-diagnosable system G with a syndrome σ , we use a simple centralized algorithm to generate its simplified diagnosis graph G f , which contains all the faulty nodes in G. Based on the graph, we prove that the faulty node set in G is the minimum cover set of G f . Next, we prove that the problem of computing the minimum cover set for G f is equivalent to the problem of computing the optimal solution of a zero-one integer program. Using this result, we propose a novel genetic algorithm to solve the problem of the zero-one integer program. The simulation results show that the diagnostic accuracy of our proposed algorithm is equal to or greater than 96% and that the proposed algorithm outperforms its competitors in terms of diagnostic accuracy, number of iterations and running time. [ABSTRACT FROM AUTHOR]

In this paper, we proposed a new method for image-based grammatical inference of deterministic, context-free L-systems (D0L systems) from a single sequence. This approach is characterized by first parsing an input image into a sequence of symbols and then, using a genetic algorithm, attempting to infer a grammar that can generate this sequence. This technique has been tested using our test suite and compared to similar algorithms, showing promising results, including solving the problem for systems with more rules than in existing approaches. The tests show that it performs better than similar heuristic methods and can handle the same cases as arithmetic algorithms. [ABSTRACT FROM AUTHOR]

Due to the development of wireless network technology, various applications relying on good network quality are widely used on mobile devices. Taking the commonly used video streaming service as an example, a network with high throughput and low packet loss rate can meet the service requirements. When the moving distance of the mobile device is greater than the signal coverage of the AP, it will trigger the handover process to connect to another AP, and cause the network to disconnect and reconnect instantaneously. However, frequently triggering the handover procedure will cause a significant drop in network performance and affect the operation of application services. In order to solve this problem, this paper proposes the OHA and OHAQR. The OHA considers whether the signal quality is good or bad, and uses the corresponding HM method to solve the problem of frequent handover procedures. The OHAQR integrates the QoS requirements of the throughput and packet loss rate into the OHA with the Q-handover score, to provide high-performance handover services with QoS. Our experimental results show that the OHA and OHAQR have 13 and 15 handovers in a high-density scenario, respectively, and are better than the other two methods. The actual throughput and packet loss rate of the OHAQR are 123 Mbps and 5%, respectively, and the network performance is better than that of other methods. The proposed method shows excellent performance in ensuring the network QoS requirements and reducing the number of handover procedures. [ABSTRACT FROM AUTHOR]

To solve the problem of crane anti-swing, fuzzy PID is a common method. However, the parameter configuration of fuzzy PID requires a lot of time and effort from professionals. Based on this, we introduce the LSO algorithm and add the stray operator, which effectively improves its global search performance. By combining SLSO and fuzzy PID and comparing them with other methods, this paper confirms that even without the targeted optimization by professionals, the optimization algorithm can find the appropriate parameter configuration for fuzzy PID which can be effectively used in the crane anti-swing problem. [ABSTRACT FROM AUTHOR]

In order to improve the signal detection capability of orthogonal frequency-division multiplexing systems, a signal detection method based on an improved LSTM network for OFDM systems is proposed. The LSTM network is optimized by the Chameleon Swarm Algorithm (CLCSA) with the coupling variance and lens-imaging learning. The signal detection method based on the traditional LSTM network has the problem of a complex manual tuning process and insufficient stability. To solve the above problem, the improved Chameleon Swarm Algorithm is used to optimize the initial hyperparameters of the LSTM network and obtain the optimal hyperparameters. The optimal hyperparameters initialize the CLCSA-LSTM network model and the CLCSA-LSTM network model is trained. Finally, the trained CLCSA-LSTM network model is used for signal detection in the OFDM system. The simulation results show that the signal detection performance of the OFDM receiver has been significantly improved, and the dependence on CP and pilot overhead can be reduced. Under the same channel environment, the proposed method in this paper has better performance than other signal detection methods, and is close to the performance of the MMSE method, but it does not need prior statistical characteristics of the channel, so it is easy to implement. [ABSTRACT FROM AUTHOR]

Security of vector maps is of importance in the community of geographic information sciences. Although some encryption techniques can protect vector maps from piracy, they need to decrypt the entire map in order to extract parts of the data, which obviously brings inconvenience to the users. To solve the problem, an encryption algorithm for vector maps based on Gaussian random and Haar transform is proposed in this paper. First, all vertices are randomized via the Gaussian random method to get the shuffled vector map coordinates. Then, the average coefficient and the differential coefficient generated by the Haar transform are encrypted. Lastly, the encrypted map data is obtained through performing the inverse Haar transformation. Experiments show that (1) the proposed algorithm guarantees authorized users can decrypt any parts (layers) of encrypted vector maps; and (2) the algorithm outperforms other existing encryption methods in security and efficiency. [ABSTRACT FROM AUTHOR]

In this paper, we consider an iterative approximation problem of split variational inequalities in Hilbert spaces. In order to solve this split problem, we construct an iterative algorithm which combines a forward-backward-forward method and a self-adaptive rule to update the step-sizes. We prove that the constructed algorithm converges strongly to a solution of the split variational inequalities under some mild assumptions. [ABSTRACT FROM AUTHOR]

Star identification plays a key role in spacecraft attitude measurement. Currently, most star identification algorithms tend to perform well only in a scene without noise and are highly sensitive to noise. To solve this problem, this paper proposes a star identification algorithm based on the maximum spanning tree (MST) index and multi-order continuous cycle angle (CCA) intended for the lost-in-space mode. In addition, a neighboring star selection method named dynamic eight-quadrant (DEQ) is developed. First, the DEQ method is used to select high-confidence neighboring stars for the main star. Then, the star image is regarded as a graph, and the Prim algorithm is employed to construct the MST pattern for each guide star, which is then combined with the K vector index to perform the main star candidate search. Finally, the Jackard similarity voting for the multi-order CCA of the main star is used to identify the main star, and the global neighboring star identification is conducted by the multi-order CCA of neighboring stars. The simulated and real star images test results show that compared with five mainstream algorithms, when the position noise is 1 pixel, the number of false stars is five, the magnitude noise is 0.5, and the identification accuracy of the proposed algorithm is higher than 98.5%. Therefore, the proposed algorithm has excellent anti-noise ability in comparison to other algorithms. [ABSTRACT FROM AUTHOR]

Purpose: Wire and arc additive manufacturing (WAAM) is a widely used advanced manufacturing technology. If the surface defects occurred during welding process cannot be detected and repaired in time, it will form the internal defects. To address this problem, this study aims to develop an in situ monitoring system for the welding process with a high-dynamic range imaging (HDR) melt pool camera. Design/methodology/approach: An improved you only look once version 3 (YOLOv3) model was proposed for online surface defects detection and classification. In this paper, improvements were mainly made in the bounding box clustering algorithm, bounding box loss function, classification loss function and network structure. Findings: The results showed that the improved model outperforms the Faster regions with convolutional neural network features, single shot multibox detector, RetinaNet and YOLOv3 models with mAP value of 98.0% and a recognition rate of 59 frames per second. And it was indicated that the improved YOLOv3 model satisfied the requirements of real-time monitoring well in both efficiency and accuracy. Originality/value: Experimental results show that the improved YOLOv3 model can solve the problem of poor performance of traditional defect detection models and other deep learning models. And the proposed model can meet the requirements of WAAM quality monitoring. [ABSTRACT FROM AUTHOR]

In the field of AGV, a path planning algorithm is always a heated area. However, traditional path planning algorithms have many disadvantages. To solve these problems, this paper proposes a fusion algorithm that combines the kinematical constraint A* algorithm and the following dynamic window approach algorithm. The kinematical constraint A* algorithm can plan the global path. Firstly, the node optimization can reduce the number of child nodes. Secondly, improving the heuristic function can increase efficiency of path planning. Thirdly, the secondary redundancy can reduce the number of redundant nodes. Finally, the B spline curve can make the global path conform to the dynamic characteristics of AGV. The following DWA algorithm can be dynamic path planning and allow the AGV to avoidance moving obstacle. The optimization heuristic function of the local path is closer to the global optimal path. The simulation results show that, compared with the fusion algorithm of traditional A* algorithm and traditional DWA algorithm, the fusion algorithm reduces the length of path by 3.6%, time of path by 6.7% and the number of turns of final path by 25%. [ABSTRACT FROM AUTHOR]

In this paper, we propose a new inertial iterative method to solve classical variational inequalities with pseudomonotone and Lipschitz continuous operators in the setting of a real Hilbert space. The proposed iterative scheme is basically analogous to the extragradient method used to solve the problems of variational inequalities in real Hilbert spaces. The strong convergence of the proposed algorithm is set up with the prior knowledge of Lipschitz's constant of an operator. Finally, several computational experiments are listed to show the applicability and efficiency of the proposed algorithm. [ABSTRACT FROM AUTHOR]

To solve the problem of text clustering according to semantic groups, we suggest using a model of a unified lexico-semantic bond between texts and a similarity matrix based on it. Using lexico-semantic analysis methods, we can create "term–document" matrices based both on the occurrence frequencies of words and n-grams and the determination of the degrees of nodes in their semantic network, followed by calculating the cosine metrics of text similarity. In the process of the construction of the text similarity matrix using lexical or semantic analysis methods, the cosine of the angle for a vector pair describing such texts will determine the degree of similarity in the lexical or semantic presentation, respectively. Based on the averaging procedure described in this paper, we can obtain a matrix of cosine metric values that describes the lexico-semantic bonds between texts. We propose an algorithm for solving text clustering problems. This algorithm allows one to use the statistical characteristics of the distribution functions of element values in the rows of the cosine metric value matrix in the model of the lexico-semantic bond between documents. In addition, this algorithm allows one to separately describe the matrix of the cosine metric values obtained separately based on the lexical or semantic properties of texts. Our research has shown that the developed model for the lexico-semantic presentation of texts allows one to slightly increase the accuracy of their subsequent clustering. The statistical text clustering algorithm based on this model shows excellent results that are comparable to those of the widely used affinity propagation algorithm. Additionally, our algorithm does not require specification of the degree of similarity for combining vectors into a common cluster and other configuration parameters. The suggested model and algorithm significantly expand the list of known approaches for determining text similarity metrics and their clustering. [ABSTRACT FROM AUTHOR]

Most of the existing steganalysis methods have weak generalization ability and cannot effectively detect unknown steganalysis algorithms, which makes the accuracy of their classification greatly reduced in the practical application process. To solve this problem, this paper proposed an image steganalysis method based on group convolution and snapshot ensembling（Snapshot Ensembling steganalysis network, SENet）. Firstly, residual convolution block and group convolution block are used to extract the features of the image. Secondly, the model with the best performance is obtained as the snapshot model in each training period. Finally, the selected snapshot models are integrated to classify the images. This method uses the techniques of group convolution and snapshot ensembling to avoid the high training cost of traditional integration methods and the limited generalization ability of a single classifier. Experimental results show that this method can improve the accuracy of steganographic analysis model, and can effectively classify when the training set and test set are mismatched, and has high model generalization ability. [ABSTRACT FROM AUTHOR]

High-quality learning low-dimensional representation of nodes in the graph is a current research hotspot. The existing shallow model methods cannot capture the nonlinear relationship of the graph structure, and the graph convolution model in the graph neural network technology will cause an over-smoothing problem. At the same time, how to determine the role of different hop number relationships in graph representation learning is also a problem that needs to be solved in the research. To solve the above problems, this paper proposes a deep learning model based on T（T＞1） feedforward neural networks. The framework uses deep learning models to extract the nonlinear relationship of the graph structure, and T sub-models effectively capture the local and global（higher-order） relationship information of the graph, and they give different roles in the final vector representation to take advantage of different hop relations. Experimental results on vertex classification and link prediction tasks show that the framework is competitive with existing methods, the benchmark algorithm can be improved by about 20%. [ABSTRACT FROM AUTHOR]

Most sequential recommendation systems（SRSs） assume that the next item to be predicted is related to the user’s previous input. However, in real scenarios, users may click items inconsistent with their own interests and preferences（unreliable instances） by mistake during browsing. This paper proposes a sequential recommendation algorithm based on Gaussian distribution modeling to solve this problem. Firstly, the algorithm extracts the input sequence patterns by reducing the uncertainty of input items through an uncertainty aware graph ensemble network（UAN） with multiple heads of self-attention; Secondly, the extracted input sequence pattern is modeled as a Gaussian distribution, and obtain the dynamic user’s preferences and the uncertainty of preferences in the sequence information; Then, extend the traditional recommended objective function to a sampling loss function and an uncertainty regularizer, and give each training instance appropriate uncertainty; Finally, remove the unreliable examples with high loss and low uncertainty to enhance the accuracy of sequence recommendation. The algorithm is tested on three open datasets, Book Cross, Movielens-1 M and Steam. The results show that the algorithm has achieved an improvement of about 5.3% compared with the baseline with good effects, and has obtained better sequential recommendation results. The proposed algorithm can improve the recommendation accuracy by effectively reducing the uncertainty of input sequence information. [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]

Interactive image segmentation uses a priori information to guide the acquisition of the people ' s interesting parts of an image, but existing algorithms cannot balance efficiency and accuracy. To solve this problem, this paper proposed a fast interactive segmentation algorithm based on superpixel and random walk (random walk on superpixel, SPRW) . Firstly, it presegmented the image into superpixel regions with local similarity and used pixel colour averages to represent the superpixel regions. Secondly, it built the F-B graph structure based on manually labelled a priori information and extended the range of the random walk, obtained the hard segmentation results using the random walk solution. Finally, this paper proposed the improved matting algorithm (fast robust matting, FRB ) for the unsmooth boundaries of segmentation results and performed the secondary process to obtain soft segmentation results. Experiments on the BSDSOO and MSRC datasets confirm that the proposed hard method is superior to other algorithms in terms of time and average intersection ratio, while experiments on the Alpha Matting dataset demonstrate that the proposed soft algorithm improves efficiency and accuracy. In addition, the experiment of replacing the background of a life photograph demonstrates the application value of the proposed algorithm. [ABSTRACT FROM AUTHOR]

To solve the problem that existing botnet detections targeted a single phase of the botnet lifecycle, this paper proposed an online botnet detection method based on ensemble learning. Firstly, this paper fine-grained labeled the traffic of multiple phases of botnet lifecycle to generate a botnet dataset. Secondly, this paper combined multiple feature selection algorithms to generate a significant feature set containing 23 features and a less significant feature set containing 28 features. It integrated multiple deep learning models based on stacking ensemble learning and provided different input feature sets for different primary class ifiers to obtain a botnet online detection model. Finally, this paper deployed the botnet online detection model to detect multiple botnets online at the network entrance. Experiment shows that the proposed botnet online detection method based on ensemble learning in this paper can effectively detect multiple stages of botnet traffic, and the malicious traffic detection rate can reach 96 . 47% . [ABSTRACT FROM AUTHOR]

Object tracking based on Siamese networks has achieved great success in recent years, but increasingly advanced trackers are also becoming cumbersome, which will severely limit deployment on resource-constrained devices. To solve the above problems, we designed a network with the same or higher tracking performance as other lightweight models based on the SiamFC lightweight tracking model. At the same time, for the problems that the SiamFC tracking network is poor in processing similar semantic information, deformation, illumination change, and scale change, we propose a global attention module and different scale training and testing strategies to solve them. To verify the effectiveness of the proposed algorithm, this paper has done comparative experiments on the ILSVRC, OTB100, VOT2018 datasets. The experimental results show that the method proposed in this paper can significantly improve the performance of the benchmark algorithm. [ABSTRACT FROM AUTHOR]

In the research and application of images, people are often only interested in the foreground or specific area of the image, so it is necessary to extract the specific area from the image, and image segmentation technology is the key to solving this problem. Aiming at the complex background and the color image with unclear target contour as the target image to be segmented, this paper first uses the texture and color of the image as the feature vector, and proposes an image segmentation algorithm based on SVM. The experimental results show that the segmentation accuracy is 91.23%. Secondly, in order to improve the accuracy of segmentation, the SVM algorithm is improved. The improved SVM algorithm is based on the grid search method to optimize the parameters C and g in the SVM. At the same time, the HIS color channel is added to the feature vector to obtain more Excellent SVM image segmentation model. Finally, the color image segmentation is verified and compared with the standard SVM algorithm. The experimental results show that the accuracy rate of the improved SVM algorithm reaches 97.263%, which improves the segmentation efficiency. It is verified that the improved model proposed in this paper can effectively segment complex color images. [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]

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]

Channel state information (CSI) provides a fine-grained description of the signal propagation process, which has attracted extensive attention in the field of indoor positioning. The CSI signals collected by different fingerprint points have a high degree of discrimination due to the influence of multi-path effects. This multi-path effect is reflected in the correlation between subcarriers and antennas. However, in mining such correlations, previous methods are difficult to aggregate non-adjacent features, resulting in insufficient multi-path information extraction. In addition, the existence of the multi-path effect makes the relationship between the original CSI signal and the distance not obvious, and it is easy to cause mismatching of long-distance points. Therefore, this paper proposes an indoor localization algorithm that combines the multi-head self-attention mechanism and effective CSI (MHSA-EC). This algorithm is used to solve the problem where it is difficult for traditional algorithms to effectively aggregate long-distance CSI features and mismatches of long-distance points. This paper verifies the stability and accuracy of MHSA-EC positioning through a large number of experiments. The average positioning error of MHSA-EC is 0.71 m in the comprehensive office and 0.64 m in the laboratory. [ABSTRACT FROM AUTHOR]

In the paper we define three new complexity classes for Turing Machine undecidable problems inspired by the famous Cook/Levin's NP-complete complexity class for intractable problems. These are U-complete (Universal complete), D-complete (Diagonalization complete) and H-complete (Hypercomputation complete) classes. In the paper, in the spirit of Cook/Levin/Karp, we started the population process of these new classes assigning several undecidable problems to them. We justify that some super-Turing models of computation, i.e., models going beyond Turing machines, are tremendously expressive and they allow to accept arbitrary languages over a given alphabet including those undecidable ones. We prove also that one of such super-Turing models of computation - the $-Calculus, designed as a tool for automatic problem solving and automatic programming, has also such tremendous expressiveness. We investigate also completeness of cost metrics and meta-search algorithms in $-calculus. [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]

This paper proposes the analysis and design of the linear active disturbance rejection controller (LADRC) for the pitch angle model of a large wind turbine generator (WTG). Since the transfer function of the pitch control system exhibits nonminimum-phase characteristics, the parameters of LADRC are difficult to tune using the conventional bandwidth method. On the basis of PI controller parameters to first-order LADRC parameters, an optimization problem is proposed in this paper to find the parameters of an LADRC for the pitch control system under the constraint of robustness measure, and the extremum-seeking (ES) algorithm is used to solve the problem. Simulation results show that LADRC can achieve better tracking and disturbance rejection performance than traditional PI control without loss of robustness against time delay. [ABSTRACT FROM AUTHOR]

In the paper, we proposed a deep learning-based industrial equipment detection algorithm ROMS R-CNN (Rotation Occlusion Multi-Scale Region-CNN). It can solve the problem of inaccurate detection of industrial equipment under complex working conditions such as multi-scale ratio, rotation tilt, occlusion and overlap. The method proposed in this paper first is to construct the MobileNetV2 as the feature pyramid network, and then to combine high semantic information with high resolution information solved industrial equipment detection of different scales. Secondly, a specific rotation anchor scheme is proposed, and the data set is clustered through the k-means algorithm to obtain a specific aspect ratio. Combined with the rotation angle, a rotation anchor of any direction and size is generated to solve the problem of easy tilting of industrial equipment. Finally, a Non-Maximum Suppression algorithm with penalty factors is introduced to solve the overlapping in industrial equipment detection. The experimental results in common industrial equipment detection show that this method is better than other algorithms, significantly improves the missed detection and false detection, and the mAP reaches 0.939. [ABSTRACT FROM AUTHOR]

This paper proposed a natural language sentence matching method that combined high-level and low-level semantic information to solve the problems about current natural language sentence matching method fail to integrate common semantic information and it is difficult to capture deep-semantic information. First of all, the method used pre-trained word vector GloVe and character-level word vector to obtained the word embedding representation of sentence P and sentence Q. Secondly, this paper encode red P and Q with bidirectional LSTM, then it contained low-level semantic information through preliminary fusion of P and Q. Thirdly, this paper calculated bidirectional attention between P and Q, then spliced them together to get semantic representation, afterwards it calculated its self-attention to obtained high-level semantic information. Finally, this paper used a heuristic fusion function to fuse the low-level semantic information with the high-level semantic information to obtain the final semantic representation, and it used a convolutional neural network to prediction answers. This paper evaluated the proposed model on two tasks, such as recognition textual entailment, paraphrase recognition. This paper conducted experiments on the SNLI dataset and the Quora dataset. The results show that the accuracy of the proposed algorithm on the SNLI test set is 87. 1%, and the accuracy of the Quora test set is 86. 8%, which verifies the effectiveness of the algorithm in the task of natural language sentence matching. [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]

Typically, devices work to improve life quality, measure parameters, and make decisions. They also signalize statuses, and take actions accordingly. When working, they measure different values. These are to be compared against thresholds. Some time ago, vision systems came into play. They use camera(s) to deliver(s) images to a processor module. The received images are processed to perform detections (typically, they focus to detect objects, pedestrians, mopeds, cyclists, etc.). Images are analyzed and thresholds are used to compare the computed values. The important thing is that images are affected by noise. Therefore, the vision system performance can be affected by weather in some applications (for example, in automotive). An interesting case in this domain is when the measured/computed values show small variations near the threshold (not exceeding) but very close to it. The system is not able to signalize/declare a state in this case. It is also important to mention that changing the threshold does not guarantee solving the problem in any future case, since this may happen again. This paper proposes the Alpha-Beta family of filters as a solution to this problem. The members can track a signal based on measured values. This reveals errors when the tracked-signal's first derivative changes sign. These errors are used in this paper to bypass the threshold problem. Since these errors appear in both situations (when the first derivative decreases from positive to negative and increases from negative to positive), the proposed method works when the observed data are in the vicinity of the threshold but above it. [ABSTRACT FROM AUTHOR]

In the field of intelligent manufacturing, robot grasping and sorting is important content. However, there are some disadvantages in the traditional single-view-based manipulator grasping methods by using a 2D camera, where the efficiency and the accuracy of grasping are both low when facing the scene of stacking and occlusion for the reason that there is information missing by single-view 2D camera-based methods while acquiring scene information, and the methods of grasping only can't change the difficult-to-grasp scene which is stack and occluded. Regarding the issue above, a pushing-grasping collaborative method based on the deep Q-network in dual viewpoints is proposed in this paper. This method in this paper adopts an improved deep Q-network algorithm, with an RGB-D camera to obtain the information of objects' RGB images and point clouds from two viewpoints, which solved the problem of lack of information missing. What's more, it combines the pushing and grasping actions with the deep Q-network, which make it have the ability of active exploration, so that the trained manipulator can make the scenes less stacking and occlusion, and with the help of that, it can perform well in more complicated grasping scenes. In addition, we improved the reward function of the deep Q-network and propose the piecewise reward function to speed up the convergence of the deep Q-network. We trained different models and tried different methods in the V-REP simulation environment, and it drew a conclusion that the method proposed in this paper converges quickly and the success rate of grasping objects in unstructured scenes raises up to 83.5%. Besides, it shows the generalization ability and well performance when novel objects appear in the scenes that the manipulator has never grasped before. [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]

Network representation learning can effectively solve the problem of data sparsity in recommendation. In this paper, LINE and DeepWalk in network representation learning were improved, and a hybrid recommendation algorithm was proposed to be applied to movie recommendation scene. The new algorithm generates three low dimensional feature vectors by learning user preference feature, user aversion feature and similar user feature. Three low dimensional feature vectors are linearly combined to form a user representation vector, and cosine similarity is used as the similarity index to recommend the movies associated with similar users to target users. Experimental results show that, compared with the suboptimal algorithm, the accuracy and Fl index of the proposed algorithm are improved by 12% and 7% respectively on MovieLens dataset, and 16% and 18% respectively on MovieTweetings dataset. The recommendation algorithm based on multi-dimensional feature representation learning proposed in this paper has significant advantages in movie recommendation scenes. [ABSTRACT FROM AUTHOR]

Aiming at the problems of parallel support vector machine (SVM) algorithm in big data environment such as redundant data sensitivity, difficulty in parameter selection, and low parallelization efficiency, this paper proposed a parallel SVM algorithm using Relief and bacterial foraging optimization (BFO) algorithm based on MapReduce (RBFO-PSVM). Firstly, the algorithm designed a feature weight calculation strategy (MI-Relief), which used mutual information to improve the weight calculation function of Relief algorithm to eliminate redundant features in the data set and effectively reduce redundant data to support parallelism. Secondly, this paper proposed a hybrid BFO algorithm based on MapReduce (MR-HBFO), which selected the optimal parameters of SVM in parallel, and solved the problem of difficult selection of SVM parameters. Finally, it proposed the kernel clustering strategy (KCS) to reduce the size of the data set involved in parallel training, and proposed a cross-fusion cascaded parallel SVM (CFCPSVM) to improve the cascade SVM (CSVM) feedback mechanism. It trained SVM by combining with the Map Reduce programming framework, and this improved the parallelization efficiency of parallel SVM. Experiments show that the RBFO-PSVM algorithm has a better classification effect on large data sets and is more suitable for large data environments. [ABSTRACT FROM AUTHOR]

In this paper, we propose a control framework for intelligent surgical robots under the Remote Center of Motion (RCM). The goal of a surgical robot is to assist surgeons in performing complex surgeries. RCM constraint implies that the surgical tip attached to the end-effector of the surgical robot does not slide away from the point of the incision while performing surgery. Implementation of a control algorithm to comply with RCM constraints is a complicated task because of the nonlinear model of the surgical robots and stringent conditions of accuracy imposed by the patient's safety. This paper proposes an optimization-driven approach to perform the surgical maneuver under RCM constraints. We then applied a bio-inspired optimization algorithm to solve the problem efficiently. For testing the performance of ZNNBAS, we used MATLAB to simulate a surgical procedure. A 7-DOF surgical robot (KUKA LBR IIWA 7) was used as a test bench for running the simulations. The simulation results show that the ZNNBAS is comparable with BAS, PSO, and GA and efficiently and robustly performed the task commanded maneuvers while enforcing the RCM constraints. [ABSTRACT FROM AUTHOR]

Influence maximization (IM) is a problem of selecting k nodes from social networks to make the expected number of the active node maximum. Recently, with the popularity of Internet technology, more and more researchers have paid attention to this problem. However, the existing influence maximization algorithms with high accuracy are usually difficult to be applied to the large-scale social network. To solve this problem the paper proposes a new algorithm, called community-based influence maximization (ComIM). Its core idea is "divide and conquer". In detail, this algorithm first utilizes the Louvain algorithm to divide the large-scale networks into some small-scale networks. Afterwards, the algorithm utilizes the one-hop diffusion value (ODV) and two-hop diffusion value (TDV) functions to calculate the influence of a node and select nodes on these small-scale networks, which can improve the accuracy of our proposed algorithm. By using the above methods, the paper proposes a community influence-estimating method called CDV, which can improve the efficiency of the algorithm. Experimental results on six real-world datasets demonstrate that our proposed algorithm outperforms all comparison algorithms when comprehensively considering the accuracy and efficiency. [ABSTRACT FROM AUTHOR]

One of the main aims of the paper is to develop the mesh geometry technique for corank-two edge-bipartite graphs Δ with n + 2 ≥ 3 vertices, and the mesh algorithms introduced in [30,33] and successfully studied in our recent article [42]. We introduce and study the concept of a self-duality of mesh geometries Γ ( R ˆ Δ , Φ Δ) viewed as Φ Δ -mesh translation quivers. We show how self-dualities of mesh geometries Γ ( R ˆ Δ , Φ Δ) and the mesh geometry technique is applied to an affirmative algorithmic solution of so called Horn-Sergeichuk type problem [9, Problem 4.3] on the self-congruency of square integer matrices A ∈ M n + 2 (Z) , for the class of non-symmetric Gram matrices A = G ˇ Δ of corank-two loop-free edge-bipartite graphs Δ, with n + 2 ≤ 6 vertices. More precisely, we show that each of the mesh geometries Γ ( R ˆ Δ , Φ Δ) is self-dual, we construct its dual form Γ ( R ˆ Δ , Φ Δ) o p = Γ ( R ˆ Δ , Φ Δ − 1) isomorphic with Γ ( R ˆ Δ , Φ Δ) , and we construct a canonical self-duality isomorphism f Δ : Γ ( R ˆ Δ , Φ Δ) → Γ ( R ˆ Δ , Φ Δ) o p of mesh translation quivers. Using the self-duality f Δ we construct combinatorial algorithms such that, given a square Gram matrix A = G ˇ Δ ∈ M n + 2 (Z) of Δ lying in this class, they are able to compute a Z -invertible matrix B ∈ M n + 2 (Z) that coincide with its inverse B − 1 and defines the congruence of A with A t r , i.e., the equation A t r = B t r ⋅ A ⋅ B is satisfied. An idea of our solution is outlined in Section 8 of our recent article [42] , where among others two of our 13 algorithms solving the problem are constructed. The remaining 11 algorithms are constructed in the present article. We do it by means of the structure of the standard self-dual Φ Δ -mesh translation quiver Γ ( R ˆ Δ , Φ Δ) (called a geometry) canonically associated with Δ, consisting of Φ Δ -meshes of Φ Δ -orbits O Δ (w) of vectors w ∈ R ˆ Δ ⊆ Z n + 2 , where Φ Δ : Z n + 2 → Z n + 2 is the Coxeter transformation of Δ. We construct in the paper such self-dual Φ Δ -mesh geometry Γ ( R ˆ Δ , Φ Δ) , for each of the corank-two loop-free edge-bipartite graphs Δ, with n + 2 ≤ 6 vertices. [ABSTRACT FROM AUTHOR]

This paper studies the reliable uncapacitated facility location problem in which facilities are subject to uncertain disruptions. A two-stage distributionally robust model is formulated, which optimizes the facility location decisions so as to minimize the fixed facility location cost and the expected transportation cost of serving customers under the worst-case disruption distribution. The model is formulated in a general form, where the uncertain joint distribution of disruptions is partially characterized and is allowed to have any prespecified dependency structure. This model extends several related models in the literature, including the stochastic one with explicitly given disruption distribution and the robust one with moment information on disruptions. An efficient cutting plane algorithm is proposed to solve this model, where the separation problem is solved respectively by a polynomial-time algorithm in the stochastic case and by a column generation approach in the robust case. Extensive numerical study shows that the proposed cutting plane algorithm not only outperforms the best-known algorithm in the literature for the stochastic problem under independent disruptions but also efficiently solves the robust problem under correlated disruptions. The practical performance of the robust models is verified in a simulation based on historical typhoon data in China. The numerical results further indicate that the robust model with even a small amount of information on disruption correlation can mitigate the conservativeness and improve the location decision significantly. Summary of Contribution: In this paper, we study the reliable uncapacitated facility location problem under uncertain facility disruptions. The problem is formulated as a two-stage distributionally robust model, which generalizes several related models in the literature, including the stochastic one with explicitly given disruption distribution and the robust one with moment information on disruptions. To solve this generalized model, we propose a cutting plane algorithm, where the separation problem is solved respectively by a polynomial-time algorithm in the stochastic case and by a column generation approach in the robust case. The efficiency and effectiveness of the proposed algorithm are validated through extensive numerical experiments. We also conduct a data-driven simulation based on historical typhoon data in China to verify the practical performance of the proposed robust model. The numerical results further reveal insights into the value of information on disruption correlation in improving the robust location decisions. [ABSTRACT FROM AUTHOR]

In order to improve the safety and smoothness of flight, and solve the problems of excessive turning angle and too many search path nodes in the traditional A• algorithm, this paper proposed a synchronous bi-directional A• search algorithm based on sector field expansion. Firstly, this paper extended the hazardous area boundaries based on the raster map method. Secondly, it designed the A• algorithm based on synchronous bi-directional search, which dynamically defined the target nodes for forward and reverse search. Aiming at the problem of limiting search angles, this paper proposed a sector expansion strategy in 5 x 5 domain, and designed an evaluation function with double weight parameters to reduce the generation of redundant points. Finally, in order to verify the effectiveness of the improved algorithm, this paper selected square and irregular shape hazard areas for simulation. The results show that the improved algorithm searches for a smoother path. Compared with the results of the traditional bi-directional A• algorithm, the length of its search path reduce by 1. 65% and 13. 16%, and the number of its search path nodes reduce by 42. 6% and 46. 81 %, respectively, under different shapes of hazard areas, which has a strong search efficiency. [ABSTRACT FROM AUTHOR]

In order to solve the problem of collision free path planning and system efficiency improvement of multi AGV in dynamic unstable environment, this paper proposed a collision free path planning method based on time window for AGV. Firstly, this paper established a multi-AGV collision avoidance model, combined with the time window model, and divided the collisionfree path planning of multiple AGV into two stages: pre-planning and real-time planning. In the pre-planning stage, this paper calculated the conflict-free time window of multiple AGV and maximized the circulation of AGV in the system. In the real-time planning stage, this paper used the method of changing the AGV' s occupancy priority on the collision avoidance model and local re-planning to dynamically avoid collisions. Finally, a simulation experiment with a smart warehouse as an application case proves that the algorithm can effectively avoid the collision of multiple AGV, increase the circulation of AGV, and has good robustness and flexibility in a dynamic environment. [ABSTRACT FROM AUTHOR]

Harris hawks optimization (HHO) is a new meta-heuristic algorithm that builds a model by imitating the predation process of Harris hawks. In order to solve the problems of poor convergence speed caused by uniform choice position update formula in the exploration stage of basic HHO and falling into local optimization caused by insufficient population richness in the later stage of the algorithm, a Harris hawks optimization based on global cross-variation and tent mapping (CRTHHO) is proposed in this paper. Firstly, the tent mapping is introduced in the exploration stage to optimize random parameter q to speed up the convergence in the early stage. Secondly, the crossover mutation operator is introduced to cross and mutate the global optimal position in each iteration process. The greedy strategy is used to select, which prevents the algorithm from falling into local optimal because of skipping the optimal solution and improves the convergence accuracy of the algorithm. In order to investigate the performance of CRTHHO, experiments are carried out on ten benchmark functions and the CEC2017 test set. Experimental results show that the CRTHHO algorithm performs better than the HHO algorithm and is competitive with five advanced meta-heuristic algorithms. [ABSTRACT FROM AUTHOR]

Single-view 3D reconstruction based on deep learning is a research hot spot at present. In order to discover more high-frequency details, SDF-SRN algorithm introduces positional encoding, but neural network is easy to overfit without accurate supervision, and reconstructs uneven surface. To solve the problem, this paper proposed the network model based on sparse feature. The model enabled the network that preferred to overfitting to predict high-frequency residual by residual learning. The feature extraction network extracted sparse features and the global features. Then one hypernetwork took the sparse features as input and generated prediction shallow head. This shallow head predicted low-frequency part of signed distance function. Another hypernetwork took global features as input and generated another shallow head. This shallow head predicted high-frequency residual. It fused two predictions of shallow heads into final signed distance function. Spectrum analysis shows that the design purpose of network is achieved. Compared with other smooth surface reconstruction schemes, the network can achieve smoother surface reconstruction with enough details. It overcomes the overfitting of SDF-SRN. The qualitative and quantitative comparison with other advanced single-view reconstruction approaches show the superiority of the proposed approach. [ABSTRACT FROM AUTHOR]