Search

Assume that we are given a sequence F of k homogeneous polynomials in n variables of degree at most d and the ideal ℐ generated by this sequence. The aim of this paper is to present a new and effective method to determine, within the arithmetic complexity d O (n) , whether F is regular. This algorithm has been implemented in Maple and its efficiency (compared to the classical approaches for regular sequence test) is evaluated via a set of benchmark polynomials. Furthermore, we show that if F is regular then we can transform ℐ into Nœther position and at the same time compute a reduced Gröbner basis for the transformed ideal within the arithmetic complexity d O (n 2) . Finally, under the same assumption, we establish the new upper bound 2 (d k / 2) 2 n − k − 1 for the maximum degree of the elements of any reduced Gröbner basis of ℐ in the case that n > k. [ABSTRACT FROM AUTHOR]

How to improve the high resolution and remove the noise of composite infrared thermal wave detection image have become important research topics in machine vision. Therefore, this paper proposes a composite image enhancement algorithm based on edge adaptive total variation of direction. Using the improved adaptive directional total variation model to construct the guidance image of the guidance filter can provide better structural information for the guidance filter and conduct the guidance filter. This process is iterated to eliminate noise and ladder effect. Experimental results show that this algorithm is superior to other advanced methods in objective evaluation index and subjective vision. The algorithm proposed in this paper can not only effectively eliminate noise and ladder effect, but also highlight image details and structure information, which proves the effectiveness of this algorithm. Discover the cutting-edge algorithm for high-resolution improvement and noise elimination in infrared thermal wave detection images. Our innovative composite image enhancement technique, based on edge adaptive total variation, outperforms traditional methods. The improved directional model provides better structural information, optimizing the guidance filter process. Experimental results reveal its superiority in objective evaluation and subjective vision. This algorithm effectively eliminates noise and ladder effect while highlighting image details, validating its remarkable effectiveness. [ABSTRACT FROM AUTHOR]

Let = { T 1 , T 2 , ... , T k } be a set of k ≥ 2 spanning trees in a graph G. The k spanning trees are called completely independent spanning trees (CISTs for short) if the paths joining every pair of vertices x and y in any two trees have neither vertex nor edge in common except for x and y. Particularly, is called a dual-CIST provided k = 2. For data transmission applications in reliable networks, the existence of a dual-CIST can provide a configuration of fault-tolerant routing called protection routing. This paper investigates the problem of constructing a dual-CIST in the n -dimensional hierarchical folded cubic network H F Q n . The network is a two-level network using folded hypercube F Q n as clusters to reduce the diameter, hardware overhead and improve the fault tolerance ability. We propose a recursive algorithm to construct a dual-CIST of H F Q n in (2 2 n) time for n ≥ 2 , where the time required is the same scale as the number of vertices of H F Q n . Also, the diameter of each constructed CIST is 4 n + 1. [ABSTRACT FROM AUTHOR]

In this paper, we changed the methodology for pixel value differencing. The proposed method work on RGB color images improves the existing PVD technique in terms of embedding capacity and overcomes the issue of falling off boundaries in the traditional PVD technique, and provides security to the secret message from histogram quantization attack. Color images are composed of three different color channels (red, green, and blue), so we cannot apply the traditional pixel value differencing algorithm to them. Due to that, the proposed technique divides the RGB photograph in red, blue, and green channels. Following that the modified pixel value differencing algorithm is employed to all successive pixels of color channels. We get the total embedding capacity by adding the embedding capacities of each color component. After embedding the data, we concatenate the color channels to get the stegoimage. On a series of color images, we tested our pixel value differencing approach and found that the stego-picture's visual excellence and payload capacity were reasonable. The variation in histogram between the stego and cover photographs was minor, making it resistant to histogram quantization attacks, and the suggested approach also solves the issue of falling off the boundary. [ABSTRACT FROM AUTHOR]

In the online facility assignment problem OFA (k , { c i } i = 1 k) , there exist k servers s 1 , ... , s k on a metric space where each s i has an integer capacity c i and a request arrives one-by-one. The task of an online algorithm is to irrevocably match a current request with one of the servers with vacancies before the next request arrives. As special cases for OFA (k , { c i } i = 1 k) , we consider OFA (k , { c i } i = 1 k) on a line , which is denoted by OFAL (k , { c i } i = 1 k) and OFAL eq (k , { c i } i = 1 k) , where the latter is the case of OFAL (k , { c i } i = 1 k) with equidistant servers. In this paper, we perform the competitive analysis for the above problems. As a natural generalization of the greedy algorithm grdy, we introduce a class of algorithms called MPFS (Most Preferred Free Servers) and show that any MPFS algorithm has the capacity-insensitive property, i.e., for any MPFS algorithm alg for OFA (k , { c i } i = 1 k) , if alg is c -competitive when c 1 = ⋯ = c k = 1 , then alg is c -competitive for general { c i } i = 1 k . By applying the capacity-insensitive property of the greedy algorithm grdy, we derive the matching upper and lower bounds 4 k − 5 on the competitive ratio of grdy for OFAL eq (k , { c i } i = 1 k). To investigate the capability of MPFS algorithms, we show that the competitive ratio of any MPFS algorithm alg for OFAL eq (k , { c i } i = 1 k) is at least 2 k − 1. Then, we propose a new MPFS algorithm idas (Interior Division for Adjacent Servers) for OFAL (k , { c i } i = 1 k) and show that the competitive ratio of idas for OFAL eq (k , { c i } i = 1 k) is at most 2 k − 1 , i.e., idas for OFAL eq (k , { c i } i = 1 k) is best possible in all the MPFS algorithms. We also give numerical experiments to investigate the performance of idas and grdy and show that idas performs better than grdy for distribution of request sequences with locality. [ABSTRACT FROM AUTHOR]

This research paper develops an algorithm to solve a neutrosophic linear fractional optimization problem, where the cost of the objective functions, the technology coefficients, and the resources are neutrosophic numbers (triangular and trapezoidal numbers). Two defuzzification methods are used here to convert the neutrosophic linear fractional optimization problem into a multi-objective linear fractional optimization problem (MOLFOP). The fractional objective function is defuzzified using the component-wise optimization method, and the linear constraints are defuzzified using the aggregation ranking function strategy. Hence, the MOLFOP is then solved using the fuzzy goal programming method. In order to further explain our suggested algorithm, two numerical examples are solved at the end, and the outcomes obtained by our method are compared with the outcomes obtained using the other algorithm. [ABSTRACT FROM AUTHOR]

