Search

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.

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]

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]

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]

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 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]

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]

Fundamental scientific advances can take decades to translate into improvements in human health. Shortening this interval would increase the rate at which scientific discoveries lead to successful treatment of human disease. One way to accomplish this would be to identify which advances in knowledge are most likely to translate into clinical research. Toward that end, we built a machine learning system that detects whether a paper is likely to be cited by a future clinical trial or guideline. Despite the noisiness of citation dynamics, as little as 2 years of postpublication data yield accurate predictions about a paper's eventual citation by a clinical article (accuracy = 84%, F1 score = 0.56; compared to 19% accuracy by chance). We found that distinct knowledge flow trajectories are linked to papers that either succeed or fail to influence clinical research. Translational progress in biomedicine can therefore be assessed and predicted in real time based on information conveyed by the scientific community's early reaction to a paper. [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]

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]

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]

Evaluating the impact of a scholarly article is of great significance and has attracted great attentions. Although citation-based evaluation approaches have been widely used, these approaches face limitations e.g. in identifying anomalous citations patterns. This negligence would inevitably cause unfairness and inaccuracy to the article impact evaluation. In this study, in order to discover the anomalous citations and ensure the fairness and accuracy of research outcome evaluation, we investigate the citation relationships between articles using the following factors: collaboration times, the time span of collaboration, citing times and the time span of citing to weaken the relationship of Conflict of Interest (COI) in the citation network. Meanwhile, we study a special kind of COI, namely suspected COI relationship. Based on the COI relationship, we further bring forward the COIRank algorithm, an innovative scheme for accurately assessing the impact of an article. Our method distinguishes the citation strength, and utilizes PageRank and HITS algorithms to rank scholarly articles comprehensively. The experiments are conducted on the American Physical Society (APS) dataset. We find that about 80.88% articles contain contributed citations by co-authors in 26,366 articles and 75.55% articles among these articles are cited by the authors belonging to the same affiliation, indicating COI and suspected COI should not be ignored for evaluating impact of scientific papers objectively. Moreover, our experimental results demonstrate COIRank algorithm significantly outperforms the state-of-art solutions. The validity of our approach is verified by using the probability of Recommendation Intensity. [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 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]

Aiming at the problem that the SSD algorithm does not fully extract the feature information contained in each feature layer, as well as the feature information is easily lost during the sampling process, which makes the feature expression ineffective and leads to insufficient performance in small target detection. In this paper, AMT-SSD is proposed, a small target detection algorithm that incorporates the multi-branch stacking and new sampling transition module of the attention mechanism. In this algorithm, the composite attention mechanism is utilized to improve the correlation of features of the samples to be detected in terms of spatial and channels, and the efficiency of the algorithm; secondly, multi-branch stacking module is used to extract multi-size features for each feature layer, and different sizes of convolution kernels are utilized in parallel to fully extract their features and improve the expression of features; meanwhile, during the sampling process, the problem of missing features is solved by applying inverse subpixel convolution in the new sampling transition module. Experimentally, the AMT-SSD algorithm achieves 84.6% and 53.4% mAP metrics on the PASCAL VOC dataset and MS COCO dataset, respectively. This indicates that the AMT-SSD algorithm can effectively extract feature information that is beneficial to detection samples, and also performs well in reducing feature loss, which is effective for the algorithm to improve the algorithm on small targets., Competing Interests: The authors have declared that no competing interests exist., (Copyright: © 2024 Lin et al. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.)

As a widely studied model in the machine learning and data processing society, graph convolutional network reveals its advantage in non-grid data processing. However, existing graph convolutional networks generally assume that the node features can be fully observed. This may violate the fact that many real applications come with only the pairwise relationships and the corresponding node features are unavailable. In this paper, a novel graph convolutional network model based on Bayesian framework is proposed to handle the graph node classification task without relying on node features. First, we equip the graph node with the pseudo-features generated from the stochastic process. Then, a hidden space structure preservation term is proposed and embedded into the generation process to maintain the independent and identically distributed property between the training and testing dataset. Although the model inference is challenging, we derive an efficient training and predication algorithm using variational inference. Experiments on different datasets demonstrate the proposed graph convolutional networks can significantly outperform traditional methods, achieving an average performance improvement of 9%., Competing Interests: I have read the journal’s policy and the authors of this manuscript have the following competing interests: Our work was supported by National Natural Science Foundation of China under Grant 62006131, the National Natural Science Foundation of Zhejiang Province under Grant LQ21F020009, and the research project of College of Science and Technology, Ningbo University under Grant No. YK202214., (Copyright: © 2024 Luo et al. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.)

