Search

Color correction is an important methodology where a digital image's colors undergo a transformation to more accurately represent their appearance using a predefined set of illumination conditions. Colorimetric measurements in diagnostics are sensitive to very small changes in colors and therefore require consistent, reproducible illumination conditions to produce accurate results, making color correction a necessity. This paper presents an image color correction pipeline developed by HueDx, Inc., using transfer algorithms that improve upon existing methodologies and demonstrates real-world applications of this pipeline in colorimetric clinical chemistry using a smartphone enabled, paper-based total protein diagnostic assay. Our pipeline is able to compensate for a variety of illumination conditions to provide consistent imaging for quantitative colorimetric measurements using white-balancing, multivariate gaussian distributions and histogram regression via dynamic, non-linear interpolating lookup tables. We empirically demonstrate that each point in the color correction pipeline provides a theoretical basis for achieving consistent and precise color correction. To show this, we measure color difference with deltaE (ΔE00), alongside quantifying performance of the HueDx color correction system, including the phone hardware, color sticker manufacturing quality and software correction capabilities. The results show that the HueDx color correction system is capable of restoring images to near-imperceptible levels of difference independent of their original illumination conditions including brightness and color temperature. Comparisons drawn from the paper-based total protein assay calibrated and quantified with and without using the HueDx color correction pipeline show that the coefficient of variation in precision testing is almost twice as high without color-correcting. Limits of blank, detection and quantitation were also higher without color-correction. Overall, we were able to demonstrate the HueDx platform improves reading and outcome of the total protein diagnostic assay and is useful for the development of smartphone-based quantitative colorimetric diagnostic assays for point-of-care testing., Competing Interests: Financial support for the development of this product was provided by HueDx,Inc., an early-stage venture-capital-backed company. All authors are employees of the company. The HueDx system, consisting of the color correction pipeline, HueCard(with custom sticker) and HueTools are commercially marketed products. Code for the color correction pipeline cannot be made available publicly due to legal restrictions., (Copyright: © 2024 Menon 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.)

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.

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.

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]

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

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]

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]

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]

Effective congestion control on the internet has been a problem since its inception. Transmission Control Protocol (TCP), being the most widely used transport layer protocol tries to mitigate it using a variety of congestion control algorithms. Cubic, Reno, and Bottleneck Bandwidth and Round-trip propagation time (BBR) are the most deployed congestion controls. BBR v2 is leading the congestion control race with its superior performance in terms of better throughput and lower latency. Furthermore, Active Queue Management (AQM) algorithms try to mitigate the congestion control at the network layer through active buffer control to avoid bufferbloat. The most efficient congestion control occurs when TCP and AQM work together. Indeed, it is the TCP-AQM algorithm "Golden pair" that can result in the most efficient performance. This paper proposes such a novel pair based on our previously tested and published BBR-n (BBR new) with the most effective of the modern AQMs, that completely gels together to provide lower latency in wireless networks based on Wireless N/AC. Real-time experiments were performed using Flent on our physical testbed with BBR-n and modern AQMs such as Fair Queuing (FQ), Constrained Delay (CoDel), Proportional Integral controller Enhanced (PIE), Common Applications Kept Enhanced (Cake) and Flow Queuing Controlled Delay (FQ_CoDel). Various tests done on our physical testbed helped us identify CAKE as the most optimum AQM that fits with our proposed BBR-n while providing optimum throughput and lower latency in 802.11N/AC-based wireless networks. [ABSTRACT FROM AUTHOR]

The unauthorized replication and distribution of digital images pose significant challenges to copyright protection. While existing solutions incorporate blockchain-based techniques such as perceptual hashing and digital watermarking, they lack large-scale experimental validation and a dedicated blockchain consensus protocol for image copyright management. This paper introduces DRPChain, a novel digital image copyright management system that addresses these issues. DRPChain employs an efficient cropping-resistant robust image hashing algorithm to defend against 14 common image attacks, demonstrating an 85% success rate in watermark extraction, 10% higher than the original scheme. Moreover, the paper designs the K-Raft consensus algorithm tailored for image copyright protection. Comparative experiments with Raft and benchmarking against PoW and PBFT algorithms show that K-Raft reduces block error rates by 2%, improves efficiency by 300ms compared to Raft, and exhibits superior efficiency,decentralization, and throughput compared to PoW and PBFT. These advantages make K-Raft more suitable for digital image copyright protection. This research contributes valuable insights into using blockchain technology for digital copyright protection, providing a solid foundation for future exploration. [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]

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]

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]

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]

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]

