Search

Many complex physical systems exhibit a rich variety of discrete behavioural modes. Often, the system complexity limits the applicability of standard modelling tools. Hence, understanding the underlying physics of different behaviours and distinguishing between them is challenging. Although traditional machine learning techniques could predict and classify behaviour well, typically they do not provide any meaningful insight into the underlying physics of the system. In this paper we present a novel method for extracting physically meaningful clusters of discrete behaviour from limited experimental observations. This method obtains a set of physically plausible functions that both facilitate behavioural clustering and aid in system understanding. We demonstrate the approach on the V-shaped falling paper system, a new falling paper type system that exhibits four distinct behavioural modes depending on a few morphological parameters. Using just 49 experimental observations, the method discovered a set of candidate functions that distinguish behaviours with an error of 2.04%, while also aiding insight into the physical phenomena driving each behaviour. [ABSTRACT FROM AUTHOR]

The Semantic Link Network is a general semantic model for modeling the structure and the evolution of complex systems. Various semantic links play different roles in rendering the semantics of complex system. One of the basic semantic links represents cause-effect relation, which plays an important role in representation and understanding. This paper verifies the role of the Semantic Link Network in representing the core of text by investigating the contribution of cause-effect link to representing the core of scientific papers. Research carries out with the following steps: (1) Two propositions on the contribution of cause-effect link in rendering the core of paper are proposed and verified through a statistical survey, which shows that the sentences on cause-effect links cover about 65% of key words within each paper on average. (2) An algorithm based on syntactic patterns is designed for automatically extracting cause-effect link from scientific papers, which recalls about 70% of manually annotated cause-effect links on average, indicating that the result adapts to the scale of data sets. (3) The effects of cause-effect link on four schemes of incorporating cause-effect link into the existing instances of the Semantic Link Network for enhancing the summarization of scientific papers are investigated. The experiments show that the quality of the summaries is significantly improved, which verifies the role of semantic links. The significance of this research lies in two aspects: (1) it verifies that the Semantic Link Network connects the important concepts to render the core of text; and, (2) it provides an evidence for realizing content services such as summarization, recommendation and question answering based on the Semantic Link Network, and it can inspire relevant research on content computing. [ABSTRACT FROM AUTHOR]

Quantifying the impact of a scholarly paper is of great significance, yet the effect of geographical distance of cited papers has not been explored. In this paper, we examine 30,596 papers published in Physical Review C, and identify the relationship between citations and geographical distances between author affiliations. Subsequently, a relative citation weight is applied to assess the impact of a scholarly paper. A higher-order weighted quantum PageRank algorithm is also developed to address the behavior of multiple step citation flow. Capturing the citation dynamics with higher-order dependencies reveals the actual impact of papers, including necessary self-citations that are sometimes excluded in prior studies. Quantum PageRank is utilized in this paper to help differentiating nodes whose PageRank values are identical. [ABSTRACT FROM AUTHOR]

Research paper recommenders emerged over the last decade to ease finding publications relating to researchers’ area of interest. The challenge was not just to provide researchers with very rich publications at any time, any place and in any form but to also offer the right publication to the right researcher in the right way. Several approaches exist in handling paper recommender systems. However, these approaches assumed the availability of the whole contents of the recommending papers to be freely accessible, which is not always true due to factors such as copyright restrictions. This paper presents a collaborative approach for research paper recommender system. By leveraging the advantages of collaborative filtering approach, we utilize the publicly available contextual metadata to infer the hidden associations that exist between research papers in order to personalize recommendations. The novelty of our proposed approach is that it provides personalized recommendations regardless of the research field and regardless of the user’s expertise. Using a publicly available dataset, our proposed approach has recorded a significant improvement over other baseline methods in measuring both the overall performance and the ability to return relevant and useful publications at the top of the recommendation list. [ABSTRACT FROM AUTHOR]

With the rapid development of information technology, scientific social networks (SSNs) have become the fastest and most convenient way for researchers to communicate with each other. Many published papers are shared via SSNs every day, resulting in the problem of information overload. How to appropriately recommend personalized and highly valuable papers for researchers is becoming more urgent. However, when recommending papers in SSNs, only a small amount of positive instances are available, leaving a vast amount of unlabelled data, in which negative instances and potential unseen positive instances are mixed together, which naturally belongs to One-Class Collaborative Filtering (OCCF) problem. Therefore, considering the extreme data imbalance and data sparsity of this OCCF problem, a hybrid approach of Social and Content aware One-class Recommendation of Papers in SSNs, termed SCORP, is proposed in this study. Unlike previous approaches recommended to address the OCCF problem, social information, which has been proved playing a significant role in performing recommendations in many domains, is applied in both the profiling of content-based filtering and the collaborative filtering to achieve superior recommendations. To verify the effectiveness of the proposed SCORP approach, a real-life dataset from CiteULike was employed. The experimental results demonstrate that the proposed approach is superior to all of the compared approaches, thus providing a more effective method for recommending papers in SSNs. [ABSTRACT FROM AUTHOR]

Differential Evolution (DE) is widely recognized as a highly effective evolutionary algorithm for global optimization. It has proven its efficacy in tackling diverse problems across various fields and real-world applications. DE boasts several advantages, such as ease of implementation, reliability, speed, and adaptability. However, DE does have certain limitations, such as suboptimal solution exploitation and challenging parameter tuning. To address these challenges, this research paper introduces a novel algorithm called Enhanced Binary JADE (EBJADE), which combines differential evolution with multi-population and elites regeneration. The primary innovation of this paper lies in the introduction of strategy with enhanced exploitation capabilities. This strategy is based on utilizing the sorting of three vectors from the current generation to perturb the target vector. By introducing directional differences, guiding the search towards improved solutions. Additionally, this study adopts a multi-population method with a rewarding subpopulation to dynamically adjust the allocation of two different mutation strategies. Finally, the paper incorporates the sampling concept of elite individuals from the Estimation of Distribution Algorithm (EDA) to regenerate new solutions through the selection process in DE. Experimental results, using the CEC2014 benchmark tests, demonstrate the strong competitiveness and superior performance of the proposed algorithm. [ABSTRACT FROM AUTHOR]

In the quality inspection process of high-voltage cables, several commonly used indicators include cable length, insulation thickness, and the number of conductors within the core. Among these factors, the count of conductors holds particular significance as a key determinant of cable quality. Machine vision technology has found extensive application in automatically detecting the number of conductors in cross-sectional images of high-voltage cables. However, the presence of scratch-type defects in cut high-voltage cable cross-sections can significantly compromise the precision of conductor count detection. To address this problem, this paper introduces a novel improved total variation (TV) algorithm, marking the first-ever application of the TV algorithm in this domain. Considering the staircase effect, the direct use of the TV algorithm is prone to cause serious loss of image edge information. The proposed algorithm firstly introduces multimodal features to effectively mitigate the staircase effect. While eliminating scratch-type defects, the algorithm endeavors to preserve the original image's edge information, consequently yielding a noteworthy enhancement in detection accuracy. Furthermore, a dataset was curated, comprising images of cross-sections of high-voltage cables of varying sizes, each displaying an assortment of scratch-type defects. Experimental findings conclusively demonstrate the algorithm's exceptional efficiency in eradicating diverse scratch-type defects within high-voltage cable cross-sections. The average scratch elimination rate surpasses 90%, with an impressive 96.15% achieved on cable sample 4. A series of conducted ablation experiments in this paper substantiate a significant enhancement in cable image quality. Notably, the Edge Preservation Index (EPI) exhibits an improvement of approximately 20%, resulting in a substantial boost to conductor count detection accuracy, thus effectively enhancing the quality of high-voltage cable production. [ABSTRACT FROM AUTHOR]

