Search

Recently, a chaotic secure video communication system based on FPGA is proposed, which essentially encrypts the original image data of each frame in the video in multiple rounds by using the 6D self-synchronizing chaotic stream cipher. In this paper, the security performance of the multiround encryption algorithm is analyzed based on divide-and-conquer attack. In the case of one round encryption, the keys ψ i j (1 ≤ i ≤ 3 , 1 ≤ j ≤ 6) can be deciphered by setting 30 appropriate initial conditions according to known-plaintext attack. After that, according to chosen-ciphertext attack, the chaotic iterative equation of the decryption end is degenerated into a linear one if ciphertexts are all set to zero. Under this condition, the equations between the unknown keys and the plaintext-ciphertext pairs can be obtained by setting 24 appropriate initial conditions, and the keys ψ i j (4 ≤ i ≤ 6 , 4 ≤ j ≤ 6) can be deciphered by solving the equations in Mathematica. Secondly, in order to reduce the multiplication times of the unknown keys in the case of two-round encryption, the number of pixels in an image can be selected as little as possible. According to chosen-ciphertext attack, when the number of the pixels in an image is only one, the keys ψ i j (1 ≤ i ≤ 3 , 1 ≤ j ≤ 6) can be deciphered by setting 30 appropriate initial conditions. Then, when the number of pixels in an image is two, the keys ψ i j (4 ≤ i ≤ 6 , 4 ≤ j ≤ 6) can be deciphered by setting 24 appropriate initial conditions. However, in the case that the encryption round is three or more, the keys cannot be deciphered by the attack method proposed in this paper. The analysis results show that the multiround image encryption algorithm is not secure when the number of encryption rounds is one or two. [ABSTRACT FROM AUTHOR]

The price of the product has a great impact on the market competitiveness of the product. The manager can adjust the operation strategy according to the cost information of the product, cut costs, adjust the market decision and make the product more competitive in the market. Therefore, the research of product costing method has a very important significance. Considering that the physical resources in the processing of the virtual network mapping (VNM) fragment embedded in the request are rejected, and the problem of physical resource usage is weakened, a VNM algorithm based on the optimal subnet edge matching algorithm is proposed. After the VNM request is coarsened to the subnet, the breadth-first search algorithm is used to create the physical subnet candidate set, and the constraints of the virtual node and the coarsening network topology are complied with. The simulation results show that the proposed algorithm reduces the number of link mapping hops and can improve the acceptance rate and cost-benefit ratio of virtual networks. First of all, this paper analyzes the research background of manufacturing cost calculation and the research situation at home and abroad, discusses the advantages and disadvantages of standard cost calculation and studies and analyzes the principles, advantages and disadvantages of standard cost calculation in daily business activities. Second, design a new mathematical accounting model based on the mathematical model of standard cost calculation in daily business activities. This combines the advantages of standard costing and time-based activity costing, and provides theoretical support for manufacturing companies to use this accounting method. Finally, the research results of this paper are summarized, and the shortcomings of this paper are analyzed. Cost accounting method needs to be further studied. [ABSTRACT FROM AUTHOR]

In Blind Hyperspectral Unmixing, the accuracy of the estimated number of endmembers affects the succeeding steps of extraction of endmember signatures and acquiring their fractional abundances. The characteristics of endmember signature depend on the nature of the material on the ground and share similar characteristics for variants of the same material. In this paper, we introduce a new concept of sub-endmembers to identify similar materials that are variants of a global endmember. Identifying the sub-endmembers will provide a meaningful interpretation of the endmember variability along with increased unmixing accuracy. This paper proposes a new algorithm exploiting both the spatial and spectral information present in hyperspectral data. The hyperspectral data are segmented into homogenous regions (superpixels) based on the Simple Linear Iterative Clustering (SLIC) algorithm, and the mean spectral of each region is accounted for in finding the global endmembers. The difference of eigenvalues-based thresholding method is used to find the number of global and sub-endmembers. The method has been tested on synthetic and real hyperspectral data and has successfully estimated the number of global endmembers as well as sub-endmembers. The method is also compared with other state-of-the-art methods, and better performances are obtained at a reasonably lower computational complexity. [ABSTRACT FROM AUTHOR]

This paper proposes a novel method for the image interpolation problem based on two-dimensional discrete wavelet transform (DWT) with the edge preserving approach. The purpose of this method is to consider two contrasting issues of over-smoothing and creation of spurious edges at the same time, and offer a novel solution based on statistical dependencies of image sub-bands, and noise behavior. The offered method has a multi-faceted approach for the problem; by sub-band coding, it handles each 2D-DWT image sub-band with a different solution. For LH and HL sub-bands, two algorithms work together in order to preserve regularity. Area_Check algorithm is a four-phase edge-preserving algorithm that aims to recognize and interpolate separating lines of environments and edgy regions in the best possible way. On the other hand, RLS_AVG algorithm interpolates smooth surfaces of the image by keeping the regularity of the image without over-smoothing. In this regard, the offered algorithm has a great power to counter jaggies and annoying artifacts. In the end, in order to demonstrate the capability, and performance of the proposed method, the final results in various metrics are compared with the results of the most famous and the newest image interpolation methods. [ABSTRACT FROM AUTHOR]

Tremendous efficient optimization methods have been proposed for strongly convex objectives optimization in modern machine learning. For non-strongly convex objectives, a popular approach is to apply a reduction from non-strongly convex to a strongly convex case via regularization techniques. Reduction on objectives with adaptive decrease on regularization tightens the optimal convergence of algorithms to be independent on logarithm factor. However, the initialization of parameter of regularization has a great impact on the performance of the reduction. In this paper, we propose an aggressive reduction to reduce the complexity of optimization for non-strongly convex objectives, and our reduction eliminates the impact of the initialization of parameter on the convergent performances of algorithms. Aggressive reduction not only adaptively decreases the regularization parameter, but also modifies regularization term as the distance between current point and the approximate minimizer. Our aggressive reduction can also shave off the non-optimal logarithm term theoretically, and make the convergent performance of algorithm more compact practically. Experimental results on logistic regression and image deblurring confirm this success in practice. [ABSTRACT FROM AUTHOR]

