Search

Now, we have entered the "internet plus" era, and all industries are making use of information technology to seek a longer-term development. For vegetable distribution, we must rely on the power of information technology. Faced with complex global optimization problems, traditional optimization algorithms have many performance limitations, such as complex solution process and easy to fall into local optimization, which can't meet the needs of practical applications. This paper studies the design and application of optimization algorithm for vegetable planting and distribution based on adaptive differential evolution algorithm. The method adopted in this paper is adaptive differential evolution algorithm. In the original differential evolution algorithm, there are three undetermined parameters: population size (NP), variation factor (F) and crossover probability (CR). In the process of evolution, NP takes a fixed value, while the key control parameters F and CR, which affect the performance of the algorithm, will adaptively take different values on [0,1], and the values of F and CR will be recalculated for each individual in each generation. Let F and CR automatically adjust and change in the process of evolution. The research in this paper shows that the algorithm in this paper is effective and suitable for application. [ABSTRACT FROM AUTHOR]

Clustering is one of the most common technologies in data mining. The size, dimension and sparsity of data are all different aspects that restrict clustering analysis. Clustering machine learning is called unsupervised learning, which is different from classification in that the data objects used in clustering analysis have no class marks, so they need to be calculated by the clustering learning algorithm, while the classified data objects need class marks. At present, most of the sparse data algorithms with high attribute dimensions are oriented to binary data, and there is no evaluation method of clustering results, which brings great limitations to their application. The BP neural network, RBF neural network and Elman neural network model with feedback function, which are mature and widely used in pest prediction models, are studied. The purpose of this paper is to study diseases and pests based on sparse clustering algorithm. In this paper, algorithm formulas, models and data graphs are established to study. From the research, it can be seen that the damage index of pests and diseases is very high, reaching about 50. 54%. Through the research in this paper, we can know that the future will lay a certain foundation for the research of diseases and pests. [ABSTRACT FROM AUTHOR]

In order to be able to extract useful information from MRI medical images, we need to carry out effective image segmentation of MRI medical image and use appropriate operators to detect the edge of the image. Firstly, this paper adopts a research method based on the characteristics of horizontal, vertical and diagonal differences, and then carries out comparative analysis on different operators from different perspectives such as frequency domain and velocity domain. After analyzing the results, it is concluded that: Canny operator can detect complete, continuous and detailed edges at a faster speed. This paper uses edge detector based on Canny operator as the training output of artificial neural network. By training artificial neural network. The optimized parameters were obtained, and subjective analysis and computational analysis were performed on the quality of edge detection results of MRI medical images based on different methods. The results show that compared with the single Sobel, Canny and other traditional operators, the edge information of MRI medical image obtained by the neural network-based edge detection method is more complete and its processing time is nearly 3 times faster than the traditional edge detection method. [ABSTRACT FROM AUTHOR]

• A Mixed Particle Swarm Optimization model is developed for optimal network reconfiguration and DG integration. • Optimal network reconfiguration allow a better penetration of renewable energy in the system. • Optimal integration of DG units dramatically increases the voltage level and the optimal exploitation of the DS. • DG integration along with optimal NR greatly contribute to power losses minimization and voltage level enhancement. This paper introduces a Mixed Particle Swarm Optimization (MPSO) approach for active power loss minimization and voltage profile improvement in the distribution network. The developed technique joins the Binary Particle Swarm Optimization (BPSO) and the conventional PSO algorithms. The first one is devoted to identify the optimal distribution network configuration, while the second one is used to solve Distributed Generation (DG) placement and sizing problems. To evaluate the performance of the developed approach, three different load scenarios were assessed during network reconfiguration (NR) and DG integration. Simulations are conducted on two distribution test systems, namely, the IEEE-33-bus and the IEEE-69-bus. The obtained results clearly demonstrate the performance and the effectiveness of the proposed method to find optimal status of switches, as well as DG locations and sizes. A benchmark comparison is presented to prove the efficiency of the proposed MPSO with regard to other optimization techniques. The results show that MPSO outperforms these techniques in terms of quality of solution, power loss reduction and voltage profile enhancement. This study is an extension of the earlier published conference paper. [ABSTRACT FROM AUTHOR]

Given a graph G = (V , E) , an L (2 , 1) -labeling of the graph is an assignment ℓ from the vertex set to the set of nonnegative integers such that for any pair of vertices (u , v) , | ℓ (u) − ℓ (v) | ≥ 2 if u and v are adjacent, and ℓ (u) ≠ ℓ (v) if u and v are at distance 2. The L (2 , 1) -labeling problem is to minimize the range of ℓ (i.e., max u ∈ V (ℓ (u)) − min u ∈ V (ℓ (u)) + 1). Although the problem is generally hard to approximate within any constant factor, it was known to be approximable within factor 10.67 for unit disk graphs. This paper designs a new way of partitioning the plane into squares for periodic labeling, based on which we present an 8-approximation polynomial-time algorithm for L (2 , 1) -labeling of unit disk graphs. • An 8-approximation algorithm of L(2,1)-labeling for unit disk graphs with geometric representations is presented. • The previously known bound is 10.67. • The presented algorithm gives a simple periodic labeling based on a new way of partitioning the plane into squares. [ABSTRACT FROM AUTHOR]

In this paper, a novel spectral method is presented and studied for the fourth order problem with mixed boundary in a cylindrical domain. The basic idea of our approach is to reduce the original problem into a series of decoupled two-dimensional fourth-order problems first, by using the cylindrical coordinate transformation and Fourier expansion, and then adopt the standard spectral method to solve the decoupled problems. A new essential pole condition is proposed to overcome the difficulty caused by the introduction of singularity and variable coefficients in cylindrical coordinate transformation. Existence and uniqueness of the weak solution and the discrete numerical solution are proved, and error estimates of the spectral method are derived. Furthermore, the efficient implementation of our algorithm is discussed, where a set of effective basis functions are constructed to ensure the sparsity of the mass matrix and stiffness matrix. Numerical examples are presented to validate the theoretical findings and the efficiency of our algorithm. [ABSTRACT FROM AUTHOR]

In this paper, we present a two-grid lumped mass finite element algorithm for 2D Allen-Cahn equations, where Crank-Nicolson scheme and piecewise linear element are utilized for temporal and spatial discretization, respectively. Both the maximum-norm boundedness and H 1 -norm error estimates of the proposed two-grid scheme are discussed. Finally, a numerical example is given to verify the theoretical results. By comparing with the finite element scheme and the two-grid finite element scheme, we found that our scheme has a great advantage in calculation time. [ABSTRACT FROM AUTHOR]