In stock trading, a common phenomenon is that the trends of stocks in the same industry are very similar. In contrast, the movements of stocks in different industries are often different. Therefore, applying the same model to all stock trading is inappropriate without distinguishing the industries in which the stocks belong. However, recommending an optimal industry stock trading model is very challenging based on performance evaluation indicators. First, the indicators of the trading model are diverse. Second, the ranking of multiple indicators is often inconsistent. In the paper, we model the problem to be solved as a multi-criteria decision-making process. Therefore, we first divide stock dataset into nine industries according to their main business. Then, we apply several machine learning algorithms as candidate models to generate trading signals. Second, we conduct daily trading backtesting based on the trading signals to obtain multiple performance evaluation indicators. Third, we propose an optimal recommendation algorithm for the industry stock trading model with TODIM. The experimental results in the US stock market and China's A-share market show that the proposed algorithm can get a better trading model out-of-sample industry stock. Moreover, we effectively evaluate the generalization ability of the algorithm based on the proposed metrics. Finally, the proposed long–short portfolios based on the algorithm have achieved returns exceeding the benchmark on most out-of-sample datasets. [ABSTRACT FROM AUTHOR]

To achieve a dynamic comprehensive risk assessment of road transport of hazardous chemicals, this paper first collected 213 road transport accidents involving hazardous chemicals that occurred between 2015 and 2020 to build a case library. Then, it established a risk assessment system (including 9 primary indicators and 28 secondary indicators) based on the frequencies of reasons for accident cases and explored the quantification methods for indicators based on their definitions. Subsequently, this paper calculated the weights of indicators based on the backpropagation neural network algorithm and the data in the case library and formulated a model for dynamic risk assessment of road transport of hazardous chemicals. The model takes into account the impact of comprehensive indicators such as drivers, vehicles, goods, roads, and the environment. The accuracy of the model calculation results is 93%. Eventually, the study verified the model using simulation data in real scenarios. The validation results show that the model could achieve a dynamic comprehensive assessment of risks in road transport of hazardous chemicals. [ABSTRACT FROM AUTHOR]

At present, there are many semantic segmentation algorithms with excellent performance for intelligent driving vehicles, but most of them only work well on scenes with good illumination. In order to solve the problem of scene segmentation under low illumination, this paper proposes a novel semantic segmentation algorithm that combines visible and infrared images. In this algorithm, two parallel encoders are designed as the input of the images, and the decoder divides the fused images output from the encoder. The model is based on ResNet algorithm, and the residual attention module is used in each branch to mine and enhance the spatial features of multilevel channels to extract images information. Experiments are carried out on publicly available thermal infrared and visible datasets. The results show that the algorithm proposed in this paper is superior to the algorithm using only visible images in semantic segmentation of traffic environment. [ABSTRACT FROM AUTHOR]

In view of the problems of high production cost, scarcity and lack of diversity of 3D face datasets, this paper designs an end-to-end self-supervised learning 3D face reconstruction algorithm with a single 2D face image as input, which only uses 2D face datasets to complete model training. First, the improved ResNet module is introduced to preprocess the input face image. The deep residual neural network has strong feature extraction and characterization ability for the image, which can provide rich high-level semantic feature maps for the subsequent subnetwork. Then, add transformer module completely based on self-attention mechanism to the parameter prediction subnetwork, which can make different parameters of the subnetwork focus on self-related feature map information and avoid interference from invalid feature map information, so as to further improve the parameter prediction accuracy of the subnetwork. Next, training, ablation and comparison experiments were conducted on CelebA, BFM and Photoface datasets, and the combined function of pixel loss function and perceptual loss function was selected as the loss function. The experimental results show that: compared with the historical optimal results of the same network structure, the scale-invariant depth error (SIDE) and mean angle deviation (MAD) are improved by 5.9% and 10.8%, respectively, which strongly proves the effectiveness of the algorithm. Finally, in order to verify the actual effect of the 3D face reconstruction algorithm, examples are selected in this paper for reconstruction. The 3D faces generated by the algorithm all have a good sense of reality, which intuitively and effectively proves the advancement of the algorithm. [ABSTRACT FROM AUTHOR]

The sine cosine algorithm (SCA) and multi-verse optimizer (MVO) are the recognized optimization strategies frequently employed in numerous scientific areas. However, both SCA and MVO grapple with optimizing the transition between the exploitation and exploration mechanisms. Furthermore, MVO exhibits constraints in its exploitation capabilities. To tackle these limitations, this paper introduces a hybrid model termed SMVO, combining the advantages of both SCA and MVO. This hybrid approach seeks to harmonize exploitation and exploration stages by leveraging the unique advantages of each parent algorithm. The efficacy of SMVO was assessed using 23 benchmark test functions, revealing its competitive performance against not only SCA and MVO but also the ant lion optimization (ALO) and the dragonfly algorithm (DA). Additionally, SMVO's applicability was further validated by successfully addressing three distinct engineering optimization challenges, underscoring its stability and promise as a global optimization tool. [ABSTRACT FROM AUTHOR]

This paper is concerned with the ℓ 1 , ∞ -norm ball constrained multi-task learning problem, which has received extensive attention in many research areas such as machine learning, cognitive neuroscience, and signal processing. To address the challenges of solving large-scale multi-task Lasso problems, this paper develops an inexact semismooth Newton-based augmented Lagrangian (Ssnal) algorithm. When solving the inner problems in the Ssnal algorithm, the semismooth Newton (Ssn) algorithm with superlinear or even quadratic convergence is applied. Theoretically, this paper presents the global and asymptotically superlinear local convergence of the Ssnal algorithm under standard conditions. Computationally, we derive an efficient procedure to construct the generalized Jacobian of the projector onto ℓ 1 , ∞ -norm ball, which is an important component of the Ssnal algorithm, making the computational cost in the Ssn algorithm very cheap. Comprehensive numerical experiments on the multi-task Lasso problems demonstrate that the Ssnal algorithm is more efficient and robust than several existing state-of-the-art first-order algorithms. [ABSTRACT FROM AUTHOR]