In this paper, we propose an applicable algorithm of the so-called adaptive Fourier decomposition in H 2 (ℂ +) the Hardy H 2 space on the upper half-plane ℂ + , which provides a new method for decomposing real-valued signals and analytic signals on the real line. As a by-product, a new approach for computing the Hilbert transform on the real line is also given. Numerical experiments are used to demonstrate the performance of the proposed algorithm. [ABSTRACT FROM AUTHOR]

It is known that a knot complement (minus two points) decomposes into ideal octahedra with respect to a given knot diagram. In this paper, we study the Ptolemy variety for such an octahedral decomposition in perspective of Thurston's gluing equation variety. More precisely, we compute explicit Ptolemy coordinates in terms of segment and region variables, the coordinates of the gluing equation variety motivated from the volume conjecture. As a consequence, we present an explicit formula for computing the obstruction to lifting a boundary-parabolic PSL (2 , ℂ) -representation to boundary-unipotent SL (2 , ℂ) -representation. We also present a diagrammatic algorithm to compute a holonomy representation of the knot group. [ABSTRACT FROM AUTHOR]

Intelligent agriculture has become the development trend of agriculture in the future, and it has a wide range of research and application scenarios. Using machine learning to complete basic tasks for people has become a reality, and this ability is also used in machine vision. In order to save the time in the fruit picking process and reduce the cost of labor, the robot is used to achieve the automatic picking in the orchard environment. Cherry target detection algorithms based on deep learning are proposed to identify and pick cherries. However, most of the existing methods are aimed at relatively sparse fruits and cannot solve the detection problem of small and dense fruits. In this paper, we propose a cherry detection model based on YOLOv5s. First, the shallow feature information is enhanced by convolving the feature maps sampled by two times down in BackBone layer of the original network model to the input end of the second and third CSP modules. In addition, the depth of CSP module is adjusted and RFB module is added in feature extraction stage to enhance feature extraction capability. Finally, Soft- Non-Maximum Suppression (Soft-NMS) is used to minimize the target loss caused by occlusion. We test the performance of the model, and the results show that the improved YOLOv5s-cherry model has the best detection performance for small and dense cherry detection, which is conducive to intelligent picking. [ABSTRACT FROM AUTHOR]

This paper realizes the implementation of Improved Multi-objective Mayfly Algorithm (IMOMA) for getting optimal solutions related to optimal power flow problem with smooth and nonsmooth fuel cost coefficients. It is performed by considering Simulated Binary Crossover, polynomial mutation and dynamic crowding distance in the existing Multi-objective Mayfly Algorithm. The optimal power flow problem is formulated as a Multi-objective Optimization Problem that consists of different objective functions, viz. fuel cost with/ without valve point loading effect, active power losses, voltage deviation and voltage stability. The performance of Improved Multi-objective Mayfly Algorithm is interpreted in terms of the present Multi-objective Mayfly Algorithm and Nondominated Sorting Genetic Algorithm-II. The algorithms are applied under different operating scenarios of the IEEE 30-bus test system, 62-bus Indian utility system and IEEE 118-bus test system with different combinations of objective functions. The obtained Pareto fronts achieved through the implementation of Improved Multi-objective Mayfly Algorithm, Multi-objective Mayfly Algorithm and Nondominated Sorting Genetic Algorithm-II are compared with the reference Pareto front attained by using weighted sum method based on the Covariance Matrix-adapted Evolution Strategy method. The performances of these algorithms are individually analyzed and validated by considering the performance metrics such as convergence, divergence, generational distance, inverted generational distance, minimum spacing, spread and spacing. The best compromising solution is achieved by implementing the Technique for Order of Preference by Similarity to Ideal Solution method. The overall result has shown the effectiveness of Improved Multi-objective Mayfly Algorithm for solving multi-objective optimal power flow problem. [ABSTRACT FROM AUTHOR]

In the direct current (DC) microgrid, a communication-less control algorithm to keep a stable state of the isolated DC microgrid is presented in this paper. In order to get balance of the state of charge (SoC) among multiple battery energy storage systems (BESs), a control algorithm with adaptive droop coefficient is proposed. When the SoC of BESs has a deviation, the droop coefficient will change with the SoC. The DC bus voltage is kept at a stable value within a small range of deviation using the proposed adaptive control algorithm, thus improving the voltage quality. The coordinated control strategy is significant to keep the system stable and to ensure the power balance of the DC microgrid. Finally, several representative cases are discussed and verified. The simulation results show that the DC bus voltage regulation has better stability and robustness without communication and the proposed control algorithm has a desirable performance on the balance of the SoC. [ABSTRACT FROM AUTHOR]

As an infrastructure of biochemical laboratories, EP tube label plays a significant role in information extraction to meet the limitations of computing power in offline devices and solve the problem that the EP tube label cannot be accurately identified before identification because the label belongs to multi-angle random placement. This paper proposes a light-weight neural network YOLOv4-tiny-ECA to position tubes and a tilt correction method based on Hough transform. First, the EP tube rack is roughly positioned based on the diffuse filling algorithm combined with digital morphological corrosion, and then the EP tubes in the rack are precisely positioned using the light-weight YOLO target detection algorithm combined with the attention mechanism. Next, the baseline is added to the label as the basis for determining the tilt angle. For the valid target, the baseline is extracted using the Hough transform and the tilt angle is calculated by vector fork multiplication. Finally, baseline is removed using image processing algorithm for better recognition results. Our results show that the light-weight YOLO algorithm reduces the network parameters by 56% and computation by 55% while keeping the accuracy rate largely unchanged, the offline positioning tilt correction method can achieve 98.8% accuracy and 0.076 s processing speed for a single test tube on average, which meets the real-time requirement. [ABSTRACT FROM AUTHOR]

