Search

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]

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]

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]

Traffic signs detection is an important and challenging task in intelligent driving perception system. This paper proposes an improved lightweight traffic signs detection framework based on YOLOv5. Firstly, the YOLOv5's backbone is replaced with ShuffleNet v2, which simplifies the calculation complexity and reduces the parameters of backbone network. Secondly, aiming at the problem of inconspicuous traffic sign characteristics in complex road environment, we use the CA attention mechanism in this paper to improve the saliency of the object. Finally, aiming at the large-scale difference between the traffic signs and the high proportion of small objects, we design the BCS-FPN to fuse multi-scale features and improve the representation ability of the small-scale objects. The TT-100K dataset is also analyzed and the dataset is collated. We test on the collated TT-100K dataset for the improved YOLOv5 in this paper. And the results show that compared with YOLOv5s, the mAP of our algorithm is equivalent to that of YOLOv5s, and the speed is improved by 20.8%. This paper also has carried on the experiment on embedded devices, experimental results show that our framework in computing power less embedded devices has a better effect. [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]

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]

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. [ABSTRACT FROM AUTHOR]

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. [ABSTRACT FROM AUTHOR]

The author discusses the factors which should be considered by researchers while writing research papers. Topics discussed include analyzing the logical flow of experiments, choosing a target audience or a right journal for delivering main messages of the research to them, and discussion of various aspects of a hypothesis pursued in the research. Also mentioned are a Nobel-Prize-winning paper on the DNA double helix structure, and objective reading of reviews of the papers.

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]

Author-supplied citations are a fraction of the related literature for a paper. The "related citations" on PubMed is typically dozens or hundreds of results long, and does not offer hints why these results are related. Using noun phrases derived from the sentences of the paper, we show it is possible to more transparently navigate to PubMed updates through search terms that can associate a paper with its citations. The algorithm to generate these search terms involved automatically extracting noun phrases from the paper using natural language processing tools, and ranking them by the number of occurrences in the paper compared to the number of occurrences on the web. We define search queries having at least one instance of overlap between the author-supplied citations of the paper and the top 20 search results as citation validated (CV). When the overlapping citations were written by same authors as the paper itself, we define it as CV-S and different authors is defined as CV-D. For a systematic sample of 883 papers on PubMed Central, at least one of the search terms for 86% of the papers is CV-D versus 65% for the top 20 PubMed "related citations." We hypothesize these quantities computed for the 20 million papers on PubMed to differ within 5% of these percentages. Averaged across all 883 papers, 5 search terms are CVD, and 10 search terms are CV-S, and 6 unique citations validate these searches. Potentially related literature uncovered by citation-validated searches (either CV-S or CV-D) are on the order of ten per paper - many more if the remaining searches that are not citation-validated are taken into account. The significance and relationship of each search result to the paper can only be vetted and explained by a researcher with knowledge of or interest in that paper. [ABSTRACT FROM AUTHOR]

In response to the vulnerability of image encryption techniques to chosen plaintext attacks, this paper proposes a secure image communication scheme based on two-layer dynamic feedback encryption and discrete wavelet transform (DWT) information hiding. The proposed scheme employs a plaintext correlation and intermediate ciphertext feedback mechanism, and combines chaotic systems, bit-level permutation, bilateral diffusion, and dynamic confusion to ensure the security and confidentiality of transmitted images. Firstly, a dynamically chaotic encryption sequence associated with a secure plaintext hash value is generated and utilized for the first round of bit-level permutation, bilateral diffusion, and dynamic confusion, resulting in an intermediate ciphertext image. Similarly, the characteristic values of the intermediate ciphertext image are used to generate dynamically chaotic encryption sequences associated with them. These sequences are then employed for the second round of bit-level permutation, bilateral diffusion, and dynamic confusion to gain the final ciphertext image. The ciphertext image hidden by DWT also provides efficient encryption, higher level of security and robustness to attacks. This technology offers indiscernible secret data insertion, rendering it challenging for assailants to spot or extract concealed information. By combining the proposed dynamic closed-loop feedback secure image encryption scheme based on the 2D-SLMM chaotic system with DWT-based hiding, a comprehensive and robust image encryption approach can be achieved. According to the results of theoretical research and experimental simulation, our encryption scheme has dynamic encryption effect and reliable security performance. The scheme is highly sensitive to key and plaintext, and can effectively resist various common encryption attacks and maintain good robustness. Therefore, our proposed encryption algorithm is an ideal digital image privacy protection technology, which has a wide range of practical application prospects. [ABSTRACT FROM AUTHOR]