In this paper, we propose a novel nonconvex and nonsmooth optimization model for low-light or inhomogeneous image segmentation which is a hybrid of Mumford–Shah energy functional and Retinex theory. The given image is decomposed into the reflectance component and the illumination component by solving Retinex-based Mumford–Shah model with L 1 − L 2 regularizer. Indeed, the existence of the L 1 − L 2 regularizer means the nonsmooth term in the model is nonconvex. Thus, it is difficult to solve the proposed model directly. An alternating direction method of multipliers (ADMM) algorithm is developed to solve the proposed nonconvex and nonsmooth model. We apply a novel splitting technique in our algorithm to ensure that all subproblems admit closed-form solutions. Theoretically, we prove that the sequence generated by our proposed algorithm converges to a stationary point under mild conditions. Next, once the reflectance is obtained, the K -means clustering method is utilized to complete the segmentation. We compare the proposed Retinex-based method with other state-of-the-art segmentation methods under special lighting conditions. Experimental results show that the proposed method has better performance for both gray-scale images and color images efficiently in terms of the quantitative and qualitative results. [ABSTRACT FROM AUTHOR]

Noise radar waveform, as an important waveform in the field of low-probability-of-intercept radars, has been widely studied. However, the general noise waveform has a high peak average power ratio (PAPR), which leads to a reduction of signal-to-noise ratio. Thus, it is necessary to control the noise waveform PAPR to a suitable range. In this paper, the PAPR value reduction problem of low sidelobe noise waveform is studied. First, the proposed new algorithm is given a general overview. Then, the Combined Spectral Shaping and Peak-to-Average Power Ratio Reduction (COSPAR) algorithm is adjusted according to the alternate projection method and phase retrieval algorithm, and an improved COSPAR (ICOSPAR) algorithm with a faster execution speed and higher waveform generation efficiency is derived. The specific method performs waveform projection between the spectral constraint domain and the PAPR constraint domain and then evaluates the computational load of the ICOSPAR algorithm. Simulation results show that the ICOSPAR algorithm is reliable and efficient in generating low PAPRs and low sidelobe noise waveforms. [ABSTRACT FROM AUTHOR]

A charge and discharge management scheme is proposed. The stored electric energy in distributed storage devices will converge to the consistent. The consistency of the stored electric energy of the devices helps to maintain the maximum load capacity and maximum consumption capacity of distributed storage devices. The charging and discharging process is constructed as a time-varying optimization problem, and the proposed algorithm can respond to the time-varying parameters of the distributed storage devices in real time. The time-varying neurodynamic algorithms can obtain time-varying optimal solution trajectories to give the optimal charging and discharging strategy in real time. In addition, the proposed approach in this paper focuses on the privacy protection of device data. Each device can calculate the power of discharging or charging by communicating with the partially connected nodes. Numerical simulations of the proposed scheme in the paper are given to verify the effectiveness of the scheme. Numerical simulations show that our scheme can make the electric energy stored in each storage device converge and maintain the maximum load capacity or maximum consumption capacity of the whole distributed storage device. [ABSTRACT FROM AUTHOR]

The rapid growth of contents on the Web in different languages increases the demand of Cross-Lingual Information Retrieval (CLIR). The accuracy of result suffers due to many problems such as ambiguity and drift issue in query. Query Expansion (QE) offers reliable solution for obtaining suitable documents for user queries. In this paper, we proposed an architecture for Hindi–English CLIR system using QE for improving the relevancy of retrieved results. In this architecture, for the addition of term(s) at appropriate position(s), we proposed a location-based algorithm to resolve the drift query issue in QE. User queries in Hindi language have been translated into document language (i.e. English) and the accuracy of translation is improved using Back-Translation. Google search has been performed and the retrieved documents are ranked using Okapi BM25 to arrange the documents in the order of decreasing relevancy to select the most suitable terms for QE. We used term selection value (TSV) for QE and for retrieving the terms, we created three test collections namely the (i) description and narration of the Forum for Information Retrieval Evaluation (FIRE) dataset, (ii) Snippets of retrieved documents against each query and (iii) Nearest-Neighborhood (NN) words against each query word among the ranked documents. To evaluate the system, 50 queries of Hindi language are selected from the FIRE-2012 dataset. In this paper, we performed two experiments: (i) impact of the proposed location-based algorithm on the proposed architecture of CLIR; and (ii) analysis of QE using three datasets, i.e. FIRE, NN and Snippets. In the first case, result shows that the relevancy of Hindi–English CLIR is improved by performing QE using the location-based algorithm and a 12% of improvement is achieved as compared to the results of QE obtained without applying the location-based algorithm. In the second case, the location-based algorithm is applied on three datasets. The Mean Average Precision (MAP) values of retrieved documents after QE are 0.5379 (NN), 0.6018 (FIRE) and 0.6406 (Snippets) for the three test collections, whereas the MAP before QE is 0.37102. This clearly shows the significant improvement of retrieved results for all three test collections. Among the three test collections, QE has been found most effective along with Snippets as indicated by the results with the improvements of 6.48% and 19.12% over FIRE and NN test collections, respectively. [ABSTRACT FROM AUTHOR]

In this paper, we study mean–variance–Conditional Value-at-Risk (CVaR) portfolio optimization problem with short selling, cardinality constraint and transaction costs. To tackle its mixed-integer quadratic optimization model for large number of scenarios, we take advantage of the penalty decomposition method (PDM). It needs solving a quadratic optimization problem and a mixed-integer linear program at each iteration, where the later one has explicit optimal solution. The convergence of PDM to a partial minimum of original problem is proved. Finally, numerical experiments using the S&P index for 2020 are conducted to evaluate efficiency of the proposed algorithm in terms of return, variance and CVaR gaps and CPU times. [ABSTRACT FROM AUTHOR]

Underwater bubble plume images contain a wealth of information on wave field and flow characteristics, which can provide valuable research data for marine development, environmental protection, and underwater surveys. However, based on fusing image features and wave field environment features, identifying accurately the underwater bubble plume is still very difficult. In order to improve the accuracy and robustness of bubble plume identification in complex underwater environments, an underwater bubble plume recognition algorithm based on multi-feature fusion understanding is proposed. In this paper, a weight-independent dual-channel residual convolutional neural network (CNN) for feature extraction of the original optical images and the nonsubsampled contourlet transform (NSCT) low-frequency images, and the multi-scale composite feature map groups are generated. Then adaptive fusion is performed based on the feature contribution of the target in different types of images. Next, logical region of interest (ROI) masks are generated by the attention mechanism and superimposed on the fused image to further highlight the target features. Finally, the multi-scale dual-channel fused feature maps containing ROI masks are used for underwater bubble plume target recognition. The experimental results show that the designed recognition network can effectively fuse the features of the original optical images and the NSCT low-frequency imagers, improve the depth of information fusion, and retain the target texture features and the morphological features while reducing the interference of the background information, and have good recognition accuracy and robustness for multi-scale bubble targets in the underwater environment. [ABSTRACT FROM AUTHOR]