Jumping is an important task in skiing, snowboarding, ski jumping, figure skating, volleyball and many other sports. In these examples, jumping tasks are a performance criterion, and therefore detailed insight into them is important for athletes and coaches. Therefore, this paper aims to introduce a simple and easy-to-implement jump detection algorithm for skiing using acceleration data from inertial measurement units attached to ski boots. The algorithm uses the average of the absolute vertical accelerations of the two boots. We provide results for different parameter settings of the algorithm and two types of jumps: Big Air jumps and jumps during skiing. The latter are divided into small (time of flight < 500 ms) and medium (time of flight ≥ 500 ms) jumps. The algorithm detects 100% of Big Air, 94% of medium and 44% of small jumps. In addition, the settings with the highest detection rates also have the highest number of overdetected jumps. To resolve this conflict, a penalty-adjusted score that considers the number of overdetected jumps in the final performance analysis is proposed., Competing Interests: The authors have declared that no competing interests exist., (Copyright: © 2024 Kranzinger et al. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.)

This paper proposes a novel cache replacement technique based on the notion of combining periodic popularity prediction with size caching. The popularity, size, and time updates characteristics are used to calculate the value of each cache item. When it comes to content replacement, the information with the least value is first eliminated. Simulation results show that the proposed method outperforms the current algorithms in terms of cache hit rate and delay. The hit rate of the proposed scheme is 15.3% higher than GDS, 17.3% higher than MPC, 20.1% higher than LRU, 22.3% higher than FIFO, and 24.8% higher than LFU when 350 different categories of information are present. In real-world industrial applications such as including supply chain management, smart manufacturing, automation energy optimization, intelligent logistics transportation, and e-healthcare applications, it offers a foundation for the selection of caching algorithms., Competing Interests: The authors have declared that no competing interests exist., (Copyright: © 2024 Nalbant et al. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.)

The method of partial differential equations for image inpainting achieves better repair results and is economically feasible with fast repair time. Addresses the inability of Curvature-Driven Diffusion (CDD) models to repair complex textures or edges when the input image is affected by severe noise or distortion, resulting in discontinuous repair features, blurred detail textures, and an inability to deal with the consistency of global image content, In this paper, we have the CDD model of P-Laplace operator term to image inpainting. In this method, the P-Laplace operator is firstly introduced into the diffusion term of CDD model to regulate the diffusion speed; then the improved CDD model is discretized, and the known information around the broken region is divided into two weighted average iterations to get the inpainting image; finally, the final inpainting image is obtained by weighted averaging the two image inpainting images according to the distancing. Experiments show that the model restoration results in this paper are more rational in terms of texture structure and outperform other models in terms of visualization and objective data. Comparing the inpainting images with 150, 1000 and 100 iterations respectively, Total Variation(TV) model and the CDD model inpainting algorithm always has inpainting traces in details, and TV model can't meet the visual connectivity, but the algorithm in this paper can remove the inpainting traces well, TV model and the CDD model inpainting algorithm always have inpainting traces in details, and TV model can't meet the visual connectivity, but the algorithm in this paper can remove the inpainting traces well. Of the images used for testing, the highest PSNR reached 38.7982, SSIM reached 0.9407, and FSIM reached 0.9781, the algorithm not only inpainting the effect and, but also has fewer iterations., Competing Interests: All of authors have declared that no competing interests exist., (Copyright: © 2024 Xiao, Wu. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.)

Feature selection is an important solution for dealing with high-dimensional data in the fields of machine learning and data mining. In this paper, we present an improved mountain gazelle optimizer (IMGO) based on the newly proposed mountain gazelle optimizer (MGO) and design a binary version of IMGO (BIMGO) to solve the feature selection problem for medical data. First, the gazelle population is initialized using iterative chaotic map with infinite collapses (ICMIC) mapping, which increases the diversity of the population. Second, a nonlinear control factor is introduced to balance the exploration and exploitation components of the algorithm. Individuals in the population are perturbed using a spiral perturbation mechanism to enhance the local search capability of the algorithm. Finally, a neighborhood search strategy is used for the optimal individuals to enhance the exploitation and convergence capabilities of the algorithm. The superior ability of the IMGO algorithm to solve continuous problems is demonstrated on 23 benchmark datasets. Then, BIMGO is evaluated on 16 medical datasets of different dimensions and compared with 8 well-known metaheuristic algorithms. The experimental results indicate that BIMGO outperforms the competing algorithms in terms of the fitness value, number of selected features and sensitivity. In addition, the statistical results of the experiments demonstrate the significantly superior ability of BIMGO to select the most effective features in medical datasets., Competing Interests: The authors have declared that no competing interests exist., (Copyright: © 2024 Li et al. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.)