The setting of parameter values will directly affect the performance of the neural network, and the manual parameter tuning speed is slow, and it is difficult to find the optimal combination of parameters. Based on this, this paper applies the improved Hunger Games search algorithm to find the optimal value of neural network parameters adaptively, and proposes an ATHGS-GoogleNet model. Firstly, adaptive weights and chaos mapping were integrated into the hunger search algorithm to construct a new algorithm, ATHGS. Secondly, the improved ATHGS algorithm was used to optimize the parameters of GoogleNet to construct a new model, ATHGS-GoogleNet. Finally, in order to verify the effectiveness of the proposed algorithm ATHGS and the model ATHGS-GoogleNet, a comparative experiment was set up. Experimental results show that the proposed algorithm ATHGS shows the best optimization performance in the three engineering experimental designs, and the accuracy of the proposed model ATHGS-GoogleNet reaches 98.1%, the sensitivity reaches 100%, and the precision reaches 99.5%. [ABSTRACT FROM AUTHOR]

To ensure optimal use of images while preserving privacy, it is necessary to partition the shared image into public and private areas, with public areas being openly accessible and private areas being shared in a controlled and privacy-preserving manner. Current works only facilitate image-level sharing and use common cryptographic algorithms. To ensure efficient, controlled, and privacy-preserving image sharing at the area level, this paper proposes an image partition security-sharing mechanism based on blockchain and chaotic encryption, which mainly includes a fine-grained access control method based on Attribute-Based Access Control (ABAC) and an image-specific chaotic encryption scheme. The proposed fine-grained access control method employs smart contracts based on the ABAC model to achieve automatic access control for private areas. It employs a Cuckoo filter-based transaction retrieval technique to enhance the efficiency of smart contracts in retrieving security attributes and policies on the blockchain. The proposed chaotic encryption scheme generates keys based on the private areas' security attributes, largely reducing the number of keys required. It also provides efficient encryption with vector operation acceleration. The security analysis and performance evaluation were conducted comprehensively. The results show that the proposed mechanism has lower time overhead than current works as the number of images increases. [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]

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]

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]

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]

In this paper, we introduce an innovative multivariable data fusion strategy for adaptive steady-state detection, specifically tailored for the alumina evaporation process. This approach is designed to counteract the production instabilities that often arise from frequent alterations in production conditions. At the core of our strategy is the application of an adaptive denoising algorithm based on the Gaussian filter, which adeptly eliminates erroneous data from selected variables without compromising the fidelity of the original signal. Subsequently, we implement a multivariable R-test methodology, integrated with the adaptive Gaussian filter, to conduct a thorough and precise steady-state detection via data fusion. The efficiency of this method is rigorously validated using actual data from industrial processes.Our findings reveal that this strategy markedly enhances the stability and efficiency (by 10%) of the alumina evaporation process, thereby offering a substantial contribution to the field. Moreover, the versatility of this approach suggests its potential applicability in a wide range of industrial settings, where similar production challenges prevail. This study not only advances the domain of process control but also underscores the significance of adaptive strategies in managing complex, variable-driven industrial operations. [ABSTRACT FROM AUTHOR]