• A novel three-dmensional chaotic system NewSysm is constructed for keystream. • A fresh model TransM is built for the production of plaintext keys. • A new model GetM is established for computing of the initial values of NewSysm. • Three bit planes of the cipher image are decomposed for hidding respectively. In this paper, a three-dimensional chaotic system is proposed. Based on this chaotic system and two-dimensional compressive sensing, an asymmetric visually meaningful image compression-hiding algorithm is presented. Firstly, in the keystream generation stage, a novel parameter transformation model is constructed to pick up the feature information from the plain image as the plaintext key. Then, Rivest-Shamir-Adleman algorithm is employed to encrypt the plaintext key into the ciphertext key seen as public key. Before generating the initial values for the chaotic system, a new initial value getting model is designed to transform both the plaintext and the ciphertext keys. After solving the chaotic system, the keystream is produced which is then used in the image encryption process. Secondly, in the compression and encryption phase, a novel keystream pre-processing model is built to generate new sequences with a confusion performed on the plain image. Then, a newly constructed measurement matrix is designed to do two-dimensional compressive sensing on confusing the image to get measurements. Before obtaining the cipher image, a double diffusion operation is applied on these measurements. Thirdly, in the image hiding stage, the carrier image is performed by integer wavelet transformation to obtain coefficient matrices. Then, the cipher image is decomposed in decimal, getting the ones, tens and hundreds of pixels to form three bit matrices, of which are embedded into the three medium-high coefficient matrices of integer wavelet transformation, respectively. Finally, after performing inverse integer wavelet transformation, the carrier image containing secrets, i.e., visually meaningful encrypted image, is obtained. Experimental results also show that at a low compression ratio of 0.25, the normalized correlation coefficient between the original plain image and the recovered image is almost equal to one, while the peak signal-to-noise ratio between the carrier image containing secrets and its original carrier can reach as high as 42 dB. In addition, the proposed image compression-hiding algorithm performs good ability consideing the brute force attack and the cropping attack. [ABSTRACT FROM AUTHOR]

The Black Hole Clustering (BHC) algorithm is a density-based partitional clustering method inspired by the Density-based Spatial Clustering of Applications with Noise (DBSCAN). It does not require the number of clusters nor the computation of the pair-wise distance matrix between the data points, making it faster than DBSCAN. Also, it only needs one parameter that is intuitively easier to set than the epsilon parameter of DBSCAN. However, BHC needs the allocation of the so-called black holes that have to be linearly independent, making the algorithm in its current version suitable only for two or three-dimensional data sets. In this paper, we propose a generalized version of the black hole clustering algorithm (GBHC) by introducing a novel black hole allocation procedure for higher-dimensional data spaces. Furthermore, the proposed method is data-independent, so we have to run it once to obtain the black hole positions for all finite-dimensional metric spaces. We performed extensive computational experiments to compare GBHC with DBSCAN. The results show that both algorithms obtain comparable clustering solutions. GBHC, however, outperforms DBSCAN in computational complexity and explainability. • We propose a novel method to place the black holes for high-dimensional data sets. • This method is called Generalized Black Hole Clustering and it is data-independent. • We run the new method once to get black hole positions in all finite metric spaces. • We compare the GBHC and DBSCAN algorithms using several validation measures. [ABSTRACT FROM AUTHOR]

In this paper, a brain-like navigation scheme based on fuzzy kernel C-means (FKCM) clustering assisted pyramid Lucas Kanade (LK) optical flow algorithm is developed to measure the position of vehicle. The Speed Cell and Place Cell in animals' brain are introduced to construct the brain-like navigation mechanism which involves the optical flow method and image template matching to imitate the cells above-mentioned separately. To eliminate the singular values during optical flow calculation, the output of pyramid LK algorithm is clustered by FKCM algorithm firstly. Then, the velocity is calculated and integrated to get the position of the vehicle, and the brain-like navigation scheme is introduced to correct the position measurement errors by eliminating the accumulated errors resulting from velocity integration. The prominent advantages of the presented method are: (i) a pure visual brain-like position measurement method based on the concept of speed cells and place cells is proposed, making visual navigation more accurate and intelligent; (ii) the FKCM algorithm is used to eliminate the singular value of the pyramid LK algorithm, which improves the calculated velocity accuracy. Also, experimental comparison with classical pyramid LK algorithm is given to illustrate the superiority of the proposed method in position measurement. • Analyzed impact of clustering algorithms on optical flow precision. • Achieved notable reduction in optical flow singular value. • Brain-like navigation minimizes velocity integral errors. [ABSTRACT FROM AUTHOR]

This paper proposes and analyzes a second-order decoupled Backward Euler method plus time filter for the evolutionary Stokes/Darcy model, which allows different variable time steps in the free fluid flow region and the porous media flow region. Furthermore, this algorithm, which is a combination of first order Backward Euler method and time filter scheme, uncouples the Stokes/Darcy model into the Stokes and Darcy problems per time step. In particular, adaptive algorithm is constructed to improve the computational efficiency. Moreover, we mainly deduce the stability and error estimation in theoretical analysis. In addition, numerical experiments are used to verify the effectiveness, second order convergence and efficiency. [ABSTRACT FROM AUTHOR]

• Space debris detection; • Payload camera breadboard for space surveillance; • Star tracking and space debris detection algorithms; • Hybrid time-index image algorithm. Space debris threatens space activities, demanding continuous observation and tracking by the Space Surveillance Network (SSN) to secure the Earth's orbits. However, SST efforts are limited by the size and brightness of the debris, detecting only a small amount of the total. Seeking to overcome such limitations, this study proposes an alternative payload camera capable of extracting the attitude of a satellite in orbit and detecting under-catalogued debris. This work is a sequential study of previous research, where the camera breadboard was designed and implemented. The contribution of this paper is the evaluation of star tracking and space debris algorithms to be implemented in the payload camera, the development and implementation of a new hybrid algorithm and the elaboration of performance metrics for comparison between the algorithms. The observation data of the previous research was used as input for the algorithms' tests. For star identification and, consequently, attitude extraction, the chosen algorithm was Tetra. The results were compared to the standard star identification software, Astrometry.net , to assess the attitude accuracy. For debris detection, ASTRiDE and the Hybrid time-index image algorithms were used. A comparison of the results was made to establish a performance evaluation metric in terms of detectability, time, and computational cost. [ABSTRACT FROM AUTHOR]

• A computing method for constellation-to-ground coverage is investigated. • The maximum and minimum coverage regions are calculated. • Simulation results demonstrate the validity and effectiveness of the proposed algorithm. The issue of constellation-to-ground coverage is a research focus in Earth observation applications. Traditional calculations often rely on grid point methods or their derivatives, but these can be limited in their application, relatively costly, inefficient, and often do not account for potential errors. This paper proposes a novel, efficient method based on latitude strip division for calculating the ground area coverage of satellite constellations, capable of providing the upper and lower bounds of coverage ratio for any ground area. Initially, the ground target area is divided into several latitude strips, and the target area range is utilized to determine the longitude range of each latitude strip. Subsequently, the upper and lower bounds of coverage of each strip are calculated according to the satellite ground coverage range. On this basis, the coverage boundary function is defined and the coverage ratio is derived through comprehensive statistics analysis. Finally, depending on the accuracy of the latitude strip division, the precise coverage area and coverage ratio with upper and lower bounds are determined for instantaneous, continuous, and cumulative coverage problems. Numerical simulation experiments were carried out and compared with the traditional grid point method to validate the effectiveness and computational efficiency of this algorithm in addressing the coverage issue for arbitrarily shaped ground areas. When compared to the longitude strip method, it was confirmed that for ground areas where the longitude exceeds the latitude range, this approach offers superior computational efficiency than the latitude strip method. [ABSTRACT FROM AUTHOR]

Due to the fast progress of Deep Learning (DL) methods in remote sensing applications, many change detection (CD) algorithms have been recently proposed based on CNN networks and the mechanism of self-attention. These algorithms extract features without focusing on the temporal dependency between features. This shortcoming led to the introduction of the Transformer mechanism. In this paper, we design a convolutional transformer network with a Siamese U-shaped structure and name it CTS-Unet to solve the CD problem. We exploit the ability of the CNN to extract effective semantic features and that of the transformer to extract global information effectively. The Siamese architecture allows using CNN to simultaneously extract effective semantic features from low-resolution bi-temporal images. The transformer part contains an encoder and a decoder, all of which use the Swin transformer module as their basic unit. The encoder processes the features extracted from the CNN using patch merging and the Swin transformer module to produce semantic features. The encoder extracts the detailed information from the features using patch expansion, the Swin transformer module, and convolutional upsampling to create a CD map. The experiments were performed on the widely used LEVIR-CD and DSIFN-CD datasets. Compared with other state-of-the-art CD methods, CTS-Unet provides higher performance with F1-scores of 91.87% and 69.60% for LEVIR-CD and DSIFN-CD datasets, respectively. [ABSTRACT FROM AUTHOR]