When large-scale electric vehicles are connected to the grid for unordered charging, it will seriously affect the stability and security of the power system. To solve this problem, this paper proposes a regional power network optimization scheduling method considering vehicle network interaction. Initially, based on the user behavior characteristics and charging and discharging characteristics of electric vehicles, a charging and discharging behavior model of electric vehicles was established. Based on the Monte Carlo sampling algorithm, the scheduling upper and lower limits of each scheduling cycle of electric vehicles were described, and the scheduling potential of each scheduling cycle of electric vehicles was obtained. Then, the electricity price is then used as an incentive parameter to guide EV users to charge during periods of low electricity prices and participate in discharge during periods of peak electricity prices. Aiming at the highest economic efficiency, the best consumption effect of new energy and the smoothest demand-side power curve of regional power grid, a three-objective optimal dispatching model was established. In the later stage, uncertainty factors are taken into consideration by introducing the concept of interval numbers, and an interval multi-objective optimization dispatching model is established. The two dispatching models are solved by NSGA-II algorithm and improved NSGA-II algorithm, and the Pareto solution set is obtained. Finally, based on the analytic Hierarchy Process (AHP), the optimal scheduling scheme is determined. The Monte Carlo sampling method is used to simulate the user side charging demand, and the effectiveness of this method is verified. In addition, the results of the interval multi-objective optimization model and the deterministic multi-objective optimization model are compared, and it is proved that the solution results of the interval multi-objective model are more adaptive, practical and robust to the uncertain factors., Competing Interests: The authors have declared that no competing interests exist., (Copyright: © 2024 Hua et al. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.)

In this research paper, we investigate the existence and uniqueness of solutions for neutral functional differential equations with sequential fractional orders, specifically involving the [Formula: see text]-Caputo operator. To obtain the desired results, we employ the Banach fixed point theorem (BFPT), a nonlinear variation of the Leray-Schauder fixed point theorem (SFPT), and the Krasnoselski fixed point theorem (KFPT). Additionally, we provide illustrative examples that demonstrate the key findings. Furthermore, we address a scenario where an initial value integral condition is considered., Competing Interests: The authors have declared that no competing interests exist., (Copyright: © 2024 Debbar et al. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.)

The rise of social media has changed how people view connections. Machine Learning (ML)-based sentiment analysis and news categorization help understand emotions and access news. However, most studies focus on complex models requiring heavy resources and slowing inference times, making deployment difficult in resource-limited environments. In this paper, we process both structured and unstructured data, determining the polarity of text using the TextBlob scheme to determine the sentiment of news headlines. We propose a Stochastic Gradient Descent (SGD)-based Ridge classifier (RC) for blending SGDR with an advanced string processing technique to effectively classify news articles. Additionally, we explore existing supervised and unsupervised ML algorithms to gauge the effectiveness of our SGDR classifier. The scalability and generalization capability of SGD and L2 regularization techniques in RCs to handle overfitting and balance bias and variance provide the proposed SGDR with better classification capability. Experimental results highlight that our string processing pipeline significantly boosts the performance of all ML models. Notably, our ensemble SGDR classifier surpasses all state-of-the-art ML algorithms, achieving an impressive 98.12% accuracy. McNemar's significance tests reveal that our SGDR classifier achieves a 1% significance level improvement over K-Nearest Neighbor, Decision Tree, and AdaBoost and a 5% significance level improvement over other algorithms. These findings underscore the superior proficiency of linear models in news categorization compared to tree-based and nonlinear counterparts. This study contributes valuable insights into the efficacy of the proposed methodology, elucidating its potential for news categorization and sentiment analysis., Competing Interests: Authors have no conflict of interest to declare., (Copyright: © 2024 Hasan et al. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.)