Anabelian geometry has been developed over a much wider class of fields than Grothendieck, who is the originator of anabelian geometry, conjectured. So, it is natural to ask the following question: What kinds of fields are suitable for the base fields of anabelian geometry? In this paper, we consider this problem for higher local fields. First, to consider "anabelianness" of higher local fields themselves, we give mono-anabelian reconstruction algorithms of various invariants of higher local fields from their absolute Galois groups. As a result, the isomorphism classes of certain types of higher local fields are completely determined by their absolute Galois groups. Next, we prove that mixed-characteristic higher local fields are Kummer-faithful. This result affirms the above question for these higher local fields to a certain extent. [ABSTRACT FROM AUTHOR]

One of the most significant challenges appears to be securing the Internet of Things (IoT) communication network. As a corollary, information security has become the basis for establishing trustworthiness in IoT network communication. Cryptography is one of the ways for securing information in this case. However, the majority of current approaches are static, making them subject to security threats. As a consequence, a new concept, dynamic encryption, is growing rapidly in IoT communication. In this paper, a dynamic encryption algorithm (DSIT) has been proposed to secure IoT communication. This algorithm is based on Feistel and Substitution–Permutation Network. DSIT is a block cipher that takes the 64-bit block of plaintext, 64-bit secret key, and a secret dynamic box (D-box) as input. It produces a 64-bit ciphertext by performing eight rounds of the DSIT algorithm. For each round, the key and D-box are updated. This dynamic effect provides high security to a dynamic IoT network. The proposed algorithm has been executed in IoT environment using Raspberry Pi 3 Model B + and 50% average Avalanche effect has been achieved. The proposed algorithm efficiently encrypts the image data to secure the communication and high resistant to cryptanalysis attacks. [ABSTRACT FROM AUTHOR]

Rapid system and hardware development of X-ray computed tomography (CT) technologies has been accompanied by equally exciting advances in image reconstruction algorithms. Of the two reconstruction algorithms, analytical and iterative, iterative reconstruction (IR) algorithms have become a clinically viable option in CT imaging. The first CT scanners in the early 1970s used IR algorithms, but lack of computation power prevented their clinical use. In 2009, the first IR algorithms became commercially available and replaced conventionally established analytical algorithms as filtered back projection. Since then, IR has played a vital role in the field of radiology. Although all available IR algorithms share the common mechanism of artifact reduction and/or potential for radiation dose reduction, the magnitude of these effects depends upon specific IR algorithms. IR reconstructs images by iteratively optimizing an objective function. The objective function typically consists of a data integrity term and a regularization term. Therefore, different regularization priors are used in IR algorithms. This paper will briefly look at the overall evolution of CT image reconstruction and the regularization priors used in IR algorithms. Finally, a discussion is presented based on the reality of various reconstruction methodologies at a glance to find the preferred one. Consequently, we will present anticipation towards future advancements in this domain. [ABSTRACT FROM AUTHOR]

A hybrid encryption scheme for multi-image is proposed in this paper, which can encrypt different types and different sizes of images simultaneously. First, the order of the discrete map is extended from integer order to unequal fractional order. By choosing suitable parameters, the map exhibits chaotic behavior, and using the map for the designed image encryption system can enlarge the key space of the cryptosystem. Then, the plain images are pixel substituted. The chaotic sequences produced from the unequal fractional-order discrete map are shaped and sorted; the index sequences generated by the sorting are used to replace plain image pixels. After plain image pixels are replaced, DNA encoding, selective diffusion, and gene exchange are performed. The statistical properties of the images are masked by the diffusion algorithm. Finally, simulation experiments and security test results show that the designed multi-image hybrid encryption algorithm is effective and secure. [ABSTRACT FROM AUTHOR]

As a meta-heuristic algorithm, the ant colony algorithm has been successfully used to solve various combinatorial optimization problems. However, the existing algorithm that takes the power of ants to solve distributed constraint optimization problems (ACO_DCOP) is easy to fall into local optima. To deal with this issue, this paper presents an adaptive ant colony algorithm based on local information entropy to solve distributed constraint optimization problems, named LIEAD. In LIEAD, the local information entropy is introduced to help agents adaptively select the pheromone update strategy and value selection strategy, which improves the convergence speed and the quality of the solution. Moreover, a restart mechanism is designed to break the accumulation state of pheromone, which increases the population diversity and helps the algorithm jump out of the local optima. The extensive experimental results indicate that LIEAD can significantly outperform ACO_DCOP and is competitive with the state-of-the-art DCOPs algorithms. [ABSTRACT FROM AUTHOR]

This paper investigates the applicability of the ancient Chinese algorithm jointly with the two-scale fractal dimension transform to find the frequency–amplitude relationship of fractal equations of motion with and without damping terms. Analytical results show that for a fractal equation of motion without damping terms, the oscillation amplitudes do not exhibit decaying effects. However, when damping terms are included, the fractal parameter tends to shift the decaying oscillation amplitudes that decrease faster with time for fractal values less than one. This paper provides an efficient tool for finding the amplitude–frequency relationship of damped fractal oscillators. To illustrate the solution process, the steady-state solution of the fractal equation of motion that arises in plasma physics is derived. The proposed approach elucidates the applicability of He's formulation jointly with the two-scale fractal calculus to find the frequency–amplitude of fractal systems with and without damping terms. [ABSTRACT FROM AUTHOR]

Since the current general image encryption algorithms based on chaotic systems and classical permutation diffusion structures typically suffer from stochastic degradation, simple algorithm structures, and reduced execution efficiency when dealing with images with large data, this paper proposes a new multiprocess image encryption algorithm based on a new hyperchaotic coupled sine map. To begin with, by performing dynamic analyses of the map, including equilibrium points, bifurcation diagrams, Lyapunov exponent diagrams, and phase diagrams, associated performance analyses show high spectral entropy (SE) values and permutation entropy (PE) values. Meanwhile, sequences generated by the proposed map are able to pass the NIST randomness test, which shows its suitability for the design of encryption algorithms. Then, a chaos-based image encryption algorithm is proposed in this paper: In the preprocessing stage, the images are sparsely sampled using a compressed-sensing method; in the permutation stage, the image is decomposed into eight bit-plane images containing only 0s and 1s and a clockwise cyclic shift operation based on a chaotic sequence is applied in each bit-plane image to achieve a bit-level permutation effect; in the diffusion stage, the block DNA random computing is applied to the permuted image to modify the pixel values and the final cipher image is obtained. In addition, the initial value of the map is determined by the preset initial value, user-defined strings, and the Hash value of the plain image, where the Hash value of the plain image is calculated by the SHA-256 algorithm. Finally, the analysis of the algorithm demonstrates that the algorithm exhibits extremely strong plaintext correlation externally and excellent encryption performance in terms of attack resistance and execution efficiency. [ABSTRACT FROM AUTHOR]