This paper proposes a novel efficient inspired algorithm based on snow avalanches in nature which is named the Snow Avalanches Algorithm (SAA), for solving the benchmark and engineering optimization problems and determining the global solution. The proposed algorithm is modeled using four phases including avalanche due to mountain slope, human factors, weather in the region as well as normal conditions and it has only one control parameter. The advantages of this algorithm are low control parameters, simple structure and also easy implementation. The effectiveness of the SAA algorithm is examined on 23 classic benchmark test functions. Then, the effectiveness of the SAA to achieve accurate results in different aspects is examined and proved on engineering problems including six different cases. The superiority of the SAA to solve the classic benchmark test functions is compared with spotted hyena optimization (SHO), particle swarm optimization (PSO), Aquila optimizer (AO), differential evolution (DE), bat algorithm (BA), dwarf mongoose optimization (DMO), genetic algorithm (GA), artificial bee colony (ABC), and ant colony optimization (ACO). The simulation results provide evidence for the well-organized and efficient performance of the SAA in solving a great diversity of engineering problems. The results demonstrated that the SAA can be more effective than other algorithms to solve the test functions in terms of optimization accuracy and convergence rate. Moreover, the results proved that the SAA obtained more competitive results than the previous methods to solve constrained engineering optimization problems, especially hybrid energy system design as well as economic load dispatch problems. [ABSTRACT FROM AUTHOR]

Shadow detection is a common computer vision task that identifies the location of shadows. It has been used as a key primitive for many high-level tasks such as object segmentation and video tracking. Due to the complexity and variety of shadows, it is challenging to design a one-size-fits-all shadow detection algorithm in real-world scenarios. Instead, it is often necessary in practice to pick the best shadow detection algorithm for a particular vision application. While shadow detection algorithms can be assessed by comparing the detected shadow with the ground truth, such ground truth is often unavailable in real-world vision systems consistently generating new data. In this paper, we propose a no-reference shadow detection quality assessment network (NSDQA-Net) to rank shadow detection algorithms without needing the ground truth. For a given image, the proposed assessment network first learns a reference map that compensates the false positives and false negatives of multiple input shadow detection algorithms. The reference map, as well as the original image and the input shadow detection results, are then used to regress the quality scores of the shadow detection methods. Our framework supports the assessment of one, two, or multiple algorithms in a single run, making it easier for deployment in practical scenarios. Experiments results show that the proposed network achieves optimal accuracy in no-reference shadow detection assessment. Relying on it for adaptive algorithm selection also improves the performance of shadow detection using a fixed algorithm on benchmark datasets. [Display omitted] • We identify a task of no-reference quality assessment in shadow detection. • We design a novel no-reference shadow detection quality assessment network (NSDQA-Net). • We experimentally demonstrate the state-of-the-art performance of the proposed network. [ABSTRACT FROM AUTHOR]

Estimating the pose of an uncooperative spacecraft is an important computer vision problem for enabling the deployment of automatic vision-based systems in orbit, with applications ranging from on-orbit servicing to space debris removal. Following the general trend in computer vision, more and more works have been focusing on leveraging Deep Learning (DL) methods to address this problem. However and despite promising research-stage results, major challenges preventing the use of such methods in real-life missions still stand in the way. In particular, the deployment of such computation-intensive algorithms is still under-investigated, while the performance drop when training on synthetic and testing on real images remains to mitigate. The primary goal of this survey is to describe the current DL-based methods for spacecraft pose estimation in a comprehensive manner. The secondary goal is to help define the limitations towards the effective deployment of DL-based spacecraft pose estimation solutions for reliable autonomous vision-based applications. To this end, the survey first summarises the existing algorithms according to two approaches: hybrid modular pipelines and direct end-to-end regression methods. A comparison of algorithms is presented not only in terms of pose accuracy but also with a focus on network architectures and models' sizes keeping potential deployment in mind. Then, current monocular spacecraft pose estimation datasets used to train and test these methods are discussed. The data generation methods: simulators and testbeds, the domain gap and the performance drop between synthetically generated and lab/space collected images and the potential solutions are also discussed. Finally, the paper presents open research questions and future directions in the field, drawing parallels with other computer vision applications. • Deep Learning is used extensively for monocular spacecraft pose estimation. • Deployability is an important limitation of the current DL-based solutions. • Lack of space-borne images during training leads to the domain gap problem. [ABSTRACT FROM AUTHOR]

Narrowband SETI algorithms have been in use for many decades. A key processing step in the usual SETI pipeline called "De-Doppler" involves non-coherent integration of linearly-drifting lines in a spectrogram. De- Doppler (DD) is needed because a transmitted constant-frequency tone will be received as a chirp, or a tone with a near-constant frequency rate, due to relative accelerations between the transmitter and receiver. The frequency drift may be an important discriminator against certain types of radio-frequency interference. This paper examines the standard Taylor DD algorithm and finds there are significant signal losses in the integration process. Part of the loss is caused by imperfect indexing in the algorithm. Additional loss is associated with the effect of an FFT filter bank on chirp signals; DD performance is intertwined with the filter bank. Filter bank improvements involving polyphase filter banks are examined. A new DD algorithm called "fastDD" is proposed, as well as extensions to the Taylor algorithm. They both offer significant performance gains and higher resolution in frequency and drift rate in the DD detection plane. The loss mechanisms are now understood. Computational cost trade-offs for various filter bank and DD parameters are presented based on C code functions. Several "best" options are given which offer significant SNR improvements ranging from 2 to 4 dB for modest levels of additional computation. These options have the potential to dramatically improve detection rates. • Goal: (i) Understand and improve the De-Doppler (DD) function for narrowband SETI. (ii) Taylor DD – the gold standard for over a decade – has not been examined in detail. (iii) Need to look at DD as part of an overall end-to-end narrowband SETI detection system. • Results: (i) Significantly improved detection performance is possible: 2–4 dB improved sensitivity, depending on computation and memory budget; Potential SETI detection rate improvements of 2–4 times. (ii) Gains arise from possible use of overlapped polyphase filter banks and higher resolution in the DD plane. (iii) New algorithms have been defined (fastDD and extended Taylor DD) and evaluated. (iv) SNR Gain vs. Computation cost trades have been examined using C language functions: Best options of filter bank and DD parameters are identified. [ABSTRACT FROM AUTHOR]

A self-training algorithm is a classical semi-supervised learning algorithm that uses a small number of labeled samples and a large number of unlabeled samples to train a classifier. However, the existing self-training algorithms consider only the geometric distance between data while ignoring the data distribution when calculating the similarity between samples. In addition, misclassified samples can severely affect the performance of a self-training algorithm. To address the above two problems, this paper proposes a self-training algorithm based on data editing with mass-based dissimilarity (STDEMB). First, the mass matrix with the mass-based dissimilarity is obtained, and then the mass-based local density of each sample is determined based on its k nearest neighbors. Inspired by density peak clustering (DPC), this study designs a prototype tree based on the prototype concept. In addition, an efficient two-stage data editing algorithm is developed to edit misclassified samples and efficiently select high-confidence samples during the self-training process. The proposed STDEMB algorithm is verified by experiments using accuracy and F-score as evaluation metrics. The experimental results on 18 benchmark datasets demonstrate the effectiveness of the proposed STDEMB algorithm. • Mass-based dissimilarity is used to o account for the effects of data distribution. • A prototype tree was designed to efficiently identify high confidence samples. • A two-stage data editing algorithm was developed for editing misclassified samples. • Numerous experiments were conducted to prove the performance of the proposed STDEMB. [ABSTRACT FROM AUTHOR]