The burgeoning field of fog computing introduces a transformative computing paradigm with extensive applications across diverse sectors. At the heart of this paradigm lies the pivotal role of edge servers, which are entrusted with critical computing and storage functions. The optimization of these servers' storage capacities emerges as a crucial factor in augmenting the efficacy of fog computing infrastructures. This paper presents a novel storage optimization algorithm, dubbed LIRU (Low Interference Recently Used), which synthesizes the strengths of the LIRS (Low Interference Recency Set) and LRU (Least Recently Used) replacement algorithms. Set against the backdrop of constrained storage resources, this research endeavours to formulate an algorithm that optimizes storage space utilization, elevates data access efficiency, and diminishes access latencies. The investigation initiates a comprehensive analysis of the storage resources available on edge servers, pinpointing the essential considerations for optimization algorithms: storage resource utilization and data access frequency. The study then constructs an optimization model that harmonizes data frequency with cache capacity, employing optimization theory to discern the optimal solution for storage maximization. Subsequent experimental validations of the LIRU algorithm underscore its superiority over conventional replacement algorithms, showcasing significant improvements in storage utilization, data access efficiency, and reduced access delays. Notably, the LIRU algorithm registers a 5% increment in one-hop hit ratio relative to the LFU algorithm, a 66% enhancement over the LRU algorithm, and a 14% elevation in system hit ratio against the LRU algorithm. Moreover, it curtails the average system response time by 2.4% and 16.5% compared to the LRU and LFU algorithms, respectively, particularly in scenarios involving large cache sizes. This research not only sheds light on the intricacies of edge server storage optimization but also significantly propels the performance and efficiency of the broader fog computing ecosystem. Through these insights, the study contributes a valuable framework for enhancing data management strategies within fog computing architectures, marking a noteworthy advancement in the field., Competing Interests: The research software utilized in this study spans across all fields of computer and information science., (Copyright: © 2024 Zhao et al. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.)

Aiming at the problems of high stochasticity and volatility of power loads as well as the difficulty of accurate load forecasting, this paper proposes a power load forecasting method based on CEEMDAN (Completely Integrated Empirical Modal Decomposition) and TCN-LSTM (Temporal Convolutional Networks and Long-Short-Term Memory Networks). The method combines the decomposition of raw load data by CEEMDAN and the spatio-temporal modeling capability of TCN-LSTM model, aiming to improve the accuracy and stability of forecasting. First, the raw load data are decomposed into multiple linearly stable subsequences by CEEMDAN, and then the sample entropy is introduced to reorganize each subsequence. Then the reorganized sequences are used as inputs to the TCN-LSTM model to extract sequence features and perform training and prediction. The modeling prediction is carried out by selecting the electricity compliance data of New South Wales, Australia, and compared with the traditional prediction methods. The experimental results show that the algorithm proposed in this paper has higher accuracy and better prediction effect on load forecasting, which can provide a partial reference for electricity load forecasting methods., Competing Interests: The authors have declared that no competing interests exist., (Copyright: © 2024 Heng et al. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.)

Antennas play a crucial role in designing an efficient communication system. However, reducing the maximum sidelobe level (SLL) of the beam pattern is a crucial challenge in antenna arrays. Pattern synthesis in smart antennas is a major area of research because of its widespread application across various radar and communication systems. This paper presents an effective technique to minimize the SLL and thus improve the radiation pattern of the linear antenna array (LAA) using the chaotic inertia-weighted Wild Horse optimization (IERWHO) algorithm. The wild horse optimizer (WHO) is a new metaheuristic algorithm based on the social behavior of wild horses. The IERWHO algorithm is an improved Wild Horse optimization (WHO) algorithm that combines the concepts of chaotic sequence factor, nonlinear factor, and inertia weights factor. In this paper, the method is applied for the first time in antenna array synthesis by optimizing parameters such as inter-element spacing and excitation to minimize the SLL while keeping other constraints within the boundary limits, while ensuring that the performance is not affected. For performance evaluation, the simulation tests include 12 benchmark test functions and 12 test functions to verify the effectiveness of the improvement strategies. According to the encouraging research results in this paper, the IERWHO algorithm proposed has a place in the field of optimization., Competing Interests: The authors have declared that no competing interests exist., (Copyright: © 2024 Zhao et al. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.)

The role of knowledge graph encompasses the representation, organization, retrieval, reasoning, and application of knowledge, providing a rich and robust cognitive foundation for artificial intelligence systems and applications. When we learn new things, find out that some old information was wrong, see changes and progress happening, and adopt new technology standards, we need to update knowledge graphs. However, in some environments, the initial knowledge cannot be known. For example, we cannot have access to the full code of a software, even if we purchased it. In such circumstances, is there a way to update a knowledge graph without prior knowledge? In this paper, We are investigating whether there is a method for this situation within the framework of Dalal revision operators. We first proved that finding the optimal solution in this environment is a strongly NP-complete problem. For this purpose, we proposed two algorithms: Flaccid&#95;search and Tight&#95;search, which have different conditions, and we have proved that both algorithms can find the desired results., Competing Interests: The authors have declared that no competing interests exist., (Copyright: © 2024 Wang, Sun. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.)