Printed circuit boards (PCBs) play a critical role in electronic products. Ensuring these products' long-term reliability and consistent performance requires effective PCB defect detection. Although existing deep learning models for PCB defect detection are not highly accurate, they often neglect capability considerations. This paper introduces a precise, fast, and lightweight defect detection model, CCG-YOLO, based on an enhanced YOLOv5 model to address this issue. The enhancements in CCG-YOLO can be summarized as follows: (1) Improved Backbone network: The feature extraction ability of the Backbone network is enhanced by introducing a C3HB module, which fosters spatial interaction capabilities. (2) Lightweight feature fusion network: A lightweight convolution structure called Ghost-Shuffle Convolution is incorporated in the feature fusion network, remarkably reducing model parameters while maintaining performance. (3) Efficient residual networking: To enhance model performance further, a CNeB module is introduced based on the ConvNeXt network, which replaces the C3 module in the Neck. CNeB improves model detection accuracy and reduces the number of model parameters. The combination of these enhancements results in impressive performance. CCG-YOLO achieves mean average precision (mAP@0.5) of 99.5% and 88.75% in mAP@0.5:0.95 on the TDD-Net public dataset. Compared with the original YOLOv5s algorithm, CCG-YOLO offers a 4.24% improvement in mAP@0.5:0.95, a 1 MB reduction in model size, a 0.472 M decrease in the number of parameters, a 0.6G floating point operation reduction in computational complexity, and a 120 frames per second real-time inference speed. These experimental results underscore that the proposed model excels in accuracy and speed and has a compact size for PCB defect detection. Moreover, CCG-YOLO is easily deployable on low-end devices, making it well-suited for meeting the real-time requirements of industrial defect detection. [ABSTRACT FROM AUTHOR]

The present prevailing loop closure detection algorithm is mainly applicable for simultaneous localization and mapping (SLAM). Its effectiveness is contingent upon environmental conditions, which can fluctuate due to variations in lighting or the surrounding scenario. Vision-based algorithms, while adept during daylight hours, may falter in nocturnal settings. Conversely, lidar methods hinge on the sparsity of the given scenario. This paper proposes an algorithm that comprehensively utilizes lidar and image features to assign weighted factors for loop closure detection based on multi-modal sensor fusion. First, we use k -means clustering to produce a point cloud spatial global bag of words. Second, an improved deep learning method is used to train feature descriptors of images while scan context is also used to detect candidate point cloud features. After that, different feature-weighted factors are assigned for homologous feature descriptors. Finally, the detection result related to the maximum weight factor is designated to the optimal loop closure. The adaptive weighted loop closure (AWLC) algorithm we proposed inherits the advantages of different loop closure detection algorithms and hence it is accurate and robust. The AWLC method is compared with popular loop detection algorithms in different datasets. Experiments show that the AWLC can maintain the effectiveness and robustness of detection even at night or in highly dynamic complex environment. [ABSTRACT FROM AUTHOR]

In addition to Power Quality (PQ) problems caused by solid state devices in the distribution side of grid connected Photo Voltaic (PV) system, quality of power also suffers in the source side by the usage of converters. Generally, PQ problems mitigation strategy has turned into a critical issue in grid-connected PV systems. This paper proposes a control topology for PQ issues mitigation scheme in grid connected PV systems. The primary goal of this study is to enhance the PQ in power distribution system through eradicating the voltage interruption, voltage swell and sag as well as voltage fluctuation. To accomplish these changes, Unified Power Quality Conditioners (UPQCs) with controllers were utilized. Then the faults are mitigated by the utilization of UPQC with Tree Seeds Algorithm (TSA) — Adaptive Neuro-Fuzzy Interference System (ANFIS). At first, the normal properties of the grid-connected PV systems are dissected. From that point forward, a few interruptions are made in the system and the abnormal characteristics are analyzed. Then the abnormal characteristics of PQ problems are diminished in the utilization of UPQC and TSA–ANFIS controllers. UPQC is one of the best filters topologies which can mitigate and control all PQ problems. The combined algorithms of TSA-ANFIS are used to keep the dc-link voltage in UPQC at consistent level. The proposed hybrid approach is executed in MATLAB/Simulink platform and the performance is studied. Further, the proposed method is compared with existing Elephant Herding Optimization (EHO) technique and also with hybrid EHO-ANFIS techniques. The comparison results showed that the proposed technique is superior to the EHO and EHO-ANFIS techniques. [ABSTRACT FROM AUTHOR]

This paper examines the stability of the à trous algorithm under arbitrary iteration in the context of a more general study of shift-invariant filter banks. The main results describe sufficient conditions on the associated filters under which an infinitely iterated shift-invariant filter bank is stable. Moreover, it is shown that the stability of an infinitely iterated shift-invariant filter bank guarantees that of any associated finitely iterated shift-invariant filter bank, with uniform bounds. The reverse implication is shown to hold under an additional assumption on the low-pass filter. Finally, it is also shown that the separable product of stable one-dimensional shift-invariant filter banks produces a stable two-dimensional shift-invariant filter bank. [ABSTRACT FROM AUTHOR]

Given an n -vertex graph G with a fixed linear ordering of V (G) and two integers k , b , the problem FIXED-ORDER BOOK DRAWING with few crossings per edge asks whether or not G admits a k -page book drawing where the maximum number of crossings per edge can be upper bounded by the number b. This problem was posed as an open question by Bhore et al. (J. Graph Algorithms Appl. 2020). In this paper, we study this problem from the viewpoint of parameterized complexity, in particular, we develop fixed-parameter tractable algorithms for it. More specifically, we show that this problem parameterized by both the bound number b of crossings per edge and the vertex cover number τ of the input graph admits an algorithm with running time in (b + 2) (τ 3) ⋅ n , and this problem parameterized by both the bound number b of crossings per edge and the pathwidth κ of the vertex ordering admits an algorithm with running time in (b + 2) (κ 2) ⋅ n. Our results provide a specific answer to Bhore et al.'s question. [ABSTRACT FROM AUTHOR]

This paper analyzes two schemes from a 2019 work by Liu, Yang, Han and Wang, namely, adapting the McEliece cryptosystem to obtain a new public-key encryption scheme, and designing an efficient CFS-like digital signature. It is shown that the new encryption scheme based on McEliece, even if it has longer public keys, is not more secure than the standard one. The security gap between the original scheme and its modification is presented. Moreover, while the proposed parameters for the digital signature scheme lead to a significant performance improvement, however, they introduce a vulnerability in the protocol. A key-forgery attack using the Support Splitting Algorithm as a subroutine is described, with a study of the computational cost of retrieving the secret key from the public one. [ABSTRACT FROM AUTHOR]