Domain Generation Algorithms (DGAs) are used by malware to generate pseudorandom domain names to establish communication between infected bots and command and control servers. While DGAs can be detected by machine learning (ML) models with great accuracy, offering DGA detection as a service raises privacy concerns when requiring network administrators to disclose their DNS traffic to the service provider. The main scientific contribution of this paper is to propose the first end-to-end framework for privacy-preserving classification as a service of domain names into DGA (malicious) or non-DGA (benign) domains. Our framework achieves these goals by carefully designed protocols that combine two privacy-enhancing technologies (PETs), namely secure multi-party computation (MPC) and differential privacy (DP). Through MPC, our framework enables an enterprise network administrator to outsource the problem of classifying a DNS (Domain Name System) domain as DGA or non-DGA to an external organization without revealing any information about the domain name. Moreover, the service provider's ML model used for DGA detection is never revealed to the network administrator. Furthermore, by using DP, we also ensure that the classification result cannot be used to learn information about individual entries of the training data. Finally, we leverage post-training float16 quantization of deep learning models in MPC to achieve efficient, secure DGA detection. We demonstrate that by using quantization achieves a significant speed-up, resulting in a 23% to 42% reduction in inference runtime without reducing accuracy using a three party secure computation protocol tolerating one corruption. Previous solutions are not end-to-end private, do not provide differential privacy guarantees for the model's outputs, and assume that model embeddings are publicly known. Our best protocol in terms of accuracy runs in about 0.22s. [ABSTRACT FROM AUTHOR]

This paper introduces an innovative segmentation model that extends the U-Net architecture with a Squeeze and Excitation (SE) mechanism, designed to enhance the detection of moving objects in video streams. By integrating this model into the ViBe motion detection algorithm, we have significantly improved detection accuracy and reduced false positive rates. Our approach leverages adaptive techniques to increase the robustness of the segmentation model in complex scenarios, without requiring extensive manual parameter tuning. Despite the notable improvements, we recognize that further training is necessary to optimize the model for specific applications. The results indicate that our method provides a promising direction for real-time motion detection systems that require high precision and adaptability to varying conditions. [ABSTRACT FROM AUTHOR]

Path planning is a crucial element of mobile robotics applications, attracting considerable interest from academics. This paper presents a path-planning approach that utilises the Enhanced Firefly Algorithm (EFA), a new meta-heuristic technique. The Enhanced Firefly Algorithm (FA) differs from the ordinary FA by incorporating a linear reduction in the α parameter. This modification successfully resolves the constraints of the normal FA. The research involves experiments on three separate maps, using the regular FA and the suggested Enhanced FA in 20 different runs for each map. The evaluation criteria encompass the algorithms' ability to move from the initial location to the final position without experiencing any collisions. The assessment of path quality relies on elements such as the distance of the path and the algorithms' ability to converge and discover optimum solutions. The results demonstrate significant improvements made by the Enhanced FA, with a 10.270% increase in the shortest collision-free path for Map 1, a 0.371% increase for Map 2, and a 0.163% increase for Map 3, compared to the regular FA. This work highlights the effectiveness of the Enhanced Firefly Algorithm in optimising path planning for mobile robotics applications, providing potential improvements in navigation efficiency and collision avoidance. [ABSTRACT FROM AUTHOR]

Space-time fusion is an economical and efficient way to solve "space-time contradiction". Among all kinds of space-time fusion methods, Fit-FC space-time fusion method based on weight Function is widely used. However, this method is based on the linear model to depict the phase change, but the phase change in the real scene is complicated, and the linear model is difficult to accurately capture the phase change, resulting in the spectral distortion of the fusion image. In addition, pixel-by-pixel scanning with moving Windows leads to inefficiency issues, limiting its use in large-scale and long-term tasks. To overcome these limitations, this paper developed a simple and fast adaptive remote sensing image Spatio-Temporal fusion method based on Fit-FC, called Adapt Lasso-Fit-FC (AL-FF). Firstly, the sparse characteristics of time phase change between images are explored, and a time phase change estimation model based on sparse regression is constructed, which overcomes the fuzzy problem of fusion image caused by the failure of linear regression to capture complex nonlinear time phase transition in the weighted Function method, making the algorithm better at capturing details. Secondly, an adaptive window selection Function is established to overcome the problem of manually setting parameters on different data sets, improve the convenience of the algorithm and robustness of the application on different data sets, and make the algorithm simpler and more efficient. Finally, the improved AL-FF algorithm is compared with other algorithms to verify the performance improvement. Compared with the current advanced Spatio-Temporal fusion methods, AL-FF algorithm has stronger detail capture ability and can generate more accurate fusion results. In addition, the computational efficiency is significantly improved, and the efficiency is increased by more than 20 times compared with the current mainstream method. [ABSTRACT FROM AUTHOR]

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. [ABSTRACT FROM AUTHOR]