The measurement of chemical oxygen demand (COD) is very important in the process of sewage treatment. The value of COD reflects the effectiveness and trend of sewage treatment to a certain extent, but obtaining accurate data requires high cost and labor intensity. To1 solve this problem, this paper proposes an online soft measurement method for COD based on Convolutional Neural Network-Bidirectional Long Short-Term Memory Network-Attention Mechanism (CNN-BiLSTM-Attention) algorithm. Firstly, by analyzing the mechanism of the aerobic tank stage in the Anaerobic-Anoxic-Oxic (A2O) wastewater treatment process, the selection range of input variables was preliminarily determined, and the collected sample dataset was subjected to correlation analysis. Finally, pH, dissolved oxygen (DO), electrical conductivity (EC), and water temperature (T) were determined as input variables for soft measurement prediction of COD.Then, based on the feature extraction ability of CNN and the advantage that BiLSTM is able to capture the backward and forward dependencies in time series data, combined with the attention mechanism that can assign higher weights to the key data, a CNN-BiLSTM-Attention algorithm model was established to soft measure COD in the effluent from the aerobic zone of the A2O wastewater treatment process. At the same time, root mean square error (RMSE), mean absolute error (MAE), mean absolute percentage error (MAPE) and coefficient of determination (R2) were utilized Three indicators were used to evaluate the model, and the results showed that the model can accurately predict the value of COD and has a high accuracy. At the same time, compared with models such as CNN-LSTM-Attention, CNN-BiLSTM, CNN-LSTM, LSTM, RNN, BP, SVM, XGBoost, and RF etc., the results showed that the CNN-BiLSTM Attention model performed the best, proving the superiority of the algorithm model.The Wilcoxon signed-rank test indicates significant differences between the CNN-BiLSTM-Attention model and other models., Competing Interests: The authors have declared that no competing interests exist., (Copyright: © 2024 Liu et al. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.)

Sketch maps are valuable tools used across various disciplines including spatial cognition, environmental psychology, and spatial reasoning. A common approach to evaluate sketch maps in research is to align and compare them with metric maps. However, sketch maps are highly abstract and contain generalized information causing difficulty in their alignment. Current approaches to study sketch maps cannot handle generalized information. They require a one-on-one correspondence between features in the metric map and features in the sketch map. But memory is often generalized. This paper makes two contributions to the research on sketch maps: (i) we present an algorithmic approach to detect generalization in sketch maps (ii) we present an online tool that creates a generalized metric map corresponding to features in sketch maps. Previously, we identified nine types of generalization in sketch maps. In this paper, we develop formal operators to detect these generalizations and implement them as an online tool. We evaluated our algorithm with a set of 11 sketch maps containing 84 instances of generalization. The results indicated that our algorithm consistently detects instances of generalization in sketch maps., Competing Interests: The authors have declared that no competing interests exist., (Copyright: © 2024 Manivannan et al. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.)

In order to handle second order lead processes with time delay, this paper provides a unique dominant pole placement based filtered PID controller design approach. This method does not require any finite term approximation like Pade to obtain the quasi-polynomial characteristic polynomial, arising due to the presence of the time delay term. The continuous time second order plus time delay systems with zero (SOPTDZ) are discretized using a pole-zero matching method with specified sampling time, where the transcendental exponential delay terms are converted into a finite number of poles. The pole-zero matching discretization approach with a predetermined sampling period is also used to discretize the continuous time filtered PID controller. As a result, it is not necessary to use any approximate discretization technique, such as Euler or Tustin, to derive the corresponding discrete time PID controller from its continuous time counterpart. The analytical expressions for discrete time dominant pole placement based filtered PID controllers are obtained using the coefficient matching approach, while two distinct kinds of non-dominant poles, namely all real and all complex conjugate, have been taken into consideration. The stabilizable region in the controller and design parameter space for the chosen class of linear second order time delay systems with lead is numerically approximated using the particle swarm optimization (PSO) based random search technique. The efficacy of the proposed method has been validated on a class of SOPTDZ systems including stable, integrating, unstable processes with minimum as well as non-minimum phase zeros., Competing Interests: The authors have declared that no competing interests exist., (Copyright: © 2024 Halder, Das. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.)