Twin support vector machine (TSVM) is a practical machine learning algorithm, whereas traditional TSVM can be limited for data with outliers or noises. To address this problem, we propose a novel TSVM with the symmetric LINEX loss function (SLTSVM) for robust classification. There are several advantages of our method: (1) The performance of the proposed SLTSVM for data with outliers or noise can be improved by using the symmetric LINEX loss function. (2) The introduction of regularization term can effectively improve the generalization ability of our model. (3) An efficient iterative algorithm is developed to solve the optimization problems of our SLTSVM. (4) The convergence and time complexity of the iterative algorithm are analyzed in detail. Furthermore, our model does not involve loss function parameter, which makes our method more competitive. Experimental results on synthetic, benchmark and image datasets with label noises and feature noises demonstrate that our proposed method slightly outperforms other state-of-the-art methods on most datasets. • This paper proposes SLTSVM by introducing symmetric LIENX loss function. • An interpretable method is proposed for selecting the loss parameter. • The convergence of the designed solution algorithm are further analyzed. • Experiments show that our method is efficient for data with outliers or noises. [ABSTRACT FROM AUTHOR]

• A continuous system load identification algorithm based on SSM and Newmark-β is proposed for the first time. • Combination of modal truncation order and sensor layout optimization by modal strain energy. • The proposed algorithm has better accuracy and noise immunity than SSM and GKFM. • For continuous systems, the proposed algorithm has a solution time of 0.38s and is insensitive to the time step. • The proposed algorithm has good accuracy in experimental validation. Dynamic load identification based on structural responses is an important problem in the field of engineering and plays an important role in the condition assessment of mechanical structures. Current popular load identification methods such as the state-space method (SSM) and the Green's kernel function method (GKFM) are implemented on discrete systems with outstanding performance, but when dealing with complex continuous systems, there are some limitations such as low efficiency and inaccuracy. In this paper, a continuous system load identification algorithm based on SSM and Newmark-β is proposed for the first time. Using modal coordinate transformation and modal truncation methods, the number of infinite vibration differential equations of a continuous system in physical space are converted to a finite number of vibration differential equations in modal space, where the modal truncation order and the optimal layout of the sensors are combined by modal strain energy. The Newmark-β method in modal space is derived and thus combined with SSM to obtain a load identification model Y =HF called SSM-Newmark-β method, which reduces the size of the transfer matrix H. The solution time of the proposed algorithm is 0.38 s for continuous systems, which is rather shorter than that for discrete systems. Furthermore, the simulations show that it has better accuracy and noise immunity than SSM and GKFM in the identification of sinusoidal load, impact load, and random load. The effect of time step is also discussed which reveals that the larger time step has less effect on the proposed algorithm. An experimental study is carried out on a cantilever beam system. The result verifies that the SSM-Newmark-β algorithm has better accuracy in load identification for the continuous system. This research provides a new sight for the real-time identification of dynamic loads for complex structures. [ABSTRACT FROM AUTHOR]

In this paper, we develop an inexact quasi-Newton algorithm for ℓ 1 -regularization optimization problems subject to box constraints. The algorithm uses the identification technique of the proximal gradient algorithm to estimate the active set and free variables. To accelerate the convergence, we utilize the inexact quasi-Newton algorithm to update free variables. Under certain conditions, we show that the sequence generated by the algorithm converges R -linearly to a first-order optimality point of the problem. Moreover, the corresponding sequence of objective function values is also linearly convergent. Experiment results demonstrate the competitiveness of the proposed algorithm. [ABSTRACT FROM AUTHOR]

The tensor t-product is a powerful tool for the analysis of and computation with third-order tensors. This paper discusses properties and the computation of eigentubes and eigenslices of third-order tensors under the t-product; the eigentubes and eigenslices are analogues of eigenvalues and eigenvectors for matrices. The computational methods considered and analysed include the tensor power method, tensor subspace iteration, and the tensor QR algorithm. Computed examples illustrate the performance of these methods. [ABSTRACT FROM AUTHOR]

Generally there are two methods for the thrust ripple modeling: one is to identify the eigenvalues and the model parameters of thrust ripple sequentially under rigorous operating conditions; another is to treat thrust ripple as a general and inaccurate disturbance. To get rid of the constraints and further enhance the tracking accuracy of the linear servo system, a novel integrated identification and compensation scheme using an improved matching pursuit algorithm is proposed in this paper. First, the dynamics of the linear motor is formulated, and the cause of thrust ripple is analyzed. Then, a time–frequency atomic library of thrust ripple is constructed with the consideration of the frequency characteristics of position command, and meanwhile, the two optimal atoms are obtained successively by maximizing the inner product for the thrust ripple reconstruction. Based on the above, the eigenvalues and model parameters of thrust ripple can be simultaneously identified in an online manner. Finally, the feedforward compensation component is devised by the identification results to suppress thrust ripple. In order to verify the superiority of the proposed scheme, simulations and experiments are conducted compared with the conventional methods. • The eigenvalues and parameters of thrust ripple can be identified simultaneously. • The proposed scheme has higher efficiency compared with the traditional methods. • The proposed scheme has the advantages of convergence speed and identification accuracy. [ABSTRACT FROM AUTHOR]

Due to nonstationary operating conditions of wind turbines and surrounding harsh working environments, the impulse features induced by bearing faults are always overwhelmed by heavy noise, which brings challenges to accurately detect rolling bearing faults. Sparse representation exhibits excellent performance in nonstationary signal analysis, but it is closely bound up with the degree of similarity between the atoms in a dictionary and signals. Therefore, this paper investigates an enhanced K-SVD denoising method based on adaptive soft-threshold shrinkage to achieve high-precision extraction of impulse signals, and applies it to fault detection of generator bearing of wind turbines. An adaptive sparse coding shrinkage soft-threshold denoising is first proposed to remove noise and harmonic interference in the residual term of dictionary updating, so that the updated atoms show obvious impact characteristics. Furthermore, a soft-threshold shrinkage function with adaptive threshold is designed to further suppress clutter in atoms of the learned dictionary, so as to obtain an optimized dictionary for recovering impulse signals. Two actual engineering cases are selected for analysis, and the envelope spectrum correlation kurtosis corresponding to the results obtained by the proposed method is significantly higher than that of other comparison methods, thus verifying its superiority in detecting rolling bearing faults. • An enhanced K-SVD denoising algorithm for fault-induced periodic impulse extraction. • Adaptive sparse coding shrinkage is introduced into the dictionary updating. • A soft-threshold shrinkage function is proposed to optimize the dictionary. • Proposed method improves the extraction accuracy of rolling bearing fault features. [ABSTRACT FROM AUTHOR]