Cryo-electron micrograph images have various characteristics such as varying sizes, shapes, and distribution densities of individual particles, severe background noise, high levels of impurities, irregular shapes, blurred edges, and similar color to the background. How to demonstrate good adaptability in the field of image vision by picking up single particles from multiple types of cryo-electron micrographs is currently a challenge in the field of cryo-electron micrographs. This paper combines the characteristics of the MixUp hybrid enhancement algorithm, enhances the image feature information in the pre-processing stage, builds a feature perception network based on the channel self-attention mechanism in the forward network of the Swin Transformer model network, achieving adaptive adjustment of self-attention mechanism between different single particles, increasing the network's tolerance to noise, Incorporating PReLU activation function to enhance information exchange between pixel blocks of different single particles, and combining the Cross-Entropy function with the softmax function to construct a classification network based on Swin Transformer suitable for cryo-electron micrograph single particle detection model (Swin-cryoEM), achieving mixed detection of multiple types of single particles. Swin-cryoEM algorithm can better solve the problem of good adaptability in picking single particles of many types of cryo-electron micrographs, improve the accuracy and generalization ability of the single particle picking method, and provide high-quality data support for the three-dimensional reconstruction of a single particle. In this paper, ablation experiments and comparison experiments were designed to evaluate and compare Swin-cryoEM algorithms in detail and comprehensively on multiple datasets. The Average Precision is an important evaluation index of the evaluation model, and the optimal Average Precision reached 95.5% in the training stage Swin-cryoEM, and the single particle picking performance was also superior in the prediction stage. This model inherits the advantages of the Swin Transformer detection model and is superior to mainstream models such as Faster R-CNN and YOLOv5 in terms of the single particle detection capability of cryo-electron micrographs. [ABSTRACT FROM AUTHOR]

This paper proposes a cutting head optimization method based on meshing the spatial position of the picks. According to the expanded shape of the spatial mesh composed of four adjacent picks on the plane, a standard mesh shape analysis method can be established with mesh skewness, mesh symmetry, and mesh area ratio as the indicators. The traversal algorithm is used to calculate the theoretical meshing rate, pick rotation coefficient, and the variation of cutting load for the longitudinal cutting head with 2, 3, and 4 helices. The results show that the 3-helix longitudinal cutting head has better performance. By using the traversal result with maximum theoretical meshing rate as the design parameter, the longitudinal cutting head CH51 with 51 picks was designed and analyzed. The prediction model of pick consumption is established based on cutting speed, direct rock cutting volume of each pick, pick rotation coefficient, uniaxial compressive strength, and CERCHAR abrasivity index. And the rock with normal distribution characteristics of Uniaxial Compressive Strength is used for the specific energy calculating. The artificial rock wall cutting test results show that the reduction in height loss suppresses the increase in pick equivalent loss caused by the increase in mass loss, and the pick consumption in this test is only 0.037–0.054 picks/m3. In addition, the correlation between the actual pick consumption and the prediction model, and the correlation between the actual cutting specific energy and the theoretical calculation value are also analyzed. The research results show that the pick arrangement design method based on meshing pick tip spatial position can effectively reduce pick consumption and improve the rock cutting performance. [ABSTRACT FROM AUTHOR]

Many results have been obtained when studying scientific papers citations databases in a network perspective. Articles can be ranked according to their current in-degree and their future popularity or citation counts can even be predicted. The dynamical properties of such networks and the observation of the time evolution of their nodes started more recently. This work adopts an evolutionary perspective and proposes an original algorithm for the construction of genealogical trees of scientific papers on the basis of their citation count evolution in time. The fitness of a paper now amounts to its in-degree growing trend and a “dying” paper will suddenly see this trend declining in time. It will give birth and be taken over by some of its most prevalent citing “offspring”. Practically, this might be used to trace the successive published milestones of a research field. [ABSTRACT FROM AUTHOR]

This paper proposes a retinal prosthesis edge detection (RPED) algorithm that can achieve high visual acuity and low power. Retinal prostheses have been used to stimulate retinal tissue by injecting charge via an electrode array, thereby artificially restoring the vision of visually impaired patients. The retinal prosthetic chip, which generates biphasic current pulses, should be located in the foveal area measuring 5 mm × 5 mm. When a high-density stimulation pixel array is realized in a limited area, the distance between the stimulation pixels narrows, resulting in current dispersion and high-power dissipation related to heat generation. Various edge detection methods have been proposed over the past decade to reduce these deleterious effects and achieve high-resolution pixels. However, conventional methods have the disadvantages of high-power consumption and long data processing times because many pixels are activated to detect edges. In this study, we propose a novel RPED algorithm that has a higher visual acuity and less power consumption despite using fewer active pixels than existing techniques. To verify the performance of the devised RPED algorithm, the peak signal-to-noise ratio and structural similarity index map, which evaluates the quantitative numerical value of the image are employed and compared with the Sobel, Canny, and past edge detection algorithms in MATLAB. Finally, we demonstrate the effectiveness of the proposed RPED algorithm using a 1600-pixel retinal stimulation chip fabricated using a 0.35 μm complementary metal-oxide-semiconductor process. [ABSTRACT FROM AUTHOR]

Time series data complexity presents new challenges in clustering analysis across fields such as electricity, energy, industry, and finance. Despite advances in representation learning and clustering with Variational Autoencoders (VAE) based deep learning techniques, issues like the absence of discriminative power in feature representation, the disconnect between instance reconstruction and clustering objectives, and scalability challenges with large datasets persist. This paper introduces a novel deep time series clustering approach integrating VAE with metric learning. It leverages a VAE based on Gated Recurrent Units for temporal feature extraction, incorporates metric learning for joint optimization of latent space representation, and employs the sum of log likelihoods as the clustering merging criterion, markedly improving clustering accuracy and interpretability. Experimental findings demonstrate a 27.16% improvement in average clustering accuracy and a 47.15% increase in speed on industrial load data. This study offers novel insights and tools for the thorough analysis and application of time series data, with further exploration of VAE's potential in time series clustering anticipated in future research. [ABSTRACT FROM AUTHOR]

With the rapid development of intelligent connected vehicles, there is an increasing demand for hardware facilities and onboard systems of driver assistance systems. Currently, most vehicles are constrained by the hardware resources of onboard systems, which mainly process single-task and single-sensor data. This poses a significant challenge in achieving complex panoramic driving perception technology. While the panoramic driving perception algorithm YOLOP has achieved outstanding performance in multi-task processing, it suffers from poor adaptability of feature map pooling operations and loss of details during downsampling. To address these issues, this paper proposes a panoramic driving perception fusion algorithm based on multi-task learning. The model training involves the introduction of different loss functions and a series of processing steps for lidar point cloud data. Subsequently, the perception information from lidar and vision sensors is fused to achieve synchronized processing of multi-task and multi-sensor data, thereby effectively improving the performance and reliability of the panoramic driving perception system. To evaluate the performance of the proposed algorithm in multi-task processing, the BDD100K dataset is used. The results demonstrate that, compared to the YOLOP model, the multi-task learning network performs better in lane detection, drivable area detection, and vehicle detection tasks. Specifically, the lane detection accuracy improves by 11.6%, the mean Intersection over Union (mIoU) for drivable area detection increases by 2.1%, and the mean Average Precision at 50% IoU (mAP50) for vehicle detection improves by 3.7%. [ABSTRACT FROM AUTHOR]