Deep learning, a subset of machine learning that utilizes neural networks, has seen significant advancements in recent years. These advancements have led to breakthroughs in a wide range of fields, from natural language processing to computer vision, and have the potential to revolutionize many industries or organizations. They have also demonstrated exceptional performance in the identification and mapping of seagrass images. However, these deep learning models, particularly the popular Convolutional Neural Networks (CNNs) require architectural engineering and hyperparameter tuning. This paper proposes a Deep Neuroevolutionary (DNE) model that can automate the architectural engineering and hyperparameter tuning of CNNs models by developing and using a novel metaheuristic algorithm, named 'Boosted Atomic Orbital Search (BAOS)'. The proposed BAOS is an improved version of the recently proposed Atomic Orbital Search (AOS) algorithm which is based on the principle of atomic model and quantum mechanics. The proposed algorithm leverages the power of the Lévy flight technique to boost the performance of the AOS algorithm. The proposed DNE algorithm (BAOS-CNN) is trained, evaluated and compared with six popular optimisation algorithms on a patch-based multi-species seagrass dataset. This proposed BAOS-CNN model achieves the highest overall accuracy (97.48%) among the seven evolutionary-based CNN models. The proposed model also achieves the state-of-the-art overall accuracy of 92.30% and 93.5% on the publicly available four classes and five classes version of the 'DeepSeagrass' dataset, respectively. This multi-species seagrass dataset is available at: https://ro.ecu.edu.au/datasets/141/., Competing Interests: The authors have declared that no competing interests exist., (Copyright: © 2024 Noman et al. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.)

This paper studied an integrated process planning and scheduling problem from a machining workshop for large-size valves in a valve manufacturing plant. Large-size valves usually contain several key parts and are generally produced in small-series production. Almost all the parts need to be manufactured in the same workshop at the same time in the plant. Facilities have to handle various items in one order, including different models, sizes, and types. It is a classical NP-hard problem on a large scale. An improved NSGA-II algorithm is suggested to obtain satisfactory solutions for makespan and manufacturing costs, which involve large optimization parameters and interactions. A two-section encoding method and an inserting greedy decoding method are chosen to enable the algorithm. The dynamic population update strategy based on dynamic population update and the adaptive mutation technique depending on the population entropy changing rate are selected for enhancing both the solution quality and population diversity. The methodology was successfully implemented in a real-life case at a major valve machining workshop operated by Yuanda Valve Company in China. By taking into account realistic factors and restrictions that have been identified from a real-world manufacturing setting, this technique aids in bridging the knowledge gap between present IPPS research and practical valve production implementations., Competing Interests: The authors have declared that no competing interests exist., (Copyright: © 2024 Wang et al. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.)

In traditional supply chain finance, the financing of enterprise mainly relies on the credit segmentation of the core enterprise, resulting in a short trust transmission radius and poor financing ability. The development of Internet technology, while expanding financing channels, has also seen an increasing severity in issues such as information fraud and data breaches, which has further aggravated the trust crisis in supply chain finance. This paper integrates blockchain technology into the industrial internet platform and analyzes the applicability of both in empowering supply chain financial trust. Then a supply chain financial trust framework, which emphasizes information sharing, data security, and trust circulation, is proposed. Furthermore, combined with the theories of Funk-SVD and entropy value, this paper designs a global trust evaluation mechanism that facilitates the trust circulation in supply chain finance and proposes a recommendation algorithm for global trust. With the testing conducted using the Epinions dataset, it is found that the algorithm proposed in this paper has a strong data dimensionality reduction and concentration ability, especially for large sample data, it can obtain more accurate evaluation values with less space occupation, thus enhancing the trust circulation ability of supply chain finance. Finally, the paper puts forward specific policy recommendations for the implementation of the supply chain finance information mechanism, aiming to better improve the financing accessibility of enterprises in supply chain, particularly small and medium-sized enterprises., Competing Interests: The authors have declared that no competing interests exist., (Copyright: © 2024 Jiang et al. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.)

Computer networks face vulnerability to numerous attacks, which pose significant threats to our data security and the freedom of communication. This paper introduces a novel intrusion detection technique that diverges from traditional methods by leveraging Recurrent Neural Networks (RNNs) for both data preprocessing and feature extraction. The proposed process is based on the following steps: (1) training the data using RNNs, (2) extracting features from their hidden layers, and (3) applying various classification algorithms. This methodology offers significant advantages and greatly differs from existing intrusion detection practices. The effectiveness of our method is demonstrated through trials on the Network Security Laboratory (NSL) and Canadian Institute for Cybersecurity (CIC) 2017 datasets, where the application of RNNs for intrusion detection shows substantial practical implications. Specifically, we achieved accuracy scores of 99.6% with Decision Tree, Random Forest, and CatBoost classifiers on the NSL dataset, and 99.8% and 99.9%, respectively, on the CIC 2017 dataset. By reversing the conventional sequence of training data with RNNs and then extracting features before applying classification algorithms, our approach provides a major shift in intrusion detection methodologies. This modification in the pipeline underscores the benefits of utilizing RNNs for feature extraction and data preprocessing, meeting the critical need to safeguard data security and communication freedom against ever-evolving network threats., Competing Interests: The authors have declared that no competing interests exist., (Copyright: © 2024 Khan et al. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.)