In recent years, pumps have become critical components in agriculture, industry, and the military, necessitating extensive development and implementation of the fault diagnosis method. In the majority of existing fault classification models, the connection between performance improvement and the amount of training data remains high, yet real-world samples are difficult to obtain. Combining domain migration theory and sample expansion method, this paper introduces a few-shot learning fault diagnosis method. Employing the T-SNE visualization algorithm, we examine the validity of the self-calibration attention mechanism (SCAM) and distribution edge prediction strategy (DEPS). The accomplishment demonstrated that the proposed algorithm could effectively map the expanded sample space within a separate interval, thereby avoiding the problem of feature aliasing caused by the overlap of sample features among similar categories and significantly enhancing the quality and quantity of training samples. The experimental analysis indicates that the proposed methodology can effectively increase the accuracy of few-shot tasks, especially in the 9way-15shot task, where it maintains a performance of 72 %, which leading the mean accuracy calculated from the others of about 30%. It is believed that much of the work has superior applicability to other few-shot diagnosis cases. • A combination of domain migration theory and sample expansion method. • Map the expanded sample space within a separable interval, avoid feature aliasing. • A few-shot sample augmentation algorithm for pump fault diagnosis. • Performing on 256*256 images transformed from one-dimensional acceleration signal. [ABSTRACT FROM AUTHOR]

This paper focuses on the computation of a rule in minimum cost spanning tree problems with groups, which coincides with the Owen value of the cooperative game for the irreducible cost matrix. To this aim, two polynomial-time algorithms are provided. The first of them is based on the steps of Kruskal algorithm whereas the other is based on a painting procedure. [ABSTRACT FROM AUTHOR]

In a graph, G = (V , E) without an isolated vertex, a dominating set D ⊆ V , is called a semitotal dominating set if for every vertex u ∈ D there is another vertex v ∈ D such that distance between u and v is at most two in G. Given a graph G = (V , E) without an isolated vertex, the Minimum Semitotal Domination problem is to find a minimum cardinality semitotal dominating set of G. The semitotal domination number , denoted by γ t 2 (G) , is the minimum cardinality of a semitotal dominating set of G. It is known that the decision version of the problem remains NP-complete even when restricted to chordal graphs, chordal bipartite graphs, and planar graphs. Galby et al. (2020) proved that the problem can be solved in polynomial time for bounded MIM-width graphs, which include many well known graph classes, but left the complexity of the problem in strongly chordal graphs unresolved. Henning and Pandey (2019) also asked to resolve the complexity status of the problem in strongly chordal graphs. In this paper, we resolve the complexity of the problem in strongly chordal graphs by designing a linear-time algorithm for the problem. [ABSTRACT FROM AUTHOR]

Feature Selection (FS) is critically important for optimising the performance of Intrusion Detection Systems (IDSs) used in Wireless Sensor Networks (WSNs). However, selecting an optimal number of relevant features from massive IDS data sets has been an ongoing FS research problem. Many approaches use Machine Learning (ML), such as nature-inspired population-based and Differential Evolution (DE)-based algorithms for FS. However, the main drawback of DE is that it has a premature convergence issue, which leads to false convergence. In this paper, a novel mutation strategy is proposed to alleviate premature convergence and to develop a modified DE-based FS algorithm called DE with maturity extension (DE-ME). The novel mutation is achieved by changing the mutation factor in the DE\rnd\1 based on K-Nearest Neighbour (KNN) as the most efficient implementation without adding further complexity to the design process. The proposed DE-ME algorithm improves the FS operation with significant performance improvements in terms of overcoming premature convergence and increasing accuracy for selection. The DE-ME algorithm was used to select the most effective features from 41 features in the Network Security Laboratory Knowledge Discovery in Databases (NSL-KDD) dataset. The accuracy of DE-ME is high at 99.66 %, its False Positive Rate (FPR) is low at 0.464 %, and the true positive rate (TPR) achieved is 99.80 %. In addition, the number of features selected by DE-ME is 6 out of 41 features in the dataset. [ABSTRACT FROM AUTHOR]

Facial information plays an important role in human communication, e.g., rich and nuanced facial expressions effectively convey emotions. Traditional data such as 2D facial images and videos are susceptible to perturbation from lighting and occlusion, while 3D static data such as mesh models lack the temporal information which is necessary to describe facial dynamics. Therefore, researches on 4D facial data (3D facial models together with time as the fourth dimension) have received considerable attention in recent years. 4D data can simultaneously reflect the complex facial temporal and space information. To fully explore these characteristics, we present a systematic overview of the 4D facial research in this paper. We give a review in terms of historical development of 4D facial datasets, acquisition process of these datasets, related algorithms and applications, and discussion of outstanding issues. We also analyze the 4D facial research works by summarizing and comparing them; in particular, we present the results on three kinds of tasks conducted on the 4D facial datasets, i.e., expression-related tasks (AU detection, expression recognition and retrieval), generation tasks (3D facial reconstruction, facial expression and facial animation generation), and other tasks (facial registration, facial recognition and facial disease diagnosis). Finally, we summarize the future research directions. [Display omitted] • We provide a comprehensive overview of a 4D facial dataset. • We classified and elaborated on the different facial studies conducted using 4D facial datasets. • We summarize the future research direction. [ABSTRACT FROM AUTHOR]

Conjugate gradient methods are much effective and widely used for large-scale unconstrained optimization problems by their simple computation, low memory requirement and strong global convergence property. Spectral gradient methods are also effective for large-scale problems. In this paper, a class of new descent spectral three-term conjugate gradient algorithms are proposed which automatically have the sufficient descent property and satisfy the Dai-Liao conjugate condition. Under the Wolfe line search technique and some standard conditions, the proposed methods are globally convergent for strongly convex functions and general nonlinear functions with the help of the modified secant equations. In numerical part, 732 problems with dimensions varying from 1500 to 150000 and three image restoration problems with three noise levels are considered. Numerical results indicate that the proposed algorithms are more efficient, reliable and robust than the other methods for the testing problems. • A class of spectral descent three-term conjugate gradient methods are proposed. • The proposed methods own the sufficient descent property and satisfy the Dai-Liao conjugate condition automatically. • The proposed methods are globally convergent for general functions without convex assumptions. • The proposed methods are applied to large-scale unconstrained optimization problems and some image restoration problems. [ABSTRACT FROM AUTHOR]

Multimodal image matching is a core basis for information fusion, change detection, and image-based navigation. However, multimodal images may simultaneously suffer from severe nonlinear radiation distortion (NRD) and complex geometric differences, which pose great challenges to existing methods. Although deep learning-based methods had shown potential in image matching, they mainly focus on same-source images or single types of multimodal images such as optical-synthetic aperture radar (SAR). One of the main obstacles is the lack of public data for different types of multimodal images. In this paper, we make two major contributions to the community of multimodal image matching: First, we collect six typical types of images, including optical-optical, optical-infrared, optical-SAR, optical-depth, optical-map, and nighttime, to construct a multimodal image dataset with a total of 1200 pairs. This dataset has good diversity in image categories, feature classes, resolutions, geometric variations, etc. Second, we propose a scale and rotation invariant feature transform (SRIF) method, which achieves good matching performance without relying on data characteristics. This is one of the advantages of our SRIF over deep learning methods. SRIF obtains the scales of FAST keypoints by projecting them into a simple pyramid scale space, which is based on the study that methods with/without scale space have similar performance under small scale change factors. This strategy largely reduces the complexity compared to traditional Gaussian scale space. SRIF also proposes a local intensity binary transform (LIBT) for SIFT-like feature description, which can largely enhance the structure information inside multimodal images. Extensive experiments on these 1200 image pairs show that our SRIF outperforms current state-of-the-arts by a large margin, including RIFT, CoFSM, LNIFT, and MS-HLMO. Both the created dataset and the code of SRIF will be publicly available in https://github.com/LJY-RS/SRIF. [ABSTRACT FROM AUTHOR]