Human activity recognition (HAR) has a wide application in daily life. With wearable sensors, people's activity can be monitored, recorded and analysed. However, most existing methods did not make full use of human activity data and their features. In this paper, a new method based on feature selection and clustering algorithm is proposed. We established two-layer classification models, respectively, in the ankle, the chest, the wrist and the mixed accelerometer data. K-means clustering algorithm was first used to obtain a broad classification of the activities and then we conducted two rounds of classification, among which feature selection was performed in each layer. A significance analysis was also carried out in the final experiment and we compared the performance of the final model from the mixed accelerometer data with other algorithms, the results showed that the recognition performance of our model was significantly better, and the average F 1 score was as high as 0.969 in publicly available PAMAP2 dataset. Compared with other methods, our model achieved the highest recognition rate. The method proposed in this paper can greatly improve the recognition rate of human activity and effectively evaluate daily activity. [ABSTRACT FROM AUTHOR]

In this paper, we discuss applications of neural networks to recognizing knots and, in particular, to the unknotting problem. One of the motivations for this study is to understand how neural networks work on the example of a problem for which rigorous mathematical algorithms for its solution are known. We represent knots by rectangular Dynnikov diagrams and apply neural networks to distinguish a given diagram's class from a finite family of topological types. The data presented to the program is generated by applying Dynnikov moves to initial samples. The significance of using these diagrams and moves is that in this context the problem of determining whether a diagram is unknotted is a finite search of a bounded combinatorial space. In this way, this paper provides a foundation for further work where the neural network itself will learn to use the Dynnikov moves for knot recognition. Source code of the programs is available at https://github.com/nerusskikh/deepknots. [ABSTRACT FROM AUTHOR]

The era of new human–computer interaction has accelerated, and gesture recognition is one of the development trends of human–computer interaction system in the future. The emerging graph neural network can capture the interdependence between instances and infer the complete information of the image based on local features, which is helpful to the recognition of human gestures. Therefore, the combination of graph neural network and convolutional neural network (CNN) is applied to the research of gesture recognition and it has important research significance. This paper uses the Mixup method to perform data enhancement processing on the collected image data set, applies the pyramid pooling method to the EigenPooL model to achieve efficient capture of image features and selects the Sigmoid function and the PReLU function as the activation function of the network model to meet the model's requirements, such as long time training and strong fitting ability. This paper introduces the structure and algorithm of EigenPooL model in detail. The algorithm uses hypergraph learning method instead of simple graph learning method. On the gesture picture test set, the average accuracy of the algorithm is 86.50%, the recall rate is 94.87% and the average detection time per frame is 421 ms. [ABSTRACT FROM AUTHOR]

There has been a lot of research on edge-computing task offloading in deep reinforcement learning (DRL). Deep reinforcement learning is one of the important algorithms in the current AI field, but there is still room for improvement in the time cost and adaptive correction ability of the algorithm. This paper studies the application of DRL algorithms in edge-computing task offloading, and its key innovation is to propose an MADRLCO algorithm, which is based on the design idea of the Actor–Critic framework, uses the DNN model to act as an Actor, and can more accurately locate the initial decision through iterative training, and use the LSTM model to optimize the Critic, which can be more accurate. The optimal decision can be located in a short period of time. The main work of this paper is divided into three parts: (1) The AC algorithm of the Actor–Critic framework in DRL is proposed to be applied to edge-computing task offloading. (2) To address the weak generalization ability of the basic version of the Actor–Critic algorithm in multi-objective optimization, the sequential quantitative correction and adaptive correction parameter K method are used to optimize the Critic frame, thereby improving the generalization ability of the model in multi-objective decision-making and improving the rationality of decision-making results. (3) Aiming at the problem of large time cost in the critical framework of the model, a search algorithm for resource allocation-related parameters based on the time-series prediction method is proposed (time-series forecasting is a research branch of pattern recognition), which reduces the time overhead of the algorithm and improves the adaptive correction capability of the model. The algorithm in this paper can adapt to not only the time-varying network channel state, but also the time-varying number of device connections. Finally, it is proved by experiments that compared with the DRL calculation offloading algorithm based on DNN plus binary search, the MADRLCO algorithm reduces the model training time by 66.27%, and in the environment of the time-varying number of devices in the metasystem, the average model average. The standard calculation rate is 0.0403 higher than that of the current optimal algorithm. [ABSTRACT FROM AUTHOR]

Driver misbehavior is one of the major traffic safety hazards as car ownership increases year by year. So, it is important to have driver fatigue detection and behavior recognition. Initially, given the fatigue detection problem that the images captured by the visible light camera cannot capture the eyes of a driver wearing sunglasses or eye glasses. As a solution, this paper introduces a DCT-HSV preprocessing algorithm for infrared images, which is believed to enhance the target characteristics of infrared images. The paper also introduces a more efficient lightweight SSD detection model, which achieves a better balance in terms of model size and detection performance. It also shows a better performance in self-built datasets and basic vehicle operation datasets. Secondly, aiming at the problems of high complexity and poor accuracy of the existing driving behavior detection model, this paper designs a driver abnormal behavior discrimination model based on the comparison twin, which has good performance on the Kaggle public dataset. The relevant experimental detection results show that the method constructed in this paper has high detection accuracy, low warning delay, and good practical use value. [ABSTRACT FROM AUTHOR]