Multifractality is a concept that extends locally the usual ideas of fractality in a system. Nevertheless, the multifractal approaches used lack a multifractal dimension tied to an entropy index like the Shannon index. This paper introduces a generalized Shannon index (GSI) and demonstrates its application in understanding system fluctuations. To this end, traditional multifractality approaches are explained. Then, using the temporal Theil scaling and the diffusive trajectory algorithm, the GSI and its partition function are defined. Next, the multifractal exponent of the GSI is derived from the partition function, establishing a connection between the temporal Theil scaling exponent and the generalized Hurst exponent. Finally, this relationship is verified in a fractional Brownian motion and applied to financial time series. In fact, this leads us to proposing an approximation called local fractional Brownian motion approximation, where multifractal systems are viewed as a local superposition of distinct fractional Brownian motions with varying monofractal exponents. Also, we furnish an algorithm for identifying the optimal q-th moment of the probability distribution associated with an empirical time series to enhance the accuracy of generalized Hurst exponent estimation., Competing Interests: NO authors have competing interests., (Copyright: © 2024 Abril-Bermúdez et al. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.)

Unlike proteins, RNAs deposited in the Protein Data Bank do not contain topological knots. Recently, admittedly, the first trefoil knot and some lasso-type conformations have been found in experimental RNA structures, but these are still exceptional cases. Meanwhile, algorithms predicting 3D RNA models have happened to form knotted structures not so rarely. Interestingly, machine learning-based predictors seem to be more prone to generate knotted RNA folds than traditional methods. A similar situation is observed for the entanglements of structural elements. In this paper, we analyze all models submitted to the CASP15 competition in the 3D RNA structure prediction category. We show what types of topological knots and structure element entanglements appear in the submitted models and highlight what methods are behind the generation of such conformations. We also study the structural aspect of susceptibility to entanglement. We suggest that predictors take care of an evaluation of RNA models to avoid publishing structures with artifacts, such as unusual entanglements, that result from hallucinations of predictive algorithms., Competing Interests: The authors have declared that no competing interests exist., (Copyright: © 2024 Gren et al. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.)

Distance-based topological indices are numerical parameters that are derived from the distances between atoms in a molecular structure, and they provide a quantitative measure of the topology and geometry of a molecule. The distance-based topological indices uses to predict various properties of molecules, including their boiling points, melting points, and solubility. It also predicts the biological activity of molecules, including their pharmacological and toxicological properties. Pentagonal chain molecules are organic compounds that consist of a linear chain of five-membered (pentagons) connected by carbon and bonds. These molecules have unique structural and electronic properties that make them useful in a variety of applications. Motivated by the pentagonal chain molecules, we have considered a pentagonal chain graph and it is denoted by Pn. We have computed some distance based topological indices for Pn. The paper focuses on a pentagonal chain molecules denoted by G, and derives several distance-based topological indices. These indices compromise insights into physicochemical properties, aid in identifying structural characterizations, and enhance understanding of molecular properties., Competing Interests: The authors have declared that no competing interests exist., (Copyright: © 2024 Yu et al. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.)

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., Competing Interests: The authors hace declared that no competing interests exist., (Copyright: © 2024 Oh et al. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.)

Debris flow risk assessment can provide some reference for debris flow prevention and control projects. In risk assessment, researchers often only focus on the impact of objective or subjective indicators. For this purpose, this paper proposed a weight calculation method based on t-distribution and linear programming optimization algorithm (LPOA). Taking 72 mudslides in Beichuan County as an example, this paper used analytic hierarchy process (AHP), entropy weight method (EWM) and variation coefficient method (VCM) to obtain the initial weights. Based on the initial weights, weight intervals with different confidence levels were obtained by t-distribution. Subsequently, the final weights were obtained by LOPA in the 90% confidence interval. Finally, the final weights were used to calculate the risk score for each debris flow, thus delineating the level of risk for each debris flow. The results showed that this paper's method can avoid overemphasizing the importance of a particular indicator compared to EWM and VCM. In contrast, EWM and VCM ignored the effect of debris flow frequency on debris flow risk. The assessment results showed that the 72 debris flows in Beichuan County were mainly dominated by moderate and light risks. Of these, there were 8 high risk debris flows, 24 medium risk debris flows, and 40 light risk debris flows. The excellent triggering conditions provide favorable conditions for the formation of high-risk debris flows. Slightly and moderate risk debris flows are mainly located on both sides of highways and rivers, still posing a minor threat to Beichuan County. The proposed fusion weighting method effectively avoids the limitations of single weight calculating method. Through comparison and data analysis, the rationality of the proposed method is verified, which can provide some reference for combination weighting method and debris flow risk assessment., Competing Interests: The authors declare that the research was conducted in the absence of any commercial or financial relationships that could be construed as a potential conflict of interest., (Copyright: © 2024 Li et al. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.)