The identification research of hydrogenation catalyst information has always been one of the most important businesses in the chemical industry. In order to aid researchers in efficiently screening high-performance catalyst carriers and tackle the pressing challenge at hand, it is imperative to find a solution for the intelligent recognition of hydrogenation catalyst images. To address the issue of low recognition accuracy caused by adhesion and stacking of hydrogenation catalysts, An image recognition algorithm of hydrogenation catalyst based on FPNC Net was proposed in this paper. In the present study, Resnet50 backbone network was used to extract the features, and spatially-separable convolution kernel was used to extract the multi-scale features of catalyst fringe. In addition, to effectively segment the adhesive regions of stripes, FPN (Feature Pyramid Network) is added to the backbone network for deep and shallow feature fusion. Introducing an attention module to adaptively adjust weights can effectively highlight the target features of the catalyst. The experimental results showed that the FPNC Net model achieved an accuracy of 94.2% and an AP value improvement of 19.37% compared to the original CenterNet model. The improved model demonstrates a significant enhancement in detection accuracy, indicating a high capability for detecting hydrogenation catalyst targets [ABSTRACT FROM AUTHOR]

This paper introduces N-bipolar hypersoft (N-BHS) sets, a versatile extension of bipolar hypersoft (BHS) sets designed to effectively manage evaluations encompassing both binary and non-binary data, thereby exhibiting heightened versatility. The major contributions of this framework are twofold: Firstly, the N-BHS set introduces a parameterized representation of the universe, providing a nuanced and finite granularity in perceiving attributes, thereby distinguishing itself from conventional binary BHS sets and continuous fuzzy BHS sets. Secondly, this model signifies a new area of research aimed at overcoming limitations inherent in the N-bipolar soft set when handling multi-argument approximate functions. Through the strategic partitioning of attributes into distinct subattribute values using disjoint sets, the N-BHS set emerges as a powerful tool for effectively addressing uncertainty-related problems. In pursuit of these objectives, the paper outlines various algebraic definitions, including incomplete N-BHS sets, efficient N-BHS sets, normalized N-BHS sets, equivalence under normalization, N-BHS complements, and BHS sets derived from a threshold, exemplified through illustrative examples. Additionally, the article explores set-theoretic operations within the N-BHS sets framework, such as relative null/whole N-BHS sets, N-BHS subsets, and two distinct approaches to N-BHS extended/restricted union and intersection. Finally, it proposes and compares decision-making methodologies regarding N-BHS sets, including a comprehensive comparison with relevant existing models. [ABSTRACT FROM AUTHOR]

This paper focuses on studying the optimization problem of multi-agent systems (MAS) under undirected graph. To reduce the communication frequency among agents, a zero-gradient-sum (ZGS) algorithm based on dynamic event-triggered (DET) mechanism is investigated. The event-triggered condition of each agent only uses its own state information and the neighbor's state information at the previous triggering instants, without requiring continuous state information from the neighbor. In addition, the designed algorithm allows for the sampling period to be arbitrarily large. The Lyapunov method is utilized to derive the sufficient conditions that incorporate time delay and parameters. As the event is only checked at the periodic moment, zeno behavior can be directly excluded. Finally, numerical simulations demonstrate the effectiveness of the theoretical results. [ABSTRACT FROM AUTHOR]

The behavior of an illuminated solar module can be characterized by its power-voltage curve. Tracking the peak of this curve is essential to harvest the maximum power by the module. The position of the peak varies with temperature and irradiance and needs to be traced. Under partial shading conditions, the number of peaks increases and makes it more difficult to find the global maximum power point (MPP). Various methods are used for maximum power point tracking (MPPT) that are based on iterations. These methods are time-consuming and fail to work satisfactorily under rapidly changing environmental conditions. In this paper, a novel algorithm is proposed that for the first time, utilizes computer vision to find the global maximum power point. This algorithm, which is implemented in Matlab/Simulink, is free of voltage iterations and gives the real-time data for the maximum power point. The proposed algorithm increases the speed and the reliability of the MPP tracking via replacing analogue electronics calculations by digital means. The validity of the algorithm is experimentally verified. [ABSTRACT FROM AUTHOR]

To overcome the problem of the high initial position of the point cloud required by the traditional Iterative Closest Point (ICP) algorithm, in this paper, we propose a point cloud registration method based on normal vector and directional histogram features (SHOT). Firstly, a hybrid filtering method based on the voxel idea is proposed and verified using the measured point cloud data, and the noise removal rates of 97.5%, 97.8%, and 93.8% are obtained. Secondly, in terms of feature point extraction, the original algorithm is optimized, and the optimized algorithm can better extract the missing part of the point cloud. Finally, a fine alignment method based on normal vector and directional histogram features (SHOT) is proposed, and the improved algorithm is compared with the existing algorithm. Taking the Stanford University point cloud data and the self-measured point cloud data as examples, the plotted iteration-error plots can be concluded that the improved method can reduce the number of iterations by 40.23% and 37.62%, respectively. [ABSTRACT FROM AUTHOR]

Tracking and detection have brought great challenges to network security. Therefore, this paper proposes a monitoring method of stealthy complex network attacks considering security situation awareness. By constructing a tracking model of invisible complex network attacks, public monitoring nodes are selected for monitoring. The cost of a single monitoring node is calculated by the algorithm, and the monitoring node is determined by the monitoring node algorithm, so as to reduce the resource occupancy rate of the monitoring node and improve the monitoring accuracy. The simulation results show that this method is stable in the range of 1000 to 4000 nodes, and can effectively monitor the complex network attacks of stealing secrets. [ABSTRACT FROM AUTHOR]

Background: Cancer diagnosis based on machine learning has become a popular application direction. Support vector machine (SVM), as a classical machine learning algorithm, has been widely used in cancer diagnosis because of its advantages in high-dimensional and small sample data. However, due to the high-dimensional feature space and high feature redundancy of gene expression data, SVM faces the problem of poor classification effect when dealing with such data. Methods: Based on this, this paper proposes a hybrid feature selection algorithm combining information gain and grouping particle swarm optimization (IG-GPSO). The algorithm firstly calculates the information gain values of the features and ranks them in descending order according to the value. Then, ranked features are grouped according to the information index, so that the features in the group are close, and the features outside the group are sparse. Finally, grouped features are searched using grouping PSO and evaluated according to in-group and out-group. Results: Experimental results show that the average accuracy (ACC) of the SVM on the feature subset selected by the IG-GPSO is 98.50%, which is significantly better than the traditional feature selection algorithm. Compared with KNN, the classification effect of the feature subset selected by the IG-GPSO is still optimal. In addition, the results of multiple comparison tests show that the feature selection effect of the IG-GPSO is significantly better than that of traditional feature selection algorithms. Conclusion: The feature subset selected by IG-GPSO not only has the best classification effect, but also has the least feature scale (FS). More importantly, the IG-GPSO significantly improves the ACC of SVM in cancer diagnostic. [ABSTRACT FROM AUTHOR]