Social media blockchain is emerging as a promising solution to deal with privacy issues, by putting user privacy in edge nodes rather than centralized nodes. Under the protection of information encryption, only those who have cryptographic keys can get access to key information. This work aims at multimedia information in social media blockchain and utilizes the RSA encryption mechanism to construct the information encryption system. Due to the resilience of biometric features, the biometric cryptographic keys are not easy to be fabricated. Thus, this paper proposes a biometric keys-enhanced multimedia encryption algorithm for social media blockchain. First of all, the wiener filter is adopted to make some preprocessing operations to images, such as noise reduction. On this basis, the discrete wavelet transform is adopted to extract feature representation from images, and nonlinear approximation of contourlet transform is adopted to make feature fusion. Next, cryptographic keys can be generated from the fused biometric feature vectors to encrypt biometric data. Finally, some simulation experiments are conducted to evaluate performance of the proposal from three aspects: key generation time, security level and encryption-decryption time complexity. For key generation time, processing speed of the proposal is approximately 1–2 ms per sample. For security level, the proposal can reach an index value beyond 95% which is higher than comparison methods. For encryption-decryption time complexity, the proposal is about 30% lower than comparison methods. [ABSTRACT FROM AUTHOR]

Apple-picking robot can promote the development of smart agriculture, and accurate object recognition in complex natural environments using deep learning algorithms is critical. However, research has shown that changes in illumination and object occlusion remain significant challenges for recognition. In order to improve the accuracy of apple apple-picking robot's identification and positioning of apples in natural environment, a method using YOLOv5 (You Only Look Once, YOLO) combined with fast-guided filter is proposed. By introducing a fast-guided filtering module, the ability to extract image features is improved, and the problem of inaccurate occlusion targets and edge detection is solved; K -means clustering algorithm is introduced in improving YOLOv5, which can realize automatic adjustment of image size and step size; BiFPN structure is introduced in Neck network to add weighted feature fusion to highlight the detailed features. The results show that the algorithm proposed in this paper can well remove noise information such as occlusion edge blurring in apple images in a natural light environment. In the real orchard environment, the apple recognition accuracy rate reached 97.8%, the recall rate was 97.3% and the recognition rate was about 26.84 fps. The results show that this research based on YOLOv5 and fast-guided filtering can realize fast and accurate identification of apple fruits in natural environment, and meet the practical application requirements of real-time target detection. [ABSTRACT FROM AUTHOR]

Deep learning classification is commonly used to assess biomedical data. Fetal heart rate (FHR) signal data monitor the health of both the mother and the fetus and prevent mobility and death in fetuses at risk of hypoxia. But, the data imbalance is a major problem and happens frequently. To overcome this problem, a Deep Siamese domain adaptation convolutional Neural Network optimized with Honey Badger Algorithm (HBA) is proposed in this paper for Fetal Arrhythmia Detection and Classification from ECG signals (DSDACNN-HBA-FAC). The input ECG signals are collected from the fetal ECG dataset. Then, the ECG data are pre-processed using coherence shock filtering (CSF), which eliminates artifacts, like baseline drift, contact noise, muscle artifacts, electrode motion, electromyography artifacts. Using the improved non-subs sampled Shearlet transform (INSST) method, the pre-processed ECG data recover the mean, standard deviation, root mean square, skewness, kurtosis, zero-crossing, autoregressive coefficients, estimated entropy, and Higuchi's fractal dimension. The DSDACNN classifier utilizes the features extracted to categorize the output as normal and arrhythmia. In general, DSDACNN does not agree on any optimization techniques to define the optimum parameters and to ensure accurate classification. Therefore, HBA is employed to optimize the DSDACNN weight parameters. The proposed method is implemented in MATLAB. The performance metrics, like sensitivity, precision, recall, f-measure, specificity, accuracy, computation time, RoC, and error rate are evaluated. The performance of DSDACNN-HBA-FAC achieves 3.101%, 7.12%, 7.73% high accuracy, 51.136%, 59.04%, 44.51% lower computation Time and 2.292%, 5.365%, 1.551% greater AUC compared with the existing techniques, like Fetal Arrhythmia Detection with Classification from ECG Signals: A NonInvasive Method (ANN-FAC), Semi-supervised active transfer learning for fetal ECG arrhythmia identification (DNN-FAC), fetal arrhythmia detection using adaptive single channel electrocardiogram extraction (CNN-FAC), respectively. [ABSTRACT FROM AUTHOR]

Symbolically representing the knowledge acquired by a neural network is a profound endeavor aimed at illuminating the latent information embedded within the network. The literature offers a multitude of algorithms dedicated to extracting symbolic classification rules from neural networks. While some excel in producing highly accurate rules, others specialize in generating rules that are easily comprehensible. Nevertheless, only a scant few algorithms manage to strike a harmonious balance between comprehensibility and accuracy. One such exemplary technique is the Rule Extraction from Neural Network Using Classified and Misclassified Data (RxNCM) algorithm, which adeptly generates straightforward and precise rules outlining input data ranges with commendable accuracy. This article endeavors to enhance the classification performance of the RxNCM algorithm by leveraging ensemble technique. Ensembles, a burgeoning field, focus on augmenting classifier performance by harnessing the strengths of individual classifiers. Extraction of rules through neural network ensembles is relatively underexplored, this paper bridges the gap by introducing the Rule extraction using Neural Network Ensembles (RENNE) algorithm. RENNE is designed to refine the classification rules derived from the RxNCM algorithm through ensemble strategy. Specifically, RENNE leverages patterns correctly predicted by an ensemble of neural networks during the rule generation process. The efficacy of the algorithm is validated using seven datasets sourced from the UCI repository. The outcomes indicate that the proposed RENNE algorithm outperforms the RxNCM algorithm in terms of performance. [ABSTRACT FROM AUTHOR]