Accurate prediction of re-entry time and location of an uncontrolled re-entering space object is crucial but challenging. This paper presents in-house re-entry prediction algorithms: RSMGA, STKOptim, STKLTOptim, and ABPro. Case studies on re-entry prediction of Starlink-26 (COSPAR ID 2019-029F or NORAD ID 44240) and CZ-5B (COSPAR ID 2021-035B or NORAD ID 48275) during the IADC re-entry test campaigns 2021/1 and 2021/2, respectively are presented. Simultaneous application of these re-entry prediction algorithms facilitates decision-making on automation of switching between these algorithms during various phases (short term or long-term) of the re-entry campaign. The effectiveness and applicability of these algorithms are studied based on percentage error. The study focuses on the overall and time-based performance of the four methods. Six more re-entered objects are selected (three Geosynchronous transfer orbit (GTO) objects and 3 Low-Earth orbit (LEO) objects), and their re-entry time prediction has been carried out using the four methods for different time instances before re-entry. Prediction estimates are compared among the methods for all the time instances in terms of percentage error. Also, the study helps in fixing the suitability of the re-entry time prediction algorithm for objects from GTO and LEO. [ABSTRACT FROM AUTHOR]

The focus of this paper is to determine how the mechanisms of each algorithm contribute to search performance. swarm-based algorithms are composed of several mechanisms. This paper regards these independent mechanisms as modules. The modules constituting each algorithm are classified into three categories: (1) the common module: a collection of mechanisms that all swarm-based algorithms have in common; (2) the main module: the unique mechanisms of each algorithm that updates the solution by interacting with other solutions; and (3) the sub module: the unique mechanisms of each algorithm that do not directly improve the quality of the solution. Testing the algorithms combined into these modules reveals the contribution of each module to performance. The experiments are conducted for the three algorithms PSO, ABC, and CS to test the usefulness of this concept. The results of these experiments revealed the following implications: (a) the main module of ABC alone can have good performance; (b) the main module of CS does not perform well as a stand-alone; (c) the combination algorithm with the main module of PSO and the sub module of ABC can improve applicability. [ABSTRACT FROM AUTHOR]

Time-variant Yang-Baxter-like matrix equation (YBLME) with the disturbances of noises is the hotspot in various scientific disciplines. The existing research, either can not handle the noise, or rely on the build-in numerical algorithm provided by MATLAB. Therefore, it is necessary to further study the digital-computer discrete solution of this problem. In this paper, the authors propose a noise-handling ten-instant discrete solution for the time-variant YBLME. By defining the matrix-form error function, Zhang neural network (ZNN) is exploited to design the continuous-time noise-handling ZNN model. For potential digital hardware (i.e., digital computer) realization, a discrete-time ZNN-based noise-handling ten-instant (DTZNH10i) algorithm, which is capable of handling three types of noises, is proposed on the basis of a Zhang time discretization (ZTD) formula. The convergence and precision of the proposed DTZNH10i algorithm are investigated and discussed. Theoretical analyses show the correctness and effectiveness of the proposed algorithm. The paper offers three examples of time-variant YBLME with disturbances of constant, linear, and bounded random noises to illustrate the efficacy and convergence of the proposed algorithm. [ABSTRACT FROM AUTHOR]

Accurate electric energy metering in micro-grid is one of the most urgent problems in the field of electric energy metering. In order to solve the problem that the lackness of electric energy metering can't be accurately calculated with the existing electric energy compensation algorithm when the electric energy metering device is completely faulty, this paper proposes an electric energy compensation algorithm that is limited in micro-grid and is based on standard particle swarm to optimize the deep belief network. Taking the historical electric energy data of each micro source metering point in micro-grid as an example, it is divided into the training set and the test set, the standard particle swarm optimization algorithm is used to determine the optimal learning layers and learning rate of deep belief network, and the electric energy algorithm model is established. The model verification results show that the proposed algorithm is nearly five times lower than the algorithm based on deep belief network solely. Further engineering case comparison shows that lackness of electric energy metering compensated by the algorithm studied in the paper is closer to the theoretical value, and the error is also less than the traditional average electricity algorithm. The real-time power curve is closer to the theoretical value, and has the higher accuracy. [ABSTRACT FROM AUTHOR]

Classification is a common problem in various fields of life, and the key challenging task in data mining. The primary objective of the classification process is to classify the given dataset in a defined class label for all data. Many research papers widely used classification in the medical sector. Various researches have been carried out to classify medical data using different techniques, such as High Order Neural Network (HONN) combined with Back-Propagation Neural Network (BPNN) as a learning algorithm. Due to the increased data complexity, the back-propagation algorithm faced problems of slow convergence. The Back-Propagation (BP) using the gradient descent technique has the possibility of getting stuck in local minima. So, the BP algorithm may cause difficulties in finding the global minima of the error function. This paper proposed a high-order Functional Link Neural Network (FLNN). The proposed FLNN model is integrated with a metaheuristic-based searching algorithm called Accelerated Particle Swarm Optimization (APSO). The performance of the proposed Accelerated Particle Swarm Optimization Functional Link Neural Network (APSOFLNN) model is validated with various medical datasets and compared to traditional techniques such as Accelerated Particle Swarm Optimization Functional Link Back-Propagation (APSOFLBP), and Artificial Bee Colony Functional Link Neural Network (ABCFLNN). The simulation results showed that the proposed APSOFLNN algorithm for the used benchmarked datasets shows good results in terms of the mean square error (MSE) and accuracy in comparison to the traditional techniques. [ABSTRACT FROM AUTHOR]

Deep learning models have achieved high performance across different domains, such as medical decision-making, autonomous vehicles, decision support systems, among many others. However, despite this success, the inner mechanisms of these models are opaque because their internal representations are too complex for a human to understand. This opacity makes it hard to understand the how or the why of the predictions of deep learning models. There has been a growing interest in model-agnostic methods that make deep learning models more transparent and explainable to humans. Some researchers recently argued that for a machine to achieve human-level explainability, this machine needs to provide human causally understandable explanations, also known as causability. A specific class of algorithms that have the potential to provide causability are counterfactuals. This paper presents an in-depth systematic review of the diverse existing literature on counterfactuals and causability for explainable artificial intelligence (AI). We performed a Latent Dirichlet topic modelling analysis (LDA) under a Preferred Reporting Items for Systematic Reviews and Meta-Analyses (PRISMA) framework to find the most relevant literature articles. This analysis yielded a novel taxonomy that considers the grounding theories of the surveyed algorithms, together with their underlying properties and applications to real-world data. Our research suggests that current model-agnostic counterfactual algorithms for explainable AI are not grounded on a causal theoretical formalism and, consequently, cannot promote causability to a human decision-maker. Furthermore, our findings suggest that the explanations derived from popular algorithms in the literature provide spurious correlations rather than cause/effects relationships, leading to sub-optimal, erroneous, or even biased explanations. Thus, this paper also advances the literature with new directions and challenges on promoting causability in model-agnostic approaches for explainable AI. • A survey on model-agnostic counterfactual approaches for XAI. • A novel taxonomy for model-agnostic counterfactual approaches for XAI. • A set of properties for causability systems for XAI. • Opportunities and challenges for causability systems based on modelagnostic counterfactual approaches. [ABSTRACT FROM AUTHOR]