In order to ensure the stability and reliability of power supply and realize day and night power generation, wind and solar complementary power generation systems are built in areas with abundant solar and wind energy resources. However, the system investment cost is too high. Because of this, there are wind, light intermittent, and non-intermittent power generation systems. For issues such as stability, an energy storage system needs to be configured to stabilize power fluctuations. This paper aims to study the optimization control of hybrid energy storage system of new energy power generation system based on improved particle swarm algorithm. In this paper, the application of particle swarm algorithm to power system reactive power optimization has been researched in two aspects. Through optimization methods, reasonable adjustment of control variables, full use of equipment resources of the power grid, to improve voltage quality and reduce system operation network to ensure the stability of the voltage system. In addition, this paper selects the IEEE30 node test system and simulation data analysis, takes the hybrid energy storage system as the optimization object, and optimizes the reactive power of the newly improved particle swarm algorithm. The experiments in this paper show that the improved algorithm has a good effect in reactive power optimization, increasing the performance of the hybrid energy storage system by 27.02%. MPSO algorithm is also better than basic PSO algorithm. It can be seen from the figure that in the PSO algorithm, the algorithm basically tends to be stable after more than 40 iterations, and finally the algorithm converges to 0.089. [ABSTRACT FROM AUTHOR]

This paper uses multi-sensor data fusion technology to design and develop a multi-sensor based basketball robot's target recognition and positioning system in an unknown environment. We establish the movement model of the basketball robot, and combine the hardware configuration of the basketball robot, analyse the methods of speed control, position control, and direction control, propose a fuzzy obstacle avoidance strategy in the basketball robot movement process, and simulate the obstacle avoidance strategy. The simulation results show that the proposed fuzzy obstacle avoidance strategy is effective. Carry out the experiment of basketball robot target calibration, build the basketball robot monitoring system, and realize data transmission and real-time image processing. Experiments show that the basketball robot can achieve target recognition and positioning tasks in an unknown environment (obstacle comparison rules). It proves the effectiveness and robustness of the proposed following algorithm. It illustrates the effectiveness of the system designed in this paper. [ABSTRACT FROM AUTHOR]

In this paper, an algorithm is discussed for constructing the two-direction Armlet multiwavelet. First, the definition of two-direction Armlet multiwavelet is presented in this paper. A two-direction multiwavelet can be changed to a special multi-wavelet. By Two-scale Similar Transform (TST), a transform can be taken on the two-scale matrix symbols of a two-direction multi-wavelets. This transform keeps the orthogonality of the two-direction multi-wavelets. However, the condition is discussed which the two-direction multi-wavelet corresponding to a two-direction multi-scaling function is an Armlet with order n. An approach is given for constructing the transform matrix. Finally, an example is given for discussing the two-direction Armlet multi-wavelet with order 2. [ABSTRACT FROM AUTHOR]

This paper proposes a new chaotic system 2D-HLM, which is a combination of Henon map and logistic map. SHA-256 algorithm based on the plaintext image produces the initial value, which enhances the correlation with the plaintext. Therefore, the algorithm avoids the disadvantages of being easily cracked by selected plaintext attacks. The chaotic sequence generated by 2D-HLM is adopted to scramble an image, and the bit plane is extracted and reorganized on the scrambled image. Based on the relationship between two mathematical propositions of the logistic map operations, a novel propositional logic coding algorithm is proposed. The simulation results show that the algorithm has large key space and high key sensitivity, and can resist common attacks such as differential attack. [ABSTRACT FROM AUTHOR]

Over-then-Under (OU) tangles are oriented tangles whose strands travel through all of their over crossings before any under crossings. In this paper, we discuss the idea of gliding: an algorithm by which tangle diagrams could be brought to OU form. By analyzing cases in which the algorithm converges, we obtain a braid classification result, which we also extend to virtual braids, and provide a Mathematica implementation. We discuss other instances of successful "gliding ideas" in the literature — sometimes in disguise — such as the Drinfel'd double construction, Enriquez's work on quantization of Lie bialgebras, and Audoux and Meilhan's classification of welded homotopy links. [ABSTRACT FROM AUTHOR]

This paper presents an electric vehicle connected to a charging station based on the proposed method. The proposed technique is the joint execution of the Student Psychology Optimization Algorithm (SPOA) and the AdaBoost algorithm and is therefore called the SPOA-AdaBoost algorithm. In particular, the annualized social cost depends on CS and EVCS set from the objective function of the allocation model. The EVCS is linked with the CS and allows the charging service for electric vehicles. The vehicle-to-grid functions of electric vehicles are properly considered under the present optimization model. The EV load demands are considered as controllable resources, and EV optimal optimization problems are connected with allocation problems. When EV arrives at the charging station, it reports its own energy demand and expected departure time using the EVCS operator. Every EVCS could attack the details of electric vehicles via the proposed method. With this proper action, this method manages the energy demand and the total supply. The constraints are the power flow equations, equivalent load demands on the buses, branch current constraints, discrete size restrictions for CS, constraints on CS outputs, EV participation on V2G activities, mutual exclusivity of the EV charge and discharge statuses, EV Owner charge satisfaction, EV Owner satisfaction charge, EV SOC restrictions, Occupied CF quantities, and EVCS CF sufficiency. Among these, the execution of the present model done by the MATLAB/Simulink platform and the performance of the proposed model is likened with other systems. [ABSTRACT FROM AUTHOR]

GPS receivers have a wide range of applications, but are not always secure. A spoofing attack is one source of conscious errors in which the counterfeit signal overcomes the authentic GPS signal and takes control of the receiver's operation. Recently, GPS spoofing attack detection based on computational algorithms, such as machine learning, classification, wavelet transform and clustering, has been developing. This paper proposes multiple clustering algorithms for accurately clustering the authentic and spoofing signals, called subtractive, FCM and DBSCAN clustering. The spoofing attack is recognized using two distinct features: moving phase detector variance and norms of correlators. Spoofing and authentic signals have different patterns in the proposed features. According to the Dunn and Silhouette indexes, the validation of the results is investigated. The Dunn values for the proposed approaches are 0.8592, 0.5285 and 0.6039 for DBSCAN, FCM and subtractive clustering, respectively. Also, the DBSCAN algorithm is implemented at the RTL level because of its highest value for the Dunn index and algorithm verifiability. Using the Vivado tools, this algorithm is implemented and designed on a Xilinx Virtex 7 xc7vx690tffg1930-3 hardware device for two-dimensional data with 32-bit accuracy and 130 data points. [ABSTRACT FROM AUTHOR]