We propose a hybrid approach for solving problems of mixed-integer linear programming with two types of variables (MILPTTV). The hybrid approach includes three algorithms: (1) Benders decomposition; (2) the ant colony algorithm; (3) the feasible heuristic method. We decompose the programming problem into a master problem and a subproblem using Benders decomposition. The ant colony algorithm generates an initial solution for the master problem. A feasible heuristic is used to obtain feasible solutions as input to the subproblem, whereas the subproblem is solved to optimality by using a linear programming solver that is named Linprog function in MATLAB R2016a. Over successive iterations, the master problem is refined by adding cuts from the subproblem and the master problem is solved by a linear programming solver Cplexmilp function. We compare the performance of the proposed hybrid approach against a general Benders decomposition approach as well as against a mixed-integer programming solver CPLEX (version 12.6) that is invoked by MATLAB on MIPLIB test problem mas76, mas74 and some large-scale numerical examples. [ABSTRACT FROM AUTHOR]

This paper introduces a methodology for computing expected values associated with compression networks resulting from the application of compression algorithms to independent and identically distributed random time series. Our analysis establishes a robust correspondence between the calculated expected values and empirically derived results obtained from constructing networks using nondeterministic time series. Notably, the ratio of the average indegree of a network to the computed expected indegree for stochastic time series serves as a versatile metric. It enables the assessment of inherent randomness in time series and facilitates the distinction between nondeterministic and chaotic systems. The metric demonstrates high sensitivity to nondeterminism in both synthetic and real-world datasets, highlighting its capacity to detect subtle disturbances and high-frequency noise, even in series characterized by a deficient sample rate. Our results extend and confirm previous findings in the field. [ABSTRACT FROM AUTHOR]

The CDT subproblem, which minimizes a quadratic function over the intersection of two ellipsoids, is a classical quadratic programming problem. In this paper, we study a method of solving CDT with a positive Lagrangian duality gap. An efficient splitting algorithm is proposed for finding the global optimal solutions. A cutting plane is firstly added to divide the feasible set of CDT into two subsets, and then two new quadratic programming problems with ellipsoidal and linear constraints are generated accordingly. Using the newly developed technique — second-order cone constraints to enhance the efficiencies of the SDP relaxation-based algorithms on the two subproblems, an optimal solution of CDT can be acquired by comparing the objective values of the two subproblems. Numerical experiments show that the new algorithm outperforms the two recent SDP relaxation-based algorithms, the two-parameter eigenvalue-based algorithm and the solver Gurobi 9.5 for certain types of CDT. [ABSTRACT FROM AUTHOR]

In computer vision, automatically identifying and locating text in images or videos is an important task. Traditional text detection methods are not effective in detecting complex scenes in irregular rectangular areas such as text bending, spacing, and special shapes, which are mainly reflected in the fragmentation of text detection areas. In this paper, a text detection method based on edge attention mechanism is proposed to better adapt to complex scenes. The proposed method takes Encoder–Decoder as the core idea. First of all, an edge attention module is designed, including global attention and local attention. The global attention module is used to perceive the features of text regions and nontext regions, while the local attention module is used to learn the information of text boundaries. Then a multi-scale feature fusion process is designed, which can strengthen the edge information and key information of text regions. Finally, the model outputs probability maps and threshold maps, and generates high-precision binary maps of text regions. After experimental verification, the proposed method on the public data set significantly reduces the fragmentation of the detection area, improves the detection accuracy of the text area, and has better robustness for text detection scenes with unconventional rectangular areas. [ABSTRACT FROM AUTHOR]

As a widely used network security defense technology, network intrusion detection has more deep learning methods used to improve the performance of intrusion detection. However, this method requires a large-scale network traffic data set for training, increasing privacy leakage risk. In this paper, a network intrusion detection algorithm based on Gaussian differential privacy federated learning (NIDS-FLGDP) is proposed. NIDS-FLGDP adopts the client–server architecture of federated learning, introduces the differential privacy of the Gaussian mechanism to ensure the security of the calculation process, uses the improved FedAvg algorithm to reduce communication overhead, and uses the improved 1D CNN to participate in collaborative training for the local model. Optimal parameters for Gaussian differential privacy and the optimal number of participating clients were determined from experiments. Model accuracy rates for binary classification and multi-classification training NIDS-FLGDP are 0.97, 0.975, 0.97 and 0.97, 0.985, 0.96, respectively, for KDD CUP99, NSL_KDD, and UNSW_NB15 network intrusion detection datasets. The results show that NIDS-FLGDP improves intrusion detection performance while protecting network traffic privacy compared with the previous methods. Its applicability and effectiveness have been fully verified, which provides a practical reference for the safe processing and analysis of a large number of diversified network traffic data in the future. [ABSTRACT FROM AUTHOR]

This paper proposes a novel algorithm that combines symbolic execution and data flow testing to generate test cases satisfying multiple coverage criteria of critical software applications. The coverage criteria considered are data flow coverage as the primary criterion, software safety requirements, and equivalence partitioning as sub-criteria. black The characteristics of the subjects used for the study include high-precision floating-point computation and iterative programs. The work proposes an algorithm that aids the tester in automated test data generation, satisfying multiple coverage criteria for critical software. The algorithm adapts itself and selects different heuristics based on program characteristics. The algorithm has an intelligent agent as its decision support system to accomplish this adaptability. Intelligent agent uses the knowledge base to select different low-level heuristics based on the current state of the problem instance during each generation of genetic algorithm execution. The knowledge base mimics the expert's decision in choosing the appropriate heuristics. black The algorithm outperforms by accomplishing 100% data flow coverage for all subjects. In contrast, the simple genetic algorithm, random testing and a hyper-heuristic algorithm could accomplish a maximum of 83%, 67% and 76.7%, respectively, for the subject program with high complexity. black The proposed algorithm covers other criteria, namely equivalence partition coverage and software safety requirements, with fewer iterations. black The results reveal that test cases generated by the proposed algorithm are also effective in fault detection, with 87.2% of mutants killed when compared to a maximum of 76.4% of mutants killed for the complex subject with test cases of other methods. [ABSTRACT FROM AUTHOR]

Twin delayed deep deterministic (TD3) policy gradient has several limitations when applied in planning a path in environment with a number of dilemmas according to our experiment, due to the complexity of the robot path planning task, the rate of convergence of TD3 algorithm is slow and the rate of collision is high. To address this problem, deep dense dueling twin delayed deep deterministic (D3-TD3) architecture is proposed, a method that preserves important information from cross-layer inputs through dense connections and divides the network into a value function and a dominance function, thus, allowing for faster convergence when solving complex tasks. Finally, a spatial model based on three-dimension (3D) point cloud is built, and simulation experimental results show that in static environment, the algorithm proposed in the paper has 40.6% fewer collisions compared to TD3, 30% fewer collisions compared to TD3-BC, 19.2% fewer collisions compared to Dueling TD3 and 17.4% fewer collisions compared to deep dense TD3. In dynamic and static environment, the algorithm proposed in the paper has 34.4% fewer collisions compared to TD3, 24% fewer collisions compared to TD3-BC, 6% fewer collisions compared to Dueling TD3 and 25% fewer collisions compared to deep dense TD3. [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]