The development of stereo matching algorithm is still one of the challenging problems, especially in ill-posed regions. Hence, this article presents a survey on the algorithm frameworks related to the stereo matching algorithm. Based on the early survey that had been conducted, two major frameworks available in current stereo matching algorithm development, they are traditional and artificial intelligence (AI) frameworks. Most of the traditional methods are very low accuracy compared to the AI-based approach. This can be observed in the standard benchmarking dataset, such as from the KITTI and the Middlebury, where AI methods rank at the top of the accuracy list. Additionally, the trend for solving computer vision problems uses AI or machine learning tools that become more apparent in recent years. Thus, this paper is focusing on the survey between the deep learning frameworks, which is one of the machine learning tools related to the convolutional neural network (CNN). Several mixed approaches between CNN based method and traditional handcraft method, as well as the end to end CNN method also discussed in this paper. [ABSTRACT FROM AUTHOR]

• We add CUDA verification support to the VerCors verifier. • We verify data race-freedom and functional correctness of CUDA implementations of two parallel prefix sum algorithms. • We verify data race-freedom and functional correctness of CUDA implementations of stream compaction algorithm. GPUs are an important part of any High Performance Computing (HPC) architecture. To make optimal use of the specifics of a GPU architecture, we need programming models that naturally support the parallel execution model of a GPU. CUDA and OpenCL are two widely used examples of such programming models. Furthermore, we also need to redesign algorithms such that they adhere to this parallel programming model, and we need to be able to prove the correctness of these redesigned algorithms. In this paper we study two examples of such parallelized algorithms, and we discuss how to prove their correctness (data race freedom and (partial) functional correctness) using the VerCors program verifier. First of all, we prove the correctness of two parallel algorithms solving the prefix sum problem. Second, we show how such a prefix sum algorithm is used as a basic block in a stream compaction algorithm, and we prove correctness of this stream compaction algorithm, taking advantage of the earlier correctness proof for the prefix sum algorithm. The proofs as described in this paper are developed over the CUDA implementations of these algorithms. In earlier work, we had already shown correctness of a more high-level version of the algorithm. This paper discusses how we add support to reason about CUDA programs in VerCors, and it then shows how we can redo the verification at the level of the CUDA code. We also discuss some practical challenges that we had to address to prove correctness of the actual CUDA-level verifications. [ABSTRACT FROM AUTHOR]

Cloud Computing is an alternative to conventional IT Outsourcing. As a result, cloud computing migration between organizations is rapidly growing. The adoption of this technology brings many positive aspects but prescribes various risks and concerns. An organization that officially provides its cloud computing services to external providers and implies that its IT functions and process are outsourced to third-party providers of BPO services. For privacy-making public audit processes in dynamic cloud data storage, a modified Boneh-Lynn-Shachame Dynamic Auditing (MBLSDA) algorithm is suggested in this paper. The proposed algorithm executes an audit process for multiple users based on a batch audit simultaneously and effectively to enable Third Party Auditing (TPA). This paper integrates the homomorphic authenticator in an algorithm of dynamic signing audit by random marking in terms of the privacy conserving public auditing process. When the user of cloud service, store or update the data, it encrypts using Rijndal algorithm, and Boneh-Lynn-Shacham signature generation is used for key generation. Finally, a hybrid of these a proposed Modified Boneh-Lynn-Shacham Signing Dynamic audit the data to provide the security. [ABSTRACT FROM AUTHOR]

Achieving precision in the prediction of buildings' dynamic heat load is crucial for the advancement of smart heating systems. This research highlights the urgent need to enhance the accuracy of models predicting dynamic heat load. Through literature review, distinguished machine learning and regression algorithms were chosen to formulate prediction models. These models employ a data time-step adaptive strategy, a physics-guided loss function, and fundamental principles of heat transfer. Optimization algorithms of a mathematical nature were utilized to fine-tune the parameters and the framework of long short-term memory (LSTM) and multi-layer perceptron (MLP) models. An analytical comparison was undertaken between physics-guided models and those not guided by physics. Principal conclusions are: 1) Pelican optimization algorithm (POA)-LSTM model emerges as superior in heat load prediction accuracy of an office building, with percentage errors for actual and simulated datasets ranging from −6.7 % to 5.8 % and −5.2 %–4.5 %, respectively, and the mean absolute percentage error (MAPE) standing at 2.3 % and 1.3 %. 2) The linear regression model exhibits the lowest precision, with a MAPE of 17.5 % and 4.0 % for the 7-day prediction results in the actual and simulated datasets, respectively. These findings provide support for improving heat load prediction in heating systems. • The authors have implemented a total of 20 physically-guided models for predicting building thermal load, among which the POA-LSTM model demonstrates the highest accuracy. • The disparities in thermal load prediction accuracy between the physically-guided machine learning models and the physically-guided mathematical regression models have been identified. • The accuracy of thermal load prediction was compared between the five physical guidance models proposed in this paper and the five non-physical guidance models mentioned in other papers. [ABSTRACT FROM AUTHOR]

This paper investigates fully distributed scaled non-negative edge-consensus problems of networked systems with actuator saturation and unmeasurable internal states. By using the adaptive control method, output-feedback-based low-gain technique, and graph theory, a new adaptive algorithm is designed to obtain scaled edge-consensus conditions, under which the difficulties caused by the constraints on edge states and controllers are overcome. There are three interesting characteristics that any global information of networks is not used in this paper's algorithm and result, including the number of vertexes and edges; the feasible solutions of the scaled edge-consensus conditions exist and can be easily obtained; the convergence rate of the controller is adjustable. Furthermore, the designed algorithm is expanded in the cases without actuator saturation. Finally, three examples are given to verify the theoretical results. [ABSTRACT FROM AUTHOR]

Intrusion Detection System (IDS) can ensure the network security by identifying network intrusions according to the abnormal traffic data. However, the intrusion detection data has the problem of high dimensionality and changes with network and attack environments, which leads to the poor performance and poor portability of intrusion detection algorithms. Therefore, this paper proposes an intrusion detection algorithm based on joint symmetric uncertainty and hyperparameter optimized fusion neural network. Firstly, a feature selection method based on symmetric uncertainty and approximate Markov blanket is proposed, which fully considers the correlation and redundancy of features, and also the correlation between combined features and the class label, so as to reduce the data dimensionality. Secondly, the CNN-LSTM classifier fused with Convolutional Neural Network (CNN) and Long Short-Term Memory (LSTM) is used to extract the spatial features and temporal features to improve the classification performance. Finally, the Particle Swarm Optimization (PSO) algorithm is improved and used to automatically optimize the hyperparameters of the classifier, so that the classifier can be applied to different intrusion detection datasets with better generalization ability and portability. Experiments have verified the effectiveness and superiority of the proposed algorithm on multiple evaluation indicators. • An effective algorithm for intrusion detection is proposed in this paper. • Feature selection is based on symmetric uncertainty and approximate Markov blanket. • A fusion neural network is constructed to extract the spatial and temporal features. • The PSO algorithm is improved to automatically optimize the hyperparameters. [ABSTRACT FROM AUTHOR]