In the realm of digital image applications, image processing technology occupies a pivotal position, with image segmentation serving as a foundational component. As the digital image application domain expands across industries, the conventional segmentation techniques increasingly challenge to cater to modern demands. To address this gap, this paper introduces an MCMC-based image segmentation algorithm based on the Markov Random Field (MRF) model, marking a significant stride in the field. The novelty of this research lies in its method that capitalizes on domain information in pixel space, amplifying the local segmentation precision of image segmentation algorithms. Further innovation is manifested in the development of an adaptive segmentation image denoising algorithm based on MCMC sampling. This algorithm not only elevates image segmentation outcomes, but also proficiently denoises the image. In the experimental results, MRF-MCMC achieves better segmentation performance, with an average segmentation accuracy of 94.26% in Lena images, significantly superior to other common image segmentation algorithms. In addition, the study proposes that the denoising model outperforms other algorithms in peak signal-to-noise ratio and structural similarity in environments with noise standard deviations of 15, 25, and 50. In essence, these experimental findings affirm the efficacy of this study, opening avenues for refining digital image segmentation methodologies. [ABSTRACT FROM AUTHOR]

Tomato is one of the most appreciated vegetables in the world. Predicting its yield and optimizing its culture is important for global food security. This paper addresses the challenge of finding optimum climatic values for a high tomato yield. The Frequent Pattern Growth (FPG) algorithm was considered to establish the associations between six climate variables: minimum and maximum temperatures, maximum humidity, sunshine (Sun), rainfall, and evapotranspiration (ET), collected over 26 years in the three agro-ecological Zones of Benin. Monthly climate data were aggregated with yield data over the same period. After aggregation, the data were transformed into 'low', 'medium', and 'high' attributes using the threshold values defined. Then, the rules were generated using the minimum support set to 0.2 and the confidence to 0.8. Only the rules with the consequence 'high yield' were screened. The best yield patterns were observed in the Guinean Zone, followed by the Sudanian. The results indicated that high tomato yield was associated with low ET in all areas considered. Minimum and maximum temperatures, maximum humidity, and Sun were medium in every Zone. Moreover, rainfall was high in the Sudanian Zone, unlike the other regions where it remained medium. These results are useful in assessing climate variability's impact on tomato production. Thus, they can help farmers make informed decisions on cultivation practices to optimize production in a changing environment. In addition, the findings of this study can be considered in other regions and adapted to other crops. [ABSTRACT FROM AUTHOR]

This paper presents a multi-algorithm fusion model (StackingGroup) based on the Stacking ensemble learning framework to address the variable selection problem in high-dimensional group structure data. The proposed algorithm takes into account the differences in data observation and training principles of different algorithms. It leverages the strengths of each model and incorporates Stacking ensemble learning with multiple group structure regularization methods. The main approach involves dividing the data set into K parts on average, using more than 10 algorithms as basic learning models, and selecting the base learner based on low correlation, strong prediction ability, and small model error. Finally, we selected the grSubset + grLasso, grLasso, and grSCAD algorithms as the base learners for the Stacking algorithm. The Lasso algorithm was used as the meta-learner to create a comprehensive algorithm called StackingGroup. This algorithm is designed to handle high-dimensional group structure data. Simulation experiments showed that the proposed method outperformed other R2, RMSE, and MAE prediction methods. Lastly, we applied the proposed algorithm to investigate the risk factors of low birth weight in infants and young children. The final results demonstrate that the proposed method achieves a mean absolute error (MAE) of 0.508 and a root mean square error (RMSE) of 0.668. The obtained values are smaller compared to those obtained from a single model, indicating that the proposed method surpasses other algorithms in terms of prediction accuracy. [ABSTRACT FROM AUTHOR]

The aim of this paper is to introduce and assess three algorithms for the identification of overlapping thematic structures in networks of papers. We implemented three recently proposed approaches to the identification of overlapping and hierarchical substructures in graphs and applied the corresponding algorithms to a network of 492 information-science papers coupled via their cited sources. The thematic substructures obtained and overlaps produced by the three hierarchical cluster algorithms were compared to a content-based categorisation, which we based on the interpretation of titles, abstracts, and keywords. We defined sets of papers dealing with three topics located on different levels of aggregation: h-index, webometrics, and bibliometrics. We identified these topics with branches in the dendrograms produced by the three cluster algorithms and compared the overlapping topics they detected with one another and with the three predefined paper sets. We discuss the advantages and drawbacks of applying the three approaches to paper networks in research fields. [ABSTRACT FROM AUTHOR]

This study focuses on the load balancing of the transactions in the blockchain. The problem is how to assign these transactions to the blocks. The objective is to guarantee a load balancing of the workload in the time of blocks. The proposed problem is an NP-hard one. To face the hardness of the studied problem, the challenge is to develop algorithms that solve the problem approximately. Finding an approximate solution is a real challenge. In this paper, nine algorithms are proposed. These algorithms are based on the dispatching-rules method, randomization approach, clustering algorithms, and iterative method. The proposed algorithms return approximate solutions in a remarkable time. In addition, in this paper, a novel architecture composed of blocks is proposed. This architecture adds the component "Balancer". This component is responsible to call the best-proposed algorithm and solve the scheduling problem in a polynomial time. In addition, the proposed work helps users to solve the problem of big data concurrency. These algorithms are coded and compared. The performance of these algorithms is tested over three classes of instances. These classes are generated based on uniform distribution. The total number of instances tested is 1350. The average gap, execution time, and the percentage of the best-reached value are used as metrics to measure the performance of the proposed algorithms. Experimental results show the performance of these algorithms and a comparison between them is discussed. The experimental results show that the best algorithm is best-mi-transactions iterative multi-choice with 93.9% in an average running time of 0.003 s. [ABSTRACT FROM AUTHOR]

The paper presents an algorithm to approach the problem of Maximum Clique Enumeration, a well known NP-hard problem that have several real world applications. The proposed solution, called LGP-MCE, exploits Geometric Deep Learning, a Machine Learning technique on graphs, to filter out nodes that do not belong to maximum cliques and then applies an exact algorithm to the pruned network. To assess the LGP-MCE, we conducted multiple experiments using a substantial dataset of real-world networks, varying in size, density, and other characteristics. We show that LGP-MCE is able to drastically reduce the running time, while retaining all the maximum cliques. [ABSTRACT FROM AUTHOR]