Personalized recommendation systems learn user preference characteristics by analyzing behavioral data such as ratings and comments generated by users in the Internet, and provide precise recommendations for individual users accordingly. However, in real life, users often conduct group activities like group buying and traveling together. How to recommend for groups has become a heated research topic in recent years. Most existing group recommendation algorithms are recommended for given divided groups by collectively combining the preferences of members in the group. However, in most cases, users' group properties are fickle. As the results of group detection are decisive to the performance of group recommendation, group detection is particularly important to the group recommendation algorithm. After analyzing problems of existing group recommendation algorithms, this paper proposes the density peak clustering group detection algorithm based on GRU-CNN and the group recommendation algorithm based on the mechanism. With respect to group detection, most of the existing group detection algorithms suffer from certain deficiencies: First, depending solely on the users' static preference features while ignoring the variation of users' interest over time when finding the group structure in the network; second, group division based on users' topic features extracted from reviews is difficult to support further digging of the in-depth features in reviews. To address the above-mentioned problems, this paper proposes a density peak clustering group detection algorithm based on CNN-GRU. It would first extract representative keywords in the reviews with LDA topic model, and then model time series information based on GRU attaining users' dynamic topic features. Coupling with deeper characteristics cored out by CNN, density peak clustering algorithm completes its group detection finally. Experiments on real dataset indicate that the features mined by the fusion depth neural network model effectively capture users' dynamic preferences, and yield better results of group detection than that of existing algorithms. [ABSTRACT FROM AUTHOR]

With the rapid development of the Internet of Things (IoT) and Internet technology, the product of the combination of the two, the Industrial Internet, has also received extensive attention and there are more and more research achievements related to the Industrial Internet. In the industrial Internet system, the communication network system composed of sensors, communication nodes, controllers and other intelligent devices can realize efficient and convenient data interaction between people and machines, providing an important infrastructure and technical support for industrial big data analysis and intelligent production. However, in the current industrial Internet system, industrial equipment users generally have the problem of low computing energy efficiency, and the collected industrial data has a high-security risk in the transmission, processing and other processes. At the same time, the size and scale of the industrial Internet equipment group is huge, and the lack of rational resource allocation leads to excessive waste of computing resources in the system, which is also a prominent problem of the current industrial Internet system. In response to the above questions, this paper, on the basis of reading a large number of documents, integrates the improved DRL algorithm, End-Edge-Cloud architecture and blockchain to form a new industrial Internet architecture. The architecture realizes computing offload through the three-tier structure of terminal layer, edge layer and cloud layer, and guarantees the security of industrial data through the decentralized feature of blockchain, ultimately achieving the goal of reducing energy consumption, computing overhead and trusted computing. In the architecture proposed in this paper, the dynamic unloading of industrial data and computing tasks is achieved through a three-tier architecture. The MDP is used to build an optimization problem model, and the improved DRL algorithm is used to iteratively solve the optimal computing resource scheduling strategy. The main research contents of this paper include (1) Using MDP to model optimization problems; (2) Propose an industrial Internet system architecture that integrates and improves DRL, "end edge cloud" and blockchain; (3) The MDP problem is solved iteratively based on deep reinforcement learning. The simulation results show that the proposed architecture has more advantages than the existing six architectures in terms of computing cost, equipment energy consumption and total working time. [ABSTRACT FROM AUTHOR]

In this paper, a modified eigensystem realization algorithm for modal parameter identification and relaxation parameter is extended from a viscous damping system to a nonviscous damping system. The equation of motion with nonviscous damping in second-order form is expressed in the state space formulation. The eigenvalues of the second-order form equation are proved equal to the state space formulation. The extended method is based on the proposed nonlinear relationship between the eigenvalues and the damping parameters of a nonviscous damping system. The identified procedure of the proposed method is given in detail. Finally, the method is validated using three numerical examples for assessing its accuracy. [ABSTRACT FROM AUTHOR]

This paper proposes a novel adaptive robust control scheme for accuracy enhancement of eye-to-hand photogrammetry-based industrial robots subject to uncertainties. The proposed method uses two control loops: internal and external loops. The former is the dynamic controller designed for controlling the robot's joints. The external loop is the kinematic controller to minimize the error of the end-effector detected by the photogrammetry sensor. An adaptive integral terminal fractional-order super-twisting algorithm (AITFOSTA) is developed and employed for both control loops. AITFOSTA is an integral sliding-mode controller (ISMC) whose nominal control law is terminal. Its switching part is replaced with a fractional-order super-twisting algorithm (FOSTA), reducing the chattering to a great extent while rejecting the uncertainties. Additionally, an adaptive uncertainty and disturbance estimator based on radial basis function neural networks (RBFNNs) is designed and employed to reduce the uncertainty bounds, contributing to further chattering reduction. The stability analysis of the proposed controller is also presented. Simulation and experimental results show the superiority of the proposed method over other well-known approaches by reaching an unprecedented tracking accuracy, i.e. 0.06 mm and 0.18 ∘ for position and orientation, respectively. [ABSTRACT FROM AUTHOR]

Multi-Objective Travelling Salesman Problem (MOTSP) is one of the most crucial problems in realistic scenarios, and it is difficult to solve by classical methods. However, it can be solved by evolutionary methods. This paper investigates the Constrained Multi-Objective Travelling Salesman Problem (CMOTSP) and the Constrained Multi-Objective Solid Travelling Salesman Problem (CMOSTSP) under an uncertain environment with zigzag uncertain variables. To solve CMOTSP and CMOSTSP models under uncertain environment, the expected value and optimistic value models are developed using two different ranking criteria of uncertainty theory. The models are transformed to their deterministic forms using the fundamentals of uncertainty. The Models are solved using two solution methodologies Aspiration level-based Multi-Objective Quasi Oppositional Jaya Algorithm (AL-based MOQO Jaya) and Fuzzy Programming Technique (FPT) with linear membership function. Further, the numerical illustration is solved using both methodologies to demonstrate its application. The sensitivity of the OVM model's objective functions regarding confidence levels is also investigated to look at the variation in the objective function. The paper concludes that the developed approach has solved CMOTSP and CMOSTSP efficiently with an effective output and provides alternative solutions for decision-making to DM. [ABSTRACT FROM AUTHOR]