An improved algorithm based on Yolov8s is proposed to address the slower speed, higher number of parameters, and larger computational cost of deep learning in coal gangue target detection. A lightweight network, Fasternet, is used as the backbone to increase the speed of object detection and reduce the model complexity. By replacing Slimneck with the C2F part in the HEAD module, the aim is to reduce model complexity and improve detection accuracy. The detection accuracy is effectively improved by replacing the Detect layer with Detect-DyHead. The introduction of DIoU loss function instead of CIoU loss function and the combination of BAM block attention mechanism makes the model pay more attention to critical features, which further improves the detection performance. The results show that the improved model compresses the storage size of the model by 28%, reduces the number of parameters by 28.8%, reduces the computational effort by 34.8%, and improves the detection accuracy by 2.5% compared to the original model. The Yolov8s-change model provides a fast, real-time and efficient detection solution for gangue sorting. This provides a strong support for the intelligent sorting of coal gangue. [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]

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]

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]

The increasing use of mathematical techniques in scientific research leads to the interdisciplinarity of applied mathematics. This viewpoint is validated quantitatively here by statistical and network analysis on the corpus PNAS 1999–2013. A network describing the interdisciplinary relationships between disciplines in a panoramic view is built based on the corpus. Specific network indicators show the hub role of applied mathematics in interdisciplinary research. The statistical analysis on the corpus content finds that algorithms, a primary topic of applied mathematics, positively correlates, increasingly co-occurs, and has an equilibrium relationship in the long-run with certain typical research paradigms and methodologies. The finding can be understood as an intrinsic cause of the interdisciplinarity of applied mathematics. [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 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]

Map-matching technology is a key and difficult technology in the development of vehicle navigation systems. Only by correctly identifying the road segment on which the vehicle is traveling can the navigation system make the right decision. At the same time, the complexity of the road network structure and a variety of error factors have introduced great challenges to map matching and have attracted the attention of many researchers as well. This paper analyzes various map-matching algorithms, determines that the key to the matching performance is the junction matching, performs an in-depth study on the junction-matching problem, and puts forward the junction decision domain model. The model mainly involves information regarding the width of the road segment, the angle between two road segments, the accuracy of GPS and the accuracy of the road network. In this paper, we use this model to improve the map-matching algorithm based on a hidden Markov model (HMM). The experimental results show that the improved matching algorithm can effectively reduce the error rate of junction matching and improve the matching performance of a navigation system. [ABSTRACT FROM AUTHOR]

This paper, based on differential privacy protecting K-means clustering algorithm, realizes privacy protection by adding data-disturbing Laplace noise to cluster center point. In order to solve the problem of Laplace noise randomness which causes the center point to deviate, especially when poor availability of clustering results appears because of small privacy budget parameters, an improved differential privacy protecting K-means clustering algorithm was raised in this paper. The improved algorithm uses the contour coefficients to quantitatively evaluate the clustering effect of each iteration and add different noise to different clusters. In order to be adapted to the huge number of data, this paper provides an algorithm design in MapReduce Framework. Experimental finding shows that the new algorithm improves the availability of the algorithm clustering results under the condition of ensuring individual privacy without significantly increasing its operating time. [ABSTRACT FROM AUTHOR]

Recently, computational Grids have proven to be a good solution for processing large-scale, computation intensive problems. However, the heterogeneity, dynamics of resources and diversity of applications requirements have always been important factors affecting their performance. In response to these challenges, this work first builds a Grid job scheduling architecture that can dynamically monitor Grid computing center resources and make corresponding scheduling decisions. Second, a Grid job model is proposed to describe the application requirements. Third, this paper studies the characteristics of commercial interconnection networks used in Grids and forecast job transmission time. Fourth, this paper proposes an application-aware job scheduling mechanism (AJSM) that includes periodic scheduling flow and a heuristic application-aware deadline constraint job scheduling algorithm. The rigorous performance evaluation results clearly demonstrate that the proposed application-aware job scheduling mechanism can successful schedule more Grid jobs than the existing algorithms. For successful scheduled jobs, our proposed AJSM method is the best algorithm for job average processing time and makespan. [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]

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]

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]