The Internet of Vehicles (IoV) is one of the developing paradigms that integrates the automotive industry with the Internet of Things (IoT). The evolution of traditional Vehicular Ad-hoc Networks (VANETs), which are a layered framework for Intelligent Transportation Systems (ITS), is employed to provide Quality of Service (QoS) to end users in hazardous situations. VANETs can set up ad-hoc networks and share information among themselves using Peer-to-Peer (P2P) communication. Dynamic properties in VANETs such as dynamic topology, node mobility, sparse vehicle distribution, and bandwidth constraints can have an impact on scalability, routing, and security. This can result in frequent link failures, instability, reliability, and QOS concerns, as well as the inherent complexity of NP-hard problems. Researchers have proposed several techniques to achieve stability; the most prominent one is clustering, which relies on mobility metrics. However, existing clustering techniques generate overwhelming clusters, resulting in greater resource consumption, communication overhead, and hop count, which may lead to increased latency. Therefore, the primary objective is to achieve stability by increasing cluster lifetime, which is accomplished by generating optimal clusters. A nature-inspired meta-heuristic algorithm titled African Vulture Optimization Based Clustering Algorithm (AVOCA) is implemented to achieve it. The proposed algorithm can achieve load optimization with efficient resource utilization by mitigating hidden node challenges and ensuring communication proficiency. By maintaining an equilibrium state between the exploration and exploitation phases, AVOCA avoids local optima. The paper explores a taxonomy of the techniques used in Cluster Head (CH) selection, coordination, and maintenance to achieve stability with lower communication costs. We evaluated the effectiveness of AVOCA using various network grid sizes, transmission ranges, and network nodes. The results show that AVOCA generates 40% less clusters when compared to the Clustering Algorithm Based on Moth-Flame Optimization for VANETs (CAMONET). AVOCA generates 45% less clusters when compared to Self-Adaptive Multi-Kernel Clustering for Urban VANETs (SAMNET), AVOCA generates 43% less clusters when compared to Intelligent Whale Optimization Algorithm (i-WOA) and AVOCA generates 38% less clusters when compared to Harris Hawks Optimization (HHO). The results show that AVOCA outperforms state-of-the-art algorithms in generating optimal clusters. [ABSTRACT FROM AUTHOR]

Google proposed a new TCP congestion control algorithm (CCA), Bottleneck Bandwidth and Round-trip propagation time (BBR) which has opened up new dimensions in congestion control. BBR tries to operate near Kleinrock's operating point to avoid excessive queue formation at the bottleneck and to use the link bandwidth optimally. BBR creates a model of the network path by measuring the bottleneck bandwidth and minimum round-trip time (RTT) to maximize the delivery rate and minimize latency. BBR v2 is an updated version of BBR which addresses many shortcomings of the original BBR (BBR v1) such as interprotocol fairness, RTT fairness, and excessive retransmissions. However, BBR v2 has certain limitations in its operation in IEEE 802.11ac (Wi-Fi 5) networks. The default BBR v2 limits the throughput of Wi-Fi 5 and an increased latency has been observed. This is because the Wi-Fi 5 frame aggregation logic is underutilized and fewer frames are being sent to the Wi-Fi 5 interface. In this paper, we have proposed BBR-n (BBR new) which provides better throughput than the generic BBR v2 in the Wi-Fi 5 networks. Real-time experiments were performed over a physical testbed using Flent to confirm that BBR-n achieves over double throughput as compared to generic BBR v2 and reduced latency in networks as compared to pure loss-based variants such as Cubic and Reno. [ABSTRACT FROM AUTHOR]

Existing Decision-Making Trial and Evaluation Laboratory (DEMATEL) methods are mostly suitable for simple systems with fewer factors, and lack effective integration of expert knowledge and experience from large-scale group populations, resulting in a potential compromise of the quality of the initial direct relation (IDR) matrix. To make DEMATEL better suited for the identification of critical factors in complex systems, this paper proposes a hierarchical DEMATEL method for large-scale group decision-making. Considering the limitations of expert knowledge and experience, a method based on expert consistency network for constructing the expert weight matrix is designed. The expert consistency network is constructed for different elements, and the weights of experts in different elements are determined using the clustering coefficient. Following the principles of the classic DEMATEL method, the steps for identifying key elements in complex systems using the large-scale group-hierarchical DEMATEL method are summarized. To objectively test the effectiveness and superiority of the decision algorithm, the robustness of the algorithm is analyzed in an interference environment. Finally, the superiority of the proposed method and algorithm is verified through a case study, which demonstrating that the proposed decision-making method is suitable for group decision-making in complex systems, with high algorithm stability and low algorithm deviation. [ABSTRACT FROM AUTHOR]

We present improved algorithms for the Steiner tree problem with the minimum number of Steiner points and bounded edge length. Given n terminal points in a 2D Euclidean plane and an edge length bound, the problem asks to construct a spanning tree of n terminal points with minimal Steiner points such that every edge length of the spanning tree is within the given bound. This problem is known to be NP-hard and has practical applications such as relay node placements in wireless networks, wavelength-division multiplexing(WDM) optimal network design, and VLSI design. The best-known deterministic approximation algorithm has O(n3) running time with an approximation ratio of 3. This paper proposes an efficient approximation algorithm using the Voronoi diagram that guarantees an approximation ratio of 3 in O(n log n) time. We also present the first exact algorithm to find an optimal Steiner tree for given three terminal points in constant time. Using this exact algorithm, we improve the 3-approximation algorithm with better performance regarding the number of required Steiner points in O(n log n) time. [ABSTRACT FROM AUTHOR]

Gene expression programming (GEP) is one of the most prominent algorithms in function mining. In order to obtain a more accurate function model in configuration parameters-execution efficiency (CP-EE) of map-reduce job in the high-speed railway catenary monitoring system, this paper proposes a novel algorithm, called GEP based on multi-strategy (MS-GEP). Compared to traditional GEP, the proposed algorithm can escape premature convergence and jump out of local optimum. First, an adaptive mutation rate is designed according to the evolutionary generations, population diversity, and individual fitness values. A manual intervention strategy is then proposed to determine whether the algorithm enters the dilemma of local optimum based on the generations of population evolutionary stagnation. Finally, the average quality of the population is changed by randomly replacing individuals, and the ancestral population is traced to change the evolutionary direction. The experimental results on the benchmarks of function mining show that the proposed MS-GEP has better solution quality and higher population diversity than other GEP algorithms. Furthermore, the proposed MS-GEP has higher accuracy on the function model of CP-EE of high-speed railway catenary monitoring system than other commonly used algorithms in the field of function mining. [ABSTRACT FROM AUTHOR]

Real-time and accurate detection of ships plays a vital role in ensuring navigation safety and ship supervision. Aiming at the problems of large parameters, large computation quantity, poor real-time performance, and high requirements for memory and computing power of the current ship detection model, this paper proposes a ship target detection algorithm MC-YOLOv5s based on YOLOv5s. First, the MobileNetV3-Small lightweight network is used to replace the original feature extraction backbone network of YOLOv5s to improve the detection speed of the algorithm. And then, a more efficient CNeB is designed based on the ConvNeXt-Block module of the ConvNeXt network to replace the original feature fusion module of YOLOv5s, which improves the spatial interaction ability of feature information and further reduces the complexity of the model. The experimental results obtained from the training and verification of the MC-YOLOv5s algorithm show that, compared with the original YOLOv5s algorithm, MC-YOLOv5s reduces the number of parameters by 6.98 MB and increases the mAP by about 3.4%. Even compared with other lightweight detection models, the improved model proposed in this paper still has better detection performance. The MC-YOLOv5s has been verified in the ship visual inspection and has great application potential. The code and models are publicly available at https://github.com/sakura994479727/datas. [ABSTRACT FROM AUTHOR]