In this paper, we define the adjacency matrix of a semigraph. We give the conditions for a matrix to be semigraphical and give an algorithm to construct a semigraph from the semigraphical matrices. We derive lower and upper bounds for largest eigenvalues. We study the eigenvalues of adjacency matrix of two types of star semigraphs. [ABSTRACT FROM AUTHOR]

In this paper, we present an efficient algorithm, namely Orienting and Final Circles (OFC)-Delaunay Triangulation, for constructing the Delaunay triangulation of a finite planar point set using the idea of the Method of Orienting Curves (introduced by Phu in Zur Lösung einer regulären Aufgabenklasse der optimalen Steuerung im Groen mittels Orientierungskurven, Optimization 18(1) (1987) 65–81 and Ein konstruktives Lösungsverfahren für das Problem des Inpolygons kleinsten Umfangs von J. Steiner, Optimization 18(3) (1987) 349–359). The concepts of orienting and final circles are introduced. The Delaunay edges are determined by orienting circles and a final circle. Our algorithm has O (n log n) worst-case running time. The algorithm is implemented in Python and some numerical examples are presented. [ABSTRACT FROM AUTHOR]

The aim of this paper is to develop a set of algorithms for defect identification in any crystal system based on structural data from molecular dynamics simulations. The set, named FEDIS, consists of two algorithms: the extended centrosymmetric parameter (E-CSP) method and the fast neighbor distance analysis (F-NDA) method. The E-CSP extends the Central Symmetric Parameter (CSP) method for centrally symmetric materials by introducing a compensation term for asymmetric crystal that adapts to all crystal systems. The F-NDA modifies the Nearest Neighbor Analysis (NDA) method by replacing vector computation with scalar computation. The developed algorithms are validated through several cases that demonstrate their effectiveness and efficiency in detecting various types of defects. The algorithms are implemented in C++ and integrated into 3D interactive interface software that can be downloaded on GitHub. [ABSTRACT FROM AUTHOR]

[M. Ma, The connectivity of exchanged hypercubes, Discrete Math., Algorithms Appl. 2(2) (2010) 213–220.] proved that the vertex connectivity and the edge connectivity of the exchanged hypercube are each equal to the minimum degree of the graph. This paper presents a proof of that result, which is substantially simpler and more intuitive. [ABSTRACT FROM AUTHOR]

Many damage identification methods are based on a comparison of structure response between healthy and damaged states. However, the healthy state response of especially old bridges is rarely available. In this paper, a new output-only damage identification approach is proposed to locate damage in multi-span bridges. In this method, only the damaged state strain and displacement influence lines are required. This approach is theoretically explained for a three-span girder. The middle span, the health condition of which is in quest, is modeled as a single-span beam, supported by rotational springs with unknown stiffness. A new algorithm is proposed to estimate the healthy state displacement influence line of the middle point of the span. In this algorithm, the ratio of the flexural stiffness of the girder to the spring's rotational stiffness is determined in such a way that the estimated displacement, is as close to the measured response, as possible. Then, the estimated displacement is scaled based on two constraints. First, it is expected to be lower than the pseudo-static component of measured displacement because damage increases the response globally. Second, the difference between the scaled and pseudo-static component of the measured response is minimized. Eventually, damage is located using a novel damage index based on the local deviation of pseudo-static component of measured displacement from the estimated scaled response. The proposed method is numerically evaluated in a three-span girder. The damage is successfully identified in all different scenarios. Also, its application to Powder Mill Pond Bridge is numerically investigated which yielded promising results. [ABSTRACT FROM AUTHOR]

Recently, there had been a massive group of people, who were being rapidly affected by melanoma. Melanoma is a form of skin cancer that develops on the skin's surface layer. This is primarily caused due to excessive skin exposure to UV radiation and severe sunburns. Thus, the early detection of melanoma can aid us to cure it completely. This paper intends to introduce a new melanoma detection framework with four main phases viz. segmentation, feature extraction, optimal feature selection, as well as detection. Initially, the segmentation process takes place to the input skin image via Fuzzy C-Means Clustering (FCM) approach. From the segmented image ( Im seg ) , some of the features such as Gray Level Run Length Matrix (GLRM), Local Vector Pattern (LVP), Local Binary Pattern (LBP), Local Directional Pattern (LDP) and Local Tetra Pattern (LTrP) are extracted. As the extracted features (F) suffered from the issue of "curse of dimensionality", this paper utilizes optimization to select optimal features, which makes the detection more precise. As a novelty, a new hybrid algorithm Particle-Assisted Moth Search Algorithm (PA-MSA) is introduced that hybridizes the concept of Moth Search Algorithm (MSA) and Particle Swarm Optimization (PSO), respectively. For the classification process, the optimally chosen features (F opt ) are fed as input, where Deep Convolution Neural Network (DCNN) is used. Finally, a performance-based comparative analysis is conducted among the proposed PA-MSA as well as the existing models with respect to various measures. [ABSTRACT FROM AUTHOR]

Numerical procedure plays a key role in tackling the solutions of nonlinear dynamical systems. With the advent of the age of big data and high-power computing, developing efficient and fast numerical algorithms is an urgent task. This paper extends the Lie derivative discretization algorithm to the nonautonomous nonlinear systems and investigates the numerical solutions of the systems. The periodic solutions of three different classical nonlinear systems are calculated, and the results are compared to those values calculated from the Runge–Kutta fourth-order algorithm, which demonstrated that the Lie derivative algorithm has the advantages of large time step and short computation time. [ABSTRACT FROM AUTHOR]

For the parameter estimation problem in research related to the fractional-order chaotic systems (FOCSs), a modified optimization algorithm based on Salp Swarm Algorithm (SSA) was developed in this paper. The proposed algorithm introduced several improvements on SSA: adding a grouping step, introducing "betrayal" behavior, and improving the update method of the followers. We applied multiple classical optimization algorithms to conduct the parameter estimation experiments on the fractional-order Lorenz chaotic system (Lorenz-FOCS) and the fractional-order Financial chaotic system (Financial-FOCS). In addition, we explored the impact of searching space on parameters estimation through experiments. The experimental results confirmed the feasibility of the modified Salp Swarm Algorithm (MSSA). The MSSA performed better than the SSA and other classical optimization algorithms in terms of the estimation accuracy and convergence rate. [ABSTRACT FROM AUTHOR]