Heterogeneity of a probe image is one of the most complex challenges faced by researchers and implementers of current surveillance systems. This is due to existence of multiple cameras working in different spectral ranges in a single surveillance setup. This paper proposes two different approaches including spatial sparse representations (SSR) and frequency sparse representation (FSR) to recognize on-the-move heterogeneous face images with database of single sample per person (SSPP). SCface database, with five visual and two Infrared (IR) cameras, is taken as a benchmark for experiments, which is further confirmed using CASIA NIR-VIS 2.0 face database with 17580 visual and IR images. Similarity, comparison is performed for different scenarios such as, variation of distances from a camera and variation in sizes of face images and various visual and infrared (IR) modalities. Least square minimization based approach for finding the solution is used to match face images as it makes the recognition process simpler. A side by side comparison of both the proposed approaches with the state-of-the-art, classical, principal component analysis (PCA), kernel fisher analysis (KFA) and coupled kernel embedding (CKE) methods, along with modern low-rank preserving projection via graph regularized reconstruction (LRPP-GRR) method, is also presented. Experimental results suggest that the proposed approaches achieve superior performance., Competing Interests: “The authors show no conflict of interest. This does not alter our adherence to PLOS ONE policies on sharing data and materials.”, (Copyright: © 2024 Butt 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 paper, we investigate the generalized Langevin-Sturm-Liouville differential problems involving Caputo-Atangana-Baleanu fractional derivatives of higher orders with respect to another positive, increasing function denoted by ρ. The fixed point theorems in the framework of Kransnoselskii and Banach are utilized to discuss the existence and uniqueness of the results. In addition, the stability criteria of Ulam-Hyers, generalize Ulam-Hyers, Ulam-Hyers-Rassias, and generalize Ulam-Hyers-Rassias are investigated by non-linear analysis besides fractional calculus. Finally, illustrative examples are reinforced by tables and graphics to describe the main achievements., Competing Interests: The authors have declared that no competing interests exist., (Copyright: © 2024 Thabet 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 field of cryptography has grown significantly with the advent of information and communication technologies due to the increasing complexity of cyber threats and rising security requirements. This evolution has come with the creation of new cryptosystems and improvements to current ones. This study is the first to explore the RSA approach in the framework of t-intuitionistic fuzzy subgroups. This technique makes group-based cryptographic operations safer when there are unclear relationships and hesitations. This supports the complex and uncertain nature of subgroup membership, allowing for much more significant representations of the degrees of belonging, non-belonging, and hesitancy for the group elements along parameter 't'. The t-intuitionistic fuzzy RSA technique employs a t-intuitionistic fuzzy subgroup to address cryptosystem ambiguity, fuzziness, and imprecision. Consequently, inaccurate cryptographic data is more effectively represented, manipulated, and protected. Furthermore, this technique enhances the current level of fuzzy cryptography. The t-intuitionistic fuzzy RSA algorithms are of theoretical and practical value, as they significantly contribute towards developing fuzzy cryptography, fuzzy algebraic structures, and decision support systems. In this paper, the notions of t-intuitionistic fuzzy numbers and triangular t-intuitionistic fuzzy numbers are introduced. A new RSA cryptosystem based on a t-intuitionistic fuzzy subgroup is proposed in which the plaintext and the ciphertext are obtained in terms of t-intuitionistic fuzzy numbers and triangular t-intuitionistic fuzzy numbers. In addition, the significance of the concept of the t-intuitionistic fuzzy subgroup is highlighted as a suitable alternative tool to secure the data under consideration. In addition, the practical effect of the proposed methods is also investigated in this study. A mathematical mechanism is presented to implement the t-intuitionistic fuzzy RSA algorithm. Finally, a comparative analysis of the developed technique is presented with some existing methods to showcase the applicability and superiority of the recently developed method., Competing Interests: The authors have declared that no competing interests exist., (Copyright: © 2024 Alolaiyan 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 reduce the encoding complexity and stream size, improve the encoding performance and further improve the compression performance, the depth prediction partition encoding is studied in this paper. In terms of pattern selection strategy, optimization analysis is carried out based on fast strategic decision-making methods to ensure the comprehensiveness of data processing. In the design of adaptive strategies, different adaptive quantization parameter adjustment strategies are adopted for the equatorial and polar regions by considering the different levels of user attention in 360 degree virtual reality videos. The purpose is to achieve the optimal balance between distortion and stream size, thereby managing the output stream size while maintaining video quality. The results showed that this strategy achieved a maximum reduction of 2.92% in bit rate and an average reduction of 1.76%. The average coding time could be saved by 39.28%, and the average reconstruction quality was 0.043, with almost no quality loss detected by the audience. At the same time, the model demonstrated excellent performance in sequences of 4K, 6K, and 8K. The proposed deep partitioning adaptive strategy has significant improvements in video encoding quality and efficiency, which can improve encoding efficiency while ensuring video quality., Competing Interests: The authors have declared that no competing interests exist., (Copyright: © 2024 Yang 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.)

To cope with the well-known peaking phenomenon and noise sensitivity in the application of the High-Gain observer, a parameter tuning method based on the LPV/LMI approach for a 2nd-order cascade observer structure is proposed in this paper. Compared to other high-gain observer methods, this method can significantly reduce the infimum of gain in the observer, thereby reducing the peak phenomenon of state estimation and the influence of measurement output noise. By transforming the observer structure into a Luenberger-like structure, the parameters of the observer can be solved by one linear matrix inequality (LMI) with a high-gain effect or a 2n of LMI sets (LMIs) without a high-gain effect. Then by decomposing the nonlinear part of the system dynamics into high-dimensional and low-dimensional parts, we could solve the adjustable number [Formula: see text] of LMIs can be solved to obtain the result with limited high-gain effect. Stability analysis based on the Lyapunov method proves the convergence of this method, and the effectiveness of this method is verified through applications to one single-link mechanical arm model and a vehicle trajectory estimation application., 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.)

This paper presents a significant scheme to drive the numerical solution of multi-dimensional diffusion problems where the fractional derivatives are taken in Caputo sense. The Mohand homotopy integral transform scheme (MHITS) is the composition of Mohand integral transform (MIT) and the homotopy perturbation scheme (HPS) which can be used to investigate the numerical solution in the form of convergence series. This approach does not require any presumptions, limitations on elements, or any other hypothesis. The primary objective of this strategy is to perform its direct implementation to the recurrence relation. This method produces results in the form of a convergent series, which accurately predicts the exact results. Graphical results and plot error distribution show an excellent agreement between MHITS results and the exact solution., Competing Interests: The authors have declared that no competing interests exist., (Copyright: © 2024 Nadeem 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.)

A promising approach for scalable Gaussian processes (GPs) is the Karhunen-Loève (KL) decomposition, in which the GP kernel is represented by a set of basis functions which are the eigenfunctions of the kernel operator. Such decomposed kernels have the potential to be very fast, and do not depend on the selection of a reduced set of inducing points. However KL decompositions lead to high dimensionality, and variable selection thus becomes paramount. This paper reports a new method of forward variable selection, enabled by the ordered nature of the basis functions in the KL expansion of the Bayesian Smoothing Spline ANOVA kernel (BSS-ANOVA), coupled with fast Gibbs sampling in a fully Bayesian approach. It quickly and effectively limits the number of terms, yielding a method with competitive accuracies, training and inference times for tabular datasets of low feature set dimensionality. Theoretical computational complexities are [Formula: see text] in training and [Formula: see text] per point in inference, where N is the number of instances and P the number of expansion terms. The inference speed and accuracy makes the method especially useful for dynamic systems identification, by modeling the dynamics in the tangent space as a static problem, then integrating the learned dynamics using a high-order scheme. The methods are demonstrated on two dynamic datasets: a 'Susceptible, Infected, Recovered' (SIR) toy problem, along with the experimental 'Cascaded Tanks' benchmark dataset. Comparisons on the static prediction of time derivatives are made with a random forest (RF), a residual neural network (ResNet), and the Orthogonal Additive Kernel (OAK) inducing points scalable GP, while for the timeseries prediction comparisons are made with LSTM and GRU recurrent neural networks (RNNs) along with the SINDy package., Competing Interests: The authors have declared that no competing interests exist., (Copyright: © 2024 Hayes 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.)

On the basis of predecessors' coordination optimization of active and reactive power in distribution network, For the necessity of the optimal operation in the distribution network, part of power generated from photovoltaic (PV) cannot be sold to users, and cannot enjoy subsidies. Similarly, the network loss in the power transmission will also bring a certain economic loss. This paper comprehensively considers the economic loss caused by the network loss and PV abandon of the distribution system, and establishes a model to minimize the economic loss. To solve this problem efficiently, the method of DistFlow equation and mixed integer second order cone programming (MISOCP) is used to solve the problem, in this method, the original mixed integer nonlinear programming non-convex problem is transformed into a convex problem, which makes the optimization problem easy to solve. The modified IEEE 33 and IEEE 69 distribution networks are tested by the above method. The optimized results are able to meet the target and have very small relaxation gaps, and the voltage level is also optimized. This coordinated optimization approach helps to optimize the economic operation for active distribution networks with PVs., Competing Interests: The authors have declared that no competing interests exist., (Copyright: © 2024 Peng, Wang. 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.)

It is critical to identify and detect hazardous, flammable, explosive, and poisonous gases in the realms of industrial production and medical diagnostics. To detect and categorize a range of common hazardous gasses, we propose an attention-based Long Short term memory Full Convolutional network (ALSTM-FCN) in this paper. We adjust the network parameters of ALSTM-FCN using the Sparrow search algorithm (SSA) based on this, by comparison, SSA outperforms Particle Swarm Optimization (PSO) Algorithm, Genetic Algorithm (GA), Gray Wolf Optimization (GWO) Algorithm, Cuckoo Search (CS) Algorithm and other traditional optimization algorithms. We evaluate the model using University of California-Irvine (UCI) datasets and compare it with LSTM and FCN. The findings indicate that the ALSTM-FCN hybrid model has a better reliability test accuracy of 99.461% than both LSTM (89.471%) and FCN (96.083%). Furthermore, AdaBoost, logistic regression (LR), extra tree (ET), decision tree (DT), random forest (RF), K-nearest neighbor (KNN) and other models were trained. The suggested approach outperforms the conventional machine learning model in terms of gas categorization accuracy, according to experimental data. The findings indicate a potential for a broad range of polluting gas detection using the suggested ALSTM-FCN model, which is based on SSA optimization., Competing Interests: The authors have declared that no competing interests exist., (Copyright: © 2024 Kou 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 goal of dimension reduction tools is to construct a low-dimensional representation of high-dimensional data. These tools are employed for a variety of reasons such as noise reduction, visualization, and to lower computational costs. However, there is a fundamental issue that is discussed in other modeling problems that is often overlooked in dimension reduction-overfitting. In the context of other modeling problems, techniques such as feature-selection, cross-validation, and regularization are employed to combat overfitting, but rarely are such precautions taken when applying dimension reduction. Prior applications of the two most popular non-linear dimension reduction methods, t-SNE and UMAP, fail to acknowledge data as a combination of signal and noise when assessing performance. These methods are typically calibrated to capture the entirety of the data, not just the signal. In this paper, we demonstrate the importance of acknowledging noise when calibrating hyperparameters and present a framework that enables users to do so. We use this framework to explore the role hyperparameter calibration plays in overfitting the data when applying t-SNE and UMAP. More specifically, we show previously recommended values for perplexity and n_neighbors are too small and overfit the noise. We also provide a workflow others may use to calibrate hyperparameters in the presence of noise., Competing Interests: The authors have declared that no competing interests exist., (Copyright: © 2024 Lin, Fukuyama. 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 response to the rapidly evolving threat landscape in network security, this paper proposes an Evolutionary Machine Learning Algorithm designed for robust intrusion detection. We specifically address challenges such as adaptability to new threats and scalability across diverse network environments. Our approach is validated using two distinct datasets: BoT-IoT, reflecting a range of IoT-specific attacks, and UNSW-NB15, offering a broader context of network intrusion scenarios using GA based hybrid DT-SVM. This selection facilitates a comprehensive evaluation of the algorithm's effectiveness across varying attack vectors. Performance metrics including accuracy, recall, and false positive rates are meticulously chosen to demonstrate the algorithm's capability to accurately identify and adapt to both known and novel threats, thereby substantiating the algorithm's potential as a scalable and adaptable security solution. This study aims to advance the development of intrusion detection systems that are not only reactive but also preemptively adaptive to emerging cyber threats." During the feature selection step, a GA is used to discover and preserve the most relevant characteristics from the dataset by using evolutionary principles. Through the use of this technology based on genetic algorithms, the subset of features is optimised, enabling the subsequent classification model to focus on the most relevant components of network data. In order to accomplish this, DT-SVM classification and GA-driven feature selection are integrated in an effort to strike a balance between efficiency and accuracy. The system has been purposefully designed to efficiently handle data streams in real-time, ensuring that intrusions are promptly and precisely detected. The empirical results corroborate the study's assertion that the IDS outperforms traditional methodologies., Competing Interests: NO authors have competing interests., (Copyright: © 2024 Sharma 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.)

Medical image security is paramount in the digital era but remains a significant challenge. This paper introduces an innovative zero-watermarking methodology tailored for medical imaging, ensuring robust protection without compromising image quality. We utilize Sped-up Robust features for high-precision feature extraction and singular value decomposition (SVD) to embed watermarks into the frequency domain, preserving the original image's integrity. Our methodology uniquely encodes watermarks in a non-intrusive manner, leveraging the robustness of the extracted features and the resilience of the SVD approach. The embedded watermark is imperceptible, maintaining the diagnostic value of medical images. Extensive experiments under various attacks, including Gaussian noise, JPEG compression, and geometric distortions, demonstrate the methodology's superior performance. The results reveal exceptional robustness, with high Normalized Correlation (NC) and Peak Signal-to-noise ratio (PSNR) values, outperforming existing techniques. Specifically, under Gaussian noise and rotation attacks, the watermark retrieved from the encrypted domain maintained an NC value close to 1.00, signifying near-perfect resilience. Even under severe attacks such as 30% cropping, the methodology exhibited a significantly higher NC compared to current state-of-the-art methods., Competing Interests: The authors have declared that no competing interests exist., (Copyright: © 2024 Taj 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.)

Optimal resource allocation is crucial for 5G and beyond networks, especially when connecting numerous IoT devices. In this paper, user clustering and power allocation challenges in the downlink of a multi-carrier NOMA system are investigated, with sum rate as the optimization objective. The paper presents an iterative optimization process, starting with user clustering followed by power allocation of the users. Although the simultaneous transmission for multiple users achieves high system throughput in NOMA, it leads to more energy consumption, which is limited by the battery capacity of IoT devices. Enhancing energy efficiency by considering the QoS requirement is a primary challenge in NOMA-enabled IoT devices. Currently, fixed user clustering techniques are proposed without considering the diversity and heterogeneity of channels, leading to poor throughput performance. The proposed user clustering technique is based on the partial brute force search (P-BFS) method, which reduces complexity compared to the traditional exhaustive search method. After the user clustering, we performed optimal power allocation using the Lagrangian multiplier method with Karush-Kuhn-Tucker (KKT) optimal conditions for each user assigned to a subchannel in each cluster. Lastly, a deep neural network (DNN) based proposed P-BFS scheme is used to reduce resource allocation's complexity further. The simulation results show a significant improvement in the sum rate of the network., Competing Interests: The authors have declared that no competing interests exist., (Copyright: © 2024 Hamedoon 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 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., Competing Interests: The authors have declared that no competing interests exist., (Copyright: © 2024 Qian 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.)

Steganography, the use of algorithms to embed secret information in a carrier image, is widely used in the field of information transmission, but steganalysis tools built using traditional steganographic algorithms can easily identify them. Steganography without embedding (SWE) can effectively resist detection by steganography analysis tools by mapping noise onto secret information and generating secret images from secret noise. However, most SWE still have problems with the small capacity of steganographic data and the difficulty of extracting the data. Based on the above problems, this paper proposes image steganography without embedding carrier secret information. The objective of this approach is to enhance the capacity of secret information and the accuracy of secret information extraction for the purpose of improving the performance of security network communication. The proposed technique exploits the carrier characteristics to generate the carrier secret tensor, which improves the accuracy of information extraction while ensuring the accuracy of secret information extraction. Furthermore, the Wasserstein distance is employed as a constraint for the discriminator, and weight clipping is introduced to enhance the secret information capacity and extraction accuracy. Experimental results show that the proposed method can improve the data extraction accuracy by 10.03% at the capacity of 2304 bits, which verifies the effectiveness and universality of the method. The research presented here introduces a new intelligent information steganography secure communication model for secure communication in networks, which can improve the information capacity and extraction accuracy of image steganography without embedding., Competing Interests: The authors have declared that no competing interests exist., (Copyright: © 2024 Zhang 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 an optimization scheme for the layout of irregular warehouse spaces based on a class-based storage strategy. Firstly, we transform the irregular warehouse space into several regular rectangular areas. Next, through the class-based storage strategy, we develop an algorithm that converts the non-linear clustering problem of homogeneous shelves into a linear selection problem of different sized regular shelf areas. Finally, a comprehensive shelving clustering algorithm and packing problem with different box sizes selection were constructed, and empirical analysis was conducted based on actual data from Xiangtai Warehouse of State Grid Corporation of China. The results show that the new model not only effectively solves the irregular warehouse layout optimization problem under the class storage strategy but also reduces the complexity of the model and shortens the solution time. It is a universally applicable method with significant value for generalization., Competing Interests: The authors have declared that no competing interests exist., (Copyright: © 2024 Zhang 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 increasing public demand for fresh products has catalyzed the requirement for cold chain logistics distribution systems. However, challenges such as temperature control and delivery delays have led a significant product loss and increased costs. To improve the current situation, a novel approach to optimize cold chain logistics distribution for fresh products will be presented in the paper, utilizing a hybrid Tabu-Grey wolf optimizer (TGWO) algorithm. The proposed hybrid approach combines Tabu search (TS) and Grey wolf optimizer (GWO), employing TS for exploration and GWO for exploitation, aiming to minimize distribution costs in total and establish efficient vehicle scheduling schemes considering various constraints. The effectiveness of the TGWO algorithm is demonstrated through experiments and case studies compared to other heuristic algorithms. Comparative analysis against traditional optimization methods, including Particle swarm optimization (PSO), Whale optimization algorithm (WOA), and original GWO, highlights its superior efficiency and solution quality. This study contributes theories by demonstrating the efficacy of hybrid optimization techniques in complex supply chain networks and dynamic market environments. The practical implication lies in the implementation of TGWO to bolster distribution efficiency, cost reduction, and product quality maintenance throughout the logistics process, offering valuable insights for operational and strategic improvements by decision-makers. However, the study has limitations in generalizability and assumptions, suggesting future research areas including exploring new search operators, applying additional parameters, and using the algorithm in diverse real-life scenarios to improve its effectiveness and applicability., Competing Interests: The authors declare that there are no Competitive financial benefits and no conflict of interest., (Copyright: © 2024 Zhang 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 solve the problem of image quality and morphological characteristics of primary underglaze brown decorative pattern extraction, this paper proposes a method of primary underglaze brown decorative pattern extraction based on the coupling of single scale gamma correction and gray sharpening. The single-scale gamma correction is combined with the gray sharpening method. The single-scale gamma correction improves the contrast and brightness of the image by nonlinear transformation, but may lead to the loss of image detail. Gray sharpening can enhance the high frequency component and improve the clarity of the image, but it will introduce noise. Combining these two technologies can compensate for their shortcomings. The experimental results show that this method can improve the efficiency of last element underglaze brown decorative pattern extraction by enhancing the image retention detail and reducing the influence of noise. The experimental results showed that F1Score, Miou(%), Recall, Precision and Accuracy(%) were 0.92745, 0.82253, 0.97942, 0.92458 and 0.92745, respectively., Competing Interests: The authors have declared that no competing interests exist., (Copyright: © 2024 Fang 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.)

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., Competing Interests: NO authors have competing interests., (Copyright: © 2024 Maia 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.)