In the contemporary world, data pervades every facet of human life, and the information contained in this data plays a pivotal role in shaping decision-making and advancing technology. Among the plethora of techniques available, classification methods are highly effective tools for extracting valuable insights from vast volumes of data. The R ule A ggregation C lassifi ER (RACER) is a novel rule-based classification algorithm known for its exceptional performance. A notable limitation of RACER lies in its inability to handle continuous features. In this paper, we address the aforementioned limitation by employing various supervised discretization methods, including CAIM, MDLP, Decision Tree (CART), and ChiMerge. The impact of these methods on RACER's accuracy and understandability is evaluated across nine datasets from the UCI repository. Additionally, the paper conducts a comparative analysis of RACER's accuracy against well-known classifiers such as Naive Bayes, Logistic Regression, SVM, LightGBM, and Decision Tree. The findings indicate that RACER achieves the highest average accuracy when we utilize MDLP as the discretization method, surpassing its initial average accuracy. Moreover, RACER demonstrates superior understandability by generating the lowest number of rules when employing ChiMerge and Decision Tree for discretizing numerical features. Furthermore, RACER outperforms the other five classifiers when employing MDLP. • The discretization unit enables the RACER algorithm to handle continuous data. • The discretization unit improves the classification accuracy of the RACER. • The discretization unit increases the understandability of the RACER rules. [ABSTRACT FROM AUTHOR]

Weighted model counting (WMC) is the task of computing the weighted sum of all satisfying assignments (i.e., models) of a propositional formula. Similarly, weighted model sampling (WMS) aims to randomly generate models with probability proportional to their respective weights. Both WMC and WMS are hard to solve exactly, falling under the # P -hard complexity class. However, it is known that the counting problem may sometimes be tractable, if the propositional formula can be compactly represented and expressed in first-order logic. In such cases, model counting problems can be solved in time polynomial in the domain size, and are known as domain-liftable. The following question then arises: Is it also the case for WMS? This paper addresses this question and answers it affirmatively. Specifically, we prove the domain-liftability under sampling for the two-variables fragment of first-order logic with counting quantifiers in this paper, by devising an efficient sampling algorithm for this fragment that runs in time polynomial in the domain size. We then further show that this result continues to hold even in the presence of cardinality constraints. To empirically validate our approach, we conduct experiments over various first-order formulas designed for the uniform generation of combinatorial structures and sampling in statistical-relational models. The results demonstrate that our algorithm outperforms a state-of-the-art WMS sampler by a substantial margin, confirming the theoretical results. • Model sampling in first-order logic can be liftable, without the need of grounding. • Sampling from two-variable logic with counting is tractable. • Domain recursion is crucial for designing first-order model sampling algorithms. [ABSTRACT FROM AUTHOR]

• Distinct DG Output Modes Validation: The simulation validates distinct DG output modes, impacting prediction. • Mode-Based State Estimation: The paper proposes an innovative mode-based state estimation using IPSO-DBSCAN clustering, overcoming k-means limitations. • Enhanced Data Recovery using DBSCAN: Enhanced data recovery employs DBSCAN with improved secondary clustering, guided by similarity and homogeneity, outperforming traditional methods. • BiGRU-PF State Estimation: BiGRU-PF enhances state estimation accuracy and robustness in distribution networks by detecting DG output modes, addressing k-means limitations, and improving data recovery. This paper proposes a new forecasting-aided state estimation (FASE) method for distribution systems that mitigates issues with uncertain distributed generation (DG) and lost measurements. We utilize an Improved Particle Swarm Optimization (IPSO)-optimized Density-Based Spatial Clustering of Applications with Noise (DBSCAN) for examination of historical DG output data. Based on identified DG output modes, it facilitates precise state prediction and data reconstruction,. The proposed method employs a Bidirectional Gated Recurrent Unit (BiGRU) neural network for state prediction and a particle filter (PF) for final state filtering. The method verification is provided through Python simulations of the Distribution Transformer Unit (DTU)7k distribution network system, demonstrating improved accuracy and robustness against sudden load change and bad data in measurements. [ABSTRACT FROM AUTHOR]

High-quality underwater optical images are essential for various applications of underwater vision. However, these images often suffer from severe degradation, complex noise, low contrast, and color cast, leading to poor image quality. To address these issues and accomplish related underwater vision tasks more smoothly, researchers have made many efforts to improve the quality of underwater optical images. This paper presents a comprehensive review of recent research, focusing on specific algorithms published between 2013 and 2023, while also predicting future research trends in this field. In light of the observed ambiguities and inconsistencies in previous review studies' classification frameworks, this paper introduces a novel classification framework, grounded in the specific challenges in this domain, including issues unique to the imaging medium and imaging environment. Additionally, the proposed framework offers a more detailed categorization based on the algorithmic ideology of the authors. Furthermore, this paper addresses a significant gap in the literature by providing an in-depth assessment of the methods for removing marine snow noise from underwater optical images. By complementing existing research, this paper aims to enhance understanding of this subject and provide a clearer, more comprehensive, and in-depth exploration of underwater image quality improvement. [ABSTRACT FROM AUTHOR]

This paper introduces a novel application of subloading surface concept to effectively model the elastoplastic behavior of materials in the finite strain regime. The subloading surface approach allows for a smoother and more seamless transition from the elastic to the plastic region. Two time integration schemes are presented in this study, one in the intermediate configuration and the other in the current configuration. In the first time integration scheme, co-rotational objective time rates are not required, and the formulation utilizes the Mandel stress. In the second time integration scheme, implemented in Eulerian description, the Kirchhoff stress defined in the current configuration is utilized. The results obtained for the simple shear deformation case demonstrate the absence of oscillations. Additionally, these results show excellent agreement with experimental data and existing findings from the literature. Furthermore, a computational comparison between the time integration schemes using the subloading surface model and a model discussed in the literature reveals that the proposed algorithms in this paper require significantly fewer increments in the given time integrations. This indicates a higher computational efficiency and reduced computational time for the proposed methods. Overall, the predicted responses of all the analyzed cases from the provided time integrations exhibit excellent agreement with each other, confirming the accuracy and effectiveness of the presented model. • Novel use of subloading surface in finite strain elastoplasticity was introduced. • Proposed algorithms were reduced the increments and computational cost remarkably. • Smoother and more realistic transition from elastic to plastic region was captured. • Proposed time integrations effectively simulated saturation and softening behavior. • No oscillations were seen in simple shear elastoplastic deformation. [ABSTRACT FROM AUTHOR]

The enclosed multistory poultry housing is a type of poultry enclosure widely used in industrial caged chicken breeding. Accurate identification and detection of the comb and eyes of caged chickens in poultry farms using this type of enclosure can enhance managers' understanding of the health of caged chickens. However, the accuracy of image detection of caged chickens will be affected by the enclosure's entrance, which will reduce the precision. Therefore, this paper proposes a cage-gate removal algorithm based on big data and deep learning Cyclic Consistent Migration Neural Network (CCMNN). The method achieves automatic elimination and restoration of some key information in the image through the CCMNN network. The Structural Similarity Index Measure (SSIM) between the recovered and original images on the test set is 91.14%. Peak signal-to-noise ratio (PSNR) is 25.34dB. To verify the practicability of the proposed method, the performance of the target detection algorithm is analyzed both before and after applying the CCMNN network in detecting the combs and eyes of caged chickens. Different YOLOv8 detection algorithms, including YOLOv8s, YOLOv8n, YOLOv8m, and YOLOv8x, were used to verify the algorithm proposed in this paper. The experimental results demonstrate that compared to images without CCMNN processing, the precision of comb detection of caged chickens is improved by 11, 11.3, 12.8, and 10.2%. Similarly, the precision of eye detection for caged chickens is improved by 2.4, 10.2, 6.8, and 9%. Therefore, more complete outline images of caged chickens can be obtained using this algorithm and the precision in detecting the comb and eyes of caged chickens can be enhanced. These advancements in the algorithm offer valuable insights for future poultry researchers aiming to deploy enhanced detection equipment, thereby contributing to the accurate assessment of poultry production and farm conditions. [ABSTRACT FROM AUTHOR]