Background: Oesophageal cancer has significant morbidity and mortality but late diagnosis is common since early signs of disease are frequently misinterpreted. Project DELTA aims to enable earlier detection and treatment through targeted screening using a novel risk prediction algorithm for oesophageal cancer (incorporating risk factors of Barrett's oesophagus including prescriptions for acid-reducing medications (CanPredict)), together with a non-invasive, low-cost sampling device (CytospongeTM). However, there are many barriers to implementation, and this paper identifies key ethical and legal challenges to implementing these personalised prevention strategies for Barrett's oesophagus/oesophageal cancer. Methods: To identify ethical and legal issues relevant to the deployment of a risk prediction tool for oesophageal cancer into primary care, we adopted an interdisciplinary approach, incorporating targeted informal literature reviews, interviews with expert collaborators, a multidisciplinary workshop and ethical and legal analysis. Results: Successful implementation raises many issues including ensuring transparency and effective risk communication; addressing bias and inequity; managing resources appropriately and avoiding exceptionalism. Clinicians will need support and training to use cancer risk prediction algorithms, ensuring that they understand how risk algorithms supplement rather than replace medical decision-making. Workshop participants had concerns about liability for harms arising from risk algorithms, including from potential bias and inequitable implementation. Determining strategies for risk communication enabling transparency but avoiding exceptionalist approaches are a significant challenge. Future challenges include using artificial intelligence to bolster risk assessment, incorporating genomics into risk tools, and deployment by non-health professional users. However, these strategies could improve detection and outcomes. Conclusions: Novel pathways incorporating risk prediction algorithms hold considerable promise, especially when combined with low-cost sampling. However immediate priorities should be to develop risk communication strategies that take account of using validated risk algorithms, and to ensure equitable implementation. Resolving questions about liability for harms arising should be a longer-term objective. [ABSTRACT FROM AUTHOR]

What3Words is a geocoding application that uses triples of words instead of alphanumeric coordinates to identify locations. What3Words has grown rapidly in popularity over the past few years and is used in logistical applications worldwide, including by emergency services. What3Words has also attracted criticism for being less reliable than claimed, in particular that the chance of confusing one address with another is high. This paper investigates these claims and shows that the What3Words algorithm for assigning addresses to grid boxes creates many pairs of confusable addresses, some of which are quite close together. The implications of this for the use of What3Words in critical or emergency situations is discussed. [ABSTRACT FROM AUTHOR]

Simultaneous Localization and Mapping (SLAM) technology is crucial for achieving spatial localization and autonomous navigation. Finding image features that are representative presents a key challenge in visual SLAM systems. The widely used ORB (Oriented FAST and Rotating BRIEF) algorithm achieves rapid image feature extraction. However, traditional ORB algorithms face issues such as dense, overlapping feature points, and imbalanced distribution, resulting in mismatches and redundancies. This paper introduces an image feature extraction algorithm called Adaptive Threshold and Local Gray Difference-ORB(ALGD-ORB) to address these limitations. Specifically, an adaptive threshold is employed to enhance feature point detection, and an improved quadtree method is used to homogenize feature point distribution. This method combines feature descriptors generated from both gray size and gray difference to enhance feature descriptor distinctiveness. By fusing these descriptors, their effectiveness is improved. Experimental results demonstrate that the ALGD-ORB algorithm significantly enhances the uniformity of feature point distribution compared to other algorithms, while maintaining accuracy and real-time performance. [ABSTRACT FROM AUTHOR]

Due to the unpredictability of the majority of green energy sources (GESs), particularly in microgrids (μGs), frequency deviations are unavoidable. These factors include solar irradiance, wind disturbances, and parametric uncertainty, all of which have a substantial impact on the system's frequency. An adaptive load frequency control (LFC) method for power systems is suggested in this paper to mitigate the aforementioned issues. For engineering challenges, soft computing methods like the bat algorithm (BA), where it proves its effectiveness in different applications, consistently produce positive outcomes, so it is used to address the LFC issue. For online gain tuning, an integral controller using an artificial BA is utilized, and this control method is supported by a modification known as the balloon effect (BE) identifier. Stability and robustness of analysis of the suggested BA+BE scheme is investigated. The system with the proposed adaptive frequency controller is evaluated in the case of step/random load demand. In addition, high penetrations of photovoltaic (PV) sources are considered. The standard integral controller and Jaya+BE, two more optimization techniques, have been compared with the suggested BA+BE strategy. According to the results of the MATLAB simulation, the suggested technique (BA+BE) has a significant advantage over other techniques in terms of maintaining frequency stability in the presence of step/random disturbances and PV source. The suggested method successfully keeps the frequency steady over I and Jaya+BE by 61.5% and 31.25%, respectively. In order to validate the MATLAB simulation results, real-time simulation tests are given utilizing a PC and a QUARC pid_e data acquisition card. [ABSTRACT FROM AUTHOR]

Patients must always communicate with their doctor for checking their health status. In recent years, wireless body sensor networks (WBSNs) has an important contribution in Healthcare. In these applications, energy-efficient and secure routing is really critical because health data of individuals must be forwarded to the destination securely to avoid unauthorized access by malicious nodes. However, biosensors have limited resources, especially energy. Recently, energy-efficient solutions have been proposed. Nevertheless, designing lightweight security mechanisms has not been stated in many schemes. In this paper, we propose a secure routing approach based on the league championship algorithm (LCA) for wireless body sensor networks in healthcare. The purpose of this scheme is to create a tradeoff between energy consumption and security. Our approach involves two important algorithms: routing process and communication security. In the first algorithm, each cluster head node (CH) applies the league championship algorithm to choose the most suitable next-hop CH. The proposed fitness function includes parameters like distance from CHs to the sink node, remaining energy, and link quality. In the second algorithm, we employs a symmetric encryption strategy to build secure connection links within a cluster. Also, we utilize an asymmetric cryptography scheme for forming secure inter-cluster connections. Network simulator version 2 (NS2) is used to implement the proposed approach. The simulation results show that our method is efficient in terms of consumed energy and delay. In addition, our scheme has good throughput, high packet delivery rate, and low packet loss rate. [ABSTRACT FROM AUTHOR]

Cross-domain object detection is a key problem in the research of intelligent detection models. Different from lots of improved algorithms based on two-stage detection models, we try another way. A simple and efficient one-stage model is introduced in this paper, comprehensively considering the inference efficiency and detection precision, and expanding the scope of undertaking cross-domain object detection problems. We name this gradient reverse layer-based model YOLO-G, which greatly improves the object detection precision in cross-domain scenarios. Specifically, we add a feature alignment branch following the backbone, where the gradient reverse layer and a classifier are attached. With only a small increase in computational, the performance is higher enhanced. Experiments such as Cityscapes→Foggy Cityscapes, SIM10k→Cityscape, PASCAL VOC→Clipart, and so on, indicate that compared with most state-of-the-art (SOTA) algorithms, the proposed model achieves much better mean Average Precision (mAP). Furthermore, ablation experiments were also performed on 4 components to confirm the reliability of the model. The project is available at https://github.com/airy975924806/yolo-G. [ABSTRACT FROM AUTHOR]

Smoke and fire detection technology is a key technology for automatically realizing forest monitoring and forest fire warning. One of the most popular algorithms for object detection tasks is YOLOv5. However, it suffers from some challenges, such as high computational load and limited detection performance. This paper proposes a high-performance lightweight network model for detecting forest smoke and fire based on YOLOv5 to overcome these problems. C3Ghost and Ghost modules are introduced into the Backbone and Neck network to achieve the purpose of reducing network parameters and improving the feature's expressing performance. Coordinate Attention (CA) module is introduced into the Backbone network to highlight the object's important information about smoke and fire and to suppress irrelevant background information. In Neck network part, in order to distinguish the importance of different features in feature fusing process, the weight parameter of feature fusion is added which is based on PAN (path aggregation network) structure, which is named PAN-weight. Multiple sets of controlled experiments were conducted to confirm the proposed method's performance. Compared with YOLOv5s, the proposed method reduced the model size and FLOPs by 44.75% and 47.46% respectively, while increased precision and mAP(mean average precision)@0.5 by 2.53% and 1.16% respectively. The experimental results demonstrated the usefulness and superiority of the proposed method. The core code and dataset required for the experiment are saved in this article at https://github.com/vinchole/zzzccc.git. [ABSTRACT FROM AUTHOR]

When there is an extensive number of inputs and outputs compared to the number of DMUs, one of the drawbacks of Data Envelopment Analysis appears, which incorrectly classifies inefficient DMUs, as efficient ones. Accordingly, the DEA ranking power becomes further moderated. To improve the ranking power, this paper renders the details of an algorithm that presents a model combining the Principal Component Analysis and the Slacks-Based Measure (PCA-SBM) which reduces the number of the incorrectly determined efficient DMUs. Also to complete ranking of DMUs, the algorithm presents a Super-Efficiency model integrated with PCA (PCA-Super SBM) which can rank the efficient DMUs (extreme and non-extreme). Whereas the most important previous models for ranking efficient units cannot rank non-extreme ones. Additionally, in most previous studies, DEA models combined with PCA fail to handle negative data, while, the presented models can cover this data. Two case studies (pharmaceutical companies listed on the Iranian stock market and bank branches) are manipulated to demonstrate the applicability and performance of the algorithm. To show the superiority of the presented models, the SBM model without PCA and the Super SBM model without PCA have been implemented on the data of both cases. In comparing the two methods (PCA-SBM and SBM), the PCA-SBM model has higher ranking power (five efficient DMUs versus nineteen in the case of pharmaceutical companies and four efficient DMUs versus twenty-nine in the case of bank branches). Also in comparing the PCA-Super SBM and Super SBM, the PCA-Super SBM model works more powerfully in complete ranking. As the Super SBM model cannot rank non-extreme units unlike the PCA-Super SBM. Consequently, the presented algorithm works successfully in ranking the DMUs completely (inefficient, extreme, and non-extreme efficient) with low complexity. [ABSTRACT FROM AUTHOR]

A novel breast ultrasound tomography system based on a circular array of capacitive micromechanical ultrasound transducers (CMUT) has broad application prospects. However, the images produced by this system are not suitable as input for the training phase of the super-resolution (SR) reconstruction algorithm. To solve the problem, this paper proposes an improved medical image super-resolution (MeSR) method based on the sparse domain. First, we use the simultaneous algebraic reconstruction technique (SART) with high imaging accuracy to reconstruct the image into a training image in a sparse domain model. Secondly, we denoise and enhance the contrast of the SART images to obtain improved detail images before training the dictionary. Then, we use the original detail image as the guide image to further process the improved detail image. Therefore, a high-precision dictionary was obtained during the testing phase and applied to filtered back projection SR reconstruction. We compared the proposed algorithm with previously reported algorithms in the Shepp Logan model and the model based on the CMUT background. The results showed significant improvements in peak signal-to-noise ratio, entropy, and average gradient compared to previously reported algorithms. The experimental results demonstrated that the proposed MeSR method can use noisy reconstructed images as input for the training phase of the SR algorithm and produce excellent visual effects. [ABSTRACT FROM AUTHOR]

A wireless MANET network is a grouping of wireless nodes that communicate without the use of a centralized network infrastructure. The lack of reliable elements, such as routers, as well as severe resource constraints, have an important impact on the performance of these networks. To improve the efficiency of MANET, intelligent routing algorithms are required; in fact, the design of a smart and efficient routing algorithm can significantly affect the efficiency of these networks. In this regard, this paper proposes an intelligent routing method for MANET networks based on (SOS) symbiotic organism search. The proposed method is implemented in dynamic environments by considering four important criteria: available bandwidth, remaining battery energy, mobility speed, and hop count. The simulation results show that the learning process of the symbionts search algorithm has a significant impact on network performance and outperforms the FBRP algorithms in terms of throughput rate, data loss rate, packet delivery rate, and the number of hops. [ABSTRACT FROM AUTHOR]

This paper proposes a novel hybrid algorithm, named Multi-Strategy Hybrid Harris Hawks Tunicate Swarm Optimization Algorithm (MSHHOTSA). The primary objective of MSHHOTSA is to address the limitations of the tunicate swarm algorithm, which include slow optimization speed, low accuracy, and premature convergence when dealing with complex problems. Firstly, inspired by the idea of the neighborhood and thermal distribution map, the hyperbolic tangent domain is introduced to modify the position of new tunicate individuals, which can not only effectively enhance the convergence performance of the algorithm but also ensure that the data generated between the unknown parameters and the old parameters have a similar distribution. Secondly, the nonlinear convergence factor is constructed to replace the original random factor c1 to coordinate the algorithm's local exploitation and global exploration performance, which effectively improves the ability of the algorithm to escape extreme values and fast convergence. Finally, the swarm update mechanism of the HHO algorithm is introduced into the position update of the TSA algorithm, which further balances the local exploitation and global exploration performance of the MSHHOTSA. The proposed algorithm was evaluated on eight standard benchmark functions, CEC2019 benchmark functions, four engineering design problems, and a PID parameter optimization problem. It was compared with seven recently proposed metaheuristic algorithms, including HHO and TSA. The results were analyzed and discussed using statistical indicators such as mean, standard deviation, Wilcoxon's rank sum test, and average running time. Experimental results demonstrate that the improved algorithm (MSHHOTSA) exhibits higher local convergence, global exploration, robustness, and universality than BOA, GWO, MVO, HHO, TSA, ASO, and WOA algorithms under the same experimental conditions. [ABSTRACT FROM AUTHOR]

Recommendation algorithms save a lot of valuable time for people to get the information they are interested in. However, the feature calculation and extraction process of each machine learning or deep learning recommendation algorithm are different, so how to obtain various features with different dimensions, i.e., how to integrate the advantages of each model and improve the model inference efficiency, becomes the focus of this paper. In this paper, a better deep learning model is obtained by integrating several cutting-edge deep learning models. Meanwhile, to make the integrated learning model converge better and faster, the parameters of the integrated module are initialized, constraints are imposed, and a new activation function is designed for better integration of the sub-models. Finally, the integrated large model is distilled for knowledge distillation, which greatly reduces the number of model parameters and improves the model inference efficiency. [ABSTRACT FROM AUTHOR]

The retrieval of important information from a dataset requires applying a special data mining technique known as data clustering (DC). DC classifies similar objects into a groups of similar characteristics. Clustering involves grouping the data around k-cluster centres that typically are selected randomly. Recently, the issues behind DC have called for a search for an alternative solution. Recently, a nature-based optimization algorithm named Black Hole Algorithm (BHA) was developed to address the several well-known optimization problems. The BHA is a metaheuristic (population-based) that mimics the event around the natural phenomena of black holes, whereby an individual star represents the potential solutions revolving around the solution space. The original BHA algorithm showed better performance compared to other algorithms when applied to a benchmark dataset, despite its poor exploration capability. Hence, this paper presents a multi-population version of BHA as a generalization of the BHA called MBHA wherein the performance of the algorithm is not dependent on the best-found solution but a set of generated best solutions. The method formulated was subjected to testing using a set of nine widespread and popular benchmark test functions. The ensuing experimental outcomes indicated the highly precise results generated by the method compared to BHA and comparable algorithms in the study, as well as excellent robustness. Furthermore, the proposed MBHA achieved a high rate of convergence on six real datasets (collected from the UCL machine learning lab), making it suitable for DC problems. Lastly, the evaluations conclusively indicated the appropriateness of the proposed algorithm to resolve DC issues. [ABSTRACT FROM AUTHOR]

In recommender systems, the lack of interaction data between users and items tends to lead to the problem of data sparsity and cold starts. Recently, the interest modeling frameworks incorporating multi-modal features are widely used in recommendation algorithms. These algorithms use image features and text features to extend the available information, which alleviate the data sparsity problem effectively, but they also have some limitations. On the one hand, multi-modal features of user interaction sequences are not considered in the interest modeling process. On the other hand, the aggregation of multi-modal features often employs simple aggregators, such as sums and concatenation, which do not distinguish the importance of different feature interactions. In this paper, to tackle this, we propose the FVTF (Fusing Visual and Textual Features) algorithm. First, we design a user history visual preference extraction module based on the Query-Key-Value attention to model users' historical interests by using of visual features. Second, we design a feature fusion and interaction module based on the multi-head bit-wise attention to adaptively mine important feature combinations and update the higher-order attention fusion representation of features. We conduct experiments on the Movielens-1M dataset, and the experiments show that FVTF achieved the best performance compared with the benchmark recommendation algorithms. [ABSTRACT FROM AUTHOR]

To address the problems of low accuracy and slow convergence of traditional multilevel image segmentation methods, a symmetric cross-entropy multilevel thresholding image segmentation method (MSIPOA) with multi-strategy improved pelican optimization algorithm is proposed for global optimization and image segmentation tasks. First, Sine chaotic mapping is used to improve the quality and distribution uniformity of the initial population. A spiral search mechanism incorporating a sine cosine optimization algorithm improves the algorithm's search diversity, local pioneering ability, and convergence accuracy. A levy flight strategy further improves the algorithm's ability to jump out of local minima. In this paper, 12 benchmark test functions and 8 other newer swarm intelligence algorithms are compared in terms of convergence speed and convergence accuracy to evaluate the performance of the MSIPOA algorithm. By non-parametric statistical analysis, MSIPOA shows a greater superiority over other optimization algorithms. The MSIPOA algorithm is then experimented with symmetric cross-entropy multilevel threshold image segmentation, and eight images from BSDS300 are selected as the test set to evaluate MSIPOA. According to different performance metrics and Fridman test, MSIPOA algorithm outperforms similar algorithms in global optimization and image segmentation, and the symmetric cross entropy of MSIPOA algorithm for multilevel thresholding image segmentation method can be effectively applied to multilevel thresholding image segmentation tasks. [ABSTRACT FROM AUTHOR]

This paper discusses the merging of two optimization algorithms, atom search optimization and particle swarm optimization, to create a hybrid algorithm called hybrid atom search particle swarm optimization (h-ASPSO). Atom search optimization is an algorithm inspired by the movement of atoms in nature, which employs interaction forces and neighbor interaction to guide each atom in the population. On the other hand, particle swarm optimization is a swarm intelligence algorithm that uses a population of particles to search for the optimal solution through a social learning process. The proposed algorithm aims to reach exploration-exploitation balance to improve search efficiency. The efficacy of h-ASPSO has been demonstrated in improving the time-domain performance of two high-order real-world engineering problems: the design of a proportional-integral-derivative controller for an automatic voltage regulator and a doubly fed induction generator-based wind turbine systems. The results show that h-ASPSO outperformed the original atom search optimization in terms of convergence speed and quality of solution and can provide more promising results for different high-order engineering systems without significantly increasing the computational cost. The promise of the proposed method is further demonstrated using other available competitive methods that are utilized for the automatic voltage regulator and a doubly fed induction generator-based wind turbine systems. [ABSTRACT FROM AUTHOR]

In this paper, a dynamic update algorithm of double scrambling-DNA row and column closed loop based on chaotic system is proposed. The classical scrambling and diffusion structure are used in the whole process. In the scrambling stage, a new pixel reconstruction method is proposed by combining the Hilbert curve with Knuth-Durstenfeld shuffle algorithm to overcome the shortcoming of nearby storage of Hilbert curve. This method reconstructs the pixel matrix of one-dimensional vector according to the Hilbert curve coding method, and achieves good scrambling effect, while reducing its time complexity and space complexity. In the diffusion stage, combining the plaintext row, the ciphertext row and the key row, and taking advantage of the parallel computing power and high storage density of the DNA encoding, the existing block diffusion operation is improved, and the two-round diffusion of the DNA encoding is proposed. When the last line of ciphertext is generated, the first line of ciphertext is updated and the closed-loop dynamic update of the encryption system is realized. Finally, SHA-256 is used to give the secret key and calculate the initial value of the chaotic system. The simulation results show that the "double scrambling-DNA row and column closed loop dynamic" update algorithm proposed in this paper can effectively improve the efficiency of information transmission and have high security. [ABSTRACT FROM AUTHOR]

The bin packing problem has a wide range of applications in industry. With the upgrade of the task difficulty, the traditional 2d rectangular layout algorithm can no longer meet the needs of modern industry, such as express packing task and exoplanet ore collection task. The express or ore samples come in heterogeneous shapes so they cannot all be treated as rectangular pieces. In this paper, we propose a three-stage method called covering, corner-searching and occupying (C,S&O) to solve the two-dimensional multishape part packing problem. The objective of the packing problem variant is to ensure maximum use of the raw material and minimize the trim loss. The algorithm cannot make use of information about the sequence of future objects that are going to arrive, only knowing the shape and size of the coming one, and the coming part must be packed into the bin immediately after its arrival without buffering or readjusting. The method of C,S&O hybridizes the idea of "gold corners, silver edges and grass belly" in the Chinese game Go and the method of finding picture corners in machine vision. In the first stage, the rectangular bin and the coming part are transformed into matrix representation, and generating the position matrix that indicates possible ways of packing the part into the bin. In the second stage, the suitable layout position of the coming part is obtained using machine vision image processing technology for reference. The third stage is calculating the environment matching degree to determine the current optimal placement orientation. In order to facilitate the display of the simulation results, only three shapes of parts are considered in the simulation, rectangle, circle and triangle. The experimental results show the effectiveness of this method. Consulting the literature, it is found that this paper is the first to propose a layout method for multishape manufacturing parts. [ABSTRACT FROM AUTHOR]