A study of geographic information has become a significant field of concentrate in software engineering because of the expansion of much information created by electronic gadgets fit together geographic data from people, like advanced mobile phones and GPS gadgets. Area facts allow a deeper understanding of users' options and actions by bridging the gap between the physical and digital worlds. This expansion of wide geo-spatial datasets has inspired studies into novel recommender systems that aim to make users' travels and social interactions easier. This huge amount of data generated by these devices has prompted an increase in the number of research activities and procedures aimed at breaking down and recovering useful data based on these large datasets. The aim of this challenge is to study GPS directions from a variety of people, as well as examine and apply computational strategies to recover useful data from those directions, useful data from GPS directions, including areas of interest and people's proximity, and then create an instrument for information representation. This paper demonstrates how data mining techniques is used to recover valuable information from spatial data. As well as how such data can be useful in understanding people and areas within a district. Depending on the outcomes, we recommend a HITS (Hypertext Induced Topic Search) based POI recommendation calculation that can take into account the effect of social connections when recommending POIs to individual users. [ABSTRACT FROM AUTHOR]

The inverse halftoning technology refers to restoring a continuous-toned image from a halftoned image with only bi-level pixels. However, recovering the continuous images from their halftoned ones is normally ill-posed, which makes the inverse halftoning algorithm very challenging. In this paper, we propose an optimization model with two alternate projections (TAP) for image inverse halftoning under the weighted nuclear norm minimization (WNNM) framework. The main contributions are twofold. First, the WNNM nonlocal regularization term is established, which offers a powerful mechanism of nonlocal self-similarity to ensure a more reliable estimation. Second, the alternate minimization projections are formulated for solving the image inverse halftoning, which reconstructs the continuous-toned image without destroying the image details and structures. The experimental results showed that the proposed method outperformed the state of the arts in terms of both objective measurements and subjective visual performance. The codes and constructed models are available at: https://github.com/juneryoung2022/IH-WNNM. [ABSTRACT FROM AUTHOR]

Two links are link-homotopic if they are transformed into each other by a sequence of self-crossing changes and ambient isotopies. The link-homotopy classes of links with up to three components were classified by the Milnor homotopy invariants. Levine investigated the indeterminacy of Milnor homotopy invariants and gave a classification of the link-homotopy classes of 4-component links. In this paper, we give another classification of the link-homotopy classes of 4-component links by using the clasper theory. This classification is obtained through a tetrahedron standard form of the link-homotopy classes of 4-component links. As an application, we give several new subsets of the link-homotopy classes of 4-component links which are classified by computable invariants. Moreover, the classification allows us to run the Habegger–Lin algorithm which determines whether two given links are link-homotopic or not. [ABSTRACT FROM AUTHOR]

Ontology user portraits describe the semantic structure of users' interests. It is very important to study the similar relationship between user portraits to find the communities with overlapping interests. The hierarchical characteristics of user interest can generate multiple similarity relations, which is conducive to the formation of interest clusters. This paper proposed a method of overlapping community detection combining the hierarchical characteristics of user interest and the module distribution entropy of node. First, a hierarchical user interest model was constructed based on the ontology knowledge base to measure the multi-granularity topic similarity of users. Then, a heterogeneous hypergraph was established by using the multi-granularity topic similarity and the following similarity of users to represent the interest network. Based on the mechanism of module distribution entropy of nodes, the community detection algorithm was applied to identify the interested community. The real performance of the proposed algorithm on multiple networks was verified by experiments. The experimental results show that the proposed algorithm is better than the typical overlapping community detection algorithm in terms of accuracy and recall rate. [ABSTRACT FROM AUTHOR]

In this paper, a new 2D Arnold-sin-coupling (2D-ASC) hyperchaotic map is established and a new image encryption algorithm based on bit-level operations and the ASC hyperchaotic system is proposed. The algorithm first decomposes a normal image into bit-level images by rows, incorporates a sequence of bits generated by a chaotic system to the algorithm to increase randomness and security, and then performs a circular shift of the rows and columns of the bit-level image to obtain a confused intermediate image. Finally, the intermediate image is diffused by our constructed S-box according to the size of each pixel value to obtain a stable and robust encrypted image. Moreover, the initial condition of the chaotic mapping used is calculated from the SHA-256 hash value of the original image, enhancing the correlation of the encryption process with the plaintext image. Through simulation experiments, the image encryption scheme is analyzed in terms of key space, histogram, information entropy, robustness and key sensitivity. The theoretical analysis and experimental findings demonstrate that the algorithm has good performance and sufficient level of security. The information entropy of the encrypted image is above 7.9993, the average NPCR is 99.6440 and the average UACI is 33.4996. [ABSTRACT FROM AUTHOR]

Label propagation algorithm is widely used for community detection in a network due to its linear time complexity. It also does not need any predefined information such as the number of communities. However, the results of this algorithm are not stable because of the randomness strategy used in its propagation process. In this paper, a modification on label propagation strategy is proposed in which labels are propagated based on nodes importance defined by their positions and popularity among neighbors. The proposed strategy is an updating process which reduces the instability of the label propagation algorithm. Experiments on real-world and synthetic networks show that the proposed method improves accuracy in terms of modularity, NMI and ARI. Also, the method has an acceptable execution time. [ABSTRACT FROM AUTHOR]