Low-Dose computer tomography (LDCT) is an ideal alternative to reduce radiation risk in clinical applications. Although supervised-deep-learning-based reconstruction methods have demonstrated superior performance compared to conventional model-driven reconstruction algorithms, they require collecting massive pairs of low-dose and norm-dose CT images for neural network training, which limits their practical application in LDCT imaging. In this paper, we propose an unsupervised and training data-free learning reconstruction method for LDCT imaging that avoids the requirement for training data. The proposed method is a post-processing technique that aims to enhance the initial low-quality reconstruction results, and it reconstructs the high-quality images by neural work training that minimizes the ℓ1-norm distance between the CT measurements and their corresponding simulated sinogram data, as well as the total variation (TV) value of the reconstructed image. Moreover, the proposed method does not require to set the weights for both the data fidelity term and the plenty term. Experimental results on the AAPM challenge data and LoDoPab-CT data demonstrate that the proposed method is able to effectively suppress the noise and preserve the tiny structures. Also, these results demonstrate the rapid convergence and low computational cost of the proposed method. The source code is available at https://github.com/linfengyu77/IRLDCT., Competing Interests: The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper., (Copyright: © 2024 Wang et al. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.)

Although adaptive cancer therapy shows promise in integrating evolutionary dynamics into treatment scheduling, the stochastic nature of cancer evolution has seldom been taken into account. Various sources of random perturbations can impact the evolution of heterogeneous tumors, making performance metrics of any treatment policy random as well. In this paper, we propose an efficient method for selecting optimal adaptive treatment policies under randomly evolving tumor dynamics. The goal is to improve the cumulative "cost" of treatment, a combination of the total amount of drugs used and the total treatment time. As this cost also becomes random in any stochastic setting, we maximize the probability of reaching the treatment goals (tumor stabilization or eradication) without exceeding a pre-specified cost threshold (or a "budget"). We use a novel Stochastic Optimal Control formulation and Dynamic Programming to find such "threshold-aware" optimal treatment policies. Our approach enables an efficient algorithm to compute these policies for a range of threshold values simultaneously. Compared to treatment plans shown to be optimal in a deterministic setting, the new "threshold-aware" policies significantly improve the chances of the therapy succeeding under the budget, which is correlated with a lower general drug usage. We illustrate this method using two specific examples, but our approach is far more general and provides a new tool for optimizing adaptive therapies based on a broad range of stochastic cancer models., Competing Interests: The authors have declared that no competing interests exist., (Copyright: © 2024 Wang et al. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.)

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., Competing Interests: The authors have declared that no competing interests exist., (Copyright: © 2024 Cai et al. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.)

Infrared target detection is widely used in industrial fields, such as environmental monitoring, automatic driving, etc., and the detection of weak targets is one of the most challenging research topics in this field. Due to the small size of these targets, limited information and less surrounding contextual information, it increases the difficulty of target detection and recognition. To address these issues, this paper proposes YOLO-ISTD, an improved method for infrared small target detection based on the YOLOv5-S framework. Firstly, we propose a feature extraction module called SACSP, which incorporates the Shuffle Attention mechanism and makes certain adjustments to the CSP structure, enhancing the feature extraction capability and improving the performance of the detector. Secondly, we introduce a feature fusion module called NL-SPPF. By introducing an NL-Block, the network is able to capture richer long-range features, better capturing the correlation between background information and targets, thereby enhancing the detection capability for small targets. Lastly, we propose a modified K-means clustering algorithm based on Distance-IoU (DIoU), called K-means&#95;DIOU, to improve the accuracy of clustering and generate anchors suitable for the task. Additionally, modifications are made to the detection heads in YOLOv5-S. The original 8, 16, and 32 times downsampling detection heads are replaced with 4, 8, and 16 times downsampling detection heads, capturing more informative coarse-grained features. This enables better understanding of the overall characteristics and structure of the targets, resulting in improved representation and localization of small targets. Experimental results demonstrate significant achievements of YOLO-ISTD on the NUST-SIRST dataset, with an improvement of 8.568% in mAP@0.5 and 8.618% in mAP@0.95. Compared to the comparative models, the proposed approach effectively addresses issues of missed detections and false alarms in the detection results, leading to substantial improvements in precision, recall, and model convergence speed., Competing Interests: The authors have declared that no competing interests exist., (Copyright: © 2024 Hao et al. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.)