This paper considers linear and nonlinear fractional delay Volterra integrodifferential equation of order ρ in the Atangana–Beleanu–Caputo (ABC) sense. We used continuous Laplace transform (CLT) to find equivalent Volterra integral equations that have been used together with the Arzela–Ascoli theorem and Schauder's fixed point theorem to prove the local existence solution. Moreover, the obtained Volterra integral equations and the contraction mapping theorem have been successfully applied to construct and prove the global existence and uniqueness of the solution for the considered fractional delay integrodifferential equation (FDIDE). The Galerkin algorithm instituted within shifted Legendre polynomials (SLPs) is applied in the approximation procedure for the corresponding delay equation. Indeed, by this algorithm, we get algebraic system models and by solving this system we gained the approximated nodal solution. The reliability of the method and reduction in the size of the computational work give the algorithm wider applicability. Linear and nonlinear examples are included with some tables and figures to show the effectiveness of the method in comparison with the exact solutions. Finally, some valuable notes and details extracted from the presented results were presented in the last part, with the sign to some of our future works. [ABSTRACT FROM AUTHOR]

In order to improve the decision-making and control effect of autonomous vehicles, in this paper, combined with literature research and process analysis, the control algorithm of autopilot vehicle is analyzed, and the driving process is analyzed combined with the flow method. In order to improve the effect of autonomous driving, with the support of improved algorithms, an integrated decision-making control system for autonomous vehicles under multi-task constraints in intelligent traffic scenarios is constructed, and system performance is improved by simulating autonomous driving decisions in a variety of complex situations. Moreover, this paper designs the road driving model according to actual needs, sets the functional modules of the entire system, and build the overall framework of the system. Finally, in order to study the integrated decision-making effect of this system, this paper conducts test research by designing a simulation test method. From the simulation test results, it can be seen that the intelligent decision-making system for autonomous vehicles constructed in this paper has certain effects. [ABSTRACT FROM AUTHOR]

Face recognition is difficult due to the higher dimension of face image features and fewer training samples. Firstly, in order to improve the performance of feature extraction, we inventively construct a double hierarchical network structure convolution neural network (CNN) model. The front-end network adopts a relatively simple network model to achieve rough feature extraction from input images and obtain multiple suspect face candidate windows. The back-end network uses a relatively complex network model to filter the best detection window and return the face size and position by nonmaximum suppression. Then, in order to fully extract the face features in the optimal window, a face recognition algorithm based on intermediate layers connected by the deep CNN is proposed in this paper. Based on AlexNet, the front, intermediate and end convolution layers are combined by deep connection. Then, the feature vector describing the face image is obtained by the operation of the pooling layer and the full connection layer. Finally, the auxiliary classifier training method is used to train the model to ensure the effectiveness of the features of the intermediate layer. Experimental results based on open face database show that the recognition accuracy of the proposed algorithm is higher than that of other face recognition algorithms compared in this paper. [ABSTRACT FROM AUTHOR]

With the continuous expansion of the city scale and the increasing population, people have put forward higher requirements for the speed, reliability and economy of logistics distribution. Although there have been many achievements in the research on the vehicle optimal scheduling decision model and its solution algorithm, there are some problems such as low solution efficiency, long time consumption, and easy to fall into the local optimal solution. The purpose of this paper is to study the model of vehicle scheduling problem in distribution center based on improved differential evolution algorithm. This paper firstly makes a simple analysis of the vehicle distribution route optimization problem, and points out the main factors that constitute the route optimization problem; then analyzes the principle of the differential evolution algorithm, and on this basis, the differential evolution algorithm is improved. In the experimental part, this paper takes a distribution center as the research object, and proposes the implementation steps of the algorithm of the vehicle scheduling problem based on the improved differential evolution algorithm. And test the running cost of the improved differential evolution algorithm and differential evolution algorithm. Experimental results show that applying the improved differential evolution algorithm to vehicle scheduling problems has certain practicality. When the number of iterations reaches 60, the running cost of the improved differential evolution algorithm is 1,200 yuan, and the running cost of the differential evolution algorithm is 1,300 yuan. [ABSTRACT FROM AUTHOR]

Numerous research based on offline Tamil recognition deals only with few Tamil characters since it becomes extremely complicated in distinguishing small variations in large handwritten document. The writer's complexity affects the overall formation of the characters. Such types of complexities are due to discontinuation of structures, unnecessary over loops, variation in shapes as well as irregular curves. This complex issue results in enhanced error value rate. Therefore, to conquer such issues, this paper proposes a novel approach to enhance the offline Tamil handwritten character recognition by utilizing four principal steps: pre-processing, segmentation, feature extraction and classification. For optimal segmentation of Tamil characters, this paper utilizes the Tsallis entropy approach-based atom search (TEAS) optimization algorithm. Then a Newton algorithm based deep convolution extreme learning (DELM) approach is utilized for the extraction and classification of input images. Finally, experiments are carried out for numerous Tamil handwritten recognition-based approaches. The proposed Tamil character recognition utilizes the datasets of isolated Tamil handwritten characters established by HP lab India to evaluate the efficiency of the system. [ABSTRACT FROM AUTHOR]

Microwave hyperthermia is a new method of treating cancer, where the therapeutic effect is determined by the heating temperature. Traditional active temperature sensors are interfered by high frequency so that the accuracy of temperature measurement cannot be guaranteed. It is of great significance to study the high-precision fluorescent optical fiber temperature sensor with complete insulation. This paper has realized a compact and practical fluorescent optical fiber temperature sensor after studying the optical path, circuit, data processing algorithm. In order to improve the accuracy of the system, the weighted linear least-squares fitting algorithm is improved in this paper. Through experimental tests, compared with the standard linear least-squares fitting algorithm and the unimproved weighted linear least-squares fitting algorithm, the accuracy of the algorithm is improved by about 98% and 65.5%, respectively. In addition, the response time is reduced by about 36.5%, compared with the unimproved weighted linear least-squares fitting algorithm. This algorithm fully meets the precision requirements of microwave hyperthermia. [ABSTRACT FROM AUTHOR]

For an optimization problem known to be NP-Hard, the dichotomy study investigates the reduction instances to determine the line separating polynomial-time solvable vs NP-Hard instances (easy vs hard instances). In this paper, we investigate the well-studied Hamiltonian cycle problem (HCYCLE), and present an interesting dichotomy result on split graphs. T. Akiyama et al. (1980) have shown that HCYCLE is NP-complete on planar bipartite graphs with maximum degree 3. We use this result to show that HCYCLE is NP-complete for K 1 , 5 -free split graphs. Further, we present polynomial-time algorithms for Hamiltonian cycle in K 1 , 3 -free and K 1 , 4 -free split graphs. We believe that the structural results presented in this paper can be used to show similar dichotomy result for Hamiltonian path problem and other variants of Hamiltonian cycle (path) problems. [ABSTRACT FROM AUTHOR]

Aiming at the problems of high complexity and low detection accuracy of single-stage three-dimensional (3D) detection method, a vehicle object detection algorithm based on the Efficient Channel Attention (ECA) mechanism is proposed. This paper provides a good solution to the problems of low object recognition accuracy and high model complexity in the field of 3D object detection. First, we voxelized the original point cloud data, taking the average coordinates and intensity values as the initial features. By entering into the Voxel Feature Encoding (VFE) layer, we can extract the features of each voxel. Then, referring to the VoxelNet model, the ECA mechanism is introduced, which reduces the complexity of the model while maintaining the good performance in the model. Finally, experiments on the widely used KITTI dataset show that the algorithm performs well, and the accuracy of the proposed ECA algorithm has reached 87.75%. Compared with the current mainstream algorithm SE-SSD of object detection, the accuracy is increased by 0.21%. [ABSTRACT FROM AUTHOR]

In this paper, an efficient interactive image segmentation method based on maximization of submodular function under user's scribble constraint is presented. The problem of interactive image segmentation is formulated as the maximum entropy rate under user's constraints. The objective function is submodular, and we solve the constrained submodular function maximization by incorporating a new data structure and some aggregating rules into the greedy algorithm. The main steps of our algorithm are as follows. First, the pixels scribbled by the user are clustered separately as target foreground and background clusters. Second, in the process of greedy algorithm, unscribbled pixels are aggregated to the corresponding target cluster according to the proposed aggregating rules. Finally, the segmentation result is presented by the two target clusters. The experiments and comparisons on three standard benchmarks show that our method has good performance. Our method is straightforward and efficient, and the time complexity of our method is between linear and polynomial. Furthermore, we analyze the influence of different scribbles, and propose some optimal scribble strategies. [ABSTRACT FROM AUTHOR]

Broadcasting is disseminating information in a network where a specific message must spread to all network vertices as quickly as possible. Finding the minimum broadcast time of a vertex in an arbitrary network is proven to be NP-complete. However, this problem is solvable for a few families of networks. In this paper, we present an optimal algorithm for finding the broadcast time of any vertex in a fully connected tree ( FCT n ) in O (| V | log log n) time. An FCT n is formed by attaching arbitrary trees to vertices of a complete graph of size n where | V | is the total number of vertices in the graph. [ABSTRACT FROM AUTHOR]

In the last years, the number of machine learning algorithms and their parameters has increased significantly. On the one hand, this increases the chances of finding better models. On the other hand, it increases the complexity of the task of training a model, as the search space expands significantly. As the size of datasets also grows, traditional approaches based on extensive search start to become prohibitively expensive in terms of computational resources and time, especially in data streaming scenarios. This paper describes an approach based on meta-learning that tackles two main challenges. The first is to predict key performance indicators of machine learning models. The second is to recommend the best algorithm/configuration for training a model for a given machine learning problem. When compared to a state-of-the-art method (AutoML), the proposed approach is up to 130x faster and only 4% worse in terms of average model quality. Hence, it is especially suited for scenarios in which models need to be updated regularly, such as in streaming scenarios with big data, in which some accuracy can be traded for a much shorter model training time. [ABSTRACT FROM AUTHOR]

An interconnection network can be modelled as a connected graph G. The reliability of interconnection networks is critical for multiprocessor systems. Several conditional edge-connectivities have been introduced in the past for accurately reflecting various realistic network situations, with the h -extra edge-connectivity being one such conditional edge-connectivity. The h -extra edge-connectivity of G , denoted by λ h (G) , is the minimum cardinality of faulty edges whose deletion disconnects the graph G with each resulting component containing at least h processors. In general, for a connected graph G , determining whether the graph exists an h -extra edge-cut is N P -hard. The folded-crossed hypercube F C Q n is a variation of the crossed hypercube C Q n with N = 2 n processors. In this paper, after excavating the layer structure of folded-crossed hypercube, we investigate some recursive properties of λ h (F C Q n) , based on some recursive properties, an effective O (log (N)) algorithm of h -extra edge-connectivity of folded-crossed hypercube is designed, which can determine the exact value and the λ h -optimality of λ h (F C Q n) for each positive integer 1 ≤ h ≤ 2 n − 1 . Our results solve this problem thoroughly. [ABSTRACT FROM AUTHOR]

This paper presents and discusses the implementation of a learning accelerator for an LSTM neural network that utilizes an FPGA. The accelerator consists of a backpropagation through time algorithm for an LSTM. The presented net performs a binary classification task and consists of an LSTM and a dense layer. The performance is then compared to both a hard-coded Python implementation and an implementation using Keras library and the GPU. The implementation is executed using the DSP blocks, available via the Vivado Design Suite, which is in compliance with the IEEE754 standard. The results of the simulation show that the FPGA implementation remains accurate and achieves higher speed than the other solutions. [ABSTRACT FROM AUTHOR]

In this paper, we propose a two-dimensional multifractal sign retention detrending fluctuation analysis algorithm (2D MF-S-DFA), which takes the sign of the residual matrix into account when calculating the detrending fluctuation function in traditional 2D MF-DFA. We evaluate these two methods based on images constructed from p -model multiplicative cascades. The results indicate that the numerical solution of the images extracted by 2D MF-S-DFA is closer to the theoretical solution of the multiplicative cascade images. In addition, we also compare the performance of the two methods after transforming the important parameters of the multiplicative cascade images. The results show that the relative errors and overall distance between the generalized Hurst exponent H (q) and the scale exponent τ (q) extracted by 2D MF-S-DFA and the image feature values are smaller than those of 2D MF-DFA. We can conclude that the sign retention algorithm outperforms the traditional 2D MF-DFA. [ABSTRACT FROM AUTHOR]